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()
87 		q->qstats[prio].backlog += qdisc_pkt_len(skb);  in skbprio_enqueue()
90 		if (prio > q->highest_prio)  in skbprio_enqueue()
91 			q->highest_prio = prio;  in skbprio_enqueue()
93 		if (prio < q->lowest_prio)  in skbprio_enqueue()
94 			q->lowest_prio = prio;  in skbprio_enqueue()
102 	if (prio <= lp) {  in skbprio_enqueue()
103 		q->qstats[prio].drops++;  in skbprio_enqueue()
104 		q->qstats[prio].overlimits++;  in skbprio_enqueue()
110 	q->qstats[prio].backlog += qdisc_pkt_len(skb);  in skbprio_enqueue()
128 			q->lowest_prio = prio;  in skbprio_enqueue()
129 			q->highest_prio = prio;  in skbprio_enqueue()
135 	if (prio > q->highest_prio)  in skbprio_enqueue()
136 		q->highest_prio = prio;  in skbprio_enqueue()
185 	int prio;  in skbprio_init()  local
188 	for (prio = 0; prio < SKBPRIO_MAX_PRIORITY; prio++)  in skbprio_init()
189 		__skb_queue_head_init(&q->qdiscs[prio]);  in skbprio_init()
216 	int prio;  in skbprio_reset()  local
218 	for (prio = 0; prio < SKBPRIO_MAX_PRIORITY; prio++)  in skbprio_reset()
219 		__skb_queue_purge(&q->qdiscs[prio]);  in skbprio_reset()
229 	int prio;  in skbprio_destroy()  local
231 	for (prio = 0; prio < SKBPRIO_MAX_PRIORITY; prio++)  in skbprio_destroy()
232 		__skb_queue_purge(&q->qdiscs[prio]);  in skbprio_destroy()