Home
last modified time | relevance | path

Searched refs:hashMask (Results 1 - 9 of 9) sorted by relevance

/third_party/skia/bench/
H A DFontCacheBench.cpp81 unsigned hashMask) { in count_collisions()
87 int index = proc(array[i]) & hashMask; in count_collisions()
121 int hashMask = ((1 << hashBits) - 1); variable
129 collisions += count_collisions(array, count, gRec[i].fHasher, hashMask);
80 count_collisions(const uint16_t array[], int count, HasherProc proc, unsigned hashMask) count_collisions() argument
/third_party/lzma/C/
H A DLzFindMt.c298 UInt32 *hash, UInt32 hashMask, UInt32 *heads, UInt32 numHeads, const UInt32 *crc)
313 DEF_GetHeads2(2, GetUi16(p), UNUSED_VAR(hashMask); UNUSED_VAR(crc); )
314 DEF_GetHeads(3, (crc[p[0]] ^ GetUi16(p + 1)) & hashMask)
315 DEF_GetHeads2(3b, GetUi16(p) ^ ((UInt32)(p)[2] << 16), UNUSED_VAR(hashMask); UNUSED_VAR(crc); )
316 // BT3 is not good for crc collisions for big hashMask values.
321 UNUSED_VAR(hashMask);
354 while ((hashMask & 0x80000000) == 0)
356 hashMask <<= 1;
377 crc0[i] = v & hashMask;
378 crc1[i] = (v << kLzHash_CrcShift_1) & hashMask;
[all...]
H A DLzFindMt.h40 UInt32 *hash, UInt32 hashMask, UInt32 *heads, UInt32 numHeads, const UInt32 *crc);
H A DLzFind.c47 hv = (temp ^ ((UInt32)cur[2] << 8)) & p->hashMask; }
54 hv = (temp ^ (p->crc[cur[3]] << kLzHash_CrcShift_1)) & p->hashMask; }
63 hv = (temp ^ (p->crc[cur[4]] << kLzHash_CrcShift_2)) & p->hashMask; }
436 p->hashMask = hsCur; in MatchFinder_Create()
547 const size_t numItems = (size_t)p->hashMask + 1; in MatchFinder_Init_HighHash()
853 MatchFinder_Normalize3(subValue, p->hash, (size_t)p->hashMask + 1 + p->fixedHashSize); in MatchFinder_CheckLimits()
H A DLzFind.h32 UInt32 hashMask; member
H A DLzmaEnc.c2745 MFB.bigHash = (Byte)(MFB.hashMask >= 0xFFFFFF ? 1 : 0); in LzmaEnc_Alloc()
/third_party/skia/third_party/externals/brotli/research/
H A Dsieve.cc145 TextIdx hashMask = (1u << hashLen) - 1u; in sieve_generate() local
154 hash = (((hash << lShift) | (hash >> rShift)) & hashMask) ^ v; in sieve_generate()
160 hash = (((hash << lShift) | (hash >> rShift)) & hashMask) ^ v; in sieve_generate()
193 hash ^= ((v << lShiftX) | (v >> rShiftX)) & hashMask; in sieve_generate()
H A Ddurchschlag.cc283 TextIdx hashMask = (1u << hashLen) - 1u; in durchschlag_prepare() local
290 hash = (((hash << lShift) | (hash >> rShift)) & hashMask) ^ v; in durchschlag_prepare()
302 TextIdx bucket = (((hash << lShift) | (hash >> rShift)) & hashMask) ^ v; in durchschlag_prepare()
304 hash = bucket ^ (((v << lShiftX) | (v >> rShiftX)) & hashMask); in durchschlag_prepare()
/third_party/skia/third_party/externals/brotli/java/org/brotli/enc/
H A DPreparedDictionaryGenerator.java60 long hashMask = (~0L) >>> (64 - hashBits); in generate()
79 long h = (accumulator & hashMask) * HASH_MULTIPLIER; in generate()

Completed in 12 milliseconds