aboutsummaryrefslogtreecommitdiffstats
path: root/core/vm/stack.go
blob: 168637708255d76f61777df2edec0ef76973b42d (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
package vm

import (
    "fmt"
    "math/big"
)

const maxStack = 1024

func newStack() *stack {
    return &stack{}
}

type stack struct {
    data []*big.Int
    ptr  int
}

func (st *stack) push(d *big.Int) {
    // NOTE push limit (1024) is checked in baseCheck
    stackItem := new(big.Int).Set(d)
    if len(st.data) > st.ptr {
        st.data[st.ptr] = stackItem
    } else {
        st.data = append(st.data, stackItem)
    }
    st.ptr++
}

func (st *stack) pop() (ret *big.Int) {
    st.ptr--
    ret = st.data[st.ptr]
    return
}

func (st *stack) len() int {
    return st.ptr
}

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]
}

func (st *stack) dup(n int) {
    st.push(st.data[st.len()-n])
}

func (st *stack) peek() *big.Int {
    return st.data[st.len()-1]
}

func (st *stack) require(n int) error {
    if st.len() < n {
        return fmt.Errorf("stack underflow (%d <=> %d)", len(st.data), n)
    }
    return nil
}

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("#############")
}