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

btlazy2 : optimization for dictionary compression

Browse Source 
we want the dictionary table to be fully sorted,
not just lazily filled.
Dictionary loading is a bit more intensive,
but it saves cpu cycles for match search during compression.
This commit is contained in:
Yann Collet committed 2017-12-29 19:14:18 +01:00
1 parent 02f64ef955
commit d228b6b0d0
2 files changed
+6 -5
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

lib/compress/zstd_compress.c
+1 -5
View File
@@ -1950,11 +1950,7 @@ static size_t ZSTD_loadDictionaryContent(ZSTD_CCtx* zc, const void* src, size_t
ZSTD_insertAndFindFirstIndex(zc, iend-HASH_READ_SIZE, zc->appliedParams.cParams.searchLength);
break;
case ZSTD_btlazy2:
if (srcSize >= HASH_READ_SIZE)
ZSTD_updateDUBT(zc, iend-HASH_READ_SIZE, iend, zc->appliedParams.cParams.searchLength);
break;
case ZSTD_btlazy2: /* we want the dictionary table fully sorted */
case ZSTD_btopt:
case ZSTD_btultra:
if (srcSize >= HASH_READ_SIZE)