compactor: support finer retention period in compactor.go

This commit is contained in:
fanmin shi 2017-09-26 16:22:02 -07:00
parent 733de98cfb
commit 253259452b
3 changed files with 51 additions and 53 deletions

View File

@ -30,7 +30,6 @@ var (
const ( const (
checkCompactionInterval = 5 * time.Minute checkCompactionInterval = 5 * time.Minute
executeCompactionInterval = time.Hour
ModePeriodic = "periodic" ModePeriodic = "periodic"
ModeRevision = "revision" ModeRevision = "revision"
@ -57,7 +56,7 @@ type RevGetter interface {
Rev() int64 Rev() int64
} }
func New(mode string, retention int, rg RevGetter, c Compactable) (Compactor, error) { func New(mode string, retention time.Duration, rg RevGetter, c Compactable) (Compactor, error) {
switch mode { switch mode {
case ModePeriodic: case ModePeriodic:
return NewPeriodic(retention, rg, c), nil return NewPeriodic(retention, rg, c), nil

View File

@ -26,10 +26,10 @@ import (
) )
// Periodic compacts the log by purging revisions older than // Periodic compacts the log by purging revisions older than
// the configured retention time. Compaction happens hourly. // the configured retention time.
type Periodic struct { type Periodic struct {
clock clockwork.Clock clock clockwork.Clock
periodInHour int period time.Duration
rg RevGetter rg RevGetter
c Compactable c Compactable
@ -38,26 +38,30 @@ type Periodic struct {
ctx context.Context ctx context.Context
cancel context.CancelFunc cancel context.CancelFunc
mu sync.Mutex // mu protects paused
mu sync.RWMutex
paused bool paused bool
} }
// NewPeriodic creates a new instance of Periodic compactor that purges // NewPeriodic creates a new instance of Periodic compactor that purges
// the log older than h hours. // the log older than h Duration.
func NewPeriodic(h int, rg RevGetter, c Compactable) *Periodic { func NewPeriodic(h time.Duration, rg RevGetter, c Compactable) *Periodic {
return &Periodic{ return &Periodic{
clock: clockwork.NewRealClock(), clock: clockwork.NewRealClock(),
periodInHour: h, period: h,
rg: rg, rg: rg,
c: c, c: c,
} }
} }
// periodDivisor divides Periodic.period in into checkCompactInterval duration
const periodDivisor = 10
func (t *Periodic) Run() { func (t *Periodic) Run() {
t.ctx, t.cancel = context.WithCancel(context.Background()) t.ctx, t.cancel = context.WithCancel(context.Background())
t.revs = make([]int64, 0) t.revs = make([]int64, 0)
clock := t.clock clock := t.clock
checkCompactInterval := t.period / time.Duration(periodDivisor)
go func() { go func() {
last := clock.Now() last := clock.Now()
for { for {
@ -65,7 +69,7 @@ func (t *Periodic) Run() {
select { select {
case <-t.ctx.Done(): case <-t.ctx.Done():
return return
case <-clock.After(checkCompactionInterval): case <-clock.After(checkCompactInterval):
t.mu.Lock() t.mu.Lock()
p := t.paused p := t.paused
t.mu.Unlock() t.mu.Unlock()
@ -73,25 +77,21 @@ func (t *Periodic) Run() {
continue continue
} }
} }
if clock.Now().Sub(last) < t.period {
if clock.Now().Sub(last) < executeCompactionInterval {
continue continue
} }
rev, remaining := t.getRev()
rev, remaining := t.getRev(t.periodInHour)
if rev < 0 { if rev < 0 {
continue continue
} }
plog.Noticef("Starting auto-compaction at revision %d (retention: %v)", rev, t.period)
plog.Noticef("Starting auto-compaction at revision %d (retention: %d hours)", rev, t.periodInHour)
_, err := t.c.Compact(t.ctx, &pb.CompactionRequest{Revision: rev}) _, err := t.c.Compact(t.ctx, &pb.CompactionRequest{Revision: rev})
if err == nil || err == mvcc.ErrCompacted { if err == nil || err == mvcc.ErrCompacted {
t.revs = remaining t.revs = remaining
last = clock.Now()
plog.Noticef("Finished auto-compaction at revision %d", rev) plog.Noticef("Finished auto-compaction at revision %d", rev)
} else { } else {
plog.Noticef("Failed auto-compaction at revision %d (%v)", err, rev) plog.Noticef("Failed auto-compaction at revision %d (%v)", rev, err)
plog.Noticef("Retry after %v", checkCompactionInterval) plog.Noticef("Retry after %v", checkCompactInterval)
} }
} }
}() }()
@ -113,8 +113,8 @@ func (t *Periodic) Resume() {
t.paused = false t.paused = false
} }
func (t *Periodic) getRev(h int) (int64, []int64) { func (t *Periodic) getRev() (int64, []int64) {
i := len(t.revs) - int(time.Duration(h)*time.Hour/checkCompactionInterval) i := len(t.revs) - periodDivisor
if i < 0 { if i < 0 {
return -1, t.revs return -1, t.revs
} }

View File

@ -26,39 +26,36 @@ import (
func TestPeriodic(t *testing.T) { func TestPeriodic(t *testing.T) {
retentionHours := 2 retentionHours := 2
retentionDuration := time.Duration(retentionHours) * time.Hour
fc := clockwork.NewFakeClock() fc := clockwork.NewFakeClock()
rg := &fakeRevGetter{testutil.NewRecorderStream(), 0} rg := &fakeRevGetter{testutil.NewRecorderStream(), 0}
compactable := &fakeCompactable{testutil.NewRecorderStream()} compactable := &fakeCompactable{testutil.NewRecorderStream()}
tb := &Periodic{ tb := &Periodic{
clock: fc, clock: fc,
periodInHour: retentionHours, period: retentionDuration,
rg: rg, rg: rg,
c: compactable, c: compactable,
} }
tb.Run() tb.Run()
defer tb.Stop() defer tb.Stop()
checkCompactInterval := retentionDuration / time.Duration(periodDivisor)
n := int(time.Hour / checkCompactionInterval) n := periodDivisor
// collect 5 hours of revisions // simulate 5 hours worth of intervals.
for i := 0; i < 5; i++ { for i := 0; i < n/retentionHours*5; i++ {
// advance one hour, one revision for each interval
for j := 0; j < n; j++ {
rg.Wait(1) rg.Wait(1)
fc.Advance(checkCompactionInterval) fc.Advance(checkCompactInterval)
} // compaction doesn't happen til 2 hours elapses.
if i < n {
// compaction doesn't happen til 2 hours elapses
if i+1 < retentionHours {
continue continue
} }
// after 2 hours, compaction happens at every checkCompactInterval.
a, err := compactable.Wait(1) a, err := compactable.Wait(1)
if err != nil { if err != nil {
t.Fatal(err) t.Fatal(err)
} }
expectedRevision := int64(1 + (i+1)*n - retentionHours*n) expectedRevision := int64(i + 1 - n)
if !reflect.DeepEqual(a[0].Params[0], &pb.CompactionRequest{Revision: expectedRevision}) { if !reflect.DeepEqual(a[0].Params[0], &pb.CompactionRequest{Revision: expectedRevision}) {
t.Errorf("compact request = %v, want %v", a[0].Params[0], &pb.CompactionRequest{Revision: expectedRevision}) t.Errorf("compact request = %v, want %v", a[0].Params[0], &pb.CompactionRequest{Revision: expectedRevision})
} }
@ -75,9 +72,10 @@ func TestPeriodicPause(t *testing.T) {
fc := clockwork.NewFakeClock() fc := clockwork.NewFakeClock()
compactable := &fakeCompactable{testutil.NewRecorderStream()} compactable := &fakeCompactable{testutil.NewRecorderStream()}
rg := &fakeRevGetter{testutil.NewRecorderStream(), 0} rg := &fakeRevGetter{testutil.NewRecorderStream(), 0}
retentionDuration := time.Hour
tb := &Periodic{ tb := &Periodic{
clock: fc, clock: fc,
periodInHour: 1, period: retentionDuration,
rg: rg, rg: rg,
c: compactable, c: compactable,
} }
@ -86,10 +84,11 @@ func TestPeriodicPause(t *testing.T) {
tb.Pause() tb.Pause()
// tb will collect 3 hours of revisions but not compact since paused // tb will collect 3 hours of revisions but not compact since paused
n := int(time.Hour / checkCompactionInterval) checkCompactInterval := retentionDuration / time.Duration(periodDivisor)
n := periodDivisor
for i := 0; i < 3*n; i++ { for i := 0; i < 3*n; i++ {
rg.Wait(1) rg.Wait(1)
fc.Advance(checkCompactionInterval) fc.Advance(checkCompactInterval)
} }
// tb ends up waiting for the clock // tb ends up waiting for the clock
@ -102,14 +101,14 @@ func TestPeriodicPause(t *testing.T) {
// tb resumes to being blocked on the clock // tb resumes to being blocked on the clock
tb.Resume() tb.Resume()
// unblock clock, will kick off a compaction at hour 3:05 // unblock clock, will kick off a compaction at hour 3:06
rg.Wait(1) rg.Wait(1)
fc.Advance(checkCompactionInterval) fc.Advance(checkCompactInterval)
a, err := compactable.Wait(1) a, err := compactable.Wait(1)
if err != nil { if err != nil {
t.Fatal(err) t.Fatal(err)
} }
// compact the revision from hour 2:05 // compact the revision from hour 2:06
wreq := &pb.CompactionRequest{Revision: int64(1 + 2*n + 1)} wreq := &pb.CompactionRequest{Revision: int64(1 + 2*n + 1)}
if !reflect.DeepEqual(a[0].Params[0], wreq) { if !reflect.DeepEqual(a[0].Params[0], wreq) {
t.Errorf("compact request = %v, want %v", a[0].Params[0], wreq.Revision) t.Errorf("compact request = %v, want %v", a[0].Params[0], wreq.Revision)