Home
last modified time | relevance | path

Searched refs:nbCompares (Results 1 - 4 of 4) sorted by relevance

/kernel/linux/linux-6.6/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 in ZSTD_insertBtAndGetAllMatches()
[all...]
H A Dzstd_lazy.c66 U32 nbCompares, U32 btLow, in ZSTD_insertDUBT1()
96 for (; nbCompares && (matchIndex > windowLow); --nbCompares) { in ZSTD_insertDUBT1()
158 U32 nbCompares, in ZSTD_DUBT_findBetterDictMatch()
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()
64 ZSTD_insertDUBT1(const ZSTD_matchState_t* ms, U32 curr, const BYTE* inputEnd, U32 nbCompares, U32 btLow, const ZSTD_dictMode_e dictMode) ZSTD_insertDUBT1() argument
153 ZSTD_DUBT_findBetterDictMatch( const ZSTD_matchState_t* ms, const BYTE* const ip, const BYTE* const iend, size_t* offsetPtr, size_t bestLength, U32 nbCompares, U32 const mls, const ZSTD_dictMode_e dictMode) ZSTD_DUBT_findBetterDictMatch() argument
[all...]
/kernel/linux/linux-5.10/lib/zstd/
H A Dcompress.c1561 static U32 ZSTD_insertBt1(ZSTD_CCtx *zc, const BYTE *const ip, const U32 mls, const BYTE *const iend, U32 nbCompares, U32 extDict) in ZSTD_insertBt1() argument
1588 while (nbCompares-- && (matchIndex > windowLow)) { in ZSTD_insertBt1()
1643 static size_t ZSTD_insertBtAndFindBestMatch(ZSTD_CCtx *zc, const BYTE *const ip, const BYTE *const iend, size_t *offsetPtr, U32 nbCompares, const U32 mls, in ZSTD_insertBtAndFindBestMatch() argument
1670 while (nbCompares-- && (matchIndex > windowLow)) { in ZSTD_insertBtAndFindBestMatch()
1724 static void ZSTD_updateTree(ZSTD_CCtx *zc, const BYTE *const ip, const BYTE *const iend, const U32 nbCompares, const U32 mls) in ZSTD_updateTree() argument
1731 idx += ZSTD_insertBt1(zc, base + idx, mls, iend, nbCompares, 0); in ZSTD_updateTree()
1755 static void ZSTD_updateTree_extDict(ZSTD_CCtx *zc, const BYTE *const ip, const BYTE *const iend, const U32 nbCompares, const U32 mls) in ZSTD_updateTree_extDict() argument
1762 idx += ZSTD_insertBt1(zc, base + idx, mls, iend, nbCompares, 1); in ZSTD_updateTree_extDict()
H A Dzstd_opt.h235 static U32 ZSTD_insertBtAndGetAllMatches(ZSTD_CCtx *zc, const BYTE *const ip, const BYTE *const iLimit, U32 nbCompares, const U32 mls, U32 extDict, in ZSTD_insertBtAndGetAllMatches() argument
295 while (nbCompares-- && (matchIndex > windowLow)) { in ZSTD_insertBtAndGetAllMatches()

Completed in 18 milliseconds