mirror of
https://github.com/bitcoin/bitcoin.git
synced 2026-01-20 07:09:15 +01:00
17cf9ff7efUse cluster size limit for -maxmempool bound, and allow -maxmempool=0 in general (Suhas Daftuar)315e43e5d8Sanity check `GetFeerateDiagram()` in CTxMemPool::check() (Suhas Daftuar)de2e9a24c4test: extend package rbf functional test to larger clusters (Suhas Daftuar)4ef4ddb504doc: update policy/packages.md for new package acceptance logic (Suhas Daftuar)79f73ad713Add check that GetSortedScoreWithTopology() agrees with CompareMiningScoreWithTopology() (Suhas Daftuar)a86ac11768Update comments for CTxMemPool class (Suhas Daftuar)9567eaa66dInvoke TxGraph::DoWork() at appropriate times (Suhas Daftuar)6c5c44f774test: add functional test for new cluster mempool RPCs (Suhas Daftuar)72f60c877edoc: Update mempool_replacements.md to reflect feerate diagram checks (Suhas Daftuar)21693f031aExpose cluster information via rpc (Suhas Daftuar)72e74e0d42fuzz: try to add more code coverage for mempool fuzzing (Suhas Daftuar)f107417490bench: add more mempool benchmarks (Suhas Daftuar)7976eb1ae7Avoid violating mempool policy limits in tests (Suhas Daftuar)84de685cf7Stop tracking parents/children outside of txgraph (Suhas Daftuar)88672e205bRewrite GatherClusters to use the txgraph implementation (Suhas Daftuar)1ca4f01090Fix miniminer_tests to work with cluster limits (Suhas Daftuar)1902111e0fEliminate CheckPackageLimits, which no longer does anything (Suhas Daftuar)3a646ec462Rework RBF and TRUC validation (Suhas Daftuar)19b8479868Make getting parents/children a function of the mempool, not a mempool entry (Suhas Daftuar)5560913e51Rework truc_policy to use descendants, not children (Suhas Daftuar)a4458d6c40Use txgraph to calculate descendants (Suhas Daftuar)c8b6f70d64Use txgraph to calculate ancestors (Suhas Daftuar)241a3e666bSimplify ancestor calculation functions (Suhas Daftuar)b9cec7f0a1Make removeConflicts private (Suhas Daftuar)0402e6c780Remove unused limits from CalculateMemPoolAncestors (Suhas Daftuar)08be765ac2Remove mempool logic designed to maintain ancestor/descendant state (Suhas Daftuar)fc4e3e6bc1Remove unused members from CTxMemPoolEntry (Suhas Daftuar)ff3b398d12mempool: eliminate accessors to mempool entry ancestor/descendant cached state (Suhas Daftuar)b9a2039f51Eliminate use of cached ancestor data in miniminer_tests and truc_policy (Suhas Daftuar)ba09fc9774mempool: Remove unused function CalculateDescendantMaximum (Suhas Daftuar)8e49477e86wallet: Replace max descendant count with cluster_count (Suhas Daftuar)e031085fd4Eliminate Single-Conflict RBF Carve Out (Suhas Daftuar)cf3ab8e1d0Stop enforcing descendant size/count limits (Suhas Daftuar)89ae38f489test: remove rbf carveout test from mempool_limit.py (Suhas Daftuar)c0bd04d18fCalculate descendant information for mempool RPC output on-the-fly (Suhas Daftuar)bdcefb8a8bUse mempool/txgraph to determine if a tx has descendants (Suhas Daftuar)69e1eaa6edAdd test case for cluster size limits to TRUC logic (Suhas Daftuar)9cda64b86cStop enforcing ancestor size/count limits (Suhas Daftuar)1f93227a84Remove dependency on cached ancestor data in mini-miner (Suhas Daftuar)9fbe0a4ac2rpc: Calculate ancestor data from scratch for mempool rpc calls (Suhas Daftuar)7961496ddaReimplement GetTransactionAncestry() to not rely on cached data (Suhas Daftuar)feceaa42e8Remove CTxMemPool::GetSortedDepthAndScore (Suhas Daftuar)21b5cea588Use cluster linearization for transaction relay sort order (Suhas Daftuar)6445aa7d97Remove the ancestor and descendant indices from the mempool (Suhas Daftuar)216e693729Implement new RBF logic for cluster mempool (Suhas Daftuar)ff8f115decpolicy: Remove CPFP carveout rule (Suhas Daftuar)c3f1afc934test: rewrite PopulateMempool to not violate mempool policy (cluster size) limits (Suhas Daftuar)47ab32fdb1Select transactions for blocks based on chunk feerate (Suhas Daftuar)dec138d1ddfuzz: remove comparison between mini_miner block construction and miner (Suhas Daftuar)6c2bceb200bench: rewrite ComplexMemPool to not create oversized clusters (Suhas Daftuar)1ad4590f63Limit mempool size based on chunk feerate (Suhas Daftuar)b11c89cab2Rework miner_tests to not require large cluster limit (Suhas Daftuar)95a8297d48Check cluster limits when using -walletrejectlongchains (Suhas Daftuar)95762e6759Do not allow mempool clusters to exceed configured limits (Suhas Daftuar)edb3e7cdf6[test] rework/delete feature_rbf tests requiring large clusters (glozow)435fd56711test: update feature_rbf.py replacement test (Suhas Daftuar)34e32985e8Add new (unused) limits for cluster size/count (Suhas Daftuar)838d7e3553Add transactions to txgraph, but without cluster dependencies (Suhas Daftuar)d5ed9cb3ebAdd accessor for sigops-adjusted weight (Suhas Daftuar)1bf3b51396Add sigops adjusted weight calculator (Suhas Daftuar)c18c68a950Create a txgraph inside CTxMemPool (Suhas Daftuar)29a94d5b2fMake CTxMemPoolEntry derive from TxGraph::Ref (Suhas Daftuar)92b0079fe3Allow moving CTxMemPoolEntry objects, disallow copying (Suhas Daftuar)6c73e47448mempool: Store iterators into mapTx in mapNextTx (Suhas Daftuar)51430680ecAllow moving an Epoch::Marker (Suhas Daftuar) Pull request description: [Reopening #28676 here as a new PR, because GitHub is slow to load the page making it hard to scroll through and see comments. Also, that PR was originally opened with a prototype implementation which has changed significantly with the introduction of `TxGraph`.] This is an implementation of the [cluster mempool proposal](https://delvingbitcoin.org/t/an-overview-of-the-cluster-mempool-proposal/393). This branch implements the following observable behavior changes: - Maintains a partitioning of the mempool into connected clusters (via the `txgraph` class), which are limited in vsize to 101 kvB by default, and limited in count to 64 by default. - Each cluster is sorted ("linearized") to try to optimize for selecting highest-feerate-subsets of a cluster first - Transaction selection for mining is updated to use the cluster linearizations, selecting highest feerate "chunks" first for inclusion in a block template. - Mempool eviction is updated to use the cluster linearizations, selecting lowest feerate "chunks" first for removal. - The RBF rules are updated to: (a) drop the requirement that no new inputs are introduced; (b) change the feerate requirement to instead check that the feerate diagram of the mempool will strictly improve; (c) replace the direct conflicts limit with a directly-conflicting-clusters limit. - The CPFP carveout rule is eliminated (it doesn't make sense in a cluster-limited mempool) - The ancestor and descendant limits are no longer enforced. - New cluster count/cluster vsize limits are now enforced instead. - Transaction relay now uses chunk feerate comparisons to determine the order that newly received transactions are announced to peers. Additionally, the cached ancestor and descendant data are dropped from the mempool, along with the multi_index indices that were maintained to sort the mempool by ancestor and descendant feerates. For compatibility (eg with wallet behavior or RPCs exposing this), this information is now calculated dynamically instead. ACKs for top commit: instagibbs: reACK17cf9ff7efglozow: reACK17cf9ff7efsipa: ACK17cf9ff7efTree-SHA512: bbde46d913d56f8d9c0426cb0a6c4fa80b01b0a4c2299500769921f886082fb4f51f1694e0ee1bc318c52e1976d7ebed8134a64eda0b8044f3a708c04938eee7
401 lines
14 KiB
C++
401 lines
14 KiB
C++
// Copyright (c) 2021-2022 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 <base58.h>
|
|
#include <key.h>
|
|
#include <key_io.h>
|
|
#include <primitives/block.h>
|
|
#include <primitives/transaction.h>
|
|
#include <psbt.h>
|
|
#include <rpc/client.h>
|
|
#include <rpc/request.h>
|
|
#include <rpc/server.h>
|
|
#include <span.h>
|
|
#include <streams.h>
|
|
#include <test/fuzz/FuzzedDataProvider.h>
|
|
#include <test/fuzz/fuzz.h>
|
|
#include <test/fuzz/util.h>
|
|
#include <test/util/setup_common.h>
|
|
#include <tinyformat.h>
|
|
#include <uint256.h>
|
|
#include <univalue.h>
|
|
#include <util/strencodings.h>
|
|
#include <util/string.h>
|
|
#include <util/time.h>
|
|
|
|
#include <algorithm>
|
|
#include <cassert>
|
|
#include <cstdint>
|
|
#include <cstdlib>
|
|
#include <exception>
|
|
#include <iostream>
|
|
#include <memory>
|
|
#include <optional>
|
|
#include <stdexcept>
|
|
#include <vector>
|
|
enum class ChainType;
|
|
|
|
using util::Join;
|
|
using util::ToString;
|
|
|
|
namespace {
|
|
struct RPCFuzzTestingSetup : public TestingSetup {
|
|
RPCFuzzTestingSetup(const ChainType chain_type, TestOpts opts) : TestingSetup{chain_type, opts}
|
|
{
|
|
}
|
|
|
|
void CallRPC(const std::string& rpc_method, const std::vector<std::string>& arguments)
|
|
{
|
|
JSONRPCRequest request;
|
|
request.context = &m_node;
|
|
request.strMethod = rpc_method;
|
|
try {
|
|
request.params = RPCConvertValues(rpc_method, arguments);
|
|
} catch (const std::runtime_error&) {
|
|
return;
|
|
}
|
|
tableRPC.execute(request);
|
|
}
|
|
|
|
std::vector<std::string> GetRPCCommands() const
|
|
{
|
|
return tableRPC.listCommands();
|
|
}
|
|
};
|
|
|
|
RPCFuzzTestingSetup* rpc_testing_setup = nullptr;
|
|
std::string g_limit_to_rpc_command;
|
|
|
|
// RPC commands which are not appropriate for fuzzing: such as RPC commands
|
|
// reading or writing to a filename passed as an RPC parameter, RPC commands
|
|
// resulting in network activity, etc.
|
|
const std::vector<std::string> RPC_COMMANDS_NOT_SAFE_FOR_FUZZING{
|
|
"addconnection", // avoid DNS lookups
|
|
"addnode", // avoid DNS lookups
|
|
"addpeeraddress", // avoid DNS lookups
|
|
"dumptxoutset", // avoid writing to disk
|
|
"enumeratesigners",
|
|
"echoipc", // avoid assertion failure (Assertion `"EnsureAnyNodeContext(request.context).init" && check' failed.)
|
|
"generatetoaddress", // avoid prohibitively slow execution (when `num_blocks` is large)
|
|
"generatetodescriptor", // avoid prohibitively slow execution (when `nblocks` is large)
|
|
"gettxoutproof", // avoid prohibitively slow execution
|
|
"importmempool", // avoid reading from disk
|
|
"loadtxoutset", // avoid reading from disk
|
|
"loadwallet", // avoid reading from disk
|
|
"savemempool", // disabled as a precautionary measure: may take a file path argument in the future
|
|
"setban", // avoid DNS lookups
|
|
"stop", // avoid shutdown state
|
|
};
|
|
|
|
// RPC commands which are safe for fuzzing.
|
|
const std::vector<std::string> RPC_COMMANDS_SAFE_FOR_FUZZING{
|
|
"analyzepsbt",
|
|
"clearbanned",
|
|
"combinepsbt",
|
|
"combinerawtransaction",
|
|
"converttopsbt",
|
|
"createmultisig",
|
|
"createpsbt",
|
|
"createrawtransaction",
|
|
"decodepsbt",
|
|
"decoderawtransaction",
|
|
"decodescript",
|
|
"deriveaddresses",
|
|
"descriptorprocesspsbt",
|
|
"disconnectnode",
|
|
"echo",
|
|
"echojson",
|
|
"estimaterawfee",
|
|
"estimatesmartfee",
|
|
"finalizepsbt",
|
|
"generate",
|
|
"generateblock",
|
|
"getaddednodeinfo",
|
|
"getaddrmaninfo",
|
|
"getbestblockhash",
|
|
"getblock",
|
|
"getblockchaininfo",
|
|
"getblockcount",
|
|
"getblockfilter",
|
|
"getblockfrompeer", // when no peers are connected, no p2p message is sent
|
|
"getblockhash",
|
|
"getblockheader",
|
|
"getblockstats",
|
|
"getblocktemplate",
|
|
"getchaintips",
|
|
"getchainstates",
|
|
"getchaintxstats",
|
|
"getconnectioncount",
|
|
"getdeploymentinfo",
|
|
"getdescriptoractivity",
|
|
"getdescriptorinfo",
|
|
"getdifficulty",
|
|
"getindexinfo",
|
|
"getmemoryinfo",
|
|
"getmempoolancestors",
|
|
"getmempooldescendants",
|
|
"getmempoolentry",
|
|
"getmempoolfeeratediagram",
|
|
"getmempoolcluster",
|
|
"getmempoolinfo",
|
|
"getmininginfo",
|
|
"getnettotals",
|
|
"getnetworkhashps",
|
|
"getnetworkinfo",
|
|
"getnodeaddresses",
|
|
"getorphantxs",
|
|
"getpeerinfo",
|
|
"getprioritisedtransactions",
|
|
"getrawaddrman",
|
|
"getrawmempool",
|
|
"getrawtransaction",
|
|
"getrpcinfo",
|
|
"gettxout",
|
|
"gettxoutsetinfo",
|
|
"gettxspendingprevout",
|
|
"help",
|
|
"invalidateblock",
|
|
"joinpsbts",
|
|
"listbanned",
|
|
"logging",
|
|
"mockscheduler",
|
|
"ping",
|
|
"preciousblock",
|
|
"prioritisetransaction",
|
|
"pruneblockchain",
|
|
"reconsiderblock",
|
|
"scanblocks",
|
|
"scantxoutset",
|
|
"sendmsgtopeer", // when no peers are connected, no p2p message is sent
|
|
"sendrawtransaction",
|
|
"setmocktime",
|
|
"setnetworkactive",
|
|
"signmessagewithprivkey",
|
|
"signrawtransactionwithkey",
|
|
"submitblock",
|
|
"submitheader",
|
|
"submitpackage",
|
|
"syncwithvalidationinterfacequeue",
|
|
"testmempoolaccept",
|
|
"uptime",
|
|
"utxoupdatepsbt",
|
|
"validateaddress",
|
|
"verifychain",
|
|
"verifymessage",
|
|
"verifytxoutproof",
|
|
"waitforblock",
|
|
"waitforblockheight",
|
|
"waitfornewblock",
|
|
};
|
|
|
|
std::string ConsumeScalarRPCArgument(FuzzedDataProvider& fuzzed_data_provider, bool& good_data)
|
|
{
|
|
const size_t max_string_length = 4096;
|
|
const size_t max_base58_bytes_length{64};
|
|
std::string r;
|
|
CallOneOf(
|
|
fuzzed_data_provider,
|
|
[&] {
|
|
// string argument
|
|
r = fuzzed_data_provider.ConsumeRandomLengthString(max_string_length);
|
|
},
|
|
[&] {
|
|
// base64 argument
|
|
r = EncodeBase64(fuzzed_data_provider.ConsumeRandomLengthString(max_string_length));
|
|
},
|
|
[&] {
|
|
// hex argument
|
|
r = HexStr(fuzzed_data_provider.ConsumeRandomLengthString(max_string_length));
|
|
},
|
|
[&] {
|
|
// bool argument
|
|
r = fuzzed_data_provider.ConsumeBool() ? "true" : "false";
|
|
},
|
|
[&] {
|
|
// range argument
|
|
r = "[" + ToString(fuzzed_data_provider.ConsumeIntegral<int64_t>()) + "," + ToString(fuzzed_data_provider.ConsumeIntegral<int64_t>()) + "]";
|
|
},
|
|
[&] {
|
|
// integral argument (int64_t)
|
|
r = ToString(fuzzed_data_provider.ConsumeIntegral<int64_t>());
|
|
},
|
|
[&] {
|
|
// integral argument (uint64_t)
|
|
r = ToString(fuzzed_data_provider.ConsumeIntegral<uint64_t>());
|
|
},
|
|
[&] {
|
|
// floating point argument
|
|
r = strprintf("%f", fuzzed_data_provider.ConsumeFloatingPoint<double>());
|
|
},
|
|
[&] {
|
|
// tx destination argument
|
|
r = EncodeDestination(ConsumeTxDestination(fuzzed_data_provider));
|
|
},
|
|
[&] {
|
|
// uint160 argument
|
|
r = ConsumeUInt160(fuzzed_data_provider).ToString();
|
|
},
|
|
[&] {
|
|
// uint256 argument
|
|
r = ConsumeUInt256(fuzzed_data_provider).ToString();
|
|
},
|
|
[&] {
|
|
// base32 argument
|
|
r = EncodeBase32(fuzzed_data_provider.ConsumeRandomLengthString(max_string_length));
|
|
},
|
|
[&] {
|
|
// base58 argument
|
|
r = EncodeBase58(MakeUCharSpan(fuzzed_data_provider.ConsumeRandomLengthString(max_base58_bytes_length)));
|
|
},
|
|
[&] {
|
|
// base58 argument with checksum
|
|
r = EncodeBase58Check(MakeUCharSpan(fuzzed_data_provider.ConsumeRandomLengthString(max_base58_bytes_length)));
|
|
},
|
|
[&] {
|
|
// hex encoded block
|
|
std::optional<CBlock> opt_block = ConsumeDeserializable<CBlock>(fuzzed_data_provider, TX_WITH_WITNESS);
|
|
if (!opt_block) {
|
|
good_data = false;
|
|
return;
|
|
}
|
|
DataStream data_stream{};
|
|
data_stream << TX_WITH_WITNESS(*opt_block);
|
|
r = HexStr(data_stream);
|
|
},
|
|
[&] {
|
|
// hex encoded block header
|
|
std::optional<CBlockHeader> opt_block_header = ConsumeDeserializable<CBlockHeader>(fuzzed_data_provider);
|
|
if (!opt_block_header) {
|
|
good_data = false;
|
|
return;
|
|
}
|
|
DataStream data_stream{};
|
|
data_stream << *opt_block_header;
|
|
r = HexStr(data_stream);
|
|
},
|
|
[&] {
|
|
// hex encoded tx
|
|
std::optional<CMutableTransaction> opt_tx = ConsumeDeserializable<CMutableTransaction>(fuzzed_data_provider, TX_WITH_WITNESS);
|
|
if (!opt_tx) {
|
|
good_data = false;
|
|
return;
|
|
}
|
|
DataStream data_stream;
|
|
auto allow_witness = (fuzzed_data_provider.ConsumeBool() ? TX_WITH_WITNESS : TX_NO_WITNESS);
|
|
data_stream << allow_witness(*opt_tx);
|
|
r = HexStr(data_stream);
|
|
},
|
|
[&] {
|
|
// base64 encoded psbt
|
|
std::optional<PartiallySignedTransaction> opt_psbt = ConsumeDeserializable<PartiallySignedTransaction>(fuzzed_data_provider);
|
|
if (!opt_psbt) {
|
|
good_data = false;
|
|
return;
|
|
}
|
|
DataStream data_stream{};
|
|
data_stream << *opt_psbt;
|
|
r = EncodeBase64(data_stream);
|
|
},
|
|
[&] {
|
|
// base58 encoded key
|
|
CKey key = ConsumePrivateKey(fuzzed_data_provider);
|
|
if (!key.IsValid()) {
|
|
good_data = false;
|
|
return;
|
|
}
|
|
r = EncodeSecret(key);
|
|
},
|
|
[&] {
|
|
// hex encoded pubkey
|
|
CKey key = ConsumePrivateKey(fuzzed_data_provider);
|
|
if (!key.IsValid()) {
|
|
good_data = false;
|
|
return;
|
|
}
|
|
r = HexStr(key.GetPubKey());
|
|
});
|
|
return r;
|
|
}
|
|
|
|
std::string ConsumeArrayRPCArgument(FuzzedDataProvider& fuzzed_data_provider, bool& good_data)
|
|
{
|
|
std::vector<std::string> scalar_arguments;
|
|
LIMITED_WHILE(good_data && fuzzed_data_provider.ConsumeBool(), 100)
|
|
{
|
|
scalar_arguments.push_back(ConsumeScalarRPCArgument(fuzzed_data_provider, good_data));
|
|
}
|
|
return "[\"" + Join(scalar_arguments, "\",\"") + "\"]";
|
|
}
|
|
|
|
std::string ConsumeRPCArgument(FuzzedDataProvider& fuzzed_data_provider, bool& good_data)
|
|
{
|
|
return fuzzed_data_provider.ConsumeBool() ? ConsumeScalarRPCArgument(fuzzed_data_provider, good_data) : ConsumeArrayRPCArgument(fuzzed_data_provider, good_data);
|
|
}
|
|
|
|
RPCFuzzTestingSetup* InitializeRPCFuzzTestingSetup()
|
|
{
|
|
static const auto setup = MakeNoLogFileContext<RPCFuzzTestingSetup>();
|
|
SetRPCWarmupFinished();
|
|
return setup.get();
|
|
}
|
|
}; // namespace
|
|
|
|
void initialize_rpc()
|
|
{
|
|
rpc_testing_setup = InitializeRPCFuzzTestingSetup();
|
|
const std::vector<std::string> supported_rpc_commands = rpc_testing_setup->GetRPCCommands();
|
|
for (const std::string& rpc_command : supported_rpc_commands) {
|
|
const bool safe_for_fuzzing = std::find(RPC_COMMANDS_SAFE_FOR_FUZZING.begin(), RPC_COMMANDS_SAFE_FOR_FUZZING.end(), rpc_command) != RPC_COMMANDS_SAFE_FOR_FUZZING.end();
|
|
const bool not_safe_for_fuzzing = std::find(RPC_COMMANDS_NOT_SAFE_FOR_FUZZING.begin(), RPC_COMMANDS_NOT_SAFE_FOR_FUZZING.end(), rpc_command) != RPC_COMMANDS_NOT_SAFE_FOR_FUZZING.end();
|
|
if (!(safe_for_fuzzing || not_safe_for_fuzzing)) {
|
|
std::cerr << "Error: RPC command \"" << rpc_command << "\" not found in RPC_COMMANDS_SAFE_FOR_FUZZING or RPC_COMMANDS_NOT_SAFE_FOR_FUZZING. Please update " << __FILE__ << ".\n";
|
|
std::terminate();
|
|
}
|
|
if (safe_for_fuzzing && not_safe_for_fuzzing) {
|
|
std::cerr << "Error: RPC command \"" << rpc_command << "\" found in *both* RPC_COMMANDS_SAFE_FOR_FUZZING and RPC_COMMANDS_NOT_SAFE_FOR_FUZZING. Please update " << __FILE__ << ".\n";
|
|
std::terminate();
|
|
}
|
|
}
|
|
const char* limit_to_rpc_command_env = std::getenv("LIMIT_TO_RPC_COMMAND");
|
|
if (limit_to_rpc_command_env != nullptr) {
|
|
g_limit_to_rpc_command = std::string{limit_to_rpc_command_env};
|
|
}
|
|
}
|
|
|
|
FUZZ_TARGET(rpc, .init = initialize_rpc)
|
|
{
|
|
SeedRandomStateForTest(SeedRand::ZEROS);
|
|
FuzzedDataProvider fuzzed_data_provider{buffer.data(), buffer.size()};
|
|
bool good_data{true};
|
|
SetMockTime(ConsumeTime(fuzzed_data_provider));
|
|
const std::string rpc_command = fuzzed_data_provider.ConsumeRandomLengthString(64);
|
|
if (!g_limit_to_rpc_command.empty() && rpc_command != g_limit_to_rpc_command) {
|
|
return;
|
|
}
|
|
const bool safe_for_fuzzing = std::find(RPC_COMMANDS_SAFE_FOR_FUZZING.begin(), RPC_COMMANDS_SAFE_FOR_FUZZING.end(), rpc_command) != RPC_COMMANDS_SAFE_FOR_FUZZING.end();
|
|
if (!safe_for_fuzzing) {
|
|
return;
|
|
}
|
|
std::vector<std::string> arguments;
|
|
LIMITED_WHILE(good_data && fuzzed_data_provider.ConsumeBool(), 100)
|
|
{
|
|
arguments.push_back(ConsumeRPCArgument(fuzzed_data_provider, good_data));
|
|
}
|
|
try {
|
|
std::optional<test_only_CheckFailuresAreExceptionsNotAborts> maybe_mock{};
|
|
if (rpc_command == "echo") {
|
|
// Avoid aborting fuzzing for this specific test-only RPC with an
|
|
// intentional trigger_internal_bug
|
|
maybe_mock.emplace();
|
|
}
|
|
rpc_testing_setup->CallRPC(rpc_command, arguments);
|
|
} catch (const UniValue& json_rpc_error) {
|
|
const std::string error_msg{json_rpc_error.find_value("message").get_str()};
|
|
if (error_msg.starts_with("Internal bug detected")) {
|
|
// Only allow the intentional internal bug
|
|
assert(error_msg.find("trigger_internal_bug") != std::string::npos);
|
|
}
|
|
}
|
|
}
|