]>
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 | |
1da177e4 LT |
25 | */ |
26 | ||
27 | #include <linux/mm.h> | |
28 | #include <linux/module.h> | |
29 | #include <linux/nmi.h> | |
30 | #include <linux/init.h> | |
dff06c15 | 31 | #include <linux/uaccess.h> |
1da177e4 LT |
32 | #include <linux/highmem.h> |
33 | #include <linux/smp_lock.h> | |
34 | #include <asm/mmu_context.h> | |
35 | #include <linux/interrupt.h> | |
c59ede7b | 36 | #include <linux/capability.h> |
1da177e4 LT |
37 | #include <linux/completion.h> |
38 | #include <linux/kernel_stat.h> | |
9a11b49a | 39 | #include <linux/debug_locks.h> |
1da177e4 LT |
40 | #include <linux/security.h> |
41 | #include <linux/notifier.h> | |
42 | #include <linux/profile.h> | |
7dfb7103 | 43 | #include <linux/freezer.h> |
198e2f18 | 44 | #include <linux/vmalloc.h> |
1da177e4 LT |
45 | #include <linux/blkdev.h> |
46 | #include <linux/delay.h> | |
b488893a | 47 | #include <linux/pid_namespace.h> |
1da177e4 LT |
48 | #include <linux/smp.h> |
49 | #include <linux/threads.h> | |
50 | #include <linux/timer.h> | |
51 | #include <linux/rcupdate.h> | |
52 | #include <linux/cpu.h> | |
53 | #include <linux/cpuset.h> | |
54 | #include <linux/percpu.h> | |
62d0df64 | 55 | #include <linux/cpu_acct.h> |
1da177e4 LT |
56 | #include <linux/kthread.h> |
57 | #include <linux/seq_file.h> | |
e692ab53 | 58 | #include <linux/sysctl.h> |
1da177e4 LT |
59 | #include <linux/syscalls.h> |
60 | #include <linux/times.h> | |
8f0ab514 | 61 | #include <linux/tsacct_kern.h> |
c6fd91f0 | 62 | #include <linux/kprobes.h> |
0ff92245 | 63 | #include <linux/delayacct.h> |
5517d86b | 64 | #include <linux/reciprocal_div.h> |
dff06c15 | 65 | #include <linux/unistd.h> |
f5ff8422 | 66 | #include <linux/pagemap.h> |
1da177e4 | 67 | |
5517d86b | 68 | #include <asm/tlb.h> |
838225b4 | 69 | #include <asm/irq_regs.h> |
1da177e4 | 70 | |
b035b6de AD |
71 | /* |
72 | * Scheduler clock - returns current time in nanosec units. | |
73 | * This is default implementation. | |
74 | * Architectures and sub-architectures can override this. | |
75 | */ | |
76 | unsigned long long __attribute__((weak)) sched_clock(void) | |
77 | { | |
d6322faf | 78 | return (unsigned long long)jiffies * (NSEC_PER_SEC / HZ); |
b035b6de AD |
79 | } |
80 | ||
1da177e4 LT |
81 | /* |
82 | * Convert user-nice values [ -20 ... 0 ... 19 ] | |
83 | * to static priority [ MAX_RT_PRIO..MAX_PRIO-1 ], | |
84 | * and back. | |
85 | */ | |
86 | #define NICE_TO_PRIO(nice) (MAX_RT_PRIO + (nice) + 20) | |
87 | #define PRIO_TO_NICE(prio) ((prio) - MAX_RT_PRIO - 20) | |
88 | #define TASK_NICE(p) PRIO_TO_NICE((p)->static_prio) | |
89 | ||
90 | /* | |
91 | * 'User priority' is the nice value converted to something we | |
92 | * can work with better when scaling various scheduler parameters, | |
93 | * it's a [ 0 ... 39 ] range. | |
94 | */ | |
95 | #define USER_PRIO(p) ((p)-MAX_RT_PRIO) | |
96 | #define TASK_USER_PRIO(p) USER_PRIO((p)->static_prio) | |
97 | #define MAX_USER_PRIO (USER_PRIO(MAX_PRIO)) | |
98 | ||
99 | /* | |
100 | * Some helpers for converting nanosecond timing to jiffy resolution | |
101 | */ | |
d6322faf ED |
102 | #define NS_TO_JIFFIES(TIME) ((unsigned long)(TIME) / (NSEC_PER_SEC / HZ)) |
103 | #define JIFFIES_TO_NS(TIME) ((TIME) * (NSEC_PER_SEC / HZ)) | |
1da177e4 | 104 | |
6aa645ea IM |
105 | #define NICE_0_LOAD SCHED_LOAD_SCALE |
106 | #define NICE_0_SHIFT SCHED_LOAD_SHIFT | |
107 | ||
1da177e4 LT |
108 | /* |
109 | * These are the 'tuning knobs' of the scheduler: | |
110 | * | |
a4ec24b4 | 111 | * default timeslice is 100 msecs (used only for SCHED_RR tasks). |
1da177e4 LT |
112 | * Timeslices get refilled after they expire. |
113 | */ | |
1da177e4 | 114 | #define DEF_TIMESLICE (100 * HZ / 1000) |
2dd73a4f | 115 | |
5517d86b ED |
116 | #ifdef CONFIG_SMP |
117 | /* | |
118 | * Divide a load by a sched group cpu_power : (load / sg->__cpu_power) | |
119 | * Since cpu_power is a 'constant', we can use a reciprocal divide. | |
120 | */ | |
121 | static inline u32 sg_div_cpu_power(const struct sched_group *sg, u32 load) | |
122 | { | |
123 | return reciprocal_divide(load, sg->reciprocal_cpu_power); | |
124 | } | |
125 | ||
126 | /* | |
127 | * Each time a sched group cpu_power is changed, | |
128 | * we must compute its reciprocal value | |
129 | */ | |
130 | static inline void sg_inc_cpu_power(struct sched_group *sg, u32 val) | |
131 | { | |
132 | sg->__cpu_power += val; | |
133 | sg->reciprocal_cpu_power = reciprocal_value(sg->__cpu_power); | |
134 | } | |
135 | #endif | |
136 | ||
e05606d3 IM |
137 | static inline int rt_policy(int policy) |
138 | { | |
139 | if (unlikely(policy == SCHED_FIFO) || unlikely(policy == SCHED_RR)) | |
140 | return 1; | |
141 | return 0; | |
142 | } | |
143 | ||
144 | static inline int task_has_rt_policy(struct task_struct *p) | |
145 | { | |
146 | return rt_policy(p->policy); | |
147 | } | |
148 | ||
1da177e4 | 149 | /* |
6aa645ea | 150 | * This is the priority-queue data structure of the RT scheduling class: |
1da177e4 | 151 | */ |
6aa645ea IM |
152 | struct rt_prio_array { |
153 | DECLARE_BITMAP(bitmap, MAX_RT_PRIO+1); /* include 1 bit for delimiter */ | |
154 | struct list_head queue[MAX_RT_PRIO]; | |
155 | }; | |
156 | ||
29f59db3 SV |
157 | #ifdef CONFIG_FAIR_GROUP_SCHED |
158 | ||
68318b8e SV |
159 | #include <linux/cgroup.h> |
160 | ||
29f59db3 SV |
161 | struct cfs_rq; |
162 | ||
163 | /* task group related information */ | |
4cf86d77 | 164 | struct task_group { |
68318b8e SV |
165 | #ifdef CONFIG_FAIR_CGROUP_SCHED |
166 | struct cgroup_subsys_state css; | |
167 | #endif | |
29f59db3 SV |
168 | /* schedulable entities of this group on each cpu */ |
169 | struct sched_entity **se; | |
170 | /* runqueue "owned" by this group on each cpu */ | |
171 | struct cfs_rq **cfs_rq; | |
172 | unsigned long shares; | |
5cb350ba DG |
173 | /* spinlock to serialize modification to shares */ |
174 | spinlock_t lock; | |
ae8393e5 | 175 | struct rcu_head rcu; |
29f59db3 SV |
176 | }; |
177 | ||
178 | /* Default task group's sched entity on each cpu */ | |
179 | static DEFINE_PER_CPU(struct sched_entity, init_sched_entity); | |
180 | /* Default task group's cfs_rq on each cpu */ | |
181 | static DEFINE_PER_CPU(struct cfs_rq, init_cfs_rq) ____cacheline_aligned_in_smp; | |
182 | ||
9b5b7751 SV |
183 | static struct sched_entity *init_sched_entity_p[NR_CPUS]; |
184 | static struct cfs_rq *init_cfs_rq_p[NR_CPUS]; | |
29f59db3 SV |
185 | |
186 | /* Default task group. | |
3a252015 | 187 | * Every task in system belong to this group at bootup. |
29f59db3 | 188 | */ |
4cf86d77 | 189 | struct task_group init_task_group = { |
3a252015 IM |
190 | .se = init_sched_entity_p, |
191 | .cfs_rq = init_cfs_rq_p, | |
192 | }; | |
9b5b7751 | 193 | |
24e377a8 | 194 | #ifdef CONFIG_FAIR_USER_SCHED |
3a252015 | 195 | # define INIT_TASK_GRP_LOAD 2*NICE_0_LOAD |
24e377a8 | 196 | #else |
3a252015 | 197 | # define INIT_TASK_GRP_LOAD NICE_0_LOAD |
24e377a8 SV |
198 | #endif |
199 | ||
4cf86d77 | 200 | static int init_task_group_load = INIT_TASK_GRP_LOAD; |
29f59db3 SV |
201 | |
202 | /* return group to which a task belongs */ | |
4cf86d77 | 203 | static inline struct task_group *task_group(struct task_struct *p) |
29f59db3 | 204 | { |
4cf86d77 | 205 | struct task_group *tg; |
9b5b7751 | 206 | |
24e377a8 SV |
207 | #ifdef CONFIG_FAIR_USER_SCHED |
208 | tg = p->user->tg; | |
68318b8e SV |
209 | #elif defined(CONFIG_FAIR_CGROUP_SCHED) |
210 | tg = container_of(task_subsys_state(p, cpu_cgroup_subsys_id), | |
211 | struct task_group, css); | |
24e377a8 | 212 | #else |
4cf86d77 | 213 | tg = &init_task_group; |
24e377a8 | 214 | #endif |
9b5b7751 SV |
215 | |
216 | return tg; | |
29f59db3 SV |
217 | } |
218 | ||
219 | /* Change a task's cfs_rq and parent entity if it moves across CPUs/groups */ | |
220 | static inline void set_task_cfs_rq(struct task_struct *p) | |
221 | { | |
4cf86d77 IM |
222 | p->se.cfs_rq = task_group(p)->cfs_rq[task_cpu(p)]; |
223 | p->se.parent = task_group(p)->se[task_cpu(p)]; | |
29f59db3 SV |
224 | } |
225 | ||
226 | #else | |
227 | ||
228 | static inline void set_task_cfs_rq(struct task_struct *p) { } | |
229 | ||
230 | #endif /* CONFIG_FAIR_GROUP_SCHED */ | |
231 | ||
6aa645ea IM |
232 | /* CFS-related fields in a runqueue */ |
233 | struct cfs_rq { | |
234 | struct load_weight load; | |
235 | unsigned long nr_running; | |
236 | ||
6aa645ea | 237 | u64 exec_clock; |
e9acbff6 | 238 | u64 min_vruntime; |
6aa645ea IM |
239 | |
240 | struct rb_root tasks_timeline; | |
241 | struct rb_node *rb_leftmost; | |
242 | struct rb_node *rb_load_balance_curr; | |
6aa645ea IM |
243 | /* 'curr' points to currently running entity on this cfs_rq. |
244 | * It is set to NULL otherwise (i.e when none are currently running). | |
245 | */ | |
246 | struct sched_entity *curr; | |
ddc97297 PZ |
247 | |
248 | unsigned long nr_spread_over; | |
249 | ||
62160e3f | 250 | #ifdef CONFIG_FAIR_GROUP_SCHED |
6aa645ea IM |
251 | struct rq *rq; /* cpu runqueue to which this cfs_rq is attached */ |
252 | ||
253 | /* leaf cfs_rqs are those that hold tasks (lowest schedulable entity in | |
254 | * a hierarchy). Non-leaf lrqs hold other higher schedulable entities | |
255 | * (like users, containers etc.) | |
256 | * | |
257 | * leaf_cfs_rq_list ties together list of leaf cfs_rq's in a cpu. This | |
258 | * list is used during load balance. | |
259 | */ | |
260 | struct list_head leaf_cfs_rq_list; /* Better name : task_cfs_rq_list? */ | |
4cf86d77 | 261 | struct task_group *tg; /* group that "owns" this runqueue */ |
6aa645ea IM |
262 | #endif |
263 | }; | |
1da177e4 | 264 | |
6aa645ea IM |
265 | /* Real-Time classes' related field in a runqueue: */ |
266 | struct rt_rq { | |
267 | struct rt_prio_array active; | |
268 | int rt_load_balance_idx; | |
269 | struct list_head *rt_load_balance_head, *rt_load_balance_curr; | |
270 | }; | |
271 | ||
1da177e4 LT |
272 | /* |
273 | * This is the main, per-CPU runqueue data structure. | |
274 | * | |
275 | * Locking rule: those places that want to lock multiple runqueues | |
276 | * (such as the load balancing or the thread migration code), lock | |
277 | * acquire operations must be ordered by ascending &runqueue. | |
278 | */ | |
70b97a7f | 279 | struct rq { |
d8016491 IM |
280 | /* runqueue lock: */ |
281 | spinlock_t lock; | |
1da177e4 LT |
282 | |
283 | /* | |
284 | * nr_running and cpu_load should be in the same cacheline because | |
285 | * remote CPUs use both these fields when doing load calculation. | |
286 | */ | |
287 | unsigned long nr_running; | |
6aa645ea IM |
288 | #define CPU_LOAD_IDX_MAX 5 |
289 | unsigned long cpu_load[CPU_LOAD_IDX_MAX]; | |
bdecea3a | 290 | unsigned char idle_at_tick; |
46cb4b7c SS |
291 | #ifdef CONFIG_NO_HZ |
292 | unsigned char in_nohz_recently; | |
293 | #endif | |
d8016491 IM |
294 | /* capture load from *all* tasks on this cpu: */ |
295 | struct load_weight load; | |
6aa645ea IM |
296 | unsigned long nr_load_updates; |
297 | u64 nr_switches; | |
298 | ||
299 | struct cfs_rq cfs; | |
300 | #ifdef CONFIG_FAIR_GROUP_SCHED | |
d8016491 IM |
301 | /* list of leaf cfs_rq on this cpu: */ |
302 | struct list_head leaf_cfs_rq_list; | |
1da177e4 | 303 | #endif |
6aa645ea | 304 | struct rt_rq rt; |
1da177e4 LT |
305 | |
306 | /* | |
307 | * This is part of a global counter where only the total sum | |
308 | * over all CPUs matters. A task can increase this counter on | |
309 | * one CPU and if it got migrated afterwards it may decrease | |
310 | * it on another CPU. Always updated under the runqueue lock: | |
311 | */ | |
312 | unsigned long nr_uninterruptible; | |
313 | ||
36c8b586 | 314 | struct task_struct *curr, *idle; |
c9819f45 | 315 | unsigned long next_balance; |
1da177e4 | 316 | struct mm_struct *prev_mm; |
6aa645ea | 317 | |
6aa645ea IM |
318 | u64 clock, prev_clock_raw; |
319 | s64 clock_max_delta; | |
320 | ||
321 | unsigned int clock_warps, clock_overflows; | |
2aa44d05 IM |
322 | u64 idle_clock; |
323 | unsigned int clock_deep_idle_events; | |
529c7726 | 324 | u64 tick_timestamp; |
6aa645ea | 325 | |
1da177e4 LT |
326 | atomic_t nr_iowait; |
327 | ||
328 | #ifdef CONFIG_SMP | |
329 | struct sched_domain *sd; | |
330 | ||
331 | /* For active balancing */ | |
332 | int active_balance; | |
333 | int push_cpu; | |
d8016491 IM |
334 | /* cpu of this runqueue: */ |
335 | int cpu; | |
1da177e4 | 336 | |
36c8b586 | 337 | struct task_struct *migration_thread; |
1da177e4 LT |
338 | struct list_head migration_queue; |
339 | #endif | |
340 | ||
341 | #ifdef CONFIG_SCHEDSTATS | |
342 | /* latency stats */ | |
343 | struct sched_info rq_sched_info; | |
344 | ||
345 | /* sys_sched_yield() stats */ | |
480b9434 KC |
346 | unsigned int yld_exp_empty; |
347 | unsigned int yld_act_empty; | |
348 | unsigned int yld_both_empty; | |
349 | unsigned int yld_count; | |
1da177e4 LT |
350 | |
351 | /* schedule() stats */ | |
480b9434 KC |
352 | unsigned int sched_switch; |
353 | unsigned int sched_count; | |
354 | unsigned int sched_goidle; | |
1da177e4 LT |
355 | |
356 | /* try_to_wake_up() stats */ | |
480b9434 KC |
357 | unsigned int ttwu_count; |
358 | unsigned int ttwu_local; | |
b8efb561 IM |
359 | |
360 | /* BKL stats */ | |
480b9434 | 361 | unsigned int bkl_count; |
1da177e4 | 362 | #endif |
fcb99371 | 363 | struct lock_class_key rq_lock_key; |
1da177e4 LT |
364 | }; |
365 | ||
f34e3b61 | 366 | static DEFINE_PER_CPU_SHARED_ALIGNED(struct rq, runqueues); |
5be9361c | 367 | static DEFINE_MUTEX(sched_hotcpu_mutex); |
1da177e4 | 368 | |
dd41f596 IM |
369 | static inline void check_preempt_curr(struct rq *rq, struct task_struct *p) |
370 | { | |
371 | rq->curr->sched_class->check_preempt_curr(rq, p); | |
372 | } | |
373 | ||
0a2966b4 CL |
374 | static inline int cpu_of(struct rq *rq) |
375 | { | |
376 | #ifdef CONFIG_SMP | |
377 | return rq->cpu; | |
378 | #else | |
379 | return 0; | |
380 | #endif | |
381 | } | |
382 | ||
20d315d4 | 383 | /* |
b04a0f4c IM |
384 | * Update the per-runqueue clock, as finegrained as the platform can give |
385 | * us, but without assuming monotonicity, etc.: | |
20d315d4 | 386 | */ |
b04a0f4c | 387 | static void __update_rq_clock(struct rq *rq) |
20d315d4 IM |
388 | { |
389 | u64 prev_raw = rq->prev_clock_raw; | |
390 | u64 now = sched_clock(); | |
391 | s64 delta = now - prev_raw; | |
392 | u64 clock = rq->clock; | |
393 | ||
b04a0f4c IM |
394 | #ifdef CONFIG_SCHED_DEBUG |
395 | WARN_ON_ONCE(cpu_of(rq) != smp_processor_id()); | |
396 | #endif | |
20d315d4 IM |
397 | /* |
398 | * Protect against sched_clock() occasionally going backwards: | |
399 | */ | |
400 | if (unlikely(delta < 0)) { | |
401 | clock++; | |
402 | rq->clock_warps++; | |
403 | } else { | |
404 | /* | |
405 | * Catch too large forward jumps too: | |
406 | */ | |
529c7726 IM |
407 | if (unlikely(clock + delta > rq->tick_timestamp + TICK_NSEC)) { |
408 | if (clock < rq->tick_timestamp + TICK_NSEC) | |
409 | clock = rq->tick_timestamp + TICK_NSEC; | |
410 | else | |
411 | clock++; | |
20d315d4 IM |
412 | rq->clock_overflows++; |
413 | } else { | |
414 | if (unlikely(delta > rq->clock_max_delta)) | |
415 | rq->clock_max_delta = delta; | |
416 | clock += delta; | |
417 | } | |
418 | } | |
419 | ||
420 | rq->prev_clock_raw = now; | |
421 | rq->clock = clock; | |
b04a0f4c | 422 | } |
20d315d4 | 423 | |
b04a0f4c IM |
424 | static void update_rq_clock(struct rq *rq) |
425 | { | |
426 | if (likely(smp_processor_id() == cpu_of(rq))) | |
427 | __update_rq_clock(rq); | |
20d315d4 IM |
428 | } |
429 | ||
674311d5 NP |
430 | /* |
431 | * The domain tree (rq->sd) is protected by RCU's quiescent state transition. | |
1a20ff27 | 432 | * See detach_destroy_domains: synchronize_sched for details. |
674311d5 NP |
433 | * |
434 | * The domain tree of any CPU may only be accessed from within | |
435 | * preempt-disabled sections. | |
436 | */ | |
48f24c4d IM |
437 | #define for_each_domain(cpu, __sd) \ |
438 | for (__sd = rcu_dereference(cpu_rq(cpu)->sd); __sd; __sd = __sd->parent) | |
1da177e4 LT |
439 | |
440 | #define cpu_rq(cpu) (&per_cpu(runqueues, (cpu))) | |
441 | #define this_rq() (&__get_cpu_var(runqueues)) | |
442 | #define task_rq(p) cpu_rq(task_cpu(p)) | |
443 | #define cpu_curr(cpu) (cpu_rq(cpu)->curr) | |
444 | ||
bf5c91ba IM |
445 | /* |
446 | * Tunables that become constants when CONFIG_SCHED_DEBUG is off: | |
447 | */ | |
448 | #ifdef CONFIG_SCHED_DEBUG | |
449 | # define const_debug __read_mostly | |
450 | #else | |
451 | # define const_debug static const | |
452 | #endif | |
453 | ||
454 | /* | |
455 | * Debugging: various feature bits | |
456 | */ | |
457 | enum { | |
bbdba7c0 IM |
458 | SCHED_FEAT_NEW_FAIR_SLEEPERS = 1, |
459 | SCHED_FEAT_START_DEBIT = 2, | |
06877c33 | 460 | SCHED_FEAT_TREE_AVG = 4, |
bbdba7c0 | 461 | SCHED_FEAT_APPROX_AVG = 8, |
ce6c1311 | 462 | SCHED_FEAT_WAKEUP_PREEMPT = 16, |
bf5c91ba IM |
463 | }; |
464 | ||
465 | const_debug unsigned int sysctl_sched_features = | |
8401f775 IM |
466 | SCHED_FEAT_NEW_FAIR_SLEEPERS * 1 | |
467 | SCHED_FEAT_START_DEBIT * 1 | | |
468 | SCHED_FEAT_TREE_AVG * 0 | | |
469 | SCHED_FEAT_APPROX_AVG * 0 | | |
3e3e13f3 | 470 | SCHED_FEAT_WAKEUP_PREEMPT * 1; |
bf5c91ba IM |
471 | |
472 | #define sched_feat(x) (sysctl_sched_features & SCHED_FEAT_##x) | |
473 | ||
b82d9fdd PZ |
474 | /* |
475 | * Number of tasks to iterate in a single balance run. | |
476 | * Limited because this is done with IRQs disabled. | |
477 | */ | |
478 | const_debug unsigned int sysctl_sched_nr_migrate = 32; | |
479 | ||
e436d800 IM |
480 | /* |
481 | * For kernel-internal use: high-speed (but slightly incorrect) per-cpu | |
482 | * clock constructed from sched_clock(): | |
483 | */ | |
484 | unsigned long long cpu_clock(int cpu) | |
485 | { | |
e436d800 IM |
486 | unsigned long long now; |
487 | unsigned long flags; | |
b04a0f4c | 488 | struct rq *rq; |
e436d800 | 489 | |
2cd4d0ea | 490 | local_irq_save(flags); |
b04a0f4c IM |
491 | rq = cpu_rq(cpu); |
492 | update_rq_clock(rq); | |
493 | now = rq->clock; | |
2cd4d0ea | 494 | local_irq_restore(flags); |
e436d800 IM |
495 | |
496 | return now; | |
497 | } | |
a58f6f25 | 498 | EXPORT_SYMBOL_GPL(cpu_clock); |
e436d800 | 499 | |
1da177e4 | 500 | #ifndef prepare_arch_switch |
4866cde0 NP |
501 | # define prepare_arch_switch(next) do { } while (0) |
502 | #endif | |
503 | #ifndef finish_arch_switch | |
504 | # define finish_arch_switch(prev) do { } while (0) | |
505 | #endif | |
506 | ||
507 | #ifndef __ARCH_WANT_UNLOCKED_CTXSW | |
70b97a7f | 508 | static inline int task_running(struct rq *rq, struct task_struct *p) |
4866cde0 NP |
509 | { |
510 | return rq->curr == p; | |
511 | } | |
512 | ||
70b97a7f | 513 | static inline void prepare_lock_switch(struct rq *rq, struct task_struct *next) |
4866cde0 NP |
514 | { |
515 | } | |
516 | ||
70b97a7f | 517 | static inline void finish_lock_switch(struct rq *rq, struct task_struct *prev) |
4866cde0 | 518 | { |
da04c035 IM |
519 | #ifdef CONFIG_DEBUG_SPINLOCK |
520 | /* this is a valid case when another task releases the spinlock */ | |
521 | rq->lock.owner = current; | |
522 | #endif | |
8a25d5de IM |
523 | /* |
524 | * If we are tracking spinlock dependencies then we have to | |
525 | * fix up the runqueue lock - which gets 'carried over' from | |
526 | * prev into current: | |
527 | */ | |
528 | spin_acquire(&rq->lock.dep_map, 0, 0, _THIS_IP_); | |
529 | ||
4866cde0 NP |
530 | spin_unlock_irq(&rq->lock); |
531 | } | |
532 | ||
533 | #else /* __ARCH_WANT_UNLOCKED_CTXSW */ | |
70b97a7f | 534 | static inline int task_running(struct rq *rq, struct task_struct *p) |
4866cde0 NP |
535 | { |
536 | #ifdef CONFIG_SMP | |
537 | return p->oncpu; | |
538 | #else | |
539 | return rq->curr == p; | |
540 | #endif | |
541 | } | |
542 | ||
70b97a7f | 543 | static inline void prepare_lock_switch(struct rq *rq, struct task_struct *next) |
4866cde0 NP |
544 | { |
545 | #ifdef CONFIG_SMP | |
546 | /* | |
547 | * We can optimise this out completely for !SMP, because the | |
548 | * SMP rebalancing from interrupt is the only thing that cares | |
549 | * here. | |
550 | */ | |
551 | next->oncpu = 1; | |
552 | #endif | |
553 | #ifdef __ARCH_WANT_INTERRUPTS_ON_CTXSW | |
554 | spin_unlock_irq(&rq->lock); | |
555 | #else | |
556 | spin_unlock(&rq->lock); | |
557 | #endif | |
558 | } | |
559 | ||
70b97a7f | 560 | static inline void finish_lock_switch(struct rq *rq, struct task_struct *prev) |
4866cde0 NP |
561 | { |
562 | #ifdef CONFIG_SMP | |
563 | /* | |
564 | * After ->oncpu is cleared, the task can be moved to a different CPU. | |
565 | * We must ensure this doesn't happen until the switch is completely | |
566 | * finished. | |
567 | */ | |
568 | smp_wmb(); | |
569 | prev->oncpu = 0; | |
570 | #endif | |
571 | #ifndef __ARCH_WANT_INTERRUPTS_ON_CTXSW | |
572 | local_irq_enable(); | |
1da177e4 | 573 | #endif |
4866cde0 NP |
574 | } |
575 | #endif /* __ARCH_WANT_UNLOCKED_CTXSW */ | |
1da177e4 | 576 | |
b29739f9 IM |
577 | /* |
578 | * __task_rq_lock - lock the runqueue a given task resides on. | |
579 | * Must be called interrupts disabled. | |
580 | */ | |
70b97a7f | 581 | static inline struct rq *__task_rq_lock(struct task_struct *p) |
b29739f9 IM |
582 | __acquires(rq->lock) |
583 | { | |
3a5c359a AK |
584 | for (;;) { |
585 | struct rq *rq = task_rq(p); | |
586 | spin_lock(&rq->lock); | |
587 | if (likely(rq == task_rq(p))) | |
588 | return rq; | |
b29739f9 | 589 | spin_unlock(&rq->lock); |
b29739f9 | 590 | } |
b29739f9 IM |
591 | } |
592 | ||
1da177e4 LT |
593 | /* |
594 | * task_rq_lock - lock the runqueue a given task resides on and disable | |
595 | * interrupts. Note the ordering: we can safely lookup the task_rq without | |
596 | * explicitly disabling preemption. | |
597 | */ | |
70b97a7f | 598 | static struct rq *task_rq_lock(struct task_struct *p, unsigned long *flags) |
1da177e4 LT |
599 | __acquires(rq->lock) |
600 | { | |
70b97a7f | 601 | struct rq *rq; |
1da177e4 | 602 | |
3a5c359a AK |
603 | for (;;) { |
604 | local_irq_save(*flags); | |
605 | rq = task_rq(p); | |
606 | spin_lock(&rq->lock); | |
607 | if (likely(rq == task_rq(p))) | |
608 | return rq; | |
1da177e4 | 609 | spin_unlock_irqrestore(&rq->lock, *flags); |
1da177e4 | 610 | } |
1da177e4 LT |
611 | } |
612 | ||
a9957449 | 613 | static void __task_rq_unlock(struct rq *rq) |
b29739f9 IM |
614 | __releases(rq->lock) |
615 | { | |
616 | spin_unlock(&rq->lock); | |
617 | } | |
618 | ||
70b97a7f | 619 | static inline void task_rq_unlock(struct rq *rq, unsigned long *flags) |
1da177e4 LT |
620 | __releases(rq->lock) |
621 | { | |
622 | spin_unlock_irqrestore(&rq->lock, *flags); | |
623 | } | |
624 | ||
1da177e4 | 625 | /* |
cc2a73b5 | 626 | * this_rq_lock - lock this runqueue and disable interrupts. |
1da177e4 | 627 | */ |
a9957449 | 628 | static struct rq *this_rq_lock(void) |
1da177e4 LT |
629 | __acquires(rq->lock) |
630 | { | |
70b97a7f | 631 | struct rq *rq; |
1da177e4 LT |
632 | |
633 | local_irq_disable(); | |
634 | rq = this_rq(); | |
635 | spin_lock(&rq->lock); | |
636 | ||
637 | return rq; | |
638 | } | |
639 | ||
1b9f19c2 | 640 | /* |
2aa44d05 | 641 | * We are going deep-idle (irqs are disabled): |
1b9f19c2 | 642 | */ |
2aa44d05 | 643 | void sched_clock_idle_sleep_event(void) |
1b9f19c2 | 644 | { |
2aa44d05 IM |
645 | struct rq *rq = cpu_rq(smp_processor_id()); |
646 | ||
647 | spin_lock(&rq->lock); | |
648 | __update_rq_clock(rq); | |
649 | spin_unlock(&rq->lock); | |
650 | rq->clock_deep_idle_events++; | |
651 | } | |
652 | EXPORT_SYMBOL_GPL(sched_clock_idle_sleep_event); | |
653 | ||
654 | /* | |
655 | * We just idled delta nanoseconds (called with irqs disabled): | |
656 | */ | |
657 | void sched_clock_idle_wakeup_event(u64 delta_ns) | |
658 | { | |
659 | struct rq *rq = cpu_rq(smp_processor_id()); | |
660 | u64 now = sched_clock(); | |
1b9f19c2 | 661 | |
2aa44d05 IM |
662 | rq->idle_clock += delta_ns; |
663 | /* | |
664 | * Override the previous timestamp and ignore all | |
665 | * sched_clock() deltas that occured while we idled, | |
666 | * and use the PM-provided delta_ns to advance the | |
667 | * rq clock: | |
668 | */ | |
669 | spin_lock(&rq->lock); | |
670 | rq->prev_clock_raw = now; | |
671 | rq->clock += delta_ns; | |
672 | spin_unlock(&rq->lock); | |
1b9f19c2 | 673 | } |
2aa44d05 | 674 | EXPORT_SYMBOL_GPL(sched_clock_idle_wakeup_event); |
1b9f19c2 | 675 | |
c24d20db IM |
676 | /* |
677 | * resched_task - mark a task 'to be rescheduled now'. | |
678 | * | |
679 | * On UP this means the setting of the need_resched flag, on SMP it | |
680 | * might also involve a cross-CPU call to trigger the scheduler on | |
681 | * the target CPU. | |
682 | */ | |
683 | #ifdef CONFIG_SMP | |
684 | ||
685 | #ifndef tsk_is_polling | |
686 | #define tsk_is_polling(t) test_tsk_thread_flag(t, TIF_POLLING_NRFLAG) | |
687 | #endif | |
688 | ||
689 | static void resched_task(struct task_struct *p) | |
690 | { | |
691 | int cpu; | |
692 | ||
693 | assert_spin_locked(&task_rq(p)->lock); | |
694 | ||
695 | if (unlikely(test_tsk_thread_flag(p, TIF_NEED_RESCHED))) | |
696 | return; | |
697 | ||
698 | set_tsk_thread_flag(p, TIF_NEED_RESCHED); | |
699 | ||
700 | cpu = task_cpu(p); | |
701 | if (cpu == smp_processor_id()) | |
702 | return; | |
703 | ||
704 | /* NEED_RESCHED must be visible before we test polling */ | |
705 | smp_mb(); | |
706 | if (!tsk_is_polling(p)) | |
707 | smp_send_reschedule(cpu); | |
708 | } | |
709 | ||
710 | static void resched_cpu(int cpu) | |
711 | { | |
712 | struct rq *rq = cpu_rq(cpu); | |
713 | unsigned long flags; | |
714 | ||
715 | if (!spin_trylock_irqsave(&rq->lock, flags)) | |
716 | return; | |
717 | resched_task(cpu_curr(cpu)); | |
718 | spin_unlock_irqrestore(&rq->lock, flags); | |
719 | } | |
720 | #else | |
721 | static inline void resched_task(struct task_struct *p) | |
722 | { | |
723 | assert_spin_locked(&task_rq(p)->lock); | |
724 | set_tsk_need_resched(p); | |
725 | } | |
726 | #endif | |
727 | ||
45bf76df IM |
728 | #if BITS_PER_LONG == 32 |
729 | # define WMULT_CONST (~0UL) | |
730 | #else | |
731 | # define WMULT_CONST (1UL << 32) | |
732 | #endif | |
733 | ||
734 | #define WMULT_SHIFT 32 | |
735 | ||
194081eb IM |
736 | /* |
737 | * Shift right and round: | |
738 | */ | |
cf2ab469 | 739 | #define SRR(x, y) (((x) + (1UL << ((y) - 1))) >> (y)) |
194081eb | 740 | |
cb1c4fc9 | 741 | static unsigned long |
45bf76df IM |
742 | calc_delta_mine(unsigned long delta_exec, unsigned long weight, |
743 | struct load_weight *lw) | |
744 | { | |
745 | u64 tmp; | |
746 | ||
747 | if (unlikely(!lw->inv_weight)) | |
194081eb | 748 | lw->inv_weight = (WMULT_CONST - lw->weight/2) / lw->weight + 1; |
45bf76df IM |
749 | |
750 | tmp = (u64)delta_exec * weight; | |
751 | /* | |
752 | * Check whether we'd overflow the 64-bit multiplication: | |
753 | */ | |
194081eb | 754 | if (unlikely(tmp > WMULT_CONST)) |
cf2ab469 | 755 | tmp = SRR(SRR(tmp, WMULT_SHIFT/2) * lw->inv_weight, |
194081eb IM |
756 | WMULT_SHIFT/2); |
757 | else | |
cf2ab469 | 758 | tmp = SRR(tmp * lw->inv_weight, WMULT_SHIFT); |
45bf76df | 759 | |
ecf691da | 760 | return (unsigned long)min(tmp, (u64)(unsigned long)LONG_MAX); |
45bf76df IM |
761 | } |
762 | ||
763 | static inline unsigned long | |
764 | calc_delta_fair(unsigned long delta_exec, struct load_weight *lw) | |
765 | { | |
766 | return calc_delta_mine(delta_exec, NICE_0_LOAD, lw); | |
767 | } | |
768 | ||
1091985b | 769 | static inline void update_load_add(struct load_weight *lw, unsigned long inc) |
45bf76df IM |
770 | { |
771 | lw->weight += inc; | |
45bf76df IM |
772 | } |
773 | ||
1091985b | 774 | static inline void update_load_sub(struct load_weight *lw, unsigned long dec) |
45bf76df IM |
775 | { |
776 | lw->weight -= dec; | |
45bf76df IM |
777 | } |
778 | ||
2dd73a4f PW |
779 | /* |
780 | * To aid in avoiding the subversion of "niceness" due to uneven distribution | |
781 | * of tasks with abnormal "nice" values across CPUs the contribution that | |
782 | * each task makes to its run queue's load is weighted according to its | |
783 | * scheduling class and "nice" value. For SCHED_NORMAL tasks this is just a | |
784 | * scaled version of the new time slice allocation that they receive on time | |
785 | * slice expiry etc. | |
786 | */ | |
787 | ||
dd41f596 IM |
788 | #define WEIGHT_IDLEPRIO 2 |
789 | #define WMULT_IDLEPRIO (1 << 31) | |
790 | ||
791 | /* | |
792 | * Nice levels are multiplicative, with a gentle 10% change for every | |
793 | * nice level changed. I.e. when a CPU-bound task goes from nice 0 to | |
794 | * nice 1, it will get ~10% less CPU time than another CPU-bound task | |
795 | * that remained on nice 0. | |
796 | * | |
797 | * The "10% effect" is relative and cumulative: from _any_ nice level, | |
798 | * if you go up 1 level, it's -10% CPU usage, if you go down 1 level | |
f9153ee6 IM |
799 | * it's +10% CPU usage. (to achieve that we use a multiplier of 1.25. |
800 | * If a task goes up by ~10% and another task goes down by ~10% then | |
801 | * the relative distance between them is ~25%.) | |
dd41f596 IM |
802 | */ |
803 | static const int prio_to_weight[40] = { | |
254753dc IM |
804 | /* -20 */ 88761, 71755, 56483, 46273, 36291, |
805 | /* -15 */ 29154, 23254, 18705, 14949, 11916, | |
806 | /* -10 */ 9548, 7620, 6100, 4904, 3906, | |
807 | /* -5 */ 3121, 2501, 1991, 1586, 1277, | |
808 | /* 0 */ 1024, 820, 655, 526, 423, | |
809 | /* 5 */ 335, 272, 215, 172, 137, | |
810 | /* 10 */ 110, 87, 70, 56, 45, | |
811 | /* 15 */ 36, 29, 23, 18, 15, | |
dd41f596 IM |
812 | }; |
813 | ||
5714d2de IM |
814 | /* |
815 | * Inverse (2^32/x) values of the prio_to_weight[] array, precalculated. | |
816 | * | |
817 | * In cases where the weight does not change often, we can use the | |
818 | * precalculated inverse to speed up arithmetics by turning divisions | |
819 | * into multiplications: | |
820 | */ | |
dd41f596 | 821 | static const u32 prio_to_wmult[40] = { |
254753dc IM |
822 | /* -20 */ 48388, 59856, 76040, 92818, 118348, |
823 | /* -15 */ 147320, 184698, 229616, 287308, 360437, | |
824 | /* -10 */ 449829, 563644, 704093, 875809, 1099582, | |
825 | /* -5 */ 1376151, 1717300, 2157191, 2708050, 3363326, | |
826 | /* 0 */ 4194304, 5237765, 6557202, 8165337, 10153587, | |
827 | /* 5 */ 12820798, 15790321, 19976592, 24970740, 31350126, | |
828 | /* 10 */ 39045157, 49367440, 61356676, 76695844, 95443717, | |
829 | /* 15 */ 119304647, 148102320, 186737708, 238609294, 286331153, | |
dd41f596 | 830 | }; |
2dd73a4f | 831 | |
dd41f596 IM |
832 | static void activate_task(struct rq *rq, struct task_struct *p, int wakeup); |
833 | ||
834 | /* | |
835 | * runqueue iterator, to support SMP load-balancing between different | |
836 | * scheduling classes, without having to expose their internal data | |
837 | * structures to the load-balancing proper: | |
838 | */ | |
839 | struct rq_iterator { | |
840 | void *arg; | |
841 | struct task_struct *(*start)(void *); | |
842 | struct task_struct *(*next)(void *); | |
843 | }; | |
844 | ||
e1d1484f PW |
845 | #ifdef CONFIG_SMP |
846 | static unsigned long | |
847 | balance_tasks(struct rq *this_rq, int this_cpu, struct rq *busiest, | |
848 | unsigned long max_load_move, struct sched_domain *sd, | |
849 | enum cpu_idle_type idle, int *all_pinned, | |
850 | int *this_best_prio, struct rq_iterator *iterator); | |
851 | ||
852 | static int | |
853 | iter_move_one_task(struct rq *this_rq, int this_cpu, struct rq *busiest, | |
854 | struct sched_domain *sd, enum cpu_idle_type idle, | |
855 | struct rq_iterator *iterator); | |
e1d1484f | 856 | #endif |
dd41f596 IM |
857 | |
858 | #include "sched_stats.h" | |
dd41f596 | 859 | #include "sched_idletask.c" |
5522d5d5 IM |
860 | #include "sched_fair.c" |
861 | #include "sched_rt.c" | |
dd41f596 IM |
862 | #ifdef CONFIG_SCHED_DEBUG |
863 | # include "sched_debug.c" | |
864 | #endif | |
865 | ||
866 | #define sched_class_highest (&rt_sched_class) | |
867 | ||
9c217245 IM |
868 | /* |
869 | * Update delta_exec, delta_fair fields for rq. | |
870 | * | |
871 | * delta_fair clock advances at a rate inversely proportional to | |
495eca49 | 872 | * total load (rq->load.weight) on the runqueue, while |
9c217245 IM |
873 | * delta_exec advances at the same rate as wall-clock (provided |
874 | * cpu is not idle). | |
875 | * | |
876 | * delta_exec / delta_fair is a measure of the (smoothened) load on this | |
877 | * runqueue over any given interval. This (smoothened) load is used | |
878 | * during load balance. | |
879 | * | |
495eca49 | 880 | * This function is called /before/ updating rq->load |
9c217245 IM |
881 | * and when switching tasks. |
882 | */ | |
29b4b623 | 883 | static inline void inc_load(struct rq *rq, const struct task_struct *p) |
9c217245 | 884 | { |
495eca49 | 885 | update_load_add(&rq->load, p->se.load.weight); |
9c217245 IM |
886 | } |
887 | ||
79b5dddf | 888 | static inline void dec_load(struct rq *rq, const struct task_struct *p) |
9c217245 | 889 | { |
495eca49 | 890 | update_load_sub(&rq->load, p->se.load.weight); |
9c217245 IM |
891 | } |
892 | ||
e5fa2237 | 893 | static void inc_nr_running(struct task_struct *p, struct rq *rq) |
9c217245 IM |
894 | { |
895 | rq->nr_running++; | |
29b4b623 | 896 | inc_load(rq, p); |
9c217245 IM |
897 | } |
898 | ||
db53181e | 899 | static void dec_nr_running(struct task_struct *p, struct rq *rq) |
9c217245 IM |
900 | { |
901 | rq->nr_running--; | |
79b5dddf | 902 | dec_load(rq, p); |
9c217245 IM |
903 | } |
904 | ||
45bf76df IM |
905 | static void set_load_weight(struct task_struct *p) |
906 | { | |
907 | if (task_has_rt_policy(p)) { | |
dd41f596 IM |
908 | p->se.load.weight = prio_to_weight[0] * 2; |
909 | p->se.load.inv_weight = prio_to_wmult[0] >> 1; | |
910 | return; | |
911 | } | |
45bf76df | 912 | |
dd41f596 IM |
913 | /* |
914 | * SCHED_IDLE tasks get minimal weight: | |
915 | */ | |
916 | if (p->policy == SCHED_IDLE) { | |
917 | p->se.load.weight = WEIGHT_IDLEPRIO; | |
918 | p->se.load.inv_weight = WMULT_IDLEPRIO; | |
919 | return; | |
920 | } | |
71f8bd46 | 921 | |
dd41f596 IM |
922 | p->se.load.weight = prio_to_weight[p->static_prio - MAX_RT_PRIO]; |
923 | p->se.load.inv_weight = prio_to_wmult[p->static_prio - MAX_RT_PRIO]; | |
71f8bd46 IM |
924 | } |
925 | ||
8159f87e | 926 | static void enqueue_task(struct rq *rq, struct task_struct *p, int wakeup) |
71f8bd46 | 927 | { |
dd41f596 | 928 | sched_info_queued(p); |
fd390f6a | 929 | p->sched_class->enqueue_task(rq, p, wakeup); |
dd41f596 | 930 | p->se.on_rq = 1; |
71f8bd46 IM |
931 | } |
932 | ||
69be72c1 | 933 | static void dequeue_task(struct rq *rq, struct task_struct *p, int sleep) |
71f8bd46 | 934 | { |
f02231e5 | 935 | p->sched_class->dequeue_task(rq, p, sleep); |
dd41f596 | 936 | p->se.on_rq = 0; |
71f8bd46 IM |
937 | } |
938 | ||
14531189 | 939 | /* |
dd41f596 | 940 | * __normal_prio - return the priority that is based on the static prio |
14531189 | 941 | */ |
14531189 IM |
942 | static inline int __normal_prio(struct task_struct *p) |
943 | { | |
dd41f596 | 944 | return p->static_prio; |
14531189 IM |
945 | } |
946 | ||
b29739f9 IM |
947 | /* |
948 | * Calculate the expected normal priority: i.e. priority | |
949 | * without taking RT-inheritance into account. Might be | |
950 | * boosted by interactivity modifiers. Changes upon fork, | |
951 | * setprio syscalls, and whenever the interactivity | |
952 | * estimator recalculates. | |
953 | */ | |
36c8b586 | 954 | static inline int normal_prio(struct task_struct *p) |
b29739f9 IM |
955 | { |
956 | int prio; | |
957 | ||
e05606d3 | 958 | if (task_has_rt_policy(p)) |
b29739f9 IM |
959 | prio = MAX_RT_PRIO-1 - p->rt_priority; |
960 | else | |
961 | prio = __normal_prio(p); | |
962 | return prio; | |
963 | } | |
964 | ||
965 | /* | |
966 | * Calculate the current priority, i.e. the priority | |
967 | * taken into account by the scheduler. This value might | |
968 | * be boosted by RT tasks, or might be boosted by | |
969 | * interactivity modifiers. Will be RT if the task got | |
970 | * RT-boosted. If not then it returns p->normal_prio. | |
971 | */ | |
36c8b586 | 972 | static int effective_prio(struct task_struct *p) |
b29739f9 IM |
973 | { |
974 | p->normal_prio = normal_prio(p); | |
975 | /* | |
976 | * If we are RT tasks or we were boosted to RT priority, | |
977 | * keep the priority unchanged. Otherwise, update priority | |
978 | * to the normal priority: | |
979 | */ | |
980 | if (!rt_prio(p->prio)) | |
981 | return p->normal_prio; | |
982 | return p->prio; | |
983 | } | |
984 | ||
1da177e4 | 985 | /* |
dd41f596 | 986 | * activate_task - move a task to the runqueue. |
1da177e4 | 987 | */ |
dd41f596 | 988 | static void activate_task(struct rq *rq, struct task_struct *p, int wakeup) |
1da177e4 | 989 | { |
dd41f596 IM |
990 | if (p->state == TASK_UNINTERRUPTIBLE) |
991 | rq->nr_uninterruptible--; | |
1da177e4 | 992 | |
8159f87e | 993 | enqueue_task(rq, p, wakeup); |
e5fa2237 | 994 | inc_nr_running(p, rq); |
1da177e4 LT |
995 | } |
996 | ||
1da177e4 LT |
997 | /* |
998 | * deactivate_task - remove a task from the runqueue. | |
999 | */ | |
2e1cb74a | 1000 | static void deactivate_task(struct rq *rq, struct task_struct *p, int sleep) |
1da177e4 | 1001 | { |
dd41f596 IM |
1002 | if (p->state == TASK_UNINTERRUPTIBLE) |
1003 | rq->nr_uninterruptible++; | |
1004 | ||
69be72c1 | 1005 | dequeue_task(rq, p, sleep); |
db53181e | 1006 | dec_nr_running(p, rq); |
1da177e4 LT |
1007 | } |
1008 | ||
1da177e4 LT |
1009 | /** |
1010 | * task_curr - is this task currently executing on a CPU? | |
1011 | * @p: the task in question. | |
1012 | */ | |
36c8b586 | 1013 | inline int task_curr(const struct task_struct *p) |
1da177e4 LT |
1014 | { |
1015 | return cpu_curr(task_cpu(p)) == p; | |
1016 | } | |
1017 | ||
2dd73a4f PW |
1018 | /* Used instead of source_load when we know the type == 0 */ |
1019 | unsigned long weighted_cpuload(const int cpu) | |
1020 | { | |
495eca49 | 1021 | return cpu_rq(cpu)->load.weight; |
dd41f596 IM |
1022 | } |
1023 | ||
1024 | static inline void __set_task_cpu(struct task_struct *p, unsigned int cpu) | |
1025 | { | |
1026 | #ifdef CONFIG_SMP | |
1027 | task_thread_info(p)->cpu = cpu; | |
dd41f596 | 1028 | #endif |
29f59db3 | 1029 | set_task_cfs_rq(p); |
2dd73a4f PW |
1030 | } |
1031 | ||
1da177e4 | 1032 | #ifdef CONFIG_SMP |
c65cc870 | 1033 | |
cc367732 IM |
1034 | /* |
1035 | * Is this task likely cache-hot: | |
1036 | */ | |
1037 | static inline int | |
1038 | task_hot(struct task_struct *p, u64 now, struct sched_domain *sd) | |
1039 | { | |
1040 | s64 delta; | |
1041 | ||
1042 | if (p->sched_class != &fair_sched_class) | |
1043 | return 0; | |
1044 | ||
6bc1665b IM |
1045 | if (sysctl_sched_migration_cost == -1) |
1046 | return 1; | |
1047 | if (sysctl_sched_migration_cost == 0) | |
1048 | return 0; | |
1049 | ||
cc367732 IM |
1050 | delta = now - p->se.exec_start; |
1051 | ||
1052 | return delta < (s64)sysctl_sched_migration_cost; | |
1053 | } | |
1054 | ||
1055 | ||
dd41f596 | 1056 | void set_task_cpu(struct task_struct *p, unsigned int new_cpu) |
c65cc870 | 1057 | { |
dd41f596 IM |
1058 | int old_cpu = task_cpu(p); |
1059 | struct rq *old_rq = cpu_rq(old_cpu), *new_rq = cpu_rq(new_cpu); | |
2830cf8c SV |
1060 | struct cfs_rq *old_cfsrq = task_cfs_rq(p), |
1061 | *new_cfsrq = cpu_cfs_rq(old_cfsrq, new_cpu); | |
bbdba7c0 | 1062 | u64 clock_offset; |
dd41f596 IM |
1063 | |
1064 | clock_offset = old_rq->clock - new_rq->clock; | |
6cfb0d5d IM |
1065 | |
1066 | #ifdef CONFIG_SCHEDSTATS | |
1067 | if (p->se.wait_start) | |
1068 | p->se.wait_start -= clock_offset; | |
dd41f596 IM |
1069 | if (p->se.sleep_start) |
1070 | p->se.sleep_start -= clock_offset; | |
1071 | if (p->se.block_start) | |
1072 | p->se.block_start -= clock_offset; | |
cc367732 IM |
1073 | if (old_cpu != new_cpu) { |
1074 | schedstat_inc(p, se.nr_migrations); | |
1075 | if (task_hot(p, old_rq->clock, NULL)) | |
1076 | schedstat_inc(p, se.nr_forced2_migrations); | |
1077 | } | |
6cfb0d5d | 1078 | #endif |
2830cf8c SV |
1079 | p->se.vruntime -= old_cfsrq->min_vruntime - |
1080 | new_cfsrq->min_vruntime; | |
dd41f596 IM |
1081 | |
1082 | __set_task_cpu(p, new_cpu); | |
c65cc870 IM |
1083 | } |
1084 | ||
70b97a7f | 1085 | struct migration_req { |
1da177e4 | 1086 | struct list_head list; |
1da177e4 | 1087 | |
36c8b586 | 1088 | struct task_struct *task; |
1da177e4 LT |
1089 | int dest_cpu; |
1090 | ||
1da177e4 | 1091 | struct completion done; |
70b97a7f | 1092 | }; |
1da177e4 LT |
1093 | |
1094 | /* | |
1095 | * The task's runqueue lock must be held. | |
1096 | * Returns true if you have to wait for migration thread. | |
1097 | */ | |
36c8b586 | 1098 | static int |
70b97a7f | 1099 | migrate_task(struct task_struct *p, int dest_cpu, struct migration_req *req) |
1da177e4 | 1100 | { |
70b97a7f | 1101 | struct rq *rq = task_rq(p); |
1da177e4 LT |
1102 | |
1103 | /* | |
1104 | * If the task is not on a runqueue (and not running), then | |
1105 | * it is sufficient to simply update the task's cpu field. | |
1106 | */ | |
dd41f596 | 1107 | if (!p->se.on_rq && !task_running(rq, p)) { |
1da177e4 LT |
1108 | set_task_cpu(p, dest_cpu); |
1109 | return 0; | |
1110 | } | |
1111 | ||
1112 | init_completion(&req->done); | |
1da177e4 LT |
1113 | req->task = p; |
1114 | req->dest_cpu = dest_cpu; | |
1115 | list_add(&req->list, &rq->migration_queue); | |
48f24c4d | 1116 | |
1da177e4 LT |
1117 | return 1; |
1118 | } | |
1119 | ||
1120 | /* | |
1121 | * wait_task_inactive - wait for a thread to unschedule. | |
1122 | * | |
1123 | * The caller must ensure that the task *will* unschedule sometime soon, | |
1124 | * else this function might spin for a *long* time. This function can't | |
1125 | * be called with interrupts off, or it may introduce deadlock with | |
1126 | * smp_call_function() if an IPI is sent by the same process we are | |
1127 | * waiting to become inactive. | |
1128 | */ | |
36c8b586 | 1129 | void wait_task_inactive(struct task_struct *p) |
1da177e4 LT |
1130 | { |
1131 | unsigned long flags; | |
dd41f596 | 1132 | int running, on_rq; |
70b97a7f | 1133 | struct rq *rq; |
1da177e4 | 1134 | |
3a5c359a AK |
1135 | for (;;) { |
1136 | /* | |
1137 | * We do the initial early heuristics without holding | |
1138 | * any task-queue locks at all. We'll only try to get | |
1139 | * the runqueue lock when things look like they will | |
1140 | * work out! | |
1141 | */ | |
1142 | rq = task_rq(p); | |
fa490cfd | 1143 | |
3a5c359a AK |
1144 | /* |
1145 | * If the task is actively running on another CPU | |
1146 | * still, just relax and busy-wait without holding | |
1147 | * any locks. | |
1148 | * | |
1149 | * NOTE! Since we don't hold any locks, it's not | |
1150 | * even sure that "rq" stays as the right runqueue! | |
1151 | * But we don't care, since "task_running()" will | |
1152 | * return false if the runqueue has changed and p | |
1153 | * is actually now running somewhere else! | |
1154 | */ | |
1155 | while (task_running(rq, p)) | |
1156 | cpu_relax(); | |
fa490cfd | 1157 | |
3a5c359a AK |
1158 | /* |
1159 | * Ok, time to look more closely! We need the rq | |
1160 | * lock now, to be *sure*. If we're wrong, we'll | |
1161 | * just go back and repeat. | |
1162 | */ | |
1163 | rq = task_rq_lock(p, &flags); | |
1164 | running = task_running(rq, p); | |
1165 | on_rq = p->se.on_rq; | |
1166 | task_rq_unlock(rq, &flags); | |
fa490cfd | 1167 | |
3a5c359a AK |
1168 | /* |
1169 | * Was it really running after all now that we | |
1170 | * checked with the proper locks actually held? | |
1171 | * | |
1172 | * Oops. Go back and try again.. | |
1173 | */ | |
1174 | if (unlikely(running)) { | |
1175 | cpu_relax(); | |
1176 | continue; | |
1177 | } | |
fa490cfd | 1178 | |
3a5c359a AK |
1179 | /* |
1180 | * It's not enough that it's not actively running, | |
1181 | * it must be off the runqueue _entirely_, and not | |
1182 | * preempted! | |
1183 | * | |
1184 | * So if it wa still runnable (but just not actively | |
1185 | * running right now), it's preempted, and we should | |
1186 | * yield - it could be a while. | |
1187 | */ | |
1188 | if (unlikely(on_rq)) { | |
1189 | schedule_timeout_uninterruptible(1); | |
1190 | continue; | |
1191 | } | |
fa490cfd | 1192 | |
3a5c359a AK |
1193 | /* |
1194 | * Ahh, all good. It wasn't running, and it wasn't | |
1195 | * runnable, which means that it will never become | |
1196 | * running in the future either. We're all done! | |
1197 | */ | |
1198 | break; | |
1199 | } | |
1da177e4 LT |
1200 | } |
1201 | ||
1202 | /*** | |
1203 | * kick_process - kick a running thread to enter/exit the kernel | |
1204 | * @p: the to-be-kicked thread | |
1205 | * | |
1206 | * Cause a process which is running on another CPU to enter | |
1207 | * kernel-mode, without any delay. (to get signals handled.) | |
1208 | * | |
1209 | * NOTE: this function doesnt have to take the runqueue lock, | |
1210 | * because all it wants to ensure is that the remote task enters | |
1211 | * the kernel. If the IPI races and the task has been migrated | |
1212 | * to another CPU then no harm is done and the purpose has been | |
1213 | * achieved as well. | |
1214 | */ | |
36c8b586 | 1215 | void kick_process(struct task_struct *p) |
1da177e4 LT |
1216 | { |
1217 | int cpu; | |
1218 | ||
1219 | preempt_disable(); | |
1220 | cpu = task_cpu(p); | |
1221 | if ((cpu != smp_processor_id()) && task_curr(p)) | |
1222 | smp_send_reschedule(cpu); | |
1223 | preempt_enable(); | |
1224 | } | |
1225 | ||
1226 | /* | |
2dd73a4f PW |
1227 | * Return a low guess at the load of a migration-source cpu weighted |
1228 | * according to the scheduling class and "nice" value. | |
1da177e4 LT |
1229 | * |
1230 | * We want to under-estimate the load of migration sources, to | |
1231 | * balance conservatively. | |
1232 | */ | |
a9957449 | 1233 | static unsigned long source_load(int cpu, int type) |
1da177e4 | 1234 | { |
70b97a7f | 1235 | struct rq *rq = cpu_rq(cpu); |
dd41f596 | 1236 | unsigned long total = weighted_cpuload(cpu); |
2dd73a4f | 1237 | |
3b0bd9bc | 1238 | if (type == 0) |
dd41f596 | 1239 | return total; |
b910472d | 1240 | |
dd41f596 | 1241 | return min(rq->cpu_load[type-1], total); |
1da177e4 LT |
1242 | } |
1243 | ||
1244 | /* | |
2dd73a4f PW |
1245 | * Return a high guess at the load of a migration-target cpu weighted |
1246 | * according to the scheduling class and "nice" value. | |
1da177e4 | 1247 | */ |
a9957449 | 1248 | static unsigned long target_load(int cpu, int type) |
1da177e4 | 1249 | { |
70b97a7f | 1250 | struct rq *rq = cpu_rq(cpu); |
dd41f596 | 1251 | unsigned long total = weighted_cpuload(cpu); |
2dd73a4f | 1252 | |
7897986b | 1253 | if (type == 0) |
dd41f596 | 1254 | return total; |
3b0bd9bc | 1255 | |
dd41f596 | 1256 | return max(rq->cpu_load[type-1], total); |
2dd73a4f PW |
1257 | } |
1258 | ||
1259 | /* | |
1260 | * Return the average load per task on the cpu's run queue | |
1261 | */ | |
1262 | static inline unsigned long cpu_avg_load_per_task(int cpu) | |
1263 | { | |
70b97a7f | 1264 | struct rq *rq = cpu_rq(cpu); |
dd41f596 | 1265 | unsigned long total = weighted_cpuload(cpu); |
2dd73a4f PW |
1266 | unsigned long n = rq->nr_running; |
1267 | ||
dd41f596 | 1268 | return n ? total / n : SCHED_LOAD_SCALE; |
1da177e4 LT |
1269 | } |
1270 | ||
147cbb4b NP |
1271 | /* |
1272 | * find_idlest_group finds and returns the least busy CPU group within the | |
1273 | * domain. | |
1274 | */ | |
1275 | static struct sched_group * | |
1276 | find_idlest_group(struct sched_domain *sd, struct task_struct *p, int this_cpu) | |
1277 | { | |
1278 | struct sched_group *idlest = NULL, *this = NULL, *group = sd->groups; | |
1279 | unsigned long min_load = ULONG_MAX, this_load = 0; | |
1280 | int load_idx = sd->forkexec_idx; | |
1281 | int imbalance = 100 + (sd->imbalance_pct-100)/2; | |
1282 | ||
1283 | do { | |
1284 | unsigned long load, avg_load; | |
1285 | int local_group; | |
1286 | int i; | |
1287 | ||
da5a5522 BD |
1288 | /* Skip over this group if it has no CPUs allowed */ |
1289 | if (!cpus_intersects(group->cpumask, p->cpus_allowed)) | |
3a5c359a | 1290 | continue; |
da5a5522 | 1291 | |
147cbb4b | 1292 | local_group = cpu_isset(this_cpu, group->cpumask); |
147cbb4b NP |
1293 | |
1294 | /* Tally up the load of all CPUs in the group */ | |
1295 | avg_load = 0; | |
1296 | ||
1297 | for_each_cpu_mask(i, group->cpumask) { | |
1298 | /* Bias balancing toward cpus of our domain */ | |
1299 | if (local_group) | |
1300 | load = source_load(i, load_idx); | |
1301 | else | |
1302 | load = target_load(i, load_idx); | |
1303 | ||
1304 | avg_load += load; | |
1305 | } | |
1306 | ||
1307 | /* Adjust by relative CPU power of the group */ | |
5517d86b ED |
1308 | avg_load = sg_div_cpu_power(group, |
1309 | avg_load * SCHED_LOAD_SCALE); | |
147cbb4b NP |
1310 | |
1311 | if (local_group) { | |
1312 | this_load = avg_load; | |
1313 | this = group; | |
1314 | } else if (avg_load < min_load) { | |
1315 | min_load = avg_load; | |
1316 | idlest = group; | |
1317 | } | |
3a5c359a | 1318 | } while (group = group->next, group != sd->groups); |
147cbb4b NP |
1319 | |
1320 | if (!idlest || 100*this_load < imbalance*min_load) | |
1321 | return NULL; | |
1322 | return idlest; | |
1323 | } | |
1324 | ||
1325 | /* | |
0feaece9 | 1326 | * find_idlest_cpu - find the idlest cpu among the cpus in group. |
147cbb4b | 1327 | */ |
95cdf3b7 IM |
1328 | static int |
1329 | find_idlest_cpu(struct sched_group *group, struct task_struct *p, int this_cpu) | |
147cbb4b | 1330 | { |
da5a5522 | 1331 | cpumask_t tmp; |
147cbb4b NP |
1332 | unsigned long load, min_load = ULONG_MAX; |
1333 | int idlest = -1; | |
1334 | int i; | |
1335 | ||
da5a5522 BD |
1336 | /* Traverse only the allowed CPUs */ |
1337 | cpus_and(tmp, group->cpumask, p->cpus_allowed); | |
1338 | ||
1339 | for_each_cpu_mask(i, tmp) { | |
2dd73a4f | 1340 | load = weighted_cpuload(i); |
147cbb4b NP |
1341 | |
1342 | if (load < min_load || (load == min_load && i == this_cpu)) { | |
1343 | min_load = load; | |
1344 | idlest = i; | |
1345 | } | |
1346 | } | |
1347 | ||
1348 | return idlest; | |
1349 | } | |
1350 | ||
476d139c NP |
1351 | /* |
1352 | * sched_balance_self: balance the current task (running on cpu) in domains | |
1353 | * that have the 'flag' flag set. In practice, this is SD_BALANCE_FORK and | |
1354 | * SD_BALANCE_EXEC. | |
1355 | * | |
1356 | * Balance, ie. select the least loaded group. | |
1357 | * | |
1358 | * Returns the target CPU number, or the same CPU if no balancing is needed. | |
1359 | * | |
1360 | * preempt must be disabled. | |
1361 | */ | |
1362 | static int sched_balance_self(int cpu, int flag) | |
1363 | { | |
1364 | struct task_struct *t = current; | |
1365 | struct sched_domain *tmp, *sd = NULL; | |
147cbb4b | 1366 | |
c96d145e | 1367 | for_each_domain(cpu, tmp) { |
9761eea8 IM |
1368 | /* |
1369 | * If power savings logic is enabled for a domain, stop there. | |
1370 | */ | |
5c45bf27 SS |
1371 | if (tmp->flags & SD_POWERSAVINGS_BALANCE) |
1372 | break; | |
476d139c NP |
1373 | if (tmp->flags & flag) |
1374 | sd = tmp; | |
c96d145e | 1375 | } |
476d139c NP |
1376 | |
1377 | while (sd) { | |
1378 | cpumask_t span; | |
1379 | struct sched_group *group; | |
1a848870 SS |
1380 | int new_cpu, weight; |
1381 | ||
1382 | if (!(sd->flags & flag)) { | |
1383 | sd = sd->child; | |
1384 | continue; | |
1385 | } | |
476d139c NP |
1386 | |
1387 | span = sd->span; | |
1388 | group = find_idlest_group(sd, t, cpu); | |
1a848870 SS |
1389 | if (!group) { |
1390 | sd = sd->child; | |
1391 | continue; | |
1392 | } | |
476d139c | 1393 | |
da5a5522 | 1394 | new_cpu = find_idlest_cpu(group, t, cpu); |
1a848870 SS |
1395 | if (new_cpu == -1 || new_cpu == cpu) { |
1396 | /* Now try balancing at a lower domain level of cpu */ | |
1397 | sd = sd->child; | |
1398 | continue; | |
1399 | } | |
476d139c | 1400 | |
1a848870 | 1401 | /* Now try balancing at a lower domain level of new_cpu */ |
476d139c | 1402 | cpu = new_cpu; |
476d139c NP |
1403 | sd = NULL; |
1404 | weight = cpus_weight(span); | |
1405 | for_each_domain(cpu, tmp) { | |
1406 | if (weight <= cpus_weight(tmp->span)) | |
1407 | break; | |
1408 | if (tmp->flags & flag) | |
1409 | sd = tmp; | |
1410 | } | |
1411 | /* while loop will break here if sd == NULL */ | |
1412 | } | |
1413 | ||
1414 | return cpu; | |
1415 | } | |
1416 | ||
1417 | #endif /* CONFIG_SMP */ | |
1da177e4 LT |
1418 | |
1419 | /* | |
1420 | * wake_idle() will wake a task on an idle cpu if task->cpu is | |
1421 | * not idle and an idle cpu is available. The span of cpus to | |
1422 | * search starts with cpus closest then further out as needed, | |
1423 | * so we always favor a closer, idle cpu. | |
1424 | * | |
1425 | * Returns the CPU we should wake onto. | |
1426 | */ | |
1427 | #if defined(ARCH_HAS_SCHED_WAKE_IDLE) | |
36c8b586 | 1428 | static int wake_idle(int cpu, struct task_struct *p) |
1da177e4 LT |
1429 | { |
1430 | cpumask_t tmp; | |
1431 | struct sched_domain *sd; | |
1432 | int i; | |
1433 | ||
4953198b SS |
1434 | /* |
1435 | * If it is idle, then it is the best cpu to run this task. | |
1436 | * | |
1437 | * This cpu is also the best, if it has more than one task already. | |
1438 | * Siblings must be also busy(in most cases) as they didn't already | |
1439 | * pickup the extra load from this cpu and hence we need not check | |
1440 | * sibling runqueue info. This will avoid the checks and cache miss | |
1441 | * penalities associated with that. | |
1442 | */ | |
1443 | if (idle_cpu(cpu) || cpu_rq(cpu)->nr_running > 1) | |
1da177e4 LT |
1444 | return cpu; |
1445 | ||
1446 | for_each_domain(cpu, sd) { | |
1447 | if (sd->flags & SD_WAKE_IDLE) { | |
e0f364f4 | 1448 | cpus_and(tmp, sd->span, p->cpus_allowed); |
1da177e4 | 1449 | for_each_cpu_mask(i, tmp) { |
cc367732 IM |
1450 | if (idle_cpu(i)) { |
1451 | if (i != task_cpu(p)) { | |
1452 | schedstat_inc(p, | |
1453 | se.nr_wakeups_idle); | |
1454 | } | |
1da177e4 | 1455 | return i; |
cc367732 | 1456 | } |
1da177e4 | 1457 | } |
9761eea8 | 1458 | } else { |
e0f364f4 | 1459 | break; |
9761eea8 | 1460 | } |
1da177e4 LT |
1461 | } |
1462 | return cpu; | |
1463 | } | |
1464 | #else | |
36c8b586 | 1465 | static inline int wake_idle(int cpu, struct task_struct *p) |
1da177e4 LT |
1466 | { |
1467 | return cpu; | |
1468 | } | |
1469 | #endif | |
1470 | ||
1471 | /*** | |
1472 | * try_to_wake_up - wake up a thread | |
1473 | * @p: the to-be-woken-up thread | |
1474 | * @state: the mask of task states that can be woken | |
1475 | * @sync: do a synchronous wakeup? | |
1476 | * | |
1477 | * Put it on the run-queue if it's not already there. The "current" | |
1478 | * thread is always on the run-queue (except when the actual | |
1479 | * re-schedule is in progress), and as such you're allowed to do | |
1480 | * the simpler "current->state = TASK_RUNNING" to mark yourself | |
1481 | * runnable without the overhead of this. | |
1482 | * | |
1483 | * returns failure only if the task is already active. | |
1484 | */ | |
36c8b586 | 1485 | static int try_to_wake_up(struct task_struct *p, unsigned int state, int sync) |
1da177e4 | 1486 | { |
cc367732 | 1487 | int cpu, orig_cpu, this_cpu, success = 0; |
1da177e4 LT |
1488 | unsigned long flags; |
1489 | long old_state; | |
70b97a7f | 1490 | struct rq *rq; |
1da177e4 | 1491 | #ifdef CONFIG_SMP |
7897986b | 1492 | struct sched_domain *sd, *this_sd = NULL; |
70b97a7f | 1493 | unsigned long load, this_load; |
1da177e4 LT |
1494 | int new_cpu; |
1495 | #endif | |
1496 | ||
1497 | rq = task_rq_lock(p, &flags); | |
1498 | old_state = p->state; | |
1499 | if (!(old_state & state)) | |
1500 | goto out; | |
1501 | ||
dd41f596 | 1502 | if (p->se.on_rq) |
1da177e4 LT |
1503 | goto out_running; |
1504 | ||
1505 | cpu = task_cpu(p); | |
cc367732 | 1506 | orig_cpu = cpu; |
1da177e4 LT |
1507 | this_cpu = smp_processor_id(); |
1508 | ||
1509 | #ifdef CONFIG_SMP | |
1510 | if (unlikely(task_running(rq, p))) | |
1511 | goto out_activate; | |
1512 | ||
7897986b NP |
1513 | new_cpu = cpu; |
1514 | ||
2d72376b | 1515 | schedstat_inc(rq, ttwu_count); |
1da177e4 LT |
1516 | if (cpu == this_cpu) { |
1517 | schedstat_inc(rq, ttwu_local); | |
7897986b NP |
1518 | goto out_set_cpu; |
1519 | } | |
1520 | ||
1521 | for_each_domain(this_cpu, sd) { | |
1522 | if (cpu_isset(cpu, sd->span)) { | |
1523 | schedstat_inc(sd, ttwu_wake_remote); | |
1524 | this_sd = sd; | |
1525 | break; | |
1da177e4 LT |
1526 | } |
1527 | } | |
1da177e4 | 1528 | |
7897986b | 1529 | if (unlikely(!cpu_isset(this_cpu, p->cpus_allowed))) |
1da177e4 LT |
1530 | goto out_set_cpu; |
1531 | ||
1da177e4 | 1532 | /* |
7897986b | 1533 | * Check for affine wakeup and passive balancing possibilities. |
1da177e4 | 1534 | */ |
7897986b NP |
1535 | if (this_sd) { |
1536 | int idx = this_sd->wake_idx; | |
1537 | unsigned int imbalance; | |
1da177e4 | 1538 | |
a3f21bce NP |
1539 | imbalance = 100 + (this_sd->imbalance_pct - 100) / 2; |
1540 | ||
7897986b NP |
1541 | load = source_load(cpu, idx); |
1542 | this_load = target_load(this_cpu, idx); | |
1da177e4 | 1543 | |
7897986b NP |
1544 | new_cpu = this_cpu; /* Wake to this CPU if we can */ |
1545 | ||
a3f21bce NP |
1546 | if (this_sd->flags & SD_WAKE_AFFINE) { |
1547 | unsigned long tl = this_load; | |
33859f7f MOS |
1548 | unsigned long tl_per_task; |
1549 | ||
71e20f18 IM |
1550 | /* |
1551 | * Attract cache-cold tasks on sync wakeups: | |
1552 | */ | |
1553 | if (sync && !task_hot(p, rq->clock, this_sd)) | |
1554 | goto out_set_cpu; | |
1555 | ||
cc367732 | 1556 | schedstat_inc(p, se.nr_wakeups_affine_attempts); |
33859f7f | 1557 | tl_per_task = cpu_avg_load_per_task(this_cpu); |
2dd73a4f | 1558 | |
1da177e4 | 1559 | /* |
a3f21bce NP |
1560 | * If sync wakeup then subtract the (maximum possible) |
1561 | * effect of the currently running task from the load | |
1562 | * of the current CPU: | |
1da177e4 | 1563 | */ |
a3f21bce | 1564 | if (sync) |
dd41f596 | 1565 | tl -= current->se.load.weight; |
a3f21bce NP |
1566 | |
1567 | if ((tl <= load && | |
2dd73a4f | 1568 | tl + target_load(cpu, idx) <= tl_per_task) || |
dd41f596 | 1569 | 100*(tl + p->se.load.weight) <= imbalance*load) { |
a3f21bce NP |
1570 | /* |
1571 | * This domain has SD_WAKE_AFFINE and | |
1572 | * p is cache cold in this domain, and | |
1573 | * there is no bad imbalance. | |
1574 | */ | |
1575 | schedstat_inc(this_sd, ttwu_move_affine); | |
cc367732 | 1576 | schedstat_inc(p, se.nr_wakeups_affine); |
a3f21bce NP |
1577 | goto out_set_cpu; |
1578 | } | |
1579 | } | |
1580 | ||
1581 | /* | |
1582 | * Start passive balancing when half the imbalance_pct | |
1583 | * limit is reached. | |
1584 | */ | |
1585 | if (this_sd->flags & SD_WAKE_BALANCE) { | |
1586 | if (imbalance*this_load <= 100*load) { | |
1587 | schedstat_inc(this_sd, ttwu_move_balance); | |
cc367732 | 1588 | schedstat_inc(p, se.nr_wakeups_passive); |
a3f21bce NP |
1589 | goto out_set_cpu; |
1590 | } | |
1da177e4 LT |
1591 | } |
1592 | } | |
1593 | ||
1594 | new_cpu = cpu; /* Could not wake to this_cpu. Wake to cpu instead */ | |
1595 | out_set_cpu: | |
1596 | new_cpu = wake_idle(new_cpu, p); | |
1597 | if (new_cpu != cpu) { | |
1598 | set_task_cpu(p, new_cpu); | |
1599 | task_rq_unlock(rq, &flags); | |
1600 | /* might preempt at this point */ | |
1601 | rq = task_rq_lock(p, &flags); | |
1602 | old_state = p->state; | |
1603 | if (!(old_state & state)) | |
1604 | goto out; | |
dd41f596 | 1605 | if (p->se.on_rq) |
1da177e4 LT |
1606 | goto out_running; |
1607 | ||
1608 | this_cpu = smp_processor_id(); | |
1609 | cpu = task_cpu(p); | |
1610 | } | |
1611 | ||
1612 | out_activate: | |
1613 | #endif /* CONFIG_SMP */ | |
cc367732 IM |
1614 | schedstat_inc(p, se.nr_wakeups); |
1615 | if (sync) | |
1616 | schedstat_inc(p, se.nr_wakeups_sync); | |
1617 | if (orig_cpu != cpu) | |
1618 | schedstat_inc(p, se.nr_wakeups_migrate); | |
1619 | if (cpu == this_cpu) | |
1620 | schedstat_inc(p, se.nr_wakeups_local); | |
1621 | else | |
1622 | schedstat_inc(p, se.nr_wakeups_remote); | |
2daa3577 | 1623 | update_rq_clock(rq); |
dd41f596 | 1624 | activate_task(rq, p, 1); |
9c63d9c0 | 1625 | check_preempt_curr(rq, p); |
1da177e4 LT |
1626 | success = 1; |
1627 | ||
1628 | out_running: | |
1629 | p->state = TASK_RUNNING; | |
1630 | out: | |
1631 | task_rq_unlock(rq, &flags); | |
1632 | ||
1633 | return success; | |
1634 | } | |
1635 | ||
36c8b586 | 1636 | int fastcall wake_up_process(struct task_struct *p) |
1da177e4 LT |
1637 | { |
1638 | return try_to_wake_up(p, TASK_STOPPED | TASK_TRACED | | |
1639 | TASK_INTERRUPTIBLE | TASK_UNINTERRUPTIBLE, 0); | |
1640 | } | |
1da177e4 LT |
1641 | EXPORT_SYMBOL(wake_up_process); |
1642 | ||
36c8b586 | 1643 | int fastcall wake_up_state(struct task_struct *p, unsigned int state) |
1da177e4 LT |
1644 | { |
1645 | return try_to_wake_up(p, state, 0); | |
1646 | } | |
1647 | ||
1da177e4 LT |
1648 | /* |
1649 | * Perform scheduler related setup for a newly forked process p. | |
1650 | * p is forked by current. | |
dd41f596 IM |
1651 | * |
1652 | * __sched_fork() is basic setup used by init_idle() too: | |
1653 | */ | |
1654 | static void __sched_fork(struct task_struct *p) | |
1655 | { | |
dd41f596 IM |
1656 | p->se.exec_start = 0; |
1657 | p->se.sum_exec_runtime = 0; | |
f6cf891c | 1658 | p->se.prev_sum_exec_runtime = 0; |
6cfb0d5d IM |
1659 | |
1660 | #ifdef CONFIG_SCHEDSTATS | |
1661 | p->se.wait_start = 0; | |
dd41f596 IM |
1662 | p->se.sum_sleep_runtime = 0; |
1663 | p->se.sleep_start = 0; | |
dd41f596 IM |
1664 | p->se.block_start = 0; |
1665 | p->se.sleep_max = 0; | |
1666 | p->se.block_max = 0; | |
1667 | p->se.exec_max = 0; | |
eba1ed4b | 1668 | p->se.slice_max = 0; |
dd41f596 | 1669 | p->se.wait_max = 0; |
6cfb0d5d | 1670 | #endif |
476d139c | 1671 | |
dd41f596 IM |
1672 | INIT_LIST_HEAD(&p->run_list); |
1673 | p->se.on_rq = 0; | |
476d139c | 1674 | |
e107be36 AK |
1675 | #ifdef CONFIG_PREEMPT_NOTIFIERS |
1676 | INIT_HLIST_HEAD(&p->preempt_notifiers); | |
1677 | #endif | |
1678 | ||
1da177e4 LT |
1679 | /* |
1680 | * We mark the process as running here, but have not actually | |
1681 | * inserted it onto the runqueue yet. This guarantees that | |
1682 | * nobody will actually run it, and a signal or other external | |
1683 | * event cannot wake it up and insert it on the runqueue either. | |
1684 | */ | |
1685 | p->state = TASK_RUNNING; | |
dd41f596 IM |
1686 | } |
1687 | ||
1688 | /* | |
1689 | * fork()/clone()-time setup: | |
1690 | */ | |
1691 | void sched_fork(struct task_struct *p, int clone_flags) | |
1692 | { | |
1693 | int cpu = get_cpu(); | |
1694 | ||
1695 | __sched_fork(p); | |
1696 | ||
1697 | #ifdef CONFIG_SMP | |
1698 | cpu = sched_balance_self(cpu, SD_BALANCE_FORK); | |
1699 | #endif | |
02e4bac2 | 1700 | set_task_cpu(p, cpu); |
b29739f9 IM |
1701 | |
1702 | /* | |
1703 | * Make sure we do not leak PI boosting priority to the child: | |
1704 | */ | |
1705 | p->prio = current->normal_prio; | |
2ddbf952 HS |
1706 | if (!rt_prio(p->prio)) |
1707 | p->sched_class = &fair_sched_class; | |
b29739f9 | 1708 | |
52f17b6c | 1709 | #if defined(CONFIG_SCHEDSTATS) || defined(CONFIG_TASK_DELAY_ACCT) |
dd41f596 | 1710 | if (likely(sched_info_on())) |
52f17b6c | 1711 | memset(&p->sched_info, 0, sizeof(p->sched_info)); |
1da177e4 | 1712 | #endif |
d6077cb8 | 1713 | #if defined(CONFIG_SMP) && defined(__ARCH_WANT_UNLOCKED_CTXSW) |
4866cde0 NP |
1714 | p->oncpu = 0; |
1715 | #endif | |
1da177e4 | 1716 | #ifdef CONFIG_PREEMPT |
4866cde0 | 1717 | /* Want to start with kernel preemption disabled. */ |
a1261f54 | 1718 | task_thread_info(p)->preempt_count = 1; |
1da177e4 | 1719 | #endif |
476d139c | 1720 | put_cpu(); |
1da177e4 LT |
1721 | } |
1722 | ||
1723 | /* | |
1724 | * wake_up_new_task - wake up a newly created task for the first time. | |
1725 | * | |
1726 | * This function will do some initial scheduler statistics housekeeping | |
1727 | * that must be done for every newly created context, then puts the task | |
1728 | * on the runqueue and wakes it. | |
1729 | */ | |
36c8b586 | 1730 | void fastcall wake_up_new_task(struct task_struct *p, unsigned long clone_flags) |
1da177e4 LT |
1731 | { |
1732 | unsigned long flags; | |
dd41f596 | 1733 | struct rq *rq; |
1da177e4 LT |
1734 | |
1735 | rq = task_rq_lock(p, &flags); | |
147cbb4b | 1736 | BUG_ON(p->state != TASK_RUNNING); |
a8e504d2 | 1737 | update_rq_clock(rq); |
1da177e4 LT |
1738 | |
1739 | p->prio = effective_prio(p); | |
1740 | ||
b9dca1e0 | 1741 | if (!p->sched_class->task_new || !current->se.on_rq) { |
dd41f596 | 1742 | activate_task(rq, p, 0); |
1da177e4 | 1743 | } else { |
1da177e4 | 1744 | /* |
dd41f596 IM |
1745 | * Let the scheduling class do new task startup |
1746 | * management (if any): | |
1da177e4 | 1747 | */ |
ee0827d8 | 1748 | p->sched_class->task_new(rq, p); |
e5fa2237 | 1749 | inc_nr_running(p, rq); |
1da177e4 | 1750 | } |
dd41f596 IM |
1751 | check_preempt_curr(rq, p); |
1752 | task_rq_unlock(rq, &flags); | |
1da177e4 LT |
1753 | } |
1754 | ||
e107be36 AK |
1755 | #ifdef CONFIG_PREEMPT_NOTIFIERS |
1756 | ||
1757 | /** | |
421cee29 RD |
1758 | * preempt_notifier_register - tell me when current is being being preempted & rescheduled |
1759 | * @notifier: notifier struct to register | |
e107be36 AK |
1760 | */ |
1761 | void preempt_notifier_register(struct preempt_notifier *notifier) | |
1762 | { | |
1763 | hlist_add_head(¬ifier->link, ¤t->preempt_notifiers); | |
1764 | } | |
1765 | EXPORT_SYMBOL_GPL(preempt_notifier_register); | |
1766 | ||
1767 | /** | |
1768 | * preempt_notifier_unregister - no longer interested in preemption notifications | |
421cee29 | 1769 | * @notifier: notifier struct to unregister |
e107be36 AK |
1770 | * |
1771 | * This is safe to call from within a preemption notifier. | |
1772 | */ | |
1773 | void preempt_notifier_unregister(struct preempt_notifier *notifier) | |
1774 | { | |
1775 | hlist_del(¬ifier->link); | |
1776 | } | |
1777 | EXPORT_SYMBOL_GPL(preempt_notifier_unregister); | |
1778 | ||
1779 | static void fire_sched_in_preempt_notifiers(struct task_struct *curr) | |
1780 | { | |
1781 | struct preempt_notifier *notifier; | |
1782 | struct hlist_node *node; | |
1783 | ||
1784 | hlist_for_each_entry(notifier, node, &curr->preempt_notifiers, link) | |
1785 | notifier->ops->sched_in(notifier, raw_smp_processor_id()); | |
1786 | } | |
1787 | ||
1788 | static void | |
1789 | fire_sched_out_preempt_notifiers(struct task_struct *curr, | |
1790 | struct task_struct *next) | |
1791 | { | |
1792 | struct preempt_notifier *notifier; | |
1793 | struct hlist_node *node; | |
1794 | ||
1795 | hlist_for_each_entry(notifier, node, &curr->preempt_notifiers, link) | |
1796 | notifier->ops->sched_out(notifier, next); | |
1797 | } | |
1798 | ||
1799 | #else | |
1800 | ||
1801 | static void fire_sched_in_preempt_notifiers(struct task_struct *curr) | |
1802 | { | |
1803 | } | |
1804 | ||
1805 | static void | |
1806 | fire_sched_out_preempt_notifiers(struct task_struct *curr, | |
1807 | struct task_struct *next) | |
1808 | { | |
1809 | } | |
1810 | ||
1811 | #endif | |
1812 | ||
4866cde0 NP |
1813 | /** |
1814 | * prepare_task_switch - prepare to switch tasks | |
1815 | * @rq: the runqueue preparing to switch | |
421cee29 | 1816 | * @prev: the current task that is being switched out |
4866cde0 NP |
1817 | * @next: the task we are going to switch to. |
1818 | * | |
1819 | * This is called with the rq lock held and interrupts off. It must | |
1820 | * be paired with a subsequent finish_task_switch after the context | |
1821 | * switch. | |
1822 | * | |
1823 | * prepare_task_switch sets up locking and calls architecture specific | |
1824 | * hooks. | |
1825 | */ | |
e107be36 AK |
1826 | static inline void |
1827 | prepare_task_switch(struct rq *rq, struct task_struct *prev, | |
1828 | struct task_struct *next) | |
4866cde0 | 1829 | { |
e107be36 | 1830 | fire_sched_out_preempt_notifiers(prev, next); |
4866cde0 NP |
1831 | prepare_lock_switch(rq, next); |
1832 | prepare_arch_switch(next); | |
1833 | } | |
1834 | ||
1da177e4 LT |
1835 | /** |
1836 | * finish_task_switch - clean up after a task-switch | |
344babaa | 1837 | * @rq: runqueue associated with task-switch |
1da177e4 LT |
1838 | * @prev: the thread we just switched away from. |
1839 | * | |
4866cde0 NP |
1840 | * finish_task_switch must be called after the context switch, paired |
1841 | * with a prepare_task_switch call before the context switch. | |
1842 | * finish_task_switch will reconcile locking set up by prepare_task_switch, | |
1843 | * and do any other architecture-specific cleanup actions. | |
1da177e4 LT |
1844 | * |
1845 | * Note that we may have delayed dropping an mm in context_switch(). If | |
1846 | * so, we finish that here outside of the runqueue lock. (Doing it | |
1847 | * with the lock held can cause deadlocks; see schedule() for | |
1848 | * details.) | |
1849 | */ | |
a9957449 | 1850 | static void finish_task_switch(struct rq *rq, struct task_struct *prev) |
1da177e4 LT |
1851 | __releases(rq->lock) |
1852 | { | |
1da177e4 | 1853 | struct mm_struct *mm = rq->prev_mm; |
55a101f8 | 1854 | long prev_state; |
1da177e4 LT |
1855 | |
1856 | rq->prev_mm = NULL; | |
1857 | ||
1858 | /* | |
1859 | * A task struct has one reference for the use as "current". | |
c394cc9f | 1860 | * If a task dies, then it sets TASK_DEAD in tsk->state and calls |
55a101f8 ON |
1861 | * schedule one last time. The schedule call will never return, and |
1862 | * the scheduled task must drop that reference. | |
c394cc9f | 1863 | * The test for TASK_DEAD must occur while the runqueue locks are |
1da177e4 LT |
1864 | * still held, otherwise prev could be scheduled on another cpu, die |
1865 | * there before we look at prev->state, and then the reference would | |
1866 | * be dropped twice. | |
1867 | * Manfred Spraul <manfred@colorfullife.com> | |
1868 | */ | |
55a101f8 | 1869 | prev_state = prev->state; |
4866cde0 NP |
1870 | finish_arch_switch(prev); |
1871 | finish_lock_switch(rq, prev); | |
e107be36 | 1872 | fire_sched_in_preempt_notifiers(current); |
1da177e4 LT |
1873 | if (mm) |
1874 | mmdrop(mm); | |
c394cc9f | 1875 | if (unlikely(prev_state == TASK_DEAD)) { |
c6fd91f0 | 1876 | /* |
1877 | * Remove function-return probe instances associated with this | |
1878 | * task and put them back on the free list. | |
9761eea8 | 1879 | */ |
c6fd91f0 | 1880 | kprobe_flush_task(prev); |
1da177e4 | 1881 | put_task_struct(prev); |
c6fd91f0 | 1882 | } |
1da177e4 LT |
1883 | } |
1884 | ||
1885 | /** | |
1886 | * schedule_tail - first thing a freshly forked thread must call. | |
1887 | * @prev: the thread we just switched away from. | |
1888 | */ | |
36c8b586 | 1889 | asmlinkage void schedule_tail(struct task_struct *prev) |
1da177e4 LT |
1890 | __releases(rq->lock) |
1891 | { | |
70b97a7f IM |
1892 | struct rq *rq = this_rq(); |
1893 | ||
4866cde0 NP |
1894 | finish_task_switch(rq, prev); |
1895 | #ifdef __ARCH_WANT_UNLOCKED_CTXSW | |
1896 | /* In this case, finish_task_switch does not reenable preemption */ | |
1897 | preempt_enable(); | |
1898 | #endif | |
1da177e4 | 1899 | if (current->set_child_tid) |
b488893a | 1900 | put_user(task_pid_vnr(current), current->set_child_tid); |
1da177e4 LT |
1901 | } |
1902 | ||
1903 | /* | |
1904 | * context_switch - switch to the new MM and the new | |
1905 | * thread's register state. | |
1906 | */ | |
dd41f596 | 1907 | static inline void |
70b97a7f | 1908 | context_switch(struct rq *rq, struct task_struct *prev, |
36c8b586 | 1909 | struct task_struct *next) |
1da177e4 | 1910 | { |
dd41f596 | 1911 | struct mm_struct *mm, *oldmm; |
1da177e4 | 1912 | |
e107be36 | 1913 | prepare_task_switch(rq, prev, next); |
dd41f596 IM |
1914 | mm = next->mm; |
1915 | oldmm = prev->active_mm; | |
9226d125 ZA |
1916 | /* |
1917 | * For paravirt, this is coupled with an exit in switch_to to | |
1918 | * combine the page table reload and the switch backend into | |
1919 | * one hypercall. | |
1920 | */ | |
1921 | arch_enter_lazy_cpu_mode(); | |
1922 | ||
dd41f596 | 1923 | if (unlikely(!mm)) { |
1da177e4 LT |
1924 | next->active_mm = oldmm; |
1925 | atomic_inc(&oldmm->mm_count); | |
1926 | enter_lazy_tlb(oldmm, next); | |
1927 | } else | |
1928 | switch_mm(oldmm, mm, next); | |
1929 | ||
dd41f596 | 1930 | if (unlikely(!prev->mm)) { |
1da177e4 | 1931 | prev->active_mm = NULL; |
1da177e4 LT |
1932 | rq->prev_mm = oldmm; |
1933 | } | |
3a5f5e48 IM |
1934 | /* |
1935 | * Since the runqueue lock will be released by the next | |
1936 | * task (which is an invalid locking op but in the case | |
1937 | * of the scheduler it's an obvious special-case), so we | |
1938 | * do an early lockdep release here: | |
1939 | */ | |
1940 | #ifndef __ARCH_WANT_UNLOCKED_CTXSW | |
8a25d5de | 1941 | spin_release(&rq->lock.dep_map, 1, _THIS_IP_); |
3a5f5e48 | 1942 | #endif |
1da177e4 LT |
1943 | |
1944 | /* Here we just switch the register state and the stack. */ | |
1945 | switch_to(prev, next, prev); | |
1946 | ||
dd41f596 IM |
1947 | barrier(); |
1948 | /* | |
1949 | * this_rq must be evaluated again because prev may have moved | |
1950 | * CPUs since it called schedule(), thus the 'rq' on its stack | |
1951 | * frame will be invalid. | |
1952 | */ | |
1953 | finish_task_switch(this_rq(), prev); | |
1da177e4 LT |
1954 | } |
1955 | ||
1956 | /* | |
1957 | * nr_running, nr_uninterruptible and nr_context_switches: | |
1958 | * | |
1959 | * externally visible scheduler statistics: current number of runnable | |
1960 | * threads, current number of uninterruptible-sleeping threads, total | |
1961 | * number of context switches performed since bootup. | |
1962 | */ | |
1963 | unsigned long nr_running(void) | |
1964 | { | |
1965 | unsigned long i, sum = 0; | |
1966 | ||
1967 | for_each_online_cpu(i) | |
1968 | sum += cpu_rq(i)->nr_running; | |
1969 | ||
1970 | return sum; | |
1971 | } | |
1972 | ||
1973 | unsigned long nr_uninterruptible(void) | |
1974 | { | |
1975 | unsigned long i, sum = 0; | |
1976 | ||
0a945022 | 1977 | for_each_possible_cpu(i) |
1da177e4 LT |
1978 | sum += cpu_rq(i)->nr_uninterruptible; |
1979 | ||
1980 | /* | |
1981 | * Since we read the counters lockless, it might be slightly | |
1982 | * inaccurate. Do not allow it to go below zero though: | |
1983 | */ | |
1984 | if (unlikely((long)sum < 0)) | |
1985 | sum = 0; | |
1986 | ||
1987 | return sum; | |
1988 | } | |
1989 | ||
1990 | unsigned long long nr_context_switches(void) | |
1991 | { | |
cc94abfc SR |
1992 | int i; |
1993 | unsigned long long sum = 0; | |
1da177e4 | 1994 | |
0a945022 | 1995 | for_each_possible_cpu(i) |
1da177e4 LT |
1996 | sum += cpu_rq(i)->nr_switches; |
1997 | ||
1998 | return sum; | |
1999 | } | |
2000 | ||
2001 | unsigned long nr_iowait(void) | |
2002 | { | |
2003 | unsigned long i, sum = 0; | |
2004 | ||
0a945022 | 2005 | for_each_possible_cpu(i) |
1da177e4 LT |
2006 | sum += atomic_read(&cpu_rq(i)->nr_iowait); |
2007 | ||
2008 | return sum; | |
2009 | } | |
2010 | ||
db1b1fef JS |
2011 | unsigned long nr_active(void) |
2012 | { | |
2013 | unsigned long i, running = 0, uninterruptible = 0; | |
2014 | ||
2015 | for_each_online_cpu(i) { | |
2016 | running += cpu_rq(i)->nr_running; | |
2017 | uninterruptible += cpu_rq(i)->nr_uninterruptible; | |
2018 | } | |
2019 | ||
2020 | if (unlikely((long)uninterruptible < 0)) | |
2021 | uninterruptible = 0; | |
2022 | ||
2023 | return running + uninterruptible; | |
2024 | } | |
2025 | ||
48f24c4d | 2026 | /* |
dd41f596 IM |
2027 | * Update rq->cpu_load[] statistics. This function is usually called every |
2028 | * scheduler tick (TICK_NSEC). | |
48f24c4d | 2029 | */ |
dd41f596 | 2030 | static void update_cpu_load(struct rq *this_rq) |
48f24c4d | 2031 | { |
495eca49 | 2032 | unsigned long this_load = this_rq->load.weight; |
dd41f596 IM |
2033 | int i, scale; |
2034 | ||
2035 | this_rq->nr_load_updates++; | |
dd41f596 IM |
2036 | |
2037 | /* Update our load: */ | |
2038 | for (i = 0, scale = 1; i < CPU_LOAD_IDX_MAX; i++, scale += scale) { | |
2039 | unsigned long old_load, new_load; | |
2040 | ||
2041 | /* scale is effectively 1 << i now, and >> i divides by scale */ | |
2042 | ||
2043 | old_load = this_rq->cpu_load[i]; | |
2044 | new_load = this_load; | |
a25707f3 IM |
2045 | /* |
2046 | * Round up the averaging division if load is increasing. This | |
2047 | * prevents us from getting stuck on 9 if the load is 10, for | |
2048 | * example. | |
2049 | */ | |
2050 | if (new_load > old_load) | |
2051 | new_load += scale-1; | |
dd41f596 IM |
2052 | this_rq->cpu_load[i] = (old_load*(scale-1) + new_load) >> i; |
2053 | } | |
48f24c4d IM |
2054 | } |
2055 | ||
dd41f596 IM |
2056 | #ifdef CONFIG_SMP |
2057 | ||
1da177e4 LT |
2058 | /* |
2059 | * double_rq_lock - safely lock two runqueues | |
2060 | * | |
2061 | * Note this does not disable interrupts like task_rq_lock, | |
2062 | * you need to do so manually before calling. | |
2063 | */ | |
70b97a7f | 2064 | static void double_rq_lock(struct rq *rq1, struct rq *rq2) |
1da177e4 LT |
2065 | __acquires(rq1->lock) |
2066 | __acquires(rq2->lock) | |
2067 | { | |
054b9108 | 2068 | BUG_ON(!irqs_disabled()); |
1da177e4 LT |
2069 | if (rq1 == rq2) { |
2070 | spin_lock(&rq1->lock); | |
2071 | __acquire(rq2->lock); /* Fake it out ;) */ | |
2072 | } else { | |
c96d145e | 2073 | if (rq1 < rq2) { |
1da177e4 LT |
2074 | spin_lock(&rq1->lock); |
2075 | spin_lock(&rq2->lock); | |
2076 | } else { | |
2077 | spin_lock(&rq2->lock); | |
2078 | spin_lock(&rq1->lock); | |
2079 | } | |
2080 | } | |
6e82a3be IM |
2081 | update_rq_clock(rq1); |
2082 | update_rq_clock(rq2); | |
1da177e4 LT |
2083 | } |
2084 | ||
2085 | /* | |
2086 | * double_rq_unlock - safely unlock two runqueues | |
2087 | * | |
2088 | * Note this does not restore interrupts like task_rq_unlock, | |
2089 | * you need to do so manually after calling. | |
2090 | */ | |
70b97a7f | 2091 | static void double_rq_unlock(struct rq *rq1, struct rq *rq2) |
1da177e4 LT |
2092 | __releases(rq1->lock) |
2093 | __releases(rq2->lock) | |
2094 | { | |
2095 | spin_unlock(&rq1->lock); | |
2096 | if (rq1 != rq2) | |
2097 | spin_unlock(&rq2->lock); | |
2098 | else | |
2099 | __release(rq2->lock); | |
2100 | } | |
2101 | ||
2102 | /* | |
2103 | * double_lock_balance - lock the busiest runqueue, this_rq is locked already. | |
2104 | */ | |
70b97a7f | 2105 | static void double_lock_balance(struct rq *this_rq, struct rq *busiest) |
1da177e4 LT |
2106 | __releases(this_rq->lock) |
2107 | __acquires(busiest->lock) | |
2108 | __acquires(this_rq->lock) | |
2109 | { | |
054b9108 KK |
2110 | if (unlikely(!irqs_disabled())) { |
2111 | /* printk() doesn't work good under rq->lock */ | |
2112 | spin_unlock(&this_rq->lock); | |
2113 | BUG_ON(1); | |
2114 | } | |
1da177e4 | 2115 | if (unlikely(!spin_trylock(&busiest->lock))) { |
c96d145e | 2116 | if (busiest < this_rq) { |
1da177e4 LT |
2117 | spin_unlock(&this_rq->lock); |
2118 | spin_lock(&busiest->lock); | |
2119 | spin_lock(&this_rq->lock); | |
2120 | } else | |
2121 | spin_lock(&busiest->lock); | |
2122 | } | |
2123 | } | |
2124 | ||
1da177e4 LT |
2125 | /* |
2126 | * If dest_cpu is allowed for this process, migrate the task to it. | |
2127 | * This is accomplished by forcing the cpu_allowed mask to only | |
2128 | * allow dest_cpu, which will force the cpu onto dest_cpu. Then | |
2129 | * the cpu_allowed mask is restored. | |
2130 | */ | |
36c8b586 | 2131 | static void sched_migrate_task(struct task_struct *p, int dest_cpu) |
1da177e4 | 2132 | { |
70b97a7f | 2133 | struct migration_req req; |
1da177e4 | 2134 | unsigned long flags; |
70b97a7f | 2135 | struct rq *rq; |
1da177e4 LT |
2136 | |
2137 | rq = task_rq_lock(p, &flags); | |
2138 | if (!cpu_isset(dest_cpu, p->cpus_allowed) | |
2139 | || unlikely(cpu_is_offline(dest_cpu))) | |
2140 | goto out; | |
2141 | ||
2142 | /* force the process onto the specified CPU */ | |
2143 | if (migrate_task(p, dest_cpu, &req)) { | |
2144 | /* Need to wait for migration thread (might exit: take ref). */ | |
2145 | struct task_struct *mt = rq->migration_thread; | |
36c8b586 | 2146 | |
1da177e4 LT |
2147 | get_task_struct(mt); |
2148 | task_rq_unlock(rq, &flags); | |
2149 | wake_up_process(mt); | |
2150 | put_task_struct(mt); | |
2151 | wait_for_completion(&req.done); | |
36c8b586 | 2152 | |
1da177e4 LT |
2153 | return; |
2154 | } | |
2155 | out: | |
2156 | task_rq_unlock(rq, &flags); | |
2157 | } | |
2158 | ||
2159 | /* | |
476d139c NP |
2160 | * sched_exec - execve() is a valuable balancing opportunity, because at |
2161 | * this point the task has the smallest effective memory and cache footprint. | |
1da177e4 LT |
2162 | */ |
2163 | void sched_exec(void) | |
2164 | { | |
1da177e4 | 2165 | int new_cpu, this_cpu = get_cpu(); |
476d139c | 2166 | new_cpu = sched_balance_self(this_cpu, SD_BALANCE_EXEC); |
1da177e4 | 2167 | put_cpu(); |
476d139c NP |
2168 | if (new_cpu != this_cpu) |
2169 | sched_migrate_task(current, new_cpu); | |
1da177e4 LT |
2170 | } |
2171 | ||
2172 | /* | |
2173 | * pull_task - move a task from a remote runqueue to the local runqueue. | |
2174 | * Both runqueues must be locked. | |
2175 | */ | |
dd41f596 IM |
2176 | static void pull_task(struct rq *src_rq, struct task_struct *p, |
2177 | struct rq *this_rq, int this_cpu) | |
1da177e4 | 2178 | { |
2e1cb74a | 2179 | deactivate_task(src_rq, p, 0); |
1da177e4 | 2180 | set_task_cpu(p, this_cpu); |
dd41f596 | 2181 | activate_task(this_rq, p, 0); |
1da177e4 LT |
2182 | /* |
2183 | * Note that idle threads have a prio of MAX_PRIO, for this test | |
2184 | * to be always true for them. | |
2185 | */ | |
dd41f596 | 2186 | check_preempt_curr(this_rq, p); |
1da177e4 LT |
2187 | } |
2188 | ||
2189 | /* | |
2190 | * can_migrate_task - may task p from runqueue rq be migrated to this_cpu? | |
2191 | */ | |
858119e1 | 2192 | static |
70b97a7f | 2193 | int can_migrate_task(struct task_struct *p, struct rq *rq, int this_cpu, |
d15bcfdb | 2194 | struct sched_domain *sd, enum cpu_idle_type idle, |
95cdf3b7 | 2195 | int *all_pinned) |
1da177e4 LT |
2196 | { |
2197 | /* | |
2198 | * We do not migrate tasks that are: | |
2199 | * 1) running (obviously), or | |
2200 | * 2) cannot be migrated to this CPU due to cpus_allowed, or | |
2201 | * 3) are cache-hot on their current CPU. | |
2202 | */ | |
cc367732 IM |
2203 | if (!cpu_isset(this_cpu, p->cpus_allowed)) { |
2204 | schedstat_inc(p, se.nr_failed_migrations_affine); | |
1da177e4 | 2205 | return 0; |
cc367732 | 2206 | } |
81026794 NP |
2207 | *all_pinned = 0; |
2208 | ||
cc367732 IM |
2209 | if (task_running(rq, p)) { |
2210 | schedstat_inc(p, se.nr_failed_migrations_running); | |
81026794 | 2211 | return 0; |
cc367732 | 2212 | } |
1da177e4 | 2213 | |
da84d961 IM |
2214 | /* |
2215 | * Aggressive migration if: | |
2216 | * 1) task is cache cold, or | |
2217 | * 2) too many balance attempts have failed. | |
2218 | */ | |
2219 | ||
6bc1665b IM |
2220 | if (!task_hot(p, rq->clock, sd) || |
2221 | sd->nr_balance_failed > sd->cache_nice_tries) { | |
da84d961 | 2222 | #ifdef CONFIG_SCHEDSTATS |
cc367732 | 2223 | if (task_hot(p, rq->clock, sd)) { |
da84d961 | 2224 | schedstat_inc(sd, lb_hot_gained[idle]); |
cc367732 IM |
2225 | schedstat_inc(p, se.nr_forced_migrations); |
2226 | } | |
da84d961 IM |
2227 | #endif |
2228 | return 1; | |
2229 | } | |
2230 | ||
cc367732 IM |
2231 | if (task_hot(p, rq->clock, sd)) { |
2232 | schedstat_inc(p, se.nr_failed_migrations_hot); | |
da84d961 | 2233 | return 0; |
cc367732 | 2234 | } |
1da177e4 LT |
2235 | return 1; |
2236 | } | |
2237 | ||
e1d1484f PW |
2238 | static unsigned long |
2239 | balance_tasks(struct rq *this_rq, int this_cpu, struct rq *busiest, | |
2240 | unsigned long max_load_move, struct sched_domain *sd, | |
2241 | enum cpu_idle_type idle, int *all_pinned, | |
2242 | int *this_best_prio, struct rq_iterator *iterator) | |
1da177e4 | 2243 | { |
b82d9fdd | 2244 | int loops = 0, pulled = 0, pinned = 0, skip_for_load; |
dd41f596 IM |
2245 | struct task_struct *p; |
2246 | long rem_load_move = max_load_move; | |
1da177e4 | 2247 | |
e1d1484f | 2248 | if (max_load_move == 0) |
1da177e4 LT |
2249 | goto out; |
2250 | ||
81026794 NP |
2251 | pinned = 1; |
2252 | ||
1da177e4 | 2253 | /* |
dd41f596 | 2254 | * Start the load-balancing iterator: |
1da177e4 | 2255 | */ |
dd41f596 IM |
2256 | p = iterator->start(iterator->arg); |
2257 | next: | |
b82d9fdd | 2258 | if (!p || loops++ > sysctl_sched_nr_migrate) |
1da177e4 | 2259 | goto out; |
50ddd969 | 2260 | /* |
b82d9fdd | 2261 | * To help distribute high priority tasks across CPUs we don't |
50ddd969 PW |
2262 | * skip a task if it will be the highest priority task (i.e. smallest |
2263 | * prio value) on its new queue regardless of its load weight | |
2264 | */ | |
dd41f596 IM |
2265 | skip_for_load = (p->se.load.weight >> 1) > rem_load_move + |
2266 | SCHED_LOAD_SCALE_FUZZ; | |
a4ac01c3 | 2267 | if ((skip_for_load && p->prio >= *this_best_prio) || |
dd41f596 | 2268 | !can_migrate_task(p, busiest, this_cpu, sd, idle, &pinned)) { |
dd41f596 IM |
2269 | p = iterator->next(iterator->arg); |
2270 | goto next; | |
1da177e4 LT |
2271 | } |
2272 | ||
dd41f596 | 2273 | pull_task(busiest, p, this_rq, this_cpu); |
1da177e4 | 2274 | pulled++; |
dd41f596 | 2275 | rem_load_move -= p->se.load.weight; |
1da177e4 | 2276 | |
2dd73a4f | 2277 | /* |
b82d9fdd | 2278 | * We only want to steal up to the prescribed amount of weighted load. |
2dd73a4f | 2279 | */ |
e1d1484f | 2280 | if (rem_load_move > 0) { |
a4ac01c3 PW |
2281 | if (p->prio < *this_best_prio) |
2282 | *this_best_prio = p->prio; | |
dd41f596 IM |
2283 | p = iterator->next(iterator->arg); |
2284 | goto next; | |
1da177e4 LT |
2285 | } |
2286 | out: | |
2287 | /* | |
e1d1484f | 2288 | * Right now, this is one of only two places pull_task() is called, |
1da177e4 LT |
2289 | * so we can safely collect pull_task() stats here rather than |
2290 | * inside pull_task(). | |
2291 | */ | |
2292 | schedstat_add(sd, lb_gained[idle], pulled); | |
81026794 NP |
2293 | |
2294 | if (all_pinned) | |
2295 | *all_pinned = pinned; | |
e1d1484f PW |
2296 | |
2297 | return max_load_move - rem_load_move; | |
1da177e4 LT |
2298 | } |
2299 | ||
dd41f596 | 2300 | /* |
43010659 PW |
2301 | * move_tasks tries to move up to max_load_move weighted load from busiest to |
2302 | * this_rq, as part of a balancing operation within domain "sd". | |
2303 | * Returns 1 if successful and 0 otherwise. | |
dd41f596 IM |
2304 | * |
2305 | * Called with both runqueues locked. | |
2306 | */ | |
2307 | static int move_tasks(struct rq *this_rq, int this_cpu, struct rq *busiest, | |
43010659 | 2308 | unsigned long max_load_move, |
dd41f596 IM |
2309 | struct sched_domain *sd, enum cpu_idle_type idle, |
2310 | int *all_pinned) | |
2311 | { | |
5522d5d5 | 2312 | const struct sched_class *class = sched_class_highest; |
43010659 | 2313 | unsigned long total_load_moved = 0; |
a4ac01c3 | 2314 | int this_best_prio = this_rq->curr->prio; |
dd41f596 IM |
2315 | |
2316 | do { | |
43010659 PW |
2317 | total_load_moved += |
2318 | class->load_balance(this_rq, this_cpu, busiest, | |
e1d1484f | 2319 | max_load_move - total_load_moved, |
a4ac01c3 | 2320 | sd, idle, all_pinned, &this_best_prio); |
dd41f596 | 2321 | class = class->next; |
43010659 | 2322 | } while (class && max_load_move > total_load_moved); |
dd41f596 | 2323 | |
43010659 PW |
2324 | return total_load_moved > 0; |
2325 | } | |
2326 | ||
e1d1484f PW |
2327 | static int |
2328 | iter_move_one_task(struct rq *this_rq, int this_cpu, struct rq *busiest, | |
2329 | struct sched_domain *sd, enum cpu_idle_type idle, | |
2330 | struct rq_iterator *iterator) | |
2331 | { | |
2332 | struct task_struct *p = iterator->start(iterator->arg); | |
2333 | int pinned = 0; | |
2334 | ||
2335 | while (p) { | |
2336 | if (can_migrate_task(p, busiest, this_cpu, sd, idle, &pinned)) { | |
2337 | pull_task(busiest, p, this_rq, this_cpu); | |
2338 | /* | |
2339 | * Right now, this is only the second place pull_task() | |
2340 | * is called, so we can safely collect pull_task() | |
2341 | * stats here rather than inside pull_task(). | |
2342 | */ | |
2343 | schedstat_inc(sd, lb_gained[idle]); | |
2344 | ||
2345 | return 1; | |
2346 | } | |
2347 | p = iterator->next(iterator->arg); | |
2348 | } | |
2349 | ||
2350 | return 0; | |
2351 | } | |
2352 | ||
43010659 PW |
2353 | /* |
2354 | * move_one_task tries to move exactly one task from busiest to this_rq, as | |
2355 | * part of active balancing operations within "domain". | |
2356 | * Returns 1 if successful and 0 otherwise. | |
2357 | * | |
2358 | * Called with both runqueues locked. | |
2359 | */ | |
2360 | static int move_one_task(struct rq *this_rq, int this_cpu, struct rq *busiest, | |
2361 | struct sched_domain *sd, enum cpu_idle_type idle) | |
2362 | { | |
5522d5d5 | 2363 | const struct sched_class *class; |
43010659 PW |
2364 | |
2365 | for (class = sched_class_highest; class; class = class->next) | |
e1d1484f | 2366 | if (class->move_one_task(this_rq, this_cpu, busiest, sd, idle)) |
43010659 PW |
2367 | return 1; |
2368 | ||
2369 | return 0; | |
dd41f596 IM |
2370 | } |
2371 | ||
1da177e4 LT |
2372 | /* |
2373 | * find_busiest_group finds and returns the busiest CPU group within the | |
48f24c4d IM |
2374 | * domain. It calculates and returns the amount of weighted load which |
2375 | * should be moved to restore balance via the imbalance parameter. | |
1da177e4 LT |
2376 | */ |
2377 | static struct sched_group * | |
2378 | find_busiest_group(struct sched_domain *sd, int this_cpu, | |
dd41f596 IM |
2379 | unsigned long *imbalance, enum cpu_idle_type idle, |
2380 | int *sd_idle, cpumask_t *cpus, int *balance) | |
1da177e4 LT |
2381 | { |
2382 | struct sched_group *busiest = NULL, *this = NULL, *group = sd->groups; | |
2383 | unsigned long max_load, avg_load, total_load, this_load, total_pwr; | |
0c117f1b | 2384 | unsigned long max_pull; |
2dd73a4f PW |
2385 | unsigned long busiest_load_per_task, busiest_nr_running; |
2386 | unsigned long this_load_per_task, this_nr_running; | |
908a7c1b | 2387 | int load_idx, group_imb = 0; |
5c45bf27 SS |
2388 | #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT) |
2389 | int power_savings_balance = 1; | |
2390 | unsigned long leader_nr_running = 0, min_load_per_task = 0; | |
2391 | unsigned long min_nr_running = ULONG_MAX; | |
2392 | struct sched_group *group_min = NULL, *group_leader = NULL; | |
2393 | #endif | |
1da177e4 LT |
2394 | |
2395 | max_load = this_load = total_load = total_pwr = 0; | |
2dd73a4f PW |
2396 | busiest_load_per_task = busiest_nr_running = 0; |
2397 | this_load_per_task = this_nr_running = 0; | |
d15bcfdb | 2398 | if (idle == CPU_NOT_IDLE) |
7897986b | 2399 | load_idx = sd->busy_idx; |
d15bcfdb | 2400 | else if (idle == CPU_NEWLY_IDLE) |
7897986b NP |
2401 | load_idx = sd->newidle_idx; |
2402 | else | |
2403 | load_idx = sd->idle_idx; | |
1da177e4 LT |
2404 | |
2405 | do { | |
908a7c1b | 2406 | unsigned long load, group_capacity, max_cpu_load, min_cpu_load; |
1da177e4 LT |
2407 | int local_group; |
2408 | int i; | |
908a7c1b | 2409 | int __group_imb = 0; |
783609c6 | 2410 | unsigned int balance_cpu = -1, first_idle_cpu = 0; |
2dd73a4f | 2411 | unsigned long sum_nr_running, sum_weighted_load; |
1da177e4 LT |
2412 | |
2413 | local_group = cpu_isset(this_cpu, group->cpumask); | |
2414 | ||
783609c6 SS |
2415 | if (local_group) |
2416 | balance_cpu = first_cpu(group->cpumask); | |
2417 | ||
1da177e4 | 2418 | /* Tally up the load of all CPUs in the group */ |
2dd73a4f | 2419 | sum_weighted_load = sum_nr_running = avg_load = 0; |
908a7c1b KC |
2420 | max_cpu_load = 0; |
2421 | min_cpu_load = ~0UL; | |
1da177e4 LT |
2422 | |
2423 | for_each_cpu_mask(i, group->cpumask) { | |
0a2966b4 CL |
2424 | struct rq *rq; |
2425 | ||
2426 | if (!cpu_isset(i, *cpus)) | |
2427 | continue; | |
2428 | ||
2429 | rq = cpu_rq(i); | |
2dd73a4f | 2430 | |
9439aab8 | 2431 | if (*sd_idle && rq->nr_running) |
5969fe06 NP |
2432 | *sd_idle = 0; |
2433 | ||
1da177e4 | 2434 | /* Bias balancing toward cpus of our domain */ |
783609c6 SS |
2435 | if (local_group) { |
2436 | if (idle_cpu(i) && !first_idle_cpu) { | |
2437 | first_idle_cpu = 1; | |
2438 | balance_cpu = i; | |
2439 | } | |
2440 | ||
a2000572 | 2441 | load = target_load(i, load_idx); |
908a7c1b | 2442 | } else { |
a2000572 | 2443 | load = source_load(i, load_idx); |
908a7c1b KC |
2444 | if (load > max_cpu_load) |
2445 | max_cpu_load = load; | |
2446 | if (min_cpu_load > load) | |
2447 | min_cpu_load = load; | |
2448 | } | |
1da177e4 LT |
2449 | |
2450 | avg_load += load; | |
2dd73a4f | 2451 | sum_nr_running += rq->nr_running; |
dd41f596 | 2452 | sum_weighted_load += weighted_cpuload(i); |
1da177e4 LT |
2453 | } |
2454 | ||
783609c6 SS |
2455 | /* |
2456 | * First idle cpu or the first cpu(busiest) in this sched group | |
2457 | * is eligible for doing load balancing at this and above | |
9439aab8 SS |
2458 | * domains. In the newly idle case, we will allow all the cpu's |
2459 | * to do the newly idle load balance. | |
783609c6 | 2460 | */ |
9439aab8 SS |
2461 | if (idle != CPU_NEWLY_IDLE && local_group && |
2462 | balance_cpu != this_cpu && balance) { | |
783609c6 SS |
2463 | *balance = 0; |
2464 | goto ret; | |
2465 | } | |
2466 | ||
1da177e4 | 2467 | total_load += avg_load; |
5517d86b | 2468 | total_pwr += group->__cpu_power; |
1da177e4 LT |
2469 | |
2470 | /* Adjust by relative CPU power of the group */ | |
5517d86b ED |
2471 | avg_load = sg_div_cpu_power(group, |
2472 | avg_load * SCHED_LOAD_SCALE); | |
1da177e4 | 2473 | |
908a7c1b KC |
2474 | if ((max_cpu_load - min_cpu_load) > SCHED_LOAD_SCALE) |
2475 | __group_imb = 1; | |
2476 | ||
5517d86b | 2477 | group_capacity = group->__cpu_power / SCHED_LOAD_SCALE; |
5c45bf27 | 2478 | |
1da177e4 LT |
2479 | if (local_group) { |
2480 | this_load = avg_load; | |
2481 | this = group; | |
2dd73a4f PW |
2482 | this_nr_running = sum_nr_running; |
2483 | this_load_per_task = sum_weighted_load; | |
2484 | } else if (avg_load > max_load && | |
908a7c1b | 2485 | (sum_nr_running > group_capacity || __group_imb)) { |
1da177e4 LT |
2486 | max_load = avg_load; |
2487 | busiest = group; | |
2dd73a4f PW |
2488 | busiest_nr_running = sum_nr_running; |
2489 | busiest_load_per_task = sum_weighted_load; | |
908a7c1b | 2490 | group_imb = __group_imb; |
1da177e4 | 2491 | } |
5c45bf27 SS |
2492 | |
2493 | #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT) | |
2494 | /* | |
2495 | * Busy processors will not participate in power savings | |
2496 | * balance. | |
2497 | */ | |
dd41f596 IM |
2498 | if (idle == CPU_NOT_IDLE || |
2499 | !(sd->flags & SD_POWERSAVINGS_BALANCE)) | |
2500 | goto group_next; | |
5c45bf27 SS |
2501 | |
2502 | /* | |
2503 | * If the local group is idle or completely loaded | |
2504 | * no need to do power savings balance at this domain | |
2505 | */ | |
2506 | if (local_group && (this_nr_running >= group_capacity || | |
2507 | !this_nr_running)) | |
2508 | power_savings_balance = 0; | |
2509 | ||
dd41f596 | 2510 | /* |
5c45bf27 SS |
2511 | * If a group is already running at full capacity or idle, |
2512 | * don't include that group in power savings calculations | |
dd41f596 IM |
2513 | */ |
2514 | if (!power_savings_balance || sum_nr_running >= group_capacity | |
5c45bf27 | 2515 | || !sum_nr_running) |
dd41f596 | 2516 | goto group_next; |
5c45bf27 | 2517 | |
dd41f596 | 2518 | /* |
5c45bf27 | 2519 | * Calculate the group which has the least non-idle load. |
dd41f596 IM |
2520 | * This is the group from where we need to pick up the load |
2521 | * for saving power | |
2522 | */ | |
2523 | if ((sum_nr_running < min_nr_running) || | |
2524 | (sum_nr_running == min_nr_running && | |
5c45bf27 SS |
2525 | first_cpu(group->cpumask) < |
2526 | first_cpu(group_min->cpumask))) { | |
dd41f596 IM |
2527 | group_min = group; |
2528 | min_nr_running = sum_nr_running; | |
5c45bf27 SS |
2529 | min_load_per_task = sum_weighted_load / |
2530 | sum_nr_running; | |
dd41f596 | 2531 | } |
5c45bf27 | 2532 | |
dd41f596 | 2533 | /* |
5c45bf27 | 2534 | * Calculate the group which is almost near its |
dd41f596 IM |
2535 | * capacity but still has some space to pick up some load |
2536 | * from other group and save more power | |
2537 | */ | |
2538 | if (sum_nr_running <= group_capacity - 1) { | |
2539 | if (sum_nr_running > leader_nr_running || | |
2540 | (sum_nr_running == leader_nr_running && | |
2541 | first_cpu(group->cpumask) > | |
2542 | first_cpu(group_leader->cpumask))) { | |
2543 | group_leader = group; | |
2544 | leader_nr_running = sum_nr_running; | |
2545 | } | |
48f24c4d | 2546 | } |
5c45bf27 SS |
2547 | group_next: |
2548 | #endif | |
1da177e4 LT |
2549 | group = group->next; |
2550 | } while (group != sd->groups); | |
2551 | ||
2dd73a4f | 2552 | if (!busiest || this_load >= max_load || busiest_nr_running == 0) |
1da177e4 LT |
2553 | goto out_balanced; |
2554 | ||
2555 | avg_load = (SCHED_LOAD_SCALE * total_load) / total_pwr; | |
2556 | ||
2557 | if (this_load >= avg_load || | |
2558 | 100*max_load <= sd->imbalance_pct*this_load) | |
2559 | goto out_balanced; | |
2560 | ||
2dd73a4f | 2561 | busiest_load_per_task /= busiest_nr_running; |
908a7c1b KC |
2562 | if (group_imb) |
2563 | busiest_load_per_task = min(busiest_load_per_task, avg_load); | |
2564 | ||
1da177e4 LT |
2565 | /* |
2566 | * We're trying to get all the cpus to the average_load, so we don't | |
2567 | * want to push ourselves above the average load, nor do we wish to | |
2568 | * reduce the max loaded cpu below the average load, as either of these | |
2569 | * actions would just result in more rebalancing later, and ping-pong | |
2570 | * tasks around. Thus we look for the minimum possible imbalance. | |
2571 | * Negative imbalances (*we* are more loaded than anyone else) will | |
2572 | * be counted as no imbalance for these purposes -- we can't fix that | |
2573 | * by pulling tasks to us. Be careful of negative numbers as they'll | |
2574 | * appear as very large values with unsigned longs. | |
2575 | */ | |
2dd73a4f PW |
2576 | if (max_load <= busiest_load_per_task) |
2577 | goto out_balanced; | |
2578 | ||
2579 | /* | |
2580 | * In the presence of smp nice balancing, certain scenarios can have | |
2581 | * max load less than avg load(as we skip the groups at or below | |
2582 | * its cpu_power, while calculating max_load..) | |
2583 | */ | |
2584 | if (max_load < avg_load) { | |
2585 | *imbalance = 0; | |
2586 | goto small_imbalance; | |
2587 | } | |
0c117f1b SS |
2588 | |
2589 | /* Don't want to pull so many tasks that a group would go idle */ | |
2dd73a4f | 2590 | max_pull = min(max_load - avg_load, max_load - busiest_load_per_task); |
0c117f1b | 2591 | |
1da177e4 | 2592 | /* How much load to actually move to equalise the imbalance */ |
5517d86b ED |
2593 | *imbalance = min(max_pull * busiest->__cpu_power, |
2594 | (avg_load - this_load) * this->__cpu_power) | |
1da177e4 LT |
2595 | / SCHED_LOAD_SCALE; |
2596 | ||
2dd73a4f PW |
2597 | /* |
2598 | * if *imbalance is less than the average load per runnable task | |
2599 | * there is no gaurantee that any tasks will be moved so we'll have | |
2600 | * a think about bumping its value to force at least one task to be | |
2601 | * moved | |
2602 | */ | |
7fd0d2dd | 2603 | if (*imbalance < busiest_load_per_task) { |
48f24c4d | 2604 | unsigned long tmp, pwr_now, pwr_move; |
2dd73a4f PW |
2605 | unsigned int imbn; |
2606 | ||
2607 | small_imbalance: | |
2608 | pwr_move = pwr_now = 0; | |
2609 | imbn = 2; | |
2610 | if (this_nr_running) { | |
2611 | this_load_per_task /= this_nr_running; | |
2612 | if (busiest_load_per_task > this_load_per_task) | |
2613 | imbn = 1; | |
2614 | } else | |
2615 | this_load_per_task = SCHED_LOAD_SCALE; | |
1da177e4 | 2616 | |
dd41f596 IM |
2617 | if (max_load - this_load + SCHED_LOAD_SCALE_FUZZ >= |
2618 | busiest_load_per_task * imbn) { | |
2dd73a4f | 2619 | *imbalance = busiest_load_per_task; |
1da177e4 LT |
2620 | return busiest; |
2621 | } | |
2622 | ||
2623 | /* | |
2624 | * OK, we don't have enough imbalance to justify moving tasks, | |
2625 | * however we may be able to increase total CPU power used by | |
2626 | * moving them. | |
2627 | */ | |
2628 | ||
5517d86b ED |
2629 | pwr_now += busiest->__cpu_power * |
2630 | min(busiest_load_per_task, max_load); | |
2631 | pwr_now += this->__cpu_power * | |
2632 | min(this_load_per_task, this_load); | |
1da177e4 LT |
2633 | pwr_now /= SCHED_LOAD_SCALE; |
2634 | ||
2635 | /* Amount of load we'd subtract */ | |
5517d86b ED |
2636 | tmp = sg_div_cpu_power(busiest, |
2637 | busiest_load_per_task * SCHED_LOAD_SCALE); | |
1da177e4 | 2638 | if (max_load > tmp) |
5517d86b | 2639 | pwr_move += busiest->__cpu_power * |
2dd73a4f | 2640 | min(busiest_load_per_task, max_load - tmp); |
1da177e4 LT |
2641 | |
2642 | /* Amount of load we'd add */ | |
5517d86b | 2643 | if (max_load * busiest->__cpu_power < |
33859f7f | 2644 | busiest_load_per_task * SCHED_LOAD_SCALE) |
5517d86b ED |
2645 | tmp = sg_div_cpu_power(this, |
2646 | max_load * busiest->__cpu_power); | |
1da177e4 | 2647 | else |
5517d86b ED |
2648 | tmp = sg_div_cpu_power(this, |
2649 | busiest_load_per_task * SCHED_LOAD_SCALE); | |
2650 | pwr_move += this->__cpu_power * | |
2651 | min(this_load_per_task, this_load + tmp); | |
1da177e4 LT |
2652 | pwr_move /= SCHED_LOAD_SCALE; |
2653 | ||
2654 | /* Move if we gain throughput */ | |
7fd0d2dd SS |
2655 | if (pwr_move > pwr_now) |
2656 | *imbalance = busiest_load_per_task; | |
1da177e4 LT |
2657 | } |
2658 | ||
1da177e4 LT |
2659 | return busiest; |
2660 | ||
2661 | out_balanced: | |
5c45bf27 | 2662 | #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT) |
d15bcfdb | 2663 | if (idle == CPU_NOT_IDLE || !(sd->flags & SD_POWERSAVINGS_BALANCE)) |
5c45bf27 | 2664 | goto ret; |
1da177e4 | 2665 | |
5c45bf27 SS |
2666 | if (this == group_leader && group_leader != group_min) { |
2667 | *imbalance = min_load_per_task; | |
2668 | return group_min; | |
2669 | } | |
5c45bf27 | 2670 | #endif |
783609c6 | 2671 | ret: |
1da177e4 LT |
2672 | *imbalance = 0; |
2673 | return NULL; | |
2674 | } | |
2675 | ||
2676 | /* | |
2677 | * find_busiest_queue - find the busiest runqueue among the cpus in group. | |
2678 | */ | |
70b97a7f | 2679 | static struct rq * |
d15bcfdb | 2680 | find_busiest_queue(struct sched_group *group, enum cpu_idle_type idle, |
0a2966b4 | 2681 | unsigned long imbalance, cpumask_t *cpus) |
1da177e4 | 2682 | { |
70b97a7f | 2683 | struct rq *busiest = NULL, *rq; |
2dd73a4f | 2684 | unsigned long max_load = 0; |
1da177e4 LT |
2685 | int i; |
2686 | ||
2687 | for_each_cpu_mask(i, group->cpumask) { | |
dd41f596 | 2688 | unsigned long wl; |
0a2966b4 CL |
2689 | |
2690 | if (!cpu_isset(i, *cpus)) | |
2691 | continue; | |
2692 | ||
48f24c4d | 2693 | rq = cpu_rq(i); |
dd41f596 | 2694 | wl = weighted_cpuload(i); |
2dd73a4f | 2695 | |
dd41f596 | 2696 | if (rq->nr_running == 1 && wl > imbalance) |
2dd73a4f | 2697 | continue; |
1da177e4 | 2698 | |
dd41f596 IM |
2699 | if (wl > max_load) { |
2700 | max_load = wl; | |
48f24c4d | 2701 | busiest = rq; |
1da177e4 LT |
2702 | } |
2703 | } | |
2704 | ||
2705 | return busiest; | |
2706 | } | |
2707 | ||
77391d71 NP |
2708 | /* |
2709 | * Max backoff if we encounter pinned tasks. Pretty arbitrary value, but | |
2710 | * so long as it is large enough. | |
2711 | */ | |
2712 | #define MAX_PINNED_INTERVAL 512 | |
2713 | ||
1da177e4 LT |
2714 | /* |
2715 | * Check this_cpu to ensure it is balanced within domain. Attempt to move | |
2716 | * tasks if there is an imbalance. | |
1da177e4 | 2717 | */ |
70b97a7f | 2718 | static int load_balance(int this_cpu, struct rq *this_rq, |
d15bcfdb | 2719 | struct sched_domain *sd, enum cpu_idle_type idle, |
783609c6 | 2720 | int *balance) |
1da177e4 | 2721 | { |
43010659 | 2722 | int ld_moved, all_pinned = 0, active_balance = 0, sd_idle = 0; |
1da177e4 | 2723 | struct sched_group *group; |
1da177e4 | 2724 | unsigned long imbalance; |
70b97a7f | 2725 | struct rq *busiest; |
0a2966b4 | 2726 | cpumask_t cpus = CPU_MASK_ALL; |
fe2eea3f | 2727 | unsigned long flags; |
5969fe06 | 2728 | |
89c4710e SS |
2729 | /* |
2730 | * When power savings policy is enabled for the parent domain, idle | |
2731 | * sibling can pick up load irrespective of busy siblings. In this case, | |
dd41f596 | 2732 | * let the state of idle sibling percolate up as CPU_IDLE, instead of |
d15bcfdb | 2733 | * portraying it as CPU_NOT_IDLE. |
89c4710e | 2734 | */ |
d15bcfdb | 2735 | if (idle != CPU_NOT_IDLE && sd->flags & SD_SHARE_CPUPOWER && |
89c4710e | 2736 | !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE)) |
5969fe06 | 2737 | sd_idle = 1; |
1da177e4 | 2738 | |
2d72376b | 2739 | schedstat_inc(sd, lb_count[idle]); |
1da177e4 | 2740 | |
0a2966b4 CL |
2741 | redo: |
2742 | group = find_busiest_group(sd, this_cpu, &imbalance, idle, &sd_idle, | |
783609c6 SS |
2743 | &cpus, balance); |
2744 | ||
06066714 | 2745 | if (*balance == 0) |
783609c6 | 2746 | goto out_balanced; |
783609c6 | 2747 | |
1da177e4 LT |
2748 | if (!group) { |
2749 | schedstat_inc(sd, lb_nobusyg[idle]); | |
2750 | goto out_balanced; | |
2751 | } | |
2752 | ||
0a2966b4 | 2753 | busiest = find_busiest_queue(group, idle, imbalance, &cpus); |
1da177e4 LT |
2754 | if (!busiest) { |
2755 | schedstat_inc(sd, lb_nobusyq[idle]); | |
2756 | goto out_balanced; | |
2757 | } | |
2758 | ||
db935dbd | 2759 | BUG_ON(busiest == this_rq); |
1da177e4 LT |
2760 | |
2761 | schedstat_add(sd, lb_imbalance[idle], imbalance); | |
2762 | ||
43010659 | 2763 | ld_moved = 0; |
1da177e4 LT |
2764 | if (busiest->nr_running > 1) { |
2765 | /* | |
2766 | * Attempt to move tasks. If find_busiest_group has found | |
2767 | * an imbalance but busiest->nr_running <= 1, the group is | |
43010659 | 2768 | * still unbalanced. ld_moved simply stays zero, so it is |
1da177e4 LT |
2769 | * correctly treated as an imbalance. |
2770 | */ | |
fe2eea3f | 2771 | local_irq_save(flags); |
e17224bf | 2772 | double_rq_lock(this_rq, busiest); |
43010659 | 2773 | ld_moved = move_tasks(this_rq, this_cpu, busiest, |
48f24c4d | 2774 | imbalance, sd, idle, &all_pinned); |
e17224bf | 2775 | double_rq_unlock(this_rq, busiest); |
fe2eea3f | 2776 | local_irq_restore(flags); |
81026794 | 2777 | |
46cb4b7c SS |
2778 | /* |
2779 | * some other cpu did the load balance for us. | |
2780 | */ | |
43010659 | 2781 | if (ld_moved && this_cpu != smp_processor_id()) |
46cb4b7c SS |
2782 | resched_cpu(this_cpu); |
2783 | ||
81026794 | 2784 | /* All tasks on this runqueue were pinned by CPU affinity */ |
0a2966b4 CL |
2785 | if (unlikely(all_pinned)) { |
2786 | cpu_clear(cpu_of(busiest), cpus); | |
2787 | if (!cpus_empty(cpus)) | |
2788 | goto redo; | |
81026794 | 2789 | goto out_balanced; |
0a2966b4 | 2790 | } |
1da177e4 | 2791 | } |
81026794 | 2792 | |
43010659 | 2793 | if (!ld_moved) { |
1da177e4 LT |
2794 | schedstat_inc(sd, lb_failed[idle]); |
2795 | sd->nr_balance_failed++; | |
2796 | ||
2797 | if (unlikely(sd->nr_balance_failed > sd->cache_nice_tries+2)) { | |
1da177e4 | 2798 | |
fe2eea3f | 2799 | spin_lock_irqsave(&busiest->lock, flags); |
fa3b6ddc SS |
2800 | |
2801 | /* don't kick the migration_thread, if the curr | |
2802 | * task on busiest cpu can't be moved to this_cpu | |
2803 | */ | |
2804 | if (!cpu_isset(this_cpu, busiest->curr->cpus_allowed)) { | |
fe2eea3f | 2805 | spin_unlock_irqrestore(&busiest->lock, flags); |
fa3b6ddc SS |
2806 | all_pinned = 1; |
2807 | goto out_one_pinned; | |
2808 | } | |
2809 | ||
1da177e4 LT |
2810 | if (!busiest->active_balance) { |
2811 | busiest->active_balance = 1; | |
2812 | busiest->push_cpu = this_cpu; | |
81026794 | 2813 | active_balance = 1; |
1da177e4 | 2814 | } |
fe2eea3f | 2815 | spin_unlock_irqrestore(&busiest->lock, flags); |
81026794 | 2816 | if (active_balance) |
1da177e4 LT |
2817 | wake_up_process(busiest->migration_thread); |
2818 | ||
2819 | /* | |
2820 | * We've kicked active balancing, reset the failure | |
2821 | * counter. | |
2822 | */ | |
39507451 | 2823 | sd->nr_balance_failed = sd->cache_nice_tries+1; |
1da177e4 | 2824 | } |
81026794 | 2825 | } else |
1da177e4 LT |
2826 | sd->nr_balance_failed = 0; |
2827 | ||
81026794 | 2828 | if (likely(!active_balance)) { |
1da177e4 LT |
2829 | /* We were unbalanced, so reset the balancing interval */ |
2830 | sd->balance_interval = sd->min_interval; | |
81026794 NP |
2831 | } else { |
2832 | /* | |
2833 | * If we've begun active balancing, start to back off. This | |
2834 | * case may not be covered by the all_pinned logic if there | |
2835 | * is only 1 task on the busy runqueue (because we don't call | |
2836 | * move_tasks). | |
2837 | */ | |
2838 | if (sd->balance_interval < sd->max_interval) | |
2839 | sd->balance_interval *= 2; | |
1da177e4 LT |
2840 | } |
2841 | ||
43010659 | 2842 | if (!ld_moved && !sd_idle && sd->flags & SD_SHARE_CPUPOWER && |
89c4710e | 2843 | !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE)) |
5969fe06 | 2844 | return -1; |
43010659 | 2845 | return ld_moved; |
1da177e4 LT |
2846 | |
2847 | out_balanced: | |
1da177e4 LT |
2848 | schedstat_inc(sd, lb_balanced[idle]); |
2849 | ||
16cfb1c0 | 2850 | sd->nr_balance_failed = 0; |
fa3b6ddc SS |
2851 | |
2852 | out_one_pinned: | |
1da177e4 | 2853 | /* tune up the balancing interval */ |
77391d71 NP |
2854 | if ((all_pinned && sd->balance_interval < MAX_PINNED_INTERVAL) || |
2855 | (sd->balance_interval < sd->max_interval)) | |
1da177e4 LT |
2856 | sd->balance_interval *= 2; |
2857 | ||
48f24c4d | 2858 | if (!sd_idle && sd->flags & SD_SHARE_CPUPOWER && |
89c4710e | 2859 | !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE)) |
5969fe06 | 2860 | return -1; |
1da177e4 LT |
2861 | return 0; |
2862 | } | |
2863 | ||
2864 | /* | |
2865 | * Check this_cpu to ensure it is balanced within domain. Attempt to move | |
2866 | * tasks if there is an imbalance. | |
2867 | * | |
d15bcfdb | 2868 | * Called from schedule when this_rq is about to become idle (CPU_NEWLY_IDLE). |
1da177e4 LT |
2869 | * this_rq is locked. |
2870 | */ | |
48f24c4d | 2871 | static int |
70b97a7f | 2872 | load_balance_newidle(int this_cpu, struct rq *this_rq, struct sched_domain *sd) |
1da177e4 LT |
2873 | { |
2874 | struct sched_group *group; | |
70b97a7f | 2875 | struct rq *busiest = NULL; |
1da177e4 | 2876 | unsigned long imbalance; |
43010659 | 2877 | int ld_moved = 0; |
5969fe06 | 2878 | int sd_idle = 0; |
969bb4e4 | 2879 | int all_pinned = 0; |
0a2966b4 | 2880 | cpumask_t cpus = CPU_MASK_ALL; |
5969fe06 | 2881 | |
89c4710e SS |
2882 | /* |
2883 | * When power savings policy is enabled for the parent domain, idle | |
2884 | * sibling can pick up load irrespective of busy siblings. In this case, | |
2885 | * let the state of idle sibling percolate up as IDLE, instead of | |
d15bcfdb | 2886 | * portraying it as CPU_NOT_IDLE. |
89c4710e SS |
2887 | */ |
2888 | if (sd->flags & SD_SHARE_CPUPOWER && | |
2889 | !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE)) | |
5969fe06 | 2890 | sd_idle = 1; |
1da177e4 | 2891 | |
2d72376b | 2892 | schedstat_inc(sd, lb_count[CPU_NEWLY_IDLE]); |
0a2966b4 | 2893 | redo: |
d15bcfdb | 2894 | group = find_busiest_group(sd, this_cpu, &imbalance, CPU_NEWLY_IDLE, |
783609c6 | 2895 | &sd_idle, &cpus, NULL); |
1da177e4 | 2896 | if (!group) { |
d15bcfdb | 2897 | schedstat_inc(sd, lb_nobusyg[CPU_NEWLY_IDLE]); |
16cfb1c0 | 2898 | goto out_balanced; |
1da177e4 LT |
2899 | } |
2900 | ||
d15bcfdb | 2901 | busiest = find_busiest_queue(group, CPU_NEWLY_IDLE, imbalance, |
0a2966b4 | 2902 | &cpus); |
db935dbd | 2903 | if (!busiest) { |
d15bcfdb | 2904 | schedstat_inc(sd, lb_nobusyq[CPU_NEWLY_IDLE]); |
16cfb1c0 | 2905 | goto out_balanced; |
1da177e4 LT |
2906 | } |
2907 | ||
db935dbd NP |
2908 | BUG_ON(busiest == this_rq); |
2909 | ||
d15bcfdb | 2910 | schedstat_add(sd, lb_imbalance[CPU_NEWLY_IDLE], imbalance); |
d6d5cfaf | 2911 | |
43010659 | 2912 | ld_moved = 0; |
d6d5cfaf NP |
2913 | if (busiest->nr_running > 1) { |
2914 | /* Attempt to move tasks */ | |
2915 | double_lock_balance(this_rq, busiest); | |
6e82a3be IM |
2916 | /* this_rq->clock is already updated */ |
2917 | update_rq_clock(busiest); | |
43010659 | 2918 | ld_moved = move_tasks(this_rq, this_cpu, busiest, |
969bb4e4 SS |
2919 | imbalance, sd, CPU_NEWLY_IDLE, |
2920 | &all_pinned); | |
d6d5cfaf | 2921 | spin_unlock(&busiest->lock); |
0a2966b4 | 2922 | |
969bb4e4 | 2923 | if (unlikely(all_pinned)) { |
0a2966b4 CL |
2924 | cpu_clear(cpu_of(busiest), cpus); |
2925 | if (!cpus_empty(cpus)) | |
2926 | goto redo; | |
2927 | } | |
d6d5cfaf NP |
2928 | } |
2929 | ||
43010659 | 2930 | if (!ld_moved) { |
d15bcfdb | 2931 | schedstat_inc(sd, lb_failed[CPU_NEWLY_IDLE]); |
89c4710e SS |
2932 | if (!sd_idle && sd->flags & SD_SHARE_CPUPOWER && |
2933 | !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE)) | |
5969fe06 NP |
2934 | return -1; |
2935 | } else | |
16cfb1c0 | 2936 | sd->nr_balance_failed = 0; |
1da177e4 | 2937 | |
43010659 | 2938 | return ld_moved; |
16cfb1c0 NP |
2939 | |
2940 | out_balanced: | |
d15bcfdb | 2941 | schedstat_inc(sd, lb_balanced[CPU_NEWLY_IDLE]); |
48f24c4d | 2942 | if (!sd_idle && sd->flags & SD_SHARE_CPUPOWER && |
89c4710e | 2943 | !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE)) |
5969fe06 | 2944 | return -1; |
16cfb1c0 | 2945 | sd->nr_balance_failed = 0; |
48f24c4d | 2946 | |
16cfb1c0 | 2947 | return 0; |
1da177e4 LT |
2948 | } |
2949 | ||
2950 | /* | |
2951 | * idle_balance is called by schedule() if this_cpu is about to become | |
2952 | * idle. Attempts to pull tasks from other CPUs. | |
2953 | */ | |
70b97a7f | 2954 | static void idle_balance(int this_cpu, struct rq *this_rq) |
1da177e4 LT |
2955 | { |
2956 | struct sched_domain *sd; | |
dd41f596 IM |
2957 | int pulled_task = -1; |
2958 | unsigned long next_balance = jiffies + HZ; | |
1da177e4 LT |
2959 | |
2960 | for_each_domain(this_cpu, sd) { | |
92c4ca5c CL |
2961 | unsigned long interval; |
2962 | ||
2963 | if (!(sd->flags & SD_LOAD_BALANCE)) | |
2964 | continue; | |
2965 | ||
2966 | if (sd->flags & SD_BALANCE_NEWIDLE) | |
48f24c4d | 2967 | /* If we've pulled tasks over stop searching: */ |
1bd77f2d | 2968 | pulled_task = load_balance_newidle(this_cpu, |
92c4ca5c CL |
2969 | this_rq, sd); |
2970 | ||
2971 | interval = msecs_to_jiffies(sd->balance_interval); | |
2972 | if (time_after(next_balance, sd->last_balance + interval)) | |
2973 | next_balance = sd->last_balance + interval; | |
2974 | if (pulled_task) | |
2975 | break; | |
1da177e4 | 2976 | } |
dd41f596 | 2977 | if (pulled_task || time_after(jiffies, this_rq->next_balance)) { |
1bd77f2d CL |
2978 | /* |
2979 | * We are going idle. next_balance may be set based on | |
2980 | * a busy processor. So reset next_balance. | |
2981 | */ | |
2982 | this_rq->next_balance = next_balance; | |
dd41f596 | 2983 | } |
1da177e4 LT |
2984 | } |
2985 | ||
2986 | /* | |
2987 | * active_load_balance is run by migration threads. It pushes running tasks | |
2988 | * off the busiest CPU onto idle CPUs. It requires at least 1 task to be | |
2989 | * running on each physical CPU where possible, and avoids physical / | |
2990 | * logical imbalances. | |
2991 | * | |
2992 | * Called with busiest_rq locked. | |
2993 | */ | |
70b97a7f | 2994 | static void active_load_balance(struct rq *busiest_rq, int busiest_cpu) |
1da177e4 | 2995 | { |
39507451 | 2996 | int target_cpu = busiest_rq->push_cpu; |
70b97a7f IM |
2997 | struct sched_domain *sd; |
2998 | struct rq *target_rq; | |
39507451 | 2999 | |
48f24c4d | 3000 | /* Is there any task to move? */ |
39507451 | 3001 | if (busiest_rq->nr_running <= 1) |
39507451 NP |
3002 | return; |
3003 | ||
3004 | target_rq = cpu_rq(target_cpu); | |
1da177e4 LT |
3005 | |
3006 | /* | |
39507451 NP |
3007 | * This condition is "impossible", if it occurs |
3008 | * we need to fix it. Originally reported by | |
3009 | * Bjorn Helgaas on a 128-cpu setup. | |
1da177e4 | 3010 | */ |
39507451 | 3011 | BUG_ON(busiest_rq == target_rq); |
1da177e4 | 3012 | |
39507451 NP |
3013 | /* move a task from busiest_rq to target_rq */ |
3014 | double_lock_balance(busiest_rq, target_rq); | |
6e82a3be IM |
3015 | update_rq_clock(busiest_rq); |
3016 | update_rq_clock(target_rq); | |
39507451 NP |
3017 | |
3018 | /* Search for an sd spanning us and the target CPU. */ | |
c96d145e | 3019 | for_each_domain(target_cpu, sd) { |
39507451 | 3020 | if ((sd->flags & SD_LOAD_BALANCE) && |
48f24c4d | 3021 | cpu_isset(busiest_cpu, sd->span)) |
39507451 | 3022 | break; |
c96d145e | 3023 | } |
39507451 | 3024 | |
48f24c4d | 3025 | if (likely(sd)) { |
2d72376b | 3026 | schedstat_inc(sd, alb_count); |
39507451 | 3027 | |
43010659 PW |
3028 | if (move_one_task(target_rq, target_cpu, busiest_rq, |
3029 | sd, CPU_IDLE)) | |
48f24c4d IM |
3030 | schedstat_inc(sd, alb_pushed); |
3031 | else | |
3032 | schedstat_inc(sd, alb_failed); | |
3033 | } | |
39507451 | 3034 | spin_unlock(&target_rq->lock); |
1da177e4 LT |
3035 | } |
3036 | ||
46cb4b7c SS |
3037 | #ifdef CONFIG_NO_HZ |
3038 | static struct { | |
3039 | atomic_t load_balancer; | |
3040 | cpumask_t cpu_mask; | |
3041 | } nohz ____cacheline_aligned = { | |
3042 | .load_balancer = ATOMIC_INIT(-1), | |
3043 | .cpu_mask = CPU_MASK_NONE, | |
3044 | }; | |
3045 | ||
7835b98b | 3046 | /* |
46cb4b7c SS |
3047 | * This routine will try to nominate the ilb (idle load balancing) |
3048 | * owner among the cpus whose ticks are stopped. ilb owner will do the idle | |
3049 | * load balancing on behalf of all those cpus. If all the cpus in the system | |
3050 | * go into this tickless mode, then there will be no ilb owner (as there is | |
3051 | * no need for one) and all the cpus will sleep till the next wakeup event | |
3052 | * arrives... | |
3053 | * | |
3054 | * For the ilb owner, tick is not stopped. And this tick will be used | |
3055 | * for idle load balancing. ilb owner will still be part of | |
3056 | * nohz.cpu_mask.. | |
7835b98b | 3057 | * |
46cb4b7c SS |
3058 | * While stopping the tick, this cpu will become the ilb owner if there |
3059 | * is no other owner. And will be the owner till that cpu becomes busy | |
3060 | * or if all cpus in the system stop their ticks at which point | |
3061 | * there is no need for ilb owner. | |
3062 | * | |
3063 | * When the ilb owner becomes busy, it nominates another owner, during the | |
3064 | * next busy scheduler_tick() | |
3065 | */ | |
3066 | int select_nohz_load_balancer(int stop_tick) | |
3067 | { | |
3068 | int cpu = smp_processor_id(); | |
3069 | ||
3070 | if (stop_tick) { | |
3071 | cpu_set(cpu, nohz.cpu_mask); | |
3072 | cpu_rq(cpu)->in_nohz_recently = 1; | |
3073 | ||
3074 | /* | |
3075 | * If we are going offline and still the leader, give up! | |
3076 | */ | |
3077 | if (cpu_is_offline(cpu) && | |
3078 | atomic_read(&nohz.load_balancer) == cpu) { | |
3079 | if (atomic_cmpxchg(&nohz.load_balancer, cpu, -1) != cpu) | |
3080 | BUG(); | |
3081 | return 0; | |
3082 | } | |
3083 | ||
3084 | /* time for ilb owner also to sleep */ | |
3085 | if (cpus_weight(nohz.cpu_mask) == num_online_cpus()) { | |
3086 | if (atomic_read(&nohz.load_balancer) == cpu) | |
3087 | atomic_set(&nohz.load_balancer, -1); | |
3088 | return 0; | |
3089 | } | |
3090 | ||
3091 | if (atomic_read(&nohz.load_balancer) == -1) { | |
3092 | /* make me the ilb owner */ | |
3093 | if (atomic_cmpxchg(&nohz.load_balancer, -1, cpu) == -1) | |
3094 | return 1; | |
3095 | } else if (atomic_read(&nohz.load_balancer) == cpu) | |
3096 | return 1; | |
3097 | } else { | |
3098 | if (!cpu_isset(cpu, nohz.cpu_mask)) | |
3099 | return 0; | |
3100 | ||
3101 | cpu_clear(cpu, nohz.cpu_mask); | |
3102 | ||
3103 | if (atomic_read(&nohz.load_balancer) == cpu) | |
3104 | if (atomic_cmpxchg(&nohz.load_balancer, cpu, -1) != cpu) | |
3105 | BUG(); | |
3106 | } | |
3107 | return 0; | |
3108 | } | |
3109 | #endif | |
3110 | ||
3111 | static DEFINE_SPINLOCK(balancing); | |
3112 | ||
3113 | /* | |
7835b98b CL |
3114 | * It checks each scheduling domain to see if it is due to be balanced, |
3115 | * and initiates a balancing operation if so. | |
3116 | * | |
3117 | * Balancing parameters are set up in arch_init_sched_domains. | |
3118 | */ | |
a9957449 | 3119 | static void rebalance_domains(int cpu, enum cpu_idle_type idle) |
7835b98b | 3120 | { |
46cb4b7c SS |
3121 | int balance = 1; |
3122 | struct rq *rq = cpu_rq(cpu); | |
7835b98b CL |
3123 | unsigned long interval; |
3124 | struct sched_domain *sd; | |
46cb4b7c | 3125 | /* Earliest time when we have to do rebalance again */ |
c9819f45 | 3126 | unsigned long next_balance = jiffies + 60*HZ; |
f549da84 | 3127 | int update_next_balance = 0; |
1da177e4 | 3128 | |
46cb4b7c | 3129 | for_each_domain(cpu, sd) { |
1da177e4 LT |
3130 | if (!(sd->flags & SD_LOAD_BALANCE)) |
3131 | continue; | |
3132 | ||
3133 | interval = sd->balance_interval; | |
d15bcfdb | 3134 | if (idle != CPU_IDLE) |
1da177e4 LT |
3135 | interval *= sd->busy_factor; |
3136 | ||
3137 | /* scale ms to jiffies */ | |
3138 | interval = msecs_to_jiffies(interval); | |
3139 | if (unlikely(!interval)) | |
3140 | interval = 1; | |
dd41f596 IM |
3141 | if (interval > HZ*NR_CPUS/10) |
3142 | interval = HZ*NR_CPUS/10; | |
3143 | ||
1da177e4 | 3144 | |
08c183f3 CL |
3145 | if (sd->flags & SD_SERIALIZE) { |
3146 | if (!spin_trylock(&balancing)) | |
3147 | goto out; | |
3148 | } | |
3149 | ||
c9819f45 | 3150 | if (time_after_eq(jiffies, sd->last_balance + interval)) { |
46cb4b7c | 3151 | if (load_balance(cpu, rq, sd, idle, &balance)) { |
fa3b6ddc SS |
3152 | /* |
3153 | * We've pulled tasks over so either we're no | |
5969fe06 NP |
3154 | * longer idle, or one of our SMT siblings is |
3155 | * not idle. | |
3156 | */ | |
d15bcfdb | 3157 | idle = CPU_NOT_IDLE; |
1da177e4 | 3158 | } |
1bd77f2d | 3159 | sd->last_balance = jiffies; |
1da177e4 | 3160 | } |
08c183f3 CL |
3161 | if (sd->flags & SD_SERIALIZE) |
3162 | spin_unlock(&balancing); | |
3163 | out: | |
f549da84 | 3164 | if (time_after(next_balance, sd->last_balance + interval)) { |
c9819f45 | 3165 | next_balance = sd->last_balance + interval; |
f549da84 SS |
3166 | update_next_balance = 1; |
3167 | } | |
783609c6 SS |
3168 | |
3169 | /* | |
3170 | * Stop the load balance at this level. There is another | |
3171 | * CPU in our sched group which is doing load balancing more | |
3172 | * actively. | |
3173 | */ | |
3174 | if (!balance) | |
3175 | break; | |
1da177e4 | 3176 | } |
f549da84 SS |
3177 | |
3178 | /* | |
3179 | * next_balance will be updated only when there is a need. | |
3180 | * When the cpu is attached to null domain for ex, it will not be | |
3181 | * updated. | |
3182 | */ | |
3183 | if (likely(update_next_balance)) | |
3184 | rq->next_balance = next_balance; | |
46cb4b7c SS |
3185 | } |
3186 | ||
3187 | /* | |
3188 | * run_rebalance_domains is triggered when needed from the scheduler tick. | |
3189 | * In CONFIG_NO_HZ case, the idle load balance owner will do the | |
3190 | * rebalancing for all the cpus for whom scheduler ticks are stopped. | |
3191 | */ | |
3192 | static void run_rebalance_domains(struct softirq_action *h) | |
3193 | { | |
dd41f596 IM |
3194 | int this_cpu = smp_processor_id(); |
3195 | struct rq *this_rq = cpu_rq(this_cpu); | |
3196 | enum cpu_idle_type idle = this_rq->idle_at_tick ? | |
3197 | CPU_IDLE : CPU_NOT_IDLE; | |
46cb4b7c | 3198 | |
dd41f596 | 3199 | rebalance_domains(this_cpu, idle); |
46cb4b7c SS |
3200 | |
3201 | #ifdef CONFIG_NO_HZ | |
3202 | /* | |
3203 | * If this cpu is the owner for idle load balancing, then do the | |
3204 | * balancing on behalf of the other idle cpus whose ticks are | |
3205 | * stopped. | |
3206 | */ | |
dd41f596 IM |
3207 | if (this_rq->idle_at_tick && |
3208 | atomic_read(&nohz.load_balancer) == this_cpu) { | |
46cb4b7c SS |
3209 | cpumask_t cpus = nohz.cpu_mask; |
3210 | struct rq *rq; | |
3211 | int balance_cpu; | |
3212 | ||
dd41f596 | 3213 | cpu_clear(this_cpu, cpus); |
46cb4b7c SS |
3214 | for_each_cpu_mask(balance_cpu, cpus) { |
3215 | /* | |
3216 | * If this cpu gets work to do, stop the load balancing | |
3217 | * work being done for other cpus. Next load | |
3218 | * balancing owner will pick it up. | |
3219 | */ | |
3220 | if (need_resched()) | |
3221 | break; | |
3222 | ||
de0cf899 | 3223 | rebalance_domains(balance_cpu, CPU_IDLE); |
46cb4b7c SS |
3224 | |
3225 | rq = cpu_rq(balance_cpu); | |
dd41f596 IM |
3226 | if (time_after(this_rq->next_balance, rq->next_balance)) |
3227 | this_rq->next_balance = rq->next_balance; | |
46cb4b7c SS |
3228 | } |
3229 | } | |
3230 | #endif | |
3231 | } | |
3232 | ||
3233 | /* | |
3234 | * Trigger the SCHED_SOFTIRQ if it is time to do periodic load balancing. | |
3235 | * | |
3236 | * In case of CONFIG_NO_HZ, this is the place where we nominate a new | |
3237 | * idle load balancing owner or decide to stop the periodic load balancing, | |
3238 | * if the whole system is idle. | |
3239 | */ | |
dd41f596 | 3240 | static inline void trigger_load_balance(struct rq *rq, int cpu) |
46cb4b7c | 3241 | { |
46cb4b7c SS |
3242 | #ifdef CONFIG_NO_HZ |
3243 | /* | |
3244 | * If we were in the nohz mode recently and busy at the current | |
3245 | * scheduler tick, then check if we need to nominate new idle | |
3246 | * load balancer. | |
3247 | */ | |
3248 | if (rq->in_nohz_recently && !rq->idle_at_tick) { | |
3249 | rq->in_nohz_recently = 0; | |
3250 | ||
3251 | if (atomic_read(&nohz.load_balancer) == cpu) { | |
3252 | cpu_clear(cpu, nohz.cpu_mask); | |
3253 | atomic_set(&nohz.load_balancer, -1); | |
3254 | } | |
3255 | ||
3256 | if (atomic_read(&nohz.load_balancer) == -1) { | |
3257 | /* | |
3258 | * simple selection for now: Nominate the | |
3259 | * first cpu in the nohz list to be the next | |
3260 | * ilb owner. | |
3261 | * | |
3262 | * TBD: Traverse the sched domains and nominate | |
3263 | * the nearest cpu in the nohz.cpu_mask. | |
3264 | */ | |
3265 | int ilb = first_cpu(nohz.cpu_mask); | |
3266 | ||
3267 | if (ilb != NR_CPUS) | |
3268 | resched_cpu(ilb); | |
3269 | } | |
3270 | } | |
3271 | ||
3272 | /* | |
3273 | * If this cpu is idle and doing idle load balancing for all the | |
3274 | * cpus with ticks stopped, is it time for that to stop? | |
3275 | */ | |
3276 | if (rq->idle_at_tick && atomic_read(&nohz.load_balancer) == cpu && | |
3277 | cpus_weight(nohz.cpu_mask) == num_online_cpus()) { | |
3278 | resched_cpu(cpu); | |
3279 | return; | |
3280 | } | |
3281 | ||
3282 | /* | |
3283 | * If this cpu is idle and the idle load balancing is done by | |
3284 | * someone else, then no need raise the SCHED_SOFTIRQ | |
3285 | */ | |
3286 | if (rq->idle_at_tick && atomic_read(&nohz.load_balancer) != cpu && | |
3287 | cpu_isset(cpu, nohz.cpu_mask)) | |
3288 | return; | |
3289 | #endif | |
3290 | if (time_after_eq(jiffies, rq->next_balance)) | |
3291 | raise_softirq(SCHED_SOFTIRQ); | |
1da177e4 | 3292 | } |
dd41f596 IM |
3293 | |
3294 | #else /* CONFIG_SMP */ | |
3295 | ||
1da177e4 LT |
3296 | /* |
3297 | * on UP we do not need to balance between CPUs: | |
3298 | */ | |
70b97a7f | 3299 | static inline void idle_balance(int cpu, struct rq *rq) |
1da177e4 LT |
3300 | { |
3301 | } | |
dd41f596 | 3302 | |
1da177e4 LT |
3303 | #endif |
3304 | ||
1da177e4 LT |
3305 | DEFINE_PER_CPU(struct kernel_stat, kstat); |
3306 | ||
3307 | EXPORT_PER_CPU_SYMBOL(kstat); | |
3308 | ||
3309 | /* | |
41b86e9c IM |
3310 | * Return p->sum_exec_runtime plus any more ns on the sched_clock |
3311 | * that have not yet been banked in case the task is currently running. | |
1da177e4 | 3312 | */ |
41b86e9c | 3313 | unsigned long long task_sched_runtime(struct task_struct *p) |
1da177e4 | 3314 | { |
1da177e4 | 3315 | unsigned long flags; |
41b86e9c IM |
3316 | u64 ns, delta_exec; |
3317 | struct rq *rq; | |
48f24c4d | 3318 | |
41b86e9c IM |
3319 | rq = task_rq_lock(p, &flags); |
3320 | ns = p->se.sum_exec_runtime; | |
3321 | if (rq->curr == p) { | |
a8e504d2 IM |
3322 | update_rq_clock(rq); |
3323 | delta_exec = rq->clock - p->se.exec_start; | |
41b86e9c IM |
3324 | if ((s64)delta_exec > 0) |
3325 | ns += delta_exec; | |
3326 | } | |
3327 | task_rq_unlock(rq, &flags); | |
48f24c4d | 3328 | |
1da177e4 LT |
3329 | return ns; |
3330 | } | |
3331 | ||
1da177e4 LT |
3332 | /* |
3333 | * Account user cpu time to a process. | |
3334 | * @p: the process that the cpu time gets accounted to | |
1da177e4 LT |
3335 | * @cputime: the cpu time spent in user space since the last update |
3336 | */ | |
3337 | void account_user_time(struct task_struct *p, cputime_t cputime) | |
3338 | { | |
3339 | struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat; | |
3340 | cputime64_t tmp; | |
62d0df64 | 3341 | struct rq *rq = this_rq(); |
1da177e4 LT |
3342 | |
3343 | p->utime = cputime_add(p->utime, cputime); | |
3344 | ||
62d0df64 PM |
3345 | if (p != rq->idle) |
3346 | cpuacct_charge(p, cputime); | |
3347 | ||
1da177e4 LT |
3348 | /* Add user time to cpustat. */ |
3349 | tmp = cputime_to_cputime64(cputime); | |
3350 | if (TASK_NICE(p) > 0) | |
3351 | cpustat->nice = cputime64_add(cpustat->nice, tmp); | |
3352 | else | |
3353 | cpustat->user = cputime64_add(cpustat->user, tmp); | |
3354 | } | |
3355 | ||
94886b84 LV |
3356 | /* |
3357 | * Account guest cpu time to a process. | |
3358 | * @p: the process that the cpu time gets accounted to | |
3359 | * @cputime: the cpu time spent in virtual machine since the last update | |
3360 | */ | |
f7402e03 | 3361 | static void account_guest_time(struct task_struct *p, cputime_t cputime) |
94886b84 LV |
3362 | { |
3363 | cputime64_t tmp; | |
3364 | struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat; | |
3365 | ||
3366 | tmp = cputime_to_cputime64(cputime); | |
3367 | ||
3368 | p->utime = cputime_add(p->utime, cputime); | |
3369 | p->gtime = cputime_add(p->gtime, cputime); | |
3370 | ||
3371 | cpustat->user = cputime64_add(cpustat->user, tmp); | |
3372 | cpustat->guest = cputime64_add(cpustat->guest, tmp); | |
3373 | } | |
3374 | ||
c66f08be MN |
3375 | /* |
3376 | * Account scaled user cpu time to a process. | |
3377 | * @p: the process that the cpu time gets accounted to | |
3378 | * @cputime: the cpu time spent in user space since the last update | |
3379 | */ | |
3380 | void account_user_time_scaled(struct task_struct *p, cputime_t cputime) | |
3381 | { | |
3382 | p->utimescaled = cputime_add(p->utimescaled, cputime); | |
3383 | } | |
3384 | ||
1da177e4 LT |
3385 | /* |
3386 | * Account system cpu time to a process. | |
3387 | * @p: the process that the cpu time gets accounted to | |
3388 | * @hardirq_offset: the offset to subtract from hardirq_count() | |
3389 | * @cputime: the cpu time spent in kernel space since the last update | |
3390 | */ | |
3391 | void account_system_time(struct task_struct *p, int hardirq_offset, | |
3392 | cputime_t cputime) | |
3393 | { | |
3394 | struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat; | |
70b97a7f | 3395 | struct rq *rq = this_rq(); |
1da177e4 LT |
3396 | cputime64_t tmp; |
3397 | ||
94886b84 LV |
3398 | if (p->flags & PF_VCPU) { |
3399 | account_guest_time(p, cputime); | |
94886b84 LV |
3400 | return; |
3401 | } | |
3402 | ||
1da177e4 LT |
3403 | p->stime = cputime_add(p->stime, cputime); |
3404 | ||
3405 | /* Add system time to cpustat. */ | |
3406 | tmp = cputime_to_cputime64(cputime); | |
3407 | if (hardirq_count() - hardirq_offset) | |
3408 | cpustat->irq = cputime64_add(cpustat->irq, tmp); | |
3409 | else if (softirq_count()) | |
3410 | cpustat->softirq = cputime64_add(cpustat->softirq, tmp); | |
62d0df64 | 3411 | else if (p != rq->idle) { |
1da177e4 | 3412 | cpustat->system = cputime64_add(cpustat->system, tmp); |
62d0df64 PM |
3413 | cpuacct_charge(p, cputime); |
3414 | } else if (atomic_read(&rq->nr_iowait) > 0) | |
1da177e4 LT |
3415 | cpustat->iowait = cputime64_add(cpustat->iowait, tmp); |
3416 | else | |
3417 | cpustat->idle = cputime64_add(cpustat->idle, tmp); | |
3418 | /* Account for system time used */ | |
3419 | acct_update_integrals(p); | |
1da177e4 LT |
3420 | } |
3421 | ||
c66f08be MN |
3422 | /* |
3423 | * Account scaled system cpu time to a process. | |
3424 | * @p: the process that the cpu time gets accounted to | |
3425 | * @hardirq_offset: the offset to subtract from hardirq_count() | |
3426 | * @cputime: the cpu time spent in kernel space since the last update | |
3427 | */ | |
3428 | void account_system_time_scaled(struct task_struct *p, cputime_t cputime) | |
3429 | { | |
3430 | p->stimescaled = cputime_add(p->stimescaled, cputime); | |
3431 | } | |
3432 | ||
1da177e4 LT |
3433 | /* |
3434 | * Account for involuntary wait time. | |
3435 | * @p: the process from which the cpu time has been stolen | |
3436 | * @steal: the cpu time spent in involuntary wait | |
3437 | */ | |
3438 | void account_steal_time(struct task_struct *p, cputime_t steal) | |
3439 | { | |
3440 | struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat; | |
3441 | cputime64_t tmp = cputime_to_cputime64(steal); | |
70b97a7f | 3442 | struct rq *rq = this_rq(); |
1da177e4 LT |
3443 | |
3444 | if (p == rq->idle) { | |
3445 | p->stime = cputime_add(p->stime, steal); | |
3446 | if (atomic_read(&rq->nr_iowait) > 0) | |
3447 | cpustat->iowait = cputime64_add(cpustat->iowait, tmp); | |
3448 | else | |
3449 | cpustat->idle = cputime64_add(cpustat->idle, tmp); | |
62d0df64 | 3450 | } else { |
1da177e4 | 3451 | cpustat->steal = cputime64_add(cpustat->steal, tmp); |
62d0df64 PM |
3452 | cpuacct_charge(p, -tmp); |
3453 | } | |
1da177e4 LT |
3454 | } |
3455 | ||
7835b98b CL |
3456 | /* |
3457 | * This function gets called by the timer code, with HZ frequency. | |
3458 | * We call it with interrupts disabled. | |
3459 | * | |
3460 | * It also gets called by the fork code, when changing the parent's | |
3461 | * timeslices. | |
3462 | */ | |
3463 | void scheduler_tick(void) | |
3464 | { | |
7835b98b CL |
3465 | int cpu = smp_processor_id(); |
3466 | struct rq *rq = cpu_rq(cpu); | |
dd41f596 | 3467 | struct task_struct *curr = rq->curr; |
529c7726 | 3468 | u64 next_tick = rq->tick_timestamp + TICK_NSEC; |
dd41f596 IM |
3469 | |
3470 | spin_lock(&rq->lock); | |
546fe3c9 | 3471 | __update_rq_clock(rq); |
529c7726 IM |
3472 | /* |
3473 | * Let rq->clock advance by at least TICK_NSEC: | |
3474 | */ | |
3475 | if (unlikely(rq->clock < next_tick)) | |
3476 | rq->clock = next_tick; | |
3477 | rq->tick_timestamp = rq->clock; | |
f1a438d8 | 3478 | update_cpu_load(rq); |
dd41f596 IM |
3479 | if (curr != rq->idle) /* FIXME: needed? */ |
3480 | curr->sched_class->task_tick(rq, curr); | |
dd41f596 | 3481 | spin_unlock(&rq->lock); |
7835b98b | 3482 | |
e418e1c2 | 3483 | #ifdef CONFIG_SMP |
dd41f596 IM |
3484 | rq->idle_at_tick = idle_cpu(cpu); |
3485 | trigger_load_balance(rq, cpu); | |
e418e1c2 | 3486 | #endif |
1da177e4 LT |
3487 | } |
3488 | ||
1da177e4 LT |
3489 | #if defined(CONFIG_PREEMPT) && defined(CONFIG_DEBUG_PREEMPT) |
3490 | ||
3491 | void fastcall add_preempt_count(int val) | |
3492 | { | |
3493 | /* | |
3494 | * Underflow? | |
3495 | */ | |
9a11b49a IM |
3496 | if (DEBUG_LOCKS_WARN_ON((preempt_count() < 0))) |
3497 | return; | |
1da177e4 LT |
3498 | preempt_count() += val; |
3499 | /* | |
3500 | * Spinlock count overflowing soon? | |
3501 | */ | |
33859f7f MOS |
3502 | DEBUG_LOCKS_WARN_ON((preempt_count() & PREEMPT_MASK) >= |
3503 | PREEMPT_MASK - 10); | |
1da177e4 LT |
3504 | } |
3505 | EXPORT_SYMBOL(add_preempt_count); | |
3506 | ||
3507 | void fastcall sub_preempt_count(int val) | |
3508 | { | |
3509 | /* | |
3510 | * Underflow? | |
3511 | */ | |
9a11b49a IM |
3512 | if (DEBUG_LOCKS_WARN_ON(val > preempt_count())) |
3513 | return; | |
1da177e4 LT |
3514 | /* |
3515 | * Is the spinlock portion underflowing? | |
3516 | */ | |
9a11b49a IM |
3517 | if (DEBUG_LOCKS_WARN_ON((val < PREEMPT_MASK) && |
3518 | !(preempt_count() & PREEMPT_MASK))) | |
3519 | return; | |
3520 | ||
1da177e4 LT |
3521 | preempt_count() -= val; |
3522 | } | |
3523 | EXPORT_SYMBOL(sub_preempt_count); | |
3524 | ||
3525 | #endif | |
3526 | ||
3527 | /* | |
dd41f596 | 3528 | * Print scheduling while atomic bug: |
1da177e4 | 3529 | */ |
dd41f596 | 3530 | static noinline void __schedule_bug(struct task_struct *prev) |
1da177e4 | 3531 | { |
838225b4 SS |
3532 | struct pt_regs *regs = get_irq_regs(); |
3533 | ||
3534 | printk(KERN_ERR "BUG: scheduling while atomic: %s/%d/0x%08x\n", | |
3535 | prev->comm, prev->pid, preempt_count()); | |
3536 | ||
dd41f596 IM |
3537 | debug_show_held_locks(prev); |
3538 | if (irqs_disabled()) | |
3539 | print_irqtrace_events(prev); | |
838225b4 SS |
3540 | |
3541 | if (regs) | |
3542 | show_regs(regs); | |
3543 | else | |
3544 | dump_stack(); | |
dd41f596 | 3545 | } |
1da177e4 | 3546 | |
dd41f596 IM |
3547 | /* |
3548 | * Various schedule()-time debugging checks and statistics: | |
3549 | */ | |
3550 | static inline void schedule_debug(struct task_struct *prev) | |
3551 | { | |
1da177e4 LT |
3552 | /* |
3553 | * Test if we are atomic. Since do_exit() needs to call into | |
3554 | * schedule() atomically, we ignore that path for now. | |
3555 | * Otherwise, whine if we are scheduling when we should not be. | |
3556 | */ | |
dd41f596 IM |
3557 | if (unlikely(in_atomic_preempt_off()) && unlikely(!prev->exit_state)) |
3558 | __schedule_bug(prev); | |
3559 | ||
1da177e4 LT |
3560 | profile_hit(SCHED_PROFILING, __builtin_return_address(0)); |
3561 | ||
2d72376b | 3562 | schedstat_inc(this_rq(), sched_count); |
b8efb561 IM |
3563 | #ifdef CONFIG_SCHEDSTATS |
3564 | if (unlikely(prev->lock_depth >= 0)) { | |
2d72376b IM |
3565 | schedstat_inc(this_rq(), bkl_count); |
3566 | schedstat_inc(prev, sched_info.bkl_count); | |
b8efb561 IM |
3567 | } |
3568 | #endif | |
dd41f596 IM |
3569 | } |
3570 | ||
3571 | /* | |
3572 | * Pick up the highest-prio task: | |
3573 | */ | |
3574 | static inline struct task_struct * | |
ff95f3df | 3575 | pick_next_task(struct rq *rq, struct task_struct *prev) |
dd41f596 | 3576 | { |
5522d5d5 | 3577 | const struct sched_class *class; |
dd41f596 | 3578 | struct task_struct *p; |
1da177e4 LT |
3579 | |
3580 | /* | |
dd41f596 IM |
3581 | * Optimization: we know that if all tasks are in |
3582 | * the fair class we can call that function directly: | |
1da177e4 | 3583 | */ |
dd41f596 | 3584 | if (likely(rq->nr_running == rq->cfs.nr_running)) { |
fb8d4724 | 3585 | p = fair_sched_class.pick_next_task(rq); |
dd41f596 IM |
3586 | if (likely(p)) |
3587 | return p; | |
1da177e4 LT |
3588 | } |
3589 | ||
dd41f596 IM |
3590 | class = sched_class_highest; |
3591 | for ( ; ; ) { | |
fb8d4724 | 3592 | p = class->pick_next_task(rq); |
dd41f596 IM |
3593 | if (p) |
3594 | return p; | |
3595 | /* | |
3596 | * Will never be NULL as the idle class always | |
3597 | * returns a non-NULL p: | |
3598 | */ | |
3599 | class = class->next; | |
3600 | } | |
3601 | } | |
1da177e4 | 3602 | |
dd41f596 IM |
3603 | /* |
3604 | * schedule() is the main scheduler function. | |
3605 | */ | |
3606 | asmlinkage void __sched schedule(void) | |
3607 | { | |
3608 | struct task_struct *prev, *next; | |
3609 | long *switch_count; | |
3610 | struct rq *rq; | |
dd41f596 IM |
3611 | int cpu; |
3612 | ||
3613 | need_resched: | |
3614 | preempt_disable(); | |
3615 | cpu = smp_processor_id(); | |
3616 | rq = cpu_rq(cpu); | |
3617 | rcu_qsctr_inc(cpu); | |
3618 | prev = rq->curr; | |
3619 | switch_count = &prev->nivcsw; | |
3620 | ||
3621 | release_kernel_lock(prev); | |
3622 | need_resched_nonpreemptible: | |
3623 | ||
3624 | schedule_debug(prev); | |
1da177e4 | 3625 | |
1e819950 IM |
3626 | /* |
3627 | * Do the rq-clock update outside the rq lock: | |
3628 | */ | |
3629 | local_irq_disable(); | |
c1b3da3e | 3630 | __update_rq_clock(rq); |
1e819950 IM |
3631 | spin_lock(&rq->lock); |
3632 | clear_tsk_need_resched(prev); | |
1da177e4 | 3633 | |
1da177e4 | 3634 | if (prev->state && !(preempt_count() & PREEMPT_ACTIVE)) { |
1da177e4 | 3635 | if (unlikely((prev->state & TASK_INTERRUPTIBLE) && |
dd41f596 | 3636 | unlikely(signal_pending(prev)))) { |
1da177e4 | 3637 | prev->state = TASK_RUNNING; |
dd41f596 | 3638 | } else { |
2e1cb74a | 3639 | deactivate_task(rq, prev, 1); |
1da177e4 | 3640 | } |
dd41f596 | 3641 | switch_count = &prev->nvcsw; |
1da177e4 LT |
3642 | } |
3643 | ||
dd41f596 | 3644 | if (unlikely(!rq->nr_running)) |
1da177e4 | 3645 | idle_balance(cpu, rq); |
1da177e4 | 3646 | |
31ee529c | 3647 | prev->sched_class->put_prev_task(rq, prev); |
ff95f3df | 3648 | next = pick_next_task(rq, prev); |
1da177e4 LT |
3649 | |
3650 | sched_info_switch(prev, next); | |
dd41f596 | 3651 | |
1da177e4 | 3652 | if (likely(prev != next)) { |
1da177e4 LT |
3653 | rq->nr_switches++; |
3654 | rq->curr = next; | |
3655 | ++*switch_count; | |
3656 | ||
dd41f596 | 3657 | context_switch(rq, prev, next); /* unlocks the rq */ |
1da177e4 LT |
3658 | } else |
3659 | spin_unlock_irq(&rq->lock); | |
3660 | ||
dd41f596 IM |
3661 | if (unlikely(reacquire_kernel_lock(current) < 0)) { |
3662 | cpu = smp_processor_id(); | |
3663 | rq = cpu_rq(cpu); | |
1da177e4 | 3664 | goto need_resched_nonpreemptible; |
dd41f596 | 3665 | } |
1da177e4 LT |
3666 | preempt_enable_no_resched(); |
3667 | if (unlikely(test_thread_flag(TIF_NEED_RESCHED))) | |
3668 | goto need_resched; | |
3669 | } | |
1da177e4 LT |
3670 | EXPORT_SYMBOL(schedule); |
3671 | ||
3672 | #ifdef CONFIG_PREEMPT | |
3673 | /* | |
2ed6e34f | 3674 | * this is the entry point to schedule() from in-kernel preemption |
1da177e4 LT |
3675 | * off of preempt_enable. Kernel preemptions off return from interrupt |
3676 | * occur there and call schedule directly. | |
3677 | */ | |
3678 | asmlinkage void __sched preempt_schedule(void) | |
3679 | { | |
3680 | struct thread_info *ti = current_thread_info(); | |
3681 | #ifdef CONFIG_PREEMPT_BKL | |
3682 | struct task_struct *task = current; | |
3683 | int saved_lock_depth; | |
3684 | #endif | |
3685 | /* | |
3686 | * If there is a non-zero preempt_count or interrupts are disabled, | |
3687 | * we do not want to preempt the current task. Just return.. | |
3688 | */ | |
beed33a8 | 3689 | if (likely(ti->preempt_count || irqs_disabled())) |
1da177e4 LT |
3690 | return; |
3691 | ||
3a5c359a AK |
3692 | do { |
3693 | add_preempt_count(PREEMPT_ACTIVE); | |
3694 | ||
3695 | /* | |
3696 | * We keep the big kernel semaphore locked, but we | |
3697 | * clear ->lock_depth so that schedule() doesnt | |
3698 | * auto-release the semaphore: | |
3699 | */ | |
1da177e4 | 3700 | #ifdef CONFIG_PREEMPT_BKL |
3a5c359a AK |
3701 | saved_lock_depth = task->lock_depth; |
3702 | task->lock_depth = -1; | |
1da177e4 | 3703 | #endif |
3a5c359a | 3704 | schedule(); |
1da177e4 | 3705 | #ifdef CONFIG_PREEMPT_BKL |
3a5c359a | 3706 | task->lock_depth = saved_lock_depth; |
1da177e4 | 3707 | #endif |
3a5c359a | 3708 | sub_preempt_count(PREEMPT_ACTIVE); |
1da177e4 | 3709 | |
3a5c359a AK |
3710 | /* |
3711 | * Check again in case we missed a preemption opportunity | |
3712 | * between schedule and now. | |
3713 | */ | |
3714 | barrier(); | |
3715 | } while (unlikely(test_thread_flag(TIF_NEED_RESCHED))); | |
1da177e4 | 3716 | } |
1da177e4 LT |
3717 | EXPORT_SYMBOL(preempt_schedule); |
3718 | ||
3719 | /* | |
2ed6e34f | 3720 | * this is the entry point to schedule() from kernel preemption |
1da177e4 LT |
3721 | * off of irq context. |
3722 | * Note, that this is called and return with irqs disabled. This will | |
3723 | * protect us against recursive calling from irq. | |
3724 | */ | |
3725 | asmlinkage void __sched preempt_schedule_irq(void) | |
3726 | { | |
3727 | struct thread_info *ti = current_thread_info(); | |
3728 | #ifdef CONFIG_PREEMPT_BKL | |
3729 | struct task_struct *task = current; | |
3730 | int saved_lock_depth; | |
3731 | #endif | |
2ed6e34f | 3732 | /* Catch callers which need to be fixed */ |
1da177e4 LT |
3733 | BUG_ON(ti->preempt_count || !irqs_disabled()); |
3734 | ||
3a5c359a AK |
3735 | do { |
3736 | add_preempt_count(PREEMPT_ACTIVE); | |
3737 | ||
3738 | /* | |
3739 | * We keep the big kernel semaphore locked, but we | |
3740 | * clear ->lock_depth so that schedule() doesnt | |
3741 | * auto-release the semaphore: | |
3742 | */ | |
1da177e4 | 3743 | #ifdef CONFIG_PREEMPT_BKL |
3a5c359a AK |
3744 | saved_lock_depth = task->lock_depth; |
3745 | task->lock_depth = -1; | |
1da177e4 | 3746 | #endif |
3a5c359a AK |
3747 | local_irq_enable(); |
3748 | schedule(); | |
3749 | local_irq_disable(); | |
1da177e4 | 3750 | #ifdef CONFIG_PREEMPT_BKL |
3a5c359a | 3751 | task->lock_depth = saved_lock_depth; |
1da177e4 | 3752 | #endif |
3a5c359a | 3753 | sub_preempt_count(PREEMPT_ACTIVE); |
1da177e4 | 3754 | |
3a5c359a AK |
3755 | /* |
3756 | * Check again in case we missed a preemption opportunity | |
3757 | * between schedule and now. | |
3758 | */ | |
3759 | barrier(); | |
3760 | } while (unlikely(test_thread_flag(TIF_NEED_RESCHED))); | |
1da177e4 LT |
3761 | } |
3762 | ||
3763 | #endif /* CONFIG_PREEMPT */ | |
3764 | ||
95cdf3b7 IM |
3765 | int default_wake_function(wait_queue_t *curr, unsigned mode, int sync, |
3766 | void *key) | |
1da177e4 | 3767 | { |
48f24c4d | 3768 | return try_to_wake_up(curr->private, mode, sync); |
1da177e4 | 3769 | } |
1da177e4 LT |
3770 | EXPORT_SYMBOL(default_wake_function); |
3771 | ||
3772 | /* | |
3773 | * The core wakeup function. Non-exclusive wakeups (nr_exclusive == 0) just | |
3774 | * wake everything up. If it's an exclusive wakeup (nr_exclusive == small +ve | |
3775 | * number) then we wake all the non-exclusive tasks and one exclusive task. | |
3776 | * | |
3777 | * There are circumstances in which we can try to wake a task which has already | |
3778 | * started to run but is not in state TASK_RUNNING. try_to_wake_up() returns | |
3779 | * zero in this (rare) case, and we handle it by continuing to scan the queue. | |
3780 | */ | |
3781 | static void __wake_up_common(wait_queue_head_t *q, unsigned int mode, | |
3782 | int nr_exclusive, int sync, void *key) | |
3783 | { | |
2e45874c | 3784 | wait_queue_t *curr, *next; |
1da177e4 | 3785 | |
2e45874c | 3786 | list_for_each_entry_safe(curr, next, &q->task_list, task_list) { |
48f24c4d IM |
3787 | unsigned flags = curr->flags; |
3788 | ||
1da177e4 | 3789 | if (curr->func(curr, mode, sync, key) && |
48f24c4d | 3790 | (flags & WQ_FLAG_EXCLUSIVE) && !--nr_exclusive) |
1da177e4 LT |
3791 | break; |
3792 | } | |
3793 | } | |
3794 | ||
3795 | /** | |
3796 | * __wake_up - wake up threads blocked on a waitqueue. | |
3797 | * @q: the waitqueue | |
3798 | * @mode: which threads | |
3799 | * @nr_exclusive: how many wake-one or wake-many threads to wake up | |
67be2dd1 | 3800 | * @key: is directly passed to the wakeup function |
1da177e4 LT |
3801 | */ |
3802 | void fastcall __wake_up(wait_queue_head_t *q, unsigned int mode, | |
95cdf3b7 | 3803 | int nr_exclusive, void *key) |
1da177e4 LT |
3804 | { |
3805 | unsigned long flags; | |
3806 | ||
3807 | spin_lock_irqsave(&q->lock, flags); | |
3808 | __wake_up_common(q, mode, nr_exclusive, 0, key); | |
3809 | spin_unlock_irqrestore(&q->lock, flags); | |
3810 | } | |
1da177e4 LT |
3811 | EXPORT_SYMBOL(__wake_up); |
3812 | ||
3813 | /* | |
3814 | * Same as __wake_up but called with the spinlock in wait_queue_head_t held. | |
3815 | */ | |
3816 | void fastcall __wake_up_locked(wait_queue_head_t *q, unsigned int mode) | |
3817 | { | |
3818 | __wake_up_common(q, mode, 1, 0, NULL); | |
3819 | } | |
3820 | ||
3821 | /** | |
67be2dd1 | 3822 | * __wake_up_sync - wake up threads blocked on a waitqueue. |
1da177e4 LT |
3823 | * @q: the waitqueue |
3824 | * @mode: which threads | |
3825 | * @nr_exclusive: how many wake-one or wake-many threads to wake up | |
3826 | * | |
3827 | * The sync wakeup differs that the waker knows that it will schedule | |
3828 | * away soon, so while the target thread will be woken up, it will not | |
3829 | * be migrated to another CPU - ie. the two threads are 'synchronized' | |
3830 | * with each other. This can prevent needless bouncing between CPUs. | |
3831 | * | |
3832 | * On UP it can prevent extra preemption. | |
3833 | */ | |
95cdf3b7 IM |
3834 | void fastcall |
3835 | __wake_up_sync(wait_queue_head_t *q, unsigned int mode, int nr_exclusive) | |
1da177e4 LT |
3836 | { |
3837 | unsigned long flags; | |
3838 | int sync = 1; | |
3839 | ||
3840 | if (unlikely(!q)) | |
3841 | return; | |
3842 | ||
3843 | if (unlikely(!nr_exclusive)) | |
3844 | sync = 0; | |
3845 | ||
3846 | spin_lock_irqsave(&q->lock, flags); | |
3847 | __wake_up_common(q, mode, nr_exclusive, sync, NULL); | |
3848 | spin_unlock_irqrestore(&q->lock, flags); | |
3849 | } | |
3850 | EXPORT_SYMBOL_GPL(__wake_up_sync); /* For internal use only */ | |
3851 | ||
b15136e9 | 3852 | void complete(struct completion *x) |
1da177e4 LT |
3853 | { |
3854 | unsigned long flags; | |
3855 | ||
3856 | spin_lock_irqsave(&x->wait.lock, flags); | |
3857 | x->done++; | |
3858 | __wake_up_common(&x->wait, TASK_UNINTERRUPTIBLE | TASK_INTERRUPTIBLE, | |
3859 | 1, 0, NULL); | |
3860 | spin_unlock_irqrestore(&x->wait.lock, flags); | |
3861 | } | |
3862 | EXPORT_SYMBOL(complete); | |
3863 | ||
b15136e9 | 3864 | void complete_all(struct completion *x) |
1da177e4 LT |
3865 | { |
3866 | unsigned long flags; | |
3867 | ||
3868 | spin_lock_irqsave(&x->wait.lock, flags); | |
3869 | x->done += UINT_MAX/2; | |
3870 | __wake_up_common(&x->wait, TASK_UNINTERRUPTIBLE | TASK_INTERRUPTIBLE, | |
3871 | 0, 0, NULL); | |
3872 | spin_unlock_irqrestore(&x->wait.lock, flags); | |
3873 | } | |
3874 | EXPORT_SYMBOL(complete_all); | |
3875 | ||
8cbbe86d AK |
3876 | static inline long __sched |
3877 | do_wait_for_common(struct completion *x, long timeout, int state) | |
1da177e4 | 3878 | { |
1da177e4 LT |
3879 | if (!x->done) { |
3880 | DECLARE_WAITQUEUE(wait, current); | |
3881 | ||
3882 | wait.flags |= WQ_FLAG_EXCLUSIVE; | |
3883 | __add_wait_queue_tail(&x->wait, &wait); | |
3884 | do { | |
8cbbe86d AK |
3885 | if (state == TASK_INTERRUPTIBLE && |
3886 | signal_pending(current)) { | |
3887 | __remove_wait_queue(&x->wait, &wait); | |
3888 | return -ERESTARTSYS; | |
3889 | } | |
3890 | __set_current_state(state); | |
1da177e4 LT |
3891 | spin_unlock_irq(&x->wait.lock); |
3892 | timeout = schedule_timeout(timeout); | |
3893 | spin_lock_irq(&x->wait.lock); | |
3894 | if (!timeout) { | |
3895 | __remove_wait_queue(&x->wait, &wait); | |
8cbbe86d | 3896 | return timeout; |
1da177e4 LT |
3897 | } |
3898 | } while (!x->done); | |
3899 | __remove_wait_queue(&x->wait, &wait); | |
3900 | } | |
3901 | x->done--; | |
1da177e4 LT |
3902 | return timeout; |
3903 | } | |
1da177e4 | 3904 | |
8cbbe86d AK |
3905 | static long __sched |
3906 | wait_for_common(struct completion *x, long timeout, int state) | |
1da177e4 | 3907 | { |
1da177e4 LT |
3908 | might_sleep(); |
3909 | ||
3910 | spin_lock_irq(&x->wait.lock); | |
8cbbe86d | 3911 | timeout = do_wait_for_common(x, timeout, state); |
1da177e4 | 3912 | spin_unlock_irq(&x->wait.lock); |
8cbbe86d AK |
3913 | return timeout; |
3914 | } | |
1da177e4 | 3915 | |
b15136e9 | 3916 | void __sched wait_for_completion(struct completion *x) |
8cbbe86d AK |
3917 | { |
3918 | wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_UNINTERRUPTIBLE); | |
1da177e4 | 3919 | } |
8cbbe86d | 3920 | EXPORT_SYMBOL(wait_for_completion); |
1da177e4 | 3921 | |
b15136e9 | 3922 | unsigned long __sched |
8cbbe86d | 3923 | wait_for_completion_timeout(struct completion *x, unsigned long timeout) |
1da177e4 | 3924 | { |
8cbbe86d | 3925 | return wait_for_common(x, timeout, TASK_UNINTERRUPTIBLE); |
1da177e4 | 3926 | } |
8cbbe86d | 3927 | EXPORT_SYMBOL(wait_for_completion_timeout); |
1da177e4 | 3928 | |
8cbbe86d | 3929 | int __sched wait_for_completion_interruptible(struct completion *x) |
0fec171c | 3930 | { |
51e97990 AK |
3931 | long t = wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_INTERRUPTIBLE); |
3932 | if (t == -ERESTARTSYS) | |
3933 | return t; | |
3934 | return 0; | |
0fec171c | 3935 | } |
8cbbe86d | 3936 | EXPORT_SYMBOL(wait_for_completion_interruptible); |
1da177e4 | 3937 | |
b15136e9 | 3938 | unsigned long __sched |
8cbbe86d AK |
3939 | wait_for_completion_interruptible_timeout(struct completion *x, |
3940 | unsigned long timeout) | |
0fec171c | 3941 | { |
8cbbe86d | 3942 | return wait_for_common(x, timeout, TASK_INTERRUPTIBLE); |
0fec171c | 3943 | } |
8cbbe86d | 3944 | EXPORT_SYMBOL(wait_for_completion_interruptible_timeout); |
1da177e4 | 3945 | |
8cbbe86d AK |
3946 | static long __sched |
3947 | sleep_on_common(wait_queue_head_t *q, int state, long timeout) | |
1da177e4 | 3948 | { |
0fec171c IM |
3949 | unsigned long flags; |
3950 | wait_queue_t wait; | |
3951 | ||
3952 | init_waitqueue_entry(&wait, current); | |
1da177e4 | 3953 | |
8cbbe86d | 3954 | __set_current_state(state); |
1da177e4 | 3955 | |
8cbbe86d AK |
3956 | spin_lock_irqsave(&q->lock, flags); |
3957 | __add_wait_queue(q, &wait); | |
3958 | spin_unlock(&q->lock); | |
3959 | timeout = schedule_timeout(timeout); | |
3960 | spin_lock_irq(&q->lock); | |
3961 | __remove_wait_queue(q, &wait); | |
3962 | spin_unlock_irqrestore(&q->lock, flags); | |
3963 | ||
3964 | return timeout; | |
3965 | } | |
3966 | ||
3967 | void __sched interruptible_sleep_on(wait_queue_head_t *q) | |
3968 | { | |
3969 | sleep_on_common(q, TASK_INTERRUPTIBLE, MAX_SCHEDULE_TIMEOUT); | |
1da177e4 | 3970 | } |
1da177e4 LT |
3971 | EXPORT_SYMBOL(interruptible_sleep_on); |
3972 | ||
0fec171c | 3973 | long __sched |
95cdf3b7 | 3974 | interruptible_sleep_on_timeout(wait_queue_head_t *q, long timeout) |
1da177e4 | 3975 | { |
8cbbe86d | 3976 | return sleep_on_common(q, TASK_INTERRUPTIBLE, timeout); |
1da177e4 | 3977 | } |
1da177e4 LT |
3978 | EXPORT_SYMBOL(interruptible_sleep_on_timeout); |
3979 | ||
0fec171c | 3980 | void __sched sleep_on(wait_queue_head_t *q) |
1da177e4 | 3981 | { |
8cbbe86d | 3982 | sleep_on_common(q, TASK_UNINTERRUPTIBLE, MAX_SCHEDULE_TIMEOUT); |
1da177e4 | 3983 | } |
1da177e4 LT |
3984 | EXPORT_SYMBOL(sleep_on); |
3985 | ||
0fec171c | 3986 | long __sched sleep_on_timeout(wait_queue_head_t *q, long timeout) |
1da177e4 | 3987 | { |
8cbbe86d | 3988 | return sleep_on_common(q, TASK_UNINTERRUPTIBLE, timeout); |
1da177e4 | 3989 | } |
1da177e4 LT |
3990 | EXPORT_SYMBOL(sleep_on_timeout); |
3991 | ||
b29739f9 IM |
3992 | #ifdef CONFIG_RT_MUTEXES |
3993 | ||
3994 | /* | |
3995 | * rt_mutex_setprio - set the current priority of a task | |
3996 | * @p: task | |
3997 | * @prio: prio value (kernel-internal form) | |
3998 | * | |
3999 | * This function changes the 'effective' priority of a task. It does | |
4000 | * not touch ->normal_prio like __setscheduler(). | |
4001 | * | |
4002 | * Used by the rt_mutex code to implement priority inheritance logic. | |
4003 | */ | |
36c8b586 | 4004 | void rt_mutex_setprio(struct task_struct *p, int prio) |
b29739f9 IM |
4005 | { |
4006 | unsigned long flags; | |
83b699ed | 4007 | int oldprio, on_rq, running; |
70b97a7f | 4008 | struct rq *rq; |
b29739f9 IM |
4009 | |
4010 | BUG_ON(prio < 0 || prio > MAX_PRIO); | |
4011 | ||
4012 | rq = task_rq_lock(p, &flags); | |
a8e504d2 | 4013 | update_rq_clock(rq); |
b29739f9 | 4014 | |
d5f9f942 | 4015 | oldprio = p->prio; |
dd41f596 | 4016 | on_rq = p->se.on_rq; |
83b699ed SV |
4017 | running = task_running(rq, p); |
4018 | if (on_rq) { | |
69be72c1 | 4019 | dequeue_task(rq, p, 0); |
83b699ed SV |
4020 | if (running) |
4021 | p->sched_class->put_prev_task(rq, p); | |
4022 | } | |
dd41f596 IM |
4023 | |
4024 | if (rt_prio(prio)) | |
4025 | p->sched_class = &rt_sched_class; | |
4026 | else | |
4027 | p->sched_class = &fair_sched_class; | |
4028 | ||
b29739f9 IM |
4029 | p->prio = prio; |
4030 | ||
dd41f596 | 4031 | if (on_rq) { |
83b699ed SV |
4032 | if (running) |
4033 | p->sched_class->set_curr_task(rq); | |
8159f87e | 4034 | enqueue_task(rq, p, 0); |
b29739f9 IM |
4035 | /* |
4036 | * Reschedule if we are currently running on this runqueue and | |
d5f9f942 AM |
4037 | * our priority decreased, or if we are not currently running on |
4038 | * this runqueue and our priority is higher than the current's | |
b29739f9 | 4039 | */ |
83b699ed | 4040 | if (running) { |
d5f9f942 AM |
4041 | if (p->prio > oldprio) |
4042 | resched_task(rq->curr); | |
dd41f596 IM |
4043 | } else { |
4044 | check_preempt_curr(rq, p); | |
4045 | } | |
b29739f9 IM |
4046 | } |
4047 | task_rq_unlock(rq, &flags); | |
4048 | } | |
4049 | ||
4050 | #endif | |
4051 | ||
36c8b586 | 4052 | void set_user_nice(struct task_struct *p, long nice) |
1da177e4 | 4053 | { |
dd41f596 | 4054 | int old_prio, delta, on_rq; |
1da177e4 | 4055 | unsigned long flags; |
70b97a7f | 4056 | struct rq *rq; |
1da177e4 LT |
4057 | |
4058 | if (TASK_NICE(p) == nice || nice < -20 || nice > 19) | |
4059 | return; | |
4060 | /* | |
4061 | * We have to be careful, if called from sys_setpriority(), | |
4062 | * the task might be in the middle of scheduling on another CPU. | |
4063 | */ | |
4064 | rq = task_rq_lock(p, &flags); | |
a8e504d2 | 4065 | update_rq_clock(rq); |
1da177e4 LT |
4066 | /* |
4067 | * The RT priorities are set via sched_setscheduler(), but we still | |
4068 | * allow the 'normal' nice value to be set - but as expected | |
4069 | * it wont have any effect on scheduling until the task is | |
dd41f596 | 4070 | * SCHED_FIFO/SCHED_RR: |
1da177e4 | 4071 | */ |
e05606d3 | 4072 | if (task_has_rt_policy(p)) { |
1da177e4 LT |
4073 | p->static_prio = NICE_TO_PRIO(nice); |
4074 | goto out_unlock; | |
4075 | } | |
dd41f596 IM |
4076 | on_rq = p->se.on_rq; |
4077 | if (on_rq) { | |
69be72c1 | 4078 | dequeue_task(rq, p, 0); |
79b5dddf | 4079 | dec_load(rq, p); |
2dd73a4f | 4080 | } |
1da177e4 | 4081 | |
1da177e4 | 4082 | p->static_prio = NICE_TO_PRIO(nice); |
2dd73a4f | 4083 | set_load_weight(p); |
b29739f9 IM |
4084 | old_prio = p->prio; |
4085 | p->prio = effective_prio(p); | |
4086 | delta = p->prio - old_prio; | |
1da177e4 | 4087 | |
dd41f596 | 4088 | if (on_rq) { |
8159f87e | 4089 | enqueue_task(rq, p, 0); |
29b4b623 | 4090 | inc_load(rq, p); |
1da177e4 | 4091 | /* |
d5f9f942 AM |
4092 | * If the task increased its priority or is running and |
4093 | * lowered its priority, then reschedule its CPU: | |
1da177e4 | 4094 | */ |
d5f9f942 | 4095 | if (delta < 0 || (delta > 0 && task_running(rq, p))) |
1da177e4 LT |
4096 | resched_task(rq->curr); |
4097 | } | |
4098 | out_unlock: | |
4099 | task_rq_unlock(rq, &flags); | |
4100 | } | |
1da177e4 LT |
4101 | EXPORT_SYMBOL(set_user_nice); |
4102 | ||
e43379f1 MM |
4103 | /* |
4104 | * can_nice - check if a task can reduce its nice value | |
4105 | * @p: task | |
4106 | * @nice: nice value | |
4107 | */ | |
36c8b586 | 4108 | int can_nice(const struct task_struct *p, const int nice) |
e43379f1 | 4109 | { |
024f4747 MM |
4110 | /* convert nice value [19,-20] to rlimit style value [1,40] */ |
4111 | int nice_rlim = 20 - nice; | |
48f24c4d | 4112 | |
e43379f1 MM |
4113 | return (nice_rlim <= p->signal->rlim[RLIMIT_NICE].rlim_cur || |
4114 | capable(CAP_SYS_NICE)); | |
4115 | } | |
4116 | ||
1da177e4 LT |
4117 | #ifdef __ARCH_WANT_SYS_NICE |
4118 | ||
4119 | /* | |
4120 | * sys_nice - change the priority of the current process. | |
4121 | * @increment: priority increment | |
4122 | * | |
4123 | * sys_setpriority is a more generic, but much slower function that | |
4124 | * does similar things. | |
4125 | */ | |
4126 | asmlinkage long sys_nice(int increment) | |
4127 | { | |
48f24c4d | 4128 | long nice, retval; |
1da177e4 LT |
4129 | |
4130 | /* | |
4131 | * Setpriority might change our priority at the same moment. | |
4132 | * We don't have to worry. Conceptually one call occurs first | |
4133 | * and we have a single winner. | |
4134 | */ | |
e43379f1 MM |
4135 | if (increment < -40) |
4136 | increment = -40; | |
1da177e4 LT |
4137 | if (increment > 40) |
4138 | increment = 40; | |
4139 | ||
4140 | nice = PRIO_TO_NICE(current->static_prio) + increment; | |
4141 | if (nice < -20) | |
4142 | nice = -20; | |
4143 | if (nice > 19) | |
4144 | nice = 19; | |
4145 | ||
e43379f1 MM |
4146 | if (increment < 0 && !can_nice(current, nice)) |
4147 | return -EPERM; | |
4148 | ||
1da177e4 LT |
4149 | retval = security_task_setnice(current, nice); |
4150 | if (retval) | |
4151 | return retval; | |
4152 | ||
4153 | set_user_nice(current, nice); | |
4154 | return 0; | |
4155 | } | |
4156 | ||
4157 | #endif | |
4158 | ||
4159 | /** | |
4160 | * task_prio - return the priority value of a given task. | |
4161 | * @p: the task in question. | |
4162 | * | |
4163 | * This is the priority value as seen by users in /proc. | |
4164 | * RT tasks are offset by -200. Normal tasks are centered | |
4165 | * around 0, value goes from -16 to +15. | |
4166 | */ | |
36c8b586 | 4167 | int task_prio(const struct task_struct *p) |
1da177e4 LT |
4168 | { |
4169 | return p->prio - MAX_RT_PRIO; | |
4170 | } | |
4171 | ||
4172 | /** | |
4173 | * task_nice - return the nice value of a given task. | |
4174 | * @p: the task in question. | |
4175 | */ | |
36c8b586 | 4176 | int task_nice(const struct task_struct *p) |
1da177e4 LT |
4177 | { |
4178 | return TASK_NICE(p); | |
4179 | } | |
1da177e4 | 4180 | EXPORT_SYMBOL_GPL(task_nice); |
1da177e4 LT |
4181 | |
4182 | /** | |
4183 | * idle_cpu - is a given cpu idle currently? | |
4184 | * @cpu: the processor in question. | |
4185 | */ | |
4186 | int idle_cpu(int cpu) | |
4187 | { | |
4188 | return cpu_curr(cpu) == cpu_rq(cpu)->idle; | |
4189 | } | |
4190 | ||
1da177e4 LT |
4191 | /** |
4192 | * idle_task - return the idle task for a given cpu. | |
4193 | * @cpu: the processor in question. | |
4194 | */ | |
36c8b586 | 4195 | struct task_struct *idle_task(int cpu) |
1da177e4 LT |
4196 | { |
4197 | return cpu_rq(cpu)->idle; | |
4198 | } | |
4199 | ||
4200 | /** | |
4201 | * find_process_by_pid - find a process with a matching PID value. | |
4202 | * @pid: the pid in question. | |
4203 | */ | |
a9957449 | 4204 | static struct task_struct *find_process_by_pid(pid_t pid) |
1da177e4 | 4205 | { |
228ebcbe | 4206 | return pid ? find_task_by_vpid(pid) : current; |
1da177e4 LT |
4207 | } |
4208 | ||
4209 | /* Actually do priority change: must hold rq lock. */ | |
dd41f596 IM |
4210 | static void |
4211 | __setscheduler(struct rq *rq, struct task_struct *p, int policy, int prio) | |
1da177e4 | 4212 | { |
dd41f596 | 4213 | BUG_ON(p->se.on_rq); |
48f24c4d | 4214 | |
1da177e4 | 4215 | p->policy = policy; |
dd41f596 IM |
4216 | switch (p->policy) { |
4217 | case SCHED_NORMAL: | |
4218 | case SCHED_BATCH: | |
4219 | case SCHED_IDLE: | |
4220 | p->sched_class = &fair_sched_class; | |
4221 | break; | |
4222 | case SCHED_FIFO: | |
4223 | case SCHED_RR: | |
4224 | p->sched_class = &rt_sched_class; | |
4225 | break; | |
4226 | } | |
4227 | ||
1da177e4 | 4228 | p->rt_priority = prio; |
b29739f9 IM |
4229 | p->normal_prio = normal_prio(p); |
4230 | /* we are holding p->pi_lock already */ | |
4231 | p->prio = rt_mutex_getprio(p); | |
2dd73a4f | 4232 | set_load_weight(p); |
1da177e4 LT |
4233 | } |
4234 | ||
4235 | /** | |
72fd4a35 | 4236 | * sched_setscheduler - change the scheduling policy and/or RT priority of a thread. |
1da177e4 LT |
4237 | * @p: the task in question. |
4238 | * @policy: new policy. | |
4239 | * @param: structure containing the new RT priority. | |
5fe1d75f | 4240 | * |
72fd4a35 | 4241 | * NOTE that the task may be already dead. |
1da177e4 | 4242 | */ |
95cdf3b7 IM |
4243 | int sched_setscheduler(struct task_struct *p, int policy, |
4244 | struct sched_param *param) | |
1da177e4 | 4245 | { |
83b699ed | 4246 | int retval, oldprio, oldpolicy = -1, on_rq, running; |
1da177e4 | 4247 | unsigned long flags; |
70b97a7f | 4248 | struct rq *rq; |
1da177e4 | 4249 | |
66e5393a SR |
4250 | /* may grab non-irq protected spin_locks */ |
4251 | BUG_ON(in_interrupt()); | |
1da177e4 LT |
4252 | recheck: |
4253 | /* double check policy once rq lock held */ | |
4254 | if (policy < 0) | |
4255 | policy = oldpolicy = p->policy; | |
4256 | else if (policy != SCHED_FIFO && policy != SCHED_RR && | |
dd41f596 IM |
4257 | policy != SCHED_NORMAL && policy != SCHED_BATCH && |
4258 | policy != SCHED_IDLE) | |
b0a9499c | 4259 | return -EINVAL; |
1da177e4 LT |
4260 | /* |
4261 | * Valid priorities for SCHED_FIFO and SCHED_RR are | |
dd41f596 IM |
4262 | * 1..MAX_USER_RT_PRIO-1, valid priority for SCHED_NORMAL, |
4263 | * SCHED_BATCH and SCHED_IDLE is 0. | |
1da177e4 LT |
4264 | */ |
4265 | if (param->sched_priority < 0 || | |
95cdf3b7 | 4266 | (p->mm && param->sched_priority > MAX_USER_RT_PRIO-1) || |
d46523ea | 4267 | (!p->mm && param->sched_priority > MAX_RT_PRIO-1)) |
1da177e4 | 4268 | return -EINVAL; |
e05606d3 | 4269 | if (rt_policy(policy) != (param->sched_priority != 0)) |
1da177e4 LT |
4270 | return -EINVAL; |
4271 | ||
37e4ab3f OC |
4272 | /* |
4273 | * Allow unprivileged RT tasks to decrease priority: | |
4274 | */ | |
4275 | if (!capable(CAP_SYS_NICE)) { | |
e05606d3 | 4276 | if (rt_policy(policy)) { |
8dc3e909 | 4277 | unsigned long rlim_rtprio; |
8dc3e909 ON |
4278 | |
4279 | if (!lock_task_sighand(p, &flags)) | |
4280 | return -ESRCH; | |
4281 | rlim_rtprio = p->signal->rlim[RLIMIT_RTPRIO].rlim_cur; | |
4282 | unlock_task_sighand(p, &flags); | |
4283 | ||
4284 | /* can't set/change the rt policy */ | |
4285 | if (policy != p->policy && !rlim_rtprio) | |
4286 | return -EPERM; | |
4287 | ||
4288 | /* can't increase priority */ | |
4289 | if (param->sched_priority > p->rt_priority && | |
4290 | param->sched_priority > rlim_rtprio) | |
4291 | return -EPERM; | |
4292 | } | |
dd41f596 IM |
4293 | /* |
4294 | * Like positive nice levels, dont allow tasks to | |
4295 | * move out of SCHED_IDLE either: | |
4296 | */ | |
4297 | if (p->policy == SCHED_IDLE && policy != SCHED_IDLE) | |
4298 | return -EPERM; | |
5fe1d75f | 4299 | |
37e4ab3f OC |
4300 | /* can't change other user's priorities */ |
4301 | if ((current->euid != p->euid) && | |
4302 | (current->euid != p->uid)) | |
4303 | return -EPERM; | |
4304 | } | |
1da177e4 LT |
4305 | |
4306 | retval = security_task_setscheduler(p, policy, param); | |
4307 | if (retval) | |
4308 | return retval; | |
b29739f9 IM |
4309 | /* |
4310 | * make sure no PI-waiters arrive (or leave) while we are | |
4311 | * changing the priority of the task: | |
4312 | */ | |
4313 | spin_lock_irqsave(&p->pi_lock, flags); | |
1da177e4 LT |
4314 | /* |
4315 | * To be able to change p->policy safely, the apropriate | |
4316 | * runqueue lock must be held. | |
4317 | */ | |
b29739f9 | 4318 | rq = __task_rq_lock(p); |
1da177e4 LT |
4319 | /* recheck policy now with rq lock held */ |
4320 | if (unlikely(oldpolicy != -1 && oldpolicy != p->policy)) { | |
4321 | policy = oldpolicy = -1; | |
b29739f9 IM |
4322 | __task_rq_unlock(rq); |
4323 | spin_unlock_irqrestore(&p->pi_lock, flags); | |
1da177e4 LT |
4324 | goto recheck; |
4325 | } | |
2daa3577 | 4326 | update_rq_clock(rq); |
dd41f596 | 4327 | on_rq = p->se.on_rq; |
83b699ed SV |
4328 | running = task_running(rq, p); |
4329 | if (on_rq) { | |
2e1cb74a | 4330 | deactivate_task(rq, p, 0); |
83b699ed SV |
4331 | if (running) |
4332 | p->sched_class->put_prev_task(rq, p); | |
4333 | } | |
f6b53205 | 4334 | |
1da177e4 | 4335 | oldprio = p->prio; |
dd41f596 | 4336 | __setscheduler(rq, p, policy, param->sched_priority); |
f6b53205 | 4337 | |
dd41f596 | 4338 | if (on_rq) { |
83b699ed SV |
4339 | if (running) |
4340 | p->sched_class->set_curr_task(rq); | |
dd41f596 | 4341 | activate_task(rq, p, 0); |
1da177e4 LT |
4342 | /* |
4343 | * Reschedule if we are currently running on this runqueue and | |
d5f9f942 AM |
4344 | * our priority decreased, or if we are not currently running on |
4345 | * this runqueue and our priority is higher than the current's | |
1da177e4 | 4346 | */ |
83b699ed | 4347 | if (running) { |
d5f9f942 AM |
4348 | if (p->prio > oldprio) |
4349 | resched_task(rq->curr); | |
dd41f596 IM |
4350 | } else { |
4351 | check_preempt_curr(rq, p); | |
4352 | } | |
1da177e4 | 4353 | } |
b29739f9 IM |
4354 | __task_rq_unlock(rq); |
4355 | spin_unlock_irqrestore(&p->pi_lock, flags); | |
4356 | ||
95e02ca9 TG |
4357 | rt_mutex_adjust_pi(p); |
4358 | ||
1da177e4 LT |
4359 | return 0; |
4360 | } | |
4361 | EXPORT_SYMBOL_GPL(sched_setscheduler); | |
4362 | ||
95cdf3b7 IM |
4363 | static int |
4364 | do_sched_setscheduler(pid_t pid, int policy, struct sched_param __user *param) | |
1da177e4 | 4365 | { |
1da177e4 LT |
4366 | struct sched_param lparam; |
4367 | struct task_struct *p; | |
36c8b586 | 4368 | int retval; |
1da177e4 LT |
4369 | |
4370 | if (!param || pid < 0) | |
4371 | return -EINVAL; | |
4372 | if (copy_from_user(&lparam, param, sizeof(struct sched_param))) | |
4373 | return -EFAULT; | |
5fe1d75f ON |
4374 | |
4375 | rcu_read_lock(); | |
4376 | retval = -ESRCH; | |
1da177e4 | 4377 | p = find_process_by_pid(pid); |
5fe1d75f ON |
4378 | if (p != NULL) |
4379 | retval = sched_setscheduler(p, policy, &lparam); | |
4380 | rcu_read_unlock(); | |
36c8b586 | 4381 | |
1da177e4 LT |
4382 | return retval; |
4383 | } | |
4384 | ||
4385 | /** | |
4386 | * sys_sched_setscheduler - set/change the scheduler policy and RT priority | |
4387 | * @pid: the pid in question. | |
4388 | * @policy: new policy. | |
4389 | * @param: structure containing the new RT priority. | |
4390 | */ | |
4391 | asmlinkage long sys_sched_setscheduler(pid_t pid, int policy, | |
4392 | struct sched_param __user *param) | |
4393 | { | |
c21761f1 JB |
4394 | /* negative values for policy are not valid */ |
4395 | if (policy < 0) | |
4396 | return -EINVAL; | |
4397 | ||
1da177e4 LT |
4398 | return do_sched_setscheduler(pid, policy, param); |
4399 | } | |
4400 | ||
4401 | /** | |
4402 | * sys_sched_setparam - set/change the RT priority of a thread | |
4403 | * @pid: the pid in question. | |
4404 | * @param: structure containing the new RT priority. | |
4405 | */ | |
4406 | asmlinkage long sys_sched_setparam(pid_t pid, struct sched_param __user *param) | |
4407 | { | |
4408 | return do_sched_setscheduler(pid, -1, param); | |
4409 | } | |
4410 | ||
4411 | /** | |
4412 | * sys_sched_getscheduler - get the policy (scheduling class) of a thread | |
4413 | * @pid: the pid in question. | |
4414 | */ | |
4415 | asmlinkage long sys_sched_getscheduler(pid_t pid) | |
4416 | { | |
36c8b586 | 4417 | struct task_struct *p; |
3a5c359a | 4418 | int retval; |
1da177e4 LT |
4419 | |
4420 | if (pid < 0) | |
3a5c359a | 4421 | return -EINVAL; |
1da177e4 LT |
4422 | |
4423 | retval = -ESRCH; | |
4424 | read_lock(&tasklist_lock); | |
4425 | p = find_process_by_pid(pid); | |
4426 | if (p) { | |
4427 | retval = security_task_getscheduler(p); | |
4428 | if (!retval) | |
4429 | retval = p->policy; | |
4430 | } | |
4431 | read_unlock(&tasklist_lock); | |
1da177e4 LT |
4432 | return retval; |
4433 | } | |
4434 | ||
4435 | /** | |
4436 | * sys_sched_getscheduler - get the RT priority of a thread | |
4437 | * @pid: the pid in question. | |
4438 | * @param: structure containing the RT priority. | |
4439 | */ | |
4440 | asmlinkage long sys_sched_getparam(pid_t pid, struct sched_param __user *param) | |
4441 | { | |
4442 | struct sched_param lp; | |
36c8b586 | 4443 | struct task_struct *p; |
3a5c359a | 4444 | int retval; |
1da177e4 LT |
4445 | |
4446 | if (!param || pid < 0) | |
3a5c359a | 4447 | return -EINVAL; |
1da177e4 LT |
4448 | |
4449 | read_lock(&tasklist_lock); | |
4450 | p = find_process_by_pid(pid); | |
4451 | retval = -ESRCH; | |
4452 | if (!p) | |
4453 | goto out_unlock; | |
4454 | ||
4455 | retval = security_task_getscheduler(p); | |
4456 | if (retval) | |
4457 | goto out_unlock; | |
4458 | ||
4459 | lp.sched_priority = p->rt_priority; | |
4460 | read_unlock(&tasklist_lock); | |
4461 | ||
4462 | /* | |
4463 | * This one might sleep, we cannot do it with a spinlock held ... | |
4464 | */ | |
4465 | retval = copy_to_user(param, &lp, sizeof(*param)) ? -EFAULT : 0; | |
4466 | ||
1da177e4 LT |
4467 | return retval; |
4468 | ||
4469 | out_unlock: | |
4470 | read_unlock(&tasklist_lock); | |
4471 | return retval; | |
4472 | } | |
4473 | ||
4474 | long sched_setaffinity(pid_t pid, cpumask_t new_mask) | |
4475 | { | |
1da177e4 | 4476 | cpumask_t cpus_allowed; |
36c8b586 IM |
4477 | struct task_struct *p; |
4478 | int retval; | |
1da177e4 | 4479 | |
5be9361c | 4480 | mutex_lock(&sched_hotcpu_mutex); |
1da177e4 LT |
4481 | read_lock(&tasklist_lock); |
4482 | ||
4483 | p = find_process_by_pid(pid); | |
4484 | if (!p) { | |
4485 | read_unlock(&tasklist_lock); | |
5be9361c | 4486 | mutex_unlock(&sched_hotcpu_mutex); |
1da177e4 LT |
4487 | return -ESRCH; |
4488 | } | |
4489 | ||
4490 | /* | |
4491 | * It is not safe to call set_cpus_allowed with the | |
4492 | * tasklist_lock held. We will bump the task_struct's | |
4493 | * usage count and then drop tasklist_lock. | |
4494 | */ | |
4495 | get_task_struct(p); | |
4496 | read_unlock(&tasklist_lock); | |
4497 | ||
4498 | retval = -EPERM; | |
4499 | if ((current->euid != p->euid) && (current->euid != p->uid) && | |
4500 | !capable(CAP_SYS_NICE)) | |
4501 | goto out_unlock; | |
4502 | ||
e7834f8f DQ |
4503 | retval = security_task_setscheduler(p, 0, NULL); |
4504 | if (retval) | |
4505 | goto out_unlock; | |
4506 | ||
1da177e4 LT |
4507 | cpus_allowed = cpuset_cpus_allowed(p); |
4508 | cpus_and(new_mask, new_mask, cpus_allowed); | |
8707d8b8 | 4509 | again: |
1da177e4 LT |
4510 | retval = set_cpus_allowed(p, new_mask); |
4511 | ||
8707d8b8 PM |
4512 | if (!retval) { |
4513 | cpus_allowed = cpuset_cpus_allowed(p); | |
4514 | if (!cpus_subset(new_mask, cpus_allowed)) { | |
4515 | /* | |
4516 | * We must have raced with a concurrent cpuset | |
4517 | * update. Just reset the cpus_allowed to the | |
4518 | * cpuset's cpus_allowed | |
4519 | */ | |
4520 | new_mask = cpus_allowed; | |
4521 | goto again; | |
4522 | } | |
4523 | } | |
1da177e4 LT |
4524 | out_unlock: |
4525 | put_task_struct(p); | |
5be9361c | 4526 | mutex_unlock(&sched_hotcpu_mutex); |
1da177e4 LT |
4527 | return retval; |
4528 | } | |
4529 | ||
4530 | static int get_user_cpu_mask(unsigned long __user *user_mask_ptr, unsigned len, | |
4531 | cpumask_t *new_mask) | |
4532 | { | |
4533 | if (len < sizeof(cpumask_t)) { | |
4534 | memset(new_mask, 0, sizeof(cpumask_t)); | |
4535 | } else if (len > sizeof(cpumask_t)) { | |
4536 | len = sizeof(cpumask_t); | |
4537 | } | |
4538 | return copy_from_user(new_mask, user_mask_ptr, len) ? -EFAULT : 0; | |
4539 | } | |
4540 | ||
4541 | /** | |
4542 | * sys_sched_setaffinity - set the cpu affinity of a process | |
4543 | * @pid: pid of the process | |
4544 | * @len: length in bytes of the bitmask pointed to by user_mask_ptr | |
4545 | * @user_mask_ptr: user-space pointer to the new cpu mask | |
4546 | */ | |
4547 | asmlinkage long sys_sched_setaffinity(pid_t pid, unsigned int len, | |
4548 | unsigned long __user *user_mask_ptr) | |
4549 | { | |
4550 | cpumask_t new_mask; | |
4551 | int retval; | |
4552 | ||
4553 | retval = get_user_cpu_mask(user_mask_ptr, len, &new_mask); | |
4554 | if (retval) | |
4555 | return retval; | |
4556 | ||
4557 | return sched_setaffinity(pid, new_mask); | |
4558 | } | |
4559 | ||
4560 | /* | |
4561 | * Represents all cpu's present in the system | |
4562 | * In systems capable of hotplug, this map could dynamically grow | |
4563 | * as new cpu's are detected in the system via any platform specific | |
4564 | * method, such as ACPI for e.g. | |
4565 | */ | |
4566 | ||
4cef0c61 | 4567 | cpumask_t cpu_present_map __read_mostly; |
1da177e4 LT |
4568 | EXPORT_SYMBOL(cpu_present_map); |
4569 | ||
4570 | #ifndef CONFIG_SMP | |
4cef0c61 | 4571 | cpumask_t cpu_online_map __read_mostly = CPU_MASK_ALL; |
e16b38f7 GB |
4572 | EXPORT_SYMBOL(cpu_online_map); |
4573 | ||
4cef0c61 | 4574 | cpumask_t cpu_possible_map __read_mostly = CPU_MASK_ALL; |
e16b38f7 | 4575 | EXPORT_SYMBOL(cpu_possible_map); |
1da177e4 LT |
4576 | #endif |
4577 | ||
4578 | long sched_getaffinity(pid_t pid, cpumask_t *mask) | |
4579 | { | |
36c8b586 | 4580 | struct task_struct *p; |
1da177e4 | 4581 | int retval; |
1da177e4 | 4582 | |
5be9361c | 4583 | mutex_lock(&sched_hotcpu_mutex); |
1da177e4 LT |
4584 | read_lock(&tasklist_lock); |
4585 | ||
4586 | retval = -ESRCH; | |
4587 | p = find_process_by_pid(pid); | |
4588 | if (!p) | |
4589 | goto out_unlock; | |
4590 | ||
e7834f8f DQ |
4591 | retval = security_task_getscheduler(p); |
4592 | if (retval) | |
4593 | goto out_unlock; | |
4594 | ||
2f7016d9 | 4595 | cpus_and(*mask, p->cpus_allowed, cpu_online_map); |
1da177e4 LT |
4596 | |
4597 | out_unlock: | |
4598 | read_unlock(&tasklist_lock); | |
5be9361c | 4599 | mutex_unlock(&sched_hotcpu_mutex); |
1da177e4 | 4600 | |
9531b62f | 4601 | return retval; |
1da177e4 LT |
4602 | } |
4603 | ||
4604 | /** | |
4605 | * sys_sched_getaffinity - get the cpu affinity of a process | |
4606 | * @pid: pid of the process | |
4607 | * @len: length in bytes of the bitmask pointed to by user_mask_ptr | |
4608 | * @user_mask_ptr: user-space pointer to hold the current cpu mask | |
4609 | */ | |
4610 | asmlinkage long sys_sched_getaffinity(pid_t pid, unsigned int len, | |
4611 | unsigned long __user *user_mask_ptr) | |
4612 | { | |
4613 | int ret; | |
4614 | cpumask_t mask; | |
4615 | ||
4616 | if (len < sizeof(cpumask_t)) | |
4617 | return -EINVAL; | |
4618 | ||
4619 | ret = sched_getaffinity(pid, &mask); | |
4620 | if (ret < 0) | |
4621 | return ret; | |
4622 | ||
4623 | if (copy_to_user(user_mask_ptr, &mask, sizeof(cpumask_t))) | |
4624 | return -EFAULT; | |
4625 | ||
4626 | return sizeof(cpumask_t); | |
4627 | } | |
4628 | ||
4629 | /** | |
4630 | * sys_sched_yield - yield the current processor to other threads. | |
4631 | * | |
dd41f596 IM |
4632 | * This function yields the current CPU to other tasks. If there are no |
4633 | * other threads running on this CPU then this function will return. | |
1da177e4 LT |
4634 | */ |
4635 | asmlinkage long sys_sched_yield(void) | |
4636 | { | |
70b97a7f | 4637 | struct rq *rq = this_rq_lock(); |
1da177e4 | 4638 | |
2d72376b | 4639 | schedstat_inc(rq, yld_count); |
4530d7ab | 4640 | current->sched_class->yield_task(rq); |
1da177e4 LT |
4641 | |
4642 | /* | |
4643 | * Since we are going to call schedule() anyway, there's | |
4644 | * no need to preempt or enable interrupts: | |
4645 | */ | |
4646 | __release(rq->lock); | |
8a25d5de | 4647 | spin_release(&rq->lock.dep_map, 1, _THIS_IP_); |
1da177e4 LT |
4648 | _raw_spin_unlock(&rq->lock); |
4649 | preempt_enable_no_resched(); | |
4650 | ||
4651 | schedule(); | |
4652 | ||
4653 | return 0; | |
4654 | } | |
4655 | ||
e7b38404 | 4656 | static void __cond_resched(void) |
1da177e4 | 4657 | { |
8e0a43d8 IM |
4658 | #ifdef CONFIG_DEBUG_SPINLOCK_SLEEP |
4659 | __might_sleep(__FILE__, __LINE__); | |
4660 | #endif | |
5bbcfd90 IM |
4661 | /* |
4662 | * The BKS might be reacquired before we have dropped | |
4663 | * PREEMPT_ACTIVE, which could trigger a second | |
4664 | * cond_resched() call. | |
4665 | */ | |
1da177e4 LT |
4666 | do { |
4667 | add_preempt_count(PREEMPT_ACTIVE); | |
4668 | schedule(); | |
4669 | sub_preempt_count(PREEMPT_ACTIVE); | |
4670 | } while (need_resched()); | |
4671 | } | |
4672 | ||
4673 | int __sched cond_resched(void) | |
4674 | { | |
9414232f IM |
4675 | if (need_resched() && !(preempt_count() & PREEMPT_ACTIVE) && |
4676 | system_state == SYSTEM_RUNNING) { | |
1da177e4 LT |
4677 | __cond_resched(); |
4678 | return 1; | |
4679 | } | |
4680 | return 0; | |
4681 | } | |
1da177e4 LT |
4682 | EXPORT_SYMBOL(cond_resched); |
4683 | ||
4684 | /* | |
4685 | * cond_resched_lock() - if a reschedule is pending, drop the given lock, | |
4686 | * call schedule, and on return reacquire the lock. | |
4687 | * | |
4688 | * This works OK both with and without CONFIG_PREEMPT. We do strange low-level | |
4689 | * operations here to prevent schedule() from being called twice (once via | |
4690 | * spin_unlock(), once by hand). | |
4691 | */ | |
95cdf3b7 | 4692 | int cond_resched_lock(spinlock_t *lock) |
1da177e4 | 4693 | { |
6df3cecb JK |
4694 | int ret = 0; |
4695 | ||
1da177e4 LT |
4696 | if (need_lockbreak(lock)) { |
4697 | spin_unlock(lock); | |
4698 | cpu_relax(); | |
6df3cecb | 4699 | ret = 1; |
1da177e4 LT |
4700 | spin_lock(lock); |
4701 | } | |
9414232f | 4702 | if (need_resched() && system_state == SYSTEM_RUNNING) { |
8a25d5de | 4703 | spin_release(&lock->dep_map, 1, _THIS_IP_); |
1da177e4 LT |
4704 | _raw_spin_unlock(lock); |
4705 | preempt_enable_no_resched(); | |
4706 | __cond_resched(); | |
6df3cecb | 4707 | ret = 1; |
1da177e4 | 4708 | spin_lock(lock); |
1da177e4 | 4709 | } |
6df3cecb | 4710 | return ret; |
1da177e4 | 4711 | } |
1da177e4 LT |
4712 | EXPORT_SYMBOL(cond_resched_lock); |
4713 | ||
4714 | int __sched cond_resched_softirq(void) | |
4715 | { | |
4716 | BUG_ON(!in_softirq()); | |
4717 | ||
9414232f | 4718 | if (need_resched() && system_state == SYSTEM_RUNNING) { |
98d82567 | 4719 | local_bh_enable(); |
1da177e4 LT |
4720 | __cond_resched(); |
4721 | local_bh_disable(); | |
4722 | return 1; | |
4723 | } | |
4724 | return 0; | |
4725 | } | |
1da177e4 LT |
4726 | EXPORT_SYMBOL(cond_resched_softirq); |
4727 | ||
1da177e4 LT |
4728 | /** |
4729 | * yield - yield the current processor to other threads. | |
4730 | * | |
72fd4a35 | 4731 | * This is a shortcut for kernel-space yielding - it marks the |
1da177e4 LT |
4732 | * thread runnable and calls sys_sched_yield(). |
4733 | */ | |
4734 | void __sched yield(void) | |
4735 | { | |
4736 | set_current_state(TASK_RUNNING); | |
4737 | sys_sched_yield(); | |
4738 | } | |
1da177e4 LT |
4739 | EXPORT_SYMBOL(yield); |
4740 | ||
4741 | /* | |
4742 | * This task is about to go to sleep on IO. Increment rq->nr_iowait so | |
4743 | * that process accounting knows that this is a task in IO wait state. | |
4744 | * | |
4745 | * But don't do that if it is a deliberate, throttling IO wait (this task | |
4746 | * has set its backing_dev_info: the queue against which it should throttle) | |
4747 | */ | |
4748 | void __sched io_schedule(void) | |
4749 | { | |
70b97a7f | 4750 | struct rq *rq = &__raw_get_cpu_var(runqueues); |
1da177e4 | 4751 | |
0ff92245 | 4752 | delayacct_blkio_start(); |
1da177e4 LT |
4753 | atomic_inc(&rq->nr_iowait); |
4754 | schedule(); | |
4755 | atomic_dec(&rq->nr_iowait); | |
0ff92245 | 4756 | delayacct_blkio_end(); |
1da177e4 | 4757 | } |
1da177e4 LT |
4758 | EXPORT_SYMBOL(io_schedule); |
4759 | ||
4760 | long __sched io_schedule_timeout(long timeout) | |
4761 | { | |
70b97a7f | 4762 | struct rq *rq = &__raw_get_cpu_var(runqueues); |
1da177e4 LT |
4763 | long ret; |
4764 | ||
0ff92245 | 4765 | delayacct_blkio_start(); |
1da177e4 LT |
4766 | atomic_inc(&rq->nr_iowait); |
4767 | ret = schedule_timeout(timeout); | |
4768 | atomic_dec(&rq->nr_iowait); | |
0ff92245 | 4769 | delayacct_blkio_end(); |
1da177e4 LT |
4770 | return ret; |
4771 | } | |
4772 | ||
4773 | /** | |
4774 | * sys_sched_get_priority_max - return maximum RT priority. | |
4775 | * @policy: scheduling class. | |
4776 | * | |
4777 | * this syscall returns the maximum rt_priority that can be used | |
4778 | * by a given scheduling class. | |
4779 | */ | |
4780 | asmlinkage long sys_sched_get_priority_max(int policy) | |
4781 | { | |
4782 | int ret = -EINVAL; | |
4783 | ||
4784 | switch (policy) { | |
4785 | case SCHED_FIFO: | |
4786 | case SCHED_RR: | |
4787 | ret = MAX_USER_RT_PRIO-1; | |
4788 | break; | |
4789 | case SCHED_NORMAL: | |
b0a9499c | 4790 | case SCHED_BATCH: |
dd41f596 | 4791 | case SCHED_IDLE: |
1da177e4 LT |
4792 | ret = 0; |
4793 | break; | |
4794 | } | |
4795 | return ret; | |
4796 | } | |
4797 | ||
4798 | /** | |
4799 | * sys_sched_get_priority_min - return minimum RT priority. | |
4800 | * @policy: scheduling class. | |
4801 | * | |
4802 | * this syscall returns the minimum rt_priority that can be used | |
4803 | * by a given scheduling class. | |
4804 | */ | |
4805 | asmlinkage long sys_sched_get_priority_min(int policy) | |
4806 | { | |
4807 | int ret = -EINVAL; | |
4808 | ||
4809 | switch (policy) { | |
4810 | case SCHED_FIFO: | |
4811 | case SCHED_RR: | |
4812 | ret = 1; | |
4813 | break; | |
4814 | case SCHED_NORMAL: | |
b0a9499c | 4815 | case SCHED_BATCH: |
dd41f596 | 4816 | case SCHED_IDLE: |
1da177e4 LT |
4817 | ret = 0; |
4818 | } | |
4819 | return ret; | |
4820 | } | |
4821 | ||
4822 | /** | |
4823 | * sys_sched_rr_get_interval - return the default timeslice of a process. | |
4824 | * @pid: pid of the process. | |
4825 | * @interval: userspace pointer to the timeslice value. | |
4826 | * | |
4827 | * this syscall writes the default timeslice value of a given process | |
4828 | * into the user-space timespec buffer. A value of '0' means infinity. | |
4829 | */ | |
4830 | asmlinkage | |
4831 | long sys_sched_rr_get_interval(pid_t pid, struct timespec __user *interval) | |
4832 | { | |
36c8b586 | 4833 | struct task_struct *p; |
a4ec24b4 | 4834 | unsigned int time_slice; |
3a5c359a | 4835 | int retval; |
1da177e4 | 4836 | struct timespec t; |
1da177e4 LT |
4837 | |
4838 | if (pid < 0) | |
3a5c359a | 4839 | return -EINVAL; |
1da177e4 LT |
4840 | |
4841 | retval = -ESRCH; | |
4842 | read_lock(&tasklist_lock); | |
4843 | p = find_process_by_pid(pid); | |
4844 | if (!p) | |
4845 | goto out_unlock; | |
4846 | ||
4847 | retval = security_task_getscheduler(p); | |
4848 | if (retval) | |
4849 | goto out_unlock; | |
4850 | ||
a4ec24b4 DA |
4851 | if (p->policy == SCHED_FIFO) |
4852 | time_slice = 0; | |
4853 | else if (p->policy == SCHED_RR) | |
4854 | time_slice = DEF_TIMESLICE; | |
4855 | else { | |
4856 | struct sched_entity *se = &p->se; | |
4857 | unsigned long flags; | |
4858 | struct rq *rq; | |
4859 | ||
4860 | rq = task_rq_lock(p, &flags); | |
4861 | time_slice = NS_TO_JIFFIES(sched_slice(cfs_rq_of(se), se)); | |
4862 | task_rq_unlock(rq, &flags); | |
4863 | } | |
1da177e4 | 4864 | read_unlock(&tasklist_lock); |
a4ec24b4 | 4865 | jiffies_to_timespec(time_slice, &t); |
1da177e4 | 4866 | retval = copy_to_user(interval, &t, sizeof(t)) ? -EFAULT : 0; |
1da177e4 | 4867 | return retval; |
3a5c359a | 4868 | |
1da177e4 LT |
4869 | out_unlock: |
4870 | read_unlock(&tasklist_lock); | |
4871 | return retval; | |
4872 | } | |
4873 | ||
2ed6e34f | 4874 | static const char stat_nam[] = "RSDTtZX"; |
36c8b586 IM |
4875 | |
4876 | static void show_task(struct task_struct *p) | |
1da177e4 | 4877 | { |
1da177e4 | 4878 | unsigned long free = 0; |
36c8b586 | 4879 | unsigned state; |
1da177e4 | 4880 | |
1da177e4 | 4881 | state = p->state ? __ffs(p->state) + 1 : 0; |
cc4ea795 | 4882 | printk(KERN_INFO "%-13.13s %c", p->comm, |
2ed6e34f | 4883 | state < sizeof(stat_nam) - 1 ? stat_nam[state] : '?'); |
4bd77321 | 4884 | #if BITS_PER_LONG == 32 |
1da177e4 | 4885 | if (state == TASK_RUNNING) |
cc4ea795 | 4886 | printk(KERN_CONT " running "); |
1da177e4 | 4887 | else |
cc4ea795 | 4888 | printk(KERN_CONT " %08lx ", thread_saved_pc(p)); |
1da177e4 LT |
4889 | #else |
4890 | if (state == TASK_RUNNING) | |
cc4ea795 | 4891 | printk(KERN_CONT " running task "); |
1da177e4 | 4892 | else |
cc4ea795 | 4893 | printk(KERN_CONT " %016lx ", thread_saved_pc(p)); |
1da177e4 LT |
4894 | #endif |
4895 | #ifdef CONFIG_DEBUG_STACK_USAGE | |
4896 | { | |
10ebffde | 4897 | unsigned long *n = end_of_stack(p); |
1da177e4 LT |
4898 | while (!*n) |
4899 | n++; | |
10ebffde | 4900 | free = (unsigned long)n - (unsigned long)end_of_stack(p); |
1da177e4 LT |
4901 | } |
4902 | #endif | |
ba25f9dc PE |
4903 | printk(KERN_CONT "%5lu %5d %6d\n", free, |
4904 | task_pid_nr(p), task_pid_nr(p->parent)); | |
1da177e4 LT |
4905 | |
4906 | if (state != TASK_RUNNING) | |
4907 | show_stack(p, NULL); | |
4908 | } | |
4909 | ||
e59e2ae2 | 4910 | void show_state_filter(unsigned long state_filter) |
1da177e4 | 4911 | { |
36c8b586 | 4912 | struct task_struct *g, *p; |
1da177e4 | 4913 | |
4bd77321 IM |
4914 | #if BITS_PER_LONG == 32 |
4915 | printk(KERN_INFO | |
4916 | " task PC stack pid father\n"); | |
1da177e4 | 4917 | #else |
4bd77321 IM |
4918 | printk(KERN_INFO |
4919 | " task PC stack pid father\n"); | |
1da177e4 LT |
4920 | #endif |
4921 | read_lock(&tasklist_lock); | |
4922 | do_each_thread(g, p) { | |
4923 | /* | |
4924 | * reset the NMI-timeout, listing all files on a slow | |
4925 | * console might take alot of time: | |
4926 | */ | |
4927 | touch_nmi_watchdog(); | |
39bc89fd | 4928 | if (!state_filter || (p->state & state_filter)) |
e59e2ae2 | 4929 | show_task(p); |
1da177e4 LT |
4930 | } while_each_thread(g, p); |
4931 | ||
04c9167f JF |
4932 | touch_all_softlockup_watchdogs(); |
4933 | ||
dd41f596 IM |
4934 | #ifdef CONFIG_SCHED_DEBUG |
4935 | sysrq_sched_debug_show(); | |
4936 | #endif | |
1da177e4 | 4937 | read_unlock(&tasklist_lock); |
e59e2ae2 IM |
4938 | /* |
4939 | * Only show locks if all tasks are dumped: | |
4940 | */ | |
4941 | if (state_filter == -1) | |
4942 | debug_show_all_locks(); | |
1da177e4 LT |
4943 | } |
4944 | ||
1df21055 IM |
4945 | void __cpuinit init_idle_bootup_task(struct task_struct *idle) |
4946 | { | |
dd41f596 | 4947 | idle->sched_class = &idle_sched_class; |
1df21055 IM |
4948 | } |
4949 | ||
f340c0d1 IM |
4950 | /** |
4951 | * init_idle - set up an idle thread for a given CPU | |
4952 | * @idle: task in question | |
4953 | * @cpu: cpu the idle task belongs to | |
4954 | * | |
4955 | * NOTE: this function does not set the idle thread's NEED_RESCHED | |
4956 | * flag, to make booting more robust. | |
4957 | */ | |
5c1e1767 | 4958 | void __cpuinit init_idle(struct task_struct *idle, int cpu) |
1da177e4 | 4959 | { |
70b97a7f | 4960 | struct rq *rq = cpu_rq(cpu); |
1da177e4 LT |
4961 | unsigned long flags; |
4962 | ||
dd41f596 IM |
4963 | __sched_fork(idle); |
4964 | idle->se.exec_start = sched_clock(); | |
4965 | ||
b29739f9 | 4966 | idle->prio = idle->normal_prio = MAX_PRIO; |
1da177e4 | 4967 | idle->cpus_allowed = cpumask_of_cpu(cpu); |
dd41f596 | 4968 | __set_task_cpu(idle, cpu); |
1da177e4 LT |
4969 | |
4970 | spin_lock_irqsave(&rq->lock, flags); | |
4971 | rq->curr = rq->idle = idle; | |
4866cde0 NP |
4972 | #if defined(CONFIG_SMP) && defined(__ARCH_WANT_UNLOCKED_CTXSW) |
4973 | idle->oncpu = 1; | |
4974 | #endif | |
1da177e4 LT |
4975 | spin_unlock_irqrestore(&rq->lock, flags); |
4976 | ||
4977 | /* Set the preempt count _outside_ the spinlocks! */ | |
4978 | #if defined(CONFIG_PREEMPT) && !defined(CONFIG_PREEMPT_BKL) | |
a1261f54 | 4979 | task_thread_info(idle)->preempt_count = (idle->lock_depth >= 0); |
1da177e4 | 4980 | #else |
a1261f54 | 4981 | task_thread_info(idle)->preempt_count = 0; |
1da177e4 | 4982 | #endif |
dd41f596 IM |
4983 | /* |
4984 | * The idle tasks have their own, simple scheduling class: | |
4985 | */ | |
4986 | idle->sched_class = &idle_sched_class; | |
1da177e4 LT |
4987 | } |
4988 | ||
4989 | /* | |
4990 | * In a system that switches off the HZ timer nohz_cpu_mask | |
4991 | * indicates which cpus entered this state. This is used | |
4992 | * in the rcu update to wait only for active cpus. For system | |
4993 | * which do not switch off the HZ timer nohz_cpu_mask should | |
4994 | * always be CPU_MASK_NONE. | |
4995 | */ | |
4996 | cpumask_t nohz_cpu_mask = CPU_MASK_NONE; | |
4997 | ||
19978ca6 IM |
4998 | /* |
4999 | * Increase the granularity value when there are more CPUs, | |
5000 | * because with more CPUs the 'effective latency' as visible | |
5001 | * to users decreases. But the relationship is not linear, | |
5002 | * so pick a second-best guess by going with the log2 of the | |
5003 | * number of CPUs. | |
5004 | * | |
5005 | * This idea comes from the SD scheduler of Con Kolivas: | |
5006 | */ | |
5007 | static inline void sched_init_granularity(void) | |
5008 | { | |
5009 | unsigned int factor = 1 + ilog2(num_online_cpus()); | |
5010 | const unsigned long limit = 200000000; | |
5011 | ||
5012 | sysctl_sched_min_granularity *= factor; | |
5013 | if (sysctl_sched_min_granularity > limit) | |
5014 | sysctl_sched_min_granularity = limit; | |
5015 | ||
5016 | sysctl_sched_latency *= factor; | |
5017 | if (sysctl_sched_latency > limit) | |
5018 | sysctl_sched_latency = limit; | |
5019 | ||
5020 | sysctl_sched_wakeup_granularity *= factor; | |
5021 | sysctl_sched_batch_wakeup_granularity *= factor; | |
5022 | } | |
5023 | ||
1da177e4 LT |
5024 | #ifdef CONFIG_SMP |
5025 | /* | |
5026 | * This is how migration works: | |
5027 | * | |
70b97a7f | 5028 | * 1) we queue a struct migration_req structure in the source CPU's |
1da177e4 LT |
5029 | * runqueue and wake up that CPU's migration thread. |
5030 | * 2) we down() the locked semaphore => thread blocks. | |
5031 | * 3) migration thread wakes up (implicitly it forces the migrated | |
5032 | * thread off the CPU) | |
5033 | * 4) it gets the migration request and checks whether the migrated | |
5034 | * task is still in the wrong runqueue. | |
5035 | * 5) if it's in the wrong runqueue then the migration thread removes | |
5036 | * it and puts it into the right queue. | |
5037 | * 6) migration thread up()s the semaphore. | |
5038 | * 7) we wake up and the migration is done. | |
5039 | */ | |
5040 | ||
5041 | /* | |
5042 | * Change a given task's CPU affinity. Migrate the thread to a | |
5043 | * proper CPU and schedule it away if the CPU it's executing on | |
5044 | * is removed from the allowed bitmask. | |
5045 | * | |
5046 | * NOTE: the caller must have a valid reference to the task, the | |
5047 | * task must not exit() & deallocate itself prematurely. The | |
5048 | * call is not atomic; no spinlocks may be held. | |
5049 | */ | |
36c8b586 | 5050 | int set_cpus_allowed(struct task_struct *p, cpumask_t new_mask) |
1da177e4 | 5051 | { |
70b97a7f | 5052 | struct migration_req req; |
1da177e4 | 5053 | unsigned long flags; |
70b97a7f | 5054 | struct rq *rq; |
48f24c4d | 5055 | int ret = 0; |
1da177e4 LT |
5056 | |
5057 | rq = task_rq_lock(p, &flags); | |
5058 | if (!cpus_intersects(new_mask, cpu_online_map)) { | |
5059 | ret = -EINVAL; | |
5060 | goto out; | |
5061 | } | |
5062 | ||
5063 | p->cpus_allowed = new_mask; | |
5064 | /* Can the task run on the task's current CPU? If so, we're done */ | |
5065 | if (cpu_isset(task_cpu(p), new_mask)) | |
5066 | goto out; | |
5067 | ||
5068 | if (migrate_task(p, any_online_cpu(new_mask), &req)) { | |
5069 | /* Need help from migration thread: drop lock and wait. */ | |
5070 | task_rq_unlock(rq, &flags); | |
5071 | wake_up_process(rq->migration_thread); | |
5072 | wait_for_completion(&req.done); | |
5073 | tlb_migrate_finish(p->mm); | |
5074 | return 0; | |
5075 | } | |
5076 | out: | |
5077 | task_rq_unlock(rq, &flags); | |
48f24c4d | 5078 | |
1da177e4 LT |
5079 | return ret; |
5080 | } | |
1da177e4 LT |
5081 | EXPORT_SYMBOL_GPL(set_cpus_allowed); |
5082 | ||
5083 | /* | |
5084 | * Move (not current) task off this cpu, onto dest cpu. We're doing | |
5085 | * this because either it can't run here any more (set_cpus_allowed() | |
5086 | * away from this CPU, or CPU going down), or because we're | |
5087 | * attempting to rebalance this task on exec (sched_exec). | |
5088 | * | |
5089 | * So we race with normal scheduler movements, but that's OK, as long | |
5090 | * as the task is no longer on this CPU. | |
efc30814 KK |
5091 | * |
5092 | * Returns non-zero if task was successfully migrated. | |
1da177e4 | 5093 | */ |
efc30814 | 5094 | static int __migrate_task(struct task_struct *p, int src_cpu, int dest_cpu) |
1da177e4 | 5095 | { |
70b97a7f | 5096 | struct rq *rq_dest, *rq_src; |
dd41f596 | 5097 | int ret = 0, on_rq; |
1da177e4 LT |
5098 | |
5099 | if (unlikely(cpu_is_offline(dest_cpu))) | |
efc30814 | 5100 | return ret; |
1da177e4 LT |
5101 | |
5102 | rq_src = cpu_rq(src_cpu); | |
5103 | rq_dest = cpu_rq(dest_cpu); | |
5104 | ||
5105 | double_rq_lock(rq_src, rq_dest); | |
5106 | /* Already moved. */ | |
5107 | if (task_cpu(p) != src_cpu) | |
5108 | goto out; | |
5109 | /* Affinity changed (again). */ | |
5110 | if (!cpu_isset(dest_cpu, p->cpus_allowed)) | |
5111 | goto out; | |
5112 | ||
dd41f596 | 5113 | on_rq = p->se.on_rq; |
6e82a3be | 5114 | if (on_rq) |
2e1cb74a | 5115 | deactivate_task(rq_src, p, 0); |
6e82a3be | 5116 | |
1da177e4 | 5117 | set_task_cpu(p, dest_cpu); |
dd41f596 IM |
5118 | if (on_rq) { |
5119 | activate_task(rq_dest, p, 0); | |
5120 | check_preempt_curr(rq_dest, p); | |
1da177e4 | 5121 | } |
efc30814 | 5122 | ret = 1; |
1da177e4 LT |
5123 | out: |
5124 | double_rq_unlock(rq_src, rq_dest); | |
efc30814 | 5125 | return ret; |
1da177e4 LT |
5126 | } |
5127 | ||
5128 | /* | |
5129 | * migration_thread - this is a highprio system thread that performs | |
5130 | * thread migration by bumping thread off CPU then 'pushing' onto | |
5131 | * another runqueue. | |
5132 | */ | |
95cdf3b7 | 5133 | static int migration_thread(void *data) |
1da177e4 | 5134 | { |
1da177e4 | 5135 | int cpu = (long)data; |
70b97a7f | 5136 | struct rq *rq; |
1da177e4 LT |
5137 | |
5138 | rq = cpu_rq(cpu); | |
5139 | BUG_ON(rq->migration_thread != current); | |
5140 | ||
5141 | set_current_state(TASK_INTERRUPTIBLE); | |
5142 | while (!kthread_should_stop()) { | |
70b97a7f | 5143 | struct migration_req *req; |
1da177e4 | 5144 | struct list_head *head; |
1da177e4 | 5145 | |
1da177e4 LT |
5146 | spin_lock_irq(&rq->lock); |
5147 | ||
5148 | if (cpu_is_offline(cpu)) { | |
5149 | spin_unlock_irq(&rq->lock); | |
5150 | goto wait_to_die; | |
5151 | } | |
5152 | ||
5153 | if (rq->active_balance) { | |
5154 | active_load_balance(rq, cpu); | |
5155 | rq->active_balance = 0; | |
5156 | } | |
5157 | ||
5158 | head = &rq->migration_queue; | |
5159 | ||
5160 | if (list_empty(head)) { | |
5161 | spin_unlock_irq(&rq->lock); | |
5162 | schedule(); | |
5163 | set_current_state(TASK_INTERRUPTIBLE); | |
5164 | continue; | |
5165 | } | |
70b97a7f | 5166 | req = list_entry(head->next, struct migration_req, list); |
1da177e4 LT |
5167 | list_del_init(head->next); |
5168 | ||
674311d5 NP |
5169 | spin_unlock(&rq->lock); |
5170 | __migrate_task(req->task, cpu, req->dest_cpu); | |
5171 | local_irq_enable(); | |
1da177e4 LT |
5172 | |
5173 | complete(&req->done); | |
5174 | } | |
5175 | __set_current_state(TASK_RUNNING); | |
5176 | return 0; | |
5177 | ||
5178 | wait_to_die: | |
5179 | /* Wait for kthread_stop */ | |
5180 | set_current_state(TASK_INTERRUPTIBLE); | |
5181 | while (!kthread_should_stop()) { | |
5182 | schedule(); | |
5183 | set_current_state(TASK_INTERRUPTIBLE); | |
5184 | } | |
5185 | __set_current_state(TASK_RUNNING); | |
5186 | return 0; | |
5187 | } | |
5188 | ||
5189 | #ifdef CONFIG_HOTPLUG_CPU | |
f7b4cddc ON |
5190 | |
5191 | static int __migrate_task_irq(struct task_struct *p, int src_cpu, int dest_cpu) | |
5192 | { | |
5193 | int ret; | |
5194 | ||
5195 | local_irq_disable(); | |
5196 | ret = __migrate_task(p, src_cpu, dest_cpu); | |
5197 | local_irq_enable(); | |
5198 | return ret; | |
5199 | } | |
5200 | ||
054b9108 | 5201 | /* |
3a4fa0a2 | 5202 | * Figure out where task on dead CPU should go, use force if necessary. |
054b9108 KK |
5203 | * NOTE: interrupts should be disabled by the caller |
5204 | */ | |
48f24c4d | 5205 | static void move_task_off_dead_cpu(int dead_cpu, struct task_struct *p) |
1da177e4 | 5206 | { |
efc30814 | 5207 | unsigned long flags; |
1da177e4 | 5208 | cpumask_t mask; |
70b97a7f IM |
5209 | struct rq *rq; |
5210 | int dest_cpu; | |
1da177e4 | 5211 | |
3a5c359a AK |
5212 | do { |
5213 | /* On same node? */ | |
5214 | mask = node_to_cpumask(cpu_to_node(dead_cpu)); | |
5215 | cpus_and(mask, mask, p->cpus_allowed); | |
5216 | dest_cpu = any_online_cpu(mask); | |
5217 | ||
5218 | /* On any allowed CPU? */ | |
5219 | if (dest_cpu == NR_CPUS) | |
5220 | dest_cpu = any_online_cpu(p->cpus_allowed); | |
5221 | ||
5222 | /* No more Mr. Nice Guy. */ | |
5223 | if (dest_cpu == NR_CPUS) { | |
470fd646 CW |
5224 | cpumask_t cpus_allowed = cpuset_cpus_allowed_locked(p); |
5225 | /* | |
5226 | * Try to stay on the same cpuset, where the | |
5227 | * current cpuset may be a subset of all cpus. | |
5228 | * The cpuset_cpus_allowed_locked() variant of | |
5229 | * cpuset_cpus_allowed() will not block. It must be | |
5230 | * called within calls to cpuset_lock/cpuset_unlock. | |
5231 | */ | |
3a5c359a | 5232 | rq = task_rq_lock(p, &flags); |
470fd646 | 5233 | p->cpus_allowed = cpus_allowed; |
3a5c359a AK |
5234 | dest_cpu = any_online_cpu(p->cpus_allowed); |
5235 | task_rq_unlock(rq, &flags); | |
1da177e4 | 5236 | |
3a5c359a AK |
5237 | /* |
5238 | * Don't tell them about moving exiting tasks or | |
5239 | * kernel threads (both mm NULL), since they never | |
5240 | * leave kernel. | |
5241 | */ | |
5242 | if (p->mm && printk_ratelimit()) | |
5243 | printk(KERN_INFO "process %d (%s) no " | |
5244 | "longer affine to cpu%d\n", | |
ba25f9dc | 5245 | task_pid_nr(p), p->comm, dead_cpu); |
3a5c359a | 5246 | } |
f7b4cddc | 5247 | } while (!__migrate_task_irq(p, dead_cpu, dest_cpu)); |
1da177e4 LT |
5248 | } |
5249 | ||
5250 | /* | |
5251 | * While a dead CPU has no uninterruptible tasks queued at this point, | |
5252 | * it might still have a nonzero ->nr_uninterruptible counter, because | |
5253 | * for performance reasons the counter is not stricly tracking tasks to | |
5254 | * their home CPUs. So we just add the counter to another CPU's counter, | |
5255 | * to keep the global sum constant after CPU-down: | |
5256 | */ | |
70b97a7f | 5257 | static void migrate_nr_uninterruptible(struct rq *rq_src) |
1da177e4 | 5258 | { |
70b97a7f | 5259 | struct rq *rq_dest = cpu_rq(any_online_cpu(CPU_MASK_ALL)); |
1da177e4 LT |
5260 | unsigned long flags; |
5261 | ||
5262 | local_irq_save(flags); | |
5263 | double_rq_lock(rq_src, rq_dest); | |
5264 | rq_dest->nr_uninterruptible += rq_src->nr_uninterruptible; | |
5265 | rq_src->nr_uninterruptible = 0; | |
5266 | double_rq_unlock(rq_src, rq_dest); | |
5267 | local_irq_restore(flags); | |
5268 | } | |
5269 | ||
5270 | /* Run through task list and migrate tasks from the dead cpu. */ | |
5271 | static void migrate_live_tasks(int src_cpu) | |
5272 | { | |
48f24c4d | 5273 | struct task_struct *p, *t; |
1da177e4 | 5274 | |
f7b4cddc | 5275 | read_lock(&tasklist_lock); |
1da177e4 | 5276 | |
48f24c4d IM |
5277 | do_each_thread(t, p) { |
5278 | if (p == current) | |
1da177e4 LT |
5279 | continue; |
5280 | ||
48f24c4d IM |
5281 | if (task_cpu(p) == src_cpu) |
5282 | move_task_off_dead_cpu(src_cpu, p); | |
5283 | } while_each_thread(t, p); | |
1da177e4 | 5284 | |
f7b4cddc | 5285 | read_unlock(&tasklist_lock); |
1da177e4 LT |
5286 | } |
5287 | ||
a9957449 AD |
5288 | /* |
5289 | * activate_idle_task - move idle task to the _front_ of runqueue. | |
5290 | */ | |
5291 | static void activate_idle_task(struct task_struct *p, struct rq *rq) | |
5292 | { | |
5293 | update_rq_clock(rq); | |
5294 | ||
5295 | if (p->state == TASK_UNINTERRUPTIBLE) | |
5296 | rq->nr_uninterruptible--; | |
5297 | ||
5298 | enqueue_task(rq, p, 0); | |
5299 | inc_nr_running(p, rq); | |
5300 | } | |
5301 | ||
dd41f596 IM |
5302 | /* |
5303 | * Schedules idle task to be the next runnable task on current CPU. | |
1da177e4 | 5304 | * It does so by boosting its priority to highest possible and adding it to |
48f24c4d | 5305 | * the _front_ of the runqueue. Used by CPU offline code. |
1da177e4 LT |
5306 | */ |
5307 | void sched_idle_next(void) | |
5308 | { | |
48f24c4d | 5309 | int this_cpu = smp_processor_id(); |
70b97a7f | 5310 | struct rq *rq = cpu_rq(this_cpu); |
1da177e4 LT |
5311 | struct task_struct *p = rq->idle; |
5312 | unsigned long flags; | |
5313 | ||
5314 | /* cpu has to be offline */ | |
48f24c4d | 5315 | BUG_ON(cpu_online(this_cpu)); |
1da177e4 | 5316 | |
48f24c4d IM |
5317 | /* |
5318 | * Strictly not necessary since rest of the CPUs are stopped by now | |
5319 | * and interrupts disabled on the current cpu. | |
1da177e4 LT |
5320 | */ |
5321 | spin_lock_irqsave(&rq->lock, flags); | |
5322 | ||
dd41f596 | 5323 | __setscheduler(rq, p, SCHED_FIFO, MAX_RT_PRIO-1); |
48f24c4d IM |
5324 | |
5325 | /* Add idle task to the _front_ of its priority queue: */ | |
dd41f596 | 5326 | activate_idle_task(p, rq); |
1da177e4 LT |
5327 | |
5328 | spin_unlock_irqrestore(&rq->lock, flags); | |
5329 | } | |
5330 | ||
48f24c4d IM |
5331 | /* |
5332 | * Ensures that the idle task is using init_mm right before its cpu goes | |
1da177e4 LT |
5333 | * offline. |
5334 | */ | |
5335 | void idle_task_exit(void) | |
5336 | { | |
5337 | struct mm_struct *mm = current->active_mm; | |
5338 | ||
5339 | BUG_ON(cpu_online(smp_processor_id())); | |
5340 | ||
5341 | if (mm != &init_mm) | |
5342 | switch_mm(mm, &init_mm, current); | |
5343 | mmdrop(mm); | |
5344 | } | |
5345 | ||
054b9108 | 5346 | /* called under rq->lock with disabled interrupts */ |
36c8b586 | 5347 | static void migrate_dead(unsigned int dead_cpu, struct task_struct *p) |
1da177e4 | 5348 | { |
70b97a7f | 5349 | struct rq *rq = cpu_rq(dead_cpu); |
1da177e4 LT |
5350 | |
5351 | /* Must be exiting, otherwise would be on tasklist. */ | |
270f722d | 5352 | BUG_ON(!p->exit_state); |
1da177e4 LT |
5353 | |
5354 | /* Cannot have done final schedule yet: would have vanished. */ | |
c394cc9f | 5355 | BUG_ON(p->state == TASK_DEAD); |
1da177e4 | 5356 | |
48f24c4d | 5357 | get_task_struct(p); |
1da177e4 LT |
5358 | |
5359 | /* | |
5360 | * Drop lock around migration; if someone else moves it, | |
5361 | * that's OK. No task can be added to this CPU, so iteration is | |
5362 | * fine. | |
5363 | */ | |
f7b4cddc | 5364 | spin_unlock_irq(&rq->lock); |
48f24c4d | 5365 | move_task_off_dead_cpu(dead_cpu, p); |
f7b4cddc | 5366 | spin_lock_irq(&rq->lock); |
1da177e4 | 5367 | |
48f24c4d | 5368 | put_task_struct(p); |
1da177e4 LT |
5369 | } |
5370 | ||
5371 | /* release_task() removes task from tasklist, so we won't find dead tasks. */ | |
5372 | static void migrate_dead_tasks(unsigned int dead_cpu) | |
5373 | { | |
70b97a7f | 5374 | struct rq *rq = cpu_rq(dead_cpu); |
dd41f596 | 5375 | struct task_struct *next; |
48f24c4d | 5376 | |
dd41f596 IM |
5377 | for ( ; ; ) { |
5378 | if (!rq->nr_running) | |
5379 | break; | |
a8e504d2 | 5380 | update_rq_clock(rq); |
ff95f3df | 5381 | next = pick_next_task(rq, rq->curr); |
dd41f596 IM |
5382 | if (!next) |
5383 | break; | |
5384 | migrate_dead(dead_cpu, next); | |
e692ab53 | 5385 | |
1da177e4 LT |
5386 | } |
5387 | } | |
5388 | #endif /* CONFIG_HOTPLUG_CPU */ | |
5389 | ||
e692ab53 NP |
5390 | #if defined(CONFIG_SCHED_DEBUG) && defined(CONFIG_SYSCTL) |
5391 | ||
5392 | static struct ctl_table sd_ctl_dir[] = { | |
e0361851 AD |
5393 | { |
5394 | .procname = "sched_domain", | |
c57baf1e | 5395 | .mode = 0555, |
e0361851 | 5396 | }, |
38605cae | 5397 | {0, }, |
e692ab53 NP |
5398 | }; |
5399 | ||
5400 | static struct ctl_table sd_ctl_root[] = { | |
e0361851 | 5401 | { |
c57baf1e | 5402 | .ctl_name = CTL_KERN, |
e0361851 | 5403 | .procname = "kernel", |
c57baf1e | 5404 | .mode = 0555, |
e0361851 AD |
5405 | .child = sd_ctl_dir, |
5406 | }, | |
38605cae | 5407 | {0, }, |
e692ab53 NP |
5408 | }; |
5409 | ||
5410 | static struct ctl_table *sd_alloc_ctl_entry(int n) | |
5411 | { | |
5412 | struct ctl_table *entry = | |
5cf9f062 | 5413 | kcalloc(n, sizeof(struct ctl_table), GFP_KERNEL); |
e692ab53 | 5414 | |
e692ab53 NP |
5415 | return entry; |
5416 | } | |
5417 | ||
6382bc90 MM |
5418 | static void sd_free_ctl_entry(struct ctl_table **tablep) |
5419 | { | |
cd790076 | 5420 | struct ctl_table *entry; |
6382bc90 | 5421 | |
cd790076 MM |
5422 | /* |
5423 | * In the intermediate directories, both the child directory and | |
5424 | * procname are dynamically allocated and could fail but the mode | |
5425 | * will always be set. In the lowest directory the names are | |
5426 | * static strings and all have proc handlers. | |
5427 | */ | |
5428 | for (entry = *tablep; entry->mode; entry++) { | |
6382bc90 MM |
5429 | if (entry->child) |
5430 | sd_free_ctl_entry(&entry->child); | |
cd790076 MM |
5431 | if (entry->proc_handler == NULL) |
5432 | kfree(entry->procname); | |
5433 | } | |
6382bc90 MM |
5434 | |
5435 | kfree(*tablep); | |
5436 | *tablep = NULL; | |
5437 | } | |
5438 | ||
e692ab53 | 5439 | static void |
e0361851 | 5440 | set_table_entry(struct ctl_table *entry, |
e692ab53 NP |
5441 | const char *procname, void *data, int maxlen, |
5442 | mode_t mode, proc_handler *proc_handler) | |
5443 | { | |
e692ab53 NP |
5444 | entry->procname = procname; |
5445 | entry->data = data; | |
5446 | entry->maxlen = maxlen; | |
5447 | entry->mode = mode; | |
5448 | entry->proc_handler = proc_handler; | |
5449 | } | |
5450 | ||
5451 | static struct ctl_table * | |
5452 | sd_alloc_ctl_domain_table(struct sched_domain *sd) | |
5453 | { | |
ace8b3d6 | 5454 | struct ctl_table *table = sd_alloc_ctl_entry(12); |
e692ab53 | 5455 | |
ad1cdc1d MM |
5456 | if (table == NULL) |
5457 | return NULL; | |
5458 | ||
e0361851 | 5459 | set_table_entry(&table[0], "min_interval", &sd->min_interval, |
e692ab53 | 5460 | sizeof(long), 0644, proc_doulongvec_minmax); |
e0361851 | 5461 | set_table_entry(&table[1], "max_interval", &sd->max_interval, |
e692ab53 | 5462 | sizeof(long), 0644, proc_doulongvec_minmax); |
e0361851 | 5463 | set_table_entry(&table[2], "busy_idx", &sd->busy_idx, |
e692ab53 | 5464 | sizeof(int), 0644, proc_dointvec_minmax); |
e0361851 | 5465 | set_table_entry(&table[3], "idle_idx", &sd->idle_idx, |
e692ab53 | 5466 | sizeof(int), 0644, proc_dointvec_minmax); |
e0361851 | 5467 | set_table_entry(&table[4], "newidle_idx", &sd->newidle_idx, |
e692ab53 | 5468 | sizeof(int), 0644, proc_dointvec_minmax); |
e0361851 | 5469 | set_table_entry(&table[5], "wake_idx", &sd->wake_idx, |
e692ab53 | 5470 | sizeof(int), 0644, proc_dointvec_minmax); |
e0361851 | 5471 | set_table_entry(&table[6], "forkexec_idx", &sd->forkexec_idx, |
e692ab53 | 5472 | sizeof(int), 0644, proc_dointvec_minmax); |
e0361851 | 5473 | set_table_entry(&table[7], "busy_factor", &sd->busy_factor, |
e692ab53 | 5474 | sizeof(int), 0644, proc_dointvec_minmax); |
e0361851 | 5475 | set_table_entry(&table[8], "imbalance_pct", &sd->imbalance_pct, |
e692ab53 | 5476 | sizeof(int), 0644, proc_dointvec_minmax); |
ace8b3d6 | 5477 | set_table_entry(&table[9], "cache_nice_tries", |
e692ab53 NP |
5478 | &sd->cache_nice_tries, |
5479 | sizeof(int), 0644, proc_dointvec_minmax); | |
ace8b3d6 | 5480 | set_table_entry(&table[10], "flags", &sd->flags, |
e692ab53 | 5481 | sizeof(int), 0644, proc_dointvec_minmax); |
6323469f | 5482 | /* &table[11] is terminator */ |
e692ab53 NP |
5483 | |
5484 | return table; | |
5485 | } | |
5486 | ||
8401f775 | 5487 | static ctl_table * sd_alloc_ctl_cpu_table(int cpu) |
e692ab53 NP |
5488 | { |
5489 | struct ctl_table *entry, *table; | |
5490 | struct sched_domain *sd; | |
5491 | int domain_num = 0, i; | |
5492 | char buf[32]; | |
5493 | ||
5494 | for_each_domain(cpu, sd) | |
5495 | domain_num++; | |
5496 | entry = table = sd_alloc_ctl_entry(domain_num + 1); | |
ad1cdc1d MM |
5497 | if (table == NULL) |
5498 | return NULL; | |
e692ab53 NP |
5499 | |
5500 | i = 0; | |
5501 | for_each_domain(cpu, sd) { | |
5502 | snprintf(buf, 32, "domain%d", i); | |
e692ab53 | 5503 | entry->procname = kstrdup(buf, GFP_KERNEL); |
c57baf1e | 5504 | entry->mode = 0555; |
e692ab53 NP |
5505 | entry->child = sd_alloc_ctl_domain_table(sd); |
5506 | entry++; | |
5507 | i++; | |
5508 | } | |
5509 | return table; | |
5510 | } | |
5511 | ||
5512 | static struct ctl_table_header *sd_sysctl_header; | |
6382bc90 | 5513 | static void register_sched_domain_sysctl(void) |
e692ab53 NP |
5514 | { |
5515 | int i, cpu_num = num_online_cpus(); | |
5516 | struct ctl_table *entry = sd_alloc_ctl_entry(cpu_num + 1); | |
5517 | char buf[32]; | |
5518 | ||
7378547f MM |
5519 | WARN_ON(sd_ctl_dir[0].child); |
5520 | sd_ctl_dir[0].child = entry; | |
5521 | ||
ad1cdc1d MM |
5522 | if (entry == NULL) |
5523 | return; | |
5524 | ||
97b6ea7b | 5525 | for_each_online_cpu(i) { |
e692ab53 | 5526 | snprintf(buf, 32, "cpu%d", i); |
e692ab53 | 5527 | entry->procname = kstrdup(buf, GFP_KERNEL); |
c57baf1e | 5528 | entry->mode = 0555; |
e692ab53 | 5529 | entry->child = sd_alloc_ctl_cpu_table(i); |
97b6ea7b | 5530 | entry++; |
e692ab53 | 5531 | } |
7378547f MM |
5532 | |
5533 | WARN_ON(sd_sysctl_header); | |
e692ab53 NP |
5534 | sd_sysctl_header = register_sysctl_table(sd_ctl_root); |
5535 | } | |
6382bc90 | 5536 | |
7378547f | 5537 | /* may be called multiple times per register */ |
6382bc90 MM |
5538 | static void unregister_sched_domain_sysctl(void) |
5539 | { | |
7378547f MM |
5540 | if (sd_sysctl_header) |
5541 | unregister_sysctl_table(sd_sysctl_header); | |
6382bc90 | 5542 | sd_sysctl_header = NULL; |
7378547f MM |
5543 | if (sd_ctl_dir[0].child) |
5544 | sd_free_ctl_entry(&sd_ctl_dir[0].child); | |
6382bc90 | 5545 | } |
e692ab53 | 5546 | #else |
6382bc90 MM |
5547 | static void register_sched_domain_sysctl(void) |
5548 | { | |
5549 | } | |
5550 | static void unregister_sched_domain_sysctl(void) | |
e692ab53 NP |
5551 | { |
5552 | } | |
5553 | #endif | |
5554 | ||
1da177e4 LT |
5555 | /* |
5556 | * migration_call - callback that gets triggered when a CPU is added. | |
5557 | * Here we can start up the necessary migration thread for the new CPU. | |
5558 | */ | |
48f24c4d IM |
5559 | static int __cpuinit |
5560 | migration_call(struct notifier_block *nfb, unsigned long action, void *hcpu) | |
1da177e4 | 5561 | { |
1da177e4 | 5562 | struct task_struct *p; |
48f24c4d | 5563 | int cpu = (long)hcpu; |
1da177e4 | 5564 | unsigned long flags; |
70b97a7f | 5565 | struct rq *rq; |
1da177e4 LT |
5566 | |
5567 | switch (action) { | |
5be9361c GS |
5568 | case CPU_LOCK_ACQUIRE: |
5569 | mutex_lock(&sched_hotcpu_mutex); | |
5570 | break; | |
5571 | ||
1da177e4 | 5572 | case CPU_UP_PREPARE: |
8bb78442 | 5573 | case CPU_UP_PREPARE_FROZEN: |
dd41f596 | 5574 | p = kthread_create(migration_thread, hcpu, "migration/%d", cpu); |
1da177e4 LT |
5575 | if (IS_ERR(p)) |
5576 | return NOTIFY_BAD; | |
1da177e4 LT |
5577 | kthread_bind(p, cpu); |
5578 | /* Must be high prio: stop_machine expects to yield to it. */ | |
5579 | rq = task_rq_lock(p, &flags); | |
dd41f596 | 5580 | __setscheduler(rq, p, SCHED_FIFO, MAX_RT_PRIO-1); |
1da177e4 LT |
5581 | task_rq_unlock(rq, &flags); |
5582 | cpu_rq(cpu)->migration_thread = p; | |
5583 | break; | |
48f24c4d | 5584 | |
1da177e4 | 5585 | case CPU_ONLINE: |
8bb78442 | 5586 | case CPU_ONLINE_FROZEN: |
3a4fa0a2 | 5587 | /* Strictly unnecessary, as first user will wake it. */ |
1da177e4 LT |
5588 | wake_up_process(cpu_rq(cpu)->migration_thread); |
5589 | break; | |
48f24c4d | 5590 | |
1da177e4 LT |
5591 | #ifdef CONFIG_HOTPLUG_CPU |
5592 | case CPU_UP_CANCELED: | |
8bb78442 | 5593 | case CPU_UP_CANCELED_FROZEN: |
fc75cdfa HC |
5594 | if (!cpu_rq(cpu)->migration_thread) |
5595 | break; | |
1da177e4 | 5596 | /* Unbind it from offline cpu so it can run. Fall thru. */ |
a4c4af7c HC |
5597 | kthread_bind(cpu_rq(cpu)->migration_thread, |
5598 | any_online_cpu(cpu_online_map)); | |
1da177e4 LT |
5599 | kthread_stop(cpu_rq(cpu)->migration_thread); |
5600 | cpu_rq(cpu)->migration_thread = NULL; | |
5601 | break; | |
48f24c4d | 5602 | |
1da177e4 | 5603 | case CPU_DEAD: |
8bb78442 | 5604 | case CPU_DEAD_FROZEN: |
470fd646 | 5605 | cpuset_lock(); /* around calls to cpuset_cpus_allowed_lock() */ |
1da177e4 LT |
5606 | migrate_live_tasks(cpu); |
5607 | rq = cpu_rq(cpu); | |
5608 | kthread_stop(rq->migration_thread); | |
5609 | rq->migration_thread = NULL; | |
5610 | /* Idle task back to normal (off runqueue, low prio) */ | |
d2da272a | 5611 | spin_lock_irq(&rq->lock); |
a8e504d2 | 5612 | update_rq_clock(rq); |
2e1cb74a | 5613 | deactivate_task(rq, rq->idle, 0); |
1da177e4 | 5614 | rq->idle->static_prio = MAX_PRIO; |
dd41f596 IM |
5615 | __setscheduler(rq, rq->idle, SCHED_NORMAL, 0); |
5616 | rq->idle->sched_class = &idle_sched_class; | |
1da177e4 | 5617 | migrate_dead_tasks(cpu); |
d2da272a | 5618 | spin_unlock_irq(&rq->lock); |
470fd646 | 5619 | cpuset_unlock(); |
1da177e4 LT |
5620 | migrate_nr_uninterruptible(rq); |
5621 | BUG_ON(rq->nr_running != 0); | |
5622 | ||
5623 | /* No need to migrate the tasks: it was best-effort if | |
5be9361c | 5624 | * they didn't take sched_hotcpu_mutex. Just wake up |
1da177e4 LT |
5625 | * the requestors. */ |
5626 | spin_lock_irq(&rq->lock); | |
5627 | while (!list_empty(&rq->migration_queue)) { | |
70b97a7f IM |
5628 | struct migration_req *req; |
5629 | ||
1da177e4 | 5630 | req = list_entry(rq->migration_queue.next, |
70b97a7f | 5631 | struct migration_req, list); |
1da177e4 LT |
5632 | list_del_init(&req->list); |
5633 | complete(&req->done); | |
5634 | } | |
5635 | spin_unlock_irq(&rq->lock); | |
5636 | break; | |
5637 | #endif | |
5be9361c GS |
5638 | case CPU_LOCK_RELEASE: |
5639 | mutex_unlock(&sched_hotcpu_mutex); | |
5640 | break; | |
1da177e4 LT |
5641 | } |
5642 | return NOTIFY_OK; | |
5643 | } | |
5644 | ||
5645 | /* Register at highest priority so that task migration (migrate_all_tasks) | |
5646 | * happens before everything else. | |
5647 | */ | |
26c2143b | 5648 | static struct notifier_block __cpuinitdata migration_notifier = { |
1da177e4 LT |
5649 | .notifier_call = migration_call, |
5650 | .priority = 10 | |
5651 | }; | |
5652 | ||
5653 | int __init migration_init(void) | |
5654 | { | |
5655 | void *cpu = (void *)(long)smp_processor_id(); | |
07dccf33 | 5656 | int err; |
48f24c4d IM |
5657 | |
5658 | /* Start one for the boot CPU: */ | |
07dccf33 AM |
5659 | err = migration_call(&migration_notifier, CPU_UP_PREPARE, cpu); |
5660 | BUG_ON(err == NOTIFY_BAD); | |
1da177e4 LT |
5661 | migration_call(&migration_notifier, CPU_ONLINE, cpu); |
5662 | register_cpu_notifier(&migration_notifier); | |
48f24c4d | 5663 | |
1da177e4 LT |
5664 | return 0; |
5665 | } | |
5666 | #endif | |
5667 | ||
5668 | #ifdef CONFIG_SMP | |
476f3534 CL |
5669 | |
5670 | /* Number of possible processor ids */ | |
5671 | int nr_cpu_ids __read_mostly = NR_CPUS; | |
5672 | EXPORT_SYMBOL(nr_cpu_ids); | |
5673 | ||
3e9830dc | 5674 | #ifdef CONFIG_SCHED_DEBUG |
4dcf6aff IM |
5675 | |
5676 | static int sched_domain_debug_one(struct sched_domain *sd, int cpu, int level) | |
1da177e4 | 5677 | { |
4dcf6aff IM |
5678 | struct sched_group *group = sd->groups; |
5679 | cpumask_t groupmask; | |
5680 | char str[NR_CPUS]; | |
1da177e4 | 5681 | |
4dcf6aff IM |
5682 | cpumask_scnprintf(str, NR_CPUS, sd->span); |
5683 | cpus_clear(groupmask); | |
5684 | ||
5685 | printk(KERN_DEBUG "%*s domain %d: ", level, "", level); | |
5686 | ||
5687 | if (!(sd->flags & SD_LOAD_BALANCE)) { | |
5688 | printk("does not load-balance\n"); | |
5689 | if (sd->parent) | |
5690 | printk(KERN_ERR "ERROR: !SD_LOAD_BALANCE domain" | |
5691 | " has parent"); | |
5692 | return -1; | |
41c7ce9a NP |
5693 | } |
5694 | ||
4dcf6aff IM |
5695 | printk(KERN_CONT "span %s\n", str); |
5696 | ||
5697 | if (!cpu_isset(cpu, sd->span)) { | |
5698 | printk(KERN_ERR "ERROR: domain->span does not contain " | |
5699 | "CPU%d\n", cpu); | |
5700 | } | |
5701 | if (!cpu_isset(cpu, group->cpumask)) { | |
5702 | printk(KERN_ERR "ERROR: domain->groups does not contain" | |
5703 | " CPU%d\n", cpu); | |
5704 | } | |
1da177e4 | 5705 | |
4dcf6aff | 5706 | printk(KERN_DEBUG "%*s groups:", level + 1, ""); |
1da177e4 | 5707 | do { |
4dcf6aff IM |
5708 | if (!group) { |
5709 | printk("\n"); | |
5710 | printk(KERN_ERR "ERROR: group is NULL\n"); | |
1da177e4 LT |
5711 | break; |
5712 | } | |
5713 | ||
4dcf6aff IM |
5714 | if (!group->__cpu_power) { |
5715 | printk(KERN_CONT "\n"); | |
5716 | printk(KERN_ERR "ERROR: domain->cpu_power not " | |
5717 | "set\n"); | |
5718 | break; | |
5719 | } | |
1da177e4 | 5720 | |
4dcf6aff IM |
5721 | if (!cpus_weight(group->cpumask)) { |
5722 | printk(KERN_CONT "\n"); | |
5723 | printk(KERN_ERR "ERROR: empty group\n"); | |
5724 | break; | |
5725 | } | |
1da177e4 | 5726 | |
4dcf6aff IM |
5727 | if (cpus_intersects(groupmask, group->cpumask)) { |
5728 | printk(KERN_CONT "\n"); | |
5729 | printk(KERN_ERR "ERROR: repeated CPUs\n"); | |
5730 | break; | |
5731 | } | |
1da177e4 | 5732 | |
4dcf6aff | 5733 | cpus_or(groupmask, groupmask, group->cpumask); |
1da177e4 | 5734 | |
4dcf6aff IM |
5735 | cpumask_scnprintf(str, NR_CPUS, group->cpumask); |
5736 | printk(KERN_CONT " %s", str); | |
1da177e4 | 5737 | |
4dcf6aff IM |
5738 | group = group->next; |
5739 | } while (group != sd->groups); | |
5740 | printk(KERN_CONT "\n"); | |
1da177e4 | 5741 | |
4dcf6aff IM |
5742 | if (!cpus_equal(sd->span, groupmask)) |
5743 | printk(KERN_ERR "ERROR: groups don't span domain->span\n"); | |
1da177e4 | 5744 | |
4dcf6aff IM |
5745 | if (sd->parent && !cpus_subset(groupmask, sd->parent->span)) |
5746 | printk(KERN_ERR "ERROR: parent span is not a superset " | |
5747 | "of domain->span\n"); | |
5748 | return 0; | |
5749 | } | |
1da177e4 | 5750 | |
4dcf6aff IM |
5751 | static void sched_domain_debug(struct sched_domain *sd, int cpu) |
5752 | { | |
5753 | int level = 0; | |
1da177e4 | 5754 | |
4dcf6aff IM |
5755 | if (!sd) { |
5756 | printk(KERN_DEBUG "CPU%d attaching NULL sched-domain.\n", cpu); | |
5757 | return; | |
5758 | } | |
1da177e4 | 5759 | |
4dcf6aff IM |
5760 | printk(KERN_DEBUG "CPU%d attaching sched-domain:\n", cpu); |
5761 | ||
5762 | for (;;) { | |
5763 | if (sched_domain_debug_one(sd, cpu, level)) | |
5764 | break; | |
1da177e4 LT |
5765 | level++; |
5766 | sd = sd->parent; | |
33859f7f | 5767 | if (!sd) |
4dcf6aff IM |
5768 | break; |
5769 | } | |
1da177e4 LT |
5770 | } |
5771 | #else | |
48f24c4d | 5772 | # define sched_domain_debug(sd, cpu) do { } while (0) |
1da177e4 LT |
5773 | #endif |
5774 | ||
1a20ff27 | 5775 | static int sd_degenerate(struct sched_domain *sd) |
245af2c7 SS |
5776 | { |
5777 | if (cpus_weight(sd->span) == 1) | |
5778 | return 1; | |
5779 | ||
5780 | /* Following flags need at least 2 groups */ | |
5781 | if (sd->flags & (SD_LOAD_BALANCE | | |
5782 | SD_BALANCE_NEWIDLE | | |
5783 | SD_BALANCE_FORK | | |
89c4710e SS |
5784 | SD_BALANCE_EXEC | |
5785 | SD_SHARE_CPUPOWER | | |
5786 | SD_SHARE_PKG_RESOURCES)) { | |
245af2c7 SS |
5787 | if (sd->groups != sd->groups->next) |
5788 | return 0; | |
5789 | } | |
5790 | ||
5791 | /* Following flags don't use groups */ | |
5792 | if (sd->flags & (SD_WAKE_IDLE | | |
5793 | SD_WAKE_AFFINE | | |
5794 | SD_WAKE_BALANCE)) | |
5795 | return 0; | |
5796 | ||
5797 | return 1; | |
5798 | } | |
5799 | ||
48f24c4d IM |
5800 | static int |
5801 | sd_parent_degenerate(struct sched_domain *sd, struct sched_domain *parent) | |
245af2c7 SS |
5802 | { |
5803 | unsigned long cflags = sd->flags, pflags = parent->flags; | |
5804 | ||
5805 | if (sd_degenerate(parent)) | |
5806 | return 1; | |
5807 | ||
5808 | if (!cpus_equal(sd->span, parent->span)) | |
5809 | return 0; | |
5810 | ||
5811 | /* Does parent contain flags not in child? */ | |
5812 | /* WAKE_BALANCE is a subset of WAKE_AFFINE */ | |
5813 | if (cflags & SD_WAKE_AFFINE) | |
5814 | pflags &= ~SD_WAKE_BALANCE; | |
5815 | /* Flags needing groups don't count if only 1 group in parent */ | |
5816 | if (parent->groups == parent->groups->next) { | |
5817 | pflags &= ~(SD_LOAD_BALANCE | | |
5818 | SD_BALANCE_NEWIDLE | | |
5819 | SD_BALANCE_FORK | | |
89c4710e SS |
5820 | SD_BALANCE_EXEC | |
5821 | SD_SHARE_CPUPOWER | | |
5822 | SD_SHARE_PKG_RESOURCES); | |
245af2c7 SS |
5823 | } |
5824 | if (~cflags & pflags) | |
5825 | return 0; | |
5826 | ||
5827 | return 1; | |
5828 | } | |
5829 | ||
1da177e4 LT |
5830 | /* |
5831 | * Attach the domain 'sd' to 'cpu' as its base domain. Callers must | |
5832 | * hold the hotplug lock. | |
5833 | */ | |
9c1cfda2 | 5834 | static void cpu_attach_domain(struct sched_domain *sd, int cpu) |
1da177e4 | 5835 | { |
70b97a7f | 5836 | struct rq *rq = cpu_rq(cpu); |
245af2c7 SS |
5837 | struct sched_domain *tmp; |
5838 | ||
5839 | /* Remove the sched domains which do not contribute to scheduling. */ | |
5840 | for (tmp = sd; tmp; tmp = tmp->parent) { | |
5841 | struct sched_domain *parent = tmp->parent; | |
5842 | if (!parent) | |
5843 | break; | |
1a848870 | 5844 | if (sd_parent_degenerate(tmp, parent)) { |
245af2c7 | 5845 | tmp->parent = parent->parent; |
1a848870 SS |
5846 | if (parent->parent) |
5847 | parent->parent->child = tmp; | |
5848 | } | |
245af2c7 SS |
5849 | } |
5850 | ||
1a848870 | 5851 | if (sd && sd_degenerate(sd)) { |
245af2c7 | 5852 | sd = sd->parent; |
1a848870 SS |
5853 | if (sd) |
5854 | sd->child = NULL; | |
5855 | } | |
1da177e4 LT |
5856 | |
5857 | sched_domain_debug(sd, cpu); | |
5858 | ||
674311d5 | 5859 | rcu_assign_pointer(rq->sd, sd); |
1da177e4 LT |
5860 | } |
5861 | ||
5862 | /* cpus with isolated domains */ | |
67af63a6 | 5863 | static cpumask_t cpu_isolated_map = CPU_MASK_NONE; |
1da177e4 LT |
5864 | |
5865 | /* Setup the mask of cpus configured for isolated domains */ | |
5866 | static int __init isolated_cpu_setup(char *str) | |
5867 | { | |
5868 | int ints[NR_CPUS], i; | |
5869 | ||
5870 | str = get_options(str, ARRAY_SIZE(ints), ints); | |
5871 | cpus_clear(cpu_isolated_map); | |
5872 | for (i = 1; i <= ints[0]; i++) | |
5873 | if (ints[i] < NR_CPUS) | |
5874 | cpu_set(ints[i], cpu_isolated_map); | |
5875 | return 1; | |
5876 | } | |
5877 | ||
8927f494 | 5878 | __setup("isolcpus=", isolated_cpu_setup); |
1da177e4 LT |
5879 | |
5880 | /* | |
6711cab4 SS |
5881 | * init_sched_build_groups takes the cpumask we wish to span, and a pointer |
5882 | * to a function which identifies what group(along with sched group) a CPU | |
5883 | * belongs to. The return value of group_fn must be a >= 0 and < NR_CPUS | |
5884 | * (due to the fact that we keep track of groups covered with a cpumask_t). | |
1da177e4 LT |
5885 | * |
5886 | * init_sched_build_groups will build a circular linked list of the groups | |
5887 | * covered by the given span, and will set each group's ->cpumask correctly, | |
5888 | * and ->cpu_power to 0. | |
5889 | */ | |
a616058b | 5890 | static void |
6711cab4 SS |
5891 | init_sched_build_groups(cpumask_t span, const cpumask_t *cpu_map, |
5892 | int (*group_fn)(int cpu, const cpumask_t *cpu_map, | |
5893 | struct sched_group **sg)) | |
1da177e4 LT |
5894 | { |
5895 | struct sched_group *first = NULL, *last = NULL; | |
5896 | cpumask_t covered = CPU_MASK_NONE; | |
5897 | int i; | |
5898 | ||
5899 | for_each_cpu_mask(i, span) { | |
6711cab4 SS |
5900 | struct sched_group *sg; |
5901 | int group = group_fn(i, cpu_map, &sg); | |
1da177e4 LT |
5902 | int j; |
5903 | ||
5904 | if (cpu_isset(i, covered)) | |
5905 | continue; | |
5906 | ||
5907 | sg->cpumask = CPU_MASK_NONE; | |
5517d86b | 5908 | sg->__cpu_power = 0; |
1da177e4 LT |
5909 | |
5910 | for_each_cpu_mask(j, span) { | |
6711cab4 | 5911 | if (group_fn(j, cpu_map, NULL) != group) |
1da177e4 LT |
5912 | continue; |
5913 | ||
5914 | cpu_set(j, covered); | |
5915 | cpu_set(j, sg->cpumask); | |
5916 | } | |
5917 | if (!first) | |
5918 | first = sg; | |
5919 | if (last) | |
5920 | last->next = sg; | |
5921 | last = sg; | |
5922 | } | |
5923 | last->next = first; | |
5924 | } | |
5925 | ||
9c1cfda2 | 5926 | #define SD_NODES_PER_DOMAIN 16 |
1da177e4 | 5927 | |
9c1cfda2 | 5928 | #ifdef CONFIG_NUMA |
198e2f18 | 5929 | |
9c1cfda2 JH |
5930 | /** |
5931 | * find_next_best_node - find the next node to include in a sched_domain | |
5932 | * @node: node whose sched_domain we're building | |
5933 | * @used_nodes: nodes already in the sched_domain | |
5934 | * | |
5935 | * Find the next node to include in a given scheduling domain. Simply | |
5936 | * finds the closest node not already in the @used_nodes map. | |
5937 | * | |
5938 | * Should use nodemask_t. | |
5939 | */ | |
5940 | static int find_next_best_node(int node, unsigned long *used_nodes) | |
5941 | { | |
5942 | int i, n, val, min_val, best_node = 0; | |
5943 | ||
5944 | min_val = INT_MAX; | |
5945 | ||
5946 | for (i = 0; i < MAX_NUMNODES; i++) { | |
5947 | /* Start at @node */ | |
5948 | n = (node + i) % MAX_NUMNODES; | |
5949 | ||
5950 | if (!nr_cpus_node(n)) | |
5951 | continue; | |
5952 | ||
5953 | /* Skip already used nodes */ | |
5954 | if (test_bit(n, used_nodes)) | |
5955 | continue; | |
5956 | ||
5957 | /* Simple min distance search */ | |
5958 | val = node_distance(node, n); | |
5959 | ||
5960 | if (val < min_val) { | |
5961 | min_val = val; | |
5962 | best_node = n; | |
5963 | } | |
5964 | } | |
5965 | ||
5966 | set_bit(best_node, used_nodes); | |
5967 | return best_node; | |
5968 | } | |
5969 | ||
5970 | /** | |
5971 | * sched_domain_node_span - get a cpumask for a node's sched_domain | |
5972 | * @node: node whose cpumask we're constructing | |
5973 | * @size: number of nodes to include in this span | |
5974 | * | |
5975 | * Given a node, construct a good cpumask for its sched_domain to span. It | |
5976 | * should be one that prevents unnecessary balancing, but also spreads tasks | |
5977 | * out optimally. | |
5978 | */ | |
5979 | static cpumask_t sched_domain_node_span(int node) | |
5980 | { | |
9c1cfda2 | 5981 | DECLARE_BITMAP(used_nodes, MAX_NUMNODES); |
48f24c4d IM |
5982 | cpumask_t span, nodemask; |
5983 | int i; | |
9c1cfda2 JH |
5984 | |
5985 | cpus_clear(span); | |
5986 | bitmap_zero(used_nodes, MAX_NUMNODES); | |
5987 | ||
5988 | nodemask = node_to_cpumask(node); | |
5989 | cpus_or(span, span, nodemask); | |
5990 | set_bit(node, used_nodes); | |
5991 | ||
5992 | for (i = 1; i < SD_NODES_PER_DOMAIN; i++) { | |
5993 | int next_node = find_next_best_node(node, used_nodes); | |
48f24c4d | 5994 | |
9c1cfda2 JH |
5995 | nodemask = node_to_cpumask(next_node); |
5996 | cpus_or(span, span, nodemask); | |
5997 | } | |
5998 | ||
5999 | return span; | |
6000 | } | |
6001 | #endif | |
6002 | ||
5c45bf27 | 6003 | int sched_smt_power_savings = 0, sched_mc_power_savings = 0; |
48f24c4d | 6004 | |
9c1cfda2 | 6005 | /* |
48f24c4d | 6006 | * SMT sched-domains: |
9c1cfda2 | 6007 | */ |
1da177e4 LT |
6008 | #ifdef CONFIG_SCHED_SMT |
6009 | static DEFINE_PER_CPU(struct sched_domain, cpu_domains); | |
6711cab4 | 6010 | static DEFINE_PER_CPU(struct sched_group, sched_group_cpus); |
48f24c4d | 6011 | |
6711cab4 SS |
6012 | static int cpu_to_cpu_group(int cpu, const cpumask_t *cpu_map, |
6013 | struct sched_group **sg) | |
1da177e4 | 6014 | { |
6711cab4 SS |
6015 | if (sg) |
6016 | *sg = &per_cpu(sched_group_cpus, cpu); | |
1da177e4 LT |
6017 | return cpu; |
6018 | } | |
6019 | #endif | |
6020 | ||
48f24c4d IM |
6021 | /* |
6022 | * multi-core sched-domains: | |
6023 | */ | |
1e9f28fa SS |
6024 | #ifdef CONFIG_SCHED_MC |
6025 | static DEFINE_PER_CPU(struct sched_domain, core_domains); | |
6711cab4 | 6026 | static DEFINE_PER_CPU(struct sched_group, sched_group_core); |
1e9f28fa SS |
6027 | #endif |
6028 | ||
6029 | #if defined(CONFIG_SCHED_MC) && defined(CONFIG_SCHED_SMT) | |
6711cab4 SS |
6030 | static int cpu_to_core_group(int cpu, const cpumask_t *cpu_map, |
6031 | struct sched_group **sg) | |
1e9f28fa | 6032 | { |
6711cab4 | 6033 | int group; |
d5a7430d | 6034 | cpumask_t mask = per_cpu(cpu_sibling_map, cpu); |
a616058b | 6035 | cpus_and(mask, mask, *cpu_map); |
6711cab4 SS |
6036 | group = first_cpu(mask); |
6037 | if (sg) | |
6038 | *sg = &per_cpu(sched_group_core, group); | |
6039 | return group; | |
1e9f28fa SS |
6040 | } |
6041 | #elif defined(CONFIG_SCHED_MC) | |
6711cab4 SS |
6042 | static int cpu_to_core_group(int cpu, const cpumask_t *cpu_map, |
6043 | struct sched_group **sg) | |
1e9f28fa | 6044 | { |
6711cab4 SS |
6045 | if (sg) |
6046 | *sg = &per_cpu(sched_group_core, cpu); | |
1e9f28fa SS |
6047 | return cpu; |
6048 | } | |
6049 | #endif | |
6050 | ||
1da177e4 | 6051 | static DEFINE_PER_CPU(struct sched_domain, phys_domains); |
6711cab4 | 6052 | static DEFINE_PER_CPU(struct sched_group, sched_group_phys); |
48f24c4d | 6053 | |
6711cab4 SS |
6054 | static int cpu_to_phys_group(int cpu, const cpumask_t *cpu_map, |
6055 | struct sched_group **sg) | |
1da177e4 | 6056 | { |
6711cab4 | 6057 | int group; |
48f24c4d | 6058 | #ifdef CONFIG_SCHED_MC |
1e9f28fa | 6059 | cpumask_t mask = cpu_coregroup_map(cpu); |
a616058b | 6060 | cpus_and(mask, mask, *cpu_map); |
6711cab4 | 6061 | group = first_cpu(mask); |
1e9f28fa | 6062 | #elif defined(CONFIG_SCHED_SMT) |
d5a7430d | 6063 | cpumask_t mask = per_cpu(cpu_sibling_map, cpu); |
a616058b | 6064 | cpus_and(mask, mask, *cpu_map); |
6711cab4 | 6065 | group = first_cpu(mask); |
1da177e4 | 6066 | #else |
6711cab4 | 6067 | group = cpu; |
1da177e4 | 6068 | #endif |
6711cab4 SS |
6069 | if (sg) |
6070 | *sg = &per_cpu(sched_group_phys, group); | |
6071 | return group; | |
1da177e4 LT |
6072 | } |
6073 | ||
6074 | #ifdef CONFIG_NUMA | |
1da177e4 | 6075 | /* |
9c1cfda2 JH |
6076 | * The init_sched_build_groups can't handle what we want to do with node |
6077 | * groups, so roll our own. Now each node has its own list of groups which | |
6078 | * gets dynamically allocated. | |
1da177e4 | 6079 | */ |
9c1cfda2 | 6080 | static DEFINE_PER_CPU(struct sched_domain, node_domains); |
d1b55138 | 6081 | static struct sched_group **sched_group_nodes_bycpu[NR_CPUS]; |
1da177e4 | 6082 | |
9c1cfda2 | 6083 | static DEFINE_PER_CPU(struct sched_domain, allnodes_domains); |
6711cab4 | 6084 | static DEFINE_PER_CPU(struct sched_group, sched_group_allnodes); |
9c1cfda2 | 6085 | |
6711cab4 SS |
6086 | static int cpu_to_allnodes_group(int cpu, const cpumask_t *cpu_map, |
6087 | struct sched_group **sg) | |
9c1cfda2 | 6088 | { |
6711cab4 SS |
6089 | cpumask_t nodemask = node_to_cpumask(cpu_to_node(cpu)); |
6090 | int group; | |
6091 | ||
6092 | cpus_and(nodemask, nodemask, *cpu_map); | |
6093 | group = first_cpu(nodemask); | |
6094 | ||
6095 | if (sg) | |
6096 | *sg = &per_cpu(sched_group_allnodes, group); | |
6097 | return group; | |
1da177e4 | 6098 | } |
6711cab4 | 6099 | |
08069033 SS |
6100 | static void init_numa_sched_groups_power(struct sched_group *group_head) |
6101 | { | |
6102 | struct sched_group *sg = group_head; | |
6103 | int j; | |
6104 | ||
6105 | if (!sg) | |
6106 | return; | |
3a5c359a AK |
6107 | do { |
6108 | for_each_cpu_mask(j, sg->cpumask) { | |
6109 | struct sched_domain *sd; | |
08069033 | 6110 | |
3a5c359a AK |
6111 | sd = &per_cpu(phys_domains, j); |
6112 | if (j != first_cpu(sd->groups->cpumask)) { | |
6113 | /* | |
6114 | * Only add "power" once for each | |
6115 | * physical package. | |
6116 | */ | |
6117 | continue; | |
6118 | } | |
08069033 | 6119 | |
3a5c359a AK |
6120 | sg_inc_cpu_power(sg, sd->groups->__cpu_power); |
6121 | } | |
6122 | sg = sg->next; | |
6123 | } while (sg != group_head); | |
08069033 | 6124 | } |
1da177e4 LT |
6125 | #endif |
6126 | ||
a616058b | 6127 | #ifdef CONFIG_NUMA |
51888ca2 SV |
6128 | /* Free memory allocated for various sched_group structures */ |
6129 | static void free_sched_groups(const cpumask_t *cpu_map) | |
6130 | { | |
a616058b | 6131 | int cpu, i; |
51888ca2 SV |
6132 | |
6133 | for_each_cpu_mask(cpu, *cpu_map) { | |
51888ca2 SV |
6134 | struct sched_group **sched_group_nodes |
6135 | = sched_group_nodes_bycpu[cpu]; | |
6136 | ||
51888ca2 SV |
6137 | if (!sched_group_nodes) |
6138 | continue; | |
6139 | ||
6140 | for (i = 0; i < MAX_NUMNODES; i++) { | |
6141 | cpumask_t nodemask = node_to_cpumask(i); | |
6142 | struct sched_group *oldsg, *sg = sched_group_nodes[i]; | |
6143 | ||
6144 | cpus_and(nodemask, nodemask, *cpu_map); | |
6145 | if (cpus_empty(nodemask)) | |
6146 | continue; | |
6147 | ||
6148 | if (sg == NULL) | |
6149 | continue; | |
6150 | sg = sg->next; | |
6151 | next_sg: | |
6152 | oldsg = sg; | |
6153 | sg = sg->next; | |
6154 | kfree(oldsg); | |
6155 | if (oldsg != sched_group_nodes[i]) | |
6156 | goto next_sg; | |
6157 | } | |
6158 | kfree(sched_group_nodes); | |
6159 | sched_group_nodes_bycpu[cpu] = NULL; | |
6160 | } | |
51888ca2 | 6161 | } |
a616058b SS |
6162 | #else |
6163 | static void free_sched_groups(const cpumask_t *cpu_map) | |
6164 | { | |
6165 | } | |
6166 | #endif | |
51888ca2 | 6167 | |
89c4710e SS |
6168 | /* |
6169 | * Initialize sched groups cpu_power. | |
6170 | * | |
6171 | * cpu_power indicates the capacity of sched group, which is used while | |
6172 | * distributing the load between different sched groups in a sched domain. | |
6173 | * Typically cpu_power for all the groups in a sched domain will be same unless | |
6174 | * there are asymmetries in the topology. If there are asymmetries, group | |
6175 | * having more cpu_power will pickup more load compared to the group having | |
6176 | * less cpu_power. | |
6177 | * | |
6178 | * cpu_power will be a multiple of SCHED_LOAD_SCALE. This multiple represents | |
6179 | * the maximum number of tasks a group can handle in the presence of other idle | |
6180 | * or lightly loaded groups in the same sched domain. | |
6181 | */ | |
6182 | static void init_sched_groups_power(int cpu, struct sched_domain *sd) | |
6183 | { | |
6184 | struct sched_domain *child; | |
6185 | struct sched_group *group; | |
6186 | ||
6187 | WARN_ON(!sd || !sd->groups); | |
6188 | ||
6189 | if (cpu != first_cpu(sd->groups->cpumask)) | |
6190 | return; | |
6191 | ||
6192 | child = sd->child; | |
6193 | ||
5517d86b ED |
6194 | sd->groups->__cpu_power = 0; |
6195 | ||
89c4710e SS |
6196 | /* |
6197 | * For perf policy, if the groups in child domain share resources | |
6198 | * (for example cores sharing some portions of the cache hierarchy | |
6199 | * or SMT), then set this domain groups cpu_power such that each group | |
6200 | * can handle only one task, when there are other idle groups in the | |
6201 | * same sched domain. | |
6202 | */ | |
6203 | if (!child || (!(sd->flags & SD_POWERSAVINGS_BALANCE) && | |
6204 | (child->flags & | |
6205 | (SD_SHARE_CPUPOWER | SD_SHARE_PKG_RESOURCES)))) { | |
5517d86b | 6206 | sg_inc_cpu_power(sd->groups, SCHED_LOAD_SCALE); |
89c4710e SS |
6207 | return; |
6208 | } | |
6209 | ||
89c4710e SS |
6210 | /* |
6211 | * add cpu_power of each child group to this groups cpu_power | |
6212 | */ | |
6213 | group = child->groups; | |
6214 | do { | |
5517d86b | 6215 | sg_inc_cpu_power(sd->groups, group->__cpu_power); |
89c4710e SS |
6216 | group = group->next; |
6217 | } while (group != child->groups); | |
6218 | } | |
6219 | ||
1da177e4 | 6220 | /* |
1a20ff27 DG |
6221 | * Build sched domains for a given set of cpus and attach the sched domains |
6222 | * to the individual cpus | |
1da177e4 | 6223 | */ |
51888ca2 | 6224 | static int build_sched_domains(const cpumask_t *cpu_map) |
1da177e4 LT |
6225 | { |
6226 | int i; | |
d1b55138 JH |
6227 | #ifdef CONFIG_NUMA |
6228 | struct sched_group **sched_group_nodes = NULL; | |
6711cab4 | 6229 | int sd_allnodes = 0; |
d1b55138 JH |
6230 | |
6231 | /* | |
6232 | * Allocate the per-node list of sched groups | |
6233 | */ | |
5cf9f062 | 6234 | sched_group_nodes = kcalloc(MAX_NUMNODES, sizeof(struct sched_group *), |
d3a5aa98 | 6235 | GFP_KERNEL); |
d1b55138 JH |
6236 | if (!sched_group_nodes) { |
6237 | printk(KERN_WARNING "Can not alloc sched group node list\n"); | |
51888ca2 | 6238 | return -ENOMEM; |
d1b55138 JH |
6239 | } |
6240 | sched_group_nodes_bycpu[first_cpu(*cpu_map)] = sched_group_nodes; | |
6241 | #endif | |
1da177e4 LT |
6242 | |
6243 | /* | |
1a20ff27 | 6244 | * Set up domains for cpus specified by the cpu_map. |
1da177e4 | 6245 | */ |
1a20ff27 | 6246 | for_each_cpu_mask(i, *cpu_map) { |
1da177e4 LT |
6247 | struct sched_domain *sd = NULL, *p; |
6248 | cpumask_t nodemask = node_to_cpumask(cpu_to_node(i)); | |
6249 | ||
1a20ff27 | 6250 | cpus_and(nodemask, nodemask, *cpu_map); |
1da177e4 LT |
6251 | |
6252 | #ifdef CONFIG_NUMA | |
dd41f596 IM |
6253 | if (cpus_weight(*cpu_map) > |
6254 | SD_NODES_PER_DOMAIN*cpus_weight(nodemask)) { | |
9c1cfda2 JH |
6255 | sd = &per_cpu(allnodes_domains, i); |
6256 | *sd = SD_ALLNODES_INIT; | |
6257 | sd->span = *cpu_map; | |
6711cab4 | 6258 | cpu_to_allnodes_group(i, cpu_map, &sd->groups); |
9c1cfda2 | 6259 | p = sd; |
6711cab4 | 6260 | sd_allnodes = 1; |
9c1cfda2 JH |
6261 | } else |
6262 | p = NULL; | |
6263 | ||
1da177e4 | 6264 | sd = &per_cpu(node_domains, i); |
1da177e4 | 6265 | *sd = SD_NODE_INIT; |
9c1cfda2 JH |
6266 | sd->span = sched_domain_node_span(cpu_to_node(i)); |
6267 | sd->parent = p; | |
1a848870 SS |
6268 | if (p) |
6269 | p->child = sd; | |
9c1cfda2 | 6270 | cpus_and(sd->span, sd->span, *cpu_map); |
1da177e4 LT |
6271 | #endif |
6272 | ||
6273 | p = sd; | |
6274 | sd = &per_cpu(phys_domains, i); | |
1da177e4 LT |
6275 | *sd = SD_CPU_INIT; |
6276 | sd->span = nodemask; | |
6277 | sd->parent = p; | |
1a848870 SS |
6278 | if (p) |
6279 | p->child = sd; | |
6711cab4 | 6280 | cpu_to_phys_group(i, cpu_map, &sd->groups); |
1da177e4 | 6281 | |
1e9f28fa SS |
6282 | #ifdef CONFIG_SCHED_MC |
6283 | p = sd; | |
6284 | sd = &per_cpu(core_domains, i); | |
1e9f28fa SS |
6285 | *sd = SD_MC_INIT; |
6286 | sd->span = cpu_coregroup_map(i); | |
6287 | cpus_and(sd->span, sd->span, *cpu_map); | |
6288 | sd->parent = p; | |
1a848870 | 6289 | p->child = sd; |
6711cab4 | 6290 | cpu_to_core_group(i, cpu_map, &sd->groups); |
1e9f28fa SS |
6291 | #endif |
6292 | ||
1da177e4 LT |
6293 | #ifdef CONFIG_SCHED_SMT |
6294 | p = sd; | |
6295 | sd = &per_cpu(cpu_domains, i); | |
1da177e4 | 6296 | *sd = SD_SIBLING_INIT; |
d5a7430d | 6297 | sd->span = per_cpu(cpu_sibling_map, i); |
1a20ff27 | 6298 | cpus_and(sd->span, sd->span, *cpu_map); |
1da177e4 | 6299 | sd->parent = p; |
1a848870 | 6300 | p->child = sd; |
6711cab4 | 6301 | cpu_to_cpu_group(i, cpu_map, &sd->groups); |
1da177e4 LT |
6302 | #endif |
6303 | } | |
6304 | ||
6305 | #ifdef CONFIG_SCHED_SMT | |
6306 | /* Set up CPU (sibling) groups */ | |
9c1cfda2 | 6307 | for_each_cpu_mask(i, *cpu_map) { |
d5a7430d | 6308 | cpumask_t this_sibling_map = per_cpu(cpu_sibling_map, i); |
1a20ff27 | 6309 | cpus_and(this_sibling_map, this_sibling_map, *cpu_map); |
1da177e4 LT |
6310 | if (i != first_cpu(this_sibling_map)) |
6311 | continue; | |
6312 | ||
dd41f596 IM |
6313 | init_sched_build_groups(this_sibling_map, cpu_map, |
6314 | &cpu_to_cpu_group); | |
1da177e4 LT |
6315 | } |
6316 | #endif | |
6317 | ||
1e9f28fa SS |
6318 | #ifdef CONFIG_SCHED_MC |
6319 | /* Set up multi-core groups */ | |
6320 | for_each_cpu_mask(i, *cpu_map) { | |
6321 | cpumask_t this_core_map = cpu_coregroup_map(i); | |
6322 | cpus_and(this_core_map, this_core_map, *cpu_map); | |
6323 | if (i != first_cpu(this_core_map)) | |
6324 | continue; | |
dd41f596 IM |
6325 | init_sched_build_groups(this_core_map, cpu_map, |
6326 | &cpu_to_core_group); | |
1e9f28fa SS |
6327 | } |
6328 | #endif | |
6329 | ||
1da177e4 LT |
6330 | /* Set up physical groups */ |
6331 | for (i = 0; i < MAX_NUMNODES; i++) { | |
6332 | cpumask_t nodemask = node_to_cpumask(i); | |
6333 | ||
1a20ff27 | 6334 | cpus_and(nodemask, nodemask, *cpu_map); |
1da177e4 LT |
6335 | if (cpus_empty(nodemask)) |
6336 | continue; | |
6337 | ||
6711cab4 | 6338 | init_sched_build_groups(nodemask, cpu_map, &cpu_to_phys_group); |
1da177e4 LT |
6339 | } |
6340 | ||
6341 | #ifdef CONFIG_NUMA | |
6342 | /* Set up node groups */ | |
6711cab4 | 6343 | if (sd_allnodes) |
dd41f596 IM |
6344 | init_sched_build_groups(*cpu_map, cpu_map, |
6345 | &cpu_to_allnodes_group); | |
9c1cfda2 JH |
6346 | |
6347 | for (i = 0; i < MAX_NUMNODES; i++) { | |
6348 | /* Set up node groups */ | |
6349 | struct sched_group *sg, *prev; | |
6350 | cpumask_t nodemask = node_to_cpumask(i); | |
6351 | cpumask_t domainspan; | |
6352 | cpumask_t covered = CPU_MASK_NONE; | |
6353 | int j; | |
6354 | ||
6355 | cpus_and(nodemask, nodemask, *cpu_map); | |
d1b55138 JH |
6356 | if (cpus_empty(nodemask)) { |
6357 | sched_group_nodes[i] = NULL; | |
9c1cfda2 | 6358 | continue; |
d1b55138 | 6359 | } |
9c1cfda2 JH |
6360 | |
6361 | domainspan = sched_domain_node_span(i); | |
6362 | cpus_and(domainspan, domainspan, *cpu_map); | |
6363 | ||
15f0b676 | 6364 | sg = kmalloc_node(sizeof(struct sched_group), GFP_KERNEL, i); |
51888ca2 SV |
6365 | if (!sg) { |
6366 | printk(KERN_WARNING "Can not alloc domain group for " | |
6367 | "node %d\n", i); | |
6368 | goto error; | |
6369 | } | |
9c1cfda2 JH |
6370 | sched_group_nodes[i] = sg; |
6371 | for_each_cpu_mask(j, nodemask) { | |
6372 | struct sched_domain *sd; | |
9761eea8 | 6373 | |
9c1cfda2 JH |
6374 | sd = &per_cpu(node_domains, j); |
6375 | sd->groups = sg; | |
9c1cfda2 | 6376 | } |
5517d86b | 6377 | sg->__cpu_power = 0; |
9c1cfda2 | 6378 | sg->cpumask = nodemask; |
51888ca2 | 6379 | sg->next = sg; |
9c1cfda2 JH |
6380 | cpus_or(covered, covered, nodemask); |
6381 | prev = sg; | |
6382 | ||
6383 | for (j = 0; j < MAX_NUMNODES; j++) { | |
6384 | cpumask_t tmp, notcovered; | |
6385 | int n = (i + j) % MAX_NUMNODES; | |
6386 | ||
6387 | cpus_complement(notcovered, covered); | |
6388 | cpus_and(tmp, notcovered, *cpu_map); | |
6389 | cpus_and(tmp, tmp, domainspan); | |
6390 | if (cpus_empty(tmp)) | |
6391 | break; | |
6392 | ||
6393 | nodemask = node_to_cpumask(n); | |
6394 | cpus_and(tmp, tmp, nodemask); | |
6395 | if (cpus_empty(tmp)) | |
6396 | continue; | |
6397 | ||
15f0b676 SV |
6398 | sg = kmalloc_node(sizeof(struct sched_group), |
6399 | GFP_KERNEL, i); | |
9c1cfda2 JH |
6400 | if (!sg) { |
6401 | printk(KERN_WARNING | |
6402 | "Can not alloc domain group for node %d\n", j); | |
51888ca2 | 6403 | goto error; |
9c1cfda2 | 6404 | } |
5517d86b | 6405 | sg->__cpu_power = 0; |
9c1cfda2 | 6406 | sg->cpumask = tmp; |
51888ca2 | 6407 | sg->next = prev->next; |
9c1cfda2 JH |
6408 | cpus_or(covered, covered, tmp); |
6409 | prev->next = sg; | |
6410 | prev = sg; | |
6411 | } | |
9c1cfda2 | 6412 | } |
1da177e4 LT |
6413 | #endif |
6414 | ||
6415 | /* Calculate CPU power for physical packages and nodes */ | |
5c45bf27 | 6416 | #ifdef CONFIG_SCHED_SMT |
1a20ff27 | 6417 | for_each_cpu_mask(i, *cpu_map) { |
dd41f596 IM |
6418 | struct sched_domain *sd = &per_cpu(cpu_domains, i); |
6419 | ||
89c4710e | 6420 | init_sched_groups_power(i, sd); |
5c45bf27 | 6421 | } |
1da177e4 | 6422 | #endif |
1e9f28fa | 6423 | #ifdef CONFIG_SCHED_MC |
5c45bf27 | 6424 | for_each_cpu_mask(i, *cpu_map) { |
dd41f596 IM |
6425 | struct sched_domain *sd = &per_cpu(core_domains, i); |
6426 | ||
89c4710e | 6427 | init_sched_groups_power(i, sd); |
5c45bf27 SS |
6428 | } |
6429 | #endif | |
1e9f28fa | 6430 | |
5c45bf27 | 6431 | for_each_cpu_mask(i, *cpu_map) { |
dd41f596 IM |
6432 | struct sched_domain *sd = &per_cpu(phys_domains, i); |
6433 | ||
89c4710e | 6434 | init_sched_groups_power(i, sd); |
1da177e4 LT |
6435 | } |
6436 | ||
9c1cfda2 | 6437 | #ifdef CONFIG_NUMA |
08069033 SS |
6438 | for (i = 0; i < MAX_NUMNODES; i++) |
6439 | init_numa_sched_groups_power(sched_group_nodes[i]); | |
9c1cfda2 | 6440 | |
6711cab4 SS |
6441 | if (sd_allnodes) { |
6442 | struct sched_group *sg; | |
f712c0c7 | 6443 | |
6711cab4 | 6444 | cpu_to_allnodes_group(first_cpu(*cpu_map), cpu_map, &sg); |
f712c0c7 SS |
6445 | init_numa_sched_groups_power(sg); |
6446 | } | |
9c1cfda2 JH |
6447 | #endif |
6448 | ||
1da177e4 | 6449 | /* Attach the domains */ |
1a20ff27 | 6450 | for_each_cpu_mask(i, *cpu_map) { |
1da177e4 LT |
6451 | struct sched_domain *sd; |
6452 | #ifdef CONFIG_SCHED_SMT | |
6453 | sd = &per_cpu(cpu_domains, i); | |
1e9f28fa SS |
6454 | #elif defined(CONFIG_SCHED_MC) |
6455 | sd = &per_cpu(core_domains, i); | |
1da177e4 LT |
6456 | #else |
6457 | sd = &per_cpu(phys_domains, i); | |
6458 | #endif | |
6459 | cpu_attach_domain(sd, i); | |
6460 | } | |
51888ca2 SV |
6461 | |
6462 | return 0; | |
6463 | ||
a616058b | 6464 | #ifdef CONFIG_NUMA |
51888ca2 SV |
6465 | error: |
6466 | free_sched_groups(cpu_map); | |
6467 | return -ENOMEM; | |
a616058b | 6468 | #endif |
1da177e4 | 6469 | } |
029190c5 PJ |
6470 | |
6471 | static cpumask_t *doms_cur; /* current sched domains */ | |
6472 | static int ndoms_cur; /* number of sched domains in 'doms_cur' */ | |
6473 | ||
6474 | /* | |
6475 | * Special case: If a kmalloc of a doms_cur partition (array of | |
6476 | * cpumask_t) fails, then fallback to a single sched domain, | |
6477 | * as determined by the single cpumask_t fallback_doms. | |
6478 | */ | |
6479 | static cpumask_t fallback_doms; | |
6480 | ||
1a20ff27 DG |
6481 | /* |
6482 | * Set up scheduler domains and groups. Callers must hold the hotplug lock. | |
029190c5 PJ |
6483 | * For now this just excludes isolated cpus, but could be used to |
6484 | * exclude other special cases in the future. | |
1a20ff27 | 6485 | */ |
51888ca2 | 6486 | static int arch_init_sched_domains(const cpumask_t *cpu_map) |
1a20ff27 | 6487 | { |
7378547f MM |
6488 | int err; |
6489 | ||
029190c5 PJ |
6490 | ndoms_cur = 1; |
6491 | doms_cur = kmalloc(sizeof(cpumask_t), GFP_KERNEL); | |
6492 | if (!doms_cur) | |
6493 | doms_cur = &fallback_doms; | |
6494 | cpus_andnot(*doms_cur, *cpu_map, cpu_isolated_map); | |
7378547f | 6495 | err = build_sched_domains(doms_cur); |
6382bc90 | 6496 | register_sched_domain_sysctl(); |
7378547f MM |
6497 | |
6498 | return err; | |
1a20ff27 DG |
6499 | } |
6500 | ||
6501 | static void arch_destroy_sched_domains(const cpumask_t *cpu_map) | |
1da177e4 | 6502 | { |
51888ca2 | 6503 | free_sched_groups(cpu_map); |
9c1cfda2 | 6504 | } |
1da177e4 | 6505 | |
1a20ff27 DG |
6506 | /* |
6507 | * Detach sched domains from a group of cpus specified in cpu_map | |
6508 | * These cpus will now be attached to the NULL domain | |
6509 | */ | |
858119e1 | 6510 | static void detach_destroy_domains(const cpumask_t *cpu_map) |
1a20ff27 DG |
6511 | { |
6512 | int i; | |
6513 | ||
6382bc90 MM |
6514 | unregister_sched_domain_sysctl(); |
6515 | ||
1a20ff27 DG |
6516 | for_each_cpu_mask(i, *cpu_map) |
6517 | cpu_attach_domain(NULL, i); | |
6518 | synchronize_sched(); | |
6519 | arch_destroy_sched_domains(cpu_map); | |
6520 | } | |
6521 | ||
029190c5 PJ |
6522 | /* |
6523 | * Partition sched domains as specified by the 'ndoms_new' | |
6524 | * cpumasks in the array doms_new[] of cpumasks. This compares | |
6525 | * doms_new[] to the current sched domain partitioning, doms_cur[]. | |
6526 | * It destroys each deleted domain and builds each new domain. | |
6527 | * | |
6528 | * 'doms_new' is an array of cpumask_t's of length 'ndoms_new'. | |
6529 | * The masks don't intersect (don't overlap.) We should setup one | |
6530 | * sched domain for each mask. CPUs not in any of the cpumasks will | |
6531 | * not be load balanced. If the same cpumask appears both in the | |
6532 | * current 'doms_cur' domains and in the new 'doms_new', we can leave | |
6533 | * it as it is. | |
6534 | * | |
6535 | * The passed in 'doms_new' should be kmalloc'd. This routine takes | |
6536 | * ownership of it and will kfree it when done with it. If the caller | |
6537 | * failed the kmalloc call, then it can pass in doms_new == NULL, | |
6538 | * and partition_sched_domains() will fallback to the single partition | |
6539 | * 'fallback_doms'. | |
6540 | * | |
6541 | * Call with hotplug lock held | |
6542 | */ | |
6543 | void partition_sched_domains(int ndoms_new, cpumask_t *doms_new) | |
6544 | { | |
6545 | int i, j; | |
6546 | ||
7378547f MM |
6547 | /* always unregister in case we don't destroy any domains */ |
6548 | unregister_sched_domain_sysctl(); | |
6549 | ||
029190c5 PJ |
6550 | if (doms_new == NULL) { |
6551 | ndoms_new = 1; | |
6552 | doms_new = &fallback_doms; | |
6553 | cpus_andnot(doms_new[0], cpu_online_map, cpu_isolated_map); | |
6554 | } | |
6555 | ||
6556 | /* Destroy deleted domains */ | |
6557 | for (i = 0; i < ndoms_cur; i++) { | |
6558 | for (j = 0; j < ndoms_new; j++) { | |
6559 | if (cpus_equal(doms_cur[i], doms_new[j])) | |
6560 | goto match1; | |
6561 | } | |
6562 | /* no match - a current sched domain not in new doms_new[] */ | |
6563 | detach_destroy_domains(doms_cur + i); | |
6564 | match1: | |
6565 | ; | |
6566 | } | |
6567 | ||
6568 | /* Build new domains */ | |
6569 | for (i = 0; i < ndoms_new; i++) { | |
6570 | for (j = 0; j < ndoms_cur; j++) { | |
6571 | if (cpus_equal(doms_new[i], doms_cur[j])) | |
6572 | goto match2; | |
6573 | } | |
6574 | /* no match - add a new doms_new */ | |
6575 | build_sched_domains(doms_new + i); | |
6576 | match2: | |
6577 | ; | |
6578 | } | |
6579 | ||
6580 | /* Remember the new sched domains */ | |
6581 | if (doms_cur != &fallback_doms) | |
6582 | kfree(doms_cur); | |
6583 | doms_cur = doms_new; | |
6584 | ndoms_cur = ndoms_new; | |
7378547f MM |
6585 | |
6586 | register_sched_domain_sysctl(); | |
029190c5 PJ |
6587 | } |
6588 | ||
5c45bf27 | 6589 | #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT) |
6707de00 | 6590 | static int arch_reinit_sched_domains(void) |
5c45bf27 SS |
6591 | { |
6592 | int err; | |
6593 | ||
5be9361c | 6594 | mutex_lock(&sched_hotcpu_mutex); |
5c45bf27 SS |
6595 | detach_destroy_domains(&cpu_online_map); |
6596 | err = arch_init_sched_domains(&cpu_online_map); | |
5be9361c | 6597 | mutex_unlock(&sched_hotcpu_mutex); |
5c45bf27 SS |
6598 | |
6599 | return err; | |
6600 | } | |
6601 | ||
6602 | static ssize_t sched_power_savings_store(const char *buf, size_t count, int smt) | |
6603 | { | |
6604 | int ret; | |
6605 | ||
6606 | if (buf[0] != '0' && buf[0] != '1') | |
6607 | return -EINVAL; | |
6608 | ||
6609 | if (smt) | |
6610 | sched_smt_power_savings = (buf[0] == '1'); | |
6611 | else | |
6612 | sched_mc_power_savings = (buf[0] == '1'); | |
6613 | ||
6614 | ret = arch_reinit_sched_domains(); | |
6615 | ||
6616 | return ret ? ret : count; | |
6617 | } | |
6618 | ||
5c45bf27 SS |
6619 | #ifdef CONFIG_SCHED_MC |
6620 | static ssize_t sched_mc_power_savings_show(struct sys_device *dev, char *page) | |
6621 | { | |
6622 | return sprintf(page, "%u\n", sched_mc_power_savings); | |
6623 | } | |
48f24c4d IM |
6624 | static ssize_t sched_mc_power_savings_store(struct sys_device *dev, |
6625 | const char *buf, size_t count) | |
5c45bf27 SS |
6626 | { |
6627 | return sched_power_savings_store(buf, count, 0); | |
6628 | } | |
6707de00 AB |
6629 | static SYSDEV_ATTR(sched_mc_power_savings, 0644, sched_mc_power_savings_show, |
6630 | sched_mc_power_savings_store); | |
5c45bf27 SS |
6631 | #endif |
6632 | ||
6633 | #ifdef CONFIG_SCHED_SMT | |
6634 | static ssize_t sched_smt_power_savings_show(struct sys_device *dev, char *page) | |
6635 | { | |
6636 | return sprintf(page, "%u\n", sched_smt_power_savings); | |
6637 | } | |
48f24c4d IM |
6638 | static ssize_t sched_smt_power_savings_store(struct sys_device *dev, |
6639 | const char *buf, size_t count) | |
5c45bf27 SS |
6640 | { |
6641 | return sched_power_savings_store(buf, count, 1); | |
6642 | } | |
6707de00 AB |
6643 | static SYSDEV_ATTR(sched_smt_power_savings, 0644, sched_smt_power_savings_show, |
6644 | sched_smt_power_savings_store); | |
6645 | #endif | |
6646 | ||
6647 | int sched_create_sysfs_power_savings_entries(struct sysdev_class *cls) | |
6648 | { | |
6649 | int err = 0; | |
6650 | ||
6651 | #ifdef CONFIG_SCHED_SMT | |
6652 | if (smt_capable()) | |
6653 | err = sysfs_create_file(&cls->kset.kobj, | |
6654 | &attr_sched_smt_power_savings.attr); | |
6655 | #endif | |
6656 | #ifdef CONFIG_SCHED_MC | |
6657 | if (!err && mc_capable()) | |
6658 | err = sysfs_create_file(&cls->kset.kobj, | |
6659 | &attr_sched_mc_power_savings.attr); | |
6660 | #endif | |
6661 | return err; | |
6662 | } | |
5c45bf27 SS |
6663 | #endif |
6664 | ||
1da177e4 LT |
6665 | /* |
6666 | * Force a reinitialization of the sched domains hierarchy. The domains | |
6667 | * and groups cannot be updated in place without racing with the balancing | |
41c7ce9a | 6668 | * code, so we temporarily attach all running cpus to the NULL domain |
1da177e4 LT |
6669 | * which will prevent rebalancing while the sched domains are recalculated. |
6670 | */ | |
6671 | static int update_sched_domains(struct notifier_block *nfb, | |
6672 | unsigned long action, void *hcpu) | |
6673 | { | |
1da177e4 LT |
6674 | switch (action) { |
6675 | case CPU_UP_PREPARE: | |
8bb78442 | 6676 | case CPU_UP_PREPARE_FROZEN: |
1da177e4 | 6677 | case CPU_DOWN_PREPARE: |
8bb78442 | 6678 | case CPU_DOWN_PREPARE_FROZEN: |
1a20ff27 | 6679 | detach_destroy_domains(&cpu_online_map); |
1da177e4 LT |
6680 | return NOTIFY_OK; |
6681 | ||
6682 | case CPU_UP_CANCELED: | |
8bb78442 | 6683 | case CPU_UP_CANCELED_FROZEN: |
1da177e4 | 6684 | case CPU_DOWN_FAILED: |
8bb78442 | 6685 | case CPU_DOWN_FAILED_FROZEN: |
1da177e4 | 6686 | case CPU_ONLINE: |
8bb78442 | 6687 | case CPU_ONLINE_FROZEN: |
1da177e4 | 6688 | case CPU_DEAD: |
8bb78442 | 6689 | case CPU_DEAD_FROZEN: |
1da177e4 LT |
6690 | /* |
6691 | * Fall through and re-initialise the domains. | |
6692 | */ | |
6693 | break; | |
6694 | default: | |
6695 | return NOTIFY_DONE; | |
6696 | } | |
6697 | ||
6698 | /* The hotplug lock is already held by cpu_up/cpu_down */ | |
1a20ff27 | 6699 | arch_init_sched_domains(&cpu_online_map); |
1da177e4 LT |
6700 | |
6701 | return NOTIFY_OK; | |
6702 | } | |
1da177e4 LT |
6703 | |
6704 | void __init sched_init_smp(void) | |
6705 | { | |
5c1e1767 NP |
6706 | cpumask_t non_isolated_cpus; |
6707 | ||
5be9361c | 6708 | mutex_lock(&sched_hotcpu_mutex); |
1a20ff27 | 6709 | arch_init_sched_domains(&cpu_online_map); |
e5e5673f | 6710 | cpus_andnot(non_isolated_cpus, cpu_possible_map, cpu_isolated_map); |
5c1e1767 NP |
6711 | if (cpus_empty(non_isolated_cpus)) |
6712 | cpu_set(smp_processor_id(), non_isolated_cpus); | |
5be9361c | 6713 | mutex_unlock(&sched_hotcpu_mutex); |
1da177e4 LT |
6714 | /* XXX: Theoretical race here - CPU may be hotplugged now */ |
6715 | hotcpu_notifier(update_sched_domains, 0); | |
5c1e1767 NP |
6716 | |
6717 | /* Move init over to a non-isolated CPU */ | |
6718 | if (set_cpus_allowed(current, non_isolated_cpus) < 0) | |
6719 | BUG(); | |
19978ca6 | 6720 | sched_init_granularity(); |
1da177e4 LT |
6721 | } |
6722 | #else | |
6723 | void __init sched_init_smp(void) | |
6724 | { | |
19978ca6 | 6725 | sched_init_granularity(); |
1da177e4 LT |
6726 | } |
6727 | #endif /* CONFIG_SMP */ | |
6728 | ||
6729 | int in_sched_functions(unsigned long addr) | |
6730 | { | |
6731 | /* Linker adds these: start and end of __sched functions */ | |
6732 | extern char __sched_text_start[], __sched_text_end[]; | |
48f24c4d | 6733 | |
1da177e4 LT |
6734 | return in_lock_functions(addr) || |
6735 | (addr >= (unsigned long)__sched_text_start | |
6736 | && addr < (unsigned long)__sched_text_end); | |
6737 | } | |
6738 | ||
a9957449 | 6739 | static void init_cfs_rq(struct cfs_rq *cfs_rq, struct rq *rq) |
dd41f596 IM |
6740 | { |
6741 | cfs_rq->tasks_timeline = RB_ROOT; | |
dd41f596 IM |
6742 | #ifdef CONFIG_FAIR_GROUP_SCHED |
6743 | cfs_rq->rq = rq; | |
6744 | #endif | |
67e9fb2a | 6745 | cfs_rq->min_vruntime = (u64)(-(1LL << 20)); |
dd41f596 IM |
6746 | } |
6747 | ||
1da177e4 LT |
6748 | void __init sched_init(void) |
6749 | { | |
476f3534 | 6750 | int highest_cpu = 0; |
dd41f596 IM |
6751 | int i, j; |
6752 | ||
0a945022 | 6753 | for_each_possible_cpu(i) { |
dd41f596 | 6754 | struct rt_prio_array *array; |
70b97a7f | 6755 | struct rq *rq; |
1da177e4 LT |
6756 | |
6757 | rq = cpu_rq(i); | |
6758 | spin_lock_init(&rq->lock); | |
fcb99371 | 6759 | lockdep_set_class(&rq->lock, &rq->rq_lock_key); |
7897986b | 6760 | rq->nr_running = 0; |
dd41f596 IM |
6761 | rq->clock = 1; |
6762 | init_cfs_rq(&rq->cfs, rq); | |
6763 | #ifdef CONFIG_FAIR_GROUP_SCHED | |
6764 | INIT_LIST_HEAD(&rq->leaf_cfs_rq_list); | |
3a252015 IM |
6765 | { |
6766 | struct cfs_rq *cfs_rq = &per_cpu(init_cfs_rq, i); | |
6767 | struct sched_entity *se = | |
6768 | &per_cpu(init_sched_entity, i); | |
6769 | ||
6770 | init_cfs_rq_p[i] = cfs_rq; | |
6771 | init_cfs_rq(cfs_rq, rq); | |
4cf86d77 | 6772 | cfs_rq->tg = &init_task_group; |
3a252015 | 6773 | list_add(&cfs_rq->leaf_cfs_rq_list, |
29f59db3 SV |
6774 | &rq->leaf_cfs_rq_list); |
6775 | ||
3a252015 IM |
6776 | init_sched_entity_p[i] = se; |
6777 | se->cfs_rq = &rq->cfs; | |
6778 | se->my_q = cfs_rq; | |
4cf86d77 | 6779 | se->load.weight = init_task_group_load; |
9b5b7751 | 6780 | se->load.inv_weight = |
4cf86d77 | 6781 | div64_64(1ULL<<32, init_task_group_load); |
3a252015 IM |
6782 | se->parent = NULL; |
6783 | } | |
4cf86d77 | 6784 | init_task_group.shares = init_task_group_load; |
5cb350ba | 6785 | spin_lock_init(&init_task_group.lock); |
dd41f596 | 6786 | #endif |
1da177e4 | 6787 | |
dd41f596 IM |
6788 | for (j = 0; j < CPU_LOAD_IDX_MAX; j++) |
6789 | rq->cpu_load[j] = 0; | |
1da177e4 | 6790 | #ifdef CONFIG_SMP |
41c7ce9a | 6791 | rq->sd = NULL; |
1da177e4 | 6792 | rq->active_balance = 0; |
dd41f596 | 6793 | rq->next_balance = jiffies; |
1da177e4 | 6794 | rq->push_cpu = 0; |
0a2966b4 | 6795 | rq->cpu = i; |
1da177e4 LT |
6796 | rq->migration_thread = NULL; |
6797 | INIT_LIST_HEAD(&rq->migration_queue); | |
6798 | #endif | |
6799 | atomic_set(&rq->nr_iowait, 0); | |
6800 | ||
dd41f596 IM |
6801 | array = &rq->rt.active; |
6802 | for (j = 0; j < MAX_RT_PRIO; j++) { | |
6803 | INIT_LIST_HEAD(array->queue + j); | |
6804 | __clear_bit(j, array->bitmap); | |
1da177e4 | 6805 | } |
476f3534 | 6806 | highest_cpu = i; |
dd41f596 IM |
6807 | /* delimiter for bitsearch: */ |
6808 | __set_bit(MAX_RT_PRIO, array->bitmap); | |
1da177e4 LT |
6809 | } |
6810 | ||
2dd73a4f | 6811 | set_load_weight(&init_task); |
b50f60ce | 6812 | |
e107be36 AK |
6813 | #ifdef CONFIG_PREEMPT_NOTIFIERS |
6814 | INIT_HLIST_HEAD(&init_task.preempt_notifiers); | |
6815 | #endif | |
6816 | ||
c9819f45 | 6817 | #ifdef CONFIG_SMP |
476f3534 | 6818 | nr_cpu_ids = highest_cpu + 1; |
c9819f45 CL |
6819 | open_softirq(SCHED_SOFTIRQ, run_rebalance_domains, NULL); |
6820 | #endif | |
6821 | ||
b50f60ce HC |
6822 | #ifdef CONFIG_RT_MUTEXES |
6823 | plist_head_init(&init_task.pi_waiters, &init_task.pi_lock); | |
6824 | #endif | |
6825 | ||
1da177e4 LT |
6826 | /* |
6827 | * The boot idle thread does lazy MMU switching as well: | |
6828 | */ | |
6829 | atomic_inc(&init_mm.mm_count); | |
6830 | enter_lazy_tlb(&init_mm, current); | |
6831 | ||
6832 | /* | |
6833 | * Make us the idle thread. Technically, schedule() should not be | |
6834 | * called from this thread, however somewhere below it might be, | |
6835 | * but because we are the idle thread, we just pick up running again | |
6836 | * when this runqueue becomes "idle". | |
6837 | */ | |
6838 | init_idle(current, smp_processor_id()); | |
dd41f596 IM |
6839 | /* |
6840 | * During early bootup we pretend to be a normal task: | |
6841 | */ | |
6842 | current->sched_class = &fair_sched_class; | |
1da177e4 LT |
6843 | } |
6844 | ||
6845 | #ifdef CONFIG_DEBUG_SPINLOCK_SLEEP | |
6846 | void __might_sleep(char *file, int line) | |
6847 | { | |
48f24c4d | 6848 | #ifdef in_atomic |
1da177e4 LT |
6849 | static unsigned long prev_jiffy; /* ratelimiting */ |
6850 | ||
6851 | if ((in_atomic() || irqs_disabled()) && | |
6852 | system_state == SYSTEM_RUNNING && !oops_in_progress) { | |
6853 | if (time_before(jiffies, prev_jiffy + HZ) && prev_jiffy) | |
6854 | return; | |
6855 | prev_jiffy = jiffies; | |
91368d73 | 6856 | printk(KERN_ERR "BUG: sleeping function called from invalid" |
1da177e4 LT |
6857 | " context at %s:%d\n", file, line); |
6858 | printk("in_atomic():%d, irqs_disabled():%d\n", | |
6859 | in_atomic(), irqs_disabled()); | |
a4c410f0 | 6860 | debug_show_held_locks(current); |
3117df04 IM |
6861 | if (irqs_disabled()) |
6862 | print_irqtrace_events(current); | |
1da177e4 LT |
6863 | dump_stack(); |
6864 | } | |
6865 | #endif | |
6866 | } | |
6867 | EXPORT_SYMBOL(__might_sleep); | |
6868 | #endif | |
6869 | ||
6870 | #ifdef CONFIG_MAGIC_SYSRQ | |
3a5e4dc1 AK |
6871 | static void normalize_task(struct rq *rq, struct task_struct *p) |
6872 | { | |
6873 | int on_rq; | |
6874 | update_rq_clock(rq); | |
6875 | on_rq = p->se.on_rq; | |
6876 | if (on_rq) | |
6877 | deactivate_task(rq, p, 0); | |
6878 | __setscheduler(rq, p, SCHED_NORMAL, 0); | |
6879 | if (on_rq) { | |
6880 | activate_task(rq, p, 0); | |
6881 | resched_task(rq->curr); | |
6882 | } | |
6883 | } | |
6884 | ||
1da177e4 LT |
6885 | void normalize_rt_tasks(void) |
6886 | { | |
a0f98a1c | 6887 | struct task_struct *g, *p; |
1da177e4 | 6888 | unsigned long flags; |
70b97a7f | 6889 | struct rq *rq; |
1da177e4 LT |
6890 | |
6891 | read_lock_irq(&tasklist_lock); | |
a0f98a1c | 6892 | do_each_thread(g, p) { |
178be793 IM |
6893 | /* |
6894 | * Only normalize user tasks: | |
6895 | */ | |
6896 | if (!p->mm) | |
6897 | continue; | |
6898 | ||
6cfb0d5d | 6899 | p->se.exec_start = 0; |
6cfb0d5d | 6900 | #ifdef CONFIG_SCHEDSTATS |
dd41f596 | 6901 | p->se.wait_start = 0; |
dd41f596 | 6902 | p->se.sleep_start = 0; |
dd41f596 | 6903 | p->se.block_start = 0; |
6cfb0d5d | 6904 | #endif |
dd41f596 IM |
6905 | task_rq(p)->clock = 0; |
6906 | ||
6907 | if (!rt_task(p)) { | |
6908 | /* | |
6909 | * Renice negative nice level userspace | |
6910 | * tasks back to 0: | |
6911 | */ | |
6912 | if (TASK_NICE(p) < 0 && p->mm) | |
6913 | set_user_nice(p, 0); | |
1da177e4 | 6914 | continue; |
dd41f596 | 6915 | } |
1da177e4 | 6916 | |
b29739f9 IM |
6917 | spin_lock_irqsave(&p->pi_lock, flags); |
6918 | rq = __task_rq_lock(p); | |
1da177e4 | 6919 | |
178be793 | 6920 | normalize_task(rq, p); |
3a5e4dc1 | 6921 | |
b29739f9 IM |
6922 | __task_rq_unlock(rq); |
6923 | spin_unlock_irqrestore(&p->pi_lock, flags); | |
a0f98a1c IM |
6924 | } while_each_thread(g, p); |
6925 | ||
1da177e4 LT |
6926 | read_unlock_irq(&tasklist_lock); |
6927 | } | |
6928 | ||
6929 | #endif /* CONFIG_MAGIC_SYSRQ */ | |
1df5c10a LT |
6930 | |
6931 | #ifdef CONFIG_IA64 | |
6932 | /* | |
6933 | * These functions are only useful for the IA64 MCA handling. | |
6934 | * | |
6935 | * They can only be called when the whole system has been | |
6936 | * stopped - every CPU needs to be quiescent, and no scheduling | |
6937 | * activity can take place. Using them for anything else would | |
6938 | * be a serious bug, and as a result, they aren't even visible | |
6939 | * under any other configuration. | |
6940 | */ | |
6941 | ||
6942 | /** | |
6943 | * curr_task - return the current task for a given cpu. | |
6944 | * @cpu: the processor in question. | |
6945 | * | |
6946 | * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED! | |
6947 | */ | |
36c8b586 | 6948 | struct task_struct *curr_task(int cpu) |
1df5c10a LT |
6949 | { |
6950 | return cpu_curr(cpu); | |
6951 | } | |
6952 | ||
6953 | /** | |
6954 | * set_curr_task - set the current task for a given cpu. | |
6955 | * @cpu: the processor in question. | |
6956 | * @p: the task pointer to set. | |
6957 | * | |
6958 | * Description: This function must only be used when non-maskable interrupts | |
6959 | * are serviced on a separate stack. It allows the architecture to switch the | |
6960 | * notion of the current task on a cpu in a non-blocking manner. This function | |
6961 | * must be called with all CPU's synchronized, and interrupts disabled, the | |
6962 | * and caller must save the original value of the current task (see | |
6963 | * curr_task() above) and restore that value before reenabling interrupts and | |
6964 | * re-starting the system. | |
6965 | * | |
6966 | * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED! | |
6967 | */ | |
36c8b586 | 6968 | void set_curr_task(int cpu, struct task_struct *p) |
1df5c10a LT |
6969 | { |
6970 | cpu_curr(cpu) = p; | |
6971 | } | |
6972 | ||
6973 | #endif | |
29f59db3 SV |
6974 | |
6975 | #ifdef CONFIG_FAIR_GROUP_SCHED | |
6976 | ||
29f59db3 | 6977 | /* allocate runqueue etc for a new task group */ |
4cf86d77 | 6978 | struct task_group *sched_create_group(void) |
29f59db3 | 6979 | { |
4cf86d77 | 6980 | struct task_group *tg; |
29f59db3 SV |
6981 | struct cfs_rq *cfs_rq; |
6982 | struct sched_entity *se; | |
9b5b7751 | 6983 | struct rq *rq; |
29f59db3 SV |
6984 | int i; |
6985 | ||
29f59db3 SV |
6986 | tg = kzalloc(sizeof(*tg), GFP_KERNEL); |
6987 | if (!tg) | |
6988 | return ERR_PTR(-ENOMEM); | |
6989 | ||
9b5b7751 | 6990 | tg->cfs_rq = kzalloc(sizeof(cfs_rq) * NR_CPUS, GFP_KERNEL); |
29f59db3 SV |
6991 | if (!tg->cfs_rq) |
6992 | goto err; | |
9b5b7751 | 6993 | tg->se = kzalloc(sizeof(se) * NR_CPUS, GFP_KERNEL); |
29f59db3 SV |
6994 | if (!tg->se) |
6995 | goto err; | |
6996 | ||
6997 | for_each_possible_cpu(i) { | |
9b5b7751 | 6998 | rq = cpu_rq(i); |
29f59db3 SV |
6999 | |
7000 | cfs_rq = kmalloc_node(sizeof(struct cfs_rq), GFP_KERNEL, | |
7001 | cpu_to_node(i)); | |
7002 | if (!cfs_rq) | |
7003 | goto err; | |
7004 | ||
7005 | se = kmalloc_node(sizeof(struct sched_entity), GFP_KERNEL, | |
7006 | cpu_to_node(i)); | |
7007 | if (!se) | |
7008 | goto err; | |
7009 | ||
7010 | memset(cfs_rq, 0, sizeof(struct cfs_rq)); | |
7011 | memset(se, 0, sizeof(struct sched_entity)); | |
7012 | ||
7013 | tg->cfs_rq[i] = cfs_rq; | |
7014 | init_cfs_rq(cfs_rq, rq); | |
7015 | cfs_rq->tg = tg; | |
29f59db3 SV |
7016 | |
7017 | tg->se[i] = se; | |
7018 | se->cfs_rq = &rq->cfs; | |
7019 | se->my_q = cfs_rq; | |
7020 | se->load.weight = NICE_0_LOAD; | |
7021 | se->load.inv_weight = div64_64(1ULL<<32, NICE_0_LOAD); | |
7022 | se->parent = NULL; | |
7023 | } | |
7024 | ||
9b5b7751 SV |
7025 | for_each_possible_cpu(i) { |
7026 | rq = cpu_rq(i); | |
7027 | cfs_rq = tg->cfs_rq[i]; | |
7028 | list_add_rcu(&cfs_rq->leaf_cfs_rq_list, &rq->leaf_cfs_rq_list); | |
7029 | } | |
29f59db3 | 7030 | |
9b5b7751 | 7031 | tg->shares = NICE_0_LOAD; |
5cb350ba | 7032 | spin_lock_init(&tg->lock); |
29f59db3 | 7033 | |
9b5b7751 | 7034 | return tg; |
29f59db3 SV |
7035 | |
7036 | err: | |
7037 | for_each_possible_cpu(i) { | |
a65914b3 | 7038 | if (tg->cfs_rq) |
29f59db3 | 7039 | kfree(tg->cfs_rq[i]); |
a65914b3 | 7040 | if (tg->se) |
29f59db3 SV |
7041 | kfree(tg->se[i]); |
7042 | } | |
a65914b3 IM |
7043 | kfree(tg->cfs_rq); |
7044 | kfree(tg->se); | |
7045 | kfree(tg); | |
29f59db3 SV |
7046 | |
7047 | return ERR_PTR(-ENOMEM); | |
7048 | } | |
7049 | ||
9b5b7751 SV |
7050 | /* rcu callback to free various structures associated with a task group */ |
7051 | static void free_sched_group(struct rcu_head *rhp) | |
29f59db3 | 7052 | { |
ae8393e5 SV |
7053 | struct task_group *tg = container_of(rhp, struct task_group, rcu); |
7054 | struct cfs_rq *cfs_rq; | |
29f59db3 SV |
7055 | struct sched_entity *se; |
7056 | int i; | |
7057 | ||
29f59db3 SV |
7058 | /* now it should be safe to free those cfs_rqs */ |
7059 | for_each_possible_cpu(i) { | |
7060 | cfs_rq = tg->cfs_rq[i]; | |
7061 | kfree(cfs_rq); | |
7062 | ||
7063 | se = tg->se[i]; | |
7064 | kfree(se); | |
7065 | } | |
7066 | ||
7067 | kfree(tg->cfs_rq); | |
7068 | kfree(tg->se); | |
7069 | kfree(tg); | |
7070 | } | |
7071 | ||
9b5b7751 | 7072 | /* Destroy runqueue etc associated with a task group */ |
4cf86d77 | 7073 | void sched_destroy_group(struct task_group *tg) |
29f59db3 | 7074 | { |
7bae49d4 | 7075 | struct cfs_rq *cfs_rq = NULL; |
9b5b7751 | 7076 | int i; |
29f59db3 | 7077 | |
9b5b7751 SV |
7078 | for_each_possible_cpu(i) { |
7079 | cfs_rq = tg->cfs_rq[i]; | |
7080 | list_del_rcu(&cfs_rq->leaf_cfs_rq_list); | |
7081 | } | |
7082 | ||
7bae49d4 | 7083 | BUG_ON(!cfs_rq); |
9b5b7751 SV |
7084 | |
7085 | /* wait for possible concurrent references to cfs_rqs complete */ | |
ae8393e5 | 7086 | call_rcu(&tg->rcu, free_sched_group); |
29f59db3 SV |
7087 | } |
7088 | ||
9b5b7751 | 7089 | /* change task's runqueue when it moves between groups. |
3a252015 IM |
7090 | * The caller of this function should have put the task in its new group |
7091 | * by now. This function just updates tsk->se.cfs_rq and tsk->se.parent to | |
7092 | * reflect its new group. | |
9b5b7751 SV |
7093 | */ |
7094 | void sched_move_task(struct task_struct *tsk) | |
29f59db3 SV |
7095 | { |
7096 | int on_rq, running; | |
7097 | unsigned long flags; | |
7098 | struct rq *rq; | |
7099 | ||
7100 | rq = task_rq_lock(tsk, &flags); | |
7101 | ||
7102 | if (tsk->sched_class != &fair_sched_class) | |
7103 | goto done; | |
7104 | ||
7105 | update_rq_clock(rq); | |
7106 | ||
7107 | running = task_running(rq, tsk); | |
7108 | on_rq = tsk->se.on_rq; | |
7109 | ||
83b699ed | 7110 | if (on_rq) { |
29f59db3 | 7111 | dequeue_task(rq, tsk, 0); |
83b699ed SV |
7112 | if (unlikely(running)) |
7113 | tsk->sched_class->put_prev_task(rq, tsk); | |
7114 | } | |
29f59db3 SV |
7115 | |
7116 | set_task_cfs_rq(tsk); | |
7117 | ||
83b699ed SV |
7118 | if (on_rq) { |
7119 | if (unlikely(running)) | |
7120 | tsk->sched_class->set_curr_task(rq); | |
7074badb | 7121 | enqueue_task(rq, tsk, 0); |
83b699ed | 7122 | } |
29f59db3 SV |
7123 | |
7124 | done: | |
7125 | task_rq_unlock(rq, &flags); | |
7126 | } | |
7127 | ||
7128 | static void set_se_shares(struct sched_entity *se, unsigned long shares) | |
7129 | { | |
7130 | struct cfs_rq *cfs_rq = se->cfs_rq; | |
7131 | struct rq *rq = cfs_rq->rq; | |
7132 | int on_rq; | |
7133 | ||
7134 | spin_lock_irq(&rq->lock); | |
7135 | ||
7136 | on_rq = se->on_rq; | |
7137 | if (on_rq) | |
7138 | dequeue_entity(cfs_rq, se, 0); | |
7139 | ||
7140 | se->load.weight = shares; | |
7141 | se->load.inv_weight = div64_64((1ULL<<32), shares); | |
7142 | ||
7143 | if (on_rq) | |
7144 | enqueue_entity(cfs_rq, se, 0); | |
7145 | ||
7146 | spin_unlock_irq(&rq->lock); | |
7147 | } | |
7148 | ||
4cf86d77 | 7149 | int sched_group_set_shares(struct task_group *tg, unsigned long shares) |
29f59db3 SV |
7150 | { |
7151 | int i; | |
29f59db3 | 7152 | |
5cb350ba | 7153 | spin_lock(&tg->lock); |
9b5b7751 | 7154 | if (tg->shares == shares) |
5cb350ba | 7155 | goto done; |
29f59db3 | 7156 | |
9b5b7751 | 7157 | tg->shares = shares; |
29f59db3 | 7158 | for_each_possible_cpu(i) |
9b5b7751 | 7159 | set_se_shares(tg->se[i], shares); |
29f59db3 | 7160 | |
5cb350ba DG |
7161 | done: |
7162 | spin_unlock(&tg->lock); | |
9b5b7751 | 7163 | return 0; |
29f59db3 SV |
7164 | } |
7165 | ||
5cb350ba DG |
7166 | unsigned long sched_group_shares(struct task_group *tg) |
7167 | { | |
7168 | return tg->shares; | |
7169 | } | |
7170 | ||
3a252015 | 7171 | #endif /* CONFIG_FAIR_GROUP_SCHED */ |
68318b8e SV |
7172 | |
7173 | #ifdef CONFIG_FAIR_CGROUP_SCHED | |
7174 | ||
7175 | /* return corresponding task_group object of a cgroup */ | |
2b01dfe3 | 7176 | static inline struct task_group *cgroup_tg(struct cgroup *cgrp) |
68318b8e | 7177 | { |
2b01dfe3 PM |
7178 | return container_of(cgroup_subsys_state(cgrp, cpu_cgroup_subsys_id), |
7179 | struct task_group, css); | |
68318b8e SV |
7180 | } |
7181 | ||
7182 | static struct cgroup_subsys_state * | |
2b01dfe3 | 7183 | cpu_cgroup_create(struct cgroup_subsys *ss, struct cgroup *cgrp) |
68318b8e SV |
7184 | { |
7185 | struct task_group *tg; | |
7186 | ||
2b01dfe3 | 7187 | if (!cgrp->parent) { |
68318b8e | 7188 | /* This is early initialization for the top cgroup */ |
2b01dfe3 | 7189 | init_task_group.css.cgroup = cgrp; |
68318b8e SV |
7190 | return &init_task_group.css; |
7191 | } | |
7192 | ||
7193 | /* we support only 1-level deep hierarchical scheduler atm */ | |
2b01dfe3 | 7194 | if (cgrp->parent->parent) |
68318b8e SV |
7195 | return ERR_PTR(-EINVAL); |
7196 | ||
7197 | tg = sched_create_group(); | |
7198 | if (IS_ERR(tg)) | |
7199 | return ERR_PTR(-ENOMEM); | |
7200 | ||
7201 | /* Bind the cgroup to task_group object we just created */ | |
2b01dfe3 | 7202 | tg->css.cgroup = cgrp; |
68318b8e SV |
7203 | |
7204 | return &tg->css; | |
7205 | } | |
7206 | ||
7207 | static void cpu_cgroup_destroy(struct cgroup_subsys *ss, | |
2b01dfe3 | 7208 | struct cgroup *cgrp) |
68318b8e | 7209 | { |
2b01dfe3 | 7210 | struct task_group *tg = cgroup_tg(cgrp); |
68318b8e SV |
7211 | |
7212 | sched_destroy_group(tg); | |
7213 | } | |
7214 | ||
7215 | static int cpu_cgroup_can_attach(struct cgroup_subsys *ss, | |
2b01dfe3 | 7216 | struct cgroup *cgrp, struct task_struct *tsk) |
68318b8e SV |
7217 | { |
7218 | /* We don't support RT-tasks being in separate groups */ | |
7219 | if (tsk->sched_class != &fair_sched_class) | |
7220 | return -EINVAL; | |
7221 | ||
7222 | return 0; | |
7223 | } | |
7224 | ||
7225 | static void | |
2b01dfe3 | 7226 | cpu_cgroup_attach(struct cgroup_subsys *ss, struct cgroup *cgrp, |
68318b8e SV |
7227 | struct cgroup *old_cont, struct task_struct *tsk) |
7228 | { | |
7229 | sched_move_task(tsk); | |
7230 | } | |
7231 | ||
2b01dfe3 PM |
7232 | static int cpu_shares_write_uint(struct cgroup *cgrp, struct cftype *cftype, |
7233 | u64 shareval) | |
68318b8e | 7234 | { |
2b01dfe3 | 7235 | return sched_group_set_shares(cgroup_tg(cgrp), shareval); |
68318b8e SV |
7236 | } |
7237 | ||
2b01dfe3 | 7238 | static u64 cpu_shares_read_uint(struct cgroup *cgrp, struct cftype *cft) |
68318b8e | 7239 | { |
2b01dfe3 | 7240 | struct task_group *tg = cgroup_tg(cgrp); |
68318b8e SV |
7241 | |
7242 | return (u64) tg->shares; | |
7243 | } | |
7244 | ||
fe5c7cc2 PM |
7245 | static u64 cpu_usage_read(struct cgroup *cgrp, struct cftype *cft) |
7246 | { | |
7247 | struct task_group *tg = cgroup_tg(cgrp); | |
7248 | unsigned long flags; | |
7249 | u64 res = 0; | |
7250 | int i; | |
7251 | ||
7252 | for_each_possible_cpu(i) { | |
7253 | /* | |
7254 | * Lock to prevent races with updating 64-bit counters | |
7255 | * on 32-bit arches. | |
7256 | */ | |
7257 | spin_lock_irqsave(&cpu_rq(i)->lock, flags); | |
7258 | res += tg->se[i]->sum_exec_runtime; | |
7259 | spin_unlock_irqrestore(&cpu_rq(i)->lock, flags); | |
7260 | } | |
7261 | /* Convert from ns to ms */ | |
d6322faf | 7262 | do_div(res, NSEC_PER_MSEC); |
fe5c7cc2 PM |
7263 | |
7264 | return res; | |
7265 | } | |
7266 | ||
7267 | static struct cftype cpu_files[] = { | |
7268 | { | |
7269 | .name = "shares", | |
7270 | .read_uint = cpu_shares_read_uint, | |
7271 | .write_uint = cpu_shares_write_uint, | |
7272 | }, | |
7273 | { | |
7274 | .name = "usage", | |
7275 | .read_uint = cpu_usage_read, | |
7276 | }, | |
68318b8e SV |
7277 | }; |
7278 | ||
7279 | static int cpu_cgroup_populate(struct cgroup_subsys *ss, struct cgroup *cont) | |
7280 | { | |
fe5c7cc2 | 7281 | return cgroup_add_files(cont, ss, cpu_files, ARRAY_SIZE(cpu_files)); |
68318b8e SV |
7282 | } |
7283 | ||
7284 | struct cgroup_subsys cpu_cgroup_subsys = { | |
38605cae IM |
7285 | .name = "cpu", |
7286 | .create = cpu_cgroup_create, | |
7287 | .destroy = cpu_cgroup_destroy, | |
7288 | .can_attach = cpu_cgroup_can_attach, | |
7289 | .attach = cpu_cgroup_attach, | |
7290 | .populate = cpu_cgroup_populate, | |
7291 | .subsys_id = cpu_cgroup_subsys_id, | |
68318b8e SV |
7292 | .early_init = 1, |
7293 | }; | |
7294 | ||
7295 | #endif /* CONFIG_FAIR_CGROUP_SCHED */ |