Lines Matching refs:array
89 struct rt_prio_array *array;
92 array = &rt_rq->active;
94 INIT_LIST_HEAD(array->queue + i);
95 __clear_bit(i, array->bitmap);
98 __set_bit(MAX_RT_PRIO, array->bitmap);
1217 struct rt_prio_array *array = &rt_rq->active;
1219 rt_rq->highest_prio.curr = sched_find_first_bit(array->bitmap);
1338 static void __delist_rt_entity(struct sched_rt_entity *rt_se, struct rt_prio_array *array)
1342 if (list_empty(array->queue + rt_se_prio(rt_se))) {
1343 __clear_bit(rt_se_prio(rt_se), array->bitmap);
1352 struct rt_prio_array *array = &rt_rq->active;
1354 struct list_head *queue = array->queue + rt_se_prio(rt_se);
1364 __delist_rt_entity(rt_se, array);
1377 __set_bit(rt_se_prio(rt_se), array->bitmap);
1388 struct rt_prio_array *array = &rt_rq->active;
1392 __delist_rt_entity(rt_se, array);
1466 * Adding/removing a task to/from a priority array:
1503 struct rt_prio_array *array = &rt_rq->active;
1504 struct list_head *queue = array->queue + rt_se_prio(rt_se);
1716 struct rt_prio_array *array = &rt_rq->active;
1721 idx = sched_find_first_bit(array->bitmap);
1724 queue = array->queue + idx;