Home
last modified time | relevance | path

Searched refs:minMatch (Results 1 - 10 of 10) sorted by relevance

/kernel/linux/linux-5.10/lib/zstd/
H A Dzstd_opt.h260 const U32 minMatch = (mls == 3) ? 3 : 4; in ZSTD_insertBtAndGetAllMatches() local
263 if (minMatch == 3) { /* HC3 match finder */ in ZSTD_insertBtAndGetAllMatches()
421 const U32 minMatch = (ctx->params.cParams.searchLength == 3) ? 3 : 4; in ZSTD_compressBlock_opt_generic() local
452 (ZSTD_readMINMATCH(ip, minMatch) == ZSTD_readMINMATCH(ip - repCur, minMatch))) { in ZSTD_compressBlock_opt_generic()
453 mlen = (U32)ZSTD_count(ip + minMatch, ip + minMatch - repCur, iend) + minMatch; in ZSTD_compressBlock_opt_generic()
467 } while (mlen >= minMatch); in ZSTD_compressBlock_opt_generic()
472 match_num = ZSTD_BtGetAllMatches_selectMLS(ctx, ip, iend, maxSearches, mls, matches, minMatch); in ZSTD_compressBlock_opt_generic()
718 const U32 minMatch = (ctx->params.cParams.searchLength == 3) ? 3 : 4; ZSTD_compressBlock_opt_extDict_generic() local
[all...]
/kernel/linux/linux-6.6/lib/zstd/compress/
H A Dzstd_opt.c552 ZSTD_updateTree_internal(ms, ip, iend, ms->cParams.minMatch, ZSTD_noDict); in ZSTD_updateTree()
571 U32 const minMatch = (mls==3) ? 3 : 4; in ZSTD_insertBtAndGetAllMatches() local
622 if ((repIndex >= windowLow) & (ZSTD_readMINMATCH(ip, minMatch) == ZSTD_readMINMATCH(ip - repOffset, minMatch))) { in ZSTD_insertBtAndGetAllMatches()
623 repLen = (U32)ZSTD_count(ip+minMatch, ip+minMatch-repOffset, iLimit) + minMatch; in ZSTD_insertBtAndGetAllMatches()
633 && (ZSTD_readMINMATCH(ip, minMatch) == ZSTD_readMINMATCH(repMatch, minMatch)) ) { in ZSTD_insertBtAndGetAllMatches()
634 repLen = (U32)ZSTD_count_2segments(ip+minMatch, repMatc in ZSTD_insertBtAndGetAllMatches()
1057 U32 const minMatch = (cParams->minMatch == 3) ? 3 : 4; ZSTD_compressBlock_opt_generic() local
[all...]
H A Dzstd_ldm.c583 ZSTD_ldm_skipSequences(rawSeqStore_t* rawSeqStore, size_t srcSize, U32 const minMatch) in ZSTD_ldm_skipSequences() argument
597 if (seq->matchLength < minMatch) { in ZSTD_ldm_skipSequences()
620 U32 const remaining, U32 const minMatch) in maybeSplitSequence()
634 if (sequence.matchLength < minMatch) { in maybeSplitSequence()
639 ZSTD_ldm_skipSequences(rawSeqStore, remaining, minMatch); in maybeSplitSequence()
666 unsigned const minMatch = cParams->minMatch; in ZSTD_ldm_blockCompress() local
691 (U32)(iend - ip), minMatch); in ZSTD_ldm_blockCompress()
619 maybeSplitSequence(rawSeqStore_t* rawSeqStore, U32 const remaining, U32 const minMatch) maybeSplitSequence() argument
H A Dzstd_ldm.h73 * Avoids emitting matches less than `minMatch` bytes.
77 U32 const minMatch);
H A Dzstd_lazy.c431 U32 const h = (U32)ZSTD_hashPtr(base + idx, hashLog, ms->cParams.minMatch); in ZSTD_dedicatedDictSearch_lazy_loadDictionary()
500 U32 const h = (U32)ZSTD_hashPtr(base + idx, hashLog, ms->cParams.minMatch) in ZSTD_dedicatedDictSearch_lazy_loadDictionary()
643 return ZSTD_insertAndFindFirstIndex_internal(ms, cParams, ip, ms->cParams.minMatch); in ZSTD_insertAndFindFirstIndex()
971 const U32 mls = MIN(ms->cParams.minMatch, 6 /* mls caps out at 6 */); in ZSTD_row_update()
1332 assert(MAX(4, MIN(6, ms->cParams.minMatch)) == mls); \
1342 assert(MAX(4, MIN(6, ms->cParams.minMatch)) == mls); \
1352 assert(MAX(4, MIN(6, ms->cParams.minMatch)) == mls); \
1491 const U32 mls = BOUNDED(4, ms->cParams.minMatch, 6); in ZSTD_compressBlock_lazy_generic()
1527 MIN(ms->cParams.minMatch, 6 /* mls caps out at 6 */), in ZSTD_compressBlock_lazy_generic()
1882 const U32 mls = BOUNDED(4, ms->cParams.minMatch, in ZSTD_compressBlock_lazy_extDict_generic()
[all...]
H A Dzstd_fast.c22 U32 const mls = cParams->minMatch; in ZSTD_fillHashTable()
339 U32 const mls = ms->cParams.minMatch; in ZSTD_compressBlock_fast()
531 U32 const mls = ms->cParams.minMatch; in ZSTD_compressBlock_fast_dictMatchState()
662 U32 const mls = ms->cParams.minMatch; in ZSTD_compressBlock_fast_extDict()
H A Dzstd_double_fast.c21 U32 const mls = cParams->minMatch; in ZSTD_fillDoubleHashTable()
494 const U32 mls = ms->cParams.minMatch; in ZSTD_compressBlock_doubleFast()
514 const U32 mls = ms->cParams.minMatch; in ZSTD_compressBlock_doubleFast_dictMatchState()
683 U32 const mls = ms->cParams.minMatch; in ZSTD_compressBlock_doubleFast_extDict()
H A Dzstd_compress.c726 CCtxParams->cParams.minMatch = value; in ZSTD_CCtxParams_setParameter()
727 return CCtxParams->cParams.minMatch; in ZSTD_CCtxParams_setParameter()
902 *value = CCtxParams->cParams.minMatch; in ZSTD_CCtxParams_getParameter()
1169 BOUNDCHECK(ZSTD_c_minMatch, (int)cParams.minMatch); in ZSTD_checkCParams()
1191 CLAMP(ZSTD_c_minMatch, cParams.minMatch); in ZSTD_clampCParams()
1327 if (overrides->minMatch) cParams->minMatch = overrides->minMatch; in ZSTD_overrideCParams()
1358 U32 const hashLog3 = (forCCtx && cParams->minMatch==3) ? MIN(ZSTD_HASHLOG3_MAX, cParams->windowLog) : 0; in ZSTD_sizeof_matchState()
1400 U32 const divider = (cParams->minMatch in ZSTD_estimateCCtxSize_usingCCtxParams_internal()
[all...]
/kernel/linux/linux-6.6/lib/zstd/
H A Dzstd_compress_module.c43 cctx, ZSTD_c_minMatch, parameters->cParams.minMatch)); in zstd_cctx_init()
/kernel/linux/linux-6.6/include/linux/
H A Dzstd_lib.h458 * => compressionLevel, hashLog, chainLog, searchLog, minMatch, targetLength and strategy.
1201 unsigned minMatch; /*< match length searched : larger == faster decompression, sometimes less compression */ member

Completed in 23 milliseconds