Merge pull request #669 from Random-Liu/cleanup-event-backoff

Cleanup event backoff.

pkg/server/events.go

@@ -82,8 +82,7 @@ func newEventMonitor(c *containerstore.Store, s *sandboxstore.Store) *eventMonit
 		sandboxStore:   s,
 		ctx:            ctx,
 		cancel:         cancel,
-		backOff: newBackOff(backOffInitDuration, backOffMaxDuration,
+		backOff:        newBackOff(),
-			backOffExpireCheckDuration, clock.RealClock{}),
 	}
 }
 
@@ -134,6 +133,7 @@ func (em *eventMonitor) start() (<-chan struct{}, error) {
 					break
 				}
 				if em.backOff.isInBackOff(cID) {
+					logrus.Infof("Events for container %q is in backoff, enqueue event %+v", cID, evt)
 					em.backOff.enBackOff(cID, evt)
 					break
 				}
@@ -314,13 +314,13 @@ func handleSandboxExit(ctx context.Context, e *eventtypes.TaskExit, sb sandboxst
 	return nil
 }
 
-func newBackOff(min, max, check time.Duration, c clock.Clock) *backOff {
+func newBackOff() *backOff {
 	return &backOff{
 		queuePool:     map[string]*backOffQueue{},
-		minDuration:   min,
+		minDuration:   backOffInitDuration,
-		maxDuration:   max,
+		maxDuration:   backOffMaxDuration,
-		checkDuration: check,
+		checkDuration: backOffExpireCheckDuration,
-		clock:         c,
+		clock:         clock.RealClock{},
 	}
 }
 

pkg/server/events_test.go

@@ -68,7 +68,8 @@ func TestBackOff(t *testing.T) {
 	}
 
 	t.Logf("Should be able to backOff a event")
-	actual := newBackOff(backOffInitDuration, backOffMaxDuration, backOffExpireCheckDuration, testClock)
+	actual := newBackOff()
+	actual.clock = testClock
 	for k, queue := range inputQueues {
 		for _, event := range queue.events {
 			actual.enBackOff(k, event)
@@ -92,18 +93,16 @@ func TestBackOff(t *testing.T) {
 	notExistKey := "containerNotExist"
 	assert.Equal(t, actual.isInBackOff(notExistKey), false)
 
+	t.Logf("No containers should be expired")
+	assert.Empty(t, actual.getExpiredContainers())
+
 	t.Logf("Should be able to get all keys which are expired for backOff")
 	testClock.Sleep(backOffInitDuration)
-	expKeyMap := map[string]struct{}{}
-	for k := range inputQueues {
-		expKeyMap[k] = struct{}{}
-	}
 	actKeyList := actual.getExpiredContainers()
-	actKeyMap := map[string]struct{}{} //assert.Equal can't compare slice without order
+	assert.Equal(t, len(inputQueues), len(actKeyList))
-	for _, k := range actKeyList {
+	for k := range inputQueues {
-		actKeyMap[k] = struct{}{}
+		assert.Contains(t, actKeyList, k)
 	}
-	assert.Equal(t, actKeyMap, expKeyMap)
 
 	t.Logf("Should be able to get out all backOff events")
 	doneQueues := map[string]*backOffQueue{}