Upgrade dependent version: github.com/open-policy-agent/opa (#5315)

Upgrade dependent version: github.com/open-policy-agent/opa v0.18.0 -> v0.45.0

Signed-off-by: hongzhouzi <hongzhouzi@kubesphere.io>

Signed-off-by: hongzhouzi <hongzhouzi@kubesphere.io>

vendor/github.com/open-policy-agent/opa/topdown/resolver.go

@@ -0,0 +1,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",
+}