143     U32 matchIndex;  in LZ4HC_InsertAndFindBestMatch()  local
149     matchIndex = HashTable[LZ4HC_hashPtr(ip)];  in LZ4HC_InsertAndFindBestMatch()
151     while ((matchIndex>=lowLimit) && (nbAttempts)) {  in LZ4HC_InsertAndFindBestMatch()
153         if (matchIndex >= dictLimit) {  in LZ4HC_InsertAndFindBestMatch()
154             const BYTE* const match = base + matchIndex;  in LZ4HC_InsertAndFindBestMatch()
162             const BYTE* const match = dictBase + matchIndex;  in LZ4HC_InsertAndFindBestMatch()
165                 const BYTE* vLimit = ip + (dictLimit - matchIndex);  in LZ4HC_InsertAndFindBestMatch()
170                 if (mlt > ml) { ml = mlt; *matchpos = base + matchIndex; }   /* virtual matchpos */  in LZ4HC_InsertAndFindBestMatch()
173         matchIndex -= DELTANEXTU16(matchIndex);  in LZ4HC_InsertAndFindBestMatch()
197     U32   matchIndex;  in LZ4HC_InsertAndGetWiderMatch()  local
204     matchIndex = HashTable[LZ4HC_hashPtr(ip)];  in LZ4HC_InsertAndGetWiderMatch()
206     while ((matchIndex>=lowLimit) && (nbAttempts)) {  in LZ4HC_InsertAndGetWiderMatch()
208         if (matchIndex >= dictLimit) {  in LZ4HC_InsertAndGetWiderMatch()
209             const BYTE* matchPtr = base + matchIndex;  in LZ4HC_InsertAndGetWiderMatch()
230             const BYTE* const matchPtr = dictBase + matchIndex;  in LZ4HC_InsertAndGetWiderMatch()
234                 const BYTE* vLimit = ip + (dictLimit - matchIndex);  in LZ4HC_InsertAndGetWiderMatch()
239 …while ((ip+back > iLowLimit) && (matchIndex+back > lowLimit) && (ip[back-1] == matchPtr[back-1])) …  in LZ4HC_InsertAndGetWiderMatch()
241 …if ((int)mlt > longest) { longest = (int)mlt; *matchpos = base + matchIndex + back; *startpos = ip…  in LZ4HC_InsertAndGetWiderMatch()
244         matchIndex -= DELTANEXTU16(matchIndex);  in LZ4HC_InsertAndGetWiderMatch()