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