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