/
crc.c
executable file
·238 lines (187 loc) · 8.37 KB
/
crc.c
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
/*
Copyright 2013 Luigi Auriemma
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
http://www.gnu.org/licenses/gpl-2.0.txt
*/
typedef struct {
u64 table[256];
u64 poly;
int bits;
u64 init;
u64 final;
int type;
int rever;
int bitmask_side;
} crc_context;
static u64 crc_bitmask(int bits, int mask) {
u64 ret;
if(bits < 0) ret = (u64)0;
else if(bits >= 64) ret = (u64)0;
else ret = (u64)1 << (u64)bits;
if(mask) ret--;
return ret;
}
static u64 crc_reflect(u64 v, int b) {
u64 ret;
int i;
ret = (u64)0;
for(i = 0; i < b; i++) {
ret = (u64)(ret << (u64)1) | (u64)(v & (u64)1);
v >>= (u64)1;
}
return ret;
}
static u64 crc_safe_limit(u64 crc, int bits) {
if(bits < 64) {
crc &= crc_bitmask(bits, 1);
}
return(crc);
}
static u64 crc_cm_tab(int inbyte, u64 poly, int bits, int rever, int bitmask_side) {
u64 r,
topbit;
int i;
if(bitmask_side > 0) topbit = 1;
else topbit = crc_bitmask(bits - 1, 0);
if(rever) inbyte = crc_reflect(inbyte, 8);
if(bitmask_side > 0) r = (u64)inbyte;
else r = (u64)inbyte << (u64)(bits - 8);
for(i = 0; i < 8; i++) {
r = crc_safe_limit(r, bits);
if(r & topbit) {
if(bitmask_side > 0) r = (r >> (u64)1) ^ poly;
else r = (r << (u64)1) ^ poly;
} else {
if(bitmask_side > 0) r = (r >> (u64)1);
else r = (r << (u64)1);
}
}
if(rever) r = crc_reflect(r, bits);
r &= crc_bitmask(bits, 1);
return(r);
}
u8 *crc_make_table(u8 *op, int *oplen, u64 poly, int bits, int endian, int rever, int bitmask_side, void *(*add_func)()) {
u64 num,
*p64;
int i,
len;
if(oplen) len = *oplen;
else len = 0;
if(!op) {
len = 0;
if(!add_func) {
op = calloc(256, sizeof(num));
if(!op) return NULL;
}
}
p64 = (void *)op;
for(i = 0; i < 256; i++) {
num = crc_cm_tab(i, poly, bits, rever, bitmask_side);
num = crc_safe_limit(num, bits);
if(add_func) {
op = add_func(op, &len, num, bits, endian);
} else {
p64[i] = num;
}
}
if(oplen) *oplen = len;
return(op);
}
u16 crc_in_cksum(u64 init, u8 *data, int len) {
u64 sum;
int endian = 1; // big endian
u16 crc,
*p,
*l;
if(*(char *)&endian) endian = 0;
sum = init;
for(p = (u16 *)data, l = p + (len >> 1); p < l; p++) sum += *p;
if(len & 1) sum += *p & (endian ? 0xff00 : 0xff);
sum = (sum >> 16) + (sum & 0xffff);
crc = sum + (sum >> 16);
if(!endian) crc = (crc >> 8) | (crc << 8);
return(crc); // should be xored with 0xffff but this job is done later
}
#include "libs/crc/murmurhash.c"
#include "libs/crc/more_crc.c"
uint64 CityHash64(const char *buf, size_t len);
uint64 CityHash64WithSeed(const char *buf, size_t len, uint64 seed);
uint64 CityHash64WithSeeds(const char *buf, size_t len, uint64 seed0, uint64 seed1);
uint32 CityHash32(const char *buf, size_t len);
unsigned int XXH32 (const void* input, size_t length, unsigned seed);
unsigned long long XXH64 (const void* input, size_t length, unsigned long long seed);
QUICKBMS_u_int rol(QUICKBMS_u_int n1, QUICKBMS_u_int n2);
QUICKBMS_u_int ror(QUICKBMS_u_int n1, QUICKBMS_u_int n2);
u64 crc_calc(crc_context *ctx, u8 *data, int datalen, i32 *ret_error) {
#define MYCRC (crc_safe_limit(crc, ctx->bits))
#define MYBYTE data[i]
#define CRC_CALC_CYCLE(X) { \
for(i = 0; i < datalen; i++) { \
crc = X; \
} \
}
u64 crc;
int i;
if(ret_error) *ret_error = 0;
crc = ctx->init; // Init
// MYCRC is the current CRC/HASH
// MYBYTE is the byte taken from the input data
if(ctx->type == 0) CRC_CALC_CYCLE( ctx->table[(MYBYTE ^ MYCRC) & 0xff] ^ (MYCRC >> 8))
else if(ctx->type == 1) CRC_CALC_CYCLE( ctx->table[(MYBYTE ^ (MYCRC >> (ctx->bits - 8))) & 0xff] ^ (MYCRC << 8))
else if(ctx->type == 2) CRC_CALC_CYCLE( ((MYCRC << 8) | MYBYTE) ^ ctx->table[(MYCRC >> (ctx->bits - 8)) & 0xff])
else if(ctx->type == 3) CRC_CALC_CYCLE( ((MYCRC >> 1) + ((MYCRC & 1) << (ctx->bits - 1))) + MYBYTE)
else if(ctx->type == 4) crc = crc_in_cksum(MYCRC, data, datalen);
else if(ctx->type == 5) CRC_CALC_CYCLE( MYCRC ^ MYBYTE)
else if(ctx->type == 6) CRC_CALC_CYCLE( MYCRC + MYBYTE) // lose lose
else if(ctx->type == 7) CRC_CALC_CYCLE( ctx->table[(MYBYTE ^ MYCRC) & 0xff] ^ MYCRC)
else if(ctx->type == 8) CRC_CALC_CYCLE( ctx->table[(MYBYTE ^ MYCRC) & 0xff] ^ (MYCRC >> (ctx->bits - 8)))
else if(ctx->type == 9) CRC_CALC_CYCLE( (MYCRC << 1) ^ MYBYTE)
else if(ctx->type == 10) CRC_CALC_CYCLE( (MYCRC << 1) + MYBYTE)
else if(ctx->type == 11) CRC_CALC_CYCLE( rol(MYCRC, 1) ^ MYBYTE)
else if(ctx->type == 12) CRC_CALC_CYCLE( rol(MYCRC, 1) + MYBYTE)
else if(ctx->type == 13) CRC_CALC_CYCLE( ror(MYCRC, 1) ^ MYBYTE)
else if(ctx->type == 14) CRC_CALC_CYCLE( ror(MYCRC, 1) + MYBYTE)
else if(ctx->type == 15) CRC_CALC_CYCLE( (MYCRC << 5) + MYCRC + MYBYTE) // djb2 5381
else if(ctx->type == 16) CRC_CALC_CYCLE( (MYCRC * ctx->poly) + MYBYTE) // djb2 and sdbm
else if(ctx->type == 17) CRC_CALC_CYCLE( (MYCRC * ctx->poly) ^ MYBYTE) // djb2 and FNV-1
else if(ctx->type == 18) CRC_CALC_CYCLE( (MYCRC ^ MYBYTE) * ctx->poly) // FNV-1a
else if(ctx->type == 19) CRC_CALC_CYCLE( MYBYTE + (MYCRC << 6) + (MYCRC << 16) - MYCRC) // sdbm 65599
else if(ctx->type == 20) CRC_CALC_CYCLE( ctx->poly * (MYCRC + MYBYTE * (i + 1)))
else if(ctx->type == 21) crc = qhashmurmur3_32(data, datalen);
else if(ctx->type == 22) crc = qhashfnv1_32(data, datalen);
else if(ctx->type == 23) crc = qhashfnv1_64(data, datalen);
else if(ctx->type == 24) crc = XXH32(data, datalen, ctx->poly);
else if(ctx->type == 25) crc = XXH64(data, datalen, ctx->poly);
else if(ctx->type == 26) crc = jenkins_one_at_a_time_hash(data, datalen);
else if(ctx->type == 27) crc = xPear16(data, datalen);
else if(ctx->type == 28) crc = CityHash32(data, datalen);
else if(ctx->type == 29) crc = CityHash64(data, datalen);
else if(ctx->type == 30) crc = CityHash64WithSeed(data, datalen, ctx->poly);
else if(ctx->type == 31) crc = StormHash(data, datalen, MPQ_HASH_TABLE_INDEX);
else if(ctx->type == 32) crc = StormHash(data, datalen, MPQ_HASH_NAME_A);
else if(ctx->type == 33) crc = StormHash(data, datalen, MPQ_HASH_NAME_B);
else if(ctx->type == 34) crc = StormHash(data, datalen, MPQ_HASH_FILE_KEY);
else if(ctx->type == 35) crc = StormHash(data, datalen, MPQ_HASH_KEY2_MIX);
else if(ctx->type == 36) crc = jenkins_hashlittle(data, datalen, ctx->poly);
else if(ctx->type == 37) crc = adler32(0, data, datalen);
else {
fprintf(stderr, "\nError: unsupported crc type %d\n", (int32_t)ctx->type);
if(ret_error) *ret_error = 1;
return -1;
}
crc ^= ctx->final; // XorOut
crc = MYCRC;
return(crc);
#undef MYCRC
#undef CRC_CALC_CYCLE
}