Line data    Source code

       1             : // Copyright (c) 2021 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             : #include <node/minisketchwrapper.h>
       7             : #include <test/fuzz/FuzzedDataProvider.h>
       8             : #include <test/fuzz/fuzz.h>
       9             : #include <test/fuzz/util.h>
      10             : #include <util/check.h>
      11             : 
      12             : #include <map>
      13             : #include <numeric>
      14             : 
      15             : using node::MakeMinisketch32;
      16             : 
      17           4 : FUZZ_TARGET(minisketch)
      18             : {
      19           0 :     FuzzedDataProvider fuzzed_data_provider{buffer.data(), buffer.size()};
      20           0 :     const auto capacity{fuzzed_data_provider.ConsumeIntegralInRange<size_t>(1, 200)};
      21           0 :     Minisketch sketch_a{Assert(MakeMinisketch32(capacity))};
      22           0 :     Minisketch sketch_b{Assert(MakeMinisketch32(capacity))};
      23             : 
      24             :     // Fill two sets and keep the difference in a map
      25           2 :     std::map<uint32_t, bool> diff;
      26           0 :     LIMITED_WHILE(fuzzed_data_provider.ConsumeBool(), 10000)
      27             :     {
      28           0 :         const auto entry{fuzzed_data_provider.ConsumeIntegralInRange<uint32_t>(1, std::numeric_limits<uint32_t>::max() - 1)};
      29           0 :         const auto KeepDiff{[&] {
      30           0 :             bool& mut{diff[entry]};
      31           0 :             mut = !mut;
      32           0 :         }};
      33           0 :         CallOneOf(
      34             :             fuzzed_data_provider,
      35           0 :             [&] {
      36           0 :                 sketch_a.Add(entry);
      37           0 :                 KeepDiff();
      38           0 :             },
      39           0 :             [&] {
      40           0 :                 sketch_b.Add(entry);
      41           0 :                 KeepDiff();
      42           0 :             },
      43           0 :             [&] {
      44           0 :                 sketch_a.Add(entry);
      45           0 :                 sketch_b.Add(entry);
      46           0 :             });
      47           0 :     }
      48           0 :     const auto num_diff{std::accumulate(diff.begin(), diff.end(), size_t{0}, [](auto n, const auto& e) { return n + e.second; })};
      49             : 
      50           0 :     Minisketch sketch_ar{MakeMinisketch32(capacity)};
      51           0 :     Minisketch sketch_br{MakeMinisketch32(capacity)};
      52           0 :     sketch_ar.Deserialize(sketch_a.Serialize());
      53           0 :     sketch_br.Deserialize(sketch_b.Serialize());
      54             : 
      55           0 :     Minisketch sketch_diff{std::move(fuzzed_data_provider.ConsumeBool() ? sketch_a : sketch_ar)};
      56           0 :     sketch_diff.Merge(fuzzed_data_provider.ConsumeBool() ? sketch_b : sketch_br);
      57             : 
      58           0 :     if (capacity >= num_diff) {
      59           0 :         const auto max_elements{fuzzed_data_provider.ConsumeIntegralInRange<size_t>(num_diff, capacity)};
      60           0 :         const auto dec{*Assert(sketch_diff.Decode(max_elements))};
      61           0 :         Assert(dec.size() == num_diff);
      62           0 :         for (auto d : dec) {
      63           0 :             Assert(diff.at(d));
      64             :         }
      65           0 :     }
      66           0 : }