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