Searched refs:vLimit (Results 1 – 2 of 2) sorted by relevance
165 const BYTE* vLimit = ip + (dictLimit - matchIndex); in LZ4HC_InsertAndFindBestMatch() local166 if (vLimit > iLimit) vLimit = iLimit; in LZ4HC_InsertAndFindBestMatch()167 mlt = LZ4_count(ip+MINMATCH, match+MINMATCH, vLimit) + MINMATCH; in LZ4HC_InsertAndFindBestMatch()168 if ((ip+mlt == vLimit) && (vLimit < iLimit)) in LZ4HC_InsertAndFindBestMatch()234 const BYTE* vLimit = ip + (dictLimit - matchIndex); in LZ4HC_InsertAndGetWiderMatch() local235 if (vLimit > iHighLimit) vLimit = iHighLimit; in LZ4HC_InsertAndGetWiderMatch()236 mlt = LZ4_count(ip+MINMATCH, matchPtr+MINMATCH, vLimit) + MINMATCH; in LZ4HC_InsertAndGetWiderMatch()237 if ((ip+mlt == vLimit) && (vLimit < iHighLimit)) in LZ4HC_InsertAndGetWiderMatch()
120 const BYTE* vLimit = ip + (dictLimit - matchIndex); in LZ4HC_BinTree_InsertAndGetAllMatches() local122 if (vLimit > iHighLimit) vLimit = iHighLimit; in LZ4HC_BinTree_InsertAndGetAllMatches()123 matchLength = LZ4_count(ip, match, vLimit); in LZ4HC_BinTree_InsertAndGetAllMatches()124 if ((ip+matchLength == vLimit) && (vLimit < iHighLimit)) in LZ4HC_BinTree_InsertAndGetAllMatches()