mirror of
https://github.com/zrepl/zrepl.git
synced 2024-11-25 09:54:47 +01:00
428a60870a
package is now at 95% code coverage and the additional tests codify
all behavior specified in the docs
There is a slight change in behavior:
Intervals are now [duration) instead of (duration].
If the leftmost interval is not keep=all, the most recently created
snapshot will be destroyed if there are other snapshots within
that first interval.
Since we recommend keep=all all over the docs, and zrepl 0.3
will put holds on that snapshot if it is being replicated,
I feel like this is an acceptable change in behavior.
refs #292
fixup of 0bbe2befce
117 lines
2.9 KiB
Go
117 lines
2.9 KiB
Go
package pruning
|
|
|
|
import (
|
|
"fmt"
|
|
"regexp"
|
|
"time"
|
|
|
|
"github.com/pkg/errors"
|
|
|
|
"github.com/zrepl/zrepl/config"
|
|
"github.com/zrepl/zrepl/pruning/retentiongrid"
|
|
)
|
|
|
|
// KeepGrid fits snapshots that match a given regex into a retentiongrid.Grid,
|
|
// uses the most recent snapshot among those that match the regex as 'now',
|
|
// and deletes all snapshots that do not fit the grid specification.
|
|
type KeepGrid struct {
|
|
retentionGrid *retentiongrid.Grid
|
|
re *regexp.Regexp
|
|
}
|
|
|
|
func NewKeepGrid(in *config.PruneGrid) (p *KeepGrid, err error) {
|
|
|
|
if in.Regex == "" {
|
|
return nil, fmt.Errorf("Regex must not be empty")
|
|
}
|
|
re, err := regexp.Compile(in.Regex)
|
|
if err != nil {
|
|
return nil, errors.Wrap(err, "Regex is invalid")
|
|
}
|
|
|
|
return newKeepGrid(re, in.Grid)
|
|
}
|
|
|
|
func MustNewKeepGrid(regex, gridspec string) *KeepGrid {
|
|
|
|
ris, err := config.ParseRetentionIntervalSpec(gridspec)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
|
|
re := regexp.MustCompile(regex)
|
|
|
|
grid, err := newKeepGrid(re, ris)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
return grid
|
|
}
|
|
|
|
func newKeepGrid(re *regexp.Regexp, configIntervals []config.RetentionInterval) (*KeepGrid, error) {
|
|
if re == nil {
|
|
panic("re must not be nil")
|
|
}
|
|
|
|
if len(configIntervals) == 0 {
|
|
return nil, errors.New("retention grid must specify at least one interval")
|
|
}
|
|
|
|
intervals := make([]retentiongrid.Interval, len(configIntervals))
|
|
for i := range configIntervals {
|
|
intervals[i] = &configIntervals[i]
|
|
}
|
|
|
|
// Assert intervals are of increasing length (not necessarily required, but indicates config mistake)
|
|
lastDuration := time.Duration(0)
|
|
for i := range intervals {
|
|
|
|
if intervals[i].Length() < lastDuration {
|
|
// If all intervals before were keep=all, this is ok
|
|
allPrevKeepCountAll := true
|
|
for j := i - 1; allPrevKeepCountAll && j >= 0; j-- {
|
|
allPrevKeepCountAll = intervals[j].KeepCount() == config.RetentionGridKeepCountAll
|
|
}
|
|
if allPrevKeepCountAll {
|
|
goto isMonotonicIncrease
|
|
}
|
|
return nil, errors.New("retention grid interval length must be monotonically increasing")
|
|
}
|
|
isMonotonicIncrease:
|
|
lastDuration = intervals[i].Length()
|
|
}
|
|
|
|
return &KeepGrid{
|
|
retentionGrid: retentiongrid.NewGrid(intervals),
|
|
re: re,
|
|
}, nil
|
|
}
|
|
|
|
// Prune filters snapshots with the retention grid.
|
|
func (p *KeepGrid) KeepRule(snaps []Snapshot) (destroyList []Snapshot) {
|
|
|
|
matching, notMatching := partitionSnapList(snaps, func(snapshot Snapshot) bool {
|
|
return p.re.MatchString(snapshot.Name())
|
|
})
|
|
|
|
// snaps that don't match the regex are not kept by this rule
|
|
destroyList = append(destroyList, notMatching...)
|
|
|
|
if len(matching) == 0 {
|
|
return destroyList
|
|
}
|
|
|
|
// Evaluate retention grid
|
|
entrySlice := make([]retentiongrid.Entry, 0)
|
|
for i := range matching {
|
|
entrySlice = append(entrySlice, matching[i])
|
|
}
|
|
_, gridDestroyList := p.retentionGrid.FitEntries(entrySlice)
|
|
|
|
// Revert adaptors
|
|
for i := range gridDestroyList {
|
|
destroyList = append(destroyList, gridDestroyList[i].(Snapshot))
|
|
}
|
|
return destroyList
|
|
}
|