plugeth/core/block_processor.go

405 lines
12 KiB
Go
Raw Normal View History

2015-07-07 00:54:22 +00:00
// Copyright 2014 The go-ethereum Authors
// This file is part of the go-ethereum library.
2015-07-07 00:54:22 +00:00
//
// The go-ethereum library is free software: you can redistribute it and/or modify
2015-07-07 00:54:22 +00: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.
//
// The go-ethereum library is distributed in the hope that it will be useful,
2015-07-07 00:54:22 +00:00
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
2015-07-07 00:54:22 +00:00
// GNU Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.
2015-07-07 00:54:22 +00:00
2014-12-04 09:28:02 +00:00
package core
2014-02-14 22:56:09 +00:00
import (
2014-06-30 11:09:04 +00:00
"fmt"
2014-08-08 13:36:59 +00:00
"math/big"
"sync"
2015-01-21 23:24:30 +00:00
"time"
2014-08-08 13:36:59 +00:00
2015-03-16 10:27:38 +00:00
"github.com/ethereum/go-ethereum/common"
2015-03-23 17:27:05 +00:00
"github.com/ethereum/go-ethereum/core/state"
2015-03-16 22:48:18 +00:00
"github.com/ethereum/go-ethereum/core/types"
"github.com/ethereum/go-ethereum/crypto"
"github.com/ethereum/go-ethereum/event"
2014-10-31 11:56:05 +00:00
"github.com/ethereum/go-ethereum/logger"
2015-04-04 11:41:58 +00:00
"github.com/ethereum/go-ethereum/logger/glog"
"github.com/ethereum/go-ethereum/params"
2014-12-10 15:45:16 +00:00
"github.com/ethereum/go-ethereum/pow"
"gopkg.in/fatih/set.v0"
2014-02-14 22:56:09 +00:00
)
const (
// must be bumped when consensus algorithm is changed, this forces the upgradedb
// command to be run (forces the blocks to be imported again using the new algorithm)
BlockChainVersion = 3
)
2015-01-04 23:18:44 +00:00
type BlockProcessor struct {
chainDb common.Database
2014-02-14 22:56:09 +00:00
// Mutex for locking the block processor. Blocks can only be handled one at a time
mutex sync.Mutex
// Canonical block chain
2014-10-20 09:53:11 +00:00
bc *ChainManager
2014-02-14 22:56:09 +00:00
// non-persistent key/value memory storage
mem map[string]*big.Int
// Proof of work used for validating
2014-12-10 15:45:16 +00:00
Pow pow.PoW
2014-12-18 11:18:19 +00:00
events event.Subscription
2014-12-10 19:26:55 +00:00
eventMux *event.TypeMux
2014-02-14 22:56:09 +00:00
}
func NewBlockProcessor(db common.Database, pow pow.PoW, chainManager *ChainManager, eventMux *event.TypeMux) *BlockProcessor {
2015-01-04 23:18:44 +00:00
sm := &BlockProcessor{
chainDb: db,
2015-02-26 17:39:05 +00:00
mem: make(map[string]*big.Int),
2015-03-03 16:55:23 +00:00
Pow: pow,
2014-12-18 11:18:19 +00:00
bc: chainManager,
eventMux: eventMux,
2014-02-14 22:56:09 +00:00
}
2014-03-05 09:57:32 +00:00
return sm
2014-02-14 22:56:09 +00:00
}
func (sm *BlockProcessor) TransitionState(statedb *state.StateDB, parent, block *types.Block, transientProcess bool) (receipts types.Receipts, err error) {
2015-06-16 10:41:50 +00:00
coinbase := statedb.GetOrNewStateObject(block.Coinbase())
coinbase.SetGasLimit(block.GasLimit())
2014-12-02 21:37:45 +00:00
2015-01-05 10:22:02 +00:00
// Process the transactions on to parent state
receipts, err = sm.ApplyTransactions(coinbase, statedb, block, block.Transactions(), transientProcess)
2014-12-02 21:37:45 +00:00
if err != nil {
return nil, err
}
return receipts, nil
}
2015-06-16 10:41:50 +00:00
func (self *BlockProcessor) ApplyTransaction(coinbase *state.StateObject, statedb *state.StateDB, header *types.Header, tx *types.Transaction, usedGas *big.Int, transientProcess bool) (*types.Receipt, *big.Int, error) {
cb := statedb.GetStateObject(coinbase.Address())
2015-06-16 10:41:50 +00:00
_, gas, err := ApplyMessage(NewEnv(statedb, self.bc, tx, header), tx, cb)
if err != nil {
return nil, nil, err
}
2015-02-04 13:52:59 +00:00
// Update the state with pending changes
statedb.SyncIntermediate()
2015-02-04 13:52:59 +00:00
usedGas.Add(usedGas, gas)
receipt := types.NewReceipt(statedb.Root().Bytes(), usedGas)
receipt.TxHash = tx.Hash()
receipt.GasUsed = new(big.Int).Set(gas)
if MessageCreatesContract(tx) {
from, _ := tx.From()
receipt.ContractAddress = crypto.CreateAddress(from, tx.Nonce())
}
logs := statedb.GetLogs(tx.Hash())
receipt.SetLogs(logs)
2015-02-04 13:52:59 +00:00
receipt.Bloom = types.CreateBloom(types.Receipts{receipt})
2015-04-04 11:41:58 +00:00
glog.V(logger.Debug).Infoln(receipt)
2015-02-04 13:52:59 +00:00
// Notify all subscribers
if !transientProcess {
go self.eventMux.Post(TxPostEvent{tx})
2015-02-26 17:39:05 +00:00
go self.eventMux.Post(logs)
2015-02-04 13:52:59 +00:00
}
2015-03-12 21:29:10 +00:00
return receipt, gas, err
2015-02-04 13:52:59 +00:00
}
2015-02-28 01:56:24 +00:00
func (self *BlockProcessor) ChainManager() *ChainManager {
return self.bc
}
2015-02-04 13:52:59 +00:00
func (self *BlockProcessor) ApplyTransactions(coinbase *state.StateObject, statedb *state.StateDB, block *types.Block, txs types.Transactions, transientProcess bool) (types.Receipts, error) {
2014-06-13 10:45:11 +00:00
var (
receipts types.Receipts
totalUsedGas = big.NewInt(0)
err error
cumulativeSum = new(big.Int)
2015-06-16 10:41:50 +00:00
header = block.Header()
2014-06-13 10:45:11 +00:00
)
for i, tx := range txs {
statedb.StartRecord(tx.Hash(), block.Hash(), i)
2015-06-16 10:41:50 +00:00
receipt, txGas, err := self.ApplyTransaction(coinbase, statedb, header, tx, totalUsedGas, transientProcess)
if err != nil {
return nil, err
}
if err != nil {
2015-04-04 11:41:58 +00:00
glog.V(logger.Core).Infoln("TX err:", err)
}
receipts = append(receipts, receipt)
2014-07-11 14:04:09 +00:00
2015-02-04 13:52:59 +00:00
cumulativeSum.Add(cumulativeSum, new(big.Int).Mul(txGas, tx.GasPrice()))
}
if block.GasUsed().Cmp(totalUsedGas) != 0 {
return nil, ValidationError(fmt.Sprintf("gas used error (%v / %v)", block.GasUsed(), totalUsedGas))
}
2014-06-11 09:40:40 +00:00
2015-02-05 19:55:03 +00:00
if transientProcess {
2015-03-19 15:19:54 +00:00
go self.eventMux.Post(PendingBlockEvent{block, statedb.Logs()})
2015-02-05 19:55:03 +00:00
}
return receipts, err
}
func (sm *BlockProcessor) RetryProcess(block *types.Block) (logs state.Logs, err error) {
// Processing a blocks may never happen simultaneously
sm.mutex.Lock()
defer sm.mutex.Unlock()
2015-06-16 10:41:50 +00:00
if !sm.bc.HasBlock(block.ParentHash()) {
return nil, ParentError(block.ParentHash())
}
2015-06-16 10:41:50 +00:00
parent := sm.bc.GetBlock(block.ParentHash())
// FIXME Change to full header validation. See #1225
errch := make(chan bool)
go func() { errch <- sm.Pow.Verify(block) }()
logs, _, err = sm.processWithParent(block, parent)
if !<-errch {
return nil, ValidationError("Block's nonce is invalid (= %x)", block.Nonce)
}
return logs, err
}
// Process block will attempt to process the given block's transactions and applies them
// on top of the block's parent state (given it exists) and will return wether it was
// successful or not.
func (sm *BlockProcessor) Process(block *types.Block) (logs state.Logs, receipts types.Receipts, err error) {
2014-02-14 22:56:09 +00:00
// Processing a blocks may never happen simultaneously
2014-03-05 09:57:32 +00:00
sm.mutex.Lock()
defer sm.mutex.Unlock()
2014-02-14 22:56:09 +00:00
2015-06-16 10:41:50 +00:00
if sm.bc.HasBlock(block.Hash()) {
return nil, nil, &KnownBlockError{block.Number(), block.Hash()}
2014-02-14 22:56:09 +00:00
}
2015-06-16 10:41:50 +00:00
if !sm.bc.HasBlock(block.ParentHash()) {
return nil, nil, ParentError(block.ParentHash())
2014-06-23 09:23:18 +00:00
}
2015-06-16 10:41:50 +00:00
parent := sm.bc.GetBlock(block.ParentHash())
return sm.processWithParent(block, parent)
}
2014-06-23 09:23:18 +00:00
func (sm *BlockProcessor) processWithParent(block, parent *types.Block) (logs state.Logs, receipts types.Receipts, err error) {
// Create a new state based on the parent's root (e.g., create copy)
state := state.New(parent.Root(), sm.chainDb)
2015-06-16 10:41:50 +00:00
header := block.Header()
uncles := block.Uncles()
txs := block.Transactions()
2014-06-23 09:23:18 +00:00
2014-12-04 14:13:29 +00:00
// Block validation
if err = ValidateHeader(sm.Pow, header, parent, false); err != nil {
2015-04-04 10:40:11 +00:00
return
2014-07-11 14:04:09 +00:00
}
2015-03-04 09:49:56 +00:00
// There can be at most two uncles
2015-06-16 10:41:50 +00:00
if len(uncles) > 2 {
return nil, nil, ValidationError("Block can only contain maximum 2 uncles (contained %v)", len(uncles))
2015-03-04 09:49:56 +00:00
}
receipts, err = sm.TransitionState(state, parent, block, false)
if err != nil {
return
}
// Validate the received block's bloom with the one derived from the generated receipts.
// For valid blocks this should always validate to true.
rbloom := types.CreateBloom(receipts)
2015-03-16 22:48:18 +00:00
if rbloom != header.Bloom {
err = fmt.Errorf("unable to replicate block's bloom=%x", rbloom)
return
}
2015-03-25 16:05:29 +00:00
// The transactions Trie's root (R = (Tr [[i, RLP(T1)], [i, RLP(T2)], ... [n, RLP(Tn)]]))
// can be used by light clients to make sure they've received the correct Txs
2015-06-16 10:41:50 +00:00
txSha := types.DeriveSha(txs)
2015-03-16 22:48:18 +00:00
if txSha != header.TxHash {
err = fmt.Errorf("invalid transaction root hash. received=%x calculated=%x", header.TxHash, txSha)
2014-11-12 00:36:36 +00:00
return
}
// Tre receipt Trie's root (R = (Tr [[H1, R1], ... [Hn, R1]]))
receiptSha := types.DeriveSha(receipts)
2015-03-16 22:48:18 +00:00
if receiptSha != header.ReceiptHash {
err = fmt.Errorf("invalid receipt root hash. received=%x calculated=%x", header.ReceiptHash, receiptSha)
return
}
// Verify UncleHash before running other uncle validations
2015-06-16 10:41:50 +00:00
unclesSha := types.CalcUncleHash(uncles)
if unclesSha != header.UncleHash {
err = fmt.Errorf("invalid uncles root hash. received=%x calculated=%x", header.UncleHash, unclesSha)
return
}
2014-07-21 10:21:34 +00:00
// Verify uncles
if err = sm.VerifyUncles(state, block, parent); err != nil {
return
2014-02-14 22:56:09 +00:00
}
// Accumulate static rewards; block reward, uncle's and uncle inclusion.
2015-06-16 10:41:50 +00:00
AccumulateRewards(state, header, uncles)
2014-02-14 22:56:09 +00:00
// Commit state objects/accounts to a temporary trie (does not save)
// used to calculate the state root.
state.SyncObjects()
2015-03-16 22:48:18 +00:00
if header.Root != state.Root() {
err = fmt.Errorf("invalid merkle root. received=%x got=%x", header.Root, state.Root())
return
2014-02-14 22:56:09 +00:00
}
2015-02-03 04:02:00 +00:00
// Sync the current block's state to the database
state.Sync()
2015-03-23 15:14:33 +00:00
return state.Logs(), receipts, nil
2014-02-14 22:56:09 +00:00
}
var (
big8 = big.NewInt(8)
big32 = big.NewInt(32)
)
2015-06-16 10:41:50 +00:00
// AccumulateRewards credits the coinbase of the given block with the
// mining reward. The total reward consists of the static block reward
// and rewards for included uncles. The coinbase of each uncle block is
// also rewarded.
2015-06-16 10:41:50 +00:00
func AccumulateRewards(statedb *state.StateDB, header *types.Header, uncles []*types.Header) {
reward := new(big.Int).Set(BlockReward)
r := new(big.Int)
2015-06-16 10:41:50 +00:00
for _, uncle := range uncles {
r.Add(uncle.Number, big8)
r.Sub(r, header.Number)
r.Mul(r, BlockReward)
r.Div(r, big8)
2015-06-16 10:41:50 +00:00
statedb.AddBalance(uncle.Coinbase, r)
r.Div(BlockReward, big32)
reward.Add(reward, r)
2015-06-16 10:41:50 +00:00
}
statedb.AddBalance(header.Coinbase, reward)
}
func (sm *BlockProcessor) VerifyUncles(statedb *state.StateDB, block, parent *types.Block) error {
uncles := set.New()
ancestors := make(map[common.Hash]*types.Block)
2015-06-16 10:41:50 +00:00
for _, ancestor := range sm.bc.GetBlocksFromHash(block.ParentHash(), 7) {
ancestors[ancestor.Hash()] = ancestor
2015-03-04 09:49:56 +00:00
// Include ancestors uncles in the uncle set. Uncles must be unique.
for _, uncle := range ancestor.Uncles() {
uncles.Add(uncle.Hash())
2015-03-04 09:49:56 +00:00
}
}
ancestors[block.Hash()] = block
uncles.Add(block.Hash())
for i, uncle := range block.Uncles() {
hash := uncle.Hash()
if uncles.Has(hash) {
2014-09-14 23:11:01 +00:00
// Error not unique
return UncleError("uncle[%d](%x) not unique", i, hash[:4])
2014-09-14 23:11:01 +00:00
}
uncles.Add(hash)
2015-03-04 09:49:56 +00:00
if ancestors[hash] != nil {
branch := fmt.Sprintf(" O - %x\n |\n", block.Hash())
for h := range ancestors {
branch += fmt.Sprintf(" O - %x\n |\n", h)
}
2015-05-18 08:13:50 +00:00
glog.Infoln(branch)
return UncleError("uncle[%d](%x) is ancestor", i, hash[:4])
2015-03-04 09:49:56 +00:00
}
if ancestors[uncle.ParentHash] == nil || uncle.ParentHash == parent.Hash() {
2015-06-01 20:43:05 +00:00
return UncleError("uncle[%d](%x)'s parent is not ancestor (%x)", i, hash[:4], uncle.ParentHash[0:4])
2014-09-14 23:11:01 +00:00
}
2014-02-18 00:33:26 +00:00
if err := ValidateHeader(sm.Pow, uncle, ancestors[uncle.ParentHash], true); err != nil {
return ValidationError(fmt.Sprintf("uncle[%d](%x) header invalid: %v", i, hash[:4], err))
2015-03-04 09:49:56 +00:00
}
2014-02-18 00:33:26 +00:00
}
2014-02-14 22:56:09 +00:00
return nil
}
// GetBlockReceipts returns the receipts beloniging to the block hash
func (sm *BlockProcessor) GetBlockReceipts(bhash common.Hash) types.Receipts {
if block := sm.ChainManager().GetBlock(bhash); block != nil {
return GetBlockReceipts(sm.chainDb, block.Hash())
}
return nil
}
// GetLogs returns the logs of the given block. This method is using a two step approach
// where it tries to get it from the (updated) method which gets them from the receipts or
// the depricated way by re-processing the block.
2015-01-28 09:23:18 +00:00
func (sm *BlockProcessor) GetLogs(block *types.Block) (logs state.Logs, err error) {
receipts := GetBlockReceipts(sm.chainDb, block.Hash())
if len(receipts) > 0 {
// coalesce logs
for _, receipt := range receipts {
logs = append(logs, receipt.Logs()...)
}
2015-01-28 09:23:18 +00:00
}
return logs, nil
2015-01-28 09:23:18 +00:00
}
// See YP section 4.3.4. "Block Header Validity"
// Validates a block. Returns an error if the block is invalid.
func ValidateHeader(pow pow.PoW, block *types.Header, parent *types.Block, checkPow bool) error {
if big.NewInt(int64(len(block.Extra))).Cmp(params.MaximumExtraDataSize) == 1 {
return fmt.Errorf("Block extra data too long (%d)", len(block.Extra))
}
2015-06-30 07:13:16 +00:00
if block.Time > uint64(time.Now().Unix()) {
return BlockFutureErr
}
if block.Time <= parent.Time() {
return BlockEqualTSErr
}
2015-08-04 21:46:38 +00:00
expd := CalcDifficulty(block.Time, parent.Time(), parent.Number(), parent.Difficulty())
if expd.Cmp(block.Difficulty) != 0 {
return fmt.Errorf("Difficulty check failed for block %v, %v", block.Difficulty, expd)
}
var a, b *big.Int
a = parent.GasLimit()
a = a.Sub(a, block.GasLimit)
a.Abs(a)
b = parent.GasLimit()
b = b.Div(b, params.GasLimitBoundDivisor)
if !(a.Cmp(b) < 0) || (block.GasLimit.Cmp(params.MinGasLimit) == -1) {
return fmt.Errorf("GasLimit check failed for block %v (%v > %v)", block.GasLimit, a, b)
}
num := parent.Number()
num.Sub(block.Number, num)
if num.Cmp(big.NewInt(1)) != 0 {
return BlockNumberErr
}
if checkPow {
// Verify the nonce of the block. Return an error if it's not valid
if !pow.Verify(types.NewBlockWithHeader(block)) {
return ValidationError("Block's nonce is invalid (= %x)", block.Nonce)
}
}
return nil
}