Lines Matching refs:BITCOST_MULTIPLIER
41 # define BITCOST_MULTIPLIER (1 << BITCOST_ACCURACY)
45 # define BITCOST_MULTIPLIER (1 << BITCOST_ACCURACY) macro
49 # define BITCOST_MULTIPLIER (1 << BITCOST_ACCURACY) macro
55 return (ZSTD_highbit32(stat+1) * BITCOST_MULTIPLIER); in ZSTD_bitWeight()
62 U32 const BWeight = hb * BITCOST_MULTIPLIER; in ZSTD_fracWeight()
75 return (double)price / (BITCOST_MULTIPLIER*8); in ZSTD_fCost()
234 return (litLength << 3) * BITCOST_MULTIPLIER; /* Uncompressed - 8 bytes per literal. */ in ZSTD_rawLiteralsCost()
237 return (litLength*6) * BITCOST_MULTIPLIER; /* 6 bit per literal - no statistic used */ in ZSTD_rawLiteralsCost()
258 return (LL_bits[llCode] * BITCOST_MULTIPLIER) in ZSTD_litLengthPrice()
280 return WEIGHT(mlBase, optLevel) + ((16 + offCode) * BITCOST_MULTIPLIER); in ZSTD_getMatchPrice()
283 …price = (offCode * BITCOST_MULTIPLIER) + (optPtr->offCodeSumBasePrice - WEIGHT(optPtr->offCodeFreq… in ZSTD_getMatchPrice()
285 …price += (offCode-19)*2 * BITCOST_MULTIPLIER; /* handicap for long distance offsets, favor decompr… in ZSTD_getMatchPrice()
289 …price += (ML_bits[mlCode] * BITCOST_MULTIPLIER) + (optPtr->matchLengthSumBasePrice - WEIGHT(optPtr… in ZSTD_getMatchPrice()
292 …price += BITCOST_MULTIPLIER / 5; /* heuristic : make matches a bit more costly to favor less seq… in ZSTD_getMatchPrice()
1093 && (opt[cur+1].price <= opt[cur].price + (BITCOST_MULTIPLIER/2)) ) { in ZSTD_compressBlock_opt_generic()