-
-
Notifications
You must be signed in to change notification settings - Fork 18
/
ast.go
414 lines (332 loc) · 7.64 KB
/
ast.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
package sigma
import (
"fmt"
"strings"
"gopkg.in/yaml.v3"
"github.com/bradleyjkemp/sigma-go/internal/grammar"
)
type Condition struct {
node *yaml.Node `yaml:",omitempty" json:",omitempty"`
Search SearchExpr `yaml:",omitempty" json:",omitempty"`
Aggregation AggregationExpr `yaml:",omitempty" json:",omitempty"`
}
func (c Condition) MarshalYAML() (interface{}, error) {
search := c.Search.toString()
if c.Aggregation != nil {
return search + " | " + c.Aggregation.toString(), nil
} else {
return search, nil
}
}
// Position returns the line and column of this Condition in the original input
func (c Condition) Position() (int, int) {
return c.node.Line - 1, c.node.Column - 1
}
type SearchExpr interface {
searchExpr()
toString() string
}
type And []SearchExpr
func (And) searchExpr() {}
func (e And) toString() string {
if len(e) == 1 {
return e[0].toString()
} else {
converted := make([]string, len(e))
for idx, sub := range e {
converted[idx] = sub.toString()
}
return "(" + strings.Join(converted, " and ") + ")"
}
}
type Or []SearchExpr
func (Or) searchExpr() {}
func (e Or) toString() string {
if len(e) == 1 {
return e[0].toString()
} else {
converted := make([]string, len(e))
for idx, sub := range e {
converted[idx] = sub.toString()
}
return "(" + strings.Join(converted, " or ") + ")"
}
}
type Not struct {
Expr SearchExpr
}
func (e Not) toString() string {
return "not " + e.Expr.toString()
}
func (Not) searchExpr() {}
type OneOfIdentifier struct {
Ident SearchIdentifier
}
func (OneOfIdentifier) searchExpr() {}
func (e OneOfIdentifier) toString() string {
return "1 of " + e.Ident.toString()
}
type AllOfIdentifier struct {
Ident SearchIdentifier
}
func (AllOfIdentifier) searchExpr() {}
func (e AllOfIdentifier) toString() string {
return "all of " + e.Ident.toString()
}
type AllOfPattern struct {
Pattern string
}
func (AllOfPattern) searchExpr() {}
func (e AllOfPattern) toString() string {
return "all of " + e.Pattern
}
type OneOfPattern struct {
Pattern string
}
func (OneOfPattern) searchExpr() {}
func (e OneOfPattern) toString() string {
return "1 of " + e.Pattern
}
type OneOfThem struct{}
func (OneOfThem) searchExpr() {}
func (OneOfThem) toString() string {
return "1 of them"
}
type AllOfThem struct{}
func (AllOfThem) searchExpr() {}
func (AllOfThem) toString() string {
return "all of them"
}
type SearchIdentifier struct {
Name string
}
func (SearchIdentifier) searchExpr() {}
func (e SearchIdentifier) toString() string {
return e.Name
}
type AggregationExpr interface {
aggregationExpr()
toString() string
}
type Near struct {
Condition SearchExpr
}
func (Near) aggregationExpr() {}
func (n Near) toString() string {
return "near " + n.Condition.toString()
}
type ComparisonOp string
var (
Equal ComparisonOp = "="
NotEqual ComparisonOp = "!="
LessThan ComparisonOp = "<"
LessThanEqual ComparisonOp = "<="
GreaterThan ComparisonOp = ">"
GreaterThanEqual ComparisonOp = ">="
)
type Comparison struct {
Func AggregationFunc
Op ComparisonOp
Threshold float64
}
func (Comparison) aggregationExpr() {}
func (e Comparison) toString() string {
return fmt.Sprintf("%v %v %v", e.Func.toString(), e.Op, e.Threshold)
}
type AggregationFunc interface {
aggregationFunc()
toString() string
}
type Count struct {
Field string
GroupedBy string
}
func (Count) aggregationFunc() {}
func (c Count) toString() string {
result := "count(" + c.Field + ")"
if c.GroupedBy != "" {
result += " by " + c.GroupedBy
}
return result
}
type Min struct {
Field string
GroupedBy string
}
func (Min) aggregationFunc() {}
func (c Min) toString() string {
result := "min(" + c.Field + ")"
if c.GroupedBy != "" {
result += " by " + c.GroupedBy
}
return result
}
type Max struct {
Field string
GroupedBy string
}
func (Max) aggregationFunc() {}
func (c Max) toString() string {
result := "max(" + c.Field + ")"
if c.GroupedBy != "" {
result += " by " + c.GroupedBy
}
return result
}
type Average struct {
Field string
GroupedBy string
}
func (Average) aggregationFunc() {}
func (c Average) toString() string {
result := "avg(" + c.Field + ")"
if c.GroupedBy != "" {
result += " by " + c.GroupedBy
}
return result
}
type Sum struct {
Field string
GroupedBy string
}
func (Sum) aggregationFunc() {}
func (c Sum) toString() string {
result := "sum(" + c.Field + ")"
if c.GroupedBy != "" {
result += " by " + c.GroupedBy
}
return result
}
func searchToAST(node interface{}) (SearchExpr, error) {
switch n := node.(type) {
case grammar.Disjunction:
if len(n.Nodes) == 1 {
return searchToAST(*n.Nodes[0])
}
or := Or{}
for _, node := range n.Nodes {
n, err := searchToAST(*node)
if err != nil {
return nil, err
}
or = append(or, n)
}
return or, nil
case grammar.Conjunction:
if len(n.Nodes) == 1 {
return searchToAST(*n.Nodes[0])
}
and := And{}
for _, node := range n.Nodes {
n, err := searchToAST(*node)
if err != nil {
return nil, err
}
and = append(and, n)
}
return and, nil
case grammar.Term:
switch {
case n.Negated != nil:
n, err := searchToAST(*n.Negated)
if err != nil {
return nil, err
}
return Not{Expr: n}, nil
case n.Identifer != nil:
return SearchIdentifier{Name: *n.Identifer}, nil
case n.Subexpression != nil:
return searchToAST(*n.Subexpression)
case n.OneAllOf != nil:
o := n.OneAllOf
switch {
case o.ALlOfThem:
return AllOfThem{}, nil
case o.OneOfThem:
return OneOfThem{}, nil
case o.AllOfIdentifier != nil:
return AllOfIdentifier{
Ident: SearchIdentifier{Name: *o.AllOfIdentifier},
}, nil
case o.OneOfIdentifier != nil:
return OneOfIdentifier{
Ident: SearchIdentifier{Name: *o.OneOfIdentifier},
}, nil
case o.AllOfPattern != nil:
return AllOfPattern{
Pattern: *o.AllOfPattern,
}, nil
case o.OneOfPattern != nil:
return OneOfPattern{
Pattern: *o.OneOfPattern,
}, nil
default:
return nil, fmt.Errorf("invalid term type: all fields nil")
}
default:
return nil, fmt.Errorf("invalid term")
}
default:
return nil, fmt.Errorf("unhandled node type %T", node)
}
}
func aggregationToAST(agg *grammar.Aggregation) (AggregationExpr, error) {
if agg == nil {
return nil, nil
}
var function AggregationFunc
switch {
case agg.Function.Count:
function = Count{
Field: agg.AggregationField,
GroupedBy: agg.GroupField,
}
case agg.Function.Min:
function = Min{
Field: agg.AggregationField,
GroupedBy: agg.GroupField,
}
case agg.Function.Max:
function = Max{
Field: agg.AggregationField,
GroupedBy: agg.GroupField,
}
case agg.Function.Avg:
function = Average{
Field: agg.AggregationField,
GroupedBy: agg.GroupField,
}
case agg.Function.Sum:
function = Sum{
Field: agg.AggregationField,
GroupedBy: agg.GroupField,
}
default:
return nil, fmt.Errorf("unknown aggregation function")
}
if agg.Comparison == nil {
return nil, fmt.Errorf("non comparison aggregations not yet supported")
}
var operation ComparisonOp
switch {
case agg.Comparison.Equal:
operation = Equal
case agg.Comparison.NotEqual:
operation = NotEqual
case agg.Comparison.LessThan:
operation = LessThan
case agg.Comparison.LessThanEqual:
operation = LessThanEqual
case agg.Comparison.GreaterThan:
operation = GreaterThan
case agg.Comparison.GreaterThanEqual:
operation = GreaterThanEqual
default:
return nil, fmt.Errorf("unknown operation %v", agg.Comparison)
}
return Comparison{
Func: function,
Op: operation,
Threshold: agg.Threshold,
}, nil
}