stack.go 1.9 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182
  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. // it under the terms of the GNU Lesser General Public License as published by
  6. // the Free Software Foundation, either version 3 of the License, or
  7. // (at your option) any later version.
  8. //
  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. // GNU Lesser General Public License for more details.
  13. //
  14. // 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. package vm
  17. import (
  18. "fmt"
  19. "math/big"
  20. )
  21. func newstack() *stack {
  22. return &stack{}
  23. }
  24. type stack struct {
  25. data []*big.Int
  26. }
  27. func (st *stack) Data() []*big.Int {
  28. return st.data
  29. }
  30. func (st *stack) push(d *big.Int) {
  31. // NOTE push limit (1024) is checked in baseCheck
  32. //stackItem := new(big.Int).Set(d)
  33. //st.data = append(st.data, stackItem)
  34. st.data = append(st.data, d)
  35. }
  36. func (st *stack) pop() (ret *big.Int) {
  37. ret = st.data[len(st.data)-1]
  38. st.data = st.data[:len(st.data)-1]
  39. return
  40. }
  41. func (st *stack) len() int {
  42. return len(st.data)
  43. }
  44. func (st *stack) swap(n int) {
  45. st.data[st.len()-n], st.data[st.len()-1] = st.data[st.len()-1], st.data[st.len()-n]
  46. }
  47. func (st *stack) dup(n int) {
  48. st.push(new(big.Int).Set(st.data[st.len()-n]))
  49. }
  50. func (st *stack) peek() *big.Int {
  51. return st.data[st.len()-1]
  52. }
  53. func (st *stack) require(n int) error {
  54. if st.len() < n {
  55. return fmt.Errorf("stack underflow (%d <=> %d)", len(st.data), n)
  56. }
  57. return nil
  58. }
  59. func (st *stack) Print() {
  60. fmt.Println("### stack ###")
  61. if len(st.data) > 0 {
  62. for i, val := range st.data {
  63. fmt.Printf("%-3d %v\n", i, val)
  64. }
  65. } else {
  66. fmt.Println("-- empty --")
  67. }
  68. fmt.Println("#############")
  69. }