Home
last modified time | relevance | path

Searched refs:kHash3Size (Results 1 – 9 of 9) sorted by relevance

/external/chromium_org/third_party/lzma_sdk/
DLzHash.h8 #define kHash3Size (1 << 16) macro
12 #define kFix4HashSize (kHash2Size + kHash3Size)
13 #define kFix5HashSize (kHash2Size + kHash3Size + kHash4Size)
25 hash3Value = (temp ^ ((UInt32)cur[2] << 8)) & (kHash3Size - 1); \
31 hash3Value = (temp ^ ((UInt32)cur[2] << 8)) & (kHash3Size - 1); \
46 hash3Value = (temp ^ ((UInt32)cur[2] << 8)) & (kHash3Size - 1); }
51 hash3Value = (temp ^ ((UInt32)cur[2] << 8)) & (kHash3Size - 1); \
DLzFind.c218 if (p->numHashBytes > 3) p->fixedHashSize += kHash3Size; in MatchFinder_Create()
/external/chromium_org/third_party/ots/third_party/lzma_sdk/
DLzHash.h9 #define kHash3Size (1 << 16) macro
13 #define kFix4HashSize (kHash2Size + kHash3Size)
14 #define kFix5HashSize (kHash2Size + kHash3Size + kHash4Size)
26 hash3Value = (temp ^ ((UInt32)cur[2] << 8)) & (kHash3Size - 1); \
32 hash3Value = (temp ^ ((UInt32)cur[2] << 8)) & (kHash3Size - 1); \
47 hash3Value = (temp ^ ((UInt32)cur[2] << 8)) & (kHash3Size - 1); }
52 hash3Value = (temp ^ ((UInt32)cur[2] << 8)) & (kHash3Size - 1); \
DLzFind.c219 if (p->numHashBytes > 3) p->fixedHashSize += kHash3Size; in MatchFinder_Create()
/external/lzma/C/
DLzHash.h8 #define kHash3Size (1 << 16) macro
12 #define kFix4HashSize (kHash2Size + kHash3Size)
13 #define kFix5HashSize (kHash2Size + kHash3Size + kHash4Size)
25 hash3Value = (temp ^ ((UInt32)cur[2] << 8)) & (kHash3Size - 1); \
31 hash3Value = (temp ^ ((UInt32)cur[2] << 8)) & (kHash3Size - 1); \
46 hash3Value = (temp ^ ((UInt32)cur[2] << 8)) & (kHash3Size - 1); }
51 hash3Value = (temp ^ ((UInt32)cur[2] << 8)) & (kHash3Size - 1); \
DLzFind.c218 if (p->numHashBytes > 3) p->fixedHashSize += kHash3Size; in MatchFinder_Create()
/external/lzma/Java/SevenZip/Compression/LZ/
DBinTree.java23 static final int kHash3Size = 1 << 16; field in BinTree
32 int kFixHashSize = kHash2Size + kHash3Size;
41 kFixHashSize = kHash2Size + kHash3Size; in SetType()
144 hash3Value = temp & (kHash3Size - 1); in GetMatches()
280 int hash3Value = temp & (kHash3Size - 1); in Skip()
/external/lzma/CS/7zip/Compress/LZ/
DLzBinTree.cs23 const UInt32 kHash3Size = 1 << 16; field in SevenZip.Compression.LZ.BinTree
32 UInt32 kFixHashSize = kHash2Size + kHash3Size;
41 kFixHashSize = kHash2Size + kHash3Size; in SetType()
144 hash3Value = temp & (kHash3Size - 1); in GetMatches()
280 UInt32 hash3Value = temp & (kHash3Size - 1); in Skip()
/external/chromium_org/third_party/brotli/src/
Dots-lzma.patch299 +#define kHash3Size (1 << 16)
303 +#define kFix4HashSize (kHash2Size + kHash3Size)
304 +#define kFix5HashSize (kHash2Size + kHash3Size + kHash4Size)
316 + hash3Value = (temp ^ ((UInt32)cur[2] << 8)) & (kHash3Size - 1); \
322 + hash3Value = (temp ^ ((UInt32)cur[2] << 8)) & (kHash3Size - 1); \
337 + hash3Value = (temp ^ ((UInt32)cur[2] << 8)) & (kHash3Size - 1); }
342 + hash3Value = (temp ^ ((UInt32)cur[2] << 8)) & (kHash3Size - 1); \
2351 + if (p->numHashBytes > 3) p->fixedHashSize += kHash3Size;