Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1 | /* |
| 2 | * Real-Time Scheduling Class (mapped to the SCHED_FIFO and SCHED_RR |
| 3 | * policies) |
| 4 | */ |
| 5 | |
Peter Zijlstra | 029632f | 2011-10-25 10:00:11 +0200 | [diff] [blame] | 6 | #include "sched.h" |
| 7 | |
| 8 | #include <linux/slab.h> |
| 9 | |
Clark Williams | ce0dbbb | 2013-02-07 09:47:04 -0600 | [diff] [blame] | 10 | int sched_rr_timeslice = RR_TIMESLICE; |
| 11 | |
Peter Zijlstra | 029632f | 2011-10-25 10:00:11 +0200 | [diff] [blame] | 12 | static int do_sched_rt_period_timer(struct rt_bandwidth *rt_b, int overrun); |
| 13 | |
| 14 | struct rt_bandwidth def_rt_bandwidth; |
| 15 | |
| 16 | static enum hrtimer_restart sched_rt_period_timer(struct hrtimer *timer) |
| 17 | { |
| 18 | struct rt_bandwidth *rt_b = |
| 19 | container_of(timer, struct rt_bandwidth, rt_period_timer); |
| 20 | ktime_t now; |
| 21 | int overrun; |
| 22 | int idle = 0; |
| 23 | |
| 24 | for (;;) { |
| 25 | now = hrtimer_cb_get_time(timer); |
| 26 | overrun = hrtimer_forward(timer, now, rt_b->rt_period); |
| 27 | |
| 28 | if (!overrun) |
| 29 | break; |
| 30 | |
| 31 | idle = do_sched_rt_period_timer(rt_b, overrun); |
| 32 | } |
| 33 | |
| 34 | return idle ? HRTIMER_NORESTART : HRTIMER_RESTART; |
| 35 | } |
| 36 | |
| 37 | void init_rt_bandwidth(struct rt_bandwidth *rt_b, u64 period, u64 runtime) |
| 38 | { |
| 39 | rt_b->rt_period = ns_to_ktime(period); |
| 40 | rt_b->rt_runtime = runtime; |
| 41 | |
| 42 | raw_spin_lock_init(&rt_b->rt_runtime_lock); |
| 43 | |
| 44 | hrtimer_init(&rt_b->rt_period_timer, |
| 45 | CLOCK_MONOTONIC, HRTIMER_MODE_REL); |
| 46 | rt_b->rt_period_timer.function = sched_rt_period_timer; |
| 47 | } |
| 48 | |
| 49 | static void start_rt_bandwidth(struct rt_bandwidth *rt_b) |
| 50 | { |
| 51 | if (!rt_bandwidth_enabled() || rt_b->rt_runtime == RUNTIME_INF) |
| 52 | return; |
| 53 | |
| 54 | if (hrtimer_active(&rt_b->rt_period_timer)) |
| 55 | return; |
| 56 | |
| 57 | raw_spin_lock(&rt_b->rt_runtime_lock); |
| 58 | start_bandwidth_timer(&rt_b->rt_period_timer, rt_b->rt_period); |
| 59 | raw_spin_unlock(&rt_b->rt_runtime_lock); |
| 60 | } |
| 61 | |
| 62 | void init_rt_rq(struct rt_rq *rt_rq, struct rq *rq) |
| 63 | { |
| 64 | struct rt_prio_array *array; |
| 65 | int i; |
| 66 | |
| 67 | array = &rt_rq->active; |
| 68 | for (i = 0; i < MAX_RT_PRIO; i++) { |
| 69 | INIT_LIST_HEAD(array->queue + i); |
| 70 | __clear_bit(i, array->bitmap); |
| 71 | } |
| 72 | /* delimiter for bitsearch: */ |
| 73 | __set_bit(MAX_RT_PRIO, array->bitmap); |
| 74 | |
| 75 | #if defined CONFIG_SMP |
| 76 | rt_rq->highest_prio.curr = MAX_RT_PRIO; |
| 77 | rt_rq->highest_prio.next = MAX_RT_PRIO; |
| 78 | rt_rq->rt_nr_migratory = 0; |
| 79 | rt_rq->overloaded = 0; |
| 80 | plist_head_init(&rt_rq->pushable_tasks); |
| 81 | #endif |
| 82 | |
| 83 | rt_rq->rt_time = 0; |
| 84 | rt_rq->rt_throttled = 0; |
| 85 | rt_rq->rt_runtime = 0; |
| 86 | raw_spin_lock_init(&rt_rq->rt_runtime_lock); |
| 87 | } |
| 88 | |
Gregory Haskins | 398a153 | 2009-01-14 09:10:04 -0500 | [diff] [blame] | 89 | #ifdef CONFIG_RT_GROUP_SCHED |
Peter Zijlstra | 029632f | 2011-10-25 10:00:11 +0200 | [diff] [blame] | 90 | static void destroy_rt_bandwidth(struct rt_bandwidth *rt_b) |
| 91 | { |
| 92 | hrtimer_cancel(&rt_b->rt_period_timer); |
| 93 | } |
Gregory Haskins | 398a153 | 2009-01-14 09:10:04 -0500 | [diff] [blame] | 94 | |
Peter Zijlstra | a1ba4d8 | 2009-04-01 18:40:15 +0200 | [diff] [blame] | 95 | #define rt_entity_is_task(rt_se) (!(rt_se)->my_q) |
| 96 | |
Peter Zijlstra | 8f48894 | 2009-07-24 12:25:30 +0200 | [diff] [blame] | 97 | static inline struct task_struct *rt_task_of(struct sched_rt_entity *rt_se) |
| 98 | { |
| 99 | #ifdef CONFIG_SCHED_DEBUG |
| 100 | WARN_ON_ONCE(!rt_entity_is_task(rt_se)); |
| 101 | #endif |
| 102 | return container_of(rt_se, struct task_struct, rt); |
| 103 | } |
| 104 | |
Gregory Haskins | 398a153 | 2009-01-14 09:10:04 -0500 | [diff] [blame] | 105 | static inline struct rq *rq_of_rt_rq(struct rt_rq *rt_rq) |
| 106 | { |
| 107 | return rt_rq->rq; |
| 108 | } |
| 109 | |
| 110 | static inline struct rt_rq *rt_rq_of_se(struct sched_rt_entity *rt_se) |
| 111 | { |
| 112 | return rt_se->rt_rq; |
| 113 | } |
| 114 | |
Peter Zijlstra | 029632f | 2011-10-25 10:00:11 +0200 | [diff] [blame] | 115 | void free_rt_sched_group(struct task_group *tg) |
| 116 | { |
| 117 | int i; |
| 118 | |
| 119 | if (tg->rt_se) |
| 120 | destroy_rt_bandwidth(&tg->rt_bandwidth); |
| 121 | |
| 122 | for_each_possible_cpu(i) { |
| 123 | if (tg->rt_rq) |
| 124 | kfree(tg->rt_rq[i]); |
| 125 | if (tg->rt_se) |
| 126 | kfree(tg->rt_se[i]); |
| 127 | } |
| 128 | |
| 129 | kfree(tg->rt_rq); |
| 130 | kfree(tg->rt_se); |
| 131 | } |
| 132 | |
| 133 | void init_tg_rt_entry(struct task_group *tg, struct rt_rq *rt_rq, |
| 134 | struct sched_rt_entity *rt_se, int cpu, |
| 135 | struct sched_rt_entity *parent) |
| 136 | { |
| 137 | struct rq *rq = cpu_rq(cpu); |
| 138 | |
| 139 | rt_rq->highest_prio.curr = MAX_RT_PRIO; |
| 140 | rt_rq->rt_nr_boosted = 0; |
| 141 | rt_rq->rq = rq; |
| 142 | rt_rq->tg = tg; |
| 143 | |
| 144 | tg->rt_rq[cpu] = rt_rq; |
| 145 | tg->rt_se[cpu] = rt_se; |
| 146 | |
| 147 | if (!rt_se) |
| 148 | return; |
| 149 | |
| 150 | if (!parent) |
| 151 | rt_se->rt_rq = &rq->rt; |
| 152 | else |
| 153 | rt_se->rt_rq = parent->my_q; |
| 154 | |
| 155 | rt_se->my_q = rt_rq; |
| 156 | rt_se->parent = parent; |
| 157 | INIT_LIST_HEAD(&rt_se->run_list); |
| 158 | } |
| 159 | |
| 160 | int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent) |
| 161 | { |
| 162 | struct rt_rq *rt_rq; |
| 163 | struct sched_rt_entity *rt_se; |
| 164 | int i; |
| 165 | |
| 166 | tg->rt_rq = kzalloc(sizeof(rt_rq) * nr_cpu_ids, GFP_KERNEL); |
| 167 | if (!tg->rt_rq) |
| 168 | goto err; |
| 169 | tg->rt_se = kzalloc(sizeof(rt_se) * nr_cpu_ids, GFP_KERNEL); |
| 170 | if (!tg->rt_se) |
| 171 | goto err; |
| 172 | |
| 173 | init_rt_bandwidth(&tg->rt_bandwidth, |
| 174 | ktime_to_ns(def_rt_bandwidth.rt_period), 0); |
| 175 | |
| 176 | for_each_possible_cpu(i) { |
| 177 | rt_rq = kzalloc_node(sizeof(struct rt_rq), |
| 178 | GFP_KERNEL, cpu_to_node(i)); |
| 179 | if (!rt_rq) |
| 180 | goto err; |
| 181 | |
| 182 | rt_se = kzalloc_node(sizeof(struct sched_rt_entity), |
| 183 | GFP_KERNEL, cpu_to_node(i)); |
| 184 | if (!rt_se) |
| 185 | goto err_free_rq; |
| 186 | |
| 187 | init_rt_rq(rt_rq, cpu_rq(i)); |
| 188 | rt_rq->rt_runtime = tg->rt_bandwidth.rt_runtime; |
| 189 | init_tg_rt_entry(tg, rt_rq, rt_se, i, parent->rt_se[i]); |
| 190 | } |
| 191 | |
| 192 | return 1; |
| 193 | |
| 194 | err_free_rq: |
| 195 | kfree(rt_rq); |
| 196 | err: |
| 197 | return 0; |
| 198 | } |
| 199 | |
Gregory Haskins | 398a153 | 2009-01-14 09:10:04 -0500 | [diff] [blame] | 200 | #else /* CONFIG_RT_GROUP_SCHED */ |
| 201 | |
Peter Zijlstra | a1ba4d8 | 2009-04-01 18:40:15 +0200 | [diff] [blame] | 202 | #define rt_entity_is_task(rt_se) (1) |
| 203 | |
Peter Zijlstra | 8f48894 | 2009-07-24 12:25:30 +0200 | [diff] [blame] | 204 | static inline struct task_struct *rt_task_of(struct sched_rt_entity *rt_se) |
| 205 | { |
| 206 | return container_of(rt_se, struct task_struct, rt); |
| 207 | } |
| 208 | |
Gregory Haskins | 398a153 | 2009-01-14 09:10:04 -0500 | [diff] [blame] | 209 | static inline struct rq *rq_of_rt_rq(struct rt_rq *rt_rq) |
| 210 | { |
| 211 | return container_of(rt_rq, struct rq, rt); |
| 212 | } |
| 213 | |
| 214 | static inline struct rt_rq *rt_rq_of_se(struct sched_rt_entity *rt_se) |
| 215 | { |
| 216 | struct task_struct *p = rt_task_of(rt_se); |
| 217 | struct rq *rq = task_rq(p); |
| 218 | |
| 219 | return &rq->rt; |
| 220 | } |
| 221 | |
Peter Zijlstra | 029632f | 2011-10-25 10:00:11 +0200 | [diff] [blame] | 222 | void free_rt_sched_group(struct task_group *tg) { } |
| 223 | |
| 224 | int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent) |
| 225 | { |
| 226 | return 1; |
| 227 | } |
Gregory Haskins | 398a153 | 2009-01-14 09:10:04 -0500 | [diff] [blame] | 228 | #endif /* CONFIG_RT_GROUP_SCHED */ |
| 229 | |
Steven Rostedt | 4fd2917 | 2008-01-25 21:08:06 +0100 | [diff] [blame] | 230 | #ifdef CONFIG_SMP |
Ingo Molnar | 84de427 | 2008-01-25 21:08:15 +0100 | [diff] [blame] | 231 | |
Peter Zijlstra | 38033c3 | 2014-01-23 20:32:21 +0100 | [diff] [blame] | 232 | static int pull_rt_task(struct rq *this_rq); |
| 233 | |
Peter Zijlstra | dc87734 | 2014-02-12 15:47:29 +0100 | [diff] [blame] | 234 | static inline bool need_pull_rt_task(struct rq *rq, struct task_struct *prev) |
| 235 | { |
| 236 | /* Try to pull RT tasks here if we lower this rq's prio */ |
| 237 | return rq->rt.highest_prio.curr > prev->prio; |
| 238 | } |
| 239 | |
Gregory Haskins | 637f508 | 2008-01-25 21:08:18 +0100 | [diff] [blame] | 240 | static inline int rt_overloaded(struct rq *rq) |
Steven Rostedt | 4fd2917 | 2008-01-25 21:08:06 +0100 | [diff] [blame] | 241 | { |
Gregory Haskins | 637f508 | 2008-01-25 21:08:18 +0100 | [diff] [blame] | 242 | return atomic_read(&rq->rd->rto_count); |
Steven Rostedt | 4fd2917 | 2008-01-25 21:08:06 +0100 | [diff] [blame] | 243 | } |
Ingo Molnar | 84de427 | 2008-01-25 21:08:15 +0100 | [diff] [blame] | 244 | |
Steven Rostedt | 4fd2917 | 2008-01-25 21:08:06 +0100 | [diff] [blame] | 245 | static inline void rt_set_overload(struct rq *rq) |
| 246 | { |
Gregory Haskins | 1f11eb6 | 2008-06-04 15:04:05 -0400 | [diff] [blame] | 247 | if (!rq->online) |
| 248 | return; |
| 249 | |
Rusty Russell | c6c4927 | 2008-11-25 02:35:05 +1030 | [diff] [blame] | 250 | cpumask_set_cpu(rq->cpu, rq->rd->rto_mask); |
Steven Rostedt | 4fd2917 | 2008-01-25 21:08:06 +0100 | [diff] [blame] | 251 | /* |
| 252 | * Make sure the mask is visible before we set |
| 253 | * the overload count. That is checked to determine |
| 254 | * if we should look at the mask. It would be a shame |
| 255 | * if we looked at the mask, but the mask was not |
| 256 | * updated yet. |
Peter Zijlstra | 7c3f2ab | 2013-10-15 12:35:07 +0200 | [diff] [blame] | 257 | * |
| 258 | * Matched by the barrier in pull_rt_task(). |
Steven Rostedt | 4fd2917 | 2008-01-25 21:08:06 +0100 | [diff] [blame] | 259 | */ |
Peter Zijlstra | 7c3f2ab | 2013-10-15 12:35:07 +0200 | [diff] [blame] | 260 | smp_wmb(); |
Gregory Haskins | 637f508 | 2008-01-25 21:08:18 +0100 | [diff] [blame] | 261 | atomic_inc(&rq->rd->rto_count); |
Steven Rostedt | 4fd2917 | 2008-01-25 21:08:06 +0100 | [diff] [blame] | 262 | } |
Ingo Molnar | 84de427 | 2008-01-25 21:08:15 +0100 | [diff] [blame] | 263 | |
Steven Rostedt | 4fd2917 | 2008-01-25 21:08:06 +0100 | [diff] [blame] | 264 | static inline void rt_clear_overload(struct rq *rq) |
| 265 | { |
Gregory Haskins | 1f11eb6 | 2008-06-04 15:04:05 -0400 | [diff] [blame] | 266 | if (!rq->online) |
| 267 | return; |
| 268 | |
Steven Rostedt | 4fd2917 | 2008-01-25 21:08:06 +0100 | [diff] [blame] | 269 | /* the order here really doesn't matter */ |
Gregory Haskins | 637f508 | 2008-01-25 21:08:18 +0100 | [diff] [blame] | 270 | atomic_dec(&rq->rd->rto_count); |
Rusty Russell | c6c4927 | 2008-11-25 02:35:05 +1030 | [diff] [blame] | 271 | cpumask_clear_cpu(rq->cpu, rq->rd->rto_mask); |
Steven Rostedt | 4fd2917 | 2008-01-25 21:08:06 +0100 | [diff] [blame] | 272 | } |
Gregory Haskins | 73fe6aa | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 273 | |
Gregory Haskins | 398a153 | 2009-01-14 09:10:04 -0500 | [diff] [blame] | 274 | static void update_rt_migration(struct rt_rq *rt_rq) |
Gregory Haskins | 73fe6aa | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 275 | { |
Peter Zijlstra | a1ba4d8 | 2009-04-01 18:40:15 +0200 | [diff] [blame] | 276 | if (rt_rq->rt_nr_migratory && rt_rq->rt_nr_total > 1) { |
Gregory Haskins | 398a153 | 2009-01-14 09:10:04 -0500 | [diff] [blame] | 277 | if (!rt_rq->overloaded) { |
| 278 | rt_set_overload(rq_of_rt_rq(rt_rq)); |
| 279 | rt_rq->overloaded = 1; |
Gregory Haskins | cdc8eb9 | 2008-01-25 21:08:23 +0100 | [diff] [blame] | 280 | } |
Gregory Haskins | 398a153 | 2009-01-14 09:10:04 -0500 | [diff] [blame] | 281 | } else if (rt_rq->overloaded) { |
| 282 | rt_clear_overload(rq_of_rt_rq(rt_rq)); |
| 283 | rt_rq->overloaded = 0; |
Gregory Haskins | 637f508 | 2008-01-25 21:08:18 +0100 | [diff] [blame] | 284 | } |
Gregory Haskins | 73fe6aa | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 285 | } |
Steven Rostedt | 4fd2917 | 2008-01-25 21:08:06 +0100 | [diff] [blame] | 286 | |
Gregory Haskins | 398a153 | 2009-01-14 09:10:04 -0500 | [diff] [blame] | 287 | static void inc_rt_migration(struct sched_rt_entity *rt_se, struct rt_rq *rt_rq) |
Peter Zijlstra | fa85ae2 | 2008-01-25 21:08:29 +0100 | [diff] [blame] | 288 | { |
Peter Zijlstra | 29baa74 | 2012-04-23 12:11:21 +0200 | [diff] [blame] | 289 | struct task_struct *p; |
| 290 | |
Peter Zijlstra | a1ba4d8 | 2009-04-01 18:40:15 +0200 | [diff] [blame] | 291 | if (!rt_entity_is_task(rt_se)) |
| 292 | return; |
| 293 | |
Peter Zijlstra | 29baa74 | 2012-04-23 12:11:21 +0200 | [diff] [blame] | 294 | p = rt_task_of(rt_se); |
Peter Zijlstra | a1ba4d8 | 2009-04-01 18:40:15 +0200 | [diff] [blame] | 295 | rt_rq = &rq_of_rt_rq(rt_rq)->rt; |
| 296 | |
| 297 | rt_rq->rt_nr_total++; |
Peter Zijlstra | 29baa74 | 2012-04-23 12:11:21 +0200 | [diff] [blame] | 298 | if (p->nr_cpus_allowed > 1) |
Gregory Haskins | 398a153 | 2009-01-14 09:10:04 -0500 | [diff] [blame] | 299 | rt_rq->rt_nr_migratory++; |
| 300 | |
| 301 | update_rt_migration(rt_rq); |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 302 | } |
| 303 | |
Gregory Haskins | 398a153 | 2009-01-14 09:10:04 -0500 | [diff] [blame] | 304 | static void dec_rt_migration(struct sched_rt_entity *rt_se, struct rt_rq *rt_rq) |
| 305 | { |
Peter Zijlstra | 29baa74 | 2012-04-23 12:11:21 +0200 | [diff] [blame] | 306 | struct task_struct *p; |
| 307 | |
Peter Zijlstra | a1ba4d8 | 2009-04-01 18:40:15 +0200 | [diff] [blame] | 308 | if (!rt_entity_is_task(rt_se)) |
| 309 | return; |
| 310 | |
Peter Zijlstra | 29baa74 | 2012-04-23 12:11:21 +0200 | [diff] [blame] | 311 | p = rt_task_of(rt_se); |
Peter Zijlstra | a1ba4d8 | 2009-04-01 18:40:15 +0200 | [diff] [blame] | 312 | rt_rq = &rq_of_rt_rq(rt_rq)->rt; |
| 313 | |
| 314 | rt_rq->rt_nr_total--; |
Peter Zijlstra | 29baa74 | 2012-04-23 12:11:21 +0200 | [diff] [blame] | 315 | if (p->nr_cpus_allowed > 1) |
Gregory Haskins | 398a153 | 2009-01-14 09:10:04 -0500 | [diff] [blame] | 316 | rt_rq->rt_nr_migratory--; |
| 317 | |
| 318 | update_rt_migration(rt_rq); |
| 319 | } |
| 320 | |
Steven Rostedt | 5181f4a4 | 2011-06-16 21:55:23 -0400 | [diff] [blame] | 321 | static inline int has_pushable_tasks(struct rq *rq) |
| 322 | { |
| 323 | return !plist_head_empty(&rq->rt.pushable_tasks); |
| 324 | } |
| 325 | |
Peter Zijlstra | dc87734 | 2014-02-12 15:47:29 +0100 | [diff] [blame] | 326 | static inline void set_post_schedule(struct rq *rq) |
| 327 | { |
| 328 | /* |
| 329 | * We detect this state here so that we can avoid taking the RQ |
| 330 | * lock again later if there is no need to push |
| 331 | */ |
| 332 | rq->post_schedule = has_pushable_tasks(rq); |
| 333 | } |
| 334 | |
Gregory Haskins | 917b627 | 2008-12-29 09:39:53 -0500 | [diff] [blame] | 335 | static void enqueue_pushable_task(struct rq *rq, struct task_struct *p) |
| 336 | { |
| 337 | plist_del(&p->pushable_tasks, &rq->rt.pushable_tasks); |
| 338 | plist_node_init(&p->pushable_tasks, p->prio); |
| 339 | plist_add(&p->pushable_tasks, &rq->rt.pushable_tasks); |
Steven Rostedt | 5181f4a4 | 2011-06-16 21:55:23 -0400 | [diff] [blame] | 340 | |
| 341 | /* Update the highest prio pushable task */ |
| 342 | if (p->prio < rq->rt.highest_prio.next) |
| 343 | rq->rt.highest_prio.next = p->prio; |
Gregory Haskins | 917b627 | 2008-12-29 09:39:53 -0500 | [diff] [blame] | 344 | } |
| 345 | |
| 346 | static void dequeue_pushable_task(struct rq *rq, struct task_struct *p) |
| 347 | { |
| 348 | plist_del(&p->pushable_tasks, &rq->rt.pushable_tasks); |
Gregory Haskins | 917b627 | 2008-12-29 09:39:53 -0500 | [diff] [blame] | 349 | |
Steven Rostedt | 5181f4a4 | 2011-06-16 21:55:23 -0400 | [diff] [blame] | 350 | /* Update the new highest prio pushable task */ |
| 351 | if (has_pushable_tasks(rq)) { |
| 352 | p = plist_first_entry(&rq->rt.pushable_tasks, |
| 353 | struct task_struct, pushable_tasks); |
| 354 | rq->rt.highest_prio.next = p->prio; |
| 355 | } else |
| 356 | rq->rt.highest_prio.next = MAX_RT_PRIO; |
Ingo Molnar | bcf08df | 2008-04-19 12:11:10 +0200 | [diff] [blame] | 357 | } |
| 358 | |
Gregory Haskins | 917b627 | 2008-12-29 09:39:53 -0500 | [diff] [blame] | 359 | #else |
| 360 | |
Peter Zijlstra | ceacc2c | 2009-01-16 14:46:40 +0100 | [diff] [blame] | 361 | static inline void enqueue_pushable_task(struct rq *rq, struct task_struct *p) |
| 362 | { |
| 363 | } |
| 364 | |
| 365 | static inline void dequeue_pushable_task(struct rq *rq, struct task_struct *p) |
| 366 | { |
| 367 | } |
| 368 | |
Gregory Haskins | b07430a | 2009-01-14 08:55:39 -0500 | [diff] [blame] | 369 | static inline |
Peter Zijlstra | ceacc2c | 2009-01-16 14:46:40 +0100 | [diff] [blame] | 370 | void inc_rt_migration(struct sched_rt_entity *rt_se, struct rt_rq *rt_rq) |
| 371 | { |
| 372 | } |
| 373 | |
Gregory Haskins | b07430a | 2009-01-14 08:55:39 -0500 | [diff] [blame] | 374 | static inline |
Peter Zijlstra | ceacc2c | 2009-01-16 14:46:40 +0100 | [diff] [blame] | 375 | void dec_rt_migration(struct sched_rt_entity *rt_se, struct rt_rq *rt_rq) |
| 376 | { |
| 377 | } |
Gregory Haskins | 917b627 | 2008-12-29 09:39:53 -0500 | [diff] [blame] | 378 | |
Peter Zijlstra | dc87734 | 2014-02-12 15:47:29 +0100 | [diff] [blame] | 379 | static inline bool need_pull_rt_task(struct rq *rq, struct task_struct *prev) |
| 380 | { |
| 381 | return false; |
| 382 | } |
| 383 | |
| 384 | static inline int pull_rt_task(struct rq *this_rq) |
| 385 | { |
| 386 | return 0; |
| 387 | } |
| 388 | |
| 389 | static inline void set_post_schedule(struct rq *rq) |
| 390 | { |
| 391 | } |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 392 | #endif /* CONFIG_SMP */ |
| 393 | |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 394 | static inline int on_rt_rq(struct sched_rt_entity *rt_se) |
| 395 | { |
| 396 | return !list_empty(&rt_se->run_list); |
| 397 | } |
| 398 | |
Peter Zijlstra | 052f1dc | 2008-02-13 15:45:40 +0100 | [diff] [blame] | 399 | #ifdef CONFIG_RT_GROUP_SCHED |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 400 | |
Peter Zijlstra | 9f0c1e5 | 2008-02-13 15:45:39 +0100 | [diff] [blame] | 401 | static inline u64 sched_rt_runtime(struct rt_rq *rt_rq) |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 402 | { |
| 403 | if (!rt_rq->tg) |
Peter Zijlstra | 9f0c1e5 | 2008-02-13 15:45:39 +0100 | [diff] [blame] | 404 | return RUNTIME_INF; |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 405 | |
Peter Zijlstra | ac086bc | 2008-04-19 19:44:58 +0200 | [diff] [blame] | 406 | return rt_rq->rt_runtime; |
| 407 | } |
| 408 | |
| 409 | static inline u64 sched_rt_period(struct rt_rq *rt_rq) |
| 410 | { |
| 411 | return ktime_to_ns(rt_rq->tg->rt_bandwidth.rt_period); |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 412 | } |
| 413 | |
Cheng Xu | ec514c4 | 2011-05-14 14:20:02 +0800 | [diff] [blame] | 414 | typedef struct task_group *rt_rq_iter_t; |
| 415 | |
Yong Zhang | 1c09ab0 | 2011-06-28 10:51:31 +0800 | [diff] [blame] | 416 | static inline struct task_group *next_task_group(struct task_group *tg) |
| 417 | { |
| 418 | do { |
| 419 | tg = list_entry_rcu(tg->list.next, |
| 420 | typeof(struct task_group), list); |
| 421 | } while (&tg->list != &task_groups && task_group_is_autogroup(tg)); |
| 422 | |
| 423 | if (&tg->list == &task_groups) |
| 424 | tg = NULL; |
| 425 | |
| 426 | return tg; |
| 427 | } |
| 428 | |
| 429 | #define for_each_rt_rq(rt_rq, iter, rq) \ |
| 430 | for (iter = container_of(&task_groups, typeof(*iter), list); \ |
| 431 | (iter = next_task_group(iter)) && \ |
| 432 | (rt_rq = iter->rt_rq[cpu_of(rq)]);) |
Cheng Xu | ec514c4 | 2011-05-14 14:20:02 +0800 | [diff] [blame] | 433 | |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 434 | #define for_each_sched_rt_entity(rt_se) \ |
| 435 | for (; rt_se; rt_se = rt_se->parent) |
| 436 | |
| 437 | static inline struct rt_rq *group_rt_rq(struct sched_rt_entity *rt_se) |
| 438 | { |
| 439 | return rt_se->my_q; |
| 440 | } |
| 441 | |
Thomas Gleixner | 37dad3f | 2010-01-20 20:59:01 +0000 | [diff] [blame] | 442 | static void enqueue_rt_entity(struct sched_rt_entity *rt_se, bool head); |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 443 | static void dequeue_rt_entity(struct sched_rt_entity *rt_se); |
| 444 | |
Peter Zijlstra | 9f0c1e5 | 2008-02-13 15:45:39 +0100 | [diff] [blame] | 445 | static void sched_rt_rq_enqueue(struct rt_rq *rt_rq) |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 446 | { |
Dario Faggioli | f6121f4 | 2008-10-03 17:40:46 +0200 | [diff] [blame] | 447 | struct task_struct *curr = rq_of_rt_rq(rt_rq)->curr; |
Yong Zhang | 74b7eb5 | 2010-01-29 14:57:52 +0800 | [diff] [blame] | 448 | struct sched_rt_entity *rt_se; |
| 449 | |
Balbir Singh | 0c3b916 | 2011-03-03 17:04:35 +0530 | [diff] [blame] | 450 | int cpu = cpu_of(rq_of_rt_rq(rt_rq)); |
| 451 | |
| 452 | rt_se = rt_rq->tg->rt_se[cpu]; |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 453 | |
Dario Faggioli | f6121f4 | 2008-10-03 17:40:46 +0200 | [diff] [blame] | 454 | if (rt_rq->rt_nr_running) { |
| 455 | if (rt_se && !on_rt_rq(rt_se)) |
Thomas Gleixner | 37dad3f | 2010-01-20 20:59:01 +0000 | [diff] [blame] | 456 | enqueue_rt_entity(rt_se, false); |
Gregory Haskins | e864c49 | 2008-12-29 09:39:49 -0500 | [diff] [blame] | 457 | if (rt_rq->highest_prio.curr < curr->prio) |
Peter Zijlstra | 1020387 | 2008-01-25 21:08:32 +0100 | [diff] [blame] | 458 | resched_task(curr); |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 459 | } |
| 460 | } |
| 461 | |
Peter Zijlstra | 9f0c1e5 | 2008-02-13 15:45:39 +0100 | [diff] [blame] | 462 | static void sched_rt_rq_dequeue(struct rt_rq *rt_rq) |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 463 | { |
Yong Zhang | 74b7eb5 | 2010-01-29 14:57:52 +0800 | [diff] [blame] | 464 | struct sched_rt_entity *rt_se; |
Balbir Singh | 0c3b916 | 2011-03-03 17:04:35 +0530 | [diff] [blame] | 465 | int cpu = cpu_of(rq_of_rt_rq(rt_rq)); |
Yong Zhang | 74b7eb5 | 2010-01-29 14:57:52 +0800 | [diff] [blame] | 466 | |
Balbir Singh | 0c3b916 | 2011-03-03 17:04:35 +0530 | [diff] [blame] | 467 | rt_se = rt_rq->tg->rt_se[cpu]; |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 468 | |
| 469 | if (rt_se && on_rt_rq(rt_se)) |
| 470 | dequeue_rt_entity(rt_se); |
| 471 | } |
| 472 | |
Peter Zijlstra | 23b0fdf | 2008-02-13 15:45:39 +0100 | [diff] [blame] | 473 | static int rt_se_boosted(struct sched_rt_entity *rt_se) |
| 474 | { |
| 475 | struct rt_rq *rt_rq = group_rt_rq(rt_se); |
| 476 | struct task_struct *p; |
| 477 | |
| 478 | if (rt_rq) |
| 479 | return !!rt_rq->rt_nr_boosted; |
| 480 | |
| 481 | p = rt_task_of(rt_se); |
| 482 | return p->prio != p->normal_prio; |
| 483 | } |
| 484 | |
Peter Zijlstra | d0b27fa | 2008-04-19 19:44:57 +0200 | [diff] [blame] | 485 | #ifdef CONFIG_SMP |
Rusty Russell | c6c4927 | 2008-11-25 02:35:05 +1030 | [diff] [blame] | 486 | static inline const struct cpumask *sched_rt_period_mask(void) |
Peter Zijlstra | d0b27fa | 2008-04-19 19:44:57 +0200 | [diff] [blame] | 487 | { |
Nathan Zimmer | 424c93f | 2013-05-09 11:24:03 -0500 | [diff] [blame] | 488 | return this_rq()->rd->span; |
Peter Zijlstra | d0b27fa | 2008-04-19 19:44:57 +0200 | [diff] [blame] | 489 | } |
| 490 | #else |
Rusty Russell | c6c4927 | 2008-11-25 02:35:05 +1030 | [diff] [blame] | 491 | static inline const struct cpumask *sched_rt_period_mask(void) |
Peter Zijlstra | d0b27fa | 2008-04-19 19:44:57 +0200 | [diff] [blame] | 492 | { |
Rusty Russell | c6c4927 | 2008-11-25 02:35:05 +1030 | [diff] [blame] | 493 | return cpu_online_mask; |
Peter Zijlstra | d0b27fa | 2008-04-19 19:44:57 +0200 | [diff] [blame] | 494 | } |
| 495 | #endif |
| 496 | |
| 497 | static inline |
| 498 | struct rt_rq *sched_rt_period_rt_rq(struct rt_bandwidth *rt_b, int cpu) |
| 499 | { |
| 500 | return container_of(rt_b, struct task_group, rt_bandwidth)->rt_rq[cpu]; |
| 501 | } |
| 502 | |
Peter Zijlstra | ac086bc | 2008-04-19 19:44:58 +0200 | [diff] [blame] | 503 | static inline struct rt_bandwidth *sched_rt_bandwidth(struct rt_rq *rt_rq) |
| 504 | { |
| 505 | return &rt_rq->tg->rt_bandwidth; |
| 506 | } |
| 507 | |
Dhaval Giani | 55e12e5 | 2008-06-24 23:39:43 +0530 | [diff] [blame] | 508 | #else /* !CONFIG_RT_GROUP_SCHED */ |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 509 | |
Peter Zijlstra | 9f0c1e5 | 2008-02-13 15:45:39 +0100 | [diff] [blame] | 510 | static inline u64 sched_rt_runtime(struct rt_rq *rt_rq) |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 511 | { |
Peter Zijlstra | ac086bc | 2008-04-19 19:44:58 +0200 | [diff] [blame] | 512 | return rt_rq->rt_runtime; |
| 513 | } |
| 514 | |
| 515 | static inline u64 sched_rt_period(struct rt_rq *rt_rq) |
| 516 | { |
| 517 | return ktime_to_ns(def_rt_bandwidth.rt_period); |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 518 | } |
| 519 | |
Cheng Xu | ec514c4 | 2011-05-14 14:20:02 +0800 | [diff] [blame] | 520 | typedef struct rt_rq *rt_rq_iter_t; |
| 521 | |
| 522 | #define for_each_rt_rq(rt_rq, iter, rq) \ |
| 523 | for ((void) iter, rt_rq = &rq->rt; rt_rq; rt_rq = NULL) |
| 524 | |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 525 | #define for_each_sched_rt_entity(rt_se) \ |
| 526 | for (; rt_se; rt_se = NULL) |
| 527 | |
| 528 | static inline struct rt_rq *group_rt_rq(struct sched_rt_entity *rt_se) |
| 529 | { |
| 530 | return NULL; |
| 531 | } |
| 532 | |
Peter Zijlstra | 9f0c1e5 | 2008-02-13 15:45:39 +0100 | [diff] [blame] | 533 | static inline void sched_rt_rq_enqueue(struct rt_rq *rt_rq) |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 534 | { |
John Blackwood | f3ade83 | 2008-08-26 15:09:43 -0400 | [diff] [blame] | 535 | if (rt_rq->rt_nr_running) |
| 536 | resched_task(rq_of_rt_rq(rt_rq)->curr); |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 537 | } |
| 538 | |
Peter Zijlstra | 9f0c1e5 | 2008-02-13 15:45:39 +0100 | [diff] [blame] | 539 | static inline void sched_rt_rq_dequeue(struct rt_rq *rt_rq) |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 540 | { |
| 541 | } |
| 542 | |
Rusty Russell | c6c4927 | 2008-11-25 02:35:05 +1030 | [diff] [blame] | 543 | static inline const struct cpumask *sched_rt_period_mask(void) |
Peter Zijlstra | d0b27fa | 2008-04-19 19:44:57 +0200 | [diff] [blame] | 544 | { |
Rusty Russell | c6c4927 | 2008-11-25 02:35:05 +1030 | [diff] [blame] | 545 | return cpu_online_mask; |
Peter Zijlstra | d0b27fa | 2008-04-19 19:44:57 +0200 | [diff] [blame] | 546 | } |
| 547 | |
| 548 | static inline |
| 549 | struct rt_rq *sched_rt_period_rt_rq(struct rt_bandwidth *rt_b, int cpu) |
| 550 | { |
| 551 | return &cpu_rq(cpu)->rt; |
| 552 | } |
| 553 | |
Peter Zijlstra | ac086bc | 2008-04-19 19:44:58 +0200 | [diff] [blame] | 554 | static inline struct rt_bandwidth *sched_rt_bandwidth(struct rt_rq *rt_rq) |
| 555 | { |
| 556 | return &def_rt_bandwidth; |
| 557 | } |
| 558 | |
Dhaval Giani | 55e12e5 | 2008-06-24 23:39:43 +0530 | [diff] [blame] | 559 | #endif /* CONFIG_RT_GROUP_SCHED */ |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 560 | |
Juri Lelli | faa5993 | 2014-02-21 11:37:15 +0100 | [diff] [blame] | 561 | bool sched_rt_bandwidth_account(struct rt_rq *rt_rq) |
| 562 | { |
| 563 | struct rt_bandwidth *rt_b = sched_rt_bandwidth(rt_rq); |
| 564 | |
| 565 | return (hrtimer_active(&rt_b->rt_period_timer) || |
| 566 | rt_rq->rt_time < rt_b->rt_runtime); |
| 567 | } |
| 568 | |
Peter Zijlstra | b79f383 | 2008-06-19 14:22:25 +0200 | [diff] [blame] | 569 | #ifdef CONFIG_SMP |
Peter Zijlstra | 78333cd | 2008-09-23 15:33:43 +0200 | [diff] [blame] | 570 | /* |
| 571 | * We ran out of runtime, see if we can borrow some from our neighbours. |
| 572 | */ |
Peter Zijlstra | b79f383 | 2008-06-19 14:22:25 +0200 | [diff] [blame] | 573 | static int do_balance_runtime(struct rt_rq *rt_rq) |
Peter Zijlstra | ac086bc | 2008-04-19 19:44:58 +0200 | [diff] [blame] | 574 | { |
| 575 | struct rt_bandwidth *rt_b = sched_rt_bandwidth(rt_rq); |
Shawn Bohrer | aa7f673 | 2013-01-14 11:55:31 -0600 | [diff] [blame] | 576 | struct root_domain *rd = rq_of_rt_rq(rt_rq)->rd; |
Peter Zijlstra | ac086bc | 2008-04-19 19:44:58 +0200 | [diff] [blame] | 577 | int i, weight, more = 0; |
| 578 | u64 rt_period; |
| 579 | |
Rusty Russell | c6c4927 | 2008-11-25 02:35:05 +1030 | [diff] [blame] | 580 | weight = cpumask_weight(rd->span); |
Peter Zijlstra | ac086bc | 2008-04-19 19:44:58 +0200 | [diff] [blame] | 581 | |
Thomas Gleixner | 0986b11 | 2009-11-17 15:32:06 +0100 | [diff] [blame] | 582 | raw_spin_lock(&rt_b->rt_runtime_lock); |
Peter Zijlstra | ac086bc | 2008-04-19 19:44:58 +0200 | [diff] [blame] | 583 | rt_period = ktime_to_ns(rt_b->rt_period); |
Rusty Russell | c6c4927 | 2008-11-25 02:35:05 +1030 | [diff] [blame] | 584 | for_each_cpu(i, rd->span) { |
Peter Zijlstra | ac086bc | 2008-04-19 19:44:58 +0200 | [diff] [blame] | 585 | struct rt_rq *iter = sched_rt_period_rt_rq(rt_b, i); |
| 586 | s64 diff; |
| 587 | |
| 588 | if (iter == rt_rq) |
| 589 | continue; |
| 590 | |
Thomas Gleixner | 0986b11 | 2009-11-17 15:32:06 +0100 | [diff] [blame] | 591 | raw_spin_lock(&iter->rt_runtime_lock); |
Peter Zijlstra | 78333cd | 2008-09-23 15:33:43 +0200 | [diff] [blame] | 592 | /* |
| 593 | * Either all rqs have inf runtime and there's nothing to steal |
| 594 | * or __disable_runtime() below sets a specific rq to inf to |
| 595 | * indicate its been disabled and disalow stealing. |
| 596 | */ |
Peter Zijlstra | 7def2be | 2008-06-05 14:49:58 +0200 | [diff] [blame] | 597 | if (iter->rt_runtime == RUNTIME_INF) |
| 598 | goto next; |
| 599 | |
Peter Zijlstra | 78333cd | 2008-09-23 15:33:43 +0200 | [diff] [blame] | 600 | /* |
| 601 | * From runqueues with spare time, take 1/n part of their |
| 602 | * spare time, but no more than our period. |
| 603 | */ |
Peter Zijlstra | ac086bc | 2008-04-19 19:44:58 +0200 | [diff] [blame] | 604 | diff = iter->rt_runtime - iter->rt_time; |
| 605 | if (diff > 0) { |
Peter Zijlstra | 58838cf | 2008-07-24 12:43:13 +0200 | [diff] [blame] | 606 | diff = div_u64((u64)diff, weight); |
Peter Zijlstra | ac086bc | 2008-04-19 19:44:58 +0200 | [diff] [blame] | 607 | if (rt_rq->rt_runtime + diff > rt_period) |
| 608 | diff = rt_period - rt_rq->rt_runtime; |
| 609 | iter->rt_runtime -= diff; |
| 610 | rt_rq->rt_runtime += diff; |
| 611 | more = 1; |
| 612 | if (rt_rq->rt_runtime == rt_period) { |
Thomas Gleixner | 0986b11 | 2009-11-17 15:32:06 +0100 | [diff] [blame] | 613 | raw_spin_unlock(&iter->rt_runtime_lock); |
Peter Zijlstra | ac086bc | 2008-04-19 19:44:58 +0200 | [diff] [blame] | 614 | break; |
| 615 | } |
| 616 | } |
Peter Zijlstra | 7def2be | 2008-06-05 14:49:58 +0200 | [diff] [blame] | 617 | next: |
Thomas Gleixner | 0986b11 | 2009-11-17 15:32:06 +0100 | [diff] [blame] | 618 | raw_spin_unlock(&iter->rt_runtime_lock); |
Peter Zijlstra | ac086bc | 2008-04-19 19:44:58 +0200 | [diff] [blame] | 619 | } |
Thomas Gleixner | 0986b11 | 2009-11-17 15:32:06 +0100 | [diff] [blame] | 620 | raw_spin_unlock(&rt_b->rt_runtime_lock); |
Peter Zijlstra | ac086bc | 2008-04-19 19:44:58 +0200 | [diff] [blame] | 621 | |
| 622 | return more; |
| 623 | } |
Peter Zijlstra | 7def2be | 2008-06-05 14:49:58 +0200 | [diff] [blame] | 624 | |
Peter Zijlstra | 78333cd | 2008-09-23 15:33:43 +0200 | [diff] [blame] | 625 | /* |
| 626 | * Ensure this RQ takes back all the runtime it lend to its neighbours. |
| 627 | */ |
Peter Zijlstra | 7def2be | 2008-06-05 14:49:58 +0200 | [diff] [blame] | 628 | static void __disable_runtime(struct rq *rq) |
| 629 | { |
| 630 | struct root_domain *rd = rq->rd; |
Cheng Xu | ec514c4 | 2011-05-14 14:20:02 +0800 | [diff] [blame] | 631 | rt_rq_iter_t iter; |
Peter Zijlstra | 7def2be | 2008-06-05 14:49:58 +0200 | [diff] [blame] | 632 | struct rt_rq *rt_rq; |
| 633 | |
| 634 | if (unlikely(!scheduler_running)) |
| 635 | return; |
| 636 | |
Cheng Xu | ec514c4 | 2011-05-14 14:20:02 +0800 | [diff] [blame] | 637 | for_each_rt_rq(rt_rq, iter, rq) { |
Peter Zijlstra | 7def2be | 2008-06-05 14:49:58 +0200 | [diff] [blame] | 638 | struct rt_bandwidth *rt_b = sched_rt_bandwidth(rt_rq); |
| 639 | s64 want; |
| 640 | int i; |
| 641 | |
Thomas Gleixner | 0986b11 | 2009-11-17 15:32:06 +0100 | [diff] [blame] | 642 | raw_spin_lock(&rt_b->rt_runtime_lock); |
| 643 | raw_spin_lock(&rt_rq->rt_runtime_lock); |
Peter Zijlstra | 78333cd | 2008-09-23 15:33:43 +0200 | [diff] [blame] | 644 | /* |
| 645 | * Either we're all inf and nobody needs to borrow, or we're |
| 646 | * already disabled and thus have nothing to do, or we have |
| 647 | * exactly the right amount of runtime to take out. |
| 648 | */ |
Peter Zijlstra | 7def2be | 2008-06-05 14:49:58 +0200 | [diff] [blame] | 649 | if (rt_rq->rt_runtime == RUNTIME_INF || |
| 650 | rt_rq->rt_runtime == rt_b->rt_runtime) |
| 651 | goto balanced; |
Thomas Gleixner | 0986b11 | 2009-11-17 15:32:06 +0100 | [diff] [blame] | 652 | raw_spin_unlock(&rt_rq->rt_runtime_lock); |
Peter Zijlstra | 7def2be | 2008-06-05 14:49:58 +0200 | [diff] [blame] | 653 | |
Peter Zijlstra | 78333cd | 2008-09-23 15:33:43 +0200 | [diff] [blame] | 654 | /* |
| 655 | * Calculate the difference between what we started out with |
| 656 | * and what we current have, that's the amount of runtime |
| 657 | * we lend and now have to reclaim. |
| 658 | */ |
Peter Zijlstra | 7def2be | 2008-06-05 14:49:58 +0200 | [diff] [blame] | 659 | want = rt_b->rt_runtime - rt_rq->rt_runtime; |
| 660 | |
Peter Zijlstra | 78333cd | 2008-09-23 15:33:43 +0200 | [diff] [blame] | 661 | /* |
| 662 | * Greedy reclaim, take back as much as we can. |
| 663 | */ |
Rusty Russell | c6c4927 | 2008-11-25 02:35:05 +1030 | [diff] [blame] | 664 | for_each_cpu(i, rd->span) { |
Peter Zijlstra | 7def2be | 2008-06-05 14:49:58 +0200 | [diff] [blame] | 665 | struct rt_rq *iter = sched_rt_period_rt_rq(rt_b, i); |
| 666 | s64 diff; |
| 667 | |
Peter Zijlstra | 78333cd | 2008-09-23 15:33:43 +0200 | [diff] [blame] | 668 | /* |
| 669 | * Can't reclaim from ourselves or disabled runqueues. |
| 670 | */ |
Peter Zijlstra | f1679d0 | 2008-08-14 15:49:00 +0200 | [diff] [blame] | 671 | if (iter == rt_rq || iter->rt_runtime == RUNTIME_INF) |
Peter Zijlstra | 7def2be | 2008-06-05 14:49:58 +0200 | [diff] [blame] | 672 | continue; |
| 673 | |
Thomas Gleixner | 0986b11 | 2009-11-17 15:32:06 +0100 | [diff] [blame] | 674 | raw_spin_lock(&iter->rt_runtime_lock); |
Peter Zijlstra | 7def2be | 2008-06-05 14:49:58 +0200 | [diff] [blame] | 675 | if (want > 0) { |
| 676 | diff = min_t(s64, iter->rt_runtime, want); |
| 677 | iter->rt_runtime -= diff; |
| 678 | want -= diff; |
| 679 | } else { |
| 680 | iter->rt_runtime -= want; |
| 681 | want -= want; |
| 682 | } |
Thomas Gleixner | 0986b11 | 2009-11-17 15:32:06 +0100 | [diff] [blame] | 683 | raw_spin_unlock(&iter->rt_runtime_lock); |
Peter Zijlstra | 7def2be | 2008-06-05 14:49:58 +0200 | [diff] [blame] | 684 | |
| 685 | if (!want) |
| 686 | break; |
| 687 | } |
| 688 | |
Thomas Gleixner | 0986b11 | 2009-11-17 15:32:06 +0100 | [diff] [blame] | 689 | raw_spin_lock(&rt_rq->rt_runtime_lock); |
Peter Zijlstra | 78333cd | 2008-09-23 15:33:43 +0200 | [diff] [blame] | 690 | /* |
| 691 | * We cannot be left wanting - that would mean some runtime |
| 692 | * leaked out of the system. |
| 693 | */ |
Peter Zijlstra | 7def2be | 2008-06-05 14:49:58 +0200 | [diff] [blame] | 694 | BUG_ON(want); |
| 695 | balanced: |
Peter Zijlstra | 78333cd | 2008-09-23 15:33:43 +0200 | [diff] [blame] | 696 | /* |
| 697 | * Disable all the borrow logic by pretending we have inf |
| 698 | * runtime - in which case borrowing doesn't make sense. |
| 699 | */ |
Peter Zijlstra | 7def2be | 2008-06-05 14:49:58 +0200 | [diff] [blame] | 700 | rt_rq->rt_runtime = RUNTIME_INF; |
Peter Boonstoppel | a4c96ae | 2012-08-09 15:34:47 -0700 | [diff] [blame] | 701 | rt_rq->rt_throttled = 0; |
Thomas Gleixner | 0986b11 | 2009-11-17 15:32:06 +0100 | [diff] [blame] | 702 | raw_spin_unlock(&rt_rq->rt_runtime_lock); |
| 703 | raw_spin_unlock(&rt_b->rt_runtime_lock); |
Peter Zijlstra | 7def2be | 2008-06-05 14:49:58 +0200 | [diff] [blame] | 704 | } |
| 705 | } |
| 706 | |
Peter Zijlstra | 7def2be | 2008-06-05 14:49:58 +0200 | [diff] [blame] | 707 | static void __enable_runtime(struct rq *rq) |
| 708 | { |
Cheng Xu | ec514c4 | 2011-05-14 14:20:02 +0800 | [diff] [blame] | 709 | rt_rq_iter_t iter; |
Peter Zijlstra | 7def2be | 2008-06-05 14:49:58 +0200 | [diff] [blame] | 710 | struct rt_rq *rt_rq; |
| 711 | |
| 712 | if (unlikely(!scheduler_running)) |
| 713 | return; |
| 714 | |
Peter Zijlstra | 78333cd | 2008-09-23 15:33:43 +0200 | [diff] [blame] | 715 | /* |
| 716 | * Reset each runqueue's bandwidth settings |
| 717 | */ |
Cheng Xu | ec514c4 | 2011-05-14 14:20:02 +0800 | [diff] [blame] | 718 | for_each_rt_rq(rt_rq, iter, rq) { |
Peter Zijlstra | 7def2be | 2008-06-05 14:49:58 +0200 | [diff] [blame] | 719 | struct rt_bandwidth *rt_b = sched_rt_bandwidth(rt_rq); |
| 720 | |
Thomas Gleixner | 0986b11 | 2009-11-17 15:32:06 +0100 | [diff] [blame] | 721 | raw_spin_lock(&rt_b->rt_runtime_lock); |
| 722 | raw_spin_lock(&rt_rq->rt_runtime_lock); |
Peter Zijlstra | 7def2be | 2008-06-05 14:49:58 +0200 | [diff] [blame] | 723 | rt_rq->rt_runtime = rt_b->rt_runtime; |
| 724 | rt_rq->rt_time = 0; |
Zhang, Yanmin | baf2573 | 2008-09-09 11:26:33 +0800 | [diff] [blame] | 725 | rt_rq->rt_throttled = 0; |
Thomas Gleixner | 0986b11 | 2009-11-17 15:32:06 +0100 | [diff] [blame] | 726 | raw_spin_unlock(&rt_rq->rt_runtime_lock); |
| 727 | raw_spin_unlock(&rt_b->rt_runtime_lock); |
Peter Zijlstra | 7def2be | 2008-06-05 14:49:58 +0200 | [diff] [blame] | 728 | } |
| 729 | } |
| 730 | |
Peter Zijlstra | eff6549 | 2008-06-19 14:22:26 +0200 | [diff] [blame] | 731 | static int balance_runtime(struct rt_rq *rt_rq) |
| 732 | { |
| 733 | int more = 0; |
| 734 | |
Peter Zijlstra | 4a6184c | 2011-10-06 22:39:14 +0200 | [diff] [blame] | 735 | if (!sched_feat(RT_RUNTIME_SHARE)) |
| 736 | return more; |
| 737 | |
Peter Zijlstra | eff6549 | 2008-06-19 14:22:26 +0200 | [diff] [blame] | 738 | if (rt_rq->rt_time > rt_rq->rt_runtime) { |
Thomas Gleixner | 0986b11 | 2009-11-17 15:32:06 +0100 | [diff] [blame] | 739 | raw_spin_unlock(&rt_rq->rt_runtime_lock); |
Peter Zijlstra | eff6549 | 2008-06-19 14:22:26 +0200 | [diff] [blame] | 740 | more = do_balance_runtime(rt_rq); |
Thomas Gleixner | 0986b11 | 2009-11-17 15:32:06 +0100 | [diff] [blame] | 741 | raw_spin_lock(&rt_rq->rt_runtime_lock); |
Peter Zijlstra | eff6549 | 2008-06-19 14:22:26 +0200 | [diff] [blame] | 742 | } |
| 743 | |
| 744 | return more; |
| 745 | } |
Dhaval Giani | 55e12e5 | 2008-06-24 23:39:43 +0530 | [diff] [blame] | 746 | #else /* !CONFIG_SMP */ |
Peter Zijlstra | eff6549 | 2008-06-19 14:22:26 +0200 | [diff] [blame] | 747 | static inline int balance_runtime(struct rt_rq *rt_rq) |
| 748 | { |
| 749 | return 0; |
| 750 | } |
Dhaval Giani | 55e12e5 | 2008-06-24 23:39:43 +0530 | [diff] [blame] | 751 | #endif /* CONFIG_SMP */ |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 752 | |
| 753 | static int do_sched_rt_period_timer(struct rt_bandwidth *rt_b, int overrun) |
| 754 | { |
Peter Zijlstra | 42c62a5 | 2011-10-18 22:03:48 +0200 | [diff] [blame] | 755 | int i, idle = 1, throttled = 0; |
Rusty Russell | c6c4927 | 2008-11-25 02:35:05 +1030 | [diff] [blame] | 756 | const struct cpumask *span; |
Peter Zijlstra | d0b27fa | 2008-04-19 19:44:57 +0200 | [diff] [blame] | 757 | |
Peter Zijlstra | d0b27fa | 2008-04-19 19:44:57 +0200 | [diff] [blame] | 758 | span = sched_rt_period_mask(); |
Mike Galbraith | e221d02 | 2012-08-07 10:02:38 +0200 | [diff] [blame] | 759 | #ifdef CONFIG_RT_GROUP_SCHED |
| 760 | /* |
| 761 | * FIXME: isolated CPUs should really leave the root task group, |
| 762 | * whether they are isolcpus or were isolated via cpusets, lest |
| 763 | * the timer run on a CPU which does not service all runqueues, |
| 764 | * potentially leaving other CPUs indefinitely throttled. If |
| 765 | * isolation is really required, the user will turn the throttle |
| 766 | * off to kill the perturbations it causes anyway. Meanwhile, |
| 767 | * this maintains functionality for boot and/or troubleshooting. |
| 768 | */ |
| 769 | if (rt_b == &root_task_group.rt_bandwidth) |
| 770 | span = cpu_online_mask; |
| 771 | #endif |
Rusty Russell | c6c4927 | 2008-11-25 02:35:05 +1030 | [diff] [blame] | 772 | for_each_cpu(i, span) { |
Peter Zijlstra | d0b27fa | 2008-04-19 19:44:57 +0200 | [diff] [blame] | 773 | int enqueue = 0; |
| 774 | struct rt_rq *rt_rq = sched_rt_period_rt_rq(rt_b, i); |
| 775 | struct rq *rq = rq_of_rt_rq(rt_rq); |
| 776 | |
Thomas Gleixner | 05fa785 | 2009-11-17 14:28:38 +0100 | [diff] [blame] | 777 | raw_spin_lock(&rq->lock); |
Peter Zijlstra | d0b27fa | 2008-04-19 19:44:57 +0200 | [diff] [blame] | 778 | if (rt_rq->rt_time) { |
| 779 | u64 runtime; |
| 780 | |
Thomas Gleixner | 0986b11 | 2009-11-17 15:32:06 +0100 | [diff] [blame] | 781 | raw_spin_lock(&rt_rq->rt_runtime_lock); |
Peter Zijlstra | eff6549 | 2008-06-19 14:22:26 +0200 | [diff] [blame] | 782 | if (rt_rq->rt_throttled) |
| 783 | balance_runtime(rt_rq); |
Peter Zijlstra | d0b27fa | 2008-04-19 19:44:57 +0200 | [diff] [blame] | 784 | runtime = rt_rq->rt_runtime; |
| 785 | rt_rq->rt_time -= min(rt_rq->rt_time, overrun*runtime); |
| 786 | if (rt_rq->rt_throttled && rt_rq->rt_time < runtime) { |
| 787 | rt_rq->rt_throttled = 0; |
| 788 | enqueue = 1; |
Mike Galbraith | 61eadef | 2011-04-29 08:36:50 +0200 | [diff] [blame] | 789 | |
| 790 | /* |
| 791 | * Force a clock update if the CPU was idle, |
| 792 | * lest wakeup -> unthrottle time accumulate. |
| 793 | */ |
| 794 | if (rt_rq->rt_nr_running && rq->curr == rq->idle) |
| 795 | rq->skip_clock_update = -1; |
Peter Zijlstra | d0b27fa | 2008-04-19 19:44:57 +0200 | [diff] [blame] | 796 | } |
| 797 | if (rt_rq->rt_time || rt_rq->rt_nr_running) |
| 798 | idle = 0; |
Thomas Gleixner | 0986b11 | 2009-11-17 15:32:06 +0100 | [diff] [blame] | 799 | raw_spin_unlock(&rt_rq->rt_runtime_lock); |
Balbir Singh | 0c3b916 | 2011-03-03 17:04:35 +0530 | [diff] [blame] | 800 | } else if (rt_rq->rt_nr_running) { |
Peter Zijlstra | 8a8cde1 | 2008-06-19 14:22:28 +0200 | [diff] [blame] | 801 | idle = 0; |
Balbir Singh | 0c3b916 | 2011-03-03 17:04:35 +0530 | [diff] [blame] | 802 | if (!rt_rq_throttled(rt_rq)) |
| 803 | enqueue = 1; |
| 804 | } |
Peter Zijlstra | 42c62a5 | 2011-10-18 22:03:48 +0200 | [diff] [blame] | 805 | if (rt_rq->rt_throttled) |
| 806 | throttled = 1; |
Peter Zijlstra | d0b27fa | 2008-04-19 19:44:57 +0200 | [diff] [blame] | 807 | |
| 808 | if (enqueue) |
| 809 | sched_rt_rq_enqueue(rt_rq); |
Thomas Gleixner | 05fa785 | 2009-11-17 14:28:38 +0100 | [diff] [blame] | 810 | raw_spin_unlock(&rq->lock); |
Peter Zijlstra | d0b27fa | 2008-04-19 19:44:57 +0200 | [diff] [blame] | 811 | } |
| 812 | |
Peter Zijlstra | 42c62a5 | 2011-10-18 22:03:48 +0200 | [diff] [blame] | 813 | if (!throttled && (!rt_bandwidth_enabled() || rt_b->rt_runtime == RUNTIME_INF)) |
| 814 | return 1; |
| 815 | |
Peter Zijlstra | d0b27fa | 2008-04-19 19:44:57 +0200 | [diff] [blame] | 816 | return idle; |
| 817 | } |
| 818 | |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 819 | static inline int rt_se_prio(struct sched_rt_entity *rt_se) |
| 820 | { |
Peter Zijlstra | 052f1dc | 2008-02-13 15:45:40 +0100 | [diff] [blame] | 821 | #ifdef CONFIG_RT_GROUP_SCHED |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 822 | struct rt_rq *rt_rq = group_rt_rq(rt_se); |
| 823 | |
| 824 | if (rt_rq) |
Gregory Haskins | e864c49 | 2008-12-29 09:39:49 -0500 | [diff] [blame] | 825 | return rt_rq->highest_prio.curr; |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 826 | #endif |
| 827 | |
| 828 | return rt_task_of(rt_se)->prio; |
| 829 | } |
| 830 | |
Peter Zijlstra | 9f0c1e5 | 2008-02-13 15:45:39 +0100 | [diff] [blame] | 831 | static int sched_rt_runtime_exceeded(struct rt_rq *rt_rq) |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 832 | { |
Peter Zijlstra | 9f0c1e5 | 2008-02-13 15:45:39 +0100 | [diff] [blame] | 833 | u64 runtime = sched_rt_runtime(rt_rq); |
Peter Zijlstra | fa85ae2 | 2008-01-25 21:08:29 +0100 | [diff] [blame] | 834 | |
Peter Zijlstra | fa85ae2 | 2008-01-25 21:08:29 +0100 | [diff] [blame] | 835 | if (rt_rq->rt_throttled) |
Peter Zijlstra | 23b0fdf | 2008-02-13 15:45:39 +0100 | [diff] [blame] | 836 | return rt_rq_throttled(rt_rq); |
Peter Zijlstra | fa85ae2 | 2008-01-25 21:08:29 +0100 | [diff] [blame] | 837 | |
Shan Hai | 5b680fd | 2011-11-29 11:03:56 +0800 | [diff] [blame] | 838 | if (runtime >= sched_rt_period(rt_rq)) |
Peter Zijlstra | ac086bc | 2008-04-19 19:44:58 +0200 | [diff] [blame] | 839 | return 0; |
| 840 | |
Peter Zijlstra | b79f383 | 2008-06-19 14:22:25 +0200 | [diff] [blame] | 841 | balance_runtime(rt_rq); |
| 842 | runtime = sched_rt_runtime(rt_rq); |
| 843 | if (runtime == RUNTIME_INF) |
| 844 | return 0; |
Peter Zijlstra | ac086bc | 2008-04-19 19:44:58 +0200 | [diff] [blame] | 845 | |
Peter Zijlstra | 9f0c1e5 | 2008-02-13 15:45:39 +0100 | [diff] [blame] | 846 | if (rt_rq->rt_time > runtime) { |
Peter Zijlstra | 7abc63b | 2011-10-18 22:03:48 +0200 | [diff] [blame] | 847 | struct rt_bandwidth *rt_b = sched_rt_bandwidth(rt_rq); |
| 848 | |
| 849 | /* |
| 850 | * Don't actually throttle groups that have no runtime assigned |
| 851 | * but accrue some time due to boosting. |
| 852 | */ |
| 853 | if (likely(rt_b->rt_runtime)) { |
Peter Zijlstra | 3ccf3e8 | 2012-02-27 10:47:00 +0100 | [diff] [blame] | 854 | static bool once = false; |
| 855 | |
Peter Zijlstra | 7abc63b | 2011-10-18 22:03:48 +0200 | [diff] [blame] | 856 | rt_rq->rt_throttled = 1; |
Peter Zijlstra | 3ccf3e8 | 2012-02-27 10:47:00 +0100 | [diff] [blame] | 857 | |
| 858 | if (!once) { |
| 859 | once = true; |
| 860 | printk_sched("sched: RT throttling activated\n"); |
| 861 | } |
Peter Zijlstra | 7abc63b | 2011-10-18 22:03:48 +0200 | [diff] [blame] | 862 | } else { |
| 863 | /* |
| 864 | * In case we did anyway, make it go away, |
| 865 | * replenishment is a joke, since it will replenish us |
| 866 | * with exactly 0 ns. |
| 867 | */ |
| 868 | rt_rq->rt_time = 0; |
| 869 | } |
| 870 | |
Peter Zijlstra | 23b0fdf | 2008-02-13 15:45:39 +0100 | [diff] [blame] | 871 | if (rt_rq_throttled(rt_rq)) { |
Peter Zijlstra | 9f0c1e5 | 2008-02-13 15:45:39 +0100 | [diff] [blame] | 872 | sched_rt_rq_dequeue(rt_rq); |
Peter Zijlstra | 23b0fdf | 2008-02-13 15:45:39 +0100 | [diff] [blame] | 873 | return 1; |
| 874 | } |
Peter Zijlstra | fa85ae2 | 2008-01-25 21:08:29 +0100 | [diff] [blame] | 875 | } |
| 876 | |
| 877 | return 0; |
| 878 | } |
| 879 | |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 880 | /* |
| 881 | * Update the current task's runtime statistics. Skip current tasks that |
| 882 | * are not in our scheduling class. |
| 883 | */ |
Alexey Dobriyan | a995744 | 2007-10-15 17:00:13 +0200 | [diff] [blame] | 884 | static void update_curr_rt(struct rq *rq) |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 885 | { |
| 886 | struct task_struct *curr = rq->curr; |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 887 | struct sched_rt_entity *rt_se = &curr->rt; |
| 888 | struct rt_rq *rt_rq = rt_rq_of_se(rt_se); |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 889 | u64 delta_exec; |
| 890 | |
Peter Zijlstra | 06c3bc6 | 2011-02-02 13:19:48 +0100 | [diff] [blame] | 891 | if (curr->sched_class != &rt_sched_class) |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 892 | return; |
| 893 | |
Frederic Weisbecker | 78becc2 | 2013-04-12 01:51:02 +0200 | [diff] [blame] | 894 | delta_exec = rq_clock_task(rq) - curr->se.exec_start; |
Kirill Tkhai | fc79e24 | 2013-01-30 16:50:36 +0400 | [diff] [blame] | 895 | if (unlikely((s64)delta_exec <= 0)) |
| 896 | return; |
Ingo Molnar | 6cfb0d5 | 2007-08-02 17:41:40 +0200 | [diff] [blame] | 897 | |
Peter Zijlstra | 42c62a5 | 2011-10-18 22:03:48 +0200 | [diff] [blame] | 898 | schedstat_set(curr->se.statistics.exec_max, |
| 899 | max(curr->se.statistics.exec_max, delta_exec)); |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 900 | |
| 901 | curr->se.sum_exec_runtime += delta_exec; |
Frank Mayhar | f06febc | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 902 | account_group_exec_runtime(curr, delta_exec); |
| 903 | |
Frederic Weisbecker | 78becc2 | 2013-04-12 01:51:02 +0200 | [diff] [blame] | 904 | curr->se.exec_start = rq_clock_task(rq); |
Srivatsa Vaddagiri | d842de8 | 2007-12-02 20:04:49 +0100 | [diff] [blame] | 905 | cpuacct_charge(curr, delta_exec); |
Peter Zijlstra | fa85ae2 | 2008-01-25 21:08:29 +0100 | [diff] [blame] | 906 | |
Peter Zijlstra | e9e9250 | 2009-09-01 10:34:37 +0200 | [diff] [blame] | 907 | sched_rt_avg_update(rq, delta_exec); |
| 908 | |
Peter Zijlstra | 0b148fa | 2008-08-19 12:33:04 +0200 | [diff] [blame] | 909 | if (!rt_bandwidth_enabled()) |
| 910 | return; |
| 911 | |
Dhaval Giani | 354d60c | 2008-04-19 19:44:59 +0200 | [diff] [blame] | 912 | for_each_sched_rt_entity(rt_se) { |
| 913 | rt_rq = rt_rq_of_se(rt_se); |
| 914 | |
Peter Zijlstra | cc2991c | 2008-08-19 12:33:03 +0200 | [diff] [blame] | 915 | if (sched_rt_runtime(rt_rq) != RUNTIME_INF) { |
Thomas Gleixner | 0986b11 | 2009-11-17 15:32:06 +0100 | [diff] [blame] | 916 | raw_spin_lock(&rt_rq->rt_runtime_lock); |
Peter Zijlstra | cc2991c | 2008-08-19 12:33:03 +0200 | [diff] [blame] | 917 | rt_rq->rt_time += delta_exec; |
| 918 | if (sched_rt_runtime_exceeded(rt_rq)) |
| 919 | resched_task(curr); |
Thomas Gleixner | 0986b11 | 2009-11-17 15:32:06 +0100 | [diff] [blame] | 920 | raw_spin_unlock(&rt_rq->rt_runtime_lock); |
Peter Zijlstra | cc2991c | 2008-08-19 12:33:03 +0200 | [diff] [blame] | 921 | } |
Dhaval Giani | 354d60c | 2008-04-19 19:44:59 +0200 | [diff] [blame] | 922 | } |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 923 | } |
| 924 | |
Gregory Haskins | 398a153 | 2009-01-14 09:10:04 -0500 | [diff] [blame] | 925 | #if defined CONFIG_SMP |
Gregory Haskins | e864c49 | 2008-12-29 09:39:49 -0500 | [diff] [blame] | 926 | |
Gregory Haskins | 398a153 | 2009-01-14 09:10:04 -0500 | [diff] [blame] | 927 | static void |
| 928 | inc_rt_prio_smp(struct rt_rq *rt_rq, int prio, int prev_prio) |
Steven Rostedt | 63489e4 | 2008-01-25 21:08:03 +0100 | [diff] [blame] | 929 | { |
Gregory Haskins | 4d98427 | 2008-12-29 09:39:49 -0500 | [diff] [blame] | 930 | struct rq *rq = rq_of_rt_rq(rt_rq); |
Gregory Haskins | 4d98427 | 2008-12-29 09:39:49 -0500 | [diff] [blame] | 931 | |
Kirill Tkhai | 757dfca | 2013-11-27 19:59:13 +0400 | [diff] [blame] | 932 | #ifdef CONFIG_RT_GROUP_SCHED |
| 933 | /* |
| 934 | * Change rq's cpupri only if rt_rq is the top queue. |
| 935 | */ |
| 936 | if (&rq->rt != rt_rq) |
| 937 | return; |
| 938 | #endif |
Steven Rostedt | 5181f4a4 | 2011-06-16 21:55:23 -0400 | [diff] [blame] | 939 | if (rq->online && prio < prev_prio) |
| 940 | cpupri_set(&rq->rd->cpupri, rq->cpu, prio); |
Steven Rostedt | 63489e4 | 2008-01-25 21:08:03 +0100 | [diff] [blame] | 941 | } |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 942 | |
Gregory Haskins | 398a153 | 2009-01-14 09:10:04 -0500 | [diff] [blame] | 943 | static void |
| 944 | dec_rt_prio_smp(struct rt_rq *rt_rq, int prio, int prev_prio) |
Steven Rostedt | 63489e4 | 2008-01-25 21:08:03 +0100 | [diff] [blame] | 945 | { |
Gregory Haskins | 4d98427 | 2008-12-29 09:39:49 -0500 | [diff] [blame] | 946 | struct rq *rq = rq_of_rt_rq(rt_rq); |
Gregory Haskins | 6e0534f | 2008-05-12 21:21:01 +0200 | [diff] [blame] | 947 | |
Kirill Tkhai | 757dfca | 2013-11-27 19:59:13 +0400 | [diff] [blame] | 948 | #ifdef CONFIG_RT_GROUP_SCHED |
| 949 | /* |
| 950 | * Change rq's cpupri only if rt_rq is the top queue. |
| 951 | */ |
| 952 | if (&rq->rt != rt_rq) |
| 953 | return; |
| 954 | #endif |
Gregory Haskins | 398a153 | 2009-01-14 09:10:04 -0500 | [diff] [blame] | 955 | if (rq->online && rt_rq->highest_prio.curr != prev_prio) |
| 956 | cpupri_set(&rq->rd->cpupri, rq->cpu, rt_rq->highest_prio.curr); |
| 957 | } |
| 958 | |
| 959 | #else /* CONFIG_SMP */ |
| 960 | |
| 961 | static inline |
| 962 | void inc_rt_prio_smp(struct rt_rq *rt_rq, int prio, int prev_prio) {} |
| 963 | static inline |
| 964 | void dec_rt_prio_smp(struct rt_rq *rt_rq, int prio, int prev_prio) {} |
| 965 | |
| 966 | #endif /* CONFIG_SMP */ |
| 967 | |
Steven Rostedt | 63489e4 | 2008-01-25 21:08:03 +0100 | [diff] [blame] | 968 | #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED |
Gregory Haskins | 398a153 | 2009-01-14 09:10:04 -0500 | [diff] [blame] | 969 | static void |
| 970 | inc_rt_prio(struct rt_rq *rt_rq, int prio) |
| 971 | { |
| 972 | int prev_prio = rt_rq->highest_prio.curr; |
Steven Rostedt | 63489e4 | 2008-01-25 21:08:03 +0100 | [diff] [blame] | 973 | |
Gregory Haskins | 398a153 | 2009-01-14 09:10:04 -0500 | [diff] [blame] | 974 | if (prio < prev_prio) |
| 975 | rt_rq->highest_prio.curr = prio; |
| 976 | |
| 977 | inc_rt_prio_smp(rt_rq, prio, prev_prio); |
| 978 | } |
| 979 | |
| 980 | static void |
| 981 | dec_rt_prio(struct rt_rq *rt_rq, int prio) |
| 982 | { |
| 983 | int prev_prio = rt_rq->highest_prio.curr; |
| 984 | |
| 985 | if (rt_rq->rt_nr_running) { |
| 986 | |
| 987 | WARN_ON(prio < prev_prio); |
Gregory Haskins | e864c49 | 2008-12-29 09:39:49 -0500 | [diff] [blame] | 988 | |
| 989 | /* |
Gregory Haskins | 398a153 | 2009-01-14 09:10:04 -0500 | [diff] [blame] | 990 | * This may have been our highest task, and therefore |
| 991 | * we may have some recomputation to do |
Gregory Haskins | e864c49 | 2008-12-29 09:39:49 -0500 | [diff] [blame] | 992 | */ |
Gregory Haskins | 398a153 | 2009-01-14 09:10:04 -0500 | [diff] [blame] | 993 | if (prio == prev_prio) { |
Gregory Haskins | e864c49 | 2008-12-29 09:39:49 -0500 | [diff] [blame] | 994 | struct rt_prio_array *array = &rt_rq->active; |
| 995 | |
| 996 | rt_rq->highest_prio.curr = |
Steven Rostedt | 764a9d6 | 2008-01-25 21:08:04 +0100 | [diff] [blame] | 997 | sched_find_first_bit(array->bitmap); |
Gregory Haskins | e864c49 | 2008-12-29 09:39:49 -0500 | [diff] [blame] | 998 | } |
| 999 | |
Steven Rostedt | 764a9d6 | 2008-01-25 21:08:04 +0100 | [diff] [blame] | 1000 | } else |
Gregory Haskins | e864c49 | 2008-12-29 09:39:49 -0500 | [diff] [blame] | 1001 | rt_rq->highest_prio.curr = MAX_RT_PRIO; |
Gregory Haskins | 73fe6aa | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 1002 | |
Gregory Haskins | 398a153 | 2009-01-14 09:10:04 -0500 | [diff] [blame] | 1003 | dec_rt_prio_smp(rt_rq, prio, prev_prio); |
| 1004 | } |
Gregory Haskins | 1f11eb6 | 2008-06-04 15:04:05 -0400 | [diff] [blame] | 1005 | |
Gregory Haskins | 398a153 | 2009-01-14 09:10:04 -0500 | [diff] [blame] | 1006 | #else |
| 1007 | |
| 1008 | static inline void inc_rt_prio(struct rt_rq *rt_rq, int prio) {} |
| 1009 | static inline void dec_rt_prio(struct rt_rq *rt_rq, int prio) {} |
| 1010 | |
| 1011 | #endif /* CONFIG_SMP || CONFIG_RT_GROUP_SCHED */ |
| 1012 | |
Gregory Haskins | 73fe6aa | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 1013 | #ifdef CONFIG_RT_GROUP_SCHED |
Gregory Haskins | 398a153 | 2009-01-14 09:10:04 -0500 | [diff] [blame] | 1014 | |
| 1015 | static void |
| 1016 | inc_rt_group(struct sched_rt_entity *rt_se, struct rt_rq *rt_rq) |
| 1017 | { |
Gregory Haskins | 73fe6aa | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 1018 | if (rt_se_boosted(rt_se)) |
Steven Rostedt | 764a9d6 | 2008-01-25 21:08:04 +0100 | [diff] [blame] | 1019 | rt_rq->rt_nr_boosted++; |
Peter Zijlstra | 052f1dc | 2008-02-13 15:45:40 +0100 | [diff] [blame] | 1020 | |
Peter Zijlstra | 23b0fdf | 2008-02-13 15:45:39 +0100 | [diff] [blame] | 1021 | if (rt_rq->tg) |
| 1022 | start_rt_bandwidth(&rt_rq->tg->rt_bandwidth); |
Gregory Haskins | 398a153 | 2009-01-14 09:10:04 -0500 | [diff] [blame] | 1023 | } |
| 1024 | |
| 1025 | static void |
| 1026 | dec_rt_group(struct sched_rt_entity *rt_se, struct rt_rq *rt_rq) |
| 1027 | { |
Peter Zijlstra | 23b0fdf | 2008-02-13 15:45:39 +0100 | [diff] [blame] | 1028 | if (rt_se_boosted(rt_se)) |
| 1029 | rt_rq->rt_nr_boosted--; |
| 1030 | |
| 1031 | WARN_ON(!rt_rq->rt_nr_running && rt_rq->rt_nr_boosted); |
Gregory Haskins | 398a153 | 2009-01-14 09:10:04 -0500 | [diff] [blame] | 1032 | } |
| 1033 | |
| 1034 | #else /* CONFIG_RT_GROUP_SCHED */ |
| 1035 | |
| 1036 | static void |
| 1037 | inc_rt_group(struct sched_rt_entity *rt_se, struct rt_rq *rt_rq) |
| 1038 | { |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1039 | start_rt_bandwidth(&def_rt_bandwidth); |
Gregory Haskins | 398a153 | 2009-01-14 09:10:04 -0500 | [diff] [blame] | 1040 | } |
| 1041 | |
| 1042 | static inline |
| 1043 | void dec_rt_group(struct sched_rt_entity *rt_se, struct rt_rq *rt_rq) {} |
| 1044 | |
| 1045 | #endif /* CONFIG_RT_GROUP_SCHED */ |
| 1046 | |
| 1047 | static inline |
Kirill Tkhai | 22abdef | 2014-03-15 02:14:49 +0400 | [diff] [blame^] | 1048 | unsigned int rt_se_nr_running(struct sched_rt_entity *rt_se) |
| 1049 | { |
| 1050 | struct rt_rq *group_rq = group_rt_rq(rt_se); |
| 1051 | |
| 1052 | if (group_rq) |
| 1053 | return group_rq->rt_nr_running; |
| 1054 | else |
| 1055 | return 1; |
| 1056 | } |
| 1057 | |
| 1058 | static inline |
Gregory Haskins | 398a153 | 2009-01-14 09:10:04 -0500 | [diff] [blame] | 1059 | void inc_rt_tasks(struct sched_rt_entity *rt_se, struct rt_rq *rt_rq) |
| 1060 | { |
| 1061 | int prio = rt_se_prio(rt_se); |
| 1062 | |
| 1063 | WARN_ON(!rt_prio(prio)); |
Kirill Tkhai | 22abdef | 2014-03-15 02:14:49 +0400 | [diff] [blame^] | 1064 | rt_rq->rt_nr_running += rt_se_nr_running(rt_se); |
Gregory Haskins | 398a153 | 2009-01-14 09:10:04 -0500 | [diff] [blame] | 1065 | |
| 1066 | inc_rt_prio(rt_rq, prio); |
| 1067 | inc_rt_migration(rt_se, rt_rq); |
| 1068 | inc_rt_group(rt_se, rt_rq); |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1069 | } |
| 1070 | |
Peter Zijlstra | 23b0fdf | 2008-02-13 15:45:39 +0100 | [diff] [blame] | 1071 | static inline |
| 1072 | void dec_rt_tasks(struct sched_rt_entity *rt_se, struct rt_rq *rt_rq) |
| 1073 | { |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1074 | WARN_ON(!rt_prio(rt_se_prio(rt_se))); |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 1075 | WARN_ON(!rt_rq->rt_nr_running); |
Kirill Tkhai | 22abdef | 2014-03-15 02:14:49 +0400 | [diff] [blame^] | 1076 | rt_rq->rt_nr_running -= rt_se_nr_running(rt_se); |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1077 | |
Gregory Haskins | 398a153 | 2009-01-14 09:10:04 -0500 | [diff] [blame] | 1078 | dec_rt_prio(rt_rq, rt_se_prio(rt_se)); |
| 1079 | dec_rt_migration(rt_se, rt_rq); |
| 1080 | dec_rt_group(rt_se, rt_rq); |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1081 | } |
| 1082 | |
Thomas Gleixner | 37dad3f | 2010-01-20 20:59:01 +0000 | [diff] [blame] | 1083 | static void __enqueue_rt_entity(struct sched_rt_entity *rt_se, bool head) |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1084 | { |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 1085 | struct rt_rq *rt_rq = rt_rq_of_se(rt_se); |
| 1086 | struct rt_prio_array *array = &rt_rq->active; |
| 1087 | struct rt_rq *group_rq = group_rt_rq(rt_se); |
Dmitry Adamushko | 20b6331 | 2008-06-11 00:58:30 +0200 | [diff] [blame] | 1088 | struct list_head *queue = array->queue + rt_se_prio(rt_se); |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1089 | |
Peter Zijlstra | ad2a3f1 | 2008-06-19 09:06:57 +0200 | [diff] [blame] | 1090 | /* |
| 1091 | * Don't enqueue the group if its throttled, or when empty. |
| 1092 | * The latter is a consequence of the former when a child group |
| 1093 | * get throttled and the current group doesn't have any other |
| 1094 | * active members. |
| 1095 | */ |
| 1096 | if (group_rq && (rt_rq_throttled(group_rq) || !group_rq->rt_nr_running)) |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 1097 | return; |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1098 | |
Thomas Gleixner | 37dad3f | 2010-01-20 20:59:01 +0000 | [diff] [blame] | 1099 | if (head) |
| 1100 | list_add(&rt_se->run_list, queue); |
| 1101 | else |
| 1102 | list_add_tail(&rt_se->run_list, queue); |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 1103 | __set_bit(rt_se_prio(rt_se), array->bitmap); |
Peter Zijlstra | 78f2c7d | 2008-01-25 21:08:27 +0100 | [diff] [blame] | 1104 | |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 1105 | inc_rt_tasks(rt_se, rt_rq); |
| 1106 | } |
| 1107 | |
Peter Zijlstra | ad2a3f1 | 2008-06-19 09:06:57 +0200 | [diff] [blame] | 1108 | static void __dequeue_rt_entity(struct sched_rt_entity *rt_se) |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 1109 | { |
| 1110 | struct rt_rq *rt_rq = rt_rq_of_se(rt_se); |
| 1111 | struct rt_prio_array *array = &rt_rq->active; |
| 1112 | |
| 1113 | list_del_init(&rt_se->run_list); |
| 1114 | if (list_empty(array->queue + rt_se_prio(rt_se))) |
| 1115 | __clear_bit(rt_se_prio(rt_se), array->bitmap); |
| 1116 | |
| 1117 | dec_rt_tasks(rt_se, rt_rq); |
| 1118 | } |
| 1119 | |
| 1120 | /* |
| 1121 | * Because the prio of an upper entry depends on the lower |
| 1122 | * entries, we must remove entries top - down. |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 1123 | */ |
Peter Zijlstra | ad2a3f1 | 2008-06-19 09:06:57 +0200 | [diff] [blame] | 1124 | static void dequeue_rt_stack(struct sched_rt_entity *rt_se) |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 1125 | { |
Peter Zijlstra | ad2a3f1 | 2008-06-19 09:06:57 +0200 | [diff] [blame] | 1126 | struct sched_rt_entity *back = NULL; |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 1127 | |
Peter Zijlstra | 58d6c2d | 2008-04-19 19:45:00 +0200 | [diff] [blame] | 1128 | for_each_sched_rt_entity(rt_se) { |
| 1129 | rt_se->back = back; |
| 1130 | back = rt_se; |
| 1131 | } |
| 1132 | |
| 1133 | for (rt_se = back; rt_se; rt_se = rt_se->back) { |
| 1134 | if (on_rt_rq(rt_se)) |
Peter Zijlstra | ad2a3f1 | 2008-06-19 09:06:57 +0200 | [diff] [blame] | 1135 | __dequeue_rt_entity(rt_se); |
| 1136 | } |
| 1137 | } |
| 1138 | |
Thomas Gleixner | 37dad3f | 2010-01-20 20:59:01 +0000 | [diff] [blame] | 1139 | static void enqueue_rt_entity(struct sched_rt_entity *rt_se, bool head) |
Peter Zijlstra | ad2a3f1 | 2008-06-19 09:06:57 +0200 | [diff] [blame] | 1140 | { |
| 1141 | dequeue_rt_stack(rt_se); |
| 1142 | for_each_sched_rt_entity(rt_se) |
Thomas Gleixner | 37dad3f | 2010-01-20 20:59:01 +0000 | [diff] [blame] | 1143 | __enqueue_rt_entity(rt_se, head); |
Peter Zijlstra | ad2a3f1 | 2008-06-19 09:06:57 +0200 | [diff] [blame] | 1144 | } |
| 1145 | |
| 1146 | static void dequeue_rt_entity(struct sched_rt_entity *rt_se) |
| 1147 | { |
| 1148 | dequeue_rt_stack(rt_se); |
| 1149 | |
| 1150 | for_each_sched_rt_entity(rt_se) { |
| 1151 | struct rt_rq *rt_rq = group_rt_rq(rt_se); |
| 1152 | |
| 1153 | if (rt_rq && rt_rq->rt_nr_running) |
Thomas Gleixner | 37dad3f | 2010-01-20 20:59:01 +0000 | [diff] [blame] | 1154 | __enqueue_rt_entity(rt_se, false); |
Peter Zijlstra | 58d6c2d | 2008-04-19 19:45:00 +0200 | [diff] [blame] | 1155 | } |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1156 | } |
| 1157 | |
| 1158 | /* |
| 1159 | * Adding/removing a task to/from a priority array: |
| 1160 | */ |
Thomas Gleixner | ea87bb7 | 2010-01-20 20:58:57 +0000 | [diff] [blame] | 1161 | static void |
Peter Zijlstra | 371fd7e | 2010-03-24 16:38:48 +0100 | [diff] [blame] | 1162 | enqueue_task_rt(struct rq *rq, struct task_struct *p, int flags) |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 1163 | { |
| 1164 | struct sched_rt_entity *rt_se = &p->rt; |
| 1165 | |
Peter Zijlstra | 371fd7e | 2010-03-24 16:38:48 +0100 | [diff] [blame] | 1166 | if (flags & ENQUEUE_WAKEUP) |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 1167 | rt_se->timeout = 0; |
| 1168 | |
Peter Zijlstra | 371fd7e | 2010-03-24 16:38:48 +0100 | [diff] [blame] | 1169 | enqueue_rt_entity(rt_se, flags & ENQUEUE_HEAD); |
Peter Zijlstra | c09595f | 2008-06-27 13:41:14 +0200 | [diff] [blame] | 1170 | |
Peter Zijlstra | 29baa74 | 2012-04-23 12:11:21 +0200 | [diff] [blame] | 1171 | if (!task_current(rq, p) && p->nr_cpus_allowed > 1) |
Gregory Haskins | 917b627 | 2008-12-29 09:39:53 -0500 | [diff] [blame] | 1172 | enqueue_pushable_task(rq, p); |
Paul Turner | 953bfcd | 2011-07-21 09:43:27 -0700 | [diff] [blame] | 1173 | |
| 1174 | inc_nr_running(rq); |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 1175 | } |
| 1176 | |
Peter Zijlstra | 371fd7e | 2010-03-24 16:38:48 +0100 | [diff] [blame] | 1177 | static void dequeue_task_rt(struct rq *rq, struct task_struct *p, int flags) |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1178 | { |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 1179 | struct sched_rt_entity *rt_se = &p->rt; |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1180 | |
| 1181 | update_curr_rt(rq); |
Peter Zijlstra | ad2a3f1 | 2008-06-19 09:06:57 +0200 | [diff] [blame] | 1182 | dequeue_rt_entity(rt_se); |
Peter Zijlstra | c09595f | 2008-06-27 13:41:14 +0200 | [diff] [blame] | 1183 | |
Gregory Haskins | 917b627 | 2008-12-29 09:39:53 -0500 | [diff] [blame] | 1184 | dequeue_pushable_task(rq, p); |
Paul Turner | 953bfcd | 2011-07-21 09:43:27 -0700 | [diff] [blame] | 1185 | |
| 1186 | dec_nr_running(rq); |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1187 | } |
| 1188 | |
| 1189 | /* |
Richard Weinberger | 6068631 | 2011-11-12 18:07:57 +0100 | [diff] [blame] | 1190 | * Put task to the head or the end of the run list without the overhead of |
| 1191 | * dequeue followed by enqueue. |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1192 | */ |
Dmitry Adamushko | 7ebefa8 | 2008-07-01 23:32:15 +0200 | [diff] [blame] | 1193 | static void |
| 1194 | requeue_rt_entity(struct rt_rq *rt_rq, struct sched_rt_entity *rt_se, int head) |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1195 | { |
Ingo Molnar | 1cdad71 | 2008-06-19 09:09:15 +0200 | [diff] [blame] | 1196 | if (on_rt_rq(rt_se)) { |
Dmitry Adamushko | 7ebefa8 | 2008-07-01 23:32:15 +0200 | [diff] [blame] | 1197 | struct rt_prio_array *array = &rt_rq->active; |
| 1198 | struct list_head *queue = array->queue + rt_se_prio(rt_se); |
| 1199 | |
| 1200 | if (head) |
| 1201 | list_move(&rt_se->run_list, queue); |
| 1202 | else |
| 1203 | list_move_tail(&rt_se->run_list, queue); |
Ingo Molnar | 1cdad71 | 2008-06-19 09:09:15 +0200 | [diff] [blame] | 1204 | } |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1205 | } |
| 1206 | |
Dmitry Adamushko | 7ebefa8 | 2008-07-01 23:32:15 +0200 | [diff] [blame] | 1207 | static void requeue_task_rt(struct rq *rq, struct task_struct *p, int head) |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 1208 | { |
| 1209 | struct sched_rt_entity *rt_se = &p->rt; |
| 1210 | struct rt_rq *rt_rq; |
| 1211 | |
| 1212 | for_each_sched_rt_entity(rt_se) { |
| 1213 | rt_rq = rt_rq_of_se(rt_se); |
Dmitry Adamushko | 7ebefa8 | 2008-07-01 23:32:15 +0200 | [diff] [blame] | 1214 | requeue_rt_entity(rt_rq, rt_se, head); |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 1215 | } |
| 1216 | } |
| 1217 | |
| 1218 | static void yield_task_rt(struct rq *rq) |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1219 | { |
Dmitry Adamushko | 7ebefa8 | 2008-07-01 23:32:15 +0200 | [diff] [blame] | 1220 | requeue_task_rt(rq, rq->curr, 0); |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1221 | } |
| 1222 | |
Gregory Haskins | e7693a3 | 2008-01-25 21:08:09 +0100 | [diff] [blame] | 1223 | #ifdef CONFIG_SMP |
Gregory Haskins | 318e089 | 2008-01-25 21:08:10 +0100 | [diff] [blame] | 1224 | static int find_lowest_rq(struct task_struct *task); |
| 1225 | |
Peter Zijlstra | 0017d73 | 2010-03-24 18:34:10 +0100 | [diff] [blame] | 1226 | static int |
Peter Zijlstra | ac66f54 | 2013-10-07 11:29:16 +0100 | [diff] [blame] | 1227 | select_task_rq_rt(struct task_struct *p, int cpu, int sd_flag, int flags) |
Gregory Haskins | e7693a3 | 2008-01-25 21:08:09 +0100 | [diff] [blame] | 1228 | { |
Peter Zijlstra | 7608dec | 2011-04-05 17:23:46 +0200 | [diff] [blame] | 1229 | struct task_struct *curr; |
| 1230 | struct rq *rq; |
Steven Rostedt | c37495f | 2011-06-16 21:55:22 -0400 | [diff] [blame] | 1231 | |
Peter Zijlstra | 29baa74 | 2012-04-23 12:11:21 +0200 | [diff] [blame] | 1232 | if (p->nr_cpus_allowed == 1) |
Mike Galbraith | 76854c7 | 2011-11-22 15:18:24 +0100 | [diff] [blame] | 1233 | goto out; |
| 1234 | |
Steven Rostedt | c37495f | 2011-06-16 21:55:22 -0400 | [diff] [blame] | 1235 | /* For anything but wake ups, just return the task_cpu */ |
| 1236 | if (sd_flag != SD_BALANCE_WAKE && sd_flag != SD_BALANCE_FORK) |
| 1237 | goto out; |
| 1238 | |
Peter Zijlstra | 7608dec | 2011-04-05 17:23:46 +0200 | [diff] [blame] | 1239 | rq = cpu_rq(cpu); |
| 1240 | |
| 1241 | rcu_read_lock(); |
| 1242 | curr = ACCESS_ONCE(rq->curr); /* unlocked access */ |
| 1243 | |
Gregory Haskins | 318e089 | 2008-01-25 21:08:10 +0100 | [diff] [blame] | 1244 | /* |
Peter Zijlstra | 7608dec | 2011-04-05 17:23:46 +0200 | [diff] [blame] | 1245 | * If the current task on @p's runqueue is an RT task, then |
Steven Rostedt | e1f47d8 | 2008-01-25 21:08:12 +0100 | [diff] [blame] | 1246 | * try to see if we can wake this RT task up on another |
| 1247 | * runqueue. Otherwise simply start this RT task |
| 1248 | * on its current runqueue. |
| 1249 | * |
Steven Rostedt | 43fa546 | 2010-09-20 22:40:03 -0400 | [diff] [blame] | 1250 | * We want to avoid overloading runqueues. If the woken |
| 1251 | * task is a higher priority, then it will stay on this CPU |
| 1252 | * and the lower prio task should be moved to another CPU. |
| 1253 | * Even though this will probably make the lower prio task |
| 1254 | * lose its cache, we do not want to bounce a higher task |
| 1255 | * around just because it gave up its CPU, perhaps for a |
| 1256 | * lock? |
| 1257 | * |
| 1258 | * For equal prio tasks, we just let the scheduler sort it out. |
Peter Zijlstra | 7608dec | 2011-04-05 17:23:46 +0200 | [diff] [blame] | 1259 | * |
Gregory Haskins | 318e089 | 2008-01-25 21:08:10 +0100 | [diff] [blame] | 1260 | * Otherwise, just let it ride on the affined RQ and the |
| 1261 | * post-schedule router will push the preempted task away |
Peter Zijlstra | 7608dec | 2011-04-05 17:23:46 +0200 | [diff] [blame] | 1262 | * |
| 1263 | * This test is optimistic, if we get it wrong the load-balancer |
| 1264 | * will have to sort it out. |
Gregory Haskins | 318e089 | 2008-01-25 21:08:10 +0100 | [diff] [blame] | 1265 | */ |
Peter Zijlstra | 7608dec | 2011-04-05 17:23:46 +0200 | [diff] [blame] | 1266 | if (curr && unlikely(rt_task(curr)) && |
Peter Zijlstra | 29baa74 | 2012-04-23 12:11:21 +0200 | [diff] [blame] | 1267 | (curr->nr_cpus_allowed < 2 || |
Shawn Bohrer | 6bfa687 | 2013-10-04 14:24:53 -0500 | [diff] [blame] | 1268 | curr->prio <= p->prio)) { |
Peter Zijlstra | 7608dec | 2011-04-05 17:23:46 +0200 | [diff] [blame] | 1269 | int target = find_lowest_rq(p); |
| 1270 | |
| 1271 | if (target != -1) |
| 1272 | cpu = target; |
| 1273 | } |
| 1274 | rcu_read_unlock(); |
| 1275 | |
Steven Rostedt | c37495f | 2011-06-16 21:55:22 -0400 | [diff] [blame] | 1276 | out: |
Peter Zijlstra | 7608dec | 2011-04-05 17:23:46 +0200 | [diff] [blame] | 1277 | return cpu; |
Gregory Haskins | e7693a3 | 2008-01-25 21:08:09 +0100 | [diff] [blame] | 1278 | } |
Dmitry Adamushko | 7ebefa8 | 2008-07-01 23:32:15 +0200 | [diff] [blame] | 1279 | |
| 1280 | static void check_preempt_equal_prio(struct rq *rq, struct task_struct *p) |
| 1281 | { |
Peter Zijlstra | 29baa74 | 2012-04-23 12:11:21 +0200 | [diff] [blame] | 1282 | if (rq->curr->nr_cpus_allowed == 1) |
Dmitry Adamushko | 7ebefa8 | 2008-07-01 23:32:15 +0200 | [diff] [blame] | 1283 | return; |
| 1284 | |
Peter Zijlstra | 29baa74 | 2012-04-23 12:11:21 +0200 | [diff] [blame] | 1285 | if (p->nr_cpus_allowed != 1 |
Rusty Russell | 13b8bd0 | 2009-03-25 15:01:22 +1030 | [diff] [blame] | 1286 | && cpupri_find(&rq->rd->cpupri, p, NULL)) |
Dmitry Adamushko | 7ebefa8 | 2008-07-01 23:32:15 +0200 | [diff] [blame] | 1287 | return; |
| 1288 | |
Rusty Russell | 13b8bd0 | 2009-03-25 15:01:22 +1030 | [diff] [blame] | 1289 | if (!cpupri_find(&rq->rd->cpupri, rq->curr, NULL)) |
| 1290 | return; |
Dmitry Adamushko | 7ebefa8 | 2008-07-01 23:32:15 +0200 | [diff] [blame] | 1291 | |
| 1292 | /* |
| 1293 | * There appears to be other cpus that can accept |
| 1294 | * current and none to run 'p', so lets reschedule |
| 1295 | * to try and push current away: |
| 1296 | */ |
| 1297 | requeue_task_rt(rq, p, 1); |
| 1298 | resched_task(rq->curr); |
| 1299 | } |
| 1300 | |
Gregory Haskins | e7693a3 | 2008-01-25 21:08:09 +0100 | [diff] [blame] | 1301 | #endif /* CONFIG_SMP */ |
| 1302 | |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1303 | /* |
| 1304 | * Preempt the current task with a newly woken task if needed: |
| 1305 | */ |
Peter Zijlstra | 7d47872 | 2009-09-14 19:55:44 +0200 | [diff] [blame] | 1306 | static void check_preempt_curr_rt(struct rq *rq, struct task_struct *p, int flags) |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1307 | { |
Gregory Haskins | 45c01e8 | 2008-05-12 21:20:41 +0200 | [diff] [blame] | 1308 | if (p->prio < rq->curr->prio) { |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1309 | resched_task(rq->curr); |
Gregory Haskins | 45c01e8 | 2008-05-12 21:20:41 +0200 | [diff] [blame] | 1310 | return; |
| 1311 | } |
| 1312 | |
| 1313 | #ifdef CONFIG_SMP |
| 1314 | /* |
| 1315 | * If: |
| 1316 | * |
| 1317 | * - the newly woken task is of equal priority to the current task |
| 1318 | * - the newly woken task is non-migratable while current is migratable |
| 1319 | * - current will be preempted on the next reschedule |
| 1320 | * |
| 1321 | * we should check to see if current can readily move to a different |
| 1322 | * cpu. If so, we will reschedule to allow the push logic to try |
| 1323 | * to move current somewhere else, making room for our non-migratable |
| 1324 | * task. |
| 1325 | */ |
Hillf Danton | 8dd0de8 | 2011-06-14 18:36:24 -0400 | [diff] [blame] | 1326 | if (p->prio == rq->curr->prio && !test_tsk_need_resched(rq->curr)) |
Dmitry Adamushko | 7ebefa8 | 2008-07-01 23:32:15 +0200 | [diff] [blame] | 1327 | check_preempt_equal_prio(rq, p); |
Gregory Haskins | 45c01e8 | 2008-05-12 21:20:41 +0200 | [diff] [blame] | 1328 | #endif |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1329 | } |
| 1330 | |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 1331 | static struct sched_rt_entity *pick_next_rt_entity(struct rq *rq, |
| 1332 | struct rt_rq *rt_rq) |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1333 | { |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 1334 | struct rt_prio_array *array = &rt_rq->active; |
| 1335 | struct sched_rt_entity *next = NULL; |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1336 | struct list_head *queue; |
| 1337 | int idx; |
| 1338 | |
| 1339 | idx = sched_find_first_bit(array->bitmap); |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 1340 | BUG_ON(idx >= MAX_RT_PRIO); |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1341 | |
| 1342 | queue = array->queue + idx; |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 1343 | next = list_entry(queue->next, struct sched_rt_entity, run_list); |
Dmitry Adamushko | 326587b | 2008-01-25 21:08:34 +0100 | [diff] [blame] | 1344 | |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1345 | return next; |
| 1346 | } |
| 1347 | |
Gregory Haskins | 917b627 | 2008-12-29 09:39:53 -0500 | [diff] [blame] | 1348 | static struct task_struct *_pick_next_task_rt(struct rq *rq) |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 1349 | { |
| 1350 | struct sched_rt_entity *rt_se; |
| 1351 | struct task_struct *p; |
Peter Zijlstra | 606dba2 | 2012-02-11 06:05:00 +0100 | [diff] [blame] | 1352 | struct rt_rq *rt_rq = &rq->rt; |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 1353 | |
| 1354 | do { |
| 1355 | rt_se = pick_next_rt_entity(rq, rt_rq); |
Dmitry Adamushko | 326587b | 2008-01-25 21:08:34 +0100 | [diff] [blame] | 1356 | BUG_ON(!rt_se); |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 1357 | rt_rq = group_rt_rq(rt_se); |
| 1358 | } while (rt_rq); |
| 1359 | |
| 1360 | p = rt_task_of(rt_se); |
Frederic Weisbecker | 78becc2 | 2013-04-12 01:51:02 +0200 | [diff] [blame] | 1361 | p->se.exec_start = rq_clock_task(rq); |
Gregory Haskins | 917b627 | 2008-12-29 09:39:53 -0500 | [diff] [blame] | 1362 | |
| 1363 | return p; |
| 1364 | } |
| 1365 | |
Peter Zijlstra | 606dba2 | 2012-02-11 06:05:00 +0100 | [diff] [blame] | 1366 | static struct task_struct * |
| 1367 | pick_next_task_rt(struct rq *rq, struct task_struct *prev) |
Gregory Haskins | 917b627 | 2008-12-29 09:39:53 -0500 | [diff] [blame] | 1368 | { |
Peter Zijlstra | 606dba2 | 2012-02-11 06:05:00 +0100 | [diff] [blame] | 1369 | struct task_struct *p; |
| 1370 | struct rt_rq *rt_rq = &rq->rt; |
| 1371 | |
Peter Zijlstra | 37e117c | 2014-02-14 12:25:08 +0100 | [diff] [blame] | 1372 | if (need_pull_rt_task(rq, prev)) { |
Peter Zijlstra | 38033c3 | 2014-01-23 20:32:21 +0100 | [diff] [blame] | 1373 | pull_rt_task(rq); |
Peter Zijlstra | 37e117c | 2014-02-14 12:25:08 +0100 | [diff] [blame] | 1374 | /* |
| 1375 | * pull_rt_task() can drop (and re-acquire) rq->lock; this |
Kirill Tkhai | a1d9a32 | 2014-04-10 17:38:36 +0400 | [diff] [blame] | 1376 | * means a dl or stop task can slip in, in which case we need |
| 1377 | * to re-start task selection. |
Peter Zijlstra | 37e117c | 2014-02-14 12:25:08 +0100 | [diff] [blame] | 1378 | */ |
Kirill Tkhai | a1d9a32 | 2014-04-10 17:38:36 +0400 | [diff] [blame] | 1379 | if (unlikely((rq->stop && rq->stop->on_rq) || |
| 1380 | rq->dl.dl_nr_running)) |
Peter Zijlstra | 37e117c | 2014-02-14 12:25:08 +0100 | [diff] [blame] | 1381 | return RETRY_TASK; |
| 1382 | } |
Peter Zijlstra | 38033c3 | 2014-01-23 20:32:21 +0100 | [diff] [blame] | 1383 | |
Kirill Tkhai | 734ff2a | 2014-03-04 19:25:46 +0400 | [diff] [blame] | 1384 | /* |
| 1385 | * We may dequeue prev's rt_rq in put_prev_task(). |
| 1386 | * So, we update time before rt_nr_running check. |
| 1387 | */ |
| 1388 | if (prev->sched_class == &rt_sched_class) |
| 1389 | update_curr_rt(rq); |
| 1390 | |
Peter Zijlstra | 606dba2 | 2012-02-11 06:05:00 +0100 | [diff] [blame] | 1391 | if (!rt_rq->rt_nr_running) |
| 1392 | return NULL; |
| 1393 | |
| 1394 | if (rt_rq_throttled(rt_rq)) |
| 1395 | return NULL; |
| 1396 | |
Peter Zijlstra | 3f1d2a3 | 2014-02-12 10:49:30 +0100 | [diff] [blame] | 1397 | put_prev_task(rq, prev); |
Peter Zijlstra | 606dba2 | 2012-02-11 06:05:00 +0100 | [diff] [blame] | 1398 | |
| 1399 | p = _pick_next_task_rt(rq); |
Gregory Haskins | 917b627 | 2008-12-29 09:39:53 -0500 | [diff] [blame] | 1400 | |
| 1401 | /* The running task is never eligible for pushing */ |
| 1402 | if (p) |
| 1403 | dequeue_pushable_task(rq, p); |
| 1404 | |
Peter Zijlstra | dc87734 | 2014-02-12 15:47:29 +0100 | [diff] [blame] | 1405 | set_post_schedule(rq); |
Gregory Haskins | 3f029d3 | 2009-07-29 11:08:47 -0400 | [diff] [blame] | 1406 | |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 1407 | return p; |
| 1408 | } |
| 1409 | |
Ingo Molnar | 31ee529 | 2007-08-09 11:16:49 +0200 | [diff] [blame] | 1410 | static void put_prev_task_rt(struct rq *rq, struct task_struct *p) |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1411 | { |
Ingo Molnar | f1e14ef | 2007-08-09 11:16:48 +0200 | [diff] [blame] | 1412 | update_curr_rt(rq); |
Gregory Haskins | 917b627 | 2008-12-29 09:39:53 -0500 | [diff] [blame] | 1413 | |
| 1414 | /* |
| 1415 | * The previous task needs to be made eligible for pushing |
| 1416 | * if it is still active |
| 1417 | */ |
Peter Zijlstra | 29baa74 | 2012-04-23 12:11:21 +0200 | [diff] [blame] | 1418 | if (on_rt_rq(&p->rt) && p->nr_cpus_allowed > 1) |
Gregory Haskins | 917b627 | 2008-12-29 09:39:53 -0500 | [diff] [blame] | 1419 | enqueue_pushable_task(rq, p); |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1420 | } |
| 1421 | |
Peter Williams | 681f3e6 | 2007-10-24 18:23:51 +0200 | [diff] [blame] | 1422 | #ifdef CONFIG_SMP |
Peter Zijlstra | 6f505b1 | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 1423 | |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1424 | /* Only try algorithms three times */ |
| 1425 | #define RT_MAX_TRIES 3 |
| 1426 | |
Steven Rostedt | f65eda4 | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 1427 | static int pick_rt_task(struct rq *rq, struct task_struct *p, int cpu) |
| 1428 | { |
| 1429 | if (!task_running(rq, p) && |
Kirill Tkhai | 60334ca | 2013-01-31 18:56:17 +0400 | [diff] [blame] | 1430 | cpumask_test_cpu(cpu, tsk_cpus_allowed(p))) |
Steven Rostedt | f65eda4 | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 1431 | return 1; |
| 1432 | return 0; |
| 1433 | } |
| 1434 | |
Kirill Tkhai | e23ee74 | 2013-06-07 15:37:43 -0400 | [diff] [blame] | 1435 | /* |
| 1436 | * Return the highest pushable rq's task, which is suitable to be executed |
| 1437 | * on the cpu, NULL otherwise |
| 1438 | */ |
| 1439 | static struct task_struct *pick_highest_pushable_task(struct rq *rq, int cpu) |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1440 | { |
Kirill Tkhai | e23ee74 | 2013-06-07 15:37:43 -0400 | [diff] [blame] | 1441 | struct plist_head *head = &rq->rt.pushable_tasks; |
| 1442 | struct task_struct *p; |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1443 | |
Kirill Tkhai | e23ee74 | 2013-06-07 15:37:43 -0400 | [diff] [blame] | 1444 | if (!has_pushable_tasks(rq)) |
| 1445 | return NULL; |
Peter Zijlstra | 3d07467 | 2010-03-10 17:07:24 +0100 | [diff] [blame] | 1446 | |
Kirill Tkhai | e23ee74 | 2013-06-07 15:37:43 -0400 | [diff] [blame] | 1447 | plist_for_each_entry(p, head, pushable_tasks) { |
| 1448 | if (pick_rt_task(rq, p, cpu)) |
| 1449 | return p; |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1450 | } |
| 1451 | |
Kirill Tkhai | e23ee74 | 2013-06-07 15:37:43 -0400 | [diff] [blame] | 1452 | return NULL; |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1453 | } |
| 1454 | |
Rusty Russell | 0e3900e | 2008-11-25 02:35:13 +1030 | [diff] [blame] | 1455 | static DEFINE_PER_CPU(cpumask_var_t, local_cpu_mask); |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1456 | |
Gregory Haskins | 6e1254d | 2008-01-25 21:08:11 +0100 | [diff] [blame] | 1457 | static int find_lowest_rq(struct task_struct *task) |
| 1458 | { |
| 1459 | struct sched_domain *sd; |
Rusty Russell | 96f874e | 2008-11-25 02:35:14 +1030 | [diff] [blame] | 1460 | struct cpumask *lowest_mask = __get_cpu_var(local_cpu_mask); |
Gregory Haskins | 6e1254d | 2008-01-25 21:08:11 +0100 | [diff] [blame] | 1461 | int this_cpu = smp_processor_id(); |
| 1462 | int cpu = task_cpu(task); |
| 1463 | |
Steven Rostedt | 0da938c | 2011-06-14 18:36:25 -0400 | [diff] [blame] | 1464 | /* Make sure the mask is initialized first */ |
| 1465 | if (unlikely(!lowest_mask)) |
| 1466 | return -1; |
| 1467 | |
Peter Zijlstra | 29baa74 | 2012-04-23 12:11:21 +0200 | [diff] [blame] | 1468 | if (task->nr_cpus_allowed == 1) |
Gregory Haskins | 6e0534f | 2008-05-12 21:21:01 +0200 | [diff] [blame] | 1469 | return -1; /* No other targets possible */ |
| 1470 | |
| 1471 | if (!cpupri_find(&task_rq(task)->rd->cpupri, task, lowest_mask)) |
Gregory Haskins | 06f90db | 2008-01-25 21:08:13 +0100 | [diff] [blame] | 1472 | return -1; /* No targets found */ |
| 1473 | |
| 1474 | /* |
Gregory Haskins | 6e1254d | 2008-01-25 21:08:11 +0100 | [diff] [blame] | 1475 | * At this point we have built a mask of cpus representing the |
| 1476 | * lowest priority tasks in the system. Now we want to elect |
| 1477 | * the best one based on our affinity and topology. |
| 1478 | * |
| 1479 | * We prioritize the last cpu that the task executed on since |
| 1480 | * it is most likely cache-hot in that location. |
| 1481 | */ |
Rusty Russell | 96f874e | 2008-11-25 02:35:14 +1030 | [diff] [blame] | 1482 | if (cpumask_test_cpu(cpu, lowest_mask)) |
Gregory Haskins | 6e1254d | 2008-01-25 21:08:11 +0100 | [diff] [blame] | 1483 | return cpu; |
| 1484 | |
| 1485 | /* |
| 1486 | * Otherwise, we consult the sched_domains span maps to figure |
| 1487 | * out which cpu is logically closest to our hot cache data. |
| 1488 | */ |
Rusty Russell | e2c8806 | 2009-11-03 14:53:15 +1030 | [diff] [blame] | 1489 | if (!cpumask_test_cpu(this_cpu, lowest_mask)) |
| 1490 | this_cpu = -1; /* Skip this_cpu opt if not among lowest */ |
Gregory Haskins | 6e1254d | 2008-01-25 21:08:11 +0100 | [diff] [blame] | 1491 | |
Xiaotian Feng | cd4ae6a | 2011-04-22 18:53:54 +0800 | [diff] [blame] | 1492 | rcu_read_lock(); |
Rusty Russell | e2c8806 | 2009-11-03 14:53:15 +1030 | [diff] [blame] | 1493 | for_each_domain(cpu, sd) { |
| 1494 | if (sd->flags & SD_WAKE_AFFINE) { |
| 1495 | int best_cpu; |
Gregory Haskins | 6e1254d | 2008-01-25 21:08:11 +0100 | [diff] [blame] | 1496 | |
Rusty Russell | e2c8806 | 2009-11-03 14:53:15 +1030 | [diff] [blame] | 1497 | /* |
| 1498 | * "this_cpu" is cheaper to preempt than a |
| 1499 | * remote processor. |
| 1500 | */ |
| 1501 | if (this_cpu != -1 && |
Xiaotian Feng | cd4ae6a | 2011-04-22 18:53:54 +0800 | [diff] [blame] | 1502 | cpumask_test_cpu(this_cpu, sched_domain_span(sd))) { |
| 1503 | rcu_read_unlock(); |
Rusty Russell | e2c8806 | 2009-11-03 14:53:15 +1030 | [diff] [blame] | 1504 | return this_cpu; |
Xiaotian Feng | cd4ae6a | 2011-04-22 18:53:54 +0800 | [diff] [blame] | 1505 | } |
Gregory Haskins | 6e1254d | 2008-01-25 21:08:11 +0100 | [diff] [blame] | 1506 | |
Rusty Russell | e2c8806 | 2009-11-03 14:53:15 +1030 | [diff] [blame] | 1507 | best_cpu = cpumask_first_and(lowest_mask, |
| 1508 | sched_domain_span(sd)); |
Xiaotian Feng | cd4ae6a | 2011-04-22 18:53:54 +0800 | [diff] [blame] | 1509 | if (best_cpu < nr_cpu_ids) { |
| 1510 | rcu_read_unlock(); |
Rusty Russell | e2c8806 | 2009-11-03 14:53:15 +1030 | [diff] [blame] | 1511 | return best_cpu; |
Xiaotian Feng | cd4ae6a | 2011-04-22 18:53:54 +0800 | [diff] [blame] | 1512 | } |
Gregory Haskins | 6e1254d | 2008-01-25 21:08:11 +0100 | [diff] [blame] | 1513 | } |
| 1514 | } |
Xiaotian Feng | cd4ae6a | 2011-04-22 18:53:54 +0800 | [diff] [blame] | 1515 | rcu_read_unlock(); |
Gregory Haskins | 6e1254d | 2008-01-25 21:08:11 +0100 | [diff] [blame] | 1516 | |
| 1517 | /* |
| 1518 | * And finally, if there were no matches within the domains |
| 1519 | * just give the caller *something* to work with from the compatible |
| 1520 | * locations. |
| 1521 | */ |
Rusty Russell | e2c8806 | 2009-11-03 14:53:15 +1030 | [diff] [blame] | 1522 | if (this_cpu != -1) |
| 1523 | return this_cpu; |
| 1524 | |
| 1525 | cpu = cpumask_any(lowest_mask); |
| 1526 | if (cpu < nr_cpu_ids) |
| 1527 | return cpu; |
| 1528 | return -1; |
Gregory Haskins | 07b4032 | 2008-01-25 21:08:10 +0100 | [diff] [blame] | 1529 | } |
| 1530 | |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1531 | /* Will lock the rq it finds */ |
Ingo Molnar | 4df64c0 | 2008-01-25 21:08:15 +0100 | [diff] [blame] | 1532 | static struct rq *find_lock_lowest_rq(struct task_struct *task, struct rq *rq) |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1533 | { |
| 1534 | struct rq *lowest_rq = NULL; |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1535 | int tries; |
Ingo Molnar | 4df64c0 | 2008-01-25 21:08:15 +0100 | [diff] [blame] | 1536 | int cpu; |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1537 | |
| 1538 | for (tries = 0; tries < RT_MAX_TRIES; tries++) { |
Gregory Haskins | 07b4032 | 2008-01-25 21:08:10 +0100 | [diff] [blame] | 1539 | cpu = find_lowest_rq(task); |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1540 | |
Gregory Haskins | 2de0b46 | 2008-01-25 21:08:10 +0100 | [diff] [blame] | 1541 | if ((cpu == -1) || (cpu == rq->cpu)) |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1542 | break; |
| 1543 | |
Gregory Haskins | 07b4032 | 2008-01-25 21:08:10 +0100 | [diff] [blame] | 1544 | lowest_rq = cpu_rq(cpu); |
| 1545 | |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1546 | /* if the prio of this runqueue changed, try again */ |
Gregory Haskins | 07b4032 | 2008-01-25 21:08:10 +0100 | [diff] [blame] | 1547 | if (double_lock_balance(rq, lowest_rq)) { |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1548 | /* |
| 1549 | * We had to unlock the run queue. In |
| 1550 | * the mean time, task could have |
| 1551 | * migrated already or had its affinity changed. |
| 1552 | * Also make sure that it wasn't scheduled on its rq. |
| 1553 | */ |
Gregory Haskins | 07b4032 | 2008-01-25 21:08:10 +0100 | [diff] [blame] | 1554 | if (unlikely(task_rq(task) != rq || |
Rusty Russell | 96f874e | 2008-11-25 02:35:14 +1030 | [diff] [blame] | 1555 | !cpumask_test_cpu(lowest_rq->cpu, |
Peter Zijlstra | fa17b50 | 2011-06-16 12:23:22 +0200 | [diff] [blame] | 1556 | tsk_cpus_allowed(task)) || |
Gregory Haskins | 07b4032 | 2008-01-25 21:08:10 +0100 | [diff] [blame] | 1557 | task_running(rq, task) || |
Peter Zijlstra | fd2f441 | 2011-04-05 17:23:44 +0200 | [diff] [blame] | 1558 | !task->on_rq)) { |
Ingo Molnar | 4df64c0 | 2008-01-25 21:08:15 +0100 | [diff] [blame] | 1559 | |
Peter Zijlstra | 7f1b439 | 2012-05-17 21:19:46 +0200 | [diff] [blame] | 1560 | double_unlock_balance(rq, lowest_rq); |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1561 | lowest_rq = NULL; |
| 1562 | break; |
| 1563 | } |
| 1564 | } |
| 1565 | |
| 1566 | /* If this rq is still suitable use it. */ |
Gregory Haskins | e864c49 | 2008-12-29 09:39:49 -0500 | [diff] [blame] | 1567 | if (lowest_rq->rt.highest_prio.curr > task->prio) |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1568 | break; |
| 1569 | |
| 1570 | /* try again */ |
Peter Zijlstra | 1b12bbc | 2008-08-11 09:30:22 +0200 | [diff] [blame] | 1571 | double_unlock_balance(rq, lowest_rq); |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1572 | lowest_rq = NULL; |
| 1573 | } |
| 1574 | |
| 1575 | return lowest_rq; |
| 1576 | } |
| 1577 | |
Gregory Haskins | 917b627 | 2008-12-29 09:39:53 -0500 | [diff] [blame] | 1578 | static struct task_struct *pick_next_pushable_task(struct rq *rq) |
| 1579 | { |
| 1580 | struct task_struct *p; |
| 1581 | |
| 1582 | if (!has_pushable_tasks(rq)) |
| 1583 | return NULL; |
| 1584 | |
| 1585 | p = plist_first_entry(&rq->rt.pushable_tasks, |
| 1586 | struct task_struct, pushable_tasks); |
| 1587 | |
| 1588 | BUG_ON(rq->cpu != task_cpu(p)); |
| 1589 | BUG_ON(task_current(rq, p)); |
Peter Zijlstra | 29baa74 | 2012-04-23 12:11:21 +0200 | [diff] [blame] | 1590 | BUG_ON(p->nr_cpus_allowed <= 1); |
Gregory Haskins | 917b627 | 2008-12-29 09:39:53 -0500 | [diff] [blame] | 1591 | |
Peter Zijlstra | fd2f441 | 2011-04-05 17:23:44 +0200 | [diff] [blame] | 1592 | BUG_ON(!p->on_rq); |
Gregory Haskins | 917b627 | 2008-12-29 09:39:53 -0500 | [diff] [blame] | 1593 | BUG_ON(!rt_task(p)); |
| 1594 | |
| 1595 | return p; |
| 1596 | } |
| 1597 | |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1598 | /* |
| 1599 | * If the current CPU has more than one RT task, see if the non |
| 1600 | * running task can migrate over to a CPU that is running a task |
| 1601 | * of lesser priority. |
| 1602 | */ |
Gregory Haskins | 697f0a4 | 2008-01-25 21:08:09 +0100 | [diff] [blame] | 1603 | static int push_rt_task(struct rq *rq) |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1604 | { |
| 1605 | struct task_struct *next_task; |
| 1606 | struct rq *lowest_rq; |
Hillf Danton | 311e800 | 2011-06-16 21:55:20 -0400 | [diff] [blame] | 1607 | int ret = 0; |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1608 | |
Gregory Haskins | a22d7fc | 2008-01-25 21:08:12 +0100 | [diff] [blame] | 1609 | if (!rq->rt.overloaded) |
| 1610 | return 0; |
| 1611 | |
Gregory Haskins | 917b627 | 2008-12-29 09:39:53 -0500 | [diff] [blame] | 1612 | next_task = pick_next_pushable_task(rq); |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1613 | if (!next_task) |
| 1614 | return 0; |
| 1615 | |
Peter Zijlstra | 4924627 | 2010-10-17 21:46:10 +0200 | [diff] [blame] | 1616 | retry: |
Gregory Haskins | 697f0a4 | 2008-01-25 21:08:09 +0100 | [diff] [blame] | 1617 | if (unlikely(next_task == rq->curr)) { |
Steven Rostedt | f65eda4 | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 1618 | WARN_ON(1); |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1619 | return 0; |
Steven Rostedt | f65eda4 | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 1620 | } |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1621 | |
| 1622 | /* |
| 1623 | * It's possible that the next_task slipped in of |
| 1624 | * higher priority than current. If that's the case |
| 1625 | * just reschedule current. |
| 1626 | */ |
Gregory Haskins | 697f0a4 | 2008-01-25 21:08:09 +0100 | [diff] [blame] | 1627 | if (unlikely(next_task->prio < rq->curr->prio)) { |
| 1628 | resched_task(rq->curr); |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1629 | return 0; |
| 1630 | } |
| 1631 | |
Gregory Haskins | 697f0a4 | 2008-01-25 21:08:09 +0100 | [diff] [blame] | 1632 | /* We might release rq lock */ |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1633 | get_task_struct(next_task); |
| 1634 | |
| 1635 | /* find_lock_lowest_rq locks the rq if found */ |
Gregory Haskins | 697f0a4 | 2008-01-25 21:08:09 +0100 | [diff] [blame] | 1636 | lowest_rq = find_lock_lowest_rq(next_task, rq); |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1637 | if (!lowest_rq) { |
| 1638 | struct task_struct *task; |
| 1639 | /* |
Hillf Danton | 311e800 | 2011-06-16 21:55:20 -0400 | [diff] [blame] | 1640 | * find_lock_lowest_rq releases rq->lock |
Gregory Haskins | 1563513 | 2008-12-29 09:39:53 -0500 | [diff] [blame] | 1641 | * so it is possible that next_task has migrated. |
| 1642 | * |
| 1643 | * We need to make sure that the task is still on the same |
| 1644 | * run-queue and is also still the next task eligible for |
| 1645 | * pushing. |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1646 | */ |
Gregory Haskins | 917b627 | 2008-12-29 09:39:53 -0500 | [diff] [blame] | 1647 | task = pick_next_pushable_task(rq); |
Gregory Haskins | 1563513 | 2008-12-29 09:39:53 -0500 | [diff] [blame] | 1648 | if (task_cpu(next_task) == rq->cpu && task == next_task) { |
| 1649 | /* |
Hillf Danton | 311e800 | 2011-06-16 21:55:20 -0400 | [diff] [blame] | 1650 | * The task hasn't migrated, and is still the next |
| 1651 | * eligible task, but we failed to find a run-queue |
| 1652 | * to push it to. Do not retry in this case, since |
| 1653 | * other cpus will pull from us when ready. |
Gregory Haskins | 1563513 | 2008-12-29 09:39:53 -0500 | [diff] [blame] | 1654 | */ |
Gregory Haskins | 1563513 | 2008-12-29 09:39:53 -0500 | [diff] [blame] | 1655 | goto out; |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1656 | } |
Gregory Haskins | 917b627 | 2008-12-29 09:39:53 -0500 | [diff] [blame] | 1657 | |
Gregory Haskins | 1563513 | 2008-12-29 09:39:53 -0500 | [diff] [blame] | 1658 | if (!task) |
| 1659 | /* No more tasks, just exit */ |
| 1660 | goto out; |
| 1661 | |
Gregory Haskins | 917b627 | 2008-12-29 09:39:53 -0500 | [diff] [blame] | 1662 | /* |
Gregory Haskins | 1563513 | 2008-12-29 09:39:53 -0500 | [diff] [blame] | 1663 | * Something has shifted, try again. |
Gregory Haskins | 917b627 | 2008-12-29 09:39:53 -0500 | [diff] [blame] | 1664 | */ |
Gregory Haskins | 1563513 | 2008-12-29 09:39:53 -0500 | [diff] [blame] | 1665 | put_task_struct(next_task); |
| 1666 | next_task = task; |
| 1667 | goto retry; |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1668 | } |
| 1669 | |
Gregory Haskins | 697f0a4 | 2008-01-25 21:08:09 +0100 | [diff] [blame] | 1670 | deactivate_task(rq, next_task, 0); |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1671 | set_task_cpu(next_task, lowest_rq->cpu); |
| 1672 | activate_task(lowest_rq, next_task, 0); |
Hillf Danton | 311e800 | 2011-06-16 21:55:20 -0400 | [diff] [blame] | 1673 | ret = 1; |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1674 | |
| 1675 | resched_task(lowest_rq->curr); |
| 1676 | |
Peter Zijlstra | 1b12bbc | 2008-08-11 09:30:22 +0200 | [diff] [blame] | 1677 | double_unlock_balance(rq, lowest_rq); |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1678 | |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1679 | out: |
| 1680 | put_task_struct(next_task); |
| 1681 | |
Hillf Danton | 311e800 | 2011-06-16 21:55:20 -0400 | [diff] [blame] | 1682 | return ret; |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1683 | } |
| 1684 | |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1685 | static void push_rt_tasks(struct rq *rq) |
| 1686 | { |
| 1687 | /* push_rt_task will return true if it moved an RT */ |
| 1688 | while (push_rt_task(rq)) |
| 1689 | ; |
| 1690 | } |
| 1691 | |
Steven Rostedt | f65eda4 | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 1692 | static int pull_rt_task(struct rq *this_rq) |
| 1693 | { |
Ingo Molnar | 80bf317 | 2008-01-25 21:08:17 +0100 | [diff] [blame] | 1694 | int this_cpu = this_rq->cpu, ret = 0, cpu; |
Gregory Haskins | a872894 | 2008-12-29 09:39:49 -0500 | [diff] [blame] | 1695 | struct task_struct *p; |
Steven Rostedt | f65eda4 | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 1696 | struct rq *src_rq; |
Steven Rostedt | f65eda4 | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 1697 | |
Gregory Haskins | 637f508 | 2008-01-25 21:08:18 +0100 | [diff] [blame] | 1698 | if (likely(!rt_overloaded(this_rq))) |
Steven Rostedt | f65eda4 | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 1699 | return 0; |
| 1700 | |
Peter Zijlstra | 7c3f2ab | 2013-10-15 12:35:07 +0200 | [diff] [blame] | 1701 | /* |
| 1702 | * Match the barrier from rt_set_overloaded; this guarantees that if we |
| 1703 | * see overloaded we must also see the rto_mask bit. |
| 1704 | */ |
| 1705 | smp_rmb(); |
| 1706 | |
Rusty Russell | c6c4927 | 2008-11-25 02:35:05 +1030 | [diff] [blame] | 1707 | for_each_cpu(cpu, this_rq->rd->rto_mask) { |
Steven Rostedt | f65eda4 | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 1708 | if (this_cpu == cpu) |
| 1709 | continue; |
| 1710 | |
| 1711 | src_rq = cpu_rq(cpu); |
Gregory Haskins | 74ab8e4 | 2008-12-29 09:39:50 -0500 | [diff] [blame] | 1712 | |
| 1713 | /* |
| 1714 | * Don't bother taking the src_rq->lock if the next highest |
| 1715 | * task is known to be lower-priority than our current task. |
| 1716 | * This may look racy, but if this value is about to go |
| 1717 | * logically higher, the src_rq will push this task away. |
| 1718 | * And if its going logically lower, we do not care |
| 1719 | */ |
| 1720 | if (src_rq->rt.highest_prio.next >= |
| 1721 | this_rq->rt.highest_prio.curr) |
| 1722 | continue; |
| 1723 | |
Steven Rostedt | f65eda4 | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 1724 | /* |
| 1725 | * We can potentially drop this_rq's lock in |
| 1726 | * double_lock_balance, and another CPU could |
Gregory Haskins | a872894 | 2008-12-29 09:39:49 -0500 | [diff] [blame] | 1727 | * alter this_rq |
Steven Rostedt | f65eda4 | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 1728 | */ |
Gregory Haskins | a872894 | 2008-12-29 09:39:49 -0500 | [diff] [blame] | 1729 | double_lock_balance(this_rq, src_rq); |
Steven Rostedt | f65eda4 | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 1730 | |
| 1731 | /* |
Kirill Tkhai | e23ee74 | 2013-06-07 15:37:43 -0400 | [diff] [blame] | 1732 | * We can pull only a task, which is pushable |
| 1733 | * on its rq, and no others. |
Steven Rostedt | f65eda4 | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 1734 | */ |
Kirill Tkhai | e23ee74 | 2013-06-07 15:37:43 -0400 | [diff] [blame] | 1735 | p = pick_highest_pushable_task(src_rq, this_cpu); |
Steven Rostedt | f65eda4 | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 1736 | |
| 1737 | /* |
| 1738 | * Do we have an RT task that preempts |
| 1739 | * the to-be-scheduled task? |
| 1740 | */ |
Gregory Haskins | a872894 | 2008-12-29 09:39:49 -0500 | [diff] [blame] | 1741 | if (p && (p->prio < this_rq->rt.highest_prio.curr)) { |
Steven Rostedt | f65eda4 | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 1742 | WARN_ON(p == src_rq->curr); |
Peter Zijlstra | fd2f441 | 2011-04-05 17:23:44 +0200 | [diff] [blame] | 1743 | WARN_ON(!p->on_rq); |
Steven Rostedt | f65eda4 | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 1744 | |
| 1745 | /* |
| 1746 | * There's a chance that p is higher in priority |
| 1747 | * than what's currently running on its cpu. |
| 1748 | * This is just that p is wakeing up and hasn't |
| 1749 | * had a chance to schedule. We only pull |
| 1750 | * p if it is lower in priority than the |
Gregory Haskins | a872894 | 2008-12-29 09:39:49 -0500 | [diff] [blame] | 1751 | * current task on the run queue |
Steven Rostedt | f65eda4 | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 1752 | */ |
Gregory Haskins | a872894 | 2008-12-29 09:39:49 -0500 | [diff] [blame] | 1753 | if (p->prio < src_rq->curr->prio) |
Mike Galbraith | 614ee1f | 2008-01-25 21:08:30 +0100 | [diff] [blame] | 1754 | goto skip; |
Steven Rostedt | f65eda4 | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 1755 | |
| 1756 | ret = 1; |
| 1757 | |
| 1758 | deactivate_task(src_rq, p, 0); |
| 1759 | set_task_cpu(p, this_cpu); |
| 1760 | activate_task(this_rq, p, 0); |
| 1761 | /* |
| 1762 | * We continue with the search, just in |
| 1763 | * case there's an even higher prio task |
Lucas De Marchi | 25985ed | 2011-03-30 22:57:33 -0300 | [diff] [blame] | 1764 | * in another runqueue. (low likelihood |
Steven Rostedt | f65eda4 | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 1765 | * but possible) |
Steven Rostedt | f65eda4 | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 1766 | */ |
Steven Rostedt | f65eda4 | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 1767 | } |
Peter Zijlstra | 4924627 | 2010-10-17 21:46:10 +0200 | [diff] [blame] | 1768 | skip: |
Peter Zijlstra | 1b12bbc | 2008-08-11 09:30:22 +0200 | [diff] [blame] | 1769 | double_unlock_balance(this_rq, src_rq); |
Steven Rostedt | f65eda4 | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 1770 | } |
| 1771 | |
| 1772 | return ret; |
| 1773 | } |
| 1774 | |
Steven Rostedt | 9a897c5 | 2008-01-25 21:08:22 +0100 | [diff] [blame] | 1775 | static void post_schedule_rt(struct rq *rq) |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1776 | { |
Gregory Haskins | 967fc04 | 2008-12-29 09:39:52 -0500 | [diff] [blame] | 1777 | push_rt_tasks(rq); |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1778 | } |
| 1779 | |
Gregory Haskins | 8ae121a | 2008-04-23 07:13:29 -0400 | [diff] [blame] | 1780 | /* |
| 1781 | * If we are not running and we are not going to reschedule soon, we should |
| 1782 | * try to push tasks away now |
| 1783 | */ |
Peter Zijlstra | efbbd05 | 2009-12-16 18:04:40 +0100 | [diff] [blame] | 1784 | static void task_woken_rt(struct rq *rq, struct task_struct *p) |
Steven Rostedt | 4642daf | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 1785 | { |
Steven Rostedt | 9a897c5 | 2008-01-25 21:08:22 +0100 | [diff] [blame] | 1786 | if (!task_running(rq, p) && |
Gregory Haskins | 8ae121a | 2008-04-23 07:13:29 -0400 | [diff] [blame] | 1787 | !test_tsk_need_resched(rq->curr) && |
Gregory Haskins | 917b627 | 2008-12-29 09:39:53 -0500 | [diff] [blame] | 1788 | has_pushable_tasks(rq) && |
Peter Zijlstra | 29baa74 | 2012-04-23 12:11:21 +0200 | [diff] [blame] | 1789 | p->nr_cpus_allowed > 1 && |
Juri Lelli | 1baca4c | 2013-11-07 14:43:38 +0100 | [diff] [blame] | 1790 | (dl_task(rq->curr) || rt_task(rq->curr)) && |
Peter Zijlstra | 29baa74 | 2012-04-23 12:11:21 +0200 | [diff] [blame] | 1791 | (rq->curr->nr_cpus_allowed < 2 || |
Shawn Bohrer | 3be209a | 2011-09-12 09:28:04 -0500 | [diff] [blame] | 1792 | rq->curr->prio <= p->prio)) |
Steven Rostedt | 4642daf | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 1793 | push_rt_tasks(rq); |
| 1794 | } |
| 1795 | |
Mike Travis | cd8ba7c | 2008-03-26 14:23:49 -0700 | [diff] [blame] | 1796 | static void set_cpus_allowed_rt(struct task_struct *p, |
Rusty Russell | 96f874e | 2008-11-25 02:35:14 +1030 | [diff] [blame] | 1797 | const struct cpumask *new_mask) |
Gregory Haskins | 73fe6aa | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 1798 | { |
Kirill Tkhai | 8d3d5ad | 2012-04-11 09:06:04 +0400 | [diff] [blame] | 1799 | struct rq *rq; |
| 1800 | int weight; |
Gregory Haskins | 73fe6aa | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 1801 | |
| 1802 | BUG_ON(!rt_task(p)); |
| 1803 | |
Kirill Tkhai | 8d3d5ad | 2012-04-11 09:06:04 +0400 | [diff] [blame] | 1804 | if (!p->on_rq) |
| 1805 | return; |
| 1806 | |
| 1807 | weight = cpumask_weight(new_mask); |
| 1808 | |
Gregory Haskins | 73fe6aa | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 1809 | /* |
Kirill Tkhai | 8d3d5ad | 2012-04-11 09:06:04 +0400 | [diff] [blame] | 1810 | * Only update if the process changes its state from whether it |
| 1811 | * can migrate or not. |
Gregory Haskins | 73fe6aa | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 1812 | */ |
Peter Zijlstra | 29baa74 | 2012-04-23 12:11:21 +0200 | [diff] [blame] | 1813 | if ((p->nr_cpus_allowed > 1) == (weight > 1)) |
Kirill Tkhai | 8d3d5ad | 2012-04-11 09:06:04 +0400 | [diff] [blame] | 1814 | return; |
Gregory Haskins | 73fe6aa | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 1815 | |
Kirill Tkhai | 8d3d5ad | 2012-04-11 09:06:04 +0400 | [diff] [blame] | 1816 | rq = task_rq(p); |
Gregory Haskins | 917b627 | 2008-12-29 09:39:53 -0500 | [diff] [blame] | 1817 | |
Kirill Tkhai | 8d3d5ad | 2012-04-11 09:06:04 +0400 | [diff] [blame] | 1818 | /* |
| 1819 | * The process used to be able to migrate OR it can now migrate |
| 1820 | */ |
| 1821 | if (weight <= 1) { |
| 1822 | if (!task_current(rq, p)) |
| 1823 | dequeue_pushable_task(rq, p); |
| 1824 | BUG_ON(!rq->rt.rt_nr_migratory); |
| 1825 | rq->rt.rt_nr_migratory--; |
| 1826 | } else { |
| 1827 | if (!task_current(rq, p)) |
| 1828 | enqueue_pushable_task(rq, p); |
| 1829 | rq->rt.rt_nr_migratory++; |
Gregory Haskins | 73fe6aa | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 1830 | } |
Kirill Tkhai | 8d3d5ad | 2012-04-11 09:06:04 +0400 | [diff] [blame] | 1831 | |
| 1832 | update_rt_migration(&rq->rt); |
Gregory Haskins | 73fe6aa | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 1833 | } |
Ingo Molnar | deeeccd | 2008-01-25 21:08:15 +0100 | [diff] [blame] | 1834 | |
Ingo Molnar | bdd7c81 | 2008-01-25 21:08:18 +0100 | [diff] [blame] | 1835 | /* Assumes rq->lock is held */ |
Gregory Haskins | 1f11eb6 | 2008-06-04 15:04:05 -0400 | [diff] [blame] | 1836 | static void rq_online_rt(struct rq *rq) |
Ingo Molnar | bdd7c81 | 2008-01-25 21:08:18 +0100 | [diff] [blame] | 1837 | { |
| 1838 | if (rq->rt.overloaded) |
| 1839 | rt_set_overload(rq); |
Gregory Haskins | 6e0534f | 2008-05-12 21:21:01 +0200 | [diff] [blame] | 1840 | |
Peter Zijlstra | 7def2be | 2008-06-05 14:49:58 +0200 | [diff] [blame] | 1841 | __enable_runtime(rq); |
| 1842 | |
Gregory Haskins | e864c49 | 2008-12-29 09:39:49 -0500 | [diff] [blame] | 1843 | cpupri_set(&rq->rd->cpupri, rq->cpu, rq->rt.highest_prio.curr); |
Ingo Molnar | bdd7c81 | 2008-01-25 21:08:18 +0100 | [diff] [blame] | 1844 | } |
| 1845 | |
| 1846 | /* Assumes rq->lock is held */ |
Gregory Haskins | 1f11eb6 | 2008-06-04 15:04:05 -0400 | [diff] [blame] | 1847 | static void rq_offline_rt(struct rq *rq) |
Ingo Molnar | bdd7c81 | 2008-01-25 21:08:18 +0100 | [diff] [blame] | 1848 | { |
| 1849 | if (rq->rt.overloaded) |
| 1850 | rt_clear_overload(rq); |
Gregory Haskins | 6e0534f | 2008-05-12 21:21:01 +0200 | [diff] [blame] | 1851 | |
Peter Zijlstra | 7def2be | 2008-06-05 14:49:58 +0200 | [diff] [blame] | 1852 | __disable_runtime(rq); |
| 1853 | |
Gregory Haskins | 6e0534f | 2008-05-12 21:21:01 +0200 | [diff] [blame] | 1854 | cpupri_set(&rq->rd->cpupri, rq->cpu, CPUPRI_INVALID); |
Ingo Molnar | bdd7c81 | 2008-01-25 21:08:18 +0100 | [diff] [blame] | 1855 | } |
Steven Rostedt | cb46984 | 2008-01-25 21:08:22 +0100 | [diff] [blame] | 1856 | |
| 1857 | /* |
| 1858 | * When switch from the rt queue, we bring ourselves to a position |
| 1859 | * that we might want to pull RT tasks from other runqueues. |
| 1860 | */ |
Peter Zijlstra | da7a735 | 2011-01-17 17:03:27 +0100 | [diff] [blame] | 1861 | static void switched_from_rt(struct rq *rq, struct task_struct *p) |
Steven Rostedt | cb46984 | 2008-01-25 21:08:22 +0100 | [diff] [blame] | 1862 | { |
| 1863 | /* |
| 1864 | * If there are other RT tasks then we will reschedule |
| 1865 | * and the scheduling of the other RT tasks will handle |
| 1866 | * the balancing. But if we are the last RT task |
| 1867 | * we may need to handle the pulling of RT tasks |
| 1868 | * now. |
| 1869 | */ |
Kirill Tkhai | 1158ddb | 2012-11-23 00:02:15 +0400 | [diff] [blame] | 1870 | if (!p->on_rq || rq->rt.rt_nr_running) |
| 1871 | return; |
| 1872 | |
| 1873 | if (pull_rt_task(rq)) |
| 1874 | resched_task(rq->curr); |
Steven Rostedt | cb46984 | 2008-01-25 21:08:22 +0100 | [diff] [blame] | 1875 | } |
Rusty Russell | 3d8cbdf | 2008-11-25 09:58:41 +1030 | [diff] [blame] | 1876 | |
Li Zefan | 11c785b | 2014-02-08 14:17:45 +0800 | [diff] [blame] | 1877 | void __init init_sched_rt_class(void) |
Rusty Russell | 3d8cbdf | 2008-11-25 09:58:41 +1030 | [diff] [blame] | 1878 | { |
| 1879 | unsigned int i; |
| 1880 | |
Peter Zijlstra | 029632f | 2011-10-25 10:00:11 +0200 | [diff] [blame] | 1881 | for_each_possible_cpu(i) { |
Yinghai Lu | eaa9584 | 2009-06-06 14:51:36 -0700 | [diff] [blame] | 1882 | zalloc_cpumask_var_node(&per_cpu(local_cpu_mask, i), |
Mike Travis | 6ca09df | 2008-12-31 18:08:45 -0800 | [diff] [blame] | 1883 | GFP_KERNEL, cpu_to_node(i)); |
Peter Zijlstra | 029632f | 2011-10-25 10:00:11 +0200 | [diff] [blame] | 1884 | } |
Rusty Russell | 3d8cbdf | 2008-11-25 09:58:41 +1030 | [diff] [blame] | 1885 | } |
Steven Rostedt | e8fa136 | 2008-01-25 21:08:05 +0100 | [diff] [blame] | 1886 | #endif /* CONFIG_SMP */ |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1887 | |
Steven Rostedt | cb46984 | 2008-01-25 21:08:22 +0100 | [diff] [blame] | 1888 | /* |
| 1889 | * When switching a task to RT, we may overload the runqueue |
| 1890 | * with RT tasks. In this case we try to push them off to |
| 1891 | * other runqueues. |
| 1892 | */ |
Peter Zijlstra | da7a735 | 2011-01-17 17:03:27 +0100 | [diff] [blame] | 1893 | static void switched_to_rt(struct rq *rq, struct task_struct *p) |
Steven Rostedt | cb46984 | 2008-01-25 21:08:22 +0100 | [diff] [blame] | 1894 | { |
| 1895 | int check_resched = 1; |
| 1896 | |
| 1897 | /* |
| 1898 | * If we are already running, then there's nothing |
| 1899 | * that needs to be done. But if we are not running |
| 1900 | * we may need to preempt the current running task. |
| 1901 | * If that current running task is also an RT task |
| 1902 | * then see if we can move to another run queue. |
| 1903 | */ |
Peter Zijlstra | fd2f441 | 2011-04-05 17:23:44 +0200 | [diff] [blame] | 1904 | if (p->on_rq && rq->curr != p) { |
Steven Rostedt | cb46984 | 2008-01-25 21:08:22 +0100 | [diff] [blame] | 1905 | #ifdef CONFIG_SMP |
Kirill V Tkhai | 1044791 | 2014-03-12 06:18:33 -0400 | [diff] [blame] | 1906 | if (p->nr_cpus_allowed > 1 && rq->rt.overloaded && |
Steven Rostedt | cb46984 | 2008-01-25 21:08:22 +0100 | [diff] [blame] | 1907 | /* Don't resched if we changed runqueues */ |
Kirill V Tkhai | 1044791 | 2014-03-12 06:18:33 -0400 | [diff] [blame] | 1908 | push_rt_task(rq) && rq != task_rq(p)) |
Steven Rostedt | cb46984 | 2008-01-25 21:08:22 +0100 | [diff] [blame] | 1909 | check_resched = 0; |
| 1910 | #endif /* CONFIG_SMP */ |
| 1911 | if (check_resched && p->prio < rq->curr->prio) |
| 1912 | resched_task(rq->curr); |
| 1913 | } |
| 1914 | } |
| 1915 | |
| 1916 | /* |
| 1917 | * Priority of the task has changed. This may cause |
| 1918 | * us to initiate a push or pull. |
| 1919 | */ |
Peter Zijlstra | da7a735 | 2011-01-17 17:03:27 +0100 | [diff] [blame] | 1920 | static void |
| 1921 | prio_changed_rt(struct rq *rq, struct task_struct *p, int oldprio) |
Steven Rostedt | cb46984 | 2008-01-25 21:08:22 +0100 | [diff] [blame] | 1922 | { |
Peter Zijlstra | fd2f441 | 2011-04-05 17:23:44 +0200 | [diff] [blame] | 1923 | if (!p->on_rq) |
Peter Zijlstra | da7a735 | 2011-01-17 17:03:27 +0100 | [diff] [blame] | 1924 | return; |
| 1925 | |
| 1926 | if (rq->curr == p) { |
Steven Rostedt | cb46984 | 2008-01-25 21:08:22 +0100 | [diff] [blame] | 1927 | #ifdef CONFIG_SMP |
| 1928 | /* |
| 1929 | * If our priority decreases while running, we |
| 1930 | * may need to pull tasks to this runqueue. |
| 1931 | */ |
| 1932 | if (oldprio < p->prio) |
| 1933 | pull_rt_task(rq); |
| 1934 | /* |
| 1935 | * If there's a higher priority task waiting to run |
Steven Rostedt | 6fa46fa | 2008-03-05 10:00:12 -0500 | [diff] [blame] | 1936 | * then reschedule. Note, the above pull_rt_task |
| 1937 | * can release the rq lock and p could migrate. |
| 1938 | * Only reschedule if p is still on the same runqueue. |
Steven Rostedt | cb46984 | 2008-01-25 21:08:22 +0100 | [diff] [blame] | 1939 | */ |
Gregory Haskins | e864c49 | 2008-12-29 09:39:49 -0500 | [diff] [blame] | 1940 | if (p->prio > rq->rt.highest_prio.curr && rq->curr == p) |
Steven Rostedt | cb46984 | 2008-01-25 21:08:22 +0100 | [diff] [blame] | 1941 | resched_task(p); |
| 1942 | #else |
| 1943 | /* For UP simply resched on drop of prio */ |
| 1944 | if (oldprio < p->prio) |
| 1945 | resched_task(p); |
| 1946 | #endif /* CONFIG_SMP */ |
| 1947 | } else { |
| 1948 | /* |
| 1949 | * This task is not running, but if it is |
| 1950 | * greater than the current running task |
| 1951 | * then reschedule. |
| 1952 | */ |
| 1953 | if (p->prio < rq->curr->prio) |
| 1954 | resched_task(rq->curr); |
| 1955 | } |
| 1956 | } |
| 1957 | |
Peter Zijlstra | 78f2c7d | 2008-01-25 21:08:27 +0100 | [diff] [blame] | 1958 | static void watchdog(struct rq *rq, struct task_struct *p) |
| 1959 | { |
| 1960 | unsigned long soft, hard; |
| 1961 | |
Jiri Slaby | 78d7d40 | 2010-03-05 13:42:54 -0800 | [diff] [blame] | 1962 | /* max may change after cur was read, this will be fixed next tick */ |
| 1963 | soft = task_rlimit(p, RLIMIT_RTTIME); |
| 1964 | hard = task_rlimit_max(p, RLIMIT_RTTIME); |
Peter Zijlstra | 78f2c7d | 2008-01-25 21:08:27 +0100 | [diff] [blame] | 1965 | |
| 1966 | if (soft != RLIM_INFINITY) { |
| 1967 | unsigned long next; |
| 1968 | |
Ying Xue | 57d2aa0 | 2012-07-17 15:03:43 +0800 | [diff] [blame] | 1969 | if (p->rt.watchdog_stamp != jiffies) { |
| 1970 | p->rt.timeout++; |
| 1971 | p->rt.watchdog_stamp = jiffies; |
| 1972 | } |
| 1973 | |
Peter Zijlstra | 78f2c7d | 2008-01-25 21:08:27 +0100 | [diff] [blame] | 1974 | next = DIV_ROUND_UP(min(soft, hard), USEC_PER_SEC/HZ); |
Peter Zijlstra | 5a52dd5 | 2008-01-25 21:08:32 +0100 | [diff] [blame] | 1975 | if (p->rt.timeout > next) |
Frank Mayhar | f06febc | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 1976 | p->cputime_expires.sched_exp = p->se.sum_exec_runtime; |
Peter Zijlstra | 78f2c7d | 2008-01-25 21:08:27 +0100 | [diff] [blame] | 1977 | } |
| 1978 | } |
Steven Rostedt | cb46984 | 2008-01-25 21:08:22 +0100 | [diff] [blame] | 1979 | |
Peter Zijlstra | 8f4d37e | 2008-01-25 21:08:29 +0100 | [diff] [blame] | 1980 | static void task_tick_rt(struct rq *rq, struct task_struct *p, int queued) |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1981 | { |
Colin Cross | 454c799 | 2012-05-16 21:34:23 -0700 | [diff] [blame] | 1982 | struct sched_rt_entity *rt_se = &p->rt; |
| 1983 | |
Peter Zijlstra | 67e2be0 | 2007-12-20 15:01:17 +0100 | [diff] [blame] | 1984 | update_curr_rt(rq); |
| 1985 | |
Peter Zijlstra | 78f2c7d | 2008-01-25 21:08:27 +0100 | [diff] [blame] | 1986 | watchdog(rq, p); |
| 1987 | |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1988 | /* |
| 1989 | * RR tasks need a special form of timeslice management. |
| 1990 | * FIFO tasks have no timeslices. |
| 1991 | */ |
| 1992 | if (p->policy != SCHED_RR) |
| 1993 | return; |
| 1994 | |
Peter Zijlstra | fa71706 | 2008-01-25 21:08:27 +0100 | [diff] [blame] | 1995 | if (--p->rt.time_slice) |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1996 | return; |
| 1997 | |
Clark Williams | ce0dbbb | 2013-02-07 09:47:04 -0600 | [diff] [blame] | 1998 | p->rt.time_slice = sched_rr_timeslice; |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1999 | |
Dmitry Adamushko | 98fbc79 | 2007-08-24 20:39:10 +0200 | [diff] [blame] | 2000 | /* |
Li Bin | e9aa39b | 2013-10-21 20:15:43 +0800 | [diff] [blame] | 2001 | * Requeue to the end of queue if we (and all of our ancestors) are not |
| 2002 | * the only element on the queue |
Dmitry Adamushko | 98fbc79 | 2007-08-24 20:39:10 +0200 | [diff] [blame] | 2003 | */ |
Colin Cross | 454c799 | 2012-05-16 21:34:23 -0700 | [diff] [blame] | 2004 | for_each_sched_rt_entity(rt_se) { |
| 2005 | if (rt_se->run_list.prev != rt_se->run_list.next) { |
| 2006 | requeue_task_rt(rq, p, 0); |
| 2007 | set_tsk_need_resched(p); |
| 2008 | return; |
| 2009 | } |
Dmitry Adamushko | 98fbc79 | 2007-08-24 20:39:10 +0200 | [diff] [blame] | 2010 | } |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 2011 | } |
| 2012 | |
Srivatsa Vaddagiri | 83b699e | 2007-10-15 17:00:08 +0200 | [diff] [blame] | 2013 | static void set_curr_task_rt(struct rq *rq) |
| 2014 | { |
| 2015 | struct task_struct *p = rq->curr; |
| 2016 | |
Frederic Weisbecker | 78becc2 | 2013-04-12 01:51:02 +0200 | [diff] [blame] | 2017 | p->se.exec_start = rq_clock_task(rq); |
Gregory Haskins | 917b627 | 2008-12-29 09:39:53 -0500 | [diff] [blame] | 2018 | |
| 2019 | /* The running task is never eligible for pushing */ |
| 2020 | dequeue_pushable_task(rq, p); |
Srivatsa Vaddagiri | 83b699e | 2007-10-15 17:00:08 +0200 | [diff] [blame] | 2021 | } |
| 2022 | |
H Hartley Sweeten | 6d686f4 | 2010-01-13 20:21:52 -0700 | [diff] [blame] | 2023 | static unsigned int get_rr_interval_rt(struct rq *rq, struct task_struct *task) |
Peter Williams | 0d721ce | 2009-09-21 01:31:53 +0000 | [diff] [blame] | 2024 | { |
| 2025 | /* |
| 2026 | * Time slice is 0 for SCHED_FIFO tasks |
| 2027 | */ |
| 2028 | if (task->policy == SCHED_RR) |
Clark Williams | ce0dbbb | 2013-02-07 09:47:04 -0600 | [diff] [blame] | 2029 | return sched_rr_timeslice; |
Peter Williams | 0d721ce | 2009-09-21 01:31:53 +0000 | [diff] [blame] | 2030 | else |
| 2031 | return 0; |
| 2032 | } |
| 2033 | |
Peter Zijlstra | 029632f | 2011-10-25 10:00:11 +0200 | [diff] [blame] | 2034 | const struct sched_class rt_sched_class = { |
Ingo Molnar | 5522d5d | 2007-10-15 17:00:12 +0200 | [diff] [blame] | 2035 | .next = &fair_sched_class, |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 2036 | .enqueue_task = enqueue_task_rt, |
| 2037 | .dequeue_task = dequeue_task_rt, |
| 2038 | .yield_task = yield_task_rt, |
| 2039 | |
| 2040 | .check_preempt_curr = check_preempt_curr_rt, |
| 2041 | |
| 2042 | .pick_next_task = pick_next_task_rt, |
| 2043 | .put_prev_task = put_prev_task_rt, |
| 2044 | |
Peter Williams | 681f3e6 | 2007-10-24 18:23:51 +0200 | [diff] [blame] | 2045 | #ifdef CONFIG_SMP |
Li Zefan | 4ce72a2 | 2008-10-22 15:25:26 +0800 | [diff] [blame] | 2046 | .select_task_rq = select_task_rq_rt, |
| 2047 | |
Gregory Haskins | 73fe6aa | 2008-01-25 21:08:07 +0100 | [diff] [blame] | 2048 | .set_cpus_allowed = set_cpus_allowed_rt, |
Gregory Haskins | 1f11eb6 | 2008-06-04 15:04:05 -0400 | [diff] [blame] | 2049 | .rq_online = rq_online_rt, |
| 2050 | .rq_offline = rq_offline_rt, |
Steven Rostedt | 9a897c5 | 2008-01-25 21:08:22 +0100 | [diff] [blame] | 2051 | .post_schedule = post_schedule_rt, |
Peter Zijlstra | efbbd05 | 2009-12-16 18:04:40 +0100 | [diff] [blame] | 2052 | .task_woken = task_woken_rt, |
Steven Rostedt | cb46984 | 2008-01-25 21:08:22 +0100 | [diff] [blame] | 2053 | .switched_from = switched_from_rt, |
Peter Williams | 681f3e6 | 2007-10-24 18:23:51 +0200 | [diff] [blame] | 2054 | #endif |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 2055 | |
Srivatsa Vaddagiri | 83b699e | 2007-10-15 17:00:08 +0200 | [diff] [blame] | 2056 | .set_curr_task = set_curr_task_rt, |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 2057 | .task_tick = task_tick_rt, |
Steven Rostedt | cb46984 | 2008-01-25 21:08:22 +0100 | [diff] [blame] | 2058 | |
Peter Williams | 0d721ce | 2009-09-21 01:31:53 +0000 | [diff] [blame] | 2059 | .get_rr_interval = get_rr_interval_rt, |
| 2060 | |
Steven Rostedt | cb46984 | 2008-01-25 21:08:22 +0100 | [diff] [blame] | 2061 | .prio_changed = prio_changed_rt, |
| 2062 | .switched_to = switched_to_rt, |
Ingo Molnar | bb44e5d | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 2063 | }; |
Peter Zijlstra | ada18de | 2008-06-19 14:22:24 +0200 | [diff] [blame] | 2064 | |
| 2065 | #ifdef CONFIG_SCHED_DEBUG |
| 2066 | extern void print_rt_rq(struct seq_file *m, int cpu, struct rt_rq *rt_rq); |
| 2067 | |
Peter Zijlstra | 029632f | 2011-10-25 10:00:11 +0200 | [diff] [blame] | 2068 | void print_rt_stats(struct seq_file *m, int cpu) |
Peter Zijlstra | ada18de | 2008-06-19 14:22:24 +0200 | [diff] [blame] | 2069 | { |
Cheng Xu | ec514c4 | 2011-05-14 14:20:02 +0800 | [diff] [blame] | 2070 | rt_rq_iter_t iter; |
Peter Zijlstra | ada18de | 2008-06-19 14:22:24 +0200 | [diff] [blame] | 2071 | struct rt_rq *rt_rq; |
| 2072 | |
| 2073 | rcu_read_lock(); |
Cheng Xu | ec514c4 | 2011-05-14 14:20:02 +0800 | [diff] [blame] | 2074 | for_each_rt_rq(rt_rq, iter, cpu_rq(cpu)) |
Peter Zijlstra | ada18de | 2008-06-19 14:22:24 +0200 | [diff] [blame] | 2075 | print_rt_rq(m, cpu, rt_rq); |
| 2076 | rcu_read_unlock(); |
| 2077 | } |
Dhaval Giani | 55e12e5 | 2008-06-24 23:39:43 +0530 | [diff] [blame] | 2078 | #endif /* CONFIG_SCHED_DEBUG */ |