1 /* LzHash.h -- HASH functions for LZ algorithms
\r
2 2015-04-12 : Igor Pavlov : Public domain */
\r
7 #define kHash2Size (1 << 10)
\r
8 #define kHash3Size (1 << 16)
\r
9 #define kHash4Size (1 << 20)
\r
11 #define kFix3HashSize (kHash2Size)
\r
12 #define kFix4HashSize (kHash2Size + kHash3Size)
\r
13 #define kFix5HashSize (kHash2Size + kHash3Size + kHash4Size)
\r
15 #define HASH2_CALC hv = cur[0] | ((UInt32)cur[1] << 8);
\r
17 #define HASH3_CALC { \
\r
18 UInt32 temp = p->crc[cur[0]] ^ cur[1]; \
\r
19 h2 = temp & (kHash2Size - 1); \
\r
20 hv = (temp ^ ((UInt32)cur[2] << 8)) & p->hashMask; }
\r
22 #define HASH4_CALC { \
\r
23 UInt32 temp = p->crc[cur[0]] ^ cur[1]; \
\r
24 h2 = temp & (kHash2Size - 1); \
\r
25 temp ^= ((UInt32)cur[2] << 8); \
\r
26 h3 = temp & (kHash3Size - 1); \
\r
27 hv = (temp ^ (p->crc[cur[3]] << 5)) & p->hashMask; }
\r
29 #define HASH5_CALC { \
\r
30 UInt32 temp = p->crc[cur[0]] ^ cur[1]; \
\r
31 h2 = temp & (kHash2Size - 1); \
\r
32 temp ^= ((UInt32)cur[2] << 8); \
\r
33 h3 = temp & (kHash3Size - 1); \
\r
34 temp ^= (p->crc[cur[3]] << 5); \
\r
35 h4 = temp & (kHash4Size - 1); \
\r
36 hv = (temp ^ (p->crc[cur[4]] << 3)) & p->hashMask; }
\r
38 /* #define HASH_ZIP_CALC hv = ((cur[0] | ((UInt32)cur[1] << 8)) ^ p->crc[cur[2]]) & 0xFFFF; */
\r
39 #define HASH_ZIP_CALC hv = ((cur[2] | ((UInt32)cur[0] << 8)) ^ p->crc[cur[1]]) & 0xFFFF;
\r
42 #define MT_HASH2_CALC \
\r
43 h2 = (p->crc[cur[0]] ^ cur[1]) & (kHash2Size - 1);
\r
45 #define MT_HASH3_CALC { \
\r
46 UInt32 temp = p->crc[cur[0]] ^ cur[1]; \
\r
47 h2 = temp & (kHash2Size - 1); \
\r
48 h3 = (temp ^ ((UInt32)cur[2] << 8)) & (kHash3Size - 1); }
\r
50 #define MT_HASH4_CALC { \
\r
51 UInt32 temp = p->crc[cur[0]] ^ cur[1]; \
\r
52 h2 = temp & (kHash2Size - 1); \
\r
53 temp ^= ((UInt32)cur[2] << 8); \
\r
54 h3 = temp & (kHash3Size - 1); \
\r
55 h4 = (temp ^ (p->crc[cur[3]] << 5)) & (kHash4Size - 1); }
\r