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