1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2009-2016 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.
6 #include "validation.h"
8 #include "arith_uint256.h"
10 #include "chainparams.h"
11 #include "checkpoints.h"
12 #include "checkqueue.h"
13 #include "consensus/consensus.h"
14 #include "consensus/merkle.h"
15 #include "consensus/tx_verify.h"
16 #include "consensus/validation.h"
17 #include "cuckoocache.h"
21 #include "policy/fees.h"
22 #include "policy/policy.h"
23 #include "policy/rbf.h"
25 #include "primitives/block.h"
26 #include "primitives/transaction.h"
28 #include "reverse_iterator.h"
29 #include "script/script.h"
30 #include "script/sigcache.h"
31 #include "script/standard.h"
33 #include "tinyformat.h"
35 #include "txmempool.h"
36 #include "ui_interface.h"
39 #include "utilmoneystr.h"
40 #include "utilstrencodings.h"
41 #include "validationinterface.h"
42 #include "versionbits.h"
48 #include <boost/algorithm/string/replace.hpp>
49 #include <boost/algorithm/string/join.hpp>
50 #include <boost/thread.hpp>
53 # error "Bitcoin cannot be compiled without assertions."
56 #define MICRO 0.000001
63 CCriticalSection cs_main
;
65 BlockMap mapBlockIndex
;
67 CBlockIndex
*pindexBestHeader
= nullptr;
68 CWaitableCriticalSection csBestBlock
;
69 CConditionVariable cvBlockChange
;
70 int nScriptCheckThreads
= 0;
71 std::atomic_bool
fImporting(false);
72 bool fReindex
= false;
73 bool fTxIndex
= false;
74 bool fHavePruned
= false;
75 bool fPruneMode
= false;
76 bool fIsBareMultisigStd
= DEFAULT_PERMIT_BAREMULTISIG
;
77 bool fRequireStandard
= true;
78 bool fCheckBlockIndex
= false;
79 bool fCheckpointsEnabled
= DEFAULT_CHECKPOINTS_ENABLED
;
80 size_t nCoinCacheUsage
= 5000 * 300;
81 uint64_t nPruneTarget
= 0;
82 int64_t nMaxTipAge
= DEFAULT_MAX_TIP_AGE
;
83 bool fEnableReplacement
= DEFAULT_ENABLE_REPLACEMENT
;
85 uint256 hashAssumeValid
;
86 arith_uint256 nMinimumChainWork
;
88 CFeeRate minRelayTxFee
= CFeeRate(DEFAULT_MIN_RELAY_TX_FEE
);
89 CAmount maxTxFee
= DEFAULT_TRANSACTION_MAXFEE
;
91 CBlockPolicyEstimator feeEstimator
;
92 CTxMemPool
mempool(&feeEstimator
);
94 static void CheckBlockIndex(const Consensus::Params
& consensusParams
);
96 /** Constant stuff for coinbase transactions we create: */
97 CScript COINBASE_FLAGS
;
99 const std::string strMessageMagic
= "Bitcoin Signed Message:\n";
104 struct CBlockIndexWorkComparator
106 bool operator()(const CBlockIndex
*pa
, const CBlockIndex
*pb
) const {
107 // First sort by most total work, ...
108 if (pa
->nChainWork
> pb
->nChainWork
) return false;
109 if (pa
->nChainWork
< pb
->nChainWork
) return true;
111 // ... then by earliest time received, ...
112 if (pa
->nSequenceId
< pb
->nSequenceId
) return false;
113 if (pa
->nSequenceId
> pb
->nSequenceId
) return true;
115 // Use pointer address as tie breaker (should only happen with blocks
116 // loaded from disk, as those all have id 0).
117 if (pa
< pb
) return false;
118 if (pa
> pb
) return true;
125 CBlockIndex
*pindexBestInvalid
;
128 * The set of all CBlockIndex entries with BLOCK_VALID_TRANSACTIONS (for itself and all ancestors) and
129 * as good as our current tip or better. Entries may be failed, though, and pruning nodes may be
130 * missing the data for the block.
132 std::set
<CBlockIndex
*, CBlockIndexWorkComparator
> setBlockIndexCandidates
;
133 /** All pairs A->B, where A (or one of its ancestors) misses transactions, but B has transactions.
134 * Pruned nodes may have entries where B is missing data.
136 std::multimap
<CBlockIndex
*, CBlockIndex
*> mapBlocksUnlinked
;
138 CCriticalSection cs_LastBlockFile
;
139 std::vector
<CBlockFileInfo
> vinfoBlockFile
;
140 int nLastBlockFile
= 0;
141 /** Global flag to indicate we should check to see if there are
142 * block/undo files that should be deleted. Set on startup
143 * or if we allocate more file space when we're in prune mode
145 bool fCheckForPruning
= false;
148 * Every received block is assigned a unique and increasing identifier, so we
149 * know which one to give priority in case of a fork.
151 CCriticalSection cs_nBlockSequenceId
;
152 /** Blocks loaded from disk are assigned id 0, so start the counter at 1. */
153 int32_t nBlockSequenceId
= 1;
154 /** Decreasing counter (used by subsequent preciousblock calls). */
155 int32_t nBlockReverseSequenceId
= -1;
156 /** chainwork for the last block that preciousblock has been applied to. */
157 arith_uint256 nLastPreciousChainwork
= 0;
159 /** Dirty block index entries. */
160 std::set
<CBlockIndex
*> setDirtyBlockIndex
;
162 /** Dirty block file entries. */
163 std::set
<int> setDirtyFileInfo
;
166 CBlockIndex
* FindForkInGlobalIndex(const CChain
& chain
, const CBlockLocator
& locator
)
168 // Find the first block the caller has in the main chain
169 for (const uint256
& hash
: locator
.vHave
) {
170 BlockMap::iterator mi
= mapBlockIndex
.find(hash
);
171 if (mi
!= mapBlockIndex
.end())
173 CBlockIndex
* pindex
= (*mi
).second
;
174 if (chain
.Contains(pindex
))
176 if (pindex
->GetAncestor(chain
.Height()) == chain
.Tip()) {
181 return chain
.Genesis();
184 CCoinsViewDB
*pcoinsdbview
= nullptr;
185 CCoinsViewCache
*pcoinsTip
= nullptr;
186 CBlockTreeDB
*pblocktree
= nullptr;
188 enum FlushStateMode
{
190 FLUSH_STATE_IF_NEEDED
,
191 FLUSH_STATE_PERIODIC
,
195 // See definition for documentation
196 static bool FlushStateToDisk(const CChainParams
& chainParams
, CValidationState
&state
, FlushStateMode mode
, int nManualPruneHeight
=0);
197 static void FindFilesToPruneManual(std::set
<int>& setFilesToPrune
, int nManualPruneHeight
);
198 static void FindFilesToPrune(std::set
<int>& setFilesToPrune
, uint64_t nPruneAfterHeight
);
199 bool CheckInputs(const CTransaction
& tx
, CValidationState
&state
, const CCoinsViewCache
&inputs
, bool fScriptChecks
, unsigned int flags
, bool cacheSigStore
, bool cacheFullScriptStore
, PrecomputedTransactionData
& txdata
, std::vector
<CScriptCheck
> *pvChecks
= nullptr);
200 static FILE* OpenUndoFile(const CDiskBlockPos
&pos
, bool fReadOnly
= false);
202 bool CheckFinalTx(const CTransaction
&tx
, int flags
)
204 AssertLockHeld(cs_main
);
206 // By convention a negative value for flags indicates that the
207 // current network-enforced consensus rules should be used. In
208 // a future soft-fork scenario that would mean checking which
209 // rules would be enforced for the next block and setting the
210 // appropriate flags. At the present time no soft-forks are
211 // scheduled, so no flags are set.
212 flags
= std::max(flags
, 0);
214 // CheckFinalTx() uses chainActive.Height()+1 to evaluate
215 // nLockTime because when IsFinalTx() is called within
216 // CBlock::AcceptBlock(), the height of the block *being*
217 // evaluated is what is used. Thus if we want to know if a
218 // transaction can be part of the *next* block, we need to call
219 // IsFinalTx() with one more than chainActive.Height().
220 const int nBlockHeight
= chainActive
.Height() + 1;
222 // BIP113 will require that time-locked transactions have nLockTime set to
223 // less than the median time of the previous block they're contained in.
224 // When the next block is created its previous block will be the current
225 // chain tip, so we use that to calculate the median time passed to
226 // IsFinalTx() if LOCKTIME_MEDIAN_TIME_PAST is set.
227 const int64_t nBlockTime
= (flags
& LOCKTIME_MEDIAN_TIME_PAST
)
228 ? chainActive
.Tip()->GetMedianTimePast()
231 return IsFinalTx(tx
, nBlockHeight
, nBlockTime
);
234 bool TestLockPointValidity(const LockPoints
* lp
)
236 AssertLockHeld(cs_main
);
238 // If there are relative lock times then the maxInputBlock will be set
239 // If there are no relative lock times, the LockPoints don't depend on the chain
240 if (lp
->maxInputBlock
) {
241 // Check whether chainActive is an extension of the block at which the LockPoints
242 // calculation was valid. If not LockPoints are no longer valid
243 if (!chainActive
.Contains(lp
->maxInputBlock
)) {
248 // LockPoints still valid
252 bool CheckSequenceLocks(const CTransaction
&tx
, int flags
, LockPoints
* lp
, bool useExistingLockPoints
)
254 AssertLockHeld(cs_main
);
255 AssertLockHeld(mempool
.cs
);
257 CBlockIndex
* tip
= chainActive
.Tip();
260 // CheckSequenceLocks() uses chainActive.Height()+1 to evaluate
261 // height based locks because when SequenceLocks() is called within
262 // ConnectBlock(), the height of the block *being*
263 // evaluated is what is used.
264 // Thus if we want to know if a transaction can be part of the
265 // *next* block, we need to use one more than chainActive.Height()
266 index
.nHeight
= tip
->nHeight
+ 1;
268 std::pair
<int, int64_t> lockPair
;
269 if (useExistingLockPoints
) {
271 lockPair
.first
= lp
->height
;
272 lockPair
.second
= lp
->time
;
275 // pcoinsTip contains the UTXO set for chainActive.Tip()
276 CCoinsViewMemPool
viewMemPool(pcoinsTip
, mempool
);
277 std::vector
<int> prevheights
;
278 prevheights
.resize(tx
.vin
.size());
279 for (size_t txinIndex
= 0; txinIndex
< tx
.vin
.size(); txinIndex
++) {
280 const CTxIn
& txin
= tx
.vin
[txinIndex
];
282 if (!viewMemPool
.GetCoin(txin
.prevout
, coin
)) {
283 return error("%s: Missing input", __func__
);
285 if (coin
.nHeight
== MEMPOOL_HEIGHT
) {
286 // Assume all mempool transaction confirm in the next block
287 prevheights
[txinIndex
] = tip
->nHeight
+ 1;
289 prevheights
[txinIndex
] = coin
.nHeight
;
292 lockPair
= CalculateSequenceLocks(tx
, flags
, &prevheights
, index
);
294 lp
->height
= lockPair
.first
;
295 lp
->time
= lockPair
.second
;
296 // Also store the hash of the block with the highest height of
297 // all the blocks which have sequence locked prevouts.
298 // This hash needs to still be on the chain
299 // for these LockPoint calculations to be valid
300 // Note: It is impossible to correctly calculate a maxInputBlock
301 // if any of the sequence locked inputs depend on unconfirmed txs,
302 // except in the special case where the relative lock time/height
303 // is 0, which is equivalent to no sequence lock. Since we assume
304 // input height of tip+1 for mempool txs and test the resulting
305 // lockPair from CalculateSequenceLocks against tip+1. We know
306 // EvaluateSequenceLocks will fail if there was a non-zero sequence
307 // lock on a mempool input, so we can use the return value of
308 // CheckSequenceLocks to indicate the LockPoints validity
309 int maxInputHeight
= 0;
310 for (int height
: prevheights
) {
311 // Can ignore mempool inputs since we'll fail if they had non-zero locks
312 if (height
!= tip
->nHeight
+1) {
313 maxInputHeight
= std::max(maxInputHeight
, height
);
316 lp
->maxInputBlock
= tip
->GetAncestor(maxInputHeight
);
319 return EvaluateSequenceLocks(index
, lockPair
);
322 // Returns the script flags which should be checked for a given block
323 static unsigned int GetBlockScriptFlags(const CBlockIndex
* pindex
, const Consensus::Params
& chainparams
);
325 static void LimitMempoolSize(CTxMemPool
& pool
, size_t limit
, unsigned long age
) {
326 int expired
= pool
.Expire(GetTime() - age
);
328 LogPrint(BCLog::MEMPOOL
, "Expired %i transactions from the memory pool\n", expired
);
331 std::vector
<COutPoint
> vNoSpendsRemaining
;
332 pool
.TrimToSize(limit
, &vNoSpendsRemaining
);
333 for (const COutPoint
& removed
: vNoSpendsRemaining
)
334 pcoinsTip
->Uncache(removed
);
337 /** Convert CValidationState to a human-readable message for logging */
338 std::string
FormatStateMessage(const CValidationState
&state
)
340 return strprintf("%s%s (code %i)",
341 state
.GetRejectReason(),
342 state
.GetDebugMessage().empty() ? "" : ", "+state
.GetDebugMessage(),
343 state
.GetRejectCode());
346 static bool IsCurrentForFeeEstimation()
348 AssertLockHeld(cs_main
);
349 if (IsInitialBlockDownload())
351 if (chainActive
.Tip()->GetBlockTime() < (GetTime() - MAX_FEE_ESTIMATION_TIP_AGE
))
353 if (chainActive
.Height() < pindexBestHeader
->nHeight
- 1)
358 /* Make mempool consistent after a reorg, by re-adding or recursively erasing
359 * disconnected block transactions from the mempool, and also removing any
360 * other transactions from the mempool that are no longer valid given the new
363 * Note: we assume that disconnectpool only contains transactions that are NOT
364 * confirmed in the current chain nor already in the mempool (otherwise,
365 * in-mempool descendants of such transactions would be removed).
367 * Passing fAddToMempool=false will skip trying to add the transactions back,
368 * and instead just erase from the mempool as needed.
371 void UpdateMempoolForReorg(DisconnectedBlockTransactions
&disconnectpool
, bool fAddToMempool
)
373 AssertLockHeld(cs_main
);
374 std::vector
<uint256
> vHashUpdate
;
375 // disconnectpool's insertion_order index sorts the entries from
376 // oldest to newest, but the oldest entry will be the last tx from the
377 // latest mined block that was disconnected.
378 // Iterate disconnectpool in reverse, so that we add transactions
379 // back to the mempool starting with the earliest transaction that had
380 // been previously seen in a block.
381 auto it
= disconnectpool
.queuedTx
.get
<insertion_order
>().rbegin();
382 while (it
!= disconnectpool
.queuedTx
.get
<insertion_order
>().rend()) {
383 // ignore validation errors in resurrected transactions
384 CValidationState stateDummy
;
385 if (!fAddToMempool
|| (*it
)->IsCoinBase() || !AcceptToMemoryPool(mempool
, stateDummy
, *it
, false, nullptr, nullptr, true)) {
386 // If the transaction doesn't make it in to the mempool, remove any
387 // transactions that depend on it (which would now be orphans).
388 mempool
.removeRecursive(**it
, MemPoolRemovalReason::REORG
);
389 } else if (mempool
.exists((*it
)->GetHash())) {
390 vHashUpdate
.push_back((*it
)->GetHash());
394 disconnectpool
.queuedTx
.clear();
395 // AcceptToMemoryPool/addUnchecked all assume that new mempool entries have
396 // no in-mempool children, which is generally not true when adding
397 // previously-confirmed transactions back to the mempool.
398 // UpdateTransactionsFromBlock finds descendants of any transactions in
399 // the disconnectpool that were added back and cleans up the mempool state.
400 mempool
.UpdateTransactionsFromBlock(vHashUpdate
);
402 // We also need to remove any now-immature transactions
403 mempool
.removeForReorg(pcoinsTip
, chainActive
.Tip()->nHeight
+ 1, STANDARD_LOCKTIME_VERIFY_FLAGS
);
404 // Re-limit mempool size, in case we added any transactions
405 LimitMempoolSize(mempool
, gArgs
.GetArg("-maxmempool", DEFAULT_MAX_MEMPOOL_SIZE
) * 1000000, gArgs
.GetArg("-mempoolexpiry", DEFAULT_MEMPOOL_EXPIRY
) * 60 * 60);
408 // Used to avoid mempool polluting consensus critical paths if CCoinsViewMempool
409 // were somehow broken and returning the wrong scriptPubKeys
410 static bool CheckInputsFromMempoolAndCache(const CTransaction
& tx
, CValidationState
&state
, const CCoinsViewCache
&view
, CTxMemPool
& pool
,
411 unsigned int flags
, bool cacheSigStore
, PrecomputedTransactionData
& txdata
) {
412 AssertLockHeld(cs_main
);
414 // pool.cs should be locked already, but go ahead and re-take the lock here
415 // to enforce that mempool doesn't change between when we check the view
416 // and when we actually call through to CheckInputs
419 assert(!tx
.IsCoinBase());
420 for (const CTxIn
& txin
: tx
.vin
) {
421 const Coin
& coin
= view
.AccessCoin(txin
.prevout
);
423 // At this point we haven't actually checked if the coins are all
424 // available (or shouldn't assume we have, since CheckInputs does).
425 // So we just return failure if the inputs are not available here,
426 // and then only have to check equivalence for available inputs.
427 if (coin
.IsSpent()) return false;
429 const CTransactionRef
& txFrom
= pool
.get(txin
.prevout
.hash
);
431 assert(txFrom
->GetHash() == txin
.prevout
.hash
);
432 assert(txFrom
->vout
.size() > txin
.prevout
.n
);
433 assert(txFrom
->vout
[txin
.prevout
.n
] == coin
.out
);
435 const Coin
& coinFromDisk
= pcoinsTip
->AccessCoin(txin
.prevout
);
436 assert(!coinFromDisk
.IsSpent());
437 assert(coinFromDisk
.out
== coin
.out
);
441 return CheckInputs(tx
, state
, view
, true, flags
, cacheSigStore
, true, txdata
);
444 static bool AcceptToMemoryPoolWorker(const CChainParams
& chainparams
, CTxMemPool
& pool
, CValidationState
& state
, const CTransactionRef
& ptx
, bool fLimitFree
,
445 bool* pfMissingInputs
, int64_t nAcceptTime
, std::list
<CTransactionRef
>* plTxnReplaced
,
446 bool fOverrideMempoolLimit
, const CAmount
& nAbsurdFee
, std::vector
<COutPoint
>& coins_to_uncache
)
448 const CTransaction
& tx
= *ptx
;
449 const uint256 hash
= tx
.GetHash();
450 AssertLockHeld(cs_main
);
452 *pfMissingInputs
= false;
454 if (!CheckTransaction(tx
, state
))
455 return false; // state filled in by CheckTransaction
457 // Coinbase is only valid in a block, not as a loose transaction
459 return state
.DoS(100, false, REJECT_INVALID
, "coinbase");
461 // Reject transactions with witness before segregated witness activates (override with -prematurewitness)
462 bool witnessEnabled
= IsWitnessEnabled(chainActive
.Tip(), chainparams
.GetConsensus());
463 if (!gArgs
.GetBoolArg("-prematurewitness", false) && tx
.HasWitness() && !witnessEnabled
) {
464 return state
.DoS(0, false, REJECT_NONSTANDARD
, "no-witness-yet", true);
467 // Rather not work on nonstandard transactions (unless -testnet/-regtest)
469 if (fRequireStandard
&& !IsStandardTx(tx
, reason
, witnessEnabled
))
470 return state
.DoS(0, false, REJECT_NONSTANDARD
, reason
);
472 // Only accept nLockTime-using transactions that can be mined in the next
473 // block; we don't want our mempool filled up with transactions that can't
475 if (!CheckFinalTx(tx
, STANDARD_LOCKTIME_VERIFY_FLAGS
))
476 return state
.DoS(0, false, REJECT_NONSTANDARD
, "non-final");
478 // is it already in the memory pool?
479 if (pool
.exists(hash
)) {
480 return state
.Invalid(false, REJECT_DUPLICATE
, "txn-already-in-mempool");
483 // Check for conflicts with in-memory transactions
484 std::set
<uint256
> setConflicts
;
486 LOCK(pool
.cs
); // protect pool.mapNextTx
487 for (const CTxIn
&txin
: tx
.vin
)
489 auto itConflicting
= pool
.mapNextTx
.find(txin
.prevout
);
490 if (itConflicting
!= pool
.mapNextTx
.end())
492 const CTransaction
*ptxConflicting
= itConflicting
->second
;
493 if (!setConflicts
.count(ptxConflicting
->GetHash()))
495 // Allow opt-out of transaction replacement by setting
496 // nSequence > MAX_BIP125_RBF_SEQUENCE (SEQUENCE_FINAL-2) on all inputs.
498 // SEQUENCE_FINAL-1 is picked to still allow use of nLockTime by
499 // non-replaceable transactions. All inputs rather than just one
500 // is for the sake of multi-party protocols, where we don't
501 // want a single party to be able to disable replacement.
503 // The opt-out ignores descendants as anyone relying on
504 // first-seen mempool behavior should be checking all
505 // unconfirmed ancestors anyway; doing otherwise is hopelessly
507 bool fReplacementOptOut
= true;
508 if (fEnableReplacement
)
510 for (const CTxIn
&_txin
: ptxConflicting
->vin
)
512 if (_txin
.nSequence
<= MAX_BIP125_RBF_SEQUENCE
)
514 fReplacementOptOut
= false;
519 if (fReplacementOptOut
) {
520 return state
.Invalid(false, REJECT_DUPLICATE
, "txn-mempool-conflict");
523 setConflicts
.insert(ptxConflicting
->GetHash());
531 CCoinsViewCache
view(&dummy
);
533 CAmount nValueIn
= 0;
537 CCoinsViewMemPool
viewMemPool(pcoinsTip
, pool
);
538 view
.SetBackend(viewMemPool
);
540 // do all inputs exist?
541 for (const CTxIn txin
: tx
.vin
) {
542 if (!pcoinsTip
->HaveCoinInCache(txin
.prevout
)) {
543 coins_to_uncache
.push_back(txin
.prevout
);
545 if (!view
.HaveCoin(txin
.prevout
)) {
546 // Are inputs missing because we already have the tx?
547 for (size_t out
= 0; out
< tx
.vout
.size(); out
++) {
548 // Optimistically just do efficient check of cache for outputs
549 if (pcoinsTip
->HaveCoinInCache(COutPoint(hash
, out
))) {
550 return state
.Invalid(false, REJECT_DUPLICATE
, "txn-already-known");
553 // Otherwise assume this might be an orphan tx for which we just haven't seen parents yet
554 if (pfMissingInputs
) {
555 *pfMissingInputs
= true;
557 return false; // fMissingInputs and !state.IsInvalid() is used to detect this condition, don't set state.Invalid()
561 // Bring the best block into scope
564 nValueIn
= view
.GetValueIn(tx
);
566 // we have all inputs cached now, so switch back to dummy, so we don't need to keep lock on mempool
567 view
.SetBackend(dummy
);
569 // Only accept BIP68 sequence locked transactions that can be mined in the next
570 // block; we don't want our mempool filled up with transactions that can't
572 // Must keep pool.cs for this unless we change CheckSequenceLocks to take a
573 // CoinsViewCache instead of create its own
574 if (!CheckSequenceLocks(tx
, STANDARD_LOCKTIME_VERIFY_FLAGS
, &lp
))
575 return state
.DoS(0, false, REJECT_NONSTANDARD
, "non-BIP68-final");
578 // Check for non-standard pay-to-script-hash in inputs
579 if (fRequireStandard
&& !AreInputsStandard(tx
, view
))
580 return state
.Invalid(false, REJECT_NONSTANDARD
, "bad-txns-nonstandard-inputs");
582 // Check for non-standard witness in P2WSH
583 if (tx
.HasWitness() && fRequireStandard
&& !IsWitnessStandard(tx
, view
))
584 return state
.DoS(0, false, REJECT_NONSTANDARD
, "bad-witness-nonstandard", true);
586 int64_t nSigOpsCost
= GetTransactionSigOpCost(tx
, view
, STANDARD_SCRIPT_VERIFY_FLAGS
);
588 CAmount nValueOut
= tx
.GetValueOut();
589 CAmount nFees
= nValueIn
-nValueOut
;
590 // nModifiedFees includes any fee deltas from PrioritiseTransaction
591 CAmount nModifiedFees
= nFees
;
592 pool
.ApplyDelta(hash
, nModifiedFees
);
594 // Keep track of transactions that spend a coinbase, which we re-scan
595 // during reorgs to ensure COINBASE_MATURITY is still met.
596 bool fSpendsCoinbase
= false;
597 for (const CTxIn
&txin
: tx
.vin
) {
598 const Coin
&coin
= view
.AccessCoin(txin
.prevout
);
599 if (coin
.IsCoinBase()) {
600 fSpendsCoinbase
= true;
605 CTxMemPoolEntry
entry(ptx
, nFees
, nAcceptTime
, chainActive
.Height(),
606 fSpendsCoinbase
, nSigOpsCost
, lp
);
607 unsigned int nSize
= entry
.GetTxSize();
609 // Check that the transaction doesn't have an excessive number of
610 // sigops, making it impossible to mine. Since the coinbase transaction
611 // itself can contain sigops MAX_STANDARD_TX_SIGOPS is less than
612 // MAX_BLOCK_SIGOPS; we still consider this an invalid rather than
613 // merely non-standard transaction.
614 if (nSigOpsCost
> MAX_STANDARD_TX_SIGOPS_COST
)
615 return state
.DoS(0, false, REJECT_NONSTANDARD
, "bad-txns-too-many-sigops", false,
616 strprintf("%d", nSigOpsCost
));
618 CAmount mempoolRejectFee
= pool
.GetMinFee(gArgs
.GetArg("-maxmempool", DEFAULT_MAX_MEMPOOL_SIZE
) * 1000000).GetFee(nSize
);
619 if (mempoolRejectFee
> 0 && nModifiedFees
< mempoolRejectFee
) {
620 return state
.DoS(0, false, REJECT_INSUFFICIENTFEE
, "mempool min fee not met", false, strprintf("%d < %d", nFees
, mempoolRejectFee
));
623 // No transactions are allowed below minRelayTxFee except from disconnected blocks
624 if (fLimitFree
&& nModifiedFees
< ::minRelayTxFee
.GetFee(nSize
)) {
625 return state
.DoS(0, false, REJECT_INSUFFICIENTFEE
, "min relay fee not met");
628 if (nAbsurdFee
&& nFees
> nAbsurdFee
)
629 return state
.Invalid(false,
630 REJECT_HIGHFEE
, "absurdly-high-fee",
631 strprintf("%d > %d", nFees
, nAbsurdFee
));
633 // Calculate in-mempool ancestors, up to a limit.
634 CTxMemPool::setEntries setAncestors
;
635 size_t nLimitAncestors
= gArgs
.GetArg("-limitancestorcount", DEFAULT_ANCESTOR_LIMIT
);
636 size_t nLimitAncestorSize
= gArgs
.GetArg("-limitancestorsize", DEFAULT_ANCESTOR_SIZE_LIMIT
)*1000;
637 size_t nLimitDescendants
= gArgs
.GetArg("-limitdescendantcount", DEFAULT_DESCENDANT_LIMIT
);
638 size_t nLimitDescendantSize
= gArgs
.GetArg("-limitdescendantsize", DEFAULT_DESCENDANT_SIZE_LIMIT
)*1000;
639 std::string errString
;
640 if (!pool
.CalculateMemPoolAncestors(entry
, setAncestors
, nLimitAncestors
, nLimitAncestorSize
, nLimitDescendants
, nLimitDescendantSize
, errString
)) {
641 return state
.DoS(0, false, REJECT_NONSTANDARD
, "too-long-mempool-chain", false, errString
);
644 // A transaction that spends outputs that would be replaced by it is invalid. Now
645 // that we have the set of all ancestors we can detect this
646 // pathological case by making sure setConflicts and setAncestors don't
648 for (CTxMemPool::txiter ancestorIt
: setAncestors
)
650 const uint256
&hashAncestor
= ancestorIt
->GetTx().GetHash();
651 if (setConflicts
.count(hashAncestor
))
653 return state
.DoS(10, false,
654 REJECT_INVALID
, "bad-txns-spends-conflicting-tx", false,
655 strprintf("%s spends conflicting transaction %s",
657 hashAncestor
.ToString()));
661 // Check if it's economically rational to mine this transaction rather
662 // than the ones it replaces.
663 CAmount nConflictingFees
= 0;
664 size_t nConflictingSize
= 0;
665 uint64_t nConflictingCount
= 0;
666 CTxMemPool::setEntries allConflicting
;
668 // If we don't hold the lock allConflicting might be incomplete; the
669 // subsequent RemoveStaged() and addUnchecked() calls don't guarantee
670 // mempool consistency for us.
672 const bool fReplacementTransaction
= setConflicts
.size();
673 if (fReplacementTransaction
)
675 CFeeRate
newFeeRate(nModifiedFees
, nSize
);
676 std::set
<uint256
> setConflictsParents
;
677 const int maxDescendantsToVisit
= 100;
678 CTxMemPool::setEntries setIterConflicting
;
679 for (const uint256
&hashConflicting
: setConflicts
)
681 CTxMemPool::txiter mi
= pool
.mapTx
.find(hashConflicting
);
682 if (mi
== pool
.mapTx
.end())
685 // Save these to avoid repeated lookups
686 setIterConflicting
.insert(mi
);
688 // Don't allow the replacement to reduce the feerate of the
691 // We usually don't want to accept replacements with lower
692 // feerates than what they replaced as that would lower the
693 // feerate of the next block. Requiring that the feerate always
694 // be increased is also an easy-to-reason about way to prevent
695 // DoS attacks via replacements.
697 // The mining code doesn't (currently) take children into
698 // account (CPFP) so we only consider the feerates of
699 // transactions being directly replaced, not their indirect
700 // descendants. While that does mean high feerate children are
701 // ignored when deciding whether or not to replace, we do
702 // require the replacement to pay more overall fees too,
703 // mitigating most cases.
704 CFeeRate
oldFeeRate(mi
->GetModifiedFee(), mi
->GetTxSize());
705 if (newFeeRate
<= oldFeeRate
)
707 return state
.DoS(0, false,
708 REJECT_INSUFFICIENTFEE
, "insufficient fee", false,
709 strprintf("rejecting replacement %s; new feerate %s <= old feerate %s",
711 newFeeRate
.ToString(),
712 oldFeeRate
.ToString()));
715 for (const CTxIn
&txin
: mi
->GetTx().vin
)
717 setConflictsParents
.insert(txin
.prevout
.hash
);
720 nConflictingCount
+= mi
->GetCountWithDescendants();
722 // This potentially overestimates the number of actual descendants
723 // but we just want to be conservative to avoid doing too much
725 if (nConflictingCount
<= maxDescendantsToVisit
) {
726 // If not too many to replace, then calculate the set of
727 // transactions that would have to be evicted
728 for (CTxMemPool::txiter it
: setIterConflicting
) {
729 pool
.CalculateDescendants(it
, allConflicting
);
731 for (CTxMemPool::txiter it
: allConflicting
) {
732 nConflictingFees
+= it
->GetModifiedFee();
733 nConflictingSize
+= it
->GetTxSize();
736 return state
.DoS(0, false,
737 REJECT_NONSTANDARD
, "too many potential replacements", false,
738 strprintf("rejecting replacement %s; too many potential replacements (%d > %d)\n",
741 maxDescendantsToVisit
));
744 for (unsigned int j
= 0; j
< tx
.vin
.size(); j
++)
746 // We don't want to accept replacements that require low
747 // feerate junk to be mined first. Ideally we'd keep track of
748 // the ancestor feerates and make the decision based on that,
749 // but for now requiring all new inputs to be confirmed works.
750 if (!setConflictsParents
.count(tx
.vin
[j
].prevout
.hash
))
752 // Rather than check the UTXO set - potentially expensive -
753 // it's cheaper to just check if the new input refers to a
754 // tx that's in the mempool.
755 if (pool
.mapTx
.find(tx
.vin
[j
].prevout
.hash
) != pool
.mapTx
.end())
756 return state
.DoS(0, false,
757 REJECT_NONSTANDARD
, "replacement-adds-unconfirmed", false,
758 strprintf("replacement %s adds unconfirmed input, idx %d",
759 hash
.ToString(), j
));
763 // The replacement must pay greater fees than the transactions it
764 // replaces - if we did the bandwidth used by those conflicting
765 // transactions would not be paid for.
766 if (nModifiedFees
< nConflictingFees
)
768 return state
.DoS(0, false,
769 REJECT_INSUFFICIENTFEE
, "insufficient fee", false,
770 strprintf("rejecting replacement %s, less fees than conflicting txs; %s < %s",
771 hash
.ToString(), FormatMoney(nModifiedFees
), FormatMoney(nConflictingFees
)));
774 // Finally in addition to paying more fees than the conflicts the
775 // new transaction must pay for its own bandwidth.
776 CAmount nDeltaFees
= nModifiedFees
- nConflictingFees
;
777 if (nDeltaFees
< ::incrementalRelayFee
.GetFee(nSize
))
779 return state
.DoS(0, false,
780 REJECT_INSUFFICIENTFEE
, "insufficient fee", false,
781 strprintf("rejecting replacement %s, not enough additional fees to relay; %s < %s",
783 FormatMoney(nDeltaFees
),
784 FormatMoney(::incrementalRelayFee
.GetFee(nSize
))));
788 unsigned int scriptVerifyFlags
= STANDARD_SCRIPT_VERIFY_FLAGS
;
789 if (!chainparams
.RequireStandard()) {
790 scriptVerifyFlags
= gArgs
.GetArg("-promiscuousmempoolflags", scriptVerifyFlags
);
793 // Check against previous transactions
794 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
795 PrecomputedTransactionData
txdata(tx
);
796 if (!CheckInputs(tx
, state
, view
, true, scriptVerifyFlags
, true, false, txdata
)) {
797 // SCRIPT_VERIFY_CLEANSTACK requires SCRIPT_VERIFY_WITNESS, so we
798 // need to turn both off, and compare against just turning off CLEANSTACK
799 // to see if the failure is specifically due to witness validation.
800 CValidationState stateDummy
; // Want reported failures to be from first CheckInputs
801 if (!tx
.HasWitness() && CheckInputs(tx
, stateDummy
, view
, true, scriptVerifyFlags
& ~(SCRIPT_VERIFY_WITNESS
| SCRIPT_VERIFY_CLEANSTACK
), true, false, txdata
) &&
802 !CheckInputs(tx
, stateDummy
, view
, true, scriptVerifyFlags
& ~SCRIPT_VERIFY_CLEANSTACK
, true, false, txdata
)) {
803 // Only the witness is missing, so the transaction itself may be fine.
804 state
.SetCorruptionPossible();
806 return false; // state filled in by CheckInputs
809 // Check again against the current block tip's script verification
810 // flags to cache our script execution flags. This is, of course,
811 // useless if the next block has different script flags from the
812 // previous one, but because the cache tracks script flags for us it
813 // will auto-invalidate and we'll just have a few blocks of extra
814 // misses on soft-fork activation.
816 // This is also useful in case of bugs in the standard flags that cause
817 // transactions to pass as valid when they're actually invalid. For
818 // instance the STRICTENC flag was incorrectly allowing certain
819 // CHECKSIG NOT scripts to pass, even though they were invalid.
821 // There is a similar check in CreateNewBlock() to prevent creating
822 // invalid blocks (using TestBlockValidity), however allowing such
823 // transactions into the mempool can be exploited as a DoS attack.
824 unsigned int currentBlockScriptVerifyFlags
= GetBlockScriptFlags(chainActive
.Tip(), Params().GetConsensus());
825 if (!CheckInputsFromMempoolAndCache(tx
, state
, view
, pool
, currentBlockScriptVerifyFlags
, true, txdata
))
827 // If we're using promiscuousmempoolflags, we may hit this normally
828 // Check if current block has some flags that scriptVerifyFlags
829 // does not before printing an ominous warning
830 if (!(~scriptVerifyFlags
& currentBlockScriptVerifyFlags
)) {
831 return error("%s: BUG! PLEASE REPORT THIS! ConnectInputs failed against latest-block but not STANDARD flags %s, %s",
832 __func__
, hash
.ToString(), FormatStateMessage(state
));
834 if (!CheckInputs(tx
, state
, view
, true, MANDATORY_SCRIPT_VERIFY_FLAGS
, true, false, txdata
)) {
835 return error("%s: ConnectInputs failed against MANDATORY but not STANDARD flags due to promiscuous mempool %s, %s",
836 __func__
, hash
.ToString(), FormatStateMessage(state
));
838 LogPrintf("Warning: -promiscuousmempool flags set to not include currently enforced soft forks, this may break mining or otherwise cause instability!\n");
843 // Remove conflicting transactions from the mempool
844 for (const CTxMemPool::txiter it
: allConflicting
)
846 LogPrint(BCLog::MEMPOOL
, "replacing tx %s with %s for %s BTC additional fees, %d delta bytes\n",
847 it
->GetTx().GetHash().ToString(),
849 FormatMoney(nModifiedFees
- nConflictingFees
),
850 (int)nSize
- (int)nConflictingSize
);
852 plTxnReplaced
->push_back(it
->GetSharedTx());
854 pool
.RemoveStaged(allConflicting
, false, MemPoolRemovalReason::REPLACED
);
856 // This transaction should only count for fee estimation if it isn't a
857 // BIP 125 replacement transaction (may not be widely supported), the
858 // node is not behind, and the transaction is not dependent on any other
859 // transactions in the mempool.
860 bool validForFeeEstimation
= !fReplacementTransaction
&& IsCurrentForFeeEstimation() && pool
.HasNoInputsOf(tx
);
862 // Store transaction in memory
863 pool
.addUnchecked(hash
, entry
, setAncestors
, validForFeeEstimation
);
865 // trim mempool and check if tx was trimmed
866 if (!fOverrideMempoolLimit
) {
867 LimitMempoolSize(pool
, gArgs
.GetArg("-maxmempool", DEFAULT_MAX_MEMPOOL_SIZE
) * 1000000, gArgs
.GetArg("-mempoolexpiry", DEFAULT_MEMPOOL_EXPIRY
) * 60 * 60);
868 if (!pool
.exists(hash
))
869 return state
.DoS(0, false, REJECT_INSUFFICIENTFEE
, "mempool full");
873 GetMainSignals().TransactionAddedToMempool(ptx
);
878 /** (try to) add transaction to memory pool with a specified acceptance time **/
879 static bool AcceptToMemoryPoolWithTime(const CChainParams
& chainparams
, CTxMemPool
& pool
, CValidationState
&state
, const CTransactionRef
&tx
, bool fLimitFree
,
880 bool* pfMissingInputs
, int64_t nAcceptTime
, std::list
<CTransactionRef
>* plTxnReplaced
,
881 bool fOverrideMempoolLimit
, const CAmount nAbsurdFee
)
883 std::vector
<COutPoint
> coins_to_uncache
;
884 bool res
= AcceptToMemoryPoolWorker(chainparams
, pool
, state
, tx
, fLimitFree
, pfMissingInputs
, nAcceptTime
, plTxnReplaced
, fOverrideMempoolLimit
, nAbsurdFee
, coins_to_uncache
);
886 for (const COutPoint
& hashTx
: coins_to_uncache
)
887 pcoinsTip
->Uncache(hashTx
);
889 // After we've (potentially) uncached entries, ensure our coins cache is still within its size limits
890 CValidationState stateDummy
;
891 FlushStateToDisk(chainparams
, stateDummy
, FLUSH_STATE_PERIODIC
);
895 bool AcceptToMemoryPool(CTxMemPool
& pool
, CValidationState
&state
, const CTransactionRef
&tx
, bool fLimitFree
,
896 bool* pfMissingInputs
, std::list
<CTransactionRef
>* plTxnReplaced
,
897 bool fOverrideMempoolLimit
, const CAmount nAbsurdFee
)
899 const CChainParams
& chainparams
= Params();
900 return AcceptToMemoryPoolWithTime(chainparams
, pool
, state
, tx
, fLimitFree
, pfMissingInputs
, GetTime(), plTxnReplaced
, fOverrideMempoolLimit
, nAbsurdFee
);
903 /** Return transaction in txOut, and if it was found inside a block, its hash is placed in hashBlock */
904 bool GetTransaction(const uint256
&hash
, CTransactionRef
&txOut
, const Consensus::Params
& consensusParams
, uint256
&hashBlock
, bool fAllowSlow
)
906 CBlockIndex
*pindexSlow
= nullptr;
910 CTransactionRef ptx
= mempool
.get(hash
);
919 if (pblocktree
->ReadTxIndex(hash
, postx
)) {
920 CAutoFile
file(OpenBlockFile(postx
, true), SER_DISK
, CLIENT_VERSION
);
922 return error("%s: OpenBlockFile failed", __func__
);
926 fseek(file
.Get(), postx
.nTxOffset
, SEEK_CUR
);
928 } catch (const std::exception
& e
) {
929 return error("%s: Deserialize or I/O error - %s", __func__
, e
.what());
931 hashBlock
= header
.GetHash();
932 if (txOut
->GetHash() != hash
)
933 return error("%s: txid mismatch", __func__
);
938 if (fAllowSlow
) { // use coin database to locate block that contains transaction, and scan it
939 const Coin
& coin
= AccessByTxid(*pcoinsTip
, hash
);
940 if (!coin
.IsSpent()) pindexSlow
= chainActive
[coin
.nHeight
];
945 if (ReadBlockFromDisk(block
, pindexSlow
, consensusParams
)) {
946 for (const auto& tx
: block
.vtx
) {
947 if (tx
->GetHash() == hash
) {
949 hashBlock
= pindexSlow
->GetBlockHash();
964 //////////////////////////////////////////////////////////////////////////////
966 // CBlock and CBlockIndex
969 static bool WriteBlockToDisk(const CBlock
& block
, CDiskBlockPos
& pos
, const CMessageHeader::MessageStartChars
& messageStart
)
971 // Open history file to append
972 CAutoFile
fileout(OpenBlockFile(pos
), SER_DISK
, CLIENT_VERSION
);
973 if (fileout
.IsNull())
974 return error("WriteBlockToDisk: OpenBlockFile failed");
976 // Write index header
977 unsigned int nSize
= GetSerializeSize(fileout
, block
);
978 fileout
<< FLATDATA(messageStart
) << nSize
;
981 long fileOutPos
= ftell(fileout
.Get());
983 return error("WriteBlockToDisk: ftell failed");
984 pos
.nPos
= (unsigned int)fileOutPos
;
990 bool ReadBlockFromDisk(CBlock
& block
, const CDiskBlockPos
& pos
, const Consensus::Params
& consensusParams
)
994 // Open history file to read
995 CAutoFile
filein(OpenBlockFile(pos
, true), SER_DISK
, CLIENT_VERSION
);
997 return error("ReadBlockFromDisk: OpenBlockFile failed for %s", pos
.ToString());
1003 catch (const std::exception
& e
) {
1004 return error("%s: Deserialize or I/O error - %s at %s", __func__
, e
.what(), pos
.ToString());
1008 if (!CheckProofOfWork(block
.GetHash(), block
.nBits
, consensusParams
))
1009 return error("ReadBlockFromDisk: Errors in block header at %s", pos
.ToString());
1014 bool ReadBlockFromDisk(CBlock
& block
, const CBlockIndex
* pindex
, const Consensus::Params
& consensusParams
)
1016 if (!ReadBlockFromDisk(block
, pindex
->GetBlockPos(), consensusParams
))
1018 if (block
.GetHash() != pindex
->GetBlockHash())
1019 return error("ReadBlockFromDisk(CBlock&, CBlockIndex*): GetHash() doesn't match index for %s at %s",
1020 pindex
->ToString(), pindex
->GetBlockPos().ToString());
1024 CAmount
GetBlockSubsidy(int nHeight
, const Consensus::Params
& consensusParams
)
1026 int halvings
= nHeight
/ consensusParams
.nSubsidyHalvingInterval
;
1027 // Force block reward to zero when right shift is undefined.
1031 CAmount nSubsidy
= 50 * COIN
;
1032 // Subsidy is cut in half every 210,000 blocks which will occur approximately every 4 years.
1033 nSubsidy
>>= halvings
;
1037 bool IsInitialBlockDownload()
1039 // Once this function has returned false, it must remain false.
1040 static std::atomic
<bool> latchToFalse
{false};
1041 // Optimization: pre-test latch before taking the lock.
1042 if (latchToFalse
.load(std::memory_order_relaxed
))
1046 if (latchToFalse
.load(std::memory_order_relaxed
))
1048 if (fImporting
|| fReindex
)
1050 if (chainActive
.Tip() == nullptr)
1052 if (chainActive
.Tip()->nChainWork
< nMinimumChainWork
)
1054 if (chainActive
.Tip()->GetBlockTime() < (GetTime() - nMaxTipAge
))
1056 LogPrintf("Leaving InitialBlockDownload (latching to false)\n");
1057 latchToFalse
.store(true, std::memory_order_relaxed
);
1061 CBlockIndex
*pindexBestForkTip
= nullptr, *pindexBestForkBase
= nullptr;
1063 static void AlertNotify(const std::string
& strMessage
)
1065 uiInterface
.NotifyAlertChanged();
1066 std::string strCmd
= gArgs
.GetArg("-alertnotify", "");
1067 if (strCmd
.empty()) return;
1069 // Alert text should be plain ascii coming from a trusted source, but to
1070 // be safe we first strip anything not in safeChars, then add single quotes around
1071 // the whole string before passing it to the shell:
1072 std::string
singleQuote("'");
1073 std::string safeStatus
= SanitizeString(strMessage
);
1074 safeStatus
= singleQuote
+safeStatus
+singleQuote
;
1075 boost::replace_all(strCmd
, "%s", safeStatus
);
1077 boost::thread
t(runCommand
, strCmd
); // thread runs free
1080 static void CheckForkWarningConditions()
1082 AssertLockHeld(cs_main
);
1083 // Before we get past initial download, we cannot reliably alert about forks
1084 // (we assume we don't get stuck on a fork before finishing our initial sync)
1085 if (IsInitialBlockDownload())
1088 // If our best fork is no longer within 72 blocks (+/- 12 hours if no one mines it)
1089 // of our head, drop it
1090 if (pindexBestForkTip
&& chainActive
.Height() - pindexBestForkTip
->nHeight
>= 72)
1091 pindexBestForkTip
= nullptr;
1093 if (pindexBestForkTip
|| (pindexBestInvalid
&& pindexBestInvalid
->nChainWork
> chainActive
.Tip()->nChainWork
+ (GetBlockProof(*chainActive
.Tip()) * 6)))
1095 if (!GetfLargeWorkForkFound() && pindexBestForkBase
)
1097 std::string warning
= std::string("'Warning: Large-work fork detected, forking after block ") +
1098 pindexBestForkBase
->phashBlock
->ToString() + std::string("'");
1099 AlertNotify(warning
);
1101 if (pindexBestForkTip
&& pindexBestForkBase
)
1103 LogPrintf("%s: Warning: Large valid fork found\n forking the chain at height %d (%s)\n lasting to height %d (%s).\nChain state database corruption likely.\n", __func__
,
1104 pindexBestForkBase
->nHeight
, pindexBestForkBase
->phashBlock
->ToString(),
1105 pindexBestForkTip
->nHeight
, pindexBestForkTip
->phashBlock
->ToString());
1106 SetfLargeWorkForkFound(true);
1110 LogPrintf("%s: Warning: Found invalid chain at least ~6 blocks longer than our best chain.\nChain state database corruption likely.\n", __func__
);
1111 SetfLargeWorkInvalidChainFound(true);
1116 SetfLargeWorkForkFound(false);
1117 SetfLargeWorkInvalidChainFound(false);
1121 static void CheckForkWarningConditionsOnNewFork(CBlockIndex
* pindexNewForkTip
)
1123 AssertLockHeld(cs_main
);
1124 // If we are on a fork that is sufficiently large, set a warning flag
1125 CBlockIndex
* pfork
= pindexNewForkTip
;
1126 CBlockIndex
* plonger
= chainActive
.Tip();
1127 while (pfork
&& pfork
!= plonger
)
1129 while (plonger
&& plonger
->nHeight
> pfork
->nHeight
)
1130 plonger
= plonger
->pprev
;
1131 if (pfork
== plonger
)
1133 pfork
= pfork
->pprev
;
1136 // We define a condition where we should warn the user about as a fork of at least 7 blocks
1137 // with a tip within 72 blocks (+/- 12 hours if no one mines it) of ours
1138 // We use 7 blocks rather arbitrarily as it represents just under 10% of sustained network
1139 // hash rate operating on the fork.
1140 // or a chain that is entirely longer than ours and invalid (note that this should be detected by both)
1141 // We define it this way because it allows us to only store the highest fork tip (+ base) which meets
1142 // the 7-block condition and from this always have the most-likely-to-cause-warning fork
1143 if (pfork
&& (!pindexBestForkTip
|| pindexNewForkTip
->nHeight
> pindexBestForkTip
->nHeight
) &&
1144 pindexNewForkTip
->nChainWork
- pfork
->nChainWork
> (GetBlockProof(*pfork
) * 7) &&
1145 chainActive
.Height() - pindexNewForkTip
->nHeight
< 72)
1147 pindexBestForkTip
= pindexNewForkTip
;
1148 pindexBestForkBase
= pfork
;
1151 CheckForkWarningConditions();
1154 void static InvalidChainFound(CBlockIndex
* pindexNew
)
1156 if (!pindexBestInvalid
|| pindexNew
->nChainWork
> pindexBestInvalid
->nChainWork
)
1157 pindexBestInvalid
= pindexNew
;
1159 LogPrintf("%s: invalid block=%s height=%d log2_work=%.8g date=%s\n", __func__
,
1160 pindexNew
->GetBlockHash().ToString(), pindexNew
->nHeight
,
1161 log(pindexNew
->nChainWork
.getdouble())/log(2.0), DateTimeStrFormat("%Y-%m-%d %H:%M:%S",
1162 pindexNew
->GetBlockTime()));
1163 CBlockIndex
*tip
= chainActive
.Tip();
1165 LogPrintf("%s: current best=%s height=%d log2_work=%.8g date=%s\n", __func__
,
1166 tip
->GetBlockHash().ToString(), chainActive
.Height(), log(tip
->nChainWork
.getdouble())/log(2.0),
1167 DateTimeStrFormat("%Y-%m-%d %H:%M:%S", tip
->GetBlockTime()));
1168 CheckForkWarningConditions();
1171 void static InvalidBlockFound(CBlockIndex
*pindex
, const CValidationState
&state
) {
1172 if (!state
.CorruptionPossible()) {
1173 pindex
->nStatus
|= BLOCK_FAILED_VALID
;
1174 setDirtyBlockIndex
.insert(pindex
);
1175 setBlockIndexCandidates
.erase(pindex
);
1176 InvalidChainFound(pindex
);
1180 void UpdateCoins(const CTransaction
& tx
, CCoinsViewCache
& inputs
, CTxUndo
&txundo
, int nHeight
)
1182 // mark inputs spent
1183 if (!tx
.IsCoinBase()) {
1184 txundo
.vprevout
.reserve(tx
.vin
.size());
1185 for (const CTxIn
&txin
: tx
.vin
) {
1186 txundo
.vprevout
.emplace_back();
1187 bool is_spent
= inputs
.SpendCoin(txin
.prevout
, &txundo
.vprevout
.back());
1192 AddCoins(inputs
, tx
, nHeight
);
1195 void UpdateCoins(const CTransaction
& tx
, CCoinsViewCache
& inputs
, int nHeight
)
1198 UpdateCoins(tx
, inputs
, txundo
, nHeight
);
1201 bool CScriptCheck::operator()() {
1202 const CScript
&scriptSig
= ptxTo
->vin
[nIn
].scriptSig
;
1203 const CScriptWitness
*witness
= &ptxTo
->vin
[nIn
].scriptWitness
;
1204 return VerifyScript(scriptSig
, scriptPubKey
, witness
, nFlags
, CachingTransactionSignatureChecker(ptxTo
, nIn
, amount
, cacheStore
, *txdata
), &error
);
1207 int GetSpendHeight(const CCoinsViewCache
& inputs
)
1210 CBlockIndex
* pindexPrev
= mapBlockIndex
.find(inputs
.GetBestBlock())->second
;
1211 return pindexPrev
->nHeight
+ 1;
1215 static CuckooCache::cache
<uint256
, SignatureCacheHasher
> scriptExecutionCache
;
1216 static uint256
scriptExecutionCacheNonce(GetRandHash());
1218 void InitScriptExecutionCache() {
1219 // nMaxCacheSize is unsigned. If -maxsigcachesize is set to zero,
1220 // setup_bytes creates the minimum possible cache (2 elements).
1221 size_t nMaxCacheSize
= std::min(std::max((int64_t)0, gArgs
.GetArg("-maxsigcachesize", DEFAULT_MAX_SIG_CACHE_SIZE
) / 2), MAX_MAX_SIG_CACHE_SIZE
) * ((size_t) 1 << 20);
1222 size_t nElems
= scriptExecutionCache
.setup_bytes(nMaxCacheSize
);
1223 LogPrintf("Using %zu MiB out of %zu/2 requested for script execution cache, able to store %zu elements\n",
1224 (nElems
*sizeof(uint256
)) >>20, (nMaxCacheSize
*2)>>20, nElems
);
1228 * Check whether all inputs of this transaction are valid (no double spends, scripts & sigs, amounts)
1229 * This does not modify the UTXO set.
1231 * If pvChecks is not nullptr, script checks are pushed onto it instead of being performed inline. Any
1232 * script checks which are not necessary (eg due to script execution cache hits) are, obviously,
1233 * not pushed onto pvChecks/run.
1235 * Setting cacheSigStore/cacheFullScriptStore to false will remove elements from the corresponding cache
1236 * which are matched. This is useful for checking blocks where we will likely never need the cache
1239 * Non-static (and re-declared) in src/test/txvalidationcache_tests.cpp
1241 bool CheckInputs(const CTransaction
& tx
, CValidationState
&state
, const CCoinsViewCache
&inputs
, bool fScriptChecks
, unsigned int flags
, bool cacheSigStore
, bool cacheFullScriptStore
, PrecomputedTransactionData
& txdata
, std::vector
<CScriptCheck
> *pvChecks
)
1243 if (!tx
.IsCoinBase())
1245 if (!Consensus::CheckTxInputs(tx
, state
, inputs
, GetSpendHeight(inputs
)))
1249 pvChecks
->reserve(tx
.vin
.size());
1251 // The first loop above does all the inexpensive checks.
1252 // Only if ALL inputs pass do we perform expensive ECDSA signature checks.
1253 // Helps prevent CPU exhaustion attacks.
1255 // Skip script verification when connecting blocks under the
1256 // assumevalid block. Assuming the assumevalid block is valid this
1257 // is safe because block merkle hashes are still computed and checked,
1258 // Of course, if an assumed valid block is invalid due to false scriptSigs
1259 // this optimization would allow an invalid chain to be accepted.
1260 if (fScriptChecks
) {
1261 // First check if script executions have been cached with the same
1262 // flags. Note that this assumes that the inputs provided are
1263 // correct (ie that the transaction hash which is in tx's prevouts
1264 // properly commits to the scriptPubKey in the inputs view of that
1266 uint256 hashCacheEntry
;
1267 // We only use the first 19 bytes of nonce to avoid a second SHA
1268 // round - giving us 19 + 32 + 4 = 55 bytes (+ 8 + 1 = 64)
1269 static_assert(55 - sizeof(flags
) - 32 >= 128/8, "Want at least 128 bits of nonce for script execution cache");
1270 CSHA256().Write(scriptExecutionCacheNonce
.begin(), 55 - sizeof(flags
) - 32).Write(tx
.GetWitnessHash().begin(), 32).Write((unsigned char*)&flags
, sizeof(flags
)).Finalize(hashCacheEntry
.begin());
1271 AssertLockHeld(cs_main
); //TODO: Remove this requirement by making CuckooCache not require external locks
1272 if (scriptExecutionCache
.contains(hashCacheEntry
, !cacheFullScriptStore
)) {
1276 for (unsigned int i
= 0; i
< tx
.vin
.size(); i
++) {
1277 const COutPoint
&prevout
= tx
.vin
[i
].prevout
;
1278 const Coin
& coin
= inputs
.AccessCoin(prevout
);
1279 assert(!coin
.IsSpent());
1281 // We very carefully only pass in things to CScriptCheck which
1282 // are clearly committed to by tx' witness hash. This provides
1283 // a sanity check that our caching is not introducing consensus
1284 // failures through additional data in, eg, the coins being
1285 // spent being checked as a part of CScriptCheck.
1286 const CScript
& scriptPubKey
= coin
.out
.scriptPubKey
;
1287 const CAmount amount
= coin
.out
.nValue
;
1290 CScriptCheck
check(scriptPubKey
, amount
, tx
, i
, flags
, cacheSigStore
, &txdata
);
1292 pvChecks
->push_back(CScriptCheck());
1293 check
.swap(pvChecks
->back());
1294 } else if (!check()) {
1295 if (flags
& STANDARD_NOT_MANDATORY_VERIFY_FLAGS
) {
1296 // Check whether the failure was caused by a
1297 // non-mandatory script verification check, such as
1298 // non-standard DER encodings or non-null dummy
1299 // arguments; if so, don't trigger DoS protection to
1300 // avoid splitting the network between upgraded and
1301 // non-upgraded nodes.
1302 CScriptCheck
check2(scriptPubKey
, amount
, tx
, i
,
1303 flags
& ~STANDARD_NOT_MANDATORY_VERIFY_FLAGS
, cacheSigStore
, &txdata
);
1305 return state
.Invalid(false, REJECT_NONSTANDARD
, strprintf("non-mandatory-script-verify-flag (%s)", ScriptErrorString(check
.GetScriptError())));
1307 // Failures of other flags indicate a transaction that is
1308 // invalid in new blocks, e.g. an invalid P2SH. We DoS ban
1309 // such nodes as they are not following the protocol. That
1310 // said during an upgrade careful thought should be taken
1311 // as to the correct behavior - we may want to continue
1312 // peering with non-upgraded nodes even after soft-fork
1313 // super-majority signaling has occurred.
1314 return state
.DoS(100,false, REJECT_INVALID
, strprintf("mandatory-script-verify-flag-failed (%s)", ScriptErrorString(check
.GetScriptError())));
1318 if (cacheFullScriptStore
&& !pvChecks
) {
1319 // We executed all of the provided scripts, and were told to
1320 // cache the result. Do so now.
1321 scriptExecutionCache
.insert(hashCacheEntry
);
1331 bool UndoWriteToDisk(const CBlockUndo
& blockundo
, CDiskBlockPos
& pos
, const uint256
& hashBlock
, const CMessageHeader::MessageStartChars
& messageStart
)
1333 // Open history file to append
1334 CAutoFile
fileout(OpenUndoFile(pos
), SER_DISK
, CLIENT_VERSION
);
1335 if (fileout
.IsNull())
1336 return error("%s: OpenUndoFile failed", __func__
);
1338 // Write index header
1339 unsigned int nSize
= GetSerializeSize(fileout
, blockundo
);
1340 fileout
<< FLATDATA(messageStart
) << nSize
;
1343 long fileOutPos
= ftell(fileout
.Get());
1345 return error("%s: ftell failed", __func__
);
1346 pos
.nPos
= (unsigned int)fileOutPos
;
1347 fileout
<< blockundo
;
1349 // calculate & write checksum
1350 CHashWriter
hasher(SER_GETHASH
, PROTOCOL_VERSION
);
1351 hasher
<< hashBlock
;
1352 hasher
<< blockundo
;
1353 fileout
<< hasher
.GetHash();
1358 bool UndoReadFromDisk(CBlockUndo
& blockundo
, const CDiskBlockPos
& pos
, const uint256
& hashBlock
)
1360 // Open history file to read
1361 CAutoFile
filein(OpenUndoFile(pos
, true), SER_DISK
, CLIENT_VERSION
);
1362 if (filein
.IsNull())
1363 return error("%s: OpenUndoFile failed", __func__
);
1366 uint256 hashChecksum
;
1367 CHashVerifier
<CAutoFile
> verifier(&filein
); // We need a CHashVerifier as reserializing may lose data
1369 verifier
<< hashBlock
;
1370 verifier
>> blockundo
;
1371 filein
>> hashChecksum
;
1373 catch (const std::exception
& e
) {
1374 return error("%s: Deserialize or I/O error - %s", __func__
, e
.what());
1378 if (hashChecksum
!= verifier
.GetHash())
1379 return error("%s: Checksum mismatch", __func__
);
1384 /** Abort with a message */
1385 bool AbortNode(const std::string
& strMessage
, const std::string
& userMessage
="")
1387 SetMiscWarning(strMessage
);
1388 LogPrintf("*** %s\n", strMessage
);
1389 uiInterface
.ThreadSafeMessageBox(
1390 userMessage
.empty() ? _("Error: A fatal internal error occurred, see debug.log for details") : userMessage
,
1391 "", CClientUIInterface::MSG_ERROR
);
1396 bool AbortNode(CValidationState
& state
, const std::string
& strMessage
, const std::string
& userMessage
="")
1398 AbortNode(strMessage
, userMessage
);
1399 return state
.Error(strMessage
);
1404 enum DisconnectResult
1406 DISCONNECT_OK
, // All good.
1407 DISCONNECT_UNCLEAN
, // Rolled back, but UTXO set was inconsistent with block.
1408 DISCONNECT_FAILED
// Something else went wrong.
1412 * Restore the UTXO in a Coin at a given COutPoint
1413 * @param undo The Coin to be restored.
1414 * @param view The coins view to which to apply the changes.
1415 * @param out The out point that corresponds to the tx input.
1416 * @return A DisconnectResult as an int
1418 int ApplyTxInUndo(Coin
&& undo
, CCoinsViewCache
& view
, const COutPoint
& out
)
1422 if (view
.HaveCoin(out
)) fClean
= false; // overwriting transaction output
1424 if (undo
.nHeight
== 0) {
1425 // Missing undo metadata (height and coinbase). Older versions included this
1426 // information only in undo records for the last spend of a transactions'
1427 // outputs. This implies that it must be present for some other output of the same tx.
1428 const Coin
& alternate
= AccessByTxid(view
, out
.hash
);
1429 if (!alternate
.IsSpent()) {
1430 undo
.nHeight
= alternate
.nHeight
;
1431 undo
.fCoinBase
= alternate
.fCoinBase
;
1433 return DISCONNECT_FAILED
; // adding output for transaction without known metadata
1436 // The potential_overwrite parameter to AddCoin is only allowed to be false if we know for
1437 // sure that the coin did not already exist in the cache. As we have queried for that above
1438 // using HaveCoin, we don't need to guess. When fClean is false, a coin already existed and
1439 // it is an overwrite.
1440 view
.AddCoin(out
, std::move(undo
), !fClean
);
1442 return fClean
? DISCONNECT_OK
: DISCONNECT_UNCLEAN
;
1445 /** Undo the effects of this block (with given index) on the UTXO set represented by coins.
1446 * When FAILED is returned, view is left in an indeterminate state. */
1447 static DisconnectResult
DisconnectBlock(const CBlock
& block
, const CBlockIndex
* pindex
, CCoinsViewCache
& view
)
1451 CBlockUndo blockUndo
;
1452 CDiskBlockPos pos
= pindex
->GetUndoPos();
1454 error("DisconnectBlock(): no undo data available");
1455 return DISCONNECT_FAILED
;
1457 if (!UndoReadFromDisk(blockUndo
, pos
, pindex
->pprev
->GetBlockHash())) {
1458 error("DisconnectBlock(): failure reading undo data");
1459 return DISCONNECT_FAILED
;
1462 if (blockUndo
.vtxundo
.size() + 1 != block
.vtx
.size()) {
1463 error("DisconnectBlock(): block and undo data inconsistent");
1464 return DISCONNECT_FAILED
;
1467 // undo transactions in reverse order
1468 for (int i
= block
.vtx
.size() - 1; i
>= 0; i
--) {
1469 const CTransaction
&tx
= *(block
.vtx
[i
]);
1470 uint256 hash
= tx
.GetHash();
1471 bool is_coinbase
= tx
.IsCoinBase();
1473 // Check that all outputs are available and match the outputs in the block itself
1475 for (size_t o
= 0; o
< tx
.vout
.size(); o
++) {
1476 if (!tx
.vout
[o
].scriptPubKey
.IsUnspendable()) {
1477 COutPoint
out(hash
, o
);
1479 bool is_spent
= view
.SpendCoin(out
, &coin
);
1480 if (!is_spent
|| tx
.vout
[o
] != coin
.out
|| pindex
->nHeight
!= coin
.nHeight
|| is_coinbase
!= coin
.fCoinBase
) {
1481 fClean
= false; // transaction output mismatch
1487 if (i
> 0) { // not coinbases
1488 CTxUndo
&txundo
= blockUndo
.vtxundo
[i
-1];
1489 if (txundo
.vprevout
.size() != tx
.vin
.size()) {
1490 error("DisconnectBlock(): transaction and undo data inconsistent");
1491 return DISCONNECT_FAILED
;
1493 for (unsigned int j
= tx
.vin
.size(); j
-- > 0;) {
1494 const COutPoint
&out
= tx
.vin
[j
].prevout
;
1495 int res
= ApplyTxInUndo(std::move(txundo
.vprevout
[j
]), view
, out
);
1496 if (res
== DISCONNECT_FAILED
) return DISCONNECT_FAILED
;
1497 fClean
= fClean
&& res
!= DISCONNECT_UNCLEAN
;
1499 // At this point, all of txundo.vprevout should have been moved out.
1503 // move best block pointer to prevout block
1504 view
.SetBestBlock(pindex
->pprev
->GetBlockHash());
1506 return fClean
? DISCONNECT_OK
: DISCONNECT_UNCLEAN
;
1509 void static FlushBlockFile(bool fFinalize
= false)
1511 LOCK(cs_LastBlockFile
);
1513 CDiskBlockPos
posOld(nLastBlockFile
, 0);
1515 FILE *fileOld
= OpenBlockFile(posOld
);
1518 TruncateFile(fileOld
, vinfoBlockFile
[nLastBlockFile
].nSize
);
1519 FileCommit(fileOld
);
1523 fileOld
= OpenUndoFile(posOld
);
1526 TruncateFile(fileOld
, vinfoBlockFile
[nLastBlockFile
].nUndoSize
);
1527 FileCommit(fileOld
);
1532 static bool FindUndoPos(CValidationState
&state
, int nFile
, CDiskBlockPos
&pos
, unsigned int nAddSize
);
1534 static CCheckQueue
<CScriptCheck
> scriptcheckqueue(128);
1536 void ThreadScriptCheck() {
1537 RenameThread("bitcoin-scriptch");
1538 scriptcheckqueue
.Thread();
1541 // Protected by cs_main
1542 VersionBitsCache versionbitscache
;
1544 int32_t ComputeBlockVersion(const CBlockIndex
* pindexPrev
, const Consensus::Params
& params
)
1547 int32_t nVersion
= VERSIONBITS_TOP_BITS
;
1549 for (int i
= 0; i
< (int)Consensus::MAX_VERSION_BITS_DEPLOYMENTS
; i
++) {
1550 ThresholdState state
= VersionBitsState(pindexPrev
, params
, (Consensus::DeploymentPos
)i
, versionbitscache
);
1551 if (state
== THRESHOLD_LOCKED_IN
|| state
== THRESHOLD_STARTED
) {
1552 nVersion
|= VersionBitsMask(params
, (Consensus::DeploymentPos
)i
);
1560 * Threshold condition checker that triggers when unknown versionbits are seen on the network.
1562 class WarningBitsConditionChecker
: public AbstractThresholdConditionChecker
1568 explicit WarningBitsConditionChecker(int bitIn
) : bit(bitIn
) {}
1570 int64_t BeginTime(const Consensus::Params
& params
) const override
{ return 0; }
1571 int64_t EndTime(const Consensus::Params
& params
) const override
{ return std::numeric_limits
<int64_t>::max(); }
1572 int Period(const Consensus::Params
& params
) const override
{ return params
.nMinerConfirmationWindow
; }
1573 int Threshold(const Consensus::Params
& params
) const override
{ return params
.nRuleChangeActivationThreshold
; }
1575 bool Condition(const CBlockIndex
* pindex
, const Consensus::Params
& params
) const override
1577 return ((pindex
->nVersion
& VERSIONBITS_TOP_MASK
) == VERSIONBITS_TOP_BITS
) &&
1578 ((pindex
->nVersion
>> bit
) & 1) != 0 &&
1579 ((ComputeBlockVersion(pindex
->pprev
, params
) >> bit
) & 1) == 0;
1583 // Protected by cs_main
1584 static ThresholdConditionCache warningcache
[VERSIONBITS_NUM_BITS
];
1586 static unsigned int GetBlockScriptFlags(const CBlockIndex
* pindex
, const Consensus::Params
& consensusparams
) {
1587 AssertLockHeld(cs_main
);
1589 // BIP16 didn't become active until Apr 1 2012
1590 int64_t nBIP16SwitchTime
= 1333238400;
1591 bool fStrictPayToScriptHash
= (pindex
->GetBlockTime() >= nBIP16SwitchTime
);
1593 unsigned int flags
= fStrictPayToScriptHash
? SCRIPT_VERIFY_P2SH
: SCRIPT_VERIFY_NONE
;
1595 // Start enforcing the DERSIG (BIP66) rule
1596 if (pindex
->nHeight
>= consensusparams
.BIP66Height
) {
1597 flags
|= SCRIPT_VERIFY_DERSIG
;
1600 // Start enforcing CHECKLOCKTIMEVERIFY (BIP65) rule
1601 if (pindex
->nHeight
>= consensusparams
.BIP65Height
) {
1602 flags
|= SCRIPT_VERIFY_CHECKLOCKTIMEVERIFY
;
1605 // Start enforcing BIP68 (sequence locks) and BIP112 (CHECKSEQUENCEVERIFY) using versionbits logic.
1606 if (VersionBitsState(pindex
->pprev
, consensusparams
, Consensus::DEPLOYMENT_CSV
, versionbitscache
) == THRESHOLD_ACTIVE
) {
1607 flags
|= SCRIPT_VERIFY_CHECKSEQUENCEVERIFY
;
1610 // Start enforcing WITNESS rules using versionbits logic.
1611 if (IsWitnessEnabled(pindex
->pprev
, consensusparams
)) {
1612 flags
|= SCRIPT_VERIFY_WITNESS
;
1613 flags
|= SCRIPT_VERIFY_NULLDUMMY
;
1621 static int64_t nTimeCheck
= 0;
1622 static int64_t nTimeForks
= 0;
1623 static int64_t nTimeVerify
= 0;
1624 static int64_t nTimeConnect
= 0;
1625 static int64_t nTimeIndex
= 0;
1626 static int64_t nTimeCallbacks
= 0;
1627 static int64_t nTimeTotal
= 0;
1628 static int64_t nBlocksTotal
= 0;
1630 /** Apply the effects of this block (with given index) on the UTXO set represented by coins.
1631 * Validity checks that depend on the UTXO set are also done; ConnectBlock()
1632 * can fail if those validity checks fail (among other reasons). */
1633 static bool ConnectBlock(const CBlock
& block
, CValidationState
& state
, CBlockIndex
* pindex
,
1634 CCoinsViewCache
& view
, const CChainParams
& chainparams
, bool fJustCheck
= false)
1636 AssertLockHeld(cs_main
);
1638 // pindex->phashBlock can be null if called by CreateNewBlock/TestBlockValidity
1639 assert((pindex
->phashBlock
== nullptr) ||
1640 (*pindex
->phashBlock
== block
.GetHash()));
1641 int64_t nTimeStart
= GetTimeMicros();
1643 // Check it again in case a previous version let a bad block in
1644 if (!CheckBlock(block
, state
, chainparams
.GetConsensus(), !fJustCheck
, !fJustCheck
))
1645 return error("%s: Consensus::CheckBlock: %s", __func__
, FormatStateMessage(state
));
1647 // verify that the view's current state corresponds to the previous block
1648 uint256 hashPrevBlock
= pindex
->pprev
== nullptr ? uint256() : pindex
->pprev
->GetBlockHash();
1649 assert(hashPrevBlock
== view
.GetBestBlock());
1651 // Special case for the genesis block, skipping connection of its transactions
1652 // (its coinbase is unspendable)
1653 if (block
.GetHash() == chainparams
.GetConsensus().hashGenesisBlock
) {
1655 view
.SetBestBlock(pindex
->GetBlockHash());
1661 bool fScriptChecks
= true;
1662 if (!hashAssumeValid
.IsNull()) {
1663 // We've been configured with the hash of a block which has been externally verified to have a valid history.
1664 // A suitable default value is included with the software and updated from time to time. Because validity
1665 // relative to a piece of software is an objective fact these defaults can be easily reviewed.
1666 // This setting doesn't force the selection of any particular chain but makes validating some faster by
1667 // effectively caching the result of part of the verification.
1668 BlockMap::const_iterator it
= mapBlockIndex
.find(hashAssumeValid
);
1669 if (it
!= mapBlockIndex
.end()) {
1670 if (it
->second
->GetAncestor(pindex
->nHeight
) == pindex
&&
1671 pindexBestHeader
->GetAncestor(pindex
->nHeight
) == pindex
&&
1672 pindexBestHeader
->nChainWork
>= nMinimumChainWork
) {
1673 // This block is a member of the assumed verified chain and an ancestor of the best header.
1674 // The equivalent time check discourages hash power from extorting the network via DOS attack
1675 // into accepting an invalid block through telling users they must manually set assumevalid.
1676 // Requiring a software change or burying the invalid block, regardless of the setting, makes
1677 // it hard to hide the implication of the demand. This also avoids having release candidates
1678 // that are hardly doing any signature verification at all in testing without having to
1679 // artificially set the default assumed verified block further back.
1680 // The test against nMinimumChainWork prevents the skipping when denied access to any chain at
1681 // least as good as the expected chain.
1682 fScriptChecks
= (GetBlockProofEquivalentTime(*pindexBestHeader
, *pindex
, *pindexBestHeader
, chainparams
.GetConsensus()) <= 60 * 60 * 24 * 7 * 2);
1687 int64_t nTime1
= GetTimeMicros(); nTimeCheck
+= nTime1
- nTimeStart
;
1688 LogPrint(BCLog::BENCH
, " - Sanity checks: %.2fms [%.2fs (%.2fms/blk)]\n", MILLI
* (nTime1
- nTimeStart
), nTimeCheck
* MICRO
, nTimeCheck
* MILLI
/ nBlocksTotal
);
1690 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1691 // unless those are already completely spent.
1692 // If such overwrites are allowed, coinbases and transactions depending upon those
1693 // can be duplicated to remove the ability to spend the first instance -- even after
1694 // being sent to another address.
1695 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1696 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1697 // already refuses previously-known transaction ids entirely.
1698 // This rule was originally applied to all blocks with a timestamp after March 15, 2012, 0:00 UTC.
1699 // Now that the whole chain is irreversibly beyond that time it is applied to all blocks except the
1700 // two in the chain that violate it. This prevents exploiting the issue against nodes during their
1701 // initial block download.
1702 bool fEnforceBIP30
= (!pindex
->phashBlock
) || // Enforce on CreateNewBlock invocations which don't have a hash.
1703 !((pindex
->nHeight
==91842 && pindex
->GetBlockHash() == uint256S("0x00000000000a4d0a398161ffc163c503763b1f4360639393e0e4c8e300e0caec")) ||
1704 (pindex
->nHeight
==91880 && pindex
->GetBlockHash() == uint256S("0x00000000000743f190a18c5577a3c2d2a1f610ae9601ac046a38084ccb7cd721")));
1706 // Once BIP34 activated it was not possible to create new duplicate coinbases and thus other than starting
1707 // with the 2 existing duplicate coinbase pairs, not possible to create overwriting txs. But by the
1708 // time BIP34 activated, in each of the existing pairs the duplicate coinbase had overwritten the first
1709 // before the first had been spent. Since those coinbases are sufficiently buried its no longer possible to create further
1710 // duplicate transactions descending from the known pairs either.
1711 // 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.
1712 CBlockIndex
*pindexBIP34height
= pindex
->pprev
->GetAncestor(chainparams
.GetConsensus().BIP34Height
);
1713 //Only continue to enforce if we're below BIP34 activation height or the block hash at that height doesn't correspond.
1714 fEnforceBIP30
= fEnforceBIP30
&& (!pindexBIP34height
|| !(pindexBIP34height
->GetBlockHash() == chainparams
.GetConsensus().BIP34Hash
));
1716 if (fEnforceBIP30
) {
1717 for (const auto& tx
: block
.vtx
) {
1718 for (size_t o
= 0; o
< tx
->vout
.size(); o
++) {
1719 if (view
.HaveCoin(COutPoint(tx
->GetHash(), o
))) {
1720 return state
.DoS(100, error("ConnectBlock(): tried to overwrite transaction"),
1721 REJECT_INVALID
, "bad-txns-BIP30");
1727 // Start enforcing BIP68 (sequence locks) and BIP112 (CHECKSEQUENCEVERIFY) using versionbits logic.
1728 int nLockTimeFlags
= 0;
1729 if (VersionBitsState(pindex
->pprev
, chainparams
.GetConsensus(), Consensus::DEPLOYMENT_CSV
, versionbitscache
) == THRESHOLD_ACTIVE
) {
1730 nLockTimeFlags
|= LOCKTIME_VERIFY_SEQUENCE
;
1733 // Get the script flags for this block
1734 unsigned int flags
= GetBlockScriptFlags(pindex
, chainparams
.GetConsensus());
1736 int64_t nTime2
= GetTimeMicros(); nTimeForks
+= nTime2
- nTime1
;
1737 LogPrint(BCLog::BENCH
, " - Fork checks: %.2fms [%.2fs (%.2fms/blk)]\n", MILLI
* (nTime2
- nTime1
), nTimeForks
* MICRO
, nTimeForks
* MILLI
/ nBlocksTotal
);
1739 CBlockUndo blockundo
;
1741 CCheckQueueControl
<CScriptCheck
> control(fScriptChecks
&& nScriptCheckThreads
? &scriptcheckqueue
: nullptr);
1743 std::vector
<int> prevheights
;
1746 int64_t nSigOpsCost
= 0;
1747 CDiskTxPos
pos(pindex
->GetBlockPos(), GetSizeOfCompactSize(block
.vtx
.size()));
1748 std::vector
<std::pair
<uint256
, CDiskTxPos
> > vPos
;
1749 vPos
.reserve(block
.vtx
.size());
1750 blockundo
.vtxundo
.reserve(block
.vtx
.size() - 1);
1751 std::vector
<PrecomputedTransactionData
> txdata
;
1752 txdata
.reserve(block
.vtx
.size()); // Required so that pointers to individual PrecomputedTransactionData don't get invalidated
1753 for (unsigned int i
= 0; i
< block
.vtx
.size(); i
++)
1755 const CTransaction
&tx
= *(block
.vtx
[i
]);
1757 nInputs
+= tx
.vin
.size();
1759 if (!tx
.IsCoinBase())
1761 if (!view
.HaveInputs(tx
))
1762 return state
.DoS(100, error("ConnectBlock(): inputs missing/spent"),
1763 REJECT_INVALID
, "bad-txns-inputs-missingorspent");
1765 // Check that transaction is BIP68 final
1766 // BIP68 lock checks (as opposed to nLockTime checks) must
1767 // be in ConnectBlock because they require the UTXO set
1768 prevheights
.resize(tx
.vin
.size());
1769 for (size_t j
= 0; j
< tx
.vin
.size(); j
++) {
1770 prevheights
[j
] = view
.AccessCoin(tx
.vin
[j
].prevout
).nHeight
;
1773 if (!SequenceLocks(tx
, nLockTimeFlags
, &prevheights
, *pindex
)) {
1774 return state
.DoS(100, error("%s: contains a non-BIP68-final transaction", __func__
),
1775 REJECT_INVALID
, "bad-txns-nonfinal");
1779 // GetTransactionSigOpCost counts 3 types of sigops:
1780 // * legacy (always)
1781 // * p2sh (when P2SH enabled in flags and excludes coinbase)
1782 // * witness (when witness enabled in flags and excludes coinbase)
1783 nSigOpsCost
+= GetTransactionSigOpCost(tx
, view
, flags
);
1784 if (nSigOpsCost
> MAX_BLOCK_SIGOPS_COST
)
1785 return state
.DoS(100, error("ConnectBlock(): too many sigops"),
1786 REJECT_INVALID
, "bad-blk-sigops");
1788 txdata
.emplace_back(tx
);
1789 if (!tx
.IsCoinBase())
1791 nFees
+= view
.GetValueIn(tx
)-tx
.GetValueOut();
1793 std::vector
<CScriptCheck
> vChecks
;
1794 bool fCacheResults
= fJustCheck
; /* Don't cache results if we're actually connecting blocks (still consult the cache, though) */
1795 if (!CheckInputs(tx
, state
, view
, fScriptChecks
, flags
, fCacheResults
, fCacheResults
, txdata
[i
], nScriptCheckThreads
? &vChecks
: nullptr))
1796 return error("ConnectBlock(): CheckInputs on %s failed with %s",
1797 tx
.GetHash().ToString(), FormatStateMessage(state
));
1798 control
.Add(vChecks
);
1803 blockundo
.vtxundo
.push_back(CTxUndo());
1805 UpdateCoins(tx
, view
, i
== 0 ? undoDummy
: blockundo
.vtxundo
.back(), pindex
->nHeight
);
1807 vPos
.push_back(std::make_pair(tx
.GetHash(), pos
));
1808 pos
.nTxOffset
+= ::GetSerializeSize(tx
, SER_DISK
, CLIENT_VERSION
);
1810 int64_t nTime3
= GetTimeMicros(); nTimeConnect
+= nTime3
- nTime2
;
1811 LogPrint(BCLog::BENCH
, " - Connect %u transactions: %.2fms (%.3fms/tx, %.3fms/txin) [%.2fs (%.2fms/blk)]\n", (unsigned)block
.vtx
.size(), MILLI
* (nTime3
- nTime2
), MILLI
* (nTime3
- nTime2
) / block
.vtx
.size(), nInputs
<= 1 ? 0 : MILLI
* (nTime3
- nTime2
) / (nInputs
-1), nTimeConnect
* MICRO
, nTimeConnect
* MILLI
/ nBlocksTotal
);
1813 CAmount blockReward
= nFees
+ GetBlockSubsidy(pindex
->nHeight
, chainparams
.GetConsensus());
1814 if (block
.vtx
[0]->GetValueOut() > blockReward
)
1815 return state
.DoS(100,
1816 error("ConnectBlock(): coinbase pays too much (actual=%d vs limit=%d)",
1817 block
.vtx
[0]->GetValueOut(), blockReward
),
1818 REJECT_INVALID
, "bad-cb-amount");
1820 if (!control
.Wait())
1821 return state
.DoS(100, error("%s: CheckQueue failed", __func__
), REJECT_INVALID
, "block-validation-failed");
1822 int64_t nTime4
= GetTimeMicros(); nTimeVerify
+= nTime4
- nTime2
;
1823 LogPrint(BCLog::BENCH
, " - Verify %u txins: %.2fms (%.3fms/txin) [%.2fs (%.2fms/blk)]\n", nInputs
- 1, MILLI
* (nTime4
- nTime2
), nInputs
<= 1 ? 0 : MILLI
* (nTime4
- nTime2
) / (nInputs
-1), nTimeVerify
* MICRO
, nTimeVerify
* MILLI
/ nBlocksTotal
);
1828 // Write undo information to disk
1829 if (pindex
->GetUndoPos().IsNull() || !pindex
->IsValid(BLOCK_VALID_SCRIPTS
))
1831 if (pindex
->GetUndoPos().IsNull()) {
1833 if (!FindUndoPos(state
, pindex
->nFile
, _pos
, ::GetSerializeSize(blockundo
, SER_DISK
, CLIENT_VERSION
) + 40))
1834 return error("ConnectBlock(): FindUndoPos failed");
1835 if (!UndoWriteToDisk(blockundo
, _pos
, pindex
->pprev
->GetBlockHash(), chainparams
.MessageStart()))
1836 return AbortNode(state
, "Failed to write undo data");
1838 // update nUndoPos in block index
1839 pindex
->nUndoPos
= _pos
.nPos
;
1840 pindex
->nStatus
|= BLOCK_HAVE_UNDO
;
1843 pindex
->RaiseValidity(BLOCK_VALID_SCRIPTS
);
1844 setDirtyBlockIndex
.insert(pindex
);
1848 if (!pblocktree
->WriteTxIndex(vPos
))
1849 return AbortNode(state
, "Failed to write transaction index");
1851 // add this block to the view's block chain
1852 view
.SetBestBlock(pindex
->GetBlockHash());
1854 int64_t nTime5
= GetTimeMicros(); nTimeIndex
+= nTime5
- nTime4
;
1855 LogPrint(BCLog::BENCH
, " - Index writing: %.2fms [%.2fs (%.2fms/blk)]\n", MILLI
* (nTime5
- nTime4
), nTimeIndex
* MICRO
, nTimeIndex
* MILLI
/ nBlocksTotal
);
1857 int64_t nTime6
= GetTimeMicros(); nTimeCallbacks
+= nTime6
- nTime5
;
1858 LogPrint(BCLog::BENCH
, " - Callbacks: %.2fms [%.2fs (%.2fms/blk)]\n", MILLI
* (nTime6
- nTime5
), nTimeCallbacks
* MICRO
, nTimeCallbacks
* MILLI
/ nBlocksTotal
);
1864 * Update the on-disk chain state.
1865 * The caches and indexes are flushed depending on the mode we're called with
1866 * if they're too large, if it's been a while since the last write,
1867 * or always and in all cases if we're in prune mode and are deleting files.
1869 bool static FlushStateToDisk(const CChainParams
& chainparams
, CValidationState
&state
, FlushStateMode mode
, int nManualPruneHeight
) {
1870 int64_t nMempoolUsage
= mempool
.DynamicMemoryUsage();
1872 static int64_t nLastWrite
= 0;
1873 static int64_t nLastFlush
= 0;
1874 static int64_t nLastSetChain
= 0;
1875 std::set
<int> setFilesToPrune
;
1876 bool fFlushForPrune
= false;
1877 bool fDoFullFlush
= false;
1881 LOCK(cs_LastBlockFile
);
1882 if (fPruneMode
&& (fCheckForPruning
|| nManualPruneHeight
> 0) && !fReindex
) {
1883 if (nManualPruneHeight
> 0) {
1884 FindFilesToPruneManual(setFilesToPrune
, nManualPruneHeight
);
1886 FindFilesToPrune(setFilesToPrune
, chainparams
.PruneAfterHeight());
1887 fCheckForPruning
= false;
1889 if (!setFilesToPrune
.empty()) {
1890 fFlushForPrune
= true;
1892 pblocktree
->WriteFlag("prunedblockfiles", true);
1897 nNow
= GetTimeMicros();
1898 // Avoid writing/flushing immediately after startup.
1899 if (nLastWrite
== 0) {
1902 if (nLastFlush
== 0) {
1905 if (nLastSetChain
== 0) {
1906 nLastSetChain
= nNow
;
1908 int64_t nMempoolSizeMax
= gArgs
.GetArg("-maxmempool", DEFAULT_MAX_MEMPOOL_SIZE
) * 1000000;
1909 int64_t cacheSize
= pcoinsTip
->DynamicMemoryUsage();
1910 int64_t nTotalSpace
= nCoinCacheUsage
+ std::max
<int64_t>(nMempoolSizeMax
- nMempoolUsage
, 0);
1911 // 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).
1912 bool fCacheLarge
= mode
== FLUSH_STATE_PERIODIC
&& cacheSize
> std::max((9 * nTotalSpace
) / 10, nTotalSpace
- MAX_BLOCK_COINSDB_USAGE
* 1024 * 1024);
1913 // The cache is over the limit, we have to write now.
1914 bool fCacheCritical
= mode
== FLUSH_STATE_IF_NEEDED
&& cacheSize
> nTotalSpace
;
1915 // 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.
1916 bool fPeriodicWrite
= mode
== FLUSH_STATE_PERIODIC
&& nNow
> nLastWrite
+ (int64_t)DATABASE_WRITE_INTERVAL
* 1000000;
1917 // It's been very long since we flushed the cache. Do this infrequently, to optimize cache usage.
1918 bool fPeriodicFlush
= mode
== FLUSH_STATE_PERIODIC
&& nNow
> nLastFlush
+ (int64_t)DATABASE_FLUSH_INTERVAL
* 1000000;
1919 // Combine all conditions that result in a full cache flush.
1920 fDoFullFlush
= (mode
== FLUSH_STATE_ALWAYS
) || fCacheLarge
|| fCacheCritical
|| fPeriodicFlush
|| fFlushForPrune
;
1921 // Write blocks and block index to disk.
1922 if (fDoFullFlush
|| fPeriodicWrite
) {
1923 // Depend on nMinDiskSpace to ensure we can write block index
1924 if (!CheckDiskSpace(0))
1925 return state
.Error("out of disk space");
1926 // First make sure all block and undo data is flushed to disk.
1928 // Then update all block file information (which may refer to block and undo files).
1930 std::vector
<std::pair
<int, const CBlockFileInfo
*> > vFiles
;
1931 vFiles
.reserve(setDirtyFileInfo
.size());
1932 for (std::set
<int>::iterator it
= setDirtyFileInfo
.begin(); it
!= setDirtyFileInfo
.end(); ) {
1933 vFiles
.push_back(std::make_pair(*it
, &vinfoBlockFile
[*it
]));
1934 setDirtyFileInfo
.erase(it
++);
1936 std::vector
<const CBlockIndex
*> vBlocks
;
1937 vBlocks
.reserve(setDirtyBlockIndex
.size());
1938 for (std::set
<CBlockIndex
*>::iterator it
= setDirtyBlockIndex
.begin(); it
!= setDirtyBlockIndex
.end(); ) {
1939 vBlocks
.push_back(*it
);
1940 setDirtyBlockIndex
.erase(it
++);
1942 if (!pblocktree
->WriteBatchSync(vFiles
, nLastBlockFile
, vBlocks
)) {
1943 return AbortNode(state
, "Failed to write to block index database");
1946 // Finally remove any pruned files
1948 UnlinkPrunedFiles(setFilesToPrune
);
1951 // Flush best chain related state. This can only be done if the blocks / block index write was also done.
1953 // Typical Coin structures on disk are around 48 bytes in size.
1954 // Pushing a new one to the database can cause it to be written
1955 // twice (once in the log, and once in the tables). This is already
1956 // an overestimation, as most will delete an existing entry or
1957 // overwrite one. Still, use a conservative safety factor of 2.
1958 if (!CheckDiskSpace(48 * 2 * 2 * pcoinsTip
->GetCacheSize()))
1959 return state
.Error("out of disk space");
1960 // Flush the chainstate (which may refer to block index entries).
1961 if (!pcoinsTip
->Flush())
1962 return AbortNode(state
, "Failed to write to coin database");
1966 if (fDoFullFlush
|| ((mode
== FLUSH_STATE_ALWAYS
|| mode
== FLUSH_STATE_PERIODIC
) && nNow
> nLastSetChain
+ (int64_t)DATABASE_WRITE_INTERVAL
* 1000000)) {
1967 // Update best block in wallet (so we can detect restored wallets).
1968 GetMainSignals().SetBestChain(chainActive
.GetLocator());
1969 nLastSetChain
= nNow
;
1971 } catch (const std::runtime_error
& e
) {
1972 return AbortNode(state
, std::string("System error while flushing: ") + e
.what());
1977 void FlushStateToDisk() {
1978 CValidationState state
;
1979 const CChainParams
& chainparams
= Params();
1980 FlushStateToDisk(chainparams
, state
, FLUSH_STATE_ALWAYS
);
1983 void PruneAndFlush() {
1984 CValidationState state
;
1985 fCheckForPruning
= true;
1986 const CChainParams
& chainparams
= Params();
1987 FlushStateToDisk(chainparams
, state
, FLUSH_STATE_NONE
);
1990 static void DoWarning(const std::string
& strWarning
)
1992 static bool fWarned
= false;
1993 SetMiscWarning(strWarning
);
1995 AlertNotify(strWarning
);
2000 /** Update chainActive and related internal data structures. */
2001 void static UpdateTip(CBlockIndex
*pindexNew
, const CChainParams
& chainParams
) {
2002 chainActive
.SetTip(pindexNew
);
2005 mempool
.AddTransactionsUpdated(1);
2007 cvBlockChange
.notify_all();
2009 std::vector
<std::string
> warningMessages
;
2010 if (!IsInitialBlockDownload())
2013 const CBlockIndex
* pindex
= chainActive
.Tip();
2014 for (int bit
= 0; bit
< VERSIONBITS_NUM_BITS
; bit
++) {
2015 WarningBitsConditionChecker
checker(bit
);
2016 ThresholdState state
= checker
.GetStateFor(pindex
, chainParams
.GetConsensus(), warningcache
[bit
]);
2017 if (state
== THRESHOLD_ACTIVE
|| state
== THRESHOLD_LOCKED_IN
) {
2018 const std::string strWarning
= strprintf(_("Warning: unknown new rules activated (versionbit %i)"), bit
);
2019 if (state
== THRESHOLD_ACTIVE
) {
2020 DoWarning(strWarning
);
2022 warningMessages
.push_back(strWarning
);
2026 // Check the version of the last 100 blocks to see if we need to upgrade:
2027 for (int i
= 0; i
< 100 && pindex
!= nullptr; i
++)
2029 int32_t nExpectedVersion
= ComputeBlockVersion(pindex
->pprev
, chainParams
.GetConsensus());
2030 if (pindex
->nVersion
> VERSIONBITS_LAST_OLD_BLOCK_VERSION
&& (pindex
->nVersion
& ~nExpectedVersion
) != 0)
2032 pindex
= pindex
->pprev
;
2035 warningMessages
.push_back(strprintf(_("%d of last 100 blocks have unexpected version"), nUpgraded
));
2036 if (nUpgraded
> 100/2)
2038 std::string strWarning
= _("Warning: Unknown block versions being mined! It's possible unknown rules are in effect");
2039 // notify GetWarnings(), called by Qt and the JSON-RPC code to warn the user:
2040 DoWarning(strWarning
);
2043 LogPrintf("%s: new best=%s height=%d version=0x%08x log2_work=%.8g tx=%lu date='%s' progress=%f cache=%.1fMiB(%utxo)", __func__
,
2044 chainActive
.Tip()->GetBlockHash().ToString(), chainActive
.Height(), chainActive
.Tip()->nVersion
,
2045 log(chainActive
.Tip()->nChainWork
.getdouble())/log(2.0), (unsigned long)chainActive
.Tip()->nChainTx
,
2046 DateTimeStrFormat("%Y-%m-%d %H:%M:%S", chainActive
.Tip()->GetBlockTime()),
2047 GuessVerificationProgress(chainParams
.TxData(), chainActive
.Tip()), pcoinsTip
->DynamicMemoryUsage() * (1.0 / (1<<20)), pcoinsTip
->GetCacheSize());
2048 if (!warningMessages
.empty())
2049 LogPrintf(" warning='%s'", boost::algorithm::join(warningMessages
, ", "));
2054 /** Disconnect chainActive's tip.
2055 * After calling, the mempool will be in an inconsistent state, with
2056 * transactions from disconnected blocks being added to disconnectpool. You
2057 * should make the mempool consistent again by calling UpdateMempoolForReorg.
2058 * with cs_main held.
2060 * If disconnectpool is nullptr, then no disconnected transactions are added to
2061 * disconnectpool (note that the caller is responsible for mempool consistency
2064 bool static DisconnectTip(CValidationState
& state
, const CChainParams
& chainparams
, DisconnectedBlockTransactions
*disconnectpool
)
2066 CBlockIndex
*pindexDelete
= chainActive
.Tip();
2067 assert(pindexDelete
);
2068 // Read block from disk.
2069 std::shared_ptr
<CBlock
> pblock
= std::make_shared
<CBlock
>();
2070 CBlock
& block
= *pblock
;
2071 if (!ReadBlockFromDisk(block
, pindexDelete
, chainparams
.GetConsensus()))
2072 return AbortNode(state
, "Failed to read block");
2073 // Apply the block atomically to the chain state.
2074 int64_t nStart
= GetTimeMicros();
2076 CCoinsViewCache
view(pcoinsTip
);
2077 assert(view
.GetBestBlock() == pindexDelete
->GetBlockHash());
2078 if (DisconnectBlock(block
, pindexDelete
, view
) != DISCONNECT_OK
)
2079 return error("DisconnectTip(): DisconnectBlock %s failed", pindexDelete
->GetBlockHash().ToString());
2080 bool flushed
= view
.Flush();
2083 LogPrint(BCLog::BENCH
, "- Disconnect block: %.2fms\n", (GetTimeMicros() - nStart
) * MILLI
);
2084 // Write the chain state to disk, if necessary.
2085 if (!FlushStateToDisk(chainparams
, state
, FLUSH_STATE_IF_NEEDED
))
2088 if (disconnectpool
) {
2089 // Save transactions to re-add to mempool at end of reorg
2090 for (auto it
= block
.vtx
.rbegin(); it
!= block
.vtx
.rend(); ++it
) {
2091 disconnectpool
->addTransaction(*it
);
2093 while (disconnectpool
->DynamicMemoryUsage() > MAX_DISCONNECTED_TX_POOL_SIZE
* 1000) {
2094 // Drop the earliest entry, and remove its children from the mempool.
2095 auto it
= disconnectpool
->queuedTx
.get
<insertion_order
>().begin();
2096 mempool
.removeRecursive(**it
, MemPoolRemovalReason::REORG
);
2097 disconnectpool
->removeEntry(it
);
2101 // Update chainActive and related variables.
2102 UpdateTip(pindexDelete
->pprev
, chainparams
);
2103 // Let wallets know transactions went from 1-confirmed to
2104 // 0-confirmed or conflicted:
2105 GetMainSignals().BlockDisconnected(pblock
);
2109 static int64_t nTimeReadFromDisk
= 0;
2110 static int64_t nTimeConnectTotal
= 0;
2111 static int64_t nTimeFlush
= 0;
2112 static int64_t nTimeChainState
= 0;
2113 static int64_t nTimePostConnect
= 0;
2115 struct PerBlockConnectTrace
{
2116 CBlockIndex
* pindex
= nullptr;
2117 std::shared_ptr
<const CBlock
> pblock
;
2118 std::shared_ptr
<std::vector
<CTransactionRef
>> conflictedTxs
;
2119 PerBlockConnectTrace() : conflictedTxs(std::make_shared
<std::vector
<CTransactionRef
>>()) {}
2122 * Used to track blocks whose transactions were applied to the UTXO state as a
2123 * part of a single ActivateBestChainStep call.
2125 * This class also tracks transactions that are removed from the mempool as
2126 * conflicts (per block) and can be used to pass all those transactions
2127 * through SyncTransaction.
2129 * This class assumes (and asserts) that the conflicted transactions for a given
2130 * block are added via mempool callbacks prior to the BlockConnected() associated
2131 * with those transactions. If any transactions are marked conflicted, it is
2132 * assumed that an associated block will always be added.
2134 * This class is single-use, once you call GetBlocksConnected() you have to throw
2135 * it away and make a new one.
2137 class ConnectTrace
{
2139 std::vector
<PerBlockConnectTrace
> blocksConnected
;
2143 explicit ConnectTrace(CTxMemPool
&_pool
) : blocksConnected(1), pool(_pool
) {
2144 pool
.NotifyEntryRemoved
.connect(boost::bind(&ConnectTrace::NotifyEntryRemoved
, this, _1
, _2
));
2148 pool
.NotifyEntryRemoved
.disconnect(boost::bind(&ConnectTrace::NotifyEntryRemoved
, this, _1
, _2
));
2151 void BlockConnected(CBlockIndex
* pindex
, std::shared_ptr
<const CBlock
> pblock
) {
2152 assert(!blocksConnected
.back().pindex
);
2155 blocksConnected
.back().pindex
= pindex
;
2156 blocksConnected
.back().pblock
= std::move(pblock
);
2157 blocksConnected
.emplace_back();
2160 std::vector
<PerBlockConnectTrace
>& GetBlocksConnected() {
2161 // We always keep one extra block at the end of our list because
2162 // blocks are added after all the conflicted transactions have
2163 // been filled in. Thus, the last entry should always be an empty
2164 // one waiting for the transactions from the next block. We pop
2165 // the last entry here to make sure the list we return is sane.
2166 assert(!blocksConnected
.back().pindex
);
2167 assert(blocksConnected
.back().conflictedTxs
->empty());
2168 blocksConnected
.pop_back();
2169 return blocksConnected
;
2172 void NotifyEntryRemoved(CTransactionRef txRemoved
, MemPoolRemovalReason reason
) {
2173 assert(!blocksConnected
.back().pindex
);
2174 if (reason
== MemPoolRemovalReason::CONFLICT
) {
2175 blocksConnected
.back().conflictedTxs
->emplace_back(std::move(txRemoved
));
2181 * Connect a new block to chainActive. pblock is either nullptr or a pointer to a CBlock
2182 * corresponding to pindexNew, to bypass loading it again from disk.
2184 * The block is added to connectTrace if connection succeeds.
2186 bool static ConnectTip(CValidationState
& state
, const CChainParams
& chainparams
, CBlockIndex
* pindexNew
, const std::shared_ptr
<const CBlock
>& pblock
, ConnectTrace
& connectTrace
, DisconnectedBlockTransactions
&disconnectpool
)
2188 assert(pindexNew
->pprev
== chainActive
.Tip());
2189 // Read block from disk.
2190 int64_t nTime1
= GetTimeMicros();
2191 std::shared_ptr
<const CBlock
> pthisBlock
;
2193 std::shared_ptr
<CBlock
> pblockNew
= std::make_shared
<CBlock
>();
2194 if (!ReadBlockFromDisk(*pblockNew
, pindexNew
, chainparams
.GetConsensus()))
2195 return AbortNode(state
, "Failed to read block");
2196 pthisBlock
= pblockNew
;
2198 pthisBlock
= pblock
;
2200 const CBlock
& blockConnecting
= *pthisBlock
;
2201 // Apply the block atomically to the chain state.
2202 int64_t nTime2
= GetTimeMicros(); nTimeReadFromDisk
+= nTime2
- nTime1
;
2204 LogPrint(BCLog::BENCH
, " - Load block from disk: %.2fms [%.2fs]\n", (nTime2
- nTime1
) * MILLI
, nTimeReadFromDisk
* MICRO
);
2206 CCoinsViewCache
view(pcoinsTip
);
2207 bool rv
= ConnectBlock(blockConnecting
, state
, pindexNew
, view
, chainparams
);
2208 GetMainSignals().BlockChecked(blockConnecting
, state
);
2210 if (state
.IsInvalid())
2211 InvalidBlockFound(pindexNew
, state
);
2212 return error("ConnectTip(): ConnectBlock %s failed", pindexNew
->GetBlockHash().ToString());
2214 nTime3
= GetTimeMicros(); nTimeConnectTotal
+= nTime3
- nTime2
;
2215 LogPrint(BCLog::BENCH
, " - Connect total: %.2fms [%.2fs (%.2fms/blk)]\n", (nTime3
- nTime2
) * MILLI
, nTimeConnectTotal
* MICRO
, nTimeConnectTotal
* MILLI
/ nBlocksTotal
);
2216 bool flushed
= view
.Flush();
2219 int64_t nTime4
= GetTimeMicros(); nTimeFlush
+= nTime4
- nTime3
;
2220 LogPrint(BCLog::BENCH
, " - Flush: %.2fms [%.2fs (%.2fms/blk)]\n", (nTime4
- nTime3
) * MILLI
, nTimeFlush
* MICRO
, nTimeFlush
* MILLI
/ nBlocksTotal
);
2221 // Write the chain state to disk, if necessary.
2222 if (!FlushStateToDisk(chainparams
, state
, FLUSH_STATE_IF_NEEDED
))
2224 int64_t nTime5
= GetTimeMicros(); nTimeChainState
+= nTime5
- nTime4
;
2225 LogPrint(BCLog::BENCH
, " - Writing chainstate: %.2fms [%.2fs (%.2fms/blk)]\n", (nTime5
- nTime4
) * MILLI
, nTimeChainState
* MICRO
, nTimeChainState
* MILLI
/ nBlocksTotal
);
2226 // Remove conflicting transactions from the mempool.;
2227 mempool
.removeForBlock(blockConnecting
.vtx
, pindexNew
->nHeight
);
2228 disconnectpool
.removeForBlock(blockConnecting
.vtx
);
2229 // Update chainActive & related variables.
2230 UpdateTip(pindexNew
, chainparams
);
2232 int64_t nTime6
= GetTimeMicros(); nTimePostConnect
+= nTime6
- nTime5
; nTimeTotal
+= nTime6
- nTime1
;
2233 LogPrint(BCLog::BENCH
, " - Connect postprocess: %.2fms [%.2fs (%.2fms/blk)]\n", (nTime6
- nTime5
) * MILLI
, nTimePostConnect
* MICRO
, nTimePostConnect
* MILLI
/ nBlocksTotal
);
2234 LogPrint(BCLog::BENCH
, "- Connect block: %.2fms [%.2fs (%.2fms/blk)]\n", (nTime6
- nTime1
) * MILLI
, nTimeTotal
* MICRO
, nTimeTotal
* MILLI
/ nBlocksTotal
);
2236 connectTrace
.BlockConnected(pindexNew
, std::move(pthisBlock
));
2241 * Return the tip of the chain with the most work in it, that isn't
2242 * known to be invalid (it's however far from certain to be valid).
2244 static CBlockIndex
* FindMostWorkChain() {
2246 CBlockIndex
*pindexNew
= nullptr;
2248 // Find the best candidate header.
2250 std::set
<CBlockIndex
*, CBlockIndexWorkComparator
>::reverse_iterator it
= setBlockIndexCandidates
.rbegin();
2251 if (it
== setBlockIndexCandidates
.rend())
2256 // Check whether all blocks on the path between the currently active chain and the candidate are valid.
2257 // Just going until the active chain is an optimization, as we know all blocks in it are valid already.
2258 CBlockIndex
*pindexTest
= pindexNew
;
2259 bool fInvalidAncestor
= false;
2260 while (pindexTest
&& !chainActive
.Contains(pindexTest
)) {
2261 assert(pindexTest
->nChainTx
|| pindexTest
->nHeight
== 0);
2263 // Pruned nodes may have entries in setBlockIndexCandidates for
2264 // which block files have been deleted. Remove those as candidates
2265 // for the most work chain if we come across them; we can't switch
2266 // to a chain unless we have all the non-active-chain parent blocks.
2267 bool fFailedChain
= pindexTest
->nStatus
& BLOCK_FAILED_MASK
;
2268 bool fMissingData
= !(pindexTest
->nStatus
& BLOCK_HAVE_DATA
);
2269 if (fFailedChain
|| fMissingData
) {
2270 // Candidate chain is not usable (either invalid or missing data)
2271 if (fFailedChain
&& (pindexBestInvalid
== nullptr || pindexNew
->nChainWork
> pindexBestInvalid
->nChainWork
))
2272 pindexBestInvalid
= pindexNew
;
2273 CBlockIndex
*pindexFailed
= pindexNew
;
2274 // Remove the entire chain from the set.
2275 while (pindexTest
!= pindexFailed
) {
2277 pindexFailed
->nStatus
|= BLOCK_FAILED_CHILD
;
2278 } else if (fMissingData
) {
2279 // If we're missing data, then add back to mapBlocksUnlinked,
2280 // so that if the block arrives in the future we can try adding
2281 // to setBlockIndexCandidates again.
2282 mapBlocksUnlinked
.insert(std::make_pair(pindexFailed
->pprev
, pindexFailed
));
2284 setBlockIndexCandidates
.erase(pindexFailed
);
2285 pindexFailed
= pindexFailed
->pprev
;
2287 setBlockIndexCandidates
.erase(pindexTest
);
2288 fInvalidAncestor
= true;
2291 pindexTest
= pindexTest
->pprev
;
2293 if (!fInvalidAncestor
)
2298 /** Delete all entries in setBlockIndexCandidates that are worse than the current tip. */
2299 static void PruneBlockIndexCandidates() {
2300 // Note that we can't delete the current block itself, as we may need to return to it later in case a
2301 // reorganization to a better block fails.
2302 std::set
<CBlockIndex
*, CBlockIndexWorkComparator
>::iterator it
= setBlockIndexCandidates
.begin();
2303 while (it
!= setBlockIndexCandidates
.end() && setBlockIndexCandidates
.value_comp()(*it
, chainActive
.Tip())) {
2304 setBlockIndexCandidates
.erase(it
++);
2306 // Either the current tip or a successor of it we're working towards is left in setBlockIndexCandidates.
2307 assert(!setBlockIndexCandidates
.empty());
2311 * Try to make some progress towards making pindexMostWork the active block.
2312 * pblock is either nullptr or a pointer to a CBlock corresponding to pindexMostWork.
2314 static bool ActivateBestChainStep(CValidationState
& state
, const CChainParams
& chainparams
, CBlockIndex
* pindexMostWork
, const std::shared_ptr
<const CBlock
>& pblock
, bool& fInvalidFound
, ConnectTrace
& connectTrace
)
2316 AssertLockHeld(cs_main
);
2317 const CBlockIndex
*pindexOldTip
= chainActive
.Tip();
2318 const CBlockIndex
*pindexFork
= chainActive
.FindFork(pindexMostWork
);
2320 // Disconnect active blocks which are no longer in the best chain.
2321 bool fBlocksDisconnected
= false;
2322 DisconnectedBlockTransactions disconnectpool
;
2323 while (chainActive
.Tip() && chainActive
.Tip() != pindexFork
) {
2324 if (!DisconnectTip(state
, chainparams
, &disconnectpool
)) {
2325 // This is likely a fatal error, but keep the mempool consistent,
2326 // just in case. Only remove from the mempool in this case.
2327 UpdateMempoolForReorg(disconnectpool
, false);
2330 fBlocksDisconnected
= true;
2333 // Build list of new blocks to connect.
2334 std::vector
<CBlockIndex
*> vpindexToConnect
;
2335 bool fContinue
= true;
2336 int nHeight
= pindexFork
? pindexFork
->nHeight
: -1;
2337 while (fContinue
&& nHeight
!= pindexMostWork
->nHeight
) {
2338 // Don't iterate the entire list of potential improvements toward the best tip, as we likely only need
2339 // a few blocks along the way.
2340 int nTargetHeight
= std::min(nHeight
+ 32, pindexMostWork
->nHeight
);
2341 vpindexToConnect
.clear();
2342 vpindexToConnect
.reserve(nTargetHeight
- nHeight
);
2343 CBlockIndex
*pindexIter
= pindexMostWork
->GetAncestor(nTargetHeight
);
2344 while (pindexIter
&& pindexIter
->nHeight
!= nHeight
) {
2345 vpindexToConnect
.push_back(pindexIter
);
2346 pindexIter
= pindexIter
->pprev
;
2348 nHeight
= nTargetHeight
;
2350 // Connect new blocks.
2351 for (CBlockIndex
*pindexConnect
: reverse_iterate(vpindexToConnect
)) {
2352 if (!ConnectTip(state
, chainparams
, pindexConnect
, pindexConnect
== pindexMostWork
? pblock
: std::shared_ptr
<const CBlock
>(), connectTrace
, disconnectpool
)) {
2353 if (state
.IsInvalid()) {
2354 // The block violates a consensus rule.
2355 if (!state
.CorruptionPossible())
2356 InvalidChainFound(vpindexToConnect
.back());
2357 state
= CValidationState();
2358 fInvalidFound
= true;
2362 // A system error occurred (disk space, database error, ...).
2363 // Make the mempool consistent with the current tip, just in case
2364 // any observers try to use it before shutdown.
2365 UpdateMempoolForReorg(disconnectpool
, false);
2369 PruneBlockIndexCandidates();
2370 if (!pindexOldTip
|| chainActive
.Tip()->nChainWork
> pindexOldTip
->nChainWork
) {
2371 // We're in a better position than we were. Return temporarily to release the lock.
2379 if (fBlocksDisconnected
) {
2380 // If any blocks were disconnected, disconnectpool may be non empty. Add
2381 // any disconnected transactions back to the mempool.
2382 UpdateMempoolForReorg(disconnectpool
, true);
2384 mempool
.check(pcoinsTip
);
2386 // Callbacks/notifications for a new best chain.
2388 CheckForkWarningConditionsOnNewFork(vpindexToConnect
.back());
2390 CheckForkWarningConditions();
2395 static void NotifyHeaderTip() {
2396 bool fNotify
= false;
2397 bool fInitialBlockDownload
= false;
2398 static CBlockIndex
* pindexHeaderOld
= nullptr;
2399 CBlockIndex
* pindexHeader
= nullptr;
2402 pindexHeader
= pindexBestHeader
;
2404 if (pindexHeader
!= pindexHeaderOld
) {
2406 fInitialBlockDownload
= IsInitialBlockDownload();
2407 pindexHeaderOld
= pindexHeader
;
2410 // Send block tip changed notifications without cs_main
2412 uiInterface
.NotifyHeaderTip(fInitialBlockDownload
, pindexHeader
);
2417 * Make the best chain active, in multiple steps. The result is either failure
2418 * or an activated best chain. pblock is either nullptr or a pointer to a block
2419 * that is already loaded (to avoid loading it again from disk).
2421 bool ActivateBestChain(CValidationState
&state
, const CChainParams
& chainparams
, std::shared_ptr
<const CBlock
> pblock
) {
2422 // Note that while we're often called here from ProcessNewBlock, this is
2423 // far from a guarantee. Things in the P2P/RPC will often end up calling
2424 // us in the middle of ProcessNewBlock - do not assume pblock is set
2425 // sanely for performance or correctness!
2427 CBlockIndex
*pindexMostWork
= nullptr;
2428 CBlockIndex
*pindexNewTip
= nullptr;
2429 int nStopAtHeight
= gArgs
.GetArg("-stopatheight", DEFAULT_STOPATHEIGHT
);
2431 boost::this_thread::interruption_point();
2432 if (ShutdownRequested())
2435 const CBlockIndex
*pindexFork
;
2436 bool fInitialDownload
;
2439 ConnectTrace
connectTrace(mempool
); // Destructed before cs_main is unlocked
2441 CBlockIndex
*pindexOldTip
= chainActive
.Tip();
2442 if (pindexMostWork
== nullptr) {
2443 pindexMostWork
= FindMostWorkChain();
2446 // Whether we have anything to do at all.
2447 if (pindexMostWork
== nullptr || pindexMostWork
== chainActive
.Tip())
2450 bool fInvalidFound
= false;
2451 std::shared_ptr
<const CBlock
> nullBlockPtr
;
2452 if (!ActivateBestChainStep(state
, chainparams
, pindexMostWork
, pblock
&& pblock
->GetHash() == pindexMostWork
->GetBlockHash() ? pblock
: nullBlockPtr
, fInvalidFound
, connectTrace
))
2455 if (fInvalidFound
) {
2456 // Wipe cache, we may need another branch now.
2457 pindexMostWork
= nullptr;
2459 pindexNewTip
= chainActive
.Tip();
2460 pindexFork
= chainActive
.FindFork(pindexOldTip
);
2461 fInitialDownload
= IsInitialBlockDownload();
2463 for (const PerBlockConnectTrace
& trace
: connectTrace
.GetBlocksConnected()) {
2464 assert(trace
.pblock
&& trace
.pindex
);
2465 GetMainSignals().BlockConnected(trace
.pblock
, trace
.pindex
, *trace
.conflictedTxs
);
2468 // When we reach this point, we switched to a new tip (stored in pindexNewTip).
2470 // Notifications/callbacks that can run without cs_main
2472 // Notify external listeners about the new tip.
2473 GetMainSignals().UpdatedBlockTip(pindexNewTip
, pindexFork
, fInitialDownload
);
2475 // Always notify the UI if a new block tip was connected
2476 if (pindexFork
!= pindexNewTip
) {
2477 uiInterface
.NotifyBlockTip(fInitialDownload
, pindexNewTip
);
2480 if (nStopAtHeight
&& pindexNewTip
&& pindexNewTip
->nHeight
>= nStopAtHeight
) StartShutdown();
2481 } while (pindexNewTip
!= pindexMostWork
);
2482 CheckBlockIndex(chainparams
.GetConsensus());
2484 // Write changes periodically to disk, after relay.
2485 if (!FlushStateToDisk(chainparams
, state
, FLUSH_STATE_PERIODIC
)) {
2493 bool PreciousBlock(CValidationState
& state
, const CChainParams
& params
, CBlockIndex
*pindex
)
2497 if (pindex
->nChainWork
< chainActive
.Tip()->nChainWork
) {
2498 // Nothing to do, this block is not at the tip.
2501 if (chainActive
.Tip()->nChainWork
> nLastPreciousChainwork
) {
2502 // The chain has been extended since the last call, reset the counter.
2503 nBlockReverseSequenceId
= -1;
2505 nLastPreciousChainwork
= chainActive
.Tip()->nChainWork
;
2506 setBlockIndexCandidates
.erase(pindex
);
2507 pindex
->nSequenceId
= nBlockReverseSequenceId
;
2508 if (nBlockReverseSequenceId
> std::numeric_limits
<int32_t>::min()) {
2509 // We can't keep reducing the counter if somebody really wants to
2510 // call preciousblock 2**31-1 times on the same set of tips...
2511 nBlockReverseSequenceId
--;
2513 if (pindex
->IsValid(BLOCK_VALID_TRANSACTIONS
) && pindex
->nChainTx
) {
2514 setBlockIndexCandidates
.insert(pindex
);
2515 PruneBlockIndexCandidates();
2519 return ActivateBestChain(state
, params
);
2522 bool InvalidateBlock(CValidationState
& state
, const CChainParams
& chainparams
, CBlockIndex
*pindex
)
2524 AssertLockHeld(cs_main
);
2526 // Mark the block itself as invalid.
2527 pindex
->nStatus
|= BLOCK_FAILED_VALID
;
2528 setDirtyBlockIndex
.insert(pindex
);
2529 setBlockIndexCandidates
.erase(pindex
);
2531 DisconnectedBlockTransactions disconnectpool
;
2532 while (chainActive
.Contains(pindex
)) {
2533 CBlockIndex
*pindexWalk
= chainActive
.Tip();
2534 pindexWalk
->nStatus
|= BLOCK_FAILED_CHILD
;
2535 setDirtyBlockIndex
.insert(pindexWalk
);
2536 setBlockIndexCandidates
.erase(pindexWalk
);
2537 // ActivateBestChain considers blocks already in chainActive
2538 // unconditionally valid already, so force disconnect away from it.
2539 if (!DisconnectTip(state
, chainparams
, &disconnectpool
)) {
2540 // It's probably hopeless to try to make the mempool consistent
2541 // here if DisconnectTip failed, but we can try.
2542 UpdateMempoolForReorg(disconnectpool
, false);
2547 // DisconnectTip will add transactions to disconnectpool; try to add these
2548 // back to the mempool.
2549 UpdateMempoolForReorg(disconnectpool
, true);
2551 // The resulting new best tip may not be in setBlockIndexCandidates anymore, so
2553 BlockMap::iterator it
= mapBlockIndex
.begin();
2554 while (it
!= mapBlockIndex
.end()) {
2555 if (it
->second
->IsValid(BLOCK_VALID_TRANSACTIONS
) && it
->second
->nChainTx
&& !setBlockIndexCandidates
.value_comp()(it
->second
, chainActive
.Tip())) {
2556 setBlockIndexCandidates
.insert(it
->second
);
2561 InvalidChainFound(pindex
);
2562 uiInterface
.NotifyBlockTip(IsInitialBlockDownload(), pindex
->pprev
);
2566 bool ResetBlockFailureFlags(CBlockIndex
*pindex
) {
2567 AssertLockHeld(cs_main
);
2569 int nHeight
= pindex
->nHeight
;
2571 // Remove the invalidity flag from this block and all its descendants.
2572 BlockMap::iterator it
= mapBlockIndex
.begin();
2573 while (it
!= mapBlockIndex
.end()) {
2574 if (!it
->second
->IsValid() && it
->second
->GetAncestor(nHeight
) == pindex
) {
2575 it
->second
->nStatus
&= ~BLOCK_FAILED_MASK
;
2576 setDirtyBlockIndex
.insert(it
->second
);
2577 if (it
->second
->IsValid(BLOCK_VALID_TRANSACTIONS
) && it
->second
->nChainTx
&& setBlockIndexCandidates
.value_comp()(chainActive
.Tip(), it
->second
)) {
2578 setBlockIndexCandidates
.insert(it
->second
);
2580 if (it
->second
== pindexBestInvalid
) {
2581 // Reset invalid block marker if it was pointing to one of those.
2582 pindexBestInvalid
= nullptr;
2588 // Remove the invalidity flag from all ancestors too.
2589 while (pindex
!= nullptr) {
2590 if (pindex
->nStatus
& BLOCK_FAILED_MASK
) {
2591 pindex
->nStatus
&= ~BLOCK_FAILED_MASK
;
2592 setDirtyBlockIndex
.insert(pindex
);
2594 pindex
= pindex
->pprev
;
2599 static CBlockIndex
* AddToBlockIndex(const CBlockHeader
& block
)
2601 // Check for duplicate
2602 uint256 hash
= block
.GetHash();
2603 BlockMap::iterator it
= mapBlockIndex
.find(hash
);
2604 if (it
!= mapBlockIndex
.end())
2607 // Construct new block index object
2608 CBlockIndex
* pindexNew
= new CBlockIndex(block
);
2610 // We assign the sequence id to blocks only when the full data is available,
2611 // to avoid miners withholding blocks but broadcasting headers, to get a
2612 // competitive advantage.
2613 pindexNew
->nSequenceId
= 0;
2614 BlockMap::iterator mi
= mapBlockIndex
.insert(std::make_pair(hash
, pindexNew
)).first
;
2615 pindexNew
->phashBlock
= &((*mi
).first
);
2616 BlockMap::iterator miPrev
= mapBlockIndex
.find(block
.hashPrevBlock
);
2617 if (miPrev
!= mapBlockIndex
.end())
2619 pindexNew
->pprev
= (*miPrev
).second
;
2620 pindexNew
->nHeight
= pindexNew
->pprev
->nHeight
+ 1;
2621 pindexNew
->BuildSkip();
2623 pindexNew
->nTimeMax
= (pindexNew
->pprev
? std::max(pindexNew
->pprev
->nTimeMax
, pindexNew
->nTime
) : pindexNew
->nTime
);
2624 pindexNew
->nChainWork
= (pindexNew
->pprev
? pindexNew
->pprev
->nChainWork
: 0) + GetBlockProof(*pindexNew
);
2625 pindexNew
->RaiseValidity(BLOCK_VALID_TREE
);
2626 if (pindexBestHeader
== nullptr || pindexBestHeader
->nChainWork
< pindexNew
->nChainWork
)
2627 pindexBestHeader
= pindexNew
;
2629 setDirtyBlockIndex
.insert(pindexNew
);
2634 /** Mark a block as having its data received and checked (up to BLOCK_VALID_TRANSACTIONS). */
2635 static bool ReceivedBlockTransactions(const CBlock
&block
, CValidationState
& state
, CBlockIndex
*pindexNew
, const CDiskBlockPos
& pos
, const Consensus::Params
& consensusParams
)
2637 pindexNew
->nTx
= block
.vtx
.size();
2638 pindexNew
->nChainTx
= 0;
2639 pindexNew
->nFile
= pos
.nFile
;
2640 pindexNew
->nDataPos
= pos
.nPos
;
2641 pindexNew
->nUndoPos
= 0;
2642 pindexNew
->nStatus
|= BLOCK_HAVE_DATA
;
2643 if (IsWitnessEnabled(pindexNew
->pprev
, consensusParams
)) {
2644 pindexNew
->nStatus
|= BLOCK_OPT_WITNESS
;
2646 pindexNew
->RaiseValidity(BLOCK_VALID_TRANSACTIONS
);
2647 setDirtyBlockIndex
.insert(pindexNew
);
2649 if (pindexNew
->pprev
== nullptr || pindexNew
->pprev
->nChainTx
) {
2650 // If pindexNew is the genesis block or all parents are BLOCK_VALID_TRANSACTIONS.
2651 std::deque
<CBlockIndex
*> queue
;
2652 queue
.push_back(pindexNew
);
2654 // Recursively process any descendant blocks that now may be eligible to be connected.
2655 while (!queue
.empty()) {
2656 CBlockIndex
*pindex
= queue
.front();
2658 pindex
->nChainTx
= (pindex
->pprev
? pindex
->pprev
->nChainTx
: 0) + pindex
->nTx
;
2660 LOCK(cs_nBlockSequenceId
);
2661 pindex
->nSequenceId
= nBlockSequenceId
++;
2663 if (chainActive
.Tip() == nullptr || !setBlockIndexCandidates
.value_comp()(pindex
, chainActive
.Tip())) {
2664 setBlockIndexCandidates
.insert(pindex
);
2666 std::pair
<std::multimap
<CBlockIndex
*, CBlockIndex
*>::iterator
, std::multimap
<CBlockIndex
*, CBlockIndex
*>::iterator
> range
= mapBlocksUnlinked
.equal_range(pindex
);
2667 while (range
.first
!= range
.second
) {
2668 std::multimap
<CBlockIndex
*, CBlockIndex
*>::iterator it
= range
.first
;
2669 queue
.push_back(it
->second
);
2671 mapBlocksUnlinked
.erase(it
);
2675 if (pindexNew
->pprev
&& pindexNew
->pprev
->IsValid(BLOCK_VALID_TREE
)) {
2676 mapBlocksUnlinked
.insert(std::make_pair(pindexNew
->pprev
, pindexNew
));
2683 static bool FindBlockPos(CValidationState
&state
, CDiskBlockPos
&pos
, unsigned int nAddSize
, unsigned int nHeight
, uint64_t nTime
, bool fKnown
= false)
2685 LOCK(cs_LastBlockFile
);
2687 unsigned int nFile
= fKnown
? pos
.nFile
: nLastBlockFile
;
2688 if (vinfoBlockFile
.size() <= nFile
) {
2689 vinfoBlockFile
.resize(nFile
+ 1);
2693 while (vinfoBlockFile
[nFile
].nSize
+ nAddSize
>= MAX_BLOCKFILE_SIZE
) {
2695 if (vinfoBlockFile
.size() <= nFile
) {
2696 vinfoBlockFile
.resize(nFile
+ 1);
2700 pos
.nPos
= vinfoBlockFile
[nFile
].nSize
;
2703 if ((int)nFile
!= nLastBlockFile
) {
2705 LogPrintf("Leaving block file %i: %s\n", nLastBlockFile
, vinfoBlockFile
[nLastBlockFile
].ToString());
2707 FlushBlockFile(!fKnown
);
2708 nLastBlockFile
= nFile
;
2711 vinfoBlockFile
[nFile
].AddBlock(nHeight
, nTime
);
2713 vinfoBlockFile
[nFile
].nSize
= std::max(pos
.nPos
+ nAddSize
, vinfoBlockFile
[nFile
].nSize
);
2715 vinfoBlockFile
[nFile
].nSize
+= nAddSize
;
2718 unsigned int nOldChunks
= (pos
.nPos
+ BLOCKFILE_CHUNK_SIZE
- 1) / BLOCKFILE_CHUNK_SIZE
;
2719 unsigned int nNewChunks
= (vinfoBlockFile
[nFile
].nSize
+ BLOCKFILE_CHUNK_SIZE
- 1) / BLOCKFILE_CHUNK_SIZE
;
2720 if (nNewChunks
> nOldChunks
) {
2722 fCheckForPruning
= true;
2723 if (CheckDiskSpace(nNewChunks
* BLOCKFILE_CHUNK_SIZE
- pos
.nPos
)) {
2724 FILE *file
= OpenBlockFile(pos
);
2726 LogPrintf("Pre-allocating up to position 0x%x in blk%05u.dat\n", nNewChunks
* BLOCKFILE_CHUNK_SIZE
, pos
.nFile
);
2727 AllocateFileRange(file
, pos
.nPos
, nNewChunks
* BLOCKFILE_CHUNK_SIZE
- pos
.nPos
);
2732 return state
.Error("out of disk space");
2736 setDirtyFileInfo
.insert(nFile
);
2740 static bool FindUndoPos(CValidationState
&state
, int nFile
, CDiskBlockPos
&pos
, unsigned int nAddSize
)
2744 LOCK(cs_LastBlockFile
);
2746 unsigned int nNewSize
;
2747 pos
.nPos
= vinfoBlockFile
[nFile
].nUndoSize
;
2748 nNewSize
= vinfoBlockFile
[nFile
].nUndoSize
+= nAddSize
;
2749 setDirtyFileInfo
.insert(nFile
);
2751 unsigned int nOldChunks
= (pos
.nPos
+ UNDOFILE_CHUNK_SIZE
- 1) / UNDOFILE_CHUNK_SIZE
;
2752 unsigned int nNewChunks
= (nNewSize
+ UNDOFILE_CHUNK_SIZE
- 1) / UNDOFILE_CHUNK_SIZE
;
2753 if (nNewChunks
> nOldChunks
) {
2755 fCheckForPruning
= true;
2756 if (CheckDiskSpace(nNewChunks
* UNDOFILE_CHUNK_SIZE
- pos
.nPos
)) {
2757 FILE *file
= OpenUndoFile(pos
);
2759 LogPrintf("Pre-allocating up to position 0x%x in rev%05u.dat\n", nNewChunks
* UNDOFILE_CHUNK_SIZE
, pos
.nFile
);
2760 AllocateFileRange(file
, pos
.nPos
, nNewChunks
* UNDOFILE_CHUNK_SIZE
- pos
.nPos
);
2765 return state
.Error("out of disk space");
2771 static bool CheckBlockHeader(const CBlockHeader
& block
, CValidationState
& state
, const Consensus::Params
& consensusParams
, bool fCheckPOW
= true)
2773 // Check proof of work matches claimed amount
2774 if (fCheckPOW
&& !CheckProofOfWork(block
.GetHash(), block
.nBits
, consensusParams
))
2775 return state
.DoS(50, false, REJECT_INVALID
, "high-hash", false, "proof of work failed");
2780 bool CheckBlock(const CBlock
& block
, CValidationState
& state
, const Consensus::Params
& consensusParams
, bool fCheckPOW
, bool fCheckMerkleRoot
)
2782 // These are checks that are independent of context.
2787 // Check that the header is valid (particularly PoW). This is mostly
2788 // redundant with the call in AcceptBlockHeader.
2789 if (!CheckBlockHeader(block
, state
, consensusParams
, fCheckPOW
))
2792 // Check the merkle root.
2793 if (fCheckMerkleRoot
) {
2795 uint256 hashMerkleRoot2
= BlockMerkleRoot(block
, &mutated
);
2796 if (block
.hashMerkleRoot
!= hashMerkleRoot2
)
2797 return state
.DoS(100, false, REJECT_INVALID
, "bad-txnmrklroot", true, "hashMerkleRoot mismatch");
2799 // Check for merkle tree malleability (CVE-2012-2459): repeating sequences
2800 // of transactions in a block without affecting the merkle root of a block,
2801 // while still invalidating it.
2803 return state
.DoS(100, false, REJECT_INVALID
, "bad-txns-duplicate", true, "duplicate transaction");
2806 // All potential-corruption validation must be done before we do any
2807 // transaction validation, as otherwise we may mark the header as invalid
2808 // because we receive the wrong transactions for it.
2809 // Note that witness malleability is checked in ContextualCheckBlock, so no
2810 // checks that use witness data may be performed here.
2813 if (block
.vtx
.empty() || block
.vtx
.size() * WITNESS_SCALE_FACTOR
> MAX_BLOCK_WEIGHT
|| ::GetSerializeSize(block
, SER_NETWORK
, PROTOCOL_VERSION
| SERIALIZE_TRANSACTION_NO_WITNESS
) * WITNESS_SCALE_FACTOR
> MAX_BLOCK_WEIGHT
)
2814 return state
.DoS(100, false, REJECT_INVALID
, "bad-blk-length", false, "size limits failed");
2816 // First transaction must be coinbase, the rest must not be
2817 if (block
.vtx
.empty() || !block
.vtx
[0]->IsCoinBase())
2818 return state
.DoS(100, false, REJECT_INVALID
, "bad-cb-missing", false, "first tx is not coinbase");
2819 for (unsigned int i
= 1; i
< block
.vtx
.size(); i
++)
2820 if (block
.vtx
[i
]->IsCoinBase())
2821 return state
.DoS(100, false, REJECT_INVALID
, "bad-cb-multiple", false, "more than one coinbase");
2823 // Check transactions
2824 for (const auto& tx
: block
.vtx
)
2825 if (!CheckTransaction(*tx
, state
, false))
2826 return state
.Invalid(false, state
.GetRejectCode(), state
.GetRejectReason(),
2827 strprintf("Transaction check failed (tx hash %s) %s", tx
->GetHash().ToString(), state
.GetDebugMessage()));
2829 unsigned int nSigOps
= 0;
2830 for (const auto& tx
: block
.vtx
)
2832 nSigOps
+= GetLegacySigOpCount(*tx
);
2834 if (nSigOps
* WITNESS_SCALE_FACTOR
> MAX_BLOCK_SIGOPS_COST
)
2835 return state
.DoS(100, false, REJECT_INVALID
, "bad-blk-sigops", false, "out-of-bounds SigOpCount");
2837 if (fCheckPOW
&& fCheckMerkleRoot
)
2838 block
.fChecked
= true;
2843 bool IsWitnessEnabled(const CBlockIndex
* pindexPrev
, const Consensus::Params
& params
)
2846 return (VersionBitsState(pindexPrev
, params
, Consensus::DEPLOYMENT_SEGWIT
, versionbitscache
) == THRESHOLD_ACTIVE
);
2849 // Compute at which vout of the block's coinbase transaction the witness
2850 // commitment occurs, or -1 if not found.
2851 static int GetWitnessCommitmentIndex(const CBlock
& block
)
2854 if (!block
.vtx
.empty()) {
2855 for (size_t o
= 0; o
< block
.vtx
[0]->vout
.size(); o
++) {
2856 if (block
.vtx
[0]->vout
[o
].scriptPubKey
.size() >= 38 && block
.vtx
[0]->vout
[o
].scriptPubKey
[0] == OP_RETURN
&& block
.vtx
[0]->vout
[o
].scriptPubKey
[1] == 0x24 && block
.vtx
[0]->vout
[o
].scriptPubKey
[2] == 0xaa && block
.vtx
[0]->vout
[o
].scriptPubKey
[3] == 0x21 && block
.vtx
[0]->vout
[o
].scriptPubKey
[4] == 0xa9 && block
.vtx
[0]->vout
[o
].scriptPubKey
[5] == 0xed) {
2864 void UpdateUncommittedBlockStructures(CBlock
& block
, const CBlockIndex
* pindexPrev
, const Consensus::Params
& consensusParams
)
2866 int commitpos
= GetWitnessCommitmentIndex(block
);
2867 static const std::vector
<unsigned char> nonce(32, 0x00);
2868 if (commitpos
!= -1 && IsWitnessEnabled(pindexPrev
, consensusParams
) && !block
.vtx
[0]->HasWitness()) {
2869 CMutableTransaction
tx(*block
.vtx
[0]);
2870 tx
.vin
[0].scriptWitness
.stack
.resize(1);
2871 tx
.vin
[0].scriptWitness
.stack
[0] = nonce
;
2872 block
.vtx
[0] = MakeTransactionRef(std::move(tx
));
2876 std::vector
<unsigned char> GenerateCoinbaseCommitment(CBlock
& block
, const CBlockIndex
* pindexPrev
, const Consensus::Params
& consensusParams
)
2878 std::vector
<unsigned char> commitment
;
2879 int commitpos
= GetWitnessCommitmentIndex(block
);
2880 std::vector
<unsigned char> ret(32, 0x00);
2881 if (consensusParams
.vDeployments
[Consensus::DEPLOYMENT_SEGWIT
].nTimeout
!= 0) {
2882 if (commitpos
== -1) {
2883 uint256 witnessroot
= BlockWitnessMerkleRoot(block
, nullptr);
2884 CHash256().Write(witnessroot
.begin(), 32).Write(ret
.data(), 32).Finalize(witnessroot
.begin());
2887 out
.scriptPubKey
.resize(38);
2888 out
.scriptPubKey
[0] = OP_RETURN
;
2889 out
.scriptPubKey
[1] = 0x24;
2890 out
.scriptPubKey
[2] = 0xaa;
2891 out
.scriptPubKey
[3] = 0x21;
2892 out
.scriptPubKey
[4] = 0xa9;
2893 out
.scriptPubKey
[5] = 0xed;
2894 memcpy(&out
.scriptPubKey
[6], witnessroot
.begin(), 32);
2895 commitment
= std::vector
<unsigned char>(out
.scriptPubKey
.begin(), out
.scriptPubKey
.end());
2896 CMutableTransaction
tx(*block
.vtx
[0]);
2897 tx
.vout
.push_back(out
);
2898 block
.vtx
[0] = MakeTransactionRef(std::move(tx
));
2901 UpdateUncommittedBlockStructures(block
, pindexPrev
, consensusParams
);
2905 /** Context-dependent validity checks.
2906 * By "context", we mean only the previous block headers, but not the UTXO
2907 * set; UTXO-related validity checks are done in ConnectBlock(). */
2908 static bool ContextualCheckBlockHeader(const CBlockHeader
& block
, CValidationState
& state
, const CChainParams
& params
, const CBlockIndex
* pindexPrev
, int64_t nAdjustedTime
)
2910 assert(pindexPrev
!= nullptr);
2911 const int nHeight
= pindexPrev
->nHeight
+ 1;
2913 // Check proof of work
2914 const Consensus::Params
& consensusParams
= params
.GetConsensus();
2915 if (block
.nBits
!= GetNextWorkRequired(pindexPrev
, &block
, consensusParams
))
2916 return state
.DoS(100, false, REJECT_INVALID
, "bad-diffbits", false, "incorrect proof of work");
2918 // Check against checkpoints
2919 if (fCheckpointsEnabled
) {
2920 // Don't accept any forks from the main chain prior to last checkpoint.
2921 // GetLastCheckpoint finds the last checkpoint in MapCheckpoints that's in our
2923 CBlockIndex
* pcheckpoint
= Checkpoints::GetLastCheckpoint(params
.Checkpoints());
2924 if (pcheckpoint
&& nHeight
< pcheckpoint
->nHeight
)
2925 return state
.DoS(100, error("%s: forked chain older than last checkpoint (height %d)", __func__
, nHeight
), REJECT_CHECKPOINT
, "bad-fork-prior-to-checkpoint");
2928 // Check timestamp against prev
2929 if (block
.GetBlockTime() <= pindexPrev
->GetMedianTimePast())
2930 return state
.Invalid(false, REJECT_INVALID
, "time-too-old", "block's timestamp is too early");
2933 if (block
.GetBlockTime() > nAdjustedTime
+ MAX_FUTURE_BLOCK_TIME
)
2934 return state
.Invalid(false, REJECT_INVALID
, "time-too-new", "block timestamp too far in the future");
2936 // Reject outdated version blocks when 95% (75% on testnet) of the network has upgraded:
2937 // check for version 2, 3 and 4 upgrades
2938 if((block
.nVersion
< 2 && nHeight
>= consensusParams
.BIP34Height
) ||
2939 (block
.nVersion
< 3 && nHeight
>= consensusParams
.BIP66Height
) ||
2940 (block
.nVersion
< 4 && nHeight
>= consensusParams
.BIP65Height
))
2941 return state
.Invalid(false, REJECT_OBSOLETE
, strprintf("bad-version(0x%08x)", block
.nVersion
),
2942 strprintf("rejected nVersion=0x%08x block", block
.nVersion
));
2947 static bool ContextualCheckBlock(const CBlock
& block
, CValidationState
& state
, const Consensus::Params
& consensusParams
, const CBlockIndex
* pindexPrev
)
2949 const int nHeight
= pindexPrev
== nullptr ? 0 : pindexPrev
->nHeight
+ 1;
2951 // Start enforcing BIP113 (Median Time Past) using versionbits logic.
2952 int nLockTimeFlags
= 0;
2953 if (VersionBitsState(pindexPrev
, consensusParams
, Consensus::DEPLOYMENT_CSV
, versionbitscache
) == THRESHOLD_ACTIVE
) {
2954 nLockTimeFlags
|= LOCKTIME_MEDIAN_TIME_PAST
;
2957 int64_t nLockTimeCutoff
= (nLockTimeFlags
& LOCKTIME_MEDIAN_TIME_PAST
)
2958 ? pindexPrev
->GetMedianTimePast()
2959 : block
.GetBlockTime();
2961 // Check that all transactions are finalized
2962 for (const auto& tx
: block
.vtx
) {
2963 if (!IsFinalTx(*tx
, nHeight
, nLockTimeCutoff
)) {
2964 return state
.DoS(10, false, REJECT_INVALID
, "bad-txns-nonfinal", false, "non-final transaction");
2968 // Enforce rule that the coinbase starts with serialized block height
2969 if (nHeight
>= consensusParams
.BIP34Height
)
2971 CScript expect
= CScript() << nHeight
;
2972 if (block
.vtx
[0]->vin
[0].scriptSig
.size() < expect
.size() ||
2973 !std::equal(expect
.begin(), expect
.end(), block
.vtx
[0]->vin
[0].scriptSig
.begin())) {
2974 return state
.DoS(100, false, REJECT_INVALID
, "bad-cb-height", false, "block height mismatch in coinbase");
2978 // Validation for witness commitments.
2979 // * We compute the witness hash (which is the hash including witnesses) of all the block's transactions, except the
2980 // coinbase (where 0x0000....0000 is used instead).
2981 // * The coinbase scriptWitness is a stack of a single 32-byte vector, containing a witness nonce (unconstrained).
2982 // * We build a merkle tree with all those witness hashes as leaves (similar to the hashMerkleRoot in the block header).
2983 // * There must be at least one output whose scriptPubKey is a single 36-byte push, the first 4 bytes of which are
2984 // {0xaa, 0x21, 0xa9, 0xed}, and the following 32 bytes are SHA256^2(witness root, witness nonce). In case there are
2985 // multiple, the last one is used.
2986 bool fHaveWitness
= false;
2987 if (VersionBitsState(pindexPrev
, consensusParams
, Consensus::DEPLOYMENT_SEGWIT
, versionbitscache
) == THRESHOLD_ACTIVE
) {
2988 int commitpos
= GetWitnessCommitmentIndex(block
);
2989 if (commitpos
!= -1) {
2990 bool malleated
= false;
2991 uint256 hashWitness
= BlockWitnessMerkleRoot(block
, &malleated
);
2992 // The malleation check is ignored; as the transaction tree itself
2993 // already does not permit it, it is impossible to trigger in the
2995 if (block
.vtx
[0]->vin
[0].scriptWitness
.stack
.size() != 1 || block
.vtx
[0]->vin
[0].scriptWitness
.stack
[0].size() != 32) {
2996 return state
.DoS(100, false, REJECT_INVALID
, "bad-witness-nonce-size", true, strprintf("%s : invalid witness nonce size", __func__
));
2998 CHash256().Write(hashWitness
.begin(), 32).Write(&block
.vtx
[0]->vin
[0].scriptWitness
.stack
[0][0], 32).Finalize(hashWitness
.begin());
2999 if (memcmp(hashWitness
.begin(), &block
.vtx
[0]->vout
[commitpos
].scriptPubKey
[6], 32)) {
3000 return state
.DoS(100, false, REJECT_INVALID
, "bad-witness-merkle-match", true, strprintf("%s : witness merkle commitment mismatch", __func__
));
3002 fHaveWitness
= true;
3006 // No witness data is allowed in blocks that don't commit to witness data, as this would otherwise leave room for spam
3007 if (!fHaveWitness
) {
3008 for (const auto& tx
: block
.vtx
) {
3009 if (tx
->HasWitness()) {
3010 return state
.DoS(100, false, REJECT_INVALID
, "unexpected-witness", true, strprintf("%s : unexpected witness data found", __func__
));
3015 // After the coinbase witness nonce and commitment are verified,
3016 // we can check if the block weight passes (before we've checked the
3017 // coinbase witness, it would be possible for the weight to be too
3018 // large by filling up the coinbase witness, which doesn't change
3019 // the block hash, so we couldn't mark the block as permanently
3021 if (GetBlockWeight(block
) > MAX_BLOCK_WEIGHT
) {
3022 return state
.DoS(100, false, REJECT_INVALID
, "bad-blk-weight", false, strprintf("%s : weight limit failed", __func__
));
3028 static bool AcceptBlockHeader(const CBlockHeader
& block
, CValidationState
& state
, const CChainParams
& chainparams
, CBlockIndex
** ppindex
)
3030 AssertLockHeld(cs_main
);
3031 // Check for duplicate
3032 uint256 hash
= block
.GetHash();
3033 BlockMap::iterator miSelf
= mapBlockIndex
.find(hash
);
3034 CBlockIndex
*pindex
= nullptr;
3035 if (hash
!= chainparams
.GetConsensus().hashGenesisBlock
) {
3037 if (miSelf
!= mapBlockIndex
.end()) {
3038 // Block header is already known.
3039 pindex
= miSelf
->second
;
3042 if (pindex
->nStatus
& BLOCK_FAILED_MASK
)
3043 return state
.Invalid(error("%s: block %s is marked invalid", __func__
, hash
.ToString()), 0, "duplicate");
3047 if (!CheckBlockHeader(block
, state
, chainparams
.GetConsensus()))
3048 return error("%s: Consensus::CheckBlockHeader: %s, %s", __func__
, hash
.ToString(), FormatStateMessage(state
));
3050 // Get prev block index
3051 CBlockIndex
* pindexPrev
= nullptr;
3052 BlockMap::iterator mi
= mapBlockIndex
.find(block
.hashPrevBlock
);
3053 if (mi
== mapBlockIndex
.end())
3054 return state
.DoS(10, error("%s: prev block not found", __func__
), 0, "prev-blk-not-found");
3055 pindexPrev
= (*mi
).second
;
3056 if (pindexPrev
->nStatus
& BLOCK_FAILED_MASK
)
3057 return state
.DoS(100, error("%s: prev block invalid", __func__
), REJECT_INVALID
, "bad-prevblk");
3058 if (!ContextualCheckBlockHeader(block
, state
, chainparams
, pindexPrev
, GetAdjustedTime()))
3059 return error("%s: Consensus::ContextualCheckBlockHeader: %s, %s", __func__
, hash
.ToString(), FormatStateMessage(state
));
3061 if (pindex
== nullptr)
3062 pindex
= AddToBlockIndex(block
);
3067 CheckBlockIndex(chainparams
.GetConsensus());
3072 // Exposed wrapper for AcceptBlockHeader
3073 bool ProcessNewBlockHeaders(const std::vector
<CBlockHeader
>& headers
, CValidationState
& state
, const CChainParams
& chainparams
, const CBlockIndex
** ppindex
)
3077 for (const CBlockHeader
& header
: headers
) {
3078 CBlockIndex
*pindex
= nullptr; // Use a temp pindex instead of ppindex to avoid a const_cast
3079 if (!AcceptBlockHeader(header
, state
, chainparams
, &pindex
)) {
3091 /** Store block on disk. If dbp is non-nullptr, the file is known to already reside on disk */
3092 static bool AcceptBlock(const std::shared_ptr
<const CBlock
>& pblock
, CValidationState
& state
, const CChainParams
& chainparams
, CBlockIndex
** ppindex
, bool fRequested
, const CDiskBlockPos
* dbp
, bool* fNewBlock
)
3094 const CBlock
& block
= *pblock
;
3096 if (fNewBlock
) *fNewBlock
= false;
3097 AssertLockHeld(cs_main
);
3099 CBlockIndex
*pindexDummy
= nullptr;
3100 CBlockIndex
*&pindex
= ppindex
? *ppindex
: pindexDummy
;
3102 if (!AcceptBlockHeader(block
, state
, chainparams
, &pindex
))
3105 // Try to process all requested blocks that we don't have, but only
3106 // process an unrequested block if it's new and has enough work to
3107 // advance our tip, and isn't too many blocks ahead.
3108 bool fAlreadyHave
= pindex
->nStatus
& BLOCK_HAVE_DATA
;
3109 bool fHasMoreWork
= (chainActive
.Tip() ? pindex
->nChainWork
> chainActive
.Tip()->nChainWork
: true);
3110 // Blocks that are too out-of-order needlessly limit the effectiveness of
3111 // pruning, because pruning will not delete block files that contain any
3112 // blocks which are too close in height to the tip. Apply this test
3113 // regardless of whether pruning is enabled; it should generally be safe to
3114 // not process unrequested blocks.
3115 bool fTooFarAhead
= (pindex
->nHeight
> int(chainActive
.Height() + MIN_BLOCKS_TO_KEEP
));
3117 // TODO: Decouple this function from the block download logic by removing fRequested
3118 // This requires some new chain data structure to efficiently look up if a
3119 // block is in a chain leading to a candidate for best tip, despite not
3120 // being such a candidate itself.
3122 // TODO: deal better with return value and error conditions for duplicate
3123 // and unrequested blocks.
3124 if (fAlreadyHave
) return true;
3125 if (!fRequested
) { // If we didn't ask for it:
3126 if (pindex
->nTx
!= 0) return true; // This is a previously-processed block that was pruned
3127 if (!fHasMoreWork
) return true; // Don't process less-work chains
3128 if (fTooFarAhead
) return true; // Block height is too high
3130 if (fNewBlock
) *fNewBlock
= true;
3132 if (!CheckBlock(block
, state
, chainparams
.GetConsensus()) ||
3133 !ContextualCheckBlock(block
, state
, chainparams
.GetConsensus(), pindex
->pprev
)) {
3134 if (state
.IsInvalid() && !state
.CorruptionPossible()) {
3135 pindex
->nStatus
|= BLOCK_FAILED_VALID
;
3136 setDirtyBlockIndex
.insert(pindex
);
3138 return error("%s: %s", __func__
, FormatStateMessage(state
));
3141 // Header is valid/has work, merkle tree and segwit merkle tree are good...RELAY NOW
3142 // (but if it does not build on our best tip, let the SendMessages loop relay it)
3143 if (!IsInitialBlockDownload() && chainActive
.Tip() == pindex
->pprev
)
3144 GetMainSignals().NewPoWValidBlock(pindex
, pblock
);
3146 int nHeight
= pindex
->nHeight
;
3148 // Write block to history file
3150 unsigned int nBlockSize
= ::GetSerializeSize(block
, SER_DISK
, CLIENT_VERSION
);
3151 CDiskBlockPos blockPos
;
3154 if (!FindBlockPos(state
, blockPos
, nBlockSize
+8, nHeight
, block
.GetBlockTime(), dbp
!= nullptr))
3155 return error("AcceptBlock(): FindBlockPos failed");
3157 if (!WriteBlockToDisk(block
, blockPos
, chainparams
.MessageStart()))
3158 AbortNode(state
, "Failed to write block");
3159 if (!ReceivedBlockTransactions(block
, state
, pindex
, blockPos
, chainparams
.GetConsensus()))
3160 return error("AcceptBlock(): ReceivedBlockTransactions failed");
3161 } catch (const std::runtime_error
& e
) {
3162 return AbortNode(state
, std::string("System error: ") + e
.what());
3165 if (fCheckForPruning
)
3166 FlushStateToDisk(chainparams
, state
, FLUSH_STATE_NONE
); // we just allocated more disk space for block files
3171 bool ProcessNewBlock(const CChainParams
& chainparams
, const std::shared_ptr
<const CBlock
> pblock
, bool fForceProcessing
, bool *fNewBlock
)
3174 CBlockIndex
*pindex
= nullptr;
3175 if (fNewBlock
) *fNewBlock
= false;
3176 CValidationState state
;
3177 // Ensure that CheckBlock() passes before calling AcceptBlock, as
3178 // belt-and-suspenders.
3179 bool ret
= CheckBlock(*pblock
, state
, chainparams
.GetConsensus());
3185 ret
= AcceptBlock(pblock
, state
, chainparams
, &pindex
, fForceProcessing
, nullptr, fNewBlock
);
3187 CheckBlockIndex(chainparams
.GetConsensus());
3189 GetMainSignals().BlockChecked(*pblock
, state
);
3190 return error("%s: AcceptBlock FAILED", __func__
);
3196 CValidationState state
; // Only used to report errors, not invalidity - ignore it
3197 if (!ActivateBestChain(state
, chainparams
, pblock
))
3198 return error("%s: ActivateBestChain failed", __func__
);
3203 bool TestBlockValidity(CValidationState
& state
, const CChainParams
& chainparams
, const CBlock
& block
, CBlockIndex
* pindexPrev
, bool fCheckPOW
, bool fCheckMerkleRoot
)
3205 AssertLockHeld(cs_main
);
3206 assert(pindexPrev
&& pindexPrev
== chainActive
.Tip());
3207 CCoinsViewCache
viewNew(pcoinsTip
);
3208 CBlockIndex
indexDummy(block
);
3209 indexDummy
.pprev
= pindexPrev
;
3210 indexDummy
.nHeight
= pindexPrev
->nHeight
+ 1;
3212 // NOTE: CheckBlockHeader is called by CheckBlock
3213 if (!ContextualCheckBlockHeader(block
, state
, chainparams
, pindexPrev
, GetAdjustedTime()))
3214 return error("%s: Consensus::ContextualCheckBlockHeader: %s", __func__
, FormatStateMessage(state
));
3215 if (!CheckBlock(block
, state
, chainparams
.GetConsensus(), fCheckPOW
, fCheckMerkleRoot
))
3216 return error("%s: Consensus::CheckBlock: %s", __func__
, FormatStateMessage(state
));
3217 if (!ContextualCheckBlock(block
, state
, chainparams
.GetConsensus(), pindexPrev
))
3218 return error("%s: Consensus::ContextualCheckBlock: %s", __func__
, FormatStateMessage(state
));
3219 if (!ConnectBlock(block
, state
, &indexDummy
, viewNew
, chainparams
, true))
3221 assert(state
.IsValid());
3227 * BLOCK PRUNING CODE
3230 /* Calculate the amount of disk space the block & undo files currently use */
3231 static uint64_t CalculateCurrentUsage()
3233 uint64_t retval
= 0;
3234 for (const CBlockFileInfo
&file
: vinfoBlockFile
) {
3235 retval
+= file
.nSize
+ file
.nUndoSize
;
3240 /* Prune a block file (modify associated database entries)*/
3241 void PruneOneBlockFile(const int fileNumber
)
3243 for (BlockMap::iterator it
= mapBlockIndex
.begin(); it
!= mapBlockIndex
.end(); ++it
) {
3244 CBlockIndex
* pindex
= it
->second
;
3245 if (pindex
->nFile
== fileNumber
) {
3246 pindex
->nStatus
&= ~BLOCK_HAVE_DATA
;
3247 pindex
->nStatus
&= ~BLOCK_HAVE_UNDO
;
3249 pindex
->nDataPos
= 0;
3250 pindex
->nUndoPos
= 0;
3251 setDirtyBlockIndex
.insert(pindex
);
3253 // Prune from mapBlocksUnlinked -- any block we prune would have
3254 // to be downloaded again in order to consider its chain, at which
3255 // point it would be considered as a candidate for
3256 // mapBlocksUnlinked or setBlockIndexCandidates.
3257 std::pair
<std::multimap
<CBlockIndex
*, CBlockIndex
*>::iterator
, std::multimap
<CBlockIndex
*, CBlockIndex
*>::iterator
> range
= mapBlocksUnlinked
.equal_range(pindex
->pprev
);
3258 while (range
.first
!= range
.second
) {
3259 std::multimap
<CBlockIndex
*, CBlockIndex
*>::iterator _it
= range
.first
;
3261 if (_it
->second
== pindex
) {
3262 mapBlocksUnlinked
.erase(_it
);
3268 vinfoBlockFile
[fileNumber
].SetNull();
3269 setDirtyFileInfo
.insert(fileNumber
);
3273 void UnlinkPrunedFiles(const std::set
<int>& setFilesToPrune
)
3275 for (std::set
<int>::iterator it
= setFilesToPrune
.begin(); it
!= setFilesToPrune
.end(); ++it
) {
3276 CDiskBlockPos
pos(*it
, 0);
3277 fs::remove(GetBlockPosFilename(pos
, "blk"));
3278 fs::remove(GetBlockPosFilename(pos
, "rev"));
3279 LogPrintf("Prune: %s deleted blk/rev (%05u)\n", __func__
, *it
);
3283 /* Calculate the block/rev files to delete based on height specified by user with RPC command pruneblockchain */
3284 static void FindFilesToPruneManual(std::set
<int>& setFilesToPrune
, int nManualPruneHeight
)
3286 assert(fPruneMode
&& nManualPruneHeight
> 0);
3288 LOCK2(cs_main
, cs_LastBlockFile
);
3289 if (chainActive
.Tip() == nullptr)
3292 // last block to prune is the lesser of (user-specified height, MIN_BLOCKS_TO_KEEP from the tip)
3293 unsigned int nLastBlockWeCanPrune
= std::min((unsigned)nManualPruneHeight
, chainActive
.Tip()->nHeight
- MIN_BLOCKS_TO_KEEP
);
3295 for (int fileNumber
= 0; fileNumber
< nLastBlockFile
; fileNumber
++) {
3296 if (vinfoBlockFile
[fileNumber
].nSize
== 0 || vinfoBlockFile
[fileNumber
].nHeightLast
> nLastBlockWeCanPrune
)
3298 PruneOneBlockFile(fileNumber
);
3299 setFilesToPrune
.insert(fileNumber
);
3302 LogPrintf("Prune (Manual): prune_height=%d removed %d blk/rev pairs\n", nLastBlockWeCanPrune
, count
);
3305 /* This function is called from the RPC code for pruneblockchain */
3306 void PruneBlockFilesManual(int nManualPruneHeight
)
3308 CValidationState state
;
3309 const CChainParams
& chainparams
= Params();
3310 FlushStateToDisk(chainparams
, state
, FLUSH_STATE_NONE
, nManualPruneHeight
);
3314 * Prune block and undo files (blk???.dat and undo???.dat) so that the disk space used is less than a user-defined target.
3315 * The user sets the target (in MB) on the command line or in config file. This will be run on startup and whenever new
3316 * space is allocated in a block or undo file, staying below the target. Changing back to unpruned requires a reindex
3317 * (which in this case means the blockchain must be re-downloaded.)
3319 * Pruning functions are called from FlushStateToDisk when the global fCheckForPruning flag has been set.
3320 * Block and undo files are deleted in lock-step (when blk00003.dat is deleted, so is rev00003.dat.)
3321 * Pruning cannot take place until the longest chain is at least a certain length (100000 on mainnet, 1000 on testnet, 1000 on regtest).
3322 * Pruning will never delete a block within a defined distance (currently 288) from the active chain's tip.
3323 * The block index is updated by unsetting HAVE_DATA and HAVE_UNDO for any blocks that were stored in the deleted files.
3324 * A db flag records the fact that at least some block files have been pruned.
3326 * @param[out] setFilesToPrune The set of file indices that can be unlinked will be returned
3328 static void FindFilesToPrune(std::set
<int>& setFilesToPrune
, uint64_t nPruneAfterHeight
)
3330 LOCK2(cs_main
, cs_LastBlockFile
);
3331 if (chainActive
.Tip() == nullptr || nPruneTarget
== 0) {
3334 if ((uint64_t)chainActive
.Tip()->nHeight
<= nPruneAfterHeight
) {
3338 unsigned int nLastBlockWeCanPrune
= chainActive
.Tip()->nHeight
- MIN_BLOCKS_TO_KEEP
;
3339 uint64_t nCurrentUsage
= CalculateCurrentUsage();
3340 // We don't check to prune until after we've allocated new space for files
3341 // So we should leave a buffer under our target to account for another allocation
3342 // before the next pruning.
3343 uint64_t nBuffer
= BLOCKFILE_CHUNK_SIZE
+ UNDOFILE_CHUNK_SIZE
;
3344 uint64_t nBytesToPrune
;
3347 if (nCurrentUsage
+ nBuffer
>= nPruneTarget
) {
3348 for (int fileNumber
= 0; fileNumber
< nLastBlockFile
; fileNumber
++) {
3349 nBytesToPrune
= vinfoBlockFile
[fileNumber
].nSize
+ vinfoBlockFile
[fileNumber
].nUndoSize
;
3351 if (vinfoBlockFile
[fileNumber
].nSize
== 0)
3354 if (nCurrentUsage
+ nBuffer
< nPruneTarget
) // are we below our target?
3357 // don't prune files that could have a block within MIN_BLOCKS_TO_KEEP of the main chain's tip but keep scanning
3358 if (vinfoBlockFile
[fileNumber
].nHeightLast
> nLastBlockWeCanPrune
)
3361 PruneOneBlockFile(fileNumber
);
3362 // Queue up the files for removal
3363 setFilesToPrune
.insert(fileNumber
);
3364 nCurrentUsage
-= nBytesToPrune
;
3369 LogPrint(BCLog::PRUNE
, "Prune: target=%dMiB actual=%dMiB diff=%dMiB max_prune_height=%d removed %d blk/rev pairs\n",
3370 nPruneTarget
/1024/1024, nCurrentUsage
/1024/1024,
3371 ((int64_t)nPruneTarget
- (int64_t)nCurrentUsage
)/1024/1024,
3372 nLastBlockWeCanPrune
, count
);
3375 bool CheckDiskSpace(uint64_t nAdditionalBytes
)
3377 uint64_t nFreeBytesAvailable
= fs::space(GetDataDir()).available
;
3379 // Check for nMinDiskSpace bytes (currently 50MB)
3380 if (nFreeBytesAvailable
< nMinDiskSpace
+ nAdditionalBytes
)
3381 return AbortNode("Disk space is low!", _("Error: Disk space is low!"));
3386 static FILE* OpenDiskFile(const CDiskBlockPos
&pos
, const char *prefix
, bool fReadOnly
)
3390 fs::path path
= GetBlockPosFilename(pos
, prefix
);
3391 fs::create_directories(path
.parent_path());
3392 FILE* file
= fsbridge::fopen(path
, "rb+");
3393 if (!file
&& !fReadOnly
)
3394 file
= fsbridge::fopen(path
, "wb+");
3396 LogPrintf("Unable to open file %s\n", path
.string());
3400 if (fseek(file
, pos
.nPos
, SEEK_SET
)) {
3401 LogPrintf("Unable to seek to position %u of %s\n", pos
.nPos
, path
.string());
3409 FILE* OpenBlockFile(const CDiskBlockPos
&pos
, bool fReadOnly
) {
3410 return OpenDiskFile(pos
, "blk", fReadOnly
);
3413 /** Open an undo file (rev?????.dat) */
3414 static FILE* OpenUndoFile(const CDiskBlockPos
&pos
, bool fReadOnly
) {
3415 return OpenDiskFile(pos
, "rev", fReadOnly
);
3418 fs::path
GetBlockPosFilename(const CDiskBlockPos
&pos
, const char *prefix
)
3420 return GetDataDir() / "blocks" / strprintf("%s%05u.dat", prefix
, pos
.nFile
);
3423 CBlockIndex
* InsertBlockIndex(uint256 hash
)
3429 BlockMap::iterator mi
= mapBlockIndex
.find(hash
);
3430 if (mi
!= mapBlockIndex
.end())
3431 return (*mi
).second
;
3434 CBlockIndex
* pindexNew
= new CBlockIndex();
3436 throw std::runtime_error(std::string(__func__
) + ": new CBlockIndex failed");
3437 mi
= mapBlockIndex
.insert(std::make_pair(hash
, pindexNew
)).first
;
3438 pindexNew
->phashBlock
= &((*mi
).first
);
3443 bool static LoadBlockIndexDB(const CChainParams
& chainparams
)
3445 if (!pblocktree
->LoadBlockIndexGuts(chainparams
.GetConsensus(), InsertBlockIndex
))
3448 boost::this_thread::interruption_point();
3450 // Calculate nChainWork
3451 std::vector
<std::pair
<int, CBlockIndex
*> > vSortedByHeight
;
3452 vSortedByHeight
.reserve(mapBlockIndex
.size());
3453 for (const std::pair
<uint256
, CBlockIndex
*>& item
: mapBlockIndex
)
3455 CBlockIndex
* pindex
= item
.second
;
3456 vSortedByHeight
.push_back(std::make_pair(pindex
->nHeight
, pindex
));
3458 sort(vSortedByHeight
.begin(), vSortedByHeight
.end());
3459 for (const std::pair
<int, CBlockIndex
*>& item
: vSortedByHeight
)
3461 CBlockIndex
* pindex
= item
.second
;
3462 pindex
->nChainWork
= (pindex
->pprev
? pindex
->pprev
->nChainWork
: 0) + GetBlockProof(*pindex
);
3463 pindex
->nTimeMax
= (pindex
->pprev
? std::max(pindex
->pprev
->nTimeMax
, pindex
->nTime
) : pindex
->nTime
);
3464 // We can link the chain of blocks for which we've received transactions at some point.
3465 // Pruned nodes may have deleted the block.
3466 if (pindex
->nTx
> 0) {
3467 if (pindex
->pprev
) {
3468 if (pindex
->pprev
->nChainTx
) {
3469 pindex
->nChainTx
= pindex
->pprev
->nChainTx
+ pindex
->nTx
;
3471 pindex
->nChainTx
= 0;
3472 mapBlocksUnlinked
.insert(std::make_pair(pindex
->pprev
, pindex
));
3475 pindex
->nChainTx
= pindex
->nTx
;
3478 if (pindex
->IsValid(BLOCK_VALID_TRANSACTIONS
) && (pindex
->nChainTx
|| pindex
->pprev
== nullptr))
3479 setBlockIndexCandidates
.insert(pindex
);
3480 if (pindex
->nStatus
& BLOCK_FAILED_MASK
&& (!pindexBestInvalid
|| pindex
->nChainWork
> pindexBestInvalid
->nChainWork
))
3481 pindexBestInvalid
= pindex
;
3483 pindex
->BuildSkip();
3484 if (pindex
->IsValid(BLOCK_VALID_TREE
) && (pindexBestHeader
== nullptr || CBlockIndexWorkComparator()(pindexBestHeader
, pindex
)))
3485 pindexBestHeader
= pindex
;
3488 // Load block file info
3489 pblocktree
->ReadLastBlockFile(nLastBlockFile
);
3490 vinfoBlockFile
.resize(nLastBlockFile
+ 1);
3491 LogPrintf("%s: last block file = %i\n", __func__
, nLastBlockFile
);
3492 for (int nFile
= 0; nFile
<= nLastBlockFile
; nFile
++) {
3493 pblocktree
->ReadBlockFileInfo(nFile
, vinfoBlockFile
[nFile
]);
3495 LogPrintf("%s: last block file info: %s\n", __func__
, vinfoBlockFile
[nLastBlockFile
].ToString());
3496 for (int nFile
= nLastBlockFile
+ 1; true; nFile
++) {
3497 CBlockFileInfo info
;
3498 if (pblocktree
->ReadBlockFileInfo(nFile
, info
)) {
3499 vinfoBlockFile
.push_back(info
);
3505 // Check presence of blk files
3506 LogPrintf("Checking all blk files are present...\n");
3507 std::set
<int> setBlkDataFiles
;
3508 for (const std::pair
<uint256
, CBlockIndex
*>& item
: mapBlockIndex
)
3510 CBlockIndex
* pindex
= item
.second
;
3511 if (pindex
->nStatus
& BLOCK_HAVE_DATA
) {
3512 setBlkDataFiles
.insert(pindex
->nFile
);
3515 for (std::set
<int>::iterator it
= setBlkDataFiles
.begin(); it
!= setBlkDataFiles
.end(); it
++)
3517 CDiskBlockPos
pos(*it
, 0);
3518 if (CAutoFile(OpenBlockFile(pos
, true), SER_DISK
, CLIENT_VERSION
).IsNull()) {
3523 // Check whether we have ever pruned block & undo files
3524 pblocktree
->ReadFlag("prunedblockfiles", fHavePruned
);
3526 LogPrintf("LoadBlockIndexDB(): Block files have previously been pruned\n");
3528 // Check whether we need to continue reindexing
3529 bool fReindexing
= false;
3530 pblocktree
->ReadReindexing(fReindexing
);
3531 fReindex
|= fReindexing
;
3533 // Check whether we have a transaction index
3534 pblocktree
->ReadFlag("txindex", fTxIndex
);
3535 LogPrintf("%s: transaction index %s\n", __func__
, fTxIndex
? "enabled" : "disabled");
3540 bool LoadChainTip(const CChainParams
& chainparams
)
3542 if (chainActive
.Tip() && chainActive
.Tip()->GetBlockHash() == pcoinsTip
->GetBestBlock()) return true;
3544 if (pcoinsTip
->GetBestBlock().IsNull() && mapBlockIndex
.size() == 1) {
3545 // In case we just added the genesis block, connect it now, so
3546 // that we always have a chainActive.Tip() when we return.
3547 LogPrintf("%s: Connecting genesis block...\n", __func__
);
3548 CValidationState state
;
3549 if (!ActivateBestChain(state
, chainparams
)) {
3554 // Load pointer to end of best chain
3555 BlockMap::iterator it
= mapBlockIndex
.find(pcoinsTip
->GetBestBlock());
3556 if (it
== mapBlockIndex
.end())
3558 chainActive
.SetTip(it
->second
);
3560 PruneBlockIndexCandidates();
3562 LogPrintf("Loaded best chain: hashBestChain=%s height=%d date=%s progress=%f\n",
3563 chainActive
.Tip()->GetBlockHash().ToString(), chainActive
.Height(),
3564 DateTimeStrFormat("%Y-%m-%d %H:%M:%S", chainActive
.Tip()->GetBlockTime()),
3565 GuessVerificationProgress(chainparams
.TxData(), chainActive
.Tip()));
3569 CVerifyDB::CVerifyDB()
3571 uiInterface
.ShowProgress(_("Verifying blocks..."), 0);
3574 CVerifyDB::~CVerifyDB()
3576 uiInterface
.ShowProgress("", 100);
3579 bool CVerifyDB::VerifyDB(const CChainParams
& chainparams
, CCoinsView
*coinsview
, int nCheckLevel
, int nCheckDepth
)
3582 if (chainActive
.Tip() == nullptr || chainActive
.Tip()->pprev
== nullptr)
3585 // Verify blocks in the best chain
3586 if (nCheckDepth
<= 0 || nCheckDepth
> chainActive
.Height())
3587 nCheckDepth
= chainActive
.Height();
3588 nCheckLevel
= std::max(0, std::min(4, nCheckLevel
));
3589 LogPrintf("Verifying last %i blocks at level %i\n", nCheckDepth
, nCheckLevel
);
3590 CCoinsViewCache
coins(coinsview
);
3591 CBlockIndex
* pindexState
= chainActive
.Tip();
3592 CBlockIndex
* pindexFailure
= nullptr;
3593 int nGoodTransactions
= 0;
3594 CValidationState state
;
3596 LogPrintf("[0%%]...");
3597 for (CBlockIndex
* pindex
= chainActive
.Tip(); pindex
&& pindex
->pprev
; pindex
= pindex
->pprev
)
3599 boost::this_thread::interruption_point();
3600 int percentageDone
= std::max(1, std::min(99, (int)(((double)(chainActive
.Height() - pindex
->nHeight
)) / (double)nCheckDepth
* (nCheckLevel
>= 4 ? 50 : 100))));
3601 if (reportDone
< percentageDone
/10) {
3602 // report every 10% step
3603 LogPrintf("[%d%%]...", percentageDone
);
3604 reportDone
= percentageDone
/10;
3606 uiInterface
.ShowProgress(_("Verifying blocks..."), percentageDone
);
3607 if (pindex
->nHeight
< chainActive
.Height()-nCheckDepth
)
3609 if (fPruneMode
&& !(pindex
->nStatus
& BLOCK_HAVE_DATA
)) {
3610 // If pruning, only go back as far as we have data.
3611 LogPrintf("VerifyDB(): block verification stopping at height %d (pruning, no data)\n", pindex
->nHeight
);
3615 // check level 0: read from disk
3616 if (!ReadBlockFromDisk(block
, pindex
, chainparams
.GetConsensus()))
3617 return error("VerifyDB(): *** ReadBlockFromDisk failed at %d, hash=%s", pindex
->nHeight
, pindex
->GetBlockHash().ToString());
3618 // check level 1: verify block validity
3619 if (nCheckLevel
>= 1 && !CheckBlock(block
, state
, chainparams
.GetConsensus()))
3620 return error("%s: *** found bad block at %d, hash=%s (%s)\n", __func__
,
3621 pindex
->nHeight
, pindex
->GetBlockHash().ToString(), FormatStateMessage(state
));
3622 // check level 2: verify undo validity
3623 if (nCheckLevel
>= 2 && pindex
) {
3625 CDiskBlockPos pos
= pindex
->GetUndoPos();
3626 if (!pos
.IsNull()) {
3627 if (!UndoReadFromDisk(undo
, pos
, pindex
->pprev
->GetBlockHash()))
3628 return error("VerifyDB(): *** found bad undo data at %d, hash=%s\n", pindex
->nHeight
, pindex
->GetBlockHash().ToString());
3631 // check level 3: check for inconsistencies during memory-only disconnect of tip blocks
3632 if (nCheckLevel
>= 3 && pindex
== pindexState
&& (coins
.DynamicMemoryUsage() + pcoinsTip
->DynamicMemoryUsage()) <= nCoinCacheUsage
) {
3633 assert(coins
.GetBestBlock() == pindex
->GetBlockHash());
3634 DisconnectResult res
= DisconnectBlock(block
, pindex
, coins
);
3635 if (res
== DISCONNECT_FAILED
) {
3636 return error("VerifyDB(): *** irrecoverable inconsistency in block data at %d, hash=%s", pindex
->nHeight
, pindex
->GetBlockHash().ToString());
3638 pindexState
= pindex
->pprev
;
3639 if (res
== DISCONNECT_UNCLEAN
) {
3640 nGoodTransactions
= 0;
3641 pindexFailure
= pindex
;
3643 nGoodTransactions
+= block
.vtx
.size();
3646 if (ShutdownRequested())
3650 return error("VerifyDB(): *** coin database inconsistencies found (last %i blocks, %i good transactions before that)\n", chainActive
.Height() - pindexFailure
->nHeight
+ 1, nGoodTransactions
);
3652 // check level 4: try reconnecting blocks
3653 if (nCheckLevel
>= 4) {
3654 CBlockIndex
*pindex
= pindexState
;
3655 while (pindex
!= chainActive
.Tip()) {
3656 boost::this_thread::interruption_point();
3657 uiInterface
.ShowProgress(_("Verifying blocks..."), std::max(1, std::min(99, 100 - (int)(((double)(chainActive
.Height() - pindex
->nHeight
)) / (double)nCheckDepth
* 50))));
3658 pindex
= chainActive
.Next(pindex
);
3660 if (!ReadBlockFromDisk(block
, pindex
, chainparams
.GetConsensus()))
3661 return error("VerifyDB(): *** ReadBlockFromDisk failed at %d, hash=%s", pindex
->nHeight
, pindex
->GetBlockHash().ToString());
3662 if (!ConnectBlock(block
, state
, pindex
, coins
, chainparams
))
3663 return error("VerifyDB(): *** found unconnectable block at %d, hash=%s", pindex
->nHeight
, pindex
->GetBlockHash().ToString());
3667 LogPrintf("[DONE].\n");
3668 LogPrintf("No coin database inconsistencies in last %i blocks (%i transactions)\n", chainActive
.Height() - pindexState
->nHeight
, nGoodTransactions
);
3673 /** Apply the effects of a block on the utxo cache, ignoring that it may already have been applied. */
3674 static bool RollforwardBlock(const CBlockIndex
* pindex
, CCoinsViewCache
& inputs
, const CChainParams
& params
)
3676 // TODO: merge with ConnectBlock
3678 if (!ReadBlockFromDisk(block
, pindex
, params
.GetConsensus())) {
3679 return error("ReplayBlock(): ReadBlockFromDisk failed at %d, hash=%s", pindex
->nHeight
, pindex
->GetBlockHash().ToString());
3682 for (const CTransactionRef
& tx
: block
.vtx
) {
3683 if (!tx
->IsCoinBase()) {
3684 for (const CTxIn
&txin
: tx
->vin
) {
3685 inputs
.SpendCoin(txin
.prevout
);
3688 // Pass check = true as every addition may be an overwrite.
3689 AddCoins(inputs
, *tx
, pindex
->nHeight
, true);
3694 bool ReplayBlocks(const CChainParams
& params
, CCoinsView
* view
)
3698 CCoinsViewCache
cache(view
);
3700 std::vector
<uint256
> hashHeads
= view
->GetHeadBlocks();
3701 if (hashHeads
.empty()) return true; // We're already in a consistent state.
3702 if (hashHeads
.size() != 2) return error("ReplayBlocks(): unknown inconsistent state");
3704 uiInterface
.ShowProgress(_("Replaying blocks..."), 0);
3705 LogPrintf("Replaying blocks\n");
3707 const CBlockIndex
* pindexOld
= nullptr; // Old tip during the interrupted flush.
3708 const CBlockIndex
* pindexNew
; // New tip during the interrupted flush.
3709 const CBlockIndex
* pindexFork
= nullptr; // Latest block common to both the old and the new tip.
3711 if (mapBlockIndex
.count(hashHeads
[0]) == 0) {
3712 return error("ReplayBlocks(): reorganization to unknown block requested");
3714 pindexNew
= mapBlockIndex
[hashHeads
[0]];
3716 if (!hashHeads
[1].IsNull()) { // The old tip is allowed to be 0, indicating it's the first flush.
3717 if (mapBlockIndex
.count(hashHeads
[1]) == 0) {
3718 return error("ReplayBlocks(): reorganization from unknown block requested");
3720 pindexOld
= mapBlockIndex
[hashHeads
[1]];
3721 pindexFork
= LastCommonAncestor(pindexOld
, pindexNew
);
3722 assert(pindexFork
!= nullptr);
3725 // Rollback along the old branch.
3726 while (pindexOld
!= pindexFork
) {
3727 if (pindexOld
->nHeight
> 0) { // Never disconnect the genesis block.
3729 if (!ReadBlockFromDisk(block
, pindexOld
, params
.GetConsensus())) {
3730 return error("RollbackBlock(): ReadBlockFromDisk() failed at %d, hash=%s", pindexOld
->nHeight
, pindexOld
->GetBlockHash().ToString());
3732 LogPrintf("Rolling back %s (%i)\n", pindexOld
->GetBlockHash().ToString(), pindexOld
->nHeight
);
3733 DisconnectResult res
= DisconnectBlock(block
, pindexOld
, cache
);
3734 if (res
== DISCONNECT_FAILED
) {
3735 return error("RollbackBlock(): DisconnectBlock failed at %d, hash=%s", pindexOld
->nHeight
, pindexOld
->GetBlockHash().ToString());
3737 // If DISCONNECT_UNCLEAN is returned, it means a non-existing UTXO was deleted, or an existing UTXO was
3738 // overwritten. It corresponds to cases where the block-to-be-disconnect never had all its operations
3739 // applied to the UTXO set. However, as both writing a UTXO and deleting a UTXO are idempotent operations,
3740 // the result is still a version of the UTXO set with the effects of that block undone.
3742 pindexOld
= pindexOld
->pprev
;
3745 // Roll forward from the forking point to the new tip.
3746 int nForkHeight
= pindexFork
? pindexFork
->nHeight
: 0;
3747 for (int nHeight
= nForkHeight
+ 1; nHeight
<= pindexNew
->nHeight
; ++nHeight
) {
3748 const CBlockIndex
* pindex
= pindexNew
->GetAncestor(nHeight
);
3749 LogPrintf("Rolling forward %s (%i)\n", pindex
->GetBlockHash().ToString(), nHeight
);
3750 if (!RollforwardBlock(pindex
, cache
, params
)) return false;
3753 cache
.SetBestBlock(pindexNew
->GetBlockHash());
3755 uiInterface
.ShowProgress("", 100);
3759 bool RewindBlockIndex(const CChainParams
& params
)
3763 // Note that during -reindex-chainstate we are called with an empty chainActive!
3766 while (nHeight
<= chainActive
.Height()) {
3767 if (IsWitnessEnabled(chainActive
[nHeight
- 1], params
.GetConsensus()) && !(chainActive
[nHeight
]->nStatus
& BLOCK_OPT_WITNESS
)) {
3773 // nHeight is now the height of the first insufficiently-validated block, or tipheight + 1
3774 CValidationState state
;
3775 CBlockIndex
* pindex
= chainActive
.Tip();
3776 while (chainActive
.Height() >= nHeight
) {
3777 if (fPruneMode
&& !(chainActive
.Tip()->nStatus
& BLOCK_HAVE_DATA
)) {
3778 // If pruning, don't try rewinding past the HAVE_DATA point;
3779 // since older blocks can't be served anyway, there's
3780 // no need to walk further, and trying to DisconnectTip()
3781 // will fail (and require a needless reindex/redownload
3782 // of the blockchain).
3785 if (!DisconnectTip(state
, params
, nullptr)) {
3786 return error("RewindBlockIndex: unable to disconnect block at height %i", pindex
->nHeight
);
3788 // Occasionally flush state to disk.
3789 if (!FlushStateToDisk(params
, state
, FLUSH_STATE_PERIODIC
))
3793 // Reduce validity flag and have-data flags.
3794 // We do this after actual disconnecting, otherwise we'll end up writing the lack of data
3795 // to disk before writing the chainstate, resulting in a failure to continue if interrupted.
3796 for (BlockMap::iterator it
= mapBlockIndex
.begin(); it
!= mapBlockIndex
.end(); it
++) {
3797 CBlockIndex
* pindexIter
= it
->second
;
3799 // Note: If we encounter an insufficiently validated block that
3800 // is on chainActive, it must be because we are a pruning node, and
3801 // this block or some successor doesn't HAVE_DATA, so we were unable to
3802 // rewind all the way. Blocks remaining on chainActive at this point
3803 // must not have their validity reduced.
3804 if (IsWitnessEnabled(pindexIter
->pprev
, params
.GetConsensus()) && !(pindexIter
->nStatus
& BLOCK_OPT_WITNESS
) && !chainActive
.Contains(pindexIter
)) {
3806 pindexIter
->nStatus
= std::min
<unsigned int>(pindexIter
->nStatus
& BLOCK_VALID_MASK
, BLOCK_VALID_TREE
) | (pindexIter
->nStatus
& ~BLOCK_VALID_MASK
);
3807 // Remove have-data flags.
3808 pindexIter
->nStatus
&= ~(BLOCK_HAVE_DATA
| BLOCK_HAVE_UNDO
);
3809 // Remove storage location.
3810 pindexIter
->nFile
= 0;
3811 pindexIter
->nDataPos
= 0;
3812 pindexIter
->nUndoPos
= 0;
3813 // Remove various other things
3814 pindexIter
->nTx
= 0;
3815 pindexIter
->nChainTx
= 0;
3816 pindexIter
->nSequenceId
= 0;
3817 // Make sure it gets written.
3818 setDirtyBlockIndex
.insert(pindexIter
);
3820 setBlockIndexCandidates
.erase(pindexIter
);
3821 std::pair
<std::multimap
<CBlockIndex
*, CBlockIndex
*>::iterator
, std::multimap
<CBlockIndex
*, CBlockIndex
*>::iterator
> ret
= mapBlocksUnlinked
.equal_range(pindexIter
->pprev
);
3822 while (ret
.first
!= ret
.second
) {
3823 if (ret
.first
->second
== pindexIter
) {
3824 mapBlocksUnlinked
.erase(ret
.first
++);
3829 } else if (pindexIter
->IsValid(BLOCK_VALID_TRANSACTIONS
) && pindexIter
->nChainTx
) {
3830 setBlockIndexCandidates
.insert(pindexIter
);
3834 if (chainActive
.Tip() != nullptr) {
3835 // We can't prune block index candidates based on our tip if we have
3836 // no tip due to chainActive being empty!
3837 PruneBlockIndexCandidates();
3839 CheckBlockIndex(params
.GetConsensus());
3841 // FlushStateToDisk can possibly read chainActive. Be conservative
3842 // and skip it here, we're about to -reindex-chainstate anyway, so
3843 // it'll get called a bunch real soon.
3844 if (!FlushStateToDisk(params
, state
, FLUSH_STATE_ALWAYS
)) {
3852 // May NOT be used after any connections are up as much
3853 // of the peer-processing logic assumes a consistent
3854 // block index state
3855 void UnloadBlockIndex()
3858 setBlockIndexCandidates
.clear();
3859 chainActive
.SetTip(nullptr);
3860 pindexBestInvalid
= nullptr;
3861 pindexBestHeader
= nullptr;
3863 mapBlocksUnlinked
.clear();
3864 vinfoBlockFile
.clear();
3866 nBlockSequenceId
= 1;
3867 setDirtyBlockIndex
.clear();
3868 setDirtyFileInfo
.clear();
3869 versionbitscache
.Clear();
3870 for (int b
= 0; b
< VERSIONBITS_NUM_BITS
; b
++) {
3871 warningcache
[b
].clear();
3874 for (BlockMap::value_type
& entry
: mapBlockIndex
) {
3875 delete entry
.second
;
3877 mapBlockIndex
.clear();
3878 fHavePruned
= false;
3881 bool LoadBlockIndex(const CChainParams
& chainparams
)
3883 // Load block index from databases
3884 bool needs_init
= fReindex
;
3886 bool ret
= LoadBlockIndexDB(chainparams
);
3887 if (!ret
) return false;
3888 needs_init
= mapBlockIndex
.empty();
3892 // Everything here is for *new* reindex/DBs. Thus, though
3893 // LoadBlockIndexDB may have set fReindex if we shut down
3894 // mid-reindex previously, we don't check fReindex and
3895 // instead only check it prior to LoadBlockIndexDB to set
3898 LogPrintf("Initializing databases...\n");
3899 // Use the provided setting for -txindex in the new database
3900 fTxIndex
= gArgs
.GetBoolArg("-txindex", DEFAULT_TXINDEX
);
3901 pblocktree
->WriteFlag("txindex", fTxIndex
);
3906 bool LoadGenesisBlock(const CChainParams
& chainparams
)
3910 // Check whether we're already initialized by checking for genesis in
3911 // mapBlockIndex. Note that we can't use chainActive here, since it is
3912 // set based on the coins db, not the block index db, which is the only
3913 // thing loaded at this point.
3914 if (mapBlockIndex
.count(chainparams
.GenesisBlock().GetHash()))
3918 CBlock
&block
= const_cast<CBlock
&>(chainparams
.GenesisBlock());
3919 // Start new block file
3920 unsigned int nBlockSize
= ::GetSerializeSize(block
, SER_DISK
, CLIENT_VERSION
);
3921 CDiskBlockPos blockPos
;
3922 CValidationState state
;
3923 if (!FindBlockPos(state
, blockPos
, nBlockSize
+8, 0, block
.GetBlockTime()))
3924 return error("%s: FindBlockPos failed", __func__
);
3925 if (!WriteBlockToDisk(block
, blockPos
, chainparams
.MessageStart()))
3926 return error("%s: writing genesis block to disk failed", __func__
);
3927 CBlockIndex
*pindex
= AddToBlockIndex(block
);
3928 if (!ReceivedBlockTransactions(block
, state
, pindex
, blockPos
, chainparams
.GetConsensus()))
3929 return error("%s: genesis block not accepted", __func__
);
3930 } catch (const std::runtime_error
& e
) {
3931 return error("%s: failed to write genesis block: %s", __func__
, e
.what());
3937 bool LoadExternalBlockFile(const CChainParams
& chainparams
, FILE* fileIn
, CDiskBlockPos
*dbp
)
3939 // Map of disk positions for blocks with unknown parent (only used for reindex)
3940 static std::multimap
<uint256
, CDiskBlockPos
> mapBlocksUnknownParent
;
3941 int64_t nStart
= GetTimeMillis();
3945 // This takes over fileIn and calls fclose() on it in the CBufferedFile destructor
3946 CBufferedFile
blkdat(fileIn
, 2*MAX_BLOCK_SERIALIZED_SIZE
, MAX_BLOCK_SERIALIZED_SIZE
+8, SER_DISK
, CLIENT_VERSION
);
3947 uint64_t nRewind
= blkdat
.GetPos();
3948 while (!blkdat
.eof()) {
3949 boost::this_thread::interruption_point();
3951 blkdat
.SetPos(nRewind
);
3952 nRewind
++; // start one byte further next time, in case of failure
3953 blkdat
.SetLimit(); // remove former limit
3954 unsigned int nSize
= 0;
3957 unsigned char buf
[CMessageHeader::MESSAGE_START_SIZE
];
3958 blkdat
.FindByte(chainparams
.MessageStart()[0]);
3959 nRewind
= blkdat
.GetPos()+1;
3960 blkdat
>> FLATDATA(buf
);
3961 if (memcmp(buf
, chainparams
.MessageStart(), CMessageHeader::MESSAGE_START_SIZE
))
3965 if (nSize
< 80 || nSize
> MAX_BLOCK_SERIALIZED_SIZE
)
3967 } catch (const std::exception
&) {
3968 // no valid block header found; don't complain
3973 uint64_t nBlockPos
= blkdat
.GetPos();
3975 dbp
->nPos
= nBlockPos
;
3976 blkdat
.SetLimit(nBlockPos
+ nSize
);
3977 blkdat
.SetPos(nBlockPos
);
3978 std::shared_ptr
<CBlock
> pblock
= std::make_shared
<CBlock
>();
3979 CBlock
& block
= *pblock
;
3981 nRewind
= blkdat
.GetPos();
3983 // detect out of order blocks, and store them for later
3984 uint256 hash
= block
.GetHash();
3985 if (hash
!= chainparams
.GetConsensus().hashGenesisBlock
&& mapBlockIndex
.find(block
.hashPrevBlock
) == mapBlockIndex
.end()) {
3986 LogPrint(BCLog::REINDEX
, "%s: Out of order block %s, parent %s not known\n", __func__
, hash
.ToString(),
3987 block
.hashPrevBlock
.ToString());
3989 mapBlocksUnknownParent
.insert(std::make_pair(block
.hashPrevBlock
, *dbp
));
3993 // process in case the block isn't known yet
3994 if (mapBlockIndex
.count(hash
) == 0 || (mapBlockIndex
[hash
]->nStatus
& BLOCK_HAVE_DATA
) == 0) {
3996 CValidationState state
;
3997 if (AcceptBlock(pblock
, state
, chainparams
, nullptr, true, dbp
, nullptr))
3999 if (state
.IsError())
4001 } else if (hash
!= chainparams
.GetConsensus().hashGenesisBlock
&& mapBlockIndex
[hash
]->nHeight
% 1000 == 0) {
4002 LogPrint(BCLog::REINDEX
, "Block Import: already had block %s at height %d\n", hash
.ToString(), mapBlockIndex
[hash
]->nHeight
);
4005 // Activate the genesis block so normal node progress can continue
4006 if (hash
== chainparams
.GetConsensus().hashGenesisBlock
) {
4007 CValidationState state
;
4008 if (!ActivateBestChain(state
, chainparams
)) {
4015 // Recursively process earlier encountered successors of this block
4016 std::deque
<uint256
> queue
;
4017 queue
.push_back(hash
);
4018 while (!queue
.empty()) {
4019 uint256 head
= queue
.front();
4021 std::pair
<std::multimap
<uint256
, CDiskBlockPos
>::iterator
, std::multimap
<uint256
, CDiskBlockPos
>::iterator
> range
= mapBlocksUnknownParent
.equal_range(head
);
4022 while (range
.first
!= range
.second
) {
4023 std::multimap
<uint256
, CDiskBlockPos
>::iterator it
= range
.first
;
4024 std::shared_ptr
<CBlock
> pblockrecursive
= std::make_shared
<CBlock
>();
4025 if (ReadBlockFromDisk(*pblockrecursive
, it
->second
, chainparams
.GetConsensus()))
4027 LogPrint(BCLog::REINDEX
, "%s: Processing out of order child %s of %s\n", __func__
, pblockrecursive
->GetHash().ToString(),
4030 CValidationState dummy
;
4031 if (AcceptBlock(pblockrecursive
, dummy
, chainparams
, nullptr, true, &it
->second
, nullptr))
4034 queue
.push_back(pblockrecursive
->GetHash());
4038 mapBlocksUnknownParent
.erase(it
);
4042 } catch (const std::exception
& e
) {
4043 LogPrintf("%s: Deserialize or I/O error - %s\n", __func__
, e
.what());
4046 } catch (const std::runtime_error
& e
) {
4047 AbortNode(std::string("System error: ") + e
.what());
4050 LogPrintf("Loaded %i blocks from external file in %dms\n", nLoaded
, GetTimeMillis() - nStart
);
4054 void static CheckBlockIndex(const Consensus::Params
& consensusParams
)
4056 if (!fCheckBlockIndex
) {
4062 // During a reindex, we read the genesis block and call CheckBlockIndex before ActivateBestChain,
4063 // so we have the genesis block in mapBlockIndex but no active chain. (A few of the tests when
4064 // iterating the block tree require that chainActive has been initialized.)
4065 if (chainActive
.Height() < 0) {
4066 assert(mapBlockIndex
.size() <= 1);
4070 // Build forward-pointing map of the entire block tree.
4071 std::multimap
<CBlockIndex
*,CBlockIndex
*> forward
;
4072 for (BlockMap::iterator it
= mapBlockIndex
.begin(); it
!= mapBlockIndex
.end(); it
++) {
4073 forward
.insert(std::make_pair(it
->second
->pprev
, it
->second
));
4076 assert(forward
.size() == mapBlockIndex
.size());
4078 std::pair
<std::multimap
<CBlockIndex
*,CBlockIndex
*>::iterator
,std::multimap
<CBlockIndex
*,CBlockIndex
*>::iterator
> rangeGenesis
= forward
.equal_range(nullptr);
4079 CBlockIndex
*pindex
= rangeGenesis
.first
->second
;
4080 rangeGenesis
.first
++;
4081 assert(rangeGenesis
.first
== rangeGenesis
.second
); // There is only one index entry with parent nullptr.
4083 // Iterate over the entire block tree, using depth-first search.
4084 // Along the way, remember whether there are blocks on the path from genesis
4085 // block being explored which are the first to have certain properties.
4088 CBlockIndex
* pindexFirstInvalid
= nullptr; // Oldest ancestor of pindex which is invalid.
4089 CBlockIndex
* pindexFirstMissing
= nullptr; // Oldest ancestor of pindex which does not have BLOCK_HAVE_DATA.
4090 CBlockIndex
* pindexFirstNeverProcessed
= nullptr; // Oldest ancestor of pindex for which nTx == 0.
4091 CBlockIndex
* pindexFirstNotTreeValid
= nullptr; // Oldest ancestor of pindex which does not have BLOCK_VALID_TREE (regardless of being valid or not).
4092 CBlockIndex
* pindexFirstNotTransactionsValid
= nullptr; // Oldest ancestor of pindex which does not have BLOCK_VALID_TRANSACTIONS (regardless of being valid or not).
4093 CBlockIndex
* pindexFirstNotChainValid
= nullptr; // Oldest ancestor of pindex which does not have BLOCK_VALID_CHAIN (regardless of being valid or not).
4094 CBlockIndex
* pindexFirstNotScriptsValid
= nullptr; // Oldest ancestor of pindex which does not have BLOCK_VALID_SCRIPTS (regardless of being valid or not).
4095 while (pindex
!= nullptr) {
4097 if (pindexFirstInvalid
== nullptr && pindex
->nStatus
& BLOCK_FAILED_VALID
) pindexFirstInvalid
= pindex
;
4098 if (pindexFirstMissing
== nullptr && !(pindex
->nStatus
& BLOCK_HAVE_DATA
)) pindexFirstMissing
= pindex
;
4099 if (pindexFirstNeverProcessed
== nullptr && pindex
->nTx
== 0) pindexFirstNeverProcessed
= pindex
;
4100 if (pindex
->pprev
!= nullptr && pindexFirstNotTreeValid
== nullptr && (pindex
->nStatus
& BLOCK_VALID_MASK
) < BLOCK_VALID_TREE
) pindexFirstNotTreeValid
= pindex
;
4101 if (pindex
->pprev
!= nullptr && pindexFirstNotTransactionsValid
== nullptr && (pindex
->nStatus
& BLOCK_VALID_MASK
) < BLOCK_VALID_TRANSACTIONS
) pindexFirstNotTransactionsValid
= pindex
;
4102 if (pindex
->pprev
!= nullptr && pindexFirstNotChainValid
== nullptr && (pindex
->nStatus
& BLOCK_VALID_MASK
) < BLOCK_VALID_CHAIN
) pindexFirstNotChainValid
= pindex
;
4103 if (pindex
->pprev
!= nullptr && pindexFirstNotScriptsValid
== nullptr && (pindex
->nStatus
& BLOCK_VALID_MASK
) < BLOCK_VALID_SCRIPTS
) pindexFirstNotScriptsValid
= pindex
;
4105 // Begin: actual consistency checks.
4106 if (pindex
->pprev
== nullptr) {
4107 // Genesis block checks.
4108 assert(pindex
->GetBlockHash() == consensusParams
.hashGenesisBlock
); // Genesis block's hash must match.
4109 assert(pindex
== chainActive
.Genesis()); // The current active chain's genesis block must be this block.
4111 if (pindex
->nChainTx
== 0) assert(pindex
->nSequenceId
<= 0); // nSequenceId can't be set positive for blocks that aren't linked (negative is used for preciousblock)
4112 // VALID_TRANSACTIONS is equivalent to nTx > 0 for all nodes (whether or not pruning has occurred).
4113 // HAVE_DATA is only equivalent to nTx > 0 (or VALID_TRANSACTIONS) if no pruning has occurred.
4115 // If we've never pruned, then HAVE_DATA should be equivalent to nTx > 0
4116 assert(!(pindex
->nStatus
& BLOCK_HAVE_DATA
) == (pindex
->nTx
== 0));
4117 assert(pindexFirstMissing
== pindexFirstNeverProcessed
);
4119 // If we have pruned, then we can only say that HAVE_DATA implies nTx > 0
4120 if (pindex
->nStatus
& BLOCK_HAVE_DATA
) assert(pindex
->nTx
> 0);
4122 if (pindex
->nStatus
& BLOCK_HAVE_UNDO
) assert(pindex
->nStatus
& BLOCK_HAVE_DATA
);
4123 assert(((pindex
->nStatus
& BLOCK_VALID_MASK
) >= BLOCK_VALID_TRANSACTIONS
) == (pindex
->nTx
> 0)); // This is pruning-independent.
4124 // All parents having had data (at some point) is equivalent to all parents being VALID_TRANSACTIONS, which is equivalent to nChainTx being set.
4125 assert((pindexFirstNeverProcessed
!= nullptr) == (pindex
->nChainTx
== 0)); // nChainTx != 0 is used to signal that all parent blocks have been processed (but may have been pruned).
4126 assert((pindexFirstNotTransactionsValid
!= nullptr) == (pindex
->nChainTx
== 0));
4127 assert(pindex
->nHeight
== nHeight
); // nHeight must be consistent.
4128 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.
4129 assert(nHeight
< 2 || (pindex
->pskip
&& (pindex
->pskip
->nHeight
< nHeight
))); // The pskip pointer must point back for all but the first 2 blocks.
4130 assert(pindexFirstNotTreeValid
== nullptr); // All mapBlockIndex entries must at least be TREE valid
4131 if ((pindex
->nStatus
& BLOCK_VALID_MASK
) >= BLOCK_VALID_TREE
) assert(pindexFirstNotTreeValid
== nullptr); // TREE valid implies all parents are TREE valid
4132 if ((pindex
->nStatus
& BLOCK_VALID_MASK
) >= BLOCK_VALID_CHAIN
) assert(pindexFirstNotChainValid
== nullptr); // CHAIN valid implies all parents are CHAIN valid
4133 if ((pindex
->nStatus
& BLOCK_VALID_MASK
) >= BLOCK_VALID_SCRIPTS
) assert(pindexFirstNotScriptsValid
== nullptr); // SCRIPTS valid implies all parents are SCRIPTS valid
4134 if (pindexFirstInvalid
== nullptr) {
4135 // Checks for not-invalid blocks.
4136 assert((pindex
->nStatus
& BLOCK_FAILED_MASK
) == 0); // The failed mask cannot be set for blocks without invalid parents.
4138 if (!CBlockIndexWorkComparator()(pindex
, chainActive
.Tip()) && pindexFirstNeverProcessed
== nullptr) {
4139 if (pindexFirstInvalid
== nullptr) {
4140 // If this block sorts at least as good as the current tip and
4141 // is valid and we have all data for its parents, it must be in
4142 // setBlockIndexCandidates. chainActive.Tip() must also be there
4143 // even if some data has been pruned.
4144 if (pindexFirstMissing
== nullptr || pindex
== chainActive
.Tip()) {
4145 assert(setBlockIndexCandidates
.count(pindex
));
4147 // If some parent is missing, then it could be that this block was in
4148 // setBlockIndexCandidates but had to be removed because of the missing data.
4149 // In this case it must be in mapBlocksUnlinked -- see test below.
4151 } else { // If this block sorts worse than the current tip or some ancestor's block has never been seen, it cannot be in setBlockIndexCandidates.
4152 assert(setBlockIndexCandidates
.count(pindex
) == 0);
4154 // Check whether this block is in mapBlocksUnlinked.
4155 std::pair
<std::multimap
<CBlockIndex
*,CBlockIndex
*>::iterator
,std::multimap
<CBlockIndex
*,CBlockIndex
*>::iterator
> rangeUnlinked
= mapBlocksUnlinked
.equal_range(pindex
->pprev
);
4156 bool foundInUnlinked
= false;
4157 while (rangeUnlinked
.first
!= rangeUnlinked
.second
) {
4158 assert(rangeUnlinked
.first
->first
== pindex
->pprev
);
4159 if (rangeUnlinked
.first
->second
== pindex
) {
4160 foundInUnlinked
= true;
4163 rangeUnlinked
.first
++;
4165 if (pindex
->pprev
&& (pindex
->nStatus
& BLOCK_HAVE_DATA
) && pindexFirstNeverProcessed
!= nullptr && pindexFirstInvalid
== nullptr) {
4166 // If this block has block data available, some parent was never received, and has no invalid parents, it must be in mapBlocksUnlinked.
4167 assert(foundInUnlinked
);
4169 if (!(pindex
->nStatus
& BLOCK_HAVE_DATA
)) assert(!foundInUnlinked
); // Can't be in mapBlocksUnlinked if we don't HAVE_DATA
4170 if (pindexFirstMissing
== nullptr) assert(!foundInUnlinked
); // We aren't missing data for any parent -- cannot be in mapBlocksUnlinked.
4171 if (pindex
->pprev
&& (pindex
->nStatus
& BLOCK_HAVE_DATA
) && pindexFirstNeverProcessed
== nullptr && pindexFirstMissing
!= nullptr) {
4172 // We HAVE_DATA for this block, have received data for all parents at some point, but we're currently missing data for some parent.
4173 assert(fHavePruned
); // We must have pruned.
4174 // This block may have entered mapBlocksUnlinked if:
4175 // - it has a descendant that at some point had more work than the
4177 // - we tried switching to that descendant but were missing
4178 // data for some intermediate block between chainActive and the
4180 // So if this block is itself better than chainActive.Tip() and it wasn't in
4181 // setBlockIndexCandidates, then it must be in mapBlocksUnlinked.
4182 if (!CBlockIndexWorkComparator()(pindex
, chainActive
.Tip()) && setBlockIndexCandidates
.count(pindex
) == 0) {
4183 if (pindexFirstInvalid
== nullptr) {
4184 assert(foundInUnlinked
);
4188 // assert(pindex->GetBlockHash() == pindex->GetBlockHeader().GetHash()); // Perhaps too slow
4189 // End: actual consistency checks.
4191 // Try descending into the first subnode.
4192 std::pair
<std::multimap
<CBlockIndex
*,CBlockIndex
*>::iterator
,std::multimap
<CBlockIndex
*,CBlockIndex
*>::iterator
> range
= forward
.equal_range(pindex
);
4193 if (range
.first
!= range
.second
) {
4194 // A subnode was found.
4195 pindex
= range
.first
->second
;
4199 // This is a leaf node.
4200 // Move upwards until we reach a node of which we have not yet visited the last child.
4202 // We are going to either move to a parent or a sibling of pindex.
4203 // If pindex was the first with a certain property, unset the corresponding variable.
4204 if (pindex
== pindexFirstInvalid
) pindexFirstInvalid
= nullptr;
4205 if (pindex
== pindexFirstMissing
) pindexFirstMissing
= nullptr;
4206 if (pindex
== pindexFirstNeverProcessed
) pindexFirstNeverProcessed
= nullptr;
4207 if (pindex
== pindexFirstNotTreeValid
) pindexFirstNotTreeValid
= nullptr;
4208 if (pindex
== pindexFirstNotTransactionsValid
) pindexFirstNotTransactionsValid
= nullptr;
4209 if (pindex
== pindexFirstNotChainValid
) pindexFirstNotChainValid
= nullptr;
4210 if (pindex
== pindexFirstNotScriptsValid
) pindexFirstNotScriptsValid
= nullptr;
4212 CBlockIndex
* pindexPar
= pindex
->pprev
;
4213 // Find which child we just visited.
4214 std::pair
<std::multimap
<CBlockIndex
*,CBlockIndex
*>::iterator
,std::multimap
<CBlockIndex
*,CBlockIndex
*>::iterator
> rangePar
= forward
.equal_range(pindexPar
);
4215 while (rangePar
.first
->second
!= pindex
) {
4216 assert(rangePar
.first
!= rangePar
.second
); // Our parent must have at least the node we're coming from as child.
4219 // Proceed to the next one.
4221 if (rangePar
.first
!= rangePar
.second
) {
4222 // Move to the sibling.
4223 pindex
= rangePar
.first
->second
;
4234 // Check that we actually traversed the entire map.
4235 assert(nNodes
== forward
.size());
4238 std::string
CBlockFileInfo::ToString() const
4240 return strprintf("CBlockFileInfo(blocks=%u, size=%u, heights=%u...%u, time=%s...%s)", nBlocks
, nSize
, nHeightFirst
, nHeightLast
, DateTimeStrFormat("%Y-%m-%d", nTimeFirst
), DateTimeStrFormat("%Y-%m-%d", nTimeLast
));
4243 CBlockFileInfo
* GetBlockFileInfo(size_t n
)
4245 return &vinfoBlockFile
.at(n
);
4248 ThresholdState
VersionBitsTipState(const Consensus::Params
& params
, Consensus::DeploymentPos pos
)
4251 return VersionBitsState(chainActive
.Tip(), params
, pos
, versionbitscache
);
4254 BIP9Stats
VersionBitsTipStatistics(const Consensus::Params
& params
, Consensus::DeploymentPos pos
)
4257 return VersionBitsStatistics(chainActive
.Tip(), params
, pos
);
4260 int VersionBitsTipStateSinceHeight(const Consensus::Params
& params
, Consensus::DeploymentPos pos
)
4263 return VersionBitsStateSinceHeight(chainActive
.Tip(), params
, pos
, versionbitscache
);
4266 static const uint64_t MEMPOOL_DUMP_VERSION
= 1;
4268 bool LoadMempool(void)
4270 const CChainParams
& chainparams
= Params();
4271 int64_t nExpiryTimeout
= gArgs
.GetArg("-mempoolexpiry", DEFAULT_MEMPOOL_EXPIRY
) * 60 * 60;
4272 FILE* filestr
= fsbridge::fopen(GetDataDir() / "mempool.dat", "rb");
4273 CAutoFile
file(filestr
, SER_DISK
, CLIENT_VERSION
);
4274 if (file
.IsNull()) {
4275 LogPrintf("Failed to open mempool file from disk. Continuing anyway.\n");
4280 int64_t skipped
= 0;
4282 int64_t nNow
= GetTime();
4287 if (version
!= MEMPOOL_DUMP_VERSION
) {
4300 CAmount amountdelta
= nFeeDelta
;
4302 mempool
.PrioritiseTransaction(tx
->GetHash(), amountdelta
);
4304 CValidationState state
;
4305 if (nTime
+ nExpiryTimeout
> nNow
) {
4307 AcceptToMemoryPoolWithTime(chainparams
, mempool
, state
, tx
, true, nullptr, nTime
, nullptr, false, 0);
4308 if (state
.IsValid()) {
4316 if (ShutdownRequested())
4319 std::map
<uint256
, CAmount
> mapDeltas
;
4322 for (const auto& i
: mapDeltas
) {
4323 mempool
.PrioritiseTransaction(i
.first
, i
.second
);
4325 } catch (const std::exception
& e
) {
4326 LogPrintf("Failed to deserialize mempool data on disk: %s. Continuing anyway.\n", e
.what());
4330 LogPrintf("Imported mempool transactions from disk: %i successes, %i failed, %i expired\n", count
, failed
, skipped
);
4334 bool DumpMempool(void)
4336 int64_t start
= GetTimeMicros();
4338 std::map
<uint256
, CAmount
> mapDeltas
;
4339 std::vector
<TxMempoolInfo
> vinfo
;
4343 for (const auto &i
: mempool
.mapDeltas
) {
4344 mapDeltas
[i
.first
] = i
.second
;
4346 vinfo
= mempool
.infoAll();
4349 int64_t mid
= GetTimeMicros();
4352 FILE* filestr
= fsbridge::fopen(GetDataDir() / "mempool.dat.new", "wb");
4357 CAutoFile
file(filestr
, SER_DISK
, CLIENT_VERSION
);
4359 uint64_t version
= MEMPOOL_DUMP_VERSION
;
4362 file
<< (uint64_t)vinfo
.size();
4363 for (const auto& i
: vinfo
) {
4365 file
<< (int64_t)i
.nTime
;
4366 file
<< (int64_t)i
.nFeeDelta
;
4367 mapDeltas
.erase(i
.tx
->GetHash());
4371 FileCommit(file
.Get());
4373 RenameOver(GetDataDir() / "mempool.dat.new", GetDataDir() / "mempool.dat");
4374 int64_t last
= GetTimeMicros();
4375 LogPrintf("Dumped mempool: %gs to copy, %gs to dump\n", (mid
-start
)*MICRO
, (last
-mid
)*MICRO
);
4376 } catch (const std::exception
& e
) {
4377 LogPrintf("Failed to dump mempool: %s. Continuing anyway.\n", e
.what());
4383 //! Guess how far we are in the verification process at the given block index
4384 double GuessVerificationProgress(const ChainTxData
& data
, CBlockIndex
*pindex
) {
4385 if (pindex
== nullptr)
4388 int64_t nNow
= time(nullptr);
4392 if (pindex
->nChainTx
<= data
.nTxCount
) {
4393 fTxTotal
= data
.nTxCount
+ (nNow
- data
.nTime
) * data
.dTxRate
;
4395 fTxTotal
= pindex
->nChainTx
+ (nNow
- pindex
->GetBlockTime()) * data
.dTxRate
;
4398 return pindex
->nChainTx
/ fTxTotal
;
4407 BlockMap::iterator it1
= mapBlockIndex
.begin();
4408 for (; it1
!= mapBlockIndex
.end(); it1
++)
4409 delete (*it1
).second
;
4410 mapBlockIndex
.clear();
4412 } instance_of_cmaincleanup
;