Lines Matching refs:array
601 struct rt_prio_array *array; in dec_rt_tasks() local
606 array = &rt_rq->active; in dec_rt_tasks()
608 sched_find_first_bit(array->bitmap); in dec_rt_tasks()
640 struct rt_prio_array *array = &rt_rq->active; in __enqueue_rt_entity() local
642 struct list_head *queue = array->queue + rt_se_prio(rt_se); in __enqueue_rt_entity()
654 __set_bit(rt_se_prio(rt_se), array->bitmap); in __enqueue_rt_entity()
662 struct rt_prio_array *array = &rt_rq->active; in __dequeue_rt_entity() local
665 if (list_empty(array->queue + rt_se_prio(rt_se))) in __dequeue_rt_entity()
666 __clear_bit(rt_se_prio(rt_se), array->bitmap); in __dequeue_rt_entity()
742 struct rt_prio_array *array = &rt_rq->active; in requeue_rt_entity() local
743 struct list_head *queue = array->queue + rt_se_prio(rt_se); in requeue_rt_entity()
867 struct rt_prio_array *array = &rt_rq->active; in pick_next_rt_entity() local
872 idx = sched_find_first_bit(array->bitmap); in pick_next_rt_entity()
875 queue = array->queue + idx; in pick_next_rt_entity()
933 struct rt_prio_array *array; in pick_next_highest_task_rt() local
938 array = &rt_rq->active; in pick_next_highest_task_rt()
939 idx = sched_find_first_bit(array->bitmap); in pick_next_highest_task_rt()
945 list_for_each_entry(rt_se, array->queue + idx, run_list) { in pick_next_highest_task_rt()
953 idx = find_next_bit(array->bitmap, MAX_RT_PRIO, idx+1); in pick_next_highest_task_rt()