/
memory_table.go
98 lines (76 loc) · 2.81 KB
/
memory_table.go
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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
// Copyright 2017 The go-ethereum Authors
// This file is part of the go-ethereum library.
//
// The go-ethereum library is free software: you can redistribute it and/or modify
// 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.
//
// The go-ethereum library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.
package vm
import (
math2 "github.com/annchain/OG/arefactor/common/math"
"math/big"
"github.com/annchain/OG/vm/eth/common"
)
func memorySha3(stack *Stack) *big.Int {
return common.CalcMemSize(stack.Back(0), stack.Back(1))
}
func memoryCallDataCopy(stack *Stack) *big.Int {
return common.CalcMemSize(stack.Back(0), stack.Back(2))
}
func memoryReturnDataCopy(stack *Stack) *big.Int {
return common.CalcMemSize(stack.Back(0), stack.Back(2))
}
func memoryCodeCopy(stack *Stack) *big.Int {
return common.CalcMemSize(stack.Back(0), stack.Back(2))
}
func memoryExtCodeCopy(stack *Stack) *big.Int {
return common.CalcMemSize(stack.Back(1), stack.Back(3))
}
func memoryMLoad(stack *Stack) *big.Int {
return common.CalcMemSize(stack.Back(0), big.NewInt(32))
}
func memoryMStore8(stack *Stack) *big.Int {
return common.CalcMemSize(stack.Back(0), big.NewInt(1))
}
func memoryMStore(stack *Stack) *big.Int {
return common.CalcMemSize(stack.Back(0), big.NewInt(32))
}
func memoryCreate(stack *Stack) *big.Int {
return common.CalcMemSize(stack.Back(1), stack.Back(2))
}
func memoryCreate2(stack *Stack) *big.Int {
return common.CalcMemSize(stack.Back(1), stack.Back(2))
}
func memoryCall(stack *Stack) *big.Int {
x := common.CalcMemSize(stack.Back(5), stack.Back(6))
y := common.CalcMemSize(stack.Back(3), stack.Back(4))
return math2.BigMax(x, y)
}
func memoryDelegateCall(stack *Stack) *big.Int {
x := common.CalcMemSize(stack.Back(4), stack.Back(5))
y := common.CalcMemSize(stack.Back(2), stack.Back(3))
return math2.BigMax(x, y)
}
func memoryStaticCall(stack *Stack) *big.Int {
x := common.CalcMemSize(stack.Back(4), stack.Back(5))
y := common.CalcMemSize(stack.Back(2), stack.Back(3))
return math2.BigMax(x, y)
}
func memoryReturn(stack *Stack) *big.Int {
return common.CalcMemSize(stack.Back(0), stack.Back(1))
}
func memoryRevert(stack *Stack) *big.Int {
return common.CalcMemSize(stack.Back(0), stack.Back(1))
}
func memoryLog(stack *Stack) *big.Int {
mSize, mStart := stack.Back(1), stack.Back(0)
return common.CalcMemSize(mStart, mSize)
}