Bitcoin Core 31.99.0
P2P Digital Currency
process_messages.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 <addrman.h>
6#include <banman.h>
8#include <net.h>
9#include <net_processing.h>
10#include <primitives/block.h>
12#include <protocol.h>
13#include <sync.h>
15#include <test/fuzz/fuzz.h>
16#include <test/fuzz/util.h>
17#include <test/fuzz/util/net.h>
18#include <test/util/net.h>
19#include <test/util/random.h>
21#include <test/util/time.h>
23#include <uint256.h>
24#include <util/check.h>
25#include <util/time.h>
26#include <validation.h>
27#include <validationinterface.h>
28
29#include <functional>
30#include <ios>
31#include <memory>
32#include <optional>
33#include <string>
34#include <utility>
35#include <vector>
36
37namespace {
39
40} // namespace
41
42extern void MakeRandDeterministicDANGEROUS(const uint256& seed) noexcept;
43
45{
46 FakeNodeClock init_clock{}; // Uses the existing mock time
47 static const auto testing_setup{
48 MakeNoLogFileContext<TestingSetup>(
49 /*chain_type=*/ChainType::REGTEST,
50 {}),
51 };
52 g_setup = testing_setup.get();
53 // Replace validation_signals before creating chainman and mempool so they use it.
54 g_setup->m_node.validation_signals = std::make_unique<ValidationSignals>(std::make_unique<ImmediateBackgroundTaskRunner>());
55 ResetChainmanAndMempool(*g_setup, init_clock);
56}
57
59{
61 FuzzedDataProvider fuzzed_data_provider(buffer.data(), buffer.size());
62
63 auto& node{g_setup->m_node};
64 auto& connman{static_cast<ConnmanTestMsg&>(*node.connman)};
65 connman.Reset();
66 auto& chainman{static_cast<TestChainstateManager&>(*node.chainman)};
67 const auto block_index_size{WITH_LOCK(chainman.GetMutex(), return chainman.BlockIndex().size())};
68 const auto initial_sequence{WITH_LOCK(node.mempool->cs, return node.mempool->GetSequence())};
69 FakeNodeClock node_clock{1610000000s}; // 2021-01-07, arbitrary
70 FakeSteadyClock steady_clock;
71 chainman.ResetIbd();
72 chainman.DisableNextWrite();
73
74 // Reset, so that dangling pointers can be detected by sanitizers.
75 node.banman.reset();
76 node.addrman.reset();
77 node.peerman.reset();
78 node.addrman = std::make_unique<AddrMan>(*node.netgroupman, /*deterministic=*/true, /*consistency_check_ratio=*/0);
79 node.peerman = PeerManager::make(connman, *node.addrman,
80 /*banman=*/nullptr, chainman,
81 *node.mempool, *node.warnings,
83 .reconcile_txs = true,
84 .deterministic_rng = true,
85 });
86 connman.SetMsgProc(node.peerman.get());
87 connman.SetAddrman(*node.addrman);
88
89 node.validation_signals->RegisterValidationInterface(node.peerman.get());
90
92
93 std::vector<CNode*> peers;
94 const auto num_peers_to_add = fuzzed_data_provider.ConsumeIntegralInRange(1, 3);
95 for (int i = 0; i < num_peers_to_add; ++i) {
96 peers.push_back(ConsumeNodeAsUniquePtr(fuzzed_data_provider, steady_clock, i).release());
97 CNode& p2p_node = *peers.back();
98
99 FillNode(fuzzed_data_provider, connman, p2p_node);
100
101 connman.AddTestNode(p2p_node);
102 }
103
104 // Toggle IBD from within the loop, so that some messages may be processed
105 // under IBD and the rest after leaving it. JumpOutOfIbd() latches, so guard
106 // it to call at most once.
107 bool jump_out_of_ibd{false};
109 if (!jump_out_of_ibd) jump_out_of_ibd = fuzzed_data_provider.ConsumeBool();
110 if (jump_out_of_ibd && chainman.IsInitialBlockDownload()) chainman.JumpOutOfIbd();
111 const std::string random_message_type{fuzzed_data_provider.ConsumeBytesAsString(CMessageHeader::MESSAGE_TYPE_SIZE).c_str()};
112
113 node_clock.set(ConsumeTime(fuzzed_data_provider));
114
115 CSerializedNetMsg net_msg;
116 net_msg.m_type = random_message_type;
118
119 CNode& random_node = *PickValue(fuzzed_data_provider, peers);
120
121 connman.FlushSendBuffer(random_node);
122 (void)connman.ReceiveMsgFrom(random_node, std::move(net_msg));
123
124 bool more_work{true};
125 while (more_work) { // Ensure that every message is eventually processed in some way or another
126 random_node.fPauseSend = false;
127
128 try {
129 more_work = connman.ProcessMessagesOnce(random_node);
130 } catch (const std::ios_base::failure&) {
131 }
132 node.peerman->SendMessages(random_node);
133 }
134 }
135 node.validation_signals->SyncWithValidationInterfaceQueue();
136 node.validation_signals->UnregisterValidationInterface(node.peerman.get());
137 node.connman->StopNodes();
138 const auto end_sequence{WITH_LOCK(node.mempool->cs, return node.mempool->GetSequence())};
139 if (block_index_size != WITH_LOCK(chainman.GetMutex(), return chainman.BlockIndex().size()) || initial_sequence != end_sequence) {
140 // Reuse the global chainman and mempool, but reset them when dirty.
142 ResetChainmanAndMempool(*g_setup, node_clock);
143 }
144}
const TestingSetup * g_setup
static constexpr size_t MESSAGE_TYPE_SIZE
Definition: protocol.h:31
Information about a peer.
Definition: net.h:683
std::atomic_bool fPauseSend
Definition: net.h:751
Helper to initialize the global NodeClock, let a duration elapse, and reset it after use in a test.
Definition: time.h:54
Helper to initialize the global MockableSteadyClock, let a duration elapse, and reset it after use in...
Definition: time.h:29
std::string ConsumeBytesAsString(size_t num_bytes)
T ConsumeIntegralInRange(T min, T max)
static Mutex g_msgproc_mutex
Mutex for anything that is only accessed via the msg processing thread.
Definition: net.h:1044
static std::unique_ptr< PeerManager > make(CConnman &connman, AddrMan &addrman, BanMan *banman, ChainstateManager &chainman, CTxMemPool &pool, node::Warnings &warnings, Options opts)
256-bit opaque blob.
Definition: uint256.h:196
static const uint256 ZERO
Definition: uint256.h:204
LIMITED_WHILE(provider.remaining_bytes(), 10000)
Definition: basic.cpp:11
Definition: messages.h:21
constexpr unsigned int MAX_PROTOCOL_MESSAGE_LENGTH
Maximum length of incoming protocol messages (no message over 4 MB is currently acceptable).
Definition: net.h:65
FUZZ_TARGET(process_messages,.init=initialize_process_messages)
void MakeRandDeterministicDANGEROUS(const uint256 &seed) noexcept
Internal function to set g_determinstic_rng.
Definition: random.cpp:595
void initialize_process_messages()
node::NodeContext m_node
Definition: setup_common.h:60
std::string m_type
Definition: net.h:139
std::vector< unsigned char > data
Definition: net.h:138
void Reset()
Reset the internal state.
Definition: net.cpp:83
Testing setup that configures a complete environment.
Definition: setup_common.h:115
std::unique_ptr< ValidationSignals > validation_signals
Issues calls about blocks and transactions.
Definition: context.h:97
#define LOCK(cs)
Definition: sync.h:268
#define WITH_LOCK(cs, code)
Run code while locking a mutex.
Definition: sync.h:299
SeedRandomStateForTest(SeedRand::ZEROS)
void FillNode(FuzzedDataProvider &fuzzed_data_provider, ConnmanTestMsg &connman, CNode &node) noexcept
Definition: net.cpp:450
std::unique_ptr< CNode > ConsumeNodeAsUniquePtr(FuzzedDataProvider &fdp, FakeSteadyClock &clock, const std::optional< NodeId > &node_id_in=std::nullopt)
Definition: net.h:310
NodeSeconds ConsumeTime(FuzzedDataProvider &fuzzed_data_provider, const std::optional< int64_t > &min, const std::optional< int64_t > &max) noexcept
Definition: util.cpp:34
auto & PickValue(FuzzedDataProvider &fuzzed_data_provider, Collection &col)
Definition: util.h:57
std::vector< B > ConsumeRandomLengthByteVector(FuzzedDataProvider &fuzzed_data_provider, const std::optional< size_t > &max_length=std::nullopt) noexcept
Definition: util.h:63
@ ZEROS
Seed with a compile time constant of zeros.
std::vector< std::pair< COutPoint, CAmount > > ResetChainmanAndMempool(TestingSetup &setup, FakeNodeClock &node_clock)
Definition: validation.cpp:108
FuzzedDataProvider & fuzzed_data_provider
Definition: fees.cpp:45