-
Notifications
You must be signed in to change notification settings - Fork 6
/
difference.go
343 lines (295 loc) · 9.36 KB
/
difference.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
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
// SPDX-FileCopyrightText: 2024 SAP SE or an SAP affiliate company and Gardener contributors
//
// SPDX-License-Identifier: Apache-2.0
package report
import (
"cmp"
"errors"
"fmt"
"slices"
"strings"
"time"
"github.com/gardener/diki/pkg/rule"
)
// DifferenceReportsWrapper wraps DifferenceReports and additional attributes needed for html rendering.
type DifferenceReportsWrapper struct {
DifferenceReports []*DifferenceReport `json:"differenceReports"`
IdentityAttributes map[string]string `json:"identityAttributes"`
}
// DifferenceReport contains the difference between two reports.
type DifferenceReport struct {
Title string `json:"title,omitempty"`
Time time.Time `json:"time"`
MinStatus rule.Status `json:"minStatus,omitempty"`
Providers []ProviderDifference `json:"providers"`
}
// ProviderDifference contains the difference between two reports
// for a known provider and its ran rulesets.
type ProviderDifference struct {
ID string `json:"id"`
Name string `json:"name"`
OldMetadata map[string]string `json:"oldMetadata,omitempty"`
NewMetadata map[string]string `json:"newMetadata,omitempty"`
Rulesets []RulesetDifference `json:"rulesets"`
}
// RulesetDifference contains the difference between two reports
// for a ruleset and its rules.
type RulesetDifference struct {
ID string `json:"id"`
Name string `json:"name"`
Version string `json:"version"`
Rules []RuleDifference `json:"rules"`
}
// RuleDifference contains the difference between two reports for a single rule.
type RuleDifference struct {
ID string `json:"id"`
Name string `json:"name"`
Added []Check `json:"added,omitempty"`
Removed []Check `json:"removed,omitempty"`
}
// CreateDifference creates the difference between two reports.
func CreateDifference(oldReport Report, newReport Report, title string) (*DifferenceReport, error) {
var minStatus rule.Status
switch {
case oldReport.MinStatus == newReport.MinStatus:
minStatus = oldReport.MinStatus
case len(oldReport.MinStatus) == 0:
minStatus = newReport.MinStatus
case len(newReport.MinStatus) == 0:
minStatus = oldReport.MinStatus
default:
return nil, errors.New("reports must have equal minStatus")
}
diff := &DifferenceReport{
Title: title,
Time: time.Now(),
MinStatus: minStatus,
Providers: []ProviderDifference{},
}
providers := getUniqueProviders(oldReport.Providers, newReport.Providers)
for _, provider := range providers {
oldProviderIdx := slices.IndexFunc(oldReport.Providers, func(p Provider) bool {
return p.ID == provider
})
oldProvider := Provider{}
if oldProviderIdx >= 0 {
oldProvider = oldReport.Providers[oldProviderIdx]
}
newProviderIdx := slices.IndexFunc(newReport.Providers, func(p Provider) bool {
return p.ID == provider
})
newProvider := Provider{}
if newProviderIdx >= 0 {
newProvider = newReport.Providers[newProviderIdx]
}
rulesets := getUniqueRulesets(oldProvider.Rulesets, newProvider.Rulesets)
var rulesetDiff []RulesetDifference
for id, versions := range rulesets {
for _, version := range versions {
oldRulesetIdx := slices.IndexFunc(oldProvider.Rulesets, func(r Ruleset) bool {
return r.ID == id && r.Version == version
})
oldRuleset := Ruleset{}
if oldRulesetIdx >= 0 {
oldRuleset = oldProvider.Rulesets[oldRulesetIdx]
}
newRulesetIdx := slices.IndexFunc(newProvider.Rulesets, func(r Ruleset) bool {
return r.ID == id && r.Version == version
})
newRuleset := Ruleset{}
if newRulesetIdx >= 0 {
newRuleset = newProvider.Rulesets[newRulesetIdx]
}
rulesetName := newRuleset.Name
if len(rulesetName) == 0 {
rulesetName = oldRuleset.Name
}
rulesetDiff = append(rulesetDiff, RulesetDifference{
ID: id,
Name: rulesetName,
Version: version,
Rules: getRulesDifference(oldRuleset.Rules, newRuleset.Rules),
})
}
}
// sort ruleset alphabetically to ensure static order
slices.SortFunc(rulesetDiff, func(a, b RulesetDifference) int {
return cmp.Compare(a.ID, b.ID)
})
var (
oldMetadata = map[string]string{}
newMetadata = map[string]string{}
)
for k, v := range oldProvider.Metadata {
oldMetadata[k] = v
}
for k, v := range newProvider.Metadata {
newMetadata[k] = v
}
oldMetadata["time"] = oldReport.Time.Format(time.RFC3339)
newMetadata["time"] = newReport.Time.Format(time.RFC3339)
providerName := newProvider.Name
if len(providerName) == 0 {
providerName = oldProvider.Name
}
diff.Providers = append(diff.Providers, ProviderDifference{
ID: provider,
Name: providerName,
OldMetadata: oldMetadata,
NewMetadata: newMetadata,
Rulesets: rulesetDiff,
})
}
return diff, nil
}
func getRulesDifference(oldRules, newRules []Rule) []RuleDifference {
var (
ruleDiff []RuleDifference
addedChecks = getCheckDifference(newRules, oldRules)
removedChecks = getCheckDifference(oldRules, newRules)
)
for _, newCheck := range addedChecks {
ruleDiff = append(ruleDiff, RuleDifference{
ID: newCheck.ID,
Name: newCheck.Name,
Added: newCheck.Checks,
})
}
for _, removedCheck := range removedChecks {
idx := slices.IndexFunc(ruleDiff, func(r RuleDifference) bool {
return r.ID == removedCheck.ID
})
if idx >= 0 {
ruleDiff[idx].Removed = removedCheck.Checks
continue
}
ruleDiff = append(ruleDiff, RuleDifference{
ID: removedCheck.ID,
Name: removedCheck.Name,
Removed: removedCheck.Checks,
})
}
// sort rules by id
slices.SortFunc(ruleDiff, func(a, b RuleDifference) int {
return cmp.Compare(a.ID, b.ID)
})
return ruleDiff
}
// getCheckDifference returns all rules with checks
// that are present in rules1 but missing in rules2
func getCheckDifference(rules1, rules2 []Rule) []Rule {
var uniqueRulesChecks []Rule
for _, rule1 := range rules1 {
var (
checks2 []Check
difference []Check
)
rules2Idx := slices.IndexFunc(rules2, func(r Rule) bool {
return r.ID == rule1.ID
})
if rules2Idx >= 0 {
checks2 = rules2[rules2Idx].Checks
}
for _, check1 := range rule1.Checks {
oldCheckIdx := slices.IndexFunc(checks2, func(c Check) bool {
return c.Status == check1.Status && c.Message == check1.Message
})
if oldCheckIdx < 0 {
// we do not want targets in diff since they are not taken into account
check1.Targets = nil
difference = append(difference, check1)
}
}
if len(difference) > 0 {
uniqueRulesChecks = append(uniqueRulesChecks, Rule{
ID: rule1.ID,
Name: rule1.Name,
Checks: difference,
})
}
}
return uniqueRulesChecks
}
// getUniqueProviders returns a list of all unique
// provider IDs contained in providers1 and providers2.
func getUniqueProviders(providers1, providers2 []Provider) []string {
var providers []string
for _, p1 := range providers1 {
providers = append(providers, p1.ID)
}
for _, p2 := range providers2 {
p1Idx := slices.IndexFunc(providers1, func(p1 Provider) bool {
return p2.ID == p1.ID
})
if p1Idx < 0 {
providers = append(providers, p2.ID)
}
}
return providers
}
// getUniqueRulesets returns a map of all unique rulesets,
// where the maps keys are ruleset IDs and the values are a
// list of all unique versions in rulests1 and rulests2.
func getUniqueRulesets(rulesets1, rulesets2 []Ruleset) map[string][]string {
rulesets := map[string][]string{}
for _, rs1 := range rulesets1 {
rulesets[rs1.ID] = append(rulesets[rs1.ID], rs1.Version)
}
for _, rs2 := range rulesets2 {
rs1Idx := slices.IndexFunc(rulesets1, func(rs1 Ruleset) bool {
return rs2.ID == rs1.ID && rs2.Version == rs1.Version
})
if rs1Idx < 0 {
rulesets[rs2.ID] = append(rulesets[rs2.ID], rs2.Version)
}
}
return rulesets
}
// rulesetDiffAddedSummaryText returns a summary string with the number of added status types.
func rulesetDiffAddedSummaryText(ruleset *RulesetDifference) string {
var added = map[rule.Status]int{}
for _, rule := range ruleset.Rules {
for _, check := range rule.Added {
added[check.Status]++
}
}
return rulesetDiffSummaryText(added)
}
// rulesetDiffRemovedSummaryText returns a summary string with the number of removed status types.
func rulesetDiffRemovedSummaryText(ruleset *RulesetDifference) string {
var removed = map[rule.Status]int{}
for _, rule := range ruleset.Rules {
for _, check := range rule.Removed {
removed[check.Status]++
}
}
return rulesetDiffSummaryText(removed)
}
func rulesetDiffSummaryText(statusesCount map[rule.Status]int) string {
var (
summaryBuilder strings.Builder
statuses = rule.Statuses()
)
for _, status := range statuses {
if val, ok := statusesCount[status]; ok {
if summaryBuilder.Len() > 0 {
summaryBuilder.WriteString(", ")
}
summaryBuilder.WriteString(fmt.Sprintf("%dx %s %c", val, status, rule.GetStatusIcon(status)))
}
}
if summaryBuilder.Len() == 0 {
return "None"
}
return summaryBuilder.String()
}
func getProviderDiffIDText(providerDiff ProviderDifference, key string) string {
switch {
case len(providerDiff.OldMetadata[key]) == 0 && len(providerDiff.NewMetadata[key]) == 0:
return ""
case providerDiff.OldMetadata[key] == providerDiff.NewMetadata[key]:
return fmt.Sprintf("- %s", providerDiff.NewMetadata[key])
default:
return fmt.Sprintf("- %s/%s", providerDiff.OldMetadata[key], providerDiff.NewMetadata[key])
}
}