1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287
|
/*
* Stephan Brumme's CRC32 implementation
*
* This file has been truncated because the original contents contain many
* implementations and a test programs that we are not interested in.
*
*
* crc32_4bytes, crc32_8bytes and crc32_16bytes are based/derived from Intel's
* Slicing-by-4 algorithm available at http://sourceforge.net/projects/slicing-by-8/
*
* See http://create.stephan-brumme.com/crc32/ for more information.
*
* -------------------------------
*
* LICENSE (retrieved in 2015-05-24)
*
* All source code published on http://create.stephan-brumme.com and its
* sub-pages is licensed similar to the zlib license:
*
* This software is provided 'as-is', without any express or implied warranty.
* In no event will the author be held liable for any damages arising from the
* use of this software.
*
* Permission is granted to anyone to use this software for any purpose,
* including commercial applications, and to alter it and redistribute it
* freely, subject to the following restrictions:
*
* The origin of this software must not be misrepresented; you must not
* claim that you wrote the original software.
*
* If you use this software in a product, an acknowledgment in the product
* documentation would be appreciated but is not required.
*
* Altered source versions must be plainly marked as such, and must not be
* misrepresented as being the original software.
*
* If you like / hate / ignore my software, send me an email or, even better, a
* nice postcard. Thank you ! :)
*
* -------------------------------
*
* Author note:
* if running on an embedded system, you might consider shrinking the
* big Crc32Lookup table:
* - crc32_4bytes needs only Crc32Lookup[0..3]
* - crc32_8bytes needs only Crc32Lookup[0..7]
* - crc32_16bytes needs all of Crc32Lookup
*/
#include <stddef.h>
#include <stdlib.h>
#include <stdbool.h>
#ifdef _MSC_VER
typedef unsigned __int8 uint8_t;
typedef unsigned __int32 uint32_t;
typedef signed __int32 int32_t;
#else
#include <stdint.h>
#endif
/// zlib's CRC32 polynomial
//static const uint32_t Polynomial = 0xEDB88320;
static const uint32_t Polynomial = 0x04C11DB7; /* same as libretro_crc.c */
#define MaxSlice 16
static uint32_t Crc32Lookup[MaxSlice][256];
static bool table_initialized = false;
static INLINE uint32_t swap(uint32_t x)
{
#if defined(__GNUC__) || defined(__clang__)
return __builtin_bswap32(x);
#else
#if defined(_MSC_VER)
return _byteswap_ulong(x);
#else
return (x >> 24) |
((x >> 8) & 0x0000FF00) |
((x << 8) & 0x00FF0000) |
(x << 24);
#endif
#endif
}
static uint32_t crc32_1byte(const void* data, size_t length, uint32_t previousCrc32);
static uint32_t crc32_4bytes(const void* data, size_t length, uint32_t previousCrc32);
static uint32_t crc32_8bytes(const void* data, size_t length, uint32_t previousCrc32);
static uint32_t crc32_16bytes(const void* data, size_t length, uint32_t previousCrc32);
void CRC_BuildTable(void)
{
int i, j, slice;
if (table_initialized)
return;
table_initialized = true;
for (i = 0; i <= 0xFF; i++)
{
uint32_t crc = i;
for (j = 0; j < 8; j++)
crc = (crc >> 1) ^ ((crc & 1) * Polynomial);
Crc32Lookup[0][i] = crc;
}
for (slice = 1; slice < MaxSlice; slice++)
for (i = 0; i <= 0xFF; i++)
Crc32Lookup[slice][i] = (Crc32Lookup[slice - 1][i] >> 8) ^ Crc32Lookup[0][Crc32Lookup[slice - 1][i] & 0xFF];
}
unsigned int CRC32(unsigned int crc, void *buffer, unsigned int count)
{
return crc32_8bytes(buffer, count, crc);
}
uint32_t CRC_Calculate(void *buffer, uint32_t count)
{
return CRC32(0xffffffff, buffer, count);
}
uint32_t adler32(uint32_t adler, void *buf, int len)
{
return CRC32(adler, buf, len);
}
/// compute CRC32 (standard algorithm)
static uint32_t crc32_1byte(const void* data, size_t length, uint32_t previousCrc32)
{
uint32_t crc = ~previousCrc32; // same as previousCrc32 ^ 0xFFFFFFFF
const uint8_t* current = (const uint8_t*) data;
while (length-- > 0)
crc = (crc >> 8) ^ Crc32Lookup[0][(crc & 0xFF) ^ *current++];
return ~crc; // same as crc ^ 0xFFFFFFFF
}
/// compute CRC32 (Slicing-by-4 algorithm)
static uint32_t crc32_4bytes(const void* data, size_t length, uint32_t previousCrc32)
{
uint32_t crc = ~previousCrc32; // same as previousCrc32 ^ 0xFFFFFFFF
const uint32_t* current = (const uint32_t*) data;
// process four bytes at once (Slicing-by-4)
while (length >= 4)
{
#ifdef MSB_FIRST
uint32_t one = *current++ ^ swap(crc);
crc = Crc32Lookup[0][ one & 0xFF] ^
Crc32Lookup[1][(one>> 8) & 0xFF] ^
Crc32Lookup[2][(one>>16) & 0xFF] ^
Crc32Lookup[3][(one>>24) & 0xFF];
#else
uint32_t one = *current++ ^ crc;
crc = Crc32Lookup[0][(one>>24) & 0xFF] ^
Crc32Lookup[1][(one>>16) & 0xFF] ^
Crc32Lookup[2][(one>> 8) & 0xFF] ^
Crc32Lookup[3][ one & 0xFF];
#endif
length -= 4;
}
const uint8_t* currentChar = (const uint8_t*) current;
// remaining 1 to 3 bytes (standard algorithm)
while (length-- != 0)
crc = (crc >> 8) ^ Crc32Lookup[0][(crc & 0xFF) ^ *currentChar++];
return ~crc; // same as crc ^ 0xFFFFFFFF
}
/// compute CRC32 (Slicing-by-8 algorithm)
static uint32_t crc32_8bytes(const void* data, size_t length, uint32_t previousCrc32)
{
uint32_t crc = ~previousCrc32; // same as previousCrc32 ^ 0xFFFFFFFF
const uint32_t* current = (const uint32_t*) data;
// process eight bytes at once (Slicing-by-8)
while (length >= 8)
{
#ifdef MSB_FIRST
uint32_t one = *current++ ^ swap(crc);
uint32_t two = *current++;
crc = Crc32Lookup[0][ two & 0xFF] ^
Crc32Lookup[1][(two>> 8) & 0xFF] ^
Crc32Lookup[2][(two>>16) & 0xFF] ^
Crc32Lookup[3][(two>>24) & 0xFF] ^
Crc32Lookup[4][ one & 0xFF] ^
Crc32Lookup[5][(one>> 8) & 0xFF] ^
Crc32Lookup[6][(one>>16) & 0xFF] ^
Crc32Lookup[7][(one>>24) & 0xFF];
#else
uint32_t one = *current++ ^ crc;
uint32_t two = *current++;
crc = Crc32Lookup[0][(two>>24) & 0xFF] ^
Crc32Lookup[1][(two>>16) & 0xFF] ^
Crc32Lookup[2][(two>> 8) & 0xFF] ^
Crc32Lookup[3][ two & 0xFF] ^
Crc32Lookup[4][(one>>24) & 0xFF] ^
Crc32Lookup[5][(one>>16) & 0xFF] ^
Crc32Lookup[6][(one>> 8) & 0xFF] ^
Crc32Lookup[7][ one & 0xFF];
#endif
length -= 8;
}
const uint8_t* currentChar = (const uint8_t*) current;
// remaining 1 to 7 bytes (standard algorithm)
while (length-- != 0)
crc = (crc >> 8) ^ Crc32Lookup[0][(crc & 0xFF) ^ *currentChar++];
return ~crc; // same as crc ^ 0xFFFFFFFF
}
/// compute CRC32 (Slicing-by-16 algorithm)
static uint32_t crc32_16bytes(const void* data, size_t length, uint32_t previousCrc32)
{
uint32_t crc = ~previousCrc32; // same as previousCrc32 ^ 0xFFFFFFFF
const uint32_t* current = (const uint32_t*) data;
// enabling optimization (at least -O2) automatically unrolls the inner for-loop
const size_t Unroll = 4;
const size_t BytesAtOnce = 16 * Unroll;
while (length >= BytesAtOnce)
{
size_t unrolling;
for (unrolling = 0; unrolling < Unroll; unrolling++)
{
#ifdef MSB_FIRST
uint32_t one = *current++ ^ swap(crc);
uint32_t two = *current++;
uint32_t three = *current++;
uint32_t four = *current++;
crc = Crc32Lookup[ 0][ four & 0xFF] ^
Crc32Lookup[ 1][(four >> 8) & 0xFF] ^
Crc32Lookup[ 2][(four >> 16) & 0xFF] ^
Crc32Lookup[ 3][(four >> 24) & 0xFF] ^
Crc32Lookup[ 4][ three & 0xFF] ^
Crc32Lookup[ 5][(three >> 8) & 0xFF] ^
Crc32Lookup[ 6][(three >> 16) & 0xFF] ^
Crc32Lookup[ 7][(three >> 24) & 0xFF] ^
Crc32Lookup[ 8][ two & 0xFF] ^
Crc32Lookup[ 9][(two >> 8) & 0xFF] ^
Crc32Lookup[10][(two >> 16) & 0xFF] ^
Crc32Lookup[11][(two >> 24) & 0xFF] ^
Crc32Lookup[12][ one & 0xFF] ^
Crc32Lookup[13][(one >> 8) & 0xFF] ^
Crc32Lookup[14][(one >> 16) & 0xFF] ^
Crc32Lookup[15][(one >> 24) & 0xFF];
#else
uint32_t one = *current++ ^ crc;
uint32_t two = *current++;
uint32_t three = *current++;
uint32_t four = *current++;
crc = Crc32Lookup[ 0][(four >> 24) & 0xFF] ^
Crc32Lookup[ 1][(four >> 16) & 0xFF] ^
Crc32Lookup[ 2][(four >> 8) & 0xFF] ^
Crc32Lookup[ 3][ four & 0xFF] ^
Crc32Lookup[ 4][(three >> 24) & 0xFF] ^
Crc32Lookup[ 5][(three >> 16) & 0xFF] ^
Crc32Lookup[ 6][(three >> 8) & 0xFF] ^
Crc32Lookup[ 7][ three & 0xFF] ^
Crc32Lookup[ 8][(two >> 24) & 0xFF] ^
Crc32Lookup[ 9][(two >> 16) & 0xFF] ^
Crc32Lookup[10][(two >> 8) & 0xFF] ^
Crc32Lookup[11][ two & 0xFF] ^
Crc32Lookup[12][(one >> 24) & 0xFF] ^
Crc32Lookup[13][(one >> 16) & 0xFF] ^
Crc32Lookup[14][(one >> 8) & 0xFF] ^
Crc32Lookup[15][ one & 0xFF];
#endif
}
length -= BytesAtOnce;
}
const uint8_t* currentChar = (const uint8_t*) current;
// remaining 1 to 63 bytes (standard algorithm)
while (length-- != 0)
crc = (crc >> 8) ^ Crc32Lookup[0][(crc & 0xFF) ^ *currentChar++];
return ~crc; // same as crc ^ 0xFFFFFFFF
}
|