Changeset View
Changeset View
Standalone View
Standalone View
src/chain.h
// Copyright (c) 2009-2010 Satoshi Nakamoto | // Copyright (c) 2009-2010 Satoshi Nakamoto | ||||
// Copyright (c) 2009-2016 The Bitcoin Core developers | // Copyright (c) 2009-2016 The Bitcoin Core developers | ||||
// Distributed under the MIT software license, see the accompanying | // Distributed under the MIT software license, see the accompanying | ||||
// file COPYING or http://www.opensource.org/licenses/mit-license.php. | // file COPYING or http://www.opensource.org/licenses/mit-license.php. | ||||
#ifndef BITCOIN_CHAIN_H | #ifndef BITCOIN_CHAIN_H | ||||
#define BITCOIN_CHAIN_H | #define BITCOIN_CHAIN_H | ||||
#include "arith_uint256.h" | #include "arith_uint256.h" | ||||
#include "primitives/block.h" | |||||
#include "pow.h" | #include "pow.h" | ||||
#include "primitives/block.h" | |||||
#include "tinyformat.h" | #include "tinyformat.h" | ||||
#include "uint256.h" | #include "uint256.h" | ||||
#include <vector> | #include <vector> | ||||
class CBlockFileInfo | class CBlockFileInfo { | ||||
{ | |||||
public: | public: | ||||
unsigned int nBlocks; //!< number of blocks stored in file | //!< number of blocks stored in file | ||||
unsigned int nSize; //!< number of used bytes of block file | unsigned int nBlocks; | ||||
unsigned int nUndoSize; //!< number of used bytes in the undo file | //!< number of used bytes of block file | ||||
unsigned int nHeightFirst; //!< lowest height of block in file | unsigned int nSize; | ||||
unsigned int nHeightLast; //!< highest height of block in file | //!< number of used bytes in the undo file | ||||
uint64_t nTimeFirst; //!< earliest time of block in file | unsigned int nUndoSize; | ||||
uint64_t nTimeLast; //!< latest time of block in file | //!< lowest height of block in file | ||||
unsigned int nHeightFirst; | |||||
//!< highest height of block in file | |||||
unsigned int nHeightLast; | |||||
//!< earliest time of block in file | |||||
uint64_t nTimeFirst; | |||||
//!< latest time of block in file | |||||
uint64_t nTimeLast; | |||||
ADD_SERIALIZE_METHODS; | ADD_SERIALIZE_METHODS; | ||||
template <typename Stream, typename Operation> | template <typename Stream, typename Operation> | ||||
inline void SerializationOp(Stream& s, Operation ser_action) { | inline void SerializationOp(Stream &s, Operation ser_action) { | ||||
READWRITE(VARINT(nBlocks)); | READWRITE(VARINT(nBlocks)); | ||||
READWRITE(VARINT(nSize)); | READWRITE(VARINT(nSize)); | ||||
READWRITE(VARINT(nUndoSize)); | READWRITE(VARINT(nUndoSize)); | ||||
READWRITE(VARINT(nHeightFirst)); | READWRITE(VARINT(nHeightFirst)); | ||||
READWRITE(VARINT(nHeightLast)); | READWRITE(VARINT(nHeightLast)); | ||||
READWRITE(VARINT(nTimeFirst)); | READWRITE(VARINT(nTimeFirst)); | ||||
READWRITE(VARINT(nTimeLast)); | READWRITE(VARINT(nTimeLast)); | ||||
} | } | ||||
void SetNull() { | void SetNull() { | ||||
nBlocks = 0; | nBlocks = 0; | ||||
nSize = 0; | nSize = 0; | ||||
nUndoSize = 0; | nUndoSize = 0; | ||||
nHeightFirst = 0; | nHeightFirst = 0; | ||||
nHeightLast = 0; | nHeightLast = 0; | ||||
nTimeFirst = 0; | nTimeFirst = 0; | ||||
nTimeLast = 0; | nTimeLast = 0; | ||||
} | } | ||||
CBlockFileInfo() { | CBlockFileInfo() { SetNull(); } | ||||
SetNull(); | |||||
} | |||||
std::string ToString() const; | std::string ToString() const; | ||||
/** update statistics (does not update nSize) */ | /** update statistics (does not update nSize) */ | ||||
void AddBlock(unsigned int nHeightIn, uint64_t nTimeIn) { | void AddBlock(unsigned int nHeightIn, uint64_t nTimeIn) { | ||||
if (nBlocks==0 || nHeightFirst > nHeightIn) | if (nBlocks == 0 || nHeightFirst > nHeightIn) nHeightFirst = nHeightIn; | ||||
nHeightFirst = nHeightIn; | if (nBlocks == 0 || nTimeFirst > nTimeIn) nTimeFirst = nTimeIn; | ||||
if (nBlocks==0 || nTimeFirst > nTimeIn) | |||||
nTimeFirst = nTimeIn; | |||||
nBlocks++; | nBlocks++; | ||||
if (nHeightIn > nHeightLast) | if (nHeightIn > nHeightLast) nHeightLast = nHeightIn; | ||||
nHeightLast = nHeightIn; | if (nTimeIn > nTimeLast) nTimeLast = nTimeIn; | ||||
if (nTimeIn > nTimeLast) | |||||
nTimeLast = nTimeIn; | |||||
} | } | ||||
}; | }; | ||||
struct CDiskBlockPos | struct CDiskBlockPos { | ||||
{ | |||||
int nFile; | int nFile; | ||||
unsigned int nPos; | unsigned int nPos; | ||||
ADD_SERIALIZE_METHODS; | ADD_SERIALIZE_METHODS; | ||||
template <typename Stream, typename Operation> | template <typename Stream, typename Operation> | ||||
inline void SerializationOp(Stream& s, Operation ser_action) { | inline void SerializationOp(Stream &s, Operation ser_action) { | ||||
READWRITE(VARINT(nFile)); | READWRITE(VARINT(nFile)); | ||||
READWRITE(VARINT(nPos)); | READWRITE(VARINT(nPos)); | ||||
} | } | ||||
CDiskBlockPos() { | CDiskBlockPos() { SetNull(); } | ||||
SetNull(); | |||||
} | |||||
CDiskBlockPos(int nFileIn, unsigned int nPosIn) { | CDiskBlockPos(int nFileIn, unsigned int nPosIn) { | ||||
nFile = nFileIn; | nFile = nFileIn; | ||||
nPos = nPosIn; | nPos = nPosIn; | ||||
} | } | ||||
friend bool operator==(const CDiskBlockPos &a, const CDiskBlockPos &b) { | friend bool operator==(const CDiskBlockPos &a, const CDiskBlockPos &b) { | ||||
return (a.nFile == b.nFile && a.nPos == b.nPos); | return (a.nFile == b.nFile && a.nPos == b.nPos); | ||||
} | } | ||||
friend bool operator!=(const CDiskBlockPos &a, const CDiskBlockPos &b) { | friend bool operator!=(const CDiskBlockPos &a, const CDiskBlockPos &b) { | ||||
return !(a == b); | return !(a == b); | ||||
} | } | ||||
void SetNull() { nFile = -1; nPos = 0; } | void SetNull() { | ||||
nFile = -1; | |||||
nPos = 0; | |||||
} | |||||
bool IsNull() const { return (nFile == -1); } | bool IsNull() const { return (nFile == -1); } | ||||
std::string ToString() const | std::string ToString() const { | ||||
{ | |||||
return strprintf("CBlockDiskPos(nFile=%i, nPos=%i)", nFile, nPos); | return strprintf("CBlockDiskPos(nFile=%i, nPos=%i)", nFile, nPos); | ||||
} | } | ||||
}; | }; | ||||
enum BlockStatus: uint32_t { | enum BlockStatus : uint32_t { | ||||
//! Unused. | //! Unused. | ||||
BLOCK_VALID_UNKNOWN = 0, | BLOCK_VALID_UNKNOWN = 0, | ||||
//! Parsed, version ok, hash satisfies claimed PoW, 1 <= vtx count <= max, timestamp not in future | //! Parsed, version ok, hash satisfies claimed PoW, 1 <= vtx count <= max, | ||||
//! timestamp not in future | |||||
BLOCK_VALID_HEADER = 1, | BLOCK_VALID_HEADER = 1, | ||||
//! All parent headers found, difficulty matches, timestamp >= median previous, checkpoint. Implies all parents | //! All parent headers found, difficulty matches, timestamp >= median | ||||
//! are also at least TREE. | //! previous, checkpoint. Implies all parents are also at least TREE. | ||||
BLOCK_VALID_TREE = 2, | BLOCK_VALID_TREE = 2, | ||||
/** | /** | ||||
* Only first tx is coinbase, 2 <= coinbase input script length <= 100, transactions valid, no duplicate txids, | * Only first tx is coinbase, 2 <= coinbase input script length <= 100, | ||||
* sigops, size, merkle root. Implies all parents are at least TREE but not necessarily TRANSACTIONS. When all | * transactions valid, no duplicate txids, sigops, size, merkle root. | ||||
* parent blocks also have TRANSACTIONS, CBlockIndex::nChainTx will be set. | * Implies all parents are at least TREE but not necessarily TRANSACTIONS. | ||||
* When all parent blocks also have TRANSACTIONS, CBlockIndex::nChainTx will | |||||
* be set. | |||||
*/ | */ | ||||
BLOCK_VALID_TRANSACTIONS = 3, | BLOCK_VALID_TRANSACTIONS = 3, | ||||
//! Outputs do not overspend inputs, no double spends, coinbase output ok, no immature coinbase spends, BIP30. | //! Outputs do not overspend inputs, no double spends, coinbase output ok, | ||||
//! no immature coinbase spends, BIP30. | |||||
//! Implies all parents are also at least CHAIN. | //! Implies all parents are also at least CHAIN. | ||||
BLOCK_VALID_CHAIN = 4, | BLOCK_VALID_CHAIN = 4, | ||||
//! Scripts & signatures ok. Implies all parents are also at least SCRIPTS. | //! Scripts & signatures ok. Implies all parents are also at least SCRIPTS. | ||||
BLOCK_VALID_SCRIPTS = 5, | BLOCK_VALID_SCRIPTS = 5, | ||||
//! All validity bits. | //! All validity bits. | ||||
BLOCK_VALID_MASK = BLOCK_VALID_HEADER | BLOCK_VALID_TREE | BLOCK_VALID_TRANSACTIONS | | BLOCK_VALID_MASK = BLOCK_VALID_HEADER | BLOCK_VALID_TREE | | ||||
BLOCK_VALID_CHAIN | BLOCK_VALID_SCRIPTS, | BLOCK_VALID_TRANSACTIONS | BLOCK_VALID_CHAIN | | ||||
BLOCK_VALID_SCRIPTS, | |||||
BLOCK_HAVE_DATA = 8, //!< full block available in blk*.dat | |||||
BLOCK_HAVE_UNDO = 16, //!< undo data available in rev*.dat | //!< full block available in blk*.dat | ||||
BLOCK_HAVE_DATA = 8, | |||||
//!< undo data available in rev*.dat | |||||
BLOCK_HAVE_UNDO = 16, | |||||
BLOCK_HAVE_MASK = BLOCK_HAVE_DATA | BLOCK_HAVE_UNDO, | BLOCK_HAVE_MASK = BLOCK_HAVE_DATA | BLOCK_HAVE_UNDO, | ||||
BLOCK_FAILED_VALID = 32, //!< stage after last reached validness failed | //!< stage after last reached validness failed | ||||
BLOCK_FAILED_CHILD = 64, //!< descends from failed block | BLOCK_FAILED_VALID = 32, | ||||
//!< descends from failed block | |||||
BLOCK_FAILED_CHILD = 64, | |||||
BLOCK_FAILED_MASK = BLOCK_FAILED_VALID | BLOCK_FAILED_CHILD, | BLOCK_FAILED_MASK = BLOCK_FAILED_VALID | BLOCK_FAILED_CHILD, | ||||
}; | }; | ||||
/** The block chain is a tree shaped structure starting with the | /** | ||||
* genesis block at the root, with each block potentially having multiple | * The block chain is a tree shaped structure starting with the genesis block at | ||||
* candidates to be the next block. A blockindex may have multiple pprev pointing | * the root, with each block potentially having multiple candidates to be the | ||||
* to it, but at most one of them can be part of the currently active branch. | * next block. A blockindex may have multiple pprev pointing to it, but at most | ||||
* one of them can be part of the currently active branch. | |||||
*/ | */ | ||||
class CBlockIndex | class CBlockIndex { | ||||
{ | |||||
public: | public: | ||||
//! pointer to the hash of the block, if any. Memory is owned by this CBlockIndex | //! pointer to the hash of the block, if any. Memory is owned by this | ||||
//! CBlockIndex | |||||
const uint256* phashBlock; | const uint256 *phashBlock; | ||||
//! pointer to the index of the predecessor of this block | //! pointer to the index of the predecessor of this block | ||||
CBlockIndex* pprev; | CBlockIndex *pprev; | ||||
//! pointer to the index of some further predecessor of this block | //! pointer to the index of some further predecessor of this block | ||||
CBlockIndex* pskip; | CBlockIndex *pskip; | ||||
//! height of the entry in the chain. The genesis block has height 0 | //! height of the entry in the chain. The genesis block has height 0 | ||||
int nHeight; | int nHeight; | ||||
//! Which # file this block is stored in (blk?????.dat) | //! Which # file this block is stored in (blk?????.dat) | ||||
int nFile; | int nFile; | ||||
//! Byte offset within blk?????.dat where this block's data is stored | //! Byte offset within blk?????.dat where this block's data is stored | ||||
unsigned int nDataPos; | unsigned int nDataPos; | ||||
//! Byte offset within rev?????.dat where this block's undo data is stored | //! Byte offset within rev?????.dat where this block's undo data is stored | ||||
unsigned int nUndoPos; | unsigned int nUndoPos; | ||||
//! (memory only) Total amount of work (expected number of hashes) in the chain up to and including this block | //! (memory only) Total amount of work (expected number of hashes) in the | ||||
//! chain up to and including this block | |||||
arith_uint256 nChainWork; | arith_uint256 nChainWork; | ||||
//! Number of transactions in this block. | //! Number of transactions in this block. | ||||
//! Note: in a potential headers-first mode, this number cannot be relied upon | //! Note: in a potential headers-first mode, this number cannot be relied | ||||
//! upon | |||||
unsigned int nTx; | unsigned int nTx; | ||||
//! (memory only) Number of transactions in the chain up to and including this block. | //! (memory only) Number of transactions in the chain up to and including | ||||
//! This value will be non-zero only if and only if transactions for this block and all its parents are available. | //! this block. | ||||
//! Change to 64-bit type when necessary; won't happen before 2030 | //! This value will be non-zero only if and only if transactions for this | ||||
//! block and all its parents are available. Change to 64-bit type when | |||||
//! necessary; won't happen before 2030 | |||||
unsigned int nChainTx; | unsigned int nChainTx; | ||||
//! Verification status of this block. See enum BlockStatus | //! Verification status of this block. See enum BlockStatus | ||||
unsigned int nStatus; | unsigned int nStatus; | ||||
//! block header | //! block header | ||||
int nVersion; | int nVersion; | ||||
uint256 hashMerkleRoot; | uint256 hashMerkleRoot; | ||||
unsigned int nTime; | unsigned int nTime; | ||||
unsigned int nBits; | unsigned int nBits; | ||||
unsigned int nNonce; | unsigned int nNonce; | ||||
//! (memory only) Sequential id assigned to distinguish order in which blocks are received. | //! (memory only) Sequential id assigned to distinguish order in which | ||||
//! blocks are received. | |||||
int32_t nSequenceId; | int32_t nSequenceId; | ||||
//! (memory only) Maximum nTime in the chain upto and including this block. | //! (memory only) Maximum nTime in the chain upto and including this block. | ||||
unsigned int nTimeMax; | unsigned int nTimeMax; | ||||
void SetNull() | void SetNull() { | ||||
{ | |||||
phashBlock = NULL; | phashBlock = NULL; | ||||
pprev = NULL; | pprev = NULL; | ||||
pskip = NULL; | pskip = NULL; | ||||
nHeight = 0; | nHeight = 0; | ||||
nFile = 0; | nFile = 0; | ||||
nDataPos = 0; | nDataPos = 0; | ||||
nUndoPos = 0; | nUndoPos = 0; | ||||
nChainWork = arith_uint256(); | nChainWork = arith_uint256(); | ||||
nTx = 0; | nTx = 0; | ||||
nChainTx = 0; | nChainTx = 0; | ||||
nStatus = 0; | nStatus = 0; | ||||
nSequenceId = 0; | nSequenceId = 0; | ||||
nTimeMax = 0; | nTimeMax = 0; | ||||
nVersion = 0; | nVersion = 0; | ||||
hashMerkleRoot = uint256(); | hashMerkleRoot = uint256(); | ||||
nTime = 0; | nTime = 0; | ||||
nBits = 0; | nBits = 0; | ||||
nNonce = 0; | nNonce = 0; | ||||
} | } | ||||
CBlockIndex() | CBlockIndex() { SetNull(); } | ||||
{ | |||||
SetNull(); | |||||
} | |||||
CBlockIndex(const CBlockHeader& block) | CBlockIndex(const CBlockHeader &block) { | ||||
{ | |||||
SetNull(); | SetNull(); | ||||
nVersion = block.nVersion; | nVersion = block.nVersion; | ||||
hashMerkleRoot = block.hashMerkleRoot; | hashMerkleRoot = block.hashMerkleRoot; | ||||
nTime = block.nTime; | nTime = block.nTime; | ||||
nBits = block.nBits; | nBits = block.nBits; | ||||
nNonce = block.nNonce; | nNonce = block.nNonce; | ||||
} | } | ||||
CDiskBlockPos GetBlockPos() const { | CDiskBlockPos GetBlockPos() const { | ||||
CDiskBlockPos ret; | CDiskBlockPos ret; | ||||
if (nStatus & BLOCK_HAVE_DATA) { | if (nStatus & BLOCK_HAVE_DATA) { | ||||
ret.nFile = nFile; | ret.nFile = nFile; | ||||
ret.nPos = nDataPos; | ret.nPos = nDataPos; | ||||
} | } | ||||
return ret; | return ret; | ||||
} | } | ||||
CDiskBlockPos GetUndoPos() const { | CDiskBlockPos GetUndoPos() const { | ||||
CDiskBlockPos ret; | CDiskBlockPos ret; | ||||
if (nStatus & BLOCK_HAVE_UNDO) { | if (nStatus & BLOCK_HAVE_UNDO) { | ||||
ret.nFile = nFile; | ret.nFile = nFile; | ||||
ret.nPos = nUndoPos; | ret.nPos = nUndoPos; | ||||
} | } | ||||
return ret; | return ret; | ||||
} | } | ||||
CBlockHeader GetBlockHeader() const | CBlockHeader GetBlockHeader() const { | ||||
{ | |||||
CBlockHeader block; | CBlockHeader block; | ||||
block.nVersion = nVersion; | block.nVersion = nVersion; | ||||
if (pprev) | if (pprev) block.hashPrevBlock = pprev->GetBlockHash(); | ||||
block.hashPrevBlock = pprev->GetBlockHash(); | |||||
block.hashMerkleRoot = hashMerkleRoot; | block.hashMerkleRoot = hashMerkleRoot; | ||||
block.nTime = nTime; | block.nTime = nTime; | ||||
block.nBits = nBits; | block.nBits = nBits; | ||||
block.nNonce = nNonce; | block.nNonce = nNonce; | ||||
return block; | return block; | ||||
} | } | ||||
uint256 GetBlockHash() const | uint256 GetBlockHash() const { return *phashBlock; } | ||||
{ | |||||
return *phashBlock; | |||||
} | |||||
int64_t GetBlockTime() const | int64_t GetBlockTime() const { return (int64_t)nTime; } | ||||
{ | |||||
return (int64_t)nTime; | |||||
} | |||||
int64_t GetBlockTimeMax() const | int64_t GetBlockTimeMax() const { return (int64_t)nTimeMax; } | ||||
{ | |||||
return (int64_t)nTimeMax; | |||||
} | |||||
enum { nMedianTimeSpan=11 }; | enum { nMedianTimeSpan = 11 }; | ||||
int64_t GetMedianTimePast() const | int64_t GetMedianTimePast() const { | ||||
{ | |||||
int64_t pmedian[nMedianTimeSpan]; | int64_t pmedian[nMedianTimeSpan]; | ||||
int64_t* pbegin = &pmedian[nMedianTimeSpan]; | int64_t *pbegin = &pmedian[nMedianTimeSpan]; | ||||
int64_t* pend = &pmedian[nMedianTimeSpan]; | int64_t *pend = &pmedian[nMedianTimeSpan]; | ||||
const CBlockIndex* pindex = this; | const CBlockIndex *pindex = this; | ||||
for (int i = 0; i < nMedianTimeSpan && pindex; i++, pindex = pindex->pprev) | for (int i = 0; i < nMedianTimeSpan && pindex; | ||||
i++, pindex = pindex->pprev) | |||||
*(--pbegin) = pindex->GetBlockTime(); | *(--pbegin) = pindex->GetBlockTime(); | ||||
std::sort(pbegin, pend); | std::sort(pbegin, pend); | ||||
return pbegin[(pend - pbegin)/2]; | return pbegin[(pend - pbegin) / 2]; | ||||
} | } | ||||
std::string ToString() const | std::string ToString() const { | ||||
{ | return strprintf( | ||||
return strprintf("CBlockIndex(pprev=%p, nHeight=%d, merkle=%s, hashBlock=%s)", | "CBlockIndex(pprev=%p, nHeight=%d, merkle=%s, hashBlock=%s)", pprev, | ||||
pprev, nHeight, | nHeight, hashMerkleRoot.ToString(), GetBlockHash().ToString()); | ||||
hashMerkleRoot.ToString(), | |||||
GetBlockHash().ToString()); | |||||
} | } | ||||
//! Check whether this block index entry is valid up to the passed validity level. | //! Check whether this block index entry is valid up to the passed validity | ||||
bool IsValid(enum BlockStatus nUpTo = BLOCK_VALID_TRANSACTIONS) const | //! level. | ||||
{ | bool IsValid(enum BlockStatus nUpTo = BLOCK_VALID_TRANSACTIONS) const { | ||||
assert(!(nUpTo & ~BLOCK_VALID_MASK)); // Only validity flags allowed. | // Only validity flags allowed. | ||||
if (nStatus & BLOCK_FAILED_MASK) | assert(!(nUpTo & ~BLOCK_VALID_MASK)); | ||||
return false; | if (nStatus & BLOCK_FAILED_MASK) return false; | ||||
return ((nStatus & BLOCK_VALID_MASK) >= nUpTo); | return ((nStatus & BLOCK_VALID_MASK) >= nUpTo); | ||||
} | } | ||||
//! Raise the validity level of this block index entry. | //! Raise the validity level of this block index entry. | ||||
//! Returns true if the validity was changed. | //! Returns true if the validity was changed. | ||||
bool RaiseValidity(enum BlockStatus nUpTo) | bool RaiseValidity(enum BlockStatus nUpTo) { | ||||
{ | // Only validity flags allowed. | ||||
assert(!(nUpTo & ~BLOCK_VALID_MASK)); // Only validity flags allowed. | assert(!(nUpTo & ~BLOCK_VALID_MASK)); | ||||
if (nStatus & BLOCK_FAILED_MASK) | if (nStatus & BLOCK_FAILED_MASK) return false; | ||||
return false; | |||||
if ((nStatus & BLOCK_VALID_MASK) < nUpTo) { | if ((nStatus & BLOCK_VALID_MASK) < nUpTo) { | ||||
nStatus = (nStatus & ~BLOCK_VALID_MASK) | nUpTo; | nStatus = (nStatus & ~BLOCK_VALID_MASK) | nUpTo; | ||||
return true; | return true; | ||||
} | } | ||||
return false; | return false; | ||||
} | } | ||||
//! Build the skiplist pointer for this entry. | //! Build the skiplist pointer for this entry. | ||||
void BuildSkip(); | void BuildSkip(); | ||||
//! Efficiently find an ancestor of this block. | //! Efficiently find an ancestor of this block. | ||||
CBlockIndex* GetAncestor(int height); | CBlockIndex *GetAncestor(int height); | ||||
const CBlockIndex* GetAncestor(int height) const; | const CBlockIndex *GetAncestor(int height) const; | ||||
}; | }; | ||||
arith_uint256 GetBlockProof(const CBlockIndex& block); | arith_uint256 GetBlockProof(const CBlockIndex &block); | ||||
/** Return the time it would take to redo the work difference between from and to, assuming the current hashrate corresponds to the difficulty at tip, in seconds. */ | /** Return the time it would take to redo the work difference between from and | ||||
int64_t GetBlockProofEquivalentTime(const CBlockIndex& to, const CBlockIndex& from, const CBlockIndex& tip, const Consensus::Params&); | * to, assuming the current hashrate corresponds to the difficulty at tip, in | ||||
* seconds. */ | |||||
int64_t GetBlockProofEquivalentTime(const CBlockIndex &to, | |||||
const CBlockIndex &from, | |||||
const CBlockIndex &tip, | |||||
const Consensus::Params &); | |||||
/** Used to marshal pointers into hashes for db storage. */ | /** Used to marshal pointers into hashes for db storage. */ | ||||
class CDiskBlockIndex : public CBlockIndex | class CDiskBlockIndex : public CBlockIndex { | ||||
{ | |||||
public: | public: | ||||
uint256 hashPrev; | uint256 hashPrev; | ||||
CDiskBlockIndex() { | CDiskBlockIndex() { hashPrev = uint256(); } | ||||
hashPrev = uint256(); | |||||
} | |||||
explicit CDiskBlockIndex(const CBlockIndex* pindex) : CBlockIndex(*pindex) { | explicit CDiskBlockIndex(const CBlockIndex *pindex) : CBlockIndex(*pindex) { | ||||
hashPrev = (pprev ? pprev->GetBlockHash() : uint256()); | hashPrev = (pprev ? pprev->GetBlockHash() : uint256()); | ||||
} | } | ||||
ADD_SERIALIZE_METHODS; | ADD_SERIALIZE_METHODS; | ||||
template <typename Stream, typename Operation> | template <typename Stream, typename Operation> | ||||
inline void SerializationOp(Stream& s, Operation ser_action) { | inline void SerializationOp(Stream &s, Operation ser_action) { | ||||
int nVersion = s.GetVersion(); | int nVersion = s.GetVersion(); | ||||
if (!(s.GetType() & SER_GETHASH)) | if (!(s.GetType() & SER_GETHASH)) READWRITE(VARINT(nVersion)); | ||||
READWRITE(VARINT(nVersion)); | |||||
READWRITE(VARINT(nHeight)); | READWRITE(VARINT(nHeight)); | ||||
READWRITE(VARINT(nStatus)); | READWRITE(VARINT(nStatus)); | ||||
READWRITE(VARINT(nTx)); | READWRITE(VARINT(nTx)); | ||||
if (nStatus & (BLOCK_HAVE_DATA | BLOCK_HAVE_UNDO)) | if (nStatus & (BLOCK_HAVE_DATA | BLOCK_HAVE_UNDO)) | ||||
READWRITE(VARINT(nFile)); | READWRITE(VARINT(nFile)); | ||||
if (nStatus & BLOCK_HAVE_DATA) | if (nStatus & BLOCK_HAVE_DATA) READWRITE(VARINT(nDataPos)); | ||||
READWRITE(VARINT(nDataPos)); | if (nStatus & BLOCK_HAVE_UNDO) READWRITE(VARINT(nUndoPos)); | ||||
if (nStatus & BLOCK_HAVE_UNDO) | |||||
READWRITE(VARINT(nUndoPos)); | |||||
// block header | // block header | ||||
READWRITE(this->nVersion); | READWRITE(this->nVersion); | ||||
READWRITE(hashPrev); | READWRITE(hashPrev); | ||||
READWRITE(hashMerkleRoot); | READWRITE(hashMerkleRoot); | ||||
READWRITE(nTime); | READWRITE(nTime); | ||||
READWRITE(nBits); | READWRITE(nBits); | ||||
READWRITE(nNonce); | READWRITE(nNonce); | ||||
} | } | ||||
uint256 GetBlockHash() const | uint256 GetBlockHash() const { | ||||
{ | |||||
CBlockHeader block; | CBlockHeader block; | ||||
block.nVersion = nVersion; | block.nVersion = nVersion; | ||||
block.hashPrevBlock = hashPrev; | block.hashPrevBlock = hashPrev; | ||||
block.hashMerkleRoot = hashMerkleRoot; | block.hashMerkleRoot = hashMerkleRoot; | ||||
block.nTime = nTime; | block.nTime = nTime; | ||||
block.nBits = nBits; | block.nBits = nBits; | ||||
block.nNonce = nNonce; | block.nNonce = nNonce; | ||||
return block.GetHash(); | return block.GetHash(); | ||||
} | } | ||||
std::string ToString() const { | |||||
std::string ToString() const | |||||
{ | |||||
std::string str = "CDiskBlockIndex("; | std::string str = "CDiskBlockIndex("; | ||||
str += CBlockIndex::ToString(); | str += CBlockIndex::ToString(); | ||||
str += strprintf("\n hashBlock=%s, hashPrev=%s)", | str += strprintf("\n hashBlock=%s, hashPrev=%s)", | ||||
GetBlockHash().ToString(), | GetBlockHash().ToString(), hashPrev.ToString()); | ||||
hashPrev.ToString()); | |||||
return str; | return str; | ||||
} | } | ||||
}; | }; | ||||
/** An in-memory indexed chain of blocks. */ | /** An in-memory indexed chain of blocks. */ | ||||
class CChain { | class CChain { | ||||
private: | private: | ||||
std::vector<CBlockIndex*> vChain; | std::vector<CBlockIndex *> vChain; | ||||
public: | public: | ||||
/** Returns the index entry for the genesis block of this chain, or NULL if none. */ | /** Returns the index entry for the genesis block of this chain, or NULL if | ||||
* none. */ | |||||
CBlockIndex *Genesis() const { | CBlockIndex *Genesis() const { | ||||
return vChain.size() > 0 ? vChain[0] : NULL; | return vChain.size() > 0 ? vChain[0] : NULL; | ||||
} | } | ||||
/** Returns the index entry for the tip of this chain, or NULL if none. */ | /** Returns the index entry for the tip of this chain, or NULL if none. */ | ||||
CBlockIndex *Tip() const { | CBlockIndex *Tip() const { | ||||
return vChain.size() > 0 ? vChain[vChain.size() - 1] : NULL; | return vChain.size() > 0 ? vChain[vChain.size() - 1] : NULL; | ||||
} | } | ||||
/** Returns the index entry at a particular height in this chain, or NULL if no such height exists. */ | /** Returns the index entry at a particular height in this chain, or NULL if | ||||
* no such height exists. */ | |||||
CBlockIndex *operator[](int nHeight) const { | CBlockIndex *operator[](int nHeight) const { | ||||
if (nHeight < 0 || nHeight >= (int)vChain.size()) | if (nHeight < 0 || nHeight >= (int)vChain.size()) return NULL; | ||||
return NULL; | |||||
return vChain[nHeight]; | return vChain[nHeight]; | ||||
} | } | ||||
/** Compare two chains efficiently. */ | /** Compare two chains efficiently. */ | ||||
friend bool operator==(const CChain &a, const CChain &b) { | friend bool operator==(const CChain &a, const CChain &b) { | ||||
return a.vChain.size() == b.vChain.size() && | return a.vChain.size() == b.vChain.size() && | ||||
a.vChain[a.vChain.size() - 1] == b.vChain[b.vChain.size() - 1]; | a.vChain[a.vChain.size() - 1] == b.vChain[b.vChain.size() - 1]; | ||||
} | } | ||||
/** Efficiently check whether a block is present in this chain. */ | /** Efficiently check whether a block is present in this chain. */ | ||||
bool Contains(const CBlockIndex *pindex) const { | bool Contains(const CBlockIndex *pindex) const { | ||||
return (*this)[pindex->nHeight] == pindex; | return (*this)[pindex->nHeight] == pindex; | ||||
} | } | ||||
/** Find the successor of a block in this chain, or NULL if the given index is not found or is the tip. */ | /** Find the successor of a block in this chain, or NULL if the given index | ||||
* is not found or is the tip. */ | |||||
CBlockIndex *Next(const CBlockIndex *pindex) const { | CBlockIndex *Next(const CBlockIndex *pindex) const { | ||||
if (Contains(pindex)) | if (Contains(pindex)) | ||||
return (*this)[pindex->nHeight + 1]; | return (*this)[pindex->nHeight + 1]; | ||||
else | else | ||||
return NULL; | return NULL; | ||||
} | } | ||||
/** Return the maximal height in the chain. Is equal to chain.Tip() ? chain.Tip()->nHeight : -1. */ | /** Return the maximal height in the chain. Is equal to chain.Tip() ? | ||||
int Height() const { | * chain.Tip()->nHeight : -1. */ | ||||
return vChain.size() - 1; | int Height() const { return vChain.size() - 1; } | ||||
} | |||||
/** Set/initialize a chain with a given tip. */ | /** Set/initialize a chain with a given tip. */ | ||||
void SetTip(CBlockIndex *pindex); | void SetTip(CBlockIndex *pindex); | ||||
/** Return a CBlockLocator that refers to a block in this chain (by default the tip). */ | /** Return a CBlockLocator that refers to a block in this chain (by default | ||||
* the tip). */ | |||||
CBlockLocator GetLocator(const CBlockIndex *pindex = NULL) const; | CBlockLocator GetLocator(const CBlockIndex *pindex = NULL) const; | ||||
/** Find the last common block between this chain and a block index entry. */ | /** Find the last common block between this chain and a block index entry. | ||||
*/ | |||||
const CBlockIndex *FindFork(const CBlockIndex *pindex) const; | const CBlockIndex *FindFork(const CBlockIndex *pindex) const; | ||||
/** Find the earliest block with timestamp equal or greater than the given. */ | /** Find the earliest block with timestamp equal or greater than the given. | ||||
*/ | |||||
CBlockIndex* FindEarliestAtLeast(int64_t nTime) const; | CBlockIndex *FindEarliestAtLeast(int64_t nTime) const; | ||||
}; | }; | ||||
#endif // BITCOIN_CHAIN_H | #endif // BITCOIN_CHAIN_H |