forked from cerc-io/plugeth
Merge pull request #1150 from fjl/fix-jumpdest
core/vm: improve JUMPDEST analysis
This commit is contained in:
commit
122d2db095
@ -3,34 +3,45 @@ package vm
|
|||||||
import (
|
import (
|
||||||
"math/big"
|
"math/big"
|
||||||
|
|
||||||
"gopkg.in/fatih/set.v0"
|
"github.com/ethereum/go-ethereum/common"
|
||||||
)
|
)
|
||||||
|
|
||||||
type destinations struct {
|
var bigMaxUint64 = new(big.Int).SetUint64(^uint64(0))
|
||||||
set *set.Set
|
|
||||||
|
// destinations stores one map per contract (keyed by hash of code).
|
||||||
|
// The maps contain an entry for each location of a JUMPDEST
|
||||||
|
// instruction.
|
||||||
|
type destinations map[common.Hash]map[uint64]struct{}
|
||||||
|
|
||||||
|
// has checks whether code has a JUMPDEST at dest.
|
||||||
|
func (d destinations) has(codehash common.Hash, code []byte, dest *big.Int) bool {
|
||||||
|
// PC cannot go beyond len(code) and certainly can't be bigger than 64bits.
|
||||||
|
// Don't bother checking for JUMPDEST in that case.
|
||||||
|
if dest.Cmp(bigMaxUint64) > 0 {
|
||||||
|
return false
|
||||||
|
}
|
||||||
|
m, analysed := d[codehash]
|
||||||
|
if !analysed {
|
||||||
|
m = jumpdests(code)
|
||||||
|
d[codehash] = m
|
||||||
|
}
|
||||||
|
_, ok := m[dest.Uint64()]
|
||||||
|
return ok
|
||||||
}
|
}
|
||||||
|
|
||||||
func (d *destinations) Has(dest *big.Int) bool {
|
// jumpdests creates a map that contains an entry for each
|
||||||
return d.set.Has(string(dest.Bytes()))
|
// PC location that is a JUMPDEST instruction.
|
||||||
}
|
func jumpdests(code []byte) map[uint64]struct{} {
|
||||||
|
m := make(map[uint64]struct{})
|
||||||
func (d *destinations) Add(dest *big.Int) {
|
|
||||||
d.set.Add(string(dest.Bytes()))
|
|
||||||
}
|
|
||||||
|
|
||||||
func analyseJumpDests(code []byte) (dests *destinations) {
|
|
||||||
dests = &destinations{set.New()}
|
|
||||||
|
|
||||||
for pc := uint64(0); pc < uint64(len(code)); pc++ {
|
for pc := uint64(0); pc < uint64(len(code)); pc++ {
|
||||||
var op OpCode = OpCode(code[pc])
|
var op OpCode = OpCode(code[pc])
|
||||||
switch op {
|
switch op {
|
||||||
case PUSH1, PUSH2, PUSH3, PUSH4, PUSH5, PUSH6, PUSH7, PUSH8, PUSH9, PUSH10, PUSH11, PUSH12, PUSH13, PUSH14, PUSH15, PUSH16, PUSH17, PUSH18, PUSH19, PUSH20, PUSH21, PUSH22, PUSH23, PUSH24, PUSH25, PUSH26, PUSH27, PUSH28, PUSH29, PUSH30, PUSH31, PUSH32:
|
case PUSH1, PUSH2, PUSH3, PUSH4, PUSH5, PUSH6, PUSH7, PUSH8, PUSH9, PUSH10, PUSH11, PUSH12, PUSH13, PUSH14, PUSH15, PUSH16, PUSH17, PUSH18, PUSH19, PUSH20, PUSH21, PUSH22, PUSH23, PUSH24, PUSH25, PUSH26, PUSH27, PUSH28, PUSH29, PUSH30, PUSH31, PUSH32:
|
||||||
a := uint64(op) - uint64(PUSH1) + 1
|
a := uint64(op) - uint64(PUSH1) + 1
|
||||||
|
|
||||||
pc += a
|
pc += a
|
||||||
case JUMPDEST:
|
case JUMPDEST:
|
||||||
dests.Add(big.NewInt(int64(pc)))
|
m[pc] = struct{}{}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
return
|
return m
|
||||||
}
|
}
|
||||||
|
@ -16,6 +16,8 @@ type Context struct {
|
|||||||
caller ContextRef
|
caller ContextRef
|
||||||
self ContextRef
|
self ContextRef
|
||||||
|
|
||||||
|
jumpdests destinations // result of JUMPDEST analysis.
|
||||||
|
|
||||||
Code []byte
|
Code []byte
|
||||||
CodeAddr *common.Address
|
CodeAddr *common.Address
|
||||||
|
|
||||||
@ -24,10 +26,17 @@ type Context struct {
|
|||||||
Args []byte
|
Args []byte
|
||||||
}
|
}
|
||||||
|
|
||||||
// Create a new context for the given data items
|
// Create a new context for the given data items.
|
||||||
func NewContext(caller ContextRef, object ContextRef, value, gas, price *big.Int) *Context {
|
func NewContext(caller ContextRef, object ContextRef, value, gas, price *big.Int) *Context {
|
||||||
c := &Context{caller: caller, self: object, Args: nil}
|
c := &Context{caller: caller, self: object, Args: nil}
|
||||||
|
|
||||||
|
if parent, ok := caller.(*Context); ok {
|
||||||
|
// Reuse JUMPDEST analysis from parent context if available.
|
||||||
|
c.jumpdests = parent.jumpdests
|
||||||
|
} else {
|
||||||
|
c.jumpdests = make(destinations)
|
||||||
|
}
|
||||||
|
|
||||||
// Gas should be a pointer so it can safely be reduced through the run
|
// Gas should be a pointer so it can safely be reduced through the run
|
||||||
// This pointer will be off the state transition
|
// This pointer will be off the state transition
|
||||||
c.Gas = gas //new(big.Int).Set(gas)
|
c.Gas = gas //new(big.Int).Set(gas)
|
||||||
|
@ -71,18 +71,22 @@ func (self *Vm) Run(context *Context, callData []byte) (ret []byte, err error) {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// Don't bother with the execution if there's no code.
|
||||||
|
if len(code) == 0 {
|
||||||
|
return context.Return(nil), nil
|
||||||
|
}
|
||||||
|
|
||||||
var (
|
var (
|
||||||
op OpCode
|
op OpCode
|
||||||
|
codehash = crypto.Sha3Hash(code)
|
||||||
destinations = analyseJumpDests(context.Code)
|
|
||||||
mem = NewMemory()
|
mem = NewMemory()
|
||||||
stack = newStack()
|
stack = newStack()
|
||||||
pc = new(big.Int)
|
pc = new(big.Int)
|
||||||
statedb = self.env.State()
|
statedb = self.env.State()
|
||||||
|
|
||||||
jump = func(from *big.Int, to *big.Int) error {
|
jump = func(from *big.Int, to *big.Int) error {
|
||||||
|
if !context.jumpdests.has(codehash, code, to) {
|
||||||
nop := context.GetOp(to)
|
nop := context.GetOp(to)
|
||||||
if !destinations.Has(to) {
|
|
||||||
return fmt.Errorf("invalid jump destination (%v) %v", nop, to)
|
return fmt.Errorf("invalid jump destination (%v) %v", nop, to)
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -95,11 +99,6 @@ func (self *Vm) Run(context *Context, callData []byte) (ret []byte, err error) {
|
|||||||
}
|
}
|
||||||
)
|
)
|
||||||
|
|
||||||
// Don't bother with the execution if there's no code.
|
|
||||||
if len(code) == 0 {
|
|
||||||
return context.Return(nil), nil
|
|
||||||
}
|
|
||||||
|
|
||||||
for {
|
for {
|
||||||
// The base for all big integer arithmetic
|
// The base for all big integer arithmetic
|
||||||
base := new(big.Int)
|
base := new(big.Int)
|
||||||
|
File diff suppressed because one or more lines are too long
Loading…
Reference in New Issue
Block a user