-
Notifications
You must be signed in to change notification settings - Fork 8
Expand file tree
/
Copy pathvalidate.go
More file actions
234 lines (217 loc) · 7.24 KB
/
Copy pathvalidate.go
File metadata and controls
234 lines (217 loc) · 7.24 KB
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
package raml
import (
"fmt"
"github.com/acronis/go-stacktrace"
)
func (r *RAML) unwrapShape(shape *BaseShape, unwrapCache map[int64]*BaseShape) (*BaseShape, *stacktrace.StackTrace) {
if !shape.unwrapped {
shape = shape.CloneDetached()
us, err := r.UnwrapShape(shape)
if err != nil {
return nil, StacktraceNewWrapped("unwrap shape", err, shape.Location,
stacktrace.WithPosition(&shape.KeyPos),
stacktrace.WithType(StacktraceTypeValidating))
}
_, err = r.FindAndMarkRecursion(us)
if err != nil {
return nil, StacktraceNewWrapped("find recursion", err, shape.Location,
stacktrace.WithPosition(&shape.KeyPos),
stacktrace.WithType(StacktraceTypeValidating))
}
unwrapCache[shape.ID] = us
shape = us
}
return shape, nil
}
func (r *RAML) validateTypes(unwrapCache map[int64]*BaseShape) *stacktrace.StackTrace {
var acc stacktrace.Accumulator
for _, shapes := range r.fragmentTypeDefinitions {
for _, shape := range shapes {
shape, se := r.unwrapShape(shape, unwrapCache)
if se != nil {
acc.Add(se)
continue
}
if err := shape.Check(); err != nil {
acc.Add(StacktraceNewWrapped("check type", err, shape.Location,
stacktrace.WithPosition(&shape.KeyPos),
stacktrace.WithType(StacktraceTypeValidating)))
continue
}
if err := r.validateShapeCommons(shape); err != nil {
acc.Add(StacktraceNewWrapped("validate shape commons", err, shape.Location,
stacktrace.WithPosition(&shape.KeyPos),
stacktrace.WithType(StacktraceTypeValidating)))
continue
}
}
}
return acc.Result()
}
func (r *RAML) validateDomainExtensions(unwrapCache map[int64]*BaseShape) *stacktrace.StackTrace {
var acc stacktrace.Accumulator
for _, item := range r.domainExtensions {
db := item.DefinedBy
if db == nil {
continue
}
if !db.unwrapped {
us, ok := unwrapCache[db.ID]
if !ok {
acc.Add(StacktraceNew("unwrapped shape not found", db.Location,
stacktrace.WithPosition(&db.KeyPos),
stacktrace.WithType(StacktraceTypeValidating)))
continue
}
db = us
}
if err := db.Validate(item.Extension.Value.Raw); err != nil {
acc.Add(StacktraceNewWrapped("check domain extension", err, item.Extension.Location,
stacktrace.WithPosition(&item.Extension.ValuePos),
stacktrace.WithType(StacktraceTypeValidating)))
continue
}
}
return acc.Result()
}
func (r *RAML) ValidateShapes() error {
// Unwrap cache stores the mapping of original IDs to unwrapped shapes
// to ensure the original references (aliases and links) match.
unwrapCache := make(map[int64]*BaseShape)
var acc stacktrace.Accumulator
acc.Add(r.validateTypes(unwrapCache))
acc.Add(r.validateDomainExtensions(unwrapCache))
if st := acc.Result(); st != nil {
return st
}
return nil
}
func (r *RAML) validateObjectShape(s *ObjectShape) error {
for pair := s.Properties.Oldest(); pair != nil; pair = pair.Next() {
base := pair.Value.Base
if err := r.validateShapeCommons(base); err != nil {
return StacktraceNewWrapped("validate property", err, base.Location,
stacktrace.WithPosition(&base.KeyPos), stacktrace.WithInfo("property", pair.Key))
}
}
for pair := s.PatternProperties.Oldest(); pair != nil; pair = pair.Next() {
base := pair.Value.Base
if err := r.validateShapeCommons(base); err != nil {
return StacktraceNewWrapped("validate pattern property", err, base.Location,
stacktrace.WithPosition(&base.KeyPos), stacktrace.WithInfo("property", pair.Key))
}
}
return nil
}
func (r *RAML) validateShapeCommons(s *BaseShape) error {
if err := r.validateShapeFacets(s); err != nil {
return err
}
if err := r.validateExamples(s); err != nil {
return err
}
switch shape := s.Shape.(type) {
case *ObjectShape:
if err := r.validateObjectShape(shape); err != nil {
return fmt.Errorf("validate object shape: %w", err)
}
case *ArrayShape:
if shape.Items != nil {
if err := r.validateShapeCommons(shape.Items); err != nil {
return StacktraceNewWrapped("validate items", err, shape.Base().Location,
stacktrace.WithPosition(&shape.Base().KeyPos))
}
}
case *UnionShape:
for _, item := range shape.AnyOf {
if err := r.validateShapeCommons(item); err != nil {
return StacktraceNewWrapped("validate union item", err, shape.Base().Location,
stacktrace.WithPosition(&shape.Base().KeyPos))
}
}
}
// Validate trait definition shapes
for pair := s.CustomShapeFacetDefinitions.Oldest(); pair != nil; pair = pair.Next() {
facetDef := pair.Value
if err := r.validateShapeCommons(facetDef.Base); err != nil {
return StacktraceNewWrapped("validate custom facet definition", err, facetDef.Base.Location,
stacktrace.WithPosition(&facetDef.Base.KeyPos), stacktrace.WithInfo("facet", pair.Key))
}
}
return nil
}
func (r *RAML) validateExamples(base *BaseShape) error {
if base.Example != nil {
if base.Example.Strict == nil || base.Example.Strict.Value {
if err := base.Validate(base.Example.Data.Value.Raw); err != nil {
return StacktraceNewWrapped("validate example", err, base.Example.Location,
stacktrace.WithPosition(&base.Example.KeyPos))
}
}
}
if base.Examples != nil {
for pair := base.Examples.Map.Oldest(); pair != nil; pair = pair.Next() {
ex := pair.Value
if ex.Strict != nil && !ex.Strict.Value {
continue
}
if err := base.Validate(ex.Data.Value.Raw); err != nil {
return StacktraceNewWrapped("validate example", err, ex.Location,
stacktrace.WithPosition(&ex.KeyPos))
}
}
}
if base.Default != nil {
if err := base.Validate(base.Default.Value.Raw); err != nil {
return StacktraceNewWrapped("validate default", err, base.Default.Location,
stacktrace.WithPosition(&base.Default.ValuePos))
}
}
return nil
}
func (r *RAML) validateShapeFacets(base *BaseShape) error {
// TODO: Doesn't support multiple inheritance.
inherits := base.Inherits
shapeFacetDefs := base.CustomShapeFacetDefinitions
validationFacetDefs := make(map[string]Property)
for {
if len(inherits) == 0 {
break
}
parent := inherits[0]
for pair := parent.CustomShapeFacetDefinitions.Oldest(); pair != nil; pair = pair.Next() {
f := pair.Value
if _, ok := shapeFacetDefs.Get(f.Name); ok {
return StacktraceNew("duplicate custom facet", f.Base.Location,
stacktrace.WithPosition(&f.Base.KeyPos), stacktrace.WithInfo("facet", f.Name))
}
validationFacetDefs[f.Name] = f
}
inherits = parent.Inherits
}
// Validate all unknown facets against facet definitions
shapeFacets := base.CustomShapeFacets
for k, facetDef := range validationFacetDefs {
f, ok := shapeFacets.Get(k)
if !ok {
if facetDef.Required {
return StacktraceNew("required custom facet is missing", base.Location,
stacktrace.WithPosition(&base.KeyPos), stacktrace.WithInfo("facet", k))
}
continue
}
if err := facetDef.Base.Validate(f.Value.Raw); err != nil {
return StacktraceNewWrapped("validate custom facet", err, f.Location,
stacktrace.WithPosition(&f.ValuePos), stacktrace.WithInfo("facet", k))
}
}
// If we encounter an undefined facet - it's an error.
for pair := shapeFacets.Oldest(); pair != nil; pair = pair.Next() {
k, f := pair.Key, pair.Value
if _, ok := validationFacetDefs[k]; !ok {
return StacktraceNew("unknown facet", f.Location, stacktrace.WithPosition(&f.KeyPos),
stacktrace.WithInfo("facet", k))
}
}
return nil
}