]>
Commit | Line | Data |
---|---|---|
1 | /* | |
2 | * Deadline Scheduling Class (SCHED_DEADLINE) | |
3 | * | |
4 | * Earliest Deadline First (EDF) + Constant Bandwidth Server (CBS). | |
5 | * | |
6 | * Tasks that periodically executes their instances for less than their | |
7 | * runtime won't miss any of their deadlines. | |
8 | * Tasks that are not periodic or sporadic or that tries to execute more | |
9 | * than their reserved bandwidth will be slowed down (and may potentially | |
10 | * miss some of their deadlines), and won't affect any other task. | |
11 | * | |
12 | * Copyright (C) 2012 Dario Faggioli <raistlin@linux.it>, | |
13 | * Juri Lelli <juri.lelli@gmail.com>, | |
14 | * Michael Trimarchi <michael@amarulasolutions.com>, | |
15 | * Fabio Checconi <fchecconi@gmail.com> | |
16 | */ | |
17 | #include "sched.h" | |
18 | ||
19 | #include <linux/slab.h> | |
20 | ||
21 | struct dl_bandwidth def_dl_bandwidth; | |
22 | ||
23 | static inline struct task_struct *dl_task_of(struct sched_dl_entity *dl_se) | |
24 | { | |
25 | return container_of(dl_se, struct task_struct, dl); | |
26 | } | |
27 | ||
28 | static inline struct rq *rq_of_dl_rq(struct dl_rq *dl_rq) | |
29 | { | |
30 | return container_of(dl_rq, struct rq, dl); | |
31 | } | |
32 | ||
33 | static inline struct dl_rq *dl_rq_of_se(struct sched_dl_entity *dl_se) | |
34 | { | |
35 | struct task_struct *p = dl_task_of(dl_se); | |
36 | struct rq *rq = task_rq(p); | |
37 | ||
38 | return &rq->dl; | |
39 | } | |
40 | ||
41 | static inline int on_dl_rq(struct sched_dl_entity *dl_se) | |
42 | { | |
43 | return !RB_EMPTY_NODE(&dl_se->rb_node); | |
44 | } | |
45 | ||
46 | static inline int is_leftmost(struct task_struct *p, struct dl_rq *dl_rq) | |
47 | { | |
48 | struct sched_dl_entity *dl_se = &p->dl; | |
49 | ||
50 | return dl_rq->rb_leftmost == &dl_se->rb_node; | |
51 | } | |
52 | ||
53 | void init_dl_bandwidth(struct dl_bandwidth *dl_b, u64 period, u64 runtime) | |
54 | { | |
55 | raw_spin_lock_init(&dl_b->dl_runtime_lock); | |
56 | dl_b->dl_period = period; | |
57 | dl_b->dl_runtime = runtime; | |
58 | } | |
59 | ||
60 | void init_dl_bw(struct dl_bw *dl_b) | |
61 | { | |
62 | raw_spin_lock_init(&dl_b->lock); | |
63 | raw_spin_lock(&def_dl_bandwidth.dl_runtime_lock); | |
64 | if (global_rt_runtime() == RUNTIME_INF) | |
65 | dl_b->bw = -1; | |
66 | else | |
67 | dl_b->bw = to_ratio(global_rt_period(), global_rt_runtime()); | |
68 | raw_spin_unlock(&def_dl_bandwidth.dl_runtime_lock); | |
69 | dl_b->total_bw = 0; | |
70 | } | |
71 | ||
72 | void init_dl_rq(struct dl_rq *dl_rq, struct rq *rq) | |
73 | { | |
74 | dl_rq->rb_root = RB_ROOT; | |
75 | ||
76 | #ifdef CONFIG_SMP | |
77 | /* zero means no -deadline tasks */ | |
78 | dl_rq->earliest_dl.curr = dl_rq->earliest_dl.next = 0; | |
79 | ||
80 | dl_rq->dl_nr_migratory = 0; | |
81 | dl_rq->overloaded = 0; | |
82 | dl_rq->pushable_dl_tasks_root = RB_ROOT; | |
83 | #else | |
84 | init_dl_bw(&dl_rq->dl_bw); | |
85 | #endif | |
86 | } | |
87 | ||
88 | #ifdef CONFIG_SMP | |
89 | ||
90 | static inline int dl_overloaded(struct rq *rq) | |
91 | { | |
92 | return atomic_read(&rq->rd->dlo_count); | |
93 | } | |
94 | ||
95 | static inline void dl_set_overload(struct rq *rq) | |
96 | { | |
97 | if (!rq->online) | |
98 | return; | |
99 | ||
100 | cpumask_set_cpu(rq->cpu, rq->rd->dlo_mask); | |
101 | /* | |
102 | * Must be visible before the overload count is | |
103 | * set (as in sched_rt.c). | |
104 | * | |
105 | * Matched by the barrier in pull_dl_task(). | |
106 | */ | |
107 | smp_wmb(); | |
108 | atomic_inc(&rq->rd->dlo_count); | |
109 | } | |
110 | ||
111 | static inline void dl_clear_overload(struct rq *rq) | |
112 | { | |
113 | if (!rq->online) | |
114 | return; | |
115 | ||
116 | atomic_dec(&rq->rd->dlo_count); | |
117 | cpumask_clear_cpu(rq->cpu, rq->rd->dlo_mask); | |
118 | } | |
119 | ||
120 | static void update_dl_migration(struct dl_rq *dl_rq) | |
121 | { | |
122 | if (dl_rq->dl_nr_migratory && dl_rq->dl_nr_running > 1) { | |
123 | if (!dl_rq->overloaded) { | |
124 | dl_set_overload(rq_of_dl_rq(dl_rq)); | |
125 | dl_rq->overloaded = 1; | |
126 | } | |
127 | } else if (dl_rq->overloaded) { | |
128 | dl_clear_overload(rq_of_dl_rq(dl_rq)); | |
129 | dl_rq->overloaded = 0; | |
130 | } | |
131 | } | |
132 | ||
133 | static void inc_dl_migration(struct sched_dl_entity *dl_se, struct dl_rq *dl_rq) | |
134 | { | |
135 | struct task_struct *p = dl_task_of(dl_se); | |
136 | ||
137 | if (p->nr_cpus_allowed > 1) | |
138 | dl_rq->dl_nr_migratory++; | |
139 | ||
140 | update_dl_migration(dl_rq); | |
141 | } | |
142 | ||
143 | static void dec_dl_migration(struct sched_dl_entity *dl_se, struct dl_rq *dl_rq) | |
144 | { | |
145 | struct task_struct *p = dl_task_of(dl_se); | |
146 | ||
147 | if (p->nr_cpus_allowed > 1) | |
148 | dl_rq->dl_nr_migratory--; | |
149 | ||
150 | update_dl_migration(dl_rq); | |
151 | } | |
152 | ||
153 | /* | |
154 | * The list of pushable -deadline task is not a plist, like in | |
155 | * sched_rt.c, it is an rb-tree with tasks ordered by deadline. | |
156 | */ | |
157 | static void enqueue_pushable_dl_task(struct rq *rq, struct task_struct *p) | |
158 | { | |
159 | struct dl_rq *dl_rq = &rq->dl; | |
160 | struct rb_node **link = &dl_rq->pushable_dl_tasks_root.rb_node; | |
161 | struct rb_node *parent = NULL; | |
162 | struct task_struct *entry; | |
163 | int leftmost = 1; | |
164 | ||
165 | BUG_ON(!RB_EMPTY_NODE(&p->pushable_dl_tasks)); | |
166 | ||
167 | while (*link) { | |
168 | parent = *link; | |
169 | entry = rb_entry(parent, struct task_struct, | |
170 | pushable_dl_tasks); | |
171 | if (dl_entity_preempt(&p->dl, &entry->dl)) | |
172 | link = &parent->rb_left; | |
173 | else { | |
174 | link = &parent->rb_right; | |
175 | leftmost = 0; | |
176 | } | |
177 | } | |
178 | ||
179 | if (leftmost) | |
180 | dl_rq->pushable_dl_tasks_leftmost = &p->pushable_dl_tasks; | |
181 | ||
182 | rb_link_node(&p->pushable_dl_tasks, parent, link); | |
183 | rb_insert_color(&p->pushable_dl_tasks, &dl_rq->pushable_dl_tasks_root); | |
184 | } | |
185 | ||
186 | static void dequeue_pushable_dl_task(struct rq *rq, struct task_struct *p) | |
187 | { | |
188 | struct dl_rq *dl_rq = &rq->dl; | |
189 | ||
190 | if (RB_EMPTY_NODE(&p->pushable_dl_tasks)) | |
191 | return; | |
192 | ||
193 | if (dl_rq->pushable_dl_tasks_leftmost == &p->pushable_dl_tasks) { | |
194 | struct rb_node *next_node; | |
195 | ||
196 | next_node = rb_next(&p->pushable_dl_tasks); | |
197 | dl_rq->pushable_dl_tasks_leftmost = next_node; | |
198 | } | |
199 | ||
200 | rb_erase(&p->pushable_dl_tasks, &dl_rq->pushable_dl_tasks_root); | |
201 | RB_CLEAR_NODE(&p->pushable_dl_tasks); | |
202 | } | |
203 | ||
204 | static inline int has_pushable_dl_tasks(struct rq *rq) | |
205 | { | |
206 | return !RB_EMPTY_ROOT(&rq->dl.pushable_dl_tasks_root); | |
207 | } | |
208 | ||
209 | static int push_dl_task(struct rq *rq); | |
210 | ||
211 | static inline bool need_pull_dl_task(struct rq *rq, struct task_struct *prev) | |
212 | { | |
213 | return dl_task(prev); | |
214 | } | |
215 | ||
216 | static inline void set_post_schedule(struct rq *rq) | |
217 | { | |
218 | rq->post_schedule = has_pushable_dl_tasks(rq); | |
219 | } | |
220 | ||
221 | #else | |
222 | ||
223 | static inline | |
224 | void enqueue_pushable_dl_task(struct rq *rq, struct task_struct *p) | |
225 | { | |
226 | } | |
227 | ||
228 | static inline | |
229 | void dequeue_pushable_dl_task(struct rq *rq, struct task_struct *p) | |
230 | { | |
231 | } | |
232 | ||
233 | static inline | |
234 | void inc_dl_migration(struct sched_dl_entity *dl_se, struct dl_rq *dl_rq) | |
235 | { | |
236 | } | |
237 | ||
238 | static inline | |
239 | void dec_dl_migration(struct sched_dl_entity *dl_se, struct dl_rq *dl_rq) | |
240 | { | |
241 | } | |
242 | ||
243 | static inline bool need_pull_dl_task(struct rq *rq, struct task_struct *prev) | |
244 | { | |
245 | return false; | |
246 | } | |
247 | ||
248 | static inline int pull_dl_task(struct rq *rq) | |
249 | { | |
250 | return 0; | |
251 | } | |
252 | ||
253 | static inline void set_post_schedule(struct rq *rq) | |
254 | { | |
255 | } | |
256 | #endif /* CONFIG_SMP */ | |
257 | ||
258 | static void enqueue_task_dl(struct rq *rq, struct task_struct *p, int flags); | |
259 | static void __dequeue_task_dl(struct rq *rq, struct task_struct *p, int flags); | |
260 | static void check_preempt_curr_dl(struct rq *rq, struct task_struct *p, | |
261 | int flags); | |
262 | ||
263 | /* | |
264 | * We are being explicitly informed that a new instance is starting, | |
265 | * and this means that: | |
266 | * - the absolute deadline of the entity has to be placed at | |
267 | * current time + relative deadline; | |
268 | * - the runtime of the entity has to be set to the maximum value. | |
269 | * | |
270 | * The capability of specifying such event is useful whenever a -deadline | |
271 | * entity wants to (try to!) synchronize its behaviour with the scheduler's | |
272 | * one, and to (try to!) reconcile itself with its own scheduling | |
273 | * parameters. | |
274 | */ | |
275 | static inline void setup_new_dl_entity(struct sched_dl_entity *dl_se, | |
276 | struct sched_dl_entity *pi_se) | |
277 | { | |
278 | struct dl_rq *dl_rq = dl_rq_of_se(dl_se); | |
279 | struct rq *rq = rq_of_dl_rq(dl_rq); | |
280 | ||
281 | WARN_ON(!dl_se->dl_new || dl_se->dl_throttled); | |
282 | ||
283 | /* | |
284 | * We use the regular wall clock time to set deadlines in the | |
285 | * future; in fact, we must consider execution overheads (time | |
286 | * spent on hardirq context, etc.). | |
287 | */ | |
288 | dl_se->deadline = rq_clock(rq) + pi_se->dl_deadline; | |
289 | dl_se->runtime = pi_se->dl_runtime; | |
290 | dl_se->dl_new = 0; | |
291 | } | |
292 | ||
293 | /* | |
294 | * Pure Earliest Deadline First (EDF) scheduling does not deal with the | |
295 | * possibility of a entity lasting more than what it declared, and thus | |
296 | * exhausting its runtime. | |
297 | * | |
298 | * Here we are interested in making runtime overrun possible, but we do | |
299 | * not want a entity which is misbehaving to affect the scheduling of all | |
300 | * other entities. | |
301 | * Therefore, a budgeting strategy called Constant Bandwidth Server (CBS) | |
302 | * is used, in order to confine each entity within its own bandwidth. | |
303 | * | |
304 | * This function deals exactly with that, and ensures that when the runtime | |
305 | * of a entity is replenished, its deadline is also postponed. That ensures | |
306 | * the overrunning entity can't interfere with other entity in the system and | |
307 | * can't make them miss their deadlines. Reasons why this kind of overruns | |
308 | * could happen are, typically, a entity voluntarily trying to overcome its | |
309 | * runtime, or it just underestimated it during sched_setattr(). | |
310 | */ | |
311 | static void replenish_dl_entity(struct sched_dl_entity *dl_se, | |
312 | struct sched_dl_entity *pi_se) | |
313 | { | |
314 | struct dl_rq *dl_rq = dl_rq_of_se(dl_se); | |
315 | struct rq *rq = rq_of_dl_rq(dl_rq); | |
316 | ||
317 | BUG_ON(pi_se->dl_runtime <= 0); | |
318 | ||
319 | /* | |
320 | * This could be the case for a !-dl task that is boosted. | |
321 | * Just go with full inherited parameters. | |
322 | */ | |
323 | if (dl_se->dl_deadline == 0) { | |
324 | dl_se->deadline = rq_clock(rq) + pi_se->dl_deadline; | |
325 | dl_se->runtime = pi_se->dl_runtime; | |
326 | } | |
327 | ||
328 | /* | |
329 | * We keep moving the deadline away until we get some | |
330 | * available runtime for the entity. This ensures correct | |
331 | * handling of situations where the runtime overrun is | |
332 | * arbitrary large. | |
333 | */ | |
334 | while (dl_se->runtime <= 0) { | |
335 | dl_se->deadline += pi_se->dl_period; | |
336 | dl_se->runtime += pi_se->dl_runtime; | |
337 | } | |
338 | ||
339 | /* | |
340 | * At this point, the deadline really should be "in | |
341 | * the future" with respect to rq->clock. If it's | |
342 | * not, we are, for some reason, lagging too much! | |
343 | * Anyway, after having warn userspace abut that, | |
344 | * we still try to keep the things running by | |
345 | * resetting the deadline and the budget of the | |
346 | * entity. | |
347 | */ | |
348 | if (dl_time_before(dl_se->deadline, rq_clock(rq))) { | |
349 | printk_deferred_once("sched: DL replenish lagged to much\n"); | |
350 | dl_se->deadline = rq_clock(rq) + pi_se->dl_deadline; | |
351 | dl_se->runtime = pi_se->dl_runtime; | |
352 | } | |
353 | } | |
354 | ||
355 | /* | |
356 | * Here we check if --at time t-- an entity (which is probably being | |
357 | * [re]activated or, in general, enqueued) can use its remaining runtime | |
358 | * and its current deadline _without_ exceeding the bandwidth it is | |
359 | * assigned (function returns true if it can't). We are in fact applying | |
360 | * one of the CBS rules: when a task wakes up, if the residual runtime | |
361 | * over residual deadline fits within the allocated bandwidth, then we | |
362 | * can keep the current (absolute) deadline and residual budget without | |
363 | * disrupting the schedulability of the system. Otherwise, we should | |
364 | * refill the runtime and set the deadline a period in the future, | |
365 | * because keeping the current (absolute) deadline of the task would | |
366 | * result in breaking guarantees promised to other tasks (refer to | |
367 | * Documentation/scheduler/sched-deadline.txt for more informations). | |
368 | * | |
369 | * This function returns true if: | |
370 | * | |
371 | * runtime / (deadline - t) > dl_runtime / dl_period , | |
372 | * | |
373 | * IOW we can't recycle current parameters. | |
374 | * | |
375 | * Notice that the bandwidth check is done against the period. For | |
376 | * task with deadline equal to period this is the same of using | |
377 | * dl_deadline instead of dl_period in the equation above. | |
378 | */ | |
379 | static bool dl_entity_overflow(struct sched_dl_entity *dl_se, | |
380 | struct sched_dl_entity *pi_se, u64 t) | |
381 | { | |
382 | u64 left, right; | |
383 | ||
384 | /* | |
385 | * left and right are the two sides of the equation above, | |
386 | * after a bit of shuffling to use multiplications instead | |
387 | * of divisions. | |
388 | * | |
389 | * Note that none of the time values involved in the two | |
390 | * multiplications are absolute: dl_deadline and dl_runtime | |
391 | * are the relative deadline and the maximum runtime of each | |
392 | * instance, runtime is the runtime left for the last instance | |
393 | * and (deadline - t), since t is rq->clock, is the time left | |
394 | * to the (absolute) deadline. Even if overflowing the u64 type | |
395 | * is very unlikely to occur in both cases, here we scale down | |
396 | * as we want to avoid that risk at all. Scaling down by 10 | |
397 | * means that we reduce granularity to 1us. We are fine with it, | |
398 | * since this is only a true/false check and, anyway, thinking | |
399 | * of anything below microseconds resolution is actually fiction | |
400 | * (but still we want to give the user that illusion >;). | |
401 | */ | |
402 | left = (pi_se->dl_period >> DL_SCALE) * (dl_se->runtime >> DL_SCALE); | |
403 | right = ((dl_se->deadline - t) >> DL_SCALE) * | |
404 | (pi_se->dl_runtime >> DL_SCALE); | |
405 | ||
406 | return dl_time_before(right, left); | |
407 | } | |
408 | ||
409 | /* | |
410 | * When a -deadline entity is queued back on the runqueue, its runtime and | |
411 | * deadline might need updating. | |
412 | * | |
413 | * The policy here is that we update the deadline of the entity only if: | |
414 | * - the current deadline is in the past, | |
415 | * - using the remaining runtime with the current deadline would make | |
416 | * the entity exceed its bandwidth. | |
417 | */ | |
418 | static void update_dl_entity(struct sched_dl_entity *dl_se, | |
419 | struct sched_dl_entity *pi_se) | |
420 | { | |
421 | struct dl_rq *dl_rq = dl_rq_of_se(dl_se); | |
422 | struct rq *rq = rq_of_dl_rq(dl_rq); | |
423 | ||
424 | /* | |
425 | * The arrival of a new instance needs special treatment, i.e., | |
426 | * the actual scheduling parameters have to be "renewed". | |
427 | */ | |
428 | if (dl_se->dl_new) { | |
429 | setup_new_dl_entity(dl_se, pi_se); | |
430 | return; | |
431 | } | |
432 | ||
433 | if (dl_time_before(dl_se->deadline, rq_clock(rq)) || | |
434 | dl_entity_overflow(dl_se, pi_se, rq_clock(rq))) { | |
435 | dl_se->deadline = rq_clock(rq) + pi_se->dl_deadline; | |
436 | dl_se->runtime = pi_se->dl_runtime; | |
437 | } | |
438 | } | |
439 | ||
440 | /* | |
441 | * If the entity depleted all its runtime, and if we want it to sleep | |
442 | * while waiting for some new execution time to become available, we | |
443 | * set the bandwidth enforcement timer to the replenishment instant | |
444 | * and try to activate it. | |
445 | * | |
446 | * Notice that it is important for the caller to know if the timer | |
447 | * actually started or not (i.e., the replenishment instant is in | |
448 | * the future or in the past). | |
449 | */ | |
450 | static int start_dl_timer(struct sched_dl_entity *dl_se, bool boosted) | |
451 | { | |
452 | struct dl_rq *dl_rq = dl_rq_of_se(dl_se); | |
453 | struct rq *rq = rq_of_dl_rq(dl_rq); | |
454 | ktime_t now, act; | |
455 | ktime_t soft, hard; | |
456 | unsigned long range; | |
457 | s64 delta; | |
458 | ||
459 | if (boosted) | |
460 | return 0; | |
461 | /* | |
462 | * We want the timer to fire at the deadline, but considering | |
463 | * that it is actually coming from rq->clock and not from | |
464 | * hrtimer's time base reading. | |
465 | */ | |
466 | act = ns_to_ktime(dl_se->deadline); | |
467 | now = hrtimer_cb_get_time(&dl_se->dl_timer); | |
468 | delta = ktime_to_ns(now) - rq_clock(rq); | |
469 | act = ktime_add_ns(act, delta); | |
470 | ||
471 | /* | |
472 | * If the expiry time already passed, e.g., because the value | |
473 | * chosen as the deadline is too small, don't even try to | |
474 | * start the timer in the past! | |
475 | */ | |
476 | if (ktime_us_delta(act, now) < 0) | |
477 | return 0; | |
478 | ||
479 | hrtimer_set_expires(&dl_se->dl_timer, act); | |
480 | ||
481 | soft = hrtimer_get_softexpires(&dl_se->dl_timer); | |
482 | hard = hrtimer_get_expires(&dl_se->dl_timer); | |
483 | range = ktime_to_ns(ktime_sub(hard, soft)); | |
484 | __hrtimer_start_range_ns(&dl_se->dl_timer, soft, | |
485 | range, HRTIMER_MODE_ABS, 0); | |
486 | ||
487 | return hrtimer_active(&dl_se->dl_timer); | |
488 | } | |
489 | ||
490 | /* | |
491 | * This is the bandwidth enforcement timer callback. If here, we know | |
492 | * a task is not on its dl_rq, since the fact that the timer was running | |
493 | * means the task is throttled and needs a runtime replenishment. | |
494 | * | |
495 | * However, what we actually do depends on the fact the task is active, | |
496 | * (it is on its rq) or has been removed from there by a call to | |
497 | * dequeue_task_dl(). In the former case we must issue the runtime | |
498 | * replenishment and add the task back to the dl_rq; in the latter, we just | |
499 | * do nothing but clearing dl_throttled, so that runtime and deadline | |
500 | * updating (and the queueing back to dl_rq) will be done by the | |
501 | * next call to enqueue_task_dl(). | |
502 | */ | |
503 | static enum hrtimer_restart dl_task_timer(struct hrtimer *timer) | |
504 | { | |
505 | struct sched_dl_entity *dl_se = container_of(timer, | |
506 | struct sched_dl_entity, | |
507 | dl_timer); | |
508 | struct task_struct *p = dl_task_of(dl_se); | |
509 | struct rq *rq; | |
510 | again: | |
511 | rq = task_rq(p); | |
512 | raw_spin_lock(&rq->lock); | |
513 | ||
514 | if (rq != task_rq(p)) { | |
515 | /* Task was moved, retrying. */ | |
516 | raw_spin_unlock(&rq->lock); | |
517 | goto again; | |
518 | } | |
519 | ||
520 | /* | |
521 | * We need to take care of several possible races here: | |
522 | * | |
523 | * - the task might have changed its scheduling policy | |
524 | * to something different than SCHED_DEADLINE | |
525 | * - the task might have changed its reservation parameters | |
526 | * (through sched_setattr()) | |
527 | * - the task might have been boosted by someone else and | |
528 | * might be in the boosting/deboosting path | |
529 | * | |
530 | * In all this cases we bail out, as the task is already | |
531 | * in the runqueue or is going to be enqueued back anyway. | |
532 | */ | |
533 | if (!dl_task(p) || dl_se->dl_new || | |
534 | dl_se->dl_boosted || !dl_se->dl_throttled) | |
535 | goto unlock; | |
536 | ||
537 | sched_clock_tick(); | |
538 | update_rq_clock(rq); | |
539 | dl_se->dl_throttled = 0; | |
540 | dl_se->dl_yielded = 0; | |
541 | if (task_on_rq_queued(p)) { | |
542 | enqueue_task_dl(rq, p, ENQUEUE_REPLENISH); | |
543 | if (dl_task(rq->curr)) | |
544 | check_preempt_curr_dl(rq, p, 0); | |
545 | else | |
546 | resched_curr(rq); | |
547 | #ifdef CONFIG_SMP | |
548 | /* | |
549 | * Queueing this task back might have overloaded rq, | |
550 | * check if we need to kick someone away. | |
551 | */ | |
552 | if (has_pushable_dl_tasks(rq)) | |
553 | push_dl_task(rq); | |
554 | #endif | |
555 | } | |
556 | unlock: | |
557 | raw_spin_unlock(&rq->lock); | |
558 | ||
559 | return HRTIMER_NORESTART; | |
560 | } | |
561 | ||
562 | void init_dl_task_timer(struct sched_dl_entity *dl_se) | |
563 | { | |
564 | struct hrtimer *timer = &dl_se->dl_timer; | |
565 | ||
566 | hrtimer_init(timer, CLOCK_MONOTONIC, HRTIMER_MODE_REL); | |
567 | timer->function = dl_task_timer; | |
568 | } | |
569 | ||
570 | static | |
571 | int dl_runtime_exceeded(struct rq *rq, struct sched_dl_entity *dl_se) | |
572 | { | |
573 | int dmiss = dl_time_before(dl_se->deadline, rq_clock(rq)); | |
574 | int rorun = dl_se->runtime <= 0; | |
575 | ||
576 | if (!rorun && !dmiss) | |
577 | return 0; | |
578 | ||
579 | /* | |
580 | * If we are beyond our current deadline and we are still | |
581 | * executing, then we have already used some of the runtime of | |
582 | * the next instance. Thus, if we do not account that, we are | |
583 | * stealing bandwidth from the system at each deadline miss! | |
584 | */ | |
585 | if (dmiss) { | |
586 | dl_se->runtime = rorun ? dl_se->runtime : 0; | |
587 | dl_se->runtime -= rq_clock(rq) - dl_se->deadline; | |
588 | } | |
589 | ||
590 | return 1; | |
591 | } | |
592 | ||
593 | extern bool sched_rt_bandwidth_account(struct rt_rq *rt_rq); | |
594 | ||
595 | /* | |
596 | * Update the current task's runtime statistics (provided it is still | |
597 | * a -deadline task and has not been removed from the dl_rq). | |
598 | */ | |
599 | static void update_curr_dl(struct rq *rq) | |
600 | { | |
601 | struct task_struct *curr = rq->curr; | |
602 | struct sched_dl_entity *dl_se = &curr->dl; | |
603 | u64 delta_exec; | |
604 | ||
605 | if (!dl_task(curr) || !on_dl_rq(dl_se)) | |
606 | return; | |
607 | ||
608 | /* | |
609 | * Consumed budget is computed considering the time as | |
610 | * observed by schedulable tasks (excluding time spent | |
611 | * in hardirq context, etc.). Deadlines are instead | |
612 | * computed using hard walltime. This seems to be the more | |
613 | * natural solution, but the full ramifications of this | |
614 | * approach need further study. | |
615 | */ | |
616 | delta_exec = rq_clock_task(rq) - curr->se.exec_start; | |
617 | if (unlikely((s64)delta_exec <= 0)) | |
618 | return; | |
619 | ||
620 | schedstat_set(curr->se.statistics.exec_max, | |
621 | max(curr->se.statistics.exec_max, delta_exec)); | |
622 | ||
623 | curr->se.sum_exec_runtime += delta_exec; | |
624 | account_group_exec_runtime(curr, delta_exec); | |
625 | ||
626 | curr->se.exec_start = rq_clock_task(rq); | |
627 | cpuacct_charge(curr, delta_exec); | |
628 | ||
629 | sched_rt_avg_update(rq, delta_exec); | |
630 | ||
631 | dl_se->runtime -= dl_se->dl_yielded ? 0 : delta_exec; | |
632 | if (dl_runtime_exceeded(rq, dl_se)) { | |
633 | __dequeue_task_dl(rq, curr, 0); | |
634 | if (likely(start_dl_timer(dl_se, curr->dl.dl_boosted))) | |
635 | dl_se->dl_throttled = 1; | |
636 | else | |
637 | enqueue_task_dl(rq, curr, ENQUEUE_REPLENISH); | |
638 | ||
639 | if (!is_leftmost(curr, &rq->dl)) | |
640 | resched_curr(rq); | |
641 | } | |
642 | ||
643 | /* | |
644 | * Because -- for now -- we share the rt bandwidth, we need to | |
645 | * account our runtime there too, otherwise actual rt tasks | |
646 | * would be able to exceed the shared quota. | |
647 | * | |
648 | * Account to the root rt group for now. | |
649 | * | |
650 | * The solution we're working towards is having the RT groups scheduled | |
651 | * using deadline servers -- however there's a few nasties to figure | |
652 | * out before that can happen. | |
653 | */ | |
654 | if (rt_bandwidth_enabled()) { | |
655 | struct rt_rq *rt_rq = &rq->rt; | |
656 | ||
657 | raw_spin_lock(&rt_rq->rt_runtime_lock); | |
658 | /* | |
659 | * We'll let actual RT tasks worry about the overflow here, we | |
660 | * have our own CBS to keep us inline; only account when RT | |
661 | * bandwidth is relevant. | |
662 | */ | |
663 | if (sched_rt_bandwidth_account(rt_rq)) | |
664 | rt_rq->rt_time += delta_exec; | |
665 | raw_spin_unlock(&rt_rq->rt_runtime_lock); | |
666 | } | |
667 | } | |
668 | ||
669 | #ifdef CONFIG_SMP | |
670 | ||
671 | static struct task_struct *pick_next_earliest_dl_task(struct rq *rq, int cpu); | |
672 | ||
673 | static inline u64 next_deadline(struct rq *rq) | |
674 | { | |
675 | struct task_struct *next = pick_next_earliest_dl_task(rq, rq->cpu); | |
676 | ||
677 | if (next && dl_prio(next->prio)) | |
678 | return next->dl.deadline; | |
679 | else | |
680 | return 0; | |
681 | } | |
682 | ||
683 | static void inc_dl_deadline(struct dl_rq *dl_rq, u64 deadline) | |
684 | { | |
685 | struct rq *rq = rq_of_dl_rq(dl_rq); | |
686 | ||
687 | if (dl_rq->earliest_dl.curr == 0 || | |
688 | dl_time_before(deadline, dl_rq->earliest_dl.curr)) { | |
689 | /* | |
690 | * If the dl_rq had no -deadline tasks, or if the new task | |
691 | * has shorter deadline than the current one on dl_rq, we | |
692 | * know that the previous earliest becomes our next earliest, | |
693 | * as the new task becomes the earliest itself. | |
694 | */ | |
695 | dl_rq->earliest_dl.next = dl_rq->earliest_dl.curr; | |
696 | dl_rq->earliest_dl.curr = deadline; | |
697 | cpudl_set(&rq->rd->cpudl, rq->cpu, deadline, 1); | |
698 | } else if (dl_rq->earliest_dl.next == 0 || | |
699 | dl_time_before(deadline, dl_rq->earliest_dl.next)) { | |
700 | /* | |
701 | * On the other hand, if the new -deadline task has a | |
702 | * a later deadline than the earliest one on dl_rq, but | |
703 | * it is earlier than the next (if any), we must | |
704 | * recompute the next-earliest. | |
705 | */ | |
706 | dl_rq->earliest_dl.next = next_deadline(rq); | |
707 | } | |
708 | } | |
709 | ||
710 | static void dec_dl_deadline(struct dl_rq *dl_rq, u64 deadline) | |
711 | { | |
712 | struct rq *rq = rq_of_dl_rq(dl_rq); | |
713 | ||
714 | /* | |
715 | * Since we may have removed our earliest (and/or next earliest) | |
716 | * task we must recompute them. | |
717 | */ | |
718 | if (!dl_rq->dl_nr_running) { | |
719 | dl_rq->earliest_dl.curr = 0; | |
720 | dl_rq->earliest_dl.next = 0; | |
721 | cpudl_set(&rq->rd->cpudl, rq->cpu, 0, 0); | |
722 | } else { | |
723 | struct rb_node *leftmost = dl_rq->rb_leftmost; | |
724 | struct sched_dl_entity *entry; | |
725 | ||
726 | entry = rb_entry(leftmost, struct sched_dl_entity, rb_node); | |
727 | dl_rq->earliest_dl.curr = entry->deadline; | |
728 | dl_rq->earliest_dl.next = next_deadline(rq); | |
729 | cpudl_set(&rq->rd->cpudl, rq->cpu, entry->deadline, 1); | |
730 | } | |
731 | } | |
732 | ||
733 | #else | |
734 | ||
735 | static inline void inc_dl_deadline(struct dl_rq *dl_rq, u64 deadline) {} | |
736 | static inline void dec_dl_deadline(struct dl_rq *dl_rq, u64 deadline) {} | |
737 | ||
738 | #endif /* CONFIG_SMP */ | |
739 | ||
740 | static inline | |
741 | void inc_dl_tasks(struct sched_dl_entity *dl_se, struct dl_rq *dl_rq) | |
742 | { | |
743 | int prio = dl_task_of(dl_se)->prio; | |
744 | u64 deadline = dl_se->deadline; | |
745 | ||
746 | WARN_ON(!dl_prio(prio)); | |
747 | dl_rq->dl_nr_running++; | |
748 | add_nr_running(rq_of_dl_rq(dl_rq), 1); | |
749 | ||
750 | inc_dl_deadline(dl_rq, deadline); | |
751 | inc_dl_migration(dl_se, dl_rq); | |
752 | } | |
753 | ||
754 | static inline | |
755 | void dec_dl_tasks(struct sched_dl_entity *dl_se, struct dl_rq *dl_rq) | |
756 | { | |
757 | int prio = dl_task_of(dl_se)->prio; | |
758 | ||
759 | WARN_ON(!dl_prio(prio)); | |
760 | WARN_ON(!dl_rq->dl_nr_running); | |
761 | dl_rq->dl_nr_running--; | |
762 | sub_nr_running(rq_of_dl_rq(dl_rq), 1); | |
763 | ||
764 | dec_dl_deadline(dl_rq, dl_se->deadline); | |
765 | dec_dl_migration(dl_se, dl_rq); | |
766 | } | |
767 | ||
768 | static void __enqueue_dl_entity(struct sched_dl_entity *dl_se) | |
769 | { | |
770 | struct dl_rq *dl_rq = dl_rq_of_se(dl_se); | |
771 | struct rb_node **link = &dl_rq->rb_root.rb_node; | |
772 | struct rb_node *parent = NULL; | |
773 | struct sched_dl_entity *entry; | |
774 | int leftmost = 1; | |
775 | ||
776 | BUG_ON(!RB_EMPTY_NODE(&dl_se->rb_node)); | |
777 | ||
778 | while (*link) { | |
779 | parent = *link; | |
780 | entry = rb_entry(parent, struct sched_dl_entity, rb_node); | |
781 | if (dl_time_before(dl_se->deadline, entry->deadline)) | |
782 | link = &parent->rb_left; | |
783 | else { | |
784 | link = &parent->rb_right; | |
785 | leftmost = 0; | |
786 | } | |
787 | } | |
788 | ||
789 | if (leftmost) | |
790 | dl_rq->rb_leftmost = &dl_se->rb_node; | |
791 | ||
792 | rb_link_node(&dl_se->rb_node, parent, link); | |
793 | rb_insert_color(&dl_se->rb_node, &dl_rq->rb_root); | |
794 | ||
795 | inc_dl_tasks(dl_se, dl_rq); | |
796 | } | |
797 | ||
798 | static void __dequeue_dl_entity(struct sched_dl_entity *dl_se) | |
799 | { | |
800 | struct dl_rq *dl_rq = dl_rq_of_se(dl_se); | |
801 | ||
802 | if (RB_EMPTY_NODE(&dl_se->rb_node)) | |
803 | return; | |
804 | ||
805 | if (dl_rq->rb_leftmost == &dl_se->rb_node) { | |
806 | struct rb_node *next_node; | |
807 | ||
808 | next_node = rb_next(&dl_se->rb_node); | |
809 | dl_rq->rb_leftmost = next_node; | |
810 | } | |
811 | ||
812 | rb_erase(&dl_se->rb_node, &dl_rq->rb_root); | |
813 | RB_CLEAR_NODE(&dl_se->rb_node); | |
814 | ||
815 | dec_dl_tasks(dl_se, dl_rq); | |
816 | } | |
817 | ||
818 | static void | |
819 | enqueue_dl_entity(struct sched_dl_entity *dl_se, | |
820 | struct sched_dl_entity *pi_se, int flags) | |
821 | { | |
822 | BUG_ON(on_dl_rq(dl_se)); | |
823 | ||
824 | /* | |
825 | * If this is a wakeup or a new instance, the scheduling | |
826 | * parameters of the task might need updating. Otherwise, | |
827 | * we want a replenishment of its runtime. | |
828 | */ | |
829 | if (!dl_se->dl_new && flags & ENQUEUE_REPLENISH) | |
830 | replenish_dl_entity(dl_se, pi_se); | |
831 | else | |
832 | update_dl_entity(dl_se, pi_se); | |
833 | ||
834 | __enqueue_dl_entity(dl_se); | |
835 | } | |
836 | ||
837 | static void dequeue_dl_entity(struct sched_dl_entity *dl_se) | |
838 | { | |
839 | __dequeue_dl_entity(dl_se); | |
840 | } | |
841 | ||
842 | static void enqueue_task_dl(struct rq *rq, struct task_struct *p, int flags) | |
843 | { | |
844 | struct task_struct *pi_task = rt_mutex_get_top_task(p); | |
845 | struct sched_dl_entity *pi_se = &p->dl; | |
846 | ||
847 | /* | |
848 | * Use the scheduling parameters of the top pi-waiter | |
849 | * task if we have one and its (relative) deadline is | |
850 | * smaller than our one... OTW we keep our runtime and | |
851 | * deadline. | |
852 | */ | |
853 | if (pi_task && p->dl.dl_boosted && dl_prio(pi_task->normal_prio)) { | |
854 | pi_se = &pi_task->dl; | |
855 | } else if (!dl_prio(p->normal_prio)) { | |
856 | /* | |
857 | * Special case in which we have a !SCHED_DEADLINE task | |
858 | * that is going to be deboosted, but exceedes its | |
859 | * runtime while doing so. No point in replenishing | |
860 | * it, as it's going to return back to its original | |
861 | * scheduling class after this. | |
862 | */ | |
863 | BUG_ON(!p->dl.dl_boosted || flags != ENQUEUE_REPLENISH); | |
864 | return; | |
865 | } | |
866 | ||
867 | /* | |
868 | * If p is throttled, we do nothing. In fact, if it exhausted | |
869 | * its budget it needs a replenishment and, since it now is on | |
870 | * its rq, the bandwidth timer callback (which clearly has not | |
871 | * run yet) will take care of this. | |
872 | */ | |
873 | if (p->dl.dl_throttled) | |
874 | return; | |
875 | ||
876 | enqueue_dl_entity(&p->dl, pi_se, flags); | |
877 | ||
878 | if (!task_current(rq, p) && p->nr_cpus_allowed > 1) | |
879 | enqueue_pushable_dl_task(rq, p); | |
880 | } | |
881 | ||
882 | static void __dequeue_task_dl(struct rq *rq, struct task_struct *p, int flags) | |
883 | { | |
884 | dequeue_dl_entity(&p->dl); | |
885 | dequeue_pushable_dl_task(rq, p); | |
886 | } | |
887 | ||
888 | static void dequeue_task_dl(struct rq *rq, struct task_struct *p, int flags) | |
889 | { | |
890 | update_curr_dl(rq); | |
891 | __dequeue_task_dl(rq, p, flags); | |
892 | } | |
893 | ||
894 | /* | |
895 | * Yield task semantic for -deadline tasks is: | |
896 | * | |
897 | * get off from the CPU until our next instance, with | |
898 | * a new runtime. This is of little use now, since we | |
899 | * don't have a bandwidth reclaiming mechanism. Anyway, | |
900 | * bandwidth reclaiming is planned for the future, and | |
901 | * yield_task_dl will indicate that some spare budget | |
902 | * is available for other task instances to use it. | |
903 | */ | |
904 | static void yield_task_dl(struct rq *rq) | |
905 | { | |
906 | struct task_struct *p = rq->curr; | |
907 | ||
908 | /* | |
909 | * We make the task go to sleep until its current deadline by | |
910 | * forcing its runtime to zero. This way, update_curr_dl() stops | |
911 | * it and the bandwidth timer will wake it up and will give it | |
912 | * new scheduling parameters (thanks to dl_yielded=1). | |
913 | */ | |
914 | if (p->dl.runtime > 0) { | |
915 | rq->curr->dl.dl_yielded = 1; | |
916 | p->dl.runtime = 0; | |
917 | } | |
918 | update_curr_dl(rq); | |
919 | } | |
920 | ||
921 | #ifdef CONFIG_SMP | |
922 | ||
923 | static int find_later_rq(struct task_struct *task); | |
924 | ||
925 | static int | |
926 | select_task_rq_dl(struct task_struct *p, int cpu, int sd_flag, int flags) | |
927 | { | |
928 | struct task_struct *curr; | |
929 | struct rq *rq; | |
930 | ||
931 | if (sd_flag != SD_BALANCE_WAKE) | |
932 | goto out; | |
933 | ||
934 | rq = cpu_rq(cpu); | |
935 | ||
936 | rcu_read_lock(); | |
937 | curr = ACCESS_ONCE(rq->curr); /* unlocked access */ | |
938 | ||
939 | /* | |
940 | * If we are dealing with a -deadline task, we must | |
941 | * decide where to wake it up. | |
942 | * If it has a later deadline and the current task | |
943 | * on this rq can't move (provided the waking task | |
944 | * can!) we prefer to send it somewhere else. On the | |
945 | * other hand, if it has a shorter deadline, we | |
946 | * try to make it stay here, it might be important. | |
947 | */ | |
948 | if (unlikely(dl_task(curr)) && | |
949 | (curr->nr_cpus_allowed < 2 || | |
950 | !dl_entity_preempt(&p->dl, &curr->dl)) && | |
951 | (p->nr_cpus_allowed > 1)) { | |
952 | int target = find_later_rq(p); | |
953 | ||
954 | if (target != -1) | |
955 | cpu = target; | |
956 | } | |
957 | rcu_read_unlock(); | |
958 | ||
959 | out: | |
960 | return cpu; | |
961 | } | |
962 | ||
963 | static void check_preempt_equal_dl(struct rq *rq, struct task_struct *p) | |
964 | { | |
965 | /* | |
966 | * Current can't be migrated, useless to reschedule, | |
967 | * let's hope p can move out. | |
968 | */ | |
969 | if (rq->curr->nr_cpus_allowed == 1 || | |
970 | cpudl_find(&rq->rd->cpudl, rq->curr, NULL) == -1) | |
971 | return; | |
972 | ||
973 | /* | |
974 | * p is migratable, so let's not schedule it and | |
975 | * see if it is pushed or pulled somewhere else. | |
976 | */ | |
977 | if (p->nr_cpus_allowed != 1 && | |
978 | cpudl_find(&rq->rd->cpudl, p, NULL) != -1) | |
979 | return; | |
980 | ||
981 | resched_curr(rq); | |
982 | } | |
983 | ||
984 | static int pull_dl_task(struct rq *this_rq); | |
985 | ||
986 | #endif /* CONFIG_SMP */ | |
987 | ||
988 | /* | |
989 | * Only called when both the current and waking task are -deadline | |
990 | * tasks. | |
991 | */ | |
992 | static void check_preempt_curr_dl(struct rq *rq, struct task_struct *p, | |
993 | int flags) | |
994 | { | |
995 | if (dl_entity_preempt(&p->dl, &rq->curr->dl)) { | |
996 | resched_curr(rq); | |
997 | return; | |
998 | } | |
999 | ||
1000 | #ifdef CONFIG_SMP | |
1001 | /* | |
1002 | * In the unlikely case current and p have the same deadline | |
1003 | * let us try to decide what's the best thing to do... | |
1004 | */ | |
1005 | if ((p->dl.deadline == rq->curr->dl.deadline) && | |
1006 | !test_tsk_need_resched(rq->curr)) | |
1007 | check_preempt_equal_dl(rq, p); | |
1008 | #endif /* CONFIG_SMP */ | |
1009 | } | |
1010 | ||
1011 | #ifdef CONFIG_SCHED_HRTICK | |
1012 | static void start_hrtick_dl(struct rq *rq, struct task_struct *p) | |
1013 | { | |
1014 | hrtick_start(rq, p->dl.runtime); | |
1015 | } | |
1016 | #else /* !CONFIG_SCHED_HRTICK */ | |
1017 | static void start_hrtick_dl(struct rq *rq, struct task_struct *p) | |
1018 | { | |
1019 | } | |
1020 | #endif | |
1021 | ||
1022 | static struct sched_dl_entity *pick_next_dl_entity(struct rq *rq, | |
1023 | struct dl_rq *dl_rq) | |
1024 | { | |
1025 | struct rb_node *left = dl_rq->rb_leftmost; | |
1026 | ||
1027 | if (!left) | |
1028 | return NULL; | |
1029 | ||
1030 | return rb_entry(left, struct sched_dl_entity, rb_node); | |
1031 | } | |
1032 | ||
1033 | struct task_struct *pick_next_task_dl(struct rq *rq, struct task_struct *prev) | |
1034 | { | |
1035 | struct sched_dl_entity *dl_se; | |
1036 | struct task_struct *p; | |
1037 | struct dl_rq *dl_rq; | |
1038 | ||
1039 | dl_rq = &rq->dl; | |
1040 | ||
1041 | if (need_pull_dl_task(rq, prev)) { | |
1042 | pull_dl_task(rq); | |
1043 | /* | |
1044 | * pull_rt_task() can drop (and re-acquire) rq->lock; this | |
1045 | * means a stop task can slip in, in which case we need to | |
1046 | * re-start task selection. | |
1047 | */ | |
1048 | if (rq->stop && task_on_rq_queued(rq->stop)) | |
1049 | return RETRY_TASK; | |
1050 | } | |
1051 | ||
1052 | /* | |
1053 | * When prev is DL, we may throttle it in put_prev_task(). | |
1054 | * So, we update time before we check for dl_nr_running. | |
1055 | */ | |
1056 | if (prev->sched_class == &dl_sched_class) | |
1057 | update_curr_dl(rq); | |
1058 | ||
1059 | if (unlikely(!dl_rq->dl_nr_running)) | |
1060 | return NULL; | |
1061 | ||
1062 | put_prev_task(rq, prev); | |
1063 | ||
1064 | dl_se = pick_next_dl_entity(rq, dl_rq); | |
1065 | BUG_ON(!dl_se); | |
1066 | ||
1067 | p = dl_task_of(dl_se); | |
1068 | p->se.exec_start = rq_clock_task(rq); | |
1069 | ||
1070 | /* Running task will never be pushed. */ | |
1071 | dequeue_pushable_dl_task(rq, p); | |
1072 | ||
1073 | if (hrtick_enabled(rq)) | |
1074 | start_hrtick_dl(rq, p); | |
1075 | ||
1076 | set_post_schedule(rq); | |
1077 | ||
1078 | return p; | |
1079 | } | |
1080 | ||
1081 | static void put_prev_task_dl(struct rq *rq, struct task_struct *p) | |
1082 | { | |
1083 | update_curr_dl(rq); | |
1084 | ||
1085 | if (on_dl_rq(&p->dl) && p->nr_cpus_allowed > 1) | |
1086 | enqueue_pushable_dl_task(rq, p); | |
1087 | } | |
1088 | ||
1089 | static void task_tick_dl(struct rq *rq, struct task_struct *p, int queued) | |
1090 | { | |
1091 | update_curr_dl(rq); | |
1092 | ||
1093 | if (hrtick_enabled(rq) && queued && p->dl.runtime > 0) | |
1094 | start_hrtick_dl(rq, p); | |
1095 | } | |
1096 | ||
1097 | static void task_fork_dl(struct task_struct *p) | |
1098 | { | |
1099 | /* | |
1100 | * SCHED_DEADLINE tasks cannot fork and this is achieved through | |
1101 | * sched_fork() | |
1102 | */ | |
1103 | } | |
1104 | ||
1105 | static void task_dead_dl(struct task_struct *p) | |
1106 | { | |
1107 | struct hrtimer *timer = &p->dl.dl_timer; | |
1108 | struct dl_bw *dl_b = dl_bw_of(task_cpu(p)); | |
1109 | ||
1110 | /* | |
1111 | * Since we are TASK_DEAD we won't slip out of the domain! | |
1112 | */ | |
1113 | raw_spin_lock_irq(&dl_b->lock); | |
1114 | dl_b->total_bw -= p->dl.dl_bw; | |
1115 | raw_spin_unlock_irq(&dl_b->lock); | |
1116 | ||
1117 | hrtimer_cancel(timer); | |
1118 | } | |
1119 | ||
1120 | static void set_curr_task_dl(struct rq *rq) | |
1121 | { | |
1122 | struct task_struct *p = rq->curr; | |
1123 | ||
1124 | p->se.exec_start = rq_clock_task(rq); | |
1125 | ||
1126 | /* You can't push away the running task */ | |
1127 | dequeue_pushable_dl_task(rq, p); | |
1128 | } | |
1129 | ||
1130 | #ifdef CONFIG_SMP | |
1131 | ||
1132 | /* Only try algorithms three times */ | |
1133 | #define DL_MAX_TRIES 3 | |
1134 | ||
1135 | static int pick_dl_task(struct rq *rq, struct task_struct *p, int cpu) | |
1136 | { | |
1137 | if (!task_running(rq, p) && | |
1138 | cpumask_test_cpu(cpu, tsk_cpus_allowed(p))) | |
1139 | return 1; | |
1140 | return 0; | |
1141 | } | |
1142 | ||
1143 | /* Returns the second earliest -deadline task, NULL otherwise */ | |
1144 | static struct task_struct *pick_next_earliest_dl_task(struct rq *rq, int cpu) | |
1145 | { | |
1146 | struct rb_node *next_node = rq->dl.rb_leftmost; | |
1147 | struct sched_dl_entity *dl_se; | |
1148 | struct task_struct *p = NULL; | |
1149 | ||
1150 | next_node: | |
1151 | next_node = rb_next(next_node); | |
1152 | if (next_node) { | |
1153 | dl_se = rb_entry(next_node, struct sched_dl_entity, rb_node); | |
1154 | p = dl_task_of(dl_se); | |
1155 | ||
1156 | if (pick_dl_task(rq, p, cpu)) | |
1157 | return p; | |
1158 | ||
1159 | goto next_node; | |
1160 | } | |
1161 | ||
1162 | return NULL; | |
1163 | } | |
1164 | ||
1165 | static DEFINE_PER_CPU(cpumask_var_t, local_cpu_mask_dl); | |
1166 | ||
1167 | static int find_later_rq(struct task_struct *task) | |
1168 | { | |
1169 | struct sched_domain *sd; | |
1170 | struct cpumask *later_mask = this_cpu_cpumask_var_ptr(local_cpu_mask_dl); | |
1171 | int this_cpu = smp_processor_id(); | |
1172 | int best_cpu, cpu = task_cpu(task); | |
1173 | ||
1174 | /* Make sure the mask is initialized first */ | |
1175 | if (unlikely(!later_mask)) | |
1176 | return -1; | |
1177 | ||
1178 | if (task->nr_cpus_allowed == 1) | |
1179 | return -1; | |
1180 | ||
1181 | /* | |
1182 | * We have to consider system topology and task affinity | |
1183 | * first, then we can look for a suitable cpu. | |
1184 | */ | |
1185 | cpumask_copy(later_mask, task_rq(task)->rd->span); | |
1186 | cpumask_and(later_mask, later_mask, cpu_active_mask); | |
1187 | cpumask_and(later_mask, later_mask, &task->cpus_allowed); | |
1188 | best_cpu = cpudl_find(&task_rq(task)->rd->cpudl, | |
1189 | task, later_mask); | |
1190 | if (best_cpu == -1) | |
1191 | return -1; | |
1192 | ||
1193 | /* | |
1194 | * If we are here, some target has been found, | |
1195 | * the most suitable of which is cached in best_cpu. | |
1196 | * This is, among the runqueues where the current tasks | |
1197 | * have later deadlines than the task's one, the rq | |
1198 | * with the latest possible one. | |
1199 | * | |
1200 | * Now we check how well this matches with task's | |
1201 | * affinity and system topology. | |
1202 | * | |
1203 | * The last cpu where the task run is our first | |
1204 | * guess, since it is most likely cache-hot there. | |
1205 | */ | |
1206 | if (cpumask_test_cpu(cpu, later_mask)) | |
1207 | return cpu; | |
1208 | /* | |
1209 | * Check if this_cpu is to be skipped (i.e., it is | |
1210 | * not in the mask) or not. | |
1211 | */ | |
1212 | if (!cpumask_test_cpu(this_cpu, later_mask)) | |
1213 | this_cpu = -1; | |
1214 | ||
1215 | rcu_read_lock(); | |
1216 | for_each_domain(cpu, sd) { | |
1217 | if (sd->flags & SD_WAKE_AFFINE) { | |
1218 | ||
1219 | /* | |
1220 | * If possible, preempting this_cpu is | |
1221 | * cheaper than migrating. | |
1222 | */ | |
1223 | if (this_cpu != -1 && | |
1224 | cpumask_test_cpu(this_cpu, sched_domain_span(sd))) { | |
1225 | rcu_read_unlock(); | |
1226 | return this_cpu; | |
1227 | } | |
1228 | ||
1229 | /* | |
1230 | * Last chance: if best_cpu is valid and is | |
1231 | * in the mask, that becomes our choice. | |
1232 | */ | |
1233 | if (best_cpu < nr_cpu_ids && | |
1234 | cpumask_test_cpu(best_cpu, sched_domain_span(sd))) { | |
1235 | rcu_read_unlock(); | |
1236 | return best_cpu; | |
1237 | } | |
1238 | } | |
1239 | } | |
1240 | rcu_read_unlock(); | |
1241 | ||
1242 | /* | |
1243 | * At this point, all our guesses failed, we just return | |
1244 | * 'something', and let the caller sort the things out. | |
1245 | */ | |
1246 | if (this_cpu != -1) | |
1247 | return this_cpu; | |
1248 | ||
1249 | cpu = cpumask_any(later_mask); | |
1250 | if (cpu < nr_cpu_ids) | |
1251 | return cpu; | |
1252 | ||
1253 | return -1; | |
1254 | } | |
1255 | ||
1256 | /* Locks the rq it finds */ | |
1257 | static struct rq *find_lock_later_rq(struct task_struct *task, struct rq *rq) | |
1258 | { | |
1259 | struct rq *later_rq = NULL; | |
1260 | int tries; | |
1261 | int cpu; | |
1262 | ||
1263 | for (tries = 0; tries < DL_MAX_TRIES; tries++) { | |
1264 | cpu = find_later_rq(task); | |
1265 | ||
1266 | if ((cpu == -1) || (cpu == rq->cpu)) | |
1267 | break; | |
1268 | ||
1269 | later_rq = cpu_rq(cpu); | |
1270 | ||
1271 | /* Retry if something changed. */ | |
1272 | if (double_lock_balance(rq, later_rq)) { | |
1273 | if (unlikely(task_rq(task) != rq || | |
1274 | !cpumask_test_cpu(later_rq->cpu, | |
1275 | &task->cpus_allowed) || | |
1276 | task_running(rq, task) || | |
1277 | !task_on_rq_queued(task))) { | |
1278 | double_unlock_balance(rq, later_rq); | |
1279 | later_rq = NULL; | |
1280 | break; | |
1281 | } | |
1282 | } | |
1283 | ||
1284 | /* | |
1285 | * If the rq we found has no -deadline task, or | |
1286 | * its earliest one has a later deadline than our | |
1287 | * task, the rq is a good one. | |
1288 | */ | |
1289 | if (!later_rq->dl.dl_nr_running || | |
1290 | dl_time_before(task->dl.deadline, | |
1291 | later_rq->dl.earliest_dl.curr)) | |
1292 | break; | |
1293 | ||
1294 | /* Otherwise we try again. */ | |
1295 | double_unlock_balance(rq, later_rq); | |
1296 | later_rq = NULL; | |
1297 | } | |
1298 | ||
1299 | return later_rq; | |
1300 | } | |
1301 | ||
1302 | static struct task_struct *pick_next_pushable_dl_task(struct rq *rq) | |
1303 | { | |
1304 | struct task_struct *p; | |
1305 | ||
1306 | if (!has_pushable_dl_tasks(rq)) | |
1307 | return NULL; | |
1308 | ||
1309 | p = rb_entry(rq->dl.pushable_dl_tasks_leftmost, | |
1310 | struct task_struct, pushable_dl_tasks); | |
1311 | ||
1312 | BUG_ON(rq->cpu != task_cpu(p)); | |
1313 | BUG_ON(task_current(rq, p)); | |
1314 | BUG_ON(p->nr_cpus_allowed <= 1); | |
1315 | ||
1316 | BUG_ON(!task_on_rq_queued(p)); | |
1317 | BUG_ON(!dl_task(p)); | |
1318 | ||
1319 | return p; | |
1320 | } | |
1321 | ||
1322 | /* | |
1323 | * See if the non running -deadline tasks on this rq | |
1324 | * can be sent to some other CPU where they can preempt | |
1325 | * and start executing. | |
1326 | */ | |
1327 | static int push_dl_task(struct rq *rq) | |
1328 | { | |
1329 | struct task_struct *next_task; | |
1330 | struct rq *later_rq; | |
1331 | int ret = 0; | |
1332 | ||
1333 | if (!rq->dl.overloaded) | |
1334 | return 0; | |
1335 | ||
1336 | next_task = pick_next_pushable_dl_task(rq); | |
1337 | if (!next_task) | |
1338 | return 0; | |
1339 | ||
1340 | retry: | |
1341 | if (unlikely(next_task == rq->curr)) { | |
1342 | WARN_ON(1); | |
1343 | return 0; | |
1344 | } | |
1345 | ||
1346 | /* | |
1347 | * If next_task preempts rq->curr, and rq->curr | |
1348 | * can move away, it makes sense to just reschedule | |
1349 | * without going further in pushing next_task. | |
1350 | */ | |
1351 | if (dl_task(rq->curr) && | |
1352 | dl_time_before(next_task->dl.deadline, rq->curr->dl.deadline) && | |
1353 | rq->curr->nr_cpus_allowed > 1) { | |
1354 | resched_curr(rq); | |
1355 | return 0; | |
1356 | } | |
1357 | ||
1358 | /* We might release rq lock */ | |
1359 | get_task_struct(next_task); | |
1360 | ||
1361 | /* Will lock the rq it'll find */ | |
1362 | later_rq = find_lock_later_rq(next_task, rq); | |
1363 | if (!later_rq) { | |
1364 | struct task_struct *task; | |
1365 | ||
1366 | /* | |
1367 | * We must check all this again, since | |
1368 | * find_lock_later_rq releases rq->lock and it is | |
1369 | * then possible that next_task has migrated. | |
1370 | */ | |
1371 | task = pick_next_pushable_dl_task(rq); | |
1372 | if (task_cpu(next_task) == rq->cpu && task == next_task) { | |
1373 | /* | |
1374 | * The task is still there. We don't try | |
1375 | * again, some other cpu will pull it when ready. | |
1376 | */ | |
1377 | goto out; | |
1378 | } | |
1379 | ||
1380 | if (!task) | |
1381 | /* No more tasks */ | |
1382 | goto out; | |
1383 | ||
1384 | put_task_struct(next_task); | |
1385 | next_task = task; | |
1386 | goto retry; | |
1387 | } | |
1388 | ||
1389 | deactivate_task(rq, next_task, 0); | |
1390 | set_task_cpu(next_task, later_rq->cpu); | |
1391 | activate_task(later_rq, next_task, 0); | |
1392 | ret = 1; | |
1393 | ||
1394 | resched_curr(later_rq); | |
1395 | ||
1396 | double_unlock_balance(rq, later_rq); | |
1397 | ||
1398 | out: | |
1399 | put_task_struct(next_task); | |
1400 | ||
1401 | return ret; | |
1402 | } | |
1403 | ||
1404 | static void push_dl_tasks(struct rq *rq) | |
1405 | { | |
1406 | /* Terminates as it moves a -deadline task */ | |
1407 | while (push_dl_task(rq)) | |
1408 | ; | |
1409 | } | |
1410 | ||
1411 | static int pull_dl_task(struct rq *this_rq) | |
1412 | { | |
1413 | int this_cpu = this_rq->cpu, ret = 0, cpu; | |
1414 | struct task_struct *p; | |
1415 | struct rq *src_rq; | |
1416 | u64 dmin = LONG_MAX; | |
1417 | ||
1418 | if (likely(!dl_overloaded(this_rq))) | |
1419 | return 0; | |
1420 | ||
1421 | /* | |
1422 | * Match the barrier from dl_set_overloaded; this guarantees that if we | |
1423 | * see overloaded we must also see the dlo_mask bit. | |
1424 | */ | |
1425 | smp_rmb(); | |
1426 | ||
1427 | for_each_cpu(cpu, this_rq->rd->dlo_mask) { | |
1428 | if (this_cpu == cpu) | |
1429 | continue; | |
1430 | ||
1431 | src_rq = cpu_rq(cpu); | |
1432 | ||
1433 | /* | |
1434 | * It looks racy, abd it is! However, as in sched_rt.c, | |
1435 | * we are fine with this. | |
1436 | */ | |
1437 | if (this_rq->dl.dl_nr_running && | |
1438 | dl_time_before(this_rq->dl.earliest_dl.curr, | |
1439 | src_rq->dl.earliest_dl.next)) | |
1440 | continue; | |
1441 | ||
1442 | /* Might drop this_rq->lock */ | |
1443 | double_lock_balance(this_rq, src_rq); | |
1444 | ||
1445 | /* | |
1446 | * If there are no more pullable tasks on the | |
1447 | * rq, we're done with it. | |
1448 | */ | |
1449 | if (src_rq->dl.dl_nr_running <= 1) | |
1450 | goto skip; | |
1451 | ||
1452 | p = pick_next_earliest_dl_task(src_rq, this_cpu); | |
1453 | ||
1454 | /* | |
1455 | * We found a task to be pulled if: | |
1456 | * - it preempts our current (if there's one), | |
1457 | * - it will preempt the last one we pulled (if any). | |
1458 | */ | |
1459 | if (p && dl_time_before(p->dl.deadline, dmin) && | |
1460 | (!this_rq->dl.dl_nr_running || | |
1461 | dl_time_before(p->dl.deadline, | |
1462 | this_rq->dl.earliest_dl.curr))) { | |
1463 | WARN_ON(p == src_rq->curr); | |
1464 | WARN_ON(!task_on_rq_queued(p)); | |
1465 | ||
1466 | /* | |
1467 | * Then we pull iff p has actually an earlier | |
1468 | * deadline than the current task of its runqueue. | |
1469 | */ | |
1470 | if (dl_time_before(p->dl.deadline, | |
1471 | src_rq->curr->dl.deadline)) | |
1472 | goto skip; | |
1473 | ||
1474 | ret = 1; | |
1475 | ||
1476 | deactivate_task(src_rq, p, 0); | |
1477 | set_task_cpu(p, this_cpu); | |
1478 | activate_task(this_rq, p, 0); | |
1479 | dmin = p->dl.deadline; | |
1480 | ||
1481 | /* Is there any other task even earlier? */ | |
1482 | } | |
1483 | skip: | |
1484 | double_unlock_balance(this_rq, src_rq); | |
1485 | } | |
1486 | ||
1487 | return ret; | |
1488 | } | |
1489 | ||
1490 | static void post_schedule_dl(struct rq *rq) | |
1491 | { | |
1492 | push_dl_tasks(rq); | |
1493 | } | |
1494 | ||
1495 | /* | |
1496 | * Since the task is not running and a reschedule is not going to happen | |
1497 | * anytime soon on its runqueue, we try pushing it away now. | |
1498 | */ | |
1499 | static void task_woken_dl(struct rq *rq, struct task_struct *p) | |
1500 | { | |
1501 | if (!task_running(rq, p) && | |
1502 | !test_tsk_need_resched(rq->curr) && | |
1503 | has_pushable_dl_tasks(rq) && | |
1504 | p->nr_cpus_allowed > 1 && | |
1505 | dl_task(rq->curr) && | |
1506 | (rq->curr->nr_cpus_allowed < 2 || | |
1507 | !dl_entity_preempt(&p->dl, &rq->curr->dl))) { | |
1508 | push_dl_tasks(rq); | |
1509 | } | |
1510 | } | |
1511 | ||
1512 | static void set_cpus_allowed_dl(struct task_struct *p, | |
1513 | const struct cpumask *new_mask) | |
1514 | { | |
1515 | struct rq *rq; | |
1516 | struct root_domain *src_rd; | |
1517 | int weight; | |
1518 | ||
1519 | BUG_ON(!dl_task(p)); | |
1520 | ||
1521 | rq = task_rq(p); | |
1522 | src_rd = rq->rd; | |
1523 | /* | |
1524 | * Migrating a SCHED_DEADLINE task between exclusive | |
1525 | * cpusets (different root_domains) entails a bandwidth | |
1526 | * update. We already made space for us in the destination | |
1527 | * domain (see cpuset_can_attach()). | |
1528 | */ | |
1529 | if (!cpumask_intersects(src_rd->span, new_mask)) { | |
1530 | struct dl_bw *src_dl_b; | |
1531 | ||
1532 | src_dl_b = dl_bw_of(cpu_of(rq)); | |
1533 | /* | |
1534 | * We now free resources of the root_domain we are migrating | |
1535 | * off. In the worst case, sched_setattr() may temporary fail | |
1536 | * until we complete the update. | |
1537 | */ | |
1538 | raw_spin_lock(&src_dl_b->lock); | |
1539 | __dl_clear(src_dl_b, p->dl.dl_bw); | |
1540 | raw_spin_unlock(&src_dl_b->lock); | |
1541 | } | |
1542 | ||
1543 | /* | |
1544 | * Update only if the task is actually running (i.e., | |
1545 | * it is on the rq AND it is not throttled). | |
1546 | */ | |
1547 | if (!on_dl_rq(&p->dl)) | |
1548 | return; | |
1549 | ||
1550 | weight = cpumask_weight(new_mask); | |
1551 | ||
1552 | /* | |
1553 | * Only update if the process changes its state from whether it | |
1554 | * can migrate or not. | |
1555 | */ | |
1556 | if ((p->nr_cpus_allowed > 1) == (weight > 1)) | |
1557 | return; | |
1558 | ||
1559 | /* | |
1560 | * The process used to be able to migrate OR it can now migrate | |
1561 | */ | |
1562 | if (weight <= 1) { | |
1563 | if (!task_current(rq, p)) | |
1564 | dequeue_pushable_dl_task(rq, p); | |
1565 | BUG_ON(!rq->dl.dl_nr_migratory); | |
1566 | rq->dl.dl_nr_migratory--; | |
1567 | } else { | |
1568 | if (!task_current(rq, p)) | |
1569 | enqueue_pushable_dl_task(rq, p); | |
1570 | rq->dl.dl_nr_migratory++; | |
1571 | } | |
1572 | ||
1573 | update_dl_migration(&rq->dl); | |
1574 | } | |
1575 | ||
1576 | /* Assumes rq->lock is held */ | |
1577 | static void rq_online_dl(struct rq *rq) | |
1578 | { | |
1579 | if (rq->dl.overloaded) | |
1580 | dl_set_overload(rq); | |
1581 | ||
1582 | if (rq->dl.dl_nr_running > 0) | |
1583 | cpudl_set(&rq->rd->cpudl, rq->cpu, rq->dl.earliest_dl.curr, 1); | |
1584 | } | |
1585 | ||
1586 | /* Assumes rq->lock is held */ | |
1587 | static void rq_offline_dl(struct rq *rq) | |
1588 | { | |
1589 | if (rq->dl.overloaded) | |
1590 | dl_clear_overload(rq); | |
1591 | ||
1592 | cpudl_set(&rq->rd->cpudl, rq->cpu, 0, 0); | |
1593 | } | |
1594 | ||
1595 | void init_sched_dl_class(void) | |
1596 | { | |
1597 | unsigned int i; | |
1598 | ||
1599 | for_each_possible_cpu(i) | |
1600 | zalloc_cpumask_var_node(&per_cpu(local_cpu_mask_dl, i), | |
1601 | GFP_KERNEL, cpu_to_node(i)); | |
1602 | } | |
1603 | ||
1604 | #endif /* CONFIG_SMP */ | |
1605 | ||
1606 | /* | |
1607 | * Ensure p's dl_timer is cancelled. May drop rq->lock for a while. | |
1608 | */ | |
1609 | static void cancel_dl_timer(struct rq *rq, struct task_struct *p) | |
1610 | { | |
1611 | struct hrtimer *dl_timer = &p->dl.dl_timer; | |
1612 | ||
1613 | /* Nobody will change task's class if pi_lock is held */ | |
1614 | lockdep_assert_held(&p->pi_lock); | |
1615 | ||
1616 | if (hrtimer_active(dl_timer)) { | |
1617 | int ret = hrtimer_try_to_cancel(dl_timer); | |
1618 | ||
1619 | if (unlikely(ret == -1)) { | |
1620 | /* | |
1621 | * Note, p may migrate OR new deadline tasks | |
1622 | * may appear in rq when we are unlocking it. | |
1623 | * A caller of us must be fine with that. | |
1624 | */ | |
1625 | raw_spin_unlock(&rq->lock); | |
1626 | hrtimer_cancel(dl_timer); | |
1627 | raw_spin_lock(&rq->lock); | |
1628 | } | |
1629 | } | |
1630 | } | |
1631 | ||
1632 | static void switched_from_dl(struct rq *rq, struct task_struct *p) | |
1633 | { | |
1634 | cancel_dl_timer(rq, p); | |
1635 | ||
1636 | __dl_clear_params(p); | |
1637 | ||
1638 | /* | |
1639 | * Since this might be the only -deadline task on the rq, | |
1640 | * this is the right place to try to pull some other one | |
1641 | * from an overloaded cpu, if any. | |
1642 | */ | |
1643 | if (!task_on_rq_queued(p) || rq->dl.dl_nr_running) | |
1644 | return; | |
1645 | ||
1646 | if (pull_dl_task(rq)) | |
1647 | resched_curr(rq); | |
1648 | } | |
1649 | ||
1650 | /* | |
1651 | * When switching to -deadline, we may overload the rq, then | |
1652 | * we try to push someone off, if possible. | |
1653 | */ | |
1654 | static void switched_to_dl(struct rq *rq, struct task_struct *p) | |
1655 | { | |
1656 | int check_resched = 1; | |
1657 | ||
1658 | /* | |
1659 | * If p is throttled, don't consider the possibility | |
1660 | * of preempting rq->curr, the check will be done right | |
1661 | * after its runtime will get replenished. | |
1662 | */ | |
1663 | if (unlikely(p->dl.dl_throttled)) | |
1664 | return; | |
1665 | ||
1666 | if (task_on_rq_queued(p) && rq->curr != p) { | |
1667 | #ifdef CONFIG_SMP | |
1668 | if (p->nr_cpus_allowed > 1 && rq->dl.overloaded && | |
1669 | push_dl_task(rq) && rq != task_rq(p)) | |
1670 | /* Only reschedule if pushing failed */ | |
1671 | check_resched = 0; | |
1672 | #endif /* CONFIG_SMP */ | |
1673 | if (check_resched) { | |
1674 | if (dl_task(rq->curr)) | |
1675 | check_preempt_curr_dl(rq, p, 0); | |
1676 | else | |
1677 | resched_curr(rq); | |
1678 | } | |
1679 | } | |
1680 | } | |
1681 | ||
1682 | /* | |
1683 | * If the scheduling parameters of a -deadline task changed, | |
1684 | * a push or pull operation might be needed. | |
1685 | */ | |
1686 | static void prio_changed_dl(struct rq *rq, struct task_struct *p, | |
1687 | int oldprio) | |
1688 | { | |
1689 | if (task_on_rq_queued(p) || rq->curr == p) { | |
1690 | #ifdef CONFIG_SMP | |
1691 | /* | |
1692 | * This might be too much, but unfortunately | |
1693 | * we don't have the old deadline value, and | |
1694 | * we can't argue if the task is increasing | |
1695 | * or lowering its prio, so... | |
1696 | */ | |
1697 | if (!rq->dl.overloaded) | |
1698 | pull_dl_task(rq); | |
1699 | ||
1700 | /* | |
1701 | * If we now have a earlier deadline task than p, | |
1702 | * then reschedule, provided p is still on this | |
1703 | * runqueue. | |
1704 | */ | |
1705 | if (dl_time_before(rq->dl.earliest_dl.curr, p->dl.deadline) && | |
1706 | rq->curr == p) | |
1707 | resched_curr(rq); | |
1708 | #else | |
1709 | /* | |
1710 | * Again, we don't know if p has a earlier | |
1711 | * or later deadline, so let's blindly set a | |
1712 | * (maybe not needed) rescheduling point. | |
1713 | */ | |
1714 | resched_curr(rq); | |
1715 | #endif /* CONFIG_SMP */ | |
1716 | } else | |
1717 | switched_to_dl(rq, p); | |
1718 | } | |
1719 | ||
1720 | const struct sched_class dl_sched_class = { | |
1721 | .next = &rt_sched_class, | |
1722 | .enqueue_task = enqueue_task_dl, | |
1723 | .dequeue_task = dequeue_task_dl, | |
1724 | .yield_task = yield_task_dl, | |
1725 | ||
1726 | .check_preempt_curr = check_preempt_curr_dl, | |
1727 | ||
1728 | .pick_next_task = pick_next_task_dl, | |
1729 | .put_prev_task = put_prev_task_dl, | |
1730 | ||
1731 | #ifdef CONFIG_SMP | |
1732 | .select_task_rq = select_task_rq_dl, | |
1733 | .set_cpus_allowed = set_cpus_allowed_dl, | |
1734 | .rq_online = rq_online_dl, | |
1735 | .rq_offline = rq_offline_dl, | |
1736 | .post_schedule = post_schedule_dl, | |
1737 | .task_woken = task_woken_dl, | |
1738 | #endif | |
1739 | ||
1740 | .set_curr_task = set_curr_task_dl, | |
1741 | .task_tick = task_tick_dl, | |
1742 | .task_fork = task_fork_dl, | |
1743 | .task_dead = task_dead_dl, | |
1744 | ||
1745 | .prio_changed = prio_changed_dl, | |
1746 | .switched_from = switched_from_dl, | |
1747 | .switched_to = switched_to_dl, | |
1748 | ||
1749 | .update_curr = update_curr_dl, | |
1750 | }; | |
1751 | ||
1752 | #ifdef CONFIG_SCHED_DEBUG | |
1753 | extern void print_dl_rq(struct seq_file *m, int cpu, struct dl_rq *dl_rq); | |
1754 | ||
1755 | void print_dl_stats(struct seq_file *m, int cpu) | |
1756 | { | |
1757 | print_dl_rq(m, cpu, &cpu_rq(cpu)->dl); | |
1758 | } | |
1759 | #endif /* CONFIG_SCHED_DEBUG */ |