Lines Matching refs:rq
123 static inline struct rq *rq_of_rt_rq(struct rt_rq *rt_rq) in rq_of_rt_rq()
125 return rt_rq->rq; in rq_of_rt_rq()
133 static inline struct rq *rq_of_rt_se(struct sched_rt_entity *rt_se) in rq_of_rt_se()
137 return rt_rq->rq; in rq_of_rt_se()
162 struct rq *rq = cpu_rq(cpu); in init_tg_rt_entry() local
166 rt_rq->rq = rq; in init_tg_rt_entry()
176 rt_se->rt_rq = &rq->rt; in init_tg_rt_entry()
234 static inline struct rq *rq_of_rt_rq(struct rt_rq *rt_rq) in rq_of_rt_rq()
236 return container_of(rt_rq, struct rq, rt); in rq_of_rt_rq()
239 static inline struct rq *rq_of_rt_se(struct sched_rt_entity *rt_se) in rq_of_rt_se()
248 struct rq *rq = rq_of_rt_se(rt_se); in rt_rq_of_se() local
250 return &rq->rt; in rt_rq_of_se()
263 static void pull_rt_task(struct rq *this_rq);
265 static inline bool need_pull_rt_task(struct rq *rq, struct task_struct *prev) in need_pull_rt_task() argument
268 return rq->rt.highest_prio.curr > prev->prio; in need_pull_rt_task()
271 static inline int rt_overloaded(struct rq *rq) in rt_overloaded() argument
273 return atomic_read(&rq->rd->rto_count); in rt_overloaded()
276 static inline void rt_set_overload(struct rq *rq) in rt_set_overload() argument
278 if (!rq->online) in rt_set_overload()
281 cpumask_set_cpu(rq->cpu, rq->rd->rto_mask); in rt_set_overload()
292 atomic_inc(&rq->rd->rto_count); in rt_set_overload()
295 static inline void rt_clear_overload(struct rq *rq) in rt_clear_overload() argument
297 if (!rq->online) in rt_clear_overload()
301 atomic_dec(&rq->rd->rto_count); in rt_clear_overload()
302 cpumask_clear_cpu(rq->cpu, rq->rd->rto_mask); in rt_clear_overload()
352 static inline int has_pushable_tasks(struct rq *rq) in has_pushable_tasks() argument
354 return !plist_head_empty(&rq->rt.pushable_tasks); in has_pushable_tasks()
360 static void push_rt_tasks(struct rq *);
361 static void pull_rt_task(struct rq *);
363 static inline void rt_queue_push_tasks(struct rq *rq) in rt_queue_push_tasks() argument
365 if (!has_pushable_tasks(rq)) in rt_queue_push_tasks()
368 queue_balance_callback(rq, &per_cpu(rt_push_head, rq->cpu), push_rt_tasks); in rt_queue_push_tasks()
371 static inline void rt_queue_pull_task(struct rq *rq) in rt_queue_pull_task() argument
373 queue_balance_callback(rq, &per_cpu(rt_pull_head, rq->cpu), pull_rt_task); in rt_queue_pull_task()
376 static void enqueue_pushable_task(struct rq *rq, struct task_struct *p) in enqueue_pushable_task() argument
378 plist_del(&p->pushable_tasks, &rq->rt.pushable_tasks); in enqueue_pushable_task()
380 plist_add(&p->pushable_tasks, &rq->rt.pushable_tasks); in enqueue_pushable_task()
383 if (p->prio < rq->rt.highest_prio.next) in enqueue_pushable_task()
384 rq->rt.highest_prio.next = p->prio; in enqueue_pushable_task()
387 static void dequeue_pushable_task(struct rq *rq, struct task_struct *p) in dequeue_pushable_task() argument
389 plist_del(&p->pushable_tasks, &rq->rt.pushable_tasks); in dequeue_pushable_task()
392 if (has_pushable_tasks(rq)) { in dequeue_pushable_task()
393 p = plist_first_entry(&rq->rt.pushable_tasks, in dequeue_pushable_task()
395 rq->rt.highest_prio.next = p->prio; in dequeue_pushable_task()
397 rq->rt.highest_prio.next = MAX_RT_PRIO; in dequeue_pushable_task()
402 static inline void enqueue_pushable_task(struct rq *rq, struct task_struct *p) in enqueue_pushable_task() argument
406 static inline void dequeue_pushable_task(struct rq *rq, struct task_struct *p) in dequeue_pushable_task() argument
420 static inline bool need_pull_rt_task(struct rq *rq, struct task_struct *prev) in need_pull_rt_task() argument
425 static inline void pull_rt_task(struct rq *this_rq) in pull_rt_task()
429 static inline void rt_queue_push_tasks(struct rq *rq) in rt_queue_push_tasks() argument
511 #define for_each_rt_rq(rt_rq, iter, rq) \ argument
514 (rt_rq = iter->rt_rq[cpu_of(rq)]);)
530 struct rq *rq = rq_of_rt_rq(rt_rq); in sched_rt_rq_enqueue() local
533 int cpu = cpu_of(rq); in sched_rt_rq_enqueue()
544 resched_curr(rq); in sched_rt_rq_enqueue()
618 #define for_each_rt_rq(rt_rq, iter, rq) \ argument
619 for ((void) iter, rt_rq = &rq->rt; rt_rq; rt_rq = NULL)
631 struct rq *rq = rq_of_rt_rq(rt_rq); in sched_rt_rq_enqueue() local
637 resched_curr(rq); in sched_rt_rq_enqueue()
732 static void __disable_runtime(struct rq *rq) in __disable_runtime() argument
734 struct root_domain *rd = rq->rd; in __disable_runtime()
741 for_each_rt_rq(rt_rq, iter, rq) { in __disable_runtime()
814 static void __enable_runtime(struct rq *rq) in __enable_runtime() argument
825 for_each_rt_rq(rt_rq, iter, rq) { in __enable_runtime()
875 struct rq *rq = rq_of_rt_rq(rt_rq); in do_sched_rt_period_timer() local
890 raw_spin_lock(&rq->lock); in do_sched_rt_period_timer()
891 update_rq_clock(rq); in do_sched_rt_period_timer()
912 if (rt_rq->rt_nr_running && rq->curr == rq->idle) in do_sched_rt_period_timer()
913 rq_clock_cancel_skipupdate(rq); in do_sched_rt_period_timer()
928 raw_spin_unlock(&rq->lock); in do_sched_rt_period_timer()
996 static void update_curr_rt(struct rq *rq) in update_curr_rt() argument
998 struct task_struct *curr = rq->curr; in update_curr_rt()
1006 now = rq_clock_task(rq); in update_curr_rt()
1030 resched_curr(rq); in update_curr_rt()
1039 struct rq *rq = rq_of_rt_rq(rt_rq); in dequeue_top_rt_rq() local
1041 BUG_ON(&rq->rt != rt_rq); in dequeue_top_rt_rq()
1046 BUG_ON(!rq->nr_running); in dequeue_top_rt_rq()
1048 sub_nr_running(rq, rt_rq->rt_nr_running); in dequeue_top_rt_rq()
1056 struct rq *rq = rq_of_rt_rq(rt_rq); in enqueue_top_rt_rq() local
1058 BUG_ON(&rq->rt != rt_rq); in enqueue_top_rt_rq()
1067 add_nr_running(rq, rt_rq->rt_nr_running); in enqueue_top_rt_rq()
1072 cpufreq_update_util(rq, 0); in enqueue_top_rt_rq()
1080 struct rq *rq = rq_of_rt_rq(rt_rq); in inc_rt_prio_smp() local
1086 if (&rq->rt != rt_rq) in inc_rt_prio_smp()
1089 if (rq->online && prio < prev_prio) in inc_rt_prio_smp()
1090 cpupri_set(&rq->rd->cpupri, rq->cpu, prio); in inc_rt_prio_smp()
1096 struct rq *rq = rq_of_rt_rq(rt_rq); in dec_rt_prio_smp() local
1102 if (&rq->rt != rt_rq) in dec_rt_prio_smp()
1105 if (rq->online && rt_rq->highest_prio.curr != prev_prio) in dec_rt_prio_smp()
1106 cpupri_set(&rq->rd->cpupri, rq->cpu, rt_rq->highest_prio.curr); in dec_rt_prio_smp()
1343 struct rq *rq = rq_of_rt_se(rt_se); in enqueue_rt_entity() local
1348 enqueue_top_rt_rq(&rq->rt); in enqueue_rt_entity()
1353 struct rq *rq = rq_of_rt_se(rt_se); in dequeue_rt_entity() local
1363 enqueue_top_rt_rq(&rq->rt); in dequeue_rt_entity()
1370 enqueue_task_rt(struct rq *rq, struct task_struct *p, int flags) in enqueue_task_rt() argument
1379 if (!task_current(rq, p) && p->nr_cpus_allowed > 1) in enqueue_task_rt()
1380 enqueue_pushable_task(rq, p); in enqueue_task_rt()
1383 static void dequeue_task_rt(struct rq *rq, struct task_struct *p, int flags) in dequeue_task_rt() argument
1387 update_curr_rt(rq); in dequeue_task_rt()
1390 dequeue_pushable_task(rq, p); in dequeue_task_rt()
1411 static void requeue_task_rt(struct rq *rq, struct task_struct *p, int head) in requeue_task_rt() argument
1422 static void yield_task_rt(struct rq *rq) in yield_task_rt() argument
1424 requeue_task_rt(rq, rq->curr, 0); in yield_task_rt()
1434 struct rq *rq; in select_task_rq_rt() local
1441 rq = cpu_rq(cpu); in select_task_rq_rt()
1444 curr = READ_ONCE(rq->curr); /* unlocked access */ in select_task_rq_rt()
1502 static void check_preempt_equal_prio(struct rq *rq, struct task_struct *p) in check_preempt_equal_prio() argument
1508 if (rq->curr->nr_cpus_allowed == 1 || in check_preempt_equal_prio()
1509 !cpupri_find(&rq->rd->cpupri, rq->curr, NULL)) in check_preempt_equal_prio()
1517 cpupri_find(&rq->rd->cpupri, p, NULL)) in check_preempt_equal_prio()
1525 requeue_task_rt(rq, p, 1); in check_preempt_equal_prio()
1526 resched_curr(rq); in check_preempt_equal_prio()
1529 static int balance_rt(struct rq *rq, struct task_struct *p, struct rq_flags *rf) in balance_rt() argument
1531 if (!on_rt_rq(&p->rt) && need_pull_rt_task(rq, p)) { in balance_rt()
1538 rq_unpin_lock(rq, rf); in balance_rt()
1539 pull_rt_task(rq); in balance_rt()
1540 rq_repin_lock(rq, rf); in balance_rt()
1543 return sched_stop_runnable(rq) || sched_dl_runnable(rq) || sched_rt_runnable(rq); in balance_rt()
1550 static void check_preempt_curr_rt(struct rq *rq, struct task_struct *p, int flags) in check_preempt_curr_rt() argument
1552 if (p->prio < rq->curr->prio) { in check_preempt_curr_rt()
1553 resched_curr(rq); in check_preempt_curr_rt()
1570 if (p->prio == rq->curr->prio && !test_tsk_need_resched(rq->curr)) in check_preempt_curr_rt()
1571 check_preempt_equal_prio(rq, p); in check_preempt_curr_rt()
1575 static inline void set_next_task_rt(struct rq *rq, struct task_struct *p, bool first) in set_next_task_rt() argument
1577 p->se.exec_start = rq_clock_task(rq); in set_next_task_rt()
1580 dequeue_pushable_task(rq, p); in set_next_task_rt()
1590 if (rq->curr->sched_class != &rt_sched_class) in set_next_task_rt()
1591 update_rt_rq_load_avg(rq_clock_pelt(rq), rq, 0); in set_next_task_rt()
1593 rt_queue_push_tasks(rq); in set_next_task_rt()
1596 static struct sched_rt_entity *pick_next_rt_entity(struct rq *rq, in pick_next_rt_entity() argument
1613 static struct task_struct *_pick_next_task_rt(struct rq *rq) in _pick_next_task_rt() argument
1616 struct rt_rq *rt_rq = &rq->rt; in _pick_next_task_rt()
1619 rt_se = pick_next_rt_entity(rq, rt_rq); in _pick_next_task_rt()
1627 static struct task_struct *pick_next_task_rt(struct rq *rq) in pick_next_task_rt() argument
1631 if (!sched_rt_runnable(rq)) in pick_next_task_rt()
1634 p = _pick_next_task_rt(rq); in pick_next_task_rt()
1635 set_next_task_rt(rq, p, true); in pick_next_task_rt()
1639 static void put_prev_task_rt(struct rq *rq, struct task_struct *p) in put_prev_task_rt() argument
1641 update_curr_rt(rq); in put_prev_task_rt()
1643 update_rt_rq_load_avg(rq_clock_pelt(rq), rq, 1); in put_prev_task_rt()
1650 enqueue_pushable_task(rq, p); in put_prev_task_rt()
1658 static int pick_rt_task(struct rq *rq, struct task_struct *p, int cpu) in pick_rt_task() argument
1660 if (!task_running(rq, p) && in pick_rt_task()
1671 static struct task_struct *pick_highest_pushable_task(struct rq *rq, int cpu) in pick_highest_pushable_task() argument
1673 struct plist_head *head = &rq->rt.pushable_tasks; in pick_highest_pushable_task()
1676 if (!has_pushable_tasks(rq)) in pick_highest_pushable_task()
1680 if (pick_rt_task(rq, p, cpu)) in pick_highest_pushable_task()
1781 static struct rq *find_lock_lowest_rq(struct task_struct *task, struct rq *rq) in find_lock_lowest_rq() argument
1783 struct rq *lowest_rq = NULL; in find_lock_lowest_rq()
1790 if ((cpu == -1) || (cpu == rq->cpu)) in find_lock_lowest_rq()
1806 if (double_lock_balance(rq, lowest_rq)) { in find_lock_lowest_rq()
1813 if (unlikely(task_rq(task) != rq || in find_lock_lowest_rq()
1815 task_running(rq, task) || in find_lock_lowest_rq()
1819 double_unlock_balance(rq, lowest_rq); in find_lock_lowest_rq()
1830 double_unlock_balance(rq, lowest_rq); in find_lock_lowest_rq()
1837 static struct task_struct *pick_next_pushable_task(struct rq *rq) in pick_next_pushable_task() argument
1841 if (!has_pushable_tasks(rq)) in pick_next_pushable_task()
1844 p = plist_first_entry(&rq->rt.pushable_tasks, in pick_next_pushable_task()
1847 BUG_ON(rq->cpu != task_cpu(p)); in pick_next_pushable_task()
1848 BUG_ON(task_current(rq, p)); in pick_next_pushable_task()
1862 static int push_rt_task(struct rq *rq) in push_rt_task() argument
1865 struct rq *lowest_rq; in push_rt_task()
1868 if (!rq->rt.overloaded) in push_rt_task()
1871 next_task = pick_next_pushable_task(rq); in push_rt_task()
1876 if (WARN_ON(next_task == rq->curr)) in push_rt_task()
1884 if (unlikely(next_task->prio < rq->curr->prio)) { in push_rt_task()
1885 resched_curr(rq); in push_rt_task()
1893 lowest_rq = find_lock_lowest_rq(next_task, rq); in push_rt_task()
1904 task = pick_next_pushable_task(rq); in push_rt_task()
1927 deactivate_task(rq, next_task, 0); in push_rt_task()
1934 double_unlock_balance(rq, lowest_rq); in push_rt_task()
1942 static void push_rt_tasks(struct rq *rq) in push_rt_tasks() argument
1945 while (push_rt_task(rq)) in push_rt_tasks()
2049 static void tell_cpu_to_push(struct rq *rq) in tell_cpu_to_push() argument
2054 atomic_inc(&rq->rd->rto_loop_next); in tell_cpu_to_push()
2057 if (!rto_start_trylock(&rq->rd->rto_loop_start)) in tell_cpu_to_push()
2060 raw_spin_lock(&rq->rd->rto_lock); in tell_cpu_to_push()
2068 if (rq->rd->rto_cpu < 0) in tell_cpu_to_push()
2069 cpu = rto_next_cpu(rq->rd); in tell_cpu_to_push()
2071 raw_spin_unlock(&rq->rd->rto_lock); in tell_cpu_to_push()
2073 rto_start_unlock(&rq->rd->rto_loop_start); in tell_cpu_to_push()
2077 sched_get_rd(rq->rd); in tell_cpu_to_push()
2078 irq_work_queue_on(&rq->rd->rto_push_work, cpu); in tell_cpu_to_push()
2087 struct rq *rq; in rto_push_irq_work_func() local
2090 rq = this_rq(); in rto_push_irq_work_func()
2096 if (has_pushable_tasks(rq)) { in rto_push_irq_work_func()
2097 raw_spin_lock(&rq->lock); in rto_push_irq_work_func()
2098 push_rt_tasks(rq); in rto_push_irq_work_func()
2099 raw_spin_unlock(&rq->lock); in rto_push_irq_work_func()
2119 static void pull_rt_task(struct rq *this_rq) in pull_rt_task()
2124 struct rq *src_rq; in pull_rt_task()
2221 static void task_woken_rt(struct rq *rq, struct task_struct *p) in task_woken_rt() argument
2223 bool need_to_push = !task_running(rq, p) && in task_woken_rt()
2224 !test_tsk_need_resched(rq->curr) && in task_woken_rt()
2226 (dl_task(rq->curr) || rt_task(rq->curr)) && in task_woken_rt()
2227 (rq->curr->nr_cpus_allowed < 2 || in task_woken_rt()
2228 rq->curr->prio <= p->prio); in task_woken_rt()
2231 push_rt_tasks(rq); in task_woken_rt()
2235 static void rq_online_rt(struct rq *rq) in rq_online_rt() argument
2237 if (rq->rt.overloaded) in rq_online_rt()
2238 rt_set_overload(rq); in rq_online_rt()
2240 __enable_runtime(rq); in rq_online_rt()
2242 cpupri_set(&rq->rd->cpupri, rq->cpu, rq->rt.highest_prio.curr); in rq_online_rt()
2246 static void rq_offline_rt(struct rq *rq) in rq_offline_rt() argument
2248 if (rq->rt.overloaded) in rq_offline_rt()
2249 rt_clear_overload(rq); in rq_offline_rt()
2251 __disable_runtime(rq); in rq_offline_rt()
2253 cpupri_set(&rq->rd->cpupri, rq->cpu, CPUPRI_INVALID); in rq_offline_rt()
2260 static void switched_from_rt(struct rq *rq, struct task_struct *p) in switched_from_rt() argument
2269 if (!task_on_rq_queued(p) || rq->rt.rt_nr_running) in switched_from_rt()
2272 rt_queue_pull_task(rq); in switched_from_rt()
2291 static void switched_to_rt(struct rq *rq, struct task_struct *p) in switched_to_rt() argument
2300 if (task_on_rq_queued(p) && rq->curr != p) { in switched_to_rt()
2302 if (p->nr_cpus_allowed > 1 && rq->rt.overloaded) in switched_to_rt()
2303 rt_queue_push_tasks(rq); in switched_to_rt()
2305 if (p->prio < rq->curr->prio && cpu_online(cpu_of(rq))) in switched_to_rt()
2306 resched_curr(rq); in switched_to_rt()
2315 prio_changed_rt(struct rq *rq, struct task_struct *p, int oldprio) in prio_changed_rt() argument
2320 if (rq->curr == p) { in prio_changed_rt()
2327 rt_queue_pull_task(rq); in prio_changed_rt()
2333 if (p->prio > rq->rt.highest_prio.curr) in prio_changed_rt()
2334 resched_curr(rq); in prio_changed_rt()
2338 resched_curr(rq); in prio_changed_rt()
2346 if (p->prio < rq->curr->prio) in prio_changed_rt()
2347 resched_curr(rq); in prio_changed_rt()
2352 static void watchdog(struct rq *rq, struct task_struct *p) in watchdog() argument
2376 static inline void watchdog(struct rq *rq, struct task_struct *p) { } in watchdog() argument
2387 static void task_tick_rt(struct rq *rq, struct task_struct *p, int queued) in task_tick_rt() argument
2391 update_curr_rt(rq); in task_tick_rt()
2392 update_rt_rq_load_avg(rq_clock_pelt(rq), rq, 1); in task_tick_rt()
2394 watchdog(rq, p); in task_tick_rt()
2414 requeue_task_rt(rq, p, 0); in task_tick_rt()
2415 resched_curr(rq); in task_tick_rt()
2421 static unsigned int get_rr_interval_rt(struct rq *rq, struct task_struct *task) in get_rr_interval_rt() argument