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