|
|
@ -1186,11 +1186,11 @@ void static InvalidChainFound(CBlockIndex* pindexNew) |
|
|
|
} |
|
|
|
} |
|
|
|
printf("InvalidChainFound: invalid block=%s height=%d work=%s date=%s\n", |
|
|
|
printf("InvalidChainFound: invalid block=%s height=%d work=%s date=%s\n", |
|
|
|
BlockHashStr(pindexNew->GetBlockHash()).c_str(), pindexNew->nHeight, |
|
|
|
BlockHashStr(pindexNew->GetBlockHash()).c_str(), pindexNew->nHeight, |
|
|
|
pindexNew->bnChainWork.ToString().c_str(), DateTimeStrFormat("%x %H:%M:%S", |
|
|
|
pindexNew->bnChainWork.ToString().c_str(), DateTimeStrFormat("%Y-%m-%dT%H:%M:%S", |
|
|
|
pindexNew->GetBlockTime()).c_str()); |
|
|
|
pindexNew->GetBlockTime()).c_str()); |
|
|
|
printf("InvalidChainFound: current best=%s height=%d work=%s date=%s\n", |
|
|
|
printf("InvalidChainFound: current best=%s height=%d work=%s date=%s\n", |
|
|
|
BlockHashStr(hashBestChain).c_str(), nBestHeight, bnBestChainWork.ToString().c_str(), |
|
|
|
BlockHashStr(hashBestChain).c_str(), nBestHeight, bnBestChainWork.ToString().c_str(), |
|
|
|
DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str()); |
|
|
|
DateTimeStrFormat("%Y-%m-%dT%H:%M:%S", pindexBest->GetBlockTime()).c_str()); |
|
|
|
if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6) |
|
|
|
if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6) |
|
|
|
printf("InvalidChainFound: Warning: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n"); |
|
|
|
printf("InvalidChainFound: Warning: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n"); |
|
|
|
} |
|
|
|
} |
|
|
@ -1805,7 +1805,7 @@ bool SetBestChain(CBlockIndex* pindexNew) |
|
|
|
nTransactionsUpdated++; |
|
|
|
nTransactionsUpdated++; |
|
|
|
printf("SetBestChain: new best=%s height=%d work=%s tx=%lu date=%s\n", |
|
|
|
printf("SetBestChain: new best=%s height=%d work=%s tx=%lu date=%s\n", |
|
|
|
BlockHashStr(hashBestChain).c_str(), nBestHeight, bnBestChainWork.ToString().c_str(), (unsigned long)pindexNew->nChainTx, |
|
|
|
BlockHashStr(hashBestChain).c_str(), nBestHeight, bnBestChainWork.ToString().c_str(), (unsigned long)pindexNew->nChainTx, |
|
|
|
DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str()); |
|
|
|
DateTimeStrFormat("%Y-%m-%dT%H:%M:%S", pindexBest->GetBlockTime()).c_str()); |
|
|
|
|
|
|
|
|
|
|
|
// Check the version of the last 100 blocks to see if we need to upgrade:
|
|
|
|
// Check the version of the last 100 blocks to see if we need to upgrade:
|
|
|
|
if (!fIsInitialDownload) |
|
|
|
if (!fIsInitialDownload) |
|
|
@ -2346,7 +2346,7 @@ bool static LoadBlockIndexDB() |
|
|
|
} |
|
|
|
} |
|
|
|
printf("LoadBlockIndex(): hashBestChain=%s height=%d date=%s\n", |
|
|
|
printf("LoadBlockIndex(): hashBestChain=%s height=%d date=%s\n", |
|
|
|
BlockHashStr(hashBestChain).c_str(), nBestHeight, |
|
|
|
BlockHashStr(hashBestChain).c_str(), nBestHeight, |
|
|
|
DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str()); |
|
|
|
DateTimeStrFormat("%Y-%m-%dT%H:%M:%S", pindexBest->GetBlockTime()).c_str()); |
|
|
|
|
|
|
|
|
|
|
|
// Load bnBestInvalidWork, OK if it doesn't exist
|
|
|
|
// Load bnBestInvalidWork, OK if it doesn't exist
|
|
|
|
pblocktree->ReadBestInvalidWork(bnBestInvalidWork); |
|
|
|
pblocktree->ReadBestInvalidWork(bnBestInvalidWork); |
|
|
@ -2517,7 +2517,7 @@ void PrintBlockTree() |
|
|
|
printf("%d (blk%05u.dat:0x%x) %s tx %"PRIszu"", |
|
|
|
printf("%d (blk%05u.dat:0x%x) %s tx %"PRIszu"", |
|
|
|
pindex->nHeight, |
|
|
|
pindex->nHeight, |
|
|
|
pindex->GetBlockPos().nFile, pindex->GetBlockPos().nPos, |
|
|
|
pindex->GetBlockPos().nFile, pindex->GetBlockPos().nPos, |
|
|
|
DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(), |
|
|
|
DateTimeStrFormat("%Y-%m-%dT%H:%M:%S", block.GetBlockTime()).c_str(), |
|
|
|
block.vtx.size()); |
|
|
|
block.vtx.size()); |
|
|
|
|
|
|
|
|
|
|
|
PrintWallets(block); |
|
|
|
PrintWallets(block); |
|
|
|