Lines Matching refs:BITCOST_MULTIPLIER

32 #  define BITCOST_MULTIPLIER (1 << BITCOST_ACCURACY)
36 # define BITCOST_MULTIPLIER (1 << BITCOST_ACCURACY) macro
40 # define BITCOST_MULTIPLIER (1 << BITCOST_ACCURACY) macro
48 return (ZSTD_highbit32(stat+1) * BITCOST_MULTIPLIER); in ZSTD_bitWeight()
58 U32 const BWeight = hb * BITCOST_MULTIPLIER; in ZSTD_fracWeight()
74 return (double)price / (BITCOST_MULTIPLIER*8); in ZSTD_fCost()
275 return (litLength << 3) * BITCOST_MULTIPLIER; /* Uncompressed - 8 bytes per literal. */ in ZSTD_rawLiteralsCost()
278 return (litLength*6) * BITCOST_MULTIPLIER; /* 6 bit per literal - no statistic used */ in ZSTD_rawLiteralsCost()
282 U32 const litPriceMax = optPtr->litSumBasePrice - BITCOST_MULTIPLIER; in ZSTD_rawLiteralsCost()
284 assert(optPtr->litSumBasePrice >= BITCOST_MULTIPLIER); in ZSTD_rawLiteralsCost()
308 return BITCOST_MULTIPLIER + ZSTD_litLengthPrice(ZSTD_BLOCKSIZE_MAX - 1, optPtr, optLevel); in ZSTD_litLengthPrice()
312 return (LL_bits[llCode] * BITCOST_MULTIPLIER) in ZSTD_litLengthPrice()
337 + ((16 + offCode) * BITCOST_MULTIPLIER); /* emulated offset cost */ in ZSTD_getMatchPrice()
340 …price = (offCode * BITCOST_MULTIPLIER) + (optPtr->offCodeSumBasePrice - WEIGHT(optPtr->offCodeFreq… in ZSTD_getMatchPrice()
342 …price += (offCode-19)*2 * BITCOST_MULTIPLIER; /* handicap for long distance offsets, favor decompr… in ZSTD_getMatchPrice()
346 …price += (ML_bits[mlCode] * BITCOST_MULTIPLIER) + (optPtr->matchLengthSumBasePrice - WEIGHT(optPtr… in ZSTD_getMatchPrice()
349 …price += BITCOST_MULTIPLIER / 5; /* heuristic : make matches a bit more costly to favor less seq… in ZSTD_getMatchPrice()
1270 && (opt[cur+1].price <= opt[cur].price + (BITCOST_MULTIPLIER/2)) ) { in ZSTD_compressBlock_opt_generic()