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