github.com/hxy-daniel/soda-study@v0.0.0-20210825114314-29b7dcb300f1/SODA_code/go-ethereum/core/vm/stack.go (about)

     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  
    17  package vm
    18  
    19  import (
    20  	"fmt"
    21  	"math/big"
    22  	//add new 
    23  	"github.com/ethereum/collector"
    24  )
    25  
    26  // Stack is an object for basic stack operations. Items popped to the stack are
    27  // expected to be changed and modified. stack does not take care of adding newly
    28  // initialised objects.
    29  type Stack struct {
    30  	data []*big.Int
    31  	//add new 
    32  	collector *collector.InsCollector
    33  	flag      bool
    34  }
    35  
    36  func newstack() *Stack {
    37  	//add new 
    38  	return &Stack{data: make([]*big.Int, 0, 1024), collector: collector.NewCollector(), flag: false}
    39  }
    40  
    41  // Data returns the underlying big.Int array.
    42  func (st *Stack) Data() []*big.Int {
    43  	return st.data
    44  }
    45  
    46  func (st *Stack) push(d *big.Int) {
    47  	// NOTE push limit (1024) is checked in baseCheck
    48  	//stackItem := new(big.Int).Set(d)
    49  	//st.data = append(st.data, stackItem)
    50  	st.data = append(st.data, d)
    51  }
    52  func (st *Stack) pushN(ds ...*big.Int) {
    53  	st.data = append(st.data, ds...)
    54  }
    55  
    56  func (st *Stack) pop() (ret *big.Int) {
    57  	ret = st.data[len(st.data)-1]
    58  	st.data = st.data[:len(st.data)-1]
    59  	return
    60  }
    61  
    62  func (st *Stack) len() int {
    63  	return len(st.data)
    64  }
    65  
    66  func (st *Stack) swap(n int) {
    67  	//add new 
    68  	if st.flag {
    69  		st.collector.OpInOut.OpArgs = append(st.collector.OpInOut.OpArgs, st.data[st.len()-n].String(), st.data[st.len()-1].String())
    70  	}
    71  	st.data[st.len()-n], st.data[st.len()-1] = st.data[st.len()-1], st.data[st.len()-n]
    72  }
    73  
    74  func (st *Stack) dup(pool *intPool, n int) {
    75  	//add new 
    76  	p := pool.get().Set(st.data[st.len()-n])
    77  	st.push(p)
    78  	if st.flag {
    79  		st.collector.OpInOut.OpResult = p.String()
    80  	}
    81  }
    82  
    83  func (st *Stack) peek() *big.Int {
    84  	return st.data[st.len()-1]
    85  }
    86  
    87  // Back returns the n'th item in stack
    88  func (st *Stack) Back(n int) *big.Int {
    89  	return st.data[st.len()-n-1]
    90  }
    91  
    92  func (st *Stack) require(n int) error {
    93  	if st.len() < n {
    94  		return fmt.Errorf("stack underflow (%d <=> %d)", len(st.data), n)
    95  	}
    96  	return nil
    97  }
    98  
    99  // Print dumps the content of the stack
   100  func (st *Stack) Print() {
   101  	fmt.Println("### stack ###")
   102  	if len(st.data) > 0 {
   103  		for i, val := range st.data {
   104  			fmt.Printf("%-3d  %v\n", i, val)
   105  		}
   106  	} else {
   107  		fmt.Println("-- empty --")
   108  	}
   109  	fmt.Println("#############")
   110  }