24 1.0 / fuzzed_data_provider.
ConsumeIntegralInRange<
unsigned int>(1, std::numeric_limits<unsigned int>::max()),
32 (void)bloom_filter.contains(b);
33 bloom_filter.insert(b);
34 const bool present = bloom_filter.contains(b);
38 const std::optional<COutPoint> out_point = ConsumeDeserializable<COutPoint>(fuzzed_data_provider);
42 (void)bloom_filter.contains(*out_point);
43 bloom_filter.insert(*out_point);
44 const bool present = bloom_filter.contains(*out_point);
48 const std::optional<uint256> u256 = ConsumeDeserializable<uint256>(fuzzed_data_provider);
52 (void)bloom_filter.contains(*u256);
53 bloom_filter.insert(*u256);
54 const bool present = bloom_filter.contains(*u256);
58 const std::optional<CMutableTransaction> mut_tx = ConsumeDeserializable<CMutableTransaction>(fuzzed_data_provider);
63 (void)bloom_filter.IsRelevantAndUpdate(tx);
65 (void)bloom_filter.IsWithinSizeConstraints();
@ BLOOM_UPDATE_P2PUBKEY_ONLY
FUZZ_TARGET(bloom_filter)
BloomFilter is a probabilistic filter which SPV clients provide so that we can filter the transaction...
The basic transaction that is broadcasted on the network and contained in blocks.
T ConsumeIntegralInRange(T min, T max)
T PickValueInArray(const T(&array)[size])
#define LIMITED_WHILE(condition, limit)
Can be used to limit a theoretically unbounded loop.
std::vector< uint8_t > ConsumeRandomLengthByteVector(FuzzedDataProvider &fuzzed_data_provider, const std::optional< size_t > &max_length=std::nullopt) noexcept
size_t CallOneOf(FuzzedDataProvider &fuzzed_data_provider, Callables... callables)