]>
Commit | Line | Data |
---|---|---|
bf0f6f24 IM |
1 | /* |
2 | * Completely Fair Scheduling (CFS) Class (SCHED_NORMAL/SCHED_BATCH) | |
3 | * | |
4 | * Copyright (C) 2007 Red Hat, Inc., Ingo Molnar <mingo@redhat.com> | |
5 | * | |
6 | * Interactivity improvements by Mike Galbraith | |
7 | * (C) 2007 Mike Galbraith <efault@gmx.de> | |
8 | * | |
9 | * Various enhancements by Dmitry Adamushko. | |
10 | * (C) 2007 Dmitry Adamushko <dmitry.adamushko@gmail.com> | |
11 | * | |
12 | * Group scheduling enhancements by Srivatsa Vaddagiri | |
13 | * Copyright IBM Corporation, 2007 | |
14 | * Author: Srivatsa Vaddagiri <vatsa@linux.vnet.ibm.com> | |
15 | * | |
16 | * Scaled math optimizations by Thomas Gleixner | |
17 | * Copyright (C) 2007, Thomas Gleixner <tglx@linutronix.de> | |
21805085 PZ |
18 | * |
19 | * Adaptive scheduling granularity, math enhancements by Peter Zijlstra | |
20 | * Copyright (C) 2007 Red Hat, Inc., Peter Zijlstra <pzijlstr@redhat.com> | |
bf0f6f24 IM |
21 | */ |
22 | ||
9745512c AV |
23 | #include <linux/latencytop.h> |
24 | ||
bf0f6f24 | 25 | /* |
21805085 | 26 | * Targeted preemption latency for CPU-bound tasks: |
722aab0c | 27 | * (default: 20ms * (1 + ilog(ncpus)), units: nanoseconds) |
bf0f6f24 | 28 | * |
21805085 | 29 | * NOTE: this latency value is not the same as the concept of |
d274a4ce IM |
30 | * 'timeslice length' - timeslices in CFS are of variable length |
31 | * and have no persistent notion like in traditional, time-slice | |
32 | * based scheduling concepts. | |
bf0f6f24 | 33 | * |
d274a4ce IM |
34 | * (to see the precise effective timeslice length of your workload, |
35 | * run vmstat and monitor the context-switches (cs) field) | |
bf0f6f24 | 36 | */ |
19978ca6 | 37 | unsigned int sysctl_sched_latency = 20000000ULL; |
2bd8e6d4 IM |
38 | |
39 | /* | |
b2be5e96 | 40 | * Minimal preemption granularity for CPU-bound tasks: |
722aab0c | 41 | * (default: 4 msec * (1 + ilog(ncpus)), units: nanoseconds) |
2bd8e6d4 | 42 | */ |
722aab0c | 43 | unsigned int sysctl_sched_min_granularity = 4000000ULL; |
21805085 PZ |
44 | |
45 | /* | |
b2be5e96 PZ |
46 | * is kept at sysctl_sched_latency / sysctl_sched_min_granularity |
47 | */ | |
722aab0c | 48 | static unsigned int sched_nr_latency = 5; |
b2be5e96 PZ |
49 | |
50 | /* | |
51 | * After fork, child runs first. (default) If set to 0 then | |
52 | * parent will (try to) run first. | |
21805085 | 53 | */ |
b2be5e96 | 54 | const_debug unsigned int sysctl_sched_child_runs_first = 1; |
bf0f6f24 | 55 | |
1799e35d IM |
56 | /* |
57 | * sys_sched_yield() compat mode | |
58 | * | |
59 | * This option switches the agressive yield implementation of the | |
60 | * old scheduler back on. | |
61 | */ | |
62 | unsigned int __read_mostly sysctl_sched_compat_yield; | |
63 | ||
bf0f6f24 IM |
64 | /* |
65 | * SCHED_OTHER wake-up granularity. | |
103638d9 | 66 | * (default: 5 msec * (1 + ilog(ncpus)), units: nanoseconds) |
bf0f6f24 IM |
67 | * |
68 | * This option delays the preemption effects of decoupled workloads | |
69 | * and reduces their over-scheduling. Synchronous workloads will still | |
70 | * have immediate wakeup/sleep latencies. | |
71 | */ | |
103638d9 | 72 | unsigned int sysctl_sched_wakeup_granularity = 5000000UL; |
bf0f6f24 | 73 | |
da84d961 IM |
74 | const_debug unsigned int sysctl_sched_migration_cost = 500000UL; |
75 | ||
a4c2f00f PZ |
76 | static const struct sched_class fair_sched_class; |
77 | ||
bf0f6f24 IM |
78 | /************************************************************** |
79 | * CFS operations on generic schedulable entities: | |
80 | */ | |
81 | ||
b758149c PZ |
82 | static inline struct task_struct *task_of(struct sched_entity *se) |
83 | { | |
84 | return container_of(se, struct task_struct, se); | |
85 | } | |
86 | ||
62160e3f | 87 | #ifdef CONFIG_FAIR_GROUP_SCHED |
bf0f6f24 | 88 | |
62160e3f | 89 | /* cpu runqueue to which this cfs_rq is attached */ |
bf0f6f24 IM |
90 | static inline struct rq *rq_of(struct cfs_rq *cfs_rq) |
91 | { | |
62160e3f | 92 | return cfs_rq->rq; |
bf0f6f24 IM |
93 | } |
94 | ||
62160e3f IM |
95 | /* An entity is a task if it doesn't "own" a runqueue */ |
96 | #define entity_is_task(se) (!se->my_q) | |
bf0f6f24 | 97 | |
b758149c PZ |
98 | /* Walk up scheduling entities hierarchy */ |
99 | #define for_each_sched_entity(se) \ | |
100 | for (; se; se = se->parent) | |
101 | ||
102 | static inline struct cfs_rq *task_cfs_rq(struct task_struct *p) | |
103 | { | |
104 | return p->se.cfs_rq; | |
105 | } | |
106 | ||
107 | /* runqueue on which this entity is (to be) queued */ | |
108 | static inline struct cfs_rq *cfs_rq_of(struct sched_entity *se) | |
109 | { | |
110 | return se->cfs_rq; | |
111 | } | |
112 | ||
113 | /* runqueue "owned" by this group */ | |
114 | static inline struct cfs_rq *group_cfs_rq(struct sched_entity *grp) | |
115 | { | |
116 | return grp->my_q; | |
117 | } | |
118 | ||
119 | /* Given a group's cfs_rq on one cpu, return its corresponding cfs_rq on | |
120 | * another cpu ('this_cpu') | |
121 | */ | |
122 | static inline struct cfs_rq *cpu_cfs_rq(struct cfs_rq *cfs_rq, int this_cpu) | |
123 | { | |
124 | return cfs_rq->tg->cfs_rq[this_cpu]; | |
125 | } | |
126 | ||
127 | /* Iterate thr' all leaf cfs_rq's on a runqueue */ | |
128 | #define for_each_leaf_cfs_rq(rq, cfs_rq) \ | |
129 | list_for_each_entry_rcu(cfs_rq, &rq->leaf_cfs_rq_list, leaf_cfs_rq_list) | |
130 | ||
131 | /* Do the two (enqueued) entities belong to the same group ? */ | |
132 | static inline int | |
133 | is_same_group(struct sched_entity *se, struct sched_entity *pse) | |
134 | { | |
135 | if (se->cfs_rq == pse->cfs_rq) | |
136 | return 1; | |
137 | ||
138 | return 0; | |
139 | } | |
140 | ||
141 | static inline struct sched_entity *parent_entity(struct sched_entity *se) | |
142 | { | |
143 | return se->parent; | |
144 | } | |
145 | ||
464b7527 PZ |
146 | /* return depth at which a sched entity is present in the hierarchy */ |
147 | static inline int depth_se(struct sched_entity *se) | |
148 | { | |
149 | int depth = 0; | |
150 | ||
151 | for_each_sched_entity(se) | |
152 | depth++; | |
153 | ||
154 | return depth; | |
155 | } | |
156 | ||
157 | static void | |
158 | find_matching_se(struct sched_entity **se, struct sched_entity **pse) | |
159 | { | |
160 | int se_depth, pse_depth; | |
161 | ||
162 | /* | |
163 | * preemption test can be made between sibling entities who are in the | |
164 | * same cfs_rq i.e who have a common parent. Walk up the hierarchy of | |
165 | * both tasks until we find their ancestors who are siblings of common | |
166 | * parent. | |
167 | */ | |
168 | ||
169 | /* First walk up until both entities are at same depth */ | |
170 | se_depth = depth_se(*se); | |
171 | pse_depth = depth_se(*pse); | |
172 | ||
173 | while (se_depth > pse_depth) { | |
174 | se_depth--; | |
175 | *se = parent_entity(*se); | |
176 | } | |
177 | ||
178 | while (pse_depth > se_depth) { | |
179 | pse_depth--; | |
180 | *pse = parent_entity(*pse); | |
181 | } | |
182 | ||
183 | while (!is_same_group(*se, *pse)) { | |
184 | *se = parent_entity(*se); | |
185 | *pse = parent_entity(*pse); | |
186 | } | |
187 | } | |
188 | ||
62160e3f | 189 | #else /* CONFIG_FAIR_GROUP_SCHED */ |
bf0f6f24 | 190 | |
62160e3f IM |
191 | static inline struct rq *rq_of(struct cfs_rq *cfs_rq) |
192 | { | |
193 | return container_of(cfs_rq, struct rq, cfs); | |
bf0f6f24 IM |
194 | } |
195 | ||
196 | #define entity_is_task(se) 1 | |
197 | ||
b758149c PZ |
198 | #define for_each_sched_entity(se) \ |
199 | for (; se; se = NULL) | |
bf0f6f24 | 200 | |
b758149c | 201 | static inline struct cfs_rq *task_cfs_rq(struct task_struct *p) |
bf0f6f24 | 202 | { |
b758149c | 203 | return &task_rq(p)->cfs; |
bf0f6f24 IM |
204 | } |
205 | ||
b758149c PZ |
206 | static inline struct cfs_rq *cfs_rq_of(struct sched_entity *se) |
207 | { | |
208 | struct task_struct *p = task_of(se); | |
209 | struct rq *rq = task_rq(p); | |
210 | ||
211 | return &rq->cfs; | |
212 | } | |
213 | ||
214 | /* runqueue "owned" by this group */ | |
215 | static inline struct cfs_rq *group_cfs_rq(struct sched_entity *grp) | |
216 | { | |
217 | return NULL; | |
218 | } | |
219 | ||
220 | static inline struct cfs_rq *cpu_cfs_rq(struct cfs_rq *cfs_rq, int this_cpu) | |
221 | { | |
222 | return &cpu_rq(this_cpu)->cfs; | |
223 | } | |
224 | ||
225 | #define for_each_leaf_cfs_rq(rq, cfs_rq) \ | |
226 | for (cfs_rq = &rq->cfs; cfs_rq; cfs_rq = NULL) | |
227 | ||
228 | static inline int | |
229 | is_same_group(struct sched_entity *se, struct sched_entity *pse) | |
230 | { | |
231 | return 1; | |
232 | } | |
233 | ||
234 | static inline struct sched_entity *parent_entity(struct sched_entity *se) | |
235 | { | |
236 | return NULL; | |
237 | } | |
238 | ||
464b7527 PZ |
239 | static inline void |
240 | find_matching_se(struct sched_entity **se, struct sched_entity **pse) | |
241 | { | |
242 | } | |
243 | ||
b758149c PZ |
244 | #endif /* CONFIG_FAIR_GROUP_SCHED */ |
245 | ||
bf0f6f24 IM |
246 | |
247 | /************************************************************** | |
248 | * Scheduling class tree data structure manipulation methods: | |
249 | */ | |
250 | ||
0702e3eb | 251 | static inline u64 max_vruntime(u64 min_vruntime, u64 vruntime) |
02e0431a | 252 | { |
368059a9 PZ |
253 | s64 delta = (s64)(vruntime - min_vruntime); |
254 | if (delta > 0) | |
02e0431a PZ |
255 | min_vruntime = vruntime; |
256 | ||
257 | return min_vruntime; | |
258 | } | |
259 | ||
0702e3eb | 260 | static inline u64 min_vruntime(u64 min_vruntime, u64 vruntime) |
b0ffd246 PZ |
261 | { |
262 | s64 delta = (s64)(vruntime - min_vruntime); | |
263 | if (delta < 0) | |
264 | min_vruntime = vruntime; | |
265 | ||
266 | return min_vruntime; | |
267 | } | |
268 | ||
0702e3eb | 269 | static inline s64 entity_key(struct cfs_rq *cfs_rq, struct sched_entity *se) |
9014623c | 270 | { |
30cfdcfc | 271 | return se->vruntime - cfs_rq->min_vruntime; |
9014623c PZ |
272 | } |
273 | ||
1af5f730 PZ |
274 | static void update_min_vruntime(struct cfs_rq *cfs_rq) |
275 | { | |
276 | u64 vruntime = cfs_rq->min_vruntime; | |
277 | ||
278 | if (cfs_rq->curr) | |
279 | vruntime = cfs_rq->curr->vruntime; | |
280 | ||
281 | if (cfs_rq->rb_leftmost) { | |
282 | struct sched_entity *se = rb_entry(cfs_rq->rb_leftmost, | |
283 | struct sched_entity, | |
284 | run_node); | |
285 | ||
286 | if (vruntime == cfs_rq->min_vruntime) | |
287 | vruntime = se->vruntime; | |
288 | else | |
289 | vruntime = min_vruntime(vruntime, se->vruntime); | |
290 | } | |
291 | ||
292 | cfs_rq->min_vruntime = max_vruntime(cfs_rq->min_vruntime, vruntime); | |
293 | } | |
294 | ||
bf0f6f24 IM |
295 | /* |
296 | * Enqueue an entity into the rb-tree: | |
297 | */ | |
0702e3eb | 298 | static void __enqueue_entity(struct cfs_rq *cfs_rq, struct sched_entity *se) |
bf0f6f24 IM |
299 | { |
300 | struct rb_node **link = &cfs_rq->tasks_timeline.rb_node; | |
301 | struct rb_node *parent = NULL; | |
302 | struct sched_entity *entry; | |
9014623c | 303 | s64 key = entity_key(cfs_rq, se); |
bf0f6f24 IM |
304 | int leftmost = 1; |
305 | ||
306 | /* | |
307 | * Find the right place in the rbtree: | |
308 | */ | |
309 | while (*link) { | |
310 | parent = *link; | |
311 | entry = rb_entry(parent, struct sched_entity, run_node); | |
312 | /* | |
313 | * We dont care about collisions. Nodes with | |
314 | * the same key stay together. | |
315 | */ | |
9014623c | 316 | if (key < entity_key(cfs_rq, entry)) { |
bf0f6f24 IM |
317 | link = &parent->rb_left; |
318 | } else { | |
319 | link = &parent->rb_right; | |
320 | leftmost = 0; | |
321 | } | |
322 | } | |
323 | ||
324 | /* | |
325 | * Maintain a cache of leftmost tree entries (it is frequently | |
326 | * used): | |
327 | */ | |
1af5f730 | 328 | if (leftmost) |
57cb499d | 329 | cfs_rq->rb_leftmost = &se->run_node; |
bf0f6f24 IM |
330 | |
331 | rb_link_node(&se->run_node, parent, link); | |
332 | rb_insert_color(&se->run_node, &cfs_rq->tasks_timeline); | |
bf0f6f24 IM |
333 | } |
334 | ||
0702e3eb | 335 | static void __dequeue_entity(struct cfs_rq *cfs_rq, struct sched_entity *se) |
bf0f6f24 | 336 | { |
3fe69747 PZ |
337 | if (cfs_rq->rb_leftmost == &se->run_node) { |
338 | struct rb_node *next_node; | |
3fe69747 PZ |
339 | |
340 | next_node = rb_next(&se->run_node); | |
341 | cfs_rq->rb_leftmost = next_node; | |
3fe69747 | 342 | } |
e9acbff6 | 343 | |
aa2ac252 PZ |
344 | if (cfs_rq->next == se) |
345 | cfs_rq->next = NULL; | |
346 | ||
bf0f6f24 | 347 | rb_erase(&se->run_node, &cfs_rq->tasks_timeline); |
bf0f6f24 IM |
348 | } |
349 | ||
bf0f6f24 IM |
350 | static struct sched_entity *__pick_next_entity(struct cfs_rq *cfs_rq) |
351 | { | |
f4b6755f PZ |
352 | struct rb_node *left = cfs_rq->rb_leftmost; |
353 | ||
354 | if (!left) | |
355 | return NULL; | |
356 | ||
357 | return rb_entry(left, struct sched_entity, run_node); | |
bf0f6f24 IM |
358 | } |
359 | ||
f4b6755f | 360 | static struct sched_entity *__pick_last_entity(struct cfs_rq *cfs_rq) |
aeb73b04 | 361 | { |
7eee3e67 | 362 | struct rb_node *last = rb_last(&cfs_rq->tasks_timeline); |
aeb73b04 | 363 | |
70eee74b BS |
364 | if (!last) |
365 | return NULL; | |
7eee3e67 IM |
366 | |
367 | return rb_entry(last, struct sched_entity, run_node); | |
aeb73b04 PZ |
368 | } |
369 | ||
bf0f6f24 IM |
370 | /************************************************************** |
371 | * Scheduling class statistics methods: | |
372 | */ | |
373 | ||
b2be5e96 PZ |
374 | #ifdef CONFIG_SCHED_DEBUG |
375 | int sched_nr_latency_handler(struct ctl_table *table, int write, | |
376 | struct file *filp, void __user *buffer, size_t *lenp, | |
377 | loff_t *ppos) | |
378 | { | |
379 | int ret = proc_dointvec_minmax(table, write, filp, buffer, lenp, ppos); | |
380 | ||
381 | if (ret || !write) | |
382 | return ret; | |
383 | ||
384 | sched_nr_latency = DIV_ROUND_UP(sysctl_sched_latency, | |
385 | sysctl_sched_min_granularity); | |
386 | ||
387 | return 0; | |
388 | } | |
389 | #endif | |
647e7cac | 390 | |
a7be37ac | 391 | /* |
f9c0b095 | 392 | * delta *= P[w / rw] |
a7be37ac PZ |
393 | */ |
394 | static inline unsigned long | |
395 | calc_delta_weight(unsigned long delta, struct sched_entity *se) | |
396 | { | |
397 | for_each_sched_entity(se) { | |
398 | delta = calc_delta_mine(delta, | |
399 | se->load.weight, &cfs_rq_of(se)->load); | |
400 | } | |
401 | ||
402 | return delta; | |
403 | } | |
404 | ||
405 | /* | |
f9c0b095 | 406 | * delta /= w |
a7be37ac PZ |
407 | */ |
408 | static inline unsigned long | |
409 | calc_delta_fair(unsigned long delta, struct sched_entity *se) | |
410 | { | |
f9c0b095 PZ |
411 | if (unlikely(se->load.weight != NICE_0_LOAD)) |
412 | delta = calc_delta_mine(delta, NICE_0_LOAD, &se->load); | |
a7be37ac PZ |
413 | |
414 | return delta; | |
415 | } | |
416 | ||
647e7cac IM |
417 | /* |
418 | * The idea is to set a period in which each task runs once. | |
419 | * | |
420 | * When there are too many tasks (sysctl_sched_nr_latency) we have to stretch | |
421 | * this period because otherwise the slices get too small. | |
422 | * | |
423 | * p = (nr <= nl) ? l : l*nr/nl | |
424 | */ | |
4d78e7b6 PZ |
425 | static u64 __sched_period(unsigned long nr_running) |
426 | { | |
427 | u64 period = sysctl_sched_latency; | |
b2be5e96 | 428 | unsigned long nr_latency = sched_nr_latency; |
4d78e7b6 PZ |
429 | |
430 | if (unlikely(nr_running > nr_latency)) { | |
4bf0b771 | 431 | period = sysctl_sched_min_granularity; |
4d78e7b6 | 432 | period *= nr_running; |
4d78e7b6 PZ |
433 | } |
434 | ||
435 | return period; | |
436 | } | |
437 | ||
647e7cac IM |
438 | /* |
439 | * We calculate the wall-time slice from the period by taking a part | |
440 | * proportional to the weight. | |
441 | * | |
f9c0b095 | 442 | * s = p*P[w/rw] |
647e7cac | 443 | */ |
6d0f0ebd | 444 | static u64 sched_slice(struct cfs_rq *cfs_rq, struct sched_entity *se) |
21805085 | 445 | { |
f9c0b095 PZ |
446 | unsigned long nr_running = cfs_rq->nr_running; |
447 | ||
448 | if (unlikely(!se->on_rq)) | |
449 | nr_running++; | |
450 | ||
451 | return calc_delta_weight(__sched_period(nr_running), se); | |
bf0f6f24 IM |
452 | } |
453 | ||
647e7cac | 454 | /* |
ac884dec | 455 | * We calculate the vruntime slice of a to be inserted task |
647e7cac | 456 | * |
f9c0b095 | 457 | * vs = s/w |
647e7cac | 458 | */ |
f9c0b095 | 459 | static u64 sched_vslice(struct cfs_rq *cfs_rq, struct sched_entity *se) |
67e9fb2a | 460 | { |
f9c0b095 | 461 | return calc_delta_fair(sched_slice(cfs_rq, se), se); |
a7be37ac PZ |
462 | } |
463 | ||
bf0f6f24 IM |
464 | /* |
465 | * Update the current task's runtime statistics. Skip current tasks that | |
466 | * are not in our scheduling class. | |
467 | */ | |
468 | static inline void | |
8ebc91d9 IM |
469 | __update_curr(struct cfs_rq *cfs_rq, struct sched_entity *curr, |
470 | unsigned long delta_exec) | |
bf0f6f24 | 471 | { |
bbdba7c0 | 472 | unsigned long delta_exec_weighted; |
bf0f6f24 | 473 | |
8179ca23 | 474 | schedstat_set(curr->exec_max, max((u64)delta_exec, curr->exec_max)); |
bf0f6f24 IM |
475 | |
476 | curr->sum_exec_runtime += delta_exec; | |
7a62eabc | 477 | schedstat_add(cfs_rq, exec_clock, delta_exec); |
a7be37ac | 478 | delta_exec_weighted = calc_delta_fair(delta_exec, curr); |
e9acbff6 | 479 | curr->vruntime += delta_exec_weighted; |
1af5f730 | 480 | update_min_vruntime(cfs_rq); |
bf0f6f24 IM |
481 | } |
482 | ||
b7cc0896 | 483 | static void update_curr(struct cfs_rq *cfs_rq) |
bf0f6f24 | 484 | { |
429d43bc | 485 | struct sched_entity *curr = cfs_rq->curr; |
8ebc91d9 | 486 | u64 now = rq_of(cfs_rq)->clock; |
bf0f6f24 IM |
487 | unsigned long delta_exec; |
488 | ||
489 | if (unlikely(!curr)) | |
490 | return; | |
491 | ||
492 | /* | |
493 | * Get the amount of time the current task was running | |
494 | * since the last time we changed load (this cannot | |
495 | * overflow on 32 bits): | |
496 | */ | |
8ebc91d9 | 497 | delta_exec = (unsigned long)(now - curr->exec_start); |
bf0f6f24 | 498 | |
8ebc91d9 IM |
499 | __update_curr(cfs_rq, curr, delta_exec); |
500 | curr->exec_start = now; | |
d842de87 SV |
501 | |
502 | if (entity_is_task(curr)) { | |
503 | struct task_struct *curtask = task_of(curr); | |
504 | ||
505 | cpuacct_charge(curtask, delta_exec); | |
f06febc9 | 506 | account_group_exec_runtime(curtask, delta_exec); |
d842de87 | 507 | } |
bf0f6f24 IM |
508 | } |
509 | ||
510 | static inline void | |
5870db5b | 511 | update_stats_wait_start(struct cfs_rq *cfs_rq, struct sched_entity *se) |
bf0f6f24 | 512 | { |
d281918d | 513 | schedstat_set(se->wait_start, rq_of(cfs_rq)->clock); |
bf0f6f24 IM |
514 | } |
515 | ||
bf0f6f24 IM |
516 | /* |
517 | * Task is being enqueued - update stats: | |
518 | */ | |
d2417e5a | 519 | static void update_stats_enqueue(struct cfs_rq *cfs_rq, struct sched_entity *se) |
bf0f6f24 | 520 | { |
bf0f6f24 IM |
521 | /* |
522 | * Are we enqueueing a waiting task? (for current tasks | |
523 | * a dequeue/enqueue event is a NOP) | |
524 | */ | |
429d43bc | 525 | if (se != cfs_rq->curr) |
5870db5b | 526 | update_stats_wait_start(cfs_rq, se); |
bf0f6f24 IM |
527 | } |
528 | ||
bf0f6f24 | 529 | static void |
9ef0a961 | 530 | update_stats_wait_end(struct cfs_rq *cfs_rq, struct sched_entity *se) |
bf0f6f24 | 531 | { |
bbdba7c0 IM |
532 | schedstat_set(se->wait_max, max(se->wait_max, |
533 | rq_of(cfs_rq)->clock - se->wait_start)); | |
6d082592 AV |
534 | schedstat_set(se->wait_count, se->wait_count + 1); |
535 | schedstat_set(se->wait_sum, se->wait_sum + | |
536 | rq_of(cfs_rq)->clock - se->wait_start); | |
6cfb0d5d | 537 | schedstat_set(se->wait_start, 0); |
bf0f6f24 IM |
538 | } |
539 | ||
540 | static inline void | |
19b6a2e3 | 541 | update_stats_dequeue(struct cfs_rq *cfs_rq, struct sched_entity *se) |
bf0f6f24 | 542 | { |
bf0f6f24 IM |
543 | /* |
544 | * Mark the end of the wait period if dequeueing a | |
545 | * waiting task: | |
546 | */ | |
429d43bc | 547 | if (se != cfs_rq->curr) |
9ef0a961 | 548 | update_stats_wait_end(cfs_rq, se); |
bf0f6f24 IM |
549 | } |
550 | ||
551 | /* | |
552 | * We are picking a new current task - update its stats: | |
553 | */ | |
554 | static inline void | |
79303e9e | 555 | update_stats_curr_start(struct cfs_rq *cfs_rq, struct sched_entity *se) |
bf0f6f24 IM |
556 | { |
557 | /* | |
558 | * We are starting a new run period: | |
559 | */ | |
d281918d | 560 | se->exec_start = rq_of(cfs_rq)->clock; |
bf0f6f24 IM |
561 | } |
562 | ||
bf0f6f24 IM |
563 | /************************************************** |
564 | * Scheduling class queueing methods: | |
565 | */ | |
566 | ||
c09595f6 PZ |
567 | #if defined CONFIG_SMP && defined CONFIG_FAIR_GROUP_SCHED |
568 | static void | |
569 | add_cfs_task_weight(struct cfs_rq *cfs_rq, unsigned long weight) | |
570 | { | |
571 | cfs_rq->task_weight += weight; | |
572 | } | |
573 | #else | |
574 | static inline void | |
575 | add_cfs_task_weight(struct cfs_rq *cfs_rq, unsigned long weight) | |
576 | { | |
577 | } | |
578 | #endif | |
579 | ||
30cfdcfc DA |
580 | static void |
581 | account_entity_enqueue(struct cfs_rq *cfs_rq, struct sched_entity *se) | |
582 | { | |
583 | update_load_add(&cfs_rq->load, se->load.weight); | |
c09595f6 PZ |
584 | if (!parent_entity(se)) |
585 | inc_cpu_load(rq_of(cfs_rq), se->load.weight); | |
b87f1724 | 586 | if (entity_is_task(se)) { |
c09595f6 | 587 | add_cfs_task_weight(cfs_rq, se->load.weight); |
b87f1724 BR |
588 | list_add(&se->group_node, &cfs_rq->tasks); |
589 | } | |
30cfdcfc DA |
590 | cfs_rq->nr_running++; |
591 | se->on_rq = 1; | |
592 | } | |
593 | ||
594 | static void | |
595 | account_entity_dequeue(struct cfs_rq *cfs_rq, struct sched_entity *se) | |
596 | { | |
597 | update_load_sub(&cfs_rq->load, se->load.weight); | |
c09595f6 PZ |
598 | if (!parent_entity(se)) |
599 | dec_cpu_load(rq_of(cfs_rq), se->load.weight); | |
b87f1724 | 600 | if (entity_is_task(se)) { |
c09595f6 | 601 | add_cfs_task_weight(cfs_rq, -se->load.weight); |
b87f1724 BR |
602 | list_del_init(&se->group_node); |
603 | } | |
30cfdcfc DA |
604 | cfs_rq->nr_running--; |
605 | se->on_rq = 0; | |
606 | } | |
607 | ||
2396af69 | 608 | static void enqueue_sleeper(struct cfs_rq *cfs_rq, struct sched_entity *se) |
bf0f6f24 | 609 | { |
bf0f6f24 IM |
610 | #ifdef CONFIG_SCHEDSTATS |
611 | if (se->sleep_start) { | |
d281918d | 612 | u64 delta = rq_of(cfs_rq)->clock - se->sleep_start; |
9745512c | 613 | struct task_struct *tsk = task_of(se); |
bf0f6f24 IM |
614 | |
615 | if ((s64)delta < 0) | |
616 | delta = 0; | |
617 | ||
618 | if (unlikely(delta > se->sleep_max)) | |
619 | se->sleep_max = delta; | |
620 | ||
621 | se->sleep_start = 0; | |
622 | se->sum_sleep_runtime += delta; | |
9745512c AV |
623 | |
624 | account_scheduler_latency(tsk, delta >> 10, 1); | |
bf0f6f24 IM |
625 | } |
626 | if (se->block_start) { | |
d281918d | 627 | u64 delta = rq_of(cfs_rq)->clock - se->block_start; |
9745512c | 628 | struct task_struct *tsk = task_of(se); |
bf0f6f24 IM |
629 | |
630 | if ((s64)delta < 0) | |
631 | delta = 0; | |
632 | ||
633 | if (unlikely(delta > se->block_max)) | |
634 | se->block_max = delta; | |
635 | ||
636 | se->block_start = 0; | |
637 | se->sum_sleep_runtime += delta; | |
30084fbd IM |
638 | |
639 | /* | |
640 | * Blocking time is in units of nanosecs, so shift by 20 to | |
641 | * get a milliseconds-range estimation of the amount of | |
642 | * time that the task spent sleeping: | |
643 | */ | |
644 | if (unlikely(prof_on == SLEEP_PROFILING)) { | |
e22f5bbf | 645 | |
30084fbd IM |
646 | profile_hits(SLEEP_PROFILING, (void *)get_wchan(tsk), |
647 | delta >> 20); | |
648 | } | |
9745512c | 649 | account_scheduler_latency(tsk, delta >> 10, 0); |
bf0f6f24 IM |
650 | } |
651 | #endif | |
652 | } | |
653 | ||
ddc97297 PZ |
654 | static void check_spread(struct cfs_rq *cfs_rq, struct sched_entity *se) |
655 | { | |
656 | #ifdef CONFIG_SCHED_DEBUG | |
657 | s64 d = se->vruntime - cfs_rq->min_vruntime; | |
658 | ||
659 | if (d < 0) | |
660 | d = -d; | |
661 | ||
662 | if (d > 3*sysctl_sched_latency) | |
663 | schedstat_inc(cfs_rq, nr_spread_over); | |
664 | #endif | |
665 | } | |
666 | ||
aeb73b04 PZ |
667 | static void |
668 | place_entity(struct cfs_rq *cfs_rq, struct sched_entity *se, int initial) | |
669 | { | |
1af5f730 | 670 | u64 vruntime = cfs_rq->min_vruntime; |
94dfb5e7 | 671 | |
2cb8600e PZ |
672 | /* |
673 | * The 'current' period is already promised to the current tasks, | |
674 | * however the extra weight of the new task will slow them down a | |
675 | * little, place the new task so that it fits in the slot that | |
676 | * stays open at the end. | |
677 | */ | |
94dfb5e7 | 678 | if (initial && sched_feat(START_DEBIT)) |
f9c0b095 | 679 | vruntime += sched_vslice(cfs_rq, se); |
aeb73b04 | 680 | |
8465e792 | 681 | if (!initial) { |
2cb8600e | 682 | /* sleeps upto a single latency don't count. */ |
a7be37ac PZ |
683 | if (sched_feat(NEW_FAIR_SLEEPERS)) { |
684 | unsigned long thresh = sysctl_sched_latency; | |
685 | ||
686 | /* | |
687 | * convert the sleeper threshold into virtual time | |
688 | */ | |
689 | if (sched_feat(NORMALIZED_SLEEPER)) | |
690 | thresh = calc_delta_fair(thresh, se); | |
691 | ||
692 | vruntime -= thresh; | |
693 | } | |
94359f05 | 694 | |
2cb8600e PZ |
695 | /* ensure we never gain time by being placed backwards. */ |
696 | vruntime = max_vruntime(se->vruntime, vruntime); | |
aeb73b04 PZ |
697 | } |
698 | ||
67e9fb2a | 699 | se->vruntime = vruntime; |
aeb73b04 PZ |
700 | } |
701 | ||
bf0f6f24 | 702 | static void |
83b699ed | 703 | enqueue_entity(struct cfs_rq *cfs_rq, struct sched_entity *se, int wakeup) |
bf0f6f24 IM |
704 | { |
705 | /* | |
a2a2d680 | 706 | * Update run-time statistics of the 'current'. |
bf0f6f24 | 707 | */ |
b7cc0896 | 708 | update_curr(cfs_rq); |
a992241d | 709 | account_entity_enqueue(cfs_rq, se); |
bf0f6f24 | 710 | |
e9acbff6 | 711 | if (wakeup) { |
aeb73b04 | 712 | place_entity(cfs_rq, se, 0); |
2396af69 | 713 | enqueue_sleeper(cfs_rq, se); |
e9acbff6 | 714 | } |
bf0f6f24 | 715 | |
d2417e5a | 716 | update_stats_enqueue(cfs_rq, se); |
ddc97297 | 717 | check_spread(cfs_rq, se); |
83b699ed SV |
718 | if (se != cfs_rq->curr) |
719 | __enqueue_entity(cfs_rq, se); | |
bf0f6f24 IM |
720 | } |
721 | ||
722 | static void | |
525c2716 | 723 | dequeue_entity(struct cfs_rq *cfs_rq, struct sched_entity *se, int sleep) |
bf0f6f24 | 724 | { |
a2a2d680 DA |
725 | /* |
726 | * Update run-time statistics of the 'current'. | |
727 | */ | |
728 | update_curr(cfs_rq); | |
729 | ||
19b6a2e3 | 730 | update_stats_dequeue(cfs_rq, se); |
db36cc7d | 731 | if (sleep) { |
67e9fb2a | 732 | #ifdef CONFIG_SCHEDSTATS |
bf0f6f24 IM |
733 | if (entity_is_task(se)) { |
734 | struct task_struct *tsk = task_of(se); | |
735 | ||
736 | if (tsk->state & TASK_INTERRUPTIBLE) | |
d281918d | 737 | se->sleep_start = rq_of(cfs_rq)->clock; |
bf0f6f24 | 738 | if (tsk->state & TASK_UNINTERRUPTIBLE) |
d281918d | 739 | se->block_start = rq_of(cfs_rq)->clock; |
bf0f6f24 | 740 | } |
db36cc7d | 741 | #endif |
67e9fb2a PZ |
742 | } |
743 | ||
83b699ed | 744 | if (se != cfs_rq->curr) |
30cfdcfc DA |
745 | __dequeue_entity(cfs_rq, se); |
746 | account_entity_dequeue(cfs_rq, se); | |
1af5f730 | 747 | update_min_vruntime(cfs_rq); |
bf0f6f24 IM |
748 | } |
749 | ||
750 | /* | |
751 | * Preempt the current task with a newly woken task if needed: | |
752 | */ | |
7c92e54f | 753 | static void |
2e09bf55 | 754 | check_preempt_tick(struct cfs_rq *cfs_rq, struct sched_entity *curr) |
bf0f6f24 | 755 | { |
11697830 PZ |
756 | unsigned long ideal_runtime, delta_exec; |
757 | ||
6d0f0ebd | 758 | ideal_runtime = sched_slice(cfs_rq, curr); |
11697830 | 759 | delta_exec = curr->sum_exec_runtime - curr->prev_sum_exec_runtime; |
3e3e13f3 | 760 | if (delta_exec > ideal_runtime) |
bf0f6f24 IM |
761 | resched_task(rq_of(cfs_rq)->curr); |
762 | } | |
763 | ||
83b699ed | 764 | static void |
8494f412 | 765 | set_next_entity(struct cfs_rq *cfs_rq, struct sched_entity *se) |
bf0f6f24 | 766 | { |
83b699ed SV |
767 | /* 'current' is not kept within the tree. */ |
768 | if (se->on_rq) { | |
769 | /* | |
770 | * Any task has to be enqueued before it get to execute on | |
771 | * a CPU. So account for the time it spent waiting on the | |
772 | * runqueue. | |
773 | */ | |
774 | update_stats_wait_end(cfs_rq, se); | |
775 | __dequeue_entity(cfs_rq, se); | |
776 | } | |
777 | ||
79303e9e | 778 | update_stats_curr_start(cfs_rq, se); |
429d43bc | 779 | cfs_rq->curr = se; |
eba1ed4b IM |
780 | #ifdef CONFIG_SCHEDSTATS |
781 | /* | |
782 | * Track our maximum slice length, if the CPU's load is at | |
783 | * least twice that of our own weight (i.e. dont track it | |
784 | * when there are only lesser-weight tasks around): | |
785 | */ | |
495eca49 | 786 | if (rq_of(cfs_rq)->load.weight >= 2*se->load.weight) { |
eba1ed4b IM |
787 | se->slice_max = max(se->slice_max, |
788 | se->sum_exec_runtime - se->prev_sum_exec_runtime); | |
789 | } | |
790 | #endif | |
4a55b450 | 791 | se->prev_sum_exec_runtime = se->sum_exec_runtime; |
bf0f6f24 IM |
792 | } |
793 | ||
3f3a4904 PZ |
794 | static int |
795 | wakeup_preempt_entity(struct sched_entity *curr, struct sched_entity *se); | |
796 | ||
f4b6755f | 797 | static struct sched_entity *pick_next_entity(struct cfs_rq *cfs_rq) |
aa2ac252 | 798 | { |
f4b6755f PZ |
799 | struct sched_entity *se = __pick_next_entity(cfs_rq); |
800 | ||
3f3a4904 | 801 | if (!cfs_rq->next || wakeup_preempt_entity(cfs_rq->next, se) == 1) |
aa2ac252 PZ |
802 | return se; |
803 | ||
804 | return cfs_rq->next; | |
805 | } | |
806 | ||
ab6cde26 | 807 | static void put_prev_entity(struct cfs_rq *cfs_rq, struct sched_entity *prev) |
bf0f6f24 IM |
808 | { |
809 | /* | |
810 | * If still on the runqueue then deactivate_task() | |
811 | * was not called and update_curr() has to be done: | |
812 | */ | |
813 | if (prev->on_rq) | |
b7cc0896 | 814 | update_curr(cfs_rq); |
bf0f6f24 | 815 | |
ddc97297 | 816 | check_spread(cfs_rq, prev); |
30cfdcfc | 817 | if (prev->on_rq) { |
5870db5b | 818 | update_stats_wait_start(cfs_rq, prev); |
30cfdcfc DA |
819 | /* Put 'current' back into the tree. */ |
820 | __enqueue_entity(cfs_rq, prev); | |
821 | } | |
429d43bc | 822 | cfs_rq->curr = NULL; |
bf0f6f24 IM |
823 | } |
824 | ||
8f4d37ec PZ |
825 | static void |
826 | entity_tick(struct cfs_rq *cfs_rq, struct sched_entity *curr, int queued) | |
bf0f6f24 | 827 | { |
bf0f6f24 | 828 | /* |
30cfdcfc | 829 | * Update run-time statistics of the 'current'. |
bf0f6f24 | 830 | */ |
30cfdcfc | 831 | update_curr(cfs_rq); |
bf0f6f24 | 832 | |
8f4d37ec PZ |
833 | #ifdef CONFIG_SCHED_HRTICK |
834 | /* | |
835 | * queued ticks are scheduled to match the slice, so don't bother | |
836 | * validating it and just reschedule. | |
837 | */ | |
983ed7a6 HH |
838 | if (queued) { |
839 | resched_task(rq_of(cfs_rq)->curr); | |
840 | return; | |
841 | } | |
8f4d37ec PZ |
842 | /* |
843 | * don't let the period tick interfere with the hrtick preemption | |
844 | */ | |
845 | if (!sched_feat(DOUBLE_TICK) && | |
846 | hrtimer_active(&rq_of(cfs_rq)->hrtick_timer)) | |
847 | return; | |
848 | #endif | |
849 | ||
ce6c1311 | 850 | if (cfs_rq->nr_running > 1 || !sched_feat(WAKEUP_PREEMPT)) |
2e09bf55 | 851 | check_preempt_tick(cfs_rq, curr); |
bf0f6f24 IM |
852 | } |
853 | ||
854 | /************************************************** | |
855 | * CFS operations on tasks: | |
856 | */ | |
857 | ||
8f4d37ec PZ |
858 | #ifdef CONFIG_SCHED_HRTICK |
859 | static void hrtick_start_fair(struct rq *rq, struct task_struct *p) | |
860 | { | |
8f4d37ec PZ |
861 | struct sched_entity *se = &p->se; |
862 | struct cfs_rq *cfs_rq = cfs_rq_of(se); | |
863 | ||
864 | WARN_ON(task_rq(p) != rq); | |
865 | ||
866 | if (hrtick_enabled(rq) && cfs_rq->nr_running > 1) { | |
867 | u64 slice = sched_slice(cfs_rq, se); | |
868 | u64 ran = se->sum_exec_runtime - se->prev_sum_exec_runtime; | |
869 | s64 delta = slice - ran; | |
870 | ||
871 | if (delta < 0) { | |
872 | if (rq->curr == p) | |
873 | resched_task(p); | |
874 | return; | |
875 | } | |
876 | ||
877 | /* | |
878 | * Don't schedule slices shorter than 10000ns, that just | |
879 | * doesn't make sense. Rely on vruntime for fairness. | |
880 | */ | |
31656519 | 881 | if (rq->curr != p) |
157124c1 | 882 | delta = max_t(s64, 10000LL, delta); |
8f4d37ec | 883 | |
31656519 | 884 | hrtick_start(rq, delta); |
8f4d37ec PZ |
885 | } |
886 | } | |
a4c2f00f PZ |
887 | |
888 | /* | |
889 | * called from enqueue/dequeue and updates the hrtick when the | |
890 | * current task is from our class and nr_running is low enough | |
891 | * to matter. | |
892 | */ | |
893 | static void hrtick_update(struct rq *rq) | |
894 | { | |
895 | struct task_struct *curr = rq->curr; | |
896 | ||
897 | if (curr->sched_class != &fair_sched_class) | |
898 | return; | |
899 | ||
900 | if (cfs_rq_of(&curr->se)->nr_running < sched_nr_latency) | |
901 | hrtick_start_fair(rq, curr); | |
902 | } | |
55e12e5e | 903 | #else /* !CONFIG_SCHED_HRTICK */ |
8f4d37ec PZ |
904 | static inline void |
905 | hrtick_start_fair(struct rq *rq, struct task_struct *p) | |
906 | { | |
907 | } | |
a4c2f00f PZ |
908 | |
909 | static inline void hrtick_update(struct rq *rq) | |
910 | { | |
911 | } | |
8f4d37ec PZ |
912 | #endif |
913 | ||
bf0f6f24 IM |
914 | /* |
915 | * The enqueue_task method is called before nr_running is | |
916 | * increased. Here we update the fair scheduling stats and | |
917 | * then put the task into the rbtree: | |
918 | */ | |
fd390f6a | 919 | static void enqueue_task_fair(struct rq *rq, struct task_struct *p, int wakeup) |
bf0f6f24 IM |
920 | { |
921 | struct cfs_rq *cfs_rq; | |
62fb1851 | 922 | struct sched_entity *se = &p->se; |
bf0f6f24 IM |
923 | |
924 | for_each_sched_entity(se) { | |
62fb1851 | 925 | if (se->on_rq) |
bf0f6f24 IM |
926 | break; |
927 | cfs_rq = cfs_rq_of(se); | |
83b699ed | 928 | enqueue_entity(cfs_rq, se, wakeup); |
b9fa3df3 | 929 | wakeup = 1; |
bf0f6f24 | 930 | } |
8f4d37ec | 931 | |
a4c2f00f | 932 | hrtick_update(rq); |
bf0f6f24 IM |
933 | } |
934 | ||
935 | /* | |
936 | * The dequeue_task method is called before nr_running is | |
937 | * decreased. We remove the task from the rbtree and | |
938 | * update the fair scheduling stats: | |
939 | */ | |
f02231e5 | 940 | static void dequeue_task_fair(struct rq *rq, struct task_struct *p, int sleep) |
bf0f6f24 IM |
941 | { |
942 | struct cfs_rq *cfs_rq; | |
62fb1851 | 943 | struct sched_entity *se = &p->se; |
bf0f6f24 IM |
944 | |
945 | for_each_sched_entity(se) { | |
946 | cfs_rq = cfs_rq_of(se); | |
525c2716 | 947 | dequeue_entity(cfs_rq, se, sleep); |
bf0f6f24 | 948 | /* Don't dequeue parent if it has other entities besides us */ |
62fb1851 | 949 | if (cfs_rq->load.weight) |
bf0f6f24 | 950 | break; |
b9fa3df3 | 951 | sleep = 1; |
bf0f6f24 | 952 | } |
8f4d37ec | 953 | |
a4c2f00f | 954 | hrtick_update(rq); |
bf0f6f24 IM |
955 | } |
956 | ||
957 | /* | |
1799e35d IM |
958 | * sched_yield() support is very simple - we dequeue and enqueue. |
959 | * | |
960 | * If compat_yield is turned on then we requeue to the end of the tree. | |
bf0f6f24 | 961 | */ |
4530d7ab | 962 | static void yield_task_fair(struct rq *rq) |
bf0f6f24 | 963 | { |
db292ca3 IM |
964 | struct task_struct *curr = rq->curr; |
965 | struct cfs_rq *cfs_rq = task_cfs_rq(curr); | |
966 | struct sched_entity *rightmost, *se = &curr->se; | |
bf0f6f24 IM |
967 | |
968 | /* | |
1799e35d IM |
969 | * Are we the only task in the tree? |
970 | */ | |
971 | if (unlikely(cfs_rq->nr_running == 1)) | |
972 | return; | |
973 | ||
db292ca3 | 974 | if (likely(!sysctl_sched_compat_yield) && curr->policy != SCHED_BATCH) { |
3e51f33f | 975 | update_rq_clock(rq); |
1799e35d | 976 | /* |
a2a2d680 | 977 | * Update run-time statistics of the 'current'. |
1799e35d | 978 | */ |
2b1e315d | 979 | update_curr(cfs_rq); |
1799e35d IM |
980 | |
981 | return; | |
982 | } | |
983 | /* | |
984 | * Find the rightmost entry in the rbtree: | |
bf0f6f24 | 985 | */ |
2b1e315d | 986 | rightmost = __pick_last_entity(cfs_rq); |
1799e35d IM |
987 | /* |
988 | * Already in the rightmost position? | |
989 | */ | |
79b3feff | 990 | if (unlikely(!rightmost || rightmost->vruntime < se->vruntime)) |
1799e35d IM |
991 | return; |
992 | ||
993 | /* | |
994 | * Minimally necessary key value to be last in the tree: | |
2b1e315d DA |
995 | * Upon rescheduling, sched_class::put_prev_task() will place |
996 | * 'current' within the tree based on its new key value. | |
1799e35d | 997 | */ |
30cfdcfc | 998 | se->vruntime = rightmost->vruntime + 1; |
bf0f6f24 IM |
999 | } |
1000 | ||
e7693a36 GH |
1001 | /* |
1002 | * wake_idle() will wake a task on an idle cpu if task->cpu is | |
1003 | * not idle and an idle cpu is available. The span of cpus to | |
1004 | * search starts with cpus closest then further out as needed, | |
1005 | * so we always favor a closer, idle cpu. | |
e761b772 MK |
1006 | * Domains may include CPUs that are not usable for migration, |
1007 | * hence we need to mask them out (cpu_active_map) | |
e7693a36 GH |
1008 | * |
1009 | * Returns the CPU we should wake onto. | |
1010 | */ | |
1011 | #if defined(ARCH_HAS_SCHED_WAKE_IDLE) | |
1012 | static int wake_idle(int cpu, struct task_struct *p) | |
1013 | { | |
1014 | cpumask_t tmp; | |
1015 | struct sched_domain *sd; | |
1016 | int i; | |
1017 | ||
1018 | /* | |
1019 | * If it is idle, then it is the best cpu to run this task. | |
1020 | * | |
1021 | * This cpu is also the best, if it has more than one task already. | |
1022 | * Siblings must be also busy(in most cases) as they didn't already | |
1023 | * pickup the extra load from this cpu and hence we need not check | |
1024 | * sibling runqueue info. This will avoid the checks and cache miss | |
1025 | * penalities associated with that. | |
1026 | */ | |
104f6454 | 1027 | if (idle_cpu(cpu) || cpu_rq(cpu)->cfs.nr_running > 1) |
e7693a36 GH |
1028 | return cpu; |
1029 | ||
1030 | for_each_domain(cpu, sd) { | |
1d3504fc HS |
1031 | if ((sd->flags & SD_WAKE_IDLE) |
1032 | || ((sd->flags & SD_WAKE_IDLE_FAR) | |
1033 | && !task_hot(p, task_rq(p)->clock, sd))) { | |
e7693a36 | 1034 | cpus_and(tmp, sd->span, p->cpus_allowed); |
e761b772 | 1035 | cpus_and(tmp, tmp, cpu_active_map); |
363ab6f1 | 1036 | for_each_cpu_mask_nr(i, tmp) { |
e7693a36 GH |
1037 | if (idle_cpu(i)) { |
1038 | if (i != task_cpu(p)) { | |
1039 | schedstat_inc(p, | |
1040 | se.nr_wakeups_idle); | |
1041 | } | |
1042 | return i; | |
1043 | } | |
1044 | } | |
1045 | } else { | |
1046 | break; | |
1047 | } | |
1048 | } | |
1049 | return cpu; | |
1050 | } | |
55e12e5e | 1051 | #else /* !ARCH_HAS_SCHED_WAKE_IDLE*/ |
e7693a36 GH |
1052 | static inline int wake_idle(int cpu, struct task_struct *p) |
1053 | { | |
1054 | return cpu; | |
1055 | } | |
1056 | #endif | |
1057 | ||
1058 | #ifdef CONFIG_SMP | |
098fb9db | 1059 | |
bb3469ac | 1060 | #ifdef CONFIG_FAIR_GROUP_SCHED |
f5bfb7d9 PZ |
1061 | /* |
1062 | * effective_load() calculates the load change as seen from the root_task_group | |
1063 | * | |
1064 | * Adding load to a group doesn't make a group heavier, but can cause movement | |
1065 | * of group shares between cpus. Assuming the shares were perfectly aligned one | |
1066 | * can calculate the shift in shares. | |
1067 | * | |
1068 | * The problem is that perfectly aligning the shares is rather expensive, hence | |
1069 | * we try to avoid doing that too often - see update_shares(), which ratelimits | |
1070 | * this change. | |
1071 | * | |
1072 | * We compensate this by not only taking the current delta into account, but | |
1073 | * also considering the delta between when the shares were last adjusted and | |
1074 | * now. | |
1075 | * | |
1076 | * We still saw a performance dip, some tracing learned us that between | |
1077 | * cgroup:/ and cgroup:/foo balancing the number of affine wakeups increased | |
1078 | * significantly. Therefore try to bias the error in direction of failing | |
1079 | * the affine wakeup. | |
1080 | * | |
1081 | */ | |
f1d239f7 PZ |
1082 | static long effective_load(struct task_group *tg, int cpu, |
1083 | long wl, long wg) | |
bb3469ac | 1084 | { |
4be9daaa | 1085 | struct sched_entity *se = tg->se[cpu]; |
f1d239f7 PZ |
1086 | |
1087 | if (!tg->parent) | |
1088 | return wl; | |
1089 | ||
f5bfb7d9 PZ |
1090 | /* |
1091 | * By not taking the decrease of shares on the other cpu into | |
1092 | * account our error leans towards reducing the affine wakeups. | |
1093 | */ | |
1094 | if (!wl && sched_feat(ASYM_EFF_LOAD)) | |
1095 | return wl; | |
1096 | ||
4be9daaa | 1097 | for_each_sched_entity(se) { |
cb5ef42a | 1098 | long S, rw, s, a, b; |
940959e9 PZ |
1099 | long more_w; |
1100 | ||
1101 | /* | |
1102 | * Instead of using this increment, also add the difference | |
1103 | * between when the shares were last updated and now. | |
1104 | */ | |
1105 | more_w = se->my_q->load.weight - se->my_q->rq_weight; | |
1106 | wl += more_w; | |
1107 | wg += more_w; | |
4be9daaa PZ |
1108 | |
1109 | S = se->my_q->tg->shares; | |
1110 | s = se->my_q->shares; | |
f1d239f7 | 1111 | rw = se->my_q->rq_weight; |
bb3469ac | 1112 | |
cb5ef42a PZ |
1113 | a = S*(rw + wl); |
1114 | b = S*rw + s*wg; | |
4be9daaa | 1115 | |
940959e9 PZ |
1116 | wl = s*(a-b); |
1117 | ||
1118 | if (likely(b)) | |
1119 | wl /= b; | |
1120 | ||
83378269 PZ |
1121 | /* |
1122 | * Assume the group is already running and will | |
1123 | * thus already be accounted for in the weight. | |
1124 | * | |
1125 | * That is, moving shares between CPUs, does not | |
1126 | * alter the group weight. | |
1127 | */ | |
4be9daaa | 1128 | wg = 0; |
4be9daaa | 1129 | } |
bb3469ac | 1130 | |
4be9daaa | 1131 | return wl; |
bb3469ac | 1132 | } |
4be9daaa | 1133 | |
bb3469ac | 1134 | #else |
4be9daaa | 1135 | |
83378269 PZ |
1136 | static inline unsigned long effective_load(struct task_group *tg, int cpu, |
1137 | unsigned long wl, unsigned long wg) | |
4be9daaa | 1138 | { |
83378269 | 1139 | return wl; |
bb3469ac | 1140 | } |
4be9daaa | 1141 | |
bb3469ac PZ |
1142 | #endif |
1143 | ||
098fb9db | 1144 | static int |
64b9e029 | 1145 | wake_affine(struct sched_domain *this_sd, struct rq *this_rq, |
4ae7d5ce IM |
1146 | struct task_struct *p, int prev_cpu, int this_cpu, int sync, |
1147 | int idx, unsigned long load, unsigned long this_load, | |
098fb9db IM |
1148 | unsigned int imbalance) |
1149 | { | |
4ae7d5ce | 1150 | struct task_struct *curr = this_rq->curr; |
83378269 | 1151 | struct task_group *tg; |
098fb9db IM |
1152 | unsigned long tl = this_load; |
1153 | unsigned long tl_per_task; | |
83378269 | 1154 | unsigned long weight; |
b3137bc8 | 1155 | int balanced; |
098fb9db | 1156 | |
b3137bc8 | 1157 | if (!(this_sd->flags & SD_WAKE_AFFINE) || !sched_feat(AFFINE_WAKEUPS)) |
098fb9db IM |
1158 | return 0; |
1159 | ||
0d13033b MG |
1160 | if (sync && (curr->se.avg_overlap > sysctl_sched_migration_cost || |
1161 | p->se.avg_overlap > sysctl_sched_migration_cost)) | |
1162 | sync = 0; | |
2fb7635c | 1163 | |
b3137bc8 MG |
1164 | /* |
1165 | * If sync wakeup then subtract the (maximum possible) | |
1166 | * effect of the currently running task from the load | |
1167 | * of the current CPU: | |
1168 | */ | |
83378269 PZ |
1169 | if (sync) { |
1170 | tg = task_group(current); | |
1171 | weight = current->se.load.weight; | |
1172 | ||
1173 | tl += effective_load(tg, this_cpu, -weight, -weight); | |
1174 | load += effective_load(tg, prev_cpu, 0, -weight); | |
1175 | } | |
b3137bc8 | 1176 | |
83378269 PZ |
1177 | tg = task_group(p); |
1178 | weight = p->se.load.weight; | |
b3137bc8 | 1179 | |
83378269 PZ |
1180 | balanced = 100*(tl + effective_load(tg, this_cpu, weight, weight)) <= |
1181 | imbalance*(load + effective_load(tg, prev_cpu, 0, weight)); | |
b3137bc8 | 1182 | |
098fb9db | 1183 | /* |
4ae7d5ce IM |
1184 | * If the currently running task will sleep within |
1185 | * a reasonable amount of time then attract this newly | |
1186 | * woken task: | |
098fb9db | 1187 | */ |
2fb7635c PZ |
1188 | if (sync && balanced) |
1189 | return 1; | |
098fb9db IM |
1190 | |
1191 | schedstat_inc(p, se.nr_wakeups_affine_attempts); | |
1192 | tl_per_task = cpu_avg_load_per_task(this_cpu); | |
1193 | ||
64b9e029 AA |
1194 | if (balanced || (tl <= load && tl + target_load(prev_cpu, idx) <= |
1195 | tl_per_task)) { | |
098fb9db IM |
1196 | /* |
1197 | * This domain has SD_WAKE_AFFINE and | |
1198 | * p is cache cold in this domain, and | |
1199 | * there is no bad imbalance. | |
1200 | */ | |
1201 | schedstat_inc(this_sd, ttwu_move_affine); | |
1202 | schedstat_inc(p, se.nr_wakeups_affine); | |
1203 | ||
1204 | return 1; | |
1205 | } | |
1206 | return 0; | |
1207 | } | |
1208 | ||
e7693a36 GH |
1209 | static int select_task_rq_fair(struct task_struct *p, int sync) |
1210 | { | |
e7693a36 | 1211 | struct sched_domain *sd, *this_sd = NULL; |
ac192d39 | 1212 | int prev_cpu, this_cpu, new_cpu; |
098fb9db | 1213 | unsigned long load, this_load; |
64b9e029 | 1214 | struct rq *this_rq; |
098fb9db | 1215 | unsigned int imbalance; |
098fb9db | 1216 | int idx; |
e7693a36 | 1217 | |
ac192d39 | 1218 | prev_cpu = task_cpu(p); |
ac192d39 | 1219 | this_cpu = smp_processor_id(); |
4ae7d5ce | 1220 | this_rq = cpu_rq(this_cpu); |
ac192d39 | 1221 | new_cpu = prev_cpu; |
e7693a36 | 1222 | |
64b9e029 AA |
1223 | if (prev_cpu == this_cpu) |
1224 | goto out; | |
ac192d39 IM |
1225 | /* |
1226 | * 'this_sd' is the first domain that both | |
1227 | * this_cpu and prev_cpu are present in: | |
1228 | */ | |
e7693a36 | 1229 | for_each_domain(this_cpu, sd) { |
ac192d39 | 1230 | if (cpu_isset(prev_cpu, sd->span)) { |
e7693a36 GH |
1231 | this_sd = sd; |
1232 | break; | |
1233 | } | |
1234 | } | |
1235 | ||
1236 | if (unlikely(!cpu_isset(this_cpu, p->cpus_allowed))) | |
f4827386 | 1237 | goto out; |
e7693a36 GH |
1238 | |
1239 | /* | |
1240 | * Check for affine wakeup and passive balancing possibilities. | |
1241 | */ | |
098fb9db | 1242 | if (!this_sd) |
f4827386 | 1243 | goto out; |
e7693a36 | 1244 | |
098fb9db IM |
1245 | idx = this_sd->wake_idx; |
1246 | ||
1247 | imbalance = 100 + (this_sd->imbalance_pct - 100) / 2; | |
1248 | ||
ac192d39 | 1249 | load = source_load(prev_cpu, idx); |
098fb9db IM |
1250 | this_load = target_load(this_cpu, idx); |
1251 | ||
64b9e029 | 1252 | if (wake_affine(this_sd, this_rq, p, prev_cpu, this_cpu, sync, idx, |
4ae7d5ce IM |
1253 | load, this_load, imbalance)) |
1254 | return this_cpu; | |
1255 | ||
098fb9db IM |
1256 | /* |
1257 | * Start passive balancing when half the imbalance_pct | |
1258 | * limit is reached. | |
1259 | */ | |
1260 | if (this_sd->flags & SD_WAKE_BALANCE) { | |
1261 | if (imbalance*this_load <= 100*load) { | |
1262 | schedstat_inc(this_sd, ttwu_move_balance); | |
1263 | schedstat_inc(p, se.nr_wakeups_passive); | |
4ae7d5ce | 1264 | return this_cpu; |
e7693a36 GH |
1265 | } |
1266 | } | |
1267 | ||
f4827386 | 1268 | out: |
e7693a36 GH |
1269 | return wake_idle(new_cpu, p); |
1270 | } | |
1271 | #endif /* CONFIG_SMP */ | |
1272 | ||
0bbd3336 PZ |
1273 | static unsigned long wakeup_gran(struct sched_entity *se) |
1274 | { | |
1275 | unsigned long gran = sysctl_sched_wakeup_granularity; | |
1276 | ||
1277 | /* | |
a7be37ac PZ |
1278 | * More easily preempt - nice tasks, while not making it harder for |
1279 | * + nice tasks. | |
0bbd3336 | 1280 | */ |
464b7527 PZ |
1281 | if (!sched_feat(ASYM_GRAN) || se->load.weight > NICE_0_LOAD) |
1282 | gran = calc_delta_fair(sysctl_sched_wakeup_granularity, se); | |
0bbd3336 PZ |
1283 | |
1284 | return gran; | |
1285 | } | |
1286 | ||
464b7527 PZ |
1287 | /* |
1288 | * Should 'se' preempt 'curr'. | |
1289 | * | |
1290 | * |s1 | |
1291 | * |s2 | |
1292 | * |s3 | |
1293 | * g | |
1294 | * |<--->|c | |
1295 | * | |
1296 | * w(c, s1) = -1 | |
1297 | * w(c, s2) = 0 | |
1298 | * w(c, s3) = 1 | |
1299 | * | |
1300 | */ | |
1301 | static int | |
1302 | wakeup_preempt_entity(struct sched_entity *curr, struct sched_entity *se) | |
1303 | { | |
1304 | s64 gran, vdiff = curr->vruntime - se->vruntime; | |
1305 | ||
1306 | if (vdiff <= 0) | |
1307 | return -1; | |
1308 | ||
1309 | gran = wakeup_gran(curr); | |
1310 | if (vdiff > gran) | |
1311 | return 1; | |
1312 | ||
1313 | return 0; | |
1314 | } | |
1315 | ||
bf0f6f24 IM |
1316 | /* |
1317 | * Preempt the current task with a newly woken task if needed: | |
1318 | */ | |
15afe09b | 1319 | static void check_preempt_wakeup(struct rq *rq, struct task_struct *p, int sync) |
bf0f6f24 IM |
1320 | { |
1321 | struct task_struct *curr = rq->curr; | |
fad095a7 | 1322 | struct cfs_rq *cfs_rq = task_cfs_rq(curr); |
8651a86c | 1323 | struct sched_entity *se = &curr->se, *pse = &p->se; |
bf0f6f24 IM |
1324 | |
1325 | if (unlikely(rt_prio(p->prio))) { | |
a8e504d2 | 1326 | update_rq_clock(rq); |
b7cc0896 | 1327 | update_curr(cfs_rq); |
bf0f6f24 IM |
1328 | resched_task(curr); |
1329 | return; | |
1330 | } | |
aa2ac252 | 1331 | |
4ae7d5ce IM |
1332 | if (unlikely(se == pse)) |
1333 | return; | |
1334 | ||
57fdc26d PZ |
1335 | cfs_rq_of(pse)->next = pse; |
1336 | ||
aec0a514 BR |
1337 | /* |
1338 | * We can come here with TIF_NEED_RESCHED already set from new task | |
1339 | * wake up path. | |
1340 | */ | |
1341 | if (test_tsk_need_resched(curr)) | |
1342 | return; | |
1343 | ||
91c234b4 IM |
1344 | /* |
1345 | * Batch tasks do not preempt (their preemption is driven by | |
1346 | * the tick): | |
1347 | */ | |
1348 | if (unlikely(p->policy == SCHED_BATCH)) | |
1349 | return; | |
bf0f6f24 | 1350 | |
77d9cc44 IM |
1351 | if (!sched_feat(WAKEUP_PREEMPT)) |
1352 | return; | |
8651a86c | 1353 | |
2fb7635c PZ |
1354 | if (sched_feat(WAKEUP_OVERLAP) && (sync || |
1355 | (se->avg_overlap < sysctl_sched_migration_cost && | |
1356 | pse->avg_overlap < sysctl_sched_migration_cost))) { | |
15afe09b PZ |
1357 | resched_task(curr); |
1358 | return; | |
1359 | } | |
1360 | ||
464b7527 PZ |
1361 | find_matching_se(&se, &pse); |
1362 | ||
1363 | while (se) { | |
1364 | BUG_ON(!pse); | |
1365 | ||
1366 | if (wakeup_preempt_entity(se, pse) == 1) { | |
1367 | resched_task(curr); | |
1368 | break; | |
1369 | } | |
1370 | ||
1371 | se = parent_entity(se); | |
1372 | pse = parent_entity(pse); | |
1373 | } | |
bf0f6f24 IM |
1374 | } |
1375 | ||
fb8d4724 | 1376 | static struct task_struct *pick_next_task_fair(struct rq *rq) |
bf0f6f24 | 1377 | { |
8f4d37ec | 1378 | struct task_struct *p; |
bf0f6f24 IM |
1379 | struct cfs_rq *cfs_rq = &rq->cfs; |
1380 | struct sched_entity *se; | |
1381 | ||
1382 | if (unlikely(!cfs_rq->nr_running)) | |
1383 | return NULL; | |
1384 | ||
1385 | do { | |
9948f4b2 | 1386 | se = pick_next_entity(cfs_rq); |
f4b6755f | 1387 | set_next_entity(cfs_rq, se); |
bf0f6f24 IM |
1388 | cfs_rq = group_cfs_rq(se); |
1389 | } while (cfs_rq); | |
1390 | ||
8f4d37ec PZ |
1391 | p = task_of(se); |
1392 | hrtick_start_fair(rq, p); | |
1393 | ||
1394 | return p; | |
bf0f6f24 IM |
1395 | } |
1396 | ||
1397 | /* | |
1398 | * Account for a descheduled task: | |
1399 | */ | |
31ee529c | 1400 | static void put_prev_task_fair(struct rq *rq, struct task_struct *prev) |
bf0f6f24 IM |
1401 | { |
1402 | struct sched_entity *se = &prev->se; | |
1403 | struct cfs_rq *cfs_rq; | |
1404 | ||
1405 | for_each_sched_entity(se) { | |
1406 | cfs_rq = cfs_rq_of(se); | |
ab6cde26 | 1407 | put_prev_entity(cfs_rq, se); |
bf0f6f24 IM |
1408 | } |
1409 | } | |
1410 | ||
681f3e68 | 1411 | #ifdef CONFIG_SMP |
bf0f6f24 IM |
1412 | /************************************************** |
1413 | * Fair scheduling class load-balancing methods: | |
1414 | */ | |
1415 | ||
1416 | /* | |
1417 | * Load-balancing iterator. Note: while the runqueue stays locked | |
1418 | * during the whole iteration, the current task might be | |
1419 | * dequeued so the iterator has to be dequeue-safe. Here we | |
1420 | * achieve that by always pre-iterating before returning | |
1421 | * the current task: | |
1422 | */ | |
a9957449 | 1423 | static struct task_struct * |
4a55bd5e | 1424 | __load_balance_iterator(struct cfs_rq *cfs_rq, struct list_head *next) |
bf0f6f24 | 1425 | { |
354d60c2 DG |
1426 | struct task_struct *p = NULL; |
1427 | struct sched_entity *se; | |
bf0f6f24 | 1428 | |
77ae6513 MG |
1429 | if (next == &cfs_rq->tasks) |
1430 | return NULL; | |
1431 | ||
b87f1724 BR |
1432 | se = list_entry(next, struct sched_entity, group_node); |
1433 | p = task_of(se); | |
1434 | cfs_rq->balance_iterator = next->next; | |
77ae6513 | 1435 | |
bf0f6f24 IM |
1436 | return p; |
1437 | } | |
1438 | ||
1439 | static struct task_struct *load_balance_start_fair(void *arg) | |
1440 | { | |
1441 | struct cfs_rq *cfs_rq = arg; | |
1442 | ||
4a55bd5e | 1443 | return __load_balance_iterator(cfs_rq, cfs_rq->tasks.next); |
bf0f6f24 IM |
1444 | } |
1445 | ||
1446 | static struct task_struct *load_balance_next_fair(void *arg) | |
1447 | { | |
1448 | struct cfs_rq *cfs_rq = arg; | |
1449 | ||
4a55bd5e | 1450 | return __load_balance_iterator(cfs_rq, cfs_rq->balance_iterator); |
bf0f6f24 IM |
1451 | } |
1452 | ||
c09595f6 PZ |
1453 | static unsigned long |
1454 | __load_balance_fair(struct rq *this_rq, int this_cpu, struct rq *busiest, | |
1455 | unsigned long max_load_move, struct sched_domain *sd, | |
1456 | enum cpu_idle_type idle, int *all_pinned, int *this_best_prio, | |
1457 | struct cfs_rq *cfs_rq) | |
62fb1851 | 1458 | { |
c09595f6 | 1459 | struct rq_iterator cfs_rq_iterator; |
62fb1851 | 1460 | |
c09595f6 PZ |
1461 | cfs_rq_iterator.start = load_balance_start_fair; |
1462 | cfs_rq_iterator.next = load_balance_next_fair; | |
1463 | cfs_rq_iterator.arg = cfs_rq; | |
62fb1851 | 1464 | |
c09595f6 PZ |
1465 | return balance_tasks(this_rq, this_cpu, busiest, |
1466 | max_load_move, sd, idle, all_pinned, | |
1467 | this_best_prio, &cfs_rq_iterator); | |
62fb1851 | 1468 | } |
62fb1851 | 1469 | |
c09595f6 | 1470 | #ifdef CONFIG_FAIR_GROUP_SCHED |
43010659 | 1471 | static unsigned long |
bf0f6f24 | 1472 | load_balance_fair(struct rq *this_rq, int this_cpu, struct rq *busiest, |
e1d1484f | 1473 | unsigned long max_load_move, |
a4ac01c3 PW |
1474 | struct sched_domain *sd, enum cpu_idle_type idle, |
1475 | int *all_pinned, int *this_best_prio) | |
bf0f6f24 | 1476 | { |
bf0f6f24 | 1477 | long rem_load_move = max_load_move; |
c09595f6 PZ |
1478 | int busiest_cpu = cpu_of(busiest); |
1479 | struct task_group *tg; | |
18d95a28 | 1480 | |
c09595f6 | 1481 | rcu_read_lock(); |
c8cba857 | 1482 | update_h_load(busiest_cpu); |
18d95a28 | 1483 | |
caea8a03 | 1484 | list_for_each_entry_rcu(tg, &task_groups, list) { |
c8cba857 | 1485 | struct cfs_rq *busiest_cfs_rq = tg->cfs_rq[busiest_cpu]; |
42a3ac7d PZ |
1486 | unsigned long busiest_h_load = busiest_cfs_rq->h_load; |
1487 | unsigned long busiest_weight = busiest_cfs_rq->load.weight; | |
243e0e7b | 1488 | u64 rem_load, moved_load; |
18d95a28 | 1489 | |
c09595f6 PZ |
1490 | /* |
1491 | * empty group | |
1492 | */ | |
c8cba857 | 1493 | if (!busiest_cfs_rq->task_weight) |
bf0f6f24 IM |
1494 | continue; |
1495 | ||
243e0e7b SV |
1496 | rem_load = (u64)rem_load_move * busiest_weight; |
1497 | rem_load = div_u64(rem_load, busiest_h_load + 1); | |
bf0f6f24 | 1498 | |
c09595f6 | 1499 | moved_load = __load_balance_fair(this_rq, this_cpu, busiest, |
53fecd8a | 1500 | rem_load, sd, idle, all_pinned, this_best_prio, |
c09595f6 | 1501 | tg->cfs_rq[busiest_cpu]); |
bf0f6f24 | 1502 | |
c09595f6 | 1503 | if (!moved_load) |
bf0f6f24 IM |
1504 | continue; |
1505 | ||
42a3ac7d | 1506 | moved_load *= busiest_h_load; |
243e0e7b | 1507 | moved_load = div_u64(moved_load, busiest_weight + 1); |
bf0f6f24 | 1508 | |
c09595f6 PZ |
1509 | rem_load_move -= moved_load; |
1510 | if (rem_load_move < 0) | |
bf0f6f24 IM |
1511 | break; |
1512 | } | |
c09595f6 | 1513 | rcu_read_unlock(); |
bf0f6f24 | 1514 | |
43010659 | 1515 | return max_load_move - rem_load_move; |
bf0f6f24 | 1516 | } |
c09595f6 PZ |
1517 | #else |
1518 | static unsigned long | |
1519 | load_balance_fair(struct rq *this_rq, int this_cpu, struct rq *busiest, | |
1520 | unsigned long max_load_move, | |
1521 | struct sched_domain *sd, enum cpu_idle_type idle, | |
1522 | int *all_pinned, int *this_best_prio) | |
1523 | { | |
1524 | return __load_balance_fair(this_rq, this_cpu, busiest, | |
1525 | max_load_move, sd, idle, all_pinned, | |
1526 | this_best_prio, &busiest->cfs); | |
1527 | } | |
1528 | #endif | |
bf0f6f24 | 1529 | |
e1d1484f PW |
1530 | static int |
1531 | move_one_task_fair(struct rq *this_rq, int this_cpu, struct rq *busiest, | |
1532 | struct sched_domain *sd, enum cpu_idle_type idle) | |
1533 | { | |
1534 | struct cfs_rq *busy_cfs_rq; | |
1535 | struct rq_iterator cfs_rq_iterator; | |
1536 | ||
1537 | cfs_rq_iterator.start = load_balance_start_fair; | |
1538 | cfs_rq_iterator.next = load_balance_next_fair; | |
1539 | ||
1540 | for_each_leaf_cfs_rq(busiest, busy_cfs_rq) { | |
1541 | /* | |
1542 | * pass busy_cfs_rq argument into | |
1543 | * load_balance_[start|next]_fair iterators | |
1544 | */ | |
1545 | cfs_rq_iterator.arg = busy_cfs_rq; | |
1546 | if (iter_move_one_task(this_rq, this_cpu, busiest, sd, idle, | |
1547 | &cfs_rq_iterator)) | |
1548 | return 1; | |
1549 | } | |
1550 | ||
1551 | return 0; | |
1552 | } | |
55e12e5e | 1553 | #endif /* CONFIG_SMP */ |
e1d1484f | 1554 | |
bf0f6f24 IM |
1555 | /* |
1556 | * scheduler tick hitting a task of our scheduling class: | |
1557 | */ | |
8f4d37ec | 1558 | static void task_tick_fair(struct rq *rq, struct task_struct *curr, int queued) |
bf0f6f24 IM |
1559 | { |
1560 | struct cfs_rq *cfs_rq; | |
1561 | struct sched_entity *se = &curr->se; | |
1562 | ||
1563 | for_each_sched_entity(se) { | |
1564 | cfs_rq = cfs_rq_of(se); | |
8f4d37ec | 1565 | entity_tick(cfs_rq, se, queued); |
bf0f6f24 IM |
1566 | } |
1567 | } | |
1568 | ||
8eb172d9 | 1569 | #define swap(a, b) do { typeof(a) tmp = (a); (a) = (b); (b) = tmp; } while (0) |
4d78e7b6 | 1570 | |
bf0f6f24 IM |
1571 | /* |
1572 | * Share the fairness runtime between parent and child, thus the | |
1573 | * total amount of pressure for CPU stays equal - new tasks | |
1574 | * get a chance to run but frequent forkers are not allowed to | |
1575 | * monopolize the CPU. Note: the parent runqueue is locked, | |
1576 | * the child is not running yet. | |
1577 | */ | |
ee0827d8 | 1578 | static void task_new_fair(struct rq *rq, struct task_struct *p) |
bf0f6f24 IM |
1579 | { |
1580 | struct cfs_rq *cfs_rq = task_cfs_rq(p); | |
429d43bc | 1581 | struct sched_entity *se = &p->se, *curr = cfs_rq->curr; |
00bf7bfc | 1582 | int this_cpu = smp_processor_id(); |
bf0f6f24 IM |
1583 | |
1584 | sched_info_queued(p); | |
1585 | ||
7109c442 | 1586 | update_curr(cfs_rq); |
aeb73b04 | 1587 | place_entity(cfs_rq, se, 1); |
4d78e7b6 | 1588 | |
3c90e6e9 | 1589 | /* 'curr' will be NULL if the child belongs to a different group */ |
00bf7bfc | 1590 | if (sysctl_sched_child_runs_first && this_cpu == task_cpu(p) && |
3c90e6e9 | 1591 | curr && curr->vruntime < se->vruntime) { |
87fefa38 | 1592 | /* |
edcb60a3 IM |
1593 | * Upon rescheduling, sched_class::put_prev_task() will place |
1594 | * 'current' within the tree based on its new key value. | |
1595 | */ | |
4d78e7b6 | 1596 | swap(curr->vruntime, se->vruntime); |
aec0a514 | 1597 | resched_task(rq->curr); |
4d78e7b6 | 1598 | } |
bf0f6f24 | 1599 | |
b9dca1e0 | 1600 | enqueue_task_fair(rq, p, 0); |
bf0f6f24 IM |
1601 | } |
1602 | ||
cb469845 SR |
1603 | /* |
1604 | * Priority of the task has changed. Check to see if we preempt | |
1605 | * the current task. | |
1606 | */ | |
1607 | static void prio_changed_fair(struct rq *rq, struct task_struct *p, | |
1608 | int oldprio, int running) | |
1609 | { | |
1610 | /* | |
1611 | * Reschedule if we are currently running on this runqueue and | |
1612 | * our priority decreased, or if we are not currently running on | |
1613 | * this runqueue and our priority is higher than the current's | |
1614 | */ | |
1615 | if (running) { | |
1616 | if (p->prio > oldprio) | |
1617 | resched_task(rq->curr); | |
1618 | } else | |
15afe09b | 1619 | check_preempt_curr(rq, p, 0); |
cb469845 SR |
1620 | } |
1621 | ||
1622 | /* | |
1623 | * We switched to the sched_fair class. | |
1624 | */ | |
1625 | static void switched_to_fair(struct rq *rq, struct task_struct *p, | |
1626 | int running) | |
1627 | { | |
1628 | /* | |
1629 | * We were most likely switched from sched_rt, so | |
1630 | * kick off the schedule if running, otherwise just see | |
1631 | * if we can still preempt the current task. | |
1632 | */ | |
1633 | if (running) | |
1634 | resched_task(rq->curr); | |
1635 | else | |
15afe09b | 1636 | check_preempt_curr(rq, p, 0); |
cb469845 SR |
1637 | } |
1638 | ||
83b699ed SV |
1639 | /* Account for a task changing its policy or group. |
1640 | * | |
1641 | * This routine is mostly called to set cfs_rq->curr field when a task | |
1642 | * migrates between groups/classes. | |
1643 | */ | |
1644 | static void set_curr_task_fair(struct rq *rq) | |
1645 | { | |
1646 | struct sched_entity *se = &rq->curr->se; | |
1647 | ||
1648 | for_each_sched_entity(se) | |
1649 | set_next_entity(cfs_rq_of(se), se); | |
1650 | } | |
1651 | ||
810b3817 PZ |
1652 | #ifdef CONFIG_FAIR_GROUP_SCHED |
1653 | static void moved_group_fair(struct task_struct *p) | |
1654 | { | |
1655 | struct cfs_rq *cfs_rq = task_cfs_rq(p); | |
1656 | ||
1657 | update_curr(cfs_rq); | |
1658 | place_entity(cfs_rq, &p->se, 1); | |
1659 | } | |
1660 | #endif | |
1661 | ||
bf0f6f24 IM |
1662 | /* |
1663 | * All the scheduling class methods: | |
1664 | */ | |
5522d5d5 IM |
1665 | static const struct sched_class fair_sched_class = { |
1666 | .next = &idle_sched_class, | |
bf0f6f24 IM |
1667 | .enqueue_task = enqueue_task_fair, |
1668 | .dequeue_task = dequeue_task_fair, | |
1669 | .yield_task = yield_task_fair, | |
1670 | ||
2e09bf55 | 1671 | .check_preempt_curr = check_preempt_wakeup, |
bf0f6f24 IM |
1672 | |
1673 | .pick_next_task = pick_next_task_fair, | |
1674 | .put_prev_task = put_prev_task_fair, | |
1675 | ||
681f3e68 | 1676 | #ifdef CONFIG_SMP |
4ce72a2c LZ |
1677 | .select_task_rq = select_task_rq_fair, |
1678 | ||
bf0f6f24 | 1679 | .load_balance = load_balance_fair, |
e1d1484f | 1680 | .move_one_task = move_one_task_fair, |
681f3e68 | 1681 | #endif |
bf0f6f24 | 1682 | |
83b699ed | 1683 | .set_curr_task = set_curr_task_fair, |
bf0f6f24 IM |
1684 | .task_tick = task_tick_fair, |
1685 | .task_new = task_new_fair, | |
cb469845 SR |
1686 | |
1687 | .prio_changed = prio_changed_fair, | |
1688 | .switched_to = switched_to_fair, | |
810b3817 PZ |
1689 | |
1690 | #ifdef CONFIG_FAIR_GROUP_SCHED | |
1691 | .moved_group = moved_group_fair, | |
1692 | #endif | |
bf0f6f24 IM |
1693 | }; |
1694 | ||
1695 | #ifdef CONFIG_SCHED_DEBUG | |
5cef9eca | 1696 | static void print_cfs_stats(struct seq_file *m, int cpu) |
bf0f6f24 | 1697 | { |
bf0f6f24 IM |
1698 | struct cfs_rq *cfs_rq; |
1699 | ||
5973e5b9 | 1700 | rcu_read_lock(); |
c3b64f1e | 1701 | for_each_leaf_cfs_rq(cpu_rq(cpu), cfs_rq) |
5cef9eca | 1702 | print_cfs_rq(m, cpu, cfs_rq); |
5973e5b9 | 1703 | rcu_read_unlock(); |
bf0f6f24 IM |
1704 | } |
1705 | #endif |