]>
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> |
cdd6c482 | 42 | #include <linux/perf_event.h> |
1da177e4 LT |
43 | #include <linux/security.h> |
44 | #include <linux/notifier.h> | |
45 | #include <linux/profile.h> | |
7dfb7103 | 46 | #include <linux/freezer.h> |
198e2f18 | 47 | #include <linux/vmalloc.h> |
1da177e4 LT |
48 | #include <linux/blkdev.h> |
49 | #include <linux/delay.h> | |
b488893a | 50 | #include <linux/pid_namespace.h> |
1da177e4 LT |
51 | #include <linux/smp.h> |
52 | #include <linux/threads.h> | |
53 | #include <linux/timer.h> | |
54 | #include <linux/rcupdate.h> | |
55 | #include <linux/cpu.h> | |
56 | #include <linux/cpuset.h> | |
57 | #include <linux/percpu.h> | |
58 | #include <linux/kthread.h> | |
b5aadf7f | 59 | #include <linux/proc_fs.h> |
1da177e4 | 60 | #include <linux/seq_file.h> |
e692ab53 | 61 | #include <linux/sysctl.h> |
1da177e4 LT |
62 | #include <linux/syscalls.h> |
63 | #include <linux/times.h> | |
8f0ab514 | 64 | #include <linux/tsacct_kern.h> |
c6fd91f0 | 65 | #include <linux/kprobes.h> |
0ff92245 | 66 | #include <linux/delayacct.h> |
dff06c15 | 67 | #include <linux/unistd.h> |
f5ff8422 | 68 | #include <linux/pagemap.h> |
8f4d37ec | 69 | #include <linux/hrtimer.h> |
30914a58 | 70 | #include <linux/tick.h> |
f00b45c1 PZ |
71 | #include <linux/debugfs.h> |
72 | #include <linux/ctype.h> | |
6cd8a4bb | 73 | #include <linux/ftrace.h> |
1da177e4 | 74 | |
5517d86b | 75 | #include <asm/tlb.h> |
838225b4 | 76 | #include <asm/irq_regs.h> |
1da177e4 | 77 | |
6e0534f2 GH |
78 | #include "sched_cpupri.h" |
79 | ||
a8d154b0 | 80 | #define CREATE_TRACE_POINTS |
ad8d75ff | 81 | #include <trace/events/sched.h> |
a8d154b0 | 82 | |
1da177e4 LT |
83 | /* |
84 | * Convert user-nice values [ -20 ... 0 ... 19 ] | |
85 | * to static priority [ MAX_RT_PRIO..MAX_PRIO-1 ], | |
86 | * and back. | |
87 | */ | |
88 | #define NICE_TO_PRIO(nice) (MAX_RT_PRIO + (nice) + 20) | |
89 | #define PRIO_TO_NICE(prio) ((prio) - MAX_RT_PRIO - 20) | |
90 | #define TASK_NICE(p) PRIO_TO_NICE((p)->static_prio) | |
91 | ||
92 | /* | |
93 | * 'User priority' is the nice value converted to something we | |
94 | * can work with better when scaling various scheduler parameters, | |
95 | * it's a [ 0 ... 39 ] range. | |
96 | */ | |
97 | #define USER_PRIO(p) ((p)-MAX_RT_PRIO) | |
98 | #define TASK_USER_PRIO(p) USER_PRIO((p)->static_prio) | |
99 | #define MAX_USER_PRIO (USER_PRIO(MAX_PRIO)) | |
100 | ||
101 | /* | |
d7876a08 | 102 | * Helpers for converting nanosecond timing to jiffy resolution |
1da177e4 | 103 | */ |
d6322faf | 104 | #define NS_TO_JIFFIES(TIME) ((unsigned long)(TIME) / (NSEC_PER_SEC / HZ)) |
1da177e4 | 105 | |
6aa645ea IM |
106 | #define NICE_0_LOAD SCHED_LOAD_SCALE |
107 | #define NICE_0_SHIFT SCHED_LOAD_SHIFT | |
108 | ||
1da177e4 LT |
109 | /* |
110 | * These are the 'tuning knobs' of the scheduler: | |
111 | * | |
a4ec24b4 | 112 | * default timeslice is 100 msecs (used only for SCHED_RR tasks). |
1da177e4 LT |
113 | * Timeslices get refilled after they expire. |
114 | */ | |
1da177e4 | 115 | #define DEF_TIMESLICE (100 * HZ / 1000) |
2dd73a4f | 116 | |
d0b27fa7 PZ |
117 | /* |
118 | * single value that denotes runtime == period, ie unlimited time. | |
119 | */ | |
120 | #define RUNTIME_INF ((u64)~0ULL) | |
121 | ||
e05606d3 IM |
122 | static inline int rt_policy(int policy) |
123 | { | |
3f33a7ce | 124 | if (unlikely(policy == SCHED_FIFO || policy == SCHED_RR)) |
e05606d3 IM |
125 | return 1; |
126 | return 0; | |
127 | } | |
128 | ||
129 | static inline int task_has_rt_policy(struct task_struct *p) | |
130 | { | |
131 | return rt_policy(p->policy); | |
132 | } | |
133 | ||
1da177e4 | 134 | /* |
6aa645ea | 135 | * This is the priority-queue data structure of the RT scheduling class: |
1da177e4 | 136 | */ |
6aa645ea IM |
137 | struct rt_prio_array { |
138 | DECLARE_BITMAP(bitmap, MAX_RT_PRIO+1); /* include 1 bit for delimiter */ | |
139 | struct list_head queue[MAX_RT_PRIO]; | |
140 | }; | |
141 | ||
d0b27fa7 | 142 | struct rt_bandwidth { |
ea736ed5 IM |
143 | /* nests inside the rq lock: */ |
144 | spinlock_t rt_runtime_lock; | |
145 | ktime_t rt_period; | |
146 | u64 rt_runtime; | |
147 | struct hrtimer rt_period_timer; | |
d0b27fa7 PZ |
148 | }; |
149 | ||
150 | static struct rt_bandwidth def_rt_bandwidth; | |
151 | ||
152 | static int do_sched_rt_period_timer(struct rt_bandwidth *rt_b, int overrun); | |
153 | ||
154 | static enum hrtimer_restart sched_rt_period_timer(struct hrtimer *timer) | |
155 | { | |
156 | struct rt_bandwidth *rt_b = | |
157 | container_of(timer, struct rt_bandwidth, rt_period_timer); | |
158 | ktime_t now; | |
159 | int overrun; | |
160 | int idle = 0; | |
161 | ||
162 | for (;;) { | |
163 | now = hrtimer_cb_get_time(timer); | |
164 | overrun = hrtimer_forward(timer, now, rt_b->rt_period); | |
165 | ||
166 | if (!overrun) | |
167 | break; | |
168 | ||
169 | idle = do_sched_rt_period_timer(rt_b, overrun); | |
170 | } | |
171 | ||
172 | return idle ? HRTIMER_NORESTART : HRTIMER_RESTART; | |
173 | } | |
174 | ||
175 | static | |
176 | void init_rt_bandwidth(struct rt_bandwidth *rt_b, u64 period, u64 runtime) | |
177 | { | |
178 | rt_b->rt_period = ns_to_ktime(period); | |
179 | rt_b->rt_runtime = runtime; | |
180 | ||
ac086bc2 PZ |
181 | spin_lock_init(&rt_b->rt_runtime_lock); |
182 | ||
d0b27fa7 PZ |
183 | hrtimer_init(&rt_b->rt_period_timer, |
184 | CLOCK_MONOTONIC, HRTIMER_MODE_REL); | |
185 | rt_b->rt_period_timer.function = sched_rt_period_timer; | |
d0b27fa7 PZ |
186 | } |
187 | ||
c8bfff6d KH |
188 | static inline int rt_bandwidth_enabled(void) |
189 | { | |
190 | return sysctl_sched_rt_runtime >= 0; | |
d0b27fa7 PZ |
191 | } |
192 | ||
193 | static void start_rt_bandwidth(struct rt_bandwidth *rt_b) | |
194 | { | |
195 | ktime_t now; | |
196 | ||
cac64d00 | 197 | if (!rt_bandwidth_enabled() || rt_b->rt_runtime == RUNTIME_INF) |
d0b27fa7 PZ |
198 | return; |
199 | ||
200 | if (hrtimer_active(&rt_b->rt_period_timer)) | |
201 | return; | |
202 | ||
203 | spin_lock(&rt_b->rt_runtime_lock); | |
204 | for (;;) { | |
7f1e2ca9 PZ |
205 | unsigned long delta; |
206 | ktime_t soft, hard; | |
207 | ||
d0b27fa7 PZ |
208 | if (hrtimer_active(&rt_b->rt_period_timer)) |
209 | break; | |
210 | ||
211 | now = hrtimer_cb_get_time(&rt_b->rt_period_timer); | |
212 | hrtimer_forward(&rt_b->rt_period_timer, now, rt_b->rt_period); | |
7f1e2ca9 PZ |
213 | |
214 | soft = hrtimer_get_softexpires(&rt_b->rt_period_timer); | |
215 | hard = hrtimer_get_expires(&rt_b->rt_period_timer); | |
216 | delta = ktime_to_ns(ktime_sub(hard, soft)); | |
217 | __hrtimer_start_range_ns(&rt_b->rt_period_timer, soft, delta, | |
5c333864 | 218 | HRTIMER_MODE_ABS_PINNED, 0); |
d0b27fa7 PZ |
219 | } |
220 | spin_unlock(&rt_b->rt_runtime_lock); | |
221 | } | |
222 | ||
223 | #ifdef CONFIG_RT_GROUP_SCHED | |
224 | static void destroy_rt_bandwidth(struct rt_bandwidth *rt_b) | |
225 | { | |
226 | hrtimer_cancel(&rt_b->rt_period_timer); | |
227 | } | |
228 | #endif | |
229 | ||
712555ee HC |
230 | /* |
231 | * sched_domains_mutex serializes calls to arch_init_sched_domains, | |
232 | * detach_destroy_domains and partition_sched_domains. | |
233 | */ | |
234 | static DEFINE_MUTEX(sched_domains_mutex); | |
235 | ||
052f1dc7 | 236 | #ifdef CONFIG_GROUP_SCHED |
29f59db3 | 237 | |
68318b8e SV |
238 | #include <linux/cgroup.h> |
239 | ||
29f59db3 SV |
240 | struct cfs_rq; |
241 | ||
6f505b16 PZ |
242 | static LIST_HEAD(task_groups); |
243 | ||
29f59db3 | 244 | /* task group related information */ |
4cf86d77 | 245 | struct task_group { |
052f1dc7 | 246 | #ifdef CONFIG_CGROUP_SCHED |
68318b8e SV |
247 | struct cgroup_subsys_state css; |
248 | #endif | |
052f1dc7 | 249 | |
6c415b92 AB |
250 | #ifdef CONFIG_USER_SCHED |
251 | uid_t uid; | |
252 | #endif | |
253 | ||
052f1dc7 | 254 | #ifdef CONFIG_FAIR_GROUP_SCHED |
29f59db3 SV |
255 | /* schedulable entities of this group on each cpu */ |
256 | struct sched_entity **se; | |
257 | /* runqueue "owned" by this group on each cpu */ | |
258 | struct cfs_rq **cfs_rq; | |
259 | unsigned long shares; | |
052f1dc7 PZ |
260 | #endif |
261 | ||
262 | #ifdef CONFIG_RT_GROUP_SCHED | |
263 | struct sched_rt_entity **rt_se; | |
264 | struct rt_rq **rt_rq; | |
265 | ||
d0b27fa7 | 266 | struct rt_bandwidth rt_bandwidth; |
052f1dc7 | 267 | #endif |
6b2d7700 | 268 | |
ae8393e5 | 269 | struct rcu_head rcu; |
6f505b16 | 270 | struct list_head list; |
f473aa5e PZ |
271 | |
272 | struct task_group *parent; | |
273 | struct list_head siblings; | |
274 | struct list_head children; | |
29f59db3 SV |
275 | }; |
276 | ||
354d60c2 | 277 | #ifdef CONFIG_USER_SCHED |
eff766a6 | 278 | |
6c415b92 AB |
279 | /* Helper function to pass uid information to create_sched_user() */ |
280 | void set_tg_uid(struct user_struct *user) | |
281 | { | |
282 | user->tg->uid = user->uid; | |
283 | } | |
284 | ||
eff766a6 PZ |
285 | /* |
286 | * Root task group. | |
84e9dabf AS |
287 | * Every UID task group (including init_task_group aka UID-0) will |
288 | * be a child to this group. | |
eff766a6 PZ |
289 | */ |
290 | struct task_group root_task_group; | |
291 | ||
052f1dc7 | 292 | #ifdef CONFIG_FAIR_GROUP_SCHED |
29f59db3 SV |
293 | /* Default task group's sched entity on each cpu */ |
294 | static DEFINE_PER_CPU(struct sched_entity, init_sched_entity); | |
295 | /* Default task group's cfs_rq on each cpu */ | |
ada3fa15 | 296 | static DEFINE_PER_CPU_SHARED_ALIGNED(struct cfs_rq, init_tg_cfs_rq); |
6d6bc0ad | 297 | #endif /* CONFIG_FAIR_GROUP_SCHED */ |
052f1dc7 PZ |
298 | |
299 | #ifdef CONFIG_RT_GROUP_SCHED | |
300 | static DEFINE_PER_CPU(struct sched_rt_entity, init_sched_rt_entity); | |
b9bf3121 | 301 | static DEFINE_PER_CPU_SHARED_ALIGNED(struct rt_rq, init_rt_rq); |
6d6bc0ad | 302 | #endif /* CONFIG_RT_GROUP_SCHED */ |
9a7e0b18 | 303 | #else /* !CONFIG_USER_SCHED */ |
eff766a6 | 304 | #define root_task_group init_task_group |
9a7e0b18 | 305 | #endif /* CONFIG_USER_SCHED */ |
6f505b16 | 306 | |
8ed36996 | 307 | /* task_group_lock serializes add/remove of task groups and also changes to |
ec2c507f SV |
308 | * a task group's cpu shares. |
309 | */ | |
8ed36996 | 310 | static DEFINE_SPINLOCK(task_group_lock); |
ec2c507f | 311 | |
57310a98 PZ |
312 | #ifdef CONFIG_SMP |
313 | static int root_task_group_empty(void) | |
314 | { | |
315 | return list_empty(&root_task_group.children); | |
316 | } | |
317 | #endif | |
318 | ||
052f1dc7 | 319 | #ifdef CONFIG_FAIR_GROUP_SCHED |
052f1dc7 PZ |
320 | #ifdef CONFIG_USER_SCHED |
321 | # define INIT_TASK_GROUP_LOAD (2*NICE_0_LOAD) | |
6d6bc0ad | 322 | #else /* !CONFIG_USER_SCHED */ |
052f1dc7 | 323 | # define INIT_TASK_GROUP_LOAD NICE_0_LOAD |
6d6bc0ad | 324 | #endif /* CONFIG_USER_SCHED */ |
052f1dc7 | 325 | |
cb4ad1ff | 326 | /* |
2e084786 LJ |
327 | * A weight of 0 or 1 can cause arithmetics problems. |
328 | * A weight of a cfs_rq is the sum of weights of which entities | |
329 | * are queued on this cfs_rq, so a weight of a entity should not be | |
330 | * too large, so as the shares value of a task group. | |
cb4ad1ff MX |
331 | * (The default weight is 1024 - so there's no practical |
332 | * limitation from this.) | |
333 | */ | |
18d95a28 | 334 | #define MIN_SHARES 2 |
2e084786 | 335 | #define MAX_SHARES (1UL << 18) |
18d95a28 | 336 | |
052f1dc7 PZ |
337 | static int init_task_group_load = INIT_TASK_GROUP_LOAD; |
338 | #endif | |
339 | ||
29f59db3 | 340 | /* Default task group. |
3a252015 | 341 | * Every task in system belong to this group at bootup. |
29f59db3 | 342 | */ |
434d53b0 | 343 | struct task_group init_task_group; |
29f59db3 SV |
344 | |
345 | /* return group to which a task belongs */ | |
4cf86d77 | 346 | static inline struct task_group *task_group(struct task_struct *p) |
29f59db3 | 347 | { |
4cf86d77 | 348 | struct task_group *tg; |
9b5b7751 | 349 | |
052f1dc7 | 350 | #ifdef CONFIG_USER_SCHED |
c69e8d9c DH |
351 | rcu_read_lock(); |
352 | tg = __task_cred(p)->user->tg; | |
353 | rcu_read_unlock(); | |
052f1dc7 | 354 | #elif defined(CONFIG_CGROUP_SCHED) |
68318b8e SV |
355 | tg = container_of(task_subsys_state(p, cpu_cgroup_subsys_id), |
356 | struct task_group, css); | |
24e377a8 | 357 | #else |
41a2d6cf | 358 | tg = &init_task_group; |
24e377a8 | 359 | #endif |
9b5b7751 | 360 | return tg; |
29f59db3 SV |
361 | } |
362 | ||
363 | /* Change a task's cfs_rq and parent entity if it moves across CPUs/groups */ | |
6f505b16 | 364 | static inline void set_task_rq(struct task_struct *p, unsigned int cpu) |
29f59db3 | 365 | { |
052f1dc7 | 366 | #ifdef CONFIG_FAIR_GROUP_SCHED |
ce96b5ac DA |
367 | p->se.cfs_rq = task_group(p)->cfs_rq[cpu]; |
368 | p->se.parent = task_group(p)->se[cpu]; | |
052f1dc7 | 369 | #endif |
6f505b16 | 370 | |
052f1dc7 | 371 | #ifdef CONFIG_RT_GROUP_SCHED |
6f505b16 PZ |
372 | p->rt.rt_rq = task_group(p)->rt_rq[cpu]; |
373 | p->rt.parent = task_group(p)->rt_se[cpu]; | |
052f1dc7 | 374 | #endif |
29f59db3 SV |
375 | } |
376 | ||
377 | #else | |
378 | ||
6f505b16 | 379 | static inline void set_task_rq(struct task_struct *p, unsigned int cpu) { } |
83378269 PZ |
380 | static inline struct task_group *task_group(struct task_struct *p) |
381 | { | |
382 | return NULL; | |
383 | } | |
29f59db3 | 384 | |
052f1dc7 | 385 | #endif /* CONFIG_GROUP_SCHED */ |
29f59db3 | 386 | |
6aa645ea IM |
387 | /* CFS-related fields in a runqueue */ |
388 | struct cfs_rq { | |
389 | struct load_weight load; | |
390 | unsigned long nr_running; | |
391 | ||
6aa645ea | 392 | u64 exec_clock; |
e9acbff6 | 393 | u64 min_vruntime; |
6aa645ea IM |
394 | |
395 | struct rb_root tasks_timeline; | |
396 | struct rb_node *rb_leftmost; | |
4a55bd5e PZ |
397 | |
398 | struct list_head tasks; | |
399 | struct list_head *balance_iterator; | |
400 | ||
401 | /* | |
402 | * 'curr' points to currently running entity on this cfs_rq. | |
6aa645ea IM |
403 | * It is set to NULL otherwise (i.e when none are currently running). |
404 | */ | |
4793241b | 405 | struct sched_entity *curr, *next, *last; |
ddc97297 | 406 | |
5ac5c4d6 | 407 | unsigned int nr_spread_over; |
ddc97297 | 408 | |
62160e3f | 409 | #ifdef CONFIG_FAIR_GROUP_SCHED |
6aa645ea IM |
410 | struct rq *rq; /* cpu runqueue to which this cfs_rq is attached */ |
411 | ||
41a2d6cf IM |
412 | /* |
413 | * leaf cfs_rqs are those that hold tasks (lowest schedulable entity in | |
6aa645ea IM |
414 | * a hierarchy). Non-leaf lrqs hold other higher schedulable entities |
415 | * (like users, containers etc.) | |
416 | * | |
417 | * leaf_cfs_rq_list ties together list of leaf cfs_rq's in a cpu. This | |
418 | * list is used during load balance. | |
419 | */ | |
41a2d6cf IM |
420 | struct list_head leaf_cfs_rq_list; |
421 | struct task_group *tg; /* group that "owns" this runqueue */ | |
c09595f6 PZ |
422 | |
423 | #ifdef CONFIG_SMP | |
c09595f6 | 424 | /* |
c8cba857 | 425 | * the part of load.weight contributed by tasks |
c09595f6 | 426 | */ |
c8cba857 | 427 | unsigned long task_weight; |
c09595f6 | 428 | |
c8cba857 PZ |
429 | /* |
430 | * h_load = weight * f(tg) | |
431 | * | |
432 | * Where f(tg) is the recursive weight fraction assigned to | |
433 | * this group. | |
434 | */ | |
435 | unsigned long h_load; | |
c09595f6 | 436 | |
c8cba857 PZ |
437 | /* |
438 | * this cpu's part of tg->shares | |
439 | */ | |
440 | unsigned long shares; | |
f1d239f7 PZ |
441 | |
442 | /* | |
443 | * load.weight at the time we set shares | |
444 | */ | |
445 | unsigned long rq_weight; | |
c09595f6 | 446 | #endif |
6aa645ea IM |
447 | #endif |
448 | }; | |
1da177e4 | 449 | |
6aa645ea IM |
450 | /* Real-Time classes' related field in a runqueue: */ |
451 | struct rt_rq { | |
452 | struct rt_prio_array active; | |
63489e45 | 453 | unsigned long rt_nr_running; |
052f1dc7 | 454 | #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED |
e864c499 GH |
455 | struct { |
456 | int curr; /* highest queued rt task prio */ | |
398a153b | 457 | #ifdef CONFIG_SMP |
e864c499 | 458 | int next; /* next highest */ |
398a153b | 459 | #endif |
e864c499 | 460 | } highest_prio; |
6f505b16 | 461 | #endif |
fa85ae24 | 462 | #ifdef CONFIG_SMP |
73fe6aae | 463 | unsigned long rt_nr_migratory; |
a1ba4d8b | 464 | unsigned long rt_nr_total; |
a22d7fc1 | 465 | int overloaded; |
917b627d | 466 | struct plist_head pushable_tasks; |
fa85ae24 | 467 | #endif |
6f505b16 | 468 | int rt_throttled; |
fa85ae24 | 469 | u64 rt_time; |
ac086bc2 | 470 | u64 rt_runtime; |
ea736ed5 | 471 | /* Nests inside the rq lock: */ |
ac086bc2 | 472 | spinlock_t rt_runtime_lock; |
6f505b16 | 473 | |
052f1dc7 | 474 | #ifdef CONFIG_RT_GROUP_SCHED |
23b0fdfc PZ |
475 | unsigned long rt_nr_boosted; |
476 | ||
6f505b16 PZ |
477 | struct rq *rq; |
478 | struct list_head leaf_rt_rq_list; | |
479 | struct task_group *tg; | |
480 | struct sched_rt_entity *rt_se; | |
481 | #endif | |
6aa645ea IM |
482 | }; |
483 | ||
57d885fe GH |
484 | #ifdef CONFIG_SMP |
485 | ||
486 | /* | |
487 | * We add the notion of a root-domain which will be used to define per-domain | |
0eab9146 IM |
488 | * variables. Each exclusive cpuset essentially defines an island domain by |
489 | * fully partitioning the member cpus from any other cpuset. Whenever a new | |
57d885fe GH |
490 | * exclusive cpuset is created, we also create and attach a new root-domain |
491 | * object. | |
492 | * | |
57d885fe GH |
493 | */ |
494 | struct root_domain { | |
495 | atomic_t refcount; | |
c6c4927b RR |
496 | cpumask_var_t span; |
497 | cpumask_var_t online; | |
637f5085 | 498 | |
0eab9146 | 499 | /* |
637f5085 GH |
500 | * The "RT overload" flag: it gets set if a CPU has more than |
501 | * one runnable RT task. | |
502 | */ | |
c6c4927b | 503 | cpumask_var_t rto_mask; |
0eab9146 | 504 | atomic_t rto_count; |
6e0534f2 GH |
505 | #ifdef CONFIG_SMP |
506 | struct cpupri cpupri; | |
507 | #endif | |
57d885fe GH |
508 | }; |
509 | ||
dc938520 GH |
510 | /* |
511 | * By default the system creates a single root-domain with all cpus as | |
512 | * members (mimicking the global state we have today). | |
513 | */ | |
57d885fe GH |
514 | static struct root_domain def_root_domain; |
515 | ||
516 | #endif | |
517 | ||
1da177e4 LT |
518 | /* |
519 | * This is the main, per-CPU runqueue data structure. | |
520 | * | |
521 | * Locking rule: those places that want to lock multiple runqueues | |
522 | * (such as the load balancing or the thread migration code), lock | |
523 | * acquire operations must be ordered by ascending &runqueue. | |
524 | */ | |
70b97a7f | 525 | struct rq { |
d8016491 IM |
526 | /* runqueue lock: */ |
527 | spinlock_t lock; | |
1da177e4 LT |
528 | |
529 | /* | |
530 | * nr_running and cpu_load should be in the same cacheline because | |
531 | * remote CPUs use both these fields when doing load calculation. | |
532 | */ | |
533 | unsigned long nr_running; | |
6aa645ea IM |
534 | #define CPU_LOAD_IDX_MAX 5 |
535 | unsigned long cpu_load[CPU_LOAD_IDX_MAX]; | |
46cb4b7c | 536 | #ifdef CONFIG_NO_HZ |
15934a37 | 537 | unsigned long last_tick_seen; |
46cb4b7c SS |
538 | unsigned char in_nohz_recently; |
539 | #endif | |
d8016491 IM |
540 | /* capture load from *all* tasks on this cpu: */ |
541 | struct load_weight load; | |
6aa645ea IM |
542 | unsigned long nr_load_updates; |
543 | u64 nr_switches; | |
23a185ca | 544 | u64 nr_migrations_in; |
6aa645ea IM |
545 | |
546 | struct cfs_rq cfs; | |
6f505b16 | 547 | struct rt_rq rt; |
6f505b16 | 548 | |
6aa645ea | 549 | #ifdef CONFIG_FAIR_GROUP_SCHED |
d8016491 IM |
550 | /* list of leaf cfs_rq on this cpu: */ |
551 | struct list_head leaf_cfs_rq_list; | |
052f1dc7 PZ |
552 | #endif |
553 | #ifdef CONFIG_RT_GROUP_SCHED | |
6f505b16 | 554 | struct list_head leaf_rt_rq_list; |
1da177e4 | 555 | #endif |
1da177e4 LT |
556 | |
557 | /* | |
558 | * This is part of a global counter where only the total sum | |
559 | * over all CPUs matters. A task can increase this counter on | |
560 | * one CPU and if it got migrated afterwards it may decrease | |
561 | * it on another CPU. Always updated under the runqueue lock: | |
562 | */ | |
563 | unsigned long nr_uninterruptible; | |
564 | ||
36c8b586 | 565 | struct task_struct *curr, *idle; |
c9819f45 | 566 | unsigned long next_balance; |
1da177e4 | 567 | struct mm_struct *prev_mm; |
6aa645ea | 568 | |
3e51f33f | 569 | u64 clock; |
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 | ||
a0a522ce | 577 | unsigned char idle_at_tick; |
1da177e4 | 578 | /* For active balancing */ |
3f029d3c | 579 | int post_schedule; |
1da177e4 LT |
580 | int active_balance; |
581 | int push_cpu; | |
d8016491 IM |
582 | /* cpu of this runqueue: */ |
583 | int cpu; | |
1f11eb6a | 584 | int online; |
1da177e4 | 585 | |
a8a51d5e | 586 | unsigned long avg_load_per_task; |
1da177e4 | 587 | |
36c8b586 | 588 | struct task_struct *migration_thread; |
1da177e4 | 589 | struct list_head migration_queue; |
e9e9250b PZ |
590 | |
591 | u64 rt_avg; | |
592 | u64 age_stamp; | |
1da177e4 LT |
593 | #endif |
594 | ||
dce48a84 TG |
595 | /* calc_load related fields */ |
596 | unsigned long calc_load_update; | |
597 | long calc_load_active; | |
598 | ||
8f4d37ec | 599 | #ifdef CONFIG_SCHED_HRTICK |
31656519 PZ |
600 | #ifdef CONFIG_SMP |
601 | int hrtick_csd_pending; | |
602 | struct call_single_data hrtick_csd; | |
603 | #endif | |
8f4d37ec PZ |
604 | struct hrtimer hrtick_timer; |
605 | #endif | |
606 | ||
1da177e4 LT |
607 | #ifdef CONFIG_SCHEDSTATS |
608 | /* latency stats */ | |
609 | struct sched_info rq_sched_info; | |
9c2c4802 KC |
610 | unsigned long long rq_cpu_time; |
611 | /* could above be rq->cfs_rq.exec_clock + rq->rt_rq.rt_runtime ? */ | |
1da177e4 LT |
612 | |
613 | /* sys_sched_yield() stats */ | |
480b9434 | 614 | unsigned int yld_count; |
1da177e4 LT |
615 | |
616 | /* schedule() stats */ | |
480b9434 KC |
617 | unsigned int sched_switch; |
618 | unsigned int sched_count; | |
619 | unsigned int sched_goidle; | |
1da177e4 LT |
620 | |
621 | /* try_to_wake_up() stats */ | |
480b9434 KC |
622 | unsigned int ttwu_count; |
623 | unsigned int ttwu_local; | |
b8efb561 IM |
624 | |
625 | /* BKL stats */ | |
480b9434 | 626 | unsigned int bkl_count; |
1da177e4 LT |
627 | #endif |
628 | }; | |
629 | ||
f34e3b61 | 630 | static DEFINE_PER_CPU_SHARED_ALIGNED(struct rq, runqueues); |
1da177e4 | 631 | |
7d478721 PZ |
632 | static inline |
633 | void check_preempt_curr(struct rq *rq, struct task_struct *p, int flags) | |
dd41f596 | 634 | { |
7d478721 | 635 | rq->curr->sched_class->check_preempt_curr(rq, p, flags); |
dd41f596 IM |
636 | } |
637 | ||
0a2966b4 CL |
638 | static inline int cpu_of(struct rq *rq) |
639 | { | |
640 | #ifdef CONFIG_SMP | |
641 | return rq->cpu; | |
642 | #else | |
643 | return 0; | |
644 | #endif | |
645 | } | |
646 | ||
674311d5 NP |
647 | /* |
648 | * The domain tree (rq->sd) is protected by RCU's quiescent state transition. | |
1a20ff27 | 649 | * See detach_destroy_domains: synchronize_sched for details. |
674311d5 NP |
650 | * |
651 | * The domain tree of any CPU may only be accessed from within | |
652 | * preempt-disabled sections. | |
653 | */ | |
48f24c4d IM |
654 | #define for_each_domain(cpu, __sd) \ |
655 | for (__sd = rcu_dereference(cpu_rq(cpu)->sd); __sd; __sd = __sd->parent) | |
1da177e4 LT |
656 | |
657 | #define cpu_rq(cpu) (&per_cpu(runqueues, (cpu))) | |
658 | #define this_rq() (&__get_cpu_var(runqueues)) | |
659 | #define task_rq(p) cpu_rq(task_cpu(p)) | |
660 | #define cpu_curr(cpu) (cpu_rq(cpu)->curr) | |
54d35f29 | 661 | #define raw_rq() (&__raw_get_cpu_var(runqueues)) |
1da177e4 | 662 | |
aa9c4c0f | 663 | inline void update_rq_clock(struct rq *rq) |
3e51f33f PZ |
664 | { |
665 | rq->clock = sched_clock_cpu(cpu_of(rq)); | |
666 | } | |
667 | ||
bf5c91ba IM |
668 | /* |
669 | * Tunables that become constants when CONFIG_SCHED_DEBUG is off: | |
670 | */ | |
671 | #ifdef CONFIG_SCHED_DEBUG | |
672 | # define const_debug __read_mostly | |
673 | #else | |
674 | # define const_debug static const | |
675 | #endif | |
676 | ||
017730c1 IM |
677 | /** |
678 | * runqueue_is_locked | |
679 | * | |
680 | * Returns true if the current cpu runqueue is locked. | |
681 | * This interface allows printk to be called with the runqueue lock | |
682 | * held and know whether or not it is OK to wake up the klogd. | |
683 | */ | |
89f19f04 | 684 | int runqueue_is_locked(int cpu) |
017730c1 | 685 | { |
89f19f04 | 686 | return spin_is_locked(&cpu_rq(cpu)->lock); |
017730c1 IM |
687 | } |
688 | ||
bf5c91ba IM |
689 | /* |
690 | * Debugging: various feature bits | |
691 | */ | |
f00b45c1 PZ |
692 | |
693 | #define SCHED_FEAT(name, enabled) \ | |
694 | __SCHED_FEAT_##name , | |
695 | ||
bf5c91ba | 696 | enum { |
f00b45c1 | 697 | #include "sched_features.h" |
bf5c91ba IM |
698 | }; |
699 | ||
f00b45c1 PZ |
700 | #undef SCHED_FEAT |
701 | ||
702 | #define SCHED_FEAT(name, enabled) \ | |
703 | (1UL << __SCHED_FEAT_##name) * enabled | | |
704 | ||
bf5c91ba | 705 | const_debug unsigned int sysctl_sched_features = |
f00b45c1 PZ |
706 | #include "sched_features.h" |
707 | 0; | |
708 | ||
709 | #undef SCHED_FEAT | |
710 | ||
711 | #ifdef CONFIG_SCHED_DEBUG | |
712 | #define SCHED_FEAT(name, enabled) \ | |
713 | #name , | |
714 | ||
983ed7a6 | 715 | static __read_mostly char *sched_feat_names[] = { |
f00b45c1 PZ |
716 | #include "sched_features.h" |
717 | NULL | |
718 | }; | |
719 | ||
720 | #undef SCHED_FEAT | |
721 | ||
34f3a814 | 722 | static int sched_feat_show(struct seq_file *m, void *v) |
f00b45c1 | 723 | { |
f00b45c1 PZ |
724 | int i; |
725 | ||
726 | for (i = 0; sched_feat_names[i]; i++) { | |
34f3a814 LZ |
727 | if (!(sysctl_sched_features & (1UL << i))) |
728 | seq_puts(m, "NO_"); | |
729 | seq_printf(m, "%s ", sched_feat_names[i]); | |
f00b45c1 | 730 | } |
34f3a814 | 731 | seq_puts(m, "\n"); |
f00b45c1 | 732 | |
34f3a814 | 733 | return 0; |
f00b45c1 PZ |
734 | } |
735 | ||
736 | static ssize_t | |
737 | sched_feat_write(struct file *filp, const char __user *ubuf, | |
738 | size_t cnt, loff_t *ppos) | |
739 | { | |
740 | char buf[64]; | |
741 | char *cmp = buf; | |
742 | int neg = 0; | |
743 | int i; | |
744 | ||
745 | if (cnt > 63) | |
746 | cnt = 63; | |
747 | ||
748 | if (copy_from_user(&buf, ubuf, cnt)) | |
749 | return -EFAULT; | |
750 | ||
751 | buf[cnt] = 0; | |
752 | ||
c24b7c52 | 753 | if (strncmp(buf, "NO_", 3) == 0) { |
f00b45c1 PZ |
754 | neg = 1; |
755 | cmp += 3; | |
756 | } | |
757 | ||
758 | for (i = 0; sched_feat_names[i]; i++) { | |
759 | int len = strlen(sched_feat_names[i]); | |
760 | ||
761 | if (strncmp(cmp, sched_feat_names[i], len) == 0) { | |
762 | if (neg) | |
763 | sysctl_sched_features &= ~(1UL << i); | |
764 | else | |
765 | sysctl_sched_features |= (1UL << i); | |
766 | break; | |
767 | } | |
768 | } | |
769 | ||
770 | if (!sched_feat_names[i]) | |
771 | return -EINVAL; | |
772 | ||
773 | filp->f_pos += cnt; | |
774 | ||
775 | return cnt; | |
776 | } | |
777 | ||
34f3a814 LZ |
778 | static int sched_feat_open(struct inode *inode, struct file *filp) |
779 | { | |
780 | return single_open(filp, sched_feat_show, NULL); | |
781 | } | |
782 | ||
f00b45c1 | 783 | static struct file_operations sched_feat_fops = { |
34f3a814 LZ |
784 | .open = sched_feat_open, |
785 | .write = sched_feat_write, | |
786 | .read = seq_read, | |
787 | .llseek = seq_lseek, | |
788 | .release = single_release, | |
f00b45c1 PZ |
789 | }; |
790 | ||
791 | static __init int sched_init_debug(void) | |
792 | { | |
f00b45c1 PZ |
793 | debugfs_create_file("sched_features", 0644, NULL, NULL, |
794 | &sched_feat_fops); | |
795 | ||
796 | return 0; | |
797 | } | |
798 | late_initcall(sched_init_debug); | |
799 | ||
800 | #endif | |
801 | ||
802 | #define sched_feat(x) (sysctl_sched_features & (1UL << __SCHED_FEAT_##x)) | |
bf5c91ba | 803 | |
b82d9fdd PZ |
804 | /* |
805 | * Number of tasks to iterate in a single balance run. | |
806 | * Limited because this is done with IRQs disabled. | |
807 | */ | |
808 | const_debug unsigned int sysctl_sched_nr_migrate = 32; | |
809 | ||
2398f2c6 PZ |
810 | /* |
811 | * ratelimit for updating the group shares. | |
55cd5340 | 812 | * default: 0.25ms |
2398f2c6 | 813 | */ |
55cd5340 | 814 | unsigned int sysctl_sched_shares_ratelimit = 250000; |
2398f2c6 | 815 | |
ffda12a1 PZ |
816 | /* |
817 | * Inject some fuzzyness into changing the per-cpu group shares | |
818 | * this avoids remote rq-locks at the expense of fairness. | |
819 | * default: 4 | |
820 | */ | |
821 | unsigned int sysctl_sched_shares_thresh = 4; | |
822 | ||
e9e9250b PZ |
823 | /* |
824 | * period over which we average the RT time consumption, measured | |
825 | * in ms. | |
826 | * | |
827 | * default: 1s | |
828 | */ | |
829 | const_debug unsigned int sysctl_sched_time_avg = MSEC_PER_SEC; | |
830 | ||
fa85ae24 | 831 | /* |
9f0c1e56 | 832 | * period over which we measure -rt task cpu usage in us. |
fa85ae24 PZ |
833 | * default: 1s |
834 | */ | |
9f0c1e56 | 835 | unsigned int sysctl_sched_rt_period = 1000000; |
fa85ae24 | 836 | |
6892b75e IM |
837 | static __read_mostly int scheduler_running; |
838 | ||
9f0c1e56 PZ |
839 | /* |
840 | * part of the period that we allow rt tasks to run in us. | |
841 | * default: 0.95s | |
842 | */ | |
843 | int sysctl_sched_rt_runtime = 950000; | |
fa85ae24 | 844 | |
d0b27fa7 PZ |
845 | static inline u64 global_rt_period(void) |
846 | { | |
847 | return (u64)sysctl_sched_rt_period * NSEC_PER_USEC; | |
848 | } | |
849 | ||
850 | static inline u64 global_rt_runtime(void) | |
851 | { | |
e26873bb | 852 | if (sysctl_sched_rt_runtime < 0) |
d0b27fa7 PZ |
853 | return RUNTIME_INF; |
854 | ||
855 | return (u64)sysctl_sched_rt_runtime * NSEC_PER_USEC; | |
856 | } | |
fa85ae24 | 857 | |
1da177e4 | 858 | #ifndef prepare_arch_switch |
4866cde0 NP |
859 | # define prepare_arch_switch(next) do { } while (0) |
860 | #endif | |
861 | #ifndef finish_arch_switch | |
862 | # define finish_arch_switch(prev) do { } while (0) | |
863 | #endif | |
864 | ||
051a1d1a DA |
865 | static inline int task_current(struct rq *rq, struct task_struct *p) |
866 | { | |
867 | return rq->curr == p; | |
868 | } | |
869 | ||
4866cde0 | 870 | #ifndef __ARCH_WANT_UNLOCKED_CTXSW |
70b97a7f | 871 | static inline int task_running(struct rq *rq, struct task_struct *p) |
4866cde0 | 872 | { |
051a1d1a | 873 | return task_current(rq, p); |
4866cde0 NP |
874 | } |
875 | ||
70b97a7f | 876 | static inline void prepare_lock_switch(struct rq *rq, struct task_struct *next) |
4866cde0 NP |
877 | { |
878 | } | |
879 | ||
70b97a7f | 880 | static inline void finish_lock_switch(struct rq *rq, struct task_struct *prev) |
4866cde0 | 881 | { |
da04c035 IM |
882 | #ifdef CONFIG_DEBUG_SPINLOCK |
883 | /* this is a valid case when another task releases the spinlock */ | |
884 | rq->lock.owner = current; | |
885 | #endif | |
8a25d5de IM |
886 | /* |
887 | * If we are tracking spinlock dependencies then we have to | |
888 | * fix up the runqueue lock - which gets 'carried over' from | |
889 | * prev into current: | |
890 | */ | |
891 | spin_acquire(&rq->lock.dep_map, 0, 0, _THIS_IP_); | |
892 | ||
4866cde0 NP |
893 | spin_unlock_irq(&rq->lock); |
894 | } | |
895 | ||
896 | #else /* __ARCH_WANT_UNLOCKED_CTXSW */ | |
70b97a7f | 897 | static inline int task_running(struct rq *rq, struct task_struct *p) |
4866cde0 NP |
898 | { |
899 | #ifdef CONFIG_SMP | |
900 | return p->oncpu; | |
901 | #else | |
051a1d1a | 902 | return task_current(rq, p); |
4866cde0 NP |
903 | #endif |
904 | } | |
905 | ||
70b97a7f | 906 | static inline void prepare_lock_switch(struct rq *rq, struct task_struct *next) |
4866cde0 NP |
907 | { |
908 | #ifdef CONFIG_SMP | |
909 | /* | |
910 | * We can optimise this out completely for !SMP, because the | |
911 | * SMP rebalancing from interrupt is the only thing that cares | |
912 | * here. | |
913 | */ | |
914 | next->oncpu = 1; | |
915 | #endif | |
916 | #ifdef __ARCH_WANT_INTERRUPTS_ON_CTXSW | |
917 | spin_unlock_irq(&rq->lock); | |
918 | #else | |
919 | spin_unlock(&rq->lock); | |
920 | #endif | |
921 | } | |
922 | ||
70b97a7f | 923 | static inline void finish_lock_switch(struct rq *rq, struct task_struct *prev) |
4866cde0 NP |
924 | { |
925 | #ifdef CONFIG_SMP | |
926 | /* | |
927 | * After ->oncpu is cleared, the task can be moved to a different CPU. | |
928 | * We must ensure this doesn't happen until the switch is completely | |
929 | * finished. | |
930 | */ | |
931 | smp_wmb(); | |
932 | prev->oncpu = 0; | |
933 | #endif | |
934 | #ifndef __ARCH_WANT_INTERRUPTS_ON_CTXSW | |
935 | local_irq_enable(); | |
1da177e4 | 936 | #endif |
4866cde0 NP |
937 | } |
938 | #endif /* __ARCH_WANT_UNLOCKED_CTXSW */ | |
1da177e4 | 939 | |
b29739f9 IM |
940 | /* |
941 | * __task_rq_lock - lock the runqueue a given task resides on. | |
942 | * Must be called interrupts disabled. | |
943 | */ | |
70b97a7f | 944 | static inline struct rq *__task_rq_lock(struct task_struct *p) |
b29739f9 IM |
945 | __acquires(rq->lock) |
946 | { | |
3a5c359a AK |
947 | for (;;) { |
948 | struct rq *rq = task_rq(p); | |
949 | spin_lock(&rq->lock); | |
950 | if (likely(rq == task_rq(p))) | |
951 | return rq; | |
b29739f9 | 952 | spin_unlock(&rq->lock); |
b29739f9 | 953 | } |
b29739f9 IM |
954 | } |
955 | ||
1da177e4 LT |
956 | /* |
957 | * task_rq_lock - lock the runqueue a given task resides on and disable | |
41a2d6cf | 958 | * interrupts. Note the ordering: we can safely lookup the task_rq without |
1da177e4 LT |
959 | * explicitly disabling preemption. |
960 | */ | |
70b97a7f | 961 | static struct rq *task_rq_lock(struct task_struct *p, unsigned long *flags) |
1da177e4 LT |
962 | __acquires(rq->lock) |
963 | { | |
70b97a7f | 964 | struct rq *rq; |
1da177e4 | 965 | |
3a5c359a AK |
966 | for (;;) { |
967 | local_irq_save(*flags); | |
968 | rq = task_rq(p); | |
969 | spin_lock(&rq->lock); | |
970 | if (likely(rq == task_rq(p))) | |
971 | return rq; | |
1da177e4 | 972 | spin_unlock_irqrestore(&rq->lock, *flags); |
1da177e4 | 973 | } |
1da177e4 LT |
974 | } |
975 | ||
ad474cac ON |
976 | void task_rq_unlock_wait(struct task_struct *p) |
977 | { | |
978 | struct rq *rq = task_rq(p); | |
979 | ||
980 | smp_mb(); /* spin-unlock-wait is not a full memory barrier */ | |
981 | spin_unlock_wait(&rq->lock); | |
982 | } | |
983 | ||
a9957449 | 984 | static void __task_rq_unlock(struct rq *rq) |
b29739f9 IM |
985 | __releases(rq->lock) |
986 | { | |
987 | spin_unlock(&rq->lock); | |
988 | } | |
989 | ||
70b97a7f | 990 | static inline void task_rq_unlock(struct rq *rq, unsigned long *flags) |
1da177e4 LT |
991 | __releases(rq->lock) |
992 | { | |
993 | spin_unlock_irqrestore(&rq->lock, *flags); | |
994 | } | |
995 | ||
1da177e4 | 996 | /* |
cc2a73b5 | 997 | * this_rq_lock - lock this runqueue and disable interrupts. |
1da177e4 | 998 | */ |
a9957449 | 999 | static struct rq *this_rq_lock(void) |
1da177e4 LT |
1000 | __acquires(rq->lock) |
1001 | { | |
70b97a7f | 1002 | struct rq *rq; |
1da177e4 LT |
1003 | |
1004 | local_irq_disable(); | |
1005 | rq = this_rq(); | |
1006 | spin_lock(&rq->lock); | |
1007 | ||
1008 | return rq; | |
1009 | } | |
1010 | ||
8f4d37ec PZ |
1011 | #ifdef CONFIG_SCHED_HRTICK |
1012 | /* | |
1013 | * Use HR-timers to deliver accurate preemption points. | |
1014 | * | |
1015 | * Its all a bit involved since we cannot program an hrt while holding the | |
1016 | * rq->lock. So what we do is store a state in in rq->hrtick_* and ask for a | |
1017 | * reschedule event. | |
1018 | * | |
1019 | * When we get rescheduled we reprogram the hrtick_timer outside of the | |
1020 | * rq->lock. | |
1021 | */ | |
8f4d37ec PZ |
1022 | |
1023 | /* | |
1024 | * Use hrtick when: | |
1025 | * - enabled by features | |
1026 | * - hrtimer is actually high res | |
1027 | */ | |
1028 | static inline int hrtick_enabled(struct rq *rq) | |
1029 | { | |
1030 | if (!sched_feat(HRTICK)) | |
1031 | return 0; | |
ba42059f | 1032 | if (!cpu_active(cpu_of(rq))) |
b328ca18 | 1033 | return 0; |
8f4d37ec PZ |
1034 | return hrtimer_is_hres_active(&rq->hrtick_timer); |
1035 | } | |
1036 | ||
8f4d37ec PZ |
1037 | static void hrtick_clear(struct rq *rq) |
1038 | { | |
1039 | if (hrtimer_active(&rq->hrtick_timer)) | |
1040 | hrtimer_cancel(&rq->hrtick_timer); | |
1041 | } | |
1042 | ||
8f4d37ec PZ |
1043 | /* |
1044 | * High-resolution timer tick. | |
1045 | * Runs from hardirq context with interrupts disabled. | |
1046 | */ | |
1047 | static enum hrtimer_restart hrtick(struct hrtimer *timer) | |
1048 | { | |
1049 | struct rq *rq = container_of(timer, struct rq, hrtick_timer); | |
1050 | ||
1051 | WARN_ON_ONCE(cpu_of(rq) != smp_processor_id()); | |
1052 | ||
1053 | spin_lock(&rq->lock); | |
3e51f33f | 1054 | update_rq_clock(rq); |
8f4d37ec PZ |
1055 | rq->curr->sched_class->task_tick(rq, rq->curr, 1); |
1056 | spin_unlock(&rq->lock); | |
1057 | ||
1058 | return HRTIMER_NORESTART; | |
1059 | } | |
1060 | ||
95e904c7 | 1061 | #ifdef CONFIG_SMP |
31656519 PZ |
1062 | /* |
1063 | * called from hardirq (IPI) context | |
1064 | */ | |
1065 | static void __hrtick_start(void *arg) | |
b328ca18 | 1066 | { |
31656519 | 1067 | struct rq *rq = arg; |
b328ca18 | 1068 | |
31656519 PZ |
1069 | spin_lock(&rq->lock); |
1070 | hrtimer_restart(&rq->hrtick_timer); | |
1071 | rq->hrtick_csd_pending = 0; | |
1072 | spin_unlock(&rq->lock); | |
b328ca18 PZ |
1073 | } |
1074 | ||
31656519 PZ |
1075 | /* |
1076 | * Called to set the hrtick timer state. | |
1077 | * | |
1078 | * called with rq->lock held and irqs disabled | |
1079 | */ | |
1080 | static void hrtick_start(struct rq *rq, u64 delay) | |
b328ca18 | 1081 | { |
31656519 PZ |
1082 | struct hrtimer *timer = &rq->hrtick_timer; |
1083 | ktime_t time = ktime_add_ns(timer->base->get_time(), delay); | |
b328ca18 | 1084 | |
cc584b21 | 1085 | hrtimer_set_expires(timer, time); |
31656519 PZ |
1086 | |
1087 | if (rq == this_rq()) { | |
1088 | hrtimer_restart(timer); | |
1089 | } else if (!rq->hrtick_csd_pending) { | |
6e275637 | 1090 | __smp_call_function_single(cpu_of(rq), &rq->hrtick_csd, 0); |
31656519 PZ |
1091 | rq->hrtick_csd_pending = 1; |
1092 | } | |
b328ca18 PZ |
1093 | } |
1094 | ||
1095 | static int | |
1096 | hotplug_hrtick(struct notifier_block *nfb, unsigned long action, void *hcpu) | |
1097 | { | |
1098 | int cpu = (int)(long)hcpu; | |
1099 | ||
1100 | switch (action) { | |
1101 | case CPU_UP_CANCELED: | |
1102 | case CPU_UP_CANCELED_FROZEN: | |
1103 | case CPU_DOWN_PREPARE: | |
1104 | case CPU_DOWN_PREPARE_FROZEN: | |
1105 | case CPU_DEAD: | |
1106 | case CPU_DEAD_FROZEN: | |
31656519 | 1107 | hrtick_clear(cpu_rq(cpu)); |
b328ca18 PZ |
1108 | return NOTIFY_OK; |
1109 | } | |
1110 | ||
1111 | return NOTIFY_DONE; | |
1112 | } | |
1113 | ||
fa748203 | 1114 | static __init void init_hrtick(void) |
b328ca18 PZ |
1115 | { |
1116 | hotcpu_notifier(hotplug_hrtick, 0); | |
1117 | } | |
31656519 PZ |
1118 | #else |
1119 | /* | |
1120 | * Called to set the hrtick timer state. | |
1121 | * | |
1122 | * called with rq->lock held and irqs disabled | |
1123 | */ | |
1124 | static void hrtick_start(struct rq *rq, u64 delay) | |
1125 | { | |
7f1e2ca9 | 1126 | __hrtimer_start_range_ns(&rq->hrtick_timer, ns_to_ktime(delay), 0, |
5c333864 | 1127 | HRTIMER_MODE_REL_PINNED, 0); |
31656519 | 1128 | } |
b328ca18 | 1129 | |
006c75f1 | 1130 | static inline void init_hrtick(void) |
8f4d37ec | 1131 | { |
8f4d37ec | 1132 | } |
31656519 | 1133 | #endif /* CONFIG_SMP */ |
8f4d37ec | 1134 | |
31656519 | 1135 | static void init_rq_hrtick(struct rq *rq) |
8f4d37ec | 1136 | { |
31656519 PZ |
1137 | #ifdef CONFIG_SMP |
1138 | rq->hrtick_csd_pending = 0; | |
8f4d37ec | 1139 | |
31656519 PZ |
1140 | rq->hrtick_csd.flags = 0; |
1141 | rq->hrtick_csd.func = __hrtick_start; | |
1142 | rq->hrtick_csd.info = rq; | |
1143 | #endif | |
8f4d37ec | 1144 | |
31656519 PZ |
1145 | hrtimer_init(&rq->hrtick_timer, CLOCK_MONOTONIC, HRTIMER_MODE_REL); |
1146 | rq->hrtick_timer.function = hrtick; | |
8f4d37ec | 1147 | } |
006c75f1 | 1148 | #else /* CONFIG_SCHED_HRTICK */ |
8f4d37ec PZ |
1149 | static inline void hrtick_clear(struct rq *rq) |
1150 | { | |
1151 | } | |
1152 | ||
8f4d37ec PZ |
1153 | static inline void init_rq_hrtick(struct rq *rq) |
1154 | { | |
1155 | } | |
1156 | ||
b328ca18 PZ |
1157 | static inline void init_hrtick(void) |
1158 | { | |
1159 | } | |
006c75f1 | 1160 | #endif /* CONFIG_SCHED_HRTICK */ |
8f4d37ec | 1161 | |
c24d20db IM |
1162 | /* |
1163 | * resched_task - mark a task 'to be rescheduled now'. | |
1164 | * | |
1165 | * On UP this means the setting of the need_resched flag, on SMP it | |
1166 | * might also involve a cross-CPU call to trigger the scheduler on | |
1167 | * the target CPU. | |
1168 | */ | |
1169 | #ifdef CONFIG_SMP | |
1170 | ||
1171 | #ifndef tsk_is_polling | |
1172 | #define tsk_is_polling(t) test_tsk_thread_flag(t, TIF_POLLING_NRFLAG) | |
1173 | #endif | |
1174 | ||
31656519 | 1175 | static void resched_task(struct task_struct *p) |
c24d20db IM |
1176 | { |
1177 | int cpu; | |
1178 | ||
1179 | assert_spin_locked(&task_rq(p)->lock); | |
1180 | ||
5ed0cec0 | 1181 | if (test_tsk_need_resched(p)) |
c24d20db IM |
1182 | return; |
1183 | ||
5ed0cec0 | 1184 | set_tsk_need_resched(p); |
c24d20db IM |
1185 | |
1186 | cpu = task_cpu(p); | |
1187 | if (cpu == smp_processor_id()) | |
1188 | return; | |
1189 | ||
1190 | /* NEED_RESCHED must be visible before we test polling */ | |
1191 | smp_mb(); | |
1192 | if (!tsk_is_polling(p)) | |
1193 | smp_send_reschedule(cpu); | |
1194 | } | |
1195 | ||
1196 | static void resched_cpu(int cpu) | |
1197 | { | |
1198 | struct rq *rq = cpu_rq(cpu); | |
1199 | unsigned long flags; | |
1200 | ||
1201 | if (!spin_trylock_irqsave(&rq->lock, flags)) | |
1202 | return; | |
1203 | resched_task(cpu_curr(cpu)); | |
1204 | spin_unlock_irqrestore(&rq->lock, flags); | |
1205 | } | |
06d8308c TG |
1206 | |
1207 | #ifdef CONFIG_NO_HZ | |
1208 | /* | |
1209 | * When add_timer_on() enqueues a timer into the timer wheel of an | |
1210 | * idle CPU then this timer might expire before the next timer event | |
1211 | * which is scheduled to wake up that CPU. In case of a completely | |
1212 | * idle system the next event might even be infinite time into the | |
1213 | * future. wake_up_idle_cpu() ensures that the CPU is woken up and | |
1214 | * leaves the inner idle loop so the newly added timer is taken into | |
1215 | * account when the CPU goes back to idle and evaluates the timer | |
1216 | * wheel for the next timer event. | |
1217 | */ | |
1218 | void wake_up_idle_cpu(int cpu) | |
1219 | { | |
1220 | struct rq *rq = cpu_rq(cpu); | |
1221 | ||
1222 | if (cpu == smp_processor_id()) | |
1223 | return; | |
1224 | ||
1225 | /* | |
1226 | * This is safe, as this function is called with the timer | |
1227 | * wheel base lock of (cpu) held. When the CPU is on the way | |
1228 | * to idle and has not yet set rq->curr to idle then it will | |
1229 | * be serialized on the timer wheel base lock and take the new | |
1230 | * timer into account automatically. | |
1231 | */ | |
1232 | if (rq->curr != rq->idle) | |
1233 | return; | |
1234 | ||
1235 | /* | |
1236 | * We can set TIF_RESCHED on the idle task of the other CPU | |
1237 | * lockless. The worst case is that the other CPU runs the | |
1238 | * idle task through an additional NOOP schedule() | |
1239 | */ | |
5ed0cec0 | 1240 | set_tsk_need_resched(rq->idle); |
06d8308c TG |
1241 | |
1242 | /* NEED_RESCHED must be visible before we test polling */ | |
1243 | smp_mb(); | |
1244 | if (!tsk_is_polling(rq->idle)) | |
1245 | smp_send_reschedule(cpu); | |
1246 | } | |
6d6bc0ad | 1247 | #endif /* CONFIG_NO_HZ */ |
06d8308c | 1248 | |
e9e9250b PZ |
1249 | static u64 sched_avg_period(void) |
1250 | { | |
1251 | return (u64)sysctl_sched_time_avg * NSEC_PER_MSEC / 2; | |
1252 | } | |
1253 | ||
1254 | static void sched_avg_update(struct rq *rq) | |
1255 | { | |
1256 | s64 period = sched_avg_period(); | |
1257 | ||
1258 | while ((s64)(rq->clock - rq->age_stamp) > period) { | |
1259 | rq->age_stamp += period; | |
1260 | rq->rt_avg /= 2; | |
1261 | } | |
1262 | } | |
1263 | ||
1264 | static void sched_rt_avg_update(struct rq *rq, u64 rt_delta) | |
1265 | { | |
1266 | rq->rt_avg += rt_delta; | |
1267 | sched_avg_update(rq); | |
1268 | } | |
1269 | ||
6d6bc0ad | 1270 | #else /* !CONFIG_SMP */ |
31656519 | 1271 | static void resched_task(struct task_struct *p) |
c24d20db IM |
1272 | { |
1273 | assert_spin_locked(&task_rq(p)->lock); | |
31656519 | 1274 | set_tsk_need_resched(p); |
c24d20db | 1275 | } |
e9e9250b PZ |
1276 | |
1277 | static void sched_rt_avg_update(struct rq *rq, u64 rt_delta) | |
1278 | { | |
1279 | } | |
6d6bc0ad | 1280 | #endif /* CONFIG_SMP */ |
c24d20db | 1281 | |
45bf76df IM |
1282 | #if BITS_PER_LONG == 32 |
1283 | # define WMULT_CONST (~0UL) | |
1284 | #else | |
1285 | # define WMULT_CONST (1UL << 32) | |
1286 | #endif | |
1287 | ||
1288 | #define WMULT_SHIFT 32 | |
1289 | ||
194081eb IM |
1290 | /* |
1291 | * Shift right and round: | |
1292 | */ | |
cf2ab469 | 1293 | #define SRR(x, y) (((x) + (1UL << ((y) - 1))) >> (y)) |
194081eb | 1294 | |
a7be37ac PZ |
1295 | /* |
1296 | * delta *= weight / lw | |
1297 | */ | |
cb1c4fc9 | 1298 | static unsigned long |
45bf76df IM |
1299 | calc_delta_mine(unsigned long delta_exec, unsigned long weight, |
1300 | struct load_weight *lw) | |
1301 | { | |
1302 | u64 tmp; | |
1303 | ||
7a232e03 LJ |
1304 | if (!lw->inv_weight) { |
1305 | if (BITS_PER_LONG > 32 && unlikely(lw->weight >= WMULT_CONST)) | |
1306 | lw->inv_weight = 1; | |
1307 | else | |
1308 | lw->inv_weight = 1 + (WMULT_CONST-lw->weight/2) | |
1309 | / (lw->weight+1); | |
1310 | } | |
45bf76df IM |
1311 | |
1312 | tmp = (u64)delta_exec * weight; | |
1313 | /* | |
1314 | * Check whether we'd overflow the 64-bit multiplication: | |
1315 | */ | |
194081eb | 1316 | if (unlikely(tmp > WMULT_CONST)) |
cf2ab469 | 1317 | tmp = SRR(SRR(tmp, WMULT_SHIFT/2) * lw->inv_weight, |
194081eb IM |
1318 | WMULT_SHIFT/2); |
1319 | else | |
cf2ab469 | 1320 | tmp = SRR(tmp * lw->inv_weight, WMULT_SHIFT); |
45bf76df | 1321 | |
ecf691da | 1322 | return (unsigned long)min(tmp, (u64)(unsigned long)LONG_MAX); |
45bf76df IM |
1323 | } |
1324 | ||
1091985b | 1325 | static inline void update_load_add(struct load_weight *lw, unsigned long inc) |
45bf76df IM |
1326 | { |
1327 | lw->weight += inc; | |
e89996ae | 1328 | lw->inv_weight = 0; |
45bf76df IM |
1329 | } |
1330 | ||
1091985b | 1331 | static inline void update_load_sub(struct load_weight *lw, unsigned long dec) |
45bf76df IM |
1332 | { |
1333 | lw->weight -= dec; | |
e89996ae | 1334 | lw->inv_weight = 0; |
45bf76df IM |
1335 | } |
1336 | ||
2dd73a4f PW |
1337 | /* |
1338 | * To aid in avoiding the subversion of "niceness" due to uneven distribution | |
1339 | * of tasks with abnormal "nice" values across CPUs the contribution that | |
1340 | * each task makes to its run queue's load is weighted according to its | |
41a2d6cf | 1341 | * scheduling class and "nice" value. For SCHED_NORMAL tasks this is just a |
2dd73a4f PW |
1342 | * scaled version of the new time slice allocation that they receive on time |
1343 | * slice expiry etc. | |
1344 | */ | |
1345 | ||
cce7ade8 PZ |
1346 | #define WEIGHT_IDLEPRIO 3 |
1347 | #define WMULT_IDLEPRIO 1431655765 | |
dd41f596 IM |
1348 | |
1349 | /* | |
1350 | * Nice levels are multiplicative, with a gentle 10% change for every | |
1351 | * nice level changed. I.e. when a CPU-bound task goes from nice 0 to | |
1352 | * nice 1, it will get ~10% less CPU time than another CPU-bound task | |
1353 | * that remained on nice 0. | |
1354 | * | |
1355 | * The "10% effect" is relative and cumulative: from _any_ nice level, | |
1356 | * if you go up 1 level, it's -10% CPU usage, if you go down 1 level | |
f9153ee6 IM |
1357 | * it's +10% CPU usage. (to achieve that we use a multiplier of 1.25. |
1358 | * If a task goes up by ~10% and another task goes down by ~10% then | |
1359 | * the relative distance between them is ~25%.) | |
dd41f596 IM |
1360 | */ |
1361 | static const int prio_to_weight[40] = { | |
254753dc IM |
1362 | /* -20 */ 88761, 71755, 56483, 46273, 36291, |
1363 | /* -15 */ 29154, 23254, 18705, 14949, 11916, | |
1364 | /* -10 */ 9548, 7620, 6100, 4904, 3906, | |
1365 | /* -5 */ 3121, 2501, 1991, 1586, 1277, | |
1366 | /* 0 */ 1024, 820, 655, 526, 423, | |
1367 | /* 5 */ 335, 272, 215, 172, 137, | |
1368 | /* 10 */ 110, 87, 70, 56, 45, | |
1369 | /* 15 */ 36, 29, 23, 18, 15, | |
dd41f596 IM |
1370 | }; |
1371 | ||
5714d2de IM |
1372 | /* |
1373 | * Inverse (2^32/x) values of the prio_to_weight[] array, precalculated. | |
1374 | * | |
1375 | * In cases where the weight does not change often, we can use the | |
1376 | * precalculated inverse to speed up arithmetics by turning divisions | |
1377 | * into multiplications: | |
1378 | */ | |
dd41f596 | 1379 | static const u32 prio_to_wmult[40] = { |
254753dc IM |
1380 | /* -20 */ 48388, 59856, 76040, 92818, 118348, |
1381 | /* -15 */ 147320, 184698, 229616, 287308, 360437, | |
1382 | /* -10 */ 449829, 563644, 704093, 875809, 1099582, | |
1383 | /* -5 */ 1376151, 1717300, 2157191, 2708050, 3363326, | |
1384 | /* 0 */ 4194304, 5237765, 6557202, 8165337, 10153587, | |
1385 | /* 5 */ 12820798, 15790321, 19976592, 24970740, 31350126, | |
1386 | /* 10 */ 39045157, 49367440, 61356676, 76695844, 95443717, | |
1387 | /* 15 */ 119304647, 148102320, 186737708, 238609294, 286331153, | |
dd41f596 | 1388 | }; |
2dd73a4f | 1389 | |
dd41f596 IM |
1390 | static void activate_task(struct rq *rq, struct task_struct *p, int wakeup); |
1391 | ||
1392 | /* | |
1393 | * runqueue iterator, to support SMP load-balancing between different | |
1394 | * scheduling classes, without having to expose their internal data | |
1395 | * structures to the load-balancing proper: | |
1396 | */ | |
1397 | struct rq_iterator { | |
1398 | void *arg; | |
1399 | struct task_struct *(*start)(void *); | |
1400 | struct task_struct *(*next)(void *); | |
1401 | }; | |
1402 | ||
e1d1484f PW |
1403 | #ifdef CONFIG_SMP |
1404 | static unsigned long | |
1405 | balance_tasks(struct rq *this_rq, int this_cpu, struct rq *busiest, | |
1406 | unsigned long max_load_move, struct sched_domain *sd, | |
1407 | enum cpu_idle_type idle, int *all_pinned, | |
1408 | int *this_best_prio, struct rq_iterator *iterator); | |
1409 | ||
1410 | static int | |
1411 | iter_move_one_task(struct rq *this_rq, int this_cpu, struct rq *busiest, | |
1412 | struct sched_domain *sd, enum cpu_idle_type idle, | |
1413 | struct rq_iterator *iterator); | |
e1d1484f | 1414 | #endif |
dd41f596 | 1415 | |
ef12fefa BR |
1416 | /* Time spent by the tasks of the cpu accounting group executing in ... */ |
1417 | enum cpuacct_stat_index { | |
1418 | CPUACCT_STAT_USER, /* ... user mode */ | |
1419 | CPUACCT_STAT_SYSTEM, /* ... kernel mode */ | |
1420 | ||
1421 | CPUACCT_STAT_NSTATS, | |
1422 | }; | |
1423 | ||
d842de87 SV |
1424 | #ifdef CONFIG_CGROUP_CPUACCT |
1425 | static void cpuacct_charge(struct task_struct *tsk, u64 cputime); | |
ef12fefa BR |
1426 | static void cpuacct_update_stats(struct task_struct *tsk, |
1427 | enum cpuacct_stat_index idx, cputime_t val); | |
d842de87 SV |
1428 | #else |
1429 | static inline void cpuacct_charge(struct task_struct *tsk, u64 cputime) {} | |
ef12fefa BR |
1430 | static inline void cpuacct_update_stats(struct task_struct *tsk, |
1431 | enum cpuacct_stat_index idx, cputime_t val) {} | |
d842de87 SV |
1432 | #endif |
1433 | ||
18d95a28 PZ |
1434 | static inline void inc_cpu_load(struct rq *rq, unsigned long load) |
1435 | { | |
1436 | update_load_add(&rq->load, load); | |
1437 | } | |
1438 | ||
1439 | static inline void dec_cpu_load(struct rq *rq, unsigned long load) | |
1440 | { | |
1441 | update_load_sub(&rq->load, load); | |
1442 | } | |
1443 | ||
7940ca36 | 1444 | #if (defined(CONFIG_SMP) && defined(CONFIG_FAIR_GROUP_SCHED)) || defined(CONFIG_RT_GROUP_SCHED) |
eb755805 | 1445 | typedef int (*tg_visitor)(struct task_group *, void *); |
c09595f6 PZ |
1446 | |
1447 | /* | |
1448 | * Iterate the full tree, calling @down when first entering a node and @up when | |
1449 | * leaving it for the final time. | |
1450 | */ | |
eb755805 | 1451 | static int walk_tg_tree(tg_visitor down, tg_visitor up, void *data) |
c09595f6 PZ |
1452 | { |
1453 | struct task_group *parent, *child; | |
eb755805 | 1454 | int ret; |
c09595f6 PZ |
1455 | |
1456 | rcu_read_lock(); | |
1457 | parent = &root_task_group; | |
1458 | down: | |
eb755805 PZ |
1459 | ret = (*down)(parent, data); |
1460 | if (ret) | |
1461 | goto out_unlock; | |
c09595f6 PZ |
1462 | list_for_each_entry_rcu(child, &parent->children, siblings) { |
1463 | parent = child; | |
1464 | goto down; | |
1465 | ||
1466 | up: | |
1467 | continue; | |
1468 | } | |
eb755805 PZ |
1469 | ret = (*up)(parent, data); |
1470 | if (ret) | |
1471 | goto out_unlock; | |
c09595f6 PZ |
1472 | |
1473 | child = parent; | |
1474 | parent = parent->parent; | |
1475 | if (parent) | |
1476 | goto up; | |
eb755805 | 1477 | out_unlock: |
c09595f6 | 1478 | rcu_read_unlock(); |
eb755805 PZ |
1479 | |
1480 | return ret; | |
c09595f6 PZ |
1481 | } |
1482 | ||
eb755805 PZ |
1483 | static int tg_nop(struct task_group *tg, void *data) |
1484 | { | |
1485 | return 0; | |
c09595f6 | 1486 | } |
eb755805 PZ |
1487 | #endif |
1488 | ||
1489 | #ifdef CONFIG_SMP | |
f5f08f39 PZ |
1490 | /* Used instead of source_load when we know the type == 0 */ |
1491 | static unsigned long weighted_cpuload(const int cpu) | |
1492 | { | |
1493 | return cpu_rq(cpu)->load.weight; | |
1494 | } | |
1495 | ||
1496 | /* | |
1497 | * Return a low guess at the load of a migration-source cpu weighted | |
1498 | * according to the scheduling class and "nice" value. | |
1499 | * | |
1500 | * We want to under-estimate the load of migration sources, to | |
1501 | * balance conservatively. | |
1502 | */ | |
1503 | static unsigned long source_load(int cpu, int type) | |
1504 | { | |
1505 | struct rq *rq = cpu_rq(cpu); | |
1506 | unsigned long total = weighted_cpuload(cpu); | |
1507 | ||
1508 | if (type == 0 || !sched_feat(LB_BIAS)) | |
1509 | return total; | |
1510 | ||
1511 | return min(rq->cpu_load[type-1], total); | |
1512 | } | |
1513 | ||
1514 | /* | |
1515 | * Return a high guess at the load of a migration-target cpu weighted | |
1516 | * according to the scheduling class and "nice" value. | |
1517 | */ | |
1518 | static unsigned long target_load(int cpu, int type) | |
1519 | { | |
1520 | struct rq *rq = cpu_rq(cpu); | |
1521 | unsigned long total = weighted_cpuload(cpu); | |
1522 | ||
1523 | if (type == 0 || !sched_feat(LB_BIAS)) | |
1524 | return total; | |
1525 | ||
1526 | return max(rq->cpu_load[type-1], total); | |
1527 | } | |
1528 | ||
ae154be1 PZ |
1529 | static struct sched_group *group_of(int cpu) |
1530 | { | |
1531 | struct sched_domain *sd = rcu_dereference(cpu_rq(cpu)->sd); | |
1532 | ||
1533 | if (!sd) | |
1534 | return NULL; | |
1535 | ||
1536 | return sd->groups; | |
1537 | } | |
1538 | ||
1539 | static unsigned long power_of(int cpu) | |
1540 | { | |
1541 | struct sched_group *group = group_of(cpu); | |
1542 | ||
1543 | if (!group) | |
1544 | return SCHED_LOAD_SCALE; | |
1545 | ||
1546 | return group->cpu_power; | |
1547 | } | |
1548 | ||
eb755805 PZ |
1549 | static int task_hot(struct task_struct *p, u64 now, struct sched_domain *sd); |
1550 | ||
1551 | static unsigned long cpu_avg_load_per_task(int cpu) | |
1552 | { | |
1553 | struct rq *rq = cpu_rq(cpu); | |
af6d596f | 1554 | unsigned long nr_running = ACCESS_ONCE(rq->nr_running); |
eb755805 | 1555 | |
4cd42620 SR |
1556 | if (nr_running) |
1557 | rq->avg_load_per_task = rq->load.weight / nr_running; | |
a2d47777 BS |
1558 | else |
1559 | rq->avg_load_per_task = 0; | |
eb755805 PZ |
1560 | |
1561 | return rq->avg_load_per_task; | |
1562 | } | |
1563 | ||
1564 | #ifdef CONFIG_FAIR_GROUP_SCHED | |
c09595f6 | 1565 | |
34d76c41 PZ |
1566 | struct update_shares_data { |
1567 | unsigned long rq_weight[NR_CPUS]; | |
1568 | }; | |
1569 | ||
1570 | static DEFINE_PER_CPU(struct update_shares_data, update_shares_data); | |
1571 | ||
c09595f6 PZ |
1572 | static void __set_se_shares(struct sched_entity *se, unsigned long shares); |
1573 | ||
1574 | /* | |
1575 | * Calculate and set the cpu's group shares. | |
1576 | */ | |
34d76c41 PZ |
1577 | static void update_group_shares_cpu(struct task_group *tg, int cpu, |
1578 | unsigned long sd_shares, | |
1579 | unsigned long sd_rq_weight, | |
1580 | struct update_shares_data *usd) | |
18d95a28 | 1581 | { |
34d76c41 | 1582 | unsigned long shares, rq_weight; |
a5004278 | 1583 | int boost = 0; |
c09595f6 | 1584 | |
34d76c41 | 1585 | rq_weight = usd->rq_weight[cpu]; |
a5004278 PZ |
1586 | if (!rq_weight) { |
1587 | boost = 1; | |
1588 | rq_weight = NICE_0_LOAD; | |
1589 | } | |
c8cba857 | 1590 | |
c09595f6 | 1591 | /* |
a8af7246 PZ |
1592 | * \Sum_j shares_j * rq_weight_i |
1593 | * shares_i = ----------------------------- | |
1594 | * \Sum_j rq_weight_j | |
c09595f6 | 1595 | */ |
ec4e0e2f | 1596 | shares = (sd_shares * rq_weight) / sd_rq_weight; |
ffda12a1 | 1597 | shares = clamp_t(unsigned long, shares, MIN_SHARES, MAX_SHARES); |
c09595f6 | 1598 | |
ffda12a1 PZ |
1599 | if (abs(shares - tg->se[cpu]->load.weight) > |
1600 | sysctl_sched_shares_thresh) { | |
1601 | struct rq *rq = cpu_rq(cpu); | |
1602 | unsigned long flags; | |
c09595f6 | 1603 | |
ffda12a1 | 1604 | spin_lock_irqsave(&rq->lock, flags); |
34d76c41 | 1605 | tg->cfs_rq[cpu]->rq_weight = boost ? 0 : rq_weight; |
a5004278 | 1606 | tg->cfs_rq[cpu]->shares = boost ? 0 : shares; |
ffda12a1 PZ |
1607 | __set_se_shares(tg->se[cpu], shares); |
1608 | spin_unlock_irqrestore(&rq->lock, flags); | |
1609 | } | |
18d95a28 | 1610 | } |
c09595f6 PZ |
1611 | |
1612 | /* | |
c8cba857 PZ |
1613 | * Re-compute the task group their per cpu shares over the given domain. |
1614 | * This needs to be done in a bottom-up fashion because the rq weight of a | |
1615 | * parent group depends on the shares of its child groups. | |
c09595f6 | 1616 | */ |
eb755805 | 1617 | static int tg_shares_up(struct task_group *tg, void *data) |
c09595f6 | 1618 | { |
34d76c41 PZ |
1619 | unsigned long weight, rq_weight = 0, shares = 0; |
1620 | struct update_shares_data *usd; | |
eb755805 | 1621 | struct sched_domain *sd = data; |
34d76c41 | 1622 | unsigned long flags; |
c8cba857 | 1623 | int i; |
c09595f6 | 1624 | |
34d76c41 PZ |
1625 | if (!tg->se[0]) |
1626 | return 0; | |
1627 | ||
1628 | local_irq_save(flags); | |
1629 | usd = &__get_cpu_var(update_shares_data); | |
1630 | ||
758b2cdc | 1631 | for_each_cpu(i, sched_domain_span(sd)) { |
34d76c41 PZ |
1632 | weight = tg->cfs_rq[i]->load.weight; |
1633 | usd->rq_weight[i] = weight; | |
1634 | ||
ec4e0e2f KC |
1635 | /* |
1636 | * If there are currently no tasks on the cpu pretend there | |
1637 | * is one of average load so that when a new task gets to | |
1638 | * run here it will not get delayed by group starvation. | |
1639 | */ | |
ec4e0e2f KC |
1640 | if (!weight) |
1641 | weight = NICE_0_LOAD; | |
1642 | ||
ec4e0e2f | 1643 | rq_weight += weight; |
c8cba857 | 1644 | shares += tg->cfs_rq[i]->shares; |
c09595f6 | 1645 | } |
c09595f6 | 1646 | |
c8cba857 PZ |
1647 | if ((!shares && rq_weight) || shares > tg->shares) |
1648 | shares = tg->shares; | |
1649 | ||
1650 | if (!sd->parent || !(sd->parent->flags & SD_LOAD_BALANCE)) | |
1651 | shares = tg->shares; | |
c09595f6 | 1652 | |
758b2cdc | 1653 | for_each_cpu(i, sched_domain_span(sd)) |
34d76c41 PZ |
1654 | update_group_shares_cpu(tg, i, shares, rq_weight, usd); |
1655 | ||
1656 | local_irq_restore(flags); | |
eb755805 PZ |
1657 | |
1658 | return 0; | |
c09595f6 PZ |
1659 | } |
1660 | ||
1661 | /* | |
c8cba857 PZ |
1662 | * Compute the cpu's hierarchical load factor for each task group. |
1663 | * This needs to be done in a top-down fashion because the load of a child | |
1664 | * group is a fraction of its parents load. | |
c09595f6 | 1665 | */ |
eb755805 | 1666 | static int tg_load_down(struct task_group *tg, void *data) |
c09595f6 | 1667 | { |
c8cba857 | 1668 | unsigned long load; |
eb755805 | 1669 | long cpu = (long)data; |
c09595f6 | 1670 | |
c8cba857 PZ |
1671 | if (!tg->parent) { |
1672 | load = cpu_rq(cpu)->load.weight; | |
1673 | } else { | |
1674 | load = tg->parent->cfs_rq[cpu]->h_load; | |
1675 | load *= tg->cfs_rq[cpu]->shares; | |
1676 | load /= tg->parent->cfs_rq[cpu]->load.weight + 1; | |
1677 | } | |
c09595f6 | 1678 | |
c8cba857 | 1679 | tg->cfs_rq[cpu]->h_load = load; |
c09595f6 | 1680 | |
eb755805 | 1681 | return 0; |
c09595f6 PZ |
1682 | } |
1683 | ||
c8cba857 | 1684 | static void update_shares(struct sched_domain *sd) |
4d8d595d | 1685 | { |
e7097159 PZ |
1686 | s64 elapsed; |
1687 | u64 now; | |
1688 | ||
1689 | if (root_task_group_empty()) | |
1690 | return; | |
1691 | ||
1692 | now = cpu_clock(raw_smp_processor_id()); | |
1693 | elapsed = now - sd->last_update; | |
2398f2c6 PZ |
1694 | |
1695 | if (elapsed >= (s64)(u64)sysctl_sched_shares_ratelimit) { | |
1696 | sd->last_update = now; | |
eb755805 | 1697 | walk_tg_tree(tg_nop, tg_shares_up, sd); |
2398f2c6 | 1698 | } |
4d8d595d PZ |
1699 | } |
1700 | ||
3e5459b4 PZ |
1701 | static void update_shares_locked(struct rq *rq, struct sched_domain *sd) |
1702 | { | |
e7097159 PZ |
1703 | if (root_task_group_empty()) |
1704 | return; | |
1705 | ||
3e5459b4 PZ |
1706 | spin_unlock(&rq->lock); |
1707 | update_shares(sd); | |
1708 | spin_lock(&rq->lock); | |
1709 | } | |
1710 | ||
eb755805 | 1711 | static void update_h_load(long cpu) |
c09595f6 | 1712 | { |
e7097159 PZ |
1713 | if (root_task_group_empty()) |
1714 | return; | |
1715 | ||
eb755805 | 1716 | walk_tg_tree(tg_load_down, tg_nop, (void *)cpu); |
c09595f6 PZ |
1717 | } |
1718 | ||
c09595f6 PZ |
1719 | #else |
1720 | ||
c8cba857 | 1721 | static inline void update_shares(struct sched_domain *sd) |
4d8d595d PZ |
1722 | { |
1723 | } | |
1724 | ||
3e5459b4 PZ |
1725 | static inline void update_shares_locked(struct rq *rq, struct sched_domain *sd) |
1726 | { | |
1727 | } | |
1728 | ||
18d95a28 PZ |
1729 | #endif |
1730 | ||
8f45e2b5 GH |
1731 | #ifdef CONFIG_PREEMPT |
1732 | ||
b78bb868 PZ |
1733 | static void double_rq_lock(struct rq *rq1, struct rq *rq2); |
1734 | ||
70574a99 | 1735 | /* |
8f45e2b5 GH |
1736 | * fair double_lock_balance: Safely acquires both rq->locks in a fair |
1737 | * way at the expense of forcing extra atomic operations in all | |
1738 | * invocations. This assures that the double_lock is acquired using the | |
1739 | * same underlying policy as the spinlock_t on this architecture, which | |
1740 | * reduces latency compared to the unfair variant below. However, it | |
1741 | * also adds more overhead and therefore may reduce throughput. | |
70574a99 | 1742 | */ |
8f45e2b5 GH |
1743 | static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) |
1744 | __releases(this_rq->lock) | |
1745 | __acquires(busiest->lock) | |
1746 | __acquires(this_rq->lock) | |
1747 | { | |
1748 | spin_unlock(&this_rq->lock); | |
1749 | double_rq_lock(this_rq, busiest); | |
1750 | ||
1751 | return 1; | |
1752 | } | |
1753 | ||
1754 | #else | |
1755 | /* | |
1756 | * Unfair double_lock_balance: Optimizes throughput at the expense of | |
1757 | * latency by eliminating extra atomic operations when the locks are | |
1758 | * already in proper order on entry. This favors lower cpu-ids and will | |
1759 | * grant the double lock to lower cpus over higher ids under contention, | |
1760 | * regardless of entry order into the function. | |
1761 | */ | |
1762 | static int _double_lock_balance(struct rq *this_rq, struct rq *busiest) | |
70574a99 AD |
1763 | __releases(this_rq->lock) |
1764 | __acquires(busiest->lock) | |
1765 | __acquires(this_rq->lock) | |
1766 | { | |
1767 | int ret = 0; | |
1768 | ||
70574a99 AD |
1769 | if (unlikely(!spin_trylock(&busiest->lock))) { |
1770 | if (busiest < this_rq) { | |
1771 | spin_unlock(&this_rq->lock); | |
1772 | spin_lock(&busiest->lock); | |
1773 | spin_lock_nested(&this_rq->lock, SINGLE_DEPTH_NESTING); | |
1774 | ret = 1; | |
1775 | } else | |
1776 | spin_lock_nested(&busiest->lock, SINGLE_DEPTH_NESTING); | |
1777 | } | |
1778 | return ret; | |
1779 | } | |
1780 | ||
8f45e2b5 GH |
1781 | #endif /* CONFIG_PREEMPT */ |
1782 | ||
1783 | /* | |
1784 | * double_lock_balance - lock the busiest runqueue, this_rq is locked already. | |
1785 | */ | |
1786 | static int double_lock_balance(struct rq *this_rq, struct rq *busiest) | |
1787 | { | |
1788 | if (unlikely(!irqs_disabled())) { | |
1789 | /* printk() doesn't work good under rq->lock */ | |
1790 | spin_unlock(&this_rq->lock); | |
1791 | BUG_ON(1); | |
1792 | } | |
1793 | ||
1794 | return _double_lock_balance(this_rq, busiest); | |
1795 | } | |
1796 | ||
70574a99 AD |
1797 | static inline void double_unlock_balance(struct rq *this_rq, struct rq *busiest) |
1798 | __releases(busiest->lock) | |
1799 | { | |
1800 | spin_unlock(&busiest->lock); | |
1801 | lock_set_subclass(&this_rq->lock.dep_map, 0, _RET_IP_); | |
1802 | } | |
18d95a28 PZ |
1803 | #endif |
1804 | ||
30432094 | 1805 | #ifdef CONFIG_FAIR_GROUP_SCHED |
34e83e85 IM |
1806 | static void cfs_rq_set_shares(struct cfs_rq *cfs_rq, unsigned long shares) |
1807 | { | |
30432094 | 1808 | #ifdef CONFIG_SMP |
34e83e85 IM |
1809 | cfs_rq->shares = shares; |
1810 | #endif | |
1811 | } | |
30432094 | 1812 | #endif |
e7693a36 | 1813 | |
dce48a84 TG |
1814 | static void calc_load_account_active(struct rq *this_rq); |
1815 | ||
dd41f596 | 1816 | #include "sched_stats.h" |
dd41f596 | 1817 | #include "sched_idletask.c" |
5522d5d5 IM |
1818 | #include "sched_fair.c" |
1819 | #include "sched_rt.c" | |
dd41f596 IM |
1820 | #ifdef CONFIG_SCHED_DEBUG |
1821 | # include "sched_debug.c" | |
1822 | #endif | |
1823 | ||
1824 | #define sched_class_highest (&rt_sched_class) | |
1f11eb6a GH |
1825 | #define for_each_class(class) \ |
1826 | for (class = sched_class_highest; class; class = class->next) | |
dd41f596 | 1827 | |
c09595f6 | 1828 | static void inc_nr_running(struct rq *rq) |
9c217245 IM |
1829 | { |
1830 | rq->nr_running++; | |
9c217245 IM |
1831 | } |
1832 | ||
c09595f6 | 1833 | static void dec_nr_running(struct rq *rq) |
9c217245 IM |
1834 | { |
1835 | rq->nr_running--; | |
9c217245 IM |
1836 | } |
1837 | ||
45bf76df IM |
1838 | static void set_load_weight(struct task_struct *p) |
1839 | { | |
1840 | if (task_has_rt_policy(p)) { | |
dd41f596 IM |
1841 | p->se.load.weight = prio_to_weight[0] * 2; |
1842 | p->se.load.inv_weight = prio_to_wmult[0] >> 1; | |
1843 | return; | |
1844 | } | |
45bf76df | 1845 | |
dd41f596 IM |
1846 | /* |
1847 | * SCHED_IDLE tasks get minimal weight: | |
1848 | */ | |
1849 | if (p->policy == SCHED_IDLE) { | |
1850 | p->se.load.weight = WEIGHT_IDLEPRIO; | |
1851 | p->se.load.inv_weight = WMULT_IDLEPRIO; | |
1852 | return; | |
1853 | } | |
71f8bd46 | 1854 | |
dd41f596 IM |
1855 | p->se.load.weight = prio_to_weight[p->static_prio - MAX_RT_PRIO]; |
1856 | p->se.load.inv_weight = prio_to_wmult[p->static_prio - MAX_RT_PRIO]; | |
71f8bd46 IM |
1857 | } |
1858 | ||
2087a1ad GH |
1859 | static void update_avg(u64 *avg, u64 sample) |
1860 | { | |
1861 | s64 diff = sample - *avg; | |
1862 | *avg += diff >> 3; | |
1863 | } | |
1864 | ||
8159f87e | 1865 | static void enqueue_task(struct rq *rq, struct task_struct *p, int wakeup) |
71f8bd46 | 1866 | { |
831451ac PZ |
1867 | if (wakeup) |
1868 | p->se.start_runtime = p->se.sum_exec_runtime; | |
1869 | ||
dd41f596 | 1870 | sched_info_queued(p); |
fd390f6a | 1871 | p->sched_class->enqueue_task(rq, p, wakeup); |
dd41f596 | 1872 | p->se.on_rq = 1; |
71f8bd46 IM |
1873 | } |
1874 | ||
69be72c1 | 1875 | static void dequeue_task(struct rq *rq, struct task_struct *p, int sleep) |
71f8bd46 | 1876 | { |
831451ac PZ |
1877 | if (sleep) { |
1878 | if (p->se.last_wakeup) { | |
1879 | update_avg(&p->se.avg_overlap, | |
1880 | p->se.sum_exec_runtime - p->se.last_wakeup); | |
1881 | p->se.last_wakeup = 0; | |
1882 | } else { | |
1883 | update_avg(&p->se.avg_wakeup, | |
1884 | sysctl_sched_wakeup_granularity); | |
1885 | } | |
2087a1ad GH |
1886 | } |
1887 | ||
46ac22ba | 1888 | sched_info_dequeued(p); |
f02231e5 | 1889 | p->sched_class->dequeue_task(rq, p, sleep); |
dd41f596 | 1890 | p->se.on_rq = 0; |
71f8bd46 IM |
1891 | } |
1892 | ||
14531189 | 1893 | /* |
dd41f596 | 1894 | * __normal_prio - return the priority that is based on the static prio |
14531189 | 1895 | */ |
14531189 IM |
1896 | static inline int __normal_prio(struct task_struct *p) |
1897 | { | |
dd41f596 | 1898 | return p->static_prio; |
14531189 IM |
1899 | } |
1900 | ||
b29739f9 IM |
1901 | /* |
1902 | * Calculate the expected normal priority: i.e. priority | |
1903 | * without taking RT-inheritance into account. Might be | |
1904 | * boosted by interactivity modifiers. Changes upon fork, | |
1905 | * setprio syscalls, and whenever the interactivity | |
1906 | * estimator recalculates. | |
1907 | */ | |
36c8b586 | 1908 | static inline int normal_prio(struct task_struct *p) |
b29739f9 IM |
1909 | { |
1910 | int prio; | |
1911 | ||
e05606d3 | 1912 | if (task_has_rt_policy(p)) |
b29739f9 IM |
1913 | prio = MAX_RT_PRIO-1 - p->rt_priority; |
1914 | else | |
1915 | prio = __normal_prio(p); | |
1916 | return prio; | |
1917 | } | |
1918 | ||
1919 | /* | |
1920 | * Calculate the current priority, i.e. the priority | |
1921 | * taken into account by the scheduler. This value might | |
1922 | * be boosted by RT tasks, or might be boosted by | |
1923 | * interactivity modifiers. Will be RT if the task got | |
1924 | * RT-boosted. If not then it returns p->normal_prio. | |
1925 | */ | |
36c8b586 | 1926 | static int effective_prio(struct task_struct *p) |
b29739f9 IM |
1927 | { |
1928 | p->normal_prio = normal_prio(p); | |
1929 | /* | |
1930 | * If we are RT tasks or we were boosted to RT priority, | |
1931 | * keep the priority unchanged. Otherwise, update priority | |
1932 | * to the normal priority: | |
1933 | */ | |
1934 | if (!rt_prio(p->prio)) | |
1935 | return p->normal_prio; | |
1936 | return p->prio; | |
1937 | } | |
1938 | ||
1da177e4 | 1939 | /* |
dd41f596 | 1940 | * activate_task - move a task to the runqueue. |
1da177e4 | 1941 | */ |
dd41f596 | 1942 | static void activate_task(struct rq *rq, struct task_struct *p, int wakeup) |
1da177e4 | 1943 | { |
d9514f6c | 1944 | if (task_contributes_to_load(p)) |
dd41f596 | 1945 | rq->nr_uninterruptible--; |
1da177e4 | 1946 | |
8159f87e | 1947 | enqueue_task(rq, p, wakeup); |
c09595f6 | 1948 | inc_nr_running(rq); |
1da177e4 LT |
1949 | } |
1950 | ||
1da177e4 LT |
1951 | /* |
1952 | * deactivate_task - remove a task from the runqueue. | |
1953 | */ | |
2e1cb74a | 1954 | static void deactivate_task(struct rq *rq, struct task_struct *p, int sleep) |
1da177e4 | 1955 | { |
d9514f6c | 1956 | if (task_contributes_to_load(p)) |
dd41f596 IM |
1957 | rq->nr_uninterruptible++; |
1958 | ||
69be72c1 | 1959 | dequeue_task(rq, p, sleep); |
c09595f6 | 1960 | dec_nr_running(rq); |
1da177e4 LT |
1961 | } |
1962 | ||
1da177e4 LT |
1963 | /** |
1964 | * task_curr - is this task currently executing on a CPU? | |
1965 | * @p: the task in question. | |
1966 | */ | |
36c8b586 | 1967 | inline int task_curr(const struct task_struct *p) |
1da177e4 LT |
1968 | { |
1969 | return cpu_curr(task_cpu(p)) == p; | |
1970 | } | |
1971 | ||
dd41f596 IM |
1972 | static inline void __set_task_cpu(struct task_struct *p, unsigned int cpu) |
1973 | { | |
6f505b16 | 1974 | set_task_rq(p, cpu); |
dd41f596 | 1975 | #ifdef CONFIG_SMP |
ce96b5ac DA |
1976 | /* |
1977 | * After ->cpu is set up to a new value, task_rq_lock(p, ...) can be | |
1978 | * successfuly executed on another CPU. We must ensure that updates of | |
1979 | * per-task data have been completed by this moment. | |
1980 | */ | |
1981 | smp_wmb(); | |
dd41f596 | 1982 | task_thread_info(p)->cpu = cpu; |
dd41f596 | 1983 | #endif |
2dd73a4f PW |
1984 | } |
1985 | ||
cb469845 SR |
1986 | static inline void check_class_changed(struct rq *rq, struct task_struct *p, |
1987 | const struct sched_class *prev_class, | |
1988 | int oldprio, int running) | |
1989 | { | |
1990 | if (prev_class != p->sched_class) { | |
1991 | if (prev_class->switched_from) | |
1992 | prev_class->switched_from(rq, p, running); | |
1993 | p->sched_class->switched_to(rq, p, running); | |
1994 | } else | |
1995 | p->sched_class->prio_changed(rq, p, oldprio, running); | |
1996 | } | |
1997 | ||
1da177e4 | 1998 | #ifdef CONFIG_SMP |
cc367732 IM |
1999 | /* |
2000 | * Is this task likely cache-hot: | |
2001 | */ | |
e7693a36 | 2002 | static int |
cc367732 IM |
2003 | task_hot(struct task_struct *p, u64 now, struct sched_domain *sd) |
2004 | { | |
2005 | s64 delta; | |
2006 | ||
f540a608 IM |
2007 | /* |
2008 | * Buddy candidates are cache hot: | |
2009 | */ | |
4793241b PZ |
2010 | if (sched_feat(CACHE_HOT_BUDDY) && |
2011 | (&p->se == cfs_rq_of(&p->se)->next || | |
2012 | &p->se == cfs_rq_of(&p->se)->last)) | |
f540a608 IM |
2013 | return 1; |
2014 | ||
cc367732 IM |
2015 | if (p->sched_class != &fair_sched_class) |
2016 | return 0; | |
2017 | ||
6bc1665b IM |
2018 | if (sysctl_sched_migration_cost == -1) |
2019 | return 1; | |
2020 | if (sysctl_sched_migration_cost == 0) | |
2021 | return 0; | |
2022 | ||
cc367732 IM |
2023 | delta = now - p->se.exec_start; |
2024 | ||
2025 | return delta < (s64)sysctl_sched_migration_cost; | |
2026 | } | |
2027 | ||
2028 | ||
dd41f596 | 2029 | void set_task_cpu(struct task_struct *p, unsigned int new_cpu) |
c65cc870 | 2030 | { |
dd41f596 IM |
2031 | int old_cpu = task_cpu(p); |
2032 | struct rq *old_rq = cpu_rq(old_cpu), *new_rq = cpu_rq(new_cpu); | |
2830cf8c SV |
2033 | struct cfs_rq *old_cfsrq = task_cfs_rq(p), |
2034 | *new_cfsrq = cpu_cfs_rq(old_cfsrq, new_cpu); | |
bbdba7c0 | 2035 | u64 clock_offset; |
dd41f596 IM |
2036 | |
2037 | clock_offset = old_rq->clock - new_rq->clock; | |
6cfb0d5d | 2038 | |
de1d7286 | 2039 | trace_sched_migrate_task(p, new_cpu); |
cbc34ed1 | 2040 | |
6cfb0d5d IM |
2041 | #ifdef CONFIG_SCHEDSTATS |
2042 | if (p->se.wait_start) | |
2043 | p->se.wait_start -= clock_offset; | |
dd41f596 IM |
2044 | if (p->se.sleep_start) |
2045 | p->se.sleep_start -= clock_offset; | |
2046 | if (p->se.block_start) | |
2047 | p->se.block_start -= clock_offset; | |
6c594c21 | 2048 | #endif |
cc367732 | 2049 | if (old_cpu != new_cpu) { |
6c594c21 | 2050 | p->se.nr_migrations++; |
23a185ca | 2051 | new_rq->nr_migrations_in++; |
6c594c21 | 2052 | #ifdef CONFIG_SCHEDSTATS |
cc367732 IM |
2053 | if (task_hot(p, old_rq->clock, NULL)) |
2054 | schedstat_inc(p, se.nr_forced2_migrations); | |
6cfb0d5d | 2055 | #endif |
cdd6c482 | 2056 | perf_sw_event(PERF_COUNT_SW_CPU_MIGRATIONS, |
e5289d4a | 2057 | 1, 1, NULL, 0); |
6c594c21 | 2058 | } |
2830cf8c SV |
2059 | p->se.vruntime -= old_cfsrq->min_vruntime - |
2060 | new_cfsrq->min_vruntime; | |
dd41f596 IM |
2061 | |
2062 | __set_task_cpu(p, new_cpu); | |
c65cc870 IM |
2063 | } |
2064 | ||
70b97a7f | 2065 | struct migration_req { |
1da177e4 | 2066 | struct list_head list; |
1da177e4 | 2067 | |
36c8b586 | 2068 | struct task_struct *task; |
1da177e4 LT |
2069 | int dest_cpu; |
2070 | ||
1da177e4 | 2071 | struct completion done; |
70b97a7f | 2072 | }; |
1da177e4 LT |
2073 | |
2074 | /* | |
2075 | * The task's runqueue lock must be held. | |
2076 | * Returns true if you have to wait for migration thread. | |
2077 | */ | |
36c8b586 | 2078 | static int |
70b97a7f | 2079 | migrate_task(struct task_struct *p, int dest_cpu, struct migration_req *req) |
1da177e4 | 2080 | { |
70b97a7f | 2081 | struct rq *rq = task_rq(p); |
1da177e4 LT |
2082 | |
2083 | /* | |
2084 | * If the task is not on a runqueue (and not running), then | |
2085 | * it is sufficient to simply update the task's cpu field. | |
2086 | */ | |
dd41f596 | 2087 | if (!p->se.on_rq && !task_running(rq, p)) { |
1da177e4 LT |
2088 | set_task_cpu(p, dest_cpu); |
2089 | return 0; | |
2090 | } | |
2091 | ||
2092 | init_completion(&req->done); | |
1da177e4 LT |
2093 | req->task = p; |
2094 | req->dest_cpu = dest_cpu; | |
2095 | list_add(&req->list, &rq->migration_queue); | |
48f24c4d | 2096 | |
1da177e4 LT |
2097 | return 1; |
2098 | } | |
2099 | ||
a26b89f0 MM |
2100 | /* |
2101 | * wait_task_context_switch - wait for a thread to complete at least one | |
2102 | * context switch. | |
2103 | * | |
2104 | * @p must not be current. | |
2105 | */ | |
2106 | void wait_task_context_switch(struct task_struct *p) | |
2107 | { | |
2108 | unsigned long nvcsw, nivcsw, flags; | |
2109 | int running; | |
2110 | struct rq *rq; | |
2111 | ||
2112 | nvcsw = p->nvcsw; | |
2113 | nivcsw = p->nivcsw; | |
2114 | for (;;) { | |
2115 | /* | |
2116 | * The runqueue is assigned before the actual context | |
2117 | * switch. We need to take the runqueue lock. | |
2118 | * | |
2119 | * We could check initially without the lock but it is | |
2120 | * very likely that we need to take the lock in every | |
2121 | * iteration. | |
2122 | */ | |
2123 | rq = task_rq_lock(p, &flags); | |
2124 | running = task_running(rq, p); | |
2125 | task_rq_unlock(rq, &flags); | |
2126 | ||
2127 | if (likely(!running)) | |
2128 | break; | |
2129 | /* | |
2130 | * The switch count is incremented before the actual | |
2131 | * context switch. We thus wait for two switches to be | |
2132 | * sure at least one completed. | |
2133 | */ | |
2134 | if ((p->nvcsw - nvcsw) > 1) | |
2135 | break; | |
2136 | if ((p->nivcsw - nivcsw) > 1) | |
2137 | break; | |
2138 | ||
2139 | cpu_relax(); | |
2140 | } | |
2141 | } | |
2142 | ||
1da177e4 LT |
2143 | /* |
2144 | * wait_task_inactive - wait for a thread to unschedule. | |
2145 | * | |
85ba2d86 RM |
2146 | * If @match_state is nonzero, it's the @p->state value just checked and |
2147 | * not expected to change. If it changes, i.e. @p might have woken up, | |
2148 | * then return zero. When we succeed in waiting for @p to be off its CPU, | |
2149 | * we return a positive number (its total switch count). If a second call | |
2150 | * a short while later returns the same number, the caller can be sure that | |
2151 | * @p has remained unscheduled the whole time. | |
2152 | * | |
1da177e4 LT |
2153 | * The caller must ensure that the task *will* unschedule sometime soon, |
2154 | * else this function might spin for a *long* time. This function can't | |
2155 | * be called with interrupts off, or it may introduce deadlock with | |
2156 | * smp_call_function() if an IPI is sent by the same process we are | |
2157 | * waiting to become inactive. | |
2158 | */ | |
85ba2d86 | 2159 | unsigned long wait_task_inactive(struct task_struct *p, long match_state) |
1da177e4 LT |
2160 | { |
2161 | unsigned long flags; | |
dd41f596 | 2162 | int running, on_rq; |
85ba2d86 | 2163 | unsigned long ncsw; |
70b97a7f | 2164 | struct rq *rq; |
1da177e4 | 2165 | |
3a5c359a AK |
2166 | for (;;) { |
2167 | /* | |
2168 | * We do the initial early heuristics without holding | |
2169 | * any task-queue locks at all. We'll only try to get | |
2170 | * the runqueue lock when things look like they will | |
2171 | * work out! | |
2172 | */ | |
2173 | rq = task_rq(p); | |
fa490cfd | 2174 | |
3a5c359a AK |
2175 | /* |
2176 | * If the task is actively running on another CPU | |
2177 | * still, just relax and busy-wait without holding | |
2178 | * any locks. | |
2179 | * | |
2180 | * NOTE! Since we don't hold any locks, it's not | |
2181 | * even sure that "rq" stays as the right runqueue! | |
2182 | * But we don't care, since "task_running()" will | |
2183 | * return false if the runqueue has changed and p | |
2184 | * is actually now running somewhere else! | |
2185 | */ | |
85ba2d86 RM |
2186 | while (task_running(rq, p)) { |
2187 | if (match_state && unlikely(p->state != match_state)) | |
2188 | return 0; | |
3a5c359a | 2189 | cpu_relax(); |
85ba2d86 | 2190 | } |
fa490cfd | 2191 | |
3a5c359a AK |
2192 | /* |
2193 | * Ok, time to look more closely! We need the rq | |
2194 | * lock now, to be *sure*. If we're wrong, we'll | |
2195 | * just go back and repeat. | |
2196 | */ | |
2197 | rq = task_rq_lock(p, &flags); | |
0a16b607 | 2198 | trace_sched_wait_task(rq, p); |
3a5c359a AK |
2199 | running = task_running(rq, p); |
2200 | on_rq = p->se.on_rq; | |
85ba2d86 | 2201 | ncsw = 0; |
f31e11d8 | 2202 | if (!match_state || p->state == match_state) |
93dcf55f | 2203 | ncsw = p->nvcsw | LONG_MIN; /* sets MSB */ |
3a5c359a | 2204 | task_rq_unlock(rq, &flags); |
fa490cfd | 2205 | |
85ba2d86 RM |
2206 | /* |
2207 | * If it changed from the expected state, bail out now. | |
2208 | */ | |
2209 | if (unlikely(!ncsw)) | |
2210 | break; | |
2211 | ||
3a5c359a AK |
2212 | /* |
2213 | * Was it really running after all now that we | |
2214 | * checked with the proper locks actually held? | |
2215 | * | |
2216 | * Oops. Go back and try again.. | |
2217 | */ | |
2218 | if (unlikely(running)) { | |
2219 | cpu_relax(); | |
2220 | continue; | |
2221 | } | |
fa490cfd | 2222 | |
3a5c359a AK |
2223 | /* |
2224 | * It's not enough that it's not actively running, | |
2225 | * it must be off the runqueue _entirely_, and not | |
2226 | * preempted! | |
2227 | * | |
80dd99b3 | 2228 | * So if it was still runnable (but just not actively |
3a5c359a AK |
2229 | * running right now), it's preempted, and we should |
2230 | * yield - it could be a while. | |
2231 | */ | |
2232 | if (unlikely(on_rq)) { | |
2233 | schedule_timeout_uninterruptible(1); | |
2234 | continue; | |
2235 | } | |
fa490cfd | 2236 | |
3a5c359a AK |
2237 | /* |
2238 | * Ahh, all good. It wasn't running, and it wasn't | |
2239 | * runnable, which means that it will never become | |
2240 | * running in the future either. We're all done! | |
2241 | */ | |
2242 | break; | |
2243 | } | |
85ba2d86 RM |
2244 | |
2245 | return ncsw; | |
1da177e4 LT |
2246 | } |
2247 | ||
2248 | /*** | |
2249 | * kick_process - kick a running thread to enter/exit the kernel | |
2250 | * @p: the to-be-kicked thread | |
2251 | * | |
2252 | * Cause a process which is running on another CPU to enter | |
2253 | * kernel-mode, without any delay. (to get signals handled.) | |
2254 | * | |
2255 | * NOTE: this function doesnt have to take the runqueue lock, | |
2256 | * because all it wants to ensure is that the remote task enters | |
2257 | * the kernel. If the IPI races and the task has been migrated | |
2258 | * to another CPU then no harm is done and the purpose has been | |
2259 | * achieved as well. | |
2260 | */ | |
36c8b586 | 2261 | void kick_process(struct task_struct *p) |
1da177e4 LT |
2262 | { |
2263 | int cpu; | |
2264 | ||
2265 | preempt_disable(); | |
2266 | cpu = task_cpu(p); | |
2267 | if ((cpu != smp_processor_id()) && task_curr(p)) | |
2268 | smp_send_reschedule(cpu); | |
2269 | preempt_enable(); | |
2270 | } | |
b43e3521 | 2271 | EXPORT_SYMBOL_GPL(kick_process); |
476d139c | 2272 | #endif /* CONFIG_SMP */ |
1da177e4 | 2273 | |
0793a61d TG |
2274 | /** |
2275 | * task_oncpu_function_call - call a function on the cpu on which a task runs | |
2276 | * @p: the task to evaluate | |
2277 | * @func: the function to be called | |
2278 | * @info: the function call argument | |
2279 | * | |
2280 | * Calls the function @func when the task is currently running. This might | |
2281 | * be on the current CPU, which just calls the function directly | |
2282 | */ | |
2283 | void task_oncpu_function_call(struct task_struct *p, | |
2284 | void (*func) (void *info), void *info) | |
2285 | { | |
2286 | int cpu; | |
2287 | ||
2288 | preempt_disable(); | |
2289 | cpu = task_cpu(p); | |
2290 | if (task_curr(p)) | |
2291 | smp_call_function_single(cpu, func, info, 1); | |
2292 | preempt_enable(); | |
2293 | } | |
2294 | ||
1da177e4 LT |
2295 | /*** |
2296 | * try_to_wake_up - wake up a thread | |
2297 | * @p: the to-be-woken-up thread | |
2298 | * @state: the mask of task states that can be woken | |
2299 | * @sync: do a synchronous wakeup? | |
2300 | * | |
2301 | * Put it on the run-queue if it's not already there. The "current" | |
2302 | * thread is always on the run-queue (except when the actual | |
2303 | * re-schedule is in progress), and as such you're allowed to do | |
2304 | * the simpler "current->state = TASK_RUNNING" to mark yourself | |
2305 | * runnable without the overhead of this. | |
2306 | * | |
2307 | * returns failure only if the task is already active. | |
2308 | */ | |
7d478721 PZ |
2309 | static int try_to_wake_up(struct task_struct *p, unsigned int state, |
2310 | int wake_flags) | |
1da177e4 | 2311 | { |
cc367732 | 2312 | int cpu, orig_cpu, this_cpu, success = 0; |
1da177e4 | 2313 | unsigned long flags; |
70b97a7f | 2314 | struct rq *rq; |
1da177e4 | 2315 | |
b85d0667 | 2316 | if (!sched_feat(SYNC_WAKEUPS)) |
7d478721 | 2317 | wake_flags &= ~WF_SYNC; |
2398f2c6 | 2318 | |
e9c84311 | 2319 | this_cpu = get_cpu(); |
2398f2c6 | 2320 | |
04e2f174 | 2321 | smp_wmb(); |
1da177e4 | 2322 | rq = task_rq_lock(p, &flags); |
03e89e45 | 2323 | update_rq_clock(rq); |
e9c84311 | 2324 | if (!(p->state & state)) |
1da177e4 LT |
2325 | goto out; |
2326 | ||
dd41f596 | 2327 | if (p->se.on_rq) |
1da177e4 LT |
2328 | goto out_running; |
2329 | ||
2330 | cpu = task_cpu(p); | |
cc367732 | 2331 | orig_cpu = cpu; |
1da177e4 LT |
2332 | |
2333 | #ifdef CONFIG_SMP | |
2334 | if (unlikely(task_running(rq, p))) | |
2335 | goto out_activate; | |
2336 | ||
e9c84311 PZ |
2337 | /* |
2338 | * In order to handle concurrent wakeups and release the rq->lock | |
2339 | * we put the task in TASK_WAKING state. | |
eb24073b IM |
2340 | * |
2341 | * First fix up the nr_uninterruptible count: | |
e9c84311 | 2342 | */ |
eb24073b IM |
2343 | if (task_contributes_to_load(p)) |
2344 | rq->nr_uninterruptible--; | |
e9c84311 PZ |
2345 | p->state = TASK_WAKING; |
2346 | task_rq_unlock(rq, &flags); | |
2347 | ||
7d478721 | 2348 | cpu = p->sched_class->select_task_rq(p, SD_BALANCE_WAKE, wake_flags); |
e9c84311 | 2349 | if (cpu != orig_cpu) |
5d2f5a61 | 2350 | set_task_cpu(p, cpu); |
1da177e4 | 2351 | |
e9c84311 PZ |
2352 | rq = task_rq_lock(p, &flags); |
2353 | WARN_ON(p->state != TASK_WAKING); | |
2354 | cpu = task_cpu(p); | |
1da177e4 | 2355 | |
e7693a36 GH |
2356 | #ifdef CONFIG_SCHEDSTATS |
2357 | schedstat_inc(rq, ttwu_count); | |
2358 | if (cpu == this_cpu) | |
2359 | schedstat_inc(rq, ttwu_local); | |
2360 | else { | |
2361 | struct sched_domain *sd; | |
2362 | for_each_domain(this_cpu, sd) { | |
758b2cdc | 2363 | if (cpumask_test_cpu(cpu, sched_domain_span(sd))) { |
e7693a36 GH |
2364 | schedstat_inc(sd, ttwu_wake_remote); |
2365 | break; | |
2366 | } | |
2367 | } | |
2368 | } | |
6d6bc0ad | 2369 | #endif /* CONFIG_SCHEDSTATS */ |
e7693a36 | 2370 | |
1da177e4 LT |
2371 | out_activate: |
2372 | #endif /* CONFIG_SMP */ | |
cc367732 | 2373 | schedstat_inc(p, se.nr_wakeups); |
7d478721 | 2374 | if (wake_flags & WF_SYNC) |
cc367732 IM |
2375 | schedstat_inc(p, se.nr_wakeups_sync); |
2376 | if (orig_cpu != cpu) | |
2377 | schedstat_inc(p, se.nr_wakeups_migrate); | |
2378 | if (cpu == this_cpu) | |
2379 | schedstat_inc(p, se.nr_wakeups_local); | |
2380 | else | |
2381 | schedstat_inc(p, se.nr_wakeups_remote); | |
dd41f596 | 2382 | activate_task(rq, p, 1); |
1da177e4 LT |
2383 | success = 1; |
2384 | ||
831451ac PZ |
2385 | /* |
2386 | * Only attribute actual wakeups done by this task. | |
2387 | */ | |
2388 | if (!in_interrupt()) { | |
2389 | struct sched_entity *se = ¤t->se; | |
2390 | u64 sample = se->sum_exec_runtime; | |
2391 | ||
2392 | if (se->last_wakeup) | |
2393 | sample -= se->last_wakeup; | |
2394 | else | |
2395 | sample -= se->start_runtime; | |
2396 | update_avg(&se->avg_wakeup, sample); | |
2397 | ||
2398 | se->last_wakeup = se->sum_exec_runtime; | |
2399 | } | |
2400 | ||
1da177e4 | 2401 | out_running: |
468a15bb | 2402 | trace_sched_wakeup(rq, p, success); |
7d478721 | 2403 | check_preempt_curr(rq, p, wake_flags); |
4ae7d5ce | 2404 | |
1da177e4 | 2405 | p->state = TASK_RUNNING; |
9a897c5a SR |
2406 | #ifdef CONFIG_SMP |
2407 | if (p->sched_class->task_wake_up) | |
2408 | p->sched_class->task_wake_up(rq, p); | |
2409 | #endif | |
1da177e4 LT |
2410 | out: |
2411 | task_rq_unlock(rq, &flags); | |
e9c84311 | 2412 | put_cpu(); |
1da177e4 LT |
2413 | |
2414 | return success; | |
2415 | } | |
2416 | ||
50fa610a DH |
2417 | /** |
2418 | * wake_up_process - Wake up a specific process | |
2419 | * @p: The process to be woken up. | |
2420 | * | |
2421 | * Attempt to wake up the nominated process and move it to the set of runnable | |
2422 | * processes. Returns 1 if the process was woken up, 0 if it was already | |
2423 | * running. | |
2424 | * | |
2425 | * It may be assumed that this function implies a write memory barrier before | |
2426 | * changing the task state if and only if any tasks are woken up. | |
2427 | */ | |
7ad5b3a5 | 2428 | int wake_up_process(struct task_struct *p) |
1da177e4 | 2429 | { |
d9514f6c | 2430 | return try_to_wake_up(p, TASK_ALL, 0); |
1da177e4 | 2431 | } |
1da177e4 LT |
2432 | EXPORT_SYMBOL(wake_up_process); |
2433 | ||
7ad5b3a5 | 2434 | int wake_up_state(struct task_struct *p, unsigned int state) |
1da177e4 LT |
2435 | { |
2436 | return try_to_wake_up(p, state, 0); | |
2437 | } | |
2438 | ||
1da177e4 LT |
2439 | /* |
2440 | * Perform scheduler related setup for a newly forked process p. | |
2441 | * p is forked by current. | |
dd41f596 IM |
2442 | * |
2443 | * __sched_fork() is basic setup used by init_idle() too: | |
2444 | */ | |
2445 | static void __sched_fork(struct task_struct *p) | |
2446 | { | |
dd41f596 IM |
2447 | p->se.exec_start = 0; |
2448 | p->se.sum_exec_runtime = 0; | |
f6cf891c | 2449 | p->se.prev_sum_exec_runtime = 0; |
6c594c21 | 2450 | p->se.nr_migrations = 0; |
4ae7d5ce IM |
2451 | p->se.last_wakeup = 0; |
2452 | p->se.avg_overlap = 0; | |
831451ac PZ |
2453 | p->se.start_runtime = 0; |
2454 | p->se.avg_wakeup = sysctl_sched_wakeup_granularity; | |
ad4b78bb | 2455 | p->se.avg_running = 0; |
6cfb0d5d IM |
2456 | |
2457 | #ifdef CONFIG_SCHEDSTATS | |
7793527b LDM |
2458 | p->se.wait_start = 0; |
2459 | p->se.wait_max = 0; | |
2460 | p->se.wait_count = 0; | |
2461 | p->se.wait_sum = 0; | |
2462 | ||
2463 | p->se.sleep_start = 0; | |
2464 | p->se.sleep_max = 0; | |
2465 | p->se.sum_sleep_runtime = 0; | |
2466 | ||
2467 | p->se.block_start = 0; | |
2468 | p->se.block_max = 0; | |
2469 | p->se.exec_max = 0; | |
2470 | p->se.slice_max = 0; | |
2471 | ||
2472 | p->se.nr_migrations_cold = 0; | |
2473 | p->se.nr_failed_migrations_affine = 0; | |
2474 | p->se.nr_failed_migrations_running = 0; | |
2475 | p->se.nr_failed_migrations_hot = 0; | |
2476 | p->se.nr_forced_migrations = 0; | |
2477 | p->se.nr_forced2_migrations = 0; | |
2478 | ||
2479 | p->se.nr_wakeups = 0; | |
2480 | p->se.nr_wakeups_sync = 0; | |
2481 | p->se.nr_wakeups_migrate = 0; | |
2482 | p->se.nr_wakeups_local = 0; | |
2483 | p->se.nr_wakeups_remote = 0; | |
2484 | p->se.nr_wakeups_affine = 0; | |
2485 | p->se.nr_wakeups_affine_attempts = 0; | |
2486 | p->se.nr_wakeups_passive = 0; | |
2487 | p->se.nr_wakeups_idle = 0; | |
2488 | ||
6cfb0d5d | 2489 | #endif |
476d139c | 2490 | |
fa717060 | 2491 | INIT_LIST_HEAD(&p->rt.run_list); |
dd41f596 | 2492 | p->se.on_rq = 0; |
4a55bd5e | 2493 | INIT_LIST_HEAD(&p->se.group_node); |
476d139c | 2494 | |
e107be36 AK |
2495 | #ifdef CONFIG_PREEMPT_NOTIFIERS |
2496 | INIT_HLIST_HEAD(&p->preempt_notifiers); | |
2497 | #endif | |
2498 | ||
1da177e4 LT |
2499 | /* |
2500 | * We mark the process as running here, but have not actually | |
2501 | * inserted it onto the runqueue yet. This guarantees that | |
2502 | * nobody will actually run it, and a signal or other external | |
2503 | * event cannot wake it up and insert it on the runqueue either. | |
2504 | */ | |
2505 | p->state = TASK_RUNNING; | |
dd41f596 IM |
2506 | } |
2507 | ||
2508 | /* | |
2509 | * fork()/clone()-time setup: | |
2510 | */ | |
2511 | void sched_fork(struct task_struct *p, int clone_flags) | |
2512 | { | |
2513 | int cpu = get_cpu(); | |
2514 | ||
2515 | __sched_fork(p); | |
2516 | ||
b29739f9 | 2517 | /* |
b9dc29e7 | 2518 | * Make sure we do not leak PI boosting priority to the child. |
b29739f9 IM |
2519 | */ |
2520 | p->prio = current->normal_prio; | |
ca94c442 | 2521 | |
b9dc29e7 MG |
2522 | /* |
2523 | * Revert to default priority/policy on fork if requested. | |
2524 | */ | |
2525 | if (unlikely(p->sched_reset_on_fork)) { | |
2526 | if (p->policy == SCHED_FIFO || p->policy == SCHED_RR) | |
2527 | p->policy = SCHED_NORMAL; | |
2528 | ||
2529 | if (p->normal_prio < DEFAULT_PRIO) | |
2530 | p->prio = DEFAULT_PRIO; | |
2531 | ||
6c697bdf MG |
2532 | if (PRIO_TO_NICE(p->static_prio) < 0) { |
2533 | p->static_prio = NICE_TO_PRIO(0); | |
2534 | set_load_weight(p); | |
2535 | } | |
2536 | ||
b9dc29e7 MG |
2537 | /* |
2538 | * We don't need the reset flag anymore after the fork. It has | |
2539 | * fulfilled its duty: | |
2540 | */ | |
2541 | p->sched_reset_on_fork = 0; | |
2542 | } | |
ca94c442 | 2543 | |
2ddbf952 HS |
2544 | if (!rt_prio(p->prio)) |
2545 | p->sched_class = &fair_sched_class; | |
b29739f9 | 2546 | |
5f3edc1b PZ |
2547 | #ifdef CONFIG_SMP |
2548 | cpu = p->sched_class->select_task_rq(p, SD_BALANCE_FORK, 0); | |
2549 | #endif | |
2550 | set_task_cpu(p, cpu); | |
2551 | ||
52f17b6c | 2552 | #if defined(CONFIG_SCHEDSTATS) || defined(CONFIG_TASK_DELAY_ACCT) |
dd41f596 | 2553 | if (likely(sched_info_on())) |
52f17b6c | 2554 | memset(&p->sched_info, 0, sizeof(p->sched_info)); |
1da177e4 | 2555 | #endif |
d6077cb8 | 2556 | #if defined(CONFIG_SMP) && defined(__ARCH_WANT_UNLOCKED_CTXSW) |
4866cde0 NP |
2557 | p->oncpu = 0; |
2558 | #endif | |
1da177e4 | 2559 | #ifdef CONFIG_PREEMPT |
4866cde0 | 2560 | /* Want to start with kernel preemption disabled. */ |
a1261f54 | 2561 | task_thread_info(p)->preempt_count = 1; |
1da177e4 | 2562 | #endif |
917b627d GH |
2563 | plist_node_init(&p->pushable_tasks, MAX_PRIO); |
2564 | ||
476d139c | 2565 | put_cpu(); |
1da177e4 LT |
2566 | } |
2567 | ||
2568 | /* | |
2569 | * wake_up_new_task - wake up a newly created task for the first time. | |
2570 | * | |
2571 | * This function will do some initial scheduler statistics housekeeping | |
2572 | * that must be done for every newly created context, then puts the task | |
2573 | * on the runqueue and wakes it. | |
2574 | */ | |
7ad5b3a5 | 2575 | void wake_up_new_task(struct task_struct *p, unsigned long clone_flags) |
1da177e4 LT |
2576 | { |
2577 | unsigned long flags; | |
dd41f596 | 2578 | struct rq *rq; |
1da177e4 LT |
2579 | |
2580 | rq = task_rq_lock(p, &flags); | |
147cbb4b | 2581 | BUG_ON(p->state != TASK_RUNNING); |
a8e504d2 | 2582 | update_rq_clock(rq); |
1da177e4 LT |
2583 | |
2584 | p->prio = effective_prio(p); | |
2585 | ||
b9dca1e0 | 2586 | if (!p->sched_class->task_new || !current->se.on_rq) { |
dd41f596 | 2587 | activate_task(rq, p, 0); |
1da177e4 | 2588 | } else { |
1da177e4 | 2589 | /* |
dd41f596 IM |
2590 | * Let the scheduling class do new task startup |
2591 | * management (if any): | |
1da177e4 | 2592 | */ |
ee0827d8 | 2593 | p->sched_class->task_new(rq, p); |
c09595f6 | 2594 | inc_nr_running(rq); |
1da177e4 | 2595 | } |
c71dd42d | 2596 | trace_sched_wakeup_new(rq, p, 1); |
a7558e01 | 2597 | check_preempt_curr(rq, p, WF_FORK); |
9a897c5a SR |
2598 | #ifdef CONFIG_SMP |
2599 | if (p->sched_class->task_wake_up) | |
2600 | p->sched_class->task_wake_up(rq, p); | |
2601 | #endif | |
dd41f596 | 2602 | task_rq_unlock(rq, &flags); |
1da177e4 LT |
2603 | } |
2604 | ||
e107be36 AK |
2605 | #ifdef CONFIG_PREEMPT_NOTIFIERS |
2606 | ||
2607 | /** | |
80dd99b3 | 2608 | * preempt_notifier_register - tell me when current is being preempted & rescheduled |
421cee29 | 2609 | * @notifier: notifier struct to register |
e107be36 AK |
2610 | */ |
2611 | void preempt_notifier_register(struct preempt_notifier *notifier) | |
2612 | { | |
2613 | hlist_add_head(¬ifier->link, ¤t->preempt_notifiers); | |
2614 | } | |
2615 | EXPORT_SYMBOL_GPL(preempt_notifier_register); | |
2616 | ||
2617 | /** | |
2618 | * preempt_notifier_unregister - no longer interested in preemption notifications | |
421cee29 | 2619 | * @notifier: notifier struct to unregister |
e107be36 AK |
2620 | * |
2621 | * This is safe to call from within a preemption notifier. | |
2622 | */ | |
2623 | void preempt_notifier_unregister(struct preempt_notifier *notifier) | |
2624 | { | |
2625 | hlist_del(¬ifier->link); | |
2626 | } | |
2627 | EXPORT_SYMBOL_GPL(preempt_notifier_unregister); | |
2628 | ||
2629 | static void fire_sched_in_preempt_notifiers(struct task_struct *curr) | |
2630 | { | |
2631 | struct preempt_notifier *notifier; | |
2632 | struct hlist_node *node; | |
2633 | ||
2634 | hlist_for_each_entry(notifier, node, &curr->preempt_notifiers, link) | |
2635 | notifier->ops->sched_in(notifier, raw_smp_processor_id()); | |
2636 | } | |
2637 | ||
2638 | static void | |
2639 | fire_sched_out_preempt_notifiers(struct task_struct *curr, | |
2640 | struct task_struct *next) | |
2641 | { | |
2642 | struct preempt_notifier *notifier; | |
2643 | struct hlist_node *node; | |
2644 | ||
2645 | hlist_for_each_entry(notifier, node, &curr->preempt_notifiers, link) | |
2646 | notifier->ops->sched_out(notifier, next); | |
2647 | } | |
2648 | ||
6d6bc0ad | 2649 | #else /* !CONFIG_PREEMPT_NOTIFIERS */ |
e107be36 AK |
2650 | |
2651 | static void fire_sched_in_preempt_notifiers(struct task_struct *curr) | |
2652 | { | |
2653 | } | |
2654 | ||
2655 | static void | |
2656 | fire_sched_out_preempt_notifiers(struct task_struct *curr, | |
2657 | struct task_struct *next) | |
2658 | { | |
2659 | } | |
2660 | ||
6d6bc0ad | 2661 | #endif /* CONFIG_PREEMPT_NOTIFIERS */ |
e107be36 | 2662 | |
4866cde0 NP |
2663 | /** |
2664 | * prepare_task_switch - prepare to switch tasks | |
2665 | * @rq: the runqueue preparing to switch | |
421cee29 | 2666 | * @prev: the current task that is being switched out |
4866cde0 NP |
2667 | * @next: the task we are going to switch to. |
2668 | * | |
2669 | * This is called with the rq lock held and interrupts off. It must | |
2670 | * be paired with a subsequent finish_task_switch after the context | |
2671 | * switch. | |
2672 | * | |
2673 | * prepare_task_switch sets up locking and calls architecture specific | |
2674 | * hooks. | |
2675 | */ | |
e107be36 AK |
2676 | static inline void |
2677 | prepare_task_switch(struct rq *rq, struct task_struct *prev, | |
2678 | struct task_struct *next) | |
4866cde0 | 2679 | { |
e107be36 | 2680 | fire_sched_out_preempt_notifiers(prev, next); |
4866cde0 NP |
2681 | prepare_lock_switch(rq, next); |
2682 | prepare_arch_switch(next); | |
2683 | } | |
2684 | ||
1da177e4 LT |
2685 | /** |
2686 | * finish_task_switch - clean up after a task-switch | |
344babaa | 2687 | * @rq: runqueue associated with task-switch |
1da177e4 LT |
2688 | * @prev: the thread we just switched away from. |
2689 | * | |
4866cde0 NP |
2690 | * finish_task_switch must be called after the context switch, paired |
2691 | * with a prepare_task_switch call before the context switch. | |
2692 | * finish_task_switch will reconcile locking set up by prepare_task_switch, | |
2693 | * and do any other architecture-specific cleanup actions. | |
1da177e4 LT |
2694 | * |
2695 | * Note that we may have delayed dropping an mm in context_switch(). If | |
41a2d6cf | 2696 | * so, we finish that here outside of the runqueue lock. (Doing it |
1da177e4 LT |
2697 | * with the lock held can cause deadlocks; see schedule() for |
2698 | * details.) | |
2699 | */ | |
a9957449 | 2700 | static void finish_task_switch(struct rq *rq, struct task_struct *prev) |
1da177e4 LT |
2701 | __releases(rq->lock) |
2702 | { | |
1da177e4 | 2703 | struct mm_struct *mm = rq->prev_mm; |
55a101f8 | 2704 | long prev_state; |
1da177e4 LT |
2705 | |
2706 | rq->prev_mm = NULL; | |
2707 | ||
2708 | /* | |
2709 | * A task struct has one reference for the use as "current". | |
c394cc9f | 2710 | * If a task dies, then it sets TASK_DEAD in tsk->state and calls |
55a101f8 ON |
2711 | * schedule one last time. The schedule call will never return, and |
2712 | * the scheduled task must drop that reference. | |
c394cc9f | 2713 | * The test for TASK_DEAD must occur while the runqueue locks are |
1da177e4 LT |
2714 | * still held, otherwise prev could be scheduled on another cpu, die |
2715 | * there before we look at prev->state, and then the reference would | |
2716 | * be dropped twice. | |
2717 | * Manfred Spraul <manfred@colorfullife.com> | |
2718 | */ | |
55a101f8 | 2719 | prev_state = prev->state; |
4866cde0 | 2720 | finish_arch_switch(prev); |
cdd6c482 | 2721 | perf_event_task_sched_in(current, cpu_of(rq)); |
4866cde0 | 2722 | finish_lock_switch(rq, prev); |
e8fa1362 | 2723 | |
e107be36 | 2724 | fire_sched_in_preempt_notifiers(current); |
1da177e4 LT |
2725 | if (mm) |
2726 | mmdrop(mm); | |
c394cc9f | 2727 | if (unlikely(prev_state == TASK_DEAD)) { |
c6fd91f0 | 2728 | /* |
2729 | * Remove function-return probe instances associated with this | |
2730 | * task and put them back on the free list. | |
9761eea8 | 2731 | */ |
c6fd91f0 | 2732 | kprobe_flush_task(prev); |
1da177e4 | 2733 | put_task_struct(prev); |
c6fd91f0 | 2734 | } |
1da177e4 LT |
2735 | } |
2736 | ||
3f029d3c GH |
2737 | #ifdef CONFIG_SMP |
2738 | ||
2739 | /* assumes rq->lock is held */ | |
2740 | static inline void pre_schedule(struct rq *rq, struct task_struct *prev) | |
2741 | { | |
2742 | if (prev->sched_class->pre_schedule) | |
2743 | prev->sched_class->pre_schedule(rq, prev); | |
2744 | } | |
2745 | ||
2746 | /* rq->lock is NOT held, but preemption is disabled */ | |
2747 | static inline void post_schedule(struct rq *rq) | |
2748 | { | |
2749 | if (rq->post_schedule) { | |
2750 | unsigned long flags; | |
2751 | ||
2752 | spin_lock_irqsave(&rq->lock, flags); | |
2753 | if (rq->curr->sched_class->post_schedule) | |
2754 | rq->curr->sched_class->post_schedule(rq); | |
2755 | spin_unlock_irqrestore(&rq->lock, flags); | |
2756 | ||
2757 | rq->post_schedule = 0; | |
2758 | } | |
2759 | } | |
2760 | ||
2761 | #else | |
da19ab51 | 2762 | |
3f029d3c GH |
2763 | static inline void pre_schedule(struct rq *rq, struct task_struct *p) |
2764 | { | |
2765 | } | |
2766 | ||
2767 | static inline void post_schedule(struct rq *rq) | |
2768 | { | |
1da177e4 LT |
2769 | } |
2770 | ||
3f029d3c GH |
2771 | #endif |
2772 | ||
1da177e4 LT |
2773 | /** |
2774 | * schedule_tail - first thing a freshly forked thread must call. | |
2775 | * @prev: the thread we just switched away from. | |
2776 | */ | |
36c8b586 | 2777 | asmlinkage void schedule_tail(struct task_struct *prev) |
1da177e4 LT |
2778 | __releases(rq->lock) |
2779 | { | |
70b97a7f IM |
2780 | struct rq *rq = this_rq(); |
2781 | ||
4866cde0 | 2782 | finish_task_switch(rq, prev); |
da19ab51 | 2783 | |
3f029d3c GH |
2784 | /* |
2785 | * FIXME: do we need to worry about rq being invalidated by the | |
2786 | * task_switch? | |
2787 | */ | |
2788 | post_schedule(rq); | |
70b97a7f | 2789 | |
4866cde0 NP |
2790 | #ifdef __ARCH_WANT_UNLOCKED_CTXSW |
2791 | /* In this case, finish_task_switch does not reenable preemption */ | |
2792 | preempt_enable(); | |
2793 | #endif | |
1da177e4 | 2794 | if (current->set_child_tid) |
b488893a | 2795 | put_user(task_pid_vnr(current), current->set_child_tid); |
1da177e4 LT |
2796 | } |
2797 | ||
2798 | /* | |
2799 | * context_switch - switch to the new MM and the new | |
2800 | * thread's register state. | |
2801 | */ | |
dd41f596 | 2802 | static inline void |
70b97a7f | 2803 | context_switch(struct rq *rq, struct task_struct *prev, |
36c8b586 | 2804 | struct task_struct *next) |
1da177e4 | 2805 | { |
dd41f596 | 2806 | struct mm_struct *mm, *oldmm; |
1da177e4 | 2807 | |
e107be36 | 2808 | prepare_task_switch(rq, prev, next); |
0a16b607 | 2809 | trace_sched_switch(rq, prev, next); |
dd41f596 IM |
2810 | mm = next->mm; |
2811 | oldmm = prev->active_mm; | |
9226d125 ZA |
2812 | /* |
2813 | * For paravirt, this is coupled with an exit in switch_to to | |
2814 | * combine the page table reload and the switch backend into | |
2815 | * one hypercall. | |
2816 | */ | |
224101ed | 2817 | arch_start_context_switch(prev); |
9226d125 | 2818 | |
dd41f596 | 2819 | if (unlikely(!mm)) { |
1da177e4 LT |
2820 | next->active_mm = oldmm; |
2821 | atomic_inc(&oldmm->mm_count); | |
2822 | enter_lazy_tlb(oldmm, next); | |
2823 | } else | |
2824 | switch_mm(oldmm, mm, next); | |
2825 | ||
dd41f596 | 2826 | if (unlikely(!prev->mm)) { |
1da177e4 | 2827 | prev->active_mm = NULL; |
1da177e4 LT |
2828 | rq->prev_mm = oldmm; |
2829 | } | |
3a5f5e48 IM |
2830 | /* |
2831 | * Since the runqueue lock will be released by the next | |
2832 | * task (which is an invalid locking op but in the case | |
2833 | * of the scheduler it's an obvious special-case), so we | |
2834 | * do an early lockdep release here: | |
2835 | */ | |
2836 | #ifndef __ARCH_WANT_UNLOCKED_CTXSW | |
8a25d5de | 2837 | spin_release(&rq->lock.dep_map, 1, _THIS_IP_); |
3a5f5e48 | 2838 | #endif |
1da177e4 LT |
2839 | |
2840 | /* Here we just switch the register state and the stack. */ | |
2841 | switch_to(prev, next, prev); | |
2842 | ||
dd41f596 IM |
2843 | barrier(); |
2844 | /* | |
2845 | * this_rq must be evaluated again because prev may have moved | |
2846 | * CPUs since it called schedule(), thus the 'rq' on its stack | |
2847 | * frame will be invalid. | |
2848 | */ | |
2849 | finish_task_switch(this_rq(), prev); | |
1da177e4 LT |
2850 | } |
2851 | ||
2852 | /* | |
2853 | * nr_running, nr_uninterruptible and nr_context_switches: | |
2854 | * | |
2855 | * externally visible scheduler statistics: current number of runnable | |
2856 | * threads, current number of uninterruptible-sleeping threads, total | |
2857 | * number of context switches performed since bootup. | |
2858 | */ | |
2859 | unsigned long nr_running(void) | |
2860 | { | |
2861 | unsigned long i, sum = 0; | |
2862 | ||
2863 | for_each_online_cpu(i) | |
2864 | sum += cpu_rq(i)->nr_running; | |
2865 | ||
2866 | return sum; | |
2867 | } | |
2868 | ||
2869 | unsigned long nr_uninterruptible(void) | |
2870 | { | |
2871 | unsigned long i, sum = 0; | |
2872 | ||
0a945022 | 2873 | for_each_possible_cpu(i) |
1da177e4 LT |
2874 | sum += cpu_rq(i)->nr_uninterruptible; |
2875 | ||
2876 | /* | |
2877 | * Since we read the counters lockless, it might be slightly | |
2878 | * inaccurate. Do not allow it to go below zero though: | |
2879 | */ | |
2880 | if (unlikely((long)sum < 0)) | |
2881 | sum = 0; | |
2882 | ||
2883 | return sum; | |
2884 | } | |
2885 | ||
2886 | unsigned long long nr_context_switches(void) | |
2887 | { | |
cc94abfc SR |
2888 | int i; |
2889 | unsigned long long sum = 0; | |
1da177e4 | 2890 | |
0a945022 | 2891 | for_each_possible_cpu(i) |
1da177e4 LT |
2892 | sum += cpu_rq(i)->nr_switches; |
2893 | ||
2894 | return sum; | |
2895 | } | |
2896 | ||
2897 | unsigned long nr_iowait(void) | |
2898 | { | |
2899 | unsigned long i, sum = 0; | |
2900 | ||
0a945022 | 2901 | for_each_possible_cpu(i) |
1da177e4 LT |
2902 | sum += atomic_read(&cpu_rq(i)->nr_iowait); |
2903 | ||
2904 | return sum; | |
2905 | } | |
2906 | ||
69d25870 AV |
2907 | unsigned long nr_iowait_cpu(void) |
2908 | { | |
2909 | struct rq *this = this_rq(); | |
2910 | return atomic_read(&this->nr_iowait); | |
2911 | } | |
2912 | ||
2913 | unsigned long this_cpu_load(void) | |
2914 | { | |
2915 | struct rq *this = this_rq(); | |
2916 | return this->cpu_load[0]; | |
2917 | } | |
2918 | ||
2919 | ||
dce48a84 TG |
2920 | /* Variables and functions for calc_load */ |
2921 | static atomic_long_t calc_load_tasks; | |
2922 | static unsigned long calc_load_update; | |
2923 | unsigned long avenrun[3]; | |
2924 | EXPORT_SYMBOL(avenrun); | |
2925 | ||
2d02494f TG |
2926 | /** |
2927 | * get_avenrun - get the load average array | |
2928 | * @loads: pointer to dest load array | |
2929 | * @offset: offset to add | |
2930 | * @shift: shift count to shift the result left | |
2931 | * | |
2932 | * These values are estimates at best, so no need for locking. | |
2933 | */ | |
2934 | void get_avenrun(unsigned long *loads, unsigned long offset, int shift) | |
2935 | { | |
2936 | loads[0] = (avenrun[0] + offset) << shift; | |
2937 | loads[1] = (avenrun[1] + offset) << shift; | |
2938 | loads[2] = (avenrun[2] + offset) << shift; | |
2939 | } | |
2940 | ||
dce48a84 TG |
2941 | static unsigned long |
2942 | calc_load(unsigned long load, unsigned long exp, unsigned long active) | |
db1b1fef | 2943 | { |
dce48a84 TG |
2944 | load *= exp; |
2945 | load += active * (FIXED_1 - exp); | |
2946 | return load >> FSHIFT; | |
2947 | } | |
db1b1fef | 2948 | |
dce48a84 TG |
2949 | /* |
2950 | * calc_load - update the avenrun load estimates 10 ticks after the | |
2951 | * CPUs have updated calc_load_tasks. | |
2952 | */ | |
2953 | void calc_global_load(void) | |
2954 | { | |
2955 | unsigned long upd = calc_load_update + 10; | |
2956 | long active; | |
2957 | ||
2958 | if (time_before(jiffies, upd)) | |
2959 | return; | |
db1b1fef | 2960 | |
dce48a84 TG |
2961 | active = atomic_long_read(&calc_load_tasks); |
2962 | active = active > 0 ? active * FIXED_1 : 0; | |
db1b1fef | 2963 | |
dce48a84 TG |
2964 | avenrun[0] = calc_load(avenrun[0], EXP_1, active); |
2965 | avenrun[1] = calc_load(avenrun[1], EXP_5, active); | |
2966 | avenrun[2] = calc_load(avenrun[2], EXP_15, active); | |
2967 | ||
2968 | calc_load_update += LOAD_FREQ; | |
2969 | } | |
2970 | ||
2971 | /* | |
2972 | * Either called from update_cpu_load() or from a cpu going idle | |
2973 | */ | |
2974 | static void calc_load_account_active(struct rq *this_rq) | |
2975 | { | |
2976 | long nr_active, delta; | |
2977 | ||
2978 | nr_active = this_rq->nr_running; | |
2979 | nr_active += (long) this_rq->nr_uninterruptible; | |
2980 | ||
2981 | if (nr_active != this_rq->calc_load_active) { | |
2982 | delta = nr_active - this_rq->calc_load_active; | |
2983 | this_rq->calc_load_active = nr_active; | |
2984 | atomic_long_add(delta, &calc_load_tasks); | |
2985 | } | |
db1b1fef JS |
2986 | } |
2987 | ||
23a185ca PM |
2988 | /* |
2989 | * Externally visible per-cpu scheduler statistics: | |
23a185ca PM |
2990 | * cpu_nr_migrations(cpu) - number of migrations into that cpu |
2991 | */ | |
23a185ca PM |
2992 | u64 cpu_nr_migrations(int cpu) |
2993 | { | |
2994 | return cpu_rq(cpu)->nr_migrations_in; | |
2995 | } | |
2996 | ||
48f24c4d | 2997 | /* |
dd41f596 IM |
2998 | * Update rq->cpu_load[] statistics. This function is usually called every |
2999 | * scheduler tick (TICK_NSEC). | |
48f24c4d | 3000 | */ |
dd41f596 | 3001 | static void update_cpu_load(struct rq *this_rq) |
48f24c4d | 3002 | { |
495eca49 | 3003 | unsigned long this_load = this_rq->load.weight; |
dd41f596 IM |
3004 | int i, scale; |
3005 | ||
3006 | this_rq->nr_load_updates++; | |
dd41f596 IM |
3007 | |
3008 | /* Update our load: */ | |
3009 | for (i = 0, scale = 1; i < CPU_LOAD_IDX_MAX; i++, scale += scale) { | |
3010 | unsigned long old_load, new_load; | |
3011 | ||
3012 | /* scale is effectively 1 << i now, and >> i divides by scale */ | |
3013 | ||
3014 | old_load = this_rq->cpu_load[i]; | |
3015 | new_load = this_load; | |
a25707f3 IM |
3016 | /* |
3017 | * Round up the averaging division if load is increasing. This | |
3018 | * prevents us from getting stuck on 9 if the load is 10, for | |
3019 | * example. | |
3020 | */ | |
3021 | if (new_load > old_load) | |
3022 | new_load += scale-1; | |
dd41f596 IM |
3023 | this_rq->cpu_load[i] = (old_load*(scale-1) + new_load) >> i; |
3024 | } | |
dce48a84 TG |
3025 | |
3026 | if (time_after_eq(jiffies, this_rq->calc_load_update)) { | |
3027 | this_rq->calc_load_update += LOAD_FREQ; | |
3028 | calc_load_account_active(this_rq); | |
3029 | } | |
48f24c4d IM |
3030 | } |
3031 | ||
dd41f596 IM |
3032 | #ifdef CONFIG_SMP |
3033 | ||
1da177e4 LT |
3034 | /* |
3035 | * double_rq_lock - safely lock two runqueues | |
3036 | * | |
3037 | * Note this does not disable interrupts like task_rq_lock, | |
3038 | * you need to do so manually before calling. | |
3039 | */ | |
70b97a7f | 3040 | static void double_rq_lock(struct rq *rq1, struct rq *rq2) |
1da177e4 LT |
3041 | __acquires(rq1->lock) |
3042 | __acquires(rq2->lock) | |
3043 | { | |
054b9108 | 3044 | BUG_ON(!irqs_disabled()); |
1da177e4 LT |
3045 | if (rq1 == rq2) { |
3046 | spin_lock(&rq1->lock); | |
3047 | __acquire(rq2->lock); /* Fake it out ;) */ | |
3048 | } else { | |
c96d145e | 3049 | if (rq1 < rq2) { |
1da177e4 | 3050 | spin_lock(&rq1->lock); |
5e710e37 | 3051 | spin_lock_nested(&rq2->lock, SINGLE_DEPTH_NESTING); |
1da177e4 LT |
3052 | } else { |
3053 | spin_lock(&rq2->lock); | |
5e710e37 | 3054 | spin_lock_nested(&rq1->lock, SINGLE_DEPTH_NESTING); |
1da177e4 LT |
3055 | } |
3056 | } | |
6e82a3be IM |
3057 | update_rq_clock(rq1); |
3058 | update_rq_clock(rq2); | |
1da177e4 LT |
3059 | } |
3060 | ||
3061 | /* | |
3062 | * double_rq_unlock - safely unlock two runqueues | |
3063 | * | |
3064 | * Note this does not restore interrupts like task_rq_unlock, | |
3065 | * you need to do so manually after calling. | |
3066 | */ | |
70b97a7f | 3067 | static void double_rq_unlock(struct rq *rq1, struct rq *rq2) |
1da177e4 LT |
3068 | __releases(rq1->lock) |
3069 | __releases(rq2->lock) | |
3070 | { | |
3071 | spin_unlock(&rq1->lock); | |
3072 | if (rq1 != rq2) | |
3073 | spin_unlock(&rq2->lock); | |
3074 | else | |
3075 | __release(rq2->lock); | |
3076 | } | |
3077 | ||
1da177e4 LT |
3078 | /* |
3079 | * If dest_cpu is allowed for this process, migrate the task to it. | |
3080 | * This is accomplished by forcing the cpu_allowed mask to only | |
41a2d6cf | 3081 | * allow dest_cpu, which will force the cpu onto dest_cpu. Then |
1da177e4 LT |
3082 | * the cpu_allowed mask is restored. |
3083 | */ | |
36c8b586 | 3084 | static void sched_migrate_task(struct task_struct *p, int dest_cpu) |
1da177e4 | 3085 | { |
70b97a7f | 3086 | struct migration_req req; |
1da177e4 | 3087 | unsigned long flags; |
70b97a7f | 3088 | struct rq *rq; |
1da177e4 LT |
3089 | |
3090 | rq = task_rq_lock(p, &flags); | |
96f874e2 | 3091 | if (!cpumask_test_cpu(dest_cpu, &p->cpus_allowed) |
e761b772 | 3092 | || unlikely(!cpu_active(dest_cpu))) |
1da177e4 LT |
3093 | goto out; |
3094 | ||
3095 | /* force the process onto the specified CPU */ | |
3096 | if (migrate_task(p, dest_cpu, &req)) { | |
3097 | /* Need to wait for migration thread (might exit: take ref). */ | |
3098 | struct task_struct *mt = rq->migration_thread; | |
36c8b586 | 3099 | |
1da177e4 LT |
3100 | get_task_struct(mt); |
3101 | task_rq_unlock(rq, &flags); | |
3102 | wake_up_process(mt); | |
3103 | put_task_struct(mt); | |
3104 | wait_for_completion(&req.done); | |
36c8b586 | 3105 | |
1da177e4 LT |
3106 | return; |
3107 | } | |
3108 | out: | |
3109 | task_rq_unlock(rq, &flags); | |
3110 | } | |
3111 | ||
3112 | /* | |
476d139c NP |
3113 | * sched_exec - execve() is a valuable balancing opportunity, because at |
3114 | * this point the task has the smallest effective memory and cache footprint. | |
1da177e4 LT |
3115 | */ |
3116 | void sched_exec(void) | |
3117 | { | |
1da177e4 | 3118 | int new_cpu, this_cpu = get_cpu(); |
5f3edc1b | 3119 | new_cpu = current->sched_class->select_task_rq(current, SD_BALANCE_EXEC, 0); |
1da177e4 | 3120 | put_cpu(); |
476d139c NP |
3121 | if (new_cpu != this_cpu) |
3122 | sched_migrate_task(current, new_cpu); | |
1da177e4 LT |
3123 | } |
3124 | ||
3125 | /* | |
3126 | * pull_task - move a task from a remote runqueue to the local runqueue. | |
3127 | * Both runqueues must be locked. | |
3128 | */ | |
dd41f596 IM |
3129 | static void pull_task(struct rq *src_rq, struct task_struct *p, |
3130 | struct rq *this_rq, int this_cpu) | |
1da177e4 | 3131 | { |
2e1cb74a | 3132 | deactivate_task(src_rq, p, 0); |
1da177e4 | 3133 | set_task_cpu(p, this_cpu); |
dd41f596 | 3134 | activate_task(this_rq, p, 0); |
1da177e4 LT |
3135 | /* |
3136 | * Note that idle threads have a prio of MAX_PRIO, for this test | |
3137 | * to be always true for them. | |
3138 | */ | |
15afe09b | 3139 | check_preempt_curr(this_rq, p, 0); |
1da177e4 LT |
3140 | } |
3141 | ||
3142 | /* | |
3143 | * can_migrate_task - may task p from runqueue rq be migrated to this_cpu? | |
3144 | */ | |
858119e1 | 3145 | static |
70b97a7f | 3146 | int can_migrate_task(struct task_struct *p, struct rq *rq, int this_cpu, |
d15bcfdb | 3147 | struct sched_domain *sd, enum cpu_idle_type idle, |
95cdf3b7 | 3148 | int *all_pinned) |
1da177e4 | 3149 | { |
708dc512 | 3150 | int tsk_cache_hot = 0; |
1da177e4 LT |
3151 | /* |
3152 | * We do not migrate tasks that are: | |
3153 | * 1) running (obviously), or | |
3154 | * 2) cannot be migrated to this CPU due to cpus_allowed, or | |
3155 | * 3) are cache-hot on their current CPU. | |
3156 | */ | |
96f874e2 | 3157 | if (!cpumask_test_cpu(this_cpu, &p->cpus_allowed)) { |
cc367732 | 3158 | schedstat_inc(p, se.nr_failed_migrations_affine); |
1da177e4 | 3159 | return 0; |
cc367732 | 3160 | } |
81026794 NP |
3161 | *all_pinned = 0; |
3162 | ||
cc367732 IM |
3163 | if (task_running(rq, p)) { |
3164 | schedstat_inc(p, se.nr_failed_migrations_running); | |
81026794 | 3165 | return 0; |
cc367732 | 3166 | } |
1da177e4 | 3167 | |
da84d961 IM |
3168 | /* |
3169 | * Aggressive migration if: | |
3170 | * 1) task is cache cold, or | |
3171 | * 2) too many balance attempts have failed. | |
3172 | */ | |
3173 | ||
708dc512 LH |
3174 | tsk_cache_hot = task_hot(p, rq->clock, sd); |
3175 | if (!tsk_cache_hot || | |
3176 | sd->nr_balance_failed > sd->cache_nice_tries) { | |
da84d961 | 3177 | #ifdef CONFIG_SCHEDSTATS |
708dc512 | 3178 | if (tsk_cache_hot) { |
da84d961 | 3179 | schedstat_inc(sd, lb_hot_gained[idle]); |
cc367732 IM |
3180 | schedstat_inc(p, se.nr_forced_migrations); |
3181 | } | |
da84d961 IM |
3182 | #endif |
3183 | return 1; | |
3184 | } | |
3185 | ||
708dc512 | 3186 | if (tsk_cache_hot) { |
cc367732 | 3187 | schedstat_inc(p, se.nr_failed_migrations_hot); |
da84d961 | 3188 | return 0; |
cc367732 | 3189 | } |
1da177e4 LT |
3190 | return 1; |
3191 | } | |
3192 | ||
e1d1484f PW |
3193 | static unsigned long |
3194 | balance_tasks(struct rq *this_rq, int this_cpu, struct rq *busiest, | |
3195 | unsigned long max_load_move, struct sched_domain *sd, | |
3196 | enum cpu_idle_type idle, int *all_pinned, | |
3197 | int *this_best_prio, struct rq_iterator *iterator) | |
1da177e4 | 3198 | { |
051c6764 | 3199 | int loops = 0, pulled = 0, pinned = 0; |
dd41f596 IM |
3200 | struct task_struct *p; |
3201 | long rem_load_move = max_load_move; | |
1da177e4 | 3202 | |
e1d1484f | 3203 | if (max_load_move == 0) |
1da177e4 LT |
3204 | goto out; |
3205 | ||
81026794 NP |
3206 | pinned = 1; |
3207 | ||
1da177e4 | 3208 | /* |
dd41f596 | 3209 | * Start the load-balancing iterator: |
1da177e4 | 3210 | */ |
dd41f596 IM |
3211 | p = iterator->start(iterator->arg); |
3212 | next: | |
b82d9fdd | 3213 | if (!p || loops++ > sysctl_sched_nr_migrate) |
1da177e4 | 3214 | goto out; |
051c6764 PZ |
3215 | |
3216 | if ((p->se.load.weight >> 1) > rem_load_move || | |
dd41f596 | 3217 | !can_migrate_task(p, busiest, this_cpu, sd, idle, &pinned)) { |
dd41f596 IM |
3218 | p = iterator->next(iterator->arg); |
3219 | goto next; | |
1da177e4 LT |
3220 | } |
3221 | ||
dd41f596 | 3222 | pull_task(busiest, p, this_rq, this_cpu); |
1da177e4 | 3223 | pulled++; |
dd41f596 | 3224 | rem_load_move -= p->se.load.weight; |
1da177e4 | 3225 | |
7e96fa58 GH |
3226 | #ifdef CONFIG_PREEMPT |
3227 | /* | |
3228 | * NEWIDLE balancing is a source of latency, so preemptible kernels | |
3229 | * will stop after the first task is pulled to minimize the critical | |
3230 | * section. | |
3231 | */ | |
3232 | if (idle == CPU_NEWLY_IDLE) | |
3233 | goto out; | |
3234 | #endif | |
3235 | ||
2dd73a4f | 3236 | /* |
b82d9fdd | 3237 | * We only want to steal up to the prescribed amount of weighted load. |
2dd73a4f | 3238 | */ |
e1d1484f | 3239 | if (rem_load_move > 0) { |
a4ac01c3 PW |
3240 | if (p->prio < *this_best_prio) |
3241 | *this_best_prio = p->prio; | |
dd41f596 IM |
3242 | p = iterator->next(iterator->arg); |
3243 | goto next; | |
1da177e4 LT |
3244 | } |
3245 | out: | |
3246 | /* | |
e1d1484f | 3247 | * Right now, this is one of only two places pull_task() is called, |
1da177e4 LT |
3248 | * so we can safely collect pull_task() stats here rather than |
3249 | * inside pull_task(). | |
3250 | */ | |
3251 | schedstat_add(sd, lb_gained[idle], pulled); | |
81026794 NP |
3252 | |
3253 | if (all_pinned) | |
3254 | *all_pinned = pinned; | |
e1d1484f PW |
3255 | |
3256 | return max_load_move - rem_load_move; | |
1da177e4 LT |
3257 | } |
3258 | ||
dd41f596 | 3259 | /* |
43010659 PW |
3260 | * move_tasks tries to move up to max_load_move weighted load from busiest to |
3261 | * this_rq, as part of a balancing operation within domain "sd". | |
3262 | * Returns 1 if successful and 0 otherwise. | |
dd41f596 IM |
3263 | * |
3264 | * Called with both runqueues locked. | |
3265 | */ | |
3266 | static int move_tasks(struct rq *this_rq, int this_cpu, struct rq *busiest, | |
43010659 | 3267 | unsigned long max_load_move, |
dd41f596 IM |
3268 | struct sched_domain *sd, enum cpu_idle_type idle, |
3269 | int *all_pinned) | |
3270 | { | |
5522d5d5 | 3271 | const struct sched_class *class = sched_class_highest; |
43010659 | 3272 | unsigned long total_load_moved = 0; |
a4ac01c3 | 3273 | int this_best_prio = this_rq->curr->prio; |
dd41f596 IM |
3274 | |
3275 | do { | |
43010659 PW |
3276 | total_load_moved += |
3277 | class->load_balance(this_rq, this_cpu, busiest, | |
e1d1484f | 3278 | max_load_move - total_load_moved, |
a4ac01c3 | 3279 | sd, idle, all_pinned, &this_best_prio); |
dd41f596 | 3280 | class = class->next; |
c4acb2c0 | 3281 | |
7e96fa58 GH |
3282 | #ifdef CONFIG_PREEMPT |
3283 | /* | |
3284 | * NEWIDLE balancing is a source of latency, so preemptible | |
3285 | * kernels will stop after the first task is pulled to minimize | |
3286 | * the critical section. | |
3287 | */ | |
c4acb2c0 GH |
3288 | if (idle == CPU_NEWLY_IDLE && this_rq->nr_running) |
3289 | break; | |
7e96fa58 | 3290 | #endif |
43010659 | 3291 | } while (class && max_load_move > total_load_moved); |
dd41f596 | 3292 | |
43010659 PW |
3293 | return total_load_moved > 0; |
3294 | } | |
3295 | ||
e1d1484f PW |
3296 | static int |
3297 | iter_move_one_task(struct rq *this_rq, int this_cpu, struct rq *busiest, | |
3298 | struct sched_domain *sd, enum cpu_idle_type idle, | |
3299 | struct rq_iterator *iterator) | |
3300 | { | |
3301 | struct task_struct *p = iterator->start(iterator->arg); | |
3302 | int pinned = 0; | |
3303 | ||
3304 | while (p) { | |
3305 | if (can_migrate_task(p, busiest, this_cpu, sd, idle, &pinned)) { | |
3306 | pull_task(busiest, p, this_rq, this_cpu); | |
3307 | /* | |
3308 | * Right now, this is only the second place pull_task() | |
3309 | * is called, so we can safely collect pull_task() | |
3310 | * stats here rather than inside pull_task(). | |
3311 | */ | |
3312 | schedstat_inc(sd, lb_gained[idle]); | |
3313 | ||
3314 | return 1; | |
3315 | } | |
3316 | p = iterator->next(iterator->arg); | |
3317 | } | |
3318 | ||
3319 | return 0; | |
3320 | } | |
3321 | ||
43010659 PW |
3322 | /* |
3323 | * move_one_task tries to move exactly one task from busiest to this_rq, as | |
3324 | * part of active balancing operations within "domain". | |
3325 | * Returns 1 if successful and 0 otherwise. | |
3326 | * | |
3327 | * Called with both runqueues locked. | |
3328 | */ | |
3329 | static int move_one_task(struct rq *this_rq, int this_cpu, struct rq *busiest, | |
3330 | struct sched_domain *sd, enum cpu_idle_type idle) | |
3331 | { | |
5522d5d5 | 3332 | const struct sched_class *class; |
43010659 | 3333 | |
cde7e5ca | 3334 | for_each_class(class) { |
e1d1484f | 3335 | if (class->move_one_task(this_rq, this_cpu, busiest, sd, idle)) |
43010659 | 3336 | return 1; |
cde7e5ca | 3337 | } |
43010659 PW |
3338 | |
3339 | return 0; | |
dd41f596 | 3340 | } |
67bb6c03 | 3341 | /********** Helpers for find_busiest_group ************************/ |
1da177e4 | 3342 | /* |
222d656d GS |
3343 | * sd_lb_stats - Structure to store the statistics of a sched_domain |
3344 | * during load balancing. | |
1da177e4 | 3345 | */ |
222d656d GS |
3346 | struct sd_lb_stats { |
3347 | struct sched_group *busiest; /* Busiest group in this sd */ | |
3348 | struct sched_group *this; /* Local group in this sd */ | |
3349 | unsigned long total_load; /* Total load of all groups in sd */ | |
3350 | unsigned long total_pwr; /* Total power of all groups in sd */ | |
3351 | unsigned long avg_load; /* Average load across all groups in sd */ | |
3352 | ||
3353 | /** Statistics of this group */ | |
3354 | unsigned long this_load; | |
3355 | unsigned long this_load_per_task; | |
3356 | unsigned long this_nr_running; | |
3357 | ||
3358 | /* Statistics of the busiest group */ | |
3359 | unsigned long max_load; | |
3360 | unsigned long busiest_load_per_task; | |
3361 | unsigned long busiest_nr_running; | |
3362 | ||
3363 | int group_imb; /* Is there imbalance in this sd */ | |
5c45bf27 | 3364 | #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT) |
222d656d GS |
3365 | int power_savings_balance; /* Is powersave balance needed for this sd */ |
3366 | struct sched_group *group_min; /* Least loaded group in sd */ | |
3367 | struct sched_group *group_leader; /* Group which relieves group_min */ | |
3368 | unsigned long min_load_per_task; /* load_per_task in group_min */ | |
3369 | unsigned long leader_nr_running; /* Nr running of group_leader */ | |
3370 | unsigned long min_nr_running; /* Nr running of group_min */ | |
5c45bf27 | 3371 | #endif |
222d656d | 3372 | }; |
1da177e4 | 3373 | |
d5ac537e | 3374 | /* |
381be78f GS |
3375 | * sg_lb_stats - stats of a sched_group required for load_balancing |
3376 | */ | |
3377 | struct sg_lb_stats { | |
3378 | unsigned long avg_load; /*Avg load across the CPUs of the group */ | |
3379 | unsigned long group_load; /* Total load over the CPUs of the group */ | |
3380 | unsigned long sum_nr_running; /* Nr tasks running in the group */ | |
3381 | unsigned long sum_weighted_load; /* Weighted load of group's tasks */ | |
3382 | unsigned long group_capacity; | |
3383 | int group_imb; /* Is there an imbalance in the group ? */ | |
3384 | }; | |
408ed066 | 3385 | |
67bb6c03 GS |
3386 | /** |
3387 | * group_first_cpu - Returns the first cpu in the cpumask of a sched_group. | |
3388 | * @group: The group whose first cpu is to be returned. | |
3389 | */ | |
3390 | static inline unsigned int group_first_cpu(struct sched_group *group) | |
3391 | { | |
3392 | return cpumask_first(sched_group_cpus(group)); | |
3393 | } | |
3394 | ||
3395 | /** | |
3396 | * get_sd_load_idx - Obtain the load index for a given sched domain. | |
3397 | * @sd: The sched_domain whose load_idx is to be obtained. | |
3398 | * @idle: The Idle status of the CPU for whose sd load_icx is obtained. | |
3399 | */ | |
3400 | static inline int get_sd_load_idx(struct sched_domain *sd, | |
3401 | enum cpu_idle_type idle) | |
3402 | { | |
3403 | int load_idx; | |
3404 | ||
3405 | switch (idle) { | |
3406 | case CPU_NOT_IDLE: | |
7897986b | 3407 | load_idx = sd->busy_idx; |
67bb6c03 GS |
3408 | break; |
3409 | ||
3410 | case CPU_NEWLY_IDLE: | |
7897986b | 3411 | load_idx = sd->newidle_idx; |
67bb6c03 GS |
3412 | break; |
3413 | default: | |
7897986b | 3414 | load_idx = sd->idle_idx; |
67bb6c03 GS |
3415 | break; |
3416 | } | |
1da177e4 | 3417 | |
67bb6c03 GS |
3418 | return load_idx; |
3419 | } | |
1da177e4 | 3420 | |
1da177e4 | 3421 | |
c071df18 GS |
3422 | #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT) |
3423 | /** | |
3424 | * init_sd_power_savings_stats - Initialize power savings statistics for | |
3425 | * the given sched_domain, during load balancing. | |
3426 | * | |
3427 | * @sd: Sched domain whose power-savings statistics are to be initialized. | |
3428 | * @sds: Variable containing the statistics for sd. | |
3429 | * @idle: Idle status of the CPU at which we're performing load-balancing. | |
3430 | */ | |
3431 | static inline void init_sd_power_savings_stats(struct sched_domain *sd, | |
3432 | struct sd_lb_stats *sds, enum cpu_idle_type idle) | |
3433 | { | |
3434 | /* | |
3435 | * Busy processors will not participate in power savings | |
3436 | * balance. | |
3437 | */ | |
3438 | if (idle == CPU_NOT_IDLE || !(sd->flags & SD_POWERSAVINGS_BALANCE)) | |
3439 | sds->power_savings_balance = 0; | |
3440 | else { | |
3441 | sds->power_savings_balance = 1; | |
3442 | sds->min_nr_running = ULONG_MAX; | |
3443 | sds->leader_nr_running = 0; | |
3444 | } | |
3445 | } | |
783609c6 | 3446 | |
c071df18 GS |
3447 | /** |
3448 | * update_sd_power_savings_stats - Update the power saving stats for a | |
3449 | * sched_domain while performing load balancing. | |
3450 | * | |
3451 | * @group: sched_group belonging to the sched_domain under consideration. | |
3452 | * @sds: Variable containing the statistics of the sched_domain | |
3453 | * @local_group: Does group contain the CPU for which we're performing | |
3454 | * load balancing ? | |
3455 | * @sgs: Variable containing the statistics of the group. | |
3456 | */ | |
3457 | static inline void update_sd_power_savings_stats(struct sched_group *group, | |
3458 | struct sd_lb_stats *sds, int local_group, struct sg_lb_stats *sgs) | |
3459 | { | |
408ed066 | 3460 | |
c071df18 GS |
3461 | if (!sds->power_savings_balance) |
3462 | return; | |
1da177e4 | 3463 | |
c071df18 GS |
3464 | /* |
3465 | * If the local group is idle or completely loaded | |
3466 | * no need to do power savings balance at this domain | |
3467 | */ | |
3468 | if (local_group && (sds->this_nr_running >= sgs->group_capacity || | |
3469 | !sds->this_nr_running)) | |
3470 | sds->power_savings_balance = 0; | |
2dd73a4f | 3471 | |
c071df18 GS |
3472 | /* |
3473 | * If a group is already running at full capacity or idle, | |
3474 | * don't include that group in power savings calculations | |
3475 | */ | |
3476 | if (!sds->power_savings_balance || | |
3477 | sgs->sum_nr_running >= sgs->group_capacity || | |
3478 | !sgs->sum_nr_running) | |
3479 | return; | |
5969fe06 | 3480 | |
c071df18 GS |
3481 | /* |
3482 | * Calculate the group which has the least non-idle load. | |
3483 | * This is the group from where we need to pick up the load | |
3484 | * for saving power | |
3485 | */ | |
3486 | if ((sgs->sum_nr_running < sds->min_nr_running) || | |
3487 | (sgs->sum_nr_running == sds->min_nr_running && | |
3488 | group_first_cpu(group) > group_first_cpu(sds->group_min))) { | |
3489 | sds->group_min = group; | |
3490 | sds->min_nr_running = sgs->sum_nr_running; | |
3491 | sds->min_load_per_task = sgs->sum_weighted_load / | |
3492 | sgs->sum_nr_running; | |
3493 | } | |
783609c6 | 3494 | |
c071df18 GS |
3495 | /* |
3496 | * Calculate the group which is almost near its | |
3497 | * capacity but still has some space to pick up some load | |
3498 | * from other group and save more power | |
3499 | */ | |
d899a789 | 3500 | if (sgs->sum_nr_running + 1 > sgs->group_capacity) |
c071df18 | 3501 | return; |
1da177e4 | 3502 | |
c071df18 GS |
3503 | if (sgs->sum_nr_running > sds->leader_nr_running || |
3504 | (sgs->sum_nr_running == sds->leader_nr_running && | |
3505 | group_first_cpu(group) < group_first_cpu(sds->group_leader))) { | |
3506 | sds->group_leader = group; | |
3507 | sds->leader_nr_running = sgs->sum_nr_running; | |
3508 | } | |
3509 | } | |
408ed066 | 3510 | |
c071df18 | 3511 | /** |
d5ac537e | 3512 | * check_power_save_busiest_group - see if there is potential for some power-savings balance |
c071df18 GS |
3513 | * @sds: Variable containing the statistics of the sched_domain |
3514 | * under consideration. | |
3515 | * @this_cpu: Cpu at which we're currently performing load-balancing. | |
3516 | * @imbalance: Variable to store the imbalance. | |
3517 | * | |
d5ac537e RD |
3518 | * Description: |
3519 | * Check if we have potential to perform some power-savings balance. | |
3520 | * If yes, set the busiest group to be the least loaded group in the | |
3521 | * sched_domain, so that it's CPUs can be put to idle. | |
3522 | * | |
c071df18 GS |
3523 | * Returns 1 if there is potential to perform power-savings balance. |
3524 | * Else returns 0. | |
3525 | */ | |
3526 | static inline int check_power_save_busiest_group(struct sd_lb_stats *sds, | |
3527 | int this_cpu, unsigned long *imbalance) | |
3528 | { | |
3529 | if (!sds->power_savings_balance) | |
3530 | return 0; | |
1da177e4 | 3531 | |
c071df18 GS |
3532 | if (sds->this != sds->group_leader || |
3533 | sds->group_leader == sds->group_min) | |
3534 | return 0; | |
783609c6 | 3535 | |
c071df18 GS |
3536 | *imbalance = sds->min_load_per_task; |
3537 | sds->busiest = sds->group_min; | |
1da177e4 | 3538 | |
c071df18 | 3539 | return 1; |
1da177e4 | 3540 | |
c071df18 GS |
3541 | } |
3542 | #else /* CONFIG_SCHED_MC || CONFIG_SCHED_SMT */ | |
3543 | static inline void init_sd_power_savings_stats(struct sched_domain *sd, | |
3544 | struct sd_lb_stats *sds, enum cpu_idle_type idle) | |
3545 | { | |
3546 | return; | |
3547 | } | |
408ed066 | 3548 | |
c071df18 GS |
3549 | static inline void update_sd_power_savings_stats(struct sched_group *group, |
3550 | struct sd_lb_stats *sds, int local_group, struct sg_lb_stats *sgs) | |
3551 | { | |
3552 | return; | |
3553 | } | |
3554 | ||
3555 | static inline int check_power_save_busiest_group(struct sd_lb_stats *sds, | |
3556 | int this_cpu, unsigned long *imbalance) | |
3557 | { | |
3558 | return 0; | |
3559 | } | |
3560 | #endif /* CONFIG_SCHED_MC || CONFIG_SCHED_SMT */ | |
3561 | ||
d6a59aa3 PZ |
3562 | |
3563 | unsigned long default_scale_freq_power(struct sched_domain *sd, int cpu) | |
3564 | { | |
3565 | return SCHED_LOAD_SCALE; | |
3566 | } | |
3567 | ||
3568 | unsigned long __weak arch_scale_freq_power(struct sched_domain *sd, int cpu) | |
3569 | { | |
3570 | return default_scale_freq_power(sd, cpu); | |
3571 | } | |
3572 | ||
3573 | unsigned long default_scale_smt_power(struct sched_domain *sd, int cpu) | |
ab29230e PZ |
3574 | { |
3575 | unsigned long weight = cpumask_weight(sched_domain_span(sd)); | |
3576 | unsigned long smt_gain = sd->smt_gain; | |
3577 | ||
3578 | smt_gain /= weight; | |
3579 | ||
3580 | return smt_gain; | |
3581 | } | |
3582 | ||
d6a59aa3 PZ |
3583 | unsigned long __weak arch_scale_smt_power(struct sched_domain *sd, int cpu) |
3584 | { | |
3585 | return default_scale_smt_power(sd, cpu); | |
3586 | } | |
3587 | ||
e9e9250b PZ |
3588 | unsigned long scale_rt_power(int cpu) |
3589 | { | |
3590 | struct rq *rq = cpu_rq(cpu); | |
3591 | u64 total, available; | |
3592 | ||
3593 | sched_avg_update(rq); | |
3594 | ||
3595 | total = sched_avg_period() + (rq->clock - rq->age_stamp); | |
3596 | available = total - rq->rt_avg; | |
3597 | ||
3598 | if (unlikely((s64)total < SCHED_LOAD_SCALE)) | |
3599 | total = SCHED_LOAD_SCALE; | |
3600 | ||
3601 | total >>= SCHED_LOAD_SHIFT; | |
3602 | ||
3603 | return div_u64(available, total); | |
3604 | } | |
3605 | ||
ab29230e PZ |
3606 | static void update_cpu_power(struct sched_domain *sd, int cpu) |
3607 | { | |
3608 | unsigned long weight = cpumask_weight(sched_domain_span(sd)); | |
3609 | unsigned long power = SCHED_LOAD_SCALE; | |
3610 | struct sched_group *sdg = sd->groups; | |
ab29230e | 3611 | |
8e6598af PZ |
3612 | if (sched_feat(ARCH_POWER)) |
3613 | power *= arch_scale_freq_power(sd, cpu); | |
3614 | else | |
3615 | power *= default_scale_freq_power(sd, cpu); | |
3616 | ||
d6a59aa3 | 3617 | power >>= SCHED_LOAD_SHIFT; |
ab29230e PZ |
3618 | |
3619 | if ((sd->flags & SD_SHARE_CPUPOWER) && weight > 1) { | |
8e6598af PZ |
3620 | if (sched_feat(ARCH_POWER)) |
3621 | power *= arch_scale_smt_power(sd, cpu); | |
3622 | else | |
3623 | power *= default_scale_smt_power(sd, cpu); | |
3624 | ||
ab29230e PZ |
3625 | power >>= SCHED_LOAD_SHIFT; |
3626 | } | |
3627 | ||
e9e9250b PZ |
3628 | power *= scale_rt_power(cpu); |
3629 | power >>= SCHED_LOAD_SHIFT; | |
3630 | ||
3631 | if (!power) | |
3632 | power = 1; | |
ab29230e | 3633 | |
18a3885f | 3634 | sdg->cpu_power = power; |
ab29230e PZ |
3635 | } |
3636 | ||
3637 | static void update_group_power(struct sched_domain *sd, int cpu) | |
cc9fba7d PZ |
3638 | { |
3639 | struct sched_domain *child = sd->child; | |
3640 | struct sched_group *group, *sdg = sd->groups; | |
d7ea17a7 | 3641 | unsigned long power; |
cc9fba7d PZ |
3642 | |
3643 | if (!child) { | |
ab29230e | 3644 | update_cpu_power(sd, cpu); |
cc9fba7d PZ |
3645 | return; |
3646 | } | |
3647 | ||
d7ea17a7 | 3648 | power = 0; |
cc9fba7d PZ |
3649 | |
3650 | group = child->groups; | |
3651 | do { | |
d7ea17a7 | 3652 | power += group->cpu_power; |
cc9fba7d PZ |
3653 | group = group->next; |
3654 | } while (group != child->groups); | |
d7ea17a7 IM |
3655 | |
3656 | sdg->cpu_power = power; | |
cc9fba7d | 3657 | } |
c071df18 | 3658 | |
1f8c553d GS |
3659 | /** |
3660 | * update_sg_lb_stats - Update sched_group's statistics for load balancing. | |
3661 | * @group: sched_group whose statistics are to be updated. | |
3662 | * @this_cpu: Cpu for which load balance is currently performed. | |
3663 | * @idle: Idle status of this_cpu | |
3664 | * @load_idx: Load index of sched_domain of this_cpu for load calc. | |
3665 | * @sd_idle: Idle status of the sched_domain containing group. | |
3666 | * @local_group: Does group contain this_cpu. | |
3667 | * @cpus: Set of cpus considered for load balancing. | |
3668 | * @balance: Should we balance. | |
3669 | * @sgs: variable to hold the statistics for this group. | |
3670 | */ | |
cc9fba7d PZ |
3671 | static inline void update_sg_lb_stats(struct sched_domain *sd, |
3672 | struct sched_group *group, int this_cpu, | |
1f8c553d GS |
3673 | enum cpu_idle_type idle, int load_idx, int *sd_idle, |
3674 | int local_group, const struct cpumask *cpus, | |
3675 | int *balance, struct sg_lb_stats *sgs) | |
3676 | { | |
3677 | unsigned long load, max_cpu_load, min_cpu_load; | |
3678 | int i; | |
3679 | unsigned int balance_cpu = -1, first_idle_cpu = 0; | |
3680 | unsigned long sum_avg_load_per_task; | |
3681 | unsigned long avg_load_per_task; | |
3682 | ||
cc9fba7d | 3683 | if (local_group) { |
1f8c553d | 3684 | balance_cpu = group_first_cpu(group); |
cc9fba7d | 3685 | if (balance_cpu == this_cpu) |
ab29230e | 3686 | update_group_power(sd, this_cpu); |
cc9fba7d | 3687 | } |
1f8c553d GS |
3688 | |
3689 | /* Tally up the load of all CPUs in the group */ | |
3690 | sum_avg_load_per_task = avg_load_per_task = 0; | |
3691 | max_cpu_load = 0; | |
3692 | min_cpu_load = ~0UL; | |
408ed066 | 3693 | |
1f8c553d GS |
3694 | for_each_cpu_and(i, sched_group_cpus(group), cpus) { |
3695 | struct rq *rq = cpu_rq(i); | |
908a7c1b | 3696 | |
1f8c553d GS |
3697 | if (*sd_idle && rq->nr_running) |
3698 | *sd_idle = 0; | |
5c45bf27 | 3699 | |
1f8c553d | 3700 | /* Bias balancing toward cpus of our domain */ |
1da177e4 | 3701 | if (local_group) { |
1f8c553d GS |
3702 | if (idle_cpu(i) && !first_idle_cpu) { |
3703 | first_idle_cpu = 1; | |
3704 | balance_cpu = i; | |
3705 | } | |
3706 | ||
3707 | load = target_load(i, load_idx); | |
3708 | } else { | |
3709 | load = source_load(i, load_idx); | |
3710 | if (load > max_cpu_load) | |
3711 | max_cpu_load = load; | |
3712 | if (min_cpu_load > load) | |
3713 | min_cpu_load = load; | |
1da177e4 | 3714 | } |
5c45bf27 | 3715 | |
1f8c553d GS |
3716 | sgs->group_load += load; |
3717 | sgs->sum_nr_running += rq->nr_running; | |
3718 | sgs->sum_weighted_load += weighted_cpuload(i); | |
5c45bf27 | 3719 | |
1f8c553d GS |
3720 | sum_avg_load_per_task += cpu_avg_load_per_task(i); |
3721 | } | |
5c45bf27 | 3722 | |
1f8c553d GS |
3723 | /* |
3724 | * First idle cpu or the first cpu(busiest) in this sched group | |
3725 | * is eligible for doing load balancing at this and above | |
3726 | * domains. In the newly idle case, we will allow all the cpu's | |
3727 | * to do the newly idle load balance. | |
3728 | */ | |
3729 | if (idle != CPU_NEWLY_IDLE && local_group && | |
3730 | balance_cpu != this_cpu && balance) { | |
3731 | *balance = 0; | |
3732 | return; | |
3733 | } | |
5c45bf27 | 3734 | |
1f8c553d | 3735 | /* Adjust by relative CPU power of the group */ |
18a3885f | 3736 | sgs->avg_load = (sgs->group_load * SCHED_LOAD_SCALE) / group->cpu_power; |
5c45bf27 | 3737 | |
1f8c553d GS |
3738 | |
3739 | /* | |
3740 | * Consider the group unbalanced when the imbalance is larger | |
3741 | * than the average weight of two tasks. | |
3742 | * | |
3743 | * APZ: with cgroup the avg task weight can vary wildly and | |
3744 | * might not be a suitable number - should we keep a | |
3745 | * normalized nr_running number somewhere that negates | |
3746 | * the hierarchy? | |
3747 | */ | |
18a3885f PZ |
3748 | avg_load_per_task = (sum_avg_load_per_task * SCHED_LOAD_SCALE) / |
3749 | group->cpu_power; | |
1f8c553d GS |
3750 | |
3751 | if ((max_cpu_load - min_cpu_load) > 2*avg_load_per_task) | |
3752 | sgs->group_imb = 1; | |
3753 | ||
bdb94aa5 | 3754 | sgs->group_capacity = |
18a3885f | 3755 | DIV_ROUND_CLOSEST(group->cpu_power, SCHED_LOAD_SCALE); |
1f8c553d | 3756 | } |
dd41f596 | 3757 | |
37abe198 GS |
3758 | /** |
3759 | * update_sd_lb_stats - Update sched_group's statistics for load balancing. | |
3760 | * @sd: sched_domain whose statistics are to be updated. | |
3761 | * @this_cpu: Cpu for which load balance is currently performed. | |
3762 | * @idle: Idle status of this_cpu | |
3763 | * @sd_idle: Idle status of the sched_domain containing group. | |
3764 | * @cpus: Set of cpus considered for load balancing. | |
3765 | * @balance: Should we balance. | |
3766 | * @sds: variable to hold the statistics for this sched_domain. | |
1da177e4 | 3767 | */ |
37abe198 GS |
3768 | static inline void update_sd_lb_stats(struct sched_domain *sd, int this_cpu, |
3769 | enum cpu_idle_type idle, int *sd_idle, | |
3770 | const struct cpumask *cpus, int *balance, | |
3771 | struct sd_lb_stats *sds) | |
1da177e4 | 3772 | { |
b5d978e0 | 3773 | struct sched_domain *child = sd->child; |
222d656d | 3774 | struct sched_group *group = sd->groups; |
37abe198 | 3775 | struct sg_lb_stats sgs; |
b5d978e0 PZ |
3776 | int load_idx, prefer_sibling = 0; |
3777 | ||
3778 | if (child && child->flags & SD_PREFER_SIBLING) | |
3779 | prefer_sibling = 1; | |
222d656d | 3780 | |
c071df18 | 3781 | init_sd_power_savings_stats(sd, sds, idle); |
67bb6c03 | 3782 | load_idx = get_sd_load_idx(sd, idle); |
1da177e4 LT |
3783 | |
3784 | do { | |
1da177e4 | 3785 | int local_group; |
1da177e4 | 3786 | |
758b2cdc RR |
3787 | local_group = cpumask_test_cpu(this_cpu, |
3788 | sched_group_cpus(group)); | |
381be78f | 3789 | memset(&sgs, 0, sizeof(sgs)); |
cc9fba7d | 3790 | update_sg_lb_stats(sd, group, this_cpu, idle, load_idx, sd_idle, |
1f8c553d | 3791 | local_group, cpus, balance, &sgs); |
1da177e4 | 3792 | |
37abe198 GS |
3793 | if (local_group && balance && !(*balance)) |
3794 | return; | |
783609c6 | 3795 | |
37abe198 | 3796 | sds->total_load += sgs.group_load; |
18a3885f | 3797 | sds->total_pwr += group->cpu_power; |
1da177e4 | 3798 | |
b5d978e0 PZ |
3799 | /* |
3800 | * In case the child domain prefers tasks go to siblings | |
3801 | * first, lower the group capacity to one so that we'll try | |
3802 | * and move all the excess tasks away. | |
3803 | */ | |
3804 | if (prefer_sibling) | |
bdb94aa5 | 3805 | sgs.group_capacity = min(sgs.group_capacity, 1UL); |
1da177e4 | 3806 | |
1da177e4 | 3807 | if (local_group) { |
37abe198 GS |
3808 | sds->this_load = sgs.avg_load; |
3809 | sds->this = group; | |
3810 | sds->this_nr_running = sgs.sum_nr_running; | |
3811 | sds->this_load_per_task = sgs.sum_weighted_load; | |
3812 | } else if (sgs.avg_load > sds->max_load && | |
381be78f GS |
3813 | (sgs.sum_nr_running > sgs.group_capacity || |
3814 | sgs.group_imb)) { | |
37abe198 GS |
3815 | sds->max_load = sgs.avg_load; |
3816 | sds->busiest = group; | |
3817 | sds->busiest_nr_running = sgs.sum_nr_running; | |
3818 | sds->busiest_load_per_task = sgs.sum_weighted_load; | |
3819 | sds->group_imb = sgs.group_imb; | |
48f24c4d | 3820 | } |
5c45bf27 | 3821 | |
c071df18 | 3822 | update_sd_power_savings_stats(group, sds, local_group, &sgs); |
1da177e4 LT |
3823 | group = group->next; |
3824 | } while (group != sd->groups); | |
37abe198 | 3825 | } |
1da177e4 | 3826 | |
2e6f44ae GS |
3827 | /** |
3828 | * fix_small_imbalance - Calculate the minor imbalance that exists | |
dbc523a3 GS |
3829 | * amongst the groups of a sched_domain, during |
3830 | * load balancing. | |
2e6f44ae GS |
3831 | * @sds: Statistics of the sched_domain whose imbalance is to be calculated. |
3832 | * @this_cpu: The cpu at whose sched_domain we're performing load-balance. | |
3833 | * @imbalance: Variable to store the imbalance. | |
3834 | */ | |
3835 | static inline void fix_small_imbalance(struct sd_lb_stats *sds, | |
3836 | int this_cpu, unsigned long *imbalance) | |
3837 | { | |
3838 | unsigned long tmp, pwr_now = 0, pwr_move = 0; | |
3839 | unsigned int imbn = 2; | |
3840 | ||
3841 | if (sds->this_nr_running) { | |
3842 | sds->this_load_per_task /= sds->this_nr_running; | |
3843 | if (sds->busiest_load_per_task > | |
3844 | sds->this_load_per_task) | |
3845 | imbn = 1; | |
3846 | } else | |
3847 | sds->this_load_per_task = | |
3848 | cpu_avg_load_per_task(this_cpu); | |
1da177e4 | 3849 | |
2e6f44ae GS |
3850 | if (sds->max_load - sds->this_load + sds->busiest_load_per_task >= |
3851 | sds->busiest_load_per_task * imbn) { | |
3852 | *imbalance = sds->busiest_load_per_task; | |
3853 | return; | |
3854 | } | |
908a7c1b | 3855 | |
1da177e4 | 3856 | /* |
2e6f44ae GS |
3857 | * OK, we don't have enough imbalance to justify moving tasks, |
3858 | * however we may be able to increase total CPU power used by | |
3859 | * moving them. | |
1da177e4 | 3860 | */ |
2dd73a4f | 3861 | |
18a3885f | 3862 | pwr_now += sds->busiest->cpu_power * |
2e6f44ae | 3863 | min(sds->busiest_load_per_task, sds->max_load); |
18a3885f | 3864 | pwr_now += sds->this->cpu_power * |
2e6f44ae GS |
3865 | min(sds->this_load_per_task, sds->this_load); |
3866 | pwr_now /= SCHED_LOAD_SCALE; | |
3867 | ||
3868 | /* Amount of load we'd subtract */ | |
18a3885f PZ |
3869 | tmp = (sds->busiest_load_per_task * SCHED_LOAD_SCALE) / |
3870 | sds->busiest->cpu_power; | |
2e6f44ae | 3871 | if (sds->max_load > tmp) |
18a3885f | 3872 | pwr_move += sds->busiest->cpu_power * |
2e6f44ae GS |
3873 | min(sds->busiest_load_per_task, sds->max_load - tmp); |
3874 | ||
3875 | /* Amount of load we'd add */ | |
18a3885f | 3876 | if (sds->max_load * sds->busiest->cpu_power < |
2e6f44ae | 3877 | sds->busiest_load_per_task * SCHED_LOAD_SCALE) |
18a3885f PZ |
3878 | tmp = (sds->max_load * sds->busiest->cpu_power) / |
3879 | sds->this->cpu_power; | |
2e6f44ae | 3880 | else |
18a3885f PZ |
3881 | tmp = (sds->busiest_load_per_task * SCHED_LOAD_SCALE) / |
3882 | sds->this->cpu_power; | |
3883 | pwr_move += sds->this->cpu_power * | |
2e6f44ae GS |
3884 | min(sds->this_load_per_task, sds->this_load + tmp); |
3885 | pwr_move /= SCHED_LOAD_SCALE; | |
3886 | ||
3887 | /* Move if we gain throughput */ | |
3888 | if (pwr_move > pwr_now) | |
3889 | *imbalance = sds->busiest_load_per_task; | |
3890 | } | |
dbc523a3 GS |
3891 | |
3892 | /** | |
3893 | * calculate_imbalance - Calculate the amount of imbalance present within the | |
3894 | * groups of a given sched_domain during load balance. | |
3895 | * @sds: statistics of the sched_domain whose imbalance is to be calculated. | |
3896 | * @this_cpu: Cpu for which currently load balance is being performed. | |
3897 | * @imbalance: The variable to store the imbalance. | |
3898 | */ | |
3899 | static inline void calculate_imbalance(struct sd_lb_stats *sds, int this_cpu, | |
3900 | unsigned long *imbalance) | |
3901 | { | |
3902 | unsigned long max_pull; | |
2dd73a4f PW |
3903 | /* |
3904 | * In the presence of smp nice balancing, certain scenarios can have | |
3905 | * max load less than avg load(as we skip the groups at or below | |
3906 | * its cpu_power, while calculating max_load..) | |
3907 | */ | |
dbc523a3 | 3908 | if (sds->max_load < sds->avg_load) { |
2dd73a4f | 3909 | *imbalance = 0; |
dbc523a3 | 3910 | return fix_small_imbalance(sds, this_cpu, imbalance); |
2dd73a4f | 3911 | } |
0c117f1b SS |
3912 | |
3913 | /* Don't want to pull so many tasks that a group would go idle */ | |
dbc523a3 GS |
3914 | max_pull = min(sds->max_load - sds->avg_load, |
3915 | sds->max_load - sds->busiest_load_per_task); | |
0c117f1b | 3916 | |
1da177e4 | 3917 | /* How much load to actually move to equalise the imbalance */ |
18a3885f PZ |
3918 | *imbalance = min(max_pull * sds->busiest->cpu_power, |
3919 | (sds->avg_load - sds->this_load) * sds->this->cpu_power) | |
1da177e4 LT |
3920 | / SCHED_LOAD_SCALE; |
3921 | ||
2dd73a4f PW |
3922 | /* |
3923 | * if *imbalance is less than the average load per runnable task | |
3924 | * there is no gaurantee that any tasks will be moved so we'll have | |
3925 | * a think about bumping its value to force at least one task to be | |
3926 | * moved | |
3927 | */ | |
dbc523a3 GS |
3928 | if (*imbalance < sds->busiest_load_per_task) |
3929 | return fix_small_imbalance(sds, this_cpu, imbalance); | |
1da177e4 | 3930 | |
dbc523a3 | 3931 | } |
37abe198 | 3932 | /******* find_busiest_group() helpers end here *********************/ |
1da177e4 | 3933 | |
b7bb4c9b GS |
3934 | /** |
3935 | * find_busiest_group - Returns the busiest group within the sched_domain | |
3936 | * if there is an imbalance. If there isn't an imbalance, and | |
3937 | * the user has opted for power-savings, it returns a group whose | |
3938 | * CPUs can be put to idle by rebalancing those tasks elsewhere, if | |
3939 | * such a group exists. | |
3940 | * | |
3941 | * Also calculates the amount of weighted load which should be moved | |
3942 | * to restore balance. | |
3943 | * | |
3944 | * @sd: The sched_domain whose busiest group is to be returned. | |
3945 | * @this_cpu: The cpu for which load balancing is currently being performed. | |
3946 | * @imbalance: Variable which stores amount of weighted load which should | |
3947 | * be moved to restore balance/put a group to idle. | |
3948 | * @idle: The idle status of this_cpu. | |
3949 | * @sd_idle: The idleness of sd | |
3950 | * @cpus: The set of CPUs under consideration for load-balancing. | |
3951 | * @balance: Pointer to a variable indicating if this_cpu | |
3952 | * is the appropriate cpu to perform load balancing at this_level. | |
3953 | * | |
3954 | * Returns: - the busiest group if imbalance exists. | |
3955 | * - If no imbalance and user has opted for power-savings balance, | |
3956 | * return the least loaded group whose CPUs can be | |
3957 | * put to idle by rebalancing its tasks onto our group. | |
37abe198 GS |
3958 | */ |
3959 | static struct sched_group * | |
3960 | find_busiest_group(struct sched_domain *sd, int this_cpu, | |
3961 | unsigned long *imbalance, enum cpu_idle_type idle, | |
3962 | int *sd_idle, const struct cpumask *cpus, int *balance) | |
3963 | { | |
3964 | struct sd_lb_stats sds; | |
1da177e4 | 3965 | |
37abe198 | 3966 | memset(&sds, 0, sizeof(sds)); |
1da177e4 | 3967 | |
37abe198 GS |
3968 | /* |
3969 | * Compute the various statistics relavent for load balancing at | |
3970 | * this level. | |
3971 | */ | |
3972 | update_sd_lb_stats(sd, this_cpu, idle, sd_idle, cpus, | |
3973 | balance, &sds); | |
3974 | ||
b7bb4c9b GS |
3975 | /* Cases where imbalance does not exist from POV of this_cpu */ |
3976 | /* 1) this_cpu is not the appropriate cpu to perform load balancing | |
3977 | * at this level. | |
3978 | * 2) There is no busy sibling group to pull from. | |
3979 | * 3) This group is the busiest group. | |
3980 | * 4) This group is more busy than the avg busieness at this | |
3981 | * sched_domain. | |
3982 | * 5) The imbalance is within the specified limit. | |
3983 | * 6) Any rebalance would lead to ping-pong | |
3984 | */ | |
37abe198 GS |
3985 | if (balance && !(*balance)) |
3986 | goto ret; | |
1da177e4 | 3987 | |
b7bb4c9b GS |
3988 | if (!sds.busiest || sds.busiest_nr_running == 0) |
3989 | goto out_balanced; | |
1da177e4 | 3990 | |
b7bb4c9b | 3991 | if (sds.this_load >= sds.max_load) |
1da177e4 | 3992 | goto out_balanced; |
1da177e4 | 3993 | |
222d656d | 3994 | sds.avg_load = (SCHED_LOAD_SCALE * sds.total_load) / sds.total_pwr; |
1da177e4 | 3995 | |
b7bb4c9b GS |
3996 | if (sds.this_load >= sds.avg_load) |
3997 | goto out_balanced; | |
3998 | ||
3999 | if (100 * sds.max_load <= sd->imbalance_pct * sds.this_load) | |
1da177e4 LT |
4000 | goto out_balanced; |
4001 | ||
222d656d GS |
4002 | sds.busiest_load_per_task /= sds.busiest_nr_running; |
4003 | if (sds.group_imb) | |
4004 | sds.busiest_load_per_task = | |
4005 | min(sds.busiest_load_per_task, sds.avg_load); | |
908a7c1b | 4006 | |
1da177e4 LT |
4007 | /* |
4008 | * We're trying to get all the cpus to the average_load, so we don't | |
4009 | * want to push ourselves above the average load, nor do we wish to | |
4010 | * reduce the max loaded cpu below the average load, as either of these | |
4011 | * actions would just result in more rebalancing later, and ping-pong | |
4012 | * tasks around. Thus we look for the minimum possible imbalance. | |
4013 | * Negative imbalances (*we* are more loaded than anyone else) will | |
4014 | * be counted as no imbalance for these purposes -- we can't fix that | |
41a2d6cf | 4015 | * by pulling tasks to us. Be careful of negative numbers as they'll |
1da177e4 LT |
4016 | * appear as very large values with unsigned longs. |
4017 | */ | |
222d656d | 4018 | if (sds.max_load <= sds.busiest_load_per_task) |
2dd73a4f PW |
4019 | goto out_balanced; |
4020 | ||
dbc523a3 GS |
4021 | /* Looks like there is an imbalance. Compute it */ |
4022 | calculate_imbalance(&sds, this_cpu, imbalance); | |
222d656d | 4023 | return sds.busiest; |
1da177e4 LT |
4024 | |
4025 | out_balanced: | |
c071df18 GS |
4026 | /* |
4027 | * There is no obvious imbalance. But check if we can do some balancing | |
4028 | * to save power. | |
4029 | */ | |
4030 | if (check_power_save_busiest_group(&sds, this_cpu, imbalance)) | |
4031 | return sds.busiest; | |
783609c6 | 4032 | ret: |
1da177e4 LT |
4033 | *imbalance = 0; |
4034 | return NULL; | |
4035 | } | |
4036 | ||
4037 | /* | |
4038 | * find_busiest_queue - find the busiest runqueue among the cpus in group. | |
4039 | */ | |
70b97a7f | 4040 | static struct rq * |
d15bcfdb | 4041 | find_busiest_queue(struct sched_group *group, enum cpu_idle_type idle, |
96f874e2 | 4042 | unsigned long imbalance, const struct cpumask *cpus) |
1da177e4 | 4043 | { |
70b97a7f | 4044 | struct rq *busiest = NULL, *rq; |
2dd73a4f | 4045 | unsigned long max_load = 0; |
1da177e4 LT |
4046 | int i; |
4047 | ||
758b2cdc | 4048 | for_each_cpu(i, sched_group_cpus(group)) { |
bdb94aa5 PZ |
4049 | unsigned long power = power_of(i); |
4050 | unsigned long capacity = DIV_ROUND_CLOSEST(power, SCHED_LOAD_SCALE); | |
dd41f596 | 4051 | unsigned long wl; |
0a2966b4 | 4052 | |
96f874e2 | 4053 | if (!cpumask_test_cpu(i, cpus)) |
0a2966b4 CL |
4054 | continue; |
4055 | ||
48f24c4d | 4056 | rq = cpu_rq(i); |
bdb94aa5 PZ |
4057 | wl = weighted_cpuload(i) * SCHED_LOAD_SCALE; |
4058 | wl /= power; | |
2dd73a4f | 4059 | |
bdb94aa5 | 4060 | if (capacity && rq->nr_running == 1 && wl > imbalance) |
2dd73a4f | 4061 | continue; |
1da177e4 | 4062 | |
dd41f596 IM |
4063 | if (wl > max_load) { |
4064 | max_load = wl; | |
48f24c4d | 4065 | busiest = rq; |
1da177e4 LT |
4066 | } |
4067 | } | |
4068 | ||
4069 | return busiest; | |
4070 | } | |
4071 | ||
77391d71 NP |
4072 | /* |
4073 | * Max backoff if we encounter pinned tasks. Pretty arbitrary value, but | |
4074 | * so long as it is large enough. | |
4075 | */ | |
4076 | #define MAX_PINNED_INTERVAL 512 | |
4077 | ||
df7c8e84 RR |
4078 | /* Working cpumask for load_balance and load_balance_newidle. */ |
4079 | static DEFINE_PER_CPU(cpumask_var_t, load_balance_tmpmask); | |
4080 | ||
1da177e4 LT |
4081 | /* |
4082 | * Check this_cpu to ensure it is balanced within domain. Attempt to move | |
4083 | * tasks if there is an imbalance. | |
1da177e4 | 4084 | */ |
70b97a7f | 4085 | static int load_balance(int this_cpu, struct rq *this_rq, |
d15bcfdb | 4086 | struct sched_domain *sd, enum cpu_idle_type idle, |
df7c8e84 | 4087 | int *balance) |
1da177e4 | 4088 | { |
43010659 | 4089 | int ld_moved, all_pinned = 0, active_balance = 0, sd_idle = 0; |
1da177e4 | 4090 | struct sched_group *group; |
1da177e4 | 4091 | unsigned long imbalance; |
70b97a7f | 4092 | struct rq *busiest; |
fe2eea3f | 4093 | unsigned long flags; |
df7c8e84 | 4094 | struct cpumask *cpus = __get_cpu_var(load_balance_tmpmask); |
5969fe06 | 4095 | |
96f874e2 | 4096 | cpumask_setall(cpus); |
7c16ec58 | 4097 | |
89c4710e SS |
4098 | /* |
4099 | * When power savings policy is enabled for the parent domain, idle | |
4100 | * sibling can pick up load irrespective of busy siblings. In this case, | |
dd41f596 | 4101 | * let the state of idle sibling percolate up as CPU_IDLE, instead of |
d15bcfdb | 4102 | * portraying it as CPU_NOT_IDLE. |
89c4710e | 4103 | */ |
d15bcfdb | 4104 | if (idle != CPU_NOT_IDLE && sd->flags & SD_SHARE_CPUPOWER && |
89c4710e | 4105 | !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE)) |
5969fe06 | 4106 | sd_idle = 1; |
1da177e4 | 4107 | |
2d72376b | 4108 | schedstat_inc(sd, lb_count[idle]); |
1da177e4 | 4109 | |
0a2966b4 | 4110 | redo: |
c8cba857 | 4111 | update_shares(sd); |
0a2966b4 | 4112 | group = find_busiest_group(sd, this_cpu, &imbalance, idle, &sd_idle, |
7c16ec58 | 4113 | cpus, balance); |
783609c6 | 4114 | |
06066714 | 4115 | if (*balance == 0) |
783609c6 | 4116 | goto out_balanced; |
783609c6 | 4117 | |
1da177e4 LT |
4118 | if (!group) { |
4119 | schedstat_inc(sd, lb_nobusyg[idle]); | |
4120 | goto out_balanced; | |
4121 | } | |
4122 | ||
7c16ec58 | 4123 | busiest = find_busiest_queue(group, idle, imbalance, cpus); |
1da177e4 LT |
4124 | if (!busiest) { |
4125 | schedstat_inc(sd, lb_nobusyq[idle]); | |
4126 | goto out_balanced; | |
4127 | } | |
4128 | ||
db935dbd | 4129 | BUG_ON(busiest == this_rq); |
1da177e4 LT |
4130 | |
4131 | schedstat_add(sd, lb_imbalance[idle], imbalance); | |
4132 | ||
43010659 | 4133 | ld_moved = 0; |
1da177e4 LT |
4134 | if (busiest->nr_running > 1) { |
4135 | /* | |
4136 | * Attempt to move tasks. If find_busiest_group has found | |
4137 | * an imbalance but busiest->nr_running <= 1, the group is | |
43010659 | 4138 | * still unbalanced. ld_moved simply stays zero, so it is |
1da177e4 LT |
4139 | * correctly treated as an imbalance. |
4140 | */ | |
fe2eea3f | 4141 | local_irq_save(flags); |
e17224bf | 4142 | double_rq_lock(this_rq, busiest); |
43010659 | 4143 | ld_moved = move_tasks(this_rq, this_cpu, busiest, |
48f24c4d | 4144 | imbalance, sd, idle, &all_pinned); |
e17224bf | 4145 | double_rq_unlock(this_rq, busiest); |
fe2eea3f | 4146 | local_irq_restore(flags); |
81026794 | 4147 | |
46cb4b7c SS |
4148 | /* |
4149 | * some other cpu did the load balance for us. | |
4150 | */ | |
43010659 | 4151 | if (ld_moved && this_cpu != smp_processor_id()) |
46cb4b7c SS |
4152 | resched_cpu(this_cpu); |
4153 | ||
81026794 | 4154 | /* All tasks on this runqueue were pinned by CPU affinity */ |
0a2966b4 | 4155 | if (unlikely(all_pinned)) { |
96f874e2 RR |
4156 | cpumask_clear_cpu(cpu_of(busiest), cpus); |
4157 | if (!cpumask_empty(cpus)) | |
0a2966b4 | 4158 | goto redo; |
81026794 | 4159 | goto out_balanced; |
0a2966b4 | 4160 | } |
1da177e4 | 4161 | } |
81026794 | 4162 | |
43010659 | 4163 | if (!ld_moved) { |
1da177e4 LT |
4164 | schedstat_inc(sd, lb_failed[idle]); |
4165 | sd->nr_balance_failed++; | |
4166 | ||
4167 | if (unlikely(sd->nr_balance_failed > sd->cache_nice_tries+2)) { | |
1da177e4 | 4168 | |
fe2eea3f | 4169 | spin_lock_irqsave(&busiest->lock, flags); |
fa3b6ddc SS |
4170 | |
4171 | /* don't kick the migration_thread, if the curr | |
4172 | * task on busiest cpu can't be moved to this_cpu | |
4173 | */ | |
96f874e2 RR |
4174 | if (!cpumask_test_cpu(this_cpu, |
4175 | &busiest->curr->cpus_allowed)) { | |
fe2eea3f | 4176 | spin_unlock_irqrestore(&busiest->lock, flags); |
fa3b6ddc SS |
4177 | all_pinned = 1; |
4178 | goto out_one_pinned; | |
4179 | } | |
4180 | ||
1da177e4 LT |
4181 | if (!busiest->active_balance) { |
4182 | busiest->active_balance = 1; | |
4183 | busiest->push_cpu = this_cpu; | |
81026794 | 4184 | active_balance = 1; |
1da177e4 | 4185 | } |
fe2eea3f | 4186 | spin_unlock_irqrestore(&busiest->lock, flags); |
81026794 | 4187 | if (active_balance) |
1da177e4 LT |
4188 | wake_up_process(busiest->migration_thread); |
4189 | ||
4190 | /* | |
4191 | * We've kicked active balancing, reset the failure | |
4192 | * counter. | |
4193 | */ | |
39507451 | 4194 | sd->nr_balance_failed = sd->cache_nice_tries+1; |
1da177e4 | 4195 | } |
81026794 | 4196 | } else |
1da177e4 LT |
4197 | sd->nr_balance_failed = 0; |
4198 | ||
81026794 | 4199 | if (likely(!active_balance)) { |
1da177e4 LT |
4200 | /* We were unbalanced, so reset the balancing interval */ |
4201 | sd->balance_interval = sd->min_interval; | |
81026794 NP |
4202 | } else { |
4203 | /* | |
4204 | * If we've begun active balancing, start to back off. This | |
4205 | * case may not be covered by the all_pinned logic if there | |
4206 | * is only 1 task on the busy runqueue (because we don't call | |
4207 | * move_tasks). | |
4208 | */ | |
4209 | if (sd->balance_interval < sd->max_interval) | |
4210 | sd->balance_interval *= 2; | |
1da177e4 LT |
4211 | } |
4212 | ||
43010659 | 4213 | if (!ld_moved && !sd_idle && sd->flags & SD_SHARE_CPUPOWER && |
89c4710e | 4214 | !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE)) |
c09595f6 PZ |
4215 | ld_moved = -1; |
4216 | ||
4217 | goto out; | |
1da177e4 LT |
4218 | |
4219 | out_balanced: | |
1da177e4 LT |
4220 | schedstat_inc(sd, lb_balanced[idle]); |
4221 | ||
16cfb1c0 | 4222 | sd->nr_balance_failed = 0; |
fa3b6ddc SS |
4223 | |
4224 | out_one_pinned: | |
1da177e4 | 4225 | /* tune up the balancing interval */ |
77391d71 NP |
4226 | if ((all_pinned && sd->balance_interval < MAX_PINNED_INTERVAL) || |
4227 | (sd->balance_interval < sd->max_interval)) | |
1da177e4 LT |
4228 | sd->balance_interval *= 2; |
4229 | ||
48f24c4d | 4230 | if (!sd_idle && sd->flags & SD_SHARE_CPUPOWER && |
89c4710e | 4231 | !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE)) |
c09595f6 PZ |
4232 | ld_moved = -1; |
4233 | else | |
4234 | ld_moved = 0; | |
4235 | out: | |
c8cba857 PZ |
4236 | if (ld_moved) |
4237 | update_shares(sd); | |
c09595f6 | 4238 | return ld_moved; |
1da177e4 LT |
4239 | } |
4240 | ||
4241 | /* | |
4242 | * Check this_cpu to ensure it is balanced within domain. Attempt to move | |
4243 | * tasks if there is an imbalance. | |
4244 | * | |
d15bcfdb | 4245 | * Called from schedule when this_rq is about to become idle (CPU_NEWLY_IDLE). |
1da177e4 LT |
4246 | * this_rq is locked. |
4247 | */ | |
48f24c4d | 4248 | static int |
df7c8e84 | 4249 | load_balance_newidle(int this_cpu, struct rq *this_rq, struct sched_domain *sd) |
1da177e4 LT |
4250 | { |
4251 | struct sched_group *group; | |
70b97a7f | 4252 | struct rq *busiest = NULL; |
1da177e4 | 4253 | unsigned long imbalance; |
43010659 | 4254 | int ld_moved = 0; |
5969fe06 | 4255 | int sd_idle = 0; |
969bb4e4 | 4256 | int all_pinned = 0; |
df7c8e84 | 4257 | struct cpumask *cpus = __get_cpu_var(load_balance_tmpmask); |
7c16ec58 | 4258 | |
96f874e2 | 4259 | cpumask_setall(cpus); |
5969fe06 | 4260 | |
89c4710e SS |
4261 | /* |
4262 | * When power savings policy is enabled for the parent domain, idle | |
4263 | * sibling can pick up load irrespective of busy siblings. In this case, | |
4264 | * let the state of idle sibling percolate up as IDLE, instead of | |
d15bcfdb | 4265 | * portraying it as CPU_NOT_IDLE. |
89c4710e SS |
4266 | */ |
4267 | if (sd->flags & SD_SHARE_CPUPOWER && | |
4268 | !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE)) | |
5969fe06 | 4269 | sd_idle = 1; |
1da177e4 | 4270 | |
2d72376b | 4271 | schedstat_inc(sd, lb_count[CPU_NEWLY_IDLE]); |
0a2966b4 | 4272 | redo: |
3e5459b4 | 4273 | update_shares_locked(this_rq, sd); |
d15bcfdb | 4274 | group = find_busiest_group(sd, this_cpu, &imbalance, CPU_NEWLY_IDLE, |
7c16ec58 | 4275 | &sd_idle, cpus, NULL); |
1da177e4 | 4276 | if (!group) { |
d15bcfdb | 4277 | schedstat_inc(sd, lb_nobusyg[CPU_NEWLY_IDLE]); |
16cfb1c0 | 4278 | goto out_balanced; |
1da177e4 LT |
4279 | } |
4280 | ||
7c16ec58 | 4281 | busiest = find_busiest_queue(group, CPU_NEWLY_IDLE, imbalance, cpus); |
db935dbd | 4282 | if (!busiest) { |
d15bcfdb | 4283 | schedstat_inc(sd, lb_nobusyq[CPU_NEWLY_IDLE]); |
16cfb1c0 | 4284 | goto out_balanced; |
1da177e4 LT |
4285 | } |
4286 | ||
db935dbd NP |
4287 | BUG_ON(busiest == this_rq); |
4288 | ||
d15bcfdb | 4289 | schedstat_add(sd, lb_imbalance[CPU_NEWLY_IDLE], imbalance); |
d6d5cfaf | 4290 | |
43010659 | 4291 | ld_moved = 0; |
d6d5cfaf NP |
4292 | if (busiest->nr_running > 1) { |
4293 | /* Attempt to move tasks */ | |
4294 | double_lock_balance(this_rq, busiest); | |
6e82a3be IM |
4295 | /* this_rq->clock is already updated */ |
4296 | update_rq_clock(busiest); | |
43010659 | 4297 | ld_moved = move_tasks(this_rq, this_cpu, busiest, |
969bb4e4 SS |
4298 | imbalance, sd, CPU_NEWLY_IDLE, |
4299 | &all_pinned); | |
1b12bbc7 | 4300 | double_unlock_balance(this_rq, busiest); |
0a2966b4 | 4301 | |
969bb4e4 | 4302 | if (unlikely(all_pinned)) { |
96f874e2 RR |
4303 | cpumask_clear_cpu(cpu_of(busiest), cpus); |
4304 | if (!cpumask_empty(cpus)) | |
0a2966b4 CL |
4305 | goto redo; |
4306 | } | |
d6d5cfaf NP |
4307 | } |
4308 | ||
43010659 | 4309 | if (!ld_moved) { |
36dffab6 | 4310 | int active_balance = 0; |
ad273b32 | 4311 | |
d15bcfdb | 4312 | schedstat_inc(sd, lb_failed[CPU_NEWLY_IDLE]); |
89c4710e SS |
4313 | if (!sd_idle && sd->flags & SD_SHARE_CPUPOWER && |
4314 | !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE)) | |
5969fe06 | 4315 | return -1; |
ad273b32 VS |
4316 | |
4317 | if (sched_mc_power_savings < POWERSAVINGS_BALANCE_WAKEUP) | |
4318 | return -1; | |
4319 | ||
4320 | if (sd->nr_balance_failed++ < 2) | |
4321 | return -1; | |
4322 | ||
4323 | /* | |
4324 | * The only task running in a non-idle cpu can be moved to this | |
4325 | * cpu in an attempt to completely freeup the other CPU | |
4326 | * package. The same method used to move task in load_balance() | |
4327 | * have been extended for load_balance_newidle() to speedup | |
4328 | * consolidation at sched_mc=POWERSAVINGS_BALANCE_WAKEUP (2) | |
4329 | * | |
4330 | * The package power saving logic comes from | |
4331 | * find_busiest_group(). If there are no imbalance, then | |
4332 | * f_b_g() will return NULL. However when sched_mc={1,2} then | |
4333 | * f_b_g() will select a group from which a running task may be | |
4334 | * pulled to this cpu in order to make the other package idle. | |
4335 | * If there is no opportunity to make a package idle and if | |
4336 | * there are no imbalance, then f_b_g() will return NULL and no | |
4337 | * action will be taken in load_balance_newidle(). | |
4338 | * | |
4339 | * Under normal task pull operation due to imbalance, there | |
4340 | * will be more than one task in the source run queue and | |
4341 | * move_tasks() will succeed. ld_moved will be true and this | |
4342 | * active balance code will not be triggered. | |
4343 | */ | |
4344 | ||
4345 | /* Lock busiest in correct order while this_rq is held */ | |
4346 | double_lock_balance(this_rq, busiest); | |
4347 | ||
4348 | /* | |
4349 | * don't kick the migration_thread, if the curr | |
4350 | * task on busiest cpu can't be moved to this_cpu | |
4351 | */ | |
6ca09dfc | 4352 | if (!cpumask_test_cpu(this_cpu, &busiest->curr->cpus_allowed)) { |
ad273b32 VS |
4353 | double_unlock_balance(this_rq, busiest); |
4354 | all_pinned = 1; | |
4355 | return ld_moved; | |
4356 | } | |
4357 | ||
4358 | if (!busiest->active_balance) { | |
4359 | busiest->active_balance = 1; | |
4360 | busiest->push_cpu = this_cpu; | |
4361 | active_balance = 1; | |
4362 | } | |
4363 | ||
4364 | double_unlock_balance(this_rq, busiest); | |
da8d5089 PZ |
4365 | /* |
4366 | * Should not call ttwu while holding a rq->lock | |
4367 | */ | |
4368 | spin_unlock(&this_rq->lock); | |
ad273b32 VS |
4369 | if (active_balance) |
4370 | wake_up_process(busiest->migration_thread); | |
da8d5089 | 4371 | spin_lock(&this_rq->lock); |
ad273b32 | 4372 | |
5969fe06 | 4373 | } else |
16cfb1c0 | 4374 | sd->nr_balance_failed = 0; |
1da177e4 | 4375 | |
3e5459b4 | 4376 | update_shares_locked(this_rq, sd); |
43010659 | 4377 | return ld_moved; |
16cfb1c0 NP |
4378 | |
4379 | out_balanced: | |
d15bcfdb | 4380 | schedstat_inc(sd, lb_balanced[CPU_NEWLY_IDLE]); |
48f24c4d | 4381 | if (!sd_idle && sd->flags & SD_SHARE_CPUPOWER && |
89c4710e | 4382 | !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE)) |
5969fe06 | 4383 | return -1; |
16cfb1c0 | 4384 | sd->nr_balance_failed = 0; |
48f24c4d | 4385 | |
16cfb1c0 | 4386 | return 0; |
1da177e4 LT |
4387 | } |
4388 | ||
4389 | /* | |
4390 | * idle_balance is called by schedule() if this_cpu is about to become | |
4391 | * idle. Attempts to pull tasks from other CPUs. | |
4392 | */ | |
70b97a7f | 4393 | static void idle_balance(int this_cpu, struct rq *this_rq) |
1da177e4 LT |
4394 | { |
4395 | struct sched_domain *sd; | |
efbe027e | 4396 | int pulled_task = 0; |
dd41f596 | 4397 | unsigned long next_balance = jiffies + HZ; |
1da177e4 LT |
4398 | |
4399 | for_each_domain(this_cpu, sd) { | |
92c4ca5c CL |
4400 | unsigned long interval; |
4401 | ||
4402 | if (!(sd->flags & SD_LOAD_BALANCE)) | |
4403 | continue; | |
4404 | ||
4405 | if (sd->flags & SD_BALANCE_NEWIDLE) | |
48f24c4d | 4406 | /* If we've pulled tasks over stop searching: */ |
7c16ec58 | 4407 | pulled_task = load_balance_newidle(this_cpu, this_rq, |
df7c8e84 | 4408 | sd); |
92c4ca5c CL |
4409 | |
4410 | interval = msecs_to_jiffies(sd->balance_interval); | |
4411 | if (time_after(next_balance, sd->last_balance + interval)) | |
4412 | next_balance = sd->last_balance + interval; | |
4413 | if (pulled_task) | |
4414 | break; | |
1da177e4 | 4415 | } |
dd41f596 | 4416 | if (pulled_task || time_after(jiffies, this_rq->next_balance)) { |
1bd77f2d CL |
4417 | /* |
4418 | * We are going idle. next_balance may be set based on | |
4419 | * a busy processor. So reset next_balance. | |
4420 | */ | |
4421 | this_rq->next_balance = next_balance; | |
dd41f596 | 4422 | } |
1da177e4 LT |
4423 | } |
4424 | ||
4425 | /* | |
4426 | * active_load_balance is run by migration threads. It pushes running tasks | |
4427 | * off the busiest CPU onto idle CPUs. It requires at least 1 task to be | |
4428 | * running on each physical CPU where possible, and avoids physical / | |
4429 | * logical imbalances. | |
4430 | * | |
4431 | * Called with busiest_rq locked. | |
4432 | */ | |
70b97a7f | 4433 | static void active_load_balance(struct rq *busiest_rq, int busiest_cpu) |
1da177e4 | 4434 | { |
39507451 | 4435 | int target_cpu = busiest_rq->push_cpu; |
70b97a7f IM |
4436 | struct sched_domain *sd; |
4437 | struct rq *target_rq; | |
39507451 | 4438 | |
48f24c4d | 4439 | /* Is there any task to move? */ |
39507451 | 4440 | if (busiest_rq->nr_running <= 1) |
39507451 NP |
4441 | return; |
4442 | ||
4443 | target_rq = cpu_rq(target_cpu); | |
1da177e4 LT |
4444 | |
4445 | /* | |
39507451 | 4446 | * This condition is "impossible", if it occurs |
41a2d6cf | 4447 | * we need to fix it. Originally reported by |
39507451 | 4448 | * Bjorn Helgaas on a 128-cpu setup. |
1da177e4 | 4449 | */ |
39507451 | 4450 | BUG_ON(busiest_rq == target_rq); |
1da177e4 | 4451 | |
39507451 NP |
4452 | /* move a task from busiest_rq to target_rq */ |
4453 | double_lock_balance(busiest_rq, target_rq); | |
6e82a3be IM |
4454 | update_rq_clock(busiest_rq); |
4455 | update_rq_clock(target_rq); | |
39507451 NP |
4456 | |
4457 | /* Search for an sd spanning us and the target CPU. */ | |
c96d145e | 4458 | for_each_domain(target_cpu, sd) { |
39507451 | 4459 | if ((sd->flags & SD_LOAD_BALANCE) && |
758b2cdc | 4460 | cpumask_test_cpu(busiest_cpu, sched_domain_span(sd))) |
39507451 | 4461 | break; |
c96d145e | 4462 | } |
39507451 | 4463 | |
48f24c4d | 4464 | if (likely(sd)) { |
2d72376b | 4465 | schedstat_inc(sd, alb_count); |
39507451 | 4466 | |
43010659 PW |
4467 | if (move_one_task(target_rq, target_cpu, busiest_rq, |
4468 | sd, CPU_IDLE)) | |
48f24c4d IM |
4469 | schedstat_inc(sd, alb_pushed); |
4470 | else | |
4471 | schedstat_inc(sd, alb_failed); | |
4472 | } | |
1b12bbc7 | 4473 | double_unlock_balance(busiest_rq, target_rq); |
1da177e4 LT |
4474 | } |
4475 | ||
46cb4b7c SS |
4476 | #ifdef CONFIG_NO_HZ |
4477 | static struct { | |
4478 | atomic_t load_balancer; | |
7d1e6a9b | 4479 | cpumask_var_t cpu_mask; |
f711f609 | 4480 | cpumask_var_t ilb_grp_nohz_mask; |
46cb4b7c SS |
4481 | } nohz ____cacheline_aligned = { |
4482 | .load_balancer = ATOMIC_INIT(-1), | |
46cb4b7c SS |
4483 | }; |
4484 | ||
eea08f32 AB |
4485 | int get_nohz_load_balancer(void) |
4486 | { | |
4487 | return atomic_read(&nohz.load_balancer); | |
4488 | } | |
4489 | ||
f711f609 GS |
4490 | #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT) |
4491 | /** | |
4492 | * lowest_flag_domain - Return lowest sched_domain containing flag. | |
4493 | * @cpu: The cpu whose lowest level of sched domain is to | |
4494 | * be returned. | |
4495 | * @flag: The flag to check for the lowest sched_domain | |
4496 | * for the given cpu. | |
4497 | * | |
4498 | * Returns the lowest sched_domain of a cpu which contains the given flag. | |
4499 | */ | |
4500 | static inline struct sched_domain *lowest_flag_domain(int cpu, int flag) | |
4501 | { | |
4502 | struct sched_domain *sd; | |
4503 | ||
4504 | for_each_domain(cpu, sd) | |
4505 | if (sd && (sd->flags & flag)) | |
4506 | break; | |
4507 | ||
4508 | return sd; | |
4509 | } | |
4510 | ||
4511 | /** | |
4512 | * for_each_flag_domain - Iterates over sched_domains containing the flag. | |
4513 | * @cpu: The cpu whose domains we're iterating over. | |
4514 | * @sd: variable holding the value of the power_savings_sd | |
4515 | * for cpu. | |
4516 | * @flag: The flag to filter the sched_domains to be iterated. | |
4517 | * | |
4518 | * Iterates over all the scheduler domains for a given cpu that has the 'flag' | |
4519 | * set, starting from the lowest sched_domain to the highest. | |
4520 | */ | |
4521 | #define for_each_flag_domain(cpu, sd, flag) \ | |
4522 | for (sd = lowest_flag_domain(cpu, flag); \ | |
4523 | (sd && (sd->flags & flag)); sd = sd->parent) | |
4524 | ||
4525 | /** | |
4526 | * is_semi_idle_group - Checks if the given sched_group is semi-idle. | |
4527 | * @ilb_group: group to be checked for semi-idleness | |
4528 | * | |
4529 | * Returns: 1 if the group is semi-idle. 0 otherwise. | |
4530 | * | |
4531 | * We define a sched_group to be semi idle if it has atleast one idle-CPU | |
4532 | * and atleast one non-idle CPU. This helper function checks if the given | |
4533 | * sched_group is semi-idle or not. | |
4534 | */ | |
4535 | static inline int is_semi_idle_group(struct sched_group *ilb_group) | |
4536 | { | |
4537 | cpumask_and(nohz.ilb_grp_nohz_mask, nohz.cpu_mask, | |
4538 | sched_group_cpus(ilb_group)); | |
4539 | ||
4540 | /* | |
4541 | * A sched_group is semi-idle when it has atleast one busy cpu | |
4542 | * and atleast one idle cpu. | |
4543 | */ | |
4544 | if (cpumask_empty(nohz.ilb_grp_nohz_mask)) | |
4545 | return 0; | |
4546 | ||
4547 | if (cpumask_equal(nohz.ilb_grp_nohz_mask, sched_group_cpus(ilb_group))) | |
4548 | return 0; | |
4549 | ||
4550 | return 1; | |
4551 | } | |
4552 | /** | |
4553 | * find_new_ilb - Finds the optimum idle load balancer for nomination. | |
4554 | * @cpu: The cpu which is nominating a new idle_load_balancer. | |
4555 | * | |
4556 | * Returns: Returns the id of the idle load balancer if it exists, | |
4557 | * Else, returns >= nr_cpu_ids. | |
4558 | * | |
4559 | * This algorithm picks the idle load balancer such that it belongs to a | |
4560 | * semi-idle powersavings sched_domain. The idea is to try and avoid | |
4561 | * completely idle packages/cores just for the purpose of idle load balancing | |
4562 | * when there are other idle cpu's which are better suited for that job. | |
4563 | */ | |
4564 | static int find_new_ilb(int cpu) | |
4565 | { | |
4566 | struct sched_domain *sd; | |
4567 | struct sched_group *ilb_group; | |
4568 | ||
4569 | /* | |
4570 | * Have idle load balancer selection from semi-idle packages only | |
4571 | * when power-aware load balancing is enabled | |
4572 | */ | |
4573 | if (!(sched_smt_power_savings || sched_mc_power_savings)) | |
4574 | goto out_done; | |
4575 | ||
4576 | /* | |
4577 | * Optimize for the case when we have no idle CPUs or only one | |
4578 | * idle CPU. Don't walk the sched_domain hierarchy in such cases | |
4579 | */ | |
4580 | if (cpumask_weight(nohz.cpu_mask) < 2) | |
4581 | goto out_done; | |
4582 | ||
4583 | for_each_flag_domain(cpu, sd, SD_POWERSAVINGS_BALANCE) { | |
4584 | ilb_group = sd->groups; | |
4585 | ||
4586 | do { | |
4587 | if (is_semi_idle_group(ilb_group)) | |
4588 | return cpumask_first(nohz.ilb_grp_nohz_mask); | |
4589 | ||
4590 | ilb_group = ilb_group->next; | |
4591 | ||
4592 | } while (ilb_group != sd->groups); | |
4593 | } | |
4594 | ||
4595 | out_done: | |
4596 | return cpumask_first(nohz.cpu_mask); | |
4597 | } | |
4598 | #else /* (CONFIG_SCHED_MC || CONFIG_SCHED_SMT) */ | |
4599 | static inline int find_new_ilb(int call_cpu) | |
4600 | { | |
6e29ec57 | 4601 | return cpumask_first(nohz.cpu_mask); |
f711f609 GS |
4602 | } |
4603 | #endif | |
4604 | ||
7835b98b | 4605 | /* |
46cb4b7c SS |
4606 | * This routine will try to nominate the ilb (idle load balancing) |
4607 | * owner among the cpus whose ticks are stopped. ilb owner will do the idle | |
4608 | * load balancing on behalf of all those cpus. If all the cpus in the system | |
4609 | * go into this tickless mode, then there will be no ilb owner (as there is | |
4610 | * no need for one) and all the cpus will sleep till the next wakeup event | |
4611 | * arrives... | |
4612 | * | |
4613 | * For the ilb owner, tick is not stopped. And this tick will be used | |
4614 | * for idle load balancing. ilb owner will still be part of | |
4615 | * nohz.cpu_mask.. | |
7835b98b | 4616 | * |
46cb4b7c SS |
4617 | * While stopping the tick, this cpu will become the ilb owner if there |
4618 | * is no other owner. And will be the owner till that cpu becomes busy | |
4619 | * or if all cpus in the system stop their ticks at which point | |
4620 | * there is no need for ilb owner. | |
4621 | * | |
4622 | * When the ilb owner becomes busy, it nominates another owner, during the | |
4623 | * next busy scheduler_tick() | |
4624 | */ | |
4625 | int select_nohz_load_balancer(int stop_tick) | |
4626 | { | |
4627 | int cpu = smp_processor_id(); | |
4628 | ||
4629 | if (stop_tick) { | |
46cb4b7c SS |
4630 | cpu_rq(cpu)->in_nohz_recently = 1; |
4631 | ||
483b4ee6 SS |
4632 | if (!cpu_active(cpu)) { |
4633 | if (atomic_read(&nohz.load_balancer) != cpu) | |
4634 | return 0; | |
4635 | ||
4636 | /* | |
4637 | * If we are going offline and still the leader, | |
4638 | * give up! | |
4639 | */ | |
46cb4b7c SS |
4640 | if (atomic_cmpxchg(&nohz.load_balancer, cpu, -1) != cpu) |
4641 | BUG(); | |
483b4ee6 | 4642 | |
46cb4b7c SS |
4643 | return 0; |
4644 | } | |
4645 | ||
483b4ee6 SS |
4646 | cpumask_set_cpu(cpu, nohz.cpu_mask); |
4647 | ||
46cb4b7c | 4648 | /* time for ilb owner also to sleep */ |
7d1e6a9b | 4649 | if (cpumask_weight(nohz.cpu_mask) == num_online_cpus()) { |
46cb4b7c SS |
4650 | if (atomic_read(&nohz.load_balancer) == cpu) |
4651 | atomic_set(&nohz.load_balancer, -1); | |
4652 | return 0; | |
4653 | } | |
4654 | ||
4655 | if (atomic_read(&nohz.load_balancer) == -1) { | |
4656 | /* make me the ilb owner */ | |
4657 | if (atomic_cmpxchg(&nohz.load_balancer, -1, cpu) == -1) | |
4658 | return 1; | |
e790fb0b GS |
4659 | } else if (atomic_read(&nohz.load_balancer) == cpu) { |
4660 | int new_ilb; | |
4661 | ||
4662 | if (!(sched_smt_power_savings || | |
4663 | sched_mc_power_savings)) | |
4664 | return 1; | |
4665 | /* | |
4666 | * Check to see if there is a more power-efficient | |
4667 | * ilb. | |
4668 | */ | |
4669 | new_ilb = find_new_ilb(cpu); | |
4670 | if (new_ilb < nr_cpu_ids && new_ilb != cpu) { | |
4671 | atomic_set(&nohz.load_balancer, -1); | |
4672 | resched_cpu(new_ilb); | |
4673 | return 0; | |
4674 | } | |
46cb4b7c | 4675 | return 1; |
e790fb0b | 4676 | } |
46cb4b7c | 4677 | } else { |
7d1e6a9b | 4678 | if (!cpumask_test_cpu(cpu, nohz.cpu_mask)) |
46cb4b7c SS |
4679 | return 0; |
4680 | ||
7d1e6a9b | 4681 | cpumask_clear_cpu(cpu, nohz.cpu_mask); |
46cb4b7c SS |
4682 | |
4683 | if (atomic_read(&nohz.load_balancer) == cpu) | |
4684 | if (atomic_cmpxchg(&nohz.load_balancer, cpu, -1) != cpu) | |
4685 | BUG(); | |
4686 | } | |
4687 | return 0; | |
4688 | } | |
4689 | #endif | |
4690 | ||
4691 | static DEFINE_SPINLOCK(balancing); | |
4692 | ||
4693 | /* | |
7835b98b CL |
4694 | * It checks each scheduling domain to see if it is due to be balanced, |
4695 | * and initiates a balancing operation if so. | |
4696 | * | |
4697 | * Balancing parameters are set up in arch_init_sched_domains. | |
4698 | */ | |
a9957449 | 4699 | static void rebalance_domains(int cpu, enum cpu_idle_type idle) |
7835b98b | 4700 | { |
46cb4b7c SS |
4701 | int balance = 1; |
4702 | struct rq *rq = cpu_rq(cpu); | |
7835b98b CL |
4703 | unsigned long interval; |
4704 | struct sched_domain *sd; | |
46cb4b7c | 4705 | /* Earliest time when we have to do rebalance again */ |
c9819f45 | 4706 | unsigned long next_balance = jiffies + 60*HZ; |
f549da84 | 4707 | int update_next_balance = 0; |
d07355f5 | 4708 | int need_serialize; |
1da177e4 | 4709 | |
46cb4b7c | 4710 | for_each_domain(cpu, sd) { |
1da177e4 LT |
4711 | if (!(sd->flags & SD_LOAD_BALANCE)) |
4712 | continue; | |
4713 | ||
4714 | interval = sd->balance_interval; | |
d15bcfdb | 4715 | if (idle != CPU_IDLE) |
1da177e4 LT |
4716 | interval *= sd->busy_factor; |
4717 | ||
4718 | /* scale ms to jiffies */ | |
4719 | interval = msecs_to_jiffies(interval); | |
4720 | if (unlikely(!interval)) | |
4721 | interval = 1; | |
dd41f596 IM |
4722 | if (interval > HZ*NR_CPUS/10) |
4723 | interval = HZ*NR_CPUS/10; | |
4724 | ||
d07355f5 | 4725 | need_serialize = sd->flags & SD_SERIALIZE; |
1da177e4 | 4726 | |
d07355f5 | 4727 | if (need_serialize) { |
08c183f3 CL |
4728 | if (!spin_trylock(&balancing)) |
4729 | goto out; | |
4730 | } | |
4731 | ||
c9819f45 | 4732 | if (time_after_eq(jiffies, sd->last_balance + interval)) { |
df7c8e84 | 4733 | if (load_balance(cpu, rq, sd, idle, &balance)) { |
fa3b6ddc SS |
4734 | /* |
4735 | * We've pulled tasks over so either we're no | |
5969fe06 NP |
4736 | * longer idle, or one of our SMT siblings is |
4737 | * not idle. | |
4738 | */ | |
d15bcfdb | 4739 | idle = CPU_NOT_IDLE; |
1da177e4 | 4740 | } |
1bd77f2d | 4741 | sd->last_balance = jiffies; |
1da177e4 | 4742 | } |
d07355f5 | 4743 | if (need_serialize) |
08c183f3 CL |
4744 | spin_unlock(&balancing); |
4745 | out: | |
f549da84 | 4746 | if (time_after(next_balance, sd->last_balance + interval)) { |
c9819f45 | 4747 | next_balance = sd->last_balance + interval; |
f549da84 SS |
4748 | update_next_balance = 1; |
4749 | } | |
783609c6 SS |
4750 | |
4751 | /* | |
4752 | * Stop the load balance at this level. There is another | |
4753 | * CPU in our sched group which is doing load balancing more | |
4754 | * actively. | |
4755 | */ | |
4756 | if (!balance) | |
4757 | break; | |
1da177e4 | 4758 | } |
f549da84 SS |
4759 | |
4760 | /* | |
4761 | * next_balance will be updated only when there is a need. | |
4762 | * When the cpu is attached to null domain for ex, it will not be | |
4763 | * updated. | |
4764 | */ | |
4765 | if (likely(update_next_balance)) | |
4766 | rq->next_balance = next_balance; | |
46cb4b7c SS |
4767 | } |
4768 | ||
4769 | /* | |
4770 | * run_rebalance_domains is triggered when needed from the scheduler tick. | |
4771 | * In CONFIG_NO_HZ case, the idle load balance owner will do the | |
4772 | * rebalancing for all the cpus for whom scheduler ticks are stopped. | |
4773 | */ | |
4774 | static void run_rebalance_domains(struct softirq_action *h) | |
4775 | { | |
dd41f596 IM |
4776 | int this_cpu = smp_processor_id(); |
4777 | struct rq *this_rq = cpu_rq(this_cpu); | |
4778 | enum cpu_idle_type idle = this_rq->idle_at_tick ? | |
4779 | CPU_IDLE : CPU_NOT_IDLE; | |
46cb4b7c | 4780 | |
dd41f596 | 4781 | rebalance_domains(this_cpu, idle); |
46cb4b7c SS |
4782 | |
4783 | #ifdef CONFIG_NO_HZ | |
4784 | /* | |
4785 | * If this cpu is the owner for idle load balancing, then do the | |
4786 | * balancing on behalf of the other idle cpus whose ticks are | |
4787 | * stopped. | |
4788 | */ | |
dd41f596 IM |
4789 | if (this_rq->idle_at_tick && |
4790 | atomic_read(&nohz.load_balancer) == this_cpu) { | |
46cb4b7c SS |
4791 | struct rq *rq; |
4792 | int balance_cpu; | |
4793 | ||
7d1e6a9b RR |
4794 | for_each_cpu(balance_cpu, nohz.cpu_mask) { |
4795 | if (balance_cpu == this_cpu) | |
4796 | continue; | |
4797 | ||
46cb4b7c SS |
4798 | /* |
4799 | * If this cpu gets work to do, stop the load balancing | |
4800 | * work being done for other cpus. Next load | |
4801 | * balancing owner will pick it up. | |
4802 | */ | |
4803 | if (need_resched()) | |
4804 | break; | |
4805 | ||
de0cf899 | 4806 | rebalance_domains(balance_cpu, CPU_IDLE); |
46cb4b7c SS |
4807 | |
4808 | rq = cpu_rq(balance_cpu); | |
dd41f596 IM |
4809 | if (time_after(this_rq->next_balance, rq->next_balance)) |
4810 | this_rq->next_balance = rq->next_balance; | |
46cb4b7c SS |
4811 | } |
4812 | } | |
4813 | #endif | |
4814 | } | |
4815 | ||
8a0be9ef FW |
4816 | static inline int on_null_domain(int cpu) |
4817 | { | |
4818 | return !rcu_dereference(cpu_rq(cpu)->sd); | |
4819 | } | |
4820 | ||
46cb4b7c SS |
4821 | /* |
4822 | * Trigger the SCHED_SOFTIRQ if it is time to do periodic load balancing. | |
4823 | * | |
4824 | * In case of CONFIG_NO_HZ, this is the place where we nominate a new | |
4825 | * idle load balancing owner or decide to stop the periodic load balancing, | |
4826 | * if the whole system is idle. | |
4827 | */ | |
dd41f596 | 4828 | static inline void trigger_load_balance(struct rq *rq, int cpu) |
46cb4b7c | 4829 | { |
46cb4b7c SS |
4830 | #ifdef CONFIG_NO_HZ |
4831 | /* | |
4832 | * If we were in the nohz mode recently and busy at the current | |
4833 | * scheduler tick, then check if we need to nominate new idle | |
4834 | * load balancer. | |
4835 | */ | |
4836 | if (rq->in_nohz_recently && !rq->idle_at_tick) { | |
4837 | rq->in_nohz_recently = 0; | |
4838 | ||
4839 | if (atomic_read(&nohz.load_balancer) == cpu) { | |
7d1e6a9b | 4840 | cpumask_clear_cpu(cpu, nohz.cpu_mask); |
46cb4b7c SS |
4841 | atomic_set(&nohz.load_balancer, -1); |
4842 | } | |
4843 | ||
4844 | if (atomic_read(&nohz.load_balancer) == -1) { | |
f711f609 | 4845 | int ilb = find_new_ilb(cpu); |
46cb4b7c | 4846 | |
434d53b0 | 4847 | if (ilb < nr_cpu_ids) |
46cb4b7c SS |
4848 | resched_cpu(ilb); |
4849 | } | |
4850 | } | |
4851 | ||
4852 | /* | |
4853 | * If this cpu is idle and doing idle load balancing for all the | |
4854 | * cpus with ticks stopped, is it time for that to stop? | |
4855 | */ | |
4856 | if (rq->idle_at_tick && atomic_read(&nohz.load_balancer) == cpu && | |
7d1e6a9b | 4857 | cpumask_weight(nohz.cpu_mask) == num_online_cpus()) { |
46cb4b7c SS |
4858 | resched_cpu(cpu); |
4859 | return; | |
4860 | } | |
4861 | ||
4862 | /* | |
4863 | * If this cpu is idle and the idle load balancing is done by | |
4864 | * someone else, then no need raise the SCHED_SOFTIRQ | |
4865 | */ | |
4866 | if (rq->idle_at_tick && atomic_read(&nohz.load_balancer) != cpu && | |
7d1e6a9b | 4867 | cpumask_test_cpu(cpu, nohz.cpu_mask)) |
46cb4b7c SS |
4868 | return; |
4869 | #endif | |
8a0be9ef FW |
4870 | /* Don't need to rebalance while attached to NULL domain */ |
4871 | if (time_after_eq(jiffies, rq->next_balance) && | |
4872 | likely(!on_null_domain(cpu))) | |
46cb4b7c | 4873 | raise_softirq(SCHED_SOFTIRQ); |
1da177e4 | 4874 | } |
dd41f596 IM |
4875 | |
4876 | #else /* CONFIG_SMP */ | |
4877 | ||
1da177e4 LT |
4878 | /* |
4879 | * on UP we do not need to balance between CPUs: | |
4880 | */ | |
70b97a7f | 4881 | static inline void idle_balance(int cpu, struct rq *rq) |
1da177e4 LT |
4882 | { |
4883 | } | |
dd41f596 | 4884 | |
1da177e4 LT |
4885 | #endif |
4886 | ||
1da177e4 LT |
4887 | DEFINE_PER_CPU(struct kernel_stat, kstat); |
4888 | ||
4889 | EXPORT_PER_CPU_SYMBOL(kstat); | |
4890 | ||
4891 | /* | |
c5f8d995 | 4892 | * Return any ns on the sched_clock that have not yet been accounted in |
f06febc9 | 4893 | * @p in case that task is currently running. |
c5f8d995 HS |
4894 | * |
4895 | * Called with task_rq_lock() held on @rq. | |
1da177e4 | 4896 | */ |
c5f8d995 HS |
4897 | static u64 do_task_delta_exec(struct task_struct *p, struct rq *rq) |
4898 | { | |
4899 | u64 ns = 0; | |
4900 | ||
4901 | if (task_current(rq, p)) { | |
4902 | update_rq_clock(rq); | |
4903 | ns = rq->clock - p->se.exec_start; | |
4904 | if ((s64)ns < 0) | |
4905 | ns = 0; | |
4906 | } | |
4907 | ||
4908 | return ns; | |
4909 | } | |
4910 | ||
bb34d92f | 4911 | unsigned long long task_delta_exec(struct task_struct *p) |
1da177e4 | 4912 | { |
1da177e4 | 4913 | unsigned long flags; |
41b86e9c | 4914 | struct rq *rq; |
bb34d92f | 4915 | u64 ns = 0; |
48f24c4d | 4916 | |
41b86e9c | 4917 | rq = task_rq_lock(p, &flags); |
c5f8d995 HS |
4918 | ns = do_task_delta_exec(p, rq); |
4919 | task_rq_unlock(rq, &flags); | |
1508487e | 4920 | |
c5f8d995 HS |
4921 | return ns; |
4922 | } | |
f06febc9 | 4923 | |
c5f8d995 HS |
4924 | /* |
4925 | * Return accounted runtime for the task. | |
4926 | * In case the task is currently running, return the runtime plus current's | |
4927 | * pending runtime that have not been accounted yet. | |
4928 | */ | |
4929 | unsigned long long task_sched_runtime(struct task_struct *p) | |
4930 | { | |
4931 | unsigned long flags; | |
4932 | struct rq *rq; | |
4933 | u64 ns = 0; | |
4934 | ||
4935 | rq = task_rq_lock(p, &flags); | |
4936 | ns = p->se.sum_exec_runtime + do_task_delta_exec(p, rq); | |
4937 | task_rq_unlock(rq, &flags); | |
4938 | ||
4939 | return ns; | |
4940 | } | |
48f24c4d | 4941 | |
c5f8d995 HS |
4942 | /* |
4943 | * Return sum_exec_runtime for the thread group. | |
4944 | * In case the task is currently running, return the sum plus current's | |
4945 | * pending runtime that have not been accounted yet. | |
4946 | * | |
4947 | * Note that the thread group might have other running tasks as well, | |
4948 | * so the return value not includes other pending runtime that other | |
4949 | * running tasks might have. | |
4950 | */ | |
4951 | unsigned long long thread_group_sched_runtime(struct task_struct *p) | |
4952 | { | |
4953 | struct task_cputime totals; | |
4954 | unsigned long flags; | |
4955 | struct rq *rq; | |
4956 | u64 ns; | |
4957 | ||
4958 | rq = task_rq_lock(p, &flags); | |
4959 | thread_group_cputime(p, &totals); | |
4960 | ns = totals.sum_exec_runtime + do_task_delta_exec(p, rq); | |
41b86e9c | 4961 | task_rq_unlock(rq, &flags); |
48f24c4d | 4962 | |
1da177e4 LT |
4963 | return ns; |
4964 | } | |
4965 | ||
1da177e4 LT |
4966 | /* |
4967 | * Account user cpu time to a process. | |
4968 | * @p: the process that the cpu time gets accounted to | |
1da177e4 | 4969 | * @cputime: the cpu time spent in user space since the last update |
457533a7 | 4970 | * @cputime_scaled: cputime scaled by cpu frequency |
1da177e4 | 4971 | */ |
457533a7 MS |
4972 | void account_user_time(struct task_struct *p, cputime_t cputime, |
4973 | cputime_t cputime_scaled) | |
1da177e4 LT |
4974 | { |
4975 | struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat; | |
4976 | cputime64_t tmp; | |
4977 | ||
457533a7 | 4978 | /* Add user time to process. */ |
1da177e4 | 4979 | p->utime = cputime_add(p->utime, cputime); |
457533a7 | 4980 | p->utimescaled = cputime_add(p->utimescaled, cputime_scaled); |
f06febc9 | 4981 | account_group_user_time(p, cputime); |
1da177e4 LT |
4982 | |
4983 | /* Add user time to cpustat. */ | |
4984 | tmp = cputime_to_cputime64(cputime); | |
4985 | if (TASK_NICE(p) > 0) | |
4986 | cpustat->nice = cputime64_add(cpustat->nice, tmp); | |
4987 | else | |
4988 | cpustat->user = cputime64_add(cpustat->user, tmp); | |
ef12fefa BR |
4989 | |
4990 | cpuacct_update_stats(p, CPUACCT_STAT_USER, cputime); | |
49b5cf34 JL |
4991 | /* Account for user time used */ |
4992 | acct_update_integrals(p); | |
1da177e4 LT |
4993 | } |
4994 | ||
94886b84 LV |
4995 | /* |
4996 | * Account guest cpu time to a process. | |
4997 | * @p: the process that the cpu time gets accounted to | |
4998 | * @cputime: the cpu time spent in virtual machine since the last update | |
457533a7 | 4999 | * @cputime_scaled: cputime scaled by cpu frequency |
94886b84 | 5000 | */ |
457533a7 MS |
5001 | static void account_guest_time(struct task_struct *p, cputime_t cputime, |
5002 | cputime_t cputime_scaled) | |
94886b84 LV |
5003 | { |
5004 | cputime64_t tmp; | |
5005 | struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat; | |
5006 | ||
5007 | tmp = cputime_to_cputime64(cputime); | |
5008 | ||
457533a7 | 5009 | /* Add guest time to process. */ |
94886b84 | 5010 | p->utime = cputime_add(p->utime, cputime); |
457533a7 | 5011 | p->utimescaled = cputime_add(p->utimescaled, cputime_scaled); |
f06febc9 | 5012 | account_group_user_time(p, cputime); |
94886b84 LV |
5013 | p->gtime = cputime_add(p->gtime, cputime); |
5014 | ||
457533a7 | 5015 | /* Add guest time to cpustat. */ |
94886b84 LV |
5016 | cpustat->user = cputime64_add(cpustat->user, tmp); |
5017 | cpustat->guest = cputime64_add(cpustat->guest, tmp); | |
5018 | } | |
5019 | ||
1da177e4 LT |
5020 | /* |
5021 | * Account system cpu time to a process. | |
5022 | * @p: the process that the cpu time gets accounted to | |
5023 | * @hardirq_offset: the offset to subtract from hardirq_count() | |
5024 | * @cputime: the cpu time spent in kernel space since the last update | |
457533a7 | 5025 | * @cputime_scaled: cputime scaled by cpu frequency |
1da177e4 LT |
5026 | */ |
5027 | void account_system_time(struct task_struct *p, int hardirq_offset, | |
457533a7 | 5028 | cputime_t cputime, cputime_t cputime_scaled) |
1da177e4 LT |
5029 | { |
5030 | struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat; | |
1da177e4 LT |
5031 | cputime64_t tmp; |
5032 | ||
983ed7a6 | 5033 | if ((p->flags & PF_VCPU) && (irq_count() - hardirq_offset == 0)) { |
457533a7 | 5034 | account_guest_time(p, cputime, cputime_scaled); |
983ed7a6 HH |
5035 | return; |
5036 | } | |
94886b84 | 5037 | |
457533a7 | 5038 | /* Add system time to process. */ |
1da177e4 | 5039 | p->stime = cputime_add(p->stime, cputime); |
457533a7 | 5040 | p->stimescaled = cputime_add(p->stimescaled, cputime_scaled); |
f06febc9 | 5041 | account_group_system_time(p, cputime); |
1da177e4 LT |
5042 | |
5043 | /* Add system time to cpustat. */ | |
5044 | tmp = cputime_to_cputime64(cputime); | |
5045 | if (hardirq_count() - hardirq_offset) | |
5046 | cpustat->irq = cputime64_add(cpustat->irq, tmp); | |
5047 | else if (softirq_count()) | |
5048 | cpustat->softirq = cputime64_add(cpustat->softirq, tmp); | |
1da177e4 | 5049 | else |
79741dd3 MS |
5050 | cpustat->system = cputime64_add(cpustat->system, tmp); |
5051 | ||
ef12fefa BR |
5052 | cpuacct_update_stats(p, CPUACCT_STAT_SYSTEM, cputime); |
5053 | ||
1da177e4 LT |
5054 | /* Account for system time used */ |
5055 | acct_update_integrals(p); | |
1da177e4 LT |
5056 | } |
5057 | ||
c66f08be | 5058 | /* |
1da177e4 | 5059 | * Account for involuntary wait time. |
1da177e4 | 5060 | * @steal: the cpu time spent in involuntary wait |
c66f08be | 5061 | */ |
79741dd3 | 5062 | void account_steal_time(cputime_t cputime) |
c66f08be | 5063 | { |
79741dd3 MS |
5064 | struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat; |
5065 | cputime64_t cputime64 = cputime_to_cputime64(cputime); | |
5066 | ||
5067 | cpustat->steal = cputime64_add(cpustat->steal, cputime64); | |
c66f08be MN |
5068 | } |
5069 | ||
1da177e4 | 5070 | /* |
79741dd3 MS |
5071 | * Account for idle time. |
5072 | * @cputime: the cpu time spent in idle wait | |
1da177e4 | 5073 | */ |
79741dd3 | 5074 | void account_idle_time(cputime_t cputime) |
1da177e4 LT |
5075 | { |
5076 | struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat; | |
79741dd3 | 5077 | cputime64_t cputime64 = cputime_to_cputime64(cputime); |
70b97a7f | 5078 | struct rq *rq = this_rq(); |
1da177e4 | 5079 | |
79741dd3 MS |
5080 | if (atomic_read(&rq->nr_iowait) > 0) |
5081 | cpustat->iowait = cputime64_add(cpustat->iowait, cputime64); | |
5082 | else | |
5083 | cpustat->idle = cputime64_add(cpustat->idle, cputime64); | |
1da177e4 LT |
5084 | } |
5085 | ||
79741dd3 MS |
5086 | #ifndef CONFIG_VIRT_CPU_ACCOUNTING |
5087 | ||
5088 | /* | |
5089 | * Account a single tick of cpu time. | |
5090 | * @p: the process that the cpu time gets accounted to | |
5091 | * @user_tick: indicates if the tick is a user or a system tick | |
5092 | */ | |
5093 | void account_process_tick(struct task_struct *p, int user_tick) | |
5094 | { | |
a42548a1 | 5095 | cputime_t one_jiffy_scaled = cputime_to_scaled(cputime_one_jiffy); |
79741dd3 MS |
5096 | struct rq *rq = this_rq(); |
5097 | ||
5098 | if (user_tick) | |
a42548a1 | 5099 | account_user_time(p, cputime_one_jiffy, one_jiffy_scaled); |
f5f293a4 | 5100 | else if ((p != rq->idle) || (irq_count() != HARDIRQ_OFFSET)) |
a42548a1 | 5101 | account_system_time(p, HARDIRQ_OFFSET, cputime_one_jiffy, |
79741dd3 MS |
5102 | one_jiffy_scaled); |
5103 | else | |
a42548a1 | 5104 | account_idle_time(cputime_one_jiffy); |
79741dd3 MS |
5105 | } |
5106 | ||
5107 | /* | |
5108 | * Account multiple ticks of steal time. | |
5109 | * @p: the process from which the cpu time has been stolen | |
5110 | * @ticks: number of stolen ticks | |
5111 | */ | |
5112 | void account_steal_ticks(unsigned long ticks) | |
5113 | { | |
5114 | account_steal_time(jiffies_to_cputime(ticks)); | |
5115 | } | |
5116 | ||
5117 | /* | |
5118 | * Account multiple ticks of idle time. | |
5119 | * @ticks: number of stolen ticks | |
5120 | */ | |
5121 | void account_idle_ticks(unsigned long ticks) | |
5122 | { | |
5123 | account_idle_time(jiffies_to_cputime(ticks)); | |
1da177e4 LT |
5124 | } |
5125 | ||
79741dd3 MS |
5126 | #endif |
5127 | ||
49048622 BS |
5128 | /* |
5129 | * Use precise platform statistics if available: | |
5130 | */ | |
5131 | #ifdef CONFIG_VIRT_CPU_ACCOUNTING | |
5132 | cputime_t task_utime(struct task_struct *p) | |
5133 | { | |
5134 | return p->utime; | |
5135 | } | |
5136 | ||
5137 | cputime_t task_stime(struct task_struct *p) | |
5138 | { | |
5139 | return p->stime; | |
5140 | } | |
5141 | #else | |
5142 | cputime_t task_utime(struct task_struct *p) | |
5143 | { | |
5144 | clock_t utime = cputime_to_clock_t(p->utime), | |
5145 | total = utime + cputime_to_clock_t(p->stime); | |
5146 | u64 temp; | |
5147 | ||
5148 | /* | |
5149 | * Use CFS's precise accounting: | |
5150 | */ | |
5151 | temp = (u64)nsec_to_clock_t(p->se.sum_exec_runtime); | |
5152 | ||
5153 | if (total) { | |
5154 | temp *= utime; | |
5155 | do_div(temp, total); | |
5156 | } | |
5157 | utime = (clock_t)temp; | |
5158 | ||
5159 | p->prev_utime = max(p->prev_utime, clock_t_to_cputime(utime)); | |
5160 | return p->prev_utime; | |
5161 | } | |
5162 | ||
5163 | cputime_t task_stime(struct task_struct *p) | |
5164 | { | |
5165 | clock_t stime; | |
5166 | ||
5167 | /* | |
5168 | * Use CFS's precise accounting. (we subtract utime from | |
5169 | * the total, to make sure the total observed by userspace | |
5170 | * grows monotonically - apps rely on that): | |
5171 | */ | |
5172 | stime = nsec_to_clock_t(p->se.sum_exec_runtime) - | |
5173 | cputime_to_clock_t(task_utime(p)); | |
5174 | ||
5175 | if (stime >= 0) | |
5176 | p->prev_stime = max(p->prev_stime, clock_t_to_cputime(stime)); | |
5177 | ||
5178 | return p->prev_stime; | |
5179 | } | |
5180 | #endif | |
5181 | ||
5182 | inline cputime_t task_gtime(struct task_struct *p) | |
5183 | { | |
5184 | return p->gtime; | |
5185 | } | |
5186 | ||
7835b98b CL |
5187 | /* |
5188 | * This function gets called by the timer code, with HZ frequency. | |
5189 | * We call it with interrupts disabled. | |
5190 | * | |
5191 | * It also gets called by the fork code, when changing the parent's | |
5192 | * timeslices. | |
5193 | */ | |
5194 | void scheduler_tick(void) | |
5195 | { | |
7835b98b CL |
5196 | int cpu = smp_processor_id(); |
5197 | struct rq *rq = cpu_rq(cpu); | |
dd41f596 | 5198 | struct task_struct *curr = rq->curr; |
3e51f33f PZ |
5199 | |
5200 | sched_clock_tick(); | |
dd41f596 IM |
5201 | |
5202 | spin_lock(&rq->lock); | |
3e51f33f | 5203 | update_rq_clock(rq); |
f1a438d8 | 5204 | update_cpu_load(rq); |
fa85ae24 | 5205 | curr->sched_class->task_tick(rq, curr, 0); |
dd41f596 | 5206 | spin_unlock(&rq->lock); |
7835b98b | 5207 | |
cdd6c482 | 5208 | perf_event_task_tick(curr, cpu); |
e220d2dc | 5209 | |
e418e1c2 | 5210 | #ifdef CONFIG_SMP |
dd41f596 IM |
5211 | rq->idle_at_tick = idle_cpu(cpu); |
5212 | trigger_load_balance(rq, cpu); | |
e418e1c2 | 5213 | #endif |
1da177e4 LT |
5214 | } |
5215 | ||
132380a0 | 5216 | notrace unsigned long get_parent_ip(unsigned long addr) |
6cd8a4bb SR |
5217 | { |
5218 | if (in_lock_functions(addr)) { | |
5219 | addr = CALLER_ADDR2; | |
5220 | if (in_lock_functions(addr)) | |
5221 | addr = CALLER_ADDR3; | |
5222 | } | |
5223 | return addr; | |
5224 | } | |
1da177e4 | 5225 | |
7e49fcce SR |
5226 | #if defined(CONFIG_PREEMPT) && (defined(CONFIG_DEBUG_PREEMPT) || \ |
5227 | defined(CONFIG_PREEMPT_TRACER)) | |
5228 | ||
43627582 | 5229 | void __kprobes add_preempt_count(int val) |
1da177e4 | 5230 | { |
6cd8a4bb | 5231 | #ifdef CONFIG_DEBUG_PREEMPT |
1da177e4 LT |
5232 | /* |
5233 | * Underflow? | |
5234 | */ | |
9a11b49a IM |
5235 | if (DEBUG_LOCKS_WARN_ON((preempt_count() < 0))) |
5236 | return; | |
6cd8a4bb | 5237 | #endif |
1da177e4 | 5238 | preempt_count() += val; |
6cd8a4bb | 5239 | #ifdef CONFIG_DEBUG_PREEMPT |
1da177e4 LT |
5240 | /* |
5241 | * Spinlock count overflowing soon? | |
5242 | */ | |
33859f7f MOS |
5243 | DEBUG_LOCKS_WARN_ON((preempt_count() & PREEMPT_MASK) >= |
5244 | PREEMPT_MASK - 10); | |
6cd8a4bb SR |
5245 | #endif |
5246 | if (preempt_count() == val) | |
5247 | trace_preempt_off(CALLER_ADDR0, get_parent_ip(CALLER_ADDR1)); | |
1da177e4 LT |
5248 | } |
5249 | EXPORT_SYMBOL(add_preempt_count); | |
5250 | ||
43627582 | 5251 | void __kprobes sub_preempt_count(int val) |
1da177e4 | 5252 | { |
6cd8a4bb | 5253 | #ifdef CONFIG_DEBUG_PREEMPT |
1da177e4 LT |
5254 | /* |
5255 | * Underflow? | |
5256 | */ | |
01e3eb82 | 5257 | if (DEBUG_LOCKS_WARN_ON(val > preempt_count())) |
9a11b49a | 5258 | return; |
1da177e4 LT |
5259 | /* |
5260 | * Is the spinlock portion underflowing? | |
5261 | */ | |
9a11b49a IM |
5262 | if (DEBUG_LOCKS_WARN_ON((val < PREEMPT_MASK) && |
5263 | !(preempt_count() & PREEMPT_MASK))) | |
5264 | return; | |
6cd8a4bb | 5265 | #endif |
9a11b49a | 5266 | |
6cd8a4bb SR |
5267 | if (preempt_count() == val) |
5268 | trace_preempt_on(CALLER_ADDR0, get_parent_ip(CALLER_ADDR1)); | |
1da177e4 LT |
5269 | preempt_count() -= val; |
5270 | } | |
5271 | EXPORT_SYMBOL(sub_preempt_count); | |
5272 | ||
5273 | #endif | |
5274 | ||
5275 | /* | |
dd41f596 | 5276 | * Print scheduling while atomic bug: |
1da177e4 | 5277 | */ |
dd41f596 | 5278 | static noinline void __schedule_bug(struct task_struct *prev) |
1da177e4 | 5279 | { |
838225b4 SS |
5280 | struct pt_regs *regs = get_irq_regs(); |
5281 | ||
5282 | printk(KERN_ERR "BUG: scheduling while atomic: %s/%d/0x%08x\n", | |
5283 | prev->comm, prev->pid, preempt_count()); | |
5284 | ||
dd41f596 | 5285 | debug_show_held_locks(prev); |
e21f5b15 | 5286 | print_modules(); |
dd41f596 IM |
5287 | if (irqs_disabled()) |
5288 | print_irqtrace_events(prev); | |
838225b4 SS |
5289 | |
5290 | if (regs) | |
5291 | show_regs(regs); | |
5292 | else | |
5293 | dump_stack(); | |
dd41f596 | 5294 | } |
1da177e4 | 5295 | |
dd41f596 IM |
5296 | /* |
5297 | * Various schedule()-time debugging checks and statistics: | |
5298 | */ | |
5299 | static inline void schedule_debug(struct task_struct *prev) | |
5300 | { | |
1da177e4 | 5301 | /* |
41a2d6cf | 5302 | * Test if we are atomic. Since do_exit() needs to call into |
1da177e4 LT |
5303 | * schedule() atomically, we ignore that path for now. |
5304 | * Otherwise, whine if we are scheduling when we should not be. | |
5305 | */ | |
3f33a7ce | 5306 | if (unlikely(in_atomic_preempt_off() && !prev->exit_state)) |
dd41f596 IM |
5307 | __schedule_bug(prev); |
5308 | ||
1da177e4 LT |
5309 | profile_hit(SCHED_PROFILING, __builtin_return_address(0)); |
5310 | ||
2d72376b | 5311 | schedstat_inc(this_rq(), sched_count); |
b8efb561 IM |
5312 | #ifdef CONFIG_SCHEDSTATS |
5313 | if (unlikely(prev->lock_depth >= 0)) { | |
2d72376b IM |
5314 | schedstat_inc(this_rq(), bkl_count); |
5315 | schedstat_inc(prev, sched_info.bkl_count); | |
b8efb561 IM |
5316 | } |
5317 | #endif | |
dd41f596 IM |
5318 | } |
5319 | ||
ad4b78bb | 5320 | static void put_prev_task(struct rq *rq, struct task_struct *p) |
df1c99d4 | 5321 | { |
ad4b78bb | 5322 | u64 runtime = p->se.sum_exec_runtime - p->se.prev_sum_exec_runtime; |
df1c99d4 | 5323 | |
ad4b78bb | 5324 | update_avg(&p->se.avg_running, runtime); |
df1c99d4 | 5325 | |
ad4b78bb | 5326 | if (p->state == TASK_RUNNING) { |
df1c99d4 MG |
5327 | /* |
5328 | * In order to avoid avg_overlap growing stale when we are | |
5329 | * indeed overlapping and hence not getting put to sleep, grow | |
5330 | * the avg_overlap on preemption. | |
5331 | * | |
5332 | * We use the average preemption runtime because that | |
5333 | * correlates to the amount of cache footprint a task can | |
5334 | * build up. | |
5335 | */ | |
ad4b78bb PZ |
5336 | runtime = min_t(u64, runtime, 2*sysctl_sched_migration_cost); |
5337 | update_avg(&p->se.avg_overlap, runtime); | |
5338 | } else { | |
5339 | update_avg(&p->se.avg_running, 0); | |
df1c99d4 | 5340 | } |
ad4b78bb | 5341 | p->sched_class->put_prev_task(rq, p); |
df1c99d4 MG |
5342 | } |
5343 | ||
dd41f596 IM |
5344 | /* |
5345 | * Pick up the highest-prio task: | |
5346 | */ | |
5347 | static inline struct task_struct * | |
b67802ea | 5348 | pick_next_task(struct rq *rq) |
dd41f596 | 5349 | { |
5522d5d5 | 5350 | const struct sched_class *class; |
dd41f596 | 5351 | struct task_struct *p; |
1da177e4 LT |
5352 | |
5353 | /* | |
dd41f596 IM |
5354 | * Optimization: we know that if all tasks are in |
5355 | * the fair class we can call that function directly: | |
1da177e4 | 5356 | */ |
dd41f596 | 5357 | if (likely(rq->nr_running == rq->cfs.nr_running)) { |
fb8d4724 | 5358 | p = fair_sched_class.pick_next_task(rq); |
dd41f596 IM |
5359 | if (likely(p)) |
5360 | return p; | |
1da177e4 LT |
5361 | } |
5362 | ||
dd41f596 IM |
5363 | class = sched_class_highest; |
5364 | for ( ; ; ) { | |
fb8d4724 | 5365 | p = class->pick_next_task(rq); |
dd41f596 IM |
5366 | if (p) |
5367 | return p; | |
5368 | /* | |
5369 | * Will never be NULL as the idle class always | |
5370 | * returns a non-NULL p: | |
5371 | */ | |
5372 | class = class->next; | |
5373 | } | |
5374 | } | |
1da177e4 | 5375 | |
dd41f596 IM |
5376 | /* |
5377 | * schedule() is the main scheduler function. | |
5378 | */ | |
ff743345 | 5379 | asmlinkage void __sched schedule(void) |
dd41f596 IM |
5380 | { |
5381 | struct task_struct *prev, *next; | |
67ca7bde | 5382 | unsigned long *switch_count; |
dd41f596 | 5383 | struct rq *rq; |
31656519 | 5384 | int cpu; |
dd41f596 | 5385 | |
ff743345 PZ |
5386 | need_resched: |
5387 | preempt_disable(); | |
dd41f596 IM |
5388 | cpu = smp_processor_id(); |
5389 | rq = cpu_rq(cpu); | |
d6714c22 | 5390 | rcu_sched_qs(cpu); |
dd41f596 IM |
5391 | prev = rq->curr; |
5392 | switch_count = &prev->nivcsw; | |
5393 | ||
5394 | release_kernel_lock(prev); | |
5395 | need_resched_nonpreemptible: | |
5396 | ||
5397 | schedule_debug(prev); | |
1da177e4 | 5398 | |
31656519 | 5399 | if (sched_feat(HRTICK)) |
f333fdc9 | 5400 | hrtick_clear(rq); |
8f4d37ec | 5401 | |
8cd162ce | 5402 | spin_lock_irq(&rq->lock); |
3e51f33f | 5403 | update_rq_clock(rq); |
1e819950 | 5404 | clear_tsk_need_resched(prev); |
1da177e4 | 5405 | |
1da177e4 | 5406 | if (prev->state && !(preempt_count() & PREEMPT_ACTIVE)) { |
16882c1e | 5407 | if (unlikely(signal_pending_state(prev->state, prev))) |
1da177e4 | 5408 | prev->state = TASK_RUNNING; |
16882c1e | 5409 | else |
2e1cb74a | 5410 | deactivate_task(rq, prev, 1); |
dd41f596 | 5411 | switch_count = &prev->nvcsw; |
1da177e4 LT |
5412 | } |
5413 | ||
3f029d3c | 5414 | pre_schedule(rq, prev); |
f65eda4f | 5415 | |
dd41f596 | 5416 | if (unlikely(!rq->nr_running)) |
1da177e4 | 5417 | idle_balance(cpu, rq); |
1da177e4 | 5418 | |
df1c99d4 | 5419 | put_prev_task(rq, prev); |
b67802ea | 5420 | next = pick_next_task(rq); |
1da177e4 | 5421 | |
1da177e4 | 5422 | if (likely(prev != next)) { |
673a90a1 | 5423 | sched_info_switch(prev, next); |
cdd6c482 | 5424 | perf_event_task_sched_out(prev, next, cpu); |
673a90a1 | 5425 | |
1da177e4 LT |
5426 | rq->nr_switches++; |
5427 | rq->curr = next; | |
5428 | ++*switch_count; | |
5429 | ||
dd41f596 | 5430 | context_switch(rq, prev, next); /* unlocks the rq */ |
8f4d37ec PZ |
5431 | /* |
5432 | * the context switch might have flipped the stack from under | |
5433 | * us, hence refresh the local variables. | |
5434 | */ | |
5435 | cpu = smp_processor_id(); | |
5436 | rq = cpu_rq(cpu); | |
1da177e4 LT |
5437 | } else |
5438 | spin_unlock_irq(&rq->lock); | |
5439 | ||
3f029d3c | 5440 | post_schedule(rq); |
1da177e4 | 5441 | |
8f4d37ec | 5442 | if (unlikely(reacquire_kernel_lock(current) < 0)) |
1da177e4 | 5443 | goto need_resched_nonpreemptible; |
8f4d37ec | 5444 | |
1da177e4 | 5445 | preempt_enable_no_resched(); |
ff743345 | 5446 | if (need_resched()) |
1da177e4 LT |
5447 | goto need_resched; |
5448 | } | |
1da177e4 LT |
5449 | EXPORT_SYMBOL(schedule); |
5450 | ||
0d66bf6d PZ |
5451 | #ifdef CONFIG_SMP |
5452 | /* | |
5453 | * Look out! "owner" is an entirely speculative pointer | |
5454 | * access and not reliable. | |
5455 | */ | |
5456 | int mutex_spin_on_owner(struct mutex *lock, struct thread_info *owner) | |
5457 | { | |
5458 | unsigned int cpu; | |
5459 | struct rq *rq; | |
5460 | ||
5461 | if (!sched_feat(OWNER_SPIN)) | |
5462 | return 0; | |
5463 | ||
5464 | #ifdef CONFIG_DEBUG_PAGEALLOC | |
5465 | /* | |
5466 | * Need to access the cpu field knowing that | |
5467 | * DEBUG_PAGEALLOC could have unmapped it if | |
5468 | * the mutex owner just released it and exited. | |
5469 | */ | |
5470 | if (probe_kernel_address(&owner->cpu, cpu)) | |
5471 | goto out; | |
5472 | #else | |
5473 | cpu = owner->cpu; | |
5474 | #endif | |
5475 | ||
5476 | /* | |
5477 | * Even if the access succeeded (likely case), | |
5478 | * the cpu field may no longer be valid. | |
5479 | */ | |
5480 | if (cpu >= nr_cpumask_bits) | |
5481 | goto out; | |
5482 | ||
5483 | /* | |
5484 | * We need to validate that we can do a | |
5485 | * get_cpu() and that we have the percpu area. | |
5486 | */ | |
5487 | if (!cpu_online(cpu)) | |
5488 | goto out; | |
5489 | ||
5490 | rq = cpu_rq(cpu); | |
5491 | ||
5492 | for (;;) { | |
5493 | /* | |
5494 | * Owner changed, break to re-assess state. | |
5495 | */ | |
5496 | if (lock->owner != owner) | |
5497 | break; | |
5498 | ||
5499 | /* | |
5500 | * Is that owner really running on that cpu? | |
5501 | */ | |
5502 | if (task_thread_info(rq->curr) != owner || need_resched()) | |
5503 | return 0; | |
5504 | ||
5505 | cpu_relax(); | |
5506 | } | |
5507 | out: | |
5508 | return 1; | |
5509 | } | |
5510 | #endif | |
5511 | ||
1da177e4 LT |
5512 | #ifdef CONFIG_PREEMPT |
5513 | /* | |
2ed6e34f | 5514 | * this is the entry point to schedule() from in-kernel preemption |
41a2d6cf | 5515 | * off of preempt_enable. Kernel preemptions off return from interrupt |
1da177e4 LT |
5516 | * occur there and call schedule directly. |
5517 | */ | |
5518 | asmlinkage void __sched preempt_schedule(void) | |
5519 | { | |
5520 | struct thread_info *ti = current_thread_info(); | |
6478d880 | 5521 | |
1da177e4 LT |
5522 | /* |
5523 | * If there is a non-zero preempt_count or interrupts are disabled, | |
41a2d6cf | 5524 | * we do not want to preempt the current task. Just return.. |
1da177e4 | 5525 | */ |
beed33a8 | 5526 | if (likely(ti->preempt_count || irqs_disabled())) |
1da177e4 LT |
5527 | return; |
5528 | ||
3a5c359a AK |
5529 | do { |
5530 | add_preempt_count(PREEMPT_ACTIVE); | |
3a5c359a | 5531 | schedule(); |
3a5c359a | 5532 | sub_preempt_count(PREEMPT_ACTIVE); |
1da177e4 | 5533 | |
3a5c359a AK |
5534 | /* |
5535 | * Check again in case we missed a preemption opportunity | |
5536 | * between schedule and now. | |
5537 | */ | |
5538 | barrier(); | |
5ed0cec0 | 5539 | } while (need_resched()); |
1da177e4 | 5540 | } |
1da177e4 LT |
5541 | EXPORT_SYMBOL(preempt_schedule); |
5542 | ||
5543 | /* | |
2ed6e34f | 5544 | * this is the entry point to schedule() from kernel preemption |
1da177e4 LT |
5545 | * off of irq context. |
5546 | * Note, that this is called and return with irqs disabled. This will | |
5547 | * protect us against recursive calling from irq. | |
5548 | */ | |
5549 | asmlinkage void __sched preempt_schedule_irq(void) | |
5550 | { | |
5551 | struct thread_info *ti = current_thread_info(); | |
6478d880 | 5552 | |
2ed6e34f | 5553 | /* Catch callers which need to be fixed */ |
1da177e4 LT |
5554 | BUG_ON(ti->preempt_count || !irqs_disabled()); |
5555 | ||
3a5c359a AK |
5556 | do { |
5557 | add_preempt_count(PREEMPT_ACTIVE); | |
3a5c359a AK |
5558 | local_irq_enable(); |
5559 | schedule(); | |
5560 | local_irq_disable(); | |
3a5c359a | 5561 | sub_preempt_count(PREEMPT_ACTIVE); |
1da177e4 | 5562 | |
3a5c359a AK |
5563 | /* |
5564 | * Check again in case we missed a preemption opportunity | |
5565 | * between schedule and now. | |
5566 | */ | |
5567 | barrier(); | |
5ed0cec0 | 5568 | } while (need_resched()); |
1da177e4 LT |
5569 | } |
5570 | ||
5571 | #endif /* CONFIG_PREEMPT */ | |
5572 | ||
63859d4f | 5573 | int default_wake_function(wait_queue_t *curr, unsigned mode, int wake_flags, |
95cdf3b7 | 5574 | void *key) |
1da177e4 | 5575 | { |
63859d4f | 5576 | return try_to_wake_up(curr->private, mode, wake_flags); |
1da177e4 | 5577 | } |
1da177e4 LT |
5578 | EXPORT_SYMBOL(default_wake_function); |
5579 | ||
5580 | /* | |
41a2d6cf IM |
5581 | * The core wakeup function. Non-exclusive wakeups (nr_exclusive == 0) just |
5582 | * wake everything up. If it's an exclusive wakeup (nr_exclusive == small +ve | |
1da177e4 LT |
5583 | * number) then we wake all the non-exclusive tasks and one exclusive task. |
5584 | * | |
5585 | * There are circumstances in which we can try to wake a task which has already | |
41a2d6cf | 5586 | * started to run but is not in state TASK_RUNNING. try_to_wake_up() returns |
1da177e4 LT |
5587 | * zero in this (rare) case, and we handle it by continuing to scan the queue. |
5588 | */ | |
78ddb08f | 5589 | static void __wake_up_common(wait_queue_head_t *q, unsigned int mode, |
63859d4f | 5590 | int nr_exclusive, int wake_flags, void *key) |
1da177e4 | 5591 | { |
2e45874c | 5592 | wait_queue_t *curr, *next; |
1da177e4 | 5593 | |
2e45874c | 5594 | list_for_each_entry_safe(curr, next, &q->task_list, task_list) { |
48f24c4d IM |
5595 | unsigned flags = curr->flags; |
5596 | ||
63859d4f | 5597 | if (curr->func(curr, mode, wake_flags, key) && |
48f24c4d | 5598 | (flags & WQ_FLAG_EXCLUSIVE) && !--nr_exclusive) |
1da177e4 LT |
5599 | break; |
5600 | } | |
5601 | } | |
5602 | ||
5603 | /** | |
5604 | * __wake_up - wake up threads blocked on a waitqueue. | |
5605 | * @q: the waitqueue | |
5606 | * @mode: which threads | |
5607 | * @nr_exclusive: how many wake-one or wake-many threads to wake up | |
67be2dd1 | 5608 | * @key: is directly passed to the wakeup function |
50fa610a DH |
5609 | * |
5610 | * It may be assumed that this function implies a write memory barrier before | |
5611 | * changing the task state if and only if any tasks are woken up. | |
1da177e4 | 5612 | */ |
7ad5b3a5 | 5613 | void __wake_up(wait_queue_head_t *q, unsigned int mode, |
95cdf3b7 | 5614 | int nr_exclusive, void *key) |
1da177e4 LT |
5615 | { |
5616 | unsigned long flags; | |
5617 | ||
5618 | spin_lock_irqsave(&q->lock, flags); | |
5619 | __wake_up_common(q, mode, nr_exclusive, 0, key); | |
5620 | spin_unlock_irqrestore(&q->lock, flags); | |
5621 | } | |
1da177e4 LT |
5622 | EXPORT_SYMBOL(__wake_up); |
5623 | ||
5624 | /* | |
5625 | * Same as __wake_up but called with the spinlock in wait_queue_head_t held. | |
5626 | */ | |
7ad5b3a5 | 5627 | void __wake_up_locked(wait_queue_head_t *q, unsigned int mode) |
1da177e4 LT |
5628 | { |
5629 | __wake_up_common(q, mode, 1, 0, NULL); | |
5630 | } | |
5631 | ||
4ede816a DL |
5632 | void __wake_up_locked_key(wait_queue_head_t *q, unsigned int mode, void *key) |
5633 | { | |
5634 | __wake_up_common(q, mode, 1, 0, key); | |
5635 | } | |
5636 | ||
1da177e4 | 5637 | /** |
4ede816a | 5638 | * __wake_up_sync_key - wake up threads blocked on a waitqueue. |
1da177e4 LT |
5639 | * @q: the waitqueue |
5640 | * @mode: which threads | |
5641 | * @nr_exclusive: how many wake-one or wake-many threads to wake up | |
4ede816a | 5642 | * @key: opaque value to be passed to wakeup targets |
1da177e4 LT |
5643 | * |
5644 | * The sync wakeup differs that the waker knows that it will schedule | |
5645 | * away soon, so while the target thread will be woken up, it will not | |
5646 | * be migrated to another CPU - ie. the two threads are 'synchronized' | |
5647 | * with each other. This can prevent needless bouncing between CPUs. | |
5648 | * | |
5649 | * On UP it can prevent extra preemption. | |
50fa610a DH |
5650 | * |
5651 | * It may be assumed that this function implies a write memory barrier before | |
5652 | * changing the task state if and only if any tasks are woken up. | |
1da177e4 | 5653 | */ |
4ede816a DL |
5654 | void __wake_up_sync_key(wait_queue_head_t *q, unsigned int mode, |
5655 | int nr_exclusive, void *key) | |
1da177e4 LT |
5656 | { |
5657 | unsigned long flags; | |
7d478721 | 5658 | int wake_flags = WF_SYNC; |
1da177e4 LT |
5659 | |
5660 | if (unlikely(!q)) | |
5661 | return; | |
5662 | ||
5663 | if (unlikely(!nr_exclusive)) | |
7d478721 | 5664 | wake_flags = 0; |
1da177e4 LT |
5665 | |
5666 | spin_lock_irqsave(&q->lock, flags); | |
7d478721 | 5667 | __wake_up_common(q, mode, nr_exclusive, wake_flags, key); |
1da177e4 LT |
5668 | spin_unlock_irqrestore(&q->lock, flags); |
5669 | } | |
4ede816a DL |
5670 | EXPORT_SYMBOL_GPL(__wake_up_sync_key); |
5671 | ||
5672 | /* | |
5673 | * __wake_up_sync - see __wake_up_sync_key() | |
5674 | */ | |
5675 | void __wake_up_sync(wait_queue_head_t *q, unsigned int mode, int nr_exclusive) | |
5676 | { | |
5677 | __wake_up_sync_key(q, mode, nr_exclusive, NULL); | |
5678 | } | |
1da177e4 LT |
5679 | EXPORT_SYMBOL_GPL(__wake_up_sync); /* For internal use only */ |
5680 | ||
65eb3dc6 KD |
5681 | /** |
5682 | * complete: - signals a single thread waiting on this completion | |
5683 | * @x: holds the state of this particular completion | |
5684 | * | |
5685 | * This will wake up a single thread waiting on this completion. Threads will be | |
5686 | * awakened in the same order in which they were queued. | |
5687 | * | |
5688 | * See also complete_all(), wait_for_completion() and related routines. | |
50fa610a DH |
5689 | * |
5690 | * It may be assumed that this function implies a write memory barrier before | |
5691 | * changing the task state if and only if any tasks are woken up. | |
65eb3dc6 | 5692 | */ |
b15136e9 | 5693 | void complete(struct completion *x) |
1da177e4 LT |
5694 | { |
5695 | unsigned long flags; | |
5696 | ||
5697 | spin_lock_irqsave(&x->wait.lock, flags); | |
5698 | x->done++; | |
d9514f6c | 5699 | __wake_up_common(&x->wait, TASK_NORMAL, 1, 0, NULL); |
1da177e4 LT |
5700 | spin_unlock_irqrestore(&x->wait.lock, flags); |
5701 | } | |
5702 | EXPORT_SYMBOL(complete); | |
5703 | ||
65eb3dc6 KD |
5704 | /** |
5705 | * complete_all: - signals all threads waiting on this completion | |
5706 | * @x: holds the state of this particular completion | |
5707 | * | |
5708 | * This will wake up all threads waiting on this particular completion event. | |
50fa610a DH |
5709 | * |
5710 | * It may be assumed that this function implies a write memory barrier before | |
5711 | * changing the task state if and only if any tasks are woken up. | |
65eb3dc6 | 5712 | */ |
b15136e9 | 5713 | void complete_all(struct completion *x) |
1da177e4 LT |
5714 | { |
5715 | unsigned long flags; | |
5716 | ||
5717 | spin_lock_irqsave(&x->wait.lock, flags); | |
5718 | x->done += UINT_MAX/2; | |
d9514f6c | 5719 | __wake_up_common(&x->wait, TASK_NORMAL, 0, 0, NULL); |
1da177e4 LT |
5720 | spin_unlock_irqrestore(&x->wait.lock, flags); |
5721 | } | |
5722 | EXPORT_SYMBOL(complete_all); | |
5723 | ||
8cbbe86d AK |
5724 | static inline long __sched |
5725 | do_wait_for_common(struct completion *x, long timeout, int state) | |
1da177e4 | 5726 | { |
1da177e4 LT |
5727 | if (!x->done) { |
5728 | DECLARE_WAITQUEUE(wait, current); | |
5729 | ||
5730 | wait.flags |= WQ_FLAG_EXCLUSIVE; | |
5731 | __add_wait_queue_tail(&x->wait, &wait); | |
5732 | do { | |
94d3d824 | 5733 | if (signal_pending_state(state, current)) { |
ea71a546 ON |
5734 | timeout = -ERESTARTSYS; |
5735 | break; | |
8cbbe86d AK |
5736 | } |
5737 | __set_current_state(state); | |
1da177e4 LT |
5738 | spin_unlock_irq(&x->wait.lock); |
5739 | timeout = schedule_timeout(timeout); | |
5740 | spin_lock_irq(&x->wait.lock); | |
ea71a546 | 5741 | } while (!x->done && timeout); |
1da177e4 | 5742 | __remove_wait_queue(&x->wait, &wait); |
ea71a546 ON |
5743 | if (!x->done) |
5744 | return timeout; | |
1da177e4 LT |
5745 | } |
5746 | x->done--; | |
ea71a546 | 5747 | return timeout ?: 1; |
1da177e4 | 5748 | } |
1da177e4 | 5749 | |
8cbbe86d AK |
5750 | static long __sched |
5751 | wait_for_common(struct completion *x, long timeout, int state) | |
1da177e4 | 5752 | { |
1da177e4 LT |
5753 | might_sleep(); |
5754 | ||
5755 | spin_lock_irq(&x->wait.lock); | |
8cbbe86d | 5756 | timeout = do_wait_for_common(x, timeout, state); |
1da177e4 | 5757 | spin_unlock_irq(&x->wait.lock); |
8cbbe86d AK |
5758 | return timeout; |
5759 | } | |
1da177e4 | 5760 | |
65eb3dc6 KD |
5761 | /** |
5762 | * wait_for_completion: - waits for completion of a task | |
5763 | * @x: holds the state of this particular completion | |
5764 | * | |
5765 | * This waits to be signaled for completion of a specific task. It is NOT | |
5766 | * interruptible and there is no timeout. | |
5767 | * | |
5768 | * See also similar routines (i.e. wait_for_completion_timeout()) with timeout | |
5769 | * and interrupt capability. Also see complete(). | |
5770 | */ | |
b15136e9 | 5771 | void __sched wait_for_completion(struct completion *x) |
8cbbe86d AK |
5772 | { |
5773 | wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_UNINTERRUPTIBLE); | |
1da177e4 | 5774 | } |
8cbbe86d | 5775 | EXPORT_SYMBOL(wait_for_completion); |
1da177e4 | 5776 | |
65eb3dc6 KD |
5777 | /** |
5778 | * wait_for_completion_timeout: - waits for completion of a task (w/timeout) | |
5779 | * @x: holds the state of this particular completion | |
5780 | * @timeout: timeout value in jiffies | |
5781 | * | |
5782 | * This waits for either a completion of a specific task to be signaled or for a | |
5783 | * specified timeout to expire. The timeout is in jiffies. It is not | |
5784 | * interruptible. | |
5785 | */ | |
b15136e9 | 5786 | unsigned long __sched |
8cbbe86d | 5787 | wait_for_completion_timeout(struct completion *x, unsigned long timeout) |
1da177e4 | 5788 | { |
8cbbe86d | 5789 | return wait_for_common(x, timeout, TASK_UNINTERRUPTIBLE); |
1da177e4 | 5790 | } |
8cbbe86d | 5791 | EXPORT_SYMBOL(wait_for_completion_timeout); |
1da177e4 | 5792 | |
65eb3dc6 KD |
5793 | /** |
5794 | * wait_for_completion_interruptible: - waits for completion of a task (w/intr) | |
5795 | * @x: holds the state of this particular completion | |
5796 | * | |
5797 | * This waits for completion of a specific task to be signaled. It is | |
5798 | * interruptible. | |
5799 | */ | |
8cbbe86d | 5800 | int __sched wait_for_completion_interruptible(struct completion *x) |
0fec171c | 5801 | { |
51e97990 AK |
5802 | long t = wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_INTERRUPTIBLE); |
5803 | if (t == -ERESTARTSYS) | |
5804 | return t; | |
5805 | return 0; | |
0fec171c | 5806 | } |
8cbbe86d | 5807 | EXPORT_SYMBOL(wait_for_completion_interruptible); |
1da177e4 | 5808 | |
65eb3dc6 KD |
5809 | /** |
5810 | * wait_for_completion_interruptible_timeout: - waits for completion (w/(to,intr)) | |
5811 | * @x: holds the state of this particular completion | |
5812 | * @timeout: timeout value in jiffies | |
5813 | * | |
5814 | * This waits for either a completion of a specific task to be signaled or for a | |
5815 | * specified timeout to expire. It is interruptible. The timeout is in jiffies. | |
5816 | */ | |
b15136e9 | 5817 | unsigned long __sched |
8cbbe86d AK |
5818 | wait_for_completion_interruptible_timeout(struct completion *x, |
5819 | unsigned long timeout) | |
0fec171c | 5820 | { |
8cbbe86d | 5821 | return wait_for_common(x, timeout, TASK_INTERRUPTIBLE); |
0fec171c | 5822 | } |
8cbbe86d | 5823 | EXPORT_SYMBOL(wait_for_completion_interruptible_timeout); |
1da177e4 | 5824 | |
65eb3dc6 KD |
5825 | /** |
5826 | * wait_for_completion_killable: - waits for completion of a task (killable) | |
5827 | * @x: holds the state of this particular completion | |
5828 | * | |
5829 | * This waits to be signaled for completion of a specific task. It can be | |
5830 | * interrupted by a kill signal. | |
5831 | */ | |
009e577e MW |
5832 | int __sched wait_for_completion_killable(struct completion *x) |
5833 | { | |
5834 | long t = wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_KILLABLE); | |
5835 | if (t == -ERESTARTSYS) | |
5836 | return t; | |
5837 | return 0; | |
5838 | } | |
5839 | EXPORT_SYMBOL(wait_for_completion_killable); | |
5840 | ||
be4de352 DC |
5841 | /** |
5842 | * try_wait_for_completion - try to decrement a completion without blocking | |
5843 | * @x: completion structure | |
5844 | * | |
5845 | * Returns: 0 if a decrement cannot be done without blocking | |
5846 | * 1 if a decrement succeeded. | |
5847 | * | |
5848 | * If a completion is being used as a counting completion, | |
5849 | * attempt to decrement the counter without blocking. This | |
5850 | * enables us to avoid waiting if the resource the completion | |
5851 | * is protecting is not available. | |
5852 | */ | |
5853 | bool try_wait_for_completion(struct completion *x) | |
5854 | { | |
5855 | int ret = 1; | |
5856 | ||
5857 | spin_lock_irq(&x->wait.lock); | |
5858 | if (!x->done) | |
5859 | ret = 0; | |
5860 | else | |
5861 | x->done--; | |
5862 | spin_unlock_irq(&x->wait.lock); | |
5863 | return ret; | |
5864 | } | |
5865 | EXPORT_SYMBOL(try_wait_for_completion); | |
5866 | ||
5867 | /** | |
5868 | * completion_done - Test to see if a completion has any waiters | |
5869 | * @x: completion structure | |
5870 | * | |
5871 | * Returns: 0 if there are waiters (wait_for_completion() in progress) | |
5872 | * 1 if there are no waiters. | |
5873 | * | |
5874 | */ | |
5875 | bool completion_done(struct completion *x) | |
5876 | { | |
5877 | int ret = 1; | |
5878 | ||
5879 | spin_lock_irq(&x->wait.lock); | |
5880 | if (!x->done) | |
5881 | ret = 0; | |
5882 | spin_unlock_irq(&x->wait.lock); | |
5883 | return ret; | |
5884 | } | |
5885 | EXPORT_SYMBOL(completion_done); | |
5886 | ||
8cbbe86d AK |
5887 | static long __sched |
5888 | sleep_on_common(wait_queue_head_t *q, int state, long timeout) | |
1da177e4 | 5889 | { |
0fec171c IM |
5890 | unsigned long flags; |
5891 | wait_queue_t wait; | |
5892 | ||
5893 | init_waitqueue_entry(&wait, current); | |
1da177e4 | 5894 | |
8cbbe86d | 5895 | __set_current_state(state); |
1da177e4 | 5896 | |
8cbbe86d AK |
5897 | spin_lock_irqsave(&q->lock, flags); |
5898 | __add_wait_queue(q, &wait); | |
5899 | spin_unlock(&q->lock); | |
5900 | timeout = schedule_timeout(timeout); | |
5901 | spin_lock_irq(&q->lock); | |
5902 | __remove_wait_queue(q, &wait); | |
5903 | spin_unlock_irqrestore(&q->lock, flags); | |
5904 | ||
5905 | return timeout; | |
5906 | } | |
5907 | ||
5908 | void __sched interruptible_sleep_on(wait_queue_head_t *q) | |
5909 | { | |
5910 | sleep_on_common(q, TASK_INTERRUPTIBLE, MAX_SCHEDULE_TIMEOUT); | |
1da177e4 | 5911 | } |
1da177e4 LT |
5912 | EXPORT_SYMBOL(interruptible_sleep_on); |
5913 | ||
0fec171c | 5914 | long __sched |
95cdf3b7 | 5915 | interruptible_sleep_on_timeout(wait_queue_head_t *q, long timeout) |
1da177e4 | 5916 | { |
8cbbe86d | 5917 | return sleep_on_common(q, TASK_INTERRUPTIBLE, timeout); |
1da177e4 | 5918 | } |
1da177e4 LT |
5919 | EXPORT_SYMBOL(interruptible_sleep_on_timeout); |
5920 | ||
0fec171c | 5921 | void __sched sleep_on(wait_queue_head_t *q) |
1da177e4 | 5922 | { |
8cbbe86d | 5923 | sleep_on_common(q, TASK_UNINTERRUPTIBLE, MAX_SCHEDULE_TIMEOUT); |
1da177e4 | 5924 | } |
1da177e4 LT |
5925 | EXPORT_SYMBOL(sleep_on); |
5926 | ||
0fec171c | 5927 | long __sched sleep_on_timeout(wait_queue_head_t *q, long timeout) |
1da177e4 | 5928 | { |
8cbbe86d | 5929 | return sleep_on_common(q, TASK_UNINTERRUPTIBLE, timeout); |
1da177e4 | 5930 | } |
1da177e4 LT |
5931 | EXPORT_SYMBOL(sleep_on_timeout); |
5932 | ||
b29739f9 IM |
5933 | #ifdef CONFIG_RT_MUTEXES |
5934 | ||
5935 | /* | |
5936 | * rt_mutex_setprio - set the current priority of a task | |
5937 | * @p: task | |
5938 | * @prio: prio value (kernel-internal form) | |
5939 | * | |
5940 | * This function changes the 'effective' priority of a task. It does | |
5941 | * not touch ->normal_prio like __setscheduler(). | |
5942 | * | |
5943 | * Used by the rt_mutex code to implement priority inheritance logic. | |
5944 | */ | |
36c8b586 | 5945 | void rt_mutex_setprio(struct task_struct *p, int prio) |
b29739f9 IM |
5946 | { |
5947 | unsigned long flags; | |
83b699ed | 5948 | int oldprio, on_rq, running; |
70b97a7f | 5949 | struct rq *rq; |
cb469845 | 5950 | const struct sched_class *prev_class = p->sched_class; |
b29739f9 IM |
5951 | |
5952 | BUG_ON(prio < 0 || prio > MAX_PRIO); | |
5953 | ||
5954 | rq = task_rq_lock(p, &flags); | |
a8e504d2 | 5955 | update_rq_clock(rq); |
b29739f9 | 5956 | |
d5f9f942 | 5957 | oldprio = p->prio; |
dd41f596 | 5958 | on_rq = p->se.on_rq; |
051a1d1a | 5959 | running = task_current(rq, p); |
0e1f3483 | 5960 | if (on_rq) |
69be72c1 | 5961 | dequeue_task(rq, p, 0); |
0e1f3483 HS |
5962 | if (running) |
5963 | p->sched_class->put_prev_task(rq, p); | |
dd41f596 IM |
5964 | |
5965 | if (rt_prio(prio)) | |
5966 | p->sched_class = &rt_sched_class; | |
5967 | else | |
5968 | p->sched_class = &fair_sched_class; | |
5969 | ||
b29739f9 IM |
5970 | p->prio = prio; |
5971 | ||
0e1f3483 HS |
5972 | if (running) |
5973 | p->sched_class->set_curr_task(rq); | |
dd41f596 | 5974 | if (on_rq) { |
8159f87e | 5975 | enqueue_task(rq, p, 0); |
cb469845 SR |
5976 | |
5977 | check_class_changed(rq, p, prev_class, oldprio, running); | |
b29739f9 IM |
5978 | } |
5979 | task_rq_unlock(rq, &flags); | |
5980 | } | |
5981 | ||
5982 | #endif | |
5983 | ||
36c8b586 | 5984 | void set_user_nice(struct task_struct *p, long nice) |
1da177e4 | 5985 | { |
dd41f596 | 5986 | int old_prio, delta, on_rq; |
1da177e4 | 5987 | unsigned long flags; |
70b97a7f | 5988 | struct rq *rq; |
1da177e4 LT |
5989 | |
5990 | if (TASK_NICE(p) == nice || nice < -20 || nice > 19) | |
5991 | return; | |
5992 | /* | |
5993 | * We have to be careful, if called from sys_setpriority(), | |
5994 | * the task might be in the middle of scheduling on another CPU. | |
5995 | */ | |
5996 | rq = task_rq_lock(p, &flags); | |
a8e504d2 | 5997 | update_rq_clock(rq); |
1da177e4 LT |
5998 | /* |
5999 | * The RT priorities are set via sched_setscheduler(), but we still | |
6000 | * allow the 'normal' nice value to be set - but as expected | |
6001 | * it wont have any effect on scheduling until the task is | |
dd41f596 | 6002 | * SCHED_FIFO/SCHED_RR: |
1da177e4 | 6003 | */ |
e05606d3 | 6004 | if (task_has_rt_policy(p)) { |
1da177e4 LT |
6005 | p->static_prio = NICE_TO_PRIO(nice); |
6006 | goto out_unlock; | |
6007 | } | |
dd41f596 | 6008 | on_rq = p->se.on_rq; |
c09595f6 | 6009 | if (on_rq) |
69be72c1 | 6010 | dequeue_task(rq, p, 0); |
1da177e4 | 6011 | |
1da177e4 | 6012 | p->static_prio = NICE_TO_PRIO(nice); |
2dd73a4f | 6013 | set_load_weight(p); |
b29739f9 IM |
6014 | old_prio = p->prio; |
6015 | p->prio = effective_prio(p); | |
6016 | delta = p->prio - old_prio; | |
1da177e4 | 6017 | |
dd41f596 | 6018 | if (on_rq) { |
8159f87e | 6019 | enqueue_task(rq, p, 0); |
1da177e4 | 6020 | /* |
d5f9f942 AM |
6021 | * If the task increased its priority or is running and |
6022 | * lowered its priority, then reschedule its CPU: | |
1da177e4 | 6023 | */ |
d5f9f942 | 6024 | if (delta < 0 || (delta > 0 && task_running(rq, p))) |
1da177e4 LT |
6025 | resched_task(rq->curr); |
6026 | } | |
6027 | out_unlock: | |
6028 | task_rq_unlock(rq, &flags); | |
6029 | } | |
1da177e4 LT |
6030 | EXPORT_SYMBOL(set_user_nice); |
6031 | ||
e43379f1 MM |
6032 | /* |
6033 | * can_nice - check if a task can reduce its nice value | |
6034 | * @p: task | |
6035 | * @nice: nice value | |
6036 | */ | |
36c8b586 | 6037 | int can_nice(const struct task_struct *p, const int nice) |
e43379f1 | 6038 | { |
024f4747 MM |
6039 | /* convert nice value [19,-20] to rlimit style value [1,40] */ |
6040 | int nice_rlim = 20 - nice; | |
48f24c4d | 6041 | |
e43379f1 MM |
6042 | return (nice_rlim <= p->signal->rlim[RLIMIT_NICE].rlim_cur || |
6043 | capable(CAP_SYS_NICE)); | |
6044 | } | |
6045 | ||
1da177e4 LT |
6046 | #ifdef __ARCH_WANT_SYS_NICE |
6047 | ||
6048 | /* | |
6049 | * sys_nice - change the priority of the current process. | |
6050 | * @increment: priority increment | |
6051 | * | |
6052 | * sys_setpriority is a more generic, but much slower function that | |
6053 | * does similar things. | |
6054 | */ | |
5add95d4 | 6055 | SYSCALL_DEFINE1(nice, int, increment) |
1da177e4 | 6056 | { |
48f24c4d | 6057 | long nice, retval; |
1da177e4 LT |
6058 | |
6059 | /* | |
6060 | * Setpriority might change our priority at the same moment. | |
6061 | * We don't have to worry. Conceptually one call occurs first | |
6062 | * and we have a single winner. | |
6063 | */ | |
e43379f1 MM |
6064 | if (increment < -40) |
6065 | increment = -40; | |
1da177e4 LT |
6066 | if (increment > 40) |
6067 | increment = 40; | |
6068 | ||
2b8f836f | 6069 | nice = TASK_NICE(current) + increment; |
1da177e4 LT |
6070 | if (nice < -20) |
6071 | nice = -20; | |
6072 | if (nice > 19) | |
6073 | nice = 19; | |
6074 | ||
e43379f1 MM |
6075 | if (increment < 0 && !can_nice(current, nice)) |
6076 | return -EPERM; | |
6077 | ||
1da177e4 LT |
6078 | retval = security_task_setnice(current, nice); |
6079 | if (retval) | |
6080 | return retval; | |
6081 | ||
6082 | set_user_nice(current, nice); | |
6083 | return 0; | |
6084 | } | |
6085 | ||
6086 | #endif | |
6087 | ||
6088 | /** | |
6089 | * task_prio - return the priority value of a given task. | |
6090 | * @p: the task in question. | |
6091 | * | |
6092 | * This is the priority value as seen by users in /proc. | |
6093 | * RT tasks are offset by -200. Normal tasks are centered | |
6094 | * around 0, value goes from -16 to +15. | |
6095 | */ | |
36c8b586 | 6096 | int task_prio(const struct task_struct *p) |
1da177e4 LT |
6097 | { |
6098 | return p->prio - MAX_RT_PRIO; | |
6099 | } | |
6100 | ||
6101 | /** | |
6102 | * task_nice - return the nice value of a given task. | |
6103 | * @p: the task in question. | |
6104 | */ | |
36c8b586 | 6105 | int task_nice(const struct task_struct *p) |
1da177e4 LT |
6106 | { |
6107 | return TASK_NICE(p); | |
6108 | } | |
150d8bed | 6109 | EXPORT_SYMBOL(task_nice); |
1da177e4 LT |
6110 | |
6111 | /** | |
6112 | * idle_cpu - is a given cpu idle currently? | |
6113 | * @cpu: the processor in question. | |
6114 | */ | |
6115 | int idle_cpu(int cpu) | |
6116 | { | |
6117 | return cpu_curr(cpu) == cpu_rq(cpu)->idle; | |
6118 | } | |
6119 | ||
1da177e4 LT |
6120 | /** |
6121 | * idle_task - return the idle task for a given cpu. | |
6122 | * @cpu: the processor in question. | |
6123 | */ | |
36c8b586 | 6124 | struct task_struct *idle_task(int cpu) |
1da177e4 LT |
6125 | { |
6126 | return cpu_rq(cpu)->idle; | |
6127 | } | |
6128 | ||
6129 | /** | |
6130 | * find_process_by_pid - find a process with a matching PID value. | |
6131 | * @pid: the pid in question. | |
6132 | */ | |
a9957449 | 6133 | static struct task_struct *find_process_by_pid(pid_t pid) |
1da177e4 | 6134 | { |
228ebcbe | 6135 | return pid ? find_task_by_vpid(pid) : current; |
1da177e4 LT |
6136 | } |
6137 | ||
6138 | /* Actually do priority change: must hold rq lock. */ | |
dd41f596 IM |
6139 | static void |
6140 | __setscheduler(struct rq *rq, struct task_struct *p, int policy, int prio) | |
1da177e4 | 6141 | { |
dd41f596 | 6142 | BUG_ON(p->se.on_rq); |
48f24c4d | 6143 | |
1da177e4 | 6144 | p->policy = policy; |
dd41f596 IM |
6145 | switch (p->policy) { |
6146 | case SCHED_NORMAL: | |
6147 | case SCHED_BATCH: | |
6148 | case SCHED_IDLE: | |
6149 | p->sched_class = &fair_sched_class; | |
6150 | break; | |
6151 | case SCHED_FIFO: | |
6152 | case SCHED_RR: | |
6153 | p->sched_class = &rt_sched_class; | |
6154 | break; | |
6155 | } | |
6156 | ||
1da177e4 | 6157 | p->rt_priority = prio; |
b29739f9 IM |
6158 | p->normal_prio = normal_prio(p); |
6159 | /* we are holding p->pi_lock already */ | |
6160 | p->prio = rt_mutex_getprio(p); | |
2dd73a4f | 6161 | set_load_weight(p); |
1da177e4 LT |
6162 | } |
6163 | ||
c69e8d9c DH |
6164 | /* |
6165 | * check the target process has a UID that matches the current process's | |
6166 | */ | |
6167 | static bool check_same_owner(struct task_struct *p) | |
6168 | { | |
6169 | const struct cred *cred = current_cred(), *pcred; | |
6170 | bool match; | |
6171 | ||
6172 | rcu_read_lock(); | |
6173 | pcred = __task_cred(p); | |
6174 | match = (cred->euid == pcred->euid || | |
6175 | cred->euid == pcred->uid); | |
6176 | rcu_read_unlock(); | |
6177 | return match; | |
6178 | } | |
6179 | ||
961ccddd RR |
6180 | static int __sched_setscheduler(struct task_struct *p, int policy, |
6181 | struct sched_param *param, bool user) | |
1da177e4 | 6182 | { |
83b699ed | 6183 | int retval, oldprio, oldpolicy = -1, on_rq, running; |
1da177e4 | 6184 | unsigned long flags; |
cb469845 | 6185 | const struct sched_class *prev_class = p->sched_class; |
70b97a7f | 6186 | struct rq *rq; |
ca94c442 | 6187 | int reset_on_fork; |
1da177e4 | 6188 | |
66e5393a SR |
6189 | /* may grab non-irq protected spin_locks */ |
6190 | BUG_ON(in_interrupt()); | |
1da177e4 LT |
6191 | recheck: |
6192 | /* double check policy once rq lock held */ | |
ca94c442 LP |
6193 | if (policy < 0) { |
6194 | reset_on_fork = p->sched_reset_on_fork; | |
1da177e4 | 6195 | policy = oldpolicy = p->policy; |
ca94c442 LP |
6196 | } else { |
6197 | reset_on_fork = !!(policy & SCHED_RESET_ON_FORK); | |
6198 | policy &= ~SCHED_RESET_ON_FORK; | |
6199 | ||
6200 | if (policy != SCHED_FIFO && policy != SCHED_RR && | |
6201 | policy != SCHED_NORMAL && policy != SCHED_BATCH && | |
6202 | policy != SCHED_IDLE) | |
6203 | return -EINVAL; | |
6204 | } | |
6205 | ||
1da177e4 LT |
6206 | /* |
6207 | * Valid priorities for SCHED_FIFO and SCHED_RR are | |
dd41f596 IM |
6208 | * 1..MAX_USER_RT_PRIO-1, valid priority for SCHED_NORMAL, |
6209 | * SCHED_BATCH and SCHED_IDLE is 0. | |
1da177e4 LT |
6210 | */ |
6211 | if (param->sched_priority < 0 || | |
95cdf3b7 | 6212 | (p->mm && param->sched_priority > MAX_USER_RT_PRIO-1) || |
d46523ea | 6213 | (!p->mm && param->sched_priority > MAX_RT_PRIO-1)) |
1da177e4 | 6214 | return -EINVAL; |
e05606d3 | 6215 | if (rt_policy(policy) != (param->sched_priority != 0)) |
1da177e4 LT |
6216 | return -EINVAL; |
6217 | ||
37e4ab3f OC |
6218 | /* |
6219 | * Allow unprivileged RT tasks to decrease priority: | |
6220 | */ | |
961ccddd | 6221 | if (user && !capable(CAP_SYS_NICE)) { |
e05606d3 | 6222 | if (rt_policy(policy)) { |
8dc3e909 | 6223 | unsigned long rlim_rtprio; |
8dc3e909 ON |
6224 | |
6225 | if (!lock_task_sighand(p, &flags)) | |
6226 | return -ESRCH; | |
6227 | rlim_rtprio = p->signal->rlim[RLIMIT_RTPRIO].rlim_cur; | |
6228 | unlock_task_sighand(p, &flags); | |
6229 | ||
6230 | /* can't set/change the rt policy */ | |
6231 | if (policy != p->policy && !rlim_rtprio) | |
6232 | return -EPERM; | |
6233 | ||
6234 | /* can't increase priority */ | |
6235 | if (param->sched_priority > p->rt_priority && | |
6236 | param->sched_priority > rlim_rtprio) | |
6237 | return -EPERM; | |
6238 | } | |
dd41f596 IM |
6239 | /* |
6240 | * Like positive nice levels, dont allow tasks to | |
6241 | * move out of SCHED_IDLE either: | |
6242 | */ | |
6243 | if (p->policy == SCHED_IDLE && policy != SCHED_IDLE) | |
6244 | return -EPERM; | |
5fe1d75f | 6245 | |
37e4ab3f | 6246 | /* can't change other user's priorities */ |
c69e8d9c | 6247 | if (!check_same_owner(p)) |
37e4ab3f | 6248 | return -EPERM; |
ca94c442 LP |
6249 | |
6250 | /* Normal users shall not reset the sched_reset_on_fork flag */ | |
6251 | if (p->sched_reset_on_fork && !reset_on_fork) | |
6252 | return -EPERM; | |
37e4ab3f | 6253 | } |
1da177e4 | 6254 | |
725aad24 | 6255 | if (user) { |
b68aa230 | 6256 | #ifdef CONFIG_RT_GROUP_SCHED |
725aad24 JF |
6257 | /* |
6258 | * Do not allow realtime tasks into groups that have no runtime | |
6259 | * assigned. | |
6260 | */ | |
9a7e0b18 PZ |
6261 | if (rt_bandwidth_enabled() && rt_policy(policy) && |
6262 | task_group(p)->rt_bandwidth.rt_runtime == 0) | |
725aad24 | 6263 | return -EPERM; |
b68aa230 PZ |
6264 | #endif |
6265 | ||
725aad24 JF |
6266 | retval = security_task_setscheduler(p, policy, param); |
6267 | if (retval) | |
6268 | return retval; | |
6269 | } | |
6270 | ||
b29739f9 IM |
6271 | /* |
6272 | * make sure no PI-waiters arrive (or leave) while we are | |
6273 | * changing the priority of the task: | |
6274 | */ | |
6275 | spin_lock_irqsave(&p->pi_lock, flags); | |
1da177e4 LT |
6276 | /* |
6277 | * To be able to change p->policy safely, the apropriate | |
6278 | * runqueue lock must be held. | |
6279 | */ | |
b29739f9 | 6280 | rq = __task_rq_lock(p); |
1da177e4 LT |
6281 | /* recheck policy now with rq lock held */ |
6282 | if (unlikely(oldpolicy != -1 && oldpolicy != p->policy)) { | |
6283 | policy = oldpolicy = -1; | |
b29739f9 IM |
6284 | __task_rq_unlock(rq); |
6285 | spin_unlock_irqrestore(&p->pi_lock, flags); | |
1da177e4 LT |
6286 | goto recheck; |
6287 | } | |
2daa3577 | 6288 | update_rq_clock(rq); |
dd41f596 | 6289 | on_rq = p->se.on_rq; |
051a1d1a | 6290 | running = task_current(rq, p); |
0e1f3483 | 6291 | if (on_rq) |
2e1cb74a | 6292 | deactivate_task(rq, p, 0); |
0e1f3483 HS |
6293 | if (running) |
6294 | p->sched_class->put_prev_task(rq, p); | |
f6b53205 | 6295 | |
ca94c442 LP |
6296 | p->sched_reset_on_fork = reset_on_fork; |
6297 | ||
1da177e4 | 6298 | oldprio = p->prio; |
dd41f596 | 6299 | __setscheduler(rq, p, policy, param->sched_priority); |
f6b53205 | 6300 | |
0e1f3483 HS |
6301 | if (running) |
6302 | p->sched_class->set_curr_task(rq); | |
dd41f596 IM |
6303 | if (on_rq) { |
6304 | activate_task(rq, p, 0); | |
cb469845 SR |
6305 | |
6306 | check_class_changed(rq, p, prev_class, oldprio, running); | |
1da177e4 | 6307 | } |
b29739f9 IM |
6308 | __task_rq_unlock(rq); |
6309 | spin_unlock_irqrestore(&p->pi_lock, flags); | |
6310 | ||
95e02ca9 TG |
6311 | rt_mutex_adjust_pi(p); |
6312 | ||
1da177e4 LT |
6313 | return 0; |
6314 | } | |
961ccddd RR |
6315 | |
6316 | /** | |
6317 | * sched_setscheduler - change the scheduling policy and/or RT priority of a thread. | |
6318 | * @p: the task in question. | |
6319 | * @policy: new policy. | |
6320 | * @param: structure containing the new RT priority. | |
6321 | * | |
6322 | * NOTE that the task may be already dead. | |
6323 | */ | |
6324 | int sched_setscheduler(struct task_struct *p, int policy, | |
6325 | struct sched_param *param) | |
6326 | { | |
6327 | return __sched_setscheduler(p, policy, param, true); | |
6328 | } | |
1da177e4 LT |
6329 | EXPORT_SYMBOL_GPL(sched_setscheduler); |
6330 | ||
961ccddd RR |
6331 | /** |
6332 | * sched_setscheduler_nocheck - change the scheduling policy and/or RT priority of a thread from kernelspace. | |
6333 | * @p: the task in question. | |
6334 | * @policy: new policy. | |
6335 | * @param: structure containing the new RT priority. | |
6336 | * | |
6337 | * Just like sched_setscheduler, only don't bother checking if the | |
6338 | * current context has permission. For example, this is needed in | |
6339 | * stop_machine(): we create temporary high priority worker threads, | |
6340 | * but our caller might not have that capability. | |
6341 | */ | |
6342 | int sched_setscheduler_nocheck(struct task_struct *p, int policy, | |
6343 | struct sched_param *param) | |
6344 | { | |
6345 | return __sched_setscheduler(p, policy, param, false); | |
6346 | } | |
6347 | ||
95cdf3b7 IM |
6348 | static int |
6349 | do_sched_setscheduler(pid_t pid, int policy, struct sched_param __user *param) | |
1da177e4 | 6350 | { |
1da177e4 LT |
6351 | struct sched_param lparam; |
6352 | struct task_struct *p; | |
36c8b586 | 6353 | int retval; |
1da177e4 LT |
6354 | |
6355 | if (!param || pid < 0) | |
6356 | return -EINVAL; | |
6357 | if (copy_from_user(&lparam, param, sizeof(struct sched_param))) | |
6358 | return -EFAULT; | |
5fe1d75f ON |
6359 | |
6360 | rcu_read_lock(); | |
6361 | retval = -ESRCH; | |
1da177e4 | 6362 | p = find_process_by_pid(pid); |
5fe1d75f ON |
6363 | if (p != NULL) |
6364 | retval = sched_setscheduler(p, policy, &lparam); | |
6365 | rcu_read_unlock(); | |
36c8b586 | 6366 | |
1da177e4 LT |
6367 | return retval; |
6368 | } | |
6369 | ||
6370 | /** | |
6371 | * sys_sched_setscheduler - set/change the scheduler policy and RT priority | |
6372 | * @pid: the pid in question. | |
6373 | * @policy: new policy. | |
6374 | * @param: structure containing the new RT priority. | |
6375 | */ | |
5add95d4 HC |
6376 | SYSCALL_DEFINE3(sched_setscheduler, pid_t, pid, int, policy, |
6377 | struct sched_param __user *, param) | |
1da177e4 | 6378 | { |
c21761f1 JB |
6379 | /* negative values for policy are not valid */ |
6380 | if (policy < 0) | |
6381 | return -EINVAL; | |
6382 | ||
1da177e4 LT |
6383 | return do_sched_setscheduler(pid, policy, param); |
6384 | } | |
6385 | ||
6386 | /** | |
6387 | * sys_sched_setparam - set/change the RT priority of a thread | |
6388 | * @pid: the pid in question. | |
6389 | * @param: structure containing the new RT priority. | |
6390 | */ | |
5add95d4 | 6391 | SYSCALL_DEFINE2(sched_setparam, pid_t, pid, struct sched_param __user *, param) |
1da177e4 LT |
6392 | { |
6393 | return do_sched_setscheduler(pid, -1, param); | |
6394 | } | |
6395 | ||
6396 | /** | |
6397 | * sys_sched_getscheduler - get the policy (scheduling class) of a thread | |
6398 | * @pid: the pid in question. | |
6399 | */ | |
5add95d4 | 6400 | SYSCALL_DEFINE1(sched_getscheduler, pid_t, pid) |
1da177e4 | 6401 | { |
36c8b586 | 6402 | struct task_struct *p; |
3a5c359a | 6403 | int retval; |
1da177e4 LT |
6404 | |
6405 | if (pid < 0) | |
3a5c359a | 6406 | return -EINVAL; |
1da177e4 LT |
6407 | |
6408 | retval = -ESRCH; | |
6409 | read_lock(&tasklist_lock); | |
6410 | p = find_process_by_pid(pid); | |
6411 | if (p) { | |
6412 | retval = security_task_getscheduler(p); | |
6413 | if (!retval) | |
ca94c442 LP |
6414 | retval = p->policy |
6415 | | (p->sched_reset_on_fork ? SCHED_RESET_ON_FORK : 0); | |
1da177e4 LT |
6416 | } |
6417 | read_unlock(&tasklist_lock); | |
1da177e4 LT |
6418 | return retval; |
6419 | } | |
6420 | ||
6421 | /** | |
ca94c442 | 6422 | * sys_sched_getparam - get the RT priority of a thread |
1da177e4 LT |
6423 | * @pid: the pid in question. |
6424 | * @param: structure containing the RT priority. | |
6425 | */ | |
5add95d4 | 6426 | SYSCALL_DEFINE2(sched_getparam, pid_t, pid, struct sched_param __user *, param) |
1da177e4 LT |
6427 | { |
6428 | struct sched_param lp; | |
36c8b586 | 6429 | struct task_struct *p; |
3a5c359a | 6430 | int retval; |
1da177e4 LT |
6431 | |
6432 | if (!param || pid < 0) | |
3a5c359a | 6433 | return -EINVAL; |
1da177e4 LT |
6434 | |
6435 | read_lock(&tasklist_lock); | |
6436 | p = find_process_by_pid(pid); | |
6437 | retval = -ESRCH; | |
6438 | if (!p) | |
6439 | goto out_unlock; | |
6440 | ||
6441 | retval = security_task_getscheduler(p); | |
6442 | if (retval) | |
6443 | goto out_unlock; | |
6444 | ||
6445 | lp.sched_priority = p->rt_priority; | |
6446 | read_unlock(&tasklist_lock); | |
6447 | ||
6448 | /* | |
6449 | * This one might sleep, we cannot do it with a spinlock held ... | |
6450 | */ | |
6451 | retval = copy_to_user(param, &lp, sizeof(*param)) ? -EFAULT : 0; | |
6452 | ||
1da177e4 LT |
6453 | return retval; |
6454 | ||
6455 | out_unlock: | |
6456 | read_unlock(&tasklist_lock); | |
6457 | return retval; | |
6458 | } | |
6459 | ||
96f874e2 | 6460 | long sched_setaffinity(pid_t pid, const struct cpumask *in_mask) |
1da177e4 | 6461 | { |
5a16f3d3 | 6462 | cpumask_var_t cpus_allowed, new_mask; |
36c8b586 IM |
6463 | struct task_struct *p; |
6464 | int retval; | |
1da177e4 | 6465 | |
95402b38 | 6466 | get_online_cpus(); |
1da177e4 LT |
6467 | read_lock(&tasklist_lock); |
6468 | ||
6469 | p = find_process_by_pid(pid); | |
6470 | if (!p) { | |
6471 | read_unlock(&tasklist_lock); | |
95402b38 | 6472 | put_online_cpus(); |
1da177e4 LT |
6473 | return -ESRCH; |
6474 | } | |
6475 | ||
6476 | /* | |
6477 | * It is not safe to call set_cpus_allowed with the | |
41a2d6cf | 6478 | * tasklist_lock held. We will bump the task_struct's |
1da177e4 LT |
6479 | * usage count and then drop tasklist_lock. |
6480 | */ | |
6481 | get_task_struct(p); | |
6482 | read_unlock(&tasklist_lock); | |
6483 | ||
5a16f3d3 RR |
6484 | if (!alloc_cpumask_var(&cpus_allowed, GFP_KERNEL)) { |
6485 | retval = -ENOMEM; | |
6486 | goto out_put_task; | |
6487 | } | |
6488 | if (!alloc_cpumask_var(&new_mask, GFP_KERNEL)) { | |
6489 | retval = -ENOMEM; | |
6490 | goto out_free_cpus_allowed; | |
6491 | } | |
1da177e4 | 6492 | retval = -EPERM; |
c69e8d9c | 6493 | if (!check_same_owner(p) && !capable(CAP_SYS_NICE)) |
1da177e4 LT |
6494 | goto out_unlock; |
6495 | ||
e7834f8f DQ |
6496 | retval = security_task_setscheduler(p, 0, NULL); |
6497 | if (retval) | |
6498 | goto out_unlock; | |
6499 | ||
5a16f3d3 RR |
6500 | cpuset_cpus_allowed(p, cpus_allowed); |
6501 | cpumask_and(new_mask, in_mask, cpus_allowed); | |
8707d8b8 | 6502 | again: |
5a16f3d3 | 6503 | retval = set_cpus_allowed_ptr(p, new_mask); |
1da177e4 | 6504 | |
8707d8b8 | 6505 | if (!retval) { |
5a16f3d3 RR |
6506 | cpuset_cpus_allowed(p, cpus_allowed); |
6507 | if (!cpumask_subset(new_mask, cpus_allowed)) { | |
8707d8b8 PM |
6508 | /* |
6509 | * We must have raced with a concurrent cpuset | |
6510 | * update. Just reset the cpus_allowed to the | |
6511 | * cpuset's cpus_allowed | |
6512 | */ | |
5a16f3d3 | 6513 | cpumask_copy(new_mask, cpus_allowed); |
8707d8b8 PM |
6514 | goto again; |
6515 | } | |
6516 | } | |
1da177e4 | 6517 | out_unlock: |
5a16f3d3 RR |
6518 | free_cpumask_var(new_mask); |
6519 | out_free_cpus_allowed: | |
6520 | free_cpumask_var(cpus_allowed); | |
6521 | out_put_task: | |
1da177e4 | 6522 | put_task_struct(p); |
95402b38 | 6523 | put_online_cpus(); |
1da177e4 LT |
6524 | return retval; |
6525 | } | |
6526 | ||
6527 | static int get_user_cpu_mask(unsigned long __user *user_mask_ptr, unsigned len, | |
96f874e2 | 6528 | struct cpumask *new_mask) |
1da177e4 | 6529 | { |
96f874e2 RR |
6530 | if (len < cpumask_size()) |
6531 | cpumask_clear(new_mask); | |
6532 | else if (len > cpumask_size()) | |
6533 | len = cpumask_size(); | |
6534 | ||
1da177e4 LT |
6535 | return copy_from_user(new_mask, user_mask_ptr, len) ? -EFAULT : 0; |
6536 | } | |
6537 | ||
6538 | /** | |
6539 | * sys_sched_setaffinity - set the cpu affinity of a process | |
6540 | * @pid: pid of the process | |
6541 | * @len: length in bytes of the bitmask pointed to by user_mask_ptr | |
6542 | * @user_mask_ptr: user-space pointer to the new cpu mask | |
6543 | */ | |
5add95d4 HC |
6544 | SYSCALL_DEFINE3(sched_setaffinity, pid_t, pid, unsigned int, len, |
6545 | unsigned long __user *, user_mask_ptr) | |
1da177e4 | 6546 | { |
5a16f3d3 | 6547 | cpumask_var_t new_mask; |
1da177e4 LT |
6548 | int retval; |
6549 | ||
5a16f3d3 RR |
6550 | if (!alloc_cpumask_var(&new_mask, GFP_KERNEL)) |
6551 | return -ENOMEM; | |
1da177e4 | 6552 | |
5a16f3d3 RR |
6553 | retval = get_user_cpu_mask(user_mask_ptr, len, new_mask); |
6554 | if (retval == 0) | |
6555 | retval = sched_setaffinity(pid, new_mask); | |
6556 | free_cpumask_var(new_mask); | |
6557 | return retval; | |
1da177e4 LT |
6558 | } |
6559 | ||
96f874e2 | 6560 | long sched_getaffinity(pid_t pid, struct cpumask *mask) |
1da177e4 | 6561 | { |
36c8b586 | 6562 | struct task_struct *p; |
1da177e4 | 6563 | int retval; |
1da177e4 | 6564 | |
95402b38 | 6565 | get_online_cpus(); |
1da177e4 LT |
6566 | read_lock(&tasklist_lock); |
6567 | ||
6568 | retval = -ESRCH; | |
6569 | p = find_process_by_pid(pid); | |
6570 | if (!p) | |
6571 | goto out_unlock; | |
6572 | ||
e7834f8f DQ |
6573 | retval = security_task_getscheduler(p); |
6574 | if (retval) | |
6575 | goto out_unlock; | |
6576 | ||
96f874e2 | 6577 | cpumask_and(mask, &p->cpus_allowed, cpu_online_mask); |
1da177e4 LT |
6578 | |
6579 | out_unlock: | |
6580 | read_unlock(&tasklist_lock); | |
95402b38 | 6581 | put_online_cpus(); |
1da177e4 | 6582 | |
9531b62f | 6583 | return retval; |
1da177e4 LT |
6584 | } |
6585 | ||
6586 | /** | |
6587 | * sys_sched_getaffinity - get the cpu affinity of a process | |
6588 | * @pid: pid of the process | |
6589 | * @len: length in bytes of the bitmask pointed to by user_mask_ptr | |
6590 | * @user_mask_ptr: user-space pointer to hold the current cpu mask | |
6591 | */ | |
5add95d4 HC |
6592 | SYSCALL_DEFINE3(sched_getaffinity, pid_t, pid, unsigned int, len, |
6593 | unsigned long __user *, user_mask_ptr) | |
1da177e4 LT |
6594 | { |
6595 | int ret; | |
f17c8607 | 6596 | cpumask_var_t mask; |
1da177e4 | 6597 | |
f17c8607 | 6598 | if (len < cpumask_size()) |
1da177e4 LT |
6599 | return -EINVAL; |
6600 | ||
f17c8607 RR |
6601 | if (!alloc_cpumask_var(&mask, GFP_KERNEL)) |
6602 | return -ENOMEM; | |
1da177e4 | 6603 | |
f17c8607 RR |
6604 | ret = sched_getaffinity(pid, mask); |
6605 | if (ret == 0) { | |
6606 | if (copy_to_user(user_mask_ptr, mask, cpumask_size())) | |
6607 | ret = -EFAULT; | |
6608 | else | |
6609 | ret = cpumask_size(); | |
6610 | } | |
6611 | free_cpumask_var(mask); | |
1da177e4 | 6612 | |
f17c8607 | 6613 | return ret; |
1da177e4 LT |
6614 | } |
6615 | ||
6616 | /** | |
6617 | * sys_sched_yield - yield the current processor to other threads. | |
6618 | * | |
dd41f596 IM |
6619 | * This function yields the current CPU to other tasks. If there are no |
6620 | * other threads running on this CPU then this function will return. | |
1da177e4 | 6621 | */ |
5add95d4 | 6622 | SYSCALL_DEFINE0(sched_yield) |
1da177e4 | 6623 | { |
70b97a7f | 6624 | struct rq *rq = this_rq_lock(); |
1da177e4 | 6625 | |
2d72376b | 6626 | schedstat_inc(rq, yld_count); |
4530d7ab | 6627 | current->sched_class->yield_task(rq); |
1da177e4 LT |
6628 | |
6629 | /* | |
6630 | * Since we are going to call schedule() anyway, there's | |
6631 | * no need to preempt or enable interrupts: | |
6632 | */ | |
6633 | __release(rq->lock); | |
8a25d5de | 6634 | spin_release(&rq->lock.dep_map, 1, _THIS_IP_); |
1da177e4 LT |
6635 | _raw_spin_unlock(&rq->lock); |
6636 | preempt_enable_no_resched(); | |
6637 | ||
6638 | schedule(); | |
6639 | ||
6640 | return 0; | |
6641 | } | |
6642 | ||
d86ee480 PZ |
6643 | static inline int should_resched(void) |
6644 | { | |
6645 | return need_resched() && !(preempt_count() & PREEMPT_ACTIVE); | |
6646 | } | |
6647 | ||
e7b38404 | 6648 | static void __cond_resched(void) |
1da177e4 | 6649 | { |
e7aaaa69 FW |
6650 | add_preempt_count(PREEMPT_ACTIVE); |
6651 | schedule(); | |
6652 | sub_preempt_count(PREEMPT_ACTIVE); | |
1da177e4 LT |
6653 | } |
6654 | ||
02b67cc3 | 6655 | int __sched _cond_resched(void) |
1da177e4 | 6656 | { |
d86ee480 | 6657 | if (should_resched()) { |
1da177e4 LT |
6658 | __cond_resched(); |
6659 | return 1; | |
6660 | } | |
6661 | return 0; | |
6662 | } | |
02b67cc3 | 6663 | EXPORT_SYMBOL(_cond_resched); |
1da177e4 LT |
6664 | |
6665 | /* | |
613afbf8 | 6666 | * __cond_resched_lock() - if a reschedule is pending, drop the given lock, |
1da177e4 LT |
6667 | * call schedule, and on return reacquire the lock. |
6668 | * | |
41a2d6cf | 6669 | * This works OK both with and without CONFIG_PREEMPT. We do strange low-level |
1da177e4 LT |
6670 | * operations here to prevent schedule() from being called twice (once via |
6671 | * spin_unlock(), once by hand). | |
6672 | */ | |
613afbf8 | 6673 | int __cond_resched_lock(spinlock_t *lock) |
1da177e4 | 6674 | { |
d86ee480 | 6675 | int resched = should_resched(); |
6df3cecb JK |
6676 | int ret = 0; |
6677 | ||
f607c668 PZ |
6678 | lockdep_assert_held(lock); |
6679 | ||
95c354fe | 6680 | if (spin_needbreak(lock) || resched) { |
1da177e4 | 6681 | spin_unlock(lock); |
d86ee480 | 6682 | if (resched) |
95c354fe NP |
6683 | __cond_resched(); |
6684 | else | |
6685 | cpu_relax(); | |
6df3cecb | 6686 | ret = 1; |
1da177e4 | 6687 | spin_lock(lock); |
1da177e4 | 6688 | } |
6df3cecb | 6689 | return ret; |
1da177e4 | 6690 | } |
613afbf8 | 6691 | EXPORT_SYMBOL(__cond_resched_lock); |
1da177e4 | 6692 | |
613afbf8 | 6693 | int __sched __cond_resched_softirq(void) |
1da177e4 LT |
6694 | { |
6695 | BUG_ON(!in_softirq()); | |
6696 | ||
d86ee480 | 6697 | if (should_resched()) { |
98d82567 | 6698 | local_bh_enable(); |
1da177e4 LT |
6699 | __cond_resched(); |
6700 | local_bh_disable(); | |
6701 | return 1; | |
6702 | } | |
6703 | return 0; | |
6704 | } | |
613afbf8 | 6705 | EXPORT_SYMBOL(__cond_resched_softirq); |
1da177e4 | 6706 | |
1da177e4 LT |
6707 | /** |
6708 | * yield - yield the current processor to other threads. | |
6709 | * | |
72fd4a35 | 6710 | * This is a shortcut for kernel-space yielding - it marks the |
1da177e4 LT |
6711 | * thread runnable and calls sys_sched_yield(). |
6712 | */ | |
6713 | void __sched yield(void) | |
6714 | { | |
6715 | set_current_state(TASK_RUNNING); | |
6716 | sys_sched_yield(); | |
6717 | } | |
1da177e4 LT |
6718 | EXPORT_SYMBOL(yield); |
6719 | ||
6720 | /* | |
41a2d6cf | 6721 | * This task is about to go to sleep on IO. Increment rq->nr_iowait so |
1da177e4 LT |
6722 | * that process accounting knows that this is a task in IO wait state. |
6723 | * | |
6724 | * But don't do that if it is a deliberate, throttling IO wait (this task | |
6725 | * has set its backing_dev_info: the queue against which it should throttle) | |
6726 | */ | |
6727 | void __sched io_schedule(void) | |
6728 | { | |
54d35f29 | 6729 | struct rq *rq = raw_rq(); |
1da177e4 | 6730 | |
0ff92245 | 6731 | delayacct_blkio_start(); |
1da177e4 | 6732 | atomic_inc(&rq->nr_iowait); |
8f0dfc34 | 6733 | current->in_iowait = 1; |
1da177e4 | 6734 | schedule(); |
8f0dfc34 | 6735 | current->in_iowait = 0; |
1da177e4 | 6736 | atomic_dec(&rq->nr_iowait); |
0ff92245 | 6737 | delayacct_blkio_end(); |
1da177e4 | 6738 | } |
1da177e4 LT |
6739 | EXPORT_SYMBOL(io_schedule); |
6740 | ||
6741 | long __sched io_schedule_timeout(long timeout) | |
6742 | { | |
54d35f29 | 6743 | struct rq *rq = raw_rq(); |
1da177e4 LT |
6744 | long ret; |
6745 | ||
0ff92245 | 6746 | delayacct_blkio_start(); |
1da177e4 | 6747 | atomic_inc(&rq->nr_iowait); |
8f0dfc34 | 6748 | current->in_iowait = 1; |
1da177e4 | 6749 | ret = schedule_timeout(timeout); |
8f0dfc34 | 6750 | current->in_iowait = 0; |
1da177e4 | 6751 | atomic_dec(&rq->nr_iowait); |
0ff92245 | 6752 | delayacct_blkio_end(); |
1da177e4 LT |
6753 | return ret; |
6754 | } | |
6755 | ||
6756 | /** | |
6757 | * sys_sched_get_priority_max - return maximum RT priority. | |
6758 | * @policy: scheduling class. | |
6759 | * | |
6760 | * this syscall returns the maximum rt_priority that can be used | |
6761 | * by a given scheduling class. | |
6762 | */ | |
5add95d4 | 6763 | SYSCALL_DEFINE1(sched_get_priority_max, int, policy) |
1da177e4 LT |
6764 | { |
6765 | int ret = -EINVAL; | |
6766 | ||
6767 | switch (policy) { | |
6768 | case SCHED_FIFO: | |
6769 | case SCHED_RR: | |
6770 | ret = MAX_USER_RT_PRIO-1; | |
6771 | break; | |
6772 | case SCHED_NORMAL: | |
b0a9499c | 6773 | case SCHED_BATCH: |
dd41f596 | 6774 | case SCHED_IDLE: |
1da177e4 LT |
6775 | ret = 0; |
6776 | break; | |
6777 | } | |
6778 | return ret; | |
6779 | } | |
6780 | ||
6781 | /** | |
6782 | * sys_sched_get_priority_min - return minimum RT priority. | |
6783 | * @policy: scheduling class. | |
6784 | * | |
6785 | * this syscall returns the minimum rt_priority that can be used | |
6786 | * by a given scheduling class. | |
6787 | */ | |
5add95d4 | 6788 | SYSCALL_DEFINE1(sched_get_priority_min, int, policy) |
1da177e4 LT |
6789 | { |
6790 | int ret = -EINVAL; | |
6791 | ||
6792 | switch (policy) { | |
6793 | case SCHED_FIFO: | |
6794 | case SCHED_RR: | |
6795 | ret = 1; | |
6796 | break; | |
6797 | case SCHED_NORMAL: | |
b0a9499c | 6798 | case SCHED_BATCH: |
dd41f596 | 6799 | case SCHED_IDLE: |
1da177e4 LT |
6800 | ret = 0; |
6801 | } | |
6802 | return ret; | |
6803 | } | |
6804 | ||
6805 | /** | |
6806 | * sys_sched_rr_get_interval - return the default timeslice of a process. | |
6807 | * @pid: pid of the process. | |
6808 | * @interval: userspace pointer to the timeslice value. | |
6809 | * | |
6810 | * this syscall writes the default timeslice value of a given process | |
6811 | * into the user-space timespec buffer. A value of '0' means infinity. | |
6812 | */ | |
17da2bd9 | 6813 | SYSCALL_DEFINE2(sched_rr_get_interval, pid_t, pid, |
754fe8d2 | 6814 | struct timespec __user *, interval) |
1da177e4 | 6815 | { |
36c8b586 | 6816 | struct task_struct *p; |
a4ec24b4 | 6817 | unsigned int time_slice; |
3a5c359a | 6818 | int retval; |
1da177e4 | 6819 | struct timespec t; |
1da177e4 LT |
6820 | |
6821 | if (pid < 0) | |
3a5c359a | 6822 | return -EINVAL; |
1da177e4 LT |
6823 | |
6824 | retval = -ESRCH; | |
6825 | read_lock(&tasklist_lock); | |
6826 | p = find_process_by_pid(pid); | |
6827 | if (!p) | |
6828 | goto out_unlock; | |
6829 | ||
6830 | retval = security_task_getscheduler(p); | |
6831 | if (retval) | |
6832 | goto out_unlock; | |
6833 | ||
0d721cea | 6834 | time_slice = p->sched_class->get_rr_interval(p); |
a4ec24b4 | 6835 | |
1da177e4 | 6836 | read_unlock(&tasklist_lock); |
a4ec24b4 | 6837 | jiffies_to_timespec(time_slice, &t); |
1da177e4 | 6838 | retval = copy_to_user(interval, &t, sizeof(t)) ? -EFAULT : 0; |
1da177e4 | 6839 | return retval; |
3a5c359a | 6840 | |
1da177e4 LT |
6841 | out_unlock: |
6842 | read_unlock(&tasklist_lock); | |
6843 | return retval; | |
6844 | } | |
6845 | ||
7c731e0a | 6846 | static const char stat_nam[] = TASK_STATE_TO_CHAR_STR; |
36c8b586 | 6847 | |
82a1fcb9 | 6848 | void sched_show_task(struct task_struct *p) |
1da177e4 | 6849 | { |
1da177e4 | 6850 | unsigned long free = 0; |
36c8b586 | 6851 | unsigned state; |
1da177e4 | 6852 | |
1da177e4 | 6853 | state = p->state ? __ffs(p->state) + 1 : 0; |
cc4ea795 | 6854 | printk(KERN_INFO "%-13.13s %c", p->comm, |
2ed6e34f | 6855 | state < sizeof(stat_nam) - 1 ? stat_nam[state] : '?'); |
4bd77321 | 6856 | #if BITS_PER_LONG == 32 |
1da177e4 | 6857 | if (state == TASK_RUNNING) |
cc4ea795 | 6858 | printk(KERN_CONT " running "); |
1da177e4 | 6859 | else |
cc4ea795 | 6860 | printk(KERN_CONT " %08lx ", thread_saved_pc(p)); |
1da177e4 LT |
6861 | #else |
6862 | if (state == TASK_RUNNING) | |
cc4ea795 | 6863 | printk(KERN_CONT " running task "); |
1da177e4 | 6864 | else |
cc4ea795 | 6865 | printk(KERN_CONT " %016lx ", thread_saved_pc(p)); |
1da177e4 LT |
6866 | #endif |
6867 | #ifdef CONFIG_DEBUG_STACK_USAGE | |
7c9f8861 | 6868 | free = stack_not_used(p); |
1da177e4 | 6869 | #endif |
aa47b7e0 DR |
6870 | printk(KERN_CONT "%5lu %5d %6d 0x%08lx\n", free, |
6871 | task_pid_nr(p), task_pid_nr(p->real_parent), | |
6872 | (unsigned long)task_thread_info(p)->flags); | |
1da177e4 | 6873 | |
5fb5e6de | 6874 | show_stack(p, NULL); |
1da177e4 LT |
6875 | } |
6876 | ||
e59e2ae2 | 6877 | void show_state_filter(unsigned long state_filter) |
1da177e4 | 6878 | { |
36c8b586 | 6879 | struct task_struct *g, *p; |
1da177e4 | 6880 | |
4bd77321 IM |
6881 | #if BITS_PER_LONG == 32 |
6882 | printk(KERN_INFO | |
6883 | " task PC stack pid father\n"); | |
1da177e4 | 6884 | #else |
4bd77321 IM |
6885 | printk(KERN_INFO |
6886 | " task PC stack pid father\n"); | |
1da177e4 LT |
6887 | #endif |
6888 | read_lock(&tasklist_lock); | |
6889 | do_each_thread(g, p) { | |
6890 | /* | |
6891 | * reset the NMI-timeout, listing all files on a slow | |
6892 | * console might take alot of time: | |
6893 | */ | |
6894 | touch_nmi_watchdog(); | |
39bc89fd | 6895 | if (!state_filter || (p->state & state_filter)) |
82a1fcb9 | 6896 | sched_show_task(p); |
1da177e4 LT |
6897 | } while_each_thread(g, p); |
6898 | ||
04c9167f JF |
6899 | touch_all_softlockup_watchdogs(); |
6900 | ||
dd41f596 IM |
6901 | #ifdef CONFIG_SCHED_DEBUG |
6902 | sysrq_sched_debug_show(); | |
6903 | #endif | |
1da177e4 | 6904 | read_unlock(&tasklist_lock); |
e59e2ae2 IM |
6905 | /* |
6906 | * Only show locks if all tasks are dumped: | |
6907 | */ | |
6908 | if (state_filter == -1) | |
6909 | debug_show_all_locks(); | |
1da177e4 LT |
6910 | } |
6911 | ||
1df21055 IM |
6912 | void __cpuinit init_idle_bootup_task(struct task_struct *idle) |
6913 | { | |
dd41f596 | 6914 | idle->sched_class = &idle_sched_class; |
1df21055 IM |
6915 | } |
6916 | ||
f340c0d1 IM |
6917 | /** |
6918 | * init_idle - set up an idle thread for a given CPU | |
6919 | * @idle: task in question | |
6920 | * @cpu: cpu the idle task belongs to | |
6921 | * | |
6922 | * NOTE: this function does not set the idle thread's NEED_RESCHED | |
6923 | * flag, to make booting more robust. | |
6924 | */ | |
5c1e1767 | 6925 | void __cpuinit init_idle(struct task_struct *idle, int cpu) |
1da177e4 | 6926 | { |
70b97a7f | 6927 | struct rq *rq = cpu_rq(cpu); |
1da177e4 LT |
6928 | unsigned long flags; |
6929 | ||
5cbd54ef IM |
6930 | spin_lock_irqsave(&rq->lock, flags); |
6931 | ||
dd41f596 IM |
6932 | __sched_fork(idle); |
6933 | idle->se.exec_start = sched_clock(); | |
6934 | ||
b29739f9 | 6935 | idle->prio = idle->normal_prio = MAX_PRIO; |
96f874e2 | 6936 | cpumask_copy(&idle->cpus_allowed, cpumask_of(cpu)); |
dd41f596 | 6937 | __set_task_cpu(idle, cpu); |
1da177e4 | 6938 | |
1da177e4 | 6939 | rq->curr = rq->idle = idle; |
4866cde0 NP |
6940 | #if defined(CONFIG_SMP) && defined(__ARCH_WANT_UNLOCKED_CTXSW) |
6941 | idle->oncpu = 1; | |
6942 | #endif | |
1da177e4 LT |
6943 | spin_unlock_irqrestore(&rq->lock, flags); |
6944 | ||
6945 | /* Set the preempt count _outside_ the spinlocks! */ | |
8e3e076c LT |
6946 | #if defined(CONFIG_PREEMPT) |
6947 | task_thread_info(idle)->preempt_count = (idle->lock_depth >= 0); | |
6948 | #else | |
a1261f54 | 6949 | task_thread_info(idle)->preempt_count = 0; |
8e3e076c | 6950 | #endif |
dd41f596 IM |
6951 | /* |
6952 | * The idle tasks have their own, simple scheduling class: | |
6953 | */ | |
6954 | idle->sched_class = &idle_sched_class; | |
fb52607a | 6955 | ftrace_graph_init_task(idle); |
1da177e4 LT |
6956 | } |
6957 | ||
6958 | /* | |
6959 | * In a system that switches off the HZ timer nohz_cpu_mask | |
6960 | * indicates which cpus entered this state. This is used | |
6961 | * in the rcu update to wait only for active cpus. For system | |
6962 | * which do not switch off the HZ timer nohz_cpu_mask should | |
6a7b3dc3 | 6963 | * always be CPU_BITS_NONE. |
1da177e4 | 6964 | */ |
6a7b3dc3 | 6965 | cpumask_var_t nohz_cpu_mask; |
1da177e4 | 6966 | |
19978ca6 IM |
6967 | /* |
6968 | * Increase the granularity value when there are more CPUs, | |
6969 | * because with more CPUs the 'effective latency' as visible | |
6970 | * to users decreases. But the relationship is not linear, | |
6971 | * so pick a second-best guess by going with the log2 of the | |
6972 | * number of CPUs. | |
6973 | * | |
6974 | * This idea comes from the SD scheduler of Con Kolivas: | |
6975 | */ | |
6976 | static inline void sched_init_granularity(void) | |
6977 | { | |
6978 | unsigned int factor = 1 + ilog2(num_online_cpus()); | |
6979 | const unsigned long limit = 200000000; | |
6980 | ||
6981 | sysctl_sched_min_granularity *= factor; | |
6982 | if (sysctl_sched_min_granularity > limit) | |
6983 | sysctl_sched_min_granularity = limit; | |
6984 | ||
6985 | sysctl_sched_latency *= factor; | |
6986 | if (sysctl_sched_latency > limit) | |
6987 | sysctl_sched_latency = limit; | |
6988 | ||
6989 | sysctl_sched_wakeup_granularity *= factor; | |
55cd5340 PZ |
6990 | |
6991 | sysctl_sched_shares_ratelimit *= factor; | |
19978ca6 IM |
6992 | } |
6993 | ||
1da177e4 LT |
6994 | #ifdef CONFIG_SMP |
6995 | /* | |
6996 | * This is how migration works: | |
6997 | * | |
70b97a7f | 6998 | * 1) we queue a struct migration_req structure in the source CPU's |
1da177e4 LT |
6999 | * runqueue and wake up that CPU's migration thread. |
7000 | * 2) we down() the locked semaphore => thread blocks. | |
7001 | * 3) migration thread wakes up (implicitly it forces the migrated | |
7002 | * thread off the CPU) | |
7003 | * 4) it gets the migration request and checks whether the migrated | |
7004 | * task is still in the wrong runqueue. | |
7005 | * 5) if it's in the wrong runqueue then the migration thread removes | |
7006 | * it and puts it into the right queue. | |
7007 | * 6) migration thread up()s the semaphore. | |
7008 | * 7) we wake up and the migration is done. | |
7009 | */ | |
7010 | ||
7011 | /* | |
7012 | * Change a given task's CPU affinity. Migrate the thread to a | |
7013 | * proper CPU and schedule it away if the CPU it's executing on | |
7014 | * is removed from the allowed bitmask. | |
7015 | * | |
7016 | * NOTE: the caller must have a valid reference to the task, the | |
41a2d6cf | 7017 | * task must not exit() & deallocate itself prematurely. The |
1da177e4 LT |
7018 | * call is not atomic; no spinlocks may be held. |
7019 | */ | |
96f874e2 | 7020 | int set_cpus_allowed_ptr(struct task_struct *p, const struct cpumask *new_mask) |
1da177e4 | 7021 | { |
70b97a7f | 7022 | struct migration_req req; |
1da177e4 | 7023 | unsigned long flags; |
70b97a7f | 7024 | struct rq *rq; |
48f24c4d | 7025 | int ret = 0; |
1da177e4 LT |
7026 | |
7027 | rq = task_rq_lock(p, &flags); | |
96f874e2 | 7028 | if (!cpumask_intersects(new_mask, cpu_online_mask)) { |
1da177e4 LT |
7029 | ret = -EINVAL; |
7030 | goto out; | |
7031 | } | |
7032 | ||
9985b0ba | 7033 | if (unlikely((p->flags & PF_THREAD_BOUND) && p != current && |
96f874e2 | 7034 | !cpumask_equal(&p->cpus_allowed, new_mask))) { |
9985b0ba DR |
7035 | ret = -EINVAL; |
7036 | goto out; | |
7037 | } | |
7038 | ||
73fe6aae | 7039 | if (p->sched_class->set_cpus_allowed) |
cd8ba7cd | 7040 | p->sched_class->set_cpus_allowed(p, new_mask); |
73fe6aae | 7041 | else { |
96f874e2 RR |
7042 | cpumask_copy(&p->cpus_allowed, new_mask); |
7043 | p->rt.nr_cpus_allowed = cpumask_weight(new_mask); | |
73fe6aae GH |
7044 | } |
7045 | ||
1da177e4 | 7046 | /* Can the task run on the task's current CPU? If so, we're done */ |
96f874e2 | 7047 | if (cpumask_test_cpu(task_cpu(p), new_mask)) |
1da177e4 LT |
7048 | goto out; |
7049 | ||
1e5ce4f4 | 7050 | if (migrate_task(p, cpumask_any_and(cpu_online_mask, new_mask), &req)) { |
1da177e4 | 7051 | /* Need help from migration thread: drop lock and wait. */ |
693525e3 PZ |
7052 | struct task_struct *mt = rq->migration_thread; |
7053 | ||
7054 | get_task_struct(mt); | |
1da177e4 LT |
7055 | task_rq_unlock(rq, &flags); |
7056 | wake_up_process(rq->migration_thread); | |
693525e3 | 7057 | put_task_struct(mt); |
1da177e4 LT |
7058 | wait_for_completion(&req.done); |
7059 | tlb_migrate_finish(p->mm); | |
7060 | return 0; | |
7061 | } | |
7062 | out: | |
7063 | task_rq_unlock(rq, &flags); | |
48f24c4d | 7064 | |
1da177e4 LT |
7065 | return ret; |
7066 | } | |
cd8ba7cd | 7067 | EXPORT_SYMBOL_GPL(set_cpus_allowed_ptr); |
1da177e4 LT |
7068 | |
7069 | /* | |
41a2d6cf | 7070 | * Move (not current) task off this cpu, onto dest cpu. We're doing |
1da177e4 LT |
7071 | * this because either it can't run here any more (set_cpus_allowed() |
7072 | * away from this CPU, or CPU going down), or because we're | |
7073 | * attempting to rebalance this task on exec (sched_exec). | |
7074 | * | |
7075 | * So we race with normal scheduler movements, but that's OK, as long | |
7076 | * as the task is no longer on this CPU. | |
efc30814 KK |
7077 | * |
7078 | * Returns non-zero if task was successfully migrated. | |
1da177e4 | 7079 | */ |
efc30814 | 7080 | static int __migrate_task(struct task_struct *p, int src_cpu, int dest_cpu) |
1da177e4 | 7081 | { |
70b97a7f | 7082 | struct rq *rq_dest, *rq_src; |
dd41f596 | 7083 | int ret = 0, on_rq; |
1da177e4 | 7084 | |
e761b772 | 7085 | if (unlikely(!cpu_active(dest_cpu))) |
efc30814 | 7086 | return ret; |
1da177e4 LT |
7087 | |
7088 | rq_src = cpu_rq(src_cpu); | |
7089 | rq_dest = cpu_rq(dest_cpu); | |
7090 | ||
7091 | double_rq_lock(rq_src, rq_dest); | |
7092 | /* Already moved. */ | |
7093 | if (task_cpu(p) != src_cpu) | |
b1e38734 | 7094 | goto done; |
1da177e4 | 7095 | /* Affinity changed (again). */ |
96f874e2 | 7096 | if (!cpumask_test_cpu(dest_cpu, &p->cpus_allowed)) |
b1e38734 | 7097 | goto fail; |
1da177e4 | 7098 | |
dd41f596 | 7099 | on_rq = p->se.on_rq; |
6e82a3be | 7100 | if (on_rq) |
2e1cb74a | 7101 | deactivate_task(rq_src, p, 0); |
6e82a3be | 7102 | |
1da177e4 | 7103 | set_task_cpu(p, dest_cpu); |
dd41f596 IM |
7104 | if (on_rq) { |
7105 | activate_task(rq_dest, p, 0); | |
15afe09b | 7106 | check_preempt_curr(rq_dest, p, 0); |
1da177e4 | 7107 | } |
b1e38734 | 7108 | done: |
efc30814 | 7109 | ret = 1; |
b1e38734 | 7110 | fail: |
1da177e4 | 7111 | double_rq_unlock(rq_src, rq_dest); |
efc30814 | 7112 | return ret; |
1da177e4 LT |
7113 | } |
7114 | ||
03b042bf PM |
7115 | #define RCU_MIGRATION_IDLE 0 |
7116 | #define RCU_MIGRATION_NEED_QS 1 | |
7117 | #define RCU_MIGRATION_GOT_QS 2 | |
7118 | #define RCU_MIGRATION_MUST_SYNC 3 | |
7119 | ||
1da177e4 LT |
7120 | /* |
7121 | * migration_thread - this is a highprio system thread that performs | |
7122 | * thread migration by bumping thread off CPU then 'pushing' onto | |
7123 | * another runqueue. | |
7124 | */ | |
95cdf3b7 | 7125 | static int migration_thread(void *data) |
1da177e4 | 7126 | { |
03b042bf | 7127 | int badcpu; |
1da177e4 | 7128 | int cpu = (long)data; |
70b97a7f | 7129 | struct rq *rq; |
1da177e4 LT |
7130 | |
7131 | rq = cpu_rq(cpu); | |
7132 | BUG_ON(rq->migration_thread != current); | |
7133 | ||
7134 | set_current_state(TASK_INTERRUPTIBLE); | |
7135 | while (!kthread_should_stop()) { | |
70b97a7f | 7136 | struct migration_req *req; |
1da177e4 | 7137 | struct list_head *head; |
1da177e4 | 7138 | |
1da177e4 LT |
7139 | spin_lock_irq(&rq->lock); |
7140 | ||
7141 | if (cpu_is_offline(cpu)) { | |
7142 | spin_unlock_irq(&rq->lock); | |
371cbb38 | 7143 | break; |
1da177e4 LT |
7144 | } |
7145 | ||
7146 | if (rq->active_balance) { | |
7147 | active_load_balance(rq, cpu); | |
7148 | rq->active_balance = 0; | |
7149 | } | |
7150 | ||
7151 | head = &rq->migration_queue; | |
7152 | ||
7153 | if (list_empty(head)) { | |
7154 | spin_unlock_irq(&rq->lock); | |
7155 | schedule(); | |
7156 | set_current_state(TASK_INTERRUPTIBLE); | |
7157 | continue; | |
7158 | } | |
70b97a7f | 7159 | req = list_entry(head->next, struct migration_req, list); |
1da177e4 LT |
7160 | list_del_init(head->next); |
7161 | ||
03b042bf PM |
7162 | if (req->task != NULL) { |
7163 | spin_unlock(&rq->lock); | |
7164 | __migrate_task(req->task, cpu, req->dest_cpu); | |
7165 | } else if (likely(cpu == (badcpu = smp_processor_id()))) { | |
7166 | req->dest_cpu = RCU_MIGRATION_GOT_QS; | |
7167 | spin_unlock(&rq->lock); | |
7168 | } else { | |
7169 | req->dest_cpu = RCU_MIGRATION_MUST_SYNC; | |
7170 | spin_unlock(&rq->lock); | |
7171 | WARN_ONCE(1, "migration_thread() on CPU %d, expected %d\n", badcpu, cpu); | |
7172 | } | |
674311d5 | 7173 | local_irq_enable(); |
1da177e4 LT |
7174 | |
7175 | complete(&req->done); | |
7176 | } | |
7177 | __set_current_state(TASK_RUNNING); | |
1da177e4 | 7178 | |
1da177e4 LT |
7179 | return 0; |
7180 | } | |
7181 | ||
7182 | #ifdef CONFIG_HOTPLUG_CPU | |
f7b4cddc ON |
7183 | |
7184 | static int __migrate_task_irq(struct task_struct *p, int src_cpu, int dest_cpu) | |
7185 | { | |
7186 | int ret; | |
7187 | ||
7188 | local_irq_disable(); | |
7189 | ret = __migrate_task(p, src_cpu, dest_cpu); | |
7190 | local_irq_enable(); | |
7191 | return ret; | |
7192 | } | |
7193 | ||
054b9108 | 7194 | /* |
3a4fa0a2 | 7195 | * Figure out where task on dead CPU should go, use force if necessary. |
054b9108 | 7196 | */ |
48f24c4d | 7197 | static void move_task_off_dead_cpu(int dead_cpu, struct task_struct *p) |
1da177e4 | 7198 | { |
70b97a7f | 7199 | int dest_cpu; |
6ca09dfc | 7200 | const struct cpumask *nodemask = cpumask_of_node(cpu_to_node(dead_cpu)); |
e76bd8d9 RR |
7201 | |
7202 | again: | |
7203 | /* Look for allowed, online CPU in same node. */ | |
7204 | for_each_cpu_and(dest_cpu, nodemask, cpu_online_mask) | |
7205 | if (cpumask_test_cpu(dest_cpu, &p->cpus_allowed)) | |
7206 | goto move; | |
7207 | ||
7208 | /* Any allowed, online CPU? */ | |
7209 | dest_cpu = cpumask_any_and(&p->cpus_allowed, cpu_online_mask); | |
7210 | if (dest_cpu < nr_cpu_ids) | |
7211 | goto move; | |
7212 | ||
7213 | /* No more Mr. Nice Guy. */ | |
7214 | if (dest_cpu >= nr_cpu_ids) { | |
e76bd8d9 RR |
7215 | cpuset_cpus_allowed_locked(p, &p->cpus_allowed); |
7216 | dest_cpu = cpumask_any_and(cpu_online_mask, &p->cpus_allowed); | |
1da177e4 | 7217 | |
e76bd8d9 RR |
7218 | /* |
7219 | * Don't tell them about moving exiting tasks or | |
7220 | * kernel threads (both mm NULL), since they never | |
7221 | * leave kernel. | |
7222 | */ | |
7223 | if (p->mm && printk_ratelimit()) { | |
7224 | printk(KERN_INFO "process %d (%s) no " | |
7225 | "longer affine to cpu%d\n", | |
7226 | task_pid_nr(p), p->comm, dead_cpu); | |
3a5c359a | 7227 | } |
e76bd8d9 RR |
7228 | } |
7229 | ||
7230 | move: | |
7231 | /* It can have affinity changed while we were choosing. */ | |
7232 | if (unlikely(!__migrate_task_irq(p, dead_cpu, dest_cpu))) | |
7233 | goto again; | |
1da177e4 LT |
7234 | } |
7235 | ||
7236 | /* | |
7237 | * While a dead CPU has no uninterruptible tasks queued at this point, | |
7238 | * it might still have a nonzero ->nr_uninterruptible counter, because | |
7239 | * for performance reasons the counter is not stricly tracking tasks to | |
7240 | * their home CPUs. So we just add the counter to another CPU's counter, | |
7241 | * to keep the global sum constant after CPU-down: | |
7242 | */ | |
70b97a7f | 7243 | static void migrate_nr_uninterruptible(struct rq *rq_src) |
1da177e4 | 7244 | { |
1e5ce4f4 | 7245 | struct rq *rq_dest = cpu_rq(cpumask_any(cpu_online_mask)); |
1da177e4 LT |
7246 | unsigned long flags; |
7247 | ||
7248 | local_irq_save(flags); | |
7249 | double_rq_lock(rq_src, rq_dest); | |
7250 | rq_dest->nr_uninterruptible += rq_src->nr_uninterruptible; | |
7251 | rq_src->nr_uninterruptible = 0; | |
7252 | double_rq_unlock(rq_src, rq_dest); | |
7253 | local_irq_restore(flags); | |
7254 | } | |
7255 | ||
7256 | /* Run through task list and migrate tasks from the dead cpu. */ | |
7257 | static void migrate_live_tasks(int src_cpu) | |
7258 | { | |
48f24c4d | 7259 | struct task_struct *p, *t; |
1da177e4 | 7260 | |
f7b4cddc | 7261 | read_lock(&tasklist_lock); |
1da177e4 | 7262 | |
48f24c4d IM |
7263 | do_each_thread(t, p) { |
7264 | if (p == current) | |
1da177e4 LT |
7265 | continue; |
7266 | ||
48f24c4d IM |
7267 | if (task_cpu(p) == src_cpu) |
7268 | move_task_off_dead_cpu(src_cpu, p); | |
7269 | } while_each_thread(t, p); | |
1da177e4 | 7270 | |
f7b4cddc | 7271 | read_unlock(&tasklist_lock); |
1da177e4 LT |
7272 | } |
7273 | ||
dd41f596 IM |
7274 | /* |
7275 | * Schedules idle task to be the next runnable task on current CPU. | |
94bc9a7b DA |
7276 | * It does so by boosting its priority to highest possible. |
7277 | * Used by CPU offline code. | |
1da177e4 LT |
7278 | */ |
7279 | void sched_idle_next(void) | |
7280 | { | |
48f24c4d | 7281 | int this_cpu = smp_processor_id(); |
70b97a7f | 7282 | struct rq *rq = cpu_rq(this_cpu); |
1da177e4 LT |
7283 | struct task_struct *p = rq->idle; |
7284 | unsigned long flags; | |
7285 | ||
7286 | /* cpu has to be offline */ | |
48f24c4d | 7287 | BUG_ON(cpu_online(this_cpu)); |
1da177e4 | 7288 | |
48f24c4d IM |
7289 | /* |
7290 | * Strictly not necessary since rest of the CPUs are stopped by now | |
7291 | * and interrupts disabled on the current cpu. | |
1da177e4 LT |
7292 | */ |
7293 | spin_lock_irqsave(&rq->lock, flags); | |
7294 | ||
dd41f596 | 7295 | __setscheduler(rq, p, SCHED_FIFO, MAX_RT_PRIO-1); |
48f24c4d | 7296 | |
94bc9a7b DA |
7297 | update_rq_clock(rq); |
7298 | activate_task(rq, p, 0); | |
1da177e4 LT |
7299 | |
7300 | spin_unlock_irqrestore(&rq->lock, flags); | |
7301 | } | |
7302 | ||
48f24c4d IM |
7303 | /* |
7304 | * Ensures that the idle task is using init_mm right before its cpu goes | |
1da177e4 LT |
7305 | * offline. |
7306 | */ | |
7307 | void idle_task_exit(void) | |
7308 | { | |
7309 | struct mm_struct *mm = current->active_mm; | |
7310 | ||
7311 | BUG_ON(cpu_online(smp_processor_id())); | |
7312 | ||
7313 | if (mm != &init_mm) | |
7314 | switch_mm(mm, &init_mm, current); | |
7315 | mmdrop(mm); | |
7316 | } | |
7317 | ||
054b9108 | 7318 | /* called under rq->lock with disabled interrupts */ |
36c8b586 | 7319 | static void migrate_dead(unsigned int dead_cpu, struct task_struct *p) |
1da177e4 | 7320 | { |
70b97a7f | 7321 | struct rq *rq = cpu_rq(dead_cpu); |
1da177e4 LT |
7322 | |
7323 | /* Must be exiting, otherwise would be on tasklist. */ | |
270f722d | 7324 | BUG_ON(!p->exit_state); |
1da177e4 LT |
7325 | |
7326 | /* Cannot have done final schedule yet: would have vanished. */ | |
c394cc9f | 7327 | BUG_ON(p->state == TASK_DEAD); |
1da177e4 | 7328 | |
48f24c4d | 7329 | get_task_struct(p); |
1da177e4 LT |
7330 | |
7331 | /* | |
7332 | * Drop lock around migration; if someone else moves it, | |
41a2d6cf | 7333 | * that's OK. No task can be added to this CPU, so iteration is |
1da177e4 LT |
7334 | * fine. |
7335 | */ | |
f7b4cddc | 7336 | spin_unlock_irq(&rq->lock); |
48f24c4d | 7337 | move_task_off_dead_cpu(dead_cpu, p); |
f7b4cddc | 7338 | spin_lock_irq(&rq->lock); |
1da177e4 | 7339 | |
48f24c4d | 7340 | put_task_struct(p); |
1da177e4 LT |
7341 | } |
7342 | ||
7343 | /* release_task() removes task from tasklist, so we won't find dead tasks. */ | |
7344 | static void migrate_dead_tasks(unsigned int dead_cpu) | |
7345 | { | |
70b97a7f | 7346 | struct rq *rq = cpu_rq(dead_cpu); |
dd41f596 | 7347 | struct task_struct *next; |
48f24c4d | 7348 | |
dd41f596 IM |
7349 | for ( ; ; ) { |
7350 | if (!rq->nr_running) | |
7351 | break; | |
a8e504d2 | 7352 | update_rq_clock(rq); |
b67802ea | 7353 | next = pick_next_task(rq); |
dd41f596 IM |
7354 | if (!next) |
7355 | break; | |
79c53799 | 7356 | next->sched_class->put_prev_task(rq, next); |
dd41f596 | 7357 | migrate_dead(dead_cpu, next); |
e692ab53 | 7358 | |
1da177e4 LT |
7359 | } |
7360 | } | |
dce48a84 TG |
7361 | |
7362 | /* | |
7363 | * remove the tasks which were accounted by rq from calc_load_tasks. | |
7364 | */ | |
7365 | static void calc_global_load_remove(struct rq *rq) | |
7366 | { | |
7367 | atomic_long_sub(rq->calc_load_active, &calc_load_tasks); | |
a468d389 | 7368 | rq->calc_load_active = 0; |
dce48a84 | 7369 | } |
1da177e4 LT |
7370 | #endif /* CONFIG_HOTPLUG_CPU */ |
7371 | ||
e692ab53 NP |
7372 | #if defined(CONFIG_SCHED_DEBUG) && defined(CONFIG_SYSCTL) |
7373 | ||
7374 | static struct ctl_table sd_ctl_dir[] = { | |
e0361851 AD |
7375 | { |
7376 | .procname = "sched_domain", | |
c57baf1e | 7377 | .mode = 0555, |
e0361851 | 7378 | }, |
38605cae | 7379 | {0, }, |
e692ab53 NP |
7380 | }; |
7381 | ||
7382 | static struct ctl_table sd_ctl_root[] = { | |
e0361851 | 7383 | { |
c57baf1e | 7384 | .ctl_name = CTL_KERN, |
e0361851 | 7385 | .procname = "kernel", |
c57baf1e | 7386 | .mode = 0555, |
e0361851 AD |
7387 | .child = sd_ctl_dir, |
7388 | }, | |
38605cae | 7389 | {0, }, |
e692ab53 NP |
7390 | }; |
7391 | ||
7392 | static struct ctl_table *sd_alloc_ctl_entry(int n) | |
7393 | { | |
7394 | struct ctl_table *entry = | |
5cf9f062 | 7395 | kcalloc(n, sizeof(struct ctl_table), GFP_KERNEL); |
e692ab53 | 7396 | |
e692ab53 NP |
7397 | return entry; |
7398 | } | |
7399 | ||
6382bc90 MM |
7400 | static void sd_free_ctl_entry(struct ctl_table **tablep) |
7401 | { | |
cd790076 | 7402 | struct ctl_table *entry; |
6382bc90 | 7403 | |
cd790076 MM |
7404 | /* |
7405 | * In the intermediate directories, both the child directory and | |
7406 | * procname are dynamically allocated and could fail but the mode | |
41a2d6cf | 7407 | * will always be set. In the lowest directory the names are |
cd790076 MM |
7408 | * static strings and all have proc handlers. |
7409 | */ | |
7410 | for (entry = *tablep; entry->mode; entry++) { | |
6382bc90 MM |
7411 | if (entry->child) |
7412 | sd_free_ctl_entry(&entry->child); | |
cd790076 MM |
7413 | if (entry->proc_handler == NULL) |
7414 | kfree(entry->procname); | |
7415 | } | |
6382bc90 MM |
7416 | |
7417 | kfree(*tablep); | |
7418 | *tablep = NULL; | |
7419 | } | |
7420 | ||
e692ab53 | 7421 | static void |
e0361851 | 7422 | set_table_entry(struct ctl_table *entry, |
e692ab53 NP |
7423 | const char *procname, void *data, int maxlen, |
7424 | mode_t mode, proc_handler *proc_handler) | |
7425 | { | |
e692ab53 NP |
7426 | entry->procname = procname; |
7427 | entry->data = data; | |
7428 | entry->maxlen = maxlen; | |
7429 | entry->mode = mode; | |
7430 | entry->proc_handler = proc_handler; | |
7431 | } | |
7432 | ||
7433 | static struct ctl_table * | |
7434 | sd_alloc_ctl_domain_table(struct sched_domain *sd) | |
7435 | { | |
a5d8c348 | 7436 | struct ctl_table *table = sd_alloc_ctl_entry(13); |
e692ab53 | 7437 | |
ad1cdc1d MM |
7438 | if (table == NULL) |
7439 | return NULL; | |
7440 | ||
e0361851 | 7441 | set_table_entry(&table[0], "min_interval", &sd->min_interval, |
e692ab53 | 7442 | sizeof(long), 0644, proc_doulongvec_minmax); |
e0361851 | 7443 | set_table_entry(&table[1], "max_interval", &sd->max_interval, |
e692ab53 | 7444 | sizeof(long), 0644, proc_doulongvec_minmax); |
e0361851 | 7445 | set_table_entry(&table[2], "busy_idx", &sd->busy_idx, |
e692ab53 | 7446 | sizeof(int), 0644, proc_dointvec_minmax); |
e0361851 | 7447 | set_table_entry(&table[3], "idle_idx", &sd->idle_idx, |
e692ab53 | 7448 | sizeof(int), 0644, proc_dointvec_minmax); |
e0361851 | 7449 | set_table_entry(&table[4], "newidle_idx", &sd->newidle_idx, |
e692ab53 | 7450 | sizeof(int), 0644, proc_dointvec_minmax); |
e0361851 | 7451 | set_table_entry(&table[5], "wake_idx", &sd->wake_idx, |
e692ab53 | 7452 | sizeof(int), 0644, proc_dointvec_minmax); |
e0361851 | 7453 | set_table_entry(&table[6], "forkexec_idx", &sd->forkexec_idx, |
e692ab53 | 7454 | sizeof(int), 0644, proc_dointvec_minmax); |
e0361851 | 7455 | set_table_entry(&table[7], "busy_factor", &sd->busy_factor, |
e692ab53 | 7456 | sizeof(int), 0644, proc_dointvec_minmax); |
e0361851 | 7457 | set_table_entry(&table[8], "imbalance_pct", &sd->imbalance_pct, |
e692ab53 | 7458 | sizeof(int), 0644, proc_dointvec_minmax); |
ace8b3d6 | 7459 | set_table_entry(&table[9], "cache_nice_tries", |
e692ab53 NP |
7460 | &sd->cache_nice_tries, |
7461 | sizeof(int), 0644, proc_dointvec_minmax); | |
ace8b3d6 | 7462 | set_table_entry(&table[10], "flags", &sd->flags, |
e692ab53 | 7463 | sizeof(int), 0644, proc_dointvec_minmax); |
a5d8c348 IM |
7464 | set_table_entry(&table[11], "name", sd->name, |
7465 | CORENAME_MAX_SIZE, 0444, proc_dostring); | |
7466 | /* &table[12] is terminator */ | |
e692ab53 NP |
7467 | |
7468 | return table; | |
7469 | } | |
7470 | ||
9a4e7159 | 7471 | static ctl_table *sd_alloc_ctl_cpu_table(int cpu) |
e692ab53 NP |
7472 | { |
7473 | struct ctl_table *entry, *table; | |
7474 | struct sched_domain *sd; | |
7475 | int domain_num = 0, i; | |
7476 | char buf[32]; | |
7477 | ||
7478 | for_each_domain(cpu, sd) | |
7479 | domain_num++; | |
7480 | entry = table = sd_alloc_ctl_entry(domain_num + 1); | |
ad1cdc1d MM |
7481 | if (table == NULL) |
7482 | return NULL; | |
e692ab53 NP |
7483 | |
7484 | i = 0; | |
7485 | for_each_domain(cpu, sd) { | |
7486 | snprintf(buf, 32, "domain%d", i); | |
e692ab53 | 7487 | entry->procname = kstrdup(buf, GFP_KERNEL); |
c57baf1e | 7488 | entry->mode = 0555; |
e692ab53 NP |
7489 | entry->child = sd_alloc_ctl_domain_table(sd); |
7490 | entry++; | |
7491 | i++; | |
7492 | } | |
7493 | return table; | |
7494 | } | |
7495 | ||
7496 | static struct ctl_table_header *sd_sysctl_header; | |
6382bc90 | 7497 | static void register_sched_domain_sysctl(void) |
e692ab53 NP |
7498 | { |
7499 | int i, cpu_num = num_online_cpus(); | |
7500 | struct ctl_table *entry = sd_alloc_ctl_entry(cpu_num + 1); | |
7501 | char buf[32]; | |
7502 | ||
7378547f MM |
7503 | WARN_ON(sd_ctl_dir[0].child); |
7504 | sd_ctl_dir[0].child = entry; | |
7505 | ||
ad1cdc1d MM |
7506 | if (entry == NULL) |
7507 | return; | |
7508 | ||
97b6ea7b | 7509 | for_each_online_cpu(i) { |
e692ab53 | 7510 | snprintf(buf, 32, "cpu%d", i); |
e692ab53 | 7511 | entry->procname = kstrdup(buf, GFP_KERNEL); |
c57baf1e | 7512 | entry->mode = 0555; |
e692ab53 | 7513 | entry->child = sd_alloc_ctl_cpu_table(i); |
97b6ea7b | 7514 | entry++; |
e692ab53 | 7515 | } |
7378547f MM |
7516 | |
7517 | WARN_ON(sd_sysctl_header); | |
e692ab53 NP |
7518 | sd_sysctl_header = register_sysctl_table(sd_ctl_root); |
7519 | } | |
6382bc90 | 7520 | |
7378547f | 7521 | /* may be called multiple times per register */ |
6382bc90 MM |
7522 | static void unregister_sched_domain_sysctl(void) |
7523 | { | |
7378547f MM |
7524 | if (sd_sysctl_header) |
7525 | unregister_sysctl_table(sd_sysctl_header); | |
6382bc90 | 7526 | sd_sysctl_header = NULL; |
7378547f MM |
7527 | if (sd_ctl_dir[0].child) |
7528 | sd_free_ctl_entry(&sd_ctl_dir[0].child); | |
6382bc90 | 7529 | } |
e692ab53 | 7530 | #else |
6382bc90 MM |
7531 | static void register_sched_domain_sysctl(void) |
7532 | { | |
7533 | } | |
7534 | static void unregister_sched_domain_sysctl(void) | |
e692ab53 NP |
7535 | { |
7536 | } | |
7537 | #endif | |
7538 | ||
1f11eb6a GH |
7539 | static void set_rq_online(struct rq *rq) |
7540 | { | |
7541 | if (!rq->online) { | |
7542 | const struct sched_class *class; | |
7543 | ||
c6c4927b | 7544 | cpumask_set_cpu(rq->cpu, rq->rd->online); |
1f11eb6a GH |
7545 | rq->online = 1; |
7546 | ||
7547 | for_each_class(class) { | |
7548 | if (class->rq_online) | |
7549 | class->rq_online(rq); | |
7550 | } | |
7551 | } | |
7552 | } | |
7553 | ||
7554 | static void set_rq_offline(struct rq *rq) | |
7555 | { | |
7556 | if (rq->online) { | |
7557 | const struct sched_class *class; | |
7558 | ||
7559 | for_each_class(class) { | |
7560 | if (class->rq_offline) | |
7561 | class->rq_offline(rq); | |
7562 | } | |
7563 | ||
c6c4927b | 7564 | cpumask_clear_cpu(rq->cpu, rq->rd->online); |
1f11eb6a GH |
7565 | rq->online = 0; |
7566 | } | |
7567 | } | |
7568 | ||
1da177e4 LT |
7569 | /* |
7570 | * migration_call - callback that gets triggered when a CPU is added. | |
7571 | * Here we can start up the necessary migration thread for the new CPU. | |
7572 | */ | |
48f24c4d IM |
7573 | static int __cpuinit |
7574 | migration_call(struct notifier_block *nfb, unsigned long action, void *hcpu) | |
1da177e4 | 7575 | { |
1da177e4 | 7576 | struct task_struct *p; |
48f24c4d | 7577 | int cpu = (long)hcpu; |
1da177e4 | 7578 | unsigned long flags; |
70b97a7f | 7579 | struct rq *rq; |
1da177e4 LT |
7580 | |
7581 | switch (action) { | |
5be9361c | 7582 | |
1da177e4 | 7583 | case CPU_UP_PREPARE: |
8bb78442 | 7584 | case CPU_UP_PREPARE_FROZEN: |
dd41f596 | 7585 | p = kthread_create(migration_thread, hcpu, "migration/%d", cpu); |
1da177e4 LT |
7586 | if (IS_ERR(p)) |
7587 | return NOTIFY_BAD; | |
1da177e4 LT |
7588 | kthread_bind(p, cpu); |
7589 | /* Must be high prio: stop_machine expects to yield to it. */ | |
7590 | rq = task_rq_lock(p, &flags); | |
dd41f596 | 7591 | __setscheduler(rq, p, SCHED_FIFO, MAX_RT_PRIO-1); |
1da177e4 | 7592 | task_rq_unlock(rq, &flags); |
371cbb38 | 7593 | get_task_struct(p); |
1da177e4 | 7594 | cpu_rq(cpu)->migration_thread = p; |
a468d389 | 7595 | rq->calc_load_update = calc_load_update; |
1da177e4 | 7596 | break; |
48f24c4d | 7597 | |
1da177e4 | 7598 | case CPU_ONLINE: |
8bb78442 | 7599 | case CPU_ONLINE_FROZEN: |
3a4fa0a2 | 7600 | /* Strictly unnecessary, as first user will wake it. */ |
1da177e4 | 7601 | wake_up_process(cpu_rq(cpu)->migration_thread); |
1f94ef59 GH |
7602 | |
7603 | /* Update our root-domain */ | |
7604 | rq = cpu_rq(cpu); | |
7605 | spin_lock_irqsave(&rq->lock, flags); | |
7606 | if (rq->rd) { | |
c6c4927b | 7607 | BUG_ON(!cpumask_test_cpu(cpu, rq->rd->span)); |
1f11eb6a GH |
7608 | |
7609 | set_rq_online(rq); | |
1f94ef59 GH |
7610 | } |
7611 | spin_unlock_irqrestore(&rq->lock, flags); | |
1da177e4 | 7612 | break; |
48f24c4d | 7613 | |
1da177e4 LT |
7614 | #ifdef CONFIG_HOTPLUG_CPU |
7615 | case CPU_UP_CANCELED: | |
8bb78442 | 7616 | case CPU_UP_CANCELED_FROZEN: |
fc75cdfa HC |
7617 | if (!cpu_rq(cpu)->migration_thread) |
7618 | break; | |
41a2d6cf | 7619 | /* Unbind it from offline cpu so it can run. Fall thru. */ |
a4c4af7c | 7620 | kthread_bind(cpu_rq(cpu)->migration_thread, |
1e5ce4f4 | 7621 | cpumask_any(cpu_online_mask)); |
1da177e4 | 7622 | kthread_stop(cpu_rq(cpu)->migration_thread); |
371cbb38 | 7623 | put_task_struct(cpu_rq(cpu)->migration_thread); |
1da177e4 LT |
7624 | cpu_rq(cpu)->migration_thread = NULL; |
7625 | break; | |
48f24c4d | 7626 | |
1da177e4 | 7627 | case CPU_DEAD: |
8bb78442 | 7628 | case CPU_DEAD_FROZEN: |
470fd646 | 7629 | cpuset_lock(); /* around calls to cpuset_cpus_allowed_lock() */ |
1da177e4 LT |
7630 | migrate_live_tasks(cpu); |
7631 | rq = cpu_rq(cpu); | |
7632 | kthread_stop(rq->migration_thread); | |
371cbb38 | 7633 | put_task_struct(rq->migration_thread); |
1da177e4 LT |
7634 | rq->migration_thread = NULL; |
7635 | /* Idle task back to normal (off runqueue, low prio) */ | |
d2da272a | 7636 | spin_lock_irq(&rq->lock); |
a8e504d2 | 7637 | update_rq_clock(rq); |
2e1cb74a | 7638 | deactivate_task(rq, rq->idle, 0); |
1da177e4 | 7639 | rq->idle->static_prio = MAX_PRIO; |
dd41f596 IM |
7640 | __setscheduler(rq, rq->idle, SCHED_NORMAL, 0); |
7641 | rq->idle->sched_class = &idle_sched_class; | |
1da177e4 | 7642 | migrate_dead_tasks(cpu); |
d2da272a | 7643 | spin_unlock_irq(&rq->lock); |
470fd646 | 7644 | cpuset_unlock(); |
1da177e4 LT |
7645 | migrate_nr_uninterruptible(rq); |
7646 | BUG_ON(rq->nr_running != 0); | |
dce48a84 | 7647 | calc_global_load_remove(rq); |
41a2d6cf IM |
7648 | /* |
7649 | * No need to migrate the tasks: it was best-effort if | |
7650 | * they didn't take sched_hotcpu_mutex. Just wake up | |
7651 | * the requestors. | |
7652 | */ | |
1da177e4 LT |
7653 | spin_lock_irq(&rq->lock); |
7654 | while (!list_empty(&rq->migration_queue)) { | |
70b97a7f IM |
7655 | struct migration_req *req; |
7656 | ||
1da177e4 | 7657 | req = list_entry(rq->migration_queue.next, |
70b97a7f | 7658 | struct migration_req, list); |
1da177e4 | 7659 | list_del_init(&req->list); |
9a2bd244 | 7660 | spin_unlock_irq(&rq->lock); |
1da177e4 | 7661 | complete(&req->done); |
9a2bd244 | 7662 | spin_lock_irq(&rq->lock); |
1da177e4 LT |
7663 | } |
7664 | spin_unlock_irq(&rq->lock); | |
7665 | break; | |
57d885fe | 7666 | |
08f503b0 GH |
7667 | case CPU_DYING: |
7668 | case CPU_DYING_FROZEN: | |
57d885fe GH |
7669 | /* Update our root-domain */ |
7670 | rq = cpu_rq(cpu); | |
7671 | spin_lock_irqsave(&rq->lock, flags); | |
7672 | if (rq->rd) { | |
c6c4927b | 7673 | BUG_ON(!cpumask_test_cpu(cpu, rq->rd->span)); |
1f11eb6a | 7674 | set_rq_offline(rq); |
57d885fe GH |
7675 | } |
7676 | spin_unlock_irqrestore(&rq->lock, flags); | |
7677 | break; | |
1da177e4 LT |
7678 | #endif |
7679 | } | |
7680 | return NOTIFY_OK; | |
7681 | } | |
7682 | ||
f38b0820 PM |
7683 | /* |
7684 | * Register at high priority so that task migration (migrate_all_tasks) | |
7685 | * happens before everything else. This has to be lower priority than | |
cdd6c482 | 7686 | * the notifier in the perf_event subsystem, though. |
1da177e4 | 7687 | */ |
26c2143b | 7688 | static struct notifier_block __cpuinitdata migration_notifier = { |
1da177e4 LT |
7689 | .notifier_call = migration_call, |
7690 | .priority = 10 | |
7691 | }; | |
7692 | ||
7babe8db | 7693 | static int __init migration_init(void) |
1da177e4 LT |
7694 | { |
7695 | void *cpu = (void *)(long)smp_processor_id(); | |
07dccf33 | 7696 | int err; |
48f24c4d IM |
7697 | |
7698 | /* Start one for the boot CPU: */ | |
07dccf33 AM |
7699 | err = migration_call(&migration_notifier, CPU_UP_PREPARE, cpu); |
7700 | BUG_ON(err == NOTIFY_BAD); | |
1da177e4 LT |
7701 | migration_call(&migration_notifier, CPU_ONLINE, cpu); |
7702 | register_cpu_notifier(&migration_notifier); | |
7babe8db | 7703 | |
a004cd42 | 7704 | return 0; |
1da177e4 | 7705 | } |
7babe8db | 7706 | early_initcall(migration_init); |
1da177e4 LT |
7707 | #endif |
7708 | ||
7709 | #ifdef CONFIG_SMP | |
476f3534 | 7710 | |
3e9830dc | 7711 | #ifdef CONFIG_SCHED_DEBUG |
4dcf6aff | 7712 | |
7c16ec58 | 7713 | static int sched_domain_debug_one(struct sched_domain *sd, int cpu, int level, |
96f874e2 | 7714 | struct cpumask *groupmask) |
1da177e4 | 7715 | { |
4dcf6aff | 7716 | struct sched_group *group = sd->groups; |
434d53b0 | 7717 | char str[256]; |
1da177e4 | 7718 | |
968ea6d8 | 7719 | cpulist_scnprintf(str, sizeof(str), sched_domain_span(sd)); |
96f874e2 | 7720 | cpumask_clear(groupmask); |
4dcf6aff IM |
7721 | |
7722 | printk(KERN_DEBUG "%*s domain %d: ", level, "", level); | |
7723 | ||
7724 | if (!(sd->flags & SD_LOAD_BALANCE)) { | |
7725 | printk("does not load-balance\n"); | |
7726 | if (sd->parent) | |
7727 | printk(KERN_ERR "ERROR: !SD_LOAD_BALANCE domain" | |
7728 | " has parent"); | |
7729 | return -1; | |
41c7ce9a NP |
7730 | } |
7731 | ||
eefd796a | 7732 | printk(KERN_CONT "span %s level %s\n", str, sd->name); |
4dcf6aff | 7733 | |
758b2cdc | 7734 | if (!cpumask_test_cpu(cpu, sched_domain_span(sd))) { |
4dcf6aff IM |
7735 | printk(KERN_ERR "ERROR: domain->span does not contain " |
7736 | "CPU%d\n", cpu); | |
7737 | } | |
758b2cdc | 7738 | if (!cpumask_test_cpu(cpu, sched_group_cpus(group))) { |
4dcf6aff IM |
7739 | printk(KERN_ERR "ERROR: domain->groups does not contain" |
7740 | " CPU%d\n", cpu); | |
7741 | } | |
1da177e4 | 7742 | |
4dcf6aff | 7743 | printk(KERN_DEBUG "%*s groups:", level + 1, ""); |
1da177e4 | 7744 | do { |
4dcf6aff IM |
7745 | if (!group) { |
7746 | printk("\n"); | |
7747 | printk(KERN_ERR "ERROR: group is NULL\n"); | |
1da177e4 LT |
7748 | break; |
7749 | } | |
7750 | ||
18a3885f | 7751 | if (!group->cpu_power) { |
4dcf6aff IM |
7752 | printk(KERN_CONT "\n"); |
7753 | printk(KERN_ERR "ERROR: domain->cpu_power not " | |
7754 | "set\n"); | |
7755 | break; | |
7756 | } | |
1da177e4 | 7757 | |
758b2cdc | 7758 | if (!cpumask_weight(sched_group_cpus(group))) { |
4dcf6aff IM |
7759 | printk(KERN_CONT "\n"); |
7760 | printk(KERN_ERR "ERROR: empty group\n"); | |
7761 | break; | |
7762 | } | |
1da177e4 | 7763 | |
758b2cdc | 7764 | if (cpumask_intersects(groupmask, sched_group_cpus(group))) { |
4dcf6aff IM |
7765 | printk(KERN_CONT "\n"); |
7766 | printk(KERN_ERR "ERROR: repeated CPUs\n"); | |
7767 | break; | |
7768 | } | |
1da177e4 | 7769 | |
758b2cdc | 7770 | cpumask_or(groupmask, groupmask, sched_group_cpus(group)); |
1da177e4 | 7771 | |
968ea6d8 | 7772 | cpulist_scnprintf(str, sizeof(str), sched_group_cpus(group)); |
381512cf GS |
7773 | |
7774 | printk(KERN_CONT " %s", str); | |
18a3885f PZ |
7775 | if (group->cpu_power != SCHED_LOAD_SCALE) { |
7776 | printk(KERN_CONT " (cpu_power = %d)", | |
7777 | group->cpu_power); | |
381512cf | 7778 | } |
1da177e4 | 7779 | |
4dcf6aff IM |
7780 | group = group->next; |
7781 | } while (group != sd->groups); | |
7782 | printk(KERN_CONT "\n"); | |
1da177e4 | 7783 | |
758b2cdc | 7784 | if (!cpumask_equal(sched_domain_span(sd), groupmask)) |
4dcf6aff | 7785 | printk(KERN_ERR "ERROR: groups don't span domain->span\n"); |
1da177e4 | 7786 | |
758b2cdc RR |
7787 | if (sd->parent && |
7788 | !cpumask_subset(groupmask, sched_domain_span(sd->parent))) | |
4dcf6aff IM |
7789 | printk(KERN_ERR "ERROR: parent span is not a superset " |
7790 | "of domain->span\n"); | |
7791 | return 0; | |
7792 | } | |
1da177e4 | 7793 | |
4dcf6aff IM |
7794 | static void sched_domain_debug(struct sched_domain *sd, int cpu) |
7795 | { | |
d5dd3db1 | 7796 | cpumask_var_t groupmask; |
4dcf6aff | 7797 | int level = 0; |
1da177e4 | 7798 | |
4dcf6aff IM |
7799 | if (!sd) { |
7800 | printk(KERN_DEBUG "CPU%d attaching NULL sched-domain.\n", cpu); | |
7801 | return; | |
7802 | } | |
1da177e4 | 7803 | |
4dcf6aff IM |
7804 | printk(KERN_DEBUG "CPU%d attaching sched-domain:\n", cpu); |
7805 | ||
d5dd3db1 | 7806 | if (!alloc_cpumask_var(&groupmask, GFP_KERNEL)) { |
7c16ec58 MT |
7807 | printk(KERN_DEBUG "Cannot load-balance (out of memory)\n"); |
7808 | return; | |
7809 | } | |
7810 | ||
4dcf6aff | 7811 | for (;;) { |
7c16ec58 | 7812 | if (sched_domain_debug_one(sd, cpu, level, groupmask)) |
4dcf6aff | 7813 | break; |
1da177e4 LT |
7814 | level++; |
7815 | sd = sd->parent; | |
33859f7f | 7816 | if (!sd) |
4dcf6aff IM |
7817 | break; |
7818 | } | |
d5dd3db1 | 7819 | free_cpumask_var(groupmask); |
1da177e4 | 7820 | } |
6d6bc0ad | 7821 | #else /* !CONFIG_SCHED_DEBUG */ |
48f24c4d | 7822 | # define sched_domain_debug(sd, cpu) do { } while (0) |
6d6bc0ad | 7823 | #endif /* CONFIG_SCHED_DEBUG */ |
1da177e4 | 7824 | |
1a20ff27 | 7825 | static int sd_degenerate(struct sched_domain *sd) |
245af2c7 | 7826 | { |
758b2cdc | 7827 | if (cpumask_weight(sched_domain_span(sd)) == 1) |
245af2c7 SS |
7828 | return 1; |
7829 | ||
7830 | /* Following flags need at least 2 groups */ | |
7831 | if (sd->flags & (SD_LOAD_BALANCE | | |
7832 | SD_BALANCE_NEWIDLE | | |
7833 | SD_BALANCE_FORK | | |
89c4710e SS |
7834 | SD_BALANCE_EXEC | |
7835 | SD_SHARE_CPUPOWER | | |
7836 | SD_SHARE_PKG_RESOURCES)) { | |
245af2c7 SS |
7837 | if (sd->groups != sd->groups->next) |
7838 | return 0; | |
7839 | } | |
7840 | ||
7841 | /* Following flags don't use groups */ | |
c88d5910 | 7842 | if (sd->flags & (SD_WAKE_AFFINE)) |
245af2c7 SS |
7843 | return 0; |
7844 | ||
7845 | return 1; | |
7846 | } | |
7847 | ||
48f24c4d IM |
7848 | static int |
7849 | sd_parent_degenerate(struct sched_domain *sd, struct sched_domain *parent) | |
245af2c7 SS |
7850 | { |
7851 | unsigned long cflags = sd->flags, pflags = parent->flags; | |
7852 | ||
7853 | if (sd_degenerate(parent)) | |
7854 | return 1; | |
7855 | ||
758b2cdc | 7856 | if (!cpumask_equal(sched_domain_span(sd), sched_domain_span(parent))) |
245af2c7 SS |
7857 | return 0; |
7858 | ||
245af2c7 SS |
7859 | /* Flags needing groups don't count if only 1 group in parent */ |
7860 | if (parent->groups == parent->groups->next) { | |
7861 | pflags &= ~(SD_LOAD_BALANCE | | |
7862 | SD_BALANCE_NEWIDLE | | |
7863 | SD_BALANCE_FORK | | |
89c4710e SS |
7864 | SD_BALANCE_EXEC | |
7865 | SD_SHARE_CPUPOWER | | |
7866 | SD_SHARE_PKG_RESOURCES); | |
5436499e KC |
7867 | if (nr_node_ids == 1) |
7868 | pflags &= ~SD_SERIALIZE; | |
245af2c7 SS |
7869 | } |
7870 | if (~cflags & pflags) | |
7871 | return 0; | |
7872 | ||
7873 | return 1; | |
7874 | } | |
7875 | ||
c6c4927b RR |
7876 | static void free_rootdomain(struct root_domain *rd) |
7877 | { | |
68e74568 RR |
7878 | cpupri_cleanup(&rd->cpupri); |
7879 | ||
c6c4927b RR |
7880 | free_cpumask_var(rd->rto_mask); |
7881 | free_cpumask_var(rd->online); | |
7882 | free_cpumask_var(rd->span); | |
7883 | kfree(rd); | |
7884 | } | |
7885 | ||
57d885fe GH |
7886 | static void rq_attach_root(struct rq *rq, struct root_domain *rd) |
7887 | { | |
a0490fa3 | 7888 | struct root_domain *old_rd = NULL; |
57d885fe | 7889 | unsigned long flags; |
57d885fe GH |
7890 | |
7891 | spin_lock_irqsave(&rq->lock, flags); | |
7892 | ||
7893 | if (rq->rd) { | |
a0490fa3 | 7894 | old_rd = rq->rd; |
57d885fe | 7895 | |
c6c4927b | 7896 | if (cpumask_test_cpu(rq->cpu, old_rd->online)) |
1f11eb6a | 7897 | set_rq_offline(rq); |
57d885fe | 7898 | |
c6c4927b | 7899 | cpumask_clear_cpu(rq->cpu, old_rd->span); |
dc938520 | 7900 | |
a0490fa3 IM |
7901 | /* |
7902 | * If we dont want to free the old_rt yet then | |
7903 | * set old_rd to NULL to skip the freeing later | |
7904 | * in this function: | |
7905 | */ | |
7906 | if (!atomic_dec_and_test(&old_rd->refcount)) | |
7907 | old_rd = NULL; | |
57d885fe GH |
7908 | } |
7909 | ||
7910 | atomic_inc(&rd->refcount); | |
7911 | rq->rd = rd; | |
7912 | ||
c6c4927b | 7913 | cpumask_set_cpu(rq->cpu, rd->span); |
00aec93d | 7914 | if (cpumask_test_cpu(rq->cpu, cpu_active_mask)) |
1f11eb6a | 7915 | set_rq_online(rq); |
57d885fe GH |
7916 | |
7917 | spin_unlock_irqrestore(&rq->lock, flags); | |
a0490fa3 IM |
7918 | |
7919 | if (old_rd) | |
7920 | free_rootdomain(old_rd); | |
57d885fe GH |
7921 | } |
7922 | ||
fd5e1b5d | 7923 | static int init_rootdomain(struct root_domain *rd, bool bootmem) |
57d885fe | 7924 | { |
36b7b6d4 PE |
7925 | gfp_t gfp = GFP_KERNEL; |
7926 | ||
57d885fe GH |
7927 | memset(rd, 0, sizeof(*rd)); |
7928 | ||
36b7b6d4 PE |
7929 | if (bootmem) |
7930 | gfp = GFP_NOWAIT; | |
c6c4927b | 7931 | |
36b7b6d4 | 7932 | if (!alloc_cpumask_var(&rd->span, gfp)) |
0c910d28 | 7933 | goto out; |
36b7b6d4 | 7934 | if (!alloc_cpumask_var(&rd->online, gfp)) |
c6c4927b | 7935 | goto free_span; |
36b7b6d4 | 7936 | if (!alloc_cpumask_var(&rd->rto_mask, gfp)) |
c6c4927b | 7937 | goto free_online; |
6e0534f2 | 7938 | |
0fb53029 | 7939 | if (cpupri_init(&rd->cpupri, bootmem) != 0) |
68e74568 | 7940 | goto free_rto_mask; |
c6c4927b | 7941 | return 0; |
6e0534f2 | 7942 | |
68e74568 RR |
7943 | free_rto_mask: |
7944 | free_cpumask_var(rd->rto_mask); | |
c6c4927b RR |
7945 | free_online: |
7946 | free_cpumask_var(rd->online); | |
7947 | free_span: | |
7948 | free_cpumask_var(rd->span); | |
0c910d28 | 7949 | out: |
c6c4927b | 7950 | return -ENOMEM; |
57d885fe GH |
7951 | } |
7952 | ||
7953 | static void init_defrootdomain(void) | |
7954 | { | |
c6c4927b RR |
7955 | init_rootdomain(&def_root_domain, true); |
7956 | ||
57d885fe GH |
7957 | atomic_set(&def_root_domain.refcount, 1); |
7958 | } | |
7959 | ||
dc938520 | 7960 | static struct root_domain *alloc_rootdomain(void) |
57d885fe GH |
7961 | { |
7962 | struct root_domain *rd; | |
7963 | ||
7964 | rd = kmalloc(sizeof(*rd), GFP_KERNEL); | |
7965 | if (!rd) | |
7966 | return NULL; | |
7967 | ||
c6c4927b RR |
7968 | if (init_rootdomain(rd, false) != 0) { |
7969 | kfree(rd); | |
7970 | return NULL; | |
7971 | } | |
57d885fe GH |
7972 | |
7973 | return rd; | |
7974 | } | |
7975 | ||
1da177e4 | 7976 | /* |
0eab9146 | 7977 | * Attach the domain 'sd' to 'cpu' as its base domain. Callers must |
1da177e4 LT |
7978 | * hold the hotplug lock. |
7979 | */ | |
0eab9146 IM |
7980 | static void |
7981 | cpu_attach_domain(struct sched_domain *sd, struct root_domain *rd, int cpu) | |
1da177e4 | 7982 | { |
70b97a7f | 7983 | struct rq *rq = cpu_rq(cpu); |
245af2c7 SS |
7984 | struct sched_domain *tmp; |
7985 | ||
7986 | /* Remove the sched domains which do not contribute to scheduling. */ | |
f29c9b1c | 7987 | for (tmp = sd; tmp; ) { |
245af2c7 SS |
7988 | struct sched_domain *parent = tmp->parent; |
7989 | if (!parent) | |
7990 | break; | |
f29c9b1c | 7991 | |
1a848870 | 7992 | if (sd_parent_degenerate(tmp, parent)) { |
245af2c7 | 7993 | tmp->parent = parent->parent; |
1a848870 SS |
7994 | if (parent->parent) |
7995 | parent->parent->child = tmp; | |
f29c9b1c LZ |
7996 | } else |
7997 | tmp = tmp->parent; | |
245af2c7 SS |
7998 | } |
7999 | ||
1a848870 | 8000 | if (sd && sd_degenerate(sd)) { |
245af2c7 | 8001 | sd = sd->parent; |
1a848870 SS |
8002 | if (sd) |
8003 | sd->child = NULL; | |
8004 | } | |
1da177e4 LT |
8005 | |
8006 | sched_domain_debug(sd, cpu); | |
8007 | ||
57d885fe | 8008 | rq_attach_root(rq, rd); |
674311d5 | 8009 | rcu_assign_pointer(rq->sd, sd); |
1da177e4 LT |
8010 | } |
8011 | ||
8012 | /* cpus with isolated domains */ | |
dcc30a35 | 8013 | static cpumask_var_t cpu_isolated_map; |
1da177e4 LT |
8014 | |
8015 | /* Setup the mask of cpus configured for isolated domains */ | |
8016 | static int __init isolated_cpu_setup(char *str) | |
8017 | { | |
968ea6d8 | 8018 | cpulist_parse(str, cpu_isolated_map); |
1da177e4 LT |
8019 | return 1; |
8020 | } | |
8021 | ||
8927f494 | 8022 | __setup("isolcpus=", isolated_cpu_setup); |
1da177e4 LT |
8023 | |
8024 | /* | |
6711cab4 SS |
8025 | * init_sched_build_groups takes the cpumask we wish to span, and a pointer |
8026 | * to a function which identifies what group(along with sched group) a CPU | |
96f874e2 RR |
8027 | * belongs to. The return value of group_fn must be a >= 0 and < nr_cpu_ids |
8028 | * (due to the fact that we keep track of groups covered with a struct cpumask). | |
1da177e4 LT |
8029 | * |
8030 | * init_sched_build_groups will build a circular linked list of the groups | |
8031 | * covered by the given span, and will set each group's ->cpumask correctly, | |
8032 | * and ->cpu_power to 0. | |
8033 | */ | |
a616058b | 8034 | static void |
96f874e2 RR |
8035 | init_sched_build_groups(const struct cpumask *span, |
8036 | const struct cpumask *cpu_map, | |
8037 | int (*group_fn)(int cpu, const struct cpumask *cpu_map, | |
7c16ec58 | 8038 | struct sched_group **sg, |
96f874e2 RR |
8039 | struct cpumask *tmpmask), |
8040 | struct cpumask *covered, struct cpumask *tmpmask) | |
1da177e4 LT |
8041 | { |
8042 | struct sched_group *first = NULL, *last = NULL; | |
1da177e4 LT |
8043 | int i; |
8044 | ||
96f874e2 | 8045 | cpumask_clear(covered); |
7c16ec58 | 8046 | |
abcd083a | 8047 | for_each_cpu(i, span) { |
6711cab4 | 8048 | struct sched_group *sg; |
7c16ec58 | 8049 | int group = group_fn(i, cpu_map, &sg, tmpmask); |
1da177e4 LT |
8050 | int j; |
8051 | ||
758b2cdc | 8052 | if (cpumask_test_cpu(i, covered)) |
1da177e4 LT |
8053 | continue; |
8054 | ||
758b2cdc | 8055 | cpumask_clear(sched_group_cpus(sg)); |
18a3885f | 8056 | sg->cpu_power = 0; |
1da177e4 | 8057 | |
abcd083a | 8058 | for_each_cpu(j, span) { |
7c16ec58 | 8059 | if (group_fn(j, cpu_map, NULL, tmpmask) != group) |
1da177e4 LT |
8060 | continue; |
8061 | ||
96f874e2 | 8062 | cpumask_set_cpu(j, covered); |
758b2cdc | 8063 | cpumask_set_cpu(j, sched_group_cpus(sg)); |
1da177e4 LT |
8064 | } |
8065 | if (!first) | |
8066 | first = sg; | |
8067 | if (last) | |
8068 | last->next = sg; | |
8069 | last = sg; | |
8070 | } | |
8071 | last->next = first; | |
8072 | } | |
8073 | ||
9c1cfda2 | 8074 | #define SD_NODES_PER_DOMAIN 16 |
1da177e4 | 8075 | |
9c1cfda2 | 8076 | #ifdef CONFIG_NUMA |
198e2f18 | 8077 | |
9c1cfda2 JH |
8078 | /** |
8079 | * find_next_best_node - find the next node to include in a sched_domain | |
8080 | * @node: node whose sched_domain we're building | |
8081 | * @used_nodes: nodes already in the sched_domain | |
8082 | * | |
41a2d6cf | 8083 | * Find the next node to include in a given scheduling domain. Simply |
9c1cfda2 JH |
8084 | * finds the closest node not already in the @used_nodes map. |
8085 | * | |
8086 | * Should use nodemask_t. | |
8087 | */ | |
c5f59f08 | 8088 | static int find_next_best_node(int node, nodemask_t *used_nodes) |
9c1cfda2 JH |
8089 | { |
8090 | int i, n, val, min_val, best_node = 0; | |
8091 | ||
8092 | min_val = INT_MAX; | |
8093 | ||
076ac2af | 8094 | for (i = 0; i < nr_node_ids; i++) { |
9c1cfda2 | 8095 | /* Start at @node */ |
076ac2af | 8096 | n = (node + i) % nr_node_ids; |
9c1cfda2 JH |
8097 | |
8098 | if (!nr_cpus_node(n)) | |
8099 | continue; | |
8100 | ||
8101 | /* Skip already used nodes */ | |
c5f59f08 | 8102 | if (node_isset(n, *used_nodes)) |
9c1cfda2 JH |
8103 | continue; |
8104 | ||
8105 | /* Simple min distance search */ | |
8106 | val = node_distance(node, n); | |
8107 | ||
8108 | if (val < min_val) { | |
8109 | min_val = val; | |
8110 | best_node = n; | |
8111 | } | |
8112 | } | |
8113 | ||
c5f59f08 | 8114 | node_set(best_node, *used_nodes); |
9c1cfda2 JH |
8115 | return best_node; |
8116 | } | |
8117 | ||
8118 | /** | |
8119 | * sched_domain_node_span - get a cpumask for a node's sched_domain | |
8120 | * @node: node whose cpumask we're constructing | |
73486722 | 8121 | * @span: resulting cpumask |
9c1cfda2 | 8122 | * |
41a2d6cf | 8123 | * Given a node, construct a good cpumask for its sched_domain to span. It |
9c1cfda2 JH |
8124 | * should be one that prevents unnecessary balancing, but also spreads tasks |
8125 | * out optimally. | |
8126 | */ | |
96f874e2 | 8127 | static void sched_domain_node_span(int node, struct cpumask *span) |
9c1cfda2 | 8128 | { |
c5f59f08 | 8129 | nodemask_t used_nodes; |
48f24c4d | 8130 | int i; |
9c1cfda2 | 8131 | |
6ca09dfc | 8132 | cpumask_clear(span); |
c5f59f08 | 8133 | nodes_clear(used_nodes); |
9c1cfda2 | 8134 | |
6ca09dfc | 8135 | cpumask_or(span, span, cpumask_of_node(node)); |
c5f59f08 | 8136 | node_set(node, used_nodes); |
9c1cfda2 JH |
8137 | |
8138 | for (i = 1; i < SD_NODES_PER_DOMAIN; i++) { | |
c5f59f08 | 8139 | int next_node = find_next_best_node(node, &used_nodes); |
48f24c4d | 8140 | |
6ca09dfc | 8141 | cpumask_or(span, span, cpumask_of_node(next_node)); |
9c1cfda2 | 8142 | } |
9c1cfda2 | 8143 | } |
6d6bc0ad | 8144 | #endif /* CONFIG_NUMA */ |
9c1cfda2 | 8145 | |
5c45bf27 | 8146 | int sched_smt_power_savings = 0, sched_mc_power_savings = 0; |
48f24c4d | 8147 | |
6c99e9ad RR |
8148 | /* |
8149 | * The cpus mask in sched_group and sched_domain hangs off the end. | |
4200efd9 IM |
8150 | * |
8151 | * ( See the the comments in include/linux/sched.h:struct sched_group | |
8152 | * and struct sched_domain. ) | |
6c99e9ad RR |
8153 | */ |
8154 | struct static_sched_group { | |
8155 | struct sched_group sg; | |
8156 | DECLARE_BITMAP(cpus, CONFIG_NR_CPUS); | |
8157 | }; | |
8158 | ||
8159 | struct static_sched_domain { | |
8160 | struct sched_domain sd; | |
8161 | DECLARE_BITMAP(span, CONFIG_NR_CPUS); | |
8162 | }; | |
8163 | ||
49a02c51 AH |
8164 | struct s_data { |
8165 | #ifdef CONFIG_NUMA | |
8166 | int sd_allnodes; | |
8167 | cpumask_var_t domainspan; | |
8168 | cpumask_var_t covered; | |
8169 | cpumask_var_t notcovered; | |
8170 | #endif | |
8171 | cpumask_var_t nodemask; | |
8172 | cpumask_var_t this_sibling_map; | |
8173 | cpumask_var_t this_core_map; | |
8174 | cpumask_var_t send_covered; | |
8175 | cpumask_var_t tmpmask; | |
8176 | struct sched_group **sched_group_nodes; | |
8177 | struct root_domain *rd; | |
8178 | }; | |
8179 | ||
2109b99e AH |
8180 | enum s_alloc { |
8181 | sa_sched_groups = 0, | |
8182 | sa_rootdomain, | |
8183 | sa_tmpmask, | |
8184 | sa_send_covered, | |
8185 | sa_this_core_map, | |
8186 | sa_this_sibling_map, | |
8187 | sa_nodemask, | |
8188 | sa_sched_group_nodes, | |
8189 | #ifdef CONFIG_NUMA | |
8190 | sa_notcovered, | |
8191 | sa_covered, | |
8192 | sa_domainspan, | |
8193 | #endif | |
8194 | sa_none, | |
8195 | }; | |
8196 | ||
9c1cfda2 | 8197 | /* |
48f24c4d | 8198 | * SMT sched-domains: |
9c1cfda2 | 8199 | */ |
1da177e4 | 8200 | #ifdef CONFIG_SCHED_SMT |
6c99e9ad RR |
8201 | static DEFINE_PER_CPU(struct static_sched_domain, cpu_domains); |
8202 | static DEFINE_PER_CPU(struct static_sched_group, sched_group_cpus); | |
48f24c4d | 8203 | |
41a2d6cf | 8204 | static int |
96f874e2 RR |
8205 | cpu_to_cpu_group(int cpu, const struct cpumask *cpu_map, |
8206 | struct sched_group **sg, struct cpumask *unused) | |
1da177e4 | 8207 | { |
6711cab4 | 8208 | if (sg) |
6c99e9ad | 8209 | *sg = &per_cpu(sched_group_cpus, cpu).sg; |
1da177e4 LT |
8210 | return cpu; |
8211 | } | |
6d6bc0ad | 8212 | #endif /* CONFIG_SCHED_SMT */ |
1da177e4 | 8213 | |
48f24c4d IM |
8214 | /* |
8215 | * multi-core sched-domains: | |
8216 | */ | |
1e9f28fa | 8217 | #ifdef CONFIG_SCHED_MC |
6c99e9ad RR |
8218 | static DEFINE_PER_CPU(struct static_sched_domain, core_domains); |
8219 | static DEFINE_PER_CPU(struct static_sched_group, sched_group_core); | |
6d6bc0ad | 8220 | #endif /* CONFIG_SCHED_MC */ |
1e9f28fa SS |
8221 | |
8222 | #if defined(CONFIG_SCHED_MC) && defined(CONFIG_SCHED_SMT) | |
41a2d6cf | 8223 | static int |
96f874e2 RR |
8224 | cpu_to_core_group(int cpu, const struct cpumask *cpu_map, |
8225 | struct sched_group **sg, struct cpumask *mask) | |
1e9f28fa | 8226 | { |
6711cab4 | 8227 | int group; |
7c16ec58 | 8228 | |
c69fc56d | 8229 | cpumask_and(mask, topology_thread_cpumask(cpu), cpu_map); |
96f874e2 | 8230 | group = cpumask_first(mask); |
6711cab4 | 8231 | if (sg) |
6c99e9ad | 8232 | *sg = &per_cpu(sched_group_core, group).sg; |
6711cab4 | 8233 | return group; |
1e9f28fa SS |
8234 | } |
8235 | #elif defined(CONFIG_SCHED_MC) | |
41a2d6cf | 8236 | static int |
96f874e2 RR |
8237 | cpu_to_core_group(int cpu, const struct cpumask *cpu_map, |
8238 | struct sched_group **sg, struct cpumask *unused) | |
1e9f28fa | 8239 | { |
6711cab4 | 8240 | if (sg) |
6c99e9ad | 8241 | *sg = &per_cpu(sched_group_core, cpu).sg; |
1e9f28fa SS |
8242 | return cpu; |
8243 | } | |
8244 | #endif | |
8245 | ||
6c99e9ad RR |
8246 | static DEFINE_PER_CPU(struct static_sched_domain, phys_domains); |
8247 | static DEFINE_PER_CPU(struct static_sched_group, sched_group_phys); | |
48f24c4d | 8248 | |
41a2d6cf | 8249 | static int |
96f874e2 RR |
8250 | cpu_to_phys_group(int cpu, const struct cpumask *cpu_map, |
8251 | struct sched_group **sg, struct cpumask *mask) | |
1da177e4 | 8252 | { |
6711cab4 | 8253 | int group; |
48f24c4d | 8254 | #ifdef CONFIG_SCHED_MC |
6ca09dfc | 8255 | cpumask_and(mask, cpu_coregroup_mask(cpu), cpu_map); |
96f874e2 | 8256 | group = cpumask_first(mask); |
1e9f28fa | 8257 | #elif defined(CONFIG_SCHED_SMT) |
c69fc56d | 8258 | cpumask_and(mask, topology_thread_cpumask(cpu), cpu_map); |
96f874e2 | 8259 | group = cpumask_first(mask); |
1da177e4 | 8260 | #else |
6711cab4 | 8261 | group = cpu; |
1da177e4 | 8262 | #endif |
6711cab4 | 8263 | if (sg) |
6c99e9ad | 8264 | *sg = &per_cpu(sched_group_phys, group).sg; |
6711cab4 | 8265 | return group; |
1da177e4 LT |
8266 | } |
8267 | ||
8268 | #ifdef CONFIG_NUMA | |
1da177e4 | 8269 | /* |
9c1cfda2 JH |
8270 | * The init_sched_build_groups can't handle what we want to do with node |
8271 | * groups, so roll our own. Now each node has its own list of groups which | |
8272 | * gets dynamically allocated. | |
1da177e4 | 8273 | */ |
62ea9ceb | 8274 | static DEFINE_PER_CPU(struct static_sched_domain, node_domains); |
434d53b0 | 8275 | static struct sched_group ***sched_group_nodes_bycpu; |
1da177e4 | 8276 | |
62ea9ceb | 8277 | static DEFINE_PER_CPU(struct static_sched_domain, allnodes_domains); |
6c99e9ad | 8278 | static DEFINE_PER_CPU(struct static_sched_group, sched_group_allnodes); |
9c1cfda2 | 8279 | |
96f874e2 RR |
8280 | static int cpu_to_allnodes_group(int cpu, const struct cpumask *cpu_map, |
8281 | struct sched_group **sg, | |
8282 | struct cpumask *nodemask) | |
9c1cfda2 | 8283 | { |
6711cab4 SS |
8284 | int group; |
8285 | ||
6ca09dfc | 8286 | cpumask_and(nodemask, cpumask_of_node(cpu_to_node(cpu)), cpu_map); |
96f874e2 | 8287 | group = cpumask_first(nodemask); |
6711cab4 SS |
8288 | |
8289 | if (sg) | |
6c99e9ad | 8290 | *sg = &per_cpu(sched_group_allnodes, group).sg; |
6711cab4 | 8291 | return group; |
1da177e4 | 8292 | } |
6711cab4 | 8293 | |
08069033 SS |
8294 | static void init_numa_sched_groups_power(struct sched_group *group_head) |
8295 | { | |
8296 | struct sched_group *sg = group_head; | |
8297 | int j; | |
8298 | ||
8299 | if (!sg) | |
8300 | return; | |
3a5c359a | 8301 | do { |
758b2cdc | 8302 | for_each_cpu(j, sched_group_cpus(sg)) { |
3a5c359a | 8303 | struct sched_domain *sd; |
08069033 | 8304 | |
6c99e9ad | 8305 | sd = &per_cpu(phys_domains, j).sd; |
13318a71 | 8306 | if (j != group_first_cpu(sd->groups)) { |
3a5c359a AK |
8307 | /* |
8308 | * Only add "power" once for each | |
8309 | * physical package. | |
8310 | */ | |
8311 | continue; | |
8312 | } | |
08069033 | 8313 | |
18a3885f | 8314 | sg->cpu_power += sd->groups->cpu_power; |
3a5c359a AK |
8315 | } |
8316 | sg = sg->next; | |
8317 | } while (sg != group_head); | |
08069033 | 8318 | } |
0601a88d AH |
8319 | |
8320 | static int build_numa_sched_groups(struct s_data *d, | |
8321 | const struct cpumask *cpu_map, int num) | |
8322 | { | |
8323 | struct sched_domain *sd; | |
8324 | struct sched_group *sg, *prev; | |
8325 | int n, j; | |
8326 | ||
8327 | cpumask_clear(d->covered); | |
8328 | cpumask_and(d->nodemask, cpumask_of_node(num), cpu_map); | |
8329 | if (cpumask_empty(d->nodemask)) { | |
8330 | d->sched_group_nodes[num] = NULL; | |
8331 | goto out; | |
8332 | } | |
8333 | ||
8334 | sched_domain_node_span(num, d->domainspan); | |
8335 | cpumask_and(d->domainspan, d->domainspan, cpu_map); | |
8336 | ||
8337 | sg = kmalloc_node(sizeof(struct sched_group) + cpumask_size(), | |
8338 | GFP_KERNEL, num); | |
8339 | if (!sg) { | |
8340 | printk(KERN_WARNING "Can not alloc domain group for node %d\n", | |
8341 | num); | |
8342 | return -ENOMEM; | |
8343 | } | |
8344 | d->sched_group_nodes[num] = sg; | |
8345 | ||
8346 | for_each_cpu(j, d->nodemask) { | |
8347 | sd = &per_cpu(node_domains, j).sd; | |
8348 | sd->groups = sg; | |
8349 | } | |
8350 | ||
18a3885f | 8351 | sg->cpu_power = 0; |
0601a88d AH |
8352 | cpumask_copy(sched_group_cpus(sg), d->nodemask); |
8353 | sg->next = sg; | |
8354 | cpumask_or(d->covered, d->covered, d->nodemask); | |
8355 | ||
8356 | prev = sg; | |
8357 | for (j = 0; j < nr_node_ids; j++) { | |
8358 | n = (num + j) % nr_node_ids; | |
8359 | cpumask_complement(d->notcovered, d->covered); | |
8360 | cpumask_and(d->tmpmask, d->notcovered, cpu_map); | |
8361 | cpumask_and(d->tmpmask, d->tmpmask, d->domainspan); | |
8362 | if (cpumask_empty(d->tmpmask)) | |
8363 | break; | |
8364 | cpumask_and(d->tmpmask, d->tmpmask, cpumask_of_node(n)); | |
8365 | if (cpumask_empty(d->tmpmask)) | |
8366 | continue; | |
8367 | sg = kmalloc_node(sizeof(struct sched_group) + cpumask_size(), | |
8368 | GFP_KERNEL, num); | |
8369 | if (!sg) { | |
8370 | printk(KERN_WARNING | |
8371 | "Can not alloc domain group for node %d\n", j); | |
8372 | return -ENOMEM; | |
8373 | } | |
18a3885f | 8374 | sg->cpu_power = 0; |
0601a88d AH |
8375 | cpumask_copy(sched_group_cpus(sg), d->tmpmask); |
8376 | sg->next = prev->next; | |
8377 | cpumask_or(d->covered, d->covered, d->tmpmask); | |
8378 | prev->next = sg; | |
8379 | prev = sg; | |
8380 | } | |
8381 | out: | |
8382 | return 0; | |
8383 | } | |
6d6bc0ad | 8384 | #endif /* CONFIG_NUMA */ |
1da177e4 | 8385 | |
a616058b | 8386 | #ifdef CONFIG_NUMA |
51888ca2 | 8387 | /* Free memory allocated for various sched_group structures */ |
96f874e2 RR |
8388 | static void free_sched_groups(const struct cpumask *cpu_map, |
8389 | struct cpumask *nodemask) | |
51888ca2 | 8390 | { |
a616058b | 8391 | int cpu, i; |
51888ca2 | 8392 | |
abcd083a | 8393 | for_each_cpu(cpu, cpu_map) { |
51888ca2 SV |
8394 | struct sched_group **sched_group_nodes |
8395 | = sched_group_nodes_bycpu[cpu]; | |
8396 | ||
51888ca2 SV |
8397 | if (!sched_group_nodes) |
8398 | continue; | |
8399 | ||
076ac2af | 8400 | for (i = 0; i < nr_node_ids; i++) { |
51888ca2 SV |
8401 | struct sched_group *oldsg, *sg = sched_group_nodes[i]; |
8402 | ||
6ca09dfc | 8403 | cpumask_and(nodemask, cpumask_of_node(i), cpu_map); |
96f874e2 | 8404 | if (cpumask_empty(nodemask)) |
51888ca2 SV |
8405 | continue; |
8406 | ||
8407 | if (sg == NULL) | |
8408 | continue; | |
8409 | sg = sg->next; | |
8410 | next_sg: | |
8411 | oldsg = sg; | |
8412 | sg = sg->next; | |
8413 | kfree(oldsg); | |
8414 | if (oldsg != sched_group_nodes[i]) | |
8415 | goto next_sg; | |
8416 | } | |
8417 | kfree(sched_group_nodes); | |
8418 | sched_group_nodes_bycpu[cpu] = NULL; | |
8419 | } | |
51888ca2 | 8420 | } |
6d6bc0ad | 8421 | #else /* !CONFIG_NUMA */ |
96f874e2 RR |
8422 | static void free_sched_groups(const struct cpumask *cpu_map, |
8423 | struct cpumask *nodemask) | |
a616058b SS |
8424 | { |
8425 | } | |
6d6bc0ad | 8426 | #endif /* CONFIG_NUMA */ |
51888ca2 | 8427 | |
89c4710e SS |
8428 | /* |
8429 | * Initialize sched groups cpu_power. | |
8430 | * | |
8431 | * cpu_power indicates the capacity of sched group, which is used while | |
8432 | * distributing the load between different sched groups in a sched domain. | |
8433 | * Typically cpu_power for all the groups in a sched domain will be same unless | |
8434 | * there are asymmetries in the topology. If there are asymmetries, group | |
8435 | * having more cpu_power will pickup more load compared to the group having | |
8436 | * less cpu_power. | |
89c4710e SS |
8437 | */ |
8438 | static void init_sched_groups_power(int cpu, struct sched_domain *sd) | |
8439 | { | |
8440 | struct sched_domain *child; | |
8441 | struct sched_group *group; | |
f93e65c1 PZ |
8442 | long power; |
8443 | int weight; | |
89c4710e SS |
8444 | |
8445 | WARN_ON(!sd || !sd->groups); | |
8446 | ||
13318a71 | 8447 | if (cpu != group_first_cpu(sd->groups)) |
89c4710e SS |
8448 | return; |
8449 | ||
8450 | child = sd->child; | |
8451 | ||
18a3885f | 8452 | sd->groups->cpu_power = 0; |
5517d86b | 8453 | |
f93e65c1 PZ |
8454 | if (!child) { |
8455 | power = SCHED_LOAD_SCALE; | |
8456 | weight = cpumask_weight(sched_domain_span(sd)); | |
8457 | /* | |
8458 | * SMT siblings share the power of a single core. | |
a52bfd73 PZ |
8459 | * Usually multiple threads get a better yield out of |
8460 | * that one core than a single thread would have, | |
8461 | * reflect that in sd->smt_gain. | |
f93e65c1 | 8462 | */ |
a52bfd73 PZ |
8463 | if ((sd->flags & SD_SHARE_CPUPOWER) && weight > 1) { |
8464 | power *= sd->smt_gain; | |
f93e65c1 | 8465 | power /= weight; |
a52bfd73 PZ |
8466 | power >>= SCHED_LOAD_SHIFT; |
8467 | } | |
18a3885f | 8468 | sd->groups->cpu_power += power; |
89c4710e SS |
8469 | return; |
8470 | } | |
8471 | ||
89c4710e | 8472 | /* |
f93e65c1 | 8473 | * Add cpu_power of each child group to this groups cpu_power. |
89c4710e SS |
8474 | */ |
8475 | group = child->groups; | |
8476 | do { | |
18a3885f | 8477 | sd->groups->cpu_power += group->cpu_power; |
89c4710e SS |
8478 | group = group->next; |
8479 | } while (group != child->groups); | |
8480 | } | |
8481 | ||
7c16ec58 MT |
8482 | /* |
8483 | * Initializers for schedule domains | |
8484 | * Non-inlined to reduce accumulated stack pressure in build_sched_domains() | |
8485 | */ | |
8486 | ||
a5d8c348 IM |
8487 | #ifdef CONFIG_SCHED_DEBUG |
8488 | # define SD_INIT_NAME(sd, type) sd->name = #type | |
8489 | #else | |
8490 | # define SD_INIT_NAME(sd, type) do { } while (0) | |
8491 | #endif | |
8492 | ||
7c16ec58 | 8493 | #define SD_INIT(sd, type) sd_init_##type(sd) |
a5d8c348 | 8494 | |
7c16ec58 MT |
8495 | #define SD_INIT_FUNC(type) \ |
8496 | static noinline void sd_init_##type(struct sched_domain *sd) \ | |
8497 | { \ | |
8498 | memset(sd, 0, sizeof(*sd)); \ | |
8499 | *sd = SD_##type##_INIT; \ | |
1d3504fc | 8500 | sd->level = SD_LV_##type; \ |
a5d8c348 | 8501 | SD_INIT_NAME(sd, type); \ |
7c16ec58 MT |
8502 | } |
8503 | ||
8504 | SD_INIT_FUNC(CPU) | |
8505 | #ifdef CONFIG_NUMA | |
8506 | SD_INIT_FUNC(ALLNODES) | |
8507 | SD_INIT_FUNC(NODE) | |
8508 | #endif | |
8509 | #ifdef CONFIG_SCHED_SMT | |
8510 | SD_INIT_FUNC(SIBLING) | |
8511 | #endif | |
8512 | #ifdef CONFIG_SCHED_MC | |
8513 | SD_INIT_FUNC(MC) | |
8514 | #endif | |
8515 | ||
1d3504fc HS |
8516 | static int default_relax_domain_level = -1; |
8517 | ||
8518 | static int __init setup_relax_domain_level(char *str) | |
8519 | { | |
30e0e178 LZ |
8520 | unsigned long val; |
8521 | ||
8522 | val = simple_strtoul(str, NULL, 0); | |
8523 | if (val < SD_LV_MAX) | |
8524 | default_relax_domain_level = val; | |
8525 | ||
1d3504fc HS |
8526 | return 1; |
8527 | } | |
8528 | __setup("relax_domain_level=", setup_relax_domain_level); | |
8529 | ||
8530 | static void set_domain_attribute(struct sched_domain *sd, | |
8531 | struct sched_domain_attr *attr) | |
8532 | { | |
8533 | int request; | |
8534 | ||
8535 | if (!attr || attr->relax_domain_level < 0) { | |
8536 | if (default_relax_domain_level < 0) | |
8537 | return; | |
8538 | else | |
8539 | request = default_relax_domain_level; | |
8540 | } else | |
8541 | request = attr->relax_domain_level; | |
8542 | if (request < sd->level) { | |
8543 | /* turn off idle balance on this domain */ | |
c88d5910 | 8544 | sd->flags &= ~(SD_BALANCE_WAKE|SD_BALANCE_NEWIDLE); |
1d3504fc HS |
8545 | } else { |
8546 | /* turn on idle balance on this domain */ | |
c88d5910 | 8547 | sd->flags |= (SD_BALANCE_WAKE|SD_BALANCE_NEWIDLE); |
1d3504fc HS |
8548 | } |
8549 | } | |
8550 | ||
2109b99e AH |
8551 | static void __free_domain_allocs(struct s_data *d, enum s_alloc what, |
8552 | const struct cpumask *cpu_map) | |
8553 | { | |
8554 | switch (what) { | |
8555 | case sa_sched_groups: | |
8556 | free_sched_groups(cpu_map, d->tmpmask); /* fall through */ | |
8557 | d->sched_group_nodes = NULL; | |
8558 | case sa_rootdomain: | |
8559 | free_rootdomain(d->rd); /* fall through */ | |
8560 | case sa_tmpmask: | |
8561 | free_cpumask_var(d->tmpmask); /* fall through */ | |
8562 | case sa_send_covered: | |
8563 | free_cpumask_var(d->send_covered); /* fall through */ | |
8564 | case sa_this_core_map: | |
8565 | free_cpumask_var(d->this_core_map); /* fall through */ | |
8566 | case sa_this_sibling_map: | |
8567 | free_cpumask_var(d->this_sibling_map); /* fall through */ | |
8568 | case sa_nodemask: | |
8569 | free_cpumask_var(d->nodemask); /* fall through */ | |
8570 | case sa_sched_group_nodes: | |
d1b55138 | 8571 | #ifdef CONFIG_NUMA |
2109b99e AH |
8572 | kfree(d->sched_group_nodes); /* fall through */ |
8573 | case sa_notcovered: | |
8574 | free_cpumask_var(d->notcovered); /* fall through */ | |
8575 | case sa_covered: | |
8576 | free_cpumask_var(d->covered); /* fall through */ | |
8577 | case sa_domainspan: | |
8578 | free_cpumask_var(d->domainspan); /* fall through */ | |
3404c8d9 | 8579 | #endif |
2109b99e AH |
8580 | case sa_none: |
8581 | break; | |
8582 | } | |
8583 | } | |
3404c8d9 | 8584 | |
2109b99e AH |
8585 | static enum s_alloc __visit_domain_allocation_hell(struct s_data *d, |
8586 | const struct cpumask *cpu_map) | |
8587 | { | |
3404c8d9 | 8588 | #ifdef CONFIG_NUMA |
2109b99e AH |
8589 | if (!alloc_cpumask_var(&d->domainspan, GFP_KERNEL)) |
8590 | return sa_none; | |
8591 | if (!alloc_cpumask_var(&d->covered, GFP_KERNEL)) | |
8592 | return sa_domainspan; | |
8593 | if (!alloc_cpumask_var(&d->notcovered, GFP_KERNEL)) | |
8594 | return sa_covered; | |
8595 | /* Allocate the per-node list of sched groups */ | |
8596 | d->sched_group_nodes = kcalloc(nr_node_ids, | |
8597 | sizeof(struct sched_group *), GFP_KERNEL); | |
8598 | if (!d->sched_group_nodes) { | |
d1b55138 | 8599 | printk(KERN_WARNING "Can not alloc sched group node list\n"); |
2109b99e | 8600 | return sa_notcovered; |
d1b55138 | 8601 | } |
2109b99e | 8602 | sched_group_nodes_bycpu[cpumask_first(cpu_map)] = d->sched_group_nodes; |
d1b55138 | 8603 | #endif |
2109b99e AH |
8604 | if (!alloc_cpumask_var(&d->nodemask, GFP_KERNEL)) |
8605 | return sa_sched_group_nodes; | |
8606 | if (!alloc_cpumask_var(&d->this_sibling_map, GFP_KERNEL)) | |
8607 | return sa_nodemask; | |
8608 | if (!alloc_cpumask_var(&d->this_core_map, GFP_KERNEL)) | |
8609 | return sa_this_sibling_map; | |
8610 | if (!alloc_cpumask_var(&d->send_covered, GFP_KERNEL)) | |
8611 | return sa_this_core_map; | |
8612 | if (!alloc_cpumask_var(&d->tmpmask, GFP_KERNEL)) | |
8613 | return sa_send_covered; | |
8614 | d->rd = alloc_rootdomain(); | |
8615 | if (!d->rd) { | |
57d885fe | 8616 | printk(KERN_WARNING "Cannot alloc root domain\n"); |
2109b99e | 8617 | return sa_tmpmask; |
57d885fe | 8618 | } |
2109b99e AH |
8619 | return sa_rootdomain; |
8620 | } | |
57d885fe | 8621 | |
7f4588f3 AH |
8622 | static struct sched_domain *__build_numa_sched_domains(struct s_data *d, |
8623 | const struct cpumask *cpu_map, struct sched_domain_attr *attr, int i) | |
8624 | { | |
8625 | struct sched_domain *sd = NULL; | |
7c16ec58 | 8626 | #ifdef CONFIG_NUMA |
7f4588f3 | 8627 | struct sched_domain *parent; |
1da177e4 | 8628 | |
7f4588f3 AH |
8629 | d->sd_allnodes = 0; |
8630 | if (cpumask_weight(cpu_map) > | |
8631 | SD_NODES_PER_DOMAIN * cpumask_weight(d->nodemask)) { | |
8632 | sd = &per_cpu(allnodes_domains, i).sd; | |
8633 | SD_INIT(sd, ALLNODES); | |
1d3504fc | 8634 | set_domain_attribute(sd, attr); |
7f4588f3 AH |
8635 | cpumask_copy(sched_domain_span(sd), cpu_map); |
8636 | cpu_to_allnodes_group(i, cpu_map, &sd->groups, d->tmpmask); | |
8637 | d->sd_allnodes = 1; | |
8638 | } | |
8639 | parent = sd; | |
8640 | ||
8641 | sd = &per_cpu(node_domains, i).sd; | |
8642 | SD_INIT(sd, NODE); | |
8643 | set_domain_attribute(sd, attr); | |
8644 | sched_domain_node_span(cpu_to_node(i), sched_domain_span(sd)); | |
8645 | sd->parent = parent; | |
8646 | if (parent) | |
8647 | parent->child = sd; | |
8648 | cpumask_and(sched_domain_span(sd), sched_domain_span(sd), cpu_map); | |
1da177e4 | 8649 | #endif |
7f4588f3 AH |
8650 | return sd; |
8651 | } | |
1da177e4 | 8652 | |
87cce662 AH |
8653 | static struct sched_domain *__build_cpu_sched_domain(struct s_data *d, |
8654 | const struct cpumask *cpu_map, struct sched_domain_attr *attr, | |
8655 | struct sched_domain *parent, int i) | |
8656 | { | |
8657 | struct sched_domain *sd; | |
8658 | sd = &per_cpu(phys_domains, i).sd; | |
8659 | SD_INIT(sd, CPU); | |
8660 | set_domain_attribute(sd, attr); | |
8661 | cpumask_copy(sched_domain_span(sd), d->nodemask); | |
8662 | sd->parent = parent; | |
8663 | if (parent) | |
8664 | parent->child = sd; | |
8665 | cpu_to_phys_group(i, cpu_map, &sd->groups, d->tmpmask); | |
8666 | return sd; | |
8667 | } | |
1da177e4 | 8668 | |
410c4081 AH |
8669 | static struct sched_domain *__build_mc_sched_domain(struct s_data *d, |
8670 | const struct cpumask *cpu_map, struct sched_domain_attr *attr, | |
8671 | struct sched_domain *parent, int i) | |
8672 | { | |
8673 | struct sched_domain *sd = parent; | |
1e9f28fa | 8674 | #ifdef CONFIG_SCHED_MC |
410c4081 AH |
8675 | sd = &per_cpu(core_domains, i).sd; |
8676 | SD_INIT(sd, MC); | |
8677 | set_domain_attribute(sd, attr); | |
8678 | cpumask_and(sched_domain_span(sd), cpu_map, cpu_coregroup_mask(i)); | |
8679 | sd->parent = parent; | |
8680 | parent->child = sd; | |
8681 | cpu_to_core_group(i, cpu_map, &sd->groups, d->tmpmask); | |
1e9f28fa | 8682 | #endif |
410c4081 AH |
8683 | return sd; |
8684 | } | |
1e9f28fa | 8685 | |
d8173535 AH |
8686 | static struct sched_domain *__build_smt_sched_domain(struct s_data *d, |
8687 | const struct cpumask *cpu_map, struct sched_domain_attr *attr, | |
8688 | struct sched_domain *parent, int i) | |
8689 | { | |
8690 | struct sched_domain *sd = parent; | |
1da177e4 | 8691 | #ifdef CONFIG_SCHED_SMT |
d8173535 AH |
8692 | sd = &per_cpu(cpu_domains, i).sd; |
8693 | SD_INIT(sd, SIBLING); | |
8694 | set_domain_attribute(sd, attr); | |
8695 | cpumask_and(sched_domain_span(sd), cpu_map, topology_thread_cpumask(i)); | |
8696 | sd->parent = parent; | |
8697 | parent->child = sd; | |
8698 | cpu_to_cpu_group(i, cpu_map, &sd->groups, d->tmpmask); | |
1da177e4 | 8699 | #endif |
d8173535 AH |
8700 | return sd; |
8701 | } | |
1da177e4 | 8702 | |
0e8e85c9 AH |
8703 | static void build_sched_groups(struct s_data *d, enum sched_domain_level l, |
8704 | const struct cpumask *cpu_map, int cpu) | |
8705 | { | |
8706 | switch (l) { | |
1da177e4 | 8707 | #ifdef CONFIG_SCHED_SMT |
0e8e85c9 AH |
8708 | case SD_LV_SIBLING: /* set up CPU (sibling) groups */ |
8709 | cpumask_and(d->this_sibling_map, cpu_map, | |
8710 | topology_thread_cpumask(cpu)); | |
8711 | if (cpu == cpumask_first(d->this_sibling_map)) | |
8712 | init_sched_build_groups(d->this_sibling_map, cpu_map, | |
8713 | &cpu_to_cpu_group, | |
8714 | d->send_covered, d->tmpmask); | |
8715 | break; | |
1da177e4 | 8716 | #endif |
1e9f28fa | 8717 | #ifdef CONFIG_SCHED_MC |
a2af04cd AH |
8718 | case SD_LV_MC: /* set up multi-core groups */ |
8719 | cpumask_and(d->this_core_map, cpu_map, cpu_coregroup_mask(cpu)); | |
8720 | if (cpu == cpumask_first(d->this_core_map)) | |
8721 | init_sched_build_groups(d->this_core_map, cpu_map, | |
8722 | &cpu_to_core_group, | |
8723 | d->send_covered, d->tmpmask); | |
8724 | break; | |
1e9f28fa | 8725 | #endif |
86548096 AH |
8726 | case SD_LV_CPU: /* set up physical groups */ |
8727 | cpumask_and(d->nodemask, cpumask_of_node(cpu), cpu_map); | |
8728 | if (!cpumask_empty(d->nodemask)) | |
8729 | init_sched_build_groups(d->nodemask, cpu_map, | |
8730 | &cpu_to_phys_group, | |
8731 | d->send_covered, d->tmpmask); | |
8732 | break; | |
1da177e4 | 8733 | #ifdef CONFIG_NUMA |
de616e36 AH |
8734 | case SD_LV_ALLNODES: |
8735 | init_sched_build_groups(cpu_map, cpu_map, &cpu_to_allnodes_group, | |
8736 | d->send_covered, d->tmpmask); | |
8737 | break; | |
8738 | #endif | |
0e8e85c9 AH |
8739 | default: |
8740 | break; | |
7c16ec58 | 8741 | } |
0e8e85c9 | 8742 | } |
9c1cfda2 | 8743 | |
2109b99e AH |
8744 | /* |
8745 | * Build sched domains for a given set of cpus and attach the sched domains | |
8746 | * to the individual cpus | |
8747 | */ | |
8748 | static int __build_sched_domains(const struct cpumask *cpu_map, | |
8749 | struct sched_domain_attr *attr) | |
8750 | { | |
8751 | enum s_alloc alloc_state = sa_none; | |
8752 | struct s_data d; | |
294b0c96 | 8753 | struct sched_domain *sd; |
2109b99e | 8754 | int i; |
7c16ec58 | 8755 | #ifdef CONFIG_NUMA |
2109b99e | 8756 | d.sd_allnodes = 0; |
7c16ec58 | 8757 | #endif |
9c1cfda2 | 8758 | |
2109b99e AH |
8759 | alloc_state = __visit_domain_allocation_hell(&d, cpu_map); |
8760 | if (alloc_state != sa_rootdomain) | |
8761 | goto error; | |
8762 | alloc_state = sa_sched_groups; | |
9c1cfda2 | 8763 | |
1da177e4 | 8764 | /* |
1a20ff27 | 8765 | * Set up domains for cpus specified by the cpu_map. |
1da177e4 | 8766 | */ |
abcd083a | 8767 | for_each_cpu(i, cpu_map) { |
49a02c51 AH |
8768 | cpumask_and(d.nodemask, cpumask_of_node(cpu_to_node(i)), |
8769 | cpu_map); | |
9761eea8 | 8770 | |
7f4588f3 | 8771 | sd = __build_numa_sched_domains(&d, cpu_map, attr, i); |
87cce662 | 8772 | sd = __build_cpu_sched_domain(&d, cpu_map, attr, sd, i); |
410c4081 | 8773 | sd = __build_mc_sched_domain(&d, cpu_map, attr, sd, i); |
d8173535 | 8774 | sd = __build_smt_sched_domain(&d, cpu_map, attr, sd, i); |
1da177e4 | 8775 | } |
9c1cfda2 | 8776 | |
abcd083a | 8777 | for_each_cpu(i, cpu_map) { |
0e8e85c9 | 8778 | build_sched_groups(&d, SD_LV_SIBLING, cpu_map, i); |
a2af04cd | 8779 | build_sched_groups(&d, SD_LV_MC, cpu_map, i); |
1da177e4 | 8780 | } |
9c1cfda2 | 8781 | |
1da177e4 | 8782 | /* Set up physical groups */ |
86548096 AH |
8783 | for (i = 0; i < nr_node_ids; i++) |
8784 | build_sched_groups(&d, SD_LV_CPU, cpu_map, i); | |
9c1cfda2 | 8785 | |
1da177e4 LT |
8786 | #ifdef CONFIG_NUMA |
8787 | /* Set up node groups */ | |
de616e36 AH |
8788 | if (d.sd_allnodes) |
8789 | build_sched_groups(&d, SD_LV_ALLNODES, cpu_map, 0); | |
9c1cfda2 | 8790 | |
0601a88d AH |
8791 | for (i = 0; i < nr_node_ids; i++) |
8792 | if (build_numa_sched_groups(&d, cpu_map, i)) | |
51888ca2 | 8793 | goto error; |
1da177e4 LT |
8794 | #endif |
8795 | ||
8796 | /* Calculate CPU power for physical packages and nodes */ | |
5c45bf27 | 8797 | #ifdef CONFIG_SCHED_SMT |
abcd083a | 8798 | for_each_cpu(i, cpu_map) { |
294b0c96 | 8799 | sd = &per_cpu(cpu_domains, i).sd; |
89c4710e | 8800 | init_sched_groups_power(i, sd); |
5c45bf27 | 8801 | } |
1da177e4 | 8802 | #endif |
1e9f28fa | 8803 | #ifdef CONFIG_SCHED_MC |
abcd083a | 8804 | for_each_cpu(i, cpu_map) { |
294b0c96 | 8805 | sd = &per_cpu(core_domains, i).sd; |
89c4710e | 8806 | init_sched_groups_power(i, sd); |
5c45bf27 SS |
8807 | } |
8808 | #endif | |
1e9f28fa | 8809 | |
abcd083a | 8810 | for_each_cpu(i, cpu_map) { |
294b0c96 | 8811 | sd = &per_cpu(phys_domains, i).sd; |
89c4710e | 8812 | init_sched_groups_power(i, sd); |
1da177e4 LT |
8813 | } |
8814 | ||
9c1cfda2 | 8815 | #ifdef CONFIG_NUMA |
076ac2af | 8816 | for (i = 0; i < nr_node_ids; i++) |
49a02c51 | 8817 | init_numa_sched_groups_power(d.sched_group_nodes[i]); |
9c1cfda2 | 8818 | |
49a02c51 | 8819 | if (d.sd_allnodes) { |
6711cab4 | 8820 | struct sched_group *sg; |
f712c0c7 | 8821 | |
96f874e2 | 8822 | cpu_to_allnodes_group(cpumask_first(cpu_map), cpu_map, &sg, |
49a02c51 | 8823 | d.tmpmask); |
f712c0c7 SS |
8824 | init_numa_sched_groups_power(sg); |
8825 | } | |
9c1cfda2 JH |
8826 | #endif |
8827 | ||
1da177e4 | 8828 | /* Attach the domains */ |
abcd083a | 8829 | for_each_cpu(i, cpu_map) { |
1da177e4 | 8830 | #ifdef CONFIG_SCHED_SMT |
6c99e9ad | 8831 | sd = &per_cpu(cpu_domains, i).sd; |
1e9f28fa | 8832 | #elif defined(CONFIG_SCHED_MC) |
6c99e9ad | 8833 | sd = &per_cpu(core_domains, i).sd; |
1da177e4 | 8834 | #else |
6c99e9ad | 8835 | sd = &per_cpu(phys_domains, i).sd; |
1da177e4 | 8836 | #endif |
49a02c51 | 8837 | cpu_attach_domain(sd, d.rd, i); |
1da177e4 | 8838 | } |
51888ca2 | 8839 | |
2109b99e AH |
8840 | d.sched_group_nodes = NULL; /* don't free this we still need it */ |
8841 | __free_domain_allocs(&d, sa_tmpmask, cpu_map); | |
8842 | return 0; | |
51888ca2 | 8843 | |
51888ca2 | 8844 | error: |
2109b99e AH |
8845 | __free_domain_allocs(&d, alloc_state, cpu_map); |
8846 | return -ENOMEM; | |
1da177e4 | 8847 | } |
029190c5 | 8848 | |
96f874e2 | 8849 | static int build_sched_domains(const struct cpumask *cpu_map) |
1d3504fc HS |
8850 | { |
8851 | return __build_sched_domains(cpu_map, NULL); | |
8852 | } | |
8853 | ||
96f874e2 | 8854 | static struct cpumask *doms_cur; /* current sched domains */ |
029190c5 | 8855 | static int ndoms_cur; /* number of sched domains in 'doms_cur' */ |
4285f594 IM |
8856 | static struct sched_domain_attr *dattr_cur; |
8857 | /* attribues of custom domains in 'doms_cur' */ | |
029190c5 PJ |
8858 | |
8859 | /* | |
8860 | * Special case: If a kmalloc of a doms_cur partition (array of | |
4212823f RR |
8861 | * cpumask) fails, then fallback to a single sched domain, |
8862 | * as determined by the single cpumask fallback_doms. | |
029190c5 | 8863 | */ |
4212823f | 8864 | static cpumask_var_t fallback_doms; |
029190c5 | 8865 | |
ee79d1bd HC |
8866 | /* |
8867 | * arch_update_cpu_topology lets virtualized architectures update the | |
8868 | * cpu core maps. It is supposed to return 1 if the topology changed | |
8869 | * or 0 if it stayed the same. | |
8870 | */ | |
8871 | int __attribute__((weak)) arch_update_cpu_topology(void) | |
22e52b07 | 8872 | { |
ee79d1bd | 8873 | return 0; |
22e52b07 HC |
8874 | } |
8875 | ||
1a20ff27 | 8876 | /* |
41a2d6cf | 8877 | * Set up scheduler domains and groups. Callers must hold the hotplug lock. |
029190c5 PJ |
8878 | * For now this just excludes isolated cpus, but could be used to |
8879 | * exclude other special cases in the future. | |
1a20ff27 | 8880 | */ |
96f874e2 | 8881 | static int arch_init_sched_domains(const struct cpumask *cpu_map) |
1a20ff27 | 8882 | { |
7378547f MM |
8883 | int err; |
8884 | ||
22e52b07 | 8885 | arch_update_cpu_topology(); |
029190c5 | 8886 | ndoms_cur = 1; |
96f874e2 | 8887 | doms_cur = kmalloc(cpumask_size(), GFP_KERNEL); |
029190c5 | 8888 | if (!doms_cur) |
4212823f | 8889 | doms_cur = fallback_doms; |
dcc30a35 | 8890 | cpumask_andnot(doms_cur, cpu_map, cpu_isolated_map); |
1d3504fc | 8891 | dattr_cur = NULL; |
7378547f | 8892 | err = build_sched_domains(doms_cur); |
6382bc90 | 8893 | register_sched_domain_sysctl(); |
7378547f MM |
8894 | |
8895 | return err; | |
1a20ff27 DG |
8896 | } |
8897 | ||
96f874e2 RR |
8898 | static void arch_destroy_sched_domains(const struct cpumask *cpu_map, |
8899 | struct cpumask *tmpmask) | |
1da177e4 | 8900 | { |
7c16ec58 | 8901 | free_sched_groups(cpu_map, tmpmask); |
9c1cfda2 | 8902 | } |
1da177e4 | 8903 | |
1a20ff27 DG |
8904 | /* |
8905 | * Detach sched domains from a group of cpus specified in cpu_map | |
8906 | * These cpus will now be attached to the NULL domain | |
8907 | */ | |
96f874e2 | 8908 | static void detach_destroy_domains(const struct cpumask *cpu_map) |
1a20ff27 | 8909 | { |
96f874e2 RR |
8910 | /* Save because hotplug lock held. */ |
8911 | static DECLARE_BITMAP(tmpmask, CONFIG_NR_CPUS); | |
1a20ff27 DG |
8912 | int i; |
8913 | ||
abcd083a | 8914 | for_each_cpu(i, cpu_map) |
57d885fe | 8915 | cpu_attach_domain(NULL, &def_root_domain, i); |
1a20ff27 | 8916 | synchronize_sched(); |
96f874e2 | 8917 | arch_destroy_sched_domains(cpu_map, to_cpumask(tmpmask)); |
1a20ff27 DG |
8918 | } |
8919 | ||
1d3504fc HS |
8920 | /* handle null as "default" */ |
8921 | static int dattrs_equal(struct sched_domain_attr *cur, int idx_cur, | |
8922 | struct sched_domain_attr *new, int idx_new) | |
8923 | { | |
8924 | struct sched_domain_attr tmp; | |
8925 | ||
8926 | /* fast path */ | |
8927 | if (!new && !cur) | |
8928 | return 1; | |
8929 | ||
8930 | tmp = SD_ATTR_INIT; | |
8931 | return !memcmp(cur ? (cur + idx_cur) : &tmp, | |
8932 | new ? (new + idx_new) : &tmp, | |
8933 | sizeof(struct sched_domain_attr)); | |
8934 | } | |
8935 | ||
029190c5 PJ |
8936 | /* |
8937 | * Partition sched domains as specified by the 'ndoms_new' | |
41a2d6cf | 8938 | * cpumasks in the array doms_new[] of cpumasks. This compares |
029190c5 PJ |
8939 | * doms_new[] to the current sched domain partitioning, doms_cur[]. |
8940 | * It destroys each deleted domain and builds each new domain. | |
8941 | * | |
96f874e2 | 8942 | * 'doms_new' is an array of cpumask's of length 'ndoms_new'. |
41a2d6cf IM |
8943 | * The masks don't intersect (don't overlap.) We should setup one |
8944 | * sched domain for each mask. CPUs not in any of the cpumasks will | |
8945 | * not be load balanced. If the same cpumask appears both in the | |
029190c5 PJ |
8946 | * current 'doms_cur' domains and in the new 'doms_new', we can leave |
8947 | * it as it is. | |
8948 | * | |
41a2d6cf IM |
8949 | * The passed in 'doms_new' should be kmalloc'd. This routine takes |
8950 | * ownership of it and will kfree it when done with it. If the caller | |
700018e0 LZ |
8951 | * failed the kmalloc call, then it can pass in doms_new == NULL && |
8952 | * ndoms_new == 1, and partition_sched_domains() will fallback to | |
8953 | * the single partition 'fallback_doms', it also forces the domains | |
8954 | * to be rebuilt. | |
029190c5 | 8955 | * |
96f874e2 | 8956 | * If doms_new == NULL it will be replaced with cpu_online_mask. |
700018e0 LZ |
8957 | * ndoms_new == 0 is a special case for destroying existing domains, |
8958 | * and it will not create the default domain. | |
dfb512ec | 8959 | * |
029190c5 PJ |
8960 | * Call with hotplug lock held |
8961 | */ | |
96f874e2 RR |
8962 | /* FIXME: Change to struct cpumask *doms_new[] */ |
8963 | void partition_sched_domains(int ndoms_new, struct cpumask *doms_new, | |
1d3504fc | 8964 | struct sched_domain_attr *dattr_new) |
029190c5 | 8965 | { |
dfb512ec | 8966 | int i, j, n; |
d65bd5ec | 8967 | int new_topology; |
029190c5 | 8968 | |
712555ee | 8969 | mutex_lock(&sched_domains_mutex); |
a1835615 | 8970 | |
7378547f MM |
8971 | /* always unregister in case we don't destroy any domains */ |
8972 | unregister_sched_domain_sysctl(); | |
8973 | ||
d65bd5ec HC |
8974 | /* Let architecture update cpu core mappings. */ |
8975 | new_topology = arch_update_cpu_topology(); | |
8976 | ||
dfb512ec | 8977 | n = doms_new ? ndoms_new : 0; |
029190c5 PJ |
8978 | |
8979 | /* Destroy deleted domains */ | |
8980 | for (i = 0; i < ndoms_cur; i++) { | |
d65bd5ec | 8981 | for (j = 0; j < n && !new_topology; j++) { |
96f874e2 | 8982 | if (cpumask_equal(&doms_cur[i], &doms_new[j]) |
1d3504fc | 8983 | && dattrs_equal(dattr_cur, i, dattr_new, j)) |
029190c5 PJ |
8984 | goto match1; |
8985 | } | |
8986 | /* no match - a current sched domain not in new doms_new[] */ | |
8987 | detach_destroy_domains(doms_cur + i); | |
8988 | match1: | |
8989 | ; | |
8990 | } | |
8991 | ||
e761b772 MK |
8992 | if (doms_new == NULL) { |
8993 | ndoms_cur = 0; | |
4212823f | 8994 | doms_new = fallback_doms; |
dcc30a35 | 8995 | cpumask_andnot(&doms_new[0], cpu_online_mask, cpu_isolated_map); |
faa2f98f | 8996 | WARN_ON_ONCE(dattr_new); |
e761b772 MK |
8997 | } |
8998 | ||
029190c5 PJ |
8999 | /* Build new domains */ |
9000 | for (i = 0; i < ndoms_new; i++) { | |
d65bd5ec | 9001 | for (j = 0; j < ndoms_cur && !new_topology; j++) { |
96f874e2 | 9002 | if (cpumask_equal(&doms_new[i], &doms_cur[j]) |
1d3504fc | 9003 | && dattrs_equal(dattr_new, i, dattr_cur, j)) |
029190c5 PJ |
9004 | goto match2; |
9005 | } | |
9006 | /* no match - add a new doms_new */ | |
1d3504fc HS |
9007 | __build_sched_domains(doms_new + i, |
9008 | dattr_new ? dattr_new + i : NULL); | |
029190c5 PJ |
9009 | match2: |
9010 | ; | |
9011 | } | |
9012 | ||
9013 | /* Remember the new sched domains */ | |
4212823f | 9014 | if (doms_cur != fallback_doms) |
029190c5 | 9015 | kfree(doms_cur); |
1d3504fc | 9016 | kfree(dattr_cur); /* kfree(NULL) is safe */ |
029190c5 | 9017 | doms_cur = doms_new; |
1d3504fc | 9018 | dattr_cur = dattr_new; |
029190c5 | 9019 | ndoms_cur = ndoms_new; |
7378547f MM |
9020 | |
9021 | register_sched_domain_sysctl(); | |
a1835615 | 9022 | |
712555ee | 9023 | mutex_unlock(&sched_domains_mutex); |
029190c5 PJ |
9024 | } |
9025 | ||
5c45bf27 | 9026 | #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT) |
c70f22d2 | 9027 | static void arch_reinit_sched_domains(void) |
5c45bf27 | 9028 | { |
95402b38 | 9029 | get_online_cpus(); |
dfb512ec MK |
9030 | |
9031 | /* Destroy domains first to force the rebuild */ | |
9032 | partition_sched_domains(0, NULL, NULL); | |
9033 | ||
e761b772 | 9034 | rebuild_sched_domains(); |
95402b38 | 9035 | put_online_cpus(); |
5c45bf27 SS |
9036 | } |
9037 | ||
9038 | static ssize_t sched_power_savings_store(const char *buf, size_t count, int smt) | |
9039 | { | |
afb8a9b7 | 9040 | unsigned int level = 0; |
5c45bf27 | 9041 | |
afb8a9b7 GS |
9042 | if (sscanf(buf, "%u", &level) != 1) |
9043 | return -EINVAL; | |
9044 | ||
9045 | /* | |
9046 | * level is always be positive so don't check for | |
9047 | * level < POWERSAVINGS_BALANCE_NONE which is 0 | |
9048 | * What happens on 0 or 1 byte write, | |
9049 | * need to check for count as well? | |
9050 | */ | |
9051 | ||
9052 | if (level >= MAX_POWERSAVINGS_BALANCE_LEVELS) | |
5c45bf27 SS |
9053 | return -EINVAL; |
9054 | ||
9055 | if (smt) | |
afb8a9b7 | 9056 | sched_smt_power_savings = level; |
5c45bf27 | 9057 | else |
afb8a9b7 | 9058 | sched_mc_power_savings = level; |
5c45bf27 | 9059 | |
c70f22d2 | 9060 | arch_reinit_sched_domains(); |
5c45bf27 | 9061 | |
c70f22d2 | 9062 | return count; |
5c45bf27 SS |
9063 | } |
9064 | ||
5c45bf27 | 9065 | #ifdef CONFIG_SCHED_MC |
f718cd4a AK |
9066 | static ssize_t sched_mc_power_savings_show(struct sysdev_class *class, |
9067 | char *page) | |
5c45bf27 SS |
9068 | { |
9069 | return sprintf(page, "%u\n", sched_mc_power_savings); | |
9070 | } | |
f718cd4a | 9071 | static ssize_t sched_mc_power_savings_store(struct sysdev_class *class, |
48f24c4d | 9072 | const char *buf, size_t count) |
5c45bf27 SS |
9073 | { |
9074 | return sched_power_savings_store(buf, count, 0); | |
9075 | } | |
f718cd4a AK |
9076 | static SYSDEV_CLASS_ATTR(sched_mc_power_savings, 0644, |
9077 | sched_mc_power_savings_show, | |
9078 | sched_mc_power_savings_store); | |
5c45bf27 SS |
9079 | #endif |
9080 | ||
9081 | #ifdef CONFIG_SCHED_SMT | |
f718cd4a AK |
9082 | static ssize_t sched_smt_power_savings_show(struct sysdev_class *dev, |
9083 | char *page) | |
5c45bf27 SS |
9084 | { |
9085 | return sprintf(page, "%u\n", sched_smt_power_savings); | |
9086 | } | |
f718cd4a | 9087 | static ssize_t sched_smt_power_savings_store(struct sysdev_class *dev, |
48f24c4d | 9088 | const char *buf, size_t count) |
5c45bf27 SS |
9089 | { |
9090 | return sched_power_savings_store(buf, count, 1); | |
9091 | } | |
f718cd4a AK |
9092 | static SYSDEV_CLASS_ATTR(sched_smt_power_savings, 0644, |
9093 | sched_smt_power_savings_show, | |
6707de00 AB |
9094 | sched_smt_power_savings_store); |
9095 | #endif | |
9096 | ||
39aac648 | 9097 | int __init sched_create_sysfs_power_savings_entries(struct sysdev_class *cls) |
6707de00 AB |
9098 | { |
9099 | int err = 0; | |
9100 | ||
9101 | #ifdef CONFIG_SCHED_SMT | |
9102 | if (smt_capable()) | |
9103 | err = sysfs_create_file(&cls->kset.kobj, | |
9104 | &attr_sched_smt_power_savings.attr); | |
9105 | #endif | |
9106 | #ifdef CONFIG_SCHED_MC | |
9107 | if (!err && mc_capable()) | |
9108 | err = sysfs_create_file(&cls->kset.kobj, | |
9109 | &attr_sched_mc_power_savings.attr); | |
9110 | #endif | |
9111 | return err; | |
9112 | } | |
6d6bc0ad | 9113 | #endif /* CONFIG_SCHED_MC || CONFIG_SCHED_SMT */ |
5c45bf27 | 9114 | |
e761b772 | 9115 | #ifndef CONFIG_CPUSETS |
1da177e4 | 9116 | /* |
e761b772 MK |
9117 | * Add online and remove offline CPUs from the scheduler domains. |
9118 | * When cpusets are enabled they take over this function. | |
1da177e4 LT |
9119 | */ |
9120 | static int update_sched_domains(struct notifier_block *nfb, | |
9121 | unsigned long action, void *hcpu) | |
e761b772 MK |
9122 | { |
9123 | switch (action) { | |
9124 | case CPU_ONLINE: | |
9125 | case CPU_ONLINE_FROZEN: | |
9126 | case CPU_DEAD: | |
9127 | case CPU_DEAD_FROZEN: | |
dfb512ec | 9128 | partition_sched_domains(1, NULL, NULL); |
e761b772 MK |
9129 | return NOTIFY_OK; |
9130 | ||
9131 | default: | |
9132 | return NOTIFY_DONE; | |
9133 | } | |
9134 | } | |
9135 | #endif | |
9136 | ||
9137 | static int update_runtime(struct notifier_block *nfb, | |
9138 | unsigned long action, void *hcpu) | |
1da177e4 | 9139 | { |
7def2be1 PZ |
9140 | int cpu = (int)(long)hcpu; |
9141 | ||
1da177e4 | 9142 | switch (action) { |
1da177e4 | 9143 | case CPU_DOWN_PREPARE: |
8bb78442 | 9144 | case CPU_DOWN_PREPARE_FROZEN: |
7def2be1 | 9145 | disable_runtime(cpu_rq(cpu)); |
1da177e4 LT |
9146 | return NOTIFY_OK; |
9147 | ||
1da177e4 | 9148 | case CPU_DOWN_FAILED: |
8bb78442 | 9149 | case CPU_DOWN_FAILED_FROZEN: |
1da177e4 | 9150 | case CPU_ONLINE: |
8bb78442 | 9151 | case CPU_ONLINE_FROZEN: |
7def2be1 | 9152 | enable_runtime(cpu_rq(cpu)); |
e761b772 MK |
9153 | return NOTIFY_OK; |
9154 | ||
1da177e4 LT |
9155 | default: |
9156 | return NOTIFY_DONE; | |
9157 | } | |
1da177e4 | 9158 | } |
1da177e4 LT |
9159 | |
9160 | void __init sched_init_smp(void) | |
9161 | { | |
dcc30a35 RR |
9162 | cpumask_var_t non_isolated_cpus; |
9163 | ||
9164 | alloc_cpumask_var(&non_isolated_cpus, GFP_KERNEL); | |
cb5fd13f | 9165 | alloc_cpumask_var(&fallback_doms, GFP_KERNEL); |
5c1e1767 | 9166 | |
434d53b0 MT |
9167 | #if defined(CONFIG_NUMA) |
9168 | sched_group_nodes_bycpu = kzalloc(nr_cpu_ids * sizeof(void **), | |
9169 | GFP_KERNEL); | |
9170 | BUG_ON(sched_group_nodes_bycpu == NULL); | |
9171 | #endif | |
95402b38 | 9172 | get_online_cpus(); |
712555ee | 9173 | mutex_lock(&sched_domains_mutex); |
dcc30a35 RR |
9174 | arch_init_sched_domains(cpu_online_mask); |
9175 | cpumask_andnot(non_isolated_cpus, cpu_possible_mask, cpu_isolated_map); | |
9176 | if (cpumask_empty(non_isolated_cpus)) | |
9177 | cpumask_set_cpu(smp_processor_id(), non_isolated_cpus); | |
712555ee | 9178 | mutex_unlock(&sched_domains_mutex); |
95402b38 | 9179 | put_online_cpus(); |
e761b772 MK |
9180 | |
9181 | #ifndef CONFIG_CPUSETS | |
1da177e4 LT |
9182 | /* XXX: Theoretical race here - CPU may be hotplugged now */ |
9183 | hotcpu_notifier(update_sched_domains, 0); | |
e761b772 MK |
9184 | #endif |
9185 | ||
9186 | /* RT runtime code needs to handle some hotplug events */ | |
9187 | hotcpu_notifier(update_runtime, 0); | |
9188 | ||
b328ca18 | 9189 | init_hrtick(); |
5c1e1767 NP |
9190 | |
9191 | /* Move init over to a non-isolated CPU */ | |
dcc30a35 | 9192 | if (set_cpus_allowed_ptr(current, non_isolated_cpus) < 0) |
5c1e1767 | 9193 | BUG(); |
19978ca6 | 9194 | sched_init_granularity(); |
dcc30a35 | 9195 | free_cpumask_var(non_isolated_cpus); |
4212823f | 9196 | |
0e3900e6 | 9197 | init_sched_rt_class(); |
1da177e4 LT |
9198 | } |
9199 | #else | |
9200 | void __init sched_init_smp(void) | |
9201 | { | |
19978ca6 | 9202 | sched_init_granularity(); |
1da177e4 LT |
9203 | } |
9204 | #endif /* CONFIG_SMP */ | |
9205 | ||
cd1bb94b AB |
9206 | const_debug unsigned int sysctl_timer_migration = 1; |
9207 | ||
1da177e4 LT |
9208 | int in_sched_functions(unsigned long addr) |
9209 | { | |
1da177e4 LT |
9210 | return in_lock_functions(addr) || |
9211 | (addr >= (unsigned long)__sched_text_start | |
9212 | && addr < (unsigned long)__sched_text_end); | |
9213 | } | |
9214 | ||
a9957449 | 9215 | static void init_cfs_rq(struct cfs_rq *cfs_rq, struct rq *rq) |
dd41f596 IM |
9216 | { |
9217 | cfs_rq->tasks_timeline = RB_ROOT; | |
4a55bd5e | 9218 | INIT_LIST_HEAD(&cfs_rq->tasks); |
dd41f596 IM |
9219 | #ifdef CONFIG_FAIR_GROUP_SCHED |
9220 | cfs_rq->rq = rq; | |
9221 | #endif | |
67e9fb2a | 9222 | cfs_rq->min_vruntime = (u64)(-(1LL << 20)); |
dd41f596 IM |
9223 | } |
9224 | ||
fa85ae24 PZ |
9225 | static void init_rt_rq(struct rt_rq *rt_rq, struct rq *rq) |
9226 | { | |
9227 | struct rt_prio_array *array; | |
9228 | int i; | |
9229 | ||
9230 | array = &rt_rq->active; | |
9231 | for (i = 0; i < MAX_RT_PRIO; i++) { | |
9232 | INIT_LIST_HEAD(array->queue + i); | |
9233 | __clear_bit(i, array->bitmap); | |
9234 | } | |
9235 | /* delimiter for bitsearch: */ | |
9236 | __set_bit(MAX_RT_PRIO, array->bitmap); | |
9237 | ||
052f1dc7 | 9238 | #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED |
e864c499 | 9239 | rt_rq->highest_prio.curr = MAX_RT_PRIO; |
398a153b | 9240 | #ifdef CONFIG_SMP |
e864c499 | 9241 | rt_rq->highest_prio.next = MAX_RT_PRIO; |
48d5e258 | 9242 | #endif |
48d5e258 | 9243 | #endif |
fa85ae24 PZ |
9244 | #ifdef CONFIG_SMP |
9245 | rt_rq->rt_nr_migratory = 0; | |
fa85ae24 | 9246 | rt_rq->overloaded = 0; |
c20b08e3 | 9247 | plist_head_init(&rt_rq->pushable_tasks, &rq->lock); |
fa85ae24 PZ |
9248 | #endif |
9249 | ||
9250 | rt_rq->rt_time = 0; | |
9251 | rt_rq->rt_throttled = 0; | |
ac086bc2 PZ |
9252 | rt_rq->rt_runtime = 0; |
9253 | spin_lock_init(&rt_rq->rt_runtime_lock); | |
6f505b16 | 9254 | |
052f1dc7 | 9255 | #ifdef CONFIG_RT_GROUP_SCHED |
23b0fdfc | 9256 | rt_rq->rt_nr_boosted = 0; |
6f505b16 PZ |
9257 | rt_rq->rq = rq; |
9258 | #endif | |
fa85ae24 PZ |
9259 | } |
9260 | ||
6f505b16 | 9261 | #ifdef CONFIG_FAIR_GROUP_SCHED |
ec7dc8ac DG |
9262 | static void init_tg_cfs_entry(struct task_group *tg, struct cfs_rq *cfs_rq, |
9263 | struct sched_entity *se, int cpu, int add, | |
9264 | struct sched_entity *parent) | |
6f505b16 | 9265 | { |
ec7dc8ac | 9266 | struct rq *rq = cpu_rq(cpu); |
6f505b16 PZ |
9267 | tg->cfs_rq[cpu] = cfs_rq; |
9268 | init_cfs_rq(cfs_rq, rq); | |
9269 | cfs_rq->tg = tg; | |
9270 | if (add) | |
9271 | list_add(&cfs_rq->leaf_cfs_rq_list, &rq->leaf_cfs_rq_list); | |
9272 | ||
9273 | tg->se[cpu] = se; | |
354d60c2 DG |
9274 | /* se could be NULL for init_task_group */ |
9275 | if (!se) | |
9276 | return; | |
9277 | ||
ec7dc8ac DG |
9278 | if (!parent) |
9279 | se->cfs_rq = &rq->cfs; | |
9280 | else | |
9281 | se->cfs_rq = parent->my_q; | |
9282 | ||
6f505b16 PZ |
9283 | se->my_q = cfs_rq; |
9284 | se->load.weight = tg->shares; | |
e05510d0 | 9285 | se->load.inv_weight = 0; |
ec7dc8ac | 9286 | se->parent = parent; |
6f505b16 | 9287 | } |
052f1dc7 | 9288 | #endif |
6f505b16 | 9289 | |
052f1dc7 | 9290 | #ifdef CONFIG_RT_GROUP_SCHED |
ec7dc8ac DG |
9291 | static void init_tg_rt_entry(struct task_group *tg, struct rt_rq *rt_rq, |
9292 | struct sched_rt_entity *rt_se, int cpu, int add, | |
9293 | struct sched_rt_entity *parent) | |
6f505b16 | 9294 | { |
ec7dc8ac DG |
9295 | struct rq *rq = cpu_rq(cpu); |
9296 | ||
6f505b16 PZ |
9297 | tg->rt_rq[cpu] = rt_rq; |
9298 | init_rt_rq(rt_rq, rq); | |
9299 | rt_rq->tg = tg; | |
9300 | rt_rq->rt_se = rt_se; | |
ac086bc2 | 9301 | rt_rq->rt_runtime = tg->rt_bandwidth.rt_runtime; |
6f505b16 PZ |
9302 | if (add) |
9303 | list_add(&rt_rq->leaf_rt_rq_list, &rq->leaf_rt_rq_list); | |
9304 | ||
9305 | tg->rt_se[cpu] = rt_se; | |
354d60c2 DG |
9306 | if (!rt_se) |
9307 | return; | |
9308 | ||
ec7dc8ac DG |
9309 | if (!parent) |
9310 | rt_se->rt_rq = &rq->rt; | |
9311 | else | |
9312 | rt_se->rt_rq = parent->my_q; | |
9313 | ||
6f505b16 | 9314 | rt_se->my_q = rt_rq; |
ec7dc8ac | 9315 | rt_se->parent = parent; |
6f505b16 PZ |
9316 | INIT_LIST_HEAD(&rt_se->run_list); |
9317 | } | |
9318 | #endif | |
9319 | ||
1da177e4 LT |
9320 | void __init sched_init(void) |
9321 | { | |
dd41f596 | 9322 | int i, j; |
434d53b0 MT |
9323 | unsigned long alloc_size = 0, ptr; |
9324 | ||
9325 | #ifdef CONFIG_FAIR_GROUP_SCHED | |
9326 | alloc_size += 2 * nr_cpu_ids * sizeof(void **); | |
9327 | #endif | |
9328 | #ifdef CONFIG_RT_GROUP_SCHED | |
9329 | alloc_size += 2 * nr_cpu_ids * sizeof(void **); | |
eff766a6 PZ |
9330 | #endif |
9331 | #ifdef CONFIG_USER_SCHED | |
9332 | alloc_size *= 2; | |
df7c8e84 RR |
9333 | #endif |
9334 | #ifdef CONFIG_CPUMASK_OFFSTACK | |
8c083f08 | 9335 | alloc_size += num_possible_cpus() * cpumask_size(); |
434d53b0 MT |
9336 | #endif |
9337 | /* | |
9338 | * As sched_init() is called before page_alloc is setup, | |
9339 | * we use alloc_bootmem(). | |
9340 | */ | |
9341 | if (alloc_size) { | |
36b7b6d4 | 9342 | ptr = (unsigned long)kzalloc(alloc_size, GFP_NOWAIT); |
434d53b0 MT |
9343 | |
9344 | #ifdef CONFIG_FAIR_GROUP_SCHED | |
9345 | init_task_group.se = (struct sched_entity **)ptr; | |
9346 | ptr += nr_cpu_ids * sizeof(void **); | |
9347 | ||
9348 | init_task_group.cfs_rq = (struct cfs_rq **)ptr; | |
9349 | ptr += nr_cpu_ids * sizeof(void **); | |
eff766a6 PZ |
9350 | |
9351 | #ifdef CONFIG_USER_SCHED | |
9352 | root_task_group.se = (struct sched_entity **)ptr; | |
9353 | ptr += nr_cpu_ids * sizeof(void **); | |
9354 | ||
9355 | root_task_group.cfs_rq = (struct cfs_rq **)ptr; | |
9356 | ptr += nr_cpu_ids * sizeof(void **); | |
6d6bc0ad DG |
9357 | #endif /* CONFIG_USER_SCHED */ |
9358 | #endif /* CONFIG_FAIR_GROUP_SCHED */ | |
434d53b0 MT |
9359 | #ifdef CONFIG_RT_GROUP_SCHED |
9360 | init_task_group.rt_se = (struct sched_rt_entity **)ptr; | |
9361 | ptr += nr_cpu_ids * sizeof(void **); | |
9362 | ||
9363 | init_task_group.rt_rq = (struct rt_rq **)ptr; | |
eff766a6 PZ |
9364 | ptr += nr_cpu_ids * sizeof(void **); |
9365 | ||
9366 | #ifdef CONFIG_USER_SCHED | |
9367 | root_task_group.rt_se = (struct sched_rt_entity **)ptr; | |
9368 | ptr += nr_cpu_ids * sizeof(void **); | |
9369 | ||
9370 | root_task_group.rt_rq = (struct rt_rq **)ptr; | |
9371 | ptr += nr_cpu_ids * sizeof(void **); | |
6d6bc0ad DG |
9372 | #endif /* CONFIG_USER_SCHED */ |
9373 | #endif /* CONFIG_RT_GROUP_SCHED */ | |
df7c8e84 RR |
9374 | #ifdef CONFIG_CPUMASK_OFFSTACK |
9375 | for_each_possible_cpu(i) { | |
9376 | per_cpu(load_balance_tmpmask, i) = (void *)ptr; | |
9377 | ptr += cpumask_size(); | |
9378 | } | |
9379 | #endif /* CONFIG_CPUMASK_OFFSTACK */ | |
434d53b0 | 9380 | } |
dd41f596 | 9381 | |
57d885fe GH |
9382 | #ifdef CONFIG_SMP |
9383 | init_defrootdomain(); | |
9384 | #endif | |
9385 | ||
d0b27fa7 PZ |
9386 | init_rt_bandwidth(&def_rt_bandwidth, |
9387 | global_rt_period(), global_rt_runtime()); | |
9388 | ||
9389 | #ifdef CONFIG_RT_GROUP_SCHED | |
9390 | init_rt_bandwidth(&init_task_group.rt_bandwidth, | |
9391 | global_rt_period(), global_rt_runtime()); | |
eff766a6 PZ |
9392 | #ifdef CONFIG_USER_SCHED |
9393 | init_rt_bandwidth(&root_task_group.rt_bandwidth, | |
9394 | global_rt_period(), RUNTIME_INF); | |
6d6bc0ad DG |
9395 | #endif /* CONFIG_USER_SCHED */ |
9396 | #endif /* CONFIG_RT_GROUP_SCHED */ | |
d0b27fa7 | 9397 | |
052f1dc7 | 9398 | #ifdef CONFIG_GROUP_SCHED |
6f505b16 | 9399 | list_add(&init_task_group.list, &task_groups); |
f473aa5e PZ |
9400 | INIT_LIST_HEAD(&init_task_group.children); |
9401 | ||
9402 | #ifdef CONFIG_USER_SCHED | |
9403 | INIT_LIST_HEAD(&root_task_group.children); | |
9404 | init_task_group.parent = &root_task_group; | |
9405 | list_add(&init_task_group.siblings, &root_task_group.children); | |
6d6bc0ad DG |
9406 | #endif /* CONFIG_USER_SCHED */ |
9407 | #endif /* CONFIG_GROUP_SCHED */ | |
6f505b16 | 9408 | |
0a945022 | 9409 | for_each_possible_cpu(i) { |
70b97a7f | 9410 | struct rq *rq; |
1da177e4 LT |
9411 | |
9412 | rq = cpu_rq(i); | |
9413 | spin_lock_init(&rq->lock); | |
7897986b | 9414 | rq->nr_running = 0; |
dce48a84 TG |
9415 | rq->calc_load_active = 0; |
9416 | rq->calc_load_update = jiffies + LOAD_FREQ; | |
dd41f596 | 9417 | init_cfs_rq(&rq->cfs, rq); |
6f505b16 | 9418 | init_rt_rq(&rq->rt, rq); |
dd41f596 | 9419 | #ifdef CONFIG_FAIR_GROUP_SCHED |
4cf86d77 | 9420 | init_task_group.shares = init_task_group_load; |
6f505b16 | 9421 | INIT_LIST_HEAD(&rq->leaf_cfs_rq_list); |
354d60c2 DG |
9422 | #ifdef CONFIG_CGROUP_SCHED |
9423 | /* | |
9424 | * How much cpu bandwidth does init_task_group get? | |
9425 | * | |
9426 | * In case of task-groups formed thr' the cgroup filesystem, it | |
9427 | * gets 100% of the cpu resources in the system. This overall | |
9428 | * system cpu resource is divided among the tasks of | |
9429 | * init_task_group and its child task-groups in a fair manner, | |
9430 | * based on each entity's (task or task-group's) weight | |
9431 | * (se->load.weight). | |
9432 | * | |
9433 | * In other words, if init_task_group has 10 tasks of weight | |
9434 | * 1024) and two child groups A0 and A1 (of weight 1024 each), | |
9435 | * then A0's share of the cpu resource is: | |
9436 | * | |
0d905bca | 9437 | * A0's bandwidth = 1024 / (10*1024 + 1024 + 1024) = 8.33% |
354d60c2 DG |
9438 | * |
9439 | * We achieve this by letting init_task_group's tasks sit | |
9440 | * directly in rq->cfs (i.e init_task_group->se[] = NULL). | |
9441 | */ | |
ec7dc8ac | 9442 | init_tg_cfs_entry(&init_task_group, &rq->cfs, NULL, i, 1, NULL); |
354d60c2 | 9443 | #elif defined CONFIG_USER_SCHED |
eff766a6 PZ |
9444 | root_task_group.shares = NICE_0_LOAD; |
9445 | init_tg_cfs_entry(&root_task_group, &rq->cfs, NULL, i, 0, NULL); | |
354d60c2 DG |
9446 | /* |
9447 | * In case of task-groups formed thr' the user id of tasks, | |
9448 | * init_task_group represents tasks belonging to root user. | |
9449 | * Hence it forms a sibling of all subsequent groups formed. | |
9450 | * In this case, init_task_group gets only a fraction of overall | |
9451 | * system cpu resource, based on the weight assigned to root | |
9452 | * user's cpu share (INIT_TASK_GROUP_LOAD). This is accomplished | |
9453 | * by letting tasks of init_task_group sit in a separate cfs_rq | |
84e9dabf | 9454 | * (init_tg_cfs_rq) and having one entity represent this group of |
354d60c2 DG |
9455 | * tasks in rq->cfs (i.e init_task_group->se[] != NULL). |
9456 | */ | |
ec7dc8ac | 9457 | init_tg_cfs_entry(&init_task_group, |
84e9dabf | 9458 | &per_cpu(init_tg_cfs_rq, i), |
eff766a6 PZ |
9459 | &per_cpu(init_sched_entity, i), i, 1, |
9460 | root_task_group.se[i]); | |
6f505b16 | 9461 | |
052f1dc7 | 9462 | #endif |
354d60c2 DG |
9463 | #endif /* CONFIG_FAIR_GROUP_SCHED */ |
9464 | ||
9465 | rq->rt.rt_runtime = def_rt_bandwidth.rt_runtime; | |
052f1dc7 | 9466 | #ifdef CONFIG_RT_GROUP_SCHED |
6f505b16 | 9467 | INIT_LIST_HEAD(&rq->leaf_rt_rq_list); |
354d60c2 | 9468 | #ifdef CONFIG_CGROUP_SCHED |
ec7dc8ac | 9469 | init_tg_rt_entry(&init_task_group, &rq->rt, NULL, i, 1, NULL); |
354d60c2 | 9470 | #elif defined CONFIG_USER_SCHED |
eff766a6 | 9471 | init_tg_rt_entry(&root_task_group, &rq->rt, NULL, i, 0, NULL); |
ec7dc8ac | 9472 | init_tg_rt_entry(&init_task_group, |
6f505b16 | 9473 | &per_cpu(init_rt_rq, i), |
eff766a6 PZ |
9474 | &per_cpu(init_sched_rt_entity, i), i, 1, |
9475 | root_task_group.rt_se[i]); | |
354d60c2 | 9476 | #endif |
dd41f596 | 9477 | #endif |
1da177e4 | 9478 | |
dd41f596 IM |
9479 | for (j = 0; j < CPU_LOAD_IDX_MAX; j++) |
9480 | rq->cpu_load[j] = 0; | |
1da177e4 | 9481 | #ifdef CONFIG_SMP |
41c7ce9a | 9482 | rq->sd = NULL; |
57d885fe | 9483 | rq->rd = NULL; |
3f029d3c | 9484 | rq->post_schedule = 0; |
1da177e4 | 9485 | rq->active_balance = 0; |
dd41f596 | 9486 | rq->next_balance = jiffies; |
1da177e4 | 9487 | rq->push_cpu = 0; |
0a2966b4 | 9488 | rq->cpu = i; |
1f11eb6a | 9489 | rq->online = 0; |
1da177e4 LT |
9490 | rq->migration_thread = NULL; |
9491 | INIT_LIST_HEAD(&rq->migration_queue); | |
dc938520 | 9492 | rq_attach_root(rq, &def_root_domain); |
1da177e4 | 9493 | #endif |
8f4d37ec | 9494 | init_rq_hrtick(rq); |
1da177e4 | 9495 | atomic_set(&rq->nr_iowait, 0); |
1da177e4 LT |
9496 | } |
9497 | ||
2dd73a4f | 9498 | set_load_weight(&init_task); |
b50f60ce | 9499 | |
e107be36 AK |
9500 | #ifdef CONFIG_PREEMPT_NOTIFIERS |
9501 | INIT_HLIST_HEAD(&init_task.preempt_notifiers); | |
9502 | #endif | |
9503 | ||
c9819f45 | 9504 | #ifdef CONFIG_SMP |
962cf36c | 9505 | open_softirq(SCHED_SOFTIRQ, run_rebalance_domains); |
c9819f45 CL |
9506 | #endif |
9507 | ||
b50f60ce HC |
9508 | #ifdef CONFIG_RT_MUTEXES |
9509 | plist_head_init(&init_task.pi_waiters, &init_task.pi_lock); | |
9510 | #endif | |
9511 | ||
1da177e4 LT |
9512 | /* |
9513 | * The boot idle thread does lazy MMU switching as well: | |
9514 | */ | |
9515 | atomic_inc(&init_mm.mm_count); | |
9516 | enter_lazy_tlb(&init_mm, current); | |
9517 | ||
9518 | /* | |
9519 | * Make us the idle thread. Technically, schedule() should not be | |
9520 | * called from this thread, however somewhere below it might be, | |
9521 | * but because we are the idle thread, we just pick up running again | |
9522 | * when this runqueue becomes "idle". | |
9523 | */ | |
9524 | init_idle(current, smp_processor_id()); | |
dce48a84 TG |
9525 | |
9526 | calc_load_update = jiffies + LOAD_FREQ; | |
9527 | ||
dd41f596 IM |
9528 | /* |
9529 | * During early bootup we pretend to be a normal task: | |
9530 | */ | |
9531 | current->sched_class = &fair_sched_class; | |
6892b75e | 9532 | |
6a7b3dc3 | 9533 | /* Allocate the nohz_cpu_mask if CONFIG_CPUMASK_OFFSTACK */ |
4bdddf8f | 9534 | alloc_cpumask_var(&nohz_cpu_mask, GFP_NOWAIT); |
bf4d83f6 | 9535 | #ifdef CONFIG_SMP |
7d1e6a9b | 9536 | #ifdef CONFIG_NO_HZ |
4bdddf8f PE |
9537 | alloc_cpumask_var(&nohz.cpu_mask, GFP_NOWAIT); |
9538 | alloc_cpumask_var(&nohz.ilb_grp_nohz_mask, GFP_NOWAIT); | |
7d1e6a9b | 9539 | #endif |
4bdddf8f | 9540 | alloc_cpumask_var(&cpu_isolated_map, GFP_NOWAIT); |
bf4d83f6 | 9541 | #endif /* SMP */ |
6a7b3dc3 | 9542 | |
cdd6c482 | 9543 | perf_event_init(); |
0d905bca | 9544 | |
6892b75e | 9545 | scheduler_running = 1; |
1da177e4 LT |
9546 | } |
9547 | ||
9548 | #ifdef CONFIG_DEBUG_SPINLOCK_SLEEP | |
e4aafea2 FW |
9549 | static inline int preempt_count_equals(int preempt_offset) |
9550 | { | |
9551 | int nested = preempt_count() & ~PREEMPT_ACTIVE; | |
9552 | ||
9553 | return (nested == PREEMPT_INATOMIC_BASE + preempt_offset); | |
9554 | } | |
9555 | ||
9556 | void __might_sleep(char *file, int line, int preempt_offset) | |
1da177e4 | 9557 | { |
48f24c4d | 9558 | #ifdef in_atomic |
1da177e4 LT |
9559 | static unsigned long prev_jiffy; /* ratelimiting */ |
9560 | ||
e4aafea2 FW |
9561 | if ((preempt_count_equals(preempt_offset) && !irqs_disabled()) || |
9562 | system_state != SYSTEM_RUNNING || oops_in_progress) | |
aef745fc IM |
9563 | return; |
9564 | if (time_before(jiffies, prev_jiffy + HZ) && prev_jiffy) | |
9565 | return; | |
9566 | prev_jiffy = jiffies; | |
9567 | ||
9568 | printk(KERN_ERR | |
9569 | "BUG: sleeping function called from invalid context at %s:%d\n", | |
9570 | file, line); | |
9571 | printk(KERN_ERR | |
9572 | "in_atomic(): %d, irqs_disabled(): %d, pid: %d, name: %s\n", | |
9573 | in_atomic(), irqs_disabled(), | |
9574 | current->pid, current->comm); | |
9575 | ||
9576 | debug_show_held_locks(current); | |
9577 | if (irqs_disabled()) | |
9578 | print_irqtrace_events(current); | |
9579 | dump_stack(); | |
1da177e4 LT |
9580 | #endif |
9581 | } | |
9582 | EXPORT_SYMBOL(__might_sleep); | |
9583 | #endif | |
9584 | ||
9585 | #ifdef CONFIG_MAGIC_SYSRQ | |
3a5e4dc1 AK |
9586 | static void normalize_task(struct rq *rq, struct task_struct *p) |
9587 | { | |
9588 | int on_rq; | |
3e51f33f | 9589 | |
3a5e4dc1 AK |
9590 | update_rq_clock(rq); |
9591 | on_rq = p->se.on_rq; | |
9592 | if (on_rq) | |
9593 | deactivate_task(rq, p, 0); | |
9594 | __setscheduler(rq, p, SCHED_NORMAL, 0); | |
9595 | if (on_rq) { | |
9596 | activate_task(rq, p, 0); | |
9597 | resched_task(rq->curr); | |
9598 | } | |
9599 | } | |
9600 | ||
1da177e4 LT |
9601 | void normalize_rt_tasks(void) |
9602 | { | |
a0f98a1c | 9603 | struct task_struct *g, *p; |
1da177e4 | 9604 | unsigned long flags; |
70b97a7f | 9605 | struct rq *rq; |
1da177e4 | 9606 | |
4cf5d77a | 9607 | read_lock_irqsave(&tasklist_lock, flags); |
a0f98a1c | 9608 | do_each_thread(g, p) { |
178be793 IM |
9609 | /* |
9610 | * Only normalize user tasks: | |
9611 | */ | |
9612 | if (!p->mm) | |
9613 | continue; | |
9614 | ||
6cfb0d5d | 9615 | p->se.exec_start = 0; |
6cfb0d5d | 9616 | #ifdef CONFIG_SCHEDSTATS |
dd41f596 | 9617 | p->se.wait_start = 0; |
dd41f596 | 9618 | p->se.sleep_start = 0; |
dd41f596 | 9619 | p->se.block_start = 0; |
6cfb0d5d | 9620 | #endif |
dd41f596 IM |
9621 | |
9622 | if (!rt_task(p)) { | |
9623 | /* | |
9624 | * Renice negative nice level userspace | |
9625 | * tasks back to 0: | |
9626 | */ | |
9627 | if (TASK_NICE(p) < 0 && p->mm) | |
9628 | set_user_nice(p, 0); | |
1da177e4 | 9629 | continue; |
dd41f596 | 9630 | } |
1da177e4 | 9631 | |
4cf5d77a | 9632 | spin_lock(&p->pi_lock); |
b29739f9 | 9633 | rq = __task_rq_lock(p); |
1da177e4 | 9634 | |
178be793 | 9635 | normalize_task(rq, p); |
3a5e4dc1 | 9636 | |
b29739f9 | 9637 | __task_rq_unlock(rq); |
4cf5d77a | 9638 | spin_unlock(&p->pi_lock); |
a0f98a1c IM |
9639 | } while_each_thread(g, p); |
9640 | ||
4cf5d77a | 9641 | read_unlock_irqrestore(&tasklist_lock, flags); |
1da177e4 LT |
9642 | } |
9643 | ||
9644 | #endif /* CONFIG_MAGIC_SYSRQ */ | |
1df5c10a LT |
9645 | |
9646 | #ifdef CONFIG_IA64 | |
9647 | /* | |
9648 | * These functions are only useful for the IA64 MCA handling. | |
9649 | * | |
9650 | * They can only be called when the whole system has been | |
9651 | * stopped - every CPU needs to be quiescent, and no scheduling | |
9652 | * activity can take place. Using them for anything else would | |
9653 | * be a serious bug, and as a result, they aren't even visible | |
9654 | * under any other configuration. | |
9655 | */ | |
9656 | ||
9657 | /** | |
9658 | * curr_task - return the current task for a given cpu. | |
9659 | * @cpu: the processor in question. | |
9660 | * | |
9661 | * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED! | |
9662 | */ | |
36c8b586 | 9663 | struct task_struct *curr_task(int cpu) |
1df5c10a LT |
9664 | { |
9665 | return cpu_curr(cpu); | |
9666 | } | |
9667 | ||
9668 | /** | |
9669 | * set_curr_task - set the current task for a given cpu. | |
9670 | * @cpu: the processor in question. | |
9671 | * @p: the task pointer to set. | |
9672 | * | |
9673 | * Description: This function must only be used when non-maskable interrupts | |
41a2d6cf IM |
9674 | * are serviced on a separate stack. It allows the architecture to switch the |
9675 | * notion of the current task on a cpu in a non-blocking manner. This function | |
1df5c10a LT |
9676 | * must be called with all CPU's synchronized, and interrupts disabled, the |
9677 | * and caller must save the original value of the current task (see | |
9678 | * curr_task() above) and restore that value before reenabling interrupts and | |
9679 | * re-starting the system. | |
9680 | * | |
9681 | * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED! | |
9682 | */ | |
36c8b586 | 9683 | void set_curr_task(int cpu, struct task_struct *p) |
1df5c10a LT |
9684 | { |
9685 | cpu_curr(cpu) = p; | |
9686 | } | |
9687 | ||
9688 | #endif | |
29f59db3 | 9689 | |
bccbe08a PZ |
9690 | #ifdef CONFIG_FAIR_GROUP_SCHED |
9691 | static void free_fair_sched_group(struct task_group *tg) | |
6f505b16 PZ |
9692 | { |
9693 | int i; | |
9694 | ||
9695 | for_each_possible_cpu(i) { | |
9696 | if (tg->cfs_rq) | |
9697 | kfree(tg->cfs_rq[i]); | |
9698 | if (tg->se) | |
9699 | kfree(tg->se[i]); | |
6f505b16 PZ |
9700 | } |
9701 | ||
9702 | kfree(tg->cfs_rq); | |
9703 | kfree(tg->se); | |
6f505b16 PZ |
9704 | } |
9705 | ||
ec7dc8ac DG |
9706 | static |
9707 | int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent) | |
29f59db3 | 9708 | { |
29f59db3 | 9709 | struct cfs_rq *cfs_rq; |
eab17229 | 9710 | struct sched_entity *se; |
9b5b7751 | 9711 | struct rq *rq; |
29f59db3 SV |
9712 | int i; |
9713 | ||
434d53b0 | 9714 | tg->cfs_rq = kzalloc(sizeof(cfs_rq) * nr_cpu_ids, GFP_KERNEL); |
29f59db3 SV |
9715 | if (!tg->cfs_rq) |
9716 | goto err; | |
434d53b0 | 9717 | tg->se = kzalloc(sizeof(se) * nr_cpu_ids, GFP_KERNEL); |
29f59db3 SV |
9718 | if (!tg->se) |
9719 | goto err; | |
052f1dc7 PZ |
9720 | |
9721 | tg->shares = NICE_0_LOAD; | |
29f59db3 SV |
9722 | |
9723 | for_each_possible_cpu(i) { | |
9b5b7751 | 9724 | rq = cpu_rq(i); |
29f59db3 | 9725 | |
eab17229 LZ |
9726 | cfs_rq = kzalloc_node(sizeof(struct cfs_rq), |
9727 | GFP_KERNEL, cpu_to_node(i)); | |
29f59db3 SV |
9728 | if (!cfs_rq) |
9729 | goto err; | |
9730 | ||
eab17229 LZ |
9731 | se = kzalloc_node(sizeof(struct sched_entity), |
9732 | GFP_KERNEL, cpu_to_node(i)); | |
29f59db3 SV |
9733 | if (!se) |
9734 | goto err; | |
9735 | ||
eab17229 | 9736 | init_tg_cfs_entry(tg, cfs_rq, se, i, 0, parent->se[i]); |
bccbe08a PZ |
9737 | } |
9738 | ||
9739 | return 1; | |
9740 | ||
9741 | err: | |
9742 | return 0; | |
9743 | } | |
9744 | ||
9745 | static inline void register_fair_sched_group(struct task_group *tg, int cpu) | |
9746 | { | |
9747 | list_add_rcu(&tg->cfs_rq[cpu]->leaf_cfs_rq_list, | |
9748 | &cpu_rq(cpu)->leaf_cfs_rq_list); | |
9749 | } | |
9750 | ||
9751 | static inline void unregister_fair_sched_group(struct task_group *tg, int cpu) | |
9752 | { | |
9753 | list_del_rcu(&tg->cfs_rq[cpu]->leaf_cfs_rq_list); | |
9754 | } | |
6d6bc0ad | 9755 | #else /* !CONFG_FAIR_GROUP_SCHED */ |
bccbe08a PZ |
9756 | static inline void free_fair_sched_group(struct task_group *tg) |
9757 | { | |
9758 | } | |
9759 | ||
ec7dc8ac DG |
9760 | static inline |
9761 | int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent) | |
bccbe08a PZ |
9762 | { |
9763 | return 1; | |
9764 | } | |
9765 | ||
9766 | static inline void register_fair_sched_group(struct task_group *tg, int cpu) | |
9767 | { | |
9768 | } | |
9769 | ||
9770 | static inline void unregister_fair_sched_group(struct task_group *tg, int cpu) | |
9771 | { | |
9772 | } | |
6d6bc0ad | 9773 | #endif /* CONFIG_FAIR_GROUP_SCHED */ |
052f1dc7 PZ |
9774 | |
9775 | #ifdef CONFIG_RT_GROUP_SCHED | |
bccbe08a PZ |
9776 | static void free_rt_sched_group(struct task_group *tg) |
9777 | { | |
9778 | int i; | |
9779 | ||
d0b27fa7 PZ |
9780 | destroy_rt_bandwidth(&tg->rt_bandwidth); |
9781 | ||
bccbe08a PZ |
9782 | for_each_possible_cpu(i) { |
9783 | if (tg->rt_rq) | |
9784 | kfree(tg->rt_rq[i]); | |
9785 | if (tg->rt_se) | |
9786 | kfree(tg->rt_se[i]); | |
9787 | } | |
9788 | ||
9789 | kfree(tg->rt_rq); | |
9790 | kfree(tg->rt_se); | |
9791 | } | |
9792 | ||
ec7dc8ac DG |
9793 | static |
9794 | int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent) | |
bccbe08a PZ |
9795 | { |
9796 | struct rt_rq *rt_rq; | |
eab17229 | 9797 | struct sched_rt_entity *rt_se; |
bccbe08a PZ |
9798 | struct rq *rq; |
9799 | int i; | |
9800 | ||
434d53b0 | 9801 | tg->rt_rq = kzalloc(sizeof(rt_rq) * nr_cpu_ids, GFP_KERNEL); |
bccbe08a PZ |
9802 | if (!tg->rt_rq) |
9803 | goto err; | |
434d53b0 | 9804 | tg->rt_se = kzalloc(sizeof(rt_se) * nr_cpu_ids, GFP_KERNEL); |
bccbe08a PZ |
9805 | if (!tg->rt_se) |
9806 | goto err; | |
9807 | ||
d0b27fa7 PZ |
9808 | init_rt_bandwidth(&tg->rt_bandwidth, |
9809 | ktime_to_ns(def_rt_bandwidth.rt_period), 0); | |
bccbe08a PZ |
9810 | |
9811 | for_each_possible_cpu(i) { | |
9812 | rq = cpu_rq(i); | |
9813 | ||
eab17229 LZ |
9814 | rt_rq = kzalloc_node(sizeof(struct rt_rq), |
9815 | GFP_KERNEL, cpu_to_node(i)); | |
6f505b16 PZ |
9816 | if (!rt_rq) |
9817 | goto err; | |
29f59db3 | 9818 | |
eab17229 LZ |
9819 | rt_se = kzalloc_node(sizeof(struct sched_rt_entity), |
9820 | GFP_KERNEL, cpu_to_node(i)); | |
6f505b16 PZ |
9821 | if (!rt_se) |
9822 | goto err; | |
29f59db3 | 9823 | |
eab17229 | 9824 | init_tg_rt_entry(tg, rt_rq, rt_se, i, 0, parent->rt_se[i]); |
29f59db3 SV |
9825 | } |
9826 | ||
bccbe08a PZ |
9827 | return 1; |
9828 | ||
9829 | err: | |
9830 | return 0; | |
9831 | } | |
9832 | ||
9833 | static inline void register_rt_sched_group(struct task_group *tg, int cpu) | |
9834 | { | |
9835 | list_add_rcu(&tg->rt_rq[cpu]->leaf_rt_rq_list, | |
9836 | &cpu_rq(cpu)->leaf_rt_rq_list); | |
9837 | } | |
9838 | ||
9839 | static inline void unregister_rt_sched_group(struct task_group *tg, int cpu) | |
9840 | { | |
9841 | list_del_rcu(&tg->rt_rq[cpu]->leaf_rt_rq_list); | |
9842 | } | |
6d6bc0ad | 9843 | #else /* !CONFIG_RT_GROUP_SCHED */ |
bccbe08a PZ |
9844 | static inline void free_rt_sched_group(struct task_group *tg) |
9845 | { | |
9846 | } | |
9847 | ||
ec7dc8ac DG |
9848 | static inline |
9849 | int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent) | |
bccbe08a PZ |
9850 | { |
9851 | return 1; | |
9852 | } | |
9853 | ||
9854 | static inline void register_rt_sched_group(struct task_group *tg, int cpu) | |
9855 | { | |
9856 | } | |
9857 | ||
9858 | static inline void unregister_rt_sched_group(struct task_group *tg, int cpu) | |
9859 | { | |
9860 | } | |
6d6bc0ad | 9861 | #endif /* CONFIG_RT_GROUP_SCHED */ |
bccbe08a | 9862 | |
d0b27fa7 | 9863 | #ifdef CONFIG_GROUP_SCHED |
bccbe08a PZ |
9864 | static void free_sched_group(struct task_group *tg) |
9865 | { | |
9866 | free_fair_sched_group(tg); | |
9867 | free_rt_sched_group(tg); | |
9868 | kfree(tg); | |
9869 | } | |
9870 | ||
9871 | /* allocate runqueue etc for a new task group */ | |
ec7dc8ac | 9872 | struct task_group *sched_create_group(struct task_group *parent) |
bccbe08a PZ |
9873 | { |
9874 | struct task_group *tg; | |
9875 | unsigned long flags; | |
9876 | int i; | |
9877 | ||
9878 | tg = kzalloc(sizeof(*tg), GFP_KERNEL); | |
9879 | if (!tg) | |
9880 | return ERR_PTR(-ENOMEM); | |
9881 | ||
ec7dc8ac | 9882 | if (!alloc_fair_sched_group(tg, parent)) |
bccbe08a PZ |
9883 | goto err; |
9884 | ||
ec7dc8ac | 9885 | if (!alloc_rt_sched_group(tg, parent)) |
bccbe08a PZ |
9886 | goto err; |
9887 | ||
8ed36996 | 9888 | spin_lock_irqsave(&task_group_lock, flags); |
9b5b7751 | 9889 | for_each_possible_cpu(i) { |
bccbe08a PZ |
9890 | register_fair_sched_group(tg, i); |
9891 | register_rt_sched_group(tg, i); | |
9b5b7751 | 9892 | } |
6f505b16 | 9893 | list_add_rcu(&tg->list, &task_groups); |
f473aa5e PZ |
9894 | |
9895 | WARN_ON(!parent); /* root should already exist */ | |
9896 | ||
9897 | tg->parent = parent; | |
f473aa5e | 9898 | INIT_LIST_HEAD(&tg->children); |
09f2724a | 9899 | list_add_rcu(&tg->siblings, &parent->children); |
8ed36996 | 9900 | spin_unlock_irqrestore(&task_group_lock, flags); |
29f59db3 | 9901 | |
9b5b7751 | 9902 | return tg; |
29f59db3 SV |
9903 | |
9904 | err: | |
6f505b16 | 9905 | free_sched_group(tg); |
29f59db3 SV |
9906 | return ERR_PTR(-ENOMEM); |
9907 | } | |
9908 | ||
9b5b7751 | 9909 | /* rcu callback to free various structures associated with a task group */ |
6f505b16 | 9910 | static void free_sched_group_rcu(struct rcu_head *rhp) |
29f59db3 | 9911 | { |
29f59db3 | 9912 | /* now it should be safe to free those cfs_rqs */ |
6f505b16 | 9913 | free_sched_group(container_of(rhp, struct task_group, rcu)); |
29f59db3 SV |
9914 | } |
9915 | ||
9b5b7751 | 9916 | /* Destroy runqueue etc associated with a task group */ |
4cf86d77 | 9917 | void sched_destroy_group(struct task_group *tg) |
29f59db3 | 9918 | { |
8ed36996 | 9919 | unsigned long flags; |
9b5b7751 | 9920 | int i; |
29f59db3 | 9921 | |
8ed36996 | 9922 | spin_lock_irqsave(&task_group_lock, flags); |
9b5b7751 | 9923 | for_each_possible_cpu(i) { |
bccbe08a PZ |
9924 | unregister_fair_sched_group(tg, i); |
9925 | unregister_rt_sched_group(tg, i); | |
9b5b7751 | 9926 | } |
6f505b16 | 9927 | list_del_rcu(&tg->list); |
f473aa5e | 9928 | list_del_rcu(&tg->siblings); |
8ed36996 | 9929 | spin_unlock_irqrestore(&task_group_lock, flags); |
9b5b7751 | 9930 | |
9b5b7751 | 9931 | /* wait for possible concurrent references to cfs_rqs complete */ |
6f505b16 | 9932 | call_rcu(&tg->rcu, free_sched_group_rcu); |
29f59db3 SV |
9933 | } |
9934 | ||
9b5b7751 | 9935 | /* change task's runqueue when it moves between groups. |
3a252015 IM |
9936 | * The caller of this function should have put the task in its new group |
9937 | * by now. This function just updates tsk->se.cfs_rq and tsk->se.parent to | |
9938 | * reflect its new group. | |
9b5b7751 SV |
9939 | */ |
9940 | void sched_move_task(struct task_struct *tsk) | |
29f59db3 SV |
9941 | { |
9942 | int on_rq, running; | |
9943 | unsigned long flags; | |
9944 | struct rq *rq; | |
9945 | ||
9946 | rq = task_rq_lock(tsk, &flags); | |
9947 | ||
29f59db3 SV |
9948 | update_rq_clock(rq); |
9949 | ||
051a1d1a | 9950 | running = task_current(rq, tsk); |
29f59db3 SV |
9951 | on_rq = tsk->se.on_rq; |
9952 | ||
0e1f3483 | 9953 | if (on_rq) |
29f59db3 | 9954 | dequeue_task(rq, tsk, 0); |
0e1f3483 HS |
9955 | if (unlikely(running)) |
9956 | tsk->sched_class->put_prev_task(rq, tsk); | |
29f59db3 | 9957 | |
6f505b16 | 9958 | set_task_rq(tsk, task_cpu(tsk)); |
29f59db3 | 9959 | |
810b3817 PZ |
9960 | #ifdef CONFIG_FAIR_GROUP_SCHED |
9961 | if (tsk->sched_class->moved_group) | |
9962 | tsk->sched_class->moved_group(tsk); | |
9963 | #endif | |
9964 | ||
0e1f3483 HS |
9965 | if (unlikely(running)) |
9966 | tsk->sched_class->set_curr_task(rq); | |
9967 | if (on_rq) | |
7074badb | 9968 | enqueue_task(rq, tsk, 0); |
29f59db3 | 9969 | |
29f59db3 SV |
9970 | task_rq_unlock(rq, &flags); |
9971 | } | |
6d6bc0ad | 9972 | #endif /* CONFIG_GROUP_SCHED */ |
29f59db3 | 9973 | |
052f1dc7 | 9974 | #ifdef CONFIG_FAIR_GROUP_SCHED |
c09595f6 | 9975 | static void __set_se_shares(struct sched_entity *se, unsigned long shares) |
29f59db3 SV |
9976 | { |
9977 | struct cfs_rq *cfs_rq = se->cfs_rq; | |
29f59db3 SV |
9978 | int on_rq; |
9979 | ||
29f59db3 | 9980 | on_rq = se->on_rq; |
62fb1851 | 9981 | if (on_rq) |
29f59db3 SV |
9982 | dequeue_entity(cfs_rq, se, 0); |
9983 | ||
9984 | se->load.weight = shares; | |
e05510d0 | 9985 | se->load.inv_weight = 0; |
29f59db3 | 9986 | |
62fb1851 | 9987 | if (on_rq) |
29f59db3 | 9988 | enqueue_entity(cfs_rq, se, 0); |
c09595f6 | 9989 | } |
62fb1851 | 9990 | |
c09595f6 PZ |
9991 | static void set_se_shares(struct sched_entity *se, unsigned long shares) |
9992 | { | |
9993 | struct cfs_rq *cfs_rq = se->cfs_rq; | |
9994 | struct rq *rq = cfs_rq->rq; | |
9995 | unsigned long flags; | |
9996 | ||
9997 | spin_lock_irqsave(&rq->lock, flags); | |
9998 | __set_se_shares(se, shares); | |
9999 | spin_unlock_irqrestore(&rq->lock, flags); | |
29f59db3 SV |
10000 | } |
10001 | ||
8ed36996 PZ |
10002 | static DEFINE_MUTEX(shares_mutex); |
10003 | ||
4cf86d77 | 10004 | int sched_group_set_shares(struct task_group *tg, unsigned long shares) |
29f59db3 SV |
10005 | { |
10006 | int i; | |
8ed36996 | 10007 | unsigned long flags; |
c61935fd | 10008 | |
ec7dc8ac DG |
10009 | /* |
10010 | * We can't change the weight of the root cgroup. | |
10011 | */ | |
10012 | if (!tg->se[0]) | |
10013 | return -EINVAL; | |
10014 | ||
18d95a28 PZ |
10015 | if (shares < MIN_SHARES) |
10016 | shares = MIN_SHARES; | |
cb4ad1ff MX |
10017 | else if (shares > MAX_SHARES) |
10018 | shares = MAX_SHARES; | |
62fb1851 | 10019 | |
8ed36996 | 10020 | mutex_lock(&shares_mutex); |
9b5b7751 | 10021 | if (tg->shares == shares) |
5cb350ba | 10022 | goto done; |
29f59db3 | 10023 | |
8ed36996 | 10024 | spin_lock_irqsave(&task_group_lock, flags); |
bccbe08a PZ |
10025 | for_each_possible_cpu(i) |
10026 | unregister_fair_sched_group(tg, i); | |
f473aa5e | 10027 | list_del_rcu(&tg->siblings); |
8ed36996 | 10028 | spin_unlock_irqrestore(&task_group_lock, flags); |
6b2d7700 SV |
10029 | |
10030 | /* wait for any ongoing reference to this group to finish */ | |
10031 | synchronize_sched(); | |
10032 | ||
10033 | /* | |
10034 | * Now we are free to modify the group's share on each cpu | |
10035 | * w/o tripping rebalance_share or load_balance_fair. | |
10036 | */ | |
9b5b7751 | 10037 | tg->shares = shares; |
c09595f6 PZ |
10038 | for_each_possible_cpu(i) { |
10039 | /* | |
10040 | * force a rebalance | |
10041 | */ | |
10042 | cfs_rq_set_shares(tg->cfs_rq[i], 0); | |
cb4ad1ff | 10043 | set_se_shares(tg->se[i], shares); |
c09595f6 | 10044 | } |
29f59db3 | 10045 | |
6b2d7700 SV |
10046 | /* |
10047 | * Enable load balance activity on this group, by inserting it back on | |
10048 | * each cpu's rq->leaf_cfs_rq_list. | |
10049 | */ | |
8ed36996 | 10050 | spin_lock_irqsave(&task_group_lock, flags); |
bccbe08a PZ |
10051 | for_each_possible_cpu(i) |
10052 | register_fair_sched_group(tg, i); | |
f473aa5e | 10053 | list_add_rcu(&tg->siblings, &tg->parent->children); |
8ed36996 | 10054 | spin_unlock_irqrestore(&task_group_lock, flags); |
5cb350ba | 10055 | done: |
8ed36996 | 10056 | mutex_unlock(&shares_mutex); |
9b5b7751 | 10057 | return 0; |
29f59db3 SV |
10058 | } |
10059 | ||
5cb350ba DG |
10060 | unsigned long sched_group_shares(struct task_group *tg) |
10061 | { | |
10062 | return tg->shares; | |
10063 | } | |
052f1dc7 | 10064 | #endif |
5cb350ba | 10065 | |
052f1dc7 | 10066 | #ifdef CONFIG_RT_GROUP_SCHED |
6f505b16 | 10067 | /* |
9f0c1e56 | 10068 | * Ensure that the real time constraints are schedulable. |
6f505b16 | 10069 | */ |
9f0c1e56 PZ |
10070 | static DEFINE_MUTEX(rt_constraints_mutex); |
10071 | ||
10072 | static unsigned long to_ratio(u64 period, u64 runtime) | |
10073 | { | |
10074 | if (runtime == RUNTIME_INF) | |
9a7e0b18 | 10075 | return 1ULL << 20; |
9f0c1e56 | 10076 | |
9a7e0b18 | 10077 | return div64_u64(runtime << 20, period); |
9f0c1e56 PZ |
10078 | } |
10079 | ||
9a7e0b18 PZ |
10080 | /* Must be called with tasklist_lock held */ |
10081 | static inline int tg_has_rt_tasks(struct task_group *tg) | |
b40b2e8e | 10082 | { |
9a7e0b18 | 10083 | struct task_struct *g, *p; |
b40b2e8e | 10084 | |
9a7e0b18 PZ |
10085 | do_each_thread(g, p) { |
10086 | if (rt_task(p) && rt_rq_of_se(&p->rt)->tg == tg) | |
10087 | return 1; | |
10088 | } while_each_thread(g, p); | |
b40b2e8e | 10089 | |
9a7e0b18 PZ |
10090 | return 0; |
10091 | } | |
b40b2e8e | 10092 | |
9a7e0b18 PZ |
10093 | struct rt_schedulable_data { |
10094 | struct task_group *tg; | |
10095 | u64 rt_period; | |
10096 | u64 rt_runtime; | |
10097 | }; | |
b40b2e8e | 10098 | |
9a7e0b18 PZ |
10099 | static int tg_schedulable(struct task_group *tg, void *data) |
10100 | { | |
10101 | struct rt_schedulable_data *d = data; | |
10102 | struct task_group *child; | |
10103 | unsigned long total, sum = 0; | |
10104 | u64 period, runtime; | |
b40b2e8e | 10105 | |
9a7e0b18 PZ |
10106 | period = ktime_to_ns(tg->rt_bandwidth.rt_period); |
10107 | runtime = tg->rt_bandwidth.rt_runtime; | |
b40b2e8e | 10108 | |
9a7e0b18 PZ |
10109 | if (tg == d->tg) { |
10110 | period = d->rt_period; | |
10111 | runtime = d->rt_runtime; | |
b40b2e8e | 10112 | } |
b40b2e8e | 10113 | |
98a4826b PZ |
10114 | #ifdef CONFIG_USER_SCHED |
10115 | if (tg == &root_task_group) { | |
10116 | period = global_rt_period(); | |
10117 | runtime = global_rt_runtime(); | |
10118 | } | |
10119 | #endif | |
10120 | ||
4653f803 PZ |
10121 | /* |
10122 | * Cannot have more runtime than the period. | |
10123 | */ | |
10124 | if (runtime > period && runtime != RUNTIME_INF) | |
10125 | return -EINVAL; | |
6f505b16 | 10126 | |
4653f803 PZ |
10127 | /* |
10128 | * Ensure we don't starve existing RT tasks. | |
10129 | */ | |
9a7e0b18 PZ |
10130 | if (rt_bandwidth_enabled() && !runtime && tg_has_rt_tasks(tg)) |
10131 | return -EBUSY; | |
6f505b16 | 10132 | |
9a7e0b18 | 10133 | total = to_ratio(period, runtime); |
6f505b16 | 10134 | |
4653f803 PZ |
10135 | /* |
10136 | * Nobody can have more than the global setting allows. | |
10137 | */ | |
10138 | if (total > to_ratio(global_rt_period(), global_rt_runtime())) | |
10139 | return -EINVAL; | |
6f505b16 | 10140 | |
4653f803 PZ |
10141 | /* |
10142 | * The sum of our children's runtime should not exceed our own. | |
10143 | */ | |
9a7e0b18 PZ |
10144 | list_for_each_entry_rcu(child, &tg->children, siblings) { |
10145 | period = ktime_to_ns(child->rt_bandwidth.rt_period); | |
10146 | runtime = child->rt_bandwidth.rt_runtime; | |
6f505b16 | 10147 | |
9a7e0b18 PZ |
10148 | if (child == d->tg) { |
10149 | period = d->rt_period; | |
10150 | runtime = d->rt_runtime; | |
10151 | } | |
6f505b16 | 10152 | |
9a7e0b18 | 10153 | sum += to_ratio(period, runtime); |
9f0c1e56 | 10154 | } |
6f505b16 | 10155 | |
9a7e0b18 PZ |
10156 | if (sum > total) |
10157 | return -EINVAL; | |
10158 | ||
10159 | return 0; | |
6f505b16 PZ |
10160 | } |
10161 | ||
9a7e0b18 | 10162 | static int __rt_schedulable(struct task_group *tg, u64 period, u64 runtime) |
521f1a24 | 10163 | { |
9a7e0b18 PZ |
10164 | struct rt_schedulable_data data = { |
10165 | .tg = tg, | |
10166 | .rt_period = period, | |
10167 | .rt_runtime = runtime, | |
10168 | }; | |
10169 | ||
10170 | return walk_tg_tree(tg_schedulable, tg_nop, &data); | |
521f1a24 DG |
10171 | } |
10172 | ||
d0b27fa7 PZ |
10173 | static int tg_set_bandwidth(struct task_group *tg, |
10174 | u64 rt_period, u64 rt_runtime) | |
6f505b16 | 10175 | { |
ac086bc2 | 10176 | int i, err = 0; |
9f0c1e56 | 10177 | |
9f0c1e56 | 10178 | mutex_lock(&rt_constraints_mutex); |
521f1a24 | 10179 | read_lock(&tasklist_lock); |
9a7e0b18 PZ |
10180 | err = __rt_schedulable(tg, rt_period, rt_runtime); |
10181 | if (err) | |
9f0c1e56 | 10182 | goto unlock; |
ac086bc2 PZ |
10183 | |
10184 | spin_lock_irq(&tg->rt_bandwidth.rt_runtime_lock); | |
d0b27fa7 PZ |
10185 | tg->rt_bandwidth.rt_period = ns_to_ktime(rt_period); |
10186 | tg->rt_bandwidth.rt_runtime = rt_runtime; | |
ac086bc2 PZ |
10187 | |
10188 | for_each_possible_cpu(i) { | |
10189 | struct rt_rq *rt_rq = tg->rt_rq[i]; | |
10190 | ||
10191 | spin_lock(&rt_rq->rt_runtime_lock); | |
10192 | rt_rq->rt_runtime = rt_runtime; | |
10193 | spin_unlock(&rt_rq->rt_runtime_lock); | |
10194 | } | |
10195 | spin_unlock_irq(&tg->rt_bandwidth.rt_runtime_lock); | |
9f0c1e56 | 10196 | unlock: |
521f1a24 | 10197 | read_unlock(&tasklist_lock); |
9f0c1e56 PZ |
10198 | mutex_unlock(&rt_constraints_mutex); |
10199 | ||
10200 | return err; | |
6f505b16 PZ |
10201 | } |
10202 | ||
d0b27fa7 PZ |
10203 | int sched_group_set_rt_runtime(struct task_group *tg, long rt_runtime_us) |
10204 | { | |
10205 | u64 rt_runtime, rt_period; | |
10206 | ||
10207 | rt_period = ktime_to_ns(tg->rt_bandwidth.rt_period); | |
10208 | rt_runtime = (u64)rt_runtime_us * NSEC_PER_USEC; | |
10209 | if (rt_runtime_us < 0) | |
10210 | rt_runtime = RUNTIME_INF; | |
10211 | ||
10212 | return tg_set_bandwidth(tg, rt_period, rt_runtime); | |
10213 | } | |
10214 | ||
9f0c1e56 PZ |
10215 | long sched_group_rt_runtime(struct task_group *tg) |
10216 | { | |
10217 | u64 rt_runtime_us; | |
10218 | ||
d0b27fa7 | 10219 | if (tg->rt_bandwidth.rt_runtime == RUNTIME_INF) |
9f0c1e56 PZ |
10220 | return -1; |
10221 | ||
d0b27fa7 | 10222 | rt_runtime_us = tg->rt_bandwidth.rt_runtime; |
9f0c1e56 PZ |
10223 | do_div(rt_runtime_us, NSEC_PER_USEC); |
10224 | return rt_runtime_us; | |
10225 | } | |
d0b27fa7 PZ |
10226 | |
10227 | int sched_group_set_rt_period(struct task_group *tg, long rt_period_us) | |
10228 | { | |
10229 | u64 rt_runtime, rt_period; | |
10230 | ||
10231 | rt_period = (u64)rt_period_us * NSEC_PER_USEC; | |
10232 | rt_runtime = tg->rt_bandwidth.rt_runtime; | |
10233 | ||
619b0488 R |
10234 | if (rt_period == 0) |
10235 | return -EINVAL; | |
10236 | ||
d0b27fa7 PZ |
10237 | return tg_set_bandwidth(tg, rt_period, rt_runtime); |
10238 | } | |
10239 | ||
10240 | long sched_group_rt_period(struct task_group *tg) | |
10241 | { | |
10242 | u64 rt_period_us; | |
10243 | ||
10244 | rt_period_us = ktime_to_ns(tg->rt_bandwidth.rt_period); | |
10245 | do_div(rt_period_us, NSEC_PER_USEC); | |
10246 | return rt_period_us; | |
10247 | } | |
10248 | ||
10249 | static int sched_rt_global_constraints(void) | |
10250 | { | |
4653f803 | 10251 | u64 runtime, period; |
d0b27fa7 PZ |
10252 | int ret = 0; |
10253 | ||
ec5d4989 HS |
10254 | if (sysctl_sched_rt_period <= 0) |
10255 | return -EINVAL; | |
10256 | ||
4653f803 PZ |
10257 | runtime = global_rt_runtime(); |
10258 | period = global_rt_period(); | |
10259 | ||
10260 | /* | |
10261 | * Sanity check on the sysctl variables. | |
10262 | */ | |
10263 | if (runtime > period && runtime != RUNTIME_INF) | |
10264 | return -EINVAL; | |
10b612f4 | 10265 | |
d0b27fa7 | 10266 | mutex_lock(&rt_constraints_mutex); |
9a7e0b18 | 10267 | read_lock(&tasklist_lock); |
4653f803 | 10268 | ret = __rt_schedulable(NULL, 0, 0); |
9a7e0b18 | 10269 | read_unlock(&tasklist_lock); |
d0b27fa7 PZ |
10270 | mutex_unlock(&rt_constraints_mutex); |
10271 | ||
10272 | return ret; | |
10273 | } | |
54e99124 DG |
10274 | |
10275 | int sched_rt_can_attach(struct task_group *tg, struct task_struct *tsk) | |
10276 | { | |
10277 | /* Don't accept realtime tasks when there is no way for them to run */ | |
10278 | if (rt_task(tsk) && tg->rt_bandwidth.rt_runtime == 0) | |
10279 | return 0; | |
10280 | ||
10281 | return 1; | |
10282 | } | |
10283 | ||
6d6bc0ad | 10284 | #else /* !CONFIG_RT_GROUP_SCHED */ |
d0b27fa7 PZ |
10285 | static int sched_rt_global_constraints(void) |
10286 | { | |
ac086bc2 PZ |
10287 | unsigned long flags; |
10288 | int i; | |
10289 | ||
ec5d4989 HS |
10290 | if (sysctl_sched_rt_period <= 0) |
10291 | return -EINVAL; | |
10292 | ||
60aa605d PZ |
10293 | /* |
10294 | * There's always some RT tasks in the root group | |
10295 | * -- migration, kstopmachine etc.. | |
10296 | */ | |
10297 | if (sysctl_sched_rt_runtime == 0) | |
10298 | return -EBUSY; | |
10299 | ||
ac086bc2 PZ |
10300 | spin_lock_irqsave(&def_rt_bandwidth.rt_runtime_lock, flags); |
10301 | for_each_possible_cpu(i) { | |
10302 | struct rt_rq *rt_rq = &cpu_rq(i)->rt; | |
10303 | ||
10304 | spin_lock(&rt_rq->rt_runtime_lock); | |
10305 | rt_rq->rt_runtime = global_rt_runtime(); | |
10306 | spin_unlock(&rt_rq->rt_runtime_lock); | |
10307 | } | |
10308 | spin_unlock_irqrestore(&def_rt_bandwidth.rt_runtime_lock, flags); | |
10309 | ||
d0b27fa7 PZ |
10310 | return 0; |
10311 | } | |
6d6bc0ad | 10312 | #endif /* CONFIG_RT_GROUP_SCHED */ |
d0b27fa7 PZ |
10313 | |
10314 | int sched_rt_handler(struct ctl_table *table, int write, | |
8d65af78 | 10315 | void __user *buffer, size_t *lenp, |
d0b27fa7 PZ |
10316 | loff_t *ppos) |
10317 | { | |
10318 | int ret; | |
10319 | int old_period, old_runtime; | |
10320 | static DEFINE_MUTEX(mutex); | |
10321 | ||
10322 | mutex_lock(&mutex); | |
10323 | old_period = sysctl_sched_rt_period; | |
10324 | old_runtime = sysctl_sched_rt_runtime; | |
10325 | ||
8d65af78 | 10326 | ret = proc_dointvec(table, write, buffer, lenp, ppos); |
d0b27fa7 PZ |
10327 | |
10328 | if (!ret && write) { | |
10329 | ret = sched_rt_global_constraints(); | |
10330 | if (ret) { | |
10331 | sysctl_sched_rt_period = old_period; | |
10332 | sysctl_sched_rt_runtime = old_runtime; | |
10333 | } else { | |
10334 | def_rt_bandwidth.rt_runtime = global_rt_runtime(); | |
10335 | def_rt_bandwidth.rt_period = | |
10336 | ns_to_ktime(global_rt_period()); | |
10337 | } | |
10338 | } | |
10339 | mutex_unlock(&mutex); | |
10340 | ||
10341 | return ret; | |
10342 | } | |
68318b8e | 10343 | |
052f1dc7 | 10344 | #ifdef CONFIG_CGROUP_SCHED |
68318b8e SV |
10345 | |
10346 | /* return corresponding task_group object of a cgroup */ | |
2b01dfe3 | 10347 | static inline struct task_group *cgroup_tg(struct cgroup *cgrp) |
68318b8e | 10348 | { |
2b01dfe3 PM |
10349 | return container_of(cgroup_subsys_state(cgrp, cpu_cgroup_subsys_id), |
10350 | struct task_group, css); | |
68318b8e SV |
10351 | } |
10352 | ||
10353 | static struct cgroup_subsys_state * | |
2b01dfe3 | 10354 | cpu_cgroup_create(struct cgroup_subsys *ss, struct cgroup *cgrp) |
68318b8e | 10355 | { |
ec7dc8ac | 10356 | struct task_group *tg, *parent; |
68318b8e | 10357 | |
2b01dfe3 | 10358 | if (!cgrp->parent) { |
68318b8e | 10359 | /* This is early initialization for the top cgroup */ |
68318b8e SV |
10360 | return &init_task_group.css; |
10361 | } | |
10362 | ||
ec7dc8ac DG |
10363 | parent = cgroup_tg(cgrp->parent); |
10364 | tg = sched_create_group(parent); | |
68318b8e SV |
10365 | if (IS_ERR(tg)) |
10366 | return ERR_PTR(-ENOMEM); | |
10367 | ||
68318b8e SV |
10368 | return &tg->css; |
10369 | } | |
10370 | ||
41a2d6cf IM |
10371 | static void |
10372 | cpu_cgroup_destroy(struct cgroup_subsys *ss, struct cgroup *cgrp) | |
68318b8e | 10373 | { |
2b01dfe3 | 10374 | struct task_group *tg = cgroup_tg(cgrp); |
68318b8e SV |
10375 | |
10376 | sched_destroy_group(tg); | |
10377 | } | |
10378 | ||
41a2d6cf | 10379 | static int |
be367d09 | 10380 | cpu_cgroup_can_attach_task(struct cgroup *cgrp, struct task_struct *tsk) |
68318b8e | 10381 | { |
b68aa230 | 10382 | #ifdef CONFIG_RT_GROUP_SCHED |
54e99124 | 10383 | if (!sched_rt_can_attach(cgroup_tg(cgrp), tsk)) |
b68aa230 PZ |
10384 | return -EINVAL; |
10385 | #else | |
68318b8e SV |
10386 | /* We don't support RT-tasks being in separate groups */ |
10387 | if (tsk->sched_class != &fair_sched_class) | |
10388 | return -EINVAL; | |
b68aa230 | 10389 | #endif |
be367d09 BB |
10390 | return 0; |
10391 | } | |
68318b8e | 10392 | |
be367d09 BB |
10393 | static int |
10394 | cpu_cgroup_can_attach(struct cgroup_subsys *ss, struct cgroup *cgrp, | |
10395 | struct task_struct *tsk, bool threadgroup) | |
10396 | { | |
10397 | int retval = cpu_cgroup_can_attach_task(cgrp, tsk); | |
10398 | if (retval) | |
10399 | return retval; | |
10400 | if (threadgroup) { | |
10401 | struct task_struct *c; | |
10402 | rcu_read_lock(); | |
10403 | list_for_each_entry_rcu(c, &tsk->thread_group, thread_group) { | |
10404 | retval = cpu_cgroup_can_attach_task(cgrp, c); | |
10405 | if (retval) { | |
10406 | rcu_read_unlock(); | |
10407 | return retval; | |
10408 | } | |
10409 | } | |
10410 | rcu_read_unlock(); | |
10411 | } | |
68318b8e SV |
10412 | return 0; |
10413 | } | |
10414 | ||
10415 | static void | |
2b01dfe3 | 10416 | cpu_cgroup_attach(struct cgroup_subsys *ss, struct cgroup *cgrp, |
be367d09 BB |
10417 | struct cgroup *old_cont, struct task_struct *tsk, |
10418 | bool threadgroup) | |
68318b8e SV |
10419 | { |
10420 | sched_move_task(tsk); | |
be367d09 BB |
10421 | if (threadgroup) { |
10422 | struct task_struct *c; | |
10423 | rcu_read_lock(); | |
10424 | list_for_each_entry_rcu(c, &tsk->thread_group, thread_group) { | |
10425 | sched_move_task(c); | |
10426 | } | |
10427 | rcu_read_unlock(); | |
10428 | } | |
68318b8e SV |
10429 | } |
10430 | ||
052f1dc7 | 10431 | #ifdef CONFIG_FAIR_GROUP_SCHED |
f4c753b7 | 10432 | static int cpu_shares_write_u64(struct cgroup *cgrp, struct cftype *cftype, |
2b01dfe3 | 10433 | u64 shareval) |
68318b8e | 10434 | { |
2b01dfe3 | 10435 | return sched_group_set_shares(cgroup_tg(cgrp), shareval); |
68318b8e SV |
10436 | } |
10437 | ||
f4c753b7 | 10438 | static u64 cpu_shares_read_u64(struct cgroup *cgrp, struct cftype *cft) |
68318b8e | 10439 | { |
2b01dfe3 | 10440 | struct task_group *tg = cgroup_tg(cgrp); |
68318b8e SV |
10441 | |
10442 | return (u64) tg->shares; | |
10443 | } | |
6d6bc0ad | 10444 | #endif /* CONFIG_FAIR_GROUP_SCHED */ |
68318b8e | 10445 | |
052f1dc7 | 10446 | #ifdef CONFIG_RT_GROUP_SCHED |
0c70814c | 10447 | static int cpu_rt_runtime_write(struct cgroup *cgrp, struct cftype *cft, |
06ecb27c | 10448 | s64 val) |
6f505b16 | 10449 | { |
06ecb27c | 10450 | return sched_group_set_rt_runtime(cgroup_tg(cgrp), val); |
6f505b16 PZ |
10451 | } |
10452 | ||
06ecb27c | 10453 | static s64 cpu_rt_runtime_read(struct cgroup *cgrp, struct cftype *cft) |
6f505b16 | 10454 | { |
06ecb27c | 10455 | return sched_group_rt_runtime(cgroup_tg(cgrp)); |
6f505b16 | 10456 | } |
d0b27fa7 PZ |
10457 | |
10458 | static int cpu_rt_period_write_uint(struct cgroup *cgrp, struct cftype *cftype, | |
10459 | u64 rt_period_us) | |
10460 | { | |
10461 | return sched_group_set_rt_period(cgroup_tg(cgrp), rt_period_us); | |
10462 | } | |
10463 | ||
10464 | static u64 cpu_rt_period_read_uint(struct cgroup *cgrp, struct cftype *cft) | |
10465 | { | |
10466 | return sched_group_rt_period(cgroup_tg(cgrp)); | |
10467 | } | |
6d6bc0ad | 10468 | #endif /* CONFIG_RT_GROUP_SCHED */ |
6f505b16 | 10469 | |
fe5c7cc2 | 10470 | static struct cftype cpu_files[] = { |
052f1dc7 | 10471 | #ifdef CONFIG_FAIR_GROUP_SCHED |
fe5c7cc2 PM |
10472 | { |
10473 | .name = "shares", | |
f4c753b7 PM |
10474 | .read_u64 = cpu_shares_read_u64, |
10475 | .write_u64 = cpu_shares_write_u64, | |
fe5c7cc2 | 10476 | }, |
052f1dc7 PZ |
10477 | #endif |
10478 | #ifdef CONFIG_RT_GROUP_SCHED | |
6f505b16 | 10479 | { |
9f0c1e56 | 10480 | .name = "rt_runtime_us", |
06ecb27c PM |
10481 | .read_s64 = cpu_rt_runtime_read, |
10482 | .write_s64 = cpu_rt_runtime_write, | |
6f505b16 | 10483 | }, |
d0b27fa7 PZ |
10484 | { |
10485 | .name = "rt_period_us", | |
f4c753b7 PM |
10486 | .read_u64 = cpu_rt_period_read_uint, |
10487 | .write_u64 = cpu_rt_period_write_uint, | |
d0b27fa7 | 10488 | }, |
052f1dc7 | 10489 | #endif |
68318b8e SV |
10490 | }; |
10491 | ||
10492 | static int cpu_cgroup_populate(struct cgroup_subsys *ss, struct cgroup *cont) | |
10493 | { | |
fe5c7cc2 | 10494 | return cgroup_add_files(cont, ss, cpu_files, ARRAY_SIZE(cpu_files)); |
68318b8e SV |
10495 | } |
10496 | ||
10497 | struct cgroup_subsys cpu_cgroup_subsys = { | |
38605cae IM |
10498 | .name = "cpu", |
10499 | .create = cpu_cgroup_create, | |
10500 | .destroy = cpu_cgroup_destroy, | |
10501 | .can_attach = cpu_cgroup_can_attach, | |
10502 | .attach = cpu_cgroup_attach, | |
10503 | .populate = cpu_cgroup_populate, | |
10504 | .subsys_id = cpu_cgroup_subsys_id, | |
68318b8e SV |
10505 | .early_init = 1, |
10506 | }; | |
10507 | ||
052f1dc7 | 10508 | #endif /* CONFIG_CGROUP_SCHED */ |
d842de87 SV |
10509 | |
10510 | #ifdef CONFIG_CGROUP_CPUACCT | |
10511 | ||
10512 | /* | |
10513 | * CPU accounting code for task groups. | |
10514 | * | |
10515 | * Based on the work by Paul Menage (menage@google.com) and Balbir Singh | |
10516 | * (balbir@in.ibm.com). | |
10517 | */ | |
10518 | ||
934352f2 | 10519 | /* track cpu usage of a group of tasks and its child groups */ |
d842de87 SV |
10520 | struct cpuacct { |
10521 | struct cgroup_subsys_state css; | |
10522 | /* cpuusage holds pointer to a u64-type object on every cpu */ | |
10523 | u64 *cpuusage; | |
ef12fefa | 10524 | struct percpu_counter cpustat[CPUACCT_STAT_NSTATS]; |
934352f2 | 10525 | struct cpuacct *parent; |
d842de87 SV |
10526 | }; |
10527 | ||
10528 | struct cgroup_subsys cpuacct_subsys; | |
10529 | ||
10530 | /* return cpu accounting group corresponding to this container */ | |
32cd756a | 10531 | static inline struct cpuacct *cgroup_ca(struct cgroup *cgrp) |
d842de87 | 10532 | { |
32cd756a | 10533 | return container_of(cgroup_subsys_state(cgrp, cpuacct_subsys_id), |
d842de87 SV |
10534 | struct cpuacct, css); |
10535 | } | |
10536 | ||
10537 | /* return cpu accounting group to which this task belongs */ | |
10538 | static inline struct cpuacct *task_ca(struct task_struct *tsk) | |
10539 | { | |
10540 | return container_of(task_subsys_state(tsk, cpuacct_subsys_id), | |
10541 | struct cpuacct, css); | |
10542 | } | |
10543 | ||
10544 | /* create a new cpu accounting group */ | |
10545 | static struct cgroup_subsys_state *cpuacct_create( | |
32cd756a | 10546 | struct cgroup_subsys *ss, struct cgroup *cgrp) |
d842de87 SV |
10547 | { |
10548 | struct cpuacct *ca = kzalloc(sizeof(*ca), GFP_KERNEL); | |
ef12fefa | 10549 | int i; |
d842de87 SV |
10550 | |
10551 | if (!ca) | |
ef12fefa | 10552 | goto out; |
d842de87 SV |
10553 | |
10554 | ca->cpuusage = alloc_percpu(u64); | |
ef12fefa BR |
10555 | if (!ca->cpuusage) |
10556 | goto out_free_ca; | |
10557 | ||
10558 | for (i = 0; i < CPUACCT_STAT_NSTATS; i++) | |
10559 | if (percpu_counter_init(&ca->cpustat[i], 0)) | |
10560 | goto out_free_counters; | |
d842de87 | 10561 | |
934352f2 BR |
10562 | if (cgrp->parent) |
10563 | ca->parent = cgroup_ca(cgrp->parent); | |
10564 | ||
d842de87 | 10565 | return &ca->css; |
ef12fefa BR |
10566 | |
10567 | out_free_counters: | |
10568 | while (--i >= 0) | |
10569 | percpu_counter_destroy(&ca->cpustat[i]); | |
10570 | free_percpu(ca->cpuusage); | |
10571 | out_free_ca: | |
10572 | kfree(ca); | |
10573 | out: | |
10574 | return ERR_PTR(-ENOMEM); | |
d842de87 SV |
10575 | } |
10576 | ||
10577 | /* destroy an existing cpu accounting group */ | |
41a2d6cf | 10578 | static void |
32cd756a | 10579 | cpuacct_destroy(struct cgroup_subsys *ss, struct cgroup *cgrp) |
d842de87 | 10580 | { |
32cd756a | 10581 | struct cpuacct *ca = cgroup_ca(cgrp); |
ef12fefa | 10582 | int i; |
d842de87 | 10583 | |
ef12fefa BR |
10584 | for (i = 0; i < CPUACCT_STAT_NSTATS; i++) |
10585 | percpu_counter_destroy(&ca->cpustat[i]); | |
d842de87 SV |
10586 | free_percpu(ca->cpuusage); |
10587 | kfree(ca); | |
10588 | } | |
10589 | ||
720f5498 KC |
10590 | static u64 cpuacct_cpuusage_read(struct cpuacct *ca, int cpu) |
10591 | { | |
b36128c8 | 10592 | u64 *cpuusage = per_cpu_ptr(ca->cpuusage, cpu); |
720f5498 KC |
10593 | u64 data; |
10594 | ||
10595 | #ifndef CONFIG_64BIT | |
10596 | /* | |
10597 | * Take rq->lock to make 64-bit read safe on 32-bit platforms. | |
10598 | */ | |
10599 | spin_lock_irq(&cpu_rq(cpu)->lock); | |
10600 | data = *cpuusage; | |
10601 | spin_unlock_irq(&cpu_rq(cpu)->lock); | |
10602 | #else | |
10603 | data = *cpuusage; | |
10604 | #endif | |
10605 | ||
10606 | return data; | |
10607 | } | |
10608 | ||
10609 | static void cpuacct_cpuusage_write(struct cpuacct *ca, int cpu, u64 val) | |
10610 | { | |
b36128c8 | 10611 | u64 *cpuusage = per_cpu_ptr(ca->cpuusage, cpu); |
720f5498 KC |
10612 | |
10613 | #ifndef CONFIG_64BIT | |
10614 | /* | |
10615 | * Take rq->lock to make 64-bit write safe on 32-bit platforms. | |
10616 | */ | |
10617 | spin_lock_irq(&cpu_rq(cpu)->lock); | |
10618 | *cpuusage = val; | |
10619 | spin_unlock_irq(&cpu_rq(cpu)->lock); | |
10620 | #else | |
10621 | *cpuusage = val; | |
10622 | #endif | |
10623 | } | |
10624 | ||
d842de87 | 10625 | /* return total cpu usage (in nanoseconds) of a group */ |
32cd756a | 10626 | static u64 cpuusage_read(struct cgroup *cgrp, struct cftype *cft) |
d842de87 | 10627 | { |
32cd756a | 10628 | struct cpuacct *ca = cgroup_ca(cgrp); |
d842de87 SV |
10629 | u64 totalcpuusage = 0; |
10630 | int i; | |
10631 | ||
720f5498 KC |
10632 | for_each_present_cpu(i) |
10633 | totalcpuusage += cpuacct_cpuusage_read(ca, i); | |
d842de87 SV |
10634 | |
10635 | return totalcpuusage; | |
10636 | } | |
10637 | ||
0297b803 DG |
10638 | static int cpuusage_write(struct cgroup *cgrp, struct cftype *cftype, |
10639 | u64 reset) | |
10640 | { | |
10641 | struct cpuacct *ca = cgroup_ca(cgrp); | |
10642 | int err = 0; | |
10643 | int i; | |
10644 | ||
10645 | if (reset) { | |
10646 | err = -EINVAL; | |
10647 | goto out; | |
10648 | } | |
10649 | ||
720f5498 KC |
10650 | for_each_present_cpu(i) |
10651 | cpuacct_cpuusage_write(ca, i, 0); | |
0297b803 | 10652 | |
0297b803 DG |
10653 | out: |
10654 | return err; | |
10655 | } | |
10656 | ||
e9515c3c KC |
10657 | static int cpuacct_percpu_seq_read(struct cgroup *cgroup, struct cftype *cft, |
10658 | struct seq_file *m) | |
10659 | { | |
10660 | struct cpuacct *ca = cgroup_ca(cgroup); | |
10661 | u64 percpu; | |
10662 | int i; | |
10663 | ||
10664 | for_each_present_cpu(i) { | |
10665 | percpu = cpuacct_cpuusage_read(ca, i); | |
10666 | seq_printf(m, "%llu ", (unsigned long long) percpu); | |
10667 | } | |
10668 | seq_printf(m, "\n"); | |
10669 | return 0; | |
10670 | } | |
10671 | ||
ef12fefa BR |
10672 | static const char *cpuacct_stat_desc[] = { |
10673 | [CPUACCT_STAT_USER] = "user", | |
10674 | [CPUACCT_STAT_SYSTEM] = "system", | |
10675 | }; | |
10676 | ||
10677 | static int cpuacct_stats_show(struct cgroup *cgrp, struct cftype *cft, | |
10678 | struct cgroup_map_cb *cb) | |
10679 | { | |
10680 | struct cpuacct *ca = cgroup_ca(cgrp); | |
10681 | int i; | |
10682 | ||
10683 | for (i = 0; i < CPUACCT_STAT_NSTATS; i++) { | |
10684 | s64 val = percpu_counter_read(&ca->cpustat[i]); | |
10685 | val = cputime64_to_clock_t(val); | |
10686 | cb->fill(cb, cpuacct_stat_desc[i], val); | |
10687 | } | |
10688 | return 0; | |
10689 | } | |
10690 | ||
d842de87 SV |
10691 | static struct cftype files[] = { |
10692 | { | |
10693 | .name = "usage", | |
f4c753b7 PM |
10694 | .read_u64 = cpuusage_read, |
10695 | .write_u64 = cpuusage_write, | |
d842de87 | 10696 | }, |
e9515c3c KC |
10697 | { |
10698 | .name = "usage_percpu", | |
10699 | .read_seq_string = cpuacct_percpu_seq_read, | |
10700 | }, | |
ef12fefa BR |
10701 | { |
10702 | .name = "stat", | |
10703 | .read_map = cpuacct_stats_show, | |
10704 | }, | |
d842de87 SV |
10705 | }; |
10706 | ||
32cd756a | 10707 | static int cpuacct_populate(struct cgroup_subsys *ss, struct cgroup *cgrp) |
d842de87 | 10708 | { |
32cd756a | 10709 | return cgroup_add_files(cgrp, ss, files, ARRAY_SIZE(files)); |
d842de87 SV |
10710 | } |
10711 | ||
10712 | /* | |
10713 | * charge this task's execution time to its accounting group. | |
10714 | * | |
10715 | * called with rq->lock held. | |
10716 | */ | |
10717 | static void cpuacct_charge(struct task_struct *tsk, u64 cputime) | |
10718 | { | |
10719 | struct cpuacct *ca; | |
934352f2 | 10720 | int cpu; |
d842de87 | 10721 | |
c40c6f85 | 10722 | if (unlikely(!cpuacct_subsys.active)) |
d842de87 SV |
10723 | return; |
10724 | ||
934352f2 | 10725 | cpu = task_cpu(tsk); |
a18b83b7 BR |
10726 | |
10727 | rcu_read_lock(); | |
10728 | ||
d842de87 | 10729 | ca = task_ca(tsk); |
d842de87 | 10730 | |
934352f2 | 10731 | for (; ca; ca = ca->parent) { |
b36128c8 | 10732 | u64 *cpuusage = per_cpu_ptr(ca->cpuusage, cpu); |
d842de87 SV |
10733 | *cpuusage += cputime; |
10734 | } | |
a18b83b7 BR |
10735 | |
10736 | rcu_read_unlock(); | |
d842de87 SV |
10737 | } |
10738 | ||
ef12fefa BR |
10739 | /* |
10740 | * Charge the system/user time to the task's accounting group. | |
10741 | */ | |
10742 | static void cpuacct_update_stats(struct task_struct *tsk, | |
10743 | enum cpuacct_stat_index idx, cputime_t val) | |
10744 | { | |
10745 | struct cpuacct *ca; | |
10746 | ||
10747 | if (unlikely(!cpuacct_subsys.active)) | |
10748 | return; | |
10749 | ||
10750 | rcu_read_lock(); | |
10751 | ca = task_ca(tsk); | |
10752 | ||
10753 | do { | |
10754 | percpu_counter_add(&ca->cpustat[idx], val); | |
10755 | ca = ca->parent; | |
10756 | } while (ca); | |
10757 | rcu_read_unlock(); | |
10758 | } | |
10759 | ||
d842de87 SV |
10760 | struct cgroup_subsys cpuacct_subsys = { |
10761 | .name = "cpuacct", | |
10762 | .create = cpuacct_create, | |
10763 | .destroy = cpuacct_destroy, | |
10764 | .populate = cpuacct_populate, | |
10765 | .subsys_id = cpuacct_subsys_id, | |
10766 | }; | |
10767 | #endif /* CONFIG_CGROUP_CPUACCT */ | |
03b042bf PM |
10768 | |
10769 | #ifndef CONFIG_SMP | |
10770 | ||
10771 | int rcu_expedited_torture_stats(char *page) | |
10772 | { | |
10773 | return 0; | |
10774 | } | |
10775 | EXPORT_SYMBOL_GPL(rcu_expedited_torture_stats); | |
10776 | ||
10777 | void synchronize_sched_expedited(void) | |
10778 | { | |
10779 | } | |
10780 | EXPORT_SYMBOL_GPL(synchronize_sched_expedited); | |
10781 | ||
10782 | #else /* #ifndef CONFIG_SMP */ | |
10783 | ||
10784 | static DEFINE_PER_CPU(struct migration_req, rcu_migration_req); | |
10785 | static DEFINE_MUTEX(rcu_sched_expedited_mutex); | |
10786 | ||
10787 | #define RCU_EXPEDITED_STATE_POST -2 | |
10788 | #define RCU_EXPEDITED_STATE_IDLE -1 | |
10789 | ||
10790 | static int rcu_expedited_state = RCU_EXPEDITED_STATE_IDLE; | |
10791 | ||
10792 | int rcu_expedited_torture_stats(char *page) | |
10793 | { | |
10794 | int cnt = 0; | |
10795 | int cpu; | |
10796 | ||
10797 | cnt += sprintf(&page[cnt], "state: %d /", rcu_expedited_state); | |
10798 | for_each_online_cpu(cpu) { | |
10799 | cnt += sprintf(&page[cnt], " %d:%d", | |
10800 | cpu, per_cpu(rcu_migration_req, cpu).dest_cpu); | |
10801 | } | |
10802 | cnt += sprintf(&page[cnt], "\n"); | |
10803 | return cnt; | |
10804 | } | |
10805 | EXPORT_SYMBOL_GPL(rcu_expedited_torture_stats); | |
10806 | ||
10807 | static long synchronize_sched_expedited_count; | |
10808 | ||
10809 | /* | |
10810 | * Wait for an rcu-sched grace period to elapse, but use "big hammer" | |
10811 | * approach to force grace period to end quickly. This consumes | |
10812 | * significant time on all CPUs, and is thus not recommended for | |
10813 | * any sort of common-case code. | |
10814 | * | |
10815 | * Note that it is illegal to call this function while holding any | |
10816 | * lock that is acquired by a CPU-hotplug notifier. Failing to | |
10817 | * observe this restriction will result in deadlock. | |
10818 | */ | |
10819 | void synchronize_sched_expedited(void) | |
10820 | { | |
10821 | int cpu; | |
10822 | unsigned long flags; | |
10823 | bool need_full_sync = 0; | |
10824 | struct rq *rq; | |
10825 | struct migration_req *req; | |
10826 | long snap; | |
10827 | int trycount = 0; | |
10828 | ||
10829 | smp_mb(); /* ensure prior mod happens before capturing snap. */ | |
10830 | snap = ACCESS_ONCE(synchronize_sched_expedited_count) + 1; | |
10831 | get_online_cpus(); | |
10832 | while (!mutex_trylock(&rcu_sched_expedited_mutex)) { | |
10833 | put_online_cpus(); | |
10834 | if (trycount++ < 10) | |
10835 | udelay(trycount * num_online_cpus()); | |
10836 | else { | |
10837 | synchronize_sched(); | |
10838 | return; | |
10839 | } | |
10840 | if (ACCESS_ONCE(synchronize_sched_expedited_count) - snap > 0) { | |
10841 | smp_mb(); /* ensure test happens before caller kfree */ | |
10842 | return; | |
10843 | } | |
10844 | get_online_cpus(); | |
10845 | } | |
10846 | rcu_expedited_state = RCU_EXPEDITED_STATE_POST; | |
10847 | for_each_online_cpu(cpu) { | |
10848 | rq = cpu_rq(cpu); | |
10849 | req = &per_cpu(rcu_migration_req, cpu); | |
10850 | init_completion(&req->done); | |
10851 | req->task = NULL; | |
10852 | req->dest_cpu = RCU_MIGRATION_NEED_QS; | |
10853 | spin_lock_irqsave(&rq->lock, flags); | |
10854 | list_add(&req->list, &rq->migration_queue); | |
10855 | spin_unlock_irqrestore(&rq->lock, flags); | |
10856 | wake_up_process(rq->migration_thread); | |
10857 | } | |
10858 | for_each_online_cpu(cpu) { | |
10859 | rcu_expedited_state = cpu; | |
10860 | req = &per_cpu(rcu_migration_req, cpu); | |
10861 | rq = cpu_rq(cpu); | |
10862 | wait_for_completion(&req->done); | |
10863 | spin_lock_irqsave(&rq->lock, flags); | |
10864 | if (unlikely(req->dest_cpu == RCU_MIGRATION_MUST_SYNC)) | |
10865 | need_full_sync = 1; | |
10866 | req->dest_cpu = RCU_MIGRATION_IDLE; | |
10867 | spin_unlock_irqrestore(&rq->lock, flags); | |
10868 | } | |
10869 | rcu_expedited_state = RCU_EXPEDITED_STATE_IDLE; | |
10870 | mutex_unlock(&rcu_sched_expedited_mutex); | |
10871 | put_online_cpus(); | |
10872 | if (need_full_sync) | |
10873 | synchronize_sched(); | |
10874 | } | |
10875 | EXPORT_SYMBOL_GPL(synchronize_sched_expedited); | |
10876 | ||
10877 | #endif /* #else #ifndef CONFIG_SMP */ |