|
|
@@ -26,6 +26,7 @@ import (
|
|
|
"time"
|
|
|
|
|
|
"github.com/coreos/etcd/mvcc/backend"
|
|
|
+ "go.uber.org/zap"
|
|
|
)
|
|
|
|
|
|
const (
|
|
|
@@ -37,11 +38,12 @@ const (
|
|
|
// The granted lease should have a unique ID with a term
|
|
|
// that is greater than minLeaseTTL.
|
|
|
func TestLessorGrant(t *testing.T) {
|
|
|
+ lg := zap.NewNop()
|
|
|
dir, be := NewTestBackend(t)
|
|
|
defer os.RemoveAll(dir)
|
|
|
defer be.Close()
|
|
|
|
|
|
- le := newLessor(be, minLeaseTTL)
|
|
|
+ le := newLessor(lg, be, LessorConfig{MinLeaseTTL: minLeaseTTL})
|
|
|
defer le.Stop()
|
|
|
le.Promote(0)
|
|
|
|
|
|
@@ -98,11 +100,12 @@ func TestLessorGrant(t *testing.T) {
|
|
|
// TestLeaseConcurrentKeys ensures Lease.Keys method calls are guarded
|
|
|
// from concurrent map writes on 'itemSet'.
|
|
|
func TestLeaseConcurrentKeys(t *testing.T) {
|
|
|
+ lg := zap.NewNop()
|
|
|
dir, be := NewTestBackend(t)
|
|
|
defer os.RemoveAll(dir)
|
|
|
defer be.Close()
|
|
|
|
|
|
- le := newLessor(be, minLeaseTTL)
|
|
|
+ le := newLessor(lg, be, LessorConfig{MinLeaseTTL: minLeaseTTL})
|
|
|
defer le.Stop()
|
|
|
le.SetRangeDeleter(func() TxnDelete { return newFakeDeleter(be) })
|
|
|
|
|
|
@@ -146,11 +149,12 @@ func TestLeaseConcurrentKeys(t *testing.T) {
|
|
|
// the backend.
|
|
|
// The revoked lease cannot be got from Lessor again.
|
|
|
func TestLessorRevoke(t *testing.T) {
|
|
|
+ lg := zap.NewNop()
|
|
|
dir, be := NewTestBackend(t)
|
|
|
defer os.RemoveAll(dir)
|
|
|
defer be.Close()
|
|
|
|
|
|
- le := newLessor(be, minLeaseTTL)
|
|
|
+ le := newLessor(lg, be, LessorConfig{MinLeaseTTL: minLeaseTTL})
|
|
|
defer le.Stop()
|
|
|
var fd *fakeDeleter
|
|
|
le.SetRangeDeleter(func() TxnDelete {
|
|
|
@@ -198,11 +202,12 @@ func TestLessorRevoke(t *testing.T) {
|
|
|
|
|
|
// TestLessorRenew ensures Lessor can renew an existing lease.
|
|
|
func TestLessorRenew(t *testing.T) {
|
|
|
+ lg := zap.NewNop()
|
|
|
dir, be := NewTestBackend(t)
|
|
|
defer be.Close()
|
|
|
defer os.RemoveAll(dir)
|
|
|
|
|
|
- le := newLessor(be, minLeaseTTL)
|
|
|
+ le := newLessor(lg, be, LessorConfig{MinLeaseTTL: minLeaseTTL})
|
|
|
defer le.Stop()
|
|
|
le.Promote(0)
|
|
|
|
|
|
@@ -234,12 +239,13 @@ func TestLessorRenew(t *testing.T) {
|
|
|
func TestLessorRenewExtendPileup(t *testing.T) {
|
|
|
oldRevokeRate := leaseRevokeRate
|
|
|
defer func() { leaseRevokeRate = oldRevokeRate }()
|
|
|
+ lg := zap.NewNop()
|
|
|
leaseRevokeRate = 10
|
|
|
|
|
|
dir, be := NewTestBackend(t)
|
|
|
defer os.RemoveAll(dir)
|
|
|
|
|
|
- le := newLessor(be, minLeaseTTL)
|
|
|
+ le := newLessor(lg, be, LessorConfig{MinLeaseTTL: minLeaseTTL})
|
|
|
ttl := int64(10)
|
|
|
for i := 1; i <= leaseRevokeRate*10; i++ {
|
|
|
if _, err := le.Grant(LeaseID(2*i), ttl); err != nil {
|
|
|
@@ -258,7 +264,7 @@ func TestLessorRenewExtendPileup(t *testing.T) {
|
|
|
bcfg.Path = filepath.Join(dir, "be")
|
|
|
be = backend.New(bcfg)
|
|
|
defer be.Close()
|
|
|
- le = newLessor(be, minLeaseTTL)
|
|
|
+ le = newLessor(lg, be, LessorConfig{MinLeaseTTL: minLeaseTTL})
|
|
|
defer le.Stop()
|
|
|
|
|
|
// extend after recovery should extend expiration on lease pile-up
|
|
|
@@ -283,11 +289,12 @@ func TestLessorRenewExtendPileup(t *testing.T) {
|
|
|
}
|
|
|
|
|
|
func TestLessorDetach(t *testing.T) {
|
|
|
+ lg := zap.NewNop()
|
|
|
dir, be := NewTestBackend(t)
|
|
|
defer os.RemoveAll(dir)
|
|
|
defer be.Close()
|
|
|
|
|
|
- le := newLessor(be, minLeaseTTL)
|
|
|
+ le := newLessor(lg, be, LessorConfig{MinLeaseTTL: minLeaseTTL})
|
|
|
defer le.Stop()
|
|
|
le.SetRangeDeleter(func() TxnDelete { return newFakeDeleter(be) })
|
|
|
|
|
|
@@ -323,11 +330,12 @@ func TestLessorDetach(t *testing.T) {
|
|
|
// TestLessorRecover ensures Lessor recovers leases from
|
|
|
// persist backend.
|
|
|
func TestLessorRecover(t *testing.T) {
|
|
|
+ lg := zap.NewNop()
|
|
|
dir, be := NewTestBackend(t)
|
|
|
defer os.RemoveAll(dir)
|
|
|
defer be.Close()
|
|
|
|
|
|
- le := newLessor(be, minLeaseTTL)
|
|
|
+ le := newLessor(lg, be, LessorConfig{MinLeaseTTL: minLeaseTTL})
|
|
|
defer le.Stop()
|
|
|
l1, err1 := le.Grant(1, 10)
|
|
|
l2, err2 := le.Grant(2, 20)
|
|
|
@@ -336,7 +344,7 @@ func TestLessorRecover(t *testing.T) {
|
|
|
}
|
|
|
|
|
|
// Create a new lessor with the same backend
|
|
|
- nle := newLessor(be, minLeaseTTL)
|
|
|
+ nle := newLessor(lg, be, LessorConfig{MinLeaseTTL: minLeaseTTL})
|
|
|
defer nle.Stop()
|
|
|
nl1 := nle.Lookup(l1.ID)
|
|
|
if nl1 == nil || nl1.ttl != l1.ttl {
|
|
|
@@ -350,13 +358,14 @@ func TestLessorRecover(t *testing.T) {
|
|
|
}
|
|
|
|
|
|
func TestLessorExpire(t *testing.T) {
|
|
|
+ lg := zap.NewNop()
|
|
|
dir, be := NewTestBackend(t)
|
|
|
defer os.RemoveAll(dir)
|
|
|
defer be.Close()
|
|
|
|
|
|
testMinTTL := int64(1)
|
|
|
|
|
|
- le := newLessor(be, testMinTTL)
|
|
|
+ le := newLessor(lg, be, LessorConfig{MinLeaseTTL: testMinTTL})
|
|
|
defer le.Stop()
|
|
|
|
|
|
le.Promote(1 * time.Second)
|
|
|
@@ -402,13 +411,14 @@ func TestLessorExpire(t *testing.T) {
|
|
|
}
|
|
|
|
|
|
func TestLessorExpireAndDemote(t *testing.T) {
|
|
|
+ lg := zap.NewNop()
|
|
|
dir, be := NewTestBackend(t)
|
|
|
defer os.RemoveAll(dir)
|
|
|
defer be.Close()
|
|
|
|
|
|
testMinTTL := int64(1)
|
|
|
|
|
|
- le := newLessor(be, testMinTTL)
|
|
|
+ le := newLessor(lg, be, LessorConfig{MinLeaseTTL: testMinTTL})
|
|
|
defer le.Stop()
|
|
|
|
|
|
le.Promote(1 * time.Second)
|
|
|
@@ -452,11 +462,12 @@ func TestLessorExpireAndDemote(t *testing.T) {
|
|
|
}
|
|
|
|
|
|
func TestLessorMaxTTL(t *testing.T) {
|
|
|
+ lg := zap.NewNop()
|
|
|
dir, be := NewTestBackend(t)
|
|
|
defer os.RemoveAll(dir)
|
|
|
defer be.Close()
|
|
|
|
|
|
- le := newLessor(be, minLeaseTTL)
|
|
|
+ le := newLessor(lg, be, LessorConfig{MinLeaseTTL: minLeaseTTL})
|
|
|
defer le.Stop()
|
|
|
|
|
|
_, err := le.Grant(1, MaxLeaseTTL+1)
|