-
Notifications
You must be signed in to change notification settings - Fork 38
/
util.go
68 lines (59 loc) · 2.24 KB
/
util.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
// 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 scanner
import (
"sort"
"github.com/KusionStack/karpor/pkg/core/entity"
"github.com/KusionStack/karpor/pkg/infra/scanner"
)
// convertScanResultToAuditData converts the scanner.ScanResult to an AuditData
// structure containing aggregated issue and resource data.
func convertScanResultToAuditData(sr scanner.ScanResult) *AuditData {
issueGroups := make([]*IssueGroup, 0, len(sr.ByIssue()))
bySeverity := map[string]int{}
// Iterate through each issue in the ScanResult and create corresponding
// IssueGroup entries.
for issue, resources := range sr.ByIssue() {
issueGroup := &IssueGroup{
Issue: issue,
ResourceGroups: []entity.ResourceGroup{},
}
// For each resource tied to the issue, create a ResourceGroup and increment
// severity count.
for _, resource := range resources {
issueGroup.ResourceGroups = append(issueGroup.ResourceGroups, resource.ResourceGroup)
bySeverity[issue.Severity.String()]++
}
issueGroups = append(issueGroups, issueGroup)
}
// Custom sorting function for IssueGroups
sort.Slice(issueGroups, func(i, j int) bool {
// First, sort by Severity from high to low.
if issueGroups[i].Issue.Severity > issueGroups[j].Issue.Severity {
return true
} else if issueGroups[i].Issue.Severity < issueGroups[j].Issue.Severity {
return false
}
// If Severities are equal, sort by ResourceGroups array size from high to
// low.
return len(issueGroups[i].ResourceGroups) > len(issueGroups[j].ResourceGroups)
})
// Construct the AuditData structure.
return &AuditData{
IssueTotal: sr.IssueTotal(),
ResourceTotal: len(sr.ByResource()),
BySeverity: bySeverity,
IssueGroups: issueGroups,
}
}