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