Home
last modified time | relevance | path

Searched refs:MINMATCH (Results 1 – 10 of 10) sorted by relevance

/linux-6.12.1/lib/lz4/
Dlz4hc_compress.c47 #define OPTIMAL_ML (int)((ML_MASK - 1) + MINMATCH)
50 >> ((MINMATCH*8) - LZ4HC_HASH_LOG))
130 size_t const mlt = LZ4_count(ip + MINMATCH, in LZ4HC_InsertAndFindBestMatch()
131 match + MINMATCH, iLimit) + MINMATCH; in LZ4HC_InsertAndFindBestMatch()
148 mlt = LZ4_count(ip + MINMATCH, in LZ4HC_InsertAndFindBestMatch()
149 match + MINMATCH, vLimit) + MINMATCH; in LZ4HC_InsertAndFindBestMatch()
204 int mlt = MINMATCH + LZ4_count( in LZ4HC_InsertAndGetWiderMatch()
205 ip + MINMATCH, in LZ4HC_InsertAndGetWiderMatch()
206 matchPtr + MINMATCH, in LZ4HC_InsertAndGetWiderMatch()
235 mlt = LZ4_count(ip + MINMATCH, in LZ4HC_InsertAndGetWiderMatch()
[all …]
Dlz4_compress.c54 >> ((MINMATCH * 8) - (LZ4_HASHLOG + 1))); in LZ4_hash4()
57 >> ((MINMATCH * 8) - LZ4_HASHLOG)); in LZ4_hash4()
348 matchCode = LZ4_count(ip + MINMATCH, in LZ4_compress_generic()
349 match + MINMATCH, limit); in LZ4_compress_generic()
351 ip += MINMATCH + matchCode; in LZ4_compress_generic()
362 matchCode = LZ4_count(ip + MINMATCH, in LZ4_compress_generic()
363 match + MINMATCH, matchlimit); in LZ4_compress_generic()
364 ip += MINMATCH + matchCode; in LZ4_compress_generic()
641 size_t matchLength = LZ4_count(ip + MINMATCH, in LZ4_compress_destSize_generic()
642 match + MINMATCH, matchlimit); in LZ4_compress_destSize_generic()
[all …]
Dlz4defs.h75 #define MINMATCH 4 macro
79 #define MFLIMIT (WILDCOPYLENGTH + MINMATCH)
84 #define MATCH_SAFEGUARD_DISTANCE ((2 * WILDCOPYLENGTH) - MINMATCH)
Dlz4_decompress.c178 op += length + MINMATCH; in LZ4_decompress_generic()
334 length += MINMATCH; in LZ4_decompress_generic()
/linux-6.12.1/lib/zstd/common/
Dzstd_internal.h93 #define MINMATCH 3 macro
321 seqLen.matchLength = seq->mlBase + MINMATCH; in ZSTD_getSequenceLength()
/linux-6.12.1/lib/zstd/compress/
Dzstd_opt.c305 U32 const mlBase = matchLength - MINMATCH; in ZSTD_getMatchPrice()
306 assert(matchLength >= MINMATCH); in ZSTD_getMatchPrice()
355 { U32 const mlBase = matchLength - MINMATCH; in ZSTD_updateStats()
969 || candidateMatchLength < MINMATCH) { in ZSTD_optLdm_maybeAddMatch()
Dzstd_compress_internal.h634 assert(matchLength >= MINMATCH); in ZSTD_storeSeq()
635 { size_t const mlBase = matchLength - MINMATCH; in ZSTD_storeSeq()
Dzstd_compress_sequences.c342 (unsigned)sequences[n].mlBase + MINMATCH, in ZSTD_encodeSequences_body()
Dzstd_lazy.c220 if (bestLength >= MINMATCH) { in ZSTD_DUBT_findBetterDictMatch()
370 if (bestLength >= MINMATCH) { in ZSTD_DUBT_findBestMatch()
Dzstd_compress.c2824 outSeqs[i].matchLength = seqStoreSeqs[i].mlBase + MINMATCH; in ZSTD_copyBlockSequences()
3297 matchBytes += seq.mlBase + MINMATCH; in ZSTD_countSeqStoreMatchBytes()
5576 RETURN_ERROR_IF(matchLength < MINMATCH, corruption_detected, "Matchlength too small"); in ZSTD_validateSequence()