Home
last modified time | relevance | path

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

/linux-6.15/lib/lz4/
H A Dlz4hc_compress.c114 int nbAttempts = maxNbAttempts; in LZ4HC_InsertAndFindBestMatch() local
122 && (nbAttempts)) { in LZ4HC_InsertAndFindBestMatch()
123 nbAttempts--; in LZ4HC_InsertAndFindBestMatch()
187 int nbAttempts = maxNbAttempts; in LZ4HC_InsertAndGetWiderMatch() local
195 && (nbAttempts)) { in LZ4HC_InsertAndGetWiderMatch()
196 nbAttempts--; in LZ4HC_InsertAndGetWiderMatch()
/linux-6.15/lib/zstd/compress/
H A Dzstd_lazy.c541 const U32 bucketLimit = nbAttempts < bucketSize - 1 ? nbAttempts : bucketSize - 1; in ZSTD_dedicatedDictSearch_lazy_search()
590 U32 const chainAttempts = nbAttempts - ddsAttempt; in ZSTD_dedicatedDictSearch_lazy_search()
690 U32 nbAttempts = 1U << cParams->searchLog; in ZSTD_HcFindBestMatch() local
709 for ( ; (matchIndex>=lowLimit) & (nbAttempts>0) ; nbAttempts--) { in ZSTD_HcFindBestMatch()
737 ml = ZSTD_dedicatedDictSearch_lazy_search(offsetPtr, ml, nbAttempts, dms, in ZSTD_HcFindBestMatch()
752 for ( ; (matchIndex>=dmsLowestIndex) & (nbAttempts>0) ; nbAttempts--) { in ZSTD_HcFindBestMatch()
1170 U32 nbAttempts = 1U << cappedSearchLog; in ZSTD_RowFindBestMatch() local
1230 for (; (matches > 0) && (nbAttempts > 0); matches &= (matches - 1)) { in ZSTD_RowFindBestMatch()
1243 --nbAttempts; in ZSTD_RowFindBestMatch()
1301 for (; (matches > 0) && (nbAttempts > 0); matches &= (matches - 1)) { in ZSTD_RowFindBestMatch()
[all …]