4 log "github.com/sirupsen/logrus"
6 "github.com/vapor/errors"
7 "github.com/vapor/protocol/bc"
8 "github.com/vapor/protocol/bc/types"
9 "github.com/vapor/protocol/state"
10 "github.com/vapor/protocol/validation"
14 // ErrBadBlock is returned when a block is invalid.
15 ErrBadBlock = errors.New("invalid block")
16 // ErrBadStateRoot is returned when the computed assets merkle root
17 // disagrees with the one declared in a block header.
18 ErrBadStateRoot = errors.New("invalid state merkle root")
21 // BlockExist check is a block in chain or orphan
22 func (c *Chain) BlockExist(hash *bc.Hash) bool {
23 return c.index.BlockExist(hash) || c.orphanManage.BlockExist(hash)
26 // GetBlockByHash return a block by given hash
27 func (c *Chain) GetBlockByHash(hash *bc.Hash) (*types.Block, error) {
28 return c.store.GetBlock(hash)
31 // GetBlockByHeight return a block header by given height
32 func (c *Chain) GetBlockByHeight(height uint64) (*types.Block, error) {
33 node := c.index.NodeByHeight(height)
35 return nil, errors.New("can't find block in given height")
37 return c.store.GetBlock(&node.Hash)
40 // GetHeaderByHash return a block header by given hash
41 func (c *Chain) GetHeaderByHash(hash *bc.Hash) (*types.BlockHeader, error) {
42 node := c.index.GetNode(hash)
44 return nil, errors.New("can't find block header in given hash")
46 return node.BlockHeader(), nil
49 // GetHeaderByHeight return a block header by given height
50 func (c *Chain) GetHeaderByHeight(height uint64) (*types.BlockHeader, error) {
51 node := c.index.NodeByHeight(height)
53 return nil, errors.New("can't find block header in given height")
55 return node.BlockHeader(), nil
58 func (c *Chain) calcReorganizeNodes(node *state.BlockNode) ([]*state.BlockNode, []*state.BlockNode) {
59 var attachNodes []*state.BlockNode
60 var detachNodes []*state.BlockNode
63 for c.index.NodeByHeight(attachNode.Height) != attachNode {
64 attachNodes = append([]*state.BlockNode{attachNode}, attachNodes...)
65 attachNode = attachNode.Parent
68 detachNode := c.bestNode
69 for detachNode != attachNode {
70 detachNodes = append(detachNodes, detachNode)
71 detachNode = detachNode.Parent
73 return attachNodes, detachNodes
76 func (c *Chain) connectBlock(block *types.Block) (err error) {
77 bcBlock := types.MapBlock(block)
78 if bcBlock.TransactionStatus, err = c.store.GetTransactionStatus(&bcBlock.ID); err != nil {
82 utxoView := state.NewUtxoViewpoint()
83 if err := c.store.GetTransactionsUtxo(utxoView, bcBlock.Transactions); err != nil {
86 if err := utxoView.ApplyBlock(bcBlock, bcBlock.TransactionStatus); err != nil {
89 node := c.index.GetNode(&bcBlock.ID)
90 if err := c.setState(node, utxoView); err != nil {
93 for _, tx := range block.Transactions {
94 for key, value := range tx.Entries {
97 c.store.SetWithdrawSpent(&key)
102 c.txPool.RemoveTransaction(&tx.Tx.ID)
107 func (c *Chain) reorganizeChain(node *state.BlockNode) error {
108 attachNodes, detachNodes := c.calcReorganizeNodes(node)
109 utxoView := state.NewUtxoViewpoint()
111 for _, detachNode := range detachNodes {
112 b, err := c.store.GetBlock(&detachNode.Hash)
117 detachBlock := types.MapBlock(b)
118 if err := c.store.GetTransactionsUtxo(utxoView, detachBlock.Transactions); err != nil {
121 txStatus, err := c.GetTransactionStatus(&detachBlock.ID)
125 if err := utxoView.DetachBlock(detachBlock, txStatus); err != nil {
129 log.WithFields(log.Fields{"height": node.Height, "hash": node.Hash.String()}).Debug("detach from mainchain")
132 for _, attachNode := range attachNodes {
133 b, err := c.store.GetBlock(&attachNode.Hash)
138 attachBlock := types.MapBlock(b)
139 if err := c.store.GetTransactionsUtxo(utxoView, attachBlock.Transactions); err != nil {
142 txStatus, err := c.GetTransactionStatus(&attachBlock.ID)
146 if err := utxoView.ApplyBlock(attachBlock, txStatus); err != nil {
150 log.WithFields(log.Fields{"height": node.Height, "hash": node.Hash.String()}).Debug("attach from mainchain")
153 return c.setState(node, utxoView)
156 // SaveBlock will validate and save block into storage
157 func (c *Chain) saveBlock(block *types.Block) error {
158 bcBlock := types.MapBlock(block)
159 parent := c.index.GetNode(&block.PreviousBlockHash)
161 if err := validation.ValidateBlock(bcBlock, parent, block, c.Authoritys, c.position); err != nil {
162 return errors.Sub(ErrBadBlock, err)
164 if err := c.store.SaveBlock(block, bcBlock.TransactionStatus); err != nil {
168 c.orphanManage.Delete(&bcBlock.ID)
169 node, err := state.NewBlockNode(&block.BlockHeader, parent)
174 c.index.AddNode(node)
178 func (c *Chain) saveSubBlock(block *types.Block) *types.Block {
179 blockHash := block.Hash()
180 prevOrphans, ok := c.orphanManage.GetPrevOrphans(&blockHash)
186 for _, prevOrphan := range prevOrphans {
187 orphanBlock, ok := c.orphanManage.Get(prevOrphan)
189 log.WithFields(log.Fields{"hash": prevOrphan.String()}).Warning("saveSubBlock fail to get block from orphanManage")
192 if err := c.saveBlock(orphanBlock); err != nil {
193 log.WithFields(log.Fields{"hash": prevOrphan.String(), "height": orphanBlock.Height}).Warning("saveSubBlock fail to save block")
197 if subBestBlock := c.saveSubBlock(orphanBlock); subBestBlock.Height > bestBlock.Height {
198 bestBlock = subBestBlock
204 type processBlockResponse struct {
209 type processBlockMsg struct {
211 reply chan processBlockResponse
214 // ProcessBlock is the entry for chain update
215 func (c *Chain) ProcessBlock(block *types.Block) (bool, error) {
216 reply := make(chan processBlockResponse, 1)
217 c.processBlockCh <- &processBlockMsg{block: block, reply: reply}
219 return response.isOrphan, response.err
222 func (c *Chain) blockProcesser() {
223 for msg := range c.processBlockCh {
224 isOrphan, err := c.processBlock(msg.block)
225 msg.reply <- processBlockResponse{isOrphan: isOrphan, err: err}
229 // ProcessBlock is the entry for handle block insert
230 func (c *Chain) processBlock(block *types.Block) (bool, error) {
231 blockHash := block.Hash()
232 if c.BlockExist(&blockHash) {
233 log.WithFields(log.Fields{"hash": blockHash.String(), "height": block.Height}).Info("block has been processed")
234 return c.orphanManage.BlockExist(&blockHash), nil
237 if parent := c.index.GetNode(&block.PreviousBlockHash); parent == nil {
238 c.orphanManage.Add(block)
242 if err := c.saveBlock(block); err != nil {
246 bestBlock := c.saveSubBlock(block)
247 bestBlockHash := bestBlock.Hash()
248 bestNode := c.index.GetNode(&bestBlockHash)
250 if bestNode.Parent == c.bestNode {
251 log.Debug("append block to the end of mainchain")
252 return false, c.connectBlock(bestBlock)
255 if bestNode.Height > c.bestNode.Height && bestNode.WorkSum.Cmp(c.bestNode.WorkSum) >= 0 {
256 log.Debug("start to reorganize chain")
257 return false, c.reorganizeChain(bestNode)