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/proc_fs.h>
59 #include <linux/seq_file.h>
60 #include <linux/stop_machine.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>
74 #include <linux/slab.h>
75 #include <linux/cpuacct.h>
78 #include <asm/irq_regs.h>
80 #include "sched_cpupri.h"
81 #include "workqueue_sched.h"
83 #define CREATE_TRACE_POINTS
84 #include <trace/events/sched.h>
87 * Convert user-nice values [ -20 ... 0 ... 19 ]
88 * to static priority [ MAX_RT_PRIO..MAX_PRIO-1 ],
91 #define NICE_TO_PRIO(nice) (MAX_RT_PRIO + (nice) + 20)
92 #define PRIO_TO_NICE(prio) ((prio) - MAX_RT_PRIO - 20)
93 #define TASK_NICE(p) PRIO_TO_NICE((p)->static_prio)
96 * 'User priority' is the nice value converted to something we
97 * can work with better when scaling various scheduler parameters,
98 * it's a [ 0 ... 39 ] range.
100 #define USER_PRIO(p) ((p)-MAX_RT_PRIO)
101 #define TASK_USER_PRIO(p) USER_PRIO((p)->static_prio)
102 #define MAX_USER_PRIO (USER_PRIO(MAX_PRIO))
105 * Helpers for converting nanosecond timing to jiffy resolution
107 #define NS_TO_JIFFIES(TIME) ((unsigned long)(TIME) / (NSEC_PER_SEC / HZ))
109 #define NICE_0_LOAD SCHED_LOAD_SCALE
110 #define NICE_0_SHIFT SCHED_LOAD_SHIFT
113 * These are the 'tuning knobs' of the scheduler:
115 * default timeslice is 100 msecs (used only for SCHED_RR tasks).
116 * Timeslices get refilled after they expire.
118 #define DEF_TIMESLICE (100 * HZ / 1000)
121 * single value that denotes runtime == period, ie unlimited time.
123 #define RUNTIME_INF ((u64)~0ULL)
125 static inline int rt_policy(int policy)
127 if (unlikely(policy == SCHED_FIFO || policy == SCHED_RR))
132 static inline int task_has_rt_policy(struct task_struct *p)
134 return rt_policy(p->policy);
138 * This is the priority-queue data structure of the RT scheduling class:
140 struct rt_prio_array {
141 DECLARE_BITMAP(bitmap, MAX_RT_PRIO+1); /* include 1 bit for delimiter */
142 struct list_head queue[MAX_RT_PRIO];
145 struct rt_bandwidth {
146 /* nests inside the rq lock: */
147 raw_spinlock_t rt_runtime_lock;
150 struct hrtimer rt_period_timer;
153 static struct rt_bandwidth def_rt_bandwidth;
155 static int do_sched_rt_period_timer(struct rt_bandwidth *rt_b, int overrun);
157 static enum hrtimer_restart sched_rt_period_timer(struct hrtimer *timer)
159 struct rt_bandwidth *rt_b =
160 container_of(timer, struct rt_bandwidth, rt_period_timer);
166 now = hrtimer_cb_get_time(timer);
167 overrun = hrtimer_forward(timer, now, rt_b->rt_period);
172 idle = do_sched_rt_period_timer(rt_b, overrun);
175 return idle ? HRTIMER_NORESTART : HRTIMER_RESTART;
179 void init_rt_bandwidth(struct rt_bandwidth *rt_b, u64 period, u64 runtime)
181 rt_b->rt_period = ns_to_ktime(period);
182 rt_b->rt_runtime = runtime;
184 raw_spin_lock_init(&rt_b->rt_runtime_lock);
186 hrtimer_init(&rt_b->rt_period_timer,
187 CLOCK_MONOTONIC, HRTIMER_MODE_REL);
188 rt_b->rt_period_timer.function = sched_rt_period_timer;
191 static inline int rt_bandwidth_enabled(void)
193 return sysctl_sched_rt_runtime >= 0;
196 static void start_rt_bandwidth(struct rt_bandwidth *rt_b)
200 if (!rt_bandwidth_enabled() || rt_b->rt_runtime == RUNTIME_INF)
203 if (hrtimer_active(&rt_b->rt_period_timer))
206 raw_spin_lock(&rt_b->rt_runtime_lock);
211 if (hrtimer_active(&rt_b->rt_period_timer))
214 now = hrtimer_cb_get_time(&rt_b->rt_period_timer);
215 hrtimer_forward(&rt_b->rt_period_timer, now, rt_b->rt_period);
217 soft = hrtimer_get_softexpires(&rt_b->rt_period_timer);
218 hard = hrtimer_get_expires(&rt_b->rt_period_timer);
219 delta = ktime_to_ns(ktime_sub(hard, soft));
220 __hrtimer_start_range_ns(&rt_b->rt_period_timer, soft, delta,
221 HRTIMER_MODE_ABS_PINNED, 0);
223 raw_spin_unlock(&rt_b->rt_runtime_lock);
226 #ifdef CONFIG_RT_GROUP_SCHED
227 static void destroy_rt_bandwidth(struct rt_bandwidth *rt_b)
229 hrtimer_cancel(&rt_b->rt_period_timer);
234 * sched_domains_mutex serializes calls to arch_init_sched_domains,
235 * detach_destroy_domains and partition_sched_domains.
237 static DEFINE_MUTEX(sched_domains_mutex);
239 #ifdef CONFIG_CGROUP_SCHED
241 #include <linux/cgroup.h>
245 static LIST_HEAD(task_groups);
247 /* task group related information */
249 struct cgroup_subsys_state css;
251 #ifdef CONFIG_FAIR_GROUP_SCHED
252 /* schedulable entities of this group on each cpu */
253 struct sched_entity **se;
254 /* runqueue "owned" by this group on each cpu */
255 struct cfs_rq **cfs_rq;
256 unsigned long shares;
259 #ifdef CONFIG_RT_GROUP_SCHED
260 struct sched_rt_entity **rt_se;
261 struct rt_rq **rt_rq;
263 struct rt_bandwidth rt_bandwidth;
267 struct list_head list;
269 struct task_group *parent;
270 struct list_head siblings;
271 struct list_head children;
274 #define root_task_group init_task_group
276 /* task_group_lock serializes add/remove of task groups and also changes to
277 * a task group's cpu shares.
279 static DEFINE_SPINLOCK(task_group_lock);
281 #ifdef CONFIG_FAIR_GROUP_SCHED
284 static int root_task_group_empty(void)
286 return list_empty(&root_task_group.children);
290 # define INIT_TASK_GROUP_LOAD NICE_0_LOAD
293 * A weight of 0 or 1 can cause arithmetics problems.
294 * A weight of a cfs_rq is the sum of weights of which entities
295 * are queued on this cfs_rq, so a weight of a entity should not be
296 * too large, so as the shares value of a task group.
297 * (The default weight is 1024 - so there's no practical
298 * limitation from this.)
301 #define MAX_SHARES (1UL << 18)
303 static int init_task_group_load = INIT_TASK_GROUP_LOAD;
306 /* Default task group.
307 * Every task in system belong to this group at bootup.
309 struct task_group init_task_group;
311 #endif /* CONFIG_CGROUP_SCHED */
313 /* CFS-related fields in a runqueue */
315 struct load_weight load;
316 unsigned long nr_running;
321 struct rb_root tasks_timeline;
322 struct rb_node *rb_leftmost;
324 struct list_head tasks;
325 struct list_head *balance_iterator;
328 * 'curr' points to currently running entity on this cfs_rq.
329 * It is set to NULL otherwise (i.e when none are currently running).
331 struct sched_entity *curr, *next, *last;
333 unsigned int nr_spread_over;
335 #ifdef CONFIG_FAIR_GROUP_SCHED
336 struct rq *rq; /* cpu runqueue to which this cfs_rq is attached */
339 * leaf cfs_rqs are those that hold tasks (lowest schedulable entity in
340 * a hierarchy). Non-leaf lrqs hold other higher schedulable entities
341 * (like users, containers etc.)
343 * leaf_cfs_rq_list ties together list of leaf cfs_rq's in a cpu. This
344 * list is used during load balance.
346 struct list_head leaf_cfs_rq_list;
347 struct task_group *tg; /* group that "owns" this runqueue */
351 * the part of load.weight contributed by tasks
353 unsigned long task_weight;
356 * h_load = weight * f(tg)
358 * Where f(tg) is the recursive weight fraction assigned to
361 unsigned long h_load;
364 * this cpu's part of tg->shares
366 unsigned long shares;
369 * load.weight at the time we set shares
371 unsigned long rq_weight;
376 /* Real-Time classes' related field in a runqueue: */
378 struct rt_prio_array active;
379 unsigned long rt_nr_running;
380 #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED
382 int curr; /* highest queued rt task prio */
384 int next; /* next highest */
389 unsigned long rt_nr_migratory;
390 unsigned long rt_nr_total;
392 struct plist_head pushable_tasks;
397 /* Nests inside the rq lock: */
398 raw_spinlock_t rt_runtime_lock;
400 #ifdef CONFIG_RT_GROUP_SCHED
401 unsigned long rt_nr_boosted;
404 struct list_head leaf_rt_rq_list;
405 struct task_group *tg;
412 * We add the notion of a root-domain which will be used to define per-domain
413 * variables. Each exclusive cpuset essentially defines an island domain by
414 * fully partitioning the member cpus from any other cpuset. Whenever a new
415 * exclusive cpuset is created, we also create and attach a new root-domain
422 cpumask_var_t online;
425 * The "RT overload" flag: it gets set if a CPU has more than
426 * one runnable RT task.
428 cpumask_var_t rto_mask;
431 struct cpupri cpupri;
436 * By default the system creates a single root-domain with all cpus as
437 * members (mimicking the global state we have today).
439 static struct root_domain def_root_domain;
444 * This is the main, per-CPU runqueue data structure.
446 * Locking rule: those places that want to lock multiple runqueues
447 * (such as the load balancing or the thread migration code), lock
448 * acquire operations must be ordered by ascending &runqueue.
455 * nr_running and cpu_load should be in the same cacheline because
456 * remote CPUs use both these fields when doing load calculation.
458 unsigned long nr_running;
459 #define CPU_LOAD_IDX_MAX 5
460 unsigned long cpu_load[CPU_LOAD_IDX_MAX];
461 unsigned long last_load_update_tick;
464 unsigned char nohz_balance_kick;
466 unsigned int skip_clock_update;
468 /* capture load from *all* tasks on this cpu: */
469 struct load_weight load;
470 unsigned long nr_load_updates;
476 #ifdef CONFIG_FAIR_GROUP_SCHED
477 /* list of leaf cfs_rq on this cpu: */
478 struct list_head leaf_cfs_rq_list;
480 #ifdef CONFIG_RT_GROUP_SCHED
481 struct list_head leaf_rt_rq_list;
485 * This is part of a global counter where only the total sum
486 * over all CPUs matters. A task can increase this counter on
487 * one CPU and if it got migrated afterwards it may decrease
488 * it on another CPU. Always updated under the runqueue lock:
490 unsigned long nr_uninterruptible;
492 struct task_struct *curr, *idle;
493 unsigned long next_balance;
494 struct mm_struct *prev_mm;
501 struct root_domain *rd;
502 struct sched_domain *sd;
504 unsigned long cpu_power;
506 unsigned char idle_at_tick;
507 /* For active balancing */
511 struct cpu_stop_work active_balance_work;
512 /* cpu of this runqueue: */
516 unsigned long avg_load_per_task;
524 /* calc_load related fields */
525 unsigned long calc_load_update;
526 long calc_load_active;
528 #ifdef CONFIG_SCHED_HRTICK
530 int hrtick_csd_pending;
531 struct call_single_data hrtick_csd;
533 struct hrtimer hrtick_timer;
536 #ifdef CONFIG_SCHEDSTATS
538 struct sched_info rq_sched_info;
539 unsigned long long rq_cpu_time;
540 /* could above be rq->cfs_rq.exec_clock + rq->rt_rq.rt_runtime ? */
542 /* sys_sched_yield() stats */
543 unsigned int yld_count;
545 /* schedule() stats */
546 unsigned int sched_switch;
547 unsigned int sched_count;
548 unsigned int sched_goidle;
550 /* try_to_wake_up() stats */
551 unsigned int ttwu_count;
552 unsigned int ttwu_local;
555 unsigned int bkl_count;
559 static DEFINE_PER_CPU_SHARED_ALIGNED(struct rq, runqueues);
562 void check_preempt_curr(struct rq *rq, struct task_struct *p, int flags)
564 rq->curr->sched_class->check_preempt_curr(rq, p, flags);
567 * A queue event has occurred, and we're going to schedule. In
568 * this case, we can save a useless back to back clock update.
570 if (test_tsk_need_resched(p))
571 rq->skip_clock_update = 1;
574 static inline int cpu_of(struct rq *rq)
583 #define rcu_dereference_check_sched_domain(p) \
584 rcu_dereference_check((p), \
585 rcu_read_lock_sched_held() || \
586 lockdep_is_held(&sched_domains_mutex))
589 * The domain tree (rq->sd) is protected by RCU's quiescent state transition.
590 * See detach_destroy_domains: synchronize_sched for details.
592 * The domain tree of any CPU may only be accessed from within
593 * preempt-disabled sections.
595 #define for_each_domain(cpu, __sd) \
596 for (__sd = rcu_dereference_check_sched_domain(cpu_rq(cpu)->sd); __sd; __sd = __sd->parent)
598 #define cpu_rq(cpu) (&per_cpu(runqueues, (cpu)))
599 #define this_rq() (&__get_cpu_var(runqueues))
600 #define task_rq(p) cpu_rq(task_cpu(p))
601 #define cpu_curr(cpu) (cpu_rq(cpu)->curr)
602 #define raw_rq() (&__raw_get_cpu_var(runqueues))
604 #ifdef CONFIG_CGROUP_SCHED
607 * Return the group to which this tasks belongs.
609 * We use task_subsys_state_check() and extend the RCU verification
610 * with lockdep_is_held(&task_rq(p)->lock) because cpu_cgroup_attach()
611 * holds that lock for each task it moves into the cgroup. Therefore
612 * by holding that lock, we pin the task to the current cgroup.
614 static inline struct task_group *task_group(struct task_struct *p)
616 struct cgroup_subsys_state *css;
618 css = task_subsys_state_check(p, cpu_cgroup_subsys_id,
619 lockdep_is_held(&task_rq(p)->lock));
620 return container_of(css, struct task_group, css);
623 /* Change a task's cfs_rq and parent entity if it moves across CPUs/groups */
624 static inline void set_task_rq(struct task_struct *p, unsigned int cpu)
626 #ifdef CONFIG_FAIR_GROUP_SCHED
627 p->se.cfs_rq = task_group(p)->cfs_rq[cpu];
628 p->se.parent = task_group(p)->se[cpu];
631 #ifdef CONFIG_RT_GROUP_SCHED
632 p->rt.rt_rq = task_group(p)->rt_rq[cpu];
633 p->rt.parent = task_group(p)->rt_se[cpu];
637 #else /* CONFIG_CGROUP_SCHED */
639 static inline void set_task_rq(struct task_struct *p, unsigned int cpu) { }
640 static inline struct task_group *task_group(struct task_struct *p)
645 #endif /* CONFIG_CGROUP_SCHED */
647 inline void update_rq_clock(struct rq *rq)
649 if (!rq->skip_clock_update)
650 rq->clock = sched_clock_cpu(cpu_of(rq));
654 * Tunables that become constants when CONFIG_SCHED_DEBUG is off:
656 #ifdef CONFIG_SCHED_DEBUG
657 # define const_debug __read_mostly
659 # define const_debug static const
664 * @cpu: the processor in question.
666 * Returns true if the current cpu runqueue is locked.
667 * This interface allows printk to be called with the runqueue lock
668 * held and know whether or not it is OK to wake up the klogd.
670 int runqueue_is_locked(int cpu)
672 return raw_spin_is_locked(&cpu_rq(cpu)->lock);
676 * Debugging: various feature bits
679 #define SCHED_FEAT(name, enabled) \
680 __SCHED_FEAT_##name ,
683 #include "sched_features.h"
688 #define SCHED_FEAT(name, enabled) \
689 (1UL << __SCHED_FEAT_##name) * enabled |
691 const_debug unsigned int sysctl_sched_features =
692 #include "sched_features.h"
697 #ifdef CONFIG_SCHED_DEBUG
698 #define SCHED_FEAT(name, enabled) \
701 static __read_mostly char *sched_feat_names[] = {
702 #include "sched_features.h"
708 static int sched_feat_show(struct seq_file *m, void *v)
712 for (i = 0; sched_feat_names[i]; i++) {
713 if (!(sysctl_sched_features & (1UL << i)))
715 seq_printf(m, "%s ", sched_feat_names[i]);
723 sched_feat_write(struct file *filp, const char __user *ubuf,
724 size_t cnt, loff_t *ppos)
734 if (copy_from_user(&buf, ubuf, cnt))
740 if (strncmp(buf, "NO_", 3) == 0) {
745 for (i = 0; sched_feat_names[i]; i++) {
746 if (strcmp(cmp, sched_feat_names[i]) == 0) {
748 sysctl_sched_features &= ~(1UL << i);
750 sysctl_sched_features |= (1UL << i);
755 if (!sched_feat_names[i])
763 static int sched_feat_open(struct inode *inode, struct file *filp)
765 return single_open(filp, sched_feat_show, NULL);
768 static const struct file_operations sched_feat_fops = {
769 .open = sched_feat_open,
770 .write = sched_feat_write,
773 .release = single_release,
776 static __init int sched_init_debug(void)
778 debugfs_create_file("sched_features", 0644, NULL, NULL,
783 late_initcall(sched_init_debug);
787 #define sched_feat(x) (sysctl_sched_features & (1UL << __SCHED_FEAT_##x))
790 * Number of tasks to iterate in a single balance run.
791 * Limited because this is done with IRQs disabled.
793 const_debug unsigned int sysctl_sched_nr_migrate = 32;
796 * ratelimit for updating the group shares.
799 unsigned int sysctl_sched_shares_ratelimit = 250000;
800 unsigned int normalized_sysctl_sched_shares_ratelimit = 250000;
803 * Inject some fuzzyness into changing the per-cpu group shares
804 * this avoids remote rq-locks at the expense of fairness.
807 unsigned int sysctl_sched_shares_thresh = 4;
810 * period over which we average the RT time consumption, measured
815 const_debug unsigned int sysctl_sched_time_avg = MSEC_PER_SEC;
818 * period over which we measure -rt task cpu usage in us.
821 unsigned int sysctl_sched_rt_period = 1000000;
823 static __read_mostly int scheduler_running;
826 * part of the period that we allow rt tasks to run in us.
829 int sysctl_sched_rt_runtime = 950000;
831 static inline u64 global_rt_period(void)
833 return (u64)sysctl_sched_rt_period * NSEC_PER_USEC;
836 static inline u64 global_rt_runtime(void)
838 if (sysctl_sched_rt_runtime < 0)
841 return (u64)sysctl_sched_rt_runtime * NSEC_PER_USEC;
844 #ifndef prepare_arch_switch
845 # define prepare_arch_switch(next) do { } while (0)
847 #ifndef finish_arch_switch
848 # define finish_arch_switch(prev) do { } while (0)
851 static inline int task_current(struct rq *rq, struct task_struct *p)
853 return rq->curr == p;
856 #ifndef __ARCH_WANT_UNLOCKED_CTXSW
857 static inline int task_running(struct rq *rq, struct task_struct *p)
859 return task_current(rq, p);
862 static inline void prepare_lock_switch(struct rq *rq, struct task_struct *next)
866 static inline void finish_lock_switch(struct rq *rq, struct task_struct *prev)
868 #ifdef CONFIG_DEBUG_SPINLOCK
869 /* this is a valid case when another task releases the spinlock */
870 rq->lock.owner = current;
873 * If we are tracking spinlock dependencies then we have to
874 * fix up the runqueue lock - which gets 'carried over' from
877 spin_acquire(&rq->lock.dep_map, 0, 0, _THIS_IP_);
879 raw_spin_unlock_irq(&rq->lock);
882 #else /* __ARCH_WANT_UNLOCKED_CTXSW */
883 static inline int task_running(struct rq *rq, struct task_struct *p)
888 return task_current(rq, p);
892 static inline void prepare_lock_switch(struct rq *rq, struct task_struct *next)
896 * We can optimise this out completely for !SMP, because the
897 * SMP rebalancing from interrupt is the only thing that cares
902 #ifdef __ARCH_WANT_INTERRUPTS_ON_CTXSW
903 raw_spin_unlock_irq(&rq->lock);
905 raw_spin_unlock(&rq->lock);
909 static inline void finish_lock_switch(struct rq *rq, struct task_struct *prev)
913 * After ->oncpu is cleared, the task can be moved to a different CPU.
914 * We must ensure this doesn't happen until the switch is completely
920 #ifndef __ARCH_WANT_INTERRUPTS_ON_CTXSW
924 #endif /* __ARCH_WANT_UNLOCKED_CTXSW */
927 * Check whether the task is waking, we use this to synchronize ->cpus_allowed
930 static inline int task_is_waking(struct task_struct *p)
932 return unlikely(p->state == TASK_WAKING);
936 * __task_rq_lock - lock the runqueue a given task resides on.
937 * Must be called interrupts disabled.
939 static inline struct rq *__task_rq_lock(struct task_struct *p)
946 raw_spin_lock(&rq->lock);
947 if (likely(rq == task_rq(p)))
949 raw_spin_unlock(&rq->lock);
954 * task_rq_lock - lock the runqueue a given task resides on and disable
955 * interrupts. Note the ordering: we can safely lookup the task_rq without
956 * explicitly disabling preemption.
958 static struct rq *task_rq_lock(struct task_struct *p, unsigned long *flags)
964 local_irq_save(*flags);
966 raw_spin_lock(&rq->lock);
967 if (likely(rq == task_rq(p)))
969 raw_spin_unlock_irqrestore(&rq->lock, *flags);
973 static void __task_rq_unlock(struct rq *rq)
976 raw_spin_unlock(&rq->lock);
979 static inline void task_rq_unlock(struct rq *rq, unsigned long *flags)
982 raw_spin_unlock_irqrestore(&rq->lock, *flags);
986 * this_rq_lock - lock this runqueue and disable interrupts.
988 static struct rq *this_rq_lock(void)
995 raw_spin_lock(&rq->lock);
1000 #ifdef CONFIG_SCHED_HRTICK
1002 * Use HR-timers to deliver accurate preemption points.
1004 * Its all a bit involved since we cannot program an hrt while holding the
1005 * rq->lock. So what we do is store a state in in rq->hrtick_* and ask for a
1008 * When we get rescheduled we reprogram the hrtick_timer outside of the
1014 * - enabled by features
1015 * - hrtimer is actually high res
1017 static inline int hrtick_enabled(struct rq *rq)
1019 if (!sched_feat(HRTICK))
1021 if (!cpu_active(cpu_of(rq)))
1023 return hrtimer_is_hres_active(&rq->hrtick_timer);
1026 static void hrtick_clear(struct rq *rq)
1028 if (hrtimer_active(&rq->hrtick_timer))
1029 hrtimer_cancel(&rq->hrtick_timer);
1033 * High-resolution timer tick.
1034 * Runs from hardirq context with interrupts disabled.
1036 static enum hrtimer_restart hrtick(struct hrtimer *timer)
1038 struct rq *rq = container_of(timer, struct rq, hrtick_timer);
1040 WARN_ON_ONCE(cpu_of(rq) != smp_processor_id());
1042 raw_spin_lock(&rq->lock);
1043 update_rq_clock(rq);
1044 rq->curr->sched_class->task_tick(rq, rq->curr, 1);
1045 raw_spin_unlock(&rq->lock);
1047 return HRTIMER_NORESTART;
1052 * called from hardirq (IPI) context
1054 static void __hrtick_start(void *arg)
1056 struct rq *rq = arg;
1058 raw_spin_lock(&rq->lock);
1059 hrtimer_restart(&rq->hrtick_timer);
1060 rq->hrtick_csd_pending = 0;
1061 raw_spin_unlock(&rq->lock);
1065 * Called to set the hrtick timer state.
1067 * called with rq->lock held and irqs disabled
1069 static void hrtick_start(struct rq *rq, u64 delay)
1071 struct hrtimer *timer = &rq->hrtick_timer;
1072 ktime_t time = ktime_add_ns(timer->base->get_time(), delay);
1074 hrtimer_set_expires(timer, time);
1076 if (rq == this_rq()) {
1077 hrtimer_restart(timer);
1078 } else if (!rq->hrtick_csd_pending) {
1079 __smp_call_function_single(cpu_of(rq), &rq->hrtick_csd, 0);
1080 rq->hrtick_csd_pending = 1;
1085 hotplug_hrtick(struct notifier_block *nfb, unsigned long action, void *hcpu)
1087 int cpu = (int)(long)hcpu;
1090 case CPU_UP_CANCELED:
1091 case CPU_UP_CANCELED_FROZEN:
1092 case CPU_DOWN_PREPARE:
1093 case CPU_DOWN_PREPARE_FROZEN:
1095 case CPU_DEAD_FROZEN:
1096 hrtick_clear(cpu_rq(cpu));
1103 static __init void init_hrtick(void)
1105 hotcpu_notifier(hotplug_hrtick, 0);
1109 * Called to set the hrtick timer state.
1111 * called with rq->lock held and irqs disabled
1113 static void hrtick_start(struct rq *rq, u64 delay)
1115 __hrtimer_start_range_ns(&rq->hrtick_timer, ns_to_ktime(delay), 0,
1116 HRTIMER_MODE_REL_PINNED, 0);
1119 static inline void init_hrtick(void)
1122 #endif /* CONFIG_SMP */
1124 static void init_rq_hrtick(struct rq *rq)
1127 rq->hrtick_csd_pending = 0;
1129 rq->hrtick_csd.flags = 0;
1130 rq->hrtick_csd.func = __hrtick_start;
1131 rq->hrtick_csd.info = rq;
1134 hrtimer_init(&rq->hrtick_timer, CLOCK_MONOTONIC, HRTIMER_MODE_REL);
1135 rq->hrtick_timer.function = hrtick;
1137 #else /* CONFIG_SCHED_HRTICK */
1138 static inline void hrtick_clear(struct rq *rq)
1142 static inline void init_rq_hrtick(struct rq *rq)
1146 static inline void init_hrtick(void)
1149 #endif /* CONFIG_SCHED_HRTICK */
1152 * resched_task - mark a task 'to be rescheduled now'.
1154 * On UP this means the setting of the need_resched flag, on SMP it
1155 * might also involve a cross-CPU call to trigger the scheduler on
1160 #ifndef tsk_is_polling
1161 #define tsk_is_polling(t) test_tsk_thread_flag(t, TIF_POLLING_NRFLAG)
1164 static void resched_task(struct task_struct *p)
1168 assert_raw_spin_locked(&task_rq(p)->lock);
1170 if (test_tsk_need_resched(p))
1173 set_tsk_need_resched(p);
1176 if (cpu == smp_processor_id())
1179 /* NEED_RESCHED must be visible before we test polling */
1181 if (!tsk_is_polling(p))
1182 smp_send_reschedule(cpu);
1185 static void resched_cpu(int cpu)
1187 struct rq *rq = cpu_rq(cpu);
1188 unsigned long flags;
1190 if (!raw_spin_trylock_irqsave(&rq->lock, flags))
1192 resched_task(cpu_curr(cpu));
1193 raw_spin_unlock_irqrestore(&rq->lock, flags);
1198 * In the semi idle case, use the nearest busy cpu for migrating timers
1199 * from an idle cpu. This is good for power-savings.
1201 * We don't do similar optimization for completely idle system, as
1202 * selecting an idle cpu will add more delays to the timers than intended
1203 * (as that cpu's timer base may not be uptodate wrt jiffies etc).
1205 int get_nohz_timer_target(void)
1207 int cpu = smp_processor_id();
1209 struct sched_domain *sd;
1211 for_each_domain(cpu, sd) {
1212 for_each_cpu(i, sched_domain_span(sd))
1219 * When add_timer_on() enqueues a timer into the timer wheel of an
1220 * idle CPU then this timer might expire before the next timer event
1221 * which is scheduled to wake up that CPU. In case of a completely
1222 * idle system the next event might even be infinite time into the
1223 * future. wake_up_idle_cpu() ensures that the CPU is woken up and
1224 * leaves the inner idle loop so the newly added timer is taken into
1225 * account when the CPU goes back to idle and evaluates the timer
1226 * wheel for the next timer event.
1228 void wake_up_idle_cpu(int cpu)
1230 struct rq *rq = cpu_rq(cpu);
1232 if (cpu == smp_processor_id())
1236 * This is safe, as this function is called with the timer
1237 * wheel base lock of (cpu) held. When the CPU is on the way
1238 * to idle and has not yet set rq->curr to idle then it will
1239 * be serialized on the timer wheel base lock and take the new
1240 * timer into account automatically.
1242 if (rq->curr != rq->idle)
1246 * We can set TIF_RESCHED on the idle task of the other CPU
1247 * lockless. The worst case is that the other CPU runs the
1248 * idle task through an additional NOOP schedule()
1250 set_tsk_need_resched(rq->idle);
1252 /* NEED_RESCHED must be visible before we test polling */
1254 if (!tsk_is_polling(rq->idle))
1255 smp_send_reschedule(cpu);
1258 #endif /* CONFIG_NO_HZ */
1260 static u64 sched_avg_period(void)
1262 return (u64)sysctl_sched_time_avg * NSEC_PER_MSEC / 2;
1265 static void sched_avg_update(struct rq *rq)
1267 s64 period = sched_avg_period();
1269 while ((s64)(rq->clock - rq->age_stamp) > period) {
1271 * Inline assembly required to prevent the compiler
1272 * optimising this loop into a divmod call.
1273 * See __iter_div_u64_rem() for another example of this.
1275 asm("" : "+rm" (rq->age_stamp));
1276 rq->age_stamp += period;
1281 static void sched_rt_avg_update(struct rq *rq, u64 rt_delta)
1283 rq->rt_avg += rt_delta;
1284 sched_avg_update(rq);
1287 #else /* !CONFIG_SMP */
1288 static void resched_task(struct task_struct *p)
1290 assert_raw_spin_locked(&task_rq(p)->lock);
1291 set_tsk_need_resched(p);
1294 static void sched_rt_avg_update(struct rq *rq, u64 rt_delta)
1298 static void sched_avg_update(struct rq *rq)
1301 #endif /* CONFIG_SMP */
1303 #if BITS_PER_LONG == 32
1304 # define WMULT_CONST (~0UL)
1306 # define WMULT_CONST (1UL << 32)
1309 #define WMULT_SHIFT 32
1312 * Shift right and round:
1314 #define SRR(x, y) (((x) + (1UL << ((y) - 1))) >> (y))
1317 * delta *= weight / lw
1319 static unsigned long
1320 calc_delta_mine(unsigned long delta_exec, unsigned long weight,
1321 struct load_weight *lw)
1325 if (!lw->inv_weight) {
1326 if (BITS_PER_LONG > 32 && unlikely(lw->weight >= WMULT_CONST))
1329 lw->inv_weight = 1 + (WMULT_CONST-lw->weight/2)
1333 tmp = (u64)delta_exec * weight;
1335 * Check whether we'd overflow the 64-bit multiplication:
1337 if (unlikely(tmp > WMULT_CONST))
1338 tmp = SRR(SRR(tmp, WMULT_SHIFT/2) * lw->inv_weight,
1341 tmp = SRR(tmp * lw->inv_weight, WMULT_SHIFT);
1343 return (unsigned long)min(tmp, (u64)(unsigned long)LONG_MAX);
1346 static inline void update_load_add(struct load_weight *lw, unsigned long inc)
1352 static inline void update_load_sub(struct load_weight *lw, unsigned long dec)
1359 * To aid in avoiding the subversion of "niceness" due to uneven distribution
1360 * of tasks with abnormal "nice" values across CPUs the contribution that
1361 * each task makes to its run queue's load is weighted according to its
1362 * scheduling class and "nice" value. For SCHED_NORMAL tasks this is just a
1363 * scaled version of the new time slice allocation that they receive on time
1367 #define WEIGHT_IDLEPRIO 3
1368 #define WMULT_IDLEPRIO 1431655765
1371 * Nice levels are multiplicative, with a gentle 10% change for every
1372 * nice level changed. I.e. when a CPU-bound task goes from nice 0 to
1373 * nice 1, it will get ~10% less CPU time than another CPU-bound task
1374 * that remained on nice 0.
1376 * The "10% effect" is relative and cumulative: from _any_ nice level,
1377 * if you go up 1 level, it's -10% CPU usage, if you go down 1 level
1378 * it's +10% CPU usage. (to achieve that we use a multiplier of 1.25.
1379 * If a task goes up by ~10% and another task goes down by ~10% then
1380 * the relative distance between them is ~25%.)
1382 static const int prio_to_weight[40] = {
1383 /* -20 */ 88761, 71755, 56483, 46273, 36291,
1384 /* -15 */ 29154, 23254, 18705, 14949, 11916,
1385 /* -10 */ 9548, 7620, 6100, 4904, 3906,
1386 /* -5 */ 3121, 2501, 1991, 1586, 1277,
1387 /* 0 */ 1024, 820, 655, 526, 423,
1388 /* 5 */ 335, 272, 215, 172, 137,
1389 /* 10 */ 110, 87, 70, 56, 45,
1390 /* 15 */ 36, 29, 23, 18, 15,
1394 * Inverse (2^32/x) values of the prio_to_weight[] array, precalculated.
1396 * In cases where the weight does not change often, we can use the
1397 * precalculated inverse to speed up arithmetics by turning divisions
1398 * into multiplications:
1400 static const u32 prio_to_wmult[40] = {
1401 /* -20 */ 48388, 59856, 76040, 92818, 118348,
1402 /* -15 */ 147320, 184698, 229616, 287308, 360437,
1403 /* -10 */ 449829, 563644, 704093, 875809, 1099582,
1404 /* -5 */ 1376151, 1717300, 2157191, 2708050, 3363326,
1405 /* 0 */ 4194304, 5237765, 6557202, 8165337, 10153587,
1406 /* 5 */ 12820798, 15790321, 19976592, 24970740, 31350126,
1407 /* 10 */ 39045157, 49367440, 61356676, 76695844, 95443717,
1408 /* 15 */ 119304647, 148102320, 186737708, 238609294, 286331153,
1411 /* Time spent by the tasks of the cpu accounting group executing in ... */
1412 enum cpuacct_stat_index {
1413 CPUACCT_STAT_USER, /* ... user mode */
1414 CPUACCT_STAT_SYSTEM, /* ... kernel mode */
1416 CPUACCT_STAT_NSTATS,
1419 #ifdef CONFIG_CGROUP_CPUACCT
1420 static void cpuacct_charge(struct task_struct *tsk, u64 cputime);
1421 static void cpuacct_update_stats(struct task_struct *tsk,
1422 enum cpuacct_stat_index idx, cputime_t val);
1424 static inline void cpuacct_charge(struct task_struct *tsk, u64 cputime) {}
1425 static inline void cpuacct_update_stats(struct task_struct *tsk,
1426 enum cpuacct_stat_index idx, cputime_t val) {}
1429 static inline void inc_cpu_load(struct rq *rq, unsigned long load)
1431 update_load_add(&rq->load, load);
1434 static inline void dec_cpu_load(struct rq *rq, unsigned long load)
1436 update_load_sub(&rq->load, load);
1439 #if (defined(CONFIG_SMP) && defined(CONFIG_FAIR_GROUP_SCHED)) || defined(CONFIG_RT_GROUP_SCHED)
1440 typedef int (*tg_visitor)(struct task_group *, void *);
1443 * Iterate the full tree, calling @down when first entering a node and @up when
1444 * leaving it for the final time.
1446 static int walk_tg_tree(tg_visitor down, tg_visitor up, void *data)
1448 struct task_group *parent, *child;
1452 parent = &root_task_group;
1454 ret = (*down)(parent, data);
1457 list_for_each_entry_rcu(child, &parent->children, siblings) {
1464 ret = (*up)(parent, data);
1469 parent = parent->parent;
1478 static int tg_nop(struct task_group *tg, void *data)
1485 /* Used instead of source_load when we know the type == 0 */
1486 static unsigned long weighted_cpuload(const int cpu)
1488 return cpu_rq(cpu)->load.weight;
1492 * Return a low guess at the load of a migration-source cpu weighted
1493 * according to the scheduling class and "nice" value.
1495 * We want to under-estimate the load of migration sources, to
1496 * balance conservatively.
1498 static unsigned long source_load(int cpu, int type)
1500 struct rq *rq = cpu_rq(cpu);
1501 unsigned long total = weighted_cpuload(cpu);
1503 if (type == 0 || !sched_feat(LB_BIAS))
1506 return min(rq->cpu_load[type-1], total);
1510 * Return a high guess at the load of a migration-target cpu weighted
1511 * according to the scheduling class and "nice" value.
1513 static unsigned long target_load(int cpu, int type)
1515 struct rq *rq = cpu_rq(cpu);
1516 unsigned long total = weighted_cpuload(cpu);
1518 if (type == 0 || !sched_feat(LB_BIAS))
1521 return max(rq->cpu_load[type-1], total);
1524 static unsigned long power_of(int cpu)
1526 return cpu_rq(cpu)->cpu_power;
1529 static int task_hot(struct task_struct *p, u64 now, struct sched_domain *sd);
1531 static unsigned long cpu_avg_load_per_task(int cpu)
1533 struct rq *rq = cpu_rq(cpu);
1534 unsigned long nr_running = ACCESS_ONCE(rq->nr_running);
1537 rq->avg_load_per_task = rq->load.weight / nr_running;
1539 rq->avg_load_per_task = 0;
1541 return rq->avg_load_per_task;
1544 #ifdef CONFIG_FAIR_GROUP_SCHED
1546 static __read_mostly unsigned long __percpu *update_shares_data;
1548 static void __set_se_shares(struct sched_entity *se, unsigned long shares);
1551 * Calculate and set the cpu's group shares.
1553 static void update_group_shares_cpu(struct task_group *tg, int cpu,
1554 unsigned long sd_shares,
1555 unsigned long sd_rq_weight,
1556 unsigned long *usd_rq_weight)
1558 unsigned long shares, rq_weight;
1561 rq_weight = usd_rq_weight[cpu];
1564 rq_weight = NICE_0_LOAD;
1568 * \Sum_j shares_j * rq_weight_i
1569 * shares_i = -----------------------------
1570 * \Sum_j rq_weight_j
1572 shares = (sd_shares * rq_weight) / sd_rq_weight;
1573 shares = clamp_t(unsigned long, shares, MIN_SHARES, MAX_SHARES);
1575 if (abs(shares - tg->se[cpu]->load.weight) >
1576 sysctl_sched_shares_thresh) {
1577 struct rq *rq = cpu_rq(cpu);
1578 unsigned long flags;
1580 raw_spin_lock_irqsave(&rq->lock, flags);
1581 tg->cfs_rq[cpu]->rq_weight = boost ? 0 : rq_weight;
1582 tg->cfs_rq[cpu]->shares = boost ? 0 : shares;
1583 __set_se_shares(tg->se[cpu], shares);
1584 raw_spin_unlock_irqrestore(&rq->lock, flags);
1589 * Re-compute the task group their per cpu shares over the given domain.
1590 * This needs to be done in a bottom-up fashion because the rq weight of a
1591 * parent group depends on the shares of its child groups.
1593 static int tg_shares_up(struct task_group *tg, void *data)
1595 unsigned long weight, rq_weight = 0, sum_weight = 0, shares = 0;
1596 unsigned long *usd_rq_weight;
1597 struct sched_domain *sd = data;
1598 unsigned long flags;
1604 local_irq_save(flags);
1605 usd_rq_weight = per_cpu_ptr(update_shares_data, smp_processor_id());
1607 for_each_cpu(i, sched_domain_span(sd)) {
1608 weight = tg->cfs_rq[i]->load.weight;
1609 usd_rq_weight[i] = weight;
1611 rq_weight += weight;
1613 * If there are currently no tasks on the cpu pretend there
1614 * is one of average load so that when a new task gets to
1615 * run here it will not get delayed by group starvation.
1618 weight = NICE_0_LOAD;
1620 sum_weight += weight;
1621 shares += tg->cfs_rq[i]->shares;
1625 rq_weight = sum_weight;
1627 if ((!shares && rq_weight) || shares > tg->shares)
1628 shares = tg->shares;
1630 if (!sd->parent || !(sd->parent->flags & SD_LOAD_BALANCE))
1631 shares = tg->shares;
1633 for_each_cpu(i, sched_domain_span(sd))
1634 update_group_shares_cpu(tg, i, shares, rq_weight, usd_rq_weight);
1636 local_irq_restore(flags);
1642 * Compute the cpu's hierarchical load factor for each task group.
1643 * This needs to be done in a top-down fashion because the load of a child
1644 * group is a fraction of its parents load.
1646 static int tg_load_down(struct task_group *tg, void *data)
1649 long cpu = (long)data;
1652 load = cpu_rq(cpu)->load.weight;
1654 load = tg->parent->cfs_rq[cpu]->h_load;
1655 load *= tg->cfs_rq[cpu]->shares;
1656 load /= tg->parent->cfs_rq[cpu]->load.weight + 1;
1659 tg->cfs_rq[cpu]->h_load = load;
1664 static void update_shares(struct sched_domain *sd)
1669 if (root_task_group_empty())
1672 now = local_clock();
1673 elapsed = now - sd->last_update;
1675 if (elapsed >= (s64)(u64)sysctl_sched_shares_ratelimit) {
1676 sd->last_update = now;
1677 walk_tg_tree(tg_nop, tg_shares_up, sd);
1681 static void update_h_load(long cpu)
1683 walk_tg_tree(tg_load_down, tg_nop, (void *)cpu);
1688 static inline void update_shares(struct sched_domain *sd)
1694 #ifdef CONFIG_PREEMPT
1696 static void double_rq_lock(struct rq *rq1, struct rq *rq2);
1699 * fair double_lock_balance: Safely acquires both rq->locks in a fair
1700 * way at the expense of forcing extra atomic operations in all
1701 * invocations. This assures that the double_lock is acquired using the
1702 * same underlying policy as the spinlock_t on this architecture, which
1703 * reduces latency compared to the unfair variant below. However, it
1704 * also adds more overhead and therefore may reduce throughput.
1706 static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest)
1707 __releases(this_rq->lock)
1708 __acquires(busiest->lock)
1709 __acquires(this_rq->lock)
1711 raw_spin_unlock(&this_rq->lock);
1712 double_rq_lock(this_rq, busiest);
1719 * Unfair double_lock_balance: Optimizes throughput at the expense of
1720 * latency by eliminating extra atomic operations when the locks are
1721 * already in proper order on entry. This favors lower cpu-ids and will
1722 * grant the double lock to lower cpus over higher ids under contention,
1723 * regardless of entry order into the function.
1725 static int _double_lock_balance(struct rq *this_rq, struct rq *busiest)
1726 __releases(this_rq->lock)
1727 __acquires(busiest->lock)
1728 __acquires(this_rq->lock)
1732 if (unlikely(!raw_spin_trylock(&busiest->lock))) {
1733 if (busiest < this_rq) {
1734 raw_spin_unlock(&this_rq->lock);
1735 raw_spin_lock(&busiest->lock);
1736 raw_spin_lock_nested(&this_rq->lock,
1737 SINGLE_DEPTH_NESTING);
1740 raw_spin_lock_nested(&busiest->lock,
1741 SINGLE_DEPTH_NESTING);
1746 #endif /* CONFIG_PREEMPT */
1749 * double_lock_balance - lock the busiest runqueue, this_rq is locked already.
1751 static int double_lock_balance(struct rq *this_rq, struct rq *busiest)
1753 if (unlikely(!irqs_disabled())) {
1754 /* printk() doesn't work good under rq->lock */
1755 raw_spin_unlock(&this_rq->lock);
1759 return _double_lock_balance(this_rq, busiest);
1762 static inline void double_unlock_balance(struct rq *this_rq, struct rq *busiest)
1763 __releases(busiest->lock)
1765 raw_spin_unlock(&busiest->lock);
1766 lock_set_subclass(&this_rq->lock.dep_map, 0, _RET_IP_);
1770 * double_rq_lock - safely lock two runqueues
1772 * Note this does not disable interrupts like task_rq_lock,
1773 * you need to do so manually before calling.
1775 static void double_rq_lock(struct rq *rq1, struct rq *rq2)
1776 __acquires(rq1->lock)
1777 __acquires(rq2->lock)
1779 BUG_ON(!irqs_disabled());
1781 raw_spin_lock(&rq1->lock);
1782 __acquire(rq2->lock); /* Fake it out ;) */
1785 raw_spin_lock(&rq1->lock);
1786 raw_spin_lock_nested(&rq2->lock, SINGLE_DEPTH_NESTING);
1788 raw_spin_lock(&rq2->lock);
1789 raw_spin_lock_nested(&rq1->lock, SINGLE_DEPTH_NESTING);
1795 * double_rq_unlock - safely unlock two runqueues
1797 * Note this does not restore interrupts like task_rq_unlock,
1798 * you need to do so manually after calling.
1800 static void double_rq_unlock(struct rq *rq1, struct rq *rq2)
1801 __releases(rq1->lock)
1802 __releases(rq2->lock)
1804 raw_spin_unlock(&rq1->lock);
1806 raw_spin_unlock(&rq2->lock);
1808 __release(rq2->lock);
1813 #ifdef CONFIG_FAIR_GROUP_SCHED
1814 static void cfs_rq_set_shares(struct cfs_rq *cfs_rq, unsigned long shares)
1817 cfs_rq->shares = shares;
1822 static void calc_load_account_idle(struct rq *this_rq);
1823 static void update_sysctl(void);
1824 static int get_update_sysctl_factor(void);
1825 static void update_cpu_load(struct rq *this_rq);
1827 static inline void __set_task_cpu(struct task_struct *p, unsigned int cpu)
1829 set_task_rq(p, cpu);
1832 * After ->cpu is set up to a new value, task_rq_lock(p, ...) can be
1833 * successfuly executed on another CPU. We must ensure that updates of
1834 * per-task data have been completed by this moment.
1837 task_thread_info(p)->cpu = cpu;
1841 static const struct sched_class rt_sched_class;
1843 #define sched_class_highest (&rt_sched_class)
1844 #define for_each_class(class) \
1845 for (class = sched_class_highest; class; class = class->next)
1847 #include "sched_stats.h"
1849 static void inc_nr_running(struct rq *rq)
1854 static void dec_nr_running(struct rq *rq)
1859 static void set_load_weight(struct task_struct *p)
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 enqueue_task(struct rq *rq, struct task_struct *p, int flags)
1876 update_rq_clock(rq);
1877 sched_info_queued(p);
1878 p->sched_class->enqueue_task(rq, p, flags);
1882 static void dequeue_task(struct rq *rq, struct task_struct *p, int flags)
1884 update_rq_clock(rq);
1885 sched_info_dequeued(p);
1886 p->sched_class->dequeue_task(rq, p, flags);
1891 * activate_task - move a task to the runqueue.
1893 static void activate_task(struct rq *rq, struct task_struct *p, int flags)
1895 if (task_contributes_to_load(p))
1896 rq->nr_uninterruptible--;
1898 enqueue_task(rq, p, flags);
1903 * deactivate_task - remove a task from the runqueue.
1905 static void deactivate_task(struct rq *rq, struct task_struct *p, int flags)
1907 if (task_contributes_to_load(p))
1908 rq->nr_uninterruptible++;
1910 dequeue_task(rq, p, flags);
1914 #include "sched_idletask.c"
1915 #include "sched_fair.c"
1916 #include "sched_rt.c"
1917 #ifdef CONFIG_SCHED_DEBUG
1918 # include "sched_debug.c"
1922 * __normal_prio - return the priority that is based on the static prio
1924 static inline int __normal_prio(struct task_struct *p)
1926 return p->static_prio;
1930 * Calculate the expected normal priority: i.e. priority
1931 * without taking RT-inheritance into account. Might be
1932 * boosted by interactivity modifiers. Changes upon fork,
1933 * setprio syscalls, and whenever the interactivity
1934 * estimator recalculates.
1936 static inline int normal_prio(struct task_struct *p)
1940 if (task_has_rt_policy(p))
1941 prio = MAX_RT_PRIO-1 - p->rt_priority;
1943 prio = __normal_prio(p);
1948 * Calculate the current priority, i.e. the priority
1949 * taken into account by the scheduler. This value might
1950 * be boosted by RT tasks, or might be boosted by
1951 * interactivity modifiers. Will be RT if the task got
1952 * RT-boosted. If not then it returns p->normal_prio.
1954 static int effective_prio(struct task_struct *p)
1956 p->normal_prio = normal_prio(p);
1958 * If we are RT tasks or we were boosted to RT priority,
1959 * keep the priority unchanged. Otherwise, update priority
1960 * to the normal priority:
1962 if (!rt_prio(p->prio))
1963 return p->normal_prio;
1968 * task_curr - is this task currently executing on a CPU?
1969 * @p: the task in question.
1971 inline int task_curr(const struct task_struct *p)
1973 return cpu_curr(task_cpu(p)) == p;
1976 static inline void check_class_changed(struct rq *rq, struct task_struct *p,
1977 const struct sched_class *prev_class,
1978 int oldprio, int running)
1980 if (prev_class != p->sched_class) {
1981 if (prev_class->switched_from)
1982 prev_class->switched_from(rq, p, running);
1983 p->sched_class->switched_to(rq, p, running);
1985 p->sched_class->prio_changed(rq, p, oldprio, running);
1990 * Is this task likely cache-hot:
1993 task_hot(struct task_struct *p, u64 now, struct sched_domain *sd)
1997 if (p->sched_class != &fair_sched_class)
2001 * Buddy candidates are cache hot:
2003 if (sched_feat(CACHE_HOT_BUDDY) && this_rq()->nr_running &&
2004 (&p->se == cfs_rq_of(&p->se)->next ||
2005 &p->se == cfs_rq_of(&p->se)->last))
2008 if (sysctl_sched_migration_cost == -1)
2010 if (sysctl_sched_migration_cost == 0)
2013 delta = now - p->se.exec_start;
2015 return delta < (s64)sysctl_sched_migration_cost;
2018 void set_task_cpu(struct task_struct *p, unsigned int new_cpu)
2020 #ifdef CONFIG_SCHED_DEBUG
2022 * We should never call set_task_cpu() on a blocked task,
2023 * ttwu() will sort out the placement.
2025 WARN_ON_ONCE(p->state != TASK_RUNNING && p->state != TASK_WAKING &&
2026 !(task_thread_info(p)->preempt_count & PREEMPT_ACTIVE));
2029 trace_sched_migrate_task(p, new_cpu);
2031 if (task_cpu(p) != new_cpu) {
2032 p->se.nr_migrations++;
2033 perf_sw_event(PERF_COUNT_SW_CPU_MIGRATIONS, 1, 1, NULL, 0);
2036 __set_task_cpu(p, new_cpu);
2039 struct migration_arg {
2040 struct task_struct *task;
2044 static int migration_cpu_stop(void *data);
2047 * The task's runqueue lock must be held.
2048 * Returns true if you have to wait for migration thread.
2050 static bool migrate_task(struct task_struct *p, int dest_cpu)
2052 struct rq *rq = task_rq(p);
2055 * If the task is not on a runqueue (and not running), then
2056 * the next wake-up will properly place the task.
2058 return p->se.on_rq || task_running(rq, p);
2062 * wait_task_inactive - wait for a thread to unschedule.
2064 * If @match_state is nonzero, it's the @p->state value just checked and
2065 * not expected to change. If it changes, i.e. @p might have woken up,
2066 * then return zero. When we succeed in waiting for @p to be off its CPU,
2067 * we return a positive number (its total switch count). If a second call
2068 * a short while later returns the same number, the caller can be sure that
2069 * @p has remained unscheduled the whole time.
2071 * The caller must ensure that the task *will* unschedule sometime soon,
2072 * else this function might spin for a *long* time. This function can't
2073 * be called with interrupts off, or it may introduce deadlock with
2074 * smp_call_function() if an IPI is sent by the same process we are
2075 * waiting to become inactive.
2077 unsigned long wait_task_inactive(struct task_struct *p, long match_state)
2079 unsigned long flags;
2086 * We do the initial early heuristics without holding
2087 * any task-queue locks at all. We'll only try to get
2088 * the runqueue lock when things look like they will
2094 * If the task is actively running on another CPU
2095 * still, just relax and busy-wait without holding
2098 * NOTE! Since we don't hold any locks, it's not
2099 * even sure that "rq" stays as the right runqueue!
2100 * But we don't care, since "task_running()" will
2101 * return false if the runqueue has changed and p
2102 * is actually now running somewhere else!
2104 while (task_running(rq, p)) {
2105 if (match_state && unlikely(p->state != match_state))
2111 * Ok, time to look more closely! We need the rq
2112 * lock now, to be *sure*. If we're wrong, we'll
2113 * just go back and repeat.
2115 rq = task_rq_lock(p, &flags);
2116 trace_sched_wait_task(p);
2117 running = task_running(rq, p);
2118 on_rq = p->se.on_rq;
2120 if (!match_state || p->state == match_state)
2121 ncsw = p->nvcsw | LONG_MIN; /* sets MSB */
2122 task_rq_unlock(rq, &flags);
2125 * If it changed from the expected state, bail out now.
2127 if (unlikely(!ncsw))
2131 * Was it really running after all now that we
2132 * checked with the proper locks actually held?
2134 * Oops. Go back and try again..
2136 if (unlikely(running)) {
2142 * It's not enough that it's not actively running,
2143 * it must be off the runqueue _entirely_, and not
2146 * So if it was still runnable (but just not actively
2147 * running right now), it's preempted, and we should
2148 * yield - it could be a while.
2150 if (unlikely(on_rq)) {
2151 schedule_timeout_uninterruptible(1);
2156 * Ahh, all good. It wasn't running, and it wasn't
2157 * runnable, which means that it will never become
2158 * running in the future either. We're all done!
2167 * kick_process - kick a running thread to enter/exit the kernel
2168 * @p: the to-be-kicked thread
2170 * Cause a process which is running on another CPU to enter
2171 * kernel-mode, without any delay. (to get signals handled.)
2173 * NOTE: this function doesnt have to take the runqueue lock,
2174 * because all it wants to ensure is that the remote task enters
2175 * the kernel. If the IPI races and the task has been migrated
2176 * to another CPU then no harm is done and the purpose has been
2179 void kick_process(struct task_struct *p)
2185 if ((cpu != smp_processor_id()) && task_curr(p))
2186 smp_send_reschedule(cpu);
2189 EXPORT_SYMBOL_GPL(kick_process);
2190 #endif /* CONFIG_SMP */
2193 * task_oncpu_function_call - call a function on the cpu on which a task runs
2194 * @p: the task to evaluate
2195 * @func: the function to be called
2196 * @info: the function call argument
2198 * Calls the function @func when the task is currently running. This might
2199 * be on the current CPU, which just calls the function directly
2201 void task_oncpu_function_call(struct task_struct *p,
2202 void (*func) (void *info), void *info)
2209 smp_call_function_single(cpu, func, info, 1);
2215 * ->cpus_allowed is protected by either TASK_WAKING or rq->lock held.
2217 static int select_fallback_rq(int cpu, struct task_struct *p)
2220 const struct cpumask *nodemask = cpumask_of_node(cpu_to_node(cpu));
2222 /* Look for allowed, online CPU in same node. */
2223 for_each_cpu_and(dest_cpu, nodemask, cpu_active_mask)
2224 if (cpumask_test_cpu(dest_cpu, &p->cpus_allowed))
2227 /* Any allowed, online CPU? */
2228 dest_cpu = cpumask_any_and(&p->cpus_allowed, cpu_active_mask);
2229 if (dest_cpu < nr_cpu_ids)
2232 /* No more Mr. Nice Guy. */
2233 if (unlikely(dest_cpu >= nr_cpu_ids)) {
2234 dest_cpu = cpuset_cpus_allowed_fallback(p);
2236 * Don't tell them about moving exiting tasks or
2237 * kernel threads (both mm NULL), since they never
2240 if (p->mm && printk_ratelimit()) {
2241 printk(KERN_INFO "process %d (%s) no "
2242 "longer affine to cpu%d\n",
2243 task_pid_nr(p), p->comm, cpu);
2251 * The caller (fork, wakeup) owns TASK_WAKING, ->cpus_allowed is stable.
2254 int select_task_rq(struct rq *rq, struct task_struct *p, int sd_flags, int wake_flags)
2256 int cpu = p->sched_class->select_task_rq(rq, p, sd_flags, wake_flags);
2259 * In order not to call set_task_cpu() on a blocking task we need
2260 * to rely on ttwu() to place the task on a valid ->cpus_allowed
2263 * Since this is common to all placement strategies, this lives here.
2265 * [ this allows ->select_task() to simply return task_cpu(p) and
2266 * not worry about this generic constraint ]
2268 if (unlikely(!cpumask_test_cpu(cpu, &p->cpus_allowed) ||
2270 cpu = select_fallback_rq(task_cpu(p), p);
2275 static void update_avg(u64 *avg, u64 sample)
2277 s64 diff = sample - *avg;
2282 static inline void ttwu_activate(struct task_struct *p, struct rq *rq,
2283 bool is_sync, bool is_migrate, bool is_local,
2284 unsigned long en_flags)
2286 schedstat_inc(p, se.statistics.nr_wakeups);
2288 schedstat_inc(p, se.statistics.nr_wakeups_sync);
2290 schedstat_inc(p, se.statistics.nr_wakeups_migrate);
2292 schedstat_inc(p, se.statistics.nr_wakeups_local);
2294 schedstat_inc(p, se.statistics.nr_wakeups_remote);
2296 activate_task(rq, p, en_flags);
2299 static inline void ttwu_post_activation(struct task_struct *p, struct rq *rq,
2300 int wake_flags, bool success)
2302 trace_sched_wakeup(p, success);
2303 check_preempt_curr(rq, p, wake_flags);
2305 p->state = TASK_RUNNING;
2307 if (p->sched_class->task_woken)
2308 p->sched_class->task_woken(rq, p);
2310 if (unlikely(rq->idle_stamp)) {
2311 u64 delta = rq->clock - rq->idle_stamp;
2312 u64 max = 2*sysctl_sched_migration_cost;
2317 update_avg(&rq->avg_idle, delta);
2321 /* if a worker is waking up, notify workqueue */
2322 if ((p->flags & PF_WQ_WORKER) && success)
2323 wq_worker_waking_up(p, cpu_of(rq));
2327 * try_to_wake_up - wake up a thread
2328 * @p: the thread to be awakened
2329 * @state: the mask of task states that can be woken
2330 * @wake_flags: wake modifier flags (WF_*)
2332 * Put it on the run-queue if it's not already there. The "current"
2333 * thread is always on the run-queue (except when the actual
2334 * re-schedule is in progress), and as such you're allowed to do
2335 * the simpler "current->state = TASK_RUNNING" to mark yourself
2336 * runnable without the overhead of this.
2338 * Returns %true if @p was woken up, %false if it was already running
2339 * or @state didn't match @p's state.
2341 static int try_to_wake_up(struct task_struct *p, unsigned int state,
2344 int cpu, orig_cpu, this_cpu, success = 0;
2345 unsigned long flags;
2346 unsigned long en_flags = ENQUEUE_WAKEUP;
2349 this_cpu = get_cpu();
2352 rq = task_rq_lock(p, &flags);
2353 if (!(p->state & state))
2363 if (unlikely(task_running(rq, p)))
2367 * In order to handle concurrent wakeups and release the rq->lock
2368 * we put the task in TASK_WAKING state.
2370 * First fix up the nr_uninterruptible count:
2372 if (task_contributes_to_load(p)) {
2373 if (likely(cpu_online(orig_cpu)))
2374 rq->nr_uninterruptible--;
2376 this_rq()->nr_uninterruptible--;
2378 p->state = TASK_WAKING;
2380 if (p->sched_class->task_waking) {
2381 p->sched_class->task_waking(rq, p);
2382 en_flags |= ENQUEUE_WAKING;
2385 cpu = select_task_rq(rq, p, SD_BALANCE_WAKE, wake_flags);
2386 if (cpu != orig_cpu)
2387 set_task_cpu(p, cpu);
2388 __task_rq_unlock(rq);
2391 raw_spin_lock(&rq->lock);
2394 * We migrated the task without holding either rq->lock, however
2395 * since the task is not on the task list itself, nobody else
2396 * will try and migrate the task, hence the rq should match the
2397 * cpu we just moved it to.
2399 WARN_ON(task_cpu(p) != cpu);
2400 WARN_ON(p->state != TASK_WAKING);
2402 #ifdef CONFIG_SCHEDSTATS
2403 schedstat_inc(rq, ttwu_count);
2404 if (cpu == this_cpu)
2405 schedstat_inc(rq, ttwu_local);
2407 struct sched_domain *sd;
2408 for_each_domain(this_cpu, sd) {
2409 if (cpumask_test_cpu(cpu, sched_domain_span(sd))) {
2410 schedstat_inc(sd, ttwu_wake_remote);
2415 #endif /* CONFIG_SCHEDSTATS */
2418 #endif /* CONFIG_SMP */
2419 ttwu_activate(p, rq, wake_flags & WF_SYNC, orig_cpu != cpu,
2420 cpu == this_cpu, en_flags);
2423 ttwu_post_activation(p, rq, wake_flags, success);
2425 task_rq_unlock(rq, &flags);
2432 * try_to_wake_up_local - try to wake up a local task with rq lock held
2433 * @p: the thread to be awakened
2435 * Put @p on the run-queue if it's not alredy there. The caller must
2436 * ensure that this_rq() is locked, @p is bound to this_rq() and not
2437 * the current task. this_rq() stays locked over invocation.
2439 static void try_to_wake_up_local(struct task_struct *p)
2441 struct rq *rq = task_rq(p);
2442 bool success = false;
2444 BUG_ON(rq != this_rq());
2445 BUG_ON(p == current);
2446 lockdep_assert_held(&rq->lock);
2448 if (!(p->state & TASK_NORMAL))
2452 if (likely(!task_running(rq, p))) {
2453 schedstat_inc(rq, ttwu_count);
2454 schedstat_inc(rq, ttwu_local);
2456 ttwu_activate(p, rq, false, false, true, ENQUEUE_WAKEUP);
2459 ttwu_post_activation(p, rq, 0, success);
2463 * wake_up_process - Wake up a specific process
2464 * @p: The process to be woken up.
2466 * Attempt to wake up the nominated process and move it to the set of runnable
2467 * processes. Returns 1 if the process was woken up, 0 if it was already
2470 * It may be assumed that this function implies a write memory barrier before
2471 * changing the task state if and only if any tasks are woken up.
2473 int wake_up_process(struct task_struct *p)
2475 return try_to_wake_up(p, TASK_ALL, 0);
2477 EXPORT_SYMBOL(wake_up_process);
2479 int wake_up_state(struct task_struct *p, unsigned int state)
2481 return try_to_wake_up(p, state, 0);
2485 * Perform scheduler related setup for a newly forked process p.
2486 * p is forked by current.
2488 * __sched_fork() is basic setup used by init_idle() too:
2490 static void __sched_fork(struct task_struct *p)
2492 p->se.exec_start = 0;
2493 p->se.sum_exec_runtime = 0;
2494 p->se.prev_sum_exec_runtime = 0;
2495 p->se.nr_migrations = 0;
2497 #ifdef CONFIG_SCHEDSTATS
2498 memset(&p->se.statistics, 0, sizeof(p->se.statistics));
2501 INIT_LIST_HEAD(&p->rt.run_list);
2503 INIT_LIST_HEAD(&p->se.group_node);
2505 #ifdef CONFIG_PREEMPT_NOTIFIERS
2506 INIT_HLIST_HEAD(&p->preempt_notifiers);
2511 * fork()/clone()-time setup:
2513 void sched_fork(struct task_struct *p, int clone_flags)
2515 int cpu = get_cpu();
2519 * We mark the process as running here. This guarantees that
2520 * nobody will actually run it, and a signal or other external
2521 * event cannot wake it up and insert it on the runqueue either.
2523 p->state = TASK_RUNNING;
2526 * Revert to default priority/policy on fork if requested.
2528 if (unlikely(p->sched_reset_on_fork)) {
2529 if (p->policy == SCHED_FIFO || p->policy == SCHED_RR) {
2530 p->policy = SCHED_NORMAL;
2531 p->normal_prio = p->static_prio;
2534 if (PRIO_TO_NICE(p->static_prio) < 0) {
2535 p->static_prio = NICE_TO_PRIO(0);
2536 p->normal_prio = p->static_prio;
2541 * We don't need the reset flag anymore after the fork. It has
2542 * fulfilled its duty:
2544 p->sched_reset_on_fork = 0;
2548 * Make sure we do not leak PI boosting priority to the child.
2550 p->prio = current->normal_prio;
2552 if (!rt_prio(p->prio))
2553 p->sched_class = &fair_sched_class;
2555 if (p->sched_class->task_fork)
2556 p->sched_class->task_fork(p);
2559 * The child is not yet in the pid-hash so no cgroup attach races,
2560 * and the cgroup is pinned to this child due to cgroup_fork()
2561 * is ran before sched_fork().
2563 * Silence PROVE_RCU.
2566 set_task_cpu(p, cpu);
2569 #if defined(CONFIG_SCHEDSTATS) || defined(CONFIG_TASK_DELAY_ACCT)
2570 if (likely(sched_info_on()))
2571 memset(&p->sched_info, 0, sizeof(p->sched_info));
2573 #if defined(CONFIG_SMP) && defined(__ARCH_WANT_UNLOCKED_CTXSW)
2576 #ifdef CONFIG_PREEMPT
2577 /* Want to start with kernel preemption disabled. */
2578 task_thread_info(p)->preempt_count = 1;
2580 plist_node_init(&p->pushable_tasks, MAX_PRIO);
2586 * wake_up_new_task - wake up a newly created task for the first time.
2588 * This function will do some initial scheduler statistics housekeeping
2589 * that must be done for every newly created context, then puts the task
2590 * on the runqueue and wakes it.
2592 void wake_up_new_task(struct task_struct *p, unsigned long clone_flags)
2594 unsigned long flags;
2596 int cpu __maybe_unused = get_cpu();
2599 rq = task_rq_lock(p, &flags);
2600 p->state = TASK_WAKING;
2603 * Fork balancing, do it here and not earlier because:
2604 * - cpus_allowed can change in the fork path
2605 * - any previously selected cpu might disappear through hotplug
2607 * We set TASK_WAKING so that select_task_rq() can drop rq->lock
2608 * without people poking at ->cpus_allowed.
2610 cpu = select_task_rq(rq, p, SD_BALANCE_FORK, 0);
2611 set_task_cpu(p, cpu);
2613 p->state = TASK_RUNNING;
2614 task_rq_unlock(rq, &flags);
2617 rq = task_rq_lock(p, &flags);
2618 activate_task(rq, p, 0);
2619 trace_sched_wakeup_new(p, 1);
2620 check_preempt_curr(rq, p, WF_FORK);
2622 if (p->sched_class->task_woken)
2623 p->sched_class->task_woken(rq, p);
2625 task_rq_unlock(rq, &flags);
2629 #ifdef CONFIG_PREEMPT_NOTIFIERS
2632 * preempt_notifier_register - tell me when current is being preempted & rescheduled
2633 * @notifier: notifier struct to register
2635 void preempt_notifier_register(struct preempt_notifier *notifier)
2637 hlist_add_head(¬ifier->link, ¤t->preempt_notifiers);
2639 EXPORT_SYMBOL_GPL(preempt_notifier_register);
2642 * preempt_notifier_unregister - no longer interested in preemption notifications
2643 * @notifier: notifier struct to unregister
2645 * This is safe to call from within a preemption notifier.
2647 void preempt_notifier_unregister(struct preempt_notifier *notifier)
2649 hlist_del(¬ifier->link);
2651 EXPORT_SYMBOL_GPL(preempt_notifier_unregister);
2653 static void fire_sched_in_preempt_notifiers(struct task_struct *curr)
2655 struct preempt_notifier *notifier;
2656 struct hlist_node *node;
2658 hlist_for_each_entry(notifier, node, &curr->preempt_notifiers, link)
2659 notifier->ops->sched_in(notifier, raw_smp_processor_id());
2663 fire_sched_out_preempt_notifiers(struct task_struct *curr,
2664 struct task_struct *next)
2666 struct preempt_notifier *notifier;
2667 struct hlist_node *node;
2669 hlist_for_each_entry(notifier, node, &curr->preempt_notifiers, link)
2670 notifier->ops->sched_out(notifier, next);
2673 #else /* !CONFIG_PREEMPT_NOTIFIERS */
2675 static void fire_sched_in_preempt_notifiers(struct task_struct *curr)
2680 fire_sched_out_preempt_notifiers(struct task_struct *curr,
2681 struct task_struct *next)
2685 #endif /* CONFIG_PREEMPT_NOTIFIERS */
2688 * prepare_task_switch - prepare to switch tasks
2689 * @rq: the runqueue preparing to switch
2690 * @prev: the current task that is being switched out
2691 * @next: the task we are going to switch to.
2693 * This is called with the rq lock held and interrupts off. It must
2694 * be paired with a subsequent finish_task_switch after the context
2697 * prepare_task_switch sets up locking and calls architecture specific
2701 prepare_task_switch(struct rq *rq, struct task_struct *prev,
2702 struct task_struct *next)
2704 fire_sched_out_preempt_notifiers(prev, next);
2705 prepare_lock_switch(rq, next);
2706 prepare_arch_switch(next);
2710 * finish_task_switch - clean up after a task-switch
2711 * @rq: runqueue associated with task-switch
2712 * @prev: the thread we just switched away from.
2714 * finish_task_switch must be called after the context switch, paired
2715 * with a prepare_task_switch call before the context switch.
2716 * finish_task_switch will reconcile locking set up by prepare_task_switch,
2717 * and do any other architecture-specific cleanup actions.
2719 * Note that we may have delayed dropping an mm in context_switch(). If
2720 * so, we finish that here outside of the runqueue lock. (Doing it
2721 * with the lock held can cause deadlocks; see schedule() for
2724 static void finish_task_switch(struct rq *rq, struct task_struct *prev)
2725 __releases(rq->lock)
2727 struct mm_struct *mm = rq->prev_mm;
2733 * A task struct has one reference for the use as "current".
2734 * If a task dies, then it sets TASK_DEAD in tsk->state and calls
2735 * schedule one last time. The schedule call will never return, and
2736 * the scheduled task must drop that reference.
2737 * The test for TASK_DEAD must occur while the runqueue locks are
2738 * still held, otherwise prev could be scheduled on another cpu, die
2739 * there before we look at prev->state, and then the reference would
2741 * Manfred Spraul <manfred@colorfullife.com>
2743 prev_state = prev->state;
2744 finish_arch_switch(prev);
2745 #ifdef __ARCH_WANT_INTERRUPTS_ON_CTXSW
2746 local_irq_disable();
2747 #endif /* __ARCH_WANT_INTERRUPTS_ON_CTXSW */
2748 perf_event_task_sched_in(current);
2749 #ifdef __ARCH_WANT_INTERRUPTS_ON_CTXSW
2751 #endif /* __ARCH_WANT_INTERRUPTS_ON_CTXSW */
2752 finish_lock_switch(rq, prev);
2754 fire_sched_in_preempt_notifiers(current);
2757 if (unlikely(prev_state == TASK_DEAD)) {
2759 * Remove function-return probe instances associated with this
2760 * task and put them back on the free list.
2762 kprobe_flush_task(prev);
2763 put_task_struct(prev);
2769 /* assumes rq->lock is held */
2770 static inline void pre_schedule(struct rq *rq, struct task_struct *prev)
2772 if (prev->sched_class->pre_schedule)
2773 prev->sched_class->pre_schedule(rq, prev);
2776 /* rq->lock is NOT held, but preemption is disabled */
2777 static inline void post_schedule(struct rq *rq)
2779 if (rq->post_schedule) {
2780 unsigned long flags;
2782 raw_spin_lock_irqsave(&rq->lock, flags);
2783 if (rq->curr->sched_class->post_schedule)
2784 rq->curr->sched_class->post_schedule(rq);
2785 raw_spin_unlock_irqrestore(&rq->lock, flags);
2787 rq->post_schedule = 0;
2793 static inline void pre_schedule(struct rq *rq, struct task_struct *p)
2797 static inline void post_schedule(struct rq *rq)
2804 * schedule_tail - first thing a freshly forked thread must call.
2805 * @prev: the thread we just switched away from.
2807 asmlinkage void schedule_tail(struct task_struct *prev)
2808 __releases(rq->lock)
2810 struct rq *rq = this_rq();
2812 finish_task_switch(rq, prev);
2815 * FIXME: do we need to worry about rq being invalidated by the
2820 #ifdef __ARCH_WANT_UNLOCKED_CTXSW
2821 /* In this case, finish_task_switch does not reenable preemption */
2824 if (current->set_child_tid)
2825 put_user(task_pid_vnr(current), current->set_child_tid);
2829 * context_switch - switch to the new MM and the new
2830 * thread's register state.
2833 context_switch(struct rq *rq, struct task_struct *prev,
2834 struct task_struct *next)
2836 struct mm_struct *mm, *oldmm;
2838 prepare_task_switch(rq, prev, next);
2839 trace_sched_switch(prev, next);
2841 oldmm = prev->active_mm;
2843 * For paravirt, this is coupled with an exit in switch_to to
2844 * combine the page table reload and the switch backend into
2847 arch_start_context_switch(prev);
2850 next->active_mm = oldmm;
2851 atomic_inc(&oldmm->mm_count);
2852 enter_lazy_tlb(oldmm, next);
2854 switch_mm(oldmm, mm, next);
2856 if (likely(!prev->mm)) {
2857 prev->active_mm = NULL;
2858 rq->prev_mm = oldmm;
2861 * Since the runqueue lock will be released by the next
2862 * task (which is an invalid locking op but in the case
2863 * of the scheduler it's an obvious special-case), so we
2864 * do an early lockdep release here:
2866 #ifndef __ARCH_WANT_UNLOCKED_CTXSW
2867 spin_release(&rq->lock.dep_map, 1, _THIS_IP_);
2870 /* Here we just switch the register state and the stack. */
2871 switch_to(prev, next, prev);
2875 * this_rq must be evaluated again because prev may have moved
2876 * CPUs since it called schedule(), thus the 'rq' on its stack
2877 * frame will be invalid.
2879 finish_task_switch(this_rq(), prev);
2883 * nr_running, nr_uninterruptible and nr_context_switches:
2885 * externally visible scheduler statistics: current number of runnable
2886 * threads, current number of uninterruptible-sleeping threads, total
2887 * number of context switches performed since bootup.
2889 unsigned long nr_running(void)
2891 unsigned long i, sum = 0;
2893 for_each_online_cpu(i)
2894 sum += cpu_rq(i)->nr_running;
2899 unsigned long nr_uninterruptible(void)
2901 unsigned long i, sum = 0;
2903 for_each_possible_cpu(i)
2904 sum += cpu_rq(i)->nr_uninterruptible;
2907 * Since we read the counters lockless, it might be slightly
2908 * inaccurate. Do not allow it to go below zero though:
2910 if (unlikely((long)sum < 0))
2916 unsigned long long nr_context_switches(void)
2919 unsigned long long sum = 0;
2921 for_each_possible_cpu(i)
2922 sum += cpu_rq(i)->nr_switches;
2927 unsigned long nr_iowait(void)
2929 unsigned long i, sum = 0;
2931 for_each_possible_cpu(i)
2932 sum += atomic_read(&cpu_rq(i)->nr_iowait);
2937 unsigned long nr_iowait_cpu(int cpu)
2939 struct rq *this = cpu_rq(cpu);
2940 return atomic_read(&this->nr_iowait);
2943 unsigned long this_cpu_load(void)
2945 struct rq *this = this_rq();
2946 return this->cpu_load[0];
2950 /* Variables and functions for calc_load */
2951 static atomic_long_t calc_load_tasks;
2952 static unsigned long calc_load_update;
2953 unsigned long avenrun[3];
2954 EXPORT_SYMBOL(avenrun);
2956 static long calc_load_fold_active(struct rq *this_rq)
2958 long nr_active, delta = 0;
2960 nr_active = this_rq->nr_running;
2961 nr_active += (long) this_rq->nr_uninterruptible;
2963 if (nr_active != this_rq->calc_load_active) {
2964 delta = nr_active - this_rq->calc_load_active;
2965 this_rq->calc_load_active = nr_active;
2973 * For NO_HZ we delay the active fold to the next LOAD_FREQ update.
2975 * When making the ILB scale, we should try to pull this in as well.
2977 static atomic_long_t calc_load_tasks_idle;
2979 static void calc_load_account_idle(struct rq *this_rq)
2983 delta = calc_load_fold_active(this_rq);
2985 atomic_long_add(delta, &calc_load_tasks_idle);
2988 static long calc_load_fold_idle(void)
2993 * Its got a race, we don't care...
2995 if (atomic_long_read(&calc_load_tasks_idle))
2996 delta = atomic_long_xchg(&calc_load_tasks_idle, 0);
3001 static void calc_load_account_idle(struct rq *this_rq)
3005 static inline long calc_load_fold_idle(void)
3012 * get_avenrun - get the load average array
3013 * @loads: pointer to dest load array
3014 * @offset: offset to add
3015 * @shift: shift count to shift the result left
3017 * These values are estimates at best, so no need for locking.
3019 void get_avenrun(unsigned long *loads, unsigned long offset, int shift)
3021 loads[0] = (avenrun[0] + offset) << shift;
3022 loads[1] = (avenrun[1] + offset) << shift;
3023 loads[2] = (avenrun[2] + offset) << shift;
3026 static unsigned long
3027 calc_load(unsigned long load, unsigned long exp, unsigned long active)
3030 load += active * (FIXED_1 - exp);
3031 return load >> FSHIFT;
3035 * calc_load - update the avenrun load estimates 10 ticks after the
3036 * CPUs have updated calc_load_tasks.
3038 void calc_global_load(void)
3040 unsigned long upd = calc_load_update + 10;
3043 if (time_before(jiffies, upd))
3046 active = atomic_long_read(&calc_load_tasks);
3047 active = active > 0 ? active * FIXED_1 : 0;
3049 avenrun[0] = calc_load(avenrun[0], EXP_1, active);
3050 avenrun[1] = calc_load(avenrun[1], EXP_5, active);
3051 avenrun[2] = calc_load(avenrun[2], EXP_15, active);
3053 calc_load_update += LOAD_FREQ;
3057 * Called from update_cpu_load() to periodically update this CPU's
3060 static void calc_load_account_active(struct rq *this_rq)
3064 if (time_before(jiffies, this_rq->calc_load_update))
3067 delta = calc_load_fold_active(this_rq);
3068 delta += calc_load_fold_idle();
3070 atomic_long_add(delta, &calc_load_tasks);
3072 this_rq->calc_load_update += LOAD_FREQ;
3076 * The exact cpuload at various idx values, calculated at every tick would be
3077 * load = (2^idx - 1) / 2^idx * load + 1 / 2^idx * cur_load
3079 * If a cpu misses updates for n-1 ticks (as it was idle) and update gets called
3080 * on nth tick when cpu may be busy, then we have:
3081 * load = ((2^idx - 1) / 2^idx)^(n-1) * load
3082 * load = (2^idx - 1) / 2^idx) * load + 1 / 2^idx * cur_load
3084 * decay_load_missed() below does efficient calculation of
3085 * load = ((2^idx - 1) / 2^idx)^(n-1) * load
3086 * avoiding 0..n-1 loop doing load = ((2^idx - 1) / 2^idx) * load
3088 * The calculation is approximated on a 128 point scale.
3089 * degrade_zero_ticks is the number of ticks after which load at any
3090 * particular idx is approximated to be zero.
3091 * degrade_factor is a precomputed table, a row for each load idx.
3092 * Each column corresponds to degradation factor for a power of two ticks,
3093 * based on 128 point scale.
3095 * row 2, col 3 (=12) says that the degradation at load idx 2 after
3096 * 8 ticks is 12/128 (which is an approximation of exact factor 3^8/4^8).
3098 * With this power of 2 load factors, we can degrade the load n times
3099 * by looking at 1 bits in n and doing as many mult/shift instead of
3100 * n mult/shifts needed by the exact degradation.
3102 #define DEGRADE_SHIFT 7
3103 static const unsigned char
3104 degrade_zero_ticks[CPU_LOAD_IDX_MAX] = {0, 8, 32, 64, 128};
3105 static const unsigned char
3106 degrade_factor[CPU_LOAD_IDX_MAX][DEGRADE_SHIFT + 1] = {
3107 {0, 0, 0, 0, 0, 0, 0, 0},
3108 {64, 32, 8, 0, 0, 0, 0, 0},
3109 {96, 72, 40, 12, 1, 0, 0},
3110 {112, 98, 75, 43, 15, 1, 0},
3111 {120, 112, 98, 76, 45, 16, 2} };
3114 * Update cpu_load for any missed ticks, due to tickless idle. The backlog
3115 * would be when CPU is idle and so we just decay the old load without
3116 * adding any new load.
3118 static unsigned long
3119 decay_load_missed(unsigned long load, unsigned long missed_updates, int idx)
3123 if (!missed_updates)
3126 if (missed_updates >= degrade_zero_ticks[idx])
3130 return load >> missed_updates;
3132 while (missed_updates) {
3133 if (missed_updates % 2)
3134 load = (load * degrade_factor[idx][j]) >> DEGRADE_SHIFT;
3136 missed_updates >>= 1;
3143 * Update rq->cpu_load[] statistics. This function is usually called every
3144 * scheduler tick (TICK_NSEC). With tickless idle this will not be called
3145 * every tick. We fix it up based on jiffies.
3147 static void update_cpu_load(struct rq *this_rq)
3149 unsigned long this_load = this_rq->load.weight;
3150 unsigned long curr_jiffies = jiffies;
3151 unsigned long pending_updates;
3154 this_rq->nr_load_updates++;
3156 /* Avoid repeated calls on same jiffy, when moving in and out of idle */
3157 if (curr_jiffies == this_rq->last_load_update_tick)
3160 pending_updates = curr_jiffies - this_rq->last_load_update_tick;
3161 this_rq->last_load_update_tick = curr_jiffies;
3163 /* Update our load: */
3164 this_rq->cpu_load[0] = this_load; /* Fasttrack for idx 0 */
3165 for (i = 1, scale = 2; i < CPU_LOAD_IDX_MAX; i++, scale += scale) {
3166 unsigned long old_load, new_load;
3168 /* scale is effectively 1 << i now, and >> i divides by scale */
3170 old_load = this_rq->cpu_load[i];
3171 old_load = decay_load_missed(old_load, pending_updates - 1, i);
3172 new_load = this_load;
3174 * Round up the averaging division if load is increasing. This
3175 * prevents us from getting stuck on 9 if the load is 10, for
3178 if (new_load > old_load)
3179 new_load += scale - 1;
3181 this_rq->cpu_load[i] = (old_load * (scale - 1) + new_load) >> i;
3184 sched_avg_update(this_rq);
3187 static void update_cpu_load_active(struct rq *this_rq)
3189 update_cpu_load(this_rq);
3191 calc_load_account_active(this_rq);
3197 * sched_exec - execve() is a valuable balancing opportunity, because at
3198 * this point the task has the smallest effective memory and cache footprint.
3200 void sched_exec(void)
3202 struct task_struct *p = current;
3203 unsigned long flags;
3207 rq = task_rq_lock(p, &flags);
3208 dest_cpu = p->sched_class->select_task_rq(rq, p, SD_BALANCE_EXEC, 0);
3209 if (dest_cpu == smp_processor_id())
3213 * select_task_rq() can race against ->cpus_allowed
3215 if (cpumask_test_cpu(dest_cpu, &p->cpus_allowed) &&
3216 likely(cpu_active(dest_cpu)) && migrate_task(p, dest_cpu)) {
3217 struct migration_arg arg = { p, dest_cpu };
3219 task_rq_unlock(rq, &flags);
3220 stop_one_cpu(cpu_of(rq), migration_cpu_stop, &arg);
3224 task_rq_unlock(rq, &flags);
3229 DEFINE_PER_CPU(struct kernel_stat, kstat);
3231 EXPORT_PER_CPU_SYMBOL(kstat);
3234 * Return any ns on the sched_clock that have not yet been accounted in
3235 * @p in case that task is currently running.
3237 * Called with task_rq_lock() held on @rq.
3239 static u64 do_task_delta_exec(struct task_struct *p, struct rq *rq)
3243 if (task_current(rq, p)) {
3244 update_rq_clock(rq);
3245 ns = rq->clock - p->se.exec_start;
3253 unsigned long long task_delta_exec(struct task_struct *p)
3255 unsigned long flags;
3259 rq = task_rq_lock(p, &flags);
3260 ns = do_task_delta_exec(p, rq);
3261 task_rq_unlock(rq, &flags);
3267 * Return accounted runtime for the task.
3268 * In case the task is currently running, return the runtime plus current's
3269 * pending runtime that have not been accounted yet.
3271 unsigned long long task_sched_runtime(struct task_struct *p)
3273 unsigned long flags;
3277 rq = task_rq_lock(p, &flags);
3278 ns = p->se.sum_exec_runtime + do_task_delta_exec(p, rq);
3279 task_rq_unlock(rq, &flags);
3285 * Return sum_exec_runtime for the thread group.
3286 * In case the task is currently running, return the sum plus current's
3287 * pending runtime that have not been accounted yet.
3289 * Note that the thread group might have other running tasks as well,
3290 * so the return value not includes other pending runtime that other
3291 * running tasks might have.
3293 unsigned long long thread_group_sched_runtime(struct task_struct *p)
3295 struct task_cputime totals;
3296 unsigned long flags;
3300 rq = task_rq_lock(p, &flags);
3301 thread_group_cputime(p, &totals);
3302 ns = totals.sum_exec_runtime + do_task_delta_exec(p, rq);
3303 task_rq_unlock(rq, &flags);
3309 * Account user cpu time to a process.
3310 * @p: the process that the cpu time gets accounted to
3311 * @cputime: the cpu time spent in user space since the last update
3312 * @cputime_scaled: cputime scaled by cpu frequency
3314 void account_user_time(struct task_struct *p, cputime_t cputime,
3315 cputime_t cputime_scaled)
3317 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
3320 /* Add user time to process. */
3321 p->utime = cputime_add(p->utime, cputime);
3322 p->utimescaled = cputime_add(p->utimescaled, cputime_scaled);
3323 account_group_user_time(p, cputime);
3325 /* Add user time to cpustat. */
3326 tmp = cputime_to_cputime64(cputime);
3327 if (TASK_NICE(p) > 0)
3328 cpustat->nice = cputime64_add(cpustat->nice, tmp);
3330 cpustat->user = cputime64_add(cpustat->user, tmp);
3332 cpuacct_update_stats(p, CPUACCT_STAT_USER, cputime);
3333 /* Account for user time used */
3334 acct_update_integrals(p);
3338 * Account guest cpu time to a process.
3339 * @p: the process that the cpu time gets accounted to
3340 * @cputime: the cpu time spent in virtual machine since the last update
3341 * @cputime_scaled: cputime scaled by cpu frequency
3343 static void account_guest_time(struct task_struct *p, cputime_t cputime,
3344 cputime_t cputime_scaled)
3347 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
3349 tmp = cputime_to_cputime64(cputime);
3351 /* Add guest time to process. */
3352 p->utime = cputime_add(p->utime, cputime);
3353 p->utimescaled = cputime_add(p->utimescaled, cputime_scaled);
3354 account_group_user_time(p, cputime);
3355 p->gtime = cputime_add(p->gtime, cputime);
3357 /* Add guest time to cpustat. */
3358 if (TASK_NICE(p) > 0) {
3359 cpustat->nice = cputime64_add(cpustat->nice, tmp);
3360 cpustat->guest_nice = cputime64_add(cpustat->guest_nice, tmp);
3362 cpustat->user = cputime64_add(cpustat->user, tmp);
3363 cpustat->guest = cputime64_add(cpustat->guest, tmp);
3368 * Account system cpu time to a process.
3369 * @p: the process that the cpu time gets accounted to
3370 * @hardirq_offset: the offset to subtract from hardirq_count()
3371 * @cputime: the cpu time spent in kernel space since the last update
3372 * @cputime_scaled: cputime scaled by cpu frequency
3374 void account_system_time(struct task_struct *p, int hardirq_offset,
3375 cputime_t cputime, cputime_t cputime_scaled)
3377 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
3380 if ((p->flags & PF_VCPU) && (irq_count() - hardirq_offset == 0)) {
3381 account_guest_time(p, cputime, cputime_scaled);
3385 /* Add system time to process. */
3386 p->stime = cputime_add(p->stime, cputime);
3387 p->stimescaled = cputime_add(p->stimescaled, cputime_scaled);
3388 account_group_system_time(p, cputime);
3390 /* Add system time to cpustat. */
3391 tmp = cputime_to_cputime64(cputime);
3392 if (hardirq_count() - hardirq_offset)
3393 cpustat->irq = cputime64_add(cpustat->irq, tmp);
3394 else if (softirq_count())
3395 cpustat->softirq = cputime64_add(cpustat->softirq, tmp);
3397 cpustat->system = cputime64_add(cpustat->system, tmp);
3399 cpuacct_update_stats(p, CPUACCT_STAT_SYSTEM, cputime);
3401 /* Account for system time used */
3402 acct_update_integrals(p);
3406 * Account for involuntary wait time.
3407 * @steal: the cpu time spent in involuntary wait
3409 void account_steal_time(cputime_t cputime)
3411 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
3412 cputime64_t cputime64 = cputime_to_cputime64(cputime);
3414 cpustat->steal = cputime64_add(cpustat->steal, cputime64);
3418 * Account for idle time.
3419 * @cputime: the cpu time spent in idle wait
3421 void account_idle_time(cputime_t cputime)
3423 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
3424 cputime64_t cputime64 = cputime_to_cputime64(cputime);
3425 struct rq *rq = this_rq();
3427 if (atomic_read(&rq->nr_iowait) > 0)
3428 cpustat->iowait = cputime64_add(cpustat->iowait, cputime64);
3430 cpustat->idle = cputime64_add(cpustat->idle, cputime64);
3433 #ifndef CONFIG_VIRT_CPU_ACCOUNTING
3436 * Account a single tick of cpu time.
3437 * @p: the process that the cpu time gets accounted to
3438 * @user_tick: indicates if the tick is a user or a system tick
3440 void account_process_tick(struct task_struct *p, int user_tick)
3442 cputime_t one_jiffy_scaled = cputime_to_scaled(cputime_one_jiffy);
3443 struct rq *rq = this_rq();
3446 account_user_time(p, cputime_one_jiffy, one_jiffy_scaled);
3447 else if ((p != rq->idle) || (irq_count() != HARDIRQ_OFFSET))
3448 account_system_time(p, HARDIRQ_OFFSET, cputime_one_jiffy,
3451 account_idle_time(cputime_one_jiffy);
3455 * Account multiple ticks of steal time.
3456 * @p: the process from which the cpu time has been stolen
3457 * @ticks: number of stolen ticks
3459 void account_steal_ticks(unsigned long ticks)
3461 account_steal_time(jiffies_to_cputime(ticks));
3465 * Account multiple ticks of idle time.
3466 * @ticks: number of stolen ticks
3468 void account_idle_ticks(unsigned long ticks)
3470 account_idle_time(jiffies_to_cputime(ticks));
3476 * Use precise platform statistics if available:
3478 #ifdef CONFIG_VIRT_CPU_ACCOUNTING
3479 void task_times(struct task_struct *p, cputime_t *ut, cputime_t *st)
3485 void thread_group_times(struct task_struct *p, cputime_t *ut, cputime_t *st)
3487 struct task_cputime cputime;
3489 thread_group_cputime(p, &cputime);
3491 *ut = cputime.utime;
3492 *st = cputime.stime;
3496 #ifndef nsecs_to_cputime
3497 # define nsecs_to_cputime(__nsecs) nsecs_to_jiffies(__nsecs)
3500 void task_times(struct task_struct *p, cputime_t *ut, cputime_t *st)
3502 cputime_t rtime, utime = p->utime, total = cputime_add(utime, p->stime);
3505 * Use CFS's precise accounting:
3507 rtime = nsecs_to_cputime(p->se.sum_exec_runtime);
3513 do_div(temp, total);
3514 utime = (cputime_t)temp;
3519 * Compare with previous values, to keep monotonicity:
3521 p->prev_utime = max(p->prev_utime, utime);
3522 p->prev_stime = max(p->prev_stime, cputime_sub(rtime, p->prev_utime));
3524 *ut = p->prev_utime;
3525 *st = p->prev_stime;
3529 * Must be called with siglock held.
3531 void thread_group_times(struct task_struct *p, cputime_t *ut, cputime_t *st)
3533 struct signal_struct *sig = p->signal;
3534 struct task_cputime cputime;
3535 cputime_t rtime, utime, total;
3537 thread_group_cputime(p, &cputime);
3539 total = cputime_add(cputime.utime, cputime.stime);
3540 rtime = nsecs_to_cputime(cputime.sum_exec_runtime);
3545 temp *= cputime.utime;
3546 do_div(temp, total);
3547 utime = (cputime_t)temp;
3551 sig->prev_utime = max(sig->prev_utime, utime);
3552 sig->prev_stime = max(sig->prev_stime,
3553 cputime_sub(rtime, sig->prev_utime));
3555 *ut = sig->prev_utime;
3556 *st = sig->prev_stime;
3561 * This function gets called by the timer code, with HZ frequency.
3562 * We call it with interrupts disabled.
3564 * It also gets called by the fork code, when changing the parent's
3567 void scheduler_tick(void)
3569 int cpu = smp_processor_id();
3570 struct rq *rq = cpu_rq(cpu);
3571 struct task_struct *curr = rq->curr;
3575 raw_spin_lock(&rq->lock);
3576 update_rq_clock(rq);
3577 update_cpu_load_active(rq);
3578 curr->sched_class->task_tick(rq, curr, 0);
3579 raw_spin_unlock(&rq->lock);
3581 perf_event_task_tick(curr);
3584 rq->idle_at_tick = idle_cpu(cpu);
3585 trigger_load_balance(rq, cpu);
3589 notrace unsigned long get_parent_ip(unsigned long addr)
3591 if (in_lock_functions(addr)) {
3592 addr = CALLER_ADDR2;
3593 if (in_lock_functions(addr))
3594 addr = CALLER_ADDR3;
3599 #if defined(CONFIG_PREEMPT) && (defined(CONFIG_DEBUG_PREEMPT) || \
3600 defined(CONFIG_PREEMPT_TRACER))
3602 void __kprobes add_preempt_count(int val)
3604 #ifdef CONFIG_DEBUG_PREEMPT
3608 if (DEBUG_LOCKS_WARN_ON((preempt_count() < 0)))
3611 preempt_count() += val;
3612 #ifdef CONFIG_DEBUG_PREEMPT
3614 * Spinlock count overflowing soon?
3616 DEBUG_LOCKS_WARN_ON((preempt_count() & PREEMPT_MASK) >=
3619 if (preempt_count() == val)
3620 trace_preempt_off(CALLER_ADDR0, get_parent_ip(CALLER_ADDR1));
3622 EXPORT_SYMBOL(add_preempt_count);
3624 void __kprobes sub_preempt_count(int val)
3626 #ifdef CONFIG_DEBUG_PREEMPT
3630 if (DEBUG_LOCKS_WARN_ON(val > preempt_count()))
3633 * Is the spinlock portion underflowing?
3635 if (DEBUG_LOCKS_WARN_ON((val < PREEMPT_MASK) &&
3636 !(preempt_count() & PREEMPT_MASK)))
3640 if (preempt_count() == val)
3641 trace_preempt_on(CALLER_ADDR0, get_parent_ip(CALLER_ADDR1));
3642 preempt_count() -= val;
3644 EXPORT_SYMBOL(sub_preempt_count);
3649 * Print scheduling while atomic bug:
3651 static noinline void __schedule_bug(struct task_struct *prev)
3653 struct pt_regs *regs = get_irq_regs();
3655 printk(KERN_ERR "BUG: scheduling while atomic: %s/%d/0x%08x\n",
3656 prev->comm, prev->pid, preempt_count());
3658 debug_show_held_locks(prev);
3660 if (irqs_disabled())
3661 print_irqtrace_events(prev);
3670 * Various schedule()-time debugging checks and statistics:
3672 static inline void schedule_debug(struct task_struct *prev)
3675 * Test if we are atomic. Since do_exit() needs to call into
3676 * schedule() atomically, we ignore that path for now.
3677 * Otherwise, whine if we are scheduling when we should not be.
3679 if (unlikely(in_atomic_preempt_off() && !prev->exit_state))
3680 __schedule_bug(prev);
3682 profile_hit(SCHED_PROFILING, __builtin_return_address(0));
3684 schedstat_inc(this_rq(), sched_count);
3685 #ifdef CONFIG_SCHEDSTATS
3686 if (unlikely(prev->lock_depth >= 0)) {
3687 schedstat_inc(this_rq(), bkl_count);
3688 schedstat_inc(prev, sched_info.bkl_count);
3693 static void put_prev_task(struct rq *rq, struct task_struct *prev)
3696 update_rq_clock(rq);
3697 rq->skip_clock_update = 0;
3698 prev->sched_class->put_prev_task(rq, prev);
3702 * Pick up the highest-prio task:
3704 static inline struct task_struct *
3705 pick_next_task(struct rq *rq)
3707 const struct sched_class *class;
3708 struct task_struct *p;
3711 * Optimization: we know that if all tasks are in
3712 * the fair class we can call that function directly:
3714 if (likely(rq->nr_running == rq->cfs.nr_running)) {
3715 p = fair_sched_class.pick_next_task(rq);
3720 class = sched_class_highest;
3722 p = class->pick_next_task(rq);
3726 * Will never be NULL as the idle class always
3727 * returns a non-NULL p:
3729 class = class->next;
3734 * schedule() is the main scheduler function.
3736 asmlinkage void __sched schedule(void)
3738 struct task_struct *prev, *next;
3739 unsigned long *switch_count;
3745 cpu = smp_processor_id();
3747 rcu_note_context_switch(cpu);
3750 release_kernel_lock(prev);
3751 need_resched_nonpreemptible:
3753 schedule_debug(prev);
3755 if (sched_feat(HRTICK))
3758 raw_spin_lock_irq(&rq->lock);
3759 clear_tsk_need_resched(prev);
3761 switch_count = &prev->nivcsw;
3762 if (prev->state && !(preempt_count() & PREEMPT_ACTIVE)) {
3763 if (unlikely(signal_pending_state(prev->state, prev))) {
3764 prev->state = TASK_RUNNING;
3767 * If a worker is going to sleep, notify and
3768 * ask workqueue whether it wants to wake up a
3769 * task to maintain concurrency. If so, wake
3772 if (prev->flags & PF_WQ_WORKER) {
3773 struct task_struct *to_wakeup;
3775 to_wakeup = wq_worker_sleeping(prev, cpu);
3777 try_to_wake_up_local(to_wakeup);
3779 deactivate_task(rq, prev, DEQUEUE_SLEEP);
3781 switch_count = &prev->nvcsw;
3784 pre_schedule(rq, prev);
3786 if (unlikely(!rq->nr_running))
3787 idle_balance(cpu, rq);
3789 put_prev_task(rq, prev);
3790 next = pick_next_task(rq);
3792 if (likely(prev != next)) {
3793 sched_info_switch(prev, next);
3794 perf_event_task_sched_out(prev, next);
3800 context_switch(rq, prev, next); /* unlocks the rq */
3802 * The context switch have flipped the stack from under us
3803 * and restored the local variables which were saved when
3804 * this task called schedule() in the past. prev == current
3805 * is still correct, but it can be moved to another cpu/rq.
3807 cpu = smp_processor_id();
3810 raw_spin_unlock_irq(&rq->lock);
3814 if (unlikely(reacquire_kernel_lock(prev)))
3815 goto need_resched_nonpreemptible;
3817 preempt_enable_no_resched();
3821 EXPORT_SYMBOL(schedule);
3823 #ifdef CONFIG_MUTEX_SPIN_ON_OWNER
3825 * Look out! "owner" is an entirely speculative pointer
3826 * access and not reliable.
3828 int mutex_spin_on_owner(struct mutex *lock, struct thread_info *owner)
3833 if (!sched_feat(OWNER_SPIN))
3836 #ifdef CONFIG_DEBUG_PAGEALLOC
3838 * Need to access the cpu field knowing that
3839 * DEBUG_PAGEALLOC could have unmapped it if
3840 * the mutex owner just released it and exited.
3842 if (probe_kernel_address(&owner->cpu, cpu))
3849 * Even if the access succeeded (likely case),
3850 * the cpu field may no longer be valid.
3852 if (cpu >= nr_cpumask_bits)
3856 * We need to validate that we can do a
3857 * get_cpu() and that we have the percpu area.
3859 if (!cpu_online(cpu))
3866 * Owner changed, break to re-assess state.
3868 if (lock->owner != owner) {
3870 * If the lock has switched to a different owner,
3871 * we likely have heavy contention. Return 0 to quit
3872 * optimistic spinning and not contend further:
3880 * Is that owner really running on that cpu?
3882 if (task_thread_info(rq->curr) != owner || need_resched())
3892 #ifdef CONFIG_PREEMPT
3894 * this is the entry point to schedule() from in-kernel preemption
3895 * off of preempt_enable. Kernel preemptions off return from interrupt
3896 * occur there and call schedule directly.
3898 asmlinkage void __sched notrace preempt_schedule(void)
3900 struct thread_info *ti = current_thread_info();
3903 * If there is a non-zero preempt_count or interrupts are disabled,
3904 * we do not want to preempt the current task. Just return..
3906 if (likely(ti->preempt_count || irqs_disabled()))
3910 add_preempt_count_notrace(PREEMPT_ACTIVE);
3912 sub_preempt_count_notrace(PREEMPT_ACTIVE);
3915 * Check again in case we missed a preemption opportunity
3916 * between schedule and now.
3919 } while (need_resched());
3921 EXPORT_SYMBOL(preempt_schedule);
3924 * this is the entry point to schedule() from kernel preemption
3925 * off of irq context.
3926 * Note, that this is called and return with irqs disabled. This will
3927 * protect us against recursive calling from irq.
3929 asmlinkage void __sched preempt_schedule_irq(void)
3931 struct thread_info *ti = current_thread_info();
3933 /* Catch callers which need to be fixed */
3934 BUG_ON(ti->preempt_count || !irqs_disabled());
3937 add_preempt_count(PREEMPT_ACTIVE);
3940 local_irq_disable();
3941 sub_preempt_count(PREEMPT_ACTIVE);
3944 * Check again in case we missed a preemption opportunity
3945 * between schedule and now.
3948 } while (need_resched());
3951 #endif /* CONFIG_PREEMPT */
3953 int default_wake_function(wait_queue_t *curr, unsigned mode, int wake_flags,
3956 return try_to_wake_up(curr->private, mode, wake_flags);
3958 EXPORT_SYMBOL(default_wake_function);
3961 * The core wakeup function. Non-exclusive wakeups (nr_exclusive == 0) just
3962 * wake everything up. If it's an exclusive wakeup (nr_exclusive == small +ve
3963 * number) then we wake all the non-exclusive tasks and one exclusive task.
3965 * There are circumstances in which we can try to wake a task which has already
3966 * started to run but is not in state TASK_RUNNING. try_to_wake_up() returns
3967 * zero in this (rare) case, and we handle it by continuing to scan the queue.
3969 static void __wake_up_common(wait_queue_head_t *q, unsigned int mode,
3970 int nr_exclusive, int wake_flags, void *key)
3972 wait_queue_t *curr, *next;
3974 list_for_each_entry_safe(curr, next, &q->task_list, task_list) {
3975 unsigned flags = curr->flags;
3977 if (curr->func(curr, mode, wake_flags, key) &&
3978 (flags & WQ_FLAG_EXCLUSIVE) && !--nr_exclusive)
3984 * __wake_up - wake up threads blocked on a waitqueue.
3986 * @mode: which threads
3987 * @nr_exclusive: how many wake-one or wake-many threads to wake up
3988 * @key: is directly passed to the wakeup function
3990 * It may be assumed that this function implies a write memory barrier before
3991 * changing the task state if and only if any tasks are woken up.
3993 void __wake_up(wait_queue_head_t *q, unsigned int mode,
3994 int nr_exclusive, void *key)
3996 unsigned long flags;
3998 spin_lock_irqsave(&q->lock, flags);
3999 __wake_up_common(q, mode, nr_exclusive, 0, key);
4000 spin_unlock_irqrestore(&q->lock, flags);
4002 EXPORT_SYMBOL(__wake_up);
4005 * Same as __wake_up but called with the spinlock in wait_queue_head_t held.
4007 void __wake_up_locked(wait_queue_head_t *q, unsigned int mode)
4009 __wake_up_common(q, mode, 1, 0, NULL);
4011 EXPORT_SYMBOL_GPL(__wake_up_locked);
4013 void __wake_up_locked_key(wait_queue_head_t *q, unsigned int mode, void *key)
4015 __wake_up_common(q, mode, 1, 0, key);
4019 * __wake_up_sync_key - wake up threads blocked on a waitqueue.
4021 * @mode: which threads
4022 * @nr_exclusive: how many wake-one or wake-many threads to wake up
4023 * @key: opaque value to be passed to wakeup targets
4025 * The sync wakeup differs that the waker knows that it will schedule
4026 * away soon, so while the target thread will be woken up, it will not
4027 * be migrated to another CPU - ie. the two threads are 'synchronized'
4028 * with each other. This can prevent needless bouncing between CPUs.
4030 * On UP it can prevent extra preemption.
4032 * It may be assumed that this function implies a write memory barrier before
4033 * changing the task state if and only if any tasks are woken up.
4035 void __wake_up_sync_key(wait_queue_head_t *q, unsigned int mode,
4036 int nr_exclusive, void *key)
4038 unsigned long flags;
4039 int wake_flags = WF_SYNC;
4044 if (unlikely(!nr_exclusive))
4047 spin_lock_irqsave(&q->lock, flags);
4048 __wake_up_common(q, mode, nr_exclusive, wake_flags, key);
4049 spin_unlock_irqrestore(&q->lock, flags);
4051 EXPORT_SYMBOL_GPL(__wake_up_sync_key);
4054 * __wake_up_sync - see __wake_up_sync_key()
4056 void __wake_up_sync(wait_queue_head_t *q, unsigned int mode, int nr_exclusive)
4058 __wake_up_sync_key(q, mode, nr_exclusive, NULL);
4060 EXPORT_SYMBOL_GPL(__wake_up_sync); /* For internal use only */
4063 * complete: - signals a single thread waiting on this completion
4064 * @x: holds the state of this particular completion
4066 * This will wake up a single thread waiting on this completion. Threads will be
4067 * awakened in the same order in which they were queued.
4069 * See also complete_all(), wait_for_completion() and related routines.
4071 * It may be assumed that this function implies a write memory barrier before
4072 * changing the task state if and only if any tasks are woken up.
4074 void complete(struct completion *x)
4076 unsigned long flags;
4078 spin_lock_irqsave(&x->wait.lock, flags);
4080 __wake_up_common(&x->wait, TASK_NORMAL, 1, 0, NULL);
4081 spin_unlock_irqrestore(&x->wait.lock, flags);
4083 EXPORT_SYMBOL(complete);
4086 * complete_all: - signals all threads waiting on this completion
4087 * @x: holds the state of this particular completion
4089 * This will wake up all threads waiting on this particular completion event.
4091 * It may be assumed that this function implies a write memory barrier before
4092 * changing the task state if and only if any tasks are woken up.
4094 void complete_all(struct completion *x)
4096 unsigned long flags;
4098 spin_lock_irqsave(&x->wait.lock, flags);
4099 x->done += UINT_MAX/2;
4100 __wake_up_common(&x->wait, TASK_NORMAL, 0, 0, NULL);
4101 spin_unlock_irqrestore(&x->wait.lock, flags);
4103 EXPORT_SYMBOL(complete_all);
4105 static inline long __sched
4106 do_wait_for_common(struct completion *x, long timeout, int state)
4109 DECLARE_WAITQUEUE(wait, current);
4111 __add_wait_queue_tail_exclusive(&x->wait, &wait);
4113 if (signal_pending_state(state, current)) {
4114 timeout = -ERESTARTSYS;
4117 __set_current_state(state);
4118 spin_unlock_irq(&x->wait.lock);
4119 timeout = schedule_timeout(timeout);
4120 spin_lock_irq(&x->wait.lock);
4121 } while (!x->done && timeout);
4122 __remove_wait_queue(&x->wait, &wait);
4127 return timeout ?: 1;
4131 wait_for_common(struct completion *x, long timeout, int state)
4135 spin_lock_irq(&x->wait.lock);
4136 timeout = do_wait_for_common(x, timeout, state);
4137 spin_unlock_irq(&x->wait.lock);
4142 * wait_for_completion: - waits for completion of a task
4143 * @x: holds the state of this particular completion
4145 * This waits to be signaled for completion of a specific task. It is NOT
4146 * interruptible and there is no timeout.
4148 * See also similar routines (i.e. wait_for_completion_timeout()) with timeout
4149 * and interrupt capability. Also see complete().
4151 void __sched wait_for_completion(struct completion *x)
4153 wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_UNINTERRUPTIBLE);
4155 EXPORT_SYMBOL(wait_for_completion);
4158 * wait_for_completion_timeout: - waits for completion of a task (w/timeout)
4159 * @x: holds the state of this particular completion
4160 * @timeout: timeout value in jiffies
4162 * This waits for either a completion of a specific task to be signaled or for a
4163 * specified timeout to expire. The timeout is in jiffies. It is not
4166 unsigned long __sched
4167 wait_for_completion_timeout(struct completion *x, unsigned long timeout)
4169 return wait_for_common(x, timeout, TASK_UNINTERRUPTIBLE);
4171 EXPORT_SYMBOL(wait_for_completion_timeout);
4174 * wait_for_completion_interruptible: - waits for completion of a task (w/intr)
4175 * @x: holds the state of this particular completion
4177 * This waits for completion of a specific task to be signaled. It is
4180 int __sched wait_for_completion_interruptible(struct completion *x)
4182 long t = wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_INTERRUPTIBLE);
4183 if (t == -ERESTARTSYS)
4187 EXPORT_SYMBOL(wait_for_completion_interruptible);
4190 * wait_for_completion_interruptible_timeout: - waits for completion (w/(to,intr))
4191 * @x: holds the state of this particular completion
4192 * @timeout: timeout value in jiffies
4194 * This waits for either a completion of a specific task to be signaled or for a
4195 * specified timeout to expire. It is interruptible. The timeout is in jiffies.
4197 unsigned long __sched
4198 wait_for_completion_interruptible_timeout(struct completion *x,
4199 unsigned long timeout)
4201 return wait_for_common(x, timeout, TASK_INTERRUPTIBLE);
4203 EXPORT_SYMBOL(wait_for_completion_interruptible_timeout);
4206 * wait_for_completion_killable: - waits for completion of a task (killable)
4207 * @x: holds the state of this particular completion
4209 * This waits to be signaled for completion of a specific task. It can be
4210 * interrupted by a kill signal.
4212 int __sched wait_for_completion_killable(struct completion *x)
4214 long t = wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_KILLABLE);
4215 if (t == -ERESTARTSYS)
4219 EXPORT_SYMBOL(wait_for_completion_killable);
4222 * wait_for_completion_killable_timeout: - waits for completion of a task (w/(to,killable))
4223 * @x: holds the state of this particular completion
4224 * @timeout: timeout value in jiffies
4226 * This waits for either a completion of a specific task to be
4227 * signaled or for a specified timeout to expire. It can be
4228 * interrupted by a kill signal. The timeout is in jiffies.
4230 unsigned long __sched
4231 wait_for_completion_killable_timeout(struct completion *x,
4232 unsigned long timeout)
4234 return wait_for_common(x, timeout, TASK_KILLABLE);
4236 EXPORT_SYMBOL(wait_for_completion_killable_timeout);
4239 * try_wait_for_completion - try to decrement a completion without blocking
4240 * @x: completion structure
4242 * Returns: 0 if a decrement cannot be done without blocking
4243 * 1 if a decrement succeeded.
4245 * If a completion is being used as a counting completion,
4246 * attempt to decrement the counter without blocking. This
4247 * enables us to avoid waiting if the resource the completion
4248 * is protecting is not available.
4250 bool try_wait_for_completion(struct completion *x)
4252 unsigned long flags;
4255 spin_lock_irqsave(&x->wait.lock, flags);
4260 spin_unlock_irqrestore(&x->wait.lock, flags);
4263 EXPORT_SYMBOL(try_wait_for_completion);
4266 * completion_done - Test to see if a completion has any waiters
4267 * @x: completion structure
4269 * Returns: 0 if there are waiters (wait_for_completion() in progress)
4270 * 1 if there are no waiters.
4273 bool completion_done(struct completion *x)
4275 unsigned long flags;
4278 spin_lock_irqsave(&x->wait.lock, flags);
4281 spin_unlock_irqrestore(&x->wait.lock, flags);
4284 EXPORT_SYMBOL(completion_done);
4287 sleep_on_common(wait_queue_head_t *q, int state, long timeout)
4289 unsigned long flags;
4292 init_waitqueue_entry(&wait, current);
4294 __set_current_state(state);
4296 spin_lock_irqsave(&q->lock, flags);
4297 __add_wait_queue(q, &wait);
4298 spin_unlock(&q->lock);
4299 timeout = schedule_timeout(timeout);
4300 spin_lock_irq(&q->lock);
4301 __remove_wait_queue(q, &wait);
4302 spin_unlock_irqrestore(&q->lock, flags);
4307 void __sched interruptible_sleep_on(wait_queue_head_t *q)
4309 sleep_on_common(q, TASK_INTERRUPTIBLE, MAX_SCHEDULE_TIMEOUT);
4311 EXPORT_SYMBOL(interruptible_sleep_on);
4314 interruptible_sleep_on_timeout(wait_queue_head_t *q, long timeout)
4316 return sleep_on_common(q, TASK_INTERRUPTIBLE, timeout);
4318 EXPORT_SYMBOL(interruptible_sleep_on_timeout);
4320 void __sched sleep_on(wait_queue_head_t *q)
4322 sleep_on_common(q, TASK_UNINTERRUPTIBLE, MAX_SCHEDULE_TIMEOUT);
4324 EXPORT_SYMBOL(sleep_on);
4326 long __sched sleep_on_timeout(wait_queue_head_t *q, long timeout)
4328 return sleep_on_common(q, TASK_UNINTERRUPTIBLE, timeout);
4330 EXPORT_SYMBOL(sleep_on_timeout);
4332 #ifdef CONFIG_RT_MUTEXES
4335 * rt_mutex_setprio - set the current priority of a task
4337 * @prio: prio value (kernel-internal form)
4339 * This function changes the 'effective' priority of a task. It does
4340 * not touch ->normal_prio like __setscheduler().
4342 * Used by the rt_mutex code to implement priority inheritance logic.
4344 void rt_mutex_setprio(struct task_struct *p, int prio)
4346 unsigned long flags;
4347 int oldprio, on_rq, running;
4349 const struct sched_class *prev_class;
4351 BUG_ON(prio < 0 || prio > MAX_PRIO);
4353 rq = task_rq_lock(p, &flags);
4356 prev_class = p->sched_class;
4357 on_rq = p->se.on_rq;
4358 running = task_current(rq, p);
4360 dequeue_task(rq, p, 0);
4362 p->sched_class->put_prev_task(rq, p);
4365 p->sched_class = &rt_sched_class;
4367 p->sched_class = &fair_sched_class;
4372 p->sched_class->set_curr_task(rq);
4374 enqueue_task(rq, p, oldprio < prio ? ENQUEUE_HEAD : 0);
4376 check_class_changed(rq, p, prev_class, oldprio, running);
4378 task_rq_unlock(rq, &flags);
4383 void set_user_nice(struct task_struct *p, long nice)
4385 int old_prio, delta, on_rq;
4386 unsigned long flags;
4389 if (TASK_NICE(p) == nice || nice < -20 || nice > 19)
4392 * We have to be careful, if called from sys_setpriority(),
4393 * the task might be in the middle of scheduling on another CPU.
4395 rq = task_rq_lock(p, &flags);
4397 * The RT priorities are set via sched_setscheduler(), but we still
4398 * allow the 'normal' nice value to be set - but as expected
4399 * it wont have any effect on scheduling until the task is
4400 * SCHED_FIFO/SCHED_RR:
4402 if (task_has_rt_policy(p)) {
4403 p->static_prio = NICE_TO_PRIO(nice);
4406 on_rq = p->se.on_rq;
4408 dequeue_task(rq, p, 0);
4410 p->static_prio = NICE_TO_PRIO(nice);
4413 p->prio = effective_prio(p);
4414 delta = p->prio - old_prio;
4417 enqueue_task(rq, p, 0);
4419 * If the task increased its priority or is running and
4420 * lowered its priority, then reschedule its CPU:
4422 if (delta < 0 || (delta > 0 && task_running(rq, p)))
4423 resched_task(rq->curr);
4426 task_rq_unlock(rq, &flags);
4428 EXPORT_SYMBOL(set_user_nice);
4431 * can_nice - check if a task can reduce its nice value
4435 int can_nice(const struct task_struct *p, const int nice)
4437 /* convert nice value [19,-20] to rlimit style value [1,40] */
4438 int nice_rlim = 20 - nice;
4440 return (nice_rlim <= task_rlimit(p, RLIMIT_NICE) ||
4441 capable(CAP_SYS_NICE));
4444 #ifdef __ARCH_WANT_SYS_NICE
4447 * sys_nice - change the priority of the current process.
4448 * @increment: priority increment
4450 * sys_setpriority is a more generic, but much slower function that
4451 * does similar things.
4453 SYSCALL_DEFINE1(nice, int, increment)
4458 * Setpriority might change our priority at the same moment.
4459 * We don't have to worry. Conceptually one call occurs first
4460 * and we have a single winner.
4462 if (increment < -40)
4467 nice = TASK_NICE(current) + increment;
4473 if (increment < 0 && !can_nice(current, nice))
4476 retval = security_task_setnice(current, nice);
4480 set_user_nice(current, nice);
4487 * task_prio - return the priority value of a given task.
4488 * @p: the task in question.
4490 * This is the priority value as seen by users in /proc.
4491 * RT tasks are offset by -200. Normal tasks are centered
4492 * around 0, value goes from -16 to +15.
4494 int task_prio(const struct task_struct *p)
4496 return p->prio - MAX_RT_PRIO;
4500 * task_nice - return the nice value of a given task.
4501 * @p: the task in question.
4503 int task_nice(const struct task_struct *p)
4505 return TASK_NICE(p);
4507 EXPORT_SYMBOL(task_nice);
4510 * idle_cpu - is a given cpu idle currently?
4511 * @cpu: the processor in question.
4513 int idle_cpu(int cpu)
4515 return cpu_curr(cpu) == cpu_rq(cpu)->idle;
4519 * idle_task - return the idle task for a given cpu.
4520 * @cpu: the processor in question.
4522 struct task_struct *idle_task(int cpu)
4524 return cpu_rq(cpu)->idle;
4528 * find_process_by_pid - find a process with a matching PID value.
4529 * @pid: the pid in question.
4531 static struct task_struct *find_process_by_pid(pid_t pid)
4533 return pid ? find_task_by_vpid(pid) : current;
4536 /* Actually do priority change: must hold rq lock. */
4538 __setscheduler(struct rq *rq, struct task_struct *p, int policy, int prio)
4540 BUG_ON(p->se.on_rq);
4543 p->rt_priority = prio;
4544 p->normal_prio = normal_prio(p);
4545 /* we are holding p->pi_lock already */
4546 p->prio = rt_mutex_getprio(p);
4547 if (rt_prio(p->prio))
4548 p->sched_class = &rt_sched_class;
4550 p->sched_class = &fair_sched_class;
4555 * check the target process has a UID that matches the current process's
4557 static bool check_same_owner(struct task_struct *p)
4559 const struct cred *cred = current_cred(), *pcred;
4563 pcred = __task_cred(p);
4564 match = (cred->euid == pcred->euid ||
4565 cred->euid == pcred->uid);
4570 static int __sched_setscheduler(struct task_struct *p, int policy,
4571 struct sched_param *param, bool user)
4573 int retval, oldprio, oldpolicy = -1, on_rq, running;
4574 unsigned long flags;
4575 const struct sched_class *prev_class;
4579 /* may grab non-irq protected spin_locks */
4580 BUG_ON(in_interrupt());
4582 /* double check policy once rq lock held */
4584 reset_on_fork = p->sched_reset_on_fork;
4585 policy = oldpolicy = p->policy;
4587 reset_on_fork = !!(policy & SCHED_RESET_ON_FORK);
4588 policy &= ~SCHED_RESET_ON_FORK;
4590 if (policy != SCHED_FIFO && policy != SCHED_RR &&
4591 policy != SCHED_NORMAL && policy != SCHED_BATCH &&
4592 policy != SCHED_IDLE)
4597 * Valid priorities for SCHED_FIFO and SCHED_RR are
4598 * 1..MAX_USER_RT_PRIO-1, valid priority for SCHED_NORMAL,
4599 * SCHED_BATCH and SCHED_IDLE is 0.
4601 if (param->sched_priority < 0 ||
4602 (p->mm && param->sched_priority > MAX_USER_RT_PRIO-1) ||
4603 (!p->mm && param->sched_priority > MAX_RT_PRIO-1))
4605 if (rt_policy(policy) != (param->sched_priority != 0))
4609 * Allow unprivileged RT tasks to decrease priority:
4611 if (user && !capable(CAP_SYS_NICE)) {
4612 if (rt_policy(policy)) {
4613 unsigned long rlim_rtprio =
4614 task_rlimit(p, RLIMIT_RTPRIO);
4616 /* can't set/change the rt policy */
4617 if (policy != p->policy && !rlim_rtprio)
4620 /* can't increase priority */
4621 if (param->sched_priority > p->rt_priority &&
4622 param->sched_priority > rlim_rtprio)
4626 * Like positive nice levels, dont allow tasks to
4627 * move out of SCHED_IDLE either:
4629 if (p->policy == SCHED_IDLE && policy != SCHED_IDLE)
4632 /* can't change other user's priorities */
4633 if (!check_same_owner(p))
4636 /* Normal users shall not reset the sched_reset_on_fork flag */
4637 if (p->sched_reset_on_fork && !reset_on_fork)
4642 retval = security_task_setscheduler(p, policy, param);
4648 * make sure no PI-waiters arrive (or leave) while we are
4649 * changing the priority of the task:
4651 raw_spin_lock_irqsave(&p->pi_lock, flags);
4653 * To be able to change p->policy safely, the apropriate
4654 * runqueue lock must be held.
4656 rq = __task_rq_lock(p);
4658 #ifdef CONFIG_RT_GROUP_SCHED
4661 * Do not allow realtime tasks into groups that have no runtime
4664 if (rt_bandwidth_enabled() && rt_policy(policy) &&
4665 task_group(p)->rt_bandwidth.rt_runtime == 0) {
4666 __task_rq_unlock(rq);
4667 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
4673 /* recheck policy now with rq lock held */
4674 if (unlikely(oldpolicy != -1 && oldpolicy != p->policy)) {
4675 policy = oldpolicy = -1;
4676 __task_rq_unlock(rq);
4677 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
4680 on_rq = p->se.on_rq;
4681 running = task_current(rq, p);
4683 deactivate_task(rq, p, 0);
4685 p->sched_class->put_prev_task(rq, p);
4687 p->sched_reset_on_fork = reset_on_fork;
4690 prev_class = p->sched_class;
4691 __setscheduler(rq, p, policy, param->sched_priority);
4694 p->sched_class->set_curr_task(rq);
4696 activate_task(rq, p, 0);
4698 check_class_changed(rq, p, prev_class, oldprio, running);
4700 __task_rq_unlock(rq);
4701 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
4703 rt_mutex_adjust_pi(p);
4709 * sched_setscheduler - change the scheduling policy and/or RT priority of a thread.
4710 * @p: the task in question.
4711 * @policy: new policy.
4712 * @param: structure containing the new RT priority.
4714 * NOTE that the task may be already dead.
4716 int sched_setscheduler(struct task_struct *p, int policy,
4717 struct sched_param *param)
4719 return __sched_setscheduler(p, policy, param, true);
4721 EXPORT_SYMBOL_GPL(sched_setscheduler);
4724 * sched_setscheduler_nocheck - change the scheduling policy and/or RT priority of a thread from kernelspace.
4725 * @p: the task in question.
4726 * @policy: new policy.
4727 * @param: structure containing the new RT priority.
4729 * Just like sched_setscheduler, only don't bother checking if the
4730 * current context has permission. For example, this is needed in
4731 * stop_machine(): we create temporary high priority worker threads,
4732 * but our caller might not have that capability.
4734 int sched_setscheduler_nocheck(struct task_struct *p, int policy,
4735 struct sched_param *param)
4737 return __sched_setscheduler(p, policy, param, false);
4741 do_sched_setscheduler(pid_t pid, int policy, struct sched_param __user *param)
4743 struct sched_param lparam;
4744 struct task_struct *p;
4747 if (!param || pid < 0)
4749 if (copy_from_user(&lparam, param, sizeof(struct sched_param)))
4754 p = find_process_by_pid(pid);
4756 retval = sched_setscheduler(p, policy, &lparam);
4763 * sys_sched_setscheduler - set/change the scheduler policy and RT priority
4764 * @pid: the pid in question.
4765 * @policy: new policy.
4766 * @param: structure containing the new RT priority.
4768 SYSCALL_DEFINE3(sched_setscheduler, pid_t, pid, int, policy,
4769 struct sched_param __user *, param)
4771 /* negative values for policy are not valid */
4775 return do_sched_setscheduler(pid, policy, param);
4779 * sys_sched_setparam - set/change the RT priority of a thread
4780 * @pid: the pid in question.
4781 * @param: structure containing the new RT priority.
4783 SYSCALL_DEFINE2(sched_setparam, pid_t, pid, struct sched_param __user *, param)
4785 return do_sched_setscheduler(pid, -1, param);
4789 * sys_sched_getscheduler - get the policy (scheduling class) of a thread
4790 * @pid: the pid in question.
4792 SYSCALL_DEFINE1(sched_getscheduler, pid_t, pid)
4794 struct task_struct *p;
4802 p = find_process_by_pid(pid);
4804 retval = security_task_getscheduler(p);
4807 | (p->sched_reset_on_fork ? SCHED_RESET_ON_FORK : 0);
4814 * sys_sched_getparam - get the RT priority of a thread
4815 * @pid: the pid in question.
4816 * @param: structure containing the RT priority.
4818 SYSCALL_DEFINE2(sched_getparam, pid_t, pid, struct sched_param __user *, param)
4820 struct sched_param lp;
4821 struct task_struct *p;
4824 if (!param || pid < 0)
4828 p = find_process_by_pid(pid);
4833 retval = security_task_getscheduler(p);
4837 lp.sched_priority = p->rt_priority;
4841 * This one might sleep, we cannot do it with a spinlock held ...
4843 retval = copy_to_user(param, &lp, sizeof(*param)) ? -EFAULT : 0;
4852 long sched_setaffinity(pid_t pid, const struct cpumask *in_mask)
4854 cpumask_var_t cpus_allowed, new_mask;
4855 struct task_struct *p;
4861 p = find_process_by_pid(pid);
4868 /* Prevent p going away */
4872 if (!alloc_cpumask_var(&cpus_allowed, GFP_KERNEL)) {
4876 if (!alloc_cpumask_var(&new_mask, GFP_KERNEL)) {
4878 goto out_free_cpus_allowed;
4881 if (!check_same_owner(p) && !capable(CAP_SYS_NICE))
4884 retval = security_task_setscheduler(p, 0, NULL);
4888 cpuset_cpus_allowed(p, cpus_allowed);
4889 cpumask_and(new_mask, in_mask, cpus_allowed);
4891 retval = set_cpus_allowed_ptr(p, new_mask);
4894 cpuset_cpus_allowed(p, cpus_allowed);
4895 if (!cpumask_subset(new_mask, cpus_allowed)) {
4897 * We must have raced with a concurrent cpuset
4898 * update. Just reset the cpus_allowed to the
4899 * cpuset's cpus_allowed
4901 cpumask_copy(new_mask, cpus_allowed);
4906 free_cpumask_var(new_mask);
4907 out_free_cpus_allowed:
4908 free_cpumask_var(cpus_allowed);
4915 static int get_user_cpu_mask(unsigned long __user *user_mask_ptr, unsigned len,
4916 struct cpumask *new_mask)
4918 if (len < cpumask_size())
4919 cpumask_clear(new_mask);
4920 else if (len > cpumask_size())
4921 len = cpumask_size();
4923 return copy_from_user(new_mask, user_mask_ptr, len) ? -EFAULT : 0;
4927 * sys_sched_setaffinity - set the cpu affinity of a process
4928 * @pid: pid of the process
4929 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
4930 * @user_mask_ptr: user-space pointer to the new cpu mask
4932 SYSCALL_DEFINE3(sched_setaffinity, pid_t, pid, unsigned int, len,
4933 unsigned long __user *, user_mask_ptr)
4935 cpumask_var_t new_mask;
4938 if (!alloc_cpumask_var(&new_mask, GFP_KERNEL))
4941 retval = get_user_cpu_mask(user_mask_ptr, len, new_mask);
4943 retval = sched_setaffinity(pid, new_mask);
4944 free_cpumask_var(new_mask);
4948 long sched_getaffinity(pid_t pid, struct cpumask *mask)
4950 struct task_struct *p;
4951 unsigned long flags;
4959 p = find_process_by_pid(pid);
4963 retval = security_task_getscheduler(p);
4967 rq = task_rq_lock(p, &flags);
4968 cpumask_and(mask, &p->cpus_allowed, cpu_online_mask);
4969 task_rq_unlock(rq, &flags);
4979 * sys_sched_getaffinity - get the cpu affinity of a process
4980 * @pid: pid of the process
4981 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
4982 * @user_mask_ptr: user-space pointer to hold the current cpu mask
4984 SYSCALL_DEFINE3(sched_getaffinity, pid_t, pid, unsigned int, len,
4985 unsigned long __user *, user_mask_ptr)
4990 if ((len * BITS_PER_BYTE) < nr_cpu_ids)
4992 if (len & (sizeof(unsigned long)-1))
4995 if (!alloc_cpumask_var(&mask, GFP_KERNEL))
4998 ret = sched_getaffinity(pid, mask);
5000 size_t retlen = min_t(size_t, len, cpumask_size());
5002 if (copy_to_user(user_mask_ptr, mask, retlen))
5007 free_cpumask_var(mask);
5013 * sys_sched_yield - yield the current processor to other threads.
5015 * This function yields the current CPU to other tasks. If there are no
5016 * other threads running on this CPU then this function will return.
5018 SYSCALL_DEFINE0(sched_yield)
5020 struct rq *rq = this_rq_lock();
5022 schedstat_inc(rq, yld_count);
5023 current->sched_class->yield_task(rq);
5026 * Since we are going to call schedule() anyway, there's
5027 * no need to preempt or enable interrupts:
5029 __release(rq->lock);
5030 spin_release(&rq->lock.dep_map, 1, _THIS_IP_);
5031 do_raw_spin_unlock(&rq->lock);
5032 preempt_enable_no_resched();
5039 static inline int should_resched(void)
5041 return need_resched() && !(preempt_count() & PREEMPT_ACTIVE);
5044 static void __cond_resched(void)
5046 add_preempt_count(PREEMPT_ACTIVE);
5048 sub_preempt_count(PREEMPT_ACTIVE);
5051 int __sched _cond_resched(void)
5053 if (should_resched()) {
5059 EXPORT_SYMBOL(_cond_resched);
5062 * __cond_resched_lock() - if a reschedule is pending, drop the given lock,
5063 * call schedule, and on return reacquire the lock.
5065 * This works OK both with and without CONFIG_PREEMPT. We do strange low-level
5066 * operations here to prevent schedule() from being called twice (once via
5067 * spin_unlock(), once by hand).
5069 int __cond_resched_lock(spinlock_t *lock)
5071 int resched = should_resched();
5074 lockdep_assert_held(lock);
5076 if (spin_needbreak(lock) || resched) {
5087 EXPORT_SYMBOL(__cond_resched_lock);
5089 int __sched __cond_resched_softirq(void)
5091 BUG_ON(!in_softirq());
5093 if (should_resched()) {
5101 EXPORT_SYMBOL(__cond_resched_softirq);
5104 * yield - yield the current processor to other threads.
5106 * This is a shortcut for kernel-space yielding - it marks the
5107 * thread runnable and calls sys_sched_yield().
5109 void __sched yield(void)
5111 set_current_state(TASK_RUNNING);
5114 EXPORT_SYMBOL(yield);
5117 * This task is about to go to sleep on IO. Increment rq->nr_iowait so
5118 * that process accounting knows that this is a task in IO wait state.
5120 void __sched io_schedule(void)
5122 struct rq *rq = raw_rq();
5124 delayacct_blkio_start();
5125 atomic_inc(&rq->nr_iowait);
5126 current->in_iowait = 1;
5128 current->in_iowait = 0;
5129 atomic_dec(&rq->nr_iowait);
5130 delayacct_blkio_end();
5132 EXPORT_SYMBOL(io_schedule);
5134 long __sched io_schedule_timeout(long timeout)
5136 struct rq *rq = raw_rq();
5139 delayacct_blkio_start();
5140 atomic_inc(&rq->nr_iowait);
5141 current->in_iowait = 1;
5142 ret = schedule_timeout(timeout);
5143 current->in_iowait = 0;
5144 atomic_dec(&rq->nr_iowait);
5145 delayacct_blkio_end();
5150 * sys_sched_get_priority_max - return maximum RT priority.
5151 * @policy: scheduling class.
5153 * this syscall returns the maximum rt_priority that can be used
5154 * by a given scheduling class.
5156 SYSCALL_DEFINE1(sched_get_priority_max, int, policy)
5163 ret = MAX_USER_RT_PRIO-1;
5175 * sys_sched_get_priority_min - return minimum RT priority.
5176 * @policy: scheduling class.
5178 * this syscall returns the minimum rt_priority that can be used
5179 * by a given scheduling class.
5181 SYSCALL_DEFINE1(sched_get_priority_min, int, policy)
5199 * sys_sched_rr_get_interval - return the default timeslice of a process.
5200 * @pid: pid of the process.
5201 * @interval: userspace pointer to the timeslice value.
5203 * this syscall writes the default timeslice value of a given process
5204 * into the user-space timespec buffer. A value of '0' means infinity.
5206 SYSCALL_DEFINE2(sched_rr_get_interval, pid_t, pid,
5207 struct timespec __user *, interval)
5209 struct task_struct *p;
5210 unsigned int time_slice;
5211 unsigned long flags;
5221 p = find_process_by_pid(pid);
5225 retval = security_task_getscheduler(p);
5229 rq = task_rq_lock(p, &flags);
5230 time_slice = p->sched_class->get_rr_interval(rq, p);
5231 task_rq_unlock(rq, &flags);
5234 jiffies_to_timespec(time_slice, &t);
5235 retval = copy_to_user(interval, &t, sizeof(t)) ? -EFAULT : 0;
5243 static const char stat_nam[] = TASK_STATE_TO_CHAR_STR;
5245 void sched_show_task(struct task_struct *p)
5247 unsigned long free = 0;
5250 state = p->state ? __ffs(p->state) + 1 : 0;
5251 printk(KERN_INFO "%-15.15s %c", p->comm,
5252 state < sizeof(stat_nam) - 1 ? stat_nam[state] : '?');
5253 #if BITS_PER_LONG == 32
5254 if (state == TASK_RUNNING)
5255 printk(KERN_CONT " running ");
5257 printk(KERN_CONT " %08lx ", thread_saved_pc(p));
5259 if (state == TASK_RUNNING)
5260 printk(KERN_CONT " running task ");
5262 printk(KERN_CONT " %016lx ", thread_saved_pc(p));
5264 #ifdef CONFIG_DEBUG_STACK_USAGE
5265 free = stack_not_used(p);
5267 printk(KERN_CONT "%5lu %5d %6d 0x%08lx\n", free,
5268 task_pid_nr(p), task_pid_nr(p->real_parent),
5269 (unsigned long)task_thread_info(p)->flags);
5271 show_stack(p, NULL);
5274 void show_state_filter(unsigned long state_filter)
5276 struct task_struct *g, *p;
5278 #if BITS_PER_LONG == 32
5280 " task PC stack pid father\n");
5283 " task PC stack pid father\n");
5285 read_lock(&tasklist_lock);
5286 do_each_thread(g, p) {
5288 * reset the NMI-timeout, listing all files on a slow
5289 * console might take alot of time:
5291 touch_nmi_watchdog();
5292 if (!state_filter || (p->state & state_filter))
5294 } while_each_thread(g, p);
5296 touch_all_softlockup_watchdogs();
5298 #ifdef CONFIG_SCHED_DEBUG
5299 sysrq_sched_debug_show();
5301 read_unlock(&tasklist_lock);
5303 * Only show locks if all tasks are dumped:
5306 debug_show_all_locks();
5309 void __cpuinit init_idle_bootup_task(struct task_struct *idle)
5311 idle->sched_class = &idle_sched_class;
5315 * init_idle - set up an idle thread for a given CPU
5316 * @idle: task in question
5317 * @cpu: cpu the idle task belongs to
5319 * NOTE: this function does not set the idle thread's NEED_RESCHED
5320 * flag, to make booting more robust.
5322 void __cpuinit init_idle(struct task_struct *idle, int cpu)
5324 struct rq *rq = cpu_rq(cpu);
5325 unsigned long flags;
5327 raw_spin_lock_irqsave(&rq->lock, flags);
5330 idle->state = TASK_RUNNING;
5331 idle->se.exec_start = sched_clock();
5333 cpumask_copy(&idle->cpus_allowed, cpumask_of(cpu));
5335 * We're having a chicken and egg problem, even though we are
5336 * holding rq->lock, the cpu isn't yet set to this cpu so the
5337 * lockdep check in task_group() will fail.
5339 * Similar case to sched_fork(). / Alternatively we could
5340 * use task_rq_lock() here and obtain the other rq->lock.
5345 __set_task_cpu(idle, cpu);
5348 rq->curr = rq->idle = idle;
5349 #if defined(CONFIG_SMP) && defined(__ARCH_WANT_UNLOCKED_CTXSW)
5352 raw_spin_unlock_irqrestore(&rq->lock, flags);
5354 /* Set the preempt count _outside_ the spinlocks! */
5355 #if defined(CONFIG_PREEMPT)
5356 task_thread_info(idle)->preempt_count = (idle->lock_depth >= 0);
5358 task_thread_info(idle)->preempt_count = 0;
5361 * The idle tasks have their own, simple scheduling class:
5363 idle->sched_class = &idle_sched_class;
5364 ftrace_graph_init_task(idle);
5368 * In a system that switches off the HZ timer nohz_cpu_mask
5369 * indicates which cpus entered this state. This is used
5370 * in the rcu update to wait only for active cpus. For system
5371 * which do not switch off the HZ timer nohz_cpu_mask should
5372 * always be CPU_BITS_NONE.
5374 cpumask_var_t nohz_cpu_mask;
5377 * Increase the granularity value when there are more CPUs,
5378 * because with more CPUs the 'effective latency' as visible
5379 * to users decreases. But the relationship is not linear,
5380 * so pick a second-best guess by going with the log2 of the
5383 * This idea comes from the SD scheduler of Con Kolivas:
5385 static int get_update_sysctl_factor(void)
5387 unsigned int cpus = min_t(int, num_online_cpus(), 8);
5388 unsigned int factor;
5390 switch (sysctl_sched_tunable_scaling) {
5391 case SCHED_TUNABLESCALING_NONE:
5394 case SCHED_TUNABLESCALING_LINEAR:
5397 case SCHED_TUNABLESCALING_LOG:
5399 factor = 1 + ilog2(cpus);
5406 static void update_sysctl(void)
5408 unsigned int factor = get_update_sysctl_factor();
5410 #define SET_SYSCTL(name) \
5411 (sysctl_##name = (factor) * normalized_sysctl_##name)
5412 SET_SYSCTL(sched_min_granularity);
5413 SET_SYSCTL(sched_latency);
5414 SET_SYSCTL(sched_wakeup_granularity);
5415 SET_SYSCTL(sched_shares_ratelimit);
5419 static inline void sched_init_granularity(void)
5426 * This is how migration works:
5428 * 1) we invoke migration_cpu_stop() on the target CPU using
5430 * 2) stopper starts to run (implicitly forcing the migrated thread
5432 * 3) it checks whether the migrated task is still in the wrong runqueue.
5433 * 4) if it's in the wrong runqueue then the migration thread removes
5434 * it and puts it into the right queue.
5435 * 5) stopper completes and stop_one_cpu() returns and the migration
5440 * Change a given task's CPU affinity. Migrate the thread to a
5441 * proper CPU and schedule it away if the CPU it's executing on
5442 * is removed from the allowed bitmask.
5444 * NOTE: the caller must have a valid reference to the task, the
5445 * task must not exit() & deallocate itself prematurely. The
5446 * call is not atomic; no spinlocks may be held.
5448 int set_cpus_allowed_ptr(struct task_struct *p, const struct cpumask *new_mask)
5450 unsigned long flags;
5452 unsigned int dest_cpu;
5456 * Serialize against TASK_WAKING so that ttwu() and wunt() can
5457 * drop the rq->lock and still rely on ->cpus_allowed.
5460 while (task_is_waking(p))
5462 rq = task_rq_lock(p, &flags);
5463 if (task_is_waking(p)) {
5464 task_rq_unlock(rq, &flags);
5468 if (!cpumask_intersects(new_mask, cpu_active_mask)) {
5473 if (unlikely((p->flags & PF_THREAD_BOUND) && p != current &&
5474 !cpumask_equal(&p->cpus_allowed, new_mask))) {
5479 if (p->sched_class->set_cpus_allowed)
5480 p->sched_class->set_cpus_allowed(p, new_mask);
5482 cpumask_copy(&p->cpus_allowed, new_mask);
5483 p->rt.nr_cpus_allowed = cpumask_weight(new_mask);
5486 /* Can the task run on the task's current CPU? If so, we're done */
5487 if (cpumask_test_cpu(task_cpu(p), new_mask))
5490 dest_cpu = cpumask_any_and(cpu_active_mask, new_mask);
5491 if (migrate_task(p, dest_cpu)) {
5492 struct migration_arg arg = { p, dest_cpu };
5493 /* Need help from migration thread: drop lock and wait. */
5494 task_rq_unlock(rq, &flags);
5495 stop_one_cpu(cpu_of(rq), migration_cpu_stop, &arg);
5496 tlb_migrate_finish(p->mm);
5500 task_rq_unlock(rq, &flags);
5504 EXPORT_SYMBOL_GPL(set_cpus_allowed_ptr);
5507 * Move (not current) task off this cpu, onto dest cpu. We're doing
5508 * this because either it can't run here any more (set_cpus_allowed()
5509 * away from this CPU, or CPU going down), or because we're
5510 * attempting to rebalance this task on exec (sched_exec).
5512 * So we race with normal scheduler movements, but that's OK, as long
5513 * as the task is no longer on this CPU.
5515 * Returns non-zero if task was successfully migrated.
5517 static int __migrate_task(struct task_struct *p, int src_cpu, int dest_cpu)
5519 struct rq *rq_dest, *rq_src;
5522 if (unlikely(!cpu_active(dest_cpu)))
5525 rq_src = cpu_rq(src_cpu);
5526 rq_dest = cpu_rq(dest_cpu);
5528 double_rq_lock(rq_src, rq_dest);
5529 /* Already moved. */
5530 if (task_cpu(p) != src_cpu)
5532 /* Affinity changed (again). */
5533 if (!cpumask_test_cpu(dest_cpu, &p->cpus_allowed))
5537 * If we're not on a rq, the next wake-up will ensure we're
5541 deactivate_task(rq_src, p, 0);
5542 set_task_cpu(p, dest_cpu);
5543 activate_task(rq_dest, p, 0);
5544 check_preempt_curr(rq_dest, p, 0);
5549 double_rq_unlock(rq_src, rq_dest);
5554 * migration_cpu_stop - this will be executed by a highprio stopper thread
5555 * and performs thread migration by bumping thread off CPU then
5556 * 'pushing' onto another runqueue.
5558 static int migration_cpu_stop(void *data)
5560 struct migration_arg *arg = data;
5563 * The original target cpu might have gone down and we might
5564 * be on another cpu but it doesn't matter.
5566 local_irq_disable();
5567 __migrate_task(arg->task, raw_smp_processor_id(), arg->dest_cpu);
5572 #ifdef CONFIG_HOTPLUG_CPU
5574 * Figure out where task on dead CPU should go, use force if necessary.
5576 void move_task_off_dead_cpu(int dead_cpu, struct task_struct *p)
5578 struct rq *rq = cpu_rq(dead_cpu);
5579 int needs_cpu, uninitialized_var(dest_cpu);
5580 unsigned long flags;
5582 local_irq_save(flags);
5584 raw_spin_lock(&rq->lock);
5585 needs_cpu = (task_cpu(p) == dead_cpu) && (p->state != TASK_WAKING);
5587 dest_cpu = select_fallback_rq(dead_cpu, p);
5588 raw_spin_unlock(&rq->lock);
5590 * It can only fail if we race with set_cpus_allowed(),
5591 * in the racer should migrate the task anyway.
5594 __migrate_task(p, dead_cpu, dest_cpu);
5595 local_irq_restore(flags);
5599 * While a dead CPU has no uninterruptible tasks queued at this point,
5600 * it might still have a nonzero ->nr_uninterruptible counter, because
5601 * for performance reasons the counter is not stricly tracking tasks to
5602 * their home CPUs. So we just add the counter to another CPU's counter,
5603 * to keep the global sum constant after CPU-down:
5605 static void migrate_nr_uninterruptible(struct rq *rq_src)
5607 struct rq *rq_dest = cpu_rq(cpumask_any(cpu_active_mask));
5608 unsigned long flags;
5610 local_irq_save(flags);
5611 double_rq_lock(rq_src, rq_dest);
5612 rq_dest->nr_uninterruptible += rq_src->nr_uninterruptible;
5613 rq_src->nr_uninterruptible = 0;
5614 double_rq_unlock(rq_src, rq_dest);
5615 local_irq_restore(flags);
5618 /* Run through task list and migrate tasks from the dead cpu. */
5619 static void migrate_live_tasks(int src_cpu)
5621 struct task_struct *p, *t;
5623 read_lock(&tasklist_lock);
5625 do_each_thread(t, p) {
5629 if (task_cpu(p) == src_cpu)
5630 move_task_off_dead_cpu(src_cpu, p);
5631 } while_each_thread(t, p);
5633 read_unlock(&tasklist_lock);
5637 * Schedules idle task to be the next runnable task on current CPU.
5638 * It does so by boosting its priority to highest possible.
5639 * Used by CPU offline code.
5641 void sched_idle_next(void)
5643 int this_cpu = smp_processor_id();
5644 struct rq *rq = cpu_rq(this_cpu);
5645 struct task_struct *p = rq->idle;
5646 unsigned long flags;
5648 /* cpu has to be offline */
5649 BUG_ON(cpu_online(this_cpu));
5652 * Strictly not necessary since rest of the CPUs are stopped by now
5653 * and interrupts disabled on the current cpu.
5655 raw_spin_lock_irqsave(&rq->lock, flags);
5657 __setscheduler(rq, p, SCHED_FIFO, MAX_RT_PRIO-1);
5659 activate_task(rq, p, 0);
5661 raw_spin_unlock_irqrestore(&rq->lock, flags);
5665 * Ensures that the idle task is using init_mm right before its cpu goes
5668 void idle_task_exit(void)
5670 struct mm_struct *mm = current->active_mm;
5672 BUG_ON(cpu_online(smp_processor_id()));
5675 switch_mm(mm, &init_mm, current);
5679 /* called under rq->lock with disabled interrupts */
5680 static void migrate_dead(unsigned int dead_cpu, struct task_struct *p)
5682 struct rq *rq = cpu_rq(dead_cpu);
5684 /* Must be exiting, otherwise would be on tasklist. */
5685 BUG_ON(!p->exit_state);
5687 /* Cannot have done final schedule yet: would have vanished. */
5688 BUG_ON(p->state == TASK_DEAD);
5693 * Drop lock around migration; if someone else moves it,
5694 * that's OK. No task can be added to this CPU, so iteration is
5697 raw_spin_unlock_irq(&rq->lock);
5698 move_task_off_dead_cpu(dead_cpu, p);
5699 raw_spin_lock_irq(&rq->lock);
5704 /* release_task() removes task from tasklist, so we won't find dead tasks. */
5705 static void migrate_dead_tasks(unsigned int dead_cpu)
5707 struct rq *rq = cpu_rq(dead_cpu);
5708 struct task_struct *next;
5711 if (!rq->nr_running)
5713 next = pick_next_task(rq);
5716 next->sched_class->put_prev_task(rq, next);
5717 migrate_dead(dead_cpu, next);
5723 * remove the tasks which were accounted by rq from calc_load_tasks.
5725 static void calc_global_load_remove(struct rq *rq)
5727 atomic_long_sub(rq->calc_load_active, &calc_load_tasks);
5728 rq->calc_load_active = 0;
5730 #endif /* CONFIG_HOTPLUG_CPU */
5732 #if defined(CONFIG_SCHED_DEBUG) && defined(CONFIG_SYSCTL)
5734 static struct ctl_table sd_ctl_dir[] = {
5736 .procname = "sched_domain",
5742 static struct ctl_table sd_ctl_root[] = {
5744 .procname = "kernel",
5746 .child = sd_ctl_dir,
5751 static struct ctl_table *sd_alloc_ctl_entry(int n)
5753 struct ctl_table *entry =
5754 kcalloc(n, sizeof(struct ctl_table), GFP_KERNEL);
5759 static void sd_free_ctl_entry(struct ctl_table **tablep)
5761 struct ctl_table *entry;
5764 * In the intermediate directories, both the child directory and
5765 * procname are dynamically allocated and could fail but the mode
5766 * will always be set. In the lowest directory the names are
5767 * static strings and all have proc handlers.
5769 for (entry = *tablep; entry->mode; entry++) {
5771 sd_free_ctl_entry(&entry->child);
5772 if (entry->proc_handler == NULL)
5773 kfree(entry->procname);
5781 set_table_entry(struct ctl_table *entry,
5782 const char *procname, void *data, int maxlen,
5783 mode_t mode, proc_handler *proc_handler)
5785 entry->procname = procname;
5787 entry->maxlen = maxlen;
5789 entry->proc_handler = proc_handler;
5792 static struct ctl_table *
5793 sd_alloc_ctl_domain_table(struct sched_domain *sd)
5795 struct ctl_table *table = sd_alloc_ctl_entry(13);
5800 set_table_entry(&table[0], "min_interval", &sd->min_interval,
5801 sizeof(long), 0644, proc_doulongvec_minmax);
5802 set_table_entry(&table[1], "max_interval", &sd->max_interval,
5803 sizeof(long), 0644, proc_doulongvec_minmax);
5804 set_table_entry(&table[2], "busy_idx", &sd->busy_idx,
5805 sizeof(int), 0644, proc_dointvec_minmax);
5806 set_table_entry(&table[3], "idle_idx", &sd->idle_idx,
5807 sizeof(int), 0644, proc_dointvec_minmax);
5808 set_table_entry(&table[4], "newidle_idx", &sd->newidle_idx,
5809 sizeof(int), 0644, proc_dointvec_minmax);
5810 set_table_entry(&table[5], "wake_idx", &sd->wake_idx,
5811 sizeof(int), 0644, proc_dointvec_minmax);
5812 set_table_entry(&table[6], "forkexec_idx", &sd->forkexec_idx,
5813 sizeof(int), 0644, proc_dointvec_minmax);
5814 set_table_entry(&table[7], "busy_factor", &sd->busy_factor,
5815 sizeof(int), 0644, proc_dointvec_minmax);
5816 set_table_entry(&table[8], "imbalance_pct", &sd->imbalance_pct,
5817 sizeof(int), 0644, proc_dointvec_minmax);
5818 set_table_entry(&table[9], "cache_nice_tries",
5819 &sd->cache_nice_tries,
5820 sizeof(int), 0644, proc_dointvec_minmax);
5821 set_table_entry(&table[10], "flags", &sd->flags,
5822 sizeof(int), 0644, proc_dointvec_minmax);
5823 set_table_entry(&table[11], "name", sd->name,
5824 CORENAME_MAX_SIZE, 0444, proc_dostring);
5825 /* &table[12] is terminator */
5830 static ctl_table *sd_alloc_ctl_cpu_table(int cpu)
5832 struct ctl_table *entry, *table;
5833 struct sched_domain *sd;
5834 int domain_num = 0, i;
5837 for_each_domain(cpu, sd)
5839 entry = table = sd_alloc_ctl_entry(domain_num + 1);
5844 for_each_domain(cpu, sd) {
5845 snprintf(buf, 32, "domain%d", i);
5846 entry->procname = kstrdup(buf, GFP_KERNEL);
5848 entry->child = sd_alloc_ctl_domain_table(sd);
5855 static struct ctl_table_header *sd_sysctl_header;
5856 static void register_sched_domain_sysctl(void)
5858 int i, cpu_num = num_possible_cpus();
5859 struct ctl_table *entry = sd_alloc_ctl_entry(cpu_num + 1);
5862 WARN_ON(sd_ctl_dir[0].child);
5863 sd_ctl_dir[0].child = entry;
5868 for_each_possible_cpu(i) {
5869 snprintf(buf, 32, "cpu%d", i);
5870 entry->procname = kstrdup(buf, GFP_KERNEL);
5872 entry->child = sd_alloc_ctl_cpu_table(i);
5876 WARN_ON(sd_sysctl_header);
5877 sd_sysctl_header = register_sysctl_table(sd_ctl_root);
5880 /* may be called multiple times per register */
5881 static void unregister_sched_domain_sysctl(void)
5883 if (sd_sysctl_header)
5884 unregister_sysctl_table(sd_sysctl_header);
5885 sd_sysctl_header = NULL;
5886 if (sd_ctl_dir[0].child)
5887 sd_free_ctl_entry(&sd_ctl_dir[0].child);
5890 static void register_sched_domain_sysctl(void)
5893 static void unregister_sched_domain_sysctl(void)
5898 static void set_rq_online(struct rq *rq)
5901 const struct sched_class *class;
5903 cpumask_set_cpu(rq->cpu, rq->rd->online);
5906 for_each_class(class) {
5907 if (class->rq_online)
5908 class->rq_online(rq);
5913 static void set_rq_offline(struct rq *rq)
5916 const struct sched_class *class;
5918 for_each_class(class) {
5919 if (class->rq_offline)
5920 class->rq_offline(rq);
5923 cpumask_clear_cpu(rq->cpu, rq->rd->online);
5929 * migration_call - callback that gets triggered when a CPU is added.
5930 * Here we can start up the necessary migration thread for the new CPU.
5932 static int __cpuinit
5933 migration_call(struct notifier_block *nfb, unsigned long action, void *hcpu)
5935 int cpu = (long)hcpu;
5936 unsigned long flags;
5937 struct rq *rq = cpu_rq(cpu);
5941 case CPU_UP_PREPARE:
5942 case CPU_UP_PREPARE_FROZEN:
5943 rq->calc_load_update = calc_load_update;
5947 case CPU_ONLINE_FROZEN:
5948 /* Update our root-domain */
5949 raw_spin_lock_irqsave(&rq->lock, flags);
5951 BUG_ON(!cpumask_test_cpu(cpu, rq->rd->span));
5955 raw_spin_unlock_irqrestore(&rq->lock, flags);
5958 #ifdef CONFIG_HOTPLUG_CPU
5960 case CPU_DEAD_FROZEN:
5961 migrate_live_tasks(cpu);
5962 /* Idle task back to normal (off runqueue, low prio) */
5963 raw_spin_lock_irq(&rq->lock);
5964 deactivate_task(rq, rq->idle, 0);
5965 __setscheduler(rq, rq->idle, SCHED_NORMAL, 0);
5966 rq->idle->sched_class = &idle_sched_class;
5967 migrate_dead_tasks(cpu);
5968 raw_spin_unlock_irq(&rq->lock);
5969 migrate_nr_uninterruptible(rq);
5970 BUG_ON(rq->nr_running != 0);
5971 calc_global_load_remove(rq);
5975 case CPU_DYING_FROZEN:
5976 /* Update our root-domain */
5977 raw_spin_lock_irqsave(&rq->lock, flags);
5979 BUG_ON(!cpumask_test_cpu(cpu, rq->rd->span));
5982 raw_spin_unlock_irqrestore(&rq->lock, flags);
5990 * Register at high priority so that task migration (migrate_all_tasks)
5991 * happens before everything else. This has to be lower priority than
5992 * the notifier in the perf_event subsystem, though.
5994 static struct notifier_block __cpuinitdata migration_notifier = {
5995 .notifier_call = migration_call,
5996 .priority = CPU_PRI_MIGRATION,
5999 static int __cpuinit sched_cpu_active(struct notifier_block *nfb,
6000 unsigned long action, void *hcpu)
6002 switch (action & ~CPU_TASKS_FROZEN) {
6004 case CPU_DOWN_FAILED:
6005 set_cpu_active((long)hcpu, true);
6012 static int __cpuinit sched_cpu_inactive(struct notifier_block *nfb,
6013 unsigned long action, void *hcpu)
6015 switch (action & ~CPU_TASKS_FROZEN) {
6016 case CPU_DOWN_PREPARE:
6017 set_cpu_active((long)hcpu, false);
6024 static int __init migration_init(void)
6026 void *cpu = (void *)(long)smp_processor_id();
6029 /* Initialize migration for the boot CPU */
6030 err = migration_call(&migration_notifier, CPU_UP_PREPARE, cpu);
6031 BUG_ON(err == NOTIFY_BAD);
6032 migration_call(&migration_notifier, CPU_ONLINE, cpu);
6033 register_cpu_notifier(&migration_notifier);
6035 /* Register cpu active notifiers */
6036 cpu_notifier(sched_cpu_active, CPU_PRI_SCHED_ACTIVE);
6037 cpu_notifier(sched_cpu_inactive, CPU_PRI_SCHED_INACTIVE);
6041 early_initcall(migration_init);
6046 #ifdef CONFIG_SCHED_DEBUG
6048 static __read_mostly int sched_domain_debug_enabled;
6050 static int __init sched_domain_debug_setup(char *str)
6052 sched_domain_debug_enabled = 1;
6056 early_param("sched_debug", sched_domain_debug_setup);
6058 static int sched_domain_debug_one(struct sched_domain *sd, int cpu, int level,
6059 struct cpumask *groupmask)
6061 struct sched_group *group = sd->groups;
6064 cpulist_scnprintf(str, sizeof(str), sched_domain_span(sd));
6065 cpumask_clear(groupmask);
6067 printk(KERN_DEBUG "%*s domain %d: ", level, "", level);
6069 if (!(sd->flags & SD_LOAD_BALANCE)) {
6070 printk("does not load-balance\n");
6072 printk(KERN_ERR "ERROR: !SD_LOAD_BALANCE domain"
6077 printk(KERN_CONT "span %s level %s\n", str, sd->name);
6079 if (!cpumask_test_cpu(cpu, sched_domain_span(sd))) {
6080 printk(KERN_ERR "ERROR: domain->span does not contain "
6083 if (!cpumask_test_cpu(cpu, sched_group_cpus(group))) {
6084 printk(KERN_ERR "ERROR: domain->groups does not contain"
6088 printk(KERN_DEBUG "%*s groups:", level + 1, "");
6092 printk(KERN_ERR "ERROR: group is NULL\n");
6096 if (!group->cpu_power) {
6097 printk(KERN_CONT "\n");
6098 printk(KERN_ERR "ERROR: domain->cpu_power not "
6103 if (!cpumask_weight(sched_group_cpus(group))) {
6104 printk(KERN_CONT "\n");
6105 printk(KERN_ERR "ERROR: empty group\n");
6109 if (cpumask_intersects(groupmask, sched_group_cpus(group))) {
6110 printk(KERN_CONT "\n");
6111 printk(KERN_ERR "ERROR: repeated CPUs\n");
6115 cpumask_or(groupmask, groupmask, sched_group_cpus(group));
6117 cpulist_scnprintf(str, sizeof(str), sched_group_cpus(group));
6119 printk(KERN_CONT " %s", str);
6120 if (group->cpu_power != SCHED_LOAD_SCALE) {
6121 printk(KERN_CONT " (cpu_power = %d)",
6125 group = group->next;
6126 } while (group != sd->groups);
6127 printk(KERN_CONT "\n");
6129 if (!cpumask_equal(sched_domain_span(sd), groupmask))
6130 printk(KERN_ERR "ERROR: groups don't span domain->span\n");
6133 !cpumask_subset(groupmask, sched_domain_span(sd->parent)))
6134 printk(KERN_ERR "ERROR: parent span is not a superset "
6135 "of domain->span\n");
6139 static void sched_domain_debug(struct sched_domain *sd, int cpu)
6141 cpumask_var_t groupmask;
6144 if (!sched_domain_debug_enabled)
6148 printk(KERN_DEBUG "CPU%d attaching NULL sched-domain.\n", cpu);
6152 printk(KERN_DEBUG "CPU%d attaching sched-domain:\n", cpu);
6154 if (!alloc_cpumask_var(&groupmask, GFP_KERNEL)) {
6155 printk(KERN_DEBUG "Cannot load-balance (out of memory)\n");
6160 if (sched_domain_debug_one(sd, cpu, level, groupmask))
6167 free_cpumask_var(groupmask);
6169 #else /* !CONFIG_SCHED_DEBUG */
6170 # define sched_domain_debug(sd, cpu) do { } while (0)
6171 #endif /* CONFIG_SCHED_DEBUG */
6173 static int sd_degenerate(struct sched_domain *sd)
6175 if (cpumask_weight(sched_domain_span(sd)) == 1)
6178 /* Following flags need at least 2 groups */
6179 if (sd->flags & (SD_LOAD_BALANCE |
6180 SD_BALANCE_NEWIDLE |
6184 SD_SHARE_PKG_RESOURCES)) {
6185 if (sd->groups != sd->groups->next)
6189 /* Following flags don't use groups */
6190 if (sd->flags & (SD_WAKE_AFFINE))
6197 sd_parent_degenerate(struct sched_domain *sd, struct sched_domain *parent)
6199 unsigned long cflags = sd->flags, pflags = parent->flags;
6201 if (sd_degenerate(parent))
6204 if (!cpumask_equal(sched_domain_span(sd), sched_domain_span(parent)))
6207 /* Flags needing groups don't count if only 1 group in parent */
6208 if (parent->groups == parent->groups->next) {
6209 pflags &= ~(SD_LOAD_BALANCE |
6210 SD_BALANCE_NEWIDLE |
6214 SD_SHARE_PKG_RESOURCES);
6215 if (nr_node_ids == 1)
6216 pflags &= ~SD_SERIALIZE;
6218 if (~cflags & pflags)
6224 static void free_rootdomain(struct root_domain *rd)
6226 synchronize_sched();
6228 cpupri_cleanup(&rd->cpupri);
6230 free_cpumask_var(rd->rto_mask);
6231 free_cpumask_var(rd->online);
6232 free_cpumask_var(rd->span);
6236 static void rq_attach_root(struct rq *rq, struct root_domain *rd)
6238 struct root_domain *old_rd = NULL;
6239 unsigned long flags;
6241 raw_spin_lock_irqsave(&rq->lock, flags);
6246 if (cpumask_test_cpu(rq->cpu, old_rd->online))
6249 cpumask_clear_cpu(rq->cpu, old_rd->span);
6252 * If we dont want to free the old_rt yet then
6253 * set old_rd to NULL to skip the freeing later
6256 if (!atomic_dec_and_test(&old_rd->refcount))
6260 atomic_inc(&rd->refcount);
6263 cpumask_set_cpu(rq->cpu, rd->span);
6264 if (cpumask_test_cpu(rq->cpu, cpu_active_mask))
6267 raw_spin_unlock_irqrestore(&rq->lock, flags);
6270 free_rootdomain(old_rd);
6273 static int init_rootdomain(struct root_domain *rd)
6275 memset(rd, 0, sizeof(*rd));
6277 if (!alloc_cpumask_var(&rd->span, GFP_KERNEL))
6279 if (!alloc_cpumask_var(&rd->online, GFP_KERNEL))
6281 if (!alloc_cpumask_var(&rd->rto_mask, GFP_KERNEL))
6284 if (cpupri_init(&rd->cpupri) != 0)
6289 free_cpumask_var(rd->rto_mask);
6291 free_cpumask_var(rd->online);
6293 free_cpumask_var(rd->span);
6298 static void init_defrootdomain(void)
6300 init_rootdomain(&def_root_domain);
6302 atomic_set(&def_root_domain.refcount, 1);
6305 static struct root_domain *alloc_rootdomain(void)
6307 struct root_domain *rd;
6309 rd = kmalloc(sizeof(*rd), GFP_KERNEL);
6313 if (init_rootdomain(rd) != 0) {
6322 * Attach the domain 'sd' to 'cpu' as its base domain. Callers must
6323 * hold the hotplug lock.
6326 cpu_attach_domain(struct sched_domain *sd, struct root_domain *rd, int cpu)
6328 struct rq *rq = cpu_rq(cpu);
6329 struct sched_domain *tmp;
6331 for (tmp = sd; tmp; tmp = tmp->parent)
6332 tmp->span_weight = cpumask_weight(sched_domain_span(tmp));
6334 /* Remove the sched domains which do not contribute to scheduling. */
6335 for (tmp = sd; tmp; ) {
6336 struct sched_domain *parent = tmp->parent;
6340 if (sd_parent_degenerate(tmp, parent)) {
6341 tmp->parent = parent->parent;
6343 parent->parent->child = tmp;
6348 if (sd && sd_degenerate(sd)) {
6354 sched_domain_debug(sd, cpu);
6356 rq_attach_root(rq, rd);
6357 rcu_assign_pointer(rq->sd, sd);
6360 /* cpus with isolated domains */
6361 static cpumask_var_t cpu_isolated_map;
6363 /* Setup the mask of cpus configured for isolated domains */
6364 static int __init isolated_cpu_setup(char *str)
6366 alloc_bootmem_cpumask_var(&cpu_isolated_map);
6367 cpulist_parse(str, cpu_isolated_map);
6371 __setup("isolcpus=", isolated_cpu_setup);
6374 * init_sched_build_groups takes the cpumask we wish to span, and a pointer
6375 * to a function which identifies what group(along with sched group) a CPU
6376 * belongs to. The return value of group_fn must be a >= 0 and < nr_cpu_ids
6377 * (due to the fact that we keep track of groups covered with a struct cpumask).
6379 * init_sched_build_groups will build a circular linked list of the groups
6380 * covered by the given span, and will set each group's ->cpumask correctly,
6381 * and ->cpu_power to 0.
6384 init_sched_build_groups(const struct cpumask *span,
6385 const struct cpumask *cpu_map,
6386 int (*group_fn)(int cpu, const struct cpumask *cpu_map,
6387 struct sched_group **sg,
6388 struct cpumask *tmpmask),
6389 struct cpumask *covered, struct cpumask *tmpmask)
6391 struct sched_group *first = NULL, *last = NULL;
6394 cpumask_clear(covered);
6396 for_each_cpu(i, span) {
6397 struct sched_group *sg;
6398 int group = group_fn(i, cpu_map, &sg, tmpmask);
6401 if (cpumask_test_cpu(i, covered))
6404 cpumask_clear(sched_group_cpus(sg));
6407 for_each_cpu(j, span) {
6408 if (group_fn(j, cpu_map, NULL, tmpmask) != group)
6411 cpumask_set_cpu(j, covered);
6412 cpumask_set_cpu(j, sched_group_cpus(sg));
6423 #define SD_NODES_PER_DOMAIN 16
6428 * find_next_best_node - find the next node to include in a sched_domain
6429 * @node: node whose sched_domain we're building
6430 * @used_nodes: nodes already in the sched_domain
6432 * Find the next node to include in a given scheduling domain. Simply
6433 * finds the closest node not already in the @used_nodes map.
6435 * Should use nodemask_t.
6437 static int find_next_best_node(int node, nodemask_t *used_nodes)
6439 int i, n, val, min_val, best_node = 0;
6443 for (i = 0; i < nr_node_ids; i++) {
6444 /* Start at @node */
6445 n = (node + i) % nr_node_ids;
6447 if (!nr_cpus_node(n))
6450 /* Skip already used nodes */
6451 if (node_isset(n, *used_nodes))
6454 /* Simple min distance search */
6455 val = node_distance(node, n);
6457 if (val < min_val) {
6463 node_set(best_node, *used_nodes);
6468 * sched_domain_node_span - get a cpumask for a node's sched_domain
6469 * @node: node whose cpumask we're constructing
6470 * @span: resulting cpumask
6472 * Given a node, construct a good cpumask for its sched_domain to span. It
6473 * should be one that prevents unnecessary balancing, but also spreads tasks
6476 static void sched_domain_node_span(int node, struct cpumask *span)
6478 nodemask_t used_nodes;
6481 cpumask_clear(span);
6482 nodes_clear(used_nodes);
6484 cpumask_or(span, span, cpumask_of_node(node));
6485 node_set(node, used_nodes);
6487 for (i = 1; i < SD_NODES_PER_DOMAIN; i++) {
6488 int next_node = find_next_best_node(node, &used_nodes);
6490 cpumask_or(span, span, cpumask_of_node(next_node));
6493 #endif /* CONFIG_NUMA */
6495 int sched_smt_power_savings = 0, sched_mc_power_savings = 0;
6498 * The cpus mask in sched_group and sched_domain hangs off the end.
6500 * ( See the the comments in include/linux/sched.h:struct sched_group
6501 * and struct sched_domain. )
6503 struct static_sched_group {
6504 struct sched_group sg;
6505 DECLARE_BITMAP(cpus, CONFIG_NR_CPUS);
6508 struct static_sched_domain {
6509 struct sched_domain sd;
6510 DECLARE_BITMAP(span, CONFIG_NR_CPUS);
6516 cpumask_var_t domainspan;
6517 cpumask_var_t covered;
6518 cpumask_var_t notcovered;
6520 cpumask_var_t nodemask;
6521 cpumask_var_t this_sibling_map;
6522 cpumask_var_t this_core_map;
6523 cpumask_var_t send_covered;
6524 cpumask_var_t tmpmask;
6525 struct sched_group **sched_group_nodes;
6526 struct root_domain *rd;
6530 sa_sched_groups = 0,
6535 sa_this_sibling_map,
6537 sa_sched_group_nodes,
6547 * SMT sched-domains:
6549 #ifdef CONFIG_SCHED_SMT
6550 static DEFINE_PER_CPU(struct static_sched_domain, cpu_domains);
6551 static DEFINE_PER_CPU(struct static_sched_group, sched_groups);
6554 cpu_to_cpu_group(int cpu, const struct cpumask *cpu_map,
6555 struct sched_group **sg, struct cpumask *unused)
6558 *sg = &per_cpu(sched_groups, cpu).sg;
6561 #endif /* CONFIG_SCHED_SMT */
6564 * multi-core sched-domains:
6566 #ifdef CONFIG_SCHED_MC
6567 static DEFINE_PER_CPU(struct static_sched_domain, core_domains);
6568 static DEFINE_PER_CPU(struct static_sched_group, sched_group_core);
6569 #endif /* CONFIG_SCHED_MC */
6571 #if defined(CONFIG_SCHED_MC) && defined(CONFIG_SCHED_SMT)
6573 cpu_to_core_group(int cpu, const struct cpumask *cpu_map,
6574 struct sched_group **sg, struct cpumask *mask)
6578 cpumask_and(mask, topology_thread_cpumask(cpu), cpu_map);
6579 group = cpumask_first(mask);
6581 *sg = &per_cpu(sched_group_core, group).sg;
6584 #elif defined(CONFIG_SCHED_MC)
6586 cpu_to_core_group(int cpu, const struct cpumask *cpu_map,
6587 struct sched_group **sg, struct cpumask *unused)
6590 *sg = &per_cpu(sched_group_core, cpu).sg;
6595 static DEFINE_PER_CPU(struct static_sched_domain, phys_domains);
6596 static DEFINE_PER_CPU(struct static_sched_group, sched_group_phys);
6599 cpu_to_phys_group(int cpu, const struct cpumask *cpu_map,
6600 struct sched_group **sg, struct cpumask *mask)
6603 #ifdef CONFIG_SCHED_MC
6604 cpumask_and(mask, cpu_coregroup_mask(cpu), cpu_map);
6605 group = cpumask_first(mask);
6606 #elif defined(CONFIG_SCHED_SMT)
6607 cpumask_and(mask, topology_thread_cpumask(cpu), cpu_map);
6608 group = cpumask_first(mask);
6613 *sg = &per_cpu(sched_group_phys, group).sg;
6619 * The init_sched_build_groups can't handle what we want to do with node
6620 * groups, so roll our own. Now each node has its own list of groups which
6621 * gets dynamically allocated.
6623 static DEFINE_PER_CPU(struct static_sched_domain, node_domains);
6624 static struct sched_group ***sched_group_nodes_bycpu;
6626 static DEFINE_PER_CPU(struct static_sched_domain, allnodes_domains);
6627 static DEFINE_PER_CPU(struct static_sched_group, sched_group_allnodes);
6629 static int cpu_to_allnodes_group(int cpu, const struct cpumask *cpu_map,
6630 struct sched_group **sg,
6631 struct cpumask *nodemask)
6635 cpumask_and(nodemask, cpumask_of_node(cpu_to_node(cpu)), cpu_map);
6636 group = cpumask_first(nodemask);
6639 *sg = &per_cpu(sched_group_allnodes, group).sg;
6643 static void init_numa_sched_groups_power(struct sched_group *group_head)
6645 struct sched_group *sg = group_head;
6651 for_each_cpu(j, sched_group_cpus(sg)) {
6652 struct sched_domain *sd;
6654 sd = &per_cpu(phys_domains, j).sd;
6655 if (j != group_first_cpu(sd->groups)) {
6657 * Only add "power" once for each
6663 sg->cpu_power += sd->groups->cpu_power;
6666 } while (sg != group_head);
6669 static int build_numa_sched_groups(struct s_data *d,
6670 const struct cpumask *cpu_map, int num)
6672 struct sched_domain *sd;
6673 struct sched_group *sg, *prev;
6676 cpumask_clear(d->covered);
6677 cpumask_and(d->nodemask, cpumask_of_node(num), cpu_map);
6678 if (cpumask_empty(d->nodemask)) {
6679 d->sched_group_nodes[num] = NULL;
6683 sched_domain_node_span(num, d->domainspan);
6684 cpumask_and(d->domainspan, d->domainspan, cpu_map);
6686 sg = kmalloc_node(sizeof(struct sched_group) + cpumask_size(),
6689 printk(KERN_WARNING "Can not alloc domain group for node %d\n",
6693 d->sched_group_nodes[num] = sg;
6695 for_each_cpu(j, d->nodemask) {
6696 sd = &per_cpu(node_domains, j).sd;
6701 cpumask_copy(sched_group_cpus(sg), d->nodemask);
6703 cpumask_or(d->covered, d->covered, d->nodemask);
6706 for (j = 0; j < nr_node_ids; j++) {
6707 n = (num + j) % nr_node_ids;
6708 cpumask_complement(d->notcovered, d->covered);
6709 cpumask_and(d->tmpmask, d->notcovered, cpu_map);
6710 cpumask_and(d->tmpmask, d->tmpmask, d->domainspan);
6711 if (cpumask_empty(d->tmpmask))
6713 cpumask_and(d->tmpmask, d->tmpmask, cpumask_of_node(n));
6714 if (cpumask_empty(d->tmpmask))
6716 sg = kmalloc_node(sizeof(struct sched_group) + cpumask_size(),
6720 "Can not alloc domain group for node %d\n", j);
6724 cpumask_copy(sched_group_cpus(sg), d->tmpmask);
6725 sg->next = prev->next;
6726 cpumask_or(d->covered, d->covered, d->tmpmask);
6733 #endif /* CONFIG_NUMA */
6736 /* Free memory allocated for various sched_group structures */
6737 static void free_sched_groups(const struct cpumask *cpu_map,
6738 struct cpumask *nodemask)
6742 for_each_cpu(cpu, cpu_map) {
6743 struct sched_group **sched_group_nodes
6744 = sched_group_nodes_bycpu[cpu];
6746 if (!sched_group_nodes)
6749 for (i = 0; i < nr_node_ids; i++) {
6750 struct sched_group *oldsg, *sg = sched_group_nodes[i];
6752 cpumask_and(nodemask, cpumask_of_node(i), cpu_map);
6753 if (cpumask_empty(nodemask))
6763 if (oldsg != sched_group_nodes[i])
6766 kfree(sched_group_nodes);
6767 sched_group_nodes_bycpu[cpu] = NULL;
6770 #else /* !CONFIG_NUMA */
6771 static void free_sched_groups(const struct cpumask *cpu_map,
6772 struct cpumask *nodemask)
6775 #endif /* CONFIG_NUMA */
6778 * Initialize sched groups cpu_power.
6780 * cpu_power indicates the capacity of sched group, which is used while
6781 * distributing the load between different sched groups in a sched domain.
6782 * Typically cpu_power for all the groups in a sched domain will be same unless
6783 * there are asymmetries in the topology. If there are asymmetries, group
6784 * having more cpu_power will pickup more load compared to the group having
6787 static void init_sched_groups_power(int cpu, struct sched_domain *sd)
6789 struct sched_domain *child;
6790 struct sched_group *group;
6794 WARN_ON(!sd || !sd->groups);
6796 if (cpu != group_first_cpu(sd->groups))
6801 sd->groups->cpu_power = 0;
6804 power = SCHED_LOAD_SCALE;
6805 weight = cpumask_weight(sched_domain_span(sd));
6807 * SMT siblings share the power of a single core.
6808 * Usually multiple threads get a better yield out of
6809 * that one core than a single thread would have,
6810 * reflect that in sd->smt_gain.
6812 if ((sd->flags & SD_SHARE_CPUPOWER) && weight > 1) {
6813 power *= sd->smt_gain;
6815 power >>= SCHED_LOAD_SHIFT;
6817 sd->groups->cpu_power += power;
6822 * Add cpu_power of each child group to this groups cpu_power.
6824 group = child->groups;
6826 sd->groups->cpu_power += group->cpu_power;
6827 group = group->next;
6828 } while (group != child->groups);
6832 * Initializers for schedule domains
6833 * Non-inlined to reduce accumulated stack pressure in build_sched_domains()
6836 #ifdef CONFIG_SCHED_DEBUG
6837 # define SD_INIT_NAME(sd, type) sd->name = #type
6839 # define SD_INIT_NAME(sd, type) do { } while (0)
6842 #define SD_INIT(sd, type) sd_init_##type(sd)
6844 #define SD_INIT_FUNC(type) \
6845 static noinline void sd_init_##type(struct sched_domain *sd) \
6847 memset(sd, 0, sizeof(*sd)); \
6848 *sd = SD_##type##_INIT; \
6849 sd->level = SD_LV_##type; \
6850 SD_INIT_NAME(sd, type); \
6855 SD_INIT_FUNC(ALLNODES)
6858 #ifdef CONFIG_SCHED_SMT
6859 SD_INIT_FUNC(SIBLING)
6861 #ifdef CONFIG_SCHED_MC
6865 static int default_relax_domain_level = -1;
6867 static int __init setup_relax_domain_level(char *str)
6871 val = simple_strtoul(str, NULL, 0);
6872 if (val < SD_LV_MAX)
6873 default_relax_domain_level = val;
6877 __setup("relax_domain_level=", setup_relax_domain_level);
6879 static void set_domain_attribute(struct sched_domain *sd,
6880 struct sched_domain_attr *attr)
6884 if (!attr || attr->relax_domain_level < 0) {
6885 if (default_relax_domain_level < 0)
6888 request = default_relax_domain_level;
6890 request = attr->relax_domain_level;
6891 if (request < sd->level) {
6892 /* turn off idle balance on this domain */
6893 sd->flags &= ~(SD_BALANCE_WAKE|SD_BALANCE_NEWIDLE);
6895 /* turn on idle balance on this domain */
6896 sd->flags |= (SD_BALANCE_WAKE|SD_BALANCE_NEWIDLE);
6900 static void __free_domain_allocs(struct s_data *d, enum s_alloc what,
6901 const struct cpumask *cpu_map)
6904 case sa_sched_groups:
6905 free_sched_groups(cpu_map, d->tmpmask); /* fall through */
6906 d->sched_group_nodes = NULL;
6908 free_rootdomain(d->rd); /* fall through */
6910 free_cpumask_var(d->tmpmask); /* fall through */
6911 case sa_send_covered:
6912 free_cpumask_var(d->send_covered); /* fall through */
6913 case sa_this_core_map:
6914 free_cpumask_var(d->this_core_map); /* fall through */
6915 case sa_this_sibling_map:
6916 free_cpumask_var(d->this_sibling_map); /* fall through */
6918 free_cpumask_var(d->nodemask); /* fall through */
6919 case sa_sched_group_nodes:
6921 kfree(d->sched_group_nodes); /* fall through */
6923 free_cpumask_var(d->notcovered); /* fall through */
6925 free_cpumask_var(d->covered); /* fall through */
6927 free_cpumask_var(d->domainspan); /* fall through */
6934 static enum s_alloc __visit_domain_allocation_hell(struct s_data *d,
6935 const struct cpumask *cpu_map)
6938 if (!alloc_cpumask_var(&d->domainspan, GFP_KERNEL))
6940 if (!alloc_cpumask_var(&d->covered, GFP_KERNEL))
6941 return sa_domainspan;
6942 if (!alloc_cpumask_var(&d->notcovered, GFP_KERNEL))
6944 /* Allocate the per-node list of sched groups */
6945 d->sched_group_nodes = kcalloc(nr_node_ids,
6946 sizeof(struct sched_group *), GFP_KERNEL);
6947 if (!d->sched_group_nodes) {
6948 printk(KERN_WARNING "Can not alloc sched group node list\n");
6949 return sa_notcovered;
6951 sched_group_nodes_bycpu[cpumask_first(cpu_map)] = d->sched_group_nodes;
6953 if (!alloc_cpumask_var(&d->nodemask, GFP_KERNEL))
6954 return sa_sched_group_nodes;
6955 if (!alloc_cpumask_var(&d->this_sibling_map, GFP_KERNEL))
6957 if (!alloc_cpumask_var(&d->this_core_map, GFP_KERNEL))
6958 return sa_this_sibling_map;
6959 if (!alloc_cpumask_var(&d->send_covered, GFP_KERNEL))
6960 return sa_this_core_map;
6961 if (!alloc_cpumask_var(&d->tmpmask, GFP_KERNEL))
6962 return sa_send_covered;
6963 d->rd = alloc_rootdomain();
6965 printk(KERN_WARNING "Cannot alloc root domain\n");
6968 return sa_rootdomain;
6971 static struct sched_domain *__build_numa_sched_domains(struct s_data *d,
6972 const struct cpumask *cpu_map, struct sched_domain_attr *attr, int i)
6974 struct sched_domain *sd = NULL;
6976 struct sched_domain *parent;
6979 if (cpumask_weight(cpu_map) >
6980 SD_NODES_PER_DOMAIN * cpumask_weight(d->nodemask)) {
6981 sd = &per_cpu(allnodes_domains, i).sd;
6982 SD_INIT(sd, ALLNODES);
6983 set_domain_attribute(sd, attr);
6984 cpumask_copy(sched_domain_span(sd), cpu_map);
6985 cpu_to_allnodes_group(i, cpu_map, &sd->groups, d->tmpmask);
6990 sd = &per_cpu(node_domains, i).sd;
6992 set_domain_attribute(sd, attr);
6993 sched_domain_node_span(cpu_to_node(i), sched_domain_span(sd));
6994 sd->parent = parent;
6997 cpumask_and(sched_domain_span(sd), sched_domain_span(sd), cpu_map);
7002 static struct sched_domain *__build_cpu_sched_domain(struct s_data *d,
7003 const struct cpumask *cpu_map, struct sched_domain_attr *attr,
7004 struct sched_domain *parent, int i)
7006 struct sched_domain *sd;
7007 sd = &per_cpu(phys_domains, i).sd;
7009 set_domain_attribute(sd, attr);
7010 cpumask_copy(sched_domain_span(sd), d->nodemask);
7011 sd->parent = parent;
7014 cpu_to_phys_group(i, cpu_map, &sd->groups, d->tmpmask);
7018 static struct sched_domain *__build_mc_sched_domain(struct s_data *d,
7019 const struct cpumask *cpu_map, struct sched_domain_attr *attr,
7020 struct sched_domain *parent, int i)
7022 struct sched_domain *sd = parent;
7023 #ifdef CONFIG_SCHED_MC
7024 sd = &per_cpu(core_domains, i).sd;
7026 set_domain_attribute(sd, attr);
7027 cpumask_and(sched_domain_span(sd), cpu_map, cpu_coregroup_mask(i));
7028 sd->parent = parent;
7030 cpu_to_core_group(i, cpu_map, &sd->groups, d->tmpmask);
7035 static struct sched_domain *__build_smt_sched_domain(struct s_data *d,
7036 const struct cpumask *cpu_map, struct sched_domain_attr *attr,
7037 struct sched_domain *parent, int i)
7039 struct sched_domain *sd = parent;
7040 #ifdef CONFIG_SCHED_SMT
7041 sd = &per_cpu(cpu_domains, i).sd;
7042 SD_INIT(sd, SIBLING);
7043 set_domain_attribute(sd, attr);
7044 cpumask_and(sched_domain_span(sd), cpu_map, topology_thread_cpumask(i));
7045 sd->parent = parent;
7047 cpu_to_cpu_group(i, cpu_map, &sd->groups, d->tmpmask);
7052 static void build_sched_groups(struct s_data *d, enum sched_domain_level l,
7053 const struct cpumask *cpu_map, int cpu)
7056 #ifdef CONFIG_SCHED_SMT
7057 case SD_LV_SIBLING: /* set up CPU (sibling) groups */
7058 cpumask_and(d->this_sibling_map, cpu_map,
7059 topology_thread_cpumask(cpu));
7060 if (cpu == cpumask_first(d->this_sibling_map))
7061 init_sched_build_groups(d->this_sibling_map, cpu_map,
7063 d->send_covered, d->tmpmask);
7066 #ifdef CONFIG_SCHED_MC
7067 case SD_LV_MC: /* set up multi-core groups */
7068 cpumask_and(d->this_core_map, cpu_map, cpu_coregroup_mask(cpu));
7069 if (cpu == cpumask_first(d->this_core_map))
7070 init_sched_build_groups(d->this_core_map, cpu_map,
7072 d->send_covered, d->tmpmask);
7075 case SD_LV_CPU: /* set up physical groups */
7076 cpumask_and(d->nodemask, cpumask_of_node(cpu), cpu_map);
7077 if (!cpumask_empty(d->nodemask))
7078 init_sched_build_groups(d->nodemask, cpu_map,
7080 d->send_covered, d->tmpmask);
7083 case SD_LV_ALLNODES:
7084 init_sched_build_groups(cpu_map, cpu_map, &cpu_to_allnodes_group,
7085 d->send_covered, d->tmpmask);
7094 * Build sched domains for a given set of cpus and attach the sched domains
7095 * to the individual cpus
7097 static int __build_sched_domains(const struct cpumask *cpu_map,
7098 struct sched_domain_attr *attr)
7100 enum s_alloc alloc_state = sa_none;
7102 struct sched_domain *sd;
7108 alloc_state = __visit_domain_allocation_hell(&d, cpu_map);
7109 if (alloc_state != sa_rootdomain)
7111 alloc_state = sa_sched_groups;
7114 * Set up domains for cpus specified by the cpu_map.
7116 for_each_cpu(i, cpu_map) {
7117 cpumask_and(d.nodemask, cpumask_of_node(cpu_to_node(i)),
7120 sd = __build_numa_sched_domains(&d, cpu_map, attr, i);
7121 sd = __build_cpu_sched_domain(&d, cpu_map, attr, sd, i);
7122 sd = __build_mc_sched_domain(&d, cpu_map, attr, sd, i);
7123 sd = __build_smt_sched_domain(&d, cpu_map, attr, sd, i);
7126 for_each_cpu(i, cpu_map) {
7127 build_sched_groups(&d, SD_LV_SIBLING, cpu_map, i);
7128 build_sched_groups(&d, SD_LV_MC, cpu_map, i);
7131 /* Set up physical groups */
7132 for (i = 0; i < nr_node_ids; i++)
7133 build_sched_groups(&d, SD_LV_CPU, cpu_map, i);
7136 /* Set up node groups */
7138 build_sched_groups(&d, SD_LV_ALLNODES, cpu_map, 0);
7140 for (i = 0; i < nr_node_ids; i++)
7141 if (build_numa_sched_groups(&d, cpu_map, i))
7145 /* Calculate CPU power for physical packages and nodes */
7146 #ifdef CONFIG_SCHED_SMT
7147 for_each_cpu(i, cpu_map) {
7148 sd = &per_cpu(cpu_domains, i).sd;
7149 init_sched_groups_power(i, sd);
7152 #ifdef CONFIG_SCHED_MC
7153 for_each_cpu(i, cpu_map) {
7154 sd = &per_cpu(core_domains, i).sd;
7155 init_sched_groups_power(i, sd);
7159 for_each_cpu(i, cpu_map) {
7160 sd = &per_cpu(phys_domains, i).sd;
7161 init_sched_groups_power(i, sd);
7165 for (i = 0; i < nr_node_ids; i++)
7166 init_numa_sched_groups_power(d.sched_group_nodes[i]);
7168 if (d.sd_allnodes) {
7169 struct sched_group *sg;
7171 cpu_to_allnodes_group(cpumask_first(cpu_map), cpu_map, &sg,
7173 init_numa_sched_groups_power(sg);
7177 /* Attach the domains */
7178 for_each_cpu(i, cpu_map) {
7179 #ifdef CONFIG_SCHED_SMT
7180 sd = &per_cpu(cpu_domains, i).sd;
7181 #elif defined(CONFIG_SCHED_MC)
7182 sd = &per_cpu(core_domains, i).sd;
7184 sd = &per_cpu(phys_domains, i).sd;
7186 cpu_attach_domain(sd, d.rd, i);
7189 d.sched_group_nodes = NULL; /* don't free this we still need it */
7190 __free_domain_allocs(&d, sa_tmpmask, cpu_map);
7194 __free_domain_allocs(&d, alloc_state, cpu_map);
7198 static int build_sched_domains(const struct cpumask *cpu_map)
7200 return __build_sched_domains(cpu_map, NULL);
7203 static cpumask_var_t *doms_cur; /* current sched domains */
7204 static int ndoms_cur; /* number of sched domains in 'doms_cur' */
7205 static struct sched_domain_attr *dattr_cur;
7206 /* attribues of custom domains in 'doms_cur' */
7209 * Special case: If a kmalloc of a doms_cur partition (array of
7210 * cpumask) fails, then fallback to a single sched domain,
7211 * as determined by the single cpumask fallback_doms.
7213 static cpumask_var_t fallback_doms;
7216 * arch_update_cpu_topology lets virtualized architectures update the
7217 * cpu core maps. It is supposed to return 1 if the topology changed
7218 * or 0 if it stayed the same.
7220 int __attribute__((weak)) arch_update_cpu_topology(void)
7225 cpumask_var_t *alloc_sched_domains(unsigned int ndoms)
7228 cpumask_var_t *doms;
7230 doms = kmalloc(sizeof(*doms) * ndoms, GFP_KERNEL);
7233 for (i = 0; i < ndoms; i++) {
7234 if (!alloc_cpumask_var(&doms[i], GFP_KERNEL)) {
7235 free_sched_domains(doms, i);
7242 void free_sched_domains(cpumask_var_t doms[], unsigned int ndoms)
7245 for (i = 0; i < ndoms; i++)
7246 free_cpumask_var(doms[i]);
7251 * Set up scheduler domains and groups. Callers must hold the hotplug lock.
7252 * For now this just excludes isolated cpus, but could be used to
7253 * exclude other special cases in the future.
7255 static int arch_init_sched_domains(const struct cpumask *cpu_map)
7259 arch_update_cpu_topology();
7261 doms_cur = alloc_sched_domains(ndoms_cur);
7263 doms_cur = &fallback_doms;
7264 cpumask_andnot(doms_cur[0], cpu_map, cpu_isolated_map);
7266 err = build_sched_domains(doms_cur[0]);
7267 register_sched_domain_sysctl();
7272 static void arch_destroy_sched_domains(const struct cpumask *cpu_map,
7273 struct cpumask *tmpmask)
7275 free_sched_groups(cpu_map, tmpmask);
7279 * Detach sched domains from a group of cpus specified in cpu_map
7280 * These cpus will now be attached to the NULL domain
7282 static void detach_destroy_domains(const struct cpumask *cpu_map)
7284 /* Save because hotplug lock held. */
7285 static DECLARE_BITMAP(tmpmask, CONFIG_NR_CPUS);
7288 for_each_cpu(i, cpu_map)
7289 cpu_attach_domain(NULL, &def_root_domain, i);
7290 synchronize_sched();
7291 arch_destroy_sched_domains(cpu_map, to_cpumask(tmpmask));
7294 /* handle null as "default" */
7295 static int dattrs_equal(struct sched_domain_attr *cur, int idx_cur,
7296 struct sched_domain_attr *new, int idx_new)
7298 struct sched_domain_attr tmp;
7305 return !memcmp(cur ? (cur + idx_cur) : &tmp,
7306 new ? (new + idx_new) : &tmp,
7307 sizeof(struct sched_domain_attr));
7311 * Partition sched domains as specified by the 'ndoms_new'
7312 * cpumasks in the array doms_new[] of cpumasks. This compares
7313 * doms_new[] to the current sched domain partitioning, doms_cur[].
7314 * It destroys each deleted domain and builds each new domain.
7316 * 'doms_new' is an array of cpumask_var_t's of length 'ndoms_new'.
7317 * The masks don't intersect (don't overlap.) We should setup one
7318 * sched domain for each mask. CPUs not in any of the cpumasks will
7319 * not be load balanced. If the same cpumask appears both in the
7320 * current 'doms_cur' domains and in the new 'doms_new', we can leave
7323 * The passed in 'doms_new' should be allocated using
7324 * alloc_sched_domains. This routine takes ownership of it and will
7325 * free_sched_domains it when done with it. If the caller failed the
7326 * alloc call, then it can pass in doms_new == NULL && ndoms_new == 1,
7327 * and partition_sched_domains() will fallback to the single partition
7328 * 'fallback_doms', it also forces the domains to be rebuilt.
7330 * If doms_new == NULL it will be replaced with cpu_online_mask.
7331 * ndoms_new == 0 is a special case for destroying existing domains,
7332 * and it will not create the default domain.
7334 * Call with hotplug lock held
7336 void partition_sched_domains(int ndoms_new, cpumask_var_t doms_new[],
7337 struct sched_domain_attr *dattr_new)
7342 mutex_lock(&sched_domains_mutex);
7344 /* always unregister in case we don't destroy any domains */
7345 unregister_sched_domain_sysctl();
7347 /* Let architecture update cpu core mappings. */
7348 new_topology = arch_update_cpu_topology();
7350 n = doms_new ? ndoms_new : 0;
7352 /* Destroy deleted domains */
7353 for (i = 0; i < ndoms_cur; i++) {
7354 for (j = 0; j < n && !new_topology; j++) {
7355 if (cpumask_equal(doms_cur[i], doms_new[j])
7356 && dattrs_equal(dattr_cur, i, dattr_new, j))
7359 /* no match - a current sched domain not in new doms_new[] */
7360 detach_destroy_domains(doms_cur[i]);
7365 if (doms_new == NULL) {
7367 doms_new = &fallback_doms;
7368 cpumask_andnot(doms_new[0], cpu_active_mask, cpu_isolated_map);
7369 WARN_ON_ONCE(dattr_new);
7372 /* Build new domains */
7373 for (i = 0; i < ndoms_new; i++) {
7374 for (j = 0; j < ndoms_cur && !new_topology; j++) {
7375 if (cpumask_equal(doms_new[i], doms_cur[j])
7376 && dattrs_equal(dattr_new, i, dattr_cur, j))
7379 /* no match - add a new doms_new */
7380 __build_sched_domains(doms_new[i],
7381 dattr_new ? dattr_new + i : NULL);
7386 /* Remember the new sched domains */
7387 if (doms_cur != &fallback_doms)
7388 free_sched_domains(doms_cur, ndoms_cur);
7389 kfree(dattr_cur); /* kfree(NULL) is safe */
7390 doms_cur = doms_new;
7391 dattr_cur = dattr_new;
7392 ndoms_cur = ndoms_new;
7394 register_sched_domain_sysctl();
7396 mutex_unlock(&sched_domains_mutex);
7399 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
7400 static void arch_reinit_sched_domains(void)
7404 /* Destroy domains first to force the rebuild */
7405 partition_sched_domains(0, NULL, NULL);
7407 rebuild_sched_domains();
7411 static ssize_t sched_power_savings_store(const char *buf, size_t count, int smt)
7413 unsigned int level = 0;
7415 if (sscanf(buf, "%u", &level) != 1)
7419 * level is always be positive so don't check for
7420 * level < POWERSAVINGS_BALANCE_NONE which is 0
7421 * What happens on 0 or 1 byte write,
7422 * need to check for count as well?
7425 if (level >= MAX_POWERSAVINGS_BALANCE_LEVELS)
7429 sched_smt_power_savings = level;
7431 sched_mc_power_savings = level;
7433 arch_reinit_sched_domains();
7438 #ifdef CONFIG_SCHED_MC
7439 static ssize_t sched_mc_power_savings_show(struct sysdev_class *class,
7440 struct sysdev_class_attribute *attr,
7443 return sprintf(page, "%u\n", sched_mc_power_savings);
7445 static ssize_t sched_mc_power_savings_store(struct sysdev_class *class,
7446 struct sysdev_class_attribute *attr,
7447 const char *buf, size_t count)
7449 return sched_power_savings_store(buf, count, 0);
7451 static SYSDEV_CLASS_ATTR(sched_mc_power_savings, 0644,
7452 sched_mc_power_savings_show,
7453 sched_mc_power_savings_store);
7456 #ifdef CONFIG_SCHED_SMT
7457 static ssize_t sched_smt_power_savings_show(struct sysdev_class *dev,
7458 struct sysdev_class_attribute *attr,
7461 return sprintf(page, "%u\n", sched_smt_power_savings);
7463 static ssize_t sched_smt_power_savings_store(struct sysdev_class *dev,
7464 struct sysdev_class_attribute *attr,
7465 const char *buf, size_t count)
7467 return sched_power_savings_store(buf, count, 1);
7469 static SYSDEV_CLASS_ATTR(sched_smt_power_savings, 0644,
7470 sched_smt_power_savings_show,
7471 sched_smt_power_savings_store);
7474 int __init sched_create_sysfs_power_savings_entries(struct sysdev_class *cls)
7478 #ifdef CONFIG_SCHED_SMT
7480 err = sysfs_create_file(&cls->kset.kobj,
7481 &attr_sched_smt_power_savings.attr);
7483 #ifdef CONFIG_SCHED_MC
7484 if (!err && mc_capable())
7485 err = sysfs_create_file(&cls->kset.kobj,
7486 &attr_sched_mc_power_savings.attr);
7490 #endif /* CONFIG_SCHED_MC || CONFIG_SCHED_SMT */
7493 * Update cpusets according to cpu_active mask. If cpusets are
7494 * disabled, cpuset_update_active_cpus() becomes a simple wrapper
7495 * around partition_sched_domains().
7497 static int cpuset_cpu_active(struct notifier_block *nfb, unsigned long action,
7500 switch (action & ~CPU_TASKS_FROZEN) {
7502 case CPU_DOWN_FAILED:
7503 cpuset_update_active_cpus();
7510 static int cpuset_cpu_inactive(struct notifier_block *nfb, unsigned long action,
7513 switch (action & ~CPU_TASKS_FROZEN) {
7514 case CPU_DOWN_PREPARE:
7515 cpuset_update_active_cpus();
7522 static int update_runtime(struct notifier_block *nfb,
7523 unsigned long action, void *hcpu)
7525 int cpu = (int)(long)hcpu;
7528 case CPU_DOWN_PREPARE:
7529 case CPU_DOWN_PREPARE_FROZEN:
7530 disable_runtime(cpu_rq(cpu));
7533 case CPU_DOWN_FAILED:
7534 case CPU_DOWN_FAILED_FROZEN:
7536 case CPU_ONLINE_FROZEN:
7537 enable_runtime(cpu_rq(cpu));
7545 void __init sched_init_smp(void)
7547 cpumask_var_t non_isolated_cpus;
7549 alloc_cpumask_var(&non_isolated_cpus, GFP_KERNEL);
7550 alloc_cpumask_var(&fallback_doms, GFP_KERNEL);
7552 #if defined(CONFIG_NUMA)
7553 sched_group_nodes_bycpu = kzalloc(nr_cpu_ids * sizeof(void **),
7555 BUG_ON(sched_group_nodes_bycpu == NULL);
7558 mutex_lock(&sched_domains_mutex);
7559 arch_init_sched_domains(cpu_active_mask);
7560 cpumask_andnot(non_isolated_cpus, cpu_possible_mask, cpu_isolated_map);
7561 if (cpumask_empty(non_isolated_cpus))
7562 cpumask_set_cpu(smp_processor_id(), non_isolated_cpus);
7563 mutex_unlock(&sched_domains_mutex);
7566 hotcpu_notifier(cpuset_cpu_active, CPU_PRI_CPUSET_ACTIVE);
7567 hotcpu_notifier(cpuset_cpu_inactive, CPU_PRI_CPUSET_INACTIVE);
7569 /* RT runtime code needs to handle some hotplug events */
7570 hotcpu_notifier(update_runtime, 0);
7574 /* Move init over to a non-isolated CPU */
7575 if (set_cpus_allowed_ptr(current, non_isolated_cpus) < 0)
7577 sched_init_granularity();
7578 free_cpumask_var(non_isolated_cpus);
7580 init_sched_rt_class();
7583 void __init sched_init_smp(void)
7585 sched_init_granularity();
7587 #endif /* CONFIG_SMP */
7589 const_debug unsigned int sysctl_timer_migration = 1;
7591 int in_sched_functions(unsigned long addr)
7593 return in_lock_functions(addr) ||
7594 (addr >= (unsigned long)__sched_text_start
7595 && addr < (unsigned long)__sched_text_end);
7598 static void init_cfs_rq(struct cfs_rq *cfs_rq, struct rq *rq)
7600 cfs_rq->tasks_timeline = RB_ROOT;
7601 INIT_LIST_HEAD(&cfs_rq->tasks);
7602 #ifdef CONFIG_FAIR_GROUP_SCHED
7605 cfs_rq->min_vruntime = (u64)(-(1LL << 20));
7608 static void init_rt_rq(struct rt_rq *rt_rq, struct rq *rq)
7610 struct rt_prio_array *array;
7613 array = &rt_rq->active;
7614 for (i = 0; i < MAX_RT_PRIO; i++) {
7615 INIT_LIST_HEAD(array->queue + i);
7616 __clear_bit(i, array->bitmap);
7618 /* delimiter for bitsearch: */
7619 __set_bit(MAX_RT_PRIO, array->bitmap);
7621 #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED
7622 rt_rq->highest_prio.curr = MAX_RT_PRIO;
7624 rt_rq->highest_prio.next = MAX_RT_PRIO;
7628 rt_rq->rt_nr_migratory = 0;
7629 rt_rq->overloaded = 0;
7630 plist_head_init_raw(&rt_rq->pushable_tasks, &rq->lock);
7634 rt_rq->rt_throttled = 0;
7635 rt_rq->rt_runtime = 0;
7636 raw_spin_lock_init(&rt_rq->rt_runtime_lock);
7638 #ifdef CONFIG_RT_GROUP_SCHED
7639 rt_rq->rt_nr_boosted = 0;
7644 #ifdef CONFIG_FAIR_GROUP_SCHED
7645 static void init_tg_cfs_entry(struct task_group *tg, struct cfs_rq *cfs_rq,
7646 struct sched_entity *se, int cpu, int add,
7647 struct sched_entity *parent)
7649 struct rq *rq = cpu_rq(cpu);
7650 tg->cfs_rq[cpu] = cfs_rq;
7651 init_cfs_rq(cfs_rq, rq);
7654 list_add(&cfs_rq->leaf_cfs_rq_list, &rq->leaf_cfs_rq_list);
7657 /* se could be NULL for init_task_group */
7662 se->cfs_rq = &rq->cfs;
7664 se->cfs_rq = parent->my_q;
7667 se->load.weight = tg->shares;
7668 se->load.inv_weight = 0;
7669 se->parent = parent;
7673 #ifdef CONFIG_RT_GROUP_SCHED
7674 static void init_tg_rt_entry(struct task_group *tg, struct rt_rq *rt_rq,
7675 struct sched_rt_entity *rt_se, int cpu, int add,
7676 struct sched_rt_entity *parent)
7678 struct rq *rq = cpu_rq(cpu);
7680 tg->rt_rq[cpu] = rt_rq;
7681 init_rt_rq(rt_rq, rq);
7683 rt_rq->rt_runtime = tg->rt_bandwidth.rt_runtime;
7685 list_add(&rt_rq->leaf_rt_rq_list, &rq->leaf_rt_rq_list);
7687 tg->rt_se[cpu] = rt_se;
7692 rt_se->rt_rq = &rq->rt;
7694 rt_se->rt_rq = parent->my_q;
7696 rt_se->my_q = rt_rq;
7697 rt_se->parent = parent;
7698 INIT_LIST_HEAD(&rt_se->run_list);
7702 void __init sched_init(void)
7705 unsigned long alloc_size = 0, ptr;
7707 #ifdef CONFIG_FAIR_GROUP_SCHED
7708 alloc_size += 2 * nr_cpu_ids * sizeof(void **);
7710 #ifdef CONFIG_RT_GROUP_SCHED
7711 alloc_size += 2 * nr_cpu_ids * sizeof(void **);
7713 #ifdef CONFIG_CPUMASK_OFFSTACK
7714 alloc_size += num_possible_cpus() * cpumask_size();
7717 ptr = (unsigned long)kzalloc(alloc_size, GFP_NOWAIT);
7719 #ifdef CONFIG_FAIR_GROUP_SCHED
7720 init_task_group.se = (struct sched_entity **)ptr;
7721 ptr += nr_cpu_ids * sizeof(void **);
7723 init_task_group.cfs_rq = (struct cfs_rq **)ptr;
7724 ptr += nr_cpu_ids * sizeof(void **);
7726 #endif /* CONFIG_FAIR_GROUP_SCHED */
7727 #ifdef CONFIG_RT_GROUP_SCHED
7728 init_task_group.rt_se = (struct sched_rt_entity **)ptr;
7729 ptr += nr_cpu_ids * sizeof(void **);
7731 init_task_group.rt_rq = (struct rt_rq **)ptr;
7732 ptr += nr_cpu_ids * sizeof(void **);
7734 #endif /* CONFIG_RT_GROUP_SCHED */
7735 #ifdef CONFIG_CPUMASK_OFFSTACK
7736 for_each_possible_cpu(i) {
7737 per_cpu(load_balance_tmpmask, i) = (void *)ptr;
7738 ptr += cpumask_size();
7740 #endif /* CONFIG_CPUMASK_OFFSTACK */
7744 init_defrootdomain();
7747 init_rt_bandwidth(&def_rt_bandwidth,
7748 global_rt_period(), global_rt_runtime());
7750 #ifdef CONFIG_RT_GROUP_SCHED
7751 init_rt_bandwidth(&init_task_group.rt_bandwidth,
7752 global_rt_period(), global_rt_runtime());
7753 #endif /* CONFIG_RT_GROUP_SCHED */
7755 #ifdef CONFIG_CGROUP_SCHED
7756 list_add(&init_task_group.list, &task_groups);
7757 INIT_LIST_HEAD(&init_task_group.children);
7759 #endif /* CONFIG_CGROUP_SCHED */
7761 #if defined CONFIG_FAIR_GROUP_SCHED && defined CONFIG_SMP
7762 update_shares_data = __alloc_percpu(nr_cpu_ids * sizeof(unsigned long),
7763 __alignof__(unsigned long));
7765 for_each_possible_cpu(i) {
7769 raw_spin_lock_init(&rq->lock);
7771 rq->calc_load_active = 0;
7772 rq->calc_load_update = jiffies + LOAD_FREQ;
7773 init_cfs_rq(&rq->cfs, rq);
7774 init_rt_rq(&rq->rt, rq);
7775 #ifdef CONFIG_FAIR_GROUP_SCHED
7776 init_task_group.shares = init_task_group_load;
7777 INIT_LIST_HEAD(&rq->leaf_cfs_rq_list);
7778 #ifdef CONFIG_CGROUP_SCHED
7780 * How much cpu bandwidth does init_task_group get?
7782 * In case of task-groups formed thr' the cgroup filesystem, it
7783 * gets 100% of the cpu resources in the system. This overall
7784 * system cpu resource is divided among the tasks of
7785 * init_task_group and its child task-groups in a fair manner,
7786 * based on each entity's (task or task-group's) weight
7787 * (se->load.weight).
7789 * In other words, if init_task_group has 10 tasks of weight
7790 * 1024) and two child groups A0 and A1 (of weight 1024 each),
7791 * then A0's share of the cpu resource is:
7793 * A0's bandwidth = 1024 / (10*1024 + 1024 + 1024) = 8.33%
7795 * We achieve this by letting init_task_group's tasks sit
7796 * directly in rq->cfs (i.e init_task_group->se[] = NULL).
7798 init_tg_cfs_entry(&init_task_group, &rq->cfs, NULL, i, 1, NULL);
7800 #endif /* CONFIG_FAIR_GROUP_SCHED */
7802 rq->rt.rt_runtime = def_rt_bandwidth.rt_runtime;
7803 #ifdef CONFIG_RT_GROUP_SCHED
7804 INIT_LIST_HEAD(&rq->leaf_rt_rq_list);
7805 #ifdef CONFIG_CGROUP_SCHED
7806 init_tg_rt_entry(&init_task_group, &rq->rt, NULL, i, 1, NULL);
7810 for (j = 0; j < CPU_LOAD_IDX_MAX; j++)
7811 rq->cpu_load[j] = 0;
7813 rq->last_load_update_tick = jiffies;
7818 rq->cpu_power = SCHED_LOAD_SCALE;
7819 rq->post_schedule = 0;
7820 rq->active_balance = 0;
7821 rq->next_balance = jiffies;
7826 rq->avg_idle = 2*sysctl_sched_migration_cost;
7827 rq_attach_root(rq, &def_root_domain);
7829 rq->nohz_balance_kick = 0;
7830 init_sched_softirq_csd(&per_cpu(remote_sched_softirq_cb, i));
7834 atomic_set(&rq->nr_iowait, 0);
7837 set_load_weight(&init_task);
7839 #ifdef CONFIG_PREEMPT_NOTIFIERS
7840 INIT_HLIST_HEAD(&init_task.preempt_notifiers);
7844 open_softirq(SCHED_SOFTIRQ, run_rebalance_domains);
7847 #ifdef CONFIG_RT_MUTEXES
7848 plist_head_init_raw(&init_task.pi_waiters, &init_task.pi_lock);
7852 * The boot idle thread does lazy MMU switching as well:
7854 atomic_inc(&init_mm.mm_count);
7855 enter_lazy_tlb(&init_mm, current);
7858 * Make us the idle thread. Technically, schedule() should not be
7859 * called from this thread, however somewhere below it might be,
7860 * but because we are the idle thread, we just pick up running again
7861 * when this runqueue becomes "idle".
7863 init_idle(current, smp_processor_id());
7865 calc_load_update = jiffies + LOAD_FREQ;
7868 * During early bootup we pretend to be a normal task:
7870 current->sched_class = &fair_sched_class;
7872 /* Allocate the nohz_cpu_mask if CONFIG_CPUMASK_OFFSTACK */
7873 zalloc_cpumask_var(&nohz_cpu_mask, GFP_NOWAIT);
7876 zalloc_cpumask_var(&nohz.idle_cpus_mask, GFP_NOWAIT);
7877 alloc_cpumask_var(&nohz.grp_idle_mask, GFP_NOWAIT);
7878 atomic_set(&nohz.load_balancer, nr_cpu_ids);
7879 atomic_set(&nohz.first_pick_cpu, nr_cpu_ids);
7880 atomic_set(&nohz.second_pick_cpu, nr_cpu_ids);
7882 /* May be allocated at isolcpus cmdline parse time */
7883 if (cpu_isolated_map == NULL)
7884 zalloc_cpumask_var(&cpu_isolated_map, GFP_NOWAIT);
7889 scheduler_running = 1;
7892 #ifdef CONFIG_DEBUG_SPINLOCK_SLEEP
7893 static inline int preempt_count_equals(int preempt_offset)
7895 int nested = (preempt_count() & ~PREEMPT_ACTIVE) + rcu_preempt_depth();
7897 return (nested == PREEMPT_INATOMIC_BASE + preempt_offset);
7900 static int __might_sleep_init_called;
7901 int __init __might_sleep_init(void)
7903 __might_sleep_init_called = 1;
7906 early_initcall(__might_sleep_init);
7908 void __might_sleep(const char *file, int line, int preempt_offset)
7911 static unsigned long prev_jiffy; /* ratelimiting */
7913 if ((preempt_count_equals(preempt_offset) && !irqs_disabled()) ||
7916 if (system_state != SYSTEM_RUNNING &&
7917 (!__might_sleep_init_called || system_state != SYSTEM_BOOTING))
7919 if (time_before(jiffies, prev_jiffy + HZ) && prev_jiffy)
7921 prev_jiffy = jiffies;
7924 "BUG: sleeping function called from invalid context at %s:%d\n",
7927 "in_atomic(): %d, irqs_disabled(): %d, pid: %d, name: %s\n",
7928 in_atomic(), irqs_disabled(),
7929 current->pid, current->comm);
7931 debug_show_held_locks(current);
7932 if (irqs_disabled())
7933 print_irqtrace_events(current);
7937 EXPORT_SYMBOL(__might_sleep);
7940 #ifdef CONFIG_MAGIC_SYSRQ
7941 static void normalize_task(struct rq *rq, struct task_struct *p)
7945 on_rq = p->se.on_rq;
7947 deactivate_task(rq, p, 0);
7948 __setscheduler(rq, p, SCHED_NORMAL, 0);
7950 activate_task(rq, p, 0);
7951 resched_task(rq->curr);
7955 void normalize_rt_tasks(void)
7957 struct task_struct *g, *p;
7958 unsigned long flags;
7961 read_lock_irqsave(&tasklist_lock, flags);
7962 do_each_thread(g, p) {
7964 * Only normalize user tasks:
7969 p->se.exec_start = 0;
7970 #ifdef CONFIG_SCHEDSTATS
7971 p->se.statistics.wait_start = 0;
7972 p->se.statistics.sleep_start = 0;
7973 p->se.statistics.block_start = 0;
7978 * Renice negative nice level userspace
7981 if (TASK_NICE(p) < 0 && p->mm)
7982 set_user_nice(p, 0);
7986 raw_spin_lock(&p->pi_lock);
7987 rq = __task_rq_lock(p);
7989 normalize_task(rq, p);
7991 __task_rq_unlock(rq);
7992 raw_spin_unlock(&p->pi_lock);
7993 } while_each_thread(g, p);
7995 read_unlock_irqrestore(&tasklist_lock, flags);
7998 #endif /* CONFIG_MAGIC_SYSRQ */
8000 #if defined(CONFIG_IA64) || defined(CONFIG_KGDB_KDB)
8002 * These functions are only useful for the IA64 MCA handling, or kdb.
8004 * They can only be called when the whole system has been
8005 * stopped - every CPU needs to be quiescent, and no scheduling
8006 * activity can take place. Using them for anything else would
8007 * be a serious bug, and as a result, they aren't even visible
8008 * under any other configuration.
8012 * curr_task - return the current task for a given cpu.
8013 * @cpu: the processor in question.
8015 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
8017 struct task_struct *curr_task(int cpu)
8019 return cpu_curr(cpu);
8022 #endif /* defined(CONFIG_IA64) || defined(CONFIG_KGDB_KDB) */
8026 * set_curr_task - set the current task for a given cpu.
8027 * @cpu: the processor in question.
8028 * @p: the task pointer to set.
8030 * Description: This function must only be used when non-maskable interrupts
8031 * are serviced on a separate stack. It allows the architecture to switch the
8032 * notion of the current task on a cpu in a non-blocking manner. This function
8033 * must be called with all CPU's synchronized, and interrupts disabled, the
8034 * and caller must save the original value of the current task (see
8035 * curr_task() above) and restore that value before reenabling interrupts and
8036 * re-starting the system.
8038 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
8040 void set_curr_task(int cpu, struct task_struct *p)
8047 #ifdef CONFIG_FAIR_GROUP_SCHED
8048 static void free_fair_sched_group(struct task_group *tg)
8052 for_each_possible_cpu(i) {
8054 kfree(tg->cfs_rq[i]);
8064 int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent)
8066 struct cfs_rq *cfs_rq;
8067 struct sched_entity *se;
8071 tg->cfs_rq = kzalloc(sizeof(cfs_rq) * nr_cpu_ids, GFP_KERNEL);
8074 tg->se = kzalloc(sizeof(se) * nr_cpu_ids, GFP_KERNEL);
8078 tg->shares = NICE_0_LOAD;
8080 for_each_possible_cpu(i) {
8083 cfs_rq = kzalloc_node(sizeof(struct cfs_rq),
8084 GFP_KERNEL, cpu_to_node(i));
8088 se = kzalloc_node(sizeof(struct sched_entity),
8089 GFP_KERNEL, cpu_to_node(i));
8093 init_tg_cfs_entry(tg, cfs_rq, se, i, 0, parent->se[i]);
8104 static inline void register_fair_sched_group(struct task_group *tg, int cpu)
8106 list_add_rcu(&tg->cfs_rq[cpu]->leaf_cfs_rq_list,
8107 &cpu_rq(cpu)->leaf_cfs_rq_list);
8110 static inline void unregister_fair_sched_group(struct task_group *tg, int cpu)
8112 list_del_rcu(&tg->cfs_rq[cpu]->leaf_cfs_rq_list);
8114 #else /* !CONFG_FAIR_GROUP_SCHED */
8115 static inline void free_fair_sched_group(struct task_group *tg)
8120 int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent)
8125 static inline void register_fair_sched_group(struct task_group *tg, int cpu)
8129 static inline void unregister_fair_sched_group(struct task_group *tg, int cpu)
8132 #endif /* CONFIG_FAIR_GROUP_SCHED */
8134 #ifdef CONFIG_RT_GROUP_SCHED
8135 static void free_rt_sched_group(struct task_group *tg)
8139 destroy_rt_bandwidth(&tg->rt_bandwidth);
8141 for_each_possible_cpu(i) {
8143 kfree(tg->rt_rq[i]);
8145 kfree(tg->rt_se[i]);
8153 int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent)
8155 struct rt_rq *rt_rq;
8156 struct sched_rt_entity *rt_se;
8160 tg->rt_rq = kzalloc(sizeof(rt_rq) * nr_cpu_ids, GFP_KERNEL);
8163 tg->rt_se = kzalloc(sizeof(rt_se) * nr_cpu_ids, GFP_KERNEL);
8167 init_rt_bandwidth(&tg->rt_bandwidth,
8168 ktime_to_ns(def_rt_bandwidth.rt_period), 0);
8170 for_each_possible_cpu(i) {
8173 rt_rq = kzalloc_node(sizeof(struct rt_rq),
8174 GFP_KERNEL, cpu_to_node(i));
8178 rt_se = kzalloc_node(sizeof(struct sched_rt_entity),
8179 GFP_KERNEL, cpu_to_node(i));
8183 init_tg_rt_entry(tg, rt_rq, rt_se, i, 0, parent->rt_se[i]);
8194 static inline void register_rt_sched_group(struct task_group *tg, int cpu)
8196 list_add_rcu(&tg->rt_rq[cpu]->leaf_rt_rq_list,
8197 &cpu_rq(cpu)->leaf_rt_rq_list);
8200 static inline void unregister_rt_sched_group(struct task_group *tg, int cpu)
8202 list_del_rcu(&tg->rt_rq[cpu]->leaf_rt_rq_list);
8204 #else /* !CONFIG_RT_GROUP_SCHED */
8205 static inline void free_rt_sched_group(struct task_group *tg)
8210 int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent)
8215 static inline void register_rt_sched_group(struct task_group *tg, int cpu)
8219 static inline void unregister_rt_sched_group(struct task_group *tg, int cpu)
8222 #endif /* CONFIG_RT_GROUP_SCHED */
8224 #ifdef CONFIG_CGROUP_SCHED
8225 static void free_sched_group(struct task_group *tg)
8227 free_fair_sched_group(tg);
8228 free_rt_sched_group(tg);
8232 /* allocate runqueue etc for a new task group */
8233 struct task_group *sched_create_group(struct task_group *parent)
8235 struct task_group *tg;
8236 unsigned long flags;
8239 tg = kzalloc(sizeof(*tg), GFP_KERNEL);
8241 return ERR_PTR(-ENOMEM);
8243 if (!alloc_fair_sched_group(tg, parent))
8246 if (!alloc_rt_sched_group(tg, parent))
8249 spin_lock_irqsave(&task_group_lock, flags);
8250 for_each_possible_cpu(i) {
8251 register_fair_sched_group(tg, i);
8252 register_rt_sched_group(tg, i);
8254 list_add_rcu(&tg->list, &task_groups);
8256 WARN_ON(!parent); /* root should already exist */
8258 tg->parent = parent;
8259 INIT_LIST_HEAD(&tg->children);
8260 list_add_rcu(&tg->siblings, &parent->children);
8261 spin_unlock_irqrestore(&task_group_lock, flags);
8266 free_sched_group(tg);
8267 return ERR_PTR(-ENOMEM);
8270 /* rcu callback to free various structures associated with a task group */
8271 static void free_sched_group_rcu(struct rcu_head *rhp)
8273 /* now it should be safe to free those cfs_rqs */
8274 free_sched_group(container_of(rhp, struct task_group, rcu));
8277 /* Destroy runqueue etc associated with a task group */
8278 void sched_destroy_group(struct task_group *tg)
8280 unsigned long flags;
8283 spin_lock_irqsave(&task_group_lock, flags);
8284 for_each_possible_cpu(i) {
8285 unregister_fair_sched_group(tg, i);
8286 unregister_rt_sched_group(tg, i);
8288 list_del_rcu(&tg->list);
8289 list_del_rcu(&tg->siblings);
8290 spin_unlock_irqrestore(&task_group_lock, flags);
8292 /* wait for possible concurrent references to cfs_rqs complete */
8293 call_rcu(&tg->rcu, free_sched_group_rcu);
8296 /* change task's runqueue when it moves between groups.
8297 * The caller of this function should have put the task in its new group
8298 * by now. This function just updates tsk->se.cfs_rq and tsk->se.parent to
8299 * reflect its new group.
8301 void sched_move_task(struct task_struct *tsk)
8304 unsigned long flags;
8307 rq = task_rq_lock(tsk, &flags);
8309 running = task_current(rq, tsk);
8310 on_rq = tsk->se.on_rq;
8313 dequeue_task(rq, tsk, 0);
8314 if (unlikely(running))
8315 tsk->sched_class->put_prev_task(rq, tsk);
8317 #ifdef CONFIG_FAIR_GROUP_SCHED
8318 if (tsk->sched_class->prep_move_group)
8319 tsk->sched_class->prep_move_group(tsk, on_rq);
8322 set_task_rq(tsk, task_cpu(tsk));
8324 #ifdef CONFIG_FAIR_GROUP_SCHED
8325 if (tsk->sched_class->moved_group)
8326 tsk->sched_class->moved_group(tsk, on_rq);
8329 if (unlikely(running))
8330 tsk->sched_class->set_curr_task(rq);
8332 enqueue_task(rq, tsk, 0);
8334 task_rq_unlock(rq, &flags);
8336 #endif /* CONFIG_CGROUP_SCHED */
8338 #ifdef CONFIG_FAIR_GROUP_SCHED
8339 static void __set_se_shares(struct sched_entity *se, unsigned long shares)
8341 struct cfs_rq *cfs_rq = se->cfs_rq;
8346 dequeue_entity(cfs_rq, se, 0);
8348 se->load.weight = shares;
8349 se->load.inv_weight = 0;
8352 enqueue_entity(cfs_rq, se, 0);
8355 static void set_se_shares(struct sched_entity *se, unsigned long shares)
8357 struct cfs_rq *cfs_rq = se->cfs_rq;
8358 struct rq *rq = cfs_rq->rq;
8359 unsigned long flags;
8361 raw_spin_lock_irqsave(&rq->lock, flags);
8362 __set_se_shares(se, shares);
8363 raw_spin_unlock_irqrestore(&rq->lock, flags);
8366 static DEFINE_MUTEX(shares_mutex);
8368 int sched_group_set_shares(struct task_group *tg, unsigned long shares)
8371 unsigned long flags;
8374 * We can't change the weight of the root cgroup.
8379 if (shares < MIN_SHARES)
8380 shares = MIN_SHARES;
8381 else if (shares > MAX_SHARES)
8382 shares = MAX_SHARES;
8384 mutex_lock(&shares_mutex);
8385 if (tg->shares == shares)
8388 spin_lock_irqsave(&task_group_lock, flags);
8389 for_each_possible_cpu(i)
8390 unregister_fair_sched_group(tg, i);
8391 list_del_rcu(&tg->siblings);
8392 spin_unlock_irqrestore(&task_group_lock, flags);
8394 /* wait for any ongoing reference to this group to finish */
8395 synchronize_sched();
8398 * Now we are free to modify the group's share on each cpu
8399 * w/o tripping rebalance_share or load_balance_fair.
8401 tg->shares = shares;
8402 for_each_possible_cpu(i) {
8406 cfs_rq_set_shares(tg->cfs_rq[i], 0);
8407 set_se_shares(tg->se[i], shares);
8411 * Enable load balance activity on this group, by inserting it back on
8412 * each cpu's rq->leaf_cfs_rq_list.
8414 spin_lock_irqsave(&task_group_lock, flags);
8415 for_each_possible_cpu(i)
8416 register_fair_sched_group(tg, i);
8417 list_add_rcu(&tg->siblings, &tg->parent->children);
8418 spin_unlock_irqrestore(&task_group_lock, flags);
8420 mutex_unlock(&shares_mutex);
8424 unsigned long sched_group_shares(struct task_group *tg)
8430 #ifdef CONFIG_RT_GROUP_SCHED
8432 * Ensure that the real time constraints are schedulable.
8434 static DEFINE_MUTEX(rt_constraints_mutex);
8436 static unsigned long to_ratio(u64 period, u64 runtime)
8438 if (runtime == RUNTIME_INF)
8441 return div64_u64(runtime << 20, period);
8444 /* Must be called with tasklist_lock held */
8445 static inline int tg_has_rt_tasks(struct task_group *tg)
8447 struct task_struct *g, *p;
8449 do_each_thread(g, p) {
8450 if (rt_task(p) && rt_rq_of_se(&p->rt)->tg == tg)
8452 } while_each_thread(g, p);
8457 struct rt_schedulable_data {
8458 struct task_group *tg;
8463 static int tg_schedulable(struct task_group *tg, void *data)
8465 struct rt_schedulable_data *d = data;
8466 struct task_group *child;
8467 unsigned long total, sum = 0;
8468 u64 period, runtime;
8470 period = ktime_to_ns(tg->rt_bandwidth.rt_period);
8471 runtime = tg->rt_bandwidth.rt_runtime;
8474 period = d->rt_period;
8475 runtime = d->rt_runtime;
8479 * Cannot have more runtime than the period.
8481 if (runtime > period && runtime != RUNTIME_INF)
8485 * Ensure we don't starve existing RT tasks.
8487 if (rt_bandwidth_enabled() && !runtime && tg_has_rt_tasks(tg))
8490 total = to_ratio(period, runtime);
8493 * Nobody can have more than the global setting allows.
8495 if (total > to_ratio(global_rt_period(), global_rt_runtime()))
8499 * The sum of our children's runtime should not exceed our own.
8501 list_for_each_entry_rcu(child, &tg->children, siblings) {
8502 period = ktime_to_ns(child->rt_bandwidth.rt_period);
8503 runtime = child->rt_bandwidth.rt_runtime;
8505 if (child == d->tg) {
8506 period = d->rt_period;
8507 runtime = d->rt_runtime;
8510 sum += to_ratio(period, runtime);
8519 static int __rt_schedulable(struct task_group *tg, u64 period, u64 runtime)
8521 struct rt_schedulable_data data = {
8523 .rt_period = period,
8524 .rt_runtime = runtime,
8527 return walk_tg_tree(tg_schedulable, tg_nop, &data);
8530 static int tg_set_bandwidth(struct task_group *tg,
8531 u64 rt_period, u64 rt_runtime)
8535 mutex_lock(&rt_constraints_mutex);
8536 read_lock(&tasklist_lock);
8537 err = __rt_schedulable(tg, rt_period, rt_runtime);
8541 raw_spin_lock_irq(&tg->rt_bandwidth.rt_runtime_lock);
8542 tg->rt_bandwidth.rt_period = ns_to_ktime(rt_period);
8543 tg->rt_bandwidth.rt_runtime = rt_runtime;
8545 for_each_possible_cpu(i) {
8546 struct rt_rq *rt_rq = tg->rt_rq[i];
8548 raw_spin_lock(&rt_rq->rt_runtime_lock);
8549 rt_rq->rt_runtime = rt_runtime;
8550 raw_spin_unlock(&rt_rq->rt_runtime_lock);
8552 raw_spin_unlock_irq(&tg->rt_bandwidth.rt_runtime_lock);
8554 read_unlock(&tasklist_lock);
8555 mutex_unlock(&rt_constraints_mutex);
8560 int sched_group_set_rt_runtime(struct task_group *tg, long rt_runtime_us)
8562 u64 rt_runtime, rt_period;
8564 rt_period = ktime_to_ns(tg->rt_bandwidth.rt_period);
8565 rt_runtime = (u64)rt_runtime_us * NSEC_PER_USEC;
8566 if (rt_runtime_us < 0)
8567 rt_runtime = RUNTIME_INF;
8569 return tg_set_bandwidth(tg, rt_period, rt_runtime);
8572 long sched_group_rt_runtime(struct task_group *tg)
8576 if (tg->rt_bandwidth.rt_runtime == RUNTIME_INF)
8579 rt_runtime_us = tg->rt_bandwidth.rt_runtime;
8580 do_div(rt_runtime_us, NSEC_PER_USEC);
8581 return rt_runtime_us;
8584 int sched_group_set_rt_period(struct task_group *tg, long rt_period_us)
8586 u64 rt_runtime, rt_period;
8588 rt_period = (u64)rt_period_us * NSEC_PER_USEC;
8589 rt_runtime = tg->rt_bandwidth.rt_runtime;
8594 return tg_set_bandwidth(tg, rt_period, rt_runtime);
8597 long sched_group_rt_period(struct task_group *tg)
8601 rt_period_us = ktime_to_ns(tg->rt_bandwidth.rt_period);
8602 do_div(rt_period_us, NSEC_PER_USEC);
8603 return rt_period_us;
8606 static int sched_rt_global_constraints(void)
8608 u64 runtime, period;
8611 if (sysctl_sched_rt_period <= 0)
8614 runtime = global_rt_runtime();
8615 period = global_rt_period();
8618 * Sanity check on the sysctl variables.
8620 if (runtime > period && runtime != RUNTIME_INF)
8623 mutex_lock(&rt_constraints_mutex);
8624 read_lock(&tasklist_lock);
8625 ret = __rt_schedulable(NULL, 0, 0);
8626 read_unlock(&tasklist_lock);
8627 mutex_unlock(&rt_constraints_mutex);
8632 int sched_rt_can_attach(struct task_group *tg, struct task_struct *tsk)
8634 /* Don't accept realtime tasks when there is no way for them to run */
8635 if (rt_task(tsk) && tg->rt_bandwidth.rt_runtime == 0)
8641 #else /* !CONFIG_RT_GROUP_SCHED */
8642 static int sched_rt_global_constraints(void)
8644 unsigned long flags;
8647 if (sysctl_sched_rt_period <= 0)
8651 * There's always some RT tasks in the root group
8652 * -- migration, kstopmachine etc..
8654 if (sysctl_sched_rt_runtime == 0)
8657 raw_spin_lock_irqsave(&def_rt_bandwidth.rt_runtime_lock, flags);
8658 for_each_possible_cpu(i) {
8659 struct rt_rq *rt_rq = &cpu_rq(i)->rt;
8661 raw_spin_lock(&rt_rq->rt_runtime_lock);
8662 rt_rq->rt_runtime = global_rt_runtime();
8663 raw_spin_unlock(&rt_rq->rt_runtime_lock);
8665 raw_spin_unlock_irqrestore(&def_rt_bandwidth.rt_runtime_lock, flags);
8669 #endif /* CONFIG_RT_GROUP_SCHED */
8671 int sched_rt_handler(struct ctl_table *table, int write,
8672 void __user *buffer, size_t *lenp,
8676 int old_period, old_runtime;
8677 static DEFINE_MUTEX(mutex);
8680 old_period = sysctl_sched_rt_period;
8681 old_runtime = sysctl_sched_rt_runtime;
8683 ret = proc_dointvec(table, write, buffer, lenp, ppos);
8685 if (!ret && write) {
8686 ret = sched_rt_global_constraints();
8688 sysctl_sched_rt_period = old_period;
8689 sysctl_sched_rt_runtime = old_runtime;
8691 def_rt_bandwidth.rt_runtime = global_rt_runtime();
8692 def_rt_bandwidth.rt_period =
8693 ns_to_ktime(global_rt_period());
8696 mutex_unlock(&mutex);
8701 #ifdef CONFIG_CGROUP_SCHED
8703 /* return corresponding task_group object of a cgroup */
8704 static inline struct task_group *cgroup_tg(struct cgroup *cgrp)
8706 return container_of(cgroup_subsys_state(cgrp, cpu_cgroup_subsys_id),
8707 struct task_group, css);
8710 static struct cgroup_subsys_state *
8711 cpu_cgroup_create(struct cgroup_subsys *ss, struct cgroup *cgrp)
8713 struct task_group *tg, *parent;
8715 if (!cgrp->parent) {
8716 /* This is early initialization for the top cgroup */
8717 return &init_task_group.css;
8720 parent = cgroup_tg(cgrp->parent);
8721 tg = sched_create_group(parent);
8723 return ERR_PTR(-ENOMEM);
8729 cpu_cgroup_destroy(struct cgroup_subsys *ss, struct cgroup *cgrp)
8731 struct task_group *tg = cgroup_tg(cgrp);
8733 sched_destroy_group(tg);
8737 cpu_cgroup_can_attach_task(struct cgroup *cgrp, struct task_struct *tsk)
8739 if ((current != tsk) && (!capable(CAP_SYS_NICE))) {
8740 const struct cred *cred = current_cred(), *tcred;
8742 tcred = __task_cred(tsk);
8744 if (cred->euid != tcred->uid && cred->euid != tcred->suid)
8748 #ifdef CONFIG_RT_GROUP_SCHED
8749 if (!sched_rt_can_attach(cgroup_tg(cgrp), tsk))
8752 /* We don't support RT-tasks being in separate groups */
8753 if (tsk->sched_class != &fair_sched_class)
8760 cpu_cgroup_can_attach(struct cgroup_subsys *ss, struct cgroup *cgrp,
8761 struct task_struct *tsk, bool threadgroup)
8763 int retval = cpu_cgroup_can_attach_task(cgrp, tsk);
8767 struct task_struct *c;
8769 list_for_each_entry_rcu(c, &tsk->thread_group, thread_group) {
8770 retval = cpu_cgroup_can_attach_task(cgrp, c);
8782 cpu_cgroup_attach(struct cgroup_subsys *ss, struct cgroup *cgrp,
8783 struct cgroup *old_cont, struct task_struct *tsk,
8786 sched_move_task(tsk);
8788 struct task_struct *c;
8790 list_for_each_entry_rcu(c, &tsk->thread_group, thread_group) {
8797 #ifdef CONFIG_FAIR_GROUP_SCHED
8798 static int cpu_shares_write_u64(struct cgroup *cgrp, struct cftype *cftype,
8801 return sched_group_set_shares(cgroup_tg(cgrp), shareval);
8804 static u64 cpu_shares_read_u64(struct cgroup *cgrp, struct cftype *cft)
8806 struct task_group *tg = cgroup_tg(cgrp);
8808 return (u64) tg->shares;
8810 #endif /* CONFIG_FAIR_GROUP_SCHED */
8812 #ifdef CONFIG_RT_GROUP_SCHED
8813 static int cpu_rt_runtime_write(struct cgroup *cgrp, struct cftype *cft,
8816 return sched_group_set_rt_runtime(cgroup_tg(cgrp), val);
8819 static s64 cpu_rt_runtime_read(struct cgroup *cgrp, struct cftype *cft)
8821 return sched_group_rt_runtime(cgroup_tg(cgrp));
8824 static int cpu_rt_period_write_uint(struct cgroup *cgrp, struct cftype *cftype,
8827 return sched_group_set_rt_period(cgroup_tg(cgrp), rt_period_us);
8830 static u64 cpu_rt_period_read_uint(struct cgroup *cgrp, struct cftype *cft)
8832 return sched_group_rt_period(cgroup_tg(cgrp));
8834 #endif /* CONFIG_RT_GROUP_SCHED */
8836 static struct cftype cpu_files[] = {
8837 #ifdef CONFIG_FAIR_GROUP_SCHED
8840 .read_u64 = cpu_shares_read_u64,
8841 .write_u64 = cpu_shares_write_u64,
8844 #ifdef CONFIG_RT_GROUP_SCHED
8846 .name = "rt_runtime_us",
8847 .read_s64 = cpu_rt_runtime_read,
8848 .write_s64 = cpu_rt_runtime_write,
8851 .name = "rt_period_us",
8852 .read_u64 = cpu_rt_period_read_uint,
8853 .write_u64 = cpu_rt_period_write_uint,
8858 static int cpu_cgroup_populate(struct cgroup_subsys *ss, struct cgroup *cont)
8860 return cgroup_add_files(cont, ss, cpu_files, ARRAY_SIZE(cpu_files));
8863 struct cgroup_subsys cpu_cgroup_subsys = {
8865 .create = cpu_cgroup_create,
8866 .destroy = cpu_cgroup_destroy,
8867 .can_attach = cpu_cgroup_can_attach,
8868 .attach = cpu_cgroup_attach,
8869 .populate = cpu_cgroup_populate,
8870 .subsys_id = cpu_cgroup_subsys_id,
8874 #endif /* CONFIG_CGROUP_SCHED */
8876 #ifdef CONFIG_CGROUP_CPUACCT
8879 * CPU accounting code for task groups.
8881 * Based on the work by Paul Menage (menage@google.com) and Balbir Singh
8882 * (balbir@in.ibm.com).
8885 /* track cpu usage of a group of tasks and its child groups */
8887 struct cgroup_subsys_state css;
8888 /* cpuusage holds pointer to a u64-type object on every cpu */
8889 u64 __percpu *cpuusage;
8890 struct percpu_counter cpustat[CPUACCT_STAT_NSTATS];
8891 struct cpuacct *parent;
8892 struct cpuacct_charge_calls *cpufreq_fn;
8896 static struct cpuacct *cpuacct_root;
8898 /* Default calls for cpufreq accounting */
8899 static struct cpuacct_charge_calls *cpuacct_cpufreq;
8900 int cpuacct_register_cpufreq(struct cpuacct_charge_calls *fn)
8902 cpuacct_cpufreq = fn;
8905 * Root node is created before platform can register callbacks,
8908 if (cpuacct_root && fn) {
8909 cpuacct_root->cpufreq_fn = fn;
8911 fn->init(&cpuacct_root->cpuacct_data);
8916 struct cgroup_subsys cpuacct_subsys;
8918 /* return cpu accounting group corresponding to this container */
8919 static inline struct cpuacct *cgroup_ca(struct cgroup *cgrp)
8921 return container_of(cgroup_subsys_state(cgrp, cpuacct_subsys_id),
8922 struct cpuacct, css);
8925 /* return cpu accounting group to which this task belongs */
8926 static inline struct cpuacct *task_ca(struct task_struct *tsk)
8928 return container_of(task_subsys_state(tsk, cpuacct_subsys_id),
8929 struct cpuacct, css);
8932 /* create a new cpu accounting group */
8933 static struct cgroup_subsys_state *cpuacct_create(
8934 struct cgroup_subsys *ss, struct cgroup *cgrp)
8936 struct cpuacct *ca = kzalloc(sizeof(*ca), GFP_KERNEL);
8942 ca->cpuusage = alloc_percpu(u64);
8946 for (i = 0; i < CPUACCT_STAT_NSTATS; i++)
8947 if (percpu_counter_init(&ca->cpustat[i], 0))
8948 goto out_free_counters;
8950 ca->cpufreq_fn = cpuacct_cpufreq;
8952 /* If available, have platform code initalize cpu frequency table */
8953 if (ca->cpufreq_fn && ca->cpufreq_fn->init)
8954 ca->cpufreq_fn->init(&ca->cpuacct_data);
8957 ca->parent = cgroup_ca(cgrp->parent);
8965 percpu_counter_destroy(&ca->cpustat[i]);
8966 free_percpu(ca->cpuusage);
8970 return ERR_PTR(-ENOMEM);
8973 /* destroy an existing cpu accounting group */
8975 cpuacct_destroy(struct cgroup_subsys *ss, struct cgroup *cgrp)
8977 struct cpuacct *ca = cgroup_ca(cgrp);
8980 for (i = 0; i < CPUACCT_STAT_NSTATS; i++)
8981 percpu_counter_destroy(&ca->cpustat[i]);
8982 free_percpu(ca->cpuusage);
8986 static u64 cpuacct_cpuusage_read(struct cpuacct *ca, int cpu)
8988 u64 *cpuusage = per_cpu_ptr(ca->cpuusage, cpu);
8991 #ifndef CONFIG_64BIT
8993 * Take rq->lock to make 64-bit read safe on 32-bit platforms.
8995 raw_spin_lock_irq(&cpu_rq(cpu)->lock);
8997 raw_spin_unlock_irq(&cpu_rq(cpu)->lock);
9005 static void cpuacct_cpuusage_write(struct cpuacct *ca, int cpu, u64 val)
9007 u64 *cpuusage = per_cpu_ptr(ca->cpuusage, cpu);
9009 #ifndef CONFIG_64BIT
9011 * Take rq->lock to make 64-bit write safe on 32-bit platforms.
9013 raw_spin_lock_irq(&cpu_rq(cpu)->lock);
9015 raw_spin_unlock_irq(&cpu_rq(cpu)->lock);
9021 /* return total cpu usage (in nanoseconds) of a group */
9022 static u64 cpuusage_read(struct cgroup *cgrp, struct cftype *cft)
9024 struct cpuacct *ca = cgroup_ca(cgrp);
9025 u64 totalcpuusage = 0;
9028 for_each_present_cpu(i)
9029 totalcpuusage += cpuacct_cpuusage_read(ca, i);
9031 return totalcpuusage;
9034 static int cpuusage_write(struct cgroup *cgrp, struct cftype *cftype,
9037 struct cpuacct *ca = cgroup_ca(cgrp);
9046 for_each_present_cpu(i)
9047 cpuacct_cpuusage_write(ca, i, 0);
9053 static int cpuacct_percpu_seq_read(struct cgroup *cgroup, struct cftype *cft,
9056 struct cpuacct *ca = cgroup_ca(cgroup);
9060 for_each_present_cpu(i) {
9061 percpu = cpuacct_cpuusage_read(ca, i);
9062 seq_printf(m, "%llu ", (unsigned long long) percpu);
9064 seq_printf(m, "\n");
9068 static const char *cpuacct_stat_desc[] = {
9069 [CPUACCT_STAT_USER] = "user",
9070 [CPUACCT_STAT_SYSTEM] = "system",
9073 static int cpuacct_stats_show(struct cgroup *cgrp, struct cftype *cft,
9074 struct cgroup_map_cb *cb)
9076 struct cpuacct *ca = cgroup_ca(cgrp);
9079 for (i = 0; i < CPUACCT_STAT_NSTATS; i++) {
9080 s64 val = percpu_counter_read(&ca->cpustat[i]);
9081 val = cputime64_to_clock_t(val);
9082 cb->fill(cb, cpuacct_stat_desc[i], val);
9087 static int cpuacct_cpufreq_show(struct cgroup *cgrp, struct cftype *cft,
9088 struct cgroup_map_cb *cb)
9090 struct cpuacct *ca = cgroup_ca(cgrp);
9091 if (ca->cpufreq_fn && ca->cpufreq_fn->cpufreq_show)
9092 ca->cpufreq_fn->cpufreq_show(ca->cpuacct_data, cb);
9097 /* return total cpu power usage (milliWatt second) of a group */
9098 static u64 cpuacct_powerusage_read(struct cgroup *cgrp, struct cftype *cft)
9101 struct cpuacct *ca = cgroup_ca(cgrp);
9104 if (ca->cpufreq_fn && ca->cpufreq_fn->power_usage)
9105 for_each_present_cpu(i) {
9106 totalpower += ca->cpufreq_fn->power_usage(
9113 static struct cftype files[] = {
9116 .read_u64 = cpuusage_read,
9117 .write_u64 = cpuusage_write,
9120 .name = "usage_percpu",
9121 .read_seq_string = cpuacct_percpu_seq_read,
9125 .read_map = cpuacct_stats_show,
9129 .read_map = cpuacct_cpufreq_show,
9133 .read_u64 = cpuacct_powerusage_read
9137 static int cpuacct_populate(struct cgroup_subsys *ss, struct cgroup *cgrp)
9139 return cgroup_add_files(cgrp, ss, files, ARRAY_SIZE(files));
9143 * charge this task's execution time to its accounting group.
9145 * called with rq->lock held.
9147 static void cpuacct_charge(struct task_struct *tsk, u64 cputime)
9152 if (unlikely(!cpuacct_subsys.active))
9155 cpu = task_cpu(tsk);
9161 for (; ca; ca = ca->parent) {
9162 u64 *cpuusage = per_cpu_ptr(ca->cpuusage, cpu);
9163 *cpuusage += cputime;
9165 /* Call back into platform code to account for CPU speeds */
9166 if (ca->cpufreq_fn && ca->cpufreq_fn->charge)
9167 ca->cpufreq_fn->charge(ca->cpuacct_data, cputime, cpu);
9174 * When CONFIG_VIRT_CPU_ACCOUNTING is enabled one jiffy can be very large
9175 * in cputime_t units. As a result, cpuacct_update_stats calls
9176 * percpu_counter_add with values large enough to always overflow the
9177 * per cpu batch limit causing bad SMP scalability.
9179 * To fix this we scale percpu_counter_batch by cputime_one_jiffy so we
9180 * batch the same amount of time with CONFIG_VIRT_CPU_ACCOUNTING disabled
9181 * and enabled. We cap it at INT_MAX which is the largest allowed batch value.
9184 #define CPUACCT_BATCH \
9185 min_t(long, percpu_counter_batch * cputime_one_jiffy, INT_MAX)
9187 #define CPUACCT_BATCH 0
9191 * Charge the system/user time to the task's accounting group.
9193 static void cpuacct_update_stats(struct task_struct *tsk,
9194 enum cpuacct_stat_index idx, cputime_t val)
9197 int batch = CPUACCT_BATCH;
9199 if (unlikely(!cpuacct_subsys.active))
9206 __percpu_counter_add(&ca->cpustat[idx], val, batch);
9212 struct cgroup_subsys cpuacct_subsys = {
9214 .create = cpuacct_create,
9215 .destroy = cpuacct_destroy,
9216 .populate = cpuacct_populate,
9217 .subsys_id = cpuacct_subsys_id,
9219 #endif /* CONFIG_CGROUP_CPUACCT */
9223 void synchronize_sched_expedited(void)
9227 EXPORT_SYMBOL_GPL(synchronize_sched_expedited);
9229 #else /* #ifndef CONFIG_SMP */
9231 static atomic_t synchronize_sched_expedited_count = ATOMIC_INIT(0);
9233 static int synchronize_sched_expedited_cpu_stop(void *data)
9236 * There must be a full memory barrier on each affected CPU
9237 * between the time that try_stop_cpus() is called and the
9238 * time that it returns.
9240 * In the current initial implementation of cpu_stop, the
9241 * above condition is already met when the control reaches
9242 * this point and the following smp_mb() is not strictly
9243 * necessary. Do smp_mb() anyway for documentation and
9244 * robustness against future implementation changes.
9246 smp_mb(); /* See above comment block. */
9251 * Wait for an rcu-sched grace period to elapse, but use "big hammer"
9252 * approach to force grace period to end quickly. This consumes
9253 * significant time on all CPUs, and is thus not recommended for
9254 * any sort of common-case code.
9256 * Note that it is illegal to call this function while holding any
9257 * lock that is acquired by a CPU-hotplug notifier. Failing to
9258 * observe this restriction will result in deadlock.
9260 void synchronize_sched_expedited(void)
9262 int snap, trycount = 0;
9264 smp_mb(); /* ensure prior mod happens before capturing snap. */
9265 snap = atomic_read(&synchronize_sched_expedited_count) + 1;
9267 while (try_stop_cpus(cpu_online_mask,
9268 synchronize_sched_expedited_cpu_stop,
9271 if (trycount++ < 10)
9272 udelay(trycount * num_online_cpus());
9274 synchronize_sched();
9277 if (atomic_read(&synchronize_sched_expedited_count) - snap > 0) {
9278 smp_mb(); /* ensure test happens before caller kfree */
9283 atomic_inc(&synchronize_sched_expedited_count);
9284 smp_mb__after_atomic_inc(); /* ensure post-GP actions seen after GP. */
9287 EXPORT_SYMBOL_GPL(synchronize_sched_expedited);
9289 #endif /* #else #ifndef CONFIG_SMP */