Bitcoin Core 29.99.0
P2P Digital Currency
setup_common.cpp
Go to the documentation of this file.
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
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>
14#include <crypto/sha256.h>
15#include <init.h>
16#include <init/common.h>
17#include <interfaces/chain.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>
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.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/txmempool.h>
44#include <txdb.h>
45#include <txmempool.h>
46#include <util/chaintype.h>
47#include <util/check.h>
48#include <util/fs_helpers.h>
49#include <util/rbf.h>
50#include <util/strencodings.h>
51#include <util/string.h>
52#include <util/task_runner.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 <future>
64#include <functional>
65#include <stdexcept>
66
67using namespace util::hex_literals;
75
77
78constexpr inline auto TEST_DIR_PATH_ELEMENT{"test_common bitcoin"}; // Includes a space to catch possible path escape issues.
81static const bool g_rng_temp_path_init{[] {
82 // Must be initialized before any SeedRandomForTest
84 (void)g_rng_temp_path.rand64();
85 g_used_g_prng = false;
86 ResetCoverageCounters(); // The seed strengthen in SeedStartup is not deterministic, so exclude it from coverage counts
87 return true;
88}()};
89
91{
93 {
95 }
96};
98
100{
101 argsman.AddArg("-testdatadir", strprintf("Custom data directory (default: %s<random_string>)", fs::PathToString(fs::temp_directory_path() / TEST_DIR_PATH_ELEMENT / "")),
103}
104
106static void ExitFailure(std::string_view str_err)
107{
108 std::cerr << str_err << std::endl;
109 exit(EXIT_FAILURE);
110}
111
113 : m_args{}
114{
115 if constexpr (!G_FUZZING) {
117 }
119 m_node.shutdown_request = [this]{ return m_interrupt(); };
120 m_node.args = &gArgs;
121 std::vector<const char*> arguments = Cat(
122 {
123 "dummy",
124 "-printtoconsole=0",
125 "-logsourcelocations",
126 "-logtimemicros",
127 "-logthreadnames",
128 "-loglevel=trace",
129 "-debug",
130 "-debugexclude=libevent",
131 "-debugexclude=leveldb",
132 },
133 opts.extra_args);
135 arguments = Cat(arguments, G_TEST_COMMAND_LINE_ARGUMENTS());
136 }
137 util::ThreadRename("test");
139 {
142 std::string error;
143 if (!m_node.args->ParseParameters(arguments.size(), arguments.data(), error)) {
145 throw std::runtime_error{error};
146 }
147 }
148
149 const std::string test_name{G_TEST_GET_FULL_NAME ? G_TEST_GET_FULL_NAME() : ""};
150 if (!m_node.args->IsArgSet("-testdatadir")) {
151 // To avoid colliding with a leftover prior datadir, and to allow
152 // tests, such as the fuzz tests to run in several processes at the
153 // same time, add a random element to the path. Keep it small enough to
154 // avoid a MAX_PATH violation on Windows.
155 const auto rand{HexStr(g_rng_temp_path.randbytes(10))};
156 m_path_root = fs::temp_directory_path() / TEST_DIR_PATH_ELEMENT / test_name / rand;
158 } else {
159 // Custom data directory
161 fs::path root_dir{m_node.args->GetPathArg("-testdatadir")};
162 if (root_dir.empty()) ExitFailure("-testdatadir argument is empty, please specify a path");
163
164 root_dir = fs::absolute(root_dir);
165 m_path_lock = root_dir / TEST_DIR_PATH_ELEMENT / fs::PathFromString(test_name);
166 m_path_root = m_path_lock / "datadir";
167
168 // Try to obtain the lock; if unsuccessful don't disturb the existing test.
170 if (util::LockDirectory(m_path_lock, ".lock", /*probe_only=*/false) != util::LockResult::Success) {
171 ExitFailure("Cannot obtain a lock on test data lock directory " + fs::PathToString(m_path_lock) + '\n' + "The test executable is probably already running.");
172 }
173
174 // Always start with a fresh data directory; this doesn't delete the .lock file located one level above.
175 fs::remove_all(m_path_root);
176 if (!TryCreateDirectories(m_path_root)) ExitFailure("Cannot create test data directory");
177
178 // Print the test directory name if custom.
179 std::cout << "Test directory (will not be deleted): " << m_path_root << std::endl;
180 }
183
184 SelectParams(chainType);
189 m_node.warnings = std::make_unique<node::Warnings>();
190 m_node.kernel = std::make_unique<kernel::Context>();
191 m_node.ecc_context = std::make_unique<ECC_Context>();
193
195 static bool noui_connected = false;
196 if (!noui_connected) {
197 noui_connect();
198 noui_connected = true;
199 }
200}
201
203{
204 m_node.ecc_context.reset();
205 m_node.kernel.reset();
206 if constexpr (!G_FUZZING) {
207 SetMockTime(0s); // Reset mocktime for following tests
208 }
211 // Only remove the lock file, preserve the data directory.
213 fs::remove(m_path_lock / ".lock");
214 } else {
215 fs::remove_all(m_path_root);
216 }
218}
219
221 : BasicTestingSetup(chainType, opts)
222{
223 const CChainParams& chainparams = Params();
224
225 // A task runner is required to prevent ActivateBestChain
226 // from blocking due to queue overrun.
228 m_node.scheduler = std::make_unique<CScheduler>();
229 m_node.scheduler->m_service_thread = std::thread(util::TraceThread, "scheduler", [&] { m_node.scheduler->serviceQueue(); });
231 // Use synchronous task runner while fuzzing to avoid non-determinism
232 G_FUZZING ? std::make_unique<ValidationSignals>(std::make_unique<util::ImmediateTaskRunner>()) :
233 std::make_unique<ValidationSignals>(std::make_unique<SerialTaskRunner>(*m_node.scheduler));
234 {
235 // Ensure deterministic coverage by waiting for m_service_thread to be running
236 std::promise<void> promise;
237 m_node.scheduler->scheduleFromNow([&promise] { promise.set_value(); }, 0ms);
238 promise.get_future().wait();
239 }
240 }
241
242 bilingual_str error{};
243 m_node.mempool = std::make_unique<CTxMemPool>(MemPoolOptionsForTest(m_node), error);
244 Assert(error.empty());
245 m_node.warnings = std::make_unique<node::Warnings>();
246
247 m_node.notifications = std::make_unique<KernelNotifications>(Assert(m_node.shutdown_request), m_node.exit_status, *Assert(m_node.warnings));
248
249 m_make_chainman = [this, &chainparams, opts] {
251 ChainstateManager::Options chainman_opts{
252 .chainparams = chainparams,
253 .datadir = m_args.GetDataDirNet(),
254 .check_block_index = 1,
255 .notifications = *m_node.notifications,
256 .signals = m_node.validation_signals.get(),
257 // Use no worker threads while fuzzing to avoid non-determinism
258 .worker_threads_num = G_FUZZING ? 0 : 2,
259 };
260 if (opts.min_validation_cache) {
261 chainman_opts.script_execution_cache_bytes = 0;
262 chainman_opts.signature_cache_bytes = 0;
263 }
264 const BlockManager::Options blockman_opts{
265 .chainparams = chainman_opts.chainparams,
266 .blocks_dir = m_args.GetBlocksDirPath(),
267 .notifications = chainman_opts.notifications,
268 .block_tree_db_params = DBParams{
269 .path = m_args.GetDataDirNet() / "blocks" / "index",
270 .cache_bytes = m_kernel_cache_sizes.block_tree_db,
271 .memory_only = opts.block_tree_db_in_memory,
272 .wipe_data = m_args.GetBoolArg("-reindex", false),
273 },
274 };
275 m_node.chainman = std::make_unique<ChainstateManager>(*Assert(m_node.shutdown_signal), chainman_opts, blockman_opts);
276 };
278}
279
281{
282 if (m_node.scheduler) m_node.scheduler->stop();
283 if (m_node.validation_signals) m_node.validation_signals->FlushBackgroundCallbacks();
284 m_node.connman.reset();
285 m_node.banman.reset();
286 m_node.addrman.reset();
287 m_node.netgroupman.reset();
288 m_node.args = nullptr;
289 m_node.mempool.reset();
290 Assert(!m_node.fee_estimator); // Each test must create a local object, if they wish to use the fee_estimator
291 m_node.chainman.reset();
293 m_node.scheduler.reset();
294}
295
297{
298 auto& chainman{*Assert(m_node.chainman)};
300 options.mempool = Assert(m_node.mempool.get());
302 options.wipe_chainstate_db = m_args.GetBoolArg("-reindex", false) || m_args.GetBoolArg("-reindex-chainstate", false);
303 options.prune = chainman.m_blockman.IsPruneMode();
304 options.check_blocks = m_args.GetIntArg("-checkblocks", DEFAULT_CHECKBLOCKS);
305 options.check_level = m_args.GetIntArg("-checklevel", DEFAULT_CHECKLEVEL);
306 options.require_full_verification = m_args.IsArgSet("-checkblocks") || m_args.IsArgSet("-checklevel");
307 auto [status, error] = LoadChainstate(chainman, m_kernel_cache_sizes, options);
309
310 std::tie(status, error) = VerifyLoadedChainstate(chainman, options);
312
314 if (!chainman.ActiveChainstate().ActivateBestChain(state)) {
315 throw std::runtime_error(strprintf("ActivateBestChain failed. (%s)", state.ToString()));
316 }
317}
318
320 const ChainType chainType,
321 TestOpts opts)
322 : ChainTestingSetup(chainType, opts)
323{
326 // Ideally we'd move all the RPC tests to the functional testing framework
327 // instead of unit tests, but for now we need these here.
329
331
332 if (!opts.setup_net) return;
333
334 m_node.netgroupman = std::make_unique<NetGroupManager>(/*asmap=*/std::vector<bool>());
335 m_node.addrman = std::make_unique<AddrMan>(*m_node.netgroupman,
336 /*deterministic=*/false,
337 m_node.args->GetIntArg("-checkaddrman", 0));
338 m_node.banman = std::make_unique<BanMan>(m_args.GetDataDirBase() / "banlist", nullptr, DEFAULT_MISBEHAVING_BANTIME);
339 m_node.connman = std::make_unique<ConnmanTestMsg>(0x1337, 0x1337, *m_node.addrman, *m_node.netgroupman, Params()); // Deterministic randomness for tests.
340 PeerManager::Options peerman_opts;
341 ApplyArgsManOptions(*m_node.args, peerman_opts);
342 peerman_opts.deterministic_rng = true;
346 peerman_opts);
347
348 {
349 CConnman::Options options;
350 options.m_msgproc = m_node.peerman.get();
351 m_node.connman->Init(options);
352 }
353}
354
356 const ChainType chain_type,
357 TestOpts opts)
359{
360 SetMockTime(1598887952);
361 constexpr std::array<unsigned char, 32> vchKey = {
362 {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}};
363 coinbaseKey.Set(vchKey.begin(), vchKey.end(), true);
364
365 // Generate a 100-block chain:
367
368 {
370 assert(
371 m_node.chainman->ActiveChain().Tip()->GetBlockHash().ToString() ==
372 "571d80a9967ae599cec0448b0b0ba1cfb606f584d8069bd7166b86854ba7a191");
373 }
374}
375
377{
379 for (int i = 0; i < num_blocks; i++) {
380 std::vector<CMutableTransaction> noTxns;
381 CBlock b = CreateAndProcessBlock(noTxns, scriptPubKey);
382 SetMockTime(GetTime() + 1);
383 m_coinbase_txns.push_back(b.vtx[0]);
384 }
385}
386
388 const std::vector<CMutableTransaction>& txns,
389 const CScript& scriptPubKey,
390 Chainstate& chainstate)
391{
392 BlockAssembler::Options options;
393 options.coinbase_output_script = scriptPubKey;
394 CBlock block = BlockAssembler{chainstate, nullptr, options}.CreateNewBlock()->block;
395
396 Assert(block.vtx.size() == 1);
397 for (const CMutableTransaction& tx : txns) {
398 block.vtx.push_back(MakeTransactionRef(tx));
399 }
401
402 while (!CheckProofOfWork(block.GetHash(), block.nBits, m_node.chainman->GetConsensus())) ++block.nNonce;
403
404 return block;
405}
406
408 const std::vector<CMutableTransaction>& txns,
409 const CScript& scriptPubKey,
410 Chainstate* chainstate)
411{
412 if (!chainstate) {
413 chainstate = &Assert(m_node.chainman)->ActiveChainstate();
414 }
415
416 CBlock block = this->CreateBlock(txns, scriptPubKey, *chainstate);
417 std::shared_ptr<const CBlock> shared_pblock = std::make_shared<const CBlock>(block);
418 Assert(m_node.chainman)->ProcessNewBlock(shared_pblock, true, true, nullptr);
419
420 return block;
421}
422
423std::pair<CMutableTransaction, CAmount> TestChain100Setup::CreateValidTransaction(const std::vector<CTransactionRef>& input_transactions,
424 const std::vector<COutPoint>& inputs,
425 int input_height,
426 const std::vector<CKey>& input_signing_keys,
427 const std::vector<CTxOut>& outputs,
428 const std::optional<CFeeRate>& feerate,
429 const std::optional<uint32_t>& fee_output)
430{
431 CMutableTransaction mempool_txn;
432 mempool_txn.vin.reserve(inputs.size());
433 mempool_txn.vout.reserve(outputs.size());
434
435 for (const auto& outpoint : inputs) {
436 mempool_txn.vin.emplace_back(outpoint, CScript(), MAX_BIP125_RBF_SEQUENCE);
437 }
438 mempool_txn.vout = outputs;
439
440 // - Add the signing key to a keystore
442 for (const auto& input_signing_key : input_signing_keys) {
443 keystore.AddKey(input_signing_key);
444 }
445 // - Populate a CoinsViewCache with the unspent output
446 CCoinsView coins_view;
447 CCoinsViewCache coins_cache(&coins_view);
448 for (const auto& input_transaction : input_transactions) {
449 AddCoins(coins_cache, *input_transaction.get(), input_height);
450 }
451 // Build Outpoint to Coin map for SignTransaction
452 std::map<COutPoint, Coin> input_coins;
453 CAmount inputs_amount{0};
454 for (const auto& outpoint_to_spend : inputs) {
455 // Use GetCoin to properly populate utxo_to_spend
456 auto utxo_to_spend{coins_cache.GetCoin(outpoint_to_spend).value()};
457 input_coins.insert({outpoint_to_spend, utxo_to_spend});
458 inputs_amount += utxo_to_spend.out.nValue;
459 }
460 // - Default signature hashing type
461 int nHashType = SIGHASH_ALL;
462 std::map<int, bilingual_str> input_errors;
463 assert(SignTransaction(mempool_txn, &keystore, input_coins, nHashType, input_errors));
464 CAmount current_fee = inputs_amount - std::accumulate(outputs.begin(), outputs.end(), CAmount(0),
465 [](const CAmount& acc, const CTxOut& out) {
466 return acc + out.nValue;
467 });
468 // Deduct fees from fee_output to meet feerate if set
469 if (feerate.has_value()) {
470 assert(fee_output.has_value());
471 assert(fee_output.value() < mempool_txn.vout.size());
472 CAmount target_fee = feerate.value().GetFee(GetVirtualTransactionSize(CTransaction{mempool_txn}));
473 CAmount deduction = target_fee - current_fee;
474 if (deduction > 0) {
475 // Only deduct fee if there's anything to deduct. If the caller has put more fees than
476 // the target feerate, don't change the fee.
477 mempool_txn.vout[fee_output.value()].nValue -= deduction;
478 // Re-sign since an output has changed
479 input_errors.clear();
480 assert(SignTransaction(mempool_txn, &keystore, input_coins, nHashType, input_errors));
481 current_fee = target_fee;
482 }
483 }
484 return {mempool_txn, current_fee};
485}
486
487CMutableTransaction TestChain100Setup::CreateValidMempoolTransaction(const std::vector<CTransactionRef>& input_transactions,
488 const std::vector<COutPoint>& inputs,
489 int input_height,
490 const std::vector<CKey>& input_signing_keys,
491 const std::vector<CTxOut>& outputs,
492 bool submit)
493{
494 CMutableTransaction mempool_txn = CreateValidTransaction(input_transactions, inputs, input_height, input_signing_keys, outputs, std::nullopt, std::nullopt).first;
495 // If submit=true, add transaction to the mempool.
496 if (submit) {
497 LOCK(cs_main);
498 const MempoolAcceptResult result = m_node.chainman->ProcessTransaction(MakeTransactionRef(mempool_txn));
500 }
501 return mempool_txn;
502}
503
505 uint32_t input_vout,
506 int input_height,
507 CKey input_signing_key,
508 CScript output_destination,
509 CAmount output_amount,
510 bool submit)
511{
512 COutPoint input{input_transaction->GetHash(), input_vout};
513 CTxOut output{output_amount, output_destination};
514 return CreateValidMempoolTransaction(/*input_transactions=*/{input_transaction},
515 /*inputs=*/{input},
516 /*input_height=*/input_height,
517 /*input_signing_keys=*/{input_signing_key},
518 /*outputs=*/{output},
519 /*submit=*/submit);
520}
521
522std::vector<CTransactionRef> TestChain100Setup::PopulateMempool(FastRandomContext& det_rand, size_t num_transactions, bool submit)
523{
524 std::vector<CTransactionRef> mempool_transactions;
525 std::deque<std::pair<COutPoint, CAmount>> unspent_prevouts;
526 std::transform(m_coinbase_txns.begin(), m_coinbase_txns.end(), std::back_inserter(unspent_prevouts),
527 [](const auto& tx){ return std::make_pair(COutPoint(tx->GetHash(), 0), tx->vout[0].nValue); });
528 while (num_transactions > 0 && !unspent_prevouts.empty()) {
529 // The number of inputs and outputs are random, between 1 and 24.
531 const size_t num_inputs = det_rand.randrange(24) + 1;
532 CAmount total_in{0};
533 for (size_t n{0}; n < num_inputs; ++n) {
534 if (unspent_prevouts.empty()) break;
535 const auto& [prevout, amount] = unspent_prevouts.front();
536 mtx.vin.emplace_back(prevout, CScript());
537 total_in += amount;
538 unspent_prevouts.pop_front();
539 }
540 const size_t num_outputs = det_rand.randrange(24) + 1;
541 const CAmount fee = 100 * det_rand.randrange(30);
542 const CAmount amount_per_output = (total_in - fee) / num_outputs;
543 for (size_t n{0}; n < num_outputs; ++n) {
544 CScript spk = CScript() << CScriptNum(num_transactions + n);
545 mtx.vout.emplace_back(amount_per_output, spk);
546 }
548 mempool_transactions.push_back(ptx);
549 if (amount_per_output > 3000) {
550 // If the value is high enough to fund another transaction + fees, keep track of it so
551 // it can be used to build a more complex transaction graph. Insert randomly into
552 // unspent_prevouts for extra randomness in the resulting structures.
553 for (size_t n{0}; n < num_outputs; ++n) {
554 unspent_prevouts.emplace_back(COutPoint(ptx->GetHash(), n), amount_per_output);
555 std::swap(unspent_prevouts.back(), unspent_prevouts[det_rand.randrange(unspent_prevouts.size())]);
556 }
557 }
558 if (submit) {
561 auto changeset = m_node.mempool->GetChangeSet();
562 changeset->StageAddition(ptx, /*fee=*/(total_in - num_outputs * amount_per_output),
563 /*time=*/0, /*entry_height=*/1, /*entry_sequence=*/0,
564 /*spends_coinbase=*/false, /*sigops_cost=*/4, lp);
565 changeset->Apply();
566 }
567 --num_transactions;
568 }
569 return mempool_transactions;
570}
571
573{
575 // Transactions in the mempool will affect the new minimum feerate.
576 assert(m_node.mempool->size() == 0);
577 // The target feerate cannot be too low...
578 // ...otherwise the transaction's feerate will need to be negative.
579 assert(target_feerate > m_node.mempool->m_opts.incremental_relay_feerate);
580 // ...otherwise this is not meaningful. The feerate policy uses the maximum of both feerates.
581 assert(target_feerate > m_node.mempool->m_opts.min_relay_feerate);
582
583 // Manually create an invalid transaction. Manually set the fee in the CTxMemPoolEntry to
584 // achieve the exact target feerate.
586 mtx.vin.emplace_back(COutPoint{Txid::FromUint256(m_rng.rand256()), 0});
588 const auto tx{MakeTransactionRef(mtx)};
590 // The new mempool min feerate is equal to the removed package's feerate + incremental feerate.
591 const auto tx_fee = target_feerate.GetFee(GetVirtualTransactionSize(*tx)) -
592 m_node.mempool->m_opts.incremental_relay_feerate.GetFee(GetVirtualTransactionSize(*tx));
593 {
594 auto changeset = m_node.mempool->GetChangeSet();
595 changeset->StageAddition(tx, /*fee=*/tx_fee,
596 /*time=*/0, /*entry_height=*/1, /*entry_sequence=*/0,
597 /*spends_coinbase=*/true, /*sigops_cost=*/1, lp);
598 changeset->Apply();
599 }
600 m_node.mempool->TrimToSize(0);
601 assert(m_node.mempool->GetMinFee() == target_feerate);
602}
608{
609 CBlock block;
610 DataStream stream{
611 "0100000090f0a9f110702f808219ebea1173056042a714bad51b916cb6800000000000005275289558f51c9966699404ae2294730c3c9f9bda53523ce50e9b95e558da2fdb261b4d4c86041b1ab1bf930901000000010000000000000000000000000000000000000000000000000000000000000000ffffffff07044c86041b0146ffffffff0100f2052a01000000434104e18f7afbe4721580e81e8414fc8c24d7cfacf254bb5c7b949450c3e997c2dc1242487a8169507b631eb3771f2b425483fb13102c4eb5d858eef260fe70fbfae0ac00000000010000000196608ccbafa16abada902780da4dc35dafd7af05fa0da08cf833575f8cf9e836000000004a493046022100dab24889213caf43ae6adc41cf1c9396c08240c199f5225acf45416330fd7dbd022100fe37900e0644bf574493a07fc5edba06dbc07c311b947520c2d514bc5725dcb401ffffffff0100f2052a010000001976a914f15d1921f52e4007b146dfa60f369ed2fc393ce288ac000000000100000001fb766c1288458c2bafcfec81e48b24d98ec706de6b8af7c4e3c29419bfacb56d000000008c493046022100f268ba165ce0ad2e6d93f089cfcd3785de5c963bb5ea6b8c1b23f1ce3e517b9f022100da7c0f21adc6c401887f2bfd1922f11d76159cbc597fbd756a23dcbb00f4d7290141042b4e8625a96127826915a5b109852636ad0da753c9e1d5606a50480cd0c40f1f8b8d898235e571fe9357d9ec842bc4bba1827daaf4de06d71844d0057707966affffffff0280969800000000001976a9146963907531db72d0ed1a0cfb471ccb63923446f388ac80d6e34c000000001976a914f0688ba1c0d1ce182c7af6741e02658c7d4dfcd388ac000000000100000002c40297f730dd7b5a99567eb8d27b78758f607507c52292d02d4031895b52f2ff010000008b483045022100f7edfd4b0aac404e5bab4fd3889e0c6c41aa8d0e6fa122316f68eddd0a65013902205b09cc8b2d56e1cd1f7f2fafd60a129ed94504c4ac7bdc67b56fe67512658b3e014104732012cb962afa90d31b25d8fb0e32c94e513ab7a17805c14ca4c3423e18b4fb5d0e676841733cb83abaf975845c9f6f2a8097b7d04f4908b18368d6fc2d68ecffffffffca5065ff9617cbcba45eb23726df6498a9b9cafed4f54cbab9d227b0035ddefb000000008a473044022068010362a13c7f9919fa832b2dee4e788f61f6f5d344a7c2a0da6ae740605658022006d1af525b9a14a35c003b78b72bd59738cd676f845d1ff3fc25049e01003614014104732012cb962afa90d31b25d8fb0e32c94e513ab7a17805c14ca4c3423e18b4fb5d0e676841733cb83abaf975845c9f6f2a8097b7d04f4908b18368d6fc2d68ecffffffff01001ec4110200000043410469ab4181eceb28985b9b4e895c13fa5e68d85761b7eee311db5addef76fa8621865134a221bd01f28ec9999ee3e021e60766e9d1f3458c115fb28650605f11c9ac000000000100000001cdaf2f758e91c514655e2dc50633d1e4c84989f8aa90a0dbc883f0d23ed5c2fa010000008b48304502207ab51be6f12a1962ba0aaaf24a20e0b69b27a94fac5adf45aa7d2d18ffd9236102210086ae728b370e5329eead9accd880d0cb070aea0c96255fae6c4f1ddcce1fd56e014104462e76fd4067b3a0aa42070082dcb0bf2f388b6495cf33d789904f07d0f55c40fbd4b82963c69b3dc31895d0c772c812b1d5fbcade15312ef1c0e8ebbb12dcd4ffffffff02404b4c00000000001976a9142b6ba7c9d796b75eef7942fc9288edd37c32f5c388ac002d3101000000001976a9141befba0cdc1ad56529371864d9f6cb042faa06b588ac000000000100000001b4a47603e71b61bc3326efd90111bf02d2f549b067f4c4a8fa183b57a0f800cb010000008a4730440220177c37f9a505c3f1a1f0ce2da777c339bd8339ffa02c7cb41f0a5804f473c9230220585b25a2ee80eb59292e52b987dad92acb0c64eced92ed9ee105ad153cdb12d001410443bd44f683467e549dae7d20d1d79cbdb6df985c6e9c029c8d0c6cb46cc1a4d3cf7923c5021b27f7a0b562ada113bc85d5fda5a1b41e87fe6e8802817cf69996ffffffff0280651406000000001976a9145505614859643ab7b547cd7f1f5e7e2a12322d3788ac00aa0271000000001976a914ea4720a7a52fc166c55ff2298e07baf70ae67e1b88ac00000000010000000586c62cd602d219bb60edb14a3e204de0705176f9022fe49a538054fb14abb49e010000008c493046022100f2bc2aba2534becbdf062eb993853a42bbbc282083d0daf9b4b585bd401aa8c9022100b1d7fd7ee0b95600db8535bbf331b19eed8d961f7a8e54159c53675d5f69df8c014104462e76fd4067b3a0aa42070082dcb0bf2f388b6495cf33d789904f07d0f55c40fbd4b82963c69b3dc31895d0c772c812b1d5fbcade15312ef1c0e8ebbb12dcd4ffffffff03ad0e58ccdac3df9dc28a218bcf6f1997b0a93306faaa4b3a28ae83447b2179010000008b483045022100be12b2937179da88599e27bb31c3525097a07cdb52422d165b3ca2f2020ffcf702200971b51f853a53d644ebae9ec8f3512e442b1bcb6c315a5b491d119d10624c83014104462e76fd4067b3a0aa42070082dcb0bf2f388b6495cf33d789904f07d0f55c40fbd4b82963c69b3dc31895d0c772c812b1d5fbcade15312ef1c0e8ebbb12dcd4ffffffff2acfcab629bbc8685792603762c921580030ba144af553d271716a95089e107b010000008b483045022100fa579a840ac258871365dd48cd7552f96c8eea69bd00d84f05b283a0dab311e102207e3c0ee9234814cfbb1b659b83671618f45abc1326b9edcc77d552a4f2a805c0014104462e76fd4067b3a0aa42070082dcb0bf2f388b6495cf33d789904f07d0f55c40fbd4b82963c69b3dc31895d0c772c812b1d5fbcade15312ef1c0e8ebbb12dcd4ffffffffdcdc6023bbc9944a658ddc588e61eacb737ddf0a3cd24f113b5a8634c517fcd2000000008b4830450221008d6df731df5d32267954bd7d2dda2302b74c6c2a6aa5c0ca64ecbabc1af03c75022010e55c571d65da7701ae2da1956c442df81bbf076cdbac25133f99d98a9ed34c014104462e76fd4067b3a0aa42070082dcb0bf2f388b6495cf33d789904f07d0f55c40fbd4b82963c69b3dc31895d0c772c812b1d5fbcade15312ef1c0e8ebbb12dcd4ffffffffe15557cd5ce258f479dfd6dc6514edf6d7ed5b21fcfa4a038fd69f06b83ac76e010000008b483045022023b3e0ab071eb11de2eb1cc3a67261b866f86bf6867d4558165f7c8c8aca2d86022100dc6e1f53a91de3efe8f63512850811f26284b62f850c70ca73ed5de8771fb451014104462e76fd4067b3a0aa42070082dcb0bf2f388b6495cf33d789904f07d0f55c40fbd4b82963c69b3dc31895d0c772c812b1d5fbcade15312ef1c0e8ebbb12dcd4ffffffff01404b4c00000000001976a9142b6ba7c9d796b75eef7942fc9288edd37c32f5c388ac00000000010000000166d7577163c932b4f9690ca6a80b6e4eb001f0a2fa9023df5595602aae96ed8d000000008a4730440220262b42546302dfb654a229cefc86432b89628ff259dc87edd1154535b16a67e102207b4634c020a97c3e7bbd0d4d19da6aa2269ad9dded4026e896b213d73ca4b63f014104979b82d02226b3a4597523845754d44f13639e3bf2df5e82c6aab2bdc79687368b01b1ab8b19875ae3c90d661a3d0a33161dab29934edeb36aa01976be3baf8affffffff02404b4c00000000001976a9144854e695a02af0aeacb823ccbc272134561e0a1688ac40420f00000000001976a914abee93376d6b37b5c2940655a6fcaf1c8e74237988ac0000000001000000014e3f8ef2e91349a9059cb4f01e54ab2597c1387161d3da89919f7ea6acdbb371010000008c49304602210081f3183471a5ca22307c0800226f3ef9c353069e0773ac76bb580654d56aa523022100d4c56465bdc069060846f4fbf2f6b20520b2a80b08b168b31e66ddb9c694e240014104976c79848e18251612f8940875b2b08d06e6dc73b9840e8860c066b7e87432c477e9a59a453e71e6d76d5fe34058b800a098fc1740ce3012e8fc8a00c96af966ffffffff02c0e1e400000000001976a9144134e75a6fcb6042034aab5e18570cf1f844f54788ac404b4c00000000001976a9142b6ba7c9d796b75eef7942fc9288edd37c32f5c388ac00000000"_hex,
612 };
613 stream >> TX_WITH_WITNESS(block);
614 return block;
615}
616
617std::ostream& operator<<(std::ostream& os, const arith_uint256& num)
618{
619 return os << num.ToString();
620}
621
622std::ostream& operator<<(std::ostream& os, const uint160& num)
623{
624 return os << num.ToString();
625}
626
627std::ostream& operator<<(std::ostream& os, const uint256& num)
628{
629 return os << num.ToString();
630}
CScript GetScriptForDestination(const CTxDestination &dest)
Generate a Bitcoin scriptPubKey for the given CTxDestination.
int64_t CAmount
Amount in satoshis (Can be negative)
Definition: amount.h:12
static constexpr CAmount COIN
The amount of satoshis in one BTC.
Definition: amount.h:15
ArgsManager gArgs
Definition: args.cpp:42
static constexpr unsigned int DEFAULT_MISBEHAVING_BANTIME
Definition: banman.h:19
const std::function< void(const std::string &)> G_TEST_LOG_FUN
This is connected to the logger.
Definition: bench.cpp:28
const std::function< std::vector< const char * >()> G_TEST_COMMAND_LINE_ARGUMENTS
Retrieve the command line arguments.
Definition: bench.cpp:36
const std::function< std::string()> G_TEST_GET_FULL_NAME
Retrieve the unit test name.
Definition: bench.cpp:47
SetupEnvironment()
Definition: system.cpp:59
noui_connect()
Definition: noui.cpp:60
void SelectParams(const ChainType chain)
Sets the params returned by Params() to those for the given chain type.
const CChainParams & Params()
Return the currently selected parameters.
ChainType
Definition: chaintype.h:11
constexpr bool G_FUZZING
Definition: check.h:16
#define Assert(val)
Identity function.
Definition: check.h:85
@ ALLOW_ANY
disable validation
Definition: args.h:106
void ForceSetArg(const std::string &strArg, const std::string &strValue)
Definition: args.cpp:546
bool ParseParameters(int argc, const char *const argv[], std::string &error)
Definition: args.cpp:179
fs::path GetDataDirNet() const
Get data directory path with appended network identifier.
Definition: args.h:234
void ClearPathCache()
Clear cached directory paths.
Definition: args.cpp:333
bool IsArgSet(const std::string &strArg) const
Return true if the given argument has been manually set.
Definition: args.cpp:371
int64_t GetIntArg(const std::string &strArg, int64_t nDefault) const
Return integer argument or default value.
Definition: args.cpp:482
void ClearArgs()
Clear available arguments.
Definition: args.h:362
fs::path GetDataDirBase() const
Get data directory path.
Definition: args.h:227
fs::path GetBlocksDirPath() const
Get blocks directory path.
Definition: args.cpp:282
bool GetBoolArg(const std::string &strArg, bool fDefault) const
Return boolean argument or default value.
Definition: args.cpp:507
void AddArg(const std::string &name, const std::string &help, unsigned int flags, const OptionsCategory &cat)
Add argument.
Definition: args.cpp:564
fs::path GetPathArg(std::string arg, const fs::path &default_value={}) const
Return path argument or default value.
Definition: args.cpp:272
std::list< std::function< void(conststd::string &)> >::iterator PushBackCallback(std::function< void(const std::string &)> fun) EXCLUSIVE_LOCKS_REQUIRED(!m_cs)
Connect a slot to the print signal and return the connection.
Definition: logging.h:156
bool StartLogging() EXCLUSIVE_LOCKS_REQUIRED(!m_cs)
Start logging (and flush all buffered messages)
Definition: logging.cpp:52
void DisconnectTestLogger() EXCLUSIVE_LOCKS_REQUIRED(!m_cs)
Only for testing.
Definition: logging.cpp:96
uint32_t nNonce
Definition: block.h:30
uint32_t nBits
Definition: block.h:29
uint256 GetHash() const
Definition: block.cpp:11
Definition: block.h:69
std::vector< CTransactionRef > vtx
Definition: block.h:72
CChainParams defines various tweakable parameters of a given instance of the Bitcoin system.
Definition: chainparams.h:69
CCoinsView that adds a memory cache for transactions to another CCoinsView.
Definition: coins.h:363
std::optional< Coin > GetCoin(const COutPoint &outpoint) const override
Retrieve the Coin (unspent transaction output) for a given outpoint.
Definition: coins.cpp:66
Abstract view on the open txout dataset.
Definition: coins.h:310
Fee rate in satoshis per kilovirtualbyte: CAmount / kvB.
Definition: feerate.h:33
CAmount GetFee(uint32_t num_bytes) const
Return the fee in satoshis for the given vsize in vbytes.
Definition: feerate.cpp:23
An encapsulated private key.
Definition: key.h:35
CPubKey GetPubKey() const
Compute the public key from a private key.
Definition: key.cpp:182
void Set(const T pbegin, const T pend, bool fCompressedIn)
Initialize using begin and end iterators to byte data.
Definition: key.h:103
An outpoint - a combination of a transaction hash and an index n into its vout.
Definition: transaction.h:29
Serialized script, used inside transaction inputs and outputs.
Definition: script.h:415
The basic transaction that is broadcasted on the network and contained in blocks.
Definition: transaction.h:296
An output of a transaction.
Definition: transaction.h:150
Chainstate stores and provides an API to update our local knowledge of the current best chain.
Definition: validation.h:505
Double ended buffer combining vector and stream-like interfaces.
Definition: streams.h:147
Fast randomness source.
Definition: random.h:377
uint64_t rand64() noexcept
Generate a random 64-bit integer.
Definition: random.h:395
Fillable signing provider that keeps keys in an address->secret map.
virtual bool AddKey(const CKey &key)
static std::unique_ptr< PeerManager > make(CConnman &connman, AddrMan &addrman, BanMan *banman, ChainstateManager &chainman, CTxMemPool &pool, node::Warnings &warnings, Options opts)
I randrange(I range) noexcept
Generate a random integer in the range [0..range), with range > 0.
Definition: random.h:254
uint256 rand256() noexcept
generate a random uint256.
Definition: random.h:308
std::vector< B > randbytes(size_t len) noexcept
Generate random bytes.
Definition: random.h:297
std::string ToString() const
Definition: validation.h:111
256-bit unsigned big integer.
std::string ToString() const
Definition: uint256.cpp:21
std::string ToString() const
Generate a new block, without valid proof-of-work.
Definition: miner.h:146
Maintains a tree of blocks (stored in m_block_index) which is consulted to determine where the most-w...
Definition: blockstorage.h:139
static transaction_identifier FromUint256(const uint256 &id)
160-bit opaque blob.
Definition: uint256.h:184
256-bit opaque blob.
Definition: uint256.h:196
void AddCoins(CCoinsViewCache &cache, const CTransaction &tx, int nHeight, bool check_for_overwrite)
Utility function to add all of a transaction's outputs to a cache.
Definition: coins.cpp:119
bool SetupNetworking()
Definition: system.cpp:91
static const int COINBASE_MATURITY
Coinbase transaction outputs can only be spent after this number of new blocks (network rule)
Definition: consensus.h:19
void ResetCoverageCounters()
Definition: coverage.cpp:21
RecursiveMutex cs_main
Mutex to guard access to validation specific variables, such as reading or changing the chainstate.
Definition: cs_main.cpp:8
static path absolute(const path &p)
Definition: fs.h:82
static std::string PathToString(const path &path)
Convert path object to a byte string.
Definition: fs.h:151
static path PathFromString(const std::string &string)
Convert byte string to path object.
Definition: fs.h:174
bool TryCreateDirectories(const fs::path &p)
Ignores exceptions thrown by create_directories if the requested directory exists.
Definition: fs_helpers.cpp:261
void UnlockDirectory(const fs::path &directory, const fs::path &lockfile_name)
Definition: fs_helpers.cpp:81
std::string HexStr(const std::span< const uint8_t > s)
Convert a span of bytes to a lower-case hexadecimal string.
Definition: hex_base.cpp:29
Common init functions shared by bitcoin-node, bitcoin-wallet, etc.
void InitLogging(const ArgsManager &args)
Initialize global loggers.
Definition: init.cpp:831
bool AppInitParameterInteraction(const ArgsManager &args)
Initialization: parameter interaction.
Definition: init.cpp:897
void SetupServerArgs(ArgsManager &argsman, bool can_listen_ipc)
Register all arguments with the ArgsManager.
Definition: init.cpp:444
@ SIGHASH_ALL
Definition: interpreter.h:30
BCLog::Logger & LogInstance()
Definition: logging.cpp:24
uint64_t fee
LockPoints lp
std::unique_ptr< Chain > MakeChain(node::NodeContext &node)
Return implementation of Chain interface.
void RegenerateCommitments(CBlock &block, ChainstateManager &chainman)
Update an old GenerateCoinbaseCommitment from CreateNewBlock after the block txs have changed.
Definition: miner.cpp:63
util::Result< void > ApplyArgsManOptions(const ArgsManager &args, BlockManager::Options &opts)
ChainstateLoadResult LoadChainstate(ChainstateManager &chainman, const CacheSizes &cache_sizes, const ChainstateLoadOptions &options)
Definition: chainstate.cpp:144
ChainstateLoadResult VerifyLoadedChainstate(ChainstateManager &chainman, const ChainstateLoadOptions &options)
Definition: chainstate.cpp:229
""_hex is a compile-time user-defined literal returning a std::array<std::byte>, equivalent to ParseH...
Definition: strencodings.h:427
void ThreadRename(const std::string &)
Rename a thread both in terms of an internal (in-memory) name as well as its system thread name.
Definition: threadnames.cpp:57
void TraceThread(std::string_view thread_name, std::function< void()> thread_func)
A wrapper for do-something-once thread functions.
Definition: thread.cpp:16
LockResult LockDirectory(const fs::path &directory, const fs::path &lockfile_name, bool probe_only)
Definition: fs_helpers.cpp:53
int64_t GetVirtualTransactionSize(int64_t nWeight, int64_t nSigOpCost, unsigned int bytes_per_sigop)
Compute the virtual transaction size (weight reinterpreted as bytes).
Definition: policy.cpp:310
bool CheckProofOfWork(uint256 hash, unsigned int nBits, const Consensus::Params &params)
Check whether a block hash satisfies the proof-of-work requirement specified by nBits.
Definition: pow.cpp:140
static constexpr TransactionSerParams TX_WITH_WITNESS
Definition: transaction.h:195
static CTransactionRef MakeTransactionRef(Tx &&txIn)
Definition: transaction.h:424
std::shared_ptr< const CTransaction > CTransactionRef
Definition: transaction.h:423
std::atomic< bool > g_used_g_prng
Definition: random.cpp:601
void SignTransaction(CMutableTransaction &mtx, const SigningProvider *keystore, const std::map< COutPoint, Coin > &coins, const UniValue &hashType, UniValue &result)
Sign a transaction with the given keystore and previous transactions.
static void RegisterAllCoreRPCCommands(CRPCTable &t)
Definition: register.h:26
@ OP_CHECKSIG
Definition: script.h:190
@ OP_TRUE
Definition: script.h:84
std::vector< unsigned char > ToByteVector(const T &in)
Definition: script.h:67
CRPCTable tableRPC
Definition: server.cpp:573
static const bool g_rng_temp_path_init
static void ExitFailure(std::string_view str_err)
Test setup failure.
constexpr auto TEST_DIR_PATH_ELEMENT
void SetupCommonTestArgs(ArgsManager &argsman)
Register common test args.
static NetworkSetup g_networksetup_instance
const TranslateFn G_TRANSLATION_FUN
Translate string to current locale using Qt.
CBlock getBlock13b8a()
std::ostream & operator<<(std::ostream &os, const arith_uint256 &num)
static FastRandomContext g_rng_temp_path
Random context to get unique temp data dirs.
Basic testing setup.
Definition: setup_common.h:64
fs::path m_path_lock
Definition: setup_common.h:80
ArgsManager m_args
Test-specific arguments and settings.
Definition: setup_common.h:99
BasicTestingSetup(const ChainType chainType=ChainType::MAIN, TestOpts={})
void SeedRandomForTest(SeedRand seed)
Seed the global RNG state and m_rng for testing and log the seed value.
Definition: setup_common.h:70
FastRandomContext m_rng
Definition: setup_common.h:68
util::SignalInterrupt m_interrupt
Definition: setup_common.h:65
fs::path m_path_root
Definition: setup_common.h:79
node::NodeContext m_node
Definition: setup_common.h:66
NetEventsInterface * m_msgproc
Definition: net.h:1060
A mutable version of CTransaction.
Definition: transaction.h:378
std::vector< CTxOut > vout
Definition: transaction.h:380
std::vector< CTxIn > vin
Definition: transaction.h:379
Testing setup that performs all steps up until right before ChainstateManager gets initialized.
Definition: setup_common.h:106
kernel::CacheSizes m_kernel_cache_sizes
Definition: setup_common.h:107
bool m_block_tree_db_in_memory
Definition: setup_common.h:109
ChainTestingSetup(const ChainType chainType=ChainType::MAIN, TestOpts={})
std::function< void()> m_make_chainman
Definition: setup_common.h:110
void LoadVerifyActivateChainstate()
Application-specific storage settings.
Definition: dbwrapper.h:34
fs::path path
Location in the filesystem where leveldb data will be stored.
Definition: dbwrapper.h:36
Validation result for a transaction evaluated by MemPoolAccept (single or package).
Definition: validation.h:123
const ResultType m_result_type
Result type.
Definition: validation.h:132
bool deterministic_rng
Whether or not the internal RNG behaves deterministically (this is a test-only option).
void mineBlocks(int num_blocks)
Mine a series of new blocks on the active chain.
std::vector< CTransactionRef > m_coinbase_txns
Definition: setup_common.h:252
CMutableTransaction CreateValidMempoolTransaction(const std::vector< CTransactionRef > &input_transactions, const std::vector< COutPoint > &inputs, int input_height, const std::vector< CKey > &input_signing_keys, const std::vector< CTxOut > &outputs, bool submit=true)
Create a transaction and, optionally, submit to the mempool.
std::pair< CMutableTransaction, CAmount > CreateValidTransaction(const std::vector< CTransactionRef > &input_transactions, const std::vector< COutPoint > &inputs, int input_height, const std::vector< CKey > &input_signing_keys, const std::vector< CTxOut > &outputs, const std::optional< CFeeRate > &feerate, const std::optional< uint32_t > &fee_output)
Create a transaction, optionally setting the fee based on the feerate.
std::vector< CTransactionRef > PopulateMempool(FastRandomContext &det_rand, size_t num_transactions, bool submit)
Create transactions spending from m_coinbase_txns.
void MockMempoolMinFee(const CFeeRate &target_feerate)
Mock the mempool minimum feerate by adding a transaction and calling TrimToSize(0),...
CBlock CreateAndProcessBlock(const std::vector< CMutableTransaction > &txns, const CScript &scriptPubKey, Chainstate *chainstate=nullptr)
Create a new block with just given transactions, coinbase paying to scriptPubKey, and try to add it t...
TestChain100Setup(const ChainType chain_type=ChainType::REGTEST, TestOpts={})
CBlock CreateBlock(const std::vector< CMutableTransaction > &txns, const CScript &scriptPubKey, Chainstate &chainstate)
Create a new block with just given transactions, coinbase paying to scriptPubKey.
bool coins_db_in_memory
Definition: setup_common.h:54
bool min_validation_cache
Definition: setup_common.h:58
bool block_tree_db_in_memory
Definition: setup_common.h:55
std::vector< const char * > extra_args
Definition: setup_common.h:53
bool setup_validation_interface
Definition: setup_common.h:57
bool setup_net
Definition: setup_common.h:56
Testing setup that configures a complete environment.
Definition: setup_common.h:121
TestingSetup(const ChainType chainType=ChainType::MAIN, TestOpts={})
Bilingual messages:
Definition: translation.h:24
size_t block_tree_db
Definition: caches.h:21
An options struct for ChainstateManager, more ergonomically referred to as ChainstateManager::Options...
bool require_full_verification
Setting require_full_verification to true will require all checks at check_level (below) to succeed f...
Definition: chainstate.h:34
std::unique_ptr< ValidationSignals > validation_signals
Issues calls about blocks and transactions.
Definition: context.h:88
std::unique_ptr< CConnman > connman
Definition: context.h:67
std::unique_ptr< kernel::Context > kernel
libbitcoin_kernel context
Definition: context.h:58
std::unique_ptr< CTxMemPool > mempool
Definition: context.h:68
std::unique_ptr< BanMan > banman
Definition: context.h:73
std::unique_ptr< AddrMan > addrman
Definition: context.h:66
std::unique_ptr< ChainstateManager > chainman
Definition: context.h:72
std::unique_ptr< node::Warnings > warnings
Manages all the node warnings.
Definition: context.h:91
std::function< bool()> shutdown_request
Function to request a shutdown.
Definition: context.h:63
std::unique_ptr< KernelNotifications > notifications
Issues blocking calls about sync status, errors and warnings.
Definition: context.h:86
std::unique_ptr< CScheduler > scheduler
Definition: context.h:83
util::SignalInterrupt * shutdown_signal
Interrupt object used to track whether node shutdown was requested.
Definition: context.h:65
std::unique_ptr< CBlockPolicyEstimator > fee_estimator
Definition: context.h:70
std::unique_ptr< PeerManager > peerman
Definition: context.h:71
ArgsManager * args
Definition: context.h:74
std::atomic< int > exit_status
Definition: context.h:89
std::unique_ptr< const NetGroupManager > netgroupman
Definition: context.h:69
std::unique_ptr< ECC_Context > ecc_context
Definition: context.h:59
std::unique_ptr< interfaces::Chain > chain
Definition: context.h:76
#define LOCK2(cs1, cs2)
Definition: sync.h:258
#define LOCK(cs)
Definition: sync.h:257
This header provides an interface and simple implementation for a task runner.
@ FIXED_SEED
Seed with a fixed value that never changes over the lifetime of this process.
CTxMemPool::Options MemPoolOptionsForTest(const NodeContext &node)
Definition: txmempool.cpp:20
#define strprintf
Format arguments and return the string or write to given std::ostream (see tinyformat::format doc for...
Definition: tinyformat.h:1172
std::function< std::string(const char *)> TranslateFn
Translate a message to the native language of the user.
Definition: translation.h:16
static constexpr uint32_t MAX_BIP125_RBF_SEQUENCE
Definition: rbf.h:12
int64_t GetTime()
DEPRECATED Use either ClockType::now() or Now<TimePointType>() if a cast is needed.
Definition: time.cpp:76
void SetMockTime(int64_t nMockTimeIn)
DEPRECATED Use SetMockTime with chrono type.
Definition: time.cpp:40
assert(!tx.IsCoinBase())
static constexpr int DEFAULT_CHECKLEVEL
Definition: validation.h:70
static const signed int DEFAULT_CHECKBLOCKS
Definition: validation.h:69
V Cat(V v1, V &&v2)
Concatenate two vectors, moving elements.
Definition: vector.h:34