Home
last modified time | relevance | path

Searched refs:hashLen (Results 1 – 2 of 2) sorted by relevance

/external/brotli/research/
Dsieve.cc140 TextIdx hashLen = 11; in sieve_generate() local
141 while (hashLen < 29 && ((1u << hashLen) < end)) { in sieve_generate()
142 hashLen += 3; in sieve_generate()
144 hashLen -= 3; in sieve_generate()
145 TextIdx hashMask = (1u << hashLen) - 1u; in sieve_generate()
146 std::vector<TextIdx> hashHead(1 << hashLen); in sieve_generate()
151 TextIdx rShift = hashLen - lShift; in sieve_generate()
156 TextIdx lShiftX = (lShift * (sliceLen - 1)) % hashLen; in sieve_generate()
157 TextIdx rShiftX = hashLen - lShiftX; in sieve_generate()
Ddurchschlag.cc278 TextIdx hashLen = 11; in durchschlag_prepare() local
279 while (hashLen < 29 && ((1u << hashLen) < end)) { in durchschlag_prepare()
280 hashLen += 3; in durchschlag_prepare()
282 hashLen -= 3; in durchschlag_prepare()
283 TextIdx hashMask = (1u << hashLen) - 1u; in durchschlag_prepare()
284 std::vector<TextIdx> hashHead(1 << hashLen); in durchschlag_prepare()
287 TextIdx rShift = hashLen - lShift; in durchschlag_prepare()
292 TextIdx lShiftX = (lShift * (sliceLen - 1)) % hashLen; in durchschlag_prepare()
293 TextIdx rShiftX = hashLen - lShiftX; in durchschlag_prepare()