-
Notifications
You must be signed in to change notification settings - Fork 1.3k
/
resolver.go
107 lines (99 loc) · 2.43 KB
/
resolver.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
// Copyright 2020 The OPA Authors. All rights reserved.
// Use of this source code is governed by an Apache2
// license that can be found in the LICENSE file.
package topdown
import (
"github.com/open-policy-agent/opa/ast"
"github.com/open-policy-agent/opa/metrics"
"github.com/open-policy-agent/opa/resolver"
)
type resolverTrie struct {
r resolver.Resolver
children map[ast.Value]*resolverTrie
}
func newResolverTrie() *resolverTrie {
return &resolverTrie{children: map[ast.Value]*resolverTrie{}}
}
func (t *resolverTrie) Put(ref ast.Ref, r resolver.Resolver) {
node := t
for _, t := range ref {
child, ok := node.children[t.Value]
if !ok {
child = &resolverTrie{children: map[ast.Value]*resolverTrie{}}
node.children[t.Value] = child
}
node = child
}
node.r = r
}
func (t *resolverTrie) Resolve(e *eval, ref ast.Ref) (ast.Value, error) {
e.metrics.Timer(metrics.RegoExternalResolve).Start()
defer e.metrics.Timer(metrics.RegoExternalResolve).Stop()
node := t
for i, t := range ref {
child, ok := node.children[t.Value]
if !ok {
return nil, nil
}
node = child
if node.r != nil {
in := resolver.Input{
Ref: ref[:i+1],
Input: e.input,
Metrics: e.metrics,
}
e.traceWasm(e.query[e.index], &in.Ref)
if e.data != nil {
return nil, errInScopeWithStmt
}
result, err := node.r.Eval(e.ctx, in)
if err != nil {
return nil, err
}
if result.Value == nil {
return nil, nil
}
val, err := result.Value.Find(ref[i+1:])
if err != nil {
return nil, nil
}
return val, nil
}
}
return node.mktree(e, resolver.Input{
Ref: ref,
Input: e.input,
Metrics: e.metrics,
})
}
func (t *resolverTrie) mktree(e *eval, in resolver.Input) (ast.Value, error) {
if t.r != nil {
e.traceWasm(e.query[e.index], &in.Ref)
if e.data != nil {
return nil, errInScopeWithStmt
}
result, err := t.r.Eval(e.ctx, in)
if err != nil {
return nil, err
}
if result.Value == nil {
return nil, nil
}
return result.Value, nil
}
obj := ast.NewObject()
for k, child := range t.children {
v, err := child.mktree(e, resolver.Input{Ref: append(in.Ref, ast.NewTerm(k)), Input: in.Input, Metrics: in.Metrics})
if err != nil {
return nil, err
}
if v != nil {
obj.Insert(ast.NewTerm(k), ast.NewTerm(v))
}
}
return obj, nil
}
var errInScopeWithStmt = &Error{
Code: InternalErr,
Message: "wasm cannot be executed when 'with' statements are in-scope",
}