configmaps.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 configMapSearcher struct {
}

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

H
hongming 已提交
39
// exactly Match
J
jeff 已提交
40 41 42
func (*configMapSearcher) match(match map[string]string, item *v1.ConfigMap) 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
				return false
			}
H
hongming 已提交
48
		case Keyword:
H
hongming 已提交
49 50 51
			if !strings.Contains(item.Name, v) && !searchFuzzy(item.Labels, "", v) && !searchFuzzy(item.Annotations, "", v) {
				return false
			}
J
jeff 已提交
52
		default:
H
hongming 已提交
53 54 55
			if item.Labels[k] != v {
				return false
			}
J
jeff 已提交
56 57 58 59 60
		}
	}
	return true
}

H
hongming 已提交
61
// Fuzzy searchInNamespace
J
jeff 已提交
62 63 64
func (*configMapSearcher) fuzzy(fuzzy map[string]string, item *v1.ConfigMap) bool {
	for k, v := range fuzzy {
		switch k {
H
hongming 已提交
65 66
		case Name:
			if !strings.Contains(item.Name, v) && !strings.Contains(item.Annotations[constants.DisplayNameAnnotationKey], v) {
J
jeff 已提交
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
				return false
			}
		case label:
			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:
			if !searchFuzzy(item.Labels, k, v) && !searchFuzzy(item.Annotations, k, v) {
				return false
			}
		}
	}
	return true
}

func (*configMapSearcher) compare(a, b *v1.ConfigMap, orderBy string) bool {
	switch orderBy {
H
hongming 已提交
93
	case CreateTime:
H
hongming 已提交
94
		return a.CreationTimestamp.Time.Before(b.CreationTimestamp.Time)
H
hongming 已提交
95
	case Name:
J
jeff 已提交
96 97 98 99 100 101
		fallthrough
	default:
		return strings.Compare(a.Name, b.Name) <= 0
	}
}

H
hongming 已提交
102 103
func (s *configMapSearcher) search(namespace string, conditions *params.Conditions, orderBy string, reverse bool) ([]interface{}, error) {
	configMaps, err := informers.SharedInformerFactory().Core().V1().ConfigMaps().Lister().ConfigMaps(namespace).List(labels.Everything())
J
jeff 已提交
104 105 106 107 108 109 110

	if err != nil {
		return nil, err
	}

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

H
hongming 已提交
111
	if len(conditions.Match) == 0 && len(conditions.Fuzzy) == 0 {
J
jeff 已提交
112 113 114
		result = configMaps
	} else {
		for _, item := range configMaps {
H
hongming 已提交
115
			if s.match(conditions.Match, item) && s.fuzzy(conditions.Fuzzy, item) {
J
jeff 已提交
116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134
				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
}