forked from bitcoin/bitcoin
-
Notifications
You must be signed in to change notification settings - Fork 1
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
MarcoFalke
committed
Nov 16, 2021
1 parent
ad09c28
commit fa74d45
Showing
2 changed files
with
66 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,64 @@ | ||
// Copyright (c) 2021 The Bitcoin Core developers | ||
// Distributed under the MIT software license, see the accompanying | ||
// file COPYING or http://www.opensource.org/licenses/mit-license.php. | ||
|
||
#include <minisketch.h> | ||
#include <node/minisketchwrapper.h> | ||
#include <test/fuzz/FuzzedDataProvider.h> | ||
#include <test/fuzz/fuzz.h> | ||
#include <test/fuzz/util.h> | ||
#include <util/check.h> | ||
|
||
#include <map> | ||
#include <numeric> | ||
|
||
FUZZ_TARGET(minisketch) | ||
{ | ||
FuzzedDataProvider fuzzed_data_provider{buffer.data(), buffer.size()}; | ||
const auto capacity{fuzzed_data_provider.ConsumeIntegralInRange<size_t>(1, 200)}; | ||
Minisketch sketch_a{Assert(MakeMinisketch32(capacity))}; | ||
Minisketch sketch_b{Assert(MakeMinisketch32(capacity))}; | ||
|
||
// Fill two sets and keep the difference in a map | ||
std::map<uint32_t, bool> diff; | ||
LIMITED_WHILE(fuzzed_data_provider.ConsumeBool(), 10000) | ||
{ | ||
const auto entry{fuzzed_data_provider.ConsumeIntegralInRange<uint32_t>(1, std::numeric_limits<uint32_t>::max() - 1)}; | ||
const auto KeepDiff{[&] { | ||
bool& mut{diff[entry]}; | ||
mut = !mut; | ||
}}; | ||
CallOneOf( | ||
fuzzed_data_provider, | ||
[&] { | ||
sketch_a.Add(entry); | ||
KeepDiff(); | ||
}, | ||
[&] { | ||
sketch_b.Add(entry); | ||
KeepDiff(); | ||
}, | ||
[&] { | ||
sketch_a.Add(entry); | ||
sketch_b.Add(entry); | ||
}); | ||
} | ||
const auto num_diff{std::accumulate(diff.begin(), diff.end(), size_t{0}, [](auto n, const auto& e) { return n + e.second; })}; | ||
|
||
Minisketch sketch_ar{MakeMinisketch32(capacity)}; | ||
Minisketch sketch_br{MakeMinisketch32(capacity)}; | ||
sketch_ar.Deserialize(sketch_a.Serialize()); | ||
sketch_br.Deserialize(sketch_b.Serialize()); | ||
|
||
Minisketch sketch_diff{std::move(fuzzed_data_provider.ConsumeBool() ? sketch_a : sketch_ar)}; | ||
sketch_diff.Merge(fuzzed_data_provider.ConsumeBool() ? sketch_b : sketch_br); | ||
|
||
if (capacity >= num_diff) { | ||
const auto max_elements{fuzzed_data_provider.ConsumeIntegralInRange<size_t>(num_diff, capacity)}; | ||
const auto dec{*Assert(sketch_diff.Decode(max_elements))}; | ||
Assert(dec.size() == num_diff); | ||
for (auto d : dec) { | ||
Assert(diff.at(d)); | ||
} | ||
} | ||
} |