2 * Copyright (c) 2010 Broadcom Corporation
4 * Permission to use, copy, modify, and/or distribute this software for any
5 * purpose with or without fee is hereby granted, provided that the above
6 * copyright notice and this permission notice appear in all copies.
8 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
9 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
10 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
11 * SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
12 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION
13 * OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN
14 * CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
17 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
19 #include <linux/netdevice.h>
20 #include <linux/module.h>
22 #include <brcmu_utils.h>
24 MODULE_AUTHOR("Broadcom Corporation");
25 MODULE_DESCRIPTION("Broadcom 802.11n wireless LAN driver utilities.");
26 MODULE_SUPPORTED_DEVICE("Broadcom 802.11n WLAN cards");
27 MODULE_LICENSE("Dual BSD/GPL");
29 struct sk_buff *brcmu_pkt_buf_get_skb(uint len)
33 skb = dev_alloc_skb(len);
41 EXPORT_SYMBOL(brcmu_pkt_buf_get_skb);
43 /* Free the driver packet. Free the tag if present */
44 void brcmu_pkt_buf_free_skb(struct sk_buff *skb)
48 /* cannot kfree_skb() on hard IRQ (net/core/skbuff.c) if
51 dev_kfree_skb_any(skb);
53 /* can free immediately (even in_irq()) if destructor
58 EXPORT_SYMBOL(brcmu_pkt_buf_free_skb);
61 * osl multiple-precedence packet queue
62 * hi_prec is always >= the number of the highest non-empty precedence
64 struct sk_buff *brcmu_pktq_penq(struct pktq *pq, int prec,
67 struct sk_buff_head *q;
69 if (pktq_full(pq) || pktq_pfull(pq, prec))
72 q = &pq->q[prec].skblist;
76 if (pq->hi_prec < prec)
77 pq->hi_prec = (u8) prec;
81 EXPORT_SYMBOL(brcmu_pktq_penq);
83 struct sk_buff *brcmu_pktq_penq_head(struct pktq *pq, int prec,
86 struct sk_buff_head *q;
88 if (pktq_full(pq) || pktq_pfull(pq, prec))
91 q = &pq->q[prec].skblist;
95 if (pq->hi_prec < prec)
96 pq->hi_prec = (u8) prec;
100 EXPORT_SYMBOL(brcmu_pktq_penq_head);
102 struct sk_buff *brcmu_pktq_pdeq(struct pktq *pq, int prec)
104 struct sk_buff_head *q;
107 q = &pq->q[prec].skblist;
115 EXPORT_SYMBOL(brcmu_pktq_pdeq);
117 struct sk_buff *brcmu_pktq_pdeq_tail(struct pktq *pq, int prec)
119 struct sk_buff_head *q;
122 q = &pq->q[prec].skblist;
123 p = skb_dequeue_tail(q);
130 EXPORT_SYMBOL(brcmu_pktq_pdeq_tail);
133 brcmu_pktq_pflush(struct pktq *pq, int prec, bool dir,
134 bool (*fn)(struct sk_buff *, void *), void *arg)
136 struct sk_buff_head *q;
137 struct sk_buff *p, *next;
139 q = &pq->q[prec].skblist;
140 skb_queue_walk_safe(q, p, next) {
141 if (fn == NULL || (*fn) (p, arg)) {
143 brcmu_pkt_buf_free_skb(p);
148 EXPORT_SYMBOL(brcmu_pktq_pflush);
150 void brcmu_pktq_flush(struct pktq *pq, bool dir,
151 bool (*fn)(struct sk_buff *, void *), void *arg)
154 for (prec = 0; prec < pq->num_prec; prec++)
155 brcmu_pktq_pflush(pq, prec, dir, fn, arg);
157 EXPORT_SYMBOL(brcmu_pktq_flush);
159 void brcmu_pktq_init(struct pktq *pq, int num_prec, int max_len)
163 /* pq is variable size; only zero out what's requested */
165 offsetof(struct pktq, q) + (sizeof(struct pktq_prec) * num_prec));
167 pq->num_prec = (u16) num_prec;
169 pq->max = (u16) max_len;
171 for (prec = 0; prec < num_prec; prec++) {
172 pq->q[prec].max = pq->max;
173 skb_queue_head_init(&pq->q[prec].skblist);
176 EXPORT_SYMBOL(brcmu_pktq_init);
178 struct sk_buff *brcmu_pktq_peek_tail(struct pktq *pq, int *prec_out)
185 for (prec = 0; prec < pq->hi_prec; prec++)
186 if (!skb_queue_empty(&pq->q[prec].skblist))
192 return skb_peek_tail(&pq->q[prec].skblist);
194 EXPORT_SYMBOL(brcmu_pktq_peek_tail);
196 /* Return sum of lengths of a specific set of precedences */
197 int brcmu_pktq_mlen(struct pktq *pq, uint prec_bmp)
203 for (prec = 0; prec <= pq->hi_prec; prec++)
204 if (prec_bmp & (1 << prec))
205 len += pq->q[prec].skblist.qlen;
209 EXPORT_SYMBOL(brcmu_pktq_mlen);
211 /* Priority dequeue from a specific set of precedences */
212 struct sk_buff *brcmu_pktq_mdeq(struct pktq *pq, uint prec_bmp,
215 struct sk_buff_head *q;
222 while ((prec = pq->hi_prec) > 0 &&
223 skb_queue_empty(&pq->q[prec].skblist))
226 while ((prec_bmp & (1 << prec)) == 0 ||
227 skb_queue_empty(&pq->q[prec].skblist))
231 q = &pq->q[prec].skblist;
243 EXPORT_SYMBOL(brcmu_pktq_mdeq);
246 /* pretty hex print a pkt buffer chain */
247 void brcmu_prpkt(const char *msg, struct sk_buff *p0)
251 if (msg && (msg[0] != '\0'))
252 pr_debug("%s:\n", msg);
254 for (p = p0; p; p = p->next)
255 print_hex_dump_bytes("", DUMP_PREFIX_OFFSET, p->data, p->len);
257 EXPORT_SYMBOL(brcmu_prpkt);
259 void brcmu_dbg_hex_dump(const void *data, size_t size, const char *fmt, ...)
261 struct va_format vaf;
269 pr_debug("%pV", &vaf);
273 print_hex_dump_bytes("", DUMP_PREFIX_OFFSET, data, size);
275 EXPORT_SYMBOL(brcmu_dbg_hex_dump);
276 #endif /* defined(DEBUG) */