Lines Matching defs:totalCost
298 int totalCost = 0;
303 totalCost += baseCost - (1 << (largestBits - huffNode[n].nbBits));
310 /* renorm totalCost */
311 totalCost >>= (largestBits - maxNbBits); /* note : totalCost is necessarily a multiple of baseCost */
331 while (totalCost > 0) {
332 U32 nBitsToDecrease = BIT_highbit32(totalCost) + 1;
351 totalCost -= 1 << (nBitsToDecrease - 1);
362 } /* while (totalCost > 0) */
364 while (totalCost < 0) { /* Sometimes, cost correction overshoot */
371 totalCost++;
376 totalCost++;