This repository has been archived by the owner on May 13, 2024. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 32
/
unmarshal.go
394 lines (371 loc) · 9.15 KB
/
unmarshal.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
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
// Copyright (c) 2020-2022 Blockwatch Data Inc.
// Author: alex@blockwatch.cc
package micheline
import (
"encoding"
"fmt"
"reflect"
"strconv"
"strings"
"time"
"blockwatch.cc/tzgo/tezos"
)
type PrimUnmarshaler interface {
UnmarshalPrim(Prim) error
}
type PrimMarshaler interface {
MarshalPrim() (Prim, error)
}
func (p Prim) FindLabel(label string) (Prim, bool) {
idx, ok := p.LabelIndex(label)
if !ok {
return InvalidPrim, false
}
prim, _ := p.GetIndex(idx)
return prim, true
}
func (p Prim) LabelIndex(label string) ([]int, bool) {
return p.findLabelPath(strings.Split(label, "."), nil)
}
func (p Prim) findLabelPath(path []string, idx []int) ([]int, bool) {
prim := p
next:
for {
if len(path) == 0 {
return idx, true
}
var found bool
for i, v := range prim.Args {
if v.HasAnno() && v.MatchesAnno(path[0]) {
idx = append(idx, i)
path = path[1:]
prim = v
found = true
continue next
}
}
for i, v := range prim.Args {
if v.HasAnno() {
continue
}
idx2, ok := v.findLabelPath(path, append(idx, i))
if ok {
path = path[:0]
found = true
idx = idx2
continue next
}
}
if !found {
return nil, false
}
}
}
func (p Prim) GetPath(path string) (Prim, error) {
index := make([]int, 0)
path = strings.TrimPrefix(path, "/")
path = strings.TrimSuffix(path, "/")
for i, v := range strings.Split(path, "/") {
switch v {
case "L", "l", "0":
index = append(index, 0)
case "R", "r", "1":
index = append(index, 1)
default:
idx, err := strconv.Atoi(v)
if err != nil {
return InvalidPrim, fmt.Errorf("micheline: invalid path component '%v' at pos %d", v, i)
}
index = append(index, idx)
}
}
return p.GetIndex(index)
}
func (p Prim) GetPathExt(path string, typ OpCode) (Prim, error) {
prim, err := p.GetPath(path)
if err != nil {
return InvalidPrim, err
}
if prim.OpCode != typ {
return InvalidPrim, fmt.Errorf("micheline: unexpected type %s at path %v", prim.OpCode, path)
}
return prim, nil
}
func (p Prim) HasIndex(index []int) bool {
prim := p
for _, v := range index {
if v < 0 || len(prim.Args) <= v {
return false
}
prim = prim.Args[v]
}
return true
}
func (p Prim) GetIndex(index []int) (Prim, error) {
prim := p
for _, v := range index {
if v < 0 || len(prim.Args) <= v {
return InvalidPrim, fmt.Errorf("micheline: index %d out of bounds", v)
}
prim = prim.Args[v]
}
return prim, nil
}
func (p Prim) GetIndexExt(index []int, typ OpCode) (Prim, error) {
prim, err := p.GetIndex(index)
if err != nil {
return InvalidPrim, err
}
if prim.OpCode != typ {
return InvalidPrim, fmt.Errorf("micheline: unexpected type %s at path %v", prim.OpCode, index)
}
return prim, nil
}
func (p Prim) Decode(v interface{}) error {
val := reflect.ValueOf(v)
if val.Kind() != reflect.Ptr {
return fmt.Errorf("micheline: non-pointer passed to Decode: %s %s", val.Kind(), val.Type().String())
}
val = reflect.Indirect(val)
if val.Kind() != reflect.Struct {
return fmt.Errorf("micheline: non-struct passed to Decode %s %s", val.Kind(), val.Type().String())
}
return p.unmarshal(val)
}
func (p Prim) unmarshal(val reflect.Value) error {
val = derefValue(val)
if val.CanInterface() && val.Type().Implements(primUnmarshalerType) {
// This is an unmarshaler with a non-pointer receiver,
// so it's likely to be incorrect, but we do what we're told.
return val.Interface().(PrimUnmarshaler).UnmarshalPrim(p)
}
if val.CanAddr() {
pv := val.Addr()
if pv.CanInterface() && pv.Type().Implements(primUnmarshalerType) {
return pv.Interface().(PrimUnmarshaler).UnmarshalPrim(p)
}
}
tinfo, err := getTypeInfo(indirectType(val.Type()))
if err != nil {
return err
}
for _, finfo := range tinfo.fields {
dst := finfo.value(val)
if !dst.IsValid() {
continue
}
if dst.Kind() == reflect.Ptr {
if dst.IsNil() && dst.CanSet() {
dst.Set(reflect.New(dst.Type()))
}
dst = dst.Elem()
}
pp, err := p.GetIndex(finfo.path)
if err != nil {
if finfo.nofail {
continue
}
return err
}
switch finfo.typ {
case T_BYTES:
if dst.CanAddr() {
pv := dst.Addr()
if pv.CanInterface() {
if pv.Type().Implements(binaryUnmarshalerType) {
if err := pv.Interface().(encoding.BinaryUnmarshaler).UnmarshalBinary(pp.Bytes); err != nil {
if !finfo.nofail {
return err
}
}
break
}
if pv.Type().Implements(textUnmarshalerType) {
if err := pv.Interface().(encoding.TextUnmarshaler).UnmarshalText(pp.Bytes); err != nil {
if !finfo.nofail {
return err
}
}
break
}
}
}
buf := make([]byte, len(pp.Bytes))
copy(buf, pp.Bytes)
dst.SetBytes(buf)
case T_STRING:
if dst.CanAddr() {
pv := dst.Addr()
if pv.CanInterface() && pv.Type().Implements(textUnmarshalerType) {
if pp.Bytes != nil {
if err := pv.Interface().(encoding.TextUnmarshaler).UnmarshalText(pp.Bytes); err != nil {
if !finfo.nofail {
return err
}
}
break
}
if err := pv.Interface().(encoding.TextUnmarshaler).UnmarshalText([]byte(pp.String)); err != nil {
if !finfo.nofail {
return err
}
}
break
}
}
dst.SetString(pp.String)
case T_INT, T_NAT:
if dst.CanAddr() {
pv := dst.Addr()
if pv.CanInterface() && pv.Type().Implements(textUnmarshalerType) {
if pp.Int != nil {
if err := pv.Interface().(encoding.TextUnmarshaler).UnmarshalText([]byte(pp.Int.Text(10))); err != nil {
if !finfo.nofail {
return err
}
}
break
}
if err := pv.Interface().(encoding.TextUnmarshaler).UnmarshalText([]byte(pp.String)); err != nil {
if !finfo.nofail {
return err
}
}
break
}
}
switch dst.Type().Kind() {
case reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64:
dst.SetUint(uint64(pp.Int.Int64()))
case reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:
dst.SetInt(pp.Int.Int64())
}
case T_BOOL:
dst.SetBool(pp.OpCode == D_TRUE)
case T_TIMESTAMP:
if pp.Int != nil {
dst.Set(reflect.ValueOf(time.Unix(pp.Int.Int64(), 0).UTC()))
} else {
tm, err := time.Parse(time.RFC3339, pp.String)
if err != nil {
if !finfo.nofail {
return err
}
}
dst.Set(reflect.ValueOf(tm))
}
case T_ADDRESS:
var (
addr tezos.Address
err error
)
if pp.Bytes != nil {
err = addr.Decode(pp.Bytes)
} else {
err = addr.UnmarshalText([]byte(pp.String))
}
if err != nil && !finfo.nofail {
return err
}
dst.Set(reflect.ValueOf(addr))
case T_KEY:
var (
key tezos.Key
err error
)
if pp.Bytes != nil {
err = key.UnmarshalBinary(pp.Bytes)
} else {
err = key.UnmarshalText([]byte(pp.String))
}
if err != nil && !finfo.nofail {
return err
}
dst.Set(reflect.ValueOf(key))
case T_SIGNATURE:
var (
sig tezos.Signature
err error
)
if pp.Bytes != nil {
err = sig.UnmarshalBinary(pp.Bytes)
} else {
err = sig.UnmarshalText([]byte(pp.String))
}
if err != nil && !finfo.nofail {
return err
}
dst.Set(reflect.ValueOf(sig))
case T_CHAIN_ID:
var (
chain tezos.ChainIdHash
err error
)
if pp.Bytes != nil {
err = chain.UnmarshalBinary(pp.Bytes)
} else {
err = chain.UnmarshalText([]byte(pp.String))
}
if err != nil && !finfo.nofail {
return err
}
dst.Set(reflect.ValueOf(chain))
case T_LIST:
styp := dst.Type()
if dst.IsNil() {
dst.Set(reflect.MakeSlice(styp, 0, len(pp.Args)))
}
for idx, ppp := range pp.Args {
sval := reflect.New(styp.Elem())
if sval.Type().Kind() == reflect.Ptr && sval.IsNil() && sval.CanSet() {
sval.Set(reflect.New(sval.Type().Elem()))
}
// decode from value prim
if err := ppp.unmarshal(sval); err != nil && !finfo.nofail {
return err
}
dst.SetLen(idx + 1)
dst.Index(idx).Set(sval.Elem())
}
case T_MAP:
mtyp := dst.Type()
switch mtyp.Key().Kind() {
case reflect.String:
default:
return fmt.Errorf("micheline: only string keys are supported for map %s", finfo.name)
}
if dst.IsNil() {
dst.Set(reflect.MakeMap(mtyp))
}
// process ELT args
for _, ppp := range pp.Args {
// must be an ELT
if ppp.OpCode != D_ELT {
return fmt.Errorf("micheline: expected ELT data for map field %s, got %s",
finfo.name, ppp.Dump())
}
// decode string from ELT key
k, err := NewKey(ppp.Args[0].BuildType(), ppp.Args[0])
if err != nil {
return fmt.Errorf("micheline: cannot convert ELT key for field %s val=%s: %v",
finfo.name, ppp.Args[0].Dump(), err)
}
name := k.String()
// allocate value
mval := reflect.New(mtyp.Elem()).Elem()
if mval.Type().Kind() == reflect.Ptr && mval.IsNil() && mval.CanSet() {
mval.Set(reflect.New(mval.Type().Elem()))
}
// decode from value prim
if err := ppp.Args[1].unmarshal(mval); err != nil && !finfo.nofail {
return err
}
// assign to map
dst.SetMapIndex(reflect.ValueOf(name), mval)
}
default:
return fmt.Errorf("micheline: unsupported prim %#v for struct field %s", pp, finfo.name)
}
}
return nil
}