Lines Matching defs:highest_prio
36 u16 highest_prio;
44 for (prio = q->highest_prio - 1; prio >= q->lowest_prio; prio--) {
57 for (prio = q->lowest_prio + 1; prio <= q->highest_prio; prio++) {
88 if (prio > q->highest_prio)
89 q->highest_prio = prio;
123 if (q->lowest_prio == q->highest_prio) {
127 q->highest_prio = prio;
133 if (prio > q->highest_prio)
134 q->highest_prio = prio;
142 struct sk_buff_head *hpq = &q->qdiscs[q->highest_prio];
152 q->qstats[q->highest_prio].backlog -= qdisc_pkt_len(skb);
156 if (q->lowest_prio == q->highest_prio) {
158 q->highest_prio = 0;
161 q->highest_prio = calc_new_high_prio(q);
190 q->highest_prio = 0;
220 q->highest_prio = 0;