stack.go 2.3 KB
Newer Older
1
// Copyright 2014 The go-ethereum Authors
2
// This file is part of the go-ethereum library.
3
//
4
// The go-ethereum library is free software: you can redistribute it and/or modify
5 6 7 8
// 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.
//
9
// The go-ethereum library is distributed in the hope that it will be useful,
10
// but WITHOUT ANY WARRANTY; without even the implied warranty of
11
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 13 14
// GNU Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
15
// along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.
16

obscuren's avatar
obscuren committed
17
package vm
18 19 20 21 22 23

import (
	"fmt"
	"math/big"
)

24 25 26
// stack is an object for basic stack operations. Items popped to the stack are
// expected to be changed and modified. stack does not take care of adding newly
// initialised objects.
27
type Stack struct {
obscuren's avatar
obscuren committed
28
	data []*big.Int
29 30
}

31 32
func newstack() *Stack {
	return &Stack{}
33 34
}

35
func (st *Stack) Data() []*big.Int {
36
	return st.data
37 38
}

39
func (st *Stack) push(d *big.Int) {
obscuren's avatar
obscuren committed
40
	// NOTE push limit (1024) is checked in baseCheck
41 42 43
	//stackItem := new(big.Int).Set(d)
	//st.data = append(st.data, stackItem)
	st.data = append(st.data, d)
44
}
45
func (st *Stack) pushN(ds ...*big.Int) {
46 47
	st.data = append(st.data, ds...)
}
48

49
func (st *Stack) pop() (ret *big.Int) {
50 51
	ret = st.data[len(st.data)-1]
	st.data = st.data[:len(st.data)-1]
obscuren's avatar
obscuren committed
52
	return
53 54
}

55
func (st *Stack) len() int {
56
	return len(st.data)
obscuren's avatar
obscuren committed
57 58
}

59
func (st *Stack) swap(n int) {
obscuren's avatar
obscuren committed
60
	st.data[st.len()-n], st.data[st.len()-1] = st.data[st.len()-1], st.data[st.len()-n]
obscuren's avatar
obscuren committed
61 62
}

63
func (st *Stack) dup(n int) {
64
	st.push(new(big.Int).Set(st.data[st.len()-n]))
65 66
}

67
func (st *Stack) peek() *big.Int {
obscuren's avatar
obscuren committed
68
	return st.data[st.len()-1]
69 70
}

71 72 73 74 75
// Back returns the n'th item in stack
func (st *Stack) Back(n int) *big.Int {
	return st.data[st.len()-n-1]
}

76
func (st *Stack) require(n int) error {
obscuren's avatar
obscuren committed
77
	if st.len() < n {
obscuren's avatar
obscuren committed
78
		return fmt.Errorf("stack underflow (%d <=> %d)", len(st.data), n)
obscuren's avatar
obscuren committed
79
	}
obscuren's avatar
obscuren committed
80
	return nil
obscuren's avatar
obscuren committed
81 82
}

83
func (st *Stack) Print() {
84 85 86 87 88 89 90 91 92 93
	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("#############")
}