28 #  define BITCOST_MULTIPLIER (1 << BITCOST_ACCURACY)
32 #  define BITCOST_MULTIPLIER (1 << BITCOST_ACCURACY)  macro
36 #  define BITCOST_MULTIPLIER (1 << BITCOST_ACCURACY)  macro
42     return (ZSTD_highbit32(stat+1) * BITCOST_MULTIPLIER);  in ZSTD_bitWeight()
49     U32 const BWeight = hb * BITCOST_MULTIPLIER;  in ZSTD_fracWeight()
62     return (double)price / (BITCOST_MULTIPLIER*8);  in ZSTD_fCost()
252         return (litLength << 3) * BITCOST_MULTIPLIER;  /* Uncompressed - 8 bytes per literal. */  in ZSTD_rawLiteralsCost()
255         return (litLength*6) * BITCOST_MULTIPLIER;  /* 6 bit per literal - no statistic used */  in ZSTD_rawLiteralsCost()
281         return BITCOST_MULTIPLIER + ZSTD_litLengthPrice(ZSTD_BLOCKSIZE_MAX - 1, optPtr, optLevel);  in ZSTD_litLengthPrice()
285         return (LL_bits[llCode] * BITCOST_MULTIPLIER)  in ZSTD_litLengthPrice()
309         return WEIGHT(mlBase, optLevel) + ((16 + offCode) * BITCOST_MULTIPLIER);  in ZSTD_getMatchPrice()
312 …price = (offCode * BITCOST_MULTIPLIER) + (optPtr->offCodeSumBasePrice - WEIGHT(optPtr->offCodeFreq…  in ZSTD_getMatchPrice()
314 …price += (offCode-19)*2 * BITCOST_MULTIPLIER; /* handicap for long distance offsets, favor decompr…  in ZSTD_getMatchPrice()
318 …price += (ML_bits[mlCode] * BITCOST_MULTIPLIER) + (optPtr->matchLengthSumBasePrice - WEIGHT(optPtr…  in ZSTD_getMatchPrice()
321 …price += BITCOST_MULTIPLIER / 5;   /* heuristic : make matches a bit more costly to favor less seq…  in ZSTD_getMatchPrice()
1190               && (opt[cur+1].price <= opt[cur].price + (BITCOST_MULTIPLIER/2)) ) {  in ZSTD_compressBlock_opt_generic()