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

Prefetch Chain Table Matches

Browse Source
This commit is contained in:
W. Felix Handte
2020-09-10 22:10:02 -04:00
parent 9b9feb84f2
commit 20a020edbc
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
+6 -2
View File
@@ -653,9 +653,13 @@ size_t ZSTD_HcFindBestMatch_generic (
U32 const chainLength = chainPackedPointer & 0xFF; U32 const chainLength = chainPackedPointer & 0xFF;
U32 const chainAttempts = nbAttempts - ddsAttempt; U32 const chainAttempts = nbAttempts - ddsAttempt;
U32 const chainLimit = chainAttempts > chainLength ? chainLength : chainAttempts; U32 const chainLimit = chainAttempts > chainLength ? chainLength : chainAttempts;
U32 chainAttempt = 0; U32 chainAttempt;
for ( ; chainAttempt < chainLimit; chainAttempt++, chainIndex++) { for (chainAttempt = 0 ; chainAttempt < chainLimit; chainAttempt++) {
PREFETCH_L1(ddsBase + dms->chainTable[chainIndex + chainAttempt]);
}
for (chainAttempt = 0 ; chainAttempt < chainLimit; chainAttempt++, chainIndex++) {
size_t currentMl=0; size_t currentMl=0;
const BYTE* match; const BYTE* match;
matchIndex = dms->chainTable[chainIndex]; matchIndex = dms->chainTable[chainIndex];