secrets.go 3.4 KB
Newer Older
J
jeff 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
/*

 Copyright 2019 The KubeSphere Authors.

 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 resources

import (
H
hongming 已提交
21
	"kubesphere.io/kubesphere/pkg/constants"
H
hongming 已提交
22 23
	"kubesphere.io/kubesphere/pkg/informers"
	"kubesphere.io/kubesphere/pkg/params"
H
hongming 已提交
24
	"kubesphere.io/kubesphere/pkg/utils/sliceutil"
J
jeff 已提交
25 26 27 28 29 30 31 32 33 34
	"sort"
	"strings"

	"k8s.io/api/core/v1"
	"k8s.io/apimachinery/pkg/labels"
)

type secretSearcher struct {
}

H
hongming 已提交
35 36 37 38
func (*secretSearcher) get(namespace, name string) (interface{}, error) {
	return informers.SharedInformerFactory().Core().V1().Secrets().Lister().Secrets(namespace).Get(name)
}

H
hongming 已提交
39
// exactly Match
J
jeff 已提交
40 41 42
func (*secretSearcher) match(match map[string]string, item *v1.Secret) bool {
	for k, v := range match {
		switch k {
H
hongming 已提交
43 44 45
		case Name:
			names := strings.Split(v, "|")
			if !sliceutil.HasString(names, item.Name) {
J
jeff 已提交
46 47 48 49 50 51
				return false
			}
		case "type":
			if string(item.Type) != v {
				return false
			}
H
hongming 已提交
52
		case Keyword:
H
hongming 已提交
53 54 55
			if !strings.Contains(item.Name, v) && !searchFuzzy(item.Labels, "", v) && !searchFuzzy(item.Annotations, "", v) {
				return false
			}
J
jeff 已提交
56
		default:
H
hongming 已提交
57 58
			// label not exist or value not equal
			if val, ok := item.Labels[k]; !ok || val != v {
H
hongming 已提交
59 60
				return false
			}
J
jeff 已提交
61 62 63 64 65
		}
	}
	return true
}

H
hongming 已提交
66
// Fuzzy searchInNamespace
J
jeff 已提交
67 68 69
func (*secretSearcher) fuzzy(fuzzy map[string]string, item *v1.Secret) bool {
	for k, v := range fuzzy {
		switch k {
H
hongming 已提交
70 71
		case Name:
			if !strings.Contains(item.Name, v) && !strings.Contains(item.Annotations[constants.DisplayNameAnnotationKey], v) {
J
jeff 已提交
72 73
				return false
			}
H
hongming 已提交
74
		case Label:
J
jeff 已提交
75 76 77 78 79 80 81 82 83 84 85 86 87
			if !searchFuzzy(item.Labels, "", v) {
				return false
			}
		case annotation:
			if !searchFuzzy(item.Annotations, "", v) {
				return false
			}
			return false
		case app:
			if !strings.Contains(item.Labels[chart], v) && !strings.Contains(item.Labels[release], v) {
				return false
			}
		default:
H
hongming 已提交
88
			if !searchFuzzy(item.Labels, k, v) {
J
jeff 已提交
89 90 91 92 93 94 95 96 97
				return false
			}
		}
	}
	return true
}

func (*secretSearcher) compare(a, b *v1.Secret, orderBy string) bool {
	switch orderBy {
H
hongming 已提交
98
	case CreateTime:
H
hongming 已提交
99
		return a.CreationTimestamp.Time.Before(b.CreationTimestamp.Time)
H
hongming 已提交
100
	case Name:
J
jeff 已提交
101 102 103 104 105 106
		fallthrough
	default:
		return strings.Compare(a.Name, b.Name) <= 0
	}
}

H
hongming 已提交
107 108
func (s *secretSearcher) search(namespace string, conditions *params.Conditions, orderBy string, reverse bool) ([]interface{}, error) {
	secrets, err := informers.SharedInformerFactory().Core().V1().Secrets().Lister().Secrets(namespace).List(labels.Everything())
J
jeff 已提交
109 110 111 112 113 114 115

	if err != nil {
		return nil, err
	}

	result := make([]*v1.Secret, 0)

H
hongming 已提交
116
	if len(conditions.Match) == 0 && len(conditions.Fuzzy) == 0 {
J
jeff 已提交
117 118 119
		result = secrets
	} else {
		for _, item := range secrets {
H
hongming 已提交
120
			if s.match(conditions.Match, item) && s.fuzzy(conditions.Fuzzy, item) {
J
jeff 已提交
121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139
				result = append(result, item)
			}
		}
	}
	sort.Slice(result, func(i, j int) bool {
		if reverse {
			tmp := i
			i = j
			j = tmp
		}
		return s.compare(result[i], result[j], orderBy)
	})

	r := make([]interface{}, 0)
	for _, i := range result {
		r = append(r, i)
	}
	return r, nil
}