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->online && 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-1;  in dequeue_pushable_task()
403 static inline void enqueue_pushable_task(struct rq *rq, struct task_struct *p)  in enqueue_pushable_task()  argument
407 static inline void dequeue_pushable_task(struct rq *rq, struct task_struct *p)  in dequeue_pushable_task()  argument
421 static inline bool need_pull_rt_task(struct rq *rq, struct task_struct *prev)  in need_pull_rt_task()  argument
426 static inline void pull_rt_task(struct rq *this_rq)  in pull_rt_task()
430 static inline void rt_queue_push_tasks(struct rq *rq)  in rt_queue_push_tasks()  argument
512 #define for_each_rt_rq(rt_rq, iter, rq)					\  argument
515 		(rt_rq = iter->rt_rq[cpu_of(rq)]);)
531 	struct rq *rq = rq_of_rt_rq(rt_rq);  in sched_rt_rq_enqueue()  local
534 	int cpu = cpu_of(rq);  in sched_rt_rq_enqueue()
545 			resched_curr(rq);  in sched_rt_rq_enqueue()
619 #define for_each_rt_rq(rt_rq, iter, rq) \  argument
620 	for ((void) iter, rt_rq = &rq->rt; rt_rq; rt_rq = NULL)
632 	struct rq *rq = rq_of_rt_rq(rt_rq);  in sched_rt_rq_enqueue()  local
638 	resched_curr(rq);  in sched_rt_rq_enqueue()
733 static void __disable_runtime(struct rq *rq)  in __disable_runtime()  argument
735 	struct root_domain *rd = rq->rd;  in __disable_runtime()
742 	for_each_rt_rq(rt_rq, iter, rq) {  in __disable_runtime()
815 static void __enable_runtime(struct rq *rq)  in __enable_runtime()  argument
826 	for_each_rt_rq(rt_rq, iter, rq) {  in __enable_runtime()
876 		struct rq *rq = rq_of_rt_rq(rt_rq);  in do_sched_rt_period_timer()  local
891 		raw_spin_rq_lock(rq);  in do_sched_rt_period_timer()
892 		update_rq_clock(rq);  in do_sched_rt_period_timer()
913 				if (rt_rq->rt_nr_running && rq->curr == rq->idle)  in do_sched_rt_period_timer()
914 					rq_clock_cancel_skipupdate(rq);  in do_sched_rt_period_timer()
929 		raw_spin_rq_unlock(rq);  in do_sched_rt_period_timer()
997 static void update_curr_rt(struct rq *rq)  in update_curr_rt()  argument
999 	struct task_struct *curr = rq->curr;  in update_curr_rt()
1007 	now = rq_clock_task(rq);  in update_curr_rt()
1031 				resched_curr(rq);  in update_curr_rt()
1040 	struct rq *rq = rq_of_rt_rq(rt_rq);  in dequeue_top_rt_rq()  local
1042 	BUG_ON(&rq->rt != rt_rq);  in dequeue_top_rt_rq()
1047 	BUG_ON(!rq->nr_running);  in dequeue_top_rt_rq()
1049 	sub_nr_running(rq, rt_rq->rt_nr_running);  in dequeue_top_rt_rq()
1057 	struct rq *rq = rq_of_rt_rq(rt_rq);  in enqueue_top_rt_rq()  local
1059 	BUG_ON(&rq->rt != rt_rq);  in enqueue_top_rt_rq()
1068 		add_nr_running(rq, rt_rq->rt_nr_running);  in enqueue_top_rt_rq()
1073 	cpufreq_update_util(rq, 0);  in enqueue_top_rt_rq()
1081 	struct rq *rq = rq_of_rt_rq(rt_rq);  in inc_rt_prio_smp()  local
1087 	if (&rq->rt != rt_rq)  in inc_rt_prio_smp()
1090 	if (rq->online && prio < prev_prio)  in inc_rt_prio_smp()
1091 		cpupri_set(&rq->rd->cpupri, rq->cpu, prio);  in inc_rt_prio_smp()
1097 	struct rq *rq = rq_of_rt_rq(rt_rq);  in dec_rt_prio_smp()  local
1103 	if (&rq->rt != rt_rq)  in dec_rt_prio_smp()
1106 	if (rq->online && rt_rq->highest_prio.curr != prev_prio)  in dec_rt_prio_smp()
1107 		cpupri_set(&rq->rd->cpupri, rq->cpu, rt_rq->highest_prio.curr);  in dec_rt_prio_smp()
1345 	struct rq *rq = rq_of_rt_se(rt_se);  in enqueue_rt_entity()  local
1350 	enqueue_top_rt_rq(&rq->rt);  in enqueue_rt_entity()
1355 	struct rq *rq = rq_of_rt_se(rt_se);  in dequeue_rt_entity()  local
1365 	enqueue_top_rt_rq(&rq->rt);  in dequeue_rt_entity()
1372 enqueue_task_rt(struct rq *rq, struct task_struct *p, int flags)  in enqueue_task_rt()  argument
1381 	if (!task_current(rq, p) && p->nr_cpus_allowed > 1)  in enqueue_task_rt()
1382 		enqueue_pushable_task(rq, p);  in enqueue_task_rt()
1385 static void dequeue_task_rt(struct rq *rq, struct task_struct *p, int flags)  in dequeue_task_rt()  argument
1389 	update_curr_rt(rq);  in dequeue_task_rt()
1392 	dequeue_pushable_task(rq, p);  in dequeue_task_rt()
1413 static void requeue_task_rt(struct rq *rq, struct task_struct *p, int head)  in requeue_task_rt()  argument
1424 static void yield_task_rt(struct rq *rq)  in yield_task_rt()  argument
1426 	requeue_task_rt(rq, rq->curr, 0);  in yield_task_rt()
1436 	struct rq *rq;  in select_task_rq_rt()  local
1443 	rq = cpu_rq(cpu);  in select_task_rq_rt()
1446 	curr = READ_ONCE(rq->curr); /* unlocked access */  in select_task_rq_rt()
1504 static void check_preempt_equal_prio(struct rq *rq, struct task_struct *p)  in check_preempt_equal_prio()  argument
1510 	if (rq->curr->nr_cpus_allowed == 1 ||  in check_preempt_equal_prio()
1511 	    !cpupri_find(&rq->rd->cpupri, rq->curr, NULL))  in check_preempt_equal_prio()
1519 	    cpupri_find(&rq->rd->cpupri, p, NULL))  in check_preempt_equal_prio()
1527 	requeue_task_rt(rq, p, 1);  in check_preempt_equal_prio()
1528 	resched_curr(rq);  in check_preempt_equal_prio()
1531 static int balance_rt(struct rq *rq, struct task_struct *p, struct rq_flags *rf)  in balance_rt()  argument
1533 	if (!on_rt_rq(&p->rt) && need_pull_rt_task(rq, p)) {  in balance_rt()
1540 		rq_unpin_lock(rq, rf);  in balance_rt()
1541 		pull_rt_task(rq);  in balance_rt()
1542 		rq_repin_lock(rq, rf);  in balance_rt()
1545 	return sched_stop_runnable(rq) || sched_dl_runnable(rq) || sched_rt_runnable(rq);  in balance_rt()
1552 static void check_preempt_curr_rt(struct rq *rq, struct task_struct *p, int flags)  in check_preempt_curr_rt()  argument
1554 	if (p->prio < rq->curr->prio) {  in check_preempt_curr_rt()
1555 		resched_curr(rq);  in check_preempt_curr_rt()
1572 	if (p->prio == rq->curr->prio && !test_tsk_need_resched(rq->curr))  in check_preempt_curr_rt()
1573 		check_preempt_equal_prio(rq, p);  in check_preempt_curr_rt()
1577 static inline void set_next_task_rt(struct rq *rq, struct task_struct *p, bool first)  in set_next_task_rt()  argument
1579 	p->se.exec_start = rq_clock_task(rq);  in set_next_task_rt()
1582 	dequeue_pushable_task(rq, p);  in set_next_task_rt()
1592 	if (rq->curr->sched_class != &rt_sched_class)  in set_next_task_rt()
1593 		update_rt_rq_load_avg(rq_clock_pelt(rq), rq, 0);  in set_next_task_rt()
1595 	rt_queue_push_tasks(rq);  in set_next_task_rt()
1598 static struct sched_rt_entity *pick_next_rt_entity(struct rq *rq,  in pick_next_rt_entity()  argument
1615 static struct task_struct *_pick_next_task_rt(struct rq *rq)  in _pick_next_task_rt()  argument
1618 	struct rt_rq *rt_rq  = &rq->rt;  in _pick_next_task_rt()
1621 		rt_se = pick_next_rt_entity(rq, rt_rq);  in _pick_next_task_rt()
1629 static struct task_struct *pick_task_rt(struct rq *rq)  in pick_task_rt()  argument
1633 	if (!sched_rt_runnable(rq))  in pick_task_rt()
1636 	p = _pick_next_task_rt(rq);  in pick_task_rt()
1641 static struct task_struct *pick_next_task_rt(struct rq *rq)  in pick_next_task_rt()  argument
1643 	struct task_struct *p = pick_task_rt(rq);  in pick_next_task_rt()
1646 		set_next_task_rt(rq, p, true);  in pick_next_task_rt()
1651 static void put_prev_task_rt(struct rq *rq, struct task_struct *p)  in put_prev_task_rt()  argument
1653 	update_curr_rt(rq);  in put_prev_task_rt()
1655 	update_rt_rq_load_avg(rq_clock_pelt(rq), rq, 1);  in put_prev_task_rt()
1662 		enqueue_pushable_task(rq, p);  in put_prev_task_rt()
1670 static int pick_rt_task(struct rq *rq, struct task_struct *p, int cpu)  in pick_rt_task()  argument
1672 	if (!task_running(rq, p) &&  in pick_rt_task()
1683 static struct task_struct *pick_highest_pushable_task(struct rq *rq, int cpu)  in pick_highest_pushable_task()  argument
1685 	struct plist_head *head = &rq->rt.pushable_tasks;  in pick_highest_pushable_task()
1688 	if (!has_pushable_tasks(rq))  in pick_highest_pushable_task()
1692 		if (pick_rt_task(rq, p, cpu))  in pick_highest_pushable_task()
1793 static struct rq *find_lock_lowest_rq(struct task_struct *task, struct rq *rq)  in find_lock_lowest_rq()  argument
1795 	struct rq *lowest_rq = NULL;  in find_lock_lowest_rq()
1802 		if ((cpu == -1) || (cpu == rq->cpu))  in find_lock_lowest_rq()
1818 		if (double_lock_balance(rq, lowest_rq)) {  in find_lock_lowest_rq()
1825 			if (unlikely(task_rq(task) != rq ||  in find_lock_lowest_rq()
1827 				     task_running(rq, task) ||  in find_lock_lowest_rq()
1831 				double_unlock_balance(rq, lowest_rq);  in find_lock_lowest_rq()
1842 		double_unlock_balance(rq, lowest_rq);  in find_lock_lowest_rq()
1849 static struct task_struct *pick_next_pushable_task(struct rq *rq)  in pick_next_pushable_task()  argument
1853 	if (!has_pushable_tasks(rq))  in pick_next_pushable_task()
1856 	p = plist_first_entry(&rq->rt.pushable_tasks,  in pick_next_pushable_task()
1859 	BUG_ON(rq->cpu != task_cpu(p));  in pick_next_pushable_task()
1860 	BUG_ON(task_current(rq, p));  in pick_next_pushable_task()
1874 static int push_rt_task(struct rq *rq, bool pull)  in push_rt_task()  argument
1877 	struct rq *lowest_rq;  in push_rt_task()
1880 	if (!rq->rt.overloaded)  in push_rt_task()
1883 	next_task = pick_next_pushable_task(rq);  in push_rt_task()
1892 		if (!pull || rq->push_busy)  in push_rt_task()
1895 		cpu = find_lowest_rq(rq->curr);  in push_rt_task()
1896 		if (cpu == -1 || cpu == rq->cpu)  in push_rt_task()
1905 		push_task = get_push_task(rq);  in push_rt_task()
1907 			raw_spin_rq_unlock(rq);  in push_rt_task()
1908 			stop_one_cpu_nowait(rq->cpu, push_cpu_stop,  in push_rt_task()
1909 					    push_task, &rq->push_work);  in push_rt_task()
1910 			raw_spin_rq_lock(rq);  in push_rt_task()
1916 	if (WARN_ON(next_task == rq->curr))  in push_rt_task()
1924 	if (unlikely(next_task->prio < rq->curr->prio)) {  in push_rt_task()
1925 		resched_curr(rq);  in push_rt_task()
1933 	lowest_rq = find_lock_lowest_rq(next_task, rq);  in push_rt_task()
1944 		task = pick_next_pushable_task(rq);  in push_rt_task()
1967 	deactivate_task(rq, next_task, 0);  in push_rt_task()
1973 	double_unlock_balance(rq, lowest_rq);  in push_rt_task()
1980 static void push_rt_tasks(struct rq *rq)  in push_rt_tasks()  argument
1983 	while (push_rt_task(rq, false))  in push_rt_tasks()
2087 static void tell_cpu_to_push(struct rq *rq)  in tell_cpu_to_push()  argument
2092 	atomic_inc(&rq->rd->rto_loop_next);  in tell_cpu_to_push()
2095 	if (!rto_start_trylock(&rq->rd->rto_loop_start))  in tell_cpu_to_push()
2098 	raw_spin_lock(&rq->rd->rto_lock);  in tell_cpu_to_push()
2106 	if (rq->rd->rto_cpu < 0)  in tell_cpu_to_push()
2107 		cpu = rto_next_cpu(rq->rd);  in tell_cpu_to_push()
2109 	raw_spin_unlock(&rq->rd->rto_lock);  in tell_cpu_to_push()
2111 	rto_start_unlock(&rq->rd->rto_loop_start);  in tell_cpu_to_push()
2115 		sched_get_rd(rq->rd);  in tell_cpu_to_push()
2116 		irq_work_queue_on(&rq->rd->rto_push_work, cpu);  in tell_cpu_to_push()
2125 	struct rq *rq;  in rto_push_irq_work_func()  local
2128 	rq = this_rq();  in rto_push_irq_work_func()
2134 	if (has_pushable_tasks(rq)) {  in rto_push_irq_work_func()
2135 		raw_spin_rq_lock(rq);  in rto_push_irq_work_func()
2136 		while (push_rt_task(rq, true))  in rto_push_irq_work_func()
2138 		raw_spin_rq_unlock(rq);  in rto_push_irq_work_func()
2158 static void pull_rt_task(struct rq *this_rq)  in pull_rt_task()
2163 	struct rq *src_rq;  in pull_rt_task()
2271 static void task_woken_rt(struct rq *rq, struct task_struct *p)  in task_woken_rt()  argument
2273 	bool need_to_push = !task_running(rq, p) &&  in task_woken_rt()
2274 			    !test_tsk_need_resched(rq->curr) &&  in task_woken_rt()
2276 			    (dl_task(rq->curr) || rt_task(rq->curr)) &&  in task_woken_rt()
2277 			    (rq->curr->nr_cpus_allowed < 2 ||  in task_woken_rt()
2278 			     rq->curr->prio <= p->prio);  in task_woken_rt()
2281 		push_rt_tasks(rq);  in task_woken_rt()
2285 static void rq_online_rt(struct rq *rq)  in rq_online_rt()  argument
2287 	if (rq->rt.overloaded)  in rq_online_rt()
2288 		rt_set_overload(rq);  in rq_online_rt()
2290 	__enable_runtime(rq);  in rq_online_rt()
2292 	cpupri_set(&rq->rd->cpupri, rq->cpu, rq->rt.highest_prio.curr);  in rq_online_rt()
2296 static void rq_offline_rt(struct rq *rq)  in rq_offline_rt()  argument
2298 	if (rq->rt.overloaded)  in rq_offline_rt()
2299 		rt_clear_overload(rq);  in rq_offline_rt()
2301 	__disable_runtime(rq);  in rq_offline_rt()
2303 	cpupri_set(&rq->rd->cpupri, rq->cpu, CPUPRI_INVALID);  in rq_offline_rt()
2310 static void switched_from_rt(struct rq *rq, struct task_struct *p)  in switched_from_rt()  argument
2319 	if (!task_on_rq_queued(p) || rq->rt.rt_nr_running)  in switched_from_rt()
2322 	rt_queue_pull_task(rq);  in switched_from_rt()
2341 static void switched_to_rt(struct rq *rq, struct task_struct *p)  in switched_to_rt()  argument
2347 	if (task_current(rq, p)) {  in switched_to_rt()
2348 		update_rt_rq_load_avg(rq_clock_pelt(rq), rq, 0);  in switched_to_rt()
2359 		if (p->nr_cpus_allowed > 1 && rq->rt.overloaded)  in switched_to_rt()
2360 			rt_queue_push_tasks(rq);  in switched_to_rt()
2362 		if (p->prio < rq->curr->prio && cpu_online(cpu_of(rq)))  in switched_to_rt()
2363 			resched_curr(rq);  in switched_to_rt()
2372 prio_changed_rt(struct rq *rq, struct task_struct *p, int oldprio)  in prio_changed_rt()  argument
2377 	if (task_current(rq, p)) {  in prio_changed_rt()
2384 			rt_queue_pull_task(rq);  in prio_changed_rt()
2390 		if (p->prio > rq->rt.highest_prio.curr)  in prio_changed_rt()
2391 			resched_curr(rq);  in prio_changed_rt()
2395 			resched_curr(rq);  in prio_changed_rt()
2403 		if (p->prio < rq->curr->prio)  in prio_changed_rt()
2404 			resched_curr(rq);  in prio_changed_rt()
2409 static void watchdog(struct rq *rq, struct task_struct *p)  in watchdog()  argument
2433 static inline void watchdog(struct rq *rq, struct task_struct *p) { }  in watchdog()  argument
2444 static void task_tick_rt(struct rq *rq, struct task_struct *p, int queued)  in task_tick_rt()  argument
2448 	update_curr_rt(rq);  in task_tick_rt()
2449 	update_rt_rq_load_avg(rq_clock_pelt(rq), rq, 1);  in task_tick_rt()
2451 	watchdog(rq, p);  in task_tick_rt()
2471 			requeue_task_rt(rq, p, 0);  in task_tick_rt()
2472 			resched_curr(rq);  in task_tick_rt()
2478 static unsigned int get_rr_interval_rt(struct rq *rq, struct task_struct *task)  in get_rr_interval_rt()  argument