hw/net/atheros_wlan_crc32.c

   1 /* crc32.c
   2  * CRC-32 routine
   3  *
   4  * $Id: crc32.c 18197 2006-05-21 05:12:17Z sahlberg $
   5  *
   6  * Wireshark - Network traffic analyzer
   7  * By Gerald Combs <gerald@wireshark.org>
   8  * Copyright 1998 Gerald Combs
   9  *
  10  * Copied from README.developer
  11  *
  12  * This program is free software; you can redistribute it and/or
  13  * modify it under the terms of the GNU General Public License
  14  * as published by the Free Software Foundation; either version 2
  15  * of the License, or (at your option) any later version.
  16  *
  17  * This program is distributed in the hope that it will be useful,
  18  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  19  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  20  * GNU General Public License for more details.
  21  *
  22  * You should have received a copy of the GNU General Public License
  23  * along with this program; if not, write to the Free Software
  24  * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
  25  *
  26  * Credits:
  27  *
  28  * Table from Solomon Peachy
  29  * Routine from Chris Waters
  30  */
  31
  32 #include "qemu/osdep.h"
  33 #include "atheros_wlan_crc32.h"
  34
  35 /*
  36  * Table for the AUTODIN/HDLC/802.x CRC.
  37  *
  38  * Polynomial is
  39  *
  40  *  x^32 + x^26 + x^23 + x^22 + x^16 + x^12 + x^11 + x^8 + x^7 +
  41  *      x^5 + x^4 + x^2 + x + 1
  42  */
  43 const guint32 crc32_ccitt_table[256] = {
  44     0x00000000, 0x77073096, 0xee0e612c, 0x990951ba, 0x076dc419,
  45     0x706af48f, 0xe963a535, 0x9e6495a3, 0x0edb8832, 0x79dcb8a4,
  46     0xe0d5e91e, 0x97d2d988, 0x09b64c2b, 0x7eb17cbd, 0xe7b82d07,
  47     0x90bf1d91, 0x1db71064, 0x6ab020f2, 0xf3b97148, 0x84be41de,
  48     0x1adad47d, 0x6ddde4eb, 0xf4d4b551, 0x83d385c7, 0x136c9856,
  49     0x646ba8c0, 0xfd62f97a, 0x8a65c9ec, 0x14015c4f, 0x63066cd9,
  50     0xfa0f3d63, 0x8d080df5, 0x3b6e20c8, 0x4c69105e, 0xd56041e4,
  51     0xa2677172, 0x3c03e4d1, 0x4b04d447, 0xd20d85fd, 0xa50ab56b,
  52     0x35b5a8fa, 0x42b2986c, 0xdbbbc9d6, 0xacbcf940, 0x32d86ce3,
  53     0x45df5c75, 0xdcd60dcf, 0xabd13d59, 0x26d930ac, 0x51de003a,
  54     0xc8d75180, 0xbfd06116, 0x21b4f4b5, 0x56b3c423, 0xcfba9599,
  55     0xb8bda50f, 0x2802b89e, 0x5f058808, 0xc60cd9b2, 0xb10be924,
  56     0x2f6f7c87, 0x58684c11, 0xc1611dab, 0xb6662d3d, 0x76dc4190,
  57     0x01db7106, 0x98d220bc, 0xefd5102a, 0x71b18589, 0x06b6b51f,
  58     0x9fbfe4a5, 0xe8b8d433, 0x7807c9a2, 0x0f00f934, 0x9609a88e,
  59     0xe10e9818, 0x7f6a0dbb, 0x086d3d2d, 0x91646c97, 0xe6635c01,
  60     0x6b6b51f4, 0x1c6c6162, 0x856530d8, 0xf262004e, 0x6c0695ed,
  61     0x1b01a57b, 0x8208f4c1, 0xf50fc457, 0x65b0d9c6, 0x12b7e950,
  62     0x8bbeb8ea, 0xfcb9887c, 0x62dd1ddf, 0x15da2d49, 0x8cd37cf3,
  63     0xfbd44c65, 0x4db26158, 0x3ab551ce, 0xa3bc0074, 0xd4bb30e2,
  64     0x4adfa541, 0x3dd895d7, 0xa4d1c46d, 0xd3d6f4fb, 0x4369e96a,
  65     0x346ed9fc, 0xad678846, 0xda60b8d0, 0x44042d73, 0x33031de5,
  66     0xaa0a4c5f, 0xdd0d7cc9, 0x5005713c, 0x270241aa, 0xbe0b1010,
  67     0xc90c2086, 0x5768b525, 0x206f85b3, 0xb966d409, 0xce61e49f,
  68     0x5edef90e, 0x29d9c998, 0xb0d09822, 0xc7d7a8b4, 0x59b33d17,
  69     0x2eb40d81, 0xb7bd5c3b, 0xc0ba6cad, 0xedb88320, 0x9abfb3b6,
  70     0x03b6e20c, 0x74b1d29a, 0xead54739, 0x9dd277af, 0x04db2615,
  71     0x73dc1683, 0xe3630b12, 0x94643b84, 0x0d6d6a3e, 0x7a6a5aa8,
  72     0xe40ecf0b, 0x9309ff9d, 0x0a00ae27, 0x7d079eb1, 0xf00f9344,
  73     0x8708a3d2, 0x1e01f268, 0x6906c2fe, 0xf762575d, 0x806567cb,
  74     0x196c3671, 0x6e6b06e7, 0xfed41b76, 0x89d32be0, 0x10da7a5a,
  75     0x67dd4acc, 0xf9b9df6f, 0x8ebeeff9, 0x17b7be43, 0x60b08ed5,
  76     0xd6d6a3e8, 0xa1d1937e, 0x38d8c2c4, 0x4fdff252, 0xd1bb67f1,
  77     0xa6bc5767, 0x3fb506dd, 0x48b2364b, 0xd80d2bda, 0xaf0a1b4c,
  78     0x36034af6, 0x41047a60, 0xdf60efc3, 0xa867df55, 0x316e8eef,
  79     0x4669be79, 0xcb61b38c, 0xbc66831a, 0x256fd2a0, 0x5268e236,
  80     0xcc0c7795, 0xbb0b4703, 0x220216b9, 0x5505262f, 0xc5ba3bbe,
  81     0xb2bd0b28, 0x2bb45a92, 0x5cb36a04, 0xc2d7ffa7, 0xb5d0cf31,
  82     0x2cd99e8b, 0x5bdeae1d, 0x9b64c2b0, 0xec63f226, 0x756aa39c,
  83     0x026d930a, 0x9c0906a9, 0xeb0e363f, 0x72076785, 0x05005713,
  84     0x95bf4a82, 0xe2b87a14, 0x7bb12bae, 0x0cb61b38, 0x92d28e9b,
  85     0xe5d5be0d, 0x7cdcefb7, 0x0bdbdf21, 0x86d3d2d4, 0xf1d4e242,
  86     0x68ddb3f8, 0x1fda836e, 0x81be16cd, 0xf6b9265b, 0x6fb077e1,
  87     0x18b74777, 0x88085ae6, 0xff0f6a70, 0x66063bca, 0x11010b5c,
  88     0x8f659eff, 0xf862ae69, 0x616bffd3, 0x166ccf45, 0xa00ae278,
  89     0xd70dd2ee, 0x4e048354, 0x3903b3c2, 0xa7672661, 0xd06016f7,
  90     0x4969474d, 0x3e6e77db, 0xaed16a4a, 0xd9d65adc, 0x40df0b66,
  91     0x37d83bf0, 0xa9bcae53, 0xdebb9ec5, 0x47b2cf7f, 0x30b5ffe9,
  92     0xbdbdf21c, 0xcabac28a, 0x53b39330, 0x24b4a3a6, 0xbad03605,
  93     0xcdd70693, 0x54de5729, 0x23d967bf, 0xb3667a2e, 0xc4614ab8,
  94     0x5d681b02, 0x2a6f2b94, 0xb40bbe37, 0xc30c8ea1, 0x5a05df1b,
  95     0x2d02ef8d
  96 };
  97
  98 #define CRC32_CCITT_SEED    0xFFFFFFFF
  99
 100 guint32
 101 crc32_ccitt(const guint8 *buf, guint len)
 102 {
 103     return crc32_ccitt_seed(buf, len, CRC32_CCITT_SEED);
 104 }
 105
 106 guint32
 107 crc32_ccitt_seed(const guint8 *buf, guint len, guint32 seed)
 108 {
 109     guint i;
 110     guint32 crc32 = seed;
 111
 112     for (i = 0; i < len; i++) {
 113         crc32 = crc32_ccitt_table[(crc32 ^ buf[i]) & 0xff] ^ (crc32 >> 8);
 114     }
 115
 116     return ~crc32;
 117 }
 118
 119
 120 /*
 121  * Checksum routine for Internet Protocol family headers (Portable Version).
 122  *
 123  * This routine is very heavily used in the network
 124  * code and should be modified for each CPU to be as fast as possible.
 125  */
 126
 127 #define ADDCARRY(x)  (x > 65535 ? x -= 65535 : x)
 128 #define REDUCE {l_util.l = sum; sum = l_util.s[0] + l_util.s[1]; ADDCARRY(sum);}
 129
 130 int
 131 in_cksum(const vec_t *vec, int veclen)
 132 {
 133     register const guint16 *w;
 134     register int sum = 0;
 135     register int mlen = 0;
 136     int byte_swapped = 0;
 137
 138     union {
 139         guint8  c[2];
 140         guint16 s;
 141     } s_util;
 142     union {
 143         guint16 s[2];
 144         guint32 l;
 145     } l_util;
 146
 147     for (; veclen != 0; vec++, veclen--) {
 148         if (vec->len == 0) {
 149             continue;
 150         }
 151         w = (const guint16 *)vec->ptr;
 152         if (mlen == -1) {
 153             /*
 154             * The first byte of this chunk is the continuation
 155             * of a word spanning between this chunk and the
 156             * last chunk.
 157             *
 158             * s_util.c[0] is already saved when scanning previous
 159             * chunk.
 160             */
 161             s_util.c[1] = *(const guint8 *)w;
 162             sum += s_util.s;
 163             w = (const guint16 *)((const guint8 *)w + 1);
 164             mlen = vec->len - 1;
 165         } else {
 166             mlen = vec->len;
 167         }
 168         /*
 169             * Force to even boundary.
 170         */
 171         if ((1 & (unsigned long) w) && (mlen > 0)) {
 172             REDUCE;
 173             sum <<= 8;
 174             s_util.c[0] = *(const guint8 *)w;
 175             w = (const guint16 *)((const guint8 *)w + 1);
 176             mlen--;
 177             byte_swapped = 1;
 178         }
 179         /*
 180             * Unroll the loop to make overhead from
 181             * branches &c small.
 182         */
 183         while ((mlen -= 32) >= 0) {
 184             sum += w[0];
 185             sum += w[1];
 186             sum += w[2];
 187             sum += w[3];
 188             sum += w[4];
 189             sum += w[5];
 190             sum += w[6];
 191             sum += w[7];
 192             sum += w[8];
 193             sum += w[9];
 194             sum += w[10];
 195             sum += w[11];
 196             sum += w[12];
 197             sum += w[13];
 198             sum += w[14];
 199             sum += w[15];
 200             w += 16;
 201         }
 202         mlen += 32;
 203         while ((mlen -= 8) >= 0) {
 204             sum += w[0];
 205             sum += w[1];
 206             sum += w[2];
 207             sum += w[3];
 208             w += 4;
 209         }
 210         mlen += 8;
 211         if (mlen == 0 && byte_swapped == 0) {
 212             continue;
 213         }
 214         REDUCE;
 215         while ((mlen -= 2) >= 0) {
 216             sum += *w++;
 217         }
 218         if (byte_swapped) {
 219             REDUCE;
 220             sum <<= 8;
 221             byte_swapped = 0;
 222             if (mlen == -1) {
 223                 s_util.c[1] = *(const guint8 *)w;
 224                 sum += s_util.s;
 225                 mlen = 0;
 226             } else {
 227                 mlen = -1;
 228             }
 229         } else if (mlen == -1) {
 230             s_util.c[0] = *(const guint8 *)w;
 231         }
 232     }
 233     if (mlen == -1) {
 234         /* The last mbuf has odd # of bytes. Follow the
 235         standard (the odd byte may be shifted left by 8 bits
 236         or not as determined by endian-ness of the machine) */
 237         s_util.c[1] = 0;
 238         sum += s_util.s;
 239     }
 240     REDUCE;
 241     return ~sum & 0xffff;
 242 }
 243
 244 guint16 ip_checksum(const guint8 *ptr, int len)
 245 {
 246     vec_t cksum_vec[1];
 247
 248     cksum_vec[0].ptr = ptr;
 249     cksum_vec[0].len = len;
 250     return in_cksum(&cksum_vec[0], 1);
 251 }
 252