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