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