mirror of
https://github.com/bitcoin/bitcoin.git
synced 2025-02-09 10:43:19 -05:00
net: Assume that SetCommonVersion is called at most once per peer
This commit is contained in:
parent
dca80ffb45
commit
fa0f415709
2 changed files with 14 additions and 15 deletions
|
@ -24,14 +24,15 @@
|
||||||
#include <sync.h>
|
#include <sync.h>
|
||||||
#include <threadinterrupt.h>
|
#include <threadinterrupt.h>
|
||||||
#include <uint256.h>
|
#include <uint256.h>
|
||||||
|
#include <util/check.h>
|
||||||
|
|
||||||
#include <atomic>
|
#include <atomic>
|
||||||
|
#include <condition_variable>
|
||||||
#include <cstdint>
|
#include <cstdint>
|
||||||
#include <deque>
|
#include <deque>
|
||||||
#include <map>
|
#include <map>
|
||||||
#include <thread>
|
|
||||||
#include <memory>
|
#include <memory>
|
||||||
#include <condition_variable>
|
#include <thread>
|
||||||
|
|
||||||
class CScheduler;
|
class CScheduler;
|
||||||
class CNode;
|
class CNode;
|
||||||
|
@ -1131,6 +1132,7 @@ public:
|
||||||
|
|
||||||
void SetCommonVersion(int greatest_common_version)
|
void SetCommonVersion(int greatest_common_version)
|
||||||
{
|
{
|
||||||
|
Assume(m_greatest_common_version == INIT_PROTO_VERSION);
|
||||||
m_greatest_common_version = greatest_common_version;
|
m_greatest_common_version = greatest_common_version;
|
||||||
}
|
}
|
||||||
int GetCommonVersion() const
|
int GetCommonVersion() const
|
||||||
|
|
|
@ -48,8 +48,9 @@ void test_one_input(const std::vector<uint8_t>& buffer)
|
||||||
fuzzed_data_provider.ConsumeRandomLengthString(32),
|
fuzzed_data_provider.ConsumeRandomLengthString(32),
|
||||||
fuzzed_data_provider.PickValueInArray({ConnectionType::INBOUND, ConnectionType::OUTBOUND_FULL_RELAY, ConnectionType::MANUAL, ConnectionType::FEELER, ConnectionType::BLOCK_RELAY, ConnectionType::ADDR_FETCH}),
|
fuzzed_data_provider.PickValueInArray({ConnectionType::INBOUND, ConnectionType::OUTBOUND_FULL_RELAY, ConnectionType::MANUAL, ConnectionType::FEELER, ConnectionType::BLOCK_RELAY, ConnectionType::ADDR_FETCH}),
|
||||||
fuzzed_data_provider.ConsumeBool()};
|
fuzzed_data_provider.ConsumeBool()};
|
||||||
|
node.SetCommonVersion(fuzzed_data_provider.ConsumeIntegral<int>());
|
||||||
while (fuzzed_data_provider.ConsumeBool()) {
|
while (fuzzed_data_provider.ConsumeBool()) {
|
||||||
switch (fuzzed_data_provider.ConsumeIntegralInRange<int>(0, 11)) {
|
switch (fuzzed_data_provider.ConsumeIntegralInRange<int>(0, 10)) {
|
||||||
case 0: {
|
case 0: {
|
||||||
node.CloseSocketDisconnect();
|
node.CloseSocketDisconnect();
|
||||||
break;
|
break;
|
||||||
|
@ -59,10 +60,6 @@ void test_one_input(const std::vector<uint8_t>& buffer)
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
case 2: {
|
case 2: {
|
||||||
node.SetCommonVersion(fuzzed_data_provider.ConsumeIntegral<int>());
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
case 3: {
|
|
||||||
const std::vector<bool> asmap = ConsumeRandomLengthBitVector(fuzzed_data_provider);
|
const std::vector<bool> asmap = ConsumeRandomLengthBitVector(fuzzed_data_provider);
|
||||||
if (!SanityCheckASMap(asmap)) {
|
if (!SanityCheckASMap(asmap)) {
|
||||||
break;
|
break;
|
||||||
|
@ -71,18 +68,18 @@ void test_one_input(const std::vector<uint8_t>& buffer)
|
||||||
node.copyStats(stats, asmap);
|
node.copyStats(stats, asmap);
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
case 4: {
|
case 3: {
|
||||||
const CNode* add_ref_node = node.AddRef();
|
const CNode* add_ref_node = node.AddRef();
|
||||||
assert(add_ref_node == &node);
|
assert(add_ref_node == &node);
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
case 5: {
|
case 4: {
|
||||||
if (node.GetRefCount() > 0) {
|
if (node.GetRefCount() > 0) {
|
||||||
node.Release();
|
node.Release();
|
||||||
}
|
}
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
case 6: {
|
case 5: {
|
||||||
if (node.m_addr_known == nullptr) {
|
if (node.m_addr_known == nullptr) {
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
|
@ -93,7 +90,7 @@ void test_one_input(const std::vector<uint8_t>& buffer)
|
||||||
node.AddAddressKnown(*addr_opt);
|
node.AddAddressKnown(*addr_opt);
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
case 7: {
|
case 6: {
|
||||||
if (node.m_addr_known == nullptr) {
|
if (node.m_addr_known == nullptr) {
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
|
@ -105,7 +102,7 @@ void test_one_input(const std::vector<uint8_t>& buffer)
|
||||||
node.PushAddress(*addr_opt, fast_random_context);
|
node.PushAddress(*addr_opt, fast_random_context);
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
case 8: {
|
case 7: {
|
||||||
const std::optional<CInv> inv_opt = ConsumeDeserializable<CInv>(fuzzed_data_provider);
|
const std::optional<CInv> inv_opt = ConsumeDeserializable<CInv>(fuzzed_data_provider);
|
||||||
if (!inv_opt) {
|
if (!inv_opt) {
|
||||||
break;
|
break;
|
||||||
|
@ -113,11 +110,11 @@ void test_one_input(const std::vector<uint8_t>& buffer)
|
||||||
node.AddKnownTx(inv_opt->hash);
|
node.AddKnownTx(inv_opt->hash);
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
case 9: {
|
case 8: {
|
||||||
node.PushTxInventory(ConsumeUInt256(fuzzed_data_provider));
|
node.PushTxInventory(ConsumeUInt256(fuzzed_data_provider));
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
case 10: {
|
case 9: {
|
||||||
const std::optional<CService> service_opt = ConsumeDeserializable<CService>(fuzzed_data_provider);
|
const std::optional<CService> service_opt = ConsumeDeserializable<CService>(fuzzed_data_provider);
|
||||||
if (!service_opt) {
|
if (!service_opt) {
|
||||||
break;
|
break;
|
||||||
|
@ -125,7 +122,7 @@ void test_one_input(const std::vector<uint8_t>& buffer)
|
||||||
node.SetAddrLocal(*service_opt);
|
node.SetAddrLocal(*service_opt);
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
case 11: {
|
case 10: {
|
||||||
const std::vector<uint8_t> b = ConsumeRandomLengthByteVector(fuzzed_data_provider);
|
const std::vector<uint8_t> b = ConsumeRandomLengthByteVector(fuzzed_data_provider);
|
||||||
bool complete;
|
bool complete;
|
||||||
node.ReceiveMsgBytes(b, complete);
|
node.ReceiveMsgBytes(b, complete);
|
||||||
|
|
Loading…
Add table
Reference in a new issue