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"
20 #include "policy/fees.h"
21 #include "policy/policy.h"
23 #include "primitives/block.h"
24 #include "primitives/transaction.h"
26 #include "script/script.h"
27 #include "script/sigcache.h"
28 #include "script/standard.h"
30 #include "tinyformat.h"
32 #include "txmempool.h"
33 #include "ui_interface.h"
36 #include "utilmoneystr.h"
37 #include "utilstrencodings.h"
38 #include "validationinterface.h"
39 #include "versionbits.h"
45 #include <boost/algorithm/string/replace.hpp>
46 #include <boost/algorithm/string/join.hpp>
47 #include <boost/math/distributions/poisson.hpp>
48 #include <boost/thread.hpp>
51 # error "Bitcoin cannot be compiled without assertions."
58 CCriticalSection cs_main
;
60 BlockMap mapBlockIndex
;
62 CBlockIndex
*pindexBestHeader
= NULL
;
63 CWaitableCriticalSection csBestBlock
;
64 CConditionVariable cvBlockChange
;
65 int nScriptCheckThreads
= 0;
66 std::atomic_bool
fImporting(false);
67 bool fReindex
= false;
68 bool fTxIndex
= false;
69 bool fHavePruned
= false;
70 bool fPruneMode
= false;
71 bool fIsBareMultisigStd
= DEFAULT_PERMIT_BAREMULTISIG
;
72 bool fRequireStandard
= true;
73 bool fCheckBlockIndex
= false;
74 bool fCheckpointsEnabled
= DEFAULT_CHECKPOINTS_ENABLED
;
75 size_t nCoinCacheUsage
= 5000 * 300;
76 uint64_t nPruneTarget
= 0;
77 int64_t nMaxTipAge
= DEFAULT_MAX_TIP_AGE
;
78 bool fEnableReplacement
= DEFAULT_ENABLE_REPLACEMENT
;
80 uint256 hashAssumeValid
;
82 CFeeRate minRelayTxFee
= CFeeRate(DEFAULT_MIN_RELAY_TX_FEE
);
83 CAmount maxTxFee
= DEFAULT_TRANSACTION_MAXFEE
;
85 CBlockPolicyEstimator feeEstimator
;
86 CTxMemPool
mempool(&feeEstimator
);
88 static void CheckBlockIndex(const Consensus::Params
& consensusParams
);
90 /** Constant stuff for coinbase transactions we create: */
91 CScript COINBASE_FLAGS
;
93 const std::string strMessageMagic
= "Bitcoin Signed Message:\n";
98 struct CBlockIndexWorkComparator
100 bool operator()(CBlockIndex
*pa
, CBlockIndex
*pb
) const {
101 // First sort by most total work, ...
102 if (pa
->nChainWork
> pb
->nChainWork
) return false;
103 if (pa
->nChainWork
< pb
->nChainWork
) return true;
105 // ... then by earliest time received, ...
106 if (pa
->nSequenceId
< pb
->nSequenceId
) return false;
107 if (pa
->nSequenceId
> pb
->nSequenceId
) return true;
109 // Use pointer address as tie breaker (should only happen with blocks
110 // loaded from disk, as those all have id 0).
111 if (pa
< pb
) return false;
112 if (pa
> pb
) return true;
119 CBlockIndex
*pindexBestInvalid
;
122 * The set of all CBlockIndex entries with BLOCK_VALID_TRANSACTIONS (for itself and all ancestors) and
123 * as good as our current tip or better. Entries may be failed, though, and pruning nodes may be
124 * missing the data for the block.
126 std::set
<CBlockIndex
*, CBlockIndexWorkComparator
> setBlockIndexCandidates
;
127 /** All pairs A->B, where A (or one of its ancestors) misses transactions, but B has transactions.
128 * Pruned nodes may have entries where B is missing data.
130 std::multimap
<CBlockIndex
*, CBlockIndex
*> mapBlocksUnlinked
;
132 CCriticalSection cs_LastBlockFile
;
133 std::vector
<CBlockFileInfo
> vinfoBlockFile
;
134 int nLastBlockFile
= 0;
135 /** Global flag to indicate we should check to see if there are
136 * block/undo files that should be deleted. Set on startup
137 * or if we allocate more file space when we're in prune mode
139 bool fCheckForPruning
= false;
142 * Every received block is assigned a unique and increasing identifier, so we
143 * know which one to give priority in case of a fork.
145 CCriticalSection cs_nBlockSequenceId
;
146 /** Blocks loaded from disk are assigned id 0, so start the counter at 1. */
147 int32_t nBlockSequenceId
= 1;
148 /** Decreasing counter (used by subsequent preciousblock calls). */
149 int32_t nBlockReverseSequenceId
= -1;
150 /** chainwork for the last block that preciousblock has been applied to. */
151 arith_uint256 nLastPreciousChainwork
= 0;
153 /** Dirty block index entries. */
154 std::set
<CBlockIndex
*> setDirtyBlockIndex
;
156 /** Dirty block file entries. */
157 std::set
<int> setDirtyFileInfo
;
160 CBlockIndex
* FindForkInGlobalIndex(const CChain
& chain
, const CBlockLocator
& locator
)
162 // Find the first block the caller has in the main chain
163 BOOST_FOREACH(const uint256
& hash
, locator
.vHave
) {
164 BlockMap::iterator mi
= mapBlockIndex
.find(hash
);
165 if (mi
!= mapBlockIndex
.end())
167 CBlockIndex
* pindex
= (*mi
).second
;
168 if (chain
.Contains(pindex
))
170 if (pindex
->GetAncestor(chain
.Height()) == chain
.Tip()) {
175 return chain
.Genesis();
178 CCoinsViewCache
*pcoinsTip
= NULL
;
179 CBlockTreeDB
*pblocktree
= NULL
;
181 enum FlushStateMode
{
183 FLUSH_STATE_IF_NEEDED
,
184 FLUSH_STATE_PERIODIC
,
188 // See definition for documentation
189 bool static FlushStateToDisk(CValidationState
&state
, FlushStateMode mode
, int nManualPruneHeight
=0);
190 void FindFilesToPruneManual(std::set
<int>& setFilesToPrune
, int nManualPruneHeight
);
192 bool CheckFinalTx(const CTransaction
&tx
, int flags
)
194 AssertLockHeld(cs_main
);
196 // By convention a negative value for flags indicates that the
197 // current network-enforced consensus rules should be used. In
198 // a future soft-fork scenario that would mean checking which
199 // rules would be enforced for the next block and setting the
200 // appropriate flags. At the present time no soft-forks are
201 // scheduled, so no flags are set.
202 flags
= std::max(flags
, 0);
204 // CheckFinalTx() uses chainActive.Height()+1 to evaluate
205 // nLockTime because when IsFinalTx() is called within
206 // CBlock::AcceptBlock(), the height of the block *being*
207 // evaluated is what is used. Thus if we want to know if a
208 // transaction can be part of the *next* block, we need to call
209 // IsFinalTx() with one more than chainActive.Height().
210 const int nBlockHeight
= chainActive
.Height() + 1;
212 // BIP113 will require that time-locked transactions have nLockTime set to
213 // less than the median time of the previous block they're contained in.
214 // When the next block is created its previous block will be the current
215 // chain tip, so we use that to calculate the median time passed to
216 // IsFinalTx() if LOCKTIME_MEDIAN_TIME_PAST is set.
217 const int64_t nBlockTime
= (flags
& LOCKTIME_MEDIAN_TIME_PAST
)
218 ? chainActive
.Tip()->GetMedianTimePast()
221 return IsFinalTx(tx
, nBlockHeight
, nBlockTime
);
224 bool TestLockPointValidity(const LockPoints
* lp
)
226 AssertLockHeld(cs_main
);
228 // If there are relative lock times then the maxInputBlock will be set
229 // If there are no relative lock times, the LockPoints don't depend on the chain
230 if (lp
->maxInputBlock
) {
231 // Check whether chainActive is an extension of the block at which the LockPoints
232 // calculation was valid. If not LockPoints are no longer valid
233 if (!chainActive
.Contains(lp
->maxInputBlock
)) {
238 // LockPoints still valid
242 bool CheckSequenceLocks(const CTransaction
&tx
, int flags
, LockPoints
* lp
, bool useExistingLockPoints
)
244 AssertLockHeld(cs_main
);
245 AssertLockHeld(mempool
.cs
);
247 CBlockIndex
* tip
= chainActive
.Tip();
250 // CheckSequenceLocks() uses chainActive.Height()+1 to evaluate
251 // height based locks because when SequenceLocks() is called within
252 // ConnectBlock(), the height of the block *being*
253 // evaluated is what is used.
254 // Thus if we want to know if a transaction can be part of the
255 // *next* block, we need to use one more than chainActive.Height()
256 index
.nHeight
= tip
->nHeight
+ 1;
258 std::pair
<int, int64_t> lockPair
;
259 if (useExistingLockPoints
) {
261 lockPair
.first
= lp
->height
;
262 lockPair
.second
= lp
->time
;
265 // pcoinsTip contains the UTXO set for chainActive.Tip()
266 CCoinsViewMemPool
viewMemPool(pcoinsTip
, mempool
);
267 std::vector
<int> prevheights
;
268 prevheights
.resize(tx
.vin
.size());
269 for (size_t txinIndex
= 0; txinIndex
< tx
.vin
.size(); txinIndex
++) {
270 const CTxIn
& txin
= tx
.vin
[txinIndex
];
272 if (!viewMemPool
.GetCoins(txin
.prevout
.hash
, coins
)) {
273 return error("%s: Missing input", __func__
);
275 if (coins
.nHeight
== MEMPOOL_HEIGHT
) {
276 // Assume all mempool transaction confirm in the next block
277 prevheights
[txinIndex
] = tip
->nHeight
+ 1;
279 prevheights
[txinIndex
] = coins
.nHeight
;
282 lockPair
= CalculateSequenceLocks(tx
, flags
, &prevheights
, index
);
284 lp
->height
= lockPair
.first
;
285 lp
->time
= lockPair
.second
;
286 // Also store the hash of the block with the highest height of
287 // all the blocks which have sequence locked prevouts.
288 // This hash needs to still be on the chain
289 // for these LockPoint calculations to be valid
290 // Note: It is impossible to correctly calculate a maxInputBlock
291 // if any of the sequence locked inputs depend on unconfirmed txs,
292 // except in the special case where the relative lock time/height
293 // is 0, which is equivalent to no sequence lock. Since we assume
294 // input height of tip+1 for mempool txs and test the resulting
295 // lockPair from CalculateSequenceLocks against tip+1. We know
296 // EvaluateSequenceLocks will fail if there was a non-zero sequence
297 // lock on a mempool input, so we can use the return value of
298 // CheckSequenceLocks to indicate the LockPoints validity
299 int maxInputHeight
= 0;
300 BOOST_FOREACH(int height
, prevheights
) {
301 // Can ignore mempool inputs since we'll fail if they had non-zero locks
302 if (height
!= tip
->nHeight
+1) {
303 maxInputHeight
= std::max(maxInputHeight
, height
);
306 lp
->maxInputBlock
= tip
->GetAncestor(maxInputHeight
);
309 return EvaluateSequenceLocks(index
, lockPair
);
312 void LimitMempoolSize(CTxMemPool
& pool
, size_t limit
, unsigned long age
) {
313 int expired
= pool
.Expire(GetTime() - age
);
315 LogPrint(BCLog::MEMPOOL
, "Expired %i transactions from the memory pool\n", expired
);
318 std::vector
<uint256
> vNoSpendsRemaining
;
319 pool
.TrimToSize(limit
, &vNoSpendsRemaining
);
320 BOOST_FOREACH(const uint256
& removed
, vNoSpendsRemaining
)
321 pcoinsTip
->Uncache(removed
);
324 /** Convert CValidationState to a human-readable message for logging */
325 std::string
FormatStateMessage(const CValidationState
&state
)
327 return strprintf("%s%s (code %i)",
328 state
.GetRejectReason(),
329 state
.GetDebugMessage().empty() ? "" : ", "+state
.GetDebugMessage(),
330 state
.GetRejectCode());
333 static bool IsCurrentForFeeEstimation()
335 AssertLockHeld(cs_main
);
336 if (IsInitialBlockDownload())
338 if (chainActive
.Tip()->GetBlockTime() < (GetTime() - MAX_FEE_ESTIMATION_TIP_AGE
))
340 if (chainActive
.Height() < pindexBestHeader
->nHeight
- 1)
345 bool AcceptToMemoryPoolWorker(CTxMemPool
& pool
, CValidationState
& state
, const CTransactionRef
& ptx
, bool fLimitFree
,
346 bool* pfMissingInputs
, int64_t nAcceptTime
, std::list
<CTransactionRef
>* plTxnReplaced
,
347 bool fOverrideMempoolLimit
, const CAmount
& nAbsurdFee
, std::vector
<uint256
>& vHashTxnToUncache
)
349 const CTransaction
& tx
= *ptx
;
350 const uint256 hash
= tx
.GetHash();
351 AssertLockHeld(cs_main
);
353 *pfMissingInputs
= false;
355 if (!CheckTransaction(tx
, state
))
356 return false; // state filled in by CheckTransaction
358 // Coinbase is only valid in a block, not as a loose transaction
360 return state
.DoS(100, false, REJECT_INVALID
, "coinbase");
362 // Reject transactions with witness before segregated witness activates (override with -prematurewitness)
363 bool witnessEnabled
= IsWitnessEnabled(chainActive
.Tip(), Params().GetConsensus());
364 if (!GetBoolArg("-prematurewitness",false) && tx
.HasWitness() && !witnessEnabled
) {
365 return state
.DoS(0, false, REJECT_NONSTANDARD
, "no-witness-yet", true);
368 // Rather not work on nonstandard transactions (unless -testnet/-regtest)
370 if (fRequireStandard
&& !IsStandardTx(tx
, reason
, witnessEnabled
))
371 return state
.DoS(0, false, REJECT_NONSTANDARD
, reason
);
373 // Only accept nLockTime-using transactions that can be mined in the next
374 // block; we don't want our mempool filled up with transactions that can't
376 if (!CheckFinalTx(tx
, STANDARD_LOCKTIME_VERIFY_FLAGS
))
377 return state
.DoS(0, false, REJECT_NONSTANDARD
, "non-final");
379 // is it already in the memory pool?
380 if (pool
.exists(hash
))
381 return state
.Invalid(false, REJECT_ALREADY_KNOWN
, "txn-already-in-mempool");
383 // Check for conflicts with in-memory transactions
384 std::set
<uint256
> setConflicts
;
386 LOCK(pool
.cs
); // protect pool.mapNextTx
387 BOOST_FOREACH(const CTxIn
&txin
, tx
.vin
)
389 auto itConflicting
= pool
.mapNextTx
.find(txin
.prevout
);
390 if (itConflicting
!= pool
.mapNextTx
.end())
392 const CTransaction
*ptxConflicting
= itConflicting
->second
;
393 if (!setConflicts
.count(ptxConflicting
->GetHash()))
395 // Allow opt-out of transaction replacement by setting
396 // nSequence >= maxint-1 on all inputs.
398 // maxint-1 is picked to still allow use of nLockTime by
399 // non-replaceable transactions. All inputs rather than just one
400 // is for the sake of multi-party protocols, where we don't
401 // want a single party to be able to disable replacement.
403 // The opt-out ignores descendants as anyone relying on
404 // first-seen mempool behavior should be checking all
405 // unconfirmed ancestors anyway; doing otherwise is hopelessly
407 bool fReplacementOptOut
= true;
408 if (fEnableReplacement
)
410 BOOST_FOREACH(const CTxIn
&_txin
, ptxConflicting
->vin
)
412 if (_txin
.nSequence
< std::numeric_limits
<unsigned int>::max()-1)
414 fReplacementOptOut
= false;
419 if (fReplacementOptOut
)
420 return state
.Invalid(false, REJECT_CONFLICT
, "txn-mempool-conflict");
422 setConflicts
.insert(ptxConflicting
->GetHash());
430 CCoinsViewCache
view(&dummy
);
432 CAmount nValueIn
= 0;
436 CCoinsViewMemPool
viewMemPool(pcoinsTip
, pool
);
437 view
.SetBackend(viewMemPool
);
439 // do we already have it?
440 bool fHadTxInCache
= pcoinsTip
->HaveCoinsInCache(hash
);
441 if (view
.HaveCoins(hash
)) {
443 vHashTxnToUncache
.push_back(hash
);
444 return state
.Invalid(false, REJECT_ALREADY_KNOWN
, "txn-already-known");
447 // do all inputs exist?
448 // Note that this does not check for the presence of actual outputs (see the next check for that),
449 // and only helps with filling in pfMissingInputs (to determine missing vs spent).
450 BOOST_FOREACH(const CTxIn txin
, tx
.vin
) {
451 if (!pcoinsTip
->HaveCoinsInCache(txin
.prevout
.hash
))
452 vHashTxnToUncache
.push_back(txin
.prevout
.hash
);
453 if (!view
.HaveCoins(txin
.prevout
.hash
)) {
455 *pfMissingInputs
= true;
456 return false; // fMissingInputs and !state.IsInvalid() is used to detect this condition, don't set state.Invalid()
460 // are the actual inputs available?
461 if (!view
.HaveInputs(tx
))
462 return state
.Invalid(false, REJECT_DUPLICATE
, "bad-txns-inputs-spent");
464 // Bring the best block into scope
467 nValueIn
= view
.GetValueIn(tx
);
469 // we have all inputs cached now, so switch back to dummy, so we don't need to keep lock on mempool
470 view
.SetBackend(dummy
);
472 // Only accept BIP68 sequence locked transactions that can be mined in the next
473 // block; we don't want our mempool filled up with transactions that can't
475 // Must keep pool.cs for this unless we change CheckSequenceLocks to take a
476 // CoinsViewCache instead of create its own
477 if (!CheckSequenceLocks(tx
, STANDARD_LOCKTIME_VERIFY_FLAGS
, &lp
))
478 return state
.DoS(0, false, REJECT_NONSTANDARD
, "non-BIP68-final");
481 // Check for non-standard pay-to-script-hash in inputs
482 if (fRequireStandard
&& !AreInputsStandard(tx
, view
))
483 return state
.Invalid(false, REJECT_NONSTANDARD
, "bad-txns-nonstandard-inputs");
485 // Check for non-standard witness in P2WSH
486 if (tx
.HasWitness() && fRequireStandard
&& !IsWitnessStandard(tx
, view
))
487 return state
.DoS(0, false, REJECT_NONSTANDARD
, "bad-witness-nonstandard", true);
489 int64_t nSigOpsCost
= GetTransactionSigOpCost(tx
, view
, STANDARD_SCRIPT_VERIFY_FLAGS
);
491 CAmount nValueOut
= tx
.GetValueOut();
492 CAmount nFees
= nValueIn
-nValueOut
;
493 // nModifiedFees includes any fee deltas from PrioritiseTransaction
494 CAmount nModifiedFees
= nFees
;
495 pool
.ApplyDelta(hash
, nModifiedFees
);
497 // Keep track of transactions that spend a coinbase, which we re-scan
498 // during reorgs to ensure COINBASE_MATURITY is still met.
499 bool fSpendsCoinbase
= false;
500 BOOST_FOREACH(const CTxIn
&txin
, tx
.vin
) {
501 const Coin
&coin
= view
.AccessCoin(txin
.prevout
);
502 if (coin
.IsCoinBase()) {
503 fSpendsCoinbase
= true;
508 CTxMemPoolEntry
entry(ptx
, nFees
, nAcceptTime
, chainActive
.Height(),
509 fSpendsCoinbase
, nSigOpsCost
, lp
);
510 unsigned int nSize
= entry
.GetTxSize();
512 // Check that the transaction doesn't have an excessive number of
513 // sigops, making it impossible to mine. Since the coinbase transaction
514 // itself can contain sigops MAX_STANDARD_TX_SIGOPS is less than
515 // MAX_BLOCK_SIGOPS; we still consider this an invalid rather than
516 // merely non-standard transaction.
517 if (nSigOpsCost
> MAX_STANDARD_TX_SIGOPS_COST
)
518 return state
.DoS(0, false, REJECT_NONSTANDARD
, "bad-txns-too-many-sigops", false,
519 strprintf("%d", nSigOpsCost
));
521 CAmount mempoolRejectFee
= pool
.GetMinFee(GetArg("-maxmempool", DEFAULT_MAX_MEMPOOL_SIZE
) * 1000000).GetFee(nSize
);
522 if (mempoolRejectFee
> 0 && nModifiedFees
< mempoolRejectFee
) {
523 return state
.DoS(0, false, REJECT_INSUFFICIENTFEE
, "mempool min fee not met", false, strprintf("%d < %d", nFees
, mempoolRejectFee
));
526 // No transactions are allowed below minRelayTxFee except from disconnected blocks
527 if (fLimitFree
&& nModifiedFees
< ::minRelayTxFee
.GetFee(nSize
)) {
528 return state
.DoS(0, false, REJECT_INSUFFICIENTFEE
, "min relay fee not met");
531 if (nAbsurdFee
&& nFees
> nAbsurdFee
)
532 return state
.Invalid(false,
533 REJECT_HIGHFEE
, "absurdly-high-fee",
534 strprintf("%d > %d", nFees
, nAbsurdFee
));
536 // Calculate in-mempool ancestors, up to a limit.
537 CTxMemPool::setEntries setAncestors
;
538 size_t nLimitAncestors
= GetArg("-limitancestorcount", DEFAULT_ANCESTOR_LIMIT
);
539 size_t nLimitAncestorSize
= GetArg("-limitancestorsize", DEFAULT_ANCESTOR_SIZE_LIMIT
)*1000;
540 size_t nLimitDescendants
= GetArg("-limitdescendantcount", DEFAULT_DESCENDANT_LIMIT
);
541 size_t nLimitDescendantSize
= GetArg("-limitdescendantsize", DEFAULT_DESCENDANT_SIZE_LIMIT
)*1000;
542 std::string errString
;
543 if (!pool
.CalculateMemPoolAncestors(entry
, setAncestors
, nLimitAncestors
, nLimitAncestorSize
, nLimitDescendants
, nLimitDescendantSize
, errString
)) {
544 return state
.DoS(0, false, REJECT_NONSTANDARD
, "too-long-mempool-chain", false, errString
);
547 // A transaction that spends outputs that would be replaced by it is invalid. Now
548 // that we have the set of all ancestors we can detect this
549 // pathological case by making sure setConflicts and setAncestors don't
551 BOOST_FOREACH(CTxMemPool::txiter ancestorIt
, setAncestors
)
553 const uint256
&hashAncestor
= ancestorIt
->GetTx().GetHash();
554 if (setConflicts
.count(hashAncestor
))
556 return state
.DoS(10, false,
557 REJECT_INVALID
, "bad-txns-spends-conflicting-tx", false,
558 strprintf("%s spends conflicting transaction %s",
560 hashAncestor
.ToString()));
564 // Check if it's economically rational to mine this transaction rather
565 // than the ones it replaces.
566 CAmount nConflictingFees
= 0;
567 size_t nConflictingSize
= 0;
568 uint64_t nConflictingCount
= 0;
569 CTxMemPool::setEntries allConflicting
;
571 // If we don't hold the lock allConflicting might be incomplete; the
572 // subsequent RemoveStaged() and addUnchecked() calls don't guarantee
573 // mempool consistency for us.
575 const bool fReplacementTransaction
= setConflicts
.size();
576 if (fReplacementTransaction
)
578 CFeeRate
newFeeRate(nModifiedFees
, nSize
);
579 std::set
<uint256
> setConflictsParents
;
580 const int maxDescendantsToVisit
= 100;
581 CTxMemPool::setEntries setIterConflicting
;
582 BOOST_FOREACH(const uint256
&hashConflicting
, setConflicts
)
584 CTxMemPool::txiter mi
= pool
.mapTx
.find(hashConflicting
);
585 if (mi
== pool
.mapTx
.end())
588 // Save these to avoid repeated lookups
589 setIterConflicting
.insert(mi
);
591 // Don't allow the replacement to reduce the feerate of the
594 // We usually don't want to accept replacements with lower
595 // feerates than what they replaced as that would lower the
596 // feerate of the next block. Requiring that the feerate always
597 // be increased is also an easy-to-reason about way to prevent
598 // DoS attacks via replacements.
600 // The mining code doesn't (currently) take children into
601 // account (CPFP) so we only consider the feerates of
602 // transactions being directly replaced, not their indirect
603 // descendants. While that does mean high feerate children are
604 // ignored when deciding whether or not to replace, we do
605 // require the replacement to pay more overall fees too,
606 // mitigating most cases.
607 CFeeRate
oldFeeRate(mi
->GetModifiedFee(), mi
->GetTxSize());
608 if (newFeeRate
<= oldFeeRate
)
610 return state
.DoS(0, false,
611 REJECT_INSUFFICIENTFEE
, "insufficient fee", false,
612 strprintf("rejecting replacement %s; new feerate %s <= old feerate %s",
614 newFeeRate
.ToString(),
615 oldFeeRate
.ToString()));
618 BOOST_FOREACH(const CTxIn
&txin
, mi
->GetTx().vin
)
620 setConflictsParents
.insert(txin
.prevout
.hash
);
623 nConflictingCount
+= mi
->GetCountWithDescendants();
625 // This potentially overestimates the number of actual descendants
626 // but we just want to be conservative to avoid doing too much
628 if (nConflictingCount
<= maxDescendantsToVisit
) {
629 // If not too many to replace, then calculate the set of
630 // transactions that would have to be evicted
631 BOOST_FOREACH(CTxMemPool::txiter it
, setIterConflicting
) {
632 pool
.CalculateDescendants(it
, allConflicting
);
634 BOOST_FOREACH(CTxMemPool::txiter it
, allConflicting
) {
635 nConflictingFees
+= it
->GetModifiedFee();
636 nConflictingSize
+= it
->GetTxSize();
639 return state
.DoS(0, false,
640 REJECT_NONSTANDARD
, "too many potential replacements", false,
641 strprintf("rejecting replacement %s; too many potential replacements (%d > %d)\n",
644 maxDescendantsToVisit
));
647 for (unsigned int j
= 0; j
< tx
.vin
.size(); j
++)
649 // We don't want to accept replacements that require low
650 // feerate junk to be mined first. Ideally we'd keep track of
651 // the ancestor feerates and make the decision based on that,
652 // but for now requiring all new inputs to be confirmed works.
653 if (!setConflictsParents
.count(tx
.vin
[j
].prevout
.hash
))
655 // Rather than check the UTXO set - potentially expensive -
656 // it's cheaper to just check if the new input refers to a
657 // tx that's in the mempool.
658 if (pool
.mapTx
.find(tx
.vin
[j
].prevout
.hash
) != pool
.mapTx
.end())
659 return state
.DoS(0, false,
660 REJECT_NONSTANDARD
, "replacement-adds-unconfirmed", false,
661 strprintf("replacement %s adds unconfirmed input, idx %d",
662 hash
.ToString(), j
));
666 // The replacement must pay greater fees than the transactions it
667 // replaces - if we did the bandwidth used by those conflicting
668 // transactions would not be paid for.
669 if (nModifiedFees
< nConflictingFees
)
671 return state
.DoS(0, false,
672 REJECT_INSUFFICIENTFEE
, "insufficient fee", false,
673 strprintf("rejecting replacement %s, less fees than conflicting txs; %s < %s",
674 hash
.ToString(), FormatMoney(nModifiedFees
), FormatMoney(nConflictingFees
)));
677 // Finally in addition to paying more fees than the conflicts the
678 // new transaction must pay for its own bandwidth.
679 CAmount nDeltaFees
= nModifiedFees
- nConflictingFees
;
680 if (nDeltaFees
< ::incrementalRelayFee
.GetFee(nSize
))
682 return state
.DoS(0, false,
683 REJECT_INSUFFICIENTFEE
, "insufficient fee", false,
684 strprintf("rejecting replacement %s, not enough additional fees to relay; %s < %s",
686 FormatMoney(nDeltaFees
),
687 FormatMoney(::incrementalRelayFee
.GetFee(nSize
))));
691 unsigned int scriptVerifyFlags
= STANDARD_SCRIPT_VERIFY_FLAGS
;
692 if (!Params().RequireStandard()) {
693 scriptVerifyFlags
= GetArg("-promiscuousmempoolflags", scriptVerifyFlags
);
696 // Check against previous transactions
697 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
698 PrecomputedTransactionData
txdata(tx
);
699 if (!CheckInputs(tx
, state
, view
, true, scriptVerifyFlags
, true, txdata
)) {
700 // SCRIPT_VERIFY_CLEANSTACK requires SCRIPT_VERIFY_WITNESS, so we
701 // need to turn both off, and compare against just turning off CLEANSTACK
702 // to see if the failure is specifically due to witness validation.
703 CValidationState stateDummy
; // Want reported failures to be from first CheckInputs
704 if (!tx
.HasWitness() && CheckInputs(tx
, stateDummy
, view
, true, scriptVerifyFlags
& ~(SCRIPT_VERIFY_WITNESS
| SCRIPT_VERIFY_CLEANSTACK
), true, txdata
) &&
705 !CheckInputs(tx
, stateDummy
, view
, true, scriptVerifyFlags
& ~SCRIPT_VERIFY_CLEANSTACK
, true, txdata
)) {
706 // Only the witness is missing, so the transaction itself may be fine.
707 state
.SetCorruptionPossible();
709 return false; // state filled in by CheckInputs
712 // Check again against just the consensus-critical mandatory script
713 // verification flags, in case of bugs in the standard flags that cause
714 // transactions to pass as valid when they're actually invalid. For
715 // instance the STRICTENC flag was incorrectly allowing certain
716 // CHECKSIG NOT scripts to pass, even though they were invalid.
718 // There is a similar check in CreateNewBlock() to prevent creating
719 // invalid blocks, however allowing such transactions into the mempool
720 // can be exploited as a DoS attack.
721 if (!CheckInputs(tx
, state
, view
, true, MANDATORY_SCRIPT_VERIFY_FLAGS
, true, txdata
))
723 return error("%s: BUG! PLEASE REPORT THIS! ConnectInputs failed against MANDATORY but not STANDARD flags %s, %s",
724 __func__
, hash
.ToString(), FormatStateMessage(state
));
727 // Remove conflicting transactions from the mempool
728 BOOST_FOREACH(const CTxMemPool::txiter it
, allConflicting
)
730 LogPrint(BCLog::MEMPOOL
, "replacing tx %s with %s for %s BTC additional fees, %d delta bytes\n",
731 it
->GetTx().GetHash().ToString(),
733 FormatMoney(nModifiedFees
- nConflictingFees
),
734 (int)nSize
- (int)nConflictingSize
);
736 plTxnReplaced
->push_back(it
->GetSharedTx());
738 pool
.RemoveStaged(allConflicting
, false, MemPoolRemovalReason::REPLACED
);
740 // This transaction should only count for fee estimation if it isn't a
741 // BIP 125 replacement transaction (may not be widely supported), the
742 // node is not behind, and the transaction is not dependent on any other
743 // transactions in the mempool.
744 bool validForFeeEstimation
= !fReplacementTransaction
&& IsCurrentForFeeEstimation() && pool
.HasNoInputsOf(tx
);
746 // Store transaction in memory
747 pool
.addUnchecked(hash
, entry
, setAncestors
, validForFeeEstimation
);
749 // trim mempool and check if tx was trimmed
750 if (!fOverrideMempoolLimit
) {
751 LimitMempoolSize(pool
, GetArg("-maxmempool", DEFAULT_MAX_MEMPOOL_SIZE
) * 1000000, GetArg("-mempoolexpiry", DEFAULT_MEMPOOL_EXPIRY
) * 60 * 60);
752 if (!pool
.exists(hash
))
753 return state
.DoS(0, false, REJECT_INSUFFICIENTFEE
, "mempool full");
757 GetMainSignals().TransactionAddedToMempool(ptx
);
762 bool AcceptToMemoryPoolWithTime(CTxMemPool
& pool
, CValidationState
&state
, const CTransactionRef
&tx
, bool fLimitFree
,
763 bool* pfMissingInputs
, int64_t nAcceptTime
, std::list
<CTransactionRef
>* plTxnReplaced
,
764 bool fOverrideMempoolLimit
, const CAmount nAbsurdFee
)
766 std::vector
<uint256
> vHashTxToUncache
;
767 bool res
= AcceptToMemoryPoolWorker(pool
, state
, tx
, fLimitFree
, pfMissingInputs
, nAcceptTime
, plTxnReplaced
, fOverrideMempoolLimit
, nAbsurdFee
, vHashTxToUncache
);
769 BOOST_FOREACH(const uint256
& hashTx
, vHashTxToUncache
)
770 pcoinsTip
->Uncache(hashTx
);
772 // After we've (potentially) uncached entries, ensure our coins cache is still within its size limits
773 CValidationState stateDummy
;
774 FlushStateToDisk(stateDummy
, FLUSH_STATE_PERIODIC
);
778 bool AcceptToMemoryPool(CTxMemPool
& pool
, CValidationState
&state
, const CTransactionRef
&tx
, bool fLimitFree
,
779 bool* pfMissingInputs
, std::list
<CTransactionRef
>* plTxnReplaced
,
780 bool fOverrideMempoolLimit
, const CAmount nAbsurdFee
)
782 return AcceptToMemoryPoolWithTime(pool
, state
, tx
, fLimitFree
, pfMissingInputs
, GetTime(), plTxnReplaced
, fOverrideMempoolLimit
, nAbsurdFee
);
785 /** Return transaction in txOut, and if it was found inside a block, its hash is placed in hashBlock */
786 bool GetTransaction(const uint256
&hash
, CTransactionRef
&txOut
, const Consensus::Params
& consensusParams
, uint256
&hashBlock
, bool fAllowSlow
)
788 CBlockIndex
*pindexSlow
= NULL
;
792 CTransactionRef ptx
= mempool
.get(hash
);
801 if (pblocktree
->ReadTxIndex(hash
, postx
)) {
802 CAutoFile
file(OpenBlockFile(postx
, true), SER_DISK
, CLIENT_VERSION
);
804 return error("%s: OpenBlockFile failed", __func__
);
808 fseek(file
.Get(), postx
.nTxOffset
, SEEK_CUR
);
810 } catch (const std::exception
& e
) {
811 return error("%s: Deserialize or I/O error - %s", __func__
, e
.what());
813 hashBlock
= header
.GetHash();
814 if (txOut
->GetHash() != hash
)
815 return error("%s: txid mismatch", __func__
);
820 if (fAllowSlow
) { // use coin database to locate block that contains transaction, and scan it
821 const Coin
& coin
= AccessByTxid(*pcoinsTip
, hash
);
822 if (!coin
.IsPruned()) pindexSlow
= chainActive
[coin
.nHeight
];
827 if (ReadBlockFromDisk(block
, pindexSlow
, consensusParams
)) {
828 for (const auto& tx
: block
.vtx
) {
829 if (tx
->GetHash() == hash
) {
831 hashBlock
= pindexSlow
->GetBlockHash();
846 //////////////////////////////////////////////////////////////////////////////
848 // CBlock and CBlockIndex
851 bool WriteBlockToDisk(const CBlock
& block
, CDiskBlockPos
& pos
, const CMessageHeader::MessageStartChars
& messageStart
)
853 // Open history file to append
854 CAutoFile
fileout(OpenBlockFile(pos
), SER_DISK
, CLIENT_VERSION
);
855 if (fileout
.IsNull())
856 return error("WriteBlockToDisk: OpenBlockFile failed");
858 // Write index header
859 unsigned int nSize
= GetSerializeSize(fileout
, block
);
860 fileout
<< FLATDATA(messageStart
) << nSize
;
863 long fileOutPos
= ftell(fileout
.Get());
865 return error("WriteBlockToDisk: ftell failed");
866 pos
.nPos
= (unsigned int)fileOutPos
;
872 bool ReadBlockFromDisk(CBlock
& block
, const CDiskBlockPos
& pos
, const Consensus::Params
& consensusParams
)
876 // Open history file to read
877 CAutoFile
filein(OpenBlockFile(pos
, true), SER_DISK
, CLIENT_VERSION
);
879 return error("ReadBlockFromDisk: OpenBlockFile failed for %s", pos
.ToString());
885 catch (const std::exception
& e
) {
886 return error("%s: Deserialize or I/O error - %s at %s", __func__
, e
.what(), pos
.ToString());
890 if (!CheckProofOfWork(block
.GetHash(), block
.nBits
, consensusParams
))
891 return error("ReadBlockFromDisk: Errors in block header at %s", pos
.ToString());
896 bool ReadBlockFromDisk(CBlock
& block
, const CBlockIndex
* pindex
, const Consensus::Params
& consensusParams
)
898 if (!ReadBlockFromDisk(block
, pindex
->GetBlockPos(), consensusParams
))
900 if (block
.GetHash() != pindex
->GetBlockHash())
901 return error("ReadBlockFromDisk(CBlock&, CBlockIndex*): GetHash() doesn't match index for %s at %s",
902 pindex
->ToString(), pindex
->GetBlockPos().ToString());
906 CAmount
GetBlockSubsidy(int nHeight
, const Consensus::Params
& consensusParams
)
908 int halvings
= nHeight
/ consensusParams
.nSubsidyHalvingInterval
;
909 // Force block reward to zero when right shift is undefined.
913 CAmount nSubsidy
= 50 * COIN
;
914 // Subsidy is cut in half every 210,000 blocks which will occur approximately every 4 years.
915 nSubsidy
>>= halvings
;
919 bool IsInitialBlockDownload()
921 const CChainParams
& chainParams
= Params();
923 // Once this function has returned false, it must remain false.
924 static std::atomic
<bool> latchToFalse
{false};
925 // Optimization: pre-test latch before taking the lock.
926 if (latchToFalse
.load(std::memory_order_relaxed
))
930 if (latchToFalse
.load(std::memory_order_relaxed
))
932 if (fImporting
|| fReindex
)
934 if (chainActive
.Tip() == NULL
)
936 if (chainActive
.Tip()->nChainWork
< UintToArith256(chainParams
.GetConsensus().nMinimumChainWork
))
938 if (chainActive
.Tip()->GetBlockTime() < (GetTime() - nMaxTipAge
))
940 LogPrintf("Leaving InitialBlockDownload (latching to false)\n");
941 latchToFalse
.store(true, std::memory_order_relaxed
);
945 CBlockIndex
*pindexBestForkTip
= NULL
, *pindexBestForkBase
= NULL
;
947 static void AlertNotify(const std::string
& strMessage
)
949 uiInterface
.NotifyAlertChanged();
950 std::string strCmd
= GetArg("-alertnotify", "");
951 if (strCmd
.empty()) return;
953 // Alert text should be plain ascii coming from a trusted source, but to
954 // be safe we first strip anything not in safeChars, then add single quotes around
955 // the whole string before passing it to the shell:
956 std::string
singleQuote("'");
957 std::string safeStatus
= SanitizeString(strMessage
);
958 safeStatus
= singleQuote
+safeStatus
+singleQuote
;
959 boost::replace_all(strCmd
, "%s", safeStatus
);
961 boost::thread
t(runCommand
, strCmd
); // thread runs free
964 void CheckForkWarningConditions()
966 AssertLockHeld(cs_main
);
967 // Before we get past initial download, we cannot reliably alert about forks
968 // (we assume we don't get stuck on a fork before finishing our initial sync)
969 if (IsInitialBlockDownload())
972 // If our best fork is no longer within 72 blocks (+/- 12 hours if no one mines it)
973 // of our head, drop it
974 if (pindexBestForkTip
&& chainActive
.Height() - pindexBestForkTip
->nHeight
>= 72)
975 pindexBestForkTip
= NULL
;
977 if (pindexBestForkTip
|| (pindexBestInvalid
&& pindexBestInvalid
->nChainWork
> chainActive
.Tip()->nChainWork
+ (GetBlockProof(*chainActive
.Tip()) * 6)))
979 if (!GetfLargeWorkForkFound() && pindexBestForkBase
)
981 std::string warning
= std::string("'Warning: Large-work fork detected, forking after block ") +
982 pindexBestForkBase
->phashBlock
->ToString() + std::string("'");
983 AlertNotify(warning
);
985 if (pindexBestForkTip
&& pindexBestForkBase
)
987 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__
,
988 pindexBestForkBase
->nHeight
, pindexBestForkBase
->phashBlock
->ToString(),
989 pindexBestForkTip
->nHeight
, pindexBestForkTip
->phashBlock
->ToString());
990 SetfLargeWorkForkFound(true);
994 LogPrintf("%s: Warning: Found invalid chain at least ~6 blocks longer than our best chain.\nChain state database corruption likely.\n", __func__
);
995 SetfLargeWorkInvalidChainFound(true);
1000 SetfLargeWorkForkFound(false);
1001 SetfLargeWorkInvalidChainFound(false);
1005 void CheckForkWarningConditionsOnNewFork(CBlockIndex
* pindexNewForkTip
)
1007 AssertLockHeld(cs_main
);
1008 // If we are on a fork that is sufficiently large, set a warning flag
1009 CBlockIndex
* pfork
= pindexNewForkTip
;
1010 CBlockIndex
* plonger
= chainActive
.Tip();
1011 while (pfork
&& pfork
!= plonger
)
1013 while (plonger
&& plonger
->nHeight
> pfork
->nHeight
)
1014 plonger
= plonger
->pprev
;
1015 if (pfork
== plonger
)
1017 pfork
= pfork
->pprev
;
1020 // We define a condition where we should warn the user about as a fork of at least 7 blocks
1021 // with a tip within 72 blocks (+/- 12 hours if no one mines it) of ours
1022 // We use 7 blocks rather arbitrarily as it represents just under 10% of sustained network
1023 // hash rate operating on the fork.
1024 // or a chain that is entirely longer than ours and invalid (note that this should be detected by both)
1025 // We define it this way because it allows us to only store the highest fork tip (+ base) which meets
1026 // the 7-block condition and from this always have the most-likely-to-cause-warning fork
1027 if (pfork
&& (!pindexBestForkTip
|| (pindexBestForkTip
&& pindexNewForkTip
->nHeight
> pindexBestForkTip
->nHeight
)) &&
1028 pindexNewForkTip
->nChainWork
- pfork
->nChainWork
> (GetBlockProof(*pfork
) * 7) &&
1029 chainActive
.Height() - pindexNewForkTip
->nHeight
< 72)
1031 pindexBestForkTip
= pindexNewForkTip
;
1032 pindexBestForkBase
= pfork
;
1035 CheckForkWarningConditions();
1038 void static InvalidChainFound(CBlockIndex
* pindexNew
)
1040 if (!pindexBestInvalid
|| pindexNew
->nChainWork
> pindexBestInvalid
->nChainWork
)
1041 pindexBestInvalid
= pindexNew
;
1043 LogPrintf("%s: invalid block=%s height=%d log2_work=%.8g date=%s\n", __func__
,
1044 pindexNew
->GetBlockHash().ToString(), pindexNew
->nHeight
,
1045 log(pindexNew
->nChainWork
.getdouble())/log(2.0), DateTimeStrFormat("%Y-%m-%d %H:%M:%S",
1046 pindexNew
->GetBlockTime()));
1047 CBlockIndex
*tip
= chainActive
.Tip();
1049 LogPrintf("%s: current best=%s height=%d log2_work=%.8g date=%s\n", __func__
,
1050 tip
->GetBlockHash().ToString(), chainActive
.Height(), log(tip
->nChainWork
.getdouble())/log(2.0),
1051 DateTimeStrFormat("%Y-%m-%d %H:%M:%S", tip
->GetBlockTime()));
1052 CheckForkWarningConditions();
1055 void static InvalidBlockFound(CBlockIndex
*pindex
, const CValidationState
&state
) {
1056 if (!state
.CorruptionPossible()) {
1057 pindex
->nStatus
|= BLOCK_FAILED_VALID
;
1058 setDirtyBlockIndex
.insert(pindex
);
1059 setBlockIndexCandidates
.erase(pindex
);
1060 InvalidChainFound(pindex
);
1064 void UpdateCoins(const CTransaction
& tx
, CCoinsViewCache
& inputs
, CTxUndo
&txundo
, int nHeight
)
1066 // mark inputs spent
1067 if (!tx
.IsCoinBase()) {
1068 txundo
.vprevout
.reserve(tx
.vin
.size());
1069 BOOST_FOREACH(const CTxIn
&txin
, tx
.vin
) {
1070 txundo
.vprevout
.emplace_back();
1071 inputs
.SpendCoin(txin
.prevout
, &txundo
.vprevout
.back());
1075 AddCoins(inputs
, tx
, nHeight
);
1078 void UpdateCoins(const CTransaction
& tx
, CCoinsViewCache
& inputs
, int nHeight
)
1081 UpdateCoins(tx
, inputs
, txundo
, nHeight
);
1084 bool CScriptCheck::operator()() {
1085 const CScript
&scriptSig
= ptxTo
->vin
[nIn
].scriptSig
;
1086 const CScriptWitness
*witness
= &ptxTo
->vin
[nIn
].scriptWitness
;
1087 return VerifyScript(scriptSig
, scriptPubKey
, witness
, nFlags
, CachingTransactionSignatureChecker(ptxTo
, nIn
, amount
, cacheStore
, *txdata
), &error
);
1090 int GetSpendHeight(const CCoinsViewCache
& inputs
)
1093 CBlockIndex
* pindexPrev
= mapBlockIndex
.find(inputs
.GetBestBlock())->second
;
1094 return pindexPrev
->nHeight
+ 1;
1097 bool CheckInputs(const CTransaction
& tx
, CValidationState
&state
, const CCoinsViewCache
&inputs
, bool fScriptChecks
, unsigned int flags
, bool cacheStore
, PrecomputedTransactionData
& txdata
, std::vector
<CScriptCheck
> *pvChecks
)
1099 if (!tx
.IsCoinBase())
1101 if (!Consensus::CheckTxInputs(tx
, state
, inputs
, GetSpendHeight(inputs
)))
1105 pvChecks
->reserve(tx
.vin
.size());
1107 // The first loop above does all the inexpensive checks.
1108 // Only if ALL inputs pass do we perform expensive ECDSA signature checks.
1109 // Helps prevent CPU exhaustion attacks.
1111 // Skip script verification when connecting blocks under the
1112 // assumevalid block. Assuming the assumevalid block is valid this
1113 // is safe because block merkle hashes are still computed and checked,
1114 // Of course, if an assumed valid block is invalid due to false scriptSigs
1115 // this optimization would allow an invalid chain to be accepted.
1116 if (fScriptChecks
) {
1117 for (unsigned int i
= 0; i
< tx
.vin
.size(); i
++) {
1118 const COutPoint
&prevout
= tx
.vin
[i
].prevout
;
1119 const CCoins
* coins
= inputs
.AccessCoins(prevout
.hash
);
1123 CScriptCheck
check(*coins
, tx
, i
, flags
, cacheStore
, &txdata
);
1125 pvChecks
->push_back(CScriptCheck());
1126 check
.swap(pvChecks
->back());
1127 } else if (!check()) {
1128 if (flags
& STANDARD_NOT_MANDATORY_VERIFY_FLAGS
) {
1129 // Check whether the failure was caused by a
1130 // non-mandatory script verification check, such as
1131 // non-standard DER encodings or non-null dummy
1132 // arguments; if so, don't trigger DoS protection to
1133 // avoid splitting the network between upgraded and
1134 // non-upgraded nodes.
1135 CScriptCheck
check2(*coins
, tx
, i
,
1136 flags
& ~STANDARD_NOT_MANDATORY_VERIFY_FLAGS
, cacheStore
, &txdata
);
1138 return state
.Invalid(false, REJECT_NONSTANDARD
, strprintf("non-mandatory-script-verify-flag (%s)", ScriptErrorString(check
.GetScriptError())));
1140 // Failures of other flags indicate a transaction that is
1141 // invalid in new blocks, e.g. a invalid P2SH. We DoS ban
1142 // such nodes as they are not following the protocol. That
1143 // said during an upgrade careful thought should be taken
1144 // as to the correct behavior - we may want to continue
1145 // peering with non-upgraded nodes even after soft-fork
1146 // super-majority signaling has occurred.
1147 return state
.DoS(100,false, REJECT_INVALID
, strprintf("mandatory-script-verify-flag-failed (%s)", ScriptErrorString(check
.GetScriptError())));
1158 bool UndoWriteToDisk(const CBlockUndo
& blockundo
, CDiskBlockPos
& pos
, const uint256
& hashBlock
, const CMessageHeader::MessageStartChars
& messageStart
)
1160 // Open history file to append
1161 CAutoFile
fileout(OpenUndoFile(pos
), SER_DISK
, CLIENT_VERSION
);
1162 if (fileout
.IsNull())
1163 return error("%s: OpenUndoFile failed", __func__
);
1165 // Write index header
1166 unsigned int nSize
= GetSerializeSize(fileout
, blockundo
);
1167 fileout
<< FLATDATA(messageStart
) << nSize
;
1170 long fileOutPos
= ftell(fileout
.Get());
1172 return error("%s: ftell failed", __func__
);
1173 pos
.nPos
= (unsigned int)fileOutPos
;
1174 fileout
<< blockundo
;
1176 // calculate & write checksum
1177 CHashWriter
hasher(SER_GETHASH
, PROTOCOL_VERSION
);
1178 hasher
<< hashBlock
;
1179 hasher
<< blockundo
;
1180 fileout
<< hasher
.GetHash();
1185 bool UndoReadFromDisk(CBlockUndo
& blockundo
, const CDiskBlockPos
& pos
, const uint256
& hashBlock
)
1187 // Open history file to read
1188 CAutoFile
filein(OpenUndoFile(pos
, true), SER_DISK
, CLIENT_VERSION
);
1189 if (filein
.IsNull())
1190 return error("%s: OpenUndoFile failed", __func__
);
1193 uint256 hashChecksum
;
1194 CHashVerifier
<CAutoFile
> verifier(&filein
); // We need a CHashVerifier as reserializing may lose data
1196 verifier
<< hashBlock
;
1197 verifier
>> blockundo
;
1198 filein
>> hashChecksum
;
1200 catch (const std::exception
& e
) {
1201 return error("%s: Deserialize or I/O error - %s", __func__
, e
.what());
1205 if (hashChecksum
!= verifier
.GetHash())
1206 return error("%s: Checksum mismatch", __func__
);
1211 /** Abort with a message */
1212 bool AbortNode(const std::string
& strMessage
, const std::string
& userMessage
="")
1214 SetMiscWarning(strMessage
);
1215 LogPrintf("*** %s\n", strMessage
);
1216 uiInterface
.ThreadSafeMessageBox(
1217 userMessage
.empty() ? _("Error: A fatal internal error occurred, see debug.log for details") : userMessage
,
1218 "", CClientUIInterface::MSG_ERROR
);
1223 bool AbortNode(CValidationState
& state
, const std::string
& strMessage
, const std::string
& userMessage
="")
1225 AbortNode(strMessage
, userMessage
);
1226 return state
.Error(strMessage
);
1231 enum DisconnectResult
1233 DISCONNECT_OK
, // All good.
1234 DISCONNECT_UNCLEAN
, // Rolled back, but UTXO set was inconsistent with block.
1235 DISCONNECT_FAILED
// Something else went wrong.
1239 * Restore the UTXO in a Coin at a given COutPoint
1240 * @param undo The Coin to be restored.
1241 * @param view The coins view to which to apply the changes.
1242 * @param out The out point that corresponds to the tx input.
1243 * @return A DisconnectResult as an int
1245 int ApplyTxInUndo(Coin
&& undo
, CCoinsViewCache
& view
, const COutPoint
& out
)
1249 if (view
.HaveCoins(out
)) fClean
= false; // overwriting transaction output
1251 if (undo
.nHeight
== 0) {
1252 // Missing undo metadata (height and coinbase). Older versions included this
1253 // information only in undo records for the last spend of a transactions'
1254 // outputs. This implies that it must be present for some other output of the same tx.
1255 const Coin
& alternate
= AccessByTxid(view
, out
.hash
);
1256 if (!alternate
.IsPruned()) {
1257 undo
.nHeight
= alternate
.nHeight
;
1258 undo
.fCoinBase
= alternate
.fCoinBase
;
1260 return DISCONNECT_FAILED
; // adding output for transaction without known metadata
1263 view
.AddCoin(out
, std::move(undo
), undo
.fCoinBase
);
1265 return fClean
? DISCONNECT_OK
: DISCONNECT_UNCLEAN
;
1268 /** Undo the effects of this block (with given index) on the UTXO set represented by coins.
1269 * When UNCLEAN or FAILED is returned, view is left in an indeterminate state. */
1270 static DisconnectResult
DisconnectBlock(const CBlock
& block
, const CBlockIndex
* pindex
, CCoinsViewCache
& view
)
1272 assert(pindex
->GetBlockHash() == view
.GetBestBlock());
1276 CBlockUndo blockUndo
;
1277 CDiskBlockPos pos
= pindex
->GetUndoPos();
1279 error("DisconnectBlock(): no undo data available");
1280 return DISCONNECT_FAILED
;
1282 if (!UndoReadFromDisk(blockUndo
, pos
, pindex
->pprev
->GetBlockHash())) {
1283 error("DisconnectBlock(): failure reading undo data");
1284 return DISCONNECT_FAILED
;
1287 if (blockUndo
.vtxundo
.size() + 1 != block
.vtx
.size()) {
1288 error("DisconnectBlock(): block and undo data inconsistent");
1289 return DISCONNECT_FAILED
;
1292 // undo transactions in reverse order
1293 for (int i
= block
.vtx
.size() - 1; i
>= 0; i
--) {
1294 const CTransaction
&tx
= *(block
.vtx
[i
]);
1295 uint256 hash
= tx
.GetHash();
1297 // Check that all outputs are available and match the outputs in the block itself
1299 for (size_t o
= 0; o
< tx
.vout
.size(); o
++) {
1300 if (!tx
.vout
[o
].scriptPubKey
.IsUnspendable()) {
1301 COutPoint
out(hash
, o
);
1303 view
.SpendCoin(out
, &coin
);
1304 if (tx
.vout
[o
] != coin
.out
) {
1305 fClean
= false; // transaction output mismatch
1311 if (i
> 0) { // not coinbases
1312 CTxUndo
&txundo
= blockUndo
.vtxundo
[i
-1];
1313 if (txundo
.vprevout
.size() != tx
.vin
.size()) {
1314 error("DisconnectBlock(): transaction and undo data inconsistent");
1315 return DISCONNECT_FAILED
;
1317 for (unsigned int j
= tx
.vin
.size(); j
-- > 0;) {
1318 const COutPoint
&out
= tx
.vin
[j
].prevout
;
1319 int res
= ApplyTxInUndo(std::move(txundo
.vprevout
[j
]), view
, out
);
1320 if (res
== DISCONNECT_FAILED
) return DISCONNECT_FAILED
;
1321 fClean
= fClean
&& res
!= DISCONNECT_UNCLEAN
;
1323 // At this point, all of txundo.vprevout should have been moved out.
1327 // move best block pointer to prevout block
1328 view
.SetBestBlock(pindex
->pprev
->GetBlockHash());
1330 return fClean
? DISCONNECT_OK
: DISCONNECT_UNCLEAN
;
1333 void static FlushBlockFile(bool fFinalize
= false)
1335 LOCK(cs_LastBlockFile
);
1337 CDiskBlockPos
posOld(nLastBlockFile
, 0);
1339 FILE *fileOld
= OpenBlockFile(posOld
);
1342 TruncateFile(fileOld
, vinfoBlockFile
[nLastBlockFile
].nSize
);
1343 FileCommit(fileOld
);
1347 fileOld
= OpenUndoFile(posOld
);
1350 TruncateFile(fileOld
, vinfoBlockFile
[nLastBlockFile
].nUndoSize
);
1351 FileCommit(fileOld
);
1356 bool FindUndoPos(CValidationState
&state
, int nFile
, CDiskBlockPos
&pos
, unsigned int nAddSize
);
1358 static CCheckQueue
<CScriptCheck
> scriptcheckqueue(128);
1360 void ThreadScriptCheck() {
1361 RenameThread("bitcoin-scriptch");
1362 scriptcheckqueue
.Thread();
1365 // Protected by cs_main
1366 VersionBitsCache versionbitscache
;
1368 int32_t ComputeBlockVersion(const CBlockIndex
* pindexPrev
, const Consensus::Params
& params
)
1371 int32_t nVersion
= VERSIONBITS_TOP_BITS
;
1373 for (int i
= 0; i
< (int)Consensus::MAX_VERSION_BITS_DEPLOYMENTS
; i
++) {
1374 ThresholdState state
= VersionBitsState(pindexPrev
, params
, (Consensus::DeploymentPos
)i
, versionbitscache
);
1375 if (state
== THRESHOLD_LOCKED_IN
|| state
== THRESHOLD_STARTED
) {
1376 nVersion
|= VersionBitsMask(params
, (Consensus::DeploymentPos
)i
);
1384 * Threshold condition checker that triggers when unknown versionbits are seen on the network.
1386 class WarningBitsConditionChecker
: public AbstractThresholdConditionChecker
1392 WarningBitsConditionChecker(int bitIn
) : bit(bitIn
) {}
1394 int64_t BeginTime(const Consensus::Params
& params
) const { return 0; }
1395 int64_t EndTime(const Consensus::Params
& params
) const { return std::numeric_limits
<int64_t>::max(); }
1396 int Period(const Consensus::Params
& params
) const { return params
.nMinerConfirmationWindow
; }
1397 int Threshold(const Consensus::Params
& params
) const { return params
.nRuleChangeActivationThreshold
; }
1399 bool Condition(const CBlockIndex
* pindex
, const Consensus::Params
& params
) const
1401 return ((pindex
->nVersion
& VERSIONBITS_TOP_MASK
) == VERSIONBITS_TOP_BITS
) &&
1402 ((pindex
->nVersion
>> bit
) & 1) != 0 &&
1403 ((ComputeBlockVersion(pindex
->pprev
, params
) >> bit
) & 1) == 0;
1407 // Protected by cs_main
1408 static ThresholdConditionCache warningcache
[VERSIONBITS_NUM_BITS
];
1410 static int64_t nTimeCheck
= 0;
1411 static int64_t nTimeForks
= 0;
1412 static int64_t nTimeVerify
= 0;
1413 static int64_t nTimeConnect
= 0;
1414 static int64_t nTimeIndex
= 0;
1415 static int64_t nTimeCallbacks
= 0;
1416 static int64_t nTimeTotal
= 0;
1418 /** Apply the effects of this block (with given index) on the UTXO set represented by coins.
1419 * Validity checks that depend on the UTXO set are also done; ConnectBlock()
1420 * can fail if those validity checks fail (among other reasons). */
1421 static bool ConnectBlock(const CBlock
& block
, CValidationState
& state
, CBlockIndex
* pindex
,
1422 CCoinsViewCache
& view
, const CChainParams
& chainparams
, bool fJustCheck
= false)
1424 AssertLockHeld(cs_main
);
1426 // pindex->phashBlock can be null if called by CreateNewBlock/TestBlockValidity
1427 assert((pindex
->phashBlock
== NULL
) ||
1428 (*pindex
->phashBlock
== block
.GetHash()));
1429 int64_t nTimeStart
= GetTimeMicros();
1431 // Check it again in case a previous version let a bad block in
1432 if (!CheckBlock(block
, state
, chainparams
.GetConsensus(), !fJustCheck
, !fJustCheck
))
1433 return error("%s: Consensus::CheckBlock: %s", __func__
, FormatStateMessage(state
));
1435 // verify that the view's current state corresponds to the previous block
1436 uint256 hashPrevBlock
= pindex
->pprev
== NULL
? uint256() : pindex
->pprev
->GetBlockHash();
1437 assert(hashPrevBlock
== view
.GetBestBlock());
1439 // Special case for the genesis block, skipping connection of its transactions
1440 // (its coinbase is unspendable)
1441 if (block
.GetHash() == chainparams
.GetConsensus().hashGenesisBlock
) {
1443 view
.SetBestBlock(pindex
->GetBlockHash());
1447 bool fScriptChecks
= true;
1448 if (!hashAssumeValid
.IsNull()) {
1449 // We've been configured with the hash of a block which has been externally verified to have a valid history.
1450 // A suitable default value is included with the software and updated from time to time. Because validity
1451 // relative to a piece of software is an objective fact these defaults can be easily reviewed.
1452 // This setting doesn't force the selection of any particular chain but makes validating some faster by
1453 // effectively caching the result of part of the verification.
1454 BlockMap::const_iterator it
= mapBlockIndex
.find(hashAssumeValid
);
1455 if (it
!= mapBlockIndex
.end()) {
1456 if (it
->second
->GetAncestor(pindex
->nHeight
) == pindex
&&
1457 pindexBestHeader
->GetAncestor(pindex
->nHeight
) == pindex
&&
1458 pindexBestHeader
->nChainWork
>= UintToArith256(chainparams
.GetConsensus().nMinimumChainWork
)) {
1459 // This block is a member of the assumed verified chain and an ancestor of the best header.
1460 // The equivalent time check discourages hash power from extorting the network via DOS attack
1461 // into accepting an invalid block through telling users they must manually set assumevalid.
1462 // Requiring a software change or burying the invalid block, regardless of the setting, makes
1463 // it hard to hide the implication of the demand. This also avoids having release candidates
1464 // that are hardly doing any signature verification at all in testing without having to
1465 // artificially set the default assumed verified block further back.
1466 // The test against nMinimumChainWork prevents the skipping when denied access to any chain at
1467 // least as good as the expected chain.
1468 fScriptChecks
= (GetBlockProofEquivalentTime(*pindexBestHeader
, *pindex
, *pindexBestHeader
, chainparams
.GetConsensus()) <= 60 * 60 * 24 * 7 * 2);
1473 int64_t nTime1
= GetTimeMicros(); nTimeCheck
+= nTime1
- nTimeStart
;
1474 LogPrint(BCLog::BENCH
, " - Sanity checks: %.2fms [%.2fs]\n", 0.001 * (nTime1
- nTimeStart
), nTimeCheck
* 0.000001);
1476 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1477 // unless those are already completely spent.
1478 // If such overwrites are allowed, coinbases and transactions depending upon those
1479 // can be duplicated to remove the ability to spend the first instance -- even after
1480 // being sent to another address.
1481 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1482 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1483 // already refuses previously-known transaction ids entirely.
1484 // This rule was originally applied to all blocks with a timestamp after March 15, 2012, 0:00 UTC.
1485 // Now that the whole chain is irreversibly beyond that time it is applied to all blocks except the
1486 // two in the chain that violate it. This prevents exploiting the issue against nodes during their
1487 // initial block download.
1488 bool fEnforceBIP30
= (!pindex
->phashBlock
) || // Enforce on CreateNewBlock invocations which don't have a hash.
1489 !((pindex
->nHeight
==91842 && pindex
->GetBlockHash() == uint256S("0x00000000000a4d0a398161ffc163c503763b1f4360639393e0e4c8e300e0caec")) ||
1490 (pindex
->nHeight
==91880 && pindex
->GetBlockHash() == uint256S("0x00000000000743f190a18c5577a3c2d2a1f610ae9601ac046a38084ccb7cd721")));
1492 // Once BIP34 activated it was not possible to create new duplicate coinbases and thus other than starting
1493 // with the 2 existing duplicate coinbase pairs, not possible to create overwriting txs. But by the
1494 // time BIP34 activated, in each of the existing pairs the duplicate coinbase had overwritten the first
1495 // before the first had been spent. Since those coinbases are sufficiently buried its no longer possible to create further
1496 // duplicate transactions descending from the known pairs either.
1497 // 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.
1498 CBlockIndex
*pindexBIP34height
= pindex
->pprev
->GetAncestor(chainparams
.GetConsensus().BIP34Height
);
1499 //Only continue to enforce if we're below BIP34 activation height or the block hash at that height doesn't correspond.
1500 fEnforceBIP30
= fEnforceBIP30
&& (!pindexBIP34height
|| !(pindexBIP34height
->GetBlockHash() == chainparams
.GetConsensus().BIP34Hash
));
1502 if (fEnforceBIP30
) {
1503 for (const auto& tx
: block
.vtx
) {
1504 for (size_t o
= 0; o
< tx
->vout
.size(); o
++) {
1505 if (view
.HaveCoins(COutPoint(tx
->GetHash(), o
))) {
1506 return state
.DoS(100, error("ConnectBlock(): tried to overwrite transaction"),
1507 REJECT_INVALID
, "bad-txns-BIP30");
1513 // BIP16 didn't become active until Apr 1 2012
1514 int64_t nBIP16SwitchTime
= 1333238400;
1515 bool fStrictPayToScriptHash
= (pindex
->GetBlockTime() >= nBIP16SwitchTime
);
1517 unsigned int flags
= fStrictPayToScriptHash
? SCRIPT_VERIFY_P2SH
: SCRIPT_VERIFY_NONE
;
1519 // Start enforcing the DERSIG (BIP66) rule
1520 if (pindex
->nHeight
>= chainparams
.GetConsensus().BIP66Height
) {
1521 flags
|= SCRIPT_VERIFY_DERSIG
;
1524 // Start enforcing CHECKLOCKTIMEVERIFY (BIP65) rule
1525 if (pindex
->nHeight
>= chainparams
.GetConsensus().BIP65Height
) {
1526 flags
|= SCRIPT_VERIFY_CHECKLOCKTIMEVERIFY
;
1529 // Start enforcing BIP68 (sequence locks) and BIP112 (CHECKSEQUENCEVERIFY) using versionbits logic.
1530 int nLockTimeFlags
= 0;
1531 if (VersionBitsState(pindex
->pprev
, chainparams
.GetConsensus(), Consensus::DEPLOYMENT_CSV
, versionbitscache
) == THRESHOLD_ACTIVE
) {
1532 flags
|= SCRIPT_VERIFY_CHECKSEQUENCEVERIFY
;
1533 nLockTimeFlags
|= LOCKTIME_VERIFY_SEQUENCE
;
1536 // Start enforcing WITNESS rules using versionbits logic.
1537 if (IsWitnessEnabled(pindex
->pprev
, chainparams
.GetConsensus())) {
1538 flags
|= SCRIPT_VERIFY_WITNESS
;
1539 flags
|= SCRIPT_VERIFY_NULLDUMMY
;
1542 int64_t nTime2
= GetTimeMicros(); nTimeForks
+= nTime2
- nTime1
;
1543 LogPrint(BCLog::BENCH
, " - Fork checks: %.2fms [%.2fs]\n", 0.001 * (nTime2
- nTime1
), nTimeForks
* 0.000001);
1545 CBlockUndo blockundo
;
1547 CCheckQueueControl
<CScriptCheck
> control(fScriptChecks
&& nScriptCheckThreads
? &scriptcheckqueue
: NULL
);
1549 std::vector
<int> prevheights
;
1552 int64_t nSigOpsCost
= 0;
1553 CDiskTxPos
pos(pindex
->GetBlockPos(), GetSizeOfCompactSize(block
.vtx
.size()));
1554 std::vector
<std::pair
<uint256
, CDiskTxPos
> > vPos
;
1555 vPos
.reserve(block
.vtx
.size());
1556 blockundo
.vtxundo
.reserve(block
.vtx
.size() - 1);
1557 std::vector
<PrecomputedTransactionData
> txdata
;
1558 txdata
.reserve(block
.vtx
.size()); // Required so that pointers to individual PrecomputedTransactionData don't get invalidated
1559 for (unsigned int i
= 0; i
< block
.vtx
.size(); i
++)
1561 const CTransaction
&tx
= *(block
.vtx
[i
]);
1563 nInputs
+= tx
.vin
.size();
1565 if (!tx
.IsCoinBase())
1567 if (!view
.HaveInputs(tx
))
1568 return state
.DoS(100, error("ConnectBlock(): inputs missing/spent"),
1569 REJECT_INVALID
, "bad-txns-inputs-missingorspent");
1571 // Check that transaction is BIP68 final
1572 // BIP68 lock checks (as opposed to nLockTime checks) must
1573 // be in ConnectBlock because they require the UTXO set
1574 prevheights
.resize(tx
.vin
.size());
1575 for (size_t j
= 0; j
< tx
.vin
.size(); j
++) {
1576 prevheights
[j
] = view
.AccessCoin(tx
.vin
[j
].prevout
).nHeight
;
1579 if (!SequenceLocks(tx
, nLockTimeFlags
, &prevheights
, *pindex
)) {
1580 return state
.DoS(100, error("%s: contains a non-BIP68-final transaction", __func__
),
1581 REJECT_INVALID
, "bad-txns-nonfinal");
1585 // GetTransactionSigOpCost counts 3 types of sigops:
1586 // * legacy (always)
1587 // * p2sh (when P2SH enabled in flags and excludes coinbase)
1588 // * witness (when witness enabled in flags and excludes coinbase)
1589 nSigOpsCost
+= GetTransactionSigOpCost(tx
, view
, flags
);
1590 if (nSigOpsCost
> MAX_BLOCK_SIGOPS_COST
)
1591 return state
.DoS(100, error("ConnectBlock(): too many sigops"),
1592 REJECT_INVALID
, "bad-blk-sigops");
1594 txdata
.emplace_back(tx
);
1595 if (!tx
.IsCoinBase())
1597 nFees
+= view
.GetValueIn(tx
)-tx
.GetValueOut();
1599 std::vector
<CScriptCheck
> vChecks
;
1600 bool fCacheResults
= fJustCheck
; /* Don't cache results if we're actually connecting blocks (still consult the cache, though) */
1601 if (!CheckInputs(tx
, state
, view
, fScriptChecks
, flags
, fCacheResults
, txdata
[i
], nScriptCheckThreads
? &vChecks
: NULL
))
1602 return error("ConnectBlock(): CheckInputs on %s failed with %s",
1603 tx
.GetHash().ToString(), FormatStateMessage(state
));
1604 control
.Add(vChecks
);
1609 blockundo
.vtxundo
.push_back(CTxUndo());
1611 UpdateCoins(tx
, view
, i
== 0 ? undoDummy
: blockundo
.vtxundo
.back(), pindex
->nHeight
);
1613 vPos
.push_back(std::make_pair(tx
.GetHash(), pos
));
1614 pos
.nTxOffset
+= ::GetSerializeSize(tx
, SER_DISK
, CLIENT_VERSION
);
1616 int64_t nTime3
= GetTimeMicros(); nTimeConnect
+= nTime3
- nTime2
;
1617 LogPrint(BCLog::BENCH
, " - Connect %u transactions: %.2fms (%.3fms/tx, %.3fms/txin) [%.2fs]\n", (unsigned)block
.vtx
.size(), 0.001 * (nTime3
- nTime2
), 0.001 * (nTime3
- nTime2
) / block
.vtx
.size(), nInputs
<= 1 ? 0 : 0.001 * (nTime3
- nTime2
) / (nInputs
-1), nTimeConnect
* 0.000001);
1619 CAmount blockReward
= nFees
+ GetBlockSubsidy(pindex
->nHeight
, chainparams
.GetConsensus());
1620 if (block
.vtx
[0]->GetValueOut() > blockReward
)
1621 return state
.DoS(100,
1622 error("ConnectBlock(): coinbase pays too much (actual=%d vs limit=%d)",
1623 block
.vtx
[0]->GetValueOut(), blockReward
),
1624 REJECT_INVALID
, "bad-cb-amount");
1626 if (!control
.Wait())
1627 return state
.DoS(100, error("%s: CheckQueue failed", __func__
), REJECT_INVALID
, "block-validation-failed");
1628 int64_t nTime4
= GetTimeMicros(); nTimeVerify
+= nTime4
- nTime2
;
1629 LogPrint(BCLog::BENCH
, " - Verify %u txins: %.2fms (%.3fms/txin) [%.2fs]\n", nInputs
- 1, 0.001 * (nTime4
- nTime2
), nInputs
<= 1 ? 0 : 0.001 * (nTime4
- nTime2
) / (nInputs
-1), nTimeVerify
* 0.000001);
1634 // Write undo information to disk
1635 if (pindex
->GetUndoPos().IsNull() || !pindex
->IsValid(BLOCK_VALID_SCRIPTS
))
1637 if (pindex
->GetUndoPos().IsNull()) {
1639 if (!FindUndoPos(state
, pindex
->nFile
, _pos
, ::GetSerializeSize(blockundo
, SER_DISK
, CLIENT_VERSION
) + 40))
1640 return error("ConnectBlock(): FindUndoPos failed");
1641 if (!UndoWriteToDisk(blockundo
, _pos
, pindex
->pprev
->GetBlockHash(), chainparams
.MessageStart()))
1642 return AbortNode(state
, "Failed to write undo data");
1644 // update nUndoPos in block index
1645 pindex
->nUndoPos
= _pos
.nPos
;
1646 pindex
->nStatus
|= BLOCK_HAVE_UNDO
;
1649 pindex
->RaiseValidity(BLOCK_VALID_SCRIPTS
);
1650 setDirtyBlockIndex
.insert(pindex
);
1654 if (!pblocktree
->WriteTxIndex(vPos
))
1655 return AbortNode(state
, "Failed to write transaction index");
1657 // add this block to the view's block chain
1658 view
.SetBestBlock(pindex
->GetBlockHash());
1660 int64_t nTime5
= GetTimeMicros(); nTimeIndex
+= nTime5
- nTime4
;
1661 LogPrint(BCLog::BENCH
, " - Index writing: %.2fms [%.2fs]\n", 0.001 * (nTime5
- nTime4
), nTimeIndex
* 0.000001);
1663 int64_t nTime6
= GetTimeMicros(); nTimeCallbacks
+= nTime6
- nTime5
;
1664 LogPrint(BCLog::BENCH
, " - Callbacks: %.2fms [%.2fs]\n", 0.001 * (nTime6
- nTime5
), nTimeCallbacks
* 0.000001);
1670 * Update the on-disk chain state.
1671 * The caches and indexes are flushed depending on the mode we're called with
1672 * if they're too large, if it's been a while since the last write,
1673 * or always and in all cases if we're in prune mode and are deleting files.
1675 bool static FlushStateToDisk(CValidationState
&state
, FlushStateMode mode
, int nManualPruneHeight
) {
1676 int64_t nMempoolUsage
= mempool
.DynamicMemoryUsage();
1677 const CChainParams
& chainparams
= Params();
1678 LOCK2(cs_main
, cs_LastBlockFile
);
1679 static int64_t nLastWrite
= 0;
1680 static int64_t nLastFlush
= 0;
1681 static int64_t nLastSetChain
= 0;
1682 std::set
<int> setFilesToPrune
;
1683 bool fFlushForPrune
= false;
1685 if (fPruneMode
&& (fCheckForPruning
|| nManualPruneHeight
> 0) && !fReindex
) {
1686 if (nManualPruneHeight
> 0) {
1687 FindFilesToPruneManual(setFilesToPrune
, nManualPruneHeight
);
1689 FindFilesToPrune(setFilesToPrune
, chainparams
.PruneAfterHeight());
1690 fCheckForPruning
= false;
1692 if (!setFilesToPrune
.empty()) {
1693 fFlushForPrune
= true;
1695 pblocktree
->WriteFlag("prunedblockfiles", true);
1700 int64_t nNow
= GetTimeMicros();
1701 // Avoid writing/flushing immediately after startup.
1702 if (nLastWrite
== 0) {
1705 if (nLastFlush
== 0) {
1708 if (nLastSetChain
== 0) {
1709 nLastSetChain
= nNow
;
1711 int64_t nMempoolSizeMax
= GetArg("-maxmempool", DEFAULT_MAX_MEMPOOL_SIZE
) * 1000000;
1712 int64_t cacheSize
= pcoinsTip
->DynamicMemoryUsage() * DB_PEAK_USAGE_FACTOR
;
1713 int64_t nTotalSpace
= nCoinCacheUsage
+ std::max
<int64_t>(nMempoolSizeMax
- nMempoolUsage
, 0);
1714 // The cache is large and we're within 10% and 200 MiB or 50% and 50MiB of the limit, but we have time now (not in the middle of a block processing).
1715 bool fCacheLarge
= mode
== FLUSH_STATE_PERIODIC
&& cacheSize
> std::min(std::max(nTotalSpace
/ 2, nTotalSpace
- MIN_BLOCK_COINSDB_USAGE
* 1024 * 1024),
1716 std::max((9 * nTotalSpace
) / 10, nTotalSpace
- MAX_BLOCK_COINSDB_USAGE
* 1024 * 1024));
1717 // The cache is over the limit, we have to write now.
1718 bool fCacheCritical
= mode
== FLUSH_STATE_IF_NEEDED
&& cacheSize
> nTotalSpace
;
1719 // 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.
1720 bool fPeriodicWrite
= mode
== FLUSH_STATE_PERIODIC
&& nNow
> nLastWrite
+ (int64_t)DATABASE_WRITE_INTERVAL
* 1000000;
1721 // It's been very long since we flushed the cache. Do this infrequently, to optimize cache usage.
1722 bool fPeriodicFlush
= mode
== FLUSH_STATE_PERIODIC
&& nNow
> nLastFlush
+ (int64_t)DATABASE_FLUSH_INTERVAL
* 1000000;
1723 // Combine all conditions that result in a full cache flush.
1724 bool fDoFullFlush
= (mode
== FLUSH_STATE_ALWAYS
) || fCacheLarge
|| fCacheCritical
|| fPeriodicFlush
|| fFlushForPrune
;
1725 // Write blocks and block index to disk.
1726 if (fDoFullFlush
|| fPeriodicWrite
) {
1727 // Depend on nMinDiskSpace to ensure we can write block index
1728 if (!CheckDiskSpace(0))
1729 return state
.Error("out of disk space");
1730 // First make sure all block and undo data is flushed to disk.
1732 // Then update all block file information (which may refer to block and undo files).
1734 std::vector
<std::pair
<int, const CBlockFileInfo
*> > vFiles
;
1735 vFiles
.reserve(setDirtyFileInfo
.size());
1736 for (std::set
<int>::iterator it
= setDirtyFileInfo
.begin(); it
!= setDirtyFileInfo
.end(); ) {
1737 vFiles
.push_back(std::make_pair(*it
, &vinfoBlockFile
[*it
]));
1738 setDirtyFileInfo
.erase(it
++);
1740 std::vector
<const CBlockIndex
*> vBlocks
;
1741 vBlocks
.reserve(setDirtyBlockIndex
.size());
1742 for (std::set
<CBlockIndex
*>::iterator it
= setDirtyBlockIndex
.begin(); it
!= setDirtyBlockIndex
.end(); ) {
1743 vBlocks
.push_back(*it
);
1744 setDirtyBlockIndex
.erase(it
++);
1746 if (!pblocktree
->WriteBatchSync(vFiles
, nLastBlockFile
, vBlocks
)) {
1747 return AbortNode(state
, "Failed to write to block index database");
1750 // Finally remove any pruned files
1752 UnlinkPrunedFiles(setFilesToPrune
);
1755 // Flush best chain related state. This can only be done if the blocks / block index write was also done.
1757 // Typical CCoins structures on disk are around 128 bytes in size.
1758 // Pushing a new one to the database can cause it to be written
1759 // twice (once in the log, and once in the tables). This is already
1760 // an overestimation, as most will delete an existing entry or
1761 // overwrite one. Still, use a conservative safety factor of 2.
1762 if (!CheckDiskSpace(128 * 2 * 2 * pcoinsTip
->GetCacheSize()))
1763 return state
.Error("out of disk space");
1764 // Flush the chainstate (which may refer to block index entries).
1765 if (!pcoinsTip
->Flush())
1766 return AbortNode(state
, "Failed to write to coin database");
1769 if (fDoFullFlush
|| ((mode
== FLUSH_STATE_ALWAYS
|| mode
== FLUSH_STATE_PERIODIC
) && nNow
> nLastSetChain
+ (int64_t)DATABASE_WRITE_INTERVAL
* 1000000)) {
1770 // Update best block in wallet (so we can detect restored wallets).
1771 GetMainSignals().SetBestChain(chainActive
.GetLocator());
1772 nLastSetChain
= nNow
;
1774 } catch (const std::runtime_error
& e
) {
1775 return AbortNode(state
, std::string("System error while flushing: ") + e
.what());
1780 void FlushStateToDisk() {
1781 CValidationState state
;
1782 FlushStateToDisk(state
, FLUSH_STATE_ALWAYS
);
1785 void PruneAndFlush() {
1786 CValidationState state
;
1787 fCheckForPruning
= true;
1788 FlushStateToDisk(state
, FLUSH_STATE_NONE
);
1791 /** Update chainActive and related internal data structures. */
1792 void static UpdateTip(CBlockIndex
*pindexNew
, const CChainParams
& chainParams
) {
1793 chainActive
.SetTip(pindexNew
);
1796 mempool
.AddTransactionsUpdated(1);
1798 cvBlockChange
.notify_all();
1800 static bool fWarned
= false;
1801 std::vector
<std::string
> warningMessages
;
1802 if (!IsInitialBlockDownload())
1805 const CBlockIndex
* pindex
= chainActive
.Tip();
1806 for (int bit
= 0; bit
< VERSIONBITS_NUM_BITS
; bit
++) {
1807 WarningBitsConditionChecker
checker(bit
);
1808 ThresholdState state
= checker
.GetStateFor(pindex
, chainParams
.GetConsensus(), warningcache
[bit
]);
1809 if (state
== THRESHOLD_ACTIVE
|| state
== THRESHOLD_LOCKED_IN
) {
1810 if (state
== THRESHOLD_ACTIVE
) {
1811 std::string strWarning
= strprintf(_("Warning: unknown new rules activated (versionbit %i)"), bit
);
1812 SetMiscWarning(strWarning
);
1814 AlertNotify(strWarning
);
1818 warningMessages
.push_back(strprintf("unknown new rules are about to activate (versionbit %i)", bit
));
1822 // Check the version of the last 100 blocks to see if we need to upgrade:
1823 for (int i
= 0; i
< 100 && pindex
!= NULL
; i
++)
1825 int32_t nExpectedVersion
= ComputeBlockVersion(pindex
->pprev
, chainParams
.GetConsensus());
1826 if (pindex
->nVersion
> VERSIONBITS_LAST_OLD_BLOCK_VERSION
&& (pindex
->nVersion
& ~nExpectedVersion
) != 0)
1828 pindex
= pindex
->pprev
;
1831 warningMessages
.push_back(strprintf("%d of last 100 blocks have unexpected version", nUpgraded
));
1832 if (nUpgraded
> 100/2)
1834 std::string strWarning
= _("Warning: Unknown block versions being mined! It's possible unknown rules are in effect");
1835 // notify GetWarnings(), called by Qt and the JSON-RPC code to warn the user:
1836 SetMiscWarning(strWarning
);
1838 AlertNotify(strWarning
);
1843 LogPrintf("%s: new best=%s height=%d version=0x%08x log2_work=%.8g tx=%lu date='%s' progress=%f cache=%.1fMiB(%utx)", __func__
,
1844 chainActive
.Tip()->GetBlockHash().ToString(), chainActive
.Height(), chainActive
.Tip()->nVersion
,
1845 log(chainActive
.Tip()->nChainWork
.getdouble())/log(2.0), (unsigned long)chainActive
.Tip()->nChainTx
,
1846 DateTimeStrFormat("%Y-%m-%d %H:%M:%S", chainActive
.Tip()->GetBlockTime()),
1847 GuessVerificationProgress(chainParams
.TxData(), chainActive
.Tip()), pcoinsTip
->DynamicMemoryUsage() * (1.0 / (1<<20)), pcoinsTip
->GetCacheSize());
1848 if (!warningMessages
.empty())
1849 LogPrintf(" warning='%s'", boost::algorithm::join(warningMessages
, ", "));
1854 /** Disconnect chainActive's tip. You probably want to call mempool.removeForReorg and manually re-limit mempool size after this, with cs_main held. */
1855 bool static DisconnectTip(CValidationState
& state
, const CChainParams
& chainparams
, bool fBare
= false)
1857 CBlockIndex
*pindexDelete
= chainActive
.Tip();
1858 assert(pindexDelete
);
1859 // Read block from disk.
1860 std::shared_ptr
<CBlock
> pblock
= std::make_shared
<CBlock
>();
1861 CBlock
& block
= *pblock
;
1862 if (!ReadBlockFromDisk(block
, pindexDelete
, chainparams
.GetConsensus()))
1863 return AbortNode(state
, "Failed to read block");
1864 // Apply the block atomically to the chain state.
1865 int64_t nStart
= GetTimeMicros();
1867 CCoinsViewCache
view(pcoinsTip
);
1868 if (DisconnectBlock(block
, pindexDelete
, view
) != DISCONNECT_OK
)
1869 return error("DisconnectTip(): DisconnectBlock %s failed", pindexDelete
->GetBlockHash().ToString());
1870 bool flushed
= view
.Flush();
1873 LogPrint(BCLog::BENCH
, "- Disconnect block: %.2fms\n", (GetTimeMicros() - nStart
) * 0.001);
1874 // Write the chain state to disk, if necessary.
1875 if (!FlushStateToDisk(state
, FLUSH_STATE_IF_NEEDED
))
1879 // Resurrect mempool transactions from the disconnected block.
1880 std::vector
<uint256
> vHashUpdate
;
1881 for (const auto& it
: block
.vtx
) {
1882 const CTransaction
& tx
= *it
;
1883 // ignore validation errors in resurrected transactions
1884 CValidationState stateDummy
;
1885 if (tx
.IsCoinBase() || !AcceptToMemoryPool(mempool
, stateDummy
, it
, false, NULL
, NULL
, true)) {
1886 mempool
.removeRecursive(tx
, MemPoolRemovalReason::REORG
);
1887 } else if (mempool
.exists(tx
.GetHash())) {
1888 vHashUpdate
.push_back(tx
.GetHash());
1891 // AcceptToMemoryPool/addUnchecked all assume that new mempool entries have
1892 // no in-mempool children, which is generally not true when adding
1893 // previously-confirmed transactions back to the mempool.
1894 // UpdateTransactionsFromBlock finds descendants of any transactions in this
1895 // block that were added back and cleans up the mempool state.
1896 mempool
.UpdateTransactionsFromBlock(vHashUpdate
);
1899 // Update chainActive and related variables.
1900 UpdateTip(pindexDelete
->pprev
, chainparams
);
1901 // Let wallets know transactions went from 1-confirmed to
1902 // 0-confirmed or conflicted:
1903 GetMainSignals().BlockDisconnected(pblock
);
1907 static int64_t nTimeReadFromDisk
= 0;
1908 static int64_t nTimeConnectTotal
= 0;
1909 static int64_t nTimeFlush
= 0;
1910 static int64_t nTimeChainState
= 0;
1911 static int64_t nTimePostConnect
= 0;
1913 struct PerBlockConnectTrace
{
1914 CBlockIndex
* pindex
= NULL
;
1915 std::shared_ptr
<const CBlock
> pblock
;
1916 std::shared_ptr
<std::vector
<CTransactionRef
>> conflictedTxs
;
1917 PerBlockConnectTrace() : conflictedTxs(std::make_shared
<std::vector
<CTransactionRef
>>()) {}
1920 * Used to track blocks whose transactions were applied to the UTXO state as a
1921 * part of a single ActivateBestChainStep call.
1923 * This class also tracks transactions that are removed from the mempool as
1924 * conflicts (per block) and can be used to pass all those transactions
1925 * through SyncTransaction.
1927 * This class assumes (and asserts) that the conflicted transactions for a given
1928 * block are added via mempool callbacks prior to the BlockConnected() associated
1929 * with those transactions. If any transactions are marked conflicted, it is
1930 * assumed that an associated block will always be added.
1932 * This class is single-use, once you call GetBlocksConnected() you have to throw
1933 * it away and make a new one.
1935 class ConnectTrace
{
1937 std::vector
<PerBlockConnectTrace
> blocksConnected
;
1941 ConnectTrace(CTxMemPool
&_pool
) : blocksConnected(1), pool(_pool
) {
1942 pool
.NotifyEntryRemoved
.connect(boost::bind(&ConnectTrace::NotifyEntryRemoved
, this, _1
, _2
));
1946 pool
.NotifyEntryRemoved
.disconnect(boost::bind(&ConnectTrace::NotifyEntryRemoved
, this, _1
, _2
));
1949 void BlockConnected(CBlockIndex
* pindex
, std::shared_ptr
<const CBlock
> pblock
) {
1950 assert(!blocksConnected
.back().pindex
);
1953 blocksConnected
.back().pindex
= pindex
;
1954 blocksConnected
.back().pblock
= std::move(pblock
);
1955 blocksConnected
.emplace_back();
1958 std::vector
<PerBlockConnectTrace
>& GetBlocksConnected() {
1959 // We always keep one extra block at the end of our list because
1960 // blocks are added after all the conflicted transactions have
1961 // been filled in. Thus, the last entry should always be an empty
1962 // one waiting for the transactions from the next block. We pop
1963 // the last entry here to make sure the list we return is sane.
1964 assert(!blocksConnected
.back().pindex
);
1965 assert(blocksConnected
.back().conflictedTxs
->empty());
1966 blocksConnected
.pop_back();
1967 return blocksConnected
;
1970 void NotifyEntryRemoved(CTransactionRef txRemoved
, MemPoolRemovalReason reason
) {
1971 assert(!blocksConnected
.back().pindex
);
1972 if (reason
== MemPoolRemovalReason::CONFLICT
) {
1973 blocksConnected
.back().conflictedTxs
->emplace_back(std::move(txRemoved
));
1979 * Connect a new block to chainActive. pblock is either NULL or a pointer to a CBlock
1980 * corresponding to pindexNew, to bypass loading it again from disk.
1982 * The block is added to connectTrace if connection succeeds.
1984 bool static ConnectTip(CValidationState
& state
, const CChainParams
& chainparams
, CBlockIndex
* pindexNew
, const std::shared_ptr
<const CBlock
>& pblock
, ConnectTrace
& connectTrace
)
1986 assert(pindexNew
->pprev
== chainActive
.Tip());
1987 // Read block from disk.
1988 int64_t nTime1
= GetTimeMicros();
1989 std::shared_ptr
<const CBlock
> pthisBlock
;
1991 std::shared_ptr
<CBlock
> pblockNew
= std::make_shared
<CBlock
>();
1992 if (!ReadBlockFromDisk(*pblockNew
, pindexNew
, chainparams
.GetConsensus()))
1993 return AbortNode(state
, "Failed to read block");
1994 pthisBlock
= pblockNew
;
1996 pthisBlock
= pblock
;
1998 const CBlock
& blockConnecting
= *pthisBlock
;
1999 // Apply the block atomically to the chain state.
2000 int64_t nTime2
= GetTimeMicros(); nTimeReadFromDisk
+= nTime2
- nTime1
;
2002 LogPrint(BCLog::BENCH
, " - Load block from disk: %.2fms [%.2fs]\n", (nTime2
- nTime1
) * 0.001, nTimeReadFromDisk
* 0.000001);
2004 CCoinsViewCache
view(pcoinsTip
);
2005 bool rv
= ConnectBlock(blockConnecting
, state
, pindexNew
, view
, chainparams
);
2006 GetMainSignals().BlockChecked(blockConnecting
, state
);
2008 if (state
.IsInvalid())
2009 InvalidBlockFound(pindexNew
, state
);
2010 return error("ConnectTip(): ConnectBlock %s failed", pindexNew
->GetBlockHash().ToString());
2012 nTime3
= GetTimeMicros(); nTimeConnectTotal
+= nTime3
- nTime2
;
2013 LogPrint(BCLog::BENCH
, " - Connect total: %.2fms [%.2fs]\n", (nTime3
- nTime2
) * 0.001, nTimeConnectTotal
* 0.000001);
2014 bool flushed
= view
.Flush();
2017 int64_t nTime4
= GetTimeMicros(); nTimeFlush
+= nTime4
- nTime3
;
2018 LogPrint(BCLog::BENCH
, " - Flush: %.2fms [%.2fs]\n", (nTime4
- nTime3
) * 0.001, nTimeFlush
* 0.000001);
2019 // Write the chain state to disk, if necessary.
2020 if (!FlushStateToDisk(state
, FLUSH_STATE_IF_NEEDED
))
2022 int64_t nTime5
= GetTimeMicros(); nTimeChainState
+= nTime5
- nTime4
;
2023 LogPrint(BCLog::BENCH
, " - Writing chainstate: %.2fms [%.2fs]\n", (nTime5
- nTime4
) * 0.001, nTimeChainState
* 0.000001);
2024 // Remove conflicting transactions from the mempool.;
2025 mempool
.removeForBlock(blockConnecting
.vtx
, pindexNew
->nHeight
);
2026 // Update chainActive & related variables.
2027 UpdateTip(pindexNew
, chainparams
);
2029 int64_t nTime6
= GetTimeMicros(); nTimePostConnect
+= nTime6
- nTime5
; nTimeTotal
+= nTime6
- nTime1
;
2030 LogPrint(BCLog::BENCH
, " - Connect postprocess: %.2fms [%.2fs]\n", (nTime6
- nTime5
) * 0.001, nTimePostConnect
* 0.000001);
2031 LogPrint(BCLog::BENCH
, "- Connect block: %.2fms [%.2fs]\n", (nTime6
- nTime1
) * 0.001, nTimeTotal
* 0.000001);
2033 connectTrace
.BlockConnected(pindexNew
, std::move(pthisBlock
));
2038 * Return the tip of the chain with the most work in it, that isn't
2039 * known to be invalid (it's however far from certain to be valid).
2041 static CBlockIndex
* FindMostWorkChain() {
2043 CBlockIndex
*pindexNew
= NULL
;
2045 // Find the best candidate header.
2047 std::set
<CBlockIndex
*, CBlockIndexWorkComparator
>::reverse_iterator it
= setBlockIndexCandidates
.rbegin();
2048 if (it
== setBlockIndexCandidates
.rend())
2053 // Check whether all blocks on the path between the currently active chain and the candidate are valid.
2054 // Just going until the active chain is an optimization, as we know all blocks in it are valid already.
2055 CBlockIndex
*pindexTest
= pindexNew
;
2056 bool fInvalidAncestor
= false;
2057 while (pindexTest
&& !chainActive
.Contains(pindexTest
)) {
2058 assert(pindexTest
->nChainTx
|| pindexTest
->nHeight
== 0);
2060 // Pruned nodes may have entries in setBlockIndexCandidates for
2061 // which block files have been deleted. Remove those as candidates
2062 // for the most work chain if we come across them; we can't switch
2063 // to a chain unless we have all the non-active-chain parent blocks.
2064 bool fFailedChain
= pindexTest
->nStatus
& BLOCK_FAILED_MASK
;
2065 bool fMissingData
= !(pindexTest
->nStatus
& BLOCK_HAVE_DATA
);
2066 if (fFailedChain
|| fMissingData
) {
2067 // Candidate chain is not usable (either invalid or missing data)
2068 if (fFailedChain
&& (pindexBestInvalid
== NULL
|| pindexNew
->nChainWork
> pindexBestInvalid
->nChainWork
))
2069 pindexBestInvalid
= pindexNew
;
2070 CBlockIndex
*pindexFailed
= pindexNew
;
2071 // Remove the entire chain from the set.
2072 while (pindexTest
!= pindexFailed
) {
2074 pindexFailed
->nStatus
|= BLOCK_FAILED_CHILD
;
2075 } else if (fMissingData
) {
2076 // If we're missing data, then add back to mapBlocksUnlinked,
2077 // so that if the block arrives in the future we can try adding
2078 // to setBlockIndexCandidates again.
2079 mapBlocksUnlinked
.insert(std::make_pair(pindexFailed
->pprev
, pindexFailed
));
2081 setBlockIndexCandidates
.erase(pindexFailed
);
2082 pindexFailed
= pindexFailed
->pprev
;
2084 setBlockIndexCandidates
.erase(pindexTest
);
2085 fInvalidAncestor
= true;
2088 pindexTest
= pindexTest
->pprev
;
2090 if (!fInvalidAncestor
)
2095 /** Delete all entries in setBlockIndexCandidates that are worse than the current tip. */
2096 static void PruneBlockIndexCandidates() {
2097 // Note that we can't delete the current block itself, as we may need to return to it later in case a
2098 // reorganization to a better block fails.
2099 std::set
<CBlockIndex
*, CBlockIndexWorkComparator
>::iterator it
= setBlockIndexCandidates
.begin();
2100 while (it
!= setBlockIndexCandidates
.end() && setBlockIndexCandidates
.value_comp()(*it
, chainActive
.Tip())) {
2101 setBlockIndexCandidates
.erase(it
++);
2103 // Either the current tip or a successor of it we're working towards is left in setBlockIndexCandidates.
2104 assert(!setBlockIndexCandidates
.empty());
2108 * Try to make some progress towards making pindexMostWork the active block.
2109 * pblock is either NULL or a pointer to a CBlock corresponding to pindexMostWork.
2111 static bool ActivateBestChainStep(CValidationState
& state
, const CChainParams
& chainparams
, CBlockIndex
* pindexMostWork
, const std::shared_ptr
<const CBlock
>& pblock
, bool& fInvalidFound
, ConnectTrace
& connectTrace
)
2113 AssertLockHeld(cs_main
);
2114 const CBlockIndex
*pindexOldTip
= chainActive
.Tip();
2115 const CBlockIndex
*pindexFork
= chainActive
.FindFork(pindexMostWork
);
2117 // Disconnect active blocks which are no longer in the best chain.
2118 bool fBlocksDisconnected
= false;
2119 while (chainActive
.Tip() && chainActive
.Tip() != pindexFork
) {
2120 if (!DisconnectTip(state
, chainparams
))
2122 fBlocksDisconnected
= true;
2125 // Build list of new blocks to connect.
2126 std::vector
<CBlockIndex
*> vpindexToConnect
;
2127 bool fContinue
= true;
2128 int nHeight
= pindexFork
? pindexFork
->nHeight
: -1;
2129 while (fContinue
&& nHeight
!= pindexMostWork
->nHeight
) {
2130 // Don't iterate the entire list of potential improvements toward the best tip, as we likely only need
2131 // a few blocks along the way.
2132 int nTargetHeight
= std::min(nHeight
+ 32, pindexMostWork
->nHeight
);
2133 vpindexToConnect
.clear();
2134 vpindexToConnect
.reserve(nTargetHeight
- nHeight
);
2135 CBlockIndex
*pindexIter
= pindexMostWork
->GetAncestor(nTargetHeight
);
2136 while (pindexIter
&& pindexIter
->nHeight
!= nHeight
) {
2137 vpindexToConnect
.push_back(pindexIter
);
2138 pindexIter
= pindexIter
->pprev
;
2140 nHeight
= nTargetHeight
;
2142 // Connect new blocks.
2143 BOOST_REVERSE_FOREACH(CBlockIndex
*pindexConnect
, vpindexToConnect
) {
2144 if (!ConnectTip(state
, chainparams
, pindexConnect
, pindexConnect
== pindexMostWork
? pblock
: std::shared_ptr
<const CBlock
>(), connectTrace
)) {
2145 if (state
.IsInvalid()) {
2146 // The block violates a consensus rule.
2147 if (!state
.CorruptionPossible())
2148 InvalidChainFound(vpindexToConnect
.back());
2149 state
= CValidationState();
2150 fInvalidFound
= true;
2154 // A system error occurred (disk space, database error, ...).
2158 PruneBlockIndexCandidates();
2159 if (!pindexOldTip
|| chainActive
.Tip()->nChainWork
> pindexOldTip
->nChainWork
) {
2160 // We're in a better position than we were. Return temporarily to release the lock.
2168 if (fBlocksDisconnected
) {
2169 mempool
.removeForReorg(pcoinsTip
, chainActive
.Tip()->nHeight
+ 1, STANDARD_LOCKTIME_VERIFY_FLAGS
);
2170 LimitMempoolSize(mempool
, GetArg("-maxmempool", DEFAULT_MAX_MEMPOOL_SIZE
) * 1000000, GetArg("-mempoolexpiry", DEFAULT_MEMPOOL_EXPIRY
) * 60 * 60);
2172 mempool
.check(pcoinsTip
);
2174 // Callbacks/notifications for a new best chain.
2176 CheckForkWarningConditionsOnNewFork(vpindexToConnect
.back());
2178 CheckForkWarningConditions();
2183 static void NotifyHeaderTip() {
2184 bool fNotify
= false;
2185 bool fInitialBlockDownload
= false;
2186 static CBlockIndex
* pindexHeaderOld
= NULL
;
2187 CBlockIndex
* pindexHeader
= NULL
;
2190 pindexHeader
= pindexBestHeader
;
2192 if (pindexHeader
!= pindexHeaderOld
) {
2194 fInitialBlockDownload
= IsInitialBlockDownload();
2195 pindexHeaderOld
= pindexHeader
;
2198 // Send block tip changed notifications without cs_main
2200 uiInterface
.NotifyHeaderTip(fInitialBlockDownload
, pindexHeader
);
2205 * Make the best chain active, in multiple steps. The result is either failure
2206 * or an activated best chain. pblock is either NULL or a pointer to a block
2207 * that is already loaded (to avoid loading it again from disk).
2209 bool ActivateBestChain(CValidationState
&state
, const CChainParams
& chainparams
, std::shared_ptr
<const CBlock
> pblock
) {
2210 // Note that while we're often called here from ProcessNewBlock, this is
2211 // far from a guarantee. Things in the P2P/RPC will often end up calling
2212 // us in the middle of ProcessNewBlock - do not assume pblock is set
2213 // sanely for performance or correctness!
2215 CBlockIndex
*pindexMostWork
= NULL
;
2216 CBlockIndex
*pindexNewTip
= NULL
;
2218 boost::this_thread::interruption_point();
2219 if (ShutdownRequested())
2222 const CBlockIndex
*pindexFork
;
2223 bool fInitialDownload
;
2226 ConnectTrace
connectTrace(mempool
); // Destructed before cs_main is unlocked
2228 CBlockIndex
*pindexOldTip
= chainActive
.Tip();
2229 if (pindexMostWork
== NULL
) {
2230 pindexMostWork
= FindMostWorkChain();
2233 // Whether we have anything to do at all.
2234 if (pindexMostWork
== NULL
|| pindexMostWork
== chainActive
.Tip())
2237 bool fInvalidFound
= false;
2238 std::shared_ptr
<const CBlock
> nullBlockPtr
;
2239 if (!ActivateBestChainStep(state
, chainparams
, pindexMostWork
, pblock
&& pblock
->GetHash() == pindexMostWork
->GetBlockHash() ? pblock
: nullBlockPtr
, fInvalidFound
, connectTrace
))
2242 if (fInvalidFound
) {
2243 // Wipe cache, we may need another branch now.
2244 pindexMostWork
= NULL
;
2246 pindexNewTip
= chainActive
.Tip();
2247 pindexFork
= chainActive
.FindFork(pindexOldTip
);
2248 fInitialDownload
= IsInitialBlockDownload();
2250 for (const PerBlockConnectTrace
& trace
: connectTrace
.GetBlocksConnected()) {
2251 assert(trace
.pblock
&& trace
.pindex
);
2252 GetMainSignals().BlockConnected(trace
.pblock
, trace
.pindex
, *trace
.conflictedTxs
);
2255 // When we reach this point, we switched to a new tip (stored in pindexNewTip).
2257 // Notifications/callbacks that can run without cs_main
2259 // Notify external listeners about the new tip.
2260 GetMainSignals().UpdatedBlockTip(pindexNewTip
, pindexFork
, fInitialDownload
);
2262 // Always notify the UI if a new block tip was connected
2263 if (pindexFork
!= pindexNewTip
) {
2264 uiInterface
.NotifyBlockTip(fInitialDownload
, pindexNewTip
);
2266 } while (pindexNewTip
!= pindexMostWork
);
2267 CheckBlockIndex(chainparams
.GetConsensus());
2269 // Write changes periodically to disk, after relay.
2270 if (!FlushStateToDisk(state
, FLUSH_STATE_PERIODIC
)) {
2274 int nStopAtHeight
= GetArg("-stopatheight", DEFAULT_STOPATHEIGHT
);
2275 if (nStopAtHeight
&& pindexNewTip
&& pindexNewTip
->nHeight
>= nStopAtHeight
) StartShutdown();
2281 bool PreciousBlock(CValidationState
& state
, const CChainParams
& params
, CBlockIndex
*pindex
)
2285 if (pindex
->nChainWork
< chainActive
.Tip()->nChainWork
) {
2286 // Nothing to do, this block is not at the tip.
2289 if (chainActive
.Tip()->nChainWork
> nLastPreciousChainwork
) {
2290 // The chain has been extended since the last call, reset the counter.
2291 nBlockReverseSequenceId
= -1;
2293 nLastPreciousChainwork
= chainActive
.Tip()->nChainWork
;
2294 setBlockIndexCandidates
.erase(pindex
);
2295 pindex
->nSequenceId
= nBlockReverseSequenceId
;
2296 if (nBlockReverseSequenceId
> std::numeric_limits
<int32_t>::min()) {
2297 // We can't keep reducing the counter if somebody really wants to
2298 // call preciousblock 2**31-1 times on the same set of tips...
2299 nBlockReverseSequenceId
--;
2301 if (pindex
->IsValid(BLOCK_VALID_TRANSACTIONS
) && pindex
->nChainTx
) {
2302 setBlockIndexCandidates
.insert(pindex
);
2303 PruneBlockIndexCandidates();
2307 return ActivateBestChain(state
, params
);
2310 bool InvalidateBlock(CValidationState
& state
, const CChainParams
& chainparams
, CBlockIndex
*pindex
)
2312 AssertLockHeld(cs_main
);
2314 // Mark the block itself as invalid.
2315 pindex
->nStatus
|= BLOCK_FAILED_VALID
;
2316 setDirtyBlockIndex
.insert(pindex
);
2317 setBlockIndexCandidates
.erase(pindex
);
2319 while (chainActive
.Contains(pindex
)) {
2320 CBlockIndex
*pindexWalk
= chainActive
.Tip();
2321 pindexWalk
->nStatus
|= BLOCK_FAILED_CHILD
;
2322 setDirtyBlockIndex
.insert(pindexWalk
);
2323 setBlockIndexCandidates
.erase(pindexWalk
);
2324 // ActivateBestChain considers blocks already in chainActive
2325 // unconditionally valid already, so force disconnect away from it.
2326 if (!DisconnectTip(state
, chainparams
)) {
2327 mempool
.removeForReorg(pcoinsTip
, chainActive
.Tip()->nHeight
+ 1, STANDARD_LOCKTIME_VERIFY_FLAGS
);
2332 LimitMempoolSize(mempool
, GetArg("-maxmempool", DEFAULT_MAX_MEMPOOL_SIZE
) * 1000000, GetArg("-mempoolexpiry", DEFAULT_MEMPOOL_EXPIRY
) * 60 * 60);
2334 // The resulting new best tip may not be in setBlockIndexCandidates anymore, so
2336 BlockMap::iterator it
= mapBlockIndex
.begin();
2337 while (it
!= mapBlockIndex
.end()) {
2338 if (it
->second
->IsValid(BLOCK_VALID_TRANSACTIONS
) && it
->second
->nChainTx
&& !setBlockIndexCandidates
.value_comp()(it
->second
, chainActive
.Tip())) {
2339 setBlockIndexCandidates
.insert(it
->second
);
2344 InvalidChainFound(pindex
);
2345 mempool
.removeForReorg(pcoinsTip
, chainActive
.Tip()->nHeight
+ 1, STANDARD_LOCKTIME_VERIFY_FLAGS
);
2346 uiInterface
.NotifyBlockTip(IsInitialBlockDownload(), pindex
->pprev
);
2350 bool ResetBlockFailureFlags(CBlockIndex
*pindex
) {
2351 AssertLockHeld(cs_main
);
2353 int nHeight
= pindex
->nHeight
;
2355 // Remove the invalidity flag from this block and all its descendants.
2356 BlockMap::iterator it
= mapBlockIndex
.begin();
2357 while (it
!= mapBlockIndex
.end()) {
2358 if (!it
->second
->IsValid() && it
->second
->GetAncestor(nHeight
) == pindex
) {
2359 it
->second
->nStatus
&= ~BLOCK_FAILED_MASK
;
2360 setDirtyBlockIndex
.insert(it
->second
);
2361 if (it
->second
->IsValid(BLOCK_VALID_TRANSACTIONS
) && it
->second
->nChainTx
&& setBlockIndexCandidates
.value_comp()(chainActive
.Tip(), it
->second
)) {
2362 setBlockIndexCandidates
.insert(it
->second
);
2364 if (it
->second
== pindexBestInvalid
) {
2365 // Reset invalid block marker if it was pointing to one of those.
2366 pindexBestInvalid
= NULL
;
2372 // Remove the invalidity flag from all ancestors too.
2373 while (pindex
!= NULL
) {
2374 if (pindex
->nStatus
& BLOCK_FAILED_MASK
) {
2375 pindex
->nStatus
&= ~BLOCK_FAILED_MASK
;
2376 setDirtyBlockIndex
.insert(pindex
);
2378 pindex
= pindex
->pprev
;
2383 CBlockIndex
* AddToBlockIndex(const CBlockHeader
& block
)
2385 // Check for duplicate
2386 uint256 hash
= block
.GetHash();
2387 BlockMap::iterator it
= mapBlockIndex
.find(hash
);
2388 if (it
!= mapBlockIndex
.end())
2391 // Construct new block index object
2392 CBlockIndex
* pindexNew
= new CBlockIndex(block
);
2394 // We assign the sequence id to blocks only when the full data is available,
2395 // to avoid miners withholding blocks but broadcasting headers, to get a
2396 // competitive advantage.
2397 pindexNew
->nSequenceId
= 0;
2398 BlockMap::iterator mi
= mapBlockIndex
.insert(std::make_pair(hash
, pindexNew
)).first
;
2399 pindexNew
->phashBlock
= &((*mi
).first
);
2400 BlockMap::iterator miPrev
= mapBlockIndex
.find(block
.hashPrevBlock
);
2401 if (miPrev
!= mapBlockIndex
.end())
2403 pindexNew
->pprev
= (*miPrev
).second
;
2404 pindexNew
->nHeight
= pindexNew
->pprev
->nHeight
+ 1;
2405 pindexNew
->BuildSkip();
2407 pindexNew
->nTimeMax
= (pindexNew
->pprev
? std::max(pindexNew
->pprev
->nTimeMax
, pindexNew
->nTime
) : pindexNew
->nTime
);
2408 pindexNew
->nChainWork
= (pindexNew
->pprev
? pindexNew
->pprev
->nChainWork
: 0) + GetBlockProof(*pindexNew
);
2409 pindexNew
->RaiseValidity(BLOCK_VALID_TREE
);
2410 if (pindexBestHeader
== NULL
|| pindexBestHeader
->nChainWork
< pindexNew
->nChainWork
)
2411 pindexBestHeader
= pindexNew
;
2413 setDirtyBlockIndex
.insert(pindexNew
);
2418 /** Mark a block as having its data received and checked (up to BLOCK_VALID_TRANSACTIONS). */
2419 static bool ReceivedBlockTransactions(const CBlock
&block
, CValidationState
& state
, CBlockIndex
*pindexNew
, const CDiskBlockPos
& pos
, const Consensus::Params
& consensusParams
)
2421 pindexNew
->nTx
= block
.vtx
.size();
2422 pindexNew
->nChainTx
= 0;
2423 pindexNew
->nFile
= pos
.nFile
;
2424 pindexNew
->nDataPos
= pos
.nPos
;
2425 pindexNew
->nUndoPos
= 0;
2426 pindexNew
->nStatus
|= BLOCK_HAVE_DATA
;
2427 if (IsWitnessEnabled(pindexNew
->pprev
, consensusParams
)) {
2428 pindexNew
->nStatus
|= BLOCK_OPT_WITNESS
;
2430 pindexNew
->RaiseValidity(BLOCK_VALID_TRANSACTIONS
);
2431 setDirtyBlockIndex
.insert(pindexNew
);
2433 if (pindexNew
->pprev
== NULL
|| pindexNew
->pprev
->nChainTx
) {
2434 // If pindexNew is the genesis block or all parents are BLOCK_VALID_TRANSACTIONS.
2435 std::deque
<CBlockIndex
*> queue
;
2436 queue
.push_back(pindexNew
);
2438 // Recursively process any descendant blocks that now may be eligible to be connected.
2439 while (!queue
.empty()) {
2440 CBlockIndex
*pindex
= queue
.front();
2442 pindex
->nChainTx
= (pindex
->pprev
? pindex
->pprev
->nChainTx
: 0) + pindex
->nTx
;
2444 LOCK(cs_nBlockSequenceId
);
2445 pindex
->nSequenceId
= nBlockSequenceId
++;
2447 if (chainActive
.Tip() == NULL
|| !setBlockIndexCandidates
.value_comp()(pindex
, chainActive
.Tip())) {
2448 setBlockIndexCandidates
.insert(pindex
);
2450 std::pair
<std::multimap
<CBlockIndex
*, CBlockIndex
*>::iterator
, std::multimap
<CBlockIndex
*, CBlockIndex
*>::iterator
> range
= mapBlocksUnlinked
.equal_range(pindex
);
2451 while (range
.first
!= range
.second
) {
2452 std::multimap
<CBlockIndex
*, CBlockIndex
*>::iterator it
= range
.first
;
2453 queue
.push_back(it
->second
);
2455 mapBlocksUnlinked
.erase(it
);
2459 if (pindexNew
->pprev
&& pindexNew
->pprev
->IsValid(BLOCK_VALID_TREE
)) {
2460 mapBlocksUnlinked
.insert(std::make_pair(pindexNew
->pprev
, pindexNew
));
2467 bool FindBlockPos(CValidationState
&state
, CDiskBlockPos
&pos
, unsigned int nAddSize
, unsigned int nHeight
, uint64_t nTime
, bool fKnown
= false)
2469 LOCK(cs_LastBlockFile
);
2471 unsigned int nFile
= fKnown
? pos
.nFile
: nLastBlockFile
;
2472 if (vinfoBlockFile
.size() <= nFile
) {
2473 vinfoBlockFile
.resize(nFile
+ 1);
2477 while (vinfoBlockFile
[nFile
].nSize
+ nAddSize
>= MAX_BLOCKFILE_SIZE
) {
2479 if (vinfoBlockFile
.size() <= nFile
) {
2480 vinfoBlockFile
.resize(nFile
+ 1);
2484 pos
.nPos
= vinfoBlockFile
[nFile
].nSize
;
2487 if ((int)nFile
!= nLastBlockFile
) {
2489 LogPrintf("Leaving block file %i: %s\n", nLastBlockFile
, vinfoBlockFile
[nLastBlockFile
].ToString());
2491 FlushBlockFile(!fKnown
);
2492 nLastBlockFile
= nFile
;
2495 vinfoBlockFile
[nFile
].AddBlock(nHeight
, nTime
);
2497 vinfoBlockFile
[nFile
].nSize
= std::max(pos
.nPos
+ nAddSize
, vinfoBlockFile
[nFile
].nSize
);
2499 vinfoBlockFile
[nFile
].nSize
+= nAddSize
;
2502 unsigned int nOldChunks
= (pos
.nPos
+ BLOCKFILE_CHUNK_SIZE
- 1) / BLOCKFILE_CHUNK_SIZE
;
2503 unsigned int nNewChunks
= (vinfoBlockFile
[nFile
].nSize
+ BLOCKFILE_CHUNK_SIZE
- 1) / BLOCKFILE_CHUNK_SIZE
;
2504 if (nNewChunks
> nOldChunks
) {
2506 fCheckForPruning
= true;
2507 if (CheckDiskSpace(nNewChunks
* BLOCKFILE_CHUNK_SIZE
- pos
.nPos
)) {
2508 FILE *file
= OpenBlockFile(pos
);
2510 LogPrintf("Pre-allocating up to position 0x%x in blk%05u.dat\n", nNewChunks
* BLOCKFILE_CHUNK_SIZE
, pos
.nFile
);
2511 AllocateFileRange(file
, pos
.nPos
, nNewChunks
* BLOCKFILE_CHUNK_SIZE
- pos
.nPos
);
2516 return state
.Error("out of disk space");
2520 setDirtyFileInfo
.insert(nFile
);
2524 bool FindUndoPos(CValidationState
&state
, int nFile
, CDiskBlockPos
&pos
, unsigned int nAddSize
)
2528 LOCK(cs_LastBlockFile
);
2530 unsigned int nNewSize
;
2531 pos
.nPos
= vinfoBlockFile
[nFile
].nUndoSize
;
2532 nNewSize
= vinfoBlockFile
[nFile
].nUndoSize
+= nAddSize
;
2533 setDirtyFileInfo
.insert(nFile
);
2535 unsigned int nOldChunks
= (pos
.nPos
+ UNDOFILE_CHUNK_SIZE
- 1) / UNDOFILE_CHUNK_SIZE
;
2536 unsigned int nNewChunks
= (nNewSize
+ UNDOFILE_CHUNK_SIZE
- 1) / UNDOFILE_CHUNK_SIZE
;
2537 if (nNewChunks
> nOldChunks
) {
2539 fCheckForPruning
= true;
2540 if (CheckDiskSpace(nNewChunks
* UNDOFILE_CHUNK_SIZE
- pos
.nPos
)) {
2541 FILE *file
= OpenUndoFile(pos
);
2543 LogPrintf("Pre-allocating up to position 0x%x in rev%05u.dat\n", nNewChunks
* UNDOFILE_CHUNK_SIZE
, pos
.nFile
);
2544 AllocateFileRange(file
, pos
.nPos
, nNewChunks
* UNDOFILE_CHUNK_SIZE
- pos
.nPos
);
2549 return state
.Error("out of disk space");
2555 bool CheckBlockHeader(const CBlockHeader
& block
, CValidationState
& state
, const Consensus::Params
& consensusParams
, bool fCheckPOW
)
2557 // Check proof of work matches claimed amount
2558 if (fCheckPOW
&& !CheckProofOfWork(block
.GetHash(), block
.nBits
, consensusParams
))
2559 return state
.DoS(50, false, REJECT_INVALID
, "high-hash", false, "proof of work failed");
2564 bool CheckBlock(const CBlock
& block
, CValidationState
& state
, const Consensus::Params
& consensusParams
, bool fCheckPOW
, bool fCheckMerkleRoot
)
2566 // These are checks that are independent of context.
2571 // Check that the header is valid (particularly PoW). This is mostly
2572 // redundant with the call in AcceptBlockHeader.
2573 if (!CheckBlockHeader(block
, state
, consensusParams
, fCheckPOW
))
2576 // Check the merkle root.
2577 if (fCheckMerkleRoot
) {
2579 uint256 hashMerkleRoot2
= BlockMerkleRoot(block
, &mutated
);
2580 if (block
.hashMerkleRoot
!= hashMerkleRoot2
)
2581 return state
.DoS(100, false, REJECT_INVALID
, "bad-txnmrklroot", true, "hashMerkleRoot mismatch");
2583 // Check for merkle tree malleability (CVE-2012-2459): repeating sequences
2584 // of transactions in a block without affecting the merkle root of a block,
2585 // while still invalidating it.
2587 return state
.DoS(100, false, REJECT_INVALID
, "bad-txns-duplicate", true, "duplicate transaction");
2590 // All potential-corruption validation must be done before we do any
2591 // transaction validation, as otherwise we may mark the header as invalid
2592 // because we receive the wrong transactions for it.
2593 // Note that witness malleability is checked in ContextualCheckBlock, so no
2594 // checks that use witness data may be performed here.
2597 if (block
.vtx
.empty() || block
.vtx
.size() > MAX_BLOCK_BASE_SIZE
|| ::GetSerializeSize(block
, SER_NETWORK
, PROTOCOL_VERSION
| SERIALIZE_TRANSACTION_NO_WITNESS
) > MAX_BLOCK_BASE_SIZE
)
2598 return state
.DoS(100, false, REJECT_INVALID
, "bad-blk-length", false, "size limits failed");
2600 // First transaction must be coinbase, the rest must not be
2601 if (block
.vtx
.empty() || !block
.vtx
[0]->IsCoinBase())
2602 return state
.DoS(100, false, REJECT_INVALID
, "bad-cb-missing", false, "first tx is not coinbase");
2603 for (unsigned int i
= 1; i
< block
.vtx
.size(); i
++)
2604 if (block
.vtx
[i
]->IsCoinBase())
2605 return state
.DoS(100, false, REJECT_INVALID
, "bad-cb-multiple", false, "more than one coinbase");
2607 // Check transactions
2608 for (const auto& tx
: block
.vtx
)
2609 if (!CheckTransaction(*tx
, state
, false))
2610 return state
.Invalid(false, state
.GetRejectCode(), state
.GetRejectReason(),
2611 strprintf("Transaction check failed (tx hash %s) %s", tx
->GetHash().ToString(), state
.GetDebugMessage()));
2613 unsigned int nSigOps
= 0;
2614 for (const auto& tx
: block
.vtx
)
2616 nSigOps
+= GetLegacySigOpCount(*tx
);
2618 if (nSigOps
* WITNESS_SCALE_FACTOR
> MAX_BLOCK_SIGOPS_COST
)
2619 return state
.DoS(100, false, REJECT_INVALID
, "bad-blk-sigops", false, "out-of-bounds SigOpCount");
2621 if (fCheckPOW
&& fCheckMerkleRoot
)
2622 block
.fChecked
= true;
2627 static bool CheckIndexAgainstCheckpoint(const CBlockIndex
* pindexPrev
, CValidationState
& state
, const CChainParams
& chainparams
, const uint256
& hash
)
2629 if (*pindexPrev
->phashBlock
== chainparams
.GetConsensus().hashGenesisBlock
)
2632 int nHeight
= pindexPrev
->nHeight
+1;
2633 // Don't accept any forks from the main chain prior to last checkpoint.
2634 // GetLastCheckpoint finds the last checkpoint in MapCheckpoints that's in our
2636 CBlockIndex
* pcheckpoint
= Checkpoints::GetLastCheckpoint(chainparams
.Checkpoints());
2637 if (pcheckpoint
&& nHeight
< pcheckpoint
->nHeight
)
2638 return state
.DoS(100, error("%s: forked chain older than last checkpoint (height %d)", __func__
, nHeight
), REJECT_CHECKPOINT
, "bad-fork-prior-to-checkpoint");
2643 bool IsWitnessEnabled(const CBlockIndex
* pindexPrev
, const Consensus::Params
& params
)
2646 return (VersionBitsState(pindexPrev
, params
, Consensus::DEPLOYMENT_SEGWIT
, versionbitscache
) == THRESHOLD_ACTIVE
);
2649 // Compute at which vout of the block's coinbase transaction the witness
2650 // commitment occurs, or -1 if not found.
2651 static int GetWitnessCommitmentIndex(const CBlock
& block
)
2654 if (!block
.vtx
.empty()) {
2655 for (size_t o
= 0; o
< block
.vtx
[0]->vout
.size(); o
++) {
2656 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) {
2664 void UpdateUncommittedBlockStructures(CBlock
& block
, const CBlockIndex
* pindexPrev
, const Consensus::Params
& consensusParams
)
2666 int commitpos
= GetWitnessCommitmentIndex(block
);
2667 static const std::vector
<unsigned char> nonce(32, 0x00);
2668 if (commitpos
!= -1 && IsWitnessEnabled(pindexPrev
, consensusParams
) && !block
.vtx
[0]->HasWitness()) {
2669 CMutableTransaction
tx(*block
.vtx
[0]);
2670 tx
.vin
[0].scriptWitness
.stack
.resize(1);
2671 tx
.vin
[0].scriptWitness
.stack
[0] = nonce
;
2672 block
.vtx
[0] = MakeTransactionRef(std::move(tx
));
2676 std::vector
<unsigned char> GenerateCoinbaseCommitment(CBlock
& block
, const CBlockIndex
* pindexPrev
, const Consensus::Params
& consensusParams
)
2678 std::vector
<unsigned char> commitment
;
2679 int commitpos
= GetWitnessCommitmentIndex(block
);
2680 std::vector
<unsigned char> ret(32, 0x00);
2681 if (consensusParams
.vDeployments
[Consensus::DEPLOYMENT_SEGWIT
].nTimeout
!= 0) {
2682 if (commitpos
== -1) {
2683 uint256 witnessroot
= BlockWitnessMerkleRoot(block
, NULL
);
2684 CHash256().Write(witnessroot
.begin(), 32).Write(&ret
[0], 32).Finalize(witnessroot
.begin());
2687 out
.scriptPubKey
.resize(38);
2688 out
.scriptPubKey
[0] = OP_RETURN
;
2689 out
.scriptPubKey
[1] = 0x24;
2690 out
.scriptPubKey
[2] = 0xaa;
2691 out
.scriptPubKey
[3] = 0x21;
2692 out
.scriptPubKey
[4] = 0xa9;
2693 out
.scriptPubKey
[5] = 0xed;
2694 memcpy(&out
.scriptPubKey
[6], witnessroot
.begin(), 32);
2695 commitment
= std::vector
<unsigned char>(out
.scriptPubKey
.begin(), out
.scriptPubKey
.end());
2696 CMutableTransaction
tx(*block
.vtx
[0]);
2697 tx
.vout
.push_back(out
);
2698 block
.vtx
[0] = MakeTransactionRef(std::move(tx
));
2701 UpdateUncommittedBlockStructures(block
, pindexPrev
, consensusParams
);
2705 bool ContextualCheckBlockHeader(const CBlockHeader
& block
, CValidationState
& state
, const Consensus::Params
& consensusParams
, const CBlockIndex
* pindexPrev
, int64_t nAdjustedTime
)
2707 assert(pindexPrev
!= NULL
);
2708 const int nHeight
= pindexPrev
->nHeight
+ 1;
2709 // Check proof of work
2710 if (block
.nBits
!= GetNextWorkRequired(pindexPrev
, &block
, consensusParams
))
2711 return state
.DoS(100, false, REJECT_INVALID
, "bad-diffbits", false, "incorrect proof of work");
2713 // Check timestamp against prev
2714 if (block
.GetBlockTime() <= pindexPrev
->GetMedianTimePast())
2715 return state
.Invalid(false, REJECT_INVALID
, "time-too-old", "block's timestamp is too early");
2718 if (block
.GetBlockTime() > nAdjustedTime
+ MAX_FUTURE_BLOCK_TIME
)
2719 return state
.Invalid(false, REJECT_INVALID
, "time-too-new", "block timestamp too far in the future");
2721 // Reject outdated version blocks when 95% (75% on testnet) of the network has upgraded:
2722 // check for version 2, 3 and 4 upgrades
2723 if((block
.nVersion
< 2 && nHeight
>= consensusParams
.BIP34Height
) ||
2724 (block
.nVersion
< 3 && nHeight
>= consensusParams
.BIP66Height
) ||
2725 (block
.nVersion
< 4 && nHeight
>= consensusParams
.BIP65Height
))
2726 return state
.Invalid(false, REJECT_OBSOLETE
, strprintf("bad-version(0x%08x)", block
.nVersion
),
2727 strprintf("rejected nVersion=0x%08x block", block
.nVersion
));
2732 bool ContextualCheckBlock(const CBlock
& block
, CValidationState
& state
, const Consensus::Params
& consensusParams
, const CBlockIndex
* pindexPrev
)
2734 const int nHeight
= pindexPrev
== NULL
? 0 : pindexPrev
->nHeight
+ 1;
2736 // Start enforcing BIP113 (Median Time Past) using versionbits logic.
2737 int nLockTimeFlags
= 0;
2738 if (VersionBitsState(pindexPrev
, consensusParams
, Consensus::DEPLOYMENT_CSV
, versionbitscache
) == THRESHOLD_ACTIVE
) {
2739 nLockTimeFlags
|= LOCKTIME_MEDIAN_TIME_PAST
;
2742 int64_t nLockTimeCutoff
= (nLockTimeFlags
& LOCKTIME_MEDIAN_TIME_PAST
)
2743 ? pindexPrev
->GetMedianTimePast()
2744 : block
.GetBlockTime();
2746 // Check that all transactions are finalized
2747 for (const auto& tx
: block
.vtx
) {
2748 if (!IsFinalTx(*tx
, nHeight
, nLockTimeCutoff
)) {
2749 return state
.DoS(10, false, REJECT_INVALID
, "bad-txns-nonfinal", false, "non-final transaction");
2753 // Enforce rule that the coinbase starts with serialized block height
2754 if (nHeight
>= consensusParams
.BIP34Height
)
2756 CScript expect
= CScript() << nHeight
;
2757 if (block
.vtx
[0]->vin
[0].scriptSig
.size() < expect
.size() ||
2758 !std::equal(expect
.begin(), expect
.end(), block
.vtx
[0]->vin
[0].scriptSig
.begin())) {
2759 return state
.DoS(100, false, REJECT_INVALID
, "bad-cb-height", false, "block height mismatch in coinbase");
2763 // Validation for witness commitments.
2764 // * We compute the witness hash (which is the hash including witnesses) of all the block's transactions, except the
2765 // coinbase (where 0x0000....0000 is used instead).
2766 // * The coinbase scriptWitness is a stack of a single 32-byte vector, containing a witness nonce (unconstrained).
2767 // * We build a merkle tree with all those witness hashes as leaves (similar to the hashMerkleRoot in the block header).
2768 // * There must be at least one output whose scriptPubKey is a single 36-byte push, the first 4 bytes of which are
2769 // {0xaa, 0x21, 0xa9, 0xed}, and the following 32 bytes are SHA256^2(witness root, witness nonce). In case there are
2770 // multiple, the last one is used.
2771 bool fHaveWitness
= false;
2772 if (VersionBitsState(pindexPrev
, consensusParams
, Consensus::DEPLOYMENT_SEGWIT
, versionbitscache
) == THRESHOLD_ACTIVE
) {
2773 int commitpos
= GetWitnessCommitmentIndex(block
);
2774 if (commitpos
!= -1) {
2775 bool malleated
= false;
2776 uint256 hashWitness
= BlockWitnessMerkleRoot(block
, &malleated
);
2777 // The malleation check is ignored; as the transaction tree itself
2778 // already does not permit it, it is impossible to trigger in the
2780 if (block
.vtx
[0]->vin
[0].scriptWitness
.stack
.size() != 1 || block
.vtx
[0]->vin
[0].scriptWitness
.stack
[0].size() != 32) {
2781 return state
.DoS(100, false, REJECT_INVALID
, "bad-witness-nonce-size", true, strprintf("%s : invalid witness nonce size", __func__
));
2783 CHash256().Write(hashWitness
.begin(), 32).Write(&block
.vtx
[0]->vin
[0].scriptWitness
.stack
[0][0], 32).Finalize(hashWitness
.begin());
2784 if (memcmp(hashWitness
.begin(), &block
.vtx
[0]->vout
[commitpos
].scriptPubKey
[6], 32)) {
2785 return state
.DoS(100, false, REJECT_INVALID
, "bad-witness-merkle-match", true, strprintf("%s : witness merkle commitment mismatch", __func__
));
2787 fHaveWitness
= true;
2791 // No witness data is allowed in blocks that don't commit to witness data, as this would otherwise leave room for spam
2792 if (!fHaveWitness
) {
2793 for (const auto& tx
: block
.vtx
) {
2794 if (tx
->HasWitness()) {
2795 return state
.DoS(100, false, REJECT_INVALID
, "unexpected-witness", true, strprintf("%s : unexpected witness data found", __func__
));
2800 // After the coinbase witness nonce and commitment are verified,
2801 // we can check if the block weight passes (before we've checked the
2802 // coinbase witness, it would be possible for the weight to be too
2803 // large by filling up the coinbase witness, which doesn't change
2804 // the block hash, so we couldn't mark the block as permanently
2806 if (GetBlockWeight(block
) > MAX_BLOCK_WEIGHT
) {
2807 return state
.DoS(100, false, REJECT_INVALID
, "bad-blk-weight", false, strprintf("%s : weight limit failed", __func__
));
2813 static bool AcceptBlockHeader(const CBlockHeader
& block
, CValidationState
& state
, const CChainParams
& chainparams
, CBlockIndex
** ppindex
)
2815 AssertLockHeld(cs_main
);
2816 // Check for duplicate
2817 uint256 hash
= block
.GetHash();
2818 BlockMap::iterator miSelf
= mapBlockIndex
.find(hash
);
2819 CBlockIndex
*pindex
= NULL
;
2820 if (hash
!= chainparams
.GetConsensus().hashGenesisBlock
) {
2822 if (miSelf
!= mapBlockIndex
.end()) {
2823 // Block header is already known.
2824 pindex
= miSelf
->second
;
2827 if (pindex
->nStatus
& BLOCK_FAILED_MASK
)
2828 return state
.Invalid(error("%s: block %s is marked invalid", __func__
, hash
.ToString()), 0, "duplicate");
2832 if (!CheckBlockHeader(block
, state
, chainparams
.GetConsensus()))
2833 return error("%s: Consensus::CheckBlockHeader: %s, %s", __func__
, hash
.ToString(), FormatStateMessage(state
));
2835 // Get prev block index
2836 CBlockIndex
* pindexPrev
= NULL
;
2837 BlockMap::iterator mi
= mapBlockIndex
.find(block
.hashPrevBlock
);
2838 if (mi
== mapBlockIndex
.end())
2839 return state
.DoS(10, error("%s: prev block not found", __func__
), 0, "prev-blk-not-found");
2840 pindexPrev
= (*mi
).second
;
2841 if (pindexPrev
->nStatus
& BLOCK_FAILED_MASK
)
2842 return state
.DoS(100, error("%s: prev block invalid", __func__
), REJECT_INVALID
, "bad-prevblk");
2845 if (fCheckpointsEnabled
&& !CheckIndexAgainstCheckpoint(pindexPrev
, state
, chainparams
, hash
))
2846 return error("%s: CheckIndexAgainstCheckpoint(): %s", __func__
, state
.GetRejectReason().c_str());
2848 if (!ContextualCheckBlockHeader(block
, state
, chainparams
.GetConsensus(), pindexPrev
, GetAdjustedTime()))
2849 return error("%s: Consensus::ContextualCheckBlockHeader: %s, %s", __func__
, hash
.ToString(), FormatStateMessage(state
));
2852 pindex
= AddToBlockIndex(block
);
2857 CheckBlockIndex(chainparams
.GetConsensus());
2862 // Exposed wrapper for AcceptBlockHeader
2863 bool ProcessNewBlockHeaders(const std::vector
<CBlockHeader
>& headers
, CValidationState
& state
, const CChainParams
& chainparams
, const CBlockIndex
** ppindex
)
2867 for (const CBlockHeader
& header
: headers
) {
2868 CBlockIndex
*pindex
= NULL
; // Use a temp pindex instead of ppindex to avoid a const_cast
2869 if (!AcceptBlockHeader(header
, state
, chainparams
, &pindex
)) {
2881 /** Store block on disk. If dbp is non-NULL, the file is known to already reside on disk */
2882 static bool AcceptBlock(const std::shared_ptr
<const CBlock
>& pblock
, CValidationState
& state
, const CChainParams
& chainparams
, CBlockIndex
** ppindex
, bool fRequested
, const CDiskBlockPos
* dbp
, bool* fNewBlock
)
2884 const CBlock
& block
= *pblock
;
2886 if (fNewBlock
) *fNewBlock
= false;
2887 AssertLockHeld(cs_main
);
2889 CBlockIndex
*pindexDummy
= NULL
;
2890 CBlockIndex
*&pindex
= ppindex
? *ppindex
: pindexDummy
;
2892 if (!AcceptBlockHeader(block
, state
, chainparams
, &pindex
))
2895 // Try to process all requested blocks that we don't have, but only
2896 // process an unrequested block if it's new and has enough work to
2897 // advance our tip, and isn't too many blocks ahead.
2898 bool fAlreadyHave
= pindex
->nStatus
& BLOCK_HAVE_DATA
;
2899 bool fHasMoreWork
= (chainActive
.Tip() ? pindex
->nChainWork
> chainActive
.Tip()->nChainWork
: true);
2900 // Blocks that are too out-of-order needlessly limit the effectiveness of
2901 // pruning, because pruning will not delete block files that contain any
2902 // blocks which are too close in height to the tip. Apply this test
2903 // regardless of whether pruning is enabled; it should generally be safe to
2904 // not process unrequested blocks.
2905 bool fTooFarAhead
= (pindex
->nHeight
> int(chainActive
.Height() + MIN_BLOCKS_TO_KEEP
));
2907 // TODO: Decouple this function from the block download logic by removing fRequested
2908 // This requires some new chain data structure to efficiently look up if a
2909 // block is in a chain leading to a candidate for best tip, despite not
2910 // being such a candidate itself.
2912 // TODO: deal better with return value and error conditions for duplicate
2913 // and unrequested blocks.
2914 if (fAlreadyHave
) return true;
2915 if (!fRequested
) { // If we didn't ask for it:
2916 if (pindex
->nTx
!= 0) return true; // This is a previously-processed block that was pruned
2917 if (!fHasMoreWork
) return true; // Don't process less-work chains
2918 if (fTooFarAhead
) return true; // Block height is too high
2920 if (fNewBlock
) *fNewBlock
= true;
2922 if (!CheckBlock(block
, state
, chainparams
.GetConsensus()) ||
2923 !ContextualCheckBlock(block
, state
, chainparams
.GetConsensus(), pindex
->pprev
)) {
2924 if (state
.IsInvalid() && !state
.CorruptionPossible()) {
2925 pindex
->nStatus
|= BLOCK_FAILED_VALID
;
2926 setDirtyBlockIndex
.insert(pindex
);
2928 return error("%s: %s", __func__
, FormatStateMessage(state
));
2931 // Header is valid/has work, merkle tree and segwit merkle tree are good...RELAY NOW
2932 // (but if it does not build on our best tip, let the SendMessages loop relay it)
2933 if (!IsInitialBlockDownload() && chainActive
.Tip() == pindex
->pprev
)
2934 GetMainSignals().NewPoWValidBlock(pindex
, pblock
);
2936 int nHeight
= pindex
->nHeight
;
2938 // Write block to history file
2940 unsigned int nBlockSize
= ::GetSerializeSize(block
, SER_DISK
, CLIENT_VERSION
);
2941 CDiskBlockPos blockPos
;
2944 if (!FindBlockPos(state
, blockPos
, nBlockSize
+8, nHeight
, block
.GetBlockTime(), dbp
!= NULL
))
2945 return error("AcceptBlock(): FindBlockPos failed");
2947 if (!WriteBlockToDisk(block
, blockPos
, chainparams
.MessageStart()))
2948 AbortNode(state
, "Failed to write block");
2949 if (!ReceivedBlockTransactions(block
, state
, pindex
, blockPos
, chainparams
.GetConsensus()))
2950 return error("AcceptBlock(): ReceivedBlockTransactions failed");
2951 } catch (const std::runtime_error
& e
) {
2952 return AbortNode(state
, std::string("System error: ") + e
.what());
2955 if (fCheckForPruning
)
2956 FlushStateToDisk(state
, FLUSH_STATE_NONE
); // we just allocated more disk space for block files
2961 bool ProcessNewBlock(const CChainParams
& chainparams
, const std::shared_ptr
<const CBlock
> pblock
, bool fForceProcessing
, bool *fNewBlock
)
2964 CBlockIndex
*pindex
= NULL
;
2965 if (fNewBlock
) *fNewBlock
= false;
2966 CValidationState state
;
2967 // Ensure that CheckBlock() passes before calling AcceptBlock, as
2968 // belt-and-suspenders.
2969 bool ret
= CheckBlock(*pblock
, state
, chainparams
.GetConsensus());
2975 ret
= AcceptBlock(pblock
, state
, chainparams
, &pindex
, fForceProcessing
, NULL
, fNewBlock
);
2977 CheckBlockIndex(chainparams
.GetConsensus());
2979 GetMainSignals().BlockChecked(*pblock
, state
);
2980 return error("%s: AcceptBlock FAILED", __func__
);
2986 CValidationState state
; // Only used to report errors, not invalidity - ignore it
2987 if (!ActivateBestChain(state
, chainparams
, pblock
))
2988 return error("%s: ActivateBestChain failed", __func__
);
2993 bool TestBlockValidity(CValidationState
& state
, const CChainParams
& chainparams
, const CBlock
& block
, CBlockIndex
* pindexPrev
, bool fCheckPOW
, bool fCheckMerkleRoot
)
2995 AssertLockHeld(cs_main
);
2996 assert(pindexPrev
&& pindexPrev
== chainActive
.Tip());
2997 if (fCheckpointsEnabled
&& !CheckIndexAgainstCheckpoint(pindexPrev
, state
, chainparams
, block
.GetHash()))
2998 return error("%s: CheckIndexAgainstCheckpoint(): %s", __func__
, state
.GetRejectReason().c_str());
3000 CCoinsViewCache
viewNew(pcoinsTip
);
3001 CBlockIndex
indexDummy(block
);
3002 indexDummy
.pprev
= pindexPrev
;
3003 indexDummy
.nHeight
= pindexPrev
->nHeight
+ 1;
3005 // NOTE: CheckBlockHeader is called by CheckBlock
3006 if (!ContextualCheckBlockHeader(block
, state
, chainparams
.GetConsensus(), pindexPrev
, GetAdjustedTime()))
3007 return error("%s: Consensus::ContextualCheckBlockHeader: %s", __func__
, FormatStateMessage(state
));
3008 if (!CheckBlock(block
, state
, chainparams
.GetConsensus(), fCheckPOW
, fCheckMerkleRoot
))
3009 return error("%s: Consensus::CheckBlock: %s", __func__
, FormatStateMessage(state
));
3010 if (!ContextualCheckBlock(block
, state
, chainparams
.GetConsensus(), pindexPrev
))
3011 return error("%s: Consensus::ContextualCheckBlock: %s", __func__
, FormatStateMessage(state
));
3012 if (!ConnectBlock(block
, state
, &indexDummy
, viewNew
, chainparams
, true))
3014 assert(state
.IsValid());
3020 * BLOCK PRUNING CODE
3023 /* Calculate the amount of disk space the block & undo files currently use */
3024 uint64_t CalculateCurrentUsage()
3026 uint64_t retval
= 0;
3027 BOOST_FOREACH(const CBlockFileInfo
&file
, vinfoBlockFile
) {
3028 retval
+= file
.nSize
+ file
.nUndoSize
;
3033 /* Prune a block file (modify associated database entries)*/
3034 void PruneOneBlockFile(const int fileNumber
)
3036 for (BlockMap::iterator it
= mapBlockIndex
.begin(); it
!= mapBlockIndex
.end(); ++it
) {
3037 CBlockIndex
* pindex
= it
->second
;
3038 if (pindex
->nFile
== fileNumber
) {
3039 pindex
->nStatus
&= ~BLOCK_HAVE_DATA
;
3040 pindex
->nStatus
&= ~BLOCK_HAVE_UNDO
;
3042 pindex
->nDataPos
= 0;
3043 pindex
->nUndoPos
= 0;
3044 setDirtyBlockIndex
.insert(pindex
);
3046 // Prune from mapBlocksUnlinked -- any block we prune would have
3047 // to be downloaded again in order to consider its chain, at which
3048 // point it would be considered as a candidate for
3049 // mapBlocksUnlinked or setBlockIndexCandidates.
3050 std::pair
<std::multimap
<CBlockIndex
*, CBlockIndex
*>::iterator
, std::multimap
<CBlockIndex
*, CBlockIndex
*>::iterator
> range
= mapBlocksUnlinked
.equal_range(pindex
->pprev
);
3051 while (range
.first
!= range
.second
) {
3052 std::multimap
<CBlockIndex
*, CBlockIndex
*>::iterator _it
= range
.first
;
3054 if (_it
->second
== pindex
) {
3055 mapBlocksUnlinked
.erase(_it
);
3061 vinfoBlockFile
[fileNumber
].SetNull();
3062 setDirtyFileInfo
.insert(fileNumber
);
3066 void UnlinkPrunedFiles(const std::set
<int>& setFilesToPrune
)
3068 for (std::set
<int>::iterator it
= setFilesToPrune
.begin(); it
!= setFilesToPrune
.end(); ++it
) {
3069 CDiskBlockPos
pos(*it
, 0);
3070 fs::remove(GetBlockPosFilename(pos
, "blk"));
3071 fs::remove(GetBlockPosFilename(pos
, "rev"));
3072 LogPrintf("Prune: %s deleted blk/rev (%05u)\n", __func__
, *it
);
3076 /* Calculate the block/rev files to delete based on height specified by user with RPC command pruneblockchain */
3077 void FindFilesToPruneManual(std::set
<int>& setFilesToPrune
, int nManualPruneHeight
)
3079 assert(fPruneMode
&& nManualPruneHeight
> 0);
3081 LOCK2(cs_main
, cs_LastBlockFile
);
3082 if (chainActive
.Tip() == NULL
)
3085 // last block to prune is the lesser of (user-specified height, MIN_BLOCKS_TO_KEEP from the tip)
3086 unsigned int nLastBlockWeCanPrune
= std::min((unsigned)nManualPruneHeight
, chainActive
.Tip()->nHeight
- MIN_BLOCKS_TO_KEEP
);
3088 for (int fileNumber
= 0; fileNumber
< nLastBlockFile
; fileNumber
++) {
3089 if (vinfoBlockFile
[fileNumber
].nSize
== 0 || vinfoBlockFile
[fileNumber
].nHeightLast
> nLastBlockWeCanPrune
)
3091 PruneOneBlockFile(fileNumber
);
3092 setFilesToPrune
.insert(fileNumber
);
3095 LogPrintf("Prune (Manual): prune_height=%d removed %d blk/rev pairs\n", nLastBlockWeCanPrune
, count
);
3098 /* This function is called from the RPC code for pruneblockchain */
3099 void PruneBlockFilesManual(int nManualPruneHeight
)
3101 CValidationState state
;
3102 FlushStateToDisk(state
, FLUSH_STATE_NONE
, nManualPruneHeight
);
3105 /* Calculate the block/rev files that should be deleted to remain under target*/
3106 void FindFilesToPrune(std::set
<int>& setFilesToPrune
, uint64_t nPruneAfterHeight
)
3108 LOCK2(cs_main
, cs_LastBlockFile
);
3109 if (chainActive
.Tip() == NULL
|| nPruneTarget
== 0) {
3112 if ((uint64_t)chainActive
.Tip()->nHeight
<= nPruneAfterHeight
) {
3116 unsigned int nLastBlockWeCanPrune
= chainActive
.Tip()->nHeight
- MIN_BLOCKS_TO_KEEP
;
3117 uint64_t nCurrentUsage
= CalculateCurrentUsage();
3118 // We don't check to prune until after we've allocated new space for files
3119 // So we should leave a buffer under our target to account for another allocation
3120 // before the next pruning.
3121 uint64_t nBuffer
= BLOCKFILE_CHUNK_SIZE
+ UNDOFILE_CHUNK_SIZE
;
3122 uint64_t nBytesToPrune
;
3125 if (nCurrentUsage
+ nBuffer
>= nPruneTarget
) {
3126 for (int fileNumber
= 0; fileNumber
< nLastBlockFile
; fileNumber
++) {
3127 nBytesToPrune
= vinfoBlockFile
[fileNumber
].nSize
+ vinfoBlockFile
[fileNumber
].nUndoSize
;
3129 if (vinfoBlockFile
[fileNumber
].nSize
== 0)
3132 if (nCurrentUsage
+ nBuffer
< nPruneTarget
) // are we below our target?
3135 // don't prune files that could have a block within MIN_BLOCKS_TO_KEEP of the main chain's tip but keep scanning
3136 if (vinfoBlockFile
[fileNumber
].nHeightLast
> nLastBlockWeCanPrune
)
3139 PruneOneBlockFile(fileNumber
);
3140 // Queue up the files for removal
3141 setFilesToPrune
.insert(fileNumber
);
3142 nCurrentUsage
-= nBytesToPrune
;
3147 LogPrint(BCLog::PRUNE
, "Prune: target=%dMiB actual=%dMiB diff=%dMiB max_prune_height=%d removed %d blk/rev pairs\n",
3148 nPruneTarget
/1024/1024, nCurrentUsage
/1024/1024,
3149 ((int64_t)nPruneTarget
- (int64_t)nCurrentUsage
)/1024/1024,
3150 nLastBlockWeCanPrune
, count
);
3153 bool CheckDiskSpace(uint64_t nAdditionalBytes
)
3155 uint64_t nFreeBytesAvailable
= fs::space(GetDataDir()).available
;
3157 // Check for nMinDiskSpace bytes (currently 50MB)
3158 if (nFreeBytesAvailable
< nMinDiskSpace
+ nAdditionalBytes
)
3159 return AbortNode("Disk space is low!", _("Error: Disk space is low!"));
3164 FILE* OpenDiskFile(const CDiskBlockPos
&pos
, const char *prefix
, bool fReadOnly
)
3168 fs::path path
= GetBlockPosFilename(pos
, prefix
);
3169 fs::create_directories(path
.parent_path());
3170 FILE* file
= fsbridge::fopen(path
, "rb+");
3171 if (!file
&& !fReadOnly
)
3172 file
= fsbridge::fopen(path
, "wb+");
3174 LogPrintf("Unable to open file %s\n", path
.string());
3178 if (fseek(file
, pos
.nPos
, SEEK_SET
)) {
3179 LogPrintf("Unable to seek to position %u of %s\n", pos
.nPos
, path
.string());
3187 FILE* OpenBlockFile(const CDiskBlockPos
&pos
, bool fReadOnly
) {
3188 return OpenDiskFile(pos
, "blk", fReadOnly
);
3191 FILE* OpenUndoFile(const CDiskBlockPos
&pos
, bool fReadOnly
) {
3192 return OpenDiskFile(pos
, "rev", fReadOnly
);
3195 fs::path
GetBlockPosFilename(const CDiskBlockPos
&pos
, const char *prefix
)
3197 return GetDataDir() / "blocks" / strprintf("%s%05u.dat", prefix
, pos
.nFile
);
3200 CBlockIndex
* InsertBlockIndex(uint256 hash
)
3206 BlockMap::iterator mi
= mapBlockIndex
.find(hash
);
3207 if (mi
!= mapBlockIndex
.end())
3208 return (*mi
).second
;
3211 CBlockIndex
* pindexNew
= new CBlockIndex();
3213 throw std::runtime_error(std::string(__func__
) + ": new CBlockIndex failed");
3214 mi
= mapBlockIndex
.insert(std::make_pair(hash
, pindexNew
)).first
;
3215 pindexNew
->phashBlock
= &((*mi
).first
);
3220 bool static LoadBlockIndexDB(const CChainParams
& chainparams
)
3222 if (!pblocktree
->LoadBlockIndexGuts(InsertBlockIndex
))
3225 boost::this_thread::interruption_point();
3227 // Calculate nChainWork
3228 std::vector
<std::pair
<int, CBlockIndex
*> > vSortedByHeight
;
3229 vSortedByHeight
.reserve(mapBlockIndex
.size());
3230 BOOST_FOREACH(const PAIRTYPE(uint256
, CBlockIndex
*)& item
, mapBlockIndex
)
3232 CBlockIndex
* pindex
= item
.second
;
3233 vSortedByHeight
.push_back(std::make_pair(pindex
->nHeight
, pindex
));
3235 sort(vSortedByHeight
.begin(), vSortedByHeight
.end());
3236 BOOST_FOREACH(const PAIRTYPE(int, CBlockIndex
*)& item
, vSortedByHeight
)
3238 CBlockIndex
* pindex
= item
.second
;
3239 pindex
->nChainWork
= (pindex
->pprev
? pindex
->pprev
->nChainWork
: 0) + GetBlockProof(*pindex
);
3240 pindex
->nTimeMax
= (pindex
->pprev
? std::max(pindex
->pprev
->nTimeMax
, pindex
->nTime
) : pindex
->nTime
);
3241 // We can link the chain of blocks for which we've received transactions at some point.
3242 // Pruned nodes may have deleted the block.
3243 if (pindex
->nTx
> 0) {
3244 if (pindex
->pprev
) {
3245 if (pindex
->pprev
->nChainTx
) {
3246 pindex
->nChainTx
= pindex
->pprev
->nChainTx
+ pindex
->nTx
;
3248 pindex
->nChainTx
= 0;
3249 mapBlocksUnlinked
.insert(std::make_pair(pindex
->pprev
, pindex
));
3252 pindex
->nChainTx
= pindex
->nTx
;
3255 if (pindex
->IsValid(BLOCK_VALID_TRANSACTIONS
) && (pindex
->nChainTx
|| pindex
->pprev
== NULL
))
3256 setBlockIndexCandidates
.insert(pindex
);
3257 if (pindex
->nStatus
& BLOCK_FAILED_MASK
&& (!pindexBestInvalid
|| pindex
->nChainWork
> pindexBestInvalid
->nChainWork
))
3258 pindexBestInvalid
= pindex
;
3260 pindex
->BuildSkip();
3261 if (pindex
->IsValid(BLOCK_VALID_TREE
) && (pindexBestHeader
== NULL
|| CBlockIndexWorkComparator()(pindexBestHeader
, pindex
)))
3262 pindexBestHeader
= pindex
;
3265 // Load block file info
3266 pblocktree
->ReadLastBlockFile(nLastBlockFile
);
3267 vinfoBlockFile
.resize(nLastBlockFile
+ 1);
3268 LogPrintf("%s: last block file = %i\n", __func__
, nLastBlockFile
);
3269 for (int nFile
= 0; nFile
<= nLastBlockFile
; nFile
++) {
3270 pblocktree
->ReadBlockFileInfo(nFile
, vinfoBlockFile
[nFile
]);
3272 LogPrintf("%s: last block file info: %s\n", __func__
, vinfoBlockFile
[nLastBlockFile
].ToString());
3273 for (int nFile
= nLastBlockFile
+ 1; true; nFile
++) {
3274 CBlockFileInfo info
;
3275 if (pblocktree
->ReadBlockFileInfo(nFile
, info
)) {
3276 vinfoBlockFile
.push_back(info
);
3282 // Check presence of blk files
3283 LogPrintf("Checking all blk files are present...\n");
3284 std::set
<int> setBlkDataFiles
;
3285 BOOST_FOREACH(const PAIRTYPE(uint256
, CBlockIndex
*)& item
, mapBlockIndex
)
3287 CBlockIndex
* pindex
= item
.second
;
3288 if (pindex
->nStatus
& BLOCK_HAVE_DATA
) {
3289 setBlkDataFiles
.insert(pindex
->nFile
);
3292 for (std::set
<int>::iterator it
= setBlkDataFiles
.begin(); it
!= setBlkDataFiles
.end(); it
++)
3294 CDiskBlockPos
pos(*it
, 0);
3295 if (CAutoFile(OpenBlockFile(pos
, true), SER_DISK
, CLIENT_VERSION
).IsNull()) {
3300 // Check whether we have ever pruned block & undo files
3301 pblocktree
->ReadFlag("prunedblockfiles", fHavePruned
);
3303 LogPrintf("LoadBlockIndexDB(): Block files have previously been pruned\n");
3305 // Check whether we need to continue reindexing
3306 bool fReindexing
= false;
3307 pblocktree
->ReadReindexing(fReindexing
);
3308 fReindex
|= fReindexing
;
3310 // Check whether we have a transaction index
3311 pblocktree
->ReadFlag("txindex", fTxIndex
);
3312 LogPrintf("%s: transaction index %s\n", __func__
, fTxIndex
? "enabled" : "disabled");
3314 // Load pointer to end of best chain
3315 BlockMap::iterator it
= mapBlockIndex
.find(pcoinsTip
->GetBestBlock());
3316 if (it
== mapBlockIndex
.end())
3318 chainActive
.SetTip(it
->second
);
3320 PruneBlockIndexCandidates();
3322 LogPrintf("%s: hashBestChain=%s height=%d date=%s progress=%f\n", __func__
,
3323 chainActive
.Tip()->GetBlockHash().ToString(), chainActive
.Height(),
3324 DateTimeStrFormat("%Y-%m-%d %H:%M:%S", chainActive
.Tip()->GetBlockTime()),
3325 GuessVerificationProgress(chainparams
.TxData(), chainActive
.Tip()));
3330 CVerifyDB::CVerifyDB()
3332 uiInterface
.ShowProgress(_("Verifying blocks..."), 0);
3335 CVerifyDB::~CVerifyDB()
3337 uiInterface
.ShowProgress("", 100);
3340 bool CVerifyDB::VerifyDB(const CChainParams
& chainparams
, CCoinsView
*coinsview
, int nCheckLevel
, int nCheckDepth
)
3343 if (chainActive
.Tip() == NULL
|| chainActive
.Tip()->pprev
== NULL
)
3346 // Verify blocks in the best chain
3347 if (nCheckDepth
<= 0)
3348 nCheckDepth
= 1000000000; // suffices until the year 19000
3349 if (nCheckDepth
> chainActive
.Height())
3350 nCheckDepth
= chainActive
.Height();
3351 nCheckLevel
= std::max(0, std::min(4, nCheckLevel
));
3352 LogPrintf("Verifying last %i blocks at level %i\n", nCheckDepth
, nCheckLevel
);
3353 CCoinsViewCache
coins(coinsview
);
3354 CBlockIndex
* pindexState
= chainActive
.Tip();
3355 CBlockIndex
* pindexFailure
= NULL
;
3356 int nGoodTransactions
= 0;
3357 CValidationState state
;
3359 LogPrintf("[0%%]...");
3360 for (CBlockIndex
* pindex
= chainActive
.Tip(); pindex
&& pindex
->pprev
; pindex
= pindex
->pprev
)
3362 boost::this_thread::interruption_point();
3363 int percentageDone
= std::max(1, std::min(99, (int)(((double)(chainActive
.Height() - pindex
->nHeight
)) / (double)nCheckDepth
* (nCheckLevel
>= 4 ? 50 : 100))));
3364 if (reportDone
< percentageDone
/10) {
3365 // report every 10% step
3366 LogPrintf("[%d%%]...", percentageDone
);
3367 reportDone
= percentageDone
/10;
3369 uiInterface
.ShowProgress(_("Verifying blocks..."), percentageDone
);
3370 if (pindex
->nHeight
< chainActive
.Height()-nCheckDepth
)
3372 if (fPruneMode
&& !(pindex
->nStatus
& BLOCK_HAVE_DATA
)) {
3373 // If pruning, only go back as far as we have data.
3374 LogPrintf("VerifyDB(): block verification stopping at height %d (pruning, no data)\n", pindex
->nHeight
);
3378 // check level 0: read from disk
3379 if (!ReadBlockFromDisk(block
, pindex
, chainparams
.GetConsensus()))
3380 return error("VerifyDB(): *** ReadBlockFromDisk failed at %d, hash=%s", pindex
->nHeight
, pindex
->GetBlockHash().ToString());
3381 // check level 1: verify block validity
3382 if (nCheckLevel
>= 1 && !CheckBlock(block
, state
, chainparams
.GetConsensus()))
3383 return error("%s: *** found bad block at %d, hash=%s (%s)\n", __func__
,
3384 pindex
->nHeight
, pindex
->GetBlockHash().ToString(), FormatStateMessage(state
));
3385 // check level 2: verify undo validity
3386 if (nCheckLevel
>= 2 && pindex
) {
3388 CDiskBlockPos pos
= pindex
->GetUndoPos();
3389 if (!pos
.IsNull()) {
3390 if (!UndoReadFromDisk(undo
, pos
, pindex
->pprev
->GetBlockHash()))
3391 return error("VerifyDB(): *** found bad undo data at %d, hash=%s\n", pindex
->nHeight
, pindex
->GetBlockHash().ToString());
3394 // check level 3: check for inconsistencies during memory-only disconnect of tip blocks
3395 if (nCheckLevel
>= 3 && pindex
== pindexState
&& (coins
.DynamicMemoryUsage() + pcoinsTip
->DynamicMemoryUsage()) <= nCoinCacheUsage
) {
3396 DisconnectResult res
= DisconnectBlock(block
, pindex
, coins
);
3397 if (res
== DISCONNECT_FAILED
) {
3398 return error("VerifyDB(): *** irrecoverable inconsistency in block data at %d, hash=%s", pindex
->nHeight
, pindex
->GetBlockHash().ToString());
3400 pindexState
= pindex
->pprev
;
3401 if (res
== DISCONNECT_UNCLEAN
) {
3402 nGoodTransactions
= 0;
3403 pindexFailure
= pindex
;
3405 nGoodTransactions
+= block
.vtx
.size();
3408 if (ShutdownRequested())
3412 return error("VerifyDB(): *** coin database inconsistencies found (last %i blocks, %i good transactions before that)\n", chainActive
.Height() - pindexFailure
->nHeight
+ 1, nGoodTransactions
);
3414 // check level 4: try reconnecting blocks
3415 if (nCheckLevel
>= 4) {
3416 CBlockIndex
*pindex
= pindexState
;
3417 while (pindex
!= chainActive
.Tip()) {
3418 boost::this_thread::interruption_point();
3419 uiInterface
.ShowProgress(_("Verifying blocks..."), std::max(1, std::min(99, 100 - (int)(((double)(chainActive
.Height() - pindex
->nHeight
)) / (double)nCheckDepth
* 50))));
3420 pindex
= chainActive
.Next(pindex
);
3422 if (!ReadBlockFromDisk(block
, pindex
, chainparams
.GetConsensus()))
3423 return error("VerifyDB(): *** ReadBlockFromDisk failed at %d, hash=%s", pindex
->nHeight
, pindex
->GetBlockHash().ToString());
3424 if (!ConnectBlock(block
, state
, pindex
, coins
, chainparams
))
3425 return error("VerifyDB(): *** found unconnectable block at %d, hash=%s", pindex
->nHeight
, pindex
->GetBlockHash().ToString());
3429 LogPrintf("[DONE].\n");
3430 LogPrintf("No coin database inconsistencies in last %i blocks (%i transactions)\n", chainActive
.Height() - pindexState
->nHeight
, nGoodTransactions
);
3435 bool RewindBlockIndex(const CChainParams
& params
)
3440 while (nHeight
<= chainActive
.Height()) {
3441 if (IsWitnessEnabled(chainActive
[nHeight
- 1], params
.GetConsensus()) && !(chainActive
[nHeight
]->nStatus
& BLOCK_OPT_WITNESS
)) {
3447 // nHeight is now the height of the first insufficiently-validated block, or tipheight + 1
3448 CValidationState state
;
3449 CBlockIndex
* pindex
= chainActive
.Tip();
3450 while (chainActive
.Height() >= nHeight
) {
3451 if (fPruneMode
&& !(chainActive
.Tip()->nStatus
& BLOCK_HAVE_DATA
)) {
3452 // If pruning, don't try rewinding past the HAVE_DATA point;
3453 // since older blocks can't be served anyway, there's
3454 // no need to walk further, and trying to DisconnectTip()
3455 // will fail (and require a needless reindex/redownload
3456 // of the blockchain).
3459 if (!DisconnectTip(state
, params
, true)) {
3460 return error("RewindBlockIndex: unable to disconnect block at height %i", pindex
->nHeight
);
3462 // Occasionally flush state to disk.
3463 if (!FlushStateToDisk(state
, FLUSH_STATE_PERIODIC
))
3467 // Reduce validity flag and have-data flags.
3468 // We do this after actual disconnecting, otherwise we'll end up writing the lack of data
3469 // to disk before writing the chainstate, resulting in a failure to continue if interrupted.
3470 for (BlockMap::iterator it
= mapBlockIndex
.begin(); it
!= mapBlockIndex
.end(); it
++) {
3471 CBlockIndex
* pindexIter
= it
->second
;
3473 // Note: If we encounter an insufficiently validated block that
3474 // is on chainActive, it must be because we are a pruning node, and
3475 // this block or some successor doesn't HAVE_DATA, so we were unable to
3476 // rewind all the way. Blocks remaining on chainActive at this point
3477 // must not have their validity reduced.
3478 if (IsWitnessEnabled(pindexIter
->pprev
, params
.GetConsensus()) && !(pindexIter
->nStatus
& BLOCK_OPT_WITNESS
) && !chainActive
.Contains(pindexIter
)) {
3480 pindexIter
->nStatus
= std::min
<unsigned int>(pindexIter
->nStatus
& BLOCK_VALID_MASK
, BLOCK_VALID_TREE
) | (pindexIter
->nStatus
& ~BLOCK_VALID_MASK
);
3481 // Remove have-data flags.
3482 pindexIter
->nStatus
&= ~(BLOCK_HAVE_DATA
| BLOCK_HAVE_UNDO
);
3483 // Remove storage location.
3484 pindexIter
->nFile
= 0;
3485 pindexIter
->nDataPos
= 0;
3486 pindexIter
->nUndoPos
= 0;
3487 // Remove various other things
3488 pindexIter
->nTx
= 0;
3489 pindexIter
->nChainTx
= 0;
3490 pindexIter
->nSequenceId
= 0;
3491 // Make sure it gets written.
3492 setDirtyBlockIndex
.insert(pindexIter
);
3494 setBlockIndexCandidates
.erase(pindexIter
);
3495 std::pair
<std::multimap
<CBlockIndex
*, CBlockIndex
*>::iterator
, std::multimap
<CBlockIndex
*, CBlockIndex
*>::iterator
> ret
= mapBlocksUnlinked
.equal_range(pindexIter
->pprev
);
3496 while (ret
.first
!= ret
.second
) {
3497 if (ret
.first
->second
== pindexIter
) {
3498 mapBlocksUnlinked
.erase(ret
.first
++);
3503 } else if (pindexIter
->IsValid(BLOCK_VALID_TRANSACTIONS
) && pindexIter
->nChainTx
) {
3504 setBlockIndexCandidates
.insert(pindexIter
);
3508 PruneBlockIndexCandidates();
3510 CheckBlockIndex(params
.GetConsensus());
3512 if (!FlushStateToDisk(state
, FLUSH_STATE_ALWAYS
)) {
3519 // May NOT be used after any connections are up as much
3520 // of the peer-processing logic assumes a consistent
3521 // block index state
3522 void UnloadBlockIndex()
3525 setBlockIndexCandidates
.clear();
3526 chainActive
.SetTip(NULL
);
3527 pindexBestInvalid
= NULL
;
3528 pindexBestHeader
= NULL
;
3530 mapBlocksUnlinked
.clear();
3531 vinfoBlockFile
.clear();
3533 nBlockSequenceId
= 1;
3534 setDirtyBlockIndex
.clear();
3535 setDirtyFileInfo
.clear();
3536 versionbitscache
.Clear();
3537 for (int b
= 0; b
< VERSIONBITS_NUM_BITS
; b
++) {
3538 warningcache
[b
].clear();
3541 BOOST_FOREACH(BlockMap::value_type
& entry
, mapBlockIndex
) {
3542 delete entry
.second
;
3544 mapBlockIndex
.clear();
3545 fHavePruned
= false;
3548 bool LoadBlockIndex(const CChainParams
& chainparams
)
3550 // Load block index from databases
3551 if (!fReindex
&& !LoadBlockIndexDB(chainparams
))
3556 bool InitBlockIndex(const CChainParams
& chainparams
)
3560 // Check whether we're already initialized
3561 if (chainActive
.Genesis() != NULL
)
3564 // Use the provided setting for -txindex in the new database
3565 fTxIndex
= GetBoolArg("-txindex", DEFAULT_TXINDEX
);
3566 pblocktree
->WriteFlag("txindex", fTxIndex
);
3567 LogPrintf("Initializing databases...\n");
3569 // Only add the genesis block if not reindexing (in which case we reuse the one already on disk)
3572 CBlock
&block
= const_cast<CBlock
&>(chainparams
.GenesisBlock());
3573 // Start new block file
3574 unsigned int nBlockSize
= ::GetSerializeSize(block
, SER_DISK
, CLIENT_VERSION
);
3575 CDiskBlockPos blockPos
;
3576 CValidationState state
;
3577 if (!FindBlockPos(state
, blockPos
, nBlockSize
+8, 0, block
.GetBlockTime()))
3578 return error("LoadBlockIndex(): FindBlockPos failed");
3579 if (!WriteBlockToDisk(block
, blockPos
, chainparams
.MessageStart()))
3580 return error("LoadBlockIndex(): writing genesis block to disk failed");
3581 CBlockIndex
*pindex
= AddToBlockIndex(block
);
3582 if (!ReceivedBlockTransactions(block
, state
, pindex
, blockPos
, chainparams
.GetConsensus()))
3583 return error("LoadBlockIndex(): genesis block not accepted");
3584 // Force a chainstate write so that when we VerifyDB in a moment, it doesn't check stale data
3585 return FlushStateToDisk(state
, FLUSH_STATE_ALWAYS
);
3586 } catch (const std::runtime_error
& e
) {
3587 return error("LoadBlockIndex(): failed to initialize block database: %s", e
.what());
3594 bool LoadExternalBlockFile(const CChainParams
& chainparams
, FILE* fileIn
, CDiskBlockPos
*dbp
)
3596 // Map of disk positions for blocks with unknown parent (only used for reindex)
3597 static std::multimap
<uint256
, CDiskBlockPos
> mapBlocksUnknownParent
;
3598 int64_t nStart
= GetTimeMillis();
3602 // This takes over fileIn and calls fclose() on it in the CBufferedFile destructor
3603 CBufferedFile
blkdat(fileIn
, 2*MAX_BLOCK_SERIALIZED_SIZE
, MAX_BLOCK_SERIALIZED_SIZE
+8, SER_DISK
, CLIENT_VERSION
);
3604 uint64_t nRewind
= blkdat
.GetPos();
3605 while (!blkdat
.eof()) {
3606 boost::this_thread::interruption_point();
3608 blkdat
.SetPos(nRewind
);
3609 nRewind
++; // start one byte further next time, in case of failure
3610 blkdat
.SetLimit(); // remove former limit
3611 unsigned int nSize
= 0;
3614 unsigned char buf
[CMessageHeader::MESSAGE_START_SIZE
];
3615 blkdat
.FindByte(chainparams
.MessageStart()[0]);
3616 nRewind
= blkdat
.GetPos()+1;
3617 blkdat
>> FLATDATA(buf
);
3618 if (memcmp(buf
, chainparams
.MessageStart(), CMessageHeader::MESSAGE_START_SIZE
))
3622 if (nSize
< 80 || nSize
> MAX_BLOCK_SERIALIZED_SIZE
)
3624 } catch (const std::exception
&) {
3625 // no valid block header found; don't complain
3630 uint64_t nBlockPos
= blkdat
.GetPos();
3632 dbp
->nPos
= nBlockPos
;
3633 blkdat
.SetLimit(nBlockPos
+ nSize
);
3634 blkdat
.SetPos(nBlockPos
);
3635 std::shared_ptr
<CBlock
> pblock
= std::make_shared
<CBlock
>();
3636 CBlock
& block
= *pblock
;
3638 nRewind
= blkdat
.GetPos();
3640 // detect out of order blocks, and store them for later
3641 uint256 hash
= block
.GetHash();
3642 if (hash
!= chainparams
.GetConsensus().hashGenesisBlock
&& mapBlockIndex
.find(block
.hashPrevBlock
) == mapBlockIndex
.end()) {
3643 LogPrint(BCLog::REINDEX
, "%s: Out of order block %s, parent %s not known\n", __func__
, hash
.ToString(),
3644 block
.hashPrevBlock
.ToString());
3646 mapBlocksUnknownParent
.insert(std::make_pair(block
.hashPrevBlock
, *dbp
));
3650 // process in case the block isn't known yet
3651 if (mapBlockIndex
.count(hash
) == 0 || (mapBlockIndex
[hash
]->nStatus
& BLOCK_HAVE_DATA
) == 0) {
3653 CValidationState state
;
3654 if (AcceptBlock(pblock
, state
, chainparams
, NULL
, true, dbp
, NULL
))
3656 if (state
.IsError())
3658 } else if (hash
!= chainparams
.GetConsensus().hashGenesisBlock
&& mapBlockIndex
[hash
]->nHeight
% 1000 == 0) {
3659 LogPrint(BCLog::REINDEX
, "Block Import: already had block %s at height %d\n", hash
.ToString(), mapBlockIndex
[hash
]->nHeight
);
3662 // Activate the genesis block so normal node progress can continue
3663 if (hash
== chainparams
.GetConsensus().hashGenesisBlock
) {
3664 CValidationState state
;
3665 if (!ActivateBestChain(state
, chainparams
)) {
3672 // Recursively process earlier encountered successors of this block
3673 std::deque
<uint256
> queue
;
3674 queue
.push_back(hash
);
3675 while (!queue
.empty()) {
3676 uint256 head
= queue
.front();
3678 std::pair
<std::multimap
<uint256
, CDiskBlockPos
>::iterator
, std::multimap
<uint256
, CDiskBlockPos
>::iterator
> range
= mapBlocksUnknownParent
.equal_range(head
);
3679 while (range
.first
!= range
.second
) {
3680 std::multimap
<uint256
, CDiskBlockPos
>::iterator it
= range
.first
;
3681 std::shared_ptr
<CBlock
> pblockrecursive
= std::make_shared
<CBlock
>();
3682 if (ReadBlockFromDisk(*pblockrecursive
, it
->second
, chainparams
.GetConsensus()))
3684 LogPrint(BCLog::REINDEX
, "%s: Processing out of order child %s of %s\n", __func__
, pblockrecursive
->GetHash().ToString(),
3687 CValidationState dummy
;
3688 if (AcceptBlock(pblockrecursive
, dummy
, chainparams
, NULL
, true, &it
->second
, NULL
))
3691 queue
.push_back(pblockrecursive
->GetHash());
3695 mapBlocksUnknownParent
.erase(it
);
3699 } catch (const std::exception
& e
) {
3700 LogPrintf("%s: Deserialize or I/O error - %s\n", __func__
, e
.what());
3703 } catch (const std::runtime_error
& e
) {
3704 AbortNode(std::string("System error: ") + e
.what());
3707 LogPrintf("Loaded %i blocks from external file in %dms\n", nLoaded
, GetTimeMillis() - nStart
);
3711 void static CheckBlockIndex(const Consensus::Params
& consensusParams
)
3713 if (!fCheckBlockIndex
) {
3719 // During a reindex, we read the genesis block and call CheckBlockIndex before ActivateBestChain,
3720 // so we have the genesis block in mapBlockIndex but no active chain. (A few of the tests when
3721 // iterating the block tree require that chainActive has been initialized.)
3722 if (chainActive
.Height() < 0) {
3723 assert(mapBlockIndex
.size() <= 1);
3727 // Build forward-pointing map of the entire block tree.
3728 std::multimap
<CBlockIndex
*,CBlockIndex
*> forward
;
3729 for (BlockMap::iterator it
= mapBlockIndex
.begin(); it
!= mapBlockIndex
.end(); it
++) {
3730 forward
.insert(std::make_pair(it
->second
->pprev
, it
->second
));
3733 assert(forward
.size() == mapBlockIndex
.size());
3735 std::pair
<std::multimap
<CBlockIndex
*,CBlockIndex
*>::iterator
,std::multimap
<CBlockIndex
*,CBlockIndex
*>::iterator
> rangeGenesis
= forward
.equal_range(NULL
);
3736 CBlockIndex
*pindex
= rangeGenesis
.first
->second
;
3737 rangeGenesis
.first
++;
3738 assert(rangeGenesis
.first
== rangeGenesis
.second
); // There is only one index entry with parent NULL.
3740 // Iterate over the entire block tree, using depth-first search.
3741 // Along the way, remember whether there are blocks on the path from genesis
3742 // block being explored which are the first to have certain properties.
3745 CBlockIndex
* pindexFirstInvalid
= NULL
; // Oldest ancestor of pindex which is invalid.
3746 CBlockIndex
* pindexFirstMissing
= NULL
; // Oldest ancestor of pindex which does not have BLOCK_HAVE_DATA.
3747 CBlockIndex
* pindexFirstNeverProcessed
= NULL
; // Oldest ancestor of pindex for which nTx == 0.
3748 CBlockIndex
* pindexFirstNotTreeValid
= NULL
; // Oldest ancestor of pindex which does not have BLOCK_VALID_TREE (regardless of being valid or not).
3749 CBlockIndex
* pindexFirstNotTransactionsValid
= NULL
; // Oldest ancestor of pindex which does not have BLOCK_VALID_TRANSACTIONS (regardless of being valid or not).
3750 CBlockIndex
* pindexFirstNotChainValid
= NULL
; // Oldest ancestor of pindex which does not have BLOCK_VALID_CHAIN (regardless of being valid or not).
3751 CBlockIndex
* pindexFirstNotScriptsValid
= NULL
; // Oldest ancestor of pindex which does not have BLOCK_VALID_SCRIPTS (regardless of being valid or not).
3752 while (pindex
!= NULL
) {
3754 if (pindexFirstInvalid
== NULL
&& pindex
->nStatus
& BLOCK_FAILED_VALID
) pindexFirstInvalid
= pindex
;
3755 if (pindexFirstMissing
== NULL
&& !(pindex
->nStatus
& BLOCK_HAVE_DATA
)) pindexFirstMissing
= pindex
;
3756 if (pindexFirstNeverProcessed
== NULL
&& pindex
->nTx
== 0) pindexFirstNeverProcessed
= pindex
;
3757 if (pindex
->pprev
!= NULL
&& pindexFirstNotTreeValid
== NULL
&& (pindex
->nStatus
& BLOCK_VALID_MASK
) < BLOCK_VALID_TREE
) pindexFirstNotTreeValid
= pindex
;
3758 if (pindex
->pprev
!= NULL
&& pindexFirstNotTransactionsValid
== NULL
&& (pindex
->nStatus
& BLOCK_VALID_MASK
) < BLOCK_VALID_TRANSACTIONS
) pindexFirstNotTransactionsValid
= pindex
;
3759 if (pindex
->pprev
!= NULL
&& pindexFirstNotChainValid
== NULL
&& (pindex
->nStatus
& BLOCK_VALID_MASK
) < BLOCK_VALID_CHAIN
) pindexFirstNotChainValid
= pindex
;
3760 if (pindex
->pprev
!= NULL
&& pindexFirstNotScriptsValid
== NULL
&& (pindex
->nStatus
& BLOCK_VALID_MASK
) < BLOCK_VALID_SCRIPTS
) pindexFirstNotScriptsValid
= pindex
;
3762 // Begin: actual consistency checks.
3763 if (pindex
->pprev
== NULL
) {
3764 // Genesis block checks.
3765 assert(pindex
->GetBlockHash() == consensusParams
.hashGenesisBlock
); // Genesis block's hash must match.
3766 assert(pindex
== chainActive
.Genesis()); // The current active chain's genesis block must be this block.
3768 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)
3769 // VALID_TRANSACTIONS is equivalent to nTx > 0 for all nodes (whether or not pruning has occurred).
3770 // HAVE_DATA is only equivalent to nTx > 0 (or VALID_TRANSACTIONS) if no pruning has occurred.
3772 // If we've never pruned, then HAVE_DATA should be equivalent to nTx > 0
3773 assert(!(pindex
->nStatus
& BLOCK_HAVE_DATA
) == (pindex
->nTx
== 0));
3774 assert(pindexFirstMissing
== pindexFirstNeverProcessed
);
3776 // If we have pruned, then we can only say that HAVE_DATA implies nTx > 0
3777 if (pindex
->nStatus
& BLOCK_HAVE_DATA
) assert(pindex
->nTx
> 0);
3779 if (pindex
->nStatus
& BLOCK_HAVE_UNDO
) assert(pindex
->nStatus
& BLOCK_HAVE_DATA
);
3780 assert(((pindex
->nStatus
& BLOCK_VALID_MASK
) >= BLOCK_VALID_TRANSACTIONS
) == (pindex
->nTx
> 0)); // This is pruning-independent.
3781 // All parents having had data (at some point) is equivalent to all parents being VALID_TRANSACTIONS, which is equivalent to nChainTx being set.
3782 assert((pindexFirstNeverProcessed
!= NULL
) == (pindex
->nChainTx
== 0)); // nChainTx != 0 is used to signal that all parent blocks have been processed (but may have been pruned).
3783 assert((pindexFirstNotTransactionsValid
!= NULL
) == (pindex
->nChainTx
== 0));
3784 assert(pindex
->nHeight
== nHeight
); // nHeight must be consistent.
3785 assert(pindex
->pprev
== NULL
|| pindex
->nChainWork
>= pindex
->pprev
->nChainWork
); // For every block except the genesis block, the chainwork must be larger than the parent's.
3786 assert(nHeight
< 2 || (pindex
->pskip
&& (pindex
->pskip
->nHeight
< nHeight
))); // The pskip pointer must point back for all but the first 2 blocks.
3787 assert(pindexFirstNotTreeValid
== NULL
); // All mapBlockIndex entries must at least be TREE valid
3788 if ((pindex
->nStatus
& BLOCK_VALID_MASK
) >= BLOCK_VALID_TREE
) assert(pindexFirstNotTreeValid
== NULL
); // TREE valid implies all parents are TREE valid
3789 if ((pindex
->nStatus
& BLOCK_VALID_MASK
) >= BLOCK_VALID_CHAIN
) assert(pindexFirstNotChainValid
== NULL
); // CHAIN valid implies all parents are CHAIN valid
3790 if ((pindex
->nStatus
& BLOCK_VALID_MASK
) >= BLOCK_VALID_SCRIPTS
) assert(pindexFirstNotScriptsValid
== NULL
); // SCRIPTS valid implies all parents are SCRIPTS valid
3791 if (pindexFirstInvalid
== NULL
) {
3792 // Checks for not-invalid blocks.
3793 assert((pindex
->nStatus
& BLOCK_FAILED_MASK
) == 0); // The failed mask cannot be set for blocks without invalid parents.
3795 if (!CBlockIndexWorkComparator()(pindex
, chainActive
.Tip()) && pindexFirstNeverProcessed
== NULL
) {
3796 if (pindexFirstInvalid
== NULL
) {
3797 // If this block sorts at least as good as the current tip and
3798 // is valid and we have all data for its parents, it must be in
3799 // setBlockIndexCandidates. chainActive.Tip() must also be there
3800 // even if some data has been pruned.
3801 if (pindexFirstMissing
== NULL
|| pindex
== chainActive
.Tip()) {
3802 assert(setBlockIndexCandidates
.count(pindex
));
3804 // If some parent is missing, then it could be that this block was in
3805 // setBlockIndexCandidates but had to be removed because of the missing data.
3806 // In this case it must be in mapBlocksUnlinked -- see test below.
3808 } else { // If this block sorts worse than the current tip or some ancestor's block has never been seen, it cannot be in setBlockIndexCandidates.
3809 assert(setBlockIndexCandidates
.count(pindex
) == 0);
3811 // Check whether this block is in mapBlocksUnlinked.
3812 std::pair
<std::multimap
<CBlockIndex
*,CBlockIndex
*>::iterator
,std::multimap
<CBlockIndex
*,CBlockIndex
*>::iterator
> rangeUnlinked
= mapBlocksUnlinked
.equal_range(pindex
->pprev
);
3813 bool foundInUnlinked
= false;
3814 while (rangeUnlinked
.first
!= rangeUnlinked
.second
) {
3815 assert(rangeUnlinked
.first
->first
== pindex
->pprev
);
3816 if (rangeUnlinked
.first
->second
== pindex
) {
3817 foundInUnlinked
= true;
3820 rangeUnlinked
.first
++;
3822 if (pindex
->pprev
&& (pindex
->nStatus
& BLOCK_HAVE_DATA
) && pindexFirstNeverProcessed
!= NULL
&& pindexFirstInvalid
== NULL
) {
3823 // If this block has block data available, some parent was never received, and has no invalid parents, it must be in mapBlocksUnlinked.
3824 assert(foundInUnlinked
);
3826 if (!(pindex
->nStatus
& BLOCK_HAVE_DATA
)) assert(!foundInUnlinked
); // Can't be in mapBlocksUnlinked if we don't HAVE_DATA
3827 if (pindexFirstMissing
== NULL
) assert(!foundInUnlinked
); // We aren't missing data for any parent -- cannot be in mapBlocksUnlinked.
3828 if (pindex
->pprev
&& (pindex
->nStatus
& BLOCK_HAVE_DATA
) && pindexFirstNeverProcessed
== NULL
&& pindexFirstMissing
!= NULL
) {
3829 // We HAVE_DATA for this block, have received data for all parents at some point, but we're currently missing data for some parent.
3830 assert(fHavePruned
); // We must have pruned.
3831 // This block may have entered mapBlocksUnlinked if:
3832 // - it has a descendant that at some point had more work than the
3834 // - we tried switching to that descendant but were missing
3835 // data for some intermediate block between chainActive and the
3837 // So if this block is itself better than chainActive.Tip() and it wasn't in
3838 // setBlockIndexCandidates, then it must be in mapBlocksUnlinked.
3839 if (!CBlockIndexWorkComparator()(pindex
, chainActive
.Tip()) && setBlockIndexCandidates
.count(pindex
) == 0) {
3840 if (pindexFirstInvalid
== NULL
) {
3841 assert(foundInUnlinked
);
3845 // assert(pindex->GetBlockHash() == pindex->GetBlockHeader().GetHash()); // Perhaps too slow
3846 // End: actual consistency checks.
3848 // Try descending into the first subnode.
3849 std::pair
<std::multimap
<CBlockIndex
*,CBlockIndex
*>::iterator
,std::multimap
<CBlockIndex
*,CBlockIndex
*>::iterator
> range
= forward
.equal_range(pindex
);
3850 if (range
.first
!= range
.second
) {
3851 // A subnode was found.
3852 pindex
= range
.first
->second
;
3856 // This is a leaf node.
3857 // Move upwards until we reach a node of which we have not yet visited the last child.
3859 // We are going to either move to a parent or a sibling of pindex.
3860 // If pindex was the first with a certain property, unset the corresponding variable.
3861 if (pindex
== pindexFirstInvalid
) pindexFirstInvalid
= NULL
;
3862 if (pindex
== pindexFirstMissing
) pindexFirstMissing
= NULL
;
3863 if (pindex
== pindexFirstNeverProcessed
) pindexFirstNeverProcessed
= NULL
;
3864 if (pindex
== pindexFirstNotTreeValid
) pindexFirstNotTreeValid
= NULL
;
3865 if (pindex
== pindexFirstNotTransactionsValid
) pindexFirstNotTransactionsValid
= NULL
;
3866 if (pindex
== pindexFirstNotChainValid
) pindexFirstNotChainValid
= NULL
;
3867 if (pindex
== pindexFirstNotScriptsValid
) pindexFirstNotScriptsValid
= NULL
;
3869 CBlockIndex
* pindexPar
= pindex
->pprev
;
3870 // Find which child we just visited.
3871 std::pair
<std::multimap
<CBlockIndex
*,CBlockIndex
*>::iterator
,std::multimap
<CBlockIndex
*,CBlockIndex
*>::iterator
> rangePar
= forward
.equal_range(pindexPar
);
3872 while (rangePar
.first
->second
!= pindex
) {
3873 assert(rangePar
.first
!= rangePar
.second
); // Our parent must have at least the node we're coming from as child.
3876 // Proceed to the next one.
3878 if (rangePar
.first
!= rangePar
.second
) {
3879 // Move to the sibling.
3880 pindex
= rangePar
.first
->second
;
3891 // Check that we actually traversed the entire map.
3892 assert(nNodes
== forward
.size());
3895 std::string
CBlockFileInfo::ToString() const
3897 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
));
3900 CBlockFileInfo
* GetBlockFileInfo(size_t n
)
3902 return &vinfoBlockFile
.at(n
);
3905 ThresholdState
VersionBitsTipState(const Consensus::Params
& params
, Consensus::DeploymentPos pos
)
3908 return VersionBitsState(chainActive
.Tip(), params
, pos
, versionbitscache
);
3911 BIP9Stats
VersionBitsTipStatistics(const Consensus::Params
& params
, Consensus::DeploymentPos pos
)
3914 return VersionBitsStatistics(chainActive
.Tip(), params
, pos
);
3917 int VersionBitsTipStateSinceHeight(const Consensus::Params
& params
, Consensus::DeploymentPos pos
)
3920 return VersionBitsStateSinceHeight(chainActive
.Tip(), params
, pos
, versionbitscache
);
3923 static const uint64_t MEMPOOL_DUMP_VERSION
= 1;
3925 bool LoadMempool(void)
3927 int64_t nExpiryTimeout
= GetArg("-mempoolexpiry", DEFAULT_MEMPOOL_EXPIRY
) * 60 * 60;
3928 FILE* filestr
= fsbridge::fopen(GetDataDir() / "mempool.dat", "rb");
3929 CAutoFile
file(filestr
, SER_DISK
, CLIENT_VERSION
);
3930 if (file
.IsNull()) {
3931 LogPrintf("Failed to open mempool file from disk. Continuing anyway.\n");
3936 int64_t skipped
= 0;
3938 int64_t nNow
= GetTime();
3943 if (version
!= MEMPOOL_DUMP_VERSION
) {
3956 CAmount amountdelta
= nFeeDelta
;
3958 mempool
.PrioritiseTransaction(tx
->GetHash(), amountdelta
);
3960 CValidationState state
;
3961 if (nTime
+ nExpiryTimeout
> nNow
) {
3963 AcceptToMemoryPoolWithTime(mempool
, state
, tx
, true, NULL
, nTime
);
3964 if (state
.IsValid()) {
3972 if (ShutdownRequested())
3975 std::map
<uint256
, CAmount
> mapDeltas
;
3978 for (const auto& i
: mapDeltas
) {
3979 mempool
.PrioritiseTransaction(i
.first
, i
.second
);
3981 } catch (const std::exception
& e
) {
3982 LogPrintf("Failed to deserialize mempool data on disk: %s. Continuing anyway.\n", e
.what());
3986 LogPrintf("Imported mempool transactions from disk: %i successes, %i failed, %i expired\n", count
, failed
, skipped
);
3990 void DumpMempool(void)
3992 int64_t start
= GetTimeMicros();
3994 std::map
<uint256
, CAmount
> mapDeltas
;
3995 std::vector
<TxMempoolInfo
> vinfo
;
3999 for (const auto &i
: mempool
.mapDeltas
) {
4000 mapDeltas
[i
.first
] = i
.second
;
4002 vinfo
= mempool
.infoAll();
4005 int64_t mid
= GetTimeMicros();
4008 FILE* filestr
= fsbridge::fopen(GetDataDir() / "mempool.dat.new", "wb");
4013 CAutoFile
file(filestr
, SER_DISK
, CLIENT_VERSION
);
4015 uint64_t version
= MEMPOOL_DUMP_VERSION
;
4018 file
<< (uint64_t)vinfo
.size();
4019 for (const auto& i
: vinfo
) {
4021 file
<< (int64_t)i
.nTime
;
4022 file
<< (int64_t)i
.nFeeDelta
;
4023 mapDeltas
.erase(i
.tx
->GetHash());
4027 FileCommit(file
.Get());
4029 RenameOver(GetDataDir() / "mempool.dat.new", GetDataDir() / "mempool.dat");
4030 int64_t last
= GetTimeMicros();
4031 LogPrintf("Dumped mempool: %gs to copy, %gs to dump\n", (mid
-start
)*0.000001, (last
-mid
)*0.000001);
4032 } catch (const std::exception
& e
) {
4033 LogPrintf("Failed to dump mempool: %s. Continuing anyway.\n", e
.what());
4037 //! Guess how far we are in the verification process at the given block index
4038 double GuessVerificationProgress(const ChainTxData
& data
, CBlockIndex
*pindex
) {
4042 int64_t nNow
= time(NULL
);
4046 if (pindex
->nChainTx
<= data
.nTxCount
) {
4047 fTxTotal
= data
.nTxCount
+ (nNow
- data
.nTime
) * data
.dTxRate
;
4049 fTxTotal
= pindex
->nChainTx
+ (nNow
- pindex
->GetBlockTime()) * data
.dTxRate
;
4052 return pindex
->nChainTx
/ fTxTotal
;
4061 BlockMap::iterator it1
= mapBlockIndex
.begin();
4062 for (; it1
!= mapBlockIndex
.end(); it1
++)
4063 delete (*it1
).second
;
4064 mapBlockIndex
.clear();
4066 } instance_of_cmaincleanup
;