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

fix some compiler warnings

Browse Source
This commit is contained in:
Quentin Carbonneaux
2021-02-08 20:19:16 +01:00
parent 874a590e5c
commit e2ad174d73
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files
lib/compress/zstd_ldm.c
+4 -4
View File
@@ -264,7 +264,7 @@ void ZSTD_ldm_fillHashTable(
if (ip + splits[n] >= istart + minMatchLength) { if (ip + splits[n] >= istart + minMatchLength) {
BYTE const* const split = ip + splits[n] - minMatchLength; BYTE const* const split = ip + splits[n] - minMatchLength;
U64 const xxhash = XXH64(split, minMatchLength, 0); U64 const xxhash = XXH64(split, minMatchLength, 0);
U64 const hash = xxhash & (((U32)1 << hBits) - 1); U32 const hash = (U32)(xxhash & (((U32)1 << hBits) - 1));
ldmEntry_t entry; ldmEntry_t entry;
entry.offset = (U32)(split - base); entry.offset = (U32)(split - base);
@@ -355,7 +355,7 @@ static size_t ZSTD_ldm_generateSequences_internal(
for (n = 0; n < numSplits; n++) { for (n = 0; n < numSplits; n++) {
BYTE const* const split = ip + splits[n] - minMatchLength; BYTE const* const split = ip + splits[n] - minMatchLength;
U64 const xxhash = XXH64(split, minMatchLength, 0); U64 const xxhash = XXH64(split, minMatchLength, 0);
U64 const hash = xxhash & (((U32)1 << hBits) - 1); U32 const hash = (U32)(xxhash & (((U32)1 << hBits) - 1));
candidates[n].split = split; candidates[n].split = split;
candidates[n].hash = hash; candidates[n].hash = hash;
@@ -368,8 +368,8 @@ static size_t ZSTD_ldm_generateSequences_internal(
size_t forwardMatchLength = 0, backwardMatchLength = 0, size_t forwardMatchLength = 0, backwardMatchLength = 0,
bestMatchLength = 0, mLength; bestMatchLength = 0, mLength;
BYTE const* const split = candidates[n].split; BYTE const* const split = candidates[n].split;
U64 const checksum = candidates[n].checksum; U32 const checksum = candidates[n].checksum;
U64 const hash = candidates[n].hash; U32 const hash = candidates[n].hash;
ldmEntry_t* const bucket = candidates[n].bucket; ldmEntry_t* const bucket = candidates[n].bucket;
ldmEntry_t const* cur; ldmEntry_t const* cur;
ldmEntry_t const* bestEntry = NULL; ldmEntry_t const* bestEntry = NULL;