Home
last modified time | relevance | path

Searched full:minmatch (Results 1 – 13 of 13) sorted by relevance

/linux/lib/zstd/compress/
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()
585 ZSTD_updateTree_internal(ms, ip, iend, ms->cParams.minMatch, ZSTD_noDict); in ZSTD_updateTree()
607 U32 const minMatch = (mls==3) ? 3 : 4; in ZSTD_insertBtAndGetAllMatches() local
658 …(repIndex >= windowLow) & (ZSTD_readMINMATCH(ip, minMatch) == ZSTD_readMINMATCH(ip - repOffset, mi… in ZSTD_insertBtAndGetAllMatches()
659 repLen = (U32)ZSTD_count(ip+minMatch, ip+minMatch-repOffset, iLimit) + minMatch; in ZSTD_insertBtAndGetAllMatches()
669 && (ZSTD_readMINMATCH(ip, minMatch) == ZSTD_readMINMATCH(repMatch, minMatch)) ) { in ZSTD_insertBtAndGetAllMatches()
670 …repLen = (U32)ZSTD_count_2segments(ip+minMatch, repMatch+minMatch, iLimit, dictEnd, prefixStart) +… in ZSTD_insertBtAndGetAllMatches()
675 && (ZSTD_readMINMATCH(ip, minMatch) == ZSTD_readMINMATCH(repMatch, minMatch)) ) { in ZSTD_insertBtAndGetAllMatches()
[all …]
H A Dzstd_ldm.c605 ZSTD_ldm_skipSequences(RawSeqStore_t* rawSeqStore, size_t srcSize, U32 const minMatch) in ZSTD_ldm_skipSequences() argument
619 if (seq->matchLength < minMatch) { in ZSTD_ldm_skipSequences()
642 U32 const remaining, U32 const minMatch) in maybeSplitSequence() argument
656 if (sequence.matchLength < minMatch) { in maybeSplitSequence()
661 ZSTD_ldm_skipSequences(rawSeqStore, remaining, minMatch); in maybeSplitSequence()
688 unsigned const minMatch = cParams->minMatch; in ZSTD_ldm_blockCompress() local
713 (U32)(iend - ip), minMatch); in ZSTD_ldm_blockCompress()
H A Dzstd_ldm.h73 * Avoids emitting matches less than `minMatch` bytes.
77 U32 const minMatch);
H A Dzstd_double_fast.c25 U32 const mls = cParams->minMatch; in ZSTD_fillDoubleHashTableForCDict()
63 U32 const mls = cParams->minMatch; in ZSTD_fillDoubleHashTableForCCtx()
285 * more predictable test. The minmatch even if we take a short match is in ZSTD_compressBlock_doubleFast_noDict_generic()
573 const U32 mls = ms->cParams.minMatch; in ZSTD_compressBlock_doubleFast()
593 const U32 mls = ms->cParams.minMatch; in ZSTD_compressBlock_doubleFast_dictMatchState()
764 U32 const mls = ms->cParams.minMatch; in ZSTD_compressBlock_doubleFast_extDict()
H A Dzstd_compress.c800 CCtxParams->cParams.minMatch = (U32)value; in ZSTD_CCtxParams_setParameter()
801 return CCtxParams->cParams.minMatch; in ZSTD_CCtxParams_setParameter()
1006 *value = (int)CCtxParams->cParams.minMatch; in ZSTD_CCtxParams_getParameter()
1138 FORWARD_IF_ERROR(ZSTD_CCtx_setParameter(cctx, ZSTD_c_minMatch, (int)cparams.minMatch), ""); in ZSTD_CCtx_setCParams()
1330 BOUNDCHECK(ZSTD_c_minMatch, (int)cParams.minMatch); in ZSTD_checkCParams()
1353 CLAMP(ZSTD_c_minMatch, cParams.minMatch); in ZSTD_clampCParams()
1568 if (overrides->minMatch) cParams->minMatch = overrides->minMatch; in ZSTD_overrideCParams()
1600 …U32 const hashLog3 = (forCCtx && cParams->minMatch==3) ? MIN(ZSTD_HASHLOG3_MAX, cParams->window… in ZSTD_sizeof_matchState()
1632 * Gives a tighter bound than ZSTD_sequenceBound() by taking minMatch into account. */
1633 static size_t ZSTD_maxNbSeq(size_t blockSize, unsigned minMatch, int useSequenceProducer) { in ZSTD_maxNbSeq() argument
[all …]
H A Dzstd_fast.c24 U32 const mls = cParams->minMatch; in ZSTD_fillHashTableForCDict()
61 U32 const mls = cParams->minMatch; in ZSTD_fillHashTableForCCtx()
446 U32 const mml = ms->cParams.minMatch; in ZSTD_compressBlock_fast()
689 U32 const mls = ms->cParams.minMatch; in ZSTD_compressBlock_fast_dictMatchState()
970 U32 const mls = ms->cParams.minMatch; in ZSTD_compressBlock_fast_extDict()
H A Dzstd_lazy.c232 if (bestLength >= MINMATCH) { in ZSTD_DUBT_findBetterDictMatch()
383 if (bestLength >= MINMATCH) { in ZSTD_DUBT_findBestMatch()
445 U32 const h = (U32)ZSTD_hashPtr(base + idx, hashLog, ms->cParams.minMatch); in ZSTD_dedicatedDictSearch_lazy_loadDictionary()
514 U32 const h = (U32)ZSTD_hashPtr(base + idx, hashLog, ms->cParams.minMatch) in ZSTD_dedicatedDictSearch_lazy_loadDictionary()
662 …return ZSTD_insertAndFindFirstIndex_internal(ms, cParams, ip, ms->cParams.minMatch, /* lazySkippin… in ZSTD_insertAndFindFirstIndex()
953 const U32 mls = MIN(ms->cParams.minMatch, 6 /* mls caps out at 6 */); in ZSTD_row_update()
1372 assert(MAX(4, MIN(6, ms->cParams.minMatch)) == mls); \
1382 assert(MAX(4, MIN(6, ms->cParams.minMatch)) == mls); \
1392 assert(MAX(4, MIN(6, ms->cParams.minMatch)) == mls); \
1532 const U32 mls = BOUNDED(4, ms->cParams.minMatch, 6); in ZSTD_compressBlock_lazy_generic()
[all …]
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_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_sequences.c343 (unsigned)sequences[n].mlBase + MINMATCH, in ZSTD_encodeSequences_body()
/linux/lib/zstd/
H A Dzstd_compress_module.c44 cctx, ZSTD_c_minMatch, parameters->cParams.minMatch)); in zstd_cctx_init()
/linux/lib/zstd/common/
H A Dzstd_internal.h92 #define MINMATCH 3 macro
/linux/include/linux/
H A Dzstd_lib.h545 …* => compressionLevel, hashLog, chainLog, searchLog, minMatch, targetLength and strat…
1324 …unsigned minMatch; /*< match length searched : larger == faster decompression, sometimes le… member