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