42 	int prio;  in calc_new_high_prio()  local
44 	for (prio = q->highest_prio - 1; prio >= q->lowest_prio; prio--) {  in calc_new_high_prio()
45 		if (!skb_queue_empty(&q->qdiscs[prio]))  in calc_new_high_prio()
46 			return prio;  in calc_new_high_prio()
55 	int prio;  in calc_new_low_prio()  local
57 	for (prio = q->lowest_prio + 1; prio <= q->highest_prio; prio++) {  in calc_new_low_prio()
58 		if (!skb_queue_empty(&q->qdiscs[prio]))  in calc_new_low_prio()
59 			return prio;  in calc_new_low_prio()
76 	u16 prio, lp;  in skbprio_enqueue()  local
79 	prio = min(skb->priority, max_priority);  in skbprio_enqueue()
81 	qdisc = &q->qdiscs[prio];  in skbprio_enqueue()
85 		q->qstats[prio].backlog += qdisc_pkt_len(skb);  in skbprio_enqueue()
88 		if (prio > q->highest_prio)  in skbprio_enqueue()
89 			q->highest_prio = prio;  in skbprio_enqueue()
91 		if (prio < q->lowest_prio)  in skbprio_enqueue()
92 			q->lowest_prio = prio;  in skbprio_enqueue()
100 	if (prio <= lp) {  in skbprio_enqueue()
101 		q->qstats[prio].drops++;  in skbprio_enqueue()
102 		q->qstats[prio].overlimits++;  in skbprio_enqueue()
108 	q->qstats[prio].backlog += qdisc_pkt_len(skb);  in skbprio_enqueue()
126 			q->lowest_prio = 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()
183 	int prio;  in skbprio_init()  local
186 	for (prio = 0; prio < SKBPRIO_MAX_PRIORITY; prio++)  in skbprio_init()
187 		__skb_queue_head_init(&q->qdiscs[prio]);  in skbprio_init()
214 	int prio;  in skbprio_reset()  local
216 	for (prio = 0; prio < SKBPRIO_MAX_PRIORITY; prio++)  in skbprio_reset()
217 		__skb_queue_purge(&q->qdiscs[prio]);  in skbprio_reset()
227 	int prio;  in skbprio_destroy()  local
229 	for (prio = 0; prio < SKBPRIO_MAX_PRIORITY; prio++)  in skbprio_destroy()
230 		__skb_queue_purge(&q->qdiscs[prio]);  in skbprio_destroy()