Searched refs:kHash2Size (Results 1 – 4 of 4) sorted by relevance
7 #define kHash2Size (1 << 10) macro11 #define kFix3HashSize (kHash2Size)12 #define kFix4HashSize (kHash2Size + kHash3Size)13 #define kFix5HashSize (kHash2Size + kHash3Size + kHash4Size)19 h2 = temp & (kHash2Size - 1); \24 h2 = temp & (kHash2Size - 1); \31 h2 = temp & (kHash2Size - 1); \43 h2 = (p->crc[cur[0]] ^ cur[1]) & (kHash2Size - 1);47 h2 = temp & (kHash2Size - 1); \52 h2 = temp & (kHash2Size - 1); \
234 if (p->numHashBytes > 2) p->fixedHashSize += kHash2Size; in MatchFinder_Create()
22 static final int kHash2Size = 1 << 10; field in BinTree26 static final int kHash3Offset = kHash2Size;32 int kFixHashSize = kHash2Size + kHash3Size;41 kFixHashSize = kHash2Size + kHash3Size; in SetType()142 hash2Value = temp & (kHash2Size - 1); in GetMatches()277 int hash2Value = temp & (kHash2Size - 1); in Skip()
22 const UInt32 kHash2Size = 1 << 10; field in SevenZip.Compression.LZ.BinTree26 const UInt32 kHash3Offset = kHash2Size;32 UInt32 kFixHashSize = kHash2Size + kHash3Size;41 kFixHashSize = kHash2Size + kHash3Size; in SetType()142 hash2Value = temp & (kHash2Size - 1); in GetMatches()277 UInt32 hash2Value = temp & (kHash2Size - 1); in Skip()