1367              LZ4HC_match_t newMatch;  in LZ4HC_compress_optimal()  local
1385 …newMatch = LZ4HC_FindLongerMatch(ctx, curPtr, matchlimit, MINMATCH-1, nbSearches, dict, favorDecSp…  in LZ4HC_compress_optimal()
1388 …newMatch = LZ4HC_FindLongerMatch(ctx, curPtr, matchlimit, last_match_pos - cur, nbSearches, dict, …  in LZ4HC_compress_optimal()
1389              if (!newMatch.len) continue;  in LZ4HC_compress_optimal()
1391              if ( ((size_t)newMatch.len > sufficient_len)  in LZ4HC_compress_optimal()
1392                || (newMatch.len + cur >= LZ4_OPT_NUM) ) {  in LZ4HC_compress_optimal()
1394                  best_mlen = newMatch.len;  in LZ4HC_compress_optimal()
1395                  best_off = newMatch.off;  in LZ4HC_compress_optimal()
1416              {   int const matchML = newMatch.len;  in LZ4HC_compress_optimal()
1419                  assert(cur + newMatch.len < LZ4_OPT_NUM);  in LZ4HC_compress_optimal()
1422                      int const offset = newMatch.off;  in LZ4HC_compress_optimal()