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