ml2 358 lib/lz4/lz4hc_compress.c int ml, ml2, ml3, ml0; ml2 393 lib/lz4/lz4hc_compress.c ml2 = LZ4HC_InsertAndGetWiderMatch(ctx, ml2 398 lib/lz4/lz4hc_compress.c ml2 = ml; ml2 400 lib/lz4/lz4hc_compress.c if (ml2 == ml) { ml2 420 lib/lz4/lz4hc_compress.c ml = ml2; ml2 438 lib/lz4/lz4hc_compress.c if (ip + new_ml > start2 + ml2 - MINMATCH) ml2 439 lib/lz4/lz4hc_compress.c new_ml = (int)(start2 - ip) + ml2 - MINMATCH; ml2 446 lib/lz4/lz4hc_compress.c ml2 -= correction; ml2 454 lib/lz4/lz4hc_compress.c if (start2 + ml2 < mflimit) ml2 456 lib/lz4/lz4hc_compress.c start2 + ml2 - 3, start2, ml2 457 lib/lz4/lz4hc_compress.c matchlimit, ml2, &ref3, &start3, ml2 460 lib/lz4/lz4hc_compress.c ml3 = ml2; ml2 462 lib/lz4/lz4hc_compress.c if (ml3 == ml2) { ml2 473 lib/lz4/lz4hc_compress.c ml2, ref2, limit, oend)) ml2 490 lib/lz4/lz4hc_compress.c ml2 -= correction; ml2 491 lib/lz4/lz4hc_compress.c if (ml2 < MINMATCH) { ml2 494 lib/lz4/lz4hc_compress.c ml2 = ml3; ml2 507 lib/lz4/lz4hc_compress.c ml0 = ml2; ml2 513 lib/lz4/lz4hc_compress.c ml2 = ml3; ml2 528 lib/lz4/lz4hc_compress.c if (ip + ml > start2 + ml2 - MINMATCH) ml2 529 lib/lz4/lz4hc_compress.c ml = (int)(start2 - ip) + ml2 - MINMATCH; ml2 534 lib/lz4/lz4hc_compress.c ml2 -= correction; ml2 545 lib/lz4/lz4hc_compress.c ml = ml2; ml2 549 lib/lz4/lz4hc_compress.c ml2 = ml3; ml2 1942 lib/zstd/compress.c size_t const ml2 = searchMax(ctx, ip, iend, &offsetFound, maxSearches, mls); ml2 1943 lib/zstd/compress.c if (ml2 > matchLength) ml2 1944 lib/zstd/compress.c matchLength = ml2, start = ip, offset = offsetFound; ml2 1965 lib/zstd/compress.c size_t const ml2 = searchMax(ctx, ip, iend, &offset2, maxSearches, mls); ml2 1966 lib/zstd/compress.c int const gain2 = (int)(ml2 * 4 - ZSTD_highbit32((U32)offset2 + 1)); /* raw approx */ ml2 1968 lib/zstd/compress.c if ((ml2 >= EQUAL_READ32) && (gain2 > gain1)) { ml2 1969 lib/zstd/compress.c matchLength = ml2, offset = offset2, start = ip; ml2 1978 lib/zstd/compress.c size_t const ml2 = ZSTD_count(ip + EQUAL_READ32, ip + EQUAL_READ32 - offset_1, iend) + EQUAL_READ32; ml2 1979 lib/zstd/compress.c int const gain2 = (int)(ml2 * 4); ml2 1981 lib/zstd/compress.c if ((ml2 >= EQUAL_READ32) && (gain2 > gain1)) ml2 1982 lib/zstd/compress.c matchLength = ml2, offset = 0, start = ip; ml2 1986 lib/zstd/compress.c size_t const ml2 = searchMax(ctx, ip, iend, &offset2, maxSearches, mls); ml2 1987 lib/zstd/compress.c int const gain2 = (int)(ml2 * 4 - ZSTD_highbit32((U32)offset2 + 1)); /* raw approx */ ml2 1989 lib/zstd/compress.c if ((ml2 >= EQUAL_READ32) && (gain2 > gain1)) { ml2 1990 lib/zstd/compress.c matchLength = ml2, offset = offset2, start = ip; ml2 2112 lib/zstd/compress.c size_t const ml2 = searchMax(ctx, ip, iend, &offsetFound, maxSearches, mls); ml2 2113 lib/zstd/compress.c if (ml2 > matchLength) ml2 2114 lib/zstd/compress.c matchLength = ml2, start = ip, offset = offsetFound; ml2 2149 lib/zstd/compress.c size_t const ml2 = searchMax(ctx, ip, iend, &offset2, maxSearches, mls); ml2 2150 lib/zstd/compress.c int const gain2 = (int)(ml2 * 4 - ZSTD_highbit32((U32)offset2 + 1)); /* raw approx */ ml2 2152 lib/zstd/compress.c if ((ml2 >= EQUAL_READ32) && (gain2 > gain1)) { ml2 2153 lib/zstd/compress.c matchLength = ml2, offset = offset2, start = ip; ml2 2184 lib/zstd/compress.c size_t const ml2 = searchMax(ctx, ip, iend, &offset2, maxSearches, mls); ml2 2185 lib/zstd/compress.c int const gain2 = (int)(ml2 * 4 - ZSTD_highbit32((U32)offset2 + 1)); /* raw approx */ ml2 2187 lib/zstd/compress.c if ((ml2 >= EQUAL_READ32) && (gain2 > gain1)) { ml2 2188 lib/zstd/compress.c matchLength = ml2, offset = offset2, start = ip;