-
Notifications
You must be signed in to change notification settings - Fork 4
/
check.go
391 lines (346 loc) · 10.3 KB
/
check.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
package denada
import "fmt"
import "regexp"
import "log"
import "github.com/bitly/go-simplejson"
import "github.com/xeipuuv/gojsonschema"
func Check(input ElementList, grammar ElementList, diag bool) error {
context := RootContext(grammar)
return CheckContents(input, grammar, diag, "", "", context)
}
type matchInfo struct {
count int
rule RuleInfo
desc string
}
func CheckContents(input ElementList, grammar ElementList, diag bool,
prefix string, parentRule string, context RuleContext) error {
if len(grammar) == 0 && len(input) != 0 {
return fmt.Errorf("Failure: No rules to match these elements %v (in context %v)",
input, context)
}
// Initialize data associated with rule matching
counts := map[string]*matchInfo{}
// Loop over grammar rules and record counts information
for _, g := range grammar {
// Make sure grammar element has a (rule) description
if g.Description == "" {
return fmt.Errorf("Grammar element %s has no description", g.String())
}
// Parse the rule information from the description
rule, err := ParseRule(g.Description, ChildContext(g.Contents, &context))
// If there is an error in the rule description, add an error and
// skip this grammar element
if err != nil {
return fmt.Errorf("Error in rule description: %v", err)
}
mi, exists := counts[rule.Name]
if exists {
if rule.Name != mi.rule.Name || rule.Cardinality != mi.rule.Cardinality {
return fmt.Errorf("Unmatching rules with same name: %s vs %s",
g.Description, mi.desc)
}
} else {
counts[rule.Name] = &matchInfo{count: 0, rule: rule, desc: g.Description}
}
/*
// Also initialize the named contexts if this is a definition
if g.isDefinition() {
// First, construct the fully qualified name for this definition's rule
path := parentRule + "." + rule.Name
if parentRule == "" {
path = rule.Name
}
// Check to see if another rule has this same name (possible because of
// the idiomatic use of multiple rules with the same name indicating an
// or relationship)
ctxt, exists := context[path]
if exists {
context[path] = append(ctxt, grammar...)
} else {
context[path] = grammar
}
}
*/
}
// Now, loop over all the actual input elements and see if they match
// any of the rules
for _, in := range input {
var likely error = nil
ierrs := []error{}
for _, g := range grammar {
// Parse the rule information from the description (ignore error
// because we already checked that)
rule, _ := ParseRule(g.Description, ChildContext(g.Contents, &context))
path := parentRule + "." + rule.Name
if parentRule == "" {
path = rule.Name
}
ematch := matchElement(in, g, rule.Context.This, diag, prefix,
path, rule.Context)
if ematch == nil {
// A match was found, so increment the count for this particular
// grammar rule
counts[rule.Name].count++
// Then check to see if this input has matched any previous rules
// If not, then choose this match. This implies that the first
// rule to match is the one that is chosen
if in.rule == "" {
in.rulepath = path
in.rule = rule.Name
// If not, indicate what rule this input matched
if diag {
log.Printf("%sInput %s matched %s (path: %s)",
prefix, in.String(), rule.Name, in.rulepath)
}
}
} else {
if diag {
log.Printf("%sInput %s did not match %s because\n%s", prefix, in.String(),
rule.Name, ematch.Error())
}
if len(grammar) == 1 {
return ematch
}
if len(in.Qualifiers) == 1 && len(g.Qualifiers) == 1 &&
in.Qualifiers[0] == g.Qualifiers[0] {
likely = ematch
}
if in.Name == g.Name {
likely = ematch
}
ierrs = append(ierrs, ematch)
}
}
if in.rule == "" {
if likely == nil {
if len(ierrs) == 0 {
return fmt.Errorf("No match for element %v (empty rules?!?)", in)
} else {
return fmt.Errorf("No match for element %v because %v",
in, listToError(ierrs))
}
} else {
return likely
}
}
}
// Check to make sure that all rules were matched the correct number
// of times.
for _, mi := range counts {
rerrs := []error{}
err := mi.rule.checkCount(mi.count)
if err != nil {
rerrs = append(rerrs, err)
}
if len(rerrs) > 0 {
return listToError(rerrs)
}
}
return nil
}
func matchString(input string, grammar string) bool {
if grammar == "_" {
return true
}
matched, err := regexp.MatchString(grammar, input)
if err == nil && matched {
return true
}
return false
}
func matchQualifiers(input *Element, grammar *Element) bool {
imatch := make([]bool, len(input.Qualifiers))
for _, g := range grammar.Qualifiers {
count := 0
rule, err := ParseRuleName(g)
if err != nil {
log.Printf("Error parsing rule information in qualifier '%s': %v", g, err)
return false
}
for i, in := range input.Qualifiers {
matched := matchString(in, rule.Name)
if matched {
imatch[i] = true
count++
}
}
// Check to see if the correct number of matches were found for this qualifier
err = rule.checkCount(count)
if err != nil {
// If not, this is not a match
return false
}
}
// Now check to make sure every qualifier on the input element had a match
for i, _ := range input.Qualifiers {
if !imatch[i] {
// This qualifier on the input element was never matched
return false
}
}
return true
}
func matchModifications(input *Element, grammar *Element, diag bool) bool {
// Create a map to keep track of which modification keys on the input
// element find a match
imatch := map[string]bool{}
for k, _ := range input.Modifications {
imatch[k] = false
}
// Now loop over all keys and expresions in the grammar
for r, ge := range grammar.Modifications {
count := 0
// Parse the rule
rule, err := ParseRuleName(r)
if err != nil {
// If the rule is not valid, assume no match
log.Printf("Error parsing rule information in key '%s': %v", r, err)
return false
}
// Loop over all actual modification keys and values
for i, ie := range input.Modifications {
// Check to see if the keys match
matched := matchString(i, rule.Name)
if matched {
// If so, check if the expressions match
if matchExpr(ie, ge, diag) {
// If so, this input is matched and so is the grammar rule
imatch[i] = true
count++
}
}
}
// Now check to make sure this grammar rule has been matched an appropriate
// number of times
err = rule.checkCount(count)
if err != nil {
// If not, no match
return false
}
}
// Now check to make sure every key on the input element had a match
for k, _ := range input.Modifications {
if !imatch[k] {
// This key on the input element was never matched
return false
}
}
return true
}
// Validation rules:
// Grammar expr is:
// String that starts with $ -> Look for type match
// String (without $) -> Exact match
// Object -> Treat object as a JSON schema and validate input with it
// Otherwise -> No match
func matchExpr(input *simplejson.Json, grammar *simplejson.Json, diag bool) bool {
if grammar == nil && input == nil {
return true
}
if grammar == nil || input == nil {
if diag {
log.Printf("Grammar was %v while input was %v", grammar, nil)
}
return false
}
stype, err := grammar.String()
if err == nil {
switch stype {
case "$_":
return true
case "$string":
_, terr := input.String()
if terr != nil && diag {
log.Printf("Input wasn't a string")
}
return terr == nil
case "$bool":
_, terr := input.Bool()
if terr != nil && diag {
log.Printf("Input wasn't a bool")
}
return terr == nil
case "$int":
_, terr := input.Int64()
if terr != nil && diag {
log.Printf("Input wasn't an int")
}
return terr == nil
case "$number":
_, terr := input.Float64()
if terr != nil && diag {
log.Printf("Input wasn't a number")
}
return terr == nil
default:
is, terr := input.String()
log.Printf("treated as literal")
return terr == nil && is == stype
}
}
mtype, err := grammar.Map()
if err == nil {
schemaLoader := gojsonschema.NewGoLoader(mtype)
documentLoader := gojsonschema.NewGoLoader(input)
result, err := gojsonschema.Validate(schemaLoader, documentLoader)
if err != nil {
log.Printf("Validation error: %v", err)
return false
}
for _, e := range result.Errors() {
log.Printf(" JSON Schema validation failed because: %s", e)
}
return result.Valid()
}
return false
}
func matchElement(input *Element, grammar *Element, children ElementList,
diag bool, prefix string, parentRule string, context RuleContext) error {
// Check if the names match
matched := matchString(input.Name, grammar.Name)
// If the names don't match, no match
if !matched {
return fmt.Errorf("Name mismatch (%s doesn't match pattern %s)",
input.Name, grammar.Name)
}
// Check whether the input is a definition or declaration
if input.IsDefinition() {
if grammar.IsDeclaration() {
// If the input is a definition but the grammar is a declaration, no match
return fmt.Errorf("Element type mismatch between %v and %v", input, grammar)
}
cerr := CheckContents(input.Contents, children, diag, prefix+" ", parentRule, context)
if cerr != nil {
// If the contents of input don't match the contents of grammar, no match
return cerr
}
} else {
if grammar.IsDefinition() {
// If the input is a declaration but the grammar is a definition, no match
return fmt.Errorf("Element type mismatch between %v and %v", input, grammar)
}
if !matchExpr(input.Value, grammar.Value, diag) {
if input.Value == nil && grammar.Value != nil {
return fmt.Errorf("Value pattern mismatch: <no value> vs %s",
unparseValue(grammar.Value, ""))
} else if input.Value != nil && grammar.Value == nil {
return fmt.Errorf("Value pattern mismatch: %s vs <no value>",
unparseValue(input.Value, ""))
} else {
return fmt.Errorf("Value pattern mismatch: %s vs %s",
unparseValue(input.Value, ""), unparseValue(grammar.Value, ""))
}
}
}
// TODO: Move these up, since they are quicker to establish
if !matchQualifiers(input, grammar) {
return fmt.Errorf("Qualifier mismatch (%v vs %v)", input.Qualifiers,
grammar.Qualifiers)
}
if !matchModifications(input, grammar, diag) {
return fmt.Errorf("Modification mismatch (%v vs %v)", input.Modifications,
grammar.Modifications)
}
return nil
}