-
Notifications
You must be signed in to change notification settings - Fork 10
/
util.go
106 lines (97 loc) · 2.59 KB
/
util.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
// © 2022-2023 Snyk Limited All rights reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package policy
import (
"github.com/open-policy-agent/opa/ast"
)
func moduleSetsHelper(
path ast.Ref,
node *ast.ModuleTreeNode,
) []ModuleSet {
var mods []ModuleSet
if len(node.Modules) > 0 {
mods = append(mods, ModuleSet{
Path: path,
Modules: node.Modules,
})
}
for k, child := range node.Children {
nextPath := append(path.Copy(), ast.NewTerm(k))
mods = append(mods, moduleSetsHelper(nextPath, child)...)
}
return mods
}
// moduleSetsWithPrefix is a recursive function that extracts all ModuleSets under the
// specified prefix from a ModuleTreeNode.
func moduleSetsWithPrefix(
prefix ast.Ref,
node *ast.ModuleTreeNode,
) []ModuleSet {
if parent := treeNodeAt(prefix, node); parent != nil {
return moduleSetsHelper(prefix, parent)
}
return []ModuleSet{}
}
func treeNodeAt(ref ast.Ref, node *ast.ModuleTreeNode) *ast.ModuleTreeNode {
curr := node
for _, key := range ref {
if child, ok := curr.Children[key.Value]; ok {
curr = child
} else {
return nil
}
}
return curr
}
func ExtractModuleSets(tree *ast.ModuleTreeNode) []ModuleSet {
// Current policies, legacy Fugue policies, and legacy IaC custom policies
mods := moduleSetsWithPrefix(ast.Ref{
ast.DefaultRootDocument,
ast.StringTerm("rules"),
}, tree)
// Legacy IaC policies
if schemas := treeNodeAt(ast.Ref{
ast.DefaultRootDocument,
ast.StringTerm("schemas"),
}, tree); schemas != nil {
for key, child := range schemas.Children {
if len(child.Modules) < 1 {
continue
}
mods = append(mods, ModuleSet{
Path: ast.Ref{
ast.DefaultRootDocument,
ast.StringTerm("schemas"),
ast.NewTerm(key),
},
Modules: child.Modules,
})
}
}
return mods
}
// TODO support array values?
func ScopeMatches(query map[string]string, input map[string]interface{}) bool {
for queryKey, queryVal := range query {
inputVal, present := input[queryKey]
if present && (queryVal == "" || queryVal == "*") {
continue
}
if queryVal == inputVal {
continue
}
return false
}
return true
}