Lines Matching refs:highest_prio

144 	rt_rq->highest_prio.curr = MAX_RT_PRIO-1;  in init_rt_rq()
145 rt_rq->highest_prio.next = MAX_RT_PRIO-1; in init_rt_rq()
220 rt_rq->highest_prio.curr = MAX_RT_PRIO-1; in init_tg_rt_entry()
324 return rq->online && rq->rt.highest_prio.curr > prev->prio; in need_pull_rt_task()
439 if (p->prio < rq->rt.highest_prio.next) in enqueue_pushable_task()
440 rq->rt.highest_prio.next = p->prio; in enqueue_pushable_task()
451 rq->rt.highest_prio.next = p->prio; in dequeue_pushable_task()
453 rq->rt.highest_prio.next = MAX_RT_PRIO-1; in dequeue_pushable_task()
591 if (rt_rq->highest_prio.curr < curr->prio) in sched_rt_rq_enqueue()
992 return rt_rq->highest_prio.curr; in rt_se_prio()
1156 if (rq->online && rt_rq->highest_prio.curr != prev_prio) in dec_rt_prio_smp()
1157 cpupri_set(&rq->rd->cpupri, rq->cpu, rt_rq->highest_prio.curr); in dec_rt_prio_smp()
1173 int prev_prio = rt_rq->highest_prio.curr; in inc_rt_prio()
1176 rt_rq->highest_prio.curr = prio; in inc_rt_prio()
1184 int prev_prio = rt_rq->highest_prio.curr; in dec_rt_prio()
1197 rt_rq->highest_prio.curr = in dec_rt_prio()
1202 rt_rq->highest_prio.curr = MAX_RT_PRIO-1; in dec_rt_prio()
1659 p->prio < cpu_rq(target)->rt.highest_prio.curr) in select_task_rq_rt()
1986 if (lowest_rq->rt.highest_prio.curr <= task->prio) { in find_lock_lowest_rq()
2021 if (lowest_rq->rt.highest_prio.curr > task->prio) in find_lock_lowest_rq()
2395 if (src_rq->rt.highest_prio.next >= in pull_rt_task()
2396 this_rq->rt.highest_prio.curr) in pull_rt_task()
2417 if (p && (p->prio < this_rq->rt.highest_prio.curr)) { in pull_rt_task()
2487 cpupri_set(&rq->rd->cpupri, rq->cpu, rq->rt.highest_prio.curr); in rq_online_rt()
2585 if (p->prio > rq->rt.highest_prio.curr) in prio_changed_rt()