Home
last modified time | relevance | path

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

/linux/lib/lz4/
H A Dlz4hc_compress.c46 #define OPTIMAL_ML (int)((ML_MASK - 1) + MINMATCH)
49 >> ((MINMATCH*8) - LZ4HC_HASH_LOG))
129 size_t const mlt = LZ4_count(ip + MINMATCH, in LZ4HC_InsertAndFindBestMatch()
130 match + MINMATCH, iLimit) + MINMATCH; in LZ4HC_InsertAndFindBestMatch()
147 mlt = LZ4_count(ip + MINMATCH, in LZ4HC_InsertAndFindBestMatch()
148 match + MINMATCH, vLimit) + MINMATCH; in LZ4HC_InsertAndFindBestMatch()
203 int mlt = MINMATCH + LZ4_count( in LZ4HC_InsertAndGetWiderMatch()
204 ip + MINMATCH, in LZ4HC_InsertAndGetWiderMatch()
[all...]
H A Dlz4_compress.c53 >> ((MINMATCH * 8) - (LZ4_HASHLOG + 1))); in LZ4_hash4()
56 >> ((MINMATCH * 8) - LZ4_HASHLOG)); in LZ4_hash4()
347 matchCode = LZ4_count(ip + MINMATCH, in LZ4_compress_generic()
348 match + MINMATCH, limit); in LZ4_compress_generic()
350 ip += MINMATCH + matchCode; in LZ4_compress_generic()
361 matchCode = LZ4_count(ip + MINMATCH, in LZ4_compress_generic()
362 match + MINMATCH, matchlimit); in LZ4_compress_generic()
363 ip += MINMATCH + matchCode; in LZ4_compress_generic()
540 - 8 /* because 8 + MINMATCH == MFLIMIT */ - 1 /* token */; in LZ4_compress_destSize_generic()
640 size_t matchLength = LZ4_count(ip + MINMATCH, in LZ4_compress_destSize_generic()
[all...]
H A Dlz4defs.h76 #define MINMATCH 4 macro
80 #define MFLIMIT (WILDCOPYLENGTH + MINMATCH)
85 #define MATCH_SAFEGUARD_DISTANCE ((2 * WILDCOPYLENGTH) - MINMATCH)
H A Dlz4_decompress.c177 op += length + MINMATCH; in LZ4_decompress_generic()
333 length += MINMATCH; in LZ4_decompress_generic()
/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.h86 U16 mlBase; /* mlBase == matchLength - MINMATCH */
122 * indicated by longLengthPos and longLengthType, and adds MINMATCH back to matchLength.
128 seqLen.matchLength = seq->mlBase + MINMATCH; in ZSTD_getSequenceLength()
591 * note : mlBase = matchLength - MINMATCH;
724 * @matchLength : must be >= MINMATCH
748 assert(matchLength >= MINMATCH); in ZSTD_storeSeqOnly()
749 { size_t const mlBase = matchLength - MINMATCH; in ZSTD_storeSeqOnly()
764 * @matchLength : must be >= MINMATCH
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()
1002 /* Note: ZSTD_match_t actually contains offBase and matchLength (before subtracting MINMATCH) */ in ZSTD_optLdm_maybeAddMatch()
H A Dzstd_compress.c3368 outSeqs[i].matchLength = inSeqs[i].mlBase + MINMATCH; in ZSTD_copyBlockSequences()
3372 * There can only be one because we add MINMATCH to every match length, in ZSTD_copyBlockSequences()
3905 matchBytes += seq.mlBase + MINMATCH; in ZSTD_countSeqStoreMatchBytes()
6530 * to avoid splitting a match, notably if it would produce a match smaller than MINMATCH.
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()
[all...]
H A Dzstd_lazy.c232 if (bestLength >= MINMATCH) { in ZSTD_DUBT_findBetterDictMatch()
383 if (bestLength >= MINMATCH) { in ZSTD_DUBT_findBestMatch()