nodes.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 (
21
	"fmt"
H
hongming 已提交
22
	"kubesphere.io/kubesphere/pkg/constants"
H
hongming 已提交
23 24
	"kubesphere.io/kubesphere/pkg/informers"
	"kubesphere.io/kubesphere/pkg/params"
H
hongming 已提交
25
	"kubesphere.io/kubesphere/pkg/utils/sliceutil"
J
jeff 已提交
26 27 28 29 30 31 32 33 34 35
	"sort"
	"strings"

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

type nodeSearcher struct {
}

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

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

H
hongming 已提交
68
// Fuzzy searchInNamespace
J
jeff 已提交
69 70 71
func (*nodeSearcher) fuzzy(fuzzy map[string]string, item *v1.Node) bool {
	for k, v := range fuzzy {
		switch k {
H
hongming 已提交
72 73
		case Name:
			if !strings.Contains(item.Name, v) && !strings.Contains(item.Annotations[constants.DisplayNameAnnotationKey], v) {
J
jeff 已提交
74 75
				return false
			}
H
hongming 已提交
76
		case Label:
J
jeff 已提交
77 78 79 80 81 82 83 84 85 86 87 88 89
			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 已提交
90
			if !searchFuzzy(item.Labels, k, v) {
J
jeff 已提交
91 92 93 94 95 96 97 98 99
				return false
			}
		}
	}
	return true
}

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

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

	if err != nil {
		return nil, err
	}

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

H
hongming 已提交
118
	if len(conditions.Match) == 0 && len(conditions.Fuzzy) == 0 {
J
jeff 已提交
119 120 121
		result = nodes
	} else {
		for _, item := range nodes {
H
hongming 已提交
122
			if s.match(conditions.Match, item) && s.fuzzy(conditions.Fuzzy, item) {
J
jeff 已提交
123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141
				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
}