]>
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 | ||
23 | /* | |
21805085 | 24 | * Targeted preemption latency for CPU-bound tasks: |
722aab0c | 25 | * (default: 20ms * (1 + ilog(ncpus)), units: nanoseconds) |
bf0f6f24 | 26 | * |
21805085 | 27 | * NOTE: this latency value is not the same as the concept of |
d274a4ce IM |
28 | * 'timeslice length' - timeslices in CFS are of variable length |
29 | * and have no persistent notion like in traditional, time-slice | |
30 | * based scheduling concepts. | |
bf0f6f24 | 31 | * |
d274a4ce IM |
32 | * (to see the precise effective timeslice length of your workload, |
33 | * run vmstat and monitor the context-switches (cs) field) | |
bf0f6f24 | 34 | */ |
19978ca6 | 35 | unsigned int sysctl_sched_latency = 20000000ULL; |
2bd8e6d4 IM |
36 | |
37 | /* | |
b2be5e96 | 38 | * Minimal preemption granularity for CPU-bound tasks: |
722aab0c | 39 | * (default: 4 msec * (1 + ilog(ncpus)), units: nanoseconds) |
2bd8e6d4 | 40 | */ |
722aab0c | 41 | unsigned int sysctl_sched_min_granularity = 4000000ULL; |
21805085 PZ |
42 | |
43 | /* | |
b2be5e96 PZ |
44 | * is kept at sysctl_sched_latency / sysctl_sched_min_granularity |
45 | */ | |
722aab0c | 46 | static unsigned int sched_nr_latency = 5; |
b2be5e96 PZ |
47 | |
48 | /* | |
49 | * After fork, child runs first. (default) If set to 0 then | |
50 | * parent will (try to) run first. | |
21805085 | 51 | */ |
b2be5e96 | 52 | const_debug unsigned int sysctl_sched_child_runs_first = 1; |
bf0f6f24 | 53 | |
1799e35d IM |
54 | /* |
55 | * sys_sched_yield() compat mode | |
56 | * | |
57 | * This option switches the agressive yield implementation of the | |
58 | * old scheduler back on. | |
59 | */ | |
60 | unsigned int __read_mostly sysctl_sched_compat_yield; | |
61 | ||
bf0f6f24 IM |
62 | /* |
63 | * SCHED_BATCH wake-up granularity. | |
722aab0c | 64 | * (default: 10 msec * (1 + ilog(ncpus)), units: nanoseconds) |
bf0f6f24 IM |
65 | * |
66 | * This option delays the preemption effects of decoupled workloads | |
67 | * and reduces their over-scheduling. Synchronous workloads will still | |
68 | * have immediate wakeup/sleep latencies. | |
69 | */ | |
19978ca6 | 70 | unsigned int sysctl_sched_batch_wakeup_granularity = 10000000UL; |
bf0f6f24 IM |
71 | |
72 | /* | |
73 | * SCHED_OTHER wake-up granularity. | |
722aab0c | 74 | * (default: 10 msec * (1 + ilog(ncpus)), units: nanoseconds) |
bf0f6f24 IM |
75 | * |
76 | * This option delays the preemption effects of decoupled workloads | |
77 | * and reduces their over-scheduling. Synchronous workloads will still | |
78 | * have immediate wakeup/sleep latencies. | |
79 | */ | |
19978ca6 | 80 | unsigned int sysctl_sched_wakeup_granularity = 10000000UL; |
bf0f6f24 | 81 | |
da84d961 IM |
82 | const_debug unsigned int sysctl_sched_migration_cost = 500000UL; |
83 | ||
bf0f6f24 IM |
84 | /************************************************************** |
85 | * CFS operations on generic schedulable entities: | |
86 | */ | |
87 | ||
62160e3f | 88 | #ifdef CONFIG_FAIR_GROUP_SCHED |
bf0f6f24 | 89 | |
62160e3f | 90 | /* cpu runqueue to which this cfs_rq is attached */ |
bf0f6f24 IM |
91 | static inline struct rq *rq_of(struct cfs_rq *cfs_rq) |
92 | { | |
62160e3f | 93 | return cfs_rq->rq; |
bf0f6f24 IM |
94 | } |
95 | ||
62160e3f IM |
96 | /* An entity is a task if it doesn't "own" a runqueue */ |
97 | #define entity_is_task(se) (!se->my_q) | |
bf0f6f24 | 98 | |
62160e3f | 99 | #else /* CONFIG_FAIR_GROUP_SCHED */ |
bf0f6f24 | 100 | |
62160e3f IM |
101 | static inline struct rq *rq_of(struct cfs_rq *cfs_rq) |
102 | { | |
103 | return container_of(cfs_rq, struct rq, cfs); | |
bf0f6f24 IM |
104 | } |
105 | ||
106 | #define entity_is_task(se) 1 | |
107 | ||
bf0f6f24 IM |
108 | #endif /* CONFIG_FAIR_GROUP_SCHED */ |
109 | ||
110 | static inline struct task_struct *task_of(struct sched_entity *se) | |
111 | { | |
112 | return container_of(se, struct task_struct, se); | |
113 | } | |
114 | ||
115 | ||
116 | /************************************************************** | |
117 | * Scheduling class tree data structure manipulation methods: | |
118 | */ | |
119 | ||
0702e3eb | 120 | static inline u64 max_vruntime(u64 min_vruntime, u64 vruntime) |
02e0431a | 121 | { |
368059a9 PZ |
122 | s64 delta = (s64)(vruntime - min_vruntime); |
123 | if (delta > 0) | |
02e0431a PZ |
124 | min_vruntime = vruntime; |
125 | ||
126 | return min_vruntime; | |
127 | } | |
128 | ||
0702e3eb | 129 | static inline u64 min_vruntime(u64 min_vruntime, u64 vruntime) |
b0ffd246 PZ |
130 | { |
131 | s64 delta = (s64)(vruntime - min_vruntime); | |
132 | if (delta < 0) | |
133 | min_vruntime = vruntime; | |
134 | ||
135 | return min_vruntime; | |
136 | } | |
137 | ||
0702e3eb | 138 | static inline s64 entity_key(struct cfs_rq *cfs_rq, struct sched_entity *se) |
9014623c | 139 | { |
30cfdcfc | 140 | return se->vruntime - cfs_rq->min_vruntime; |
9014623c PZ |
141 | } |
142 | ||
bf0f6f24 IM |
143 | /* |
144 | * Enqueue an entity into the rb-tree: | |
145 | */ | |
0702e3eb | 146 | static void __enqueue_entity(struct cfs_rq *cfs_rq, struct sched_entity *se) |
bf0f6f24 IM |
147 | { |
148 | struct rb_node **link = &cfs_rq->tasks_timeline.rb_node; | |
149 | struct rb_node *parent = NULL; | |
150 | struct sched_entity *entry; | |
9014623c | 151 | s64 key = entity_key(cfs_rq, se); |
bf0f6f24 IM |
152 | int leftmost = 1; |
153 | ||
154 | /* | |
155 | * Find the right place in the rbtree: | |
156 | */ | |
157 | while (*link) { | |
158 | parent = *link; | |
159 | entry = rb_entry(parent, struct sched_entity, run_node); | |
160 | /* | |
161 | * We dont care about collisions. Nodes with | |
162 | * the same key stay together. | |
163 | */ | |
9014623c | 164 | if (key < entity_key(cfs_rq, entry)) { |
bf0f6f24 IM |
165 | link = &parent->rb_left; |
166 | } else { | |
167 | link = &parent->rb_right; | |
168 | leftmost = 0; | |
169 | } | |
170 | } | |
171 | ||
172 | /* | |
173 | * Maintain a cache of leftmost tree entries (it is frequently | |
174 | * used): | |
175 | */ | |
176 | if (leftmost) | |
57cb499d | 177 | cfs_rq->rb_leftmost = &se->run_node; |
bf0f6f24 IM |
178 | |
179 | rb_link_node(&se->run_node, parent, link); | |
180 | rb_insert_color(&se->run_node, &cfs_rq->tasks_timeline); | |
bf0f6f24 IM |
181 | } |
182 | ||
0702e3eb | 183 | static void __dequeue_entity(struct cfs_rq *cfs_rq, struct sched_entity *se) |
bf0f6f24 IM |
184 | { |
185 | if (cfs_rq->rb_leftmost == &se->run_node) | |
57cb499d | 186 | cfs_rq->rb_leftmost = rb_next(&se->run_node); |
e9acbff6 | 187 | |
bf0f6f24 | 188 | rb_erase(&se->run_node, &cfs_rq->tasks_timeline); |
bf0f6f24 IM |
189 | } |
190 | ||
191 | static inline struct rb_node *first_fair(struct cfs_rq *cfs_rq) | |
192 | { | |
193 | return cfs_rq->rb_leftmost; | |
194 | } | |
195 | ||
196 | static struct sched_entity *__pick_next_entity(struct cfs_rq *cfs_rq) | |
197 | { | |
198 | return rb_entry(first_fair(cfs_rq), struct sched_entity, run_node); | |
199 | } | |
200 | ||
aeb73b04 PZ |
201 | static inline struct sched_entity *__pick_last_entity(struct cfs_rq *cfs_rq) |
202 | { | |
203 | struct rb_node **link = &cfs_rq->tasks_timeline.rb_node; | |
204 | struct sched_entity *se = NULL; | |
205 | struct rb_node *parent; | |
206 | ||
207 | while (*link) { | |
208 | parent = *link; | |
209 | se = rb_entry(parent, struct sched_entity, run_node); | |
210 | link = &parent->rb_right; | |
211 | } | |
212 | ||
213 | return se; | |
214 | } | |
215 | ||
bf0f6f24 IM |
216 | /************************************************************** |
217 | * Scheduling class statistics methods: | |
218 | */ | |
219 | ||
b2be5e96 PZ |
220 | #ifdef CONFIG_SCHED_DEBUG |
221 | int sched_nr_latency_handler(struct ctl_table *table, int write, | |
222 | struct file *filp, void __user *buffer, size_t *lenp, | |
223 | loff_t *ppos) | |
224 | { | |
225 | int ret = proc_dointvec_minmax(table, write, filp, buffer, lenp, ppos); | |
226 | ||
227 | if (ret || !write) | |
228 | return ret; | |
229 | ||
230 | sched_nr_latency = DIV_ROUND_UP(sysctl_sched_latency, | |
231 | sysctl_sched_min_granularity); | |
232 | ||
233 | return 0; | |
234 | } | |
235 | #endif | |
647e7cac IM |
236 | |
237 | /* | |
238 | * The idea is to set a period in which each task runs once. | |
239 | * | |
240 | * When there are too many tasks (sysctl_sched_nr_latency) we have to stretch | |
241 | * this period because otherwise the slices get too small. | |
242 | * | |
243 | * p = (nr <= nl) ? l : l*nr/nl | |
244 | */ | |
4d78e7b6 PZ |
245 | static u64 __sched_period(unsigned long nr_running) |
246 | { | |
247 | u64 period = sysctl_sched_latency; | |
b2be5e96 | 248 | unsigned long nr_latency = sched_nr_latency; |
4d78e7b6 PZ |
249 | |
250 | if (unlikely(nr_running > nr_latency)) { | |
251 | period *= nr_running; | |
252 | do_div(period, nr_latency); | |
253 | } | |
254 | ||
255 | return period; | |
256 | } | |
257 | ||
647e7cac IM |
258 | /* |
259 | * We calculate the wall-time slice from the period by taking a part | |
260 | * proportional to the weight. | |
261 | * | |
262 | * s = p*w/rw | |
263 | */ | |
6d0f0ebd | 264 | static u64 sched_slice(struct cfs_rq *cfs_rq, struct sched_entity *se) |
21805085 | 265 | { |
647e7cac | 266 | u64 slice = __sched_period(cfs_rq->nr_running); |
21805085 | 267 | |
647e7cac IM |
268 | slice *= se->load.weight; |
269 | do_div(slice, cfs_rq->load.weight); | |
21805085 | 270 | |
647e7cac | 271 | return slice; |
bf0f6f24 IM |
272 | } |
273 | ||
647e7cac IM |
274 | /* |
275 | * We calculate the vruntime slice. | |
276 | * | |
277 | * vs = s/w = p/rw | |
278 | */ | |
279 | static u64 __sched_vslice(unsigned long rq_weight, unsigned long nr_running) | |
67e9fb2a | 280 | { |
647e7cac | 281 | u64 vslice = __sched_period(nr_running); |
67e9fb2a | 282 | |
10b77724 | 283 | vslice *= NICE_0_LOAD; |
647e7cac | 284 | do_div(vslice, rq_weight); |
67e9fb2a | 285 | |
647e7cac IM |
286 | return vslice; |
287 | } | |
5f6d858e | 288 | |
647e7cac IM |
289 | static u64 sched_vslice(struct cfs_rq *cfs_rq) |
290 | { | |
291 | return __sched_vslice(cfs_rq->load.weight, cfs_rq->nr_running); | |
292 | } | |
293 | ||
294 | static u64 sched_vslice_add(struct cfs_rq *cfs_rq, struct sched_entity *se) | |
295 | { | |
296 | return __sched_vslice(cfs_rq->load.weight + se->load.weight, | |
297 | cfs_rq->nr_running + 1); | |
67e9fb2a PZ |
298 | } |
299 | ||
bf0f6f24 IM |
300 | /* |
301 | * Update the current task's runtime statistics. Skip current tasks that | |
302 | * are not in our scheduling class. | |
303 | */ | |
304 | static inline void | |
8ebc91d9 IM |
305 | __update_curr(struct cfs_rq *cfs_rq, struct sched_entity *curr, |
306 | unsigned long delta_exec) | |
bf0f6f24 | 307 | { |
bbdba7c0 | 308 | unsigned long delta_exec_weighted; |
b0ffd246 | 309 | u64 vruntime; |
bf0f6f24 | 310 | |
8179ca23 | 311 | schedstat_set(curr->exec_max, max((u64)delta_exec, curr->exec_max)); |
bf0f6f24 IM |
312 | |
313 | curr->sum_exec_runtime += delta_exec; | |
7a62eabc | 314 | schedstat_add(cfs_rq, exec_clock, delta_exec); |
e9acbff6 IM |
315 | delta_exec_weighted = delta_exec; |
316 | if (unlikely(curr->load.weight != NICE_0_LOAD)) { | |
317 | delta_exec_weighted = calc_delta_fair(delta_exec_weighted, | |
318 | &curr->load); | |
319 | } | |
320 | curr->vruntime += delta_exec_weighted; | |
02e0431a PZ |
321 | |
322 | /* | |
323 | * maintain cfs_rq->min_vruntime to be a monotonic increasing | |
324 | * value tracking the leftmost vruntime in the tree. | |
325 | */ | |
326 | if (first_fair(cfs_rq)) { | |
b0ffd246 PZ |
327 | vruntime = min_vruntime(curr->vruntime, |
328 | __pick_next_entity(cfs_rq)->vruntime); | |
02e0431a | 329 | } else |
b0ffd246 | 330 | vruntime = curr->vruntime; |
02e0431a PZ |
331 | |
332 | cfs_rq->min_vruntime = | |
b0ffd246 | 333 | max_vruntime(cfs_rq->min_vruntime, vruntime); |
bf0f6f24 IM |
334 | } |
335 | ||
b7cc0896 | 336 | static void update_curr(struct cfs_rq *cfs_rq) |
bf0f6f24 | 337 | { |
429d43bc | 338 | struct sched_entity *curr = cfs_rq->curr; |
8ebc91d9 | 339 | u64 now = rq_of(cfs_rq)->clock; |
bf0f6f24 IM |
340 | unsigned long delta_exec; |
341 | ||
342 | if (unlikely(!curr)) | |
343 | return; | |
344 | ||
345 | /* | |
346 | * Get the amount of time the current task was running | |
347 | * since the last time we changed load (this cannot | |
348 | * overflow on 32 bits): | |
349 | */ | |
8ebc91d9 | 350 | delta_exec = (unsigned long)(now - curr->exec_start); |
bf0f6f24 | 351 | |
8ebc91d9 IM |
352 | __update_curr(cfs_rq, curr, delta_exec); |
353 | curr->exec_start = now; | |
d842de87 SV |
354 | |
355 | if (entity_is_task(curr)) { | |
356 | struct task_struct *curtask = task_of(curr); | |
357 | ||
358 | cpuacct_charge(curtask, delta_exec); | |
359 | } | |
bf0f6f24 IM |
360 | } |
361 | ||
362 | static inline void | |
5870db5b | 363 | update_stats_wait_start(struct cfs_rq *cfs_rq, struct sched_entity *se) |
bf0f6f24 | 364 | { |
d281918d | 365 | schedstat_set(se->wait_start, rq_of(cfs_rq)->clock); |
bf0f6f24 IM |
366 | } |
367 | ||
bf0f6f24 IM |
368 | /* |
369 | * Task is being enqueued - update stats: | |
370 | */ | |
d2417e5a | 371 | static void update_stats_enqueue(struct cfs_rq *cfs_rq, struct sched_entity *se) |
bf0f6f24 | 372 | { |
bf0f6f24 IM |
373 | /* |
374 | * Are we enqueueing a waiting task? (for current tasks | |
375 | * a dequeue/enqueue event is a NOP) | |
376 | */ | |
429d43bc | 377 | if (se != cfs_rq->curr) |
5870db5b | 378 | update_stats_wait_start(cfs_rq, se); |
bf0f6f24 IM |
379 | } |
380 | ||
bf0f6f24 | 381 | static void |
9ef0a961 | 382 | update_stats_wait_end(struct cfs_rq *cfs_rq, struct sched_entity *se) |
bf0f6f24 | 383 | { |
bbdba7c0 IM |
384 | schedstat_set(se->wait_max, max(se->wait_max, |
385 | rq_of(cfs_rq)->clock - se->wait_start)); | |
6cfb0d5d | 386 | schedstat_set(se->wait_start, 0); |
bf0f6f24 IM |
387 | } |
388 | ||
389 | static inline void | |
19b6a2e3 | 390 | update_stats_dequeue(struct cfs_rq *cfs_rq, struct sched_entity *se) |
bf0f6f24 | 391 | { |
bf0f6f24 IM |
392 | /* |
393 | * Mark the end of the wait period if dequeueing a | |
394 | * waiting task: | |
395 | */ | |
429d43bc | 396 | if (se != cfs_rq->curr) |
9ef0a961 | 397 | update_stats_wait_end(cfs_rq, se); |
bf0f6f24 IM |
398 | } |
399 | ||
400 | /* | |
401 | * We are picking a new current task - update its stats: | |
402 | */ | |
403 | static inline void | |
79303e9e | 404 | update_stats_curr_start(struct cfs_rq *cfs_rq, struct sched_entity *se) |
bf0f6f24 IM |
405 | { |
406 | /* | |
407 | * We are starting a new run period: | |
408 | */ | |
d281918d | 409 | se->exec_start = rq_of(cfs_rq)->clock; |
bf0f6f24 IM |
410 | } |
411 | ||
bf0f6f24 IM |
412 | /************************************************** |
413 | * Scheduling class queueing methods: | |
414 | */ | |
415 | ||
30cfdcfc DA |
416 | static void |
417 | account_entity_enqueue(struct cfs_rq *cfs_rq, struct sched_entity *se) | |
418 | { | |
419 | update_load_add(&cfs_rq->load, se->load.weight); | |
420 | cfs_rq->nr_running++; | |
421 | se->on_rq = 1; | |
422 | } | |
423 | ||
424 | static void | |
425 | account_entity_dequeue(struct cfs_rq *cfs_rq, struct sched_entity *se) | |
426 | { | |
427 | update_load_sub(&cfs_rq->load, se->load.weight); | |
428 | cfs_rq->nr_running--; | |
429 | se->on_rq = 0; | |
430 | } | |
431 | ||
2396af69 | 432 | static void enqueue_sleeper(struct cfs_rq *cfs_rq, struct sched_entity *se) |
bf0f6f24 | 433 | { |
bf0f6f24 IM |
434 | #ifdef CONFIG_SCHEDSTATS |
435 | if (se->sleep_start) { | |
d281918d | 436 | u64 delta = rq_of(cfs_rq)->clock - se->sleep_start; |
bf0f6f24 IM |
437 | |
438 | if ((s64)delta < 0) | |
439 | delta = 0; | |
440 | ||
441 | if (unlikely(delta > se->sleep_max)) | |
442 | se->sleep_max = delta; | |
443 | ||
444 | se->sleep_start = 0; | |
445 | se->sum_sleep_runtime += delta; | |
446 | } | |
447 | if (se->block_start) { | |
d281918d | 448 | u64 delta = rq_of(cfs_rq)->clock - se->block_start; |
bf0f6f24 IM |
449 | |
450 | if ((s64)delta < 0) | |
451 | delta = 0; | |
452 | ||
453 | if (unlikely(delta > se->block_max)) | |
454 | se->block_max = delta; | |
455 | ||
456 | se->block_start = 0; | |
457 | se->sum_sleep_runtime += delta; | |
30084fbd IM |
458 | |
459 | /* | |
460 | * Blocking time is in units of nanosecs, so shift by 20 to | |
461 | * get a milliseconds-range estimation of the amount of | |
462 | * time that the task spent sleeping: | |
463 | */ | |
464 | if (unlikely(prof_on == SLEEP_PROFILING)) { | |
e22f5bbf IM |
465 | struct task_struct *tsk = task_of(se); |
466 | ||
30084fbd IM |
467 | profile_hits(SLEEP_PROFILING, (void *)get_wchan(tsk), |
468 | delta >> 20); | |
469 | } | |
bf0f6f24 IM |
470 | } |
471 | #endif | |
472 | } | |
473 | ||
ddc97297 PZ |
474 | static void check_spread(struct cfs_rq *cfs_rq, struct sched_entity *se) |
475 | { | |
476 | #ifdef CONFIG_SCHED_DEBUG | |
477 | s64 d = se->vruntime - cfs_rq->min_vruntime; | |
478 | ||
479 | if (d < 0) | |
480 | d = -d; | |
481 | ||
482 | if (d > 3*sysctl_sched_latency) | |
483 | schedstat_inc(cfs_rq, nr_spread_over); | |
484 | #endif | |
485 | } | |
486 | ||
aeb73b04 PZ |
487 | static void |
488 | place_entity(struct cfs_rq *cfs_rq, struct sched_entity *se, int initial) | |
489 | { | |
67e9fb2a | 490 | u64 vruntime; |
aeb73b04 | 491 | |
67e9fb2a | 492 | vruntime = cfs_rq->min_vruntime; |
94dfb5e7 | 493 | |
06877c33 | 494 | if (sched_feat(TREE_AVG)) { |
94dfb5e7 PZ |
495 | struct sched_entity *last = __pick_last_entity(cfs_rq); |
496 | if (last) { | |
67e9fb2a PZ |
497 | vruntime += last->vruntime; |
498 | vruntime >>= 1; | |
94dfb5e7 | 499 | } |
67e9fb2a | 500 | } else if (sched_feat(APPROX_AVG) && cfs_rq->nr_running) |
647e7cac | 501 | vruntime += sched_vslice(cfs_rq)/2; |
94dfb5e7 | 502 | |
2cb8600e PZ |
503 | /* |
504 | * The 'current' period is already promised to the current tasks, | |
505 | * however the extra weight of the new task will slow them down a | |
506 | * little, place the new task so that it fits in the slot that | |
507 | * stays open at the end. | |
508 | */ | |
94dfb5e7 | 509 | if (initial && sched_feat(START_DEBIT)) |
647e7cac | 510 | vruntime += sched_vslice_add(cfs_rq, se); |
aeb73b04 | 511 | |
8465e792 | 512 | if (!initial) { |
2cb8600e | 513 | /* sleeps upto a single latency don't count. */ |
e62dd02e DA |
514 | if (sched_feat(NEW_FAIR_SLEEPERS) && entity_is_task(se) && |
515 | task_of(se)->policy != SCHED_BATCH) | |
94359f05 IM |
516 | vruntime -= sysctl_sched_latency; |
517 | ||
2cb8600e PZ |
518 | /* ensure we never gain time by being placed backwards. */ |
519 | vruntime = max_vruntime(se->vruntime, vruntime); | |
aeb73b04 PZ |
520 | } |
521 | ||
67e9fb2a | 522 | se->vruntime = vruntime; |
aeb73b04 PZ |
523 | } |
524 | ||
bf0f6f24 | 525 | static void |
83b699ed | 526 | enqueue_entity(struct cfs_rq *cfs_rq, struct sched_entity *se, int wakeup) |
bf0f6f24 IM |
527 | { |
528 | /* | |
a2a2d680 | 529 | * Update run-time statistics of the 'current'. |
bf0f6f24 | 530 | */ |
b7cc0896 | 531 | update_curr(cfs_rq); |
bf0f6f24 | 532 | |
e9acbff6 | 533 | if (wakeup) { |
aeb73b04 | 534 | place_entity(cfs_rq, se, 0); |
2396af69 | 535 | enqueue_sleeper(cfs_rq, se); |
e9acbff6 | 536 | } |
bf0f6f24 | 537 | |
d2417e5a | 538 | update_stats_enqueue(cfs_rq, se); |
ddc97297 | 539 | check_spread(cfs_rq, se); |
83b699ed SV |
540 | if (se != cfs_rq->curr) |
541 | __enqueue_entity(cfs_rq, se); | |
30cfdcfc | 542 | account_entity_enqueue(cfs_rq, se); |
bf0f6f24 IM |
543 | } |
544 | ||
545 | static void | |
525c2716 | 546 | dequeue_entity(struct cfs_rq *cfs_rq, struct sched_entity *se, int sleep) |
bf0f6f24 | 547 | { |
a2a2d680 DA |
548 | /* |
549 | * Update run-time statistics of the 'current'. | |
550 | */ | |
551 | update_curr(cfs_rq); | |
552 | ||
19b6a2e3 | 553 | update_stats_dequeue(cfs_rq, se); |
db36cc7d | 554 | if (sleep) { |
67e9fb2a | 555 | #ifdef CONFIG_SCHEDSTATS |
bf0f6f24 IM |
556 | if (entity_is_task(se)) { |
557 | struct task_struct *tsk = task_of(se); | |
558 | ||
559 | if (tsk->state & TASK_INTERRUPTIBLE) | |
d281918d | 560 | se->sleep_start = rq_of(cfs_rq)->clock; |
bf0f6f24 | 561 | if (tsk->state & TASK_UNINTERRUPTIBLE) |
d281918d | 562 | se->block_start = rq_of(cfs_rq)->clock; |
bf0f6f24 | 563 | } |
db36cc7d | 564 | #endif |
67e9fb2a PZ |
565 | } |
566 | ||
83b699ed | 567 | if (se != cfs_rq->curr) |
30cfdcfc DA |
568 | __dequeue_entity(cfs_rq, se); |
569 | account_entity_dequeue(cfs_rq, se); | |
bf0f6f24 IM |
570 | } |
571 | ||
572 | /* | |
573 | * Preempt the current task with a newly woken task if needed: | |
574 | */ | |
7c92e54f | 575 | static void |
2e09bf55 | 576 | check_preempt_tick(struct cfs_rq *cfs_rq, struct sched_entity *curr) |
bf0f6f24 | 577 | { |
11697830 PZ |
578 | unsigned long ideal_runtime, delta_exec; |
579 | ||
6d0f0ebd | 580 | ideal_runtime = sched_slice(cfs_rq, curr); |
11697830 | 581 | delta_exec = curr->sum_exec_runtime - curr->prev_sum_exec_runtime; |
3e3e13f3 | 582 | if (delta_exec > ideal_runtime) |
bf0f6f24 IM |
583 | resched_task(rq_of(cfs_rq)->curr); |
584 | } | |
585 | ||
83b699ed | 586 | static void |
8494f412 | 587 | set_next_entity(struct cfs_rq *cfs_rq, struct sched_entity *se) |
bf0f6f24 | 588 | { |
83b699ed SV |
589 | /* 'current' is not kept within the tree. */ |
590 | if (se->on_rq) { | |
591 | /* | |
592 | * Any task has to be enqueued before it get to execute on | |
593 | * a CPU. So account for the time it spent waiting on the | |
594 | * runqueue. | |
595 | */ | |
596 | update_stats_wait_end(cfs_rq, se); | |
597 | __dequeue_entity(cfs_rq, se); | |
598 | } | |
599 | ||
79303e9e | 600 | update_stats_curr_start(cfs_rq, se); |
429d43bc | 601 | cfs_rq->curr = se; |
eba1ed4b IM |
602 | #ifdef CONFIG_SCHEDSTATS |
603 | /* | |
604 | * Track our maximum slice length, if the CPU's load is at | |
605 | * least twice that of our own weight (i.e. dont track it | |
606 | * when there are only lesser-weight tasks around): | |
607 | */ | |
495eca49 | 608 | if (rq_of(cfs_rq)->load.weight >= 2*se->load.weight) { |
eba1ed4b IM |
609 | se->slice_max = max(se->slice_max, |
610 | se->sum_exec_runtime - se->prev_sum_exec_runtime); | |
611 | } | |
612 | #endif | |
4a55b450 | 613 | se->prev_sum_exec_runtime = se->sum_exec_runtime; |
bf0f6f24 IM |
614 | } |
615 | ||
9948f4b2 | 616 | static struct sched_entity *pick_next_entity(struct cfs_rq *cfs_rq) |
bf0f6f24 | 617 | { |
08ec3df5 | 618 | struct sched_entity *se = NULL; |
bf0f6f24 | 619 | |
08ec3df5 DA |
620 | if (first_fair(cfs_rq)) { |
621 | se = __pick_next_entity(cfs_rq); | |
622 | set_next_entity(cfs_rq, se); | |
623 | } | |
bf0f6f24 IM |
624 | |
625 | return se; | |
626 | } | |
627 | ||
ab6cde26 | 628 | static void put_prev_entity(struct cfs_rq *cfs_rq, struct sched_entity *prev) |
bf0f6f24 IM |
629 | { |
630 | /* | |
631 | * If still on the runqueue then deactivate_task() | |
632 | * was not called and update_curr() has to be done: | |
633 | */ | |
634 | if (prev->on_rq) | |
b7cc0896 | 635 | update_curr(cfs_rq); |
bf0f6f24 | 636 | |
ddc97297 | 637 | check_spread(cfs_rq, prev); |
30cfdcfc | 638 | if (prev->on_rq) { |
5870db5b | 639 | update_stats_wait_start(cfs_rq, prev); |
30cfdcfc DA |
640 | /* Put 'current' back into the tree. */ |
641 | __enqueue_entity(cfs_rq, prev); | |
642 | } | |
429d43bc | 643 | cfs_rq->curr = NULL; |
bf0f6f24 IM |
644 | } |
645 | ||
646 | static void entity_tick(struct cfs_rq *cfs_rq, struct sched_entity *curr) | |
647 | { | |
bf0f6f24 | 648 | /* |
30cfdcfc | 649 | * Update run-time statistics of the 'current'. |
bf0f6f24 | 650 | */ |
30cfdcfc | 651 | update_curr(cfs_rq); |
bf0f6f24 | 652 | |
ce6c1311 | 653 | if (cfs_rq->nr_running > 1 || !sched_feat(WAKEUP_PREEMPT)) |
2e09bf55 | 654 | check_preempt_tick(cfs_rq, curr); |
bf0f6f24 IM |
655 | } |
656 | ||
657 | /************************************************** | |
658 | * CFS operations on tasks: | |
659 | */ | |
660 | ||
661 | #ifdef CONFIG_FAIR_GROUP_SCHED | |
662 | ||
663 | /* Walk up scheduling entities hierarchy */ | |
664 | #define for_each_sched_entity(se) \ | |
665 | for (; se; se = se->parent) | |
666 | ||
667 | static inline struct cfs_rq *task_cfs_rq(struct task_struct *p) | |
668 | { | |
669 | return p->se.cfs_rq; | |
670 | } | |
671 | ||
672 | /* runqueue on which this entity is (to be) queued */ | |
673 | static inline struct cfs_rq *cfs_rq_of(struct sched_entity *se) | |
674 | { | |
675 | return se->cfs_rq; | |
676 | } | |
677 | ||
678 | /* runqueue "owned" by this group */ | |
679 | static inline struct cfs_rq *group_cfs_rq(struct sched_entity *grp) | |
680 | { | |
681 | return grp->my_q; | |
682 | } | |
683 | ||
684 | /* Given a group's cfs_rq on one cpu, return its corresponding cfs_rq on | |
685 | * another cpu ('this_cpu') | |
686 | */ | |
687 | static inline struct cfs_rq *cpu_cfs_rq(struct cfs_rq *cfs_rq, int this_cpu) | |
688 | { | |
29f59db3 | 689 | return cfs_rq->tg->cfs_rq[this_cpu]; |
bf0f6f24 IM |
690 | } |
691 | ||
692 | /* Iterate thr' all leaf cfs_rq's on a runqueue */ | |
693 | #define for_each_leaf_cfs_rq(rq, cfs_rq) \ | |
694 | list_for_each_entry(cfs_rq, &rq->leaf_cfs_rq_list, leaf_cfs_rq_list) | |
695 | ||
fad095a7 SV |
696 | /* Do the two (enqueued) entities belong to the same group ? */ |
697 | static inline int | |
698 | is_same_group(struct sched_entity *se, struct sched_entity *pse) | |
bf0f6f24 | 699 | { |
fad095a7 | 700 | if (se->cfs_rq == pse->cfs_rq) |
bf0f6f24 IM |
701 | return 1; |
702 | ||
703 | return 0; | |
704 | } | |
705 | ||
fad095a7 SV |
706 | static inline struct sched_entity *parent_entity(struct sched_entity *se) |
707 | { | |
708 | return se->parent; | |
709 | } | |
710 | ||
bf0f6f24 IM |
711 | #else /* CONFIG_FAIR_GROUP_SCHED */ |
712 | ||
713 | #define for_each_sched_entity(se) \ | |
714 | for (; se; se = NULL) | |
715 | ||
716 | static inline struct cfs_rq *task_cfs_rq(struct task_struct *p) | |
717 | { | |
718 | return &task_rq(p)->cfs; | |
719 | } | |
720 | ||
721 | static inline struct cfs_rq *cfs_rq_of(struct sched_entity *se) | |
722 | { | |
723 | struct task_struct *p = task_of(se); | |
724 | struct rq *rq = task_rq(p); | |
725 | ||
726 | return &rq->cfs; | |
727 | } | |
728 | ||
729 | /* runqueue "owned" by this group */ | |
730 | static inline struct cfs_rq *group_cfs_rq(struct sched_entity *grp) | |
731 | { | |
732 | return NULL; | |
733 | } | |
734 | ||
735 | static inline struct cfs_rq *cpu_cfs_rq(struct cfs_rq *cfs_rq, int this_cpu) | |
736 | { | |
737 | return &cpu_rq(this_cpu)->cfs; | |
738 | } | |
739 | ||
740 | #define for_each_leaf_cfs_rq(rq, cfs_rq) \ | |
741 | for (cfs_rq = &rq->cfs; cfs_rq; cfs_rq = NULL) | |
742 | ||
fad095a7 SV |
743 | static inline int |
744 | is_same_group(struct sched_entity *se, struct sched_entity *pse) | |
bf0f6f24 IM |
745 | { |
746 | return 1; | |
747 | } | |
748 | ||
fad095a7 SV |
749 | static inline struct sched_entity *parent_entity(struct sched_entity *se) |
750 | { | |
751 | return NULL; | |
752 | } | |
753 | ||
bf0f6f24 IM |
754 | #endif /* CONFIG_FAIR_GROUP_SCHED */ |
755 | ||
756 | /* | |
757 | * The enqueue_task method is called before nr_running is | |
758 | * increased. Here we update the fair scheduling stats and | |
759 | * then put the task into the rbtree: | |
760 | */ | |
fd390f6a | 761 | static void enqueue_task_fair(struct rq *rq, struct task_struct *p, int wakeup) |
bf0f6f24 IM |
762 | { |
763 | struct cfs_rq *cfs_rq; | |
764 | struct sched_entity *se = &p->se; | |
765 | ||
766 | for_each_sched_entity(se) { | |
767 | if (se->on_rq) | |
768 | break; | |
769 | cfs_rq = cfs_rq_of(se); | |
83b699ed | 770 | enqueue_entity(cfs_rq, se, wakeup); |
b9fa3df3 | 771 | wakeup = 1; |
bf0f6f24 IM |
772 | } |
773 | } | |
774 | ||
775 | /* | |
776 | * The dequeue_task method is called before nr_running is | |
777 | * decreased. We remove the task from the rbtree and | |
778 | * update the fair scheduling stats: | |
779 | */ | |
f02231e5 | 780 | static void dequeue_task_fair(struct rq *rq, struct task_struct *p, int sleep) |
bf0f6f24 IM |
781 | { |
782 | struct cfs_rq *cfs_rq; | |
783 | struct sched_entity *se = &p->se; | |
784 | ||
785 | for_each_sched_entity(se) { | |
786 | cfs_rq = cfs_rq_of(se); | |
525c2716 | 787 | dequeue_entity(cfs_rq, se, sleep); |
bf0f6f24 IM |
788 | /* Don't dequeue parent if it has other entities besides us */ |
789 | if (cfs_rq->load.weight) | |
790 | break; | |
b9fa3df3 | 791 | sleep = 1; |
bf0f6f24 IM |
792 | } |
793 | } | |
794 | ||
795 | /* | |
1799e35d IM |
796 | * sched_yield() support is very simple - we dequeue and enqueue. |
797 | * | |
798 | * If compat_yield is turned on then we requeue to the end of the tree. | |
bf0f6f24 | 799 | */ |
4530d7ab | 800 | static void yield_task_fair(struct rq *rq) |
bf0f6f24 | 801 | { |
72ea22f8 | 802 | struct cfs_rq *cfs_rq = task_cfs_rq(rq->curr); |
4530d7ab | 803 | struct sched_entity *rightmost, *se = &rq->curr->se; |
bf0f6f24 IM |
804 | |
805 | /* | |
1799e35d IM |
806 | * Are we the only task in the tree? |
807 | */ | |
808 | if (unlikely(cfs_rq->nr_running == 1)) | |
809 | return; | |
810 | ||
811 | if (likely(!sysctl_sched_compat_yield)) { | |
812 | __update_rq_clock(rq); | |
813 | /* | |
a2a2d680 | 814 | * Update run-time statistics of the 'current'. |
1799e35d | 815 | */ |
2b1e315d | 816 | update_curr(cfs_rq); |
1799e35d IM |
817 | |
818 | return; | |
819 | } | |
820 | /* | |
821 | * Find the rightmost entry in the rbtree: | |
bf0f6f24 | 822 | */ |
2b1e315d | 823 | rightmost = __pick_last_entity(cfs_rq); |
1799e35d IM |
824 | /* |
825 | * Already in the rightmost position? | |
826 | */ | |
2b1e315d | 827 | if (unlikely(rightmost->vruntime < se->vruntime)) |
1799e35d IM |
828 | return; |
829 | ||
830 | /* | |
831 | * Minimally necessary key value to be last in the tree: | |
2b1e315d DA |
832 | * Upon rescheduling, sched_class::put_prev_task() will place |
833 | * 'current' within the tree based on its new key value. | |
1799e35d | 834 | */ |
30cfdcfc | 835 | se->vruntime = rightmost->vruntime + 1; |
bf0f6f24 IM |
836 | } |
837 | ||
838 | /* | |
839 | * Preempt the current task with a newly woken task if needed: | |
840 | */ | |
2e09bf55 | 841 | static void check_preempt_wakeup(struct rq *rq, struct task_struct *p) |
bf0f6f24 IM |
842 | { |
843 | struct task_struct *curr = rq->curr; | |
fad095a7 | 844 | struct cfs_rq *cfs_rq = task_cfs_rq(curr); |
8651a86c | 845 | struct sched_entity *se = &curr->se, *pse = &p->se; |
502d26b5 | 846 | unsigned long gran; |
bf0f6f24 IM |
847 | |
848 | if (unlikely(rt_prio(p->prio))) { | |
a8e504d2 | 849 | update_rq_clock(rq); |
b7cc0896 | 850 | update_curr(cfs_rq); |
bf0f6f24 IM |
851 | resched_task(curr); |
852 | return; | |
853 | } | |
91c234b4 IM |
854 | /* |
855 | * Batch tasks do not preempt (their preemption is driven by | |
856 | * the tick): | |
857 | */ | |
858 | if (unlikely(p->policy == SCHED_BATCH)) | |
859 | return; | |
bf0f6f24 | 860 | |
77d9cc44 IM |
861 | if (!sched_feat(WAKEUP_PREEMPT)) |
862 | return; | |
8651a86c | 863 | |
77d9cc44 IM |
864 | while (!is_same_group(se, pse)) { |
865 | se = parent_entity(se); | |
866 | pse = parent_entity(pse); | |
ce6c1311 | 867 | } |
77d9cc44 | 868 | |
77d9cc44 IM |
869 | gran = sysctl_sched_wakeup_granularity; |
870 | if (unlikely(se->load.weight != NICE_0_LOAD)) | |
871 | gran = calc_delta_fair(gran, &se->load); | |
872 | ||
502d26b5 | 873 | if (pse->vruntime + gran < se->vruntime) |
77d9cc44 | 874 | resched_task(curr); |
bf0f6f24 IM |
875 | } |
876 | ||
fb8d4724 | 877 | static struct task_struct *pick_next_task_fair(struct rq *rq) |
bf0f6f24 IM |
878 | { |
879 | struct cfs_rq *cfs_rq = &rq->cfs; | |
880 | struct sched_entity *se; | |
881 | ||
882 | if (unlikely(!cfs_rq->nr_running)) | |
883 | return NULL; | |
884 | ||
885 | do { | |
9948f4b2 | 886 | se = pick_next_entity(cfs_rq); |
bf0f6f24 IM |
887 | cfs_rq = group_cfs_rq(se); |
888 | } while (cfs_rq); | |
889 | ||
890 | return task_of(se); | |
891 | } | |
892 | ||
893 | /* | |
894 | * Account for a descheduled task: | |
895 | */ | |
31ee529c | 896 | static void put_prev_task_fair(struct rq *rq, struct task_struct *prev) |
bf0f6f24 IM |
897 | { |
898 | struct sched_entity *se = &prev->se; | |
899 | struct cfs_rq *cfs_rq; | |
900 | ||
901 | for_each_sched_entity(se) { | |
902 | cfs_rq = cfs_rq_of(se); | |
ab6cde26 | 903 | put_prev_entity(cfs_rq, se); |
bf0f6f24 IM |
904 | } |
905 | } | |
906 | ||
681f3e68 | 907 | #ifdef CONFIG_SMP |
bf0f6f24 IM |
908 | /************************************************** |
909 | * Fair scheduling class load-balancing methods: | |
910 | */ | |
911 | ||
912 | /* | |
913 | * Load-balancing iterator. Note: while the runqueue stays locked | |
914 | * during the whole iteration, the current task might be | |
915 | * dequeued so the iterator has to be dequeue-safe. Here we | |
916 | * achieve that by always pre-iterating before returning | |
917 | * the current task: | |
918 | */ | |
a9957449 | 919 | static struct task_struct * |
bf0f6f24 IM |
920 | __load_balance_iterator(struct cfs_rq *cfs_rq, struct rb_node *curr) |
921 | { | |
922 | struct task_struct *p; | |
923 | ||
924 | if (!curr) | |
925 | return NULL; | |
926 | ||
927 | p = rb_entry(curr, struct task_struct, se.run_node); | |
928 | cfs_rq->rb_load_balance_curr = rb_next(curr); | |
929 | ||
930 | return p; | |
931 | } | |
932 | ||
933 | static struct task_struct *load_balance_start_fair(void *arg) | |
934 | { | |
935 | struct cfs_rq *cfs_rq = arg; | |
936 | ||
937 | return __load_balance_iterator(cfs_rq, first_fair(cfs_rq)); | |
938 | } | |
939 | ||
940 | static struct task_struct *load_balance_next_fair(void *arg) | |
941 | { | |
942 | struct cfs_rq *cfs_rq = arg; | |
943 | ||
944 | return __load_balance_iterator(cfs_rq, cfs_rq->rb_load_balance_curr); | |
945 | } | |
946 | ||
a4ac01c3 | 947 | #ifdef CONFIG_FAIR_GROUP_SCHED |
bf0f6f24 IM |
948 | static int cfs_rq_best_prio(struct cfs_rq *cfs_rq) |
949 | { | |
950 | struct sched_entity *curr; | |
951 | struct task_struct *p; | |
952 | ||
953 | if (!cfs_rq->nr_running) | |
954 | return MAX_PRIO; | |
955 | ||
9b5b7751 SV |
956 | curr = cfs_rq->curr; |
957 | if (!curr) | |
958 | curr = __pick_next_entity(cfs_rq); | |
959 | ||
bf0f6f24 IM |
960 | p = task_of(curr); |
961 | ||
962 | return p->prio; | |
963 | } | |
a4ac01c3 | 964 | #endif |
bf0f6f24 | 965 | |
43010659 | 966 | static unsigned long |
bf0f6f24 | 967 | load_balance_fair(struct rq *this_rq, int this_cpu, struct rq *busiest, |
e1d1484f | 968 | unsigned long max_load_move, |
a4ac01c3 PW |
969 | struct sched_domain *sd, enum cpu_idle_type idle, |
970 | int *all_pinned, int *this_best_prio) | |
bf0f6f24 IM |
971 | { |
972 | struct cfs_rq *busy_cfs_rq; | |
bf0f6f24 IM |
973 | long rem_load_move = max_load_move; |
974 | struct rq_iterator cfs_rq_iterator; | |
975 | ||
976 | cfs_rq_iterator.start = load_balance_start_fair; | |
977 | cfs_rq_iterator.next = load_balance_next_fair; | |
978 | ||
979 | for_each_leaf_cfs_rq(busiest, busy_cfs_rq) { | |
a4ac01c3 | 980 | #ifdef CONFIG_FAIR_GROUP_SCHED |
bf0f6f24 | 981 | struct cfs_rq *this_cfs_rq; |
e56f31aa | 982 | long imbalance; |
bf0f6f24 | 983 | unsigned long maxload; |
bf0f6f24 IM |
984 | |
985 | this_cfs_rq = cpu_cfs_rq(busy_cfs_rq, this_cpu); | |
986 | ||
e56f31aa | 987 | imbalance = busy_cfs_rq->load.weight - this_cfs_rq->load.weight; |
bf0f6f24 IM |
988 | /* Don't pull if this_cfs_rq has more load than busy_cfs_rq */ |
989 | if (imbalance <= 0) | |
990 | continue; | |
991 | ||
992 | /* Don't pull more than imbalance/2 */ | |
993 | imbalance /= 2; | |
994 | maxload = min(rem_load_move, imbalance); | |
995 | ||
a4ac01c3 PW |
996 | *this_best_prio = cfs_rq_best_prio(this_cfs_rq); |
997 | #else | |
e56f31aa | 998 | # define maxload rem_load_move |
a4ac01c3 | 999 | #endif |
e1d1484f PW |
1000 | /* |
1001 | * pass busy_cfs_rq argument into | |
bf0f6f24 IM |
1002 | * load_balance_[start|next]_fair iterators |
1003 | */ | |
1004 | cfs_rq_iterator.arg = busy_cfs_rq; | |
e1d1484f PW |
1005 | rem_load_move -= balance_tasks(this_rq, this_cpu, busiest, |
1006 | maxload, sd, idle, all_pinned, | |
1007 | this_best_prio, | |
1008 | &cfs_rq_iterator); | |
bf0f6f24 | 1009 | |
e1d1484f | 1010 | if (rem_load_move <= 0) |
bf0f6f24 IM |
1011 | break; |
1012 | } | |
1013 | ||
43010659 | 1014 | return max_load_move - rem_load_move; |
bf0f6f24 IM |
1015 | } |
1016 | ||
e1d1484f PW |
1017 | static int |
1018 | move_one_task_fair(struct rq *this_rq, int this_cpu, struct rq *busiest, | |
1019 | struct sched_domain *sd, enum cpu_idle_type idle) | |
1020 | { | |
1021 | struct cfs_rq *busy_cfs_rq; | |
1022 | struct rq_iterator cfs_rq_iterator; | |
1023 | ||
1024 | cfs_rq_iterator.start = load_balance_start_fair; | |
1025 | cfs_rq_iterator.next = load_balance_next_fair; | |
1026 | ||
1027 | for_each_leaf_cfs_rq(busiest, busy_cfs_rq) { | |
1028 | /* | |
1029 | * pass busy_cfs_rq argument into | |
1030 | * load_balance_[start|next]_fair iterators | |
1031 | */ | |
1032 | cfs_rq_iterator.arg = busy_cfs_rq; | |
1033 | if (iter_move_one_task(this_rq, this_cpu, busiest, sd, idle, | |
1034 | &cfs_rq_iterator)) | |
1035 | return 1; | |
1036 | } | |
1037 | ||
1038 | return 0; | |
1039 | } | |
681f3e68 | 1040 | #endif |
e1d1484f | 1041 | |
bf0f6f24 IM |
1042 | /* |
1043 | * scheduler tick hitting a task of our scheduling class: | |
1044 | */ | |
1045 | static void task_tick_fair(struct rq *rq, struct task_struct *curr) | |
1046 | { | |
1047 | struct cfs_rq *cfs_rq; | |
1048 | struct sched_entity *se = &curr->se; | |
1049 | ||
1050 | for_each_sched_entity(se) { | |
1051 | cfs_rq = cfs_rq_of(se); | |
1052 | entity_tick(cfs_rq, se); | |
1053 | } | |
1054 | } | |
1055 | ||
8eb172d9 | 1056 | #define swap(a, b) do { typeof(a) tmp = (a); (a) = (b); (b) = tmp; } while (0) |
4d78e7b6 | 1057 | |
bf0f6f24 IM |
1058 | /* |
1059 | * Share the fairness runtime between parent and child, thus the | |
1060 | * total amount of pressure for CPU stays equal - new tasks | |
1061 | * get a chance to run but frequent forkers are not allowed to | |
1062 | * monopolize the CPU. Note: the parent runqueue is locked, | |
1063 | * the child is not running yet. | |
1064 | */ | |
ee0827d8 | 1065 | static void task_new_fair(struct rq *rq, struct task_struct *p) |
bf0f6f24 IM |
1066 | { |
1067 | struct cfs_rq *cfs_rq = task_cfs_rq(p); | |
429d43bc | 1068 | struct sched_entity *se = &p->se, *curr = cfs_rq->curr; |
00bf7bfc | 1069 | int this_cpu = smp_processor_id(); |
bf0f6f24 IM |
1070 | |
1071 | sched_info_queued(p); | |
1072 | ||
7109c442 | 1073 | update_curr(cfs_rq); |
aeb73b04 | 1074 | place_entity(cfs_rq, se, 1); |
4d78e7b6 | 1075 | |
3c90e6e9 | 1076 | /* 'curr' will be NULL if the child belongs to a different group */ |
00bf7bfc | 1077 | if (sysctl_sched_child_runs_first && this_cpu == task_cpu(p) && |
3c90e6e9 | 1078 | curr && curr->vruntime < se->vruntime) { |
87fefa38 | 1079 | /* |
edcb60a3 IM |
1080 | * Upon rescheduling, sched_class::put_prev_task() will place |
1081 | * 'current' within the tree based on its new key value. | |
1082 | */ | |
4d78e7b6 | 1083 | swap(curr->vruntime, se->vruntime); |
4d78e7b6 | 1084 | } |
bf0f6f24 | 1085 | |
b9dca1e0 | 1086 | enqueue_task_fair(rq, p, 0); |
bb61c210 | 1087 | resched_task(rq->curr); |
bf0f6f24 IM |
1088 | } |
1089 | ||
83b699ed SV |
1090 | /* Account for a task changing its policy or group. |
1091 | * | |
1092 | * This routine is mostly called to set cfs_rq->curr field when a task | |
1093 | * migrates between groups/classes. | |
1094 | */ | |
1095 | static void set_curr_task_fair(struct rq *rq) | |
1096 | { | |
1097 | struct sched_entity *se = &rq->curr->se; | |
1098 | ||
1099 | for_each_sched_entity(se) | |
1100 | set_next_entity(cfs_rq_of(se), se); | |
1101 | } | |
1102 | ||
bf0f6f24 IM |
1103 | /* |
1104 | * All the scheduling class methods: | |
1105 | */ | |
5522d5d5 IM |
1106 | static const struct sched_class fair_sched_class = { |
1107 | .next = &idle_sched_class, | |
bf0f6f24 IM |
1108 | .enqueue_task = enqueue_task_fair, |
1109 | .dequeue_task = dequeue_task_fair, | |
1110 | .yield_task = yield_task_fair, | |
1111 | ||
2e09bf55 | 1112 | .check_preempt_curr = check_preempt_wakeup, |
bf0f6f24 IM |
1113 | |
1114 | .pick_next_task = pick_next_task_fair, | |
1115 | .put_prev_task = put_prev_task_fair, | |
1116 | ||
681f3e68 | 1117 | #ifdef CONFIG_SMP |
bf0f6f24 | 1118 | .load_balance = load_balance_fair, |
e1d1484f | 1119 | .move_one_task = move_one_task_fair, |
681f3e68 | 1120 | #endif |
bf0f6f24 | 1121 | |
83b699ed | 1122 | .set_curr_task = set_curr_task_fair, |
bf0f6f24 IM |
1123 | .task_tick = task_tick_fair, |
1124 | .task_new = task_new_fair, | |
1125 | }; | |
1126 | ||
1127 | #ifdef CONFIG_SCHED_DEBUG | |
5cef9eca | 1128 | static void print_cfs_stats(struct seq_file *m, int cpu) |
bf0f6f24 | 1129 | { |
bf0f6f24 IM |
1130 | struct cfs_rq *cfs_rq; |
1131 | ||
75c28ace SV |
1132 | #ifdef CONFIG_FAIR_GROUP_SCHED |
1133 | print_cfs_rq(m, cpu, &cpu_rq(cpu)->cfs); | |
1134 | #endif | |
c3b64f1e | 1135 | for_each_leaf_cfs_rq(cpu_rq(cpu), cfs_rq) |
5cef9eca | 1136 | print_cfs_rq(m, cpu, cfs_rq); |
bf0f6f24 IM |
1137 | } |
1138 | #endif |