erigon-pulse/core/vm/stack.go

70 lines
1.1 KiB
Go
Raw Normal View History

2014-10-18 11:31:20 +00:00
package vm
import (
"fmt"
"math/big"
)
2015-03-26 16:45:09 +00:00
const maxStack = 1024
2015-03-09 23:25:27 +00:00
func newStack() *stack {
return &stack{}
}
2015-03-09 23:25:27 +00:00
type stack struct {
data []*big.Int
ptr int
}
2015-03-09 23:25:27 +00:00
func (st *stack) push(d *big.Int) {
2015-03-27 15:09:57 +00:00
// NOTE push limit (1024) is checked in baseCheck
2015-03-12 00:12:28 +00:00
stackItem := new(big.Int).Set(d)
2015-03-09 23:25:27 +00:00
if len(st.data) > st.ptr {
2015-03-12 00:12:28 +00:00
st.data[st.ptr] = stackItem
2015-03-09 23:25:27 +00:00
} else {
2015-03-12 00:12:28 +00:00
st.data = append(st.data, stackItem)
2015-03-09 23:25:27 +00:00
}
st.ptr++
}
2015-03-09 23:25:27 +00:00
func (st *stack) pop() (ret *big.Int) {
st.ptr--
ret = st.data[st.ptr]
return
}
2015-03-09 23:25:27 +00:00
func (st *stack) len() int {
return st.ptr
2014-08-21 16:15:09 +00:00
}
2015-03-09 23:25:27 +00:00
func (st *stack) swap(n int) {
st.data[st.len()-n], st.data[st.len()-1] = st.data[st.len()-1], st.data[st.len()-n]
2014-08-21 16:15:09 +00:00
}
2015-03-09 23:25:27 +00:00
func (st *stack) dup(n int) {
st.push(st.data[st.len()-n])
}
2015-03-09 23:25:27 +00:00
func (st *stack) peek() *big.Int {
return st.data[st.len()-1]
}
2015-03-27 15:09:57 +00:00
func (st *stack) require(n int) error {
2015-03-09 23:25:27 +00:00
if st.len() < n {
2015-03-27 15:09:57 +00:00
return fmt.Errorf("stack underflow (%d <=> %d)", len(st.data), n)
}
2015-03-27 15:09:57 +00:00
return nil
}
2015-03-09 23:25:27 +00:00
func (st *stack) Print() {
fmt.Println("### stack ###")
if len(st.data) > 0 {
for i, val := range st.data {
fmt.Printf("%-3d %v\n", i, val)
}
} else {
fmt.Println("-- empty --")
}
fmt.Println("#############")
}