plugeth/core/chain_manager.go

798 lines
21 KiB
Go
Raw Normal View History

2014-12-04 09:28:02 +00:00
package core
2014-02-14 22:56:09 +00:00
import (
"bytes"
2014-09-24 09:39:17 +00:00
"fmt"
"io"
"math/big"
"runtime"
"sync"
"time"
2015-03-16 10:27:38 +00:00
"github.com/ethereum/go-ethereum/common"
2015-03-23 21:59:19 +00:00
"github.com/ethereum/go-ethereum/core/state"
2015-03-16 22:48:18 +00:00
"github.com/ethereum/go-ethereum/core/types"
2014-12-03 13:05:19 +00:00
"github.com/ethereum/go-ethereum/event"
2014-10-31 11:56:05 +00:00
"github.com/ethereum/go-ethereum/logger"
2015-04-04 10:40:11 +00:00
"github.com/ethereum/go-ethereum/logger/glog"
"github.com/ethereum/go-ethereum/params"
"github.com/ethereum/go-ethereum/pow"
"github.com/ethereum/go-ethereum/rlp"
2014-02-14 22:56:09 +00:00
)
var (
chainlogger = logger.NewLogger("CHAIN")
jsonlogger = logger.NewJsonLogger()
blockHashPre = []byte("block-hash-")
blockNumPre = []byte("block-num-")
)
2015-04-20 18:37:40 +00:00
const (
blockCacheLimit = 10000
maxFutureBlocks = 256
)
2015-03-04 09:49:56 +00:00
func CalcDifficulty(block, parent *types.Header) *big.Int {
2014-11-17 11:12:55 +00:00
diff := new(big.Int)
adjust := new(big.Int).Div(parent.Difficulty, params.DifficultyBoundDivisor)
if big.NewInt(int64(block.Time)-int64(parent.Time)).Cmp(params.DurationLimit) < 0 {
2015-03-04 09:49:56 +00:00
diff.Add(parent.Difficulty, adjust)
2015-03-02 15:32:02 +00:00
} else {
2015-03-04 09:49:56 +00:00
diff.Sub(parent.Difficulty, adjust)
2014-11-17 11:12:55 +00:00
}
if diff.Cmp(params.MinimumDifficulty) < 0 {
return params.MinimumDifficulty
}
2014-11-17 11:12:55 +00:00
return diff
}
2015-05-15 10:24:29 +00:00
func CalcTD(block, parent *types.Block) *big.Int {
if parent == nil {
return block.Difficulty()
}
2015-04-09 14:37:04 +00:00
td := new(big.Int).Add(parent.Td, block.Header().Difficulty)
return td
}
func CalcGasLimit(parent *types.Block) *big.Int {
2015-05-15 10:24:29 +00:00
decay := new(big.Int).Div(parent.GasLimit(), params.GasLimitBoundDivisor)
contrib := new(big.Int).Mul(parent.GasUsed(), big.NewInt(3))
contrib = contrib.Div(contrib, big.NewInt(2))
contrib = contrib.Div(contrib, params.GasLimitBoundDivisor)
gl := new(big.Int).Sub(parent.GasLimit(), decay)
gl = gl.Add(gl, contrib)
gl = common.BigMax(gl, params.MinGasLimit)
if gl.Cmp(params.GenesisGasLimit) < 0 {
gl2 := new(big.Int).Add(parent.GasLimit(), decay)
return common.BigMin(params.GenesisGasLimit, gl2)
}
return gl
}
2014-10-20 09:53:11 +00:00
type ChainManager struct {
//eth EthManager
2015-03-16 10:27:38 +00:00
blockDb common.Database
stateDb common.Database
processor types.BlockProcessor
2014-12-03 13:05:19 +00:00
eventMux *event.TypeMux
genesisBlock *types.Block
2014-02-14 22:56:09 +00:00
// Last known total difficulty
2015-05-16 22:55:02 +00:00
mu sync.RWMutex
chainmu sync.RWMutex
tsmu sync.RWMutex
td *big.Int
currentBlock *types.Block
lastBlockHash common.Hash
currentGasLimit *big.Int
2014-02-14 22:56:09 +00:00
transState *state.StateDB
txState *state.ManagedState
cache *BlockCache
futureBlocks *BlockCache
quit chan struct{}
wg sync.WaitGroup
pow pow.PoW
}
2014-02-14 22:56:09 +00:00
func NewChainManager(blockDb, stateDb common.Database, pow pow.PoW, mux *event.TypeMux) *ChainManager {
2015-04-20 18:37:40 +00:00
bc := &ChainManager{
2015-04-28 15:13:51 +00:00
blockDb: blockDb,
stateDb: stateDb,
genesisBlock: GenesisBlock(stateDb),
eventMux: mux,
quit: make(chan struct{}),
cache: NewBlockCache(blockCacheLimit),
pow: pow,
2015-04-20 18:37:40 +00:00
}
2015-04-28 15:13:51 +00:00
bc.setLastState()
// Check the current state of the block hashes and make sure that we do not have any of the bad blocks in our chain
for _, hash := range badHashes {
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-02-18 12:14:21 +00:00
bc.transState = bc.State().Copy()
// Take ownership of this particular state
bc.txState = state.ManageState(bc.State().Copy())
2015-04-20 18:37:40 +00:00
bc.futureBlocks = NewBlockCache(maxFutureBlocks)
bc.makeCache()
go bc.update()
2015-02-18 12:14:21 +00:00
return bc
}
func (bc *ChainManager) SetHead(head *types.Block) {
bc.mu.Lock()
defer bc.mu.Unlock()
for block := bc.currentBlock; block != nil && block.Hash() != head.Hash(); block = bc.GetBlock(block.Header().ParentHash) {
bc.removeBlock(block)
}
bc.cache = NewBlockCache(blockCacheLimit)
bc.currentBlock = head
bc.makeCache()
statedb := state.New(head.Root(), bc.stateDb)
bc.txState = state.ManageState(statedb)
bc.transState = statedb.Copy()
bc.setTotalDifficulty(head.Td)
bc.insert(head)
2015-04-28 15:13:51 +00:00
bc.setLastState()
}
func (self *ChainManager) Td() *big.Int {
self.mu.RLock()
defer self.mu.RUnlock()
2014-12-10 18:59:12 +00:00
return self.td
}
func (self *ChainManager) GasLimit() *big.Int {
// return self.currentGasLimit
return self.currentBlock.GasLimit()
}
2015-03-16 22:48:18 +00:00
func (self *ChainManager) LastBlockHash() common.Hash {
2014-12-18 12:17:24 +00:00
self.mu.RLock()
defer self.mu.RUnlock()
return self.lastBlockHash
}
func (self *ChainManager) CurrentBlock() *types.Block {
self.mu.RLock()
defer self.mu.RUnlock()
return self.currentBlock
2014-02-14 22:56:09 +00:00
}
2015-03-16 22:48:18 +00:00
func (self *ChainManager) Status() (td *big.Int, currentBlock common.Hash, genesisBlock common.Hash) {
2014-12-18 12:22:59 +00:00
self.mu.RLock()
defer self.mu.RUnlock()
return self.td, self.currentBlock.Hash(), self.genesisBlock.Hash()
}
func (self *ChainManager) SetProcessor(proc types.BlockProcessor) {
self.processor = proc
}
2014-12-10 18:59:12 +00:00
func (self *ChainManager) State() *state.StateDB {
return state.New(self.CurrentBlock().Root(), self.stateDb)
2014-12-10 18:59:12 +00:00
}
func (self *ChainManager) TransState() *state.StateDB {
2015-02-17 15:12:55 +00:00
self.tsmu.RLock()
defer self.tsmu.RUnlock()
2014-12-10 18:59:12 +00:00
return self.transState
}
func (self *ChainManager) TxState() *state.ManagedState {
self.tsmu.RLock()
defer self.tsmu.RUnlock()
return self.txState
}
func (self *ChainManager) setTxState(statedb *state.StateDB) {
self.tsmu.Lock()
defer self.tsmu.Unlock()
self.txState = state.ManageState(statedb)
}
2015-02-17 15:12:55 +00:00
func (self *ChainManager) setTransState(statedb *state.StateDB) {
self.transState = statedb
}
2015-04-28 15:13:51 +00:00
func (bc *ChainManager) setLastState() {
data, _ := bc.blockDb.Get([]byte("LastBlock"))
2014-11-17 11:12:55 +00:00
if len(data) != 0 {
2015-03-16 22:48:18 +00:00
block := bc.GetBlock(common.BytesToHash(data))
bc.currentBlock = block
bc.lastBlockHash = block.Hash()
2014-11-17 11:12:55 +00:00
// Set the last know difficulty (might be 0x0 as initial value, Genesis)
2015-03-16 10:27:38 +00:00
bc.td = common.BigD(bc.blockDb.LastKnownTD())
2014-11-17 11:12:55 +00:00
} else {
bc.Reset()
}
2015-04-28 15:13:51 +00:00
bc.currentGasLimit = CalcGasLimit(bc.currentBlock)
2014-11-17 11:12:55 +00:00
2015-04-04 11:41:58 +00:00
if glog.V(logger.Info) {
glog.Infof("Last block (#%v) %x TD=%v\n", bc.currentBlock.Number(), bc.currentBlock.Hash(), bc.td)
}
2014-02-14 22:56:09 +00:00
}
func (bc *ChainManager) makeCache() {
if bc.cache == nil {
bc.cache = NewBlockCache(blockCacheLimit)
}
// load in last `blockCacheLimit` - 1 blocks. Last block is the current.
ancestors := bc.GetAncestors(bc.currentBlock, blockCacheLimit-1)
ancestors = append(ancestors, bc.currentBlock)
for _, block := range ancestors {
bc.cache.Push(block)
}
}
2014-11-17 11:12:55 +00:00
// Block creation & chain handling
2015-03-16 22:48:18 +00:00
func (bc *ChainManager) NewBlock(coinbase common.Address) *types.Block {
bc.mu.RLock()
defer bc.mu.RUnlock()
2015-03-16 22:48:18 +00:00
var (
root common.Hash
parentHash common.Hash
)
2014-02-14 22:56:09 +00:00
if bc.currentBlock != nil {
root = bc.currentBlock.Header().Root
parentHash = bc.lastBlockHash
2014-02-14 22:56:09 +00:00
}
block := types.NewBlock(
parentHash,
2014-02-14 22:56:09 +00:00
coinbase,
root,
2015-03-16 10:27:38 +00:00
common.BigPow(2, 32),
2015-03-03 20:04:31 +00:00
0,
nil)
2015-02-09 15:20:34 +00:00
block.SetUncles(nil)
block.SetTransactions(nil)
block.SetReceipts(nil)
2014-02-14 22:56:09 +00:00
parent := bc.currentBlock
2014-09-15 13:42:12 +00:00
if parent != nil {
header := block.Header()
2015-03-04 09:49:56 +00:00
header.Difficulty = CalcDifficulty(block.Header(), parent.Header())
2015-03-16 10:27:38 +00:00
header.Number = new(big.Int).Add(parent.Header().Number, common.Big1)
header.GasLimit = CalcGasLimit(parent)
2014-02-14 22:56:09 +00:00
}
return block
}
2014-10-20 09:53:11 +00:00
func (bc *ChainManager) Reset() {
bc.mu.Lock()
defer bc.mu.Unlock()
2014-12-23 13:50:04 +00:00
for block := bc.currentBlock; block != nil; block = bc.GetBlock(block.Header().ParentHash) {
bc.removeBlock(block)
2014-12-23 13:50:04 +00:00
}
if bc.cache == nil {
bc.cache = NewBlockCache(blockCacheLimit)
}
2014-10-08 09:59:44 +00:00
// Prepare the genesis block
bc.write(bc.genesisBlock)
bc.insert(bc.genesisBlock)
bc.currentBlock = bc.genesisBlock
bc.makeCache()
2014-10-08 09:59:44 +00:00
2015-03-16 10:27:38 +00:00
bc.setTotalDifficulty(common.Big("0"))
2014-10-08 09:59:44 +00:00
}
func (bc *ChainManager) removeBlock(block *types.Block) {
2015-03-16 22:48:18 +00:00
bc.blockDb.Delete(append(blockHashPre, block.Hash().Bytes()...))
}
func (bc *ChainManager) ResetWithGenesisBlock(gb *types.Block) {
bc.mu.Lock()
defer bc.mu.Unlock()
for block := bc.currentBlock; block != nil; block = bc.GetBlock(block.Header().ParentHash) {
bc.removeBlock(block)
}
// Prepare the genesis block
gb.Td = gb.Difficulty()
bc.genesisBlock = gb
bc.write(bc.genesisBlock)
bc.insert(bc.genesisBlock)
bc.currentBlock = bc.genesisBlock
bc.makeCache()
bc.td = gb.Difficulty()
}
// Export writes the active chain to the given writer.
func (self *ChainManager) Export(w io.Writer) error {
self.mu.RLock()
defer self.mu.RUnlock()
2015-04-04 11:41:58 +00:00
glog.V(logger.Info).Infof("exporting %v blocks...\n", self.currentBlock.Header().Number)
2015-04-04 21:04:19 +00:00
last := self.currentBlock.NumberU64()
for nr := uint64(1); nr <= last; nr++ {
block := self.GetBlockByNumber(nr)
if block == nil {
return fmt.Errorf("export failed on #%d: not found", nr)
}
if err := block.EncodeRLP(w); err != nil {
return err
}
2014-12-17 11:57:35 +00:00
}
return nil
2014-12-17 11:57:35 +00:00
}
func (bc *ChainManager) insert(block *types.Block) {
key := append(blockNumPre, block.Number().Bytes()...)
bc.blockDb.Put(key, block.Hash().Bytes())
bc.blockDb.Put([]byte("LastBlock"), block.Hash().Bytes())
bc.currentBlock = block
bc.lastBlockHash = block.Hash()
}
func (bc *ChainManager) write(block *types.Block) {
enc, _ := rlp.EncodeToBytes((*types.StorageBlock)(block))
2015-03-16 22:48:18 +00:00
key := append(blockHashPre, block.Hash().Bytes()...)
bc.blockDb.Put(key, enc)
// Push block to cache
bc.cache.Push(block)
2014-03-21 14:06:23 +00:00
}
2014-11-17 11:12:55 +00:00
// Accessors
func (bc *ChainManager) Genesis() *types.Block {
2014-02-14 22:56:09 +00:00
return bc.genesisBlock
}
2014-11-17 11:12:55 +00:00
// Block fetching methods
2015-03-16 22:48:18 +00:00
func (bc *ChainManager) HasBlock(hash common.Hash) bool {
data, _ := bc.blockDb.Get(append(blockHashPre, hash[:]...))
2014-11-17 11:12:55 +00:00
return len(data) != 0
}
2015-03-16 22:48:18 +00:00
func (self *ChainManager) GetBlockHashesFromHash(hash common.Hash, max uint64) (chain []common.Hash) {
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 22:08:57 +00:00
block = self.GetBlock(block.ParentHash())
2015-01-28 20:12:26 +00:00
if block == nil {
break
}
chain = append(chain, block.Hash())
2015-04-18 22:08:57 +00:00
if block.Number().Cmp(common.Big0) <= 0 {
break
}
}
return
}
2015-03-16 22:48:18 +00:00
func (self *ChainManager) GetBlock(hash common.Hash) *types.Block {
if block := self.cache.Get(hash); block != nil {
return block
}
2015-03-16 22:48:18 +00:00
data, _ := self.blockDb.Get(append(blockHashPre, hash[:]...))
2014-02-21 12:05:59 +00:00
if len(data) == 0 {
return nil
}
var block types.StorageBlock
if err := rlp.Decode(bytes.NewReader(data), &block); err != nil {
2015-04-04 21:04:19 +00:00
glog.V(logger.Error).Infof("invalid block RLP for hash %x: %v", hash, err)
return nil
}
return (*types.Block)(&block)
2014-02-14 22:56:09 +00:00
}
func (self *ChainManager) GetBlockByNumber(num uint64) *types.Block {
self.mu.RLock()
defer self.mu.RUnlock()
return self.getBlockByNumber(num)
}
// non blocking version
func (self *ChainManager) getBlockByNumber(num uint64) *types.Block {
key, _ := self.blockDb.Get(append(blockNumPre, big.NewInt(int64(num)).Bytes()...))
if len(key) == 0 {
return nil
}
2015-03-16 22:48:18 +00:00
return self.GetBlock(common.BytesToHash(key))
}
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
}
func (self *ChainManager) GetAncestors(block *types.Block, length int) (blocks []*types.Block) {
for i := 0; i < length; i++ {
block = self.GetBlock(block.ParentHash())
if block == nil {
break
}
blocks = append(blocks, block)
}
return
}
func (bc *ChainManager) setTotalDifficulty(td *big.Int) {
bc.blockDb.Put([]byte("LTD"), td.Bytes())
2015-03-24 14:27:05 +00:00
bc.td = td
2014-11-17 11:12:55 +00:00
}
2014-09-26 11:32:54 +00:00
func (self *ChainManager) CalcTotalDiff(block *types.Block) (*big.Int, error) {
parent := self.GetBlock(block.Header().ParentHash)
2014-11-17 11:12:55 +00:00
if parent == nil {
return nil, fmt.Errorf("Unable to calculate total diff without known parent %x", block.Header().ParentHash)
2014-09-26 11:32:54 +00:00
}
parentTd := parent.Td
2014-09-26 11:32:54 +00:00
2014-11-17 11:12:55 +00:00
uncleDiff := new(big.Int)
for _, uncle := range block.Uncles() {
2014-11-17 11:12:55 +00:00
uncleDiff = uncleDiff.Add(uncleDiff, uncle.Difficulty)
}
2014-02-14 22:56:09 +00:00
2014-11-17 11:12:55 +00:00
td := new(big.Int)
td = td.Add(parentTd, uncleDiff)
td = td.Add(td, block.Header().Difficulty)
2014-11-17 11:12:55 +00:00
return td, nil
2014-02-14 22:56:09 +00:00
}
2014-10-20 09:53:11 +00:00
func (bc *ChainManager) Stop() {
close(bc.quit)
bc.wg.Wait()
glog.V(logger.Info).Infoln("Chain manager stopped")
}
type queueEvent struct {
queue []interface{}
canonicalCount int
sideCount int
splitCount int
2014-02-14 22:56:09 +00:00
}
func (self *ChainManager) procFutureBlocks() {
blocks := make([]*types.Block, len(self.futureBlocks.blocks))
2015-04-04 18:34:10 +00:00
self.futureBlocks.Each(func(i int, block *types.Block) {
blocks[i] = block
})
types.BlockBy(types.Number).Sort(blocks)
self.InsertChain(blocks)
}
// 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) {
self.wg.Add(1)
defer self.wg.Done()
2015-05-16 22:55:02 +00:00
self.chainmu.Lock()
defer self.chainmu.Unlock()
// A queued approach to delivering events. This is generally faster than direct delivery and requires much less mutex acquiring.
2015-04-04 21:04:19 +00:00
var (
queue = make([]interface{}, len(chain))
queueEvent = queueEvent{queue: queue}
2015-05-01 14:00:30 +00:00
stats struct{ queued, processed, ignored int }
2015-04-05 15:59:38 +00:00
tstart = time.Now()
2015-04-04 21:04:19 +00:00
)
// check the nonce in parallel to the block processing
// this speeds catching up significantly
nonceErrCh := make(chan error)
go func() {
nonceErrCh <- verifyNonces(self.pow, chain)
}()
for i, block := range chain {
if block == nil {
continue
}
// Setting block.Td regardless of error (known for example) prevents errors down the line
// in the protocol handler
2015-05-15 10:24:29 +00:00
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).
logs, err := self.processor.Process(block)
if err != nil {
2014-12-02 10:37:33 +00:00
if IsKnownBlockErr(err) {
2015-05-01 14:00:30 +00:00
stats.ignored++
2014-12-02 10:37:33 +00:00
continue
}
// Do not penelise on future block. We'll need a block queue eventually that will queue
// future block for future use
if err == BlockFutureErr {
block.SetQueued(true)
self.futureBlocks.Push(block)
2015-04-07 12:57:04 +00:00
stats.queued++
continue
}
if IsParentErr(err) && self.futureBlocks.Has(block.ParentHash()) {
block.SetQueued(true)
self.futureBlocks.Push(block)
2015-04-07 12:57:04 +00:00
stats.queued++
2015-03-23 15:14:33 +00:00
continue
}
blockErr(block, err)
2015-04-04 21:04:19 +00:00
return i, err
}
2015-05-16 22:55:02 +00:00
cblock := self.currentBlock
// Write block to database. Eventually we'll have to improve on this and throw away blocks that are
// not in the canonical chain.
self.write(block)
// 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
self.merge(cblock, block)
queue[i] = ChainSplitEvent{block, logs}
queueEvent.splitCount++
2015-02-09 15:20:34 +00:00
}
2015-05-16 22:55:02 +00:00
self.setTotalDifficulty(block.Td)
self.insert(block)
jsonlogger.LogJson(&logger.EthChainNewHead{
BlockHash: block.Hash().Hex(),
BlockNumber: block.Number(),
ChainHeadHash: cblock.Hash().Hex(),
BlockPrevHash: block.ParentHash().Hex(),
})
self.setTransState(state.New(block.Root(), self.stateDb))
self.txState.SetState(state.New(block.Root(), self.stateDb))
queue[i] = ChainEvent{block, block.Hash(), logs}
queueEvent.canonicalCount++
if glog.V(logger.Debug) {
glog.Infof("[%v] inserted block #%d (%d TXs %d UNCs) (%x...)\n", time.Now().UnixNano(), block.Number(), len(block.Transactions()), len(block.Uncles()), block.Hash().Bytes()[0:4])
}
} else {
if glog.V(logger.Detail) {
glog.Infof("inserted forked block #%d (TD=%v) (%d TXs %d UNCs) (%x...)\n", block.Number(), block.Difficulty(), len(block.Transactions()), len(block.Uncles()), block.Hash().Bytes()[0:4])
}
queue[i] = ChainSideEvent{block, logs}
queueEvent.sideCount++
2014-12-04 14:35:21 +00:00
}
2015-05-16 22:55:02 +00:00
self.futureBlocks.Delete(block.Hash())
2015-04-04 21:04:19 +00:00
stats.processed++
}
// check and wait for the nonce error channel and
// make sure no nonce error was thrown in the process
err := <-nonceErrCh
if err != nil {
return 0, err
}
2015-05-03 12:09:50 +00:00
if (stats.queued > 0 || stats.processed > 0 || stats.ignored > 0) && bool(glog.V(logger.Info)) {
2015-04-05 15:59:38 +00:00
tend := time.Since(tstart)
2015-04-04 10:40:11 +00:00
start, end := chain[0], chain[len(chain)-1]
2015-05-01 14:00:30 +00:00
glog.Infof("imported %d block(s) (%d queued %d ignored) in %v. #%v [%x / %x]\n", stats.processed, stats.queued, stats.ignored, tend, end.Number(), start.Hash().Bytes()[:4], end.Hash().Bytes()[:4])
2015-04-04 10:40:11 +00:00
}
go self.eventMux.Post(queueEvent)
return 0, nil
2014-11-17 11:12:55 +00:00
}
// diff takes two blocks, an old chain and a new chain and will reconstruct the blocks and inserts them
// to be part of the new canonical chain.
func (self *ChainManager) diff(oldBlock, newBlock *types.Block) types.Blocks {
var (
newChain types.Blocks
commonBlock *types.Block
oldStart = oldBlock
newStart = newBlock
)
// first reduce whoever is higher bound
if oldBlock.NumberU64() > newBlock.NumberU64() {
// reduce old chain
for oldBlock = oldBlock; oldBlock.NumberU64() != newBlock.NumberU64(); oldBlock = self.GetBlock(oldBlock.ParentHash()) {
}
} else {
// reduce new chain and append new chain blocks for inserting later on
for newBlock = newBlock; newBlock.NumberU64() != oldBlock.NumberU64(); newBlock = self.GetBlock(newBlock.ParentHash()) {
newChain = append(newChain, newBlock)
}
}
numSplit := newBlock.Number()
for {
if oldBlock.Hash() == newBlock.Hash() {
commonBlock = oldBlock
break
}
newChain = append(newChain, newBlock)
oldBlock, newBlock = self.GetBlock(oldBlock.ParentHash()), self.GetBlock(newBlock.ParentHash())
}
if glog.V(logger.Info) {
commonHash := commonBlock.Hash()
glog.Infof("Fork detected @ %x. Reorganising chain from #%v %x to %x", commonHash[:4], numSplit, oldStart.Hash().Bytes()[:4], newStart.Hash().Bytes()[:4])
}
return newChain
}
// merge merges two different chain to the new canonical chain
func (self *ChainManager) merge(oldBlock, newBlock *types.Block) {
newChain := self.diff(oldBlock, newBlock)
// insert blocks. Order does not matter. Last block will be written in ImportChain itself which creates the new head properly
for _, block := range newChain {
self.insert(block)
}
}
func (self *ChainManager) update() {
events := self.eventMux.Subscribe(queueEvent{})
2015-05-01 14:30:02 +00:00
futureTimer := time.Tick(5 * time.Second)
out:
for {
select {
case ev := <-events.Chan():
switch ev := ev.(type) {
case queueEvent:
for i, event := range ev.queue {
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.
if self.lastBlockHash == event.Hash {
self.currentGasLimit = CalcGasLimit(event.Block)
self.eventMux.Post(ChainHeadEvent{event.Block})
}
case ChainSplitEvent:
// On chain splits we need to reset the transaction state. We can't be sure whether the actual
// state of the accounts are still valid.
if i == ev.splitCount {
self.setTxState(state.New(event.Block.Root(), self.stateDb))
}
}
self.eventMux.Post(event)
}
}
2015-05-01 14:30:02 +00:00
case <-futureTimer:
self.procFutureBlocks()
case <-self.quit:
break out
}
}
}
func blockErr(block *types.Block, err error) {
h := block.Header()
glog.V(logger.Error).Infof("INVALID block #%v (%x)\n", h.Number, h.Hash().Bytes())
glog.V(logger.Error).Infoln(err)
glog.V(logger.Debug).Infoln(block)
}
// verifyNonces verifies nonces of the given blocks in parallel and returns
// an error if one of the blocks nonce verifications failed.
func verifyNonces(pow pow.PoW, blocks []*types.Block) error {
// 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 (
in = make(chan *types.Block)
done = make(chan error, runtime.GOMAXPROCS(0))
)
defer close(in)
for i := 0; i < cap(done); i++ {
go verifyNonce(pow, in, done)
}
// Feed blocks to the workers, aborting at the first invalid nonce.
var (
running, i int
block *types.Block
sendin = in
)
for i < len(blocks) || running > 0 {
if i == len(blocks) {
// Disable sending to in.
sendin = nil
} else {
block = blocks[i]
i++
}
select {
case sendin <- block:
running++
case err := <-done:
running--
if err != nil {
return err
}
}
}
return nil
}
// verifyNonce is a worker for the verifyNonces method. It will run until
// in is closed.
func verifyNonce(pow pow.PoW, in <-chan *types.Block, done chan<- error) {
for block := range in {
if !pow.Verify(block) {
done <- ValidationError("Block(#%v) nonce is invalid (= %x)", block.Number(), block.Nonce)
} else {
done <- nil
}
}
}