Home
last modified time | relevance | path

Searched refs:nbCompares (Results 1 – 2 of 2) sorted by relevance

/linux/lib/zstd/compress/
H A Dzstd_opt.c443 U32 nbCompares = 1U << cParams->searchLog; in ZSTD_insertBt1() local
458 for (; nbCompares && (matchIndex >= windowLow); --nbCompares) { in ZSTD_insertBt1()
591 U32 nbCompares = 1U << cParams->searchLog; in ZSTD_insertBtAndGetAllMatches() local
689 for (; nbCompares && (matchIndex >= matchLow); --nbCompares) { in ZSTD_insertBtAndGetAllMatches()
720 … if (dictMode == ZSTD_dictMatchState) nbCompares = 0; /* break should also skip searching dms */ in ZSTD_insertBtAndGetAllMatches()
741 assert(nbCompares <= (1U << ZSTD_SEARCHLOG_MAX)); /* Check we haven't underflowed. */ in ZSTD_insertBtAndGetAllMatches()
742 if (dictMode == ZSTD_dictMatchState && nbCompares) { in ZSTD_insertBtAndGetAllMatches()
747 for (; nbCompares && (dictMatchIndex > dmsLowLimit); --nbCompares) { in ZSTD_insertBtAndGetAllMatches()
H A Dzstd_lazy.c66 U32 nbCompares, U32 btLow, in ZSTD_insertDUBT1() argument
96 for (; nbCompares && (matchIndex > windowLow); --nbCompares) { in ZSTD_insertDUBT1()
158 U32 nbCompares, in ZSTD_DUBT_findBetterDictMatch() argument
188 for (; nbCompares && (dictMatchIndex > dictLowLimit); --nbCompares) { in ZSTD_DUBT_findBetterDictMatch()
255 U32 nbCompares = 1U << cParams->searchLog; in ZSTD_DUBT_findBestMatch() local
256 U32 nbCandidates = nbCompares; in ZSTD_DUBT_findBestMatch()
312 for (; nbCompares && (matchIndex > windowLow); --nbCompares) { in ZSTD_DUBT_findBestMatch()
334 nbCompares = 0; /* in addition to avoiding checking any in ZSTD_DUBT_findBestMatch()
360 assert(nbCompares <= (1U << ZSTD_SEARCHLOG_MAX)); /* Check we haven't underflowed. */ in ZSTD_DUBT_findBestMatch()
361 if (dictMode == ZSTD_dictMatchState && nbCompares) { in ZSTD_DUBT_findBestMatch()
[all …]