Lines Matching refs:cost
1970 * uses the smallest state value possible, saving the cost of this symbol */
1999 * Approximate maximum cost of a symbol, in bits.
2002 * note 2 : if freq[symbolValue]==0, @return a fake cost of tableLog+1 bits */
2010 * Approximate symbol cost, as fractional value, using fixed-point format (accuracyLog fractional bits)
2012 * note 2 : if freq[symbolValue]==0, @return a fake cost of tableLog+1 bits */
3136 The lower the level, the faster the speed (at the cost of compression).
3904 * The resulting state can be used for future compression operations with very limited startup cost.
4052 * It's recommended to "load once, use many times", to amortize the cost
4084 * Note 4 : Referencing a raw content prefix has almost no cpu nor memory cost.
4256 * the CDict's tables incurs a fixed cost at the beginning of the
4258 * the cost of the compression.
4262 * tables. However, this model incurs no start-up cost (as long as the
5139 Frame metadata cost is typically ~12 bytes, which can be non-negligible for very small blocks (< 100 bytes).
5513 * This comes at a performance cost for big-endian CPU, since some swapping is required to emulate little-endian format.
8599 /* repay normalized cost */
8640 while (totalCost < 0) { /* Sometimes, cost correction overshoot */
9331 * be moved around at no cost for a new compression.
10028 ZSTD_OptPrice_e priceType; /* prices can be determined dynamically, or follow a pre-defined cost structure */
10929 * listing each element, its frequency, and its predicted bit cost */
11308 * Returns the cost in bytes of encoding the normalized count header.
11322 * Returns the cost in bits of encoding the distribution described by count
11327 unsigned cost = 0;
11334 cost += count[s] * kInverseProbabilityLog256[norm];
11336 return cost >> 8;
11340 * Returns the cost in bits of encoding the distribution in count using ctable.
11349 size_t cost = 0;
11368 cost += (size_t)count[s] * bitCost;
11370 return cost >> kAccuracyLog;
11374 * Returns the cost in bits of encoding the distribution in count using the
11382 size_t cost = 0;
11390 cost += count[s] * kInverseProbabilityLog256[norm256];
11392 return cost >> 8;
20166 #define ZSTD_PREDEF_THRESHOLD 1024 /* if srcSize < ZSTD_PREDEF_THRESHOLD, symbols' cost is assumed static, directly determined by pre-defined distributions */
20277 optPtr->litFreq[lit] = bitCost ? 1 << (scaleLog-bitCost) : 1 /*minimum to calculate cost*/;
20289 optPtr->litLengthFreq[ll] = bitCost ? 1 << (scaleLog-bitCost) : 1 /*minimum to calculate cost*/;
20301 optPtr->matchLengthFreq[ml] = bitCost ? 1 << (scaleLog-bitCost) : 1 /*minimum to calculate cost*/;
20313 optPtr->offCodeFreq[of] = bitCost ? 1 << (scaleLog-bitCost) : 1 /*minimum to calculate cost*/;
20377 assert(WEIGHT(optPtr->litFreq[literals[u]], optLevel) <= optPtr->litSumBasePrice); /* literal cost should never be negative */
20385 * cost of literalLength symbol */
20399 * Provides the cost of the match part (offset + matchLength) of a sequence
20400 * Must be combined with ZSTD_fullLiteralsCost() to get the full cost of a sequence.
21058 DEBUGLOG(7, "cPos:%zi==rPos:%u : literal would cost more (%.2f>%.2f) (hist:%u,%u,%u)",
21302 * the cost is 2x cpu time on first block. */