Home
last modified time | relevance | path

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

/linux/lib/zstd/common/
H A Dzstd_internal.h92 #define MINMATCH 3 macro
/linux/lib/zstd/compress/
H A Dzstd_compress_superblock.c456 inSize = sp[0].litLength + (sp[0].mlBase+MINMATCH); in sizeBlockSequences()
462 inSize += sp[n].litLength + (sp[n].mlBase+MINMATCH); in sizeBlockSequences()
H A Dzstd_compress_internal.h128 seqLen.matchLength = seq->mlBase + MINMATCH; in ZSTD_getSequenceLength()
748 assert(matchLength >= MINMATCH); in ZSTD_storeSeqOnly()
749 { size_t const mlBase = matchLength - MINMATCH; in ZSTD_storeSeqOnly()
H A Dzstd_compress_sequences.c343 (unsigned)sequences[n].mlBase + MINMATCH, in ZSTD_encodeSequences_body()
H A Dzstd_opt.c332 U32 const mlBase = matchLength - MINMATCH; in ZSTD_getMatchPrice()
333 assert(matchLength >= MINMATCH); in ZSTD_getMatchPrice()
383 { U32 const mlBase = matchLength - MINMATCH; in ZSTD_updateStats()
H A Dzstd_compress.c3368 outSeqs[i].matchLength = inSeqs[i].mlBase + MINMATCH; in ZSTD_copyBlockSequences()
3905 matchBytes += seq.mlBase + MINMATCH; in ZSTD_countSeqStoreMatchBytes()
6934 ZSTD_REP_NUM, 0, -MINMATCH, 0, /* for sequence i */ in convertSequences_noRepcodes()
6935 ZSTD_REP_NUM, 0, -MINMATCH, 0 /* for sequence i+1 */ in convertSequences_noRepcodes()
7030 if (inSeqs[i].matchLength > 65535+MINMATCH) { in convertSequences_noRepcodes()
7038 if (inSeqs[i+1].matchLength > 65535+MINMATCH) { in convertSequences_noRepcodes()
7055 dstSeqs[i].mlBase = (U16)(inSeqs[i].matchLength - MINMATCH); in convertSequences_noRepcodes()
7057 if (UNLIKELY(inSeqs[i].matchLength > 65535+MINMATCH)) { in convertSequences_noRepcodes()
7086 dstSeqs[n].mlBase = (U16)(inSeqs[n].matchLength - MINMATCH); in convertSequences_noRepcodes()
7088 if (UNLIKELY(inSeqs[n].matchLength > 65535+MINMATCH)) { in convertSequences_noRepcodes()
H A Dzstd_lazy.c232 if (bestLength >= MINMATCH) { in ZSTD_DUBT_findBetterDictMatch()
383 if (bestLength >= MINMATCH) { in ZSTD_DUBT_findBestMatch()