-
Notifications
You must be signed in to change notification settings - Fork 52
/
Copy pathdecode.go
690 lines (588 loc) · 14.1 KB
/
decode.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
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
package thrift
import (
"bufio"
"bytes"
"fmt"
"io"
"io/ioutil"
"reflect"
"sync/atomic"
)
// Unmarshal deserializes the thrift data from b to v using to the protocol p.
//
// The function errors if the data in b does not match the type of v.
//
// The function panics if v cannot be converted to a thrift representation.
//
// As an optimization, the value passed in v may be reused across multiple calls
// to Unmarshal, allowing the function to reuse objects referenced by pointer
// fields of struct values. When reusing objects, the application is responsible
// for resetting the state of v before calling Unmarshal again.
func Unmarshal(p Protocol, b []byte, v interface{}) error {
br := bytes.NewReader(b)
pr := p.NewReader(br)
if err := NewDecoder(pr).Decode(v); err != nil {
return err
}
if n := br.Len(); n != 0 {
return fmt.Errorf("unexpected trailing bytes at the end of thrift input: %d", n)
}
return nil
}
type Decoder struct {
r Reader
f flags
}
func NewDecoder(r Reader) *Decoder {
return &Decoder{r: r, f: decoderFlags(r)}
}
func (d *Decoder) Decode(v interface{}) error {
t := reflect.TypeOf(v)
p := reflect.ValueOf(v)
if t.Kind() != reflect.Ptr {
panic("thrift.(*Decoder).Decode: expected pointer type but got " + t.String())
}
t = t.Elem()
p = p.Elem()
cache, _ := decoderCache.Load().(map[typeID]decodeFunc)
decode, _ := cache[makeTypeID(t)]
if decode == nil {
decode = decodeFuncOf(t, make(decodeFuncCache))
newCache := make(map[typeID]decodeFunc, len(cache)+1)
newCache[makeTypeID(t)] = decode
for k, v := range cache {
newCache[k] = v
}
decoderCache.Store(newCache)
}
return decode(d.r, p, d.f)
}
func (d *Decoder) Reset(r Reader) {
d.r = r
d.f = d.f.without(protocolFlags).with(decoderFlags(r))
}
func (d *Decoder) SetStrict(enabled bool) {
if enabled {
d.f = d.f.with(strict)
} else {
d.f = d.f.without(strict)
}
}
func decoderFlags(r Reader) flags {
return flags(r.Protocol().Features() << featuresBitOffset)
}
var decoderCache atomic.Value // map[typeID]decodeFunc
type decodeFunc func(Reader, reflect.Value, flags) error
type decodeFuncCache map[reflect.Type]decodeFunc
func decodeFuncOf(t reflect.Type, seen decodeFuncCache) decodeFunc {
f := seen[t]
if f != nil {
return f
}
switch t.Kind() {
case reflect.Bool:
f = decodeBool
case reflect.Int8:
f = decodeInt8
case reflect.Int16:
f = decodeInt16
case reflect.Int32:
f = decodeInt32
case reflect.Int64, reflect.Int:
f = decodeInt64
case reflect.Float32, reflect.Float64:
f = decodeFloat64
case reflect.String:
f = decodeString
case reflect.Slice:
if t.Elem().Kind() == reflect.Uint8 { // []byte
f = decodeBytes
} else {
f = decodeFuncSliceOf(t, seen)
}
case reflect.Map:
f = decodeFuncMapOf(t, seen)
case reflect.Struct:
f = decodeFuncStructOf(t, seen)
case reflect.Ptr:
f = decodeFuncPtrOf(t, seen)
default:
panic("type cannot be decoded in thrift: " + t.String())
}
seen[t] = f
return f
}
func decodeBool(r Reader, v reflect.Value, _ flags) error {
b, err := r.ReadBool()
if err != nil {
return err
}
v.SetBool(b)
return nil
}
func decodeInt8(r Reader, v reflect.Value, _ flags) error {
i, err := r.ReadInt8()
if err != nil {
return err
}
v.SetInt(int64(i))
return nil
}
func decodeInt16(r Reader, v reflect.Value, _ flags) error {
i, err := r.ReadInt16()
if err != nil {
return err
}
v.SetInt(int64(i))
return nil
}
func decodeInt32(r Reader, v reflect.Value, _ flags) error {
i, err := r.ReadInt32()
if err != nil {
return err
}
v.SetInt(int64(i))
return nil
}
func decodeInt64(r Reader, v reflect.Value, _ flags) error {
i, err := r.ReadInt64()
if err != nil {
return err
}
v.SetInt(int64(i))
return nil
}
func decodeFloat64(r Reader, v reflect.Value, _ flags) error {
f, err := r.ReadFloat64()
if err != nil {
return err
}
v.SetFloat(f)
return nil
}
func decodeString(r Reader, v reflect.Value, _ flags) error {
s, err := r.ReadString()
if err != nil {
return err
}
v.SetString(s)
return nil
}
func decodeBytes(r Reader, v reflect.Value, _ flags) error {
b, err := r.ReadBytes()
if err != nil {
return err
}
v.SetBytes(b)
return nil
}
func decodeFuncSliceOf(t reflect.Type, seen decodeFuncCache) decodeFunc {
elem := t.Elem()
typ := TypeOf(elem)
dec := decodeFuncOf(elem, seen)
return func(r Reader, v reflect.Value, flags flags) error {
l, err := r.ReadList()
if err != nil {
return err
}
// Sometimes the list type is set to TRUE when the list contains only
// TRUE values. Thrift does not seem to optimize the encoding by
// omitting the boolean values that are known to all be TRUE, we still
// need to decode them.
switch l.Type {
case TRUE:
l.Type = BOOL
}
// TODO: implement type conversions?
if typ != l.Type {
if flags.have(strict) {
return &TypeMismatch{item: "list item", Expect: typ, Found: l.Type}
}
return nil
}
v.Set(reflect.MakeSlice(t, int(l.Size), int(l.Size)))
flags = flags.only(decodeFlags)
for i := 0; i < int(l.Size); i++ {
if err := dec(r, v.Index(i), flags); err != nil {
return with(dontExpectEOF(err), &decodeErrorList{cause: l, index: i})
}
}
return nil
}
}
func decodeFuncMapOf(t reflect.Type, seen decodeFuncCache) decodeFunc {
key, elem := t.Key(), t.Elem()
if elem.Size() == 0 { // map[?]struct{}
return decodeFuncMapAsSetOf(t, seen)
}
mapType := reflect.MapOf(key, elem)
keyZero := reflect.Zero(key)
elemZero := reflect.Zero(elem)
keyType := TypeOf(key)
elemType := TypeOf(elem)
decodeKey := decodeFuncOf(key, seen)
decodeElem := decodeFuncOf(elem, seen)
return func(r Reader, v reflect.Value, flags flags) error {
m, err := r.ReadMap()
if err != nil {
return err
}
v.Set(reflect.MakeMapWithSize(mapType, int(m.Size)))
if m.Size == 0 { // empty map
return nil
}
// TODO: implement type conversions?
if keyType != m.Key {
if flags.have(strict) {
return &TypeMismatch{item: "map key", Expect: keyType, Found: m.Key}
}
return nil
}
if elemType != m.Value {
if flags.have(strict) {
return &TypeMismatch{item: "map value", Expect: elemType, Found: m.Value}
}
return nil
}
tmpKey := reflect.New(key).Elem()
tmpElem := reflect.New(elem).Elem()
flags = flags.only(decodeFlags)
for i := 0; i < int(m.Size); i++ {
if err := decodeKey(r, tmpKey, flags); err != nil {
return with(dontExpectEOF(err), &decodeErrorMap{cause: m, index: i})
}
if err := decodeElem(r, tmpElem, flags); err != nil {
return with(dontExpectEOF(err), &decodeErrorMap{cause: m, index: i})
}
v.SetMapIndex(tmpKey, tmpElem)
tmpKey.Set(keyZero)
tmpElem.Set(elemZero)
}
return nil
}
}
func decodeFuncMapAsSetOf(t reflect.Type, seen decodeFuncCache) decodeFunc {
key, elem := t.Key(), t.Elem()
keyZero := reflect.Zero(key)
elemZero := reflect.Zero(elem)
typ := TypeOf(key)
dec := decodeFuncOf(key, seen)
return func(r Reader, v reflect.Value, flags flags) error {
s, err := r.ReadSet()
if err != nil {
return err
}
// See decodeFuncSliceOf for details about why this type conversion
// needs to be done.
switch s.Type {
case TRUE:
s.Type = BOOL
}
v.Set(reflect.MakeMapWithSize(t, int(s.Size)))
if s.Size == 0 {
return nil
}
// TODO: implement type conversions?
if typ != s.Type {
if flags.have(strict) {
return &TypeMismatch{item: "list item", Expect: typ, Found: s.Type}
}
return nil
}
tmp := reflect.New(key).Elem()
flags = flags.only(decodeFlags)
for i := 0; i < int(s.Size); i++ {
if err := dec(r, tmp, flags); err != nil {
return with(dontExpectEOF(err), &decodeErrorSet{cause: s, index: i})
}
v.SetMapIndex(tmp, elemZero)
tmp.Set(keyZero)
}
return nil
}
}
type structDecoder struct {
fields []structDecoderField
union []int
minID int16
zero reflect.Value
required []uint64
}
func (dec *structDecoder) decode(r Reader, v reflect.Value, flags flags) error {
flags = flags.only(decodeFlags)
coalesceBoolFields := flags.have(coalesceBoolFields)
lastField := reflect.Value{}
union := len(dec.union) > 0
seen := make([]uint64, 1)
if len(dec.required) > len(seen) {
seen = make([]uint64, len(dec.required))
}
err := readStruct(r, func(r Reader, f Field) error {
i := int(f.ID) - int(dec.minID)
if i < 0 || i >= len(dec.fields) || dec.fields[i].decode == nil {
return skipField(r, f)
}
field := &dec.fields[i]
seen[i/64] |= 1 << (i % 64)
// TODO: implement type conversions?
if f.Type != field.typ && !(f.Type == TRUE && field.typ == BOOL) {
if flags.have(strict) {
return &TypeMismatch{item: "field value", Expect: field.typ, Found: f.Type}
}
return nil
}
x := v
for _, i := range field.index {
if x.Kind() == reflect.Ptr {
x = x.Elem()
}
if x = x.Field(i); x.Kind() == reflect.Ptr {
if x.IsNil() {
x.Set(reflect.New(x.Type().Elem()))
}
}
}
if union {
v.Set(dec.zero)
}
lastField = x
if coalesceBoolFields && (f.Type == TRUE || f.Type == FALSE) {
for x.Kind() == reflect.Ptr {
if x.IsNil() {
x.Set(reflect.New(x.Type().Elem()))
}
x = x.Elem()
}
x.SetBool(f.Type == TRUE)
return nil
}
return field.decode(r, x, flags.with(field.flags))
})
if err != nil {
return err
}
for i, required := range dec.required {
if mask := required & seen[i]; mask != required {
i *= 64
for (mask & 1) != 0 {
mask >>= 1
i++
}
field := &dec.fields[i]
return &MissingField{Field: Field{ID: field.id, Type: field.typ}}
}
}
if union && lastField.IsValid() {
v.FieldByIndex(dec.union).Set(lastField.Addr())
}
return nil
}
type structDecoderField struct {
index []int
id int16
flags flags
typ Type
decode decodeFunc
}
func decodeFuncStructOf(t reflect.Type, seen decodeFuncCache) decodeFunc {
dec := &structDecoder{
zero: reflect.Zero(t),
}
decode := dec.decode
seen[t] = decode
fields := make([]structDecoderField, 0, t.NumField())
forEachStructField(t, nil, func(f structField) {
if f.flags.have(union) {
dec.union = f.index
} else {
fields = append(fields, structDecoderField{
index: f.index,
id: f.id,
flags: f.flags,
typ: TypeOf(f.typ),
decode: decodeFuncStructFieldOf(f, seen),
})
}
})
minID := int16(0)
maxID := int16(0)
for _, f := range fields {
if f.id < minID || minID == 0 {
minID = f.id
}
if f.id > maxID {
maxID = f.id
}
}
dec.fields = make([]structDecoderField, (maxID-minID)+1)
dec.minID = minID
dec.required = make([]uint64, len(fields)/64+1)
for _, f := range fields {
i := f.id - minID
p := dec.fields[i]
if p.decode != nil {
panic(fmt.Errorf("thrift struct field id %d is present multiple times in %s with types %s and %s", f.id, t, p.typ, f.typ))
}
dec.fields[i] = f
if f.flags.have(required) {
dec.required[i/64] |= 1 << (i % 64)
}
}
return decode
}
func decodeFuncStructFieldOf(f structField, seen decodeFuncCache) decodeFunc {
if f.flags.have(enum) {
switch f.typ.Kind() {
case reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:
return decodeInt32
}
}
return decodeFuncOf(f.typ, seen)
}
func decodeFuncPtrOf(t reflect.Type, seen decodeFuncCache) decodeFunc {
elem := t.Elem()
decode := decodeFuncOf(t.Elem(), seen)
return func(r Reader, v reflect.Value, f flags) error {
if v.IsNil() {
v.Set(reflect.New(elem))
}
return decode(r, v.Elem(), f)
}
}
func readBinary(r Reader, f func(io.Reader) error) error {
n, err := r.ReadLength()
if err != nil {
return err
}
return dontExpectEOF(f(io.LimitReader(r.Reader(), int64(n))))
}
func readList(r Reader, f func(Reader, Type) error) error {
l, err := r.ReadList()
if err != nil {
return err
}
for i := 0; i < int(l.Size); i++ {
if err := f(r, l.Type); err != nil {
return with(dontExpectEOF(err), &decodeErrorList{cause: l, index: i})
}
}
return nil
}
func readSet(r Reader, f func(Reader, Type) error) error {
s, err := r.ReadSet()
if err != nil {
return err
}
for i := 0; i < int(s.Size); i++ {
if err := f(r, s.Type); err != nil {
return with(dontExpectEOF(err), &decodeErrorSet{cause: s, index: i})
}
}
return nil
}
func readMap(r Reader, f func(Reader, Type, Type) error) error {
m, err := r.ReadMap()
if err != nil {
return err
}
for i := 0; i < int(m.Size); i++ {
if err := f(r, m.Key, m.Value); err != nil {
return with(dontExpectEOF(err), &decodeErrorMap{cause: m, index: i})
}
}
return nil
}
func readStruct(r Reader, f func(Reader, Field) error) error {
lastFieldID := int16(0)
numFields := 0
for {
x, err := r.ReadField()
if err != nil {
if numFields > 0 {
err = dontExpectEOF(err)
}
return err
}
if x.Type == STOP {
return nil
}
if x.Delta {
x.ID += lastFieldID
x.Delta = false
}
if err := f(r, x); err != nil {
return with(dontExpectEOF(err), &decodeErrorField{cause: x})
}
lastFieldID = x.ID
numFields++
}
}
func skip(r Reader, t Type) error {
var err error
switch t {
case TRUE, FALSE:
_, err = r.ReadBool()
case I8:
_, err = r.ReadInt8()
case I16:
_, err = r.ReadInt16()
case I32:
_, err = r.ReadInt32()
case I64:
_, err = r.ReadInt64()
case DOUBLE:
_, err = r.ReadFloat64()
case BINARY:
err = skipBinary(r)
case LIST:
err = skipList(r)
case SET:
err = skipSet(r)
case MAP:
err = skipMap(r)
case STRUCT:
err = skipStruct(r)
default:
return fmt.Errorf("skipping unsupported thrift type %d", t)
}
return err
}
func skipBinary(r Reader) error {
n, err := r.ReadLength()
if err != nil {
return err
}
if n == 0 {
return nil
}
switch x := r.Reader().(type) {
case *bufio.Reader:
_, err = x.Discard(int(n))
default:
_, err = io.CopyN(ioutil.Discard, x, int64(n))
}
return dontExpectEOF(err)
}
func skipList(r Reader) error {
return readList(r, skip)
}
func skipSet(r Reader) error {
return readSet(r, skip)
}
func skipMap(r Reader) error {
return readMap(r, func(r Reader, k, v Type) error {
if err := skip(r, k); err != nil {
return dontExpectEOF(err)
}
if err := skip(r, v); err != nil {
return dontExpectEOF(err)
}
return nil
})
}
func skipStruct(r Reader) error {
return readStruct(r, skipField)
}
func skipField(r Reader, f Field) error {
return skip(r, f.Type)
}