+++ /dev/null
-package state
-
-import (
- "errors"
- "sort"
- "sync"
-
- "github.com/vapor/common"
- "github.com/vapor/consensus"
- "github.com/vapor/protocol/bc"
- "github.com/vapor/protocol/bc/types"
-)
-
-// approxNodesPerDay is an approximation of the number of new blocks there are
-// in a day on average.
-const approxNodesPerDay = 24 * 24
-
-// BlockNode represents a block within the block chain and is primarily used to
-// aid in selecting the best chain to be the main chain.
-type BlockNode struct {
- Parent *BlockNode // parent is the parent block for this node.
- Hash bc.Hash // hash of the block.
-
- Version uint64
- Height uint64
- Timestamp uint64
- BlockWitness *common.BitMap
- TransactionsMerkleRoot bc.Hash
- TransactionStatusHash bc.Hash
-}
-
-func NewBlockNode(bh *types.BlockHeader, parent *BlockNode) (*BlockNode, error) {
- if bh.Height != 0 && parent == nil {
- return nil, errors.New("parent node can not be nil")
- }
-
- node := &BlockNode{
- Parent: parent,
- Hash: bh.Hash(),
- Version: bh.Version,
- Height: bh.Height,
- Timestamp: bh.Timestamp,
- TransactionsMerkleRoot: bh.TransactionsMerkleRoot,
- TransactionStatusHash: bh.TransactionStatusHash,
- }
-
- node.BlockWitness = common.NewBitMap(uint32(len(bh.Witness)))
- for i, witness := range bh.Witness {
- if len(witness) != 0 {
- if err := node.BlockWitness.Set(uint32(i)); err != nil {
- return nil, err
- }
- }
- }
- return node, nil
-}
-
-// blockHeader convert a node to the header struct
-func (node *BlockNode) BlockHeader() *types.BlockHeader {
- previousBlockHash := bc.Hash{}
- if node.Parent != nil {
- previousBlockHash = node.Parent.Hash
- }
- return &types.BlockHeader{
- Version: node.Version,
- Height: node.Height,
- PreviousBlockHash: previousBlockHash,
- Timestamp: node.Timestamp,
- BlockCommitment: types.BlockCommitment{
- TransactionsMerkleRoot: node.TransactionsMerkleRoot,
- TransactionStatusHash: node.TransactionStatusHash,
- },
- }
-}
-
-func (node *BlockNode) CalcPastMedianTime() uint64 {
- timestamps := []uint64{}
- iterNode := node
- for i := 0; i < consensus.MedianTimeBlocks && iterNode != nil; i++ {
- timestamps = append(timestamps, iterNode.Timestamp)
- iterNode = iterNode.Parent
- }
-
- sort.Sort(common.TimeSorter(timestamps))
- return timestamps[len(timestamps)/2]
-}
-
-// BlockIndex is the struct for help chain trace block chain as tree
-type BlockIndex struct {
- sync.RWMutex
-
- index map[bc.Hash]*BlockNode
- heightIndex map[uint64][]*BlockNode
- mainChain []*BlockNode
-}
-
-// NewBlockIndex will create a empty BlockIndex
-func NewBlockIndex() *BlockIndex {
- return &BlockIndex{
- index: make(map[bc.Hash]*BlockNode),
- heightIndex: make(map[uint64][]*BlockNode),
- mainChain: make([]*BlockNode, 0, approxNodesPerDay),
- }
-}
-
-// AddNode will add node to the index map
-func (bi *BlockIndex) AddNode(node *BlockNode) {
- bi.Lock()
- bi.index[node.Hash] = node
- bi.heightIndex[node.Height] = append(bi.heightIndex[node.Height], node)
- bi.Unlock()
-}
-
-// GetNode will search node from the index map
-func (bi *BlockIndex) GetNode(hash *bc.Hash) *BlockNode {
- bi.RLock()
- defer bi.RUnlock()
- return bi.index[*hash]
-}
-
-func (bi *BlockIndex) BestNode() *BlockNode {
- bi.RLock()
- defer bi.RUnlock()
- return bi.mainChain[len(bi.mainChain)-1]
-}
-
-// BlockExist check does the block existed in blockIndex
-func (bi *BlockIndex) BlockExist(hash *bc.Hash) bool {
- bi.RLock()
- _, ok := bi.index[*hash]
- bi.RUnlock()
- return ok
-}
-
-// TODO: THIS FUNCTION MIGHT BE DELETED
-func (bi *BlockIndex) InMainchain(hash bc.Hash) bool {
- bi.RLock()
- defer bi.RUnlock()
-
- node, ok := bi.index[hash]
- if !ok {
- return false
- }
- return bi.nodeByHeight(node.Height) == node
-}
-
-func (bi *BlockIndex) nodeByHeight(height uint64) *BlockNode {
- if height >= uint64(len(bi.mainChain)) {
- return nil
- }
- return bi.mainChain[height]
-}
-
-// NodeByHeight returns the block node at the specified height.
-func (bi *BlockIndex) NodeByHeight(height uint64) *BlockNode {
- bi.RLock()
- defer bi.RUnlock()
- return bi.nodeByHeight(height)
-}
-
-// NodesByHeight return all block nodes at the specified height.
-func (bi *BlockIndex) NodesByHeight(height uint64) []*BlockNode {
- bi.RLock()
- defer bi.RUnlock()
- return bi.heightIndex[height]
-}
-
-// SetMainChain will set the the mainChain array
-func (bi *BlockIndex) SetMainChain(node *BlockNode) {
- bi.Lock()
- defer bi.Unlock()
-
- needed := node.Height + 1
- if uint64(cap(bi.mainChain)) < needed {
- nodes := make([]*BlockNode, needed, needed+approxNodesPerDay)
- copy(nodes, bi.mainChain)
- bi.mainChain = nodes
- } else {
- i := uint64(len(bi.mainChain))
- bi.mainChain = bi.mainChain[0:needed]
- for ; i < needed; i++ {
- bi.mainChain[i] = nil
- }
- }
-
- for node != nil && bi.mainChain[node.Height] != node {
- bi.mainChain[node.Height] = node
- node = node.Parent
- }
-}
OSDN Git Service
