Branch data Line data Source code
1 : : // Copyright (c) 2009-2010 Satoshi Nakamoto
2 : : // Copyright (c) 2009-2022 The Bitcoin Core developers
3 : : // Distributed under the MIT software license, see the accompanying
4 : : // file COPYING or http://www.opensource.org/licenses/mit-license.php.
5 : :
6 : : #include <node/miner.h>
7 : :
8 : : #include <chain.h>
9 : : #include <chainparams.h>
10 : : #include <coins.h>
11 : : #include <common/args.h>
12 : : #include <consensus/amount.h>
13 : : #include <consensus/consensus.h>
14 : : #include <consensus/merkle.h>
15 : : #include <consensus/tx_verify.h>
16 : : #include <consensus/validation.h>
17 : : #include <deploymentstatus.h>
18 : : #include <logging.h>
19 : : #include <policy/feerate.h>
20 : : #include <policy/policy.h>
21 : : #include <pow.h>
22 : : #include <primitives/transaction.h>
23 : : #include <util/moneystr.h>
24 : : #include <util/time.h>
25 : : #include <validation.h>
26 : :
27 : : #include <algorithm>
28 : : #include <utility>
29 : :
30 : : namespace node {
31 : 116116 : int64_t UpdateTime(CBlockHeader* pblock, const Consensus::Params& consensusParams, const CBlockIndex* pindexPrev)
32 : : {
33 : 116116 : int64_t nOldTime = pblock->nTime;
34 [ + + ]: 116116 : int64_t nNewTime{std::max<int64_t>(pindexPrev->GetMedianTimePast() + 1, TicksSinceEpoch<std::chrono::seconds>(NodeClock::now()))};
35 : :
36 [ - + ]: 116116 : if (consensusParams.enforce_BIP94) {
37 : : // Height of block to be mined.
38 : 0 : const int height{pindexPrev->nHeight + 1};
39 [ # # ]: 0 : if (height % consensusParams.DifficultyAdjustmentInterval() == 0) {
40 [ # # ]: 0 : nNewTime = std::max<int64_t>(nNewTime, pindexPrev->GetBlockTime() - MAX_TIMEWARP);
41 : : }
42 : : }
43 : :
44 [ + + ]: 116116 : if (nOldTime < nNewTime) {
45 : 2 : pblock->nTime = nNewTime;
46 : : }
47 : :
48 : : // Updating time can change work required on testnet:
49 [ + - ]: 116116 : if (consensusParams.fPowAllowMinDifficultyBlocks) {
50 : 116116 : pblock->nBits = GetNextWorkRequired(pindexPrev, pblock, consensusParams);
51 : : }
52 : :
53 : 116116 : return nNewTime - nOldTime;
54 : : }
55 : :
56 : 106034 : void RegenerateCommitments(CBlock& block, ChainstateManager& chainman)
57 : : {
58 : 106034 : CMutableTransaction tx{*block.vtx.at(0)};
59 : 106034 : tx.vout.erase(tx.vout.begin() + GetWitnessCommitmentIndex(block));
60 [ + - + - : 212068 : block.vtx.at(0) = MakeTransactionRef(tx);
- + ]
61 : :
62 [ + - + - : 318102 : const CBlockIndex* prev_block = WITH_LOCK(::cs_main, return chainman.m_blockman.LookupBlockIndex(block.hashPrevBlock));
+ - ]
63 [ + - ]: 106034 : chainman.GenerateCoinbaseCommitment(block, prev_block);
64 : :
65 [ + - ]: 106034 : block.hashMerkleRoot = BlockMerkleRoot(block);
66 : 106034 : }
67 : :
68 : 116116 : static BlockAssembler::Options ClampOptions(BlockAssembler::Options options)
69 : : {
70 : 116116 : Assert(options.coinbase_max_additional_weight <= DEFAULT_BLOCK_MAX_WEIGHT);
71 : 116116 : Assert(options.coinbase_output_max_additional_sigops <= MAX_BLOCK_SIGOPS_COST);
72 : : // Limit weight to between coinbase_max_additional_weight and DEFAULT_BLOCK_MAX_WEIGHT for sanity:
73 : : // Coinbase (reserved) outputs can safely exceed -blockmaxweight, but the rest of the block template will be empty.
74 [ + + ]: 116116 : options.nBlockMaxWeight = std::clamp<size_t>(options.nBlockMaxWeight, options.coinbase_max_additional_weight, DEFAULT_BLOCK_MAX_WEIGHT);
75 : 116116 : return options;
76 : : }
77 : :
78 : 116116 : BlockAssembler::BlockAssembler(Chainstate& chainstate, const CTxMemPool* mempool, const Options& options)
79 : 116116 : : chainparams{chainstate.m_chainman.GetParams()},
80 [ - + ]: 116116 : m_mempool{options.use_mempool ? mempool : nullptr},
81 : 116116 : m_chainstate{chainstate},
82 [ + - - + : 116116 : m_options{ClampOptions(options)}
+ - ]
83 : : {
84 : 116116 : }
85 : :
86 : 110681 : void ApplyArgsManOptions(const ArgsManager& args, BlockAssembler::Options& options)
87 : : {
88 : : // Block resource limits
89 [ + - ]: 110681 : options.nBlockMaxWeight = args.GetIntArg("-blockmaxweight", options.nBlockMaxWeight);
90 [ + - - + ]: 221362 : if (const auto blockmintxfee{args.GetArg("-blockmintxfee")}) {
91 [ # # # # ]: 0 : if (const auto parsed{ParseMoney(*blockmintxfee)}) options.blockMinFeeRate = CFeeRate{*parsed};
92 : 0 : }
93 [ + - ]: 110681 : options.print_modified_fee = args.GetBoolArg("-printpriority", options.print_modified_fee);
94 : 110681 : }
95 : :
96 : 116116 : void BlockAssembler::resetBlock()
97 : : {
98 : 116116 : inBlock.clear();
99 : :
100 : : // Reserve space for coinbase tx
101 : 116116 : nBlockWeight = m_options.coinbase_max_additional_weight;
102 : 116116 : nBlockSigOpsCost = m_options.coinbase_output_max_additional_sigops;
103 : :
104 : : // These counters do not include coinbase tx
105 : 116116 : nBlockTx = 0;
106 : 116116 : nFees = 0;
107 : 116116 : }
108 : :
109 : 116116 : std::unique_ptr<CBlockTemplate> BlockAssembler::CreateNewBlock(const CScript& scriptPubKeyIn)
110 : : {
111 : 116116 : const auto time_start{SteadyClock::now()};
112 : :
113 : 116116 : resetBlock();
114 : :
115 [ - + ]: 116116 : pblocktemplate.reset(new CBlockTemplate());
116 : 116116 : CBlock* const pblock = &pblocktemplate->block; // pointer for convenience
117 : :
118 : : // Add dummy coinbase tx as first transaction
119 : 116116 : pblock->vtx.emplace_back();
120 : 116116 : pblocktemplate->vTxFees.push_back(-1); // updated at end
121 : 116116 : pblocktemplate->vTxSigOpsCost.push_back(-1); // updated at end
122 : :
123 : 116116 : LOCK(::cs_main);
124 [ + - ]: 116116 : CBlockIndex* pindexPrev = m_chainstate.m_chain.Tip();
125 [ - + ]: 116116 : assert(pindexPrev != nullptr);
126 : 116116 : nHeight = pindexPrev->nHeight + 1;
127 : :
128 [ + - ]: 116116 : pblock->nVersion = m_chainstate.m_chainman.m_versionbitscache.ComputeBlockVersion(pindexPrev, chainparams.GetConsensus());
129 : : // -regtest only: allow overriding block.nVersion with
130 : : // -blockversion=N to test forking scenarios
131 [ + - ]: 116116 : if (chainparams.MineBlocksOnDemand()) {
132 [ + - + - ]: 116116 : pblock->nVersion = gArgs.GetIntArg("-blockversion", pblock->nVersion);
133 : : }
134 : :
135 : 116116 : pblock->nTime = TicksSinceEpoch<std::chrono::seconds>(NodeClock::now());
136 : 116116 : m_lock_time_cutoff = pindexPrev->GetMedianTimePast();
137 : :
138 : 116116 : int nPackagesSelected = 0;
139 : 116116 : int nDescendantsUpdated = 0;
140 [ + - ]: 116116 : if (m_mempool) {
141 [ + - ]: 116116 : addPackageTxs(nPackagesSelected, nDescendantsUpdated);
142 : : }
143 : :
144 : 116116 : const auto time_1{SteadyClock::now()};
145 : :
146 [ + + ]: 116116 : m_last_block_num_txs = nBlockTx;
147 [ + + ]: 116116 : m_last_block_weight = nBlockWeight;
148 : :
149 : : // Create coinbase transaction.
150 [ + - ]: 116116 : CMutableTransaction coinbaseTx;
151 [ + - ]: 116116 : coinbaseTx.vin.resize(1);
152 : 116116 : coinbaseTx.vin[0].prevout.SetNull();
153 [ + - ]: 116116 : coinbaseTx.vout.resize(1);
154 : 116116 : coinbaseTx.vout[0].scriptPubKey = scriptPubKeyIn;
155 [ + - + - ]: 116116 : coinbaseTx.vout[0].nValue = nFees + GetBlockSubsidy(nHeight, chainparams.GetConsensus());
156 [ + - + - ]: 116116 : coinbaseTx.vin[0].scriptSig = CScript() << nHeight << OP_0;
157 [ + - - + ]: 232232 : pblock->vtx[0] = MakeTransactionRef(std::move(coinbaseTx));
158 [ + - ]: 116116 : pblocktemplate->vchCoinbaseCommitment = m_chainstate.m_chainman.GenerateCoinbaseCommitment(*pblock, pindexPrev);
159 : 116116 : pblocktemplate->vTxFees[0] = -nFees;
160 : :
161 [ + - ]: 116116 : LogPrintf("CreateNewBlock(): block weight: %u txs: %u fees: %ld sigops %d\n", GetBlockWeight(*pblock), nBlockTx, nFees, nBlockSigOpsCost);
162 : :
163 : : // Fill in header
164 : 116116 : pblock->hashPrevBlock = pindexPrev->GetBlockHash();
165 [ + - ]: 116116 : UpdateTime(pblock, chainparams.GetConsensus(), pindexPrev);
166 [ + - ]: 116116 : pblock->nBits = GetNextWorkRequired(pindexPrev, pblock, chainparams.GetConsensus());
167 : 116116 : pblock->nNonce = 0;
168 [ + - + + ]: 116116 : pblocktemplate->vTxSigOpsCost[0] = WITNESS_SCALE_FACTOR * GetLegacySigOpCount(*pblock->vtx[0]);
169 : :
170 [ + + ]: 116116 : BlockValidationState state;
171 [ + + + - : 116116 : if (m_options.test_block_validity && !TestBlockValidity(state, chainparams, m_chainstate, *pblock, pindexPrev,
+ - ]
172 : : /*fCheckPOW=*/false, /*fCheckMerkleRoot=*/false)) {
173 [ # # # # : 0 : throw std::runtime_error(strprintf("%s: TestBlockValidity failed: %s", __func__, state.ToString()));
# # ]
174 : : }
175 : 116116 : const auto time_2{SteadyClock::now()};
176 : :
177 [ + - + + : 116116 : LogDebug(BCLog::BENCH, "CreateNewBlock() packages: %.2fms (%d packages, %d updated descendants), validity: %.2fms (total %.2fms)\n",
+ - ]
178 : : Ticks<MillisecondsDouble>(time_1 - time_start), nPackagesSelected, nDescendantsUpdated,
179 : : Ticks<MillisecondsDouble>(time_2 - time_1),
180 : : Ticks<MillisecondsDouble>(time_2 - time_start));
181 : :
182 : 116116 : return std::move(pblocktemplate);
183 [ + - ]: 348348 : }
184 : :
185 : 24001 : void BlockAssembler::onlyUnconfirmed(CTxMemPool::setEntries& testSet)
186 : : {
187 [ + + ]: 128872 : for (CTxMemPool::setEntries::iterator iit = testSet.begin(); iit != testSet.end(); ) {
188 : : // Only test txs not already in the block
189 [ + - + - : 314613 : if (inBlock.count((*iit)->GetSharedTx()->GetHash())) {
+ - + + ]
190 : 77033 : testSet.erase(iit++);
191 : : } else {
192 : 27838 : iit++;
193 : : }
194 : : }
195 : 24001 : }
196 : :
197 : 30943 : bool BlockAssembler::TestPackage(uint64_t packageSize, int64_t packageSigOpsCost) const
198 : : {
199 : : // TODO: switch to weight-based accounting for packages instead of vsize-based accounting.
200 [ + + ]: 30943 : if (nBlockWeight + WITNESS_SCALE_FACTOR * packageSize >= m_options.nBlockMaxWeight) {
201 : : return false;
202 : : }
203 [ - + ]: 24001 : if (nBlockSigOpsCost + packageSigOpsCost >= MAX_BLOCK_SIGOPS_COST) {
204 : 0 : return false;
205 : : }
206 : : return true;
207 : : }
208 : :
209 : : // Perform transaction-level checks before adding to block:
210 : : // - transaction finality (locktime)
211 : 24001 : bool BlockAssembler::TestPackageTransactions(const CTxMemPool::setEntries& package) const
212 : : {
213 [ + + ]: 75840 : for (CTxMemPool::txiter it : package) {
214 [ + - ]: 51839 : if (!IsFinalTx(it->GetTx(), nHeight, m_lock_time_cutoff)) {
215 : : return false;
216 : : }
217 : : }
218 : : return true;
219 : : }
220 : :
221 : 51839 : void BlockAssembler::AddToBlock(CTxMemPool::txiter iter)
222 : : {
223 [ + - + - ]: 103678 : pblocktemplate->block.vtx.emplace_back(iter->GetSharedTx());
224 : 51839 : pblocktemplate->vTxFees.push_back(iter->GetFee());
225 : 51839 : pblocktemplate->vTxSigOpsCost.push_back(iter->GetSigOpCost());
226 [ + - ]: 51839 : nBlockWeight += iter->GetTxWeight();
227 : 51839 : ++nBlockTx;
228 [ + - ]: 51839 : nBlockSigOpsCost += iter->GetSigOpCost();
229 : 51839 : nFees += iter->GetFee();
230 [ + - + - : 103678 : inBlock.insert(iter->GetSharedTx()->GetHash());
+ - ]
231 : :
232 [ - + ]: 51839 : if (m_options.print_modified_fee) {
233 [ # # # # : 0 : LogPrintf("fee rate %s txid %s\n",
# # # # ]
234 : : CFeeRate(iter->GetModifiedFee(), iter->GetTxSize()).ToString(),
235 : : iter->GetTx().GetHash().ToString());
236 : : }
237 : 51839 : }
238 : :
239 : : /** Add descendants of given transactions to mapModifiedTx with ancestor
240 : : * state updated assuming given transactions are inBlock. Returns number
241 : : * of updated descendants. */
242 : 24001 : static int UpdatePackagesForAdded(const CTxMemPool& mempool,
243 : : const CTxMemPool::setEntries& alreadyAdded,
244 : : indexed_modified_transaction_set& mapModifiedTx) EXCLUSIVE_LOCKS_REQUIRED(mempool.cs)
245 : : {
246 : 24001 : AssertLockHeld(mempool.cs);
247 : :
248 : 24001 : int nDescendantsUpdated = 0;
249 [ + + ]: 75840 : for (CTxMemPool::txiter it : alreadyAdded) {
250 [ + - ]: 51839 : CTxMemPool::setEntries descendants;
251 [ + - ]: 51839 : mempool.CalculateDescendants(it, descendants);
252 : : // Insert all descendants (not yet in block) into the modified set
253 [ + + ]: 933217 : for (CTxMemPool::txiter desc : descendants) {
254 [ + + ]: 881378 : if (alreadyAdded.count(desc)) {
255 : 518668 : continue;
256 : : }
257 : 362710 : ++nDescendantsUpdated;
258 : 362710 : modtxiter mit = mapModifiedTx.find(desc);
259 [ + + ]: 362710 : if (mit == mapModifiedTx.end()) {
260 [ + - ]: 25188 : CTxMemPoolModifiedEntry modEntry(desc);
261 [ + - ]: 25188 : mit = mapModifiedTx.insert(modEntry).first;
262 : : }
263 [ + - ]: 1244088 : mapModifiedTx.modify(mit, update_for_parent_inclusion(it));
264 : : }
265 : 51839 : }
266 : 24001 : return nDescendantsUpdated;
267 : : }
268 : :
269 : 24001 : void BlockAssembler::SortForBlock(const CTxMemPool::setEntries& package, std::vector<CTxMemPool::txiter>& sortedEntries)
270 : : {
271 : : // Sort package by ancestor count
272 : : // If a transaction A depends on transaction B, then A's ancestor count
273 : : // must be greater than B's. So this is sufficient to validly order the
274 : : // transactions for block inclusion.
275 [ - + ]: 24001 : sortedEntries.clear();
276 : 24001 : sortedEntries.insert(sortedEntries.begin(), package.begin(), package.end());
277 : 24001 : std::sort(sortedEntries.begin(), sortedEntries.end(), CompareTxIterByAncestorCount());
278 : 24001 : }
279 : :
280 : : // This transaction selection algorithm orders the mempool based
281 : : // on feerate of a transaction including all unconfirmed ancestors.
282 : : // Since we don't remove transactions from the mempool as we select them
283 : : // for block inclusion, we need an alternate method of updating the feerate
284 : : // of a transaction with its not-yet-selected ancestors as we go.
285 : : // This is accomplished by walking the in-mempool descendants of selected
286 : : // transactions and storing a temporary modified state in mapModifiedTxs.
287 : : // Each time through the loop, we compare the best transaction in
288 : : // mapModifiedTxs with the next transaction in the mempool to decide what
289 : : // transaction package to work on next.
290 : 116116 : void BlockAssembler::addPackageTxs(int& nPackagesSelected, int& nDescendantsUpdated)
291 : : {
292 : 116116 : const auto& mempool{*Assert(m_mempool)};
293 : 116116 : LOCK(mempool.cs);
294 : :
295 : : // mapModifiedTx will store sorted packages after they are modified
296 : : // because some of their txs are already in the block
297 [ + - ]: 116116 : indexed_modified_transaction_set mapModifiedTx;
298 : : // Keep track of entries that failed inclusion, to avoid duplicate work
299 : 116116 : std::set<Txid> failedTx;
300 : :
301 : 116116 : CTxMemPool::indexed_transaction_set::index<ancestor_score>::type::iterator mi = mempool.mapTx.get<ancestor_score>().begin();
302 : 116116 : CTxMemPool::txiter iter;
303 : :
304 : : // Limit the number of attempts to add transactions to the block when it is
305 : : // close to full; this is just a simple heuristic to finish quickly if the
306 : : // mempool has a lot of entries.
307 : 116116 : const int64_t MAX_CONSECUTIVE_FAILURES = 1000;
308 : 116116 : int64_t nConsecutiveFailed = 0;
309 : :
310 [ + + + + ]: 183035 : while (mi != mempool.mapTx.get<ancestor_score>().end() || !mapModifiedTx.empty()) {
311 : : // First try to find a new transaction in mapTx to evaluate.
312 : : //
313 : : // Skip entries in mapTx that are already in a block or are present
314 : : // in mapModifiedTx (which implies that the mapTx ancestor state is
315 : : // stale due to ancestor inclusion in the block)
316 : : // Also skip transactions that we've already failed to add. This can happen if
317 : : // we consider a transaction in mapModifiedTx and it fails: we can then
318 : : // potentially consider it again while walking mapTx. It's currently
319 : : // guaranteed to fail again, but as a belt-and-suspenders check we put it in
320 : : // failedTx and avoid re-evaluation, since the re-evaluation would be using
321 : : // cached size/sigops/fee values that are not actually correct.
322 : : /** Return true if given transaction from mapTx has already been evaluated,
323 : : * or if the transaction's cached data in mapTx is incorrect. */
324 [ + + ]: 68001 : if (mi != mempool.mapTx.get<ancestor_score>().end()) {
325 [ - + ]: 64132 : auto it = mempool.mapTx.project<0>(mi);
326 [ - + ]: 64132 : assert(it != mempool.mapTx.end());
327 [ + + + - : 203906 : if (mapModifiedTx.count(it) || inBlock.count(it->GetSharedTx()->GetHash()) || failedTx.count(it->GetSharedTx()->GetHash())) {
+ - + + +
- + + + +
+ + ]
328 : 35976 : ++mi;
329 : 35976 : continue;
330 : : }
331 : : }
332 : :
333 : : // Now that mi is not stale, determine which transaction to evaluate:
334 : : // the next entry from mapTx, or the best from mapModifiedTx?
335 : 32025 : bool fUsingModified = false;
336 : :
337 : 32025 : modtxscoreiter modit = mapModifiedTx.get<ancestor_score>().begin();
338 [ + + ]: 32025 : if (mi == mempool.mapTx.get<ancestor_score>().end()) {
339 : : // We're out of entries in mapTx; use the entry from mapModifiedTx
340 : 3869 : iter = modit->iter;
341 : 3869 : fUsingModified = true;
342 : : } else {
343 : : // Try to compare the mapTx entry to the mapModifiedTx entry
344 [ + + ]: 28156 : iter = mempool.mapTx.project<0>(mi);
345 [ + + + + ]: 39553 : if (modit != mapModifiedTx.get<ancestor_score>().end() &&
346 [ + - ]: 11397 : CompareTxMemPoolEntryByAncestorFee()(*modit, CTxMemPoolModifiedEntry(iter))) {
347 : : // The best entry in mapModifiedTx has higher score
348 : : // than the one from mapTx.
349 : : // Switch which transaction (package) to consider
350 : 3437 : iter = modit->iter;
351 : 3437 : fUsingModified = true;
352 : : } else {
353 : : // Either no entry in mapModifiedTx, or it's worse than mapTx.
354 : : // Increment mi for the next loop iteration.
355 : 24719 : ++mi;
356 : : }
357 : : }
358 : :
359 : : // We skip mapTx entries that are inBlock, and mapModifiedTx shouldn't
360 : : // contain anything that is inBlock.
361 [ + - + - : 64050 : assert(!inBlock.count(iter->GetSharedTx()->GetHash()));
- + ]
362 : :
363 [ + + ]: 32025 : uint64_t packageSize = iter->GetSizeWithAncestors();
364 [ + + ]: 32025 : CAmount packageFees = iter->GetModFeesWithAncestors();
365 [ + + ]: 32025 : int64_t packageSigOpsCost = iter->GetSigOpCostWithAncestors();
366 [ + + ]: 32025 : if (fUsingModified) {
367 : 7306 : packageSize = modit->nSizeWithAncestors;
368 : 7306 : packageFees = modit->nModFeesWithAncestors;
369 : 7306 : packageSigOpsCost = modit->nSigOpCostWithAncestors;
370 : : }
371 : :
372 [ + - + + ]: 32025 : if (packageFees < m_options.blockMinFeeRate.GetFee(packageSize)) {
373 : : // Everything else we might consider has a lower fee rate
374 : 1082 : return;
375 : : }
376 : :
377 [ + - + + ]: 30943 : if (!TestPackage(packageSize, packageSigOpsCost)) {
378 [ + + ]: 6942 : if (fUsingModified) {
379 : : // Since we always look at the best entry in mapModifiedTx,
380 : : // we must erase failed entries so that we can consider the
381 : : // next best entry on the next loop iteration
382 : 733 : mapModifiedTx.get<ancestor_score>().erase(modit);
383 [ + - + - ]: 2199 : failedTx.insert(iter->GetSharedTx()->GetHash());
384 : : }
385 : :
386 : 6942 : ++nConsecutiveFailed;
387 : :
388 [ - + ]: 6942 : if (nConsecutiveFailed > MAX_CONSECUTIVE_FAILURES && nBlockWeight >
389 [ # # ]: 0 : m_options.nBlockMaxWeight - m_options.coinbase_max_additional_weight) {
390 : : // Give up if we're close to full and haven't succeeded in a while
391 : : break;
392 : : }
393 : 6942 : continue;
394 : : }
395 : :
396 [ + - ]: 24001 : auto ancestors{mempool.AssumeCalculateMemPoolAncestors(__func__, *iter, CTxMemPool::Limits::NoLimits(), /*fSearchForParents=*/false)};
397 : :
398 [ + - ]: 24001 : onlyUnconfirmed(ancestors);
399 [ + - ]: 24001 : ancestors.insert(iter);
400 : :
401 : : // Test if all tx's are Final
402 [ + - - + ]: 24001 : if (!TestPackageTransactions(ancestors)) {
403 [ # # ]: 0 : if (fUsingModified) {
404 : 0 : mapModifiedTx.get<ancestor_score>().erase(modit);
405 [ # # # # ]: 0 : failedTx.insert(iter->GetSharedTx()->GetHash());
406 : : }
407 : 0 : continue;
408 : : }
409 : :
410 : : // This transaction will make it in; reset the failed counter.
411 : 24001 : nConsecutiveFailed = 0;
412 : :
413 : : // Package can be added. Sort the entries in a valid order.
414 : 24001 : std::vector<CTxMemPool::txiter> sortedEntries;
415 [ + - ]: 24001 : SortForBlock(ancestors, sortedEntries);
416 : :
417 [ + + ]: 75840 : for (size_t i = 0; i < sortedEntries.size(); ++i) {
418 [ + - ]: 51839 : AddToBlock(sortedEntries[i]);
419 : : // Erase from the modified set, if present
420 : 51839 : mapModifiedTx.erase(sortedEntries[i]);
421 : : }
422 : :
423 : 24001 : ++nPackagesSelected;
424 : :
425 : : // Update transactions that depend on each of these
426 [ + - ]: 24001 : nDescendantsUpdated += UpdatePackagesForAdded(mempool, ancestors, mapModifiedTx);
427 : 24001 : }
428 [ + - + - ]: 232232 : }
429 : : } // namespace node
|
