Searched refs:highest_prio (Results 1 – 3 of 3) sorted by relevance
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()[all …]
443 } highest_prio; member
268 u32 highest_prio = 0; in node_select_active_links() local276 (l_ptr->priority < highest_prio)) in node_select_active_links()279 if (l_ptr->priority > highest_prio) { in node_select_active_links()280 highest_prio = l_ptr->priority; in node_select_active_links()