75 #define OPTIMAL_ML (int)((ML_MASK-1)+MINMATCH)
82 #define HASH_FUNCTION(i)         (((i) * 2654435761U) >> ((MINMATCH*8)-LZ4HC_HASH_LOG))
288 …               matchLength = MINMATCH + (int)LZ4_count(ip+MINMATCH, matchPtr+MINMATCH, iHighLimit);  in LZ4HC_InsertAndGetWiderMatch()
302                 matchLength = (int)LZ4_count(ip+MINMATCH, matchPtr+MINMATCH, vLimit) + MINMATCH;  in LZ4HC_InsertAndGetWiderMatch()
318                 int const end = longest - MINMATCH + 1;  in LZ4HC_InsertAndGetWiderMatch()
428                 mlt = (int)LZ4_count(ip+MINMATCH, matchPtr+MINMATCH, vLimit) + MINMATCH;  in LZ4HC_InsertAndGetWiderMatch()
457 …return LZ4HC_InsertAndGetWiderMatch(hc4, ip, ip, iLimit, MINMATCH-1, matchpos, &uselessPtr, maxNbA…  in LZ4HC_InsertAndFindBestMatch()
523     assert(matchLength >= MINMATCH);  in LZ4HC_encodeSequence()
524     length = (size_t)matchLength - MINMATCH;  in LZ4HC_encodeSequence()
590         if (ml<MINMATCH) { ip++; continue; }  in LZ4HC_compress_hashChain()
631             if (ip+new_ml > start2 + ml2 - MINMATCH) new_ml = (int)(start2 - ip) + ml2 - MINMATCH;  in LZ4HC_compress_hashChain()
672                     if (ml2 < MINMATCH) {  in LZ4HC_compress_hashChain()
706                 if (ip + ml > start2 + ml2 - MINMATCH) ml = (int)(start2 - ip) + ml2 - MINMATCH;  in LZ4HC_compress_hashChain()
774             size_t const maxMlSize = MINMATCH + (ML_MASK-1) + (bytesLeftForMl * 255);  in LZ4HC_compress_hashChain()
1275     assert(mlen >= MINMATCH);  in LZ4HC_sequencePrice()
1279     if (mlen >= (int)(ML_MASK+MINMATCH))  in LZ4HC_sequencePrice()
1280         price += 1 + ((mlen-(int)(ML_MASK+MINMATCH)) / 255);  in LZ4HC_sequencePrice()
1342     int ovml = MINMATCH;  /* overflow - last sequence */  in LZ4HC_compress_optimal()
1360 …LZ4HC_match_t const firstMatch = LZ4HC_FindLongerMatch(ctx, ip, matchlimit, MINMATCH-1, nbSearches…  in LZ4HC_compress_optimal()
1378              for (rPos = 0 ; rPos < MINMATCH ; rPos++) {  in LZ4HC_compress_optimal()
1388          {   int mlen = MINMATCH;  in LZ4HC_compress_optimal()
1424                    && (opt[cur+MINMATCH].price < opt[cur].price + 3/*min seq price*/) )  in LZ4HC_compress_optimal()
1433 …newMatch = LZ4HC_FindLongerMatch(ctx, curPtr, matchlimit, MINMATCH-1, nbSearches, dict, favorDecSp…  in LZ4HC_compress_optimal()
1451                  for (litlen = 1; litlen < MINMATCH; litlen++) {  in LZ4HC_compress_optimal()
1465                  int ml = MINMATCH;  in LZ4HC_compress_optimal()
1541                  assert(ml >= MINMATCH);  in LZ4HC_compress_optimal()
1599          size_t const maxMlSize = MINMATCH + (ML_MASK-1) + (bytesLeftForMl * 255);  in LZ4HC_compress_optimal()