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