175 static inline struct rq *rq_of_rt_rq(struct rt_rq *rt_rq)  in rq_of_rt_rq()
177 	return rt_rq->rq;  in rq_of_rt_rq()
185 static inline struct rq *rq_of_rt_se(struct sched_rt_entity *rt_se)  in rq_of_rt_se()
189 	return rt_rq->rq;  in rq_of_rt_se()
218 	struct rq *rq = cpu_rq(cpu);  in init_tg_rt_entry()  local
222 	rt_rq->rq = rq;  in init_tg_rt_entry()
232 		rt_se->rt_rq = &rq->rt;  in init_tg_rt_entry()
290 static inline struct rq *rq_of_rt_rq(struct rt_rq *rt_rq)  in rq_of_rt_rq()
292 	return container_of(rt_rq, struct rq, rt);  in rq_of_rt_rq()
295 static inline struct rq *rq_of_rt_se(struct sched_rt_entity *rt_se)  in rq_of_rt_se()
304 	struct rq *rq = rq_of_rt_se(rt_se);  in rt_rq_of_se()  local
306 	return &rq->rt;  in rt_rq_of_se()
321 static inline bool need_pull_rt_task(struct rq *rq, struct task_struct *prev)  in need_pull_rt_task()  argument
324 	return rq->online && rq->rt.highest_prio.curr > prev->prio;  in need_pull_rt_task()
327 static inline int rt_overloaded(struct rq *rq)  in rt_overloaded()  argument
329 	return atomic_read(&rq->rd->rto_count);  in rt_overloaded()
332 static inline void rt_set_overload(struct rq *rq)  in rt_set_overload()  argument
334 	if (!rq->online)  in rt_set_overload()
337 	cpumask_set_cpu(rq->cpu, rq->rd->rto_mask);  in rt_set_overload()
348 	atomic_inc(&rq->rd->rto_count);  in rt_set_overload()
351 static inline void rt_clear_overload(struct rq *rq)  in rt_clear_overload()  argument
353 	if (!rq->online)  in rt_clear_overload()
357 	atomic_dec(&rq->rd->rto_count);  in rt_clear_overload()
358 	cpumask_clear_cpu(rq->cpu, rq->rd->rto_mask);  in rt_clear_overload()
408 static inline int has_pushable_tasks(struct rq *rq)  in has_pushable_tasks()  argument
410 	return !plist_head_empty(&rq->rt.pushable_tasks);  in has_pushable_tasks()
416 static void push_rt_tasks(struct rq *);
417 static void pull_rt_task(struct rq *);
419 static inline void rt_queue_push_tasks(struct rq *rq)  in rt_queue_push_tasks()  argument
421 	if (!has_pushable_tasks(rq))  in rt_queue_push_tasks()
424 	queue_balance_callback(rq, &per_cpu(rt_push_head, rq->cpu), push_rt_tasks);  in rt_queue_push_tasks()
427 static inline void rt_queue_pull_task(struct rq *rq)  in rt_queue_pull_task()  argument
429 	queue_balance_callback(rq, &per_cpu(rt_pull_head, rq->cpu), pull_rt_task);  in rt_queue_pull_task()
432 static void enqueue_pushable_task(struct rq *rq, struct task_struct *p)  in enqueue_pushable_task()  argument
434 	plist_del(&p->pushable_tasks, &rq->rt.pushable_tasks);  in enqueue_pushable_task()
436 	plist_add(&p->pushable_tasks, &rq->rt.pushable_tasks);  in enqueue_pushable_task()
439 	if (p->prio < rq->rt.highest_prio.next)  in enqueue_pushable_task()
440 		rq->rt.highest_prio.next = p->prio;  in enqueue_pushable_task()
443 static void dequeue_pushable_task(struct rq *rq, struct task_struct *p)  in dequeue_pushable_task()  argument
445 	plist_del(&p->pushable_tasks, &rq->rt.pushable_tasks);  in dequeue_pushable_task()
448 	if (has_pushable_tasks(rq)) {  in dequeue_pushable_task()
449 		p = plist_first_entry(&rq->rt.pushable_tasks,  in dequeue_pushable_task()
451 		rq->rt.highest_prio.next = p->prio;  in dequeue_pushable_task()
453 		rq->rt.highest_prio.next = MAX_RT_PRIO-1;  in dequeue_pushable_task()
459 static inline void enqueue_pushable_task(struct rq *rq, struct task_struct *p)  in enqueue_pushable_task()  argument
463 static inline void dequeue_pushable_task(struct rq *rq, struct task_struct *p)  in dequeue_pushable_task()  argument
477 static inline void rt_queue_push_tasks(struct rq *rq)  in rt_queue_push_tasks()  argument
559 #define for_each_rt_rq(rt_rq, iter, rq)					\  argument
562 		(rt_rq = iter->rt_rq[cpu_of(rq)]);)
578 	struct rq *rq = rq_of_rt_rq(rt_rq);  in sched_rt_rq_enqueue()  local
581 	int cpu = cpu_of(rq);  in sched_rt_rq_enqueue()
592 			resched_curr(rq);  in sched_rt_rq_enqueue()
666 #define for_each_rt_rq(rt_rq, iter, rq) \  argument
667 	for ((void) iter, rt_rq = &rq->rt; rt_rq; rt_rq = NULL)
679 	struct rq *rq = rq_of_rt_rq(rt_rq);  in sched_rt_rq_enqueue()  local
685 	resched_curr(rq);  in sched_rt_rq_enqueue()
780 static void __disable_runtime(struct rq *rq)  in __disable_runtime()  argument
782 	struct root_domain *rd = rq->rd;  in __disable_runtime()
789 	for_each_rt_rq(rt_rq, iter, rq) {  in __disable_runtime()
862 static void __enable_runtime(struct rq *rq)  in __enable_runtime()  argument
873 	for_each_rt_rq(rt_rq, iter, rq) {  in __enable_runtime()
923 		struct rq *rq = rq_of_rt_rq(rt_rq);  in do_sched_rt_period_timer()  local
939 		rq_lock(rq, &rf);  in do_sched_rt_period_timer()
940 		update_rq_clock(rq);  in do_sched_rt_period_timer()
961 				if (rt_rq->rt_nr_running && rq->curr == rq->idle)  in do_sched_rt_period_timer()
962 					rq_clock_cancel_skipupdate(rq);  in do_sched_rt_period_timer()
977 		rq_unlock(rq, &rf);  in do_sched_rt_period_timer()
1045 static void update_curr_rt(struct rq *rq)  in update_curr_rt()  argument
1047 	struct task_struct *curr = rq->curr;  in update_curr_rt()
1055 	now = rq_clock_task(rq);  in update_curr_rt()
1079 				resched_curr(rq);  in update_curr_rt()
1090 	struct rq *rq = rq_of_rt_rq(rt_rq);  in dequeue_top_rt_rq()  local
1092 	BUG_ON(&rq->rt != rt_rq);  in dequeue_top_rt_rq()
1097 	BUG_ON(!rq->nr_running);  in dequeue_top_rt_rq()
1099 	sub_nr_running(rq, count);  in dequeue_top_rt_rq()
1107 	struct rq *rq = rq_of_rt_rq(rt_rq);  in enqueue_top_rt_rq()  local
1109 	BUG_ON(&rq->rt != rt_rq);  in enqueue_top_rt_rq()
1118 		add_nr_running(rq, rt_rq->rt_nr_running);  in enqueue_top_rt_rq()
1123 	cpufreq_update_util(rq, 0);  in enqueue_top_rt_rq()
1131 	struct rq *rq = rq_of_rt_rq(rt_rq);  in inc_rt_prio_smp()  local
1137 	if (&rq->rt != rt_rq)  in inc_rt_prio_smp()
1140 	if (rq->online && prio < prev_prio)  in inc_rt_prio_smp()
1141 		cpupri_set(&rq->rd->cpupri, rq->cpu, prio);  in inc_rt_prio_smp()
1147 	struct rq *rq = rq_of_rt_rq(rt_rq);  in dec_rt_prio_smp()  local
1153 	if (&rq->rt != rt_rq)  in dec_rt_prio_smp()
1156 	if (rq->online && rt_rq->highest_prio.curr != prev_prio)  in dec_rt_prio_smp()
1157 		cpupri_set(&rq->rd->cpupri, rq->cpu, rt_rq->highest_prio.curr);  in dec_rt_prio_smp()
1504 	struct rq *rq = rq_of_rt_se(rt_se);  in enqueue_rt_entity()  local
1511 	enqueue_top_rt_rq(&rq->rt);  in enqueue_rt_entity()
1516 	struct rq *rq = rq_of_rt_se(rt_se);  in dequeue_rt_entity()  local
1528 	enqueue_top_rt_rq(&rq->rt);  in dequeue_rt_entity()
1535 enqueue_task_rt(struct rq *rq, struct task_struct *p, int flags)  in enqueue_task_rt()  argument
1547 	if (!task_current(rq, p) && p->nr_cpus_allowed > 1)  in enqueue_task_rt()
1548 		enqueue_pushable_task(rq, p);  in enqueue_task_rt()
1551 static void dequeue_task_rt(struct rq *rq, struct task_struct *p, int flags)  in dequeue_task_rt()  argument
1555 	update_curr_rt(rq);  in dequeue_task_rt()
1558 	dequeue_pushable_task(rq, p);  in dequeue_task_rt()
1579 static void requeue_task_rt(struct rq *rq, struct task_struct *p, int head)  in requeue_task_rt()  argument
1590 static void yield_task_rt(struct rq *rq)  in yield_task_rt()  argument
1592 	requeue_task_rt(rq, rq->curr, 0);  in yield_task_rt()
1602 	struct rq *rq;  in select_task_rq_rt()  local
1609 	rq = cpu_rq(cpu);  in select_task_rq_rt()
1612 	curr = READ_ONCE(rq->curr); /* unlocked access */  in select_task_rq_rt()
1670 static void check_preempt_equal_prio(struct rq *rq, struct task_struct *p)  in check_preempt_equal_prio()  argument
1676 	if (rq->curr->nr_cpus_allowed == 1 ||  in check_preempt_equal_prio()
1677 	    !cpupri_find(&rq->rd->cpupri, rq->curr, NULL))  in check_preempt_equal_prio()
1685 	    cpupri_find(&rq->rd->cpupri, p, NULL))  in check_preempt_equal_prio()
1693 	requeue_task_rt(rq, p, 1);  in check_preempt_equal_prio()
1694 	resched_curr(rq);  in check_preempt_equal_prio()
1697 static int balance_rt(struct rq *rq, struct task_struct *p, struct rq_flags *rf)  in balance_rt()  argument
1699 	if (!on_rt_rq(&p->rt) && need_pull_rt_task(rq, p)) {  in balance_rt()
1706 		rq_unpin_lock(rq, rf);  in balance_rt()
1707 		pull_rt_task(rq);  in balance_rt()
1708 		rq_repin_lock(rq, rf);  in balance_rt()
1711 	return sched_stop_runnable(rq) || sched_dl_runnable(rq) || sched_rt_runnable(rq);  in balance_rt()
1718 static void check_preempt_curr_rt(struct rq *rq, struct task_struct *p, int flags)  in check_preempt_curr_rt()  argument
1720 	if (p->prio < rq->curr->prio) {  in check_preempt_curr_rt()
1721 		resched_curr(rq);  in check_preempt_curr_rt()
1738 	if (p->prio == rq->curr->prio && !test_tsk_need_resched(rq->curr))  in check_preempt_curr_rt()
1739 		check_preempt_equal_prio(rq, p);  in check_preempt_curr_rt()
1743 static inline void set_next_task_rt(struct rq *rq, struct task_struct *p, bool first)  in set_next_task_rt()  argument
1746 	struct rt_rq *rt_rq = &rq->rt;  in set_next_task_rt()
1748 	p->se.exec_start = rq_clock_task(rq);  in set_next_task_rt()
1753 	dequeue_pushable_task(rq, p);  in set_next_task_rt()
1763 	if (rq->curr->sched_class != &rt_sched_class)  in set_next_task_rt()
1764 		update_rt_rq_load_avg(rq_clock_pelt(rq), rq, 0);  in set_next_task_rt()
1766 	rt_queue_push_tasks(rq);  in set_next_task_rt()
1785 static struct task_struct *_pick_next_task_rt(struct rq *rq)  in _pick_next_task_rt()  argument
1788 	struct rt_rq *rt_rq  = &rq->rt;  in _pick_next_task_rt()
1799 static struct task_struct *pick_task_rt(struct rq *rq)  in pick_task_rt()  argument
1803 	if (!sched_rt_runnable(rq))  in pick_task_rt()
1806 	p = _pick_next_task_rt(rq);  in pick_task_rt()
1811 static struct task_struct *pick_next_task_rt(struct rq *rq)  in pick_next_task_rt()  argument
1813 	struct task_struct *p = pick_task_rt(rq);  in pick_next_task_rt()
1816 		set_next_task_rt(rq, p, true);  in pick_next_task_rt()
1821 static void put_prev_task_rt(struct rq *rq, struct task_struct *p)  in put_prev_task_rt()  argument
1824 	struct rt_rq *rt_rq = &rq->rt;  in put_prev_task_rt()
1829 	update_curr_rt(rq);  in put_prev_task_rt()
1831 	update_rt_rq_load_avg(rq_clock_pelt(rq), rq, 1);  in put_prev_task_rt()
1838 		enqueue_pushable_task(rq, p);  in put_prev_task_rt()
1846 static int pick_rt_task(struct rq *rq, struct task_struct *p, int cpu)  in pick_rt_task()  argument
1848 	if (!task_on_cpu(rq, p) &&  in pick_rt_task()
1859 static struct task_struct *pick_highest_pushable_task(struct rq *rq, int cpu)  in pick_highest_pushable_task()  argument
1861 	struct plist_head *head = &rq->rt.pushable_tasks;  in pick_highest_pushable_task()
1864 	if (!has_pushable_tasks(rq))  in pick_highest_pushable_task()
1868 		if (pick_rt_task(rq, p, cpu))  in pick_highest_pushable_task()
1969 static struct rq *find_lock_lowest_rq(struct task_struct *task, struct rq *rq)  in find_lock_lowest_rq()  argument
1971 	struct rq *lowest_rq = NULL;  in find_lock_lowest_rq()
1978 		if ((cpu == -1) || (cpu == rq->cpu))  in find_lock_lowest_rq()
1994 		if (double_lock_balance(rq, lowest_rq)) {  in find_lock_lowest_rq()
2001 			if (unlikely(task_rq(task) != rq ||  in find_lock_lowest_rq()
2003 				     task_on_cpu(rq, task) ||  in find_lock_lowest_rq()
2007 				double_unlock_balance(rq, lowest_rq);  in find_lock_lowest_rq()
2018 		double_unlock_balance(rq, lowest_rq);  in find_lock_lowest_rq()
2025 static struct task_struct *pick_next_pushable_task(struct rq *rq)  in pick_next_pushable_task()  argument
2029 	if (!has_pushable_tasks(rq))  in pick_next_pushable_task()
2032 	p = plist_first_entry(&rq->rt.pushable_tasks,  in pick_next_pushable_task()
2035 	BUG_ON(rq->cpu != task_cpu(p));  in pick_next_pushable_task()
2036 	BUG_ON(task_current(rq, p));  in pick_next_pushable_task()
2050 static int push_rt_task(struct rq *rq, bool pull)  in push_rt_task()  argument
2053 	struct rq *lowest_rq;  in push_rt_task()
2056 	if (!rq->rt.overloaded)  in push_rt_task()
2059 	next_task = pick_next_pushable_task(rq);  in push_rt_task()
2069 	if (unlikely(next_task->prio < rq->curr->prio)) {  in push_rt_task()
2070 		resched_curr(rq);  in push_rt_task()
2078 		if (!pull || rq->push_busy)  in push_rt_task()
2090 		if (rq->curr->sched_class != &rt_sched_class)  in push_rt_task()
2093 		cpu = find_lowest_rq(rq->curr);  in push_rt_task()
2094 		if (cpu == -1 || cpu == rq->cpu)  in push_rt_task()
2103 		push_task = get_push_task(rq);  in push_rt_task()
2105 			raw_spin_rq_unlock(rq);  in push_rt_task()
2106 			stop_one_cpu_nowait(rq->cpu, push_cpu_stop,  in push_rt_task()
2107 					    push_task, &rq->push_work);  in push_rt_task()
2108 			raw_spin_rq_lock(rq);  in push_rt_task()
2114 	if (WARN_ON(next_task == rq->curr))  in push_rt_task()
2121 	lowest_rq = find_lock_lowest_rq(next_task, rq);  in push_rt_task()
2132 		task = pick_next_pushable_task(rq);  in push_rt_task()
2155 	deactivate_task(rq, next_task, 0);  in push_rt_task()
2161 	double_unlock_balance(rq, lowest_rq);  in push_rt_task()
2168 static void push_rt_tasks(struct rq *rq)  in push_rt_tasks()  argument
2171 	while (push_rt_task(rq, false))  in push_rt_tasks()
2275 static void tell_cpu_to_push(struct rq *rq)  in tell_cpu_to_push()  argument
2280 	atomic_inc(&rq->rd->rto_loop_next);  in tell_cpu_to_push()
2283 	if (!rto_start_trylock(&rq->rd->rto_loop_start))  in tell_cpu_to_push()
2286 	raw_spin_lock(&rq->rd->rto_lock);  in tell_cpu_to_push()
2294 	if (rq->rd->rto_cpu < 0)  in tell_cpu_to_push()
2295 		cpu = rto_next_cpu(rq->rd);  in tell_cpu_to_push()
2297 	raw_spin_unlock(&rq->rd->rto_lock);  in tell_cpu_to_push()
2299 	rto_start_unlock(&rq->rd->rto_loop_start);  in tell_cpu_to_push()
2303 		sched_get_rd(rq->rd);  in tell_cpu_to_push()
2304 		irq_work_queue_on(&rq->rd->rto_push_work, cpu);  in tell_cpu_to_push()
2313 	struct rq *rq;  in rto_push_irq_work_func()  local
2316 	rq = this_rq();  in rto_push_irq_work_func()
2322 	if (has_pushable_tasks(rq)) {  in rto_push_irq_work_func()
2323 		raw_spin_rq_lock(rq);  in rto_push_irq_work_func()
2324 		while (push_rt_task(rq, true))  in rto_push_irq_work_func()
2326 		raw_spin_rq_unlock(rq);  in rto_push_irq_work_func()
2346 static void pull_rt_task(struct rq *this_rq)  in pull_rt_task()
2351 	struct rq *src_rq;  in pull_rt_task()
2459 static void task_woken_rt(struct rq *rq, struct task_struct *p)  in task_woken_rt()  argument
2461 	bool need_to_push = !task_on_cpu(rq, p) &&  in task_woken_rt()
2462 			    !test_tsk_need_resched(rq->curr) &&  in task_woken_rt()
2464 			    (dl_task(rq->curr) || rt_task(rq->curr)) &&  in task_woken_rt()
2465 			    (rq->curr->nr_cpus_allowed < 2 ||  in task_woken_rt()
2466 			     rq->curr->prio <= p->prio);  in task_woken_rt()
2469 		push_rt_tasks(rq);  in task_woken_rt()
2473 static void rq_online_rt(struct rq *rq)  in rq_online_rt()  argument
2475 	if (rq->rt.overloaded)  in rq_online_rt()
2476 		rt_set_overload(rq);  in rq_online_rt()
2478 	__enable_runtime(rq);  in rq_online_rt()
2480 	cpupri_set(&rq->rd->cpupri, rq->cpu, rq->rt.highest_prio.curr);  in rq_online_rt()
2484 static void rq_offline_rt(struct rq *rq)  in rq_offline_rt()  argument
2486 	if (rq->rt.overloaded)  in rq_offline_rt()
2487 		rt_clear_overload(rq);  in rq_offline_rt()
2489 	__disable_runtime(rq);  in rq_offline_rt()
2491 	cpupri_set(&rq->rd->cpupri, rq->cpu, CPUPRI_INVALID);  in rq_offline_rt()
2498 static void switched_from_rt(struct rq *rq, struct task_struct *p)  in switched_from_rt()  argument
2507 	if (!task_on_rq_queued(p) || rq->rt.rt_nr_running)  in switched_from_rt()
2510 	rt_queue_pull_task(rq);  in switched_from_rt()
2529 static void switched_to_rt(struct rq *rq, struct task_struct *p)  in switched_to_rt()  argument
2535 	if (task_current(rq, p)) {  in switched_to_rt()
2536 		update_rt_rq_load_avg(rq_clock_pelt(rq), rq, 0);  in switched_to_rt()
2547 		if (p->nr_cpus_allowed > 1 && rq->rt.overloaded)  in switched_to_rt()
2548 			rt_queue_push_tasks(rq);  in switched_to_rt()
2550 		if (p->prio < rq->curr->prio && cpu_online(cpu_of(rq)))  in switched_to_rt()
2551 			resched_curr(rq);  in switched_to_rt()
2560 prio_changed_rt(struct rq *rq, struct task_struct *p, int oldprio)  in prio_changed_rt()  argument
2565 	if (task_current(rq, p)) {  in prio_changed_rt()
2572 			rt_queue_pull_task(rq);  in prio_changed_rt()
2578 		if (p->prio > rq->rt.highest_prio.curr)  in prio_changed_rt()
2579 			resched_curr(rq);  in prio_changed_rt()
2583 			resched_curr(rq);  in prio_changed_rt()
2591 		if (p->prio < rq->curr->prio)  in prio_changed_rt()
2592 			resched_curr(rq);  in prio_changed_rt()
2597 static void watchdog(struct rq *rq, struct task_struct *p)  in watchdog()  argument
2621 static inline void watchdog(struct rq *rq, struct task_struct *p) { }  in watchdog()  argument
2632 static void task_tick_rt(struct rq *rq, struct task_struct *p, int queued)  in task_tick_rt()  argument
2636 	update_curr_rt(rq);  in task_tick_rt()
2637 	update_rt_rq_load_avg(rq_clock_pelt(rq), rq, 1);  in task_tick_rt()
2639 	watchdog(rq, p);  in task_tick_rt()
2659 			requeue_task_rt(rq, p, 0);  in task_tick_rt()
2660 			resched_curr(rq);  in task_tick_rt()
2666 static unsigned int get_rr_interval_rt(struct rq *rq, struct task_struct *task)  in get_rr_interval_rt()  argument