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

/linux-master/lib/zstd/compress/
H A Dhuf_compress.c312 { int totalCost = 0; local
317 * Compute totalCost, which is how far the sum of the ranks is
321 totalCost += baseCost - (1 << (largestBits - huffNode[n].nbBits));
330 /* renorm totalCost from 2^largestBits to 2^maxNbBits
331 * note : totalCost is necessarily a multiple of baseCost */
332 assert((totalCost & (baseCost - 1)) == 0);
333 totalCost >>= (largestBits - maxNbBits);
334 assert(totalCost > 0);
350 while (totalCost > 0) {
351 /* Try to reduce the next power of 2 above totalCost becaus
[all...]

Completed in 133 milliseconds