| /Linux-v4.19/lib/lz4/ |
| D | lz4hc_compress.c | 104 const int maxNbAttempts) in LZ4HC_InsertAndFindBestMatch() argument
115 int nbAttempts = maxNbAttempts; in LZ4HC_InsertAndFindBestMatch()
176 const int maxNbAttempts) in LZ4HC_InsertAndGetWiderMatch() argument
188 int nbAttempts = maxNbAttempts; in LZ4HC_InsertAndGetWiderMatch()
357 unsigned int maxNbAttempts; in LZ4HC_compress_generic() local
372 maxNbAttempts = 1 << (compressionLevel - 1); in LZ4HC_compress_generic()
380 matchlimit, (&ref), maxNbAttempts); in LZ4HC_compress_generic()
396 &start2, maxNbAttempts); in LZ4HC_compress_generic()
458 maxNbAttempts); in LZ4HC_compress_generic()
|
| /Linux-v4.19/lib/zstd/ |
| D | zstd_opt.h | 356 …D_CCtx *zc, const BYTE *const ip, const BYTE *const iLimit, const U32 maxNbAttempts, const U32 mls… in ZSTD_BtGetAllMatches() argument
361 ZSTD_updateTree(zc, ip, iLimit, maxNbAttempts, mls); in ZSTD_BtGetAllMatches()
362 return ZSTD_insertBtAndGetAllMatches(zc, ip, iLimit, maxNbAttempts, mls, 0, matches, minMatchLen); in ZSTD_BtGetAllMatches()
366 …const BYTE *ip, const BYTE *const iHighLimit, const U32 maxNbAttempts, const U32 matchLengthSearch, in ZSTD_BtGetAllMatches_selectMLS() argument
370 case 3: return ZSTD_BtGetAllMatches(zc, ip, iHighLimit, maxNbAttempts, 3, matches, minMatchLen); in ZSTD_BtGetAllMatches_selectMLS()
372 case 4: return ZSTD_BtGetAllMatches(zc, ip, iHighLimit, maxNbAttempts, 4, matches, minMatchLen); in ZSTD_BtGetAllMatches_selectMLS()
373 case 5: return ZSTD_BtGetAllMatches(zc, ip, iHighLimit, maxNbAttempts, 5, matches, minMatchLen); in ZSTD_BtGetAllMatches_selectMLS()
375 case 6: return ZSTD_BtGetAllMatches(zc, ip, iHighLimit, maxNbAttempts, 6, matches, minMatchLen); in ZSTD_BtGetAllMatches_selectMLS()
380 …D_CCtx *zc, const BYTE *const ip, const BYTE *const iLimit, const U32 maxNbAttempts, const U32 mls, in ZSTD_BtGetAllMatches_extDict() argument
385 ZSTD_updateTree_extDict(zc, ip, iLimit, maxNbAttempts, mls); in ZSTD_BtGetAllMatches_extDict()
[all …]
|
| D | compress.c | 1735 …YTE *const ip, const BYTE *const iLimit, size_t *offsetPtr, const U32 maxNbAttempts, const U32 mls) in ZSTD_BtFindBestMatch() argument
1739 ZSTD_updateTree(zc, ip, iLimit, maxNbAttempts, mls); in ZSTD_BtFindBestMatch()
1740 return ZSTD_insertBtAndFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, mls, 0); in ZSTD_BtFindBestMatch()
1744 …const BYTE *ip, const BYTE *const iLimit, size_t *offsetPtr, const U32 maxNbAttempts, const U32 ma… in ZSTD_BtFindBestMatch_selectMLS() argument
1748 case 4: return ZSTD_BtFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, 4); in ZSTD_BtFindBestMatch_selectMLS()
1749 case 5: return ZSTD_BtFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, 5); in ZSTD_BtFindBestMatch_selectMLS()
1751 case 6: return ZSTD_BtFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, 6); in ZSTD_BtFindBestMatch_selectMLS()
1766 …tx *zc, const BYTE *const ip, const BYTE *const iLimit, size_t *offsetPtr, const U32 maxNbAttempts, in ZSTD_BtFindBestMatch_extDict() argument
1771 ZSTD_updateTree_extDict(zc, ip, iLimit, maxNbAttempts, mls); in ZSTD_BtFindBestMatch_extDict()
1772 return ZSTD_insertBtAndFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, mls, 1); in ZSTD_BtFindBestMatch_extDict()
[all …]
|
