1 files changed, 1838 insertions, 0 deletions

diff --git a/drivers/net/wireless/bcm4329/bcmutils.c b/drivers/net/wireless/bcm4329/bcmutils.c
new file mode 100644
index 00000000000..43c04ee92f3
--- /dev/null
+++ b/drivers/net/wireless/bcm4329/bcmutils.c
@@ -0,0 +1,1838 @@
+/*
+ * Driver O/S-independent utility routines
+ *
+ * Copyright (C) 1999-2010, Broadcom Corporation
+ * 
+ *      Unless you and Broadcom execute a separate written software license
+ * agreement governing use of this software, this software is licensed to you
+ * under the terms of the GNU General Public License version 2 (the "GPL"),
+ * available at http://www.broadcom.com/licenses/GPLv2.php, with the
+ * following added to such license:
+ * 
+ *      As a special exception, the copyright holders of this software give you
+ * permission to link this software with independent modules, and to copy and
+ * distribute the resulting executable under terms of your choice, provided that
+ * you also meet, for each linked independent module, the terms and conditions of
+ * the license of that module.  An independent module is a module which is not
+ * derived from this software.  The special exception does not apply to any
+ * modifications of the software.
+ * 
+ *      Notwithstanding the above, under no circumstances may you combine this
+ * software in any way with any other Broadcom software provided under a license
+ * other than the GPL, without Broadcom's express prior written consent.
+ * $Id: bcmutils.c,v 1.210.4.5.2.4.6.19 2010/04/26 06:05:25 Exp $
+ */
+
+#include <typedefs.h>
+#include <bcmdefs.h>
+#include <stdarg.h>
+#include <bcmutils.h>
+#ifdef BCMDRIVER
+#include <osl.h>
+#include <siutils.h>
+#else
+#include <stdio.h>
+#include <string.h>
+/* This case for external supplicant use */
+#if defined(BCMEXTSUP)
+#include <bcm_osl.h>
+#endif
+
+#endif /* BCMDRIVER */
+#include <bcmendian.h>
+#include <bcmdevs.h>
+#include <proto/ethernet.h>
+#include <proto/vlan.h>
+#include <proto/bcmip.h>
+#include <proto/802.1d.h>
+#include <proto/802.11.h>
+
+
+#ifdef BCMDRIVER
+
+
+/* copy a pkt buffer chain into a buffer */
+uint
+pktcopy(osl_t *osh, void *p, uint offset, int len, uchar *buf)
+{
+        uint n, ret = 0;
+
+        if (len < 0)
+                len = 4096;     /* "infinite" */
+
+        /* skip 'offset' bytes */
+        for (; p && offset; p = PKTNEXT(osh, p)) {
+                if (offset < (uint)PKTLEN(osh, p))
+                        break;
+                offset -= PKTLEN(osh, p);
+        }
+
+        if (!p)
+                return 0;
+
+        /* copy the data */
+        for (; p && len; p = PKTNEXT(osh, p)) {
+                n = MIN((uint)PKTLEN(osh, p) - offset, (uint)len);
+                bcopy(PKTDATA(osh, p) + offset, buf, n);
+                buf += n;
+                len -= n;
+                ret += n;
+                offset = 0;
+        }
+
+        return ret;
+}
+
+/* copy a buffer into a pkt buffer chain */
+uint
+pktfrombuf(osl_t *osh, void *p, uint offset, int len, uchar *buf)
+{
+        uint n, ret = 0;
+
+        /* skip 'offset' bytes */
+        for (; p && offset; p = PKTNEXT(osh, p)) {
+                if (offset < (uint)PKTLEN(osh, p))
+                        break;
+                offset -= PKTLEN(osh, p);
+        }
+
+        if (!p)
+                return 0;
+
+        /* copy the data */
+        for (; p && len; p = PKTNEXT(osh, p)) {
+                n = MIN((uint)PKTLEN(osh, p) - offset, (uint)len);
+                bcopy(buf, PKTDATA(osh, p) + offset, n);
+                buf += n;
+                len -= n;
+                ret += n;
+                offset = 0;
+        }
+
+        return ret;
+}
+
+
+
+/* return total length of buffer chain */
+uint
+pkttotlen(osl_t *osh, void *p)
+{
+        uint total;
+
+        total = 0;
+        for (; p; p = PKTNEXT(osh, p))
+                total += PKTLEN(osh, p);
+        return (total);
+}
+
+/* return the last buffer of chained pkt */
+void *
+pktlast(osl_t *osh, void *p)
+{
+        for (; PKTNEXT(osh, p); p = PKTNEXT(osh, p))
+                ;
+
+        return (p);
+}
+
+/* count segments of a chained packet */
+uint
+pktsegcnt(osl_t *osh, void *p)
+{
+        uint cnt;
+
+        for (cnt = 0; p; p = PKTNEXT(osh, p))
+                cnt++;
+
+        return cnt;
+}
+
+
+/*
+ * osl multiple-precedence packet queue
+ * hi_prec is always >= the number of the highest non-empty precedence
+ */
+void *
+pktq_penq(struct pktq *pq, int prec, void *p)
+{
+        struct pktq_prec *q;
+
+        ASSERT(prec >= 0 && prec < pq->num_prec);
+        ASSERT(PKTLINK(p) == NULL);         /* queueing chains not allowed */
+
+        ASSERT(!pktq_full(pq));
+        ASSERT(!pktq_pfull(pq, prec));
+
+        q = &pq->q[prec];
+
+        if (q->head)
+                PKTSETLINK(q->tail, p);
+        else
+                q->head = p;
+
+        q->tail = p;
+        q->len++;
+
+        pq->len++;
+
+        if (pq->hi_prec < prec)
+                pq->hi_prec = (uint8)prec;
+
+        return p;
+}
+
+void *
+pktq_penq_head(struct pktq *pq, int prec, void *p)
+{
+        struct pktq_prec *q;
+
+        ASSERT(prec >= 0 && prec < pq->num_prec);
+        ASSERT(PKTLINK(p) == NULL);         /* queueing chains not allowed */
+
+        ASSERT(!pktq_full(pq));
+        ASSERT(!pktq_pfull(pq, prec));
+
+        q = &pq->q[prec];
+
+        if (q->head == NULL)
+                q->tail = p;
+
+        PKTSETLINK(p, q->head);
+        q->head = p;
+        q->len++;
+
+        pq->len++;
+
+        if (pq->hi_prec < prec)
+                pq->hi_prec = (uint8)prec;
+
+        return p;
+}
+
+void *
+pktq_pdeq(struct pktq *pq, int prec)
+{
+