ddidderr/zstd-rs
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

only split full blocks

Browse Source 
short term simplification
This commit is contained in:
Yann Collet
2024-10-23 11:50:56 -07:00
parent dd38c677eb
commit 0d4b520657
1 changed files with 7 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files
lib/compress/zstd_compress.c
+7 -2
View File
@@ -4491,10 +4491,15 @@ static void ZSTD_overflowCorrectIfNeeded(ZSTD_matchState_t* ms,
static size_t ZSTD_optimalBlockSize(const void* src, size_t srcSize, size_t blockSizeMax, ZSTD_strategy strat, S64 savings) static size_t ZSTD_optimalBlockSize(const void* src, size_t srcSize, size_t blockSizeMax, ZSTD_strategy strat, S64 savings)
{ {
if (strat >= ZSTD_btlazy2) /* note: we currenly only split full blocks (128 KB)
return ZSTD_splitBlock_4k(src, srcSize, blockSizeMax); * and when there is more than 128 KB input remaining
*/
if (srcSize <= 128 KB || blockSizeMax < 128 KB) if (srcSize <= 128 KB || blockSizeMax < 128 KB)
return MIN(srcSize, blockSizeMax); return MIN(srcSize, blockSizeMax);
/* dynamic splitting has a cpu cost for analysis,
* due to that cost it's only used for btlazy2+ strategies */
if (strat >= ZSTD_btlazy2)
return ZSTD_splitBlock_4k(src, srcSize, blockSizeMax);
/* blind split strategy /* blind split strategy
* no cpu cost, but can over-split homegeneous data. * no cpu cost, but can over-split homegeneous data.
* heuristic, tested as being "generally better". * heuristic, tested as being "generally better".