|
|
|
@ -2008,6 +2008,18 @@ static CBlockIndex* FindMostWorkChain() {
@@ -2008,6 +2008,18 @@ static CBlockIndex* FindMostWorkChain() {
|
|
|
|
|
} while(true); |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
// Delete all entries in setBlockIndexCandidates that are worse than the current tip.
|
|
|
|
|
static void PruneBlockIndexCandidates() { |
|
|
|
|
// Note that we can't delete the current block itself, as we may need to return to it later in case a
|
|
|
|
|
// reorganization to a better block fails.
|
|
|
|
|
std::set<CBlockIndex*, CBlockIndexWorkComparator>::iterator it = setBlockIndexCandidates.begin(); |
|
|
|
|
while (it != setBlockIndexCandidates.end() && setBlockIndexCandidates.value_comp()(*it, chainActive.Tip())) { |
|
|
|
|
setBlockIndexCandidates.erase(it++); |
|
|
|
|
} |
|
|
|
|
// Either the current tip or a successor of it we're working towards is left in setBlockIndexCandidates.
|
|
|
|
|
assert(!setBlockIndexCandidates.empty()); |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
// Try to make some progress towards making pindexMostWork the active block.
|
|
|
|
|
// pblock is either NULL or a pointer to a CBlock corresponding to pindexMostWork.
|
|
|
|
|
static bool ActivateBestChainStep(CValidationState &state, CBlockIndex *pindexMostWork, CBlock *pblock) { |
|
|
|
@ -2055,15 +2067,7 @@ static bool ActivateBestChainStep(CValidationState &state, CBlockIndex *pindexMo
@@ -2055,15 +2067,7 @@ static bool ActivateBestChainStep(CValidationState &state, CBlockIndex *pindexMo
|
|
|
|
|
return false; |
|
|
|
|
} |
|
|
|
|
} else { |
|
|
|
|
// Delete all entries in setBlockIndexCandidates that are worse than our new current block.
|
|
|
|
|
// Note that we can't delete the current block itself, as we may need to return to it later in case a
|
|
|
|
|
// reorganization to a better block fails.
|
|
|
|
|
std::set<CBlockIndex*, CBlockIndexWorkComparator>::iterator it = setBlockIndexCandidates.begin(); |
|
|
|
|
while (setBlockIndexCandidates.value_comp()(*it, chainActive.Tip())) { |
|
|
|
|
setBlockIndexCandidates.erase(it++); |
|
|
|
|
} |
|
|
|
|
// Either the current tip or a successor of it we're working towards is left in setBlockIndexCandidates.
|
|
|
|
|
assert(!setBlockIndexCandidates.empty()); |
|
|
|
|
PruneBlockIndexCandidates(); |
|
|
|
|
if (!pindexOldTip || chainActive.Tip()->nChainWork > pindexOldTip->nChainWork) { |
|
|
|
|
// We're in a better position than we were. Return temporarily to release the lock.
|
|
|
|
|
fContinue = false; |
|
|
|
@ -2956,6 +2960,9 @@ bool static LoadBlockIndexDB()
@@ -2956,6 +2960,9 @@ bool static LoadBlockIndexDB()
|
|
|
|
|
if (it == mapBlockIndex.end()) |
|
|
|
|
return true; |
|
|
|
|
chainActive.SetTip(it->second); |
|
|
|
|
|
|
|
|
|
PruneBlockIndexCandidates(); |
|
|
|
|
|
|
|
|
|
LogPrintf("LoadBlockIndexDB(): hashBestChain=%s height=%d date=%s progress=%f\n", |
|
|
|
|
chainActive.Tip()->GetBlockHash().ToString(), chainActive.Height(), |
|
|
|
|
DateTimeStrFormat("%Y-%m-%d %H:%M:%S", chainActive.Tip()->GetBlockTime()), |
|
|
|
|