Lines Matching defs:total
175 { unsigned total = 0;
188 assert(total <= INT_MAX);
189 symbolTT[s].deltaFindState = (int)(total - 1);
190 total ++;
197 symbolTT[s].deltaFindState = (int)(total - (unsigned)normalizedCounter[s]);
198 total += (unsigned)normalizedCounter[s];
387 static size_t FSE_normalizeM2(short* norm, U32 tableLog, const unsigned* count, size_t total, U32 maxSymbolValue, short lowProbCount)
395 U32 const lowThreshold = (U32)(total >> tableLog);
396 U32 lowOne = (U32)((total * 3) >> (tableLog + 1));
406 total -= count[s];
412 total -= count[s];
423 if ((total / ToDistribute) > lowOne) {
425 lowOne = (U32)((total * 3) / (ToDistribute * 2));
430 total -= count[s];
447 if (total == 0) {
456 U64 const rStep = ZSTD_div64((((U64)1<<vStepLog) * ToDistribute) + mid, (U32)total); /* scale on remaining */
474 const unsigned* count, size_t total,
481 if (tableLog < FSE_minTableLog(total, maxSymbolValue)) return ERROR(GENERIC); /* Too small tableLog, compression potentially impossible */
486 U64 const step = ZSTD_div64((U64)1<<62, (U32)total); /* <== here, one division ! */
492 U32 lowThreshold = (U32)(total >> tableLog);
495 if (count[s] == total) return 0; /* rle special case */
512 size_t const errorCode = FSE_normalizeM2(normalizedCounter, tableLog, count, total, maxSymbolValue, lowProbCount);