49 	struct sk_buff_head *q;  in brcmu_pktq_penq()  local
54 	q = &pq->q[prec].skblist;  in brcmu_pktq_penq()
55 	skb_queue_tail(q, p);  in brcmu_pktq_penq()
68 	struct sk_buff_head *q;  in brcmu_pktq_penq_head()  local
73 	q = &pq->q[prec].skblist;  in brcmu_pktq_penq_head()
74 	skb_queue_head(q, p);  in brcmu_pktq_penq_head()
86 	struct sk_buff_head *q;  in brcmu_pktq_pdeq()  local
89 	q = &pq->q[prec].skblist;  in brcmu_pktq_pdeq()
90 	p = skb_dequeue(q);  in brcmu_pktq_pdeq()
109 	struct sk_buff_head *q;  in brcmu_pktq_pdeq_match()  local
112 	q = &pq->q[prec].skblist;  in brcmu_pktq_pdeq_match()
113 	skb_queue_walk_safe(q, p, next) {  in brcmu_pktq_pdeq_match()
115 			skb_unlink(p, q);  in brcmu_pktq_pdeq_match()
126 	struct sk_buff_head *q;  in brcmu_pktq_pdeq_tail()  local
129 	q = &pq->q[prec].skblist;  in brcmu_pktq_pdeq_tail()
130 	p = skb_dequeue_tail(q);  in brcmu_pktq_pdeq_tail()
143 	struct sk_buff_head *q;  in brcmu_pktq_pflush()  local
146 	q = &pq->q[prec].skblist;  in brcmu_pktq_pflush()
147 	skb_queue_walk_safe(q, p, next) {  in brcmu_pktq_pflush()
149 			skb_unlink(p, q);  in brcmu_pktq_pflush()
172 	      offsetof(struct pktq, q) + (sizeof(struct pktq_prec) * num_prec));  in brcmu_pktq_init()
179 		pq->q[prec].max = pq->max;  in brcmu_pktq_init()
180 		skb_queue_head_init(&pq->q[prec].skblist);  in brcmu_pktq_init()
193 		if (!skb_queue_empty(&pq->q[prec].skblist))  in brcmu_pktq_peek_tail()
199 	return skb_peek_tail(&pq->q[prec].skblist);  in brcmu_pktq_peek_tail()
212 			len += pq->q[prec].skblist.qlen;  in brcmu_pktq_mlen()
222 	struct sk_buff_head *q;  in brcmu_pktq_mdeq()  local
230 	       skb_queue_empty(&pq->q[prec].skblist))  in brcmu_pktq_mdeq()
234 	       skb_queue_empty(&pq->q[prec].skblist))  in brcmu_pktq_mdeq()
238 	q = &pq->q[prec].skblist;  in brcmu_pktq_mdeq()
239 	p = skb_dequeue(q);  in brcmu_pktq_mdeq()