Searched refs:largestBits (Results 1 - 1 of 1) sorted by last modified time

/linux-master/lib/zstd/compress/
H A Dhuf_compress.c292 * @pre The sum of the ranks of each symbol == 2^largestBits,
293 * where largestBits == huffNode[lastNonNull].nbBits.
294 * @post The sum of the ranks of each symbol == 2^largestBits,
295 * where largestBits is the return value <= maxNbBits.
307 const U32 largestBits = huffNode[lastNonNull].nbBits; local
309 if (largestBits <= maxNbBits) return largestBits;
313 const U32 baseCost = 1 << (largestBits - maxNbBits);
318 * we are over 2^largestBits after adjust the offending ranks.
321 totalCost += baseCost - (1 << (largestBits
[all...]

Completed in 173 milliseconds