-
Notifications
You must be signed in to change notification settings - Fork 38
/
types.go
159 lines (129 loc) · 4.73 KB
/
types.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
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
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
// Copyright The Karpor 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 kubeaudit
import (
"sync"
"github.com/KusionStack/karpor/pkg/core/entity"
"github.com/KusionStack/karpor/pkg/infra/scanner"
"github.com/KusionStack/karpor/pkg/infra/search/storage"
)
var _ scanner.ScanResult = &scanResult{}
// scanResult implements the scanner.ScanResult interface and represents the
// result of scanning Kubernetes resources.
type scanResult struct {
issueResourceMap map[scanner.Issue]scanner.ResourceList // Map of issues to resources
resourceIssueMap map[entity.ResourceGroupHash]scanner.IssueList // Map of resources to issues
resourceGroupMap map[entity.ResourceGroupHash]*storage.Resource // Map of resourceGroup to resources
relationshipExist map[relationship]struct{} // Map to track relationships
lock sync.RWMutex // Mutex for concurrent access
}
// relationship represents the relationship between an issue and a resourceGroups.
type relationship struct {
scanner.Issue
entity.ResourceGroupHash
}
// NewScanResult creates a new instance of scanResult.
func NewScanResult() scanner.ScanResult {
return newScanResult()
}
// newScanResult creates and returns a new instance of scanResult.
func newScanResult() *scanResult {
return &scanResult{
issueResourceMap: make(map[scanner.Issue]scanner.ResourceList),
resourceIssueMap: make(map[entity.ResourceGroupHash]scanner.IssueList),
resourceGroupMap: make(map[entity.ResourceGroupHash]*storage.Resource),
relationshipExist: map[relationship]struct{}{},
lock: sync.RWMutex{},
}
}
// ByIssue returns the map of issues to resources.
func (sr *scanResult) ByIssue() map[scanner.Issue]scanner.ResourceList {
return sr.issueResourceMap
}
// ByResource returns the map of resources to issues.
func (sr *scanResult) ByResource() map[entity.ResourceGroupHash]scanner.IssueList {
return sr.resourceIssueMap
}
// IssueTotal calculates the total number of issues.
func (sr *scanResult) IssueTotal() int {
sr.lock.RLock()
defer sr.lock.RUnlock()
totalByIssueMap, totalByResourceMap := 0, 0
// Calculate total issues by scanning issueResourceMap
for _, resources := range sr.issueResourceMap {
totalByIssueMap += len(resources)
}
// Calculate total issues by scanning resourceIssueMap
for _, issues := range sr.resourceIssueMap {
totalByResourceMap += len(issues)
}
// Compare the totals and return -1 if they differ, otherwise return the total
if totalByIssueMap != totalByResourceMap {
return -1
}
return totalByIssueMap
}
// MergeFrom merges the results from another scanResult into the current one.
func (sr *scanResult) MergeFrom(result scanner.ScanResult) {
if result == nil {
return
}
newResult, ok := result.(*scanResult)
if !ok {
panic("Invalid type for merging")
}
if sr == nil {
sr = newScanResult()
}
for resourceGroup, issues := range newResult.resourceIssueMap {
if resource, exist := newResult.resourceGroupMap[resourceGroup]; exist {
sr.add(resource, issues)
}
}
}
// add adds a resource with its associated issues to the scanResult.
func (sr *scanResult) add(resource *storage.Resource, issues []*scanner.Issue) {
sr.lock.Lock()
defer sr.lock.Unlock()
if resource == nil {
return
}
if len(issues) == 0 {
issues = make([]*scanner.Issue, 0)
}
if _, exist := sr.resourceGroupMap[resource.ResourceGroup.Hash()]; !exist {
sr.resourceGroupMap[resource.ResourceGroup.Hash()] = resource
}
if _, ok := sr.resourceIssueMap[resource.ResourceGroup.Hash()]; !ok {
sr.resourceIssueMap[resource.ResourceGroup.Hash()] = make([]*scanner.Issue, 0)
}
for _, issue := range issues {
if _, ok := sr.issueResourceMap[*issue]; !ok {
sr.issueResourceMap[*issue] = make(scanner.ResourceList, 0)
}
}
for i := 0; i < len(issues); i++ {
issue := issues[i]
rel := relationship{
Issue: *issue,
ResourceGroupHash: resource.ResourceGroup.Hash(),
}
if _, exist := sr.relationshipExist[rel]; exist {
continue
}
sr.resourceIssueMap[resource.ResourceGroup.Hash()] = append(sr.resourceIssueMap[resource.ResourceGroup.Hash()], issue)
sr.issueResourceMap[*issue] = append(sr.issueResourceMap[*issue], resource)
sr.relationshipExist[rel] = struct{}{}
}
}