-
Notifications
You must be signed in to change notification settings - Fork 83
/
Copy pathfield_op.go
419 lines (394 loc) · 10.8 KB
/
field_op.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
package doif
import (
"bytes"
"errors"
"fmt"
"regexp"
"slices"
"github.com/ozontech/file.d/cfg"
insaneJSON "github.com/vitkovskii/insane-json"
)
// ! do-if-field-op
// ^ do-if-field-op
type fieldOpType int
const (
fieldUnknownOp fieldOpType = iota
fieldEqualOp
fieldContainsOp
fieldPrefixOp
fieldSuffixOp
fieldRegexOp
)
func (t fieldOpType) String() string {
switch t {
case fieldEqualOp:
return "equal"
case fieldContainsOp:
return "contains"
case fieldPrefixOp:
return "prefix"
case fieldSuffixOp:
return "suffix"
case fieldRegexOp:
return "regex"
default:
return "unknown"
}
}
const (
// > checks whether the field value is equal to one of the elements in the values list.
// >
// > Example:
// > ```yaml
// > pipelines:
// > test:
// > actions:
// > - type: discard
// > do_if:
// > op: equal
// > field: pod
// > values: [test-pod-1, test-pod-2]
// > ```
// >
// > result:
// > ```
// > {"pod":"test-pod-1","service":"test-service"} # discarded
// > {"pod":"test-pod-2","service":"test-service-2"} # discarded
// > {"pod":"test-pod","service":"test-service"} # not discarded
// > {"pod":"test-pod","service":"test-service-1"} # not discarded
// > ```
fieldEqualOpTag = "equal" // *
// > checks whether the field value contains one of the elements the in values list.
// >
// > Example:
// > ```yaml
// > pipelines:
// > test:
// > actions:
// > - type: discard
// > do_if:
// > op: contains
// > field: pod
// > values: [my-pod, my-test]
// > ```
// >
// > result:
// > ```
// > {"pod":"test-my-pod-1","service":"test-service"} # discarded
// > {"pod":"test-not-my-pod","service":"test-service-2"} # discarded
// > {"pod":"my-test-pod","service":"test-service"} # discarded
// > {"pod":"test-pod","service":"test-service-1"} # not discarded
// > ```
fieldContainsOpTag = "contains" // *
// > checks whether the field value has prefix equal to one of the elements in the values list.
// >
// > Example:
// > ```yaml
// > pipelines:
// > test:
// > actions:
// > - type: discard
// > do_if:
// > op: prefix
// > field: pod
// > values: [test-1, test-2]
// > ```
// >
// > result:
// > ```
// > {"pod":"test-1-pod-1","service":"test-service"} # discarded
// > {"pod":"test-2-pod-2","service":"test-service-2"} # discarded
// > {"pod":"test-pod","service":"test-service"} # not discarded
// > {"pod":"test-pod","service":"test-service-1"} # not discarded
// > ```
fieldPrefixOpTag = "prefix" // *
// > checks whether the field value has suffix equal to one of the elements in the values list.
// >
// > Example:
// > ```yaml
// > pipelines:
// > test:
// > actions:
// > - type: discard
// > do_if:
// > op: suffix
// > field: pod
// > values: [pod-1, pod-2]
// > ```
// >
// > result:
// > ```
// > {"pod":"test-1-pod-1","service":"test-service"} # discarded
// > {"pod":"test-2-pod-2","service":"test-service-2"} # discarded
// > {"pod":"test-pod","service":"test-service"} # not discarded
// > {"pod":"test-pod","service":"test-service-1"} # not discarded
// > ```
fieldSuffixOpTag = "suffix" // *
// > checks whether the field matches any regex from the values list.
// >
// > Example:
// > ```yaml
// > pipelines:
// > test:
// > actions:
// > - type: discard
// > do_if:
// > op: regex
// > field: pod
// > values: [pod-\d, my-test.*]
// > ```
// >
// > result:
// > ```
// > {"pod":"test-1-pod-1","service":"test-service"} # discarded
// > {"pod":"test-2-pod-2","service":"test-service-2"} # discarded
// > {"pod":"test-pod","service":"test-service"} # not discarded
// > {"pod":"my-test-pod","service":"test-service-1"} # discarded
// > {"pod":"my-test-instance","service":"test-service-1"} # discarded
// > {"pod":"service123","service":"test-service-1"} # not discarded
// > ```
fieldRegexOpTag = "regex" // *
)
/*{ do-if-field-op-node
DoIf field op node is considered to always be a leaf in the DoIf tree.
It contains operation to be checked on the field value, the field name to extract data and
the values to check against.
Params:
- `op` - value from field operations list. Required.
- `field` - name of the field to apply operation. Required.
- `values` - list of values to check field. Required non-empty.
- `case_sensitive` - flag indicating whether checks are performed in case sensitive way. Default `true`.
Note: case insensitive checks can cause CPU and memory overhead since every field value will be converted to lower letters.
Example:
```yaml
pipelines:
tests:
actions:
- type: discard
do_if:
op: suffix
field: pod
values: [pod-1, pod-2]
case_sensitive: true
```
}*/
type fieldOpNode struct {
op fieldOpType
fieldPath []string
fieldPathStr string
caseSensitive bool
values [][]byte
valuesBySize map[int][][]byte
reValues []*regexp.Regexp
minValLen int
maxValLen int
}
func NewFieldOpNode(op string, field string, caseSensitive bool, values [][]byte) (Node, error) {
if field == "" {
return nil, errors.New("field is not specified")
}
if len(values) == 0 {
return nil, errors.New("values are not provided")
}
var vals [][]byte
var valsBySize map[int][][]byte
var reValues []*regexp.Regexp
var minValLen, maxValLen int
var fop fieldOpType
fieldPath := cfg.ParseFieldSelector(field)
switch op {
case fieldEqualOpTag:
fop = fieldEqualOp
case fieldContainsOpTag:
fop = fieldContainsOp
case fieldPrefixOpTag:
fop = fieldPrefixOp
case fieldSuffixOpTag:
fop = fieldSuffixOp
case fieldRegexOpTag:
fop = fieldRegexOp
reValues = make([]*regexp.Regexp, 0, len(values))
for _, v := range values {
re, err := regexp.Compile(string(v))
if err != nil {
return nil, fmt.Errorf("failed to compile regex %q: %w", v, err)
}
reValues = append(reValues, re)
}
default:
return nil, fmt.Errorf("unknown field op %q", op)
}
if fop != fieldRegexOp {
minValLen = len(values[0])
maxValLen = len(values[0])
if fop == fieldEqualOp {
valsBySize = make(map[int][][]byte)
} else {
vals = make([][]byte, len(values))
}
for i := range values {
var curVal []byte
if values[i] != nil {
curVal = make([]byte, len(values[i]))
copy(curVal, values[i])
}
if !caseSensitive && curVal != nil {
curVal = bytes.ToLower(curVal)
}
if len(values[i]) < minValLen {
minValLen = len(values[i])
}
if len(values[i]) > maxValLen {
maxValLen = len(values[i])
}
if fop == fieldEqualOp {
valsBySize[len(curVal)] = append(valsBySize[len(curVal)], curVal)
} else {
vals[i] = curVal
}
}
}
return &fieldOpNode{
op: fop,
fieldPath: fieldPath,
fieldPathStr: field,
caseSensitive: caseSensitive,
values: vals,
valuesBySize: valsBySize,
reValues: reValues,
minValLen: minValLen,
maxValLen: maxValLen,
}, nil
}
func (n *fieldOpNode) Type() NodeType {
return NodeFieldOp
}
func (n *fieldOpNode) Check(eventRoot *insaneJSON.Root) bool {
var data []byte
node := eventRoot.Dig(n.fieldPath...)
if !node.IsNull() {
data = node.AsBytes()
}
// fast check for data
if n.op != fieldRegexOp && len(data) < n.minValLen {
return false
}
switch n.op {
case fieldEqualOp:
vals, ok := n.valuesBySize[len(data)]
if !ok {
return false
}
if !n.caseSensitive && data != nil {
data = bytes.ToLower(data)
}
for _, val := range vals {
// null and empty strings are considered as different values
// null can also come if field value is absent
if (data == nil && val != nil) || (data != nil && val == nil) {
continue
}
if bytes.Equal(data, val) {
return true
}
}
case fieldContainsOp:
if !n.caseSensitive {
data = bytes.ToLower(data)
}
for _, val := range n.values {
if bytes.Contains(data, val) {
return true
}
}
case fieldPrefixOp:
// check only necessary amount of bytes
if len(data) > n.maxValLen {
data = data[:n.maxValLen]
}
if !n.caseSensitive {
data = bytes.ToLower(data)
}
for _, val := range n.values {
if bytes.HasPrefix(data, val) {
return true
}
}
case fieldSuffixOp:
// check only necessary amount of bytes
if len(data) > n.maxValLen {
data = data[len(data)-n.maxValLen:]
}
if !n.caseSensitive {
data = bytes.ToLower(data)
}
for _, val := range n.values {
if bytes.HasSuffix(data, val) {
return true
}
}
case fieldRegexOp:
for _, re := range n.reValues {
if re.Match(data) {
return true
}
}
}
return false
}
func (n *fieldOpNode) isEqualTo(n2 Node, _ int) error {
n2f, ok := n2.(*fieldOpNode)
if !ok {
return errors.New("nodes have different types expected: fieldOpNode")
}
if n.op != n2f.op {
return fmt.Errorf("nodes have different op expected: %q", n.op)
}
if n.caseSensitive != n2f.caseSensitive {
return fmt.Errorf("nodes have different caseSensitive expected: %v", n.caseSensitive)
}
if n.fieldPathStr != n2f.fieldPathStr || slices.Compare[[]string](n.fieldPath, n2f.fieldPath) != 0 {
return fmt.Errorf("nodes have different fieldPathStr expected: fieldPathStr=%q fieldPath=%v",
n.fieldPathStr, n.fieldPath,
)
}
if len(n.values) != len(n2f.values) {
return fmt.Errorf("nodes have different values slices len expected: %d", len(n.values))
}
for i := 0; i < len(n.values); i++ {
if !bytes.Equal(n.values[i], n2f.values[i]) {
return fmt.Errorf("nodes have different data in values expected: %v on position", n.values)
}
}
if len(n.valuesBySize) != len(n2f.valuesBySize) {
return fmt.Errorf("nodes have different valuesBySize len expected: %d", len(n.valuesBySize))
}
for k, v := range n.valuesBySize {
if v2, has := n2f.valuesBySize[k]; !has {
return fmt.Errorf("nodes have different valuesBySize keys expected key: %d", k)
} else if len(v) != len(v2) {
return fmt.Errorf("nodes have different valuesBySize values len under key %d expected: %d", k, len(v))
} else {
for i := 0; i < len(v); i++ {
if !bytes.Equal(v[i], v2[i]) {
return fmt.Errorf("nodes have different valuesBySize data under key %d: %v", k, v)
}
}
}
}
if len(n.reValues) != len(n2f.reValues) {
return fmt.Errorf("nodes have different reValues len expected: %d", len(n.reValues))
}
for i := 0; i < len(n.reValues); i++ {
if n.reValues[i].String() != n2f.reValues[i].String() {
return fmt.Errorf("nodes have different reValues data expected: %v", n.reValues)
}
}
if n.minValLen != n2f.minValLen {
return fmt.Errorf("nodes have different minValLem expected: %d", n.minValLen)
}
if n.maxValLen != n2f.maxValLen {
return fmt.Errorf("nodes have different maxValLem expected: %d", n.maxValLen)
}
return nil
}