6 log "github.com/sirupsen/logrus"
8 "github.com/bytom/bytom/errors"
9 "github.com/bytom/bytom/event"
10 "github.com/bytom/bytom/protocol/bc"
11 "github.com/bytom/bytom/protocol/bc/types"
12 "github.com/bytom/bytom/protocol/state"
13 "github.com/bytom/bytom/protocol/validation"
17 // ErrBadBlock is returned when a block is invalid.
18 ErrBadBlock = errors.New("invalid block")
19 // ErrBadStateRoot is returned when the computed assets merkle root
20 // disagrees with the one declared in a block header.
21 ErrBadStateRoot = errors.New("invalid state merkle root")
24 // BlockExist check is a block in chain or orphan
25 func (c *Chain) BlockExist(hash *bc.Hash) bool {
26 if _, err := c.store.GetBlockHeader(hash); err == nil {
30 return c.orphanManage.BlockExist(hash)
33 // GetBlockByHash return a block by given hash
34 func (c *Chain) GetBlockByHash(hash *bc.Hash) (*types.Block, error) {
35 return c.store.GetBlock(hash)
38 // GetBlockByHeight return a block header by given height
39 func (c *Chain) GetBlockByHeight(height uint64) (*types.Block, error) {
40 hash, err := c.store.GetMainChainHash(height)
42 return nil, errors.Wrap(err, "can't find block in given height")
45 return c.store.GetBlock(hash)
48 // GetHeaderByHash return a block header by given hash
49 func (c *Chain) GetHeaderByHash(hash *bc.Hash) (*types.BlockHeader, error) {
50 return c.store.GetBlockHeader(hash)
53 // GetHeaderByHeight return a block header by given height
54 func (c *Chain) GetHeaderByHeight(height uint64) (*types.BlockHeader, error) {
55 hash, err := c.store.GetMainChainHash(height)
57 return nil, errors.Wrap(err, "can't find block header in given height")
60 return c.store.GetBlockHeader(hash)
63 func (c *Chain) calcReorganizeChain(beginAttach *types.BlockHeader, beginDetach *types.BlockHeader) ([]*types.BlockHeader, []*types.BlockHeader, error) {
65 var attachBlockHeaders []*types.BlockHeader
66 var detachBlockHeaders []*types.BlockHeader
68 for attachBlockHeader, detachBlockHeader := beginAttach, beginDetach; detachBlockHeader.Hash() != attachBlockHeader.Hash(); {
69 var attachRollback, detachRollBack bool
70 if attachRollback = attachBlockHeader.Height >= detachBlockHeader.Height; attachRollback {
71 attachBlockHeaders = append([]*types.BlockHeader{attachBlockHeader}, attachBlockHeaders...)
74 if detachRollBack = attachBlockHeader.Height <= detachBlockHeader.Height; detachRollBack {
75 detachBlockHeaders = append(detachBlockHeaders, detachBlockHeader)
79 attachBlockHeader, err = c.store.GetBlockHeader(&attachBlockHeader.PreviousBlockHash)
86 detachBlockHeader, err = c.store.GetBlockHeader(&detachBlockHeader.PreviousBlockHash)
92 return attachBlockHeaders, detachBlockHeaders, nil
95 func (c *Chain) connectBlock(block *types.Block) (err error) {
96 bcBlock := types.MapBlock(block)
97 utxoView := state.NewUtxoViewpoint()
98 if err := c.store.GetTransactionsUtxo(utxoView, bcBlock.Transactions); err != nil {
101 if err := utxoView.ApplyBlock(bcBlock); err != nil {
105 reply, err := c.casper.ApplyBlock(block)
110 if reply.verification != nil {
111 if err := c.broadcastVerification(reply.verification); err != nil {
116 contractView := state.NewContractViewpoint()
117 contractView.ApplyBlock(block)
119 if err := c.setState(&block.BlockHeader, []*types.BlockHeader{&block.BlockHeader}, utxoView, contractView); err != nil {
123 for _, tx := range block.Transactions {
124 c.txPool.RemoveTransaction(&tx.Tx.ID)
129 func (c *Chain) reorganizeChain(blockHeader *types.BlockHeader) error {
130 attachNodes, detachNodes, err := c.calcReorganizeChain(blockHeader, c.bestBlockHeader)
135 utxoView := state.NewUtxoViewpoint()
136 contractView := state.NewContractViewpoint()
138 txsToRestore := map[bc.Hash]*types.Tx{}
139 for _, detachNode := range detachNodes {
140 hash := detachNode.Hash()
141 b, err := c.store.GetBlock(&hash)
146 detachBlock := types.MapBlock(b)
147 if err := c.store.GetTransactionsUtxo(utxoView, detachBlock.Transactions); err != nil {
151 if err := utxoView.DetachBlock(detachBlock); err != nil {
155 contractView.DetachBlock(b)
156 for _, tx := range b.Transactions {
157 txsToRestore[tx.ID] = tx
159 log.WithFields(log.Fields{"module": logModule, "height": detachNode.Height, "hash": hash.String()}).Debug("detach from mainchain")
162 txsToRemove := map[bc.Hash]*types.Tx{}
163 for _, attachNode := range attachNodes {
164 hash := attachNode.Hash()
165 b, err := c.store.GetBlock(&hash)
170 attachBlock := types.MapBlock(b)
171 if err := c.store.GetTransactionsUtxo(utxoView, attachBlock.Transactions); err != nil {
175 if err := utxoView.ApplyBlock(attachBlock); err != nil {
179 contractView.ApplyBlock(b)
180 for _, tx := range b.Transactions {
181 if _, ok := txsToRestore[tx.ID]; !ok {
182 txsToRemove[tx.ID] = tx
184 delete(txsToRestore, tx.ID)
188 log.WithFields(log.Fields{"module": logModule, "height": attachNode.Height, "hash": hash.String()}).Debug("attach from mainchain")
191 if err := c.setState(blockHeader, []*types.BlockHeader{blockHeader}, utxoView, contractView); err != nil {
195 for txHash := range txsToRemove {
196 c.txPool.RemoveTransaction(&txHash)
199 for _, tx := range txsToRestore {
200 // the number of restored Tx should be very small or most of time ZERO
201 // Error returned from validation is ignored, tx could still be lost if validation fails.
202 // TODO: adjust tx timestamp so that it won't starve in pool.
203 if _, err := c.ValidateTx(tx); err != nil {
204 log.WithFields(log.Fields{"module": logModule, "tx_id": tx.Tx.ID.String(), "error": err}).Info("restore tx fail")
208 if len(txsToRestore) > 0 {
209 log.WithFields(log.Fields{"module": logModule, "num": len(txsToRestore)}).Debug("restore txs back to pool")
215 func (c *Chain) broadcastVerification(v *Verification) error {
216 pubKey, err := hex.DecodeString(v.PubKey)
221 return c.eventDispatcher.Post(event.BlockVerificationEvent{
222 SourceHeight: v.SourceHeight,
223 SourceHash: v.SourceHash,
224 TargetHeight: v.TargetHeight,
225 TargetHash: v.TargetHash,
227 Signature: v.Signature,
231 // SaveBlock will validate and save block into storage
232 func (c *Chain) saveBlock(block *types.Block) error {
233 bcBlock := types.MapBlock(block)
234 parent, err := c.store.GetBlockHeader(&block.PreviousBlockHash)
239 checkpoint, err := c.PrevCheckpointByPrevHash(&block.PreviousBlockHash)
244 if err := validation.ValidateBlock(bcBlock, parent, checkpoint, c.ProgramConverter); err != nil {
245 return errors.Sub(ErrBadBlock, err)
248 if err := c.store.SaveBlock(block); err != nil {
252 c.orphanManage.Delete(&bcBlock.ID)
256 func (c *Chain) saveSubBlock(block *types.Block) *types.Block {
257 blockHash := block.Hash()
258 prevOrphans, ok := c.orphanManage.GetPrevOrphans(&blockHash)
264 for _, prevOrphan := range prevOrphans {
265 orphanBlock, ok := c.orphanManage.Get(prevOrphan)
267 log.WithFields(log.Fields{"module": logModule, "hash": prevOrphan.String()}).Warning("saveSubBlock fail to get block from orphanManage")
270 if err := c.saveBlock(orphanBlock); err != nil {
271 log.WithFields(log.Fields{"module": logModule, "hash": prevOrphan.String(), "height": orphanBlock.Height}).Warning("saveSubBlock fail to save block")
275 if subBestBlock := c.saveSubBlock(orphanBlock); subBestBlock.Height > bestBlock.Height {
276 bestBlock = subBestBlock
282 type processBlockResponse struct {
287 type processBlockMsg struct {
289 reply chan processBlockResponse
292 // ProcessBlock is the entry for chain update
293 func (c *Chain) ProcessBlock(block *types.Block) (bool, error) {
294 reply := make(chan processBlockResponse, 1)
295 c.processBlockCh <- &processBlockMsg{block: block, reply: reply}
297 return response.isOrphan, response.err
300 type rollbackMsg struct {
305 func (c *Chain) blockProcessor() {
308 case msg := <-c.processBlockCh:
309 isOrphan, err := c.processBlock(msg.block)
310 msg.reply <- processBlockResponse{isOrphan: isOrphan, err: err}
311 case msg := <-c.processRollbackCh:
312 err := c.rollback(msg.bestHash)
318 // ProcessBlock is the entry for handle block insert
319 func (c *Chain) processBlock(block *types.Block) (bool, error) {
320 blockHash := block.Hash()
321 if c.BlockExist(&blockHash) {
322 log.WithFields(log.Fields{"module": logModule, "hash": blockHash.String(), "height": block.Height}).Info("block has been processed")
323 return c.orphanManage.BlockExist(&blockHash), nil
326 if _, err := c.store.GetBlockHeader(&block.PreviousBlockHash); err != nil {
327 c.orphanManage.Add(block)
331 if err := c.saveBlock(block); err != nil {
335 bestBlock := c.saveSubBlock(block)
336 bestBlockHeader := &bestBlock.BlockHeader
338 if bestBlockHeader.PreviousBlockHash == c.bestBlockHeader.Hash() {
339 log.WithFields(log.Fields{"module": logModule}).Debug("append block to the end of mainchain")
340 return false, c.connectBlock(bestBlock)
343 return false, c.applyForkChainToCasper(bestBlockHeader)
346 func (c *Chain) applyForkChainToCasper(beginAttach *types.BlockHeader) error {
347 attachNodes, _, err := c.calcReorganizeChain(beginAttach, c.bestBlockHeader)
352 var reply *applyBlockReply
353 for _, node := range attachNodes {
355 block, err := c.store.GetBlock(&hash)
360 reply, err = c.casper.ApplyBlock(block)
365 log.WithFields(log.Fields{"module": logModule, "height": node.Height, "hash": hash.String()}).Info("apply fork node")
367 if reply.verification != nil {
368 if err := c.broadcastVerification(reply.verification); err != nil {
374 if reply.bestHash != c.bestBlockHeader.Hash() {
375 return c.rollback(reply.bestHash)
381 func (c *Chain) rollback(bestHash bc.Hash) error {
382 if c.bestBlockHeader.Hash() == bestHash {
386 blockHeader, err := c.GetHeaderByHash(&bestHash)
391 log.WithFields(log.Fields{"module": logModule, "bestHash": bestHash.String()}).Info("start to reorganize chain")
392 return c.reorganizeChain(blockHeader)