79 	struct rt_prio_array *array;  in init_rt_rq()  local
82 	array = &rt_rq->active;  in init_rt_rq()
84 		INIT_LIST_HEAD(array->queue + i);  in init_rt_rq()
85 		__clear_bit(i, array->bitmap);  in init_rt_rq()
88 	__set_bit(MAX_RT_PRIO, array->bitmap);  in init_rt_rq()
893 	struct rt_prio_array *array = &rt_rq->active;  in dump_throttled_rt_tasks()  local
904 	if (bitmap_empty(array->bitmap, MAX_RT_PRIO))  in dump_throttled_rt_tasks()
908 	idx = sched_find_first_bit(array->bitmap);  in dump_throttled_rt_tasks()
910 		list_for_each_entry(rt_se, array->queue + idx, run_list) {  in dump_throttled_rt_tasks()
921 		idx = find_next_bit(array->bitmap, MAX_RT_PRIO, idx + 1);  in dump_throttled_rt_tasks()
1133 			struct rt_prio_array *array = &rt_rq->active;  in dec_rt_prio()  local
1136 				sched_find_first_bit(array->bitmap);  in dec_rt_prio()
1251 static void __delist_rt_entity(struct sched_rt_entity *rt_se, struct rt_prio_array *array)  in __delist_rt_entity()  argument
1255 	if (list_empty(array->queue + rt_se_prio(rt_se)))  in __delist_rt_entity()
1256 		__clear_bit(rt_se_prio(rt_se), array->bitmap);  in __delist_rt_entity()
1264 	struct rt_prio_array *array = &rt_rq->active;  in __enqueue_rt_entity()  local
1266 	struct list_head *queue = array->queue + rt_se_prio(rt_se);  in __enqueue_rt_entity()
1276 			__delist_rt_entity(rt_se, array);  in __enqueue_rt_entity()
1287 		__set_bit(rt_se_prio(rt_se), array->bitmap);  in __enqueue_rt_entity()
1298 	struct rt_prio_array *array = &rt_rq->active;  in __dequeue_rt_entity()  local
1302 		__delist_rt_entity(rt_se, array);  in __dequeue_rt_entity()
1392 		struct rt_prio_array *array = &rt_rq->active;  in requeue_rt_entity()  local
1393 		struct list_head *queue = array->queue + rt_se_prio(rt_se);  in requeue_rt_entity()
1537 	struct rt_prio_array *array = &rt_rq->active;  in pick_next_rt_entity()  local
1542 	idx = sched_find_first_bit(array->bitmap);  in pick_next_rt_entity()
1545 	queue = array->queue + idx;  in pick_next_rt_entity()