Searched refs:highest_prio (Results 1 – 3 of 3) sorted by relevance
36 u16 highest_prio; member44 for (prio = q->highest_prio - 1; prio >= q->lowest_prio; prio--) { in calc_new_high_prio()57 for (prio = q->lowest_prio + 1; prio <= q->highest_prio; prio++) { in calc_new_low_prio()88 if (prio > q->highest_prio) in skbprio_enqueue()89 q->highest_prio = prio; in skbprio_enqueue()123 if (q->lowest_prio == q->highest_prio) { in skbprio_enqueue()127 q->highest_prio = prio; in skbprio_enqueue()133 if (prio > q->highest_prio) in skbprio_enqueue()134 q->highest_prio = prio; in skbprio_enqueue()142 struct sk_buff_head *hpq = &q->qdiscs[q->highest_prio]; in skbprio_dequeue()[all …]
92 rt_rq->highest_prio.curr = MAX_RT_PRIO; in init_rt_rq()93 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()543 if (rt_rq->highest_prio.curr < curr->prio) in sched_rt_rq_enqueue()943 return rt_rq->highest_prio.curr; in rt_se_prio()[all …]
629 } highest_prio; member
