21 MapCheckpoints::const_iterator i = checkpoints.find(nHeight);
22 if (i == checkpoints.end()) {
25 return hash == i->second;
32 for (
const MapCheckpoints::value_type &i :
reverse_iterate(checkpoints)) {
reverse_range< T > reverse_iterate(T &x)
Block-chain checkpoints are compiled-in sanity checks.
RecursiveMutex cs_main
Global state.
CBlockIndex * GetLastCheckpoint(const CCheckpointData &data) EXCLUSIVE_LOCKS_REQUIRED(cs_main)
Returns last CBlockIndex* that is a checkpoint.
#define EXCLUSIVE_LOCKS_REQUIRED(...)
MapCheckpoints mapCheckpoints
A BlockHash is a unqiue identifier for a block.
The block chain is a tree shaped structure starting with the genesis block at the root...
std::map< int, BlockHash > MapCheckpoints
CBlockIndex * LookupBlockIndex(const BlockHash &hash)
bool CheckBlock(const CCheckpointData &data, int nHeight, const BlockHash &hash)
Returns true if block passes checkpoint checks.