blob: cb8bcde9097d00e66bde24b5710656c8ebe07fe1 (
plain)
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
|
/*
* Dr Dobb's Journal: http://www.ddj.com/ftp/1992/1992.05/crcman.zip
*
* Copyright Mark R. Nelson 1992
*
* This code used by permission of J Erickson <jerickson@ddj.com>
* Tues 6th October 1998. Copyright acknowledged above, as agreed.
*
*/
#include "includes.h"
#define CRC32_POLYNOMIAL 0xEDB88320L
/*****************************************************************
Instead of performing a straightforward calculation of the 32 bit
CRC using a series of logical operations, this program uses the
faster table lookup method. This routine is called once when the
program starts up to build the table which will be used later
when calculating the CRC values.
*****************************************************************/
static uint32 CRCTable[256];
void crc32_build_table(void)
{
int i;
int j;
uint32 crc;
for ( i = 0; i <= 255 ; i++ )
{
crc = i;
for ( j = 8 ; j > 0; j-- )
{
if ( crc & 1 )
{
crc = ( crc >> 1 ) ^ CRC32_POLYNOMIAL;
}
else
{
crc >>= 1;
}
}
CRCTable[ i ] = crc;
}
}
/*****************************************************************
This routine calculates the CRC for a block of data using the
table lookup method.
*****************************************************************/
uint32 crc32_calc_buffer( uint32 count, uchar *buffer)
{
uchar *p;
uint32 crc;
p = buffer;
crc = 0xffffffff;
while ( count-- != 0 )
{
uint32 temp1;
uint32 temp2;
temp1 = ( crc >> 8 ) & 0x00FFFFFFL;
temp2 = CRCTable[ ( (int) crc ^ *p++ ) & 0xff ];
crc = temp1 ^ temp2;
}
return crc;
}
|
