2015-07-06 17:54:22 -07:00
|
|
|
// Copyright 2014 The go-ethereum Authors
|
2015-07-22 09:48:40 -07:00
|
|
|
// This file is part of the go-ethereum library.
|
2015-07-06 17:54:22 -07:00
|
|
|
//
|
2015-07-23 09:35:11 -07:00
|
|
|
// The go-ethereum library is free software: you can redistribute it and/or modify
|
2015-07-06 17:54:22 -07:00
|
|
|
// it under the terms of the GNU Lesser General Public License as published by
|
|
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
|
|
// (at your option) any later version.
|
|
|
|
//
|
2015-07-22 09:48:40 -07:00
|
|
|
// The go-ethereum library is distributed in the hope that it will be useful,
|
2015-07-06 17:54:22 -07:00
|
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
2015-07-22 09:48:40 -07:00
|
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
2015-07-06 17:54:22 -07:00
|
|
|
// GNU Lesser General Public License for more details.
|
|
|
|
//
|
|
|
|
// You should have received a copy of the GNU Lesser General Public License
|
2015-07-22 09:48:40 -07:00
|
|
|
// along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.
|
2015-07-06 17:54:22 -07:00
|
|
|
|
2015-07-06 20:08:16 -07:00
|
|
|
// Package core implements the Ethereum consensus protocol.
|
2014-12-04 01:28:02 -08:00
|
|
|
package core
|
2014-02-14 14:56:09 -08:00
|
|
|
|
|
|
|
import (
|
2015-07-10 05:29:40 -07:00
|
|
|
"errors"
|
2014-09-24 02:39:17 -07:00
|
|
|
"fmt"
|
2015-03-18 05:36:48 -07:00
|
|
|
"io"
|
2014-07-29 15:31:15 -07:00
|
|
|
"math/big"
|
2015-05-16 16:42:30 -07:00
|
|
|
"runtime"
|
2014-12-18 04:12:54 -08:00
|
|
|
"sync"
|
2015-06-12 07:45:53 -07:00
|
|
|
"sync/atomic"
|
2015-04-04 07:35:23 -07:00
|
|
|
"time"
|
2014-07-29 15:31:15 -07:00
|
|
|
|
2015-03-16 03:27:38 -07:00
|
|
|
"github.com/ethereum/go-ethereum/common"
|
2015-03-23 14:59:19 -07:00
|
|
|
"github.com/ethereum/go-ethereum/core/state"
|
2015-03-16 15:48:18 -07:00
|
|
|
"github.com/ethereum/go-ethereum/core/types"
|
2014-12-03 05:05:19 -08:00
|
|
|
"github.com/ethereum/go-ethereum/event"
|
2014-10-31 04:56:05 -07:00
|
|
|
"github.com/ethereum/go-ethereum/logger"
|
2015-04-04 03:40:11 -07:00
|
|
|
"github.com/ethereum/go-ethereum/logger/glog"
|
2015-06-29 06:11:01 -07:00
|
|
|
"github.com/ethereum/go-ethereum/metrics"
|
2015-05-16 16:42:30 -07:00
|
|
|
"github.com/ethereum/go-ethereum/pow"
|
2015-06-19 07:48:55 -07:00
|
|
|
"github.com/hashicorp/golang-lru"
|
2014-02-14 14:56:09 -08:00
|
|
|
)
|
|
|
|
|
2015-03-03 00:44:41 -08:00
|
|
|
var (
|
|
|
|
chainlogger = logger.NewLogger("CHAIN")
|
|
|
|
jsonlogger = logger.NewJsonLogger()
|
2015-03-13 10:29:42 -07:00
|
|
|
|
2015-06-29 06:11:01 -07:00
|
|
|
blockInsertTimer = metrics.NewTimer("chain/inserts")
|
2015-07-10 05:29:40 -07:00
|
|
|
|
|
|
|
ErrNoGenesis = errors.New("Genesis not found in chain")
|
2015-03-03 00:44:41 -08:00
|
|
|
)
|
2014-06-23 04:54:10 -07:00
|
|
|
|
2015-04-20 11:37:40 -07:00
|
|
|
const (
|
2015-06-19 09:16:09 -07:00
|
|
|
blockCacheLimit = 256
|
2015-06-05 05:07:49 -07:00
|
|
|
maxFutureBlocks = 256
|
|
|
|
maxTimeFutureBlocks = 30
|
2015-06-30 04:46:37 -07:00
|
|
|
checkpointLimit = 200
|
2015-04-20 11:37:40 -07:00
|
|
|
)
|
2015-01-02 03:07:54 -08:00
|
|
|
|
2014-10-20 02:53:11 -07:00
|
|
|
type ChainManager struct {
|
2014-11-18 07:58:22 -08:00
|
|
|
//eth EthManager
|
2015-08-06 10:57:39 -07:00
|
|
|
chainDb common.Database
|
2014-11-18 07:58:22 -08:00
|
|
|
processor types.BlockProcessor
|
2014-12-03 05:05:19 -08:00
|
|
|
eventMux *event.TypeMux
|
2014-11-18 07:58:22 -08:00
|
|
|
genesisBlock *types.Block
|
2014-02-14 14:56:09 -08:00
|
|
|
// Last known total difficulty
|
2015-05-16 15:55:02 -07:00
|
|
|
mu sync.RWMutex
|
|
|
|
chainmu sync.RWMutex
|
|
|
|
tsmu sync.RWMutex
|
2015-04-28 08:48:46 -07:00
|
|
|
|
2015-06-30 04:46:37 -07:00
|
|
|
checkpoint int // checkpoint counts towards the new checkpoint
|
2015-04-24 08:45:51 -07:00
|
|
|
td *big.Int
|
|
|
|
currentBlock *types.Block
|
|
|
|
lastBlockHash common.Hash
|
|
|
|
currentGasLimit *big.Int
|
2014-02-14 14:56:09 -08:00
|
|
|
|
2015-06-30 04:46:37 -07:00
|
|
|
cache *lru.Cache // cache is the LRU caching
|
|
|
|
futureBlocks *lru.Cache // future blocks are blocks added for later processing
|
2015-03-20 07:54:42 -07:00
|
|
|
|
2015-08-01 03:32:28 -07:00
|
|
|
quit chan struct{}
|
|
|
|
running int32 // running must be called automically
|
2015-06-12 07:45:53 -07:00
|
|
|
// procInterrupt must be atomically called
|
|
|
|
procInterrupt int32 // interrupt signaler for block processing
|
|
|
|
wg sync.WaitGroup
|
2015-05-16 16:42:30 -07:00
|
|
|
|
|
|
|
pow pow.PoW
|
2014-12-18 04:12:54 -08:00
|
|
|
}
|
2014-02-14 14:56:09 -08:00
|
|
|
|
2015-08-06 10:57:39 -07:00
|
|
|
func NewChainManager(chainDb common.Database, pow pow.PoW, mux *event.TypeMux) (*ChainManager, error) {
|
2015-06-19 07:48:55 -07:00
|
|
|
cache, _ := lru.New(blockCacheLimit)
|
2015-04-20 11:37:40 -07:00
|
|
|
bc := &ChainManager{
|
2015-08-06 10:57:39 -07:00
|
|
|
chainDb: chainDb,
|
2015-07-10 05:29:40 -07:00
|
|
|
eventMux: mux,
|
|
|
|
quit: make(chan struct{}),
|
|
|
|
cache: cache,
|
|
|
|
pow: pow,
|
2015-04-20 11:37:40 -07:00
|
|
|
}
|
2015-07-10 05:29:40 -07:00
|
|
|
|
|
|
|
bc.genesisBlock = bc.GetBlockByNumber(0)
|
|
|
|
if bc.genesisBlock == nil {
|
2015-08-01 08:34:48 -07:00
|
|
|
reader, err := NewDefaultGenesisReader()
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
2015-08-06 10:57:39 -07:00
|
|
|
bc.genesisBlock, err = WriteGenesisBlock(chainDb, reader)
|
2015-08-01 08:34:48 -07:00
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
glog.V(logger.Info).Infoln("WARNING: Wrote default ethereum genesis block")
|
2015-07-10 05:29:40 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
if err := bc.setLastState(); err != nil {
|
|
|
|
return nil, err
|
2015-06-08 03:12:13 -07:00
|
|
|
}
|
2015-04-20 03:58:17 -07:00
|
|
|
|
|
|
|
// Check the current state of the block hashes and make sure that we do not have any of the bad blocks in our chain
|
2015-05-28 03:06:10 -07:00
|
|
|
for hash, _ := range BadHashes {
|
2015-04-20 03:58:17 -07:00
|
|
|
if block := bc.GetBlock(hash); block != nil {
|
|
|
|
glog.V(logger.Error).Infof("Found bad hash. Reorganising chain to state %x\n", block.ParentHash().Bytes()[:4])
|
|
|
|
block = bc.GetBlock(block.ParentHash())
|
|
|
|
if block == nil {
|
|
|
|
glog.Fatal("Unable to complete. Parent block not found. Corrupted DB?")
|
|
|
|
}
|
|
|
|
bc.SetHead(block)
|
|
|
|
|
|
|
|
glog.V(logger.Error).Infoln("Chain reorg was successfull. Resuming normal operation")
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-03-13 06:37:54 -07:00
|
|
|
// Take ownership of this particular state
|
2015-03-20 07:54:42 -07:00
|
|
|
|
2015-06-29 13:42:13 -07:00
|
|
|
bc.futureBlocks, _ = lru.New(maxFutureBlocks)
|
2015-03-23 04:22:58 -07:00
|
|
|
bc.makeCache()
|
2015-03-20 07:54:42 -07:00
|
|
|
|
2015-03-06 06:50:44 -08:00
|
|
|
go bc.update()
|
2015-02-18 04:14:21 -08:00
|
|
|
|
2015-06-08 03:12:13 -07:00
|
|
|
return bc, nil
|
2015-02-18 04:14:21 -08:00
|
|
|
}
|
|
|
|
|
2015-04-20 03:58:17 -07:00
|
|
|
func (bc *ChainManager) SetHead(head *types.Block) {
|
2015-04-20 03:29:02 -07:00
|
|
|
bc.mu.Lock()
|
|
|
|
defer bc.mu.Unlock()
|
|
|
|
|
2015-06-26 18:08:50 -07:00
|
|
|
for block := bc.currentBlock; block != nil && block.Hash() != head.Hash(); block = bc.GetBlock(block.ParentHash()) {
|
2015-04-20 03:29:02 -07:00
|
|
|
bc.removeBlock(block)
|
|
|
|
}
|
|
|
|
|
2015-06-19 07:48:55 -07:00
|
|
|
bc.cache, _ = lru.New(blockCacheLimit)
|
2015-04-20 03:58:17 -07:00
|
|
|
bc.currentBlock = head
|
2015-04-20 03:29:02 -07:00
|
|
|
bc.makeCache()
|
|
|
|
|
2015-04-20 03:58:17 -07:00
|
|
|
bc.setTotalDifficulty(head.Td)
|
|
|
|
bc.insert(head)
|
2015-04-28 08:13:51 -07:00
|
|
|
bc.setLastState()
|
2015-04-20 03:29:02 -07:00
|
|
|
}
|
|
|
|
|
2014-12-18 04:12:54 -08:00
|
|
|
func (self *ChainManager) Td() *big.Int {
|
|
|
|
self.mu.RLock()
|
|
|
|
defer self.mu.RUnlock()
|
2014-12-10 10:59:12 -08:00
|
|
|
|
2015-06-09 05:23:20 -07:00
|
|
|
return new(big.Int).Set(self.td)
|
2014-12-18 04:12:54 -08:00
|
|
|
}
|
|
|
|
|
2015-04-24 08:45:51 -07:00
|
|
|
func (self *ChainManager) GasLimit() *big.Int {
|
2015-06-09 11:13:21 -07:00
|
|
|
self.mu.RLock()
|
|
|
|
defer self.mu.RUnlock()
|
|
|
|
|
2015-04-22 15:11:11 -07:00
|
|
|
return self.currentBlock.GasLimit()
|
2015-04-24 08:45:51 -07:00
|
|
|
}
|
|
|
|
|
2015-03-16 15:48:18 -07:00
|
|
|
func (self *ChainManager) LastBlockHash() common.Hash {
|
2014-12-18 04:17:24 -08:00
|
|
|
self.mu.RLock()
|
|
|
|
defer self.mu.RUnlock()
|
|
|
|
|
|
|
|
return self.lastBlockHash
|
|
|
|
}
|
|
|
|
|
2014-12-18 04:12:54 -08:00
|
|
|
func (self *ChainManager) CurrentBlock() *types.Block {
|
|
|
|
self.mu.RLock()
|
|
|
|
defer self.mu.RUnlock()
|
|
|
|
|
|
|
|
return self.currentBlock
|
2014-02-14 14:56:09 -08:00
|
|
|
}
|
|
|
|
|
2015-03-16 15:48:18 -07:00
|
|
|
func (self *ChainManager) Status() (td *big.Int, currentBlock common.Hash, genesisBlock common.Hash) {
|
2014-12-18 04:22:59 -08:00
|
|
|
self.mu.RLock()
|
|
|
|
defer self.mu.RUnlock()
|
|
|
|
|
2015-06-09 05:23:20 -07:00
|
|
|
return new(big.Int).Set(self.td), self.currentBlock.Hash(), self.genesisBlock.Hash()
|
2014-12-14 10:20:37 -08:00
|
|
|
}
|
|
|
|
|
2014-11-18 07:58:22 -08:00
|
|
|
func (self *ChainManager) SetProcessor(proc types.BlockProcessor) {
|
|
|
|
self.processor = proc
|
|
|
|
}
|
|
|
|
|
2014-12-10 10:59:12 -08:00
|
|
|
func (self *ChainManager) State() *state.StateDB {
|
2015-08-06 10:57:39 -07:00
|
|
|
return state.New(self.CurrentBlock().Root(), self.chainDb)
|
2014-12-10 10:59:12 -08:00
|
|
|
}
|
|
|
|
|
2015-06-30 04:46:37 -07:00
|
|
|
func (bc *ChainManager) recover() bool {
|
2015-08-06 10:57:39 -07:00
|
|
|
data, _ := bc.chainDb.Get([]byte("checkpoint"))
|
2015-06-30 04:46:37 -07:00
|
|
|
if len(data) != 0 {
|
|
|
|
block := bc.GetBlock(common.BytesToHash(data))
|
|
|
|
if block != nil {
|
2015-08-06 10:57:39 -07:00
|
|
|
err := bc.chainDb.Put([]byte("LastBlock"), block.Hash().Bytes())
|
2015-06-30 04:46:37 -07:00
|
|
|
if err != nil {
|
|
|
|
glog.Fatalln("db write err:", err)
|
|
|
|
}
|
|
|
|
|
|
|
|
bc.currentBlock = block
|
|
|
|
bc.lastBlockHash = block.Hash()
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
|
2015-07-10 05:29:40 -07:00
|
|
|
func (bc *ChainManager) setLastState() error {
|
2015-08-06 10:57:39 -07:00
|
|
|
data, _ := bc.chainDb.Get([]byte("LastBlock"))
|
2014-11-17 03:12:55 -08:00
|
|
|
if len(data) != 0 {
|
2015-03-16 15:48:18 -07:00
|
|
|
block := bc.GetBlock(common.BytesToHash(data))
|
2015-05-26 06:35:51 -07:00
|
|
|
if block != nil {
|
|
|
|
bc.currentBlock = block
|
|
|
|
bc.lastBlockHash = block.Hash()
|
2015-06-15 07:46:45 -07:00
|
|
|
} else {
|
2015-06-30 04:46:37 -07:00
|
|
|
glog.Infof("LastBlock (%x) not found. Recovering...\n", data)
|
|
|
|
if bc.recover() {
|
|
|
|
glog.Infof("Recover successful")
|
|
|
|
} else {
|
|
|
|
glog.Fatalf("Recover failed. Please report")
|
|
|
|
}
|
2015-05-26 06:35:51 -07:00
|
|
|
}
|
2014-11-17 03:12:55 -08:00
|
|
|
} else {
|
|
|
|
bc.Reset()
|
|
|
|
}
|
2015-05-26 06:35:51 -07:00
|
|
|
bc.td = bc.currentBlock.Td
|
2015-04-28 08:13:51 -07:00
|
|
|
bc.currentGasLimit = CalcGasLimit(bc.currentBlock)
|
2014-11-17 03:12:55 -08:00
|
|
|
|
2015-04-04 04:41:58 -07:00
|
|
|
if glog.V(logger.Info) {
|
|
|
|
glog.Infof("Last block (#%v) %x TD=%v\n", bc.currentBlock.Number(), bc.currentBlock.Hash(), bc.td)
|
|
|
|
}
|
2015-07-10 05:29:40 -07:00
|
|
|
|
|
|
|
return nil
|
2014-02-14 14:56:09 -08:00
|
|
|
}
|
|
|
|
|
2015-03-23 04:22:58 -07:00
|
|
|
func (bc *ChainManager) makeCache() {
|
2015-06-19 07:48:55 -07:00
|
|
|
bc.cache, _ = lru.New(blockCacheLimit)
|
2015-03-23 04:22:58 -07:00
|
|
|
// load in last `blockCacheLimit` - 1 blocks. Last block is the current.
|
2015-06-27 04:57:56 -07:00
|
|
|
bc.cache.Add(bc.genesisBlock.Hash(), bc.genesisBlock)
|
2015-06-24 08:05:23 -07:00
|
|
|
for _, block := range bc.GetBlocksFromHash(bc.currentBlock.Hash(), blockCacheLimit) {
|
2015-06-19 07:21:20 -07:00
|
|
|
bc.cache.Add(block.Hash(), block)
|
2015-03-23 04:22:58 -07:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-10-20 02:53:11 -07:00
|
|
|
func (bc *ChainManager) Reset() {
|
2014-12-18 04:12:54 -08:00
|
|
|
bc.mu.Lock()
|
|
|
|
defer bc.mu.Unlock()
|
|
|
|
|
2015-06-26 18:08:50 -07:00
|
|
|
for block := bc.currentBlock; block != nil; block = bc.GetBlock(block.ParentHash()) {
|
2015-03-13 10:29:42 -07:00
|
|
|
bc.removeBlock(block)
|
2014-12-23 05:50:04 -08:00
|
|
|
}
|
|
|
|
|
2015-06-19 07:48:55 -07:00
|
|
|
bc.cache, _ = lru.New(blockCacheLimit)
|
2015-03-23 04:22:58 -07:00
|
|
|
|
2014-10-08 02:59:44 -07:00
|
|
|
// Prepare the genesis block
|
2015-08-06 10:57:39 -07:00
|
|
|
err := WriteBlock(bc.chainDb, bc.genesisBlock)
|
2015-07-10 05:29:40 -07:00
|
|
|
if err != nil {
|
|
|
|
glog.Fatalln("db err:", err)
|
|
|
|
}
|
|
|
|
|
2014-12-05 07:26:39 -08:00
|
|
|
bc.insert(bc.genesisBlock)
|
2014-12-18 04:12:54 -08:00
|
|
|
bc.currentBlock = bc.genesisBlock
|
2015-03-23 04:22:58 -07:00
|
|
|
bc.makeCache()
|
2014-10-08 02:59:44 -07:00
|
|
|
|
2015-03-16 03:27:38 -07:00
|
|
|
bc.setTotalDifficulty(common.Big("0"))
|
2014-10-08 02:59:44 -07:00
|
|
|
}
|
|
|
|
|
2015-03-13 10:29:42 -07:00
|
|
|
func (bc *ChainManager) removeBlock(block *types.Block) {
|
2015-08-06 10:57:39 -07:00
|
|
|
bc.chainDb.Delete(append(blockHashPre, block.Hash().Bytes()...))
|
2015-03-13 10:29:42 -07:00
|
|
|
}
|
|
|
|
|
2015-03-03 09:41:51 -08:00
|
|
|
func (bc *ChainManager) ResetWithGenesisBlock(gb *types.Block) {
|
|
|
|
bc.mu.Lock()
|
|
|
|
defer bc.mu.Unlock()
|
|
|
|
|
2015-06-26 18:08:50 -07:00
|
|
|
for block := bc.currentBlock; block != nil; block = bc.GetBlock(block.ParentHash()) {
|
2015-03-13 10:29:42 -07:00
|
|
|
bc.removeBlock(block)
|
2015-03-03 09:41:51 -08:00
|
|
|
}
|
|
|
|
|
|
|
|
// Prepare the genesis block
|
2015-05-06 14:22:49 -07:00
|
|
|
gb.Td = gb.Difficulty()
|
2015-03-03 09:41:51 -08:00
|
|
|
bc.genesisBlock = gb
|
2015-07-10 05:29:40 -07:00
|
|
|
|
2015-08-06 10:57:39 -07:00
|
|
|
err := WriteBlock(bc.chainDb, bc.genesisBlock)
|
2015-07-10 05:29:40 -07:00
|
|
|
if err != nil {
|
|
|
|
glog.Fatalln("db err:", err)
|
|
|
|
}
|
|
|
|
|
2015-03-03 09:41:51 -08:00
|
|
|
bc.insert(bc.genesisBlock)
|
|
|
|
bc.currentBlock = bc.genesisBlock
|
2015-03-23 04:22:58 -07:00
|
|
|
bc.makeCache()
|
2015-04-29 03:43:24 -07:00
|
|
|
bc.td = gb.Difficulty()
|
2015-03-03 09:41:51 -08:00
|
|
|
}
|
|
|
|
|
2015-03-18 05:36:48 -07:00
|
|
|
// Export writes the active chain to the given writer.
|
|
|
|
func (self *ChainManager) Export(w io.Writer) error {
|
2015-06-06 07:59:56 -07:00
|
|
|
if err := self.ExportN(w, uint64(0), self.currentBlock.NumberU64()); err != nil {
|
2015-06-05 20:01:54 -07:00
|
|
|
return err
|
|
|
|
}
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// ExportN writes a subset of the active chain to the given writer.
|
|
|
|
func (self *ChainManager) ExportN(w io.Writer, first uint64, last uint64) error {
|
2014-12-18 04:12:54 -08:00
|
|
|
self.mu.RLock()
|
|
|
|
defer self.mu.RUnlock()
|
2015-04-04 14:04:19 -07:00
|
|
|
|
2015-06-05 20:01:54 -07:00
|
|
|
if first > last {
|
|
|
|
return fmt.Errorf("export failed: first (%d) is greater than last (%d)", first, last)
|
|
|
|
}
|
|
|
|
|
2015-06-06 06:50:23 -07:00
|
|
|
glog.V(logger.Info).Infof("exporting %d blocks...\n", last-first+1)
|
2015-04-13 01:13:52 -07:00
|
|
|
|
2015-06-05 20:01:54 -07:00
|
|
|
for nr := first; nr <= last; nr++ {
|
2015-04-20 07:02:50 -07:00
|
|
|
block := self.GetBlockByNumber(nr)
|
|
|
|
if block == nil {
|
|
|
|
return fmt.Errorf("export failed on #%d: not found", nr)
|
|
|
|
}
|
|
|
|
|
|
|
|
if err := block.EncodeRLP(w); err != nil {
|
2015-03-18 05:36:48 -07:00
|
|
|
return err
|
|
|
|
}
|
2014-12-17 03:57:35 -08:00
|
|
|
}
|
2015-04-13 01:13:52 -07:00
|
|
|
|
2015-03-18 05:36:48 -07:00
|
|
|
return nil
|
2014-12-17 03:57:35 -08:00
|
|
|
}
|
|
|
|
|
2015-06-09 11:13:21 -07:00
|
|
|
// insert injects a block into the current chain block chain. Note, this function
|
|
|
|
// assumes that the `mu` mutex is held!
|
2014-12-05 07:26:39 -08:00
|
|
|
func (bc *ChainManager) insert(block *types.Block) {
|
2015-08-06 10:57:39 -07:00
|
|
|
err := WriteHead(bc.chainDb, block)
|
2015-06-20 11:31:11 -07:00
|
|
|
if err != nil {
|
|
|
|
glog.Fatal("db write fail:", err)
|
|
|
|
}
|
2015-06-09 05:30:46 -07:00
|
|
|
|
2015-06-30 04:46:37 -07:00
|
|
|
bc.checkpoint++
|
|
|
|
if bc.checkpoint > checkpointLimit {
|
2015-08-06 10:57:39 -07:00
|
|
|
err = bc.chainDb.Put([]byte("checkpoint"), block.Hash().Bytes())
|
2015-06-30 04:46:37 -07:00
|
|
|
if err != nil {
|
|
|
|
glog.Fatal("db write fail:", err)
|
|
|
|
}
|
|
|
|
|
|
|
|
bc.checkpoint = 0
|
|
|
|
}
|
|
|
|
|
2015-04-22 03:46:41 -07:00
|
|
|
bc.currentBlock = block
|
|
|
|
bc.lastBlockHash = block.Hash()
|
2014-12-05 07:26:39 -08:00
|
|
|
}
|
|
|
|
|
2014-11-17 03:12:55 -08:00
|
|
|
// Accessors
|
2014-11-18 07:58:22 -08:00
|
|
|
func (bc *ChainManager) Genesis() *types.Block {
|
2014-02-14 14:56:09 -08:00
|
|
|
return bc.genesisBlock
|
|
|
|
}
|
|
|
|
|
2014-11-17 03:12:55 -08:00
|
|
|
// Block fetching methods
|
2015-03-16 15:48:18 -07:00
|
|
|
func (bc *ChainManager) HasBlock(hash common.Hash) bool {
|
2015-06-19 07:21:20 -07:00
|
|
|
if bc.cache.Contains(hash) {
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
|
2015-08-06 10:57:39 -07:00
|
|
|
data, _ := bc.chainDb.Get(append(blockHashPre, hash[:]...))
|
2014-11-17 03:12:55 -08:00
|
|
|
return len(data) != 0
|
|
|
|
}
|
|
|
|
|
2015-03-16 15:48:18 -07:00
|
|
|
func (self *ChainManager) GetBlockHashesFromHash(hash common.Hash, max uint64) (chain []common.Hash) {
|
2014-08-21 05:47:58 -07:00
|
|
|
block := self.GetBlock(hash)
|
|
|
|
if block == nil {
|
|
|
|
return
|
|
|
|
}
|
|
|
|
// XXX Could be optimised by using a different database which only holds hashes (i.e., linked list)
|
|
|
|
for i := uint64(0); i < max; i++ {
|
2015-04-18 15:08:57 -07:00
|
|
|
block = self.GetBlock(block.ParentHash())
|
2015-01-28 12:12:26 -08:00
|
|
|
if block == nil {
|
|
|
|
break
|
|
|
|
}
|
|
|
|
|
2014-08-21 05:47:58 -07:00
|
|
|
chain = append(chain, block.Hash())
|
2015-04-18 15:08:57 -07:00
|
|
|
if block.Number().Cmp(common.Big0) <= 0 {
|
2014-08-21 05:47:58 -07:00
|
|
|
break
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
2015-03-16 15:48:18 -07:00
|
|
|
func (self *ChainManager) GetBlock(hash common.Hash) *types.Block {
|
2015-06-19 07:21:20 -07:00
|
|
|
if block, ok := self.cache.Get(hash); ok {
|
|
|
|
return block.(*types.Block)
|
|
|
|
}
|
|
|
|
|
2015-08-06 10:57:39 -07:00
|
|
|
block := GetBlockByHash(self.chainDb, hash)
|
2015-07-01 07:15:02 -07:00
|
|
|
if block == nil {
|
2014-12-23 04:48:44 -08:00
|
|
|
return nil
|
|
|
|
}
|
2015-06-19 07:21:20 -07:00
|
|
|
|
|
|
|
// Add the block to the cache
|
2015-07-01 07:15:02 -07:00
|
|
|
self.cache.Add(hash, (*types.Block)(block))
|
2015-06-19 07:21:20 -07:00
|
|
|
|
2015-07-01 07:15:02 -07:00
|
|
|
return (*types.Block)(block)
|
2014-02-14 14:56:09 -08:00
|
|
|
}
|
|
|
|
|
2015-03-13 10:29:42 -07:00
|
|
|
func (self *ChainManager) GetBlockByNumber(num uint64) *types.Block {
|
|
|
|
self.mu.RLock()
|
|
|
|
defer self.mu.RUnlock()
|
|
|
|
|
2015-04-18 12:23:42 -07:00
|
|
|
return self.getBlockByNumber(num)
|
|
|
|
|
|
|
|
}
|
|
|
|
|
2015-06-16 03:41:50 -07:00
|
|
|
// GetBlocksFromHash returns the block corresponding to hash and up to n-1 ancestors.
|
|
|
|
func (self *ChainManager) GetBlocksFromHash(hash common.Hash, n int) (blocks []*types.Block) {
|
|
|
|
for i := 0; i < n; i++ {
|
|
|
|
block := self.GetBlock(hash)
|
|
|
|
if block == nil {
|
|
|
|
break
|
|
|
|
}
|
|
|
|
blocks = append(blocks, block)
|
|
|
|
hash = block.ParentHash()
|
|
|
|
}
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
2015-04-18 12:23:42 -07:00
|
|
|
// non blocking version
|
|
|
|
func (self *ChainManager) getBlockByNumber(num uint64) *types.Block {
|
2015-08-06 10:57:39 -07:00
|
|
|
return GetBlockByNumber(self.chainDb, num)
|
2015-03-13 10:29:42 -07:00
|
|
|
}
|
|
|
|
|
2015-01-09 08:38:35 -08:00
|
|
|
func (self *ChainManager) GetUnclesInChain(block *types.Block, length int) (uncles []*types.Header) {
|
|
|
|
for i := 0; block != nil && i < length; i++ {
|
|
|
|
uncles = append(uncles, block.Uncles()...)
|
|
|
|
block = self.GetBlock(block.ParentHash())
|
|
|
|
}
|
|
|
|
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
2015-06-09 11:02:26 -07:00
|
|
|
// setTotalDifficulty updates the TD of the chain manager. Note, this function
|
|
|
|
// assumes that the `mu` mutex is held!
|
2014-12-18 04:12:54 -08:00
|
|
|
func (bc *ChainManager) setTotalDifficulty(td *big.Int) {
|
2015-06-09 06:26:44 -07:00
|
|
|
bc.td = new(big.Int).Set(td)
|
2014-11-17 03:12:55 -08:00
|
|
|
}
|
2014-09-26 04:32:54 -07:00
|
|
|
|
2014-10-20 02:53:11 -07:00
|
|
|
func (bc *ChainManager) Stop() {
|
2015-08-01 03:32:28 -07:00
|
|
|
if !atomic.CompareAndSwapInt32(&bc.running, 0, 1) {
|
|
|
|
return
|
|
|
|
}
|
2015-03-06 06:50:44 -08:00
|
|
|
close(bc.quit)
|
2015-06-12 07:45:53 -07:00
|
|
|
atomic.StoreInt32(&bc.procInterrupt, 1)
|
2015-04-30 08:50:23 -07:00
|
|
|
|
|
|
|
bc.wg.Wait()
|
|
|
|
|
|
|
|
glog.V(logger.Info).Infoln("Chain manager stopped")
|
2015-03-06 06:50:44 -08:00
|
|
|
}
|
|
|
|
|
|
|
|
type queueEvent struct {
|
|
|
|
queue []interface{}
|
|
|
|
canonicalCount int
|
|
|
|
sideCount int
|
|
|
|
splitCount int
|
2014-02-14 14:56:09 -08:00
|
|
|
}
|
2014-11-04 03:46:33 -08:00
|
|
|
|
2015-04-04 07:35:23 -07:00
|
|
|
func (self *ChainManager) procFutureBlocks() {
|
2015-06-29 13:42:13 -07:00
|
|
|
blocks := make([]*types.Block, self.futureBlocks.Len())
|
|
|
|
for i, hash := range self.futureBlocks.Keys() {
|
|
|
|
block, _ := self.futureBlocks.Get(hash)
|
|
|
|
blocks[i] = block.(*types.Block)
|
|
|
|
}
|
2015-05-29 09:55:42 -07:00
|
|
|
if len(blocks) > 0 {
|
|
|
|
types.BlockBy(types.Number).Sort(blocks)
|
|
|
|
self.InsertChain(blocks)
|
|
|
|
}
|
2015-04-04 07:35:23 -07:00
|
|
|
}
|
|
|
|
|
2015-06-29 03:12:30 -07:00
|
|
|
type writeStatus byte
|
|
|
|
|
|
|
|
const (
|
2015-07-03 02:24:42 -07:00
|
|
|
NonStatTy writeStatus = iota
|
|
|
|
CanonStatTy
|
|
|
|
SplitStatTy
|
|
|
|
SideStatTy
|
2015-06-29 03:12:30 -07:00
|
|
|
)
|
|
|
|
|
2015-06-30 02:14:43 -07:00
|
|
|
// WriteBlock writes the block to the chain (or pending queue)
|
|
|
|
func (self *ChainManager) WriteBlock(block *types.Block, queued bool) (status writeStatus, err error) {
|
2015-06-29 03:12:30 -07:00
|
|
|
self.wg.Add(1)
|
|
|
|
defer self.wg.Done()
|
|
|
|
|
|
|
|
cblock := self.currentBlock
|
|
|
|
// Compare the TD of the last known block in the canonical chain to make sure it's greater.
|
|
|
|
// At this point it's possible that a different chain (fork) becomes the new canonical chain.
|
|
|
|
if block.Td.Cmp(self.Td()) > 0 {
|
|
|
|
// chain fork
|
|
|
|
if block.ParentHash() != cblock.Hash() {
|
|
|
|
// during split we merge two different chains and create the new canonical chain
|
|
|
|
err := self.merge(cblock, block)
|
|
|
|
if err != nil {
|
2015-07-03 02:24:42 -07:00
|
|
|
return NonStatTy, err
|
2015-06-29 03:12:30 -07:00
|
|
|
}
|
|
|
|
|
2015-07-03 02:24:42 -07:00
|
|
|
status = SplitStatTy
|
2015-06-29 03:12:30 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
self.mu.Lock()
|
|
|
|
self.setTotalDifficulty(block.Td)
|
|
|
|
self.insert(block)
|
|
|
|
self.mu.Unlock()
|
|
|
|
|
2015-07-03 02:24:42 -07:00
|
|
|
status = CanonStatTy
|
2015-06-29 03:12:30 -07:00
|
|
|
} else {
|
2015-07-03 02:24:42 -07:00
|
|
|
status = SideStatTy
|
2015-06-29 03:12:30 -07:00
|
|
|
}
|
|
|
|
|
2015-08-06 10:57:39 -07:00
|
|
|
err = WriteBlock(self.chainDb, block)
|
2015-07-10 05:29:40 -07:00
|
|
|
if err != nil {
|
|
|
|
glog.Fatalln("db err:", err)
|
|
|
|
}
|
2015-06-29 03:12:30 -07:00
|
|
|
// Delete from future blocks
|
2015-06-29 13:42:13 -07:00
|
|
|
self.futureBlocks.Remove(block.Hash())
|
2015-06-29 03:12:30 -07:00
|
|
|
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
2015-04-29 05:00:24 -07:00
|
|
|
// InsertChain will attempt to insert the given chain in to the canonical chain or, otherwise, create a fork. It an error is returned
|
|
|
|
// it will return the index number of the failing block as well an error describing what went wrong (for possible errors see core/errors.go).
|
|
|
|
func (self *ChainManager) InsertChain(chain types.Blocks) (int, error) {
|
2015-04-30 08:50:23 -07:00
|
|
|
self.wg.Add(1)
|
|
|
|
defer self.wg.Done()
|
|
|
|
|
2015-05-16 15:55:02 -07:00
|
|
|
self.chainmu.Lock()
|
|
|
|
defer self.chainmu.Unlock()
|
|
|
|
|
2015-05-29 09:07:23 -07:00
|
|
|
// A queued approach to delivering events. This is generally
|
|
|
|
// faster than direct delivery and requires much less mutex
|
|
|
|
// acquiring.
|
2015-04-04 14:04:19 -07:00
|
|
|
var (
|
|
|
|
queue = make([]interface{}, len(chain))
|
|
|
|
queueEvent = queueEvent{queue: queue}
|
2015-05-01 07:00:30 -07:00
|
|
|
stats struct{ queued, processed, ignored int }
|
2015-04-05 08:59:38 -07:00
|
|
|
tstart = time.Now()
|
2015-05-29 09:07:23 -07:00
|
|
|
|
|
|
|
nonceDone = make(chan nonceResult, len(chain))
|
|
|
|
nonceQuit = make(chan struct{})
|
|
|
|
nonceChecked = make([]bool, len(chain))
|
2015-04-04 14:04:19 -07:00
|
|
|
)
|
2015-05-16 16:42:30 -07:00
|
|
|
|
2015-05-29 09:07:23 -07:00
|
|
|
// Start the parallel nonce verifier.
|
|
|
|
go verifyNonces(self.pow, chain, nonceQuit, nonceDone)
|
|
|
|
defer close(nonceQuit)
|
2015-06-19 07:21:20 -07:00
|
|
|
|
2015-06-10 03:57:58 -07:00
|
|
|
txcount := 0
|
2015-03-06 06:50:44 -08:00
|
|
|
for i, block := range chain {
|
2015-06-12 07:45:53 -07:00
|
|
|
if atomic.LoadInt32(&self.procInterrupt) == 1 {
|
2015-06-12 04:36:38 -07:00
|
|
|
glog.V(logger.Debug).Infoln("Premature abort during chain processing")
|
2015-06-12 07:45:53 -07:00
|
|
|
break
|
|
|
|
}
|
2015-05-16 16:42:30 -07:00
|
|
|
|
2015-06-12 07:45:53 -07:00
|
|
|
bstart := time.Now()
|
|
|
|
// Wait for block i's nonce to be verified before processing
|
|
|
|
// its state transition.
|
|
|
|
for !nonceChecked[i] {
|
|
|
|
r := <-nonceDone
|
|
|
|
nonceChecked[r.i] = true
|
|
|
|
if !r.valid {
|
|
|
|
block := chain[r.i]
|
|
|
|
return r.i, &BlockNonceErr{Hash: block.Hash(), Number: block.Number(), Nonce: block.Nonce()}
|
2014-12-02 02:37:33 -08:00
|
|
|
}
|
2015-06-12 07:45:53 -07:00
|
|
|
}
|
2014-11-04 03:46:33 -08:00
|
|
|
|
2015-06-12 07:45:53 -07:00
|
|
|
if BadHashes[block.Hash()] {
|
|
|
|
err := fmt.Errorf("Found known bad hash in chain %x", block.Hash())
|
|
|
|
blockErr(block, err)
|
|
|
|
return i, err
|
|
|
|
}
|
2015-06-05 05:07:49 -07:00
|
|
|
|
2015-06-12 07:45:53 -07:00
|
|
|
// Setting block.Td regardless of error (known for example) prevents errors down the line
|
|
|
|
// in the protocol handler
|
|
|
|
block.Td = new(big.Int).Set(CalcTD(block, self.GetBlock(block.ParentHash())))
|
|
|
|
|
|
|
|
// Call in to the block processor and check for errors. It's likely that if one block fails
|
|
|
|
// all others will fail too (unless a known block is returned).
|
2015-07-03 02:24:42 -07:00
|
|
|
logs, receipts, err := self.processor.Process(block)
|
2015-06-12 07:45:53 -07:00
|
|
|
if err != nil {
|
|
|
|
if IsKnownBlockErr(err) {
|
|
|
|
stats.ignored++
|
|
|
|
continue
|
|
|
|
}
|
2015-04-04 07:35:23 -07:00
|
|
|
|
2015-06-12 07:45:53 -07:00
|
|
|
if err == BlockFutureErr {
|
|
|
|
// Allow up to MaxFuture second in the future blocks. If this limit
|
|
|
|
// is exceeded the chain is discarded and processed at a later time
|
|
|
|
// if given.
|
2015-07-08 04:21:06 -07:00
|
|
|
if max := uint64(time.Now().Unix()) + maxTimeFutureBlocks; block.Time() > max {
|
2015-06-12 07:45:53 -07:00
|
|
|
return i, fmt.Errorf("%v: BlockFutureErr, %v > %v", BlockFutureErr, block.Time(), max)
|
2015-06-12 04:36:38 -07:00
|
|
|
}
|
2015-03-23 08:14:33 -07:00
|
|
|
|
2015-06-29 13:42:13 -07:00
|
|
|
self.futureBlocks.Add(block.Hash(), block)
|
2015-06-12 07:45:53 -07:00
|
|
|
stats.queued++
|
|
|
|
continue
|
|
|
|
}
|
2015-04-04 14:04:19 -07:00
|
|
|
|
2015-06-29 13:42:13 -07:00
|
|
|
if IsParentErr(err) && self.futureBlocks.Contains(block.ParentHash()) {
|
|
|
|
self.futureBlocks.Add(block.Hash(), block)
|
2015-06-12 07:45:53 -07:00
|
|
|
stats.queued++
|
|
|
|
continue
|
2015-06-12 04:36:38 -07:00
|
|
|
}
|
2015-04-20 03:01:20 -07:00
|
|
|
|
2015-06-12 07:45:53 -07:00
|
|
|
blockErr(block, err)
|
|
|
|
|
2015-07-04 08:45:18 -07:00
|
|
|
go ReportBlock(block, err)
|
|
|
|
|
2015-06-12 07:45:53 -07:00
|
|
|
return i, err
|
|
|
|
}
|
|
|
|
|
|
|
|
txcount += len(block.Transactions())
|
|
|
|
|
2015-06-29 03:12:30 -07:00
|
|
|
// write the block to the chain and get the status
|
2015-06-30 02:14:43 -07:00
|
|
|
status, err := self.WriteBlock(block, true)
|
2015-06-29 03:12:30 -07:00
|
|
|
if err != nil {
|
|
|
|
return i, err
|
|
|
|
}
|
|
|
|
switch status {
|
2015-07-03 02:24:42 -07:00
|
|
|
case CanonStatTy:
|
2015-06-12 07:45:53 -07:00
|
|
|
if glog.V(logger.Debug) {
|
2015-07-17 14:09:36 -07:00
|
|
|
glog.Infof("[%v] inserted block #%d (%d TXs %v G %d UNCs) (%x...). Took %v\n", time.Now().UnixNano(), block.Number(), len(block.Transactions()), block.GasUsed(), len(block.Uncles()), block.Hash().Bytes()[0:4], time.Since(bstart))
|
2015-06-12 07:45:53 -07:00
|
|
|
}
|
2015-06-29 03:12:30 -07:00
|
|
|
queue[i] = ChainEvent{block, block.Hash(), logs}
|
|
|
|
queueEvent.canonicalCount++
|
2015-07-03 02:24:42 -07:00
|
|
|
|
|
|
|
// This puts transactions in a extra db for rpc
|
2015-08-06 10:57:39 -07:00
|
|
|
PutTransactions(self.chainDb, block, block.Transactions())
|
2015-07-03 02:24:42 -07:00
|
|
|
// store the receipts
|
2015-08-06 10:57:39 -07:00
|
|
|
PutReceipts(self.chainDb, receipts)
|
2015-07-03 02:24:42 -07:00
|
|
|
case SideStatTy:
|
2015-06-12 07:45:53 -07:00
|
|
|
if glog.V(logger.Detail) {
|
|
|
|
glog.Infof("inserted forked block #%d (TD=%v) (%d TXs %d UNCs) (%x...). Took %v\n", block.Number(), block.Difficulty(), len(block.Transactions()), len(block.Uncles()), block.Hash().Bytes()[0:4], time.Since(bstart))
|
2015-05-16 15:55:02 -07:00
|
|
|
}
|
2015-06-12 07:45:53 -07:00
|
|
|
queue[i] = ChainSideEvent{block, logs}
|
|
|
|
queueEvent.sideCount++
|
2015-07-03 02:24:42 -07:00
|
|
|
case SplitStatTy:
|
2015-06-29 03:12:30 -07:00
|
|
|
queue[i] = ChainSplitEvent{block, logs}
|
|
|
|
queueEvent.splitCount++
|
2015-06-12 04:36:38 -07:00
|
|
|
}
|
2015-08-06 10:57:39 -07:00
|
|
|
PutBlockReceipts(self.chainDb, block, receipts)
|
2015-07-14 09:18:09 -07:00
|
|
|
|
2015-06-12 07:45:53 -07:00
|
|
|
stats.processed++
|
2014-11-04 03:46:33 -08:00
|
|
|
}
|
|
|
|
|
2015-05-03 05:09:50 -07:00
|
|
|
if (stats.queued > 0 || stats.processed > 0 || stats.ignored > 0) && bool(glog.V(logger.Info)) {
|
2015-04-05 08:59:38 -07:00
|
|
|
tend := time.Since(tstart)
|
2015-04-04 03:40:11 -07:00
|
|
|
start, end := chain[0], chain[len(chain)-1]
|
2015-06-10 03:57:58 -07:00
|
|
|
glog.Infof("imported %d block(s) (%d queued %d ignored) including %d txs in %v. #%v [%x / %x]\n", stats.processed, stats.queued, stats.ignored, txcount, tend, end.Number(), start.Hash().Bytes()[:4], end.Hash().Bytes()[:4])
|
2015-04-04 03:40:11 -07:00
|
|
|
}
|
|
|
|
|
2015-03-06 06:50:44 -08:00
|
|
|
go self.eventMux.Post(queueEvent)
|
|
|
|
|
2015-04-29 05:00:24 -07:00
|
|
|
return 0, nil
|
2014-11-17 03:12:55 -08:00
|
|
|
}
|
2015-01-02 03:07:54 -08:00
|
|
|
|
2015-04-29 03:43:24 -07:00
|
|
|
// diff takes two blocks, an old chain and a new chain and will reconstruct the blocks and inserts them
|
2015-04-13 15:18:38 -07:00
|
|
|
// to be part of the new canonical chain.
|
2015-05-28 06:35:50 -07:00
|
|
|
func (self *ChainManager) diff(oldBlock, newBlock *types.Block) (types.Blocks, error) {
|
2015-05-13 13:27:18 -07:00
|
|
|
var (
|
|
|
|
newChain types.Blocks
|
|
|
|
commonBlock *types.Block
|
|
|
|
oldStart = oldBlock
|
|
|
|
newStart = newBlock
|
|
|
|
)
|
2015-05-15 06:30:34 -07:00
|
|
|
|
|
|
|
// first reduce whoever is higher bound
|
|
|
|
if oldBlock.NumberU64() > newBlock.NumberU64() {
|
|
|
|
// reduce old chain
|
2015-05-28 09:18:23 -07:00
|
|
|
for oldBlock = oldBlock; oldBlock != nil && oldBlock.NumberU64() != newBlock.NumberU64(); oldBlock = self.GetBlock(oldBlock.ParentHash()) {
|
2015-05-15 06:30:34 -07:00
|
|
|
}
|
|
|
|
} else {
|
|
|
|
// reduce new chain and append new chain blocks for inserting later on
|
2015-05-28 09:18:23 -07:00
|
|
|
for newBlock = newBlock; newBlock != nil && newBlock.NumberU64() != oldBlock.NumberU64(); newBlock = self.GetBlock(newBlock.ParentHash()) {
|
2015-05-15 06:30:34 -07:00
|
|
|
newChain = append(newChain, newBlock)
|
|
|
|
}
|
2015-04-29 03:43:24 -07:00
|
|
|
}
|
2015-05-28 09:18:23 -07:00
|
|
|
if oldBlock == nil {
|
|
|
|
return nil, fmt.Errorf("Invalid old chain")
|
|
|
|
}
|
|
|
|
if newBlock == nil {
|
|
|
|
return nil, fmt.Errorf("Invalid new chain")
|
|
|
|
}
|
2015-04-29 03:43:24 -07:00
|
|
|
|
2015-05-13 13:27:18 -07:00
|
|
|
numSplit := newBlock.Number()
|
2015-04-13 15:18:38 -07:00
|
|
|
for {
|
|
|
|
if oldBlock.Hash() == newBlock.Hash() {
|
2015-05-13 13:27:18 -07:00
|
|
|
commonBlock = oldBlock
|
2015-04-13 15:18:38 -07:00
|
|
|
break
|
|
|
|
}
|
|
|
|
newChain = append(newChain, newBlock)
|
2015-04-29 03:43:24 -07:00
|
|
|
|
|
|
|
oldBlock, newBlock = self.GetBlock(oldBlock.ParentHash()), self.GetBlock(newBlock.ParentHash())
|
2015-05-28 06:35:50 -07:00
|
|
|
if oldBlock == nil {
|
|
|
|
return nil, fmt.Errorf("Invalid old chain")
|
|
|
|
}
|
|
|
|
if newBlock == nil {
|
|
|
|
return nil, fmt.Errorf("Invalid new chain")
|
|
|
|
}
|
2015-04-13 15:18:38 -07:00
|
|
|
}
|
|
|
|
|
2015-06-29 03:12:30 -07:00
|
|
|
if glog.V(logger.Debug) {
|
2015-05-13 13:27:18 -07:00
|
|
|
commonHash := commonBlock.Hash()
|
2015-06-29 03:12:30 -07:00
|
|
|
glog.Infof("Chain split detected @ %x. Reorganising chain from #%v %x to %x", commonHash[:4], numSplit, oldStart.Hash().Bytes()[:4], newStart.Hash().Bytes()[:4])
|
2015-05-13 13:27:18 -07:00
|
|
|
}
|
|
|
|
|
2015-05-28 06:35:50 -07:00
|
|
|
return newChain, nil
|
2015-04-29 03:43:24 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
// merge merges two different chain to the new canonical chain
|
2015-05-28 06:35:50 -07:00
|
|
|
func (self *ChainManager) merge(oldBlock, newBlock *types.Block) error {
|
|
|
|
newChain, err := self.diff(oldBlock, newBlock)
|
|
|
|
if err != nil {
|
|
|
|
return fmt.Errorf("chain reorg failed: %v", err)
|
|
|
|
}
|
2015-04-29 03:43:24 -07:00
|
|
|
|
2015-05-15 06:30:34 -07:00
|
|
|
// insert blocks. Order does not matter. Last block will be written in ImportChain itself which creates the new head properly
|
2015-06-09 11:02:26 -07:00
|
|
|
self.mu.Lock()
|
2015-04-13 15:18:38 -07:00
|
|
|
for _, block := range newChain {
|
2015-07-14 09:18:09 -07:00
|
|
|
// insert the block in the canonical way, re-writing history
|
2015-04-13 15:18:38 -07:00
|
|
|
self.insert(block)
|
2015-07-14 09:18:09 -07:00
|
|
|
// write canonical receipts and transactions
|
2015-08-06 10:57:39 -07:00
|
|
|
PutTransactions(self.chainDb, block, block.Transactions())
|
|
|
|
PutReceipts(self.chainDb, GetBlockReceipts(self.chainDb, block.Hash()))
|
2015-07-14 09:18:09 -07:00
|
|
|
|
2015-04-13 15:18:38 -07:00
|
|
|
}
|
2015-06-09 11:02:26 -07:00
|
|
|
self.mu.Unlock()
|
2015-05-28 06:35:50 -07:00
|
|
|
|
|
|
|
return nil
|
2015-04-13 15:18:38 -07:00
|
|
|
}
|
|
|
|
|
2015-03-06 06:50:44 -08:00
|
|
|
func (self *ChainManager) update() {
|
|
|
|
events := self.eventMux.Subscribe(queueEvent{})
|
2015-05-01 07:30:02 -07:00
|
|
|
futureTimer := time.Tick(5 * time.Second)
|
2015-03-06 06:50:44 -08:00
|
|
|
out:
|
|
|
|
for {
|
|
|
|
select {
|
|
|
|
case ev := <-events.Chan():
|
|
|
|
switch ev := ev.(type) {
|
|
|
|
case queueEvent:
|
2015-06-03 13:22:20 -07:00
|
|
|
for _, event := range ev.queue {
|
2015-03-06 06:50:44 -08:00
|
|
|
switch event := event.(type) {
|
|
|
|
case ChainEvent:
|
|
|
|
// We need some control over the mining operation. Acquiring locks and waiting for the miner to create new block takes too long
|
|
|
|
// and in most cases isn't even necessary.
|
2015-05-14 15:41:27 -07:00
|
|
|
if self.lastBlockHash == event.Hash {
|
2015-04-26 02:19:40 -07:00
|
|
|
self.currentGasLimit = CalcGasLimit(event.Block)
|
2015-03-06 06:50:44 -08:00
|
|
|
self.eventMux.Post(ChainHeadEvent{event.Block})
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
self.eventMux.Post(event)
|
|
|
|
}
|
|
|
|
}
|
2015-05-01 07:30:02 -07:00
|
|
|
case <-futureTimer:
|
2015-04-04 07:35:23 -07:00
|
|
|
self.procFutureBlocks()
|
2015-03-06 06:50:44 -08:00
|
|
|
case <-self.quit:
|
|
|
|
break out
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2015-05-16 16:42:30 -07:00
|
|
|
|
|
|
|
func blockErr(block *types.Block, err error) {
|
|
|
|
h := block.Header()
|
2015-05-26 10:50:42 -07:00
|
|
|
glog.V(logger.Error).Infof("Bad block #%v (%x)\n", h.Number, h.Hash().Bytes())
|
2015-05-16 16:42:30 -07:00
|
|
|
glog.V(logger.Error).Infoln(err)
|
2015-05-29 09:07:23 -07:00
|
|
|
glog.V(logger.Debug).Infoln(verifyNonces)
|
|
|
|
}
|
|
|
|
|
|
|
|
type nonceResult struct {
|
|
|
|
i int
|
|
|
|
valid bool
|
2015-05-16 16:42:30 -07:00
|
|
|
}
|
|
|
|
|
2015-05-29 09:07:23 -07:00
|
|
|
// block verifies nonces of the given blocks in parallel and returns
|
2015-05-16 16:42:30 -07:00
|
|
|
// an error if one of the blocks nonce verifications failed.
|
2015-05-29 09:07:23 -07:00
|
|
|
func verifyNonces(pow pow.PoW, blocks []*types.Block, quit <-chan struct{}, done chan<- nonceResult) {
|
2015-05-16 16:42:30 -07:00
|
|
|
// Spawn a few workers. They listen for blocks on the in channel
|
|
|
|
// and send results on done. The workers will exit in the
|
|
|
|
// background when in is closed.
|
|
|
|
var (
|
2015-05-29 09:07:23 -07:00
|
|
|
in = make(chan int)
|
|
|
|
nworkers = runtime.GOMAXPROCS(0)
|
2015-05-16 16:42:30 -07:00
|
|
|
)
|
|
|
|
defer close(in)
|
2015-05-29 09:07:23 -07:00
|
|
|
if len(blocks) < nworkers {
|
|
|
|
nworkers = len(blocks)
|
2015-05-16 16:42:30 -07:00
|
|
|
}
|
2015-05-29 09:07:23 -07:00
|
|
|
for i := 0; i < nworkers; i++ {
|
|
|
|
go func() {
|
|
|
|
for i := range in {
|
|
|
|
done <- nonceResult{i: i, valid: pow.Verify(blocks[i])}
|
2015-05-16 16:42:30 -07:00
|
|
|
}
|
2015-05-29 09:07:23 -07:00
|
|
|
}()
|
2015-05-16 16:42:30 -07:00
|
|
|
}
|
2015-05-29 09:07:23 -07:00
|
|
|
// Feed block indices to the workers.
|
|
|
|
for i := range blocks {
|
|
|
|
select {
|
|
|
|
case in <- i:
|
|
|
|
continue
|
|
|
|
case <-quit:
|
|
|
|
return
|
2015-05-16 16:42:30 -07:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|