brcm80211/brcmutil/utils.c

46 struct sk_buff *brcmu_pktq_penq(struct pktq *pq, int prec,
51 	if (pktq_full(pq) || pktq_pfull(pq, prec))
54 	q = &pq->q[prec].skblist;
58 	if (pq->hi_prec < prec)
59 		pq->hi_prec = (u8) prec;
65 struct sk_buff *brcmu_pktq_penq_head(struct pktq *pq, int prec,
70 	if (pktq_full(pq) || pktq_pfull(pq, prec))
73 	q = &pq->q[prec].skblist;
77 	if (pq->hi_prec < prec)
78 		pq->hi_prec = (u8) prec;
84 struct sk_buff *brcmu_pktq_pdeq(struct pktq *pq, int prec)
89 	q = &pq->q[prec].skblist;
105 struct sk_buff *brcmu_pktq_pdeq_match(struct pktq *pq, int prec,
112 	q = &pq->q[prec].skblist;
124 struct sk_buff *brcmu_pktq_pdeq_tail(struct pktq *pq, int prec)
129 	q = &pq->q[prec].skblist;
140 brcmu_pktq_pflush(struct pktq *pq, int prec, bool dir,
146 	q = &pq->q[prec].skblist;
160 	int prec;
161 	for (prec = 0; prec < pq->num_prec; prec++)
162 		brcmu_pktq_pflush(pq, prec, dir, fn, arg);
168 	int prec;
178 	for (prec = 0; prec < num_prec; prec++) {
179 		pq->q[prec].max = pq->max;
180 		skb_queue_head_init(&pq->q[prec].skblist);
187 	int prec;
192 	for (prec = 0; prec < pq->hi_prec; prec++)
193 		if (!skb_queue_empty(&pq->q[prec].skblist))
197 		*prec_out = prec;
199 	return skb_peek_tail(&pq->q[prec].skblist);
206 	int prec, len;
210 	for (prec = 0; prec <= pq->hi_prec; prec++)
211 		if (prec_bmp & (1 << prec))
212 			len += pq->q[prec].skblist.qlen;
224 	int prec;
229 	while ((prec = pq->hi_prec) > 0 &&
230 	       skb_queue_empty(&pq->q[prec].skblist))
233 	while ((prec_bmp & (1 << prec)) == 0 ||
234 	       skb_queue_empty(&pq->q[prec].skblist))
235 		if (prec-- == 0)
238 	q = &pq->q[prec].skblist;
246 		*prec_out = prec;