mirror of
				https://github.com/optim-enterprises-bv/vault.git
				synced 2025-10-30 18:17:55 +00:00 
			
		
		
		
	
		
			
				
	
	
		
			72 lines
		
	
	
		
			1.4 KiB
		
	
	
	
		
			Go
		
	
	
	
	
	
			
		
		
	
	
			72 lines
		
	
	
		
			1.4 KiB
		
	
	
	
		
			Go
		
	
	
	
	
	
| // Copyright (c) HashiCorp, Inc.
 | |
| // SPDX-License-Identifier: MPL-2.0
 | |
| 
 | |
| package framework
 | |
| 
 | |
| import (
 | |
| 	"context"
 | |
| 	"sort"
 | |
| 	"strings"
 | |
| 
 | |
| 	"github.com/hashicorp/vault/sdk/logical"
 | |
| )
 | |
| 
 | |
| // DEPRECATED: Don't use this. It's too inflexible, nearly impossible to use
 | |
| // with some modern Vault features, and imposes specific API designs.
 | |
| //
 | |
| // PolicyMap is a specialization of PathMap that expects the values to
 | |
| // be lists of policies. This assists in querying and loading policies
 | |
| // from the PathMap.
 | |
| type PolicyMap struct {
 | |
| 	PathMap
 | |
| 
 | |
| 	DefaultKey string
 | |
| 	PolicyKey  string
 | |
| }
 | |
| 
 | |
| func (p *PolicyMap) Policies(ctx context.Context, s logical.Storage, names ...string) ([]string, error) {
 | |
| 	policyKey := "value"
 | |
| 	if p.PolicyKey != "" {
 | |
| 		policyKey = p.PolicyKey
 | |
| 	}
 | |
| 
 | |
| 	if p.DefaultKey != "" {
 | |
| 		newNames := make([]string, len(names)+1)
 | |
| 		newNames[0] = p.DefaultKey
 | |
| 		copy(newNames[1:], names)
 | |
| 		names = newNames
 | |
| 	}
 | |
| 
 | |
| 	set := make(map[string]struct{})
 | |
| 	for _, name := range names {
 | |
| 		v, err := p.Get(ctx, s, name)
 | |
| 		if err != nil {
 | |
| 			return nil, err
 | |
| 		}
 | |
| 
 | |
| 		valuesRaw, ok := v[policyKey]
 | |
| 		if !ok {
 | |
| 			continue
 | |
| 		}
 | |
| 
 | |
| 		values, ok := valuesRaw.(string)
 | |
| 		if !ok {
 | |
| 			continue
 | |
| 		}
 | |
| 
 | |
| 		for _, p := range strings.Split(values, ",") {
 | |
| 			if p = strings.TrimSpace(p); p != "" {
 | |
| 				set[p] = struct{}{}
 | |
| 			}
 | |
| 		}
 | |
| 	}
 | |
| 
 | |
| 	list := make([]string, 0, len(set))
 | |
| 	for k := range set {
 | |
| 		list = append(list, k)
 | |
| 	}
 | |
| 	sort.Strings(list)
 | |
| 
 | |
| 	return list, nil
 | |
| }
 | 
