Searched refs:searchLog (Results 1 - 5 of 5) sorted by relevance

/linux-master/lib/zstd/
H A Dzstd_compress_module.c41 cctx, ZSTD_c_searchLog, parameters->cParams.searchLog));
/linux-master/lib/zstd/compress/
H A Dzstd_lazy.c255 U32 nbCompares = 1U << cParams->searchLog;
409 U32 const chainAttempts = (1 << ms->cParams.searchLog) - cacheSize;
670 U32 nbAttempts = 1U << cParams->searchLog;
969 const U32 rowLog = BOUNDED(4, ms->cParams.searchLog, 6);
1145 const U32 cappedSearchLog = MIN(cParams->searchLog, rowLog); /* nb of searches is capped at nb entries per row */
1165 ddsExtraAttempts = cParams->searchLog > rowLog ? 1U << (cParams->searchLog - rowLog) : 0;
1353 assert(MAX(4, MIN(6, ms->cParams.searchLog)) == rowLog); \
1492 const U32 rowLog = BOUNDED(4, ms->cParams.searchLog, 6);
1883 const U32 rowLog = BOUNDED(4, ms->cParams.searchLog,
[all...]
H A Dzstd_compress.c720 CCtxParams->cParams.searchLog = (U32)value;
899 *value = CCtxParams->cParams.searchLog;
1168 BOUNDCHECK(ZSTD_c_searchLog, (int)cParams.searchLog);
1190 CLAMP(ZSTD_c_searchLog, cParams.searchLog);
1326 if (overrides->searchLog) cParams->searchLog = overrides->searchLog;
1582 assert(cParams1.searchLog == cParams2.searchLog);
1705 { /* Switch to 32-entry rows if searchLog i
[all...]
H A Dzstd_opt.c443 U32 nbCompares = 1U << cParams->searchLog;
591 U32 nbCompares = 1U << cParams->searchLog;
/linux-master/include/linux/
H A Dzstd_lib.h306 * Special: value 0 means "use default searchLog". */
458 * => compressionLevel, hashLog, chainLog, searchLog, minMatch, targetLength and strategy.
1200 unsigned searchLog; /*< nb of searches : larger == more compression, slower */ member in struct:__anon95

Completed in 158 milliseconds