iLimit 102 lib/lz4/lz4hc_compress.c const BYTE * const iLimit, iLimit 131 lib/lz4/lz4hc_compress.c match + MINMATCH, iLimit) + MINMATCH; iLimit 146 lib/lz4/lz4hc_compress.c if (vLimit > iLimit) iLimit 147 lib/lz4/lz4hc_compress.c vLimit = iLimit; iLimit 151 lib/lz4/lz4hc_compress.c && (vLimit < iLimit)) iLimit 154 lib/lz4/lz4hc_compress.c iLimit); iLimit 1735 lib/zstd/compress.c static size_t ZSTD_BtFindBestMatch(ZSTD_CCtx *zc, const BYTE *const ip, const BYTE *const iLimit, size_t *offsetPtr, const U32 maxNbAttempts, const U32 mls) iLimit 1739 lib/zstd/compress.c ZSTD_updateTree(zc, ip, iLimit, maxNbAttempts, mls); iLimit 1740 lib/zstd/compress.c return ZSTD_insertBtAndFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, mls, 0); iLimit 1744 lib/zstd/compress.c const BYTE *ip, const BYTE *const iLimit, size_t *offsetPtr, const U32 maxNbAttempts, const U32 matchLengthSearch) iLimit 1748 lib/zstd/compress.c case 4: return ZSTD_BtFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, 4); iLimit 1749 lib/zstd/compress.c case 5: return ZSTD_BtFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, 5); iLimit 1751 lib/zstd/compress.c case 6: return ZSTD_BtFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, 6); iLimit 1766 lib/zstd/compress.c static size_t ZSTD_BtFindBestMatch_extDict(ZSTD_CCtx *zc, const BYTE *const ip, const BYTE *const iLimit, size_t *offsetPtr, const U32 maxNbAttempts, iLimit 1771 lib/zstd/compress.c ZSTD_updateTree_extDict(zc, ip, iLimit, maxNbAttempts, mls); iLimit 1772 lib/zstd/compress.c return ZSTD_insertBtAndFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, mls, 1); iLimit 1776 lib/zstd/compress.c const BYTE *ip, const BYTE *const iLimit, size_t *offsetPtr, const U32 maxNbAttempts, iLimit 1781 lib/zstd/compress.c case 4: return ZSTD_BtFindBestMatch_extDict(zc, ip, iLimit, offsetPtr, maxNbAttempts, 4); iLimit 1782 lib/zstd/compress.c case 5: return ZSTD_BtFindBestMatch_extDict(zc, ip, iLimit, offsetPtr, maxNbAttempts, 5); iLimit 1784 lib/zstd/compress.c case 6: return ZSTD_BtFindBestMatch_extDict(zc, ip, iLimit, offsetPtr, maxNbAttempts, 6); iLimit 1820 lib/zstd/compress.c const BYTE *const ip, const BYTE *const iLimit, size_t *offsetPtr, const U32 maxNbAttempts, const U32 mls, iLimit 1846 lib/zstd/compress.c currMl = ZSTD_count(ip, match, iLimit); iLimit 1850 lib/zstd/compress.c currMl = ZSTD_count_2segments(ip + EQUAL_READ32, match + EQUAL_READ32, iLimit, dictEnd, prefixStart) + EQUAL_READ32; iLimit 1857 lib/zstd/compress.c if (ip + currMl == iLimit) iLimit 1869 lib/zstd/compress.c FORCE_INLINE size_t ZSTD_HcFindBestMatch_selectMLS(ZSTD_CCtx *zc, const BYTE *ip, const BYTE *const iLimit, size_t *offsetPtr, const U32 maxNbAttempts, iLimit 1874 lib/zstd/compress.c case 4: return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 4, 0); iLimit 1875 lib/zstd/compress.c case 5: return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 5, 0); iLimit 1877 lib/zstd/compress.c case 6: return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 6, 0); iLimit 1881 lib/zstd/compress.c FORCE_INLINE size_t ZSTD_HcFindBestMatch_extDict_selectMLS(ZSTD_CCtx *zc, const BYTE *ip, const BYTE *const iLimit, size_t *offsetPtr, const U32 maxNbAttempts, iLimit 1886 lib/zstd/compress.c case 4: return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 4, 1); iLimit 1887 lib/zstd/compress.c case 5: return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 5, 1); iLimit 1889 lib/zstd/compress.c case 6: return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 6, 1); iLimit 1910 lib/zstd/compress.c typedef size_t (*searchMax_f)(ZSTD_CCtx * zc, const BYTE *ip, const BYTE *iLimit, size_t *offsetPtr, U32 maxNbAttempts, U32 matchLengthSearch); iLimit 2077 lib/zstd/compress.c typedef size_t (*searchMax_f)(ZSTD_CCtx * zc, const BYTE *ip, const BYTE *iLimit, size_t *offsetPtr, U32 maxNbAttempts, U32 matchLengthSearch); iLimit 235 lib/zstd/zstd_opt.h static U32 ZSTD_insertBtAndGetAllMatches(ZSTD_CCtx *zc, const BYTE *const ip, const BYTE *const iLimit, U32 nbCompares, const U32 mls, U32 extDict, iLimit 271 lib/zstd/zstd_opt.h currMl = ZSTD_count(ip, match, iLimit); iLimit 276 lib/zstd/zstd_opt.h currMl = ZSTD_count_2segments(ip + MINMATCH, match + MINMATCH, iLimit, dictEnd, prefixStart) + MINMATCH; iLimit 287 lib/zstd/zstd_opt.h if (ip + currMl == iLimit) iLimit 303 lib/zstd/zstd_opt.h matchLength += ZSTD_count(ip + matchLength + 1, match + matchLength + 1, iLimit) + 1; iLimit 307 lib/zstd/zstd_opt.h matchLength += ZSTD_count_2segments(ip + matchLength, match + matchLength, iLimit, dictEnd, prefixStart); iLimit 321 lib/zstd/zstd_opt.h if (ip + matchLength == iLimit) /* equal : no way to know if inf or sup */ iLimit 356 lib/zstd/zstd_opt.h static U32 ZSTD_BtGetAllMatches(ZSTD_CCtx *zc, const BYTE *const ip, const BYTE *const iLimit, const U32 maxNbAttempts, const U32 mls, ZSTD_match_t *matches, iLimit 361 lib/zstd/zstd_opt.h ZSTD_updateTree(zc, ip, iLimit, maxNbAttempts, mls); iLimit 362 lib/zstd/zstd_opt.h return ZSTD_insertBtAndGetAllMatches(zc, ip, iLimit, maxNbAttempts, mls, 0, matches, minMatchLen); iLimit 380 lib/zstd/zstd_opt.h static U32 ZSTD_BtGetAllMatches_extDict(ZSTD_CCtx *zc, const BYTE *const ip, const BYTE *const iLimit, const U32 maxNbAttempts, const U32 mls, iLimit 385 lib/zstd/zstd_opt.h ZSTD_updateTree_extDict(zc, ip, iLimit, maxNbAttempts, mls); iLimit 386 lib/zstd/zstd_opt.h return ZSTD_insertBtAndGetAllMatches(zc, ip, iLimit, maxNbAttempts, mls, 1, matches, minMatchLen);