mirror of
https://github.com/bitcoin/bitcoin.git
synced 2025-04-29 14:59:39 -04:00
fuzz: move AddrManDeterministic
to util
This commit is contained in:
parent
33adc7521c
commit
0a12cff2a8
2 changed files with 108 additions and 106 deletions
|
@ -118,121 +118,19 @@ void FillAddrman(AddrMan& addrman, FuzzedDataProvider& fuzzed_data_provider)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
class AddrManDeterministic : public AddrMan
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
explicit AddrManDeterministic(const NetGroupManager& netgroupman, FuzzedDataProvider& fuzzed_data_provider)
|
|
||||||
: AddrMan(netgroupman, /*deterministic=*/true, GetCheckRatio())
|
|
||||||
{
|
|
||||||
WITH_LOCK(m_impl->cs, m_impl->insecure_rand.Reseed(ConsumeUInt256(fuzzed_data_provider)));
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Compare with another AddrMan.
|
|
||||||
* This compares:
|
|
||||||
* - the values in `mapInfo` (the keys aka ids are ignored)
|
|
||||||
* - vvNew entries refer to the same addresses
|
|
||||||
* - vvTried entries refer to the same addresses
|
|
||||||
*/
|
|
||||||
bool operator==(const AddrManDeterministic& other) const
|
|
||||||
{
|
|
||||||
LOCK2(m_impl->cs, other.m_impl->cs);
|
|
||||||
|
|
||||||
if (m_impl->mapInfo.size() != other.m_impl->mapInfo.size() || m_impl->nNew != other.m_impl->nNew ||
|
|
||||||
m_impl->nTried != other.m_impl->nTried) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Check that all values in `mapInfo` are equal to all values in `other.mapInfo`.
|
|
||||||
// Keys may be different.
|
|
||||||
|
|
||||||
auto addrinfo_hasher = [](const AddrInfo& a) {
|
|
||||||
CSipHasher hasher(0, 0);
|
|
||||||
auto addr_key = a.GetKey();
|
|
||||||
auto source_key = a.source.GetAddrBytes();
|
|
||||||
hasher.Write(TicksSinceEpoch<std::chrono::seconds>(a.m_last_success));
|
|
||||||
hasher.Write(a.nAttempts);
|
|
||||||
hasher.Write(a.nRefCount);
|
|
||||||
hasher.Write(a.fInTried);
|
|
||||||
hasher.Write(a.GetNetwork());
|
|
||||||
hasher.Write(a.source.GetNetwork());
|
|
||||||
hasher.Write(addr_key.size());
|
|
||||||
hasher.Write(source_key.size());
|
|
||||||
hasher.Write(addr_key);
|
|
||||||
hasher.Write(source_key);
|
|
||||||
return (size_t)hasher.Finalize();
|
|
||||||
};
|
|
||||||
|
|
||||||
auto addrinfo_eq = [](const AddrInfo& lhs, const AddrInfo& rhs) {
|
|
||||||
return std::tie(static_cast<const CService&>(lhs), lhs.source, lhs.m_last_success, lhs.nAttempts, lhs.nRefCount, lhs.fInTried) ==
|
|
||||||
std::tie(static_cast<const CService&>(rhs), rhs.source, rhs.m_last_success, rhs.nAttempts, rhs.nRefCount, rhs.fInTried);
|
|
||||||
};
|
|
||||||
|
|
||||||
using Addresses = std::unordered_set<AddrInfo, decltype(addrinfo_hasher), decltype(addrinfo_eq)>;
|
|
||||||
|
|
||||||
const size_t num_addresses{m_impl->mapInfo.size()};
|
|
||||||
|
|
||||||
Addresses addresses{num_addresses, addrinfo_hasher, addrinfo_eq};
|
|
||||||
for (const auto& [id, addr] : m_impl->mapInfo) {
|
|
||||||
addresses.insert(addr);
|
|
||||||
}
|
|
||||||
|
|
||||||
Addresses other_addresses{num_addresses, addrinfo_hasher, addrinfo_eq};
|
|
||||||
for (const auto& [id, addr] : other.m_impl->mapInfo) {
|
|
||||||
other_addresses.insert(addr);
|
|
||||||
}
|
|
||||||
|
|
||||||
if (addresses != other_addresses) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
auto IdsReferToSameAddress = [&](nid_type id, nid_type other_id) EXCLUSIVE_LOCKS_REQUIRED(m_impl->cs, other.m_impl->cs) {
|
|
||||||
if (id == -1 && other_id == -1) {
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
if ((id == -1 && other_id != -1) || (id != -1 && other_id == -1)) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
return m_impl->mapInfo.at(id) == other.m_impl->mapInfo.at(other_id);
|
|
||||||
};
|
|
||||||
|
|
||||||
// Check that `vvNew` contains the same addresses as `other.vvNew`. Notice - `vvNew[i][j]`
|
|
||||||
// contains just an id and the address is to be found in `mapInfo.at(id)`. The ids
|
|
||||||
// themselves may differ between `vvNew` and `other.vvNew`.
|
|
||||||
for (size_t i = 0; i < ADDRMAN_NEW_BUCKET_COUNT; ++i) {
|
|
||||||
for (size_t j = 0; j < ADDRMAN_BUCKET_SIZE; ++j) {
|
|
||||||
if (!IdsReferToSameAddress(m_impl->vvNew[i][j], other.m_impl->vvNew[i][j])) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Same for `vvTried`.
|
|
||||||
for (size_t i = 0; i < ADDRMAN_TRIED_BUCKET_COUNT; ++i) {
|
|
||||||
for (size_t j = 0; j < ADDRMAN_BUCKET_SIZE; ++j) {
|
|
||||||
if (!IdsReferToSameAddress(m_impl->vvTried[i][j], other.m_impl->vvTried[i][j])) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
FUZZ_TARGET(addrman, .init = initialize_addrman)
|
FUZZ_TARGET(addrman, .init = initialize_addrman)
|
||||||
{
|
{
|
||||||
FuzzedDataProvider fuzzed_data_provider(buffer.data(), buffer.size());
|
FuzzedDataProvider fuzzed_data_provider(buffer.data(), buffer.size());
|
||||||
SetMockTime(ConsumeTime(fuzzed_data_provider));
|
SetMockTime(ConsumeTime(fuzzed_data_provider));
|
||||||
NetGroupManager netgroupman{ConsumeNetGroupManager(fuzzed_data_provider)};
|
NetGroupManager netgroupman{ConsumeNetGroupManager(fuzzed_data_provider)};
|
||||||
auto addr_man_ptr = std::make_unique<AddrManDeterministic>(netgroupman, fuzzed_data_provider);
|
auto addr_man_ptr = std::make_unique<AddrManDeterministic>(netgroupman, fuzzed_data_provider, GetCheckRatio());
|
||||||
if (fuzzed_data_provider.ConsumeBool()) {
|
if (fuzzed_data_provider.ConsumeBool()) {
|
||||||
const std::vector<uint8_t> serialized_data{ConsumeRandomLengthByteVector(fuzzed_data_provider)};
|
const std::vector<uint8_t> serialized_data{ConsumeRandomLengthByteVector(fuzzed_data_provider)};
|
||||||
DataStream ds{serialized_data};
|
DataStream ds{serialized_data};
|
||||||
try {
|
try {
|
||||||
ds >> *addr_man_ptr;
|
ds >> *addr_man_ptr;
|
||||||
} catch (const std::ios_base::failure&) {
|
} catch (const std::ios_base::failure&) {
|
||||||
addr_man_ptr = std::make_unique<AddrManDeterministic>(netgroupman, fuzzed_data_provider);
|
addr_man_ptr = std::make_unique<AddrManDeterministic>(netgroupman, fuzzed_data_provider, GetCheckRatio());
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
AddrManDeterministic& addr_man = *addr_man_ptr;
|
AddrManDeterministic& addr_man = *addr_man_ptr;
|
||||||
|
@ -310,8 +208,8 @@ FUZZ_TARGET(addrman_serdeser, .init = initialize_addrman)
|
||||||
SetMockTime(ConsumeTime(fuzzed_data_provider));
|
SetMockTime(ConsumeTime(fuzzed_data_provider));
|
||||||
|
|
||||||
NetGroupManager netgroupman{ConsumeNetGroupManager(fuzzed_data_provider)};
|
NetGroupManager netgroupman{ConsumeNetGroupManager(fuzzed_data_provider)};
|
||||||
AddrManDeterministic addr_man1{netgroupman, fuzzed_data_provider};
|
AddrManDeterministic addr_man1{netgroupman, fuzzed_data_provider, GetCheckRatio()};
|
||||||
AddrManDeterministic addr_man2{netgroupman, fuzzed_data_provider};
|
AddrManDeterministic addr_man2{netgroupman, fuzzed_data_provider, GetCheckRatio()};
|
||||||
|
|
||||||
DataStream data_stream{};
|
DataStream data_stream{};
|
||||||
|
|
||||||
|
|
|
@ -5,6 +5,8 @@
|
||||||
#ifndef BITCOIN_TEST_FUZZ_UTIL_NET_H
|
#ifndef BITCOIN_TEST_FUZZ_UTIL_NET_H
|
||||||
#define BITCOIN_TEST_FUZZ_UTIL_NET_H
|
#define BITCOIN_TEST_FUZZ_UTIL_NET_H
|
||||||
|
|
||||||
|
#include <addrman.h>
|
||||||
|
#include <addrman_impl.h>
|
||||||
#include <net.h>
|
#include <net.h>
|
||||||
#include <net_permissions.h>
|
#include <net_permissions.h>
|
||||||
#include <netaddress.h>
|
#include <netaddress.h>
|
||||||
|
@ -34,6 +36,108 @@
|
||||||
*/
|
*/
|
||||||
CNetAddr ConsumeNetAddr(FuzzedDataProvider& fuzzed_data_provider, FastRandomContext* rand = nullptr) noexcept;
|
CNetAddr ConsumeNetAddr(FuzzedDataProvider& fuzzed_data_provider, FastRandomContext* rand = nullptr) noexcept;
|
||||||
|
|
||||||
|
class AddrManDeterministic : public AddrMan
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
explicit AddrManDeterministic(const NetGroupManager& netgroupman, FuzzedDataProvider& fuzzed_data_provider, int32_t check_ratio)
|
||||||
|
: AddrMan(netgroupman, /*deterministic=*/true, check_ratio)
|
||||||
|
{
|
||||||
|
WITH_LOCK(m_impl->cs, m_impl->insecure_rand.Reseed(ConsumeUInt256(fuzzed_data_provider)));
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Compare with another AddrMan.
|
||||||
|
* This compares:
|
||||||
|
* - the values in `mapInfo` (the keys aka ids are ignored)
|
||||||
|
* - vvNew entries refer to the same addresses
|
||||||
|
* - vvTried entries refer to the same addresses
|
||||||
|
*/
|
||||||
|
bool operator==(const AddrManDeterministic& other) const
|
||||||
|
{
|
||||||
|
LOCK2(m_impl->cs, other.m_impl->cs);
|
||||||
|
|
||||||
|
if (m_impl->mapInfo.size() != other.m_impl->mapInfo.size() || m_impl->nNew != other.m_impl->nNew ||
|
||||||
|
m_impl->nTried != other.m_impl->nTried) {
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
|
||||||
|
// Check that all values in `mapInfo` are equal to all values in `other.mapInfo`.
|
||||||
|
// Keys may be different.
|
||||||
|
|
||||||
|
auto addrinfo_hasher = [](const AddrInfo& a) {
|
||||||
|
CSipHasher hasher(0, 0);
|
||||||
|
auto addr_key = a.GetKey();
|
||||||
|
auto source_key = a.source.GetAddrBytes();
|
||||||
|
hasher.Write(TicksSinceEpoch<std::chrono::seconds>(a.m_last_success));
|
||||||
|
hasher.Write(a.nAttempts);
|
||||||
|
hasher.Write(a.nRefCount);
|
||||||
|
hasher.Write(a.fInTried);
|
||||||
|
hasher.Write(a.GetNetwork());
|
||||||
|
hasher.Write(a.source.GetNetwork());
|
||||||
|
hasher.Write(addr_key.size());
|
||||||
|
hasher.Write(source_key.size());
|
||||||
|
hasher.Write(addr_key);
|
||||||
|
hasher.Write(source_key);
|
||||||
|
return (size_t)hasher.Finalize();
|
||||||
|
};
|
||||||
|
|
||||||
|
auto addrinfo_eq = [](const AddrInfo& lhs, const AddrInfo& rhs) {
|
||||||
|
return std::tie(static_cast<const CService&>(lhs), lhs.source, lhs.m_last_success, lhs.nAttempts, lhs.nRefCount, lhs.fInTried) ==
|
||||||
|
std::tie(static_cast<const CService&>(rhs), rhs.source, rhs.m_last_success, rhs.nAttempts, rhs.nRefCount, rhs.fInTried);
|
||||||
|
};
|
||||||
|
|
||||||
|
using Addresses = std::unordered_set<AddrInfo, decltype(addrinfo_hasher), decltype(addrinfo_eq)>;
|
||||||
|
|
||||||
|
const size_t num_addresses{m_impl->mapInfo.size()};
|
||||||
|
|
||||||
|
Addresses addresses{num_addresses, addrinfo_hasher, addrinfo_eq};
|
||||||
|
for (const auto& [id, addr] : m_impl->mapInfo) {
|
||||||
|
addresses.insert(addr);
|
||||||
|
}
|
||||||
|
|
||||||
|
Addresses other_addresses{num_addresses, addrinfo_hasher, addrinfo_eq};
|
||||||
|
for (const auto& [id, addr] : other.m_impl->mapInfo) {
|
||||||
|
other_addresses.insert(addr);
|
||||||
|
}
|
||||||
|
|
||||||
|
if (addresses != other_addresses) {
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
|
||||||
|
auto IdsReferToSameAddress = [&](nid_type id, nid_type other_id) EXCLUSIVE_LOCKS_REQUIRED(m_impl->cs, other.m_impl->cs) {
|
||||||
|
if (id == -1 && other_id == -1) {
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
if ((id == -1 && other_id != -1) || (id != -1 && other_id == -1)) {
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
return m_impl->mapInfo.at(id) == other.m_impl->mapInfo.at(other_id);
|
||||||
|
};
|
||||||
|
|
||||||
|
// Check that `vvNew` contains the same addresses as `other.vvNew`. Notice - `vvNew[i][j]`
|
||||||
|
// contains just an id and the address is to be found in `mapInfo.at(id)`. The ids
|
||||||
|
// themselves may differ between `vvNew` and `other.vvNew`.
|
||||||
|
for (size_t i = 0; i < ADDRMAN_NEW_BUCKET_COUNT; ++i) {
|
||||||
|
for (size_t j = 0; j < ADDRMAN_BUCKET_SIZE; ++j) {
|
||||||
|
if (!IdsReferToSameAddress(m_impl->vvNew[i][j], other.m_impl->vvNew[i][j])) {
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// Same for `vvTried`.
|
||||||
|
for (size_t i = 0; i < ADDRMAN_TRIED_BUCKET_COUNT; ++i) {
|
||||||
|
for (size_t j = 0; j < ADDRMAN_BUCKET_SIZE; ++j) {
|
||||||
|
if (!IdsReferToSameAddress(m_impl->vvTried[i][j], other.m_impl->vvTried[i][j])) {
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
class FuzzedSock : public Sock
|
class FuzzedSock : public Sock
|
||||||
{
|
{
|
||||||
FuzzedDataProvider& m_fuzzed_data_provider;
|
FuzzedDataProvider& m_fuzzed_data_provider;
|
||||||
|
|
Loading…
Add table
Reference in a new issue