-
Notifications
You must be signed in to change notification settings - Fork 5
/
encode.go
253 lines (235 loc) · 6.86 KB
/
encode.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
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
package abi
import (
"fmt"
"math/big"
"github.com/defiweb/go-eth/types"
)
// EncodeValue encodes a value to ABI encoding.
func EncodeValue(t Type, val any) ([]byte, error) {
return Default.EncodeValue(t, val)
}
// EncodeValues encodes a list of values to ABI encoding.
// The t type must be a tuple type.
func EncodeValues(t Type, vals ...any) ([]byte, error) {
return Default.EncodeValues(t, vals...)
}
// MustEncodeValue is like EncodeValue but panics on error.
func MustEncodeValue(t Type, val any) []byte {
b, err := EncodeValue(t, val)
if err != nil {
panic(err)
}
return b
}
// MustEncodeValues is like EncodeValues but panics on error.
func MustEncodeValues(t Type, vals ...any) []byte {
b, err := EncodeValues(t, vals...)
if err != nil {
panic(err)
}
return b
}
// EncodeValue encodes a value to ABI encoding.
func (a *ABI) EncodeValue(t Type, val any) ([]byte, error) {
v := t.Value()
if err := a.Mapper.Map(val, v); err != nil {
return nil, err
}
words, err := v.EncodeABI()
if err != nil {
return nil, err
}
return words.Bytes(), nil
}
// EncodeValues encodes a list of values to ABI encoding.
// The t type must be a tuple type.
func (a *ABI) EncodeValues(t Type, vals ...any) ([]byte, error) {
v, ok := t.Value().(*TupleValue)
if !ok {
return nil, fmt.Errorf("abi: cannot encode values, expected tuple type")
}
if len(*v) != len(vals) {
return nil, fmt.Errorf("abi: expected %d values, got %d", len(*v), len(vals))
}
for i, elem := range *v {
if err := a.Mapper.Map(vals[i], elem.Value); err != nil {
return nil, err
}
}
words, err := v.EncodeABI()
if err != nil {
return nil, err
}
return words.Bytes(), nil
}
// encodeTuple encodes a tuple of types.
//
// A tuple consists of two sections: head and tail. The tail section is placed
// after the head section. During encoding, if the element is static, it is
// encoded directly in the head section. If the element is dynamic, it is
// encoded in the tail section, and the offset to the element is placed in the
// head section. The offset is a 256-bit integer (single word) that points to
// the start of the element in the tail section. The offset is relative to the
// beginning of the tuple.
func encodeTuple(t []Value) (Words, error) {
var (
head Words
tail Words
headLen int
tailLen int
offsetIdx []int // indices of head elements that are offsets
offsetVal []int // offset values for head elements minus headLen
)
for _, p := range t {
words, err := p.EncodeABI()
if err != nil {
return nil, err
}
if p.IsDynamic() {
// At this point, we do not know what the number of words in the
// head will be, so we cannot calculate the offset. Instead, we
// store the index of the offset element and the number of words
// in the tail section. We will calculate the offset later.
head = append(head, Word{})
tail = append(tail, words...)
offsetIdx = append(offsetIdx, len(head)-1) // index of offset element
offsetVal = append(offsetVal, tailLen) // number of words in tail section
headLen += WordLength
tailLen += len(words) * WordLength
} else {
// If a type is not dynamic, it is encoded directly in the head
// section.
head = append(head, words...)
headLen += len(words) * WordLength
}
continue
}
// Fast path if there are no dynamic elements.
if len(tail) == 0 {
return head, nil
}
// Calculate the offsets for the dynamic elements as described above.
for n, i := range offsetIdx {
if err := writeInt(&head[i], headLen+offsetVal[n]); err != nil {
return nil, err
}
}
// Append the tail section to the head section.
words := make(Words, len(head)+len(tail))
copy(words, head)
copy(words[len(head):], tail)
return words, nil
}
// encodeArray encodes a dynamic array.
//
// The array is encoded just like a tuple, except that the first word is the
// number of elements in the array. All array elements must be of the same type.
func encodeArray(a []Value) (Words, error) {
tuple, err := encodeTuple(a)
if err != nil {
return nil, err
}
words := make(Words, len(tuple)+1)
if err := writeInt(&words[0], len(a)); err != nil {
return nil, err
}
copy(words[1:], tuple)
return words, nil
}
// encodeFixedArray encodes a fixed-size array.
//
// The fixed-size array is encoded just like a tuple. All array elements must be
// of the same type.
func encodeFixedArray(a []Value) (Words, error) {
return encodeTuple(a)
}
// encodeBytes encodes a dynamic byte sequence.
//
// The byte sequence is encoded as multiple words, padded on the right if
// needed. The length of the byte sequence is encoded as a 256-bit integer
// (single word) before the byte sequence.
func encodeBytes(b []byte) (Words, error) {
words := make(Words, requiredWords(len(b))+1)
if err := writeInt(&words[0], len(b)); err != nil {
return nil, err
}
for i, w := range BytesToWords(b) {
words[i+1] = w
}
return words, nil
}
// encodeFixedBytes encodes a fixed-size byte sequence.
//
// The fixed-size byte sequence is encoded in a single word, padded on the
// left if needed.
func encodeFixedBytes(b []byte, size int) (Words, error) {
word := Word{}
if len(b) > size {
return Words{}, fmt.Errorf("abi: cannot encode %d bytes to bytes%d", len(b), size)
}
if err := word.SetBytesPadRight(b); err != nil {
return nil, err
}
return Words{word}, nil
}
// encodeInt encodes an integer.
//
// The integer is encoded as two's complement integer. If the integer cannot
// be represented in number of bits specified by the size argument, an error
// is returned.
func encodeInt(v *big.Int, size int) (Words, error) {
w := Word{}
x := newIntX(size)
if err := x.SetBigInt(v); err != nil {
return nil, err
}
if err := w.SetBytesPadLeft(x.Bytes()); err != nil {
return nil, err
}
return Words{w}, nil
}
// encodeUint encodes an unsigned integer.
//
// The integer is encoded as unsigned integer. If the integer cannot be
// represented in number of bits specified by the size argument, an error
// is returned.
func encodeUint(v *big.Int, size int) (Words, error) {
w := Word{}
x := newUintX(size)
if err := x.SetBigInt(v); err != nil {
return nil, err
}
if err := w.SetBytesPadLeft(x.Bytes()); err != nil {
return nil, err
}
return Words{w}, nil
}
// encodeBool encodes a boolean.
//
// The boolean is encoded as a single word where the least significant bit
// is the value of the boolean.
func encodeBool(b bool) Words {
w := Word{}
if b {
w[WordLength-1] = 1
}
return Words{w}
}
// encodeAddress encodes an address.
//
// An address is encoded as a 160-bit byte sequence, padded on the left.
func encodeAddress(val types.Address) (Words, error) {
w := Word{}
if err := w.SetBytesPadLeft(val.Bytes()); err != nil {
return nil, err
}
return Words{w}, nil
}
// writeInt writes an integer to a word.
func writeInt(w *Word, x int) error {
i32 := newIntX(32)
if err := i32.SetInt(x); err != nil {
return err
}
return w.SetBytesPadLeft(i32.Bytes())
}