Lines Matching refs:highest_prio
81 rt_rq->highest_prio.curr = MAX_RT_PRIO; in init_rt_rq()
82 rt_rq->highest_prio.next = MAX_RT_PRIO; in init_rt_rq()
160 rt_rq->highest_prio.curr = MAX_RT_PRIO; in init_tg_rt_entry()
264 return rq->rt.highest_prio.curr > prev->prio; in need_pull_rt_task()
369 if (p->prio < rq->rt.highest_prio.next) in enqueue_pushable_task()
370 rq->rt.highest_prio.next = p->prio; in enqueue_pushable_task()
381 rq->rt.highest_prio.next = p->prio; in dequeue_pushable_task()
383 rq->rt.highest_prio.next = MAX_RT_PRIO; in dequeue_pushable_task()
491 if (rt_rq->highest_prio.curr < curr->prio) in sched_rt_rq_enqueue()
883 return rt_rq->highest_prio.curr; in rt_se_prio()
1038 if (rq->online && rt_rq->highest_prio.curr != prev_prio) in dec_rt_prio_smp()
1039 cpupri_set(&rq->rd->cpupri, rq->cpu, rt_rq->highest_prio.curr); in dec_rt_prio_smp()
1055 int prev_prio = rt_rq->highest_prio.curr; in inc_rt_prio()
1058 rt_rq->highest_prio.curr = prio; in inc_rt_prio()
1066 int prev_prio = rt_rq->highest_prio.curr; in dec_rt_prio()
1079 rt_rq->highest_prio.curr = in dec_rt_prio()
1084 rt_rq->highest_prio.curr = MAX_RT_PRIO; in dec_rt_prio()
1360 p->prio < cpu_rq(target)->rt.highest_prio.curr) in select_task_rq_rt()
1637 if (lowest_rq->rt.highest_prio.curr <= task->prio) { in find_lock_lowest_rq()
1668 if (lowest_rq->rt.highest_prio.curr > task->prio) in find_lock_lowest_rq()
1847 if (next_rq->rt.highest_prio.next < rq->rt.highest_prio.curr) in find_next_push_cpu()
1986 if (src_rq->rt.highest_prio.next >= in pull_rt_task()
1987 this_rq->rt.highest_prio.curr) in pull_rt_task()
2007 if (p && (p->prio < this_rq->rt.highest_prio.curr)) { in pull_rt_task()
2109 cpupri_set(&rq->rd->cpupri, rq->cpu, rq->rt.highest_prio.curr); in rq_online_rt()
2206 if (p->prio > rq->rt.highest_prio.curr && rq->curr == p) in prio_changed_rt()