4 * Kernel scheduler and related syscalls
6 * Copyright (C) 1991-2002 Linus Torvalds
8 * 1996-12-23 Modified by Dave Grothe to fix bugs in semaphores and
9 * make semaphores SMP safe
10 * 1998-11-19 Implemented schedule_timeout() and related stuff
12 * 2002-01-04 New ultra-scalable O(1) scheduler by Ingo Molnar:
13 * hybrid priority-list and round-robin design with
14 * an array-switch method of distributing timeslices
15 * and per-CPU runqueues. Cleanups and useful suggestions
16 * by Davide Libenzi, preemptible kernel bits by Robert Love.
17 * 2003-09-03 Interactivity tuning by Con Kolivas.
18 * 2004-04-02 Scheduler domains code by Nick Piggin
19 * 2007-04-15 Work begun on replacing all interactivity tuning with a
20 * fair scheduling design by Con Kolivas.
21 * 2007-05-05 Load balancing (smp-nice) and other improvements
23 * 2007-05-06 Interactivity improvements to CFS by Mike Galbraith
24 * 2007-07-01 Group scheduling enhancements by Srivatsa Vaddagiri
25 * 2007-11-29 RT balancing improvements by Steven Rostedt, Gregory Haskins,
26 * Thomas Gleixner, Mike Kravetz
30 #include <linux/module.h>
31 #include <linux/nmi.h>
32 #include <linux/init.h>
33 #include <linux/uaccess.h>
34 #include <linux/highmem.h>
35 #include <linux/smp_lock.h>
36 #include <asm/mmu_context.h>
37 #include <linux/interrupt.h>
38 #include <linux/capability.h>
39 #include <linux/completion.h>
40 #include <linux/kernel_stat.h>
41 #include <linux/debug_locks.h>
42 #include <linux/security.h>
43 #include <linux/notifier.h>
44 #include <linux/profile.h>
45 #include <linux/freezer.h>
46 #include <linux/vmalloc.h>
47 #include <linux/blkdev.h>
48 #include <linux/delay.h>
49 #include <linux/pid_namespace.h>
50 #include <linux/smp.h>
51 #include <linux/threads.h>
52 #include <linux/timer.h>
53 #include <linux/rcupdate.h>
54 #include <linux/cpu.h>
55 #include <linux/cpuset.h>
56 #include <linux/percpu.h>
57 #include <linux/kthread.h>
58 #include <linux/seq_file.h>
59 #include <linux/sysctl.h>
60 #include <linux/syscalls.h>
61 #include <linux/times.h>
62 #include <linux/tsacct_kern.h>
63 #include <linux/kprobes.h>
64 #include <linux/delayacct.h>
65 #include <linux/reciprocal_div.h>
66 #include <linux/unistd.h>
67 #include <linux/pagemap.h>
68 #include <linux/hrtimer.h>
69 #include <linux/tick.h>
70 #include <linux/bootmem.h>
73 #include <asm/irq_regs.h>
76 * Scheduler clock - returns current time in nanosec units.
77 * This is default implementation.
78 * Architectures and sub-architectures can override this.
80 unsigned long long __attribute__((weak
)) sched_clock(void)
82 return (unsigned long long)jiffies
* (NSEC_PER_SEC
/ HZ
);
86 * Convert user-nice values [ -20 ... 0 ... 19 ]
87 * to static priority [ MAX_RT_PRIO..MAX_PRIO-1 ],
90 #define NICE_TO_PRIO(nice) (MAX_RT_PRIO + (nice) + 20)
91 #define PRIO_TO_NICE(prio) ((prio) - MAX_RT_PRIO - 20)
92 #define TASK_NICE(p) PRIO_TO_NICE((p)->static_prio)
95 * 'User priority' is the nice value converted to something we
96 * can work with better when scaling various scheduler parameters,
97 * it's a [ 0 ... 39 ] range.
99 #define USER_PRIO(p) ((p)-MAX_RT_PRIO)
100 #define TASK_USER_PRIO(p) USER_PRIO((p)->static_prio)
101 #define MAX_USER_PRIO (USER_PRIO(MAX_PRIO))
104 * Helpers for converting nanosecond timing to jiffy resolution
106 #define NS_TO_JIFFIES(TIME) ((unsigned long)(TIME) / (NSEC_PER_SEC / HZ))
108 #define NICE_0_LOAD SCHED_LOAD_SCALE
109 #define NICE_0_SHIFT SCHED_LOAD_SHIFT
112 * These are the 'tuning knobs' of the scheduler:
114 * default timeslice is 100 msecs (used only for SCHED_RR tasks).
115 * Timeslices get refilled after they expire.
117 #define DEF_TIMESLICE (100 * HZ / 1000)
120 * single value that denotes runtime == period, ie unlimited time.
122 #define RUNTIME_INF ((u64)~0ULL)
126 * Divide a load by a sched group cpu_power : (load / sg->__cpu_power)
127 * Since cpu_power is a 'constant', we can use a reciprocal divide.
129 static inline u32
sg_div_cpu_power(const struct sched_group
*sg
, u32 load
)
131 return reciprocal_divide(load
, sg
->reciprocal_cpu_power
);
135 * Each time a sched group cpu_power is changed,
136 * we must compute its reciprocal value
138 static inline void sg_inc_cpu_power(struct sched_group
*sg
, u32 val
)
140 sg
->__cpu_power
+= val
;
141 sg
->reciprocal_cpu_power
= reciprocal_value(sg
->__cpu_power
);
145 static inline int rt_policy(int policy
)
147 if (unlikely(policy
== SCHED_FIFO
) || unlikely(policy
== SCHED_RR
))
152 static inline int task_has_rt_policy(struct task_struct
*p
)
154 return rt_policy(p
->policy
);
158 * This is the priority-queue data structure of the RT scheduling class:
160 struct rt_prio_array
{
161 DECLARE_BITMAP(bitmap
, MAX_RT_PRIO
+1); /* include 1 bit for delimiter */
162 struct list_head queue
[MAX_RT_PRIO
];
165 struct rt_bandwidth
{
168 spinlock_t rt_runtime_lock
;
169 struct hrtimer rt_period_timer
;
172 static struct rt_bandwidth def_rt_bandwidth
;
174 static int do_sched_rt_period_timer(struct rt_bandwidth
*rt_b
, int overrun
);
176 static enum hrtimer_restart
sched_rt_period_timer(struct hrtimer
*timer
)
178 struct rt_bandwidth
*rt_b
=
179 container_of(timer
, struct rt_bandwidth
, rt_period_timer
);
185 now
= hrtimer_cb_get_time(timer
);
186 overrun
= hrtimer_forward(timer
, now
, rt_b
->rt_period
);
191 idle
= do_sched_rt_period_timer(rt_b
, overrun
);
194 return idle
? HRTIMER_NORESTART
: HRTIMER_RESTART
;
198 void init_rt_bandwidth(struct rt_bandwidth
*rt_b
, u64 period
, u64 runtime
)
200 rt_b
->rt_period
= ns_to_ktime(period
);
201 rt_b
->rt_runtime
= runtime
;
203 spin_lock_init(&rt_b
->rt_runtime_lock
);
205 hrtimer_init(&rt_b
->rt_period_timer
,
206 CLOCK_MONOTONIC
, HRTIMER_MODE_REL
);
207 rt_b
->rt_period_timer
.function
= sched_rt_period_timer
;
208 rt_b
->rt_period_timer
.cb_mode
= HRTIMER_CB_IRQSAFE_NO_SOFTIRQ
;
211 static void start_rt_bandwidth(struct rt_bandwidth
*rt_b
)
215 if (rt_b
->rt_runtime
== RUNTIME_INF
)
218 if (hrtimer_active(&rt_b
->rt_period_timer
))
221 spin_lock(&rt_b
->rt_runtime_lock
);
223 if (hrtimer_active(&rt_b
->rt_period_timer
))
226 now
= hrtimer_cb_get_time(&rt_b
->rt_period_timer
);
227 hrtimer_forward(&rt_b
->rt_period_timer
, now
, rt_b
->rt_period
);
228 hrtimer_start(&rt_b
->rt_period_timer
,
229 rt_b
->rt_period_timer
.expires
,
232 spin_unlock(&rt_b
->rt_runtime_lock
);
235 #ifdef CONFIG_RT_GROUP_SCHED
236 static void destroy_rt_bandwidth(struct rt_bandwidth
*rt_b
)
238 hrtimer_cancel(&rt_b
->rt_period_timer
);
242 #ifdef CONFIG_GROUP_SCHED
244 #include <linux/cgroup.h>
248 static LIST_HEAD(task_groups
);
250 /* task group related information */
252 #ifdef CONFIG_CGROUP_SCHED
253 struct cgroup_subsys_state css
;
256 #ifdef CONFIG_FAIR_GROUP_SCHED
257 /* schedulable entities of this group on each cpu */
258 struct sched_entity
**se
;
259 /* runqueue "owned" by this group on each cpu */
260 struct cfs_rq
**cfs_rq
;
261 unsigned long shares
;
264 #ifdef CONFIG_RT_GROUP_SCHED
265 struct sched_rt_entity
**rt_se
;
266 struct rt_rq
**rt_rq
;
268 struct rt_bandwidth rt_bandwidth
;
272 struct list_head list
;
275 #ifdef CONFIG_FAIR_GROUP_SCHED
276 /* Default task group's sched entity on each cpu */
277 static DEFINE_PER_CPU(struct sched_entity
, init_sched_entity
);
278 /* Default task group's cfs_rq on each cpu */
279 static DEFINE_PER_CPU(struct cfs_rq
, init_cfs_rq
) ____cacheline_aligned_in_smp
;
282 #ifdef CONFIG_RT_GROUP_SCHED
283 static DEFINE_PER_CPU(struct sched_rt_entity
, init_sched_rt_entity
);
284 static DEFINE_PER_CPU(struct rt_rq
, init_rt_rq
) ____cacheline_aligned_in_smp
;
287 /* task_group_lock serializes add/remove of task groups and also changes to
288 * a task group's cpu shares.
290 static DEFINE_SPINLOCK(task_group_lock
);
292 /* doms_cur_mutex serializes access to doms_cur[] array */
293 static DEFINE_MUTEX(doms_cur_mutex
);
295 #ifdef CONFIG_FAIR_GROUP_SCHED
296 #ifdef CONFIG_USER_SCHED
297 # define INIT_TASK_GROUP_LOAD (2*NICE_0_LOAD)
299 # define INIT_TASK_GROUP_LOAD NICE_0_LOAD
302 static int init_task_group_load
= INIT_TASK_GROUP_LOAD
;
305 /* Default task group.
306 * Every task in system belong to this group at bootup.
308 struct task_group init_task_group
;
310 /* return group to which a task belongs */
311 static inline struct task_group
*task_group(struct task_struct
*p
)
313 struct task_group
*tg
;
315 #ifdef CONFIG_USER_SCHED
317 #elif defined(CONFIG_CGROUP_SCHED)
318 tg
= container_of(task_subsys_state(p
, cpu_cgroup_subsys_id
),
319 struct task_group
, css
);
321 tg
= &init_task_group
;
326 /* Change a task's cfs_rq and parent entity if it moves across CPUs/groups */
327 static inline void set_task_rq(struct task_struct
*p
, unsigned int cpu
)
329 #ifdef CONFIG_FAIR_GROUP_SCHED
330 p
->se
.cfs_rq
= task_group(p
)->cfs_rq
[cpu
];
331 p
->se
.parent
= task_group(p
)->se
[cpu
];
334 #ifdef CONFIG_RT_GROUP_SCHED
335 p
->rt
.rt_rq
= task_group(p
)->rt_rq
[cpu
];
336 p
->rt
.parent
= task_group(p
)->rt_se
[cpu
];
340 static inline void lock_doms_cur(void)
342 mutex_lock(&doms_cur_mutex
);
345 static inline void unlock_doms_cur(void)
347 mutex_unlock(&doms_cur_mutex
);
352 static inline void set_task_rq(struct task_struct
*p
, unsigned int cpu
) { }
353 static inline void lock_doms_cur(void) { }
354 static inline void unlock_doms_cur(void) { }
356 #endif /* CONFIG_GROUP_SCHED */
358 /* CFS-related fields in a runqueue */
360 struct load_weight load
;
361 unsigned long nr_running
;
366 struct rb_root tasks_timeline
;
367 struct rb_node
*rb_leftmost
;
368 struct rb_node
*rb_load_balance_curr
;
369 /* 'curr' points to currently running entity on this cfs_rq.
370 * It is set to NULL otherwise (i.e when none are currently running).
372 struct sched_entity
*curr
, *next
;
374 unsigned long nr_spread_over
;
376 #ifdef CONFIG_FAIR_GROUP_SCHED
377 struct rq
*rq
; /* cpu runqueue to which this cfs_rq is attached */
380 * leaf cfs_rqs are those that hold tasks (lowest schedulable entity in
381 * a hierarchy). Non-leaf lrqs hold other higher schedulable entities
382 * (like users, containers etc.)
384 * leaf_cfs_rq_list ties together list of leaf cfs_rq's in a cpu. This
385 * list is used during load balance.
387 struct list_head leaf_cfs_rq_list
;
388 struct task_group
*tg
; /* group that "owns" this runqueue */
392 /* Real-Time classes' related field in a runqueue: */
394 struct rt_prio_array active
;
395 unsigned long rt_nr_running
;
396 #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED
397 int highest_prio
; /* highest queued rt task prio */
400 unsigned long rt_nr_migratory
;
406 spinlock_t rt_runtime_lock
;
408 #ifdef CONFIG_RT_GROUP_SCHED
409 unsigned long rt_nr_boosted
;
412 struct list_head leaf_rt_rq_list
;
413 struct task_group
*tg
;
414 struct sched_rt_entity
*rt_se
;
421 * We add the notion of a root-domain which will be used to define per-domain
422 * variables. Each exclusive cpuset essentially defines an island domain by
423 * fully partitioning the member cpus from any other cpuset. Whenever a new
424 * exclusive cpuset is created, we also create and attach a new root-domain
434 * The "RT overload" flag: it gets set if a CPU has more than
435 * one runnable RT task.
442 * By default the system creates a single root-domain with all cpus as
443 * members (mimicking the global state we have today).
445 static struct root_domain def_root_domain
;
450 * This is the main, per-CPU runqueue data structure.
452 * Locking rule: those places that want to lock multiple runqueues
453 * (such as the load balancing or the thread migration code), lock
454 * acquire operations must be ordered by ascending &runqueue.
461 * nr_running and cpu_load should be in the same cacheline because
462 * remote CPUs use both these fields when doing load calculation.
464 unsigned long nr_running
;
465 #define CPU_LOAD_IDX_MAX 5
466 unsigned long cpu_load
[CPU_LOAD_IDX_MAX
];
467 unsigned char idle_at_tick
;
469 unsigned long last_tick_seen
;
470 unsigned char in_nohz_recently
;
472 /* capture load from *all* tasks on this cpu: */
473 struct load_weight load
;
474 unsigned long nr_load_updates
;
480 #ifdef CONFIG_FAIR_GROUP_SCHED
481 /* list of leaf cfs_rq on this cpu: */
482 struct list_head leaf_cfs_rq_list
;
484 #ifdef CONFIG_RT_GROUP_SCHED
485 struct list_head leaf_rt_rq_list
;
489 * This is part of a global counter where only the total sum
490 * over all CPUs matters. A task can increase this counter on
491 * one CPU and if it got migrated afterwards it may decrease
492 * it on another CPU. Always updated under the runqueue lock:
494 unsigned long nr_uninterruptible
;
496 struct task_struct
*curr
, *idle
;
497 unsigned long next_balance
;
498 struct mm_struct
*prev_mm
;
500 u64 clock
, prev_clock_raw
;
503 unsigned int clock_warps
, clock_overflows
, clock_underflows
;
505 unsigned int clock_deep_idle_events
;
511 struct root_domain
*rd
;
512 struct sched_domain
*sd
;
514 /* For active balancing */
517 /* cpu of this runqueue: */
520 struct task_struct
*migration_thread
;
521 struct list_head migration_queue
;
524 #ifdef CONFIG_SCHED_HRTICK
525 unsigned long hrtick_flags
;
526 ktime_t hrtick_expire
;
527 struct hrtimer hrtick_timer
;
530 #ifdef CONFIG_SCHEDSTATS
532 struct sched_info rq_sched_info
;
534 /* sys_sched_yield() stats */
535 unsigned int yld_exp_empty
;
536 unsigned int yld_act_empty
;
537 unsigned int yld_both_empty
;
538 unsigned int yld_count
;
540 /* schedule() stats */
541 unsigned int sched_switch
;
542 unsigned int sched_count
;
543 unsigned int sched_goidle
;
545 /* try_to_wake_up() stats */
546 unsigned int ttwu_count
;
547 unsigned int ttwu_local
;
550 unsigned int bkl_count
;
552 struct lock_class_key rq_lock_key
;
555 static DEFINE_PER_CPU_SHARED_ALIGNED(struct rq
, runqueues
);
557 static inline void check_preempt_curr(struct rq
*rq
, struct task_struct
*p
)
559 rq
->curr
->sched_class
->check_preempt_curr(rq
, p
);
562 static inline int cpu_of(struct rq
*rq
)
572 static inline bool nohz_on(int cpu
)
574 return tick_get_tick_sched(cpu
)->nohz_mode
!= NOHZ_MODE_INACTIVE
;
577 static inline u64
max_skipped_ticks(struct rq
*rq
)
579 return nohz_on(cpu_of(rq
)) ? jiffies
- rq
->last_tick_seen
+ 2 : 1;
582 static inline void update_last_tick_seen(struct rq
*rq
)
584 rq
->last_tick_seen
= jiffies
;
587 static inline u64
max_skipped_ticks(struct rq
*rq
)
592 static inline void update_last_tick_seen(struct rq
*rq
)
598 * Update the per-runqueue clock, as finegrained as the platform can give
599 * us, but without assuming monotonicity, etc.:
601 static void __update_rq_clock(struct rq
*rq
)
603 u64 prev_raw
= rq
->prev_clock_raw
;
604 u64 now
= sched_clock();
605 s64 delta
= now
- prev_raw
;
606 u64 clock
= rq
->clock
;
608 #ifdef CONFIG_SCHED_DEBUG
609 WARN_ON_ONCE(cpu_of(rq
) != smp_processor_id());
612 * Protect against sched_clock() occasionally going backwards:
614 if (unlikely(delta
< 0)) {
619 * Catch too large forward jumps too:
621 u64 max_jump
= max_skipped_ticks(rq
) * TICK_NSEC
;
622 u64 max_time
= rq
->tick_timestamp
+ max_jump
;
624 if (unlikely(clock
+ delta
> max_time
)) {
625 if (clock
< max_time
)
629 rq
->clock_overflows
++;
631 if (unlikely(delta
> rq
->clock_max_delta
))
632 rq
->clock_max_delta
= delta
;
637 rq
->prev_clock_raw
= now
;
641 static void update_rq_clock(struct rq
*rq
)
643 if (likely(smp_processor_id() == cpu_of(rq
)))
644 __update_rq_clock(rq
);
648 * The domain tree (rq->sd) is protected by RCU's quiescent state transition.
649 * See detach_destroy_domains: synchronize_sched for details.
651 * The domain tree of any CPU may only be accessed from within
652 * preempt-disabled sections.
654 #define for_each_domain(cpu, __sd) \
655 for (__sd = rcu_dereference(cpu_rq(cpu)->sd); __sd; __sd = __sd->parent)
657 #define cpu_rq(cpu) (&per_cpu(runqueues, (cpu)))
658 #define this_rq() (&__get_cpu_var(runqueues))
659 #define task_rq(p) cpu_rq(task_cpu(p))
660 #define cpu_curr(cpu) (cpu_rq(cpu)->curr)
663 * Tunables that become constants when CONFIG_SCHED_DEBUG is off:
665 #ifdef CONFIG_SCHED_DEBUG
666 # define const_debug __read_mostly
668 # define const_debug static const
672 * Debugging: various feature bits
675 SCHED_FEAT_NEW_FAIR_SLEEPERS
= 1,
676 SCHED_FEAT_WAKEUP_PREEMPT
= 2,
677 SCHED_FEAT_START_DEBIT
= 4,
678 SCHED_FEAT_AFFINE_WAKEUPS
= 8,
679 SCHED_FEAT_CACHE_HOT_BUDDY
= 16,
680 SCHED_FEAT_SYNC_WAKEUPS
= 32,
681 SCHED_FEAT_HRTICK
= 64,
682 SCHED_FEAT_DOUBLE_TICK
= 128,
685 const_debug
unsigned int sysctl_sched_features
=
686 SCHED_FEAT_NEW_FAIR_SLEEPERS
* 1 |
687 SCHED_FEAT_WAKEUP_PREEMPT
* 1 |
688 SCHED_FEAT_START_DEBIT
* 1 |
689 SCHED_FEAT_AFFINE_WAKEUPS
* 1 |
690 SCHED_FEAT_CACHE_HOT_BUDDY
* 1 |
691 SCHED_FEAT_SYNC_WAKEUPS
* 1 |
692 SCHED_FEAT_HRTICK
* 1 |
693 SCHED_FEAT_DOUBLE_TICK
* 0;
695 #define sched_feat(x) (sysctl_sched_features & SCHED_FEAT_##x)
698 * Number of tasks to iterate in a single balance run.
699 * Limited because this is done with IRQs disabled.
701 const_debug
unsigned int sysctl_sched_nr_migrate
= 32;
704 * period over which we measure -rt task cpu usage in us.
707 unsigned int sysctl_sched_rt_period
= 1000000;
709 static __read_mostly
int scheduler_running
;
712 * part of the period that we allow rt tasks to run in us.
715 int sysctl_sched_rt_runtime
= 950000;
717 static inline u64
global_rt_period(void)
719 return (u64
)sysctl_sched_rt_period
* NSEC_PER_USEC
;
722 static inline u64
global_rt_runtime(void)
724 if (sysctl_sched_rt_period
< 0)
727 return (u64
)sysctl_sched_rt_runtime
* NSEC_PER_USEC
;
730 static const unsigned long long time_sync_thresh
= 100000;
732 static DEFINE_PER_CPU(unsigned long long, time_offset
);
733 static DEFINE_PER_CPU(unsigned long long, prev_cpu_time
);
736 * Global lock which we take every now and then to synchronize
737 * the CPUs time. This method is not warp-safe, but it's good
738 * enough to synchronize slowly diverging time sources and thus
739 * it's good enough for tracing:
741 static DEFINE_SPINLOCK(time_sync_lock
);
742 static unsigned long long prev_global_time
;
744 static unsigned long long __sync_cpu_clock(cycles_t time
, int cpu
)
748 spin_lock_irqsave(&time_sync_lock
, flags
);
750 if (time
< prev_global_time
) {
751 per_cpu(time_offset
, cpu
) += prev_global_time
- time
;
752 time
= prev_global_time
;
754 prev_global_time
= time
;
757 spin_unlock_irqrestore(&time_sync_lock
, flags
);
762 static unsigned long long __cpu_clock(int cpu
)
764 unsigned long long now
;
769 * Only call sched_clock() if the scheduler has already been
770 * initialized (some code might call cpu_clock() very early):
772 if (unlikely(!scheduler_running
))
775 local_irq_save(flags
);
779 local_irq_restore(flags
);
785 * For kernel-internal use: high-speed (but slightly incorrect) per-cpu
786 * clock constructed from sched_clock():
788 unsigned long long cpu_clock(int cpu
)
790 unsigned long long prev_cpu_time
, time
, delta_time
;
792 prev_cpu_time
= per_cpu(prev_cpu_time
, cpu
);
793 time
= __cpu_clock(cpu
) + per_cpu(time_offset
, cpu
);
794 delta_time
= time
-prev_cpu_time
;
796 if (unlikely(delta_time
> time_sync_thresh
))
797 time
= __sync_cpu_clock(time
, cpu
);
801 EXPORT_SYMBOL_GPL(cpu_clock
);
803 #ifndef prepare_arch_switch
804 # define prepare_arch_switch(next) do { } while (0)
806 #ifndef finish_arch_switch
807 # define finish_arch_switch(prev) do { } while (0)
810 static inline int task_current(struct rq
*rq
, struct task_struct
*p
)
812 return rq
->curr
== p
;
815 #ifndef __ARCH_WANT_UNLOCKED_CTXSW
816 static inline int task_running(struct rq
*rq
, struct task_struct
*p
)
818 return task_current(rq
, p
);
821 static inline void prepare_lock_switch(struct rq
*rq
, struct task_struct
*next
)
825 static inline void finish_lock_switch(struct rq
*rq
, struct task_struct
*prev
)
827 #ifdef CONFIG_DEBUG_SPINLOCK
828 /* this is a valid case when another task releases the spinlock */
829 rq
->lock
.owner
= current
;
832 * If we are tracking spinlock dependencies then we have to
833 * fix up the runqueue lock - which gets 'carried over' from
836 spin_acquire(&rq
->lock
.dep_map
, 0, 0, _THIS_IP_
);
838 spin_unlock_irq(&rq
->lock
);
841 #else /* __ARCH_WANT_UNLOCKED_CTXSW */
842 static inline int task_running(struct rq
*rq
, struct task_struct
*p
)
847 return task_current(rq
, p
);
851 static inline void prepare_lock_switch(struct rq
*rq
, struct task_struct
*next
)
855 * We can optimise this out completely for !SMP, because the
856 * SMP rebalancing from interrupt is the only thing that cares
861 #ifdef __ARCH_WANT_INTERRUPTS_ON_CTXSW
862 spin_unlock_irq(&rq
->lock
);
864 spin_unlock(&rq
->lock
);
868 static inline void finish_lock_switch(struct rq
*rq
, struct task_struct
*prev
)
872 * After ->oncpu is cleared, the task can be moved to a different CPU.
873 * We must ensure this doesn't happen until the switch is completely
879 #ifndef __ARCH_WANT_INTERRUPTS_ON_CTXSW
883 #endif /* __ARCH_WANT_UNLOCKED_CTXSW */
886 * __task_rq_lock - lock the runqueue a given task resides on.
887 * Must be called interrupts disabled.
889 static inline struct rq
*__task_rq_lock(struct task_struct
*p
)
893 struct rq
*rq
= task_rq(p
);
894 spin_lock(&rq
->lock
);
895 if (likely(rq
== task_rq(p
)))
897 spin_unlock(&rq
->lock
);
902 * task_rq_lock - lock the runqueue a given task resides on and disable
903 * interrupts. Note the ordering: we can safely lookup the task_rq without
904 * explicitly disabling preemption.
906 static struct rq
*task_rq_lock(struct task_struct
*p
, unsigned long *flags
)
912 local_irq_save(*flags
);
914 spin_lock(&rq
->lock
);
915 if (likely(rq
== task_rq(p
)))
917 spin_unlock_irqrestore(&rq
->lock
, *flags
);
921 static void __task_rq_unlock(struct rq
*rq
)
924 spin_unlock(&rq
->lock
);
927 static inline void task_rq_unlock(struct rq
*rq
, unsigned long *flags
)
930 spin_unlock_irqrestore(&rq
->lock
, *flags
);
934 * this_rq_lock - lock this runqueue and disable interrupts.
936 static struct rq
*this_rq_lock(void)
943 spin_lock(&rq
->lock
);
949 * We are going deep-idle (irqs are disabled):
951 void sched_clock_idle_sleep_event(void)
953 struct rq
*rq
= cpu_rq(smp_processor_id());
955 spin_lock(&rq
->lock
);
956 __update_rq_clock(rq
);
957 spin_unlock(&rq
->lock
);
958 rq
->clock_deep_idle_events
++;
960 EXPORT_SYMBOL_GPL(sched_clock_idle_sleep_event
);
963 * We just idled delta nanoseconds (called with irqs disabled):
965 void sched_clock_idle_wakeup_event(u64 delta_ns
)
967 struct rq
*rq
= cpu_rq(smp_processor_id());
968 u64 now
= sched_clock();
970 rq
->idle_clock
+= delta_ns
;
972 * Override the previous timestamp and ignore all
973 * sched_clock() deltas that occured while we idled,
974 * and use the PM-provided delta_ns to advance the
977 spin_lock(&rq
->lock
);
978 rq
->prev_clock_raw
= now
;
979 rq
->clock
+= delta_ns
;
980 spin_unlock(&rq
->lock
);
981 touch_softlockup_watchdog();
983 EXPORT_SYMBOL_GPL(sched_clock_idle_wakeup_event
);
985 static void __resched_task(struct task_struct
*p
, int tif_bit
);
987 static inline void resched_task(struct task_struct
*p
)
989 __resched_task(p
, TIF_NEED_RESCHED
);
992 #ifdef CONFIG_SCHED_HRTICK
994 * Use HR-timers to deliver accurate preemption points.
996 * Its all a bit involved since we cannot program an hrt while holding the
997 * rq->lock. So what we do is store a state in in rq->hrtick_* and ask for a
1000 * When we get rescheduled we reprogram the hrtick_timer outside of the
1003 static inline void resched_hrt(struct task_struct
*p
)
1005 __resched_task(p
, TIF_HRTICK_RESCHED
);
1008 static inline void resched_rq(struct rq
*rq
)
1010 unsigned long flags
;
1012 spin_lock_irqsave(&rq
->lock
, flags
);
1013 resched_task(rq
->curr
);
1014 spin_unlock_irqrestore(&rq
->lock
, flags
);
1018 HRTICK_SET
, /* re-programm hrtick_timer */
1019 HRTICK_RESET
, /* not a new slice */
1024 * - enabled by features
1025 * - hrtimer is actually high res
1027 static inline int hrtick_enabled(struct rq
*rq
)
1029 if (!sched_feat(HRTICK
))
1031 return hrtimer_is_hres_active(&rq
->hrtick_timer
);
1035 * Called to set the hrtick timer state.
1037 * called with rq->lock held and irqs disabled
1039 static void hrtick_start(struct rq
*rq
, u64 delay
, int reset
)
1041 assert_spin_locked(&rq
->lock
);
1044 * preempt at: now + delay
1047 ktime_add_ns(rq
->hrtick_timer
.base
->get_time(), delay
);
1049 * indicate we need to program the timer
1051 __set_bit(HRTICK_SET
, &rq
->hrtick_flags
);
1053 __set_bit(HRTICK_RESET
, &rq
->hrtick_flags
);
1056 * New slices are called from the schedule path and don't need a
1057 * forced reschedule.
1060 resched_hrt(rq
->curr
);
1063 static void hrtick_clear(struct rq
*rq
)
1065 if (hrtimer_active(&rq
->hrtick_timer
))
1066 hrtimer_cancel(&rq
->hrtick_timer
);
1070 * Update the timer from the possible pending state.
1072 static void hrtick_set(struct rq
*rq
)
1076 unsigned long flags
;
1078 WARN_ON_ONCE(cpu_of(rq
) != smp_processor_id());
1080 spin_lock_irqsave(&rq
->lock
, flags
);
1081 set
= __test_and_clear_bit(HRTICK_SET
, &rq
->hrtick_flags
);
1082 reset
= __test_and_clear_bit(HRTICK_RESET
, &rq
->hrtick_flags
);
1083 time
= rq
->hrtick_expire
;
1084 clear_thread_flag(TIF_HRTICK_RESCHED
);
1085 spin_unlock_irqrestore(&rq
->lock
, flags
);
1088 hrtimer_start(&rq
->hrtick_timer
, time
, HRTIMER_MODE_ABS
);
1089 if (reset
&& !hrtimer_active(&rq
->hrtick_timer
))
1096 * High-resolution timer tick.
1097 * Runs from hardirq context with interrupts disabled.
1099 static enum hrtimer_restart
hrtick(struct hrtimer
*timer
)
1101 struct rq
*rq
= container_of(timer
, struct rq
, hrtick_timer
);
1103 WARN_ON_ONCE(cpu_of(rq
) != smp_processor_id());
1105 spin_lock(&rq
->lock
);
1106 __update_rq_clock(rq
);
1107 rq
->curr
->sched_class
->task_tick(rq
, rq
->curr
, 1);
1108 spin_unlock(&rq
->lock
);
1110 return HRTIMER_NORESTART
;
1113 static inline void init_rq_hrtick(struct rq
*rq
)
1115 rq
->hrtick_flags
= 0;
1116 hrtimer_init(&rq
->hrtick_timer
, CLOCK_MONOTONIC
, HRTIMER_MODE_REL
);
1117 rq
->hrtick_timer
.function
= hrtick
;
1118 rq
->hrtick_timer
.cb_mode
= HRTIMER_CB_IRQSAFE_NO_SOFTIRQ
;
1121 void hrtick_resched(void)
1124 unsigned long flags
;
1126 if (!test_thread_flag(TIF_HRTICK_RESCHED
))
1129 local_irq_save(flags
);
1130 rq
= cpu_rq(smp_processor_id());
1132 local_irq_restore(flags
);
1135 static inline void hrtick_clear(struct rq
*rq
)
1139 static inline void hrtick_set(struct rq
*rq
)
1143 static inline void init_rq_hrtick(struct rq
*rq
)
1147 void hrtick_resched(void)
1153 * resched_task - mark a task 'to be rescheduled now'.
1155 * On UP this means the setting of the need_resched flag, on SMP it
1156 * might also involve a cross-CPU call to trigger the scheduler on
1161 #ifndef tsk_is_polling
1162 #define tsk_is_polling(t) test_tsk_thread_flag(t, TIF_POLLING_NRFLAG)
1165 static void __resched_task(struct task_struct
*p
, int tif_bit
)
1169 assert_spin_locked(&task_rq(p
)->lock
);
1171 if (unlikely(test_tsk_thread_flag(p
, tif_bit
)))
1174 set_tsk_thread_flag(p
, tif_bit
);
1177 if (cpu
== smp_processor_id())
1180 /* NEED_RESCHED must be visible before we test polling */
1182 if (!tsk_is_polling(p
))
1183 smp_send_reschedule(cpu
);
1186 static void resched_cpu(int cpu
)
1188 struct rq
*rq
= cpu_rq(cpu
);
1189 unsigned long flags
;
1191 if (!spin_trylock_irqsave(&rq
->lock
, flags
))
1193 resched_task(cpu_curr(cpu
));
1194 spin_unlock_irqrestore(&rq
->lock
, flags
);
1199 * When add_timer_on() enqueues a timer into the timer wheel of an
1200 * idle CPU then this timer might expire before the next timer event
1201 * which is scheduled to wake up that CPU. In case of a completely
1202 * idle system the next event might even be infinite time into the
1203 * future. wake_up_idle_cpu() ensures that the CPU is woken up and
1204 * leaves the inner idle loop so the newly added timer is taken into
1205 * account when the CPU goes back to idle and evaluates the timer
1206 * wheel for the next timer event.
1208 void wake_up_idle_cpu(int cpu
)
1210 struct rq
*rq
= cpu_rq(cpu
);
1212 if (cpu
== smp_processor_id())
1216 * This is safe, as this function is called with the timer
1217 * wheel base lock of (cpu) held. When the CPU is on the way
1218 * to idle and has not yet set rq->curr to idle then it will
1219 * be serialized on the timer wheel base lock and take the new
1220 * timer into account automatically.
1222 if (rq
->curr
!= rq
->idle
)
1226 * We can set TIF_RESCHED on the idle task of the other CPU
1227 * lockless. The worst case is that the other CPU runs the
1228 * idle task through an additional NOOP schedule()
1230 set_tsk_thread_flag(rq
->idle
, TIF_NEED_RESCHED
);
1232 /* NEED_RESCHED must be visible before we test polling */
1234 if (!tsk_is_polling(rq
->idle
))
1235 smp_send_reschedule(cpu
);
1240 static void __resched_task(struct task_struct
*p
, int tif_bit
)
1242 assert_spin_locked(&task_rq(p
)->lock
);
1243 set_tsk_thread_flag(p
, tif_bit
);
1247 #if BITS_PER_LONG == 32
1248 # define WMULT_CONST (~0UL)
1250 # define WMULT_CONST (1UL << 32)
1253 #define WMULT_SHIFT 32
1256 * Shift right and round:
1258 #define SRR(x, y) (((x) + (1UL << ((y) - 1))) >> (y))
1260 static unsigned long
1261 calc_delta_mine(unsigned long delta_exec
, unsigned long weight
,
1262 struct load_weight
*lw
)
1266 if (unlikely(!lw
->inv_weight
))
1267 lw
->inv_weight
= (WMULT_CONST
-lw
->weight
/2) / (lw
->weight
+1);
1269 tmp
= (u64
)delta_exec
* weight
;
1271 * Check whether we'd overflow the 64-bit multiplication:
1273 if (unlikely(tmp
> WMULT_CONST
))
1274 tmp
= SRR(SRR(tmp
, WMULT_SHIFT
/2) * lw
->inv_weight
,
1277 tmp
= SRR(tmp
* lw
->inv_weight
, WMULT_SHIFT
);
1279 return (unsigned long)min(tmp
, (u64
)(unsigned long)LONG_MAX
);
1282 static inline unsigned long
1283 calc_delta_fair(unsigned long delta_exec
, struct load_weight
*lw
)
1285 return calc_delta_mine(delta_exec
, NICE_0_LOAD
, lw
);
1288 static inline void update_load_add(struct load_weight
*lw
, unsigned long inc
)
1294 static inline void update_load_sub(struct load_weight
*lw
, unsigned long dec
)
1301 * To aid in avoiding the subversion of "niceness" due to uneven distribution
1302 * of tasks with abnormal "nice" values across CPUs the contribution that
1303 * each task makes to its run queue's load is weighted according to its
1304 * scheduling class and "nice" value. For SCHED_NORMAL tasks this is just a
1305 * scaled version of the new time slice allocation that they receive on time
1309 #define WEIGHT_IDLEPRIO 2
1310 #define WMULT_IDLEPRIO (1 << 31)
1313 * Nice levels are multiplicative, with a gentle 10% change for every
1314 * nice level changed. I.e. when a CPU-bound task goes from nice 0 to
1315 * nice 1, it will get ~10% less CPU time than another CPU-bound task
1316 * that remained on nice 0.
1318 * The "10% effect" is relative and cumulative: from _any_ nice level,
1319 * if you go up 1 level, it's -10% CPU usage, if you go down 1 level
1320 * it's +10% CPU usage. (to achieve that we use a multiplier of 1.25.
1321 * If a task goes up by ~10% and another task goes down by ~10% then
1322 * the relative distance between them is ~25%.)
1324 static const int prio_to_weight
[40] = {
1325 /* -20 */ 88761, 71755, 56483, 46273, 36291,
1326 /* -15 */ 29154, 23254, 18705, 14949, 11916,
1327 /* -10 */ 9548, 7620, 6100, 4904, 3906,
1328 /* -5 */ 3121, 2501, 1991, 1586, 1277,
1329 /* 0 */ 1024, 820, 655, 526, 423,
1330 /* 5 */ 335, 272, 215, 172, 137,
1331 /* 10 */ 110, 87, 70, 56, 45,
1332 /* 15 */ 36, 29, 23, 18, 15,
1336 * Inverse (2^32/x) values of the prio_to_weight[] array, precalculated.
1338 * In cases where the weight does not change often, we can use the
1339 * precalculated inverse to speed up arithmetics by turning divisions
1340 * into multiplications:
1342 static const u32 prio_to_wmult
[40] = {
1343 /* -20 */ 48388, 59856, 76040, 92818, 118348,
1344 /* -15 */ 147320, 184698, 229616, 287308, 360437,
1345 /* -10 */ 449829, 563644, 704093, 875809, 1099582,
1346 /* -5 */ 1376151, 1717300, 2157191, 2708050, 3363326,
1347 /* 0 */ 4194304, 5237765, 6557202, 8165337, 10153587,
1348 /* 5 */ 12820798, 15790321, 19976592, 24970740, 31350126,
1349 /* 10 */ 39045157, 49367440, 61356676, 76695844, 95443717,
1350 /* 15 */ 119304647, 148102320, 186737708, 238609294, 286331153,
1353 static void activate_task(struct rq
*rq
, struct task_struct
*p
, int wakeup
);
1356 * runqueue iterator, to support SMP load-balancing between different
1357 * scheduling classes, without having to expose their internal data
1358 * structures to the load-balancing proper:
1360 struct rq_iterator
{
1362 struct task_struct
*(*start
)(void *);
1363 struct task_struct
*(*next
)(void *);
1367 static unsigned long
1368 balance_tasks(struct rq
*this_rq
, int this_cpu
, struct rq
*busiest
,
1369 unsigned long max_load_move
, struct sched_domain
*sd
,
1370 enum cpu_idle_type idle
, int *all_pinned
,
1371 int *this_best_prio
, struct rq_iterator
*iterator
);
1374 iter_move_one_task(struct rq
*this_rq
, int this_cpu
, struct rq
*busiest
,
1375 struct sched_domain
*sd
, enum cpu_idle_type idle
,
1376 struct rq_iterator
*iterator
);
1379 #ifdef CONFIG_CGROUP_CPUACCT
1380 static void cpuacct_charge(struct task_struct
*tsk
, u64 cputime
);
1382 static inline void cpuacct_charge(struct task_struct
*tsk
, u64 cputime
) {}
1386 static unsigned long source_load(int cpu
, int type
);
1387 static unsigned long target_load(int cpu
, int type
);
1388 static unsigned long cpu_avg_load_per_task(int cpu
);
1389 static int task_hot(struct task_struct
*p
, u64 now
, struct sched_domain
*sd
);
1390 #endif /* CONFIG_SMP */
1392 #include "sched_stats.h"
1393 #include "sched_idletask.c"
1394 #include "sched_fair.c"
1395 #include "sched_rt.c"
1396 #ifdef CONFIG_SCHED_DEBUG
1397 # include "sched_debug.c"
1400 #define sched_class_highest (&rt_sched_class)
1402 static inline void inc_load(struct rq
*rq
, const struct task_struct
*p
)
1404 update_load_add(&rq
->load
, p
->se
.load
.weight
);
1407 static inline void dec_load(struct rq
*rq
, const struct task_struct
*p
)
1409 update_load_sub(&rq
->load
, p
->se
.load
.weight
);
1412 static void inc_nr_running(struct task_struct
*p
, struct rq
*rq
)
1418 static void dec_nr_running(struct task_struct
*p
, struct rq
*rq
)
1424 static void set_load_weight(struct task_struct
*p
)
1426 if (task_has_rt_policy(p
)) {
1427 p
->se
.load
.weight
= prio_to_weight
[0] * 2;
1428 p
->se
.load
.inv_weight
= prio_to_wmult
[0] >> 1;
1433 * SCHED_IDLE tasks get minimal weight:
1435 if (p
->policy
== SCHED_IDLE
) {
1436 p
->se
.load
.weight
= WEIGHT_IDLEPRIO
;
1437 p
->se
.load
.inv_weight
= WMULT_IDLEPRIO
;
1441 p
->se
.load
.weight
= prio_to_weight
[p
->static_prio
- MAX_RT_PRIO
];
1442 p
->se
.load
.inv_weight
= prio_to_wmult
[p
->static_prio
- MAX_RT_PRIO
];
1445 static void enqueue_task(struct rq
*rq
, struct task_struct
*p
, int wakeup
)
1447 sched_info_queued(p
);
1448 p
->sched_class
->enqueue_task(rq
, p
, wakeup
);
1452 static void dequeue_task(struct rq
*rq
, struct task_struct
*p
, int sleep
)
1454 p
->sched_class
->dequeue_task(rq
, p
, sleep
);
1459 * __normal_prio - return the priority that is based on the static prio
1461 static inline int __normal_prio(struct task_struct
*p
)
1463 return p
->static_prio
;
1467 * Calculate the expected normal priority: i.e. priority
1468 * without taking RT-inheritance into account. Might be
1469 * boosted by interactivity modifiers. Changes upon fork,
1470 * setprio syscalls, and whenever the interactivity
1471 * estimator recalculates.
1473 static inline int normal_prio(struct task_struct
*p
)
1477 if (task_has_rt_policy(p
))
1478 prio
= MAX_RT_PRIO
-1 - p
->rt_priority
;
1480 prio
= __normal_prio(p
);
1485 * Calculate the current priority, i.e. the priority
1486 * taken into account by the scheduler. This value might
1487 * be boosted by RT tasks, or might be boosted by
1488 * interactivity modifiers. Will be RT if the task got
1489 * RT-boosted. If not then it returns p->normal_prio.
1491 static int effective_prio(struct task_struct
*p
)
1493 p
->normal_prio
= normal_prio(p
);
1495 * If we are RT tasks or we were boosted to RT priority,
1496 * keep the priority unchanged. Otherwise, update priority
1497 * to the normal priority:
1499 if (!rt_prio(p
->prio
))
1500 return p
->normal_prio
;
1505 * activate_task - move a task to the runqueue.
1507 static void activate_task(struct rq
*rq
, struct task_struct
*p
, int wakeup
)
1509 if (task_contributes_to_load(p
))
1510 rq
->nr_uninterruptible
--;
1512 enqueue_task(rq
, p
, wakeup
);
1513 inc_nr_running(p
, rq
);
1517 * deactivate_task - remove a task from the runqueue.
1519 static void deactivate_task(struct rq
*rq
, struct task_struct
*p
, int sleep
)
1521 if (task_contributes_to_load(p
))
1522 rq
->nr_uninterruptible
++;
1524 dequeue_task(rq
, p
, sleep
);
1525 dec_nr_running(p
, rq
);
1529 * task_curr - is this task currently executing on a CPU?
1530 * @p: the task in question.
1532 inline int task_curr(const struct task_struct
*p
)
1534 return cpu_curr(task_cpu(p
)) == p
;
1537 /* Used instead of source_load when we know the type == 0 */
1538 unsigned long weighted_cpuload(const int cpu
)
1540 return cpu_rq(cpu
)->load
.weight
;
1543 static inline void __set_task_cpu(struct task_struct
*p
, unsigned int cpu
)
1545 set_task_rq(p
, cpu
);
1548 * After ->cpu is set up to a new value, task_rq_lock(p, ...) can be
1549 * successfuly executed on another CPU. We must ensure that updates of
1550 * per-task data have been completed by this moment.
1553 task_thread_info(p
)->cpu
= cpu
;
1557 static inline void check_class_changed(struct rq
*rq
, struct task_struct
*p
,
1558 const struct sched_class
*prev_class
,
1559 int oldprio
, int running
)
1561 if (prev_class
!= p
->sched_class
) {
1562 if (prev_class
->switched_from
)
1563 prev_class
->switched_from(rq
, p
, running
);
1564 p
->sched_class
->switched_to(rq
, p
, running
);
1566 p
->sched_class
->prio_changed(rq
, p
, oldprio
, running
);
1572 * Is this task likely cache-hot:
1575 task_hot(struct task_struct
*p
, u64 now
, struct sched_domain
*sd
)
1580 * Buddy candidates are cache hot:
1582 if (sched_feat(CACHE_HOT_BUDDY
) && (&p
->se
== cfs_rq_of(&p
->se
)->next
))
1585 if (p
->sched_class
!= &fair_sched_class
)
1588 if (sysctl_sched_migration_cost
== -1)
1590 if (sysctl_sched_migration_cost
== 0)
1593 delta
= now
- p
->se
.exec_start
;
1595 return delta
< (s64
)sysctl_sched_migration_cost
;
1599 void set_task_cpu(struct task_struct
*p
, unsigned int new_cpu
)
1601 int old_cpu
= task_cpu(p
);
1602 struct rq
*old_rq
= cpu_rq(old_cpu
), *new_rq
= cpu_rq(new_cpu
);
1603 struct cfs_rq
*old_cfsrq
= task_cfs_rq(p
),
1604 *new_cfsrq
= cpu_cfs_rq(old_cfsrq
, new_cpu
);
1607 clock_offset
= old_rq
->clock
- new_rq
->clock
;
1609 #ifdef CONFIG_SCHEDSTATS
1610 if (p
->se
.wait_start
)
1611 p
->se
.wait_start
-= clock_offset
;
1612 if (p
->se
.sleep_start
)
1613 p
->se
.sleep_start
-= clock_offset
;
1614 if (p
->se
.block_start
)
1615 p
->se
.block_start
-= clock_offset
;
1616 if (old_cpu
!= new_cpu
) {
1617 schedstat_inc(p
, se
.nr_migrations
);
1618 if (task_hot(p
, old_rq
->clock
, NULL
))
1619 schedstat_inc(p
, se
.nr_forced2_migrations
);
1622 p
->se
.vruntime
-= old_cfsrq
->min_vruntime
-
1623 new_cfsrq
->min_vruntime
;
1625 __set_task_cpu(p
, new_cpu
);
1628 struct migration_req
{
1629 struct list_head list
;
1631 struct task_struct
*task
;
1634 struct completion done
;
1638 * The task's runqueue lock must be held.
1639 * Returns true if you have to wait for migration thread.
1642 migrate_task(struct task_struct
*p
, int dest_cpu
, struct migration_req
*req
)
1644 struct rq
*rq
= task_rq(p
);
1647 * If the task is not on a runqueue (and not running), then
1648 * it is sufficient to simply update the task's cpu field.
1650 if (!p
->se
.on_rq
&& !task_running(rq
, p
)) {
1651 set_task_cpu(p
, dest_cpu
);
1655 init_completion(&req
->done
);
1657 req
->dest_cpu
= dest_cpu
;
1658 list_add(&req
->list
, &rq
->migration_queue
);
1664 * wait_task_inactive - wait for a thread to unschedule.
1666 * The caller must ensure that the task *will* unschedule sometime soon,
1667 * else this function might spin for a *long* time. This function can't
1668 * be called with interrupts off, or it may introduce deadlock with
1669 * smp_call_function() if an IPI is sent by the same process we are
1670 * waiting to become inactive.
1672 void wait_task_inactive(struct task_struct
*p
)
1674 unsigned long flags
;
1680 * We do the initial early heuristics without holding
1681 * any task-queue locks at all. We'll only try to get
1682 * the runqueue lock when things look like they will
1688 * If the task is actively running on another CPU
1689 * still, just relax and busy-wait without holding
1692 * NOTE! Since we don't hold any locks, it's not
1693 * even sure that "rq" stays as the right runqueue!
1694 * But we don't care, since "task_running()" will
1695 * return false if the runqueue has changed and p
1696 * is actually now running somewhere else!
1698 while (task_running(rq
, p
))
1702 * Ok, time to look more closely! We need the rq
1703 * lock now, to be *sure*. If we're wrong, we'll
1704 * just go back and repeat.
1706 rq
= task_rq_lock(p
, &flags
);
1707 running
= task_running(rq
, p
);
1708 on_rq
= p
->se
.on_rq
;
1709 task_rq_unlock(rq
, &flags
);
1712 * Was it really running after all now that we
1713 * checked with the proper locks actually held?
1715 * Oops. Go back and try again..
1717 if (unlikely(running
)) {
1723 * It's not enough that it's not actively running,
1724 * it must be off the runqueue _entirely_, and not
1727 * So if it wa still runnable (but just not actively
1728 * running right now), it's preempted, and we should
1729 * yield - it could be a while.
1731 if (unlikely(on_rq
)) {
1732 schedule_timeout_uninterruptible(1);
1737 * Ahh, all good. It wasn't running, and it wasn't
1738 * runnable, which means that it will never become
1739 * running in the future either. We're all done!
1746 * kick_process - kick a running thread to enter/exit the kernel
1747 * @p: the to-be-kicked thread
1749 * Cause a process which is running on another CPU to enter
1750 * kernel-mode, without any delay. (to get signals handled.)
1752 * NOTE: this function doesnt have to take the runqueue lock,
1753 * because all it wants to ensure is that the remote task enters
1754 * the kernel. If the IPI races and the task has been migrated
1755 * to another CPU then no harm is done and the purpose has been
1758 void kick_process(struct task_struct
*p
)
1764 if ((cpu
!= smp_processor_id()) && task_curr(p
))
1765 smp_send_reschedule(cpu
);
1770 * Return a low guess at the load of a migration-source cpu weighted
1771 * according to the scheduling class and "nice" value.
1773 * We want to under-estimate the load of migration sources, to
1774 * balance conservatively.
1776 static unsigned long source_load(int cpu
, int type
)
1778 struct rq
*rq
= cpu_rq(cpu
);
1779 unsigned long total
= weighted_cpuload(cpu
);
1784 return min(rq
->cpu_load
[type
-1], total
);
1788 * Return a high guess at the load of a migration-target cpu weighted
1789 * according to the scheduling class and "nice" value.
1791 static unsigned long target_load(int cpu
, int type
)
1793 struct rq
*rq
= cpu_rq(cpu
);
1794 unsigned long total
= weighted_cpuload(cpu
);
1799 return max(rq
->cpu_load
[type
-1], total
);
1803 * Return the average load per task on the cpu's run queue
1805 static unsigned long cpu_avg_load_per_task(int cpu
)
1807 struct rq
*rq
= cpu_rq(cpu
);
1808 unsigned long total
= weighted_cpuload(cpu
);
1809 unsigned long n
= rq
->nr_running
;
1811 return n
? total
/ n
: SCHED_LOAD_SCALE
;
1815 * find_idlest_group finds and returns the least busy CPU group within the
1818 static struct sched_group
*
1819 find_idlest_group(struct sched_domain
*sd
, struct task_struct
*p
, int this_cpu
)
1821 struct sched_group
*idlest
= NULL
, *this = NULL
, *group
= sd
->groups
;
1822 unsigned long min_load
= ULONG_MAX
, this_load
= 0;
1823 int load_idx
= sd
->forkexec_idx
;
1824 int imbalance
= 100 + (sd
->imbalance_pct
-100)/2;
1827 unsigned long load
, avg_load
;
1831 /* Skip over this group if it has no CPUs allowed */
1832 if (!cpus_intersects(group
->cpumask
, p
->cpus_allowed
))
1835 local_group
= cpu_isset(this_cpu
, group
->cpumask
);
1837 /* Tally up the load of all CPUs in the group */
1840 for_each_cpu_mask(i
, group
->cpumask
) {
1841 /* Bias balancing toward cpus of our domain */
1843 load
= source_load(i
, load_idx
);
1845 load
= target_load(i
, load_idx
);
1850 /* Adjust by relative CPU power of the group */
1851 avg_load
= sg_div_cpu_power(group
,
1852 avg_load
* SCHED_LOAD_SCALE
);
1855 this_load
= avg_load
;
1857 } else if (avg_load
< min_load
) {
1858 min_load
= avg_load
;
1861 } while (group
= group
->next
, group
!= sd
->groups
);
1863 if (!idlest
|| 100*this_load
< imbalance
*min_load
)
1869 * find_idlest_cpu - find the idlest cpu among the cpus in group.
1872 find_idlest_cpu(struct sched_group
*group
, struct task_struct
*p
, int this_cpu
)
1875 unsigned long load
, min_load
= ULONG_MAX
;
1879 /* Traverse only the allowed CPUs */
1880 cpus_and(tmp
, group
->cpumask
, p
->cpus_allowed
);
1882 for_each_cpu_mask(i
, tmp
) {
1883 load
= weighted_cpuload(i
);
1885 if (load
< min_load
|| (load
== min_load
&& i
== this_cpu
)) {
1895 * sched_balance_self: balance the current task (running on cpu) in domains
1896 * that have the 'flag' flag set. In practice, this is SD_BALANCE_FORK and
1899 * Balance, ie. select the least loaded group.
1901 * Returns the target CPU number, or the same CPU if no balancing is needed.
1903 * preempt must be disabled.
1905 static int sched_balance_self(int cpu
, int flag
)
1907 struct task_struct
*t
= current
;
1908 struct sched_domain
*tmp
, *sd
= NULL
;
1910 for_each_domain(cpu
, tmp
) {
1912 * If power savings logic is enabled for a domain, stop there.
1914 if (tmp
->flags
& SD_POWERSAVINGS_BALANCE
)
1916 if (tmp
->flags
& flag
)
1922 struct sched_group
*group
;
1923 int new_cpu
, weight
;
1925 if (!(sd
->flags
& flag
)) {
1931 group
= find_idlest_group(sd
, t
, cpu
);
1937 new_cpu
= find_idlest_cpu(group
, t
, cpu
);
1938 if (new_cpu
== -1 || new_cpu
== cpu
) {
1939 /* Now try balancing at a lower domain level of cpu */
1944 /* Now try balancing at a lower domain level of new_cpu */
1947 weight
= cpus_weight(span
);
1948 for_each_domain(cpu
, tmp
) {
1949 if (weight
<= cpus_weight(tmp
->span
))
1951 if (tmp
->flags
& flag
)
1954 /* while loop will break here if sd == NULL */
1960 #endif /* CONFIG_SMP */
1963 * try_to_wake_up - wake up a thread
1964 * @p: the to-be-woken-up thread
1965 * @state: the mask of task states that can be woken
1966 * @sync: do a synchronous wakeup?
1968 * Put it on the run-queue if it's not already there. The "current"
1969 * thread is always on the run-queue (except when the actual
1970 * re-schedule is in progress), and as such you're allowed to do
1971 * the simpler "current->state = TASK_RUNNING" to mark yourself
1972 * runnable without the overhead of this.
1974 * returns failure only if the task is already active.
1976 static int try_to_wake_up(struct task_struct
*p
, unsigned int state
, int sync
)
1978 int cpu
, orig_cpu
, this_cpu
, success
= 0;
1979 unsigned long flags
;
1983 if (!sched_feat(SYNC_WAKEUPS
))
1987 rq
= task_rq_lock(p
, &flags
);
1988 old_state
= p
->state
;
1989 if (!(old_state
& state
))
1997 this_cpu
= smp_processor_id();
2000 if (unlikely(task_running(rq
, p
)))
2003 cpu
= p
->sched_class
->select_task_rq(p
, sync
);
2004 if (cpu
!= orig_cpu
) {
2005 set_task_cpu(p
, cpu
);
2006 task_rq_unlock(rq
, &flags
);
2007 /* might preempt at this point */
2008 rq
= task_rq_lock(p
, &flags
);
2009 old_state
= p
->state
;
2010 if (!(old_state
& state
))
2015 this_cpu
= smp_processor_id();
2019 #ifdef CONFIG_SCHEDSTATS
2020 schedstat_inc(rq
, ttwu_count
);
2021 if (cpu
== this_cpu
)
2022 schedstat_inc(rq
, ttwu_local
);
2024 struct sched_domain
*sd
;
2025 for_each_domain(this_cpu
, sd
) {
2026 if (cpu_isset(cpu
, sd
->span
)) {
2027 schedstat_inc(sd
, ttwu_wake_remote
);
2035 #endif /* CONFIG_SMP */
2036 schedstat_inc(p
, se
.nr_wakeups
);
2038 schedstat_inc(p
, se
.nr_wakeups_sync
);
2039 if (orig_cpu
!= cpu
)
2040 schedstat_inc(p
, se
.nr_wakeups_migrate
);
2041 if (cpu
== this_cpu
)
2042 schedstat_inc(p
, se
.nr_wakeups_local
);
2044 schedstat_inc(p
, se
.nr_wakeups_remote
);
2045 update_rq_clock(rq
);
2046 activate_task(rq
, p
, 1);
2050 check_preempt_curr(rq
, p
);
2052 p
->state
= TASK_RUNNING
;
2054 if (p
->sched_class
->task_wake_up
)
2055 p
->sched_class
->task_wake_up(rq
, p
);
2058 task_rq_unlock(rq
, &flags
);
2063 int wake_up_process(struct task_struct
*p
)
2065 return try_to_wake_up(p
, TASK_ALL
, 0);
2067 EXPORT_SYMBOL(wake_up_process
);
2069 int wake_up_state(struct task_struct
*p
, unsigned int state
)
2071 return try_to_wake_up(p
, state
, 0);
2075 * Perform scheduler related setup for a newly forked process p.
2076 * p is forked by current.
2078 * __sched_fork() is basic setup used by init_idle() too:
2080 static void __sched_fork(struct task_struct
*p
)
2082 p
->se
.exec_start
= 0;
2083 p
->se
.sum_exec_runtime
= 0;
2084 p
->se
.prev_sum_exec_runtime
= 0;
2085 p
->se
.last_wakeup
= 0;
2086 p
->se
.avg_overlap
= 0;
2088 #ifdef CONFIG_SCHEDSTATS
2089 p
->se
.wait_start
= 0;
2090 p
->se
.sum_sleep_runtime
= 0;
2091 p
->se
.sleep_start
= 0;
2092 p
->se
.block_start
= 0;
2093 p
->se
.sleep_max
= 0;
2094 p
->se
.block_max
= 0;
2096 p
->se
.slice_max
= 0;
2100 INIT_LIST_HEAD(&p
->rt
.run_list
);
2103 #ifdef CONFIG_PREEMPT_NOTIFIERS
2104 INIT_HLIST_HEAD(&p
->preempt_notifiers
);
2108 * We mark the process as running here, but have not actually
2109 * inserted it onto the runqueue yet. This guarantees that
2110 * nobody will actually run it, and a signal or other external
2111 * event cannot wake it up and insert it on the runqueue either.
2113 p
->state
= TASK_RUNNING
;
2117 * fork()/clone()-time setup:
2119 void sched_fork(struct task_struct
*p
, int clone_flags
)
2121 int cpu
= get_cpu();
2126 cpu
= sched_balance_self(cpu
, SD_BALANCE_FORK
);
2128 set_task_cpu(p
, cpu
);
2131 * Make sure we do not leak PI boosting priority to the child:
2133 p
->prio
= current
->normal_prio
;
2134 if (!rt_prio(p
->prio
))
2135 p
->sched_class
= &fair_sched_class
;
2137 #if defined(CONFIG_SCHEDSTATS) || defined(CONFIG_TASK_DELAY_ACCT)
2138 if (likely(sched_info_on()))
2139 memset(&p
->sched_info
, 0, sizeof(p
->sched_info
));
2141 #if defined(CONFIG_SMP) && defined(__ARCH_WANT_UNLOCKED_CTXSW)
2144 #ifdef CONFIG_PREEMPT
2145 /* Want to start with kernel preemption disabled. */
2146 task_thread_info(p
)->preempt_count
= 1;
2152 * wake_up_new_task - wake up a newly created task for the first time.
2154 * This function will do some initial scheduler statistics housekeeping
2155 * that must be done for every newly created context, then puts the task
2156 * on the runqueue and wakes it.
2158 void wake_up_new_task(struct task_struct
*p
, unsigned long clone_flags
)
2160 unsigned long flags
;
2163 rq
= task_rq_lock(p
, &flags
);
2164 BUG_ON(p
->state
!= TASK_RUNNING
);
2165 update_rq_clock(rq
);
2167 p
->prio
= effective_prio(p
);
2169 if (!p
->sched_class
->task_new
|| !current
->se
.on_rq
) {
2170 activate_task(rq
, p
, 0);
2173 * Let the scheduling class do new task startup
2174 * management (if any):
2176 p
->sched_class
->task_new(rq
, p
);
2177 inc_nr_running(p
, rq
);
2179 check_preempt_curr(rq
, p
);
2181 if (p
->sched_class
->task_wake_up
)
2182 p
->sched_class
->task_wake_up(rq
, p
);
2184 task_rq_unlock(rq
, &flags
);
2187 #ifdef CONFIG_PREEMPT_NOTIFIERS
2190 * preempt_notifier_register - tell me when current is being being preempted & rescheduled
2191 * @notifier: notifier struct to register
2193 void preempt_notifier_register(struct preempt_notifier
*notifier
)
2195 hlist_add_head(¬ifier
->link
, ¤t
->preempt_notifiers
);
2197 EXPORT_SYMBOL_GPL(preempt_notifier_register
);
2200 * preempt_notifier_unregister - no longer interested in preemption notifications
2201 * @notifier: notifier struct to unregister
2203 * This is safe to call from within a preemption notifier.
2205 void preempt_notifier_unregister(struct preempt_notifier
*notifier
)
2207 hlist_del(¬ifier
->link
);
2209 EXPORT_SYMBOL_GPL(preempt_notifier_unregister
);
2211 static void fire_sched_in_preempt_notifiers(struct task_struct
*curr
)
2213 struct preempt_notifier
*notifier
;
2214 struct hlist_node
*node
;
2216 hlist_for_each_entry(notifier
, node
, &curr
->preempt_notifiers
, link
)
2217 notifier
->ops
->sched_in(notifier
, raw_smp_processor_id());
2221 fire_sched_out_preempt_notifiers(struct task_struct
*curr
,
2222 struct task_struct
*next
)
2224 struct preempt_notifier
*notifier
;
2225 struct hlist_node
*node
;
2227 hlist_for_each_entry(notifier
, node
, &curr
->preempt_notifiers
, link
)
2228 notifier
->ops
->sched_out(notifier
, next
);
2233 static void fire_sched_in_preempt_notifiers(struct task_struct
*curr
)
2238 fire_sched_out_preempt_notifiers(struct task_struct
*curr
,
2239 struct task_struct
*next
)
2246 * prepare_task_switch - prepare to switch tasks
2247 * @rq: the runqueue preparing to switch
2248 * @prev: the current task that is being switched out
2249 * @next: the task we are going to switch to.
2251 * This is called with the rq lock held and interrupts off. It must
2252 * be paired with a subsequent finish_task_switch after the context
2255 * prepare_task_switch sets up locking and calls architecture specific
2259 prepare_task_switch(struct rq
*rq
, struct task_struct
*prev
,
2260 struct task_struct
*next
)
2262 fire_sched_out_preempt_notifiers(prev
, next
);
2263 prepare_lock_switch(rq
, next
);
2264 prepare_arch_switch(next
);
2268 * finish_task_switch - clean up after a task-switch
2269 * @rq: runqueue associated with task-switch
2270 * @prev: the thread we just switched away from.
2272 * finish_task_switch must be called after the context switch, paired
2273 * with a prepare_task_switch call before the context switch.
2274 * finish_task_switch will reconcile locking set up by prepare_task_switch,
2275 * and do any other architecture-specific cleanup actions.
2277 * Note that we may have delayed dropping an mm in context_switch(). If
2278 * so, we finish that here outside of the runqueue lock. (Doing it
2279 * with the lock held can cause deadlocks; see schedule() for
2282 static void finish_task_switch(struct rq
*rq
, struct task_struct
*prev
)
2283 __releases(rq
->lock
)
2285 struct mm_struct
*mm
= rq
->prev_mm
;
2291 * A task struct has one reference for the use as "current".
2292 * If a task dies, then it sets TASK_DEAD in tsk->state and calls
2293 * schedule one last time. The schedule call will never return, and
2294 * the scheduled task must drop that reference.
2295 * The test for TASK_DEAD must occur while the runqueue locks are
2296 * still held, otherwise prev could be scheduled on another cpu, die
2297 * there before we look at prev->state, and then the reference would
2299 * Manfred Spraul <manfred@colorfullife.com>
2301 prev_state
= prev
->state
;
2302 finish_arch_switch(prev
);
2303 finish_lock_switch(rq
, prev
);
2305 if (current
->sched_class
->post_schedule
)
2306 current
->sched_class
->post_schedule(rq
);
2309 fire_sched_in_preempt_notifiers(current
);
2312 if (unlikely(prev_state
== TASK_DEAD
)) {
2314 * Remove function-return probe instances associated with this
2315 * task and put them back on the free list.
2317 kprobe_flush_task(prev
);
2318 put_task_struct(prev
);
2323 * schedule_tail - first thing a freshly forked thread must call.
2324 * @prev: the thread we just switched away from.
2326 asmlinkage
void schedule_tail(struct task_struct
*prev
)
2327 __releases(rq
->lock
)
2329 struct rq
*rq
= this_rq();
2331 finish_task_switch(rq
, prev
);
2332 #ifdef __ARCH_WANT_UNLOCKED_CTXSW
2333 /* In this case, finish_task_switch does not reenable preemption */
2336 if (current
->set_child_tid
)
2337 put_user(task_pid_vnr(current
), current
->set_child_tid
);
2341 * context_switch - switch to the new MM and the new
2342 * thread's register state.
2345 context_switch(struct rq
*rq
, struct task_struct
*prev
,
2346 struct task_struct
*next
)
2348 struct mm_struct
*mm
, *oldmm
;
2350 prepare_task_switch(rq
, prev
, next
);
2352 oldmm
= prev
->active_mm
;
2354 * For paravirt, this is coupled with an exit in switch_to to
2355 * combine the page table reload and the switch backend into
2358 arch_enter_lazy_cpu_mode();
2360 if (unlikely(!mm
)) {
2361 next
->active_mm
= oldmm
;
2362 atomic_inc(&oldmm
->mm_count
);
2363 enter_lazy_tlb(oldmm
, next
);
2365 switch_mm(oldmm
, mm
, next
);
2367 if (unlikely(!prev
->mm
)) {
2368 prev
->active_mm
= NULL
;
2369 rq
->prev_mm
= oldmm
;
2372 * Since the runqueue lock will be released by the next
2373 * task (which is an invalid locking op but in the case
2374 * of the scheduler it's an obvious special-case), so we
2375 * do an early lockdep release here:
2377 #ifndef __ARCH_WANT_UNLOCKED_CTXSW
2378 spin_release(&rq
->lock
.dep_map
, 1, _THIS_IP_
);
2381 /* Here we just switch the register state and the stack. */
2382 switch_to(prev
, next
, prev
);
2386 * this_rq must be evaluated again because prev may have moved
2387 * CPUs since it called schedule(), thus the 'rq' on its stack
2388 * frame will be invalid.
2390 finish_task_switch(this_rq(), prev
);
2394 * nr_running, nr_uninterruptible and nr_context_switches:
2396 * externally visible scheduler statistics: current number of runnable
2397 * threads, current number of uninterruptible-sleeping threads, total
2398 * number of context switches performed since bootup.
2400 unsigned long nr_running(void)
2402 unsigned long i
, sum
= 0;
2404 for_each_online_cpu(i
)
2405 sum
+= cpu_rq(i
)->nr_running
;
2410 unsigned long nr_uninterruptible(void)
2412 unsigned long i
, sum
= 0;
2414 for_each_possible_cpu(i
)
2415 sum
+= cpu_rq(i
)->nr_uninterruptible
;
2418 * Since we read the counters lockless, it might be slightly
2419 * inaccurate. Do not allow it to go below zero though:
2421 if (unlikely((long)sum
< 0))
2427 unsigned long long nr_context_switches(void)
2430 unsigned long long sum
= 0;
2432 for_each_possible_cpu(i
)
2433 sum
+= cpu_rq(i
)->nr_switches
;
2438 unsigned long nr_iowait(void)
2440 unsigned long i
, sum
= 0;
2442 for_each_possible_cpu(i
)
2443 sum
+= atomic_read(&cpu_rq(i
)->nr_iowait
);
2448 unsigned long nr_active(void)
2450 unsigned long i
, running
= 0, uninterruptible
= 0;
2452 for_each_online_cpu(i
) {
2453 running
+= cpu_rq(i
)->nr_running
;
2454 uninterruptible
+= cpu_rq(i
)->nr_uninterruptible
;
2457 if (unlikely((long)uninterruptible
< 0))
2458 uninterruptible
= 0;
2460 return running
+ uninterruptible
;
2464 * Update rq->cpu_load[] statistics. This function is usually called every
2465 * scheduler tick (TICK_NSEC).
2467 static void update_cpu_load(struct rq
*this_rq
)
2469 unsigned long this_load
= this_rq
->load
.weight
;
2472 this_rq
->nr_load_updates
++;
2474 /* Update our load: */
2475 for (i
= 0, scale
= 1; i
< CPU_LOAD_IDX_MAX
; i
++, scale
+= scale
) {
2476 unsigned long old_load
, new_load
;
2478 /* scale is effectively 1 << i now, and >> i divides by scale */
2480 old_load
= this_rq
->cpu_load
[i
];
2481 new_load
= this_load
;
2483 * Round up the averaging division if load is increasing. This
2484 * prevents us from getting stuck on 9 if the load is 10, for
2487 if (new_load
> old_load
)
2488 new_load
+= scale
-1;
2489 this_rq
->cpu_load
[i
] = (old_load
*(scale
-1) + new_load
) >> i
;
2496 * double_rq_lock - safely lock two runqueues
2498 * Note this does not disable interrupts like task_rq_lock,
2499 * you need to do so manually before calling.
2501 static void double_rq_lock(struct rq
*rq1
, struct rq
*rq2
)
2502 __acquires(rq1
->lock
)
2503 __acquires(rq2
->lock
)
2505 BUG_ON(!irqs_disabled());
2507 spin_lock(&rq1
->lock
);
2508 __acquire(rq2
->lock
); /* Fake it out ;) */
2511 spin_lock(&rq1
->lock
);
2512 spin_lock(&rq2
->lock
);
2514 spin_lock(&rq2
->lock
);
2515 spin_lock(&rq1
->lock
);
2518 update_rq_clock(rq1
);
2519 update_rq_clock(rq2
);
2523 * double_rq_unlock - safely unlock two runqueues
2525 * Note this does not restore interrupts like task_rq_unlock,
2526 * you need to do so manually after calling.
2528 static void double_rq_unlock(struct rq
*rq1
, struct rq
*rq2
)
2529 __releases(rq1
->lock
)
2530 __releases(rq2
->lock
)
2532 spin_unlock(&rq1
->lock
);
2534 spin_unlock(&rq2
->lock
);
2536 __release(rq2
->lock
);
2540 * double_lock_balance - lock the busiest runqueue, this_rq is locked already.
2542 static int double_lock_balance(struct rq
*this_rq
, struct rq
*busiest
)
2543 __releases(this_rq
->lock
)
2544 __acquires(busiest
->lock
)
2545 __acquires(this_rq
->lock
)
2549 if (unlikely(!irqs_disabled())) {
2550 /* printk() doesn't work good under rq->lock */
2551 spin_unlock(&this_rq
->lock
);
2554 if (unlikely(!spin_trylock(&busiest
->lock
))) {
2555 if (busiest
< this_rq
) {
2556 spin_unlock(&this_rq
->lock
);
2557 spin_lock(&busiest
->lock
);
2558 spin_lock(&this_rq
->lock
);
2561 spin_lock(&busiest
->lock
);
2567 * If dest_cpu is allowed for this process, migrate the task to it.
2568 * This is accomplished by forcing the cpu_allowed mask to only
2569 * allow dest_cpu, which will force the cpu onto dest_cpu. Then
2570 * the cpu_allowed mask is restored.
2572 static void sched_migrate_task(struct task_struct
*p
, int dest_cpu
)
2574 struct migration_req req
;
2575 unsigned long flags
;
2578 rq
= task_rq_lock(p
, &flags
);
2579 if (!cpu_isset(dest_cpu
, p
->cpus_allowed
)
2580 || unlikely(cpu_is_offline(dest_cpu
)))
2583 /* force the process onto the specified CPU */
2584 if (migrate_task(p
, dest_cpu
, &req
)) {
2585 /* Need to wait for migration thread (might exit: take ref). */
2586 struct task_struct
*mt
= rq
->migration_thread
;
2588 get_task_struct(mt
);
2589 task_rq_unlock(rq
, &flags
);
2590 wake_up_process(mt
);
2591 put_task_struct(mt
);
2592 wait_for_completion(&req
.done
);
2597 task_rq_unlock(rq
, &flags
);
2601 * sched_exec - execve() is a valuable balancing opportunity, because at
2602 * this point the task has the smallest effective memory and cache footprint.
2604 void sched_exec(void)
2606 int new_cpu
, this_cpu
= get_cpu();
2607 new_cpu
= sched_balance_self(this_cpu
, SD_BALANCE_EXEC
);
2609 if (new_cpu
!= this_cpu
)
2610 sched_migrate_task(current
, new_cpu
);
2614 * pull_task - move a task from a remote runqueue to the local runqueue.
2615 * Both runqueues must be locked.
2617 static void pull_task(struct rq
*src_rq
, struct task_struct
*p
,
2618 struct rq
*this_rq
, int this_cpu
)
2620 deactivate_task(src_rq
, p
, 0);
2621 set_task_cpu(p
, this_cpu
);
2622 activate_task(this_rq
, p
, 0);
2624 * Note that idle threads have a prio of MAX_PRIO, for this test
2625 * to be always true for them.
2627 check_preempt_curr(this_rq
, p
);
2631 * can_migrate_task - may task p from runqueue rq be migrated to this_cpu?
2634 int can_migrate_task(struct task_struct
*p
, struct rq
*rq
, int this_cpu
,
2635 struct sched_domain
*sd
, enum cpu_idle_type idle
,
2639 * We do not migrate tasks that are:
2640 * 1) running (obviously), or
2641 * 2) cannot be migrated to this CPU due to cpus_allowed, or
2642 * 3) are cache-hot on their current CPU.
2644 if (!cpu_isset(this_cpu
, p
->cpus_allowed
)) {
2645 schedstat_inc(p
, se
.nr_failed_migrations_affine
);
2650 if (task_running(rq
, p
)) {
2651 schedstat_inc(p
, se
.nr_failed_migrations_running
);
2656 * Aggressive migration if:
2657 * 1) task is cache cold, or
2658 * 2) too many balance attempts have failed.
2661 if (!task_hot(p
, rq
->clock
, sd
) ||
2662 sd
->nr_balance_failed
> sd
->cache_nice_tries
) {
2663 #ifdef CONFIG_SCHEDSTATS
2664 if (task_hot(p
, rq
->clock
, sd
)) {
2665 schedstat_inc(sd
, lb_hot_gained
[idle
]);
2666 schedstat_inc(p
, se
.nr_forced_migrations
);
2672 if (task_hot(p
, rq
->clock
, sd
)) {
2673 schedstat_inc(p
, se
.nr_failed_migrations_hot
);
2679 static unsigned long
2680 balance_tasks(struct rq
*this_rq
, int this_cpu
, struct rq
*busiest
,
2681 unsigned long max_load_move
, struct sched_domain
*sd
,
2682 enum cpu_idle_type idle
, int *all_pinned
,
2683 int *this_best_prio
, struct rq_iterator
*iterator
)
2685 int loops
= 0, pulled
= 0, pinned
= 0, skip_for_load
;
2686 struct task_struct
*p
;
2687 long rem_load_move
= max_load_move
;
2689 if (max_load_move
== 0)
2695 * Start the load-balancing iterator:
2697 p
= iterator
->start(iterator
->arg
);
2699 if (!p
|| loops
++ > sysctl_sched_nr_migrate
)
2702 * To help distribute high priority tasks across CPUs we don't
2703 * skip a task if it will be the highest priority task (i.e. smallest
2704 * prio value) on its new queue regardless of its load weight
2706 skip_for_load
= (p
->se
.load
.weight
>> 1) > rem_load_move
+
2707 SCHED_LOAD_SCALE_FUZZ
;
2708 if ((skip_for_load
&& p
->prio
>= *this_best_prio
) ||
2709 !can_migrate_task(p
, busiest
, this_cpu
, sd
, idle
, &pinned
)) {
2710 p
= iterator
->next(iterator
->arg
);
2714 pull_task(busiest
, p
, this_rq
, this_cpu
);
2716 rem_load_move
-= p
->se
.load
.weight
;
2719 * We only want to steal up to the prescribed amount of weighted load.
2721 if (rem_load_move
> 0) {
2722 if (p
->prio
< *this_best_prio
)
2723 *this_best_prio
= p
->prio
;
2724 p
= iterator
->next(iterator
->arg
);
2729 * Right now, this is one of only two places pull_task() is called,
2730 * so we can safely collect pull_task() stats here rather than
2731 * inside pull_task().
2733 schedstat_add(sd
, lb_gained
[idle
], pulled
);
2736 *all_pinned
= pinned
;
2738 return max_load_move
- rem_load_move
;
2742 * move_tasks tries to move up to max_load_move weighted load from busiest to
2743 * this_rq, as part of a balancing operation within domain "sd".
2744 * Returns 1 if successful and 0 otherwise.
2746 * Called with both runqueues locked.
2748 static int move_tasks(struct rq
*this_rq
, int this_cpu
, struct rq
*busiest
,
2749 unsigned long max_load_move
,
2750 struct sched_domain
*sd
, enum cpu_idle_type idle
,
2753 const struct sched_class
*class = sched_class_highest
;
2754 unsigned long total_load_moved
= 0;
2755 int this_best_prio
= this_rq
->curr
->prio
;
2759 class->load_balance(this_rq
, this_cpu
, busiest
,
2760 max_load_move
- total_load_moved
,
2761 sd
, idle
, all_pinned
, &this_best_prio
);
2762 class = class->next
;
2763 } while (class && max_load_move
> total_load_moved
);
2765 return total_load_moved
> 0;
2769 iter_move_one_task(struct rq
*this_rq
, int this_cpu
, struct rq
*busiest
,
2770 struct sched_domain
*sd
, enum cpu_idle_type idle
,
2771 struct rq_iterator
*iterator
)
2773 struct task_struct
*p
= iterator
->start(iterator
->arg
);
2777 if (can_migrate_task(p
, busiest
, this_cpu
, sd
, idle
, &pinned
)) {
2778 pull_task(busiest
, p
, this_rq
, this_cpu
);
2780 * Right now, this is only the second place pull_task()
2781 * is called, so we can safely collect pull_task()
2782 * stats here rather than inside pull_task().
2784 schedstat_inc(sd
, lb_gained
[idle
]);
2788 p
= iterator
->next(iterator
->arg
);
2795 * move_one_task tries to move exactly one task from busiest to this_rq, as
2796 * part of active balancing operations within "domain".
2797 * Returns 1 if successful and 0 otherwise.
2799 * Called with both runqueues locked.
2801 static int move_one_task(struct rq
*this_rq
, int this_cpu
, struct rq
*busiest
,
2802 struct sched_domain
*sd
, enum cpu_idle_type idle
)
2804 const struct sched_class
*class;
2806 for (class = sched_class_highest
; class; class = class->next
)
2807 if (class->move_one_task(this_rq
, this_cpu
, busiest
, sd
, idle
))
2814 * find_busiest_group finds and returns the busiest CPU group within the
2815 * domain. It calculates and returns the amount of weighted load which
2816 * should be moved to restore balance via the imbalance parameter.
2818 static struct sched_group
*
2819 find_busiest_group(struct sched_domain
*sd
, int this_cpu
,
2820 unsigned long *imbalance
, enum cpu_idle_type idle
,
2821 int *sd_idle
, cpumask_t
*cpus
, int *balance
)
2823 struct sched_group
*busiest
= NULL
, *this = NULL
, *group
= sd
->groups
;
2824 unsigned long max_load
, avg_load
, total_load
, this_load
, total_pwr
;
2825 unsigned long max_pull
;
2826 unsigned long busiest_load_per_task
, busiest_nr_running
;
2827 unsigned long this_load_per_task
, this_nr_running
;
2828 int load_idx
, group_imb
= 0;
2829 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
2830 int power_savings_balance
= 1;
2831 unsigned long leader_nr_running
= 0, min_load_per_task
= 0;
2832 unsigned long min_nr_running
= ULONG_MAX
;
2833 struct sched_group
*group_min
= NULL
, *group_leader
= NULL
;
2836 max_load
= this_load
= total_load
= total_pwr
= 0;
2837 busiest_load_per_task
= busiest_nr_running
= 0;
2838 this_load_per_task
= this_nr_running
= 0;
2839 if (idle
== CPU_NOT_IDLE
)
2840 load_idx
= sd
->busy_idx
;
2841 else if (idle
== CPU_NEWLY_IDLE
)
2842 load_idx
= sd
->newidle_idx
;
2844 load_idx
= sd
->idle_idx
;
2847 unsigned long load
, group_capacity
, max_cpu_load
, min_cpu_load
;
2850 int __group_imb
= 0;
2851 unsigned int balance_cpu
= -1, first_idle_cpu
= 0;
2852 unsigned long sum_nr_running
, sum_weighted_load
;
2854 local_group
= cpu_isset(this_cpu
, group
->cpumask
);
2857 balance_cpu
= first_cpu(group
->cpumask
);
2859 /* Tally up the load of all CPUs in the group */
2860 sum_weighted_load
= sum_nr_running
= avg_load
= 0;
2862 min_cpu_load
= ~0UL;
2864 for_each_cpu_mask(i
, group
->cpumask
) {
2867 if (!cpu_isset(i
, *cpus
))
2872 if (*sd_idle
&& rq
->nr_running
)
2875 /* Bias balancing toward cpus of our domain */
2877 if (idle_cpu(i
) && !first_idle_cpu
) {
2882 load
= target_load(i
, load_idx
);
2884 load
= source_load(i
, load_idx
);
2885 if (load
> max_cpu_load
)
2886 max_cpu_load
= load
;
2887 if (min_cpu_load
> load
)
2888 min_cpu_load
= load
;
2892 sum_nr_running
+= rq
->nr_running
;
2893 sum_weighted_load
+= weighted_cpuload(i
);
2897 * First idle cpu or the first cpu(busiest) in this sched group
2898 * is eligible for doing load balancing at this and above
2899 * domains. In the newly idle case, we will allow all the cpu's
2900 * to do the newly idle load balance.
2902 if (idle
!= CPU_NEWLY_IDLE
&& local_group
&&
2903 balance_cpu
!= this_cpu
&& balance
) {
2908 total_load
+= avg_load
;
2909 total_pwr
+= group
->__cpu_power
;
2911 /* Adjust by relative CPU power of the group */
2912 avg_load
= sg_div_cpu_power(group
,
2913 avg_load
* SCHED_LOAD_SCALE
);
2915 if ((max_cpu_load
- min_cpu_load
) > SCHED_LOAD_SCALE
)
2918 group_capacity
= group
->__cpu_power
/ SCHED_LOAD_SCALE
;
2921 this_load
= avg_load
;
2923 this_nr_running
= sum_nr_running
;
2924 this_load_per_task
= sum_weighted_load
;
2925 } else if (avg_load
> max_load
&&
2926 (sum_nr_running
> group_capacity
|| __group_imb
)) {
2927 max_load
= avg_load
;
2929 busiest_nr_running
= sum_nr_running
;
2930 busiest_load_per_task
= sum_weighted_load
;
2931 group_imb
= __group_imb
;
2934 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
2936 * Busy processors will not participate in power savings
2939 if (idle
== CPU_NOT_IDLE
||
2940 !(sd
->flags
& SD_POWERSAVINGS_BALANCE
))
2944 * If the local group is idle or completely loaded
2945 * no need to do power savings balance at this domain
2947 if (local_group
&& (this_nr_running
>= group_capacity
||
2949 power_savings_balance
= 0;
2952 * If a group is already running at full capacity or idle,
2953 * don't include that group in power savings calculations
2955 if (!power_savings_balance
|| sum_nr_running
>= group_capacity
2960 * Calculate the group which has the least non-idle load.
2961 * This is the group from where we need to pick up the load
2964 if ((sum_nr_running
< min_nr_running
) ||
2965 (sum_nr_running
== min_nr_running
&&
2966 first_cpu(group
->cpumask
) <
2967 first_cpu(group_min
->cpumask
))) {
2969 min_nr_running
= sum_nr_running
;
2970 min_load_per_task
= sum_weighted_load
/
2975 * Calculate the group which is almost near its
2976 * capacity but still has some space to pick up some load
2977 * from other group and save more power
2979 if (sum_nr_running
<= group_capacity
- 1) {
2980 if (sum_nr_running
> leader_nr_running
||
2981 (sum_nr_running
== leader_nr_running
&&
2982 first_cpu(group
->cpumask
) >
2983 first_cpu(group_leader
->cpumask
))) {
2984 group_leader
= group
;
2985 leader_nr_running
= sum_nr_running
;
2990 group
= group
->next
;
2991 } while (group
!= sd
->groups
);
2993 if (!busiest
|| this_load
>= max_load
|| busiest_nr_running
== 0)
2996 avg_load
= (SCHED_LOAD_SCALE
* total_load
) / total_pwr
;
2998 if (this_load
>= avg_load
||
2999 100*max_load
<= sd
->imbalance_pct
*this_load
)
3002 busiest_load_per_task
/= busiest_nr_running
;
3004 busiest_load_per_task
= min(busiest_load_per_task
, avg_load
);
3007 * We're trying to get all the cpus to the average_load, so we don't
3008 * want to push ourselves above the average load, nor do we wish to
3009 * reduce the max loaded cpu below the average load, as either of these
3010 * actions would just result in more rebalancing later, and ping-pong
3011 * tasks around. Thus we look for the minimum possible imbalance.
3012 * Negative imbalances (*we* are more loaded than anyone else) will
3013 * be counted as no imbalance for these purposes -- we can't fix that
3014 * by pulling tasks to us. Be careful of negative numbers as they'll
3015 * appear as very large values with unsigned longs.
3017 if (max_load
<= busiest_load_per_task
)
3021 * In the presence of smp nice balancing, certain scenarios can have
3022 * max load less than avg load(as we skip the groups at or below
3023 * its cpu_power, while calculating max_load..)
3025 if (max_load
< avg_load
) {
3027 goto small_imbalance
;
3030 /* Don't want to pull so many tasks that a group would go idle */
3031 max_pull
= min(max_load
- avg_load
, max_load
- busiest_load_per_task
);
3033 /* How much load to actually move to equalise the imbalance */
3034 *imbalance
= min(max_pull
* busiest
->__cpu_power
,
3035 (avg_load
- this_load
) * this->__cpu_power
)
3039 * if *imbalance is less than the average load per runnable task
3040 * there is no gaurantee that any tasks will be moved so we'll have
3041 * a think about bumping its value to force at least one task to be
3044 if (*imbalance
< busiest_load_per_task
) {
3045 unsigned long tmp
, pwr_now
, pwr_move
;
3049 pwr_move
= pwr_now
= 0;
3051 if (this_nr_running
) {
3052 this_load_per_task
/= this_nr_running
;
3053 if (busiest_load_per_task
> this_load_per_task
)
3056 this_load_per_task
= SCHED_LOAD_SCALE
;
3058 if (max_load
- this_load
+ SCHED_LOAD_SCALE_FUZZ
>=
3059 busiest_load_per_task
* imbn
) {
3060 *imbalance
= busiest_load_per_task
;
3065 * OK, we don't have enough imbalance to justify moving tasks,
3066 * however we may be able to increase total CPU power used by
3070 pwr_now
+= busiest
->__cpu_power
*
3071 min(busiest_load_per_task
, max_load
);
3072 pwr_now
+= this->__cpu_power
*
3073 min(this_load_per_task
, this_load
);
3074 pwr_now
/= SCHED_LOAD_SCALE
;
3076 /* Amount of load we'd subtract */
3077 tmp
= sg_div_cpu_power(busiest
,
3078 busiest_load_per_task
* SCHED_LOAD_SCALE
);
3080 pwr_move
+= busiest
->__cpu_power
*
3081 min(busiest_load_per_task
, max_load
- tmp
);
3083 /* Amount of load we'd add */
3084 if (max_load
* busiest
->__cpu_power
<
3085 busiest_load_per_task
* SCHED_LOAD_SCALE
)
3086 tmp
= sg_div_cpu_power(this,
3087 max_load
* busiest
->__cpu_power
);
3089 tmp
= sg_div_cpu_power(this,
3090 busiest_load_per_task
* SCHED_LOAD_SCALE
);
3091 pwr_move
+= this->__cpu_power
*
3092 min(this_load_per_task
, this_load
+ tmp
);
3093 pwr_move
/= SCHED_LOAD_SCALE
;
3095 /* Move if we gain throughput */
3096 if (pwr_move
> pwr_now
)
3097 *imbalance
= busiest_load_per_task
;
3103 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
3104 if (idle
== CPU_NOT_IDLE
|| !(sd
->flags
& SD_POWERSAVINGS_BALANCE
))
3107 if (this == group_leader
&& group_leader
!= group_min
) {
3108 *imbalance
= min_load_per_task
;
3118 * find_busiest_queue - find the busiest runqueue among the cpus in group.
3121 find_busiest_queue(struct sched_group
*group
, enum cpu_idle_type idle
,
3122 unsigned long imbalance
, cpumask_t
*cpus
)
3124 struct rq
*busiest
= NULL
, *rq
;
3125 unsigned long max_load
= 0;
3128 for_each_cpu_mask(i
, group
->cpumask
) {
3131 if (!cpu_isset(i
, *cpus
))
3135 wl
= weighted_cpuload(i
);
3137 if (rq
->nr_running
== 1 && wl
> imbalance
)
3140 if (wl
> max_load
) {
3150 * Max backoff if we encounter pinned tasks. Pretty arbitrary value, but
3151 * so long as it is large enough.
3153 #define MAX_PINNED_INTERVAL 512
3156 * Check this_cpu to ensure it is balanced within domain. Attempt to move
3157 * tasks if there is an imbalance.
3159 static int load_balance(int this_cpu
, struct rq
*this_rq
,
3160 struct sched_domain
*sd
, enum cpu_idle_type idle
,
3163 int ld_moved
, all_pinned
= 0, active_balance
= 0, sd_idle
= 0;
3164 struct sched_group
*group
;
3165 unsigned long imbalance
;
3167 cpumask_t cpus
= CPU_MASK_ALL
;
3168 unsigned long flags
;
3171 * When power savings policy is enabled for the parent domain, idle
3172 * sibling can pick up load irrespective of busy siblings. In this case,
3173 * let the state of idle sibling percolate up as CPU_IDLE, instead of
3174 * portraying it as CPU_NOT_IDLE.
3176 if (idle
!= CPU_NOT_IDLE
&& sd
->flags
& SD_SHARE_CPUPOWER
&&
3177 !test_sd_parent(sd
, SD_POWERSAVINGS_BALANCE
))
3180 schedstat_inc(sd
, lb_count
[idle
]);
3183 group
= find_busiest_group(sd
, this_cpu
, &imbalance
, idle
, &sd_idle
,
3190 schedstat_inc(sd
, lb_nobusyg
[idle
]);
3194 busiest
= find_busiest_queue(group
, idle
, imbalance
, &cpus
);
3196 schedstat_inc(sd
, lb_nobusyq
[idle
]);
3200 BUG_ON(busiest
== this_rq
);
3202 schedstat_add(sd
, lb_imbalance
[idle
], imbalance
);
3205 if (busiest
->nr_running
> 1) {
3207 * Attempt to move tasks. If find_busiest_group has found
3208 * an imbalance but busiest->nr_running <= 1, the group is
3209 * still unbalanced. ld_moved simply stays zero, so it is
3210 * correctly treated as an imbalance.
3212 local_irq_save(flags
);
3213 double_rq_lock(this_rq
, busiest
);
3214 ld_moved
= move_tasks(this_rq
, this_cpu
, busiest
,
3215 imbalance
, sd
, idle
, &all_pinned
);
3216 double_rq_unlock(this_rq
, busiest
);
3217 local_irq_restore(flags
);
3220 * some other cpu did the load balance for us.
3222 if (ld_moved
&& this_cpu
!= smp_processor_id())
3223 resched_cpu(this_cpu
);
3225 /* All tasks on this runqueue were pinned by CPU affinity */
3226 if (unlikely(all_pinned
)) {
3227 cpu_clear(cpu_of(busiest
), cpus
);
3228 if (!cpus_empty(cpus
))
3235 schedstat_inc(sd
, lb_failed
[idle
]);
3236 sd
->nr_balance_failed
++;
3238 if (unlikely(sd
->nr_balance_failed
> sd
->cache_nice_tries
+2)) {
3240 spin_lock_irqsave(&busiest
->lock
, flags
);
3242 /* don't kick the migration_thread, if the curr
3243 * task on busiest cpu can't be moved to this_cpu
3245 if (!cpu_isset(this_cpu
, busiest
->curr
->cpus_allowed
)) {
3246 spin_unlock_irqrestore(&busiest
->lock
, flags
);
3248 goto out_one_pinned
;
3251 if (!busiest
->active_balance
) {
3252 busiest
->active_balance
= 1;
3253 busiest
->push_cpu
= this_cpu
;
3256 spin_unlock_irqrestore(&busiest
->lock
, flags
);
3258 wake_up_process(busiest
->migration_thread
);
3261 * We've kicked active balancing, reset the failure
3264 sd
->nr_balance_failed
= sd
->cache_nice_tries
+1;
3267 sd
->nr_balance_failed
= 0;
3269 if (likely(!active_balance
)) {
3270 /* We were unbalanced, so reset the balancing interval */
3271 sd
->balance_interval
= sd
->min_interval
;
3274 * If we've begun active balancing, start to back off. This
3275 * case may not be covered by the all_pinned logic if there
3276 * is only 1 task on the busy runqueue (because we don't call
3279 if (sd
->balance_interval
< sd
->max_interval
)
3280 sd
->balance_interval
*= 2;
3283 if (!ld_moved
&& !sd_idle
&& sd
->flags
& SD_SHARE_CPUPOWER
&&
3284 !test_sd_parent(sd
, SD_POWERSAVINGS_BALANCE
))
3289 schedstat_inc(sd
, lb_balanced
[idle
]);
3291 sd
->nr_balance_failed
= 0;
3294 /* tune up the balancing interval */
3295 if ((all_pinned
&& sd
->balance_interval
< MAX_PINNED_INTERVAL
) ||
3296 (sd
->balance_interval
< sd
->max_interval
))
3297 sd
->balance_interval
*= 2;
3299 if (!sd_idle
&& sd
->flags
& SD_SHARE_CPUPOWER
&&
3300 !test_sd_parent(sd
, SD_POWERSAVINGS_BALANCE
))
3306 * Check this_cpu to ensure it is balanced within domain. Attempt to move
3307 * tasks if there is an imbalance.
3309 * Called from schedule when this_rq is about to become idle (CPU_NEWLY_IDLE).
3310 * this_rq is locked.
3313 load_balance_newidle(int this_cpu
, struct rq
*this_rq
, struct sched_domain
*sd
)
3315 struct sched_group
*group
;
3316 struct rq
*busiest
= NULL
;
3317 unsigned long imbalance
;
3321 cpumask_t cpus
= CPU_MASK_ALL
;
3324 * When power savings policy is enabled for the parent domain, idle
3325 * sibling can pick up load irrespective of busy siblings. In this case,
3326 * let the state of idle sibling percolate up as IDLE, instead of
3327 * portraying it as CPU_NOT_IDLE.
3329 if (sd
->flags
& SD_SHARE_CPUPOWER
&&
3330 !test_sd_parent(sd
, SD_POWERSAVINGS_BALANCE
))
3333 schedstat_inc(sd
, lb_count
[CPU_NEWLY_IDLE
]);
3335 group
= find_busiest_group(sd
, this_cpu
, &imbalance
, CPU_NEWLY_IDLE
,
3336 &sd_idle
, &cpus
, NULL
);
3338 schedstat_inc(sd
, lb_nobusyg
[CPU_NEWLY_IDLE
]);
3342 busiest
= find_busiest_queue(group
, CPU_NEWLY_IDLE
, imbalance
,
3345 schedstat_inc(sd
, lb_nobusyq
[CPU_NEWLY_IDLE
]);
3349 BUG_ON(busiest
== this_rq
);
3351 schedstat_add(sd
, lb_imbalance
[CPU_NEWLY_IDLE
], imbalance
);
3354 if (busiest
->nr_running
> 1) {
3355 /* Attempt to move tasks */
3356 double_lock_balance(this_rq
, busiest
);
3357 /* this_rq->clock is already updated */
3358 update_rq_clock(busiest
);
3359 ld_moved
= move_tasks(this_rq
, this_cpu
, busiest
,
3360 imbalance
, sd
, CPU_NEWLY_IDLE
,
3362 spin_unlock(&busiest
->lock
);
3364 if (unlikely(all_pinned
)) {
3365 cpu_clear(cpu_of(busiest
), cpus
);
3366 if (!cpus_empty(cpus
))
3372 schedstat_inc(sd
, lb_failed
[CPU_NEWLY_IDLE
]);
3373 if (!sd_idle
&& sd
->flags
& SD_SHARE_CPUPOWER
&&
3374 !test_sd_parent(sd
, SD_POWERSAVINGS_BALANCE
))
3377 sd
->nr_balance_failed
= 0;
3382 schedstat_inc(sd
, lb_balanced
[CPU_NEWLY_IDLE
]);
3383 if (!sd_idle
&& sd
->flags
& SD_SHARE_CPUPOWER
&&
3384 !test_sd_parent(sd
, SD_POWERSAVINGS_BALANCE
))
3386 sd
->nr_balance_failed
= 0;
3392 * idle_balance is called by schedule() if this_cpu is about to become
3393 * idle. Attempts to pull tasks from other CPUs.
3395 static void idle_balance(int this_cpu
, struct rq
*this_rq
)
3397 struct sched_domain
*sd
;
3398 int pulled_task
= -1;
3399 unsigned long next_balance
= jiffies
+ HZ
;
3401 for_each_domain(this_cpu
, sd
) {
3402 unsigned long interval
;
3404 if (!(sd
->flags
& SD_LOAD_BALANCE
))
3407 if (sd
->flags
& SD_BALANCE_NEWIDLE
)
3408 /* If we've pulled tasks over stop searching: */
3409 pulled_task
= load_balance_newidle(this_cpu
,
3412 interval
= msecs_to_jiffies(sd
->balance_interval
);
3413 if (time_after(next_balance
, sd
->last_balance
+ interval
))
3414 next_balance
= sd
->last_balance
+ interval
;
3418 if (pulled_task
|| time_after(jiffies
, this_rq
->next_balance
)) {
3420 * We are going idle. next_balance may be set based on
3421 * a busy processor. So reset next_balance.
3423 this_rq
->next_balance
= next_balance
;
3428 * active_load_balance is run by migration threads. It pushes running tasks
3429 * off the busiest CPU onto idle CPUs. It requires at least 1 task to be
3430 * running on each physical CPU where possible, and avoids physical /
3431 * logical imbalances.
3433 * Called with busiest_rq locked.
3435 static void active_load_balance(struct rq
*busiest_rq
, int busiest_cpu
)
3437 int target_cpu
= busiest_rq
->push_cpu
;
3438 struct sched_domain
*sd
;
3439 struct rq
*target_rq
;
3441 /* Is there any task to move? */
3442 if (busiest_rq
->nr_running
<= 1)
3445 target_rq
= cpu_rq(target_cpu
);
3448 * This condition is "impossible", if it occurs
3449 * we need to fix it. Originally reported by
3450 * Bjorn Helgaas on a 128-cpu setup.
3452 BUG_ON(busiest_rq
== target_rq
);
3454 /* move a task from busiest_rq to target_rq */
3455 double_lock_balance(busiest_rq
, target_rq
);
3456 update_rq_clock(busiest_rq
);
3457 update_rq_clock(target_rq
);
3459 /* Search for an sd spanning us and the target CPU. */
3460 for_each_domain(target_cpu
, sd
) {
3461 if ((sd
->flags
& SD_LOAD_BALANCE
) &&
3462 cpu_isset(busiest_cpu
, sd
->span
))
3467 schedstat_inc(sd
, alb_count
);
3469 if (move_one_task(target_rq
, target_cpu
, busiest_rq
,
3471 schedstat_inc(sd
, alb_pushed
);
3473 schedstat_inc(sd
, alb_failed
);
3475 spin_unlock(&target_rq
->lock
);
3480 atomic_t load_balancer
;
3482 } nohz ____cacheline_aligned
= {
3483 .load_balancer
= ATOMIC_INIT(-1),
3484 .cpu_mask
= CPU_MASK_NONE
,
3488 * This routine will try to nominate the ilb (idle load balancing)
3489 * owner among the cpus whose ticks are stopped. ilb owner will do the idle
3490 * load balancing on behalf of all those cpus. If all the cpus in the system
3491 * go into this tickless mode, then there will be no ilb owner (as there is
3492 * no need for one) and all the cpus will sleep till the next wakeup event
3495 * For the ilb owner, tick is not stopped. And this tick will be used
3496 * for idle load balancing. ilb owner will still be part of
3499 * While stopping the tick, this cpu will become the ilb owner if there
3500 * is no other owner. And will be the owner till that cpu becomes busy
3501 * or if all cpus in the system stop their ticks at which point
3502 * there is no need for ilb owner.
3504 * When the ilb owner becomes busy, it nominates another owner, during the
3505 * next busy scheduler_tick()
3507 int select_nohz_load_balancer(int stop_tick
)
3509 int cpu
= smp_processor_id();
3512 cpu_set(cpu
, nohz
.cpu_mask
);
3513 cpu_rq(cpu
)->in_nohz_recently
= 1;
3516 * If we are going offline and still the leader, give up!
3518 if (cpu_is_offline(cpu
) &&
3519 atomic_read(&nohz
.load_balancer
) == cpu
) {
3520 if (atomic_cmpxchg(&nohz
.load_balancer
, cpu
, -1) != cpu
)
3525 /* time for ilb owner also to sleep */
3526 if (cpus_weight(nohz
.cpu_mask
) == num_online_cpus()) {
3527 if (atomic_read(&nohz
.load_balancer
) == cpu
)
3528 atomic_set(&nohz
.load_balancer
, -1);
3532 if (atomic_read(&nohz
.load_balancer
) == -1) {
3533 /* make me the ilb owner */
3534 if (atomic_cmpxchg(&nohz
.load_balancer
, -1, cpu
) == -1)
3536 } else if (atomic_read(&nohz
.load_balancer
) == cpu
)
3539 if (!cpu_isset(cpu
, nohz
.cpu_mask
))
3542 cpu_clear(cpu
, nohz
.cpu_mask
);
3544 if (atomic_read(&nohz
.load_balancer
) == cpu
)
3545 if (atomic_cmpxchg(&nohz
.load_balancer
, cpu
, -1) != cpu
)
3552 static DEFINE_SPINLOCK(balancing
);
3555 * It checks each scheduling domain to see if it is due to be balanced,
3556 * and initiates a balancing operation if so.
3558 * Balancing parameters are set up in arch_init_sched_domains.
3560 static void rebalance_domains(int cpu
, enum cpu_idle_type idle
)
3563 struct rq
*rq
= cpu_rq(cpu
);
3564 unsigned long interval
;
3565 struct sched_domain
*sd
;
3566 /* Earliest time when we have to do rebalance again */
3567 unsigned long next_balance
= jiffies
+ 60*HZ
;
3568 int update_next_balance
= 0;
3570 for_each_domain(cpu
, sd
) {
3571 if (!(sd
->flags
& SD_LOAD_BALANCE
))
3574 interval
= sd
->balance_interval
;
3575 if (idle
!= CPU_IDLE
)
3576 interval
*= sd
->busy_factor
;
3578 /* scale ms to jiffies */
3579 interval
= msecs_to_jiffies(interval
);
3580 if (unlikely(!interval
))
3582 if (interval
> HZ
*NR_CPUS
/10)
3583 interval
= HZ
*NR_CPUS
/10;
3586 if (sd
->flags
& SD_SERIALIZE
) {
3587 if (!spin_trylock(&balancing
))
3591 if (time_after_eq(jiffies
, sd
->last_balance
+ interval
)) {
3592 if (load_balance(cpu
, rq
, sd
, idle
, &balance
)) {
3594 * We've pulled tasks over so either we're no
3595 * longer idle, or one of our SMT siblings is
3598 idle
= CPU_NOT_IDLE
;
3600 sd
->last_balance
= jiffies
;
3602 if (sd
->flags
& SD_SERIALIZE
)
3603 spin_unlock(&balancing
);
3605 if (time_after(next_balance
, sd
->last_balance
+ interval
)) {
3606 next_balance
= sd
->last_balance
+ interval
;
3607 update_next_balance
= 1;
3611 * Stop the load balance at this level. There is another
3612 * CPU in our sched group which is doing load balancing more
3620 * next_balance will be updated only when there is a need.
3621 * When the cpu is attached to null domain for ex, it will not be
3624 if (likely(update_next_balance
))
3625 rq
->next_balance
= next_balance
;
3629 * run_rebalance_domains is triggered when needed from the scheduler tick.
3630 * In CONFIG_NO_HZ case, the idle load balance owner will do the
3631 * rebalancing for all the cpus for whom scheduler ticks are stopped.
3633 static void run_rebalance_domains(struct softirq_action
*h
)
3635 int this_cpu
= smp_processor_id();
3636 struct rq
*this_rq
= cpu_rq(this_cpu
);
3637 enum cpu_idle_type idle
= this_rq
->idle_at_tick
?
3638 CPU_IDLE
: CPU_NOT_IDLE
;
3640 rebalance_domains(this_cpu
, idle
);
3644 * If this cpu is the owner for idle load balancing, then do the
3645 * balancing on behalf of the other idle cpus whose ticks are
3648 if (this_rq
->idle_at_tick
&&
3649 atomic_read(&nohz
.load_balancer
) == this_cpu
) {
3650 cpumask_t cpus
= nohz
.cpu_mask
;
3654 cpu_clear(this_cpu
, cpus
);
3655 for_each_cpu_mask(balance_cpu
, cpus
) {
3657 * If this cpu gets work to do, stop the load balancing
3658 * work being done for other cpus. Next load
3659 * balancing owner will pick it up.
3664 rebalance_domains(balance_cpu
, CPU_IDLE
);
3666 rq
= cpu_rq(balance_cpu
);
3667 if (time_after(this_rq
->next_balance
, rq
->next_balance
))
3668 this_rq
->next_balance
= rq
->next_balance
;
3675 * Trigger the SCHED_SOFTIRQ if it is time to do periodic load balancing.
3677 * In case of CONFIG_NO_HZ, this is the place where we nominate a new
3678 * idle load balancing owner or decide to stop the periodic load balancing,
3679 * if the whole system is idle.
3681 static inline void trigger_load_balance(struct rq
*rq
, int cpu
)
3685 * If we were in the nohz mode recently and busy at the current
3686 * scheduler tick, then check if we need to nominate new idle
3689 if (rq
->in_nohz_recently
&& !rq
->idle_at_tick
) {
3690 rq
->in_nohz_recently
= 0;
3692 if (atomic_read(&nohz
.load_balancer
) == cpu
) {
3693 cpu_clear(cpu
, nohz
.cpu_mask
);
3694 atomic_set(&nohz
.load_balancer
, -1);
3697 if (atomic_read(&nohz
.load_balancer
) == -1) {
3699 * simple selection for now: Nominate the
3700 * first cpu in the nohz list to be the next
3703 * TBD: Traverse the sched domains and nominate
3704 * the nearest cpu in the nohz.cpu_mask.
3706 int ilb
= first_cpu(nohz
.cpu_mask
);
3708 if (ilb
< nr_cpu_ids
)
3714 * If this cpu is idle and doing idle load balancing for all the
3715 * cpus with ticks stopped, is it time for that to stop?
3717 if (rq
->idle_at_tick
&& atomic_read(&nohz
.load_balancer
) == cpu
&&
3718 cpus_weight(nohz
.cpu_mask
) == num_online_cpus()) {
3724 * If this cpu is idle and the idle load balancing is done by
3725 * someone else, then no need raise the SCHED_SOFTIRQ
3727 if (rq
->idle_at_tick
&& atomic_read(&nohz
.load_balancer
) != cpu
&&
3728 cpu_isset(cpu
, nohz
.cpu_mask
))
3731 if (time_after_eq(jiffies
, rq
->next_balance
))
3732 raise_softirq(SCHED_SOFTIRQ
);
3735 #else /* CONFIG_SMP */
3738 * on UP we do not need to balance between CPUs:
3740 static inline void idle_balance(int cpu
, struct rq
*rq
)
3746 DEFINE_PER_CPU(struct kernel_stat
, kstat
);
3748 EXPORT_PER_CPU_SYMBOL(kstat
);
3751 * Return p->sum_exec_runtime plus any more ns on the sched_clock
3752 * that have not yet been banked in case the task is currently running.
3754 unsigned long long task_sched_runtime(struct task_struct
*p
)
3756 unsigned long flags
;
3760 rq
= task_rq_lock(p
, &flags
);
3761 ns
= p
->se
.sum_exec_runtime
;
3762 if (task_current(rq
, p
)) {
3763 update_rq_clock(rq
);
3764 delta_exec
= rq
->clock
- p
->se
.exec_start
;
3765 if ((s64
)delta_exec
> 0)
3768 task_rq_unlock(rq
, &flags
);
3774 * Account user cpu time to a process.
3775 * @p: the process that the cpu time gets accounted to
3776 * @cputime: the cpu time spent in user space since the last update
3778 void account_user_time(struct task_struct
*p
, cputime_t cputime
)
3780 struct cpu_usage_stat
*cpustat
= &kstat_this_cpu
.cpustat
;
3783 p
->utime
= cputime_add(p
->utime
, cputime
);
3785 /* Add user time to cpustat. */
3786 tmp
= cputime_to_cputime64(cputime
);
3787 if (TASK_NICE(p
) > 0)
3788 cpustat
->nice
= cputime64_add(cpustat
->nice
, tmp
);
3790 cpustat
->user
= cputime64_add(cpustat
->user
, tmp
);
3794 * Account guest cpu time to a process.
3795 * @p: the process that the cpu time gets accounted to
3796 * @cputime: the cpu time spent in virtual machine since the last update
3798 static void account_guest_time(struct task_struct
*p
, cputime_t cputime
)
3801 struct cpu_usage_stat
*cpustat
= &kstat_this_cpu
.cpustat
;
3803 tmp
= cputime_to_cputime64(cputime
);
3805 p
->utime
= cputime_add(p
->utime
, cputime
);
3806 p
->gtime
= cputime_add(p
->gtime
, cputime
);
3808 cpustat
->user
= cputime64_add(cpustat
->user
, tmp
);
3809 cpustat
->guest
= cputime64_add(cpustat
->guest
, tmp
);
3813 * Account scaled user cpu time to a process.
3814 * @p: the process that the cpu time gets accounted to
3815 * @cputime: the cpu time spent in user space since the last update
3817 void account_user_time_scaled(struct task_struct
*p
, cputime_t cputime
)
3819 p
->utimescaled
= cputime_add(p
->utimescaled
, cputime
);
3823 * Account system cpu time to a process.
3824 * @p: the process that the cpu time gets accounted to
3825 * @hardirq_offset: the offset to subtract from hardirq_count()
3826 * @cputime: the cpu time spent in kernel space since the last update
3828 void account_system_time(struct task_struct
*p
, int hardirq_offset
,
3831 struct cpu_usage_stat
*cpustat
= &kstat_this_cpu
.cpustat
;
3832 struct rq
*rq
= this_rq();
3835 if ((p
->flags
& PF_VCPU
) && (irq_count() - hardirq_offset
== 0))
3836 return account_guest_time(p
, cputime
);
3838 p
->stime
= cputime_add(p
->stime
, cputime
);
3840 /* Add system time to cpustat. */
3841 tmp
= cputime_to_cputime64(cputime
);
3842 if (hardirq_count() - hardirq_offset
)
3843 cpustat
->irq
= cputime64_add(cpustat
->irq
, tmp
);
3844 else if (softirq_count())
3845 cpustat
->softirq
= cputime64_add(cpustat
->softirq
, tmp
);
3846 else if (p
!= rq
->idle
)
3847 cpustat
->system
= cputime64_add(cpustat
->system
, tmp
);
3848 else if (atomic_read(&rq
->nr_iowait
) > 0)
3849 cpustat
->iowait
= cputime64_add(cpustat
->iowait
, tmp
);
3851 cpustat
->idle
= cputime64_add(cpustat
->idle
, tmp
);
3852 /* Account for system time used */
3853 acct_update_integrals(p
);
3857 * Account scaled system cpu time to a process.
3858 * @p: the process that the cpu time gets accounted to
3859 * @hardirq_offset: the offset to subtract from hardirq_count()
3860 * @cputime: the cpu time spent in kernel space since the last update
3862 void account_system_time_scaled(struct task_struct
*p
, cputime_t cputime
)
3864 p
->stimescaled
= cputime_add(p
->stimescaled
, cputime
);
3868 * Account for involuntary wait time.
3869 * @p: the process from which the cpu time has been stolen
3870 * @steal: the cpu time spent in involuntary wait
3872 void account_steal_time(struct task_struct
*p
, cputime_t steal
)
3874 struct cpu_usage_stat
*cpustat
= &kstat_this_cpu
.cpustat
;
3875 cputime64_t tmp
= cputime_to_cputime64(steal
);
3876 struct rq
*rq
= this_rq();
3878 if (p
== rq
->idle
) {
3879 p
->stime
= cputime_add(p
->stime
, steal
);
3880 if (atomic_read(&rq
->nr_iowait
) > 0)
3881 cpustat
->iowait
= cputime64_add(cpustat
->iowait
, tmp
);
3883 cpustat
->idle
= cputime64_add(cpustat
->idle
, tmp
);
3885 cpustat
->steal
= cputime64_add(cpustat
->steal
, tmp
);
3889 * This function gets called by the timer code, with HZ frequency.
3890 * We call it with interrupts disabled.
3892 * It also gets called by the fork code, when changing the parent's
3895 void scheduler_tick(void)
3897 int cpu
= smp_processor_id();
3898 struct rq
*rq
= cpu_rq(cpu
);
3899 struct task_struct
*curr
= rq
->curr
;
3900 u64 next_tick
= rq
->tick_timestamp
+ TICK_NSEC
;
3902 spin_lock(&rq
->lock
);
3903 __update_rq_clock(rq
);
3905 * Let rq->clock advance by at least TICK_NSEC:
3907 if (unlikely(rq
->clock
< next_tick
)) {
3908 rq
->clock
= next_tick
;
3909 rq
->clock_underflows
++;
3911 rq
->tick_timestamp
= rq
->clock
;
3912 update_last_tick_seen(rq
);
3913 update_cpu_load(rq
);
3914 curr
->sched_class
->task_tick(rq
, curr
, 0);
3915 spin_unlock(&rq
->lock
);
3918 rq
->idle_at_tick
= idle_cpu(cpu
);
3919 trigger_load_balance(rq
, cpu
);
3923 #if defined(CONFIG_PREEMPT) && defined(CONFIG_DEBUG_PREEMPT)
3925 void __kprobes
add_preempt_count(int val
)
3930 if (DEBUG_LOCKS_WARN_ON((preempt_count() < 0)))
3932 preempt_count() += val
;
3934 * Spinlock count overflowing soon?
3936 DEBUG_LOCKS_WARN_ON((preempt_count() & PREEMPT_MASK
) >=
3939 EXPORT_SYMBOL(add_preempt_count
);
3941 void __kprobes
sub_preempt_count(int val
)
3946 if (DEBUG_LOCKS_WARN_ON(val
> preempt_count()))
3949 * Is the spinlock portion underflowing?
3951 if (DEBUG_LOCKS_WARN_ON((val
< PREEMPT_MASK
) &&
3952 !(preempt_count() & PREEMPT_MASK
)))
3955 preempt_count() -= val
;
3957 EXPORT_SYMBOL(sub_preempt_count
);
3962 * Print scheduling while atomic bug:
3964 static noinline
void __schedule_bug(struct task_struct
*prev
)
3966 struct pt_regs
*regs
= get_irq_regs();
3968 printk(KERN_ERR
"BUG: scheduling while atomic: %s/%d/0x%08x\n",
3969 prev
->comm
, prev
->pid
, preempt_count());
3971 debug_show_held_locks(prev
);
3972 if (irqs_disabled())
3973 print_irqtrace_events(prev
);
3982 * Various schedule()-time debugging checks and statistics:
3984 static inline void schedule_debug(struct task_struct
*prev
)
3987 * Test if we are atomic. Since do_exit() needs to call into
3988 * schedule() atomically, we ignore that path for now.
3989 * Otherwise, whine if we are scheduling when we should not be.
3991 if (unlikely(in_atomic_preempt_off()) && unlikely(!prev
->exit_state
))
3992 __schedule_bug(prev
);
3994 profile_hit(SCHED_PROFILING
, __builtin_return_address(0));
3996 schedstat_inc(this_rq(), sched_count
);
3997 #ifdef CONFIG_SCHEDSTATS
3998 if (unlikely(prev
->lock_depth
>= 0)) {
3999 schedstat_inc(this_rq(), bkl_count
);
4000 schedstat_inc(prev
, sched_info
.bkl_count
);
4006 * Pick up the highest-prio task:
4008 static inline struct task_struct
*
4009 pick_next_task(struct rq
*rq
, struct task_struct
*prev
)
4011 const struct sched_class
*class;
4012 struct task_struct
*p
;
4015 * Optimization: we know that if all tasks are in
4016 * the fair class we can call that function directly:
4018 if (likely(rq
->nr_running
== rq
->cfs
.nr_running
)) {
4019 p
= fair_sched_class
.pick_next_task(rq
);
4024 class = sched_class_highest
;
4026 p
= class->pick_next_task(rq
);
4030 * Will never be NULL as the idle class always
4031 * returns a non-NULL p:
4033 class = class->next
;
4038 * schedule() is the main scheduler function.
4040 asmlinkage
void __sched
schedule(void)
4042 struct task_struct
*prev
, *next
;
4043 unsigned long *switch_count
;
4049 cpu
= smp_processor_id();
4053 switch_count
= &prev
->nivcsw
;
4055 release_kernel_lock(prev
);
4056 need_resched_nonpreemptible
:
4058 schedule_debug(prev
);
4063 * Do the rq-clock update outside the rq lock:
4065 local_irq_disable();
4066 __update_rq_clock(rq
);
4067 spin_lock(&rq
->lock
);
4068 clear_tsk_need_resched(prev
);
4070 if (prev
->state
&& !(preempt_count() & PREEMPT_ACTIVE
)) {
4071 if (unlikely((prev
->state
& TASK_INTERRUPTIBLE
) &&
4072 signal_pending(prev
))) {
4073 prev
->state
= TASK_RUNNING
;
4075 deactivate_task(rq
, prev
, 1);
4077 switch_count
= &prev
->nvcsw
;
4081 if (prev
->sched_class
->pre_schedule
)
4082 prev
->sched_class
->pre_schedule(rq
, prev
);
4085 if (unlikely(!rq
->nr_running
))
4086 idle_balance(cpu
, rq
);
4088 prev
->sched_class
->put_prev_task(rq
, prev
);
4089 next
= pick_next_task(rq
, prev
);
4091 sched_info_switch(prev
, next
);
4093 if (likely(prev
!= next
)) {
4098 context_switch(rq
, prev
, next
); /* unlocks the rq */
4100 * the context switch might have flipped the stack from under
4101 * us, hence refresh the local variables.
4103 cpu
= smp_processor_id();
4106 spin_unlock_irq(&rq
->lock
);
4110 if (unlikely(reacquire_kernel_lock(current
) < 0))
4111 goto need_resched_nonpreemptible
;
4113 preempt_enable_no_resched();
4114 if (unlikely(test_thread_flag(TIF_NEED_RESCHED
)))
4117 EXPORT_SYMBOL(schedule
);
4119 #ifdef CONFIG_PREEMPT
4121 * this is the entry point to schedule() from in-kernel preemption
4122 * off of preempt_enable. Kernel preemptions off return from interrupt
4123 * occur there and call schedule directly.
4125 asmlinkage
void __sched
preempt_schedule(void)
4127 struct thread_info
*ti
= current_thread_info();
4128 struct task_struct
*task
= current
;
4129 int saved_lock_depth
;
4132 * If there is a non-zero preempt_count or interrupts are disabled,
4133 * we do not want to preempt the current task. Just return..
4135 if (likely(ti
->preempt_count
|| irqs_disabled()))
4139 add_preempt_count(PREEMPT_ACTIVE
);
4142 * We keep the big kernel semaphore locked, but we
4143 * clear ->lock_depth so that schedule() doesnt
4144 * auto-release the semaphore:
4146 saved_lock_depth
= task
->lock_depth
;
4147 task
->lock_depth
= -1;
4149 task
->lock_depth
= saved_lock_depth
;
4150 sub_preempt_count(PREEMPT_ACTIVE
);
4153 * Check again in case we missed a preemption opportunity
4154 * between schedule and now.
4157 } while (unlikely(test_thread_flag(TIF_NEED_RESCHED
)));
4159 EXPORT_SYMBOL(preempt_schedule
);
4162 * this is the entry point to schedule() from kernel preemption
4163 * off of irq context.
4164 * Note, that this is called and return with irqs disabled. This will
4165 * protect us against recursive calling from irq.
4167 asmlinkage
void __sched
preempt_schedule_irq(void)
4169 struct thread_info
*ti
= current_thread_info();
4170 struct task_struct
*task
= current
;
4171 int saved_lock_depth
;
4173 /* Catch callers which need to be fixed */
4174 BUG_ON(ti
->preempt_count
|| !irqs_disabled());
4177 add_preempt_count(PREEMPT_ACTIVE
);
4180 * We keep the big kernel semaphore locked, but we
4181 * clear ->lock_depth so that schedule() doesnt
4182 * auto-release the semaphore:
4184 saved_lock_depth
= task
->lock_depth
;
4185 task
->lock_depth
= -1;
4188 local_irq_disable();
4189 task
->lock_depth
= saved_lock_depth
;
4190 sub_preempt_count(PREEMPT_ACTIVE
);
4193 * Check again in case we missed a preemption opportunity
4194 * between schedule and now.
4197 } while (unlikely(test_thread_flag(TIF_NEED_RESCHED
)));
4200 #endif /* CONFIG_PREEMPT */
4202 int default_wake_function(wait_queue_t
*curr
, unsigned mode
, int sync
,
4205 return try_to_wake_up(curr
->private, mode
, sync
);
4207 EXPORT_SYMBOL(default_wake_function
);
4210 * The core wakeup function. Non-exclusive wakeups (nr_exclusive == 0) just
4211 * wake everything up. If it's an exclusive wakeup (nr_exclusive == small +ve
4212 * number) then we wake all the non-exclusive tasks and one exclusive task.
4214 * There are circumstances in which we can try to wake a task which has already
4215 * started to run but is not in state TASK_RUNNING. try_to_wake_up() returns
4216 * zero in this (rare) case, and we handle it by continuing to scan the queue.
4218 static void __wake_up_common(wait_queue_head_t
*q
, unsigned int mode
,
4219 int nr_exclusive
, int sync
, void *key
)
4221 wait_queue_t
*curr
, *next
;
4223 list_for_each_entry_safe(curr
, next
, &q
->task_list
, task_list
) {
4224 unsigned flags
= curr
->flags
;
4226 if (curr
->func(curr
, mode
, sync
, key
) &&
4227 (flags
& WQ_FLAG_EXCLUSIVE
) && !--nr_exclusive
)
4233 * __wake_up - wake up threads blocked on a waitqueue.
4235 * @mode: which threads
4236 * @nr_exclusive: how many wake-one or wake-many threads to wake up
4237 * @key: is directly passed to the wakeup function
4239 void __wake_up(wait_queue_head_t
*q
, unsigned int mode
,
4240 int nr_exclusive
, void *key
)
4242 unsigned long flags
;
4244 spin_lock_irqsave(&q
->lock
, flags
);
4245 __wake_up_common(q
, mode
, nr_exclusive
, 0, key
);
4246 spin_unlock_irqrestore(&q
->lock
, flags
);
4248 EXPORT_SYMBOL(__wake_up
);
4251 * Same as __wake_up but called with the spinlock in wait_queue_head_t held.
4253 void __wake_up_locked(wait_queue_head_t
*q
, unsigned int mode
)
4255 __wake_up_common(q
, mode
, 1, 0, NULL
);
4259 * __wake_up_sync - wake up threads blocked on a waitqueue.
4261 * @mode: which threads
4262 * @nr_exclusive: how many wake-one or wake-many threads to wake up
4264 * The sync wakeup differs that the waker knows that it will schedule
4265 * away soon, so while the target thread will be woken up, it will not
4266 * be migrated to another CPU - ie. the two threads are 'synchronized'
4267 * with each other. This can prevent needless bouncing between CPUs.
4269 * On UP it can prevent extra preemption.
4272 __wake_up_sync(wait_queue_head_t
*q
, unsigned int mode
, int nr_exclusive
)
4274 unsigned long flags
;
4280 if (unlikely(!nr_exclusive
))
4283 spin_lock_irqsave(&q
->lock
, flags
);
4284 __wake_up_common(q
, mode
, nr_exclusive
, sync
, NULL
);
4285 spin_unlock_irqrestore(&q
->lock
, flags
);
4287 EXPORT_SYMBOL_GPL(__wake_up_sync
); /* For internal use only */
4289 void complete(struct completion
*x
)
4291 unsigned long flags
;
4293 spin_lock_irqsave(&x
->wait
.lock
, flags
);
4295 __wake_up_common(&x
->wait
, TASK_NORMAL
, 1, 0, NULL
);
4296 spin_unlock_irqrestore(&x
->wait
.lock
, flags
);
4298 EXPORT_SYMBOL(complete
);
4300 void complete_all(struct completion
*x
)
4302 unsigned long flags
;
4304 spin_lock_irqsave(&x
->wait
.lock
, flags
);
4305 x
->done
+= UINT_MAX
/2;
4306 __wake_up_common(&x
->wait
, TASK_NORMAL
, 0, 0, NULL
);
4307 spin_unlock_irqrestore(&x
->wait
.lock
, flags
);
4309 EXPORT_SYMBOL(complete_all
);
4311 static inline long __sched
4312 do_wait_for_common(struct completion
*x
, long timeout
, int state
)
4315 DECLARE_WAITQUEUE(wait
, current
);
4317 wait
.flags
|= WQ_FLAG_EXCLUSIVE
;
4318 __add_wait_queue_tail(&x
->wait
, &wait
);
4320 if ((state
== TASK_INTERRUPTIBLE
&&
4321 signal_pending(current
)) ||
4322 (state
== TASK_KILLABLE
&&
4323 fatal_signal_pending(current
))) {
4324 __remove_wait_queue(&x
->wait
, &wait
);
4325 return -ERESTARTSYS
;
4327 __set_current_state(state
);
4328 spin_unlock_irq(&x
->wait
.lock
);
4329 timeout
= schedule_timeout(timeout
);
4330 spin_lock_irq(&x
->wait
.lock
);
4332 __remove_wait_queue(&x
->wait
, &wait
);
4336 __remove_wait_queue(&x
->wait
, &wait
);
4343 wait_for_common(struct completion
*x
, long timeout
, int state
)
4347 spin_lock_irq(&x
->wait
.lock
);
4348 timeout
= do_wait_for_common(x
, timeout
, state
);
4349 spin_unlock_irq(&x
->wait
.lock
);
4353 void __sched
wait_for_completion(struct completion
*x
)
4355 wait_for_common(x
, MAX_SCHEDULE_TIMEOUT
, TASK_UNINTERRUPTIBLE
);
4357 EXPORT_SYMBOL(wait_for_completion
);
4359 unsigned long __sched
4360 wait_for_completion_timeout(struct completion
*x
, unsigned long timeout
)
4362 return wait_for_common(x
, timeout
, TASK_UNINTERRUPTIBLE
);
4364 EXPORT_SYMBOL(wait_for_completion_timeout
);
4366 int __sched
wait_for_completion_interruptible(struct completion
*x
)
4368 long t
= wait_for_common(x
, MAX_SCHEDULE_TIMEOUT
, TASK_INTERRUPTIBLE
);
4369 if (t
== -ERESTARTSYS
)
4373 EXPORT_SYMBOL(wait_for_completion_interruptible
);
4375 unsigned long __sched
4376 wait_for_completion_interruptible_timeout(struct completion
*x
,
4377 unsigned long timeout
)
4379 return wait_for_common(x
, timeout
, TASK_INTERRUPTIBLE
);
4381 EXPORT_SYMBOL(wait_for_completion_interruptible_timeout
);
4383 int __sched
wait_for_completion_killable(struct completion
*x
)
4385 long t
= wait_for_common(x
, MAX_SCHEDULE_TIMEOUT
, TASK_KILLABLE
);
4386 if (t
== -ERESTARTSYS
)
4390 EXPORT_SYMBOL(wait_for_completion_killable
);
4393 sleep_on_common(wait_queue_head_t
*q
, int state
, long timeout
)
4395 unsigned long flags
;
4398 init_waitqueue_entry(&wait
, current
);
4400 __set_current_state(state
);
4402 spin_lock_irqsave(&q
->lock
, flags
);
4403 __add_wait_queue(q
, &wait
);
4404 spin_unlock(&q
->lock
);
4405 timeout
= schedule_timeout(timeout
);
4406 spin_lock_irq(&q
->lock
);
4407 __remove_wait_queue(q
, &wait
);
4408 spin_unlock_irqrestore(&q
->lock
, flags
);
4413 void __sched
interruptible_sleep_on(wait_queue_head_t
*q
)
4415 sleep_on_common(q
, TASK_INTERRUPTIBLE
, MAX_SCHEDULE_TIMEOUT
);
4417 EXPORT_SYMBOL(interruptible_sleep_on
);
4420 interruptible_sleep_on_timeout(wait_queue_head_t
*q
, long timeout
)
4422 return sleep_on_common(q
, TASK_INTERRUPTIBLE
, timeout
);
4424 EXPORT_SYMBOL(interruptible_sleep_on_timeout
);
4426 void __sched
sleep_on(wait_queue_head_t
*q
)
4428 sleep_on_common(q
, TASK_UNINTERRUPTIBLE
, MAX_SCHEDULE_TIMEOUT
);
4430 EXPORT_SYMBOL(sleep_on
);
4432 long __sched
sleep_on_timeout(wait_queue_head_t
*q
, long timeout
)
4434 return sleep_on_common(q
, TASK_UNINTERRUPTIBLE
, timeout
);
4436 EXPORT_SYMBOL(sleep_on_timeout
);
4438 #ifdef CONFIG_RT_MUTEXES
4441 * rt_mutex_setprio - set the current priority of a task
4443 * @prio: prio value (kernel-internal form)
4445 * This function changes the 'effective' priority of a task. It does
4446 * not touch ->normal_prio like __setscheduler().
4448 * Used by the rt_mutex code to implement priority inheritance logic.
4450 void rt_mutex_setprio(struct task_struct
*p
, int prio
)
4452 unsigned long flags
;
4453 int oldprio
, on_rq
, running
;
4455 const struct sched_class
*prev_class
= p
->sched_class
;
4457 BUG_ON(prio
< 0 || prio
> MAX_PRIO
);
4459 rq
= task_rq_lock(p
, &flags
);
4460 update_rq_clock(rq
);
4463 on_rq
= p
->se
.on_rq
;
4464 running
= task_current(rq
, p
);
4466 dequeue_task(rq
, p
, 0);
4468 p
->sched_class
->put_prev_task(rq
, p
);
4471 p
->sched_class
= &rt_sched_class
;
4473 p
->sched_class
= &fair_sched_class
;
4478 p
->sched_class
->set_curr_task(rq
);
4480 enqueue_task(rq
, p
, 0);
4482 check_class_changed(rq
, p
, prev_class
, oldprio
, running
);
4484 task_rq_unlock(rq
, &flags
);
4489 void set_user_nice(struct task_struct
*p
, long nice
)
4491 int old_prio
, delta
, on_rq
;
4492 unsigned long flags
;
4495 if (TASK_NICE(p
) == nice
|| nice
< -20 || nice
> 19)
4498 * We have to be careful, if called from sys_setpriority(),
4499 * the task might be in the middle of scheduling on another CPU.
4501 rq
= task_rq_lock(p
, &flags
);
4502 update_rq_clock(rq
);
4504 * The RT priorities are set via sched_setscheduler(), but we still
4505 * allow the 'normal' nice value to be set - but as expected
4506 * it wont have any effect on scheduling until the task is
4507 * SCHED_FIFO/SCHED_RR:
4509 if (task_has_rt_policy(p
)) {
4510 p
->static_prio
= NICE_TO_PRIO(nice
);
4513 on_rq
= p
->se
.on_rq
;
4515 dequeue_task(rq
, p
, 0);
4519 p
->static_prio
= NICE_TO_PRIO(nice
);
4522 p
->prio
= effective_prio(p
);
4523 delta
= p
->prio
- old_prio
;
4526 enqueue_task(rq
, p
, 0);
4529 * If the task increased its priority or is running and
4530 * lowered its priority, then reschedule its CPU:
4532 if (delta
< 0 || (delta
> 0 && task_running(rq
, p
)))
4533 resched_task(rq
->curr
);
4536 task_rq_unlock(rq
, &flags
);
4538 EXPORT_SYMBOL(set_user_nice
);
4541 * can_nice - check if a task can reduce its nice value
4545 int can_nice(const struct task_struct
*p
, const int nice
)
4547 /* convert nice value [19,-20] to rlimit style value [1,40] */
4548 int nice_rlim
= 20 - nice
;
4550 return (nice_rlim
<= p
->signal
->rlim
[RLIMIT_NICE
].rlim_cur
||
4551 capable(CAP_SYS_NICE
));
4554 #ifdef __ARCH_WANT_SYS_NICE
4557 * sys_nice - change the priority of the current process.
4558 * @increment: priority increment
4560 * sys_setpriority is a more generic, but much slower function that
4561 * does similar things.
4563 asmlinkage
long sys_nice(int increment
)
4568 * Setpriority might change our priority at the same moment.
4569 * We don't have to worry. Conceptually one call occurs first
4570 * and we have a single winner.
4572 if (increment
< -40)
4577 nice
= PRIO_TO_NICE(current
->static_prio
) + increment
;
4583 if (increment
< 0 && !can_nice(current
, nice
))
4586 retval
= security_task_setnice(current
, nice
);
4590 set_user_nice(current
, nice
);
4597 * task_prio - return the priority value of a given task.
4598 * @p: the task in question.
4600 * This is the priority value as seen by users in /proc.
4601 * RT tasks are offset by -200. Normal tasks are centered
4602 * around 0, value goes from -16 to +15.
4604 int task_prio(const struct task_struct
*p
)
4606 return p
->prio
- MAX_RT_PRIO
;
4610 * task_nice - return the nice value of a given task.
4611 * @p: the task in question.
4613 int task_nice(const struct task_struct
*p
)
4615 return TASK_NICE(p
);
4617 EXPORT_SYMBOL(task_nice
);
4620 * idle_cpu - is a given cpu idle currently?
4621 * @cpu: the processor in question.
4623 int idle_cpu(int cpu
)
4625 return cpu_curr(cpu
) == cpu_rq(cpu
)->idle
;
4629 * idle_task - return the idle task for a given cpu.
4630 * @cpu: the processor in question.
4632 struct task_struct
*idle_task(int cpu
)
4634 return cpu_rq(cpu
)->idle
;
4638 * find_process_by_pid - find a process with a matching PID value.
4639 * @pid: the pid in question.
4641 static struct task_struct
*find_process_by_pid(pid_t pid
)
4643 return pid
? find_task_by_vpid(pid
) : current
;
4646 /* Actually do priority change: must hold rq lock. */
4648 __setscheduler(struct rq
*rq
, struct task_struct
*p
, int policy
, int prio
)
4650 BUG_ON(p
->se
.on_rq
);
4653 switch (p
->policy
) {
4657 p
->sched_class
= &fair_sched_class
;
4661 p
->sched_class
= &rt_sched_class
;
4665 p
->rt_priority
= prio
;
4666 p
->normal_prio
= normal_prio(p
);
4667 /* we are holding p->pi_lock already */
4668 p
->prio
= rt_mutex_getprio(p
);
4673 * sched_setscheduler - change the scheduling policy and/or RT priority of a thread.
4674 * @p: the task in question.
4675 * @policy: new policy.
4676 * @param: structure containing the new RT priority.
4678 * NOTE that the task may be already dead.
4680 int sched_setscheduler(struct task_struct
*p
, int policy
,
4681 struct sched_param
*param
)
4683 int retval
, oldprio
, oldpolicy
= -1, on_rq
, running
;
4684 unsigned long flags
;
4685 const struct sched_class
*prev_class
= p
->sched_class
;
4688 /* may grab non-irq protected spin_locks */
4689 BUG_ON(in_interrupt());
4691 /* double check policy once rq lock held */
4693 policy
= oldpolicy
= p
->policy
;
4694 else if (policy
!= SCHED_FIFO
&& policy
!= SCHED_RR
&&
4695 policy
!= SCHED_NORMAL
&& policy
!= SCHED_BATCH
&&
4696 policy
!= SCHED_IDLE
)
4699 * Valid priorities for SCHED_FIFO and SCHED_RR are
4700 * 1..MAX_USER_RT_PRIO-1, valid priority for SCHED_NORMAL,
4701 * SCHED_BATCH and SCHED_IDLE is 0.
4703 if (param
->sched_priority
< 0 ||
4704 (p
->mm
&& param
->sched_priority
> MAX_USER_RT_PRIO
-1) ||
4705 (!p
->mm
&& param
->sched_priority
> MAX_RT_PRIO
-1))
4707 if (rt_policy(policy
) != (param
->sched_priority
!= 0))
4711 * Allow unprivileged RT tasks to decrease priority:
4713 if (!capable(CAP_SYS_NICE
)) {
4714 if (rt_policy(policy
)) {
4715 unsigned long rlim_rtprio
;
4717 if (!lock_task_sighand(p
, &flags
))
4719 rlim_rtprio
= p
->signal
->rlim
[RLIMIT_RTPRIO
].rlim_cur
;
4720 unlock_task_sighand(p
, &flags
);
4722 /* can't set/change the rt policy */
4723 if (policy
!= p
->policy
&& !rlim_rtprio
)
4726 /* can't increase priority */
4727 if (param
->sched_priority
> p
->rt_priority
&&
4728 param
->sched_priority
> rlim_rtprio
)
4732 * Like positive nice levels, dont allow tasks to
4733 * move out of SCHED_IDLE either:
4735 if (p
->policy
== SCHED_IDLE
&& policy
!= SCHED_IDLE
)
4738 /* can't change other user's priorities */
4739 if ((current
->euid
!= p
->euid
) &&
4740 (current
->euid
!= p
->uid
))
4744 #ifdef CONFIG_RT_GROUP_SCHED
4746 * Do not allow realtime tasks into groups that have no runtime
4749 if (rt_policy(policy
) && task_group(p
)->rt_bandwidth
.rt_runtime
== 0)
4753 retval
= security_task_setscheduler(p
, policy
, param
);
4757 * make sure no PI-waiters arrive (or leave) while we are
4758 * changing the priority of the task:
4760 spin_lock_irqsave(&p
->pi_lock
, flags
);
4762 * To be able to change p->policy safely, the apropriate
4763 * runqueue lock must be held.
4765 rq
= __task_rq_lock(p
);
4766 /* recheck policy now with rq lock held */
4767 if (unlikely(oldpolicy
!= -1 && oldpolicy
!= p
->policy
)) {
4768 policy
= oldpolicy
= -1;
4769 __task_rq_unlock(rq
);
4770 spin_unlock_irqrestore(&p
->pi_lock
, flags
);
4773 update_rq_clock(rq
);
4774 on_rq
= p
->se
.on_rq
;
4775 running
= task_current(rq
, p
);
4777 deactivate_task(rq
, p
, 0);
4779 p
->sched_class
->put_prev_task(rq
, p
);
4782 __setscheduler(rq
, p
, policy
, param
->sched_priority
);
4785 p
->sched_class
->set_curr_task(rq
);
4787 activate_task(rq
, p
, 0);
4789 check_class_changed(rq
, p
, prev_class
, oldprio
, running
);
4791 __task_rq_unlock(rq
);
4792 spin_unlock_irqrestore(&p
->pi_lock
, flags
);
4794 rt_mutex_adjust_pi(p
);
4798 EXPORT_SYMBOL_GPL(sched_setscheduler
);
4801 do_sched_setscheduler(pid_t pid
, int policy
, struct sched_param __user
*param
)
4803 struct sched_param lparam
;
4804 struct task_struct
*p
;
4807 if (!param
|| pid
< 0)
4809 if (copy_from_user(&lparam
, param
, sizeof(struct sched_param
)))
4814 p
= find_process_by_pid(pid
);
4816 retval
= sched_setscheduler(p
, policy
, &lparam
);
4823 * sys_sched_setscheduler - set/change the scheduler policy and RT priority
4824 * @pid: the pid in question.
4825 * @policy: new policy.
4826 * @param: structure containing the new RT priority.
4829 sys_sched_setscheduler(pid_t pid
, int policy
, struct sched_param __user
*param
)
4831 /* negative values for policy are not valid */
4835 return do_sched_setscheduler(pid
, policy
, param
);
4839 * sys_sched_setparam - set/change the RT priority of a thread
4840 * @pid: the pid in question.
4841 * @param: structure containing the new RT priority.
4843 asmlinkage
long sys_sched_setparam(pid_t pid
, struct sched_param __user
*param
)
4845 return do_sched_setscheduler(pid
, -1, param
);
4849 * sys_sched_getscheduler - get the policy (scheduling class) of a thread
4850 * @pid: the pid in question.
4852 asmlinkage
long sys_sched_getscheduler(pid_t pid
)
4854 struct task_struct
*p
;
4861 read_lock(&tasklist_lock
);
4862 p
= find_process_by_pid(pid
);
4864 retval
= security_task_getscheduler(p
);
4868 read_unlock(&tasklist_lock
);
4873 * sys_sched_getscheduler - get the RT priority of a thread
4874 * @pid: the pid in question.
4875 * @param: structure containing the RT priority.
4877 asmlinkage
long sys_sched_getparam(pid_t pid
, struct sched_param __user
*param
)
4879 struct sched_param lp
;
4880 struct task_struct
*p
;
4883 if (!param
|| pid
< 0)
4886 read_lock(&tasklist_lock
);
4887 p
= find_process_by_pid(pid
);
4892 retval
= security_task_getscheduler(p
);
4896 lp
.sched_priority
= p
->rt_priority
;
4897 read_unlock(&tasklist_lock
);
4900 * This one might sleep, we cannot do it with a spinlock held ...
4902 retval
= copy_to_user(param
, &lp
, sizeof(*param
)) ? -EFAULT
: 0;
4907 read_unlock(&tasklist_lock
);
4911 long sched_setaffinity(pid_t pid
, cpumask_t new_mask
)
4913 cpumask_t cpus_allowed
;
4914 struct task_struct
*p
;
4918 read_lock(&tasklist_lock
);
4920 p
= find_process_by_pid(pid
);
4922 read_unlock(&tasklist_lock
);
4928 * It is not safe to call set_cpus_allowed with the
4929 * tasklist_lock held. We will bump the task_struct's
4930 * usage count and then drop tasklist_lock.
4933 read_unlock(&tasklist_lock
);
4936 if ((current
->euid
!= p
->euid
) && (current
->euid
!= p
->uid
) &&
4937 !capable(CAP_SYS_NICE
))
4940 retval
= security_task_setscheduler(p
, 0, NULL
);
4944 cpus_allowed
= cpuset_cpus_allowed(p
);
4945 cpus_and(new_mask
, new_mask
, cpus_allowed
);
4947 retval
= set_cpus_allowed(p
, new_mask
);
4950 cpus_allowed
= cpuset_cpus_allowed(p
);
4951 if (!cpus_subset(new_mask
, cpus_allowed
)) {
4953 * We must have raced with a concurrent cpuset
4954 * update. Just reset the cpus_allowed to the
4955 * cpuset's cpus_allowed
4957 new_mask
= cpus_allowed
;
4967 static int get_user_cpu_mask(unsigned long __user
*user_mask_ptr
, unsigned len
,
4968 cpumask_t
*new_mask
)
4970 if (len
< sizeof(cpumask_t
)) {
4971 memset(new_mask
, 0, sizeof(cpumask_t
));
4972 } else if (len
> sizeof(cpumask_t
)) {
4973 len
= sizeof(cpumask_t
);
4975 return copy_from_user(new_mask
, user_mask_ptr
, len
) ? -EFAULT
: 0;
4979 * sys_sched_setaffinity - set 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 the new cpu mask
4984 asmlinkage
long sys_sched_setaffinity(pid_t pid
, unsigned int len
,
4985 unsigned long __user
*user_mask_ptr
)
4990 retval
= get_user_cpu_mask(user_mask_ptr
, len
, &new_mask
);
4994 return sched_setaffinity(pid
, new_mask
);
4998 * Represents all cpu's present in the system
4999 * In systems capable of hotplug, this map could dynamically grow
5000 * as new cpu's are detected in the system via any platform specific
5001 * method, such as ACPI for e.g.
5004 cpumask_t cpu_present_map __read_mostly
;
5005 EXPORT_SYMBOL(cpu_present_map
);
5008 cpumask_t cpu_online_map __read_mostly
= CPU_MASK_ALL
;
5009 EXPORT_SYMBOL(cpu_online_map
);
5011 cpumask_t cpu_possible_map __read_mostly
= CPU_MASK_ALL
;
5012 EXPORT_SYMBOL(cpu_possible_map
);
5015 long sched_getaffinity(pid_t pid
, cpumask_t
*mask
)
5017 struct task_struct
*p
;
5021 read_lock(&tasklist_lock
);
5024 p
= find_process_by_pid(pid
);
5028 retval
= security_task_getscheduler(p
);
5032 cpus_and(*mask
, p
->cpus_allowed
, cpu_online_map
);
5035 read_unlock(&tasklist_lock
);
5042 * sys_sched_getaffinity - get the cpu affinity of a process
5043 * @pid: pid of the process
5044 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
5045 * @user_mask_ptr: user-space pointer to hold the current cpu mask
5047 asmlinkage
long sys_sched_getaffinity(pid_t pid
, unsigned int len
,
5048 unsigned long __user
*user_mask_ptr
)
5053 if (len
< sizeof(cpumask_t
))
5056 ret
= sched_getaffinity(pid
, &mask
);
5060 if (copy_to_user(user_mask_ptr
, &mask
, sizeof(cpumask_t
)))
5063 return sizeof(cpumask_t
);
5067 * sys_sched_yield - yield the current processor to other threads.
5069 * This function yields the current CPU to other tasks. If there are no
5070 * other threads running on this CPU then this function will return.
5072 asmlinkage
long sys_sched_yield(void)
5074 struct rq
*rq
= this_rq_lock();
5076 schedstat_inc(rq
, yld_count
);
5077 current
->sched_class
->yield_task(rq
);
5080 * Since we are going to call schedule() anyway, there's
5081 * no need to preempt or enable interrupts:
5083 __release(rq
->lock
);
5084 spin_release(&rq
->lock
.dep_map
, 1, _THIS_IP_
);
5085 _raw_spin_unlock(&rq
->lock
);
5086 preempt_enable_no_resched();
5093 static void __cond_resched(void)
5095 #ifdef CONFIG_DEBUG_SPINLOCK_SLEEP
5096 __might_sleep(__FILE__
, __LINE__
);
5099 * The BKS might be reacquired before we have dropped
5100 * PREEMPT_ACTIVE, which could trigger a second
5101 * cond_resched() call.
5104 add_preempt_count(PREEMPT_ACTIVE
);
5106 sub_preempt_count(PREEMPT_ACTIVE
);
5107 } while (need_resched());
5110 #if !defined(CONFIG_PREEMPT) || defined(CONFIG_PREEMPT_VOLUNTARY)
5111 int __sched
_cond_resched(void)
5113 if (need_resched() && !(preempt_count() & PREEMPT_ACTIVE
) &&
5114 system_state
== SYSTEM_RUNNING
) {
5120 EXPORT_SYMBOL(_cond_resched
);
5124 * cond_resched_lock() - if a reschedule is pending, drop the given lock,
5125 * call schedule, and on return reacquire the lock.
5127 * This works OK both with and without CONFIG_PREEMPT. We do strange low-level
5128 * operations here to prevent schedule() from being called twice (once via
5129 * spin_unlock(), once by hand).
5131 int cond_resched_lock(spinlock_t
*lock
)
5133 int resched
= need_resched() && system_state
== SYSTEM_RUNNING
;
5136 if (spin_needbreak(lock
) || resched
) {
5138 if (resched
&& need_resched())
5147 EXPORT_SYMBOL(cond_resched_lock
);
5149 int __sched
cond_resched_softirq(void)
5151 BUG_ON(!in_softirq());
5153 if (need_resched() && system_state
== SYSTEM_RUNNING
) {
5161 EXPORT_SYMBOL(cond_resched_softirq
);
5164 * yield - yield the current processor to other threads.
5166 * This is a shortcut for kernel-space yielding - it marks the
5167 * thread runnable and calls sys_sched_yield().
5169 void __sched
yield(void)
5171 set_current_state(TASK_RUNNING
);
5174 EXPORT_SYMBOL(yield
);
5177 * This task is about to go to sleep on IO. Increment rq->nr_iowait so
5178 * that process accounting knows that this is a task in IO wait state.
5180 * But don't do that if it is a deliberate, throttling IO wait (this task
5181 * has set its backing_dev_info: the queue against which it should throttle)
5183 void __sched
io_schedule(void)
5185 struct rq
*rq
= &__raw_get_cpu_var(runqueues
);
5187 delayacct_blkio_start();
5188 atomic_inc(&rq
->nr_iowait
);
5190 atomic_dec(&rq
->nr_iowait
);
5191 delayacct_blkio_end();
5193 EXPORT_SYMBOL(io_schedule
);
5195 long __sched
io_schedule_timeout(long timeout
)
5197 struct rq
*rq
= &__raw_get_cpu_var(runqueues
);
5200 delayacct_blkio_start();
5201 atomic_inc(&rq
->nr_iowait
);
5202 ret
= schedule_timeout(timeout
);
5203 atomic_dec(&rq
->nr_iowait
);
5204 delayacct_blkio_end();
5209 * sys_sched_get_priority_max - return maximum RT priority.
5210 * @policy: scheduling class.
5212 * this syscall returns the maximum rt_priority that can be used
5213 * by a given scheduling class.
5215 asmlinkage
long sys_sched_get_priority_max(int policy
)
5222 ret
= MAX_USER_RT_PRIO
-1;
5234 * sys_sched_get_priority_min - return minimum RT priority.
5235 * @policy: scheduling class.
5237 * this syscall returns the minimum rt_priority that can be used
5238 * by a given scheduling class.
5240 asmlinkage
long sys_sched_get_priority_min(int policy
)
5258 * sys_sched_rr_get_interval - return the default timeslice of a process.
5259 * @pid: pid of the process.
5260 * @interval: userspace pointer to the timeslice value.
5262 * this syscall writes the default timeslice value of a given process
5263 * into the user-space timespec buffer. A value of '0' means infinity.
5266 long sys_sched_rr_get_interval(pid_t pid
, struct timespec __user
*interval
)
5268 struct task_struct
*p
;
5269 unsigned int time_slice
;
5277 read_lock(&tasklist_lock
);
5278 p
= find_process_by_pid(pid
);
5282 retval
= security_task_getscheduler(p
);
5287 * Time slice is 0 for SCHED_FIFO tasks and for SCHED_OTHER
5288 * tasks that are on an otherwise idle runqueue:
5291 if (p
->policy
== SCHED_RR
) {
5292 time_slice
= DEF_TIMESLICE
;
5293 } else if (p
->policy
!= SCHED_FIFO
) {
5294 struct sched_entity
*se
= &p
->se
;
5295 unsigned long flags
;
5298 rq
= task_rq_lock(p
, &flags
);
5299 if (rq
->cfs
.load
.weight
)
5300 time_slice
= NS_TO_JIFFIES(sched_slice(&rq
->cfs
, se
));
5301 task_rq_unlock(rq
, &flags
);
5303 read_unlock(&tasklist_lock
);
5304 jiffies_to_timespec(time_slice
, &t
);
5305 retval
= copy_to_user(interval
, &t
, sizeof(t
)) ? -EFAULT
: 0;
5309 read_unlock(&tasklist_lock
);
5313 static const char stat_nam
[] = "RSDTtZX";
5315 void sched_show_task(struct task_struct
*p
)
5317 unsigned long free
= 0;
5320 state
= p
->state
? __ffs(p
->state
) + 1 : 0;
5321 printk(KERN_INFO
"%-13.13s %c", p
->comm
,
5322 state
< sizeof(stat_nam
) - 1 ? stat_nam
[state
] : '?');
5323 #if BITS_PER_LONG == 32
5324 if (state
== TASK_RUNNING
)
5325 printk(KERN_CONT
" running ");
5327 printk(KERN_CONT
" %08lx ", thread_saved_pc(p
));
5329 if (state
== TASK_RUNNING
)
5330 printk(KERN_CONT
" running task ");
5332 printk(KERN_CONT
" %016lx ", thread_saved_pc(p
));
5334 #ifdef CONFIG_DEBUG_STACK_USAGE
5336 unsigned long *n
= end_of_stack(p
);
5339 free
= (unsigned long)n
- (unsigned long)end_of_stack(p
);
5342 printk(KERN_CONT
"%5lu %5d %6d\n", free
,
5343 task_pid_nr(p
), task_pid_nr(p
->real_parent
));
5345 show_stack(p
, NULL
);
5348 void show_state_filter(unsigned long state_filter
)
5350 struct task_struct
*g
, *p
;
5352 #if BITS_PER_LONG == 32
5354 " task PC stack pid father\n");
5357 " task PC stack pid father\n");
5359 read_lock(&tasklist_lock
);
5360 do_each_thread(g
, p
) {
5362 * reset the NMI-timeout, listing all files on a slow
5363 * console might take alot of time:
5365 touch_nmi_watchdog();
5366 if (!state_filter
|| (p
->state
& state_filter
))
5368 } while_each_thread(g
, p
);
5370 touch_all_softlockup_watchdogs();
5372 #ifdef CONFIG_SCHED_DEBUG
5373 sysrq_sched_debug_show();
5375 read_unlock(&tasklist_lock
);
5377 * Only show locks if all tasks are dumped:
5379 if (state_filter
== -1)
5380 debug_show_all_locks();
5383 void __cpuinit
init_idle_bootup_task(struct task_struct
*idle
)
5385 idle
->sched_class
= &idle_sched_class
;
5389 * init_idle - set up an idle thread for a given CPU
5390 * @idle: task in question
5391 * @cpu: cpu the idle task belongs to
5393 * NOTE: this function does not set the idle thread's NEED_RESCHED
5394 * flag, to make booting more robust.
5396 void __cpuinit
init_idle(struct task_struct
*idle
, int cpu
)
5398 struct rq
*rq
= cpu_rq(cpu
);
5399 unsigned long flags
;
5402 idle
->se
.exec_start
= sched_clock();
5404 idle
->prio
= idle
->normal_prio
= MAX_PRIO
;
5405 idle
->cpus_allowed
= cpumask_of_cpu(cpu
);
5406 __set_task_cpu(idle
, cpu
);
5408 spin_lock_irqsave(&rq
->lock
, flags
);
5409 rq
->curr
= rq
->idle
= idle
;
5410 #if defined(CONFIG_SMP) && defined(__ARCH_WANT_UNLOCKED_CTXSW)
5413 spin_unlock_irqrestore(&rq
->lock
, flags
);
5415 /* Set the preempt count _outside_ the spinlocks! */
5416 task_thread_info(idle
)->preempt_count
= 0;
5419 * The idle tasks have their own, simple scheduling class:
5421 idle
->sched_class
= &idle_sched_class
;
5425 * In a system that switches off the HZ timer nohz_cpu_mask
5426 * indicates which cpus entered this state. This is used
5427 * in the rcu update to wait only for active cpus. For system
5428 * which do not switch off the HZ timer nohz_cpu_mask should
5429 * always be CPU_MASK_NONE.
5431 cpumask_t nohz_cpu_mask
= CPU_MASK_NONE
;
5434 * Increase the granularity value when there are more CPUs,
5435 * because with more CPUs the 'effective latency' as visible
5436 * to users decreases. But the relationship is not linear,
5437 * so pick a second-best guess by going with the log2 of the
5440 * This idea comes from the SD scheduler of Con Kolivas:
5442 static inline void sched_init_granularity(void)
5444 unsigned int factor
= 1 + ilog2(num_online_cpus());
5445 const unsigned long limit
= 200000000;
5447 sysctl_sched_min_granularity
*= factor
;
5448 if (sysctl_sched_min_granularity
> limit
)
5449 sysctl_sched_min_granularity
= limit
;
5451 sysctl_sched_latency
*= factor
;
5452 if (sysctl_sched_latency
> limit
)
5453 sysctl_sched_latency
= limit
;
5455 sysctl_sched_wakeup_granularity
*= factor
;
5460 * This is how migration works:
5462 * 1) we queue a struct migration_req structure in the source CPU's
5463 * runqueue and wake up that CPU's migration thread.
5464 * 2) we down() the locked semaphore => thread blocks.
5465 * 3) migration thread wakes up (implicitly it forces the migrated
5466 * thread off the CPU)
5467 * 4) it gets the migration request and checks whether the migrated
5468 * task is still in the wrong runqueue.
5469 * 5) if it's in the wrong runqueue then the migration thread removes
5470 * it and puts it into the right queue.
5471 * 6) migration thread up()s the semaphore.
5472 * 7) we wake up and the migration is done.
5476 * Change a given task's CPU affinity. Migrate the thread to a
5477 * proper CPU and schedule it away if the CPU it's executing on
5478 * is removed from the allowed bitmask.
5480 * NOTE: the caller must have a valid reference to the task, the
5481 * task must not exit() & deallocate itself prematurely. The
5482 * call is not atomic; no spinlocks may be held.
5484 int set_cpus_allowed(struct task_struct
*p
, cpumask_t new_mask
)
5486 struct migration_req req
;
5487 unsigned long flags
;
5491 rq
= task_rq_lock(p
, &flags
);
5492 if (!cpus_intersects(new_mask
, cpu_online_map
)) {
5497 if (p
->sched_class
->set_cpus_allowed
)
5498 p
->sched_class
->set_cpus_allowed(p
, &new_mask
);
5500 p
->cpus_allowed
= new_mask
;
5501 p
->rt
.nr_cpus_allowed
= cpus_weight(new_mask
);
5504 /* Can the task run on the task's current CPU? If so, we're done */
5505 if (cpu_isset(task_cpu(p
), new_mask
))
5508 if (migrate_task(p
, any_online_cpu(new_mask
), &req
)) {
5509 /* Need help from migration thread: drop lock and wait. */
5510 task_rq_unlock(rq
, &flags
);
5511 wake_up_process(rq
->migration_thread
);
5512 wait_for_completion(&req
.done
);
5513 tlb_migrate_finish(p
->mm
);
5517 task_rq_unlock(rq
, &flags
);
5521 EXPORT_SYMBOL_GPL(set_cpus_allowed
);
5524 * Move (not current) task off this cpu, onto dest cpu. We're doing
5525 * this because either it can't run here any more (set_cpus_allowed()
5526 * away from this CPU, or CPU going down), or because we're
5527 * attempting to rebalance this task on exec (sched_exec).
5529 * So we race with normal scheduler movements, but that's OK, as long
5530 * as the task is no longer on this CPU.
5532 * Returns non-zero if task was successfully migrated.
5534 static int __migrate_task(struct task_struct
*p
, int src_cpu
, int dest_cpu
)
5536 struct rq
*rq_dest
, *rq_src
;
5539 if (unlikely(cpu_is_offline(dest_cpu
)))
5542 rq_src
= cpu_rq(src_cpu
);
5543 rq_dest
= cpu_rq(dest_cpu
);
5545 double_rq_lock(rq_src
, rq_dest
);
5546 /* Already moved. */
5547 if (task_cpu(p
) != src_cpu
)
5549 /* Affinity changed (again). */
5550 if (!cpu_isset(dest_cpu
, p
->cpus_allowed
))
5553 on_rq
= p
->se
.on_rq
;
5555 deactivate_task(rq_src
, p
, 0);
5557 set_task_cpu(p
, dest_cpu
);
5559 activate_task(rq_dest
, p
, 0);
5560 check_preempt_curr(rq_dest
, p
);
5564 double_rq_unlock(rq_src
, rq_dest
);
5569 * migration_thread - this is a highprio system thread that performs
5570 * thread migration by bumping thread off CPU then 'pushing' onto
5573 static int migration_thread(void *data
)
5575 int cpu
= (long)data
;
5579 BUG_ON(rq
->migration_thread
!= current
);
5581 set_current_state(TASK_INTERRUPTIBLE
);
5582 while (!kthread_should_stop()) {
5583 struct migration_req
*req
;
5584 struct list_head
*head
;
5586 spin_lock_irq(&rq
->lock
);
5588 if (cpu_is_offline(cpu
)) {
5589 spin_unlock_irq(&rq
->lock
);
5593 if (rq
->active_balance
) {
5594 active_load_balance(rq
, cpu
);
5595 rq
->active_balance
= 0;
5598 head
= &rq
->migration_queue
;
5600 if (list_empty(head
)) {
5601 spin_unlock_irq(&rq
->lock
);
5603 set_current_state(TASK_INTERRUPTIBLE
);
5606 req
= list_entry(head
->next
, struct migration_req
, list
);
5607 list_del_init(head
->next
);
5609 spin_unlock(&rq
->lock
);
5610 __migrate_task(req
->task
, cpu
, req
->dest_cpu
);
5613 complete(&req
->done
);
5615 __set_current_state(TASK_RUNNING
);
5619 /* Wait for kthread_stop */
5620 set_current_state(TASK_INTERRUPTIBLE
);
5621 while (!kthread_should_stop()) {
5623 set_current_state(TASK_INTERRUPTIBLE
);
5625 __set_current_state(TASK_RUNNING
);
5629 #ifdef CONFIG_HOTPLUG_CPU
5631 static int __migrate_task_irq(struct task_struct
*p
, int src_cpu
, int dest_cpu
)
5635 local_irq_disable();
5636 ret
= __migrate_task(p
, src_cpu
, dest_cpu
);
5642 * Figure out where task on dead CPU should go, use force if necessary.
5643 * NOTE: interrupts should be disabled by the caller
5645 static void move_task_off_dead_cpu(int dead_cpu
, struct task_struct
*p
)
5647 unsigned long flags
;
5654 mask
= node_to_cpumask(cpu_to_node(dead_cpu
));
5655 cpus_and(mask
, mask
, p
->cpus_allowed
);
5656 dest_cpu
= any_online_cpu(mask
);
5658 /* On any allowed CPU? */
5659 if (dest_cpu
>= nr_cpu_ids
)
5660 dest_cpu
= any_online_cpu(p
->cpus_allowed
);
5662 /* No more Mr. Nice Guy. */
5663 if (dest_cpu
>= nr_cpu_ids
) {
5664 cpumask_t cpus_allowed
= cpuset_cpus_allowed_locked(p
);
5666 * Try to stay on the same cpuset, where the
5667 * current cpuset may be a subset of all cpus.
5668 * The cpuset_cpus_allowed_locked() variant of
5669 * cpuset_cpus_allowed() will not block. It must be
5670 * called within calls to cpuset_lock/cpuset_unlock.
5672 rq
= task_rq_lock(p
, &flags
);
5673 p
->cpus_allowed
= cpus_allowed
;
5674 dest_cpu
= any_online_cpu(p
->cpus_allowed
);
5675 task_rq_unlock(rq
, &flags
);
5678 * Don't tell them about moving exiting tasks or
5679 * kernel threads (both mm NULL), since they never
5682 if (p
->mm
&& printk_ratelimit()) {
5683 printk(KERN_INFO
"process %d (%s) no "
5684 "longer affine to cpu%d\n",
5685 task_pid_nr(p
), p
->comm
, dead_cpu
);
5688 } while (!__migrate_task_irq(p
, dead_cpu
, dest_cpu
));
5692 * While a dead CPU has no uninterruptible tasks queued at this point,
5693 * it might still have a nonzero ->nr_uninterruptible counter, because
5694 * for performance reasons the counter is not stricly tracking tasks to
5695 * their home CPUs. So we just add the counter to another CPU's counter,
5696 * to keep the global sum constant after CPU-down:
5698 static void migrate_nr_uninterruptible(struct rq
*rq_src
)
5700 struct rq
*rq_dest
= cpu_rq(any_online_cpu(CPU_MASK_ALL
));
5701 unsigned long flags
;
5703 local_irq_save(flags
);
5704 double_rq_lock(rq_src
, rq_dest
);
5705 rq_dest
->nr_uninterruptible
+= rq_src
->nr_uninterruptible
;
5706 rq_src
->nr_uninterruptible
= 0;
5707 double_rq_unlock(rq_src
, rq_dest
);
5708 local_irq_restore(flags
);
5711 /* Run through task list and migrate tasks from the dead cpu. */
5712 static void migrate_live_tasks(int src_cpu
)
5714 struct task_struct
*p
, *t
;
5716 read_lock(&tasklist_lock
);
5718 do_each_thread(t
, p
) {
5722 if (task_cpu(p
) == src_cpu
)
5723 move_task_off_dead_cpu(src_cpu
, p
);
5724 } while_each_thread(t
, p
);
5726 read_unlock(&tasklist_lock
);
5730 * Schedules idle task to be the next runnable task on current CPU.
5731 * It does so by boosting its priority to highest possible.
5732 * Used by CPU offline code.
5734 void sched_idle_next(void)
5736 int this_cpu
= smp_processor_id();
5737 struct rq
*rq
= cpu_rq(this_cpu
);
5738 struct task_struct
*p
= rq
->idle
;
5739 unsigned long flags
;
5741 /* cpu has to be offline */
5742 BUG_ON(cpu_online(this_cpu
));
5745 * Strictly not necessary since rest of the CPUs are stopped by now
5746 * and interrupts disabled on the current cpu.
5748 spin_lock_irqsave(&rq
->lock
, flags
);
5750 __setscheduler(rq
, p
, SCHED_FIFO
, MAX_RT_PRIO
-1);
5752 update_rq_clock(rq
);
5753 activate_task(rq
, p
, 0);
5755 spin_unlock_irqrestore(&rq
->lock
, flags
);
5759 * Ensures that the idle task is using init_mm right before its cpu goes
5762 void idle_task_exit(void)
5764 struct mm_struct
*mm
= current
->active_mm
;
5766 BUG_ON(cpu_online(smp_processor_id()));
5769 switch_mm(mm
, &init_mm
, current
);
5773 /* called under rq->lock with disabled interrupts */
5774 static void migrate_dead(unsigned int dead_cpu
, struct task_struct
*p
)
5776 struct rq
*rq
= cpu_rq(dead_cpu
);
5778 /* Must be exiting, otherwise would be on tasklist. */
5779 BUG_ON(!p
->exit_state
);
5781 /* Cannot have done final schedule yet: would have vanished. */
5782 BUG_ON(p
->state
== TASK_DEAD
);
5787 * Drop lock around migration; if someone else moves it,
5788 * that's OK. No task can be added to this CPU, so iteration is
5791 spin_unlock_irq(&rq
->lock
);
5792 move_task_off_dead_cpu(dead_cpu
, p
);
5793 spin_lock_irq(&rq
->lock
);
5798 /* release_task() removes task from tasklist, so we won't find dead tasks. */
5799 static void migrate_dead_tasks(unsigned int dead_cpu
)
5801 struct rq
*rq
= cpu_rq(dead_cpu
);
5802 struct task_struct
*next
;
5805 if (!rq
->nr_running
)
5807 update_rq_clock(rq
);
5808 next
= pick_next_task(rq
, rq
->curr
);
5811 migrate_dead(dead_cpu
, next
);
5815 #endif /* CONFIG_HOTPLUG_CPU */
5817 #if defined(CONFIG_SCHED_DEBUG) && defined(CONFIG_SYSCTL)
5819 static struct ctl_table sd_ctl_dir
[] = {
5821 .procname
= "sched_domain",
5827 static struct ctl_table sd_ctl_root
[] = {
5829 .ctl_name
= CTL_KERN
,
5830 .procname
= "kernel",
5832 .child
= sd_ctl_dir
,
5837 static struct ctl_table
*sd_alloc_ctl_entry(int n
)
5839 struct ctl_table
*entry
=
5840 kcalloc(n
, sizeof(struct ctl_table
), GFP_KERNEL
);
5845 static void sd_free_ctl_entry(struct ctl_table
**tablep
)
5847 struct ctl_table
*entry
;
5850 * In the intermediate directories, both the child directory and
5851 * procname are dynamically allocated and could fail but the mode
5852 * will always be set. In the lowest directory the names are
5853 * static strings and all have proc handlers.
5855 for (entry
= *tablep
; entry
->mode
; entry
++) {
5857 sd_free_ctl_entry(&entry
->child
);
5858 if (entry
->proc_handler
== NULL
)
5859 kfree(entry
->procname
);
5867 set_table_entry(struct ctl_table
*entry
,
5868 const char *procname
, void *data
, int maxlen
,
5869 mode_t mode
, proc_handler
*proc_handler
)
5871 entry
->procname
= procname
;
5873 entry
->maxlen
= maxlen
;
5875 entry
->proc_handler
= proc_handler
;
5878 static struct ctl_table
*
5879 sd_alloc_ctl_domain_table(struct sched_domain
*sd
)
5881 struct ctl_table
*table
= sd_alloc_ctl_entry(12);
5886 set_table_entry(&table
[0], "min_interval", &sd
->min_interval
,
5887 sizeof(long), 0644, proc_doulongvec_minmax
);
5888 set_table_entry(&table
[1], "max_interval", &sd
->max_interval
,
5889 sizeof(long), 0644, proc_doulongvec_minmax
);
5890 set_table_entry(&table
[2], "busy_idx", &sd
->busy_idx
,
5891 sizeof(int), 0644, proc_dointvec_minmax
);
5892 set_table_entry(&table
[3], "idle_idx", &sd
->idle_idx
,
5893 sizeof(int), 0644, proc_dointvec_minmax
);
5894 set_table_entry(&table
[4], "newidle_idx", &sd
->newidle_idx
,
5895 sizeof(int), 0644, proc_dointvec_minmax
);
5896 set_table_entry(&table
[5], "wake_idx", &sd
->wake_idx
,
5897 sizeof(int), 0644, proc_dointvec_minmax
);
5898 set_table_entry(&table
[6], "forkexec_idx", &sd
->forkexec_idx
,
5899 sizeof(int), 0644, proc_dointvec_minmax
);
5900 set_table_entry(&table
[7], "busy_factor", &sd
->busy_factor
,
5901 sizeof(int), 0644, proc_dointvec_minmax
);
5902 set_table_entry(&table
[8], "imbalance_pct", &sd
->imbalance_pct
,
5903 sizeof(int), 0644, proc_dointvec_minmax
);
5904 set_table_entry(&table
[9], "cache_nice_tries",
5905 &sd
->cache_nice_tries
,
5906 sizeof(int), 0644, proc_dointvec_minmax
);
5907 set_table_entry(&table
[10], "flags", &sd
->flags
,
5908 sizeof(int), 0644, proc_dointvec_minmax
);
5909 /* &table[11] is terminator */
5914 static ctl_table
*sd_alloc_ctl_cpu_table(int cpu
)
5916 struct ctl_table
*entry
, *table
;
5917 struct sched_domain
*sd
;
5918 int domain_num
= 0, i
;
5921 for_each_domain(cpu
, sd
)
5923 entry
= table
= sd_alloc_ctl_entry(domain_num
+ 1);
5928 for_each_domain(cpu
, sd
) {
5929 snprintf(buf
, 32, "domain%d", i
);
5930 entry
->procname
= kstrdup(buf
, GFP_KERNEL
);
5932 entry
->child
= sd_alloc_ctl_domain_table(sd
);
5939 static struct ctl_table_header
*sd_sysctl_header
;
5940 static void register_sched_domain_sysctl(void)
5942 int i
, cpu_num
= num_online_cpus();
5943 struct ctl_table
*entry
= sd_alloc_ctl_entry(cpu_num
+ 1);
5946 WARN_ON(sd_ctl_dir
[0].child
);
5947 sd_ctl_dir
[0].child
= entry
;
5952 for_each_online_cpu(i
) {
5953 snprintf(buf
, 32, "cpu%d", i
);
5954 entry
->procname
= kstrdup(buf
, GFP_KERNEL
);
5956 entry
->child
= sd_alloc_ctl_cpu_table(i
);
5960 WARN_ON(sd_sysctl_header
);
5961 sd_sysctl_header
= register_sysctl_table(sd_ctl_root
);
5964 /* may be called multiple times per register */
5965 static void unregister_sched_domain_sysctl(void)
5967 if (sd_sysctl_header
)
5968 unregister_sysctl_table(sd_sysctl_header
);
5969 sd_sysctl_header
= NULL
;
5970 if (sd_ctl_dir
[0].child
)
5971 sd_free_ctl_entry(&sd_ctl_dir
[0].child
);
5974 static void register_sched_domain_sysctl(void)
5977 static void unregister_sched_domain_sysctl(void)
5983 * migration_call - callback that gets triggered when a CPU is added.
5984 * Here we can start up the necessary migration thread for the new CPU.
5986 static int __cpuinit
5987 migration_call(struct notifier_block
*nfb
, unsigned long action
, void *hcpu
)
5989 struct task_struct
*p
;
5990 int cpu
= (long)hcpu
;
5991 unsigned long flags
;
5996 case CPU_UP_PREPARE
:
5997 case CPU_UP_PREPARE_FROZEN
:
5998 p
= kthread_create(migration_thread
, hcpu
, "migration/%d", cpu
);
6001 kthread_bind(p
, cpu
);
6002 /* Must be high prio: stop_machine expects to yield to it. */
6003 rq
= task_rq_lock(p
, &flags
);
6004 __setscheduler(rq
, p
, SCHED_FIFO
, MAX_RT_PRIO
-1);
6005 task_rq_unlock(rq
, &flags
);
6006 cpu_rq(cpu
)->migration_thread
= p
;
6010 case CPU_ONLINE_FROZEN
:
6011 /* Strictly unnecessary, as first user will wake it. */
6012 wake_up_process(cpu_rq(cpu
)->migration_thread
);
6014 /* Update our root-domain */
6016 spin_lock_irqsave(&rq
->lock
, flags
);
6018 BUG_ON(!cpu_isset(cpu
, rq
->rd
->span
));
6019 cpu_set(cpu
, rq
->rd
->online
);
6021 spin_unlock_irqrestore(&rq
->lock
, flags
);
6024 #ifdef CONFIG_HOTPLUG_CPU
6025 case CPU_UP_CANCELED
:
6026 case CPU_UP_CANCELED_FROZEN
:
6027 if (!cpu_rq(cpu
)->migration_thread
)
6029 /* Unbind it from offline cpu so it can run. Fall thru. */
6030 kthread_bind(cpu_rq(cpu
)->migration_thread
,
6031 any_online_cpu(cpu_online_map
));
6032 kthread_stop(cpu_rq(cpu
)->migration_thread
);
6033 cpu_rq(cpu
)->migration_thread
= NULL
;
6037 case CPU_DEAD_FROZEN
:
6038 cpuset_lock(); /* around calls to cpuset_cpus_allowed_lock() */
6039 migrate_live_tasks(cpu
);
6041 kthread_stop(rq
->migration_thread
);
6042 rq
->migration_thread
= NULL
;
6043 /* Idle task back to normal (off runqueue, low prio) */
6044 spin_lock_irq(&rq
->lock
);
6045 update_rq_clock(rq
);
6046 deactivate_task(rq
, rq
->idle
, 0);
6047 rq
->idle
->static_prio
= MAX_PRIO
;
6048 __setscheduler(rq
, rq
->idle
, SCHED_NORMAL
, 0);
6049 rq
->idle
->sched_class
= &idle_sched_class
;
6050 migrate_dead_tasks(cpu
);
6051 spin_unlock_irq(&rq
->lock
);
6053 migrate_nr_uninterruptible(rq
);
6054 BUG_ON(rq
->nr_running
!= 0);
6057 * No need to migrate the tasks: it was best-effort if
6058 * they didn't take sched_hotcpu_mutex. Just wake up
6061 spin_lock_irq(&rq
->lock
);
6062 while (!list_empty(&rq
->migration_queue
)) {
6063 struct migration_req
*req
;
6065 req
= list_entry(rq
->migration_queue
.next
,
6066 struct migration_req
, list
);
6067 list_del_init(&req
->list
);
6068 complete(&req
->done
);
6070 spin_unlock_irq(&rq
->lock
);
6074 case CPU_DYING_FROZEN
:
6075 /* Update our root-domain */
6077 spin_lock_irqsave(&rq
->lock
, flags
);
6079 BUG_ON(!cpu_isset(cpu
, rq
->rd
->span
));
6080 cpu_clear(cpu
, rq
->rd
->online
);
6082 spin_unlock_irqrestore(&rq
->lock
, flags
);
6089 /* Register at highest priority so that task migration (migrate_all_tasks)
6090 * happens before everything else.
6092 static struct notifier_block __cpuinitdata migration_notifier
= {
6093 .notifier_call
= migration_call
,
6097 void __init
migration_init(void)
6099 void *cpu
= (void *)(long)smp_processor_id();
6102 /* Start one for the boot CPU: */
6103 err
= migration_call(&migration_notifier
, CPU_UP_PREPARE
, cpu
);
6104 BUG_ON(err
== NOTIFY_BAD
);
6105 migration_call(&migration_notifier
, CPU_ONLINE
, cpu
);
6106 register_cpu_notifier(&migration_notifier
);
6112 /* Number of possible processor ids */
6113 int nr_cpu_ids __read_mostly
= NR_CPUS
;
6114 EXPORT_SYMBOL(nr_cpu_ids
);
6116 #ifdef CONFIG_SCHED_DEBUG
6118 static int sched_domain_debug_one(struct sched_domain
*sd
, int cpu
, int level
)
6120 struct sched_group
*group
= sd
->groups
;
6121 cpumask_t groupmask
;
6124 cpulist_scnprintf(str
, sizeof(str
), sd
->span
);
6125 cpus_clear(groupmask
);
6127 printk(KERN_DEBUG
"%*s domain %d: ", level
, "", level
);
6129 if (!(sd
->flags
& SD_LOAD_BALANCE
)) {
6130 printk("does not load-balance\n");
6132 printk(KERN_ERR
"ERROR: !SD_LOAD_BALANCE domain"
6137 printk(KERN_CONT
"span %s\n", str
);
6139 if (!cpu_isset(cpu
, sd
->span
)) {
6140 printk(KERN_ERR
"ERROR: domain->span does not contain "
6143 if (!cpu_isset(cpu
, group
->cpumask
)) {
6144 printk(KERN_ERR
"ERROR: domain->groups does not contain"
6148 printk(KERN_DEBUG
"%*s groups:", level
+ 1, "");
6152 printk(KERN_ERR
"ERROR: group is NULL\n");
6156 if (!group
->__cpu_power
) {
6157 printk(KERN_CONT
"\n");
6158 printk(KERN_ERR
"ERROR: domain->cpu_power not "
6163 if (!cpus_weight(group
->cpumask
)) {
6164 printk(KERN_CONT
"\n");
6165 printk(KERN_ERR
"ERROR: empty group\n");
6169 if (cpus_intersects(groupmask
, group
->cpumask
)) {
6170 printk(KERN_CONT
"\n");
6171 printk(KERN_ERR
"ERROR: repeated CPUs\n");
6175 cpus_or(groupmask
, groupmask
, group
->cpumask
);
6177 cpulist_scnprintf(str
, sizeof(str
), group
->cpumask
);
6178 printk(KERN_CONT
" %s", str
);
6180 group
= group
->next
;
6181 } while (group
!= sd
->groups
);
6182 printk(KERN_CONT
"\n");
6184 if (!cpus_equal(sd
->span
, groupmask
))
6185 printk(KERN_ERR
"ERROR: groups don't span domain->span\n");
6187 if (sd
->parent
&& !cpus_subset(groupmask
, sd
->parent
->span
))
6188 printk(KERN_ERR
"ERROR: parent span is not a superset "
6189 "of domain->span\n");
6193 static void sched_domain_debug(struct sched_domain
*sd
, int cpu
)
6198 printk(KERN_DEBUG
"CPU%d attaching NULL sched-domain.\n", cpu
);
6202 printk(KERN_DEBUG
"CPU%d attaching sched-domain:\n", cpu
);
6205 if (sched_domain_debug_one(sd
, cpu
, level
))
6214 # define sched_domain_debug(sd, cpu) do { } while (0)
6217 static int sd_degenerate(struct sched_domain
*sd
)
6219 if (cpus_weight(sd
->span
) == 1)
6222 /* Following flags need at least 2 groups */
6223 if (sd
->flags
& (SD_LOAD_BALANCE
|
6224 SD_BALANCE_NEWIDLE
|
6228 SD_SHARE_PKG_RESOURCES
)) {
6229 if (sd
->groups
!= sd
->groups
->next
)
6233 /* Following flags don't use groups */
6234 if (sd
->flags
& (SD_WAKE_IDLE
|
6243 sd_parent_degenerate(struct sched_domain
*sd
, struct sched_domain
*parent
)
6245 unsigned long cflags
= sd
->flags
, pflags
= parent
->flags
;
6247 if (sd_degenerate(parent
))
6250 if (!cpus_equal(sd
->span
, parent
->span
))
6253 /* Does parent contain flags not in child? */
6254 /* WAKE_BALANCE is a subset of WAKE_AFFINE */
6255 if (cflags
& SD_WAKE_AFFINE
)
6256 pflags
&= ~SD_WAKE_BALANCE
;
6257 /* Flags needing groups don't count if only 1 group in parent */
6258 if (parent
->groups
== parent
->groups
->next
) {
6259 pflags
&= ~(SD_LOAD_BALANCE
|
6260 SD_BALANCE_NEWIDLE
|
6264 SD_SHARE_PKG_RESOURCES
);
6266 if (~cflags
& pflags
)
6272 static void rq_attach_root(struct rq
*rq
, struct root_domain
*rd
)
6274 unsigned long flags
;
6275 const struct sched_class
*class;
6277 spin_lock_irqsave(&rq
->lock
, flags
);
6280 struct root_domain
*old_rd
= rq
->rd
;
6282 for (class = sched_class_highest
; class; class = class->next
) {
6283 if (class->leave_domain
)
6284 class->leave_domain(rq
);
6287 cpu_clear(rq
->cpu
, old_rd
->span
);
6288 cpu_clear(rq
->cpu
, old_rd
->online
);
6290 if (atomic_dec_and_test(&old_rd
->refcount
))
6294 atomic_inc(&rd
->refcount
);
6297 cpu_set(rq
->cpu
, rd
->span
);
6298 if (cpu_isset(rq
->cpu
, cpu_online_map
))
6299 cpu_set(rq
->cpu
, rd
->online
);
6301 for (class = sched_class_highest
; class; class = class->next
) {
6302 if (class->join_domain
)
6303 class->join_domain(rq
);
6306 spin_unlock_irqrestore(&rq
->lock
, flags
);
6309 static void init_rootdomain(struct root_domain
*rd
)
6311 memset(rd
, 0, sizeof(*rd
));
6313 cpus_clear(rd
->span
);
6314 cpus_clear(rd
->online
);
6317 static void init_defrootdomain(void)
6319 init_rootdomain(&def_root_domain
);
6320 atomic_set(&def_root_domain
.refcount
, 1);
6323 static struct root_domain
*alloc_rootdomain(void)
6325 struct root_domain
*rd
;
6327 rd
= kmalloc(sizeof(*rd
), GFP_KERNEL
);
6331 init_rootdomain(rd
);
6337 * Attach the domain 'sd' to 'cpu' as its base domain. Callers must
6338 * hold the hotplug lock.
6341 cpu_attach_domain(struct sched_domain
*sd
, struct root_domain
*rd
, int cpu
)
6343 struct rq
*rq
= cpu_rq(cpu
);
6344 struct sched_domain
*tmp
;
6346 /* Remove the sched domains which do not contribute to scheduling. */
6347 for (tmp
= sd
; tmp
; tmp
= tmp
->parent
) {
6348 struct sched_domain
*parent
= tmp
->parent
;
6351 if (sd_parent_degenerate(tmp
, parent
)) {
6352 tmp
->parent
= parent
->parent
;
6354 parent
->parent
->child
= tmp
;
6358 if (sd
&& sd_degenerate(sd
)) {
6364 sched_domain_debug(sd
, cpu
);
6366 rq_attach_root(rq
, rd
);
6367 rcu_assign_pointer(rq
->sd
, sd
);
6370 /* cpus with isolated domains */
6371 static cpumask_t cpu_isolated_map
= CPU_MASK_NONE
;
6373 /* Setup the mask of cpus configured for isolated domains */
6374 static int __init
isolated_cpu_setup(char *str
)
6376 int ints
[NR_CPUS
], i
;
6378 str
= get_options(str
, ARRAY_SIZE(ints
), ints
);
6379 cpus_clear(cpu_isolated_map
);
6380 for (i
= 1; i
<= ints
[0]; i
++)
6381 if (ints
[i
] < NR_CPUS
)
6382 cpu_set(ints
[i
], cpu_isolated_map
);
6386 __setup("isolcpus=", isolated_cpu_setup
);
6389 * init_sched_build_groups takes the cpumask we wish to span, and a pointer
6390 * to a function which identifies what group(along with sched group) a CPU
6391 * belongs to. The return value of group_fn must be a >= 0 and < NR_CPUS
6392 * (due to the fact that we keep track of groups covered with a cpumask_t).
6394 * init_sched_build_groups will build a circular linked list of the groups
6395 * covered by the given span, and will set each group's ->cpumask correctly,
6396 * and ->cpu_power to 0.
6399 init_sched_build_groups(cpumask_t span
, const cpumask_t
*cpu_map
,
6400 int (*group_fn
)(int cpu
, const cpumask_t
*cpu_map
,
6401 struct sched_group
**sg
))
6403 struct sched_group
*first
= NULL
, *last
= NULL
;
6404 cpumask_t covered
= CPU_MASK_NONE
;
6407 for_each_cpu_mask(i
, span
) {
6408 struct sched_group
*sg
;
6409 int group
= group_fn(i
, cpu_map
, &sg
);
6412 if (cpu_isset(i
, covered
))
6415 sg
->cpumask
= CPU_MASK_NONE
;
6416 sg
->__cpu_power
= 0;
6418 for_each_cpu_mask(j
, span
) {
6419 if (group_fn(j
, cpu_map
, NULL
) != group
)
6422 cpu_set(j
, covered
);
6423 cpu_set(j
, sg
->cpumask
);
6434 #define SD_NODES_PER_DOMAIN 16
6439 * find_next_best_node - find the next node to include in a sched_domain
6440 * @node: node whose sched_domain we're building
6441 * @used_nodes: nodes already in the sched_domain
6443 * Find the next node to include in a given scheduling domain. Simply
6444 * finds the closest node not already in the @used_nodes map.
6446 * Should use nodemask_t.
6448 static int find_next_best_node(int node
, unsigned long *used_nodes
)
6450 int i
, n
, val
, min_val
, best_node
= 0;
6454 for (i
= 0; i
< MAX_NUMNODES
; i
++) {
6455 /* Start at @node */
6456 n
= (node
+ i
) % MAX_NUMNODES
;
6458 if (!nr_cpus_node(n
))
6461 /* Skip already used nodes */
6462 if (test_bit(n
, used_nodes
))
6465 /* Simple min distance search */
6466 val
= node_distance(node
, n
);
6468 if (val
< min_val
) {
6474 set_bit(best_node
, used_nodes
);
6479 * sched_domain_node_span - get a cpumask for a node's sched_domain
6480 * @node: node whose cpumask we're constructing
6481 * @size: number of nodes to include in this span
6483 * Given a node, construct a good cpumask for its sched_domain to span. It
6484 * should be one that prevents unnecessary balancing, but also spreads tasks
6487 static cpumask_t
sched_domain_node_span(int node
)
6489 DECLARE_BITMAP(used_nodes
, MAX_NUMNODES
);
6490 cpumask_t span
, nodemask
;
6494 bitmap_zero(used_nodes
, MAX_NUMNODES
);
6496 nodemask
= node_to_cpumask(node
);
6497 cpus_or(span
, span
, nodemask
);
6498 set_bit(node
, used_nodes
);
6500 for (i
= 1; i
< SD_NODES_PER_DOMAIN
; i
++) {
6501 int next_node
= find_next_best_node(node
, used_nodes
);
6503 nodemask
= node_to_cpumask(next_node
);
6504 cpus_or(span
, span
, nodemask
);
6511 int sched_smt_power_savings
= 0, sched_mc_power_savings
= 0;
6514 * SMT sched-domains:
6516 #ifdef CONFIG_SCHED_SMT
6517 static DEFINE_PER_CPU(struct sched_domain
, cpu_domains
);
6518 static DEFINE_PER_CPU(struct sched_group
, sched_group_cpus
);
6521 cpu_to_cpu_group(int cpu
, const cpumask_t
*cpu_map
, struct sched_group
**sg
)
6524 *sg
= &per_cpu(sched_group_cpus
, cpu
);
6530 * multi-core sched-domains:
6532 #ifdef CONFIG_SCHED_MC
6533 static DEFINE_PER_CPU(struct sched_domain
, core_domains
);
6534 static DEFINE_PER_CPU(struct sched_group
, sched_group_core
);
6537 #if defined(CONFIG_SCHED_MC) && defined(CONFIG_SCHED_SMT)
6539 cpu_to_core_group(int cpu
, const cpumask_t
*cpu_map
, struct sched_group
**sg
)
6542 cpumask_t mask
= per_cpu(cpu_sibling_map
, cpu
);
6543 cpus_and(mask
, mask
, *cpu_map
);
6544 group
= first_cpu(mask
);
6546 *sg
= &per_cpu(sched_group_core
, group
);
6549 #elif defined(CONFIG_SCHED_MC)
6551 cpu_to_core_group(int cpu
, const cpumask_t
*cpu_map
, struct sched_group
**sg
)
6554 *sg
= &per_cpu(sched_group_core
, cpu
);
6559 static DEFINE_PER_CPU(struct sched_domain
, phys_domains
);
6560 static DEFINE_PER_CPU(struct sched_group
, sched_group_phys
);
6563 cpu_to_phys_group(int cpu
, const cpumask_t
*cpu_map
, struct sched_group
**sg
)
6566 #ifdef CONFIG_SCHED_MC
6567 cpumask_t mask
= cpu_coregroup_map(cpu
);
6568 cpus_and(mask
, mask
, *cpu_map
);
6569 group
= first_cpu(mask
);
6570 #elif defined(CONFIG_SCHED_SMT)
6571 cpumask_t mask
= per_cpu(cpu_sibling_map
, cpu
);
6572 cpus_and(mask
, mask
, *cpu_map
);
6573 group
= first_cpu(mask
);
6578 *sg
= &per_cpu(sched_group_phys
, group
);
6584 * The init_sched_build_groups can't handle what we want to do with node
6585 * groups, so roll our own. Now each node has its own list of groups which
6586 * gets dynamically allocated.
6588 static DEFINE_PER_CPU(struct sched_domain
, node_domains
);
6589 static struct sched_group
***sched_group_nodes_bycpu
;
6591 static DEFINE_PER_CPU(struct sched_domain
, allnodes_domains
);
6592 static DEFINE_PER_CPU(struct sched_group
, sched_group_allnodes
);
6594 static int cpu_to_allnodes_group(int cpu
, const cpumask_t
*cpu_map
,
6595 struct sched_group
**sg
)
6597 cpumask_t nodemask
= node_to_cpumask(cpu_to_node(cpu
));
6600 cpus_and(nodemask
, nodemask
, *cpu_map
);
6601 group
= first_cpu(nodemask
);
6604 *sg
= &per_cpu(sched_group_allnodes
, group
);
6608 static void init_numa_sched_groups_power(struct sched_group
*group_head
)
6610 struct sched_group
*sg
= group_head
;
6616 for_each_cpu_mask(j
, sg
->cpumask
) {
6617 struct sched_domain
*sd
;
6619 sd
= &per_cpu(phys_domains
, j
);
6620 if (j
!= first_cpu(sd
->groups
->cpumask
)) {
6622 * Only add "power" once for each
6628 sg_inc_cpu_power(sg
, sd
->groups
->__cpu_power
);
6631 } while (sg
!= group_head
);
6636 /* Free memory allocated for various sched_group structures */
6637 static void free_sched_groups(const cpumask_t
*cpu_map
)
6641 for_each_cpu_mask(cpu
, *cpu_map
) {
6642 struct sched_group
**sched_group_nodes
6643 = sched_group_nodes_bycpu
[cpu
];
6645 if (!sched_group_nodes
)
6648 for (i
= 0; i
< MAX_NUMNODES
; i
++) {
6649 cpumask_t nodemask
= node_to_cpumask(i
);
6650 struct sched_group
*oldsg
, *sg
= sched_group_nodes
[i
];
6652 cpus_and(nodemask
, nodemask
, *cpu_map
);
6653 if (cpus_empty(nodemask
))
6663 if (oldsg
!= sched_group_nodes
[i
])
6666 kfree(sched_group_nodes
);
6667 sched_group_nodes_bycpu
[cpu
] = NULL
;
6671 static void free_sched_groups(const cpumask_t
*cpu_map
)
6677 * Initialize sched groups cpu_power.
6679 * cpu_power indicates the capacity of sched group, which is used while
6680 * distributing the load between different sched groups in a sched domain.
6681 * Typically cpu_power for all the groups in a sched domain will be same unless
6682 * there are asymmetries in the topology. If there are asymmetries, group
6683 * having more cpu_power will pickup more load compared to the group having
6686 * cpu_power will be a multiple of SCHED_LOAD_SCALE. This multiple represents
6687 * the maximum number of tasks a group can handle in the presence of other idle
6688 * or lightly loaded groups in the same sched domain.
6690 static void init_sched_groups_power(int cpu
, struct sched_domain
*sd
)
6692 struct sched_domain
*child
;
6693 struct sched_group
*group
;
6695 WARN_ON(!sd
|| !sd
->groups
);
6697 if (cpu
!= first_cpu(sd
->groups
->cpumask
))
6702 sd
->groups
->__cpu_power
= 0;
6705 * For perf policy, if the groups in child domain share resources
6706 * (for example cores sharing some portions of the cache hierarchy
6707 * or SMT), then set this domain groups cpu_power such that each group
6708 * can handle only one task, when there are other idle groups in the
6709 * same sched domain.
6711 if (!child
|| (!(sd
->flags
& SD_POWERSAVINGS_BALANCE
) &&
6713 (SD_SHARE_CPUPOWER
| SD_SHARE_PKG_RESOURCES
)))) {
6714 sg_inc_cpu_power(sd
->groups
, SCHED_LOAD_SCALE
);
6719 * add cpu_power of each child group to this groups cpu_power
6721 group
= child
->groups
;
6723 sg_inc_cpu_power(sd
->groups
, group
->__cpu_power
);
6724 group
= group
->next
;
6725 } while (group
!= child
->groups
);
6729 * Build sched domains for a given set of cpus and attach the sched domains
6730 * to the individual cpus
6732 static int build_sched_domains(const cpumask_t
*cpu_map
)
6735 struct root_domain
*rd
;
6737 struct sched_group
**sched_group_nodes
= NULL
;
6738 int sd_allnodes
= 0;
6741 * Allocate the per-node list of sched groups
6743 sched_group_nodes
= kcalloc(MAX_NUMNODES
, sizeof(struct sched_group
*),
6745 if (!sched_group_nodes
) {
6746 printk(KERN_WARNING
"Can not alloc sched group node list\n");
6749 sched_group_nodes_bycpu
[first_cpu(*cpu_map
)] = sched_group_nodes
;
6752 rd
= alloc_rootdomain();
6754 printk(KERN_WARNING
"Cannot alloc root domain\n");
6759 * Set up domains for cpus specified by the cpu_map.
6761 for_each_cpu_mask(i
, *cpu_map
) {
6762 struct sched_domain
*sd
= NULL
, *p
;
6763 cpumask_t nodemask
= node_to_cpumask(cpu_to_node(i
));
6765 cpus_and(nodemask
, nodemask
, *cpu_map
);
6768 if (cpus_weight(*cpu_map
) >
6769 SD_NODES_PER_DOMAIN
*cpus_weight(nodemask
)) {
6770 sd
= &per_cpu(allnodes_domains
, i
);
6771 *sd
= SD_ALLNODES_INIT
;
6772 sd
->span
= *cpu_map
;
6773 cpu_to_allnodes_group(i
, cpu_map
, &sd
->groups
);
6779 sd
= &per_cpu(node_domains
, i
);
6781 sd
->span
= sched_domain_node_span(cpu_to_node(i
));
6785 cpus_and(sd
->span
, sd
->span
, *cpu_map
);
6789 sd
= &per_cpu(phys_domains
, i
);
6791 sd
->span
= nodemask
;
6795 cpu_to_phys_group(i
, cpu_map
, &sd
->groups
);
6797 #ifdef CONFIG_SCHED_MC
6799 sd
= &per_cpu(core_domains
, i
);
6801 sd
->span
= cpu_coregroup_map(i
);
6802 cpus_and(sd
->span
, sd
->span
, *cpu_map
);
6805 cpu_to_core_group(i
, cpu_map
, &sd
->groups
);
6808 #ifdef CONFIG_SCHED_SMT
6810 sd
= &per_cpu(cpu_domains
, i
);
6811 *sd
= SD_SIBLING_INIT
;
6812 sd
->span
= per_cpu(cpu_sibling_map
, i
);
6813 cpus_and(sd
->span
, sd
->span
, *cpu_map
);
6816 cpu_to_cpu_group(i
, cpu_map
, &sd
->groups
);
6820 #ifdef CONFIG_SCHED_SMT
6821 /* Set up CPU (sibling) groups */
6822 for_each_cpu_mask(i
, *cpu_map
) {
6823 cpumask_t this_sibling_map
= per_cpu(cpu_sibling_map
, i
);
6824 cpus_and(this_sibling_map
, this_sibling_map
, *cpu_map
);
6825 if (i
!= first_cpu(this_sibling_map
))
6828 init_sched_build_groups(this_sibling_map
, cpu_map
,
6833 #ifdef CONFIG_SCHED_MC
6834 /* Set up multi-core groups */
6835 for_each_cpu_mask(i
, *cpu_map
) {
6836 cpumask_t this_core_map
= cpu_coregroup_map(i
);
6837 cpus_and(this_core_map
, this_core_map
, *cpu_map
);
6838 if (i
!= first_cpu(this_core_map
))
6840 init_sched_build_groups(this_core_map
, cpu_map
,
6841 &cpu_to_core_group
);
6845 /* Set up physical groups */
6846 for (i
= 0; i
< MAX_NUMNODES
; i
++) {
6847 cpumask_t nodemask
= node_to_cpumask(i
);
6849 cpus_and(nodemask
, nodemask
, *cpu_map
);
6850 if (cpus_empty(nodemask
))
6853 init_sched_build_groups(nodemask
, cpu_map
, &cpu_to_phys_group
);
6857 /* Set up node groups */
6859 init_sched_build_groups(*cpu_map
, cpu_map
,
6860 &cpu_to_allnodes_group
);
6862 for (i
= 0; i
< MAX_NUMNODES
; i
++) {
6863 /* Set up node groups */
6864 struct sched_group
*sg
, *prev
;
6865 cpumask_t nodemask
= node_to_cpumask(i
);
6866 cpumask_t domainspan
;
6867 cpumask_t covered
= CPU_MASK_NONE
;
6870 cpus_and(nodemask
, nodemask
, *cpu_map
);
6871 if (cpus_empty(nodemask
)) {
6872 sched_group_nodes
[i
] = NULL
;
6876 domainspan
= sched_domain_node_span(i
);
6877 cpus_and(domainspan
, domainspan
, *cpu_map
);
6879 sg
= kmalloc_node(sizeof(struct sched_group
), GFP_KERNEL
, i
);
6881 printk(KERN_WARNING
"Can not alloc domain group for "
6885 sched_group_nodes
[i
] = sg
;
6886 for_each_cpu_mask(j
, nodemask
) {
6887 struct sched_domain
*sd
;
6889 sd
= &per_cpu(node_domains
, j
);
6892 sg
->__cpu_power
= 0;
6893 sg
->cpumask
= nodemask
;
6895 cpus_or(covered
, covered
, nodemask
);
6898 for (j
= 0; j
< MAX_NUMNODES
; j
++) {
6899 cpumask_t tmp
, notcovered
;
6900 int n
= (i
+ j
) % MAX_NUMNODES
;
6902 cpus_complement(notcovered
, covered
);
6903 cpus_and(tmp
, notcovered
, *cpu_map
);
6904 cpus_and(tmp
, tmp
, domainspan
);
6905 if (cpus_empty(tmp
))
6908 nodemask
= node_to_cpumask(n
);
6909 cpus_and(tmp
, tmp
, nodemask
);
6910 if (cpus_empty(tmp
))
6913 sg
= kmalloc_node(sizeof(struct sched_group
),
6917 "Can not alloc domain group for node %d\n", j
);
6920 sg
->__cpu_power
= 0;
6922 sg
->next
= prev
->next
;
6923 cpus_or(covered
, covered
, tmp
);
6930 /* Calculate CPU power for physical packages and nodes */
6931 #ifdef CONFIG_SCHED_SMT
6932 for_each_cpu_mask(i
, *cpu_map
) {
6933 struct sched_domain
*sd
= &per_cpu(cpu_domains
, i
);
6935 init_sched_groups_power(i
, sd
);
6938 #ifdef CONFIG_SCHED_MC
6939 for_each_cpu_mask(i
, *cpu_map
) {
6940 struct sched_domain
*sd
= &per_cpu(core_domains
, i
);
6942 init_sched_groups_power(i
, sd
);
6946 for_each_cpu_mask(i
, *cpu_map
) {
6947 struct sched_domain
*sd
= &per_cpu(phys_domains
, i
);
6949 init_sched_groups_power(i
, sd
);
6953 for (i
= 0; i
< MAX_NUMNODES
; i
++)
6954 init_numa_sched_groups_power(sched_group_nodes
[i
]);
6957 struct sched_group
*sg
;
6959 cpu_to_allnodes_group(first_cpu(*cpu_map
), cpu_map
, &sg
);
6960 init_numa_sched_groups_power(sg
);
6964 /* Attach the domains */
6965 for_each_cpu_mask(i
, *cpu_map
) {
6966 struct sched_domain
*sd
;
6967 #ifdef CONFIG_SCHED_SMT
6968 sd
= &per_cpu(cpu_domains
, i
);
6969 #elif defined(CONFIG_SCHED_MC)
6970 sd
= &per_cpu(core_domains
, i
);
6972 sd
= &per_cpu(phys_domains
, i
);
6974 cpu_attach_domain(sd
, rd
, i
);
6981 free_sched_groups(cpu_map
);
6986 static cpumask_t
*doms_cur
; /* current sched domains */
6987 static int ndoms_cur
; /* number of sched domains in 'doms_cur' */
6990 * Special case: If a kmalloc of a doms_cur partition (array of
6991 * cpumask_t) fails, then fallback to a single sched domain,
6992 * as determined by the single cpumask_t fallback_doms.
6994 static cpumask_t fallback_doms
;
6996 void __attribute__((weak
)) arch_update_cpu_topology(void)
7001 * Set up scheduler domains and groups. Callers must hold the hotplug lock.
7002 * For now this just excludes isolated cpus, but could be used to
7003 * exclude other special cases in the future.
7005 static int arch_init_sched_domains(const cpumask_t
*cpu_map
)
7009 arch_update_cpu_topology();
7011 doms_cur
= kmalloc(sizeof(cpumask_t
), GFP_KERNEL
);
7013 doms_cur
= &fallback_doms
;
7014 cpus_andnot(*doms_cur
, *cpu_map
, cpu_isolated_map
);
7015 err
= build_sched_domains(doms_cur
);
7016 register_sched_domain_sysctl();
7021 static void arch_destroy_sched_domains(const cpumask_t
*cpu_map
)
7023 free_sched_groups(cpu_map
);
7027 * Detach sched domains from a group of cpus specified in cpu_map
7028 * These cpus will now be attached to the NULL domain
7030 static void detach_destroy_domains(const cpumask_t
*cpu_map
)
7034 unregister_sched_domain_sysctl();
7036 for_each_cpu_mask(i
, *cpu_map
)
7037 cpu_attach_domain(NULL
, &def_root_domain
, i
);
7038 synchronize_sched();
7039 arch_destroy_sched_domains(cpu_map
);
7043 * Partition sched domains as specified by the 'ndoms_new'
7044 * cpumasks in the array doms_new[] of cpumasks. This compares
7045 * doms_new[] to the current sched domain partitioning, doms_cur[].
7046 * It destroys each deleted domain and builds each new domain.
7048 * 'doms_new' is an array of cpumask_t's of length 'ndoms_new'.
7049 * The masks don't intersect (don't overlap.) We should setup one
7050 * sched domain for each mask. CPUs not in any of the cpumasks will
7051 * not be load balanced. If the same cpumask appears both in the
7052 * current 'doms_cur' domains and in the new 'doms_new', we can leave
7055 * The passed in 'doms_new' should be kmalloc'd. This routine takes
7056 * ownership of it and will kfree it when done with it. If the caller
7057 * failed the kmalloc call, then it can pass in doms_new == NULL,
7058 * and partition_sched_domains() will fallback to the single partition
7061 * Call with hotplug lock held
7063 void partition_sched_domains(int ndoms_new
, cpumask_t
*doms_new
)
7069 /* always unregister in case we don't destroy any domains */
7070 unregister_sched_domain_sysctl();
7072 if (doms_new
== NULL
) {
7074 doms_new
= &fallback_doms
;
7075 cpus_andnot(doms_new
[0], cpu_online_map
, cpu_isolated_map
);
7078 /* Destroy deleted domains */
7079 for (i
= 0; i
< ndoms_cur
; i
++) {
7080 for (j
= 0; j
< ndoms_new
; j
++) {
7081 if (cpus_equal(doms_cur
[i
], doms_new
[j
]))
7084 /* no match - a current sched domain not in new doms_new[] */
7085 detach_destroy_domains(doms_cur
+ i
);
7090 /* Build new domains */
7091 for (i
= 0; i
< ndoms_new
; i
++) {
7092 for (j
= 0; j
< ndoms_cur
; j
++) {
7093 if (cpus_equal(doms_new
[i
], doms_cur
[j
]))
7096 /* no match - add a new doms_new */
7097 build_sched_domains(doms_new
+ i
);
7102 /* Remember the new sched domains */
7103 if (doms_cur
!= &fallback_doms
)
7105 doms_cur
= doms_new
;
7106 ndoms_cur
= ndoms_new
;
7108 register_sched_domain_sysctl();
7113 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
7114 int arch_reinit_sched_domains(void)
7119 detach_destroy_domains(&cpu_online_map
);
7120 err
= arch_init_sched_domains(&cpu_online_map
);
7126 static ssize_t
sched_power_savings_store(const char *buf
, size_t count
, int smt
)
7130 if (buf
[0] != '0' && buf
[0] != '1')
7134 sched_smt_power_savings
= (buf
[0] == '1');
7136 sched_mc_power_savings
= (buf
[0] == '1');
7138 ret
= arch_reinit_sched_domains();
7140 return ret
? ret
: count
;
7143 #ifdef CONFIG_SCHED_MC
7144 static ssize_t
sched_mc_power_savings_show(struct sys_device
*dev
, char *page
)
7146 return sprintf(page
, "%u\n", sched_mc_power_savings
);
7148 static ssize_t
sched_mc_power_savings_store(struct sys_device
*dev
,
7149 const char *buf
, size_t count
)
7151 return sched_power_savings_store(buf
, count
, 0);
7153 static SYSDEV_ATTR(sched_mc_power_savings
, 0644, sched_mc_power_savings_show
,
7154 sched_mc_power_savings_store
);
7157 #ifdef CONFIG_SCHED_SMT
7158 static ssize_t
sched_smt_power_savings_show(struct sys_device
*dev
, char *page
)
7160 return sprintf(page
, "%u\n", sched_smt_power_savings
);
7162 static ssize_t
sched_smt_power_savings_store(struct sys_device
*dev
,
7163 const char *buf
, size_t count
)
7165 return sched_power_savings_store(buf
, count
, 1);
7167 static SYSDEV_ATTR(sched_smt_power_savings
, 0644, sched_smt_power_savings_show
,
7168 sched_smt_power_savings_store
);
7171 int sched_create_sysfs_power_savings_entries(struct sysdev_class
*cls
)
7175 #ifdef CONFIG_SCHED_SMT
7177 err
= sysfs_create_file(&cls
->kset
.kobj
,
7178 &attr_sched_smt_power_savings
.attr
);
7180 #ifdef CONFIG_SCHED_MC
7181 if (!err
&& mc_capable())
7182 err
= sysfs_create_file(&cls
->kset
.kobj
,
7183 &attr_sched_mc_power_savings
.attr
);
7190 * Force a reinitialization of the sched domains hierarchy. The domains
7191 * and groups cannot be updated in place without racing with the balancing
7192 * code, so we temporarily attach all running cpus to the NULL domain
7193 * which will prevent rebalancing while the sched domains are recalculated.
7195 static int update_sched_domains(struct notifier_block
*nfb
,
7196 unsigned long action
, void *hcpu
)
7199 case CPU_UP_PREPARE
:
7200 case CPU_UP_PREPARE_FROZEN
:
7201 case CPU_DOWN_PREPARE
:
7202 case CPU_DOWN_PREPARE_FROZEN
:
7203 detach_destroy_domains(&cpu_online_map
);
7206 case CPU_UP_CANCELED
:
7207 case CPU_UP_CANCELED_FROZEN
:
7208 case CPU_DOWN_FAILED
:
7209 case CPU_DOWN_FAILED_FROZEN
:
7211 case CPU_ONLINE_FROZEN
:
7213 case CPU_DEAD_FROZEN
:
7215 * Fall through and re-initialise the domains.
7222 /* The hotplug lock is already held by cpu_up/cpu_down */
7223 arch_init_sched_domains(&cpu_online_map
);
7228 void __init
sched_init_smp(void)
7230 cpumask_t non_isolated_cpus
;
7232 #if defined(CONFIG_NUMA)
7233 sched_group_nodes_bycpu
= kzalloc(nr_cpu_ids
* sizeof(void **),
7235 BUG_ON(sched_group_nodes_bycpu
== NULL
);
7238 arch_init_sched_domains(&cpu_online_map
);
7239 cpus_andnot(non_isolated_cpus
, cpu_possible_map
, cpu_isolated_map
);
7240 if (cpus_empty(non_isolated_cpus
))
7241 cpu_set(smp_processor_id(), non_isolated_cpus
);
7243 /* XXX: Theoretical race here - CPU may be hotplugged now */
7244 hotcpu_notifier(update_sched_domains
, 0);
7246 /* Move init over to a non-isolated CPU */
7247 if (set_cpus_allowed(current
, non_isolated_cpus
) < 0)
7249 sched_init_granularity();
7252 void __init
sched_init_smp(void)
7254 #if defined(CONFIG_NUMA)
7255 sched_group_nodes_bycpu
= kzalloc(nr_cpu_ids
* sizeof(void **),
7257 BUG_ON(sched_group_nodes_bycpu
== NULL
);
7259 sched_init_granularity();
7261 #endif /* CONFIG_SMP */
7263 int in_sched_functions(unsigned long addr
)
7265 return in_lock_functions(addr
) ||
7266 (addr
>= (unsigned long)__sched_text_start
7267 && addr
< (unsigned long)__sched_text_end
);
7270 static void init_cfs_rq(struct cfs_rq
*cfs_rq
, struct rq
*rq
)
7272 cfs_rq
->tasks_timeline
= RB_ROOT
;
7273 #ifdef CONFIG_FAIR_GROUP_SCHED
7276 cfs_rq
->min_vruntime
= (u64
)(-(1LL << 20));
7279 static void init_rt_rq(struct rt_rq
*rt_rq
, struct rq
*rq
)
7281 struct rt_prio_array
*array
;
7284 array
= &rt_rq
->active
;
7285 for (i
= 0; i
< MAX_RT_PRIO
; i
++) {
7286 INIT_LIST_HEAD(array
->queue
+ i
);
7287 __clear_bit(i
, array
->bitmap
);
7289 /* delimiter for bitsearch: */
7290 __set_bit(MAX_RT_PRIO
, array
->bitmap
);
7292 #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED
7293 rt_rq
->highest_prio
= MAX_RT_PRIO
;
7296 rt_rq
->rt_nr_migratory
= 0;
7297 rt_rq
->overloaded
= 0;
7301 rt_rq
->rt_throttled
= 0;
7302 rt_rq
->rt_runtime
= 0;
7303 spin_lock_init(&rt_rq
->rt_runtime_lock
);
7305 #ifdef CONFIG_RT_GROUP_SCHED
7306 rt_rq
->rt_nr_boosted
= 0;
7311 #ifdef CONFIG_FAIR_GROUP_SCHED
7312 static void init_tg_cfs_entry(struct rq
*rq
, struct task_group
*tg
,
7313 struct cfs_rq
*cfs_rq
, struct sched_entity
*se
,
7316 tg
->cfs_rq
[cpu
] = cfs_rq
;
7317 init_cfs_rq(cfs_rq
, rq
);
7320 list_add(&cfs_rq
->leaf_cfs_rq_list
, &rq
->leaf_cfs_rq_list
);
7323 se
->cfs_rq
= &rq
->cfs
;
7325 se
->load
.weight
= tg
->shares
;
7326 se
->load
.inv_weight
= div64_64(1ULL<<32, se
->load
.weight
);
7331 #ifdef CONFIG_RT_GROUP_SCHED
7332 static void init_tg_rt_entry(struct rq
*rq
, struct task_group
*tg
,
7333 struct rt_rq
*rt_rq
, struct sched_rt_entity
*rt_se
,
7336 tg
->rt_rq
[cpu
] = rt_rq
;
7337 init_rt_rq(rt_rq
, rq
);
7339 rt_rq
->rt_se
= rt_se
;
7340 rt_rq
->rt_runtime
= tg
->rt_bandwidth
.rt_runtime
;
7342 list_add(&rt_rq
->leaf_rt_rq_list
, &rq
->leaf_rt_rq_list
);
7344 tg
->rt_se
[cpu
] = rt_se
;
7345 rt_se
->rt_rq
= &rq
->rt
;
7346 rt_se
->my_q
= rt_rq
;
7347 rt_se
->parent
= NULL
;
7348 INIT_LIST_HEAD(&rt_se
->run_list
);
7352 void __init
sched_init(void)
7354 int highest_cpu
= 0;
7356 unsigned long alloc_size
= 0, ptr
;
7358 #ifdef CONFIG_FAIR_GROUP_SCHED
7359 alloc_size
+= 2 * nr_cpu_ids
* sizeof(void **);
7361 #ifdef CONFIG_RT_GROUP_SCHED
7362 alloc_size
+= 2 * nr_cpu_ids
* sizeof(void **);
7365 * As sched_init() is called before page_alloc is setup,
7366 * we use alloc_bootmem().
7369 ptr
= (unsigned long)alloc_bootmem_low(alloc_size
);
7371 #ifdef CONFIG_FAIR_GROUP_SCHED
7372 init_task_group
.se
= (struct sched_entity
**)ptr
;
7373 ptr
+= nr_cpu_ids
* sizeof(void **);
7375 init_task_group
.cfs_rq
= (struct cfs_rq
**)ptr
;
7376 ptr
+= nr_cpu_ids
* sizeof(void **);
7378 #ifdef CONFIG_RT_GROUP_SCHED
7379 init_task_group
.rt_se
= (struct sched_rt_entity
**)ptr
;
7380 ptr
+= nr_cpu_ids
* sizeof(void **);
7382 init_task_group
.rt_rq
= (struct rt_rq
**)ptr
;
7387 init_defrootdomain();
7390 init_rt_bandwidth(&def_rt_bandwidth
,
7391 global_rt_period(), global_rt_runtime());
7393 #ifdef CONFIG_RT_GROUP_SCHED
7394 init_rt_bandwidth(&init_task_group
.rt_bandwidth
,
7395 global_rt_period(), global_rt_runtime());
7398 #ifdef CONFIG_GROUP_SCHED
7399 list_add(&init_task_group
.list
, &task_groups
);
7402 for_each_possible_cpu(i
) {
7406 spin_lock_init(&rq
->lock
);
7407 lockdep_set_class(&rq
->lock
, &rq
->rq_lock_key
);
7410 update_last_tick_seen(rq
);
7411 init_cfs_rq(&rq
->cfs
, rq
);
7412 init_rt_rq(&rq
->rt
, rq
);
7413 #ifdef CONFIG_FAIR_GROUP_SCHED
7414 init_task_group
.shares
= init_task_group_load
;
7415 INIT_LIST_HEAD(&rq
->leaf_cfs_rq_list
);
7416 init_tg_cfs_entry(rq
, &init_task_group
,
7417 &per_cpu(init_cfs_rq
, i
),
7418 &per_cpu(init_sched_entity
, i
), i
, 1);
7421 #ifdef CONFIG_RT_GROUP_SCHED
7422 INIT_LIST_HEAD(&rq
->leaf_rt_rq_list
);
7423 init_tg_rt_entry(rq
, &init_task_group
,
7424 &per_cpu(init_rt_rq
, i
),
7425 &per_cpu(init_sched_rt_entity
, i
), i
, 1);
7427 rq
->rt
.rt_runtime
= def_rt_bandwidth
.rt_runtime
;
7430 for (j
= 0; j
< CPU_LOAD_IDX_MAX
; j
++)
7431 rq
->cpu_load
[j
] = 0;
7435 rq
->active_balance
= 0;
7436 rq
->next_balance
= jiffies
;
7439 rq
->migration_thread
= NULL
;
7440 INIT_LIST_HEAD(&rq
->migration_queue
);
7441 rq_attach_root(rq
, &def_root_domain
);
7444 atomic_set(&rq
->nr_iowait
, 0);
7448 set_load_weight(&init_task
);
7450 #ifdef CONFIG_PREEMPT_NOTIFIERS
7451 INIT_HLIST_HEAD(&init_task
.preempt_notifiers
);
7455 nr_cpu_ids
= highest_cpu
+ 1;
7456 open_softirq(SCHED_SOFTIRQ
, run_rebalance_domains
, NULL
);
7459 #ifdef CONFIG_RT_MUTEXES
7460 plist_head_init(&init_task
.pi_waiters
, &init_task
.pi_lock
);
7464 * The boot idle thread does lazy MMU switching as well:
7466 atomic_inc(&init_mm
.mm_count
);
7467 enter_lazy_tlb(&init_mm
, current
);
7470 * Make us the idle thread. Technically, schedule() should not be
7471 * called from this thread, however somewhere below it might be,
7472 * but because we are the idle thread, we just pick up running again
7473 * when this runqueue becomes "idle".
7475 init_idle(current
, smp_processor_id());
7477 * During early bootup we pretend to be a normal task:
7479 current
->sched_class
= &fair_sched_class
;
7481 scheduler_running
= 1;
7484 #ifdef CONFIG_DEBUG_SPINLOCK_SLEEP
7485 void __might_sleep(char *file
, int line
)
7488 static unsigned long prev_jiffy
; /* ratelimiting */
7490 if ((in_atomic() || irqs_disabled()) &&
7491 system_state
== SYSTEM_RUNNING
&& !oops_in_progress
) {
7492 if (time_before(jiffies
, prev_jiffy
+ HZ
) && prev_jiffy
)
7494 prev_jiffy
= jiffies
;
7495 printk(KERN_ERR
"BUG: sleeping function called from invalid"
7496 " context at %s:%d\n", file
, line
);
7497 printk("in_atomic():%d, irqs_disabled():%d\n",
7498 in_atomic(), irqs_disabled());
7499 debug_show_held_locks(current
);
7500 if (irqs_disabled())
7501 print_irqtrace_events(current
);
7506 EXPORT_SYMBOL(__might_sleep
);
7509 #ifdef CONFIG_MAGIC_SYSRQ
7510 static void normalize_task(struct rq
*rq
, struct task_struct
*p
)
7513 update_rq_clock(rq
);
7514 on_rq
= p
->se
.on_rq
;
7516 deactivate_task(rq
, p
, 0);
7517 __setscheduler(rq
, p
, SCHED_NORMAL
, 0);
7519 activate_task(rq
, p
, 0);
7520 resched_task(rq
->curr
);
7524 void normalize_rt_tasks(void)
7526 struct task_struct
*g
, *p
;
7527 unsigned long flags
;
7530 read_lock_irqsave(&tasklist_lock
, flags
);
7531 do_each_thread(g
, p
) {
7533 * Only normalize user tasks:
7538 p
->se
.exec_start
= 0;
7539 #ifdef CONFIG_SCHEDSTATS
7540 p
->se
.wait_start
= 0;
7541 p
->se
.sleep_start
= 0;
7542 p
->se
.block_start
= 0;
7544 task_rq(p
)->clock
= 0;
7548 * Renice negative nice level userspace
7551 if (TASK_NICE(p
) < 0 && p
->mm
)
7552 set_user_nice(p
, 0);
7556 spin_lock(&p
->pi_lock
);
7557 rq
= __task_rq_lock(p
);
7559 normalize_task(rq
, p
);
7561 __task_rq_unlock(rq
);
7562 spin_unlock(&p
->pi_lock
);
7563 } while_each_thread(g
, p
);
7565 read_unlock_irqrestore(&tasklist_lock
, flags
);
7568 #endif /* CONFIG_MAGIC_SYSRQ */
7572 * These functions are only useful for the IA64 MCA handling.
7574 * They can only be called when the whole system has been
7575 * stopped - every CPU needs to be quiescent, and no scheduling
7576 * activity can take place. Using them for anything else would
7577 * be a serious bug, and as a result, they aren't even visible
7578 * under any other configuration.
7582 * curr_task - return the current task for a given cpu.
7583 * @cpu: the processor in question.
7585 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
7587 struct task_struct
*curr_task(int cpu
)
7589 return cpu_curr(cpu
);
7593 * set_curr_task - set the current task for a given cpu.
7594 * @cpu: the processor in question.
7595 * @p: the task pointer to set.
7597 * Description: This function must only be used when non-maskable interrupts
7598 * are serviced on a separate stack. It allows the architecture to switch the
7599 * notion of the current task on a cpu in a non-blocking manner. This function
7600 * must be called with all CPU's synchronized, and interrupts disabled, the
7601 * and caller must save the original value of the current task (see
7602 * curr_task() above) and restore that value before reenabling interrupts and
7603 * re-starting the system.
7605 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
7607 void set_curr_task(int cpu
, struct task_struct
*p
)
7614 #ifdef CONFIG_FAIR_GROUP_SCHED
7615 static void free_fair_sched_group(struct task_group
*tg
)
7619 for_each_possible_cpu(i
) {
7621 kfree(tg
->cfs_rq
[i
]);
7630 static int alloc_fair_sched_group(struct task_group
*tg
)
7632 struct cfs_rq
*cfs_rq
;
7633 struct sched_entity
*se
;
7637 tg
->cfs_rq
= kzalloc(sizeof(cfs_rq
) * nr_cpu_ids
, GFP_KERNEL
);
7640 tg
->se
= kzalloc(sizeof(se
) * nr_cpu_ids
, GFP_KERNEL
);
7644 tg
->shares
= NICE_0_LOAD
;
7646 for_each_possible_cpu(i
) {
7649 cfs_rq
= kmalloc_node(sizeof(struct cfs_rq
),
7650 GFP_KERNEL
|__GFP_ZERO
, cpu_to_node(i
));
7654 se
= kmalloc_node(sizeof(struct sched_entity
),
7655 GFP_KERNEL
|__GFP_ZERO
, cpu_to_node(i
));
7659 init_tg_cfs_entry(rq
, tg
, cfs_rq
, se
, i
, 0);
7668 static inline void register_fair_sched_group(struct task_group
*tg
, int cpu
)
7670 list_add_rcu(&tg
->cfs_rq
[cpu
]->leaf_cfs_rq_list
,
7671 &cpu_rq(cpu
)->leaf_cfs_rq_list
);
7674 static inline void unregister_fair_sched_group(struct task_group
*tg
, int cpu
)
7676 list_del_rcu(&tg
->cfs_rq
[cpu
]->leaf_cfs_rq_list
);
7679 static inline void free_fair_sched_group(struct task_group
*tg
)
7683 static inline int alloc_fair_sched_group(struct task_group
*tg
)
7688 static inline void register_fair_sched_group(struct task_group
*tg
, int cpu
)
7692 static inline void unregister_fair_sched_group(struct task_group
*tg
, int cpu
)
7697 #ifdef CONFIG_RT_GROUP_SCHED
7698 static void free_rt_sched_group(struct task_group
*tg
)
7702 destroy_rt_bandwidth(&tg
->rt_bandwidth
);
7704 for_each_possible_cpu(i
) {
7706 kfree(tg
->rt_rq
[i
]);
7708 kfree(tg
->rt_se
[i
]);
7715 static int alloc_rt_sched_group(struct task_group
*tg
)
7717 struct rt_rq
*rt_rq
;
7718 struct sched_rt_entity
*rt_se
;
7722 tg
->rt_rq
= kzalloc(sizeof(rt_rq
) * nr_cpu_ids
, GFP_KERNEL
);
7725 tg
->rt_se
= kzalloc(sizeof(rt_se
) * nr_cpu_ids
, GFP_KERNEL
);
7729 init_rt_bandwidth(&tg
->rt_bandwidth
,
7730 ktime_to_ns(def_rt_bandwidth
.rt_period
), 0);
7732 for_each_possible_cpu(i
) {
7735 rt_rq
= kmalloc_node(sizeof(struct rt_rq
),
7736 GFP_KERNEL
|__GFP_ZERO
, cpu_to_node(i
));
7740 rt_se
= kmalloc_node(sizeof(struct sched_rt_entity
),
7741 GFP_KERNEL
|__GFP_ZERO
, cpu_to_node(i
));
7745 init_tg_rt_entry(rq
, tg
, rt_rq
, rt_se
, i
, 0);
7754 static inline void register_rt_sched_group(struct task_group
*tg
, int cpu
)
7756 list_add_rcu(&tg
->rt_rq
[cpu
]->leaf_rt_rq_list
,
7757 &cpu_rq(cpu
)->leaf_rt_rq_list
);
7760 static inline void unregister_rt_sched_group(struct task_group
*tg
, int cpu
)
7762 list_del_rcu(&tg
->rt_rq
[cpu
]->leaf_rt_rq_list
);
7765 static inline void free_rt_sched_group(struct task_group
*tg
)
7769 static inline int alloc_rt_sched_group(struct task_group
*tg
)
7774 static inline void register_rt_sched_group(struct task_group
*tg
, int cpu
)
7778 static inline void unregister_rt_sched_group(struct task_group
*tg
, int cpu
)
7783 #ifdef CONFIG_GROUP_SCHED
7784 static void free_sched_group(struct task_group
*tg
)
7786 free_fair_sched_group(tg
);
7787 free_rt_sched_group(tg
);
7791 /* allocate runqueue etc for a new task group */
7792 struct task_group
*sched_create_group(void)
7794 struct task_group
*tg
;
7795 unsigned long flags
;
7798 tg
= kzalloc(sizeof(*tg
), GFP_KERNEL
);
7800 return ERR_PTR(-ENOMEM
);
7802 if (!alloc_fair_sched_group(tg
))
7805 if (!alloc_rt_sched_group(tg
))
7808 spin_lock_irqsave(&task_group_lock
, flags
);
7809 for_each_possible_cpu(i
) {
7810 register_fair_sched_group(tg
, i
);
7811 register_rt_sched_group(tg
, i
);
7813 list_add_rcu(&tg
->list
, &task_groups
);
7814 spin_unlock_irqrestore(&task_group_lock
, flags
);
7819 free_sched_group(tg
);
7820 return ERR_PTR(-ENOMEM
);
7823 /* rcu callback to free various structures associated with a task group */
7824 static void free_sched_group_rcu(struct rcu_head
*rhp
)
7826 /* now it should be safe to free those cfs_rqs */
7827 free_sched_group(container_of(rhp
, struct task_group
, rcu
));
7830 /* Destroy runqueue etc associated with a task group */
7831 void sched_destroy_group(struct task_group
*tg
)
7833 unsigned long flags
;
7836 spin_lock_irqsave(&task_group_lock
, flags
);
7837 for_each_possible_cpu(i
) {
7838 unregister_fair_sched_group(tg
, i
);
7839 unregister_rt_sched_group(tg
, i
);
7841 list_del_rcu(&tg
->list
);
7842 spin_unlock_irqrestore(&task_group_lock
, flags
);
7844 /* wait for possible concurrent references to cfs_rqs complete */
7845 call_rcu(&tg
->rcu
, free_sched_group_rcu
);
7848 /* change task's runqueue when it moves between groups.
7849 * The caller of this function should have put the task in its new group
7850 * by now. This function just updates tsk->se.cfs_rq and tsk->se.parent to
7851 * reflect its new group.
7853 void sched_move_task(struct task_struct
*tsk
)
7856 unsigned long flags
;
7859 rq
= task_rq_lock(tsk
, &flags
);
7861 update_rq_clock(rq
);
7863 running
= task_current(rq
, tsk
);
7864 on_rq
= tsk
->se
.on_rq
;
7867 dequeue_task(rq
, tsk
, 0);
7868 if (unlikely(running
))
7869 tsk
->sched_class
->put_prev_task(rq
, tsk
);
7871 set_task_rq(tsk
, task_cpu(tsk
));
7873 #ifdef CONFIG_FAIR_GROUP_SCHED
7874 if (tsk
->sched_class
->moved_group
)
7875 tsk
->sched_class
->moved_group(tsk
);
7878 if (unlikely(running
))
7879 tsk
->sched_class
->set_curr_task(rq
);
7881 enqueue_task(rq
, tsk
, 0);
7883 task_rq_unlock(rq
, &flags
);
7887 #ifdef CONFIG_FAIR_GROUP_SCHED
7888 static void set_se_shares(struct sched_entity
*se
, unsigned long shares
)
7890 struct cfs_rq
*cfs_rq
= se
->cfs_rq
;
7891 struct rq
*rq
= cfs_rq
->rq
;
7894 spin_lock_irq(&rq
->lock
);
7898 dequeue_entity(cfs_rq
, se
, 0);
7900 se
->load
.weight
= shares
;
7901 se
->load
.inv_weight
= div64_64((1ULL<<32), shares
);
7904 enqueue_entity(cfs_rq
, se
, 0);
7906 spin_unlock_irq(&rq
->lock
);
7909 static DEFINE_MUTEX(shares_mutex
);
7911 int sched_group_set_shares(struct task_group
*tg
, unsigned long shares
)
7914 unsigned long flags
;
7917 * A weight of 0 or 1 can cause arithmetics problems.
7918 * (The default weight is 1024 - so there's no practical
7919 * limitation from this.)
7924 mutex_lock(&shares_mutex
);
7925 if (tg
->shares
== shares
)
7928 spin_lock_irqsave(&task_group_lock
, flags
);
7929 for_each_possible_cpu(i
)
7930 unregister_fair_sched_group(tg
, i
);
7931 spin_unlock_irqrestore(&task_group_lock
, flags
);
7933 /* wait for any ongoing reference to this group to finish */
7934 synchronize_sched();
7937 * Now we are free to modify the group's share on each cpu
7938 * w/o tripping rebalance_share or load_balance_fair.
7940 tg
->shares
= shares
;
7941 for_each_possible_cpu(i
)
7942 set_se_shares(tg
->se
[i
], shares
);
7945 * Enable load balance activity on this group, by inserting it back on
7946 * each cpu's rq->leaf_cfs_rq_list.
7948 spin_lock_irqsave(&task_group_lock
, flags
);
7949 for_each_possible_cpu(i
)
7950 register_fair_sched_group(tg
, i
);
7951 spin_unlock_irqrestore(&task_group_lock
, flags
);
7953 mutex_unlock(&shares_mutex
);
7957 unsigned long sched_group_shares(struct task_group
*tg
)
7963 #ifdef CONFIG_RT_GROUP_SCHED
7965 * Ensure that the real time constraints are schedulable.
7967 static DEFINE_MUTEX(rt_constraints_mutex
);
7969 static unsigned long to_ratio(u64 period
, u64 runtime
)
7971 if (runtime
== RUNTIME_INF
)
7974 return div64_64(runtime
<< 16, period
);
7977 static int __rt_schedulable(struct task_group
*tg
, u64 period
, u64 runtime
)
7979 struct task_group
*tgi
;
7980 unsigned long total
= 0;
7981 unsigned long global_ratio
=
7982 to_ratio(global_rt_period(), global_rt_runtime());
7985 list_for_each_entry_rcu(tgi
, &task_groups
, list
) {
7989 total
+= to_ratio(ktime_to_ns(tgi
->rt_bandwidth
.rt_period
),
7990 tgi
->rt_bandwidth
.rt_runtime
);
7994 return total
+ to_ratio(period
, runtime
) < global_ratio
;
7997 /* Must be called with tasklist_lock held */
7998 static inline int tg_has_rt_tasks(struct task_group
*tg
)
8000 struct task_struct
*g
, *p
;
8001 do_each_thread(g
, p
) {
8002 if (rt_task(p
) && rt_rq_of_se(&p
->rt
)->tg
== tg
)
8004 } while_each_thread(g
, p
);
8008 static int tg_set_bandwidth(struct task_group
*tg
,
8009 u64 rt_period
, u64 rt_runtime
)
8013 mutex_lock(&rt_constraints_mutex
);
8014 read_lock(&tasklist_lock
);
8015 if (rt_runtime
== 0 && tg_has_rt_tasks(tg
)) {
8019 if (!__rt_schedulable(tg
, rt_period
, rt_runtime
)) {
8024 spin_lock_irq(&tg
->rt_bandwidth
.rt_runtime_lock
);
8025 tg
->rt_bandwidth
.rt_period
= ns_to_ktime(rt_period
);
8026 tg
->rt_bandwidth
.rt_runtime
= rt_runtime
;
8028 for_each_possible_cpu(i
) {
8029 struct rt_rq
*rt_rq
= tg
->rt_rq
[i
];
8031 spin_lock(&rt_rq
->rt_runtime_lock
);
8032 rt_rq
->rt_runtime
= rt_runtime
;
8033 spin_unlock(&rt_rq
->rt_runtime_lock
);
8035 spin_unlock_irq(&tg
->rt_bandwidth
.rt_runtime_lock
);
8037 read_unlock(&tasklist_lock
);
8038 mutex_unlock(&rt_constraints_mutex
);
8043 int sched_group_set_rt_runtime(struct task_group
*tg
, long rt_runtime_us
)
8045 u64 rt_runtime
, rt_period
;
8047 rt_period
= ktime_to_ns(tg
->rt_bandwidth
.rt_period
);
8048 rt_runtime
= (u64
)rt_runtime_us
* NSEC_PER_USEC
;
8049 if (rt_runtime_us
< 0)
8050 rt_runtime
= RUNTIME_INF
;
8052 return tg_set_bandwidth(tg
, rt_period
, rt_runtime
);
8055 long sched_group_rt_runtime(struct task_group
*tg
)
8059 if (tg
->rt_bandwidth
.rt_runtime
== RUNTIME_INF
)
8062 rt_runtime_us
= tg
->rt_bandwidth
.rt_runtime
;
8063 do_div(rt_runtime_us
, NSEC_PER_USEC
);
8064 return rt_runtime_us
;
8067 int sched_group_set_rt_period(struct task_group
*tg
, long rt_period_us
)
8069 u64 rt_runtime
, rt_period
;
8071 rt_period
= (u64
)rt_period_us
* NSEC_PER_USEC
;
8072 rt_runtime
= tg
->rt_bandwidth
.rt_runtime
;
8074 return tg_set_bandwidth(tg
, rt_period
, rt_runtime
);
8077 long sched_group_rt_period(struct task_group
*tg
)
8081 rt_period_us
= ktime_to_ns(tg
->rt_bandwidth
.rt_period
);
8082 do_div(rt_period_us
, NSEC_PER_USEC
);
8083 return rt_period_us
;
8086 static int sched_rt_global_constraints(void)
8090 mutex_lock(&rt_constraints_mutex
);
8091 if (!__rt_schedulable(NULL
, 1, 0))
8093 mutex_unlock(&rt_constraints_mutex
);
8098 static int sched_rt_global_constraints(void)
8100 unsigned long flags
;
8103 spin_lock_irqsave(&def_rt_bandwidth
.rt_runtime_lock
, flags
);
8104 for_each_possible_cpu(i
) {
8105 struct rt_rq
*rt_rq
= &cpu_rq(i
)->rt
;
8107 spin_lock(&rt_rq
->rt_runtime_lock
);
8108 rt_rq
->rt_runtime
= global_rt_runtime();
8109 spin_unlock(&rt_rq
->rt_runtime_lock
);
8111 spin_unlock_irqrestore(&def_rt_bandwidth
.rt_runtime_lock
, flags
);
8117 int sched_rt_handler(struct ctl_table
*table
, int write
,
8118 struct file
*filp
, void __user
*buffer
, size_t *lenp
,
8122 int old_period
, old_runtime
;
8123 static DEFINE_MUTEX(mutex
);
8126 old_period
= sysctl_sched_rt_period
;
8127 old_runtime
= sysctl_sched_rt_runtime
;
8129 ret
= proc_dointvec(table
, write
, filp
, buffer
, lenp
, ppos
);
8131 if (!ret
&& write
) {
8132 ret
= sched_rt_global_constraints();
8134 sysctl_sched_rt_period
= old_period
;
8135 sysctl_sched_rt_runtime
= old_runtime
;
8137 def_rt_bandwidth
.rt_runtime
= global_rt_runtime();
8138 def_rt_bandwidth
.rt_period
=
8139 ns_to_ktime(global_rt_period());
8142 mutex_unlock(&mutex
);
8147 #ifdef CONFIG_CGROUP_SCHED
8149 /* return corresponding task_group object of a cgroup */
8150 static inline struct task_group
*cgroup_tg(struct cgroup
*cgrp
)
8152 return container_of(cgroup_subsys_state(cgrp
, cpu_cgroup_subsys_id
),
8153 struct task_group
, css
);
8156 static struct cgroup_subsys_state
*
8157 cpu_cgroup_create(struct cgroup_subsys
*ss
, struct cgroup
*cgrp
)
8159 struct task_group
*tg
;
8161 if (!cgrp
->parent
) {
8162 /* This is early initialization for the top cgroup */
8163 init_task_group
.css
.cgroup
= cgrp
;
8164 return &init_task_group
.css
;
8167 /* we support only 1-level deep hierarchical scheduler atm */
8168 if (cgrp
->parent
->parent
)
8169 return ERR_PTR(-EINVAL
);
8171 tg
= sched_create_group();
8173 return ERR_PTR(-ENOMEM
);
8175 /* Bind the cgroup to task_group object we just created */
8176 tg
->css
.cgroup
= cgrp
;
8182 cpu_cgroup_destroy(struct cgroup_subsys
*ss
, struct cgroup
*cgrp
)
8184 struct task_group
*tg
= cgroup_tg(cgrp
);
8186 sched_destroy_group(tg
);
8190 cpu_cgroup_can_attach(struct cgroup_subsys
*ss
, struct cgroup
*cgrp
,
8191 struct task_struct
*tsk
)
8193 #ifdef CONFIG_RT_GROUP_SCHED
8194 /* Don't accept realtime tasks when there is no way for them to run */
8195 if (rt_task(tsk
) && cgroup_tg(cgrp
)->rt_bandwidth
.rt_runtime
== 0)
8198 /* We don't support RT-tasks being in separate groups */
8199 if (tsk
->sched_class
!= &fair_sched_class
)
8207 cpu_cgroup_attach(struct cgroup_subsys
*ss
, struct cgroup
*cgrp
,
8208 struct cgroup
*old_cont
, struct task_struct
*tsk
)
8210 sched_move_task(tsk
);
8213 #ifdef CONFIG_FAIR_GROUP_SCHED
8214 static int cpu_shares_write_uint(struct cgroup
*cgrp
, struct cftype
*cftype
,
8217 return sched_group_set_shares(cgroup_tg(cgrp
), shareval
);
8220 static u64
cpu_shares_read_uint(struct cgroup
*cgrp
, struct cftype
*cft
)
8222 struct task_group
*tg
= cgroup_tg(cgrp
);
8224 return (u64
) tg
->shares
;
8228 #ifdef CONFIG_RT_GROUP_SCHED
8229 static ssize_t
cpu_rt_runtime_write(struct cgroup
*cgrp
, struct cftype
*cft
,
8231 const char __user
*userbuf
,
8232 size_t nbytes
, loff_t
*unused_ppos
)
8241 if (nbytes
>= sizeof(buffer
))
8243 if (copy_from_user(buffer
, userbuf
, nbytes
))
8246 buffer
[nbytes
] = 0; /* nul-terminate */
8248 /* strip newline if necessary */
8249 if (nbytes
&& (buffer
[nbytes
-1] == '\n'))
8250 buffer
[nbytes
-1] = 0;
8251 val
= simple_strtoll(buffer
, &end
, 0);
8255 /* Pass to subsystem */
8256 retval
= sched_group_set_rt_runtime(cgroup_tg(cgrp
), val
);
8262 static ssize_t
cpu_rt_runtime_read(struct cgroup
*cgrp
, struct cftype
*cft
,
8264 char __user
*buf
, size_t nbytes
,
8268 long val
= sched_group_rt_runtime(cgroup_tg(cgrp
));
8269 int len
= sprintf(tmp
, "%ld\n", val
);
8271 return simple_read_from_buffer(buf
, nbytes
, ppos
, tmp
, len
);
8274 static int cpu_rt_period_write_uint(struct cgroup
*cgrp
, struct cftype
*cftype
,
8277 return sched_group_set_rt_period(cgroup_tg(cgrp
), rt_period_us
);
8280 static u64
cpu_rt_period_read_uint(struct cgroup
*cgrp
, struct cftype
*cft
)
8282 return sched_group_rt_period(cgroup_tg(cgrp
));
8286 static struct cftype cpu_files
[] = {
8287 #ifdef CONFIG_FAIR_GROUP_SCHED
8290 .read_uint
= cpu_shares_read_uint
,
8291 .write_uint
= cpu_shares_write_uint
,
8294 #ifdef CONFIG_RT_GROUP_SCHED
8296 .name
= "rt_runtime_us",
8297 .read
= cpu_rt_runtime_read
,
8298 .write
= cpu_rt_runtime_write
,
8301 .name
= "rt_period_us",
8302 .read_uint
= cpu_rt_period_read_uint
,
8303 .write_uint
= cpu_rt_period_write_uint
,
8308 static int cpu_cgroup_populate(struct cgroup_subsys
*ss
, struct cgroup
*cont
)
8310 return cgroup_add_files(cont
, ss
, cpu_files
, ARRAY_SIZE(cpu_files
));
8313 struct cgroup_subsys cpu_cgroup_subsys
= {
8315 .create
= cpu_cgroup_create
,
8316 .destroy
= cpu_cgroup_destroy
,
8317 .can_attach
= cpu_cgroup_can_attach
,
8318 .attach
= cpu_cgroup_attach
,
8319 .populate
= cpu_cgroup_populate
,
8320 .subsys_id
= cpu_cgroup_subsys_id
,
8324 #endif /* CONFIG_CGROUP_SCHED */
8326 #ifdef CONFIG_CGROUP_CPUACCT
8329 * CPU accounting code for task groups.
8331 * Based on the work by Paul Menage (menage@google.com) and Balbir Singh
8332 * (balbir@in.ibm.com).
8335 /* track cpu usage of a group of tasks */
8337 struct cgroup_subsys_state css
;
8338 /* cpuusage holds pointer to a u64-type object on every cpu */
8342 struct cgroup_subsys cpuacct_subsys
;
8344 /* return cpu accounting group corresponding to this container */
8345 static inline struct cpuacct
*cgroup_ca(struct cgroup
*cgrp
)
8347 return container_of(cgroup_subsys_state(cgrp
, cpuacct_subsys_id
),
8348 struct cpuacct
, css
);
8351 /* return cpu accounting group to which this task belongs */
8352 static inline struct cpuacct
*task_ca(struct task_struct
*tsk
)
8354 return container_of(task_subsys_state(tsk
, cpuacct_subsys_id
),
8355 struct cpuacct
, css
);
8358 /* create a new cpu accounting group */
8359 static struct cgroup_subsys_state
*cpuacct_create(
8360 struct cgroup_subsys
*ss
, struct cgroup
*cgrp
)
8362 struct cpuacct
*ca
= kzalloc(sizeof(*ca
), GFP_KERNEL
);
8365 return ERR_PTR(-ENOMEM
);
8367 ca
->cpuusage
= alloc_percpu(u64
);
8368 if (!ca
->cpuusage
) {
8370 return ERR_PTR(-ENOMEM
);
8376 /* destroy an existing cpu accounting group */
8378 cpuacct_destroy(struct cgroup_subsys
*ss
, struct cgroup
*cgrp
)
8380 struct cpuacct
*ca
= cgroup_ca(cgrp
);
8382 free_percpu(ca
->cpuusage
);
8386 /* return total cpu usage (in nanoseconds) of a group */
8387 static u64
cpuusage_read(struct cgroup
*cgrp
, struct cftype
*cft
)
8389 struct cpuacct
*ca
= cgroup_ca(cgrp
);
8390 u64 totalcpuusage
= 0;
8393 for_each_possible_cpu(i
) {
8394 u64
*cpuusage
= percpu_ptr(ca
->cpuusage
, i
);
8397 * Take rq->lock to make 64-bit addition safe on 32-bit
8400 spin_lock_irq(&cpu_rq(i
)->lock
);
8401 totalcpuusage
+= *cpuusage
;
8402 spin_unlock_irq(&cpu_rq(i
)->lock
);
8405 return totalcpuusage
;
8408 static int cpuusage_write(struct cgroup
*cgrp
, struct cftype
*cftype
,
8411 struct cpuacct
*ca
= cgroup_ca(cgrp
);
8420 for_each_possible_cpu(i
) {
8421 u64
*cpuusage
= percpu_ptr(ca
->cpuusage
, i
);
8423 spin_lock_irq(&cpu_rq(i
)->lock
);
8425 spin_unlock_irq(&cpu_rq(i
)->lock
);
8431 static struct cftype files
[] = {
8434 .read_uint
= cpuusage_read
,
8435 .write_uint
= cpuusage_write
,
8439 static int cpuacct_populate(struct cgroup_subsys
*ss
, struct cgroup
*cgrp
)
8441 return cgroup_add_files(cgrp
, ss
, files
, ARRAY_SIZE(files
));
8445 * charge this task's execution time to its accounting group.
8447 * called with rq->lock held.
8449 static void cpuacct_charge(struct task_struct
*tsk
, u64 cputime
)
8453 if (!cpuacct_subsys
.active
)
8458 u64
*cpuusage
= percpu_ptr(ca
->cpuusage
, task_cpu(tsk
));
8460 *cpuusage
+= cputime
;
8464 struct cgroup_subsys cpuacct_subsys
= {
8466 .create
= cpuacct_create
,
8467 .destroy
= cpuacct_destroy
,
8468 .populate
= cpuacct_populate
,
8469 .subsys_id
= cpuacct_subsys_id
,
8471 #endif /* CONFIG_CGROUP_CPUACCT */