forked from hamba/avro
-
Notifications
You must be signed in to change notification settings - Fork 0
/
schema_parse.go
596 lines (493 loc) · 14.4 KB
/
schema_parse.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
package avro
import (
"errors"
"fmt"
"math"
"os"
"path/filepath"
"strings"
jsoniter "github.com/json-iterator/go"
"github.com/mitchellh/mapstructure"
)
// DefaultSchemaCache is the default cache for schemas.
var DefaultSchemaCache = &SchemaCache{}
// SkipNameValidation sets whether to skip name validation.
// Avro spec incurs a strict naming convention for names and aliases, however official Avro tools do not follow that
// More info:
// https://lists.apache.org/thread/39v98os6wdpyr6w31xdkz0yzol51fsrr
// https://github.com/apache/avro/pull/1995
var SkipNameValidation = false
// Parse parses a schema string.
func Parse(schema string) (Schema, error) {
return ParseBytes([]byte(schema))
}
// ParseWithCache parses a schema string using the given namespace and schema cache.
func ParseWithCache(schema, namespace string, cache *SchemaCache) (Schema, error) {
return ParseBytesWithCache([]byte(schema), namespace, cache)
}
// MustParse parses a schema string, panicking if there is an error.
func MustParse(schema string) Schema {
parsed, err := Parse(schema)
if err != nil {
panic(err)
}
return parsed
}
// ParseFiles parses the schemas in the files, in the order they appear, returning the last schema.
//
// This is useful when your schemas rely on other schemas.
func ParseFiles(paths ...string) (Schema, error) {
var schema Schema
for _, path := range paths {
s, err := os.ReadFile(filepath.Clean(path))
if err != nil {
return nil, err
}
schema, err = Parse(string(s))
if err != nil {
return nil, err
}
}
return schema, nil
}
// ParseBytes parses a schema byte slice.
func ParseBytes(schema []byte) (Schema, error) {
return ParseBytesWithCache(schema, "", DefaultSchemaCache)
}
// ParseBytesWithCache parses a schema byte slice using the given namespace and schema cache.
func ParseBytesWithCache(schema []byte, namespace string, cache *SchemaCache) (Schema, error) {
var json any
if err := jsoniter.Unmarshal(schema, &json); err != nil {
json = string(schema)
}
seen := seenCache{}
s, err := parseType(namespace, json, seen, cache)
if err != nil {
return nil, err
}
return derefSchema(s), nil
}
func parseType(namespace string, v any, seen seenCache, cache *SchemaCache) (Schema, error) {
switch val := v.(type) {
case nil:
return &NullSchema{}, nil
case string:
return parsePrimitiveType(namespace, val, cache)
case map[string]any:
return parseComplexType(namespace, val, seen, cache)
case []any:
return parseUnion(namespace, val, seen, cache)
}
return nil, fmt.Errorf("avro: unknown type: %v", v)
}
func parsePrimitiveType(namespace, s string, cache *SchemaCache) (Schema, error) {
typ := Type(s)
switch typ {
case Null:
return &NullSchema{}, nil
case String, Bytes, Int, Long, Float, Double, Boolean:
return parsePrimitive(typ, nil)
default:
schema := cache.Get(fullName(namespace, s))
if schema != nil {
return schema, nil
}
return nil, fmt.Errorf("avro: unknown type: %s", s)
}
}
func parseComplexType(namespace string, m map[string]any, seen seenCache, cache *SchemaCache) (Schema, error) {
if val, ok := m["type"].([]any); ok {
return parseUnion(namespace, val, seen, cache)
}
str, ok := m["type"].(string)
if !ok {
return nil, fmt.Errorf("avro: unknown type: %+v", m)
}
typ := Type(str)
switch typ {
case Null:
return &NullSchema{}, nil
case String, Bytes, Int, Long, Float, Double, Boolean:
return parsePrimitive(typ, m)
case Record, Error:
return parseRecord(typ, namespace, m, seen, cache)
case Enum:
return parseEnum(namespace, m, seen, cache)
case Array:
return parseArray(namespace, m, seen, cache)
case Map:
return parseMap(namespace, m, seen, cache)
case Fixed:
return parseFixed(namespace, m, seen, cache)
default:
return parseType(namespace, string(typ), seen, cache)
}
}
type primitiveSchema struct {
LogicalType string `mapstructure:"logicalType"`
Precision int `mapstructure:"precision"`
Scale int `mapstructure:"scale"`
Props map[string]any `mapstructure:",remain"`
}
func parsePrimitive(typ Type, m map[string]any) (Schema, error) {
if m == nil {
return NewPrimitiveSchema(typ, nil), nil
}
var (
p primitiveSchema
meta mapstructure.Metadata
)
if err := decodeMap(m, &p, &meta); err != nil {
return nil, fmt.Errorf("avro: error decoding primitive: %w", err)
}
var logical LogicalSchema
if p.LogicalType != "" {
logical = parsePrimitiveLogicalType(typ, p.LogicalType, p.Precision, p.Scale)
}
return NewPrimitiveSchema(typ, logical, WithProps(p.Props)), nil
}
func parsePrimitiveLogicalType(typ Type, lt string, prec, scale int) LogicalSchema {
ltyp := LogicalType(lt)
if (typ == String && ltyp == UUID) ||
(typ == Int && ltyp == Date) ||
(typ == Int && ltyp == TimeMillis) ||
(typ == Long && ltyp == TimeMicros) ||
(typ == Long && ltyp == TimestampMillis) ||
(typ == Long && ltyp == TimestampMicros) ||
(typ == Long && ltyp == LocalTimestampMillis) ||
(typ == Long && ltyp == LocalTimestampMicros) {
return NewPrimitiveLogicalSchema(ltyp)
}
if typ == Bytes && ltyp == Decimal {
return parseDecimalLogicalType(-1, prec, scale)
}
return nil
}
type recordSchema struct {
Type string `mapstructure:"type"`
Name string `mapstructure:"name"`
Namespace string `mapstructure:"namespace"`
Aliases []string `mapstructure:"aliases"`
Doc string `mapstructure:"doc"`
Fields []map[string]any `mapstructure:"fields"`
Props map[string]any `mapstructure:",remain"`
}
func parseRecord(typ Type, namespace string, m map[string]any, seen seenCache, cache *SchemaCache) (Schema, error) {
var (
r recordSchema
meta mapstructure.Metadata
)
if err := decodeMap(m, &r, &meta); err != nil {
return nil, fmt.Errorf("avro: error decoding record: %w", err)
}
if err := checkParsedName(r.Name); err != nil {
return nil, err
}
if r.Namespace == "" {
r.Namespace = namespace
}
if !hasKey(meta.Keys, "fields") {
return nil, errors.New("avro: record must have an array of fields")
}
fields := make([]*Field, len(r.Fields))
var (
rec *RecordSchema
err error
)
switch typ {
case Record:
rec, err = NewRecordSchema(r.Name, r.Namespace, fields,
WithAliases(r.Aliases), WithDoc(r.Doc), WithProps(r.Props),
)
case Error:
rec, err = NewErrorRecordSchema(r.Name, r.Namespace, fields,
WithAliases(r.Aliases), WithDoc(r.Doc), WithProps(r.Props),
)
}
if err != nil {
return nil, err
}
if err = seen.Add(rec.FullName()); err != nil {
return nil, err
}
ref := NewRefSchema(rec)
cache.Add(rec.FullName(), ref)
for _, alias := range rec.Aliases() {
cache.Add(alias, ref)
}
for i, f := range r.Fields {
field, err := parseField(rec.namespace, f, seen, cache)
if err != nil {
return nil, err
}
fields[i] = field
}
return rec, nil
}
type fieldSchema struct {
Name string `mapstructure:"name"`
Aliases []string `mapstructure:"aliases"`
Type any `mapstructure:"type"`
Doc string `mapstructure:"doc"`
Default any `mapstructure:"default"`
Order Order `mapstructure:"order"`
Props map[string]any `mapstructure:",remain"`
}
func parseField(namespace string, m map[string]any, seen seenCache, cache *SchemaCache) (*Field, error) {
var (
f fieldSchema
meta mapstructure.Metadata
)
if err := decodeMap(m, &f, &meta); err != nil {
return nil, fmt.Errorf("avro: error decoding field: %w", err)
}
if err := checkParsedName(f.Name); err != nil {
return nil, err
}
if !hasKey(meta.Keys, "type") {
return nil, errors.New("avro: field requires a type")
}
typ, err := parseType(namespace, f.Type, seen, cache)
if err != nil {
return nil, err
}
if !hasKey(meta.Keys, "default") {
f.Default = NoDefault
}
field, err := NewField(f.Name, typ,
WithDefault(f.Default), WithAliases(f.Aliases), WithDoc(f.Doc), WithOrder(f.Order), WithProps(f.Props),
)
if err != nil {
return nil, err
}
return field, nil
}
type enumSchema struct {
Name string `mapstructure:"name"`
Namespace string `mapstructure:"namespace"`
Aliases []string `mapstructure:"aliases"`
Type string `mapstructure:"type"`
Doc string `mapstructure:"doc"`
Symbols []string `mapstructure:"symbols"`
Default string `mapstructure:"default"`
Props map[string]any `mapstructure:",remain"`
}
func parseEnum(namespace string, m map[string]any, seen seenCache, cache *SchemaCache) (Schema, error) {
var (
e enumSchema
meta mapstructure.Metadata
)
if err := decodeMap(m, &e, &meta); err != nil {
return nil, fmt.Errorf("avro: error decoding enum: %w", err)
}
if err := checkParsedName(e.Name); err != nil {
return nil, err
}
if e.Namespace == "" {
e.Namespace = namespace
}
enum, err := NewEnumSchema(e.Name, e.Namespace, e.Symbols,
WithDefault(e.Default), WithAliases(e.Aliases), WithDoc(e.Doc), WithProps(e.Props),
)
if err != nil {
return nil, err
}
if err = seen.Add(enum.FullName()); err != nil {
return nil, err
}
ref := NewRefSchema(enum)
cache.Add(enum.FullName(), ref)
for _, alias := range enum.Aliases() {
cache.Add(alias, enum)
}
return enum, nil
}
type arraySchema struct {
Items any `mapstructure:"items"`
Props map[string]any `mapstructure:",remain"`
}
func parseArray(namespace string, m map[string]any, seen seenCache, cache *SchemaCache) (Schema, error) {
var (
a arraySchema
meta mapstructure.Metadata
)
if err := decodeMap(m, &a, &meta); err != nil {
return nil, fmt.Errorf("avro: error decoding array: %w", err)
}
if !hasKey(meta.Keys, "items") {
return nil, errors.New("avro: array must have an items key")
}
schema, err := parseType(namespace, a.Items, seen, cache)
if err != nil {
return nil, err
}
return NewArraySchema(schema, WithProps(a.Props)), nil
}
type mapSchema struct {
Values any `mapstructure:"values"`
Props map[string]any `mapstructure:",remain"`
}
func parseMap(namespace string, m map[string]any, seen seenCache, cache *SchemaCache) (Schema, error) {
var (
ms mapSchema
meta mapstructure.Metadata
)
if err := decodeMap(m, &ms, &meta); err != nil {
return nil, fmt.Errorf("avro: error decoding map: %w", err)
}
if !hasKey(meta.Keys, "values") {
return nil, errors.New("avro: map must have an values key")
}
schema, err := parseType(namespace, ms.Values, seen, cache)
if err != nil {
return nil, err
}
return NewMapSchema(schema, WithProps(ms.Props)), nil
}
func parseUnion(namespace string, v []any, seen seenCache, cache *SchemaCache) (Schema, error) {
var err error
types := make([]Schema, len(v))
for i := range v {
types[i], err = parseType(namespace, v[i], seen, cache)
if err != nil {
return nil, err
}
}
return NewUnionSchema(types)
}
type fixedSchema struct {
Name string `mapstructure:"name"`
Namespace string `mapstructure:"namespace"`
Aliases []string `mapstructure:"aliases"`
Type string `mapstructure:"type"`
Size int `mapstructure:"size"`
LogicalType string `mapstructure:"logicalType"`
Precision int `mapstructure:"precision"`
Scale int `mapstructure:"scale"`
Props map[string]any `mapstructure:",remain"`
}
func parseFixed(namespace string, m map[string]any, seen seenCache, cache *SchemaCache) (Schema, error) {
var (
f fixedSchema
meta mapstructure.Metadata
)
if err := decodeMap(m, &f, &meta); err != nil {
return nil, fmt.Errorf("avro: error decoding fixed: %w", err)
}
if err := checkParsedName(f.Name); err != nil {
return nil, err
}
if f.Namespace == "" {
f.Namespace = namespace
}
if !hasKey(meta.Keys, "size") {
return nil, errors.New("avro: fixed must have a size")
}
var logical LogicalSchema
if f.LogicalType != "" {
logical = parseFixedLogicalType(f.Size, f.LogicalType, f.Precision, f.Scale)
}
fixed, err := NewFixedSchema(f.Name, f.Namespace, f.Size, logical, WithAliases(f.Aliases), WithProps(f.Props))
if err != nil {
return nil, err
}
if err = seen.Add(fixed.FullName()); err != nil {
return nil, err
}
ref := NewRefSchema(fixed)
cache.Add(fixed.FullName(), ref)
for _, alias := range fixed.Aliases() {
cache.Add(alias, fixed)
}
return fixed, nil
}
func parseFixedLogicalType(size int, lt string, prec, scale int) LogicalSchema {
ltyp := LogicalType(lt)
switch {
case ltyp == Duration && size == 12:
return NewPrimitiveLogicalSchema(Duration)
case ltyp == Decimal:
return parseDecimalLogicalType(size, prec, scale)
}
return nil
}
func parseDecimalLogicalType(size, prec, scale int) LogicalSchema {
if prec <= 0 {
return nil
}
if size > 0 {
maxPrecision := int(math.Round(math.Floor(math.Log10(2) * (8*float64(size) - 1))))
if prec > maxPrecision {
return nil
}
}
if scale < 0 {
return nil
}
// Scale may not be bigger than precision
if scale > prec {
return nil
}
return NewDecimalLogicalSchema(prec, scale)
}
func fullName(namespace, name string) string {
if len(namespace) == 0 || strings.ContainsRune(name, '.') {
return name
}
return namespace + "." + name
}
func checkParsedName(name string) error {
if name == "" {
return errors.New("avro: non-empty name key required")
}
return nil
}
func hasKey(keys []string, k string) bool {
for _, key := range keys {
if key == k {
return true
}
}
return false
}
func decodeMap(in, v any, meta *mapstructure.Metadata) error {
cfg := &mapstructure.DecoderConfig{
ZeroFields: true,
Metadata: meta,
Result: v,
}
decoder, _ := mapstructure.NewDecoder(cfg)
return decoder.Decode(in)
}
func derefSchema(schema Schema) Schema {
seen := map[string]struct{}{}
return walkSchema(schema, func(schema Schema) Schema {
if ns, ok := schema.(NamedSchema); ok {
if _, hasSeen := seen[ns.FullName()]; hasSeen {
// This NamedSchema has been seen in this run, it needs
// to be turned into a reference. It is possible it was
// dereferenced in a previous run.
return NewRefSchema(ns)
}
seen[ns.FullName()] = struct{}{}
return schema
}
ref, isRef := schema.(*RefSchema)
if !isRef {
return schema
}
if _, haveSeen := seen[ref.Schema().FullName()]; !haveSeen {
seen[ref.Schema().FullName()] = struct{}{}
return ref.Schema()
}
return schema
})
}
type seenCache map[string]struct{}
func (c seenCache) Add(name string) error {
if _, ok := c[name]; ok {
return fmt.Errorf("duplicate name %q", name)
}
c[name] = struct{}{}
return nil
}