36 	u16 highest_prio;  member
44 	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()
90 		if (prio > q->highest_prio)  in skbprio_enqueue()
91 			q->highest_prio = prio;  in skbprio_enqueue()
125 		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()
152 	q->qstats[q->highest_prio].backlog -= qdisc_pkt_len(skb);  in skbprio_dequeue()
156 		if (q->lowest_prio == q->highest_prio) {  in skbprio_dequeue()
157 			q->highest_prio = 0;  in skbprio_dequeue()
160 			q->highest_prio = calc_new_high_prio(q);  in skbprio_dequeue()
189 	q->highest_prio = 0;  in skbprio_init()
219 	q->highest_prio = 0;  in skbprio_reset()