Lines Matching refs:prio
42 int prio;
44 for (prio = q->highest_prio - 1; prio >= q->lowest_prio; prio--) {
45 if (!skb_queue_empty(&q->qdiscs[prio]))
46 return prio;
55 int prio;
57 for (prio = q->lowest_prio + 1; prio <= q->highest_prio; prio++) {
58 if (!skb_queue_empty(&q->qdiscs[prio]))
59 return prio;
76 u16 prio, lp;
79 prio = min(skb->priority, max_priority);
81 qdisc = &q->qdiscs[prio];
85 q->qstats[prio].backlog += qdisc_pkt_len(skb);
88 if (prio > q->highest_prio)
89 q->highest_prio = prio;
91 if (prio < q->lowest_prio)
92 q->lowest_prio = prio;
100 if (prio <= lp) {
101 q->qstats[prio].drops++;
102 q->qstats[prio].overlimits++;
108 q->qstats[prio].backlog += qdisc_pkt_len(skb);
126 q->lowest_prio = prio;
127 q->highest_prio = prio;
133 if (prio > q->highest_prio)
134 q->highest_prio = prio;
183 int prio;
186 for (prio = 0; prio < SKBPRIO_MAX_PRIORITY; prio++)
187 __skb_queue_head_init(&q->qdiscs[prio]);
214 int prio;
216 for (prio = 0; prio < SKBPRIO_MAX_PRIORITY; prio++)
217 __skb_queue_purge(&q->qdiscs[prio]);
227 int prio;
229 for (prio = 0; prio < SKBPRIO_MAX_PRIORITY; prio++)
230 __skb_queue_purge(&q->qdiscs[prio]);