reduce splitBlock arguments
This commit is contained in:
@@ -4507,11 +4507,11 @@ static size_t ZSTD_optimalBlockSize(ZSTD_CCtx* cctx, const void* src, size_t src
|
|||||||
/* dynamic splitting has a cpu cost for analysis,
|
/* dynamic splitting has a cpu cost for analysis,
|
||||||
* due to that cost it's only used for higher levels */
|
* due to that cost it's only used for higher levels */
|
||||||
if (strat >= ZSTD_btopt)
|
if (strat >= ZSTD_btopt)
|
||||||
return ZSTD_splitBlock(src, srcSize, blockSizeMax, split_lvl3, cctx->tmpWorkspace, cctx->tmpWkspSize);
|
return ZSTD_splitBlock(src, blockSizeMax, split_lvl3, cctx->tmpWorkspace, cctx->tmpWkspSize);
|
||||||
if (strat >= ZSTD_lazy2)
|
if (strat >= ZSTD_lazy2)
|
||||||
return ZSTD_splitBlock(src, srcSize, blockSizeMax, split_lvl2, cctx->tmpWorkspace, cctx->tmpWkspSize);
|
return ZSTD_splitBlock(src, blockSizeMax, split_lvl2, cctx->tmpWorkspace, cctx->tmpWkspSize);
|
||||||
if (strat >= ZSTD_greedy)
|
if (strat >= ZSTD_greedy)
|
||||||
return ZSTD_splitBlock(src, srcSize, blockSizeMax, split_lvl1, cctx->tmpWorkspace, cctx->tmpWkspSize);
|
return ZSTD_splitBlock(src, blockSizeMax, split_lvl1, cctx->tmpWorkspace, cctx->tmpWkspSize);
|
||||||
/* blind split strategy
|
/* blind split strategy
|
||||||
* heuristic value, tested as being "generally better".
|
* heuristic value, tested as being "generally better".
|
||||||
* no cpu cost, but can over-split homegeneous data.
|
* no cpu cost, but can over-split homegeneous data.
|
||||||
|
|||||||
@@ -141,16 +141,15 @@ static void removeEvents(Fingerprint* acc, const Fingerprint* slice)
|
|||||||
|
|
||||||
#define CHUNKSIZE (8 << 10)
|
#define CHUNKSIZE (8 << 10)
|
||||||
/* Note: technically, we use CHUNKSIZE, so that's 8 KB */
|
/* Note: technically, we use CHUNKSIZE, so that's 8 KB */
|
||||||
static size_t ZSTD_splitBlock_byChunks(const void* src, size_t srcSize,
|
static size_t ZSTD_splitBlock_byChunks(const void* blockStart, size_t blockSize,
|
||||||
size_t blockSizeMax, RecordEvents_f record_f,
|
RecordEvents_f record_f,
|
||||||
void* workspace, size_t wkspSize)
|
void* workspace, size_t wkspSize)
|
||||||
{
|
{
|
||||||
FPStats* const fpstats = (FPStats*)workspace;
|
FPStats* const fpstats = (FPStats*)workspace;
|
||||||
const char* p = (const char*)src;
|
const char* p = (const char*)blockStart;
|
||||||
int penalty = THRESHOLD_PENALTY;
|
int penalty = THRESHOLD_PENALTY;
|
||||||
size_t pos = 0;
|
size_t pos = 0;
|
||||||
if (srcSize <= blockSizeMax) return srcSize;
|
assert(blockSize == (128 << 10));
|
||||||
assert(blockSizeMax == (128 << 10));
|
|
||||||
assert(workspace != NULL);
|
assert(workspace != NULL);
|
||||||
assert((size_t)workspace % ZSTD_ALIGNOF(FPStats) == 0);
|
assert((size_t)workspace % ZSTD_ALIGNOF(FPStats) == 0);
|
||||||
ZSTD_STATIC_ASSERT(ZSTD_SLIPBLOCK_WORKSPACESIZE >= sizeof(FPStats));
|
ZSTD_STATIC_ASSERT(ZSTD_SLIPBLOCK_WORKSPACESIZE >= sizeof(FPStats));
|
||||||
@@ -158,7 +157,7 @@ static size_t ZSTD_splitBlock_byChunks(const void* src, size_t srcSize,
|
|||||||
|
|
||||||
initStats(fpstats);
|
initStats(fpstats);
|
||||||
record_f(&fpstats->pastEvents, p, CHUNKSIZE);
|
record_f(&fpstats->pastEvents, p, CHUNKSIZE);
|
||||||
for (pos = CHUNKSIZE; pos <= blockSizeMax - CHUNKSIZE; pos += CHUNKSIZE) {
|
for (pos = CHUNKSIZE; pos <= blockSize - CHUNKSIZE; pos += CHUNKSIZE) {
|
||||||
record_f(&fpstats->newEvents, p + pos, CHUNKSIZE);
|
record_f(&fpstats->newEvents, p + pos, CHUNKSIZE);
|
||||||
if (compareFingerprints(&fpstats->pastEvents, &fpstats->newEvents, penalty)) {
|
if (compareFingerprints(&fpstats->pastEvents, &fpstats->newEvents, penalty)) {
|
||||||
return pos;
|
return pos;
|
||||||
@@ -167,21 +166,21 @@ static size_t ZSTD_splitBlock_byChunks(const void* src, size_t srcSize,
|
|||||||
if (penalty > 0) penalty--;
|
if (penalty > 0) penalty--;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
assert(pos == blockSizeMax);
|
assert(pos == blockSize);
|
||||||
return blockSizeMax;
|
return blockSize;
|
||||||
(void)flushEvents; (void)removeEvents;
|
(void)flushEvents; (void)removeEvents;
|
||||||
}
|
}
|
||||||
|
|
||||||
size_t ZSTD_splitBlock(const void* src, size_t srcSize,
|
size_t ZSTD_splitBlock(const void* blockStart, size_t blockSize,
|
||||||
size_t blockSizeMax, ZSTD_SplitBlock_strategy_e splitStrat,
|
ZSTD_SplitBlock_strategy_e splitStrat,
|
||||||
void* workspace, size_t wkspSize)
|
void* workspace, size_t wkspSize)
|
||||||
{
|
{
|
||||||
if (splitStrat == split_lvl3)
|
if (splitStrat == split_lvl3)
|
||||||
return ZSTD_splitBlock_byChunks(src, srcSize, blockSizeMax, FP_RECORD_RATE(1), workspace, wkspSize);
|
return ZSTD_splitBlock_byChunks(blockStart, blockSize, FP_RECORD_RATE(1), workspace, wkspSize);
|
||||||
|
|
||||||
if (splitStrat == split_lvl2)
|
if (splitStrat == split_lvl2)
|
||||||
return ZSTD_splitBlock_byChunks(src, srcSize, blockSizeMax, FP_RECORD_RATE(5), workspace, wkspSize);
|
return ZSTD_splitBlock_byChunks(blockStart, blockSize, FP_RECORD_RATE(5), workspace, wkspSize);
|
||||||
|
|
||||||
assert(splitStrat == split_lvl1);
|
assert(splitStrat == split_lvl1);
|
||||||
return ZSTD_splitBlock_byChunks(src, srcSize, blockSizeMax, FP_RECORD_RATE(11), workspace, wkspSize);
|
return ZSTD_splitBlock_byChunks(blockStart, blockSize, FP_RECORD_RATE(11), workspace, wkspSize);
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -29,8 +29,8 @@ typedef enum { split_lvl1, split_lvl2, split_lvl3 } ZSTD_SplitBlock_strategy_e;
|
|||||||
* therefore @blockSizeMax must be == 128 KB.
|
* therefore @blockSizeMax must be == 128 KB.
|
||||||
* This could be extended to smaller sizes in the future.
|
* This could be extended to smaller sizes in the future.
|
||||||
*/
|
*/
|
||||||
size_t ZSTD_splitBlock(const void* src, size_t srcSize,
|
size_t ZSTD_splitBlock(const void* blockStart, size_t blockSize,
|
||||||
size_t blockSizeMax, ZSTD_SplitBlock_strategy_e splitStrat,
|
ZSTD_SplitBlock_strategy_e splitStrat,
|
||||||
void* workspace, size_t wkspSize);
|
void* workspace, size_t wkspSize);
|
||||||
|
|
||||||
#if defined (__cplusplus)
|
#if defined (__cplusplus)
|
||||||
|
|||||||
Reference in New Issue
Block a user