File tree Expand file tree Collapse file tree 2 files changed +2
-3
lines changed
test/sanitizer_suppressions Expand file tree Collapse file tree 2 files changed +2
-3
lines changed Original file line number Diff line number Diff line change @@ -218,7 +218,7 @@ void CRollingBloomFilter::insert(Span<const unsigned char> vKey)
218
218
/* FastMod works with the upper bits of h, so it is safe to ignore that the lower bits of h are already used for bit. */
219
219
uint32_t pos = FastRange32 (h, data.size ());
220
220
/* The lowest bit of pos is ignored, and set to zero for the first bit, and to one for the second. */
221
- data[pos & ~1 ] = (data[pos & ~1 ] & ~(((uint64_t )1 ) << bit)) | ((uint64_t )(nGeneration & 1 )) << bit;
221
+ data[pos & ~1U ] = (data[pos & ~1U ] & ~(((uint64_t )1 ) << bit)) | ((uint64_t )(nGeneration & 1 )) << bit;
222
222
data[pos | 1 ] = (data[pos | 1 ] & ~(((uint64_t )1 ) << bit)) | ((uint64_t )(nGeneration >> 1 )) << bit;
223
223
}
224
224
}
@@ -230,7 +230,7 @@ bool CRollingBloomFilter::contains(Span<const unsigned char> vKey) const
230
230
int bit = h & 0x3F ;
231
231
uint32_t pos = FastRange32 (h, data.size ());
232
232
/* If the relevant bit is not set in either data[pos & ~1] or data[pos | 1], the filter does not contain vKey */
233
- if (!(((data[pos & ~1 ] | data[pos | 1 ]) >> bit) & 1 )) {
233
+ if (!(((data[pos & ~1U ] | data[pos | 1 ]) >> bit) & 1 )) {
234
234
return false ;
235
235
}
236
236
}
Original file line number Diff line number Diff line change @@ -60,7 +60,6 @@ unsigned-integer-overflow:util/strencodings.cpp
60
60
unsigned-integer-overflow:validation.cpp
61
61
implicit-integer-sign-change:addrman.h
62
62
implicit-integer-sign-change:bech32.cpp
63
- implicit-integer-sign-change:common/bloom.cpp
64
63
implicit-integer-sign-change:coins.h
65
64
implicit-integer-sign-change:compat/stdin.cpp
66
65
implicit-integer-sign-change:compressor.h
You can’t perform that action at this time.
0 commit comments