Searched refs:nbAttempts (Results 1 – 2 of 2) sorted by relevance
144 int nbAttempts=maxNbAttempts; in LZ4HC_InsertAndFindBestMatch() local151 while ((matchIndex>=lowLimit) && (nbAttempts)) { in LZ4HC_InsertAndFindBestMatch()152 nbAttempts--; in LZ4HC_InsertAndFindBestMatch()198 int nbAttempts = maxNbAttempts; in LZ4HC_InsertAndGetWiderMatch() local206 while ((matchIndex>=lowLimit) && (nbAttempts)) { in LZ4HC_InsertAndGetWiderMatch()207 nbAttempts--; in LZ4HC_InsertAndGetWiderMatch()
96 int nbAttempts = ctx->searchNum; in LZ4HC_BinTree_InsertAndGetAllMatches() local114 while ((matchIndex < current) && (matchIndex>=lowLimit) && (nbAttempts)) { in LZ4HC_BinTree_InsertAndGetAllMatches()115 nbAttempts--; in LZ4HC_BinTree_InsertAndGetAllMatches()