Bitcoin Core 31.99.0
P2P Digital Currency
minisketch.cpp
Go to the documentation of this file.
1// Copyright (c) 2021-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 <minisketch.h>
6
8#include <test/fuzz/fuzz.h>
9#include <test/fuzz/util.h>
10#include <util/check.h>
11
12#include <limits>
13#include <map>
14#include <numeric>
15#include <utility>
16
17namespace {
18
19Minisketch MakeFuzzMinisketch32(size_t capacity, uint32_t impl)
20{
21 return Assert(Minisketch(32, impl, capacity));
22}
23
24} // namespace
25
27{
28 FuzzedDataProvider fuzzed_data_provider{buffer.data(), buffer.size()};
29
30 const auto capacity{fuzzed_data_provider.ConsumeIntegralInRange<size_t>(1, 200)};
31 const uint32_t impl{fuzzed_data_provider.ConsumeIntegralInRange<uint32_t>(0, Minisketch::MaxImplementation())};
32 if (!Minisketch::ImplementationSupported(32, impl)) return;
33
34 Minisketch sketch_a{MakeFuzzMinisketch32(capacity, impl)};
35 Minisketch sketch_b{MakeFuzzMinisketch32(capacity, impl)};
36 sketch_a.SetSeed(fuzzed_data_provider.ConsumeIntegral<uint64_t>());
37 sketch_b.SetSeed(fuzzed_data_provider.ConsumeIntegral<uint64_t>());
38
39 // Fill two sets and keep the difference in a map
40 std::map<uint32_t, bool> diff;
42 const auto entry{fuzzed_data_provider.ConsumeIntegralInRange<uint32_t>(1, std::numeric_limits<uint32_t>::max() - 1)};
43 const auto KeepDiff{[&] {
44 bool& mut{diff[entry]};
45 mut = !mut;
46 }};
49 [&] {
50 sketch_a.Add(entry);
51 KeepDiff();
52 },
53 [&] {
54 sketch_b.Add(entry);
55 KeepDiff();
56 },
57 [&] {
58 sketch_a.Add(entry);
59 sketch_b.Add(entry);
60 });
61 }
62 const auto num_diff{std::accumulate(diff.begin(), diff.end(), size_t{0}, [](auto n, const auto& e) { return n + e.second; })};
63
64 Minisketch sketch_ar{MakeFuzzMinisketch32(capacity, impl)};
65 Minisketch sketch_br{MakeFuzzMinisketch32(capacity, impl)};
66 sketch_ar.SetSeed(fuzzed_data_provider.ConsumeIntegral<uint64_t>());
67 sketch_br.SetSeed(fuzzed_data_provider.ConsumeIntegral<uint64_t>());
68
69 sketch_ar.Deserialize(sketch_a.Serialize());
70 sketch_br.Deserialize(sketch_b.Serialize());
71
72 Minisketch sketch_diff{std::move(fuzzed_data_provider.ConsumeBool() ? sketch_a : sketch_ar)};
73 sketch_diff.Merge(fuzzed_data_provider.ConsumeBool() ? sketch_b : sketch_br);
74
75 if (capacity >= num_diff) {
76 const auto max_elements{fuzzed_data_provider.ConsumeIntegralInRange<size_t>(num_diff, capacity)};
77 const auto dec{*Assert(sketch_diff.Decode(max_elements))};
78 Assert(dec.size() == num_diff);
79 for (auto d : dec) {
80 Assert(diff.at(d));
81 }
82 }
83}
#define Assert(val)
Identity function.
Definition: check.h:116
T ConsumeIntegralInRange(T min, T max)
LIMITED_WHILE(provider.remaining_bytes(), 10000)
struct minisketch minisketch
Opaque type for decoded sketches.
Definition: minisketch.h:41
FUZZ_TARGET(minisketch)
Definition: minisketch.cpp:26
size_t CallOneOf(FuzzedDataProvider &fuzzed_data_provider, Callables... callables)
Definition: util.h:37
FuzzedDataProvider & fuzzed_data_provider
Definition: fees.cpp:45