]>
Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * kernel/sched.c | |
3 | * | |
4 | * Kernel scheduler and related syscalls | |
5 | * | |
6 | * Copyright (C) 1991-2002 Linus Torvalds | |
7 | * | |
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 | |
11 | * by Andrea Arcangeli | |
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 | |
c31f2e8a IM |
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 | |
22 | * by Peter Williams | |
23 | * 2007-05-06 Interactivity improvements to CFS by Mike Galbraith | |
24 | * 2007-07-01 Group scheduling enhancements by Srivatsa Vaddagiri | |
b9131769 IM |
25 | * 2007-11-29 RT balancing improvements by Steven Rostedt, Gregory Haskins, |
26 | * Thomas Gleixner, Mike Kravetz | |
1da177e4 LT |
27 | */ |
28 | ||
29 | #include <linux/mm.h> | |
30 | #include <linux/module.h> | |
31 | #include <linux/nmi.h> | |
32 | #include <linux/init.h> | |
dff06c15 | 33 | #include <linux/uaccess.h> |
1da177e4 LT |
34 | #include <linux/highmem.h> |
35 | #include <linux/smp_lock.h> | |
36 | #include <asm/mmu_context.h> | |
37 | #include <linux/interrupt.h> | |
c59ede7b | 38 | #include <linux/capability.h> |
1da177e4 LT |
39 | #include <linux/completion.h> |
40 | #include <linux/kernel_stat.h> | |
9a11b49a | 41 | #include <linux/debug_locks.h> |
1da177e4 LT |
42 | #include <linux/security.h> |
43 | #include <linux/notifier.h> | |
44 | #include <linux/profile.h> | |
7dfb7103 | 45 | #include <linux/freezer.h> |
198e2f18 | 46 | #include <linux/vmalloc.h> |
1da177e4 LT |
47 | #include <linux/blkdev.h> |
48 | #include <linux/delay.h> | |
b488893a | 49 | #include <linux/pid_namespace.h> |
1da177e4 LT |
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> | |
b5aadf7f | 58 | #include <linux/proc_fs.h> |
1da177e4 | 59 | #include <linux/seq_file.h> |
e692ab53 | 60 | #include <linux/sysctl.h> |
1da177e4 LT |
61 | #include <linux/syscalls.h> |
62 | #include <linux/times.h> | |
8f0ab514 | 63 | #include <linux/tsacct_kern.h> |
c6fd91f0 | 64 | #include <linux/kprobes.h> |
0ff92245 | 65 | #include <linux/delayacct.h> |
5517d86b | 66 | #include <linux/reciprocal_div.h> |
dff06c15 | 67 | #include <linux/unistd.h> |
f5ff8422 | 68 | #include <linux/pagemap.h> |
8f4d37ec | 69 | #include <linux/hrtimer.h> |
30914a58 | 70 | #include <linux/tick.h> |
434d53b0 | 71 | #include <linux/bootmem.h> |
f00b45c1 PZ |
72 | #include <linux/debugfs.h> |
73 | #include <linux/ctype.h> | |
6cd8a4bb | 74 | #include <linux/ftrace.h> |
0a16b607 | 75 | #include <trace/sched.h> |
1da177e4 | 76 | |
5517d86b | 77 | #include <asm/tlb.h> |
838225b4 | 78 | #include <asm/irq_regs.h> |
1da177e4 | 79 | |
6e0534f2 GH |
80 | #include "sched_cpupri.h" |
81 | ||
1da177e4 LT |
82 | /* |
83 | * Convert user-nice values [ -20 ... 0 ... 19 ] | |
84 | * to static priority [ MAX_RT_PRIO..MAX_PRIO-1 ], | |
85 | * and back. | |
86 | */ | |
87 | #define NICE_TO_PRIO(nice) (MAX_RT_PRIO + (nice) + 20) | |
88 | #define PRIO_TO_NICE(prio) ((prio) - MAX_RT_PRIO - 20) | |
89 | #define TASK_NICE(p) PRIO_TO_NICE((p)->static_prio) | |
90 | ||
91 | /* | |
92 | * 'User priority' is the nice value converted to something we | |
93 | * can work with better when scaling various scheduler parameters, | |
94 | * it's a [ 0 ... 39 ] range. | |
95 | */ | |
96 | #define USER_PRIO(p) ((p)-MAX_RT_PRIO) | |
97 | #define TASK_USER_PRIO(p) USER_PRIO((p)->static_prio) | |
98 | #define MAX_USER_PRIO (USER_PRIO(MAX_PRIO)) | |
99 | ||
100 | /* | |
d7876a08 | 101 | * Helpers for converting nanosecond timing to jiffy resolution |
1da177e4 | 102 | */ |
d6322faf | 103 | #define NS_TO_JIFFIES(TIME) ((unsigned long)(TIME) / (NSEC_PER_SEC / HZ)) |
1da177e4 | 104 | |
6aa645ea IM |
105 | #define NICE_0_LOAD SCHED_LOAD_SCALE |
106 | #define NICE_0_SHIFT SCHED_LOAD_SHIFT | |
107 | ||
1da177e4 LT |
108 | /* |
109 | * These are the 'tuning knobs' of the scheduler: | |
110 | * | |
a4ec24b4 | 111 | * default timeslice is 100 msecs (used only for SCHED_RR tasks). |
1da177e4 LT |
112 | * Timeslices get refilled after they expire. |
113 | */ | |
1da177e4 | 114 | #define DEF_TIMESLICE (100 * HZ / 1000) |
2dd73a4f | 115 | |
d0b27fa7 PZ |
116 | /* |
117 | * single value that denotes runtime == period, ie unlimited time. | |
118 | */ | |
119 | #define RUNTIME_INF ((u64)~0ULL) | |
120 | ||
5517d86b ED |
121 | #ifdef CONFIG_SMP |
122 | /* | |
123 | * Divide a load by a sched group cpu_power : (load / sg->__cpu_power) | |
124 | * Since cpu_power is a 'constant', we can use a reciprocal divide. | |
125 | */ | |
126 | static inline u32 sg_div_cpu_power(const struct sched_group *sg, u32 load) | |
127 | { | |
128 | return reciprocal_divide(load, sg->reciprocal_cpu_power); | |
129 | } | |
130 | ||
131 | /* | |
132 | * Each time a sched group cpu_power is changed, | |
133 | * we must compute its reciprocal value | |
134 | */ | |
135 | static inline void sg_inc_cpu_power(struct sched_group *sg, u32 val) | |
136 | { | |
137 | sg->__cpu_power += val; | |
138 | sg->reciprocal_cpu_power = reciprocal_value(sg->__cpu_power); | |
139 | } | |
140 | #endif | |
141 | ||
e05606d3 IM |
142 | static inline int rt_policy(int policy) |
143 | { | |
3f33a7ce | 144 | if (unlikely(policy == SCHED_FIFO || policy == SCHED_RR)) |
e05606d3 IM |
145 | return 1; |
146 | return 0; | |
147 | } | |
148 | ||
149 | static inline int task_has_rt_policy(struct task_struct *p) | |
150 | { | |
151 | return rt_policy(p->policy); | |
152 | } | |
153 | ||
1da177e4 | 154 | /* |
6aa645ea | 155 | * This is the priority-queue data structure of the RT scheduling class: |
1da177e4 | 156 | */ |
6aa645ea IM |
157 | struct rt_prio_array { |
158 | DECLARE_BITMAP(bitmap, MAX_RT_PRIO+1); /* include 1 bit for delimiter */ | |
159 | struct list_head queue[MAX_RT_PRIO]; | |
160 | }; | |
161 | ||
d0b27fa7 | 162 | struct rt_bandwidth { |
ea736ed5 IM |
163 | /* nests inside the rq lock: */ |
164 | spinlock_t rt_runtime_lock; | |
165 | ktime_t rt_period; | |
166 | u64 rt_runtime; | |
167 | struct hrtimer rt_period_timer; | |
d0b27fa7 PZ |
168 | }; |
169 | ||
170 | static struct rt_bandwidth def_rt_bandwidth; | |
171 | ||
172 | static int do_sched_rt_period_timer(struct rt_bandwidth *rt_b, int overrun); | |
173 | ||
174 | static enum hrtimer_restart sched_rt_period_timer(struct hrtimer *timer) | |
175 | { | |
176 | struct rt_bandwidth *rt_b = | |
177 | container_of(timer, struct rt_bandwidth, rt_period_timer); | |
178 | ktime_t now; | |
179 | int overrun; | |
180 | int idle = 0; | |
181 | ||
182 | for (;;) { | |
183 | now = hrtimer_cb_get_time(timer); | |
184 | overrun = hrtimer_forward(timer, now, rt_b->rt_period); | |
185 | ||
186 | if (!overrun) | |
187 | break; | |
188 | ||
189 | idle = do_sched_rt_period_timer(rt_b, overrun); | |
190 | } | |
191 | ||
192 | return idle ? HRTIMER_NORESTART : HRTIMER_RESTART; | |
193 | } | |
194 | ||
195 | static | |
196 | void init_rt_bandwidth(struct rt_bandwidth *rt_b, u64 period, u64 runtime) | |
197 | { | |
198 | rt_b->rt_period = ns_to_ktime(period); | |
199 | rt_b->rt_runtime = runtime; | |
200 | ||
ac086bc2 PZ |
201 | spin_lock_init(&rt_b->rt_runtime_lock); |
202 | ||
d0b27fa7 PZ |
203 | hrtimer_init(&rt_b->rt_period_timer, |
204 | CLOCK_MONOTONIC, HRTIMER_MODE_REL); | |
205 | rt_b->rt_period_timer.function = sched_rt_period_timer; | |
ccc7dadf | 206 | rt_b->rt_period_timer.cb_mode = HRTIMER_CB_IRQSAFE_UNLOCKED; |
d0b27fa7 PZ |
207 | } |
208 | ||
c8bfff6d KH |
209 | static inline int rt_bandwidth_enabled(void) |
210 | { | |
211 | return sysctl_sched_rt_runtime >= 0; | |
d0b27fa7 PZ |
212 | } |
213 | ||
214 | static void start_rt_bandwidth(struct rt_bandwidth *rt_b) | |
215 | { | |
216 | ktime_t now; | |
217 | ||
0b148fa0 | 218 | if (rt_bandwidth_enabled() && rt_b->rt_runtime == RUNTIME_INF) |
d0b27fa7 PZ |
219 | return; |
220 | ||
221 | if (hrtimer_active(&rt_b->rt_period_timer)) | |
222 | return; | |
223 | ||
224 | spin_lock(&rt_b->rt_runtime_lock); | |
225 | for (;;) { | |
226 | if (hrtimer_active(&rt_b->rt_period_timer)) | |
227 | break; | |
228 | ||
229 | now = hrtimer_cb_get_time(&rt_b->rt_period_timer); | |
230 | hrtimer_forward(&rt_b->rt_period_timer, now, rt_b->rt_period); | |
cc584b21 AV |
231 | hrtimer_start_expires(&rt_b->rt_period_timer, |
232 | HRTIMER_MODE_ABS); | |
d0b27fa7 PZ |
233 | } |
234 | spin_unlock(&rt_b->rt_runtime_lock); | |
235 | } | |
236 | ||
237 | #ifdef CONFIG_RT_GROUP_SCHED | |
238 | static void destroy_rt_bandwidth(struct rt_bandwidth *rt_b) | |
239 | { | |
240 | hrtimer_cancel(&rt_b->rt_period_timer); | |
241 | } | |
242 | #endif | |
243 | ||
712555ee HC |
244 | /* |
245 | * sched_domains_mutex serializes calls to arch_init_sched_domains, | |
246 | * detach_destroy_domains and partition_sched_domains. | |
247 | */ | |
248 | static DEFINE_MUTEX(sched_domains_mutex); | |
249 | ||
052f1dc7 | 250 | #ifdef CONFIG_GROUP_SCHED |
29f59db3 | 251 | |
68318b8e SV |
252 | #include <linux/cgroup.h> |
253 | ||
29f59db3 SV |
254 | struct cfs_rq; |
255 | ||
6f505b16 PZ |
256 | static LIST_HEAD(task_groups); |
257 | ||
29f59db3 | 258 | /* task group related information */ |
4cf86d77 | 259 | struct task_group { |
052f1dc7 | 260 | #ifdef CONFIG_CGROUP_SCHED |
68318b8e SV |
261 | struct cgroup_subsys_state css; |
262 | #endif | |
052f1dc7 PZ |
263 | |
264 | #ifdef CONFIG_FAIR_GROUP_SCHED | |
29f59db3 SV |
265 | /* schedulable entities of this group on each cpu */ |
266 | struct sched_entity **se; | |
267 | /* runqueue "owned" by this group on each cpu */ | |
268 | struct cfs_rq **cfs_rq; | |
269 | unsigned long shares; | |
052f1dc7 PZ |
270 | #endif |
271 | ||
272 | #ifdef CONFIG_RT_GROUP_SCHED | |
273 | struct sched_rt_entity **rt_se; | |
274 | struct rt_rq **rt_rq; | |
275 | ||
d0b27fa7 | 276 | struct rt_bandwidth rt_bandwidth; |
052f1dc7 | 277 | #endif |
6b2d7700 | 278 | |
ae8393e5 | 279 | struct rcu_head rcu; |
6f505b16 | 280 | struct list_head list; |
f473aa5e PZ |
281 | |
282 | struct task_group *parent; | |
283 | struct list_head siblings; | |
284 | struct list_head children; | |
29f59db3 SV |
285 | }; |
286 | ||
354d60c2 | 287 | #ifdef CONFIG_USER_SCHED |
eff766a6 PZ |
288 | |
289 | /* | |
290 | * Root task group. | |
291 | * Every UID task group (including init_task_group aka UID-0) will | |
292 | * be a child to this group. | |
293 | */ | |
294 | struct task_group root_task_group; | |
295 | ||
052f1dc7 | 296 | #ifdef CONFIG_FAIR_GROUP_SCHED |
29f59db3 SV |
297 | /* Default task group's sched entity on each cpu */ |
298 | static DEFINE_PER_CPU(struct sched_entity, init_sched_entity); | |
299 | /* Default task group's cfs_rq on each cpu */ | |
300 | static DEFINE_PER_CPU(struct cfs_rq, init_cfs_rq) ____cacheline_aligned_in_smp; | |
6d6bc0ad | 301 | #endif /* CONFIG_FAIR_GROUP_SCHED */ |
052f1dc7 PZ |
302 | |
303 | #ifdef CONFIG_RT_GROUP_SCHED | |
304 | static DEFINE_PER_CPU(struct sched_rt_entity, init_sched_rt_entity); | |
305 | static DEFINE_PER_CPU(struct rt_rq, init_rt_rq) ____cacheline_aligned_in_smp; | |
6d6bc0ad | 306 | #endif /* CONFIG_RT_GROUP_SCHED */ |
9a7e0b18 | 307 | #else /* !CONFIG_USER_SCHED */ |
eff766a6 | 308 | #define root_task_group init_task_group |
9a7e0b18 | 309 | #endif /* CONFIG_USER_SCHED */ |
6f505b16 | 310 | |
8ed36996 | 311 | /* task_group_lock serializes add/remove of task groups and also changes to |
ec2c507f SV |
312 | * a task group's cpu shares. |
313 | */ | |
8ed36996 | 314 | static DEFINE_SPINLOCK(task_group_lock); |
ec2c507f | 315 | |
052f1dc7 | 316 | #ifdef CONFIG_FAIR_GROUP_SCHED |
052f1dc7 PZ |
317 | #ifdef CONFIG_USER_SCHED |
318 | # define INIT_TASK_GROUP_LOAD (2*NICE_0_LOAD) | |
6d6bc0ad | 319 | #else /* !CONFIG_USER_SCHED */ |
052f1dc7 | 320 | # define INIT_TASK_GROUP_LOAD NICE_0_LOAD |
6d6bc0ad | 321 | #endif /* CONFIG_USER_SCHED */ |
052f1dc7 | 322 | |
cb4ad1ff | 323 | /* |
2e084786 LJ |
324 | * A weight of 0 or 1 can cause arithmetics problems. |
325 | * A weight of a cfs_rq is the sum of weights of which entities | |
326 | * are queued on this cfs_rq, so a weight of a entity should not be | |
327 | * too large, so as the shares value of a task group. | |
cb4ad1ff MX |
328 | * (The default weight is 1024 - so there's no practical |
329 | * limitation from this.) | |
330 | */ | |
18d95a28 | 331 | #define MIN_SHARES 2 |
2e084786 | 332 | #define MAX_SHARES (1UL << 18) |
18d95a28 | 333 | |
052f1dc7 PZ |
334 | static int init_task_group_load = INIT_TASK_GROUP_LOAD; |
335 | #endif | |
336 | ||
29f59db3 | 337 | /* Default task group. |
3a252015 | 338 | * Every task in system belong to this group at bootup. |
29f59db3 | 339 | */ |
434d53b0 | 340 | struct task_group init_task_group; |
29f59db3 SV |
341 | |
342 | /* return group to which a task belongs */ | |
4cf86d77 | 343 | static inline struct task_group *task_group(struct task_struct *p) |
29f59db3 | 344 | { |
4cf86d77 | 345 | struct task_group *tg; |
9b5b7751 | 346 | |
052f1dc7 | 347 | #ifdef CONFIG_USER_SCHED |
24e377a8 | 348 | tg = p->user->tg; |
052f1dc7 | 349 | #elif defined(CONFIG_CGROUP_SCHED) |
68318b8e SV |
350 | tg = container_of(task_subsys_state(p, cpu_cgroup_subsys_id), |
351 | struct task_group, css); | |
24e377a8 | 352 | #else |
41a2d6cf | 353 | tg = &init_task_group; |
24e377a8 | 354 | #endif |
9b5b7751 | 355 | return tg; |
29f59db3 SV |
356 | } |
357 | ||
358 | /* Change a task's cfs_rq and parent entity if it moves across CPUs/groups */ | |
6f505b16 | 359 | static inline void set_task_rq(struct task_struct *p, unsigned int cpu) |
29f59db3 | 360 | { |
052f1dc7 | 361 | #ifdef CONFIG_FAIR_GROUP_SCHED |
ce96b5ac DA |
362 | p->se.cfs_rq = task_group(p)->cfs_rq[cpu]; |
363 | p->se.parent = task_group(p)->se[cpu]; | |
052f1dc7 | 364 | #endif |
6f505b16 | 365 | |
052f1dc7 | 366 | #ifdef CONFIG_RT_GROUP_SCHED |
6f505b16 PZ |
367 | p->rt.rt_rq = task_group(p)->rt_rq[cpu]; |
368 | p->rt.parent = task_group(p)->rt_se[cpu]; | |
052f1dc7 | 369 | #endif |
29f59db3 SV |
370 | } |
371 | ||
372 | #else | |
373 | ||
6f505b16 | 374 | static inline void set_task_rq(struct task_struct *p, unsigned int cpu) { } |
83378269 PZ |
375 | static inline struct task_group *task_group(struct task_struct *p) |
376 | { | |
377 | return NULL; | |
378 | } | |
29f59db3 | 379 | |
052f1dc7 | 380 | #endif /* CONFIG_GROUP_SCHED */ |
29f59db3 | 381 | |
6aa645ea IM |
382 | /* CFS-related fields in a runqueue */ |
383 | struct cfs_rq { | |
384 | struct load_weight load; | |
385 | unsigned long nr_running; | |
386 | ||
6aa645ea | 387 | u64 exec_clock; |
e9acbff6 | 388 | u64 min_vruntime; |
6aa645ea IM |
389 | |
390 | struct rb_root tasks_timeline; | |
391 | struct rb_node *rb_leftmost; | |
4a55bd5e PZ |
392 | |
393 | struct list_head tasks; | |
394 | struct list_head *balance_iterator; | |
395 | ||
396 | /* | |
397 | * 'curr' points to currently running entity on this cfs_rq. | |
6aa645ea IM |
398 | * It is set to NULL otherwise (i.e when none are currently running). |
399 | */ | |
4793241b | 400 | struct sched_entity *curr, *next, *last; |
ddc97297 | 401 | |
5ac5c4d6 | 402 | unsigned int nr_spread_over; |
ddc97297 | 403 | |
62160e3f | 404 | #ifdef CONFIG_FAIR_GROUP_SCHED |
6aa645ea IM |
405 | struct rq *rq; /* cpu runqueue to which this cfs_rq is attached */ |
406 | ||
41a2d6cf IM |
407 | /* |
408 | * leaf cfs_rqs are those that hold tasks (lowest schedulable entity in | |
6aa645ea IM |
409 | * a hierarchy). Non-leaf lrqs hold other higher schedulable entities |
410 | * (like users, containers etc.) | |
411 | * | |
412 | * leaf_cfs_rq_list ties together list of leaf cfs_rq's in a cpu. This | |
413 | * list is used during load balance. | |
414 | */ | |
41a2d6cf IM |
415 | struct list_head leaf_cfs_rq_list; |
416 | struct task_group *tg; /* group that "owns" this runqueue */ | |
c09595f6 PZ |
417 | |
418 | #ifdef CONFIG_SMP | |
c09595f6 | 419 | /* |
c8cba857 | 420 | * the part of load.weight contributed by tasks |
c09595f6 | 421 | */ |
c8cba857 | 422 | unsigned long task_weight; |
c09595f6 | 423 | |
c8cba857 PZ |
424 | /* |
425 | * h_load = weight * f(tg) | |
426 | * | |
427 | * Where f(tg) is the recursive weight fraction assigned to | |
428 | * this group. | |
429 | */ | |
430 | unsigned long h_load; | |
c09595f6 | 431 | |
c8cba857 PZ |
432 | /* |
433 | * this cpu's part of tg->shares | |
434 | */ | |
435 | unsigned long shares; | |
f1d239f7 PZ |
436 | |
437 | /* | |
438 | * load.weight at the time we set shares | |
439 | */ | |
440 | unsigned long rq_weight; | |
c09595f6 | 441 | #endif |
6aa645ea IM |
442 | #endif |
443 | }; | |
1da177e4 | 444 | |
6aa645ea IM |
445 | /* Real-Time classes' related field in a runqueue: */ |
446 | struct rt_rq { | |
447 | struct rt_prio_array active; | |
63489e45 | 448 | unsigned long rt_nr_running; |
052f1dc7 | 449 | #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED |
6f505b16 PZ |
450 | int highest_prio; /* highest queued rt task prio */ |
451 | #endif | |
fa85ae24 | 452 | #ifdef CONFIG_SMP |
73fe6aae | 453 | unsigned long rt_nr_migratory; |
a22d7fc1 | 454 | int overloaded; |
fa85ae24 | 455 | #endif |
6f505b16 | 456 | int rt_throttled; |
fa85ae24 | 457 | u64 rt_time; |
ac086bc2 | 458 | u64 rt_runtime; |
ea736ed5 | 459 | /* Nests inside the rq lock: */ |
ac086bc2 | 460 | spinlock_t rt_runtime_lock; |
6f505b16 | 461 | |
052f1dc7 | 462 | #ifdef CONFIG_RT_GROUP_SCHED |
23b0fdfc PZ |
463 | unsigned long rt_nr_boosted; |
464 | ||
6f505b16 PZ |
465 | struct rq *rq; |
466 | struct list_head leaf_rt_rq_list; | |
467 | struct task_group *tg; | |
468 | struct sched_rt_entity *rt_se; | |
469 | #endif | |
6aa645ea IM |
470 | }; |
471 | ||
57d885fe GH |
472 | #ifdef CONFIG_SMP |
473 | ||
474 | /* | |
475 | * We add the notion of a root-domain which will be used to define per-domain | |
0eab9146 IM |
476 | * variables. Each exclusive cpuset essentially defines an island domain by |
477 | * fully partitioning the member cpus from any other cpuset. Whenever a new | |
57d885fe GH |
478 | * exclusive cpuset is created, we also create and attach a new root-domain |
479 | * object. | |
480 | * | |
57d885fe GH |
481 | */ |
482 | struct root_domain { | |
483 | atomic_t refcount; | |
484 | cpumask_t span; | |
485 | cpumask_t online; | |
637f5085 | 486 | |
0eab9146 | 487 | /* |
637f5085 GH |
488 | * The "RT overload" flag: it gets set if a CPU has more than |
489 | * one runnable RT task. | |
490 | */ | |
491 | cpumask_t rto_mask; | |
0eab9146 | 492 | atomic_t rto_count; |
6e0534f2 GH |
493 | #ifdef CONFIG_SMP |
494 | struct cpupri cpupri; | |
495 | #endif | |
57d885fe GH |
496 | }; |
497 | ||
dc938520 GH |
498 | /* |
499 | * By default the system creates a single root-domain with all cpus as | |
500 | * members (mimicking the global state we have today). | |
501 | */ | |
57d885fe GH |
502 | static struct root_domain def_root_domain; |
503 | ||
504 | #endif | |
505 | ||
1da177e4 LT |
506 | /* |
507 | * This is the main, per-CPU runqueue data structure. | |
508 | * | |
509 | * Locking rule: those places that want to lock multiple runqueues | |
510 | * (such as the load balancing or the thread migration code), lock | |
511 | * acquire operations must be ordered by ascending &runqueue. | |
512 | */ | |
70b97a7f | 513 | struct rq { |
d8016491 IM |
514 | /* runqueue lock: */ |
515 | spinlock_t lock; | |
1da177e4 LT |
516 | |
517 | /* | |
518 | * nr_running and cpu_load should be in the same cacheline because | |
519 | * remote CPUs use both these fields when doing load calculation. | |
520 | */ | |
521 | unsigned long nr_running; | |
6aa645ea IM |
522 | #define CPU_LOAD_IDX_MAX 5 |
523 | unsigned long cpu_load[CPU_LOAD_IDX_MAX]; | |
bdecea3a | 524 | unsigned char idle_at_tick; |
46cb4b7c | 525 | #ifdef CONFIG_NO_HZ |
15934a37 | 526 | unsigned long last_tick_seen; |
46cb4b7c SS |
527 | unsigned char in_nohz_recently; |
528 | #endif | |
d8016491 IM |
529 | /* capture load from *all* tasks on this cpu: */ |
530 | struct load_weight load; | |
6aa645ea IM |
531 | unsigned long nr_load_updates; |
532 | u64 nr_switches; | |
533 | ||
534 | struct cfs_rq cfs; | |
6f505b16 | 535 | struct rt_rq rt; |
6f505b16 | 536 | |
6aa645ea | 537 | #ifdef CONFIG_FAIR_GROUP_SCHED |
d8016491 IM |
538 | /* list of leaf cfs_rq on this cpu: */ |
539 | struct list_head leaf_cfs_rq_list; | |
052f1dc7 PZ |
540 | #endif |
541 | #ifdef CONFIG_RT_GROUP_SCHED | |
6f505b16 | 542 | struct list_head leaf_rt_rq_list; |
1da177e4 | 543 | #endif |
1da177e4 LT |
544 | |
545 | /* | |
546 | * This is part of a global counter where only the total sum | |
547 | * over all CPUs matters. A task can increase this counter on | |
548 | * one CPU and if it got migrated afterwards it may decrease | |
549 | * it on another CPU. Always updated under the runqueue lock: | |
550 | */ | |
551 | unsigned long nr_uninterruptible; | |
552 | ||
36c8b586 | 553 | struct task_struct *curr, *idle; |
c9819f45 | 554 | unsigned long next_balance; |
1da177e4 | 555 | struct mm_struct *prev_mm; |
6aa645ea | 556 | |
3e51f33f | 557 | u64 clock; |
6aa645ea | 558 | |
1da177e4 LT |
559 | atomic_t nr_iowait; |
560 | ||
561 | #ifdef CONFIG_SMP | |
0eab9146 | 562 | struct root_domain *rd; |
1da177e4 LT |
563 | struct sched_domain *sd; |
564 | ||
565 | /* For active balancing */ | |
566 | int active_balance; | |
567 | int push_cpu; | |
d8016491 IM |
568 | /* cpu of this runqueue: */ |
569 | int cpu; | |
1f11eb6a | 570 | int online; |
1da177e4 | 571 | |
a8a51d5e | 572 | unsigned long avg_load_per_task; |
1da177e4 | 573 | |
36c8b586 | 574 | struct task_struct *migration_thread; |
1da177e4 LT |
575 | struct list_head migration_queue; |
576 | #endif | |
577 | ||
8f4d37ec | 578 | #ifdef CONFIG_SCHED_HRTICK |
31656519 PZ |
579 | #ifdef CONFIG_SMP |
580 | int hrtick_csd_pending; | |
581 | struct call_single_data hrtick_csd; | |
582 | #endif | |
8f4d37ec PZ |
583 | struct hrtimer hrtick_timer; |
584 | #endif | |
585 | ||
1da177e4 LT |
586 | #ifdef CONFIG_SCHEDSTATS |
587 | /* latency stats */ | |
588 | struct sched_info rq_sched_info; | |
589 | ||
590 | /* sys_sched_yield() stats */ | |
480b9434 KC |
591 | unsigned int yld_exp_empty; |
592 | unsigned int yld_act_empty; | |
593 | unsigned int yld_both_empty; | |
594 | unsigned int yld_count; | |
1da177e4 LT |
595 | |
596 | /* schedule() stats */ | |
480b9434 KC |
597 | unsigned int sched_switch; |
598 | unsigned int sched_count; | |
599 | unsigned int sched_goidle; | |
1da177e4 LT |
600 | |
601 | /* try_to_wake_up() stats */ | |
480b9434 KC |
602 | unsigned int ttwu_count; |
603 | unsigned int ttwu_local; | |
b8efb561 IM |
604 | |
605 | /* BKL stats */ | |
480b9434 | 606 | unsigned int bkl_count; |
1da177e4 LT |
607 | #endif |
608 | }; | |
609 | ||
f34e3b61 | 610 | static DEFINE_PER_CPU_SHARED_ALIGNED(struct rq, runqueues); |
1da177e4 | 611 | |
15afe09b | 612 | static inline void check_preempt_curr(struct rq *rq, struct task_struct *p, int sync) |
dd41f596 | 613 | { |
15afe09b | 614 | rq->curr->sched_class->check_preempt_curr(rq, p, sync); |
dd41f596 IM |
615 | } |
616 | ||
0a2966b4 CL |
617 | static inline int cpu_of(struct rq *rq) |
618 | { | |
619 | #ifdef CONFIG_SMP | |
620 | return rq->cpu; | |
621 | #else | |
622 | return 0; | |
623 | #endif | |
624 | } | |
625 | ||
674311d5 NP |
626 | /* |
627 | * The domain tree (rq->sd) is protected by RCU's quiescent state transition. | |
1a20ff27 | 628 | * See detach_destroy_domains: synchronize_sched for details. |
674311d5 NP |
629 | * |
630 | * The domain tree of any CPU may only be accessed from within | |
631 | * preempt-disabled sections. | |
632 | */ | |
48f24c4d IM |
633 | #define for_each_domain(cpu, __sd) \ |
634 | for (__sd = rcu_dereference(cpu_rq(cpu)->sd); __sd; __sd = __sd->parent) | |
1da177e4 LT |
635 | |
636 | #define cpu_rq(cpu) (&per_cpu(runqueues, (cpu))) | |
637 | #define this_rq() (&__get_cpu_var(runqueues)) | |
638 | #define task_rq(p) cpu_rq(task_cpu(p)) | |
639 | #define cpu_curr(cpu) (cpu_rq(cpu)->curr) | |
640 | ||
3e51f33f PZ |
641 | static inline void update_rq_clock(struct rq *rq) |
642 | { | |
643 | rq->clock = sched_clock_cpu(cpu_of(rq)); | |
644 | } | |
645 | ||
bf5c91ba IM |
646 | /* |
647 | * Tunables that become constants when CONFIG_SCHED_DEBUG is off: | |
648 | */ | |
649 | #ifdef CONFIG_SCHED_DEBUG | |
650 | # define const_debug __read_mostly | |
651 | #else | |
652 | # define const_debug static const | |
653 | #endif | |
654 | ||
017730c1 IM |
655 | /** |
656 | * runqueue_is_locked | |
657 | * | |
658 | * Returns true if the current cpu runqueue is locked. | |
659 | * This interface allows printk to be called with the runqueue lock | |
660 | * held and know whether or not it is OK to wake up the klogd. | |
661 | */ | |
662 | int runqueue_is_locked(void) | |
663 | { | |
664 | int cpu = get_cpu(); | |
665 | struct rq *rq = cpu_rq(cpu); | |
666 | int ret; | |
667 | ||
668 | ret = spin_is_locked(&rq->lock); | |
669 | put_cpu(); | |
670 | return ret; | |
671 | } | |
672 | ||
bf5c91ba IM |
673 | /* |
674 | * Debugging: various feature bits | |
675 | */ | |
f00b45c1 PZ |
676 | |
677 | #define SCHED_FEAT(name, enabled) \ | |
678 | __SCHED_FEAT_##name , | |
679 | ||
bf5c91ba | 680 | enum { |
f00b45c1 | 681 | #include "sched_features.h" |
bf5c91ba IM |
682 | }; |
683 | ||
f00b45c1 PZ |
684 | #undef SCHED_FEAT |
685 | ||
686 | #define SCHED_FEAT(name, enabled) \ | |
687 | (1UL << __SCHED_FEAT_##name) * enabled | | |
688 | ||
bf5c91ba | 689 | const_debug unsigned int sysctl_sched_features = |
f00b45c1 PZ |
690 | #include "sched_features.h" |
691 | 0; | |
692 | ||
693 | #undef SCHED_FEAT | |
694 | ||
695 | #ifdef CONFIG_SCHED_DEBUG | |
696 | #define SCHED_FEAT(name, enabled) \ | |
697 | #name , | |
698 | ||
983ed7a6 | 699 | static __read_mostly char *sched_feat_names[] = { |
f00b45c1 PZ |
700 | #include "sched_features.h" |
701 | NULL | |
702 | }; | |
703 | ||
704 | #undef SCHED_FEAT | |
705 | ||
34f3a814 | 706 | static int sched_feat_show(struct seq_file *m, void *v) |
f00b45c1 | 707 | { |
f00b45c1 PZ |
708 | int i; |
709 | ||
710 | for (i = 0; sched_feat_names[i]; i++) { | |
34f3a814 LZ |
711 | if (!(sysctl_sched_features & (1UL << i))) |
712 | seq_puts(m, "NO_"); | |
713 | seq_printf(m, "%s ", sched_feat_names[i]); | |
f00b45c1 | 714 | } |
34f3a814 | 715 | seq_puts(m, "\n"); |
f00b45c1 | 716 | |
34f3a814 | 717 | return 0; |
f00b45c1 PZ |
718 | } |
719 | ||
720 | static ssize_t | |
721 | sched_feat_write(struct file *filp, const char __user *ubuf, | |
722 | size_t cnt, loff_t *ppos) | |
723 | { | |
724 | char buf[64]; | |
725 | char *cmp = buf; | |
726 | int neg = 0; | |
727 | int i; | |
728 | ||
729 | if (cnt > 63) | |
730 | cnt = 63; | |
731 | ||
732 | if (copy_from_user(&buf, ubuf, cnt)) | |
733 | return -EFAULT; | |
734 | ||
735 | buf[cnt] = 0; | |
736 | ||
c24b7c52 | 737 | if (strncmp(buf, "NO_", 3) == 0) { |
f00b45c1 PZ |
738 | neg = 1; |
739 | cmp += 3; | |
740 | } | |
741 | ||
742 | for (i = 0; sched_feat_names[i]; i++) { | |
743 | int len = strlen(sched_feat_names[i]); | |
744 | ||
745 | if (strncmp(cmp, sched_feat_names[i], len) == 0) { | |
746 | if (neg) | |
747 | sysctl_sched_features &= ~(1UL << i); | |
748 | else | |
749 | sysctl_sched_features |= (1UL << i); | |
750 | break; | |
751 | } | |
752 | } | |
753 | ||
754 | if (!sched_feat_names[i]) | |
755 | return -EINVAL; | |
756 | ||
757 | filp->f_pos += cnt; | |
758 | ||
759 | return cnt; | |
760 | } | |
761 | ||
34f3a814 LZ |
762 | static int sched_feat_open(struct inode *inode, struct file *filp) |
763 | { | |
764 | return single_open(filp, sched_feat_show, NULL); | |
765 | } | |
766 | ||
f00b45c1 | 767 | static struct file_operations sched_feat_fops = { |
34f3a814 LZ |
768 | .open = sched_feat_open, |
769 | .write = sched_feat_write, | |
770 | .read = seq_read, | |
771 | .llseek = seq_lseek, | |
772 | .release = single_release, | |
f00b45c1 PZ |
773 | }; |
774 | ||
775 | static __init int sched_init_debug(void) | |
776 | { | |
f00b45c1 PZ |
777 | debugfs_create_file("sched_features", 0644, NULL, NULL, |
778 | &sched_feat_fops); | |
779 | ||
780 | return 0; | |
781 | } | |
782 | late_initcall(sched_init_debug); | |
783 | ||
784 | #endif | |
785 | ||
786 | #define sched_feat(x) (sysctl_sched_features & (1UL << __SCHED_FEAT_##x)) | |
bf5c91ba | 787 | |
b82d9fdd PZ |
788 | /* |
789 | * Number of tasks to iterate in a single balance run. | |
790 | * Limited because this is done with IRQs disabled. | |
791 | */ | |
792 | const_debug unsigned int sysctl_sched_nr_migrate = 32; | |
793 | ||
2398f2c6 PZ |
794 | /* |
795 | * ratelimit for updating the group shares. | |
55cd5340 | 796 | * default: 0.25ms |
2398f2c6 | 797 | */ |
55cd5340 | 798 | unsigned int sysctl_sched_shares_ratelimit = 250000; |
2398f2c6 | 799 | |
ffda12a1 PZ |
800 | /* |
801 | * Inject some fuzzyness into changing the per-cpu group shares | |
802 | * this avoids remote rq-locks at the expense of fairness. | |
803 | * default: 4 | |
804 | */ | |
805 | unsigned int sysctl_sched_shares_thresh = 4; | |
806 | ||
fa85ae24 | 807 | /* |
9f0c1e56 | 808 | * period over which we measure -rt task cpu usage in us. |
fa85ae24 PZ |
809 | * default: 1s |
810 | */ | |
9f0c1e56 | 811 | unsigned int sysctl_sched_rt_period = 1000000; |
fa85ae24 | 812 | |
6892b75e IM |
813 | static __read_mostly int scheduler_running; |
814 | ||
9f0c1e56 PZ |
815 | /* |
816 | * part of the period that we allow rt tasks to run in us. | |
817 | * default: 0.95s | |
818 | */ | |
819 | int sysctl_sched_rt_runtime = 950000; | |
fa85ae24 | 820 | |
d0b27fa7 PZ |
821 | static inline u64 global_rt_period(void) |
822 | { | |
823 | return (u64)sysctl_sched_rt_period * NSEC_PER_USEC; | |
824 | } | |
825 | ||
826 | static inline u64 global_rt_runtime(void) | |
827 | { | |
e26873bb | 828 | if (sysctl_sched_rt_runtime < 0) |
d0b27fa7 PZ |
829 | return RUNTIME_INF; |
830 | ||
831 | return (u64)sysctl_sched_rt_runtime * NSEC_PER_USEC; | |
832 | } | |
fa85ae24 | 833 | |
1da177e4 | 834 | #ifndef prepare_arch_switch |
4866cde0 NP |
835 | # define prepare_arch_switch(next) do { } while (0) |
836 | #endif | |
837 | #ifndef finish_arch_switch | |
838 | # define finish_arch_switch(prev) do { } while (0) | |
839 | #endif | |
840 | ||
051a1d1a DA |
841 | static inline int task_current(struct rq *rq, struct task_struct *p) |
842 | { | |
843 | return rq->curr == p; | |
844 | } | |
845 | ||
4866cde0 | 846 | #ifndef __ARCH_WANT_UNLOCKED_CTXSW |
70b97a7f | 847 | static inline int task_running(struct rq *rq, struct task_struct *p) |
4866cde0 | 848 | { |
051a1d1a | 849 | return task_current(rq, p); |
4866cde0 NP |
850 | } |
851 | ||
70b97a7f | 852 | static inline void prepare_lock_switch(struct rq *rq, struct task_struct *next) |
4866cde0 NP |
853 | { |
854 | } | |
855 | ||
70b97a7f | 856 | static inline void finish_lock_switch(struct rq *rq, struct task_struct *prev) |
4866cde0 | 857 | { |
da04c035 IM |
858 | #ifdef CONFIG_DEBUG_SPINLOCK |
859 | /* this is a valid case when another task releases the spinlock */ | |
860 | rq->lock.owner = current; | |
861 | #endif | |
8a25d5de IM |
862 | /* |
863 | * If we are tracking spinlock dependencies then we have to | |
864 | * fix up the runqueue lock - which gets 'carried over' from | |
865 | * prev into current: | |
866 | */ | |
867 | spin_acquire(&rq->lock.dep_map, 0, 0, _THIS_IP_); | |
868 | ||
4866cde0 NP |
869 | spin_unlock_irq(&rq->lock); |
870 | } | |
871 | ||
872 | #else /* __ARCH_WANT_UNLOCKED_CTXSW */ | |
70b97a7f | 873 | static inline int task_running(struct rq *rq, struct task_struct *p) |
4866cde0 NP |
874 | { |
875 | #ifdef CONFIG_SMP | |
876 | return p->oncpu; | |
877 | #else | |
051a1d1a | 878 | return task_current(rq, p); |
4866cde0 NP |
879 | #endif |
880 | } | |
881 | ||
70b97a7f | 882 | static inline void prepare_lock_switch(struct rq *rq, struct task_struct *next) |
4866cde0 NP |
883 | { |
884 | #ifdef CONFIG_SMP | |
885 | /* | |
886 | * We can optimise this out completely for !SMP, because the | |
887 | * SMP rebalancing from interrupt is the only thing that cares | |
888 | * here. | |
889 | */ | |
890 | next->oncpu = 1; | |
891 | #endif | |
892 | #ifdef __ARCH_WANT_INTERRUPTS_ON_CTXSW | |
893 | spin_unlock_irq(&rq->lock); | |
894 | #else | |
895 | spin_unlock(&rq->lock); | |
896 | #endif | |
897 | } | |
898 | ||
70b97a7f | 899 | static inline void finish_lock_switch(struct rq *rq, struct task_struct *prev) |
4866cde0 NP |
900 | { |
901 | #ifdef CONFIG_SMP | |
902 | /* | |
903 | * After ->oncpu is cleared, the task can be moved to a different CPU. | |
904 | * We must ensure this doesn't happen until the switch is completely | |
905 | * finished. | |
906 | */ | |
907 | smp_wmb(); | |
908 | prev->oncpu = 0; | |
909 | #endif | |
910 | #ifndef __ARCH_WANT_INTERRUPTS_ON_CTXSW | |
911 | local_irq_enable(); | |
1da177e4 | 912 | #endif |
4866cde0 NP |
913 | } |
914 | #endif /* __ARCH_WANT_UNLOCKED_CTXSW */ | |
1da177e4 | 915 | |
b29739f9 IM |
916 | /* |
917 | * __task_rq_lock - lock the runqueue a given task resides on. | |
918 | * Must be called interrupts disabled. | |
919 | */ | |
70b97a7f | 920 | static inline struct rq *__task_rq_lock(struct task_struct *p) |
b29739f9 IM |
921 | __acquires(rq->lock) |
922 | { | |
3a5c359a AK |
923 | for (;;) { |
924 | struct rq *rq = task_rq(p); | |
925 | spin_lock(&rq->lock); | |
926 | if (likely(rq == task_rq(p))) | |
927 | return rq; | |
b29739f9 | 928 | spin_unlock(&rq->lock); |
b29739f9 | 929 | } |
b29739f9 IM |
930 | } |
931 | ||
1da177e4 LT |
932 | /* |
933 | * task_rq_lock - lock the runqueue a given task resides on and disable | |
41a2d6cf | 934 | * interrupts. Note the ordering: we can safely lookup the task_rq without |
1da177e4 LT |
935 | * explicitly disabling preemption. |
936 | */ | |
70b97a7f | 937 | static struct rq *task_rq_lock(struct task_struct *p, unsigned long *flags) |
1da177e4 LT |
938 | __acquires(rq->lock) |
939 | { | |
70b97a7f | 940 | struct rq *rq; |
1da177e4 | 941 | |
3a5c359a AK |
942 | for (;;) { |
943 | local_irq_save(*flags); | |
944 | rq = task_rq(p); | |
945 | spin_lock(&rq->lock); | |
946 | if (likely(rq == task_rq(p))) | |
947 | return rq; | |
1da177e4 | 948 | spin_unlock_irqrestore(&rq->lock, *flags); |
1da177e4 | 949 | } |
1da177e4 LT |
950 | } |
951 | ||
ad474cac ON |
952 | void task_rq_unlock_wait(struct task_struct *p) |
953 | { | |
954 | struct rq *rq = task_rq(p); | |
955 | ||
956 | smp_mb(); /* spin-unlock-wait is not a full memory barrier */ | |
957 | spin_unlock_wait(&rq->lock); | |
958 | } | |
959 | ||
a9957449 | 960 | static void __task_rq_unlock(struct rq *rq) |
b29739f9 IM |
961 | __releases(rq->lock) |
962 | { | |
963 | spin_unlock(&rq->lock); | |
964 | } | |
965 | ||
70b97a7f | 966 | static inline void task_rq_unlock(struct rq *rq, unsigned long *flags) |
1da177e4 LT |
967 | __releases(rq->lock) |
968 | { | |
969 | spin_unlock_irqrestore(&rq->lock, *flags); | |
970 | } | |
971 | ||
1da177e4 | 972 | /* |
cc2a73b5 | 973 | * this_rq_lock - lock this runqueue and disable interrupts. |
1da177e4 | 974 | */ |
a9957449 | 975 | static struct rq *this_rq_lock(void) |
1da177e4 LT |
976 | __acquires(rq->lock) |
977 | { | |
70b97a7f | 978 | struct rq *rq; |
1da177e4 LT |
979 | |
980 | local_irq_disable(); | |
981 | rq = this_rq(); | |
982 | spin_lock(&rq->lock); | |
983 | ||
984 | return rq; | |
985 | } | |
986 | ||
8f4d37ec PZ |
987 | #ifdef CONFIG_SCHED_HRTICK |
988 | /* | |
989 | * Use HR-timers to deliver accurate preemption points. | |
990 | * | |
991 | * Its all a bit involved since we cannot program an hrt while holding the | |
992 | * rq->lock. So what we do is store a state in in rq->hrtick_* and ask for a | |
993 | * reschedule event. | |
994 | * | |
995 | * When we get rescheduled we reprogram the hrtick_timer outside of the | |
996 | * rq->lock. | |
997 | */ | |
8f4d37ec PZ |
998 | |
999 | /* | |
1000 | * Use hrtick when: | |
1001 | * - enabled by features | |
1002 | * - hrtimer is actually high res | |
1003 | */ | |
1004 | static inline int hrtick_enabled(struct rq *rq) | |
1005 | { | |
1006 | if (!sched_feat(HRTICK)) | |
1007 | return 0; | |
ba42059f | 1008 | if (!cpu_active(cpu_of(rq))) |
b328ca18 | 1009 | return 0; |
8f4d37ec PZ |
1010 | return hrtimer_is_hres_active(&rq->hrtick_timer); |
1011 | } | |
1012 | ||
8f4d37ec PZ |
1013 | static void hrtick_clear(struct rq *rq) |
1014 | { | |
1015 | if (hrtimer_active(&rq->hrtick_timer)) | |
1016 | hrtimer_cancel(&rq->hrtick_timer); | |
1017 | } | |
1018 | ||
8f4d37ec PZ |
1019 | /* |
1020 | * High-resolution timer tick. | |
1021 | * Runs from hardirq context with interrupts disabled. | |
1022 | */ | |
1023 | static enum hrtimer_restart hrtick(struct hrtimer *timer) | |
1024 | { | |
1025 | struct rq *rq = container_of(timer, struct rq, hrtick_timer); | |
1026 | ||
1027 | WARN_ON_ONCE(cpu_of(rq) != smp_processor_id()); | |
1028 | ||
1029 | spin_lock(&rq->lock); | |
3e51f33f | 1030 | update_rq_clock(rq); |
8f4d37ec PZ |
1031 | rq->curr->sched_class->task_tick(rq, rq->curr, 1); |
1032 | spin_unlock(&rq->lock); | |
1033 | ||
1034 | return HRTIMER_NORESTART; | |
1035 | } | |
1036 | ||
95e904c7 | 1037 | #ifdef CONFIG_SMP |
31656519 PZ |
1038 | /* |
1039 | * called from hardirq (IPI) context | |
1040 | */ | |
1041 | static void __hrtick_start(void *arg) | |
b328ca18 | 1042 | { |
31656519 | 1043 | struct rq *rq = arg; |
b328ca18 | 1044 | |
31656519 PZ |
1045 | spin_lock(&rq->lock); |
1046 | hrtimer_restart(&rq->hrtick_timer); | |
1047 | rq->hrtick_csd_pending = 0; | |
1048 | spin_unlock(&rq->lock); | |
b328ca18 PZ |
1049 | } |
1050 | ||
31656519 PZ |
1051 | /* |
1052 | * Called to set the hrtick timer state. | |
1053 | * | |
1054 | * called with rq->lock held and irqs disabled | |
1055 | */ | |
1056 | static void hrtick_start(struct rq *rq, u64 delay) | |
b328ca18 | 1057 | { |
31656519 PZ |
1058 | struct hrtimer *timer = &rq->hrtick_timer; |
1059 | ktime_t time = ktime_add_ns(timer->base->get_time(), delay); | |
b328ca18 | 1060 | |
cc584b21 | 1061 | hrtimer_set_expires(timer, time); |
31656519 PZ |
1062 | |
1063 | if (rq == this_rq()) { | |
1064 | hrtimer_restart(timer); | |
1065 | } else if (!rq->hrtick_csd_pending) { | |
1066 | __smp_call_function_single(cpu_of(rq), &rq->hrtick_csd); | |
1067 | rq->hrtick_csd_pending = 1; | |
1068 | } | |
b328ca18 PZ |
1069 | } |
1070 | ||
1071 | static int | |
1072 | hotplug_hrtick(struct notifier_block *nfb, unsigned long action, void *hcpu) | |
1073 | { | |
1074 | int cpu = (int)(long)hcpu; | |
1075 | ||
1076 | switch (action) { | |
1077 | case CPU_UP_CANCELED: | |
1078 | case CPU_UP_CANCELED_FROZEN: | |
1079 | case CPU_DOWN_PREPARE: | |
1080 | case CPU_DOWN_PREPARE_FROZEN: | |
1081 | case CPU_DEAD: | |
1082 | case CPU_DEAD_FROZEN: | |
31656519 | 1083 | hrtick_clear(cpu_rq(cpu)); |
b328ca18 PZ |
1084 | return NOTIFY_OK; |
1085 | } | |
1086 | ||
1087 | return NOTIFY_DONE; | |
1088 | } | |
1089 | ||
fa748203 | 1090 | static __init void init_hrtick(void) |
b328ca18 PZ |
1091 | { |
1092 | hotcpu_notifier(hotplug_hrtick, 0); | |
1093 | } | |
31656519 PZ |
1094 | #else |
1095 | /* | |
1096 | * Called to set the hrtick timer state. | |
1097 | * | |
1098 | * called with rq->lock held and irqs disabled | |
1099 | */ | |
1100 | static void hrtick_start(struct rq *rq, u64 delay) | |
1101 | { | |
1102 | hrtimer_start(&rq->hrtick_timer, ns_to_ktime(delay), HRTIMER_MODE_REL); | |
1103 | } | |
b328ca18 | 1104 | |
006c75f1 | 1105 | static inline void init_hrtick(void) |
8f4d37ec | 1106 | { |
8f4d37ec | 1107 | } |
31656519 | 1108 | #endif /* CONFIG_SMP */ |
8f4d37ec | 1109 | |
31656519 | 1110 | static void init_rq_hrtick(struct rq *rq) |
8f4d37ec | 1111 | { |
31656519 PZ |
1112 | #ifdef CONFIG_SMP |
1113 | rq->hrtick_csd_pending = 0; | |
8f4d37ec | 1114 | |
31656519 PZ |
1115 | rq->hrtick_csd.flags = 0; |
1116 | rq->hrtick_csd.func = __hrtick_start; | |
1117 | rq->hrtick_csd.info = rq; | |
1118 | #endif | |
8f4d37ec | 1119 | |
31656519 PZ |
1120 | hrtimer_init(&rq->hrtick_timer, CLOCK_MONOTONIC, HRTIMER_MODE_REL); |
1121 | rq->hrtick_timer.function = hrtick; | |
ccc7dadf | 1122 | rq->hrtick_timer.cb_mode = HRTIMER_CB_IRQSAFE_PERCPU; |
8f4d37ec | 1123 | } |
006c75f1 | 1124 | #else /* CONFIG_SCHED_HRTICK */ |
8f4d37ec PZ |
1125 | static inline void hrtick_clear(struct rq *rq) |
1126 | { | |
1127 | } | |
1128 | ||
8f4d37ec PZ |
1129 | static inline void init_rq_hrtick(struct rq *rq) |
1130 | { | |
1131 | } | |
1132 | ||
b328ca18 PZ |
1133 | static inline void init_hrtick(void) |
1134 | { | |
1135 | } | |
006c75f1 | 1136 | #endif /* CONFIG_SCHED_HRTICK */ |
8f4d37ec | 1137 | |
c24d20db IM |
1138 | /* |
1139 | * resched_task - mark a task 'to be rescheduled now'. | |
1140 | * | |
1141 | * On UP this means the setting of the need_resched flag, on SMP it | |
1142 | * might also involve a cross-CPU call to trigger the scheduler on | |
1143 | * the target CPU. | |
1144 | */ | |
1145 | #ifdef CONFIG_SMP | |
1146 | ||
1147 | #ifndef tsk_is_polling | |
1148 | #define tsk_is_polling(t) test_tsk_thread_flag(t, TIF_POLLING_NRFLAG) | |
1149 | #endif | |
1150 | ||
31656519 | 1151 | static void resched_task(struct task_struct *p) |
c24d20db IM |
1152 | { |
1153 | int cpu; | |
1154 | ||
1155 | assert_spin_locked(&task_rq(p)->lock); | |
1156 | ||
31656519 | 1157 | if (unlikely(test_tsk_thread_flag(p, TIF_NEED_RESCHED))) |
c24d20db IM |
1158 | return; |
1159 | ||
31656519 | 1160 | set_tsk_thread_flag(p, TIF_NEED_RESCHED); |
c24d20db IM |
1161 | |
1162 | cpu = task_cpu(p); | |
1163 | if (cpu == smp_processor_id()) | |
1164 | return; | |
1165 | ||
1166 | /* NEED_RESCHED must be visible before we test polling */ | |
1167 | smp_mb(); | |
1168 | if (!tsk_is_polling(p)) | |
1169 | smp_send_reschedule(cpu); | |
1170 | } | |
1171 | ||
1172 | static void resched_cpu(int cpu) | |
1173 | { | |
1174 | struct rq *rq = cpu_rq(cpu); | |
1175 | unsigned long flags; | |
1176 | ||
1177 | if (!spin_trylock_irqsave(&rq->lock, flags)) | |
1178 | return; | |
1179 | resched_task(cpu_curr(cpu)); | |
1180 | spin_unlock_irqrestore(&rq->lock, flags); | |
1181 | } | |
06d8308c TG |
1182 | |
1183 | #ifdef CONFIG_NO_HZ | |
1184 | /* | |
1185 | * When add_timer_on() enqueues a timer into the timer wheel of an | |
1186 | * idle CPU then this timer might expire before the next timer event | |
1187 | * which is scheduled to wake up that CPU. In case of a completely | |
1188 | * idle system the next event might even be infinite time into the | |
1189 | * future. wake_up_idle_cpu() ensures that the CPU is woken up and | |
1190 | * leaves the inner idle loop so the newly added timer is taken into | |
1191 | * account when the CPU goes back to idle and evaluates the timer | |
1192 | * wheel for the next timer event. | |
1193 | */ | |
1194 | void wake_up_idle_cpu(int cpu) | |
1195 | { | |
1196 | struct rq *rq = cpu_rq(cpu); | |
1197 | ||
1198 | if (cpu == smp_processor_id()) | |
1199 | return; | |
1200 | ||
1201 | /* | |
1202 | * This is safe, as this function is called with the timer | |
1203 | * wheel base lock of (cpu) held. When the CPU is on the way | |
1204 | * to idle and has not yet set rq->curr to idle then it will | |
1205 | * be serialized on the timer wheel base lock and take the new | |
1206 | * timer into account automatically. | |
1207 | */ | |
1208 | if (rq->curr != rq->idle) | |
1209 | return; | |
1210 | ||
1211 | /* | |
1212 | * We can set TIF_RESCHED on the idle task of the other CPU | |
1213 | * lockless. The worst case is that the other CPU runs the | |
1214 | * idle task through an additional NOOP schedule() | |
1215 | */ | |
1216 | set_tsk_thread_flag(rq->idle, TIF_NEED_RESCHED); | |
1217 | ||
1218 | /* NEED_RESCHED must be visible before we test polling */ | |
1219 | smp_mb(); | |
1220 | if (!tsk_is_polling(rq->idle)) | |
1221 | smp_send_reschedule(cpu); | |
1222 | } | |
6d6bc0ad | 1223 | #endif /* CONFIG_NO_HZ */ |
06d8308c | 1224 | |
6d6bc0ad | 1225 | #else /* !CONFIG_SMP */ |
31656519 | 1226 | static void resched_task(struct task_struct *p) |
c24d20db IM |
1227 | { |
1228 | assert_spin_locked(&task_rq(p)->lock); | |
31656519 | 1229 | set_tsk_need_resched(p); |
c24d20db | 1230 | } |
6d6bc0ad | 1231 | #endif /* CONFIG_SMP */ |
c24d20db | 1232 | |
45bf76df IM |
1233 | #if BITS_PER_LONG == 32 |
1234 | # define WMULT_CONST (~0UL) | |
1235 | #else | |
1236 | # define WMULT_CONST (1UL << 32) | |
1237 | #endif | |
1238 | ||
1239 | #define WMULT_SHIFT 32 | |
1240 | ||
194081eb IM |
1241 | /* |
1242 | * Shift right and round: | |
1243 | */ | |
cf2ab469 | 1244 | #define SRR(x, y) (((x) + (1UL << ((y) - 1))) >> (y)) |
194081eb | 1245 | |
a7be37ac PZ |
1246 | /* |
1247 | * delta *= weight / lw | |
1248 | */ | |
cb1c4fc9 | 1249 | static unsigned long |
45bf76df IM |
1250 | calc_delta_mine(unsigned long delta_exec, unsigned long weight, |
1251 | struct load_weight *lw) | |
1252 | { | |
1253 | u64 tmp; | |
1254 | ||
7a232e03 LJ |
1255 | if (!lw->inv_weight) { |
1256 | if (BITS_PER_LONG > 32 && unlikely(lw->weight >= WMULT_CONST)) | |
1257 | lw->inv_weight = 1; | |
1258 | else | |
1259 | lw->inv_weight = 1 + (WMULT_CONST-lw->weight/2) | |
1260 | / (lw->weight+1); | |
1261 | } | |
45bf76df IM |
1262 | |
1263 | tmp = (u64)delta_exec * weight; | |
1264 | /* | |
1265 | * Check whether we'd overflow the 64-bit multiplication: | |
1266 | */ | |
194081eb | 1267 | if (unlikely(tmp > WMULT_CONST)) |
cf2ab469 | 1268 | tmp = SRR(SRR(tmp, WMULT_SHIFT/2) * lw->inv_weight, |
194081eb IM |
1269 | WMULT_SHIFT/2); |
1270 | else | |
cf2ab469 | 1271 | tmp = SRR(tmp * lw->inv_weight, WMULT_SHIFT); |
45bf76df | 1272 | |
ecf691da | 1273 | return (unsigned long)min(tmp, (u64)(unsigned long)LONG_MAX); |
45bf76df IM |
1274 | } |
1275 | ||
1091985b | 1276 | static inline void update_load_add(struct load_weight *lw, unsigned long inc) |
45bf76df IM |
1277 | { |
1278 | lw->weight += inc; | |
e89996ae | 1279 | lw->inv_weight = 0; |
45bf76df IM |
1280 | } |
1281 | ||
1091985b | 1282 | static inline void update_load_sub(struct load_weight *lw, unsigned long dec) |
45bf76df IM |
1283 | { |
1284 | lw->weight -= dec; | |
e89996ae | 1285 | lw->inv_weight = 0; |
45bf76df IM |
1286 | } |
1287 | ||
2dd73a4f PW |
1288 | /* |
1289 | * To aid in avoiding the subversion of "niceness" due to uneven distribution | |
1290 | * of tasks with abnormal "nice" values across CPUs the contribution that | |
1291 | * each task makes to its run queue's load is weighted according to its | |
41a2d6cf | 1292 | * scheduling class and "nice" value. For SCHED_NORMAL tasks this is just a |
2dd73a4f PW |
1293 | * scaled version of the new time slice allocation that they receive on time |
1294 | * slice expiry etc. | |
1295 | */ | |
1296 | ||
dd41f596 IM |
1297 | #define WEIGHT_IDLEPRIO 2 |
1298 | #define WMULT_IDLEPRIO (1 << 31) | |
1299 | ||
1300 | /* | |
1301 | * Nice levels are multiplicative, with a gentle 10% change for every | |
1302 | * nice level changed. I.e. when a CPU-bound task goes from nice 0 to | |
1303 | * nice 1, it will get ~10% less CPU time than another CPU-bound task | |
1304 | * that remained on nice 0. | |
1305 | * | |
1306 | * The "10% effect" is relative and cumulative: from _any_ nice level, | |
1307 | * if you go up 1 level, it's -10% CPU usage, if you go down 1 level | |
f9153ee6 IM |
1308 | * it's +10% CPU usage. (to achieve that we use a multiplier of 1.25. |
1309 | * If a task goes up by ~10% and another task goes down by ~10% then | |
1310 | * the relative distance between them is ~25%.) | |
dd41f596 IM |
1311 | */ |
1312 | static const int prio_to_weight[40] = { | |
254753dc IM |
1313 | /* -20 */ 88761, 71755, 56483, 46273, 36291, |
1314 | /* -15 */ 29154, 23254, 18705, 14949, 11916, | |
1315 | /* -10 */ 9548, 7620, 6100, 4904, 3906, | |
1316 | /* -5 */ 3121, 2501, 1991, 1586, 1277, | |
1317 | /* 0 */ 1024, 820, 655, 526, 423, | |
1318 | /* 5 */ 335, 272, 215, 172, 137, | |
1319 | /* 10 */ 110, 87, 70, 56, 45, | |
1320 | /* 15 */ 36, 29, 23, 18, 15, | |
dd41f596 IM |
1321 | }; |
1322 | ||
5714d2de IM |
1323 | /* |
1324 | * Inverse (2^32/x) values of the prio_to_weight[] array, precalculated. | |
1325 | * | |
1326 | * In cases where the weight does not change often, we can use the | |
1327 | * precalculated inverse to speed up arithmetics by turning divisions | |
1328 | * into multiplications: | |
1329 | */ | |
dd41f596 | 1330 | static const u32 prio_to_wmult[40] = { |
254753dc IM |
1331 | /* -20 */ 48388, 59856, 76040, 92818, 118348, |
1332 | /* -15 */ 147320, 184698, 229616, 287308, 360437, | |
1333 | /* -10 */ 449829, 563644, 704093, 875809, 1099582, | |
1334 | /* -5 */ 1376151, 1717300, 2157191, 2708050, 3363326, | |
1335 | /* 0 */ 4194304, 5237765, 6557202, 8165337, 10153587, | |
1336 | /* 5 */ 12820798, 15790321, 19976592, 24970740, 31350126, | |
1337 | /* 10 */ 39045157, 49367440, 61356676, 76695844, 95443717, | |
1338 | /* 15 */ 119304647, 148102320, 186737708, 238609294, 286331153, | |
dd41f596 | 1339 | }; |
2dd73a4f | 1340 | |
dd41f596 IM |
1341 | static void activate_task(struct rq *rq, struct task_struct *p, int wakeup); |
1342 | ||
1343 | /* | |
1344 | * runqueue iterator, to support SMP load-balancing between different | |
1345 | * scheduling classes, without having to expose their internal data | |
1346 | * structures to the load-balancing proper: | |
1347 | */ | |
1348 | struct rq_iterator { | |
1349 | void *arg; | |
1350 | struct task_struct *(*start)(void *); | |
1351 | struct task_struct *(*next)(void *); | |
1352 | }; | |
1353 | ||
e1d1484f PW |
1354 | #ifdef CONFIG_SMP |
1355 | static unsigned long | |
1356 | balance_tasks(struct rq *this_rq, int this_cpu, struct rq *busiest, | |
1357 | unsigned long max_load_move, struct sched_domain *sd, | |
1358 | enum cpu_idle_type idle, int *all_pinned, | |
1359 | int *this_best_prio, struct rq_iterator *iterator); | |
1360 | ||
1361 | static int | |
1362 | iter_move_one_task(struct rq *this_rq, int this_cpu, struct rq *busiest, | |
1363 | struct sched_domain *sd, enum cpu_idle_type idle, | |
1364 | struct rq_iterator *iterator); | |
e1d1484f | 1365 | #endif |
dd41f596 | 1366 | |
d842de87 SV |
1367 | #ifdef CONFIG_CGROUP_CPUACCT |
1368 | static void cpuacct_charge(struct task_struct *tsk, u64 cputime); | |
1369 | #else | |
1370 | static inline void cpuacct_charge(struct task_struct *tsk, u64 cputime) {} | |
1371 | #endif | |
1372 | ||
18d95a28 PZ |
1373 | static inline void inc_cpu_load(struct rq *rq, unsigned long load) |
1374 | { | |
1375 | update_load_add(&rq->load, load); | |
1376 | } | |
1377 | ||
1378 | static inline void dec_cpu_load(struct rq *rq, unsigned long load) | |
1379 | { | |
1380 | update_load_sub(&rq->load, load); | |
1381 | } | |
1382 | ||
7940ca36 | 1383 | #if (defined(CONFIG_SMP) && defined(CONFIG_FAIR_GROUP_SCHED)) || defined(CONFIG_RT_GROUP_SCHED) |
eb755805 | 1384 | typedef int (*tg_visitor)(struct task_group *, void *); |
c09595f6 PZ |
1385 | |
1386 | /* | |
1387 | * Iterate the full tree, calling @down when first entering a node and @up when | |
1388 | * leaving it for the final time. | |
1389 | */ | |
eb755805 | 1390 | static int walk_tg_tree(tg_visitor down, tg_visitor up, void *data) |
c09595f6 PZ |
1391 | { |
1392 | struct task_group *parent, *child; | |
eb755805 | 1393 | int ret; |
c09595f6 PZ |
1394 | |
1395 | rcu_read_lock(); | |
1396 | parent = &root_task_group; | |
1397 | down: | |
eb755805 PZ |
1398 | ret = (*down)(parent, data); |
1399 | if (ret) | |
1400 | goto out_unlock; | |
c09595f6 PZ |
1401 | list_for_each_entry_rcu(child, &parent->children, siblings) { |
1402 | parent = child; | |
1403 | goto down; | |
1404 | ||
1405 | up: | |
1406 | continue; | |
1407 | } | |
eb755805 PZ |
1408 | ret = (*up)(parent, data); |
1409 | if (ret) | |
1410 | goto out_unlock; | |
c09595f6 PZ |
1411 | |
1412 | child = parent; | |
1413 | parent = parent->parent; | |
1414 | if (parent) | |
1415 | goto up; | |
eb755805 | 1416 | out_unlock: |
c09595f6 | 1417 | rcu_read_unlock(); |
eb755805 PZ |
1418 | |
1419 | return ret; | |
c09595f6 PZ |
1420 | } |
1421 | ||
eb755805 PZ |
1422 | static int tg_nop(struct task_group *tg, void *data) |
1423 | { | |
1424 | return 0; | |
c09595f6 | 1425 | } |
eb755805 PZ |
1426 | #endif |
1427 | ||
1428 | #ifdef CONFIG_SMP | |
1429 | static unsigned long source_load(int cpu, int type); | |
1430 | static unsigned long target_load(int cpu, int type); | |
1431 | static int task_hot(struct task_struct *p, u64 now, struct sched_domain *sd); | |
1432 | ||
1433 | static unsigned long cpu_avg_load_per_task(int cpu) | |
1434 | { | |
1435 | struct rq *rq = cpu_rq(cpu); | |
1436 | ||
1437 | if (rq->nr_running) | |
1438 | rq->avg_load_per_task = rq->load.weight / rq->nr_running; | |
a2d47777 BS |
1439 | else |
1440 | rq->avg_load_per_task = 0; | |
eb755805 PZ |
1441 | |
1442 | return rq->avg_load_per_task; | |
1443 | } | |
1444 | ||
1445 | #ifdef CONFIG_FAIR_GROUP_SCHED | |
c09595f6 | 1446 | |
c09595f6 PZ |
1447 | static void __set_se_shares(struct sched_entity *se, unsigned long shares); |
1448 | ||
1449 | /* | |
1450 | * Calculate and set the cpu's group shares. | |
1451 | */ | |
1452 | static void | |
ffda12a1 PZ |
1453 | update_group_shares_cpu(struct task_group *tg, int cpu, |
1454 | unsigned long sd_shares, unsigned long sd_rq_weight) | |
18d95a28 | 1455 | { |
c09595f6 PZ |
1456 | int boost = 0; |
1457 | unsigned long shares; | |
1458 | unsigned long rq_weight; | |
1459 | ||
c8cba857 | 1460 | if (!tg->se[cpu]) |
c09595f6 PZ |
1461 | return; |
1462 | ||
c8cba857 | 1463 | rq_weight = tg->cfs_rq[cpu]->load.weight; |
c09595f6 PZ |
1464 | |
1465 | /* | |
1466 | * If there are currently no tasks on the cpu pretend there is one of | |
1467 | * average load so that when a new task gets to run here it will not | |
1468 | * get delayed by group starvation. | |
1469 | */ | |
1470 | if (!rq_weight) { | |
1471 | boost = 1; | |
1472 | rq_weight = NICE_0_LOAD; | |
1473 | } | |
1474 | ||
c8cba857 PZ |
1475 | if (unlikely(rq_weight > sd_rq_weight)) |
1476 | rq_weight = sd_rq_weight; | |
1477 | ||
c09595f6 PZ |
1478 | /* |
1479 | * \Sum shares * rq_weight | |
1480 | * shares = ----------------------- | |
1481 | * \Sum rq_weight | |
1482 | * | |
1483 | */ | |
c8cba857 | 1484 | shares = (sd_shares * rq_weight) / (sd_rq_weight + 1); |
ffda12a1 | 1485 | shares = clamp_t(unsigned long, shares, MIN_SHARES, MAX_SHARES); |
c09595f6 | 1486 | |
ffda12a1 PZ |
1487 | if (abs(shares - tg->se[cpu]->load.weight) > |
1488 | sysctl_sched_shares_thresh) { | |
1489 | struct rq *rq = cpu_rq(cpu); | |
1490 | unsigned long flags; | |
c09595f6 | 1491 | |
ffda12a1 PZ |
1492 | spin_lock_irqsave(&rq->lock, flags); |
1493 | /* | |
1494 | * record the actual number of shares, not the boosted amount. | |
1495 | */ | |
1496 | tg->cfs_rq[cpu]->shares = boost ? 0 : shares; | |
1497 | tg->cfs_rq[cpu]->rq_weight = rq_weight; | |
c09595f6 | 1498 | |
ffda12a1 PZ |
1499 | __set_se_shares(tg->se[cpu], shares); |
1500 | spin_unlock_irqrestore(&rq->lock, flags); | |
1501 | } | |
18d95a28 | 1502 | } |
c09595f6 PZ |
1503 | |
1504 | /* | |
c8cba857 PZ |
1505 | * Re-compute the task group their per cpu shares over the given domain. |
1506 | * This needs to be done in a bottom-up fashion because the rq weight of a | |
1507 | * parent group depends on the shares of its child groups. | |
c09595f6 | 1508 | */ |
eb755805 | 1509 | static int tg_shares_up(struct task_group *tg, void *data) |
c09595f6 | 1510 | { |
c8cba857 PZ |
1511 | unsigned long rq_weight = 0; |
1512 | unsigned long shares = 0; | |
eb755805 | 1513 | struct sched_domain *sd = data; |
c8cba857 | 1514 | int i; |
c09595f6 | 1515 | |
c8cba857 PZ |
1516 | for_each_cpu_mask(i, sd->span) { |
1517 | rq_weight += tg->cfs_rq[i]->load.weight; | |
1518 | shares += tg->cfs_rq[i]->shares; | |
c09595f6 | 1519 | } |
c09595f6 | 1520 | |
c8cba857 PZ |
1521 | if ((!shares && rq_weight) || shares > tg->shares) |
1522 | shares = tg->shares; | |
1523 | ||
1524 | if (!sd->parent || !(sd->parent->flags & SD_LOAD_BALANCE)) | |
1525 | shares = tg->shares; | |
c09595f6 | 1526 | |
cd80917e PZ |
1527 | if (!rq_weight) |
1528 | rq_weight = cpus_weight(sd->span) * NICE_0_LOAD; | |
1529 | ||
ffda12a1 PZ |
1530 | for_each_cpu_mask(i, sd->span) |
1531 | update_group_shares_cpu(tg, i, shares, rq_weight); | |
eb755805 PZ |
1532 | |
1533 | return 0; | |
c09595f6 PZ |
1534 | } |
1535 | ||
1536 | /* | |
c8cba857 PZ |
1537 | * Compute the cpu's hierarchical load factor for each task group. |
1538 | * This needs to be done in a top-down fashion because the load of a child | |
1539 | * group is a fraction of its parents load. | |
c09595f6 | 1540 | */ |
eb755805 | 1541 | static int tg_load_down(struct task_group *tg, void *data) |
c09595f6 | 1542 | { |
c8cba857 | 1543 | unsigned long load; |
eb755805 | 1544 | long cpu = (long)data; |
c09595f6 | 1545 | |
c8cba857 PZ |
1546 | if (!tg->parent) { |
1547 | load = cpu_rq(cpu)->load.weight; | |
1548 | } else { | |
1549 | load = tg->parent->cfs_rq[cpu]->h_load; | |
1550 | load *= tg->cfs_rq[cpu]->shares; | |
1551 | load /= tg->parent->cfs_rq[cpu]->load.weight + 1; | |
1552 | } | |
c09595f6 | 1553 | |
c8cba857 | 1554 | tg->cfs_rq[cpu]->h_load = load; |
c09595f6 | 1555 | |
eb755805 | 1556 | return 0; |
c09595f6 PZ |
1557 | } |
1558 | ||
c8cba857 | 1559 | static void update_shares(struct sched_domain *sd) |
4d8d595d | 1560 | { |
2398f2c6 PZ |
1561 | u64 now = cpu_clock(raw_smp_processor_id()); |
1562 | s64 elapsed = now - sd->last_update; | |
1563 | ||
1564 | if (elapsed >= (s64)(u64)sysctl_sched_shares_ratelimit) { | |
1565 | sd->last_update = now; | |
eb755805 | 1566 | walk_tg_tree(tg_nop, tg_shares_up, sd); |
2398f2c6 | 1567 | } |
4d8d595d PZ |
1568 | } |
1569 | ||
3e5459b4 PZ |
1570 | static void update_shares_locked(struct rq *rq, struct sched_domain *sd) |
1571 | { | |
1572 | spin_unlock(&rq->lock); | |
1573 | update_shares(sd); | |
1574 | spin_lock(&rq->lock); | |
1575 | } | |
1576 | ||
eb755805 | 1577 | static void update_h_load(long cpu) |
c09595f6 | 1578 | { |
eb755805 | 1579 | walk_tg_tree(tg_load_down, tg_nop, (void *)cpu); |
c09595f6 PZ |
1580 | } |
1581 | ||
c09595f6 PZ |
1582 | #else |
1583 | ||
c8cba857 | 1584 | static inline void update_shares(struct sched_domain *sd) |
4d8d595d PZ |
1585 | { |
1586 | } | |
1587 | ||
3e5459b4 PZ |
1588 | static inline void update_shares_locked(struct rq *rq, struct sched_domain *sd) |
1589 | { | |
1590 | } | |
1591 | ||
18d95a28 PZ |
1592 | #endif |
1593 | ||
18d95a28 PZ |
1594 | #endif |
1595 | ||
30432094 | 1596 | #ifdef CONFIG_FAIR_GROUP_SCHED |
34e83e85 IM |
1597 | static void cfs_rq_set_shares(struct cfs_rq *cfs_rq, unsigned long shares) |
1598 | { | |
30432094 | 1599 | #ifdef CONFIG_SMP |
34e83e85 IM |
1600 | cfs_rq->shares = shares; |
1601 | #endif | |
1602 | } | |
30432094 | 1603 | #endif |
e7693a36 | 1604 | |
dd41f596 | 1605 | #include "sched_stats.h" |
dd41f596 | 1606 | #include "sched_idletask.c" |
5522d5d5 IM |
1607 | #include "sched_fair.c" |
1608 | #include "sched_rt.c" | |
dd41f596 IM |
1609 | #ifdef CONFIG_SCHED_DEBUG |
1610 | # include "sched_debug.c" | |
1611 | #endif | |
1612 | ||
1613 | #define sched_class_highest (&rt_sched_class) | |
1f11eb6a GH |
1614 | #define for_each_class(class) \ |
1615 | for (class = sched_class_highest; class; class = class->next) | |
dd41f596 | 1616 | |
c09595f6 | 1617 | static void inc_nr_running(struct rq *rq) |
9c217245 IM |
1618 | { |
1619 | rq->nr_running++; | |
9c217245 IM |
1620 | } |
1621 | ||
c09595f6 | 1622 | static void dec_nr_running(struct rq *rq) |
9c217245 IM |
1623 | { |
1624 | rq->nr_running--; | |
9c217245 IM |
1625 | } |
1626 | ||
45bf76df IM |
1627 | static void set_load_weight(struct task_struct *p) |
1628 | { | |
1629 | if (task_has_rt_policy(p)) { | |
dd41f596 IM |
1630 | p->se.load.weight = prio_to_weight[0] * 2; |
1631 | p->se.load.inv_weight = prio_to_wmult[0] >> 1; | |
1632 | return; | |
1633 | } | |
45bf76df | 1634 | |
dd41f596 IM |
1635 | /* |
1636 | * SCHED_IDLE tasks get minimal weight: | |
1637 | */ | |
1638 | if (p->policy == SCHED_IDLE) { | |
1639 | p->se.load.weight = WEIGHT_IDLEPRIO; | |
1640 | p->se.load.inv_weight = WMULT_IDLEPRIO; | |
1641 | return; | |
1642 | } | |
71f8bd46 | 1643 | |
dd41f596 IM |
1644 | p->se.load.weight = prio_to_weight[p->static_prio - MAX_RT_PRIO]; |
1645 | p->se.load.inv_weight = prio_to_wmult[p->static_prio - MAX_RT_PRIO]; | |
71f8bd46 IM |
1646 | } |
1647 | ||
2087a1ad GH |
1648 | static void update_avg(u64 *avg, u64 sample) |
1649 | { | |
1650 | s64 diff = sample - *avg; | |
1651 | *avg += diff >> 3; | |
1652 | } | |
1653 | ||
8159f87e | 1654 | static void enqueue_task(struct rq *rq, struct task_struct *p, int wakeup) |
71f8bd46 | 1655 | { |
dd41f596 | 1656 | sched_info_queued(p); |
fd390f6a | 1657 | p->sched_class->enqueue_task(rq, p, wakeup); |
dd41f596 | 1658 | p->se.on_rq = 1; |
71f8bd46 IM |
1659 | } |
1660 | ||
69be72c1 | 1661 | static void dequeue_task(struct rq *rq, struct task_struct *p, int sleep) |
71f8bd46 | 1662 | { |
2087a1ad GH |
1663 | if (sleep && p->se.last_wakeup) { |
1664 | update_avg(&p->se.avg_overlap, | |
1665 | p->se.sum_exec_runtime - p->se.last_wakeup); | |
1666 | p->se.last_wakeup = 0; | |
1667 | } | |
1668 | ||
46ac22ba | 1669 | sched_info_dequeued(p); |
f02231e5 | 1670 | p->sched_class->dequeue_task(rq, p, sleep); |
dd41f596 | 1671 | p->se.on_rq = 0; |
71f8bd46 IM |
1672 | } |
1673 | ||
14531189 | 1674 | /* |
dd41f596 | 1675 | * __normal_prio - return the priority that is based on the static prio |
14531189 | 1676 | */ |
14531189 IM |
1677 | static inline int __normal_prio(struct task_struct *p) |
1678 | { | |
dd41f596 | 1679 | return p->static_prio; |
14531189 IM |
1680 | } |
1681 | ||
b29739f9 IM |
1682 | /* |
1683 | * Calculate the expected normal priority: i.e. priority | |
1684 | * without taking RT-inheritance into account. Might be | |
1685 | * boosted by interactivity modifiers. Changes upon fork, | |
1686 | * setprio syscalls, and whenever the interactivity | |
1687 | * estimator recalculates. | |
1688 | */ | |
36c8b586 | 1689 | static inline int normal_prio(struct task_struct *p) |
b29739f9 IM |
1690 | { |
1691 | int prio; | |
1692 | ||
e05606d3 | 1693 | if (task_has_rt_policy(p)) |
b29739f9 IM |
1694 | prio = MAX_RT_PRIO-1 - p->rt_priority; |
1695 | else | |
1696 | prio = __normal_prio(p); | |
1697 | return prio; | |
1698 | } | |
1699 | ||
1700 | /* | |
1701 | * Calculate the current priority, i.e. the priority | |
1702 | * taken into account by the scheduler. This value might | |
1703 | * be boosted by RT tasks, or might be boosted by | |
1704 | * interactivity modifiers. Will be RT if the task got | |
1705 | * RT-boosted. If not then it returns p->normal_prio. | |
1706 | */ | |
36c8b586 | 1707 | static int effective_prio(struct task_struct *p) |
b29739f9 IM |
1708 | { |
1709 | p->normal_prio = normal_prio(p); | |
1710 | /* | |
1711 | * If we are RT tasks or we were boosted to RT priority, | |
1712 | * keep the priority unchanged. Otherwise, update priority | |
1713 | * to the normal priority: | |
1714 | */ | |
1715 | if (!rt_prio(p->prio)) | |
1716 | return p->normal_prio; | |
1717 | return p->prio; | |
1718 | } | |
1719 | ||
1da177e4 | 1720 | /* |
dd41f596 | 1721 | * activate_task - move a task to the runqueue. |
1da177e4 | 1722 | */ |
dd41f596 | 1723 | static void activate_task(struct rq *rq, struct task_struct *p, int wakeup) |
1da177e4 | 1724 | { |
d9514f6c | 1725 | if (task_contributes_to_load(p)) |
dd41f596 | 1726 | rq->nr_uninterruptible--; |
1da177e4 | 1727 | |
8159f87e | 1728 | enqueue_task(rq, p, wakeup); |
c09595f6 | 1729 | inc_nr_running(rq); |
1da177e4 LT |
1730 | } |
1731 | ||
1da177e4 LT |
1732 | /* |
1733 | * deactivate_task - remove a task from the runqueue. | |
1734 | */ | |
2e1cb74a | 1735 | static void deactivate_task(struct rq *rq, struct task_struct *p, int sleep) |
1da177e4 | 1736 | { |
d9514f6c | 1737 | if (task_contributes_to_load(p)) |
dd41f596 IM |
1738 | rq->nr_uninterruptible++; |
1739 | ||
69be72c1 | 1740 | dequeue_task(rq, p, sleep); |
c09595f6 | 1741 | dec_nr_running(rq); |
1da177e4 LT |
1742 | } |
1743 | ||
1da177e4 LT |
1744 | /** |
1745 | * task_curr - is this task currently executing on a CPU? | |
1746 | * @p: the task in question. | |
1747 | */ | |
36c8b586 | 1748 | inline int task_curr(const struct task_struct *p) |
1da177e4 LT |
1749 | { |
1750 | return cpu_curr(task_cpu(p)) == p; | |
1751 | } | |
1752 | ||
dd41f596 IM |
1753 | static inline void __set_task_cpu(struct task_struct *p, unsigned int cpu) |
1754 | { | |
6f505b16 | 1755 | set_task_rq(p, cpu); |
dd41f596 | 1756 | #ifdef CONFIG_SMP |
ce96b5ac DA |
1757 | /* |
1758 | * After ->cpu is set up to a new value, task_rq_lock(p, ...) can be | |
1759 | * successfuly executed on another CPU. We must ensure that updates of | |
1760 | * per-task data have been completed by this moment. | |
1761 | */ | |
1762 | smp_wmb(); | |
dd41f596 | 1763 | task_thread_info(p)->cpu = cpu; |
dd41f596 | 1764 | #endif |
2dd73a4f PW |
1765 | } |
1766 | ||
cb469845 SR |
1767 | static inline void check_class_changed(struct rq *rq, struct task_struct *p, |
1768 | const struct sched_class *prev_class, | |
1769 | int oldprio, int running) | |
1770 | { | |
1771 | if (prev_class != p->sched_class) { | |
1772 | if (prev_class->switched_from) | |
1773 | prev_class->switched_from(rq, p, running); | |
1774 | p->sched_class->switched_to(rq, p, running); | |
1775 | } else | |
1776 | p->sched_class->prio_changed(rq, p, oldprio, running); | |
1777 | } | |
1778 | ||
1da177e4 | 1779 | #ifdef CONFIG_SMP |
c65cc870 | 1780 | |
e958b360 TG |
1781 | /* Used instead of source_load when we know the type == 0 */ |
1782 | static unsigned long weighted_cpuload(const int cpu) | |
1783 | { | |
1784 | return cpu_rq(cpu)->load.weight; | |
1785 | } | |
1786 | ||
cc367732 IM |
1787 | /* |
1788 | * Is this task likely cache-hot: | |
1789 | */ | |
e7693a36 | 1790 | static int |
cc367732 IM |
1791 | task_hot(struct task_struct *p, u64 now, struct sched_domain *sd) |
1792 | { | |
1793 | s64 delta; | |
1794 | ||
f540a608 IM |
1795 | /* |
1796 | * Buddy candidates are cache hot: | |
1797 | */ | |
4793241b PZ |
1798 | if (sched_feat(CACHE_HOT_BUDDY) && |
1799 | (&p->se == cfs_rq_of(&p->se)->next || | |
1800 | &p->se == cfs_rq_of(&p->se)->last)) | |
f540a608 IM |
1801 | return 1; |
1802 | ||
cc367732 IM |
1803 | if (p->sched_class != &fair_sched_class) |
1804 | return 0; | |
1805 | ||
6bc1665b IM |
1806 | if (sysctl_sched_migration_cost == -1) |
1807 | return 1; | |
1808 | if (sysctl_sched_migration_cost == 0) | |
1809 | return 0; | |
1810 | ||
cc367732 IM |
1811 | delta = now - p->se.exec_start; |
1812 | ||
1813 | return delta < (s64)sysctl_sched_migration_cost; | |
1814 | } | |
1815 | ||
1816 | ||
dd41f596 | 1817 | void set_task_cpu(struct task_struct *p, unsigned int new_cpu) |
c65cc870 | 1818 | { |
dd41f596 IM |
1819 | int old_cpu = task_cpu(p); |
1820 | struct rq *old_rq = cpu_rq(old_cpu), *new_rq = cpu_rq(new_cpu); | |
2830cf8c SV |
1821 | struct cfs_rq *old_cfsrq = task_cfs_rq(p), |
1822 | *new_cfsrq = cpu_cfs_rq(old_cfsrq, new_cpu); | |
bbdba7c0 | 1823 | u64 clock_offset; |
dd41f596 IM |
1824 | |
1825 | clock_offset = old_rq->clock - new_rq->clock; | |
6cfb0d5d IM |
1826 | |
1827 | #ifdef CONFIG_SCHEDSTATS | |
1828 | if (p->se.wait_start) | |
1829 | p->se.wait_start -= clock_offset; | |
dd41f596 IM |
1830 | if (p->se.sleep_start) |
1831 | p->se.sleep_start -= clock_offset; | |
1832 | if (p->se.block_start) | |
1833 | p->se.block_start -= clock_offset; | |
cc367732 IM |
1834 | if (old_cpu != new_cpu) { |
1835 | schedstat_inc(p, se.nr_migrations); | |
1836 | if (task_hot(p, old_rq->clock, NULL)) | |
1837 | schedstat_inc(p, se.nr_forced2_migrations); | |
1838 | } | |
6cfb0d5d | 1839 | #endif |
2830cf8c SV |
1840 | p->se.vruntime -= old_cfsrq->min_vruntime - |
1841 | new_cfsrq->min_vruntime; | |
dd41f596 IM |
1842 | |
1843 | __set_task_cpu(p, new_cpu); | |
c65cc870 IM |
1844 | } |
1845 | ||
70b97a7f | 1846 | struct migration_req { |
1da177e4 | 1847 | struct list_head list; |
1da177e4 | 1848 | |
36c8b586 | 1849 | struct task_struct *task; |
1da177e4 LT |
1850 | int dest_cpu; |
1851 | ||
1da177e4 | 1852 | struct completion done; |
70b97a7f | 1853 | }; |
1da177e4 LT |
1854 | |
1855 | /* | |
1856 | * The task's runqueue lock must be held. | |
1857 | * Returns true if you have to wait for migration thread. | |
1858 | */ | |
36c8b586 | 1859 | static int |
70b97a7f | 1860 | migrate_task(struct task_struct *p, int dest_cpu, struct migration_req *req) |
1da177e4 | 1861 | { |
70b97a7f | 1862 | struct rq *rq = task_rq(p); |
1da177e4 LT |
1863 | |
1864 | /* | |
1865 | * If the task is not on a runqueue (and not running), then | |
1866 | * it is sufficient to simply update the task's cpu field. | |
1867 | */ | |
dd41f596 | 1868 | if (!p->se.on_rq && !task_running(rq, p)) { |
1da177e4 LT |
1869 | set_task_cpu(p, dest_cpu); |
1870 | return 0; | |
1871 | } | |
1872 | ||
1873 | init_completion(&req->done); | |
1da177e4 LT |
1874 | req->task = p; |
1875 | req->dest_cpu = dest_cpu; | |
1876 | list_add(&req->list, &rq->migration_queue); | |
48f24c4d | 1877 | |
1da177e4 LT |
1878 | return 1; |
1879 | } | |
1880 | ||
1881 | /* | |
1882 | * wait_task_inactive - wait for a thread to unschedule. | |
1883 | * | |
85ba2d86 RM |
1884 | * If @match_state is nonzero, it's the @p->state value just checked and |
1885 | * not expected to change. If it changes, i.e. @p might have woken up, | |
1886 | * then return zero. When we succeed in waiting for @p to be off its CPU, | |
1887 | * we return a positive number (its total switch count). If a second call | |
1888 | * a short while later returns the same number, the caller can be sure that | |
1889 | * @p has remained unscheduled the whole time. | |
1890 | * | |
1da177e4 LT |
1891 | * The caller must ensure that the task *will* unschedule sometime soon, |
1892 | * else this function might spin for a *long* time. This function can't | |
1893 | * be called with interrupts off, or it may introduce deadlock with | |
1894 | * smp_call_function() if an IPI is sent by the same process we are | |
1895 | * waiting to become inactive. | |
1896 | */ | |
85ba2d86 | 1897 | unsigned long wait_task_inactive(struct task_struct *p, long match_state) |
1da177e4 LT |
1898 | { |
1899 | unsigned long flags; | |
dd41f596 | 1900 | int running, on_rq; |
85ba2d86 | 1901 | unsigned long ncsw; |
70b97a7f | 1902 | struct rq *rq; |
1da177e4 | 1903 | |
3a5c359a AK |
1904 | for (;;) { |
1905 | /* | |
1906 | * We do the initial early heuristics without holding | |
1907 | * any task-queue locks at all. We'll only try to get | |
1908 | * the runqueue lock when things look like they will | |
1909 | * work out! | |
1910 | */ | |
1911 | rq = task_rq(p); | |
fa490cfd | 1912 | |
3a5c359a AK |
1913 | /* |
1914 | * If the task is actively running on another CPU | |
1915 | * still, just relax and busy-wait without holding | |
1916 | * any locks. | |
1917 | * | |
1918 | * NOTE! Since we don't hold any locks, it's not | |
1919 | * even sure that "rq" stays as the right runqueue! | |
1920 | * But we don't care, since "task_running()" will | |
1921 | * return false if the runqueue has changed and p | |
1922 | * is actually now running somewhere else! | |
1923 | */ | |
85ba2d86 RM |
1924 | while (task_running(rq, p)) { |
1925 | if (match_state && unlikely(p->state != match_state)) | |
1926 | return 0; | |
3a5c359a | 1927 | cpu_relax(); |
85ba2d86 | 1928 | } |
fa490cfd | 1929 | |
3a5c359a AK |
1930 | /* |
1931 | * Ok, time to look more closely! We need the rq | |
1932 | * lock now, to be *sure*. If we're wrong, we'll | |
1933 | * just go back and repeat. | |
1934 | */ | |
1935 | rq = task_rq_lock(p, &flags); | |
0a16b607 | 1936 | trace_sched_wait_task(rq, p); |
3a5c359a AK |
1937 | running = task_running(rq, p); |
1938 | on_rq = p->se.on_rq; | |
85ba2d86 | 1939 | ncsw = 0; |
f31e11d8 | 1940 | if (!match_state || p->state == match_state) |
93dcf55f | 1941 | ncsw = p->nvcsw | LONG_MIN; /* sets MSB */ |
3a5c359a | 1942 | task_rq_unlock(rq, &flags); |
fa490cfd | 1943 | |
85ba2d86 RM |
1944 | /* |
1945 | * If it changed from the expected state, bail out now. | |
1946 | */ | |
1947 | if (unlikely(!ncsw)) | |
1948 | break; | |
1949 | ||
3a5c359a AK |
1950 | /* |
1951 | * Was it really running after all now that we | |
1952 | * checked with the proper locks actually held? | |
1953 | * | |
1954 | * Oops. Go back and try again.. | |
1955 | */ | |
1956 | if (unlikely(running)) { | |
1957 | cpu_relax(); | |
1958 | continue; | |
1959 | } | |
fa490cfd | 1960 | |
3a5c359a AK |
1961 | /* |
1962 | * It's not enough that it's not actively running, | |
1963 | * it must be off the runqueue _entirely_, and not | |
1964 | * preempted! | |
1965 | * | |
1966 | * So if it wa still runnable (but just not actively | |
1967 | * running right now), it's preempted, and we should | |
1968 | * yield - it could be a while. | |
1969 | */ | |
1970 | if (unlikely(on_rq)) { | |
1971 | schedule_timeout_uninterruptible(1); | |
1972 | continue; | |
1973 | } | |
fa490cfd | 1974 | |
3a5c359a AK |
1975 | /* |
1976 | * Ahh, all good. It wasn't running, and it wasn't | |
1977 | * runnable, which means that it will never become | |
1978 | * running in the future either. We're all done! | |
1979 | */ | |
1980 | break; | |
1981 | } | |
85ba2d86 RM |
1982 | |
1983 | return ncsw; | |
1da177e4 LT |
1984 | } |
1985 | ||
1986 | /*** | |
1987 | * kick_process - kick a running thread to enter/exit the kernel | |
1988 | * @p: the to-be-kicked thread | |
1989 | * | |
1990 | * Cause a process which is running on another CPU to enter | |
1991 | * kernel-mode, without any delay. (to get signals handled.) | |
1992 | * | |
1993 | * NOTE: this function doesnt have to take the runqueue lock, | |
1994 | * because all it wants to ensure is that the remote task enters | |
1995 | * the kernel. If the IPI races and the task has been migrated | |
1996 | * to another CPU then no harm is done and the purpose has been | |
1997 | * achieved as well. | |
1998 | */ | |
36c8b586 | 1999 | void kick_process(struct task_struct *p) |
1da177e4 LT |
2000 | { |
2001 | int cpu; | |
2002 | ||
2003 | preempt_disable(); | |
2004 | cpu = task_cpu(p); | |
2005 | if ((cpu != smp_processor_id()) && task_curr(p)) | |
2006 | smp_send_reschedule(cpu); | |
2007 | preempt_enable(); | |
2008 | } | |
2009 | ||
2010 | /* | |
2dd73a4f PW |
2011 | * Return a low guess at the load of a migration-source cpu weighted |
2012 | * according to the scheduling class and "nice" value. | |
1da177e4 LT |
2013 | * |
2014 | * We want to under-estimate the load of migration sources, to | |
2015 | * balance conservatively. | |
2016 | */ | |
a9957449 | 2017 | static unsigned long source_load(int cpu, int type) |
1da177e4 | 2018 | { |
70b97a7f | 2019 | struct rq *rq = cpu_rq(cpu); |
dd41f596 | 2020 | unsigned long total = weighted_cpuload(cpu); |
2dd73a4f | 2021 | |
93b75217 | 2022 | if (type == 0 || !sched_feat(LB_BIAS)) |
dd41f596 | 2023 | return total; |
b910472d | 2024 | |
dd41f596 | 2025 | return min(rq->cpu_load[type-1], total); |
1da177e4 LT |
2026 | } |
2027 | ||
2028 | /* | |
2dd73a4f PW |
2029 | * Return a high guess at the load of a migration-target cpu weighted |
2030 | * according to the scheduling class and "nice" value. | |
1da177e4 | 2031 | */ |
a9957449 | 2032 | static unsigned long target_load(int cpu, int type) |
1da177e4 | 2033 | { |
70b97a7f | 2034 | struct rq *rq = cpu_rq(cpu); |
dd41f596 | 2035 | unsigned long total = weighted_cpuload(cpu); |
2dd73a4f | 2036 | |
93b75217 | 2037 | if (type == 0 || !sched_feat(LB_BIAS)) |
dd41f596 | 2038 | return total; |
3b0bd9bc | 2039 | |
dd41f596 | 2040 | return max(rq->cpu_load[type-1], total); |
2dd73a4f PW |
2041 | } |
2042 | ||
147cbb4b NP |
2043 | /* |
2044 | * find_idlest_group finds and returns the least busy CPU group within the | |
2045 | * domain. | |
2046 | */ | |
2047 | static struct sched_group * | |
2048 | find_idlest_group(struct sched_domain *sd, struct task_struct *p, int this_cpu) | |
2049 | { | |
2050 | struct sched_group *idlest = NULL, *this = NULL, *group = sd->groups; | |
2051 | unsigned long min_load = ULONG_MAX, this_load = 0; | |
2052 | int load_idx = sd->forkexec_idx; | |
2053 | int imbalance = 100 + (sd->imbalance_pct-100)/2; | |
2054 | ||
2055 | do { | |
2056 | unsigned long load, avg_load; | |
2057 | int local_group; | |
2058 | int i; | |
2059 | ||
da5a5522 BD |
2060 | /* Skip over this group if it has no CPUs allowed */ |
2061 | if (!cpus_intersects(group->cpumask, p->cpus_allowed)) | |
3a5c359a | 2062 | continue; |
da5a5522 | 2063 | |
147cbb4b | 2064 | local_group = cpu_isset(this_cpu, group->cpumask); |
147cbb4b NP |
2065 | |
2066 | /* Tally up the load of all CPUs in the group */ | |
2067 | avg_load = 0; | |
2068 | ||
363ab6f1 | 2069 | for_each_cpu_mask_nr(i, group->cpumask) { |
147cbb4b NP |
2070 | /* Bias balancing toward cpus of our domain */ |
2071 | if (local_group) | |
2072 | load = source_load(i, load_idx); | |
2073 | else | |
2074 | load = target_load(i, load_idx); | |
2075 | ||
2076 | avg_load += load; | |
2077 | } | |
2078 | ||
2079 | /* Adjust by relative CPU power of the group */ | |
5517d86b ED |
2080 | avg_load = sg_div_cpu_power(group, |
2081 | avg_load * SCHED_LOAD_SCALE); | |
147cbb4b NP |
2082 | |
2083 | if (local_group) { | |
2084 | this_load = avg_load; | |
2085 | this = group; | |
2086 | } else if (avg_load < min_load) { | |
2087 | min_load = avg_load; | |
2088 | idlest = group; | |
2089 | } | |
3a5c359a | 2090 | } while (group = group->next, group != sd->groups); |
147cbb4b NP |
2091 | |
2092 | if (!idlest || 100*this_load < imbalance*min_load) | |
2093 | return NULL; | |
2094 | return idlest; | |
2095 | } | |
2096 | ||
2097 | /* | |
0feaece9 | 2098 | * find_idlest_cpu - find the idlest cpu among the cpus in group. |
147cbb4b | 2099 | */ |
95cdf3b7 | 2100 | static int |
7c16ec58 MT |
2101 | find_idlest_cpu(struct sched_group *group, struct task_struct *p, int this_cpu, |
2102 | cpumask_t *tmp) | |
147cbb4b NP |
2103 | { |
2104 | unsigned long load, min_load = ULONG_MAX; | |
2105 | int idlest = -1; | |
2106 | int i; | |
2107 | ||
da5a5522 | 2108 | /* Traverse only the allowed CPUs */ |
7c16ec58 | 2109 | cpus_and(*tmp, group->cpumask, p->cpus_allowed); |
da5a5522 | 2110 | |
363ab6f1 | 2111 | for_each_cpu_mask_nr(i, *tmp) { |
2dd73a4f | 2112 | load = weighted_cpuload(i); |
147cbb4b NP |
2113 | |
2114 | if (load < min_load || (load == min_load && i == this_cpu)) { | |
2115 | min_load = load; | |
2116 | idlest = i; | |
2117 | } | |
2118 | } | |
2119 | ||
2120 | return idlest; | |
2121 | } | |
2122 | ||
476d139c NP |
2123 | /* |
2124 | * sched_balance_self: balance the current task (running on cpu) in domains | |
2125 | * that have the 'flag' flag set. In practice, this is SD_BALANCE_FORK and | |
2126 | * SD_BALANCE_EXEC. | |
2127 | * | |
2128 | * Balance, ie. select the least loaded group. | |
2129 | * | |
2130 | * Returns the target CPU number, or the same CPU if no balancing is needed. | |
2131 | * | |
2132 | * preempt must be disabled. | |
2133 | */ | |
2134 | static int sched_balance_self(int cpu, int flag) | |
2135 | { | |
2136 | struct task_struct *t = current; | |
2137 | struct sched_domain *tmp, *sd = NULL; | |
147cbb4b | 2138 | |
c96d145e | 2139 | for_each_domain(cpu, tmp) { |
9761eea8 IM |
2140 | /* |
2141 | * If power savings logic is enabled for a domain, stop there. | |
2142 | */ | |
5c45bf27 SS |
2143 | if (tmp->flags & SD_POWERSAVINGS_BALANCE) |
2144 | break; | |
476d139c NP |
2145 | if (tmp->flags & flag) |
2146 | sd = tmp; | |
c96d145e | 2147 | } |
476d139c | 2148 | |
039a1c41 PZ |
2149 | if (sd) |
2150 | update_shares(sd); | |
2151 | ||
476d139c | 2152 | while (sd) { |
7c16ec58 | 2153 | cpumask_t span, tmpmask; |
476d139c | 2154 | struct sched_group *group; |
1a848870 SS |
2155 | int new_cpu, weight; |
2156 | ||
2157 | if (!(sd->flags & flag)) { | |
2158 | sd = sd->child; | |
2159 | continue; | |
2160 | } | |
476d139c NP |
2161 | |
2162 | span = sd->span; | |
2163 | group = find_idlest_group(sd, t, cpu); | |
1a848870 SS |
2164 | if (!group) { |
2165 | sd = sd->child; | |
2166 | continue; | |
2167 | } | |
476d139c | 2168 | |
7c16ec58 | 2169 | new_cpu = find_idlest_cpu(group, t, cpu, &tmpmask); |
1a848870 SS |
2170 | if (new_cpu == -1 || new_cpu == cpu) { |
2171 | /* Now try balancing at a lower domain level of cpu */ | |
2172 | sd = sd->child; | |
2173 | continue; | |
2174 | } | |
476d139c | 2175 | |
1a848870 | 2176 | /* Now try balancing at a lower domain level of new_cpu */ |
476d139c | 2177 | cpu = new_cpu; |
476d139c NP |
2178 | sd = NULL; |
2179 | weight = cpus_weight(span); | |
2180 | for_each_domain(cpu, tmp) { | |
2181 | if (weight <= cpus_weight(tmp->span)) | |
2182 | break; | |
2183 | if (tmp->flags & flag) | |
2184 | sd = tmp; | |
2185 | } | |
2186 | /* while loop will break here if sd == NULL */ | |
2187 | } | |
2188 | ||
2189 | return cpu; | |
2190 | } | |
2191 | ||
2192 | #endif /* CONFIG_SMP */ | |
1da177e4 | 2193 | |
1da177e4 LT |
2194 | /*** |
2195 | * try_to_wake_up - wake up a thread | |
2196 | * @p: the to-be-woken-up thread | |
2197 | * @state: the mask of task states that can be woken | |
2198 | * @sync: do a synchronous wakeup? | |
2199 | * | |
2200 | * Put it on the run-queue if it's not already there. The "current" | |
2201 | * thread is always on the run-queue (except when the actual | |
2202 | * re-schedule is in progress), and as such you're allowed to do | |
2203 | * the simpler "current->state = TASK_RUNNING" to mark yourself | |
2204 | * runnable without the overhead of this. | |
2205 | * | |
2206 | * returns failure only if the task is already active. | |
2207 | */ | |
36c8b586 | 2208 | static int try_to_wake_up(struct task_struct *p, unsigned int state, int sync) |
1da177e4 | 2209 | { |
cc367732 | 2210 | int cpu, orig_cpu, this_cpu, success = 0; |
1da177e4 LT |
2211 | unsigned long flags; |
2212 | long old_state; | |
70b97a7f | 2213 | struct rq *rq; |
1da177e4 | 2214 | |
b85d0667 IM |
2215 | if (!sched_feat(SYNC_WAKEUPS)) |
2216 | sync = 0; | |
2217 | ||
2398f2c6 PZ |
2218 | #ifdef CONFIG_SMP |
2219 | if (sched_feat(LB_WAKEUP_UPDATE)) { | |
2220 | struct sched_domain *sd; | |
2221 | ||
2222 | this_cpu = raw_smp_processor_id(); | |
2223 | cpu = task_cpu(p); | |
2224 | ||
2225 | for_each_domain(this_cpu, sd) { | |
2226 | if (cpu_isset(cpu, sd->span)) { | |
2227 | update_shares(sd); | |
2228 | break; | |
2229 | } | |
2230 | } | |
2231 | } | |
2232 | #endif | |
2233 | ||
04e2f174 | 2234 | smp_wmb(); |
1da177e4 LT |
2235 | rq = task_rq_lock(p, &flags); |
2236 | old_state = p->state; | |
2237 | if (!(old_state & state)) | |
2238 | goto out; | |
2239 | ||
dd41f596 | 2240 | if (p->se.on_rq) |
1da177e4 LT |
2241 | goto out_running; |
2242 | ||
2243 | cpu = task_cpu(p); | |
cc367732 | 2244 | orig_cpu = cpu; |
1da177e4 LT |
2245 | this_cpu = smp_processor_id(); |
2246 | ||
2247 | #ifdef CONFIG_SMP | |
2248 | if (unlikely(task_running(rq, p))) | |
2249 | goto out_activate; | |
2250 | ||
5d2f5a61 DA |
2251 | cpu = p->sched_class->select_task_rq(p, sync); |
2252 | if (cpu != orig_cpu) { | |
2253 | set_task_cpu(p, cpu); | |
1da177e4 LT |
2254 | task_rq_unlock(rq, &flags); |
2255 | /* might preempt at this point */ | |
2256 | rq = task_rq_lock(p, &flags); | |
2257 | old_state = p->state; | |
2258 | if (!(old_state & state)) | |
2259 | goto out; | |
dd41f596 | 2260 | if (p->se.on_rq) |
1da177e4 LT |
2261 | goto out_running; |
2262 | ||
2263 | this_cpu = smp_processor_id(); | |
2264 | cpu = task_cpu(p); | |
2265 | } | |
2266 | ||
e7693a36 GH |
2267 | #ifdef CONFIG_SCHEDSTATS |
2268 | schedstat_inc(rq, ttwu_count); | |
2269 | if (cpu == this_cpu) | |
2270 | schedstat_inc(rq, ttwu_local); | |
2271 | else { | |
2272 | struct sched_domain *sd; | |
2273 | for_each_domain(this_cpu, sd) { | |
2274 | if (cpu_isset(cpu, sd->span)) { | |
2275 | schedstat_inc(sd, ttwu_wake_remote); | |
2276 | break; | |
2277 | } | |
2278 | } | |
2279 | } | |
6d6bc0ad | 2280 | #endif /* CONFIG_SCHEDSTATS */ |
e7693a36 | 2281 | |
1da177e4 LT |
2282 | out_activate: |
2283 | #endif /* CONFIG_SMP */ | |
cc367732 IM |
2284 | schedstat_inc(p, se.nr_wakeups); |
2285 | if (sync) | |
2286 | schedstat_inc(p, se.nr_wakeups_sync); | |
2287 | if (orig_cpu != cpu) | |
2288 | schedstat_inc(p, se.nr_wakeups_migrate); | |
2289 | if (cpu == this_cpu) | |
2290 | schedstat_inc(p, se.nr_wakeups_local); | |
2291 | else | |
2292 | schedstat_inc(p, se.nr_wakeups_remote); | |
2daa3577 | 2293 | update_rq_clock(rq); |
dd41f596 | 2294 | activate_task(rq, p, 1); |
1da177e4 LT |
2295 | success = 1; |
2296 | ||
2297 | out_running: | |
0a16b607 | 2298 | trace_sched_wakeup(rq, p); |
15afe09b | 2299 | check_preempt_curr(rq, p, sync); |
4ae7d5ce | 2300 | |
1da177e4 | 2301 | p->state = TASK_RUNNING; |
9a897c5a SR |
2302 | #ifdef CONFIG_SMP |
2303 | if (p->sched_class->task_wake_up) | |
2304 | p->sched_class->task_wake_up(rq, p); | |
2305 | #endif | |
1da177e4 | 2306 | out: |
2087a1ad GH |
2307 | current->se.last_wakeup = current->se.sum_exec_runtime; |
2308 | ||
1da177e4 LT |
2309 | task_rq_unlock(rq, &flags); |
2310 | ||
2311 | return success; | |
2312 | } | |
2313 | ||
7ad5b3a5 | 2314 | int wake_up_process(struct task_struct *p) |
1da177e4 | 2315 | { |
d9514f6c | 2316 | return try_to_wake_up(p, TASK_ALL, 0); |
1da177e4 | 2317 | } |
1da177e4 LT |
2318 | EXPORT_SYMBOL(wake_up_process); |
2319 | ||
7ad5b3a5 | 2320 | int wake_up_state(struct task_struct *p, unsigned int state) |
1da177e4 LT |
2321 | { |
2322 | return try_to_wake_up(p, state, 0); | |
2323 | } | |
2324 | ||
1da177e4 LT |
2325 | /* |
2326 | * Perform scheduler related setup for a newly forked process p. | |
2327 | * p is forked by current. | |
dd41f596 IM |
2328 | * |
2329 | * __sched_fork() is basic setup used by init_idle() too: | |
2330 | */ | |
2331 | static void __sched_fork(struct task_struct *p) | |
2332 | { | |
dd41f596 IM |
2333 | p->se.exec_start = 0; |
2334 | p->se.sum_exec_runtime = 0; | |
f6cf891c | 2335 | p->se.prev_sum_exec_runtime = 0; |
4ae7d5ce IM |
2336 | p->se.last_wakeup = 0; |
2337 | p->se.avg_overlap = 0; | |
6cfb0d5d IM |
2338 | |
2339 | #ifdef CONFIG_SCHEDSTATS | |
2340 | p->se.wait_start = 0; | |
dd41f596 IM |
2341 | p->se.sum_sleep_runtime = 0; |
2342 | p->se.sleep_start = 0; | |
dd41f596 IM |
2343 | p->se.block_start = 0; |
2344 | p->se.sleep_max = 0; | |
2345 | p->se.block_max = 0; | |
2346 | p->se.exec_max = 0; | |
eba1ed4b | 2347 | p->se.slice_max = 0; |
dd41f596 | 2348 | p->se.wait_max = 0; |
6cfb0d5d | 2349 | #endif |
476d139c | 2350 | |
fa717060 | 2351 | INIT_LIST_HEAD(&p->rt.run_list); |
dd41f596 | 2352 | p->se.on_rq = 0; |
4a55bd5e | 2353 | INIT_LIST_HEAD(&p->se.group_node); |
476d139c | 2354 | |
e107be36 AK |
2355 | #ifdef CONFIG_PREEMPT_NOTIFIERS |
2356 | INIT_HLIST_HEAD(&p->preempt_notifiers); | |
2357 | #endif | |
2358 | ||
1da177e4 LT |
2359 | /* |
2360 | * We mark the process as running here, but have not actually | |
2361 | * inserted it onto the runqueue yet. This guarantees that | |
2362 | * nobody will actually run it, and a signal or other external | |
2363 | * event cannot wake it up and insert it on the runqueue either. | |
2364 | */ | |
2365 | p->state = TASK_RUNNING; | |
dd41f596 IM |
2366 | } |
2367 | ||
2368 | /* | |
2369 | * fork()/clone()-time setup: | |
2370 | */ | |
2371 | void sched_fork(struct task_struct *p, int clone_flags) | |
2372 | { | |
2373 | int cpu = get_cpu(); | |
2374 | ||
2375 | __sched_fork(p); | |
2376 | ||
2377 | #ifdef CONFIG_SMP | |
2378 | cpu = sched_balance_self(cpu, SD_BALANCE_FORK); | |
2379 | #endif | |
02e4bac2 | 2380 | set_task_cpu(p, cpu); |
b29739f9 IM |
2381 | |
2382 | /* | |
2383 | * Make sure we do not leak PI boosting priority to the child: | |
2384 | */ | |
2385 | p->prio = current->normal_prio; | |
2ddbf952 HS |
2386 | if (!rt_prio(p->prio)) |
2387 | p->sched_class = &fair_sched_class; | |
b29739f9 | 2388 | |
52f17b6c | 2389 | #if defined(CONFIG_SCHEDSTATS) || defined(CONFIG_TASK_DELAY_ACCT) |
dd41f596 | 2390 | if (likely(sched_info_on())) |
52f17b6c | 2391 | memset(&p->sched_info, 0, sizeof(p->sched_info)); |
1da177e4 | 2392 | #endif |
d6077cb8 | 2393 | #if defined(CONFIG_SMP) && defined(__ARCH_WANT_UNLOCKED_CTXSW) |
4866cde0 NP |
2394 | p->oncpu = 0; |
2395 | #endif | |
1da177e4 | 2396 | #ifdef CONFIG_PREEMPT |
4866cde0 | 2397 | /* Want to start with kernel preemption disabled. */ |
a1261f54 | 2398 | task_thread_info(p)->preempt_count = 1; |
1da177e4 | 2399 | #endif |
476d139c | 2400 | put_cpu(); |
1da177e4 LT |
2401 | } |
2402 | ||
2403 | /* | |
2404 | * wake_up_new_task - wake up a newly created task for the first time. | |
2405 | * | |
2406 | * This function will do some initial scheduler statistics housekeeping | |
2407 | * that must be done for every newly created context, then puts the task | |
2408 | * on the runqueue and wakes it. | |
2409 | */ | |
7ad5b3a5 | 2410 | void wake_up_new_task(struct task_struct *p, unsigned long clone_flags) |
1da177e4 LT |
2411 | { |
2412 | unsigned long flags; | |
dd41f596 | 2413 | struct rq *rq; |
1da177e4 LT |
2414 | |
2415 | rq = task_rq_lock(p, &flags); | |
147cbb4b | 2416 | BUG_ON(p->state != TASK_RUNNING); |
a8e504d2 | 2417 | update_rq_clock(rq); |
1da177e4 LT |
2418 | |
2419 | p->prio = effective_prio(p); | |
2420 | ||
b9dca1e0 | 2421 | if (!p->sched_class->task_new || !current->se.on_rq) { |
dd41f596 | 2422 | activate_task(rq, p, 0); |
1da177e4 | 2423 | } else { |
1da177e4 | 2424 | /* |
dd41f596 IM |
2425 | * Let the scheduling class do new task startup |
2426 | * management (if any): | |
1da177e4 | 2427 | */ |
ee0827d8 | 2428 | p->sched_class->task_new(rq, p); |
c09595f6 | 2429 | inc_nr_running(rq); |
1da177e4 | 2430 | } |
0a16b607 | 2431 | trace_sched_wakeup_new(rq, p); |
15afe09b | 2432 | check_preempt_curr(rq, p, 0); |
9a897c5a SR |
2433 | #ifdef CONFIG_SMP |
2434 | if (p->sched_class->task_wake_up) | |
2435 | p->sched_class->task_wake_up(rq, p); | |
2436 | #endif | |
dd41f596 | 2437 | task_rq_unlock(rq, &flags); |
1da177e4 LT |
2438 | } |
2439 | ||
e107be36 AK |
2440 | #ifdef CONFIG_PREEMPT_NOTIFIERS |
2441 | ||
2442 | /** | |
421cee29 RD |
2443 | * preempt_notifier_register - tell me when current is being being preempted & rescheduled |
2444 | * @notifier: notifier struct to register | |
e107be36 AK |
2445 | */ |
2446 | void preempt_notifier_register(struct preempt_notifier *notifier) | |
2447 | { | |
2448 | hlist_add_head(¬ifier->link, ¤t->preempt_notifiers); | |
2449 | } | |
2450 | EXPORT_SYMBOL_GPL(preempt_notifier_register); | |
2451 | ||
2452 | /** | |
2453 | * preempt_notifier_unregister - no longer interested in preemption notifications | |
421cee29 | 2454 | * @notifier: notifier struct to unregister |
e107be36 AK |
2455 | * |
2456 | * This is safe to call from within a preemption notifier. | |
2457 | */ | |
2458 | void preempt_notifier_unregister(struct preempt_notifier *notifier) | |
2459 | { | |
2460 | hlist_del(¬ifier->link); | |
2461 | } | |
2462 | EXPORT_SYMBOL_GPL(preempt_notifier_unregister); | |
2463 | ||
2464 | static void fire_sched_in_preempt_notifiers(struct task_struct *curr) | |
2465 | { | |
2466 | struct preempt_notifier *notifier; | |
2467 | struct hlist_node *node; | |
2468 | ||
2469 | hlist_for_each_entry(notifier, node, &curr->preempt_notifiers, link) | |
2470 | notifier->ops->sched_in(notifier, raw_smp_processor_id()); | |
2471 | } | |
2472 | ||
2473 | static void | |
2474 | fire_sched_out_preempt_notifiers(struct task_struct *curr, | |
2475 | struct task_struct *next) | |
2476 | { | |
2477 | struct preempt_notifier *notifier; | |
2478 | struct hlist_node *node; | |
2479 | ||
2480 | hlist_for_each_entry(notifier, node, &curr->preempt_notifiers, link) | |
2481 | notifier->ops->sched_out(notifier, next); | |
2482 | } | |
2483 | ||
6d6bc0ad | 2484 | #else /* !CONFIG_PREEMPT_NOTIFIERS */ |
e107be36 AK |
2485 | |
2486 | static void fire_sched_in_preempt_notifiers(struct task_struct *curr) | |
2487 | { | |
2488 | } | |
2489 | ||
2490 | static void | |
2491 | fire_sched_out_preempt_notifiers(struct task_struct *curr, | |
2492 | struct task_struct *next) | |
2493 | { | |
2494 | } | |
2495 | ||
6d6bc0ad | 2496 | #endif /* CONFIG_PREEMPT_NOTIFIERS */ |
e107be36 | 2497 | |
4866cde0 NP |
2498 | /** |
2499 | * prepare_task_switch - prepare to switch tasks | |
2500 | * @rq: the runqueue preparing to switch | |
421cee29 | 2501 | * @prev: the current task that is being switched out |
4866cde0 NP |
2502 | * @next: the task we are going to switch to. |
2503 | * | |
2504 | * This is called with the rq lock held and interrupts off. It must | |
2505 | * be paired with a subsequent finish_task_switch after the context | |
2506 | * switch. | |
2507 | * | |
2508 | * prepare_task_switch sets up locking and calls architecture specific | |
2509 | * hooks. | |
2510 | */ | |
e107be36 AK |
2511 | static inline void |
2512 | prepare_task_switch(struct rq *rq, struct task_struct *prev, | |
2513 | struct task_struct *next) | |
4866cde0 | 2514 | { |
e107be36 | 2515 | fire_sched_out_preempt_notifiers(prev, next); |
4866cde0 NP |
2516 | prepare_lock_switch(rq, next); |
2517 | prepare_arch_switch(next); | |
2518 | } | |
2519 | ||
1da177e4 LT |
2520 | /** |
2521 | * finish_task_switch - clean up after a task-switch | |
344babaa | 2522 | * @rq: runqueue associated with task-switch |
1da177e4 LT |
2523 | * @prev: the thread we just switched away from. |
2524 | * | |
4866cde0 NP |
2525 | * finish_task_switch must be called after the context switch, paired |
2526 | * with a prepare_task_switch call before the context switch. | |
2527 | * finish_task_switch will reconcile locking set up by prepare_task_switch, | |
2528 | * and do any other architecture-specific cleanup actions. | |
1da177e4 LT |
2529 | * |
2530 | * Note that we may have delayed dropping an mm in context_switch(). If | |
41a2d6cf | 2531 | * so, we finish that here outside of the runqueue lock. (Doing it |
1da177e4 LT |
2532 | * with the lock held can cause deadlocks; see schedule() for |
2533 | * details.) | |
2534 | */ | |
a9957449 | 2535 | static void finish_task_switch(struct rq *rq, struct task_struct *prev) |
1da177e4 LT |
2536 | __releases(rq->lock) |
2537 | { | |
1da177e4 | 2538 | struct mm_struct *mm = rq->prev_mm; |
55a101f8 | 2539 | long prev_state; |
1da177e4 LT |
2540 | |
2541 | rq->prev_mm = NULL; | |
2542 | ||
2543 | /* | |
2544 | * A task struct has one reference for the use as "current". | |
c394cc9f | 2545 | * If a task dies, then it sets TASK_DEAD in tsk->state and calls |
55a101f8 ON |
2546 | * schedule one last time. The schedule call will never return, and |
2547 | * the scheduled task must drop that reference. | |
c394cc9f | 2548 | * The test for TASK_DEAD must occur while the runqueue locks are |
1da177e4 LT |
2549 | * still held, otherwise prev could be scheduled on another cpu, die |
2550 | * there before we look at prev->state, and then the reference would | |
2551 | * be dropped twice. | |
2552 | * Manfred Spraul <manfred@colorfullife.com> | |
2553 | */ | |
55a101f8 | 2554 | prev_state = prev->state; |
4866cde0 NP |
2555 | finish_arch_switch(prev); |
2556 | finish_lock_switch(rq, prev); | |
9a897c5a SR |
2557 | #ifdef CONFIG_SMP |
2558 | if (current->sched_class->post_schedule) | |
2559 | current->sched_class->post_schedule(rq); | |
2560 | #endif | |
e8fa1362 | 2561 | |
e107be36 | 2562 | fire_sched_in_preempt_notifiers(current); |
1da177e4 LT |
2563 | if (mm) |
2564 | mmdrop(mm); | |
c394cc9f | 2565 | if (unlikely(prev_state == TASK_DEAD)) { |
c6fd91f0 | 2566 | /* |
2567 | * Remove function-return probe instances associated with this | |
2568 | * task and put them back on the free list. | |
9761eea8 | 2569 | */ |
c6fd91f0 | 2570 | kprobe_flush_task(prev); |
1da177e4 | 2571 | put_task_struct(prev); |
c6fd91f0 | 2572 | } |
1da177e4 LT |
2573 | } |
2574 | ||
2575 | /** | |
2576 | * schedule_tail - first thing a freshly forked thread must call. | |
2577 | * @prev: the thread we just switched away from. | |
2578 | */ | |
36c8b586 | 2579 | asmlinkage void schedule_tail(struct task_struct *prev) |
1da177e4 LT |
2580 | __releases(rq->lock) |
2581 | { | |
70b97a7f IM |
2582 | struct rq *rq = this_rq(); |
2583 | ||
4866cde0 NP |
2584 | finish_task_switch(rq, prev); |
2585 | #ifdef __ARCH_WANT_UNLOCKED_CTXSW | |
2586 | /* In this case, finish_task_switch does not reenable preemption */ | |
2587 | preempt_enable(); | |
2588 | #endif | |
1da177e4 | 2589 | if (current->set_child_tid) |
b488893a | 2590 | put_user(task_pid_vnr(current), current->set_child_tid); |
1da177e4 LT |
2591 | } |
2592 | ||
2593 | /* | |
2594 | * context_switch - switch to the new MM and the new | |
2595 | * thread's register state. | |
2596 | */ | |
dd41f596 | 2597 | static inline void |
70b97a7f | 2598 | context_switch(struct rq *rq, struct task_struct *prev, |
36c8b586 | 2599 | struct task_struct *next) |
1da177e4 | 2600 | { |
dd41f596 | 2601 | struct mm_struct *mm, *oldmm; |
1da177e4 | 2602 | |
e107be36 | 2603 | prepare_task_switch(rq, prev, next); |
0a16b607 | 2604 | trace_sched_switch(rq, prev, next); |
dd41f596 IM |
2605 | mm = next->mm; |
2606 | oldmm = prev->active_mm; | |
9226d125 ZA |
2607 | /* |
2608 | * For paravirt, this is coupled with an exit in switch_to to | |
2609 | * combine the page table reload and the switch backend into | |
2610 | * one hypercall. | |
2611 | */ | |
2612 | arch_enter_lazy_cpu_mode(); | |
2613 | ||
dd41f596 | 2614 | if (unlikely(!mm)) { |
1da177e4 LT |
2615 | next->active_mm = oldmm; |
2616 | atomic_inc(&oldmm->mm_count); | |
2617 | enter_lazy_tlb(oldmm, next); | |
2618 | } else | |
2619 | switch_mm(oldmm, mm, next); | |
2620 | ||
dd41f596 | 2621 | if (unlikely(!prev->mm)) { |
1da177e4 | 2622 | prev->active_mm = NULL; |
1da177e4 LT |
2623 | rq->prev_mm = oldmm; |
2624 | } | |
3a5f5e48 IM |
2625 | /* |
2626 | * Since the runqueue lock will be released by the next | |
2627 | * task (which is an invalid locking op but in the case | |
2628 | * of the scheduler it's an obvious special-case), so we | |
2629 | * do an early lockdep release here: | |
2630 | */ | |
2631 | #ifndef __ARCH_WANT_UNLOCKED_CTXSW | |
8a25d5de | 2632 | spin_release(&rq->lock.dep_map, 1, _THIS_IP_); |
3a5f5e48 | 2633 | #endif |
1da177e4 LT |
2634 | |
2635 | /* Here we just switch the register state and the stack. */ | |
2636 | switch_to(prev, next, prev); | |
2637 | ||
dd41f596 IM |
2638 | barrier(); |
2639 | /* | |
2640 | * this_rq must be evaluated again because prev may have moved | |
2641 | * CPUs since it called schedule(), thus the 'rq' on its stack | |
2642 | * frame will be invalid. | |
2643 | */ | |
2644 | finish_task_switch(this_rq(), prev); | |
1da177e4 LT |
2645 | } |
2646 | ||
2647 | /* | |
2648 | * nr_running, nr_uninterruptible and nr_context_switches: | |
2649 | * | |
2650 | * externally visible scheduler statistics: current number of runnable | |
2651 | * threads, current number of uninterruptible-sleeping threads, total | |
2652 | * number of context switches performed since bootup. | |
2653 | */ | |
2654 | unsigned long nr_running(void) | |
2655 | { | |
2656 | unsigned long i, sum = 0; | |
2657 | ||
2658 | for_each_online_cpu(i) | |
2659 | sum += cpu_rq(i)->nr_running; | |
2660 | ||
2661 | return sum; | |
2662 | } | |
2663 | ||
2664 | unsigned long nr_uninterruptible(void) | |
2665 | { | |
2666 | unsigned long i, sum = 0; | |
2667 | ||
0a945022 | 2668 | for_each_possible_cpu(i) |
1da177e4 LT |
2669 | sum += cpu_rq(i)->nr_uninterruptible; |
2670 | ||
2671 | /* | |
2672 | * Since we read the counters lockless, it might be slightly | |
2673 | * inaccurate. Do not allow it to go below zero though: | |
2674 | */ | |
2675 | if (unlikely((long)sum < 0)) | |
2676 | sum = 0; | |
2677 | ||
2678 | return sum; | |
2679 | } | |
2680 | ||
2681 | unsigned long long nr_context_switches(void) | |
2682 | { | |
cc94abfc SR |
2683 | int i; |
2684 | unsigned long long sum = 0; | |
1da177e4 | 2685 | |
0a945022 | 2686 | for_each_possible_cpu(i) |
1da177e4 LT |
2687 | sum += cpu_rq(i)->nr_switches; |
2688 | ||
2689 | return sum; | |
2690 | } | |
2691 | ||
2692 | unsigned long nr_iowait(void) | |
2693 | { | |
2694 | unsigned long i, sum = 0; | |
2695 | ||
0a945022 | 2696 | for_each_possible_cpu(i) |
1da177e4 LT |
2697 | sum += atomic_read(&cpu_rq(i)->nr_iowait); |
2698 | ||
2699 | return sum; | |
2700 | } | |
2701 | ||
db1b1fef JS |
2702 | unsigned long nr_active(void) |
2703 | { | |
2704 | unsigned long i, running = 0, uninterruptible = 0; | |
2705 | ||
2706 | for_each_online_cpu(i) { | |
2707 | running += cpu_rq(i)->nr_running; | |
2708 | uninterruptible += cpu_rq(i)->nr_uninterruptible; | |
2709 | } | |
2710 | ||
2711 | if (unlikely((long)uninterruptible < 0)) | |
2712 | uninterruptible = 0; | |
2713 | ||
2714 | return running + uninterruptible; | |
2715 | } | |
2716 | ||
48f24c4d | 2717 | /* |
dd41f596 IM |
2718 | * Update rq->cpu_load[] statistics. This function is usually called every |
2719 | * scheduler tick (TICK_NSEC). | |
48f24c4d | 2720 | */ |
dd41f596 | 2721 | static void update_cpu_load(struct rq *this_rq) |
48f24c4d | 2722 | { |
495eca49 | 2723 | unsigned long this_load = this_rq->load.weight; |
dd41f596 IM |
2724 | int i, scale; |
2725 | ||
2726 | this_rq->nr_load_updates++; | |
dd41f596 IM |
2727 | |
2728 | /* Update our load: */ | |
2729 | for (i = 0, scale = 1; i < CPU_LOAD_IDX_MAX; i++, scale += scale) { | |
2730 | unsigned long old_load, new_load; | |
2731 | ||
2732 | /* scale is effectively 1 << i now, and >> i divides by scale */ | |
2733 | ||
2734 | old_load = this_rq->cpu_load[i]; | |
2735 | new_load = this_load; | |
a25707f3 IM |
2736 | /* |
2737 | * Round up the averaging division if load is increasing. This | |
2738 | * prevents us from getting stuck on 9 if the load is 10, for | |
2739 | * example. | |
2740 | */ | |
2741 | if (new_load > old_load) | |
2742 | new_load += scale-1; | |
dd41f596 IM |
2743 | this_rq->cpu_load[i] = (old_load*(scale-1) + new_load) >> i; |
2744 | } | |
48f24c4d IM |
2745 | } |
2746 | ||
dd41f596 IM |
2747 | #ifdef CONFIG_SMP |
2748 | ||
1da177e4 LT |
2749 | /* |
2750 | * double_rq_lock - safely lock two runqueues | |
2751 | * | |
2752 | * Note this does not disable interrupts like task_rq_lock, | |
2753 | * you need to do so manually before calling. | |
2754 | */ | |
70b97a7f | 2755 | static void double_rq_lock(struct rq *rq1, struct rq *rq2) |
1da177e4 LT |
2756 | __acquires(rq1->lock) |
2757 | __acquires(rq2->lock) | |
2758 | { | |
054b9108 | 2759 | BUG_ON(!irqs_disabled()); |
1da177e4 LT |
2760 | if (rq1 == rq2) { |
2761 | spin_lock(&rq1->lock); | |
2762 | __acquire(rq2->lock); /* Fake it out ;) */ | |
2763 | } else { | |
c96d145e | 2764 | if (rq1 < rq2) { |
1da177e4 | 2765 | spin_lock(&rq1->lock); |
5e710e37 | 2766 | spin_lock_nested(&rq2->lock, SINGLE_DEPTH_NESTING); |
1da177e4 LT |
2767 | } else { |
2768 | spin_lock(&rq2->lock); | |
5e710e37 | 2769 | spin_lock_nested(&rq1->lock, SINGLE_DEPTH_NESTING); |
1da177e4 LT |
2770 | } |
2771 | } | |
6e82a3be IM |
2772 | update_rq_clock(rq1); |
2773 | update_rq_clock(rq2); | |
1da177e4 LT |
2774 | } |
2775 | ||
2776 | /* | |
2777 | * double_rq_unlock - safely unlock two runqueues | |
2778 | * | |
2779 | * Note this does not restore interrupts like task_rq_unlock, | |
2780 | * you need to do so manually after calling. | |
2781 | */ | |
70b97a7f | 2782 | static void double_rq_unlock(struct rq *rq1, struct rq *rq2) |
1da177e4 LT |
2783 | __releases(rq1->lock) |
2784 | __releases(rq2->lock) | |
2785 | { | |
2786 | spin_unlock(&rq1->lock); | |
2787 | if (rq1 != rq2) | |
2788 | spin_unlock(&rq2->lock); | |
2789 | else | |
2790 | __release(rq2->lock); | |
2791 | } | |
2792 | ||
2793 | /* | |
2794 | * double_lock_balance - lock the busiest runqueue, this_rq is locked already. | |
2795 | */ | |
e8fa1362 | 2796 | static int double_lock_balance(struct rq *this_rq, struct rq *busiest) |
1da177e4 LT |
2797 | __releases(this_rq->lock) |
2798 | __acquires(busiest->lock) | |
2799 | __acquires(this_rq->lock) | |
2800 | { | |
e8fa1362 SR |
2801 | int ret = 0; |
2802 | ||
054b9108 KK |
2803 | if (unlikely(!irqs_disabled())) { |
2804 | /* printk() doesn't work good under rq->lock */ | |
2805 | spin_unlock(&this_rq->lock); | |
2806 | BUG_ON(1); | |
2807 | } | |
1da177e4 | 2808 | if (unlikely(!spin_trylock(&busiest->lock))) { |
c96d145e | 2809 | if (busiest < this_rq) { |
1da177e4 LT |
2810 | spin_unlock(&this_rq->lock); |
2811 | spin_lock(&busiest->lock); | |
5e710e37 | 2812 | spin_lock_nested(&this_rq->lock, SINGLE_DEPTH_NESTING); |
e8fa1362 | 2813 | ret = 1; |
1da177e4 | 2814 | } else |
5e710e37 | 2815 | spin_lock_nested(&busiest->lock, SINGLE_DEPTH_NESTING); |
1da177e4 | 2816 | } |
e8fa1362 | 2817 | return ret; |
1da177e4 LT |
2818 | } |
2819 | ||
1b12bbc7 PZ |
2820 | static void double_unlock_balance(struct rq *this_rq, struct rq *busiest) |
2821 | __releases(busiest->lock) | |
2822 | { | |
2823 | spin_unlock(&busiest->lock); | |
2824 | lock_set_subclass(&this_rq->lock.dep_map, 0, _RET_IP_); | |
2825 | } | |
2826 | ||
1da177e4 LT |
2827 | /* |
2828 | * If dest_cpu is allowed for this process, migrate the task to it. | |
2829 | * This is accomplished by forcing the cpu_allowed mask to only | |
41a2d6cf | 2830 | * allow dest_cpu, which will force the cpu onto dest_cpu. Then |
1da177e4 LT |
2831 | * the cpu_allowed mask is restored. |
2832 | */ | |
36c8b586 | 2833 | static void sched_migrate_task(struct task_struct *p, int dest_cpu) |
1da177e4 | 2834 | { |
70b97a7f | 2835 | struct migration_req req; |
1da177e4 | 2836 | unsigned long flags; |
70b97a7f | 2837 | struct rq *rq; |
1da177e4 LT |
2838 | |
2839 | rq = task_rq_lock(p, &flags); | |
2840 | if (!cpu_isset(dest_cpu, p->cpus_allowed) | |
e761b772 | 2841 | || unlikely(!cpu_active(dest_cpu))) |
1da177e4 LT |
2842 | goto out; |
2843 | ||
0a16b607 | 2844 | trace_sched_migrate_task(rq, p, dest_cpu); |
1da177e4 LT |
2845 | /* force the process onto the specified CPU */ |
2846 | if (migrate_task(p, dest_cpu, &req)) { | |
2847 | /* Need to wait for migration thread (might exit: take ref). */ | |
2848 | struct task_struct *mt = rq->migration_thread; | |
36c8b586 | 2849 | |
1da177e4 LT |
2850 | get_task_struct(mt); |
2851 | task_rq_unlock(rq, &flags); | |
2852 | wake_up_process(mt); | |
2853 | put_task_struct(mt); | |
2854 | wait_for_completion(&req.done); | |
36c8b586 | 2855 | |
1da177e4 LT |
2856 | return; |
2857 | } | |
2858 | out: | |
2859 | task_rq_unlock(rq, &flags); | |
2860 | } | |
2861 | ||
2862 | /* | |
476d139c NP |
2863 | * sched_exec - execve() is a valuable balancing opportunity, because at |
2864 | * this point the task has the smallest effective memory and cache footprint. | |
1da177e4 LT |
2865 | */ |
2866 | void sched_exec(void) | |
2867 | { | |
1da177e4 | 2868 | int new_cpu, this_cpu = get_cpu(); |
476d139c | 2869 | new_cpu = sched_balance_self(this_cpu, SD_BALANCE_EXEC); |
1da177e4 | 2870 | put_cpu(); |
476d139c NP |
2871 | if (new_cpu != this_cpu) |
2872 | sched_migrate_task(current, new_cpu); | |
1da177e4 LT |
2873 | } |
2874 | ||
2875 | /* | |
2876 | * pull_task - move a task from a remote runqueue to the local runqueue. | |
2877 | * Both runqueues must be locked. | |
2878 | */ | |
dd41f596 IM |
2879 | static void pull_task(struct rq *src_rq, struct task_struct *p, |
2880 | struct rq *this_rq, int this_cpu) | |
1da177e4 | 2881 | { |
2e1cb74a | 2882 | deactivate_task(src_rq, p, 0); |
1da177e4 | 2883 | set_task_cpu(p, this_cpu); |
dd41f596 | 2884 | activate_task(this_rq, p, 0); |
1da177e4 LT |
2885 | /* |
2886 | * Note that idle threads have a prio of MAX_PRIO, for this test | |
2887 | * to be always true for them. | |
2888 | */ | |
15afe09b | 2889 | check_preempt_curr(this_rq, p, 0); |
1da177e4 LT |
2890 | } |
2891 | ||
2892 | /* | |
2893 | * can_migrate_task - may task p from runqueue rq be migrated to this_cpu? | |
2894 | */ | |
858119e1 | 2895 | static |
70b97a7f | 2896 | int can_migrate_task(struct task_struct *p, struct rq *rq, int this_cpu, |
d15bcfdb | 2897 | struct sched_domain *sd, enum cpu_idle_type idle, |
95cdf3b7 | 2898 | int *all_pinned) |
1da177e4 LT |
2899 | { |
2900 | /* | |
2901 | * We do not migrate tasks that are: | |
2902 | * 1) running (obviously), or | |
2903 | * 2) cannot be migrated to this CPU due to cpus_allowed, or | |
2904 | * 3) are cache-hot on their current CPU. | |
2905 | */ | |
cc367732 IM |
2906 | if (!cpu_isset(this_cpu, p->cpus_allowed)) { |
2907 | schedstat_inc(p, se.nr_failed_migrations_affine); | |
1da177e4 | 2908 | return 0; |
cc367732 | 2909 | } |
81026794 NP |
2910 | *all_pinned = 0; |
2911 | ||
cc367732 IM |
2912 | if (task_running(rq, p)) { |
2913 | schedstat_inc(p, se.nr_failed_migrations_running); | |
81026794 | 2914 | return 0; |
cc367732 | 2915 | } |
1da177e4 | 2916 | |
da84d961 IM |
2917 | /* |
2918 | * Aggressive migration if: | |
2919 | * 1) task is cache cold, or | |
2920 | * 2) too many balance attempts have failed. | |
2921 | */ | |
2922 | ||
6bc1665b IM |
2923 | if (!task_hot(p, rq->clock, sd) || |
2924 | sd->nr_balance_failed > sd->cache_nice_tries) { | |
da84d961 | 2925 | #ifdef CONFIG_SCHEDSTATS |
cc367732 | 2926 | if (task_hot(p, rq->clock, sd)) { |
da84d961 | 2927 | schedstat_inc(sd, lb_hot_gained[idle]); |
cc367732 IM |
2928 | schedstat_inc(p, se.nr_forced_migrations); |
2929 | } | |
da84d961 IM |
2930 | #endif |
2931 | return 1; | |
2932 | } | |
2933 | ||
cc367732 IM |
2934 | if (task_hot(p, rq->clock, sd)) { |
2935 | schedstat_inc(p, se.nr_failed_migrations_hot); | |
da84d961 | 2936 | return 0; |
cc367732 | 2937 | } |
1da177e4 LT |
2938 | return 1; |
2939 | } | |
2940 | ||
e1d1484f PW |
2941 | static unsigned long |
2942 | balance_tasks(struct rq *this_rq, int this_cpu, struct rq *busiest, | |
2943 | unsigned long max_load_move, struct sched_domain *sd, | |
2944 | enum cpu_idle_type idle, int *all_pinned, | |
2945 | int *this_best_prio, struct rq_iterator *iterator) | |
1da177e4 | 2946 | { |
051c6764 | 2947 | int loops = 0, pulled = 0, pinned = 0; |
dd41f596 IM |
2948 | struct task_struct *p; |
2949 | long rem_load_move = max_load_move; | |
1da177e4 | 2950 | |
e1d1484f | 2951 | if (max_load_move == 0) |
1da177e4 LT |
2952 | goto out; |
2953 | ||
81026794 NP |
2954 | pinned = 1; |
2955 | ||
1da177e4 | 2956 | /* |
dd41f596 | 2957 | * Start the load-balancing iterator: |
1da177e4 | 2958 | */ |
dd41f596 IM |
2959 | p = iterator->start(iterator->arg); |
2960 | next: | |
b82d9fdd | 2961 | if (!p || loops++ > sysctl_sched_nr_migrate) |
1da177e4 | 2962 | goto out; |
051c6764 PZ |
2963 | |
2964 | if ((p->se.load.weight >> 1) > rem_load_move || | |
dd41f596 | 2965 | !can_migrate_task(p, busiest, this_cpu, sd, idle, &pinned)) { |
dd41f596 IM |
2966 | p = iterator->next(iterator->arg); |
2967 | goto next; | |
1da177e4 LT |
2968 | } |
2969 | ||
dd41f596 | 2970 | pull_task(busiest, p, this_rq, this_cpu); |
1da177e4 | 2971 | pulled++; |
dd41f596 | 2972 | rem_load_move -= p->se.load.weight; |
1da177e4 | 2973 | |
2dd73a4f | 2974 | /* |
b82d9fdd | 2975 | * We only want to steal up to the prescribed amount of weighted load. |
2dd73a4f | 2976 | */ |
e1d1484f | 2977 | if (rem_load_move > 0) { |
a4ac01c3 PW |
2978 | if (p->prio < *this_best_prio) |
2979 | *this_best_prio = p->prio; | |
dd41f596 IM |
2980 | p = iterator->next(iterator->arg); |
2981 | goto next; | |
1da177e4 LT |
2982 | } |
2983 | out: | |
2984 | /* | |
e1d1484f | 2985 | * Right now, this is one of only two places pull_task() is called, |
1da177e4 LT |
2986 | * so we can safely collect pull_task() stats here rather than |
2987 | * inside pull_task(). | |
2988 | */ | |
2989 | schedstat_add(sd, lb_gained[idle], pulled); | |
81026794 NP |
2990 | |
2991 | if (all_pinned) | |
2992 | *all_pinned = pinned; | |
e1d1484f PW |
2993 | |
2994 | return max_load_move - rem_load_move; | |
1da177e4 LT |
2995 | } |
2996 | ||
dd41f596 | 2997 | /* |
43010659 PW |
2998 | * move_tasks tries to move up to max_load_move weighted load from busiest to |
2999 | * this_rq, as part of a balancing operation within domain "sd". | |
3000 | * Returns 1 if successful and 0 otherwise. | |
dd41f596 IM |
3001 | * |
3002 | * Called with both runqueues locked. | |
3003 | */ | |
3004 | static int move_tasks(struct rq *this_rq, int this_cpu, struct rq *busiest, | |
43010659 | 3005 | unsigned long max_load_move, |
dd41f596 IM |
3006 | struct sched_domain *sd, enum cpu_idle_type idle, |
3007 | int *all_pinned) | |
3008 | { | |
5522d5d5 | 3009 | const struct sched_class *class = sched_class_highest; |
43010659 | 3010 | unsigned long total_load_moved = 0; |
a4ac01c3 | 3011 | int this_best_prio = this_rq->curr->prio; |
dd41f596 IM |
3012 | |
3013 | do { | |
43010659 PW |
3014 | total_load_moved += |
3015 | class->load_balance(this_rq, this_cpu, busiest, | |
e1d1484f | 3016 | max_load_move - total_load_moved, |
a4ac01c3 | 3017 | sd, idle, all_pinned, &this_best_prio); |
dd41f596 | 3018 | class = class->next; |
c4acb2c0 GH |
3019 | |
3020 | if (idle == CPU_NEWLY_IDLE && this_rq->nr_running) | |
3021 | break; | |
3022 | ||
43010659 | 3023 | } while (class && max_load_move > total_load_moved); |
dd41f596 | 3024 | |
43010659 PW |
3025 | return total_load_moved > 0; |
3026 | } | |
3027 | ||
e1d1484f PW |
3028 | static int |
3029 | iter_move_one_task(struct rq *this_rq, int this_cpu, struct rq *busiest, | |
3030 | struct sched_domain *sd, enum cpu_idle_type idle, | |
3031 | struct rq_iterator *iterator) | |
3032 | { | |
3033 | struct task_struct *p = iterator->start(iterator->arg); | |
3034 | int pinned = 0; | |
3035 | ||
3036 | while (p) { | |
3037 | if (can_migrate_task(p, busiest, this_cpu, sd, idle, &pinned)) { | |
3038 | pull_task(busiest, p, this_rq, this_cpu); | |
3039 | /* | |
3040 | * Right now, this is only the second place pull_task() | |
3041 | * is called, so we can safely collect pull_task() | |
3042 | * stats here rather than inside pull_task(). | |
3043 | */ | |
3044 | schedstat_inc(sd, lb_gained[idle]); | |
3045 | ||
3046 | return 1; | |
3047 | } | |
3048 | p = iterator->next(iterator->arg); | |
3049 | } | |
3050 | ||
3051 | return 0; | |
3052 | } | |
3053 | ||
43010659 PW |
3054 | /* |
3055 | * move_one_task tries to move exactly one task from busiest to this_rq, as | |
3056 | * part of active balancing operations within "domain". | |
3057 | * Returns 1 if successful and 0 otherwise. | |
3058 | * | |
3059 | * Called with both runqueues locked. | |
3060 | */ | |
3061 | static int move_one_task(struct rq *this_rq, int this_cpu, struct rq *busiest, | |
3062 | struct sched_domain *sd, enum cpu_idle_type idle) | |
3063 | { | |
5522d5d5 | 3064 | const struct sched_class *class; |
43010659 PW |
3065 | |
3066 | for (class = sched_class_highest; class; class = class->next) | |
e1d1484f | 3067 | if (class->move_one_task(this_rq, this_cpu, busiest, sd, idle)) |
43010659 PW |
3068 | return 1; |
3069 | ||
3070 | return 0; | |
dd41f596 IM |
3071 | } |
3072 | ||
1da177e4 LT |
3073 | /* |
3074 | * find_busiest_group finds and returns the busiest CPU group within the | |
48f24c4d IM |
3075 | * domain. It calculates and returns the amount of weighted load which |
3076 | * should be moved to restore balance via the imbalance parameter. | |
1da177e4 LT |
3077 | */ |
3078 | static struct sched_group * | |
3079 | find_busiest_group(struct sched_domain *sd, int this_cpu, | |
dd41f596 | 3080 | unsigned long *imbalance, enum cpu_idle_type idle, |
7c16ec58 | 3081 | int *sd_idle, const cpumask_t *cpus, int *balance) |
1da177e4 LT |
3082 | { |
3083 | struct sched_group *busiest = NULL, *this = NULL, *group = sd->groups; | |
3084 | unsigned long max_load, avg_load, total_load, this_load, total_pwr; | |
0c117f1b | 3085 | unsigned long max_pull; |
2dd73a4f PW |
3086 | unsigned long busiest_load_per_task, busiest_nr_running; |
3087 | unsigned long this_load_per_task, this_nr_running; | |
908a7c1b | 3088 | int load_idx, group_imb = 0; |
5c45bf27 SS |
3089 | #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT) |
3090 | int power_savings_balance = 1; | |
3091 | unsigned long leader_nr_running = 0, min_load_per_task = 0; | |
3092 | unsigned long min_nr_running = ULONG_MAX; | |
3093 | struct sched_group *group_min = NULL, *group_leader = NULL; | |
3094 | #endif | |
1da177e4 LT |
3095 | |
3096 | max_load = this_load = total_load = total_pwr = 0; | |
2dd73a4f PW |
3097 | busiest_load_per_task = busiest_nr_running = 0; |
3098 | this_load_per_task = this_nr_running = 0; | |
408ed066 | 3099 | |
d15bcfdb | 3100 | if (idle == CPU_NOT_IDLE) |
7897986b | 3101 | load_idx = sd->busy_idx; |
d15bcfdb | 3102 | else if (idle == CPU_NEWLY_IDLE) |
7897986b NP |
3103 | load_idx = sd->newidle_idx; |
3104 | else | |
3105 | load_idx = sd->idle_idx; | |
1da177e4 LT |
3106 | |
3107 | do { | |
908a7c1b | 3108 | unsigned long load, group_capacity, max_cpu_load, min_cpu_load; |
1da177e4 LT |
3109 | int local_group; |
3110 | int i; | |
908a7c1b | 3111 | int __group_imb = 0; |
783609c6 | 3112 | unsigned int balance_cpu = -1, first_idle_cpu = 0; |
2dd73a4f | 3113 | unsigned long sum_nr_running, sum_weighted_load; |
408ed066 PZ |
3114 | unsigned long sum_avg_load_per_task; |
3115 | unsigned long avg_load_per_task; | |
1da177e4 LT |
3116 | |
3117 | local_group = cpu_isset(this_cpu, group->cpumask); | |
3118 | ||
783609c6 SS |
3119 | if (local_group) |
3120 | balance_cpu = first_cpu(group->cpumask); | |
3121 | ||
1da177e4 | 3122 | /* Tally up the load of all CPUs in the group */ |
2dd73a4f | 3123 | sum_weighted_load = sum_nr_running = avg_load = 0; |
408ed066 PZ |
3124 | sum_avg_load_per_task = avg_load_per_task = 0; |
3125 | ||
908a7c1b KC |
3126 | max_cpu_load = 0; |
3127 | min_cpu_load = ~0UL; | |
1da177e4 | 3128 | |
363ab6f1 | 3129 | for_each_cpu_mask_nr(i, group->cpumask) { |
0a2966b4 CL |
3130 | struct rq *rq; |
3131 | ||
3132 | if (!cpu_isset(i, *cpus)) | |
3133 | continue; | |
3134 | ||
3135 | rq = cpu_rq(i); | |
2dd73a4f | 3136 | |
9439aab8 | 3137 | if (*sd_idle && rq->nr_running) |
5969fe06 NP |
3138 | *sd_idle = 0; |
3139 | ||
1da177e4 | 3140 | /* Bias balancing toward cpus of our domain */ |
783609c6 SS |
3141 | if (local_group) { |
3142 | if (idle_cpu(i) && !first_idle_cpu) { | |
3143 | first_idle_cpu = 1; | |
3144 | balance_cpu = i; | |
3145 | } | |
3146 | ||
a2000572 | 3147 | load = target_load(i, load_idx); |
908a7c1b | 3148 | } else { |
a2000572 | 3149 | load = source_load(i, load_idx); |
908a7c1b KC |
3150 | if (load > max_cpu_load) |
3151 | max_cpu_load = load; | |
3152 | if (min_cpu_load > load) | |
3153 | min_cpu_load = load; | |
3154 | } | |
1da177e4 LT |
3155 | |
3156 | avg_load += load; | |
2dd73a4f | 3157 | sum_nr_running += rq->nr_running; |
dd41f596 | 3158 | sum_weighted_load += weighted_cpuload(i); |
408ed066 PZ |
3159 | |
3160 | sum_avg_load_per_task += cpu_avg_load_per_task(i); | |
1da177e4 LT |
3161 | } |
3162 | ||
783609c6 SS |
3163 | /* |
3164 | * First idle cpu or the first cpu(busiest) in this sched group | |
3165 | * is eligible for doing load balancing at this and above | |
9439aab8 SS |
3166 | * domains. In the newly idle case, we will allow all the cpu's |
3167 | * to do the newly idle load balance. | |
783609c6 | 3168 | */ |
9439aab8 SS |
3169 | if (idle != CPU_NEWLY_IDLE && local_group && |
3170 | balance_cpu != this_cpu && balance) { | |
783609c6 SS |
3171 | *balance = 0; |
3172 | goto ret; | |
3173 | } | |
3174 | ||
1da177e4 | 3175 | total_load += avg_load; |
5517d86b | 3176 | total_pwr += group->__cpu_power; |
1da177e4 LT |
3177 | |
3178 | /* Adjust by relative CPU power of the group */ | |
5517d86b ED |
3179 | avg_load = sg_div_cpu_power(group, |
3180 | avg_load * SCHED_LOAD_SCALE); | |
1da177e4 | 3181 | |
408ed066 PZ |
3182 | |
3183 | /* | |
3184 | * Consider the group unbalanced when the imbalance is larger | |
3185 | * than the average weight of two tasks. | |
3186 | * | |
3187 | * APZ: with cgroup the avg task weight can vary wildly and | |
3188 | * might not be a suitable number - should we keep a | |
3189 | * normalized nr_running number somewhere that negates | |
3190 | * the hierarchy? | |
3191 | */ | |
3192 | avg_load_per_task = sg_div_cpu_power(group, | |
3193 | sum_avg_load_per_task * SCHED_LOAD_SCALE); | |
3194 | ||
3195 | if ((max_cpu_load - min_cpu_load) > 2*avg_load_per_task) | |
908a7c1b KC |
3196 | __group_imb = 1; |
3197 | ||
5517d86b | 3198 | group_capacity = group->__cpu_power / SCHED_LOAD_SCALE; |
5c45bf27 | 3199 | |
1da177e4 LT |
3200 | if (local_group) { |
3201 | this_load = avg_load; | |
3202 | this = group; | |
2dd73a4f PW |
3203 | this_nr_running = sum_nr_running; |
3204 | this_load_per_task = sum_weighted_load; | |
3205 | } else if (avg_load > max_load && | |
908a7c1b | 3206 | (sum_nr_running > group_capacity || __group_imb)) { |
1da177e4 LT |
3207 | max_load = avg_load; |
3208 | busiest = group; | |
2dd73a4f PW |
3209 | busiest_nr_running = sum_nr_running; |
3210 | busiest_load_per_task = sum_weighted_load; | |
908a7c1b | 3211 | group_imb = __group_imb; |
1da177e4 | 3212 | } |
5c45bf27 SS |
3213 | |
3214 | #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT) | |
3215 | /* | |
3216 | * Busy processors will not participate in power savings | |
3217 | * balance. | |
3218 | */ | |
dd41f596 IM |
3219 | if (idle == CPU_NOT_IDLE || |
3220 | !(sd->flags & SD_POWERSAVINGS_BALANCE)) | |
3221 | goto group_next; | |
5c45bf27 SS |
3222 | |
3223 | /* | |
3224 | * If the local group is idle or completely loaded | |
3225 | * no need to do power savings balance at this domain | |
3226 | */ | |
3227 | if (local_group && (this_nr_running >= group_capacity || | |
3228 | !this_nr_running)) | |
3229 | power_savings_balance = 0; | |
3230 | ||
dd41f596 | 3231 | /* |
5c45bf27 SS |
3232 | * If a group is already running at full capacity or idle, |
3233 | * don't include that group in power savings calculations | |
dd41f596 IM |
3234 | */ |
3235 | if (!power_savings_balance || sum_nr_running >= group_capacity | |
5c45bf27 | 3236 | || !sum_nr_running) |
dd41f596 | 3237 | goto group_next; |
5c45bf27 | 3238 | |
dd41f596 | 3239 | /* |
5c45bf27 | 3240 | * Calculate the group which has the least non-idle load. |
dd41f596 IM |
3241 | * This is the group from where we need to pick up the load |
3242 | * for saving power | |
3243 | */ | |
3244 | if ((sum_nr_running < min_nr_running) || | |
3245 | (sum_nr_running == min_nr_running && | |
5c45bf27 SS |
3246 | first_cpu(group->cpumask) < |
3247 | first_cpu(group_min->cpumask))) { | |
dd41f596 IM |
3248 | group_min = group; |
3249 | min_nr_running = sum_nr_running; | |
5c45bf27 SS |
3250 | min_load_per_task = sum_weighted_load / |
3251 | sum_nr_running; | |
dd41f596 | 3252 | } |
5c45bf27 | 3253 | |
dd41f596 | 3254 | /* |
5c45bf27 | 3255 | * Calculate the group which is almost near its |
dd41f596 IM |
3256 | * capacity but still has some space to pick up some load |
3257 | * from other group and save more power | |
3258 | */ | |
3259 | if (sum_nr_running <= group_capacity - 1) { | |
3260 | if (sum_nr_running > leader_nr_running || | |
3261 | (sum_nr_running == leader_nr_running && | |
3262 | first_cpu(group->cpumask) > | |
3263 | first_cpu(group_leader->cpumask))) { | |
3264 | group_leader = group; | |
3265 | leader_nr_running = sum_nr_running; | |
3266 | } | |
48f24c4d | 3267 | } |
5c45bf27 SS |
3268 | group_next: |
3269 | #endif | |
1da177e4 LT |
3270 | group = group->next; |
3271 | } while (group != sd->groups); | |
3272 | ||
2dd73a4f | 3273 | if (!busiest || this_load >= max_load || busiest_nr_running == 0) |
1da177e4 LT |
3274 | goto out_balanced; |
3275 | ||
3276 | avg_load = (SCHED_LOAD_SCALE * total_load) / total_pwr; | |
3277 | ||
3278 | if (this_load >= avg_load || | |
3279 | 100*max_load <= sd->imbalance_pct*this_load) | |
3280 | goto out_balanced; | |
3281 | ||
2dd73a4f | 3282 | busiest_load_per_task /= busiest_nr_running; |
908a7c1b KC |
3283 | if (group_imb) |
3284 | busiest_load_per_task = min(busiest_load_per_task, avg_load); | |
3285 | ||
1da177e4 LT |
3286 | /* |
3287 | * We're trying to get all the cpus to the average_load, so we don't | |
3288 | * want to push ourselves above the average load, nor do we wish to | |
3289 | * reduce the max loaded cpu below the average load, as either of these | |
3290 | * actions would just result in more rebalancing later, and ping-pong | |
3291 | * tasks around. Thus we look for the minimum possible imbalance. | |
3292 | * Negative imbalances (*we* are more loaded than anyone else) will | |
3293 | * be counted as no imbalance for these purposes -- we can't fix that | |
41a2d6cf | 3294 | * by pulling tasks to us. Be careful of negative numbers as they'll |
1da177e4 LT |
3295 | * appear as very large values with unsigned longs. |
3296 | */ | |
2dd73a4f PW |
3297 | if (max_load <= busiest_load_per_task) |
3298 | goto out_balanced; | |
3299 | ||
3300 | /* | |
3301 | * In the presence of smp nice balancing, certain scenarios can have | |
3302 | * max load less than avg load(as we skip the groups at or below | |
3303 | * its cpu_power, while calculating max_load..) | |
3304 | */ | |
3305 | if (max_load < avg_load) { | |
3306 | *imbalance = 0; | |
3307 | goto small_imbalance; | |
3308 | } | |
0c117f1b SS |
3309 | |
3310 | /* Don't want to pull so many tasks that a group would go idle */ | |
2dd73a4f | 3311 | max_pull = min(max_load - avg_load, max_load - busiest_load_per_task); |
0c117f1b | 3312 | |
1da177e4 | 3313 | /* How much load to actually move to equalise the imbalance */ |
5517d86b ED |
3314 | *imbalance = min(max_pull * busiest->__cpu_power, |
3315 | (avg_load - this_load) * this->__cpu_power) | |
1da177e4 LT |
3316 | / SCHED_LOAD_SCALE; |
3317 | ||
2dd73a4f PW |
3318 | /* |
3319 | * if *imbalance is less than the average load per runnable task | |
3320 | * there is no gaurantee that any tasks will be moved so we'll have | |
3321 | * a think about bumping its value to force at least one task to be | |
3322 | * moved | |
3323 | */ | |
7fd0d2dd | 3324 | if (*imbalance < busiest_load_per_task) { |
48f24c4d | 3325 | unsigned long tmp, pwr_now, pwr_move; |
2dd73a4f PW |
3326 | unsigned int imbn; |
3327 | ||
3328 | small_imbalance: | |
3329 | pwr_move = pwr_now = 0; | |
3330 | imbn = 2; | |
3331 | if (this_nr_running) { | |
3332 | this_load_per_task /= this_nr_running; | |
3333 | if (busiest_load_per_task > this_load_per_task) | |
3334 | imbn = 1; | |
3335 | } else | |
408ed066 | 3336 | this_load_per_task = cpu_avg_load_per_task(this_cpu); |
1da177e4 | 3337 | |
01c8c57d | 3338 | if (max_load - this_load + busiest_load_per_task >= |
dd41f596 | 3339 | busiest_load_per_task * imbn) { |
2dd73a4f | 3340 | *imbalance = busiest_load_per_task; |
1da177e4 LT |
3341 | return busiest; |
3342 | } | |
3343 | ||
3344 | /* | |
3345 | * OK, we don't have enough imbalance to justify moving tasks, | |
3346 | * however we may be able to increase total CPU power used by | |
3347 | * moving them. | |
3348 | */ | |
3349 | ||
5517d86b ED |
3350 | pwr_now += busiest->__cpu_power * |
3351 | min(busiest_load_per_task, max_load); | |
3352 | pwr_now += this->__cpu_power * | |
3353 | min(this_load_per_task, this_load); | |
1da177e4 LT |
3354 | pwr_now /= SCHED_LOAD_SCALE; |
3355 | ||
3356 | /* Amount of load we'd subtract */ | |
5517d86b ED |
3357 | tmp = sg_div_cpu_power(busiest, |
3358 | busiest_load_per_task * SCHED_LOAD_SCALE); | |
1da177e4 | 3359 | if (max_load > tmp) |
5517d86b | 3360 | pwr_move += busiest->__cpu_power * |
2dd73a4f | 3361 | min(busiest_load_per_task, max_load - tmp); |
1da177e4 LT |
3362 | |
3363 | /* Amount of load we'd add */ | |
5517d86b | 3364 | if (max_load * busiest->__cpu_power < |
33859f7f | 3365 | busiest_load_per_task * SCHED_LOAD_SCALE) |
5517d86b ED |
3366 | tmp = sg_div_cpu_power(this, |
3367 | max_load * busiest->__cpu_power); | |
1da177e4 | 3368 | else |
5517d86b ED |
3369 | tmp = sg_div_cpu_power(this, |
3370 | busiest_load_per_task * SCHED_LOAD_SCALE); | |
3371 | pwr_move += this->__cpu_power * | |
3372 | min(this_load_per_task, this_load + tmp); | |
1da177e4 LT |
3373 | pwr_move /= SCHED_LOAD_SCALE; |
3374 | ||
3375 | /* Move if we gain throughput */ | |
7fd0d2dd SS |
3376 | if (pwr_move > pwr_now) |
3377 | *imbalance = busiest_load_per_task; | |
1da177e4 LT |
3378 | } |
3379 | ||
1da177e4 LT |
3380 | return busiest; |
3381 | ||
3382 | out_balanced: | |
5c45bf27 | 3383 | #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT) |
d15bcfdb | 3384 | if (idle == CPU_NOT_IDLE || !(sd->flags & SD_POWERSAVINGS_BALANCE)) |
5c45bf27 | 3385 | goto ret; |
1da177e4 | 3386 | |
5c45bf27 SS |
3387 | if (this == group_leader && group_leader != group_min) { |
3388 | *imbalance = min_load_per_task; | |
3389 | return group_min; | |
3390 | } | |
5c45bf27 | 3391 | #endif |
783609c6 | 3392 | ret: |
1da177e4 LT |
3393 | *imbalance = 0; |
3394 | return NULL; | |
3395 | } | |
3396 | ||
3397 | /* | |
3398 | * find_busiest_queue - find the busiest runqueue among the cpus in group. | |
3399 | */ | |
70b97a7f | 3400 | static struct rq * |
d15bcfdb | 3401 | find_busiest_queue(struct sched_group *group, enum cpu_idle_type idle, |
7c16ec58 | 3402 | unsigned long imbalance, const cpumask_t *cpus) |
1da177e4 | 3403 | { |
70b97a7f | 3404 | struct rq *busiest = NULL, *rq; |
2dd73a4f | 3405 | unsigned long max_load = 0; |
1da177e4 LT |
3406 | int i; |
3407 | ||
363ab6f1 | 3408 | for_each_cpu_mask_nr(i, group->cpumask) { |
dd41f596 | 3409 | unsigned long wl; |
0a2966b4 CL |
3410 | |
3411 | if (!cpu_isset(i, *cpus)) | |
3412 | continue; | |
3413 | ||
48f24c4d | 3414 | rq = cpu_rq(i); |
dd41f596 | 3415 | wl = weighted_cpuload(i); |
2dd73a4f | 3416 | |
dd41f596 | 3417 | if (rq->nr_running == 1 && wl > imbalance) |
2dd73a4f | 3418 | continue; |
1da177e4 | 3419 | |
dd41f596 IM |
3420 | if (wl > max_load) { |
3421 | max_load = wl; | |
48f24c4d | 3422 | busiest = rq; |
1da177e4 LT |
3423 | } |
3424 | } | |
3425 | ||
3426 | return busiest; | |
3427 | } | |
3428 | ||
77391d71 NP |
3429 | /* |
3430 | * Max backoff if we encounter pinned tasks. Pretty arbitrary value, but | |
3431 | * so long as it is large enough. | |
3432 | */ | |
3433 | #define MAX_PINNED_INTERVAL 512 | |
3434 | ||
1da177e4 LT |
3435 | /* |
3436 | * Check this_cpu to ensure it is balanced within domain. Attempt to move | |
3437 | * tasks if there is an imbalance. | |
1da177e4 | 3438 | */ |
70b97a7f | 3439 | static int load_balance(int this_cpu, struct rq *this_rq, |
d15bcfdb | 3440 | struct sched_domain *sd, enum cpu_idle_type idle, |
7c16ec58 | 3441 | int *balance, cpumask_t *cpus) |
1da177e4 | 3442 | { |
43010659 | 3443 | int ld_moved, all_pinned = 0, active_balance = 0, sd_idle = 0; |
1da177e4 | 3444 | struct sched_group *group; |
1da177e4 | 3445 | unsigned long imbalance; |
70b97a7f | 3446 | struct rq *busiest; |
fe2eea3f | 3447 | unsigned long flags; |
5969fe06 | 3448 | |
7c16ec58 MT |
3449 | cpus_setall(*cpus); |
3450 | ||
89c4710e SS |
3451 | /* |
3452 | * When power savings policy is enabled for the parent domain, idle | |
3453 | * sibling can pick up load irrespective of busy siblings. In this case, | |
dd41f596 | 3454 | * let the state of idle sibling percolate up as CPU_IDLE, instead of |
d15bcfdb | 3455 | * portraying it as CPU_NOT_IDLE. |
89c4710e | 3456 | */ |
d15bcfdb | 3457 | if (idle != CPU_NOT_IDLE && sd->flags & SD_SHARE_CPUPOWER && |
89c4710e | 3458 | !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE)) |
5969fe06 | 3459 | sd_idle = 1; |
1da177e4 | 3460 | |
2d72376b | 3461 | schedstat_inc(sd, lb_count[idle]); |
1da177e4 | 3462 | |
0a2966b4 | 3463 | redo: |
c8cba857 | 3464 | update_shares(sd); |
0a2966b4 | 3465 | group = find_busiest_group(sd, this_cpu, &imbalance, idle, &sd_idle, |
7c16ec58 | 3466 | cpus, balance); |
783609c6 | 3467 | |
06066714 | 3468 | if (*balance == 0) |
783609c6 | 3469 | goto out_balanced; |
783609c6 | 3470 | |
1da177e4 LT |
3471 | if (!group) { |
3472 | schedstat_inc(sd, lb_nobusyg[idle]); | |
3473 | goto out_balanced; | |
3474 | } | |
3475 | ||
7c16ec58 | 3476 | busiest = find_busiest_queue(group, idle, imbalance, cpus); |
1da177e4 LT |
3477 | if (!busiest) { |
3478 | schedstat_inc(sd, lb_nobusyq[idle]); | |
3479 | goto out_balanced; | |
3480 | } | |
3481 | ||
db935dbd | 3482 | BUG_ON(busiest == this_rq); |
1da177e4 LT |
3483 | |
3484 | schedstat_add(sd, lb_imbalance[idle], imbalance); | |
3485 | ||
43010659 | 3486 | ld_moved = 0; |
1da177e4 LT |
3487 | if (busiest->nr_running > 1) { |
3488 | /* | |
3489 | * Attempt to move tasks. If find_busiest_group has found | |
3490 | * an imbalance but busiest->nr_running <= 1, the group is | |
43010659 | 3491 | * still unbalanced. ld_moved simply stays zero, so it is |
1da177e4 LT |
3492 | * correctly treated as an imbalance. |
3493 | */ | |
fe2eea3f | 3494 | local_irq_save(flags); |
e17224bf | 3495 | double_rq_lock(this_rq, busiest); |
43010659 | 3496 | ld_moved = move_tasks(this_rq, this_cpu, busiest, |
48f24c4d | 3497 | imbalance, sd, idle, &all_pinned); |
e17224bf | 3498 | double_rq_unlock(this_rq, busiest); |
fe2eea3f | 3499 | local_irq_restore(flags); |
81026794 | 3500 | |
46cb4b7c SS |
3501 | /* |
3502 | * some other cpu did the load balance for us. | |
3503 | */ | |
43010659 | 3504 | if (ld_moved && this_cpu != smp_processor_id()) |
46cb4b7c SS |
3505 | resched_cpu(this_cpu); |
3506 | ||
81026794 | 3507 | /* All tasks on this runqueue were pinned by CPU affinity */ |
0a2966b4 | 3508 | if (unlikely(all_pinned)) { |
7c16ec58 MT |
3509 | cpu_clear(cpu_of(busiest), *cpus); |
3510 | if (!cpus_empty(*cpus)) | |
0a2966b4 | 3511 | goto redo; |
81026794 | 3512 | goto out_balanced; |
0a2966b4 | 3513 | } |
1da177e4 | 3514 | } |
81026794 | 3515 | |
43010659 | 3516 | if (!ld_moved) { |
1da177e4 LT |
3517 | schedstat_inc(sd, lb_failed[idle]); |
3518 | sd->nr_balance_failed++; | |
3519 | ||
3520 | if (unlikely(sd->nr_balance_failed > sd->cache_nice_tries+2)) { | |
1da177e4 | 3521 | |
fe2eea3f | 3522 | spin_lock_irqsave(&busiest->lock, flags); |
fa3b6ddc SS |
3523 | |
3524 | /* don't kick the migration_thread, if the curr | |
3525 | * task on busiest cpu can't be moved to this_cpu | |
3526 | */ | |
3527 | if (!cpu_isset(this_cpu, busiest->curr->cpus_allowed)) { | |
fe2eea3f | 3528 | spin_unlock_irqrestore(&busiest->lock, flags); |
fa3b6ddc SS |
3529 | all_pinned = 1; |
3530 | goto out_one_pinned; | |
3531 | } | |
3532 | ||
1da177e4 LT |
3533 | if (!busiest->active_balance) { |
3534 | busiest->active_balance = 1; | |
3535 | busiest->push_cpu = this_cpu; | |
81026794 | 3536 | active_balance = 1; |
1da177e4 | 3537 | } |
fe2eea3f | 3538 | spin_unlock_irqrestore(&busiest->lock, flags); |
81026794 | 3539 | if (active_balance) |
1da177e4 LT |
3540 | wake_up_process(busiest->migration_thread); |
3541 | ||
3542 | /* | |
3543 | * We've kicked active balancing, reset the failure | |
3544 | * counter. | |
3545 | */ | |
39507451 | 3546 | sd->nr_balance_failed = sd->cache_nice_tries+1; |
1da177e4 | 3547 | } |
81026794 | 3548 | } else |
1da177e4 LT |
3549 | sd->nr_balance_failed = 0; |
3550 | ||
81026794 | 3551 | if (likely(!active_balance)) { |
1da177e4 LT |
3552 | /* We were unbalanced, so reset the balancing interval */ |
3553 | sd->balance_interval = sd->min_interval; | |
81026794 NP |
3554 | } else { |
3555 | /* | |
3556 | * If we've begun active balancing, start to back off. This | |
3557 | * case may not be covered by the all_pinned logic if there | |
3558 | * is only 1 task on the busy runqueue (because we don't call | |
3559 | * move_tasks). | |
3560 | */ | |
3561 | if (sd->balance_interval < sd->max_interval) | |
3562 | sd->balance_interval *= 2; | |
1da177e4 LT |
3563 | } |
3564 | ||
43010659 | 3565 | if (!ld_moved && !sd_idle && sd->flags & SD_SHARE_CPUPOWER && |
89c4710e | 3566 | !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE)) |
c09595f6 PZ |
3567 | ld_moved = -1; |
3568 | ||
3569 | goto out; | |
1da177e4 LT |
3570 | |
3571 | out_balanced: | |
1da177e4 LT |
3572 | schedstat_inc(sd, lb_balanced[idle]); |
3573 | ||
16cfb1c0 | 3574 | sd->nr_balance_failed = 0; |
fa3b6ddc SS |
3575 | |
3576 | out_one_pinned: | |
1da177e4 | 3577 | /* tune up the balancing interval */ |
77391d71 NP |
3578 | if ((all_pinned && sd->balance_interval < MAX_PINNED_INTERVAL) || |
3579 | (sd->balance_interval < sd->max_interval)) | |
1da177e4 LT |
3580 | sd->balance_interval *= 2; |
3581 | ||
48f24c4d | 3582 | if (!sd_idle && sd->flags & SD_SHARE_CPUPOWER && |
89c4710e | 3583 | !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE)) |
c09595f6 PZ |
3584 | ld_moved = -1; |
3585 | else | |
3586 | ld_moved = 0; | |
3587 | out: | |
c8cba857 PZ |
3588 | if (ld_moved) |
3589 | update_shares(sd); | |
c09595f6 | 3590 | return ld_moved; |
1da177e4 LT |
3591 | } |
3592 | ||
3593 | /* | |
3594 | * Check this_cpu to ensure it is balanced within domain. Attempt to move | |
3595 | * tasks if there is an imbalance. | |
3596 | * | |
d15bcfdb | 3597 | * Called from schedule when this_rq is about to become idle (CPU_NEWLY_IDLE). |
1da177e4 LT |
3598 | * this_rq is locked. |
3599 | */ | |
48f24c4d | 3600 | static int |
7c16ec58 MT |
3601 | load_balance_newidle(int this_cpu, struct rq *this_rq, struct sched_domain *sd, |
3602 | cpumask_t *cpus) | |
1da177e4 LT |
3603 | { |
3604 | struct sched_group *group; | |
70b97a7f | 3605 | struct rq *busiest = NULL; |
1da177e4 | 3606 | unsigned long imbalance; |
43010659 | 3607 | int ld_moved = 0; |
5969fe06 | 3608 | int sd_idle = 0; |
969bb4e4 | 3609 | int all_pinned = 0; |
7c16ec58 MT |
3610 | |
3611 | cpus_setall(*cpus); | |
5969fe06 | 3612 | |
89c4710e SS |
3613 | /* |
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 IDLE, instead of | |
d15bcfdb | 3617 | * portraying it as CPU_NOT_IDLE. |
89c4710e SS |
3618 | */ |
3619 | if (sd->flags & SD_SHARE_CPUPOWER && | |
3620 | !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE)) | |
5969fe06 | 3621 | sd_idle = 1; |
1da177e4 | 3622 | |
2d72376b | 3623 | schedstat_inc(sd, lb_count[CPU_NEWLY_IDLE]); |
0a2966b4 | 3624 | redo: |
3e5459b4 | 3625 | update_shares_locked(this_rq, sd); |
d15bcfdb | 3626 | group = find_busiest_group(sd, this_cpu, &imbalance, CPU_NEWLY_IDLE, |
7c16ec58 | 3627 | &sd_idle, cpus, NULL); |
1da177e4 | 3628 | if (!group) { |
d15bcfdb | 3629 | schedstat_inc(sd, lb_nobusyg[CPU_NEWLY_IDLE]); |
16cfb1c0 | 3630 | goto out_balanced; |
1da177e4 LT |
3631 | } |
3632 | ||
7c16ec58 | 3633 | busiest = find_busiest_queue(group, CPU_NEWLY_IDLE, imbalance, cpus); |
db935dbd | 3634 | if (!busiest) { |
d15bcfdb | 3635 | schedstat_inc(sd, lb_nobusyq[CPU_NEWLY_IDLE]); |
16cfb1c0 | 3636 | goto out_balanced; |
1da177e4 LT |
3637 | } |
3638 | ||
db935dbd NP |
3639 | BUG_ON(busiest == this_rq); |
3640 | ||
d15bcfdb | 3641 | schedstat_add(sd, lb_imbalance[CPU_NEWLY_IDLE], imbalance); |
d6d5cfaf | 3642 | |
43010659 | 3643 | ld_moved = 0; |
d6d5cfaf NP |
3644 | if (busiest->nr_running > 1) { |
3645 | /* Attempt to move tasks */ | |
3646 | double_lock_balance(this_rq, busiest); | |
6e82a3be IM |
3647 | /* this_rq->clock is already updated */ |
3648 | update_rq_clock(busiest); | |
43010659 | 3649 | ld_moved = move_tasks(this_rq, this_cpu, busiest, |
969bb4e4 SS |
3650 | imbalance, sd, CPU_NEWLY_IDLE, |
3651 | &all_pinned); | |
1b12bbc7 | 3652 | double_unlock_balance(this_rq, busiest); |
0a2966b4 | 3653 | |
969bb4e4 | 3654 | if (unlikely(all_pinned)) { |
7c16ec58 MT |
3655 | cpu_clear(cpu_of(busiest), *cpus); |
3656 | if (!cpus_empty(*cpus)) | |
0a2966b4 CL |
3657 | goto redo; |
3658 | } | |
d6d5cfaf NP |
3659 | } |
3660 | ||
43010659 | 3661 | if (!ld_moved) { |
d15bcfdb | 3662 | schedstat_inc(sd, lb_failed[CPU_NEWLY_IDLE]); |
89c4710e SS |
3663 | if (!sd_idle && sd->flags & SD_SHARE_CPUPOWER && |
3664 | !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE)) | |
5969fe06 NP |
3665 | return -1; |
3666 | } else | |
16cfb1c0 | 3667 | sd->nr_balance_failed = 0; |
1da177e4 | 3668 | |
3e5459b4 | 3669 | update_shares_locked(this_rq, sd); |
43010659 | 3670 | return ld_moved; |
16cfb1c0 NP |
3671 | |
3672 | out_balanced: | |
d15bcfdb | 3673 | schedstat_inc(sd, lb_balanced[CPU_NEWLY_IDLE]); |
48f24c4d | 3674 | if (!sd_idle && sd->flags & SD_SHARE_CPUPOWER && |
89c4710e | 3675 | !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE)) |
5969fe06 | 3676 | return -1; |
16cfb1c0 | 3677 | sd->nr_balance_failed = 0; |
48f24c4d | 3678 | |
16cfb1c0 | 3679 | return 0; |
1da177e4 LT |
3680 | } |
3681 | ||
3682 | /* | |
3683 | * idle_balance is called by schedule() if this_cpu is about to become | |
3684 | * idle. Attempts to pull tasks from other CPUs. | |
3685 | */ | |
70b97a7f | 3686 | static void idle_balance(int this_cpu, struct rq *this_rq) |
1da177e4 LT |
3687 | { |
3688 | struct sched_domain *sd; | |
dd41f596 IM |
3689 | int pulled_task = -1; |
3690 | unsigned long next_balance = jiffies + HZ; | |
7c16ec58 | 3691 | cpumask_t tmpmask; |
1da177e4 LT |
3692 | |
3693 | for_each_domain(this_cpu, sd) { | |
92c4ca5c CL |
3694 | unsigned long interval; |
3695 | ||
3696 | if (!(sd->flags & SD_LOAD_BALANCE)) | |
3697 | continue; | |
3698 | ||
3699 | if (sd->flags & SD_BALANCE_NEWIDLE) | |
48f24c4d | 3700 | /* If we've pulled tasks over stop searching: */ |
7c16ec58 MT |
3701 | pulled_task = load_balance_newidle(this_cpu, this_rq, |
3702 | sd, &tmpmask); | |
92c4ca5c CL |
3703 | |
3704 | interval = msecs_to_jiffies(sd->balance_interval); | |
3705 | if (time_after(next_balance, sd->last_balance + interval)) | |
3706 | next_balance = sd->last_balance + interval; | |
3707 | if (pulled_task) | |
3708 | break; | |
1da177e4 | 3709 | } |
dd41f596 | 3710 | if (pulled_task || time_after(jiffies, this_rq->next_balance)) { |
1bd77f2d CL |
3711 | /* |
3712 | * We are going idle. next_balance may be set based on | |
3713 | * a busy processor. So reset next_balance. | |
3714 | */ | |
3715 | this_rq->next_balance = next_balance; | |
dd41f596 | 3716 | } |
1da177e4 LT |
3717 | } |
3718 | ||
3719 | /* | |
3720 | * active_load_balance is run by migration threads. It pushes running tasks | |
3721 | * off the busiest CPU onto idle CPUs. It requires at least 1 task to be | |
3722 | * running on each physical CPU where possible, and avoids physical / | |
3723 | * logical imbalances. | |
3724 | * | |
3725 | * Called with busiest_rq locked. | |
3726 | */ | |
70b97a7f | 3727 | static void active_load_balance(struct rq *busiest_rq, int busiest_cpu) |
1da177e4 | 3728 | { |
39507451 | 3729 | int target_cpu = busiest_rq->push_cpu; |
70b97a7f IM |
3730 | struct sched_domain *sd; |
3731 | struct rq *target_rq; | |
39507451 | 3732 | |
48f24c4d | 3733 | /* Is there any task to move? */ |
39507451 | 3734 | if (busiest_rq->nr_running <= 1) |
39507451 NP |
3735 | return; |
3736 | ||
3737 | target_rq = cpu_rq(target_cpu); | |
1da177e4 LT |
3738 | |
3739 | /* | |
39507451 | 3740 | * This condition is "impossible", if it occurs |
41a2d6cf | 3741 | * we need to fix it. Originally reported by |
39507451 | 3742 | * Bjorn Helgaas on a 128-cpu setup. |
1da177e4 | 3743 | */ |
39507451 | 3744 | BUG_ON(busiest_rq == target_rq); |
1da177e4 | 3745 | |
39507451 NP |
3746 | /* move a task from busiest_rq to target_rq */ |
3747 | double_lock_balance(busiest_rq, target_rq); | |
6e82a3be IM |
3748 | update_rq_clock(busiest_rq); |
3749 | update_rq_clock(target_rq); | |
39507451 NP |
3750 | |
3751 | /* Search for an sd spanning us and the target CPU. */ | |
c96d145e | 3752 | for_each_domain(target_cpu, sd) { |
39507451 | 3753 | if ((sd->flags & SD_LOAD_BALANCE) && |
48f24c4d | 3754 | cpu_isset(busiest_cpu, sd->span)) |
39507451 | 3755 | break; |
c96d145e | 3756 | } |
39507451 | 3757 | |
48f24c4d | 3758 | if (likely(sd)) { |
2d72376b | 3759 | schedstat_inc(sd, alb_count); |
39507451 | 3760 | |
43010659 PW |
3761 | if (move_one_task(target_rq, target_cpu, busiest_rq, |
3762 | sd, CPU_IDLE)) | |
48f24c4d IM |
3763 | schedstat_inc(sd, alb_pushed); |
3764 | else | |
3765 | schedstat_inc(sd, alb_failed); | |
3766 | } | |
1b12bbc7 | 3767 | double_unlock_balance(busiest_rq, target_rq); |
1da177e4 LT |
3768 | } |
3769 | ||
46cb4b7c SS |
3770 | #ifdef CONFIG_NO_HZ |
3771 | static struct { | |
3772 | atomic_t load_balancer; | |
41a2d6cf | 3773 | cpumask_t cpu_mask; |
46cb4b7c SS |
3774 | } nohz ____cacheline_aligned = { |
3775 | .load_balancer = ATOMIC_INIT(-1), | |
3776 | .cpu_mask = CPU_MASK_NONE, | |
3777 | }; | |
3778 | ||
7835b98b | 3779 | /* |
46cb4b7c SS |
3780 | * This routine will try to nominate the ilb (idle load balancing) |
3781 | * owner among the cpus whose ticks are stopped. ilb owner will do the idle | |
3782 | * load balancing on behalf of all those cpus. If all the cpus in the system | |
3783 | * go into this tickless mode, then there will be no ilb owner (as there is | |
3784 | * no need for one) and all the cpus will sleep till the next wakeup event | |
3785 | * arrives... | |
3786 | * | |
3787 | * For the ilb owner, tick is not stopped. And this tick will be used | |
3788 | * for idle load balancing. ilb owner will still be part of | |
3789 | * nohz.cpu_mask.. | |
7835b98b | 3790 | * |
46cb4b7c SS |
3791 | * While stopping the tick, this cpu will become the ilb owner if there |
3792 | * is no other owner. And will be the owner till that cpu becomes busy | |
3793 | * or if all cpus in the system stop their ticks at which point | |
3794 | * there is no need for ilb owner. | |
3795 | * | |
3796 | * When the ilb owner becomes busy, it nominates another owner, during the | |
3797 | * next busy scheduler_tick() | |
3798 | */ | |
3799 | int select_nohz_load_balancer(int stop_tick) | |
3800 | { | |
3801 | int cpu = smp_processor_id(); | |
3802 | ||
3803 | if (stop_tick) { | |
3804 | cpu_set(cpu, nohz.cpu_mask); | |
3805 | cpu_rq(cpu)->in_nohz_recently = 1; | |
3806 | ||
3807 | /* | |
3808 | * If we are going offline and still the leader, give up! | |
3809 | */ | |
e761b772 | 3810 | if (!cpu_active(cpu) && |
46cb4b7c SS |
3811 | atomic_read(&nohz.load_balancer) == cpu) { |
3812 | if (atomic_cmpxchg(&nohz.load_balancer, cpu, -1) != cpu) | |
3813 | BUG(); | |
3814 | return 0; | |
3815 | } | |
3816 | ||
3817 | /* time for ilb owner also to sleep */ | |
3818 | if (cpus_weight(nohz.cpu_mask) == num_online_cpus()) { | |
3819 | if (atomic_read(&nohz.load_balancer) == cpu) | |
3820 | atomic_set(&nohz.load_balancer, -1); | |
3821 | return 0; | |
3822 | } | |
3823 | ||
3824 | if (atomic_read(&nohz.load_balancer) == -1) { | |
3825 | /* make me the ilb owner */ | |
3826 | if (atomic_cmpxchg(&nohz.load_balancer, -1, cpu) == -1) | |
3827 | return 1; | |
3828 | } else if (atomic_read(&nohz.load_balancer) == cpu) | |
3829 | return 1; | |
3830 | } else { | |
3831 | if (!cpu_isset(cpu, nohz.cpu_mask)) | |
3832 | return 0; | |
3833 | ||
3834 | cpu_clear(cpu, nohz.cpu_mask); | |
3835 | ||
3836 | if (atomic_read(&nohz.load_balancer) == cpu) | |
3837 | if (atomic_cmpxchg(&nohz.load_balancer, cpu, -1) != cpu) | |
3838 | BUG(); | |
3839 | } | |
3840 | return 0; | |
3841 | } | |
3842 | #endif | |
3843 | ||
3844 | static DEFINE_SPINLOCK(balancing); | |
3845 | ||
3846 | /* | |
7835b98b CL |
3847 | * It checks each scheduling domain to see if it is due to be balanced, |
3848 | * and initiates a balancing operation if so. | |
3849 | * | |
3850 | * Balancing parameters are set up in arch_init_sched_domains. | |
3851 | */ | |
a9957449 | 3852 | static void rebalance_domains(int cpu, enum cpu_idle_type idle) |
7835b98b | 3853 | { |
46cb4b7c SS |
3854 | int balance = 1; |
3855 | struct rq *rq = cpu_rq(cpu); | |
7835b98b CL |
3856 | unsigned long interval; |
3857 | struct sched_domain *sd; | |
46cb4b7c | 3858 | /* Earliest time when we have to do rebalance again */ |
c9819f45 | 3859 | unsigned long next_balance = jiffies + 60*HZ; |
f549da84 | 3860 | int update_next_balance = 0; |
d07355f5 | 3861 | int need_serialize; |
7c16ec58 | 3862 | cpumask_t tmp; |
1da177e4 | 3863 | |
46cb4b7c | 3864 | for_each_domain(cpu, sd) { |
1da177e4 LT |
3865 | if (!(sd->flags & SD_LOAD_BALANCE)) |
3866 | continue; | |
3867 | ||
3868 | interval = sd->balance_interval; | |
d15bcfdb | 3869 | if (idle != CPU_IDLE) |
1da177e4 LT |
3870 | interval *= sd->busy_factor; |
3871 | ||
3872 | /* scale ms to jiffies */ | |
3873 | interval = msecs_to_jiffies(interval); | |
3874 | if (unlikely(!interval)) | |
3875 | interval = 1; | |
dd41f596 IM |
3876 | if (interval > HZ*NR_CPUS/10) |
3877 | interval = HZ*NR_CPUS/10; | |
3878 | ||
d07355f5 | 3879 | need_serialize = sd->flags & SD_SERIALIZE; |
1da177e4 | 3880 | |
d07355f5 | 3881 | if (need_serialize) { |
08c183f3 CL |
3882 | if (!spin_trylock(&balancing)) |
3883 | goto out; | |
3884 | } | |
3885 | ||
c9819f45 | 3886 | if (time_after_eq(jiffies, sd->last_balance + interval)) { |
7c16ec58 | 3887 | if (load_balance(cpu, rq, sd, idle, &balance, &tmp)) { |
fa3b6ddc SS |
3888 | /* |
3889 | * We've pulled tasks over so either we're no | |
5969fe06 NP |
3890 | * longer idle, or one of our SMT siblings is |
3891 | * not idle. | |
3892 | */ | |
d15bcfdb | 3893 | idle = CPU_NOT_IDLE; |
1da177e4 | 3894 | } |
1bd77f2d | 3895 | sd->last_balance = jiffies; |
1da177e4 | 3896 | } |
d07355f5 | 3897 | if (need_serialize) |
08c183f3 CL |
3898 | spin_unlock(&balancing); |
3899 | out: | |
f549da84 | 3900 | if (time_after(next_balance, sd->last_balance + interval)) { |
c9819f45 | 3901 | next_balance = sd->last_balance + interval; |
f549da84 SS |
3902 | update_next_balance = 1; |
3903 | } | |
783609c6 SS |
3904 | |
3905 | /* | |
3906 | * Stop the load balance at this level. There is another | |
3907 | * CPU in our sched group which is doing load balancing more | |
3908 | * actively. | |
3909 | */ | |
3910 | if (!balance) | |
3911 | break; | |
1da177e4 | 3912 | } |
f549da84 SS |
3913 | |
3914 | /* | |
3915 | * next_balance will be updated only when there is a need. | |
3916 | * When the cpu is attached to null domain for ex, it will not be | |
3917 | * updated. | |
3918 | */ | |
3919 | if (likely(update_next_balance)) | |
3920 | rq->next_balance = next_balance; | |
46cb4b7c SS |
3921 | } |
3922 | ||
3923 | /* | |
3924 | * run_rebalance_domains is triggered when needed from the scheduler tick. | |
3925 | * In CONFIG_NO_HZ case, the idle load balance owner will do the | |
3926 | * rebalancing for all the cpus for whom scheduler ticks are stopped. | |
3927 | */ | |
3928 | static void run_rebalance_domains(struct softirq_action *h) | |
3929 | { | |
dd41f596 IM |
3930 | int this_cpu = smp_processor_id(); |
3931 | struct rq *this_rq = cpu_rq(this_cpu); | |
3932 | enum cpu_idle_type idle = this_rq->idle_at_tick ? | |
3933 | CPU_IDLE : CPU_NOT_IDLE; | |
46cb4b7c | 3934 | |
dd41f596 | 3935 | rebalance_domains(this_cpu, idle); |
46cb4b7c SS |
3936 | |
3937 | #ifdef CONFIG_NO_HZ | |
3938 | /* | |
3939 | * If this cpu is the owner for idle load balancing, then do the | |
3940 | * balancing on behalf of the other idle cpus whose ticks are | |
3941 | * stopped. | |
3942 | */ | |
dd41f596 IM |
3943 | if (this_rq->idle_at_tick && |
3944 | atomic_read(&nohz.load_balancer) == this_cpu) { | |
46cb4b7c SS |
3945 | cpumask_t cpus = nohz.cpu_mask; |
3946 | struct rq *rq; | |
3947 | int balance_cpu; | |
3948 | ||
dd41f596 | 3949 | cpu_clear(this_cpu, cpus); |
363ab6f1 | 3950 | for_each_cpu_mask_nr(balance_cpu, cpus) { |
46cb4b7c SS |
3951 | /* |
3952 | * If this cpu gets work to do, stop the load balancing | |
3953 | * work being done for other cpus. Next load | |
3954 | * balancing owner will pick it up. | |
3955 | */ | |
3956 | if (need_resched()) | |
3957 | break; | |
3958 | ||
de0cf899 | 3959 | rebalance_domains(balance_cpu, CPU_IDLE); |
46cb4b7c SS |
3960 | |
3961 | rq = cpu_rq(balance_cpu); | |
dd41f596 IM |
3962 | if (time_after(this_rq->next_balance, rq->next_balance)) |
3963 | this_rq->next_balance = rq->next_balance; | |
46cb4b7c SS |
3964 | } |
3965 | } | |
3966 | #endif | |
3967 | } | |
3968 | ||
3969 | /* | |
3970 | * Trigger the SCHED_SOFTIRQ if it is time to do periodic load balancing. | |
3971 | * | |
3972 | * In case of CONFIG_NO_HZ, this is the place where we nominate a new | |
3973 | * idle load balancing owner or decide to stop the periodic load balancing, | |
3974 | * if the whole system is idle. | |
3975 | */ | |
dd41f596 | 3976 | static inline void trigger_load_balance(struct rq *rq, int cpu) |
46cb4b7c | 3977 | { |
46cb4b7c SS |
3978 | #ifdef CONFIG_NO_HZ |
3979 | /* | |
3980 | * If we were in the nohz mode recently and busy at the current | |
3981 | * scheduler tick, then check if we need to nominate new idle | |
3982 | * load balancer. | |
3983 | */ | |
3984 | if (rq->in_nohz_recently && !rq->idle_at_tick) { | |
3985 | rq->in_nohz_recently = 0; | |
3986 | ||
3987 | if (atomic_read(&nohz.load_balancer) == cpu) { | |
3988 | cpu_clear(cpu, nohz.cpu_mask); | |
3989 | atomic_set(&nohz.load_balancer, -1); | |
3990 | } | |
3991 | ||
3992 | if (atomic_read(&nohz.load_balancer) == -1) { | |
3993 | /* | |
3994 | * simple selection for now: Nominate the | |
3995 | * first cpu in the nohz list to be the next | |
3996 | * ilb owner. | |
3997 | * | |
3998 | * TBD: Traverse the sched domains and nominate | |
3999 | * the nearest cpu in the nohz.cpu_mask. | |
4000 | */ | |
4001 | int ilb = first_cpu(nohz.cpu_mask); | |
4002 | ||
434d53b0 | 4003 | if (ilb < nr_cpu_ids) |
46cb4b7c SS |
4004 | resched_cpu(ilb); |
4005 | } | |
4006 | } | |
4007 | ||
4008 | /* | |
4009 | * If this cpu is idle and doing idle load balancing for all the | |
4010 | * cpus with ticks stopped, is it time for that to stop? | |
4011 | */ | |
4012 | if (rq->idle_at_tick && atomic_read(&nohz.load_balancer) == cpu && | |
4013 | cpus_weight(nohz.cpu_mask) == num_online_cpus()) { | |
4014 | resched_cpu(cpu); | |
4015 | return; | |
4016 | } | |
4017 | ||
4018 | /* | |
4019 | * If this cpu is idle and the idle load balancing is done by | |
4020 | * someone else, then no need raise the SCHED_SOFTIRQ | |
4021 | */ | |
4022 | if (rq->idle_at_tick && atomic_read(&nohz.load_balancer) != cpu && | |
4023 | cpu_isset(cpu, nohz.cpu_mask)) | |
4024 | return; | |
4025 | #endif | |
4026 | if (time_after_eq(jiffies, rq->next_balance)) | |
4027 | raise_softirq(SCHED_SOFTIRQ); | |
1da177e4 | 4028 | } |
dd41f596 IM |
4029 | |
4030 | #else /* CONFIG_SMP */ | |
4031 | ||
1da177e4 LT |
4032 | /* |
4033 | * on UP we do not need to balance between CPUs: | |
4034 | */ | |
70b97a7f | 4035 | static inline void idle_balance(int cpu, struct rq *rq) |
1da177e4 LT |
4036 | { |
4037 | } | |
dd41f596 | 4038 | |
1da177e4 LT |
4039 | #endif |
4040 | ||
1da177e4 LT |
4041 | DEFINE_PER_CPU(struct kernel_stat, kstat); |
4042 | ||
4043 | EXPORT_PER_CPU_SYMBOL(kstat); | |
4044 | ||
4045 | /* | |
f06febc9 FM |
4046 | * Return any ns on the sched_clock that have not yet been banked in |
4047 | * @p in case that task is currently running. | |
1da177e4 | 4048 | */ |
bb34d92f | 4049 | unsigned long long task_delta_exec(struct task_struct *p) |
1da177e4 | 4050 | { |
1da177e4 | 4051 | unsigned long flags; |
41b86e9c | 4052 | struct rq *rq; |
bb34d92f | 4053 | u64 ns = 0; |
48f24c4d | 4054 | |
41b86e9c | 4055 | rq = task_rq_lock(p, &flags); |
1508487e | 4056 | |
051a1d1a | 4057 | if (task_current(rq, p)) { |
f06febc9 FM |
4058 | u64 delta_exec; |
4059 | ||
a8e504d2 IM |
4060 | update_rq_clock(rq); |
4061 | delta_exec = rq->clock - p->se.exec_start; | |
41b86e9c | 4062 | if ((s64)delta_exec > 0) |
bb34d92f | 4063 | ns = delta_exec; |
41b86e9c | 4064 | } |
48f24c4d | 4065 | |
41b86e9c | 4066 | task_rq_unlock(rq, &flags); |
48f24c4d | 4067 | |
1da177e4 LT |
4068 | return ns; |
4069 | } | |
4070 | ||
1da177e4 LT |
4071 | /* |
4072 | * Account user cpu time to a process. | |
4073 | * @p: the process that the cpu time gets accounted to | |
1da177e4 LT |
4074 | * @cputime: the cpu time spent in user space since the last update |
4075 | */ | |
4076 | void account_user_time(struct task_struct *p, cputime_t cputime) | |
4077 | { | |
4078 | struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat; | |
4079 | cputime64_t tmp; | |
4080 | ||
4081 | p->utime = cputime_add(p->utime, cputime); | |
f06febc9 | 4082 | account_group_user_time(p, cputime); |
1da177e4 LT |
4083 | |
4084 | /* Add user time to cpustat. */ | |
4085 | tmp = cputime_to_cputime64(cputime); | |
4086 | if (TASK_NICE(p) > 0) | |
4087 | cpustat->nice = cputime64_add(cpustat->nice, tmp); | |
4088 | else | |
4089 | cpustat->user = cputime64_add(cpustat->user, tmp); | |
49b5cf34 JL |
4090 | /* Account for user time used */ |
4091 | acct_update_integrals(p); | |
1da177e4 LT |
4092 | } |
4093 | ||
94886b84 LV |
4094 | /* |
4095 | * Account guest cpu time to a process. | |
4096 | * @p: the process that the cpu time gets accounted to | |
4097 | * @cputime: the cpu time spent in virtual machine since the last update | |
4098 | */ | |
f7402e03 | 4099 | static void account_guest_time(struct task_struct *p, cputime_t cputime) |
94886b84 LV |
4100 | { |
4101 | cputime64_t tmp; | |
4102 | struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat; | |
4103 | ||
4104 | tmp = cputime_to_cputime64(cputime); | |
4105 | ||
4106 | p->utime = cputime_add(p->utime, cputime); | |
f06febc9 | 4107 | account_group_user_time(p, cputime); |
94886b84 LV |
4108 | p->gtime = cputime_add(p->gtime, cputime); |
4109 | ||
4110 | cpustat->user = cputime64_add(cpustat->user, tmp); | |
4111 | cpustat->guest = cputime64_add(cpustat->guest, tmp); | |
4112 | } | |
4113 | ||
c66f08be MN |
4114 | /* |
4115 | * Account scaled user cpu time to a process. | |
4116 | * @p: the process that the cpu time gets accounted to | |
4117 | * @cputime: the cpu time spent in user space since the last update | |
4118 | */ | |
4119 | void account_user_time_scaled(struct task_struct *p, cputime_t cputime) | |
4120 | { | |
4121 | p->utimescaled = cputime_add(p->utimescaled, cputime); | |
4122 | } | |
4123 | ||
1da177e4 LT |
4124 | /* |
4125 | * Account system cpu time to a process. | |
4126 | * @p: the process that the cpu time gets accounted to | |
4127 | * @hardirq_offset: the offset to subtract from hardirq_count() | |
4128 | * @cputime: the cpu time spent in kernel space since the last update | |
4129 | */ | |
4130 | void account_system_time(struct task_struct *p, int hardirq_offset, | |
4131 | cputime_t cputime) | |
4132 | { | |
4133 | struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat; | |
70b97a7f | 4134 | struct rq *rq = this_rq(); |
1da177e4 LT |
4135 | cputime64_t tmp; |
4136 | ||
983ed7a6 HH |
4137 | if ((p->flags & PF_VCPU) && (irq_count() - hardirq_offset == 0)) { |
4138 | account_guest_time(p, cputime); | |
4139 | return; | |
4140 | } | |
94886b84 | 4141 | |
1da177e4 | 4142 | p->stime = cputime_add(p->stime, cputime); |
f06febc9 | 4143 | account_group_system_time(p, cputime); |
1da177e4 LT |
4144 | |
4145 | /* Add system time to cpustat. */ | |
4146 | tmp = cputime_to_cputime64(cputime); | |
4147 | if (hardirq_count() - hardirq_offset) | |
4148 | cpustat->irq = cputime64_add(cpustat->irq, tmp); | |
4149 | else if (softirq_count()) | |
4150 | cpustat->softirq = cputime64_add(cpustat->softirq, tmp); | |
cfb52856 | 4151 | else if (p != rq->idle) |
1da177e4 | 4152 | cpustat->system = cputime64_add(cpustat->system, tmp); |
cfb52856 | 4153 | else if (atomic_read(&rq->nr_iowait) > 0) |
1da177e4 LT |
4154 | cpustat->iowait = cputime64_add(cpustat->iowait, tmp); |
4155 | else | |
4156 | cpustat->idle = cputime64_add(cpustat->idle, tmp); | |
4157 | /* Account for system time used */ | |
4158 | acct_update_integrals(p); | |
1da177e4 LT |
4159 | } |
4160 | ||
c66f08be MN |
4161 | /* |
4162 | * Account scaled system cpu time to a process. | |
4163 | * @p: the process that the cpu time gets accounted to | |
4164 | * @hardirq_offset: the offset to subtract from hardirq_count() | |
4165 | * @cputime: the cpu time spent in kernel space since the last update | |
4166 | */ | |
4167 | void account_system_time_scaled(struct task_struct *p, cputime_t cputime) | |
4168 | { | |
4169 | p->stimescaled = cputime_add(p->stimescaled, cputime); | |
4170 | } | |
4171 | ||
1da177e4 LT |
4172 | /* |
4173 | * Account for involuntary wait time. | |
4174 | * @p: the process from which the cpu time has been stolen | |
4175 | * @steal: the cpu time spent in involuntary wait | |
4176 | */ | |
4177 | void account_steal_time(struct task_struct *p, cputime_t steal) | |
4178 | { | |
4179 | struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat; | |
4180 | cputime64_t tmp = cputime_to_cputime64(steal); | |
70b97a7f | 4181 | struct rq *rq = this_rq(); |
1da177e4 LT |
4182 | |
4183 | if (p == rq->idle) { | |
4184 | p->stime = cputime_add(p->stime, steal); | |
f06febc9 | 4185 | account_group_system_time(p, steal); |
1da177e4 LT |
4186 | if (atomic_read(&rq->nr_iowait) > 0) |
4187 | cpustat->iowait = cputime64_add(cpustat->iowait, tmp); | |
4188 | else | |
4189 | cpustat->idle = cputime64_add(cpustat->idle, tmp); | |
cfb52856 | 4190 | } else |
1da177e4 LT |
4191 | cpustat->steal = cputime64_add(cpustat->steal, tmp); |
4192 | } | |
4193 | ||
49048622 BS |
4194 | /* |
4195 | * Use precise platform statistics if available: | |
4196 | */ | |
4197 | #ifdef CONFIG_VIRT_CPU_ACCOUNTING | |
4198 | cputime_t task_utime(struct task_struct *p) | |
4199 | { | |
4200 | return p->utime; | |
4201 | } | |
4202 | ||
4203 | cputime_t task_stime(struct task_struct *p) | |
4204 | { | |
4205 | return p->stime; | |
4206 | } | |
4207 | #else | |
4208 | cputime_t task_utime(struct task_struct *p) | |
4209 | { | |
4210 | clock_t utime = cputime_to_clock_t(p->utime), | |
4211 | total = utime + cputime_to_clock_t(p->stime); | |
4212 | u64 temp; | |
4213 | ||
4214 | /* | |
4215 | * Use CFS's precise accounting: | |
4216 | */ | |
4217 | temp = (u64)nsec_to_clock_t(p->se.sum_exec_runtime); | |
4218 | ||
4219 | if (total) { | |
4220 | temp *= utime; | |
4221 | do_div(temp, total); | |
4222 | } | |
4223 | utime = (clock_t)temp; | |
4224 | ||
4225 | p->prev_utime = max(p->prev_utime, clock_t_to_cputime(utime)); | |
4226 | return p->prev_utime; | |
4227 | } | |
4228 | ||
4229 | cputime_t task_stime(struct task_struct *p) | |
4230 | { | |
4231 | clock_t stime; | |
4232 | ||
4233 | /* | |
4234 | * Use CFS's precise accounting. (we subtract utime from | |
4235 | * the total, to make sure the total observed by userspace | |
4236 | * grows monotonically - apps rely on that): | |
4237 | */ | |
4238 | stime = nsec_to_clock_t(p->se.sum_exec_runtime) - | |
4239 | cputime_to_clock_t(task_utime(p)); | |
4240 | ||
4241 | if (stime >= 0) | |
4242 | p->prev_stime = max(p->prev_stime, clock_t_to_cputime(stime)); | |
4243 | ||
4244 | return p->prev_stime; | |
4245 | } | |
4246 | #endif | |
4247 | ||
4248 | inline cputime_t task_gtime(struct task_struct *p) | |
4249 | { | |
4250 | return p->gtime; | |
4251 | } | |
4252 | ||
7835b98b CL |
4253 | /* |
4254 | * This function gets called by the timer code, with HZ frequency. | |
4255 | * We call it with interrupts disabled. | |
4256 | * | |
4257 | * It also gets called by the fork code, when changing the parent's | |
4258 | * timeslices. | |
4259 | */ | |
4260 | void scheduler_tick(void) | |
4261 | { | |
7835b98b CL |
4262 | int cpu = smp_processor_id(); |
4263 | struct rq *rq = cpu_rq(cpu); | |
dd41f596 | 4264 | struct task_struct *curr = rq->curr; |
3e51f33f PZ |
4265 | |
4266 | sched_clock_tick(); | |
dd41f596 IM |
4267 | |
4268 | spin_lock(&rq->lock); | |
3e51f33f | 4269 | update_rq_clock(rq); |
f1a438d8 | 4270 | update_cpu_load(rq); |
fa85ae24 | 4271 | curr->sched_class->task_tick(rq, curr, 0); |
dd41f596 | 4272 | spin_unlock(&rq->lock); |
7835b98b | 4273 | |
e418e1c2 | 4274 | #ifdef CONFIG_SMP |
dd41f596 IM |
4275 | rq->idle_at_tick = idle_cpu(cpu); |
4276 | trigger_load_balance(rq, cpu); | |
e418e1c2 | 4277 | #endif |
1da177e4 LT |
4278 | } |
4279 | ||
6cd8a4bb SR |
4280 | #if defined(CONFIG_PREEMPT) && (defined(CONFIG_DEBUG_PREEMPT) || \ |
4281 | defined(CONFIG_PREEMPT_TRACER)) | |
4282 | ||
4283 | static inline unsigned long get_parent_ip(unsigned long addr) | |
4284 | { | |
4285 | if (in_lock_functions(addr)) { | |
4286 | addr = CALLER_ADDR2; | |
4287 | if (in_lock_functions(addr)) | |
4288 | addr = CALLER_ADDR3; | |
4289 | } | |
4290 | return addr; | |
4291 | } | |
1da177e4 | 4292 | |
43627582 | 4293 | void __kprobes add_preempt_count(int val) |
1da177e4 | 4294 | { |
6cd8a4bb | 4295 | #ifdef CONFIG_DEBUG_PREEMPT |
1da177e4 LT |
4296 | /* |
4297 | * Underflow? | |
4298 | */ | |
9a11b49a IM |
4299 | if (DEBUG_LOCKS_WARN_ON((preempt_count() < 0))) |
4300 | return; | |
6cd8a4bb | 4301 | #endif |
1da177e4 | 4302 | preempt_count() += val; |
6cd8a4bb | 4303 | #ifdef CONFIG_DEBUG_PREEMPT |
1da177e4 LT |
4304 | /* |
4305 | * Spinlock count overflowing soon? | |
4306 | */ | |
33859f7f MOS |
4307 | DEBUG_LOCKS_WARN_ON((preempt_count() & PREEMPT_MASK) >= |
4308 | PREEMPT_MASK - 10); | |
6cd8a4bb SR |
4309 | #endif |
4310 | if (preempt_count() == val) | |
4311 | trace_preempt_off(CALLER_ADDR0, get_parent_ip(CALLER_ADDR1)); | |
1da177e4 LT |
4312 | } |
4313 | EXPORT_SYMBOL(add_preempt_count); | |
4314 | ||
43627582 | 4315 | void __kprobes sub_preempt_count(int val) |
1da177e4 | 4316 | { |
6cd8a4bb | 4317 | #ifdef CONFIG_DEBUG_PREEMPT |
1da177e4 LT |
4318 | /* |
4319 | * Underflow? | |
4320 | */ | |
9a11b49a IM |
4321 | if (DEBUG_LOCKS_WARN_ON(val > preempt_count())) |
4322 | return; | |
1da177e4 LT |
4323 | /* |
4324 | * Is the spinlock portion underflowing? | |
4325 | */ | |
9a11b49a IM |
4326 | if (DEBUG_LOCKS_WARN_ON((val < PREEMPT_MASK) && |
4327 | !(preempt_count() & PREEMPT_MASK))) | |
4328 | return; | |
6cd8a4bb | 4329 | #endif |
9a11b49a | 4330 | |
6cd8a4bb SR |
4331 | if (preempt_count() == val) |
4332 | trace_preempt_on(CALLER_ADDR0, get_parent_ip(CALLER_ADDR1)); | |
1da177e4 LT |
4333 | preempt_count() -= val; |
4334 | } | |
4335 | EXPORT_SYMBOL(sub_preempt_count); | |
4336 | ||
4337 | #endif | |
4338 | ||
4339 | /* | |
dd41f596 | 4340 | * Print scheduling while atomic bug: |
1da177e4 | 4341 | */ |
dd41f596 | 4342 | static noinline void __schedule_bug(struct task_struct *prev) |
1da177e4 | 4343 | { |
838225b4 SS |
4344 | struct pt_regs *regs = get_irq_regs(); |
4345 | ||
4346 | printk(KERN_ERR "BUG: scheduling while atomic: %s/%d/0x%08x\n", | |
4347 | prev->comm, prev->pid, preempt_count()); | |
4348 | ||
dd41f596 | 4349 | debug_show_held_locks(prev); |
e21f5b15 | 4350 | print_modules(); |
dd41f596 IM |
4351 | if (irqs_disabled()) |
4352 | print_irqtrace_events(prev); | |
838225b4 SS |
4353 | |
4354 | if (regs) | |
4355 | show_regs(regs); | |
4356 | else | |
4357 | dump_stack(); | |
dd41f596 | 4358 | } |
1da177e4 | 4359 | |
dd41f596 IM |
4360 | /* |
4361 | * Various schedule()-time debugging checks and statistics: | |
4362 | */ | |
4363 | static inline void schedule_debug(struct task_struct *prev) | |
4364 | { | |
1da177e4 | 4365 | /* |
41a2d6cf | 4366 | * Test if we are atomic. Since do_exit() needs to call into |
1da177e4 LT |
4367 | * schedule() atomically, we ignore that path for now. |
4368 | * Otherwise, whine if we are scheduling when we should not be. | |
4369 | */ | |
3f33a7ce | 4370 | if (unlikely(in_atomic_preempt_off() && !prev->exit_state)) |
dd41f596 IM |
4371 | __schedule_bug(prev); |
4372 | ||
1da177e4 LT |
4373 | profile_hit(SCHED_PROFILING, __builtin_return_address(0)); |
4374 | ||
2d72376b | 4375 | schedstat_inc(this_rq(), sched_count); |
b8efb561 IM |
4376 | #ifdef CONFIG_SCHEDSTATS |
4377 | if (unlikely(prev->lock_depth >= 0)) { | |
2d72376b IM |
4378 | schedstat_inc(this_rq(), bkl_count); |
4379 | schedstat_inc(prev, sched_info.bkl_count); | |
b8efb561 IM |
4380 | } |
4381 | #endif | |
dd41f596 IM |
4382 | } |
4383 | ||
4384 | /* | |
4385 | * Pick up the highest-prio task: | |
4386 | */ | |
4387 | static inline struct task_struct * | |
ff95f3df | 4388 | pick_next_task(struct rq *rq, struct task_struct *prev) |
dd41f596 | 4389 | { |
5522d5d5 | 4390 | const struct sched_class *class; |
dd41f596 | 4391 | struct task_struct *p; |
1da177e4 LT |
4392 | |
4393 | /* | |
dd41f596 IM |
4394 | * Optimization: we know that if all tasks are in |
4395 | * the fair class we can call that function directly: | |
1da177e4 | 4396 | */ |
dd41f596 | 4397 | if (likely(rq->nr_running == rq->cfs.nr_running)) { |
fb8d4724 | 4398 | p = fair_sched_class.pick_next_task(rq); |
dd41f596 IM |
4399 | if (likely(p)) |
4400 | return p; | |
1da177e4 LT |
4401 | } |
4402 | ||
dd41f596 IM |
4403 | class = sched_class_highest; |
4404 | for ( ; ; ) { | |
fb8d4724 | 4405 | p = class->pick_next_task(rq); |
dd41f596 IM |
4406 | if (p) |
4407 | return p; | |
4408 | /* | |
4409 | * Will never be NULL as the idle class always | |
4410 | * returns a non-NULL p: | |
4411 | */ | |
4412 | class = class->next; | |
4413 | } | |
4414 | } | |
1da177e4 | 4415 | |
dd41f596 IM |
4416 | /* |
4417 | * schedule() is the main scheduler function. | |
4418 | */ | |
4419 | asmlinkage void __sched schedule(void) | |
4420 | { | |
4421 | struct task_struct *prev, *next; | |
67ca7bde | 4422 | unsigned long *switch_count; |
dd41f596 | 4423 | struct rq *rq; |
31656519 | 4424 | int cpu; |
dd41f596 IM |
4425 | |
4426 | need_resched: | |
4427 | preempt_disable(); | |
4428 | cpu = smp_processor_id(); | |
4429 | rq = cpu_rq(cpu); | |
4430 | rcu_qsctr_inc(cpu); | |
4431 | prev = rq->curr; | |
4432 | switch_count = &prev->nivcsw; | |
4433 | ||
4434 | release_kernel_lock(prev); | |
4435 | need_resched_nonpreemptible: | |
4436 | ||
4437 | schedule_debug(prev); | |
1da177e4 | 4438 | |
31656519 | 4439 | if (sched_feat(HRTICK)) |
f333fdc9 | 4440 | hrtick_clear(rq); |
8f4d37ec | 4441 | |
8cd162ce | 4442 | spin_lock_irq(&rq->lock); |
3e51f33f | 4443 | update_rq_clock(rq); |
1e819950 | 4444 | clear_tsk_need_resched(prev); |
1da177e4 | 4445 | |
1da177e4 | 4446 | if (prev->state && !(preempt_count() & PREEMPT_ACTIVE)) { |
16882c1e | 4447 | if (unlikely(signal_pending_state(prev->state, prev))) |
1da177e4 | 4448 | prev->state = TASK_RUNNING; |
16882c1e | 4449 | else |
2e1cb74a | 4450 | deactivate_task(rq, prev, 1); |
dd41f596 | 4451 | switch_count = &prev->nvcsw; |
1da177e4 LT |
4452 | } |
4453 | ||
9a897c5a SR |
4454 | #ifdef CONFIG_SMP |
4455 | if (prev->sched_class->pre_schedule) | |
4456 | prev->sched_class->pre_schedule(rq, prev); | |
4457 | #endif | |
f65eda4f | 4458 | |
dd41f596 | 4459 | if (unlikely(!rq->nr_running)) |
1da177e4 | 4460 | idle_balance(cpu, rq); |
1da177e4 | 4461 | |
31ee529c | 4462 | prev->sched_class->put_prev_task(rq, prev); |
ff95f3df | 4463 | next = pick_next_task(rq, prev); |
1da177e4 | 4464 | |
1da177e4 | 4465 | if (likely(prev != next)) { |
673a90a1 DS |
4466 | sched_info_switch(prev, next); |
4467 | ||
1da177e4 LT |
4468 | rq->nr_switches++; |
4469 | rq->curr = next; | |
4470 | ++*switch_count; | |
4471 | ||
dd41f596 | 4472 | context_switch(rq, prev, next); /* unlocks the rq */ |
8f4d37ec PZ |
4473 | /* |
4474 | * the context switch might have flipped the stack from under | |
4475 | * us, hence refresh the local variables. | |
4476 | */ | |
4477 | cpu = smp_processor_id(); | |
4478 | rq = cpu_rq(cpu); | |
1da177e4 LT |
4479 | } else |
4480 | spin_unlock_irq(&rq->lock); | |
4481 | ||
8f4d37ec | 4482 | if (unlikely(reacquire_kernel_lock(current) < 0)) |
1da177e4 | 4483 | goto need_resched_nonpreemptible; |
8f4d37ec | 4484 | |
1da177e4 LT |
4485 | preempt_enable_no_resched(); |
4486 | if (unlikely(test_thread_flag(TIF_NEED_RESCHED))) | |
4487 | goto need_resched; | |
4488 | } | |
1da177e4 LT |
4489 | EXPORT_SYMBOL(schedule); |
4490 | ||
4491 | #ifdef CONFIG_PREEMPT | |
4492 | /* | |
2ed6e34f | 4493 | * this is the entry point to schedule() from in-kernel preemption |
41a2d6cf | 4494 | * off of preempt_enable. Kernel preemptions off return from interrupt |
1da177e4 LT |
4495 | * occur there and call schedule directly. |
4496 | */ | |
4497 | asmlinkage void __sched preempt_schedule(void) | |
4498 | { | |
4499 | struct thread_info *ti = current_thread_info(); | |
6478d880 | 4500 | |
1da177e4 LT |
4501 | /* |
4502 | * If there is a non-zero preempt_count or interrupts are disabled, | |
41a2d6cf | 4503 | * we do not want to preempt the current task. Just return.. |
1da177e4 | 4504 | */ |
beed33a8 | 4505 | if (likely(ti->preempt_count || irqs_disabled())) |
1da177e4 LT |
4506 | return; |
4507 | ||
3a5c359a AK |
4508 | do { |
4509 | add_preempt_count(PREEMPT_ACTIVE); | |
3a5c359a | 4510 | schedule(); |
3a5c359a | 4511 | sub_preempt_count(PREEMPT_ACTIVE); |
1da177e4 | 4512 | |
3a5c359a AK |
4513 | /* |
4514 | * Check again in case we missed a preemption opportunity | |
4515 | * between schedule and now. | |
4516 | */ | |
4517 | barrier(); | |
4518 | } while (unlikely(test_thread_flag(TIF_NEED_RESCHED))); | |
1da177e4 | 4519 | } |
1da177e4 LT |
4520 | EXPORT_SYMBOL(preempt_schedule); |
4521 | ||
4522 | /* | |
2ed6e34f | 4523 | * this is the entry point to schedule() from kernel preemption |
1da177e4 LT |
4524 | * off of irq context. |
4525 | * Note, that this is called and return with irqs disabled. This will | |
4526 | * protect us against recursive calling from irq. | |
4527 | */ | |
4528 | asmlinkage void __sched preempt_schedule_irq(void) | |
4529 | { | |
4530 | struct thread_info *ti = current_thread_info(); | |
6478d880 | 4531 | |
2ed6e34f | 4532 | /* Catch callers which need to be fixed */ |
1da177e4 LT |
4533 | BUG_ON(ti->preempt_count || !irqs_disabled()); |
4534 | ||
3a5c359a AK |
4535 | do { |
4536 | add_preempt_count(PREEMPT_ACTIVE); | |
3a5c359a AK |
4537 | local_irq_enable(); |
4538 | schedule(); | |
4539 | local_irq_disable(); | |
3a5c359a | 4540 | sub_preempt_count(PREEMPT_ACTIVE); |
1da177e4 | 4541 | |
3a5c359a AK |
4542 | /* |
4543 | * Check again in case we missed a preemption opportunity | |
4544 | * between schedule and now. | |
4545 | */ | |
4546 | barrier(); | |
4547 | } while (unlikely(test_thread_flag(TIF_NEED_RESCHED))); | |
1da177e4 LT |
4548 | } |
4549 | ||
4550 | #endif /* CONFIG_PREEMPT */ | |
4551 | ||
95cdf3b7 IM |
4552 | int default_wake_function(wait_queue_t *curr, unsigned mode, int sync, |
4553 | void *key) | |
1da177e4 | 4554 | { |
48f24c4d | 4555 | return try_to_wake_up(curr->private, mode, sync); |
1da177e4 | 4556 | } |
1da177e4 LT |
4557 | EXPORT_SYMBOL(default_wake_function); |
4558 | ||
4559 | /* | |
41a2d6cf IM |
4560 | * The core wakeup function. Non-exclusive wakeups (nr_exclusive == 0) just |
4561 | * wake everything up. If it's an exclusive wakeup (nr_exclusive == small +ve | |
1da177e4 LT |
4562 | * number) then we wake all the non-exclusive tasks and one exclusive task. |
4563 | * | |
4564 | * There are circumstances in which we can try to wake a task which has already | |
41a2d6cf | 4565 | * started to run but is not in state TASK_RUNNING. try_to_wake_up() returns |
1da177e4 LT |
4566 | * zero in this (rare) case, and we handle it by continuing to scan the queue. |
4567 | */ | |
4568 | static void __wake_up_common(wait_queue_head_t *q, unsigned int mode, | |
4569 | int nr_exclusive, int sync, void *key) | |
4570 | { | |
2e45874c | 4571 | wait_queue_t *curr, *next; |
1da177e4 | 4572 | |
2e45874c | 4573 | list_for_each_entry_safe(curr, next, &q->task_list, task_list) { |
48f24c4d IM |
4574 | unsigned flags = curr->flags; |
4575 | ||
1da177e4 | 4576 | if (curr->func(curr, mode, sync, key) && |
48f24c4d | 4577 | (flags & WQ_FLAG_EXCLUSIVE) && !--nr_exclusive) |
1da177e4 LT |
4578 | break; |
4579 | } | |
4580 | } | |
4581 | ||
4582 | /** | |
4583 | * __wake_up - wake up threads blocked on a waitqueue. | |
4584 | * @q: the waitqueue | |
4585 | * @mode: which threads | |
4586 | * @nr_exclusive: how many wake-one or wake-many threads to wake up | |
67be2dd1 | 4587 | * @key: is directly passed to the wakeup function |
1da177e4 | 4588 | */ |
7ad5b3a5 | 4589 | void __wake_up(wait_queue_head_t *q, unsigned int mode, |
95cdf3b7 | 4590 | int nr_exclusive, void *key) |
1da177e4 LT |
4591 | { |
4592 | unsigned long flags; | |
4593 | ||
4594 | spin_lock_irqsave(&q->lock, flags); | |
4595 | __wake_up_common(q, mode, nr_exclusive, 0, key); | |
4596 | spin_unlock_irqrestore(&q->lock, flags); | |
4597 | } | |
1da177e4 LT |
4598 | EXPORT_SYMBOL(__wake_up); |
4599 | ||
4600 | /* | |
4601 | * Same as __wake_up but called with the spinlock in wait_queue_head_t held. | |
4602 | */ | |
7ad5b3a5 | 4603 | void __wake_up_locked(wait_queue_head_t *q, unsigned int mode) |
1da177e4 LT |
4604 | { |
4605 | __wake_up_common(q, mode, 1, 0, NULL); | |
4606 | } | |
4607 | ||
4608 | /** | |
67be2dd1 | 4609 | * __wake_up_sync - wake up threads blocked on a waitqueue. |
1da177e4 LT |
4610 | * @q: the waitqueue |
4611 | * @mode: which threads | |
4612 | * @nr_exclusive: how many wake-one or wake-many threads to wake up | |
4613 | * | |
4614 | * The sync wakeup differs that the waker knows that it will schedule | |
4615 | * away soon, so while the target thread will be woken up, it will not | |
4616 | * be migrated to another CPU - ie. the two threads are 'synchronized' | |
4617 | * with each other. This can prevent needless bouncing between CPUs. | |
4618 | * | |
4619 | * On UP it can prevent extra preemption. | |
4620 | */ | |
7ad5b3a5 | 4621 | void |
95cdf3b7 | 4622 | __wake_up_sync(wait_queue_head_t *q, unsigned int mode, int nr_exclusive) |
1da177e4 LT |
4623 | { |
4624 | unsigned long flags; | |
4625 | int sync = 1; | |
4626 | ||
4627 | if (unlikely(!q)) | |
4628 | return; | |
4629 | ||
4630 | if (unlikely(!nr_exclusive)) | |
4631 | sync = 0; | |
4632 | ||
4633 | spin_lock_irqsave(&q->lock, flags); | |
4634 | __wake_up_common(q, mode, nr_exclusive, sync, NULL); | |
4635 | spin_unlock_irqrestore(&q->lock, flags); | |
4636 | } | |
4637 | EXPORT_SYMBOL_GPL(__wake_up_sync); /* For internal use only */ | |
4638 | ||
65eb3dc6 KD |
4639 | /** |
4640 | * complete: - signals a single thread waiting on this completion | |
4641 | * @x: holds the state of this particular completion | |
4642 | * | |
4643 | * This will wake up a single thread waiting on this completion. Threads will be | |
4644 | * awakened in the same order in which they were queued. | |
4645 | * | |
4646 | * See also complete_all(), wait_for_completion() and related routines. | |
4647 | */ | |
b15136e9 | 4648 | void complete(struct completion *x) |
1da177e4 LT |
4649 | { |
4650 | unsigned long flags; | |
4651 | ||
4652 | spin_lock_irqsave(&x->wait.lock, flags); | |
4653 | x->done++; | |
d9514f6c | 4654 | __wake_up_common(&x->wait, TASK_NORMAL, 1, 0, NULL); |
1da177e4 LT |
4655 | spin_unlock_irqrestore(&x->wait.lock, flags); |
4656 | } | |
4657 | EXPORT_SYMBOL(complete); | |
4658 | ||
65eb3dc6 KD |
4659 | /** |
4660 | * complete_all: - signals all threads waiting on this completion | |
4661 | * @x: holds the state of this particular completion | |
4662 | * | |
4663 | * This will wake up all threads waiting on this particular completion event. | |
4664 | */ | |
b15136e9 | 4665 | void complete_all(struct completion *x) |
1da177e4 LT |
4666 | { |
4667 | unsigned long flags; | |
4668 | ||
4669 | spin_lock_irqsave(&x->wait.lock, flags); | |
4670 | x->done += UINT_MAX/2; | |
d9514f6c | 4671 | __wake_up_common(&x->wait, TASK_NORMAL, 0, 0, NULL); |
1da177e4 LT |
4672 | spin_unlock_irqrestore(&x->wait.lock, flags); |
4673 | } | |
4674 | EXPORT_SYMBOL(complete_all); | |
4675 | ||
8cbbe86d AK |
4676 | static inline long __sched |
4677 | do_wait_for_common(struct completion *x, long timeout, int state) | |
1da177e4 | 4678 | { |
1da177e4 LT |
4679 | if (!x->done) { |
4680 | DECLARE_WAITQUEUE(wait, current); | |
4681 | ||
4682 | wait.flags |= WQ_FLAG_EXCLUSIVE; | |
4683 | __add_wait_queue_tail(&x->wait, &wait); | |
4684 | do { | |
94d3d824 | 4685 | if (signal_pending_state(state, current)) { |
ea71a546 ON |
4686 | timeout = -ERESTARTSYS; |
4687 | break; | |
8cbbe86d AK |
4688 | } |
4689 | __set_current_state(state); | |
1da177e4 LT |
4690 | spin_unlock_irq(&x->wait.lock); |
4691 | timeout = schedule_timeout(timeout); | |
4692 | spin_lock_irq(&x->wait.lock); | |
ea71a546 | 4693 | } while (!x->done && timeout); |
1da177e4 | 4694 | __remove_wait_queue(&x->wait, &wait); |
ea71a546 ON |
4695 | if (!x->done) |
4696 | return timeout; | |
1da177e4 LT |
4697 | } |
4698 | x->done--; | |
ea71a546 | 4699 | return timeout ?: 1; |
1da177e4 | 4700 | } |
1da177e4 | 4701 | |
8cbbe86d AK |
4702 | static long __sched |
4703 | wait_for_common(struct completion *x, long timeout, int state) | |
1da177e4 | 4704 | { |
1da177e4 LT |
4705 | might_sleep(); |
4706 | ||
4707 | spin_lock_irq(&x->wait.lock); | |
8cbbe86d | 4708 | timeout = do_wait_for_common(x, timeout, state); |
1da177e4 | 4709 | spin_unlock_irq(&x->wait.lock); |
8cbbe86d AK |
4710 | return timeout; |
4711 | } | |
1da177e4 | 4712 | |
65eb3dc6 KD |
4713 | /** |
4714 | * wait_for_completion: - waits for completion of a task | |
4715 | * @x: holds the state of this particular completion | |
4716 | * | |
4717 | * This waits to be signaled for completion of a specific task. It is NOT | |
4718 | * interruptible and there is no timeout. | |
4719 | * | |
4720 | * See also similar routines (i.e. wait_for_completion_timeout()) with timeout | |
4721 | * and interrupt capability. Also see complete(). | |
4722 | */ | |
b15136e9 | 4723 | void __sched wait_for_completion(struct completion *x) |
8cbbe86d AK |
4724 | { |
4725 | wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_UNINTERRUPTIBLE); | |
1da177e4 | 4726 | } |
8cbbe86d | 4727 | EXPORT_SYMBOL(wait_for_completion); |
1da177e4 | 4728 | |
65eb3dc6 KD |
4729 | /** |
4730 | * wait_for_completion_timeout: - waits for completion of a task (w/timeout) | |
4731 | * @x: holds the state of this particular completion | |
4732 | * @timeout: timeout value in jiffies | |
4733 | * | |
4734 | * This waits for either a completion of a specific task to be signaled or for a | |
4735 | * specified timeout to expire. The timeout is in jiffies. It is not | |
4736 | * interruptible. | |
4737 | */ | |
b15136e9 | 4738 | unsigned long __sched |
8cbbe86d | 4739 | wait_for_completion_timeout(struct completion *x, unsigned long timeout) |
1da177e4 | 4740 | { |
8cbbe86d | 4741 | return wait_for_common(x, timeout, TASK_UNINTERRUPTIBLE); |
1da177e4 | 4742 | } |
8cbbe86d | 4743 | EXPORT_SYMBOL(wait_for_completion_timeout); |
1da177e4 | 4744 | |
65eb3dc6 KD |
4745 | /** |
4746 | * wait_for_completion_interruptible: - waits for completion of a task (w/intr) | |
4747 | * @x: holds the state of this particular completion | |
4748 | * | |
4749 | * This waits for completion of a specific task to be signaled. It is | |
4750 | * interruptible. | |
4751 | */ | |
8cbbe86d | 4752 | int __sched wait_for_completion_interruptible(struct completion *x) |
0fec171c | 4753 | { |
51e97990 AK |
4754 | long t = wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_INTERRUPTIBLE); |
4755 | if (t == -ERESTARTSYS) | |
4756 | return t; | |
4757 | return 0; | |
0fec171c | 4758 | } |
8cbbe86d | 4759 | EXPORT_SYMBOL(wait_for_completion_interruptible); |
1da177e4 | 4760 | |
65eb3dc6 KD |
4761 | /** |
4762 | * wait_for_completion_interruptible_timeout: - waits for completion (w/(to,intr)) | |
4763 | * @x: holds the state of this particular completion | |
4764 | * @timeout: timeout value in jiffies | |
4765 | * | |
4766 | * This waits for either a completion of a specific task to be signaled or for a | |
4767 | * specified timeout to expire. It is interruptible. The timeout is in jiffies. | |
4768 | */ | |
b15136e9 | 4769 | unsigned long __sched |
8cbbe86d AK |
4770 | wait_for_completion_interruptible_timeout(struct completion *x, |
4771 | unsigned long timeout) | |
0fec171c | 4772 | { |
8cbbe86d | 4773 | return wait_for_common(x, timeout, TASK_INTERRUPTIBLE); |
0fec171c | 4774 | } |
8cbbe86d | 4775 | EXPORT_SYMBOL(wait_for_completion_interruptible_timeout); |
1da177e4 | 4776 | |
65eb3dc6 KD |
4777 | /** |
4778 | * wait_for_completion_killable: - waits for completion of a task (killable) | |
4779 | * @x: holds the state of this particular completion | |
4780 | * | |
4781 | * This waits to be signaled for completion of a specific task. It can be | |
4782 | * interrupted by a kill signal. | |
4783 | */ | |
009e577e MW |
4784 | int __sched wait_for_completion_killable(struct completion *x) |
4785 | { | |
4786 | long t = wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_KILLABLE); | |
4787 | if (t == -ERESTARTSYS) | |
4788 | return t; | |
4789 | return 0; | |
4790 | } | |
4791 | EXPORT_SYMBOL(wait_for_completion_killable); | |
4792 | ||
be4de352 DC |
4793 | /** |
4794 | * try_wait_for_completion - try to decrement a completion without blocking | |
4795 | * @x: completion structure | |
4796 | * | |
4797 | * Returns: 0 if a decrement cannot be done without blocking | |
4798 | * 1 if a decrement succeeded. | |
4799 | * | |
4800 | * If a completion is being used as a counting completion, | |
4801 | * attempt to decrement the counter without blocking. This | |
4802 | * enables us to avoid waiting if the resource the completion | |
4803 | * is protecting is not available. | |
4804 | */ | |
4805 | bool try_wait_for_completion(struct completion *x) | |
4806 | { | |
4807 | int ret = 1; | |
4808 | ||
4809 | spin_lock_irq(&x->wait.lock); | |
4810 | if (!x->done) | |
4811 | ret = 0; | |
4812 | else | |
4813 | x->done--; | |
4814 | spin_unlock_irq(&x->wait.lock); | |
4815 | return ret; | |
4816 | } | |
4817 | EXPORT_SYMBOL(try_wait_for_completion); | |
4818 | ||
4819 | /** | |
4820 | * completion_done - Test to see if a completion has any waiters | |
4821 | * @x: completion structure | |
4822 | * | |
4823 | * Returns: 0 if there are waiters (wait_for_completion() in progress) | |
4824 | * 1 if there are no waiters. | |
4825 | * | |
4826 | */ | |
4827 | bool completion_done(struct completion *x) | |
4828 | { | |
4829 | int ret = 1; | |
4830 | ||
4831 | spin_lock_irq(&x->wait.lock); | |
4832 | if (!x->done) | |
4833 | ret = 0; | |
4834 | spin_unlock_irq(&x->wait.lock); | |
4835 | return ret; | |
4836 | } | |
4837 | EXPORT_SYMBOL(completion_done); | |
4838 | ||
8cbbe86d AK |
4839 | static long __sched |
4840 | sleep_on_common(wait_queue_head_t *q, int state, long timeout) | |
1da177e4 | 4841 | { |
0fec171c IM |
4842 | unsigned long flags; |
4843 | wait_queue_t wait; | |
4844 | ||
4845 | init_waitqueue_entry(&wait, current); | |
1da177e4 | 4846 | |
8cbbe86d | 4847 | __set_current_state(state); |
1da177e4 | 4848 | |
8cbbe86d AK |
4849 | spin_lock_irqsave(&q->lock, flags); |
4850 | __add_wait_queue(q, &wait); | |
4851 | spin_unlock(&q->lock); | |
4852 | timeout = schedule_timeout(timeout); | |
4853 | spin_lock_irq(&q->lock); | |
4854 | __remove_wait_queue(q, &wait); | |
4855 | spin_unlock_irqrestore(&q->lock, flags); | |
4856 | ||
4857 | return timeout; | |
4858 | } | |
4859 | ||
4860 | void __sched interruptible_sleep_on(wait_queue_head_t *q) | |
4861 | { | |
4862 | sleep_on_common(q, TASK_INTERRUPTIBLE, MAX_SCHEDULE_TIMEOUT); | |
1da177e4 | 4863 | } |
1da177e4 LT |
4864 | EXPORT_SYMBOL(interruptible_sleep_on); |
4865 | ||
0fec171c | 4866 | long __sched |
95cdf3b7 | 4867 | interruptible_sleep_on_timeout(wait_queue_head_t *q, long timeout) |
1da177e4 | 4868 | { |
8cbbe86d | 4869 | return sleep_on_common(q, TASK_INTERRUPTIBLE, timeout); |
1da177e4 | 4870 | } |
1da177e4 LT |
4871 | EXPORT_SYMBOL(interruptible_sleep_on_timeout); |
4872 | ||
0fec171c | 4873 | void __sched sleep_on(wait_queue_head_t *q) |
1da177e4 | 4874 | { |
8cbbe86d | 4875 | sleep_on_common(q, TASK_UNINTERRUPTIBLE, MAX_SCHEDULE_TIMEOUT); |
1da177e4 | 4876 | } |
1da177e4 LT |
4877 | EXPORT_SYMBOL(sleep_on); |
4878 | ||
0fec171c | 4879 | long __sched sleep_on_timeout(wait_queue_head_t *q, long timeout) |
1da177e4 | 4880 | { |
8cbbe86d | 4881 | return sleep_on_common(q, TASK_UNINTERRUPTIBLE, timeout); |
1da177e4 | 4882 | } |
1da177e4 LT |
4883 | EXPORT_SYMBOL(sleep_on_timeout); |
4884 | ||
b29739f9 IM |
4885 | #ifdef CONFIG_RT_MUTEXES |
4886 | ||
4887 | /* | |
4888 | * rt_mutex_setprio - set the current priority of a task | |
4889 | * @p: task | |
4890 | * @prio: prio value (kernel-internal form) | |
4891 | * | |
4892 | * This function changes the 'effective' priority of a task. It does | |
4893 | * not touch ->normal_prio like __setscheduler(). | |
4894 | * | |
4895 | * Used by the rt_mutex code to implement priority inheritance logic. | |
4896 | */ | |
36c8b586 | 4897 | void rt_mutex_setprio(struct task_struct *p, int prio) |
b29739f9 IM |
4898 | { |
4899 | unsigned long flags; | |
83b699ed | 4900 | int oldprio, on_rq, running; |
70b97a7f | 4901 | struct rq *rq; |
cb469845 | 4902 | const struct sched_class *prev_class = p->sched_class; |
b29739f9 IM |
4903 | |
4904 | BUG_ON(prio < 0 || prio > MAX_PRIO); | |
4905 | ||
4906 | rq = task_rq_lock(p, &flags); | |
a8e504d2 | 4907 | update_rq_clock(rq); |
b29739f9 | 4908 | |
d5f9f942 | 4909 | oldprio = p->prio; |
dd41f596 | 4910 | on_rq = p->se.on_rq; |
051a1d1a | 4911 | running = task_current(rq, p); |
0e1f3483 | 4912 | if (on_rq) |
69be72c1 | 4913 | dequeue_task(rq, p, 0); |
0e1f3483 HS |
4914 | if (running) |
4915 | p->sched_class->put_prev_task(rq, p); | |
dd41f596 IM |
4916 | |
4917 | if (rt_prio(prio)) | |
4918 | p->sched_class = &rt_sched_class; | |
4919 | else | |
4920 | p->sched_class = &fair_sched_class; | |
4921 | ||
b29739f9 IM |
4922 | p->prio = prio; |
4923 | ||
0e1f3483 HS |
4924 | if (running) |
4925 | p->sched_class->set_curr_task(rq); | |
dd41f596 | 4926 | if (on_rq) { |
8159f87e | 4927 | enqueue_task(rq, p, 0); |
cb469845 SR |
4928 | |
4929 | check_class_changed(rq, p, prev_class, oldprio, running); | |
b29739f9 IM |
4930 | } |
4931 | task_rq_unlock(rq, &flags); | |
4932 | } | |
4933 | ||
4934 | #endif | |
4935 | ||
36c8b586 | 4936 | void set_user_nice(struct task_struct *p, long nice) |
1da177e4 | 4937 | { |
dd41f596 | 4938 | int old_prio, delta, on_rq; |
1da177e4 | 4939 | unsigned long flags; |
70b97a7f | 4940 | struct rq *rq; |
1da177e4 LT |
4941 | |
4942 | if (TASK_NICE(p) == nice || nice < -20 || nice > 19) | |
4943 | return; | |
4944 | /* | |
4945 | * We have to be careful, if called from sys_setpriority(), | |
4946 | * the task might be in the middle of scheduling on another CPU. | |
4947 | */ | |
4948 | rq = task_rq_lock(p, &flags); | |
a8e504d2 | 4949 | update_rq_clock(rq); |
1da177e4 LT |
4950 | /* |
4951 | * The RT priorities are set via sched_setscheduler(), but we still | |
4952 | * allow the 'normal' nice value to be set - but as expected | |
4953 | * it wont have any effect on scheduling until the task is | |
dd41f596 | 4954 | * SCHED_FIFO/SCHED_RR: |
1da177e4 | 4955 | */ |
e05606d3 | 4956 | if (task_has_rt_policy(p)) { |
1da177e4 LT |
4957 | p->static_prio = NICE_TO_PRIO(nice); |
4958 | goto out_unlock; | |
4959 | } | |
dd41f596 | 4960 | on_rq = p->se.on_rq; |
c09595f6 | 4961 | if (on_rq) |
69be72c1 | 4962 | dequeue_task(rq, p, 0); |
1da177e4 | 4963 | |
1da177e4 | 4964 | p->static_prio = NICE_TO_PRIO(nice); |
2dd73a4f | 4965 | set_load_weight(p); |
b29739f9 IM |
4966 | old_prio = p->prio; |
4967 | p->prio = effective_prio(p); | |
4968 | delta = p->prio - old_prio; | |
1da177e4 | 4969 | |
dd41f596 | 4970 | if (on_rq) { |
8159f87e | 4971 | enqueue_task(rq, p, 0); |
1da177e4 | 4972 | /* |
d5f9f942 AM |
4973 | * If the task increased its priority or is running and |
4974 | * lowered its priority, then reschedule its CPU: | |
1da177e4 | 4975 | */ |
d5f9f942 | 4976 | if (delta < 0 || (delta > 0 && task_running(rq, p))) |
1da177e4 LT |
4977 | resched_task(rq->curr); |
4978 | } | |
4979 | out_unlock: | |
4980 | task_rq_unlock(rq, &flags); | |
4981 | } | |
1da177e4 LT |
4982 | EXPORT_SYMBOL(set_user_nice); |
4983 | ||
e43379f1 MM |
4984 | /* |
4985 | * can_nice - check if a task can reduce its nice value | |
4986 | * @p: task | |
4987 | * @nice: nice value | |
4988 | */ | |
36c8b586 | 4989 | int can_nice(const struct task_struct *p, const int nice) |
e43379f1 | 4990 | { |
024f4747 MM |
4991 | /* convert nice value [19,-20] to rlimit style value [1,40] */ |
4992 | int nice_rlim = 20 - nice; | |
48f24c4d | 4993 | |
e43379f1 MM |
4994 | return (nice_rlim <= p->signal->rlim[RLIMIT_NICE].rlim_cur || |
4995 | capable(CAP_SYS_NICE)); | |
4996 | } | |
4997 | ||
1da177e4 LT |
4998 | #ifdef __ARCH_WANT_SYS_NICE |
4999 | ||
5000 | /* | |
5001 | * sys_nice - change the priority of the current process. | |
5002 | * @increment: priority increment | |
5003 | * | |
5004 | * sys_setpriority is a more generic, but much slower function that | |
5005 | * does similar things. | |
5006 | */ | |
5007 | asmlinkage long sys_nice(int increment) | |
5008 | { | |
48f24c4d | 5009 | long nice, retval; |
1da177e4 LT |
5010 | |
5011 | /* | |
5012 | * Setpriority might change our priority at the same moment. | |
5013 | * We don't have to worry. Conceptually one call occurs first | |
5014 | * and we have a single winner. | |
5015 | */ | |
e43379f1 MM |
5016 | if (increment < -40) |
5017 | increment = -40; | |
1da177e4 LT |
5018 | if (increment > 40) |
5019 | increment = 40; | |
5020 | ||
5021 | nice = PRIO_TO_NICE(current->static_prio) + increment; | |
5022 | if (nice < -20) | |
5023 | nice = -20; | |
5024 | if (nice > 19) | |
5025 | nice = 19; | |
5026 | ||
e43379f1 MM |
5027 | if (increment < 0 && !can_nice(current, nice)) |
5028 | return -EPERM; | |
5029 | ||
1da177e4 LT |
5030 | retval = security_task_setnice(current, nice); |
5031 | if (retval) | |
5032 | return retval; | |
5033 | ||
5034 | set_user_nice(current, nice); | |
5035 | return 0; | |
5036 | } | |
5037 | ||
5038 | #endif | |
5039 | ||
5040 | /** | |
5041 | * task_prio - return the priority value of a given task. | |
5042 | * @p: the task in question. | |
5043 | * | |
5044 | * This is the priority value as seen by users in /proc. | |
5045 | * RT tasks are offset by -200. Normal tasks are centered | |
5046 | * around 0, value goes from -16 to +15. | |
5047 | */ | |
36c8b586 | 5048 | int task_prio(const struct task_struct *p) |
1da177e4 LT |
5049 | { |
5050 | return p->prio - MAX_RT_PRIO; | |
5051 | } | |
5052 | ||
5053 | /** | |
5054 | * task_nice - return the nice value of a given task. | |
5055 | * @p: the task in question. | |
5056 | */ | |
36c8b586 | 5057 | int task_nice(const struct task_struct *p) |
1da177e4 LT |
5058 | { |
5059 | return TASK_NICE(p); | |
5060 | } | |
150d8bed | 5061 | EXPORT_SYMBOL(task_nice); |
1da177e4 LT |
5062 | |
5063 | /** | |
5064 | * idle_cpu - is a given cpu idle currently? | |
5065 | * @cpu: the processor in question. | |
5066 | */ | |
5067 | int idle_cpu(int cpu) | |
5068 | { | |
5069 | return cpu_curr(cpu) == cpu_rq(cpu)->idle; | |
5070 | } | |
5071 | ||
1da177e4 LT |
5072 | /** |
5073 | * idle_task - return the idle task for a given cpu. | |
5074 | * @cpu: the processor in question. | |
5075 | */ | |
36c8b586 | 5076 | struct task_struct *idle_task(int cpu) |
1da177e4 LT |
5077 | { |
5078 | return cpu_rq(cpu)->idle; | |
5079 | } | |
5080 | ||
5081 | /** | |
5082 | * find_process_by_pid - find a process with a matching PID value. | |
5083 | * @pid: the pid in question. | |
5084 | */ | |
a9957449 | 5085 | static struct task_struct *find_process_by_pid(pid_t pid) |
1da177e4 | 5086 | { |
228ebcbe | 5087 | return pid ? find_task_by_vpid(pid) : current; |
1da177e4 LT |
5088 | } |
5089 | ||
5090 | /* Actually do priority change: must hold rq lock. */ | |
dd41f596 IM |
5091 | static void |
5092 | __setscheduler(struct rq *rq, struct task_struct *p, int policy, int prio) | |
1da177e4 | 5093 | { |
dd41f596 | 5094 | BUG_ON(p->se.on_rq); |
48f24c4d | 5095 | |
1da177e4 | 5096 | p->policy = policy; |
dd41f596 IM |
5097 | switch (p->policy) { |
5098 | case SCHED_NORMAL: | |
5099 | case SCHED_BATCH: | |
5100 | case SCHED_IDLE: | |
5101 | p->sched_class = &fair_sched_class; | |
5102 | break; | |
5103 | case SCHED_FIFO: | |
5104 | case SCHED_RR: | |
5105 | p->sched_class = &rt_sched_class; | |
5106 | break; | |
5107 | } | |
5108 | ||
1da177e4 | 5109 | p->rt_priority = prio; |
b29739f9 IM |
5110 | p->normal_prio = normal_prio(p); |
5111 | /* we are holding p->pi_lock already */ | |
5112 | p->prio = rt_mutex_getprio(p); | |
2dd73a4f | 5113 | set_load_weight(p); |
1da177e4 LT |
5114 | } |
5115 | ||
961ccddd RR |
5116 | static int __sched_setscheduler(struct task_struct *p, int policy, |
5117 | struct sched_param *param, bool user) | |
1da177e4 | 5118 | { |
83b699ed | 5119 | int retval, oldprio, oldpolicy = -1, on_rq, running; |
1da177e4 | 5120 | unsigned long flags; |
cb469845 | 5121 | const struct sched_class *prev_class = p->sched_class; |
70b97a7f | 5122 | struct rq *rq; |
1da177e4 | 5123 | |
66e5393a SR |
5124 | /* may grab non-irq protected spin_locks */ |
5125 | BUG_ON(in_interrupt()); | |
1da177e4 LT |
5126 | recheck: |
5127 | /* double check policy once rq lock held */ | |
5128 | if (policy < 0) | |
5129 | policy = oldpolicy = p->policy; | |
5130 | else if (policy != SCHED_FIFO && policy != SCHED_RR && | |
dd41f596 IM |
5131 | policy != SCHED_NORMAL && policy != SCHED_BATCH && |
5132 | policy != SCHED_IDLE) | |
b0a9499c | 5133 | return -EINVAL; |
1da177e4 LT |
5134 | /* |
5135 | * Valid priorities for SCHED_FIFO and SCHED_RR are | |
dd41f596 IM |
5136 | * 1..MAX_USER_RT_PRIO-1, valid priority for SCHED_NORMAL, |
5137 | * SCHED_BATCH and SCHED_IDLE is 0. | |
1da177e4 LT |
5138 | */ |
5139 | if (param->sched_priority < 0 || | |
95cdf3b7 | 5140 | (p->mm && param->sched_priority > MAX_USER_RT_PRIO-1) || |
d46523ea | 5141 | (!p->mm && param->sched_priority > MAX_RT_PRIO-1)) |
1da177e4 | 5142 | return -EINVAL; |
e05606d3 | 5143 | if (rt_policy(policy) != (param->sched_priority != 0)) |
1da177e4 LT |
5144 | return -EINVAL; |
5145 | ||
37e4ab3f OC |
5146 | /* |
5147 | * Allow unprivileged RT tasks to decrease priority: | |
5148 | */ | |
961ccddd | 5149 | if (user && !capable(CAP_SYS_NICE)) { |
e05606d3 | 5150 | if (rt_policy(policy)) { |
8dc3e909 | 5151 | unsigned long rlim_rtprio; |
8dc3e909 ON |
5152 | |
5153 | if (!lock_task_sighand(p, &flags)) | |
5154 | return -ESRCH; | |
5155 | rlim_rtprio = p->signal->rlim[RLIMIT_RTPRIO].rlim_cur; | |
5156 | unlock_task_sighand(p, &flags); | |
5157 | ||
5158 | /* can't set/change the rt policy */ | |
5159 | if (policy != p->policy && !rlim_rtprio) | |
5160 | return -EPERM; | |
5161 | ||
5162 | /* can't increase priority */ | |
5163 | if (param->sched_priority > p->rt_priority && | |
5164 | param->sched_priority > rlim_rtprio) | |
5165 | return -EPERM; | |
5166 | } | |
dd41f596 IM |
5167 | /* |
5168 | * Like positive nice levels, dont allow tasks to | |
5169 | * move out of SCHED_IDLE either: | |
5170 | */ | |
5171 | if (p->policy == SCHED_IDLE && policy != SCHED_IDLE) | |
5172 | return -EPERM; | |
5fe1d75f | 5173 | |
37e4ab3f OC |
5174 | /* can't change other user's priorities */ |
5175 | if ((current->euid != p->euid) && | |
5176 | (current->euid != p->uid)) | |
5177 | return -EPERM; | |
5178 | } | |
1da177e4 | 5179 | |
725aad24 | 5180 | if (user) { |
b68aa230 | 5181 | #ifdef CONFIG_RT_GROUP_SCHED |
725aad24 JF |
5182 | /* |
5183 | * Do not allow realtime tasks into groups that have no runtime | |
5184 | * assigned. | |
5185 | */ | |
9a7e0b18 PZ |
5186 | if (rt_bandwidth_enabled() && rt_policy(policy) && |
5187 | task_group(p)->rt_bandwidth.rt_runtime == 0) | |
725aad24 | 5188 | return -EPERM; |
b68aa230 PZ |
5189 | #endif |
5190 | ||
725aad24 JF |
5191 | retval = security_task_setscheduler(p, policy, param); |
5192 | if (retval) | |
5193 | return retval; | |
5194 | } | |
5195 | ||
b29739f9 IM |
5196 | /* |
5197 | * make sure no PI-waiters arrive (or leave) while we are | |
5198 | * changing the priority of the task: | |
5199 | */ | |
5200 | spin_lock_irqsave(&p->pi_lock, flags); | |
1da177e4 LT |
5201 | /* |
5202 | * To be able to change p->policy safely, the apropriate | |
5203 | * runqueue lock must be held. | |
5204 | */ | |
b29739f9 | 5205 | rq = __task_rq_lock(p); |
1da177e4 LT |
5206 | /* recheck policy now with rq lock held */ |
5207 | if (unlikely(oldpolicy != -1 && oldpolicy != p->policy)) { | |
5208 | policy = oldpolicy = -1; | |
b29739f9 IM |
5209 | __task_rq_unlock(rq); |
5210 | spin_unlock_irqrestore(&p->pi_lock, flags); | |
1da177e4 LT |
5211 | goto recheck; |
5212 | } | |
2daa3577 | 5213 | update_rq_clock(rq); |
dd41f596 | 5214 | on_rq = p->se.on_rq; |
051a1d1a | 5215 | running = task_current(rq, p); |
0e1f3483 | 5216 | if (on_rq) |
2e1cb74a | 5217 | deactivate_task(rq, p, 0); |
0e1f3483 HS |
5218 | if (running) |
5219 | p->sched_class->put_prev_task(rq, p); | |
f6b53205 | 5220 | |
1da177e4 | 5221 | oldprio = p->prio; |
dd41f596 | 5222 | __setscheduler(rq, p, policy, param->sched_priority); |
f6b53205 | 5223 | |
0e1f3483 HS |
5224 | if (running) |
5225 | p->sched_class->set_curr_task(rq); | |
dd41f596 IM |
5226 | if (on_rq) { |
5227 | activate_task(rq, p, 0); | |
cb469845 SR |
5228 | |
5229 | check_class_changed(rq, p, prev_class, oldprio, running); | |
1da177e4 | 5230 | } |
b29739f9 IM |
5231 | __task_rq_unlock(rq); |
5232 | spin_unlock_irqrestore(&p->pi_lock, flags); | |
5233 | ||
95e02ca9 TG |
5234 | rt_mutex_adjust_pi(p); |
5235 | ||
1da177e4 LT |
5236 | return 0; |
5237 | } | |
961ccddd RR |
5238 | |
5239 | /** | |
5240 | * sched_setscheduler - change the scheduling policy and/or RT priority of a thread. | |
5241 | * @p: the task in question. | |
5242 | * @policy: new policy. | |
5243 | * @param: structure containing the new RT priority. | |
5244 | * | |
5245 | * NOTE that the task may be already dead. | |
5246 | */ | |
5247 | int sched_setscheduler(struct task_struct *p, int policy, | |
5248 | struct sched_param *param) | |
5249 | { | |
5250 | return __sched_setscheduler(p, policy, param, true); | |
5251 | } | |
1da177e4 LT |
5252 | EXPORT_SYMBOL_GPL(sched_setscheduler); |
5253 | ||
961ccddd RR |
5254 | /** |
5255 | * sched_setscheduler_nocheck - change the scheduling policy and/or RT priority of a thread from kernelspace. | |
5256 | * @p: the task in question. | |
5257 | * @policy: new policy. | |
5258 | * @param: structure containing the new RT priority. | |
5259 | * | |
5260 | * Just like sched_setscheduler, only don't bother checking if the | |
5261 | * current context has permission. For example, this is needed in | |
5262 | * stop_machine(): we create temporary high priority worker threads, | |
5263 | * but our caller might not have that capability. | |
5264 | */ | |
5265 | int sched_setscheduler_nocheck(struct task_struct *p, int policy, | |
5266 | struct sched_param *param) | |
5267 | { | |
5268 | return __sched_setscheduler(p, policy, param, false); | |
5269 | } | |
5270 | ||
95cdf3b7 IM |
5271 | static int |
5272 | do_sched_setscheduler(pid_t pid, int policy, struct sched_param __user *param) | |
1da177e4 | 5273 | { |
1da177e4 LT |
5274 | struct sched_param lparam; |
5275 | struct task_struct *p; | |
36c8b586 | 5276 | int retval; |
1da177e4 LT |
5277 | |
5278 | if (!param || pid < 0) | |
5279 | return -EINVAL; | |
5280 | if (copy_from_user(&lparam, param, sizeof(struct sched_param))) | |
5281 | return -EFAULT; | |
5fe1d75f ON |
5282 | |
5283 | rcu_read_lock(); | |
5284 | retval = -ESRCH; | |
1da177e4 | 5285 | p = find_process_by_pid(pid); |
5fe1d75f ON |
5286 | if (p != NULL) |
5287 | retval = sched_setscheduler(p, policy, &lparam); | |
5288 | rcu_read_unlock(); | |
36c8b586 | 5289 | |
1da177e4 LT |
5290 | return retval; |
5291 | } | |
5292 | ||
5293 | /** | |
5294 | * sys_sched_setscheduler - set/change the scheduler policy and RT priority | |
5295 | * @pid: the pid in question. | |
5296 | * @policy: new policy. | |
5297 | * @param: structure containing the new RT priority. | |
5298 | */ | |
41a2d6cf IM |
5299 | asmlinkage long |
5300 | sys_sched_setscheduler(pid_t pid, int policy, struct sched_param __user *param) | |
1da177e4 | 5301 | { |
c21761f1 JB |
5302 | /* negative values for policy are not valid */ |
5303 | if (policy < 0) | |
5304 | return -EINVAL; | |
5305 | ||
1da177e4 LT |
5306 | return do_sched_setscheduler(pid, policy, param); |
5307 | } | |
5308 | ||
5309 | /** | |
5310 | * sys_sched_setparam - set/change the RT priority of a thread | |
5311 | * @pid: the pid in question. | |
5312 | * @param: structure containing the new RT priority. | |
5313 | */ | |
5314 | asmlinkage long sys_sched_setparam(pid_t pid, struct sched_param __user *param) | |
5315 | { | |
5316 | return do_sched_setscheduler(pid, -1, param); | |
5317 | } | |
5318 | ||
5319 | /** | |
5320 | * sys_sched_getscheduler - get the policy (scheduling class) of a thread | |
5321 | * @pid: the pid in question. | |
5322 | */ | |
5323 | asmlinkage long sys_sched_getscheduler(pid_t pid) | |
5324 | { | |
36c8b586 | 5325 | struct task_struct *p; |
3a5c359a | 5326 | int retval; |
1da177e4 LT |
5327 | |
5328 | if (pid < 0) | |
3a5c359a | 5329 | return -EINVAL; |
1da177e4 LT |
5330 | |
5331 | retval = -ESRCH; | |
5332 | read_lock(&tasklist_lock); | |
5333 | p = find_process_by_pid(pid); | |
5334 | if (p) { | |
5335 | retval = security_task_getscheduler(p); | |
5336 | if (!retval) | |
5337 | retval = p->policy; | |
5338 | } | |
5339 | read_unlock(&tasklist_lock); | |
1da177e4 LT |
5340 | return retval; |
5341 | } | |
5342 | ||
5343 | /** | |
5344 | * sys_sched_getscheduler - get the RT priority of a thread | |
5345 | * @pid: the pid in question. | |
5346 | * @param: structure containing the RT priority. | |
5347 | */ | |
5348 | asmlinkage long sys_sched_getparam(pid_t pid, struct sched_param __user *param) | |
5349 | { | |
5350 | struct sched_param lp; | |
36c8b586 | 5351 | struct task_struct *p; |
3a5c359a | 5352 | int retval; |
1da177e4 LT |
5353 | |
5354 | if (!param || pid < 0) | |
3a5c359a | 5355 | return -EINVAL; |
1da177e4 LT |
5356 | |
5357 | read_lock(&tasklist_lock); | |
5358 | p = find_process_by_pid(pid); | |
5359 | retval = -ESRCH; | |
5360 | if (!p) | |
5361 | goto out_unlock; | |
5362 | ||
5363 | retval = security_task_getscheduler(p); | |
5364 | if (retval) | |
5365 | goto out_unlock; | |
5366 | ||
5367 | lp.sched_priority = p->rt_priority; | |
5368 | read_unlock(&tasklist_lock); | |
5369 | ||
5370 | /* | |
5371 | * This one might sleep, we cannot do it with a spinlock held ... | |
5372 | */ | |
5373 | retval = copy_to_user(param, &lp, sizeof(*param)) ? -EFAULT : 0; | |
5374 | ||
1da177e4 LT |
5375 | return retval; |
5376 | ||
5377 | out_unlock: | |
5378 | read_unlock(&tasklist_lock); | |
5379 | return retval; | |
5380 | } | |
5381 | ||
b53e921b | 5382 | long sched_setaffinity(pid_t pid, const cpumask_t *in_mask) |
1da177e4 | 5383 | { |
1da177e4 | 5384 | cpumask_t cpus_allowed; |
b53e921b | 5385 | cpumask_t new_mask = *in_mask; |
36c8b586 IM |
5386 | struct task_struct *p; |
5387 | int retval; | |
1da177e4 | 5388 | |
95402b38 | 5389 | get_online_cpus(); |
1da177e4 LT |
5390 | read_lock(&tasklist_lock); |
5391 | ||
5392 | p = find_process_by_pid(pid); | |
5393 | if (!p) { | |
5394 | read_unlock(&tasklist_lock); | |
95402b38 | 5395 | put_online_cpus(); |
1da177e4 LT |
5396 | return -ESRCH; |
5397 | } | |
5398 | ||
5399 | /* | |
5400 | * It is not safe to call set_cpus_allowed with the | |
41a2d6cf | 5401 | * tasklist_lock held. We will bump the task_struct's |
1da177e4 LT |
5402 | * usage count and then drop tasklist_lock. |
5403 | */ | |
5404 | get_task_struct(p); | |
5405 | read_unlock(&tasklist_lock); | |
5406 | ||
5407 | retval = -EPERM; | |
5408 | if ((current->euid != p->euid) && (current->euid != p->uid) && | |
5409 | !capable(CAP_SYS_NICE)) | |
5410 | goto out_unlock; | |
5411 | ||
e7834f8f DQ |
5412 | retval = security_task_setscheduler(p, 0, NULL); |
5413 | if (retval) | |
5414 | goto out_unlock; | |
5415 | ||
f9a86fcb | 5416 | cpuset_cpus_allowed(p, &cpus_allowed); |
1da177e4 | 5417 | cpus_and(new_mask, new_mask, cpus_allowed); |
8707d8b8 | 5418 | again: |
7c16ec58 | 5419 | retval = set_cpus_allowed_ptr(p, &new_mask); |
1da177e4 | 5420 | |
8707d8b8 | 5421 | if (!retval) { |
f9a86fcb | 5422 | cpuset_cpus_allowed(p, &cpus_allowed); |
8707d8b8 PM |
5423 | if (!cpus_subset(new_mask, cpus_allowed)) { |
5424 | /* | |
5425 | * We must have raced with a concurrent cpuset | |
5426 | * update. Just reset the cpus_allowed to the | |
5427 | * cpuset's cpus_allowed | |
5428 | */ | |
5429 | new_mask = cpus_allowed; | |
5430 | goto again; | |
5431 | } | |
5432 | } | |
1da177e4 LT |
5433 | out_unlock: |
5434 | put_task_struct(p); | |
95402b38 | 5435 | put_online_cpus(); |
1da177e4 LT |
5436 | return retval; |
5437 | } | |
5438 | ||
5439 | static int get_user_cpu_mask(unsigned long __user *user_mask_ptr, unsigned len, | |
5440 | cpumask_t *new_mask) | |
5441 | { | |
5442 | if (len < sizeof(cpumask_t)) { | |
5443 | memset(new_mask, 0, sizeof(cpumask_t)); | |
5444 | } else if (len > sizeof(cpumask_t)) { | |
5445 | len = sizeof(cpumask_t); | |
5446 | } | |
5447 | return copy_from_user(new_mask, user_mask_ptr, len) ? -EFAULT : 0; | |
5448 | } | |
5449 | ||
5450 | /** | |
5451 | * sys_sched_setaffinity - set the cpu affinity of a process | |
5452 | * @pid: pid of the process | |
5453 | * @len: length in bytes of the bitmask pointed to by user_mask_ptr | |
5454 | * @user_mask_ptr: user-space pointer to the new cpu mask | |
5455 | */ | |
5456 | asmlinkage long sys_sched_setaffinity(pid_t pid, unsigned int len, | |
5457 | unsigned long __user *user_mask_ptr) | |
5458 | { | |
5459 | cpumask_t new_mask; | |
5460 | int retval; | |
5461 | ||
5462 | retval = get_user_cpu_mask(user_mask_ptr, len, &new_mask); | |
5463 | if (retval) | |
5464 | return retval; | |
5465 | ||
b53e921b | 5466 | return sched_setaffinity(pid, &new_mask); |
1da177e4 LT |
5467 | } |
5468 | ||
1da177e4 LT |
5469 | long sched_getaffinity(pid_t pid, cpumask_t *mask) |
5470 | { | |
36c8b586 | 5471 | struct task_struct *p; |
1da177e4 | 5472 | int retval; |
1da177e4 | 5473 | |
95402b38 | 5474 | get_online_cpus(); |
1da177e4 LT |
5475 | read_lock(&tasklist_lock); |
5476 | ||
5477 | retval = -ESRCH; | |
5478 | p = find_process_by_pid(pid); | |
5479 | if (!p) | |
5480 | goto out_unlock; | |
5481 | ||
e7834f8f DQ |
5482 | retval = security_task_getscheduler(p); |
5483 | if (retval) | |
5484 | goto out_unlock; | |
5485 | ||
2f7016d9 | 5486 | cpus_and(*mask, p->cpus_allowed, cpu_online_map); |
1da177e4 LT |
5487 | |
5488 | out_unlock: | |
5489 | read_unlock(&tasklist_lock); | |
95402b38 | 5490 | put_online_cpus(); |
1da177e4 | 5491 | |
9531b62f | 5492 | return retval; |
1da177e4 LT |
5493 | } |
5494 | ||
5495 | /** | |
5496 | * sys_sched_getaffinity - get the cpu affinity of a process | |
5497 | * @pid: pid of the process | |
5498 | * @len: length in bytes of the bitmask pointed to by user_mask_ptr | |
5499 | * @user_mask_ptr: user-space pointer to hold the current cpu mask | |
5500 | */ | |
5501 | asmlinkage long sys_sched_getaffinity(pid_t pid, unsigned int len, | |
5502 | unsigned long __user *user_mask_ptr) | |
5503 | { | |
5504 | int ret; | |
5505 | cpumask_t mask; | |
5506 | ||
5507 | if (len < sizeof(cpumask_t)) | |
5508 | return -EINVAL; | |
5509 | ||
5510 | ret = sched_getaffinity(pid, &mask); | |
5511 | if (ret < 0) | |
5512 | return ret; | |
5513 | ||
5514 | if (copy_to_user(user_mask_ptr, &mask, sizeof(cpumask_t))) | |
5515 | return -EFAULT; | |
5516 | ||
5517 | return sizeof(cpumask_t); | |
5518 | } | |
5519 | ||
5520 | /** | |
5521 | * sys_sched_yield - yield the current processor to other threads. | |
5522 | * | |
dd41f596 IM |
5523 | * This function yields the current CPU to other tasks. If there are no |
5524 | * other threads running on this CPU then this function will return. | |
1da177e4 LT |
5525 | */ |
5526 | asmlinkage long sys_sched_yield(void) | |
5527 | { | |
70b97a7f | 5528 | struct rq *rq = this_rq_lock(); |
1da177e4 | 5529 | |
2d72376b | 5530 | schedstat_inc(rq, yld_count); |
4530d7ab | 5531 | current->sched_class->yield_task(rq); |
1da177e4 LT |
5532 | |
5533 | /* | |
5534 | * Since we are going to call schedule() anyway, there's | |
5535 | * no need to preempt or enable interrupts: | |
5536 | */ | |
5537 | __release(rq->lock); | |
8a25d5de | 5538 | spin_release(&rq->lock.dep_map, 1, _THIS_IP_); |
1da177e4 LT |
5539 | _raw_spin_unlock(&rq->lock); |
5540 | preempt_enable_no_resched(); | |
5541 | ||
5542 | schedule(); | |
5543 | ||
5544 | return 0; | |
5545 | } | |
5546 | ||
e7b38404 | 5547 | static void __cond_resched(void) |
1da177e4 | 5548 | { |
8e0a43d8 IM |
5549 | #ifdef CONFIG_DEBUG_SPINLOCK_SLEEP |
5550 | __might_sleep(__FILE__, __LINE__); | |
5551 | #endif | |
5bbcfd90 IM |
5552 | /* |
5553 | * The BKS might be reacquired before we have dropped | |
5554 | * PREEMPT_ACTIVE, which could trigger a second | |
5555 | * cond_resched() call. | |
5556 | */ | |
1da177e4 LT |
5557 | do { |
5558 | add_preempt_count(PREEMPT_ACTIVE); | |
5559 | schedule(); | |
5560 | sub_preempt_count(PREEMPT_ACTIVE); | |
5561 | } while (need_resched()); | |
5562 | } | |
5563 | ||
02b67cc3 | 5564 | int __sched _cond_resched(void) |
1da177e4 | 5565 | { |
9414232f IM |
5566 | if (need_resched() && !(preempt_count() & PREEMPT_ACTIVE) && |
5567 | system_state == SYSTEM_RUNNING) { | |
1da177e4 LT |
5568 | __cond_resched(); |
5569 | return 1; | |
5570 | } | |
5571 | return 0; | |
5572 | } | |
02b67cc3 | 5573 | EXPORT_SYMBOL(_cond_resched); |
1da177e4 LT |
5574 | |
5575 | /* | |
5576 | * cond_resched_lock() - if a reschedule is pending, drop the given lock, | |
5577 | * call schedule, and on return reacquire the lock. | |
5578 | * | |
41a2d6cf | 5579 | * This works OK both with and without CONFIG_PREEMPT. We do strange low-level |
1da177e4 LT |
5580 | * operations here to prevent schedule() from being called twice (once via |
5581 | * spin_unlock(), once by hand). | |
5582 | */ | |
95cdf3b7 | 5583 | int cond_resched_lock(spinlock_t *lock) |
1da177e4 | 5584 | { |
95c354fe | 5585 | int resched = need_resched() && system_state == SYSTEM_RUNNING; |
6df3cecb JK |
5586 | int ret = 0; |
5587 | ||
95c354fe | 5588 | if (spin_needbreak(lock) || resched) { |
1da177e4 | 5589 | spin_unlock(lock); |
95c354fe NP |
5590 | if (resched && need_resched()) |
5591 | __cond_resched(); | |
5592 | else | |
5593 | cpu_relax(); | |
6df3cecb | 5594 | ret = 1; |
1da177e4 | 5595 | spin_lock(lock); |
1da177e4 | 5596 | } |
6df3cecb | 5597 | return ret; |
1da177e4 | 5598 | } |
1da177e4 LT |
5599 | EXPORT_SYMBOL(cond_resched_lock); |
5600 | ||
5601 | int __sched cond_resched_softirq(void) | |
5602 | { | |
5603 | BUG_ON(!in_softirq()); | |
5604 | ||
9414232f | 5605 | if (need_resched() && system_state == SYSTEM_RUNNING) { |
98d82567 | 5606 | local_bh_enable(); |
1da177e4 LT |
5607 | __cond_resched(); |
5608 | local_bh_disable(); | |
5609 | return 1; | |
5610 | } | |
5611 | return 0; | |
5612 | } | |
1da177e4 LT |
5613 | EXPORT_SYMBOL(cond_resched_softirq); |
5614 | ||
1da177e4 LT |
5615 | /** |
5616 | * yield - yield the current processor to other threads. | |
5617 | * | |
72fd4a35 | 5618 | * This is a shortcut for kernel-space yielding - it marks the |
1da177e4 LT |
5619 | * thread runnable and calls sys_sched_yield(). |
5620 | */ | |
5621 | void __sched yield(void) | |
5622 | { | |
5623 | set_current_state(TASK_RUNNING); | |
5624 | sys_sched_yield(); | |
5625 | } | |
1da177e4 LT |
5626 | EXPORT_SYMBOL(yield); |
5627 | ||
5628 | /* | |
41a2d6cf | 5629 | * This task is about to go to sleep on IO. Increment rq->nr_iowait so |
1da177e4 LT |
5630 | * that process accounting knows that this is a task in IO wait state. |
5631 | * | |
5632 | * But don't do that if it is a deliberate, throttling IO wait (this task | |
5633 | * has set its backing_dev_info: the queue against which it should throttle) | |
5634 | */ | |
5635 | void __sched io_schedule(void) | |
5636 | { | |
70b97a7f | 5637 | struct rq *rq = &__raw_get_cpu_var(runqueues); |
1da177e4 | 5638 | |
0ff92245 | 5639 | delayacct_blkio_start(); |
1da177e4 LT |
5640 | atomic_inc(&rq->nr_iowait); |
5641 | schedule(); | |
5642 | atomic_dec(&rq->nr_iowait); | |
0ff92245 | 5643 | delayacct_blkio_end(); |
1da177e4 | 5644 | } |
1da177e4 LT |
5645 | EXPORT_SYMBOL(io_schedule); |
5646 | ||
5647 | long __sched io_schedule_timeout(long timeout) | |
5648 | { | |
70b97a7f | 5649 | struct rq *rq = &__raw_get_cpu_var(runqueues); |
1da177e4 LT |
5650 | long ret; |
5651 | ||
0ff92245 | 5652 | delayacct_blkio_start(); |
1da177e4 LT |
5653 | atomic_inc(&rq->nr_iowait); |
5654 | ret = schedule_timeout(timeout); | |
5655 | atomic_dec(&rq->nr_iowait); | |
0ff92245 | 5656 | delayacct_blkio_end(); |
1da177e4 LT |
5657 | return ret; |
5658 | } | |
5659 | ||
5660 | /** | |
5661 | * sys_sched_get_priority_max - return maximum RT priority. | |
5662 | * @policy: scheduling class. | |
5663 | * | |
5664 | * this syscall returns the maximum rt_priority that can be used | |
5665 | * by a given scheduling class. | |
5666 | */ | |
5667 | asmlinkage long sys_sched_get_priority_max(int policy) | |
5668 | { | |
5669 | int ret = -EINVAL; | |
5670 | ||
5671 | switch (policy) { | |
5672 | case SCHED_FIFO: | |
5673 | case SCHED_RR: | |
5674 | ret = MAX_USER_RT_PRIO-1; | |
5675 | break; | |
5676 | case SCHED_NORMAL: | |
b0a9499c | 5677 | case SCHED_BATCH: |
dd41f596 | 5678 | case SCHED_IDLE: |
1da177e4 LT |
5679 | ret = 0; |
5680 | break; | |
5681 | } | |
5682 | return ret; | |
5683 | } | |
5684 | ||
5685 | /** | |
5686 | * sys_sched_get_priority_min - return minimum RT priority. | |
5687 | * @policy: scheduling class. | |
5688 | * | |
5689 | * this syscall returns the minimum rt_priority that can be used | |
5690 | * by a given scheduling class. | |
5691 | */ | |
5692 | asmlinkage long sys_sched_get_priority_min(int policy) | |
5693 | { | |
5694 | int ret = -EINVAL; | |
5695 | ||
5696 | switch (policy) { | |
5697 | case SCHED_FIFO: | |
5698 | case SCHED_RR: | |
5699 | ret = 1; | |
5700 | break; | |
5701 | case SCHED_NORMAL: | |
b0a9499c | 5702 | case SCHED_BATCH: |
dd41f596 | 5703 | case SCHED_IDLE: |
1da177e4 LT |
5704 | ret = 0; |
5705 | } | |
5706 | return ret; | |
5707 | } | |
5708 | ||
5709 | /** | |
5710 | * sys_sched_rr_get_interval - return the default timeslice of a process. | |
5711 | * @pid: pid of the process. | |
5712 | * @interval: userspace pointer to the timeslice value. | |
5713 | * | |
5714 | * this syscall writes the default timeslice value of a given process | |
5715 | * into the user-space timespec buffer. A value of '0' means infinity. | |
5716 | */ | |
5717 | asmlinkage | |
5718 | long sys_sched_rr_get_interval(pid_t pid, struct timespec __user *interval) | |
5719 | { | |
36c8b586 | 5720 | struct task_struct *p; |
a4ec24b4 | 5721 | unsigned int time_slice; |
3a5c359a | 5722 | int retval; |
1da177e4 | 5723 | struct timespec t; |
1da177e4 LT |
5724 | |
5725 | if (pid < 0) | |
3a5c359a | 5726 | return -EINVAL; |
1da177e4 LT |
5727 | |
5728 | retval = -ESRCH; | |
5729 | read_lock(&tasklist_lock); | |
5730 | p = find_process_by_pid(pid); | |
5731 | if (!p) | |
5732 | goto out_unlock; | |
5733 | ||
5734 | retval = security_task_getscheduler(p); | |
5735 | if (retval) | |
5736 | goto out_unlock; | |
5737 | ||
77034937 IM |
5738 | /* |
5739 | * Time slice is 0 for SCHED_FIFO tasks and for SCHED_OTHER | |
5740 | * tasks that are on an otherwise idle runqueue: | |
5741 | */ | |
5742 | time_slice = 0; | |
5743 | if (p->policy == SCHED_RR) { | |
a4ec24b4 | 5744 | time_slice = DEF_TIMESLICE; |
1868f958 | 5745 | } else if (p->policy != SCHED_FIFO) { |
a4ec24b4 DA |
5746 | struct sched_entity *se = &p->se; |
5747 | unsigned long flags; | |
5748 | struct rq *rq; | |
5749 | ||
5750 | rq = task_rq_lock(p, &flags); | |
77034937 IM |
5751 | if (rq->cfs.load.weight) |
5752 | time_slice = NS_TO_JIFFIES(sched_slice(&rq->cfs, se)); | |
a4ec24b4 DA |
5753 | task_rq_unlock(rq, &flags); |
5754 | } | |
1da177e4 | 5755 | read_unlock(&tasklist_lock); |
a4ec24b4 | 5756 | jiffies_to_timespec(time_slice, &t); |
1da177e4 | 5757 | retval = copy_to_user(interval, &t, sizeof(t)) ? -EFAULT : 0; |
1da177e4 | 5758 | return retval; |
3a5c359a | 5759 | |
1da177e4 LT |
5760 | out_unlock: |
5761 | read_unlock(&tasklist_lock); | |
5762 | return retval; | |
5763 | } | |
5764 | ||
7c731e0a | 5765 | static const char stat_nam[] = TASK_STATE_TO_CHAR_STR; |
36c8b586 | 5766 | |
82a1fcb9 | 5767 | void sched_show_task(struct task_struct *p) |
1da177e4 | 5768 | { |
1da177e4 | 5769 | unsigned long free = 0; |
36c8b586 | 5770 | unsigned state; |
1da177e4 | 5771 | |
1da177e4 | 5772 | state = p->state ? __ffs(p->state) + 1 : 0; |
cc4ea795 | 5773 | printk(KERN_INFO "%-13.13s %c", p->comm, |
2ed6e34f | 5774 | state < sizeof(stat_nam) - 1 ? stat_nam[state] : '?'); |
4bd77321 | 5775 | #if BITS_PER_LONG == 32 |
1da177e4 | 5776 | if (state == TASK_RUNNING) |
cc4ea795 | 5777 | printk(KERN_CONT " running "); |
1da177e4 | 5778 | else |
cc4ea795 | 5779 | printk(KERN_CONT " %08lx ", thread_saved_pc(p)); |
1da177e4 LT |
5780 | #else |
5781 | if (state == TASK_RUNNING) | |
cc4ea795 | 5782 | printk(KERN_CONT " running task "); |
1da177e4 | 5783 | else |
cc4ea795 | 5784 | printk(KERN_CONT " %016lx ", thread_saved_pc(p)); |
1da177e4 LT |
5785 | #endif |
5786 | #ifdef CONFIG_DEBUG_STACK_USAGE | |
5787 | { | |
10ebffde | 5788 | unsigned long *n = end_of_stack(p); |
1da177e4 LT |
5789 | while (!*n) |
5790 | n++; | |
10ebffde | 5791 | free = (unsigned long)n - (unsigned long)end_of_stack(p); |
1da177e4 LT |
5792 | } |
5793 | #endif | |
ba25f9dc | 5794 | printk(KERN_CONT "%5lu %5d %6d\n", free, |
fcfd50af | 5795 | task_pid_nr(p), task_pid_nr(p->real_parent)); |
1da177e4 | 5796 | |
5fb5e6de | 5797 | show_stack(p, NULL); |
1da177e4 LT |
5798 | } |
5799 | ||
e59e2ae2 | 5800 | void show_state_filter(unsigned long state_filter) |
1da177e4 | 5801 | { |
36c8b586 | 5802 | struct task_struct *g, *p; |
1da177e4 | 5803 | |
4bd77321 IM |
5804 | #if BITS_PER_LONG == 32 |
5805 | printk(KERN_INFO | |
5806 | " task PC stack pid father\n"); | |
1da177e4 | 5807 | #else |
4bd77321 IM |
5808 | printk(KERN_INFO |
5809 | " task PC stack pid father\n"); | |
1da177e4 LT |
5810 | #endif |
5811 | read_lock(&tasklist_lock); | |
5812 | do_each_thread(g, p) { | |
5813 | /* | |
5814 | * reset the NMI-timeout, listing all files on a slow | |
5815 | * console might take alot of time: | |
5816 | */ | |
5817 | touch_nmi_watchdog(); | |
39bc89fd | 5818 | if (!state_filter || (p->state & state_filter)) |
82a1fcb9 | 5819 | sched_show_task(p); |
1da177e4 LT |
5820 | } while_each_thread(g, p); |
5821 | ||
04c9167f JF |
5822 | touch_all_softlockup_watchdogs(); |
5823 | ||
dd41f596 IM |
5824 | #ifdef CONFIG_SCHED_DEBUG |
5825 | sysrq_sched_debug_show(); | |
5826 | #endif | |
1da177e4 | 5827 | read_unlock(&tasklist_lock); |
e59e2ae2 IM |
5828 | /* |
5829 | * Only show locks if all tasks are dumped: | |
5830 | */ | |
5831 | if (state_filter == -1) | |
5832 | debug_show_all_locks(); | |
1da177e4 LT |
5833 | } |
5834 | ||
1df21055 IM |
5835 | void __cpuinit init_idle_bootup_task(struct task_struct *idle) |
5836 | { | |
dd41f596 | 5837 | idle->sched_class = &idle_sched_class; |
1df21055 IM |
5838 | } |
5839 | ||
f340c0d1 IM |
5840 | /** |
5841 | * init_idle - set up an idle thread for a given CPU | |
5842 | * @idle: task in question | |
5843 | * @cpu: cpu the idle task belongs to | |
5844 | * | |
5845 | * NOTE: this function does not set the idle thread's NEED_RESCHED | |
5846 | * flag, to make booting more robust. | |
5847 | */ | |
5c1e1767 | 5848 | void __cpuinit init_idle(struct task_struct *idle, int cpu) |
1da177e4 | 5849 | { |
70b97a7f | 5850 | struct rq *rq = cpu_rq(cpu); |
1da177e4 LT |
5851 | unsigned long flags; |
5852 | ||
5cbd54ef IM |
5853 | spin_lock_irqsave(&rq->lock, flags); |
5854 | ||
dd41f596 IM |
5855 | __sched_fork(idle); |
5856 | idle->se.exec_start = sched_clock(); | |
5857 | ||
b29739f9 | 5858 | idle->prio = idle->normal_prio = MAX_PRIO; |
1da177e4 | 5859 | idle->cpus_allowed = cpumask_of_cpu(cpu); |
dd41f596 | 5860 | __set_task_cpu(idle, cpu); |
1da177e4 | 5861 | |
1da177e4 | 5862 | rq->curr = rq->idle = idle; |
4866cde0 NP |
5863 | #if defined(CONFIG_SMP) && defined(__ARCH_WANT_UNLOCKED_CTXSW) |
5864 | idle->oncpu = 1; | |
5865 | #endif | |
1da177e4 LT |
5866 | spin_unlock_irqrestore(&rq->lock, flags); |
5867 | ||
5868 | /* Set the preempt count _outside_ the spinlocks! */ | |
8e3e076c LT |
5869 | #if defined(CONFIG_PREEMPT) |
5870 | task_thread_info(idle)->preempt_count = (idle->lock_depth >= 0); | |
5871 | #else | |
a1261f54 | 5872 | task_thread_info(idle)->preempt_count = 0; |
8e3e076c | 5873 | #endif |
dd41f596 IM |
5874 | /* |
5875 | * The idle tasks have their own, simple scheduling class: | |
5876 | */ | |
5877 | idle->sched_class = &idle_sched_class; | |
1da177e4 LT |
5878 | } |
5879 | ||
5880 | /* | |
5881 | * In a system that switches off the HZ timer nohz_cpu_mask | |
5882 | * indicates which cpus entered this state. This is used | |
5883 | * in the rcu update to wait only for active cpus. For system | |
5884 | * which do not switch off the HZ timer nohz_cpu_mask should | |
5885 | * always be CPU_MASK_NONE. | |
5886 | */ | |
5887 | cpumask_t nohz_cpu_mask = CPU_MASK_NONE; | |
5888 | ||
19978ca6 IM |
5889 | /* |
5890 | * Increase the granularity value when there are more CPUs, | |
5891 | * because with more CPUs the 'effective latency' as visible | |
5892 | * to users decreases. But the relationship is not linear, | |
5893 | * so pick a second-best guess by going with the log2 of the | |
5894 | * number of CPUs. | |
5895 | * | |
5896 | * This idea comes from the SD scheduler of Con Kolivas: | |
5897 | */ | |
5898 | static inline void sched_init_granularity(void) | |
5899 | { | |
5900 | unsigned int factor = 1 + ilog2(num_online_cpus()); | |
5901 | const unsigned long limit = 200000000; | |
5902 | ||
5903 | sysctl_sched_min_granularity *= factor; | |
5904 | if (sysctl_sched_min_granularity > limit) | |
5905 | sysctl_sched_min_granularity = limit; | |
5906 | ||
5907 | sysctl_sched_latency *= factor; | |
5908 | if (sysctl_sched_latency > limit) | |
5909 | sysctl_sched_latency = limit; | |
5910 | ||
5911 | sysctl_sched_wakeup_granularity *= factor; | |
55cd5340 PZ |
5912 | |
5913 | sysctl_sched_shares_ratelimit *= factor; | |
19978ca6 IM |
5914 | } |
5915 | ||
1da177e4 LT |
5916 | #ifdef CONFIG_SMP |
5917 | /* | |
5918 | * This is how migration works: | |
5919 | * | |
70b97a7f | 5920 | * 1) we queue a struct migration_req structure in the source CPU's |
1da177e4 LT |
5921 | * runqueue and wake up that CPU's migration thread. |
5922 | * 2) we down() the locked semaphore => thread blocks. | |
5923 | * 3) migration thread wakes up (implicitly it forces the migrated | |
5924 | * thread off the CPU) | |
5925 | * 4) it gets the migration request and checks whether the migrated | |
5926 | * task is still in the wrong runqueue. | |
5927 | * 5) if it's in the wrong runqueue then the migration thread removes | |
5928 | * it and puts it into the right queue. | |
5929 | * 6) migration thread up()s the semaphore. | |
5930 | * 7) we wake up and the migration is done. | |
5931 | */ | |
5932 | ||
5933 | /* | |
5934 | * Change a given task's CPU affinity. Migrate the thread to a | |
5935 | * proper CPU and schedule it away if the CPU it's executing on | |
5936 | * is removed from the allowed bitmask. | |
5937 | * | |
5938 | * NOTE: the caller must have a valid reference to the task, the | |
41a2d6cf | 5939 | * task must not exit() & deallocate itself prematurely. The |
1da177e4 LT |
5940 | * call is not atomic; no spinlocks may be held. |
5941 | */ | |
cd8ba7cd | 5942 | int set_cpus_allowed_ptr(struct task_struct *p, const cpumask_t *new_mask) |
1da177e4 | 5943 | { |
70b97a7f | 5944 | struct migration_req req; |
1da177e4 | 5945 | unsigned long flags; |
70b97a7f | 5946 | struct rq *rq; |
48f24c4d | 5947 | int ret = 0; |
1da177e4 LT |
5948 | |
5949 | rq = task_rq_lock(p, &flags); | |
cd8ba7cd | 5950 | if (!cpus_intersects(*new_mask, cpu_online_map)) { |
1da177e4 LT |
5951 | ret = -EINVAL; |
5952 | goto out; | |
5953 | } | |
5954 | ||
9985b0ba DR |
5955 | if (unlikely((p->flags & PF_THREAD_BOUND) && p != current && |
5956 | !cpus_equal(p->cpus_allowed, *new_mask))) { | |
5957 | ret = -EINVAL; | |
5958 | goto out; | |
5959 | } | |
5960 | ||
73fe6aae | 5961 | if (p->sched_class->set_cpus_allowed) |
cd8ba7cd | 5962 | p->sched_class->set_cpus_allowed(p, new_mask); |
73fe6aae | 5963 | else { |
cd8ba7cd MT |
5964 | p->cpus_allowed = *new_mask; |
5965 | p->rt.nr_cpus_allowed = cpus_weight(*new_mask); | |
73fe6aae GH |
5966 | } |
5967 | ||
1da177e4 | 5968 | /* Can the task run on the task's current CPU? If so, we're done */ |
cd8ba7cd | 5969 | if (cpu_isset(task_cpu(p), *new_mask)) |
1da177e4 LT |
5970 | goto out; |
5971 | ||
cd8ba7cd | 5972 | if (migrate_task(p, any_online_cpu(*new_mask), &req)) { |
1da177e4 LT |
5973 | /* Need help from migration thread: drop lock and wait. */ |
5974 | task_rq_unlock(rq, &flags); | |
5975 | wake_up_process(rq->migration_thread); | |
5976 | wait_for_completion(&req.done); | |
5977 | tlb_migrate_finish(p->mm); | |
5978 | return 0; | |
5979 | } | |
5980 | out: | |
5981 | task_rq_unlock(rq, &flags); | |
48f24c4d | 5982 | |
1da177e4 LT |
5983 | return ret; |
5984 | } | |
cd8ba7cd | 5985 | EXPORT_SYMBOL_GPL(set_cpus_allowed_ptr); |
1da177e4 LT |
5986 | |
5987 | /* | |
41a2d6cf | 5988 | * Move (not current) task off this cpu, onto dest cpu. We're doing |
1da177e4 LT |
5989 | * this because either it can't run here any more (set_cpus_allowed() |
5990 | * away from this CPU, or CPU going down), or because we're | |
5991 | * attempting to rebalance this task on exec (sched_exec). | |
5992 | * | |
5993 | * So we race with normal scheduler movements, but that's OK, as long | |
5994 | * as the task is no longer on this CPU. | |
efc30814 KK |
5995 | * |
5996 | * Returns non-zero if task was successfully migrated. | |
1da177e4 | 5997 | */ |
efc30814 | 5998 | static int __migrate_task(struct task_struct *p, int src_cpu, int dest_cpu) |
1da177e4 | 5999 | { |
70b97a7f | 6000 | struct rq *rq_dest, *rq_src; |
dd41f596 | 6001 | int ret = 0, on_rq; |
1da177e4 | 6002 | |
e761b772 | 6003 | if (unlikely(!cpu_active(dest_cpu))) |
efc30814 | 6004 | return ret; |
1da177e4 LT |
6005 | |
6006 | rq_src = cpu_rq(src_cpu); | |
6007 | rq_dest = cpu_rq(dest_cpu); | |
6008 | ||
6009 | double_rq_lock(rq_src, rq_dest); | |
6010 | /* Already moved. */ | |
6011 | if (task_cpu(p) != src_cpu) | |
b1e38734 | 6012 | goto done; |
1da177e4 LT |
6013 | /* Affinity changed (again). */ |
6014 | if (!cpu_isset(dest_cpu, p->cpus_allowed)) | |
b1e38734 | 6015 | goto fail; |
1da177e4 | 6016 | |
dd41f596 | 6017 | on_rq = p->se.on_rq; |
6e82a3be | 6018 | if (on_rq) |
2e1cb74a | 6019 | deactivate_task(rq_src, p, 0); |
6e82a3be | 6020 | |
1da177e4 | 6021 | set_task_cpu(p, dest_cpu); |
dd41f596 IM |
6022 | if (on_rq) { |
6023 | activate_task(rq_dest, p, 0); | |
15afe09b | 6024 | check_preempt_curr(rq_dest, p, 0); |
1da177e4 | 6025 | } |
b1e38734 | 6026 | done: |
efc30814 | 6027 | ret = 1; |
b1e38734 | 6028 | fail: |
1da177e4 | 6029 | double_rq_unlock(rq_src, rq_dest); |
efc30814 | 6030 | return ret; |
1da177e4 LT |
6031 | } |
6032 | ||
6033 | /* | |
6034 | * migration_thread - this is a highprio system thread that performs | |
6035 | * thread migration by bumping thread off CPU then 'pushing' onto | |
6036 | * another runqueue. | |
6037 | */ | |
95cdf3b7 | 6038 | static int migration_thread(void *data) |
1da177e4 | 6039 | { |
1da177e4 | 6040 | int cpu = (long)data; |
70b97a7f | 6041 | struct rq *rq; |
1da177e4 LT |
6042 | |
6043 | rq = cpu_rq(cpu); | |
6044 | BUG_ON(rq->migration_thread != current); | |
6045 | ||
6046 | set_current_state(TASK_INTERRUPTIBLE); | |
6047 | while (!kthread_should_stop()) { | |
70b97a7f | 6048 | struct migration_req *req; |
1da177e4 | 6049 | struct list_head *head; |
1da177e4 | 6050 | |
1da177e4 LT |
6051 | spin_lock_irq(&rq->lock); |
6052 | ||
6053 | if (cpu_is_offline(cpu)) { | |
6054 | spin_unlock_irq(&rq->lock); | |
6055 | goto wait_to_die; | |
6056 | } | |
6057 | ||
6058 | if (rq->active_balance) { | |
6059 | active_load_balance(rq, cpu); | |
6060 | rq->active_balance = 0; | |
6061 | } | |
6062 | ||
6063 | head = &rq->migration_queue; | |
6064 | ||
6065 | if (list_empty(head)) { | |
6066 | spin_unlock_irq(&rq->lock); | |
6067 | schedule(); | |
6068 | set_current_state(TASK_INTERRUPTIBLE); | |
6069 | continue; | |
6070 | } | |
70b97a7f | 6071 | req = list_entry(head->next, struct migration_req, list); |
1da177e4 LT |
6072 | list_del_init(head->next); |
6073 | ||
674311d5 NP |
6074 | spin_unlock(&rq->lock); |
6075 | __migrate_task(req->task, cpu, req->dest_cpu); | |
6076 | local_irq_enable(); | |
1da177e4 LT |
6077 | |
6078 | complete(&req->done); | |
6079 | } | |
6080 | __set_current_state(TASK_RUNNING); | |
6081 | return 0; | |
6082 | ||
6083 | wait_to_die: | |
6084 | /* Wait for kthread_stop */ | |
6085 | set_current_state(TASK_INTERRUPTIBLE); | |
6086 | while (!kthread_should_stop()) { | |
6087 | schedule(); | |
6088 | set_current_state(TASK_INTERRUPTIBLE); | |
6089 | } | |
6090 | __set_current_state(TASK_RUNNING); | |
6091 | return 0; | |
6092 | } | |
6093 | ||
6094 | #ifdef CONFIG_HOTPLUG_CPU | |
f7b4cddc ON |
6095 | |
6096 | static int __migrate_task_irq(struct task_struct *p, int src_cpu, int dest_cpu) | |
6097 | { | |
6098 | int ret; | |
6099 | ||
6100 | local_irq_disable(); | |
6101 | ret = __migrate_task(p, src_cpu, dest_cpu); | |
6102 | local_irq_enable(); | |
6103 | return ret; | |
6104 | } | |
6105 | ||
054b9108 | 6106 | /* |
3a4fa0a2 | 6107 | * Figure out where task on dead CPU should go, use force if necessary. |
054b9108 KK |
6108 | * NOTE: interrupts should be disabled by the caller |
6109 | */ | |
48f24c4d | 6110 | static void move_task_off_dead_cpu(int dead_cpu, struct task_struct *p) |
1da177e4 | 6111 | { |
efc30814 | 6112 | unsigned long flags; |
1da177e4 | 6113 | cpumask_t mask; |
70b97a7f IM |
6114 | struct rq *rq; |
6115 | int dest_cpu; | |
1da177e4 | 6116 | |
3a5c359a AK |
6117 | do { |
6118 | /* On same node? */ | |
6119 | mask = node_to_cpumask(cpu_to_node(dead_cpu)); | |
6120 | cpus_and(mask, mask, p->cpus_allowed); | |
6121 | dest_cpu = any_online_cpu(mask); | |
6122 | ||
6123 | /* On any allowed CPU? */ | |
434d53b0 | 6124 | if (dest_cpu >= nr_cpu_ids) |
3a5c359a AK |
6125 | dest_cpu = any_online_cpu(p->cpus_allowed); |
6126 | ||
6127 | /* No more Mr. Nice Guy. */ | |
434d53b0 | 6128 | if (dest_cpu >= nr_cpu_ids) { |
f9a86fcb MT |
6129 | cpumask_t cpus_allowed; |
6130 | ||
6131 | cpuset_cpus_allowed_locked(p, &cpus_allowed); | |
470fd646 CW |
6132 | /* |
6133 | * Try to stay on the same cpuset, where the | |
6134 | * current cpuset may be a subset of all cpus. | |
6135 | * The cpuset_cpus_allowed_locked() variant of | |
41a2d6cf | 6136 | * cpuset_cpus_allowed() will not block. It must be |
470fd646 CW |
6137 | * called within calls to cpuset_lock/cpuset_unlock. |
6138 | */ | |
3a5c359a | 6139 | rq = task_rq_lock(p, &flags); |
470fd646 | 6140 | p->cpus_allowed = cpus_allowed; |
3a5c359a AK |
6141 | dest_cpu = any_online_cpu(p->cpus_allowed); |
6142 | task_rq_unlock(rq, &flags); | |
1da177e4 | 6143 | |
3a5c359a AK |
6144 | /* |
6145 | * Don't tell them about moving exiting tasks or | |
6146 | * kernel threads (both mm NULL), since they never | |
6147 | * leave kernel. | |
6148 | */ | |
41a2d6cf | 6149 | if (p->mm && printk_ratelimit()) { |
3a5c359a AK |
6150 | printk(KERN_INFO "process %d (%s) no " |
6151 | "longer affine to cpu%d\n", | |
41a2d6cf IM |
6152 | task_pid_nr(p), p->comm, dead_cpu); |
6153 | } | |
3a5c359a | 6154 | } |
f7b4cddc | 6155 | } while (!__migrate_task_irq(p, dead_cpu, dest_cpu)); |
1da177e4 LT |
6156 | } |
6157 | ||
6158 | /* | |
6159 | * While a dead CPU has no uninterruptible tasks queued at this point, | |
6160 | * it might still have a nonzero ->nr_uninterruptible counter, because | |
6161 | * for performance reasons the counter is not stricly tracking tasks to | |
6162 | * their home CPUs. So we just add the counter to another CPU's counter, | |
6163 | * to keep the global sum constant after CPU-down: | |
6164 | */ | |
70b97a7f | 6165 | static void migrate_nr_uninterruptible(struct rq *rq_src) |
1da177e4 | 6166 | { |
7c16ec58 | 6167 | struct rq *rq_dest = cpu_rq(any_online_cpu(*CPU_MASK_ALL_PTR)); |
1da177e4 LT |
6168 | unsigned long flags; |
6169 | ||
6170 | local_irq_save(flags); | |
6171 | double_rq_lock(rq_src, rq_dest); | |
6172 | rq_dest->nr_uninterruptible += rq_src->nr_uninterruptible; | |
6173 | rq_src->nr_uninterruptible = 0; | |
6174 | double_rq_unlock(rq_src, rq_dest); | |
6175 | local_irq_restore(flags); | |
6176 | } | |
6177 | ||
6178 | /* Run through task list and migrate tasks from the dead cpu. */ | |
6179 | static void migrate_live_tasks(int src_cpu) | |
6180 | { | |
48f24c4d | 6181 | struct task_struct *p, *t; |
1da177e4 | 6182 | |
f7b4cddc | 6183 | read_lock(&tasklist_lock); |
1da177e4 | 6184 | |
48f24c4d IM |
6185 | do_each_thread(t, p) { |
6186 | if (p == current) | |
1da177e4 LT |
6187 | continue; |
6188 | ||
48f24c4d IM |
6189 | if (task_cpu(p) == src_cpu) |
6190 | move_task_off_dead_cpu(src_cpu, p); | |
6191 | } while_each_thread(t, p); | |
1da177e4 | 6192 | |
f7b4cddc | 6193 | read_unlock(&tasklist_lock); |
1da177e4 LT |
6194 | } |
6195 | ||
dd41f596 IM |
6196 | /* |
6197 | * Schedules idle task to be the next runnable task on current CPU. | |
94bc9a7b DA |
6198 | * It does so by boosting its priority to highest possible. |
6199 | * Used by CPU offline code. | |
1da177e4 LT |
6200 | */ |
6201 | void sched_idle_next(void) | |
6202 | { | |
48f24c4d | 6203 | int this_cpu = smp_processor_id(); |
70b97a7f | 6204 | struct rq *rq = cpu_rq(this_cpu); |
1da177e4 LT |
6205 | struct task_struct *p = rq->idle; |
6206 | unsigned long flags; | |
6207 | ||
6208 | /* cpu has to be offline */ | |
48f24c4d | 6209 | BUG_ON(cpu_online(this_cpu)); |
1da177e4 | 6210 | |
48f24c4d IM |
6211 | /* |
6212 | * Strictly not necessary since rest of the CPUs are stopped by now | |
6213 | * and interrupts disabled on the current cpu. | |
1da177e4 LT |
6214 | */ |
6215 | spin_lock_irqsave(&rq->lock, flags); | |
6216 | ||
dd41f596 | 6217 | __setscheduler(rq, p, SCHED_FIFO, MAX_RT_PRIO-1); |
48f24c4d | 6218 | |
94bc9a7b DA |
6219 | update_rq_clock(rq); |
6220 | activate_task(rq, p, 0); | |
1da177e4 LT |
6221 | |
6222 | spin_unlock_irqrestore(&rq->lock, flags); | |
6223 | } | |
6224 | ||
48f24c4d IM |
6225 | /* |
6226 | * Ensures that the idle task is using init_mm right before its cpu goes | |
1da177e4 LT |
6227 | * offline. |
6228 | */ | |
6229 | void idle_task_exit(void) | |
6230 | { | |
6231 | struct mm_struct *mm = current->active_mm; | |
6232 | ||
6233 | BUG_ON(cpu_online(smp_processor_id())); | |
6234 | ||
6235 | if (mm != &init_mm) | |
6236 | switch_mm(mm, &init_mm, current); | |
6237 | mmdrop(mm); | |
6238 | } | |
6239 | ||
054b9108 | 6240 | /* called under rq->lock with disabled interrupts */ |
36c8b586 | 6241 | static void migrate_dead(unsigned int dead_cpu, struct task_struct *p) |
1da177e4 | 6242 | { |
70b97a7f | 6243 | struct rq *rq = cpu_rq(dead_cpu); |
1da177e4 LT |
6244 | |
6245 | /* Must be exiting, otherwise would be on tasklist. */ | |
270f722d | 6246 | BUG_ON(!p->exit_state); |
1da177e4 LT |
6247 | |
6248 | /* Cannot have done final schedule yet: would have vanished. */ | |
c394cc9f | 6249 | BUG_ON(p->state == TASK_DEAD); |
1da177e4 | 6250 | |
48f24c4d | 6251 | get_task_struct(p); |
1da177e4 LT |
6252 | |
6253 | /* | |
6254 | * Drop lock around migration; if someone else moves it, | |
41a2d6cf | 6255 | * that's OK. No task can be added to this CPU, so iteration is |
1da177e4 LT |
6256 | * fine. |
6257 | */ | |
f7b4cddc | 6258 | spin_unlock_irq(&rq->lock); |
48f24c4d | 6259 | move_task_off_dead_cpu(dead_cpu, p); |
f7b4cddc | 6260 | spin_lock_irq(&rq->lock); |
1da177e4 | 6261 | |
48f24c4d | 6262 | put_task_struct(p); |
1da177e4 LT |
6263 | } |
6264 | ||
6265 | /* release_task() removes task from tasklist, so we won't find dead tasks. */ | |
6266 | static void migrate_dead_tasks(unsigned int dead_cpu) | |
6267 | { | |
70b97a7f | 6268 | struct rq *rq = cpu_rq(dead_cpu); |
dd41f596 | 6269 | struct task_struct *next; |
48f24c4d | 6270 | |
dd41f596 IM |
6271 | for ( ; ; ) { |
6272 | if (!rq->nr_running) | |
6273 | break; | |
a8e504d2 | 6274 | update_rq_clock(rq); |
ff95f3df | 6275 | next = pick_next_task(rq, rq->curr); |
dd41f596 IM |
6276 | if (!next) |
6277 | break; | |
79c53799 | 6278 | next->sched_class->put_prev_task(rq, next); |
dd41f596 | 6279 | migrate_dead(dead_cpu, next); |
e692ab53 | 6280 | |
1da177e4 LT |
6281 | } |
6282 | } | |
6283 | #endif /* CONFIG_HOTPLUG_CPU */ | |
6284 | ||
e692ab53 NP |
6285 | #if defined(CONFIG_SCHED_DEBUG) && defined(CONFIG_SYSCTL) |
6286 | ||
6287 | static struct ctl_table sd_ctl_dir[] = { | |
e0361851 AD |
6288 | { |
6289 | .procname = "sched_domain", | |
c57baf1e | 6290 | .mode = 0555, |
e0361851 | 6291 | }, |
38605cae | 6292 | {0, }, |
e692ab53 NP |
6293 | }; |
6294 | ||
6295 | static struct ctl_table sd_ctl_root[] = { | |
e0361851 | 6296 | { |
c57baf1e | 6297 | .ctl_name = CTL_KERN, |
e0361851 | 6298 | .procname = "kernel", |
c57baf1e | 6299 | .mode = 0555, |
e0361851 AD |
6300 | .child = sd_ctl_dir, |
6301 | }, | |
38605cae | 6302 | {0, }, |
e692ab53 NP |
6303 | }; |
6304 | ||
6305 | static struct ctl_table *sd_alloc_ctl_entry(int n) | |
6306 | { | |
6307 | struct ctl_table *entry = | |
5cf9f062 | 6308 | kcalloc(n, sizeof(struct ctl_table), GFP_KERNEL); |
e692ab53 | 6309 | |
e692ab53 NP |
6310 | return entry; |
6311 | } | |
6312 | ||
6382bc90 MM |
6313 | static void sd_free_ctl_entry(struct ctl_table **tablep) |
6314 | { | |
cd790076 | 6315 | struct ctl_table *entry; |
6382bc90 | 6316 | |
cd790076 MM |
6317 | /* |
6318 | * In the intermediate directories, both the child directory and | |
6319 | * procname are dynamically allocated and could fail but the mode | |
41a2d6cf | 6320 | * will always be set. In the lowest directory the names are |
cd790076 MM |
6321 | * static strings and all have proc handlers. |
6322 | */ | |
6323 | for (entry = *tablep; entry->mode; entry++) { | |
6382bc90 MM |
6324 | if (entry->child) |
6325 | sd_free_ctl_entry(&entry->child); | |
cd790076 MM |
6326 | if (entry->proc_handler == NULL) |
6327 | kfree(entry->procname); | |
6328 | } | |
6382bc90 MM |
6329 | |
6330 | kfree(*tablep); | |
6331 | *tablep = NULL; | |
6332 | } | |
6333 | ||
e692ab53 | 6334 | static void |
e0361851 | 6335 | set_table_entry(struct ctl_table *entry, |
e692ab53 NP |
6336 | const char *procname, void *data, int maxlen, |
6337 | mode_t mode, proc_handler *proc_handler) | |
6338 | { | |
e692ab53 NP |
6339 | entry->procname = procname; |
6340 | entry->data = data; | |
6341 | entry->maxlen = maxlen; | |
6342 | entry->mode = mode; | |
6343 | entry->proc_handler = proc_handler; | |
6344 | } | |
6345 | ||
6346 | static struct ctl_table * | |
6347 | sd_alloc_ctl_domain_table(struct sched_domain *sd) | |
6348 | { | |
a5d8c348 | 6349 | struct ctl_table *table = sd_alloc_ctl_entry(13); |
e692ab53 | 6350 | |
ad1cdc1d MM |
6351 | if (table == NULL) |
6352 | return NULL; | |
6353 | ||
e0361851 | 6354 | set_table_entry(&table[0], "min_interval", &sd->min_interval, |
e692ab53 | 6355 | sizeof(long), 0644, proc_doulongvec_minmax); |
e0361851 | 6356 | set_table_entry(&table[1], "max_interval", &sd->max_interval, |
e692ab53 | 6357 | sizeof(long), 0644, proc_doulongvec_minmax); |
e0361851 | 6358 | set_table_entry(&table[2], "busy_idx", &sd->busy_idx, |
e692ab53 | 6359 | sizeof(int), 0644, proc_dointvec_minmax); |
e0361851 | 6360 | set_table_entry(&table[3], "idle_idx", &sd->idle_idx, |
e692ab53 | 6361 | sizeof(int), 0644, proc_dointvec_minmax); |
e0361851 | 6362 | set_table_entry(&table[4], "newidle_idx", &sd->newidle_idx, |
e692ab53 | 6363 | sizeof(int), 0644, proc_dointvec_minmax); |
e0361851 | 6364 | set_table_entry(&table[5], "wake_idx", &sd->wake_idx, |
e692ab53 | 6365 | sizeof(int), 0644, proc_dointvec_minmax); |
e0361851 | 6366 | set_table_entry(&table[6], "forkexec_idx", &sd->forkexec_idx, |
e692ab53 | 6367 | sizeof(int), 0644, proc_dointvec_minmax); |
e0361851 | 6368 | set_table_entry(&table[7], "busy_factor", &sd->busy_factor, |
e692ab53 | 6369 | sizeof(int), 0644, proc_dointvec_minmax); |
e0361851 | 6370 | set_table_entry(&table[8], "imbalance_pct", &sd->imbalance_pct, |
e692ab53 | 6371 | sizeof(int), 0644, proc_dointvec_minmax); |
ace8b3d6 | 6372 | set_table_entry(&table[9], "cache_nice_tries", |
e692ab53 NP |
6373 | &sd->cache_nice_tries, |
6374 | sizeof(int), 0644, proc_dointvec_minmax); | |
ace8b3d6 | 6375 | set_table_entry(&table[10], "flags", &sd->flags, |
e692ab53 | 6376 | sizeof(int), 0644, proc_dointvec_minmax); |
a5d8c348 IM |
6377 | set_table_entry(&table[11], "name", sd->name, |
6378 | CORENAME_MAX_SIZE, 0444, proc_dostring); | |
6379 | /* &table[12] is terminator */ | |
e692ab53 NP |
6380 | |
6381 | return table; | |
6382 | } | |
6383 | ||
9a4e7159 | 6384 | static ctl_table *sd_alloc_ctl_cpu_table(int cpu) |
e692ab53 NP |
6385 | { |
6386 | struct ctl_table *entry, *table; | |
6387 | struct sched_domain *sd; | |
6388 | int domain_num = 0, i; | |
6389 | char buf[32]; | |
6390 | ||
6391 | for_each_domain(cpu, sd) | |
6392 | domain_num++; | |
6393 | entry = table = sd_alloc_ctl_entry(domain_num + 1); | |
ad1cdc1d MM |
6394 | if (table == NULL) |
6395 | return NULL; | |
e692ab53 NP |
6396 | |
6397 | i = 0; | |
6398 | for_each_domain(cpu, sd) { | |
6399 | snprintf(buf, 32, "domain%d", i); | |
e692ab53 | 6400 | entry->procname = kstrdup(buf, GFP_KERNEL); |
c57baf1e | 6401 | entry->mode = 0555; |
e692ab53 NP |
6402 | entry->child = sd_alloc_ctl_domain_table(sd); |
6403 | entry++; | |
6404 | i++; | |
6405 | } | |
6406 | return table; | |
6407 | } | |
6408 | ||
6409 | static struct ctl_table_header *sd_sysctl_header; | |
6382bc90 | 6410 | static void register_sched_domain_sysctl(void) |
e692ab53 NP |
6411 | { |
6412 | int i, cpu_num = num_online_cpus(); | |
6413 | struct ctl_table *entry = sd_alloc_ctl_entry(cpu_num + 1); | |
6414 | char buf[32]; | |
6415 | ||
7378547f MM |
6416 | WARN_ON(sd_ctl_dir[0].child); |
6417 | sd_ctl_dir[0].child = entry; | |
6418 | ||
ad1cdc1d MM |
6419 | if (entry == NULL) |
6420 | return; | |
6421 | ||
97b6ea7b | 6422 | for_each_online_cpu(i) { |
e692ab53 | 6423 | snprintf(buf, 32, "cpu%d", i); |
e692ab53 | 6424 | entry->procname = kstrdup(buf, GFP_KERNEL); |
c57baf1e | 6425 | entry->mode = 0555; |
e692ab53 | 6426 | entry->child = sd_alloc_ctl_cpu_table(i); |
97b6ea7b | 6427 | entry++; |
e692ab53 | 6428 | } |
7378547f MM |
6429 | |
6430 | WARN_ON(sd_sysctl_header); | |
e692ab53 NP |
6431 | sd_sysctl_header = register_sysctl_table(sd_ctl_root); |
6432 | } | |
6382bc90 | 6433 | |
7378547f | 6434 | /* may be called multiple times per register */ |
6382bc90 MM |
6435 | static void unregister_sched_domain_sysctl(void) |
6436 | { | |
7378547f MM |
6437 | if (sd_sysctl_header) |
6438 | unregister_sysctl_table(sd_sysctl_header); | |
6382bc90 | 6439 | sd_sysctl_header = NULL; |
7378547f MM |
6440 | if (sd_ctl_dir[0].child) |
6441 | sd_free_ctl_entry(&sd_ctl_dir[0].child); | |
6382bc90 | 6442 | } |
e692ab53 | 6443 | #else |
6382bc90 MM |
6444 | static void register_sched_domain_sysctl(void) |
6445 | { | |
6446 | } | |
6447 | static void unregister_sched_domain_sysctl(void) | |
e692ab53 NP |
6448 | { |
6449 | } | |
6450 | #endif | |
6451 | ||
1f11eb6a GH |
6452 | static void set_rq_online(struct rq *rq) |
6453 | { | |
6454 | if (!rq->online) { | |
6455 | const struct sched_class *class; | |
6456 | ||
6457 | cpu_set(rq->cpu, rq->rd->online); | |
6458 | rq->online = 1; | |
6459 | ||
6460 | for_each_class(class) { | |
6461 | if (class->rq_online) | |
6462 | class->rq_online(rq); | |
6463 | } | |
6464 | } | |
6465 | } | |
6466 | ||
6467 | static void set_rq_offline(struct rq *rq) | |
6468 | { | |
6469 | if (rq->online) { | |
6470 | const struct sched_class *class; | |
6471 | ||
6472 | for_each_class(class) { | |
6473 | if (class->rq_offline) | |
6474 | class->rq_offline(rq); | |
6475 | } | |
6476 | ||
6477 | cpu_clear(rq->cpu, rq->rd->online); | |
6478 | rq->online = 0; | |
6479 | } | |
6480 | } | |
6481 | ||
1da177e4 LT |
6482 | /* |
6483 | * migration_call - callback that gets triggered when a CPU is added. | |
6484 | * Here we can start up the necessary migration thread for the new CPU. | |
6485 | */ | |
48f24c4d IM |
6486 | static int __cpuinit |
6487 | migration_call(struct notifier_block *nfb, unsigned long action, void *hcpu) | |
1da177e4 | 6488 | { |
1da177e4 | 6489 | struct task_struct *p; |
48f24c4d | 6490 | int cpu = (long)hcpu; |
1da177e4 | 6491 | unsigned long flags; |
70b97a7f | 6492 | struct rq *rq; |
1da177e4 LT |
6493 | |
6494 | switch (action) { | |
5be9361c | 6495 | |
1da177e4 | 6496 | case CPU_UP_PREPARE: |
8bb78442 | 6497 | case CPU_UP_PREPARE_FROZEN: |
dd41f596 | 6498 | p = kthread_create(migration_thread, hcpu, "migration/%d", cpu); |
1da177e4 LT |
6499 | if (IS_ERR(p)) |
6500 | return NOTIFY_BAD; | |
1da177e4 LT |
6501 | kthread_bind(p, cpu); |
6502 | /* Must be high prio: stop_machine expects to yield to it. */ | |
6503 | rq = task_rq_lock(p, &flags); | |
dd41f596 | 6504 | __setscheduler(rq, p, SCHED_FIFO, MAX_RT_PRIO-1); |
1da177e4 LT |
6505 | task_rq_unlock(rq, &flags); |
6506 | cpu_rq(cpu)->migration_thread = p; | |
6507 | break; | |
48f24c4d | 6508 | |
1da177e4 | 6509 | case CPU_ONLINE: |
8bb78442 | 6510 | case CPU_ONLINE_FROZEN: |
3a4fa0a2 | 6511 | /* Strictly unnecessary, as first user will wake it. */ |
1da177e4 | 6512 | wake_up_process(cpu_rq(cpu)->migration_thread); |
1f94ef59 GH |
6513 | |
6514 | /* Update our root-domain */ | |
6515 | rq = cpu_rq(cpu); | |
6516 | spin_lock_irqsave(&rq->lock, flags); | |
6517 | if (rq->rd) { | |
6518 | BUG_ON(!cpu_isset(cpu, rq->rd->span)); | |
1f11eb6a GH |
6519 | |
6520 | set_rq_online(rq); | |
1f94ef59 GH |
6521 | } |
6522 | spin_unlock_irqrestore(&rq->lock, flags); | |
1da177e4 | 6523 | break; |
48f24c4d | 6524 | |
1da177e4 LT |
6525 | #ifdef CONFIG_HOTPLUG_CPU |
6526 | case CPU_UP_CANCELED: | |
8bb78442 | 6527 | case CPU_UP_CANCELED_FROZEN: |
fc75cdfa HC |
6528 | if (!cpu_rq(cpu)->migration_thread) |
6529 | break; | |
41a2d6cf | 6530 | /* Unbind it from offline cpu so it can run. Fall thru. */ |
a4c4af7c HC |
6531 | kthread_bind(cpu_rq(cpu)->migration_thread, |
6532 | any_online_cpu(cpu_online_map)); | |
1da177e4 LT |
6533 | kthread_stop(cpu_rq(cpu)->migration_thread); |
6534 | cpu_rq(cpu)->migration_thread = NULL; | |
6535 | break; | |
48f24c4d | 6536 | |
1da177e4 | 6537 | case CPU_DEAD: |
8bb78442 | 6538 | case CPU_DEAD_FROZEN: |
470fd646 | 6539 | cpuset_lock(); /* around calls to cpuset_cpus_allowed_lock() */ |
1da177e4 LT |
6540 | migrate_live_tasks(cpu); |
6541 | rq = cpu_rq(cpu); | |
6542 | kthread_stop(rq->migration_thread); | |
6543 | rq->migration_thread = NULL; | |
6544 | /* Idle task back to normal (off runqueue, low prio) */ | |
d2da272a | 6545 | spin_lock_irq(&rq->lock); |
a8e504d2 | 6546 | update_rq_clock(rq); |
2e1cb74a | 6547 | deactivate_task(rq, rq->idle, 0); |
1da177e4 | 6548 | rq->idle->static_prio = MAX_PRIO; |
dd41f596 IM |
6549 | __setscheduler(rq, rq->idle, SCHED_NORMAL, 0); |
6550 | rq->idle->sched_class = &idle_sched_class; | |
1da177e4 | 6551 | migrate_dead_tasks(cpu); |
d2da272a | 6552 | spin_unlock_irq(&rq->lock); |
470fd646 | 6553 | cpuset_unlock(); |
1da177e4 LT |
6554 | migrate_nr_uninterruptible(rq); |
6555 | BUG_ON(rq->nr_running != 0); | |
6556 | ||
41a2d6cf IM |
6557 | /* |
6558 | * No need to migrate the tasks: it was best-effort if | |
6559 | * they didn't take sched_hotcpu_mutex. Just wake up | |
6560 | * the requestors. | |
6561 | */ | |
1da177e4 LT |
6562 | spin_lock_irq(&rq->lock); |
6563 | while (!list_empty(&rq->migration_queue)) { | |
70b97a7f IM |
6564 | struct migration_req *req; |
6565 | ||
1da177e4 | 6566 | req = list_entry(rq->migration_queue.next, |
70b97a7f | 6567 | struct migration_req, list); |
1da177e4 LT |
6568 | list_del_init(&req->list); |
6569 | complete(&req->done); | |
6570 | } | |
6571 | spin_unlock_irq(&rq->lock); | |
6572 | break; | |
57d885fe | 6573 | |
08f503b0 GH |
6574 | case CPU_DYING: |
6575 | case CPU_DYING_FROZEN: | |
57d885fe GH |
6576 | /* Update our root-domain */ |
6577 | rq = cpu_rq(cpu); | |
6578 | spin_lock_irqsave(&rq->lock, flags); | |
6579 | if (rq->rd) { | |
6580 | BUG_ON(!cpu_isset(cpu, rq->rd->span)); | |
1f11eb6a | 6581 | set_rq_offline(rq); |
57d885fe GH |
6582 | } |
6583 | spin_unlock_irqrestore(&rq->lock, flags); | |
6584 | break; | |
1da177e4 LT |
6585 | #endif |
6586 | } | |
6587 | return NOTIFY_OK; | |
6588 | } | |
6589 | ||
6590 | /* Register at highest priority so that task migration (migrate_all_tasks) | |
6591 | * happens before everything else. | |
6592 | */ | |
26c2143b | 6593 | static struct notifier_block __cpuinitdata migration_notifier = { |
1da177e4 LT |
6594 | .notifier_call = migration_call, |
6595 | .priority = 10 | |
6596 | }; | |
6597 | ||
7babe8db | 6598 | static int __init migration_init(void) |
1da177e4 LT |
6599 | { |
6600 | void *cpu = (void *)(long)smp_processor_id(); | |
07dccf33 | 6601 | int err; |
48f24c4d IM |
6602 | |
6603 | /* Start one for the boot CPU: */ | |
07dccf33 AM |
6604 | err = migration_call(&migration_notifier, CPU_UP_PREPARE, cpu); |
6605 | BUG_ON(err == NOTIFY_BAD); | |
1da177e4 LT |
6606 | migration_call(&migration_notifier, CPU_ONLINE, cpu); |
6607 | register_cpu_notifier(&migration_notifier); | |
7babe8db EGM |
6608 | |
6609 | return err; | |
1da177e4 | 6610 | } |
7babe8db | 6611 | early_initcall(migration_init); |
1da177e4 LT |
6612 | #endif |
6613 | ||
6614 | #ifdef CONFIG_SMP | |
476f3534 | 6615 | |
3e9830dc | 6616 | #ifdef CONFIG_SCHED_DEBUG |
4dcf6aff | 6617 | |
7c16ec58 MT |
6618 | static int sched_domain_debug_one(struct sched_domain *sd, int cpu, int level, |
6619 | cpumask_t *groupmask) | |
1da177e4 | 6620 | { |
4dcf6aff | 6621 | struct sched_group *group = sd->groups; |
434d53b0 | 6622 | char str[256]; |
1da177e4 | 6623 | |
434d53b0 | 6624 | cpulist_scnprintf(str, sizeof(str), sd->span); |
7c16ec58 | 6625 | cpus_clear(*groupmask); |
4dcf6aff IM |
6626 | |
6627 | printk(KERN_DEBUG "%*s domain %d: ", level, "", level); | |
6628 | ||
6629 | if (!(sd->flags & SD_LOAD_BALANCE)) { | |
6630 | printk("does not load-balance\n"); | |
6631 | if (sd->parent) | |
6632 | printk(KERN_ERR "ERROR: !SD_LOAD_BALANCE domain" | |
6633 | " has parent"); | |
6634 | return -1; | |
41c7ce9a NP |
6635 | } |
6636 | ||
eefd796a | 6637 | printk(KERN_CONT "span %s level %s\n", str, sd->name); |
4dcf6aff IM |
6638 | |
6639 | if (!cpu_isset(cpu, sd->span)) { | |
6640 | printk(KERN_ERR "ERROR: domain->span does not contain " | |
6641 | "CPU%d\n", cpu); | |
6642 | } | |
6643 | if (!cpu_isset(cpu, group->cpumask)) { | |
6644 | printk(KERN_ERR "ERROR: domain->groups does not contain" | |
6645 | " CPU%d\n", cpu); | |
6646 | } | |
1da177e4 | 6647 | |
4dcf6aff | 6648 | printk(KERN_DEBUG "%*s groups:", level + 1, ""); |
1da177e4 | 6649 | do { |
4dcf6aff IM |
6650 | if (!group) { |
6651 | printk("\n"); | |
6652 | printk(KERN_ERR "ERROR: group is NULL\n"); | |
1da177e4 LT |
6653 | break; |
6654 | } | |
6655 | ||
4dcf6aff IM |
6656 | if (!group->__cpu_power) { |
6657 | printk(KERN_CONT "\n"); | |
6658 | printk(KERN_ERR "ERROR: domain->cpu_power not " | |
6659 | "set\n"); | |
6660 | break; | |
6661 | } | |
1da177e4 | 6662 | |
4dcf6aff IM |
6663 | if (!cpus_weight(group->cpumask)) { |
6664 | printk(KERN_CONT "\n"); | |
6665 | printk(KERN_ERR "ERROR: empty group\n"); | |
6666 | break; | |
6667 | } | |
1da177e4 | 6668 | |
7c16ec58 | 6669 | if (cpus_intersects(*groupmask, group->cpumask)) { |
4dcf6aff IM |
6670 | printk(KERN_CONT "\n"); |
6671 | printk(KERN_ERR "ERROR: repeated CPUs\n"); | |
6672 | break; | |
6673 | } | |
1da177e4 | 6674 | |
7c16ec58 | 6675 | cpus_or(*groupmask, *groupmask, group->cpumask); |
1da177e4 | 6676 | |
434d53b0 | 6677 | cpulist_scnprintf(str, sizeof(str), group->cpumask); |
4dcf6aff | 6678 | printk(KERN_CONT " %s", str); |
1da177e4 | 6679 | |
4dcf6aff IM |
6680 | group = group->next; |
6681 | } while (group != sd->groups); | |
6682 | printk(KERN_CONT "\n"); | |
1da177e4 | 6683 | |
7c16ec58 | 6684 | if (!cpus_equal(sd->span, *groupmask)) |
4dcf6aff | 6685 | printk(KERN_ERR "ERROR: groups don't span domain->span\n"); |
1da177e4 | 6686 | |
7c16ec58 | 6687 | if (sd->parent && !cpus_subset(*groupmask, sd->parent->span)) |
4dcf6aff IM |
6688 | printk(KERN_ERR "ERROR: parent span is not a superset " |
6689 | "of domain->span\n"); | |
6690 | return 0; | |
6691 | } | |
1da177e4 | 6692 | |
4dcf6aff IM |
6693 | static void sched_domain_debug(struct sched_domain *sd, int cpu) |
6694 | { | |
7c16ec58 | 6695 | cpumask_t *groupmask; |
4dcf6aff | 6696 | int level = 0; |
1da177e4 | 6697 | |
4dcf6aff IM |
6698 | if (!sd) { |
6699 | printk(KERN_DEBUG "CPU%d attaching NULL sched-domain.\n", cpu); | |
6700 | return; | |
6701 | } | |
1da177e4 | 6702 | |
4dcf6aff IM |
6703 | printk(KERN_DEBUG "CPU%d attaching sched-domain:\n", cpu); |
6704 | ||
7c16ec58 MT |
6705 | groupmask = kmalloc(sizeof(cpumask_t), GFP_KERNEL); |
6706 | if (!groupmask) { | |
6707 | printk(KERN_DEBUG "Cannot load-balance (out of memory)\n"); | |
6708 | return; | |
6709 | } | |
6710 | ||
4dcf6aff | 6711 | for (;;) { |
7c16ec58 | 6712 | if (sched_domain_debug_one(sd, cpu, level, groupmask)) |
4dcf6aff | 6713 | break; |
1da177e4 LT |
6714 | level++; |
6715 | sd = sd->parent; | |
33859f7f | 6716 | if (!sd) |
4dcf6aff IM |
6717 | break; |
6718 | } | |
7c16ec58 | 6719 | kfree(groupmask); |
1da177e4 | 6720 | } |
6d6bc0ad | 6721 | #else /* !CONFIG_SCHED_DEBUG */ |
48f24c4d | 6722 | # define sched_domain_debug(sd, cpu) do { } while (0) |
6d6bc0ad | 6723 | #endif /* CONFIG_SCHED_DEBUG */ |
1da177e4 | 6724 | |
1a20ff27 | 6725 | static int sd_degenerate(struct sched_domain *sd) |
245af2c7 SS |
6726 | { |
6727 | if (cpus_weight(sd->span) == 1) | |
6728 | return 1; | |
6729 | ||
6730 | /* Following flags need at least 2 groups */ | |
6731 | if (sd->flags & (SD_LOAD_BALANCE | | |
6732 | SD_BALANCE_NEWIDLE | | |
6733 | SD_BALANCE_FORK | | |
89c4710e SS |
6734 | SD_BALANCE_EXEC | |
6735 | SD_SHARE_CPUPOWER | | |
6736 | SD_SHARE_PKG_RESOURCES)) { | |
245af2c7 SS |
6737 | if (sd->groups != sd->groups->next) |
6738 | return 0; | |
6739 | } | |
6740 | ||
6741 | /* Following flags don't use groups */ | |
6742 | if (sd->flags & (SD_WAKE_IDLE | | |
6743 | SD_WAKE_AFFINE | | |
6744 | SD_WAKE_BALANCE)) | |
6745 | return 0; | |
6746 | ||
6747 | return 1; | |
6748 | } | |
6749 | ||
48f24c4d IM |
6750 | static int |
6751 | sd_parent_degenerate(struct sched_domain *sd, struct sched_domain *parent) | |
245af2c7 SS |
6752 | { |
6753 | unsigned long cflags = sd->flags, pflags = parent->flags; | |
6754 | ||
6755 | if (sd_degenerate(parent)) | |
6756 | return 1; | |
6757 | ||
6758 | if (!cpus_equal(sd->span, parent->span)) | |
6759 | return 0; | |
6760 | ||
6761 | /* Does parent contain flags not in child? */ | |
6762 | /* WAKE_BALANCE is a subset of WAKE_AFFINE */ | |
6763 | if (cflags & SD_WAKE_AFFINE) | |
6764 | pflags &= ~SD_WAKE_BALANCE; | |
6765 | /* Flags needing groups don't count if only 1 group in parent */ | |
6766 | if (parent->groups == parent->groups->next) { | |
6767 | pflags &= ~(SD_LOAD_BALANCE | | |
6768 | SD_BALANCE_NEWIDLE | | |
6769 | SD_BALANCE_FORK | | |
89c4710e SS |
6770 | SD_BALANCE_EXEC | |
6771 | SD_SHARE_CPUPOWER | | |
6772 | SD_SHARE_PKG_RESOURCES); | |
245af2c7 SS |
6773 | } |
6774 | if (~cflags & pflags) | |
6775 | return 0; | |
6776 | ||
6777 | return 1; | |
6778 | } | |
6779 | ||
57d885fe GH |
6780 | static void rq_attach_root(struct rq *rq, struct root_domain *rd) |
6781 | { | |
6782 | unsigned long flags; | |
57d885fe GH |
6783 | |
6784 | spin_lock_irqsave(&rq->lock, flags); | |
6785 | ||
6786 | if (rq->rd) { | |
6787 | struct root_domain *old_rd = rq->rd; | |
6788 | ||
1f11eb6a GH |
6789 | if (cpu_isset(rq->cpu, old_rd->online)) |
6790 | set_rq_offline(rq); | |
57d885fe | 6791 | |
dc938520 | 6792 | cpu_clear(rq->cpu, old_rd->span); |
dc938520 | 6793 | |
57d885fe GH |
6794 | if (atomic_dec_and_test(&old_rd->refcount)) |
6795 | kfree(old_rd); | |
6796 | } | |
6797 | ||
6798 | atomic_inc(&rd->refcount); | |
6799 | rq->rd = rd; | |
6800 | ||
dc938520 | 6801 | cpu_set(rq->cpu, rd->span); |
1f94ef59 | 6802 | if (cpu_isset(rq->cpu, cpu_online_map)) |
1f11eb6a | 6803 | set_rq_online(rq); |
57d885fe GH |
6804 | |
6805 | spin_unlock_irqrestore(&rq->lock, flags); | |
6806 | } | |
6807 | ||
dc938520 | 6808 | static void init_rootdomain(struct root_domain *rd) |
57d885fe GH |
6809 | { |
6810 | memset(rd, 0, sizeof(*rd)); | |
6811 | ||
dc938520 GH |
6812 | cpus_clear(rd->span); |
6813 | cpus_clear(rd->online); | |
6e0534f2 GH |
6814 | |
6815 | cpupri_init(&rd->cpupri); | |
57d885fe GH |
6816 | } |
6817 | ||
6818 | static void init_defrootdomain(void) | |
6819 | { | |
dc938520 | 6820 | init_rootdomain(&def_root_domain); |
57d885fe GH |
6821 | atomic_set(&def_root_domain.refcount, 1); |
6822 | } | |
6823 | ||
dc938520 | 6824 | static struct root_domain *alloc_rootdomain(void) |
57d885fe GH |
6825 | { |
6826 | struct root_domain *rd; | |
6827 | ||
6828 | rd = kmalloc(sizeof(*rd), GFP_KERNEL); | |
6829 | if (!rd) | |
6830 | return NULL; | |
6831 | ||
dc938520 | 6832 | init_rootdomain(rd); |
57d885fe GH |
6833 | |
6834 | return rd; | |
6835 | } | |
6836 | ||
1da177e4 | 6837 | /* |
0eab9146 | 6838 | * Attach the domain 'sd' to 'cpu' as its base domain. Callers must |
1da177e4 LT |
6839 | * hold the hotplug lock. |
6840 | */ | |
0eab9146 IM |
6841 | static void |
6842 | cpu_attach_domain(struct sched_domain *sd, struct root_domain *rd, int cpu) | |
1da177e4 | 6843 | { |
70b97a7f | 6844 | struct rq *rq = cpu_rq(cpu); |
245af2c7 SS |
6845 | struct sched_domain *tmp; |
6846 | ||
6847 | /* Remove the sched domains which do not contribute to scheduling. */ | |
f29c9b1c | 6848 | for (tmp = sd; tmp; ) { |
245af2c7 SS |
6849 | struct sched_domain *parent = tmp->parent; |
6850 | if (!parent) | |
6851 | break; | |
f29c9b1c | 6852 | |
1a848870 | 6853 | if (sd_parent_degenerate(tmp, parent)) { |
245af2c7 | 6854 | tmp->parent = parent->parent; |
1a848870 SS |
6855 | if (parent->parent) |
6856 | parent->parent->child = tmp; | |
f29c9b1c LZ |
6857 | } else |
6858 | tmp = tmp->parent; | |
245af2c7 SS |
6859 | } |
6860 | ||
1a848870 | 6861 | if (sd && sd_degenerate(sd)) { |
245af2c7 | 6862 | sd = sd->parent; |
1a848870 SS |
6863 | if (sd) |
6864 | sd->child = NULL; | |
6865 | } | |
1da177e4 LT |
6866 | |
6867 | sched_domain_debug(sd, cpu); | |
6868 | ||
57d885fe | 6869 | rq_attach_root(rq, rd); |
674311d5 | 6870 | rcu_assign_pointer(rq->sd, sd); |
1da177e4 LT |
6871 | } |
6872 | ||
6873 | /* cpus with isolated domains */ | |
67af63a6 | 6874 | static cpumask_t cpu_isolated_map = CPU_MASK_NONE; |
1da177e4 LT |
6875 | |
6876 | /* Setup the mask of cpus configured for isolated domains */ | |
6877 | static int __init isolated_cpu_setup(char *str) | |
6878 | { | |
13b40c1e MT |
6879 | static int __initdata ints[NR_CPUS]; |
6880 | int i; | |
1da177e4 LT |
6881 | |
6882 | str = get_options(str, ARRAY_SIZE(ints), ints); | |
6883 | cpus_clear(cpu_isolated_map); | |
6884 | for (i = 1; i <= ints[0]; i++) | |
6885 | if (ints[i] < NR_CPUS) | |
6886 | cpu_set(ints[i], cpu_isolated_map); | |
6887 | return 1; | |
6888 | } | |
6889 | ||
8927f494 | 6890 | __setup("isolcpus=", isolated_cpu_setup); |
1da177e4 LT |
6891 | |
6892 | /* | |
6711cab4 SS |
6893 | * init_sched_build_groups takes the cpumask we wish to span, and a pointer |
6894 | * to a function which identifies what group(along with sched group) a CPU | |
6895 | * belongs to. The return value of group_fn must be a >= 0 and < NR_CPUS | |
6896 | * (due to the fact that we keep track of groups covered with a cpumask_t). | |
1da177e4 LT |
6897 | * |
6898 | * init_sched_build_groups will build a circular linked list of the groups | |
6899 | * covered by the given span, and will set each group's ->cpumask correctly, | |
6900 | * and ->cpu_power to 0. | |
6901 | */ | |
a616058b | 6902 | static void |
7c16ec58 | 6903 | init_sched_build_groups(const cpumask_t *span, const cpumask_t *cpu_map, |
6711cab4 | 6904 | int (*group_fn)(int cpu, const cpumask_t *cpu_map, |
7c16ec58 MT |
6905 | struct sched_group **sg, |
6906 | cpumask_t *tmpmask), | |
6907 | cpumask_t *covered, cpumask_t *tmpmask) | |
1da177e4 LT |
6908 | { |
6909 | struct sched_group *first = NULL, *last = NULL; | |
1da177e4 LT |
6910 | int i; |
6911 | ||
7c16ec58 MT |
6912 | cpus_clear(*covered); |
6913 | ||
363ab6f1 | 6914 | for_each_cpu_mask_nr(i, *span) { |
6711cab4 | 6915 | struct sched_group *sg; |
7c16ec58 | 6916 | int group = group_fn(i, cpu_map, &sg, tmpmask); |
1da177e4 LT |
6917 | int j; |
6918 | ||
7c16ec58 | 6919 | if (cpu_isset(i, *covered)) |
1da177e4 LT |
6920 | continue; |
6921 | ||
7c16ec58 | 6922 | cpus_clear(sg->cpumask); |
5517d86b | 6923 | sg->__cpu_power = 0; |
1da177e4 | 6924 | |
363ab6f1 | 6925 | for_each_cpu_mask_nr(j, *span) { |
7c16ec58 | 6926 | if (group_fn(j, cpu_map, NULL, tmpmask) != group) |
1da177e4 LT |
6927 | continue; |
6928 | ||
7c16ec58 | 6929 | cpu_set(j, *covered); |
1da177e4 LT |
6930 | cpu_set(j, sg->cpumask); |
6931 | } | |
6932 | if (!first) | |
6933 | first = sg; | |
6934 | if (last) | |
6935 | last->next = sg; | |
6936 | last = sg; | |
6937 | } | |
6938 | last->next = first; | |
6939 | } | |
6940 | ||
9c1cfda2 | 6941 | #define SD_NODES_PER_DOMAIN 16 |
1da177e4 | 6942 | |
9c1cfda2 | 6943 | #ifdef CONFIG_NUMA |
198e2f18 | 6944 | |
9c1cfda2 JH |
6945 | /** |
6946 | * find_next_best_node - find the next node to include in a sched_domain | |
6947 | * @node: node whose sched_domain we're building | |
6948 | * @used_nodes: nodes already in the sched_domain | |
6949 | * | |
41a2d6cf | 6950 | * Find the next node to include in a given scheduling domain. Simply |
9c1cfda2 JH |
6951 | * finds the closest node not already in the @used_nodes map. |
6952 | * | |
6953 | * Should use nodemask_t. | |
6954 | */ | |
c5f59f08 | 6955 | static int find_next_best_node(int node, nodemask_t *used_nodes) |
9c1cfda2 JH |
6956 | { |
6957 | int i, n, val, min_val, best_node = 0; | |
6958 | ||
6959 | min_val = INT_MAX; | |
6960 | ||
076ac2af | 6961 | for (i = 0; i < nr_node_ids; i++) { |
9c1cfda2 | 6962 | /* Start at @node */ |
076ac2af | 6963 | n = (node + i) % nr_node_ids; |
9c1cfda2 JH |
6964 | |
6965 | if (!nr_cpus_node(n)) | |
6966 | continue; | |
6967 | ||
6968 | /* Skip already used nodes */ | |
c5f59f08 | 6969 | if (node_isset(n, *used_nodes)) |
9c1cfda2 JH |
6970 | continue; |
6971 | ||
6972 | /* Simple min distance search */ | |
6973 | val = node_distance(node, n); | |
6974 | ||
6975 | if (val < min_val) { | |
6976 | min_val = val; | |
6977 | best_node = n; | |
6978 | } | |
6979 | } | |
6980 | ||
c5f59f08 | 6981 | node_set(best_node, *used_nodes); |
9c1cfda2 JH |
6982 | return best_node; |
6983 | } | |
6984 | ||
6985 | /** | |
6986 | * sched_domain_node_span - get a cpumask for a node's sched_domain | |
6987 | * @node: node whose cpumask we're constructing | |
73486722 | 6988 | * @span: resulting cpumask |
9c1cfda2 | 6989 | * |
41a2d6cf | 6990 | * Given a node, construct a good cpumask for its sched_domain to span. It |
9c1cfda2 JH |
6991 | * should be one that prevents unnecessary balancing, but also spreads tasks |
6992 | * out optimally. | |
6993 | */ | |
4bdbaad3 | 6994 | static void sched_domain_node_span(int node, cpumask_t *span) |
9c1cfda2 | 6995 | { |
c5f59f08 | 6996 | nodemask_t used_nodes; |
c5f59f08 | 6997 | node_to_cpumask_ptr(nodemask, node); |
48f24c4d | 6998 | int i; |
9c1cfda2 | 6999 | |
4bdbaad3 | 7000 | cpus_clear(*span); |
c5f59f08 | 7001 | nodes_clear(used_nodes); |
9c1cfda2 | 7002 | |
4bdbaad3 | 7003 | cpus_or(*span, *span, *nodemask); |
c5f59f08 | 7004 | node_set(node, used_nodes); |
9c1cfda2 JH |
7005 | |
7006 | for (i = 1; i < SD_NODES_PER_DOMAIN; i++) { | |
c5f59f08 | 7007 | int next_node = find_next_best_node(node, &used_nodes); |
48f24c4d | 7008 | |
c5f59f08 | 7009 | node_to_cpumask_ptr_next(nodemask, next_node); |
4bdbaad3 | 7010 | cpus_or(*span, *span, *nodemask); |
9c1cfda2 | 7011 | } |
9c1cfda2 | 7012 | } |
6d6bc0ad | 7013 | #endif /* CONFIG_NUMA */ |
9c1cfda2 | 7014 | |
5c45bf27 | 7015 | int sched_smt_power_savings = 0, sched_mc_power_savings = 0; |
48f24c4d | 7016 | |
9c1cfda2 | 7017 | /* |
48f24c4d | 7018 | * SMT sched-domains: |
9c1cfda2 | 7019 | */ |
1da177e4 LT |
7020 | #ifdef CONFIG_SCHED_SMT |
7021 | static DEFINE_PER_CPU(struct sched_domain, cpu_domains); | |
6711cab4 | 7022 | static DEFINE_PER_CPU(struct sched_group, sched_group_cpus); |
48f24c4d | 7023 | |
41a2d6cf | 7024 | static int |
7c16ec58 MT |
7025 | cpu_to_cpu_group(int cpu, const cpumask_t *cpu_map, struct sched_group **sg, |
7026 | cpumask_t *unused) | |
1da177e4 | 7027 | { |
6711cab4 SS |
7028 | if (sg) |
7029 | *sg = &per_cpu(sched_group_cpus, cpu); | |
1da177e4 LT |
7030 | return cpu; |
7031 | } | |
6d6bc0ad | 7032 | #endif /* CONFIG_SCHED_SMT */ |
1da177e4 | 7033 | |
48f24c4d IM |
7034 | /* |
7035 | * multi-core sched-domains: | |
7036 | */ | |
1e9f28fa SS |
7037 | #ifdef CONFIG_SCHED_MC |
7038 | static DEFINE_PER_CPU(struct sched_domain, core_domains); | |
6711cab4 | 7039 | static DEFINE_PER_CPU(struct sched_group, sched_group_core); |
6d6bc0ad | 7040 | #endif /* CONFIG_SCHED_MC */ |
1e9f28fa SS |
7041 | |
7042 | #if defined(CONFIG_SCHED_MC) && defined(CONFIG_SCHED_SMT) | |
41a2d6cf | 7043 | static int |
7c16ec58 MT |
7044 | cpu_to_core_group(int cpu, const cpumask_t *cpu_map, struct sched_group **sg, |
7045 | cpumask_t *mask) | |
1e9f28fa | 7046 | { |
6711cab4 | 7047 | int group; |
7c16ec58 MT |
7048 | |
7049 | *mask = per_cpu(cpu_sibling_map, cpu); | |
7050 | cpus_and(*mask, *mask, *cpu_map); | |
7051 | group = first_cpu(*mask); | |
6711cab4 SS |
7052 | if (sg) |
7053 | *sg = &per_cpu(sched_group_core, group); | |
7054 | return group; | |
1e9f28fa SS |
7055 | } |
7056 | #elif defined(CONFIG_SCHED_MC) | |
41a2d6cf | 7057 | static int |
7c16ec58 MT |
7058 | cpu_to_core_group(int cpu, const cpumask_t *cpu_map, struct sched_group **sg, |
7059 | cpumask_t *unused) | |
1e9f28fa | 7060 | { |
6711cab4 SS |
7061 | if (sg) |
7062 | *sg = &per_cpu(sched_group_core, cpu); | |
1e9f28fa SS |
7063 | return cpu; |
7064 | } | |
7065 | #endif | |
7066 | ||
1da177e4 | 7067 | static DEFINE_PER_CPU(struct sched_domain, phys_domains); |
6711cab4 | 7068 | static DEFINE_PER_CPU(struct sched_group, sched_group_phys); |
48f24c4d | 7069 | |
41a2d6cf | 7070 | static int |
7c16ec58 MT |
7071 | cpu_to_phys_group(int cpu, const cpumask_t *cpu_map, struct sched_group **sg, |
7072 | cpumask_t *mask) | |
1da177e4 | 7073 | { |
6711cab4 | 7074 | int group; |
48f24c4d | 7075 | #ifdef CONFIG_SCHED_MC |
7c16ec58 MT |
7076 | *mask = cpu_coregroup_map(cpu); |
7077 | cpus_and(*mask, *mask, *cpu_map); | |
7078 | group = first_cpu(*mask); | |
1e9f28fa | 7079 | #elif defined(CONFIG_SCHED_SMT) |
7c16ec58 MT |
7080 | *mask = per_cpu(cpu_sibling_map, cpu); |
7081 | cpus_and(*mask, *mask, *cpu_map); | |
7082 | group = first_cpu(*mask); | |
1da177e4 | 7083 | #else |
6711cab4 | 7084 | group = cpu; |
1da177e4 | 7085 | #endif |
6711cab4 SS |
7086 | if (sg) |
7087 | *sg = &per_cpu(sched_group_phys, group); | |
7088 | return group; | |
1da177e4 LT |
7089 | } |
7090 | ||
7091 | #ifdef CONFIG_NUMA | |
1da177e4 | 7092 | /* |
9c1cfda2 JH |
7093 | * The init_sched_build_groups can't handle what we want to do with node |
7094 | * groups, so roll our own. Now each node has its own list of groups which | |
7095 | * gets dynamically allocated. | |
1da177e4 | 7096 | */ |
9c1cfda2 | 7097 | static DEFINE_PER_CPU(struct sched_domain, node_domains); |
434d53b0 | 7098 | static struct sched_group ***sched_group_nodes_bycpu; |
1da177e4 | 7099 | |
9c1cfda2 | 7100 | static DEFINE_PER_CPU(struct sched_domain, allnodes_domains); |
6711cab4 | 7101 | static DEFINE_PER_CPU(struct sched_group, sched_group_allnodes); |
9c1cfda2 | 7102 | |
6711cab4 | 7103 | static int cpu_to_allnodes_group(int cpu, const cpumask_t *cpu_map, |
7c16ec58 | 7104 | struct sched_group **sg, cpumask_t *nodemask) |
9c1cfda2 | 7105 | { |
6711cab4 SS |
7106 | int group; |
7107 | ||
7c16ec58 MT |
7108 | *nodemask = node_to_cpumask(cpu_to_node(cpu)); |
7109 | cpus_and(*nodemask, *nodemask, *cpu_map); | |
7110 | group = first_cpu(*nodemask); | |
6711cab4 SS |
7111 | |
7112 | if (sg) | |
7113 | *sg = &per_cpu(sched_group_allnodes, group); | |
7114 | return group; | |
1da177e4 | 7115 | } |
6711cab4 | 7116 | |
08069033 SS |
7117 | static void init_numa_sched_groups_power(struct sched_group *group_head) |
7118 | { | |
7119 | struct sched_group *sg = group_head; | |
7120 | int j; | |
7121 | ||
7122 | if (!sg) | |
7123 | return; | |
3a5c359a | 7124 | do { |
363ab6f1 | 7125 | for_each_cpu_mask_nr(j, sg->cpumask) { |
3a5c359a | 7126 | struct sched_domain *sd; |
08069033 | 7127 | |
3a5c359a AK |
7128 | sd = &per_cpu(phys_domains, j); |
7129 | if (j != first_cpu(sd->groups->cpumask)) { | |
7130 | /* | |
7131 | * Only add "power" once for each | |
7132 | * physical package. | |
7133 | */ | |
7134 | continue; | |
7135 | } | |
08069033 | 7136 | |
3a5c359a AK |
7137 | sg_inc_cpu_power(sg, sd->groups->__cpu_power); |
7138 | } | |
7139 | sg = sg->next; | |
7140 | } while (sg != group_head); | |
08069033 | 7141 | } |
6d6bc0ad | 7142 | #endif /* CONFIG_NUMA */ |
1da177e4 | 7143 | |
a616058b | 7144 | #ifdef CONFIG_NUMA |
51888ca2 | 7145 | /* Free memory allocated for various sched_group structures */ |
7c16ec58 | 7146 | static void free_sched_groups(const cpumask_t *cpu_map, cpumask_t *nodemask) |
51888ca2 | 7147 | { |
a616058b | 7148 | int cpu, i; |
51888ca2 | 7149 | |
363ab6f1 | 7150 | for_each_cpu_mask_nr(cpu, *cpu_map) { |
51888ca2 SV |
7151 | struct sched_group **sched_group_nodes |
7152 | = sched_group_nodes_bycpu[cpu]; | |
7153 | ||
51888ca2 SV |
7154 | if (!sched_group_nodes) |
7155 | continue; | |
7156 | ||
076ac2af | 7157 | for (i = 0; i < nr_node_ids; i++) { |
51888ca2 SV |
7158 | struct sched_group *oldsg, *sg = sched_group_nodes[i]; |
7159 | ||
7c16ec58 MT |
7160 | *nodemask = node_to_cpumask(i); |
7161 | cpus_and(*nodemask, *nodemask, *cpu_map); | |
7162 | if (cpus_empty(*nodemask)) | |
51888ca2 SV |
7163 | continue; |
7164 | ||
7165 | if (sg == NULL) | |
7166 | continue; | |
7167 | sg = sg->next; | |
7168 | next_sg: | |
7169 | oldsg = sg; | |
7170 | sg = sg->next; | |
7171 | kfree(oldsg); | |
7172 | if (oldsg != sched_group_nodes[i]) | |
7173 | goto next_sg; | |
7174 | } | |
7175 | kfree(sched_group_nodes); | |
7176 | sched_group_nodes_bycpu[cpu] = NULL; | |
7177 | } | |
51888ca2 | 7178 | } |
6d6bc0ad | 7179 | #else /* !CONFIG_NUMA */ |
7c16ec58 | 7180 | static void free_sched_groups(const cpumask_t *cpu_map, cpumask_t *nodemask) |
a616058b SS |
7181 | { |
7182 | } | |
6d6bc0ad | 7183 | #endif /* CONFIG_NUMA */ |
51888ca2 | 7184 | |
89c4710e SS |
7185 | /* |
7186 | * Initialize sched groups cpu_power. | |
7187 | * | |
7188 | * cpu_power indicates the capacity of sched group, which is used while | |
7189 | * distributing the load between different sched groups in a sched domain. | |
7190 | * Typically cpu_power for all the groups in a sched domain will be same unless | |
7191 | * there are asymmetries in the topology. If there are asymmetries, group | |
7192 | * having more cpu_power will pickup more load compared to the group having | |
7193 | * less cpu_power. | |
7194 | * | |
7195 | * cpu_power will be a multiple of SCHED_LOAD_SCALE. This multiple represents | |
7196 | * the maximum number of tasks a group can handle in the presence of other idle | |
7197 | * or lightly loaded groups in the same sched domain. | |
7198 | */ | |
7199 | static void init_sched_groups_power(int cpu, struct sched_domain *sd) | |
7200 | { | |
7201 | struct sched_domain *child; | |
7202 | struct sched_group *group; | |
7203 | ||
7204 | WARN_ON(!sd || !sd->groups); | |
7205 | ||
7206 | if (cpu != first_cpu(sd->groups->cpumask)) | |
7207 | return; | |
7208 | ||
7209 | child = sd->child; | |
7210 | ||
5517d86b ED |
7211 | sd->groups->__cpu_power = 0; |
7212 | ||
89c4710e SS |
7213 | /* |
7214 | * For perf policy, if the groups in child domain share resources | |
7215 | * (for example cores sharing some portions of the cache hierarchy | |
7216 | * or SMT), then set this domain groups cpu_power such that each group | |
7217 | * can handle only one task, when there are other idle groups in the | |
7218 | * same sched domain. | |
7219 | */ | |
7220 | if (!child || (!(sd->flags & SD_POWERSAVINGS_BALANCE) && | |
7221 | (child->flags & | |
7222 | (SD_SHARE_CPUPOWER | SD_SHARE_PKG_RESOURCES)))) { | |
5517d86b | 7223 | sg_inc_cpu_power(sd->groups, SCHED_LOAD_SCALE); |
89c4710e SS |
7224 | return; |
7225 | } | |
7226 | ||
89c4710e SS |
7227 | /* |
7228 | * add cpu_power of each child group to this groups cpu_power | |
7229 | */ | |
7230 | group = child->groups; | |
7231 | do { | |
5517d86b | 7232 | sg_inc_cpu_power(sd->groups, group->__cpu_power); |
89c4710e SS |
7233 | group = group->next; |
7234 | } while (group != child->groups); | |
7235 | } | |
7236 | ||
7c16ec58 MT |
7237 | /* |
7238 | * Initializers for schedule domains | |
7239 | * Non-inlined to reduce accumulated stack pressure in build_sched_domains() | |
7240 | */ | |
7241 | ||
a5d8c348 IM |
7242 | #ifdef CONFIG_SCHED_DEBUG |
7243 | # define SD_INIT_NAME(sd, type) sd->name = #type | |
7244 | #else | |
7245 | # define SD_INIT_NAME(sd, type) do { } while (0) | |
7246 | #endif | |
7247 | ||
7c16ec58 | 7248 | #define SD_INIT(sd, type) sd_init_##type(sd) |
a5d8c348 | 7249 | |
7c16ec58 MT |
7250 | #define SD_INIT_FUNC(type) \ |
7251 | static noinline void sd_init_##type(struct sched_domain *sd) \ | |
7252 | { \ | |
7253 | memset(sd, 0, sizeof(*sd)); \ | |
7254 | *sd = SD_##type##_INIT; \ | |
1d3504fc | 7255 | sd->level = SD_LV_##type; \ |
a5d8c348 | 7256 | SD_INIT_NAME(sd, type); \ |
7c16ec58 MT |
7257 | } |
7258 | ||
7259 | SD_INIT_FUNC(CPU) | |
7260 | #ifdef CONFIG_NUMA | |
7261 | SD_INIT_FUNC(ALLNODES) | |
7262 | SD_INIT_FUNC(NODE) | |
7263 | #endif | |
7264 | #ifdef CONFIG_SCHED_SMT | |
7265 | SD_INIT_FUNC(SIBLING) | |
7266 | #endif | |
7267 | #ifdef CONFIG_SCHED_MC | |
7268 | SD_INIT_FUNC(MC) | |
7269 | #endif | |
7270 | ||
7271 | /* | |
7272 | * To minimize stack usage kmalloc room for cpumasks and share the | |
7273 | * space as the usage in build_sched_domains() dictates. Used only | |
7274 | * if the amount of space is significant. | |
7275 | */ | |
7276 | struct allmasks { | |
7277 | cpumask_t tmpmask; /* make this one first */ | |
7278 | union { | |
7279 | cpumask_t nodemask; | |
7280 | cpumask_t this_sibling_map; | |
7281 | cpumask_t this_core_map; | |
7282 | }; | |
7283 | cpumask_t send_covered; | |
7284 | ||
7285 | #ifdef CONFIG_NUMA | |
7286 | cpumask_t domainspan; | |
7287 | cpumask_t covered; | |
7288 | cpumask_t notcovered; | |
7289 | #endif | |
7290 | }; | |
7291 | ||
7292 | #if NR_CPUS > 128 | |
6d21cd62 LZ |
7293 | #define SCHED_CPUMASK_DECLARE(v) struct allmasks *v |
7294 | static inline void sched_cpumask_alloc(struct allmasks **masks) | |
7295 | { | |
7296 | *masks = kmalloc(sizeof(**masks), GFP_KERNEL); | |
7297 | } | |
7298 | static inline void sched_cpumask_free(struct allmasks *masks) | |
7299 | { | |
7300 | kfree(masks); | |
7301 | } | |
7c16ec58 | 7302 | #else |
6d21cd62 LZ |
7303 | #define SCHED_CPUMASK_DECLARE(v) struct allmasks _v, *v = &_v |
7304 | static inline void sched_cpumask_alloc(struct allmasks **masks) | |
7305 | { } | |
7306 | static inline void sched_cpumask_free(struct allmasks *masks) | |
7307 | { } | |
7c16ec58 MT |
7308 | #endif |
7309 | ||
7310 | #define SCHED_CPUMASK_VAR(v, a) cpumask_t *v = (cpumask_t *) \ | |
7311 | ((unsigned long)(a) + offsetof(struct allmasks, v)) | |
7312 | ||
1d3504fc HS |
7313 | static int default_relax_domain_level = -1; |
7314 | ||
7315 | static int __init setup_relax_domain_level(char *str) | |
7316 | { | |
30e0e178 LZ |
7317 | unsigned long val; |
7318 | ||
7319 | val = simple_strtoul(str, NULL, 0); | |
7320 | if (val < SD_LV_MAX) | |
7321 | default_relax_domain_level = val; | |
7322 | ||
1d3504fc HS |
7323 | return 1; |
7324 | } | |
7325 | __setup("relax_domain_level=", setup_relax_domain_level); | |
7326 | ||
7327 | static void set_domain_attribute(struct sched_domain *sd, | |
7328 | struct sched_domain_attr *attr) | |
7329 | { | |
7330 | int request; | |
7331 | ||
7332 | if (!attr || attr->relax_domain_level < 0) { | |
7333 | if (default_relax_domain_level < 0) | |
7334 | return; | |
7335 | else | |
7336 | request = default_relax_domain_level; | |
7337 | } else | |
7338 | request = attr->relax_domain_level; | |
7339 | if (request < sd->level) { | |
7340 | /* turn off idle balance on this domain */ | |
7341 | sd->flags &= ~(SD_WAKE_IDLE|SD_BALANCE_NEWIDLE); | |
7342 | } else { | |
7343 | /* turn on idle balance on this domain */ | |
7344 | sd->flags |= (SD_WAKE_IDLE_FAR|SD_BALANCE_NEWIDLE); | |
7345 | } | |
7346 | } | |
7347 | ||
1da177e4 | 7348 | /* |
1a20ff27 DG |
7349 | * Build sched domains for a given set of cpus and attach the sched domains |
7350 | * to the individual cpus | |
1da177e4 | 7351 | */ |
1d3504fc HS |
7352 | static int __build_sched_domains(const cpumask_t *cpu_map, |
7353 | struct sched_domain_attr *attr) | |
1da177e4 LT |
7354 | { |
7355 | int i; | |
57d885fe | 7356 | struct root_domain *rd; |
7c16ec58 MT |
7357 | SCHED_CPUMASK_DECLARE(allmasks); |
7358 | cpumask_t *tmpmask; | |
d1b55138 JH |
7359 | #ifdef CONFIG_NUMA |
7360 | struct sched_group **sched_group_nodes = NULL; | |
6711cab4 | 7361 | int sd_allnodes = 0; |
d1b55138 JH |
7362 | |
7363 | /* | |
7364 | * Allocate the per-node list of sched groups | |
7365 | */ | |
076ac2af | 7366 | sched_group_nodes = kcalloc(nr_node_ids, sizeof(struct sched_group *), |
41a2d6cf | 7367 | GFP_KERNEL); |
d1b55138 JH |
7368 | if (!sched_group_nodes) { |
7369 | printk(KERN_WARNING "Can not alloc sched group node list\n"); | |
51888ca2 | 7370 | return -ENOMEM; |
d1b55138 | 7371 | } |
d1b55138 | 7372 | #endif |
1da177e4 | 7373 | |
dc938520 | 7374 | rd = alloc_rootdomain(); |
57d885fe GH |
7375 | if (!rd) { |
7376 | printk(KERN_WARNING "Cannot alloc root domain\n"); | |
7c16ec58 MT |
7377 | #ifdef CONFIG_NUMA |
7378 | kfree(sched_group_nodes); | |
7379 | #endif | |
57d885fe GH |
7380 | return -ENOMEM; |
7381 | } | |
7382 | ||
7c16ec58 | 7383 | /* get space for all scratch cpumask variables */ |
6d21cd62 | 7384 | sched_cpumask_alloc(&allmasks); |
7c16ec58 MT |
7385 | if (!allmasks) { |
7386 | printk(KERN_WARNING "Cannot alloc cpumask array\n"); | |
7387 | kfree(rd); | |
7388 | #ifdef CONFIG_NUMA | |
7389 | kfree(sched_group_nodes); | |
7390 | #endif | |
7391 | return -ENOMEM; | |
7392 | } | |
6d21cd62 | 7393 | |
7c16ec58 MT |
7394 | tmpmask = (cpumask_t *)allmasks; |
7395 | ||
7396 | ||
7397 | #ifdef CONFIG_NUMA | |
7398 | sched_group_nodes_bycpu[first_cpu(*cpu_map)] = sched_group_nodes; | |
7399 | #endif | |
7400 | ||
1da177e4 | 7401 | /* |
1a20ff27 | 7402 | * Set up domains for cpus specified by the cpu_map. |
1da177e4 | 7403 | */ |
363ab6f1 | 7404 | for_each_cpu_mask_nr(i, *cpu_map) { |
1da177e4 | 7405 | struct sched_domain *sd = NULL, *p; |
7c16ec58 | 7406 | SCHED_CPUMASK_VAR(nodemask, allmasks); |
1da177e4 | 7407 | |
7c16ec58 MT |
7408 | *nodemask = node_to_cpumask(cpu_to_node(i)); |
7409 | cpus_and(*nodemask, *nodemask, *cpu_map); | |
1da177e4 LT |
7410 | |
7411 | #ifdef CONFIG_NUMA | |
dd41f596 | 7412 | if (cpus_weight(*cpu_map) > |
7c16ec58 | 7413 | SD_NODES_PER_DOMAIN*cpus_weight(*nodemask)) { |
9c1cfda2 | 7414 | sd = &per_cpu(allnodes_domains, i); |
7c16ec58 | 7415 | SD_INIT(sd, ALLNODES); |
1d3504fc | 7416 | set_domain_attribute(sd, attr); |
9c1cfda2 | 7417 | sd->span = *cpu_map; |
7c16ec58 | 7418 | cpu_to_allnodes_group(i, cpu_map, &sd->groups, tmpmask); |
9c1cfda2 | 7419 | p = sd; |
6711cab4 | 7420 | sd_allnodes = 1; |
9c1cfda2 JH |
7421 | } else |
7422 | p = NULL; | |
7423 | ||
1da177e4 | 7424 | sd = &per_cpu(node_domains, i); |
7c16ec58 | 7425 | SD_INIT(sd, NODE); |
1d3504fc | 7426 | set_domain_attribute(sd, attr); |
4bdbaad3 | 7427 | sched_domain_node_span(cpu_to_node(i), &sd->span); |
9c1cfda2 | 7428 | sd->parent = p; |
1a848870 SS |
7429 | if (p) |
7430 | p->child = sd; | |
9c1cfda2 | 7431 | cpus_and(sd->span, sd->span, *cpu_map); |
1da177e4 LT |
7432 | #endif |
7433 | ||
7434 | p = sd; | |
7435 | sd = &per_cpu(phys_domains, i); | |
7c16ec58 | 7436 | SD_INIT(sd, CPU); |
1d3504fc | 7437 | set_domain_attribute(sd, attr); |
7c16ec58 | 7438 | sd->span = *nodemask; |
1da177e4 | 7439 | sd->parent = p; |
1a848870 SS |
7440 | if (p) |
7441 | p->child = sd; | |
7c16ec58 | 7442 | cpu_to_phys_group(i, cpu_map, &sd->groups, tmpmask); |
1da177e4 | 7443 | |
1e9f28fa SS |
7444 | #ifdef CONFIG_SCHED_MC |
7445 | p = sd; | |
7446 | sd = &per_cpu(core_domains, i); | |
7c16ec58 | 7447 | SD_INIT(sd, MC); |
1d3504fc | 7448 | set_domain_attribute(sd, attr); |
1e9f28fa SS |
7449 | sd->span = cpu_coregroup_map(i); |
7450 | cpus_and(sd->span, sd->span, *cpu_map); | |
7451 | sd->parent = p; | |
1a848870 | 7452 | p->child = sd; |
7c16ec58 | 7453 | cpu_to_core_group(i, cpu_map, &sd->groups, tmpmask); |
1e9f28fa SS |
7454 | #endif |
7455 | ||
1da177e4 LT |
7456 | #ifdef CONFIG_SCHED_SMT |
7457 | p = sd; | |
7458 | sd = &per_cpu(cpu_domains, i); | |
7c16ec58 | 7459 | SD_INIT(sd, SIBLING); |
1d3504fc | 7460 | set_domain_attribute(sd, attr); |
d5a7430d | 7461 | sd->span = per_cpu(cpu_sibling_map, i); |
1a20ff27 | 7462 | cpus_and(sd->span, sd->span, *cpu_map); |
1da177e4 | 7463 | sd->parent = p; |
1a848870 | 7464 | p->child = sd; |
7c16ec58 | 7465 | cpu_to_cpu_group(i, cpu_map, &sd->groups, tmpmask); |
1da177e4 LT |
7466 | #endif |
7467 | } | |
7468 | ||
7469 | #ifdef CONFIG_SCHED_SMT | |
7470 | /* Set up CPU (sibling) groups */ | |
363ab6f1 | 7471 | for_each_cpu_mask_nr(i, *cpu_map) { |
7c16ec58 MT |
7472 | SCHED_CPUMASK_VAR(this_sibling_map, allmasks); |
7473 | SCHED_CPUMASK_VAR(send_covered, allmasks); | |
7474 | ||
7475 | *this_sibling_map = per_cpu(cpu_sibling_map, i); | |
7476 | cpus_and(*this_sibling_map, *this_sibling_map, *cpu_map); | |
7477 | if (i != first_cpu(*this_sibling_map)) | |
1da177e4 LT |
7478 | continue; |
7479 | ||
dd41f596 | 7480 | init_sched_build_groups(this_sibling_map, cpu_map, |
7c16ec58 MT |
7481 | &cpu_to_cpu_group, |
7482 | send_covered, tmpmask); | |
1da177e4 LT |
7483 | } |
7484 | #endif | |
7485 | ||
1e9f28fa SS |
7486 | #ifdef CONFIG_SCHED_MC |
7487 | /* Set up multi-core groups */ | |
363ab6f1 | 7488 | for_each_cpu_mask_nr(i, *cpu_map) { |
7c16ec58 MT |
7489 | SCHED_CPUMASK_VAR(this_core_map, allmasks); |
7490 | SCHED_CPUMASK_VAR(send_covered, allmasks); | |
7491 | ||
7492 | *this_core_map = cpu_coregroup_map(i); | |
7493 | cpus_and(*this_core_map, *this_core_map, *cpu_map); | |
7494 | if (i != first_cpu(*this_core_map)) | |
1e9f28fa | 7495 | continue; |
7c16ec58 | 7496 | |
dd41f596 | 7497 | init_sched_build_groups(this_core_map, cpu_map, |
7c16ec58 MT |
7498 | &cpu_to_core_group, |
7499 | send_covered, tmpmask); | |
1e9f28fa SS |
7500 | } |
7501 | #endif | |
7502 | ||
1da177e4 | 7503 | /* Set up physical groups */ |
076ac2af | 7504 | for (i = 0; i < nr_node_ids; i++) { |
7c16ec58 MT |
7505 | SCHED_CPUMASK_VAR(nodemask, allmasks); |
7506 | SCHED_CPUMASK_VAR(send_covered, allmasks); | |
1da177e4 | 7507 | |
7c16ec58 MT |
7508 | *nodemask = node_to_cpumask(i); |
7509 | cpus_and(*nodemask, *nodemask, *cpu_map); | |
7510 | if (cpus_empty(*nodemask)) | |
1da177e4 LT |
7511 | continue; |
7512 | ||
7c16ec58 MT |
7513 | init_sched_build_groups(nodemask, cpu_map, |
7514 | &cpu_to_phys_group, | |
7515 | send_covered, tmpmask); | |
1da177e4 LT |
7516 | } |
7517 | ||
7518 | #ifdef CONFIG_NUMA | |
7519 | /* Set up node groups */ | |
7c16ec58 MT |
7520 | if (sd_allnodes) { |
7521 | SCHED_CPUMASK_VAR(send_covered, allmasks); | |
7522 | ||
7523 | init_sched_build_groups(cpu_map, cpu_map, | |
7524 | &cpu_to_allnodes_group, | |
7525 | send_covered, tmpmask); | |
7526 | } | |
9c1cfda2 | 7527 | |
076ac2af | 7528 | for (i = 0; i < nr_node_ids; i++) { |
9c1cfda2 JH |
7529 | /* Set up node groups */ |
7530 | struct sched_group *sg, *prev; | |
7c16ec58 MT |
7531 | SCHED_CPUMASK_VAR(nodemask, allmasks); |
7532 | SCHED_CPUMASK_VAR(domainspan, allmasks); | |
7533 | SCHED_CPUMASK_VAR(covered, allmasks); | |
9c1cfda2 JH |
7534 | int j; |
7535 | ||
7c16ec58 MT |
7536 | *nodemask = node_to_cpumask(i); |
7537 | cpus_clear(*covered); | |
7538 | ||
7539 | cpus_and(*nodemask, *nodemask, *cpu_map); | |
7540 | if (cpus_empty(*nodemask)) { | |
d1b55138 | 7541 | sched_group_nodes[i] = NULL; |
9c1cfda2 | 7542 | continue; |
d1b55138 | 7543 | } |
9c1cfda2 | 7544 | |
4bdbaad3 | 7545 | sched_domain_node_span(i, domainspan); |
7c16ec58 | 7546 | cpus_and(*domainspan, *domainspan, *cpu_map); |
9c1cfda2 | 7547 | |
15f0b676 | 7548 | sg = kmalloc_node(sizeof(struct sched_group), GFP_KERNEL, i); |
51888ca2 SV |
7549 | if (!sg) { |
7550 | printk(KERN_WARNING "Can not alloc domain group for " | |
7551 | "node %d\n", i); | |
7552 | goto error; | |
7553 | } | |
9c1cfda2 | 7554 | sched_group_nodes[i] = sg; |
363ab6f1 | 7555 | for_each_cpu_mask_nr(j, *nodemask) { |
9c1cfda2 | 7556 | struct sched_domain *sd; |
9761eea8 | 7557 | |
9c1cfda2 JH |
7558 | sd = &per_cpu(node_domains, j); |
7559 | sd->groups = sg; | |
9c1cfda2 | 7560 | } |
5517d86b | 7561 | sg->__cpu_power = 0; |
7c16ec58 | 7562 | sg->cpumask = *nodemask; |
51888ca2 | 7563 | sg->next = sg; |
7c16ec58 | 7564 | cpus_or(*covered, *covered, *nodemask); |
9c1cfda2 JH |
7565 | prev = sg; |
7566 | ||
076ac2af | 7567 | for (j = 0; j < nr_node_ids; j++) { |
7c16ec58 | 7568 | SCHED_CPUMASK_VAR(notcovered, allmasks); |
076ac2af | 7569 | int n = (i + j) % nr_node_ids; |
c5f59f08 | 7570 | node_to_cpumask_ptr(pnodemask, n); |
9c1cfda2 | 7571 | |
7c16ec58 MT |
7572 | cpus_complement(*notcovered, *covered); |
7573 | cpus_and(*tmpmask, *notcovered, *cpu_map); | |
7574 | cpus_and(*tmpmask, *tmpmask, *domainspan); | |
7575 | if (cpus_empty(*tmpmask)) | |
9c1cfda2 JH |
7576 | break; |
7577 | ||
7c16ec58 MT |
7578 | cpus_and(*tmpmask, *tmpmask, *pnodemask); |
7579 | if (cpus_empty(*tmpmask)) | |
9c1cfda2 JH |
7580 | continue; |
7581 | ||
15f0b676 SV |
7582 | sg = kmalloc_node(sizeof(struct sched_group), |
7583 | GFP_KERNEL, i); | |
9c1cfda2 JH |
7584 | if (!sg) { |
7585 | printk(KERN_WARNING | |
7586 | "Can not alloc domain group for node %d\n", j); | |
51888ca2 | 7587 | goto error; |
9c1cfda2 | 7588 | } |
5517d86b | 7589 | sg->__cpu_power = 0; |
7c16ec58 | 7590 | sg->cpumask = *tmpmask; |
51888ca2 | 7591 | sg->next = prev->next; |
7c16ec58 | 7592 | cpus_or(*covered, *covered, *tmpmask); |
9c1cfda2 JH |
7593 | prev->next = sg; |
7594 | prev = sg; | |
7595 | } | |
9c1cfda2 | 7596 | } |
1da177e4 LT |
7597 | #endif |
7598 | ||
7599 | /* Calculate CPU power for physical packages and nodes */ | |
5c45bf27 | 7600 | #ifdef CONFIG_SCHED_SMT |
363ab6f1 | 7601 | for_each_cpu_mask_nr(i, *cpu_map) { |
dd41f596 IM |
7602 | struct sched_domain *sd = &per_cpu(cpu_domains, i); |
7603 | ||
89c4710e | 7604 | init_sched_groups_power(i, sd); |
5c45bf27 | 7605 | } |
1da177e4 | 7606 | #endif |
1e9f28fa | 7607 | #ifdef CONFIG_SCHED_MC |
363ab6f1 | 7608 | for_each_cpu_mask_nr(i, *cpu_map) { |
dd41f596 IM |
7609 | struct sched_domain *sd = &per_cpu(core_domains, i); |
7610 | ||
89c4710e | 7611 | init_sched_groups_power(i, sd); |
5c45bf27 SS |
7612 | } |
7613 | #endif | |
1e9f28fa | 7614 | |
363ab6f1 | 7615 | for_each_cpu_mask_nr(i, *cpu_map) { |
dd41f596 IM |
7616 | struct sched_domain *sd = &per_cpu(phys_domains, i); |
7617 | ||
89c4710e | 7618 | init_sched_groups_power(i, sd); |
1da177e4 LT |
7619 | } |
7620 | ||
9c1cfda2 | 7621 | #ifdef CONFIG_NUMA |
076ac2af | 7622 | for (i = 0; i < nr_node_ids; i++) |
08069033 | 7623 | init_numa_sched_groups_power(sched_group_nodes[i]); |
9c1cfda2 | 7624 | |
6711cab4 SS |
7625 | if (sd_allnodes) { |
7626 | struct sched_group *sg; | |
f712c0c7 | 7627 | |
7c16ec58 MT |
7628 | cpu_to_allnodes_group(first_cpu(*cpu_map), cpu_map, &sg, |
7629 | tmpmask); | |
f712c0c7 SS |
7630 | init_numa_sched_groups_power(sg); |
7631 | } | |
9c1cfda2 JH |
7632 | #endif |
7633 | ||
1da177e4 | 7634 | /* Attach the domains */ |
363ab6f1 | 7635 | for_each_cpu_mask_nr(i, *cpu_map) { |
1da177e4 LT |
7636 | struct sched_domain *sd; |
7637 | #ifdef CONFIG_SCHED_SMT | |
7638 | sd = &per_cpu(cpu_domains, i); | |
1e9f28fa SS |
7639 | #elif defined(CONFIG_SCHED_MC) |
7640 | sd = &per_cpu(core_domains, i); | |
1da177e4 LT |
7641 | #else |
7642 | sd = &per_cpu(phys_domains, i); | |
7643 | #endif | |
57d885fe | 7644 | cpu_attach_domain(sd, rd, i); |
1da177e4 | 7645 | } |
51888ca2 | 7646 | |
6d21cd62 | 7647 | sched_cpumask_free(allmasks); |
51888ca2 SV |
7648 | return 0; |
7649 | ||
a616058b | 7650 | #ifdef CONFIG_NUMA |
51888ca2 | 7651 | error: |
7c16ec58 | 7652 | free_sched_groups(cpu_map, tmpmask); |
6d21cd62 | 7653 | sched_cpumask_free(allmasks); |
ca3273f9 | 7654 | kfree(rd); |
51888ca2 | 7655 | return -ENOMEM; |
a616058b | 7656 | #endif |
1da177e4 | 7657 | } |
029190c5 | 7658 | |
1d3504fc HS |
7659 | static int build_sched_domains(const cpumask_t *cpu_map) |
7660 | { | |
7661 | return __build_sched_domains(cpu_map, NULL); | |
7662 | } | |
7663 | ||
029190c5 PJ |
7664 | static cpumask_t *doms_cur; /* current sched domains */ |
7665 | static int ndoms_cur; /* number of sched domains in 'doms_cur' */ | |
4285f594 IM |
7666 | static struct sched_domain_attr *dattr_cur; |
7667 | /* attribues of custom domains in 'doms_cur' */ | |
029190c5 PJ |
7668 | |
7669 | /* | |
7670 | * Special case: If a kmalloc of a doms_cur partition (array of | |
7671 | * cpumask_t) fails, then fallback to a single sched domain, | |
7672 | * as determined by the single cpumask_t fallback_doms. | |
7673 | */ | |
7674 | static cpumask_t fallback_doms; | |
7675 | ||
22e52b07 HC |
7676 | void __attribute__((weak)) arch_update_cpu_topology(void) |
7677 | { | |
7678 | } | |
7679 | ||
1a20ff27 | 7680 | /* |
41a2d6cf | 7681 | * Set up scheduler domains and groups. Callers must hold the hotplug lock. |
029190c5 PJ |
7682 | * For now this just excludes isolated cpus, but could be used to |
7683 | * exclude other special cases in the future. | |
1a20ff27 | 7684 | */ |
51888ca2 | 7685 | static int arch_init_sched_domains(const cpumask_t *cpu_map) |
1a20ff27 | 7686 | { |
7378547f MM |
7687 | int err; |
7688 | ||
22e52b07 | 7689 | arch_update_cpu_topology(); |
029190c5 PJ |
7690 | ndoms_cur = 1; |
7691 | doms_cur = kmalloc(sizeof(cpumask_t), GFP_KERNEL); | |
7692 | if (!doms_cur) | |
7693 | doms_cur = &fallback_doms; | |
7694 | cpus_andnot(*doms_cur, *cpu_map, cpu_isolated_map); | |
1d3504fc | 7695 | dattr_cur = NULL; |
7378547f | 7696 | err = build_sched_domains(doms_cur); |
6382bc90 | 7697 | register_sched_domain_sysctl(); |
7378547f MM |
7698 | |
7699 | return err; | |
1a20ff27 DG |
7700 | } |
7701 | ||
7c16ec58 MT |
7702 | static void arch_destroy_sched_domains(const cpumask_t *cpu_map, |
7703 | cpumask_t *tmpmask) | |
1da177e4 | 7704 | { |
7c16ec58 | 7705 | free_sched_groups(cpu_map, tmpmask); |
9c1cfda2 | 7706 | } |
1da177e4 | 7707 | |
1a20ff27 DG |
7708 | /* |
7709 | * Detach sched domains from a group of cpus specified in cpu_map | |
7710 | * These cpus will now be attached to the NULL domain | |
7711 | */ | |
858119e1 | 7712 | static void detach_destroy_domains(const cpumask_t *cpu_map) |
1a20ff27 | 7713 | { |
7c16ec58 | 7714 | cpumask_t tmpmask; |
1a20ff27 DG |
7715 | int i; |
7716 | ||
363ab6f1 | 7717 | for_each_cpu_mask_nr(i, *cpu_map) |
57d885fe | 7718 | cpu_attach_domain(NULL, &def_root_domain, i); |
1a20ff27 | 7719 | synchronize_sched(); |
7c16ec58 | 7720 | arch_destroy_sched_domains(cpu_map, &tmpmask); |
1a20ff27 DG |
7721 | } |
7722 | ||
1d3504fc HS |
7723 | /* handle null as "default" */ |
7724 | static int dattrs_equal(struct sched_domain_attr *cur, int idx_cur, | |
7725 | struct sched_domain_attr *new, int idx_new) | |
7726 | { | |
7727 | struct sched_domain_attr tmp; | |
7728 | ||
7729 | /* fast path */ | |
7730 | if (!new && !cur) | |
7731 | return 1; | |
7732 | ||
7733 | tmp = SD_ATTR_INIT; | |
7734 | return !memcmp(cur ? (cur + idx_cur) : &tmp, | |
7735 | new ? (new + idx_new) : &tmp, | |
7736 | sizeof(struct sched_domain_attr)); | |
7737 | } | |
7738 | ||
029190c5 PJ |
7739 | /* |
7740 | * Partition sched domains as specified by the 'ndoms_new' | |
41a2d6cf | 7741 | * cpumasks in the array doms_new[] of cpumasks. This compares |
029190c5 PJ |
7742 | * doms_new[] to the current sched domain partitioning, doms_cur[]. |
7743 | * It destroys each deleted domain and builds each new domain. | |
7744 | * | |
7745 | * 'doms_new' is an array of cpumask_t's of length 'ndoms_new'. | |
41a2d6cf IM |
7746 | * The masks don't intersect (don't overlap.) We should setup one |
7747 | * sched domain for each mask. CPUs not in any of the cpumasks will | |
7748 | * not be load balanced. If the same cpumask appears both in the | |
029190c5 PJ |
7749 | * current 'doms_cur' domains and in the new 'doms_new', we can leave |
7750 | * it as it is. | |
7751 | * | |
41a2d6cf IM |
7752 | * The passed in 'doms_new' should be kmalloc'd. This routine takes |
7753 | * ownership of it and will kfree it when done with it. If the caller | |
700018e0 LZ |
7754 | * failed the kmalloc call, then it can pass in doms_new == NULL && |
7755 | * ndoms_new == 1, and partition_sched_domains() will fallback to | |
7756 | * the single partition 'fallback_doms', it also forces the domains | |
7757 | * to be rebuilt. | |
029190c5 | 7758 | * |
700018e0 LZ |
7759 | * If doms_new == NULL it will be replaced with cpu_online_map. |
7760 | * ndoms_new == 0 is a special case for destroying existing domains, | |
7761 | * and it will not create the default domain. | |
dfb512ec | 7762 | * |
029190c5 PJ |
7763 | * Call with hotplug lock held |
7764 | */ | |
1d3504fc HS |
7765 | void partition_sched_domains(int ndoms_new, cpumask_t *doms_new, |
7766 | struct sched_domain_attr *dattr_new) | |
029190c5 | 7767 | { |
dfb512ec | 7768 | int i, j, n; |
029190c5 | 7769 | |
712555ee | 7770 | mutex_lock(&sched_domains_mutex); |
a1835615 | 7771 | |
7378547f MM |
7772 | /* always unregister in case we don't destroy any domains */ |
7773 | unregister_sched_domain_sysctl(); | |
7774 | ||
dfb512ec | 7775 | n = doms_new ? ndoms_new : 0; |
029190c5 PJ |
7776 | |
7777 | /* Destroy deleted domains */ | |
7778 | for (i = 0; i < ndoms_cur; i++) { | |
dfb512ec | 7779 | for (j = 0; j < n; j++) { |
1d3504fc HS |
7780 | if (cpus_equal(doms_cur[i], doms_new[j]) |
7781 | && dattrs_equal(dattr_cur, i, dattr_new, j)) | |
029190c5 PJ |
7782 | goto match1; |
7783 | } | |
7784 | /* no match - a current sched domain not in new doms_new[] */ | |
7785 | detach_destroy_domains(doms_cur + i); | |
7786 | match1: | |
7787 | ; | |
7788 | } | |
7789 | ||
e761b772 MK |
7790 | if (doms_new == NULL) { |
7791 | ndoms_cur = 0; | |
e761b772 MK |
7792 | doms_new = &fallback_doms; |
7793 | cpus_andnot(doms_new[0], cpu_online_map, cpu_isolated_map); | |
faa2f98f | 7794 | WARN_ON_ONCE(dattr_new); |
e761b772 MK |
7795 | } |
7796 | ||
029190c5 PJ |
7797 | /* Build new domains */ |
7798 | for (i = 0; i < ndoms_new; i++) { | |
7799 | for (j = 0; j < ndoms_cur; j++) { | |
1d3504fc HS |
7800 | if (cpus_equal(doms_new[i], doms_cur[j]) |
7801 | && dattrs_equal(dattr_new, i, dattr_cur, j)) | |
029190c5 PJ |
7802 | goto match2; |
7803 | } | |
7804 | /* no match - add a new doms_new */ | |
1d3504fc HS |
7805 | __build_sched_domains(doms_new + i, |
7806 | dattr_new ? dattr_new + i : NULL); | |
029190c5 PJ |
7807 | match2: |
7808 | ; | |
7809 | } | |
7810 | ||
7811 | /* Remember the new sched domains */ | |
7812 | if (doms_cur != &fallback_doms) | |
7813 | kfree(doms_cur); | |
1d3504fc | 7814 | kfree(dattr_cur); /* kfree(NULL) is safe */ |
029190c5 | 7815 | doms_cur = doms_new; |
1d3504fc | 7816 | dattr_cur = dattr_new; |
029190c5 | 7817 | ndoms_cur = ndoms_new; |
7378547f MM |
7818 | |
7819 | register_sched_domain_sysctl(); | |
a1835615 | 7820 | |
712555ee | 7821 | mutex_unlock(&sched_domains_mutex); |
029190c5 PJ |
7822 | } |
7823 | ||
5c45bf27 | 7824 | #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT) |
9aefd0ab | 7825 | int arch_reinit_sched_domains(void) |
5c45bf27 | 7826 | { |
95402b38 | 7827 | get_online_cpus(); |
dfb512ec MK |
7828 | |
7829 | /* Destroy domains first to force the rebuild */ | |
7830 | partition_sched_domains(0, NULL, NULL); | |
7831 | ||
e761b772 | 7832 | rebuild_sched_domains(); |
95402b38 | 7833 | put_online_cpus(); |
dfb512ec | 7834 | |
e761b772 | 7835 | return 0; |
5c45bf27 SS |
7836 | } |
7837 | ||
7838 | static ssize_t sched_power_savings_store(const char *buf, size_t count, int smt) | |
7839 | { | |
7840 | int ret; | |
7841 | ||
7842 | if (buf[0] != '0' && buf[0] != '1') | |
7843 | return -EINVAL; | |
7844 | ||
7845 | if (smt) | |
7846 | sched_smt_power_savings = (buf[0] == '1'); | |
7847 | else | |
7848 | sched_mc_power_savings = (buf[0] == '1'); | |
7849 | ||
7850 | ret = arch_reinit_sched_domains(); | |
7851 | ||
7852 | return ret ? ret : count; | |
7853 | } | |
7854 | ||
5c45bf27 | 7855 | #ifdef CONFIG_SCHED_MC |
f718cd4a AK |
7856 | static ssize_t sched_mc_power_savings_show(struct sysdev_class *class, |
7857 | char *page) | |
5c45bf27 SS |
7858 | { |
7859 | return sprintf(page, "%u\n", sched_mc_power_savings); | |
7860 | } | |
f718cd4a | 7861 | static ssize_t sched_mc_power_savings_store(struct sysdev_class *class, |
48f24c4d | 7862 | const char *buf, size_t count) |
5c45bf27 SS |
7863 | { |
7864 | return sched_power_savings_store(buf, count, 0); | |
7865 | } | |
f718cd4a AK |
7866 | static SYSDEV_CLASS_ATTR(sched_mc_power_savings, 0644, |
7867 | sched_mc_power_savings_show, | |
7868 | sched_mc_power_savings_store); | |
5c45bf27 SS |
7869 | #endif |
7870 | ||
7871 | #ifdef CONFIG_SCHED_SMT | |
f718cd4a AK |
7872 | static ssize_t sched_smt_power_savings_show(struct sysdev_class *dev, |
7873 | char *page) | |
5c45bf27 SS |
7874 | { |
7875 | return sprintf(page, "%u\n", sched_smt_power_savings); | |
7876 | } | |
f718cd4a | 7877 | static ssize_t sched_smt_power_savings_store(struct sysdev_class *dev, |
48f24c4d | 7878 | const char *buf, size_t count) |
5c45bf27 SS |
7879 | { |
7880 | return sched_power_savings_store(buf, count, 1); | |
7881 | } | |
f718cd4a AK |
7882 | static SYSDEV_CLASS_ATTR(sched_smt_power_savings, 0644, |
7883 | sched_smt_power_savings_show, | |
6707de00 AB |
7884 | sched_smt_power_savings_store); |
7885 | #endif | |
7886 | ||
7887 | int sched_create_sysfs_power_savings_entries(struct sysdev_class *cls) | |
7888 | { | |
7889 | int err = 0; | |
7890 | ||
7891 | #ifdef CONFIG_SCHED_SMT | |
7892 | if (smt_capable()) | |
7893 | err = sysfs_create_file(&cls->kset.kobj, | |
7894 | &attr_sched_smt_power_savings.attr); | |
7895 | #endif | |
7896 | #ifdef CONFIG_SCHED_MC | |
7897 | if (!err && mc_capable()) | |
7898 | err = sysfs_create_file(&cls->kset.kobj, | |
7899 | &attr_sched_mc_power_savings.attr); | |
7900 | #endif | |
7901 | return err; | |
7902 | } | |
6d6bc0ad | 7903 | #endif /* CONFIG_SCHED_MC || CONFIG_SCHED_SMT */ |
5c45bf27 | 7904 | |
e761b772 | 7905 | #ifndef CONFIG_CPUSETS |
1da177e4 | 7906 | /* |
e761b772 MK |
7907 | * Add online and remove offline CPUs from the scheduler domains. |
7908 | * When cpusets are enabled they take over this function. | |
1da177e4 LT |
7909 | */ |
7910 | static int update_sched_domains(struct notifier_block *nfb, | |
7911 | unsigned long action, void *hcpu) | |
e761b772 MK |
7912 | { |
7913 | switch (action) { | |
7914 | case CPU_ONLINE: | |
7915 | case CPU_ONLINE_FROZEN: | |
7916 | case CPU_DEAD: | |
7917 | case CPU_DEAD_FROZEN: | |
dfb512ec | 7918 | partition_sched_domains(1, NULL, NULL); |
e761b772 MK |
7919 | return NOTIFY_OK; |
7920 | ||
7921 | default: | |
7922 | return NOTIFY_DONE; | |
7923 | } | |
7924 | } | |
7925 | #endif | |
7926 | ||
7927 | static int update_runtime(struct notifier_block *nfb, | |
7928 | unsigned long action, void *hcpu) | |
1da177e4 | 7929 | { |
7def2be1 PZ |
7930 | int cpu = (int)(long)hcpu; |
7931 | ||
1da177e4 | 7932 | switch (action) { |
1da177e4 | 7933 | case CPU_DOWN_PREPARE: |
8bb78442 | 7934 | case CPU_DOWN_PREPARE_FROZEN: |
7def2be1 | 7935 | disable_runtime(cpu_rq(cpu)); |
1da177e4 LT |
7936 | return NOTIFY_OK; |
7937 | ||
1da177e4 | 7938 | case CPU_DOWN_FAILED: |
8bb78442 | 7939 | case CPU_DOWN_FAILED_FROZEN: |
1da177e4 | 7940 | case CPU_ONLINE: |
8bb78442 | 7941 | case CPU_ONLINE_FROZEN: |
7def2be1 | 7942 | enable_runtime(cpu_rq(cpu)); |
e761b772 MK |
7943 | return NOTIFY_OK; |
7944 | ||
1da177e4 LT |
7945 | default: |
7946 | return NOTIFY_DONE; | |
7947 | } | |
1da177e4 | 7948 | } |
1da177e4 LT |
7949 | |
7950 | void __init sched_init_smp(void) | |
7951 | { | |
5c1e1767 NP |
7952 | cpumask_t non_isolated_cpus; |
7953 | ||
434d53b0 MT |
7954 | #if defined(CONFIG_NUMA) |
7955 | sched_group_nodes_bycpu = kzalloc(nr_cpu_ids * sizeof(void **), | |
7956 | GFP_KERNEL); | |
7957 | BUG_ON(sched_group_nodes_bycpu == NULL); | |
7958 | #endif | |
95402b38 | 7959 | get_online_cpus(); |
712555ee | 7960 | mutex_lock(&sched_domains_mutex); |
1a20ff27 | 7961 | arch_init_sched_domains(&cpu_online_map); |
e5e5673f | 7962 | cpus_andnot(non_isolated_cpus, cpu_possible_map, cpu_isolated_map); |
5c1e1767 NP |
7963 | if (cpus_empty(non_isolated_cpus)) |
7964 | cpu_set(smp_processor_id(), non_isolated_cpus); | |
712555ee | 7965 | mutex_unlock(&sched_domains_mutex); |
95402b38 | 7966 | put_online_cpus(); |
e761b772 MK |
7967 | |
7968 | #ifndef CONFIG_CPUSETS | |
1da177e4 LT |
7969 | /* XXX: Theoretical race here - CPU may be hotplugged now */ |
7970 | hotcpu_notifier(update_sched_domains, 0); | |
e761b772 MK |
7971 | #endif |
7972 | ||
7973 | /* RT runtime code needs to handle some hotplug events */ | |
7974 | hotcpu_notifier(update_runtime, 0); | |
7975 | ||
b328ca18 | 7976 | init_hrtick(); |
5c1e1767 NP |
7977 | |
7978 | /* Move init over to a non-isolated CPU */ | |
7c16ec58 | 7979 | if (set_cpus_allowed_ptr(current, &non_isolated_cpus) < 0) |
5c1e1767 | 7980 | BUG(); |
19978ca6 | 7981 | sched_init_granularity(); |
1da177e4 LT |
7982 | } |
7983 | #else | |
7984 | void __init sched_init_smp(void) | |
7985 | { | |
19978ca6 | 7986 | sched_init_granularity(); |
1da177e4 LT |
7987 | } |
7988 | #endif /* CONFIG_SMP */ | |
7989 | ||
7990 | int in_sched_functions(unsigned long addr) | |
7991 | { | |
1da177e4 LT |
7992 | return in_lock_functions(addr) || |
7993 | (addr >= (unsigned long)__sched_text_start | |
7994 | && addr < (unsigned long)__sched_text_end); | |
7995 | } | |
7996 | ||
a9957449 | 7997 | static void init_cfs_rq(struct cfs_rq *cfs_rq, struct rq *rq) |
dd41f596 IM |
7998 | { |
7999 | cfs_rq->tasks_timeline = RB_ROOT; | |
4a55bd5e | 8000 | INIT_LIST_HEAD(&cfs_rq->tasks); |
dd41f596 IM |
8001 | #ifdef CONFIG_FAIR_GROUP_SCHED |
8002 | cfs_rq->rq = rq; | |
8003 | #endif | |
67e9fb2a | 8004 | cfs_rq->min_vruntime = (u64)(-(1LL << 20)); |
dd41f596 IM |
8005 | } |
8006 | ||
fa85ae24 PZ |
8007 | static void init_rt_rq(struct rt_rq *rt_rq, struct rq *rq) |
8008 | { | |
8009 | struct rt_prio_array *array; | |
8010 | int i; | |
8011 | ||
8012 | array = &rt_rq->active; | |
8013 | for (i = 0; i < MAX_RT_PRIO; i++) { | |
8014 | INIT_LIST_HEAD(array->queue + i); | |
8015 | __clear_bit(i, array->bitmap); | |
8016 | } | |
8017 | /* delimiter for bitsearch: */ | |
8018 | __set_bit(MAX_RT_PRIO, array->bitmap); | |
8019 | ||
052f1dc7 | 8020 | #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED |
48d5e258 PZ |
8021 | rt_rq->highest_prio = MAX_RT_PRIO; |
8022 | #endif | |
fa85ae24 PZ |
8023 | #ifdef CONFIG_SMP |
8024 | rt_rq->rt_nr_migratory = 0; | |
fa85ae24 PZ |
8025 | rt_rq->overloaded = 0; |
8026 | #endif | |
8027 | ||
8028 | rt_rq->rt_time = 0; | |
8029 | rt_rq->rt_throttled = 0; | |
ac086bc2 PZ |
8030 | rt_rq->rt_runtime = 0; |
8031 | spin_lock_init(&rt_rq->rt_runtime_lock); | |
6f505b16 | 8032 | |
052f1dc7 | 8033 | #ifdef CONFIG_RT_GROUP_SCHED |
23b0fdfc | 8034 | rt_rq->rt_nr_boosted = 0; |
6f505b16 PZ |
8035 | rt_rq->rq = rq; |
8036 | #endif | |
fa85ae24 PZ |
8037 | } |
8038 | ||
6f505b16 | 8039 | #ifdef CONFIG_FAIR_GROUP_SCHED |
ec7dc8ac DG |
8040 | static void init_tg_cfs_entry(struct task_group *tg, struct cfs_rq *cfs_rq, |
8041 | struct sched_entity *se, int cpu, int add, | |
8042 | struct sched_entity *parent) | |
6f505b16 | 8043 | { |
ec7dc8ac | 8044 | struct rq *rq = cpu_rq(cpu); |
6f505b16 PZ |
8045 | tg->cfs_rq[cpu] = cfs_rq; |
8046 | init_cfs_rq(cfs_rq, rq); | |
8047 | cfs_rq->tg = tg; | |
8048 | if (add) | |
8049 | list_add(&cfs_rq->leaf_cfs_rq_list, &rq->leaf_cfs_rq_list); | |
8050 | ||
8051 | tg->se[cpu] = se; | |
354d60c2 DG |
8052 | /* se could be NULL for init_task_group */ |
8053 | if (!se) | |
8054 | return; | |
8055 | ||
ec7dc8ac DG |
8056 | if (!parent) |
8057 | se->cfs_rq = &rq->cfs; | |
8058 | else | |
8059 | se->cfs_rq = parent->my_q; | |
8060 | ||
6f505b16 PZ |
8061 | se->my_q = cfs_rq; |
8062 | se->load.weight = tg->shares; | |
e05510d0 | 8063 | se->load.inv_weight = 0; |
ec7dc8ac | 8064 | se->parent = parent; |
6f505b16 | 8065 | } |
052f1dc7 | 8066 | #endif |
6f505b16 | 8067 | |
052f1dc7 | 8068 | #ifdef CONFIG_RT_GROUP_SCHED |
ec7dc8ac DG |
8069 | static void init_tg_rt_entry(struct task_group *tg, struct rt_rq *rt_rq, |
8070 | struct sched_rt_entity *rt_se, int cpu, int add, | |
8071 | struct sched_rt_entity *parent) | |
6f505b16 | 8072 | { |
ec7dc8ac DG |
8073 | struct rq *rq = cpu_rq(cpu); |
8074 | ||
6f505b16 PZ |
8075 | tg->rt_rq[cpu] = rt_rq; |
8076 | init_rt_rq(rt_rq, rq); | |
8077 | rt_rq->tg = tg; | |
8078 | rt_rq->rt_se = rt_se; | |
ac086bc2 | 8079 | rt_rq->rt_runtime = tg->rt_bandwidth.rt_runtime; |
6f505b16 PZ |
8080 | if (add) |
8081 | list_add(&rt_rq->leaf_rt_rq_list, &rq->leaf_rt_rq_list); | |
8082 | ||
8083 | tg->rt_se[cpu] = rt_se; | |
354d60c2 DG |
8084 | if (!rt_se) |
8085 | return; | |
8086 | ||
ec7dc8ac DG |
8087 | if (!parent) |
8088 | rt_se->rt_rq = &rq->rt; | |
8089 | else | |
8090 | rt_se->rt_rq = parent->my_q; | |
8091 | ||
6f505b16 | 8092 | rt_se->my_q = rt_rq; |
ec7dc8ac | 8093 | rt_se->parent = parent; |
6f505b16 PZ |
8094 | INIT_LIST_HEAD(&rt_se->run_list); |
8095 | } | |
8096 | #endif | |
8097 | ||
1da177e4 LT |
8098 | void __init sched_init(void) |
8099 | { | |
dd41f596 | 8100 | int i, j; |
434d53b0 MT |
8101 | unsigned long alloc_size = 0, ptr; |
8102 | ||
8103 | #ifdef CONFIG_FAIR_GROUP_SCHED | |
8104 | alloc_size += 2 * nr_cpu_ids * sizeof(void **); | |
8105 | #endif | |
8106 | #ifdef CONFIG_RT_GROUP_SCHED | |
8107 | alloc_size += 2 * nr_cpu_ids * sizeof(void **); | |
eff766a6 PZ |
8108 | #endif |
8109 | #ifdef CONFIG_USER_SCHED | |
8110 | alloc_size *= 2; | |
434d53b0 MT |
8111 | #endif |
8112 | /* | |
8113 | * As sched_init() is called before page_alloc is setup, | |
8114 | * we use alloc_bootmem(). | |
8115 | */ | |
8116 | if (alloc_size) { | |
5a9d3225 | 8117 | ptr = (unsigned long)alloc_bootmem(alloc_size); |
434d53b0 MT |
8118 | |
8119 | #ifdef CONFIG_FAIR_GROUP_SCHED | |
8120 | init_task_group.se = (struct sched_entity **)ptr; | |
8121 | ptr += nr_cpu_ids * sizeof(void **); | |
8122 | ||
8123 | init_task_group.cfs_rq = (struct cfs_rq **)ptr; | |
8124 | ptr += nr_cpu_ids * sizeof(void **); | |
eff766a6 PZ |
8125 | |
8126 | #ifdef CONFIG_USER_SCHED | |
8127 | root_task_group.se = (struct sched_entity **)ptr; | |
8128 | ptr += nr_cpu_ids * sizeof(void **); | |
8129 | ||
8130 | root_task_group.cfs_rq = (struct cfs_rq **)ptr; | |
8131 | ptr += nr_cpu_ids * sizeof(void **); | |
6d6bc0ad DG |
8132 | #endif /* CONFIG_USER_SCHED */ |
8133 | #endif /* CONFIG_FAIR_GROUP_SCHED */ | |
434d53b0 MT |
8134 | #ifdef CONFIG_RT_GROUP_SCHED |
8135 | init_task_group.rt_se = (struct sched_rt_entity **)ptr; | |
8136 | ptr += nr_cpu_ids * sizeof(void **); | |
8137 | ||
8138 | init_task_group.rt_rq = (struct rt_rq **)ptr; | |
eff766a6 PZ |
8139 | ptr += nr_cpu_ids * sizeof(void **); |
8140 | ||
8141 | #ifdef CONFIG_USER_SCHED | |
8142 | root_task_group.rt_se = (struct sched_rt_entity **)ptr; | |
8143 | ptr += nr_cpu_ids * sizeof(void **); | |
8144 | ||
8145 | root_task_group.rt_rq = (struct rt_rq **)ptr; | |
8146 | ptr += nr_cpu_ids * sizeof(void **); | |
6d6bc0ad DG |
8147 | #endif /* CONFIG_USER_SCHED */ |
8148 | #endif /* CONFIG_RT_GROUP_SCHED */ | |
434d53b0 | 8149 | } |
dd41f596 | 8150 | |
57d885fe GH |
8151 | #ifdef CONFIG_SMP |
8152 | init_defrootdomain(); | |
8153 | #endif | |
8154 | ||
d0b27fa7 PZ |
8155 | init_rt_bandwidth(&def_rt_bandwidth, |
8156 | global_rt_period(), global_rt_runtime()); | |
8157 | ||
8158 | #ifdef CONFIG_RT_GROUP_SCHED | |
8159 | init_rt_bandwidth(&init_task_group.rt_bandwidth, | |
8160 | global_rt_period(), global_rt_runtime()); | |
eff766a6 PZ |
8161 | #ifdef CONFIG_USER_SCHED |
8162 | init_rt_bandwidth(&root_task_group.rt_bandwidth, | |
8163 | global_rt_period(), RUNTIME_INF); | |
6d6bc0ad DG |
8164 | #endif /* CONFIG_USER_SCHED */ |
8165 | #endif /* CONFIG_RT_GROUP_SCHED */ | |
d0b27fa7 | 8166 | |
052f1dc7 | 8167 | #ifdef CONFIG_GROUP_SCHED |
6f505b16 | 8168 | list_add(&init_task_group.list, &task_groups); |
f473aa5e PZ |
8169 | INIT_LIST_HEAD(&init_task_group.children); |
8170 | ||
8171 | #ifdef CONFIG_USER_SCHED | |
8172 | INIT_LIST_HEAD(&root_task_group.children); | |
8173 | init_task_group.parent = &root_task_group; | |
8174 | list_add(&init_task_group.siblings, &root_task_group.children); | |
6d6bc0ad DG |
8175 | #endif /* CONFIG_USER_SCHED */ |
8176 | #endif /* CONFIG_GROUP_SCHED */ | |
6f505b16 | 8177 | |
0a945022 | 8178 | for_each_possible_cpu(i) { |
70b97a7f | 8179 | struct rq *rq; |
1da177e4 LT |
8180 | |
8181 | rq = cpu_rq(i); | |
8182 | spin_lock_init(&rq->lock); | |
7897986b | 8183 | rq->nr_running = 0; |
dd41f596 | 8184 | init_cfs_rq(&rq->cfs, rq); |
6f505b16 | 8185 | init_rt_rq(&rq->rt, rq); |
dd41f596 | 8186 | #ifdef CONFIG_FAIR_GROUP_SCHED |
4cf86d77 | 8187 | init_task_group.shares = init_task_group_load; |
6f505b16 | 8188 | INIT_LIST_HEAD(&rq->leaf_cfs_rq_list); |
354d60c2 DG |
8189 | #ifdef CONFIG_CGROUP_SCHED |
8190 | /* | |
8191 | * How much cpu bandwidth does init_task_group get? | |
8192 | * | |
8193 | * In case of task-groups formed thr' the cgroup filesystem, it | |
8194 | * gets 100% of the cpu resources in the system. This overall | |
8195 | * system cpu resource is divided among the tasks of | |
8196 | * init_task_group and its child task-groups in a fair manner, | |
8197 | * based on each entity's (task or task-group's) weight | |
8198 | * (se->load.weight). | |
8199 | * | |
8200 | * In other words, if init_task_group has 10 tasks of weight | |
8201 | * 1024) and two child groups A0 and A1 (of weight 1024 each), | |
8202 | * then A0's share of the cpu resource is: | |
8203 | * | |
8204 | * A0's bandwidth = 1024 / (10*1024 + 1024 + 1024) = 8.33% | |
8205 | * | |
8206 | * We achieve this by letting init_task_group's tasks sit | |
8207 | * directly in rq->cfs (i.e init_task_group->se[] = NULL). | |
8208 | */ | |
ec7dc8ac | 8209 | init_tg_cfs_entry(&init_task_group, &rq->cfs, NULL, i, 1, NULL); |
354d60c2 | 8210 | #elif defined CONFIG_USER_SCHED |
eff766a6 PZ |
8211 | root_task_group.shares = NICE_0_LOAD; |
8212 | init_tg_cfs_entry(&root_task_group, &rq->cfs, NULL, i, 0, NULL); | |
354d60c2 DG |
8213 | /* |
8214 | * In case of task-groups formed thr' the user id of tasks, | |
8215 | * init_task_group represents tasks belonging to root user. | |
8216 | * Hence it forms a sibling of all subsequent groups formed. | |
8217 | * In this case, init_task_group gets only a fraction of overall | |
8218 | * system cpu resource, based on the weight assigned to root | |
8219 | * user's cpu share (INIT_TASK_GROUP_LOAD). This is accomplished | |
8220 | * by letting tasks of init_task_group sit in a separate cfs_rq | |
8221 | * (init_cfs_rq) and having one entity represent this group of | |
8222 | * tasks in rq->cfs (i.e init_task_group->se[] != NULL). | |
8223 | */ | |
ec7dc8ac | 8224 | init_tg_cfs_entry(&init_task_group, |
6f505b16 | 8225 | &per_cpu(init_cfs_rq, i), |
eff766a6 PZ |
8226 | &per_cpu(init_sched_entity, i), i, 1, |
8227 | root_task_group.se[i]); | |
6f505b16 | 8228 | |
052f1dc7 | 8229 | #endif |
354d60c2 DG |
8230 | #endif /* CONFIG_FAIR_GROUP_SCHED */ |
8231 | ||
8232 | rq->rt.rt_runtime = def_rt_bandwidth.rt_runtime; | |
052f1dc7 | 8233 | #ifdef CONFIG_RT_GROUP_SCHED |
6f505b16 | 8234 | INIT_LIST_HEAD(&rq->leaf_rt_rq_list); |
354d60c2 | 8235 | #ifdef CONFIG_CGROUP_SCHED |
ec7dc8ac | 8236 | init_tg_rt_entry(&init_task_group, &rq->rt, NULL, i, 1, NULL); |
354d60c2 | 8237 | #elif defined CONFIG_USER_SCHED |
eff766a6 | 8238 | init_tg_rt_entry(&root_task_group, &rq->rt, NULL, i, 0, NULL); |
ec7dc8ac | 8239 | init_tg_rt_entry(&init_task_group, |
6f505b16 | 8240 | &per_cpu(init_rt_rq, i), |
eff766a6 PZ |
8241 | &per_cpu(init_sched_rt_entity, i), i, 1, |
8242 | root_task_group.rt_se[i]); | |
354d60c2 | 8243 | #endif |
dd41f596 | 8244 | #endif |
1da177e4 | 8245 | |
dd41f596 IM |
8246 | for (j = 0; j < CPU_LOAD_IDX_MAX; j++) |
8247 | rq->cpu_load[j] = 0; | |
1da177e4 | 8248 | #ifdef CONFIG_SMP |
41c7ce9a | 8249 | rq->sd = NULL; |
57d885fe | 8250 | rq->rd = NULL; |
1da177e4 | 8251 | rq->active_balance = 0; |
dd41f596 | 8252 | rq->next_balance = jiffies; |
1da177e4 | 8253 | rq->push_cpu = 0; |
0a2966b4 | 8254 | rq->cpu = i; |
1f11eb6a | 8255 | rq->online = 0; |
1da177e4 LT |
8256 | rq->migration_thread = NULL; |
8257 | INIT_LIST_HEAD(&rq->migration_queue); | |
dc938520 | 8258 | rq_attach_root(rq, &def_root_domain); |
1da177e4 | 8259 | #endif |
8f4d37ec | 8260 | init_rq_hrtick(rq); |
1da177e4 | 8261 | atomic_set(&rq->nr_iowait, 0); |
1da177e4 LT |
8262 | } |
8263 | ||
2dd73a4f | 8264 | set_load_weight(&init_task); |
b50f60ce | 8265 | |
e107be36 AK |
8266 | #ifdef CONFIG_PREEMPT_NOTIFIERS |
8267 | INIT_HLIST_HEAD(&init_task.preempt_notifiers); | |
8268 | #endif | |
8269 | ||
c9819f45 | 8270 | #ifdef CONFIG_SMP |
962cf36c | 8271 | open_softirq(SCHED_SOFTIRQ, run_rebalance_domains); |
c9819f45 CL |
8272 | #endif |
8273 | ||
b50f60ce HC |
8274 | #ifdef CONFIG_RT_MUTEXES |
8275 | plist_head_init(&init_task.pi_waiters, &init_task.pi_lock); | |
8276 | #endif | |
8277 | ||
1da177e4 LT |
8278 | /* |
8279 | * The boot idle thread does lazy MMU switching as well: | |
8280 | */ | |
8281 | atomic_inc(&init_mm.mm_count); | |
8282 | enter_lazy_tlb(&init_mm, current); | |
8283 | ||
8284 | /* | |
8285 | * Make us the idle thread. Technically, schedule() should not be | |
8286 | * called from this thread, however somewhere below it might be, | |
8287 | * but because we are the idle thread, we just pick up running again | |
8288 | * when this runqueue becomes "idle". | |
8289 | */ | |
8290 | init_idle(current, smp_processor_id()); | |
dd41f596 IM |
8291 | /* |
8292 | * During early bootup we pretend to be a normal task: | |
8293 | */ | |
8294 | current->sched_class = &fair_sched_class; | |
6892b75e IM |
8295 | |
8296 | scheduler_running = 1; | |
1da177e4 LT |
8297 | } |
8298 | ||
8299 | #ifdef CONFIG_DEBUG_SPINLOCK_SLEEP | |
8300 | void __might_sleep(char *file, int line) | |
8301 | { | |
48f24c4d | 8302 | #ifdef in_atomic |
1da177e4 LT |
8303 | static unsigned long prev_jiffy; /* ratelimiting */ |
8304 | ||
aef745fc IM |
8305 | if ((!in_atomic() && !irqs_disabled()) || |
8306 | system_state != SYSTEM_RUNNING || oops_in_progress) | |
8307 | return; | |
8308 | if (time_before(jiffies, prev_jiffy + HZ) && prev_jiffy) | |
8309 | return; | |
8310 | prev_jiffy = jiffies; | |
8311 | ||
8312 | printk(KERN_ERR | |
8313 | "BUG: sleeping function called from invalid context at %s:%d\n", | |
8314 | file, line); | |
8315 | printk(KERN_ERR | |
8316 | "in_atomic(): %d, irqs_disabled(): %d, pid: %d, name: %s\n", | |
8317 | in_atomic(), irqs_disabled(), | |
8318 | current->pid, current->comm); | |
8319 | ||
8320 | debug_show_held_locks(current); | |
8321 | if (irqs_disabled()) | |
8322 | print_irqtrace_events(current); | |
8323 | dump_stack(); | |
1da177e4 LT |
8324 | #endif |
8325 | } | |
8326 | EXPORT_SYMBOL(__might_sleep); | |
8327 | #endif | |
8328 | ||
8329 | #ifdef CONFIG_MAGIC_SYSRQ | |
3a5e4dc1 AK |
8330 | static void normalize_task(struct rq *rq, struct task_struct *p) |
8331 | { | |
8332 | int on_rq; | |
3e51f33f | 8333 | |
3a5e4dc1 AK |
8334 | update_rq_clock(rq); |
8335 | on_rq = p->se.on_rq; | |
8336 | if (on_rq) | |
8337 | deactivate_task(rq, p, 0); | |
8338 | __setscheduler(rq, p, SCHED_NORMAL, 0); | |
8339 | if (on_rq) { | |
8340 | activate_task(rq, p, 0); | |
8341 | resched_task(rq->curr); | |
8342 | } | |
8343 | } | |
8344 | ||
1da177e4 LT |
8345 | void normalize_rt_tasks(void) |
8346 | { | |
a0f98a1c | 8347 | struct task_struct *g, *p; |
1da177e4 | 8348 | unsigned long flags; |
70b97a7f | 8349 | struct rq *rq; |
1da177e4 | 8350 | |
4cf5d77a | 8351 | read_lock_irqsave(&tasklist_lock, flags); |
a0f98a1c | 8352 | do_each_thread(g, p) { |
178be793 IM |
8353 | /* |
8354 | * Only normalize user tasks: | |
8355 | */ | |
8356 | if (!p->mm) | |
8357 | continue; | |
8358 | ||
6cfb0d5d | 8359 | p->se.exec_start = 0; |
6cfb0d5d | 8360 | #ifdef CONFIG_SCHEDSTATS |
dd41f596 | 8361 | p->se.wait_start = 0; |
dd41f596 | 8362 | p->se.sleep_start = 0; |
dd41f596 | 8363 | p->se.block_start = 0; |
6cfb0d5d | 8364 | #endif |
dd41f596 IM |
8365 | |
8366 | if (!rt_task(p)) { | |
8367 | /* | |
8368 | * Renice negative nice level userspace | |
8369 | * tasks back to 0: | |
8370 | */ | |
8371 | if (TASK_NICE(p) < 0 && p->mm) | |
8372 | set_user_nice(p, 0); | |
1da177e4 | 8373 | continue; |
dd41f596 | 8374 | } |
1da177e4 | 8375 | |
4cf5d77a | 8376 | spin_lock(&p->pi_lock); |
b29739f9 | 8377 | rq = __task_rq_lock(p); |
1da177e4 | 8378 | |
178be793 | 8379 | normalize_task(rq, p); |
3a5e4dc1 | 8380 | |
b29739f9 | 8381 | __task_rq_unlock(rq); |
4cf5d77a | 8382 | spin_unlock(&p->pi_lock); |
a0f98a1c IM |
8383 | } while_each_thread(g, p); |
8384 | ||
4cf5d77a | 8385 | read_unlock_irqrestore(&tasklist_lock, flags); |
1da177e4 LT |
8386 | } |
8387 | ||
8388 | #endif /* CONFIG_MAGIC_SYSRQ */ | |
1df5c10a LT |
8389 | |
8390 | #ifdef CONFIG_IA64 | |
8391 | /* | |
8392 | * These functions are only useful for the IA64 MCA handling. | |
8393 | * | |
8394 | * They can only be called when the whole system has been | |
8395 | * stopped - every CPU needs to be quiescent, and no scheduling | |
8396 | * activity can take place. Using them for anything else would | |
8397 | * be a serious bug, and as a result, they aren't even visible | |
8398 | * under any other configuration. | |
8399 | */ | |
8400 | ||
8401 | /** | |
8402 | * curr_task - return the current task for a given cpu. | |
8403 | * @cpu: the processor in question. | |
8404 | * | |
8405 | * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED! | |
8406 | */ | |
36c8b586 | 8407 | struct task_struct *curr_task(int cpu) |
1df5c10a LT |
8408 | { |
8409 | return cpu_curr(cpu); | |
8410 | } | |
8411 | ||
8412 | /** | |
8413 | * set_curr_task - set the current task for a given cpu. | |
8414 | * @cpu: the processor in question. | |
8415 | * @p: the task pointer to set. | |
8416 | * | |
8417 | * Description: This function must only be used when non-maskable interrupts | |
41a2d6cf IM |
8418 | * are serviced on a separate stack. It allows the architecture to switch the |
8419 | * notion of the current task on a cpu in a non-blocking manner. This function | |
1df5c10a LT |
8420 | * must be called with all CPU's synchronized, and interrupts disabled, the |
8421 | * and caller must save the original value of the current task (see | |
8422 | * curr_task() above) and restore that value before reenabling interrupts and | |
8423 | * re-starting the system. | |
8424 | * | |
8425 | * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED! | |
8426 | */ | |
36c8b586 | 8427 | void set_curr_task(int cpu, struct task_struct *p) |
1df5c10a LT |
8428 | { |
8429 | cpu_curr(cpu) = p; | |
8430 | } | |
8431 | ||
8432 | #endif | |
29f59db3 | 8433 | |
bccbe08a PZ |
8434 | #ifdef CONFIG_FAIR_GROUP_SCHED |
8435 | static void free_fair_sched_group(struct task_group *tg) | |
6f505b16 PZ |
8436 | { |
8437 | int i; | |
8438 | ||
8439 | for_each_possible_cpu(i) { | |
8440 | if (tg->cfs_rq) | |
8441 | kfree(tg->cfs_rq[i]); | |
8442 | if (tg->se) | |
8443 | kfree(tg->se[i]); | |
6f505b16 PZ |
8444 | } |
8445 | ||
8446 | kfree(tg->cfs_rq); | |
8447 | kfree(tg->se); | |
6f505b16 PZ |
8448 | } |
8449 | ||
ec7dc8ac DG |
8450 | static |
8451 | int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent) | |
29f59db3 | 8452 | { |
29f59db3 | 8453 | struct cfs_rq *cfs_rq; |
eab17229 | 8454 | struct sched_entity *se; |
9b5b7751 | 8455 | struct rq *rq; |
29f59db3 SV |
8456 | int i; |
8457 | ||
434d53b0 | 8458 | tg->cfs_rq = kzalloc(sizeof(cfs_rq) * nr_cpu_ids, GFP_KERNEL); |
29f59db3 SV |
8459 | if (!tg->cfs_rq) |
8460 | goto err; | |
434d53b0 | 8461 | tg->se = kzalloc(sizeof(se) * nr_cpu_ids, GFP_KERNEL); |
29f59db3 SV |
8462 | if (!tg->se) |
8463 | goto err; | |
052f1dc7 PZ |
8464 | |
8465 | tg->shares = NICE_0_LOAD; | |
29f59db3 SV |
8466 | |
8467 | for_each_possible_cpu(i) { | |
9b5b7751 | 8468 | rq = cpu_rq(i); |
29f59db3 | 8469 | |
eab17229 LZ |
8470 | cfs_rq = kzalloc_node(sizeof(struct cfs_rq), |
8471 | GFP_KERNEL, cpu_to_node(i)); | |
29f59db3 SV |
8472 | if (!cfs_rq) |
8473 | goto err; | |
8474 | ||
eab17229 LZ |
8475 | se = kzalloc_node(sizeof(struct sched_entity), |
8476 | GFP_KERNEL, cpu_to_node(i)); | |
29f59db3 SV |
8477 | if (!se) |
8478 | goto err; | |
8479 | ||
eab17229 | 8480 | init_tg_cfs_entry(tg, cfs_rq, se, i, 0, parent->se[i]); |
bccbe08a PZ |
8481 | } |
8482 | ||
8483 | return 1; | |
8484 | ||
8485 | err: | |
8486 | return 0; | |
8487 | } | |
8488 | ||
8489 | static inline void register_fair_sched_group(struct task_group *tg, int cpu) | |
8490 | { | |
8491 | list_add_rcu(&tg->cfs_rq[cpu]->leaf_cfs_rq_list, | |
8492 | &cpu_rq(cpu)->leaf_cfs_rq_list); | |
8493 | } | |
8494 | ||
8495 | static inline void unregister_fair_sched_group(struct task_group *tg, int cpu) | |
8496 | { | |
8497 | list_del_rcu(&tg->cfs_rq[cpu]->leaf_cfs_rq_list); | |
8498 | } | |
6d6bc0ad | 8499 | #else /* !CONFG_FAIR_GROUP_SCHED */ |
bccbe08a PZ |
8500 | static inline void free_fair_sched_group(struct task_group *tg) |
8501 | { | |
8502 | } | |
8503 | ||
ec7dc8ac DG |
8504 | static inline |
8505 | int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent) | |
bccbe08a PZ |
8506 | { |
8507 | return 1; | |
8508 | } | |
8509 | ||
8510 | static inline void register_fair_sched_group(struct task_group *tg, int cpu) | |
8511 | { | |
8512 | } | |
8513 | ||
8514 | static inline void unregister_fair_sched_group(struct task_group *tg, int cpu) | |
8515 | { | |
8516 | } | |
6d6bc0ad | 8517 | #endif /* CONFIG_FAIR_GROUP_SCHED */ |
052f1dc7 PZ |
8518 | |
8519 | #ifdef CONFIG_RT_GROUP_SCHED | |
bccbe08a PZ |
8520 | static void free_rt_sched_group(struct task_group *tg) |
8521 | { | |
8522 | int i; | |
8523 | ||
d0b27fa7 PZ |
8524 | destroy_rt_bandwidth(&tg->rt_bandwidth); |
8525 | ||
bccbe08a PZ |
8526 | for_each_possible_cpu(i) { |
8527 | if (tg->rt_rq) | |
8528 | kfree(tg->rt_rq[i]); | |
8529 | if (tg->rt_se) | |
8530 | kfree(tg->rt_se[i]); | |
8531 | } | |
8532 | ||
8533 | kfree(tg->rt_rq); | |
8534 | kfree(tg->rt_se); | |
8535 | } | |
8536 | ||
ec7dc8ac DG |
8537 | static |
8538 | int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent) | |
bccbe08a PZ |
8539 | { |
8540 | struct rt_rq *rt_rq; | |
eab17229 | 8541 | struct sched_rt_entity *rt_se; |
bccbe08a PZ |
8542 | struct rq *rq; |
8543 | int i; | |
8544 | ||
434d53b0 | 8545 | tg->rt_rq = kzalloc(sizeof(rt_rq) * nr_cpu_ids, GFP_KERNEL); |
bccbe08a PZ |
8546 | if (!tg->rt_rq) |
8547 | goto err; | |
434d53b0 | 8548 | tg->rt_se = kzalloc(sizeof(rt_se) * nr_cpu_ids, GFP_KERNEL); |
bccbe08a PZ |
8549 | if (!tg->rt_se) |
8550 | goto err; | |
8551 | ||
d0b27fa7 PZ |
8552 | init_rt_bandwidth(&tg->rt_bandwidth, |
8553 | ktime_to_ns(def_rt_bandwidth.rt_period), 0); | |
bccbe08a PZ |
8554 | |
8555 | for_each_possible_cpu(i) { | |
8556 | rq = cpu_rq(i); | |
8557 | ||
eab17229 LZ |
8558 | rt_rq = kzalloc_node(sizeof(struct rt_rq), |
8559 | GFP_KERNEL, cpu_to_node(i)); | |
6f505b16 PZ |
8560 | if (!rt_rq) |
8561 | goto err; | |
29f59db3 | 8562 | |
eab17229 LZ |
8563 | rt_se = kzalloc_node(sizeof(struct sched_rt_entity), |
8564 | GFP_KERNEL, cpu_to_node(i)); | |
6f505b16 PZ |
8565 | if (!rt_se) |
8566 | goto err; | |
29f59db3 | 8567 | |
eab17229 | 8568 | init_tg_rt_entry(tg, rt_rq, rt_se, i, 0, parent->rt_se[i]); |
29f59db3 SV |
8569 | } |
8570 | ||
bccbe08a PZ |
8571 | return 1; |
8572 | ||
8573 | err: | |
8574 | return 0; | |
8575 | } | |
8576 | ||
8577 | static inline void register_rt_sched_group(struct task_group *tg, int cpu) | |
8578 | { | |
8579 | list_add_rcu(&tg->rt_rq[cpu]->leaf_rt_rq_list, | |
8580 | &cpu_rq(cpu)->leaf_rt_rq_list); | |
8581 | } | |
8582 | ||
8583 | static inline void unregister_rt_sched_group(struct task_group *tg, int cpu) | |
8584 | { | |
8585 | list_del_rcu(&tg->rt_rq[cpu]->leaf_rt_rq_list); | |
8586 | } | |
6d6bc0ad | 8587 | #else /* !CONFIG_RT_GROUP_SCHED */ |
bccbe08a PZ |
8588 | static inline void free_rt_sched_group(struct task_group *tg) |
8589 | { | |
8590 | } | |
8591 | ||
ec7dc8ac DG |
8592 | static inline |
8593 | int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent) | |
bccbe08a PZ |
8594 | { |
8595 | return 1; | |
8596 | } | |
8597 | ||
8598 | static inline void register_rt_sched_group(struct task_group *tg, int cpu) | |
8599 | { | |
8600 | } | |
8601 | ||
8602 | static inline void unregister_rt_sched_group(struct task_group *tg, int cpu) | |
8603 | { | |
8604 | } | |
6d6bc0ad | 8605 | #endif /* CONFIG_RT_GROUP_SCHED */ |
bccbe08a | 8606 | |
d0b27fa7 | 8607 | #ifdef CONFIG_GROUP_SCHED |
bccbe08a PZ |
8608 | static void free_sched_group(struct task_group *tg) |
8609 | { | |
8610 | free_fair_sched_group(tg); | |
8611 | free_rt_sched_group(tg); | |
8612 | kfree(tg); | |
8613 | } | |
8614 | ||
8615 | /* allocate runqueue etc for a new task group */ | |
ec7dc8ac | 8616 | struct task_group *sched_create_group(struct task_group *parent) |
bccbe08a PZ |
8617 | { |
8618 | struct task_group *tg; | |
8619 | unsigned long flags; | |
8620 | int i; | |
8621 | ||
8622 | tg = kzalloc(sizeof(*tg), GFP_KERNEL); | |
8623 | if (!tg) | |
8624 | return ERR_PTR(-ENOMEM); | |
8625 | ||
ec7dc8ac | 8626 | if (!alloc_fair_sched_group(tg, parent)) |
bccbe08a PZ |
8627 | goto err; |
8628 | ||
ec7dc8ac | 8629 | if (!alloc_rt_sched_group(tg, parent)) |
bccbe08a PZ |
8630 | goto err; |
8631 | ||
8ed36996 | 8632 | spin_lock_irqsave(&task_group_lock, flags); |
9b5b7751 | 8633 | for_each_possible_cpu(i) { |
bccbe08a PZ |
8634 | register_fair_sched_group(tg, i); |
8635 | register_rt_sched_group(tg, i); | |
9b5b7751 | 8636 | } |
6f505b16 | 8637 | list_add_rcu(&tg->list, &task_groups); |
f473aa5e PZ |
8638 | |
8639 | WARN_ON(!parent); /* root should already exist */ | |
8640 | ||
8641 | tg->parent = parent; | |
f473aa5e | 8642 | INIT_LIST_HEAD(&tg->children); |
09f2724a | 8643 | list_add_rcu(&tg->siblings, &parent->children); |
8ed36996 | 8644 | spin_unlock_irqrestore(&task_group_lock, flags); |
29f59db3 | 8645 | |
9b5b7751 | 8646 | return tg; |
29f59db3 SV |
8647 | |
8648 | err: | |
6f505b16 | 8649 | free_sched_group(tg); |
29f59db3 SV |
8650 | return ERR_PTR(-ENOMEM); |
8651 | } | |
8652 | ||
9b5b7751 | 8653 | /* rcu callback to free various structures associated with a task group */ |
6f505b16 | 8654 | static void free_sched_group_rcu(struct rcu_head *rhp) |
29f59db3 | 8655 | { |
29f59db3 | 8656 | /* now it should be safe to free those cfs_rqs */ |
6f505b16 | 8657 | free_sched_group(container_of(rhp, struct task_group, rcu)); |
29f59db3 SV |
8658 | } |
8659 | ||
9b5b7751 | 8660 | /* Destroy runqueue etc associated with a task group */ |
4cf86d77 | 8661 | void sched_destroy_group(struct task_group *tg) |
29f59db3 | 8662 | { |
8ed36996 | 8663 | unsigned long flags; |
9b5b7751 | 8664 | int i; |
29f59db3 | 8665 | |
8ed36996 | 8666 | spin_lock_irqsave(&task_group_lock, flags); |
9b5b7751 | 8667 | for_each_possible_cpu(i) { |
bccbe08a PZ |
8668 | unregister_fair_sched_group(tg, i); |
8669 | unregister_rt_sched_group(tg, i); | |
9b5b7751 | 8670 | } |
6f505b16 | 8671 | list_del_rcu(&tg->list); |
f473aa5e | 8672 | list_del_rcu(&tg->siblings); |
8ed36996 | 8673 | spin_unlock_irqrestore(&task_group_lock, flags); |
9b5b7751 | 8674 | |
9b5b7751 | 8675 | /* wait for possible concurrent references to cfs_rqs complete */ |
6f505b16 | 8676 | call_rcu(&tg->rcu, free_sched_group_rcu); |
29f59db3 SV |
8677 | } |
8678 | ||
9b5b7751 | 8679 | /* change task's runqueue when it moves between groups. |
3a252015 IM |
8680 | * The caller of this function should have put the task in its new group |
8681 | * by now. This function just updates tsk->se.cfs_rq and tsk->se.parent to | |
8682 | * reflect its new group. | |
9b5b7751 SV |
8683 | */ |
8684 | void sched_move_task(struct task_struct *tsk) | |
29f59db3 SV |
8685 | { |
8686 | int on_rq, running; | |
8687 | unsigned long flags; | |
8688 | struct rq *rq; | |
8689 | ||
8690 | rq = task_rq_lock(tsk, &flags); | |
8691 | ||
29f59db3 SV |
8692 | update_rq_clock(rq); |
8693 | ||
051a1d1a | 8694 | running = task_current(rq, tsk); |
29f59db3 SV |
8695 | on_rq = tsk->se.on_rq; |
8696 | ||
0e1f3483 | 8697 | if (on_rq) |
29f59db3 | 8698 | dequeue_task(rq, tsk, 0); |
0e1f3483 HS |
8699 | if (unlikely(running)) |
8700 | tsk->sched_class->put_prev_task(rq, tsk); | |
29f59db3 | 8701 | |
6f505b16 | 8702 | set_task_rq(tsk, task_cpu(tsk)); |
29f59db3 | 8703 | |
810b3817 PZ |
8704 | #ifdef CONFIG_FAIR_GROUP_SCHED |
8705 | if (tsk->sched_class->moved_group) | |
8706 | tsk->sched_class->moved_group(tsk); | |
8707 | #endif | |
8708 | ||
0e1f3483 HS |
8709 | if (unlikely(running)) |
8710 | tsk->sched_class->set_curr_task(rq); | |
8711 | if (on_rq) | |
7074badb | 8712 | enqueue_task(rq, tsk, 0); |
29f59db3 | 8713 | |
29f59db3 SV |
8714 | task_rq_unlock(rq, &flags); |
8715 | } | |
6d6bc0ad | 8716 | #endif /* CONFIG_GROUP_SCHED */ |
29f59db3 | 8717 | |
052f1dc7 | 8718 | #ifdef CONFIG_FAIR_GROUP_SCHED |
c09595f6 | 8719 | static void __set_se_shares(struct sched_entity *se, unsigned long shares) |
29f59db3 SV |
8720 | { |
8721 | struct cfs_rq *cfs_rq = se->cfs_rq; | |
29f59db3 SV |
8722 | int on_rq; |
8723 | ||
29f59db3 | 8724 | on_rq = se->on_rq; |
62fb1851 | 8725 | if (on_rq) |
29f59db3 SV |
8726 | dequeue_entity(cfs_rq, se, 0); |
8727 | ||
8728 | se->load.weight = shares; | |
e05510d0 | 8729 | se->load.inv_weight = 0; |
29f59db3 | 8730 | |
62fb1851 | 8731 | if (on_rq) |
29f59db3 | 8732 | enqueue_entity(cfs_rq, se, 0); |
c09595f6 | 8733 | } |
62fb1851 | 8734 | |
c09595f6 PZ |
8735 | static void set_se_shares(struct sched_entity *se, unsigned long shares) |
8736 | { | |
8737 | struct cfs_rq *cfs_rq = se->cfs_rq; | |
8738 | struct rq *rq = cfs_rq->rq; | |
8739 | unsigned long flags; | |
8740 | ||
8741 | spin_lock_irqsave(&rq->lock, flags); | |
8742 | __set_se_shares(se, shares); | |
8743 | spin_unlock_irqrestore(&rq->lock, flags); | |
29f59db3 SV |
8744 | } |
8745 | ||
8ed36996 PZ |
8746 | static DEFINE_MUTEX(shares_mutex); |
8747 | ||
4cf86d77 | 8748 | int sched_group_set_shares(struct task_group *tg, unsigned long shares) |
29f59db3 SV |
8749 | { |
8750 | int i; | |
8ed36996 | 8751 | unsigned long flags; |
c61935fd | 8752 | |
ec7dc8ac DG |
8753 | /* |
8754 | * We can't change the weight of the root cgroup. | |
8755 | */ | |
8756 | if (!tg->se[0]) | |
8757 | return -EINVAL; | |
8758 | ||
18d95a28 PZ |
8759 | if (shares < MIN_SHARES) |
8760 | shares = MIN_SHARES; | |
cb4ad1ff MX |
8761 | else if (shares > MAX_SHARES) |
8762 | shares = MAX_SHARES; | |
62fb1851 | 8763 | |
8ed36996 | 8764 | mutex_lock(&shares_mutex); |
9b5b7751 | 8765 | if (tg->shares == shares) |
5cb350ba | 8766 | goto done; |
29f59db3 | 8767 | |
8ed36996 | 8768 | spin_lock_irqsave(&task_group_lock, flags); |
bccbe08a PZ |
8769 | for_each_possible_cpu(i) |
8770 | unregister_fair_sched_group(tg, i); | |
f473aa5e | 8771 | list_del_rcu(&tg->siblings); |
8ed36996 | 8772 | spin_unlock_irqrestore(&task_group_lock, flags); |
6b2d7700 SV |
8773 | |
8774 | /* wait for any ongoing reference to this group to finish */ | |
8775 | synchronize_sched(); | |
8776 | ||
8777 | /* | |
8778 | * Now we are free to modify the group's share on each cpu | |
8779 | * w/o tripping rebalance_share or load_balance_fair. | |
8780 | */ | |
9b5b7751 | 8781 | tg->shares = shares; |
c09595f6 PZ |
8782 | for_each_possible_cpu(i) { |
8783 | /* | |
8784 | * force a rebalance | |
8785 | */ | |
8786 | cfs_rq_set_shares(tg->cfs_rq[i], 0); | |
cb4ad1ff | 8787 | set_se_shares(tg->se[i], shares); |
c09595f6 | 8788 | } |
29f59db3 | 8789 | |
6b2d7700 SV |
8790 | /* |
8791 | * Enable load balance activity on this group, by inserting it back on | |
8792 | * each cpu's rq->leaf_cfs_rq_list. | |
8793 | */ | |
8ed36996 | 8794 | spin_lock_irqsave(&task_group_lock, flags); |
bccbe08a PZ |
8795 | for_each_possible_cpu(i) |
8796 | register_fair_sched_group(tg, i); | |
f473aa5e | 8797 | list_add_rcu(&tg->siblings, &tg->parent->children); |
8ed36996 | 8798 | spin_unlock_irqrestore(&task_group_lock, flags); |
5cb350ba | 8799 | done: |
8ed36996 | 8800 | mutex_unlock(&shares_mutex); |
9b5b7751 | 8801 | return 0; |
29f59db3 SV |
8802 | } |
8803 | ||
5cb350ba DG |
8804 | unsigned long sched_group_shares(struct task_group *tg) |
8805 | { | |
8806 | return tg->shares; | |
8807 | } | |
052f1dc7 | 8808 | #endif |
5cb350ba | 8809 | |
052f1dc7 | 8810 | #ifdef CONFIG_RT_GROUP_SCHED |
6f505b16 | 8811 | /* |
9f0c1e56 | 8812 | * Ensure that the real time constraints are schedulable. |
6f505b16 | 8813 | */ |
9f0c1e56 PZ |
8814 | static DEFINE_MUTEX(rt_constraints_mutex); |
8815 | ||
8816 | static unsigned long to_ratio(u64 period, u64 runtime) | |
8817 | { | |
8818 | if (runtime == RUNTIME_INF) | |
9a7e0b18 | 8819 | return 1ULL << 20; |
9f0c1e56 | 8820 | |
9a7e0b18 | 8821 | return div64_u64(runtime << 20, period); |
9f0c1e56 PZ |
8822 | } |
8823 | ||
9a7e0b18 PZ |
8824 | /* Must be called with tasklist_lock held */ |
8825 | static inline int tg_has_rt_tasks(struct task_group *tg) | |
b40b2e8e | 8826 | { |
9a7e0b18 | 8827 | struct task_struct *g, *p; |
b40b2e8e | 8828 | |
9a7e0b18 PZ |
8829 | do_each_thread(g, p) { |
8830 | if (rt_task(p) && rt_rq_of_se(&p->rt)->tg == tg) | |
8831 | return 1; | |
8832 | } while_each_thread(g, p); | |
b40b2e8e | 8833 | |
9a7e0b18 PZ |
8834 | return 0; |
8835 | } | |
b40b2e8e | 8836 | |
9a7e0b18 PZ |
8837 | struct rt_schedulable_data { |
8838 | struct task_group *tg; | |
8839 | u64 rt_period; | |
8840 | u64 rt_runtime; | |
8841 | }; | |
b40b2e8e | 8842 | |
9a7e0b18 PZ |
8843 | static int tg_schedulable(struct task_group *tg, void *data) |
8844 | { | |
8845 | struct rt_schedulable_data *d = data; | |
8846 | struct task_group *child; | |
8847 | unsigned long total, sum = 0; | |
8848 | u64 period, runtime; | |
b40b2e8e | 8849 | |
9a7e0b18 PZ |
8850 | period = ktime_to_ns(tg->rt_bandwidth.rt_period); |
8851 | runtime = tg->rt_bandwidth.rt_runtime; | |
b40b2e8e | 8852 | |
9a7e0b18 PZ |
8853 | if (tg == d->tg) { |
8854 | period = d->rt_period; | |
8855 | runtime = d->rt_runtime; | |
b40b2e8e | 8856 | } |
b40b2e8e | 8857 | |
4653f803 PZ |
8858 | /* |
8859 | * Cannot have more runtime than the period. | |
8860 | */ | |
8861 | if (runtime > period && runtime != RUNTIME_INF) | |
8862 | return -EINVAL; | |
6f505b16 | 8863 | |
4653f803 PZ |
8864 | /* |
8865 | * Ensure we don't starve existing RT tasks. | |
8866 | */ | |
9a7e0b18 PZ |
8867 | if (rt_bandwidth_enabled() && !runtime && tg_has_rt_tasks(tg)) |
8868 | return -EBUSY; | |
6f505b16 | 8869 | |
9a7e0b18 | 8870 | total = to_ratio(period, runtime); |
6f505b16 | 8871 | |
4653f803 PZ |
8872 | /* |
8873 | * Nobody can have more than the global setting allows. | |
8874 | */ | |
8875 | if (total > to_ratio(global_rt_period(), global_rt_runtime())) | |
8876 | return -EINVAL; | |
6f505b16 | 8877 | |
4653f803 PZ |
8878 | /* |
8879 | * The sum of our children's runtime should not exceed our own. | |
8880 | */ | |
9a7e0b18 PZ |
8881 | list_for_each_entry_rcu(child, &tg->children, siblings) { |
8882 | period = ktime_to_ns(child->rt_bandwidth.rt_period); | |
8883 | runtime = child->rt_bandwidth.rt_runtime; | |
6f505b16 | 8884 | |
9a7e0b18 PZ |
8885 | if (child == d->tg) { |
8886 | period = d->rt_period; | |
8887 | runtime = d->rt_runtime; | |
8888 | } | |
6f505b16 | 8889 | |
9a7e0b18 | 8890 | sum += to_ratio(period, runtime); |
9f0c1e56 | 8891 | } |
6f505b16 | 8892 | |
9a7e0b18 PZ |
8893 | if (sum > total) |
8894 | return -EINVAL; | |
8895 | ||
8896 | return 0; | |
6f505b16 PZ |
8897 | } |
8898 | ||
9a7e0b18 | 8899 | static int __rt_schedulable(struct task_group *tg, u64 period, u64 runtime) |
521f1a24 | 8900 | { |
9a7e0b18 PZ |
8901 | struct rt_schedulable_data data = { |
8902 | .tg = tg, | |
8903 | .rt_period = period, | |
8904 | .rt_runtime = runtime, | |
8905 | }; | |
8906 | ||
8907 | return walk_tg_tree(tg_schedulable, tg_nop, &data); | |
521f1a24 DG |
8908 | } |
8909 | ||
d0b27fa7 PZ |
8910 | static int tg_set_bandwidth(struct task_group *tg, |
8911 | u64 rt_period, u64 rt_runtime) | |
6f505b16 | 8912 | { |
ac086bc2 | 8913 | int i, err = 0; |
9f0c1e56 | 8914 | |
9f0c1e56 | 8915 | mutex_lock(&rt_constraints_mutex); |
521f1a24 | 8916 | read_lock(&tasklist_lock); |
9a7e0b18 PZ |
8917 | err = __rt_schedulable(tg, rt_period, rt_runtime); |
8918 | if (err) | |
9f0c1e56 | 8919 | goto unlock; |
ac086bc2 PZ |
8920 | |
8921 | spin_lock_irq(&tg->rt_bandwidth.rt_runtime_lock); | |
d0b27fa7 PZ |
8922 | tg->rt_bandwidth.rt_period = ns_to_ktime(rt_period); |
8923 | tg->rt_bandwidth.rt_runtime = rt_runtime; | |
ac086bc2 PZ |
8924 | |
8925 | for_each_possible_cpu(i) { | |
8926 | struct rt_rq *rt_rq = tg->rt_rq[i]; | |
8927 | ||
8928 | spin_lock(&rt_rq->rt_runtime_lock); | |
8929 | rt_rq->rt_runtime = rt_runtime; | |
8930 | spin_unlock(&rt_rq->rt_runtime_lock); | |
8931 | } | |
8932 | spin_unlock_irq(&tg->rt_bandwidth.rt_runtime_lock); | |
9f0c1e56 | 8933 | unlock: |
521f1a24 | 8934 | read_unlock(&tasklist_lock); |
9f0c1e56 PZ |
8935 | mutex_unlock(&rt_constraints_mutex); |
8936 | ||
8937 | return err; | |
6f505b16 PZ |
8938 | } |
8939 | ||
d0b27fa7 PZ |
8940 | int sched_group_set_rt_runtime(struct task_group *tg, long rt_runtime_us) |
8941 | { | |
8942 | u64 rt_runtime, rt_period; | |
8943 | ||
8944 | rt_period = ktime_to_ns(tg->rt_bandwidth.rt_period); | |
8945 | rt_runtime = (u64)rt_runtime_us * NSEC_PER_USEC; | |
8946 | if (rt_runtime_us < 0) | |
8947 | rt_runtime = RUNTIME_INF; | |
8948 | ||
8949 | return tg_set_bandwidth(tg, rt_period, rt_runtime); | |
8950 | } | |
8951 | ||
9f0c1e56 PZ |
8952 | long sched_group_rt_runtime(struct task_group *tg) |
8953 | { | |
8954 | u64 rt_runtime_us; | |
8955 | ||
d0b27fa7 | 8956 | if (tg->rt_bandwidth.rt_runtime == RUNTIME_INF) |
9f0c1e56 PZ |
8957 | return -1; |
8958 | ||
d0b27fa7 | 8959 | rt_runtime_us = tg->rt_bandwidth.rt_runtime; |
9f0c1e56 PZ |
8960 | do_div(rt_runtime_us, NSEC_PER_USEC); |
8961 | return rt_runtime_us; | |
8962 | } | |
d0b27fa7 PZ |
8963 | |
8964 | int sched_group_set_rt_period(struct task_group *tg, long rt_period_us) | |
8965 | { | |
8966 | u64 rt_runtime, rt_period; | |
8967 | ||
8968 | rt_period = (u64)rt_period_us * NSEC_PER_USEC; | |
8969 | rt_runtime = tg->rt_bandwidth.rt_runtime; | |
8970 | ||
619b0488 R |
8971 | if (rt_period == 0) |
8972 | return -EINVAL; | |
8973 | ||
d0b27fa7 PZ |
8974 | return tg_set_bandwidth(tg, rt_period, rt_runtime); |
8975 | } | |
8976 | ||
8977 | long sched_group_rt_period(struct task_group *tg) | |
8978 | { | |
8979 | u64 rt_period_us; | |
8980 | ||
8981 | rt_period_us = ktime_to_ns(tg->rt_bandwidth.rt_period); | |
8982 | do_div(rt_period_us, NSEC_PER_USEC); | |
8983 | return rt_period_us; | |
8984 | } | |
8985 | ||
8986 | static int sched_rt_global_constraints(void) | |
8987 | { | |
4653f803 | 8988 | u64 runtime, period; |
d0b27fa7 PZ |
8989 | int ret = 0; |
8990 | ||
ec5d4989 HS |
8991 | if (sysctl_sched_rt_period <= 0) |
8992 | return -EINVAL; | |
8993 | ||
4653f803 PZ |
8994 | runtime = global_rt_runtime(); |
8995 | period = global_rt_period(); | |
8996 | ||
8997 | /* | |
8998 | * Sanity check on the sysctl variables. | |
8999 | */ | |
9000 | if (runtime > period && runtime != RUNTIME_INF) | |
9001 | return -EINVAL; | |
10b612f4 | 9002 | |
d0b27fa7 | 9003 | mutex_lock(&rt_constraints_mutex); |
9a7e0b18 | 9004 | read_lock(&tasklist_lock); |
4653f803 | 9005 | ret = __rt_schedulable(NULL, 0, 0); |
9a7e0b18 | 9006 | read_unlock(&tasklist_lock); |
d0b27fa7 PZ |
9007 | mutex_unlock(&rt_constraints_mutex); |
9008 | ||
9009 | return ret; | |
9010 | } | |
6d6bc0ad | 9011 | #else /* !CONFIG_RT_GROUP_SCHED */ |
d0b27fa7 PZ |
9012 | static int sched_rt_global_constraints(void) |
9013 | { | |
ac086bc2 PZ |
9014 | unsigned long flags; |
9015 | int i; | |
9016 | ||
ec5d4989 HS |
9017 | if (sysctl_sched_rt_period <= 0) |
9018 | return -EINVAL; | |
9019 | ||
ac086bc2 PZ |
9020 | spin_lock_irqsave(&def_rt_bandwidth.rt_runtime_lock, flags); |
9021 | for_each_possible_cpu(i) { | |
9022 | struct rt_rq *rt_rq = &cpu_rq(i)->rt; | |
9023 | ||
9024 | spin_lock(&rt_rq->rt_runtime_lock); | |
9025 | rt_rq->rt_runtime = global_rt_runtime(); | |
9026 | spin_unlock(&rt_rq->rt_runtime_lock); | |
9027 | } | |
9028 | spin_unlock_irqrestore(&def_rt_bandwidth.rt_runtime_lock, flags); | |
9029 | ||
d0b27fa7 PZ |
9030 | return 0; |
9031 | } | |
6d6bc0ad | 9032 | #endif /* CONFIG_RT_GROUP_SCHED */ |
d0b27fa7 PZ |
9033 | |
9034 | int sched_rt_handler(struct ctl_table *table, int write, | |
9035 | struct file *filp, void __user *buffer, size_t *lenp, | |
9036 | loff_t *ppos) | |
9037 | { | |
9038 | int ret; | |
9039 | int old_period, old_runtime; | |
9040 | static DEFINE_MUTEX(mutex); | |
9041 | ||
9042 | mutex_lock(&mutex); | |
9043 | old_period = sysctl_sched_rt_period; | |
9044 | old_runtime = sysctl_sched_rt_runtime; | |
9045 | ||
9046 | ret = proc_dointvec(table, write, filp, buffer, lenp, ppos); | |
9047 | ||
9048 | if (!ret && write) { | |
9049 | ret = sched_rt_global_constraints(); | |
9050 | if (ret) { | |
9051 | sysctl_sched_rt_period = old_period; | |
9052 | sysctl_sched_rt_runtime = old_runtime; | |
9053 | } else { | |
9054 | def_rt_bandwidth.rt_runtime = global_rt_runtime(); | |
9055 | def_rt_bandwidth.rt_period = | |
9056 | ns_to_ktime(global_rt_period()); | |
9057 | } | |
9058 | } | |
9059 | mutex_unlock(&mutex); | |
9060 | ||
9061 | return ret; | |
9062 | } | |
68318b8e | 9063 | |
052f1dc7 | 9064 | #ifdef CONFIG_CGROUP_SCHED |
68318b8e SV |
9065 | |
9066 | /* return corresponding task_group object of a cgroup */ | |
2b01dfe3 | 9067 | static inline struct task_group *cgroup_tg(struct cgroup *cgrp) |
68318b8e | 9068 | { |
2b01dfe3 PM |
9069 | return container_of(cgroup_subsys_state(cgrp, cpu_cgroup_subsys_id), |
9070 | struct task_group, css); | |
68318b8e SV |
9071 | } |
9072 | ||
9073 | static struct cgroup_subsys_state * | |
2b01dfe3 | 9074 | cpu_cgroup_create(struct cgroup_subsys *ss, struct cgroup *cgrp) |
68318b8e | 9075 | { |
ec7dc8ac | 9076 | struct task_group *tg, *parent; |
68318b8e | 9077 | |
2b01dfe3 | 9078 | if (!cgrp->parent) { |
68318b8e | 9079 | /* This is early initialization for the top cgroup */ |
68318b8e SV |
9080 | return &init_task_group.css; |
9081 | } | |
9082 | ||
ec7dc8ac DG |
9083 | parent = cgroup_tg(cgrp->parent); |
9084 | tg = sched_create_group(parent); | |
68318b8e SV |
9085 | if (IS_ERR(tg)) |
9086 | return ERR_PTR(-ENOMEM); | |
9087 | ||
68318b8e SV |
9088 | return &tg->css; |
9089 | } | |
9090 | ||
41a2d6cf IM |
9091 | static void |
9092 | cpu_cgroup_destroy(struct cgroup_subsys *ss, struct cgroup *cgrp) | |
68318b8e | 9093 | { |
2b01dfe3 | 9094 | struct task_group *tg = cgroup_tg(cgrp); |
68318b8e SV |
9095 | |
9096 | sched_destroy_group(tg); | |
9097 | } | |
9098 | ||
41a2d6cf IM |
9099 | static int |
9100 | cpu_cgroup_can_attach(struct cgroup_subsys *ss, struct cgroup *cgrp, | |
9101 | struct task_struct *tsk) | |
68318b8e | 9102 | { |
b68aa230 PZ |
9103 | #ifdef CONFIG_RT_GROUP_SCHED |
9104 | /* Don't accept realtime tasks when there is no way for them to run */ | |
d0b27fa7 | 9105 | if (rt_task(tsk) && cgroup_tg(cgrp)->rt_bandwidth.rt_runtime == 0) |
b68aa230 PZ |
9106 | return -EINVAL; |
9107 | #else | |
68318b8e SV |
9108 | /* We don't support RT-tasks being in separate groups */ |
9109 | if (tsk->sched_class != &fair_sched_class) | |
9110 | return -EINVAL; | |
b68aa230 | 9111 | #endif |
68318b8e SV |
9112 | |
9113 | return 0; | |
9114 | } | |
9115 | ||
9116 | static void | |
2b01dfe3 | 9117 | cpu_cgroup_attach(struct cgroup_subsys *ss, struct cgroup *cgrp, |
68318b8e SV |
9118 | struct cgroup *old_cont, struct task_struct *tsk) |
9119 | { | |
9120 | sched_move_task(tsk); | |
9121 | } | |
9122 | ||
052f1dc7 | 9123 | #ifdef CONFIG_FAIR_GROUP_SCHED |
f4c753b7 | 9124 | static int cpu_shares_write_u64(struct cgroup *cgrp, struct cftype *cftype, |
2b01dfe3 | 9125 | u64 shareval) |
68318b8e | 9126 | { |
2b01dfe3 | 9127 | return sched_group_set_shares(cgroup_tg(cgrp), shareval); |
68318b8e SV |
9128 | } |
9129 | ||
f4c753b7 | 9130 | static u64 cpu_shares_read_u64(struct cgroup *cgrp, struct cftype *cft) |
68318b8e | 9131 | { |
2b01dfe3 | 9132 | struct task_group *tg = cgroup_tg(cgrp); |
68318b8e SV |
9133 | |
9134 | return (u64) tg->shares; | |
9135 | } | |
6d6bc0ad | 9136 | #endif /* CONFIG_FAIR_GROUP_SCHED */ |
68318b8e | 9137 | |
052f1dc7 | 9138 | #ifdef CONFIG_RT_GROUP_SCHED |
0c70814c | 9139 | static int cpu_rt_runtime_write(struct cgroup *cgrp, struct cftype *cft, |
06ecb27c | 9140 | s64 val) |
6f505b16 | 9141 | { |
06ecb27c | 9142 | return sched_group_set_rt_runtime(cgroup_tg(cgrp), val); |
6f505b16 PZ |
9143 | } |
9144 | ||
06ecb27c | 9145 | static s64 cpu_rt_runtime_read(struct cgroup *cgrp, struct cftype *cft) |
6f505b16 | 9146 | { |
06ecb27c | 9147 | return sched_group_rt_runtime(cgroup_tg(cgrp)); |
6f505b16 | 9148 | } |
d0b27fa7 PZ |
9149 | |
9150 | static int cpu_rt_period_write_uint(struct cgroup *cgrp, struct cftype *cftype, | |
9151 | u64 rt_period_us) | |
9152 | { | |
9153 | return sched_group_set_rt_period(cgroup_tg(cgrp), rt_period_us); | |
9154 | } | |
9155 | ||
9156 | static u64 cpu_rt_period_read_uint(struct cgroup *cgrp, struct cftype *cft) | |
9157 | { | |
9158 | return sched_group_rt_period(cgroup_tg(cgrp)); | |
9159 | } | |
6d6bc0ad | 9160 | #endif /* CONFIG_RT_GROUP_SCHED */ |
6f505b16 | 9161 | |
fe5c7cc2 | 9162 | static struct cftype cpu_files[] = { |
052f1dc7 | 9163 | #ifdef CONFIG_FAIR_GROUP_SCHED |
fe5c7cc2 PM |
9164 | { |
9165 | .name = "shares", | |
f4c753b7 PM |
9166 | .read_u64 = cpu_shares_read_u64, |
9167 | .write_u64 = cpu_shares_write_u64, | |
fe5c7cc2 | 9168 | }, |
052f1dc7 PZ |
9169 | #endif |
9170 | #ifdef CONFIG_RT_GROUP_SCHED | |
6f505b16 | 9171 | { |
9f0c1e56 | 9172 | .name = "rt_runtime_us", |
06ecb27c PM |
9173 | .read_s64 = cpu_rt_runtime_read, |
9174 | .write_s64 = cpu_rt_runtime_write, | |
6f505b16 | 9175 | }, |
d0b27fa7 PZ |
9176 | { |
9177 | .name = "rt_period_us", | |
f4c753b7 PM |
9178 | .read_u64 = cpu_rt_period_read_uint, |
9179 | .write_u64 = cpu_rt_period_write_uint, | |
d0b27fa7 | 9180 | }, |
052f1dc7 | 9181 | #endif |
68318b8e SV |
9182 | }; |
9183 | ||
9184 | static int cpu_cgroup_populate(struct cgroup_subsys *ss, struct cgroup *cont) | |
9185 | { | |
fe5c7cc2 | 9186 | return cgroup_add_files(cont, ss, cpu_files, ARRAY_SIZE(cpu_files)); |
68318b8e SV |
9187 | } |
9188 | ||
9189 | struct cgroup_subsys cpu_cgroup_subsys = { | |
38605cae IM |
9190 | .name = "cpu", |
9191 | .create = cpu_cgroup_create, | |
9192 | .destroy = cpu_cgroup_destroy, | |
9193 | .can_attach = cpu_cgroup_can_attach, | |
9194 | .attach = cpu_cgroup_attach, | |
9195 | .populate = cpu_cgroup_populate, | |
9196 | .subsys_id = cpu_cgroup_subsys_id, | |
68318b8e SV |
9197 | .early_init = 1, |
9198 | }; | |
9199 | ||
052f1dc7 | 9200 | #endif /* CONFIG_CGROUP_SCHED */ |
d842de87 SV |
9201 | |
9202 | #ifdef CONFIG_CGROUP_CPUACCT | |
9203 | ||
9204 | /* | |
9205 | * CPU accounting code for task groups. | |
9206 | * | |
9207 | * Based on the work by Paul Menage (menage@google.com) and Balbir Singh | |
9208 | * (balbir@in.ibm.com). | |
9209 | */ | |
9210 | ||
934352f2 | 9211 | /* track cpu usage of a group of tasks and its child groups */ |
d842de87 SV |
9212 | struct cpuacct { |
9213 | struct cgroup_subsys_state css; | |
9214 | /* cpuusage holds pointer to a u64-type object on every cpu */ | |
9215 | u64 *cpuusage; | |
934352f2 | 9216 | struct cpuacct *parent; |
d842de87 SV |
9217 | }; |
9218 | ||
9219 | struct cgroup_subsys cpuacct_subsys; | |
9220 | ||
9221 | /* return cpu accounting group corresponding to this container */ | |
32cd756a | 9222 | static inline struct cpuacct *cgroup_ca(struct cgroup *cgrp) |
d842de87 | 9223 | { |
32cd756a | 9224 | return container_of(cgroup_subsys_state(cgrp, cpuacct_subsys_id), |
d842de87 SV |
9225 | struct cpuacct, css); |
9226 | } | |
9227 | ||
9228 | /* return cpu accounting group to which this task belongs */ | |
9229 | static inline struct cpuacct *task_ca(struct task_struct *tsk) | |
9230 | { | |
9231 | return container_of(task_subsys_state(tsk, cpuacct_subsys_id), | |
9232 | struct cpuacct, css); | |
9233 | } | |
9234 | ||
9235 | /* create a new cpu accounting group */ | |
9236 | static struct cgroup_subsys_state *cpuacct_create( | |
32cd756a | 9237 | struct cgroup_subsys *ss, struct cgroup *cgrp) |
d842de87 SV |
9238 | { |
9239 | struct cpuacct *ca = kzalloc(sizeof(*ca), GFP_KERNEL); | |
9240 | ||
9241 | if (!ca) | |
9242 | return ERR_PTR(-ENOMEM); | |
9243 | ||
9244 | ca->cpuusage = alloc_percpu(u64); | |
9245 | if (!ca->cpuusage) { | |
9246 | kfree(ca); | |
9247 | return ERR_PTR(-ENOMEM); | |
9248 | } | |
9249 | ||
934352f2 BR |
9250 | if (cgrp->parent) |
9251 | ca->parent = cgroup_ca(cgrp->parent); | |
9252 | ||
d842de87 SV |
9253 | return &ca->css; |
9254 | } | |
9255 | ||
9256 | /* destroy an existing cpu accounting group */ | |
41a2d6cf | 9257 | static void |
32cd756a | 9258 | cpuacct_destroy(struct cgroup_subsys *ss, struct cgroup *cgrp) |
d842de87 | 9259 | { |
32cd756a | 9260 | struct cpuacct *ca = cgroup_ca(cgrp); |
d842de87 SV |
9261 | |
9262 | free_percpu(ca->cpuusage); | |
9263 | kfree(ca); | |
9264 | } | |
9265 | ||
9266 | /* return total cpu usage (in nanoseconds) of a group */ | |
32cd756a | 9267 | static u64 cpuusage_read(struct cgroup *cgrp, struct cftype *cft) |
d842de87 | 9268 | { |
32cd756a | 9269 | struct cpuacct *ca = cgroup_ca(cgrp); |
d842de87 SV |
9270 | u64 totalcpuusage = 0; |
9271 | int i; | |
9272 | ||
9273 | for_each_possible_cpu(i) { | |
9274 | u64 *cpuusage = percpu_ptr(ca->cpuusage, i); | |
9275 | ||
9276 | /* | |
9277 | * Take rq->lock to make 64-bit addition safe on 32-bit | |
9278 | * platforms. | |
9279 | */ | |
9280 | spin_lock_irq(&cpu_rq(i)->lock); | |
9281 | totalcpuusage += *cpuusage; | |
9282 | spin_unlock_irq(&cpu_rq(i)->lock); | |
9283 | } | |
9284 | ||
9285 | return totalcpuusage; | |
9286 | } | |
9287 | ||
0297b803 DG |
9288 | static int cpuusage_write(struct cgroup *cgrp, struct cftype *cftype, |
9289 | u64 reset) | |
9290 | { | |
9291 | struct cpuacct *ca = cgroup_ca(cgrp); | |
9292 | int err = 0; | |
9293 | int i; | |
9294 | ||
9295 | if (reset) { | |
9296 | err = -EINVAL; | |
9297 | goto out; | |
9298 | } | |
9299 | ||
9300 | for_each_possible_cpu(i) { | |
9301 | u64 *cpuusage = percpu_ptr(ca->cpuusage, i); | |
9302 | ||
9303 | spin_lock_irq(&cpu_rq(i)->lock); | |
9304 | *cpuusage = 0; | |
9305 | spin_unlock_irq(&cpu_rq(i)->lock); | |
9306 | } | |
9307 | out: | |
9308 | return err; | |
9309 | } | |
9310 | ||
d842de87 SV |
9311 | static struct cftype files[] = { |
9312 | { | |
9313 | .name = "usage", | |
f4c753b7 PM |
9314 | .read_u64 = cpuusage_read, |
9315 | .write_u64 = cpuusage_write, | |
d842de87 SV |
9316 | }, |
9317 | }; | |
9318 | ||
32cd756a | 9319 | static int cpuacct_populate(struct cgroup_subsys *ss, struct cgroup *cgrp) |
d842de87 | 9320 | { |
32cd756a | 9321 | return cgroup_add_files(cgrp, ss, files, ARRAY_SIZE(files)); |
d842de87 SV |
9322 | } |
9323 | ||
9324 | /* | |
9325 | * charge this task's execution time to its accounting group. | |
9326 | * | |
9327 | * called with rq->lock held. | |
9328 | */ | |
9329 | static void cpuacct_charge(struct task_struct *tsk, u64 cputime) | |
9330 | { | |
9331 | struct cpuacct *ca; | |
934352f2 | 9332 | int cpu; |
d842de87 SV |
9333 | |
9334 | if (!cpuacct_subsys.active) | |
9335 | return; | |
9336 | ||
934352f2 | 9337 | cpu = task_cpu(tsk); |
d842de87 | 9338 | ca = task_ca(tsk); |
d842de87 | 9339 | |
934352f2 BR |
9340 | for (; ca; ca = ca->parent) { |
9341 | u64 *cpuusage = percpu_ptr(ca->cpuusage, cpu); | |
d842de87 SV |
9342 | *cpuusage += cputime; |
9343 | } | |
9344 | } | |
9345 | ||
9346 | struct cgroup_subsys cpuacct_subsys = { | |
9347 | .name = "cpuacct", | |
9348 | .create = cpuacct_create, | |
9349 | .destroy = cpuacct_destroy, | |
9350 | .populate = cpuacct_populate, | |
9351 | .subsys_id = cpuacct_subsys_id, | |
9352 | }; | |
9353 | #endif /* CONFIG_CGROUP_CPUACCT */ |