61 	struct sk_buff_head *q;  in brcmu_pktq_penq()  local
66 	q = &pq->q[prec].skblist;  in brcmu_pktq_penq()
67 	skb_queue_tail(q, p);  in brcmu_pktq_penq()
80 	struct sk_buff_head *q;  in brcmu_pktq_penq_head()  local
85 	q = &pq->q[prec].skblist;  in brcmu_pktq_penq_head()
86 	skb_queue_head(q, p);  in brcmu_pktq_penq_head()
98 	struct sk_buff_head *q;  in brcmu_pktq_pdeq()  local
101 	q = &pq->q[prec].skblist;  in brcmu_pktq_pdeq()
102 	p = skb_dequeue(q);  in brcmu_pktq_pdeq()
121 	struct sk_buff_head *q;  in brcmu_pktq_pdeq_match()  local
124 	q = &pq->q[prec].skblist;  in brcmu_pktq_pdeq_match()
125 	skb_queue_walk_safe(q, p, next) {  in brcmu_pktq_pdeq_match()
127 			skb_unlink(p, q);  in brcmu_pktq_pdeq_match()
138 	struct sk_buff_head *q;  in brcmu_pktq_pdeq_tail()  local
141 	q = &pq->q[prec].skblist;  in brcmu_pktq_pdeq_tail()
142 	p = skb_dequeue_tail(q);  in brcmu_pktq_pdeq_tail()
155 	struct sk_buff_head *q;  in brcmu_pktq_pflush()  local
158 	q = &pq->q[prec].skblist;  in brcmu_pktq_pflush()
159 	skb_queue_walk_safe(q, p, next) {  in brcmu_pktq_pflush()
161 			skb_unlink(p, q);  in brcmu_pktq_pflush()
184 	      offsetof(struct pktq, q) + (sizeof(struct pktq_prec) * num_prec));  in brcmu_pktq_init()
191 		pq->q[prec].max = pq->max;  in brcmu_pktq_init()
192 		skb_queue_head_init(&pq->q[prec].skblist);  in brcmu_pktq_init()
205 		if (!skb_queue_empty(&pq->q[prec].skblist))  in brcmu_pktq_peek_tail()
211 	return skb_peek_tail(&pq->q[prec].skblist);  in brcmu_pktq_peek_tail()
224 			len += pq->q[prec].skblist.qlen;  in brcmu_pktq_mlen()
234 	struct sk_buff_head *q;  in brcmu_pktq_mdeq()  local
242 	       skb_queue_empty(&pq->q[prec].skblist))  in brcmu_pktq_mdeq()
246 	       skb_queue_empty(&pq->q[prec].skblist))  in brcmu_pktq_mdeq()
250 	q = &pq->q[prec].skblist;  in brcmu_pktq_mdeq()
251 	p = skb_dequeue(q);  in brcmu_pktq_mdeq()