-
Notifications
You must be signed in to change notification settings - Fork 121
/
filter.go
470 lines (421 loc) · 9.45 KB
/
filter.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
// Copyright 2021-2024 Zenauth Ltd.
// SPDX-License-Identifier: Apache-2.0
package hub
import (
"errors"
"fmt"
"slices"
"strconv"
"unicode"
"unicode/utf8"
logsv1 "github.com/cerbos/cloud-api/genpb/cerbos/cloud/logs/v1"
"go.uber.org/multierr"
"google.golang.org/protobuf/reflect/protoreflect"
"google.golang.org/protobuf/types/known/structpb"
)
const (
unionedPathPrefix = "entries[*][*]"
peerPrefix = unionedPathPrefix + ".peer"
metadataPrefix = unionedPathPrefix + ".metadata"
checkResourcesPrefix = "entries[*].decisionLogEntry.checkResources"
planResourcesPrefix = "entries[*].decisionLogEntry.planResources"
)
type tokenType int8
const (
tokenUnknown tokenType = iota
tokenAccessor
tokenIndex
tokenWildcard
)
type Token struct {
val any
children map[string]*Token
typ tokenType
}
func (t *Token) key() string {
switch t.typ {
case tokenAccessor:
return t.val.(string) //nolint:forcetypeassert
case tokenIndex:
return "[" + strconv.Itoa(t.val.(int)) + "]" //nolint:forcetypeassert
case tokenWildcard:
return "[*]"
default:
return ""
}
}
type AuditLogFilter struct {
astRoot *Token
}
func NewAuditLogFilter(conf MaskConf) (*AuditLogFilter, error) {
root, err := parseJSONPathExprs(conf)
if err != nil {
return nil, err
}
return &AuditLogFilter{
astRoot: root,
}, nil
}
func parseJSONPathExprs(conf MaskConf) (ast *Token, outErr error) {
root := &Token{}
parse := func(rule string) error {
if err := Tokenize(root, rule); err != nil {
return err
}
return nil
}
for _, r := range conf.Peer {
if err := parse(peerPrefix + "." + r); err != nil {
outErr = multierr.Append(outErr, err)
}
}
for _, r := range conf.Metadata {
if err := parse(metadataPrefix + "." + r); err != nil {
outErr = multierr.Append(outErr, err)
}
}
for _, r := range conf.CheckResources {
if err := parse(checkResourcesPrefix + "." + r); err != nil {
outErr = multierr.Append(outErr, err)
}
}
for _, r := range conf.PlanResources {
if err := parse(planResourcesPrefix + "." + r); err != nil {
outErr = multierr.Append(outErr, err)
}
}
return root, outErr
}
type state int8
const (
stateUnknown state = iota
statePlainAccessor
stateParenOpen
stateWildcard
stateNumberOpen
stateStringOpen
stateStringClosed
stateClosed
)
type tokenBuilder struct {
curToken *Token
buf string
size int
t tokenType
s state
}
func (tb *tokenBuilder) WriteRune(r rune) error {
defer func() {
tb.size += utf8.RuneLen(r)
}()
switch tb.size {
case 0:
switch {
case unicode.IsLetter(r):
tb.s = statePlainAccessor
tb.t = tokenAccessor
case r == '[':
tb.s = stateParenOpen
return nil
default:
return fmt.Errorf("invalid first character: %c", r)
}
case 1:
switch tb.s {
case statePlainAccessor:
case stateParenOpen:
switch {
case unicode.IsDigit(r):
tb.s = stateNumberOpen
tb.t = tokenIndex
case r == '*':
tb.s = stateWildcard
tb.t = tokenWildcard
return nil
case r == '\'':
tb.s = stateStringOpen
tb.t = tokenAccessor
return nil
default:
return fmt.Errorf("invalid character following '[': %c", r)
}
default:
return fmt.Errorf("unexpected state: %v", tb.s)
}
default:
switch tb.s {
case statePlainAccessor:
if !unicode.IsLetter(r) && !unicode.IsNumber(r) && r != '_' {
return fmt.Errorf("unexpected character for accessor: %c", r)
}
case stateNumberOpen:
switch {
case unicode.IsDigit(r):
case r == ']':
tb.s = stateClosed
return nil
default:
return fmt.Errorf("unexpected character in number: %c", r)
}
case stateWildcard:
if r != ']' {
return fmt.Errorf("expected ']' after '*', found: %c", r)
}
tb.s = stateClosed
return nil
case stateStringOpen:
if r == '\'' {
tb.s = stateStringClosed
return nil
}
case stateStringClosed:
if r != ']' {
return fmt.Errorf("expected ']' after string, found: %c", r)
}
tb.s = stateClosed
return nil
default:
return fmt.Errorf("unexpected state: %v", tb.s)
}
}
tb.buf += string(r)
return nil
}
func (tb *tokenBuilder) Flush() error {
switch tb.s {
case stateClosed, statePlainAccessor:
case stateStringOpen:
return errors.New("invalid string not closed")
default:
return fmt.Errorf("flush called in an invalid state: %v", tb.s)
}
if tb.size > 0 {
var value any
switch tb.t { //nolint:exhaustive
case tokenAccessor:
value = tb.buf
case tokenIndex:
idx, err := strconv.Atoi(tb.buf)
if err != nil {
return err
}
value = idx
}
t := &Token{
typ: tb.t,
val: value,
}
if tb.curToken.children == nil {
tb.curToken.children = make(map[string]*Token)
}
if cached, ok := tb.curToken.children[t.key()]; ok {
tb.curToken = cached
} else {
tb.curToken.children[t.key()] = t
tb.curToken = t
}
}
tb.buf = ""
tb.t = tokenUnknown
tb.size = 0
return nil
}
func Tokenize(root *Token, path string) error {
curs := 0
b := &tokenBuilder{
curToken: root,
}
var prev rune
for curs < len(path) {
r, size := utf8.DecodeRuneInString(path[curs:])
curs += size
// handle and validate token boundaries
switch r {
case '.':
switch {
case curs == size:
return errors.New("invalid first character: '.'")
case curs == len(path):
return errors.New("invalid final character: '.'")
case prev == '.':
return errors.New("invalid empty token")
}
if err := b.Flush(); err != nil {
return err
}
case '[':
if err := b.Flush(); err != nil {
return err
}
if err := b.WriteRune(r); err != nil {
return err
}
case ']':
if err := b.WriteRune(r); err != nil {
return err
}
if err := b.Flush(); err != nil {
return err
}
default:
if err := b.WriteRune(r); err != nil {
return err
}
}
prev = r
}
if err := b.Flush(); err != nil {
return err
}
return nil
}
func (f *AuditLogFilter) Filter(ingestBatch *logsv1.IngestBatch) error {
if f.astRoot == nil {
return nil
}
ib := ingestBatch.ProtoReflect()
for _, c := range f.astRoot.children {
visit(c, ib)
}
return nil
}
// We support a subset of JSONPath operations, as follows:
//
// - dot notation: `foo.bar.baz`
// - or bracket-notation: `['foo']['bar']['baz]`
// - or combinations thereof
//
// `bar` or `baz` above can be map keys, nested messages or structs.
//
// We support list indexing with Ints or wildcards:
// - foo.bar[0]
// - foo.bar[*]
//
// Wildcards can also operate on member names as a match-all. E.g `foo[*].baz`
// will match both `baz` values in the pseudo-object below:
//
// {
// 'foo': {
// 'pow': {
// 'baz',
// },
// 'bosh': {
// 'baz',
// },
// }
// }
func visit(t *Token, m protoreflect.Message) {
if m.Type().Descriptor().FullName() == "google.protobuf.Value" {
visitStructpb(t, m.Interface().(*structpb.Value)) //nolint:forcetypeassert
return
}
var fieldsToInspect []protoreflect.FieldDescriptor
switch t.typ { //nolint:exhaustive
case tokenAccessor:
fd := m.Descriptor().Fields().ByJSONName(t.val.(string)) //nolint:forcetypeassert
if fd == nil {
return
} else if t.children == nil {
if m.Has(fd) {
m.Clear(fd)
}
return
}
fieldsToInspect = []protoreflect.FieldDescriptor{fd}
case tokenWildcard:
fds := m.Descriptor().Fields()
fieldsToInspect = make([]protoreflect.FieldDescriptor, fds.Len())
for i := 0; i < fds.Len(); i++ {
fieldsToInspect[i] = fds.Get(i)
}
}
for _, fd := range fieldsToInspect {
v := m.Get(fd)
for _, c := range t.children {
switch {
case fd.IsMap():
mapVal := v.Map() // apparently retrieving typed values each iteration causes no slow-down
k, ok := c.val.(string)
if !ok {
continue
}
mapKey := protoreflect.ValueOfString(k).MapKey()
mv := mapVal.Get(mapKey)
if mv.IsValid() {
if c.children == nil {
mapVal.Clear(mapKey)
continue
}
if fd.MapValue().Message() != nil {
visit(c, mv.Message())
}
}
case fd.IsList():
listVal := v.List()
handleArrayIndex := func(idx int) {
// For array indexes, reach ahead to the next token.
for _, nc := range c.children {
visit(nc, listVal.Get(idx).Message())
}
}
switch c.typ { //nolint:exhaustive
case tokenWildcard:
for i := 0; i < listVal.Len(); i++ {
handleArrayIndex(i)
}
case tokenIndex:
if idx := c.val.(int); idx < listVal.Len() { //nolint:forcetypeassert
handleArrayIndex(idx)
}
}
case fd.Message() != nil:
visit(c, v.Message())
}
}
}
}
func visitStructpb(t *Token, v *structpb.Value) {
for _, c := range t.children {
switch k := v.GetKind().(type) {
case *structpb.Value_StructValue:
name, ok := c.val.(string)
if !ok {
continue
}
if c.children == nil {
delete(k.StructValue.Fields, name)
continue
}
if fv, ok := k.StructValue.Fields[name]; ok {
visitStructpb(c, fv)
}
case *structpb.Value_ListValue:
switch c.typ { //nolint:exhaustive
case tokenWildcard:
if c.children == nil {
v = nil
continue
}
for i := 0; i < len(k.ListValue.Values); i++ {
visitStructpb(c, k.ListValue.Values[i])
}
case tokenIndex:
idx, ok := c.val.(int)
if !ok {
continue
}
if c.children == nil {
if l := len(k.ListValue.Values); idx < l {
if l == 1 {
v = nil
} else {
k.ListValue.Values = slices.Delete(k.ListValue.Values, idx, idx+1)
}
}
continue
}
visitStructpb(c, k.ListValue.Values[idx])
}
}
}
}