Searched refs:nbAttempts (Results 1 – 2 of 2) sorted by relevance
115 int nbAttempts = maxNbAttempts; in LZ4HC_InsertAndFindBestMatch() local123 && (nbAttempts)) { in LZ4HC_InsertAndFindBestMatch()124 nbAttempts--; in LZ4HC_InsertAndFindBestMatch()188 int nbAttempts = maxNbAttempts; in LZ4HC_InsertAndGetWiderMatch() local196 && (nbAttempts)) { in LZ4HC_InsertAndGetWiderMatch()197 nbAttempts--; in LZ4HC_InsertAndGetWiderMatch()
516 size_t ZSTD_dedicatedDictSearch_lazy_search(size_t* offsetPtr, size_t ml, U32 nbAttempts, in ZSTD_dedicatedDictSearch_lazy_search() argument527 const U32 bucketLimit = nbAttempts < bucketSize - 1 ? nbAttempts : bucketSize - 1; in ZSTD_dedicatedDictSearch_lazy_search()576 U32 const chainAttempts = nbAttempts - ddsAttempt; in ZSTD_dedicatedDictSearch_lazy_search()670 U32 nbAttempts = 1U << cParams->searchLog; in ZSTD_HcFindBestMatch() local689 for ( ; (matchIndex>=lowLimit) & (nbAttempts>0) ; nbAttempts--) { in ZSTD_HcFindBestMatch()714 assert(nbAttempts <= (1U << ZSTD_SEARCHLOG_MAX)); /* Check we haven't underflowed. */ in ZSTD_HcFindBestMatch()716 ml = ZSTD_dedicatedDictSearch_lazy_search(offsetPtr, ml, nbAttempts, dms, in ZSTD_HcFindBestMatch()731 for ( ; (matchIndex>=dmsLowestIndex) & (nbAttempts>0) ; nbAttempts--) { in ZSTD_HcFindBestMatch()1146 U32 nbAttempts = 1U << cappedSearchLog; in ZSTD_RowFindBestMatch() local1195 for (; (matches > 0) && (nbAttempts > 0); --nbAttempts, matches &= (matches - 1)) { in ZSTD_RowFindBestMatch()[all …]
Completed in 10 milliseconds