-
Notifications
You must be signed in to change notification settings - Fork 0
/
decode.go
533 lines (482 loc) · 11.3 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
package tidata
import (
"encoding"
"errors"
"fmt"
"reflect"
"runtime"
"strconv"
"strings"
"github.com/knieriem/text/line"
"github.com/knieriem/text/rc"
)
// An UnmarshalTypeError describes a tidata value that was
// not appropriate for a value of a specific Go type.
type UnmarshalTypeError struct {
Value string // description of tidata value - "bool", "array", "number -5"
Type reflect.Type // type of Go value it could not be assigned to
}
func (e *UnmarshalTypeError) Error() string {
return "tidata: cannot unmarshal " + e.Value + " into Go value of type " + e.Type.String()
}
type Config struct {
Sep string // a string separating key and value, e.g. ":"
MapSym string
KeyToFieldName func(string) string
MultiStringSep string
}
var dfltConfig = Config{
Sep: ":",
MapSym: ":",
KeyToFieldName: func(key string) (field string) {
field = strings.Replace(key, "-", "", -1)
return
},
MultiStringSep: "\n",
}
type decoder struct {
*Config
cur struct {
field string
line int
}
errList line.ErrorList
deferredWork []deferred
}
type Deferred interface {
DeferredWork(arg interface{}) error
}
type DeferredWorkRunner interface {
RunDeferredWork(func(arg interface{}) error) error
}
type deferred struct {
fn func(interface{}) error
line int
field string
}
type Error struct {
Err error
Key string
line int
}
func (e *Error) Line() int {
return e.line
}
func (e *Error) Error() string {
return fmt.Sprintf("tidata: %s: %s", e.Key, e.Err.Error())
}
func (d *decoder) saveError(err error) {
e := &Error{
line: d.cur.line,
Err: err,
Key: d.cur.field,
}
d.errList.Add(e)
}
func (e Elem) Decode(i interface{}, c *Config) (err error) {
v := reflect.ValueOf(i)
if v.Kind() != reflect.Ptr {
err = errors.New("argument is not a pointer to an object")
return
}
v = v.Elem()
d := new(decoder)
defer func() {
if r := recover(); r != nil {
if _, ok := r.(runtime.Error); ok {
panic(r)
}
if e, ok := r.(error); ok {
err = e
} else if s, ok := r.(string); ok {
err = errors.New(s)
} else {
err = errors.New("undefined")
}
err = &Error{
line: d.cur.line,
Err: err,
Key: d.cur.field,
}
}
}()
if c == nil {
c = &dfltConfig
}
d.Config = c
d.decodeItem(v, e)
if d.errList.List != nil {
err = &d.errList
}
return
}
func (d *decoder) deriveKey(el Elem) (key string, err error) {
k := el.Key()
if k == "" {
if el.Text == "" {
err = errors.New("<tab> at beginning of empty line")
} else {
err = errors.New("empty key")
}
return
}
if d.Sep != "" {
if !strings.HasSuffix(k, d.Sep) {
err = errors.New("missing '" + d.Sep + "' in key")
return
}
k = k[:len(k)-len(d.Sep)]
}
key = k
if f := d.KeyToFieldName; f != nil {
key = f(k)
}
return
}
type StructPreprocessor interface {
Preprocess(*Elem) error
}
type Postprocessor interface {
Postprocess() error
}
func (d *decoder) decodeStruct(dest reflect.Value, src Elem) {
var key string
var err error
var anyIndex int
var seenMap reflect.Value
d.cur.line = src.LineNum
t := dest.Type()
if f := dest.FieldByName("SrcLineNum"); f.IsValid() {
f.SetInt(int64(d.cur.line))
}
if f := dest.FieldByName("TidataElem"); f.IsValid() {
f.Set(reflect.ValueOf(&src))
}
if f := dest.FieldByName("TidataSeen"); f.IsValid() {
seenMap = f
}
di := dest.Addr().Interface()
if u, ok := di.(Unmarshaler); ok {
err := u.UnmarshalTidata(src)
if err != nil {
d.saveError(err)
}
return
}
if u, ok := di.(encoding.TextUnmarshaler); ok {
err := u.UnmarshalText([]byte(src.Value()))
if err != nil {
d.saveError(err)
}
return
}
d.cur.field = t.String()
if p, ok := dest.Addr().Interface().(StructPreprocessor); ok {
err = p.Preprocess(&src)
if err != nil {
d.saveError(err)
}
} else {
/* look into Value() if it contains short versions of fields */
v := src.Value()
var pfx []Elem
for _, x := range rc.Tokenize(v) {
eq := strings.Index(x, "=")
el := Elem{LineNum: d.cur.line}
if eq != -1 {
el.Text = x[:eq] + d.Sep + "\t" + x[eq+1:]
} else {
el.Text = x + d.Sep + "\ttrue"
}
pfx = append(pfx, el)
}
if pfx != nil {
src.Children = append(pfx, src.Children...)
}
}
anyIndex = -1
for i, n := 0, t.NumField(); i < n; i++ {
f := t.Field(i)
if k := f.Type.Kind(); k == reflect.Slice || k == reflect.Map {
tag := f.Tag.Get("tidata")
if tag == "any" {
anyIndex = i
break
}
}
}
seenCombined := map[string]bool{}
seen := map[string]bool{}
for i := range src.Children {
el := src.Children[i]
d.cur.line = el.LineNum
d.cur.field = el.Key()
key, err = d.deriveKey(el)
if err != nil {
d.saveError(err)
return
}
if seenCombined[key] {
continue
}
if seen[key] {
d.saveError(errors.New("field defined more than once"))
continue
}
if f, ok := t.FieldByName(key); !ok {
if anyIndex == -1 {
d.saveError(errors.New("field does not exist"))
} else {
d.decodeItem(dest.Field(anyIndex), Elem{LineNum: el.LineNum, Children: src.Children[i:]})
break
}
} else {
v := dest.FieldByIndex(f.Index)
tag := f.Tag.Get("tidata")
// Decide, whether multiple occurences of objects
// with the same key will be `combined', i.e. parsed
// into a single slice of values of the same type.
// This behaviour can be selected using the tag "combine",
// and it will be applied on default, if the field
// is a slice of structs, that don't implement
// a TextUnmarshaler.
combine := false
isSlice := v.Kind() == reflect.Slice
if tag == "combine" {
if !isSlice {
panic("combine attr can be used with slice types only")
}
combine = true
} else if isSlice {
t := v.Type().Elem()
if t.Kind() == reflect.Ptr {
t = t.Elem()
}
var etu encoding.TextUnmarshaler
implTU := reflect.PtrTo(t).Implements(reflect.TypeOf(&etu).Elem())
if t.Kind() == reflect.Struct && !implTU {
combine = true
}
}
if combine {
d.collectItems(v, key, src.Children[i:])
seenCombined[key] = true
d.postProcess(v, el)
continue
}
d.decodeItem(v, el)
seen[key] = true
}
}
if seenMap.IsValid() {
seenMap.Set(reflect.ValueOf(seen))
}
if r, ok := dest.Addr().Interface().(DeferredWorkRunner); ok {
for _, w := range d.deferredWork {
err = r.RunDeferredWork(w.fn)
if err != nil {
e := &Error{
line: w.line,
Err: err,
Key: w.field,
}
d.errList.Add(e)
}
}
d.deferredWork = nil
}
}
func (d *decoder) postProcess(v reflect.Value, src Elem) {
if p, ok := v.Addr().Interface().(Postprocessor); ok {
d.cur.field = src.Key()
d.cur.line = src.LineNum
err := p.Postprocess()
if err != nil {
d.saveError(err)
}
}
}
func (d *decoder) collectItems(v reflect.Value, keyWant string, tail []Elem) {
var found []Elem
for _, el := range tail {
key, err := d.deriveKey(el)
if err != nil {
return
}
if key == keyWant {
found = append(found, el)
}
}
mkslice(v, len(found))
for i, el := range found {
d.decodeItem(v.Index(i), el)
}
}
func mkslice(v reflect.Value, n int) {
if v.Cap() >= n {
v.Set(v.Slice(0, n))
return
}
v.Set(reflect.MakeSlice(v.Type(), n, n))
}
type Unmarshaler interface {
UnmarshalTidata(Elem) error
}
func (d *decoder) decodeItem(v reflect.Value, el Elem) {
d.cur.line = el.LineNum
field := d.cur.field
defer func() {
if p, ok := v.Addr().Interface().(Deferred); ok {
d.deferredWork = append(d.deferredWork, deferred{fn: p.DeferredWork, line: el.LineNum, field: field})
}
}()
vi := v.Addr().Interface()
if u, ok := vi.(Unmarshaler); ok {
err := u.UnmarshalTidata(el)
if err != nil {
d.saveError(err)
}
return
}
if u, ok := vi.(encoding.TextUnmarshaler); ok {
err := u.UnmarshalText([]byte(el.Value()))
if err != nil {
d.saveError(err)
}
return
}
retry:
switch v.Kind() {
case reflect.Ptr:
if v.Type() == reflect.TypeOf(&el) {
v.Set(reflect.ValueOf(&el))
} else {
vObj := reflect.New(v.Type().Elem())
v.Set(vObj)
v = vObj.Elem()
goto retry
}
case reflect.Struct:
d.decodeStruct(v, el)
case reflect.Slice:
sl := reflect.Zero(v.Type())
if n := len(el.Children); n > 0 {
sl = reflect.MakeSlice(v.Type(), n, n)
for i := 0; i < n; i++ {
c := el.Children[i]
d.decodeItem(sl.Index(i), Elem{LineNum: c.LineNum, Text: ".\t" + c.Text, Children: c.Children})
}
} else if s := el.Value(); s != "" {
list := rc.Tokenize(s)
if n = len(list); n > 0 {
sl = reflect.MakeSlice(v.Type(), n, n)
for i := 0; i < n; i++ {
d.decodeItem(sl.Index(i), Elem{LineNum: el.LineNum, Text: ".\t" + list[i]})
}
}
}
v.Set(sl)
case reflect.Map:
d.decodeMap(v, el)
case reflect.String:
val := el.Value()
if val == "" {
val = el.JoinSubElems("", "\t", d.MultiStringSep)
} else if len(el.Children) != 0 {
d.cur.line++
d.saveError(errors.New("wrong depth/inconsistent structure"))
break
}
d.decodeString(v, val)
default:
val := el.Value()
if val == "" {
for i := range el.Children {
val += el.Children[i].Text
}
}
d.decodeString(v, val)
}
d.postProcess(v, el)
}
func (d *decoder) decodeMap(v reflect.Value, src Elem) {
t := v.Type()
if v.IsNil() {
v.Set(reflect.MakeMap(t))
}
n := len(src.Children)
if n == 0 {
return
}
key := reflect.New(t.Key()).Elem()
val := reflect.New(t.Elem()).Elem()
for i := 0; i < n; i++ {
el := src.Children[i]
d.cur.line = el.LineNum
if el.Text == "" {
d.saveError(errors.New("<tab> at beginning of empty line"))
return
}
f := rc.Tokenize(el.Text)
kstr := f[0]
if len(f) == 1 && len(el.Children) == 0 && t.Elem().Kind() == reflect.Bool {
// only allowed for map[T]bool
d.decodeString(key, kstr)
val.SetBool(true)
} else {
if d.MapSym != "" {
if strings.HasSuffix(kstr, d.MapSym) {
kstr = kstr[:len(kstr)-len(d.MapSym)]
} else {
d.saveError(errors.New("missing map symbol '" + d.MapSym + "' in mapping"))
return
}
}
d.cur.field = kstr
d.decodeItem(key, Elem{LineNum: el.LineNum, Text: ".\t" + kstr})
if len(el.Children) == 0 {
d.decodeItem(val, Elem{LineNum: el.LineNum, Text: ".\t" + strings.Join(f[1:], " ")})
} else {
d.decodeItem(val, el)
}
}
v.SetMapIndex(key, val)
key.Set(reflect.Zero(t.Key()))
val.Set(reflect.Zero(t.Elem()))
}
}
func (d *decoder) decodeString(v reflect.Value, s string) {
switch v.Kind() {
default:
d.saveError(errors.New("data type not supported: " + v.Type().String()))
case reflect.String:
v.SetString(s)
case reflect.Bool:
switch s {
case "true", "":
v.SetBool(true)
case "false":
v.SetBool(false)
default:
d.saveError(&UnmarshalTypeError{"bool" + s, v.Type()})
}
case reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:
n, err := strconv.ParseInt(s, 0, 64)
if err != nil || v.OverflowInt(n) {
d.saveError(&UnmarshalTypeError{"number " + s, v.Type()})
}
v.SetInt(n)
case reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:
n, err := strconv.ParseUint(s, 0, 64)
if err != nil || v.OverflowUint(n) {
d.saveError(&UnmarshalTypeError{"number " + s, v.Type()})
}
v.SetUint(n)
case reflect.Float32, reflect.Float64:
n, err := strconv.ParseFloat(s, v.Type().Bits())
if err != nil || v.OverflowFloat(n) {
d.saveError(&UnmarshalTypeError{"number " + s, v.Type()})
}
v.SetFloat(n)
}
}