143 		INIT_LIST_HEAD(array->queue + i);  in init_rt_rq()
1333 	if (list_empty(array->queue + rt_se_prio(rt_se)))  in __delist_rt_entity()
1450 	struct list_head *queue = array->queue + rt_se_prio(rt_se);  in __enqueue_rt_entity()  local
1467 			list_add(&rt_se->run_list, queue);  in __enqueue_rt_entity()
1469 			list_add_tail(&rt_se->run_list, queue);  in __enqueue_rt_entity()
1608 		struct list_head *queue = array->queue + rt_se_prio(rt_se);  in requeue_rt_entity()  local
1611 			list_move(&rt_se->run_list, queue);  in requeue_rt_entity()
1613 			list_move_tail(&rt_se->run_list, queue);  in requeue_rt_entity()
1865 	struct list_head *queue;  in pick_next_rt_entity()  local
1871 	queue = array->queue + idx;  in pick_next_rt_entity()
1872 	if (SCHED_WARN_ON(list_empty(queue)))  in pick_next_rt_entity()
1874 	next = list_entry(queue->next, struct sched_rt_entity, run_list);  in pick_next_rt_entity()