/
archive_reconciler.go
244 lines (217 loc) · 7.36 KB
/
archive_reconciler.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
package objectdeployments
import (
"context"
"fmt"
"sort"
"k8s.io/apimachinery/pkg/api/errors"
ctrl "sigs.k8s.io/controller-runtime"
"sigs.k8s.io/controller-runtime/pkg/client"
)
const defaultRevisionLimit int32 = 10
type archiveReconciler struct {
client client.Client
}
func (a *archiveReconciler) Reconcile(ctx context.Context,
currentObjectSet genericObjectSet,
prevObjectSets []genericObjectSet,
objectDeployment objectDeploymentAccessor,
) (ctrl.Result, error) {
if currentObjectSet == nil {
return ctrl.Result{}, nil
}
objsetsEligibleForArchival, err := a.objectSetsToBeArchived(
ctx,
append(prevObjectSets, currentObjectSet),
)
if err != nil {
return ctrl.Result{}, fmt.Errorf("errored when trying to compute objects for archival: %w", err)
}
err = a.markObjectSetsForArchival(ctx, prevObjectSets, objsetsEligibleForArchival, objectDeployment)
if err != nil {
return ctrl.Result{}, err
}
return ctrl.Result{}, nil
}
func (a *archiveReconciler) markObjectSetsForArchival(ctx context.Context,
previousObjectSets []genericObjectSet,
objectsToArchive []genericObjectSet,
objectDeployment objectDeploymentAccessor,
) error {
if len(objectsToArchive) == 0 {
return nil
}
// We sort the objectsets to be archived in the increasing order
// of revision so that the earlier revisions get deleted first.
sort.Sort(objectSetsByRevisionAscending(objectsToArchive))
for _, objectSet := range objectsToArchive {
if !objectSet.IsArchived() && objectSet.IsStatusPaused() {
objectSet.SetArchived()
if err := a.client.Update(ctx, objectSet.ClientObject()); err != nil {
return fmt.Errorf("failed to archive objectset: %w", err)
}
}
// Only garbage collect older revisions if later ones successfully archive
if err := a.garbageCollectRevisions(ctx, previousObjectSets, objectDeployment); err != nil {
return fmt.Errorf("error garbage collecting revisions: %w", err)
}
}
return nil
}
func (a *archiveReconciler) objectSetsToBeArchived(
ctx context.Context,
allObjectSets []genericObjectSet,
) ([]genericObjectSet, error) {
// Sort all ObjectSets by their ascending revision number.
sort.Sort(objectSetsByRevisionAscending(allObjectSets))
objectSetsToArchive := make([]genericObjectSet, 0)
for j := len(allObjectSets) - 1; j >= 0; j-- {
currentLatestRevision := allObjectSets[j]
// Case 1:
// currentRevision is "Available",
// so all previous revisions can be archived.
if currentLatestRevision.IsAvailable() {
prevRevisionsToArchive, err := a.archiveAllLaterRevisions(ctx, currentLatestRevision, allObjectSets[:j])
if err != nil {
return []genericObjectSet{}, err
}
return append(objectSetsToArchive, prevRevisionsToArchive...), nil
}
// If prev revision is present
if j > 0 {
previousRevision := allObjectSets[j-1]
// Already archived dont do anything
if previousRevision.IsArchived() {
continue
}
if currentLatestRevision.GetRevision() <= previousRevision.GetRevision() {
// Sanity check
// We always expect the currentLatestRevision objectset to have a revision greater
// than the previous revision
continue
}
// Case 2 and 3 handled here:
shouldArchive, err := a.intermediateRevisionCanBeArchived(
ctx,
previousRevision,
currentLatestRevision,
)
if err != nil {
return []genericObjectSet{}, err
}
if shouldArchive {
objectSetsToArchive = append(objectSetsToArchive, previousRevision)
}
}
}
return objectSetsToArchive, nil
}
func (a *archiveReconciler) archiveAllLaterRevisions(
ctx context.Context,
currentLatest genericObjectSet,
laterRevisions []genericObjectSet,
) ([]genericObjectSet, error) {
res := make([]genericObjectSet, 0)
for _, currPrev := range laterRevisions {
// revision already archived, we just skip.
if currPrev.IsArchived() {
continue
}
// Sanity check
// We always expect the currentLatestRevision objectset to have a revision greater
// than the previous revision
if currPrev.GetRevision() < currentLatest.GetRevision() {
isPaused, err := a.ensurePaused(ctx, currPrev)
if err != nil {
return []genericObjectSet{}, err
}
if isPaused {
res = append(res, currPrev)
}
}
}
return res, nil
}
func (a *archiveReconciler) intermediateRevisionCanBeArchived(
ctx context.Context, previousRevision, currentLatestRevision genericObjectSet,
) (bool, error) {
latestRevisionObjects, err := currentLatestRevision.GetObjects()
if err != nil {
return false, err
}
previousRevisionActivelyReconciledObjects := previousRevision.GetActivelyReconciledObjects()
// Actively reconciled status is not yet updated
if previousRevisionActivelyReconciledObjects == nil {
// Skip for now, this previousRevision's archival candidature will be checked
// when its controllerOf status block gets updated.
return false, nil
}
// Case 2:
// If a revision has no actively reconciled objects, it can be marked for archival.
// Here, if previousRevision has no actively reconciled objects, `commonObjects` will
// be an empty list and thus it will get marked for archival.
// Case 3:
// Latest revision is not containing any object still actively reconciled by an intermediate.
// Here if the current `latestRevisionObjects`` doesnt contain any objects in the previous
// revision's actively reconciled object list (previousRevisionActivelyReconciledObjects)
// then the current previous revision can be marked for archival. (IF the previous revision
// is not available).
commonObjects := intersection(latestRevisionObjects, previousRevisionActivelyReconciledObjects)
if len(commonObjects) == 0 && !previousRevision.IsAvailable() {
// This previousRevision is a candidate for archival but we only
// proceed to archive it after its paused.
isPaused, err := a.ensurePaused(ctx, previousRevision)
if err != nil {
return false, err
}
return isPaused, nil
}
return false, nil
}
func (a *archiveReconciler) ensurePaused(ctx context.Context, objectset genericObjectSet) (bool, error) {
if objectset.IsStatusPaused() {
return true, nil
}
if objectset.IsSpecPaused() {
// Revision is already marked for pausing but is
// not yet reflected in its status block
return false, nil
}
// Pause the revision
objectset.SetPaused()
if err := a.client.Update(ctx, objectset.ClientObject()); err != nil {
return false, fmt.Errorf("failed to pause objectset for archival: %w", err)
}
return false, nil
}
func intersection(a, b []objectIdentifier) (res []objectIdentifier) {
foundItems := make(map[string]struct{})
for _, item := range a {
foundItems[item.UniqueIdentifier()] = struct{}{}
}
for _, item := range b {
if _, found := foundItems[item.UniqueIdentifier()]; found {
res = append(res, item)
}
}
return
}
func (a *archiveReconciler) garbageCollectRevisions(
ctx context.Context, previousObjectSets []genericObjectSet, objectDeployment objectDeploymentAccessor,
) error {
revisionLimit := defaultRevisionLimit
deploymentRevisionLimit := objectDeployment.GetRevisionHistoryLimit()
if deploymentRevisionLimit != nil {
revisionLimit = *deploymentRevisionLimit
}
numToDelete := len(previousObjectSets) - int(revisionLimit)
for _, previousObjectSet := range previousObjectSets {
if numToDelete <= 0 {
break
}
if err := a.client.Delete(ctx, previousObjectSet.ClientObject()); err != nil && !errors.IsNotFound(err) {
return fmt.Errorf("failed to delete objectset: %w", err)
}
numToDelete--
}
return nil
}