127 	return container_of(rt_se, struct task_struct, rt);  in rt_task_of()
187 		rt_se->rt_rq = &rq->rt;  in init_tg_rt_entry()
242 	return container_of(rt_se, struct task_struct, rt);  in rt_task_of()
247 	return container_of(rt_rq, struct rq, rt);  in rq_of_rt_rq()
261 	return &rq->rt;  in rt_rq_of_se()
281 	return rq->online && rq->rt.highest_prio.curr > prev->prio;  in need_pull_rt_task()
339 	rt_rq = &rq_of_rt_rq(rt_rq)->rt;  in inc_rt_migration()
356 	rt_rq = &rq_of_rt_rq(rt_rq)->rt;  in dec_rt_migration()
367 	return !plist_head_empty(&rq->rt.pushable_tasks);  in has_pushable_tasks()
391 	plist_del(&p->pushable_tasks, &rq->rt.pushable_tasks);  in enqueue_pushable_task()
393 	plist_add(&p->pushable_tasks, &rq->rt.pushable_tasks);  in enqueue_pushable_task()
396 	if (p->prio < rq->rt.highest_prio.next)  in enqueue_pushable_task()
397 		rq->rt.highest_prio.next = p->prio;  in enqueue_pushable_task()
402 	plist_del(&p->pushable_tasks, &rq->rt.pushable_tasks);  in dequeue_pushable_task()
406 		p = plist_first_entry(&rq->rt.pushable_tasks,  in dequeue_pushable_task()
408 		rq->rt.highest_prio.next = p->prio;  in dequeue_pushable_task()
410 		rq->rt.highest_prio.next = MAX_RT_PRIO-1;  in dequeue_pushable_task()
633 	for ((void) iter, rt_rq = &rq->rt; rt_rq; rt_rq = NULL)
672 	return &cpu_rq(cpu)->rt;  in sched_rt_period_rt_rq()
1021 	struct sched_rt_entity *rt_se = &curr->rt;  in update_curr_rt()
1069 	BUG_ON(&rq->rt != rt_rq);  in dequeue_top_rt_rq()
1086 	BUG_ON(&rq->rt != rt_rq);  in enqueue_top_rt_rq()
1114 	if (&rq->rt != rt_rq)  in inc_rt_prio_smp()
1130 	if (&rq->rt != rt_rq)  in dec_rt_prio_smp()
1380 	enqueue_top_rt_rq(&rq->rt);  in enqueue_rt_entity()
1395 	enqueue_top_rt_rq(&rq->rt);  in dequeue_rt_entity()
1408 		p->prio <= rq->rt.highest_prio.next &&  in should_honor_rt_sync()
1409 		rq->rt.rt_nr_running <= 2;  in should_honor_rt_sync()
1425 	struct sched_rt_entity *rt_se = &p->rt;  in enqueue_task_rt()
1440 	struct sched_rt_entity *rt_se = &p->rt;  in dequeue_task_rt()
1468 	struct sched_rt_entity *rt_se = &p->rt;  in requeue_task_rt()
1597 		     p->prio < cpu_rq(target)->rt.highest_prio.curr))  in select_task_rq_rt()
1637 	if (!on_rt_rq(&p->rt) && need_pull_rt_task(rq, p)) {  in balance_rt()
1728 	struct rt_rq *rt_rq  = &rq->rt;  in _pick_next_task_rt()
1773 	if (on_rt_rq(&p->rt) && p->nr_cpus_allowed > 1)  in put_prev_task_rt()
1797 	struct plist_head *head = &rq->rt.pushable_tasks;  in pick_highest_pushable_task()
1926 		if (lowest_rq->rt.highest_prio.curr <= task->prio) {  in find_lock_lowest_rq()
1961 		if (lowest_rq->rt.highest_prio.curr > task->prio)  in find_lock_lowest_rq()
1979 	p = plist_first_entry(&rq->rt.pushable_tasks,  in pick_next_pushable_task()
2003 	if (!rq->rt.overloaded)  in push_rt_task()
2340 		if (src_rq->rt.highest_prio.next >=  in pull_rt_task()
2341 		    this_rq->rt.highest_prio.curr)  in pull_rt_task()
2362 		if (p && (p->prio < this_rq->rt.highest_prio.curr)) {  in pull_rt_task()
2429 	if (rq->rt.overloaded)  in rq_online_rt()
2434 	cpupri_set(&rq->rd->cpupri, rq->cpu, rq->rt.highest_prio.curr);  in rq_online_rt()
2440 	if (rq->rt.overloaded)  in rq_offline_rt()
2461 	if (!task_on_rq_queued(p) || rq->rt.rt_nr_running)  in switched_from_rt()
2501 		if (p->nr_cpus_allowed > 1 && rq->rt.overloaded)  in switched_to_rt()
2532 		if (p->prio > rq->rt.highest_prio.curr)  in prio_changed_rt()
2562 		if (p->rt.watchdog_stamp != jiffies) {  in watchdog()
2563 			p->rt.timeout++;  in watchdog()
2564 			p->rt.watchdog_stamp = jiffies;  in watchdog()
2568 		if (p->rt.timeout > next) {  in watchdog()
2588 	struct sched_rt_entity *rt_se = &p->rt;  in task_tick_rt()
2603 	if (--p->rt.time_slice)  in task_tick_rt()
2606 	p->rt.time_slice = sched_rr_timeslice;  in task_tick_rt()
2632 DEFINE_SCHED_CLASS(rt) = {
2897 		struct rt_rq *rt_rq = &cpu_rq(i)->rt;  in sched_rt_global_constraints()