BITCOST_MULTIPLIER
&& (opt[cur+1].price <= opt[cur].price + (BITCOST_MULTIPLIER/2)) ) {
return (litLength << 3) * BITCOST_MULTIPLIER; /* Uncompressed - 8 bytes per literal. */
return (litLength*6) * BITCOST_MULTIPLIER; /* 6 bit per literal - no statistic used */
U32 const litPriceMax = optPtr->litSumBasePrice - BITCOST_MULTIPLIER;
assert(optPtr->litSumBasePrice >= BITCOST_MULTIPLIER);
return BITCOST_MULTIPLIER + ZSTD_litLengthPrice(ZSTD_BLOCKSIZE_MAX - 1, optPtr, optLevel);
return (LL_bits[llCode] * BITCOST_MULTIPLIER)
+ ((16 + offCode) * BITCOST_MULTIPLIER); /* emulated offset cost */
price = (offCode * BITCOST_MULTIPLIER) + (optPtr->offCodeSumBasePrice - WEIGHT(optPtr->offCodeFreq[offCode], optLevel));
price += (offCode-19)*2 * BITCOST_MULTIPLIER; /* handicap for long distance offsets, favor decompression speed */
price += (ML_bits[mlCode] * BITCOST_MULTIPLIER) + (optPtr->matchLengthSumBasePrice - WEIGHT(optPtr->matchLengthFreq[mlCode], optLevel));
price += BITCOST_MULTIPLIER / 5; /* heuristic : make matches a bit more costly to favor less sequences -> faster decompression speed */
return (ZSTD_highbit32(stat+1) * BITCOST_MULTIPLIER);
U32 const BWeight = hb * BITCOST_MULTIPLIER;
return (double)price / (BITCOST_MULTIPLIER*8);