Branch data Line data Source code
1 : : // Copyright (c) 2009-2010 Satoshi Nakamoto
2 : : // Copyright (c) 2009-present 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 <bitcoin-build-config.h> // IWYU pragma: keep
7 : :
8 : : #include <validation.h>
9 : :
10 : : #include <arith_uint256.h>
11 : : #include <chain.h>
12 : : #include <checkqueue.h>
13 : : #include <clientversion.h>
14 : : #include <consensus/amount.h>
15 : : #include <consensus/consensus.h>
16 : : #include <consensus/merkle.h>
17 : : #include <consensus/tx_check.h>
18 : : #include <consensus/tx_verify.h>
19 : : #include <consensus/validation.h>
20 : : #include <cuckoocache.h>
21 : : #include <flatfile.h>
22 : : #include <hash.h>
23 : : #include <kernel/chain.h>
24 : : #include <kernel/chainparams.h>
25 : : #include <kernel/coinstats.h>
26 : : #include <kernel/disconnected_transactions.h>
27 : : #include <kernel/mempool_entry.h>
28 : : #include <kernel/messagestartchars.h>
29 : : #include <kernel/notifications_interface.h>
30 : : #include <kernel/warning.h>
31 : : #include <logging.h>
32 : : #include <logging/timer.h>
33 : : #include <node/blockstorage.h>
34 : : #include <node/utxo_snapshot.h>
35 : : #include <policy/ephemeral_policy.h>
36 : : #include <policy/policy.h>
37 : : #include <policy/rbf.h>
38 : : #include <policy/settings.h>
39 : : #include <policy/truc_policy.h>
40 : : #include <pow.h>
41 : : #include <primitives/block.h>
42 : : #include <primitives/transaction.h>
43 : : #include <random.h>
44 : : #include <script/script.h>
45 : : #include <script/sigcache.h>
46 : : #include <signet.h>
47 : : #include <tinyformat.h>
48 : : #include <txdb.h>
49 : : #include <txmempool.h>
50 : : #include <uint256.h>
51 : : #include <undo.h>
52 : : #include <util/check.h>
53 : : #include <util/fs.h>
54 : : #include <util/fs_helpers.h>
55 : : #include <util/hasher.h>
56 : : #include <util/moneystr.h>
57 : : #include <util/rbf.h>
58 : : #include <util/result.h>
59 : : #include <util/signalinterrupt.h>
60 : : #include <util/strencodings.h>
61 : : #include <util/string.h>
62 : : #include <util/time.h>
63 : : #include <util/trace.h>
64 : : #include <util/translation.h>
65 : : #include <validationinterface.h>
66 : :
67 : : #include <algorithm>
68 : : #include <cassert>
69 : : #include <chrono>
70 : : #include <deque>
71 : : #include <numeric>
72 : : #include <optional>
73 : : #include <ranges>
74 : : #include <span>
75 : : #include <string>
76 : : #include <tuple>
77 : : #include <utility>
78 : :
79 : : using kernel::CCoinsStats;
80 : : using kernel::CoinStatsHashType;
81 : : using kernel::ComputeUTXOStats;
82 : : using kernel::Notifications;
83 : :
84 : : using fsbridge::FopenFn;
85 : : using node::BlockManager;
86 : : using node::BlockMap;
87 : : using node::CBlockIndexHeightOnlyComparator;
88 : : using node::CBlockIndexWorkComparator;
89 : : using node::SnapshotMetadata;
90 : :
91 : : /** Size threshold for warning about slow UTXO set flush to disk. */
92 : : static constexpr size_t WARN_FLUSH_COINS_SIZE = 1 << 30; // 1 GiB
93 : : /** Time window to wait between writing blocks/block index and chainstate to disk.
94 : : * Randomize writing time inside the window to prevent a situation where the
95 : : * network over time settles into a few cohorts of synchronized writers.
96 : : */
97 : : static constexpr auto DATABASE_WRITE_INTERVAL_MIN{50min};
98 : : static constexpr auto DATABASE_WRITE_INTERVAL_MAX{70min};
99 : : /** Maximum age of our tip for us to be considered current for fee estimation */
100 : : static constexpr std::chrono::hours MAX_FEE_ESTIMATION_TIP_AGE{3};
101 : : const std::vector<std::string> CHECKLEVEL_DOC {
102 : : "level 0 reads the blocks from disk",
103 : : "level 1 verifies block validity",
104 : : "level 2 verifies undo data",
105 : : "level 3 checks disconnection of tip blocks",
106 : : "level 4 tries to reconnect the blocks",
107 : : "each level includes the checks of the previous levels",
108 : : };
109 : : /** The number of blocks to keep below the deepest prune lock.
110 : : * There is nothing special about this number. It is higher than what we
111 : : * expect to see in regular mainnet reorgs, but not so high that it would
112 : : * noticeably interfere with the pruning mechanism.
113 : : * */
114 : : static constexpr int PRUNE_LOCK_BUFFER{10};
115 : :
116 : : TRACEPOINT_SEMAPHORE(validation, block_connected);
117 : : TRACEPOINT_SEMAPHORE(utxocache, flush);
118 : : TRACEPOINT_SEMAPHORE(mempool, replaced);
119 : : TRACEPOINT_SEMAPHORE(mempool, rejected);
120 : :
121 : 2169 : const CBlockIndex* Chainstate::FindForkInGlobalIndex(const CBlockLocator& locator) const
122 : : {
123 : 2169 : AssertLockHeld(cs_main);
124 : :
125 : : // Find the latest block common to locator and chain - we expect that
126 : : // locator.vHave is sorted descending by height.
127 [ + + ]: 5962 : for (const uint256& hash : locator.vHave) {
128 : 5956 : const CBlockIndex* pindex{m_blockman.LookupBlockIndex(hash)};
129 [ + + ]: 5956 : if (pindex) {
130 [ + + ]: 4458 : if (m_chain.Contains(pindex)) {
131 : : return pindex;
132 : : }
133 [ - + - + : 4620 : if (pindex->GetAncestor(m_chain.Height()) == m_chain.Tip()) {
+ + ]
134 : 2169 : return m_chain.Tip();
135 : : }
136 : : }
137 : : }
138 [ - + ]: 6 : return m_chain.Genesis();
139 : : }
140 : :
141 : : bool CheckInputScripts(const CTransaction& tx, TxValidationState& state,
142 : : const CCoinsViewCache& inputs, unsigned int flags, bool cacheSigStore,
143 : : bool cacheFullScriptStore, PrecomputedTransactionData& txdata,
144 : : ValidationCache& validation_cache,
145 : : std::vector<CScriptCheck>* pvChecks = nullptr)
146 : : EXCLUSIVE_LOCKS_REQUIRED(cs_main);
147 : :
148 : 37920 : bool CheckFinalTxAtTip(const CBlockIndex& active_chain_tip, const CTransaction& tx)
149 : : {
150 : 37920 : AssertLockHeld(cs_main);
151 : :
152 : : // CheckFinalTxAtTip() uses active_chain_tip.Height()+1 to evaluate
153 : : // nLockTime because when IsFinalTx() is called within
154 : : // AcceptBlock(), the height of the block *being*
155 : : // evaluated is what is used. Thus if we want to know if a
156 : : // transaction can be part of the *next* block, we need to call
157 : : // IsFinalTx() with one more than active_chain_tip.Height().
158 : 37920 : const int nBlockHeight = active_chain_tip.nHeight + 1;
159 : :
160 : : // BIP113 requires that time-locked transactions have nLockTime set to
161 : : // less than the median time of the previous block they're contained in.
162 : : // When the next block is created its previous block will be the current
163 : : // chain tip, so we use that to calculate the median time passed to
164 : : // IsFinalTx().
165 : 37920 : const int64_t nBlockTime{active_chain_tip.GetMedianTimePast()};
166 : :
167 : 37920 : return IsFinalTx(tx, nBlockHeight, nBlockTime);
168 : : }
169 : :
170 : : namespace {
171 : : /**
172 : : * A helper which calculates heights of inputs of a given transaction.
173 : : *
174 : : * @param[in] tip The current chain tip. If an input belongs to a mempool
175 : : * transaction, we assume it will be confirmed in the next block.
176 : : * @param[in] coins Any CCoinsView that provides access to the relevant coins.
177 : : * @param[in] tx The transaction being evaluated.
178 : : *
179 : : * @returns A vector of input heights or nullopt, in case of an error.
180 : : */
181 : 32499 : std::optional<std::vector<int>> CalculatePrevHeights(
182 : : const CBlockIndex& tip,
183 : : const CCoinsView& coins,
184 : : const CTransaction& tx)
185 : : {
186 : 32499 : std::vector<int> prev_heights;
187 [ - + + - ]: 32499 : prev_heights.resize(tx.vin.size());
188 [ - + + + ]: 91834 : for (size_t i = 0; i < tx.vin.size(); ++i) {
189 [ + - + - ]: 59335 : if (auto coin{coins.GetCoin(tx.vin[i].prevout)}) {
190 [ + + ]: 118670 : prev_heights[i] = coin->nHeight == MEMPOOL_HEIGHT
191 [ + + ]: 59335 : ? tip.nHeight + 1 // Assume all mempool transaction confirm in the next block.
192 : 47414 : : coin->nHeight;
193 : : } else {
194 [ # # # # ]: 0 : LogPrintf("ERROR: %s: Missing input %d in transaction \'%s\'\n", __func__, i, tx.GetHash().GetHex());
195 : 0 : return std::nullopt;
196 : 59335 : }
197 : : }
198 : 32499 : return prev_heights;
199 : 32499 : }
200 : : } // namespace
201 : :
202 : 32499 : std::optional<LockPoints> CalculateLockPointsAtTip(
203 : : CBlockIndex* tip,
204 : : const CCoinsView& coins_view,
205 : : const CTransaction& tx)
206 : : {
207 [ - + ]: 32499 : assert(tip);
208 : :
209 : 32499 : auto prev_heights{CalculatePrevHeights(*tip, coins_view, tx)};
210 [ - + ]: 32499 : if (!prev_heights.has_value()) return std::nullopt;
211 : :
212 : 32499 : CBlockIndex next_tip;
213 : 32499 : next_tip.pprev = tip;
214 : : // When SequenceLocks() is called within ConnectBlock(), the height
215 : : // of the block *being* evaluated is what is used.
216 : : // Thus if we want to know if a transaction can be part of the
217 : : // *next* block, we need to use one more than active_chainstate.m_chain.Height()
218 : 32499 : next_tip.nHeight = tip->nHeight + 1;
219 [ + - + - : 32499 : const auto [min_height, min_time] = CalculateSequenceLocks(tx, STANDARD_LOCKTIME_VERIFY_FLAGS, prev_heights.value(), next_tip);
+ - ]
220 : :
221 : : // Also store the hash of the block with the highest height of
222 : : // all the blocks which have sequence locked prevouts.
223 : : // This hash needs to still be on the chain
224 : : // for these LockPoint calculations to be valid
225 : : // Note: It is impossible to correctly calculate a maxInputBlock
226 : : // if any of the sequence locked inputs depend on unconfirmed txs,
227 : : // except in the special case where the relative lock time/height
228 : : // is 0, which is equivalent to no sequence lock. Since we assume
229 : : // input height of tip+1 for mempool txs and test the resulting
230 : : // min_height and min_time from CalculateSequenceLocks against tip+1.
231 : 32499 : int max_input_height{0};
232 [ + - + + ]: 91834 : for (const int height : prev_heights.value()) {
233 : : // Can ignore mempool inputs since we'll fail if they had non-zero locks
234 [ + + ]: 59335 : if (height != next_tip.nHeight) {
235 [ + + ]: 73291 : max_input_height = std::max(max_input_height, height);
236 : : }
237 : : }
238 : :
239 : : // tip->GetAncestor(max_input_height) should never return a nullptr
240 : : // because max_input_height is always less than the tip height.
241 : : // It would, however, be a bad bug to continue execution, since a
242 : : // LockPoints object with the maxInputBlock member set to nullptr
243 : : // signifies no relative lock time.
244 [ + - + - ]: 32499 : return LockPoints{min_height, min_time, Assert(tip->GetAncestor(max_input_height))};
245 : 32499 : }
246 : :
247 : 33528 : bool CheckSequenceLocksAtTip(CBlockIndex* tip,
248 : : const LockPoints& lock_points)
249 : : {
250 [ - + ]: 33528 : assert(tip != nullptr);
251 : :
252 : 33528 : CBlockIndex index;
253 : 33528 : index.pprev = tip;
254 : : // CheckSequenceLocksAtTip() uses active_chainstate.m_chain.Height()+1 to evaluate
255 : : // height based locks because when SequenceLocks() is called within
256 : : // ConnectBlock(), the height of the block *being*
257 : : // evaluated is what is used.
258 : : // Thus if we want to know if a transaction can be part of the
259 : : // *next* block, we need to use one more than active_chainstate.m_chain.Height()
260 : 33528 : index.nHeight = tip->nHeight + 1;
261 : :
262 : 33528 : return EvaluateSequenceLocks(index, {lock_points.height, lock_points.time});
263 : : }
264 : :
265 : : // Returns the script flags which should be checked for a given block
266 : : static unsigned int GetBlockScriptFlags(const CBlockIndex& block_index, const ChainstateManager& chainman);
267 : :
268 : 25860 : static void LimitMempoolSize(CTxMemPool& pool, CCoinsViewCache& coins_cache)
269 : : EXCLUSIVE_LOCKS_REQUIRED(::cs_main, pool.cs)
270 : : {
271 : 25860 : AssertLockHeld(::cs_main);
272 : 25860 : AssertLockHeld(pool.cs);
273 : 25860 : int expired = pool.Expire(GetTime<std::chrono::seconds>() - pool.m_opts.expiry);
274 [ + + ]: 25860 : if (expired != 0) {
275 [ + - ]: 3 : LogDebug(BCLog::MEMPOOL, "Expired %i transactions from the memory pool\n", expired);
276 : : }
277 : :
278 : 25860 : std::vector<COutPoint> vNoSpendsRemaining;
279 [ + - ]: 25860 : pool.TrimToSize(pool.m_opts.max_size_bytes, &vNoSpendsRemaining);
280 [ + + ]: 25911 : for (const COutPoint& removed : vNoSpendsRemaining)
281 [ + - ]: 51 : coins_cache.Uncache(removed);
282 : 25860 : }
283 : :
284 : 23511 : static bool IsCurrentForFeeEstimation(Chainstate& active_chainstate) EXCLUSIVE_LOCKS_REQUIRED(cs_main)
285 : : {
286 : 23511 : AssertLockHeld(cs_main);
287 [ + + ]: 23511 : if (active_chainstate.m_chainman.IsInitialBlockDownload()) {
288 : : return false;
289 : : }
290 [ - + + + ]: 46886 : if (active_chainstate.m_chain.Tip()->GetBlockTime() < count_seconds(GetTime<std::chrono::seconds>() - MAX_FEE_ESTIMATION_TIP_AGE))
291 : : return false;
292 [ - + + + ]: 23245 : if (active_chainstate.m_chain.Height() < active_chainstate.m_chainman.m_best_header->nHeight - 1) {
293 : 58 : return false;
294 : : }
295 : : return true;
296 : : }
297 : :
298 : 3081 : void Chainstate::MaybeUpdateMempoolForReorg(
299 : : DisconnectedBlockTransactions& disconnectpool,
300 : : bool fAddToMempool)
301 : : {
302 [ + + ]: 3081 : if (!m_mempool) return;
303 : :
304 : 3080 : AssertLockHeld(cs_main);
305 : 3080 : AssertLockHeld(m_mempool->cs);
306 : 3080 : std::vector<Txid> vHashUpdate;
307 : 3080 : {
308 : : // disconnectpool is ordered so that the front is the most recently-confirmed
309 : : // transaction (the last tx of the block at the tip) in the disconnected chain.
310 : : // Iterate disconnectpool in reverse, so that we add transactions
311 : : // back to the mempool starting with the earliest transaction that had
312 : : // been previously seen in a block.
313 [ + - ]: 3080 : const auto queuedTx = disconnectpool.take();
314 : 3080 : auto it = queuedTx.rbegin();
315 [ + + ]: 18084 : while (it != queuedTx.rend()) {
316 : : // ignore validation errors in resurrected transactions
317 [ + + + + : 19308 : if (!fAddToMempool || (*it)->IsCoinBase() ||
+ + ]
318 [ + - + - ]: 8608 : AcceptToMemoryPool(*this, *it, GetTime(),
319 [ + + ]: 4304 : /*bypass_limits=*/true, /*test_accept=*/false).m_result_type !=
320 : : MempoolAcceptResult::ResultType::VALID) {
321 : : // If the transaction doesn't make it in to the mempool, remove any
322 : : // transactions that depend on it (which would now be orphans).
323 [ + - ]: 14351 : m_mempool->removeRecursive(**it, MemPoolRemovalReason::REORG);
324 [ + - + - ]: 653 : } else if (m_mempool->exists((*it)->GetHash())) {
325 [ + - ]: 653 : vHashUpdate.push_back((*it)->GetHash());
326 : : }
327 : 15004 : ++it;
328 : : }
329 : 0 : }
330 : :
331 : : // AcceptToMemoryPool/addNewTransaction all assume that new mempool entries have
332 : : // no in-mempool children, which is generally not true when adding
333 : : // previously-confirmed transactions back to the mempool.
334 : : // UpdateTransactionsFromBlock finds descendants of any transactions in
335 : : // the disconnectpool that were added back and cleans up the mempool state.
336 [ + - ]: 3080 : m_mempool->UpdateTransactionsFromBlock(vHashUpdate);
337 : :
338 : : // Predicate to use for filtering transactions in removeForReorg.
339 : : // Checks whether the transaction is still final and, if it spends a coinbase output, mature.
340 : : // Also updates valid entries' cached LockPoints if needed.
341 : : // If false, the tx is still valid and its lockpoints are updated.
342 : : // If true, the tx would be invalid in the next block; remove this entry and all of its descendants.
343 : : // Note that TRUC rules are not applied here, so reorgs may cause violations of TRUC inheritance or
344 : : // topology restrictions.
345 : 4351 : const auto filter_final_and_mature = [&](CTxMemPool::txiter it)
346 : : EXCLUSIVE_LOCKS_REQUIRED(m_mempool->cs, ::cs_main) {
347 : 1271 : AssertLockHeld(m_mempool->cs);
348 : 1271 : AssertLockHeld(::cs_main);
349 [ - + ]: 1271 : const CTransaction& tx = it->GetTx();
350 : :
351 : : // The transaction must be final.
352 [ - + + + ]: 2542 : if (!CheckFinalTxAtTip(*Assert(m_chain.Tip()), tx)) return true;
353 : :
354 : 1268 : const LockPoints& lp = it->GetLockPoints();
355 : : // CheckSequenceLocksAtTip checks if the transaction will be final in the next block to be
356 : : // created on top of the new chain.
357 [ + + ]: 1268 : if (TestLockPointValidity(m_chain, lp)) {
358 [ - + + + ]: 2058 : if (!CheckSequenceLocksAtTip(m_chain.Tip(), lp)) {
359 : : return true;
360 : : }
361 : : } else {
362 : 476 : const CCoinsViewMemPool view_mempool{&CoinsTip(), *m_mempool};
363 [ - + + - ]: 478 : const std::optional<LockPoints> new_lock_points{CalculateLockPointsAtTip(m_chain.Tip(), view_mempool, tx)};
364 [ + - - + : 478 : if (new_lock_points.has_value() && CheckSequenceLocksAtTip(m_chain.Tip(), *new_lock_points)) {
+ - + + ]
365 : : // Now update the mempool entry lockpoints as well.
366 : 237 : it->UpdateLockPoints(*new_lock_points);
367 : : } else {
368 : 2 : return true;
369 : : }
370 : 239 : }
371 : :
372 : : // If the transaction spends any coinbase outputs, it must be mature.
373 [ + + ]: 1261 : if (it->GetSpendsCoinbase()) {
374 [ + + ]: 843 : for (const CTxIn& txin : tx.vin) {
375 [ - + ]: 428 : if (m_mempool->exists(txin.prevout.hash)) continue;
376 : 428 : const Coin& coin{CoinsTip().AccessCoin(txin.prevout)};
377 [ - + ]: 428 : assert(!coin.IsSpent());
378 [ - + ]: 428 : const auto mempool_spend_height{m_chain.Tip()->nHeight + 1};
379 [ + + + + ]: 428 : if (coin.IsCoinBase() && mempool_spend_height - coin.nHeight < COINBASE_MATURITY) {
380 : : return true;
381 : : }
382 : : }
383 : : }
384 : : // Transaction is still valid and cached LockPoints are updated.
385 : : return false;
386 : 3080 : };
387 : :
388 : : // We also need to remove any now-immature transactions
389 [ + - ]: 3080 : m_mempool->removeForReorg(m_chain, filter_final_and_mature);
390 : : // Re-limit mempool size, in case we added any transactions
391 [ + - + - ]: 3080 : LimitMempoolSize(*m_mempool, this->CoinsTip());
392 : 3080 : }
393 : :
394 : : /**
395 : : * Checks to avoid mempool polluting consensus critical paths since cached
396 : : * signature and script validity results will be reused if we validate this
397 : : * transaction again during block validation.
398 : : * */
399 : 28661 : static bool CheckInputsFromMempoolAndCache(const CTransaction& tx, TxValidationState& state,
400 : : const CCoinsViewCache& view, const CTxMemPool& pool,
401 : : unsigned int flags, PrecomputedTransactionData& txdata, CCoinsViewCache& coins_tip,
402 : : ValidationCache& validation_cache)
403 : : EXCLUSIVE_LOCKS_REQUIRED(cs_main, pool.cs)
404 : : {
405 : 28661 : AssertLockHeld(cs_main);
406 : 28661 : AssertLockHeld(pool.cs);
407 : :
408 [ - + ]: 28661 : assert(!tx.IsCoinBase());
409 [ + + ]: 76674 : for (const CTxIn& txin : tx.vin) {
410 : 48013 : const Coin& coin = view.AccessCoin(txin.prevout);
411 : :
412 : : // This coin was checked in PreChecks and MemPoolAccept
413 : : // has been holding cs_main since then.
414 [ + - ]: 48013 : Assume(!coin.IsSpent());
415 [ + - ]: 48013 : if (coin.IsSpent()) return false;
416 : :
417 : : // If the Coin is available, there are 2 possibilities:
418 : : // it is available in our current ChainstateActive UTXO set,
419 : : // or it's a UTXO provided by a transaction in our mempool.
420 : : // Ensure the scriptPubKeys in Coins from CoinsView are correct.
421 : 48013 : const CTransactionRef& txFrom = pool.get(txin.prevout.hash);
422 [ + + ]: 48013 : if (txFrom) {
423 [ - + ]: 8347 : assert(txFrom->GetHash() == txin.prevout.hash);
424 [ - + - + ]: 8347 : assert(txFrom->vout.size() > txin.prevout.n);
425 [ - + ]: 8347 : assert(txFrom->vout[txin.prevout.n] == coin.out);
426 : : } else {
427 [ + - ]: 39666 : const Coin& coinFromUTXOSet = coins_tip.AccessCoin(txin.prevout);
428 [ - + ]: 39666 : assert(!coinFromUTXOSet.IsSpent());
429 [ - + ]: 39666 : assert(coinFromUTXOSet.out == coin.out);
430 : : }
431 : 48013 : }
432 : :
433 : : // Call CheckInputScripts() to cache signature and script validity against current tip consensus rules.
434 : 28661 : return CheckInputScripts(tx, state, view, flags, /* cacheSigStore= */ true, /* cacheFullScriptStore= */ true, txdata, validation_cache);
435 : : }
436 : :
437 : : namespace {
438 : :
439 : : class MemPoolAccept
440 : : {
441 : : public:
442 : 37904 : explicit MemPoolAccept(CTxMemPool& mempool, Chainstate& active_chainstate) :
443 : 37904 : m_pool(mempool),
444 : 37904 : m_view(&m_dummy),
445 [ + - + - ]: 37904 : m_viewmempool(&active_chainstate.CoinsTip(), m_pool),
446 : 37904 : m_active_chainstate(active_chainstate)
447 : : {
448 : 37904 : }
449 : :
450 : : // We put the arguments we're handed into a struct, so we can pass them
451 : : // around easier.
452 : : struct ATMPArgs {
453 : : const CChainParams& m_chainparams;
454 : : const int64_t m_accept_time;
455 : : const bool m_bypass_limits;
456 : : /*
457 : : * Return any outpoints which were not previously present in the coins
458 : : * cache, but were added as a result of validating the tx for mempool
459 : : * acceptance. This allows the caller to optionally remove the cache
460 : : * additions if the associated transaction ends up being rejected by
461 : : * the mempool.
462 : : */
463 : : std::vector<COutPoint>& m_coins_to_uncache;
464 : : /** When true, the transaction or package will not be submitted to the mempool. */
465 : : const bool m_test_accept;
466 : : /** Whether we allow transactions to replace mempool transactions. If false,
467 : : * any transaction spending the same inputs as a transaction in the mempool is considered
468 : : * a conflict. */
469 : : const bool m_allow_replacement;
470 : : /** When true, allow sibling eviction. This only occurs in single transaction package settings. */
471 : : const bool m_allow_sibling_eviction;
472 : : /** Used to skip the LimitMempoolSize() call within AcceptSingleTransaction(). This should be used when multiple
473 : : * AcceptSubPackage calls are expected and the mempool will be trimmed at the end of AcceptPackage(). */
474 : : const bool m_package_submission;
475 : : /** When true, use package feerates instead of individual transaction feerates for fee-based
476 : : * policies such as mempool min fee and min relay fee.
477 : : */
478 : : const bool m_package_feerates;
479 : : /** Used for local submission of transactions to catch "absurd" fees
480 : : * due to fee miscalculation by wallets. std:nullopt implies unset, allowing any feerates.
481 : : * Any individual transaction failing this check causes immediate failure.
482 : : */
483 : : const std::optional<CFeeRate> m_client_maxfeerate;
484 : :
485 : : /** Whether CPFP carveout and RBF carveout are granted. */
486 : : const bool m_allow_carveouts;
487 : :
488 : : /** Parameters for single transaction mempool validation. */
489 : 37650 : static ATMPArgs SingleAccept(const CChainParams& chainparams, int64_t accept_time,
490 : : bool bypass_limits, std::vector<COutPoint>& coins_to_uncache,
491 : : bool test_accept) {
492 : 37650 : return ATMPArgs{/* m_chainparams */ chainparams,
493 : : /* m_accept_time */ accept_time,
494 : : /* m_bypass_limits */ bypass_limits,
495 : : /* m_coins_to_uncache */ coins_to_uncache,
496 : : /* m_test_accept */ test_accept,
497 : : /* m_allow_replacement */ true,
498 : : /* m_allow_sibling_eviction */ true,
499 : : /* m_package_submission */ false,
500 : : /* m_package_feerates */ false,
501 : : /* m_client_maxfeerate */ {}, // checked by caller
502 : : /* m_allow_carveouts */ true,
503 : 37650 : };
504 : : }
505 : :
506 : : /** Parameters for test package mempool validation through testmempoolaccept. */
507 : 87 : static ATMPArgs PackageTestAccept(const CChainParams& chainparams, int64_t accept_time,
508 : : std::vector<COutPoint>& coins_to_uncache) {
509 : 87 : return ATMPArgs{/* m_chainparams */ chainparams,
510 : : /* m_accept_time */ accept_time,
511 : : /* m_bypass_limits */ false,
512 : : /* m_coins_to_uncache */ coins_to_uncache,
513 : : /* m_test_accept */ true,
514 : : /* m_allow_replacement */ false,
515 : : /* m_allow_sibling_eviction */ false,
516 : : /* m_package_submission */ false, // not submitting to mempool
517 : : /* m_package_feerates */ false,
518 : : /* m_client_maxfeerate */ {}, // checked by caller
519 : : /* m_allow_carveouts */ false,
520 : 87 : };
521 : : }
522 : :
523 : : /** Parameters for child-with-parents package validation. */
524 : 167 : static ATMPArgs PackageChildWithParents(const CChainParams& chainparams, int64_t accept_time,
525 : : std::vector<COutPoint>& coins_to_uncache, const std::optional<CFeeRate>& client_maxfeerate) {
526 : 167 : return ATMPArgs{/* m_chainparams */ chainparams,
527 : : /* m_accept_time */ accept_time,
528 : : /* m_bypass_limits */ false,
529 : : /* m_coins_to_uncache */ coins_to_uncache,
530 : : /* m_test_accept */ false,
531 : : /* m_allow_replacement */ true,
532 : : /* m_allow_sibling_eviction */ false,
533 : : /* m_package_submission */ true,
534 : : /* m_package_feerates */ true,
535 : : /* m_client_maxfeerate */ client_maxfeerate,
536 : : /* m_allow_carveouts */ false,
537 : 167 : };
538 : : }
539 : :
540 : : /** Parameters for a single transaction within a package. */
541 : 369 : static ATMPArgs SingleInPackageAccept(const ATMPArgs& package_args) {
542 : 369 : return ATMPArgs{/* m_chainparams */ package_args.m_chainparams,
543 : 369 : /* m_accept_time */ package_args.m_accept_time,
544 : : /* m_bypass_limits */ false,
545 : : /* m_coins_to_uncache */ package_args.m_coins_to_uncache,
546 : 369 : /* m_test_accept */ package_args.m_test_accept,
547 : : /* m_allow_replacement */ true,
548 : : /* m_allow_sibling_eviction */ true,
549 : : /* m_package_submission */ true, // trim at the end of AcceptPackage()
550 : : /* m_package_feerates */ false, // only 1 transaction
551 : : /* m_client_maxfeerate */ package_args.m_client_maxfeerate,
552 : : /* m_allow_carveouts */ false,
553 : 369 : };
554 : : }
555 : :
556 : : private:
557 : : // Private ctor to avoid exposing details to clients and allowing the possibility of
558 : : // mixing up the order of the arguments. Use static functions above instead.
559 : 38273 : ATMPArgs(const CChainParams& chainparams,
560 : : int64_t accept_time,
561 : : bool bypass_limits,
562 : : std::vector<COutPoint>& coins_to_uncache,
563 : : bool test_accept,
564 : : bool allow_replacement,
565 : : bool allow_sibling_eviction,
566 : : bool package_submission,
567 : : bool package_feerates,
568 : : std::optional<CFeeRate> client_maxfeerate,
569 : : bool allow_carveouts)
570 : 38273 : : m_chainparams{chainparams},
571 : 38273 : m_accept_time{accept_time},
572 : 38273 : m_bypass_limits{bypass_limits},
573 : 38273 : m_coins_to_uncache{coins_to_uncache},
574 : 38273 : m_test_accept{test_accept},
575 : 38273 : m_allow_replacement{allow_replacement},
576 : 38273 : m_allow_sibling_eviction{allow_sibling_eviction},
577 : 38273 : m_package_submission{package_submission},
578 : 38273 : m_package_feerates{package_feerates},
579 : 38273 : m_client_maxfeerate{client_maxfeerate},
580 : 38273 : m_allow_carveouts{allow_carveouts}
581 : : {
582 : : // If we are using package feerates, we must be doing package submission.
583 : : // It also means carveouts and sibling eviction are not permitted.
584 : 38273 : if (m_package_feerates) {
585 : 38273 : Assume(m_package_submission);
586 : 38273 : Assume(!m_allow_carveouts);
587 : 38273 : Assume(!m_allow_sibling_eviction);
588 : : }
589 : 38273 : if (m_allow_sibling_eviction) Assume(m_allow_replacement);
590 : : }
591 : : };
592 : :
593 : : /** Clean up all non-chainstate coins from m_view and m_viewmempool. */
594 : : void CleanupTemporaryCoins() EXCLUSIVE_LOCKS_REQUIRED(cs_main, m_pool.cs);
595 : :
596 : : // Single transaction acceptance
597 : : MempoolAcceptResult AcceptSingleTransaction(const CTransactionRef& ptx, ATMPArgs& args) EXCLUSIVE_LOCKS_REQUIRED(cs_main);
598 : :
599 : : /**
600 : : * Multiple transaction acceptance. Transactions may or may not be interdependent, but must not
601 : : * conflict with each other, and the transactions cannot already be in the mempool. Parents must
602 : : * come before children if any dependencies exist.
603 : : */
604 : : PackageMempoolAcceptResult AcceptMultipleTransactions(const std::vector<CTransactionRef>& txns, ATMPArgs& args) EXCLUSIVE_LOCKS_REQUIRED(cs_main);
605 : :
606 : : /**
607 : : * Submission of a subpackage.
608 : : * If subpackage size == 1, calls AcceptSingleTransaction() with adjusted ATMPArgs to avoid
609 : : * package policy restrictions like no CPFP carve out (PackageMempoolChecks)
610 : : * and creates a PackageMempoolAcceptResult wrapping the result.
611 : : *
612 : : * If subpackage size > 1, calls AcceptMultipleTransactions() with the provided ATMPArgs.
613 : : *
614 : : * Also cleans up all non-chainstate coins from m_view at the end.
615 : : */
616 : : PackageMempoolAcceptResult AcceptSubPackage(const std::vector<CTransactionRef>& subpackage, ATMPArgs& args)
617 : : EXCLUSIVE_LOCKS_REQUIRED(cs_main, m_pool.cs);
618 : :
619 : : /**
620 : : * Package (more specific than just multiple transactions) acceptance. Package must be a child
621 : : * with all of its unconfirmed parents, and topologically sorted.
622 : : */
623 : : PackageMempoolAcceptResult AcceptPackage(const Package& package, ATMPArgs& args) EXCLUSIVE_LOCKS_REQUIRED(cs_main);
624 : :
625 : : private:
626 : : // All the intermediate state that gets passed between the various levels
627 : : // of checking a given transaction.
628 : : struct Workspace {
629 : 38863 : explicit Workspace(const CTransactionRef& ptx) : m_ptx(ptx), m_hash(ptx->GetHash()) {}
630 : : /** Txids of mempool transactions that this transaction directly conflicts with or may
631 : : * replace via sibling eviction. */
632 : : std::set<Txid> m_conflicts;
633 : : /** Iterators to mempool entries that this transaction directly conflicts with or may
634 : : * replace via sibling eviction. */
635 : : CTxMemPool::setEntries m_iters_conflicting;
636 : : /** All mempool ancestors of this transaction. */
637 : : CTxMemPool::setEntries m_ancestors;
638 : : /* Handle to the tx in the changeset */
639 : : CTxMemPool::ChangeSet::TxHandle m_tx_handle;
640 : : /** Whether RBF-related data structures (m_conflicts, m_iters_conflicting,
641 : : * m_replaced_transactions) include a sibling in addition to txns with conflicting inputs. */
642 : : bool m_sibling_eviction{false};
643 : :
644 : : /** Virtual size of the transaction as used by the mempool, calculated using serialized size
645 : : * of the transaction and sigops. */
646 : : int64_t m_vsize;
647 : : /** Fees paid by this transaction: total input amounts subtracted by total output amounts. */
648 : : CAmount m_base_fees;
649 : : /** Base fees + any fee delta set by the user with prioritisetransaction. */
650 : : CAmount m_modified_fees;
651 : :
652 : : /** If we're doing package validation (i.e. m_package_feerates=true), the "effective"
653 : : * package feerate of this transaction is the total fees divided by the total size of
654 : : * transactions (which may include its ancestors and/or descendants). */
655 : : CFeeRate m_package_feerate{0};
656 : :
657 : : const CTransactionRef& m_ptx;
658 : : /** Txid. */
659 : : const Txid& m_hash;
660 : : TxValidationState m_state;
661 : : /** A temporary cache containing serialized transaction data for signature verification.
662 : : * Reused across PolicyScriptChecks and ConsensusScriptChecks. */
663 : : PrecomputedTransactionData m_precomputed_txdata;
664 : : };
665 : :
666 : : // Run the policy checks on a given transaction, excluding any script checks.
667 : : // Looks up inputs, calculates feerate, considers replacement, evaluates
668 : : // package limits, etc. As this function can be invoked for "free" by a peer,
669 : : // only tests that are fast should be done here (to avoid CPU DoS).
670 : : bool PreChecks(ATMPArgs& args, Workspace& ws) EXCLUSIVE_LOCKS_REQUIRED(cs_main, m_pool.cs);
671 : :
672 : : // Run checks for mempool replace-by-fee, only used in AcceptSingleTransaction.
673 : : bool ReplacementChecks(Workspace& ws) EXCLUSIVE_LOCKS_REQUIRED(cs_main, m_pool.cs);
674 : :
675 : : // Enforce package mempool ancestor/descendant limits (distinct from individual
676 : : // ancestor/descendant limits done in PreChecks) and run Package RBF checks.
677 : : bool PackageMempoolChecks(const std::vector<CTransactionRef>& txns,
678 : : std::vector<Workspace>& workspaces,
679 : : int64_t total_vsize,
680 : : PackageValidationState& package_state) EXCLUSIVE_LOCKS_REQUIRED(cs_main, m_pool.cs);
681 : :
682 : : // Run the script checks using our policy flags. As this can be slow, we should
683 : : // only invoke this on transactions that have otherwise passed policy checks.
684 : : bool PolicyScriptChecks(const ATMPArgs& args, Workspace& ws) EXCLUSIVE_LOCKS_REQUIRED(cs_main, m_pool.cs);
685 : :
686 : : // Re-run the script checks, using consensus flags, and try to cache the
687 : : // result in the scriptcache. This should be done after
688 : : // PolicyScriptChecks(). This requires that all inputs either be in our
689 : : // utxo set or in the mempool.
690 : : bool ConsensusScriptChecks(const ATMPArgs& args, Workspace& ws) EXCLUSIVE_LOCKS_REQUIRED(cs_main, m_pool.cs);
691 : :
692 : : // Try to add the transaction to the mempool, removing any conflicts first.
693 : : void FinalizeSubpackage(const ATMPArgs& args) EXCLUSIVE_LOCKS_REQUIRED(cs_main, m_pool.cs);
694 : :
695 : : // Submit all transactions to the mempool and call ConsensusScriptChecks to add to the script
696 : : // cache - should only be called after successful validation of all transactions in the package.
697 : : // Does not call LimitMempoolSize(), so mempool max_size_bytes may be temporarily exceeded.
698 : : bool SubmitPackage(const ATMPArgs& args, std::vector<Workspace>& workspaces, PackageValidationState& package_state,
699 : : std::map<Wtxid, MempoolAcceptResult>& results)
700 : : EXCLUSIVE_LOCKS_REQUIRED(cs_main, m_pool.cs);
701 : :
702 : : // Compare a package's feerate against minimum allowed.
703 : 30650 : bool CheckFeeRate(size_t package_size, CAmount package_fee, TxValidationState& state) EXCLUSIVE_LOCKS_REQUIRED(::cs_main, m_pool.cs)
704 : : {
705 : 30650 : AssertLockHeld(::cs_main);
706 : 30650 : AssertLockHeld(m_pool.cs);
707 : 30650 : CAmount mempoolRejectFee = m_pool.GetMinFee().GetFee(package_size);
708 [ + + + + ]: 30650 : if (mempoolRejectFee > 0 && package_fee < mempoolRejectFee) {
709 [ + - + - ]: 60 : return state.Invalid(TxValidationResult::TX_RECONSIDERABLE, "mempool min fee not met", strprintf("%d < %d", package_fee, mempoolRejectFee));
710 : : }
711 : :
712 [ + + ]: 30590 : if (package_fee < m_pool.m_opts.min_relay_feerate.GetFee(package_size)) {
713 [ + - + - ]: 55 : return state.Invalid(TxValidationResult::TX_RECONSIDERABLE, "min relay fee not met",
714 : 110 : strprintf("%d < %d", package_fee, m_pool.m_opts.min_relay_feerate.GetFee(package_size)));
715 : : }
716 : : return true;
717 : : }
718 : :
719 : 59537 : ValidationCache& GetValidationCache()
720 : : {
721 : 59537 : return m_active_chainstate.m_chainman.m_validation_cache;
722 : : }
723 : :
724 : : private:
725 : : CTxMemPool& m_pool;
726 : :
727 : : /** Holds a cached view of available coins from the UTXO set, mempool, and artificial temporary coins (to enable package validation).
728 : : * The view doesn't track whether a coin previously existed but has now been spent. We detect conflicts in other ways:
729 : : * - conflicts within a transaction are checked in CheckTransaction (bad-txns-inputs-duplicate)
730 : : * - conflicts within a package are checked in IsWellFormedPackage (conflict-in-package)
731 : : * - conflicts with an existing mempool transaction are found in CTxMemPool::GetConflictTx and replacements are allowed
732 : : * The temporary coins should persist between individual transaction checks so that package validation is possible,
733 : : * but must be cleaned up when we finish validating a subpackage, whether accepted or rejected. The cache must also
734 : : * be cleared when mempool contents change (when a changeset is applied or when the mempool trims itself) because it
735 : : * can return cached coins that no longer exist in the backend. Use CleanupTemporaryCoins() anytime you are finished
736 : : * with a SubPackageState or call LimitMempoolSize().
737 : : */
738 : : CCoinsViewCache m_view;
739 : :
740 : : // These are the two possible backends for m_view.
741 : : /** When m_view is connected to m_viewmempool as its backend, it can pull coins from the mempool and from the UTXO
742 : : * set. This is also where temporary coins are stored. */
743 : : CCoinsViewMemPool m_viewmempool;
744 : : /** When m_view is connected to m_dummy, it can no longer look up coins from the mempool or UTXO set (meaning no disk
745 : : * operations happen), but can still return coins it accessed previously. Useful for keeping track of which coins
746 : : * were pulled from disk. */
747 : : CCoinsView m_dummy;
748 : :
749 : : Chainstate& m_active_chainstate;
750 : :
751 : : // Fields below are per *sub*package state and must be reset prior to subsequent
752 : : // AcceptSingleTransaction and AcceptMultipleTransactions invocations
753 : 38529 : struct SubPackageState {
754 : : /** Aggregated modified fees of all transactions, used to calculate package feerate. */
755 : : CAmount m_total_modified_fees{0};
756 : : /** Aggregated virtual size of all transactions, used to calculate package feerate. */
757 : : int64_t m_total_vsize{0};
758 : :
759 : : // RBF-related members
760 : : /** Whether the transaction(s) would replace any mempool transactions and/or evict any siblings.
761 : : * If so, RBF rules apply. */
762 : : bool m_rbf{false};
763 : : /** Mempool transactions that were replaced. */
764 : : std::list<CTransactionRef> m_replaced_transactions;
765 : : /* Changeset representing adding transactions and removing their conflicts. */
766 : : std::unique_ptr<CTxMemPool::ChangeSet> m_changeset;
767 : :
768 : : /** Total modified fees of mempool transactions being replaced. */
769 : : CAmount m_conflicting_fees{0};
770 : : /** Total size (in virtual bytes) of mempool transactions being replaced. */
771 : : size_t m_conflicting_size{0};
772 : : };
773 : :
774 : : struct SubPackageState m_subpackage;
775 : :
776 : : /** Re-set sub-package state to not leak between evaluations */
777 : 625 : void ClearSubPackageState() EXCLUSIVE_LOCKS_REQUIRED(cs_main, m_pool.cs)
778 : : {
779 : 625 : m_subpackage = SubPackageState{};
780 : :
781 : : // And clean coins while at it
782 : 625 : CleanupTemporaryCoins();
783 : 625 : }
784 : : };
785 : :
786 : 38827 : bool MemPoolAccept::PreChecks(ATMPArgs& args, Workspace& ws)
787 : : {
788 : 38827 : AssertLockHeld(cs_main);
789 : 38827 : AssertLockHeld(m_pool.cs);
790 : 38827 : const CTransactionRef& ptx = ws.m_ptx;
791 : 38827 : const CTransaction& tx = *ws.m_ptx;
792 : 38827 : const Txid& hash = ws.m_hash;
793 : :
794 : : // Copy/alias what we need out of args
795 : 38827 : const int64_t nAcceptTime = args.m_accept_time;
796 : 38827 : const bool bypass_limits = args.m_bypass_limits;
797 : 38827 : std::vector<COutPoint>& coins_to_uncache = args.m_coins_to_uncache;
798 : :
799 : : // Alias what we need out of ws
800 : 38827 : TxValidationState& state = ws.m_state;
801 : :
802 [ + + ]: 38827 : if (!CheckTransaction(tx, state)) {
803 : : return false; // state filled in by CheckTransaction
804 : : }
805 : :
806 : : // Coinbase is only valid in a block, not as a loose transaction
807 [ + + ]: 38806 : if (tx.IsCoinBase())
808 [ + - + - ]: 2 : return state.Invalid(TxValidationResult::TX_CONSENSUS, "coinbase");
809 : :
810 : : // Rather not work on nonstandard transactions (unless -testnet/-regtest)
811 [ + + ]: 38804 : std::string reason;
812 [ + + + - : 38804 : if (m_pool.m_opts.require_standard && !IsStandardTx(tx, m_pool.m_opts.max_datacarrier_bytes, m_pool.m_opts.permit_bare_multisig, m_pool.m_opts.dust_relay_feerate, reason)) {
+ + ]
813 [ + - + - ]: 2154 : return state.Invalid(TxValidationResult::TX_NOT_STANDARD, reason);
814 : : }
815 : :
816 : : // Transactions smaller than 65 non-witness bytes are not relayed to mitigate CVE-2017-12842.
817 [ + + ]: 36650 : if (::GetSerializeSize(TX_NO_WITNESS(tx)) < MIN_STANDARD_TX_NONWITNESS_SIZE)
818 [ + - + - : 6 : return state.Invalid(TxValidationResult::TX_NOT_STANDARD, "tx-size-small");
+ - ]
819 : :
820 : : // Only accept nLockTime-using transactions that can be mined in the next
821 : : // block; we don't want our mempool filled up with transactions that can't
822 : : // be mined yet.
823 [ - + + - : 73288 : if (!CheckFinalTxAtTip(*Assert(m_active_chainstate.m_chain.Tip()), tx)) {
+ - + + ]
824 [ + - + - : 26 : return state.Invalid(TxValidationResult::TX_PREMATURE_SPEND, "non-final");
+ - ]
825 : : }
826 : :
827 [ + - + + ]: 36618 : if (m_pool.exists(tx.GetWitnessHash())) {
828 : : // Exact transaction already exists in the mempool.
829 [ + - + - : 20 : return state.Invalid(TxValidationResult::TX_CONFLICT, "txn-already-in-mempool");
+ - ]
830 [ + - + + ]: 36598 : } else if (m_pool.exists(tx.GetHash())) {
831 : : // Transaction with the same non-witness data but different witness (same txid, different
832 : : // wtxid) already exists in the mempool.
833 [ + - + - : 4 : return state.Invalid(TxValidationResult::TX_CONFLICT, "txn-same-nonwitness-data-in-mempool");
+ - ]
834 : : }
835 : :
836 : : // Check for conflicts with in-memory transactions
837 [ + + ]: 101272 : for (const CTxIn &txin : tx.vin)
838 : : {
839 [ + - ]: 64680 : const CTransaction* ptxConflicting = m_pool.GetConflictTx(txin.prevout);
840 [ + + ]: 64680 : if (ptxConflicting) {
841 [ + + ]: 2019 : if (!args.m_allow_replacement) {
842 : : // Transaction conflicts with a mempool tx, but we're not allowing replacements in this context.
843 [ + - + - : 2 : return state.Invalid(TxValidationResult::TX_MEMPOOL_POLICY, "bip125-replacement-disallowed");
+ - ]
844 : : }
845 [ + - ]: 2017 : ws.m_conflicts.insert(ptxConflicting->GetHash());
846 : : }
847 : : }
848 : :
849 [ + - ]: 36592 : m_view.SetBackend(m_viewmempool);
850 : :
851 [ + - ]: 36592 : const CCoinsViewCache& coins_cache = m_active_chainstate.CoinsTip();
852 : : // do all inputs exist?
853 [ + + ]: 93544 : for (const CTxIn& txin : tx.vin) {
854 [ + - + + ]: 61292 : if (!coins_cache.HaveCoinInCache(txin.prevout)) {
855 [ + - ]: 21322 : coins_to_uncache.push_back(txin.prevout);
856 : : }
857 : :
858 : : // Note: this call may add txin.prevout to the coins cache
859 : : // (coins_cache.cacheCoins) by way of FetchCoin(). It should be removed
860 : : // later (via coins_to_uncache) if this tx turns out to be invalid.
861 [ + - + + ]: 61292 : if (!m_view.HaveCoin(txin.prevout)) {
862 : : // Are inputs missing because we already have the tx?
863 [ - + + + ]: 9034 : for (size_t out = 0; out < tx.vout.size(); out++) {
864 : : // Optimistically just do efficient check of cache for outputs
865 [ + - + + ]: 4698 : if (coins_cache.HaveCoinInCache(COutPoint(hash, out))) {
866 [ + - + - : 4 : return state.Invalid(TxValidationResult::TX_CONFLICT, "txn-already-known");
+ - ]
867 : : }
868 : : }
869 : : // Otherwise assume this might be an orphan tx for which we just haven't seen parents yet
870 [ + - + - : 4336 : return state.Invalid(TxValidationResult::TX_MISSING_INPUTS, "bad-txns-inputs-missingorspent");
+ - ]
871 : : }
872 : : }
873 : :
874 : : // This is const, but calls into the back end CoinsViews. The CCoinsViewDB at the bottom of the
875 : : // hierarchy brings the best block into scope. See CCoinsViewDB::GetBestBlock().
876 [ + - ]: 32252 : m_view.GetBestBlock();
877 : :
878 : : // we have all inputs cached now, so switch back to dummy (to protect
879 : : // against bugs where we pull more inputs from disk that miss being added
880 : : // to coins_to_uncache)
881 [ + - ]: 32252 : m_view.SetBackend(m_dummy);
882 : :
883 [ + - + - : 64504 : assert(m_active_chainstate.m_blockman.LookupBlockIndex(m_view.GetBestBlock()) == m_active_chainstate.m_chain.Tip());
- + - + ]
884 : :
885 : : // Only accept BIP68 sequence locked transactions that can be mined in the next
886 : : // block; we don't want our mempool filled up with transactions that can't
887 : : // be mined yet.
888 : : // Pass in m_view which has all of the relevant inputs cached. Note that, since m_view's
889 : : // backend was removed, it no longer pulls coins from the mempool.
890 [ + - ]: 32252 : const std::optional<LockPoints> lock_points{CalculateLockPointsAtTip(m_active_chainstate.m_chain.Tip(), m_view, tx)};
891 [ + - - + : 64504 : if (!lock_points.has_value() || !CheckSequenceLocksAtTip(m_active_chainstate.m_chain.Tip(), *lock_points)) {
+ - + + ]
892 [ + - + - : 367 : return state.Invalid(TxValidationResult::TX_PREMATURE_SPEND, "non-BIP68-final");
+ - ]
893 : : }
894 : :
895 : : // The mempool holds txs for the next block, so pass height+1 to CheckTxInputs
896 [ - + + - : 31885 : if (!Consensus::CheckTxInputs(tx, state, m_view, m_active_chainstate.m_chain.Height() + 1, ws.m_base_fees)) {
+ + ]
897 : : return false; // state filled in by CheckTxInputs
898 : : }
899 : :
900 [ + + + - : 31879 : if (m_pool.m_opts.require_standard && !AreInputsStandard(tx, m_view)) {
+ + ]
901 [ + - + - : 189 : return state.Invalid(TxValidationResult::TX_INPUTS_NOT_STANDARD, "bad-txns-nonstandard-inputs");
+ - ]
902 : : }
903 : :
904 : : // Check for non-standard witnesses.
905 [ + + + + : 31690 : if (tx.HasWitness() && m_pool.m_opts.require_standard && !IsWitnessStandard(tx, m_view)) {
+ - + + ]
906 [ + - + - : 129 : return state.Invalid(TxValidationResult::TX_WITNESS_MUTATED, "bad-witness-nonstandard");
+ - ]
907 : : }
908 : :
909 [ + - ]: 31561 : int64_t nSigOpsCost = GetTransactionSigOpCost(tx, m_view, STANDARD_SCRIPT_VERIFY_FLAGS);
910 : :
911 : : // Keep track of transactions that spend a coinbase, which we re-scan
912 : : // during reorgs to ensure COINBASE_MATURITY is still met.
913 : 31561 : bool fSpendsCoinbase = false;
914 [ + + ]: 76131 : for (const CTxIn &txin : tx.vin) {
915 [ + - ]: 50635 : const Coin &coin = m_view.AccessCoin(txin.prevout);
916 [ + + ]: 50635 : if (coin.IsCoinBase()) {
917 : : fSpendsCoinbase = true;
918 : : break;
919 : : }
920 : : }
921 : :
922 : : // Set entry_sequence to 0 when bypass_limits is used; this allows txs from a block
923 : : // reorg to be marked earlier than any child txs that were already in the mempool.
924 [ + + ]: 31561 : const uint64_t entry_sequence = bypass_limits ? 0 : m_pool.GetSequence();
925 [ + + ]: 31561 : if (!m_subpackage.m_changeset) {
926 [ + - ]: 30930 : m_subpackage.m_changeset = m_pool.GetChangeSet();
927 : : }
928 [ + - - + : 31561 : ws.m_tx_handle = m_subpackage.m_changeset->StageAddition(ptx, ws.m_base_fees, nAcceptTime, m_active_chainstate.m_chain.Height(), entry_sequence, fSpendsCoinbase, nSigOpsCost, lock_points.value());
+ - ]
929 : :
930 : : // ws.m_modified_fees includes any fee deltas from PrioritiseTransaction
931 [ + - ]: 31561 : ws.m_modified_fees = ws.m_tx_handle->GetModifiedFee();
932 : :
933 [ + - ]: 31561 : ws.m_vsize = ws.m_tx_handle->GetTxSize();
934 : :
935 : : // Enforces 0-fee for dust transactions, no incentive to be mined alone
936 [ + + ]: 31561 : if (m_pool.m_opts.require_standard) {
937 [ + - + + ]: 30897 : if (!PreCheckEphemeralTx(*ptx, m_pool.m_opts.dust_relay_feerate, ws.m_base_fees, ws.m_modified_fees, state)) {
938 : : return false; // state filled in by PreCheckEphemeralTx
939 : : }
940 : : }
941 : :
942 [ + + ]: 31474 : if (nSigOpsCost > MAX_STANDARD_TX_SIGOPS_COST)
943 [ + - + - ]: 7 : return state.Invalid(TxValidationResult::TX_NOT_STANDARD, "bad-txns-too-many-sigops",
944 [ + - ]: 14 : strprintf("%d", nSigOpsCost));
945 : :
946 : : // No individual transactions are allowed below the min relay feerate except from disconnected blocks.
947 : : // This requirement, unlike CheckFeeRate, cannot be bypassed using m_package_feerates because,
948 : : // while a tx could be package CPFP'd when entering the mempool, we do not have a DoS-resistant
949 : : // method of ensuring the tx remains bumped. For example, the fee-bumping child could disappear
950 : : // due to a replacement.
951 : : // The only exception is TRUC transactions.
952 [ + + + + : 31467 : if (!bypass_limits && ws.m_ptx->version != TRUC_VERSION && ws.m_modified_fees < m_pool.m_opts.min_relay_feerate.GetFee(ws.m_vsize)) {
+ - + + ]
953 : : // Even though this is a fee-related failure, this result is TX_MEMPOOL_POLICY, not
954 : : // TX_RECONSIDERABLE, because it cannot be bypassed using package validation.
955 [ + - + - ]: 26 : return state.Invalid(TxValidationResult::TX_MEMPOOL_POLICY, "min relay fee not met",
956 [ + - + - ]: 52 : strprintf("%d < %d", ws.m_modified_fees, m_pool.m_opts.min_relay_feerate.GetFee(ws.m_vsize)));
957 : : }
958 : : // No individual transactions are allowed below the mempool min feerate except from disconnected
959 : : // blocks and transactions in a package. Package transactions will be checked using package
960 : : // feerate later.
961 [ + + + + : 31441 : if (!bypass_limits && !args.m_package_feerates && !CheckFeeRate(ws.m_vsize, ws.m_modified_fees, state)) return false;
+ - + + ]
962 : :
963 [ + - ]: 31337 : ws.m_iters_conflicting = m_pool.GetIterSet(ws.m_conflicts);
964 : :
965 : : // Note that these modifications are only applicable to single transaction scenarios;
966 : : // carve-outs are disabled for multi-transaction evaluations.
967 : 31337 : CTxMemPool::Limits maybe_rbf_limits = m_pool.m_opts.limits;
968 : :
969 : : // Calculate in-mempool ancestors, up to a limit.
970 [ + + + + ]: 31337 : if (ws.m_conflicts.size() == 1 && args.m_allow_carveouts) {
971 : : // In general, when we receive an RBF transaction with mempool conflicts, we want to know whether we
972 : : // would meet the chain limits after the conflicts have been removed. However, there isn't a practical
973 : : // way to do this short of calculating the ancestor and descendant sets with an overlay cache of
974 : : // changed mempool entries. Due to both implementation and runtime complexity concerns, this isn't
975 : : // very realistic, thus we only ensure a limited set of transactions are RBF'able despite mempool
976 : : // conflicts here. Importantly, we need to ensure that some transactions which were accepted using
977 : : // the below carve-out are able to be RBF'ed, without impacting the security the carve-out provides
978 : : // for off-chain contract systems (see link in the comment below).
979 : : //
980 : : // Specifically, the subset of RBF transactions which we allow despite chain limits are those which
981 : : // conflict directly with exactly one other transaction (but may evict children of said transaction),
982 : : // and which are not adding any new mempool dependencies. Note that the "no new mempool dependencies"
983 : : // check is accomplished later, so we don't bother doing anything about it here, but if our
984 : : // policy changes, we may need to move that check to here instead of removing it wholesale.
985 : : //
986 : : // Such transactions are clearly not merging any existing packages, so we are only concerned with
987 : : // ensuring that (a) no package is growing past the package size (not count) limits and (b) we are
988 : : // not allowing something to effectively use the (below) carve-out spot when it shouldn't be allowed
989 : : // to.
990 : : //
991 : : // To check these we first check if we meet the RBF criteria, above, and increment the descendant
992 : : // limits by the direct conflict and its descendants (as these are recalculated in
993 : : // CalculateMempoolAncestors by assuming the new transaction being added is a new descendant, with no
994 : : // removals, of each parent's existing dependent set). The ancestor count limits are unmodified (as
995 : : // the ancestor limits should be the same for both our new transaction and any conflicts).
996 : : // We don't bother incrementing m_limit_descendants by the full removal count as that limit never comes
997 : : // into force here (as we're only adding a single transaction).
998 [ - + ]: 1255 : assert(ws.m_iters_conflicting.size() == 1);
999 : 1255 : CTxMemPool::txiter conflict = *ws.m_iters_conflicting.begin();
1000 : :
1001 : 1255 : maybe_rbf_limits.descendant_count += 1;
1002 : 1255 : maybe_rbf_limits.descendant_size_vbytes += conflict->GetSizeWithDescendants();
1003 : : }
1004 : :
1005 [ + - + + ]: 31337 : if (auto ancestors{m_subpackage.m_changeset->CalculateMemPoolAncestors(ws.m_tx_handle, maybe_rbf_limits)}) {
1006 : 31108 : ws.m_ancestors = std::move(*ancestors);
1007 : : } else {
1008 : : // If CalculateMemPoolAncestors fails second time, we want the original error string.
1009 [ + - ]: 229 : const auto error_message{util::ErrorString(ancestors).original};
1010 : :
1011 : : // Carve-out is not allowed in this context; fail
1012 [ + + ]: 229 : if (!args.m_allow_carveouts) {
1013 [ + - + - ]: 4 : return state.Invalid(TxValidationResult::TX_MEMPOOL_POLICY, "too-long-mempool-chain", error_message);
1014 : : }
1015 : :
1016 : : // Contracting/payment channels CPFP carve-out:
1017 : : // If the new transaction is relatively small (up to 40k weight)
1018 : : // and has at most one ancestor (ie ancestor limit of 2, including
1019 : : // the new transaction), allow it if its parent has exactly the
1020 : : // descendant limit descendants. The transaction also cannot be TRUC,
1021 : : // as its topology restrictions do not allow a second child.
1022 : : //
1023 : : // This allows protocols which rely on distrusting counterparties
1024 : : // being able to broadcast descendants of an unconfirmed transaction
1025 : : // to be secure by simply only having two immediately-spendable
1026 : : // outputs - one for each counterparty. For more info on the uses for
1027 : : // this, see https://lists.linuxfoundation.org/pipermail/bitcoin-dev/2018-November/016518.html
1028 : 225 : CTxMemPool::Limits cpfp_carve_out_limits{
1029 : : .ancestor_count = 2,
1030 : 225 : .ancestor_size_vbytes = maybe_rbf_limits.ancestor_size_vbytes,
1031 : 225 : .descendant_count = maybe_rbf_limits.descendant_count + 1,
1032 : 225 : .descendant_size_vbytes = maybe_rbf_limits.descendant_size_vbytes + EXTRA_DESCENDANT_TX_SIZE_LIMIT,
1033 : 225 : };
1034 [ + + + + ]: 225 : if (ws.m_vsize > EXTRA_DESCENDANT_TX_SIZE_LIMIT || ws.m_ptx->version == TRUC_VERSION) {
1035 [ + - + - ]: 22 : return state.Invalid(TxValidationResult::TX_MEMPOOL_POLICY, "too-long-mempool-chain", error_message);
1036 : : }
1037 [ + - + + ]: 203 : if (auto ancestors_retry{m_subpackage.m_changeset->CalculateMemPoolAncestors(ws.m_tx_handle, cpfp_carve_out_limits)}) {
1038 : 7 : ws.m_ancestors = std::move(*ancestors_retry);
1039 : : } else {
1040 [ + - + - ]: 196 : return state.Invalid(TxValidationResult::TX_MEMPOOL_POLICY, "too-long-mempool-chain", error_message);
1041 : 203 : }
1042 : 229 : }
1043 : :
1044 : : // Even though just checking direct mempool parents for inheritance would be sufficient, we
1045 : : // check using the full ancestor set here because it's more convenient to use what we have
1046 : : // already calculated.
1047 [ + + ]: 31115 : if (!args.m_bypass_limits) {
1048 [ + - + + ]: 30461 : if (const auto err{SingleTRUCChecks(ws.m_ptx, ws.m_ancestors, ws.m_conflicts, ws.m_vsize)}) {
1049 : : // Single transaction contexts only.
1050 [ + + + + ]: 27 : if (args.m_allow_sibling_eviction && err->second != nullptr) {
1051 : : // We should only be considering where replacement is considered valid as well.
1052 : 15 : Assume(args.m_allow_replacement);
1053 : :
1054 : : // Potential sibling eviction. Add the sibling to our list of mempool conflicts to be
1055 : : // included in RBF checks.
1056 [ + - ]: 15 : ws.m_conflicts.insert(err->second->GetHash());
1057 : : // Adding the sibling to m_iters_conflicting here means that it doesn't count towards
1058 : : // RBF Carve Out above. This is correct, since removing to-be-replaced transactions from
1059 : : // the descendant count is done separately in SingleTRUCChecks for TRUC transactions.
1060 [ + - + - ]: 30 : ws.m_iters_conflicting.insert(m_pool.GetIter(err->second->GetHash()).value());
1061 : 15 : ws.m_sibling_eviction = true;
1062 : : // The sibling will be treated as part of the to-be-replaced set in ReplacementChecks.
1063 : : // Note that we are not checking whether it opts in to replaceability via BIP125 or TRUC
1064 : : // (which is normally done in PreChecks). However, the only way a TRUC transaction can
1065 : : // have a non-TRUC and non-BIP125 descendant is due to a reorg.
1066 : : } else {
1067 [ + - + - ]: 12 : return state.Invalid(TxValidationResult::TX_MEMPOOL_POLICY, "TRUC-violation", err->first);
1068 : : }
1069 : 30461 : }
1070 : : }
1071 : :
1072 : : // A transaction that spends outputs that would be replaced by it is invalid. Now
1073 : : // that we have the set of all ancestors we can detect this
1074 : : // pathological case by making sure ws.m_conflicts and ws.m_ancestors don't
1075 : : // intersect.
1076 [ + - + + ]: 31103 : if (const auto err_string{EntriesAndTxidsDisjoint(ws.m_ancestors, ws.m_conflicts, hash)}) {
1077 : : // We classify this as a consensus error because a transaction depending on something it
1078 : : // conflicts with would be inconsistent.
1079 [ + - + - ]: 5 : return state.Invalid(TxValidationResult::TX_CONSENSUS, "bad-txns-spends-conflicting-tx", *err_string);
1080 : 5 : }
1081 : :
1082 : : // We want to detect conflicts in any tx in a package to trigger package RBF logic
1083 : 31098 : m_subpackage.m_rbf |= !ws.m_conflicts.empty();
1084 : 31098 : return true;
1085 : 38804 : }
1086 : :
1087 : 1302 : bool MemPoolAccept::ReplacementChecks(Workspace& ws)
1088 : : {
1089 : 1302 : AssertLockHeld(cs_main);
1090 : 1302 : AssertLockHeld(m_pool.cs);
1091 : :
1092 : 1302 : const CTransaction& tx = *ws.m_ptx;
1093 : 1302 : const Txid& hash = ws.m_hash;
1094 : 1302 : TxValidationState& state = ws.m_state;
1095 : :
1096 : 1302 : CFeeRate newFeeRate(ws.m_modified_fees, ws.m_vsize);
1097 : : // Enforce Rule #6. The replacement transaction must have a higher feerate than its direct conflicts.
1098 : : // - The motivation for this check is to ensure that the replacement transaction is preferable for
1099 : : // block-inclusion, compared to what would be removed from the mempool.
1100 : : // - This logic predates ancestor feerate-based transaction selection, which is why it doesn't
1101 : : // consider feerates of descendants.
1102 : : // - Note: Ancestor feerate-based transaction selection has made this comparison insufficient to
1103 : : // guarantee that this is incentive-compatible for miners, because it is possible for a
1104 : : // descendant transaction of a direct conflict to pay a higher feerate than the transaction that
1105 : : // might replace them, under these rules.
1106 [ + + ]: 1302 : if (const auto err_string{PaysMoreThanConflicts(ws.m_iters_conflicting, newFeeRate, hash)}) {
1107 : : // This fee-related failure is TX_RECONSIDERABLE because validating in a package may change
1108 : : // the result.
1109 [ + + + - ]: 62 : return state.Invalid(TxValidationResult::TX_RECONSIDERABLE,
1110 [ + + + - ]: 92 : strprintf("insufficient fee%s", ws.m_sibling_eviction ? " (including sibling eviction)" : ""), *err_string);
1111 : 31 : }
1112 : :
1113 [ + - ]: 1271 : CTxMemPool::setEntries all_conflicts;
1114 : :
1115 : : // Calculate all conflicting entries and enforce Rule #5.
1116 [ + - + + ]: 1271 : if (const auto err_string{GetEntriesForConflicts(tx, m_pool, ws.m_iters_conflicting, all_conflicts)}) {
1117 [ + + + - ]: 12 : return state.Invalid(TxValidationResult::TX_MEMPOOL_POLICY,
1118 [ + + + - ]: 17 : strprintf("too many potential replacements%s", ws.m_sibling_eviction ? " (including sibling eviction)" : ""), *err_string);
1119 : 6 : }
1120 : : // Enforce Rule #2.
1121 [ + - + + ]: 1265 : if (const auto err_string{HasNoNewUnconfirmed(tx, m_pool, all_conflicts)}) {
1122 : : // Sibling eviction is only done for TRUC transactions, which cannot have multiple ancestors.
1123 : 2 : Assume(!ws.m_sibling_eviction);
1124 [ + - + - ]: 4 : return state.Invalid(TxValidationResult::TX_MEMPOOL_POLICY,
1125 [ + - + - ]: 6 : strprintf("replacement-adds-unconfirmed%s", ws.m_sibling_eviction ? " (including sibling eviction)" : ""), *err_string);
1126 : 2 : }
1127 : :
1128 : : // Check if it's economically rational to mine this transaction rather than the ones it
1129 : : // replaces and pays for its own relay fees. Enforce Rules #3 and #4.
1130 [ + + ]: 3197 : for (CTxMemPool::txiter it : all_conflicts) {
1131 [ + - ]: 1934 : m_subpackage.m_conflicting_fees += it->GetModifiedFee();
1132 [ + - ]: 1934 : m_subpackage.m_conflicting_size += it->GetTxSize();
1133 : : }
1134 : 2526 : if (const auto err_string{PaysForRBF(m_subpackage.m_conflicting_fees, ws.m_modified_fees, ws.m_vsize,
1135 [ + - + + ]: 1263 : m_pool.m_opts.incremental_relay_feerate, hash)}) {
1136 : : // Result may change in a package context
1137 [ + + + - ]: 44 : return state.Invalid(TxValidationResult::TX_RECONSIDERABLE,
1138 [ + + + - ]: 65 : strprintf("insufficient fee%s", ws.m_sibling_eviction ? " (including sibling eviction)" : ""), *err_string);
1139 : 22 : }
1140 : :
1141 : : // Add all the to-be-removed transactions to the changeset.
1142 [ + + ]: 2971 : for (auto it : all_conflicts) {
1143 [ + - ]: 1730 : m_subpackage.m_changeset->StageRemoval(it);
1144 : : }
1145 : : return true;
1146 : 1271 : }
1147 : :
1148 : 138 : bool MemPoolAccept::PackageMempoolChecks(const std::vector<CTransactionRef>& txns,
1149 : : std::vector<Workspace>& workspaces,
1150 : : const int64_t total_vsize,
1151 : : PackageValidationState& package_state)
1152 : : {
1153 : 138 : AssertLockHeld(cs_main);
1154 : 138 : AssertLockHeld(m_pool.cs);
1155 : :
1156 : : // CheckPackageLimits expects the package transactions to not already be in the mempool.
1157 [ - + ]: 878 : assert(std::all_of(txns.cbegin(), txns.cend(), [this](const auto& tx) { return !m_pool.exists(tx->GetHash()); }));
1158 : :
1159 [ - + - + : 138 : assert(txns.size() == workspaces.size());
- + ]
1160 : :
1161 : 138 : auto result = m_pool.CheckPackageLimits(txns, total_vsize);
1162 [ + + ]: 138 : if (!result) {
1163 : : // This is a package-wide error, separate from an individual transaction error.
1164 [ + - + - : 22 : return package_state.Invalid(PackageValidationResult::PCKG_POLICY, "package-mempool-limits", util::ErrorString(result).original);
+ - ]
1165 : : }
1166 : :
1167 : : // No conflicts means we're finished. Further checks are all RBF-only.
1168 [ + + ]: 127 : if (!m_subpackage.m_rbf) return true;
1169 : :
1170 : : // We're in package RBF context; replacement proposal must be size 2
1171 [ - + + + : 28 : if (workspaces.size() != 2 || !Assume(IsChildWithParents(txns))) {
+ - - + ]
1172 [ + - + - : 1 : return package_state.Invalid(PackageValidationResult::PCKG_POLICY, "package RBF failed: package must be 1-parent-1-child");
+ - ]
1173 : : }
1174 : :
1175 : : // If the package has in-mempool ancestors, we won't consider a package RBF
1176 : : // since it would result in a cluster larger than 2.
1177 : : // N.B. To relax this constraint we will need to revisit how CCoinsViewMemPool::PackageAddTransaction
1178 : : // is being used inside AcceptMultipleTransactions to track available inputs while processing a package.
1179 [ + + ]: 78 : for (const auto& ws : workspaces) {
1180 [ + + ]: 53 : if (!ws.m_ancestors.empty()) {
1181 [ + - + - : 2 : return package_state.Invalid(PackageValidationResult::PCKG_POLICY, "package RBF failed: new transaction cannot have mempool ancestors");
+ - ]
1182 : : }
1183 : : }
1184 : :
1185 : : // Aggregate all conflicts into one set.
1186 : 25 : CTxMemPool::setEntries direct_conflict_iters;
1187 [ + + ]: 75 : for (Workspace& ws : workspaces) {
1188 : : // Aggregate all conflicts into one set.
1189 : 50 : direct_conflict_iters.merge(ws.m_iters_conflicting);
1190 : : }
1191 : :
1192 [ + - ]: 25 : const auto& parent_ws = workspaces[0];
1193 : 25 : const auto& child_ws = workspaces[1];
1194 : :
1195 : : // Don't consider replacements that would cause us to remove a large number of mempool entries.
1196 : : // This limit is not increased in a package RBF. Use the aggregate number of transactions.
1197 [ + - ]: 25 : CTxMemPool::setEntries all_conflicts;
1198 : 50 : if (const auto err_string{GetEntriesForConflicts(*child_ws.m_ptx, m_pool, direct_conflict_iters,
1199 [ + - + + ]: 25 : all_conflicts)}) {
1200 [ + - + - ]: 2 : return package_state.Invalid(PackageValidationResult::PCKG_POLICY,
1201 [ + - ]: 4 : "package RBF failed: too many potential replacements", *err_string);
1202 : 2 : }
1203 : :
1204 : :
1205 [ + + ]: 164 : for (CTxMemPool::txiter it : all_conflicts) {
1206 [ + - ]: 141 : m_subpackage.m_changeset->StageRemoval(it);
1207 [ + - ]: 141 : m_subpackage.m_conflicting_fees += it->GetModifiedFee();
1208 [ + - ]: 141 : m_subpackage.m_conflicting_size += it->GetTxSize();
1209 : : }
1210 : :
1211 : : // Use the child as the transaction for attributing errors to.
1212 [ + - ]: 23 : const Txid& child_hash = child_ws.m_ptx->GetHash();
1213 : 46 : if (const auto err_string{PaysForRBF(/*original_fees=*/m_subpackage.m_conflicting_fees,
1214 : : /*replacement_fees=*/m_subpackage.m_total_modified_fees,
1215 : 23 : /*replacement_vsize=*/m_subpackage.m_total_vsize,
1216 [ + - + + ]: 23 : m_pool.m_opts.incremental_relay_feerate, child_hash)}) {
1217 [ + - + - ]: 3 : return package_state.Invalid(PackageValidationResult::PCKG_POLICY,
1218 [ + - ]: 6 : "package RBF failed: insufficient anti-DoS fees", *err_string);
1219 : 3 : }
1220 : :
1221 : : // Ensure this two transaction package is a "chunk" on its own; we don't want the child
1222 : : // to be only paying anti-DoS fees
1223 [ + - ]: 20 : const CFeeRate parent_feerate(parent_ws.m_modified_fees, parent_ws.m_vsize);
1224 [ + - ]: 20 : const CFeeRate package_feerate(m_subpackage.m_total_modified_fees, m_subpackage.m_total_vsize);
1225 [ + + ]: 20 : if (package_feerate <= parent_feerate) {
1226 [ + - + - ]: 2 : return package_state.Invalid(PackageValidationResult::PCKG_POLICY,
1227 [ + - ]: 2 : "package RBF failed: package feerate is less than or equal to parent feerate",
1228 [ + - + - : 2 : strprintf("package feerate %s <= parent feerate is %s", package_feerate.ToString(), parent_feerate.ToString()));
+ - ]
1229 : : }
1230 : :
1231 : : // Check if it's economically rational to mine this package rather than the ones it replaces.
1232 : : // This takes the place of ReplacementChecks()'s PaysMoreThanConflicts() in the package RBF setting.
1233 [ + - + + ]: 19 : if (const auto err_tup{ImprovesFeerateDiagram(*m_subpackage.m_changeset)}) {
1234 [ + - ]: 10 : return package_state.Invalid(PackageValidationResult::PCKG_POLICY,
1235 [ + - + - ]: 30 : "package RBF failed: " + err_tup.value().second, "");
1236 : 10 : }
1237 : :
1238 [ + - + - : 18 : LogDebug(BCLog::TXPACKAGES, "package RBF checks passed: parent %s (wtxid=%s), child %s (wtxid=%s), package hash (%s)\n",
+ - + - +
- + - + -
+ - + - ]
1239 : : txns.front()->GetHash().ToString(), txns.front()->GetWitnessHash().ToString(),
1240 : : txns.back()->GetHash().ToString(), txns.back()->GetWitnessHash().ToString(),
1241 : : GetPackageHash(txns).ToString());
1242 : :
1243 : :
1244 : : return true;
1245 : 163 : }
1246 : :
1247 : 30876 : bool MemPoolAccept::PolicyScriptChecks(const ATMPArgs& args, Workspace& ws)
1248 : : {
1249 : 30876 : AssertLockHeld(cs_main);
1250 : 30876 : AssertLockHeld(m_pool.cs);
1251 : 30876 : const CTransaction& tx = *ws.m_ptx;
1252 : 30876 : TxValidationState& state = ws.m_state;
1253 : :
1254 : 30876 : constexpr unsigned int scriptVerifyFlags = STANDARD_SCRIPT_VERIFY_FLAGS;
1255 : :
1256 : : // Check input scripts and signatures.
1257 : : // This is done last to help prevent CPU exhaustion denial-of-service attacks.
1258 [ + + ]: 30876 : if (!CheckInputScripts(tx, state, m_view, scriptVerifyFlags, true, false, ws.m_precomputed_txdata, GetValidationCache())) {
1259 : : // Detect a failure due to a missing witness so that p2p code can handle rejection caching appropriately.
1260 [ + + + + ]: 1684 : if (!tx.HasWitness() && SpendsNonAnchorWitnessProg(tx, m_view)) {
1261 : 44 : state.Invalid(TxValidationResult::TX_WITNESS_STRIPPED,
1262 [ - + - + : 88 : state.GetRejectReason(), state.GetDebugMessage());
+ - ]
1263 : : }
1264 : 1684 : return false; // state filled in by CheckInputScripts
1265 : : }
1266 : :
1267 : : return true;
1268 : : }
1269 : :
1270 : 28661 : bool MemPoolAccept::ConsensusScriptChecks(const ATMPArgs& args, Workspace& ws)
1271 : : {
1272 : 28661 : AssertLockHeld(cs_main);
1273 : 28661 : AssertLockHeld(m_pool.cs);
1274 [ - + ]: 28661 : const CTransaction& tx = *ws.m_ptx;
1275 : 28661 : const Txid& hash = ws.m_hash;
1276 : 28661 : TxValidationState& state = ws.m_state;
1277 : :
1278 : : // Check again against the current block tip's script verification
1279 : : // flags to cache our script execution flags. This is, of course,
1280 : : // useless if the next block has different script flags from the
1281 : : // previous one, but because the cache tracks script flags for us it
1282 : : // will auto-invalidate and we'll just have a few blocks of extra
1283 : : // misses on soft-fork activation.
1284 : : //
1285 : : // This is also useful in case of bugs in the standard flags that cause
1286 : : // transactions to pass as valid when they're actually invalid. For
1287 : : // instance the STRICTENC flag was incorrectly allowing certain
1288 : : // CHECKSIG NOT scripts to pass, even though they were invalid.
1289 : : //
1290 : : // There is a similar check in CreateNewBlock() to prevent creating
1291 : : // invalid blocks (using TestBlockValidity), however allowing such
1292 : : // transactions into the mempool can be exploited as a DoS attack.
1293 [ - + ]: 57322 : unsigned int currentBlockScriptVerifyFlags{GetBlockScriptFlags(*m_active_chainstate.m_chain.Tip(), m_active_chainstate.m_chainman)};
1294 [ - + ]: 57322 : if (!CheckInputsFromMempoolAndCache(tx, state, m_view, m_pool, currentBlockScriptVerifyFlags,
1295 : 28661 : ws.m_precomputed_txdata, m_active_chainstate.CoinsTip(), GetValidationCache())) {
1296 [ # # # # ]: 0 : LogPrintf("BUG! PLEASE REPORT THIS! CheckInputScripts failed against latest-block but not STANDARD flags %s, %s\n", hash.ToString(), state.ToString());
1297 : 0 : return Assume(false);
1298 : : }
1299 : :
1300 : : return true;
1301 : : }
1302 : :
1303 : 23458 : void MemPoolAccept::FinalizeSubpackage(const ATMPArgs& args)
1304 : : {
1305 : 23458 : AssertLockHeld(cs_main);
1306 : 23458 : AssertLockHeld(m_pool.cs);
1307 : :
1308 : 23458 : if (!m_subpackage.m_changeset->GetRemovals().empty()) Assume(args.m_allow_replacement);
1309 : : // Remove conflicting transactions from the mempool
1310 [ + + ]: 24827 : for (CTxMemPool::txiter it : m_subpackage.m_changeset->GetRemovals())
1311 : : {
1312 : 1369 : std::string log_string = strprintf("replacing mempool tx %s (wtxid=%s, fees=%s, vsize=%s). ",
1313 [ + - ]: 2738 : it->GetTx().GetHash().ToString(),
1314 [ + - ]: 1369 : it->GetTx().GetWitnessHash().ToString(),
1315 : 1369 : it->GetFee(),
1316 [ + - ]: 2738 : it->GetTxSize());
1317 [ - + ]: 1369 : FeeFrac feerate{m_subpackage.m_total_modified_fees, int32_t(m_subpackage.m_total_vsize)};
1318 : 1369 : uint256 tx_or_package_hash{};
1319 [ - + ]: 1369 : const bool replaced_with_tx{m_subpackage.m_changeset->GetTxCount() == 1};
1320 [ + + ]: 1369 : if (replaced_with_tx) {
1321 [ + - ]: 1254 : const CTransaction& tx = m_subpackage.m_changeset->GetAddedTxn(0);
1322 : 1254 : tx_or_package_hash = tx.GetHash().ToUint256();
1323 : 1254 : log_string += strprintf("New tx %s (wtxid=%s, fees=%s, vsize=%s)",
1324 [ + - ]: 2508 : tx.GetHash().ToString(),
1325 [ + - + - ]: 2508 : tx.GetWitnessHash().ToString(),
1326 : : feerate.fee,
1327 : 1254 : feerate.size);
1328 : : } else {
1329 [ + - + - ]: 115 : tx_or_package_hash = GetPackageHash(m_subpackage.m_changeset->GetAddedTxns());
1330 [ + - ]: 230 : log_string += strprintf("New package %s with %lu txs, fees=%s, vsize=%s",
1331 : 115 : tx_or_package_hash.ToString(),
1332 [ - + + - ]: 115 : m_subpackage.m_changeset->GetTxCount(),
1333 : : feerate.fee,
1334 : 115 : feerate.size);
1335 : :
1336 : : }
1337 [ + - + - : 1369 : LogDebug(BCLog::MEMPOOL, "%s\n", log_string);
+ - ]
1338 : : TRACEPOINT(mempool, replaced,
1339 : : it->GetTx().GetHash().data(),
1340 : : it->GetTxSize(),
1341 : : it->GetFee(),
1342 : : std::chrono::duration_cast<std::chrono::duration<std::uint64_t>>(it->GetTime()).count(),
1343 : : tx_or_package_hash.data(),
1344 : : feerate.size,
1345 : : feerate.fee,
1346 : : replaced_with_tx
1347 : 1369 : );
1348 [ + - + - ]: 4107 : m_subpackage.m_replaced_transactions.push_back(it->GetSharedTx());
1349 : 1369 : }
1350 : 23458 : m_subpackage.m_changeset->Apply();
1351 [ + - ]: 23458 : m_subpackage.m_changeset.reset();
1352 : 23458 : }
1353 : :
1354 : 53 : bool MemPoolAccept::SubmitPackage(const ATMPArgs& args, std::vector<Workspace>& workspaces,
1355 : : PackageValidationState& package_state,
1356 : : std::map<Wtxid, MempoolAcceptResult>& results)
1357 : : {
1358 : 53 : AssertLockHeld(cs_main);
1359 : 53 : AssertLockHeld(m_pool.cs);
1360 : : // Sanity check: none of the transactions should be in the mempool, and none of the transactions
1361 : : // should have a same-txid-different-witness equivalent in the mempool.
1362 [ - + ]: 159 : assert(std::all_of(workspaces.cbegin(), workspaces.cend(), [this](const auto& ws) { return !m_pool.exists(ws.m_ptx->GetHash()); }));
1363 : :
1364 : 53 : bool all_submitted = true;
1365 : 53 : FinalizeSubpackage(args);
1366 : : // ConsensusScriptChecks adds to the script cache and is therefore consensus-critical;
1367 : : // CheckInputsFromMempoolAndCache asserts that transactions only spend coins available from the
1368 : : // mempool or UTXO set. Submit each transaction to the mempool immediately after calling
1369 : : // ConsensusScriptChecks to make the outputs available for subsequent transactions.
1370 [ + + ]: 159 : for (Workspace& ws : workspaces) {
1371 [ - + ]: 106 : if (!ConsensusScriptChecks(args, ws)) {
1372 [ # # # # ]: 0 : results.emplace(ws.m_ptx->GetWitnessHash(), MempoolAcceptResult::Failure(ws.m_state));
1373 : : // Since PolicyScriptChecks() passed, this should never fail.
1374 : 0 : Assume(false);
1375 : 0 : all_submitted = false;
1376 [ # # ]: 0 : package_state.Invalid(PackageValidationResult::PCKG_MEMPOOL_ERROR,
1377 : 0 : strprintf("BUG! PolicyScriptChecks succeeded but ConsensusScriptChecks failed: %s",
1378 [ # # # # ]: 0 : ws.m_ptx->GetHash().ToString()));
1379 : : // Remove the transaction from the mempool.
1380 [ # # ]: 0 : if (!m_subpackage.m_changeset) m_subpackage.m_changeset = m_pool.GetChangeSet();
1381 [ # # ]: 0 : m_subpackage.m_changeset->StageRemoval(m_pool.GetIter(ws.m_ptx->GetHash()).value());
1382 : : }
1383 : : }
1384 [ - + ]: 53 : if (!all_submitted) {
1385 : 0 : Assume(m_subpackage.m_changeset);
1386 : : // This code should be unreachable; it's here as belt-and-suspenders
1387 : : // to try to ensure we have no consensus-invalid transactions in the
1388 : : // mempool.
1389 : 0 : m_subpackage.m_changeset->Apply();
1390 [ # # ]: 0 : m_subpackage.m_changeset.reset();
1391 : 0 : return false;
1392 : : }
1393 : :
1394 : 53 : std::vector<Wtxid> all_package_wtxids;
1395 [ - + + - ]: 53 : all_package_wtxids.reserve(workspaces.size());
1396 [ + - ]: 53 : std::transform(workspaces.cbegin(), workspaces.cend(), std::back_inserter(all_package_wtxids),
1397 : 106 : [](const auto& ws) { return ws.m_ptx->GetWitnessHash(); });
1398 : :
1399 [ + + ]: 53 : if (!m_subpackage.m_replaced_transactions.empty()) {
1400 [ + - + - : 9 : LogDebug(BCLog::MEMPOOL, "replaced %u mempool transactions with %u new one(s) for %s additional fees, %d delta bytes\n",
- + + - ]
1401 : : m_subpackage.m_replaced_transactions.size(), workspaces.size(),
1402 : : m_subpackage.m_total_modified_fees - m_subpackage.m_conflicting_fees,
1403 : : m_subpackage.m_total_vsize - static_cast<int>(m_subpackage.m_conflicting_size));
1404 : : }
1405 : :
1406 : : // Add successful results. The returned results may change later if LimitMempoolSize() evicts them.
1407 [ + + ]: 159 : for (Workspace& ws : workspaces) {
1408 [ + - ]: 106 : auto iter = m_pool.GetIter(ws.m_ptx->GetHash());
1409 [ + - ]: 106 : Assume(iter.has_value());
1410 [ + - ]: 106 : const auto effective_feerate = args.m_package_feerates ? ws.m_package_feerate :
1411 [ - - ]: 106 : CFeeRate{ws.m_modified_fees, static_cast<int32_t>(ws.m_vsize)};
1412 [ + - ]: 106 : const auto effective_feerate_wtxids = args.m_package_feerates ? all_package_wtxids :
1413 [ + - - - ]: 106 : std::vector<Wtxid>{ws.m_ptx->GetWitnessHash()};
1414 : 212 : results.emplace(ws.m_ptx->GetWitnessHash(),
1415 [ + - + - ]: 106 : MempoolAcceptResult::Success(std::move(m_subpackage.m_replaced_transactions), ws.m_vsize,
1416 : : ws.m_base_fees, effective_feerate, effective_feerate_wtxids));
1417 [ - + ]: 106 : if (!m_pool.m_opts.signals) continue;
1418 [ + - ]: 106 : const CTransaction& tx = *ws.m_ptx;
1419 [ + - ]: 106 : const auto tx_info = NewMempoolTransactionInfo(ws.m_ptx, ws.m_base_fees,
1420 [ + - ]: 106 : ws.m_vsize, (*iter)->GetHeight(),
1421 : 106 : args.m_bypass_limits, args.m_package_submission,
1422 [ + - ]: 106 : IsCurrentForFeeEstimation(m_active_chainstate),
1423 [ + - + - ]: 212 : m_pool.HasNoInputsOf(tx));
1424 [ + - ]: 106 : m_pool.m_opts.signals->TransactionAddedToMempool(tx_info, m_pool.GetAndIncrementSequence());
1425 : 106 : }
1426 : 53 : return all_submitted;
1427 : 53 : }
1428 : :
1429 : 38019 : MempoolAcceptResult MemPoolAccept::AcceptSingleTransaction(const CTransactionRef& ptx, ATMPArgs& args)
1430 : : {
1431 : 38019 : AssertLockHeld(cs_main);
1432 : 38019 : LOCK(m_pool.cs); // mempool "read lock" (held through m_pool.m_opts.signals->TransactionAddedToMempool())
1433 : :
1434 : 38019 : Workspace ws(ptx);
1435 [ + - ]: 38019 : const std::vector<Wtxid> single_wtxid{ws.m_ptx->GetWitnessHash()};
1436 : :
1437 [ + - + + ]: 38019 : if (!PreChecks(args, ws)) {
1438 [ + + ]: 7715 : if (ws.m_state.GetResult() == TxValidationResult::TX_RECONSIDERABLE) {
1439 : : // Failed for fee reasons. Provide the effective feerate and which tx was included.
1440 [ + - + - ]: 309 : return MempoolAcceptResult::FeeFailure(ws.m_state, CFeeRate(ws.m_modified_fees, ws.m_vsize), single_wtxid);
1441 : : }
1442 [ + - + - ]: 15224 : return MempoolAcceptResult::Failure(ws.m_state);
1443 : : }
1444 : :
1445 : 30304 : m_subpackage.m_total_vsize = ws.m_vsize;
1446 : 30304 : m_subpackage.m_total_modified_fees = ws.m_modified_fees;
1447 : :
1448 : : // Individual modified feerate exceeded caller-defined max; abort
1449 [ + + + - : 30304 : if (args.m_client_maxfeerate && CFeeRate(ws.m_modified_fees, ws.m_vsize) > args.m_client_maxfeerate.value()) {
+ + ]
1450 [ + - + - : 2 : ws.m_state.Invalid(TxValidationResult::TX_MEMPOOL_POLICY, "max feerate exceeded", "");
+ - ]
1451 [ + - + - ]: 2 : return MempoolAcceptResult::Failure(ws.m_state);
1452 : : }
1453 : :
1454 [ + + ]: 30303 : if (m_pool.m_opts.require_standard) {
1455 [ + - ]: 29667 : Wtxid dummy_wtxid;
1456 [ + - + + : 59334 : if (!CheckEphemeralSpends(/*package=*/{ptx}, m_pool.m_opts.dust_relay_feerate, m_pool, ws.m_state, dummy_wtxid)) {
+ - + + -
- - - ]
1457 [ + - + - ]: 10 : return MempoolAcceptResult::Failure(ws.m_state);
1458 : : }
1459 : : }
1460 : :
1461 [ + + + - : 30298 : if (m_subpackage.m_rbf && !ReplacementChecks(ws)) {
+ + ]
1462 [ + + ]: 61 : if (ws.m_state.GetResult() == TxValidationResult::TX_RECONSIDERABLE) {
1463 : : // Failed for incentives-based fee reasons. Provide the effective feerate and which tx was included.
1464 [ + - + - ]: 159 : return MempoolAcceptResult::FeeFailure(ws.m_state, CFeeRate(ws.m_modified_fees, ws.m_vsize), single_wtxid);
1465 : : }
1466 [ + - + - ]: 16 : return MempoolAcceptResult::Failure(ws.m_state);
1467 : : }
1468 : :
1469 : : // Perform the inexpensive checks first and avoid hashing and signature verification unless
1470 : : // those checks pass, to mitigate CPU exhaustion denial-of-service attacks.
1471 [ + - + + : 31919 : if (!PolicyScriptChecks(args, ws)) return MempoolAcceptResult::Failure(ws.m_state);
+ - + - ]
1472 : :
1473 [ + - - + : 28555 : if (!ConsensusScriptChecks(args, ws)) return MempoolAcceptResult::Failure(ws.m_state);
- - - - ]
1474 : :
1475 [ + - ]: 28555 : const CFeeRate effective_feerate{ws.m_modified_fees, static_cast<int32_t>(ws.m_vsize)};
1476 : : // Tx was accepted, but not added
1477 [ + + ]: 28555 : if (args.m_test_accept) {
1478 : 5150 : return MempoolAcceptResult::Success(std::move(m_subpackage.m_replaced_transactions), ws.m_vsize,
1479 [ + - ]: 5150 : ws.m_base_fees, effective_feerate, single_wtxid);
1480 : : }
1481 : :
1482 [ + - ]: 23405 : FinalizeSubpackage(args);
1483 : :
1484 : : // Limit the mempool, if appropriate.
1485 [ + + + + ]: 23405 : if (!args.m_package_submission && !args.m_bypass_limits) {
1486 [ + - + - ]: 22617 : LimitMempoolSize(m_pool, m_active_chainstate.CoinsTip());
1487 : : // If mempool contents change, then the m_view cache is dirty. Given this isn't a package
1488 : : // submission, we won't be using the cache anymore, but clear it anyway for clarity.
1489 [ + - ]: 22617 : CleanupTemporaryCoins();
1490 : :
1491 [ + - - + ]: 22617 : if (!m_pool.exists(ws.m_hash)) {
1492 : : // The tx no longer meets our (new) mempool minimum feerate but could be reconsidered in a package.
1493 [ # # # # : 0 : ws.m_state.Invalid(TxValidationResult::TX_RECONSIDERABLE, "mempool full");
# # ]
1494 [ # # # # : 0 : return MempoolAcceptResult::FeeFailure(ws.m_state, CFeeRate(ws.m_modified_fees, ws.m_vsize), {ws.m_ptx->GetWitnessHash()});
# # ]
1495 : : }
1496 : : }
1497 : :
1498 [ + - ]: 23405 : if (m_pool.m_opts.signals) {
1499 [ + - ]: 23405 : const CTransaction& tx = *ws.m_ptx;
1500 [ + - ]: 23405 : auto iter = m_pool.GetIter(tx.GetHash());
1501 [ + - ]: 23405 : Assume(iter.has_value());
1502 : 23405 : const auto tx_info = NewMempoolTransactionInfo(ws.m_ptx, ws.m_base_fees,
1503 [ + - ]: 23405 : ws.m_vsize, (*iter)->GetHeight(),
1504 : 23405 : args.m_bypass_limits, args.m_package_submission,
1505 [ + - ]: 23405 : IsCurrentForFeeEstimation(m_active_chainstate),
1506 [ + - + - ]: 46810 : m_pool.HasNoInputsOf(tx));
1507 [ + - ]: 23405 : m_pool.m_opts.signals->TransactionAddedToMempool(tx_info, m_pool.GetAndIncrementSequence());
1508 : 23405 : }
1509 : :
1510 [ + + ]: 23405 : if (!m_subpackage.m_replaced_transactions.empty()) {
1511 [ + - + - : 869 : LogDebug(BCLog::MEMPOOL, "replaced %u mempool transactions with 1 new transaction for %s additional fees, %d delta bytes\n",
+ - ]
1512 : : m_subpackage.m_replaced_transactions.size(),
1513 : : ws.m_modified_fees - m_subpackage.m_conflicting_fees,
1514 : : ws.m_vsize - static_cast<int>(m_subpackage.m_conflicting_size));
1515 : : }
1516 : :
1517 : 23405 : return MempoolAcceptResult::Success(std::move(m_subpackage.m_replaced_transactions), ws.m_vsize, ws.m_base_fees,
1518 [ + - ]: 38019 : effective_feerate, single_wtxid);
1519 [ + - + - : 135372 : }
+ - ]
1520 : :
1521 : 180 : PackageMempoolAcceptResult MemPoolAccept::AcceptMultipleTransactions(const std::vector<CTransactionRef>& txns, ATMPArgs& args)
1522 : : {
1523 : 180 : AssertLockHeld(cs_main);
1524 : :
1525 : : // These context-free package limits can be done before taking the mempool lock.
1526 [ + - ]: 180 : PackageValidationState package_state;
1527 [ + - + + : 192 : if (!IsWellFormedPackage(txns, package_state, /*require_sorted=*/true)) return PackageMempoolAcceptResult(package_state, {});
+ - + - ]
1528 : :
1529 : 174 : std::vector<Workspace> workspaces{};
1530 [ - + + - ]: 174 : workspaces.reserve(txns.size());
1531 [ + - ]: 174 : std::transform(txns.cbegin(), txns.cend(), std::back_inserter(workspaces),
1532 : 844 : [](const auto& tx) { return Workspace(tx); });
1533 [ + - ]: 174 : std::map<Wtxid, MempoolAcceptResult> results;
1534 : :
1535 [ + - ]: 174 : LOCK(m_pool.cs);
1536 : :
1537 : : // Do all PreChecks first and fail fast to avoid running expensive script checks when unnecessary.
1538 [ + + ]: 967 : for (Workspace& ws : workspaces) {
1539 [ + - + + ]: 808 : if (!PreChecks(args, ws)) {
1540 [ + - + - : 28 : package_state.Invalid(PackageValidationResult::PCKG_TX, "transaction failed");
+ - ]
1541 : : // Exit early to avoid doing pointless work. Update the failed tx result; the rest are unfinished.
1542 [ + - + - : 14 : results.emplace(ws.m_ptx->GetWitnessHash(), MempoolAcceptResult::Failure(ws.m_state));
+ - ]
1543 [ + - + - ]: 42 : return PackageMempoolAcceptResult(package_state, std::move(results));
1544 : : }
1545 : :
1546 : : // Individual modified feerate exceeded caller-defined max; abort
1547 : : // N.B. this doesn't take into account CPFPs. Chunk-aware validation may be more robust.
1548 [ + + + - : 794 : if (args.m_client_maxfeerate && CFeeRate(ws.m_modified_fees, ws.m_vsize) > args.m_client_maxfeerate.value()) {
+ + ]
1549 : : // Need to set failure here both individually and at package level
1550 [ + - + - : 2 : ws.m_state.Invalid(TxValidationResult::TX_MEMPOOL_POLICY, "max feerate exceeded", "");
+ - ]
1551 [ + - + - : 2 : package_state.Invalid(PackageValidationResult::PCKG_TX, "transaction failed");
+ - ]
1552 : : // Exit early to avoid doing pointless work. Update the failed tx result; the rest are unfinished.
1553 [ + - + - : 1 : results.emplace(ws.m_ptx->GetWitnessHash(), MempoolAcceptResult::Failure(ws.m_state));
+ - ]
1554 [ + - + - ]: 3 : return PackageMempoolAcceptResult(package_state, std::move(results));
1555 : : }
1556 : :
1557 : : // Make the coins created by this transaction available for subsequent transactions in the
1558 : : // package to spend. If there are no conflicts within the package, no transaction can spend a coin
1559 : : // needed by another transaction in the package. We also need to make sure that no package
1560 : : // tx replaces (or replaces the ancestor of) the parent of another package tx. As long as we
1561 : : // check these two things, we don't need to track the coins spent.
1562 : : // If a package tx conflicts with a mempool tx, PackageMempoolChecks() ensures later that any package RBF attempt
1563 : : // has *no* in-mempool ancestors, so we don't have to worry about subsequent transactions in
1564 : : // same package spending the same in-mempool outpoints. This needs to be revisited for general
1565 : : // package RBF.
1566 [ + - ]: 793 : m_viewmempool.PackageAddTransaction(ws.m_ptx);
1567 : : }
1568 : :
1569 : : // At this point we have all in-mempool ancestors, and we know every transaction's vsize.
1570 : : // Run the TRUC checks on the package.
1571 [ + + ]: 930 : for (Workspace& ws : workspaces) {
1572 [ + - + + ]: 781 : if (auto err{PackageTRUCChecks(ws.m_ptx, ws.m_vsize, txns, ws.m_ancestors)}) {
1573 [ + - + - ]: 10 : package_state.Invalid(PackageValidationResult::PCKG_POLICY, "TRUC-violation", err.value());
1574 [ + - + - ]: 30 : return PackageMempoolAcceptResult(package_state, {});
1575 : 781 : }
1576 : : }
1577 : :
1578 : : // Transactions must meet two minimum feerates: the mempool minimum fee and min relay fee.
1579 : : // For transactions consisting of exactly one child and its parents, it suffices to use the
1580 : : // package feerate (total modified fees / total virtual size) to check this requirement.
1581 : : // Note that this is an aggregate feerate; this function has not checked that there are transactions
1582 : : // too low feerate to pay for themselves, or that the child transactions are higher feerate than
1583 : : // their parents. Using aggregate feerate may allow "parents pay for child" behavior and permit
1584 : : // a child that is below mempool minimum feerate. To avoid these behaviors, callers of
1585 : : // AcceptMultipleTransactions need to restrict txns topology (e.g. to ancestor sets) and check
1586 : : // the feerates of individuals and subsets.
1587 : 149 : m_subpackage.m_total_vsize = std::accumulate(workspaces.cbegin(), workspaces.cend(), int64_t{0},
1588 : 762 : [](int64_t sum, auto& ws) { return sum + ws.m_vsize; });
1589 : 149 : m_subpackage.m_total_modified_fees = std::accumulate(workspaces.cbegin(), workspaces.cend(), CAmount{0},
1590 : 762 : [](CAmount sum, auto& ws) { return sum + ws.m_modified_fees; });
1591 [ + - ]: 149 : const CFeeRate package_feerate(m_subpackage.m_total_modified_fees, m_subpackage.m_total_vsize);
1592 : 149 : std::vector<Wtxid> all_package_wtxids;
1593 [ - + + - ]: 149 : all_package_wtxids.reserve(workspaces.size());
1594 [ + - ]: 149 : std::transform(workspaces.cbegin(), workspaces.cend(), std::back_inserter(all_package_wtxids),
1595 : 762 : [](const auto& ws) { return ws.m_ptx->GetWitnessHash(); });
1596 [ + + ]: 149 : TxValidationState placeholder_state;
1597 [ + + + + ]: 234 : if (args.m_package_feerates &&
1598 [ + - ]: 85 : !CheckFeeRate(m_subpackage.m_total_vsize, m_subpackage.m_total_modified_fees, placeholder_state)) {
1599 [ + - + - : 22 : package_state.Invalid(PackageValidationResult::PCKG_TX, "transaction failed");
+ - ]
1600 [ + - ]: 11 : return PackageMempoolAcceptResult(package_state, {{workspaces.back().m_ptx->GetWitnessHash(),
1601 [ + - + - : 77 : MempoolAcceptResult::FeeFailure(placeholder_state, CFeeRate(m_subpackage.m_total_modified_fees, m_subpackage.m_total_vsize), all_package_wtxids)}});
+ - + + -
- ]
1602 : : }
1603 : :
1604 : : // Apply package mempool ancestor/descendant limits. Skip if there is only one transaction,
1605 : : // because it's unnecessary.
1606 [ - + + - : 138 : if (txns.size() > 1 && !PackageMempoolChecks(txns, workspaces, m_subpackage.m_total_vsize, package_state)) {
+ - + + ]
1607 [ + - + - ]: 90 : return PackageMempoolAcceptResult(package_state, std::move(results));
1608 : : }
1609 : :
1610 : : // Now that we've bounded the resulting possible ancestry count, check package for dust spends
1611 [ + - ]: 108 : if (m_pool.m_opts.require_standard) {
1612 [ + - ]: 108 : TxValidationState child_state;
1613 [ + - ]: 108 : Wtxid child_wtxid;
1614 [ + - + + ]: 108 : if (!CheckEphemeralSpends(txns, m_pool.m_opts.dust_relay_feerate, m_pool, child_state, child_wtxid)) {
1615 [ + - + - : 2 : package_state.Invalid(PackageValidationResult::PCKG_TX, "unspent-dust");
+ - ]
1616 [ + - + - : 1 : results.emplace(child_wtxid, MempoolAcceptResult::Failure(child_state));
+ - ]
1617 [ + - + - ]: 3 : return PackageMempoolAcceptResult(package_state, std::move(results));
1618 : : }
1619 : 108 : }
1620 : :
1621 [ + + ]: 744 : for (Workspace& ws : workspaces) {
1622 : 639 : ws.m_package_feerate = package_feerate;
1623 [ + - + + ]: 639 : if (!PolicyScriptChecks(args, ws)) {
1624 : : // Exit early to avoid doing pointless work. Update the failed tx result; the rest are unfinished.
1625 [ + - + - : 4 : package_state.Invalid(PackageValidationResult::PCKG_TX, "transaction failed");
+ - ]
1626 [ + - + - : 2 : results.emplace(ws.m_ptx->GetWitnessHash(), MempoolAcceptResult::Failure(ws.m_state));
+ - ]
1627 [ + - + - ]: 6 : return PackageMempoolAcceptResult(package_state, std::move(results));
1628 : : }
1629 [ + + ]: 637 : if (args.m_test_accept) {
1630 [ - + ]: 530 : const auto effective_feerate = args.m_package_feerates ? ws.m_package_feerate :
1631 [ + - ]: 530 : CFeeRate{ws.m_modified_fees, static_cast<int32_t>(ws.m_vsize)};
1632 [ - + ]: 530 : const auto effective_feerate_wtxids = args.m_package_feerates ? all_package_wtxids :
1633 [ - - + - ]: 530 : std::vector<Wtxid>{ws.m_ptx->GetWitnessHash()};
1634 : 1060 : results.emplace(ws.m_ptx->GetWitnessHash(),
1635 [ + - + - ]: 530 : MempoolAcceptResult::Success(std::move(m_subpackage.m_replaced_transactions),
1636 : : ws.m_vsize, ws.m_base_fees, effective_feerate,
1637 : : effective_feerate_wtxids));
1638 : 530 : }
1639 : : }
1640 : :
1641 [ + + + - : 209 : if (args.m_test_accept) return PackageMempoolAcceptResult(package_state, std::move(results));
+ - ]
1642 : :
1643 [ + - - + ]: 53 : if (!SubmitPackage(args, workspaces, package_state, results)) {
1644 : : // PackageValidationState filled in by SubmitPackage().
1645 [ # # # # ]: 0 : return PackageMempoolAcceptResult(package_state, std::move(results));
1646 : : }
1647 : :
1648 [ + - + - ]: 159 : return PackageMempoolAcceptResult(package_state, std::move(results));
1649 [ + - ]: 514 : }
1650 : :
1651 : 23242 : void MemPoolAccept::CleanupTemporaryCoins()
1652 : : {
1653 : : // There are 3 kinds of coins in m_view:
1654 : : // (1) Temporary coins from the transactions in subpackage, constructed by m_viewmempool.
1655 : : // (2) Mempool coins from transactions in the mempool, constructed by m_viewmempool.
1656 : : // (3) Confirmed coins fetched from our current UTXO set.
1657 : : //
1658 : : // (1) Temporary coins need to be removed, regardless of whether the transaction was submitted.
1659 : : // If the transaction was submitted to the mempool, m_viewmempool will be able to fetch them from
1660 : : // there. If it wasn't submitted to mempool, it is incorrect to keep them - future calls may try
1661 : : // to spend those coins that don't actually exist.
1662 : : // (2) Mempool coins also need to be removed. If the mempool contents have changed as a result
1663 : : // of submitting or replacing transactions, coins previously fetched from mempool may now be
1664 : : // spent or nonexistent. Those coins need to be deleted from m_view.
1665 : : // (3) Confirmed coins don't need to be removed. The chainstate has not changed (we are
1666 : : // holding cs_main and no blocks have been processed) so the confirmed tx cannot disappear like
1667 : : // a mempool tx can. The coin may now be spent after we submitted a tx to mempool, but
1668 : : // we have already checked that the package does not have 2 transactions spending the same coin
1669 : : // and we check whether a mempool transaction spends conflicting coins (CTxMemPool::GetConflictTx).
1670 : : // Keeping them in m_view is an optimization to not re-fetch confirmed coins if we later look up
1671 : : // inputs for this transaction again.
1672 [ + + ]: 27997 : for (const auto& outpoint : m_viewmempool.GetNonBaseCoins()) {
1673 : : // In addition to resetting m_viewmempool, we also need to manually delete these coins from
1674 : : // m_view because it caches copies of the coins it fetched from m_viewmempool previously.
1675 : 4755 : m_view.Uncache(outpoint);
1676 : : }
1677 : : // This deletes the temporary and mempool coins.
1678 : 23242 : m_viewmempool.Reset();
1679 : 23242 : }
1680 : :
1681 : 462 : PackageMempoolAcceptResult MemPoolAccept::AcceptSubPackage(const std::vector<CTransactionRef>& subpackage, ATMPArgs& args)
1682 : : {
1683 : 462 : AssertLockHeld(::cs_main);
1684 : 462 : AssertLockHeld(m_pool.cs);
1685 : 924 : auto result = [&]() EXCLUSIVE_LOCKS_REQUIRED(::cs_main, m_pool.cs) {
1686 [ - + + + ]: 462 : if (subpackage.size() > 1) {
1687 : 93 : return AcceptMultipleTransactions(subpackage, args);
1688 : : }
1689 : 369 : const auto& tx = subpackage.front();
1690 : 369 : ATMPArgs single_args = ATMPArgs::SingleInPackageAccept(args);
1691 : 369 : const auto single_res = AcceptSingleTransaction(tx, single_args);
1692 [ + + ]: 369 : PackageValidationState package_state_wrapped;
1693 [ + + ]: 369 : if (single_res.m_result_type != MempoolAcceptResult::ResultType::VALID) {
1694 [ + - + - : 468 : package_state_wrapped.Invalid(PackageValidationResult::PCKG_TX, "transaction failed");
+ - ]
1695 : : }
1696 [ + - + + : 1476 : return PackageMempoolAcceptResult(package_state_wrapped, {{tx->GetWitnessHash(), single_res}});
- - ]
1697 [ + - + - ]: 1569 : }();
1698 : :
1699 : : // Clean up m_view and m_viewmempool so that other subpackage evaluations don't have access to
1700 : : // coins they shouldn't. Keep some coins in order to minimize re-fetching coins from the UTXO set.
1701 : : // Clean up package feerate and rbf calculations
1702 [ + - ]: 462 : ClearSubPackageState();
1703 : :
1704 : 462 : return result;
1705 : 0 : }
1706 : :
1707 : 167 : PackageMempoolAcceptResult MemPoolAccept::AcceptPackage(const Package& package, ATMPArgs& args)
1708 : : {
1709 : 167 : Assert(!package.empty());
1710 : 167 : AssertLockHeld(cs_main);
1711 : : // Used if returning a PackageMempoolAcceptResult directly from this function.
1712 [ + - ]: 167 : PackageValidationState package_state_quit_early;
1713 : :
1714 : : // There are two topologies we are able to handle through this function:
1715 : : // (1) A single transaction
1716 : : // (2) A child-with-parents package.
1717 : : // Check that the package is well-formed. If it isn't, we won't try to validate any of the
1718 : : // transactions and thus won't return any MempoolAcceptResults, just a package-wide error.
1719 : :
1720 : : // Context-free package checks.
1721 [ + - + + ]: 167 : if (!IsWellFormedPackage(package, package_state_quit_early, /*require_sorted=*/true)) {
1722 [ + - + - ]: 6 : return PackageMempoolAcceptResult(package_state_quit_early, {});
1723 : : }
1724 : :
1725 [ - + + + : 165 : if (package.size() > 1 && !IsChildWithParents(package)) {
+ - + + ]
1726 : : // All transactions in the package must be a parent of the last transaction. This is just an
1727 : : // opportunity for us to fail fast on a context-free check without taking the mempool lock.
1728 [ + - + - : 4 : package_state_quit_early.Invalid(PackageValidationResult::PCKG_POLICY, "package-not-child-with-parents");
+ - ]
1729 [ + - + - ]: 6 : return PackageMempoolAcceptResult(package_state_quit_early, {});
1730 : : }
1731 : :
1732 [ + - ]: 163 : LOCK(m_pool.cs);
1733 : : // Stores results from which we will create the returned PackageMempoolAcceptResult.
1734 : : // A result may be changed if a mempool transaction is evicted later due to LimitMempoolSize().
1735 : 163 : std::map<Wtxid, MempoolAcceptResult> results_final;
1736 : : // Results from individual validation which will be returned if no other result is available for
1737 : : // this transaction. "Nonfinal" because if a transaction fails by itself but succeeds later
1738 : : // (i.e. when evaluated with a fee-bumping child), the result in this map may be discarded.
1739 : 163 : std::map<Wtxid, MempoolAcceptResult> individual_results_nonfinal;
1740 : : // Tracks whether we think package submission could result in successful entry to the mempool
1741 : 163 : bool quit_early{false};
1742 : 163 : std::vector<CTransactionRef> txns_package_eval;
1743 [ + + ]: 631 : for (const auto& tx : package) {
1744 [ + - ]: 468 : const auto& wtxid = tx->GetWitnessHash();
1745 [ + - ]: 468 : const auto& txid = tx->GetHash();
1746 : : // There are 3 possibilities: already in mempool, same-txid-diff-wtxid already in mempool,
1747 : : // or not in mempool. An already confirmed tx is treated as one not in mempool, because all
1748 : : // we know is that the inputs aren't available.
1749 [ + - + + ]: 468 : if (m_pool.exists(wtxid)) {
1750 : : // Exact transaction already exists in the mempool.
1751 : : // Node operators are free to set their mempool policies however they please, nodes may receive
1752 : : // transactions in different orders, and malicious counterparties may try to take advantage of
1753 : : // policy differences to pin or delay propagation of transactions. As such, it's possible for
1754 : : // some package transaction(s) to already be in the mempool, and we don't want to reject the
1755 : : // entire package in that case (as that could be a censorship vector). De-duplicate the
1756 : : // transactions that are already in the mempool, and only call AcceptMultipleTransactions() with
1757 : : // the new transactions. This ensures we don't double-count transaction counts and sizes when
1758 : : // checking ancestor/descendant limits, or double-count transaction fees for fee-related policy.
1759 [ + - + - ]: 97 : const auto& entry{*Assert(m_pool.GetEntry(txid))};
1760 [ + - + - ]: 97 : results_final.emplace(wtxid, MempoolAcceptResult::MempoolTx(entry.GetTxSize(), entry.GetFee()));
1761 [ + - + + ]: 371 : } else if (m_pool.exists(txid)) {
1762 : : // Transaction with the same non-witness data but different witness (same txid,
1763 : : // different wtxid) already exists in the mempool.
1764 : : //
1765 : : // We don't allow replacement transactions right now, so just swap the package
1766 : : // transaction for the mempool one. Note that we are ignoring the validity of the
1767 : : // package transaction passed in.
1768 : : // TODO: allow witness replacement in packages.
1769 [ + - + - ]: 3 : const auto& entry{*Assert(m_pool.GetEntry(txid))};
1770 : : // Provide the wtxid of the mempool tx so that the caller can look it up in the mempool.
1771 [ + - ]: 3 : results_final.emplace(wtxid, MempoolAcceptResult::MempoolTxDifferentWitness(entry.GetTx().GetWitnessHash()));
1772 : : } else {
1773 : : // Transaction does not already exist in the mempool.
1774 : : // Try submitting the transaction on its own.
1775 [ + - + + : 736 : const auto single_package_res = AcceptSubPackage({tx}, args);
+ - - - -
- ]
1776 [ + - ]: 368 : const auto& single_res = single_package_res.m_tx_results.at(wtxid);
1777 [ + + ]: 368 : if (single_res.m_result_type == MempoolAcceptResult::ResultType::VALID) {
1778 : : // The transaction succeeded on its own and is now in the mempool. Don't include it
1779 : : // in package validation, because its fees should only be "used" once.
1780 [ + - - + ]: 135 : assert(m_pool.exists(wtxid));
1781 [ + - ]: 135 : results_final.emplace(wtxid, single_res);
1782 [ - + + + : 233 : } else if (package.size() == 1 || // If there is only one transaction, no need to retry it "as a package"
+ + ]
1783 [ + + ]: 232 : (single_res.m_state.GetResult() != TxValidationResult::TX_RECONSIDERABLE &&
1784 [ + + ]: 137 : single_res.m_state.GetResult() != TxValidationResult::TX_MISSING_INPUTS)) {
1785 : : // Package validation policy only differs from individual policy in its evaluation
1786 : : // of feerate. For example, if a transaction fails here due to violation of a
1787 : : // consensus rule, the result will not change when it is submitted as part of a
1788 : : // package. To minimize the amount of repeated work, unless the transaction fails
1789 : : // due to feerate or missing inputs (its parent is a previous transaction in the
1790 : : // package that failed due to feerate), don't run package validation. Note that this
1791 : : // decision might not make sense if different types of packages are allowed in the
1792 : : // future. Continue individually validating the rest of the transactions, because
1793 : : // some of them may still be valid.
1794 : 27 : quit_early = true;
1795 [ + - + - : 54 : package_state_quit_early.Invalid(PackageValidationResult::PCKG_TX, "transaction failed");
+ - ]
1796 [ + - ]: 27 : individual_results_nonfinal.emplace(wtxid, single_res);
1797 : : } else {
1798 [ + - ]: 206 : individual_results_nonfinal.emplace(wtxid, single_res);
1799 [ + - ]: 206 : txns_package_eval.push_back(tx);
1800 : : }
1801 : 368 : }
1802 : : }
1803 : :
1804 [ + + + + : 395 : auto multi_submission_result = quit_early || txns_package_eval.empty() ? PackageMempoolAcceptResult(package_state_quit_early, {}) :
+ - + + -
- ]
1805 [ + - + - : 232 : AcceptSubPackage(txns_package_eval, args);
+ - ]
1806 : 163 : PackageValidationState& package_state_final = multi_submission_result.m_state;
1807 : :
1808 : : // This is invoked by AcceptSubPackage() already, so this is just here for
1809 : : // clarity (since it's not permitted to invoke LimitMempoolSize() while a
1810 : : // changeset is outstanding).
1811 [ + - ]: 163 : ClearSubPackageState();
1812 : :
1813 : : // Make sure we haven't exceeded max mempool size.
1814 : : // Package transactions that were submitted to mempool or already in mempool may be evicted.
1815 : : // If mempool contents change, then the m_view cache is dirty. It has already been cleared above.
1816 [ + - + - ]: 163 : LimitMempoolSize(m_pool, m_active_chainstate.CoinsTip());
1817 : :
1818 [ + + ]: 631 : for (const auto& tx : package) {
1819 : 468 : const auto& wtxid = tx->GetWitnessHash();
1820 [ + + ]: 468 : if (multi_submission_result.m_tx_results.count(wtxid) > 0) {
1821 : : // We shouldn't have re-submitted if the tx result was already in results_final.
1822 : 124 : Assume(results_final.count(wtxid) == 0);
1823 : : // If it was submitted, check to see if the tx is still in the mempool. It could have
1824 : : // been evicted due to LimitMempoolSize() above.
1825 [ + - ]: 124 : const auto& txresult = multi_submission_result.m_tx_results.at(wtxid);
1826 [ + + + - : 124 : if (txresult.m_result_type == MempoolAcceptResult::ResultType::VALID && !m_pool.exists(wtxid)) {
+ + ]
1827 [ + - + - : 4 : package_state_final.Invalid(PackageValidationResult::PCKG_TX, "transaction failed");
+ - ]
1828 [ + - ]: 2 : TxValidationState mempool_full_state;
1829 [ + - + - : 4 : mempool_full_state.Invalid(TxValidationResult::TX_MEMPOOL_POLICY, "mempool full");
+ - ]
1830 [ + - + - : 4 : results_final.emplace(wtxid, MempoolAcceptResult::Failure(mempool_full_state));
+ - ]
1831 : 2 : } else {
1832 [ + - ]: 122 : results_final.emplace(wtxid, txresult);
1833 : : }
1834 [ + + ]: 344 : } else if (const auto it{results_final.find(wtxid)}; it != results_final.end()) {
1835 : : // Already-in-mempool transaction. Check to see if it's still there, as it could have
1836 : : // been evicted when LimitMempoolSize() was called.
1837 : 235 : Assume(it->second.m_result_type != MempoolAcceptResult::ResultType::INVALID);
1838 : 235 : Assume(individual_results_nonfinal.count(wtxid) == 0);
1839 : : // Query by txid to include the same-txid-different-witness ones.
1840 [ + - - + ]: 235 : if (!m_pool.exists(tx->GetHash())) {
1841 [ # # # # : 0 : package_state_final.Invalid(PackageValidationResult::PCKG_TX, "transaction failed");
# # ]
1842 [ # # ]: 0 : TxValidationState mempool_full_state;
1843 [ # # # # : 0 : mempool_full_state.Invalid(TxValidationResult::TX_MEMPOOL_POLICY, "mempool full");
# # ]
1844 : : // Replace the previous result.
1845 : 0 : results_final.erase(wtxid);
1846 [ # # # # : 0 : results_final.emplace(wtxid, MempoolAcceptResult::Failure(mempool_full_state));
# # ]
1847 : 0 : }
1848 [ + - ]: 109 : } else if (const auto it{individual_results_nonfinal.find(wtxid)}; it != individual_results_nonfinal.end()) {
1849 [ + - ]: 109 : Assume(it->second.m_result_type == MempoolAcceptResult::ResultType::INVALID);
1850 : : // Interesting result from previous processing.
1851 [ + - ]: 109 : results_final.emplace(wtxid, it->second);
1852 : : }
1853 : : }
1854 [ - + ]: 163 : Assume(results_final.size() == package.size());
1855 [ + - + - ]: 326 : return PackageMempoolAcceptResult(package_state_final, std::move(results_final));
1856 [ + - + - : 1229 : }
+ - ]
1857 : :
1858 : : } // anon namespace
1859 : :
1860 : 37650 : MempoolAcceptResult AcceptToMemoryPool(Chainstate& active_chainstate, const CTransactionRef& tx,
1861 : : int64_t accept_time, bool bypass_limits, bool test_accept)
1862 : : {
1863 : 37650 : AssertLockHeld(::cs_main);
1864 [ - + ]: 37650 : const CChainParams& chainparams{active_chainstate.m_chainman.GetParams()};
1865 [ - + ]: 37650 : assert(active_chainstate.GetMempool() != nullptr);
1866 : 37650 : CTxMemPool& pool{*active_chainstate.GetMempool()};
1867 : :
1868 : 37650 : std::vector<COutPoint> coins_to_uncache;
1869 [ + - ]: 37650 : auto args = MemPoolAccept::ATMPArgs::SingleAccept(chainparams, accept_time, bypass_limits, coins_to_uncache, test_accept);
1870 [ + - + - ]: 37650 : MempoolAcceptResult result = MemPoolAccept(pool, active_chainstate).AcceptSingleTransaction(tx, args);
1871 [ + + ]: 37650 : if (result.m_result_type != MempoolAcceptResult::ResultType::VALID) {
1872 : : // Remove coins that were not present in the coins cache before calling
1873 : : // AcceptSingleTransaction(); this is to prevent memory DoS in case we receive a large
1874 : : // number of invalid transactions that attempt to overrun the in-memory coins cache
1875 : : // (`CCoinsViewCache::cacheCoins`).
1876 : :
1877 [ + + ]: 16117 : for (const COutPoint& hashTx : coins_to_uncache)
1878 [ + - + - ]: 6887 : active_chainstate.CoinsTip().Uncache(hashTx);
1879 : : TRACEPOINT(mempool, rejected,
1880 : : tx->GetHash().data(),
1881 : : result.m_state.GetRejectReason().c_str()
1882 : : );
1883 : : }
1884 : : // After we've (potentially) uncached entries, ensure our coins cache is still within its size limits
1885 [ + - ]: 37650 : BlockValidationState state_dummy;
1886 [ + - ]: 37650 : active_chainstate.FlushStateToDisk(state_dummy, FlushStateMode::PERIODIC);
1887 : 37650 : return result;
1888 : 37650 : }
1889 : :
1890 : 254 : PackageMempoolAcceptResult ProcessNewPackage(Chainstate& active_chainstate, CTxMemPool& pool,
1891 : : const Package& package, bool test_accept, const std::optional<CFeeRate>& client_maxfeerate)
1892 : : {
1893 : 254 : AssertLockHeld(cs_main);
1894 [ - + ]: 254 : assert(!package.empty());
1895 [ + - - + ]: 1433 : assert(std::all_of(package.cbegin(), package.cend(), [](const auto& tx){return tx != nullptr;}));
1896 : :
1897 : 254 : std::vector<COutPoint> coins_to_uncache;
1898 [ + - ]: 254 : const CChainParams& chainparams = active_chainstate.m_chainman.GetParams();
1899 : 508 : auto result = [&]() EXCLUSIVE_LOCKS_REQUIRED(cs_main) {
1900 : 254 : AssertLockHeld(cs_main);
1901 [ + + ]: 254 : if (test_accept) {
1902 : 87 : auto args = MemPoolAccept::ATMPArgs::PackageTestAccept(chainparams, GetTime(), coins_to_uncache);
1903 [ + - ]: 87 : return MemPoolAccept(pool, active_chainstate).AcceptMultipleTransactions(package, args);
1904 : : } else {
1905 : 167 : auto args = MemPoolAccept::ATMPArgs::PackageChildWithParents(chainparams, GetTime(), coins_to_uncache, client_maxfeerate);
1906 [ + - ]: 167 : return MemPoolAccept(pool, active_chainstate).AcceptPackage(package, args);
1907 : : }
1908 [ + - ]: 254 : }();
1909 : :
1910 : : // Uncache coins pertaining to transactions that were not submitted to the mempool.
1911 [ + + + + ]: 254 : if (test_accept || result.m_state.IsInvalid()) {
1912 [ + + ]: 1395 : for (const COutPoint& hashTx : coins_to_uncache) {
1913 [ + - + - ]: 1235 : active_chainstate.CoinsTip().Uncache(hashTx);
1914 : : }
1915 : : }
1916 : : // Ensure the coins cache is still within limits.
1917 [ + - ]: 254 : BlockValidationState state_dummy;
1918 [ + - ]: 254 : active_chainstate.FlushStateToDisk(state_dummy, FlushStateMode::PERIODIC);
1919 : 254 : return result;
1920 : 254 : }
1921 : :
1922 : 252729 : CAmount GetBlockSubsidy(int nHeight, const Consensus::Params& consensusParams)
1923 : : {
1924 : 252729 : int halvings = nHeight / consensusParams.nSubsidyHalvingInterval;
1925 : : // Force block reward to zero when right shift is undefined.
1926 [ + + ]: 252729 : if (halvings >= 64)
1927 : : return 0;
1928 : :
1929 : 252166 : CAmount nSubsidy = 50 * COIN;
1930 : : // Subsidy is cut in half every 210,000 blocks which will occur approximately every 4 years.
1931 : 252166 : nSubsidy >>= halvings;
1932 : 252166 : return nSubsidy;
1933 : : }
1934 : :
1935 : 1242 : CoinsViews::CoinsViews(DBParams db_params, CoinsViewOptions options)
1936 [ + + ]: 1244 : : m_dbview{std::move(db_params), std::move(options)},
1937 [ + - ]: 1240 : m_catcherview(&m_dbview) {}
1938 : :
1939 : 1240 : void CoinsViews::InitCache()
1940 : : {
1941 : 1240 : AssertLockHeld(::cs_main);
1942 : 1240 : m_cacheview = std::make_unique<CCoinsViewCache>(&m_catcherview);
1943 : 1240 : }
1944 : :
1945 : 1252 : Chainstate::Chainstate(
1946 : : CTxMemPool* mempool,
1947 : : BlockManager& blockman,
1948 : : ChainstateManager& chainman,
1949 : 1252 : std::optional<uint256> from_snapshot_blockhash)
1950 : 1252 : : m_mempool(mempool),
1951 : 1252 : m_blockman(blockman),
1952 : 1252 : m_chainman(chainman),
1953 : 1252 : m_from_snapshot_blockhash(from_snapshot_blockhash) {}
1954 : :
1955 : 695951 : const CBlockIndex* Chainstate::SnapshotBase() const
1956 : : {
1957 [ + + ]: 695951 : if (!m_from_snapshot_blockhash) return nullptr;
1958 [ + + ]: 18649 : if (!m_cached_snapshot_base) m_cached_snapshot_base = Assert(m_chainman.m_blockman.LookupBlockIndex(*m_from_snapshot_blockhash));
1959 : 18649 : return m_cached_snapshot_base;
1960 : : }
1961 : :
1962 : 1242 : void Chainstate::InitCoinsDB(
1963 : : size_t cache_size_bytes,
1964 : : bool in_memory,
1965 : : bool should_wipe,
1966 : : fs::path leveldb_name)
1967 : : {
1968 [ + + ]: 1242 : if (m_from_snapshot_blockhash) {
1969 : 48 : leveldb_name += node::SNAPSHOT_CHAINSTATE_SUFFIX;
1970 : : }
1971 : :
1972 : 1240 : m_coins_views = std::make_unique<CoinsViews>(
1973 : 1242 : DBParams{
1974 [ + - ]: 1242 : .path = m_chainman.m_options.datadir / leveldb_name,
1975 : : .cache_bytes = cache_size_bytes,
1976 : : .memory_only = in_memory,
1977 : : .wipe_data = should_wipe,
1978 : : .obfuscate = true,
1979 [ + + ]: 1242 : .options = m_chainman.m_options.coins_db},
1980 : 2482 : m_chainman.m_options.coins_view);
1981 : :
1982 : 1240 : m_coinsdb_cache_size_bytes = cache_size_bytes;
1983 : 1240 : }
1984 : :
1985 : 1240 : void Chainstate::InitCoinsCache(size_t cache_size_bytes)
1986 : : {
1987 : 1240 : AssertLockHeld(::cs_main);
1988 [ - + ]: 1240 : assert(m_coins_views != nullptr);
1989 : 1240 : m_coinstip_cache_size_bytes = cache_size_bytes;
1990 : 1240 : m_coins_views->InitCache();
1991 : 1240 : }
1992 : :
1993 : : // Note that though this is marked const, we may end up modifying `m_cached_finished_ibd`, which
1994 : : // is a performance-related implementation detail. This function must be marked
1995 : : // `const` so that `CValidationInterface` clients (which are given a `const Chainstate*`)
1996 : : // can call it.
1997 : : //
1998 : 2039295 : bool ChainstateManager::IsInitialBlockDownload() const
1999 : : {
2000 : : // Optimization: pre-test latch before taking the lock.
2001 [ + + ]: 2039295 : if (m_cached_finished_ibd.load(std::memory_order_relaxed))
2002 : : return false;
2003 : :
2004 : 199328 : LOCK(cs_main);
2005 [ + - ]: 199328 : if (m_cached_finished_ibd.load(std::memory_order_relaxed))
2006 : : return false;
2007 [ + + ]: 199328 : if (m_blockman.LoadingBlocks()) {
2008 : : return true;
2009 : : }
2010 [ + - ]: 174610 : CChain& chain{ActiveChain()};
2011 [ - + + - : 548373 : if (chain.Tip() == nullptr) {
+ - ]
2012 : : return true;
2013 : : }
2014 [ + - - + : 348870 : if (chain.Tip()->nChainWork < MinimumChainWork()) {
+ - + + ]
2015 : : return true;
2016 : : }
2017 [ - + + + ]: 232882 : if (chain.Tip()->Time() < Now<NodeSeconds>() - m_options.max_tip_age) {
2018 : : return true;
2019 : : }
2020 [ + - ]: 727 : LogInfo("Leaving InitialBlockDownload (latching to false)");
2021 : 727 : m_cached_finished_ibd.store(true, std::memory_order_relaxed);
2022 : 727 : return false;
2023 : 199328 : }
2024 : :
2025 : 127427 : void Chainstate::CheckForkWarningConditions()
2026 : : {
2027 : 127427 : AssertLockHeld(cs_main);
2028 : :
2029 : : // Before we get past initial download, we cannot reliably alert about forks
2030 : : // (we assume we don't get stuck on a fork before finishing our initial sync)
2031 : : // Also not applicable to the background chainstate
2032 [ + + + + ]: 127427 : if (m_chainman.IsInitialBlockDownload() || this->GetRole() == ChainstateRole::BACKGROUND) {
2033 : 17422 : return;
2034 : : }
2035 : :
2036 [ + + - + : 137233 : if (m_chainman.m_best_invalid && m_chainman.m_best_invalid->nChainWork > m_chain.Tip()->nChainWork + (GetBlockProof(*m_chain.Tip()) * 6)) {
- + + + ]
2037 : 323 : LogPrintf("%s: Warning: Found invalid chain at least ~6 blocks longer than our best chain.\nChain state database corruption likely.\n", __func__);
2038 [ + - ]: 323 : m_chainman.GetNotifications().warningSet(
2039 : : kernel::Warning::LARGE_WORK_INVALID_CHAIN,
2040 : 646 : _("Warning: We do not appear to fully agree with our peers! You may need to upgrade, or other nodes may need to upgrade."));
2041 : : } else {
2042 : 109682 : m_chainman.GetNotifications().warningUnset(kernel::Warning::LARGE_WORK_INVALID_CHAIN);
2043 : : }
2044 : : }
2045 : :
2046 : : // Called both upon regular invalid block discovery *and* InvalidateBlock
2047 : 5493 : void Chainstate::InvalidChainFound(CBlockIndex* pindexNew)
2048 : : {
2049 : 5493 : AssertLockHeld(cs_main);
2050 [ + + + + ]: 5493 : if (!m_chainman.m_best_invalid || pindexNew->nChainWork > m_chainman.m_best_invalid->nChainWork) {
2051 : 1510 : m_chainman.m_best_invalid = pindexNew;
2052 : : }
2053 : 5493 : SetBlockFailureFlags(pindexNew);
2054 [ + - + + ]: 5493 : if (m_chainman.m_best_header != nullptr && m_chainman.m_best_header->GetAncestor(pindexNew->nHeight) == pindexNew) {
2055 : 2664 : m_chainman.RecalculateBestHeader();
2056 : : }
2057 : :
2058 [ + - + - : 10986 : LogPrintf("%s: invalid block=%s height=%d log2_work=%f date=%s\n", __func__,
+ - ]
2059 : : pindexNew->GetBlockHash().ToString(), pindexNew->nHeight,
2060 : : log(pindexNew->nChainWork.getdouble())/log(2.0), FormatISO8601DateTime(pindexNew->GetBlockTime()));
2061 [ - + ]: 5493 : CBlockIndex *tip = m_chain.Tip();
2062 [ - + ]: 5493 : assert (tip);
2063 [ + - - + : 10986 : LogPrintf("%s: current best=%s height=%d log2_work=%f date=%s\n", __func__,
+ - + - ]
2064 : : tip->GetBlockHash().ToString(), m_chain.Height(), log(tip->nChainWork.getdouble())/log(2.0),
2065 : : FormatISO8601DateTime(tip->GetBlockTime()));
2066 : 5493 : CheckForkWarningConditions();
2067 : 5493 : }
2068 : :
2069 : : // Same as InvalidChainFound, above, except not called directly from InvalidateBlock,
2070 : : // which does its own setBlockIndexCandidates management.
2071 : 2703 : void Chainstate::InvalidBlockFound(CBlockIndex* pindex, const BlockValidationState& state)
2072 : : {
2073 : 2703 : AssertLockHeld(cs_main);
2074 [ + + ]: 2703 : if (state.GetResult() != BlockValidationResult::BLOCK_MUTATED) {
2075 : 2697 : pindex->nStatus |= BLOCK_FAILED_VALID;
2076 : 2697 : m_blockman.m_dirty_blockindex.insert(pindex);
2077 : 2697 : setBlockIndexCandidates.erase(pindex);
2078 : 2697 : InvalidChainFound(pindex);
2079 : : }
2080 : 2703 : }
2081 : :
2082 : 277954 : void UpdateCoins(const CTransaction& tx, CCoinsViewCache& inputs, CTxUndo &txundo, int nHeight)
2083 : : {
2084 : : // mark inputs spent
2085 [ + + ]: 277954 : if (!tx.IsCoinBase()) {
2086 [ - + ]: 93477 : txundo.vprevout.reserve(tx.vin.size());
2087 [ + + ]: 233479 : for (const CTxIn &txin : tx.vin) {
2088 : 140002 : txundo.vprevout.emplace_back();
2089 : 140002 : bool is_spent = inputs.SpendCoin(txin.prevout, &txundo.vprevout.back());
2090 [ - + ]: 140002 : assert(is_spent);
2091 : : }
2092 : : }
2093 : : // add outputs
2094 : 277954 : AddCoins(inputs, tx, nHeight);
2095 : 277954 : }
2096 : :
2097 : 221937 : std::optional<std::pair<ScriptError, std::string>> CScriptCheck::operator()() {
2098 [ + - ]: 221937 : const CScript &scriptSig = ptxTo->vin[nIn].scriptSig;
2099 : 221937 : const CScriptWitness *witness = &ptxTo->vin[nIn].scriptWitness;
2100 : 221937 : ScriptError error{SCRIPT_ERR_UNKNOWN_ERROR};
2101 [ + - + + ]: 221937 : if (VerifyScript(scriptSig, m_tx_out.scriptPubKey, witness, nFlags, CachingTransactionSignatureChecker(ptxTo, nIn, m_tx_out.nValue, cacheStore, *m_signature_cache, *txdata), &error)) {
2102 : 182414 : return std::nullopt;
2103 : : } else {
2104 [ + - + - : 79046 : auto debug_str = strprintf("input %i of %s (wtxid %s), spending %s:%i", nIn, ptxTo->GetHash().ToString(), ptxTo->GetWitnessHash().ToString(), ptxTo->vin[nIn].prevout.hash.ToString(), ptxTo->vin[nIn].prevout.n);
+ - ]
2105 : 39523 : return std::make_pair(error, std::move(debug_str));
2106 : 39523 : }
2107 : : }
2108 : :
2109 : 1204 : ValidationCache::ValidationCache(const size_t script_execution_cache_bytes, const size_t signature_cache_bytes)
2110 [ + - ]: 1204 : : m_signature_cache{signature_cache_bytes}
2111 : : {
2112 : : // Setup the salted hasher
2113 : 1204 : uint256 nonce = GetRandHash();
2114 : : // We want the nonce to be 64 bytes long to force the hasher to process
2115 : : // this chunk, which makes later hash computations more efficient. We
2116 : : // just write our 32-byte entropy twice to fill the 64 bytes.
2117 [ + - ]: 1204 : m_script_execution_cache_hasher.Write(nonce.begin(), 32);
2118 [ + - ]: 1204 : m_script_execution_cache_hasher.Write(nonce.begin(), 32);
2119 : :
2120 [ + - + - ]: 1204 : const auto [num_elems, approx_size_bytes] = m_script_execution_cache.setup_bytes(script_execution_cache_bytes);
2121 [ + - ]: 1204 : LogInfo("Using %zu MiB out of %zu MiB requested for script execution cache, able to store %zu elements",
2122 : : approx_size_bytes >> 20, script_execution_cache_bytes >> 20, num_elems);
2123 : 1204 : }
2124 : :
2125 : : /**
2126 : : * Check whether all of this transaction's input scripts succeed.
2127 : : *
2128 : : * This involves ECDSA signature checks so can be computationally intensive. This function should
2129 : : * only be called after the cheap sanity checks in CheckTxInputs passed.
2130 : : *
2131 : : * If pvChecks is not nullptr, script checks are pushed onto it instead of being performed inline. Any
2132 : : * script checks which are not necessary (eg due to script execution cache hits) are, obviously,
2133 : : * not pushed onto pvChecks/run.
2134 : : *
2135 : : * Setting cacheSigStore/cacheFullScriptStore to false will remove elements from the corresponding cache
2136 : : * which are matched. This is useful for checking blocks where we will likely never need the cache
2137 : : * entry again.
2138 : : *
2139 : : * Note that we may set state.reason to NOT_STANDARD for extra soft-fork flags in flags, block-checking
2140 : : * callers should probably reset it to CONSENSUS in such cases.
2141 : : *
2142 : : * Non-static (and redeclared) in src/test/txvalidationcache_tests.cpp
2143 : : */
2144 : 259951 : bool CheckInputScripts(const CTransaction& tx, TxValidationState& state,
2145 : : const CCoinsViewCache& inputs, unsigned int flags, bool cacheSigStore,
2146 : : bool cacheFullScriptStore, PrecomputedTransactionData& txdata,
2147 : : ValidationCache& validation_cache,
2148 : : std::vector<CScriptCheck>* pvChecks)
2149 : : {
2150 [ + - ]: 259951 : if (tx.IsCoinBase()) return true;
2151 : :
2152 [ + + ]: 259951 : if (pvChecks) {
2153 [ - + ]: 129766 : pvChecks->reserve(tx.vin.size());
2154 : : }
2155 : :
2156 : : // First check if script executions have been cached with the same
2157 : : // flags. Note that this assumes that the inputs provided are
2158 : : // correct (ie that the transaction hash which is in tx's prevouts
2159 : : // properly commits to the scriptPubKey in the inputs view of that
2160 : : // transaction).
2161 : 259951 : uint256 hashCacheEntry;
2162 : 259951 : CSHA256 hasher = validation_cache.ScriptExecutionCacheHasher();
2163 : 259951 : hasher.Write(UCharCast(tx.GetWitnessHash().begin()), 32).Write((unsigned char*)&flags, sizeof(flags)).Finalize(hashCacheEntry.begin());
2164 : 259951 : AssertLockHeld(cs_main); //TODO: Remove this requirement by making CuckooCache not require external locks
2165 [ + + ]: 259951 : if (validation_cache.m_script_execution_cache.contains(hashCacheEntry, !cacheFullScriptStore)) {
2166 : : return true;
2167 : : }
2168 : :
2169 [ + + ]: 190657 : if (!txdata.m_spent_outputs_ready) {
2170 : 61389 : std::vector<CTxOut> spent_outputs;
2171 [ - + + - ]: 61389 : spent_outputs.reserve(tx.vin.size());
2172 : :
2173 [ + + ]: 164058 : for (const auto& txin : tx.vin) {
2174 : 102669 : const COutPoint& prevout = txin.prevout;
2175 [ + - ]: 102669 : const Coin& coin = inputs.AccessCoin(prevout);
2176 [ - + ]: 102669 : assert(!coin.IsSpent());
2177 [ + - ]: 102669 : spent_outputs.emplace_back(coin.out);
2178 : : }
2179 [ + - ]: 61389 : txdata.Init(tx, std::move(spent_outputs));
2180 : 61389 : }
2181 [ - + - + : 190657 : assert(txdata.m_spent_outputs.size() == tx.vin.size());
- + ]
2182 : :
2183 [ - + + + ]: 407869 : for (unsigned int i = 0; i < tx.vin.size(); i++) {
2184 : :
2185 : : // We very carefully only pass in things to CScriptCheck which
2186 : : // are clearly committed to by tx' witness hash. This provides
2187 : : // a sanity check that our caching is not introducing consensus
2188 : : // failures through additional data in, eg, the coins being
2189 : : // spent being checked as a part of CScriptCheck.
2190 : :
2191 : : // Verify signature
2192 : 254060 : CScriptCheck check(txdata.m_spent_outputs[i], tx, validation_cache.m_signature_cache, i, flags, cacheSigStore, &txdata);
2193 [ + + ]: 254060 : if (pvChecks) {
2194 [ + - ]: 82378 : pvChecks->emplace_back(std::move(check));
2195 [ + - + + ]: 171682 : } else if (auto result = check(); result.has_value()) {
2196 : : // Tx failures never trigger disconnections/bans.
2197 : : // This is so that network splits aren't triggered
2198 : : // either due to non-consensus relay policies (such as
2199 : : // non-standard DER encodings or non-null dummy
2200 : : // arguments) or due to new consensus rules introduced in
2201 : : // soft forks.
2202 [ + + ]: 36848 : if (flags & STANDARD_NOT_MANDATORY_VERIFY_FLAGS) {
2203 [ + - + - : 36815 : return state.Invalid(TxValidationResult::TX_NOT_STANDARD, strprintf("mempool-script-verify-flag-failed (%s)", ScriptErrorString(result->first)), result->second);
+ - ]
2204 : : } else {
2205 [ + - + - : 33 : return state.Invalid(TxValidationResult::TX_CONSENSUS, strprintf("block-script-verify-flag-failed (%s)", ScriptErrorString(result->first)), result->second);
+ - ]
2206 : : }
2207 : 171682 : }
2208 : 254060 : }
2209 : :
2210 [ + + ]: 153809 : if (cacheFullScriptStore && !pvChecks) {
2211 : : // We executed all of the provided scripts, and were told to
2212 : : // cache the result. Do so now.
2213 : 56565 : validation_cache.m_script_execution_cache.insert(hashCacheEntry);
2214 : : }
2215 : :
2216 : : return true;
2217 : : }
2218 : :
2219 : 1 : bool FatalError(Notifications& notifications, BlockValidationState& state, const bilingual_str& message)
2220 : : {
2221 : 1 : notifications.fatalError(message);
2222 [ + - ]: 1 : return state.Error(message.original);
2223 : : }
2224 : :
2225 : : /**
2226 : : * Restore the UTXO in a Coin at a given COutPoint
2227 : : * @param undo The Coin to be restored.
2228 : : * @param view The coins view to which to apply the changes.
2229 : : * @param out The out point that corresponds to the tx input.
2230 : : * @return A DisconnectResult as an int
2231 : : */
2232 : 22907 : int ApplyTxInUndo(Coin&& undo, CCoinsViewCache& view, const COutPoint& out)
2233 : : {
2234 : 22907 : bool fClean = true;
2235 : :
2236 [ + + ]: 22907 : if (view.HaveCoin(out)) fClean = false; // overwriting transaction output
2237 : :
2238 [ - + ]: 22907 : if (undo.nHeight == 0) {
2239 : : // Missing undo metadata (height and coinbase). Older versions included this
2240 : : // information only in undo records for the last spend of a transactions'
2241 : : // outputs. This implies that it must be present for some other output of the same tx.
2242 : 0 : const Coin& alternate = AccessByTxid(view, out.hash);
2243 [ # # ]: 0 : if (!alternate.IsSpent()) {
2244 : 0 : undo.nHeight = alternate.nHeight;
2245 : 0 : undo.fCoinBase = alternate.fCoinBase;
2246 : : } else {
2247 : : return DISCONNECT_FAILED; // adding output for transaction without known metadata
2248 : : }
2249 : : }
2250 : : // If the coin already exists as an unspent coin in the cache, then the
2251 : : // possible_overwrite parameter to AddCoin must be set to true. We have
2252 : : // already checked whether an unspent coin exists above using HaveCoin, so
2253 : : // we don't need to guess. When fClean is false, an unspent coin already
2254 : : // existed and it is an overwrite.
2255 : 22907 : view.AddCoin(out, std::move(undo), !fClean);
2256 : :
2257 [ + + ]: 22907 : return fClean ? DISCONNECT_OK : DISCONNECT_UNCLEAN;
2258 : : }
2259 : :
2260 : : /** Undo the effects of this block (with given index) on the UTXO set represented by coins.
2261 : : * When FAILED is returned, view is left in an indeterminate state. */
2262 : 18551 : DisconnectResult Chainstate::DisconnectBlock(const CBlock& block, const CBlockIndex* pindex, CCoinsViewCache& view)
2263 : : {
2264 : 18551 : AssertLockHeld(::cs_main);
2265 : 18551 : bool fClean = true;
2266 : :
2267 : 18551 : CBlockUndo blockUndo;
2268 [ + - + + ]: 18551 : if (!m_blockman.ReadBlockUndo(blockUndo, *pindex)) {
2269 [ + - ]: 3 : LogError("DisconnectBlock(): failure reading undo data\n");
2270 : : return DISCONNECT_FAILED;
2271 : : }
2272 : :
2273 [ - + - + : 18548 : if (blockUndo.vtxundo.size() + 1 != block.vtx.size()) {
- + ]
2274 [ # # ]: 0 : LogError("DisconnectBlock(): block and undo data inconsistent\n");
2275 : : return DISCONNECT_FAILED;
2276 : : }
2277 : :
2278 : : // Ignore blocks that contain transactions which are 'overwritten' by later transactions,
2279 : : // unless those are already completely spent.
2280 : : // See https://github.com/bitcoin/bitcoin/issues/22596 for additional information.
2281 : : // Note: the blocks specified here are different than the ones used in ConnectBlock because DisconnectBlock
2282 : : // unwinds the blocks in reverse. As a result, the inconsistency is not discovered until the earlier
2283 : : // blocks with the duplicate coinbase transactions are disconnected.
2284 [ - + - - ]: 18548 : bool fEnforceBIP30 = !((pindex->nHeight==91722 && pindex->GetBlockHash() == uint256{"00000000000271a2dc26e7667f8419f2e15416dc6955e5a6c6cdf3f2574dd08e"}) ||
2285 [ - + - - ]: 18548 : (pindex->nHeight==91812 && pindex->GetBlockHash() == uint256{"00000000000af0aed4792b1acee3d966af36cf5def14935db8de83d6f9306f2f"}));
2286 : :
2287 : : // undo transactions in reverse order
2288 [ - + + + ]: 49495 : for (int i = block.vtx.size() - 1; i >= 0; i--) {
2289 : 30947 : const CTransaction &tx = *(block.vtx[i]);
2290 : 30947 : Txid hash = tx.GetHash();
2291 : 30947 : bool is_coinbase = tx.IsCoinBase();
2292 : 30947 : bool is_bip30_exception = (is_coinbase && !fEnforceBIP30);
2293 : :
2294 : : // Check that all outputs are available and match the outputs in the block itself
2295 : : // exactly.
2296 [ - + + + ]: 86859 : for (size_t o = 0; o < tx.vout.size(); o++) {
2297 [ + + ]: 55912 : if (!tx.vout[o].scriptPubKey.IsUnspendable()) {
2298 : 38008 : COutPoint out(hash, o);
2299 : 38008 : Coin coin;
2300 [ + - ]: 38008 : bool is_spent = view.SpendCoin(out, &coin);
2301 [ + - + - : 38008 : if (!is_spent || tx.vout[o] != coin.out || pindex->nHeight != coin.nHeight || is_coinbase != coin.fCoinBase) {
+ - - + ]
2302 [ # # ]: 0 : if (!is_bip30_exception) {
2303 : 0 : fClean = false; // transaction output mismatch
2304 : : }
2305 : : }
2306 : 38008 : }
2307 : : }
2308 : :
2309 : : // restore inputs
2310 [ + + ]: 30947 : if (i > 0) { // not coinbases
2311 [ - + ]: 12399 : CTxUndo &txundo = blockUndo.vtxundo[i-1];
2312 [ - + - + : 12399 : if (txundo.vprevout.size() != tx.vin.size()) {
- + ]
2313 [ # # ]: 0 : LogError("DisconnectBlock(): transaction and undo data inconsistent\n");
2314 : : return DISCONNECT_FAILED;
2315 : : }
2316 [ + + ]: 33496 : for (unsigned int j = tx.vin.size(); j > 0;) {
2317 : 21097 : --j;
2318 [ + - ]: 21097 : const COutPoint& out = tx.vin[j].prevout;
2319 [ + - ]: 21097 : int res = ApplyTxInUndo(std::move(txundo.vprevout[j]), view, out);
2320 [ + - ]: 21097 : if (res == DISCONNECT_FAILED) return DISCONNECT_FAILED;
2321 : 21097 : fClean = fClean && res != DISCONNECT_UNCLEAN;
2322 : : }
2323 : : // At this point, all of txundo.vprevout should have been moved out.
2324 : : }
2325 : : }
2326 : :
2327 : : // move best block pointer to prevout block
2328 [ + - ]: 18548 : view.SetBestBlock(pindex->pprev->GetBlockHash());
2329 : :
2330 [ - + ]: 18548 : return fClean ? DISCONNECT_OK : DISCONNECT_UNCLEAN;
2331 : 18551 : }
2332 : :
2333 : 208857 : static unsigned int GetBlockScriptFlags(const CBlockIndex& block_index, const ChainstateManager& chainman)
2334 : : {
2335 : 208857 : const Consensus::Params& consensusparams = chainman.GetConsensus();
2336 : :
2337 : : // BIP16 didn't become active until Apr 1 2012 (on mainnet, and
2338 : : // retroactively applied to testnet)
2339 : : // However, only one historical block violated the P2SH rules (on both
2340 : : // mainnet and testnet).
2341 : : // Similarly, only one historical block violated the TAPROOT rules on
2342 : : // mainnet.
2343 : : // For simplicity, always leave P2SH+WITNESS+TAPROOT on except for the two
2344 : : // violating blocks.
2345 : 208857 : uint32_t flags{SCRIPT_VERIFY_P2SH | SCRIPT_VERIFY_WITNESS | SCRIPT_VERIFY_TAPROOT};
2346 : 208857 : const auto it{consensusparams.script_flag_exceptions.find(*Assert(block_index.phashBlock))};
2347 [ - + ]: 208857 : if (it != consensusparams.script_flag_exceptions.end()) {
2348 : 0 : flags = it->second;
2349 : : }
2350 : :
2351 : : // Enforce the DERSIG (BIP66) rule
2352 [ + + ]: 208857 : if (DeploymentActiveAt(block_index, chainman, Consensus::DEPLOYMENT_DERSIG)) {
2353 : 205985 : flags |= SCRIPT_VERIFY_DERSIG;
2354 : : }
2355 : :
2356 : : // Enforce CHECKLOCKTIMEVERIFY (BIP65)
2357 [ + + ]: 208857 : if (DeploymentActiveAt(block_index, chainman, Consensus::DEPLOYMENT_CLTV)) {
2358 : 206376 : flags |= SCRIPT_VERIFY_CHECKLOCKTIMEVERIFY;
2359 : : }
2360 : :
2361 : : // Enforce CHECKSEQUENCEVERIFY (BIP112)
2362 [ + + ]: 208857 : if (DeploymentActiveAt(block_index, chainman, Consensus::DEPLOYMENT_CSV)) {
2363 : 205067 : flags |= SCRIPT_VERIFY_CHECKSEQUENCEVERIFY;
2364 : : }
2365 : :
2366 : : // Enforce BIP147 NULLDUMMY (activated simultaneously with segwit)
2367 [ + + ]: 208857 : if (DeploymentActiveAt(block_index, chainman, Consensus::DEPLOYMENT_SEGWIT)) {
2368 : 204390 : flags |= SCRIPT_VERIFY_NULLDUMMY;
2369 : : }
2370 : :
2371 : 208857 : return flags;
2372 : : }
2373 : :
2374 : :
2375 : : /** Apply the effects of this block (with given index) on the UTXO set represented by coins.
2376 : : * Validity checks that depend on the UTXO set are also done; ConnectBlock()
2377 : : * can fail if those validity checks fail (among other reasons). */
2378 : 180669 : bool Chainstate::ConnectBlock(const CBlock& block, BlockValidationState& state, CBlockIndex* pindex,
2379 : : CCoinsViewCache& view, bool fJustCheck)
2380 : : {
2381 : 180669 : AssertLockHeld(cs_main);
2382 [ - + ]: 180669 : assert(pindex);
2383 : :
2384 : 180669 : uint256 block_hash{block.GetHash()};
2385 [ - + ]: 180669 : assert(*pindex->phashBlock == block_hash);
2386 : :
2387 : 180669 : const auto time_start{SteadyClock::now()};
2388 : 180669 : const CChainParams& params{m_chainman.GetParams()};
2389 : :
2390 : : // Check it again in case a previous version let a bad block in
2391 : : // NOTE: We don't currently (re-)invoke ContextualCheckBlock() or
2392 : : // ContextualCheckBlockHeader() here. This means that if we add a new
2393 : : // consensus rule that is enforced in one of those two functions, then we
2394 : : // may have let in a block that violates the rule prior to updating the
2395 : : // software, and we would NOT be enforcing the rule here. Fully solving
2396 : : // upgrade from one software version to the next after a consensus rule
2397 : : // change is potentially tricky and issue-specific (see NeedsRedownload()
2398 : : // for one approach that was used for BIP 141 deployment).
2399 : : // Also, currently the rule against blocks more than 2 hours in the future
2400 : : // is enforced in ContextualCheckBlockHeader(); we wouldn't want to
2401 : : // re-enforce that rule here (at least until we make it impossible for
2402 : : // the clock to go backward).
2403 [ - + ]: 180669 : if (!CheckBlock(block, state, params.GetConsensus(), !fJustCheck, !fJustCheck)) {
2404 [ # # ]: 0 : if (state.GetResult() == BlockValidationResult::BLOCK_MUTATED) {
2405 : : // We don't write down blocks to disk if they may have been
2406 : : // corrupted, so this should be impossible unless we're having hardware
2407 : : // problems.
2408 [ # # ]: 0 : return FatalError(m_chainman.GetNotifications(), state, _("Corrupt block found indicating potential hardware failure."));
2409 : : }
2410 [ # # ]: 0 : LogError("%s: Consensus::CheckBlock: %s\n", __func__, state.ToString());
2411 : 0 : return false;
2412 : : }
2413 : :
2414 : : // verify that the view's current state corresponds to the previous block
2415 [ + + ]: 180669 : uint256 hashPrevBlock = pindex->pprev == nullptr ? uint256() : pindex->pprev->GetBlockHash();
2416 [ - + ]: 180669 : assert(hashPrevBlock == view.GetBestBlock());
2417 : :
2418 : 180669 : m_chainman.num_blocks_total++;
2419 : :
2420 : : // Special case for the genesis block, skipping connection of its transactions
2421 : : // (its coinbase is unspendable)
2422 [ + + ]: 180669 : if (block_hash == params.GetConsensus().hashGenesisBlock) {
2423 [ + - ]: 473 : if (!fJustCheck)
2424 : 473 : view.SetBestBlock(pindex->GetBlockHash());
2425 : 473 : return true;
2426 : : }
2427 : :
2428 : 180196 : bool fScriptChecks = true;
2429 [ + + ]: 360392 : if (!m_chainman.AssumedValidBlock().IsNull()) {
2430 : : // We've been configured with the hash of a block which has been externally verified to have a valid history.
2431 : : // A suitable default value is included with the software and updated from time to time. Because validity
2432 : : // relative to a piece of software is an objective fact these defaults can be easily reviewed.
2433 : : // This setting doesn't force the selection of any particular chain but makes validating some faster by
2434 : : // effectively caching the result of part of the verification.
2435 [ + + ]: 4574 : BlockMap::const_iterator it{m_blockman.m_block_index.find(m_chainman.AssumedValidBlock())};
2436 [ + + ]: 4574 : if (it != m_blockman.m_block_index.end()) {
2437 : 2304 : if (it->second.GetAncestor(pindex->nHeight) == pindex &&
2438 [ + + + - : 2508 : m_chainman.m_best_header->GetAncestor(pindex->nHeight) == pindex &&
+ - ]
2439 : 204 : m_chainman.m_best_header->nChainWork >= m_chainman.MinimumChainWork()) {
2440 : : // This block is a member of the assumed verified chain and an ancestor of the best header.
2441 : : // Script verification is skipped when connecting blocks under the
2442 : : // assumevalid block. Assuming the assumevalid block is valid this
2443 : : // is safe because block merkle hashes are still computed and checked,
2444 : : // Of course, if an assumed valid block is invalid due to false scriptSigs
2445 : : // this optimization would allow an invalid chain to be accepted.
2446 : : // The equivalent time check discourages hash power from extorting the network via DOS attack
2447 : : // into accepting an invalid block through telling users they must manually set assumevalid.
2448 : : // Requiring a software change or burying the invalid block, regardless of the setting, makes
2449 : : // it hard to hide the implication of the demand. This also avoids having release candidates
2450 : : // that are hardly doing any signature verification at all in testing without having to
2451 : : // artificially set the default assumed verified block further back.
2452 : : // The test against the minimum chain work prevents the skipping when denied access to any chain at
2453 : : // least as good as the expected chain.
2454 : 204 : fScriptChecks = (GetBlockProofEquivalentTime(*m_chainman.m_best_header, *pindex, *m_chainman.m_best_header, params.GetConsensus()) <= 60 * 60 * 24 * 7 * 2);
2455 : : }
2456 : : }
2457 : : }
2458 : :
2459 : 180196 : const auto time_1{SteadyClock::now()};
2460 : 180196 : m_chainman.time_check += time_1 - time_start;
2461 [ + - ]: 180196 : LogDebug(BCLog::BENCH, " - Sanity checks: %.2fms [%.2fs (%.2fms/blk)]\n",
2462 : : Ticks<MillisecondsDouble>(time_1 - time_start),
2463 : : Ticks<SecondsDouble>(m_chainman.time_check),
2464 : : Ticks<MillisecondsDouble>(m_chainman.time_check) / m_chainman.num_blocks_total);
2465 : :
2466 : : // Do not allow blocks that contain transactions which 'overwrite' older transactions,
2467 : : // unless those are already completely spent.
2468 : : // If such overwrites are allowed, coinbases and transactions depending upon those
2469 : : // can be duplicated to remove the ability to spend the first instance -- even after
2470 : : // being sent to another address.
2471 : : // See BIP30, CVE-2012-1909, and https://r6.ca/blog/20120206T005236Z.html for more information.
2472 : : // This rule was originally applied to all blocks with a timestamp after March 15, 2012, 0:00 UTC.
2473 : : // Now that the whole chain is irreversibly beyond that time it is applied to all blocks except the
2474 : : // two in the chain that violate it. This prevents exploiting the issue against nodes during their
2475 : : // initial block download.
2476 : 180196 : bool fEnforceBIP30 = !IsBIP30Repeat(*pindex);
2477 : :
2478 : : // Once BIP34 activated it was not possible to create new duplicate coinbases and thus other than starting
2479 : : // with the 2 existing duplicate coinbase pairs, not possible to create overwriting txs. But by the
2480 : : // time BIP34 activated, in each of the existing pairs the duplicate coinbase had overwritten the first
2481 : : // before the first had been spent. Since those coinbases are sufficiently buried it's no longer possible to create further
2482 : : // duplicate transactions descending from the known pairs either.
2483 : : // If we're on the known chain at height greater than where BIP34 activated, we can save the db accesses needed for the BIP30 check.
2484 : :
2485 : : // BIP34 requires that a block at height X (block X) has its coinbase
2486 : : // scriptSig start with a CScriptNum of X (indicated height X). The above
2487 : : // logic of no longer requiring BIP30 once BIP34 activates is flawed in the
2488 : : // case that there is a block X before the BIP34 height of 227,931 which has
2489 : : // an indicated height Y where Y is greater than X. The coinbase for block
2490 : : // X would also be a valid coinbase for block Y, which could be a BIP30
2491 : : // violation. An exhaustive search of all mainnet coinbases before the
2492 : : // BIP34 height which have an indicated height greater than the block height
2493 : : // reveals many occurrences. The 3 lowest indicated heights found are
2494 : : // 209,921, 490,897, and 1,983,702 and thus coinbases for blocks at these 3
2495 : : // heights would be the first opportunity for BIP30 to be violated.
2496 : :
2497 : : // The search reveals a great many blocks which have an indicated height
2498 : : // greater than 1,983,702, so we simply remove the optimization to skip
2499 : : // BIP30 checking for blocks at height 1,983,702 or higher. Before we reach
2500 : : // that block in another 25 years or so, we should take advantage of a
2501 : : // future consensus change to do a new and improved version of BIP34 that
2502 : : // will actually prevent ever creating any duplicate coinbases in the
2503 : : // future.
2504 : 180196 : static constexpr int BIP34_IMPLIES_BIP30_LIMIT = 1983702;
2505 : :
2506 : : // There is no potential to create a duplicate coinbase at block 209,921
2507 : : // because this is still before the BIP34 height and so explicit BIP30
2508 : : // checking is still active.
2509 : :
2510 : : // The final case is block 176,684 which has an indicated height of
2511 : : // 490,897. Unfortunately, this issue was not discovered until about 2 weeks
2512 : : // before block 490,897 so there was not much opportunity to address this
2513 : : // case other than to carefully analyze it and determine it would not be a
2514 : : // problem. Block 490,897 was, in fact, mined with a different coinbase than
2515 : : // block 176,684, but it is important to note that even if it hadn't been or
2516 : : // is remined on an alternate fork with a duplicate coinbase, we would still
2517 : : // not run into a BIP30 violation. This is because the coinbase for 176,684
2518 : : // is spent in block 185,956 in transaction
2519 : : // d4f7fbbf92f4a3014a230b2dc70b8058d02eb36ac06b4a0736d9d60eaa9e8781. This
2520 : : // spending transaction can't be duplicated because it also spends coinbase
2521 : : // 0328dd85c331237f18e781d692c92de57649529bd5edf1d01036daea32ffde29. This
2522 : : // coinbase has an indicated height of over 4.2 billion, and wouldn't be
2523 : : // duplicatable until that height, and it's currently impossible to create a
2524 : : // chain that long. Nevertheless we may wish to consider a future soft fork
2525 : : // which retroactively prevents block 490,897 from creating a duplicate
2526 : : // coinbase. The two historical BIP30 violations often provide a confusing
2527 : : // edge case when manipulating the UTXO and it would be simpler not to have
2528 : : // another edge case to deal with.
2529 : :
2530 : : // testnet3 has no blocks before the BIP34 height with indicated heights
2531 : : // post BIP34 before approximately height 486,000,000. After block
2532 : : // 1,983,702 testnet3 starts doing unnecessary BIP30 checking again.
2533 [ - + ]: 180196 : assert(pindex->pprev);
2534 : 180196 : CBlockIndex* pindexBIP34height = pindex->pprev->GetAncestor(params.GetConsensus().BIP34Height);
2535 : : //Only continue to enforce if we're below BIP34 activation height or the block hash at that height doesn't correspond.
2536 [ + - + + : 180196 : fEnforceBIP30 = fEnforceBIP30 && (!pindexBIP34height || !(pindexBIP34height->GetBlockHash() == params.GetConsensus().BIP34Hash));
- + ]
2537 : :
2538 : : // TODO: Remove BIP30 checking from block height 1,983,702 on, once we have a
2539 : : // consensus change that ensures coinbases at those heights cannot
2540 : : // duplicate earlier coinbases.
2541 [ # # ]: 0 : if (fEnforceBIP30 || pindex->nHeight >= BIP34_IMPLIES_BIP30_LIMIT) {
2542 [ + + ]: 421154 : for (const auto& tx : block.vtx) {
2543 [ - + + + ]: 813418 : for (size_t o = 0; o < tx->vout.size(); o++) {
2544 [ + + ]: 572460 : if (view.HaveCoin(COutPoint(tx->GetHash(), o))) {
2545 [ + - + - ]: 2 : state.Invalid(BlockValidationResult::BLOCK_CONSENSUS, "bad-txns-BIP30",
2546 : 2 : "tried to overwrite transaction");
2547 : : }
2548 : : }
2549 : : }
2550 : : }
2551 : :
2552 : : // Enforce BIP68 (sequence locks)
2553 : 180196 : int nLockTimeFlags = 0;
2554 [ + + ]: 180196 : if (DeploymentActiveAt(*pindex, m_chainman, Consensus::DEPLOYMENT_CSV)) {
2555 : 176678 : nLockTimeFlags |= LOCKTIME_VERIFY_SEQUENCE;
2556 : : }
2557 : :
2558 : : // Get the script flags for this block
2559 : 180196 : unsigned int flags{GetBlockScriptFlags(*pindex, m_chainman)};
2560 : :
2561 : 180196 : const auto time_2{SteadyClock::now()};
2562 : 180196 : m_chainman.time_forks += time_2 - time_1;
2563 [ + - ]: 180196 : LogDebug(BCLog::BENCH, " - Fork checks: %.2fms [%.2fs (%.2fms/blk)]\n",
2564 : : Ticks<MillisecondsDouble>(time_2 - time_1),
2565 : : Ticks<SecondsDouble>(m_chainman.time_forks),
2566 : : Ticks<MillisecondsDouble>(m_chainman.time_forks) / m_chainman.num_blocks_total);
2567 : :
2568 [ + + + - ]: 180196 : if (fScriptChecks != m_prev_script_checks_logged && GetRole() == ChainstateRole::NORMAL) {
2569 [ + + + - ]: 3 : LogInfo("%s signature validations at block #%d (%s).", fScriptChecks ? "Enabling" : "Disabling", pindex->nHeight, block_hash.ToString());
2570 : 2 : m_prev_script_checks_logged = fScriptChecks;
2571 : : }
2572 : :
2573 : 180196 : CBlockUndo blockundo;
2574 : :
2575 : : // Precomputed transaction data pointers must not be invalidated
2576 : : // until after `control` has run the script checks (potentially
2577 : : // in multiple threads). Preallocate the vector size so a new allocation
2578 : : // doesn't invalidate pointers into the vector, and keep txsdata in scope
2579 : : // for as long as `control`.
2580 : 180196 : std::optional<CCheckQueueControl<CScriptCheck>> control;
2581 [ + + + + : 180196 : if (auto& queue = m_chainman.GetCheckQueue(); queue.HasThreads() && fScriptChecks) control.emplace(queue);
+ - ]
2582 : :
2583 [ - + + - ]: 180196 : std::vector<PrecomputedTransactionData> txsdata(block.vtx.size());
2584 : :
2585 : 180196 : std::vector<int> prevheights;
2586 : 180196 : CAmount nFees = 0;
2587 : 180196 : int nInputs = 0;
2588 : 180196 : int64_t nSigOpsCost = 0;
2589 [ - + + - ]: 180196 : blockundo.vtxundo.reserve(block.vtx.size() - 1);
2590 [ - + + + ]: 420779 : for (unsigned int i = 0; i < block.vtx.size(); i++)
2591 : : {
2592 [ + + ]: 240955 : if (!state.IsValid()) break;
2593 [ - + ]: 240954 : const CTransaction &tx = *(block.vtx[i]);
2594 : :
2595 [ - + ]: 240954 : nInputs += tx.vin.size();
2596 : :
2597 [ + + ]: 240954 : if (!tx.IsCoinBase())
2598 : : {
2599 : 60759 : CAmount txfee = 0;
2600 [ + - ]: 60759 : TxValidationState tx_state;
2601 [ + - + + ]: 60759 : if (!Consensus::CheckTxInputs(tx, tx_state, view, pindex->nHeight, txfee)) {
2602 : : // Any transaction validation failure in ConnectBlock is a block consensus failure
2603 : 668 : state.Invalid(BlockValidationResult::BLOCK_CONSENSUS,
2604 [ + - ]: 668 : tx_state.GetRejectReason(),
2605 [ + - - + : 1336 : tx_state.GetDebugMessage() + " in transaction " + tx.GetHash().ToString());
+ - + - ]
2606 : 334 : break;
2607 : : }
2608 : 60425 : nFees += txfee;
2609 [ - + ]: 60425 : if (!MoneyRange(nFees)) {
2610 [ # # # # ]: 0 : state.Invalid(BlockValidationResult::BLOCK_CONSENSUS, "bad-txns-accumulated-fee-outofrange",
2611 [ # # ]: 0 : "accumulated fee in the block out of range");
2612 : 0 : break;
2613 : : }
2614 : :
2615 : : // Check that transaction is BIP68 final
2616 : : // BIP68 lock checks (as opposed to nLockTime checks) must
2617 : : // be in ConnectBlock because they require the UTXO set
2618 [ - + + - ]: 60425 : prevheights.resize(tx.vin.size());
2619 [ - + + + ]: 168204 : for (size_t j = 0; j < tx.vin.size(); j++) {
2620 [ + - ]: 107779 : prevheights[j] = view.AccessCoin(tx.vin[j].prevout).nHeight;
2621 : : }
2622 : :
2623 [ + - + + ]: 60425 : if (!SequenceLocks(tx, nLockTimeFlags, prevheights, *pindex)) {
2624 [ + - + - ]: 24 : state.Invalid(BlockValidationResult::BLOCK_CONSENSUS, "bad-txns-nonfinal",
2625 [ + - + - ]: 24 : "contains a non-BIP68-final transaction " + tx.GetHash().ToString());
2626 : 12 : break;
2627 : : }
2628 : 60759 : }
2629 : :
2630 : : // GetTransactionSigOpCost counts 3 types of sigops:
2631 : : // * legacy (always)
2632 : : // * p2sh (when P2SH enabled in flags and excludes coinbase)
2633 : : // * witness (when witness enabled in flags and excludes coinbase)
2634 [ + - ]: 240608 : nSigOpsCost += GetTransactionSigOpCost(tx, view, flags);
2635 [ + + ]: 240608 : if (nSigOpsCost > MAX_BLOCK_SIGOPS_COST) {
2636 [ + - + - : 8 : state.Invalid(BlockValidationResult::BLOCK_CONSENSUS, "bad-blk-sigops", "too many sigops");
+ - ]
2637 : 4 : break;
2638 : : }
2639 : :
2640 [ + + + + ]: 240604 : if (!tx.IsCoinBase() && fScriptChecks)
2641 : : {
2642 : 60408 : bool fCacheResults = fJustCheck; /* Don't cache results if we're actually connecting blocks (still consult the cache, though) */
2643 : 60408 : bool tx_ok;
2644 [ + + ]: 60408 : TxValidationState tx_state;
2645 : : // If CheckInputScripts is called with a pointer to a checks vector, the resulting checks are appended to it. In that case
2646 : : // they need to be added to control which runs them asynchronously. Otherwise, CheckInputScripts runs the checks before returning.
2647 [ + + ]: 60408 : if (control) {
2648 : 59764 : std::vector<CScriptCheck> vChecks;
2649 [ + - ]: 59764 : tx_ok = CheckInputScripts(tx, tx_state, view, flags, fCacheResults, fCacheResults, txsdata[i], m_chainman.m_validation_cache, &vChecks);
2650 [ + - + - ]: 59764 : if (tx_ok) control->Add(std::move(vChecks));
2651 : 59764 : } else {
2652 [ + - ]: 644 : tx_ok = CheckInputScripts(tx, tx_state, view, flags, fCacheResults, fCacheResults, txsdata[i], m_chainman.m_validation_cache);
2653 : : }
2654 [ + + ]: 60408 : if (!tx_ok) {
2655 : : // Any transaction validation failure in ConnectBlock is a block consensus failure
2656 [ - + ]: 21 : state.Invalid(BlockValidationResult::BLOCK_CONSENSUS,
2657 [ - + + - ]: 63 : tx_state.GetRejectReason(), tx_state.GetDebugMessage());
2658 : 21 : break;
2659 : : }
2660 : 60408 : }
2661 : :
2662 : 240583 : CTxUndo undoDummy;
2663 [ + + ]: 240583 : if (i > 0) {
2664 [ + - ]: 60388 : blockundo.vtxundo.emplace_back();
2665 : : }
2666 [ + + + - ]: 240583 : UpdateCoins(tx, view, i == 0 ? undoDummy : blockundo.vtxundo.back(), pindex->nHeight);
2667 : 240583 : }
2668 : 180196 : const auto time_3{SteadyClock::now()};
2669 [ + - ]: 180196 : m_chainman.time_connect += time_3 - time_2;
2670 [ + - + - : 180196 : LogDebug(BCLog::BENCH, " - Connect %u transactions: %.2fms (%.3fms/tx, %.3fms/txin) [%.2fs (%.2fms/blk)]\n", (unsigned)block.vtx.size(),
+ + - + +
- ]
2671 : : Ticks<MillisecondsDouble>(time_3 - time_2), Ticks<MillisecondsDouble>(time_3 - time_2) / block.vtx.size(),
2672 : : nInputs <= 1 ? 0 : Ticks<MillisecondsDouble>(time_3 - time_2) / (nInputs - 1),
2673 : : Ticks<SecondsDouble>(m_chainman.time_connect),
2674 : : Ticks<MillisecondsDouble>(m_chainman.time_connect) / m_chainman.num_blocks_total);
2675 : :
2676 [ + - ]: 180196 : CAmount blockReward = nFees + GetBlockSubsidy(pindex->nHeight, params.GetConsensus());
2677 [ + - + + : 180196 : if (block.vtx[0]->GetValueOut() > blockReward && state.IsValid()) {
+ + ]
2678 [ + - + - ]: 14 : state.Invalid(BlockValidationResult::BLOCK_CONSENSUS, "bad-cb-amount",
2679 [ + - + - ]: 14 : strprintf("coinbase pays too much (actual=%d vs limit=%d)", block.vtx[0]->GetValueOut(), blockReward));
2680 : : }
2681 [ + + ]: 180196 : if (control) {
2682 [ + - ]: 179420 : auto parallel_result = control->Complete();
2683 [ + + + + ]: 179420 : if (parallel_result.has_value() && state.IsValid()) {
2684 [ + - + - : 5236 : state.Invalid(BlockValidationResult::BLOCK_CONSENSUS, strprintf("block-script-verify-flag-failed (%s)", ScriptErrorString(parallel_result->first)), parallel_result->second);
+ - ]
2685 : : }
2686 : 179420 : }
2687 [ + + ]: 180196 : if (!state.IsValid()) {
2688 [ + - + - ]: 2997 : LogInfo("Block validation error: %s", state.ToString());
2689 : 2997 : return false;
2690 : : }
2691 : 177199 : const auto time_4{SteadyClock::now()};
2692 [ + - ]: 177199 : m_chainman.time_verify += time_4 - time_2;
2693 [ + - + - : 177199 : LogDebug(BCLog::BENCH, " - Verify %u txins: %.2fms (%.3fms/txin) [%.2fs (%.2fms/blk)]\n", nInputs - 1,
+ + + - ]
2694 : : Ticks<MillisecondsDouble>(time_4 - time_2),
2695 : : nInputs <= 1 ? 0 : Ticks<MillisecondsDouble>(time_4 - time_2) / (nInputs - 1),
2696 : : Ticks<SecondsDouble>(m_chainman.time_verify),
2697 : : Ticks<MillisecondsDouble>(m_chainman.time_verify) / m_chainman.num_blocks_total);
2698 : :
2699 [ + + ]: 177199 : if (fJustCheck) {
2700 : : return true;
2701 : : }
2702 : :
2703 [ + - + - ]: 130241 : if (!m_blockman.WriteBlockUndo(blockundo, state, *pindex)) {
2704 : : return false;
2705 : : }
2706 : :
2707 : 130241 : const auto time_5{SteadyClock::now()};
2708 [ + - ]: 130241 : m_chainman.time_undo += time_5 - time_4;
2709 [ + - + - : 130241 : LogDebug(BCLog::BENCH, " - Write undo data: %.2fms [%.2fs (%.2fms/blk)]\n",
+ - ]
2710 : : Ticks<MillisecondsDouble>(time_5 - time_4),
2711 : : Ticks<SecondsDouble>(m_chainman.time_undo),
2712 : : Ticks<MillisecondsDouble>(m_chainman.time_undo) / m_chainman.num_blocks_total);
2713 : :
2714 [ + - + + ]: 130241 : if (!pindex->IsValid(BLOCK_VALID_SCRIPTS)) {
2715 : 124775 : pindex->RaiseValidity(BLOCK_VALID_SCRIPTS);
2716 [ + - ]: 124775 : m_blockman.m_dirty_blockindex.insert(pindex);
2717 : : }
2718 : :
2719 : : // add this block to the view's block chain
2720 [ + - ]: 130241 : view.SetBestBlock(pindex->GetBlockHash());
2721 : :
2722 : 130241 : const auto time_6{SteadyClock::now()};
2723 [ + - ]: 130241 : m_chainman.time_index += time_6 - time_5;
2724 [ + - + - : 130241 : LogDebug(BCLog::BENCH, " - Index writing: %.2fms [%.2fs (%.2fms/blk)]\n",
+ - ]
2725 : : Ticks<MillisecondsDouble>(time_6 - time_5),
2726 : : Ticks<SecondsDouble>(m_chainman.time_index),
2727 : : Ticks<MillisecondsDouble>(m_chainman.time_index) / m_chainman.num_blocks_total);
2728 : :
2729 : : TRACEPOINT(validation, block_connected,
2730 : : block_hash.data(),
2731 : : pindex->nHeight,
2732 : : block.vtx.size(),
2733 : : nInputs,
2734 : : nSigOpsCost,
2735 : : Ticks<std::chrono::nanoseconds>(time_5 - time_start)
2736 : : );
2737 : :
2738 : : return true;
2739 : 180196 : }
2740 : :
2741 : 426184 : CoinsCacheSizeState Chainstate::GetCoinsCacheSizeState()
2742 : : {
2743 : 426184 : AssertLockHeld(::cs_main);
2744 : 426184 : return this->GetCoinsCacheSizeState(
2745 : : m_coinstip_cache_size_bytes,
2746 [ + + ]: 426184 : m_mempool ? m_mempool->m_opts.max_size_bytes : 0);
2747 : : }
2748 : :
2749 : 483179 : CoinsCacheSizeState Chainstate::GetCoinsCacheSizeState(
2750 : : size_t max_coins_cache_size_bytes,
2751 : : size_t max_mempool_size_bytes)
2752 : : {
2753 : 483179 : AssertLockHeld(::cs_main);
2754 [ + + ]: 483179 : const int64_t nMempoolUsage = m_mempool ? m_mempool->DynamicMemoryUsage() : 0;
2755 : 483179 : int64_t cacheSize = CoinsTip().DynamicMemoryUsage();
2756 : 483179 : int64_t nTotalSpace =
2757 [ + - ]: 483179 : max_coins_cache_size_bytes + std::max<int64_t>(int64_t(max_mempool_size_bytes) - nMempoolUsage, 0);
2758 : :
2759 [ + + ]: 483179 : if (cacheSize > nTotalSpace) {
2760 : 4 : LogPrintf("Cache size (%s) exceeds total space (%s)\n", cacheSize, nTotalSpace);
2761 : 4 : return CoinsCacheSizeState::CRITICAL;
2762 [ + + + + ]: 541393 : } else if (cacheSize > LargeCoinsCacheThreshold(nTotalSpace)) {
2763 : 9826 : return CoinsCacheSizeState::LARGE;
2764 : : }
2765 : : return CoinsCacheSizeState::OK;
2766 : : }
2767 : :
2768 : 425184 : bool Chainstate::FlushStateToDisk(
2769 : : BlockValidationState &state,
2770 : : FlushStateMode mode,
2771 : : int nManualPruneHeight)
2772 : : {
2773 : 425184 : LOCK(cs_main);
2774 [ + - ]: 425184 : assert(this->CanFlushToDisk());
2775 [ + - ]: 425184 : std::set<int> setFilesToPrune;
2776 : 425184 : bool full_flush_completed = false;
2777 : :
2778 [ + - + - ]: 425184 : const size_t coins_count = CoinsTip().GetCacheSize();
2779 [ + - + - ]: 425184 : const size_t coins_mem_usage = CoinsTip().DynamicMemoryUsage();
2780 : :
2781 : 425184 : try {
2782 : 425184 : {
2783 : 425184 : bool fFlushForPrune = false;
2784 : :
2785 [ + - ]: 425184 : CoinsCacheSizeState cache_state = GetCoinsCacheSizeState();
2786 [ + - ]: 425184 : LOCK(m_blockman.cs_LastBlockFile);
2787 [ + + + + : 425184 : if (m_blockman.IsPruneMode() && (m_blockman.m_check_for_pruning || nManualPruneHeight > 0) && m_chainman.m_blockman.m_blockfiles_indexed) {
+ + + - ]
2788 : : // make sure we don't prune above any of the prune locks bestblocks
2789 : : // pruning is height-based
2790 [ - + ]: 619 : int last_prune{m_chain.Height()}; // last height we can prune
2791 : 619 : std::optional<std::string> limiting_lock; // prune lock that actually was the limiting factor, only used for logging
2792 : :
2793 [ + + - + ]: 968 : for (const auto& prune_lock : m_blockman.m_prune_locks) {
2794 [ - + ]: 349 : if (prune_lock.second.height_first == std::numeric_limits<int>::max()) continue;
2795 : : // Remove the buffer and one additional block here to get actual height that is outside of the buffer
2796 : 349 : const int lock_height{prune_lock.second.height_first - PRUNE_LOCK_BUFFER - 1};
2797 [ + + + + ]: 623 : last_prune = std::max(1, std::min(last_prune, lock_height));
2798 [ + + ]: 349 : if (last_prune == lock_height) {
2799 [ + - ]: 343 : limiting_lock = prune_lock.first;
2800 : : }
2801 : : }
2802 : :
2803 [ + + ]: 619 : if (limiting_lock) {
2804 [ + - + - : 269 : LogDebug(BCLog::PRUNE, "%s limited pruning to height %d\n", limiting_lock.value(), last_prune);
+ - + - ]
2805 : : }
2806 : :
2807 [ + + ]: 619 : if (nManualPruneHeight > 0) {
2808 [ + - + - : 54 : LOG_TIME_MILLIS_WITH_CATEGORY("find files to prune (manual)", BCLog::BENCH);
+ - ]
2809 : :
2810 [ - + ]: 27 : m_blockman.FindFilesToPruneManual(
2811 : : setFilesToPrune,
2812 [ + - ]: 27 : std::min(last_prune, nManualPruneHeight),
2813 : : *this, m_chainman);
2814 : 27 : } else {
2815 [ + - + - : 1184 : LOG_TIME_MILLIS_WITH_CATEGORY("find files to prune", BCLog::BENCH);
+ - ]
2816 : :
2817 [ + - ]: 592 : m_blockman.FindFilesToPrune(setFilesToPrune, last_prune, *this, m_chainman);
2818 : 592 : m_blockman.m_check_for_pruning = false;
2819 : 592 : }
2820 [ + + ]: 619 : if (!setFilesToPrune.empty()) {
2821 : 35 : fFlushForPrune = true;
2822 [ + + ]: 35 : if (!m_blockman.m_have_pruned) {
2823 [ + - + - ]: 15 : m_blockman.m_block_tree_db->WriteFlag("prunedblockfiles", true);
2824 : 15 : m_blockman.m_have_pruned = true;
2825 : : }
2826 : : }
2827 : 619 : }
2828 : 425184 : const auto nNow{NodeClock::now()};
2829 : : // The cache is large and we're within 10% and 10 MiB of the limit, but we have time now (not in the middle of a block processing).
2830 : 425184 : bool fCacheLarge = mode == FlushStateMode::PERIODIC && cache_state >= CoinsCacheSizeState::LARGE;
2831 : : // The cache is over the limit, we have to write now.
2832 : 425184 : bool fCacheCritical = mode == FlushStateMode::IF_NEEDED && cache_state >= CoinsCacheSizeState::CRITICAL;
2833 : : // It's been a while since we wrote the block index and chain state to disk. Do this frequently, so we don't need to redownload or reindex after a crash.
2834 [ + + + + ]: 425184 : bool fPeriodicWrite = mode == FlushStateMode::PERIODIC && nNow >= m_next_write;
2835 : : // Combine all conditions that result in a write to disk.
2836 [ + + + + : 425184 : bool should_write = (mode == FlushStateMode::ALWAYS) || fCacheLarge || fCacheCritical || fPeriodicWrite || fFlushForPrune;
+ + ]
2837 : : // Write blocks, block index and best chain related state to disk.
2838 : 421831 : if (should_write) {
2839 [ + - + + : 3353 : LogDebug(BCLog::COINDB, "Writing chainstate to disk: flush mode=%s, prune=%d, large=%d, critical=%d, periodic=%d",
+ - ]
2840 : : FlushStateModeNames[size_t(mode)], fFlushForPrune, fCacheLarge, fCacheCritical, fPeriodicWrite);
2841 : :
2842 : : // Ensure we can write block index
2843 [ + - - + ]: 3353 : if (!CheckDiskSpace(m_blockman.m_opts.blocks_dir)) {
2844 [ # # # # ]: 0 : return FatalError(m_chainman.GetNotifications(), state, _("Disk space is too low!"));
2845 : : }
2846 : 3353 : {
2847 [ + - + - : 6706 : LOG_TIME_MILLIS_WITH_CATEGORY("write block and undo data to disk", BCLog::BENCH);
+ - ]
2848 : :
2849 : : // First make sure all block and undo data is flushed to disk.
2850 : : // TODO: Handle return error, or add detailed comment why it is
2851 : : // safe to not return an error upon failure.
2852 [ - + + - : 3353 : if (!m_blockman.FlushChainstateBlockFile(m_chain.Height())) {
- + ]
2853 [ # # # # : 0 : LogPrintLevel(BCLog::VALIDATION, BCLog::Level::Warning, "%s: Failed to flush block file.\n", __func__);
# # ]
2854 : : }
2855 : 3353 : }
2856 : :
2857 : : // Then update all block file information (which may refer to block and undo files).
2858 : 3353 : {
2859 [ + - + - : 6706 : LOG_TIME_MILLIS_WITH_CATEGORY("write block index to disk", BCLog::BENCH);
+ - ]
2860 : :
2861 [ + - - + ]: 3353 : if (!m_blockman.WriteBlockIndexDB()) {
2862 [ # # # # ]: 0 : return FatalError(m_chainman.GetNotifications(), state, _("Failed to write to block index database."));
2863 : : }
2864 : 3353 : }
2865 : : // Finally remove any pruned files
2866 [ + + ]: 3353 : if (fFlushForPrune) {
2867 [ + - + - : 70 : LOG_TIME_MILLIS_WITH_CATEGORY("unlink pruned files", BCLog::BENCH);
+ - ]
2868 : :
2869 [ + - ]: 35 : m_blockman.UnlinkPrunedFiles(setFilesToPrune);
2870 : 35 : }
2871 : :
2872 [ + - + - : 6706 : if (!CoinsTip().GetBestBlock().IsNull()) {
+ + ]
2873 [ - + - - ]: 3350 : if (coins_mem_usage >= WARN_FLUSH_COINS_SIZE) LogWarning("Flushing large (%d GiB) UTXO set to disk, it may take several minutes", coins_mem_usage >> 30);
2874 [ + - + - : 6700 : LOG_TIME_MILLIS_WITH_CATEGORY(strprintf("write coins cache to disk (%d coins, %.2fKiB)",
+ - ]
2875 : : coins_count, coins_mem_usage >> 10), BCLog::BENCH);
2876 : :
2877 : : // Typical Coin structures on disk are around 48 bytes in size.
2878 : : // Pushing a new one to the database can cause it to be written
2879 : : // twice (once in the log, and once in the tables). This is already
2880 : : // an overestimation, as most will delete an existing entry or
2881 : : // overwrite one. Still, use a conservative safety factor of 2.
2882 [ + - + - : 3350 : if (!CheckDiskSpace(m_chainman.m_options.datadir, 48 * 2 * 2 * CoinsTip().GetCacheSize())) {
+ - - + ]
2883 [ # # # # ]: 0 : return FatalError(m_chainman.GetNotifications(), state, _("Disk space is too low!"));
2884 : : }
2885 : : // Flush the chainstate (which may refer to block index entries).
2886 [ + + + - : 3350 : const auto empty_cache{(mode == FlushStateMode::ALWAYS) || fCacheLarge || fCacheCritical};
+ - ]
2887 [ + - + - : 3350 : if (empty_cache ? !CoinsTip().Flush() : !CoinsTip().Sync()) {
+ - + - -
+ ]
2888 [ # # # # ]: 0 : return FatalError(m_chainman.GetNotifications(), state, _("Failed to write to coin database."));
2889 : : }
2890 : 3350 : full_flush_completed = true;
2891 : : TRACEPOINT(utxocache, flush,
2892 : : int64_t{Ticks<std::chrono::microseconds>(NodeClock::now() - nNow)},
2893 : : (uint32_t)mode,
2894 : : (uint64_t)coins_count,
2895 : : (uint64_t)coins_mem_usage,
2896 : 3350 : (bool)fFlushForPrune);
2897 : 3350 : }
2898 : : }
2899 : :
2900 [ + + ]: 421831 : if (should_write || m_next_write == NodeClock::time_point::max()) {
2901 : 4258 : constexpr auto range{DATABASE_WRITE_INTERVAL_MAX - DATABASE_WRITE_INTERVAL_MIN};
2902 : 4258 : m_next_write = FastRandomContext().rand_uniform_delay(NodeClock::now() + DATABASE_WRITE_INTERVAL_MIN, range);
2903 : : }
2904 : 0 : }
2905 [ + + + - ]: 425184 : if (full_flush_completed && m_chainman.m_options.signals) {
2906 : : // Update best block in wallet (so we can detect restored wallets).
2907 [ - + + - : 10050 : m_chainman.m_options.signals->ChainStateFlushed(this->GetRole(), GetLocator(m_chain.Tip()));
+ - + - ]
2908 : : }
2909 [ - - ]: 0 : } catch (const std::runtime_error& e) {
2910 [ - - - - ]: 0 : return FatalError(m_chainman.GetNotifications(), state, strprintf(_("System error while flushing: %s"), e.what()));
2911 : 0 : }
2912 : : return true;
2913 [ + - ]: 850368 : }
2914 : :
2915 : 3212 : void Chainstate::ForceFlushStateToDisk()
2916 : : {
2917 [ + - ]: 3212 : BlockValidationState state;
2918 [ + - - + ]: 3212 : if (!this->FlushStateToDisk(state, FlushStateMode::ALWAYS)) {
2919 [ # # # # ]: 0 : LogPrintf("%s: failed to flush state (%s)\n", __func__, state.ToString());
2920 : : }
2921 : 3212 : }
2922 : :
2923 : 61 : void Chainstate::PruneAndFlush()
2924 : : {
2925 [ + - ]: 61 : BlockValidationState state;
2926 : 61 : m_blockman.m_check_for_pruning = true;
2927 [ + - - + ]: 61 : if (!this->FlushStateToDisk(state, FlushStateMode::NONE)) {
2928 [ # # # # ]: 0 : LogPrintf("%s: failed to flush state (%s)\n", __func__, state.ToString());
2929 : : }
2930 : 61 : }
2931 : :
2932 : 141997 : static void UpdateTipLog(
2933 : : const ChainstateManager& chainman,
2934 : : const CCoinsViewCache& coins_tip,
2935 : : const CBlockIndex* tip,
2936 : : const std::string& func_name,
2937 : : const std::string& prefix,
2938 : : const std::string& warning_messages) EXCLUSIVE_LOCKS_REQUIRED(::cs_main)
2939 : : {
2940 : :
2941 : 141997 : AssertLockHeld(::cs_main);
2942 : :
2943 : : // Disable rate limiting in LogPrintLevel_ so this source location may log during IBD.
2944 [ + + + - : 283994 : LogPrintLevel_(BCLog::LogFlags::ALL, BCLog::Level::Info, /*should_ratelimit=*/false, "%s%s: new best=%s height=%d version=0x%08x log2_work=%f tx=%lu date='%s' progress=%f cache=%.1fMiB(%utxo)%s\n",
+ - + - +
- + - + -
+ - ]
2945 : : prefix, func_name,
2946 : : tip->GetBlockHash().ToString(), tip->nHeight, tip->nVersion,
2947 : : log(tip->nChainWork.getdouble()) / log(2.0), tip->m_chain_tx_count,
2948 : : FormatISO8601DateTime(tip->GetBlockTime()),
2949 : : chainman.GuessVerificationProgress(tip),
2950 : : coins_tip.DynamicMemoryUsage() * (1.0 / (1 << 20)),
2951 : : coins_tip.GetCacheSize(),
2952 : : !warning_messages.empty() ? strprintf(" warning='%s'", warning_messages) : "");
2953 : 141997 : }
2954 : :
2955 : 142898 : void Chainstate::UpdateTip(const CBlockIndex* pindexNew)
2956 : : {
2957 : 142898 : AssertLockHeld(::cs_main);
2958 : 142898 : const auto& coins_tip = this->CoinsTip();
2959 : :
2960 : : // The remainder of the function isn't relevant if we are not acting on
2961 : : // the active chainstate, so return if need be.
2962 [ + + ]: 142898 : if (this != &m_chainman.ActiveChainstate()) {
2963 : : // Only log every so often so that we don't bury log messages at the tip.
2964 : 901 : constexpr int BACKGROUND_LOG_INTERVAL = 2000;
2965 [ - + ]: 901 : if (pindexNew->nHeight % BACKGROUND_LOG_INTERVAL == 0) {
2966 [ # # # # : 0 : UpdateTipLog(m_chainman, coins_tip, pindexNew, __func__, "[background validation] ", "");
# # ]
2967 : : }
2968 : 901 : return;
2969 : : }
2970 : :
2971 : : // New best block
2972 [ + - ]: 141997 : if (m_mempool) {
2973 : 141997 : m_mempool->AddTransactionsUpdated(1);
2974 : : }
2975 : :
2976 : 141997 : std::vector<bilingual_str> warning_messages;
2977 [ + - + + ]: 141997 : if (!m_chainman.IsInitialBlockDownload()) {
2978 [ + - ]: 123901 : auto bits = m_chainman.m_versionbitscache.CheckUnknownActivations(pindexNew, m_chainman.GetParams());
2979 [ + - + + ]: 124049 : for (auto [bit, active] : bits) {
2980 [ + - ]: 148 : const bilingual_str warning = strprintf(_("Unknown new rules activated (versionbit %i)"), bit);
2981 [ + + ]: 148 : if (active) {
2982 [ + - ]: 4 : m_chainman.GetNotifications().warningSet(kernel::Warning::UNKNOWN_NEW_RULES_ACTIVATED, warning);
2983 : : } else {
2984 [ + - ]: 144 : warning_messages.push_back(warning);
2985 : : }
2986 : 148 : }
2987 : 123901 : }
2988 [ + - + - : 283994 : UpdateTipLog(m_chainman, coins_tip, pindexNew, __func__, "",
+ - ]
2989 [ + - + - : 425991 : util::Join(warning_messages, Untranslated(", ")).original);
+ - ]
2990 : 141997 : }
2991 : :
2992 : : /** Disconnect m_chain's tip.
2993 : : * After calling, the mempool will be in an inconsistent state, with
2994 : : * transactions from disconnected blocks being added to disconnectpool. You
2995 : : * should make the mempool consistent again by calling MaybeUpdateMempoolForReorg.
2996 : : * with cs_main held.
2997 : : *
2998 : : * If disconnectpool is nullptr, then no disconnected transactions are added to
2999 : : * disconnectpool (note that the caller is responsible for mempool consistency
3000 : : * in any case).
3001 : : */
3002 : 13310 : bool Chainstate::DisconnectTip(BlockValidationState& state, DisconnectedBlockTransactions* disconnectpool)
3003 : : {
3004 : 13310 : AssertLockHeld(cs_main);
3005 : 13310 : if (m_mempool) AssertLockHeld(m_mempool->cs);
3006 : :
3007 [ - + ]: 13310 : CBlockIndex *pindexDelete = m_chain.Tip();
3008 [ - + ]: 13310 : assert(pindexDelete);
3009 [ - + ]: 13310 : assert(pindexDelete->pprev);
3010 : : // Read block from disk.
3011 : 13310 : std::shared_ptr<CBlock> pblock = std::make_shared<CBlock>();
3012 [ + - ]: 13310 : CBlock& block = *pblock;
3013 [ + - - + ]: 13310 : if (!m_blockman.ReadBlock(block, *pindexDelete)) {
3014 [ # # ]: 0 : LogError("DisconnectTip(): Failed to read block\n");
3015 : : return false;
3016 : : }
3017 : : // Apply the block atomically to the chain state.
3018 : 13310 : const auto time_start{SteadyClock::now()};
3019 : 13310 : {
3020 [ + - + - ]: 13310 : CCoinsViewCache view(&CoinsTip());
3021 [ + - - + ]: 13310 : assert(view.GetBestBlock() == pindexDelete->GetBlockHash());
3022 [ + - + + ]: 13310 : if (DisconnectBlock(block, pindexDelete, view) != DISCONNECT_OK) {
3023 [ + - + - ]: 3 : LogError("DisconnectTip(): DisconnectBlock %s failed\n", pindexDelete->GetBlockHash().ToString());
3024 : 3 : return false;
3025 : : }
3026 [ + - ]: 13307 : bool flushed = view.Flush();
3027 [ - + ]: 13307 : assert(flushed);
3028 : 13310 : }
3029 [ + - + - : 13307 : LogDebug(BCLog::BENCH, "- Disconnect block: %.2fms\n",
+ - ]
3030 : : Ticks<MillisecondsDouble>(SteadyClock::now() - time_start));
3031 : :
3032 : 13307 : {
3033 : : // Prune locks that began at or after the tip should be moved backward so they get a chance to reorg
3034 : 13307 : const int max_height_first{pindexDelete->nHeight - 1};
3035 [ + + - + ]: 13418 : for (auto& prune_lock : m_blockman.m_prune_locks) {
3036 [ - + ]: 111 : if (prune_lock.second.height_first <= max_height_first) continue;
3037 : :
3038 : 111 : prune_lock.second.height_first = max_height_first;
3039 [ + - + - : 111 : LogDebug(BCLog::PRUNE, "%s prune lock moved back to %d\n", prune_lock.first, max_height_first);
+ - ]
3040 : : }
3041 : : }
3042 : :
3043 : : // Write the chain state to disk, if necessary.
3044 [ + - + - ]: 13307 : if (!FlushStateToDisk(state, FlushStateMode::IF_NEEDED)) {
3045 : : return false;
3046 : : }
3047 : :
3048 [ + - + + ]: 13307 : if (disconnectpool && m_mempool) {
3049 : : // Save transactions to re-add to mempool at end of reorg. If any entries are evicted for
3050 : : // exceeding memory limits, remove them and their descendants from the mempool.
3051 [ + - + + ]: 17056 : for (auto&& evicted_tx : disconnectpool->AddTransactionsFromBlock(block.vtx)) {
3052 [ + - ]: 3849 : m_mempool->removeRecursive(*evicted_tx, MemPoolRemovalReason::REORG);
3053 : : }
3054 : : }
3055 : :
3056 [ + - ]: 13307 : m_chain.SetTip(*pindexDelete->pprev);
3057 : :
3058 [ + - ]: 13307 : UpdateTip(pindexDelete->pprev);
3059 : : // Let wallets know transactions went from 1-confirmed to
3060 : : // 0-confirmed or conflicted:
3061 [ + - ]: 13307 : if (m_chainman.m_options.signals) {
3062 [ + - + - ]: 39921 : m_chainman.m_options.signals->BlockDisconnected(pblock, pindexDelete);
3063 : : }
3064 : : return true;
3065 : 13310 : }
3066 : :
3067 [ - + + + : 551730 : struct PerBlockConnectTrace {
- + ]
3068 : : CBlockIndex* pindex = nullptr;
3069 : : std::shared_ptr<const CBlock> pblock;
3070 : 284225 : PerBlockConnectTrace() = default;
3071 : : };
3072 : : /**
3073 : : * Used to track blocks whose transactions were applied to the UTXO state as a
3074 : : * part of a single ActivateBestChainStep call.
3075 : : *
3076 : : * This class is single-use, once you call GetBlocksConnected() you have to throw
3077 : : * it away and make a new one.
3078 : : */
3079 : 32706 : class ConnectTrace {
3080 : : private:
3081 : : std::vector<PerBlockConnectTrace> blocksConnected;
3082 : :
3083 : : public:
3084 : 154634 : explicit ConnectTrace() : blocksConnected(1) {}
3085 : :
3086 : 129591 : void BlockConnected(CBlockIndex* pindex, std::shared_ptr<const CBlock> pblock) {
3087 [ - + ]: 129591 : assert(!blocksConnected.back().pindex);
3088 [ - + ]: 129591 : assert(pindex);
3089 [ - + ]: 129591 : assert(pblock);
3090 : 129591 : blocksConnected.back().pindex = pindex;
3091 : 129591 : blocksConnected.back().pblock = std::move(pblock);
3092 : 129591 : blocksConnected.emplace_back();
3093 : 129591 : }
3094 : :
3095 : 121934 : std::vector<PerBlockConnectTrace>& GetBlocksConnected() {
3096 : : // We always keep one extra block at the end of our list because
3097 : : // blocks are added after all the conflicted transactions have
3098 : : // been filled in. Thus, the last entry should always be an empty
3099 : : // one waiting for the transactions from the next block. We pop
3100 : : // the last entry here to make sure the list we return is sane.
3101 [ - + ]: 121934 : assert(!blocksConnected.back().pindex);
3102 : 121934 : blocksConnected.pop_back();
3103 : 121934 : return blocksConnected;
3104 : : }
3105 : : };
3106 : :
3107 : : /**
3108 : : * Connect a new block to m_chain. block_to_connect is either nullptr or a pointer to a CBlock
3109 : : * corresponding to pindexNew, to bypass loading it again from disk.
3110 : : *
3111 : : * The block is added to connectTrace if connection succeeds.
3112 : : */
3113 : 132280 : bool Chainstate::ConnectTip(
3114 : : BlockValidationState& state,
3115 : : CBlockIndex* pindexNew,
3116 : : std::shared_ptr<const CBlock> block_to_connect,
3117 : : ConnectTrace& connectTrace,
3118 : : DisconnectedBlockTransactions& disconnectpool)
3119 : : {
3120 : 132280 : AssertLockHeld(cs_main);
3121 : 132280 : if (m_mempool) AssertLockHeld(m_mempool->cs);
3122 : :
3123 [ - + - + ]: 264560 : assert(pindexNew->pprev == m_chain.Tip());
3124 : : // Read block from disk.
3125 : 132280 : const auto time_1{SteadyClock::now()};
3126 [ + + ]: 132280 : if (!block_to_connect) {
3127 : 18652 : std::shared_ptr<CBlock> pblockNew = std::make_shared<CBlock>();
3128 [ + - - + ]: 18652 : if (!m_blockman.ReadBlock(*pblockNew, *pindexNew)) {
3129 [ # # # # : 0 : return FatalError(m_chainman.GetNotifications(), state, _("Failed to read block."));
# # ]
3130 : : }
3131 [ - + ]: 18652 : block_to_connect = std::move(pblockNew);
3132 : 18652 : } else {
3133 [ + - ]: 113628 : LogDebug(BCLog::BENCH, " - Using cached block\n");
3134 : : }
3135 : : // Apply the block atomically to the chain state.
3136 : 132280 : const auto time_2{SteadyClock::now()};
3137 : 132280 : SteadyClock::time_point time_3;
3138 : : // When adding aggregate statistics in the future, keep in mind that
3139 : : // num_blocks_total may be zero until the ConnectBlock() call below.
3140 [ + - ]: 132280 : LogDebug(BCLog::BENCH, " - Load block from disk: %.2fms\n",
3141 : : Ticks<MillisecondsDouble>(time_2 - time_1));
3142 : 132280 : {
3143 : 132280 : CCoinsViewCache view(&CoinsTip());
3144 [ + - ]: 132280 : bool rv = ConnectBlock(*block_to_connect, state, pindexNew, view);
3145 [ + - ]: 132280 : if (m_chainman.m_options.signals) {
3146 [ + - ]: 132280 : m_chainman.m_options.signals->BlockChecked(block_to_connect, state);
3147 : : }
3148 [ + + ]: 132280 : if (!rv) {
3149 [ + - ]: 2689 : if (state.IsInvalid())
3150 [ + - ]: 2689 : InvalidBlockFound(pindexNew, state);
3151 [ + - + - : 5378 : LogError("%s: ConnectBlock %s failed, %s\n", __func__, pindexNew->GetBlockHash().ToString(), state.ToString());
+ - ]
3152 : 2689 : return false;
3153 : : }
3154 : 129591 : time_3 = SteadyClock::now();
3155 [ - + ]: 129591 : m_chainman.time_connect_total += time_3 - time_2;
3156 [ - + ]: 129591 : assert(m_chainman.num_blocks_total > 0);
3157 [ + - + - : 129591 : LogDebug(BCLog::BENCH, " - Connect total: %.2fms [%.2fs (%.2fms/blk)]\n",
+ - ]
3158 : : Ticks<MillisecondsDouble>(time_3 - time_2),
3159 : : Ticks<SecondsDouble>(m_chainman.time_connect_total),
3160 : : Ticks<MillisecondsDouble>(m_chainman.time_connect_total) / m_chainman.num_blocks_total);
3161 [ + - ]: 129591 : bool flushed = view.Flush();
3162 [ - + ]: 129591 : assert(flushed);
3163 : 132280 : }
3164 : 129591 : const auto time_4{SteadyClock::now()};
3165 : 129591 : m_chainman.time_flush += time_4 - time_3;
3166 [ + - ]: 129591 : LogDebug(BCLog::BENCH, " - Flush: %.2fms [%.2fs (%.2fms/blk)]\n",
3167 : : Ticks<MillisecondsDouble>(time_4 - time_3),
3168 : : Ticks<SecondsDouble>(m_chainman.time_flush),
3169 : : Ticks<MillisecondsDouble>(m_chainman.time_flush) / m_chainman.num_blocks_total);
3170 : : // Write the chain state to disk, if necessary.
3171 [ + - ]: 129591 : if (!FlushStateToDisk(state, FlushStateMode::IF_NEEDED)) {
3172 : : return false;
3173 : : }
3174 : 129591 : const auto time_5{SteadyClock::now()};
3175 : 129591 : m_chainman.time_chainstate += time_5 - time_4;
3176 [ + - ]: 129591 : LogDebug(BCLog::BENCH, " - Writing chainstate: %.2fms [%.2fs (%.2fms/blk)]\n",
3177 : : Ticks<MillisecondsDouble>(time_5 - time_4),
3178 : : Ticks<SecondsDouble>(m_chainman.time_chainstate),
3179 : : Ticks<MillisecondsDouble>(m_chainman.time_chainstate) / m_chainman.num_blocks_total);
3180 : : // Remove conflicting transactions from the mempool.;
3181 [ + + ]: 129591 : if (m_mempool) {
3182 : 128790 : m_mempool->removeForBlock(block_to_connect->vtx, pindexNew->nHeight);
3183 : 128790 : disconnectpool.removeForBlock(block_to_connect->vtx);
3184 : : }
3185 : : // Update m_chain & related variables.
3186 : 129591 : m_chain.SetTip(*pindexNew);
3187 : 129591 : UpdateTip(pindexNew);
3188 : :
3189 : 129591 : const auto time_6{SteadyClock::now()};
3190 : 129591 : m_chainman.time_post_connect += time_6 - time_5;
3191 : 129591 : m_chainman.time_total += time_6 - time_1;
3192 [ + - ]: 129591 : LogDebug(BCLog::BENCH, " - Connect postprocess: %.2fms [%.2fs (%.2fms/blk)]\n",
3193 : : Ticks<MillisecondsDouble>(time_6 - time_5),
3194 : : Ticks<SecondsDouble>(m_chainman.time_post_connect),
3195 : : Ticks<MillisecondsDouble>(m_chainman.time_post_connect) / m_chainman.num_blocks_total);
3196 [ + - ]: 129591 : LogDebug(BCLog::BENCH, "- Connect block: %.2fms [%.2fs (%.2fms/blk)]\n",
3197 : : Ticks<MillisecondsDouble>(time_6 - time_1),
3198 : : Ticks<SecondsDouble>(m_chainman.time_total),
3199 : : Ticks<MillisecondsDouble>(m_chainman.time_total) / m_chainman.num_blocks_total);
3200 : :
3201 : : // If we are the background validation chainstate, check to see if we are done
3202 : : // validating the snapshot (i.e. our tip has reached the snapshot's base block).
3203 [ + + ]: 129591 : if (this != &m_chainman.ActiveChainstate()) {
3204 : : // This call may set `m_disabled`, which is referenced immediately afterwards in
3205 : : // ActivateBestChain, so that we stop connecting blocks past the snapshot base.
3206 : 801 : m_chainman.MaybeCompleteSnapshotValidation();
3207 : : }
3208 : :
3209 [ + - ]: 129591 : connectTrace.BlockConnected(pindexNew, std::move(block_to_connect));
3210 : 129591 : return true;
3211 : : }
3212 : :
3213 : : /**
3214 : : * Return the tip of the chain with the most work in it, that isn't
3215 : : * known to be invalid (it's however far from certain to be valid).
3216 : : */
3217 : 147149 : CBlockIndex* Chainstate::FindMostWorkChain()
3218 : : {
3219 : 147149 : AssertLockHeld(::cs_main);
3220 : 147424 : do {
3221 : 147424 : CBlockIndex *pindexNew = nullptr;
3222 : :
3223 : : // Find the best candidate header.
3224 : 147424 : {
3225 [ + - ]: 147424 : std::set<CBlockIndex*, CBlockIndexWorkComparator>::reverse_iterator it = setBlockIndexCandidates.rbegin();
3226 [ + - ]: 147424 : if (it == setBlockIndexCandidates.rend())
3227 : : return nullptr;
3228 : 147424 : pindexNew = *it;
3229 : : }
3230 : :
3231 : : // Check whether all blocks on the path between the currently active chain and the candidate are valid.
3232 : : // Just going until the active chain is an optimization, as we know all blocks in it are valid already.
3233 : 147424 : CBlockIndex *pindexTest = pindexNew;
3234 : 147424 : bool fInvalidAncestor = false;
3235 [ + + + + ]: 280010 : while (pindexTest && !m_chain.Contains(pindexTest)) {
3236 [ - - - + ]: 132861 : assert(pindexTest->HaveNumChainTxs() || pindexTest->nHeight == 0);
3237 : :
3238 : : // Pruned nodes may have entries in setBlockIndexCandidates for
3239 : : // which block files have been deleted. Remove those as candidates
3240 : : // for the most work chain if we come across them; we can't switch
3241 : : // to a chain unless we have all the non-active-chain parent blocks.
3242 : 132861 : bool fFailedChain = pindexTest->nStatus & BLOCK_FAILED_MASK;
3243 : 132861 : bool fMissingData = !(pindexTest->nStatus & BLOCK_HAVE_DATA);
3244 [ + + ]: 132861 : if (fFailedChain || fMissingData) {
3245 : : // Candidate chain is not usable (either invalid or missing data)
3246 [ + + + - : 275 : if (fFailedChain && (m_chainman.m_best_invalid == nullptr || pindexNew->nChainWork > m_chainman.m_best_invalid->nChainWork)) {
+ + ]
3247 : 1 : m_chainman.m_best_invalid = pindexNew;
3248 : : }
3249 : 275 : CBlockIndex *pindexFailed = pindexNew;
3250 : : // Remove the entire chain from the set.
3251 [ + + ]: 574 : while (pindexTest != pindexFailed) {
3252 [ - + ]: 299 : if (fFailedChain) {
3253 : 0 : pindexFailed->nStatus |= BLOCK_FAILED_CHILD;
3254 : 0 : m_blockman.m_dirty_blockindex.insert(pindexFailed);
3255 [ + - ]: 299 : } else if (fMissingData) {
3256 : : // If we're missing data, then add back to m_blocks_unlinked,
3257 : : // so that if the block arrives in the future we can try adding
3258 : : // to setBlockIndexCandidates again.
3259 : 299 : m_blockman.m_blocks_unlinked.insert(
3260 : 299 : std::make_pair(pindexFailed->pprev, pindexFailed));
3261 : : }
3262 : 299 : setBlockIndexCandidates.erase(pindexFailed);
3263 : 299 : pindexFailed = pindexFailed->pprev;
3264 : : }
3265 : 275 : setBlockIndexCandidates.erase(pindexTest);
3266 : 275 : fInvalidAncestor = true;
3267 : 275 : break;
3268 : : }
3269 : 132586 : pindexTest = pindexTest->pprev;
3270 : : }
3271 [ + + ]: 147424 : if (!fInvalidAncestor)
3272 : : return pindexNew;
3273 : : } while(true);
3274 : : }
3275 : :
3276 : : /** Delete all entries in setBlockIndexCandidates that are worse than the current tip. */
3277 : 130324 : void Chainstate::PruneBlockIndexCandidates() {
3278 : : // Note that we can't delete the current block itself, as we may need to return to it later in case a
3279 : : // reorganization to a better block fails.
3280 : 130324 : std::set<CBlockIndex*, CBlockIndexWorkComparator>::iterator it = setBlockIndexCandidates.begin();
3281 [ + - - + : 808602 : while (it != setBlockIndexCandidates.end() && setBlockIndexCandidates.value_comp()(*it, m_chain.Tip())) {
+ + ]
3282 : 273977 : setBlockIndexCandidates.erase(it++);
3283 : : }
3284 : : // Either the current tip or a successor of it we're working towards is left in setBlockIndexCandidates.
3285 [ - + ]: 130324 : assert(!setBlockIndexCandidates.empty());
3286 : 130324 : }
3287 : :
3288 : : /**
3289 : : * Try to make some progress towards making pindexMostWork the active block.
3290 : : * pblock is either nullptr or a pointer to a CBlock corresponding to pindexMostWork.
3291 : : *
3292 : : * @returns true unless a system error occurred
3293 : : */
3294 : 121935 : bool Chainstate::ActivateBestChainStep(BlockValidationState& state, CBlockIndex* pindexMostWork, const std::shared_ptr<const CBlock>& pblock, bool& fInvalidFound, ConnectTrace& connectTrace)
3295 : : {
3296 : 121935 : AssertLockHeld(cs_main);
3297 : 121935 : if (m_mempool) AssertLockHeld(m_mempool->cs);
3298 : :
3299 [ - + ]: 121935 : const CBlockIndex* pindexOldTip = m_chain.Tip();
3300 : 121935 : const CBlockIndex* pindexFork = m_chain.FindFork(pindexMostWork);
3301 : :
3302 : : // Disconnect active blocks which are no longer in the best chain.
3303 : 121935 : bool fBlocksDisconnected = false;
3304 : 121935 : DisconnectedBlockTransactions disconnectpool{MAX_DISCONNECTED_TX_POOL_BYTES};
3305 [ - + + - : 386058 : while (m_chain.Tip() && m_chain.Tip() != pindexFork) {
+ + ]
3306 [ + + + - ]: 10364 : if (!DisconnectTip(state, &disconnectpool)) {
3307 : : // This is likely a fatal error, but keep the mempool consistent,
3308 : : // just in case. Only remove from the mempool in this case.
3309 [ + - ]: 1 : MaybeUpdateMempoolForReorg(disconnectpool, false);
3310 : :
3311 : : // If we're unable to disconnect a block during normal operation,
3312 : : // then that is a failure of our local system -- we should abort
3313 : : // rather than stay on a less work chain.
3314 [ + - + - ]: 1 : FatalError(m_chainman.GetNotifications(), state, _("Failed to disconnect block."));
3315 : 1 : return false;
3316 : : }
3317 : : fBlocksDisconnected = true;
3318 : : }
3319 : :
3320 : : // Build list of new blocks to connect (in descending height order).
3321 : 121934 : std::vector<CBlockIndex*> vpindexToConnect;
3322 : 121934 : bool fContinue = true;
3323 [ + + ]: 121934 : int nHeight = pindexFork ? pindexFork->nHeight : -1;
3324 [ + + + + ]: 241465 : while (fContinue && nHeight != pindexMostWork->nHeight) {
3325 : : // Don't iterate the entire list of potential improvements toward the best tip, as we likely only need
3326 : : // a few blocks along the way.
3327 [ + + ]: 122220 : int nTargetHeight = std::min(nHeight + 32, pindexMostWork->nHeight);
3328 [ + + ]: 122220 : vpindexToConnect.clear();
3329 [ + - ]: 122220 : vpindexToConnect.reserve(nTargetHeight - nHeight);
3330 [ + - ]: 122220 : CBlockIndex* pindexIter = pindexMostWork->GetAncestor(nTargetHeight);
3331 [ + + + + ]: 460425 : while (pindexIter && pindexIter->nHeight != nHeight) {
3332 [ + - ]: 338205 : vpindexToConnect.push_back(pindexIter);
3333 : 338205 : pindexIter = pindexIter->pprev;
3334 : : }
3335 : 122220 : nHeight = nTargetHeight;
3336 : :
3337 : : // Connect new blocks.
3338 [ + + ]: 132580 : for (CBlockIndex* pindexConnect : vpindexToConnect | std::views::reverse) {
3339 [ + + + - : 249415 : if (!ConnectTip(state, pindexConnect, pindexConnect == pindexMostWork ? pblock : std::shared_ptr<const CBlock>(), connectTrace, disconnectpool)) {
+ + + + ]
3340 [ + - ]: 2689 : if (state.IsInvalid()) {
3341 : : // The block violates a consensus rule.
3342 [ + - ]: 2689 : if (state.GetResult() != BlockValidationResult::BLOCK_MUTATED) {
3343 [ + - ]: 2689 : InvalidChainFound(vpindexToConnect.front());
3344 : : }
3345 : 2689 : state = BlockValidationState();
3346 : 2689 : fInvalidFound = true;
3347 : 2689 : fContinue = false;
3348 : 2689 : break;
3349 : : } else {
3350 : : // A system error occurred (disk space, database error, ...).
3351 : : // Make the mempool consistent with the current tip, just in case
3352 : : // any observers try to use it before shutdown.
3353 [ # # ]: 0 : MaybeUpdateMempoolForReorg(disconnectpool, false);
3354 : : return false;
3355 : : }
3356 : : } else {
3357 [ + - ]: 129591 : PruneBlockIndexCandidates();
3358 [ + + - + : 258709 : if (!pindexOldTip || m_chain.Tip()->nChainWork > pindexOldTip->nChainWork) {
+ - + + ]
3359 : : // We're in a better position than we were. Return temporarily to release the lock.
3360 : : fContinue = false;
3361 : : break;
3362 : : }
3363 : : }
3364 : : }
3365 : : }
3366 : :
3367 [ + + ]: 121934 : if (fBlocksDisconnected) {
3368 : : // If any blocks were disconnected, disconnectpool may be non empty. Add
3369 : : // any disconnected transactions back to the mempool.
3370 [ + - ]: 135 : MaybeUpdateMempoolForReorg(disconnectpool, true);
3371 : : }
3372 [ + + - + : 121934 : if (m_mempool) m_mempool->check(this->CoinsTip(), this->m_chain.Height() + 1);
+ - + - ]
3373 : :
3374 [ + - ]: 121934 : CheckForkWarningConditions();
3375 : :
3376 : : return true;
3377 : 121935 : }
3378 : :
3379 : 213969 : static SynchronizationState GetSynchronizationState(bool init, bool blockfiles_indexed)
3380 : : {
3381 [ + + ]: 213969 : if (!init) return SynchronizationState::POST_INIT;
3382 [ + + ]: 24891 : if (!blockfiles_indexed) return SynchronizationState::INIT_REINDEX;
3383 : : return SynchronizationState::INIT_DOWNLOAD;
3384 : : }
3385 : :
3386 : 182126 : bool ChainstateManager::NotifyHeaderTip()
3387 : : {
3388 : 182126 : bool fNotify = false;
3389 : 182126 : bool fInitialBlockDownload = false;
3390 : 182126 : CBlockIndex* pindexHeader = nullptr;
3391 : 182126 : {
3392 : 182126 : LOCK(GetMutex());
3393 : 182126 : pindexHeader = m_best_header;
3394 : :
3395 [ + + ]: 182126 : if (pindexHeader != m_last_notified_header) {
3396 : 94612 : fNotify = true;
3397 [ + - ]: 94612 : fInitialBlockDownload = IsInitialBlockDownload();
3398 : 94612 : m_last_notified_header = pindexHeader;
3399 : : }
3400 : 182126 : }
3401 : : // Send block tip changed notifications without the lock held
3402 [ + + ]: 182126 : if (fNotify) {
3403 : 94612 : GetNotifications().headerTip(GetSynchronizationState(fInitialBlockDownload, m_blockman.m_blockfiles_indexed), pindexHeader->nHeight, pindexHeader->nTime, false);
3404 : : }
3405 : 182126 : return fNotify;
3406 : : }
3407 : :
3408 : 157680 : static void LimitValidationInterfaceQueue(ValidationSignals& signals) LOCKS_EXCLUDED(cs_main) {
3409 : 157680 : AssertLockNotHeld(cs_main);
3410 : :
3411 [ + + ]: 157680 : if (signals.CallbacksPending() > 10) {
3412 : 2580 : signals.SyncWithValidationInterfaceQueue();
3413 : : }
3414 : 157680 : }
3415 : :
3416 : 144460 : bool Chainstate::ActivateBestChain(BlockValidationState& state, std::shared_ptr<const CBlock> pblock)
3417 : : {
3418 : 144460 : AssertLockNotHeld(m_chainstate_mutex);
3419 : :
3420 : : // Note that while we're often called here from ProcessNewBlock, this is
3421 : : // far from a guarantee. Things in the P2P/RPC will often end up calling
3422 : : // us in the middle of ProcessNewBlock - do not assume pblock is set
3423 : : // sanely for performance or correctness!
3424 : 144460 : AssertLockNotHeld(::cs_main);
3425 : :
3426 : : // ABC maintains a fair degree of expensive-to-calculate internal state
3427 : : // because this function periodically releases cs_main so that it does not lock up other threads for too long
3428 : : // during large connects - and to allow for e.g. the callback queue to drain
3429 : : // we use m_chainstate_mutex to enforce mutual exclusion so that only one caller may execute this function at a time
3430 : 144460 : LOCK(m_chainstate_mutex);
3431 : :
3432 : : // Belt-and-suspenders check that we aren't attempting to advance the background
3433 : : // chainstate past the snapshot base block.
3434 [ + - - + : 288920 : if (WITH_LOCK(::cs_main, return m_disabled)) {
+ - ]
3435 [ # # ]: 0 : LogPrintf("m_disabled is set - this chainstate should not be in operation. "
3436 : : "Please report this as a bug. %s\n", CLIENT_BUGREPORT);
3437 : : return false;
3438 : : }
3439 : :
3440 : 144460 : CBlockIndex *pindexMostWork = nullptr;
3441 : 144460 : CBlockIndex *pindexNewTip = nullptr;
3442 : 144460 : bool exited_ibd{false};
3443 : 154628 : do {
3444 : : // Block until the validation queue drains. This should largely
3445 : : // never happen in normal operation, however may happen during
3446 : : // reindex, causing memory blowup if we run too far ahead.
3447 : : // Note that if a validationinterface callback ends up calling
3448 : : // ActivateBestChain this may lead to a deadlock! We should
3449 : : // probably have a DEBUG_LOCKORDER test for this in the future.
3450 [ + - + - ]: 154628 : if (m_chainman.m_options.signals) LimitValidationInterfaceQueue(*m_chainman.m_options.signals);
3451 : :
3452 : 154628 : {
3453 [ + - ]: 154628 : LOCK(cs_main);
3454 : 154628 : {
3455 : : // Lock transaction pool for at least as long as it takes for connectTrace to be consumed
3456 [ + + + - ]: 307446 : LOCK(MempoolMutex());
3457 [ + - ]: 154628 : const bool was_in_ibd = m_chainman.IsInitialBlockDownload();
3458 [ - + ]: 154628 : CBlockIndex* starting_tip = m_chain.Tip();
3459 : 154628 : bool blocks_connected = false;
3460 : 154634 : do {
3461 : : // We absolutely may not unlock cs_main until we've made forward progress
3462 : : // (with the exception of shutdown due to hardware issues, low disk space, etc).
3463 [ + - ]: 154634 : ConnectTrace connectTrace; // Destructed before cs_main is unlocked
3464 : :
3465 [ + + ]: 154634 : if (pindexMostWork == nullptr) {
3466 [ + - ]: 147149 : pindexMostWork = FindMostWorkChain();
3467 : : }
3468 : :
3469 : : // Whether we have anything to do at all.
3470 [ + - - + : 309268 : if (pindexMostWork == nullptr || pindexMostWork == m_chain.Tip()) {
+ + ]
3471 : : break;
3472 : : }
3473 : :
3474 : 121935 : bool fInvalidFound = false;
3475 : 121935 : std::shared_ptr<const CBlock> nullBlockPtr;
3476 : : // BlockConnected signals must be sent for the original role;
3477 : : // in case snapshot validation is completed during ActivateBestChainStep, the
3478 : : // result of GetRole() changes from BACKGROUND to NORMAL.
3479 [ + - ]: 121935 : const ChainstateRole chainstate_role{this->GetRole()};
3480 [ + + + - : 125442 : if (!ActivateBestChainStep(state, pindexMostWork, pblock && pblock->GetHash() == pindexMostWork->GetBlockHash() ? pblock : nullBlockPtr, fInvalidFound, connectTrace)) {
+ + + - +
+ ]
3481 : : // A system error occurred
3482 [ - + ]: 1 : return false;
3483 : : }
3484 : 121934 : blocks_connected = true;
3485 : :
3486 [ + + ]: 121934 : if (fInvalidFound) {
3487 : : // Wipe cache, we may need another branch now.
3488 : 2689 : pindexMostWork = nullptr;
3489 : : }
3490 [ - + ]: 121934 : pindexNewTip = m_chain.Tip();
3491 : :
3492 [ + + ]: 251525 : for (const PerBlockConnectTrace& trace : connectTrace.GetBlocksConnected()) {
3493 [ + - - + ]: 129591 : assert(trace.pblock && trace.pindex);
3494 [ + - ]: 129591 : if (m_chainman.m_options.signals) {
3495 [ + - ]: 129591 : m_chainman.m_options.signals->BlockConnected(chainstate_role, trace.pblock, trace.pindex);
3496 : : }
3497 : : }
3498 : :
3499 : : // This will have been toggled in
3500 : : // ActivateBestChainStep -> ConnectTip -> MaybeCompleteSnapshotValidation,
3501 : : // if at all, so we should catch it here.
3502 : : //
3503 : : // Break this do-while to ensure we don't advance past the base snapshot.
3504 [ + + ]: 121934 : if (m_disabled) {
3505 : : break;
3506 : : }
3507 [ - + + - : 276574 : } while (!m_chain.Tip() || (starting_tip && CBlockIndexWorkComparator()(m_chain.Tip(), starting_tip)));
+ + + - +
+ + + ]
3508 [ + + ]: 154627 : if (!blocks_connected) return true;
3509 : :
3510 [ + - ]: 121928 : const CBlockIndex* pindexFork = m_chain.FindFork(starting_tip);
3511 [ + - ]: 121928 : bool still_in_ibd = m_chainman.IsInitialBlockDownload();
3512 : :
3513 [ + + ]: 121928 : if (was_in_ibd && !still_in_ibd) {
3514 : : // Active chainstate has exited IBD.
3515 : 454 : exited_ibd = true;
3516 : : }
3517 : :
3518 : : // Notify external listeners about the new tip.
3519 : : // Enqueue while holding cs_main to ensure that UpdatedBlockTip is called in the order in which blocks are connected
3520 [ + - + + : 121928 : if (this == &m_chainman.ActiveChainstate() && pindexFork != pindexNewTip) {
+ + ]
3521 : : // Notify ValidationInterface subscribers
3522 [ + - ]: 118537 : if (m_chainman.m_options.signals) {
3523 [ + - ]: 118537 : m_chainman.m_options.signals->UpdatedBlockTip(pindexNewTip, pindexFork, still_in_ibd);
3524 : : }
3525 : :
3526 [ + - + + ]: 237074 : if (kernel::IsInterrupted(m_chainman.GetNotifications().blockTip(
3527 [ + - ]: 118537 : /*state=*/GetSynchronizationState(still_in_ibd, m_chainman.m_blockman.m_blockfiles_indexed),
3528 : : /*index=*/*pindexNewTip,
3529 : : /*verification_progress=*/m_chainman.GuessVerificationProgress(pindexNewTip))))
3530 : : {
3531 : : // Just breaking and returning success for now. This could
3532 : : // be changed to bubble up the kernel::Interrupted value to
3533 : : // the caller so the caller could distinguish between
3534 : : // completed and interrupted operations.
3535 : : break;
3536 : : }
3537 : : }
3538 [ + - + - ]: 32704 : } // release MempoolMutex
3539 : : // Notify external listeners about the new tip, even if pindexFork == pindexNewTip.
3540 [ + - + - : 121924 : if (m_chainman.m_options.signals && this == &m_chainman.ActiveChainstate()) {
+ + ]
3541 [ + - + - : 121222 : m_chainman.m_options.signals->ActiveTipChange(*Assert(pindexNewTip), m_chainman.IsInitialBlockDownload());
+ - ]
3542 : : }
3543 : 32704 : } // release cs_main
3544 : : // When we reach this point, we switched to a new tip (stored in pindexNewTip).
3545 : :
3546 [ + + ]: 121924 : if (exited_ibd) {
3547 : : // If a background chainstate is in use, we may need to rebalance our
3548 : : // allocation of caches once a chainstate exits initial block download.
3549 [ + - ]: 454 : LOCK(::cs_main);
3550 [ + - ]: 454 : m_chainman.MaybeRebalanceCaches();
3551 : 454 : }
3552 : :
3553 [ + - + + : 243848 : if (WITH_LOCK(::cs_main, return m_disabled)) {
+ - ]
3554 : : // Background chainstate has reached the snapshot base block, so exit.
3555 : :
3556 : : // Restart indexes to resume indexing for all blocks unique to the snapshot
3557 : : // chain. This resumes indexing "in order" from where the indexing on the
3558 : : // background validation chain left off.
3559 : : //
3560 : : // This cannot be done while holding cs_main (within
3561 : : // MaybeCompleteSnapshotValidation) or a cs_main deadlock will occur.
3562 [ + + ]: 7 : if (m_chainman.snapshot_download_completed) {
3563 [ + - ]: 6 : m_chainman.snapshot_download_completed();
3564 : : }
3565 : : break;
3566 : : }
3567 : :
3568 : : // We check interrupt only after giving ActivateBestChainStep a chance to run once so that we
3569 : : // never interrupt before connecting the genesis block during LoadChainTip(). Previously this
3570 : : // caused an assert() failure during interrupt in such cases as the UTXO DB flushing checks
3571 : : // that the best block hash is non-null.
3572 [ + - + + ]: 121917 : if (m_chainman.m_interrupt) break;
3573 [ + + ]: 121915 : } while (pindexNewTip != pindexMostWork);
3574 : :
3575 [ + - ]: 111760 : m_chainman.CheckBlockIndex();
3576 : :
3577 : : // Write changes periodically to disk, after relay.
3578 [ + - - + ]: 111760 : if (!FlushStateToDisk(state, FlushStateMode::PERIODIC)) {
3579 : 0 : return false;
3580 : : }
3581 : :
3582 : : return true;
3583 : 144460 : }
3584 : :
3585 : 10 : bool Chainstate::PreciousBlock(BlockValidationState& state, CBlockIndex* pindex)
3586 : : {
3587 : 10 : AssertLockNotHeld(m_chainstate_mutex);
3588 : 10 : AssertLockNotHeld(::cs_main);
3589 : 10 : {
3590 : 10 : LOCK(cs_main);
3591 [ - + + - : 20 : if (pindex->nChainWork < m_chain.Tip()->nChainWork) {
+ + ]
3592 : : // Nothing to do, this block is not at the tip.
3593 [ + - ]: 1 : return true;
3594 : : }
3595 [ - + + - : 18 : if (m_chain.Tip()->nChainWork > m_chainman.nLastPreciousChainwork) {
+ + ]
3596 : : // The chain has been extended since the last call, reset the counter.
3597 : 5 : m_chainman.nBlockReverseSequenceId = -1;
3598 : : }
3599 [ - + ]: 9 : m_chainman.nLastPreciousChainwork = m_chain.Tip()->nChainWork;
3600 [ + - ]: 9 : setBlockIndexCandidates.erase(pindex);
3601 : 9 : pindex->nSequenceId = m_chainman.nBlockReverseSequenceId;
3602 [ + - ]: 9 : if (m_chainman.nBlockReverseSequenceId > std::numeric_limits<int32_t>::min()) {
3603 : : // We can't keep reducing the counter if somebody really wants to
3604 : : // call preciousblock 2**31-1 times on the same set of tips...
3605 : 9 : m_chainman.nBlockReverseSequenceId--;
3606 : : }
3607 [ + + + - : 17 : if (pindex->IsValid(BLOCK_VALID_TRANSACTIONS) && pindex->HaveNumChainTxs()) {
+ - + - ]
3608 [ + - ]: 8 : setBlockIndexCandidates.insert(pindex);
3609 [ + - ]: 8 : PruneBlockIndexCandidates();
3610 : : }
3611 : 1 : }
3612 : :
3613 [ + - - + ]: 9 : return ActivateBestChain(state, std::shared_ptr<const CBlock>());
3614 : : }
3615 : :
3616 : 109 : bool Chainstate::InvalidateBlock(BlockValidationState& state, CBlockIndex* pindex)
3617 : : {
3618 : 109 : AssertLockNotHeld(m_chainstate_mutex);
3619 : 109 : AssertLockNotHeld(::cs_main);
3620 : :
3621 : : // Genesis block can't be invalidated
3622 [ - + ]: 109 : assert(pindex);
3623 [ + - ]: 109 : if (pindex->nHeight == 0) return false;
3624 : :
3625 : 109 : CBlockIndex* to_mark_failed = pindex;
3626 : 109 : bool pindex_was_in_chain = false;
3627 : 109 : int disconnected = 0;
3628 : :
3629 : : // We do not allow ActivateBestChain() to run while InvalidateBlock() is
3630 : : // running, as that could cause the tip to change while we disconnect
3631 : : // blocks.
3632 : 109 : LOCK(m_chainstate_mutex);
3633 : :
3634 : : // We'll be acquiring and releasing cs_main below, to allow the validation
3635 : : // callbacks to run. However, we should keep the block index in a
3636 : : // consistent state as we disconnect blocks -- in particular we need to
3637 : : // add equal-work blocks to setBlockIndexCandidates as we disconnect.
3638 : : // To avoid walking the block index repeatedly in search of candidates,
3639 : : // build a map once so that we can look up candidate blocks by chain
3640 : : // work as we go.
3641 [ + - ]: 109 : std::multimap<const arith_uint256, CBlockIndex*> highpow_outofchain_headers;
3642 : :
3643 : 109 : {
3644 [ + - ]: 109 : LOCK(cs_main);
3645 [ + + + + : 32604 : for (auto& entry : m_blockman.m_block_index) {
+ - ]
3646 : 32495 : CBlockIndex* candidate = &entry.second;
3647 : : // We don't need to put anything in our active chain into the
3648 : : // multimap, because those candidates will be found and considered
3649 : : // as we disconnect.
3650 : : // Instead, consider only non-active-chain blocks that score
3651 : : // at least as good with CBlockIndexWorkComparator as the new tip.
3652 [ + + ]: 2868 : if (!m_chain.Contains(candidate) &&
3653 [ + - + + ]: 32495 : !CBlockIndexWorkComparator()(candidate, pindex->pprev) &&
3654 [ + + ]: 1386 : !(candidate->nStatus & BLOCK_FAILED_MASK)) {
3655 [ + - ]: 310 : highpow_outofchain_headers.insert({candidate->nChainWork, candidate});
3656 : : }
3657 : : }
3658 : 109 : }
3659 : :
3660 : : // Disconnect (descendants of) pindex, and mark them invalid.
3661 : 5995 : while (true) {
3662 [ + - + - ]: 3052 : if (m_chainman.m_interrupt) break;
3663 : :
3664 : : // Make sure the queue of validation callbacks doesn't grow unboundedly.
3665 [ + - + - ]: 3052 : if (m_chainman.m_options.signals) LimitValidationInterfaceQueue(*m_chainman.m_options.signals);
3666 : :
3667 [ + - ]: 3052 : LOCK(cs_main);
3668 : : // Lock for as long as disconnectpool is in scope to make sure MaybeUpdateMempoolForReorg is
3669 : : // called after DisconnectTip without unlocking in between
3670 [ + - + - ]: 6104 : LOCK(MempoolMutex());
3671 [ + + ]: 3052 : if (!m_chain.Contains(pindex)) break;
3672 : 2945 : pindex_was_in_chain = true;
3673 [ - + ]: 2945 : CBlockIndex *invalid_walk_tip = m_chain.Tip();
3674 : :
3675 : : // ActivateBestChain considers blocks already in m_chain
3676 : : // unconditionally valid already, so force disconnect away from it.
3677 [ + - ]: 2945 : DisconnectedBlockTransactions disconnectpool{MAX_DISCONNECTED_TX_POOL_BYTES};
3678 [ + - ]: 2945 : bool ret = DisconnectTip(state, &disconnectpool);
3679 : : // DisconnectTip will add transactions to disconnectpool.
3680 : : // Adjust the mempool to be consistent with the new tip, adding
3681 : : // transactions back to the mempool if disconnecting was successful,
3682 : : // and we're not doing a very deep invalidation (in which case
3683 : : // keeping the mempool up to date is probably futile anyway).
3684 [ + + + + : 5481 : MaybeUpdateMempoolForReorg(disconnectpool, /* fAddToMempool = */ (++disconnected <= 10) && ret);
+ - ]
3685 [ + + ]: 2945 : if (!ret) return false;
3686 [ - + - + ]: 5886 : assert(invalid_walk_tip->pprev == m_chain.Tip());
3687 : :
3688 : : // We immediately mark the disconnected blocks as invalid.
3689 : : // This prevents a case where pruned nodes may fail to invalidateblock
3690 : : // and be left unable to start as they have no tip candidates (as there
3691 : : // are no blocks that meet the "have data and are not invalid per
3692 : : // nStatus" criteria for inclusion in setBlockIndexCandidates).
3693 : 2943 : invalid_walk_tip->nStatus |= BLOCK_FAILED_VALID;
3694 [ + - ]: 2943 : m_blockman.m_dirty_blockindex.insert(invalid_walk_tip);
3695 [ + - ]: 2943 : setBlockIndexCandidates.erase(invalid_walk_tip);
3696 [ + - ]: 2943 : setBlockIndexCandidates.insert(invalid_walk_tip->pprev);
3697 [ + + + - ]: 2943 : if (invalid_walk_tip == to_mark_failed->pprev && (to_mark_failed->nStatus & BLOCK_FAILED_VALID)) {
3698 : : // We only want to mark the last disconnected block as BLOCK_FAILED_VALID; its children
3699 : : // need to be BLOCK_FAILED_CHILD instead.
3700 : 2839 : to_mark_failed->nStatus = (to_mark_failed->nStatus ^ BLOCK_FAILED_VALID) | BLOCK_FAILED_CHILD;
3701 [ + - ]: 2839 : m_blockman.m_dirty_blockindex.insert(to_mark_failed);
3702 : : }
3703 : :
3704 : : // Mark out-of-chain descendants of the invalidated block as invalid
3705 : : // (possibly replacing a pre-existing BLOCK_FAILED_VALID with BLOCK_FAILED_CHILD)
3706 : : // Add any equal or more work headers that are not invalidated to setBlockIndexCandidates
3707 : : // Recalculate m_best_header if it became invalid.
3708 [ + - ]: 2943 : auto candidate_it = highpow_outofchain_headers.lower_bound(invalid_walk_tip->pprev->nChainWork);
3709 : :
3710 [ + - ]: 2943 : const bool best_header_needs_update{m_chainman.m_best_header->GetAncestor(invalid_walk_tip->nHeight) == invalid_walk_tip};
3711 [ + + ]: 2943 : if (best_header_needs_update) {
3712 : : // pprev is definitely still valid at this point, but there may be better ones
3713 : 2675 : m_chainman.m_best_header = invalid_walk_tip->pprev;
3714 : : }
3715 : :
3716 [ + + ]: 6909 : while (candidate_it != highpow_outofchain_headers.end()) {
3717 [ + - ]: 3966 : CBlockIndex* candidate{candidate_it->second};
3718 [ + - + + ]: 3966 : if (candidate->GetAncestor(invalid_walk_tip->nHeight) == invalid_walk_tip) {
3719 : : // Children of failed blocks should be marked as BLOCK_FAILED_CHILD instead.
3720 : 268 : candidate->nStatus &= ~BLOCK_FAILED_VALID;
3721 : 268 : candidate->nStatus |= BLOCK_FAILED_CHILD;
3722 [ + - ]: 268 : m_blockman.m_dirty_blockindex.insert(candidate);
3723 : : // If invalidated, the block is irrelevant for setBlockIndexCandidates
3724 : : // and for m_best_header and can be removed from the cache.
3725 : 268 : candidate_it = highpow_outofchain_headers.erase(candidate_it);
3726 : 268 : continue;
3727 : : }
3728 [ + - ]: 3698 : if (!CBlockIndexWorkComparator()(candidate, invalid_walk_tip->pprev) &&
3729 [ + + + - : 3698 : candidate->IsValid(BLOCK_VALID_TRANSACTIONS) &&
+ + + - ]
3730 [ + - ]: 3689 : candidate->HaveNumChainTxs()) {
3731 [ + - ]: 3689 : setBlockIndexCandidates.insert(candidate);
3732 : : // Do not remove candidate from the highpow_outofchain_headers cache, because it might be a descendant of the block being invalidated
3733 : : // which needs to be marked failed later.
3734 : : }
3735 [ + + + + ]: 3763 : if (best_header_needs_update &&
3736 [ + - ]: 65 : m_chainman.m_best_header->nChainWork < candidate->nChainWork) {
3737 : 19 : m_chainman.m_best_header = candidate;
3738 : : }
3739 : 3698 : ++candidate_it;
3740 : : }
3741 : :
3742 : : // Track the last disconnected block, so we can correct its BLOCK_FAILED_CHILD status in future
3743 : : // iterations, or, if it's the last one, call InvalidChainFound on it.
3744 : 2943 : to_mark_failed = invalid_walk_tip;
3745 [ + - + - : 9049 : }
+ - + - +
- ]
3746 : :
3747 [ + - ]: 107 : m_chainman.CheckBlockIndex();
3748 : :
3749 : 107 : {
3750 [ + - ]: 107 : LOCK(cs_main);
3751 [ - + ]: 107 : if (m_chain.Contains(to_mark_failed)) {
3752 : : // If the to-be-marked invalid block is in the active chain, something is interfering and we can't proceed.
3753 [ # # ]: 0 : return false;
3754 : : }
3755 : :
3756 : : // Mark pindex as invalid if it never was in the main chain
3757 [ + + + + ]: 107 : if (!pindex_was_in_chain && !(pindex->nStatus & BLOCK_FAILED_MASK)) {
3758 : 2 : pindex->nStatus |= BLOCK_FAILED_VALID;
3759 [ + - ]: 2 : m_blockman.m_dirty_blockindex.insert(pindex);
3760 [ + - ]: 2 : setBlockIndexCandidates.erase(pindex);
3761 : : }
3762 : :
3763 : : // If any new blocks somehow arrived while we were disconnecting
3764 : : // (above), then the pre-calculation of what should go into
3765 : : // setBlockIndexCandidates may have missed entries. This would
3766 : : // technically be an inconsistency in the block index, but if we clean
3767 : : // it up here, this should be an essentially unobservable error.
3768 : : // Loop back over all block index entries and add any missing entries
3769 : : // to setBlockIndexCandidates.
3770 [ + + + + ]: 32400 : for (auto& [_, block_index] : m_blockman.m_block_index) {
3771 [ + + + + : 59869 : if (block_index.IsValid(BLOCK_VALID_TRANSACTIONS) && block_index.HaveNumChainTxs() && !setBlockIndexCandidates.value_comp()(&block_index, m_chain.Tip())) {
- + + - +
+ + + ]
3772 [ + - ]: 138 : setBlockIndexCandidates.insert(&block_index);
3773 : : }
3774 : : }
3775 : :
3776 [ + - ]: 107 : InvalidChainFound(to_mark_failed);
3777 : 0 : }
3778 : :
3779 : : // Only notify about a new block tip if the active chain was modified.
3780 [ + + ]: 107 : if (pindex_was_in_chain) {
3781 : : // Ignoring return value for now, this could be changed to bubble up
3782 : : // kernel::Interrupted value to the caller so the caller could
3783 : : // distinguish between completed and interrupted operations. It might
3784 : : // also make sense for the blockTip notification to have an enum
3785 : : // parameter indicating the source of the tip change so hooks can
3786 : : // distinguish user-initiated invalidateblock changes from other
3787 : : // changes.
3788 [ + - + - ]: 208 : (void)m_chainman.GetNotifications().blockTip(
3789 : 104 : /*state=*/GetSynchronizationState(m_chainman.IsInitialBlockDownload(), m_chainman.m_blockman.m_blockfiles_indexed),
3790 [ + - ]: 104 : /*index=*/*to_mark_failed->pprev,
3791 [ + - + - : 312 : /*verification_progress=*/WITH_LOCK(m_chainman.GetMutex(), return m_chainman.GuessVerificationProgress(to_mark_failed->pprev)));
+ - ]
3792 : :
3793 : : // Fire ActiveTipChange now for the current chain tip to make sure clients are notified.
3794 : : // ActivateBestChain may call this as well, but not necessarily.
3795 [ + - ]: 104 : if (m_chainman.m_options.signals) {
3796 [ + - - + : 208 : m_chainman.m_options.signals->ActiveTipChange(*Assert(m_chain.Tip()), m_chainman.IsInitialBlockDownload());
+ - + - ]
3797 : : }
3798 : : }
3799 : : return true;
3800 [ + - ]: 218 : }
3801 : :
3802 : 5493 : void Chainstate::SetBlockFailureFlags(CBlockIndex* invalid_block)
3803 : : {
3804 : 5493 : AssertLockHeld(cs_main);
3805 : :
3806 [ + + + + ]: 10435243 : for (auto& [_, block_index] : m_blockman.m_block_index) {
3807 [ + + + + ]: 10429750 : if (invalid_block != &block_index && block_index.GetAncestor(invalid_block->nHeight) == invalid_block) {
3808 : 7563 : block_index.nStatus = (block_index.nStatus & ~BLOCK_FAILED_VALID) | BLOCK_FAILED_CHILD;
3809 : 7563 : m_blockman.m_dirty_blockindex.insert(&block_index);
3810 : : }
3811 : : }
3812 : 5493 : }
3813 : :
3814 : 32 : void Chainstate::ResetBlockFailureFlags(CBlockIndex *pindex) {
3815 : 32 : AssertLockHeld(cs_main);
3816 : :
3817 : 32 : int nHeight = pindex->nHeight;
3818 : :
3819 : : // Remove the invalidity flag from this block and all its descendants and ancestors.
3820 [ + + + + ]: 6857 : for (auto& [_, block_index] : m_blockman.m_block_index) {
3821 [ + + + + : 6825 : if ((block_index.nStatus & BLOCK_FAILED_MASK) && (block_index.GetAncestor(nHeight) == pindex || pindex->GetAncestor(block_index.nHeight) == &block_index)) {
+ + ]
3822 : 1622 : block_index.nStatus &= ~BLOCK_FAILED_MASK;
3823 : 1622 : m_blockman.m_dirty_blockindex.insert(&block_index);
3824 [ + - + + : 3241 : if (block_index.IsValid(BLOCK_VALID_TRANSACTIONS) && block_index.HaveNumChainTxs() && setBlockIndexCandidates.value_comp()(m_chain.Tip(), &block_index)) {
+ - - + +
+ ]
3825 : 1616 : setBlockIndexCandidates.insert(&block_index);
3826 : : }
3827 [ + + ]: 1622 : if (&block_index == m_chainman.m_best_invalid) {
3828 : : // Reset invalid block marker if it was pointing to one of those.
3829 : 28 : m_chainman.m_best_invalid = nullptr;
3830 : : }
3831 : : }
3832 : : }
3833 : 32 : }
3834 : :
3835 : 291316 : void Chainstate::TryAddBlockIndexCandidate(CBlockIndex* pindex)
3836 : : {
3837 : 291316 : AssertLockHeld(cs_main);
3838 : : // The block only is a candidate for the most-work-chain if it has the same
3839 : : // or more work than our current tip.
3840 [ - + + - : 422919 : if (m_chain.Tip() != nullptr && setBlockIndexCandidates.value_comp()(pindex, m_chain.Tip())) {
+ + ]
3841 : : return;
3842 : : }
3843 : :
3844 : 281244 : bool is_active_chainstate = this == &m_chainman.ActiveChainstate();
3845 [ + + ]: 281244 : if (is_active_chainstate) {
3846 : : // The active chainstate should always add entries that have more
3847 : : // work than the tip.
3848 : 277179 : setBlockIndexCandidates.insert(pindex);
3849 [ + - ]: 4065 : } else if (!m_disabled) {
3850 : : // For the background chainstate, we only consider connecting blocks
3851 : : // towards the snapshot base (which can't be nullptr or else we'll
3852 : : // never make progress).
3853 : 4065 : const CBlockIndex* snapshot_base{Assert(m_chainman.GetSnapshotBaseBlock())};
3854 [ + + ]: 4065 : if (snapshot_base->GetAncestor(pindex->nHeight) == pindex) {
3855 : 2530 : setBlockIndexCandidates.insert(pindex);
3856 : : }
3857 : : }
3858 : : }
3859 : :
3860 : : /** Mark a block as having its data received and checked (up to BLOCK_VALID_TRANSACTIONS). */
3861 : 129650 : void ChainstateManager::ReceivedBlockTransactions(const CBlock& block, CBlockIndex* pindexNew, const FlatFilePos& pos)
3862 : : {
3863 : 129650 : AssertLockHeld(cs_main);
3864 [ - + ]: 129650 : pindexNew->nTx = block.vtx.size();
3865 : : // Typically m_chain_tx_count will be 0 at this point, but it can be nonzero if this
3866 : : // is a pruned block which is being downloaded again, or if this is an
3867 : : // assumeutxo snapshot block which has a hardcoded m_chain_tx_count value from the
3868 : : // snapshot metadata. If the pindex is not the snapshot block and the
3869 : : // m_chain_tx_count value is not zero, assert that value is actually correct.
3870 : 130067 : auto prev_tx_sum = [](CBlockIndex& block) { return block.nTx + (block.pprev ? block.pprev->m_chain_tx_count : 0); };
3871 [ + + + - : 129797 : if (!Assume(pindexNew->m_chain_tx_count == 0 || pindexNew->m_chain_tx_count == prev_tx_sum(*pindexNew) ||
+ + - + ]
3872 : : pindexNew == GetSnapshotBaseBlock())) {
3873 [ # # # # ]: 0 : LogWarning("Internal bug detected: block %d has unexpected m_chain_tx_count %i that should be %i (%s %s). Please report this issue here: %s\n",
3874 : : pindexNew->nHeight, pindexNew->m_chain_tx_count, prev_tx_sum(*pindexNew), CLIENT_NAME, FormatFullVersion(), CLIENT_BUGREPORT);
3875 : 0 : pindexNew->m_chain_tx_count = 0;
3876 : : }
3877 : 129650 : pindexNew->nFile = pos.nFile;
3878 : 129650 : pindexNew->nDataPos = pos.nPos;
3879 : 129650 : pindexNew->nUndoPos = 0;
3880 : 129650 : pindexNew->nStatus |= BLOCK_HAVE_DATA;
3881 [ + + ]: 129650 : if (DeploymentActiveAt(*pindexNew, *this, Consensus::DEPLOYMENT_SEGWIT)) {
3882 : 126070 : pindexNew->nStatus |= BLOCK_OPT_WITNESS;
3883 : : }
3884 : 129650 : pindexNew->RaiseValidity(BLOCK_VALID_TRANSACTIONS);
3885 : 129650 : m_blockman.m_dirty_blockindex.insert(pindexNew);
3886 : :
3887 [ + + + + ]: 129650 : if (pindexNew->pprev == nullptr || pindexNew->pprev->HaveNumChainTxs()) {
3888 : : // If pindexNew is the genesis block or all parents are BLOCK_VALID_TRANSACTIONS.
3889 : 126362 : std::deque<CBlockIndex*> queue;
3890 [ + - ]: 126362 : queue.push_back(pindexNew);
3891 : :
3892 : : // Recursively process any descendant blocks that now may be eligible to be connected.
3893 [ + + ]: 256305 : while (!queue.empty()) {
3894 : 129943 : CBlockIndex *pindex = queue.front();
3895 : 129943 : queue.pop_front();
3896 : : // Before setting m_chain_tx_count, assert that it is 0 or already set to
3897 : : // the correct value. This assert will fail after receiving the
3898 : : // assumeutxo snapshot block if assumeutxo snapshot metadata has an
3899 : : // incorrect hardcoded AssumeutxoData::m_chain_tx_count value.
3900 [ + + + - : 130389 : if (!Assume(pindex->m_chain_tx_count == 0 || pindex->m_chain_tx_count == prev_tx_sum(*pindex))) {
- + ]
3901 [ # # # # : 0 : LogWarning("Internal bug detected: block %d has unexpected m_chain_tx_count %i that should be %i (%s %s). Please report this issue here: %s\n",
# # ]
3902 : : pindex->nHeight, pindex->m_chain_tx_count, prev_tx_sum(*pindex), CLIENT_NAME, FormatFullVersion(), CLIENT_BUGREPORT);
3903 : : }
3904 [ + + ]: 129943 : pindex->m_chain_tx_count = prev_tx_sum(*pindex);
3905 : 129943 : pindex->nSequenceId = nBlockSequenceId++;
3906 [ + - + + ]: 261690 : for (Chainstate *c : GetAll()) {
3907 [ + - ]: 131747 : c->TryAddBlockIndexCandidate(pindex);
3908 : 0 : }
3909 : 129943 : std::pair<std::multimap<CBlockIndex*, CBlockIndex*>::iterator, std::multimap<CBlockIndex*, CBlockIndex*>::iterator> range = m_blockman.m_blocks_unlinked.equal_range(pindex);
3910 [ + + ]: 133524 : while (range.first != range.second) {
3911 : 3581 : std::multimap<CBlockIndex*, CBlockIndex*>::iterator it = range.first;
3912 [ + - ]: 3581 : queue.push_back(it->second);
3913 : 3581 : range.first++;
3914 : 3581 : m_blockman.m_blocks_unlinked.erase(it);
3915 : : }
3916 : : }
3917 : 126362 : } else {
3918 [ + - + - ]: 3288 : if (pindexNew->pprev && pindexNew->pprev->IsValid(BLOCK_VALID_TREE)) {
3919 : 3288 : m_blockman.m_blocks_unlinked.insert(std::make_pair(pindexNew->pprev, pindexNew));
3920 : : }
3921 : : }
3922 : 129650 : }
3923 : :
3924 : 398347 : static bool CheckBlockHeader(const CBlockHeader& block, BlockValidationState& state, const Consensus::Params& consensusParams, bool fCheckPOW = true)
3925 : : {
3926 : : // Check proof of work matches claimed amount
3927 [ + + + + ]: 398347 : if (fCheckPOW && !CheckProofOfWork(block.GetHash(), block.nBits, consensusParams))
3928 [ + - + - ]: 5 : return state.Invalid(BlockValidationResult::BLOCK_INVALID_HEADER, "high-hash", "proof of work failed");
3929 : :
3930 : : return true;
3931 : : }
3932 : :
3933 : 217810 : static bool CheckMerkleRoot(const CBlock& block, BlockValidationState& state)
3934 : : {
3935 [ + + ]: 217810 : if (block.m_checked_merkle_root) return true;
3936 : :
3937 : 160021 : bool mutated;
3938 : 160021 : uint256 merkle_root = BlockMerkleRoot(block, &mutated);
3939 [ + + ]: 160021 : if (block.hashMerkleRoot != merkle_root) {
3940 [ + - ]: 16 : return state.Invalid(
3941 : : /*result=*/BlockValidationResult::BLOCK_MUTATED,
3942 [ + - ]: 32 : /*reject_reason=*/"bad-txnmrklroot",
3943 : 32 : /*debug_message=*/"hashMerkleRoot mismatch");
3944 : : }
3945 : :
3946 : : // Check for merkle tree malleability (CVE-2012-2459): repeating sequences
3947 : : // of transactions in a block without affecting the merkle root of a block,
3948 : : // while still invalidating it.
3949 [ + + ]: 160005 : if (mutated) {
3950 [ + - ]: 51 : return state.Invalid(
3951 : : /*result=*/BlockValidationResult::BLOCK_MUTATED,
3952 [ + - ]: 102 : /*reject_reason=*/"bad-txns-duplicate",
3953 : 102 : /*debug_message=*/"duplicate transaction");
3954 : : }
3955 : :
3956 : 159954 : block.m_checked_merkle_root = true;
3957 : 159954 : return true;
3958 : : }
3959 : :
3960 : : /** CheckWitnessMalleation performs checks for block malleation with regard to
3961 : : * its witnesses.
3962 : : *
3963 : : * Note: If the witness commitment is expected (i.e. `expect_witness_commitment
3964 : : * = true`), then the block is required to have at least one transaction and the
3965 : : * first transaction needs to have at least one input. */
3966 : 234277 : static bool CheckWitnessMalleation(const CBlock& block, bool expect_witness_commitment, BlockValidationState& state)
3967 : : {
3968 [ + + ]: 234277 : if (expect_witness_commitment) {
3969 [ + + ]: 229334 : if (block.m_checked_witness_commitment) return true;
3970 : :
3971 : 141208 : int commitpos = GetWitnessCommitmentIndex(block);
3972 [ + + ]: 141208 : if (commitpos != NO_WITNESS_COMMITMENT) {
3973 [ + - - + ]: 110732 : assert(!block.vtx.empty() && !block.vtx[0]->vin.empty());
3974 [ - + ]: 110732 : const auto& witness_stack{block.vtx[0]->vin[0].scriptWitness.stack};
3975 : :
3976 [ - + + + : 110732 : if (witness_stack.size() != 1 || witness_stack[0].size() != 32) {
- + - + ]
3977 [ + - ]: 7 : return state.Invalid(
3978 : : /*result=*/BlockValidationResult::BLOCK_MUTATED,
3979 [ + - ]: 14 : /*reject_reason=*/"bad-witness-nonce-size",
3980 : 14 : /*debug_message=*/strprintf("%s : invalid witness reserved value size", __func__));
3981 : : }
3982 : :
3983 : : // The malleation check is ignored; as the transaction tree itself
3984 : : // already does not permit it, it is impossible to trigger in the
3985 : : // witness tree.
3986 : 110725 : uint256 hash_witness = BlockWitnessMerkleRoot(block, /*mutated=*/nullptr);
3987 : :
3988 [ - + ]: 110725 : CHash256().Write(hash_witness).Write(witness_stack[0]).Finalize(hash_witness);
3989 [ - + + + ]: 221450 : if (memcmp(hash_witness.begin(), &block.vtx[0]->vout[commitpos].scriptPubKey[6], 32)) {
3990 [ + - ]: 5 : return state.Invalid(
3991 : : /*result=*/BlockValidationResult::BLOCK_MUTATED,
3992 [ + - ]: 10 : /*reject_reason=*/"bad-witness-merkle-match",
3993 : 10 : /*debug_message=*/strprintf("%s : witness merkle commitment mismatch", __func__));
3994 : : }
3995 : :
3996 : 110720 : block.m_checked_witness_commitment = true;
3997 : 110720 : return true;
3998 : : }
3999 : : }
4000 : :
4001 : : // No witness data is allowed in blocks that don't commit to witness data, as this would otherwise leave room for spam
4002 [ + + ]: 113269 : for (const auto& tx : block.vtx) {
4003 [ + + ]: 77856 : if (tx->HasWitness()) {
4004 [ + - ]: 6 : return state.Invalid(
4005 : : /*result=*/BlockValidationResult::BLOCK_MUTATED,
4006 [ + - ]: 12 : /*reject_reason=*/"unexpected-witness",
4007 : 12 : /*debug_message=*/strprintf("%s : unexpected witness data found", __func__));
4008 : : }
4009 : : }
4010 : :
4011 : : return true;
4012 : : }
4013 : :
4014 : 504425 : bool CheckBlock(const CBlock& block, BlockValidationState& state, const Consensus::Params& consensusParams, bool fCheckPOW, bool fCheckMerkleRoot)
4015 : : {
4016 : : // These are checks that are independent of context.
4017 : :
4018 [ + + ]: 504425 : if (block.fChecked)
4019 : : return true;
4020 : :
4021 : : // Check that the header is valid (particularly PoW). This is mostly
4022 : : // redundant with the call in AcceptBlockHeader.
4023 [ + + ]: 254167 : if (!CheckBlockHeader(block, state, consensusParams, fCheckPOW))
4024 : : return false;
4025 : :
4026 : : // Signet only: check block solution
4027 [ + + + + : 254162 : if (consensusParams.signet_blocks && fCheckPOW && !CheckSignetBlockSolution(block, consensusParams)) {
+ + ]
4028 [ + - + - ]: 1 : return state.Invalid(BlockValidationResult::BLOCK_CONSENSUS, "bad-signet-blksig", "signet block signature validation failure");
4029 : : }
4030 : :
4031 : : // Check the merkle root.
4032 [ + + + + ]: 254161 : if (fCheckMerkleRoot && !CheckMerkleRoot(block, state)) {
4033 : : return false;
4034 : : }
4035 : :
4036 : : // All potential-corruption validation must be done before we do any
4037 : : // transaction validation, as otherwise we may mark the header as invalid
4038 : : // because we receive the wrong transactions for it.
4039 : : // Note that witness malleability is checked in ContextualCheckBlock, so no
4040 : : // checks that use witness data may be performed here.
4041 : :
4042 : : // Size limits
4043 [ + + - + : 254153 : if (block.vtx.empty() || block.vtx.size() * WITNESS_SCALE_FACTOR > MAX_BLOCK_WEIGHT || ::GetSerializeSize(TX_NO_WITNESS(block)) * WITNESS_SCALE_FACTOR > MAX_BLOCK_WEIGHT)
+ - + + ]
4044 [ + - + - ]: 4 : return state.Invalid(BlockValidationResult::BLOCK_CONSENSUS, "bad-blk-length", "size limits failed");
4045 : :
4046 : : // First transaction must be coinbase, the rest must not be
4047 [ + - + + ]: 254149 : if (block.vtx.empty() || !block.vtx[0]->IsCoinBase())
4048 [ + - + - ]: 3 : return state.Invalid(BlockValidationResult::BLOCK_CONSENSUS, "bad-cb-missing", "first tx is not coinbase");
4049 [ - + + + ]: 333551 : for (unsigned int i = 1; i < block.vtx.size(); i++)
4050 [ + + ]: 79407 : if (block.vtx[i]->IsCoinBase())
4051 [ + - + - ]: 2 : return state.Invalid(BlockValidationResult::BLOCK_CONSENSUS, "bad-cb-multiple", "more than one coinbase");
4052 : :
4053 : : // Check transactions
4054 : : // Must check for duplicate inputs (see CVE-2018-17144)
4055 [ + + ]: 587599 : for (const auto& tx : block.vtx) {
4056 [ + - ]: 333547 : TxValidationState tx_state;
4057 [ + - + + ]: 333547 : if (!CheckTransaction(*tx, tx_state)) {
4058 : : // CheckBlock() does context-free validation checks. The only
4059 : : // possible failures are consensus failures.
4060 [ - + ]: 92 : assert(tx_state.GetResult() == TxValidationResult::TX_CONSENSUS);
4061 [ - + + - ]: 184 : return state.Invalid(BlockValidationResult::BLOCK_CONSENSUS, tx_state.GetRejectReason(),
4062 [ + - + - ]: 184 : strprintf("Transaction check failed (tx hash %s) %s", tx->GetHash().ToString(), tx_state.GetDebugMessage()));
4063 : : }
4064 : 333547 : }
4065 : : // This underestimates the number of sigops, because unlike ConnectBlock it
4066 : : // does not count witness and p2sh sigops.
4067 : 254052 : unsigned int nSigOps = 0;
4068 [ + + ]: 587384 : for (const auto& tx : block.vtx)
4069 : : {
4070 : 333332 : nSigOps += GetLegacySigOpCount(*tx);
4071 : : }
4072 [ + + ]: 254052 : if (nSigOps * WITNESS_SCALE_FACTOR > MAX_BLOCK_SIGOPS_COST)
4073 [ + - + - ]: 8 : return state.Invalid(BlockValidationResult::BLOCK_CONSENSUS, "bad-blk-sigops", "out-of-bounds SigOpCount");
4074 : :
4075 [ + + ]: 254044 : if (fCheckPOW && fCheckMerkleRoot)
4076 : 159507 : block.fChecked = true;
4077 : :
4078 : : return true;
4079 : : }
4080 : :
4081 : 81637 : void ChainstateManager::UpdateUncommittedBlockStructures(CBlock& block, const CBlockIndex* pindexPrev) const
4082 : : {
4083 : 81637 : int commitpos = GetWitnessCommitmentIndex(block);
4084 [ + + + - : 81637 : static const std::vector<unsigned char> nonce(32, 0x00);
+ - ]
4085 [ + + + + : 81637 : if (commitpos != NO_WITNESS_COMMITMENT && DeploymentActiveAfter(pindexPrev, *this, Consensus::DEPLOYMENT_SEGWIT) && !block.vtx[0]->HasWitness()) {
+ + ]
4086 : 47216 : CMutableTransaction tx(*block.vtx[0]);
4087 [ + - ]: 47216 : tx.vin[0].scriptWitness.stack.resize(1);
4088 [ + - ]: 47216 : tx.vin[0].scriptWitness.stack[0] = nonce;
4089 [ + - - + ]: 94432 : block.vtx[0] = MakeTransactionRef(std::move(tx));
4090 : 47216 : }
4091 : 81637 : }
4092 : :
4093 : 54458 : std::vector<unsigned char> ChainstateManager::GenerateCoinbaseCommitment(CBlock& block, const CBlockIndex* pindexPrev) const
4094 : : {
4095 : 54458 : std::vector<unsigned char> commitment;
4096 : 54458 : int commitpos = GetWitnessCommitmentIndex(block);
4097 [ + - ]: 54458 : std::vector<unsigned char> ret(32, 0x00);
4098 [ + - ]: 54458 : if (commitpos == NO_WITNESS_COMMITMENT) {
4099 [ + - ]: 54458 : uint256 witnessroot = BlockWitnessMerkleRoot(block, nullptr);
4100 [ + - + - : 54458 : CHash256().Write(witnessroot).Write(ret).Finalize(witnessroot);
- + + - +
- ]
4101 : 54458 : CTxOut out;
4102 : 54458 : out.nValue = 0;
4103 : 54458 : out.scriptPubKey.resize(MINIMUM_WITNESS_COMMITMENT);
4104 [ + - ]: 54458 : out.scriptPubKey[0] = OP_RETURN;
4105 [ + - ]: 54458 : out.scriptPubKey[1] = 0x24;
4106 [ + - ]: 54458 : out.scriptPubKey[2] = 0xaa;
4107 [ + - ]: 54458 : out.scriptPubKey[3] = 0x21;
4108 [ + - ]: 54458 : out.scriptPubKey[4] = 0xa9;
4109 [ + - ]: 54458 : out.scriptPubKey[5] = 0xed;
4110 [ + - + - ]: 108916 : memcpy(&out.scriptPubKey[6], witnessroot.begin(), 32);
4111 [ + - + - : 163374 : commitment = std::vector<unsigned char>(out.scriptPubKey.begin(), out.scriptPubKey.end());
+ - ]
4112 [ + - ]: 54458 : CMutableTransaction tx(*block.vtx[0]);
4113 [ + - ]: 54458 : tx.vout.push_back(out);
4114 [ + - - + ]: 108916 : block.vtx[0] = MakeTransactionRef(std::move(tx));
4115 : 54458 : }
4116 [ + - ]: 54458 : UpdateUncommittedBlockStructures(block, pindexPrev);
4117 : 54458 : return commitment;
4118 : 54458 : }
4119 : :
4120 : 9725 : bool HasValidProofOfWork(const std::vector<CBlockHeader>& headers, const Consensus::Params& consensusParams)
4121 : : {
4122 : 9725 : return std::all_of(headers.cbegin(), headers.cend(),
4123 : 239736 : [&](const auto& header) { return CheckProofOfWork(header.GetHash(), header.nBits, consensusParams);});
4124 : : }
4125 : :
4126 : 57873 : bool IsBlockMutated(const CBlock& block, bool check_witness_root)
4127 : : {
4128 [ + - ]: 57873 : BlockValidationState state;
4129 [ + - + + ]: 57873 : if (!CheckMerkleRoot(block, state)) {
4130 [ + - + - : 118 : LogDebug(BCLog::VALIDATION, "Block mutated: %s\n", state.ToString());
+ - + - ]
4131 : 59 : return true;
4132 : : }
4133 : :
4134 [ + + + + ]: 57814 : if (block.vtx.empty() || !block.vtx[0]->IsCoinBase()) {
4135 : : // Consider the block mutated if any transaction is 64 bytes in size (see 3.1
4136 : : // in "Weaknesses in Bitcoin’s Merkle Root Construction":
4137 : : // https://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20190225/a27d8837/attachment-0001.pdf).
4138 : : //
4139 : : // Note: This is not a consensus change as this only applies to blocks that
4140 : : // don't have a coinbase transaction and would therefore already be invalid.
4141 : 5 : return std::any_of(block.vtx.begin(), block.vtx.end(),
4142 : 9 : [](auto& tx) { return GetSerializeSize(TX_NO_WITNESS(tx)) == 64; });
4143 : : } else {
4144 : : // Theoretically it is still possible for a block with a 64 byte
4145 : : // coinbase transaction to be mutated but we neglect that possibility
4146 : : // here as it requires at least 224 bits of work.
4147 : : }
4148 : :
4149 [ + - + + ]: 57809 : if (!CheckWitnessMalleation(block, check_witness_root, state)) {
4150 [ + - + - : 24 : LogDebug(BCLog::VALIDATION, "Block mutated: %s\n", state.ToString());
+ - + - ]
4151 : 12 : return true;
4152 : : }
4153 : :
4154 : : return false;
4155 : 57873 : }
4156 : :
4157 : 66660 : arith_uint256 CalculateClaimedHeadersWork(std::span<const CBlockHeader> headers)
4158 : : {
4159 : 66660 : arith_uint256 total_work{0};
4160 [ + + ]: 311833 : for (const CBlockHeader& header : headers) {
4161 : 245173 : CBlockIndex dummy(header);
4162 : 245173 : total_work += GetBlockProof(dummy);
4163 : : }
4164 : 66660 : return total_work;
4165 : : }
4166 : :
4167 : : /** Context-dependent validity checks.
4168 : : * By "context", we mean only the previous block headers, but not the UTXO
4169 : : * set; UTXO-related validity checks are done in ConnectBlock().
4170 : : * NOTE: This function is not currently invoked by ConnectBlock(), so we
4171 : : * should consider upgrade issues if we change which consensus rules are
4172 : : * enforced in this function (eg by adding a new consensus rule). See comment
4173 : : * in ConnectBlock().
4174 : : * Note that -reindex-chainstate skips the validation that happens here!
4175 : : *
4176 : : * NOTE: failing to check the header's height against the last checkpoint's opened a DoS vector between
4177 : : * v0.12 and v0.15 (when no additional protection was in place) whereby an attacker could unboundedly
4178 : : * grow our in-memory block index. See https://bitcoincore.org/en/2024/07/03/disclose-header-spam.
4179 : : */
4180 : 191443 : static bool ContextualCheckBlockHeader(const CBlockHeader& block, BlockValidationState& state, BlockManager& blockman, const ChainstateManager& chainman, const CBlockIndex* pindexPrev) EXCLUSIVE_LOCKS_REQUIRED(::cs_main)
4181 : : {
4182 : 191443 : AssertLockHeld(::cs_main);
4183 [ - + ]: 191443 : assert(pindexPrev != nullptr);
4184 : 191443 : const int nHeight = pindexPrev->nHeight + 1;
4185 : :
4186 : : // Check proof of work
4187 : 191443 : const Consensus::Params& consensusParams = chainman.GetConsensus();
4188 [ + + ]: 191443 : if (block.nBits != GetNextWorkRequired(pindexPrev, &block, consensusParams))
4189 [ + - + - ]: 4 : return state.Invalid(BlockValidationResult::BLOCK_INVALID_HEADER, "bad-diffbits", "incorrect proof of work");
4190 : :
4191 : : // Check timestamp against prev
4192 [ + + ]: 191439 : if (block.GetBlockTime() <= pindexPrev->GetMedianTimePast())
4193 [ + - + - ]: 5 : return state.Invalid(BlockValidationResult::BLOCK_INVALID_HEADER, "time-too-old", "block's timestamp is too early");
4194 : :
4195 : : // Testnet4 and regtest only: Check timestamp against prev for difficulty-adjustment
4196 : : // blocks to prevent timewarp attacks (see https://github.com/bitcoin/bitcoin/pull/15482).
4197 [ + + ]: 191434 : if (consensusParams.enforce_BIP94) {
4198 : : // Check timestamp for the first block of each difficulty adjustment
4199 : : // interval, except the genesis block.
4200 [ + + ]: 219 : if (nHeight % consensusParams.DifficultyAdjustmentInterval() == 0) {
4201 [ + + ]: 7 : if (block.GetBlockTime() < pindexPrev->GetBlockTime() - MAX_TIMEWARP) {
4202 [ + - + - ]: 2 : return state.Invalid(BlockValidationResult::BLOCK_INVALID_HEADER, "time-timewarp-attack", "block's timestamp is too early on diff adjustment block");
4203 : : }
4204 : : }
4205 : : }
4206 : :
4207 : : // Check timestamp
4208 [ + + ]: 191432 : if (block.Time() > NodeClock::now() + std::chrono::seconds{MAX_FUTURE_BLOCK_TIME}) {
4209 [ + - + - ]: 15 : return state.Invalid(BlockValidationResult::BLOCK_TIME_FUTURE, "time-too-new", "block timestamp too far in the future");
4210 : : }
4211 : :
4212 : : // Reject blocks with outdated version
4213 [ - + + + ]: 191417 : if ((block.nVersion < 2 && DeploymentActiveAfter(pindexPrev, chainman, Consensus::DEPLOYMENT_HEIGHTINCB)) ||
4214 [ + + - + : 382833 : (block.nVersion < 3 && DeploymentActiveAfter(pindexPrev, chainman, Consensus::DEPLOYMENT_DERSIG)) ||
+ + ]
4215 [ + + ]: 2 : (block.nVersion < 4 && DeploymentActiveAfter(pindexPrev, chainman, Consensus::DEPLOYMENT_CLTV))) {
4216 [ + - + - ]: 3 : return state.Invalid(BlockValidationResult::BLOCK_INVALID_HEADER, strprintf("bad-version(0x%08x)", block.nVersion),
4217 : 6 : strprintf("rejected nVersion=0x%08x block", block.nVersion));
4218 : : }
4219 : :
4220 : : return true;
4221 : : }
4222 : :
4223 : : /** NOTE: This function is not currently invoked by ConnectBlock(), so we
4224 : : * should consider upgrade issues if we change which consensus rules are
4225 : : * enforced in this function (eg by adding a new consensus rule). See comment
4226 : : * in ConnectBlock().
4227 : : * Note that -reindex-chainstate skips the validation that happens here!
4228 : : */
4229 : 176476 : static bool ContextualCheckBlock(const CBlock& block, BlockValidationState& state, const ChainstateManager& chainman, const CBlockIndex* pindexPrev)
4230 : : {
4231 [ + + ]: 176476 : const int nHeight = pindexPrev == nullptr ? 0 : pindexPrev->nHeight + 1;
4232 : :
4233 : : // Enforce BIP113 (Median Time Past).
4234 : 176476 : bool enforce_locktime_median_time_past{false};
4235 [ + + ]: 176476 : if (DeploymentActiveAfter(pindexPrev, chainman, Consensus::DEPLOYMENT_CSV)) {
4236 [ - + ]: 172950 : assert(pindexPrev != nullptr);
4237 : : enforce_locktime_median_time_past = true;
4238 : : }
4239 : :
4240 : 176476 : const int64_t nLockTimeCutoff{enforce_locktime_median_time_past ?
4241 : 172950 : pindexPrev->GetMedianTimePast() :
4242 : 3526 : block.GetBlockTime()};
4243 : :
4244 : : // Check that all transactions are finalized
4245 [ + + ]: 411429 : for (const auto& tx : block.vtx) {
4246 [ + + ]: 234960 : if (!IsFinalTx(*tx, nHeight, nLockTimeCutoff)) {
4247 [ + - + - ]: 7 : return state.Invalid(BlockValidationResult::BLOCK_CONSENSUS, "bad-txns-nonfinal", "non-final transaction");
4248 : : }
4249 : : }
4250 : :
4251 : : // Enforce rule that the coinbase starts with serialized block height
4252 [ + + ]: 176469 : if (DeploymentActiveAfter(pindexPrev, chainman, Consensus::DEPLOYMENT_HEIGHTINCB))
4253 : : {
4254 [ + - ]: 174198 : CScript expect = CScript() << nHeight;
4255 [ + + - + : 348396 : if (block.vtx[0]->vin[0].scriptSig.size() < expect.size() ||
+ + + - ]
4256 [ + + - + ]: 348394 : !std::equal(expect.begin(), expect.end(), block.vtx[0]->vin[0].scriptSig.begin())) {
4257 [ + - + - : 1 : return state.Invalid(BlockValidationResult::BLOCK_CONSENSUS, "bad-cb-height", "block height mismatch in coinbase");
+ - ]
4258 : : }
4259 : 174198 : }
4260 : :
4261 : : // Validation for witness commitments.
4262 : : // * We compute the witness hash (which is the hash including witnesses) of all the block's transactions, except the
4263 : : // coinbase (where 0x0000....0000 is used instead).
4264 : : // * The coinbase scriptWitness is a stack of a single 32-byte vector, containing a witness reserved value (unconstrained).
4265 : : // * We build a merkle tree with all those witness hashes as leaves (similar to the hashMerkleRoot in the block header).
4266 : : // * There must be at least one output whose scriptPubKey is a single 36-byte push, the first 4 bytes of which are
4267 : : // {0xaa, 0x21, 0xa9, 0xed}, and the following 32 bytes are SHA256^2(witness root, witness reserved value). In case there are
4268 : : // multiple, the last one is used.
4269 [ + + ]: 176468 : if (!CheckWitnessMalleation(block, DeploymentActiveAfter(pindexPrev, chainman, Consensus::DEPLOYMENT_SEGWIT), state)) {
4270 : : return false;
4271 : : }
4272 : :
4273 : : // After the coinbase witness reserved value and commitment are verified,
4274 : : // we can check if the block weight passes (before we've checked the
4275 : : // coinbase witness, it would be possible for the weight to be too
4276 : : // large by filling up the coinbase witness, which doesn't change
4277 : : // the block hash, so we couldn't mark the block as permanently
4278 : : // failed).
4279 [ + + ]: 176462 : if (GetBlockWeight(block) > MAX_BLOCK_WEIGHT) {
4280 [ + - + - ]: 1 : return state.Invalid(BlockValidationResult::BLOCK_CONSENSUS, "bad-blk-weight", strprintf("%s : weight limit failed", __func__));
4281 : : }
4282 : :
4283 : : return true;
4284 : : }
4285 : :
4286 : 259029 : bool ChainstateManager::AcceptBlockHeader(const CBlockHeader& block, BlockValidationState& state, CBlockIndex** ppindex, bool min_pow_checked)
4287 : : {
4288 : 259029 : AssertLockHeld(cs_main);
4289 : :
4290 : : // Check for duplicate
4291 : 259029 : uint256 hash = block.GetHash();
4292 : 259029 : BlockMap::iterator miSelf{m_blockman.m_block_index.find(hash)};
4293 [ + + ]: 259029 : if (hash != GetConsensus().hashGenesisBlock) {
4294 [ + + ]: 259012 : if (miSelf != m_blockman.m_block_index.end()) {
4295 : : // Block header is already known.
4296 [ + - ]: 114832 : CBlockIndex* pindex = &(miSelf->second);
4297 [ + - ]: 114832 : if (ppindex)
4298 : 114832 : *ppindex = pindex;
4299 [ + + ]: 114832 : if (pindex->nStatus & BLOCK_FAILED_MASK) {
4300 [ + - + - ]: 866 : LogDebug(BCLog::VALIDATION, "%s: block %s is marked invalid\n", __func__, hash.ToString());
4301 [ + - + - ]: 433 : return state.Invalid(BlockValidationResult::BLOCK_CACHED_INVALID, "duplicate-invalid");
4302 : : }
4303 : : return true;
4304 : : }
4305 : :
4306 [ - + ]: 144180 : if (!CheckBlockHeader(block, state, GetConsensus())) {
4307 [ # # # # : 0 : LogDebug(BCLog::VALIDATION, "%s: Consensus::CheckBlockHeader: %s, %s\n", __func__, hash.ToString(), state.ToString());
# # ]
4308 : 0 : return false;
4309 : : }
4310 : :
4311 : : // Get prev block index
4312 : 144180 : CBlockIndex* pindexPrev = nullptr;
4313 : 144180 : BlockMap::iterator mi{m_blockman.m_block_index.find(block.hashPrevBlock)};
4314 [ + + ]: 144180 : if (mi == m_blockman.m_block_index.end()) {
4315 [ + - + - : 6 : LogDebug(BCLog::VALIDATION, "header %s has prev block not found: %s\n", hash.ToString(), block.hashPrevBlock.ToString());
+ - ]
4316 [ + - + - ]: 3 : return state.Invalid(BlockValidationResult::BLOCK_MISSING_PREV, "prev-blk-not-found");
4317 : : }
4318 [ + + ]: 144177 : pindexPrev = &((*mi).second);
4319 [ + + ]: 144177 : if (pindexPrev->nStatus & BLOCK_FAILED_MASK) {
4320 [ + - + - : 10 : LogDebug(BCLog::VALIDATION, "header %s has prev block invalid: %s\n", hash.ToString(), block.hashPrevBlock.ToString());
+ - ]
4321 [ + - + - ]: 5 : return state.Invalid(BlockValidationResult::BLOCK_INVALID_PREV, "bad-prevblk");
4322 : : }
4323 [ + + ]: 144172 : if (!ContextualCheckBlockHeader(block, state, m_blockman, *this, pindexPrev)) {
4324 [ + - + - : 50 : LogDebug(BCLog::VALIDATION, "%s: Consensus::ContextualCheckBlockHeader: %s, %s\n", __func__, hash.ToString(), state.ToString());
+ - ]
4325 : 25 : return false;
4326 : : }
4327 : : }
4328 [ + + ]: 144164 : if (!min_pow_checked) {
4329 [ + - + - ]: 2 : LogDebug(BCLog::VALIDATION, "%s: not adding new block header %s, missing anti-dos proof-of-work validation\n", __func__, hash.ToString());
4330 [ + - + - ]: 1 : return state.Invalid(BlockValidationResult::BLOCK_HEADER_LOW_WORK, "too-little-chainwork");
4331 : : }
4332 : 144163 : CBlockIndex* pindex{m_blockman.AddToBlockIndex(block, m_best_header)};
4333 : :
4334 [ + - ]: 144163 : if (ppindex)
4335 : 144163 : *ppindex = pindex;
4336 : :
4337 : : return true;
4338 : : }
4339 : :
4340 : : // Exposed wrapper for AcceptBlockHeader
4341 : 36101 : bool ChainstateManager::ProcessNewBlockHeaders(std::span<const CBlockHeader> headers, bool min_pow_checked, BlockValidationState& state, const CBlockIndex** ppindex)
4342 : : {
4343 : 36101 : AssertLockNotHeld(cs_main);
4344 : 36101 : {
4345 : 36101 : LOCK(cs_main);
4346 [ + + ]: 149959 : for (const CBlockHeader& header : headers) {
4347 : 113943 : CBlockIndex *pindex = nullptr; // Use a temp pindex instead of ppindex to avoid a const_cast
4348 [ + - ]: 113943 : bool accepted{AcceptBlockHeader(header, state, &pindex, min_pow_checked)};
4349 [ + - ]: 113943 : CheckBlockIndex();
4350 : :
4351 [ + + ]: 113943 : if (!accepted) {
4352 [ + - ]: 85 : return false;
4353 : : }
4354 [ + + ]: 113858 : if (ppindex) {
4355 : 110853 : *ppindex = pindex;
4356 : : }
4357 : : }
4358 : 85 : }
4359 [ + + ]: 36016 : if (NotifyHeaderTip()) {
4360 [ + + + + : 23492 : if (IsInitialBlockDownload() && ppindex && *ppindex) {
+ - ]
4361 : 482 : const CBlockIndex& last_accepted{**ppindex};
4362 : 482 : int64_t blocks_left{(NodeClock::now() - last_accepted.Time()) / GetConsensus().PowTargetSpacing()};
4363 [ + + ]: 482 : blocks_left = std::max<int64_t>(0, blocks_left);
4364 : 482 : const double progress{100.0 * last_accepted.nHeight / (last_accepted.nHeight + blocks_left)};
4365 : 482 : LogInfo("Synchronizing blockheaders, height: %d (~%.2f%%)\n", last_accepted.nHeight, progress);
4366 : : }
4367 : : }
4368 : : return true;
4369 : : }
4370 : :
4371 : 8 : void ChainstateManager::ReportHeadersPresync(const arith_uint256& work, int64_t height, int64_t timestamp)
4372 : : {
4373 : 8 : AssertLockNotHeld(GetMutex());
4374 : 8 : {
4375 : 8 : LOCK(GetMutex());
4376 : : // Don't report headers presync progress if we already have a post-minchainwork header chain.
4377 : : // This means we lose reporting for potentially legitimate, but unlikely, deep reorgs, but
4378 : : // prevent attackers that spam low-work headers from filling our logs.
4379 [ + - + - : 8 : if (m_best_header->nChainWork >= UintToArith256(GetConsensus().nMinimumChainWork)) return;
- + ]
4380 : : // Rate limit headers presync updates to 4 per second, as these are not subject to DoS
4381 : : // protection.
4382 : 0 : auto now = MockableSteadyClock::now();
4383 [ # # ]: 0 : if (now < m_last_presync_update + std::chrono::milliseconds{250}) return;
4384 [ # # ]: 0 : m_last_presync_update = now;
4385 : 8 : }
4386 : 0 : bool initial_download = IsInitialBlockDownload();
4387 : 0 : GetNotifications().headerTip(GetSynchronizationState(initial_download, m_blockman.m_blockfiles_indexed), height, timestamp, /*presync=*/true);
4388 [ # # ]: 0 : if (initial_download) {
4389 : 0 : int64_t blocks_left{(NodeClock::now() - NodeSeconds{std::chrono::seconds{timestamp}}) / GetConsensus().PowTargetSpacing()};
4390 [ # # ]: 0 : blocks_left = std::max<int64_t>(0, blocks_left);
4391 : 0 : const double progress{100.0 * height / (height + blocks_left)};
4392 : 0 : LogInfo("Pre-synchronizing blockheaders, height: %d (~%.2f%%)\n", height, progress);
4393 : : }
4394 : : }
4395 : :
4396 : : /** Store block on disk. If dbp is non-nullptr, the file is known to already reside on disk */
4397 : 145086 : bool ChainstateManager::AcceptBlock(const std::shared_ptr<const CBlock>& pblock, BlockValidationState& state, CBlockIndex** ppindex, bool fRequested, const FlatFilePos* dbp, bool* fNewBlock, bool min_pow_checked)
4398 : : {
4399 [ + + ]: 145086 : const CBlock& block = *pblock;
4400 : :
4401 [ + + ]: 145086 : if (fNewBlock) *fNewBlock = false;
4402 : 145086 : AssertLockHeld(cs_main);
4403 : :
4404 : 145086 : CBlockIndex *pindexDummy = nullptr;
4405 [ + + ]: 145086 : CBlockIndex *&pindex = ppindex ? *ppindex : pindexDummy;
4406 : :
4407 : 145086 : bool accepted_header{AcceptBlockHeader(block, state, &pindex, min_pow_checked)};
4408 : 145086 : CheckBlockIndex();
4409 : :
4410 [ + + ]: 145086 : if (!accepted_header)
4411 : : return false;
4412 : :
4413 : : // Check all requested blocks that we do not already have for validity and
4414 : : // save them to disk. Skip processing of unrequested blocks as an anti-DoS
4415 : : // measure, unless the blocks have more work than the active chain tip, and
4416 : : // aren't too far ahead of it, so are likely to be attached soon.
4417 : 144704 : bool fAlreadyHave = pindex->nStatus & BLOCK_HAVE_DATA;
4418 [ + + + + ]: 144704 : bool fHasMoreOrSameWork = (ActiveTip() ? pindex->nChainWork >= ActiveTip()->nChainWork : true);
4419 : : // Blocks that are too out-of-order needlessly limit the effectiveness of
4420 : : // pruning, because pruning will not delete block files that contain any
4421 : : // blocks which are too close in height to the tip. Apply this test
4422 : : // regardless of whether pruning is enabled; it should generally be safe to
4423 : : // not process unrequested blocks.
4424 : 144704 : bool fTooFarAhead{pindex->nHeight > ActiveHeight() + int(MIN_BLOCKS_TO_KEEP)};
4425 : :
4426 : : // TODO: Decouple this function from the block download logic by removing fRequested
4427 : : // This requires some new chain data structure to efficiently look up if a
4428 : : // block is in a chain leading to a candidate for best tip, despite not
4429 : : // being such a candidate itself.
4430 : : // Note that this would break the getblockfrompeer RPC
4431 : :
4432 : : // TODO: deal better with return value and error conditions for duplicate
4433 : : // and unrequested blocks.
4434 [ + + ]: 144704 : if (fAlreadyHave) return true;
4435 [ + + ]: 129217 : if (!fRequested) { // If we didn't ask for it:
4436 [ + - ]: 611 : if (pindex->nTx != 0) return true; // This is a previously-processed block that was pruned
4437 [ + + ]: 611 : if (!fHasMoreOrSameWork) return true; // Don't process less-work chains
4438 [ + + ]: 604 : if (fTooFarAhead) return true; // Block height is too high
4439 : :
4440 : : // Protect against DoS attacks from low-work chains.
4441 : : // If our tip is behind, a peer could try to send us
4442 : : // low-work blocks on a fake chain that we would never
4443 : : // request; don't process these.
4444 [ + - ]: 603 : if (pindex->nChainWork < MinimumChainWork()) return true;
4445 : : }
4446 : :
4447 : 129209 : const CChainParams& params{GetParams()};
4448 : :
4449 [ + - + + ]: 258418 : if (!CheckBlock(block, state, params.GetConsensus()) ||
4450 : 129209 : !ContextualCheckBlock(block, state, *this, pindex->pprev)) {
4451 [ + - ]: 14 : if (Assume(state.IsInvalid())) {
4452 : 14 : ActiveChainstate().InvalidBlockFound(pindex, state);
4453 : : }
4454 [ + - ]: 14 : LogError("%s: %s\n", __func__, state.ToString());
4455 : 14 : return false;
4456 : : }
4457 : :
4458 : : // Header is valid/has work, merkle tree and segwit merkle tree are good...RELAY NOW
4459 : : // (but if it does not build on our best tip, let the SendMessages loop relay it)
4460 [ + + + + : 129195 : if (!IsInitialBlockDownload() && ActiveTip() == pindex->pprev && m_options.signals) {
+ - ]
4461 : 101681 : m_options.signals->NewPoWValidBlock(pindex, pblock);
4462 : : }
4463 : :
4464 : : // Write block to history file
4465 [ + + ]: 129195 : if (fNewBlock) *fNewBlock = true;
4466 : 129195 : try {
4467 : 129195 : FlatFilePos blockPos{};
4468 [ + + ]: 129195 : if (dbp) {
4469 : 3276 : blockPos = *dbp;
4470 [ + - ]: 3276 : m_blockman.UpdateBlockInfo(block, pindex->nHeight, blockPos);
4471 : : } else {
4472 [ + - ]: 125919 : blockPos = m_blockman.WriteBlock(block, pindex->nHeight);
4473 [ - + ]: 125919 : if (blockPos.IsNull()) {
4474 [ # # ]: 0 : state.Error(strprintf("%s: Failed to find position to write new block to disk", __func__));
4475 : 0 : return false;
4476 : : }
4477 : : }
4478 [ + - ]: 129195 : ReceivedBlockTransactions(block, pindex, blockPos);
4479 [ - - ]: 0 : } catch (const std::runtime_error& e) {
4480 [ - - - - ]: 0 : return FatalError(GetNotifications(), state, strprintf(_("System error while saving block to disk: %s"), e.what()));
4481 : 0 : }
4482 : :
4483 : : // TODO: FlushStateToDisk() handles flushing of both block and chainstate
4484 : : // data, so we should move this to ChainstateManager so that we can be more
4485 : : // intelligent about how we flush.
4486 : : // For now, since FlushStateMode::NONE is used, all that can happen is that
4487 : : // the block files may be pruned, so we can just call this on one
4488 : : // chainstate (particularly if we haven't implemented pruning with
4489 : : // background validation yet).
4490 : 129195 : ActiveChainstate().FlushStateToDisk(state, FlushStateMode::NONE);
4491 : :
4492 : 129195 : CheckBlockIndex();
4493 : :
4494 : 129195 : return true;
4495 : : }
4496 : :
4497 : 141819 : bool ChainstateManager::ProcessNewBlock(const std::shared_ptr<const CBlock>& block, bool force_processing, bool min_pow_checked, bool* new_block)
4498 : : {
4499 : 141819 : AssertLockNotHeld(cs_main);
4500 : :
4501 : 141819 : {
4502 : 141819 : CBlockIndex *pindex = nullptr;
4503 [ + + ]: 141819 : if (new_block) *new_block = false;
4504 [ + - ]: 141819 : BlockValidationState state;
4505 : :
4506 : : // CheckBlock() does not support multi-threaded block validation because CBlock::fChecked can cause data race.
4507 : : // Therefore, the following critical section must include the CheckBlock() call as well.
4508 [ + - ]: 141819 : LOCK(cs_main);
4509 : :
4510 : : // Skipping AcceptBlock() for CheckBlock() failures means that we will never mark a block as invalid if
4511 : : // CheckBlock() fails. This is protective against consensus failure if there are any unknown forms of block
4512 : : // malleability that cause CheckBlock() to fail; see e.g. CVE-2012-2459 and
4513 : : // https://lists.linuxfoundation.org/pipermail/bitcoin-dev/2019-February/016697.html. Because CheckBlock() is
4514 : : // not very expensive, the anti-DoS benefits of caching failure (of a definitely-invalid block) are not substantial.
4515 [ + - ]: 141819 : bool ret = CheckBlock(*block, state, GetConsensus());
4516 [ + + ]: 141819 : if (ret) {
4517 : : // Store to disk
4518 [ + - ]: 141704 : ret = AcceptBlock(block, state, &pindex, force_processing, nullptr, new_block, min_pow_checked);
4519 : : }
4520 [ + + ]: 141704 : if (!ret) {
4521 [ + - ]: 507 : if (m_options.signals) {
4522 [ + - ]: 507 : m_options.signals->BlockChecked(block, state);
4523 : : }
4524 [ + - + - ]: 507 : LogError("%s: AcceptBlock FAILED (%s)\n", __func__, state.ToString());
4525 [ + - ]: 507 : return false;
4526 : : }
4527 : 142326 : }
4528 : :
4529 : 141312 : NotifyHeaderTip();
4530 : :
4531 [ + - ]: 141312 : BlockValidationState state; // Only used to report errors, not invalidity - ignore it
4532 [ + - + - : 423936 : if (!ActiveChainstate().ActivateBestChain(state, block)) {
+ - + - +
+ ]
4533 [ + - + - ]: 1 : LogError("%s: ActivateBestChain failed (%s)\n", __func__, state.ToString());
4534 : 1 : return false;
4535 : : }
4536 : :
4537 [ + - + + ]: 282622 : Chainstate* bg_chain{WITH_LOCK(cs_main, return BackgroundSyncInProgress() ? m_ibd_chainstate.get() : nullptr)};
4538 [ + + ]: 141311 : BlockValidationState bg_state;
4539 [ + + + - : 144917 : if (bg_chain && !bg_chain->ActivateBestChain(bg_state, block)) {
+ - - + -
+ ]
4540 [ # # # # ]: 0 : LogError("%s: [background] ActivateBestChain failed (%s)\n", __func__, bg_state.ToString());
4541 : 0 : return false;
4542 : : }
4543 : :
4544 : : return true;
4545 : 282623 : }
4546 : :
4547 : 32980 : MempoolAcceptResult ChainstateManager::ProcessTransaction(const CTransactionRef& tx, bool test_accept)
4548 : : {
4549 : 32980 : AssertLockHeld(cs_main);
4550 : 32980 : Chainstate& active_chainstate = ActiveChainstate();
4551 [ - + ]: 32980 : if (!active_chainstate.GetMempool()) {
4552 [ # # ]: 0 : TxValidationState state;
4553 [ # # # # : 0 : state.Invalid(TxValidationResult::TX_NO_MEMPOOL, "no-mempool");
# # ]
4554 [ # # # # ]: 0 : return MempoolAcceptResult::Failure(state);
4555 : 0 : }
4556 : 32980 : auto result = AcceptToMemoryPool(active_chainstate, tx, GetTime(), /*bypass_limits=*/ false, test_accept);
4557 [ - + + - : 32980 : active_chainstate.GetMempool()->check(active_chainstate.CoinsTip(), active_chainstate.m_chain.Height() + 1);
+ - ]
4558 [ + - ]: 32980 : return result;
4559 : 32980 : }
4560 : :
4561 : :
4562 : 47280 : BlockValidationState TestBlockValidity(
4563 : : Chainstate& chainstate,
4564 : : const CBlock& block,
4565 : : const bool check_pow,
4566 : : const bool check_merkle_root)
4567 : : {
4568 : : // Lock must be held throughout this function for two reasons:
4569 : : // 1. We don't want the tip to change during several of the validation steps
4570 : : // 2. To prevent a CheckBlock() race condition for fChecked, see ProcessNewBlock()
4571 : 47280 : AssertLockHeld(chainstate.m_chainman.GetMutex());
4572 : :
4573 [ - + ]: 47280 : BlockValidationState state;
4574 [ - + + - ]: 94560 : CBlockIndex* tip{Assert(chainstate.m_chain.Tip())};
4575 : :
4576 [ + - + + ]: 47280 : if (block.hashPrevBlock != *Assert(tip->phashBlock)) {
4577 [ + - + - : 2 : state.Invalid({}, "inconclusive-not-best-prevblk");
+ - ]
4578 : 1 : return state;
4579 : : }
4580 : :
4581 : : // For signets CheckBlock() verifies the challenge iff fCheckPow is set.
4582 [ + - + + ]: 47279 : if (!CheckBlock(block, state, chainstate.m_chainman.GetConsensus(), /*fCheckPow=*/check_pow, /*fCheckMerkleRoot=*/check_merkle_root)) {
4583 : : // This should never happen, but belt-and-suspenders don't approve the
4584 : : // block if it does.
4585 [ - + - - ]: 8 : if (state.IsValid()) NONFATAL_UNREACHABLE();
4586 : : return state;
4587 : : }
4588 : :
4589 : : /**
4590 : : * At this point ProcessNewBlock would call AcceptBlock(), but we
4591 : : * don't want to store the block or its header. Run individual checks
4592 : : * instead:
4593 : : * - skip AcceptBlockHeader() because:
4594 : : * - we don't want to update the block index
4595 : : * - we do not care about duplicates
4596 : : * - we already ran CheckBlockHeader() via CheckBlock()
4597 : : * - we already checked for prev-blk-not-found
4598 : : * - we know the tip is valid, so no need to check bad-prevblk
4599 : : * - we already ran CheckBlock()
4600 : : * - do run ContextualCheckBlockHeader()
4601 : : * - do run ContextualCheckBlock()
4602 : : */
4603 : :
4604 [ + - + + ]: 47271 : if (!ContextualCheckBlockHeader(block, state, chainstate.m_blockman, chainstate.m_chainman, tip)) {
4605 [ - + - - ]: 4 : if (state.IsValid()) NONFATAL_UNREACHABLE();
4606 : : return state;
4607 : : }
4608 : :
4609 [ + - + + ]: 47267 : if (!ContextualCheckBlock(block, state, chainstate.m_chainman, tip)) {
4610 [ - + - - ]: 1 : if (state.IsValid()) NONFATAL_UNREACHABLE();
4611 : : return state;
4612 : : }
4613 : :
4614 : : // We don't want ConnectBlock to update the actual chainstate, so create
4615 : : // a cache on top of it, along with a dummy block index.
4616 : 47266 : CBlockIndex index_dummy{block};
4617 [ + - ]: 47266 : uint256 block_hash(block.GetHash());
4618 : 47266 : index_dummy.pprev = tip;
4619 : 47266 : index_dummy.nHeight = tip->nHeight + 1;
4620 : 47266 : index_dummy.phashBlock = &block_hash;
4621 [ + - + - ]: 47266 : CCoinsViewCache view_dummy(&chainstate.CoinsTip());
4622 : :
4623 : : // Set fJustCheck to true in order to update, and not clear, validation caches.
4624 [ + - + + ]: 47266 : if(!chainstate.ConnectBlock(block, state, &index_dummy, view_dummy, /*fJustCheck=*/true)) {
4625 [ - + - - ]: 308 : if (state.IsValid()) NONFATAL_UNREACHABLE();
4626 : : return state;
4627 : : }
4628 : :
4629 : : // Ensure no check returned successfully while also setting an invalid state.
4630 [ - + - - ]: 46958 : if (!state.IsValid()) NONFATAL_UNREACHABLE();
4631 : :
4632 : : return state;
4633 : 47266 : }
4634 : :
4635 : : /* This function is called from the RPC code for pruneblockchain */
4636 : 29 : void PruneBlockFilesManual(Chainstate& active_chainstate, int nManualPruneHeight)
4637 : : {
4638 [ + - ]: 29 : BlockValidationState state;
4639 [ + - - + ]: 29 : if (!active_chainstate.FlushStateToDisk(
4640 : : state, FlushStateMode::NONE, nManualPruneHeight)) {
4641 [ # # # # ]: 0 : LogPrintf("%s: failed to flush state (%s)\n", __func__, state.ToString());
4642 : : }
4643 : 29 : }
4644 : :
4645 : 740 : bool Chainstate::LoadChainTip()
4646 : : {
4647 : 740 : AssertLockHeld(cs_main);
4648 : 740 : const CCoinsViewCache& coins_cache = CoinsTip();
4649 [ - + ]: 1480 : assert(!coins_cache.GetBestBlock().IsNull()); // Never called when the coins view is empty
4650 [ - + ]: 740 : const CBlockIndex* tip = m_chain.Tip();
4651 : :
4652 [ + - - + ]: 13 : if (tip && tip->GetBlockHash() == coins_cache.GetBestBlock()) {
4653 : : return true;
4654 : : }
4655 : :
4656 : : // Load pointer to end of best chain
4657 : 727 : CBlockIndex* pindex = m_blockman.LookupBlockIndex(coins_cache.GetBestBlock());
4658 [ + + ]: 727 : if (!pindex) {
4659 : : return false;
4660 : : }
4661 : 725 : m_chain.SetTip(*pindex);
4662 : 725 : PruneBlockIndexCandidates();
4663 : :
4664 [ - + ]: 725 : tip = m_chain.Tip();
4665 [ - + + - : 1450 : LogInfo("Loaded best chain: hashBestChain=%s height=%d date=%s progress=%f",
+ - ]
4666 : : tip->GetBlockHash().ToString(),
4667 : : m_chain.Height(),
4668 : : FormatISO8601DateTime(tip->GetBlockTime()),
4669 : : m_chainman.GuessVerificationProgress(tip));
4670 : :
4671 : : // Ensure KernelNotifications m_tip_block is set even if no new block arrives.
4672 [ + + ]: 725 : if (this->GetRole() != ChainstateRole::BACKGROUND) {
4673 : : // Ignoring return value for now.
4674 : 716 : (void)m_chainman.GetNotifications().blockTip(
4675 : 716 : /*state=*/GetSynchronizationState(/*init=*/true, m_chainman.m_blockman.m_blockfiles_indexed),
4676 : : /*index=*/*pindex,
4677 : : /*verification_progress=*/m_chainman.GuessVerificationProgress(tip));
4678 : : }
4679 : :
4680 : : return true;
4681 : : }
4682 : :
4683 : 718 : CVerifyDB::CVerifyDB(Notifications& notifications)
4684 : 718 : : m_notifications{notifications}
4685 : : {
4686 [ + - ]: 718 : m_notifications.progress(_("Verifying blocks…"), 0, false);
4687 : 718 : }
4688 : :
4689 : 718 : CVerifyDB::~CVerifyDB()
4690 : : {
4691 : 718 : m_notifications.progress(bilingual_str{}, 100, false);
4692 : 718 : }
4693 : :
4694 : 718 : VerifyDBResult CVerifyDB::VerifyDB(
4695 : : Chainstate& chainstate,
4696 : : const Consensus::Params& consensus_params,
4697 : : CCoinsView& coinsview,
4698 : : int nCheckLevel, int nCheckDepth)
4699 : : {
4700 : 718 : AssertLockHeld(cs_main);
4701 : :
4702 [ - + + - : 2044 : if (chainstate.m_chain.Tip() == nullptr || chainstate.m_chain.Tip()->pprev == nullptr) {
+ + ]
4703 : : return VerifyDBResult::SUCCESS;
4704 : : }
4705 : :
4706 : : // Verify blocks in the best chain
4707 [ + + + + ]: 608 : if (nCheckDepth <= 0 || nCheckDepth > chainstate.m_chain.Height()) {
4708 : 18 : nCheckDepth = chainstate.m_chain.Height();
4709 : : }
4710 [ + + + - ]: 1212 : nCheckLevel = std::max(0, std::min(4, nCheckLevel));
4711 : 608 : LogInfo("Verifying last %i blocks at level %i", nCheckDepth, nCheckLevel);
4712 : 608 : CCoinsViewCache coins(&coinsview);
4713 : 608 : CBlockIndex* pindex;
4714 : 608 : CBlockIndex* pindexFailure = nullptr;
4715 : 608 : int nGoodTransactions = 0;
4716 [ + - ]: 608 : BlockValidationState state;
4717 : 608 : int reportDone = 0;
4718 : 608 : bool skipped_no_block_data{false};
4719 : 608 : bool skipped_l3_checks{false};
4720 [ + - ]: 608 : LogInfo("Verification progress: 0%%");
4721 : :
4722 [ - + ]: 608 : const bool is_snapshot_cs{chainstate.m_from_snapshot_blockhash};
4723 : :
4724 [ - + + - : 6660 : for (pindex = chainstate.m_chain.Tip(); pindex && pindex->pprev; pindex = pindex->pprev) {
+ + ]
4725 [ - + + + : 16193 : const int percentageDone = std::max(1, std::min(99, (int)(((double)(chainstate.m_chain.Height() - pindex->nHeight)) / (double)nCheckDepth * (nCheckLevel >= 4 ? 50 : 100))));
+ + + + ]
4726 [ + + ]: 6035 : if (reportDone < percentageDone / 10) {
4727 : : // report every 10% step
4728 [ + - ]: 3546 : LogInfo("Verification progress: %d%%", percentageDone);
4729 : 3546 : reportDone = percentageDone / 10;
4730 : : }
4731 [ + - + - ]: 6035 : m_notifications.progress(_("Verifying blocks…"), percentageDone, false);
4732 [ - + + + ]: 6035 : if (pindex->nHeight <= chainstate.m_chain.Height() - nCheckDepth) {
4733 : : break;
4734 : : }
4735 [ + + + + : 5452 : if ((chainstate.m_blockman.IsPruneMode() || is_snapshot_cs) && !(pindex->nStatus & BLOCK_HAVE_DATA)) {
+ + ]
4736 : : // If pruning or running under an assumeutxo snapshot, only go
4737 : : // back as far as we have data.
4738 [ + - ]: 4 : LogInfo("Block verification stopping at height %d (no data). This could be due to pruning or use of an assumeutxo snapshot.", pindex->nHeight);
4739 : : skipped_no_block_data = true;
4740 : : break;
4741 : : }
4742 : 5448 : CBlock block;
4743 : : // check level 0: read from disk
4744 [ + - + + ]: 5448 : if (!chainstate.m_blockman.ReadBlock(block, *pindex)) {
4745 [ + - + - ]: 1 : LogPrintf("Verification error: ReadBlock failed at %d, hash=%s\n", pindex->nHeight, pindex->GetBlockHash().ToString());
4746 : 1 : return VerifyDBResult::CORRUPTED_BLOCK_DB;
4747 : : }
4748 : : // check level 1: verify block validity
4749 [ + - + - : 5447 : if (nCheckLevel >= 1 && !CheckBlock(block, state, consensus_params)) {
+ - ]
4750 [ # # # # : 0 : LogPrintf("Verification error: found bad block at %d, hash=%s (%s)\n",
# # ]
4751 : : pindex->nHeight, pindex->GetBlockHash().ToString(), state.ToString());
4752 : 0 : return VerifyDBResult::CORRUPTED_BLOCK_DB;
4753 : : }
4754 : : // check level 2: verify undo validity
4755 [ + - ]: 5447 : if (nCheckLevel >= 2 && pindex) {
4756 : 5447 : CBlockUndo undo;
4757 [ + - ]: 5447 : if (!pindex->GetUndoPos().IsNull()) {
4758 [ + - + + ]: 5447 : if (!chainstate.m_blockman.ReadBlockUndo(undo, *pindex)) {
4759 [ + - + - ]: 1 : LogPrintf("Verification error: found bad undo data at %d, hash=%s\n", pindex->nHeight, pindex->GetBlockHash().ToString());
4760 : 1 : return VerifyDBResult::CORRUPTED_BLOCK_DB;
4761 : : }
4762 : : }
4763 : 5447 : }
4764 : : // check level 3: check for inconsistencies during memory-only disconnect of tip blocks
4765 [ + - + - : 5446 : size_t curr_coins_usage = coins.DynamicMemoryUsage() + chainstate.CoinsTip().DynamicMemoryUsage();
+ - ]
4766 : :
4767 [ + + ]: 5446 : if (nCheckLevel >= 3) {
4768 [ + - ]: 5241 : if (curr_coins_usage <= chainstate.m_coinstip_cache_size_bytes) {
4769 [ + - - + ]: 5241 : assert(coins.GetBestBlock() == pindex->GetBlockHash());
4770 [ + - ]: 5241 : DisconnectResult res = chainstate.DisconnectBlock(block, pindex, coins);
4771 [ - + ]: 5241 : if (res == DISCONNECT_FAILED) {
4772 [ # # # # ]: 0 : LogPrintf("Verification error: irrecoverable inconsistency in block data at %d, hash=%s\n", pindex->nHeight, pindex->GetBlockHash().ToString());
4773 : 0 : return VerifyDBResult::CORRUPTED_BLOCK_DB;
4774 : : }
4775 [ - + ]: 5241 : if (res == DISCONNECT_UNCLEAN) {
4776 : 0 : nGoodTransactions = 0;
4777 : 0 : pindexFailure = pindex;
4778 : : } else {
4779 [ - + ]: 5241 : nGoodTransactions += block.vtx.size();
4780 : : }
4781 : : } else {
4782 : : skipped_l3_checks = true;
4783 : : }
4784 : : }
4785 [ + - + + ]: 5446 : if (chainstate.m_chainman.m_interrupt) return VerifyDBResult::INTERRUPTED;
4786 : 5448 : }
4787 [ - + ]: 604 : if (pindexFailure) {
4788 [ # # # # ]: 0 : LogPrintf("Verification error: coin database inconsistencies found (last %i blocks, %i good transactions before that)\n", chainstate.m_chain.Height() - pindexFailure->nHeight + 1, nGoodTransactions);
4789 : : return VerifyDBResult::CORRUPTED_BLOCK_DB;
4790 : : }
4791 [ - + ]: 604 : if (skipped_l3_checks) {
4792 [ # # ]: 0 : LogPrintf("Skipped verification of level >=3 (insufficient database cache size). Consider increasing -dbcache.\n");
4793 : : }
4794 : :
4795 : : // store block count as we move pindex at check level >= 4
4796 [ - + ]: 604 : int block_count = chainstate.m_chain.Height() - pindex->nHeight;
4797 : :
4798 : : // check level 4: try reconnecting blocks
4799 [ + + + - ]: 604 : if (nCheckLevel >= 4 && !skipped_l3_checks) {
4800 [ - + + + ]: 2250 : while (pindex != chainstate.m_chain.Tip()) {
4801 [ + + + - ]: 2158 : const int percentageDone = std::max(1, std::min(99, 100 - (int)(((double)(chainstate.m_chain.Height() - pindex->nHeight)) / (double)nCheckDepth * 50)));
4802 [ + + ]: 1122 : if (reportDone < percentageDone / 10) {
4803 : : // report every 10% step
4804 [ + - ]: 12 : LogInfo("Verification progress: %d%%", percentageDone);
4805 : 12 : reportDone = percentageDone / 10;
4806 : : }
4807 [ + - + - ]: 1122 : m_notifications.progress(_("Verifying blocks…"), percentageDone, false);
4808 : 1122 : pindex = chainstate.m_chain.Next(pindex);
4809 : 1122 : CBlock block;
4810 [ + - - + ]: 1122 : if (!chainstate.m_blockman.ReadBlock(block, *pindex)) {
4811 [ # # # # ]: 0 : LogPrintf("Verification error: ReadBlock failed at %d, hash=%s\n", pindex->nHeight, pindex->GetBlockHash().ToString());
4812 : 0 : return VerifyDBResult::CORRUPTED_BLOCK_DB;
4813 : : }
4814 [ + - - + ]: 1122 : if (!chainstate.ConnectBlock(block, state, pindex, coins)) {
4815 [ # # # # : 0 : LogPrintf("Verification error: found unconnectable block at %d, hash=%s (%s)\n", pindex->nHeight, pindex->GetBlockHash().ToString(), state.ToString());
# # ]
4816 : 0 : return VerifyDBResult::CORRUPTED_BLOCK_DB;
4817 : : }
4818 [ + - + - ]: 1122 : if (chainstate.m_chainman.m_interrupt) return VerifyDBResult::INTERRUPTED;
4819 : 1122 : }
4820 : : }
4821 : :
4822 [ + - ]: 604 : LogInfo("Verification: No coin database inconsistencies in last %i blocks (%i transactions)", block_count, nGoodTransactions);
4823 : :
4824 [ + - ]: 604 : if (skipped_l3_checks) {
4825 : : return VerifyDBResult::SKIPPED_L3_CHECKS;
4826 : : }
4827 [ + + ]: 604 : if (skipped_no_block_data) {
4828 : 4 : return VerifyDBResult::SKIPPED_MISSING_BLOCKS;
4829 : : }
4830 : : return VerifyDBResult::SUCCESS;
4831 : 608 : }
4832 : :
4833 : : /** Apply the effects of a block on the utxo cache, ignoring that it may already have been applied. */
4834 : 0 : bool Chainstate::RollforwardBlock(const CBlockIndex* pindex, CCoinsViewCache& inputs)
4835 : : {
4836 : 0 : AssertLockHeld(cs_main);
4837 : : // TODO: merge with ConnectBlock
4838 : 0 : CBlock block;
4839 [ # # # # ]: 0 : if (!m_blockman.ReadBlock(block, *pindex)) {
4840 [ # # # # ]: 0 : LogError("ReplayBlock(): ReadBlock failed at %d, hash=%s\n", pindex->nHeight, pindex->GetBlockHash().ToString());
4841 : 0 : return false;
4842 : : }
4843 : :
4844 [ # # ]: 0 : for (const CTransactionRef& tx : block.vtx) {
4845 [ # # ]: 0 : if (!tx->IsCoinBase()) {
4846 [ # # ]: 0 : for (const CTxIn &txin : tx->vin) {
4847 [ # # ]: 0 : inputs.SpendCoin(txin.prevout);
4848 : : }
4849 : : }
4850 : : // Pass check = true as every addition may be an overwrite.
4851 [ # # ]: 0 : AddCoins(inputs, *tx, pindex->nHeight, true);
4852 : : }
4853 : : return true;
4854 : 0 : }
4855 : :
4856 : 1198 : bool Chainstate::ReplayBlocks()
4857 : : {
4858 : 1198 : LOCK(cs_main);
4859 : :
4860 [ + - ]: 1198 : CCoinsView& db = this->CoinsDB();
4861 [ + - ]: 1198 : CCoinsViewCache cache(&db);
4862 : :
4863 [ + - ]: 1198 : std::vector<uint256> hashHeads = db.GetHeadBlocks();
4864 [ - + ]: 1198 : if (hashHeads.empty()) return true; // We're already in a consistent state.
4865 [ # # # # ]: 0 : if (hashHeads.size() != 2) {
4866 [ # # ]: 0 : LogError("ReplayBlocks(): unknown inconsistent state\n");
4867 : : return false;
4868 : : }
4869 : :
4870 [ # # # # ]: 0 : m_chainman.GetNotifications().progress(_("Replaying blocks…"), 0, false);
4871 [ # # ]: 0 : LogInfo("Replaying blocks");
4872 : :
4873 : 0 : const CBlockIndex* pindexOld = nullptr; // Old tip during the interrupted flush.
4874 : 0 : const CBlockIndex* pindexNew; // New tip during the interrupted flush.
4875 : 0 : const CBlockIndex* pindexFork = nullptr; // Latest block common to both the old and the new tip.
4876 : :
4877 [ # # ]: 0 : if (m_blockman.m_block_index.count(hashHeads[0]) == 0) {
4878 [ # # ]: 0 : LogError("ReplayBlocks(): reorganization to unknown block requested\n");
4879 : : return false;
4880 : : }
4881 [ # # ]: 0 : pindexNew = &(m_blockman.m_block_index[hashHeads[0]]);
4882 : :
4883 [ # # ]: 0 : if (!hashHeads[1].IsNull()) { // The old tip is allowed to be 0, indicating it's the first flush.
4884 [ # # ]: 0 : if (m_blockman.m_block_index.count(hashHeads[1]) == 0) {
4885 [ # # ]: 0 : LogError("ReplayBlocks(): reorganization from unknown block requested\n");
4886 : : return false;
4887 : : }
4888 [ # # ]: 0 : pindexOld = &(m_blockman.m_block_index[hashHeads[1]]);
4889 [ # # ]: 0 : pindexFork = LastCommonAncestor(pindexOld, pindexNew);
4890 [ # # ]: 0 : assert(pindexFork != nullptr);
4891 : : }
4892 : :
4893 : : // Rollback along the old branch.
4894 [ # # ]: 0 : while (pindexOld != pindexFork) {
4895 [ # # ]: 0 : if (pindexOld->nHeight > 0) { // Never disconnect the genesis block.
4896 : 0 : CBlock block;
4897 [ # # # # ]: 0 : if (!m_blockman.ReadBlock(block, *pindexOld)) {
4898 [ # # # # ]: 0 : LogError("RollbackBlock(): ReadBlock() failed at %d, hash=%s\n", pindexOld->nHeight, pindexOld->GetBlockHash().ToString());
4899 : 0 : return false;
4900 : : }
4901 [ # # # # ]: 0 : LogInfo("Rolling back %s (%i)", pindexOld->GetBlockHash().ToString(), pindexOld->nHeight);
4902 [ # # ]: 0 : DisconnectResult res = DisconnectBlock(block, pindexOld, cache);
4903 [ # # ]: 0 : if (res == DISCONNECT_FAILED) {
4904 [ # # # # ]: 0 : LogError("RollbackBlock(): DisconnectBlock failed at %d, hash=%s\n", pindexOld->nHeight, pindexOld->GetBlockHash().ToString());
4905 : 0 : return false;
4906 : : }
4907 : : // If DISCONNECT_UNCLEAN is returned, it means a non-existing UTXO was deleted, or an existing UTXO was
4908 : : // overwritten. It corresponds to cases where the block-to-be-disconnect never had all its operations
4909 : : // applied to the UTXO set. However, as both writing a UTXO and deleting a UTXO are idempotent operations,
4910 : : // the result is still a version of the UTXO set with the effects of that block undone.
4911 : 0 : }
4912 : 0 : pindexOld = pindexOld->pprev;
4913 : : }
4914 : :
4915 : : // Roll forward from the forking point to the new tip.
4916 [ # # ]: 0 : int nForkHeight = pindexFork ? pindexFork->nHeight : 0;
4917 [ # # ]: 0 : for (int nHeight = nForkHeight + 1; nHeight <= pindexNew->nHeight; ++nHeight) {
4918 [ # # # # ]: 0 : const CBlockIndex& pindex{*Assert(pindexNew->GetAncestor(nHeight))};
4919 : :
4920 [ # # # # ]: 0 : LogInfo("Rolling forward %s (%i)", pindex.GetBlockHash().ToString(), nHeight);
4921 [ # # # # ]: 0 : m_chainman.GetNotifications().progress(_("Replaying blocks…"), (int)((nHeight - nForkHeight) * 100.0 / (pindexNew->nHeight - nForkHeight)), false);
4922 [ # # # # ]: 0 : if (!RollforwardBlock(&pindex, cache)) return false;
4923 : : }
4924 : :
4925 [ # # ]: 0 : cache.SetBestBlock(pindexNew->GetBlockHash());
4926 [ # # ]: 0 : cache.Flush();
4927 [ # # ]: 0 : m_chainman.GetNotifications().progress(bilingual_str{}, 100, false);
4928 : 0 : return true;
4929 [ + - ]: 2396 : }
4930 : :
4931 : 1196 : bool Chainstate::NeedsRedownload() const
4932 : : {
4933 : 1196 : AssertLockHeld(cs_main);
4934 : :
4935 : : // At and above m_params.SegwitHeight, segwit consensus rules must be validated
4936 [ - + ]: 1196 : CBlockIndex* block{m_chain.Tip()};
4937 : :
4938 [ + + + + ]: 156683 : while (block != nullptr && DeploymentActiveAt(*block, m_chainman, Consensus::DEPLOYMENT_SEGWIT)) {
4939 [ + + ]: 155488 : if (!(block->nStatus & BLOCK_OPT_WITNESS)) {
4940 : : // block is insufficiently validated for a segwit client
4941 : : return true;
4942 : : }
4943 : 155487 : block = block->pprev;
4944 : : }
4945 : :
4946 : : return false;
4947 : : }
4948 : :
4949 : 6 : void Chainstate::ClearBlockIndexCandidates()
4950 : : {
4951 : 6 : AssertLockHeld(::cs_main);
4952 : 6 : setBlockIndexCandidates.clear();
4953 : 6 : }
4954 : :
4955 : 1200 : bool ChainstateManager::LoadBlockIndex()
4956 : : {
4957 : 1200 : AssertLockHeld(cs_main);
4958 : : // Load block index from databases
4959 [ + + ]: 1200 : if (m_blockman.m_blockfiles_indexed) {
4960 : 1182 : bool ret{m_blockman.LoadBlockIndexDB(SnapshotBlockhash())};
4961 [ + + ]: 1182 : if (!ret) return false;
4962 : :
4963 : 1177 : m_blockman.ScanAndUnlinkAlreadyPrunedFiles();
4964 : :
4965 : 1177 : std::vector<CBlockIndex*> vSortedByHeight{m_blockman.GetAllBlockIndices()};
4966 [ + - ]: 1177 : std::sort(vSortedByHeight.begin(), vSortedByHeight.end(),
4967 : : CBlockIndexHeightOnlyComparator());
4968 : :
4969 [ + + ]: 160000 : for (CBlockIndex* pindex : vSortedByHeight) {
4970 [ + - + + ]: 158824 : if (m_interrupt) return false;
4971 : : // If we have an assumeutxo-based chainstate, then the snapshot
4972 : : // block will be a candidate for the tip, but it may not be
4973 : : // VALID_TRANSACTIONS (eg if we haven't yet downloaded the block),
4974 : : // so we special-case the snapshot block as a potential candidate
4975 : : // here.
4976 [ + - + + ]: 158823 : if (pindex == GetSnapshotBaseBlock() ||
4977 [ + + ]: 158239 : (pindex->IsValid(BLOCK_VALID_TRANSACTIONS) &&
4978 [ + + - + ]: 157113 : (pindex->HaveNumChainTxs() || pindex->pprev == nullptr))) {
4979 : :
4980 [ + - + + ]: 473807 : for (Chainstate* chainstate : GetAll()) {
4981 [ + - ]: 159569 : chainstate->TryAddBlockIndexCandidate(pindex);
4982 : : }
4983 : : }
4984 [ + + + + : 158823 : if (pindex->nStatus & BLOCK_FAILED_MASK && (!m_best_invalid || pindex->nChainWork > m_best_invalid->nChainWork)) {
+ - + + ]
4985 : 570 : m_best_invalid = pindex;
4986 : : }
4987 [ + + + - : 315069 : if (pindex->IsValid(BLOCK_VALID_TREE) && (m_best_header == nullptr || CBlockIndexWorkComparator()(m_best_header, pindex)))
+ + + - +
+ ]
4988 : 156246 : m_best_header = pindex;
4989 : : }
4990 : 1177 : }
4991 : : return true;
4992 : : }
4993 : :
4994 : 1192 : bool Chainstate::LoadGenesisBlock()
4995 : : {
4996 : 1192 : LOCK(cs_main);
4997 : :
4998 [ + - ]: 1192 : const CChainParams& params{m_chainman.GetParams()};
4999 : :
5000 : : // Check whether we're already initialized by checking for genesis in
5001 : : // m_blockman.m_block_index. Note that we can't use m_chain here, since it is
5002 : : // set based on the coins db, not the block index db, which is the only
5003 : : // thing loaded at this point.
5004 [ + - + + ]: 2384 : if (m_blockman.m_block_index.count(params.GenesisBlock().GetHash()))
5005 : : return true;
5006 : :
5007 : 455 : try {
5008 [ + - ]: 455 : const CBlock& block = params.GenesisBlock();
5009 [ + - ]: 455 : FlatFilePos blockPos{m_blockman.WriteBlock(block, 0)};
5010 [ - + ]: 455 : if (blockPos.IsNull()) {
5011 [ # # ]: 0 : LogError("%s: writing genesis block to disk failed\n", __func__);
5012 : : return false;
5013 : : }
5014 [ + - ]: 455 : CBlockIndex* pindex = m_blockman.AddToBlockIndex(block, m_chainman.m_best_header);
5015 [ + - ]: 455 : m_chainman.ReceivedBlockTransactions(block, pindex, blockPos);
5016 [ - - ]: 0 : } catch (const std::runtime_error& e) {
5017 [ - - ]: 0 : LogError("%s: failed to write genesis block: %s\n", __func__, e.what());
5018 : 0 : return false;
5019 : 0 : }
5020 : :
5021 : : return true;
5022 : 1192 : }
5023 : :
5024 : 17 : void ChainstateManager::LoadExternalBlockFile(
5025 : : AutoFile& file_in,
5026 : : FlatFilePos* dbp,
5027 : : std::multimap<uint256, FlatFilePos>* blocks_with_unknown_parent)
5028 : : {
5029 : : // Either both should be specified (-reindex), or neither (-loadblock).
5030 [ - + ]: 17 : assert(!dbp == !blocks_with_unknown_parent);
5031 : :
5032 : 17 : const auto start{SteadyClock::now()};
5033 [ + - ]: 17 : const CChainParams& params{GetParams()};
5034 : :
5035 : 17 : int nLoaded = 0;
5036 : 17 : try {
5037 [ + - ]: 17 : BufferedFile blkdat{file_in, 2 * MAX_BLOCK_SERIALIZED_SIZE, MAX_BLOCK_SERIALIZED_SIZE + 8};
5038 : : // nRewind indicates where to resume scanning in case something goes wrong,
5039 : : // such as a block fails to deserialize.
5040 : 17 : uint64_t nRewind = blkdat.GetPos();
5041 [ + + ]: 4815 : while (!blkdat.eof()) {
5042 [ + - + + ]: 4814 : if (m_interrupt) return;
5043 : :
5044 : 4813 : blkdat.SetPos(nRewind);
5045 : 4813 : nRewind++; // start one byte further next time, in case of failure
5046 [ + + ]: 4813 : blkdat.SetLimit(); // remove former limit
5047 : 4813 : unsigned int nSize = 0;
5048 : 4813 : try {
5049 : : // locate a header
5050 : 4813 : MessageStartChars buf;
5051 [ + + ]: 4813 : blkdat.FindByte(std::byte(params.MessageStart()[0]));
5052 [ + - ]: 4798 : nRewind = blkdat.GetPos() + 1;
5053 [ + - ]: 4798 : blkdat >> buf;
5054 [ - + ]: 4798 : if (buf != params.MessageStart()) {
5055 : 0 : continue;
5056 : : }
5057 : : // read size
5058 [ + - ]: 4798 : blkdat >> nSize;
5059 [ - + ]: 4798 : if (nSize < 80 || nSize > MAX_BLOCK_SERIALIZED_SIZE)
5060 : 0 : continue;
5061 [ - + ]: 15 : } catch (const std::exception&) {
5062 : : // no valid block header found; don't complain
5063 : : // (this happens at the end of every blk.dat file)
5064 : 15 : break;
5065 : 15 : }
5066 : 4798 : try {
5067 : : // read block header
5068 [ + + ]: 4798 : const uint64_t nBlockPos{blkdat.GetPos()};
5069 [ + + ]: 4798 : if (dbp)
5070 : 4697 : dbp->nPos = nBlockPos;
5071 [ + - ]: 4798 : blkdat.SetLimit(nBlockPos + nSize);
5072 : 4798 : CBlockHeader header;
5073 [ + - ]: 4798 : blkdat >> header;
5074 [ + - ]: 4798 : const uint256 hash{header.GetHash()};
5075 : : // Skip the rest of this block (this may read from disk into memory); position to the marker before the
5076 : : // next block, but it's still possible to rewind to the start of the current block (without a disk read).
5077 : 4798 : nRewind = nBlockPos + nSize;
5078 [ + - ]: 4798 : blkdat.SkipTo(nRewind);
5079 : :
5080 : 4798 : std::shared_ptr<CBlock> pblock{}; // needs to remain available after the cs_main lock is released to avoid duplicate reads from disk
5081 : :
5082 : 4798 : {
5083 [ + - ]: 4798 : LOCK(cs_main);
5084 : : // detect out of order blocks, and store them for later
5085 [ + + + - : 4798 : if (hash != params.GetConsensus().hashGenesisBlock && !m_blockman.LookupBlockIndex(header.hashPrevBlock)) {
+ + ]
5086 [ + - + - : 208 : LogDebug(BCLog::REINDEX, "%s: Out of order block %s, parent %s not known\n", __func__, hash.ToString(),
+ - + - +
- ]
5087 : : header.hashPrevBlock.ToString());
5088 [ + - ]: 104 : if (dbp && blocks_with_unknown_parent) {
5089 [ + - ]: 104 : blocks_with_unknown_parent->emplace(header.hashPrevBlock, *dbp);
5090 : : }
5091 : 104 : continue;
5092 [ + - ]: 104 : }
5093 : :
5094 : : // process in case the block isn't known yet
5095 [ + - ]: 4694 : const CBlockIndex* pindex = m_blockman.LookupBlockIndex(hash);
5096 [ + + - + ]: 4694 : if (!pindex || (pindex->nStatus & BLOCK_HAVE_DATA) == 0) {
5097 : : // This block can be processed immediately; rewind to its start, read and deserialize it.
5098 : 3276 : blkdat.SetPos(nBlockPos);
5099 [ + - - + ]: 6552 : pblock = std::make_shared<CBlock>();
5100 [ + - ]: 3276 : blkdat >> TX_WITH_WITNESS(*pblock);
5101 [ + - ]: 3276 : nRewind = blkdat.GetPos();
5102 : :
5103 [ + - ]: 3276 : BlockValidationState state;
5104 [ + - + - : 9828 : if (AcceptBlock(pblock, state, nullptr, true, dbp, nullptr, true)) {
+ - + + ]
5105 : 3272 : nLoaded++;
5106 : : }
5107 [ + - ]: 3276 : if (state.IsError()) {
5108 : : break;
5109 : : }
5110 [ - - + + : 4694 : } else if (hash != params.GetConsensus().hashGenesisBlock && pindex->nHeight % 1000 == 0) {
+ + ]
5111 [ + - + - : 2 : LogDebug(BCLog::REINDEX, "Block Import: already had block %s at height %d\n", hash.ToString(), pindex->nHeight);
+ - + - ]
5112 : : }
5113 : 104 : }
5114 : :
5115 : : // Activate the genesis block so normal node progress can continue
5116 : : // During first -reindex, this will only connect Genesis since
5117 : : // ActivateBestChain only connects blocks which are in the block tree db,
5118 : : // which only contains blocks whose parents are in it.
5119 : : // But do this only if genesis isn't activated yet, to avoid connecting many blocks
5120 : : // without assumevalid in the case of a continuation of a reindex that
5121 : : // was interrupted by the user.
5122 [ + + + - : 4726 : if (hash == params.GetConsensus().hashGenesisBlock && WITH_LOCK(::cs_main, return ActiveHeight()) == -1) {
+ + + - +
- ]
5123 [ + - ]: 14 : BlockValidationState state;
5124 [ + - + - : 14 : if (!ActiveChainstate().ActivateBestChain(state, nullptr)) {
- + + - ]
5125 : : break;
5126 : : }
5127 : 14 : }
5128 : :
5129 [ + + - + : 4694 : if (m_blockman.IsPruneMode() && m_blockman.m_blockfiles_indexed && pblock) {
- - ]
5130 : : // must update the tip for pruning to work while importing with -loadblock.
5131 : : // this is a tradeoff to conserve disk space at the expense of time
5132 : : // spent updating the tip to be able to prune.
5133 : : // otherwise, ActivateBestChain won't be called by the import process
5134 : : // until after all of the block files are loaded. ActivateBestChain can be
5135 : : // called by concurrent network message processing. but, that is not
5136 : : // reliable for the purpose of pruning while importing.
5137 : 0 : bool activation_failure = false;
5138 [ # # # # ]: 0 : for (auto c : GetAll()) {
5139 [ # # ]: 0 : BlockValidationState state;
5140 [ # # # # : 0 : if (!c->ActivateBestChain(state, pblock)) {
# # # # ]
5141 [ # # # # : 0 : LogDebug(BCLog::REINDEX, "failed to activate chain (%s)\n", state.ToString());
# # # # ]
5142 : 0 : activation_failure = true;
5143 : 0 : break;
5144 : : }
5145 : 0 : }
5146 [ # # ]: 0 : if (activation_failure) {
5147 : : break;
5148 : : }
5149 : : }
5150 : :
5151 [ + - ]: 4694 : NotifyHeaderTip();
5152 : :
5153 [ + + ]: 4694 : if (!blocks_with_unknown_parent) continue;
5154 : :
5155 : : // Recursively process earlier encountered successors of this block
5156 [ + - ]: 4593 : std::deque<uint256> queue;
5157 [ + - ]: 4593 : queue.push_back(hash);
5158 [ + + ]: 9290 : while (!queue.empty()) {
5159 : 4697 : uint256 head = queue.front();
5160 : 4697 : queue.pop_front();
5161 : 4697 : auto range = blocks_with_unknown_parent->equal_range(head);
5162 [ + + ]: 4801 : while (range.first != range.second) {
5163 : 104 : std::multimap<uint256, FlatFilePos>::iterator it = range.first;
5164 [ + - ]: 104 : std::shared_ptr<CBlock> pblockrecursive = std::make_shared<CBlock>();
5165 [ + - + - ]: 104 : if (m_blockman.ReadBlock(*pblockrecursive, it->second, {})) {
5166 [ + - ]: 104 : const auto& block_hash{pblockrecursive->GetHash()};
5167 [ + - + - : 208 : LogDebug(BCLog::REINDEX, "%s: Processing out of order child %s of %s", __func__, block_hash.ToString(), head.ToString());
+ - + - +
- ]
5168 [ + - ]: 104 : LOCK(cs_main);
5169 [ + - ]: 104 : BlockValidationState dummy;
5170 [ + - + - : 312 : if (AcceptBlock(pblockrecursive, dummy, nullptr, true, &it->second, nullptr, true)) {
+ - + - ]
5171 : 104 : nLoaded++;
5172 [ + - ]: 104 : queue.push_back(block_hash);
5173 : : }
5174 [ + - ]: 208 : }
5175 : 104 : range.first++;
5176 : 104 : blocks_with_unknown_parent->erase(it);
5177 [ + - ]: 104 : NotifyHeaderTip();
5178 : 104 : }
5179 : : }
5180 [ + + - - ]: 7974 : } catch (const std::exception& e) {
5181 : : // historical bugs added extra data to the block files that does not deserialize cleanly.
5182 : : // commonly this data is between readable blocks, but it does not really matter. such data is not fatal to the import process.
5183 : : // the code that reads the block files deals with invalid data by simply ignoring it.
5184 : : // it continues to search for the next {4 byte magic message start bytes + 4 byte length + block} that does deserialize cleanly
5185 : : // and passes all of the other block validation checks dealing with POW and the merkle root, etc...
5186 : : // we merely note with this informational log message when unexpected data is encountered.
5187 : : // we could also be experiencing a storage system read error, or a read of a previous bad write. these are possible, but
5188 : : // less likely scenarios. we don't have enough information to tell a difference here.
5189 : : // the reindex process is not the place to attempt to clean and/or compact the block files. if so desired, a studious node operator
5190 : : // may use knowledge of the fact that the block files are not entirely pristine in order to prepare a set of pristine, and
5191 : : // perhaps ordered, block files for later reindexing.
5192 [ - - - - : 0 : LogDebug(BCLog::REINDEX, "%s: unexpected data at file offset 0x%x - %s. continuing\n", __func__, (nRewind - 1), e.what());
- - ]
5193 : 0 : }
5194 : : }
5195 [ - - ]: 17 : } catch (const std::runtime_error& e) {
5196 [ - - - - ]: 0 : GetNotifications().fatalError(strprintf(_("System error while loading external block file: %s"), e.what()));
5197 : 0 : }
5198 : 16 : LogInfo("Loaded %i blocks from external file in %dms", nLoaded, Ticks<std::chrono::milliseconds>(SteadyClock::now() - start));
5199 : : }
5200 : :
5201 : 500091 : bool ChainstateManager::ShouldCheckBlockIndex() const
5202 : : {
5203 : : // Assert to verify Flatten() has been called.
5204 [ + + ]: 500091 : if (!*Assert(m_options.check_block_index)) return false;
5205 [ - + ]: 364577 : if (FastRandomContext().randrange(*m_options.check_block_index) >= 1) return false;
5206 : : return true;
5207 : : }
5208 : :
5209 : 500091 : void ChainstateManager::CheckBlockIndex() const
5210 : : {
5211 [ + + ]: 500091 : if (!ShouldCheckBlockIndex()) {
5212 : : return;
5213 : : }
5214 : :
5215 : 364577 : LOCK(cs_main);
5216 : :
5217 : : // During a reindex, we read the genesis block and call CheckBlockIndex before ActivateBestChain,
5218 : : // so we have the genesis block in m_blockman.m_block_index but no active chain. (A few of the
5219 : : // tests when iterating the block tree require that m_chain has been initialized.)
5220 [ + - - + : 364577 : if (ActiveChain().Height() < 0) {
+ + ]
5221 [ - + ]: 28 : assert(m_blockman.m_block_index.size() <= 1);
5222 [ + - ]: 28 : return;
5223 : : }
5224 : :
5225 : : // Build forward-pointing data structure for the entire block tree.
5226 : : // For performance reasons, indexes of the best header chain are stored in a vector (within CChain).
5227 : : // All remaining blocks are stored in a multimap.
5228 : : // The best header chain can differ from the active chain: E.g. its entries may belong to blocks that
5229 : : // are not yet validated.
5230 : 364549 : CChain best_hdr_chain;
5231 [ - + ]: 364549 : assert(m_best_header);
5232 [ - + ]: 364549 : assert(!(m_best_header->nStatus & BLOCK_FAILED_MASK));
5233 [ + - ]: 364549 : best_hdr_chain.SetTip(*m_best_header);
5234 : :
5235 : 364549 : std::multimap<const CBlockIndex*, const CBlockIndex*> forward;
5236 [ + + + + ]: 263146799 : for (auto& [_, block_index] : m_blockman.m_block_index) {
5237 : : // Only save indexes in forward that are not part of the best header chain.
5238 [ + + ]: 262782250 : if (!best_hdr_chain.Contains(&block_index)) {
5239 : : // Only genesis, which must be part of the best header chain, can have a nullptr parent.
5240 [ - + ]: 27846423 : assert(block_index.pprev);
5241 [ + - ]: 27846423 : forward.emplace(block_index.pprev, &block_index);
5242 : : }
5243 : : }
5244 [ - + - + ]: 364549 : assert(forward.size() + best_hdr_chain.Height() + 1 == m_blockman.m_block_index.size());
5245 : :
5246 [ + - ]: 364549 : const CBlockIndex* pindex = best_hdr_chain[0];
5247 [ - + ]: 364549 : assert(pindex);
5248 : : // Iterate over the entire block tree, using depth-first search.
5249 : : // Along the way, remember whether there are blocks on the path from genesis
5250 : : // block being explored which are the first to have certain properties.
5251 : 364549 : size_t nNodes = 0;
5252 : 364549 : int nHeight = 0;
5253 : 364549 : const CBlockIndex* pindexFirstInvalid = nullptr; // Oldest ancestor of pindex which is invalid.
5254 : 364549 : const CBlockIndex* pindexFirstMissing = nullptr; // Oldest ancestor of pindex which does not have BLOCK_HAVE_DATA, since assumeutxo snapshot if used.
5255 : 364549 : const CBlockIndex* pindexFirstNeverProcessed = nullptr; // Oldest ancestor of pindex for which nTx == 0, since assumeutxo snapshot if used.
5256 : 364549 : const CBlockIndex* pindexFirstNotTreeValid = nullptr; // Oldest ancestor of pindex which does not have BLOCK_VALID_TREE (regardless of being valid or not).
5257 : 364549 : const CBlockIndex* pindexFirstNotTransactionsValid = nullptr; // Oldest ancestor of pindex which does not have BLOCK_VALID_TRANSACTIONS (regardless of being valid or not), since assumeutxo snapshot if used.
5258 : 364549 : const CBlockIndex* pindexFirstNotChainValid = nullptr; // Oldest ancestor of pindex which does not have BLOCK_VALID_CHAIN (regardless of being valid or not), since assumeutxo snapshot if used.
5259 : 364549 : const CBlockIndex* pindexFirstNotScriptsValid = nullptr; // Oldest ancestor of pindex which does not have BLOCK_VALID_SCRIPTS (regardless of being valid or not), since assumeutxo snapshot if used.
5260 : :
5261 : : // After checking an assumeutxo snapshot block, reset pindexFirst pointers
5262 : : // to earlier blocks that have not been downloaded or validated yet, so
5263 : : // checks for later blocks can assume the earlier blocks were validated and
5264 : : // be stricter, testing for more requirements.
5265 [ + - ]: 364549 : const CBlockIndex* snap_base{GetSnapshotBaseBlock()};
5266 : 364549 : const CBlockIndex *snap_first_missing{}, *snap_first_notx{}, *snap_first_notv{}, *snap_first_nocv{}, *snap_first_nosv{};
5267 : 290993222 : auto snap_update_firsts = [&] {
5268 [ + + ]: 290628673 : if (pindex == snap_base) {
5269 : 5845 : std::swap(snap_first_missing, pindexFirstMissing);
5270 : 5845 : std::swap(snap_first_notx, pindexFirstNeverProcessed);
5271 : 5845 : std::swap(snap_first_notv, pindexFirstNotTransactionsValid);
5272 : 5845 : std::swap(snap_first_nocv, pindexFirstNotChainValid);
5273 : 5845 : std::swap(snap_first_nosv, pindexFirstNotScriptsValid);
5274 : : }
5275 : 290993222 : };
5276 : :
5277 [ + + ]: 262792904 : while (pindex != nullptr) {
5278 : 262782250 : nNodes++;
5279 [ + + + + ]: 262782250 : if (pindexFirstInvalid == nullptr && pindex->nStatus & BLOCK_FAILED_VALID) pindexFirstInvalid = pindex;
5280 [ + + + + ]: 262782250 : if (pindexFirstMissing == nullptr && !(pindex->nStatus & BLOCK_HAVE_DATA)) {
5281 : 979846 : pindexFirstMissing = pindex;
5282 : : }
5283 [ + + + + ]: 262782250 : if (pindexFirstNeverProcessed == nullptr && pindex->nTx == 0) pindexFirstNeverProcessed = pindex;
5284 [ + + + - : 262782250 : if (pindex->pprev != nullptr && pindexFirstNotTreeValid == nullptr && (pindex->nStatus & BLOCK_VALID_MASK) < BLOCK_VALID_TREE) pindexFirstNotTreeValid = pindex;
- + ]
5285 : :
5286 [ + + ]: 262782250 : if (pindex->pprev != nullptr) {
5287 [ + + ]: 262417701 : if (pindexFirstNotTransactionsValid == nullptr &&
5288 [ + + ]: 209090812 : (pindex->nStatus & BLOCK_VALID_MASK) < BLOCK_VALID_TRANSACTIONS) {
5289 : 965032 : pindexFirstNotTransactionsValid = pindex;
5290 : : }
5291 : :
5292 [ + + ]: 262417701 : if (pindexFirstNotChainValid == nullptr &&
5293 [ + + ]: 204571050 : (pindex->nStatus & BLOCK_VALID_MASK) < BLOCK_VALID_CHAIN) {
5294 : 12964559 : pindexFirstNotChainValid = pindex;
5295 : : }
5296 : :
5297 [ + + ]: 262417701 : if (pindexFirstNotScriptsValid == nullptr &&
5298 [ + + ]: 204571050 : (pindex->nStatus & BLOCK_VALID_MASK) < BLOCK_VALID_SCRIPTS) {
5299 : 12964559 : pindexFirstNotScriptsValid = pindex;
5300 : : }
5301 : : }
5302 : :
5303 : : // Begin: actual consistency checks.
5304 [ + + ]: 262782250 : if (pindex->pprev == nullptr) {
5305 : : // Genesis block checks.
5306 [ - + ]: 364549 : assert(pindex->GetBlockHash() == GetConsensus().hashGenesisBlock); // Genesis block's hash must match.
5307 [ + + ]: 1093647 : for (const Chainstate* c : {m_ibd_chainstate.get(), m_snapshot_chainstate.get()}) {
5308 [ + + - + : 1469886 : if (c && c->m_chain.Genesis() != nullptr) {
+ - ]
5309 [ - + ]: 370394 : assert(pindex == c->m_chain.Genesis()); // The chain's genesis block must be this block.
5310 : : }
5311 : : }
5312 : : }
5313 [ + + - + ]: 262782250 : if (!pindex->HaveNumChainTxs()) assert(pindex->nSequenceId <= 0); // nSequenceId can't be set positive for blocks that aren't linked (negative is used for preciousblock)
5314 : : // VALID_TRANSACTIONS is equivalent to nTx > 0 for all nodes (whether or not pruning has occurred).
5315 : : // HAVE_DATA is only equivalent to nTx > 0 (or VALID_TRANSACTIONS) if no pruning has occurred.
5316 [ + + ]: 262782250 : if (!m_blockman.m_have_pruned) {
5317 : : // If we've never pruned, then HAVE_DATA should be equivalent to nTx > 0
5318 [ - + ]: 217771864 : assert(!(pindex->nStatus & BLOCK_HAVE_DATA) == (pindex->nTx == 0));
5319 [ - + ]: 217771864 : assert(pindexFirstMissing == pindexFirstNeverProcessed);
5320 : : } else {
5321 : : // If we have pruned, then we can only say that HAVE_DATA implies nTx > 0
5322 [ + + - + ]: 45010386 : if (pindex->nStatus & BLOCK_HAVE_DATA) assert(pindex->nTx > 0);
5323 : : }
5324 [ + + - + ]: 262782250 : if (pindex->nStatus & BLOCK_HAVE_UNDO) assert(pindex->nStatus & BLOCK_HAVE_DATA);
5325 [ + + + - : 262782250 : if (snap_base && snap_base->GetAncestor(pindex->nHeight) == pindex) {
+ + ]
5326 : : // Assumed-valid blocks should connect to the main chain.
5327 [ - + ]: 1519140 : assert((pindex->nStatus & BLOCK_VALID_MASK) >= BLOCK_VALID_TREE);
5328 : : }
5329 : : // There should only be an nTx value if we have
5330 : : // actually seen a block's transactions.
5331 [ - + ]: 262782250 : assert(((pindex->nStatus & BLOCK_VALID_MASK) >= BLOCK_VALID_TRANSACTIONS) == (pindex->nTx > 0)); // This is pruning-independent.
5332 : : // All parents having had data (at some point) is equivalent to all parents being VALID_TRANSACTIONS, which is equivalent to HaveNumChainTxs().
5333 : : // HaveNumChainTxs will also be set in the assumeutxo snapshot block from snapshot metadata.
5334 [ + + + + : 317069572 : assert((pindexFirstNeverProcessed == nullptr || pindex == snap_base) == pindex->HaveNumChainTxs());
- + ]
5335 [ + + + + : 317069572 : assert((pindexFirstNotTransactionsValid == nullptr || pindex == snap_base) == pindex->HaveNumChainTxs());
- + ]
5336 [ - + ]: 262782250 : assert(pindex->nHeight == nHeight); // nHeight must be consistent.
5337 [ + + + - : 262782250 : assert(pindex->pprev == nullptr || pindex->nChainWork >= pindex->pprev->nChainWork); // For every block except the genesis block, the chainwork must be larger than the parent's.
- + ]
5338 [ + + + - : 262782250 : assert(nHeight < 2 || (pindex->pskip && (pindex->pskip->nHeight < nHeight))); // The pskip pointer must point back for all but the first 2 blocks.
- + ]
5339 [ - + ]: 262782250 : assert(pindexFirstNotTreeValid == nullptr); // All m_blockman.m_block_index entries must at least be TREE valid
5340 : 262782250 : if ((pindex->nStatus & BLOCK_VALID_MASK) >= BLOCK_VALID_TREE) assert(pindexFirstNotTreeValid == nullptr); // TREE valid implies all parents are TREE valid
5341 [ + + - + ]: 262782250 : if ((pindex->nStatus & BLOCK_VALID_MASK) >= BLOCK_VALID_CHAIN) assert(pindexFirstNotChainValid == nullptr); // CHAIN valid implies all parents are CHAIN valid
5342 [ + + - + ]: 262782250 : if ((pindex->nStatus & BLOCK_VALID_MASK) >= BLOCK_VALID_SCRIPTS) assert(pindexFirstNotScriptsValid == nullptr); // SCRIPTS valid implies all parents are SCRIPTS valid
5343 [ + + ]: 262782250 : if (pindexFirstInvalid == nullptr) {
5344 : : // Checks for not-invalid blocks.
5345 [ - + ]: 248903167 : assert((pindex->nStatus & BLOCK_FAILED_MASK) == 0); // The failed mask cannot be set for blocks without invalid parents.
5346 : : } else {
5347 [ - + ]: 13879083 : assert(pindex->nStatus & BLOCK_FAILED_MASK); // Invalid blocks and their descendants must be marked as invalid
5348 : : }
5349 : : // Make sure m_chain_tx_count sum is correctly computed.
5350 [ + + ]: 262782250 : if (!pindex->pprev) {
5351 : : // If no previous block, nTx and m_chain_tx_count must be the same.
5352 [ - + ]: 364549 : assert(pindex->m_chain_tx_count == pindex->nTx);
5353 [ + + + + ]: 262417701 : } else if (pindex->pprev->m_chain_tx_count > 0 && pindex->nTx > 0) {
5354 : : // If previous m_chain_tx_count is set and number of transactions in block is known, sum must be set.
5355 [ - + ]: 208125780 : assert(pindex->m_chain_tx_count == pindex->nTx + pindex->pprev->m_chain_tx_count);
5356 : : } else {
5357 : : // Otherwise m_chain_tx_count should only be set if this is a snapshot
5358 : : // block, and must be set if it is.
5359 [ - + ]: 54291921 : assert((pindex->m_chain_tx_count != 0) == (pindex == snap_base));
5360 : : }
5361 : : // There should be no block with more work than m_best_header, unless it's known to be invalid
5362 [ + + + - : 262782250 : assert((pindex->nStatus & BLOCK_FAILED_MASK) || pindex->nChainWork <= m_best_header->nChainWork);
- + ]
5363 : :
5364 : : // Chainstate-specific checks on setBlockIndexCandidates
5365 [ + + ]: 788346750 : for (const Chainstate* c : {m_ibd_chainstate.get(), m_snapshot_chainstate.get()}) {
5366 [ + + - + : 790426719 : if (!c || c->m_chain.Tip() == nullptr) continue;
+ - ]
5367 : : // Two main factors determine whether pindex is a candidate in
5368 : : // setBlockIndexCandidates:
5369 : : //
5370 : : // - If pindex has less work than the chain tip, it should not be a
5371 : : // candidate, and this will be asserted below. Otherwise it is a
5372 : : // potential candidate.
5373 : : //
5374 : : // - If pindex or one of its parent blocks back to the genesis block
5375 : : // or an assumeutxo snapshot never downloaded transactions
5376 : : // (pindexFirstNeverProcessed is non-null), it should not be a
5377 : : // candidate, and this will be asserted below. The only exception
5378 : : // is if pindex itself is an assumeutxo snapshot block. Then it is
5379 : : // also a potential candidate.
5380 [ + - + + : 264862219 : if (!CBlockIndexWorkComparator()(pindex, c->m_chain.Tip()) && (pindexFirstNeverProcessed == nullptr || pindex == snap_base)) {
+ + + + ]
5381 : : // If pindex was detected as invalid (pindexFirstInvalid is
5382 : : // non-null), it is not required to be in
5383 : : // setBlockIndexCandidates.
5384 [ + + ]: 4243490 : if (pindexFirstInvalid == nullptr) {
5385 : : // If pindex and all its parents back to the genesis block
5386 : : // or an assumeutxo snapshot block downloaded transactions,
5387 : : // and the transactions were not pruned (pindexFirstMissing
5388 : : // is null), it is a potential candidate. The check
5389 : : // excludes pruned blocks, because if any blocks were
5390 : : // pruned between pindex and the current chain tip, pindex will
5391 : : // only temporarily be added to setBlockIndexCandidates,
5392 : : // before being moved to m_blocks_unlinked. This check
5393 : : // could be improved to verify that if all blocks between
5394 : : // the chain tip and pindex have data, pindex must be a
5395 : : // candidate.
5396 : : //
5397 : : // If pindex is the chain tip, it also is a potential
5398 : : // candidate.
5399 : : //
5400 : : // If the chainstate was loaded from a snapshot and pindex
5401 : : // is the base of the snapshot, pindex is also a potential
5402 : : // candidate.
5403 [ + + - + : 3608732 : if (pindexFirstMissing == nullptr || pindex == c->m_chain.Tip() || pindex == c->SnapshotBase()) {
+ + + - -
+ ]
5404 : : // If this chainstate is the active chainstate, pindex
5405 : : // must be in setBlockIndexCandidates. Otherwise, this
5406 : : // chainstate is a background validation chainstate, and
5407 : : // pindex only needs to be added if it is an ancestor of
5408 : : // the snapshot that is being validated.
5409 [ + - + + : 3553039 : if (c == &ActiveChainstate() || snap_base->GetAncestor(pindex->nHeight) == pindex) {
+ - + + ]
5410 [ + - - + ]: 3168928 : assert(c->setBlockIndexCandidates.contains(const_cast<CBlockIndex*>(pindex)));
5411 : : }
5412 : : }
5413 : : // If some parent is missing, then it could be that this block was in
5414 : : // setBlockIndexCandidates but had to be removed because of the missing data.
5415 : : // In this case it must be in m_blocks_unlinked -- see test below.
5416 : : }
5417 : : } else { // If this block sorts worse than the current tip or some ancestor's block has never been seen, it cannot be in setBlockIndexCandidates.
5418 [ + - - + ]: 260618729 : assert(!c->setBlockIndexCandidates.contains(const_cast<CBlockIndex*>(pindex)));
5419 : : }
5420 : : }
5421 : : // Check whether this block is in m_blocks_unlinked.
5422 : 262782250 : auto rangeUnlinked{m_blockman.m_blocks_unlinked.equal_range(pindex->pprev)};
5423 : 262782250 : bool foundInUnlinked = false;
5424 [ + + ]: 262793112 : while (rangeUnlinked.first != rangeUnlinked.second) {
5425 [ - + ]: 13495602 : assert(rangeUnlinked.first->first == pindex->pprev);
5426 [ + + ]: 13495602 : if (rangeUnlinked.first->second == pindex) {
5427 : : foundInUnlinked = true;
5428 : : break;
5429 : : }
5430 : 10862 : rangeUnlinked.first++;
5431 : : }
5432 [ + + + + : 262782250 : if (pindex->pprev && (pindex->nStatus & BLOCK_HAVE_DATA) && pindexFirstNeverProcessed != nullptr && pindexFirstInvalid == nullptr) {
+ + + - ]
5433 : : // If this block has block data available, some parent was never received, and has no invalid parents, it must be in m_blocks_unlinked.
5434 [ - + ]: 13357198 : assert(foundInUnlinked);
5435 : : }
5436 [ + + - + ]: 262782250 : if (!(pindex->nStatus & BLOCK_HAVE_DATA)) assert(!foundInUnlinked); // Can't be in m_blocks_unlinked if we don't HAVE_DATA
5437 [ + + - + ]: 262782250 : if (pindexFirstMissing == nullptr) assert(!foundInUnlinked); // We aren't missing data for any parent -- cannot be in m_blocks_unlinked.
5438 [ + + + + : 262782250 : if (pindex->pprev && (pindex->nStatus & BLOCK_HAVE_DATA) && pindexFirstNeverProcessed == nullptr && pindexFirstMissing != nullptr) {
+ + + + ]
5439 : : // We HAVE_DATA for this block, have received data for all parents at some point, but we're currently missing data for some parent.
5440 [ - + ]: 25724253 : assert(m_blockman.m_have_pruned);
5441 : : // This block may have entered m_blocks_unlinked if:
5442 : : // - it has a descendant that at some point had more work than the
5443 : : // tip, and
5444 : : // - we tried switching to that descendant but were missing
5445 : : // data for some intermediate block between m_chain and the
5446 : : // tip.
5447 : : // So if this block is itself better than any m_chain.Tip() and it wasn't in
5448 : : // setBlockIndexCandidates, then it must be in m_blocks_unlinked.
5449 [ + + ]: 77172759 : for (const Chainstate* c : {m_ibd_chainstate.get(), m_snapshot_chainstate.get()}) {
5450 [ + + ]: 51448506 : if (!c) continue;
5451 [ + - ]: 25724253 : const bool is_active = c == &ActiveChainstate();
5452 [ - + + - : 51448506 : if (!CBlockIndexWorkComparator()(pindex, c->m_chain.Tip()) && !c->setBlockIndexCandidates.contains(const_cast<CBlockIndex*>(pindex))) {
+ + + - +
+ ]
5453 [ + + ]: 255237 : if (pindexFirstInvalid == nullptr) {
5454 [ - + - - : 2199 : if (is_active || snap_base->GetAncestor(pindex->nHeight) == pindex) {
- - ]
5455 [ - + ]: 2199 : assert(foundInUnlinked);
5456 : : }
5457 : : }
5458 : : }
5459 : : }
5460 : : }
5461 : : // assert(pindex->GetBlockHash() == pindex->GetBlockHeader().GetHash()); // Perhaps too slow
5462 : : // End: actual consistency checks.
5463 : :
5464 : :
5465 : : // Try descending into the first subnode. Always process forks first and the best header chain after.
5466 : 262782250 : snap_update_firsts();
5467 : 262782250 : auto range{forward.equal_range(pindex)};
5468 [ + + ]: 262782250 : if (range.first != range.second) {
5469 : : // A subnode not part of the best header chain was found.
5470 : 21361245 : pindex = range.first->second;
5471 : 21361245 : nHeight++;
5472 : 21361245 : continue;
5473 [ + + ]: 241421005 : } else if (best_hdr_chain.Contains(pindex)) {
5474 : : // Descend further into best header chain.
5475 : 228154108 : nHeight++;
5476 [ + - ]: 228154108 : pindex = best_hdr_chain[nHeight];
5477 [ + + ]: 228154108 : if (!pindex) break; // we are finished, since the best header chain is always processed last
5478 : 227800213 : continue;
5479 : : }
5480 : : // This is a leaf node.
5481 : : // Move upwards until we reach a node of which we have not yet visited the last child.
5482 [ + - ]: 27846423 : while (pindex) {
5483 : : // We are going to either move to a parent or a sibling of pindex.
5484 : 27846423 : snap_update_firsts();
5485 : : // If pindex was the first with a certain property, unset the corresponding variable.
5486 [ + + ]: 27846423 : if (pindex == pindexFirstInvalid) pindexFirstInvalid = nullptr;
5487 [ + + ]: 27846423 : if (pindex == pindexFirstMissing) pindexFirstMissing = nullptr;
5488 [ + + ]: 27846423 : if (pindex == pindexFirstNeverProcessed) pindexFirstNeverProcessed = nullptr;
5489 [ - + ]: 27846423 : if (pindex == pindexFirstNotTreeValid) pindexFirstNotTreeValid = nullptr;
5490 [ + + ]: 27846423 : if (pindex == pindexFirstNotTransactionsValid) pindexFirstNotTransactionsValid = nullptr;
5491 [ + + ]: 27846423 : if (pindex == pindexFirstNotChainValid) pindexFirstNotChainValid = nullptr;
5492 [ + + ]: 27846423 : if (pindex == pindexFirstNotScriptsValid) pindexFirstNotScriptsValid = nullptr;
5493 : : // Find our parent.
5494 : 27846423 : CBlockIndex* pindexPar = pindex->pprev;
5495 : : // Find which child we just visited.
5496 : 27846423 : auto rangePar{forward.equal_range(pindexPar)};
5497 [ + + ]: 49663332 : while (rangePar.first->second != pindex) {
5498 [ - + ]: 21816909 : assert(rangePar.first != rangePar.second); // Our parent must have at least the node we're coming from as child.
5499 : 21816909 : rangePar.first++;
5500 : : }
5501 : : // Proceed to the next one.
5502 : 27846423 : rangePar.first++;
5503 [ + + ]: 27846423 : if (rangePar.first != rangePar.second) {
5504 : : // Move to a sibling not part of the best header chain.
5505 : 6485178 : pindex = rangePar.first->second;
5506 : 6485178 : break;
5507 [ + - + + ]: 42722490 : } else if (pindexPar == best_hdr_chain[nHeight - 1]) {
5508 : : // Move to pindex's sibling on the best-chain, if it has one.
5509 [ + - ]: 6781719 : pindex = best_hdr_chain[nHeight];
5510 : : // There will not be a next block if (and only if) parent block is the best header.
5511 [ - + - + ]: 13563438 : assert((pindex == nullptr) == (pindexPar == best_hdr_chain.Tip()));
5512 : : break;
5513 : : } else {
5514 : : // Move up further.
5515 : 14579526 : pindex = pindexPar;
5516 : 14579526 : nHeight--;
5517 : 14579526 : continue;
5518 : : }
5519 : : }
5520 : : }
5521 : :
5522 : : // Check that we actually traversed the entire block index.
5523 [ - + - + ]: 364549 : assert(nNodes == forward.size() + best_hdr_chain.Height() + 1);
5524 [ + - ]: 729126 : }
5525 : :
5526 : 1476 : std::string Chainstate::ToString()
5527 : : {
5528 : 1476 : AssertLockHeld(::cs_main);
5529 [ - + ]: 1476 : CBlockIndex* tip = m_chain.Tip();
5530 : 254 : return strprintf("Chainstate [%s] @ height %d (%s)",
5531 : 2952 : m_from_snapshot_blockhash ? "snapshot" : "ibd",
5532 [ + - - + : 4328 : tip ? tip->nHeight : -1, tip ? tip->GetBlockHash().ToString() : "null");
+ + + - ]
5533 : : }
5534 : :
5535 : 1753 : bool Chainstate::ResizeCoinsCaches(size_t coinstip_size, size_t coinsdb_size)
5536 : : {
5537 : 1753 : AssertLockHeld(::cs_main);
5538 [ + + ]: 1753 : if (coinstip_size == m_coinstip_cache_size_bytes &&
5539 [ - + ]: 1631 : coinsdb_size == m_coinsdb_cache_size_bytes) {
5540 : : // Cache sizes are unchanged, no need to continue.
5541 : : return true;
5542 : : }
5543 : 122 : size_t old_coinstip_size = m_coinstip_cache_size_bytes;
5544 : 122 : m_coinstip_cache_size_bytes = coinstip_size;
5545 : 122 : m_coinsdb_cache_size_bytes = coinsdb_size;
5546 : 122 : CoinsDB().ResizeCache(coinsdb_size);
5547 : :
5548 [ + - ]: 122 : LogInfo("[%s] resized coinsdb cache to %.1f MiB",
5549 : : this->ToString(), coinsdb_size * (1.0 / 1024 / 1024));
5550 [ + - ]: 122 : LogInfo("[%s] resized coinstip cache to %.1f MiB",
5551 : : this->ToString(), coinstip_size * (1.0 / 1024 / 1024));
5552 : :
5553 [ + + ]: 122 : BlockValidationState state;
5554 : 122 : bool ret;
5555 : :
5556 [ + + ]: 122 : if (coinstip_size > old_coinstip_size) {
5557 : : // Likely no need to flush if cache sizes have grown.
5558 [ + - ]: 59 : ret = FlushStateToDisk(state, FlushStateMode::IF_NEEDED);
5559 : : } else {
5560 : : // Otherwise, flush state to disk and deallocate the in-memory coins map.
5561 [ + - ]: 63 : ret = FlushStateToDisk(state, FlushStateMode::ALWAYS);
5562 : : }
5563 : 122 : return ret;
5564 : 122 : }
5565 : :
5566 : 351808 : double ChainstateManager::GuessVerificationProgress(const CBlockIndex* pindex) const
5567 : : {
5568 : 351808 : AssertLockHeld(GetMutex());
5569 [ + + ]: 351808 : const ChainTxData& data{GetParams().TxData()};
5570 [ + + ]: 351808 : if (pindex == nullptr) {
5571 : : return 0.0;
5572 : : }
5573 : :
5574 [ + + ]: 351807 : if (pindex->m_chain_tx_count == 0) {
5575 [ + - ]: 99 : LogDebug(BCLog::VALIDATION, "Block %d has unset m_chain_tx_count. Unable to estimate verification progress.\n", pindex->nHeight);
5576 : 99 : return 0.0;
5577 : : }
5578 : :
5579 : 351708 : const int64_t nNow{TicksSinceEpoch<std::chrono::seconds>(NodeClock::now())};
5580 : 351708 : const auto block_time{
5581 [ + + ]: 351708 : (Assume(m_best_header) && std::abs(nNow - pindex->GetBlockTime()) <= Ticks<std::chrono::seconds>(2h) &&
5582 [ + - + - ]: 653875 : Assume(m_best_header->nHeight >= pindex->nHeight)) ?
5583 : : // When the header is known to be recent, switch to a height-based
5584 : : // approach. This ensures the returned value is quantized when
5585 : : // close to "1.0", because some users expect it to be. This also
5586 : : // avoids relying too much on the exact miner-set timestamp, which
5587 : : // may be off.
5588 : 302167 : nNow - (m_best_header->nHeight - pindex->nHeight) * GetConsensus().nPowTargetSpacing :
5589 : 49541 : pindex->GetBlockTime(),
5590 : 302167 : };
5591 : :
5592 : 351708 : double fTxTotal;
5593 : :
5594 [ + + ]: 351708 : if (pindex->m_chain_tx_count <= data.tx_count) {
5595 : 4459 : fTxTotal = data.tx_count + (nNow - data.nTime) * data.dTxRate;
5596 : : } else {
5597 : 347249 : fTxTotal = pindex->m_chain_tx_count + (nNow - block_time) * data.dTxRate;
5598 : : }
5599 : :
5600 [ + + ]: 351708 : return std::min<double>(pindex->m_chain_tx_count / fTxTotal, 1.0);
5601 : : }
5602 : :
5603 : 1288 : std::optional<uint256> ChainstateManager::SnapshotBlockhash() const
5604 : : {
5605 : 1288 : LOCK(::cs_main);
5606 [ + - + + ]: 1288 : if (m_active_chainstate && m_active_chainstate->m_from_snapshot_blockhash) {
5607 : : // If a snapshot chainstate exists, it will always be our active.
5608 : 53 : return m_active_chainstate->m_from_snapshot_blockhash;
5609 : : }
5610 : 1235 : return std::nullopt;
5611 : 1288 : }
5612 : :
5613 : 533826 : std::vector<Chainstate*> ChainstateManager::GetAll()
5614 : : {
5615 : 533826 : LOCK(::cs_main);
5616 : 533826 : std::vector<Chainstate*> out;
5617 : :
5618 [ + + ]: 1601478 : for (Chainstate* cs : {m_ibd_chainstate.get(), m_snapshot_chainstate.get()}) {
5619 [ + + + - ]: 1608444 : if (this->IsUsable(cs)) out.push_back(cs);
5620 : : }
5621 : :
5622 [ + - ]: 533826 : return out;
5623 : 533826 : }
5624 : :
5625 : 1200 : Chainstate& ChainstateManager::InitializeChainstate(CTxMemPool* mempool)
5626 : : {
5627 : 1200 : AssertLockHeld(::cs_main);
5628 [ - + ]: 1200 : assert(!m_ibd_chainstate);
5629 [ - + ]: 1200 : assert(!m_active_chainstate);
5630 : :
5631 : 1200 : m_ibd_chainstate = std::make_unique<Chainstate>(mempool, m_blockman, *this);
5632 : 1200 : m_active_chainstate = m_ibd_chainstate.get();
5633 : 1200 : return *m_active_chainstate;
5634 : : }
5635 : :
5636 : 29 : [[nodiscard]] static bool DeleteCoinsDBFromDisk(const fs::path db_path, bool is_snapshot)
5637 : : EXCLUSIVE_LOCKS_REQUIRED(::cs_main)
5638 : : {
5639 : 29 : AssertLockHeld(::cs_main);
5640 : :
5641 [ + + ]: 29 : if (is_snapshot) {
5642 [ + - ]: 52 : fs::path base_blockhash_path = db_path / node::SNAPSHOT_BLOCKHASH_FILENAME;
5643 : :
5644 : 26 : try {
5645 [ + - ]: 26 : bool existed = fs::remove(base_blockhash_path);
5646 [ + + ]: 26 : if (!existed) {
5647 [ - + + - ]: 72 : LogPrintf("[snapshot] snapshot chainstate dir being removed lacks %s file\n",
5648 : : fs::PathToString(node::SNAPSHOT_BLOCKHASH_FILENAME));
5649 : : }
5650 [ - - ]: 0 : } catch (const fs::filesystem_error& e) {
5651 [ - - - - : 0 : LogWarning("[snapshot] failed to remove file %s: %s\n",
- - ]
5652 : : fs::PathToString(base_blockhash_path), e.code().message());
5653 [ - - ]: 0 : }
5654 : 26 : }
5655 : :
5656 [ - + ]: 29 : std::string path_str = fs::PathToString(db_path);
5657 [ + - ]: 29 : LogInfo("Removing leveldb dir at %s\n", path_str);
5658 : :
5659 : : // We have to destruct before this call leveldb::DB in order to release the db
5660 : : // lock, otherwise `DestroyDB` will fail. See `leveldb::~DBImpl()`.
5661 [ + - ]: 29 : const bool destroyed = DestroyDB(path_str);
5662 : :
5663 [ + - ]: 29 : if (!destroyed) {
5664 [ # # ]: 0 : LogPrintf("error: leveldb DestroyDB call failed on %s\n", path_str);
5665 : : }
5666 : :
5667 : : // Datadir should be removed from filesystem; otherwise initialization may detect
5668 : : // it on subsequent statups and get confused.
5669 : : //
5670 : : // If the base_blockhash_path removal above fails in the case of snapshot
5671 : : // chainstates, this will return false since leveldb won't remove a non-empty
5672 : : // directory.
5673 [ + - - + ]: 29 : return destroyed && !fs::exists(db_path);
5674 : 29 : }
5675 : :
5676 : 63 : util::Result<CBlockIndex*> ChainstateManager::ActivateSnapshot(
5677 : : AutoFile& coins_file,
5678 : : const SnapshotMetadata& metadata,
5679 : : bool in_memory)
5680 : : {
5681 : 63 : uint256 base_blockhash = metadata.m_base_blockhash;
5682 : :
5683 [ + + ]: 63 : if (this->SnapshotBlockhash()) {
5684 [ + - ]: 15 : return util::Error{Untranslated("Can't activate a snapshot-based chainstate more than once")};
5685 : : }
5686 : :
5687 : 58 : CBlockIndex* snapshot_start_block{};
5688 : :
5689 : 58 : {
5690 : 58 : LOCK(::cs_main);
5691 : :
5692 [ + + ]: 58 : if (!GetParams().AssumeutxoForBlockhash(base_blockhash).has_value()) {
5693 [ + - ]: 14 : auto available_heights = GetParams().GetAvailableSnapshotHeights();
5694 [ + - + - ]: 56 : std::string heights_formatted = util::Join(available_heights, ", ", [&](const auto& i) { return util::ToString(i); });
5695 [ + - + - ]: 28 : return util::Error{Untranslated(strprintf("assumeutxo block hash in snapshot metadata not recognized (hash: %s). The following snapshot heights are available: %s",
5696 [ + - ]: 28 : base_blockhash.ToString(),
5697 : 14 : heights_formatted))};
5698 : 14 : }
5699 : :
5700 [ + - ]: 44 : snapshot_start_block = m_blockman.LookupBlockIndex(base_blockhash);
5701 [ + + ]: 44 : if (!snapshot_start_block) {
5702 [ + - + - ]: 6 : return util::Error{Untranslated(strprintf("The base block header (%s) must appear in the headers chain. Make sure all headers are syncing, and call loadtxoutset again",
5703 [ + - ]: 9 : base_blockhash.ToString()))};
5704 : : }
5705 : :
5706 : 41 : bool start_block_invalid = snapshot_start_block->nStatus & BLOCK_FAILED_MASK;
5707 [ + + ]: 41 : if (start_block_invalid) {
5708 [ + - + - : 6 : return util::Error{Untranslated(strprintf("The base block header (%s) is part of an invalid chain", base_blockhash.ToString()))};
+ - ]
5709 : : }
5710 : :
5711 [ + - + - : 39 : if (!m_best_header || m_best_header->GetAncestor(snapshot_start_block->nHeight) != snapshot_start_block) {
+ + ]
5712 [ + - + - ]: 3 : return util::Error{Untranslated("A forked headers-chain with more work than the chain with the snapshot base block header exists. Please proceed to sync without AssumeUtxo.")};
5713 : : }
5714 : :
5715 [ + - ]: 38 : auto mempool{m_active_chainstate->GetMempool()};
5716 [ + - + - : 38 : if (mempool && mempool->size() > 0) {
+ + ]
5717 [ + - + - ]: 3 : return util::Error{Untranslated("Can't activate a snapshot when mempool not empty")};
5718 : : }
5719 : 21 : }
5720 : :
5721 : 37 : int64_t current_coinsdb_cache_size{0};
5722 : 37 : int64_t current_coinstip_cache_size{0};
5723 : :
5724 : : // Cache percentages to allocate to each chainstate.
5725 : : //
5726 : : // These particular percentages don't matter so much since they will only be
5727 : : // relevant during snapshot activation; caches are rebalanced at the conclusion of
5728 : : // this function. We want to give (essentially) all available cache capacity to the
5729 : : // snapshot to aid the bulk load later in this function.
5730 : 37 : static constexpr double IBD_CACHE_PERC = 0.01;
5731 : 37 : static constexpr double SNAPSHOT_CACHE_PERC = 0.99;
5732 : :
5733 : 37 : {
5734 : 37 : LOCK(::cs_main);
5735 : : // Resize the coins caches to ensure we're not exceeding memory limits.
5736 : : //
5737 : : // Allocate the majority of the cache to the incoming snapshot chainstate, since
5738 : : // (optimistically) getting to its tip will be the top priority. We'll need to call
5739 : : // `MaybeRebalanceCaches()` once we're done with this function to ensure
5740 : : // the right allocation (including the possibility that no snapshot was activated
5741 : : // and that we should restore the active chainstate caches to their original size).
5742 : : //
5743 [ + - ]: 37 : current_coinsdb_cache_size = this->ActiveChainstate().m_coinsdb_cache_size_bytes;
5744 [ + - ]: 37 : current_coinstip_cache_size = this->ActiveChainstate().m_coinstip_cache_size_bytes;
5745 : :
5746 : : // Temporarily resize the active coins cache to make room for the newly-created
5747 : : // snapshot chain.
5748 [ + - ]: 37 : this->ActiveChainstate().ResizeCoinsCaches(
5749 : 37 : static_cast<size_t>(current_coinstip_cache_size * IBD_CACHE_PERC),
5750 [ + - ]: 37 : static_cast<size_t>(current_coinsdb_cache_size * IBD_CACHE_PERC));
5751 : 0 : }
5752 : :
5753 [ + - ]: 111 : auto snapshot_chainstate = WITH_LOCK(::cs_main,
5754 : : return std::make_unique<Chainstate>(
5755 : : /*mempool=*/nullptr, m_blockman, *this, base_blockhash));
5756 : :
5757 : 37 : {
5758 [ + - ]: 37 : LOCK(::cs_main);
5759 [ + - ]: 37 : snapshot_chainstate->InitCoinsDB(
5760 : 37 : static_cast<size_t>(current_coinsdb_cache_size * SNAPSHOT_CACHE_PERC),
5761 [ + - ]: 37 : in_memory, false, "chainstate");
5762 [ + - ]: 37 : snapshot_chainstate->InitCoinsCache(
5763 [ + - ]: 37 : static_cast<size_t>(current_coinstip_cache_size * SNAPSHOT_CACHE_PERC));
5764 : 0 : }
5765 : :
5766 : 61 : auto cleanup_bad_snapshot = [&](bilingual_str reason) EXCLUSIVE_LOCKS_REQUIRED(::cs_main) {
5767 : 24 : this->MaybeRebalanceCaches();
5768 : :
5769 : : // PopulateAndValidateSnapshot can return (in error) before the leveldb datadir
5770 : : // has been created, so only attempt removal if we got that far.
5771 [ + - ]: 24 : if (auto snapshot_datadir = node::FindSnapshotChainstateDir(m_options.datadir)) {
5772 : : // We have to destruct leveldb::DB in order to release the db lock, otherwise
5773 : : // DestroyDB() (in DeleteCoinsDBFromDisk()) will fail. See `leveldb::~DBImpl()`.
5774 : : // Destructing the chainstate (and so resetting the coinsviews object) does this.
5775 [ + - ]: 24 : snapshot_chainstate.reset();
5776 [ + - + - ]: 24 : bool removed = DeleteCoinsDBFromDisk(*snapshot_datadir, /*is_snapshot=*/true);
5777 [ - + ]: 24 : if (!removed) {
5778 [ # # # # ]: 0 : GetNotifications().fatalError(strprintf(_("Failed to remove snapshot chainstate dir (%s). "
5779 [ # # # # ]: 0 : "Manually remove it before restarting.\n"), fs::PathToString(*snapshot_datadir)));
5780 : : }
5781 : 24 : }
5782 : 24 : return util::Error{std::move(reason)};
5783 : 37 : };
5784 : :
5785 [ + - + + ]: 37 : if (auto res{this->PopulateAndValidateSnapshot(*snapshot_chainstate, coins_file, metadata)}; !res) {
5786 [ + - ]: 24 : LOCK(::cs_main);
5787 [ + - + - : 120 : return cleanup_bad_snapshot(Untranslated(strprintf("Population failed: %s", util::ErrorString(res).original)));
+ - + - +
- ]
5788 : 24 : }
5789 : :
5790 [ + - ]: 13 : LOCK(::cs_main); // cs_main required for rest of snapshot activation.
5791 : :
5792 : : // Do a final check to ensure that the snapshot chainstate is actually a more
5793 : : // work chain than the active chainstate; a user could have loaded a snapshot
5794 : : // very late in the IBD process, and we wouldn't want to load a useless chainstate.
5795 [ - + + - : 26 : if (!CBlockIndexWorkComparator()(ActiveTip(), snapshot_chainstate->m_chain.Tip())) {
+ - - + ]
5796 [ # # # # : 0 : return cleanup_bad_snapshot(Untranslated("work does not exceed active chainstate"));
# # ]
5797 : : }
5798 : : // If not in-memory, persist the base blockhash for use during subsequent
5799 : : // initialization.
5800 [ + - ]: 13 : if (!in_memory) {
5801 [ + - - + ]: 13 : if (!node::WriteSnapshotBaseBlockhash(*snapshot_chainstate)) {
5802 [ # # # # : 0 : return cleanup_bad_snapshot(Untranslated("could not write base blockhash"));
# # ]
5803 : : }
5804 : : }
5805 : :
5806 [ - + ]: 13 : assert(!m_snapshot_chainstate);
5807 [ + - ]: 13 : m_snapshot_chainstate.swap(snapshot_chainstate);
5808 [ + - ]: 13 : const bool chaintip_loaded = m_snapshot_chainstate->LoadChainTip();
5809 [ - + ]: 13 : assert(chaintip_loaded);
5810 : :
5811 : : // Transfer possession of the mempool to the snapshot chainstate.
5812 : : // Mempool is empty at this point because we're still in IBD.
5813 [ + - + - ]: 13 : Assert(m_active_chainstate->m_mempool->size() == 0);
5814 [ + - ]: 13 : Assert(!m_snapshot_chainstate->m_mempool);
5815 [ + - ]: 13 : m_snapshot_chainstate->m_mempool = m_active_chainstate->m_mempool;
5816 : 13 : m_active_chainstate->m_mempool = nullptr;
5817 : 13 : m_active_chainstate = m_snapshot_chainstate.get();
5818 [ + - ]: 13 : m_blockman.m_snapshot_height = this->GetSnapshotBaseHeight();
5819 : :
5820 [ + - + - ]: 13 : LogInfo("[snapshot] successfully activated snapshot %s", base_blockhash.ToString());
5821 [ + - + - : 13 : LogInfo("[snapshot] (%.2f MB)",
+ - ]
5822 : : m_snapshot_chainstate->CoinsTip().DynamicMemoryUsage() / (1000 * 1000));
5823 : :
5824 [ + - ]: 13 : this->MaybeRebalanceCaches();
5825 : 13 : return snapshot_start_block;
5826 : 37 : }
5827 : :
5828 : 21 : static void FlushSnapshotToDisk(CCoinsViewCache& coins_cache, bool snapshot_loaded)
5829 : : {
5830 [ - + + - : 42 : LOG_TIME_MILLIS_WITH_CATEGORY_MSG_ONCE(
+ - ]
5831 : : strprintf("%s (%.2f MB)",
5832 : : snapshot_loaded ? "saving snapshot chainstate" : "flushing coins cache",
5833 : : coins_cache.DynamicMemoryUsage() / (1000 * 1000)),
5834 : : BCLog::LogFlags::ALL);
5835 : :
5836 [ + - ]: 21 : coins_cache.Flush();
5837 : 21 : }
5838 : :
5839 : 0 : struct StopHashingException : public std::exception
5840 : : {
5841 : 0 : const char* what() const noexcept override
5842 : : {
5843 : 0 : return "ComputeUTXOStats interrupted.";
5844 : : }
5845 : : };
5846 : :
5847 : 7407 : static void SnapshotUTXOHashBreakpoint(const util::SignalInterrupt& interrupt)
5848 : : {
5849 [ - + ]: 7407 : if (interrupt) throw StopHashingException();
5850 : 7407 : }
5851 : :
5852 : 37 : util::Result<void> ChainstateManager::PopulateAndValidateSnapshot(
5853 : : Chainstate& snapshot_chainstate,
5854 : : AutoFile& coins_file,
5855 : : const SnapshotMetadata& metadata)
5856 : : {
5857 : : // It's okay to release cs_main before we're done using `coins_cache` because we know
5858 : : // that nothing else will be referencing the newly created snapshot_chainstate yet.
5859 [ + - + - ]: 111 : CCoinsViewCache& coins_cache = *WITH_LOCK(::cs_main, return &snapshot_chainstate.CoinsTip());
5860 : :
5861 : 37 : uint256 base_blockhash = metadata.m_base_blockhash;
5862 : :
5863 [ + - + - ]: 111 : CBlockIndex* snapshot_start_block = WITH_LOCK(::cs_main, return m_blockman.LookupBlockIndex(base_blockhash));
5864 : :
5865 [ - + ]: 37 : if (!snapshot_start_block) {
5866 : : // Needed for ComputeUTXOStats to determine the
5867 : : // height and to avoid a crash when base_blockhash.IsNull()
5868 [ # # # # ]: 0 : return util::Error{Untranslated(strprintf("Did not find snapshot start blockheader %s",
5869 : 0 : base_blockhash.ToString()))};
5870 : : }
5871 : :
5872 : 37 : int base_height = snapshot_start_block->nHeight;
5873 : 37 : const auto& maybe_au_data = GetParams().AssumeutxoForHeight(base_height);
5874 : :
5875 [ - + ]: 37 : if (!maybe_au_data) {
5876 [ # # ]: 0 : return util::Error{Untranslated(strprintf("Assumeutxo height in snapshot metadata not recognized "
5877 : 0 : "(%d) - refusing to load snapshot", base_height))};
5878 : : }
5879 : :
5880 : 37 : const AssumeutxoData& au_data = *maybe_au_data;
5881 : :
5882 : : // This work comparison is a duplicate check with the one performed later in
5883 : : // ActivateSnapshot(), but is done so that we avoid doing the long work of staging
5884 : : // a snapshot that isn't actually usable.
5885 [ + + + - : 111 : if (WITH_LOCK(::cs_main, return !CBlockIndexWorkComparator()(ActiveTip(), snapshot_start_block))) {
+ - + - ]
5886 [ + - ]: 6 : return util::Error{Untranslated("Work does not exceed active chainstate")};
5887 : : }
5888 : :
5889 : 35 : const uint64_t coins_count = metadata.m_coins_count;
5890 : 35 : uint64_t coins_left = metadata.m_coins_count;
5891 : :
5892 [ + - ]: 35 : LogInfo("[snapshot] loading %d coins from snapshot %s", coins_left, base_blockhash.ToString());
5893 : 35 : int64_t coins_processed{0};
5894 : :
5895 [ + + ]: 6082 : while (coins_left > 0) {
5896 : 6056 : try {
5897 [ + + ]: 6056 : Txid txid;
5898 [ + + ]: 6056 : coins_file >> txid;
5899 : 6051 : size_t coins_per_txid{0};
5900 [ + - ]: 6051 : coins_per_txid = ReadCompactSize(coins_file);
5901 : :
5902 [ + + ]: 6051 : if (coins_per_txid > coins_left) {
5903 [ + - + - ]: 3 : return util::Error{Untranslated("Mismatch in coins count in snapshot metadata and actual snapshot data")};
5904 : : }
5905 : :
5906 [ + + ]: 12098 : for (size_t i = 0; i < coins_per_txid; i++) {
5907 : 6051 : COutPoint outpoint;
5908 : 6051 : Coin coin;
5909 [ + - ]: 6051 : outpoint.n = static_cast<uint32_t>(ReadCompactSize(coins_file));
5910 : 6051 : outpoint.hash = txid;
5911 [ + + ]: 6051 : coins_file >> coin;
5912 [ + + ]: 6050 : if (coin.nHeight > base_height ||
5913 [ - + ]: 6049 : outpoint.n >= std::numeric_limits<decltype(outpoint.n)>::max() // Avoid integer wrap-around in coinstats.cpp:ApplyHash
5914 : : ) {
5915 [ + - ]: 2 : return util::Error{Untranslated(strprintf("Bad snapshot data after deserializing %d coins",
5916 [ + - ]: 2 : coins_count - coins_left))};
5917 : : }
5918 [ + + ]: 6049 : if (!MoneyRange(coin.out.nValue)) {
5919 [ + - ]: 2 : return util::Error{Untranslated(strprintf("Bad snapshot data after deserializing %d coins - bad tx out value",
5920 [ + - ]: 2 : coins_count - coins_left))};
5921 : : }
5922 [ + - ]: 6048 : coins_cache.EmplaceCoinInternalDANGER(std::move(outpoint), std::move(coin));
5923 : :
5924 : 6048 : --coins_left;
5925 : 6048 : ++coins_processed;
5926 : :
5927 [ - + ]: 6048 : if (coins_processed % 1000000 == 0) {
5928 [ # # # # ]: 0 : LogInfo("[snapshot] %d coins loaded (%.2f%%, %.2f MB)",
5929 : : coins_processed,
5930 : : static_cast<float>(coins_processed) * 100 / static_cast<float>(coins_count),
5931 : : coins_cache.DynamicMemoryUsage() / (1000 * 1000));
5932 : : }
5933 : :
5934 : : // Batch write and flush (if we need to) every so often.
5935 : : //
5936 : : // If our average Coin size is roughly 41 bytes, checking every 120,000 coins
5937 : : // means <5MB of memory imprecision.
5938 [ - + ]: 6048 : if (coins_processed % 120000 == 0) {
5939 [ # # # # ]: 0 : if (m_interrupt) {
5940 [ # # # # ]: 0 : return util::Error{Untranslated("Aborting after an interrupt was requested")};
5941 : : }
5942 : :
5943 [ # # # # : 0 : const auto snapshot_cache_state = WITH_LOCK(::cs_main,
# # ]
5944 : : return snapshot_chainstate.GetCoinsCacheSizeState());
5945 : :
5946 [ # # ]: 0 : if (snapshot_cache_state >= CoinsCacheSizeState::CRITICAL) {
5947 : : // This is a hack - we don't know what the actual best block is, but that
5948 : : // doesn't matter for the purposes of flushing the cache here. We'll set this
5949 : : // to its correct value (`base_blockhash`) below after the coins are loaded.
5950 [ # # ]: 0 : coins_cache.SetBestBlock(GetRandHash());
5951 : :
5952 : : // No need to acquire cs_main since this chainstate isn't being used yet.
5953 [ # # ]: 0 : FlushSnapshotToDisk(coins_cache, /*snapshot_loaded=*/false);
5954 : : }
5955 : : }
5956 : 6051 : }
5957 [ - + ]: 6 : } catch (const std::ios_base::failure&) {
5958 [ + - + - ]: 12 : return util::Error{Untranslated(strprintf("Bad snapshot format or truncated snapshot after deserializing %d coins",
5959 : 6 : coins_processed))};
5960 : 6 : }
5961 : : }
5962 : :
5963 : : // Important that we set this. This and the coins_cache accesses above are
5964 : : // sort of a layer violation, but either we reach into the innards of
5965 : : // CCoinsViewCache here or we have to invert some of the Chainstate to
5966 : : // embed them in a snapshot-activation-specific CCoinsViewCache bulk load
5967 : : // method.
5968 : 26 : coins_cache.SetBestBlock(base_blockhash);
5969 : :
5970 : 26 : bool out_of_coins{false};
5971 : 26 : try {
5972 : 26 : std::byte left_over_byte;
5973 [ + + ]: 26 : coins_file >> left_over_byte;
5974 [ - + ]: 21 : } catch (const std::ios_base::failure&) {
5975 : : // We expect an exception since we should be out of coins.
5976 : 21 : out_of_coins = true;
5977 : 21 : }
5978 : 26 : if (!out_of_coins) {
5979 [ + - ]: 10 : return util::Error{Untranslated(strprintf("Bad snapshot - coins left over after deserializing %d coins",
5980 : 5 : coins_count))};
5981 : : }
5982 : :
5983 [ + - + - ]: 21 : LogInfo("[snapshot] loaded %d (%.2f MB) coins from snapshot %s",
5984 : : coins_count,
5985 : : coins_cache.DynamicMemoryUsage() / (1000 * 1000),
5986 : : base_blockhash.ToString());
5987 : :
5988 : : // No need to acquire cs_main since this chainstate isn't being used yet.
5989 : 21 : FlushSnapshotToDisk(coins_cache, /*snapshot_loaded=*/true);
5990 : :
5991 [ - + ]: 21 : assert(coins_cache.GetBestBlock() == base_blockhash);
5992 : :
5993 : : // As above, okay to immediately release cs_main here since no other context knows
5994 : : // about the snapshot_chainstate.
5995 [ + - + - ]: 63 : CCoinsViewDB* snapshot_coinsdb = WITH_LOCK(::cs_main, return &snapshot_chainstate.CoinsDB());
5996 : :
5997 : 21 : std::optional<CCoinsStats> maybe_stats;
5998 : :
5999 : 21 : try {
6000 : 21 : maybe_stats = ComputeUTXOStats(
6001 [ + - ]: 4595 : CoinStatsHashType::HASH_SERIALIZED, snapshot_coinsdb, m_blockman, [&interrupt = m_interrupt] { SnapshotUTXOHashBreakpoint(interrupt); });
6002 [ - - ]: 0 : } catch (StopHashingException const&) {
6003 [ - - - - ]: 0 : return util::Error{Untranslated("Aborting after an interrupt was requested")};
6004 : 0 : }
6005 [ - + ]: 21 : if (!maybe_stats.has_value()) {
6006 [ - - ]: 0 : return util::Error{Untranslated("Failed to generate coins stats")};
6007 : : }
6008 : :
6009 : : // Assert that the deserialized chainstate contents match the expected assumeutxo value.
6010 [ + + ]: 21 : if (AssumeutxoHash{maybe_stats->hashSerialized} != au_data.hash_serialized) {
6011 [ + - ]: 24 : return util::Error{Untranslated(strprintf("Bad snapshot content hash: expected %s, got %s",
6012 [ + - + - ]: 24 : au_data.hash_serialized.ToString(), maybe_stats->hashSerialized.ToString()))};
6013 : : }
6014 : :
6015 : 13 : snapshot_chainstate.m_chain.SetTip(*snapshot_start_block);
6016 : :
6017 : : // The remainder of this function requires modifying data protected by cs_main.
6018 : 13 : LOCK(::cs_main);
6019 : :
6020 : : // Fake various pieces of CBlockIndex state:
6021 : 13 : CBlockIndex* index = nullptr;
6022 : :
6023 : : // Don't make any modifications to the genesis block since it shouldn't be
6024 : : // necessary, and since the genesis block doesn't have normal flags like
6025 : : // BLOCK_VALID_SCRIPTS set.
6026 : 13 : constexpr int AFTER_GENESIS_START{1};
6027 : :
6028 [ - + + + ]: 2955 : for (int i = AFTER_GENESIS_START; i <= snapshot_chainstate.m_chain.Height(); ++i) {
6029 [ + - ]: 2942 : index = snapshot_chainstate.m_chain[i];
6030 : :
6031 : : // Fake BLOCK_OPT_WITNESS so that Chainstate::NeedsRedownload()
6032 : : // won't ask for -reindex on startup.
6033 [ + - ]: 2942 : if (DeploymentActiveAt(*index, *this, Consensus::DEPLOYMENT_SEGWIT)) {
6034 : 2942 : index->nStatus |= BLOCK_OPT_WITNESS;
6035 : : }
6036 : :
6037 [ + - ]: 2942 : m_blockman.m_dirty_blockindex.insert(index);
6038 : : // Changes to the block index will be flushed to disk after this call
6039 : : // returns in `ActivateSnapshot()`, when `MaybeRebalanceCaches()` is
6040 : : // called, since we've added a snapshot chainstate and therefore will
6041 : : // have to downsize the IBD chainstate, which will result in a call to
6042 : : // `FlushStateToDisk(ALWAYS)`.
6043 : : }
6044 : :
6045 [ - + ]: 13 : assert(index);
6046 [ - + ]: 13 : assert(index == snapshot_start_block);
6047 : 13 : index->m_chain_tx_count = au_data.m_chain_tx_count;
6048 [ + - ]: 13 : snapshot_chainstate.setBlockIndexCandidates.insert(snapshot_start_block);
6049 : :
6050 [ + - + - ]: 13 : LogInfo("[snapshot] validated snapshot (%.2f MB)",
6051 : : coins_cache.DynamicMemoryUsage() / (1000 * 1000));
6052 [ + - ]: 13 : return {};
6053 : 13 : }
6054 : :
6055 : : // Currently, this function holds cs_main for its duration, which could be for
6056 : : // multiple minutes due to the ComputeUTXOStats call. This hold is necessary
6057 : : // because we need to avoid advancing the background validation chainstate
6058 : : // farther than the snapshot base block - and this function is also invoked
6059 : : // from within ConnectTip, i.e. from within ActivateBestChain, so cs_main is
6060 : : // held anyway.
6061 : : //
6062 : : // Eventually (TODO), we could somehow separate this function's runtime from
6063 : : // maintenance of the active chain, but that will either require
6064 : : //
6065 : : // (i) setting `m_disabled` immediately and ensuring all chainstate accesses go
6066 : : // through IsUsable() checks, or
6067 : : //
6068 : : // (ii) giving each chainstate its own lock instead of using cs_main for everything.
6069 : 1987 : SnapshotCompletionResult ChainstateManager::MaybeCompleteSnapshotValidation()
6070 : : {
6071 : 1987 : AssertLockHeld(cs_main);
6072 : 1987 : if (m_ibd_chainstate.get() == &this->ActiveChainstate() ||
6073 [ + - ]: 813 : !this->IsUsable(m_snapshot_chainstate.get()) ||
6074 [ + + + - ]: 2800 : !this->IsUsable(m_ibd_chainstate.get()) ||
6075 [ - + + - ]: 3611 : !m_ibd_chainstate->m_chain.Tip()) {
6076 : : // Nothing to do - this function only applies to the background
6077 : : // validation chainstate.
6078 : : return SnapshotCompletionResult::SKIPPED;
6079 : : }
6080 : 812 : const int snapshot_tip_height = this->ActiveHeight();
6081 [ - + ]: 812 : const int snapshot_base_height = *Assert(this->GetSnapshotBaseHeight());
6082 [ - + ]: 1624 : const CBlockIndex& index_new = *Assert(m_ibd_chainstate->m_chain.Tip());
6083 : :
6084 [ + + ]: 812 : if (index_new.nHeight < snapshot_base_height) {
6085 : : // Background IBD not complete yet.
6086 : : return SnapshotCompletionResult::SKIPPED;
6087 : : }
6088 : :
6089 [ - + ]: 12 : assert(SnapshotBlockhash());
6090 : 12 : uint256 snapshot_blockhash = *Assert(SnapshotBlockhash());
6091 : :
6092 : 13 : auto handle_invalid_snapshot = [&]() EXCLUSIVE_LOCKS_REQUIRED(::cs_main) {
6093 : 1 : bilingual_str user_error = strprintf(_(
6094 : : "%s failed to validate the -assumeutxo snapshot state. "
6095 : : "This indicates a hardware problem, or a bug in the software, or a "
6096 : : "bad software modification that allowed an invalid snapshot to be "
6097 : : "loaded. As a result of this, the node will shut down and stop using any "
6098 : : "state that was built on the snapshot, resetting the chain height "
6099 : : "from %d to %d. On the next "
6100 : : "restart, the node will resume syncing from %d "
6101 : : "without using any snapshot data. "
6102 : : "Please report this incident to %s, including how you obtained the snapshot. "
6103 : : "The invalid snapshot chainstate will be left on disk in case it is "
6104 : : "helpful in diagnosing the issue that caused this error."),
6105 : : CLIENT_NAME, snapshot_tip_height, snapshot_base_height, snapshot_base_height, CLIENT_BUGREPORT
6106 : 1 : );
6107 : :
6108 [ + - ]: 1 : LogError("[snapshot] !!! %s\n", user_error.original);
6109 [ + - ]: 1 : LogError("[snapshot] deleting snapshot, reverting to validated chain, and stopping node\n");
6110 : :
6111 [ + - ]: 1 : m_active_chainstate = m_ibd_chainstate.get();
6112 [ + - ]: 1 : m_snapshot_chainstate->m_disabled = true;
6113 [ + - ]: 1 : assert(!this->IsUsable(m_snapshot_chainstate.get()));
6114 [ + - ]: 1 : assert(this->IsUsable(m_ibd_chainstate.get()));
6115 : :
6116 [ + - ]: 1 : auto rename_result = m_snapshot_chainstate->InvalidateCoinsDBOnDisk();
6117 [ - + ]: 1 : if (!rename_result) {
6118 [ # # # # : 0 : user_error += Untranslated("\n") + util::ErrorString(rename_result);
# # # # ]
6119 : : }
6120 : :
6121 [ + - ]: 1 : GetNotifications().fatalError(user_error);
6122 : 2 : };
6123 : :
6124 [ - + ]: 12 : if (index_new.GetBlockHash() != snapshot_blockhash) {
6125 [ # # # # ]: 0 : LogPrintf("[snapshot] supposed base block %s does not match the "
6126 : : "snapshot base block %s (height %d). Snapshot is not valid.\n",
6127 : : index_new.ToString(), snapshot_blockhash.ToString(), snapshot_base_height);
6128 : 0 : handle_invalid_snapshot();
6129 : 0 : return SnapshotCompletionResult::BASE_BLOCKHASH_MISMATCH;
6130 : : }
6131 : :
6132 [ - + ]: 12 : assert(index_new.nHeight == snapshot_base_height);
6133 : :
6134 [ - + ]: 12 : int curr_height = m_ibd_chainstate->m_chain.Height();
6135 : :
6136 [ - + ]: 12 : assert(snapshot_base_height == curr_height);
6137 : 12 : assert(snapshot_base_height == index_new.nHeight);
6138 [ + - ]: 12 : assert(this->IsUsable(m_snapshot_chainstate.get()));
6139 [ - + - + ]: 12 : assert(this->GetAll().size() == 2);
6140 : :
6141 : 12 : CCoinsViewDB& ibd_coins_db = m_ibd_chainstate->CoinsDB();
6142 : 12 : m_ibd_chainstate->ForceFlushStateToDisk();
6143 : :
6144 : 12 : const auto& maybe_au_data = m_options.chainparams.AssumeutxoForHeight(curr_height);
6145 [ - + ]: 12 : if (!maybe_au_data) {
6146 : 0 : LogPrintf("[snapshot] assumeutxo data not found for height "
6147 : : "(%d) - refusing to validate snapshot\n", curr_height);
6148 : 0 : handle_invalid_snapshot();
6149 : 0 : return SnapshotCompletionResult::MISSING_CHAINPARAMS;
6150 : : }
6151 : :
6152 : 12 : const AssumeutxoData& au_data = *maybe_au_data;
6153 : 12 : std::optional<CCoinsStats> maybe_ibd_stats;
6154 : 12 : LogInfo("[snapshot] computing UTXO stats for background chainstate to validate "
6155 : : "snapshot - this could take a few minutes");
6156 : 12 : try {
6157 : 12 : maybe_ibd_stats = ComputeUTXOStats(
6158 : : CoinStatsHashType::HASH_SERIALIZED,
6159 : : &ibd_coins_db,
6160 [ + - ]: 12 : m_blockman,
6161 [ + - ]: 2845 : [&interrupt = m_interrupt] { SnapshotUTXOHashBreakpoint(interrupt); });
6162 [ - - ]: 0 : } catch (StopHashingException const&) {
6163 : 0 : return SnapshotCompletionResult::STATS_FAILED;
6164 : 0 : }
6165 : :
6166 : : // XXX note that this function is slow and will hold cs_main for potentially minutes.
6167 [ - + ]: 12 : if (!maybe_ibd_stats) {
6168 : 0 : LogPrintf("[snapshot] failed to generate stats for validation coins db\n");
6169 : : // While this isn't a problem with the snapshot per se, this condition
6170 : : // prevents us from validating the snapshot, so we should shut down and let the
6171 : : // user handle the issue manually.
6172 : 0 : handle_invalid_snapshot();
6173 : 0 : return SnapshotCompletionResult::STATS_FAILED;
6174 : : }
6175 [ + + ]: 12 : const auto& ibd_stats = *maybe_ibd_stats;
6176 : :
6177 : : // Compare the background validation chainstate's UTXO set hash against the hard-coded
6178 : : // assumeutxo hash we expect.
6179 : : //
6180 : : // TODO: For belt-and-suspenders, we could cache the UTXO set
6181 : : // hash for the snapshot when it's loaded in its chainstate's leveldb. We could then
6182 : : // reference that here for an additional check.
6183 [ + + ]: 12 : if (AssumeutxoHash{ibd_stats.hashSerialized} != au_data.hash_serialized) {
6184 [ + - + - ]: 2 : LogPrintf("[snapshot] hash mismatch: actual=%s, expected=%s\n",
6185 : : ibd_stats.hashSerialized.ToString(),
6186 : : au_data.hash_serialized.ToString());
6187 : 1 : handle_invalid_snapshot();
6188 : 1 : return SnapshotCompletionResult::HASH_MISMATCH;
6189 : : }
6190 : :
6191 [ + - ]: 11 : LogInfo("[snapshot] snapshot beginning at %s has been fully validated",
6192 : : snapshot_blockhash.ToString());
6193 : :
6194 : 11 : m_ibd_chainstate->m_disabled = true;
6195 : 11 : this->MaybeRebalanceCaches();
6196 : :
6197 : 11 : return SnapshotCompletionResult::SUCCESS;
6198 : : }
6199 : :
6200 : 34577897 : Chainstate& ChainstateManager::ActiveChainstate() const
6201 : : {
6202 : 34577897 : LOCK(::cs_main);
6203 [ - + ]: 34577897 : assert(m_active_chainstate);
6204 [ + - ]: 34577897 : return *m_active_chainstate;
6205 : 34577897 : }
6206 : :
6207 : 72 : bool ChainstateManager::IsSnapshotActive() const
6208 : : {
6209 : 72 : LOCK(::cs_main);
6210 [ + + - + : 72 : return m_snapshot_chainstate && m_active_chainstate == m_snapshot_chainstate.get();
+ - ]
6211 : 72 : }
6212 : :
6213 : 1691 : void ChainstateManager::MaybeRebalanceCaches()
6214 : : {
6215 : 1691 : AssertLockHeld(::cs_main);
6216 [ + - ]: 1691 : bool ibd_usable = this->IsUsable(m_ibd_chainstate.get());
6217 [ + + ]: 1691 : bool snapshot_usable = this->IsUsable(m_snapshot_chainstate.get());
6218 [ - + ]: 1657 : assert(ibd_usable || snapshot_usable);
6219 : :
6220 [ + + ]: 1691 : if (ibd_usable && !snapshot_usable) {
6221 : : // Allocate everything to the IBD chainstate. This will always happen
6222 : : // when we are not using a snapshot.
6223 : 1657 : m_ibd_chainstate->ResizeCoinsCaches(m_total_coinstip_cache, m_total_coinsdb_cache);
6224 : : }
6225 [ + + ]: 34 : else if (snapshot_usable && !ibd_usable) {
6226 : : // If background validation has completed and snapshot is our active chain...
6227 : 11 : LogInfo("[snapshot] allocating all cache to the snapshot chainstate");
6228 : : // Allocate everything to the snapshot chainstate.
6229 : 11 : m_snapshot_chainstate->ResizeCoinsCaches(m_total_coinstip_cache, m_total_coinsdb_cache);
6230 : : }
6231 [ + - ]: 23 : else if (ibd_usable && snapshot_usable) {
6232 : : // If both chainstates exist, determine who needs more cache based on IBD status.
6233 : : //
6234 : : // Note: shrink caches first so that we don't inadvertently overwhelm available memory.
6235 [ + + ]: 23 : if (IsInitialBlockDownload()) {
6236 : 12 : m_ibd_chainstate->ResizeCoinsCaches(
6237 : 12 : m_total_coinstip_cache * 0.05, m_total_coinsdb_cache * 0.05);
6238 : 12 : m_snapshot_chainstate->ResizeCoinsCaches(
6239 : 12 : m_total_coinstip_cache * 0.95, m_total_coinsdb_cache * 0.95);
6240 : : } else {
6241 : 11 : m_snapshot_chainstate->ResizeCoinsCaches(
6242 : 11 : m_total_coinstip_cache * 0.05, m_total_coinsdb_cache * 0.05);
6243 : 11 : m_ibd_chainstate->ResizeCoinsCaches(
6244 : 11 : m_total_coinstip_cache * 0.95, m_total_coinsdb_cache * 0.95);
6245 : : }
6246 : : }
6247 : 1691 : }
6248 : :
6249 : 7 : void ChainstateManager::ResetChainstates()
6250 : : {
6251 [ + - ]: 7 : m_ibd_chainstate.reset();
6252 [ + + ]: 7 : m_snapshot_chainstate.reset();
6253 : 7 : m_active_chainstate = nullptr;
6254 : 7 : }
6255 : :
6256 : : /**
6257 : : * Apply default chain params to nullopt members.
6258 : : * This helps to avoid coding errors around the accidental use of the compare
6259 : : * operators that accept nullopt, thus ignoring the intended default value.
6260 : : */
6261 : 1206 : static ChainstateManager::Options&& Flatten(ChainstateManager::Options&& opts)
6262 : : {
6263 [ + + ]: 1206 : if (!opts.check_block_index.has_value()) opts.check_block_index = opts.chainparams.DefaultConsistencyChecks();
6264 [ + + - + ]: 1206 : if (!opts.minimum_chain_work.has_value()) opts.minimum_chain_work = UintToArith256(opts.chainparams.GetConsensus().nMinimumChainWork);
6265 [ + + ]: 1206 : if (!opts.assumed_valid_block.has_value()) opts.assumed_valid_block = opts.chainparams.GetConsensus().defaultAssumeValid;
6266 : 1206 : return std::move(opts);
6267 : : }
6268 : :
6269 : 1206 : ChainstateManager::ChainstateManager(const util::SignalInterrupt& interrupt, Options options, node::BlockManager::Options blockman_options)
6270 [ + - + - ]: 2412 : : m_script_check_queue{/*batch_size=*/128, std::clamp(options.worker_threads_num, 0, MAX_SCRIPTCHECK_THREADS)},
6271 : 1206 : m_interrupt{interrupt},
6272 [ + - ]: 1208 : m_options{Flatten(std::move(options))},
6273 [ + - + + ]: 1206 : m_blockman{interrupt, std::move(blockman_options)},
6274 [ + - + - : 4820 : m_validation_cache{m_options.script_execution_cache_bytes, m_options.signature_cache_bytes}
+ - ]
6275 : : {
6276 : 1210 : }
6277 : :
6278 : 1204 : ChainstateManager::~ChainstateManager()
6279 : : {
6280 : 1204 : LOCK(::cs_main);
6281 : :
6282 [ + - ]: 1204 : m_versionbitscache.Clear();
6283 : 4816 : }
6284 : :
6285 : 1195 : bool ChainstateManager::DetectSnapshotChainstate()
6286 : : {
6287 [ - + ]: 1195 : assert(!m_snapshot_chainstate);
6288 : 1195 : std::optional<fs::path> path = node::FindSnapshotChainstateDir(m_options.datadir);
6289 [ + + ]: 1195 : if (!path) {
6290 : : return false;
6291 : : }
6292 [ + - + - ]: 12 : std::optional<uint256> base_blockhash = node::ReadSnapshotBaseBlockhash(*path);
6293 [ + - ]: 12 : if (!base_blockhash) {
6294 : : return false;
6295 : : }
6296 [ - + + - ]: 24 : LogInfo("[snapshot] detected active snapshot chainstate (%s) - loading",
6297 : : fs::PathToString(*path));
6298 : :
6299 [ + - ]: 12 : this->ActivateExistingSnapshot(*base_blockhash);
6300 : : return true;
6301 : 1195 : }
6302 : :
6303 : 15 : Chainstate& ChainstateManager::ActivateExistingSnapshot(uint256 base_blockhash)
6304 : : {
6305 [ - + ]: 15 : assert(!m_snapshot_chainstate);
6306 : 15 : m_snapshot_chainstate =
6307 : 15 : std::make_unique<Chainstate>(nullptr, m_blockman, *this, base_blockhash);
6308 [ + - ]: 15 : LogInfo("[snapshot] switching active chainstate to %s", m_snapshot_chainstate->ToString());
6309 : :
6310 : : // Mempool is empty at this point because we're still in IBD.
6311 : 15 : Assert(m_active_chainstate->m_mempool->size() == 0);
6312 : 15 : Assert(!m_snapshot_chainstate->m_mempool);
6313 : 15 : m_snapshot_chainstate->m_mempool = m_active_chainstate->m_mempool;
6314 : 15 : m_active_chainstate->m_mempool = nullptr;
6315 : 15 : m_active_chainstate = m_snapshot_chainstate.get();
6316 : 15 : return *m_snapshot_chainstate;
6317 : : }
6318 : :
6319 : 180472 : bool IsBIP30Repeat(const CBlockIndex& block_index)
6320 : : {
6321 [ - + - - ]: 180472 : return (block_index.nHeight==91842 && block_index.GetBlockHash() == uint256{"00000000000a4d0a398161ffc163c503763b1f4360639393e0e4c8e300e0caec"}) ||
6322 [ - + - - ]: 180472 : (block_index.nHeight==91880 && block_index.GetBlockHash() == uint256{"00000000000743f190a18c5577a3c2d2a1f610ae9601ac046a38084ccb7cd721"});
6323 : : }
6324 : :
6325 : 11667 : bool IsBIP30Unspendable(const uint256& block_hash, int block_height)
6326 : : {
6327 [ - + - - : 11667 : return (block_height==91722 && block_hash == uint256{"00000000000271a2dc26e7667f8419f2e15416dc6955e5a6c6cdf3f2574dd08e"}) ||
- + ]
6328 [ # # ]: 0 : (block_height==91812 && block_hash == uint256{"00000000000af0aed4792b1acee3d966af36cf5def14935db8de83d6f9306f2f"});
6329 : : }
6330 : :
6331 : 1 : static fs::path GetSnapshotCoinsDBPath(Chainstate& cs) EXCLUSIVE_LOCKS_REQUIRED(::cs_main)
6332 : : {
6333 : 1 : AssertLockHeld(::cs_main);
6334 : : // Should never be called on a non-snapshot chainstate.
6335 [ - + ]: 1 : assert(cs.m_from_snapshot_blockhash);
6336 : 1 : auto storage_path_maybe = cs.CoinsDB().StoragePath();
6337 : : // Should never be called with a non-existent storage path.
6338 [ - + ]: 1 : assert(storage_path_maybe);
6339 [ + - + - ]: 1 : return *storage_path_maybe;
6340 : 1 : }
6341 : :
6342 : 1 : util::Result<void> Chainstate::InvalidateCoinsDBOnDisk()
6343 : : {
6344 : 1 : fs::path snapshot_datadir = GetSnapshotCoinsDBPath(*this);
6345 : :
6346 : : // Coins views no longer usable.
6347 [ + - ]: 1 : m_coins_views.reset();
6348 : :
6349 [ + - + - ]: 2 : auto invalid_path = snapshot_datadir + "_INVALID";
6350 [ - + ]: 1 : std::string dbpath = fs::PathToString(snapshot_datadir);
6351 [ - + ]: 1 : std::string target = fs::PathToString(invalid_path);
6352 [ + - ]: 1 : LogInfo("[snapshot] renaming snapshot datadir %s to %s", dbpath, target);
6353 : :
6354 : : // The invalid snapshot datadir is simply moved and not deleted because we may
6355 : : // want to do forensics later during issue investigation. The user is instructed
6356 : : // accordingly in MaybeCompleteSnapshotValidation().
6357 : 1 : try {
6358 [ + - ]: 1 : fs::rename(snapshot_datadir, invalid_path);
6359 [ - - ]: 0 : } catch (const fs::filesystem_error& e) {
6360 [ - - ]: 0 : auto src_str = fs::PathToString(snapshot_datadir);
6361 [ - - ]: 0 : auto dest_str = fs::PathToString(invalid_path);
6362 : :
6363 [ - - ]: 0 : LogPrintf("%s: error renaming file '%s' -> '%s': %s\n",
6364 : : __func__, src_str, dest_str, e.what());
6365 [ - - ]: 0 : return util::Error{strprintf(_(
6366 : : "Rename of '%s' -> '%s' failed. "
6367 : : "You should resolve this by manually moving or deleting the invalid "
6368 : : "snapshot directory %s, otherwise you will encounter the same error again "
6369 : : "on the next startup."),
6370 : 0 : src_str, dest_str, src_str)};
6371 [ - - ]: 0 : }
6372 : 1 : return {};
6373 : 3 : }
6374 : :
6375 : 2 : bool ChainstateManager::DeleteSnapshotChainstate()
6376 : : {
6377 : 2 : AssertLockHeld(::cs_main);
6378 : 2 : Assert(m_snapshot_chainstate);
6379 : 2 : Assert(m_ibd_chainstate);
6380 : :
6381 [ + - + - : 2 : fs::path snapshot_datadir = Assert(node::FindSnapshotChainstateDir(m_options.datadir)).value();
+ - ]
6382 [ + - + - : 4 : if (!DeleteCoinsDBFromDisk(snapshot_datadir, /*is_snapshot=*/ true)) {
- + ]
6383 [ # # # # ]: 0 : LogPrintf("Deletion of %s failed. Please remove it manually to continue reindexing.\n",
6384 : : fs::PathToString(snapshot_datadir));
6385 : 0 : return false;
6386 : : }
6387 [ + - ]: 2 : m_active_chainstate = m_ibd_chainstate.get();
6388 [ + - ]: 2 : m_active_chainstate->m_mempool = m_snapshot_chainstate->m_mempool;
6389 [ + - ]: 4 : m_snapshot_chainstate.reset();
6390 : : return true;
6391 : 2 : }
6392 : :
6393 : 236607 : ChainstateRole Chainstate::GetRole() const
6394 : : {
6395 [ - + + + ]: 236607 : if (m_chainman.GetAll().size() <= 1) {
6396 : : return ChainstateRole::NORMAL;
6397 : : }
6398 [ + + ]: 2507 : return (this != &m_chainman.ActiveChainstate()) ?
6399 : : ChainstateRole::BACKGROUND :
6400 : : ChainstateRole::ASSUMEDVALID;
6401 : : }
6402 : :
6403 : 682121 : const CBlockIndex* ChainstateManager::GetSnapshotBaseBlock() const
6404 : : {
6405 [ + - ]: 682121 : return m_active_chainstate ? m_active_chainstate->SnapshotBase() : nullptr;
6406 : : }
6407 : :
6408 : 832 : std::optional<int> ChainstateManager::GetSnapshotBaseHeight() const
6409 : : {
6410 : 832 : const CBlockIndex* base = this->GetSnapshotBaseBlock();
6411 [ + - ]: 832 : return base ? std::make_optional(base->nHeight) : std::nullopt;
6412 : : }
6413 : :
6414 : 2696 : void ChainstateManager::RecalculateBestHeader()
6415 : : {
6416 : 2696 : AssertLockHeld(cs_main);
6417 [ - + ]: 2696 : m_best_header = ActiveChain().Tip();
6418 [ + + + + ]: 5204612 : for (auto& entry : m_blockman.m_block_index) {
6419 [ + + + + ]: 5201916 : if (!(entry.second.nStatus & BLOCK_FAILED_MASK) && m_best_header->nChainWork < entry.second.nChainWork) {
6420 : 69 : m_best_header = &entry.second;
6421 : : }
6422 : : }
6423 : 2696 : }
6424 : :
6425 : 3 : bool ChainstateManager::ValidatedSnapshotCleanup()
6426 : : {
6427 : 3 : AssertLockHeld(::cs_main);
6428 [ + - ]: 6 : auto get_storage_path = [](auto& chainstate) EXCLUSIVE_LOCKS_REQUIRED(::cs_main) -> std::optional<fs::path> {
6429 [ + - - + ]: 6 : if (!(chainstate && chainstate->HasCoinsViews())) {
6430 : 0 : return {};
6431 : : }
6432 : 6 : return chainstate->CoinsDB().StoragePath();
6433 : : };
6434 : 3 : std::optional<fs::path> ibd_chainstate_path_maybe = get_storage_path(m_ibd_chainstate);
6435 [ + - ]: 3 : std::optional<fs::path> snapshot_chainstate_path_maybe = get_storage_path(m_snapshot_chainstate);
6436 : :
6437 [ + - + - ]: 6 : if (!this->IsSnapshotValidated()) {
6438 : : // No need to clean up.
6439 : : return false;
6440 : : }
6441 : : // If either path doesn't exist, that means at least one of the chainstates
6442 : : // is in-memory, in which case we can't do on-disk cleanup. You'd better be
6443 : : // in a unittest!
6444 [ + - + - ]: 3 : if (!ibd_chainstate_path_maybe || !snapshot_chainstate_path_maybe) {
6445 [ # # ]: 0 : LogPrintf("[snapshot] snapshot chainstate cleanup cannot happen with "
6446 : : "in-memory chainstates. You are testing, right?\n");
6447 : : return false;
6448 : : }
6449 : :
6450 [ + - ]: 3 : const auto& snapshot_chainstate_path = *snapshot_chainstate_path_maybe;
6451 : 3 : const auto& ibd_chainstate_path = *ibd_chainstate_path_maybe;
6452 : :
6453 : : // Since we're going to be moving around the underlying leveldb filesystem content
6454 : : // for each chainstate, make sure that the chainstates (and their constituent
6455 : : // CoinsViews members) have been destructed first.
6456 : : //
6457 : : // The caller of this method will be responsible for reinitializing chainstates
6458 : : // if they want to continue operation.
6459 [ + - ]: 3 : this->ResetChainstates();
6460 : :
6461 : : // No chainstates should be considered usable.
6462 [ + - - + ]: 6 : assert(this->GetAll().size() == 0);
6463 : :
6464 [ - + + - ]: 6 : LogInfo("[snapshot] deleting background chainstate directory (now unnecessary) (%s)",
6465 : : fs::PathToString(ibd_chainstate_path));
6466 : :
6467 [ + - + - ]: 6 : fs::path tmp_old{ibd_chainstate_path + "_todelete"};
6468 : :
6469 : 3 : auto rename_failed_abort = [this](
6470 : : fs::path p_old,
6471 : : fs::path p_new,
6472 : : const fs::filesystem_error& err) {
6473 [ # # # # : 0 : LogError("[snapshot] Error renaming path (%s) -> (%s): %s\n",
# # ]
6474 : : fs::PathToString(p_old), fs::PathToString(p_new), err.what());
6475 [ # # # # ]: 0 : GetNotifications().fatalError(strprintf(_(
6476 : : "Rename of '%s' -> '%s' failed. "
6477 : : "Cannot clean up the background chainstate leveldb directory."),
6478 [ # # # # ]: 0 : fs::PathToString(p_old), fs::PathToString(p_new)));
6479 : 0 : };
6480 : :
6481 : 3 : try {
6482 [ + - ]: 3 : fs::rename(ibd_chainstate_path, tmp_old);
6483 [ - - ]: 0 : } catch (const fs::filesystem_error& e) {
6484 [ - - - - : 0 : rename_failed_abort(ibd_chainstate_path, tmp_old, e);
- - ]
6485 : 0 : throw;
6486 : 0 : }
6487 : :
6488 [ - + - + : 12 : LogInfo("[snapshot] moving snapshot chainstate (%s) to "
+ - ]
6489 : : "default chainstate directory (%s)",
6490 : : fs::PathToString(snapshot_chainstate_path), fs::PathToString(ibd_chainstate_path));
6491 : :
6492 : 3 : try {
6493 [ + - ]: 3 : fs::rename(snapshot_chainstate_path, ibd_chainstate_path);
6494 [ - - ]: 0 : } catch (const fs::filesystem_error& e) {
6495 [ - - - - : 0 : rename_failed_abort(snapshot_chainstate_path, ibd_chainstate_path, e);
- - ]
6496 : 0 : throw;
6497 : 0 : }
6498 : :
6499 [ + - + - : 6 : if (!DeleteCoinsDBFromDisk(tmp_old, /*is_snapshot=*/false)) {
- + ]
6500 : : // No need to FatalError because once the unneeded bg chainstate data is
6501 : : // moved, it will not interfere with subsequent initialization.
6502 [ # # # # ]: 0 : LogPrintf("Deletion of %s failed. Please remove it manually, as the "
6503 : : "directory is now unnecessary.\n",
6504 : : fs::PathToString(tmp_old));
6505 : : } else {
6506 [ - + + - ]: 9 : LogInfo("[snapshot] deleted background chainstate directory (%s)",
6507 : : fs::PathToString(ibd_chainstate_path));
6508 : : }
6509 : 3 : return true;
6510 [ + - ]: 9 : }
6511 : :
6512 : 1131 : Chainstate& ChainstateManager::GetChainstateForIndexing()
6513 : : {
6514 : : // We can't always return `m_ibd_chainstate` because after background validation
6515 : : // has completed, `m_snapshot_chainstate == m_active_chainstate`, but it can be
6516 : : // indexed.
6517 [ - + + + ]: 1131 : return (this->GetAll().size() > 1) ? *m_ibd_chainstate : *m_active_chainstate;
6518 : : }
6519 : :
6520 : 490 : std::pair<int, int> ChainstateManager::GetPruneRange(const Chainstate& chainstate, int last_height_can_prune)
6521 : : {
6522 [ - + - + ]: 490 : if (chainstate.m_chain.Height() <= 0) {
6523 : 0 : return {0, 0};
6524 : : }
6525 : 490 : int prune_start{0};
6526 : :
6527 [ - + + + : 980 : if (this->GetAll().size() > 1 && m_snapshot_chainstate.get() == &chainstate) {
+ + + + ]
6528 : : // Leave the blocks in the background IBD chain alone if we're pruning
6529 : : // the snapshot chain.
6530 : 7 : prune_start = *Assert(GetSnapshotBaseHeight()) + 1;
6531 : : }
6532 : :
6533 : 980 : int max_prune = std::max<int>(
6534 [ - + + + ]: 490 : 0, chainstate.m_chain.Height() - static_cast<int>(MIN_BLOCKS_TO_KEEP));
6535 : :
6536 : : // last block to prune is the lesser of (caller-specified height, MIN_BLOCKS_TO_KEEP from the tip)
6537 : : //
6538 : : // While you might be tempted to prune the background chainstate more
6539 : : // aggressively (i.e. fewer MIN_BLOCKS_TO_KEEP), this won't work with index
6540 : : // building - specifically blockfilterindex requires undo data, and if
6541 : : // we don't maintain this trailing window, we hit indexing failures.
6542 [ + + ]: 490 : int prune_end = std::min(last_height_can_prune, max_prune);
6543 : :
6544 : 490 : return {prune_start, prune_end};
6545 : : }
|
