Bitcoin Core 32.1.0
P2P Digital Currency
Loading...
Searching...
No Matches
bloom_filter.cpp
Go to the documentation of this file.
1// Copyright (c) 2020-present The Bitcoin Core developers
2// Distributed under the MIT software license, see the accompanying
3// file COPYING or http://www.opensource.org/licenses/mit-license.php.
4
5#include <common/bloom.h>
8#include <test/fuzz/fuzz.h>
9#include <test/fuzz/util.h>
10#include <uint256.h>
11
12#include <cassert>
13#include <limits>
14#include <optional>
15#include <vector>
16
17FUZZ_TARGET(bloom_filter)
18{
19 FuzzedDataProvider fuzzed_data_provider(buffer.data(), buffer.size());
20 bool good_data{true};
21
22 CBloomFilter bloom_filter{
23 fuzzed_data_provider.ConsumeIntegralInRange<unsigned int>(1, 10000000),
24 1.0 / fuzzed_data_provider.ConsumeIntegralInRange<unsigned int>(1, std::numeric_limits<unsigned int>::max()),
25 fuzzed_data_provider.ConsumeIntegral<unsigned int>(),
26 static_cast<unsigned char>(fuzzed_data_provider.PickValueInArray({BLOOM_UPDATE_NONE, BLOOM_UPDATE_ALL, BLOOM_UPDATE_P2PUBKEY_ONLY, BLOOM_UPDATE_MASK}))};
27 LIMITED_WHILE (good_data && fuzzed_data_provider.remaining_bytes() > 0, 10'000) {
29 fuzzed_data_provider,
30 [&] {
31 const std::vector<unsigned char> b = ConsumeRandomLengthByteVector(fuzzed_data_provider);
32 (void)bloom_filter.contains(b);
33 bloom_filter.insert(b);
34 const bool present = bloom_filter.contains(b);
35 assert(present);
36 },
37 [&] {
38 const std::optional<COutPoint> out_point = ConsumeDeserializable<COutPoint>(fuzzed_data_provider);
39 if (!out_point) {
40 good_data = false;
41 return;
42 }
43 (void)bloom_filter.contains(*out_point);
44 bloom_filter.insert(*out_point);
45 const bool present = bloom_filter.contains(*out_point);
46 assert(present);
47 },
48 [&] {
49 const std::optional<uint256> u256 = ConsumeDeserializable<uint256>(fuzzed_data_provider);
50 if (!u256) {
51 good_data = false;
52 return;
53 }
54 (void)bloom_filter.contains(*u256);
55 bloom_filter.insert(*u256);
56 const bool present = bloom_filter.contains(*u256);
57 assert(present);
58 },
59 [&] {
60 const std::optional<CMutableTransaction> mut_tx = ConsumeDeserializable<CMutableTransaction>(fuzzed_data_provider, TX_WITH_WITNESS);
61 if (!mut_tx) {
62 good_data = false;
63 return;
64 }
65 const CTransaction tx{*mut_tx};
66 (void)bloom_filter.IsRelevantAndUpdate(tx);
67 });
68 (void)bloom_filter.IsWithinSizeConstraints();
69 }
70}
BloomFilter is a probabilistic filter which SPV clients provide so that we can filter the transaction...
Definition bloom.h:46
bool IsWithinSizeConstraints() const
Definition bloom.cpp:89
void insert(std::span< const unsigned char > vKey)
Definition bloom.cpp:49
bool contains(std::span< const unsigned char > vKey) const
Definition bloom.cpp:68
bool IsRelevantAndUpdate(const CTransaction &tx)
Also adds any outputs which match the filter to the filter (to match their spending txes).
Definition bloom.cpp:94
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 FUZZ_TARGET(...)
Definition fuzz.h:35
#define LIMITED_WHILE(condition, limit)
Can be used to limit a theoretically unbounded loop.
Definition fuzz.h:22
constexpr TransactionSerParams TX_WITH_WITNESS
size_t CallOneOf(FuzzedDataProvider &fuzzed_data_provider, Callables... callables)
Definition util.h:37
std::vector< B > ConsumeRandomLengthByteVector(FuzzedDataProvider &fuzzed_data_provider, const std::optional< size_t > &max_length=std::nullopt) noexcept
Definition util.h:63
std::optional< T > ConsumeDeserializable(FuzzedDataProvider &fuzzed_data_provider, const P &params, const std::optional< size_t > &max_length=std::nullopt) noexcept
Definition util.h:106
assert(!tx.IsCoinBase())