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>
71 #include <linux/debugfs.h>
72 #include <linux/ctype.h>
73 #include <linux/ftrace.h>
76 #include <asm/irq_regs.h>
79 * Convert user-nice values [ -20 ... 0 ... 19 ]
80 * to static priority [ MAX_RT_PRIO..MAX_PRIO-1 ],
83 #define NICE_TO_PRIO(nice) (MAX_RT_PRIO + (nice) + 20)
84 #define PRIO_TO_NICE(prio) ((prio) - MAX_RT_PRIO - 20)
85 #define TASK_NICE(p) PRIO_TO_NICE((p)->static_prio)
88 * 'User priority' is the nice value converted to something we
89 * can work with better when scaling various scheduler parameters,
90 * it's a [ 0 ... 39 ] range.
92 #define USER_PRIO(p) ((p)-MAX_RT_PRIO)
93 #define TASK_USER_PRIO(p) USER_PRIO((p)->static_prio)
94 #define MAX_USER_PRIO (USER_PRIO(MAX_PRIO))
97 * Helpers for converting nanosecond timing to jiffy resolution
99 #define NS_TO_JIFFIES(TIME) ((unsigned long)(TIME) / (NSEC_PER_SEC / HZ))
101 #define NICE_0_LOAD SCHED_LOAD_SCALE
102 #define NICE_0_SHIFT SCHED_LOAD_SHIFT
105 * These are the 'tuning knobs' of the scheduler:
107 * default timeslice is 100 msecs (used only for SCHED_RR tasks).
108 * Timeslices get refilled after they expire.
110 #define DEF_TIMESLICE (100 * HZ / 1000)
113 * single value that denotes runtime == period, ie unlimited time.
115 #define RUNTIME_INF ((u64)~0ULL)
119 * Divide a load by a sched group cpu_power : (load / sg->__cpu_power)
120 * Since cpu_power is a 'constant', we can use a reciprocal divide.
122 static inline u32
sg_div_cpu_power(const struct sched_group
*sg
, u32 load
)
124 return reciprocal_divide(load
, sg
->reciprocal_cpu_power
);
128 * Each time a sched group cpu_power is changed,
129 * we must compute its reciprocal value
131 static inline void sg_inc_cpu_power(struct sched_group
*sg
, u32 val
)
133 sg
->__cpu_power
+= val
;
134 sg
->reciprocal_cpu_power
= reciprocal_value(sg
->__cpu_power
);
138 static inline int rt_policy(int policy
)
140 if (unlikely(policy
== SCHED_FIFO
) || unlikely(policy
== SCHED_RR
))
145 static inline int task_has_rt_policy(struct task_struct
*p
)
147 return rt_policy(p
->policy
);
151 * This is the priority-queue data structure of the RT scheduling class:
153 struct rt_prio_array
{
154 DECLARE_BITMAP(bitmap
, MAX_RT_PRIO
+1); /* include 1 bit for delimiter */
155 struct list_head queue
[MAX_RT_PRIO
];
158 struct rt_bandwidth
{
159 /* nests inside the rq lock: */
160 spinlock_t rt_runtime_lock
;
163 struct hrtimer rt_period_timer
;
166 static struct rt_bandwidth def_rt_bandwidth
;
168 static int do_sched_rt_period_timer(struct rt_bandwidth
*rt_b
, int overrun
);
170 static enum hrtimer_restart
sched_rt_period_timer(struct hrtimer
*timer
)
172 struct rt_bandwidth
*rt_b
=
173 container_of(timer
, struct rt_bandwidth
, rt_period_timer
);
179 now
= hrtimer_cb_get_time(timer
);
180 overrun
= hrtimer_forward(timer
, now
, rt_b
->rt_period
);
185 idle
= do_sched_rt_period_timer(rt_b
, overrun
);
188 return idle
? HRTIMER_NORESTART
: HRTIMER_RESTART
;
192 void init_rt_bandwidth(struct rt_bandwidth
*rt_b
, u64 period
, u64 runtime
)
194 rt_b
->rt_period
= ns_to_ktime(period
);
195 rt_b
->rt_runtime
= runtime
;
197 spin_lock_init(&rt_b
->rt_runtime_lock
);
199 hrtimer_init(&rt_b
->rt_period_timer
,
200 CLOCK_MONOTONIC
, HRTIMER_MODE_REL
);
201 rt_b
->rt_period_timer
.function
= sched_rt_period_timer
;
202 rt_b
->rt_period_timer
.cb_mode
= HRTIMER_CB_IRQSAFE_NO_SOFTIRQ
;
205 static void start_rt_bandwidth(struct rt_bandwidth
*rt_b
)
209 if (rt_b
->rt_runtime
== RUNTIME_INF
)
212 if (hrtimer_active(&rt_b
->rt_period_timer
))
215 spin_lock(&rt_b
->rt_runtime_lock
);
217 if (hrtimer_active(&rt_b
->rt_period_timer
))
220 now
= hrtimer_cb_get_time(&rt_b
->rt_period_timer
);
221 hrtimer_forward(&rt_b
->rt_period_timer
, now
, rt_b
->rt_period
);
222 hrtimer_start(&rt_b
->rt_period_timer
,
223 rt_b
->rt_period_timer
.expires
,
226 spin_unlock(&rt_b
->rt_runtime_lock
);
229 #ifdef CONFIG_RT_GROUP_SCHED
230 static void destroy_rt_bandwidth(struct rt_bandwidth
*rt_b
)
232 hrtimer_cancel(&rt_b
->rt_period_timer
);
237 * sched_domains_mutex serializes calls to arch_init_sched_domains,
238 * detach_destroy_domains and partition_sched_domains.
240 static DEFINE_MUTEX(sched_domains_mutex
);
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
;
274 struct task_group
*parent
;
275 struct list_head siblings
;
276 struct list_head children
;
279 #ifdef CONFIG_USER_SCHED
283 * Every UID task group (including init_task_group aka UID-0) will
284 * be a child to this group.
286 struct task_group root_task_group
;
288 #ifdef CONFIG_FAIR_GROUP_SCHED
289 /* Default task group's sched entity on each cpu */
290 static DEFINE_PER_CPU(struct sched_entity
, init_sched_entity
);
291 /* Default task group's cfs_rq on each cpu */
292 static DEFINE_PER_CPU(struct cfs_rq
, init_cfs_rq
) ____cacheline_aligned_in_smp
;
295 #ifdef CONFIG_RT_GROUP_SCHED
296 static DEFINE_PER_CPU(struct sched_rt_entity
, init_sched_rt_entity
);
297 static DEFINE_PER_CPU(struct rt_rq
, init_rt_rq
) ____cacheline_aligned_in_smp
;
300 #define root_task_group init_task_group
303 /* task_group_lock serializes add/remove of task groups and also changes to
304 * a task group's cpu shares.
306 static DEFINE_SPINLOCK(task_group_lock
);
308 #ifdef CONFIG_FAIR_GROUP_SCHED
309 #ifdef CONFIG_USER_SCHED
310 # define INIT_TASK_GROUP_LOAD (2*NICE_0_LOAD)
312 # define INIT_TASK_GROUP_LOAD NICE_0_LOAD
316 * A weight of 0, 1 or ULONG_MAX can cause arithmetics problems.
317 * (The default weight is 1024 - so there's no practical
318 * limitation from this.)
321 #define MAX_SHARES (ULONG_MAX - 1)
323 static int init_task_group_load
= INIT_TASK_GROUP_LOAD
;
326 /* Default task group.
327 * Every task in system belong to this group at bootup.
329 struct task_group init_task_group
;
331 /* return group to which a task belongs */
332 static inline struct task_group
*task_group(struct task_struct
*p
)
334 struct task_group
*tg
;
336 #ifdef CONFIG_USER_SCHED
338 #elif defined(CONFIG_CGROUP_SCHED)
339 tg
= container_of(task_subsys_state(p
, cpu_cgroup_subsys_id
),
340 struct task_group
, css
);
342 tg
= &init_task_group
;
347 /* Change a task's cfs_rq and parent entity if it moves across CPUs/groups */
348 static inline void set_task_rq(struct task_struct
*p
, unsigned int cpu
)
350 #ifdef CONFIG_FAIR_GROUP_SCHED
351 p
->se
.cfs_rq
= task_group(p
)->cfs_rq
[cpu
];
352 p
->se
.parent
= task_group(p
)->se
[cpu
];
355 #ifdef CONFIG_RT_GROUP_SCHED
356 p
->rt
.rt_rq
= task_group(p
)->rt_rq
[cpu
];
357 p
->rt
.parent
= task_group(p
)->rt_se
[cpu
];
363 static inline void set_task_rq(struct task_struct
*p
, unsigned int cpu
) { }
365 #endif /* CONFIG_GROUP_SCHED */
367 /* CFS-related fields in a runqueue */
369 struct load_weight load
;
370 unsigned long nr_running
;
375 struct rb_root tasks_timeline
;
376 struct rb_node
*rb_leftmost
;
378 struct list_head tasks
;
379 struct list_head
*balance_iterator
;
382 * 'curr' points to currently running entity on this cfs_rq.
383 * It is set to NULL otherwise (i.e when none are currently running).
385 struct sched_entity
*curr
, *next
;
387 unsigned long nr_spread_over
;
389 #ifdef CONFIG_FAIR_GROUP_SCHED
390 struct rq
*rq
; /* cpu runqueue to which this cfs_rq is attached */
393 * leaf cfs_rqs are those that hold tasks (lowest schedulable entity in
394 * a hierarchy). Non-leaf lrqs hold other higher schedulable entities
395 * (like users, containers etc.)
397 * leaf_cfs_rq_list ties together list of leaf cfs_rq's in a cpu. This
398 * list is used during load balance.
400 struct list_head leaf_cfs_rq_list
;
401 struct task_group
*tg
; /* group that "owns" this runqueue */
404 unsigned long task_weight
;
405 unsigned long shares
;
407 * We need space to build a sched_domain wide view of the full task
408 * group tree, in order to avoid depending on dynamic memory allocation
409 * during the load balancing we place this in the per cpu task group
410 * hierarchy. This limits the load balancing to one instance per cpu,
411 * but more should not be needed anyway.
413 struct aggregate_struct
{
415 * load = weight(cpus) * f(tg)
417 * Where f(tg) is the recursive weight fraction assigned to
423 * part of the group weight distributed to this span.
425 unsigned long shares
;
428 * The sum of all runqueue weights within this span.
430 unsigned long rq_weight
;
433 * Weight contributed by tasks; this is the part we can
434 * influence by moving tasks around.
436 unsigned long task_weight
;
442 /* Real-Time classes' related field in a runqueue: */
444 struct rt_prio_array active
;
445 unsigned long rt_nr_running
;
446 #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED
447 int highest_prio
; /* highest queued rt task prio */
450 unsigned long rt_nr_migratory
;
456 /* Nests inside the rq lock: */
457 spinlock_t rt_runtime_lock
;
459 #ifdef CONFIG_RT_GROUP_SCHED
460 unsigned long rt_nr_boosted
;
463 struct list_head leaf_rt_rq_list
;
464 struct task_group
*tg
;
465 struct sched_rt_entity
*rt_se
;
472 * We add the notion of a root-domain which will be used to define per-domain
473 * variables. Each exclusive cpuset essentially defines an island domain by
474 * fully partitioning the member cpus from any other cpuset. Whenever a new
475 * exclusive cpuset is created, we also create and attach a new root-domain
485 * The "RT overload" flag: it gets set if a CPU has more than
486 * one runnable RT task.
493 * By default the system creates a single root-domain with all cpus as
494 * members (mimicking the global state we have today).
496 static struct root_domain def_root_domain
;
501 * This is the main, per-CPU runqueue data structure.
503 * Locking rule: those places that want to lock multiple runqueues
504 * (such as the load balancing or the thread migration code), lock
505 * acquire operations must be ordered by ascending &runqueue.
512 * nr_running and cpu_load should be in the same cacheline because
513 * remote CPUs use both these fields when doing load calculation.
515 unsigned long nr_running
;
516 #define CPU_LOAD_IDX_MAX 5
517 unsigned long cpu_load
[CPU_LOAD_IDX_MAX
];
518 unsigned char idle_at_tick
;
520 unsigned long last_tick_seen
;
521 unsigned char in_nohz_recently
;
523 /* capture load from *all* tasks on this cpu: */
524 struct load_weight load
;
525 unsigned long nr_load_updates
;
531 #ifdef CONFIG_FAIR_GROUP_SCHED
532 /* list of leaf cfs_rq on this cpu: */
533 struct list_head leaf_cfs_rq_list
;
535 #ifdef CONFIG_RT_GROUP_SCHED
536 struct list_head leaf_rt_rq_list
;
540 * This is part of a global counter where only the total sum
541 * over all CPUs matters. A task can increase this counter on
542 * one CPU and if it got migrated afterwards it may decrease
543 * it on another CPU. Always updated under the runqueue lock:
545 unsigned long nr_uninterruptible
;
547 struct task_struct
*curr
, *idle
;
548 unsigned long next_balance
;
549 struct mm_struct
*prev_mm
;
556 struct root_domain
*rd
;
557 struct sched_domain
*sd
;
559 /* For active balancing */
562 /* cpu of this runqueue: */
565 struct task_struct
*migration_thread
;
566 struct list_head migration_queue
;
569 #ifdef CONFIG_SCHED_HRTICK
570 unsigned long hrtick_flags
;
571 ktime_t hrtick_expire
;
572 struct hrtimer hrtick_timer
;
575 #ifdef CONFIG_SCHEDSTATS
577 struct sched_info rq_sched_info
;
579 /* sys_sched_yield() stats */
580 unsigned int yld_exp_empty
;
581 unsigned int yld_act_empty
;
582 unsigned int yld_both_empty
;
583 unsigned int yld_count
;
585 /* schedule() stats */
586 unsigned int sched_switch
;
587 unsigned int sched_count
;
588 unsigned int sched_goidle
;
590 /* try_to_wake_up() stats */
591 unsigned int ttwu_count
;
592 unsigned int ttwu_local
;
595 unsigned int bkl_count
;
597 struct lock_class_key rq_lock_key
;
600 static DEFINE_PER_CPU_SHARED_ALIGNED(struct rq
, runqueues
);
602 static inline void check_preempt_curr(struct rq
*rq
, struct task_struct
*p
)
604 rq
->curr
->sched_class
->check_preempt_curr(rq
, p
);
607 static inline int cpu_of(struct rq
*rq
)
617 * The domain tree (rq->sd) is protected by RCU's quiescent state transition.
618 * See detach_destroy_domains: synchronize_sched for details.
620 * The domain tree of any CPU may only be accessed from within
621 * preempt-disabled sections.
623 #define for_each_domain(cpu, __sd) \
624 for (__sd = rcu_dereference(cpu_rq(cpu)->sd); __sd; __sd = __sd->parent)
626 #define cpu_rq(cpu) (&per_cpu(runqueues, (cpu)))
627 #define this_rq() (&__get_cpu_var(runqueues))
628 #define task_rq(p) cpu_rq(task_cpu(p))
629 #define cpu_curr(cpu) (cpu_rq(cpu)->curr)
631 static inline void update_rq_clock(struct rq
*rq
)
633 rq
->clock
= sched_clock_cpu(cpu_of(rq
));
637 * Tunables that become constants when CONFIG_SCHED_DEBUG is off:
639 #ifdef CONFIG_SCHED_DEBUG
640 # define const_debug __read_mostly
642 # define const_debug static const
646 * Debugging: various feature bits
649 #define SCHED_FEAT(name, enabled) \
650 __SCHED_FEAT_##name ,
653 #include "sched_features.h"
658 #define SCHED_FEAT(name, enabled) \
659 (1UL << __SCHED_FEAT_##name) * enabled |
661 const_debug
unsigned int sysctl_sched_features
=
662 #include "sched_features.h"
667 #ifdef CONFIG_SCHED_DEBUG
668 #define SCHED_FEAT(name, enabled) \
671 static __read_mostly
char *sched_feat_names
[] = {
672 #include "sched_features.h"
678 static int sched_feat_open(struct inode
*inode
, struct file
*filp
)
680 filp
->private_data
= inode
->i_private
;
685 sched_feat_read(struct file
*filp
, char __user
*ubuf
,
686 size_t cnt
, loff_t
*ppos
)
693 for (i
= 0; sched_feat_names
[i
]; i
++) {
694 len
+= strlen(sched_feat_names
[i
]);
698 buf
= kmalloc(len
+ 2, GFP_KERNEL
);
702 for (i
= 0; sched_feat_names
[i
]; i
++) {
703 if (sysctl_sched_features
& (1UL << i
))
704 r
+= sprintf(buf
+ r
, "%s ", sched_feat_names
[i
]);
706 r
+= sprintf(buf
+ r
, "NO_%s ", sched_feat_names
[i
]);
709 r
+= sprintf(buf
+ r
, "\n");
710 WARN_ON(r
>= len
+ 2);
712 r
= simple_read_from_buffer(ubuf
, cnt
, ppos
, buf
, r
);
720 sched_feat_write(struct file
*filp
, const char __user
*ubuf
,
721 size_t cnt
, loff_t
*ppos
)
731 if (copy_from_user(&buf
, ubuf
, cnt
))
736 if (strncmp(buf
, "NO_", 3) == 0) {
741 for (i
= 0; sched_feat_names
[i
]; i
++) {
742 int len
= strlen(sched_feat_names
[i
]);
744 if (strncmp(cmp
, sched_feat_names
[i
], len
) == 0) {
746 sysctl_sched_features
&= ~(1UL << i
);
748 sysctl_sched_features
|= (1UL << i
);
753 if (!sched_feat_names
[i
])
761 static struct file_operations sched_feat_fops
= {
762 .open
= sched_feat_open
,
763 .read
= sched_feat_read
,
764 .write
= sched_feat_write
,
767 static __init
int sched_init_debug(void)
769 debugfs_create_file("sched_features", 0644, NULL
, NULL
,
774 late_initcall(sched_init_debug
);
778 #define sched_feat(x) (sysctl_sched_features & (1UL << __SCHED_FEAT_##x))
781 * Number of tasks to iterate in a single balance run.
782 * Limited because this is done with IRQs disabled.
784 const_debug
unsigned int sysctl_sched_nr_migrate
= 32;
787 * period over which we measure -rt task cpu usage in us.
790 unsigned int sysctl_sched_rt_period
= 1000000;
792 static __read_mostly
int scheduler_running
;
795 * part of the period that we allow rt tasks to run in us.
798 int sysctl_sched_rt_runtime
= 950000;
800 static inline u64
global_rt_period(void)
802 return (u64
)sysctl_sched_rt_period
* NSEC_PER_USEC
;
805 static inline u64
global_rt_runtime(void)
807 if (sysctl_sched_rt_period
< 0)
810 return (u64
)sysctl_sched_rt_runtime
* NSEC_PER_USEC
;
813 unsigned long long time_sync_thresh
= 100000;
815 static DEFINE_PER_CPU(unsigned long long, time_offset
);
816 static DEFINE_PER_CPU(unsigned long long, prev_cpu_time
);
819 * Global lock which we take every now and then to synchronize
820 * the CPUs time. This method is not warp-safe, but it's good
821 * enough to synchronize slowly diverging time sources and thus
822 * it's good enough for tracing:
824 static DEFINE_SPINLOCK(time_sync_lock
);
825 static unsigned long long prev_global_time
;
827 static unsigned long long __sync_cpu_clock(unsigned long long time
, int cpu
)
830 * We want this inlined, to not get tracer function calls
831 * in this critical section:
833 spin_acquire(&time_sync_lock
.dep_map
, 0, 0, _THIS_IP_
);
834 __raw_spin_lock(&time_sync_lock
.raw_lock
);
836 if (time
< prev_global_time
) {
837 per_cpu(time_offset
, cpu
) += prev_global_time
- time
;
838 time
= prev_global_time
;
840 prev_global_time
= time
;
843 __raw_spin_unlock(&time_sync_lock
.raw_lock
);
844 spin_release(&time_sync_lock
.dep_map
, 1, _THIS_IP_
);
849 static unsigned long long __cpu_clock(int cpu
)
851 unsigned long long now
;
854 * Only call sched_clock() if the scheduler has already been
855 * initialized (some code might call cpu_clock() very early):
857 if (unlikely(!scheduler_running
))
860 now
= sched_clock_cpu(cpu
);
866 * For kernel-internal use: high-speed (but slightly incorrect) per-cpu
867 * clock constructed from sched_clock():
869 unsigned long long cpu_clock(int cpu
)
871 unsigned long long prev_cpu_time
, time
, delta_time
;
874 local_irq_save(flags
);
875 prev_cpu_time
= per_cpu(prev_cpu_time
, cpu
);
876 time
= __cpu_clock(cpu
) + per_cpu(time_offset
, cpu
);
877 delta_time
= time
-prev_cpu_time
;
879 if (unlikely(delta_time
> time_sync_thresh
)) {
880 time
= __sync_cpu_clock(time
, cpu
);
881 per_cpu(prev_cpu_time
, cpu
) = time
;
883 local_irq_restore(flags
);
887 EXPORT_SYMBOL_GPL(cpu_clock
);
889 #ifndef prepare_arch_switch
890 # define prepare_arch_switch(next) do { } while (0)
892 #ifndef finish_arch_switch
893 # define finish_arch_switch(prev) do { } while (0)
896 static inline int task_current(struct rq
*rq
, struct task_struct
*p
)
898 return rq
->curr
== p
;
901 #ifndef __ARCH_WANT_UNLOCKED_CTXSW
902 static inline int task_running(struct rq
*rq
, struct task_struct
*p
)
904 return task_current(rq
, p
);
907 static inline void prepare_lock_switch(struct rq
*rq
, struct task_struct
*next
)
911 static inline void finish_lock_switch(struct rq
*rq
, struct task_struct
*prev
)
913 #ifdef CONFIG_DEBUG_SPINLOCK
914 /* this is a valid case when another task releases the spinlock */
915 rq
->lock
.owner
= current
;
918 * If we are tracking spinlock dependencies then we have to
919 * fix up the runqueue lock - which gets 'carried over' from
922 spin_acquire(&rq
->lock
.dep_map
, 0, 0, _THIS_IP_
);
924 spin_unlock_irq(&rq
->lock
);
927 #else /* __ARCH_WANT_UNLOCKED_CTXSW */
928 static inline int task_running(struct rq
*rq
, struct task_struct
*p
)
933 return task_current(rq
, p
);
937 static inline void prepare_lock_switch(struct rq
*rq
, struct task_struct
*next
)
941 * We can optimise this out completely for !SMP, because the
942 * SMP rebalancing from interrupt is the only thing that cares
947 #ifdef __ARCH_WANT_INTERRUPTS_ON_CTXSW
948 spin_unlock_irq(&rq
->lock
);
950 spin_unlock(&rq
->lock
);
954 static inline void finish_lock_switch(struct rq
*rq
, struct task_struct
*prev
)
958 * After ->oncpu is cleared, the task can be moved to a different CPU.
959 * We must ensure this doesn't happen until the switch is completely
965 #ifndef __ARCH_WANT_INTERRUPTS_ON_CTXSW
969 #endif /* __ARCH_WANT_UNLOCKED_CTXSW */
972 * __task_rq_lock - lock the runqueue a given task resides on.
973 * Must be called interrupts disabled.
975 static inline struct rq
*__task_rq_lock(struct task_struct
*p
)
979 struct rq
*rq
= task_rq(p
);
980 spin_lock(&rq
->lock
);
981 if (likely(rq
== task_rq(p
)))
983 spin_unlock(&rq
->lock
);
988 * task_rq_lock - lock the runqueue a given task resides on and disable
989 * interrupts. Note the ordering: we can safely lookup the task_rq without
990 * explicitly disabling preemption.
992 static struct rq
*task_rq_lock(struct task_struct
*p
, unsigned long *flags
)
998 local_irq_save(*flags
);
1000 spin_lock(&rq
->lock
);
1001 if (likely(rq
== task_rq(p
)))
1003 spin_unlock_irqrestore(&rq
->lock
, *flags
);
1007 static void __task_rq_unlock(struct rq
*rq
)
1008 __releases(rq
->lock
)
1010 spin_unlock(&rq
->lock
);
1013 static inline void task_rq_unlock(struct rq
*rq
, unsigned long *flags
)
1014 __releases(rq
->lock
)
1016 spin_unlock_irqrestore(&rq
->lock
, *flags
);
1020 * this_rq_lock - lock this runqueue and disable interrupts.
1022 static struct rq
*this_rq_lock(void)
1023 __acquires(rq
->lock
)
1027 local_irq_disable();
1029 spin_lock(&rq
->lock
);
1034 static void __resched_task(struct task_struct
*p
, int tif_bit
);
1036 static inline void resched_task(struct task_struct
*p
)
1038 __resched_task(p
, TIF_NEED_RESCHED
);
1041 #ifdef CONFIG_SCHED_HRTICK
1043 * Use HR-timers to deliver accurate preemption points.
1045 * Its all a bit involved since we cannot program an hrt while holding the
1046 * rq->lock. So what we do is store a state in in rq->hrtick_* and ask for a
1049 * When we get rescheduled we reprogram the hrtick_timer outside of the
1052 static inline void resched_hrt(struct task_struct
*p
)
1054 __resched_task(p
, TIF_HRTICK_RESCHED
);
1057 static inline void resched_rq(struct rq
*rq
)
1059 unsigned long flags
;
1061 spin_lock_irqsave(&rq
->lock
, flags
);
1062 resched_task(rq
->curr
);
1063 spin_unlock_irqrestore(&rq
->lock
, flags
);
1067 HRTICK_SET
, /* re-programm hrtick_timer */
1068 HRTICK_RESET
, /* not a new slice */
1069 HRTICK_BLOCK
, /* stop hrtick operations */
1074 * - enabled by features
1075 * - hrtimer is actually high res
1077 static inline int hrtick_enabled(struct rq
*rq
)
1079 if (!sched_feat(HRTICK
))
1081 if (unlikely(test_bit(HRTICK_BLOCK
, &rq
->hrtick_flags
)))
1083 return hrtimer_is_hres_active(&rq
->hrtick_timer
);
1087 * Called to set the hrtick timer state.
1089 * called with rq->lock held and irqs disabled
1091 static void hrtick_start(struct rq
*rq
, u64 delay
, int reset
)
1093 assert_spin_locked(&rq
->lock
);
1096 * preempt at: now + delay
1099 ktime_add_ns(rq
->hrtick_timer
.base
->get_time(), delay
);
1101 * indicate we need to program the timer
1103 __set_bit(HRTICK_SET
, &rq
->hrtick_flags
);
1105 __set_bit(HRTICK_RESET
, &rq
->hrtick_flags
);
1108 * New slices are called from the schedule path and don't need a
1109 * forced reschedule.
1112 resched_hrt(rq
->curr
);
1115 static void hrtick_clear(struct rq
*rq
)
1117 if (hrtimer_active(&rq
->hrtick_timer
))
1118 hrtimer_cancel(&rq
->hrtick_timer
);
1122 * Update the timer from the possible pending state.
1124 static void hrtick_set(struct rq
*rq
)
1128 unsigned long flags
;
1130 WARN_ON_ONCE(cpu_of(rq
) != smp_processor_id());
1132 spin_lock_irqsave(&rq
->lock
, flags
);
1133 set
= __test_and_clear_bit(HRTICK_SET
, &rq
->hrtick_flags
);
1134 reset
= __test_and_clear_bit(HRTICK_RESET
, &rq
->hrtick_flags
);
1135 time
= rq
->hrtick_expire
;
1136 clear_thread_flag(TIF_HRTICK_RESCHED
);
1137 spin_unlock_irqrestore(&rq
->lock
, flags
);
1140 hrtimer_start(&rq
->hrtick_timer
, time
, HRTIMER_MODE_ABS
);
1141 if (reset
&& !hrtimer_active(&rq
->hrtick_timer
))
1148 * High-resolution timer tick.
1149 * Runs from hardirq context with interrupts disabled.
1151 static enum hrtimer_restart
hrtick(struct hrtimer
*timer
)
1153 struct rq
*rq
= container_of(timer
, struct rq
, hrtick_timer
);
1155 WARN_ON_ONCE(cpu_of(rq
) != smp_processor_id());
1157 spin_lock(&rq
->lock
);
1158 update_rq_clock(rq
);
1159 rq
->curr
->sched_class
->task_tick(rq
, rq
->curr
, 1);
1160 spin_unlock(&rq
->lock
);
1162 return HRTIMER_NORESTART
;
1165 static void hotplug_hrtick_disable(int cpu
)
1167 struct rq
*rq
= cpu_rq(cpu
);
1168 unsigned long flags
;
1170 spin_lock_irqsave(&rq
->lock
, flags
);
1171 rq
->hrtick_flags
= 0;
1172 __set_bit(HRTICK_BLOCK
, &rq
->hrtick_flags
);
1173 spin_unlock_irqrestore(&rq
->lock
, flags
);
1178 static void hotplug_hrtick_enable(int cpu
)
1180 struct rq
*rq
= cpu_rq(cpu
);
1181 unsigned long flags
;
1183 spin_lock_irqsave(&rq
->lock
, flags
);
1184 __clear_bit(HRTICK_BLOCK
, &rq
->hrtick_flags
);
1185 spin_unlock_irqrestore(&rq
->lock
, flags
);
1189 hotplug_hrtick(struct notifier_block
*nfb
, unsigned long action
, void *hcpu
)
1191 int cpu
= (int)(long)hcpu
;
1194 case CPU_UP_CANCELED
:
1195 case CPU_UP_CANCELED_FROZEN
:
1196 case CPU_DOWN_PREPARE
:
1197 case CPU_DOWN_PREPARE_FROZEN
:
1199 case CPU_DEAD_FROZEN
:
1200 hotplug_hrtick_disable(cpu
);
1203 case CPU_UP_PREPARE
:
1204 case CPU_UP_PREPARE_FROZEN
:
1205 case CPU_DOWN_FAILED
:
1206 case CPU_DOWN_FAILED_FROZEN
:
1208 case CPU_ONLINE_FROZEN
:
1209 hotplug_hrtick_enable(cpu
);
1216 static void init_hrtick(void)
1218 hotcpu_notifier(hotplug_hrtick
, 0);
1221 static void init_rq_hrtick(struct rq
*rq
)
1223 rq
->hrtick_flags
= 0;
1224 hrtimer_init(&rq
->hrtick_timer
, CLOCK_MONOTONIC
, HRTIMER_MODE_REL
);
1225 rq
->hrtick_timer
.function
= hrtick
;
1226 rq
->hrtick_timer
.cb_mode
= HRTIMER_CB_IRQSAFE_NO_SOFTIRQ
;
1229 void hrtick_resched(void)
1232 unsigned long flags
;
1234 if (!test_thread_flag(TIF_HRTICK_RESCHED
))
1237 local_irq_save(flags
);
1238 rq
= cpu_rq(smp_processor_id());
1240 local_irq_restore(flags
);
1243 static inline void hrtick_clear(struct rq
*rq
)
1247 static inline void hrtick_set(struct rq
*rq
)
1251 static inline void init_rq_hrtick(struct rq
*rq
)
1255 void hrtick_resched(void)
1259 static inline void init_hrtick(void)
1265 * resched_task - mark a task 'to be rescheduled now'.
1267 * On UP this means the setting of the need_resched flag, on SMP it
1268 * might also involve a cross-CPU call to trigger the scheduler on
1273 #ifndef tsk_is_polling
1274 #define tsk_is_polling(t) test_tsk_thread_flag(t, TIF_POLLING_NRFLAG)
1277 static void __resched_task(struct task_struct
*p
, int tif_bit
)
1281 assert_spin_locked(&task_rq(p
)->lock
);
1283 if (unlikely(test_tsk_thread_flag(p
, tif_bit
)))
1286 set_tsk_thread_flag(p
, tif_bit
);
1289 if (cpu
== smp_processor_id())
1292 /* NEED_RESCHED must be visible before we test polling */
1294 if (!tsk_is_polling(p
))
1295 smp_send_reschedule(cpu
);
1298 static void resched_cpu(int cpu
)
1300 struct rq
*rq
= cpu_rq(cpu
);
1301 unsigned long flags
;
1303 if (!spin_trylock_irqsave(&rq
->lock
, flags
))
1305 resched_task(cpu_curr(cpu
));
1306 spin_unlock_irqrestore(&rq
->lock
, flags
);
1311 * When add_timer_on() enqueues a timer into the timer wheel of an
1312 * idle CPU then this timer might expire before the next timer event
1313 * which is scheduled to wake up that CPU. In case of a completely
1314 * idle system the next event might even be infinite time into the
1315 * future. wake_up_idle_cpu() ensures that the CPU is woken up and
1316 * leaves the inner idle loop so the newly added timer is taken into
1317 * account when the CPU goes back to idle and evaluates the timer
1318 * wheel for the next timer event.
1320 void wake_up_idle_cpu(int cpu
)
1322 struct rq
*rq
= cpu_rq(cpu
);
1324 if (cpu
== smp_processor_id())
1328 * This is safe, as this function is called with the timer
1329 * wheel base lock of (cpu) held. When the CPU is on the way
1330 * to idle and has not yet set rq->curr to idle then it will
1331 * be serialized on the timer wheel base lock and take the new
1332 * timer into account automatically.
1334 if (rq
->curr
!= rq
->idle
)
1338 * We can set TIF_RESCHED on the idle task of the other CPU
1339 * lockless. The worst case is that the other CPU runs the
1340 * idle task through an additional NOOP schedule()
1342 set_tsk_thread_flag(rq
->idle
, TIF_NEED_RESCHED
);
1344 /* NEED_RESCHED must be visible before we test polling */
1346 if (!tsk_is_polling(rq
->idle
))
1347 smp_send_reschedule(cpu
);
1352 static void __resched_task(struct task_struct
*p
, int tif_bit
)
1354 assert_spin_locked(&task_rq(p
)->lock
);
1355 set_tsk_thread_flag(p
, tif_bit
);
1359 #if BITS_PER_LONG == 32
1360 # define WMULT_CONST (~0UL)
1362 # define WMULT_CONST (1UL << 32)
1365 #define WMULT_SHIFT 32
1368 * Shift right and round:
1370 #define SRR(x, y) (((x) + (1UL << ((y) - 1))) >> (y))
1373 * delta *= weight / lw
1375 static unsigned long
1376 calc_delta_mine(unsigned long delta_exec
, unsigned long weight
,
1377 struct load_weight
*lw
)
1381 if (!lw
->inv_weight
)
1382 lw
->inv_weight
= 1 + (WMULT_CONST
-lw
->weight
/2)/(lw
->weight
+1);
1384 tmp
= (u64
)delta_exec
* weight
;
1386 * Check whether we'd overflow the 64-bit multiplication:
1388 if (unlikely(tmp
> WMULT_CONST
))
1389 tmp
= SRR(SRR(tmp
, WMULT_SHIFT
/2) * lw
->inv_weight
,
1392 tmp
= SRR(tmp
* lw
->inv_weight
, WMULT_SHIFT
);
1394 return (unsigned long)min(tmp
, (u64
)(unsigned long)LONG_MAX
);
1397 static inline void update_load_add(struct load_weight
*lw
, unsigned long inc
)
1403 static inline void update_load_sub(struct load_weight
*lw
, unsigned long dec
)
1410 * To aid in avoiding the subversion of "niceness" due to uneven distribution
1411 * of tasks with abnormal "nice" values across CPUs the contribution that
1412 * each task makes to its run queue's load is weighted according to its
1413 * scheduling class and "nice" value. For SCHED_NORMAL tasks this is just a
1414 * scaled version of the new time slice allocation that they receive on time
1418 #define WEIGHT_IDLEPRIO 2
1419 #define WMULT_IDLEPRIO (1 << 31)
1422 * Nice levels are multiplicative, with a gentle 10% change for every
1423 * nice level changed. I.e. when a CPU-bound task goes from nice 0 to
1424 * nice 1, it will get ~10% less CPU time than another CPU-bound task
1425 * that remained on nice 0.
1427 * The "10% effect" is relative and cumulative: from _any_ nice level,
1428 * if you go up 1 level, it's -10% CPU usage, if you go down 1 level
1429 * it's +10% CPU usage. (to achieve that we use a multiplier of 1.25.
1430 * If a task goes up by ~10% and another task goes down by ~10% then
1431 * the relative distance between them is ~25%.)
1433 static const int prio_to_weight
[40] = {
1434 /* -20 */ 88761, 71755, 56483, 46273, 36291,
1435 /* -15 */ 29154, 23254, 18705, 14949, 11916,
1436 /* -10 */ 9548, 7620, 6100, 4904, 3906,
1437 /* -5 */ 3121, 2501, 1991, 1586, 1277,
1438 /* 0 */ 1024, 820, 655, 526, 423,
1439 /* 5 */ 335, 272, 215, 172, 137,
1440 /* 10 */ 110, 87, 70, 56, 45,
1441 /* 15 */ 36, 29, 23, 18, 15,
1445 * Inverse (2^32/x) values of the prio_to_weight[] array, precalculated.
1447 * In cases where the weight does not change often, we can use the
1448 * precalculated inverse to speed up arithmetics by turning divisions
1449 * into multiplications:
1451 static const u32 prio_to_wmult
[40] = {
1452 /* -20 */ 48388, 59856, 76040, 92818, 118348,
1453 /* -15 */ 147320, 184698, 229616, 287308, 360437,
1454 /* -10 */ 449829, 563644, 704093, 875809, 1099582,
1455 /* -5 */ 1376151, 1717300, 2157191, 2708050, 3363326,
1456 /* 0 */ 4194304, 5237765, 6557202, 8165337, 10153587,
1457 /* 5 */ 12820798, 15790321, 19976592, 24970740, 31350126,
1458 /* 10 */ 39045157, 49367440, 61356676, 76695844, 95443717,
1459 /* 15 */ 119304647, 148102320, 186737708, 238609294, 286331153,
1462 static void activate_task(struct rq
*rq
, struct task_struct
*p
, int wakeup
);
1465 * runqueue iterator, to support SMP load-balancing between different
1466 * scheduling classes, without having to expose their internal data
1467 * structures to the load-balancing proper:
1469 struct rq_iterator
{
1471 struct task_struct
*(*start
)(void *);
1472 struct task_struct
*(*next
)(void *);
1476 static unsigned long
1477 balance_tasks(struct rq
*this_rq
, int this_cpu
, struct rq
*busiest
,
1478 unsigned long max_load_move
, struct sched_domain
*sd
,
1479 enum cpu_idle_type idle
, int *all_pinned
,
1480 int *this_best_prio
, struct rq_iterator
*iterator
);
1483 iter_move_one_task(struct rq
*this_rq
, int this_cpu
, struct rq
*busiest
,
1484 struct sched_domain
*sd
, enum cpu_idle_type idle
,
1485 struct rq_iterator
*iterator
);
1488 #ifdef CONFIG_CGROUP_CPUACCT
1489 static void cpuacct_charge(struct task_struct
*tsk
, u64 cputime
);
1491 static inline void cpuacct_charge(struct task_struct
*tsk
, u64 cputime
) {}
1494 static inline void inc_cpu_load(struct rq
*rq
, unsigned long load
)
1496 update_load_add(&rq
->load
, load
);
1499 static inline void dec_cpu_load(struct rq
*rq
, unsigned long load
)
1501 update_load_sub(&rq
->load
, load
);
1505 static unsigned long source_load(int cpu
, int type
);
1506 static unsigned long target_load(int cpu
, int type
);
1507 static unsigned long cpu_avg_load_per_task(int cpu
);
1508 static int task_hot(struct task_struct
*p
, u64 now
, struct sched_domain
*sd
);
1510 #ifdef CONFIG_FAIR_GROUP_SCHED
1513 * Group load balancing.
1515 * We calculate a few balance domain wide aggregate numbers; load and weight.
1516 * Given the pictures below, and assuming each item has equal weight:
1527 * A and B get 1/3-rd of the total load. C and D get 1/3-rd of A's 1/3-rd,
1528 * which equals 1/9-th of the total load.
1531 * The weight of this group on the selected cpus.
1534 * Direct sum of all the cpu's their rq weight, e.g. A would get 3 while
1538 * Part of the rq_weight contributed by tasks; all groups except B would
1542 static inline struct aggregate_struct
*
1543 aggregate(struct task_group
*tg
, struct sched_domain
*sd
)
1545 return &tg
->cfs_rq
[sd
->first_cpu
]->aggregate
;
1548 typedef void (*aggregate_func
)(struct task_group
*, struct sched_domain
*);
1551 * Iterate the full tree, calling @down when first entering a node and @up when
1552 * leaving it for the final time.
1555 void aggregate_walk_tree(aggregate_func down
, aggregate_func up
,
1556 struct sched_domain
*sd
)
1558 struct task_group
*parent
, *child
;
1561 parent
= &root_task_group
;
1563 (*down
)(parent
, sd
);
1564 list_for_each_entry_rcu(child
, &parent
->children
, siblings
) {
1574 parent
= parent
->parent
;
1581 * Calculate the aggregate runqueue weight.
1584 void aggregate_group_weight(struct task_group
*tg
, struct sched_domain
*sd
)
1586 unsigned long rq_weight
= 0;
1587 unsigned long task_weight
= 0;
1590 for_each_cpu_mask(i
, sd
->span
) {
1591 rq_weight
+= tg
->cfs_rq
[i
]->load
.weight
;
1592 task_weight
+= tg
->cfs_rq
[i
]->task_weight
;
1595 aggregate(tg
, sd
)->rq_weight
= rq_weight
;
1596 aggregate(tg
, sd
)->task_weight
= task_weight
;
1600 * Compute the weight of this group on the given cpus.
1603 void aggregate_group_shares(struct task_group
*tg
, struct sched_domain
*sd
)
1605 unsigned long shares
= 0;
1608 for_each_cpu_mask(i
, sd
->span
)
1609 shares
+= tg
->cfs_rq
[i
]->shares
;
1611 if ((!shares
&& aggregate(tg
, sd
)->rq_weight
) || shares
> tg
->shares
)
1612 shares
= tg
->shares
;
1614 aggregate(tg
, sd
)->shares
= shares
;
1618 * Compute the load fraction assigned to this group, relies on the aggregate
1619 * weight and this group's parent's load, i.e. top-down.
1622 void aggregate_group_load(struct task_group
*tg
, struct sched_domain
*sd
)
1630 for_each_cpu_mask(i
, sd
->span
)
1631 load
+= cpu_rq(i
)->load
.weight
;
1634 load
= aggregate(tg
->parent
, sd
)->load
;
1637 * shares is our weight in the parent's rq so
1638 * shares/parent->rq_weight gives our fraction of the load
1640 load
*= aggregate(tg
, sd
)->shares
;
1641 load
/= aggregate(tg
->parent
, sd
)->rq_weight
+ 1;
1644 aggregate(tg
, sd
)->load
= load
;
1647 static void __set_se_shares(struct sched_entity
*se
, unsigned long shares
);
1650 * Calculate and set the cpu's group shares.
1653 __update_group_shares_cpu(struct task_group
*tg
, struct sched_domain
*sd
,
1657 unsigned long shares
;
1658 unsigned long rq_weight
;
1663 rq_weight
= tg
->cfs_rq
[tcpu
]->load
.weight
;
1666 * If there are currently no tasks on the cpu pretend there is one of
1667 * average load so that when a new task gets to run here it will not
1668 * get delayed by group starvation.
1672 rq_weight
= NICE_0_LOAD
;
1676 * \Sum shares * rq_weight
1677 * shares = -----------------------
1681 shares
= aggregate(tg
, sd
)->shares
* rq_weight
;
1682 shares
/= aggregate(tg
, sd
)->rq_weight
+ 1;
1685 * record the actual number of shares, not the boosted amount.
1687 tg
->cfs_rq
[tcpu
]->shares
= boost
? 0 : shares
;
1689 if (shares
< MIN_SHARES
)
1690 shares
= MIN_SHARES
;
1691 else if (shares
> MAX_SHARES
)
1692 shares
= MAX_SHARES
;
1694 __set_se_shares(tg
->se
[tcpu
], shares
);
1698 * Re-adjust the weights on the cpu the task came from and on the cpu the
1702 __move_group_shares(struct task_group
*tg
, struct sched_domain
*sd
,
1705 unsigned long shares
;
1707 shares
= tg
->cfs_rq
[scpu
]->shares
+ tg
->cfs_rq
[dcpu
]->shares
;
1709 __update_group_shares_cpu(tg
, sd
, scpu
);
1710 __update_group_shares_cpu(tg
, sd
, dcpu
);
1713 * ensure we never loose shares due to rounding errors in the
1714 * above redistribution.
1716 shares
-= tg
->cfs_rq
[scpu
]->shares
+ tg
->cfs_rq
[dcpu
]->shares
;
1718 tg
->cfs_rq
[dcpu
]->shares
+= shares
;
1722 * Because changing a group's shares changes the weight of the super-group
1723 * we need to walk up the tree and change all shares until we hit the root.
1726 move_group_shares(struct task_group
*tg
, struct sched_domain
*sd
,
1730 __move_group_shares(tg
, sd
, scpu
, dcpu
);
1736 void aggregate_group_set_shares(struct task_group
*tg
, struct sched_domain
*sd
)
1738 unsigned long shares
= aggregate(tg
, sd
)->shares
;
1741 for_each_cpu_mask(i
, sd
->span
) {
1742 struct rq
*rq
= cpu_rq(i
);
1743 unsigned long flags
;
1745 spin_lock_irqsave(&rq
->lock
, flags
);
1746 __update_group_shares_cpu(tg
, sd
, i
);
1747 spin_unlock_irqrestore(&rq
->lock
, flags
);
1750 aggregate_group_shares(tg
, sd
);
1753 * ensure we never loose shares due to rounding errors in the
1754 * above redistribution.
1756 shares
-= aggregate(tg
, sd
)->shares
;
1758 tg
->cfs_rq
[sd
->first_cpu
]->shares
+= shares
;
1759 aggregate(tg
, sd
)->shares
+= shares
;
1764 * Calculate the accumulative weight and recursive load of each task group
1765 * while walking down the tree.
1768 void aggregate_get_down(struct task_group
*tg
, struct sched_domain
*sd
)
1770 aggregate_group_weight(tg
, sd
);
1771 aggregate_group_shares(tg
, sd
);
1772 aggregate_group_load(tg
, sd
);
1776 * Rebalance the cpu shares while walking back up the tree.
1779 void aggregate_get_up(struct task_group
*tg
, struct sched_domain
*sd
)
1781 aggregate_group_set_shares(tg
, sd
);
1784 static DEFINE_PER_CPU(spinlock_t
, aggregate_lock
);
1786 static void __init
init_aggregate(void)
1790 for_each_possible_cpu(i
)
1791 spin_lock_init(&per_cpu(aggregate_lock
, i
));
1794 static int get_aggregate(struct sched_domain
*sd
)
1796 if (!spin_trylock(&per_cpu(aggregate_lock
, sd
->first_cpu
)))
1799 aggregate_walk_tree(aggregate_get_down
, aggregate_get_up
, sd
);
1803 static void put_aggregate(struct sched_domain
*sd
)
1805 spin_unlock(&per_cpu(aggregate_lock
, sd
->first_cpu
));
1808 static void cfs_rq_set_shares(struct cfs_rq
*cfs_rq
, unsigned long shares
)
1810 cfs_rq
->shares
= shares
;
1815 static inline void init_aggregate(void)
1819 static inline int get_aggregate(struct sched_domain
*sd
)
1824 static inline void put_aggregate(struct sched_domain
*sd
)
1829 #else /* CONFIG_SMP */
1831 #ifdef CONFIG_FAIR_GROUP_SCHED
1832 static void cfs_rq_set_shares(struct cfs_rq
*cfs_rq
, unsigned long shares
)
1837 #endif /* CONFIG_SMP */
1839 #include "sched_stats.h"
1840 #include "sched_idletask.c"
1841 #include "sched_fair.c"
1842 #include "sched_rt.c"
1843 #ifdef CONFIG_SCHED_DEBUG
1844 # include "sched_debug.c"
1847 #define sched_class_highest (&rt_sched_class)
1849 static void inc_nr_running(struct rq
*rq
)
1854 static void dec_nr_running(struct rq
*rq
)
1859 static void set_load_weight(struct task_struct
*p
)
1861 if (task_has_rt_policy(p
)) {
1862 p
->se
.load
.weight
= prio_to_weight
[0] * 2;
1863 p
->se
.load
.inv_weight
= prio_to_wmult
[0] >> 1;
1868 * SCHED_IDLE tasks get minimal weight:
1870 if (p
->policy
== SCHED_IDLE
) {
1871 p
->se
.load
.weight
= WEIGHT_IDLEPRIO
;
1872 p
->se
.load
.inv_weight
= WMULT_IDLEPRIO
;
1876 p
->se
.load
.weight
= prio_to_weight
[p
->static_prio
- MAX_RT_PRIO
];
1877 p
->se
.load
.inv_weight
= prio_to_wmult
[p
->static_prio
- MAX_RT_PRIO
];
1880 static void enqueue_task(struct rq
*rq
, struct task_struct
*p
, int wakeup
)
1882 sched_info_queued(p
);
1883 p
->sched_class
->enqueue_task(rq
, p
, wakeup
);
1887 static void dequeue_task(struct rq
*rq
, struct task_struct
*p
, int sleep
)
1889 p
->sched_class
->dequeue_task(rq
, p
, sleep
);
1894 * __normal_prio - return the priority that is based on the static prio
1896 static inline int __normal_prio(struct task_struct
*p
)
1898 return p
->static_prio
;
1902 * Calculate the expected normal priority: i.e. priority
1903 * without taking RT-inheritance into account. Might be
1904 * boosted by interactivity modifiers. Changes upon fork,
1905 * setprio syscalls, and whenever the interactivity
1906 * estimator recalculates.
1908 static inline int normal_prio(struct task_struct
*p
)
1912 if (task_has_rt_policy(p
))
1913 prio
= MAX_RT_PRIO
-1 - p
->rt_priority
;
1915 prio
= __normal_prio(p
);
1920 * Calculate the current priority, i.e. the priority
1921 * taken into account by the scheduler. This value might
1922 * be boosted by RT tasks, or might be boosted by
1923 * interactivity modifiers. Will be RT if the task got
1924 * RT-boosted. If not then it returns p->normal_prio.
1926 static int effective_prio(struct task_struct
*p
)
1928 p
->normal_prio
= normal_prio(p
);
1930 * If we are RT tasks or we were boosted to RT priority,
1931 * keep the priority unchanged. Otherwise, update priority
1932 * to the normal priority:
1934 if (!rt_prio(p
->prio
))
1935 return p
->normal_prio
;
1940 * activate_task - move a task to the runqueue.
1942 static void activate_task(struct rq
*rq
, struct task_struct
*p
, int wakeup
)
1944 if (task_contributes_to_load(p
))
1945 rq
->nr_uninterruptible
--;
1947 enqueue_task(rq
, p
, wakeup
);
1952 * deactivate_task - remove a task from the runqueue.
1954 static void deactivate_task(struct rq
*rq
, struct task_struct
*p
, int sleep
)
1956 if (task_contributes_to_load(p
))
1957 rq
->nr_uninterruptible
++;
1959 dequeue_task(rq
, p
, sleep
);
1964 * task_curr - is this task currently executing on a CPU?
1965 * @p: the task in question.
1967 inline int task_curr(const struct task_struct
*p
)
1969 return cpu_curr(task_cpu(p
)) == p
;
1972 /* Used instead of source_load when we know the type == 0 */
1973 unsigned long weighted_cpuload(const int cpu
)
1975 return cpu_rq(cpu
)->load
.weight
;
1978 static inline void __set_task_cpu(struct task_struct
*p
, unsigned int cpu
)
1980 set_task_rq(p
, cpu
);
1983 * After ->cpu is set up to a new value, task_rq_lock(p, ...) can be
1984 * successfuly executed on another CPU. We must ensure that updates of
1985 * per-task data have been completed by this moment.
1988 task_thread_info(p
)->cpu
= cpu
;
1992 static inline void check_class_changed(struct rq
*rq
, struct task_struct
*p
,
1993 const struct sched_class
*prev_class
,
1994 int oldprio
, int running
)
1996 if (prev_class
!= p
->sched_class
) {
1997 if (prev_class
->switched_from
)
1998 prev_class
->switched_from(rq
, p
, running
);
1999 p
->sched_class
->switched_to(rq
, p
, running
);
2001 p
->sched_class
->prio_changed(rq
, p
, oldprio
, running
);
2007 * Is this task likely cache-hot:
2010 task_hot(struct task_struct
*p
, u64 now
, struct sched_domain
*sd
)
2015 * Buddy candidates are cache hot:
2017 if (sched_feat(CACHE_HOT_BUDDY
) && (&p
->se
== cfs_rq_of(&p
->se
)->next
))
2020 if (p
->sched_class
!= &fair_sched_class
)
2023 if (sysctl_sched_migration_cost
== -1)
2025 if (sysctl_sched_migration_cost
== 0)
2028 delta
= now
- p
->se
.exec_start
;
2030 return delta
< (s64
)sysctl_sched_migration_cost
;
2034 void set_task_cpu(struct task_struct
*p
, unsigned int new_cpu
)
2036 int old_cpu
= task_cpu(p
);
2037 struct rq
*old_rq
= cpu_rq(old_cpu
), *new_rq
= cpu_rq(new_cpu
);
2038 struct cfs_rq
*old_cfsrq
= task_cfs_rq(p
),
2039 *new_cfsrq
= cpu_cfs_rq(old_cfsrq
, new_cpu
);
2042 clock_offset
= old_rq
->clock
- new_rq
->clock
;
2044 #ifdef CONFIG_SCHEDSTATS
2045 if (p
->se
.wait_start
)
2046 p
->se
.wait_start
-= clock_offset
;
2047 if (p
->se
.sleep_start
)
2048 p
->se
.sleep_start
-= clock_offset
;
2049 if (p
->se
.block_start
)
2050 p
->se
.block_start
-= clock_offset
;
2051 if (old_cpu
!= new_cpu
) {
2052 schedstat_inc(p
, se
.nr_migrations
);
2053 if (task_hot(p
, old_rq
->clock
, NULL
))
2054 schedstat_inc(p
, se
.nr_forced2_migrations
);
2057 p
->se
.vruntime
-= old_cfsrq
->min_vruntime
-
2058 new_cfsrq
->min_vruntime
;
2060 __set_task_cpu(p
, new_cpu
);
2063 struct migration_req
{
2064 struct list_head list
;
2066 struct task_struct
*task
;
2069 struct completion done
;
2073 * The task's runqueue lock must be held.
2074 * Returns true if you have to wait for migration thread.
2077 migrate_task(struct task_struct
*p
, int dest_cpu
, struct migration_req
*req
)
2079 struct rq
*rq
= task_rq(p
);
2082 * If the task is not on a runqueue (and not running), then
2083 * it is sufficient to simply update the task's cpu field.
2085 if (!p
->se
.on_rq
&& !task_running(rq
, p
)) {
2086 set_task_cpu(p
, dest_cpu
);
2090 init_completion(&req
->done
);
2092 req
->dest_cpu
= dest_cpu
;
2093 list_add(&req
->list
, &rq
->migration_queue
);
2099 * wait_task_inactive - wait for a thread to unschedule.
2101 * The caller must ensure that the task *will* unschedule sometime soon,
2102 * else this function might spin for a *long* time. This function can't
2103 * be called with interrupts off, or it may introduce deadlock with
2104 * smp_call_function() if an IPI is sent by the same process we are
2105 * waiting to become inactive.
2107 void wait_task_inactive(struct task_struct
*p
)
2109 unsigned long flags
;
2115 * We do the initial early heuristics without holding
2116 * any task-queue locks at all. We'll only try to get
2117 * the runqueue lock when things look like they will
2123 * If the task is actively running on another CPU
2124 * still, just relax and busy-wait without holding
2127 * NOTE! Since we don't hold any locks, it's not
2128 * even sure that "rq" stays as the right runqueue!
2129 * But we don't care, since "task_running()" will
2130 * return false if the runqueue has changed and p
2131 * is actually now running somewhere else!
2133 while (task_running(rq
, p
))
2137 * Ok, time to look more closely! We need the rq
2138 * lock now, to be *sure*. If we're wrong, we'll
2139 * just go back and repeat.
2141 rq
= task_rq_lock(p
, &flags
);
2142 running
= task_running(rq
, p
);
2143 on_rq
= p
->se
.on_rq
;
2144 task_rq_unlock(rq
, &flags
);
2147 * Was it really running after all now that we
2148 * checked with the proper locks actually held?
2150 * Oops. Go back and try again..
2152 if (unlikely(running
)) {
2158 * It's not enough that it's not actively running,
2159 * it must be off the runqueue _entirely_, and not
2162 * So if it wa still runnable (but just not actively
2163 * running right now), it's preempted, and we should
2164 * yield - it could be a while.
2166 if (unlikely(on_rq
)) {
2167 schedule_timeout_uninterruptible(1);
2172 * Ahh, all good. It wasn't running, and it wasn't
2173 * runnable, which means that it will never become
2174 * running in the future either. We're all done!
2181 * kick_process - kick a running thread to enter/exit the kernel
2182 * @p: the to-be-kicked thread
2184 * Cause a process which is running on another CPU to enter
2185 * kernel-mode, without any delay. (to get signals handled.)
2187 * NOTE: this function doesnt have to take the runqueue lock,
2188 * because all it wants to ensure is that the remote task enters
2189 * the kernel. If the IPI races and the task has been migrated
2190 * to another CPU then no harm is done and the purpose has been
2193 void kick_process(struct task_struct
*p
)
2199 if ((cpu
!= smp_processor_id()) && task_curr(p
))
2200 smp_send_reschedule(cpu
);
2205 * Return a low guess at the load of a migration-source cpu weighted
2206 * according to the scheduling class and "nice" value.
2208 * We want to under-estimate the load of migration sources, to
2209 * balance conservatively.
2211 static unsigned long source_load(int cpu
, int type
)
2213 struct rq
*rq
= cpu_rq(cpu
);
2214 unsigned long total
= weighted_cpuload(cpu
);
2219 return min(rq
->cpu_load
[type
-1], total
);
2223 * Return a high guess at the load of a migration-target cpu weighted
2224 * according to the scheduling class and "nice" value.
2226 static unsigned long target_load(int cpu
, int type
)
2228 struct rq
*rq
= cpu_rq(cpu
);
2229 unsigned long total
= weighted_cpuload(cpu
);
2234 return max(rq
->cpu_load
[type
-1], total
);
2238 * Return the average load per task on the cpu's run queue
2240 static unsigned long cpu_avg_load_per_task(int cpu
)
2242 struct rq
*rq
= cpu_rq(cpu
);
2243 unsigned long total
= weighted_cpuload(cpu
);
2244 unsigned long n
= rq
->nr_running
;
2246 return n
? total
/ n
: SCHED_LOAD_SCALE
;
2250 * find_idlest_group finds and returns the least busy CPU group within the
2253 static struct sched_group
*
2254 find_idlest_group(struct sched_domain
*sd
, struct task_struct
*p
, int this_cpu
)
2256 struct sched_group
*idlest
= NULL
, *this = NULL
, *group
= sd
->groups
;
2257 unsigned long min_load
= ULONG_MAX
, this_load
= 0;
2258 int load_idx
= sd
->forkexec_idx
;
2259 int imbalance
= 100 + (sd
->imbalance_pct
-100)/2;
2262 unsigned long load
, avg_load
;
2266 /* Skip over this group if it has no CPUs allowed */
2267 if (!cpus_intersects(group
->cpumask
, p
->cpus_allowed
))
2270 local_group
= cpu_isset(this_cpu
, group
->cpumask
);
2272 /* Tally up the load of all CPUs in the group */
2275 for_each_cpu_mask(i
, group
->cpumask
) {
2276 /* Bias balancing toward cpus of our domain */
2278 load
= source_load(i
, load_idx
);
2280 load
= target_load(i
, load_idx
);
2285 /* Adjust by relative CPU power of the group */
2286 avg_load
= sg_div_cpu_power(group
,
2287 avg_load
* SCHED_LOAD_SCALE
);
2290 this_load
= avg_load
;
2292 } else if (avg_load
< min_load
) {
2293 min_load
= avg_load
;
2296 } while (group
= group
->next
, group
!= sd
->groups
);
2298 if (!idlest
|| 100*this_load
< imbalance
*min_load
)
2304 * find_idlest_cpu - find the idlest cpu among the cpus in group.
2307 find_idlest_cpu(struct sched_group
*group
, struct task_struct
*p
, int this_cpu
,
2310 unsigned long load
, min_load
= ULONG_MAX
;
2314 /* Traverse only the allowed CPUs */
2315 cpus_and(*tmp
, group
->cpumask
, p
->cpus_allowed
);
2317 for_each_cpu_mask(i
, *tmp
) {
2318 load
= weighted_cpuload(i
);
2320 if (load
< min_load
|| (load
== min_load
&& i
== this_cpu
)) {
2330 * sched_balance_self: balance the current task (running on cpu) in domains
2331 * that have the 'flag' flag set. In practice, this is SD_BALANCE_FORK and
2334 * Balance, ie. select the least loaded group.
2336 * Returns the target CPU number, or the same CPU if no balancing is needed.
2338 * preempt must be disabled.
2340 static int sched_balance_self(int cpu
, int flag
)
2342 struct task_struct
*t
= current
;
2343 struct sched_domain
*tmp
, *sd
= NULL
;
2345 for_each_domain(cpu
, tmp
) {
2347 * If power savings logic is enabled for a domain, stop there.
2349 if (tmp
->flags
& SD_POWERSAVINGS_BALANCE
)
2351 if (tmp
->flags
& flag
)
2356 cpumask_t span
, tmpmask
;
2357 struct sched_group
*group
;
2358 int new_cpu
, weight
;
2360 if (!(sd
->flags
& flag
)) {
2366 group
= find_idlest_group(sd
, t
, cpu
);
2372 new_cpu
= find_idlest_cpu(group
, t
, cpu
, &tmpmask
);
2373 if (new_cpu
== -1 || new_cpu
== cpu
) {
2374 /* Now try balancing at a lower domain level of cpu */
2379 /* Now try balancing at a lower domain level of new_cpu */
2382 weight
= cpus_weight(span
);
2383 for_each_domain(cpu
, tmp
) {
2384 if (weight
<= cpus_weight(tmp
->span
))
2386 if (tmp
->flags
& flag
)
2389 /* while loop will break here if sd == NULL */
2395 #endif /* CONFIG_SMP */
2398 * try_to_wake_up - wake up a thread
2399 * @p: the to-be-woken-up thread
2400 * @state: the mask of task states that can be woken
2401 * @sync: do a synchronous wakeup?
2403 * Put it on the run-queue if it's not already there. The "current"
2404 * thread is always on the run-queue (except when the actual
2405 * re-schedule is in progress), and as such you're allowed to do
2406 * the simpler "current->state = TASK_RUNNING" to mark yourself
2407 * runnable without the overhead of this.
2409 * returns failure only if the task is already active.
2411 static int try_to_wake_up(struct task_struct
*p
, unsigned int state
, int sync
)
2413 int cpu
, orig_cpu
, this_cpu
, success
= 0;
2414 unsigned long flags
;
2418 if (!sched_feat(SYNC_WAKEUPS
))
2422 rq
= task_rq_lock(p
, &flags
);
2423 old_state
= p
->state
;
2424 if (!(old_state
& state
))
2432 this_cpu
= smp_processor_id();
2435 if (unlikely(task_running(rq
, p
)))
2438 cpu
= p
->sched_class
->select_task_rq(p
, sync
);
2439 if (cpu
!= orig_cpu
) {
2440 set_task_cpu(p
, cpu
);
2441 task_rq_unlock(rq
, &flags
);
2442 /* might preempt at this point */
2443 rq
= task_rq_lock(p
, &flags
);
2444 old_state
= p
->state
;
2445 if (!(old_state
& state
))
2450 this_cpu
= smp_processor_id();
2454 #ifdef CONFIG_SCHEDSTATS
2455 schedstat_inc(rq
, ttwu_count
);
2456 if (cpu
== this_cpu
)
2457 schedstat_inc(rq
, ttwu_local
);
2459 struct sched_domain
*sd
;
2460 for_each_domain(this_cpu
, sd
) {
2461 if (cpu_isset(cpu
, sd
->span
)) {
2462 schedstat_inc(sd
, ttwu_wake_remote
);
2470 #endif /* CONFIG_SMP */
2471 ftrace_wake_up_task(p
, rq
->curr
);
2472 schedstat_inc(p
, se
.nr_wakeups
);
2474 schedstat_inc(p
, se
.nr_wakeups_sync
);
2475 if (orig_cpu
!= cpu
)
2476 schedstat_inc(p
, se
.nr_wakeups_migrate
);
2477 if (cpu
== this_cpu
)
2478 schedstat_inc(p
, se
.nr_wakeups_local
);
2480 schedstat_inc(p
, se
.nr_wakeups_remote
);
2481 update_rq_clock(rq
);
2482 activate_task(rq
, p
, 1);
2486 check_preempt_curr(rq
, p
);
2488 p
->state
= TASK_RUNNING
;
2490 if (p
->sched_class
->task_wake_up
)
2491 p
->sched_class
->task_wake_up(rq
, p
);
2494 task_rq_unlock(rq
, &flags
);
2499 int wake_up_process(struct task_struct
*p
)
2501 return try_to_wake_up(p
, TASK_ALL
, 0);
2503 EXPORT_SYMBOL(wake_up_process
);
2505 int wake_up_state(struct task_struct
*p
, unsigned int state
)
2507 return try_to_wake_up(p
, state
, 0);
2511 * Perform scheduler related setup for a newly forked process p.
2512 * p is forked by current.
2514 * __sched_fork() is basic setup used by init_idle() too:
2516 static void __sched_fork(struct task_struct
*p
)
2518 p
->se
.exec_start
= 0;
2519 p
->se
.sum_exec_runtime
= 0;
2520 p
->se
.prev_sum_exec_runtime
= 0;
2521 p
->se
.last_wakeup
= 0;
2522 p
->se
.avg_overlap
= 0;
2524 #ifdef CONFIG_SCHEDSTATS
2525 p
->se
.wait_start
= 0;
2526 p
->se
.sum_sleep_runtime
= 0;
2527 p
->se
.sleep_start
= 0;
2528 p
->se
.block_start
= 0;
2529 p
->se
.sleep_max
= 0;
2530 p
->se
.block_max
= 0;
2532 p
->se
.slice_max
= 0;
2536 INIT_LIST_HEAD(&p
->rt
.run_list
);
2538 INIT_LIST_HEAD(&p
->se
.group_node
);
2540 #ifdef CONFIG_PREEMPT_NOTIFIERS
2541 INIT_HLIST_HEAD(&p
->preempt_notifiers
);
2545 * We mark the process as running here, but have not actually
2546 * inserted it onto the runqueue yet. This guarantees that
2547 * nobody will actually run it, and a signal or other external
2548 * event cannot wake it up and insert it on the runqueue either.
2550 p
->state
= TASK_RUNNING
;
2554 * fork()/clone()-time setup:
2556 void sched_fork(struct task_struct
*p
, int clone_flags
)
2558 int cpu
= get_cpu();
2563 cpu
= sched_balance_self(cpu
, SD_BALANCE_FORK
);
2565 set_task_cpu(p
, cpu
);
2568 * Make sure we do not leak PI boosting priority to the child:
2570 p
->prio
= current
->normal_prio
;
2571 if (!rt_prio(p
->prio
))
2572 p
->sched_class
= &fair_sched_class
;
2574 #if defined(CONFIG_SCHEDSTATS) || defined(CONFIG_TASK_DELAY_ACCT)
2575 if (likely(sched_info_on()))
2576 memset(&p
->sched_info
, 0, sizeof(p
->sched_info
));
2578 #if defined(CONFIG_SMP) && defined(__ARCH_WANT_UNLOCKED_CTXSW)
2581 #ifdef CONFIG_PREEMPT
2582 /* Want to start with kernel preemption disabled. */
2583 task_thread_info(p
)->preempt_count
= 1;
2589 * wake_up_new_task - wake up a newly created task for the first time.
2591 * This function will do some initial scheduler statistics housekeeping
2592 * that must be done for every newly created context, then puts the task
2593 * on the runqueue and wakes it.
2595 void wake_up_new_task(struct task_struct
*p
, unsigned long clone_flags
)
2597 unsigned long flags
;
2600 rq
= task_rq_lock(p
, &flags
);
2601 BUG_ON(p
->state
!= TASK_RUNNING
);
2602 update_rq_clock(rq
);
2604 p
->prio
= effective_prio(p
);
2606 if (!p
->sched_class
->task_new
|| !current
->se
.on_rq
) {
2607 activate_task(rq
, p
, 0);
2610 * Let the scheduling class do new task startup
2611 * management (if any):
2613 p
->sched_class
->task_new(rq
, p
);
2616 ftrace_wake_up_new_task(p
, rq
->curr
);
2617 check_preempt_curr(rq
, p
);
2619 if (p
->sched_class
->task_wake_up
)
2620 p
->sched_class
->task_wake_up(rq
, p
);
2622 task_rq_unlock(rq
, &flags
);
2625 #ifdef CONFIG_PREEMPT_NOTIFIERS
2628 * preempt_notifier_register - tell me when current is being being preempted & rescheduled
2629 * @notifier: notifier struct to register
2631 void preempt_notifier_register(struct preempt_notifier
*notifier
)
2633 hlist_add_head(¬ifier
->link
, ¤t
->preempt_notifiers
);
2635 EXPORT_SYMBOL_GPL(preempt_notifier_register
);
2638 * preempt_notifier_unregister - no longer interested in preemption notifications
2639 * @notifier: notifier struct to unregister
2641 * This is safe to call from within a preemption notifier.
2643 void preempt_notifier_unregister(struct preempt_notifier
*notifier
)
2645 hlist_del(¬ifier
->link
);
2647 EXPORT_SYMBOL_GPL(preempt_notifier_unregister
);
2649 static void fire_sched_in_preempt_notifiers(struct task_struct
*curr
)
2651 struct preempt_notifier
*notifier
;
2652 struct hlist_node
*node
;
2654 hlist_for_each_entry(notifier
, node
, &curr
->preempt_notifiers
, link
)
2655 notifier
->ops
->sched_in(notifier
, raw_smp_processor_id());
2659 fire_sched_out_preempt_notifiers(struct task_struct
*curr
,
2660 struct task_struct
*next
)
2662 struct preempt_notifier
*notifier
;
2663 struct hlist_node
*node
;
2665 hlist_for_each_entry(notifier
, node
, &curr
->preempt_notifiers
, link
)
2666 notifier
->ops
->sched_out(notifier
, next
);
2671 static void fire_sched_in_preempt_notifiers(struct task_struct
*curr
)
2676 fire_sched_out_preempt_notifiers(struct task_struct
*curr
,
2677 struct task_struct
*next
)
2684 * prepare_task_switch - prepare to switch tasks
2685 * @rq: the runqueue preparing to switch
2686 * @prev: the current task that is being switched out
2687 * @next: the task we are going to switch to.
2689 * This is called with the rq lock held and interrupts off. It must
2690 * be paired with a subsequent finish_task_switch after the context
2693 * prepare_task_switch sets up locking and calls architecture specific
2697 prepare_task_switch(struct rq
*rq
, struct task_struct
*prev
,
2698 struct task_struct
*next
)
2700 fire_sched_out_preempt_notifiers(prev
, next
);
2701 prepare_lock_switch(rq
, next
);
2702 prepare_arch_switch(next
);
2706 * finish_task_switch - clean up after a task-switch
2707 * @rq: runqueue associated with task-switch
2708 * @prev: the thread we just switched away from.
2710 * finish_task_switch must be called after the context switch, paired
2711 * with a prepare_task_switch call before the context switch.
2712 * finish_task_switch will reconcile locking set up by prepare_task_switch,
2713 * and do any other architecture-specific cleanup actions.
2715 * Note that we may have delayed dropping an mm in context_switch(). If
2716 * so, we finish that here outside of the runqueue lock. (Doing it
2717 * with the lock held can cause deadlocks; see schedule() for
2720 static void finish_task_switch(struct rq
*rq
, struct task_struct
*prev
)
2721 __releases(rq
->lock
)
2723 struct mm_struct
*mm
= rq
->prev_mm
;
2729 * A task struct has one reference for the use as "current".
2730 * If a task dies, then it sets TASK_DEAD in tsk->state and calls
2731 * schedule one last time. The schedule call will never return, and
2732 * the scheduled task must drop that reference.
2733 * The test for TASK_DEAD must occur while the runqueue locks are
2734 * still held, otherwise prev could be scheduled on another cpu, die
2735 * there before we look at prev->state, and then the reference would
2737 * Manfred Spraul <manfred@colorfullife.com>
2739 prev_state
= prev
->state
;
2740 finish_arch_switch(prev
);
2741 finish_lock_switch(rq
, prev
);
2743 if (current
->sched_class
->post_schedule
)
2744 current
->sched_class
->post_schedule(rq
);
2747 fire_sched_in_preempt_notifiers(current
);
2750 if (unlikely(prev_state
== TASK_DEAD
)) {
2752 * Remove function-return probe instances associated with this
2753 * task and put them back on the free list.
2755 kprobe_flush_task(prev
);
2756 put_task_struct(prev
);
2761 * schedule_tail - first thing a freshly forked thread must call.
2762 * @prev: the thread we just switched away from.
2764 asmlinkage
void schedule_tail(struct task_struct
*prev
)
2765 __releases(rq
->lock
)
2767 struct rq
*rq
= this_rq();
2769 finish_task_switch(rq
, prev
);
2770 #ifdef __ARCH_WANT_UNLOCKED_CTXSW
2771 /* In this case, finish_task_switch does not reenable preemption */
2774 if (current
->set_child_tid
)
2775 put_user(task_pid_vnr(current
), current
->set_child_tid
);
2779 * context_switch - switch to the new MM and the new
2780 * thread's register state.
2783 context_switch(struct rq
*rq
, struct task_struct
*prev
,
2784 struct task_struct
*next
)
2786 struct mm_struct
*mm
, *oldmm
;
2788 prepare_task_switch(rq
, prev
, next
);
2789 ftrace_ctx_switch(prev
, next
);
2791 oldmm
= prev
->active_mm
;
2793 * For paravirt, this is coupled with an exit in switch_to to
2794 * combine the page table reload and the switch backend into
2797 arch_enter_lazy_cpu_mode();
2799 if (unlikely(!mm
)) {
2800 next
->active_mm
= oldmm
;
2801 atomic_inc(&oldmm
->mm_count
);
2802 enter_lazy_tlb(oldmm
, next
);
2804 switch_mm(oldmm
, mm
, next
);
2806 if (unlikely(!prev
->mm
)) {
2807 prev
->active_mm
= NULL
;
2808 rq
->prev_mm
= oldmm
;
2811 * Since the runqueue lock will be released by the next
2812 * task (which is an invalid locking op but in the case
2813 * of the scheduler it's an obvious special-case), so we
2814 * do an early lockdep release here:
2816 #ifndef __ARCH_WANT_UNLOCKED_CTXSW
2817 spin_release(&rq
->lock
.dep_map
, 1, _THIS_IP_
);
2820 /* Here we just switch the register state and the stack. */
2821 switch_to(prev
, next
, prev
);
2825 * this_rq must be evaluated again because prev may have moved
2826 * CPUs since it called schedule(), thus the 'rq' on its stack
2827 * frame will be invalid.
2829 finish_task_switch(this_rq(), prev
);
2833 * nr_running, nr_uninterruptible and nr_context_switches:
2835 * externally visible scheduler statistics: current number of runnable
2836 * threads, current number of uninterruptible-sleeping threads, total
2837 * number of context switches performed since bootup.
2839 unsigned long nr_running(void)
2841 unsigned long i
, sum
= 0;
2843 for_each_online_cpu(i
)
2844 sum
+= cpu_rq(i
)->nr_running
;
2849 unsigned long nr_uninterruptible(void)
2851 unsigned long i
, sum
= 0;
2853 for_each_possible_cpu(i
)
2854 sum
+= cpu_rq(i
)->nr_uninterruptible
;
2857 * Since we read the counters lockless, it might be slightly
2858 * inaccurate. Do not allow it to go below zero though:
2860 if (unlikely((long)sum
< 0))
2866 unsigned long long nr_context_switches(void)
2869 unsigned long long sum
= 0;
2871 for_each_possible_cpu(i
)
2872 sum
+= cpu_rq(i
)->nr_switches
;
2877 unsigned long nr_iowait(void)
2879 unsigned long i
, sum
= 0;
2881 for_each_possible_cpu(i
)
2882 sum
+= atomic_read(&cpu_rq(i
)->nr_iowait
);
2887 unsigned long nr_active(void)
2889 unsigned long i
, running
= 0, uninterruptible
= 0;
2891 for_each_online_cpu(i
) {
2892 running
+= cpu_rq(i
)->nr_running
;
2893 uninterruptible
+= cpu_rq(i
)->nr_uninterruptible
;
2896 if (unlikely((long)uninterruptible
< 0))
2897 uninterruptible
= 0;
2899 return running
+ uninterruptible
;
2903 * Update rq->cpu_load[] statistics. This function is usually called every
2904 * scheduler tick (TICK_NSEC).
2906 static void update_cpu_load(struct rq
*this_rq
)
2908 unsigned long this_load
= this_rq
->load
.weight
;
2911 this_rq
->nr_load_updates
++;
2913 /* Update our load: */
2914 for (i
= 0, scale
= 1; i
< CPU_LOAD_IDX_MAX
; i
++, scale
+= scale
) {
2915 unsigned long old_load
, new_load
;
2917 /* scale is effectively 1 << i now, and >> i divides by scale */
2919 old_load
= this_rq
->cpu_load
[i
];
2920 new_load
= this_load
;
2922 * Round up the averaging division if load is increasing. This
2923 * prevents us from getting stuck on 9 if the load is 10, for
2926 if (new_load
> old_load
)
2927 new_load
+= scale
-1;
2928 this_rq
->cpu_load
[i
] = (old_load
*(scale
-1) + new_load
) >> i
;
2935 * double_rq_lock - safely lock two runqueues
2937 * Note this does not disable interrupts like task_rq_lock,
2938 * you need to do so manually before calling.
2940 static void double_rq_lock(struct rq
*rq1
, struct rq
*rq2
)
2941 __acquires(rq1
->lock
)
2942 __acquires(rq2
->lock
)
2944 BUG_ON(!irqs_disabled());
2946 spin_lock(&rq1
->lock
);
2947 __acquire(rq2
->lock
); /* Fake it out ;) */
2950 spin_lock(&rq1
->lock
);
2951 spin_lock(&rq2
->lock
);
2953 spin_lock(&rq2
->lock
);
2954 spin_lock(&rq1
->lock
);
2957 update_rq_clock(rq1
);
2958 update_rq_clock(rq2
);
2962 * double_rq_unlock - safely unlock two runqueues
2964 * Note this does not restore interrupts like task_rq_unlock,
2965 * you need to do so manually after calling.
2967 static void double_rq_unlock(struct rq
*rq1
, struct rq
*rq2
)
2968 __releases(rq1
->lock
)
2969 __releases(rq2
->lock
)
2971 spin_unlock(&rq1
->lock
);
2973 spin_unlock(&rq2
->lock
);
2975 __release(rq2
->lock
);
2979 * double_lock_balance - lock the busiest runqueue, this_rq is locked already.
2981 static int double_lock_balance(struct rq
*this_rq
, struct rq
*busiest
)
2982 __releases(this_rq
->lock
)
2983 __acquires(busiest
->lock
)
2984 __acquires(this_rq
->lock
)
2988 if (unlikely(!irqs_disabled())) {
2989 /* printk() doesn't work good under rq->lock */
2990 spin_unlock(&this_rq
->lock
);
2993 if (unlikely(!spin_trylock(&busiest
->lock
))) {
2994 if (busiest
< this_rq
) {
2995 spin_unlock(&this_rq
->lock
);
2996 spin_lock(&busiest
->lock
);
2997 spin_lock(&this_rq
->lock
);
3000 spin_lock(&busiest
->lock
);
3006 * If dest_cpu is allowed for this process, migrate the task to it.
3007 * This is accomplished by forcing the cpu_allowed mask to only
3008 * allow dest_cpu, which will force the cpu onto dest_cpu. Then
3009 * the cpu_allowed mask is restored.
3011 static void sched_migrate_task(struct task_struct
*p
, int dest_cpu
)
3013 struct migration_req req
;
3014 unsigned long flags
;
3017 rq
= task_rq_lock(p
, &flags
);
3018 if (!cpu_isset(dest_cpu
, p
->cpus_allowed
)
3019 || unlikely(cpu_is_offline(dest_cpu
)))
3022 /* force the process onto the specified CPU */
3023 if (migrate_task(p
, dest_cpu
, &req
)) {
3024 /* Need to wait for migration thread (might exit: take ref). */
3025 struct task_struct
*mt
= rq
->migration_thread
;
3027 get_task_struct(mt
);
3028 task_rq_unlock(rq
, &flags
);
3029 wake_up_process(mt
);
3030 put_task_struct(mt
);
3031 wait_for_completion(&req
.done
);
3036 task_rq_unlock(rq
, &flags
);
3040 * sched_exec - execve() is a valuable balancing opportunity, because at
3041 * this point the task has the smallest effective memory and cache footprint.
3043 void sched_exec(void)
3045 int new_cpu
, this_cpu
= get_cpu();
3046 new_cpu
= sched_balance_self(this_cpu
, SD_BALANCE_EXEC
);
3048 if (new_cpu
!= this_cpu
)
3049 sched_migrate_task(current
, new_cpu
);
3053 * pull_task - move a task from a remote runqueue to the local runqueue.
3054 * Both runqueues must be locked.
3056 static void pull_task(struct rq
*src_rq
, struct task_struct
*p
,
3057 struct rq
*this_rq
, int this_cpu
)
3059 deactivate_task(src_rq
, p
, 0);
3060 set_task_cpu(p
, this_cpu
);
3061 activate_task(this_rq
, p
, 0);
3063 * Note that idle threads have a prio of MAX_PRIO, for this test
3064 * to be always true for them.
3066 check_preempt_curr(this_rq
, p
);
3070 * can_migrate_task - may task p from runqueue rq be migrated to this_cpu?
3073 int can_migrate_task(struct task_struct
*p
, struct rq
*rq
, int this_cpu
,
3074 struct sched_domain
*sd
, enum cpu_idle_type idle
,
3078 * We do not migrate tasks that are:
3079 * 1) running (obviously), or
3080 * 2) cannot be migrated to this CPU due to cpus_allowed, or
3081 * 3) are cache-hot on their current CPU.
3083 if (!cpu_isset(this_cpu
, p
->cpus_allowed
)) {
3084 schedstat_inc(p
, se
.nr_failed_migrations_affine
);
3089 if (task_running(rq
, p
)) {
3090 schedstat_inc(p
, se
.nr_failed_migrations_running
);
3095 * Aggressive migration if:
3096 * 1) task is cache cold, or
3097 * 2) too many balance attempts have failed.
3100 if (!task_hot(p
, rq
->clock
, sd
) ||
3101 sd
->nr_balance_failed
> sd
->cache_nice_tries
) {
3102 #ifdef CONFIG_SCHEDSTATS
3103 if (task_hot(p
, rq
->clock
, sd
)) {
3104 schedstat_inc(sd
, lb_hot_gained
[idle
]);
3105 schedstat_inc(p
, se
.nr_forced_migrations
);
3111 if (task_hot(p
, rq
->clock
, sd
)) {
3112 schedstat_inc(p
, se
.nr_failed_migrations_hot
);
3118 static unsigned long
3119 balance_tasks(struct rq
*this_rq
, int this_cpu
, struct rq
*busiest
,
3120 unsigned long max_load_move
, struct sched_domain
*sd
,
3121 enum cpu_idle_type idle
, int *all_pinned
,
3122 int *this_best_prio
, struct rq_iterator
*iterator
)
3124 int loops
= 0, pulled
= 0, pinned
= 0, skip_for_load
;
3125 struct task_struct
*p
;
3126 long rem_load_move
= max_load_move
;
3128 if (max_load_move
== 0)
3134 * Start the load-balancing iterator:
3136 p
= iterator
->start(iterator
->arg
);
3138 if (!p
|| loops
++ > sysctl_sched_nr_migrate
)
3141 * To help distribute high priority tasks across CPUs we don't
3142 * skip a task if it will be the highest priority task (i.e. smallest
3143 * prio value) on its new queue regardless of its load weight
3145 skip_for_load
= (p
->se
.load
.weight
>> 1) > rem_load_move
+
3146 SCHED_LOAD_SCALE_FUZZ
;
3147 if ((skip_for_load
&& p
->prio
>= *this_best_prio
) ||
3148 !can_migrate_task(p
, busiest
, this_cpu
, sd
, idle
, &pinned
)) {
3149 p
= iterator
->next(iterator
->arg
);
3153 pull_task(busiest
, p
, this_rq
, this_cpu
);
3155 rem_load_move
-= p
->se
.load
.weight
;
3158 * We only want to steal up to the prescribed amount of weighted load.
3160 if (rem_load_move
> 0) {
3161 if (p
->prio
< *this_best_prio
)
3162 *this_best_prio
= p
->prio
;
3163 p
= iterator
->next(iterator
->arg
);
3168 * Right now, this is one of only two places pull_task() is called,
3169 * so we can safely collect pull_task() stats here rather than
3170 * inside pull_task().
3172 schedstat_add(sd
, lb_gained
[idle
], pulled
);
3175 *all_pinned
= pinned
;
3177 return max_load_move
- rem_load_move
;
3181 * move_tasks tries to move up to max_load_move weighted load from busiest to
3182 * this_rq, as part of a balancing operation within domain "sd".
3183 * Returns 1 if successful and 0 otherwise.
3185 * Called with both runqueues locked.
3187 static int move_tasks(struct rq
*this_rq
, int this_cpu
, struct rq
*busiest
,
3188 unsigned long max_load_move
,
3189 struct sched_domain
*sd
, enum cpu_idle_type idle
,
3192 const struct sched_class
*class = sched_class_highest
;
3193 unsigned long total_load_moved
= 0;
3194 int this_best_prio
= this_rq
->curr
->prio
;
3198 class->load_balance(this_rq
, this_cpu
, busiest
,
3199 max_load_move
- total_load_moved
,
3200 sd
, idle
, all_pinned
, &this_best_prio
);
3201 class = class->next
;
3202 } while (class && max_load_move
> total_load_moved
);
3204 return total_load_moved
> 0;
3208 iter_move_one_task(struct rq
*this_rq
, int this_cpu
, struct rq
*busiest
,
3209 struct sched_domain
*sd
, enum cpu_idle_type idle
,
3210 struct rq_iterator
*iterator
)
3212 struct task_struct
*p
= iterator
->start(iterator
->arg
);
3216 if (can_migrate_task(p
, busiest
, this_cpu
, sd
, idle
, &pinned
)) {
3217 pull_task(busiest
, p
, this_rq
, this_cpu
);
3219 * Right now, this is only the second place pull_task()
3220 * is called, so we can safely collect pull_task()
3221 * stats here rather than inside pull_task().
3223 schedstat_inc(sd
, lb_gained
[idle
]);
3227 p
= iterator
->next(iterator
->arg
);
3234 * move_one_task tries to move exactly one task from busiest to this_rq, as
3235 * part of active balancing operations within "domain".
3236 * Returns 1 if successful and 0 otherwise.
3238 * Called with both runqueues locked.
3240 static int move_one_task(struct rq
*this_rq
, int this_cpu
, struct rq
*busiest
,
3241 struct sched_domain
*sd
, enum cpu_idle_type idle
)
3243 const struct sched_class
*class;
3245 for (class = sched_class_highest
; class; class = class->next
)
3246 if (class->move_one_task(this_rq
, this_cpu
, busiest
, sd
, idle
))
3253 * find_busiest_group finds and returns the busiest CPU group within the
3254 * domain. It calculates and returns the amount of weighted load which
3255 * should be moved to restore balance via the imbalance parameter.
3257 static struct sched_group
*
3258 find_busiest_group(struct sched_domain
*sd
, int this_cpu
,
3259 unsigned long *imbalance
, enum cpu_idle_type idle
,
3260 int *sd_idle
, const cpumask_t
*cpus
, int *balance
)
3262 struct sched_group
*busiest
= NULL
, *this = NULL
, *group
= sd
->groups
;
3263 unsigned long max_load
, avg_load
, total_load
, this_load
, total_pwr
;
3264 unsigned long max_pull
;
3265 unsigned long busiest_load_per_task
, busiest_nr_running
;
3266 unsigned long this_load_per_task
, this_nr_running
;
3267 int load_idx
, group_imb
= 0;
3268 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
3269 int power_savings_balance
= 1;
3270 unsigned long leader_nr_running
= 0, min_load_per_task
= 0;
3271 unsigned long min_nr_running
= ULONG_MAX
;
3272 struct sched_group
*group_min
= NULL
, *group_leader
= NULL
;
3275 max_load
= this_load
= total_load
= total_pwr
= 0;
3276 busiest_load_per_task
= busiest_nr_running
= 0;
3277 this_load_per_task
= this_nr_running
= 0;
3278 if (idle
== CPU_NOT_IDLE
)
3279 load_idx
= sd
->busy_idx
;
3280 else if (idle
== CPU_NEWLY_IDLE
)
3281 load_idx
= sd
->newidle_idx
;
3283 load_idx
= sd
->idle_idx
;
3286 unsigned long load
, group_capacity
, max_cpu_load
, min_cpu_load
;
3289 int __group_imb
= 0;
3290 unsigned int balance_cpu
= -1, first_idle_cpu
= 0;
3291 unsigned long sum_nr_running
, sum_weighted_load
;
3293 local_group
= cpu_isset(this_cpu
, group
->cpumask
);
3296 balance_cpu
= first_cpu(group
->cpumask
);
3298 /* Tally up the load of all CPUs in the group */
3299 sum_weighted_load
= sum_nr_running
= avg_load
= 0;
3301 min_cpu_load
= ~0UL;
3303 for_each_cpu_mask(i
, group
->cpumask
) {
3306 if (!cpu_isset(i
, *cpus
))
3311 if (*sd_idle
&& rq
->nr_running
)
3314 /* Bias balancing toward cpus of our domain */
3316 if (idle_cpu(i
) && !first_idle_cpu
) {
3321 load
= target_load(i
, load_idx
);
3323 load
= source_load(i
, load_idx
);
3324 if (load
> max_cpu_load
)
3325 max_cpu_load
= load
;
3326 if (min_cpu_load
> load
)
3327 min_cpu_load
= load
;
3331 sum_nr_running
+= rq
->nr_running
;
3332 sum_weighted_load
+= weighted_cpuload(i
);
3336 * First idle cpu or the first cpu(busiest) in this sched group
3337 * is eligible for doing load balancing at this and above
3338 * domains. In the newly idle case, we will allow all the cpu's
3339 * to do the newly idle load balance.
3341 if (idle
!= CPU_NEWLY_IDLE
&& local_group
&&
3342 balance_cpu
!= this_cpu
&& balance
) {
3347 total_load
+= avg_load
;
3348 total_pwr
+= group
->__cpu_power
;
3350 /* Adjust by relative CPU power of the group */
3351 avg_load
= sg_div_cpu_power(group
,
3352 avg_load
* SCHED_LOAD_SCALE
);
3354 if ((max_cpu_load
- min_cpu_load
) > SCHED_LOAD_SCALE
)
3357 group_capacity
= group
->__cpu_power
/ SCHED_LOAD_SCALE
;
3360 this_load
= avg_load
;
3362 this_nr_running
= sum_nr_running
;
3363 this_load_per_task
= sum_weighted_load
;
3364 } else if (avg_load
> max_load
&&
3365 (sum_nr_running
> group_capacity
|| __group_imb
)) {
3366 max_load
= avg_load
;
3368 busiest_nr_running
= sum_nr_running
;
3369 busiest_load_per_task
= sum_weighted_load
;
3370 group_imb
= __group_imb
;
3373 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
3375 * Busy processors will not participate in power savings
3378 if (idle
== CPU_NOT_IDLE
||
3379 !(sd
->flags
& SD_POWERSAVINGS_BALANCE
))
3383 * If the local group is idle or completely loaded
3384 * no need to do power savings balance at this domain
3386 if (local_group
&& (this_nr_running
>= group_capacity
||
3388 power_savings_balance
= 0;
3391 * If a group is already running at full capacity or idle,
3392 * don't include that group in power savings calculations
3394 if (!power_savings_balance
|| sum_nr_running
>= group_capacity
3399 * Calculate the group which has the least non-idle load.
3400 * This is the group from where we need to pick up the load
3403 if ((sum_nr_running
< min_nr_running
) ||
3404 (sum_nr_running
== min_nr_running
&&
3405 first_cpu(group
->cpumask
) <
3406 first_cpu(group_min
->cpumask
))) {
3408 min_nr_running
= sum_nr_running
;
3409 min_load_per_task
= sum_weighted_load
/
3414 * Calculate the group which is almost near its
3415 * capacity but still has some space to pick up some load
3416 * from other group and save more power
3418 if (sum_nr_running
<= group_capacity
- 1) {
3419 if (sum_nr_running
> leader_nr_running
||
3420 (sum_nr_running
== leader_nr_running
&&
3421 first_cpu(group
->cpumask
) >
3422 first_cpu(group_leader
->cpumask
))) {
3423 group_leader
= group
;
3424 leader_nr_running
= sum_nr_running
;
3429 group
= group
->next
;
3430 } while (group
!= sd
->groups
);
3432 if (!busiest
|| this_load
>= max_load
|| busiest_nr_running
== 0)
3435 avg_load
= (SCHED_LOAD_SCALE
* total_load
) / total_pwr
;
3437 if (this_load
>= avg_load
||
3438 100*max_load
<= sd
->imbalance_pct
*this_load
)
3441 busiest_load_per_task
/= busiest_nr_running
;
3443 busiest_load_per_task
= min(busiest_load_per_task
, avg_load
);
3446 * We're trying to get all the cpus to the average_load, so we don't
3447 * want to push ourselves above the average load, nor do we wish to
3448 * reduce the max loaded cpu below the average load, as either of these
3449 * actions would just result in more rebalancing later, and ping-pong
3450 * tasks around. Thus we look for the minimum possible imbalance.
3451 * Negative imbalances (*we* are more loaded than anyone else) will
3452 * be counted as no imbalance for these purposes -- we can't fix that
3453 * by pulling tasks to us. Be careful of negative numbers as they'll
3454 * appear as very large values with unsigned longs.
3456 if (max_load
<= busiest_load_per_task
)
3460 * In the presence of smp nice balancing, certain scenarios can have
3461 * max load less than avg load(as we skip the groups at or below
3462 * its cpu_power, while calculating max_load..)
3464 if (max_load
< avg_load
) {
3466 goto small_imbalance
;
3469 /* Don't want to pull so many tasks that a group would go idle */
3470 max_pull
= min(max_load
- avg_load
, max_load
- busiest_load_per_task
);
3472 /* How much load to actually move to equalise the imbalance */
3473 *imbalance
= min(max_pull
* busiest
->__cpu_power
,
3474 (avg_load
- this_load
) * this->__cpu_power
)
3478 * if *imbalance is less than the average load per runnable task
3479 * there is no gaurantee that any tasks will be moved so we'll have
3480 * a think about bumping its value to force at least one task to be
3483 if (*imbalance
< busiest_load_per_task
) {
3484 unsigned long tmp
, pwr_now
, pwr_move
;
3488 pwr_move
= pwr_now
= 0;
3490 if (this_nr_running
) {
3491 this_load_per_task
/= this_nr_running
;
3492 if (busiest_load_per_task
> this_load_per_task
)
3495 this_load_per_task
= SCHED_LOAD_SCALE
;
3497 if (max_load
- this_load
+ SCHED_LOAD_SCALE_FUZZ
>=
3498 busiest_load_per_task
* imbn
) {
3499 *imbalance
= busiest_load_per_task
;
3504 * OK, we don't have enough imbalance to justify moving tasks,
3505 * however we may be able to increase total CPU power used by
3509 pwr_now
+= busiest
->__cpu_power
*
3510 min(busiest_load_per_task
, max_load
);
3511 pwr_now
+= this->__cpu_power
*
3512 min(this_load_per_task
, this_load
);
3513 pwr_now
/= SCHED_LOAD_SCALE
;
3515 /* Amount of load we'd subtract */
3516 tmp
= sg_div_cpu_power(busiest
,
3517 busiest_load_per_task
* SCHED_LOAD_SCALE
);
3519 pwr_move
+= busiest
->__cpu_power
*
3520 min(busiest_load_per_task
, max_load
- tmp
);
3522 /* Amount of load we'd add */
3523 if (max_load
* busiest
->__cpu_power
<
3524 busiest_load_per_task
* SCHED_LOAD_SCALE
)
3525 tmp
= sg_div_cpu_power(this,
3526 max_load
* busiest
->__cpu_power
);
3528 tmp
= sg_div_cpu_power(this,
3529 busiest_load_per_task
* SCHED_LOAD_SCALE
);
3530 pwr_move
+= this->__cpu_power
*
3531 min(this_load_per_task
, this_load
+ tmp
);
3532 pwr_move
/= SCHED_LOAD_SCALE
;
3534 /* Move if we gain throughput */
3535 if (pwr_move
> pwr_now
)
3536 *imbalance
= busiest_load_per_task
;
3542 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
3543 if (idle
== CPU_NOT_IDLE
|| !(sd
->flags
& SD_POWERSAVINGS_BALANCE
))
3546 if (this == group_leader
&& group_leader
!= group_min
) {
3547 *imbalance
= min_load_per_task
;
3557 * find_busiest_queue - find the busiest runqueue among the cpus in group.
3560 find_busiest_queue(struct sched_group
*group
, enum cpu_idle_type idle
,
3561 unsigned long imbalance
, const cpumask_t
*cpus
)
3563 struct rq
*busiest
= NULL
, *rq
;
3564 unsigned long max_load
= 0;
3567 for_each_cpu_mask(i
, group
->cpumask
) {
3570 if (!cpu_isset(i
, *cpus
))
3574 wl
= weighted_cpuload(i
);
3576 if (rq
->nr_running
== 1 && wl
> imbalance
)
3579 if (wl
> max_load
) {
3589 * Max backoff if we encounter pinned tasks. Pretty arbitrary value, but
3590 * so long as it is large enough.
3592 #define MAX_PINNED_INTERVAL 512
3595 * Check this_cpu to ensure it is balanced within domain. Attempt to move
3596 * tasks if there is an imbalance.
3598 static int load_balance(int this_cpu
, struct rq
*this_rq
,
3599 struct sched_domain
*sd
, enum cpu_idle_type idle
,
3600 int *balance
, cpumask_t
*cpus
)
3602 int ld_moved
, all_pinned
= 0, active_balance
= 0, sd_idle
= 0;
3603 struct sched_group
*group
;
3604 unsigned long imbalance
;
3606 unsigned long flags
;
3607 int unlock_aggregate
;
3611 unlock_aggregate
= get_aggregate(sd
);
3614 * When power savings policy is enabled for the parent domain, idle
3615 * sibling can pick up load irrespective of busy siblings. In this case,
3616 * let the state of idle sibling percolate up as CPU_IDLE, instead of
3617 * portraying it as CPU_NOT_IDLE.
3619 if (idle
!= CPU_NOT_IDLE
&& sd
->flags
& SD_SHARE_CPUPOWER
&&
3620 !test_sd_parent(sd
, SD_POWERSAVINGS_BALANCE
))
3623 schedstat_inc(sd
, lb_count
[idle
]);
3626 group
= find_busiest_group(sd
, this_cpu
, &imbalance
, idle
, &sd_idle
,
3633 schedstat_inc(sd
, lb_nobusyg
[idle
]);
3637 busiest
= find_busiest_queue(group
, idle
, imbalance
, cpus
);
3639 schedstat_inc(sd
, lb_nobusyq
[idle
]);
3643 BUG_ON(busiest
== this_rq
);
3645 schedstat_add(sd
, lb_imbalance
[idle
], imbalance
);
3648 if (busiest
->nr_running
> 1) {
3650 * Attempt to move tasks. If find_busiest_group has found
3651 * an imbalance but busiest->nr_running <= 1, the group is
3652 * still unbalanced. ld_moved simply stays zero, so it is
3653 * correctly treated as an imbalance.
3655 local_irq_save(flags
);
3656 double_rq_lock(this_rq
, busiest
);
3657 ld_moved
= move_tasks(this_rq
, this_cpu
, busiest
,
3658 imbalance
, sd
, idle
, &all_pinned
);
3659 double_rq_unlock(this_rq
, busiest
);
3660 local_irq_restore(flags
);
3663 * some other cpu did the load balance for us.
3665 if (ld_moved
&& this_cpu
!= smp_processor_id())
3666 resched_cpu(this_cpu
);
3668 /* All tasks on this runqueue were pinned by CPU affinity */
3669 if (unlikely(all_pinned
)) {
3670 cpu_clear(cpu_of(busiest
), *cpus
);
3671 if (!cpus_empty(*cpus
))
3678 schedstat_inc(sd
, lb_failed
[idle
]);
3679 sd
->nr_balance_failed
++;
3681 if (unlikely(sd
->nr_balance_failed
> sd
->cache_nice_tries
+2)) {
3683 spin_lock_irqsave(&busiest
->lock
, flags
);
3685 /* don't kick the migration_thread, if the curr
3686 * task on busiest cpu can't be moved to this_cpu
3688 if (!cpu_isset(this_cpu
, busiest
->curr
->cpus_allowed
)) {
3689 spin_unlock_irqrestore(&busiest
->lock
, flags
);
3691 goto out_one_pinned
;
3694 if (!busiest
->active_balance
) {
3695 busiest
->active_balance
= 1;
3696 busiest
->push_cpu
= this_cpu
;
3699 spin_unlock_irqrestore(&busiest
->lock
, flags
);
3701 wake_up_process(busiest
->migration_thread
);
3704 * We've kicked active balancing, reset the failure
3707 sd
->nr_balance_failed
= sd
->cache_nice_tries
+1;
3710 sd
->nr_balance_failed
= 0;
3712 if (likely(!active_balance
)) {
3713 /* We were unbalanced, so reset the balancing interval */
3714 sd
->balance_interval
= sd
->min_interval
;
3717 * If we've begun active balancing, start to back off. This
3718 * case may not be covered by the all_pinned logic if there
3719 * is only 1 task on the busy runqueue (because we don't call
3722 if (sd
->balance_interval
< sd
->max_interval
)
3723 sd
->balance_interval
*= 2;
3726 if (!ld_moved
&& !sd_idle
&& sd
->flags
& SD_SHARE_CPUPOWER
&&
3727 !test_sd_parent(sd
, SD_POWERSAVINGS_BALANCE
))
3733 schedstat_inc(sd
, lb_balanced
[idle
]);
3735 sd
->nr_balance_failed
= 0;
3738 /* tune up the balancing interval */
3739 if ((all_pinned
&& sd
->balance_interval
< MAX_PINNED_INTERVAL
) ||
3740 (sd
->balance_interval
< sd
->max_interval
))
3741 sd
->balance_interval
*= 2;
3743 if (!sd_idle
&& sd
->flags
& SD_SHARE_CPUPOWER
&&
3744 !test_sd_parent(sd
, SD_POWERSAVINGS_BALANCE
))
3749 if (unlock_aggregate
)
3755 * Check this_cpu to ensure it is balanced within domain. Attempt to move
3756 * tasks if there is an imbalance.
3758 * Called from schedule when this_rq is about to become idle (CPU_NEWLY_IDLE).
3759 * this_rq is locked.
3762 load_balance_newidle(int this_cpu
, struct rq
*this_rq
, struct sched_domain
*sd
,
3765 struct sched_group
*group
;
3766 struct rq
*busiest
= NULL
;
3767 unsigned long imbalance
;
3775 * When power savings policy is enabled for the parent domain, idle
3776 * sibling can pick up load irrespective of busy siblings. In this case,
3777 * let the state of idle sibling percolate up as IDLE, instead of
3778 * portraying it as CPU_NOT_IDLE.
3780 if (sd
->flags
& SD_SHARE_CPUPOWER
&&
3781 !test_sd_parent(sd
, SD_POWERSAVINGS_BALANCE
))
3784 schedstat_inc(sd
, lb_count
[CPU_NEWLY_IDLE
]);
3786 group
= find_busiest_group(sd
, this_cpu
, &imbalance
, CPU_NEWLY_IDLE
,
3787 &sd_idle
, cpus
, NULL
);
3789 schedstat_inc(sd
, lb_nobusyg
[CPU_NEWLY_IDLE
]);
3793 busiest
= find_busiest_queue(group
, CPU_NEWLY_IDLE
, imbalance
, cpus
);
3795 schedstat_inc(sd
, lb_nobusyq
[CPU_NEWLY_IDLE
]);
3799 BUG_ON(busiest
== this_rq
);
3801 schedstat_add(sd
, lb_imbalance
[CPU_NEWLY_IDLE
], imbalance
);
3804 if (busiest
->nr_running
> 1) {
3805 /* Attempt to move tasks */
3806 double_lock_balance(this_rq
, busiest
);
3807 /* this_rq->clock is already updated */
3808 update_rq_clock(busiest
);
3809 ld_moved
= move_tasks(this_rq
, this_cpu
, busiest
,
3810 imbalance
, sd
, CPU_NEWLY_IDLE
,
3812 spin_unlock(&busiest
->lock
);
3814 if (unlikely(all_pinned
)) {
3815 cpu_clear(cpu_of(busiest
), *cpus
);
3816 if (!cpus_empty(*cpus
))
3822 schedstat_inc(sd
, lb_failed
[CPU_NEWLY_IDLE
]);
3823 if (!sd_idle
&& sd
->flags
& SD_SHARE_CPUPOWER
&&
3824 !test_sd_parent(sd
, SD_POWERSAVINGS_BALANCE
))
3827 sd
->nr_balance_failed
= 0;
3832 schedstat_inc(sd
, lb_balanced
[CPU_NEWLY_IDLE
]);
3833 if (!sd_idle
&& sd
->flags
& SD_SHARE_CPUPOWER
&&
3834 !test_sd_parent(sd
, SD_POWERSAVINGS_BALANCE
))
3836 sd
->nr_balance_failed
= 0;
3842 * idle_balance is called by schedule() if this_cpu is about to become
3843 * idle. Attempts to pull tasks from other CPUs.
3845 static void idle_balance(int this_cpu
, struct rq
*this_rq
)
3847 struct sched_domain
*sd
;
3848 int pulled_task
= -1;
3849 unsigned long next_balance
= jiffies
+ HZ
;
3852 for_each_domain(this_cpu
, sd
) {
3853 unsigned long interval
;
3855 if (!(sd
->flags
& SD_LOAD_BALANCE
))
3858 if (sd
->flags
& SD_BALANCE_NEWIDLE
)
3859 /* If we've pulled tasks over stop searching: */
3860 pulled_task
= load_balance_newidle(this_cpu
, this_rq
,
3863 interval
= msecs_to_jiffies(sd
->balance_interval
);
3864 if (time_after(next_balance
, sd
->last_balance
+ interval
))
3865 next_balance
= sd
->last_balance
+ interval
;
3869 if (pulled_task
|| time_after(jiffies
, this_rq
->next_balance
)) {
3871 * We are going idle. next_balance may be set based on
3872 * a busy processor. So reset next_balance.
3874 this_rq
->next_balance
= next_balance
;
3879 * active_load_balance is run by migration threads. It pushes running tasks
3880 * off the busiest CPU onto idle CPUs. It requires at least 1 task to be
3881 * running on each physical CPU where possible, and avoids physical /
3882 * logical imbalances.
3884 * Called with busiest_rq locked.
3886 static void active_load_balance(struct rq
*busiest_rq
, int busiest_cpu
)
3888 int target_cpu
= busiest_rq
->push_cpu
;
3889 struct sched_domain
*sd
;
3890 struct rq
*target_rq
;
3892 /* Is there any task to move? */
3893 if (busiest_rq
->nr_running
<= 1)
3896 target_rq
= cpu_rq(target_cpu
);
3899 * This condition is "impossible", if it occurs
3900 * we need to fix it. Originally reported by
3901 * Bjorn Helgaas on a 128-cpu setup.
3903 BUG_ON(busiest_rq
== target_rq
);
3905 /* move a task from busiest_rq to target_rq */
3906 double_lock_balance(busiest_rq
, target_rq
);
3907 update_rq_clock(busiest_rq
);
3908 update_rq_clock(target_rq
);
3910 /* Search for an sd spanning us and the target CPU. */
3911 for_each_domain(target_cpu
, sd
) {
3912 if ((sd
->flags
& SD_LOAD_BALANCE
) &&
3913 cpu_isset(busiest_cpu
, sd
->span
))
3918 schedstat_inc(sd
, alb_count
);
3920 if (move_one_task(target_rq
, target_cpu
, busiest_rq
,
3922 schedstat_inc(sd
, alb_pushed
);
3924 schedstat_inc(sd
, alb_failed
);
3926 spin_unlock(&target_rq
->lock
);
3931 atomic_t load_balancer
;
3933 } nohz ____cacheline_aligned
= {
3934 .load_balancer
= ATOMIC_INIT(-1),
3935 .cpu_mask
= CPU_MASK_NONE
,
3939 * This routine will try to nominate the ilb (idle load balancing)
3940 * owner among the cpus whose ticks are stopped. ilb owner will do the idle
3941 * load balancing on behalf of all those cpus. If all the cpus in the system
3942 * go into this tickless mode, then there will be no ilb owner (as there is
3943 * no need for one) and all the cpus will sleep till the next wakeup event
3946 * For the ilb owner, tick is not stopped. And this tick will be used
3947 * for idle load balancing. ilb owner will still be part of
3950 * While stopping the tick, this cpu will become the ilb owner if there
3951 * is no other owner. And will be the owner till that cpu becomes busy
3952 * or if all cpus in the system stop their ticks at which point
3953 * there is no need for ilb owner.
3955 * When the ilb owner becomes busy, it nominates another owner, during the
3956 * next busy scheduler_tick()
3958 int select_nohz_load_balancer(int stop_tick
)
3960 int cpu
= smp_processor_id();
3963 cpu_set(cpu
, nohz
.cpu_mask
);
3964 cpu_rq(cpu
)->in_nohz_recently
= 1;
3967 * If we are going offline and still the leader, give up!
3969 if (cpu_is_offline(cpu
) &&
3970 atomic_read(&nohz
.load_balancer
) == cpu
) {
3971 if (atomic_cmpxchg(&nohz
.load_balancer
, cpu
, -1) != cpu
)
3976 /* time for ilb owner also to sleep */
3977 if (cpus_weight(nohz
.cpu_mask
) == num_online_cpus()) {
3978 if (atomic_read(&nohz
.load_balancer
) == cpu
)
3979 atomic_set(&nohz
.load_balancer
, -1);
3983 if (atomic_read(&nohz
.load_balancer
) == -1) {
3984 /* make me the ilb owner */
3985 if (atomic_cmpxchg(&nohz
.load_balancer
, -1, cpu
) == -1)
3987 } else if (atomic_read(&nohz
.load_balancer
) == cpu
)
3990 if (!cpu_isset(cpu
, nohz
.cpu_mask
))
3993 cpu_clear(cpu
, nohz
.cpu_mask
);
3995 if (atomic_read(&nohz
.load_balancer
) == cpu
)
3996 if (atomic_cmpxchg(&nohz
.load_balancer
, cpu
, -1) != cpu
)
4003 static DEFINE_SPINLOCK(balancing
);
4006 * It checks each scheduling domain to see if it is due to be balanced,
4007 * and initiates a balancing operation if so.
4009 * Balancing parameters are set up in arch_init_sched_domains.
4011 static void rebalance_domains(int cpu
, enum cpu_idle_type idle
)
4014 struct rq
*rq
= cpu_rq(cpu
);
4015 unsigned long interval
;
4016 struct sched_domain
*sd
;
4017 /* Earliest time when we have to do rebalance again */
4018 unsigned long next_balance
= jiffies
+ 60*HZ
;
4019 int update_next_balance
= 0;
4022 for_each_domain(cpu
, sd
) {
4023 if (!(sd
->flags
& SD_LOAD_BALANCE
))
4026 interval
= sd
->balance_interval
;
4027 if (idle
!= CPU_IDLE
)
4028 interval
*= sd
->busy_factor
;
4030 /* scale ms to jiffies */
4031 interval
= msecs_to_jiffies(interval
);
4032 if (unlikely(!interval
))
4034 if (interval
> HZ
*NR_CPUS
/10)
4035 interval
= HZ
*NR_CPUS
/10;
4038 if (sd
->flags
& SD_SERIALIZE
) {
4039 if (!spin_trylock(&balancing
))
4043 if (time_after_eq(jiffies
, sd
->last_balance
+ interval
)) {
4044 if (load_balance(cpu
, rq
, sd
, idle
, &balance
, &tmp
)) {
4046 * We've pulled tasks over so either we're no
4047 * longer idle, or one of our SMT siblings is
4050 idle
= CPU_NOT_IDLE
;
4052 sd
->last_balance
= jiffies
;
4054 if (sd
->flags
& SD_SERIALIZE
)
4055 spin_unlock(&balancing
);
4057 if (time_after(next_balance
, sd
->last_balance
+ interval
)) {
4058 next_balance
= sd
->last_balance
+ interval
;
4059 update_next_balance
= 1;
4063 * Stop the load balance at this level. There is another
4064 * CPU in our sched group which is doing load balancing more
4072 * next_balance will be updated only when there is a need.
4073 * When the cpu is attached to null domain for ex, it will not be
4076 if (likely(update_next_balance
))
4077 rq
->next_balance
= next_balance
;
4081 * run_rebalance_domains is triggered when needed from the scheduler tick.
4082 * In CONFIG_NO_HZ case, the idle load balance owner will do the
4083 * rebalancing for all the cpus for whom scheduler ticks are stopped.
4085 static void run_rebalance_domains(struct softirq_action
*h
)
4087 int this_cpu
= smp_processor_id();
4088 struct rq
*this_rq
= cpu_rq(this_cpu
);
4089 enum cpu_idle_type idle
= this_rq
->idle_at_tick
?
4090 CPU_IDLE
: CPU_NOT_IDLE
;
4092 rebalance_domains(this_cpu
, idle
);
4096 * If this cpu is the owner for idle load balancing, then do the
4097 * balancing on behalf of the other idle cpus whose ticks are
4100 if (this_rq
->idle_at_tick
&&
4101 atomic_read(&nohz
.load_balancer
) == this_cpu
) {
4102 cpumask_t cpus
= nohz
.cpu_mask
;
4106 cpu_clear(this_cpu
, cpus
);
4107 for_each_cpu_mask(balance_cpu
, cpus
) {
4109 * If this cpu gets work to do, stop the load balancing
4110 * work being done for other cpus. Next load
4111 * balancing owner will pick it up.
4116 rebalance_domains(balance_cpu
, CPU_IDLE
);
4118 rq
= cpu_rq(balance_cpu
);
4119 if (time_after(this_rq
->next_balance
, rq
->next_balance
))
4120 this_rq
->next_balance
= rq
->next_balance
;
4127 * Trigger the SCHED_SOFTIRQ if it is time to do periodic load balancing.
4129 * In case of CONFIG_NO_HZ, this is the place where we nominate a new
4130 * idle load balancing owner or decide to stop the periodic load balancing,
4131 * if the whole system is idle.
4133 static inline void trigger_load_balance(struct rq
*rq
, int cpu
)
4137 * If we were in the nohz mode recently and busy at the current
4138 * scheduler tick, then check if we need to nominate new idle
4141 if (rq
->in_nohz_recently
&& !rq
->idle_at_tick
) {
4142 rq
->in_nohz_recently
= 0;
4144 if (atomic_read(&nohz
.load_balancer
) == cpu
) {
4145 cpu_clear(cpu
, nohz
.cpu_mask
);
4146 atomic_set(&nohz
.load_balancer
, -1);
4149 if (atomic_read(&nohz
.load_balancer
) == -1) {
4151 * simple selection for now: Nominate the
4152 * first cpu in the nohz list to be the next
4155 * TBD: Traverse the sched domains and nominate
4156 * the nearest cpu in the nohz.cpu_mask.
4158 int ilb
= first_cpu(nohz
.cpu_mask
);
4160 if (ilb
< nr_cpu_ids
)
4166 * If this cpu is idle and doing idle load balancing for all the
4167 * cpus with ticks stopped, is it time for that to stop?
4169 if (rq
->idle_at_tick
&& atomic_read(&nohz
.load_balancer
) == cpu
&&
4170 cpus_weight(nohz
.cpu_mask
) == num_online_cpus()) {
4176 * If this cpu is idle and the idle load balancing is done by
4177 * someone else, then no need raise the SCHED_SOFTIRQ
4179 if (rq
->idle_at_tick
&& atomic_read(&nohz
.load_balancer
) != cpu
&&
4180 cpu_isset(cpu
, nohz
.cpu_mask
))
4183 if (time_after_eq(jiffies
, rq
->next_balance
))
4184 raise_softirq(SCHED_SOFTIRQ
);
4187 #else /* CONFIG_SMP */
4190 * on UP we do not need to balance between CPUs:
4192 static inline void idle_balance(int cpu
, struct rq
*rq
)
4198 DEFINE_PER_CPU(struct kernel_stat
, kstat
);
4200 EXPORT_PER_CPU_SYMBOL(kstat
);
4203 * Return p->sum_exec_runtime plus any more ns on the sched_clock
4204 * that have not yet been banked in case the task is currently running.
4206 unsigned long long task_sched_runtime(struct task_struct
*p
)
4208 unsigned long flags
;
4212 rq
= task_rq_lock(p
, &flags
);
4213 ns
= p
->se
.sum_exec_runtime
;
4214 if (task_current(rq
, p
)) {
4215 update_rq_clock(rq
);
4216 delta_exec
= rq
->clock
- p
->se
.exec_start
;
4217 if ((s64
)delta_exec
> 0)
4220 task_rq_unlock(rq
, &flags
);
4226 * Account user cpu time to a process.
4227 * @p: the process that the cpu time gets accounted to
4228 * @cputime: the cpu time spent in user space since the last update
4230 void account_user_time(struct task_struct
*p
, cputime_t cputime
)
4232 struct cpu_usage_stat
*cpustat
= &kstat_this_cpu
.cpustat
;
4235 p
->utime
= cputime_add(p
->utime
, cputime
);
4237 /* Add user time to cpustat. */
4238 tmp
= cputime_to_cputime64(cputime
);
4239 if (TASK_NICE(p
) > 0)
4240 cpustat
->nice
= cputime64_add(cpustat
->nice
, tmp
);
4242 cpustat
->user
= cputime64_add(cpustat
->user
, tmp
);
4246 * Account guest cpu time to a process.
4247 * @p: the process that the cpu time gets accounted to
4248 * @cputime: the cpu time spent in virtual machine since the last update
4250 static void account_guest_time(struct task_struct
*p
, cputime_t cputime
)
4253 struct cpu_usage_stat
*cpustat
= &kstat_this_cpu
.cpustat
;
4255 tmp
= cputime_to_cputime64(cputime
);
4257 p
->utime
= cputime_add(p
->utime
, cputime
);
4258 p
->gtime
= cputime_add(p
->gtime
, cputime
);
4260 cpustat
->user
= cputime64_add(cpustat
->user
, tmp
);
4261 cpustat
->guest
= cputime64_add(cpustat
->guest
, tmp
);
4265 * Account scaled user cpu time to a process.
4266 * @p: the process that the cpu time gets accounted to
4267 * @cputime: the cpu time spent in user space since the last update
4269 void account_user_time_scaled(struct task_struct
*p
, cputime_t cputime
)
4271 p
->utimescaled
= cputime_add(p
->utimescaled
, cputime
);
4275 * Account system cpu time to a process.
4276 * @p: the process that the cpu time gets accounted to
4277 * @hardirq_offset: the offset to subtract from hardirq_count()
4278 * @cputime: the cpu time spent in kernel space since the last update
4280 void account_system_time(struct task_struct
*p
, int hardirq_offset
,
4283 struct cpu_usage_stat
*cpustat
= &kstat_this_cpu
.cpustat
;
4284 struct rq
*rq
= this_rq();
4287 if ((p
->flags
& PF_VCPU
) && (irq_count() - hardirq_offset
== 0)) {
4288 account_guest_time(p
, cputime
);
4292 p
->stime
= cputime_add(p
->stime
, cputime
);
4294 /* Add system time to cpustat. */
4295 tmp
= cputime_to_cputime64(cputime
);
4296 if (hardirq_count() - hardirq_offset
)
4297 cpustat
->irq
= cputime64_add(cpustat
->irq
, tmp
);
4298 else if (softirq_count())
4299 cpustat
->softirq
= cputime64_add(cpustat
->softirq
, tmp
);
4300 else if (p
!= rq
->idle
)
4301 cpustat
->system
= cputime64_add(cpustat
->system
, tmp
);
4302 else if (atomic_read(&rq
->nr_iowait
) > 0)
4303 cpustat
->iowait
= cputime64_add(cpustat
->iowait
, tmp
);
4305 cpustat
->idle
= cputime64_add(cpustat
->idle
, tmp
);
4306 /* Account for system time used */
4307 acct_update_integrals(p
);
4311 * Account scaled system cpu time to a process.
4312 * @p: the process that the cpu time gets accounted to
4313 * @hardirq_offset: the offset to subtract from hardirq_count()
4314 * @cputime: the cpu time spent in kernel space since the last update
4316 void account_system_time_scaled(struct task_struct
*p
, cputime_t cputime
)
4318 p
->stimescaled
= cputime_add(p
->stimescaled
, cputime
);
4322 * Account for involuntary wait time.
4323 * @p: the process from which the cpu time has been stolen
4324 * @steal: the cpu time spent in involuntary wait
4326 void account_steal_time(struct task_struct
*p
, cputime_t steal
)
4328 struct cpu_usage_stat
*cpustat
= &kstat_this_cpu
.cpustat
;
4329 cputime64_t tmp
= cputime_to_cputime64(steal
);
4330 struct rq
*rq
= this_rq();
4332 if (p
== rq
->idle
) {
4333 p
->stime
= cputime_add(p
->stime
, steal
);
4334 if (atomic_read(&rq
->nr_iowait
) > 0)
4335 cpustat
->iowait
= cputime64_add(cpustat
->iowait
, tmp
);
4337 cpustat
->idle
= cputime64_add(cpustat
->idle
, tmp
);
4339 cpustat
->steal
= cputime64_add(cpustat
->steal
, tmp
);
4343 * This function gets called by the timer code, with HZ frequency.
4344 * We call it with interrupts disabled.
4346 * It also gets called by the fork code, when changing the parent's
4349 void scheduler_tick(void)
4351 int cpu
= smp_processor_id();
4352 struct rq
*rq
= cpu_rq(cpu
);
4353 struct task_struct
*curr
= rq
->curr
;
4357 spin_lock(&rq
->lock
);
4358 update_rq_clock(rq
);
4359 update_cpu_load(rq
);
4360 curr
->sched_class
->task_tick(rq
, curr
, 0);
4361 spin_unlock(&rq
->lock
);
4364 rq
->idle_at_tick
= idle_cpu(cpu
);
4365 trigger_load_balance(rq
, cpu
);
4369 #if defined(CONFIG_PREEMPT) && (defined(CONFIG_DEBUG_PREEMPT) || \
4370 defined(CONFIG_PREEMPT_TRACER))
4372 static inline unsigned long get_parent_ip(unsigned long addr
)
4374 if (in_lock_functions(addr
)) {
4375 addr
= CALLER_ADDR2
;
4376 if (in_lock_functions(addr
))
4377 addr
= CALLER_ADDR3
;
4382 void __kprobes
add_preempt_count(int val
)
4384 #ifdef CONFIG_DEBUG_PREEMPT
4388 if (DEBUG_LOCKS_WARN_ON((preempt_count() < 0)))
4391 preempt_count() += val
;
4392 #ifdef CONFIG_DEBUG_PREEMPT
4394 * Spinlock count overflowing soon?
4396 DEBUG_LOCKS_WARN_ON((preempt_count() & PREEMPT_MASK
) >=
4399 if (preempt_count() == val
)
4400 trace_preempt_off(CALLER_ADDR0
, get_parent_ip(CALLER_ADDR1
));
4402 EXPORT_SYMBOL(add_preempt_count
);
4404 void __kprobes
sub_preempt_count(int val
)
4406 #ifdef CONFIG_DEBUG_PREEMPT
4410 if (DEBUG_LOCKS_WARN_ON(val
> preempt_count()))
4413 * Is the spinlock portion underflowing?
4415 if (DEBUG_LOCKS_WARN_ON((val
< PREEMPT_MASK
) &&
4416 !(preempt_count() & PREEMPT_MASK
)))
4420 if (preempt_count() == val
)
4421 trace_preempt_on(CALLER_ADDR0
, get_parent_ip(CALLER_ADDR1
));
4422 preempt_count() -= val
;
4424 EXPORT_SYMBOL(sub_preempt_count
);
4429 * Print scheduling while atomic bug:
4431 static noinline
void __schedule_bug(struct task_struct
*prev
)
4433 struct pt_regs
*regs
= get_irq_regs();
4435 printk(KERN_ERR
"BUG: scheduling while atomic: %s/%d/0x%08x\n",
4436 prev
->comm
, prev
->pid
, preempt_count());
4438 debug_show_held_locks(prev
);
4439 if (irqs_disabled())
4440 print_irqtrace_events(prev
);
4449 * Various schedule()-time debugging checks and statistics:
4451 static inline void schedule_debug(struct task_struct
*prev
)
4454 * Test if we are atomic. Since do_exit() needs to call into
4455 * schedule() atomically, we ignore that path for now.
4456 * Otherwise, whine if we are scheduling when we should not be.
4458 if (unlikely(in_atomic_preempt_off()) && unlikely(!prev
->exit_state
))
4459 __schedule_bug(prev
);
4461 profile_hit(SCHED_PROFILING
, __builtin_return_address(0));
4463 schedstat_inc(this_rq(), sched_count
);
4464 #ifdef CONFIG_SCHEDSTATS
4465 if (unlikely(prev
->lock_depth
>= 0)) {
4466 schedstat_inc(this_rq(), bkl_count
);
4467 schedstat_inc(prev
, sched_info
.bkl_count
);
4473 * Pick up the highest-prio task:
4475 static inline struct task_struct
*
4476 pick_next_task(struct rq
*rq
, struct task_struct
*prev
)
4478 const struct sched_class
*class;
4479 struct task_struct
*p
;
4482 * Optimization: we know that if all tasks are in
4483 * the fair class we can call that function directly:
4485 if (likely(rq
->nr_running
== rq
->cfs
.nr_running
)) {
4486 p
= fair_sched_class
.pick_next_task(rq
);
4491 class = sched_class_highest
;
4493 p
= class->pick_next_task(rq
);
4497 * Will never be NULL as the idle class always
4498 * returns a non-NULL p:
4500 class = class->next
;
4505 * schedule() is the main scheduler function.
4507 asmlinkage
void __sched
schedule(void)
4509 struct task_struct
*prev
, *next
;
4510 unsigned long *switch_count
;
4516 cpu
= smp_processor_id();
4520 switch_count
= &prev
->nivcsw
;
4522 release_kernel_lock(prev
);
4523 need_resched_nonpreemptible
:
4525 schedule_debug(prev
);
4530 * Do the rq-clock update outside the rq lock:
4532 local_irq_disable();
4533 update_rq_clock(rq
);
4534 spin_lock(&rq
->lock
);
4535 clear_tsk_need_resched(prev
);
4537 if (prev
->state
&& !(preempt_count() & PREEMPT_ACTIVE
)) {
4538 if (unlikely((prev
->state
& TASK_INTERRUPTIBLE
) &&
4539 signal_pending(prev
))) {
4540 prev
->state
= TASK_RUNNING
;
4542 deactivate_task(rq
, prev
, 1);
4544 switch_count
= &prev
->nvcsw
;
4548 if (prev
->sched_class
->pre_schedule
)
4549 prev
->sched_class
->pre_schedule(rq
, prev
);
4552 if (unlikely(!rq
->nr_running
))
4553 idle_balance(cpu
, rq
);
4555 prev
->sched_class
->put_prev_task(rq
, prev
);
4556 next
= pick_next_task(rq
, prev
);
4558 if (likely(prev
!= next
)) {
4559 sched_info_switch(prev
, next
);
4565 context_switch(rq
, prev
, next
); /* unlocks the rq */
4567 * the context switch might have flipped the stack from under
4568 * us, hence refresh the local variables.
4570 cpu
= smp_processor_id();
4573 spin_unlock_irq(&rq
->lock
);
4577 if (unlikely(reacquire_kernel_lock(current
) < 0))
4578 goto need_resched_nonpreemptible
;
4580 preempt_enable_no_resched();
4581 if (unlikely(test_thread_flag(TIF_NEED_RESCHED
)))
4584 EXPORT_SYMBOL(schedule
);
4586 #ifdef CONFIG_PREEMPT
4588 * this is the entry point to schedule() from in-kernel preemption
4589 * off of preempt_enable. Kernel preemptions off return from interrupt
4590 * occur there and call schedule directly.
4592 asmlinkage
void __sched
preempt_schedule(void)
4594 struct thread_info
*ti
= current_thread_info();
4597 * If there is a non-zero preempt_count or interrupts are disabled,
4598 * we do not want to preempt the current task. Just return..
4600 if (likely(ti
->preempt_count
|| irqs_disabled()))
4604 add_preempt_count(PREEMPT_ACTIVE
);
4606 sub_preempt_count(PREEMPT_ACTIVE
);
4609 * Check again in case we missed a preemption opportunity
4610 * between schedule and now.
4613 } while (unlikely(test_thread_flag(TIF_NEED_RESCHED
)));
4615 EXPORT_SYMBOL(preempt_schedule
);
4618 * this is the entry point to schedule() from kernel preemption
4619 * off of irq context.
4620 * Note, that this is called and return with irqs disabled. This will
4621 * protect us against recursive calling from irq.
4623 asmlinkage
void __sched
preempt_schedule_irq(void)
4625 struct thread_info
*ti
= current_thread_info();
4627 /* Catch callers which need to be fixed */
4628 BUG_ON(ti
->preempt_count
|| !irqs_disabled());
4631 add_preempt_count(PREEMPT_ACTIVE
);
4634 local_irq_disable();
4635 sub_preempt_count(PREEMPT_ACTIVE
);
4638 * Check again in case we missed a preemption opportunity
4639 * between schedule and now.
4642 } while (unlikely(test_thread_flag(TIF_NEED_RESCHED
)));
4645 #endif /* CONFIG_PREEMPT */
4647 int default_wake_function(wait_queue_t
*curr
, unsigned mode
, int sync
,
4650 return try_to_wake_up(curr
->private, mode
, sync
);
4652 EXPORT_SYMBOL(default_wake_function
);
4655 * The core wakeup function. Non-exclusive wakeups (nr_exclusive == 0) just
4656 * wake everything up. If it's an exclusive wakeup (nr_exclusive == small +ve
4657 * number) then we wake all the non-exclusive tasks and one exclusive task.
4659 * There are circumstances in which we can try to wake a task which has already
4660 * started to run but is not in state TASK_RUNNING. try_to_wake_up() returns
4661 * zero in this (rare) case, and we handle it by continuing to scan the queue.
4663 static void __wake_up_common(wait_queue_head_t
*q
, unsigned int mode
,
4664 int nr_exclusive
, int sync
, void *key
)
4666 wait_queue_t
*curr
, *next
;
4668 list_for_each_entry_safe(curr
, next
, &q
->task_list
, task_list
) {
4669 unsigned flags
= curr
->flags
;
4671 if (curr
->func(curr
, mode
, sync
, key
) &&
4672 (flags
& WQ_FLAG_EXCLUSIVE
) && !--nr_exclusive
)
4678 * __wake_up - wake up threads blocked on a waitqueue.
4680 * @mode: which threads
4681 * @nr_exclusive: how many wake-one or wake-many threads to wake up
4682 * @key: is directly passed to the wakeup function
4684 void __wake_up(wait_queue_head_t
*q
, unsigned int mode
,
4685 int nr_exclusive
, void *key
)
4687 unsigned long flags
;
4689 spin_lock_irqsave(&q
->lock
, flags
);
4690 __wake_up_common(q
, mode
, nr_exclusive
, 0, key
);
4691 spin_unlock_irqrestore(&q
->lock
, flags
);
4693 EXPORT_SYMBOL(__wake_up
);
4696 * Same as __wake_up but called with the spinlock in wait_queue_head_t held.
4698 void __wake_up_locked(wait_queue_head_t
*q
, unsigned int mode
)
4700 __wake_up_common(q
, mode
, 1, 0, NULL
);
4704 * __wake_up_sync - wake up threads blocked on a waitqueue.
4706 * @mode: which threads
4707 * @nr_exclusive: how many wake-one or wake-many threads to wake up
4709 * The sync wakeup differs that the waker knows that it will schedule
4710 * away soon, so while the target thread will be woken up, it will not
4711 * be migrated to another CPU - ie. the two threads are 'synchronized'
4712 * with each other. This can prevent needless bouncing between CPUs.
4714 * On UP it can prevent extra preemption.
4717 __wake_up_sync(wait_queue_head_t
*q
, unsigned int mode
, int nr_exclusive
)
4719 unsigned long flags
;
4725 if (unlikely(!nr_exclusive
))
4728 spin_lock_irqsave(&q
->lock
, flags
);
4729 __wake_up_common(q
, mode
, nr_exclusive
, sync
, NULL
);
4730 spin_unlock_irqrestore(&q
->lock
, flags
);
4732 EXPORT_SYMBOL_GPL(__wake_up_sync
); /* For internal use only */
4734 void complete(struct completion
*x
)
4736 unsigned long flags
;
4738 spin_lock_irqsave(&x
->wait
.lock
, flags
);
4740 __wake_up_common(&x
->wait
, TASK_NORMAL
, 1, 0, NULL
);
4741 spin_unlock_irqrestore(&x
->wait
.lock
, flags
);
4743 EXPORT_SYMBOL(complete
);
4745 void complete_all(struct completion
*x
)
4747 unsigned long flags
;
4749 spin_lock_irqsave(&x
->wait
.lock
, flags
);
4750 x
->done
+= UINT_MAX
/2;
4751 __wake_up_common(&x
->wait
, TASK_NORMAL
, 0, 0, NULL
);
4752 spin_unlock_irqrestore(&x
->wait
.lock
, flags
);
4754 EXPORT_SYMBOL(complete_all
);
4756 static inline long __sched
4757 do_wait_for_common(struct completion
*x
, long timeout
, int state
)
4760 DECLARE_WAITQUEUE(wait
, current
);
4762 wait
.flags
|= WQ_FLAG_EXCLUSIVE
;
4763 __add_wait_queue_tail(&x
->wait
, &wait
);
4765 if ((state
== TASK_INTERRUPTIBLE
&&
4766 signal_pending(current
)) ||
4767 (state
== TASK_KILLABLE
&&
4768 fatal_signal_pending(current
))) {
4769 __remove_wait_queue(&x
->wait
, &wait
);
4770 return -ERESTARTSYS
;
4772 __set_current_state(state
);
4773 spin_unlock_irq(&x
->wait
.lock
);
4774 timeout
= schedule_timeout(timeout
);
4775 spin_lock_irq(&x
->wait
.lock
);
4777 __remove_wait_queue(&x
->wait
, &wait
);
4781 __remove_wait_queue(&x
->wait
, &wait
);
4788 wait_for_common(struct completion
*x
, long timeout
, int state
)
4792 spin_lock_irq(&x
->wait
.lock
);
4793 timeout
= do_wait_for_common(x
, timeout
, state
);
4794 spin_unlock_irq(&x
->wait
.lock
);
4798 void __sched
wait_for_completion(struct completion
*x
)
4800 wait_for_common(x
, MAX_SCHEDULE_TIMEOUT
, TASK_UNINTERRUPTIBLE
);
4802 EXPORT_SYMBOL(wait_for_completion
);
4804 unsigned long __sched
4805 wait_for_completion_timeout(struct completion
*x
, unsigned long timeout
)
4807 return wait_for_common(x
, timeout
, TASK_UNINTERRUPTIBLE
);
4809 EXPORT_SYMBOL(wait_for_completion_timeout
);
4811 int __sched
wait_for_completion_interruptible(struct completion
*x
)
4813 long t
= wait_for_common(x
, MAX_SCHEDULE_TIMEOUT
, TASK_INTERRUPTIBLE
);
4814 if (t
== -ERESTARTSYS
)
4818 EXPORT_SYMBOL(wait_for_completion_interruptible
);
4820 unsigned long __sched
4821 wait_for_completion_interruptible_timeout(struct completion
*x
,
4822 unsigned long timeout
)
4824 return wait_for_common(x
, timeout
, TASK_INTERRUPTIBLE
);
4826 EXPORT_SYMBOL(wait_for_completion_interruptible_timeout
);
4828 int __sched
wait_for_completion_killable(struct completion
*x
)
4830 long t
= wait_for_common(x
, MAX_SCHEDULE_TIMEOUT
, TASK_KILLABLE
);
4831 if (t
== -ERESTARTSYS
)
4835 EXPORT_SYMBOL(wait_for_completion_killable
);
4838 sleep_on_common(wait_queue_head_t
*q
, int state
, long timeout
)
4840 unsigned long flags
;
4843 init_waitqueue_entry(&wait
, current
);
4845 __set_current_state(state
);
4847 spin_lock_irqsave(&q
->lock
, flags
);
4848 __add_wait_queue(q
, &wait
);
4849 spin_unlock(&q
->lock
);
4850 timeout
= schedule_timeout(timeout
);
4851 spin_lock_irq(&q
->lock
);
4852 __remove_wait_queue(q
, &wait
);
4853 spin_unlock_irqrestore(&q
->lock
, flags
);
4858 void __sched
interruptible_sleep_on(wait_queue_head_t
*q
)
4860 sleep_on_common(q
, TASK_INTERRUPTIBLE
, MAX_SCHEDULE_TIMEOUT
);
4862 EXPORT_SYMBOL(interruptible_sleep_on
);
4865 interruptible_sleep_on_timeout(wait_queue_head_t
*q
, long timeout
)
4867 return sleep_on_common(q
, TASK_INTERRUPTIBLE
, timeout
);
4869 EXPORT_SYMBOL(interruptible_sleep_on_timeout
);
4871 void __sched
sleep_on(wait_queue_head_t
*q
)
4873 sleep_on_common(q
, TASK_UNINTERRUPTIBLE
, MAX_SCHEDULE_TIMEOUT
);
4875 EXPORT_SYMBOL(sleep_on
);
4877 long __sched
sleep_on_timeout(wait_queue_head_t
*q
, long timeout
)
4879 return sleep_on_common(q
, TASK_UNINTERRUPTIBLE
, timeout
);
4881 EXPORT_SYMBOL(sleep_on_timeout
);
4883 #ifdef CONFIG_RT_MUTEXES
4886 * rt_mutex_setprio - set the current priority of a task
4888 * @prio: prio value (kernel-internal form)
4890 * This function changes the 'effective' priority of a task. It does
4891 * not touch ->normal_prio like __setscheduler().
4893 * Used by the rt_mutex code to implement priority inheritance logic.
4895 void rt_mutex_setprio(struct task_struct
*p
, int prio
)
4897 unsigned long flags
;
4898 int oldprio
, on_rq
, running
;
4900 const struct sched_class
*prev_class
= p
->sched_class
;
4902 BUG_ON(prio
< 0 || prio
> MAX_PRIO
);
4904 rq
= task_rq_lock(p
, &flags
);
4905 update_rq_clock(rq
);
4908 on_rq
= p
->se
.on_rq
;
4909 running
= task_current(rq
, p
);
4911 dequeue_task(rq
, p
, 0);
4913 p
->sched_class
->put_prev_task(rq
, p
);
4916 p
->sched_class
= &rt_sched_class
;
4918 p
->sched_class
= &fair_sched_class
;
4923 p
->sched_class
->set_curr_task(rq
);
4925 enqueue_task(rq
, p
, 0);
4927 check_class_changed(rq
, p
, prev_class
, oldprio
, running
);
4929 task_rq_unlock(rq
, &flags
);
4934 void set_user_nice(struct task_struct
*p
, long nice
)
4936 int old_prio
, delta
, on_rq
;
4937 unsigned long flags
;
4940 if (TASK_NICE(p
) == nice
|| nice
< -20 || nice
> 19)
4943 * We have to be careful, if called from sys_setpriority(),
4944 * the task might be in the middle of scheduling on another CPU.
4946 rq
= task_rq_lock(p
, &flags
);
4947 update_rq_clock(rq
);
4949 * The RT priorities are set via sched_setscheduler(), but we still
4950 * allow the 'normal' nice value to be set - but as expected
4951 * it wont have any effect on scheduling until the task is
4952 * SCHED_FIFO/SCHED_RR:
4954 if (task_has_rt_policy(p
)) {
4955 p
->static_prio
= NICE_TO_PRIO(nice
);
4958 on_rq
= p
->se
.on_rq
;
4960 dequeue_task(rq
, p
, 0);
4962 p
->static_prio
= NICE_TO_PRIO(nice
);
4965 p
->prio
= effective_prio(p
);
4966 delta
= p
->prio
- old_prio
;
4969 enqueue_task(rq
, p
, 0);
4971 * If the task increased its priority or is running and
4972 * lowered its priority, then reschedule its CPU:
4974 if (delta
< 0 || (delta
> 0 && task_running(rq
, p
)))
4975 resched_task(rq
->curr
);
4978 task_rq_unlock(rq
, &flags
);
4980 EXPORT_SYMBOL(set_user_nice
);
4983 * can_nice - check if a task can reduce its nice value
4987 int can_nice(const struct task_struct
*p
, const int nice
)
4989 /* convert nice value [19,-20] to rlimit style value [1,40] */
4990 int nice_rlim
= 20 - nice
;
4992 return (nice_rlim
<= p
->signal
->rlim
[RLIMIT_NICE
].rlim_cur
||
4993 capable(CAP_SYS_NICE
));
4996 #ifdef __ARCH_WANT_SYS_NICE
4999 * sys_nice - change the priority of the current process.
5000 * @increment: priority increment
5002 * sys_setpriority is a more generic, but much slower function that
5003 * does similar things.
5005 asmlinkage
long sys_nice(int increment
)
5010 * Setpriority might change our priority at the same moment.
5011 * We don't have to worry. Conceptually one call occurs first
5012 * and we have a single winner.
5014 if (increment
< -40)
5019 nice
= PRIO_TO_NICE(current
->static_prio
) + increment
;
5025 if (increment
< 0 && !can_nice(current
, nice
))
5028 retval
= security_task_setnice(current
, nice
);
5032 set_user_nice(current
, nice
);
5039 * task_prio - return the priority value of a given task.
5040 * @p: the task in question.
5042 * This is the priority value as seen by users in /proc.
5043 * RT tasks are offset by -200. Normal tasks are centered
5044 * around 0, value goes from -16 to +15.
5046 int task_prio(const struct task_struct
*p
)
5048 return p
->prio
- MAX_RT_PRIO
;
5052 * task_nice - return the nice value of a given task.
5053 * @p: the task in question.
5055 int task_nice(const struct task_struct
*p
)
5057 return TASK_NICE(p
);
5059 EXPORT_SYMBOL(task_nice
);
5062 * idle_cpu - is a given cpu idle currently?
5063 * @cpu: the processor in question.
5065 int idle_cpu(int cpu
)
5067 return cpu_curr(cpu
) == cpu_rq(cpu
)->idle
;
5071 * idle_task - return the idle task for a given cpu.
5072 * @cpu: the processor in question.
5074 struct task_struct
*idle_task(int cpu
)
5076 return cpu_rq(cpu
)->idle
;
5080 * find_process_by_pid - find a process with a matching PID value.
5081 * @pid: the pid in question.
5083 static struct task_struct
*find_process_by_pid(pid_t pid
)
5085 return pid
? find_task_by_vpid(pid
) : current
;
5088 /* Actually do priority change: must hold rq lock. */
5090 __setscheduler(struct rq
*rq
, struct task_struct
*p
, int policy
, int prio
)
5092 BUG_ON(p
->se
.on_rq
);
5095 switch (p
->policy
) {
5099 p
->sched_class
= &fair_sched_class
;
5103 p
->sched_class
= &rt_sched_class
;
5107 p
->rt_priority
= prio
;
5108 p
->normal_prio
= normal_prio(p
);
5109 /* we are holding p->pi_lock already */
5110 p
->prio
= rt_mutex_getprio(p
);
5115 * sched_setscheduler - change the scheduling policy and/or RT priority of a thread.
5116 * @p: the task in question.
5117 * @policy: new policy.
5118 * @param: structure containing the new RT priority.
5120 * NOTE that the task may be already dead.
5122 int sched_setscheduler(struct task_struct
*p
, int policy
,
5123 struct sched_param
*param
)
5125 int retval
, oldprio
, oldpolicy
= -1, on_rq
, running
;
5126 unsigned long flags
;
5127 const struct sched_class
*prev_class
= p
->sched_class
;
5130 /* may grab non-irq protected spin_locks */
5131 BUG_ON(in_interrupt());
5133 /* double check policy once rq lock held */
5135 policy
= oldpolicy
= p
->policy
;
5136 else if (policy
!= SCHED_FIFO
&& policy
!= SCHED_RR
&&
5137 policy
!= SCHED_NORMAL
&& policy
!= SCHED_BATCH
&&
5138 policy
!= SCHED_IDLE
)
5141 * Valid priorities for SCHED_FIFO and SCHED_RR are
5142 * 1..MAX_USER_RT_PRIO-1, valid priority for SCHED_NORMAL,
5143 * SCHED_BATCH and SCHED_IDLE is 0.
5145 if (param
->sched_priority
< 0 ||
5146 (p
->mm
&& param
->sched_priority
> MAX_USER_RT_PRIO
-1) ||
5147 (!p
->mm
&& param
->sched_priority
> MAX_RT_PRIO
-1))
5149 if (rt_policy(policy
) != (param
->sched_priority
!= 0))
5153 * Allow unprivileged RT tasks to decrease priority:
5155 if (!capable(CAP_SYS_NICE
)) {
5156 if (rt_policy(policy
)) {
5157 unsigned long rlim_rtprio
;
5159 if (!lock_task_sighand(p
, &flags
))
5161 rlim_rtprio
= p
->signal
->rlim
[RLIMIT_RTPRIO
].rlim_cur
;
5162 unlock_task_sighand(p
, &flags
);
5164 /* can't set/change the rt policy */
5165 if (policy
!= p
->policy
&& !rlim_rtprio
)
5168 /* can't increase priority */
5169 if (param
->sched_priority
> p
->rt_priority
&&
5170 param
->sched_priority
> rlim_rtprio
)
5174 * Like positive nice levels, dont allow tasks to
5175 * move out of SCHED_IDLE either:
5177 if (p
->policy
== SCHED_IDLE
&& policy
!= SCHED_IDLE
)
5180 /* can't change other user's priorities */
5181 if ((current
->euid
!= p
->euid
) &&
5182 (current
->euid
!= p
->uid
))
5186 #ifdef CONFIG_RT_GROUP_SCHED
5188 * Do not allow realtime tasks into groups that have no runtime
5191 if (rt_policy(policy
) && task_group(p
)->rt_bandwidth
.rt_runtime
== 0)
5195 retval
= security_task_setscheduler(p
, policy
, param
);
5199 * make sure no PI-waiters arrive (or leave) while we are
5200 * changing the priority of the task:
5202 spin_lock_irqsave(&p
->pi_lock
, flags
);
5204 * To be able to change p->policy safely, the apropriate
5205 * runqueue lock must be held.
5207 rq
= __task_rq_lock(p
);
5208 /* recheck policy now with rq lock held */
5209 if (unlikely(oldpolicy
!= -1 && oldpolicy
!= p
->policy
)) {
5210 policy
= oldpolicy
= -1;
5211 __task_rq_unlock(rq
);
5212 spin_unlock_irqrestore(&p
->pi_lock
, flags
);
5215 update_rq_clock(rq
);
5216 on_rq
= p
->se
.on_rq
;
5217 running
= task_current(rq
, p
);
5219 deactivate_task(rq
, p
, 0);
5221 p
->sched_class
->put_prev_task(rq
, p
);
5224 __setscheduler(rq
, p
, policy
, param
->sched_priority
);
5227 p
->sched_class
->set_curr_task(rq
);
5229 activate_task(rq
, p
, 0);
5231 check_class_changed(rq
, p
, prev_class
, oldprio
, running
);
5233 __task_rq_unlock(rq
);
5234 spin_unlock_irqrestore(&p
->pi_lock
, flags
);
5236 rt_mutex_adjust_pi(p
);
5240 EXPORT_SYMBOL_GPL(sched_setscheduler
);
5243 do_sched_setscheduler(pid_t pid
, int policy
, struct sched_param __user
*param
)
5245 struct sched_param lparam
;
5246 struct task_struct
*p
;
5249 if (!param
|| pid
< 0)
5251 if (copy_from_user(&lparam
, param
, sizeof(struct sched_param
)))
5256 p
= find_process_by_pid(pid
);
5258 retval
= sched_setscheduler(p
, policy
, &lparam
);
5265 * sys_sched_setscheduler - set/change the scheduler policy and RT priority
5266 * @pid: the pid in question.
5267 * @policy: new policy.
5268 * @param: structure containing the new RT priority.
5271 sys_sched_setscheduler(pid_t pid
, int policy
, struct sched_param __user
*param
)
5273 /* negative values for policy are not valid */
5277 return do_sched_setscheduler(pid
, policy
, param
);
5281 * sys_sched_setparam - set/change the RT priority of a thread
5282 * @pid: the pid in question.
5283 * @param: structure containing the new RT priority.
5285 asmlinkage
long sys_sched_setparam(pid_t pid
, struct sched_param __user
*param
)
5287 return do_sched_setscheduler(pid
, -1, param
);
5291 * sys_sched_getscheduler - get the policy (scheduling class) of a thread
5292 * @pid: the pid in question.
5294 asmlinkage
long sys_sched_getscheduler(pid_t pid
)
5296 struct task_struct
*p
;
5303 read_lock(&tasklist_lock
);
5304 p
= find_process_by_pid(pid
);
5306 retval
= security_task_getscheduler(p
);
5310 read_unlock(&tasklist_lock
);
5315 * sys_sched_getscheduler - get the RT priority of a thread
5316 * @pid: the pid in question.
5317 * @param: structure containing the RT priority.
5319 asmlinkage
long sys_sched_getparam(pid_t pid
, struct sched_param __user
*param
)
5321 struct sched_param lp
;
5322 struct task_struct
*p
;
5325 if (!param
|| pid
< 0)
5328 read_lock(&tasklist_lock
);
5329 p
= find_process_by_pid(pid
);
5334 retval
= security_task_getscheduler(p
);
5338 lp
.sched_priority
= p
->rt_priority
;
5339 read_unlock(&tasklist_lock
);
5342 * This one might sleep, we cannot do it with a spinlock held ...
5344 retval
= copy_to_user(param
, &lp
, sizeof(*param
)) ? -EFAULT
: 0;
5349 read_unlock(&tasklist_lock
);
5353 long sched_setaffinity(pid_t pid
, const cpumask_t
*in_mask
)
5355 cpumask_t cpus_allowed
;
5356 cpumask_t new_mask
= *in_mask
;
5357 struct task_struct
*p
;
5361 read_lock(&tasklist_lock
);
5363 p
= find_process_by_pid(pid
);
5365 read_unlock(&tasklist_lock
);
5371 * It is not safe to call set_cpus_allowed with the
5372 * tasklist_lock held. We will bump the task_struct's
5373 * usage count and then drop tasklist_lock.
5376 read_unlock(&tasklist_lock
);
5379 if ((current
->euid
!= p
->euid
) && (current
->euid
!= p
->uid
) &&
5380 !capable(CAP_SYS_NICE
))
5383 retval
= security_task_setscheduler(p
, 0, NULL
);
5387 cpuset_cpus_allowed(p
, &cpus_allowed
);
5388 cpus_and(new_mask
, new_mask
, cpus_allowed
);
5390 retval
= set_cpus_allowed_ptr(p
, &new_mask
);
5393 cpuset_cpus_allowed(p
, &cpus_allowed
);
5394 if (!cpus_subset(new_mask
, cpus_allowed
)) {
5396 * We must have raced with a concurrent cpuset
5397 * update. Just reset the cpus_allowed to the
5398 * cpuset's cpus_allowed
5400 new_mask
= cpus_allowed
;
5410 static int get_user_cpu_mask(unsigned long __user
*user_mask_ptr
, unsigned len
,
5411 cpumask_t
*new_mask
)
5413 if (len
< sizeof(cpumask_t
)) {
5414 memset(new_mask
, 0, sizeof(cpumask_t
));
5415 } else if (len
> sizeof(cpumask_t
)) {
5416 len
= sizeof(cpumask_t
);
5418 return copy_from_user(new_mask
, user_mask_ptr
, len
) ? -EFAULT
: 0;
5422 * sys_sched_setaffinity - set the cpu affinity of a process
5423 * @pid: pid of the process
5424 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
5425 * @user_mask_ptr: user-space pointer to the new cpu mask
5427 asmlinkage
long sys_sched_setaffinity(pid_t pid
, unsigned int len
,
5428 unsigned long __user
*user_mask_ptr
)
5433 retval
= get_user_cpu_mask(user_mask_ptr
, len
, &new_mask
);
5437 return sched_setaffinity(pid
, &new_mask
);
5441 * Represents all cpu's present in the system
5442 * In systems capable of hotplug, this map could dynamically grow
5443 * as new cpu's are detected in the system via any platform specific
5444 * method, such as ACPI for e.g.
5447 cpumask_t cpu_present_map __read_mostly
;
5448 EXPORT_SYMBOL(cpu_present_map
);
5451 cpumask_t cpu_online_map __read_mostly
= CPU_MASK_ALL
;
5452 EXPORT_SYMBOL(cpu_online_map
);
5454 cpumask_t cpu_possible_map __read_mostly
= CPU_MASK_ALL
;
5455 EXPORT_SYMBOL(cpu_possible_map
);
5458 long sched_getaffinity(pid_t pid
, cpumask_t
*mask
)
5460 struct task_struct
*p
;
5464 read_lock(&tasklist_lock
);
5467 p
= find_process_by_pid(pid
);
5471 retval
= security_task_getscheduler(p
);
5475 cpus_and(*mask
, p
->cpus_allowed
, cpu_online_map
);
5478 read_unlock(&tasklist_lock
);
5485 * sys_sched_getaffinity - get the cpu affinity of a process
5486 * @pid: pid of the process
5487 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
5488 * @user_mask_ptr: user-space pointer to hold the current cpu mask
5490 asmlinkage
long sys_sched_getaffinity(pid_t pid
, unsigned int len
,
5491 unsigned long __user
*user_mask_ptr
)
5496 if (len
< sizeof(cpumask_t
))
5499 ret
= sched_getaffinity(pid
, &mask
);
5503 if (copy_to_user(user_mask_ptr
, &mask
, sizeof(cpumask_t
)))
5506 return sizeof(cpumask_t
);
5510 * sys_sched_yield - yield the current processor to other threads.
5512 * This function yields the current CPU to other tasks. If there are no
5513 * other threads running on this CPU then this function will return.
5515 asmlinkage
long sys_sched_yield(void)
5517 struct rq
*rq
= this_rq_lock();
5519 schedstat_inc(rq
, yld_count
);
5520 current
->sched_class
->yield_task(rq
);
5523 * Since we are going to call schedule() anyway, there's
5524 * no need to preempt or enable interrupts:
5526 __release(rq
->lock
);
5527 spin_release(&rq
->lock
.dep_map
, 1, _THIS_IP_
);
5528 _raw_spin_unlock(&rq
->lock
);
5529 preempt_enable_no_resched();
5536 static void __cond_resched(void)
5538 #ifdef CONFIG_DEBUG_SPINLOCK_SLEEP
5539 __might_sleep(__FILE__
, __LINE__
);
5542 * The BKS might be reacquired before we have dropped
5543 * PREEMPT_ACTIVE, which could trigger a second
5544 * cond_resched() call.
5547 add_preempt_count(PREEMPT_ACTIVE
);
5549 sub_preempt_count(PREEMPT_ACTIVE
);
5550 } while (need_resched());
5553 int __sched
_cond_resched(void)
5555 if (need_resched() && !(preempt_count() & PREEMPT_ACTIVE
) &&
5556 system_state
== SYSTEM_RUNNING
) {
5562 EXPORT_SYMBOL(_cond_resched
);
5565 * cond_resched_lock() - if a reschedule is pending, drop the given lock,
5566 * call schedule, and on return reacquire the lock.
5568 * This works OK both with and without CONFIG_PREEMPT. We do strange low-level
5569 * operations here to prevent schedule() from being called twice (once via
5570 * spin_unlock(), once by hand).
5572 int cond_resched_lock(spinlock_t
*lock
)
5574 int resched
= need_resched() && system_state
== SYSTEM_RUNNING
;
5577 if (spin_needbreak(lock
) || resched
) {
5579 if (resched
&& need_resched())
5588 EXPORT_SYMBOL(cond_resched_lock
);
5590 int __sched
cond_resched_softirq(void)
5592 BUG_ON(!in_softirq());
5594 if (need_resched() && system_state
== SYSTEM_RUNNING
) {
5602 EXPORT_SYMBOL(cond_resched_softirq
);
5605 * yield - yield the current processor to other threads.
5607 * This is a shortcut for kernel-space yielding - it marks the
5608 * thread runnable and calls sys_sched_yield().
5610 void __sched
yield(void)
5612 set_current_state(TASK_RUNNING
);
5615 EXPORT_SYMBOL(yield
);
5618 * This task is about to go to sleep on IO. Increment rq->nr_iowait so
5619 * that process accounting knows that this is a task in IO wait state.
5621 * But don't do that if it is a deliberate, throttling IO wait (this task
5622 * has set its backing_dev_info: the queue against which it should throttle)
5624 void __sched
io_schedule(void)
5626 struct rq
*rq
= &__raw_get_cpu_var(runqueues
);
5628 delayacct_blkio_start();
5629 atomic_inc(&rq
->nr_iowait
);
5631 atomic_dec(&rq
->nr_iowait
);
5632 delayacct_blkio_end();
5634 EXPORT_SYMBOL(io_schedule
);
5636 long __sched
io_schedule_timeout(long timeout
)
5638 struct rq
*rq
= &__raw_get_cpu_var(runqueues
);
5641 delayacct_blkio_start();
5642 atomic_inc(&rq
->nr_iowait
);
5643 ret
= schedule_timeout(timeout
);
5644 atomic_dec(&rq
->nr_iowait
);
5645 delayacct_blkio_end();
5650 * sys_sched_get_priority_max - return maximum RT priority.
5651 * @policy: scheduling class.
5653 * this syscall returns the maximum rt_priority that can be used
5654 * by a given scheduling class.
5656 asmlinkage
long sys_sched_get_priority_max(int policy
)
5663 ret
= MAX_USER_RT_PRIO
-1;
5675 * sys_sched_get_priority_min - return minimum RT priority.
5676 * @policy: scheduling class.
5678 * this syscall returns the minimum rt_priority that can be used
5679 * by a given scheduling class.
5681 asmlinkage
long sys_sched_get_priority_min(int policy
)
5699 * sys_sched_rr_get_interval - return the default timeslice of a process.
5700 * @pid: pid of the process.
5701 * @interval: userspace pointer to the timeslice value.
5703 * this syscall writes the default timeslice value of a given process
5704 * into the user-space timespec buffer. A value of '0' means infinity.
5707 long sys_sched_rr_get_interval(pid_t pid
, struct timespec __user
*interval
)
5709 struct task_struct
*p
;
5710 unsigned int time_slice
;
5718 read_lock(&tasklist_lock
);
5719 p
= find_process_by_pid(pid
);
5723 retval
= security_task_getscheduler(p
);
5728 * Time slice is 0 for SCHED_FIFO tasks and for SCHED_OTHER
5729 * tasks that are on an otherwise idle runqueue:
5732 if (p
->policy
== SCHED_RR
) {
5733 time_slice
= DEF_TIMESLICE
;
5734 } else if (p
->policy
!= SCHED_FIFO
) {
5735 struct sched_entity
*se
= &p
->se
;
5736 unsigned long flags
;
5739 rq
= task_rq_lock(p
, &flags
);
5740 if (rq
->cfs
.load
.weight
)
5741 time_slice
= NS_TO_JIFFIES(sched_slice(&rq
->cfs
, se
));
5742 task_rq_unlock(rq
, &flags
);
5744 read_unlock(&tasklist_lock
);
5745 jiffies_to_timespec(time_slice
, &t
);
5746 retval
= copy_to_user(interval
, &t
, sizeof(t
)) ? -EFAULT
: 0;
5750 read_unlock(&tasklist_lock
);
5754 static const char stat_nam
[] = TASK_STATE_TO_CHAR_STR
;
5756 void sched_show_task(struct task_struct
*p
)
5758 unsigned long free
= 0;
5761 state
= p
->state
? __ffs(p
->state
) + 1 : 0;
5762 printk(KERN_INFO
"%-13.13s %c", p
->comm
,
5763 state
< sizeof(stat_nam
) - 1 ? stat_nam
[state
] : '?');
5764 #if BITS_PER_LONG == 32
5765 if (state
== TASK_RUNNING
)
5766 printk(KERN_CONT
" running ");
5768 printk(KERN_CONT
" %08lx ", thread_saved_pc(p
));
5770 if (state
== TASK_RUNNING
)
5771 printk(KERN_CONT
" running task ");
5773 printk(KERN_CONT
" %016lx ", thread_saved_pc(p
));
5775 #ifdef CONFIG_DEBUG_STACK_USAGE
5777 unsigned long *n
= end_of_stack(p
);
5780 free
= (unsigned long)n
- (unsigned long)end_of_stack(p
);
5783 printk(KERN_CONT
"%5lu %5d %6d\n", free
,
5784 task_pid_nr(p
), task_pid_nr(p
->real_parent
));
5786 show_stack(p
, NULL
);
5789 void show_state_filter(unsigned long state_filter
)
5791 struct task_struct
*g
, *p
;
5793 #if BITS_PER_LONG == 32
5795 " task PC stack pid father\n");
5798 " task PC stack pid father\n");
5800 read_lock(&tasklist_lock
);
5801 do_each_thread(g
, p
) {
5803 * reset the NMI-timeout, listing all files on a slow
5804 * console might take alot of time:
5806 touch_nmi_watchdog();
5807 if (!state_filter
|| (p
->state
& state_filter
))
5809 } while_each_thread(g
, p
);
5811 touch_all_softlockup_watchdogs();
5813 #ifdef CONFIG_SCHED_DEBUG
5814 sysrq_sched_debug_show();
5816 read_unlock(&tasklist_lock
);
5818 * Only show locks if all tasks are dumped:
5820 if (state_filter
== -1)
5821 debug_show_all_locks();
5824 void __cpuinit
init_idle_bootup_task(struct task_struct
*idle
)
5826 idle
->sched_class
= &idle_sched_class
;
5830 * init_idle - set up an idle thread for a given CPU
5831 * @idle: task in question
5832 * @cpu: cpu the idle task belongs to
5834 * NOTE: this function does not set the idle thread's NEED_RESCHED
5835 * flag, to make booting more robust.
5837 void __cpuinit
init_idle(struct task_struct
*idle
, int cpu
)
5839 struct rq
*rq
= cpu_rq(cpu
);
5840 unsigned long flags
;
5843 idle
->se
.exec_start
= sched_clock();
5845 idle
->prio
= idle
->normal_prio
= MAX_PRIO
;
5846 idle
->cpus_allowed
= cpumask_of_cpu(cpu
);
5847 __set_task_cpu(idle
, cpu
);
5849 spin_lock_irqsave(&rq
->lock
, flags
);
5850 rq
->curr
= rq
->idle
= idle
;
5851 #if defined(CONFIG_SMP) && defined(__ARCH_WANT_UNLOCKED_CTXSW)
5854 spin_unlock_irqrestore(&rq
->lock
, flags
);
5856 /* Set the preempt count _outside_ the spinlocks! */
5857 #if defined(CONFIG_PREEMPT)
5858 task_thread_info(idle
)->preempt_count
= (idle
->lock_depth
>= 0);
5860 task_thread_info(idle
)->preempt_count
= 0;
5863 * The idle tasks have their own, simple scheduling class:
5865 idle
->sched_class
= &idle_sched_class
;
5869 * In a system that switches off the HZ timer nohz_cpu_mask
5870 * indicates which cpus entered this state. This is used
5871 * in the rcu update to wait only for active cpus. For system
5872 * which do not switch off the HZ timer nohz_cpu_mask should
5873 * always be CPU_MASK_NONE.
5875 cpumask_t nohz_cpu_mask
= CPU_MASK_NONE
;
5878 * Increase the granularity value when there are more CPUs,
5879 * because with more CPUs the 'effective latency' as visible
5880 * to users decreases. But the relationship is not linear,
5881 * so pick a second-best guess by going with the log2 of the
5884 * This idea comes from the SD scheduler of Con Kolivas:
5886 static inline void sched_init_granularity(void)
5888 unsigned int factor
= 1 + ilog2(num_online_cpus());
5889 const unsigned long limit
= 200000000;
5891 sysctl_sched_min_granularity
*= factor
;
5892 if (sysctl_sched_min_granularity
> limit
)
5893 sysctl_sched_min_granularity
= limit
;
5895 sysctl_sched_latency
*= factor
;
5896 if (sysctl_sched_latency
> limit
)
5897 sysctl_sched_latency
= limit
;
5899 sysctl_sched_wakeup_granularity
*= factor
;
5904 * This is how migration works:
5906 * 1) we queue a struct migration_req structure in the source CPU's
5907 * runqueue and wake up that CPU's migration thread.
5908 * 2) we down() the locked semaphore => thread blocks.
5909 * 3) migration thread wakes up (implicitly it forces the migrated
5910 * thread off the CPU)
5911 * 4) it gets the migration request and checks whether the migrated
5912 * task is still in the wrong runqueue.
5913 * 5) if it's in the wrong runqueue then the migration thread removes
5914 * it and puts it into the right queue.
5915 * 6) migration thread up()s the semaphore.
5916 * 7) we wake up and the migration is done.
5920 * Change a given task's CPU affinity. Migrate the thread to a
5921 * proper CPU and schedule it away if the CPU it's executing on
5922 * is removed from the allowed bitmask.
5924 * NOTE: the caller must have a valid reference to the task, the
5925 * task must not exit() & deallocate itself prematurely. The
5926 * call is not atomic; no spinlocks may be held.
5928 int set_cpus_allowed_ptr(struct task_struct
*p
, const cpumask_t
*new_mask
)
5930 struct migration_req req
;
5931 unsigned long flags
;
5935 rq
= task_rq_lock(p
, &flags
);
5936 if (!cpus_intersects(*new_mask
, cpu_online_map
)) {
5941 if (p
->sched_class
->set_cpus_allowed
)
5942 p
->sched_class
->set_cpus_allowed(p
, new_mask
);
5944 p
->cpus_allowed
= *new_mask
;
5945 p
->rt
.nr_cpus_allowed
= cpus_weight(*new_mask
);
5948 /* Can the task run on the task's current CPU? If so, we're done */
5949 if (cpu_isset(task_cpu(p
), *new_mask
))
5952 if (migrate_task(p
, any_online_cpu(*new_mask
), &req
)) {
5953 /* Need help from migration thread: drop lock and wait. */
5954 task_rq_unlock(rq
, &flags
);
5955 wake_up_process(rq
->migration_thread
);
5956 wait_for_completion(&req
.done
);
5957 tlb_migrate_finish(p
->mm
);
5961 task_rq_unlock(rq
, &flags
);
5965 EXPORT_SYMBOL_GPL(set_cpus_allowed_ptr
);
5968 * Move (not current) task off this cpu, onto dest cpu. We're doing
5969 * this because either it can't run here any more (set_cpus_allowed()
5970 * away from this CPU, or CPU going down), or because we're
5971 * attempting to rebalance this task on exec (sched_exec).
5973 * So we race with normal scheduler movements, but that's OK, as long
5974 * as the task is no longer on this CPU.
5976 * Returns non-zero if task was successfully migrated.
5978 static int __migrate_task(struct task_struct
*p
, int src_cpu
, int dest_cpu
)
5980 struct rq
*rq_dest
, *rq_src
;
5983 if (unlikely(cpu_is_offline(dest_cpu
)))
5986 rq_src
= cpu_rq(src_cpu
);
5987 rq_dest
= cpu_rq(dest_cpu
);
5989 double_rq_lock(rq_src
, rq_dest
);
5990 /* Already moved. */
5991 if (task_cpu(p
) != src_cpu
)
5993 /* Affinity changed (again). */
5994 if (!cpu_isset(dest_cpu
, p
->cpus_allowed
))
5997 on_rq
= p
->se
.on_rq
;
5999 deactivate_task(rq_src
, p
, 0);
6001 set_task_cpu(p
, dest_cpu
);
6003 activate_task(rq_dest
, p
, 0);
6004 check_preempt_curr(rq_dest
, p
);
6008 double_rq_unlock(rq_src
, rq_dest
);
6013 * migration_thread - this is a highprio system thread that performs
6014 * thread migration by bumping thread off CPU then 'pushing' onto
6017 static int migration_thread(void *data
)
6019 int cpu
= (long)data
;
6023 BUG_ON(rq
->migration_thread
!= current
);
6025 set_current_state(TASK_INTERRUPTIBLE
);
6026 while (!kthread_should_stop()) {
6027 struct migration_req
*req
;
6028 struct list_head
*head
;
6030 spin_lock_irq(&rq
->lock
);
6032 if (cpu_is_offline(cpu
)) {
6033 spin_unlock_irq(&rq
->lock
);
6037 if (rq
->active_balance
) {
6038 active_load_balance(rq
, cpu
);
6039 rq
->active_balance
= 0;
6042 head
= &rq
->migration_queue
;
6044 if (list_empty(head
)) {
6045 spin_unlock_irq(&rq
->lock
);
6047 set_current_state(TASK_INTERRUPTIBLE
);
6050 req
= list_entry(head
->next
, struct migration_req
, list
);
6051 list_del_init(head
->next
);
6053 spin_unlock(&rq
->lock
);
6054 __migrate_task(req
->task
, cpu
, req
->dest_cpu
);
6057 complete(&req
->done
);
6059 __set_current_state(TASK_RUNNING
);
6063 /* Wait for kthread_stop */
6064 set_current_state(TASK_INTERRUPTIBLE
);
6065 while (!kthread_should_stop()) {
6067 set_current_state(TASK_INTERRUPTIBLE
);
6069 __set_current_state(TASK_RUNNING
);
6073 #ifdef CONFIG_HOTPLUG_CPU
6075 static int __migrate_task_irq(struct task_struct
*p
, int src_cpu
, int dest_cpu
)
6079 local_irq_disable();
6080 ret
= __migrate_task(p
, src_cpu
, dest_cpu
);
6086 * Figure out where task on dead CPU should go, use force if necessary.
6087 * NOTE: interrupts should be disabled by the caller
6089 static void move_task_off_dead_cpu(int dead_cpu
, struct task_struct
*p
)
6091 unsigned long flags
;
6098 mask
= node_to_cpumask(cpu_to_node(dead_cpu
));
6099 cpus_and(mask
, mask
, p
->cpus_allowed
);
6100 dest_cpu
= any_online_cpu(mask
);
6102 /* On any allowed CPU? */
6103 if (dest_cpu
>= nr_cpu_ids
)
6104 dest_cpu
= any_online_cpu(p
->cpus_allowed
);
6106 /* No more Mr. Nice Guy. */
6107 if (dest_cpu
>= nr_cpu_ids
) {
6108 cpumask_t cpus_allowed
;
6110 cpuset_cpus_allowed_locked(p
, &cpus_allowed
);
6112 * Try to stay on the same cpuset, where the
6113 * current cpuset may be a subset of all cpus.
6114 * The cpuset_cpus_allowed_locked() variant of
6115 * cpuset_cpus_allowed() will not block. It must be
6116 * called within calls to cpuset_lock/cpuset_unlock.
6118 rq
= task_rq_lock(p
, &flags
);
6119 p
->cpus_allowed
= cpus_allowed
;
6120 dest_cpu
= any_online_cpu(p
->cpus_allowed
);
6121 task_rq_unlock(rq
, &flags
);
6124 * Don't tell them about moving exiting tasks or
6125 * kernel threads (both mm NULL), since they never
6128 if (p
->mm
&& printk_ratelimit()) {
6129 printk(KERN_INFO
"process %d (%s) no "
6130 "longer affine to cpu%d\n",
6131 task_pid_nr(p
), p
->comm
, dead_cpu
);
6134 } while (!__migrate_task_irq(p
, dead_cpu
, dest_cpu
));
6138 * While a dead CPU has no uninterruptible tasks queued at this point,
6139 * it might still have a nonzero ->nr_uninterruptible counter, because
6140 * for performance reasons the counter is not stricly tracking tasks to
6141 * their home CPUs. So we just add the counter to another CPU's counter,
6142 * to keep the global sum constant after CPU-down:
6144 static void migrate_nr_uninterruptible(struct rq
*rq_src
)
6146 struct rq
*rq_dest
= cpu_rq(any_online_cpu(*CPU_MASK_ALL_PTR
));
6147 unsigned long flags
;
6149 local_irq_save(flags
);
6150 double_rq_lock(rq_src
, rq_dest
);
6151 rq_dest
->nr_uninterruptible
+= rq_src
->nr_uninterruptible
;
6152 rq_src
->nr_uninterruptible
= 0;
6153 double_rq_unlock(rq_src
, rq_dest
);
6154 local_irq_restore(flags
);
6157 /* Run through task list and migrate tasks from the dead cpu. */
6158 static void migrate_live_tasks(int src_cpu
)
6160 struct task_struct
*p
, *t
;
6162 read_lock(&tasklist_lock
);
6164 do_each_thread(t
, p
) {
6168 if (task_cpu(p
) == src_cpu
)
6169 move_task_off_dead_cpu(src_cpu
, p
);
6170 } while_each_thread(t
, p
);
6172 read_unlock(&tasklist_lock
);
6176 * Schedules idle task to be the next runnable task on current CPU.
6177 * It does so by boosting its priority to highest possible.
6178 * Used by CPU offline code.
6180 void sched_idle_next(void)
6182 int this_cpu
= smp_processor_id();
6183 struct rq
*rq
= cpu_rq(this_cpu
);
6184 struct task_struct
*p
= rq
->idle
;
6185 unsigned long flags
;
6187 /* cpu has to be offline */
6188 BUG_ON(cpu_online(this_cpu
));
6191 * Strictly not necessary since rest of the CPUs are stopped by now
6192 * and interrupts disabled on the current cpu.
6194 spin_lock_irqsave(&rq
->lock
, flags
);
6196 __setscheduler(rq
, p
, SCHED_FIFO
, MAX_RT_PRIO
-1);
6198 update_rq_clock(rq
);
6199 activate_task(rq
, p
, 0);
6201 spin_unlock_irqrestore(&rq
->lock
, flags
);
6205 * Ensures that the idle task is using init_mm right before its cpu goes
6208 void idle_task_exit(void)
6210 struct mm_struct
*mm
= current
->active_mm
;
6212 BUG_ON(cpu_online(smp_processor_id()));
6215 switch_mm(mm
, &init_mm
, current
);
6219 /* called under rq->lock with disabled interrupts */
6220 static void migrate_dead(unsigned int dead_cpu
, struct task_struct
*p
)
6222 struct rq
*rq
= cpu_rq(dead_cpu
);
6224 /* Must be exiting, otherwise would be on tasklist. */
6225 BUG_ON(!p
->exit_state
);
6227 /* Cannot have done final schedule yet: would have vanished. */
6228 BUG_ON(p
->state
== TASK_DEAD
);
6233 * Drop lock around migration; if someone else moves it,
6234 * that's OK. No task can be added to this CPU, so iteration is
6237 spin_unlock_irq(&rq
->lock
);
6238 move_task_off_dead_cpu(dead_cpu
, p
);
6239 spin_lock_irq(&rq
->lock
);
6244 /* release_task() removes task from tasklist, so we won't find dead tasks. */
6245 static void migrate_dead_tasks(unsigned int dead_cpu
)
6247 struct rq
*rq
= cpu_rq(dead_cpu
);
6248 struct task_struct
*next
;
6251 if (!rq
->nr_running
)
6253 update_rq_clock(rq
);
6254 next
= pick_next_task(rq
, rq
->curr
);
6257 migrate_dead(dead_cpu
, next
);
6261 #endif /* CONFIG_HOTPLUG_CPU */
6263 #if defined(CONFIG_SCHED_DEBUG) && defined(CONFIG_SYSCTL)
6265 static struct ctl_table sd_ctl_dir
[] = {
6267 .procname
= "sched_domain",
6273 static struct ctl_table sd_ctl_root
[] = {
6275 .ctl_name
= CTL_KERN
,
6276 .procname
= "kernel",
6278 .child
= sd_ctl_dir
,
6283 static struct ctl_table
*sd_alloc_ctl_entry(int n
)
6285 struct ctl_table
*entry
=
6286 kcalloc(n
, sizeof(struct ctl_table
), GFP_KERNEL
);
6291 static void sd_free_ctl_entry(struct ctl_table
**tablep
)
6293 struct ctl_table
*entry
;
6296 * In the intermediate directories, both the child directory and
6297 * procname are dynamically allocated and could fail but the mode
6298 * will always be set. In the lowest directory the names are
6299 * static strings and all have proc handlers.
6301 for (entry
= *tablep
; entry
->mode
; entry
++) {
6303 sd_free_ctl_entry(&entry
->child
);
6304 if (entry
->proc_handler
== NULL
)
6305 kfree(entry
->procname
);
6313 set_table_entry(struct ctl_table
*entry
,
6314 const char *procname
, void *data
, int maxlen
,
6315 mode_t mode
, proc_handler
*proc_handler
)
6317 entry
->procname
= procname
;
6319 entry
->maxlen
= maxlen
;
6321 entry
->proc_handler
= proc_handler
;
6324 static struct ctl_table
*
6325 sd_alloc_ctl_domain_table(struct sched_domain
*sd
)
6327 struct ctl_table
*table
= sd_alloc_ctl_entry(12);
6332 set_table_entry(&table
[0], "min_interval", &sd
->min_interval
,
6333 sizeof(long), 0644, proc_doulongvec_minmax
);
6334 set_table_entry(&table
[1], "max_interval", &sd
->max_interval
,
6335 sizeof(long), 0644, proc_doulongvec_minmax
);
6336 set_table_entry(&table
[2], "busy_idx", &sd
->busy_idx
,
6337 sizeof(int), 0644, proc_dointvec_minmax
);
6338 set_table_entry(&table
[3], "idle_idx", &sd
->idle_idx
,
6339 sizeof(int), 0644, proc_dointvec_minmax
);
6340 set_table_entry(&table
[4], "newidle_idx", &sd
->newidle_idx
,
6341 sizeof(int), 0644, proc_dointvec_minmax
);
6342 set_table_entry(&table
[5], "wake_idx", &sd
->wake_idx
,
6343 sizeof(int), 0644, proc_dointvec_minmax
);
6344 set_table_entry(&table
[6], "forkexec_idx", &sd
->forkexec_idx
,
6345 sizeof(int), 0644, proc_dointvec_minmax
);
6346 set_table_entry(&table
[7], "busy_factor", &sd
->busy_factor
,
6347 sizeof(int), 0644, proc_dointvec_minmax
);
6348 set_table_entry(&table
[8], "imbalance_pct", &sd
->imbalance_pct
,
6349 sizeof(int), 0644, proc_dointvec_minmax
);
6350 set_table_entry(&table
[9], "cache_nice_tries",
6351 &sd
->cache_nice_tries
,
6352 sizeof(int), 0644, proc_dointvec_minmax
);
6353 set_table_entry(&table
[10], "flags", &sd
->flags
,
6354 sizeof(int), 0644, proc_dointvec_minmax
);
6355 /* &table[11] is terminator */
6360 static ctl_table
*sd_alloc_ctl_cpu_table(int cpu
)
6362 struct ctl_table
*entry
, *table
;
6363 struct sched_domain
*sd
;
6364 int domain_num
= 0, i
;
6367 for_each_domain(cpu
, sd
)
6369 entry
= table
= sd_alloc_ctl_entry(domain_num
+ 1);
6374 for_each_domain(cpu
, sd
) {
6375 snprintf(buf
, 32, "domain%d", i
);
6376 entry
->procname
= kstrdup(buf
, GFP_KERNEL
);
6378 entry
->child
= sd_alloc_ctl_domain_table(sd
);
6385 static struct ctl_table_header
*sd_sysctl_header
;
6386 static void register_sched_domain_sysctl(void)
6388 int i
, cpu_num
= num_online_cpus();
6389 struct ctl_table
*entry
= sd_alloc_ctl_entry(cpu_num
+ 1);
6392 WARN_ON(sd_ctl_dir
[0].child
);
6393 sd_ctl_dir
[0].child
= entry
;
6398 for_each_online_cpu(i
) {
6399 snprintf(buf
, 32, "cpu%d", i
);
6400 entry
->procname
= kstrdup(buf
, GFP_KERNEL
);
6402 entry
->child
= sd_alloc_ctl_cpu_table(i
);
6406 WARN_ON(sd_sysctl_header
);
6407 sd_sysctl_header
= register_sysctl_table(sd_ctl_root
);
6410 /* may be called multiple times per register */
6411 static void unregister_sched_domain_sysctl(void)
6413 if (sd_sysctl_header
)
6414 unregister_sysctl_table(sd_sysctl_header
);
6415 sd_sysctl_header
= NULL
;
6416 if (sd_ctl_dir
[0].child
)
6417 sd_free_ctl_entry(&sd_ctl_dir
[0].child
);
6420 static void register_sched_domain_sysctl(void)
6423 static void unregister_sched_domain_sysctl(void)
6429 * migration_call - callback that gets triggered when a CPU is added.
6430 * Here we can start up the necessary migration thread for the new CPU.
6432 static int __cpuinit
6433 migration_call(struct notifier_block
*nfb
, unsigned long action
, void *hcpu
)
6435 struct task_struct
*p
;
6436 int cpu
= (long)hcpu
;
6437 unsigned long flags
;
6442 case CPU_UP_PREPARE
:
6443 case CPU_UP_PREPARE_FROZEN
:
6444 p
= kthread_create(migration_thread
, hcpu
, "migration/%d", cpu
);
6447 kthread_bind(p
, cpu
);
6448 /* Must be high prio: stop_machine expects to yield to it. */
6449 rq
= task_rq_lock(p
, &flags
);
6450 __setscheduler(rq
, p
, SCHED_FIFO
, MAX_RT_PRIO
-1);
6451 task_rq_unlock(rq
, &flags
);
6452 cpu_rq(cpu
)->migration_thread
= p
;
6456 case CPU_ONLINE_FROZEN
:
6457 /* Strictly unnecessary, as first user will wake it. */
6458 wake_up_process(cpu_rq(cpu
)->migration_thread
);
6460 /* Update our root-domain */
6462 spin_lock_irqsave(&rq
->lock
, flags
);
6464 BUG_ON(!cpu_isset(cpu
, rq
->rd
->span
));
6465 cpu_set(cpu
, rq
->rd
->online
);
6467 spin_unlock_irqrestore(&rq
->lock
, flags
);
6470 #ifdef CONFIG_HOTPLUG_CPU
6471 case CPU_UP_CANCELED
:
6472 case CPU_UP_CANCELED_FROZEN
:
6473 if (!cpu_rq(cpu
)->migration_thread
)
6475 /* Unbind it from offline cpu so it can run. Fall thru. */
6476 kthread_bind(cpu_rq(cpu
)->migration_thread
,
6477 any_online_cpu(cpu_online_map
));
6478 kthread_stop(cpu_rq(cpu
)->migration_thread
);
6479 cpu_rq(cpu
)->migration_thread
= NULL
;
6483 case CPU_DEAD_FROZEN
:
6484 cpuset_lock(); /* around calls to cpuset_cpus_allowed_lock() */
6485 migrate_live_tasks(cpu
);
6487 kthread_stop(rq
->migration_thread
);
6488 rq
->migration_thread
= NULL
;
6489 /* Idle task back to normal (off runqueue, low prio) */
6490 spin_lock_irq(&rq
->lock
);
6491 update_rq_clock(rq
);
6492 deactivate_task(rq
, rq
->idle
, 0);
6493 rq
->idle
->static_prio
= MAX_PRIO
;
6494 __setscheduler(rq
, rq
->idle
, SCHED_NORMAL
, 0);
6495 rq
->idle
->sched_class
= &idle_sched_class
;
6496 migrate_dead_tasks(cpu
);
6497 spin_unlock_irq(&rq
->lock
);
6499 migrate_nr_uninterruptible(rq
);
6500 BUG_ON(rq
->nr_running
!= 0);
6503 * No need to migrate the tasks: it was best-effort if
6504 * they didn't take sched_hotcpu_mutex. Just wake up
6507 spin_lock_irq(&rq
->lock
);
6508 while (!list_empty(&rq
->migration_queue
)) {
6509 struct migration_req
*req
;
6511 req
= list_entry(rq
->migration_queue
.next
,
6512 struct migration_req
, list
);
6513 list_del_init(&req
->list
);
6514 complete(&req
->done
);
6516 spin_unlock_irq(&rq
->lock
);
6520 case CPU_DYING_FROZEN
:
6521 /* Update our root-domain */
6523 spin_lock_irqsave(&rq
->lock
, flags
);
6525 BUG_ON(!cpu_isset(cpu
, rq
->rd
->span
));
6526 cpu_clear(cpu
, rq
->rd
->online
);
6528 spin_unlock_irqrestore(&rq
->lock
, flags
);
6535 /* Register at highest priority so that task migration (migrate_all_tasks)
6536 * happens before everything else.
6538 static struct notifier_block __cpuinitdata migration_notifier
= {
6539 .notifier_call
= migration_call
,
6543 void __init
migration_init(void)
6545 void *cpu
= (void *)(long)smp_processor_id();
6548 /* Start one for the boot CPU: */
6549 err
= migration_call(&migration_notifier
, CPU_UP_PREPARE
, cpu
);
6550 BUG_ON(err
== NOTIFY_BAD
);
6551 migration_call(&migration_notifier
, CPU_ONLINE
, cpu
);
6552 register_cpu_notifier(&migration_notifier
);
6558 #ifdef CONFIG_SCHED_DEBUG
6560 static int sched_domain_debug_one(struct sched_domain
*sd
, int cpu
, int level
,
6561 cpumask_t
*groupmask
)
6563 struct sched_group
*group
= sd
->groups
;
6566 cpulist_scnprintf(str
, sizeof(str
), sd
->span
);
6567 cpus_clear(*groupmask
);
6569 printk(KERN_DEBUG
"%*s domain %d: ", level
, "", level
);
6571 if (!(sd
->flags
& SD_LOAD_BALANCE
)) {
6572 printk("does not load-balance\n");
6574 printk(KERN_ERR
"ERROR: !SD_LOAD_BALANCE domain"
6579 printk(KERN_CONT
"span %s\n", str
);
6581 if (!cpu_isset(cpu
, sd
->span
)) {
6582 printk(KERN_ERR
"ERROR: domain->span does not contain "
6585 if (!cpu_isset(cpu
, group
->cpumask
)) {
6586 printk(KERN_ERR
"ERROR: domain->groups does not contain"
6590 printk(KERN_DEBUG
"%*s groups:", level
+ 1, "");
6594 printk(KERN_ERR
"ERROR: group is NULL\n");
6598 if (!group
->__cpu_power
) {
6599 printk(KERN_CONT
"\n");
6600 printk(KERN_ERR
"ERROR: domain->cpu_power not "
6605 if (!cpus_weight(group
->cpumask
)) {
6606 printk(KERN_CONT
"\n");
6607 printk(KERN_ERR
"ERROR: empty group\n");
6611 if (cpus_intersects(*groupmask
, group
->cpumask
)) {
6612 printk(KERN_CONT
"\n");
6613 printk(KERN_ERR
"ERROR: repeated CPUs\n");
6617 cpus_or(*groupmask
, *groupmask
, group
->cpumask
);
6619 cpulist_scnprintf(str
, sizeof(str
), group
->cpumask
);
6620 printk(KERN_CONT
" %s", str
);
6622 group
= group
->next
;
6623 } while (group
!= sd
->groups
);
6624 printk(KERN_CONT
"\n");
6626 if (!cpus_equal(sd
->span
, *groupmask
))
6627 printk(KERN_ERR
"ERROR: groups don't span domain->span\n");
6629 if (sd
->parent
&& !cpus_subset(*groupmask
, sd
->parent
->span
))
6630 printk(KERN_ERR
"ERROR: parent span is not a superset "
6631 "of domain->span\n");
6635 static void sched_domain_debug(struct sched_domain
*sd
, int cpu
)
6637 cpumask_t
*groupmask
;
6641 printk(KERN_DEBUG
"CPU%d attaching NULL sched-domain.\n", cpu
);
6645 printk(KERN_DEBUG
"CPU%d attaching sched-domain:\n", cpu
);
6647 groupmask
= kmalloc(sizeof(cpumask_t
), GFP_KERNEL
);
6649 printk(KERN_DEBUG
"Cannot load-balance (out of memory)\n");
6654 if (sched_domain_debug_one(sd
, cpu
, level
, groupmask
))
6664 # define sched_domain_debug(sd, cpu) do { } while (0)
6667 static int sd_degenerate(struct sched_domain
*sd
)
6669 if (cpus_weight(sd
->span
) == 1)
6672 /* Following flags need at least 2 groups */
6673 if (sd
->flags
& (SD_LOAD_BALANCE
|
6674 SD_BALANCE_NEWIDLE
|
6678 SD_SHARE_PKG_RESOURCES
)) {
6679 if (sd
->groups
!= sd
->groups
->next
)
6683 /* Following flags don't use groups */
6684 if (sd
->flags
& (SD_WAKE_IDLE
|
6693 sd_parent_degenerate(struct sched_domain
*sd
, struct sched_domain
*parent
)
6695 unsigned long cflags
= sd
->flags
, pflags
= parent
->flags
;
6697 if (sd_degenerate(parent
))
6700 if (!cpus_equal(sd
->span
, parent
->span
))
6703 /* Does parent contain flags not in child? */
6704 /* WAKE_BALANCE is a subset of WAKE_AFFINE */
6705 if (cflags
& SD_WAKE_AFFINE
)
6706 pflags
&= ~SD_WAKE_BALANCE
;
6707 /* Flags needing groups don't count if only 1 group in parent */
6708 if (parent
->groups
== parent
->groups
->next
) {
6709 pflags
&= ~(SD_LOAD_BALANCE
|
6710 SD_BALANCE_NEWIDLE
|
6714 SD_SHARE_PKG_RESOURCES
);
6716 if (~cflags
& pflags
)
6722 static void rq_attach_root(struct rq
*rq
, struct root_domain
*rd
)
6724 unsigned long flags
;
6725 const struct sched_class
*class;
6727 spin_lock_irqsave(&rq
->lock
, flags
);
6730 struct root_domain
*old_rd
= rq
->rd
;
6732 for (class = sched_class_highest
; class; class = class->next
) {
6733 if (class->leave_domain
)
6734 class->leave_domain(rq
);
6737 cpu_clear(rq
->cpu
, old_rd
->span
);
6738 cpu_clear(rq
->cpu
, old_rd
->online
);
6740 if (atomic_dec_and_test(&old_rd
->refcount
))
6744 atomic_inc(&rd
->refcount
);
6747 cpu_set(rq
->cpu
, rd
->span
);
6748 if (cpu_isset(rq
->cpu
, cpu_online_map
))
6749 cpu_set(rq
->cpu
, rd
->online
);
6751 for (class = sched_class_highest
; class; class = class->next
) {
6752 if (class->join_domain
)
6753 class->join_domain(rq
);
6756 spin_unlock_irqrestore(&rq
->lock
, flags
);
6759 static void init_rootdomain(struct root_domain
*rd
)
6761 memset(rd
, 0, sizeof(*rd
));
6763 cpus_clear(rd
->span
);
6764 cpus_clear(rd
->online
);
6767 static void init_defrootdomain(void)
6769 init_rootdomain(&def_root_domain
);
6770 atomic_set(&def_root_domain
.refcount
, 1);
6773 static struct root_domain
*alloc_rootdomain(void)
6775 struct root_domain
*rd
;
6777 rd
= kmalloc(sizeof(*rd
), GFP_KERNEL
);
6781 init_rootdomain(rd
);
6787 * Attach the domain 'sd' to 'cpu' as its base domain. Callers must
6788 * hold the hotplug lock.
6791 cpu_attach_domain(struct sched_domain
*sd
, struct root_domain
*rd
, int cpu
)
6793 struct rq
*rq
= cpu_rq(cpu
);
6794 struct sched_domain
*tmp
;
6796 /* Remove the sched domains which do not contribute to scheduling. */
6797 for (tmp
= sd
; tmp
; tmp
= tmp
->parent
) {
6798 struct sched_domain
*parent
= tmp
->parent
;
6801 if (sd_parent_degenerate(tmp
, parent
)) {
6802 tmp
->parent
= parent
->parent
;
6804 parent
->parent
->child
= tmp
;
6808 if (sd
&& sd_degenerate(sd
)) {
6814 sched_domain_debug(sd
, cpu
);
6816 rq_attach_root(rq
, rd
);
6817 rcu_assign_pointer(rq
->sd
, sd
);
6820 /* cpus with isolated domains */
6821 static cpumask_t cpu_isolated_map
= CPU_MASK_NONE
;
6823 /* Setup the mask of cpus configured for isolated domains */
6824 static int __init
isolated_cpu_setup(char *str
)
6826 int ints
[NR_CPUS
], i
;
6828 str
= get_options(str
, ARRAY_SIZE(ints
), ints
);
6829 cpus_clear(cpu_isolated_map
);
6830 for (i
= 1; i
<= ints
[0]; i
++)
6831 if (ints
[i
] < NR_CPUS
)
6832 cpu_set(ints
[i
], cpu_isolated_map
);
6836 __setup("isolcpus=", isolated_cpu_setup
);
6839 * init_sched_build_groups takes the cpumask we wish to span, and a pointer
6840 * to a function which identifies what group(along with sched group) a CPU
6841 * belongs to. The return value of group_fn must be a >= 0 and < NR_CPUS
6842 * (due to the fact that we keep track of groups covered with a cpumask_t).
6844 * init_sched_build_groups will build a circular linked list of the groups
6845 * covered by the given span, and will set each group's ->cpumask correctly,
6846 * and ->cpu_power to 0.
6849 init_sched_build_groups(const cpumask_t
*span
, const cpumask_t
*cpu_map
,
6850 int (*group_fn
)(int cpu
, const cpumask_t
*cpu_map
,
6851 struct sched_group
**sg
,
6852 cpumask_t
*tmpmask
),
6853 cpumask_t
*covered
, cpumask_t
*tmpmask
)
6855 struct sched_group
*first
= NULL
, *last
= NULL
;
6858 cpus_clear(*covered
);
6860 for_each_cpu_mask(i
, *span
) {
6861 struct sched_group
*sg
;
6862 int group
= group_fn(i
, cpu_map
, &sg
, tmpmask
);
6865 if (cpu_isset(i
, *covered
))
6868 cpus_clear(sg
->cpumask
);
6869 sg
->__cpu_power
= 0;
6871 for_each_cpu_mask(j
, *span
) {
6872 if (group_fn(j
, cpu_map
, NULL
, tmpmask
) != group
)
6875 cpu_set(j
, *covered
);
6876 cpu_set(j
, sg
->cpumask
);
6887 #define SD_NODES_PER_DOMAIN 16
6892 * find_next_best_node - find the next node to include in a sched_domain
6893 * @node: node whose sched_domain we're building
6894 * @used_nodes: nodes already in the sched_domain
6896 * Find the next node to include in a given scheduling domain. Simply
6897 * finds the closest node not already in the @used_nodes map.
6899 * Should use nodemask_t.
6901 static int find_next_best_node(int node
, nodemask_t
*used_nodes
)
6903 int i
, n
, val
, min_val
, best_node
= 0;
6907 for (i
= 0; i
< MAX_NUMNODES
; i
++) {
6908 /* Start at @node */
6909 n
= (node
+ i
) % MAX_NUMNODES
;
6911 if (!nr_cpus_node(n
))
6914 /* Skip already used nodes */
6915 if (node_isset(n
, *used_nodes
))
6918 /* Simple min distance search */
6919 val
= node_distance(node
, n
);
6921 if (val
< min_val
) {
6927 node_set(best_node
, *used_nodes
);
6932 * sched_domain_node_span - get a cpumask for a node's sched_domain
6933 * @node: node whose cpumask we're constructing
6934 * @span: resulting cpumask
6936 * Given a node, construct a good cpumask for its sched_domain to span. It
6937 * should be one that prevents unnecessary balancing, but also spreads tasks
6940 static void sched_domain_node_span(int node
, cpumask_t
*span
)
6942 nodemask_t used_nodes
;
6943 node_to_cpumask_ptr(nodemask
, node
);
6947 nodes_clear(used_nodes
);
6949 cpus_or(*span
, *span
, *nodemask
);
6950 node_set(node
, used_nodes
);
6952 for (i
= 1; i
< SD_NODES_PER_DOMAIN
; i
++) {
6953 int next_node
= find_next_best_node(node
, &used_nodes
);
6955 node_to_cpumask_ptr_next(nodemask
, next_node
);
6956 cpus_or(*span
, *span
, *nodemask
);
6961 int sched_smt_power_savings
= 0, sched_mc_power_savings
= 0;
6964 * SMT sched-domains:
6966 #ifdef CONFIG_SCHED_SMT
6967 static DEFINE_PER_CPU(struct sched_domain
, cpu_domains
);
6968 static DEFINE_PER_CPU(struct sched_group
, sched_group_cpus
);
6971 cpu_to_cpu_group(int cpu
, const cpumask_t
*cpu_map
, struct sched_group
**sg
,
6975 *sg
= &per_cpu(sched_group_cpus
, cpu
);
6981 * multi-core sched-domains:
6983 #ifdef CONFIG_SCHED_MC
6984 static DEFINE_PER_CPU(struct sched_domain
, core_domains
);
6985 static DEFINE_PER_CPU(struct sched_group
, sched_group_core
);
6988 #if defined(CONFIG_SCHED_MC) && defined(CONFIG_SCHED_SMT)
6990 cpu_to_core_group(int cpu
, const cpumask_t
*cpu_map
, struct sched_group
**sg
,
6995 *mask
= per_cpu(cpu_sibling_map
, cpu
);
6996 cpus_and(*mask
, *mask
, *cpu_map
);
6997 group
= first_cpu(*mask
);
6999 *sg
= &per_cpu(sched_group_core
, group
);
7002 #elif defined(CONFIG_SCHED_MC)
7004 cpu_to_core_group(int cpu
, const cpumask_t
*cpu_map
, struct sched_group
**sg
,
7008 *sg
= &per_cpu(sched_group_core
, cpu
);
7013 static DEFINE_PER_CPU(struct sched_domain
, phys_domains
);
7014 static DEFINE_PER_CPU(struct sched_group
, sched_group_phys
);
7017 cpu_to_phys_group(int cpu
, const cpumask_t
*cpu_map
, struct sched_group
**sg
,
7021 #ifdef CONFIG_SCHED_MC
7022 *mask
= cpu_coregroup_map(cpu
);
7023 cpus_and(*mask
, *mask
, *cpu_map
);
7024 group
= first_cpu(*mask
);
7025 #elif defined(CONFIG_SCHED_SMT)
7026 *mask
= per_cpu(cpu_sibling_map
, cpu
);
7027 cpus_and(*mask
, *mask
, *cpu_map
);
7028 group
= first_cpu(*mask
);
7033 *sg
= &per_cpu(sched_group_phys
, group
);
7039 * The init_sched_build_groups can't handle what we want to do with node
7040 * groups, so roll our own. Now each node has its own list of groups which
7041 * gets dynamically allocated.
7043 static DEFINE_PER_CPU(struct sched_domain
, node_domains
);
7044 static struct sched_group
***sched_group_nodes_bycpu
;
7046 static DEFINE_PER_CPU(struct sched_domain
, allnodes_domains
);
7047 static DEFINE_PER_CPU(struct sched_group
, sched_group_allnodes
);
7049 static int cpu_to_allnodes_group(int cpu
, const cpumask_t
*cpu_map
,
7050 struct sched_group
**sg
, cpumask_t
*nodemask
)
7054 *nodemask
= node_to_cpumask(cpu_to_node(cpu
));
7055 cpus_and(*nodemask
, *nodemask
, *cpu_map
);
7056 group
= first_cpu(*nodemask
);
7059 *sg
= &per_cpu(sched_group_allnodes
, group
);
7063 static void init_numa_sched_groups_power(struct sched_group
*group_head
)
7065 struct sched_group
*sg
= group_head
;
7071 for_each_cpu_mask(j
, sg
->cpumask
) {
7072 struct sched_domain
*sd
;
7074 sd
= &per_cpu(phys_domains
, j
);
7075 if (j
!= first_cpu(sd
->groups
->cpumask
)) {
7077 * Only add "power" once for each
7083 sg_inc_cpu_power(sg
, sd
->groups
->__cpu_power
);
7086 } while (sg
!= group_head
);
7091 /* Free memory allocated for various sched_group structures */
7092 static void free_sched_groups(const cpumask_t
*cpu_map
, cpumask_t
*nodemask
)
7096 for_each_cpu_mask(cpu
, *cpu_map
) {
7097 struct sched_group
**sched_group_nodes
7098 = sched_group_nodes_bycpu
[cpu
];
7100 if (!sched_group_nodes
)
7103 for (i
= 0; i
< MAX_NUMNODES
; i
++) {
7104 struct sched_group
*oldsg
, *sg
= sched_group_nodes
[i
];
7106 *nodemask
= node_to_cpumask(i
);
7107 cpus_and(*nodemask
, *nodemask
, *cpu_map
);
7108 if (cpus_empty(*nodemask
))
7118 if (oldsg
!= sched_group_nodes
[i
])
7121 kfree(sched_group_nodes
);
7122 sched_group_nodes_bycpu
[cpu
] = NULL
;
7126 static void free_sched_groups(const cpumask_t
*cpu_map
, cpumask_t
*nodemask
)
7132 * Initialize sched groups cpu_power.
7134 * cpu_power indicates the capacity of sched group, which is used while
7135 * distributing the load between different sched groups in a sched domain.
7136 * Typically cpu_power for all the groups in a sched domain will be same unless
7137 * there are asymmetries in the topology. If there are asymmetries, group
7138 * having more cpu_power will pickup more load compared to the group having
7141 * cpu_power will be a multiple of SCHED_LOAD_SCALE. This multiple represents
7142 * the maximum number of tasks a group can handle in the presence of other idle
7143 * or lightly loaded groups in the same sched domain.
7145 static void init_sched_groups_power(int cpu
, struct sched_domain
*sd
)
7147 struct sched_domain
*child
;
7148 struct sched_group
*group
;
7150 WARN_ON(!sd
|| !sd
->groups
);
7152 if (cpu
!= first_cpu(sd
->groups
->cpumask
))
7157 sd
->groups
->__cpu_power
= 0;
7160 * For perf policy, if the groups in child domain share resources
7161 * (for example cores sharing some portions of the cache hierarchy
7162 * or SMT), then set this domain groups cpu_power such that each group
7163 * can handle only one task, when there are other idle groups in the
7164 * same sched domain.
7166 if (!child
|| (!(sd
->flags
& SD_POWERSAVINGS_BALANCE
) &&
7168 (SD_SHARE_CPUPOWER
| SD_SHARE_PKG_RESOURCES
)))) {
7169 sg_inc_cpu_power(sd
->groups
, SCHED_LOAD_SCALE
);
7174 * add cpu_power of each child group to this groups cpu_power
7176 group
= child
->groups
;
7178 sg_inc_cpu_power(sd
->groups
, group
->__cpu_power
);
7179 group
= group
->next
;
7180 } while (group
!= child
->groups
);
7184 * Initializers for schedule domains
7185 * Non-inlined to reduce accumulated stack pressure in build_sched_domains()
7188 #define SD_INIT(sd, type) sd_init_##type(sd)
7189 #define SD_INIT_FUNC(type) \
7190 static noinline void sd_init_##type(struct sched_domain *sd) \
7192 memset(sd, 0, sizeof(*sd)); \
7193 *sd = SD_##type##_INIT; \
7194 sd->level = SD_LV_##type; \
7199 SD_INIT_FUNC(ALLNODES
)
7202 #ifdef CONFIG_SCHED_SMT
7203 SD_INIT_FUNC(SIBLING
)
7205 #ifdef CONFIG_SCHED_MC
7210 * To minimize stack usage kmalloc room for cpumasks and share the
7211 * space as the usage in build_sched_domains() dictates. Used only
7212 * if the amount of space is significant.
7215 cpumask_t tmpmask
; /* make this one first */
7218 cpumask_t this_sibling_map
;
7219 cpumask_t this_core_map
;
7221 cpumask_t send_covered
;
7224 cpumask_t domainspan
;
7226 cpumask_t notcovered
;
7231 #define SCHED_CPUMASK_ALLOC 1
7232 #define SCHED_CPUMASK_FREE(v) kfree(v)
7233 #define SCHED_CPUMASK_DECLARE(v) struct allmasks *v
7235 #define SCHED_CPUMASK_ALLOC 0
7236 #define SCHED_CPUMASK_FREE(v)
7237 #define SCHED_CPUMASK_DECLARE(v) struct allmasks _v, *v = &_v
7240 #define SCHED_CPUMASK_VAR(v, a) cpumask_t *v = (cpumask_t *) \
7241 ((unsigned long)(a) + offsetof(struct allmasks, v))
7243 static int default_relax_domain_level
= -1;
7245 static int __init
setup_relax_domain_level(char *str
)
7247 default_relax_domain_level
= simple_strtoul(str
, NULL
, 0);
7250 __setup("relax_domain_level=", setup_relax_domain_level
);
7252 static void set_domain_attribute(struct sched_domain
*sd
,
7253 struct sched_domain_attr
*attr
)
7257 if (!attr
|| attr
->relax_domain_level
< 0) {
7258 if (default_relax_domain_level
< 0)
7261 request
= default_relax_domain_level
;
7263 request
= attr
->relax_domain_level
;
7264 if (request
< sd
->level
) {
7265 /* turn off idle balance on this domain */
7266 sd
->flags
&= ~(SD_WAKE_IDLE
|SD_BALANCE_NEWIDLE
);
7268 /* turn on idle balance on this domain */
7269 sd
->flags
|= (SD_WAKE_IDLE_FAR
|SD_BALANCE_NEWIDLE
);
7274 * Build sched domains for a given set of cpus and attach the sched domains
7275 * to the individual cpus
7277 static int __build_sched_domains(const cpumask_t
*cpu_map
,
7278 struct sched_domain_attr
*attr
)
7281 struct root_domain
*rd
;
7282 SCHED_CPUMASK_DECLARE(allmasks
);
7285 struct sched_group
**sched_group_nodes
= NULL
;
7286 int sd_allnodes
= 0;
7289 * Allocate the per-node list of sched groups
7291 sched_group_nodes
= kcalloc(MAX_NUMNODES
, sizeof(struct sched_group
*),
7293 if (!sched_group_nodes
) {
7294 printk(KERN_WARNING
"Can not alloc sched group node list\n");
7299 rd
= alloc_rootdomain();
7301 printk(KERN_WARNING
"Cannot alloc root domain\n");
7303 kfree(sched_group_nodes
);
7308 #if SCHED_CPUMASK_ALLOC
7309 /* get space for all scratch cpumask variables */
7310 allmasks
= kmalloc(sizeof(*allmasks
), GFP_KERNEL
);
7312 printk(KERN_WARNING
"Cannot alloc cpumask array\n");
7315 kfree(sched_group_nodes
);
7320 tmpmask
= (cpumask_t
*)allmasks
;
7324 sched_group_nodes_bycpu
[first_cpu(*cpu_map
)] = sched_group_nodes
;
7328 * Set up domains for cpus specified by the cpu_map.
7330 for_each_cpu_mask(i
, *cpu_map
) {
7331 struct sched_domain
*sd
= NULL
, *p
;
7332 SCHED_CPUMASK_VAR(nodemask
, allmasks
);
7334 *nodemask
= node_to_cpumask(cpu_to_node(i
));
7335 cpus_and(*nodemask
, *nodemask
, *cpu_map
);
7338 if (cpus_weight(*cpu_map
) >
7339 SD_NODES_PER_DOMAIN
*cpus_weight(*nodemask
)) {
7340 sd
= &per_cpu(allnodes_domains
, i
);
7341 SD_INIT(sd
, ALLNODES
);
7342 set_domain_attribute(sd
, attr
);
7343 sd
->span
= *cpu_map
;
7344 sd
->first_cpu
= first_cpu(sd
->span
);
7345 cpu_to_allnodes_group(i
, cpu_map
, &sd
->groups
, tmpmask
);
7351 sd
= &per_cpu(node_domains
, i
);
7353 set_domain_attribute(sd
, attr
);
7354 sched_domain_node_span(cpu_to_node(i
), &sd
->span
);
7355 sd
->first_cpu
= first_cpu(sd
->span
);
7359 cpus_and(sd
->span
, sd
->span
, *cpu_map
);
7363 sd
= &per_cpu(phys_domains
, i
);
7365 set_domain_attribute(sd
, attr
);
7366 sd
->span
= *nodemask
;
7367 sd
->first_cpu
= first_cpu(sd
->span
);
7371 cpu_to_phys_group(i
, cpu_map
, &sd
->groups
, tmpmask
);
7373 #ifdef CONFIG_SCHED_MC
7375 sd
= &per_cpu(core_domains
, i
);
7377 set_domain_attribute(sd
, attr
);
7378 sd
->span
= cpu_coregroup_map(i
);
7379 sd
->first_cpu
= first_cpu(sd
->span
);
7380 cpus_and(sd
->span
, sd
->span
, *cpu_map
);
7383 cpu_to_core_group(i
, cpu_map
, &sd
->groups
, tmpmask
);
7386 #ifdef CONFIG_SCHED_SMT
7388 sd
= &per_cpu(cpu_domains
, i
);
7389 SD_INIT(sd
, SIBLING
);
7390 set_domain_attribute(sd
, attr
);
7391 sd
->span
= per_cpu(cpu_sibling_map
, i
);
7392 sd
->first_cpu
= first_cpu(sd
->span
);
7393 cpus_and(sd
->span
, sd
->span
, *cpu_map
);
7396 cpu_to_cpu_group(i
, cpu_map
, &sd
->groups
, tmpmask
);
7400 #ifdef CONFIG_SCHED_SMT
7401 /* Set up CPU (sibling) groups */
7402 for_each_cpu_mask(i
, *cpu_map
) {
7403 SCHED_CPUMASK_VAR(this_sibling_map
, allmasks
);
7404 SCHED_CPUMASK_VAR(send_covered
, allmasks
);
7406 *this_sibling_map
= per_cpu(cpu_sibling_map
, i
);
7407 cpus_and(*this_sibling_map
, *this_sibling_map
, *cpu_map
);
7408 if (i
!= first_cpu(*this_sibling_map
))
7411 init_sched_build_groups(this_sibling_map
, cpu_map
,
7413 send_covered
, tmpmask
);
7417 #ifdef CONFIG_SCHED_MC
7418 /* Set up multi-core groups */
7419 for_each_cpu_mask(i
, *cpu_map
) {
7420 SCHED_CPUMASK_VAR(this_core_map
, allmasks
);
7421 SCHED_CPUMASK_VAR(send_covered
, allmasks
);
7423 *this_core_map
= cpu_coregroup_map(i
);
7424 cpus_and(*this_core_map
, *this_core_map
, *cpu_map
);
7425 if (i
!= first_cpu(*this_core_map
))
7428 init_sched_build_groups(this_core_map
, cpu_map
,
7430 send_covered
, tmpmask
);
7434 /* Set up physical groups */
7435 for (i
= 0; i
< MAX_NUMNODES
; i
++) {
7436 SCHED_CPUMASK_VAR(nodemask
, allmasks
);
7437 SCHED_CPUMASK_VAR(send_covered
, allmasks
);
7439 *nodemask
= node_to_cpumask(i
);
7440 cpus_and(*nodemask
, *nodemask
, *cpu_map
);
7441 if (cpus_empty(*nodemask
))
7444 init_sched_build_groups(nodemask
, cpu_map
,
7446 send_covered
, tmpmask
);
7450 /* Set up node groups */
7452 SCHED_CPUMASK_VAR(send_covered
, allmasks
);
7454 init_sched_build_groups(cpu_map
, cpu_map
,
7455 &cpu_to_allnodes_group
,
7456 send_covered
, tmpmask
);
7459 for (i
= 0; i
< MAX_NUMNODES
; i
++) {
7460 /* Set up node groups */
7461 struct sched_group
*sg
, *prev
;
7462 SCHED_CPUMASK_VAR(nodemask
, allmasks
);
7463 SCHED_CPUMASK_VAR(domainspan
, allmasks
);
7464 SCHED_CPUMASK_VAR(covered
, allmasks
);
7467 *nodemask
= node_to_cpumask(i
);
7468 cpus_clear(*covered
);
7470 cpus_and(*nodemask
, *nodemask
, *cpu_map
);
7471 if (cpus_empty(*nodemask
)) {
7472 sched_group_nodes
[i
] = NULL
;
7476 sched_domain_node_span(i
, domainspan
);
7477 cpus_and(*domainspan
, *domainspan
, *cpu_map
);
7479 sg
= kmalloc_node(sizeof(struct sched_group
), GFP_KERNEL
, i
);
7481 printk(KERN_WARNING
"Can not alloc domain group for "
7485 sched_group_nodes
[i
] = sg
;
7486 for_each_cpu_mask(j
, *nodemask
) {
7487 struct sched_domain
*sd
;
7489 sd
= &per_cpu(node_domains
, j
);
7492 sg
->__cpu_power
= 0;
7493 sg
->cpumask
= *nodemask
;
7495 cpus_or(*covered
, *covered
, *nodemask
);
7498 for (j
= 0; j
< MAX_NUMNODES
; j
++) {
7499 SCHED_CPUMASK_VAR(notcovered
, allmasks
);
7500 int n
= (i
+ j
) % MAX_NUMNODES
;
7501 node_to_cpumask_ptr(pnodemask
, n
);
7503 cpus_complement(*notcovered
, *covered
);
7504 cpus_and(*tmpmask
, *notcovered
, *cpu_map
);
7505 cpus_and(*tmpmask
, *tmpmask
, *domainspan
);
7506 if (cpus_empty(*tmpmask
))
7509 cpus_and(*tmpmask
, *tmpmask
, *pnodemask
);
7510 if (cpus_empty(*tmpmask
))
7513 sg
= kmalloc_node(sizeof(struct sched_group
),
7517 "Can not alloc domain group for node %d\n", j
);
7520 sg
->__cpu_power
= 0;
7521 sg
->cpumask
= *tmpmask
;
7522 sg
->next
= prev
->next
;
7523 cpus_or(*covered
, *covered
, *tmpmask
);
7530 /* Calculate CPU power for physical packages and nodes */
7531 #ifdef CONFIG_SCHED_SMT
7532 for_each_cpu_mask(i
, *cpu_map
) {
7533 struct sched_domain
*sd
= &per_cpu(cpu_domains
, i
);
7535 init_sched_groups_power(i
, sd
);
7538 #ifdef CONFIG_SCHED_MC
7539 for_each_cpu_mask(i
, *cpu_map
) {
7540 struct sched_domain
*sd
= &per_cpu(core_domains
, i
);
7542 init_sched_groups_power(i
, sd
);
7546 for_each_cpu_mask(i
, *cpu_map
) {
7547 struct sched_domain
*sd
= &per_cpu(phys_domains
, i
);
7549 init_sched_groups_power(i
, sd
);
7553 for (i
= 0; i
< MAX_NUMNODES
; i
++)
7554 init_numa_sched_groups_power(sched_group_nodes
[i
]);
7557 struct sched_group
*sg
;
7559 cpu_to_allnodes_group(first_cpu(*cpu_map
), cpu_map
, &sg
,
7561 init_numa_sched_groups_power(sg
);
7565 /* Attach the domains */
7566 for_each_cpu_mask(i
, *cpu_map
) {
7567 struct sched_domain
*sd
;
7568 #ifdef CONFIG_SCHED_SMT
7569 sd
= &per_cpu(cpu_domains
, i
);
7570 #elif defined(CONFIG_SCHED_MC)
7571 sd
= &per_cpu(core_domains
, i
);
7573 sd
= &per_cpu(phys_domains
, i
);
7575 cpu_attach_domain(sd
, rd
, i
);
7578 SCHED_CPUMASK_FREE((void *)allmasks
);
7583 free_sched_groups(cpu_map
, tmpmask
);
7584 SCHED_CPUMASK_FREE((void *)allmasks
);
7589 static int build_sched_domains(const cpumask_t
*cpu_map
)
7591 return __build_sched_domains(cpu_map
, NULL
);
7594 static cpumask_t
*doms_cur
; /* current sched domains */
7595 static int ndoms_cur
; /* number of sched domains in 'doms_cur' */
7596 static struct sched_domain_attr
*dattr_cur
; /* attribues of custom domains
7600 * Special case: If a kmalloc of a doms_cur partition (array of
7601 * cpumask_t) fails, then fallback to a single sched domain,
7602 * as determined by the single cpumask_t fallback_doms.
7604 static cpumask_t fallback_doms
;
7606 void __attribute__((weak
)) arch_update_cpu_topology(void)
7611 * Set up scheduler domains and groups. Callers must hold the hotplug lock.
7612 * For now this just excludes isolated cpus, but could be used to
7613 * exclude other special cases in the future.
7615 static int arch_init_sched_domains(const cpumask_t
*cpu_map
)
7619 arch_update_cpu_topology();
7621 doms_cur
= kmalloc(sizeof(cpumask_t
), GFP_KERNEL
);
7623 doms_cur
= &fallback_doms
;
7624 cpus_andnot(*doms_cur
, *cpu_map
, cpu_isolated_map
);
7626 err
= build_sched_domains(doms_cur
);
7627 register_sched_domain_sysctl();
7632 static void arch_destroy_sched_domains(const cpumask_t
*cpu_map
,
7635 free_sched_groups(cpu_map
, tmpmask
);
7639 * Detach sched domains from a group of cpus specified in cpu_map
7640 * These cpus will now be attached to the NULL domain
7642 static void detach_destroy_domains(const cpumask_t
*cpu_map
)
7647 unregister_sched_domain_sysctl();
7649 for_each_cpu_mask(i
, *cpu_map
)
7650 cpu_attach_domain(NULL
, &def_root_domain
, i
);
7651 synchronize_sched();
7652 arch_destroy_sched_domains(cpu_map
, &tmpmask
);
7655 /* handle null as "default" */
7656 static int dattrs_equal(struct sched_domain_attr
*cur
, int idx_cur
,
7657 struct sched_domain_attr
*new, int idx_new
)
7659 struct sched_domain_attr tmp
;
7666 return !memcmp(cur
? (cur
+ idx_cur
) : &tmp
,
7667 new ? (new + idx_new
) : &tmp
,
7668 sizeof(struct sched_domain_attr
));
7672 * Partition sched domains as specified by the 'ndoms_new'
7673 * cpumasks in the array doms_new[] of cpumasks. This compares
7674 * doms_new[] to the current sched domain partitioning, doms_cur[].
7675 * It destroys each deleted domain and builds each new domain.
7677 * 'doms_new' is an array of cpumask_t's of length 'ndoms_new'.
7678 * The masks don't intersect (don't overlap.) We should setup one
7679 * sched domain for each mask. CPUs not in any of the cpumasks will
7680 * not be load balanced. If the same cpumask appears both in the
7681 * current 'doms_cur' domains and in the new 'doms_new', we can leave
7684 * The passed in 'doms_new' should be kmalloc'd. This routine takes
7685 * ownership of it and will kfree it when done with it. If the caller
7686 * failed the kmalloc call, then it can pass in doms_new == NULL,
7687 * and partition_sched_domains() will fallback to the single partition
7690 * Call with hotplug lock held
7692 void partition_sched_domains(int ndoms_new
, cpumask_t
*doms_new
,
7693 struct sched_domain_attr
*dattr_new
)
7697 mutex_lock(&sched_domains_mutex
);
7699 /* always unregister in case we don't destroy any domains */
7700 unregister_sched_domain_sysctl();
7702 if (doms_new
== NULL
) {
7704 doms_new
= &fallback_doms
;
7705 cpus_andnot(doms_new
[0], cpu_online_map
, cpu_isolated_map
);
7709 /* Destroy deleted domains */
7710 for (i
= 0; i
< ndoms_cur
; i
++) {
7711 for (j
= 0; j
< ndoms_new
; j
++) {
7712 if (cpus_equal(doms_cur
[i
], doms_new
[j
])
7713 && dattrs_equal(dattr_cur
, i
, dattr_new
, j
))
7716 /* no match - a current sched domain not in new doms_new[] */
7717 detach_destroy_domains(doms_cur
+ i
);
7722 /* Build new domains */
7723 for (i
= 0; i
< ndoms_new
; i
++) {
7724 for (j
= 0; j
< ndoms_cur
; j
++) {
7725 if (cpus_equal(doms_new
[i
], doms_cur
[j
])
7726 && dattrs_equal(dattr_new
, i
, dattr_cur
, j
))
7729 /* no match - add a new doms_new */
7730 __build_sched_domains(doms_new
+ i
,
7731 dattr_new
? dattr_new
+ i
: NULL
);
7736 /* Remember the new sched domains */
7737 if (doms_cur
!= &fallback_doms
)
7739 kfree(dattr_cur
); /* kfree(NULL) is safe */
7740 doms_cur
= doms_new
;
7741 dattr_cur
= dattr_new
;
7742 ndoms_cur
= ndoms_new
;
7744 register_sched_domain_sysctl();
7746 mutex_unlock(&sched_domains_mutex
);
7749 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
7750 int arch_reinit_sched_domains(void)
7755 mutex_lock(&sched_domains_mutex
);
7756 detach_destroy_domains(&cpu_online_map
);
7757 err
= arch_init_sched_domains(&cpu_online_map
);
7758 mutex_unlock(&sched_domains_mutex
);
7764 static ssize_t
sched_power_savings_store(const char *buf
, size_t count
, int smt
)
7768 if (buf
[0] != '0' && buf
[0] != '1')
7772 sched_smt_power_savings
= (buf
[0] == '1');
7774 sched_mc_power_savings
= (buf
[0] == '1');
7776 ret
= arch_reinit_sched_domains();
7778 return ret
? ret
: count
;
7781 #ifdef CONFIG_SCHED_MC
7782 static ssize_t
sched_mc_power_savings_show(struct sys_device
*dev
, char *page
)
7784 return sprintf(page
, "%u\n", sched_mc_power_savings
);
7786 static ssize_t
sched_mc_power_savings_store(struct sys_device
*dev
,
7787 const char *buf
, size_t count
)
7789 return sched_power_savings_store(buf
, count
, 0);
7791 static SYSDEV_ATTR(sched_mc_power_savings
, 0644, sched_mc_power_savings_show
,
7792 sched_mc_power_savings_store
);
7795 #ifdef CONFIG_SCHED_SMT
7796 static ssize_t
sched_smt_power_savings_show(struct sys_device
*dev
, char *page
)
7798 return sprintf(page
, "%u\n", sched_smt_power_savings
);
7800 static ssize_t
sched_smt_power_savings_store(struct sys_device
*dev
,
7801 const char *buf
, size_t count
)
7803 return sched_power_savings_store(buf
, count
, 1);
7805 static SYSDEV_ATTR(sched_smt_power_savings
, 0644, sched_smt_power_savings_show
,
7806 sched_smt_power_savings_store
);
7809 int sched_create_sysfs_power_savings_entries(struct sysdev_class
*cls
)
7813 #ifdef CONFIG_SCHED_SMT
7815 err
= sysfs_create_file(&cls
->kset
.kobj
,
7816 &attr_sched_smt_power_savings
.attr
);
7818 #ifdef CONFIG_SCHED_MC
7819 if (!err
&& mc_capable())
7820 err
= sysfs_create_file(&cls
->kset
.kobj
,
7821 &attr_sched_mc_power_savings
.attr
);
7828 * Force a reinitialization of the sched domains hierarchy. The domains
7829 * and groups cannot be updated in place without racing with the balancing
7830 * code, so we temporarily attach all running cpus to the NULL domain
7831 * which will prevent rebalancing while the sched domains are recalculated.
7833 static int update_sched_domains(struct notifier_block
*nfb
,
7834 unsigned long action
, void *hcpu
)
7837 case CPU_UP_PREPARE
:
7838 case CPU_UP_PREPARE_FROZEN
:
7839 case CPU_DOWN_PREPARE
:
7840 case CPU_DOWN_PREPARE_FROZEN
:
7841 detach_destroy_domains(&cpu_online_map
);
7844 case CPU_UP_CANCELED
:
7845 case CPU_UP_CANCELED_FROZEN
:
7846 case CPU_DOWN_FAILED
:
7847 case CPU_DOWN_FAILED_FROZEN
:
7849 case CPU_ONLINE_FROZEN
:
7851 case CPU_DEAD_FROZEN
:
7853 * Fall through and re-initialise the domains.
7860 /* The hotplug lock is already held by cpu_up/cpu_down */
7861 arch_init_sched_domains(&cpu_online_map
);
7866 void __init
sched_init_smp(void)
7868 cpumask_t non_isolated_cpus
;
7870 #if defined(CONFIG_NUMA)
7871 sched_group_nodes_bycpu
= kzalloc(nr_cpu_ids
* sizeof(void **),
7873 BUG_ON(sched_group_nodes_bycpu
== NULL
);
7876 mutex_lock(&sched_domains_mutex
);
7877 arch_init_sched_domains(&cpu_online_map
);
7878 cpus_andnot(non_isolated_cpus
, cpu_possible_map
, cpu_isolated_map
);
7879 if (cpus_empty(non_isolated_cpus
))
7880 cpu_set(smp_processor_id(), non_isolated_cpus
);
7881 mutex_unlock(&sched_domains_mutex
);
7883 /* XXX: Theoretical race here - CPU may be hotplugged now */
7884 hotcpu_notifier(update_sched_domains
, 0);
7887 /* Move init over to a non-isolated CPU */
7888 if (set_cpus_allowed_ptr(current
, &non_isolated_cpus
) < 0)
7890 sched_init_granularity();
7893 void __init
sched_init_smp(void)
7895 sched_init_granularity();
7897 #endif /* CONFIG_SMP */
7899 int in_sched_functions(unsigned long addr
)
7901 return in_lock_functions(addr
) ||
7902 (addr
>= (unsigned long)__sched_text_start
7903 && addr
< (unsigned long)__sched_text_end
);
7906 static void init_cfs_rq(struct cfs_rq
*cfs_rq
, struct rq
*rq
)
7908 cfs_rq
->tasks_timeline
= RB_ROOT
;
7909 INIT_LIST_HEAD(&cfs_rq
->tasks
);
7910 #ifdef CONFIG_FAIR_GROUP_SCHED
7913 cfs_rq
->min_vruntime
= (u64
)(-(1LL << 20));
7916 static void init_rt_rq(struct rt_rq
*rt_rq
, struct rq
*rq
)
7918 struct rt_prio_array
*array
;
7921 array
= &rt_rq
->active
;
7922 for (i
= 0; i
< MAX_RT_PRIO
; i
++) {
7923 INIT_LIST_HEAD(array
->queue
+ i
);
7924 __clear_bit(i
, array
->bitmap
);
7926 /* delimiter for bitsearch: */
7927 __set_bit(MAX_RT_PRIO
, array
->bitmap
);
7929 #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED
7930 rt_rq
->highest_prio
= MAX_RT_PRIO
;
7933 rt_rq
->rt_nr_migratory
= 0;
7934 rt_rq
->overloaded
= 0;
7938 rt_rq
->rt_throttled
= 0;
7939 rt_rq
->rt_runtime
= 0;
7940 spin_lock_init(&rt_rq
->rt_runtime_lock
);
7942 #ifdef CONFIG_RT_GROUP_SCHED
7943 rt_rq
->rt_nr_boosted
= 0;
7948 #ifdef CONFIG_FAIR_GROUP_SCHED
7949 static void init_tg_cfs_entry(struct task_group
*tg
, struct cfs_rq
*cfs_rq
,
7950 struct sched_entity
*se
, int cpu
, int add
,
7951 struct sched_entity
*parent
)
7953 struct rq
*rq
= cpu_rq(cpu
);
7954 tg
->cfs_rq
[cpu
] = cfs_rq
;
7955 init_cfs_rq(cfs_rq
, rq
);
7958 list_add(&cfs_rq
->leaf_cfs_rq_list
, &rq
->leaf_cfs_rq_list
);
7961 /* se could be NULL for init_task_group */
7966 se
->cfs_rq
= &rq
->cfs
;
7968 se
->cfs_rq
= parent
->my_q
;
7971 se
->load
.weight
= tg
->shares
;
7972 se
->load
.inv_weight
= 0;
7973 se
->parent
= parent
;
7977 #ifdef CONFIG_RT_GROUP_SCHED
7978 static void init_tg_rt_entry(struct task_group
*tg
, struct rt_rq
*rt_rq
,
7979 struct sched_rt_entity
*rt_se
, int cpu
, int add
,
7980 struct sched_rt_entity
*parent
)
7982 struct rq
*rq
= cpu_rq(cpu
);
7984 tg
->rt_rq
[cpu
] = rt_rq
;
7985 init_rt_rq(rt_rq
, rq
);
7987 rt_rq
->rt_se
= rt_se
;
7988 rt_rq
->rt_runtime
= tg
->rt_bandwidth
.rt_runtime
;
7990 list_add(&rt_rq
->leaf_rt_rq_list
, &rq
->leaf_rt_rq_list
);
7992 tg
->rt_se
[cpu
] = rt_se
;
7997 rt_se
->rt_rq
= &rq
->rt
;
7999 rt_se
->rt_rq
= parent
->my_q
;
8001 rt_se
->rt_rq
= &rq
->rt
;
8002 rt_se
->my_q
= rt_rq
;
8003 rt_se
->parent
= parent
;
8004 INIT_LIST_HEAD(&rt_se
->run_list
);
8008 void __init
sched_init(void)
8011 unsigned long alloc_size
= 0, ptr
;
8013 #ifdef CONFIG_FAIR_GROUP_SCHED
8014 alloc_size
+= 2 * nr_cpu_ids
* sizeof(void **);
8016 #ifdef CONFIG_RT_GROUP_SCHED
8017 alloc_size
+= 2 * nr_cpu_ids
* sizeof(void **);
8019 #ifdef CONFIG_USER_SCHED
8023 * As sched_init() is called before page_alloc is setup,
8024 * we use alloc_bootmem().
8027 ptr
= (unsigned long)alloc_bootmem(alloc_size
);
8029 #ifdef CONFIG_FAIR_GROUP_SCHED
8030 init_task_group
.se
= (struct sched_entity
**)ptr
;
8031 ptr
+= nr_cpu_ids
* sizeof(void **);
8033 init_task_group
.cfs_rq
= (struct cfs_rq
**)ptr
;
8034 ptr
+= nr_cpu_ids
* sizeof(void **);
8036 #ifdef CONFIG_USER_SCHED
8037 root_task_group
.se
= (struct sched_entity
**)ptr
;
8038 ptr
+= nr_cpu_ids
* sizeof(void **);
8040 root_task_group
.cfs_rq
= (struct cfs_rq
**)ptr
;
8041 ptr
+= nr_cpu_ids
* sizeof(void **);
8044 #ifdef CONFIG_RT_GROUP_SCHED
8045 init_task_group
.rt_se
= (struct sched_rt_entity
**)ptr
;
8046 ptr
+= nr_cpu_ids
* sizeof(void **);
8048 init_task_group
.rt_rq
= (struct rt_rq
**)ptr
;
8049 ptr
+= nr_cpu_ids
* sizeof(void **);
8051 #ifdef CONFIG_USER_SCHED
8052 root_task_group
.rt_se
= (struct sched_rt_entity
**)ptr
;
8053 ptr
+= nr_cpu_ids
* sizeof(void **);
8055 root_task_group
.rt_rq
= (struct rt_rq
**)ptr
;
8056 ptr
+= nr_cpu_ids
* sizeof(void **);
8063 init_defrootdomain();
8066 init_rt_bandwidth(&def_rt_bandwidth
,
8067 global_rt_period(), global_rt_runtime());
8069 #ifdef CONFIG_RT_GROUP_SCHED
8070 init_rt_bandwidth(&init_task_group
.rt_bandwidth
,
8071 global_rt_period(), global_rt_runtime());
8072 #ifdef CONFIG_USER_SCHED
8073 init_rt_bandwidth(&root_task_group
.rt_bandwidth
,
8074 global_rt_period(), RUNTIME_INF
);
8078 #ifdef CONFIG_GROUP_SCHED
8079 list_add(&init_task_group
.list
, &task_groups
);
8080 INIT_LIST_HEAD(&init_task_group
.children
);
8082 #ifdef CONFIG_USER_SCHED
8083 INIT_LIST_HEAD(&root_task_group
.children
);
8084 init_task_group
.parent
= &root_task_group
;
8085 list_add(&init_task_group
.siblings
, &root_task_group
.children
);
8089 for_each_possible_cpu(i
) {
8093 spin_lock_init(&rq
->lock
);
8094 lockdep_set_class(&rq
->lock
, &rq
->rq_lock_key
);
8096 init_cfs_rq(&rq
->cfs
, rq
);
8097 init_rt_rq(&rq
->rt
, rq
);
8098 #ifdef CONFIG_FAIR_GROUP_SCHED
8099 init_task_group
.shares
= init_task_group_load
;
8100 INIT_LIST_HEAD(&rq
->leaf_cfs_rq_list
);
8101 #ifdef CONFIG_CGROUP_SCHED
8103 * How much cpu bandwidth does init_task_group get?
8105 * In case of task-groups formed thr' the cgroup filesystem, it
8106 * gets 100% of the cpu resources in the system. This overall
8107 * system cpu resource is divided among the tasks of
8108 * init_task_group and its child task-groups in a fair manner,
8109 * based on each entity's (task or task-group's) weight
8110 * (se->load.weight).
8112 * In other words, if init_task_group has 10 tasks of weight
8113 * 1024) and two child groups A0 and A1 (of weight 1024 each),
8114 * then A0's share of the cpu resource is:
8116 * A0's bandwidth = 1024 / (10*1024 + 1024 + 1024) = 8.33%
8118 * We achieve this by letting init_task_group's tasks sit
8119 * directly in rq->cfs (i.e init_task_group->se[] = NULL).
8121 init_tg_cfs_entry(&init_task_group
, &rq
->cfs
, NULL
, i
, 1, NULL
);
8122 #elif defined CONFIG_USER_SCHED
8123 root_task_group
.shares
= NICE_0_LOAD
;
8124 init_tg_cfs_entry(&root_task_group
, &rq
->cfs
, NULL
, i
, 0, NULL
);
8126 * In case of task-groups formed thr' the user id of tasks,
8127 * init_task_group represents tasks belonging to root user.
8128 * Hence it forms a sibling of all subsequent groups formed.
8129 * In this case, init_task_group gets only a fraction of overall
8130 * system cpu resource, based on the weight assigned to root
8131 * user's cpu share (INIT_TASK_GROUP_LOAD). This is accomplished
8132 * by letting tasks of init_task_group sit in a separate cfs_rq
8133 * (init_cfs_rq) and having one entity represent this group of
8134 * tasks in rq->cfs (i.e init_task_group->se[] != NULL).
8136 init_tg_cfs_entry(&init_task_group
,
8137 &per_cpu(init_cfs_rq
, i
),
8138 &per_cpu(init_sched_entity
, i
), i
, 1,
8139 root_task_group
.se
[i
]);
8142 #endif /* CONFIG_FAIR_GROUP_SCHED */
8144 rq
->rt
.rt_runtime
= def_rt_bandwidth
.rt_runtime
;
8145 #ifdef CONFIG_RT_GROUP_SCHED
8146 INIT_LIST_HEAD(&rq
->leaf_rt_rq_list
);
8147 #ifdef CONFIG_CGROUP_SCHED
8148 init_tg_rt_entry(&init_task_group
, &rq
->rt
, NULL
, i
, 1, NULL
);
8149 #elif defined CONFIG_USER_SCHED
8150 init_tg_rt_entry(&root_task_group
, &rq
->rt
, NULL
, i
, 0, NULL
);
8151 init_tg_rt_entry(&init_task_group
,
8152 &per_cpu(init_rt_rq
, i
),
8153 &per_cpu(init_sched_rt_entity
, i
), i
, 1,
8154 root_task_group
.rt_se
[i
]);
8158 for (j
= 0; j
< CPU_LOAD_IDX_MAX
; j
++)
8159 rq
->cpu_load
[j
] = 0;
8163 rq
->active_balance
= 0;
8164 rq
->next_balance
= jiffies
;
8167 rq
->migration_thread
= NULL
;
8168 INIT_LIST_HEAD(&rq
->migration_queue
);
8169 rq_attach_root(rq
, &def_root_domain
);
8172 atomic_set(&rq
->nr_iowait
, 0);
8175 set_load_weight(&init_task
);
8177 #ifdef CONFIG_PREEMPT_NOTIFIERS
8178 INIT_HLIST_HEAD(&init_task
.preempt_notifiers
);
8182 open_softirq(SCHED_SOFTIRQ
, run_rebalance_domains
, NULL
);
8185 #ifdef CONFIG_RT_MUTEXES
8186 plist_head_init(&init_task
.pi_waiters
, &init_task
.pi_lock
);
8190 * The boot idle thread does lazy MMU switching as well:
8192 atomic_inc(&init_mm
.mm_count
);
8193 enter_lazy_tlb(&init_mm
, current
);
8196 * Make us the idle thread. Technically, schedule() should not be
8197 * called from this thread, however somewhere below it might be,
8198 * but because we are the idle thread, we just pick up running again
8199 * when this runqueue becomes "idle".
8201 init_idle(current
, smp_processor_id());
8203 * During early bootup we pretend to be a normal task:
8205 current
->sched_class
= &fair_sched_class
;
8207 scheduler_running
= 1;
8210 #ifdef CONFIG_DEBUG_SPINLOCK_SLEEP
8211 void __might_sleep(char *file
, int line
)
8214 static unsigned long prev_jiffy
; /* ratelimiting */
8216 if ((in_atomic() || irqs_disabled()) &&
8217 system_state
== SYSTEM_RUNNING
&& !oops_in_progress
) {
8218 if (time_before(jiffies
, prev_jiffy
+ HZ
) && prev_jiffy
)
8220 prev_jiffy
= jiffies
;
8221 printk(KERN_ERR
"BUG: sleeping function called from invalid"
8222 " context at %s:%d\n", file
, line
);
8223 printk("in_atomic():%d, irqs_disabled():%d\n",
8224 in_atomic(), irqs_disabled());
8225 debug_show_held_locks(current
);
8226 if (irqs_disabled())
8227 print_irqtrace_events(current
);
8232 EXPORT_SYMBOL(__might_sleep
);
8235 #ifdef CONFIG_MAGIC_SYSRQ
8236 static void normalize_task(struct rq
*rq
, struct task_struct
*p
)
8240 update_rq_clock(rq
);
8241 on_rq
= p
->se
.on_rq
;
8243 deactivate_task(rq
, p
, 0);
8244 __setscheduler(rq
, p
, SCHED_NORMAL
, 0);
8246 activate_task(rq
, p
, 0);
8247 resched_task(rq
->curr
);
8251 void normalize_rt_tasks(void)
8253 struct task_struct
*g
, *p
;
8254 unsigned long flags
;
8257 read_lock_irqsave(&tasklist_lock
, flags
);
8258 do_each_thread(g
, p
) {
8260 * Only normalize user tasks:
8265 p
->se
.exec_start
= 0;
8266 #ifdef CONFIG_SCHEDSTATS
8267 p
->se
.wait_start
= 0;
8268 p
->se
.sleep_start
= 0;
8269 p
->se
.block_start
= 0;
8274 * Renice negative nice level userspace
8277 if (TASK_NICE(p
) < 0 && p
->mm
)
8278 set_user_nice(p
, 0);
8282 spin_lock(&p
->pi_lock
);
8283 rq
= __task_rq_lock(p
);
8285 normalize_task(rq
, p
);
8287 __task_rq_unlock(rq
);
8288 spin_unlock(&p
->pi_lock
);
8289 } while_each_thread(g
, p
);
8291 read_unlock_irqrestore(&tasklist_lock
, flags
);
8294 #endif /* CONFIG_MAGIC_SYSRQ */
8298 * These functions are only useful for the IA64 MCA handling.
8300 * They can only be called when the whole system has been
8301 * stopped - every CPU needs to be quiescent, and no scheduling
8302 * activity can take place. Using them for anything else would
8303 * be a serious bug, and as a result, they aren't even visible
8304 * under any other configuration.
8308 * curr_task - return the current task for a given cpu.
8309 * @cpu: the processor in question.
8311 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
8313 struct task_struct
*curr_task(int cpu
)
8315 return cpu_curr(cpu
);
8319 * set_curr_task - set the current task for a given cpu.
8320 * @cpu: the processor in question.
8321 * @p: the task pointer to set.
8323 * Description: This function must only be used when non-maskable interrupts
8324 * are serviced on a separate stack. It allows the architecture to switch the
8325 * notion of the current task on a cpu in a non-blocking manner. This function
8326 * must be called with all CPU's synchronized, and interrupts disabled, the
8327 * and caller must save the original value of the current task (see
8328 * curr_task() above) and restore that value before reenabling interrupts and
8329 * re-starting the system.
8331 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
8333 void set_curr_task(int cpu
, struct task_struct
*p
)
8340 #ifdef CONFIG_FAIR_GROUP_SCHED
8341 static void free_fair_sched_group(struct task_group
*tg
)
8345 for_each_possible_cpu(i
) {
8347 kfree(tg
->cfs_rq
[i
]);
8357 int alloc_fair_sched_group(struct task_group
*tg
, struct task_group
*parent
)
8359 struct cfs_rq
*cfs_rq
;
8360 struct sched_entity
*se
, *parent_se
;
8364 tg
->cfs_rq
= kzalloc(sizeof(cfs_rq
) * nr_cpu_ids
, GFP_KERNEL
);
8367 tg
->se
= kzalloc(sizeof(se
) * nr_cpu_ids
, GFP_KERNEL
);
8371 tg
->shares
= NICE_0_LOAD
;
8373 for_each_possible_cpu(i
) {
8376 cfs_rq
= kmalloc_node(sizeof(struct cfs_rq
),
8377 GFP_KERNEL
|__GFP_ZERO
, cpu_to_node(i
));
8381 se
= kmalloc_node(sizeof(struct sched_entity
),
8382 GFP_KERNEL
|__GFP_ZERO
, cpu_to_node(i
));
8386 parent_se
= parent
? parent
->se
[i
] : NULL
;
8387 init_tg_cfs_entry(tg
, cfs_rq
, se
, i
, 0, parent_se
);
8396 static inline void register_fair_sched_group(struct task_group
*tg
, int cpu
)
8398 list_add_rcu(&tg
->cfs_rq
[cpu
]->leaf_cfs_rq_list
,
8399 &cpu_rq(cpu
)->leaf_cfs_rq_list
);
8402 static inline void unregister_fair_sched_group(struct task_group
*tg
, int cpu
)
8404 list_del_rcu(&tg
->cfs_rq
[cpu
]->leaf_cfs_rq_list
);
8407 static inline void free_fair_sched_group(struct task_group
*tg
)
8412 int alloc_fair_sched_group(struct task_group
*tg
, struct task_group
*parent
)
8417 static inline void register_fair_sched_group(struct task_group
*tg
, int cpu
)
8421 static inline void unregister_fair_sched_group(struct task_group
*tg
, int cpu
)
8426 #ifdef CONFIG_RT_GROUP_SCHED
8427 static void free_rt_sched_group(struct task_group
*tg
)
8431 destroy_rt_bandwidth(&tg
->rt_bandwidth
);
8433 for_each_possible_cpu(i
) {
8435 kfree(tg
->rt_rq
[i
]);
8437 kfree(tg
->rt_se
[i
]);
8445 int alloc_rt_sched_group(struct task_group
*tg
, struct task_group
*parent
)
8447 struct rt_rq
*rt_rq
;
8448 struct sched_rt_entity
*rt_se
, *parent_se
;
8452 tg
->rt_rq
= kzalloc(sizeof(rt_rq
) * nr_cpu_ids
, GFP_KERNEL
);
8455 tg
->rt_se
= kzalloc(sizeof(rt_se
) * nr_cpu_ids
, GFP_KERNEL
);
8459 init_rt_bandwidth(&tg
->rt_bandwidth
,
8460 ktime_to_ns(def_rt_bandwidth
.rt_period
), 0);
8462 for_each_possible_cpu(i
) {
8465 rt_rq
= kmalloc_node(sizeof(struct rt_rq
),
8466 GFP_KERNEL
|__GFP_ZERO
, cpu_to_node(i
));
8470 rt_se
= kmalloc_node(sizeof(struct sched_rt_entity
),
8471 GFP_KERNEL
|__GFP_ZERO
, cpu_to_node(i
));
8475 parent_se
= parent
? parent
->rt_se
[i
] : NULL
;
8476 init_tg_rt_entry(tg
, rt_rq
, rt_se
, i
, 0, parent_se
);
8485 static inline void register_rt_sched_group(struct task_group
*tg
, int cpu
)
8487 list_add_rcu(&tg
->rt_rq
[cpu
]->leaf_rt_rq_list
,
8488 &cpu_rq(cpu
)->leaf_rt_rq_list
);
8491 static inline void unregister_rt_sched_group(struct task_group
*tg
, int cpu
)
8493 list_del_rcu(&tg
->rt_rq
[cpu
]->leaf_rt_rq_list
);
8496 static inline void free_rt_sched_group(struct task_group
*tg
)
8501 int alloc_rt_sched_group(struct task_group
*tg
, struct task_group
*parent
)
8506 static inline void register_rt_sched_group(struct task_group
*tg
, int cpu
)
8510 static inline void unregister_rt_sched_group(struct task_group
*tg
, int cpu
)
8515 #ifdef CONFIG_GROUP_SCHED
8516 static void free_sched_group(struct task_group
*tg
)
8518 free_fair_sched_group(tg
);
8519 free_rt_sched_group(tg
);
8523 /* allocate runqueue etc for a new task group */
8524 struct task_group
*sched_create_group(struct task_group
*parent
)
8526 struct task_group
*tg
;
8527 unsigned long flags
;
8530 tg
= kzalloc(sizeof(*tg
), GFP_KERNEL
);
8532 return ERR_PTR(-ENOMEM
);
8534 if (!alloc_fair_sched_group(tg
, parent
))
8537 if (!alloc_rt_sched_group(tg
, parent
))
8540 spin_lock_irqsave(&task_group_lock
, flags
);
8541 for_each_possible_cpu(i
) {
8542 register_fair_sched_group(tg
, i
);
8543 register_rt_sched_group(tg
, i
);
8545 list_add_rcu(&tg
->list
, &task_groups
);
8547 WARN_ON(!parent
); /* root should already exist */
8549 tg
->parent
= parent
;
8550 list_add_rcu(&tg
->siblings
, &parent
->children
);
8551 INIT_LIST_HEAD(&tg
->children
);
8552 spin_unlock_irqrestore(&task_group_lock
, flags
);
8557 free_sched_group(tg
);
8558 return ERR_PTR(-ENOMEM
);
8561 /* rcu callback to free various structures associated with a task group */
8562 static void free_sched_group_rcu(struct rcu_head
*rhp
)
8564 /* now it should be safe to free those cfs_rqs */
8565 free_sched_group(container_of(rhp
, struct task_group
, rcu
));
8568 /* Destroy runqueue etc associated with a task group */
8569 void sched_destroy_group(struct task_group
*tg
)
8571 unsigned long flags
;
8574 spin_lock_irqsave(&task_group_lock
, flags
);
8575 for_each_possible_cpu(i
) {
8576 unregister_fair_sched_group(tg
, i
);
8577 unregister_rt_sched_group(tg
, i
);
8579 list_del_rcu(&tg
->list
);
8580 list_del_rcu(&tg
->siblings
);
8581 spin_unlock_irqrestore(&task_group_lock
, flags
);
8583 /* wait for possible concurrent references to cfs_rqs complete */
8584 call_rcu(&tg
->rcu
, free_sched_group_rcu
);
8587 /* change task's runqueue when it moves between groups.
8588 * The caller of this function should have put the task in its new group
8589 * by now. This function just updates tsk->se.cfs_rq and tsk->se.parent to
8590 * reflect its new group.
8592 void sched_move_task(struct task_struct
*tsk
)
8595 unsigned long flags
;
8598 rq
= task_rq_lock(tsk
, &flags
);
8600 update_rq_clock(rq
);
8602 running
= task_current(rq
, tsk
);
8603 on_rq
= tsk
->se
.on_rq
;
8606 dequeue_task(rq
, tsk
, 0);
8607 if (unlikely(running
))
8608 tsk
->sched_class
->put_prev_task(rq
, tsk
);
8610 set_task_rq(tsk
, task_cpu(tsk
));
8612 #ifdef CONFIG_FAIR_GROUP_SCHED
8613 if (tsk
->sched_class
->moved_group
)
8614 tsk
->sched_class
->moved_group(tsk
);
8617 if (unlikely(running
))
8618 tsk
->sched_class
->set_curr_task(rq
);
8620 enqueue_task(rq
, tsk
, 0);
8622 task_rq_unlock(rq
, &flags
);
8626 #ifdef CONFIG_FAIR_GROUP_SCHED
8627 static void __set_se_shares(struct sched_entity
*se
, unsigned long shares
)
8629 struct cfs_rq
*cfs_rq
= se
->cfs_rq
;
8634 dequeue_entity(cfs_rq
, se
, 0);
8636 se
->load
.weight
= shares
;
8637 se
->load
.inv_weight
= 0;
8640 enqueue_entity(cfs_rq
, se
, 0);
8643 static void set_se_shares(struct sched_entity
*se
, unsigned long shares
)
8645 struct cfs_rq
*cfs_rq
= se
->cfs_rq
;
8646 struct rq
*rq
= cfs_rq
->rq
;
8647 unsigned long flags
;
8649 spin_lock_irqsave(&rq
->lock
, flags
);
8650 __set_se_shares(se
, shares
);
8651 spin_unlock_irqrestore(&rq
->lock
, flags
);
8654 static DEFINE_MUTEX(shares_mutex
);
8656 int sched_group_set_shares(struct task_group
*tg
, unsigned long shares
)
8659 unsigned long flags
;
8662 * We can't change the weight of the root cgroup.
8667 if (shares
< MIN_SHARES
)
8668 shares
= MIN_SHARES
;
8669 else if (shares
> MAX_SHARES
)
8670 shares
= MAX_SHARES
;
8672 mutex_lock(&shares_mutex
);
8673 if (tg
->shares
== shares
)
8676 spin_lock_irqsave(&task_group_lock
, flags
);
8677 for_each_possible_cpu(i
)
8678 unregister_fair_sched_group(tg
, i
);
8679 list_del_rcu(&tg
->siblings
);
8680 spin_unlock_irqrestore(&task_group_lock
, flags
);
8682 /* wait for any ongoing reference to this group to finish */
8683 synchronize_sched();
8686 * Now we are free to modify the group's share on each cpu
8687 * w/o tripping rebalance_share or load_balance_fair.
8689 tg
->shares
= shares
;
8690 for_each_possible_cpu(i
) {
8694 cfs_rq_set_shares(tg
->cfs_rq
[i
], 0);
8695 set_se_shares(tg
->se
[i
], shares
);
8699 * Enable load balance activity on this group, by inserting it back on
8700 * each cpu's rq->leaf_cfs_rq_list.
8702 spin_lock_irqsave(&task_group_lock
, flags
);
8703 for_each_possible_cpu(i
)
8704 register_fair_sched_group(tg
, i
);
8705 list_add_rcu(&tg
->siblings
, &tg
->parent
->children
);
8706 spin_unlock_irqrestore(&task_group_lock
, flags
);
8708 mutex_unlock(&shares_mutex
);
8712 unsigned long sched_group_shares(struct task_group
*tg
)
8718 #ifdef CONFIG_RT_GROUP_SCHED
8720 * Ensure that the real time constraints are schedulable.
8722 static DEFINE_MUTEX(rt_constraints_mutex
);
8724 static unsigned long to_ratio(u64 period
, u64 runtime
)
8726 if (runtime
== RUNTIME_INF
)
8729 return div64_u64(runtime
<< 16, period
);
8732 #ifdef CONFIG_CGROUP_SCHED
8733 static int __rt_schedulable(struct task_group
*tg
, u64 period
, u64 runtime
)
8735 struct task_group
*tgi
, *parent
= tg
->parent
;
8736 unsigned long total
= 0;
8739 if (global_rt_period() < period
)
8742 return to_ratio(period
, runtime
) <
8743 to_ratio(global_rt_period(), global_rt_runtime());
8746 if (ktime_to_ns(parent
->rt_bandwidth
.rt_period
) < period
)
8750 list_for_each_entry_rcu(tgi
, &parent
->children
, siblings
) {
8754 total
+= to_ratio(ktime_to_ns(tgi
->rt_bandwidth
.rt_period
),
8755 tgi
->rt_bandwidth
.rt_runtime
);
8759 return total
+ to_ratio(period
, runtime
) <
8760 to_ratio(ktime_to_ns(parent
->rt_bandwidth
.rt_period
),
8761 parent
->rt_bandwidth
.rt_runtime
);
8763 #elif defined CONFIG_USER_SCHED
8764 static int __rt_schedulable(struct task_group
*tg
, u64 period
, u64 runtime
)
8766 struct task_group
*tgi
;
8767 unsigned long total
= 0;
8768 unsigned long global_ratio
=
8769 to_ratio(global_rt_period(), global_rt_runtime());
8772 list_for_each_entry_rcu(tgi
, &task_groups
, list
) {
8776 total
+= to_ratio(ktime_to_ns(tgi
->rt_bandwidth
.rt_period
),
8777 tgi
->rt_bandwidth
.rt_runtime
);
8781 return total
+ to_ratio(period
, runtime
) < global_ratio
;
8785 /* Must be called with tasklist_lock held */
8786 static inline int tg_has_rt_tasks(struct task_group
*tg
)
8788 struct task_struct
*g
, *p
;
8789 do_each_thread(g
, p
) {
8790 if (rt_task(p
) && rt_rq_of_se(&p
->rt
)->tg
== tg
)
8792 } while_each_thread(g
, p
);
8796 static int tg_set_bandwidth(struct task_group
*tg
,
8797 u64 rt_period
, u64 rt_runtime
)
8801 mutex_lock(&rt_constraints_mutex
);
8802 read_lock(&tasklist_lock
);
8803 if (rt_runtime
== 0 && tg_has_rt_tasks(tg
)) {
8807 if (!__rt_schedulable(tg
, rt_period
, rt_runtime
)) {
8812 spin_lock_irq(&tg
->rt_bandwidth
.rt_runtime_lock
);
8813 tg
->rt_bandwidth
.rt_period
= ns_to_ktime(rt_period
);
8814 tg
->rt_bandwidth
.rt_runtime
= rt_runtime
;
8816 for_each_possible_cpu(i
) {
8817 struct rt_rq
*rt_rq
= tg
->rt_rq
[i
];
8819 spin_lock(&rt_rq
->rt_runtime_lock
);
8820 rt_rq
->rt_runtime
= rt_runtime
;
8821 spin_unlock(&rt_rq
->rt_runtime_lock
);
8823 spin_unlock_irq(&tg
->rt_bandwidth
.rt_runtime_lock
);
8825 read_unlock(&tasklist_lock
);
8826 mutex_unlock(&rt_constraints_mutex
);
8831 int sched_group_set_rt_runtime(struct task_group
*tg
, long rt_runtime_us
)
8833 u64 rt_runtime
, rt_period
;
8835 rt_period
= ktime_to_ns(tg
->rt_bandwidth
.rt_period
);
8836 rt_runtime
= (u64
)rt_runtime_us
* NSEC_PER_USEC
;
8837 if (rt_runtime_us
< 0)
8838 rt_runtime
= RUNTIME_INF
;
8840 return tg_set_bandwidth(tg
, rt_period
, rt_runtime
);
8843 long sched_group_rt_runtime(struct task_group
*tg
)
8847 if (tg
->rt_bandwidth
.rt_runtime
== RUNTIME_INF
)
8850 rt_runtime_us
= tg
->rt_bandwidth
.rt_runtime
;
8851 do_div(rt_runtime_us
, NSEC_PER_USEC
);
8852 return rt_runtime_us
;
8855 int sched_group_set_rt_period(struct task_group
*tg
, long rt_period_us
)
8857 u64 rt_runtime
, rt_period
;
8859 rt_period
= (u64
)rt_period_us
* NSEC_PER_USEC
;
8860 rt_runtime
= tg
->rt_bandwidth
.rt_runtime
;
8862 return tg_set_bandwidth(tg
, rt_period
, rt_runtime
);
8865 long sched_group_rt_period(struct task_group
*tg
)
8869 rt_period_us
= ktime_to_ns(tg
->rt_bandwidth
.rt_period
);
8870 do_div(rt_period_us
, NSEC_PER_USEC
);
8871 return rt_period_us
;
8874 static int sched_rt_global_constraints(void)
8878 mutex_lock(&rt_constraints_mutex
);
8879 if (!__rt_schedulable(NULL
, 1, 0))
8881 mutex_unlock(&rt_constraints_mutex
);
8886 static int sched_rt_global_constraints(void)
8888 unsigned long flags
;
8891 spin_lock_irqsave(&def_rt_bandwidth
.rt_runtime_lock
, flags
);
8892 for_each_possible_cpu(i
) {
8893 struct rt_rq
*rt_rq
= &cpu_rq(i
)->rt
;
8895 spin_lock(&rt_rq
->rt_runtime_lock
);
8896 rt_rq
->rt_runtime
= global_rt_runtime();
8897 spin_unlock(&rt_rq
->rt_runtime_lock
);
8899 spin_unlock_irqrestore(&def_rt_bandwidth
.rt_runtime_lock
, flags
);
8905 int sched_rt_handler(struct ctl_table
*table
, int write
,
8906 struct file
*filp
, void __user
*buffer
, size_t *lenp
,
8910 int old_period
, old_runtime
;
8911 static DEFINE_MUTEX(mutex
);
8914 old_period
= sysctl_sched_rt_period
;
8915 old_runtime
= sysctl_sched_rt_runtime
;
8917 ret
= proc_dointvec(table
, write
, filp
, buffer
, lenp
, ppos
);
8919 if (!ret
&& write
) {
8920 ret
= sched_rt_global_constraints();
8922 sysctl_sched_rt_period
= old_period
;
8923 sysctl_sched_rt_runtime
= old_runtime
;
8925 def_rt_bandwidth
.rt_runtime
= global_rt_runtime();
8926 def_rt_bandwidth
.rt_period
=
8927 ns_to_ktime(global_rt_period());
8930 mutex_unlock(&mutex
);
8935 #ifdef CONFIG_CGROUP_SCHED
8937 /* return corresponding task_group object of a cgroup */
8938 static inline struct task_group
*cgroup_tg(struct cgroup
*cgrp
)
8940 return container_of(cgroup_subsys_state(cgrp
, cpu_cgroup_subsys_id
),
8941 struct task_group
, css
);
8944 static struct cgroup_subsys_state
*
8945 cpu_cgroup_create(struct cgroup_subsys
*ss
, struct cgroup
*cgrp
)
8947 struct task_group
*tg
, *parent
;
8949 if (!cgrp
->parent
) {
8950 /* This is early initialization for the top cgroup */
8951 init_task_group
.css
.cgroup
= cgrp
;
8952 return &init_task_group
.css
;
8955 parent
= cgroup_tg(cgrp
->parent
);
8956 tg
= sched_create_group(parent
);
8958 return ERR_PTR(-ENOMEM
);
8960 /* Bind the cgroup to task_group object we just created */
8961 tg
->css
.cgroup
= cgrp
;
8967 cpu_cgroup_destroy(struct cgroup_subsys
*ss
, struct cgroup
*cgrp
)
8969 struct task_group
*tg
= cgroup_tg(cgrp
);
8971 sched_destroy_group(tg
);
8975 cpu_cgroup_can_attach(struct cgroup_subsys
*ss
, struct cgroup
*cgrp
,
8976 struct task_struct
*tsk
)
8978 #ifdef CONFIG_RT_GROUP_SCHED
8979 /* Don't accept realtime tasks when there is no way for them to run */
8980 if (rt_task(tsk
) && cgroup_tg(cgrp
)->rt_bandwidth
.rt_runtime
== 0)
8983 /* We don't support RT-tasks being in separate groups */
8984 if (tsk
->sched_class
!= &fair_sched_class
)
8992 cpu_cgroup_attach(struct cgroup_subsys
*ss
, struct cgroup
*cgrp
,
8993 struct cgroup
*old_cont
, struct task_struct
*tsk
)
8995 sched_move_task(tsk
);
8998 #ifdef CONFIG_FAIR_GROUP_SCHED
8999 static int cpu_shares_write_u64(struct cgroup
*cgrp
, struct cftype
*cftype
,
9002 return sched_group_set_shares(cgroup_tg(cgrp
), shareval
);
9005 static u64
cpu_shares_read_u64(struct cgroup
*cgrp
, struct cftype
*cft
)
9007 struct task_group
*tg
= cgroup_tg(cgrp
);
9009 return (u64
) tg
->shares
;
9013 #ifdef CONFIG_RT_GROUP_SCHED
9014 static int cpu_rt_runtime_write(struct cgroup
*cgrp
, struct cftype
*cft
,
9017 return sched_group_set_rt_runtime(cgroup_tg(cgrp
), val
);
9020 static s64
cpu_rt_runtime_read(struct cgroup
*cgrp
, struct cftype
*cft
)
9022 return sched_group_rt_runtime(cgroup_tg(cgrp
));
9025 static int cpu_rt_period_write_uint(struct cgroup
*cgrp
, struct cftype
*cftype
,
9028 return sched_group_set_rt_period(cgroup_tg(cgrp
), rt_period_us
);
9031 static u64
cpu_rt_period_read_uint(struct cgroup
*cgrp
, struct cftype
*cft
)
9033 return sched_group_rt_period(cgroup_tg(cgrp
));
9037 static struct cftype cpu_files
[] = {
9038 #ifdef CONFIG_FAIR_GROUP_SCHED
9041 .read_u64
= cpu_shares_read_u64
,
9042 .write_u64
= cpu_shares_write_u64
,
9045 #ifdef CONFIG_RT_GROUP_SCHED
9047 .name
= "rt_runtime_us",
9048 .read_s64
= cpu_rt_runtime_read
,
9049 .write_s64
= cpu_rt_runtime_write
,
9052 .name
= "rt_period_us",
9053 .read_u64
= cpu_rt_period_read_uint
,
9054 .write_u64
= cpu_rt_period_write_uint
,
9059 static int cpu_cgroup_populate(struct cgroup_subsys
*ss
, struct cgroup
*cont
)
9061 return cgroup_add_files(cont
, ss
, cpu_files
, ARRAY_SIZE(cpu_files
));
9064 struct cgroup_subsys cpu_cgroup_subsys
= {
9066 .create
= cpu_cgroup_create
,
9067 .destroy
= cpu_cgroup_destroy
,
9068 .can_attach
= cpu_cgroup_can_attach
,
9069 .attach
= cpu_cgroup_attach
,
9070 .populate
= cpu_cgroup_populate
,
9071 .subsys_id
= cpu_cgroup_subsys_id
,
9075 #endif /* CONFIG_CGROUP_SCHED */
9077 #ifdef CONFIG_CGROUP_CPUACCT
9080 * CPU accounting code for task groups.
9082 * Based on the work by Paul Menage (menage@google.com) and Balbir Singh
9083 * (balbir@in.ibm.com).
9086 /* track cpu usage of a group of tasks */
9088 struct cgroup_subsys_state css
;
9089 /* cpuusage holds pointer to a u64-type object on every cpu */
9093 struct cgroup_subsys cpuacct_subsys
;
9095 /* return cpu accounting group corresponding to this container */
9096 static inline struct cpuacct
*cgroup_ca(struct cgroup
*cgrp
)
9098 return container_of(cgroup_subsys_state(cgrp
, cpuacct_subsys_id
),
9099 struct cpuacct
, css
);
9102 /* return cpu accounting group to which this task belongs */
9103 static inline struct cpuacct
*task_ca(struct task_struct
*tsk
)
9105 return container_of(task_subsys_state(tsk
, cpuacct_subsys_id
),
9106 struct cpuacct
, css
);
9109 /* create a new cpu accounting group */
9110 static struct cgroup_subsys_state
*cpuacct_create(
9111 struct cgroup_subsys
*ss
, struct cgroup
*cgrp
)
9113 struct cpuacct
*ca
= kzalloc(sizeof(*ca
), GFP_KERNEL
);
9116 return ERR_PTR(-ENOMEM
);
9118 ca
->cpuusage
= alloc_percpu(u64
);
9119 if (!ca
->cpuusage
) {
9121 return ERR_PTR(-ENOMEM
);
9127 /* destroy an existing cpu accounting group */
9129 cpuacct_destroy(struct cgroup_subsys
*ss
, struct cgroup
*cgrp
)
9131 struct cpuacct
*ca
= cgroup_ca(cgrp
);
9133 free_percpu(ca
->cpuusage
);
9137 /* return total cpu usage (in nanoseconds) of a group */
9138 static u64
cpuusage_read(struct cgroup
*cgrp
, struct cftype
*cft
)
9140 struct cpuacct
*ca
= cgroup_ca(cgrp
);
9141 u64 totalcpuusage
= 0;
9144 for_each_possible_cpu(i
) {
9145 u64
*cpuusage
= percpu_ptr(ca
->cpuusage
, i
);
9148 * Take rq->lock to make 64-bit addition safe on 32-bit
9151 spin_lock_irq(&cpu_rq(i
)->lock
);
9152 totalcpuusage
+= *cpuusage
;
9153 spin_unlock_irq(&cpu_rq(i
)->lock
);
9156 return totalcpuusage
;
9159 static int cpuusage_write(struct cgroup
*cgrp
, struct cftype
*cftype
,
9162 struct cpuacct
*ca
= cgroup_ca(cgrp
);
9171 for_each_possible_cpu(i
) {
9172 u64
*cpuusage
= percpu_ptr(ca
->cpuusage
, i
);
9174 spin_lock_irq(&cpu_rq(i
)->lock
);
9176 spin_unlock_irq(&cpu_rq(i
)->lock
);
9182 static struct cftype files
[] = {
9185 .read_u64
= cpuusage_read
,
9186 .write_u64
= cpuusage_write
,
9190 static int cpuacct_populate(struct cgroup_subsys
*ss
, struct cgroup
*cgrp
)
9192 return cgroup_add_files(cgrp
, ss
, files
, ARRAY_SIZE(files
));
9196 * charge this task's execution time to its accounting group.
9198 * called with rq->lock held.
9200 static void cpuacct_charge(struct task_struct
*tsk
, u64 cputime
)
9204 if (!cpuacct_subsys
.active
)
9209 u64
*cpuusage
= percpu_ptr(ca
->cpuusage
, task_cpu(tsk
));
9211 *cpuusage
+= cputime
;
9215 struct cgroup_subsys cpuacct_subsys
= {
9217 .create
= cpuacct_create
,
9218 .destroy
= cpuacct_destroy
,
9219 .populate
= cpuacct_populate
,
9220 .subsys_id
= cpuacct_subsys_id
,
9222 #endif /* CONFIG_CGROUP_CPUACCT */