Home
last modified time | relevance | path

Searched refs:chainSize (Results 1 – 2 of 2) sorted by relevance

/linux-6.1.9/lib/zstd/compress/
Dzstd_lazy.c486 U32 const chainSize = 1 << ms->cParams.chainLog; in ZSTD_dedicatedDictSearch_lazy_loadDictionary() local
488 U32 const minChain = chainSize < target ? target - chainSize : idx; in ZSTD_dedicatedDictSearch_lazy_loadDictionary()
567 assert(chainPos <= chainSize); /* I believe this is guaranteed... */ in ZSTD_dedicatedDictSearch_lazy_loadDictionary()
606 const U32 chainSize = (1 << cParams->chainLog); in ZSTD_HcFindBestMatch_generic() local
607 const U32 chainMask = chainSize-1; in ZSTD_HcFindBestMatch_generic()
619 const U32 minChain = curr > chainSize ? curr - chainSize : 0; in ZSTD_HcFindBestMatch_generic()
Dzstd_compress.c1234 … size_t const chainSize = (cParams->strategy == ZSTD_fast) ? 0 : ((size_t)1 << cParams->chainLog); in ZSTD_sizeof_matchState() local
1240 size_t const tableSpace = chainSize * sizeof(U32) in ZSTD_sizeof_matchState()
1254 (U32)chainSize, (U32)hSize, (U32)h3Size); in ZSTD_sizeof_matchState()
1491 … size_t const chainSize = (cParams->strategy == ZSTD_fast) ? 0 : ((size_t)1 << cParams->chainLog); in ZSTD_reset_matchState() local
1513 ms->chainTable = (U32*)ZSTD_cwksp_reserve_table(ws, chainSize * sizeof(U32)); in ZSTD_reset_matchState()
1848 …{ size_t const chainSize = (cdict_cParams->strategy == ZSTD_fast) ? 0 : ((size_t)1 << cdict_cPar… in ZSTD_resetCCtx_byCopyingCDict() local
1856 chainSize * sizeof(U32)); in ZSTD_resetCCtx_byCopyingCDict()
1941 …{ size_t const chainSize = (srcCCtx->appliedParams.cParams.strategy == ZSTD_fast) ? 0 : ((size_t… in ZSTD_copyCCtx_internal() local
1951 chainSize * sizeof(U32)); in ZSTD_copyCCtx_internal()
2044 U32 const chainSize = (U32)1 << params->cParams.chainLog; in ZSTD_reduceIndex() local
[all …]