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

Only Insert Positions Inside the Chain Window

Browse Source
This commit is contained in:
W. Felix Handte
2020-09-10 22:10:02 -04:00
parent 13c5ec3e41
commit 66509c7bf4
1 changed files with 6 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files
lib/compress/zstd_lazy.c
+5 -1
View File
@@ -480,8 +480,10 @@ void ZSTD_dedicatedDictSearch_lazy_loadDictionary(ZSTD_matchState_t* ms, const B
{ {
U32 const target = (U32)(ip - ms->window.base); U32 const target = (U32)(ip - ms->window.base);
U32* const chainTable = ms->chainTable; U32* const chainTable = ms->chainTable;
U32 const chainMask = (1 << ms->cParams.chainLog) - 1; U32 const chainSize = 1 << ms->cParams.chainLog;
U32 const chainMask = chainSize - 1;
U32 idx = ms->nextToUpdate; U32 idx = ms->nextToUpdate;
U32 const minChain = chainSize > target ? 0 : target - chainSize;
U32 bucketSize = 1 << ZSTD_LAZY_DDSS_BUCKET_LOG; U32 bucketSize = 1 << ZSTD_LAZY_DDSS_BUCKET_LOG;
for ( ; idx < target; idx++) { for ( ; idx < target; idx++) {
U32 i; U32 i;
@@ -493,7 +495,9 @@ void ZSTD_dedicatedDictSearch_lazy_loadDictionary(ZSTD_matchState_t* ms, const B
for (i = bucketSize - 1; i; i--) for (i = bucketSize - 1; i; i--)
ms->hashTable[h + i] = ms->hashTable[h + i - 1]; ms->hashTable[h + i] = ms->hashTable[h + i - 1];
/* Insert new position. */ /* Insert new position. */
if (idx >= minChain) {
chainTable[idx & chainMask] = ms->hashTable[h]; chainTable[idx & chainMask] = ms->hashTable[h];
}
ms->hashTable[h] = idx; ms->hashTable[h] = idx;
} }