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()
620 U32 nbAttempts = 1U << cParams->searchLog; in ZSTD_HcFindBestMatch_generic() local639 for ( ; (matchIndex>=lowLimit) & (nbAttempts>0) ; nbAttempts--) { in ZSTD_HcFindBestMatch_generic()664 assert(nbAttempts <= (1U << ZSTD_SEARCHLOG_MAX)); /* Check we haven't underflowed. */ in ZSTD_HcFindBestMatch_generic()672 const U32 bucketLimit = nbAttempts < bucketSize - 1 ? nbAttempts : bucketSize - 1; in ZSTD_HcFindBestMatch_generic()720 U32 const chainAttempts = nbAttempts - ddsAttempt; in ZSTD_HcFindBestMatch_generic()763 for ( ; (matchIndex>=dmsLowestIndex) & (nbAttempts>0) ; nbAttempts--) { in ZSTD_HcFindBestMatch_generic()