chain.h File Reference

#include <arith_uint256.h>
#include <primitives/block.h>
#include <pow.h>
#include <tinyformat.h>
#include <uint256.h>
#include <util.h>
#include <libdevcore/SHA3.h>
#include <libdevcore/RLP.h>
#include <vector>

Include dependency graph for chain.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
class	CBlockFileInfo
struct	CDiskBlockPos
class	CBlockIndex
	The block chain is a tree shaped structure starting with the genesis block at the root, with each block potentially having multiple candidates to be the next block. More...
class	CDiskBlockIndex
	Used to marshal pointers into hashes for db storage. More...
class	CChain
	An in-memory indexed chain of blocks. More...

Enumerations
enum	BlockStatus : uint32_t {   BLOCK_VALID_UNKNOWN = 0, BLOCK_VALID_HEADER = 1, BLOCK_VALID_TREE = 2, BLOCK_VALID_TRANSACTIONS = 3,   BLOCK_VALID_CHAIN = 4, BLOCK_VALID_SCRIPTS = 5, BLOCK_VALID_MASK, BLOCK_HAVE_DATA = 8,   BLOCK_HAVE_UNDO = 16, BLOCK_HAVE_MASK = BLOCK_HAVE_DATA | BLOCK_HAVE_UNDO, BLOCK_FAILED_VALID = 32, BLOCK_FAILED_CHILD = 64,   BLOCK_FAILED_MASK = BLOCK_FAILED_VALID | BLOCK_FAILED_CHILD, BLOCK_OPT_WITNESS = 128 }

Functions
arith_uint256	GetBlockProof (const CBlockIndex &block)
int64_t	GetBlockProofEquivalentTime (const CBlockIndex &to, const CBlockIndex &from, const CBlockIndex &tip, const Consensus::Params &)
	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. More...
const CBlockIndex *	LastCommonAncestor (const CBlockIndex *pa, const CBlockIndex *pb)
	Find the forking point between two chain tips. More...

Enumeration Type Documentation

enum BlockStatus : uint32_t

Enumerator
BLOCK_VALID_UNKNOWN	Unused.
BLOCK_VALID_HEADER	Parsed, version ok, hash satisfies claimed PoW, 1 <= vtx count <= max, timestamp not in future.
BLOCK_VALID_TREE	All parent headers found, difficulty matches, timestamp >= median previous, checkpoint. Implies all parents are also at least TREE.
BLOCK_VALID_TRANSACTIONS	Only first tx is coinbase, 2 <= coinbase input script length <= 100, transactions valid, no duplicate txids, sigops, size, merkle root. 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_CHAIN	Outputs do not overspend inputs, no double spends, coinbase output ok, no immature coinbase spends, BIP30. Implies all parents are also at least CHAIN.
BLOCK_VALID_SCRIPTS	Scripts & signatures ok. Implies all parents are also at least SCRIPTS.
BLOCK_VALID_MASK	All validity bits.
BLOCK_HAVE_DATA	full block available in blk*.dat
BLOCK_HAVE_UNDO	undo data available in rev*.dat
BLOCK_HAVE_MASK
BLOCK_FAILED_VALID	stage after last reached validness failed
BLOCK_FAILED_CHILD	descends from failed block
BLOCK_FAILED_MASK
BLOCK_OPT_WITNESS	block data in blk*.data was received with a witness-enforcing client

Definition at line 132 of file chain.h.

Function Documentation

arith_uint256 GetBlockProof

(

const CBlockIndex &

block

)

Definition at line 153 of file chain.cpp.

Here is the call graph for this function:

Here is the caller graph for this function:

int64_t GetBlockProofEquivalentTime	(	const CBlockIndex &	to,
		const CBlockIndex &	from,
		const CBlockIndex &	tip,
		const Consensus::Params &
	)

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.

Definition at line 168 of file chain.cpp.

Here is the call graph for this function:

Here is the caller graph for this function:

const CBlockIndex* LastCommonAncestor	(	const CBlockIndex *	pa,
		const CBlockIndex *	pb
	)

Find the forking point between two chain tips.

Find the forking point between two chain tips.

Both pa and pb must be non-nullptr.

Definition at line 188 of file chain.cpp.

Here is the call graph for this function:

Here is the caller graph for this function: