233     U32 matchIndex;  in LZ4HC_InsertAndGetWiderMatch()  local
241     matchIndex = HashTable[LZ4HC_hashPtr(ip)];  in LZ4HC_InsertAndGetWiderMatch()
243                 matchIndex, lowestMatchIndex);  in LZ4HC_InsertAndGetWiderMatch()
245     while ((matchIndex>=lowestMatchIndex) && (nbAttempts)) {  in LZ4HC_InsertAndGetWiderMatch()
248         assert(matchIndex < ipIndex);  in LZ4HC_InsertAndGetWiderMatch()
249         if (favorDecSpeed && (ipIndex - matchIndex < 8)) {  in LZ4HC_InsertAndGetWiderMatch()
251         } else if (matchIndex >= dictLimit) {   /* within current Prefix */  in LZ4HC_InsertAndGetWiderMatch()
252             const BYTE* const matchPtr = base + matchIndex;  in LZ4HC_InsertAndGetWiderMatch()
267             const BYTE* const matchPtr = dictBase + matchIndex;  in LZ4HC_InsertAndGetWiderMatch()
271                 const BYTE* vLimit = ip + (dictLimit - matchIndex);  in LZ4HC_InsertAndGetWiderMatch()
280 …      *matchpos = base + matchIndex + back;   /* virtual pos, relative to ip, to retrieve offset */  in LZ4HC_InsertAndGetWiderMatch()
286             if (matchIndex + longest <= ipIndex) {  in LZ4HC_InsertAndGetWiderMatch()
290                     U32 const candidateDist = DELTANEXTU16(chainTable, matchIndex + pos);  in LZ4HC_InsertAndGetWiderMatch()
296                     if (distanceToNextMatch > matchIndex) break;   /* avoid overflow */  in LZ4HC_InsertAndGetWiderMatch()
297                     matchIndex -= distanceToNextMatch;  in LZ4HC_InsertAndGetWiderMatch()
301         {   U32 const distNextMatch = DELTANEXTU16(chainTable, matchIndex);  in LZ4HC_InsertAndGetWiderMatch()
303                 U32 const matchCandidateIdx = matchIndex-1;  in LZ4HC_InsertAndGetWiderMatch()
324 …matchIndex = matchCandidateIdx + (U32)forwardPatternLength - (U32)srcPatternLength;  /* best posit…  in LZ4HC_InsertAndGetWiderMatch()
326 …matchIndex = matchCandidateIdx - (U32)backLength;   /* farthest position in current segment, will …  in LZ4HC_InsertAndGetWiderMatch()
330                                     assert(base + matchIndex < ip);  in LZ4HC_InsertAndGetWiderMatch()
331                                     if (ip - (base+matchIndex) > MAX_DISTANCE) break;  in LZ4HC_InsertAndGetWiderMatch()
334 …             *matchpos = base + matchIndex;   /* virtual pos, relative to ip, to retrieve offset */  in LZ4HC_InsertAndGetWiderMatch()
337 …                            {   U32 const distToNextPattern = DELTANEXTU16(chainTable, matchIndex);  in LZ4HC_InsertAndGetWiderMatch()
338                                     if (distToNextPattern > matchIndex) break;  /* avoid overflow */  in LZ4HC_InsertAndGetWiderMatch()
339                                     matchIndex -= distToNextPattern;  in LZ4HC_InsertAndGetWiderMatch()
346         matchIndex -= DELTANEXTU16(chainTable, matchIndex+matchChainPos);  in LZ4HC_InsertAndGetWiderMatch()
354         matchIndex = dictMatchIndex + lowestMatchIndex - (U32)dictEndOffset;  in LZ4HC_InsertAndGetWiderMatch()
355         while (ipIndex - matchIndex <= MAX_DISTANCE && nbAttempts--) {  in LZ4HC_InsertAndGetWiderMatch()
368                     *matchpos = base + matchIndex + back;  in LZ4HC_InsertAndGetWiderMatch()
375                 matchIndex -= nextOffset;  in LZ4HC_InsertAndGetWiderMatch()