Searched refs:highest_prio (Results 1 – 2 of 2) sorted by relevance
86 rt_rq->highest_prio.curr = MAX_RT_PRIO; in init_rt_rq()87 rt_rq->highest_prio.next = MAX_RT_PRIO; in init_rt_rq()158 rt_rq->highest_prio.curr = MAX_RT_PRIO; in init_tg_rt_entry()262 return rq->rt.highest_prio.curr > prev->prio; in need_pull_rt_task()377 if (p->prio < rq->rt.highest_prio.next) in enqueue_pushable_task()378 rq->rt.highest_prio.next = p->prio; in enqueue_pushable_task()389 rq->rt.highest_prio.next = p->prio; in dequeue_pushable_task()391 rq->rt.highest_prio.next = MAX_RT_PRIO; in dequeue_pushable_task()498 if (rt_rq->highest_prio.curr < curr->prio) in sched_rt_rq_enqueue()882 return rt_rq->highest_prio.curr; in rt_se_prio()[all …]
464 } highest_prio; member