setup_common.cpp
1 // Copyright (c) 2011-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 <test/util/setup_common.h> 6 7 #include <addrman.h> 8 #include <banman.h> 9 #include <chainparams.h> 10 #include <common/system.h> 11 #include <consensus/consensus.h> 12 #include <consensus/params.h> 13 #include <consensus/validation.h> 14 #include <crypto/sha256.h> 15 #include <init.h> 16 #include <init/common.h> 17 #include <interfaces/chain.h> 18 #include <kernel/mempool_entry.h> 19 #include <logging.h> 20 #include <net.h> 21 #include <net_processing.h> 22 #include <node/blockstorage.h> 23 #include <node/chainstate.h> 24 #include <node/context.h> 25 #include <node/kernel_notifications.h> 26 #include <node/mempool_args.h> 27 #include <node/miner.h> 28 #include <node/peerman_args.h> 29 #include <node/warnings.h> 30 #include <noui.h> 31 #include <policy/fees/block_policy_estimator.h> 32 #include <pow.h> 33 #include <random.h> 34 #include <rpc/blockchain.h> 35 #include <rpc/register.h> 36 #include <rpc/server.h> 37 #include <scheduler.h> 38 #include <script/sigcache.h> 39 #include <streams.h> 40 #include <test/util/coverage.h> 41 #include <test/util/net.h> 42 #include <test/util/random.h> 43 #include <test/util/transaction_utils.h> 44 #include <test/util/txmempool.h> 45 #include <txdb.h> 46 #include <txmempool.h> 47 #include <util/chaintype.h> 48 #include <util/check.h> 49 #include <util/fs_helpers.h> 50 #include <util/rbf.h> 51 #include <util/strencodings.h> 52 #include <util/string.h> 53 #include <util/task_runner.h> 54 #include <util/thread.h> 55 #include <util/threadnames.h> 56 #include <util/time.h> 57 #include <util/translation.h> 58 #include <util/vector.h> 59 #include <validation.h> 60 #include <validationinterface.h> 61 #include <walletinitinterface.h> 62 63 #include <algorithm> 64 #include <future> 65 #include <functional> 66 #include <stdexcept> 67 68 using namespace util::hex_literals; 69 using node::ApplyArgsManOptions; 70 using node::BlockAssembler; 71 using node::BlockManager; 72 using node::KernelNotifications; 73 using node::LoadChainstate; 74 using node::RegenerateCommitments; 75 using node::VerifyLoadedChainstate; 76 77 const TranslateFn G_TRANSLATION_FUN{nullptr}; 78 79 constexpr inline auto TEST_DIR_PATH_ELEMENT{"test_common bitcoin"}; // Includes a space to catch possible path escape issues. 80 /** Random context to get unique temp data dirs. Separate from m_rng, which can be seeded from a const env var */ 81 static FastRandomContext g_rng_temp_path; 82 static const bool g_rng_temp_path_init{[] { 83 // Must be initialized before any SeedRandomForTest 84 Assert(!g_used_g_prng); 85 (void)g_rng_temp_path.rand64(); 86 g_used_g_prng = false; 87 ResetCoverageCounters(); // The seed strengthen in SeedStartup is not deterministic, so exclude it from coverage counts 88 return true; 89 }()}; 90 91 struct NetworkSetup 92 { 93 NetworkSetup() 94 { 95 Assert(SetupNetworking()); 96 } 97 }; 98 static NetworkSetup g_networksetup_instance; 99 100 void SetupCommonTestArgs(ArgsManager& argsman) 101 { 102 argsman.AddArg("-testdatadir", strprintf("Custom data directory (default: %s<random_string>)", fs::PathToString(fs::temp_directory_path() / TEST_DIR_PATH_ELEMENT / "")), 103 ArgsManager::ALLOW_ANY, OptionsCategory::DEBUG_TEST); 104 } 105 106 /** Test setup failure */ 107 static void ExitFailure(std::string_view str_err) 108 { 109 std::cerr << str_err << std::endl; 110 exit(EXIT_FAILURE); 111 } 112 113 BasicTestingSetup::BasicTestingSetup(const ChainType chainType, TestOpts opts) 114 : m_args{} 115 { 116 if (!EnableFuzzDeterminism()) { 117 SeedRandomForTest(SeedRand::FIXED_SEED); 118 } 119 120 // Reset globals 121 fDiscover = true; 122 fListen = true; 123 SetRPCWarmupStarting(); 124 g_reachable_nets.Reset(); 125 ClearLocal(); 126 127 m_node.shutdown_signal = &m_interrupt; 128 m_node.shutdown_request = [this]{ return m_interrupt(); }; 129 m_node.args = &gArgs; 130 std::vector<const char*> arguments = Cat( 131 { 132 "dummy", 133 "-printtoconsole=0", 134 "-logsourcelocations", 135 "-logtimemicros", 136 "-logthreadnames", 137 "-loglevel=trace", 138 "-debug", 139 "-debugexclude=libevent", 140 "-debugexclude=leveldb", 141 }, 142 opts.extra_args); 143 if (G_TEST_COMMAND_LINE_ARGUMENTS) { 144 arguments = Cat(arguments, G_TEST_COMMAND_LINE_ARGUMENTS()); 145 } 146 util::ThreadRename("test"); 147 gArgs.ClearPathCache(); 148 { 149 SetupServerArgs(*m_node.args); 150 SetupCommonTestArgs(*m_node.args); 151 std::string error; 152 if (!m_node.args->ParseParameters(arguments.size(), arguments.data(), error)) { 153 m_node.args->ClearArgs(); 154 throw std::runtime_error{error}; 155 } 156 } 157 158 const std::string test_name{G_TEST_GET_FULL_NAME ? G_TEST_GET_FULL_NAME() : ""}; 159 if (!m_node.args->IsArgSet("-testdatadir")) { 160 // To avoid colliding with a leftover prior datadir, and to allow 161 // tests, such as the fuzz tests to run in several processes at the 162 // same time, add a random element to the path. Keep it small enough to 163 // avoid a MAX_PATH violation on Windows. 164 // 165 // When fuzzing with AFL++, use the shared memory ID for a deterministic 166 // path. This allows for cleanup of leftover directories from timed-out 167 // or crashed iterations, preventing accumulation of stale datadirs. 168 if (const char* shm_id = std::getenv("__AFL_SHM_ID"); shm_id && *shm_id) { 169 m_path_root = fs::temp_directory_path() / TEST_DIR_PATH_ELEMENT / test_name / shm_id; 170 fs::remove_all(m_path_root); 171 } else { 172 const auto rand{HexStr(g_rng_temp_path.randbytes(10))}; 173 m_path_root = fs::temp_directory_path() / TEST_DIR_PATH_ELEMENT / test_name / rand; 174 } 175 TryCreateDirectories(m_path_root); 176 } else { 177 // Custom data directory 178 m_has_custom_datadir = true; 179 fs::path root_dir{m_node.args->GetPathArg("-testdatadir")}; 180 if (root_dir.empty()) ExitFailure("-testdatadir argument is empty, please specify a path"); 181 182 root_dir = fs::absolute(root_dir); 183 m_path_lock = root_dir / TEST_DIR_PATH_ELEMENT / fs::PathFromString(test_name); 184 m_path_root = m_path_lock / "datadir"; 185 186 // Try to obtain the lock; if unsuccessful don't disturb the existing test. 187 TryCreateDirectories(m_path_lock); 188 if (util::LockDirectory(m_path_lock, ".lock", /*probe_only=*/false) != util::LockResult::Success) { 189 ExitFailure("Cannot obtain a lock on test data lock directory " + fs::PathToString(m_path_lock) + '\n' + "The test executable is probably already running."); 190 } 191 192 // Always start with a fresh data directory; this doesn't delete the .lock file located one level above. 193 fs::remove_all(m_path_root); 194 if (!TryCreateDirectories(m_path_root)) ExitFailure("Cannot create test data directory"); 195 196 // Print the test directory name if custom. 197 std::cout << "Test directory (will not be deleted): " << m_path_root << std::endl; 198 } 199 m_args.ForceSetArg("-datadir", fs::PathToString(m_path_root)); 200 gArgs.ForceSetArg("-datadir", fs::PathToString(m_path_root)); 201 202 SelectParams(chainType); 203 InitLogging(*m_node.args); 204 AppInitParameterInteraction(*m_node.args); 205 LogInstance().StartLogging(); 206 m_node.warnings = std::make_unique<node::Warnings>(); 207 m_node.kernel = std::make_unique<kernel::Context>(); 208 m_node.ecc_context = std::make_unique<ECC_Context>(); 209 SetupEnvironment(); 210 211 m_node.chain = interfaces::MakeChain(m_node); 212 static bool noui_connected = false; 213 if (!noui_connected) { 214 noui_connect(); 215 noui_connected = true; 216 } 217 } 218 219 BasicTestingSetup::~BasicTestingSetup() 220 { 221 m_node.ecc_context.reset(); 222 m_node.kernel.reset(); 223 if (!EnableFuzzDeterminism()) { 224 SetMockTime(0s); // Reset mocktime for following tests 225 } 226 LogInstance().DisconnectTestLogger(); 227 if (m_has_custom_datadir) { 228 // Only remove the lock file, preserve the data directory. 229 UnlockDirectory(m_path_lock, ".lock"); 230 fs::remove(m_path_lock / ".lock"); 231 } else { 232 fs::remove_all(m_path_root); 233 } 234 // Clear all arguments except for -datadir, which GUI tests currently rely 235 // on to be set even after the testing setup is destroyed. 236 gArgs.ClearArgs(); 237 gArgs.ForceSetArg("-datadir", fs::PathToString(m_path_root)); 238 } 239 240 ChainTestingSetup::ChainTestingSetup(const ChainType chainType, TestOpts opts) 241 : BasicTestingSetup(chainType, opts) 242 { 243 const CChainParams& chainparams = Params(); 244 245 // A task runner is required to prevent ActivateBestChain 246 // from blocking due to queue overrun. 247 if (opts.setup_validation_interface) { 248 m_node.scheduler = std::make_unique<CScheduler>(); 249 m_node.scheduler->m_service_thread = std::thread(util::TraceThread, "scheduler", [&] { m_node.scheduler->serviceQueue(); }); 250 m_node.validation_signals = 251 // Use synchronous task runner while fuzzing to avoid non-determinism 252 EnableFuzzDeterminism() ? 253 std::make_unique<ValidationSignals>(std::make_unique<util::ImmediateTaskRunner>()) : 254 std::make_unique<ValidationSignals>(std::make_unique<SerialTaskRunner>(*m_node.scheduler)); 255 { 256 // Ensure deterministic coverage by waiting for m_service_thread to be running 257 std::promise<void> promise; 258 m_node.scheduler->scheduleFromNow([&promise] { promise.set_value(); }, 0ms); 259 promise.get_future().wait(); 260 } 261 } 262 263 bilingual_str error{}; 264 m_node.mempool = std::make_unique<CTxMemPool>(MemPoolOptionsForTest(m_node), error); 265 Assert(error.empty()); 266 m_node.warnings = std::make_unique<node::Warnings>(); 267 268 m_node.notifications = std::make_unique<KernelNotifications>(Assert(m_node.shutdown_request), m_node.exit_status, *Assert(m_node.warnings)); 269 270 m_make_chainman = [this, &chainparams, opts] { 271 Assert(!m_node.chainman); 272 ChainstateManager::Options chainman_opts{ 273 .chainparams = chainparams, 274 .datadir = m_args.GetDataDirNet(), 275 .check_block_index = 1, 276 .notifications = *m_node.notifications, 277 .signals = m_node.validation_signals.get(), 278 // Use no worker threads while fuzzing to avoid non-determinism 279 .worker_threads_num = EnableFuzzDeterminism() ? 0 : 2, 280 }; 281 if (opts.min_validation_cache) { 282 chainman_opts.script_execution_cache_bytes = 0; 283 chainman_opts.signature_cache_bytes = 0; 284 } 285 const BlockManager::Options blockman_opts{ 286 .chainparams = chainman_opts.chainparams, 287 .blocks_dir = m_args.GetBlocksDirPath(), 288 .notifications = chainman_opts.notifications, 289 .block_tree_db_params = DBParams{ 290 .path = m_args.GetDataDirNet() / "blocks" / "index", 291 .cache_bytes = m_kernel_cache_sizes.block_tree_db, 292 .memory_only = opts.block_tree_db_in_memory, 293 .wipe_data = m_args.GetBoolArg("-reindex", false), 294 }, 295 }; 296 m_node.chainman = std::make_unique<ChainstateManager>(*Assert(m_node.shutdown_signal), chainman_opts, blockman_opts); 297 }; 298 m_make_chainman(); 299 } 300 301 ChainTestingSetup::~ChainTestingSetup() 302 { 303 if (m_node.scheduler) m_node.scheduler->stop(); 304 if (m_node.validation_signals) m_node.validation_signals->FlushBackgroundCallbacks(); 305 m_node.connman.reset(); 306 m_node.banman.reset(); 307 m_node.addrman.reset(); 308 m_node.netgroupman.reset(); 309 m_node.args = nullptr; 310 m_node.mempool.reset(); 311 Assert(!m_node.fee_estimator); // Each test must create a local object, if they wish to use the fee_estimator 312 m_node.chainman.reset(); 313 m_node.validation_signals.reset(); 314 m_node.scheduler.reset(); 315 } 316 317 void ChainTestingSetup::LoadVerifyActivateChainstate() 318 { 319 auto& chainman{*Assert(m_node.chainman)}; 320 node::ChainstateLoadOptions options; 321 options.mempool = Assert(m_node.mempool.get()); 322 options.coins_db_in_memory = m_coins_db_in_memory; 323 options.wipe_chainstate_db = m_args.GetBoolArg("-reindex", false) || m_args.GetBoolArg("-reindex-chainstate", false); 324 options.prune = chainman.m_blockman.IsPruneMode(); 325 options.check_blocks = m_args.GetIntArg("-checkblocks", DEFAULT_CHECKBLOCKS); 326 options.check_level = m_args.GetIntArg("-checklevel", DEFAULT_CHECKLEVEL); 327 options.require_full_verification = m_args.IsArgSet("-checkblocks") || m_args.IsArgSet("-checklevel"); 328 auto [status, error] = LoadChainstate(chainman, m_kernel_cache_sizes, options); 329 assert(status == node::ChainstateLoadStatus::SUCCESS); 330 331 std::tie(status, error) = VerifyLoadedChainstate(chainman, options); 332 assert(status == node::ChainstateLoadStatus::SUCCESS); 333 334 BlockValidationState state; 335 if (!chainman.ActiveChainstate().ActivateBestChain(state)) { 336 throw std::runtime_error(strprintf("ActivateBestChain failed. (%s)", state.ToString())); 337 } 338 } 339 340 TestingSetup::TestingSetup( 341 const ChainType chainType, 342 TestOpts opts) 343 : ChainTestingSetup(chainType, opts) 344 { 345 m_coins_db_in_memory = opts.coins_db_in_memory; 346 m_block_tree_db_in_memory = opts.block_tree_db_in_memory; 347 // Ideally we'd move all the RPC tests to the functional testing framework 348 // instead of unit tests, but for now we need these here. 349 RegisterAllCoreRPCCommands(tableRPC); 350 351 LoadVerifyActivateChainstate(); 352 353 if (!opts.setup_net) return; 354 355 m_node.netgroupman = std::make_unique<NetGroupManager>(NetGroupManager::NoAsmap()); 356 m_node.addrman = std::make_unique<AddrMan>(*m_node.netgroupman, 357 /*deterministic=*/false, 358 m_node.args->GetIntArg("-checkaddrman", 0)); 359 m_node.banman = std::make_unique<BanMan>(m_args.GetDataDirBase() / "banlist", nullptr, DEFAULT_MISBEHAVING_BANTIME); 360 m_node.connman = std::make_unique<ConnmanTestMsg>(0x1337, 0x1337, *m_node.addrman, *m_node.netgroupman, Params()); // Deterministic randomness for tests. 361 PeerManager::Options peerman_opts; 362 ApplyArgsManOptions(*m_node.args, peerman_opts); 363 peerman_opts.deterministic_rng = true; 364 m_node.peerman = PeerManager::make(*m_node.connman, *m_node.addrman, 365 m_node.banman.get(), *m_node.chainman, 366 *m_node.mempool, *m_node.warnings, 367 peerman_opts); 368 369 { 370 CConnman::Options options; 371 options.m_msgproc = m_node.peerman.get(); 372 m_node.connman->Init(options); 373 } 374 } 375 376 TestChain100Setup::TestChain100Setup( 377 const ChainType chain_type, 378 TestOpts opts) 379 : TestingSetup{ChainType::REGTEST, opts} 380 { 381 SetMockTime(1598887952); 382 constexpr std::array<unsigned char, 32> vchKey = { 383 {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1}}; 384 coinbaseKey.Set(vchKey.begin(), vchKey.end(), true); 385 386 // Generate a 100-block chain: 387 this->mineBlocks(COINBASE_MATURITY); 388 389 { 390 LOCK(::cs_main); 391 assert( 392 m_node.chainman->ActiveChain().Tip()->GetBlockHash().ToString() == 393 "0c8c5f79505775a0f6aed6aca2350718ceb9c6f2c878667864d5c7a6d8ffa2a6"); 394 } 395 } 396 397 void TestChain100Setup::mineBlocks(int num_blocks) 398 { 399 CScript scriptPubKey = CScript() << ToByteVector(coinbaseKey.GetPubKey()) << OP_CHECKSIG; 400 for (int i = 0; i < num_blocks; i++) { 401 std::vector<CMutableTransaction> noTxns; 402 CBlock b = CreateAndProcessBlock(noTxns, scriptPubKey); 403 SetMockTime(GetTime() + 1); 404 m_coinbase_txns.push_back(b.vtx[0]); 405 } 406 } 407 408 CBlock TestChain100Setup::CreateBlock( 409 const std::vector<CMutableTransaction>& txns, 410 const CScript& scriptPubKey, 411 Chainstate& chainstate) 412 { 413 BlockAssembler::Options options; 414 options.coinbase_output_script = scriptPubKey; 415 options.include_dummy_extranonce = true; 416 CBlock block = BlockAssembler{chainstate, nullptr, options}.CreateNewBlock()->block; 417 418 Assert(block.vtx.size() == 1); 419 for (const CMutableTransaction& tx : txns) { 420 block.vtx.push_back(MakeTransactionRef(tx)); 421 } 422 RegenerateCommitments(block, *Assert(m_node.chainman)); 423 424 while (!CheckProofOfWork(block.GetHash(), block.nBits, m_node.chainman->GetConsensus())) ++block.nNonce; 425 426 return block; 427 } 428 429 CBlock TestChain100Setup::CreateAndProcessBlock( 430 const std::vector<CMutableTransaction>& txns, 431 const CScript& scriptPubKey, 432 Chainstate* chainstate) 433 { 434 if (!chainstate) { 435 chainstate = &Assert(m_node.chainman)->ActiveChainstate(); 436 } 437 438 CBlock block = this->CreateBlock(txns, scriptPubKey, *chainstate); 439 std::shared_ptr<const CBlock> shared_pblock = std::make_shared<const CBlock>(block); 440 Assert(m_node.chainman)->ProcessNewBlock(shared_pblock, true, true, nullptr); 441 442 return block; 443 } 444 445 std::pair<CMutableTransaction, CAmount> TestChain100Setup::CreateValidTransaction(const std::vector<CTransactionRef>& input_transactions, 446 const std::vector<COutPoint>& inputs, 447 int input_height, 448 const std::vector<CKey>& input_signing_keys, 449 const std::vector<CTxOut>& outputs, 450 const std::optional<CFeeRate>& feerate, 451 const std::optional<uint32_t>& fee_output) 452 { 453 CMutableTransaction mempool_txn; 454 mempool_txn.vin.reserve(inputs.size()); 455 mempool_txn.vout.reserve(outputs.size()); 456 457 for (const auto& outpoint : inputs) { 458 mempool_txn.vin.emplace_back(outpoint, CScript(), MAX_BIP125_RBF_SEQUENCE); 459 } 460 mempool_txn.vout = outputs; 461 462 // - Add the signing key to a keystore 463 FillableSigningProvider keystore; 464 for (const auto& input_signing_key : input_signing_keys) { 465 keystore.AddKey(input_signing_key); 466 } 467 // - Populate a CoinsViewCache with the unspent output 468 CCoinsViewCache coins_cache{&CoinsViewEmpty::Get()}; 469 for (const auto& input_transaction : input_transactions) { 470 AddCoins(coins_cache, *input_transaction.get(), input_height); 471 } 472 // Build Outpoint to Coin map for SignTransaction 473 std::map<COutPoint, Coin> input_coins; 474 CAmount inputs_amount{0}; 475 for (const auto& outpoint_to_spend : inputs) { 476 // Use GetCoin to properly populate utxo_to_spend 477 auto utxo_to_spend{coins_cache.GetCoin(outpoint_to_spend).value()}; 478 input_coins.insert({outpoint_to_spend, utxo_to_spend}); 479 inputs_amount += utxo_to_spend.out.nValue; 480 } 481 // - Default signature hashing type 482 int nHashType = SIGHASH_ALL; 483 std::map<int, bilingual_str> input_errors; 484 assert(SignTransaction(mempool_txn, &keystore, input_coins, {.sighash_type = nHashType}, input_errors)); 485 CAmount current_fee = inputs_amount - std::accumulate(outputs.begin(), outputs.end(), CAmount(0), 486 [](const CAmount& acc, const CTxOut& out) { 487 return acc + out.nValue; 488 }); 489 // Deduct fees from fee_output to meet feerate if set 490 if (feerate.has_value()) { 491 assert(fee_output.has_value()); 492 assert(fee_output.value() < mempool_txn.vout.size()); 493 CAmount target_fee = feerate.value().GetFee(GetVirtualTransactionSize(CTransaction{mempool_txn})); 494 CAmount deduction = target_fee - current_fee; 495 if (deduction > 0) { 496 // Only deduct fee if there's anything to deduct. If the caller has put more fees than 497 // the target feerate, don't change the fee. 498 mempool_txn.vout[fee_output.value()].nValue -= deduction; 499 // Re-sign since an output has changed 500 input_errors.clear(); 501 assert(SignTransaction(mempool_txn, &keystore, input_coins, {.sighash_type = nHashType}, input_errors)); 502 current_fee = target_fee; 503 } 504 } 505 return {mempool_txn, current_fee}; 506 } 507 508 CMutableTransaction TestChain100Setup::CreateValidMempoolTransaction(const std::vector<CTransactionRef>& input_transactions, 509 const std::vector<COutPoint>& inputs, 510 int input_height, 511 const std::vector<CKey>& input_signing_keys, 512 const std::vector<CTxOut>& outputs, 513 bool submit) 514 { 515 CMutableTransaction mempool_txn = CreateValidTransaction(input_transactions, inputs, input_height, input_signing_keys, outputs, std::nullopt, std::nullopt).first; 516 // If submit=true, add transaction to the mempool. 517 if (submit) { 518 LOCK(cs_main); 519 const MempoolAcceptResult result = m_node.chainman->ProcessTransaction(MakeTransactionRef(mempool_txn)); 520 assert(result.m_result_type == MempoolAcceptResult::ResultType::VALID); 521 } 522 return mempool_txn; 523 } 524 525 CMutableTransaction TestChain100Setup::CreateValidMempoolTransaction(CTransactionRef input_transaction, 526 uint32_t input_vout, 527 int input_height, 528 CKey input_signing_key, 529 CScript output_destination, 530 CAmount output_amount, 531 bool submit) 532 { 533 COutPoint input{input_transaction->GetHash(), input_vout}; 534 CTxOut output{output_amount, output_destination}; 535 return CreateValidMempoolTransaction(/*input_transactions=*/{input_transaction}, 536 /*inputs=*/{input}, 537 /*input_height=*/input_height, 538 /*input_signing_keys=*/{input_signing_key}, 539 /*outputs=*/{output}, 540 /*submit=*/submit); 541 } 542 543 std::vector<CTransactionRef> TestChain100Setup::PopulateMempool(FastRandomContext& det_rand, size_t num_transactions, bool submit) 544 { 545 std::vector<CTransactionRef> mempool_transactions; 546 std::deque<std::pair<COutPoint, CAmount>> unspent_prevouts, undo_info; 547 std::transform(m_coinbase_txns.begin(), m_coinbase_txns.end(), std::back_inserter(unspent_prevouts), 548 [](const auto& tx){ return std::make_pair(COutPoint(tx->GetHash(), 0), tx->vout[0].nValue); }); 549 while (num_transactions > 0 && !unspent_prevouts.empty()) { 550 // The number of inputs and outputs are randomly chosen, between 1-5 551 // and 1-25 respectively. 552 CMutableTransaction mtx = CMutableTransaction(); 553 const size_t num_inputs = det_rand.randrange(5) + 1; 554 CAmount total_in{0}; 555 for (size_t n{0}; n < num_inputs; ++n) { 556 if (unspent_prevouts.empty()) break; 557 const auto& [prevout, amount] = unspent_prevouts.front(); 558 undo_info.emplace_back(prevout, amount); 559 mtx.vin.emplace_back(prevout, CScript()); 560 total_in += amount; 561 unspent_prevouts.pop_front(); 562 } 563 const size_t num_outputs = det_rand.randrange(25) + 1; 564 const CAmount fee = 100 * det_rand.randrange(30); 565 const CAmount amount_per_output = (total_in - fee) / num_outputs; 566 for (size_t n{0}; n < num_outputs; ++n) { 567 CScript spk = CScript() << CScriptNum(num_transactions + n); 568 mtx.vout.emplace_back(amount_per_output, spk); 569 } 570 CTransactionRef ptx = MakeTransactionRef(mtx); 571 bool success{true}; 572 if (submit) { 573 LOCK2(cs_main, m_node.mempool->cs); 574 LockPoints lp; 575 auto changeset = m_node.mempool->GetChangeSet(); 576 changeset->StageAddition(ptx, /*fee=*/(total_in - num_outputs * amount_per_output), 577 /*time=*/0, /*entry_height=*/1, /*entry_sequence=*/0, 578 /*spends_coinbase=*/false, /*sigops_cost=*/4, lp); 579 if (changeset->CheckMemPoolPolicyLimits()) { 580 changeset->Apply(); 581 --num_transactions; 582 } else { 583 success = false; 584 // Add the inputs back to unspent prevouts 585 for (const auto& [prevout, amount] : undo_info) { 586 unspent_prevouts.emplace_back(prevout, amount); 587 std::swap(unspent_prevouts.back(), unspent_prevouts[det_rand.randrange(unspent_prevouts.size())]); 588 } 589 } 590 } 591 if (success) { 592 mempool_transactions.push_back(ptx); 593 if (amount_per_output > 3000) { 594 // If the value is high enough to fund another transaction + fees, keep track of it so 595 // it can be used to build a more complex transaction graph. Insert randomly into 596 // unspent_prevouts for extra randomness in the resulting structures. 597 for (size_t n{0}; n < num_outputs; ++n) { 598 unspent_prevouts.emplace_back(COutPoint(ptx->GetHash(), n), amount_per_output); 599 std::swap(unspent_prevouts.back(), unspent_prevouts[det_rand.randrange(unspent_prevouts.size())]); 600 } 601 } 602 } 603 undo_info.clear(); 604 } 605 return mempool_transactions; 606 } 607 608 /** 609 * @returns a real block (0000000000013b8ab2cd513b0261a14096412195a72a0c4827d229dcc7e0f7af) 610 * with 9 txs. 611 */ 612 CBlock getBlock13b8a() 613 { 614 CBlock block; 615 DataStream stream{ 616 "0100000090f0a9f110702f808219ebea1173056042a714bad51b916cb6800000000000005275289558f51c9966699404ae2294730c3c9f9bda53523ce50e9b95e558da2fdb261b4d4c86041b1ab1bf930901000000010000000000000000000000000000000000000000000000000000000000000000ffffffff07044c86041b0146ffffffff0100f2052a01000000434104e18f7afbe4721580e81e8414fc8c24d7cfacf254bb5c7b949450c3e997c2dc1242487a8169507b631eb3771f2b425483fb13102c4eb5d858eef260fe70fbfae0ac00000000010000000196608ccbafa16abada902780da4dc35dafd7af05fa0da08cf833575f8cf9e836000000004a493046022100dab24889213caf43ae6adc41cf1c9396c08240c199f5225acf45416330fd7dbd022100fe37900e0644bf574493a07fc5edba06dbc07c311b947520c2d514bc5725dcb401ffffffff0100f2052a010000001976a914f15d1921f52e4007b146dfa60f369ed2fc393ce288ac000000000100000001fb766c1288458c2bafcfec81e48b24d98ec706de6b8af7c4e3c29419bfacb56d000000008c493046022100f268ba165ce0ad2e6d93f089cfcd3785de5c963bb5ea6b8c1b23f1ce3e517b9f022100da7c0f21adc6c401887f2bfd1922f11d76159cbc597fbd756a23dcbb00f4d7290141042b4e8625a96127826915a5b109852636ad0da753c9e1d5606a50480cd0c40f1f8b8d898235e571fe9357d9ec842bc4bba1827daaf4de06d71844d0057707966affffffff0280969800000000001976a9146963907531db72d0ed1a0cfb471ccb63923446f388ac80d6e34c000000001976a914f0688ba1c0d1ce182c7af6741e02658c7d4dfcd388ac000000000100000002c40297f730dd7b5a99567eb8d27b78758f607507c52292d02d4031895b52f2ff010000008b483045022100f7edfd4b0aac404e5bab4fd3889e0c6c41aa8d0e6fa122316f68eddd0a65013902205b09cc8b2d56e1cd1f7f2fafd60a129ed94504c4ac7bdc67b56fe67512658b3e014104732012cb962afa90d31b25d8fb0e32c94e513ab7a17805c14ca4c3423e18b4fb5d0e676841733cb83abaf975845c9f6f2a8097b7d04f4908b18368d6fc2d68ecffffffffca5065ff9617cbcba45eb23726df6498a9b9cafed4f54cbab9d227b0035ddefb000000008a473044022068010362a13c7f9919fa832b2dee4e788f61f6f5d344a7c2a0da6ae740605658022006d1af525b9a14a35c003b78b72bd59738cd676f845d1ff3fc25049e01003614014104732012cb962afa90d31b25d8fb0e32c94e513ab7a17805c14ca4c3423e18b4fb5d0e676841733cb83abaf975845c9f6f2a8097b7d04f4908b18368d6fc2d68ecffffffff01001ec4110200000043410469ab4181eceb28985b9b4e895c13fa5e68d85761b7eee311db5addef76fa8621865134a221bd01f28ec9999ee3e021e60766e9d1f3458c115fb28650605f11c9ac000000000100000001cdaf2f758e91c514655e2dc50633d1e4c84989f8aa90a0dbc883f0d23ed5c2fa010000008b48304502207ab51be6f12a1962ba0aaaf24a20e0b69b27a94fac5adf45aa7d2d18ffd9236102210086ae728b370e5329eead9accd880d0cb070aea0c96255fae6c4f1ddcce1fd56e014104462e76fd4067b3a0aa42070082dcb0bf2f388b6495cf33d789904f07d0f55c40fbd4b82963c69b3dc31895d0c772c812b1d5fbcade15312ef1c0e8ebbb12dcd4ffffffff02404b4c00000000001976a9142b6ba7c9d796b75eef7942fc9288edd37c32f5c388ac002d3101000000001976a9141befba0cdc1ad56529371864d9f6cb042faa06b588ac000000000100000001b4a47603e71b61bc3326efd90111bf02d2f549b067f4c4a8fa183b57a0f800cb010000008a4730440220177c37f9a505c3f1a1f0ce2da777c339bd8339ffa02c7cb41f0a5804f473c9230220585b25a2ee80eb59292e52b987dad92acb0c64eced92ed9ee105ad153cdb12d001410443bd44f683467e549dae7d20d1d79cbdb6df985c6e9c029c8d0c6cb46cc1a4d3cf7923c5021b27f7a0b562ada113bc85d5fda5a1b41e87fe6e8802817cf69996ffffffff0280651406000000001976a9145505614859643ab7b547cd7f1f5e7e2a12322d3788ac00aa0271000000001976a914ea4720a7a52fc166c55ff2298e07baf70ae67e1b88ac00000000010000000586c62cd602d219bb60edb14a3e204de0705176f9022fe49a538054fb14abb49e010000008c493046022100f2bc2aba2534becbdf062eb993853a42bbbc282083d0daf9b4b585bd401aa8c9022100b1d7fd7ee0b95600db8535bbf331b19eed8d961f7a8e54159c53675d5f69df8c014104462e76fd4067b3a0aa42070082dcb0bf2f388b6495cf33d789904f07d0f55c40fbd4b82963c69b3dc31895d0c772c812b1d5fbcade15312ef1c0e8ebbb12dcd4ffffffff03ad0e58ccdac3df9dc28a218bcf6f1997b0a93306faaa4b3a28ae83447b2179010000008b483045022100be12b2937179da88599e27bb31c3525097a07cdb52422d165b3ca2f2020ffcf702200971b51f853a53d644ebae9ec8f3512e442b1bcb6c315a5b491d119d10624c83014104462e76fd4067b3a0aa42070082dcb0bf2f388b6495cf33d789904f07d0f55c40fbd4b82963c69b3dc31895d0c772c812b1d5fbcade15312ef1c0e8ebbb12dcd4ffffffff2acfcab629bbc8685792603762c921580030ba144af553d271716a95089e107b010000008b483045022100fa579a840ac258871365dd48cd7552f96c8eea69bd00d84f05b283a0dab311e102207e3c0ee9234814cfbb1b659b83671618f45abc1326b9edcc77d552a4f2a805c0014104462e76fd4067b3a0aa42070082dcb0bf2f388b6495cf33d789904f07d0f55c40fbd4b82963c69b3dc31895d0c772c812b1d5fbcade15312ef1c0e8ebbb12dcd4ffffffffdcdc6023bbc9944a658ddc588e61eacb737ddf0a3cd24f113b5a8634c517fcd2000000008b4830450221008d6df731df5d32267954bd7d2dda2302b74c6c2a6aa5c0ca64ecbabc1af03c75022010e55c571d65da7701ae2da1956c442df81bbf076cdbac25133f99d98a9ed34c014104462e76fd4067b3a0aa42070082dcb0bf2f388b6495cf33d789904f07d0f55c40fbd4b82963c69b3dc31895d0c772c812b1d5fbcade15312ef1c0e8ebbb12dcd4ffffffffe15557cd5ce258f479dfd6dc6514edf6d7ed5b21fcfa4a038fd69f06b83ac76e010000008b483045022023b3e0ab071eb11de2eb1cc3a67261b866f86bf6867d4558165f7c8c8aca2d86022100dc6e1f53a91de3efe8f63512850811f26284b62f850c70ca73ed5de8771fb451014104462e76fd4067b3a0aa42070082dcb0bf2f388b6495cf33d789904f07d0f55c40fbd4b82963c69b3dc31895d0c772c812b1d5fbcade15312ef1c0e8ebbb12dcd4ffffffff01404b4c00000000001976a9142b6ba7c9d796b75eef7942fc9288edd37c32f5c388ac00000000010000000166d7577163c932b4f9690ca6a80b6e4eb001f0a2fa9023df5595602aae96ed8d000000008a4730440220262b42546302dfb654a229cefc86432b89628ff259dc87edd1154535b16a67e102207b4634c020a97c3e7bbd0d4d19da6aa2269ad9dded4026e896b213d73ca4b63f014104979b82d02226b3a4597523845754d44f13639e3bf2df5e82c6aab2bdc79687368b01b1ab8b19875ae3c90d661a3d0a33161dab29934edeb36aa01976be3baf8affffffff02404b4c00000000001976a9144854e695a02af0aeacb823ccbc272134561e0a1688ac40420f00000000001976a914abee93376d6b37b5c2940655a6fcaf1c8e74237988ac0000000001000000014e3f8ef2e91349a9059cb4f01e54ab2597c1387161d3da89919f7ea6acdbb371010000008c49304602210081f3183471a5ca22307c0800226f3ef9c353069e0773ac76bb580654d56aa523022100d4c56465bdc069060846f4fbf2f6b20520b2a80b08b168b31e66ddb9c694e240014104976c79848e18251612f8940875b2b08d06e6dc73b9840e8860c066b7e87432c477e9a59a453e71e6d76d5fe34058b800a098fc1740ce3012e8fc8a00c96af966ffffffff02c0e1e400000000001976a9144134e75a6fcb6042034aab5e18570cf1f844f54788ac404b4c00000000001976a9142b6ba7c9d796b75eef7942fc9288edd37c32f5c388ac00000000"_hex, 617 }; 618 stream >> TX_WITH_WITNESS(block); 619 return block; 620 }