163     U32 matchIndex;  in LZ4HC_InsertAndFindBestMatch()  local
170     matchIndex = HashTable[LZ4HC_hashPtr(ip)];  in LZ4HC_InsertAndFindBestMatch()
172     while ((matchIndex>=lowLimit) && (nbAttempts))  in LZ4HC_InsertAndFindBestMatch()
175         if (matchIndex >= dictLimit)  in LZ4HC_InsertAndFindBestMatch()
177             match = base + matchIndex;  in LZ4HC_InsertAndFindBestMatch()
187             match = dictBase + matchIndex;  in LZ4HC_InsertAndFindBestMatch()
191                 const BYTE* vLimit = ip + (dictLimit - matchIndex);  in LZ4HC_InsertAndFindBestMatch()
196                 if (mlt > ml) { ml = mlt; *matchpos = base + matchIndex; }   /* virtual matchpos */  in LZ4HC_InsertAndFindBestMatch()
199         matchIndex -= chainTable[matchIndex & 0xFFFF];  in LZ4HC_InsertAndFindBestMatch()
223     U32   matchIndex;  in LZ4HC_InsertAndGetWiderMatch()  local
230     matchIndex = HashTable[LZ4HC_hashPtr(ip)];  in LZ4HC_InsertAndGetWiderMatch()
232     while ((matchIndex>=lowLimit) && (nbAttempts))  in LZ4HC_InsertAndGetWiderMatch()
235         if (matchIndex >= dictLimit)  in LZ4HC_InsertAndGetWiderMatch()
237             match = base + matchIndex;  in LZ4HC_InsertAndGetWiderMatch()
257             match = dictBase + matchIndex;  in LZ4HC_InsertAndGetWiderMatch()
262                 const BYTE* vLimit = ip + (dictLimit - matchIndex);  in LZ4HC_InsertAndGetWiderMatch()
267 …while ((ip+back > iLowLimit) && (matchIndex+back > lowLimit) && (ip[back-1] == match[back-1])) bac…  in LZ4HC_InsertAndGetWiderMatch()
269 …if ((int)mlt > longest) { longest = (int)mlt; *matchpos = base + matchIndex + back; *startpos = ip…  in LZ4HC_InsertAndGetWiderMatch()
272         matchIndex -= chainTable[matchIndex & 0xFFFF];  in LZ4HC_InsertAndGetWiderMatch()