Searched refs:highest_prio (Results 1 – 2 of 2) sorted by relevance
85 rt_rq->highest_prio.curr = MAX_RT_PRIO; in init_rt_rq()86 rt_rq->highest_prio.next = MAX_RT_PRIO; in init_rt_rq()164 rt_rq->highest_prio.curr = MAX_RT_PRIO; in init_tg_rt_entry()268 return rq->rt.highest_prio.curr > prev->prio; in need_pull_rt_task()383 if (p->prio < rq->rt.highest_prio.next) in enqueue_pushable_task()384 rq->rt.highest_prio.next = p->prio; in enqueue_pushable_task()395 rq->rt.highest_prio.next = p->prio; in dequeue_pushable_task()397 rq->rt.highest_prio.next = MAX_RT_PRIO; in dequeue_pushable_task()504 if (rt_rq->highest_prio.curr < curr->prio) in sched_rt_rq_enqueue()886 return rt_rq->highest_prio.curr; in rt_se_prio()[all …]
446 } highest_prio; member