2016-05-13 06:50:33 +03:00
|
|
|
// Copyright 2015 The etcd Authors
|
2015-12-21 16:37:40 +03:00
|
|
|
//
|
|
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
|
|
// you may not use this file except in compliance with the License.
|
|
|
|
// You may obtain a copy of the License at
|
|
|
|
//
|
|
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
|
|
//
|
|
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
|
|
// See the License for the specific language governing permissions and
|
|
|
|
// limitations under the License.
|
2016-03-20 00:04:45 +03:00
|
|
|
|
2016-04-25 22:32:58 +03:00
|
|
|
package mvcc
|
2015-12-21 16:37:40 +03:00
|
|
|
|
|
|
|
import (
|
2016-05-18 19:42:37 +03:00
|
|
|
"sync/atomic"
|
2015-12-21 16:37:40 +03:00
|
|
|
"testing"
|
2016-01-06 06:45:18 +03:00
|
|
|
|
2018-02-26 21:41:45 +03:00
|
|
|
"github.com/coreos/etcd/lease"
|
2018-02-26 22:12:45 +03:00
|
|
|
"github.com/coreos/etcd/mvcc/backend"
|
2018-04-16 13:58:15 +03:00
|
|
|
|
|
|
|
"go.uber.org/zap"
|
2015-12-21 16:37:40 +03:00
|
|
|
)
|
|
|
|
|
2016-05-18 19:42:37 +03:00
|
|
|
type fakeConsistentIndex uint64
|
|
|
|
|
|
|
|
func (i *fakeConsistentIndex) ConsistentIndex() uint64 {
|
|
|
|
return atomic.LoadUint64((*uint64)(i))
|
|
|
|
}
|
|
|
|
|
2015-12-21 16:37:40 +03:00
|
|
|
func BenchmarkStorePut(b *testing.B) {
|
2016-05-18 19:42:37 +03:00
|
|
|
var i fakeConsistentIndex
|
2016-01-06 06:45:18 +03:00
|
|
|
be, tmpPath := backend.NewDefaultTmpBackend()
|
2018-04-16 13:58:15 +03:00
|
|
|
s := NewStore(zap.NewExample(), be, &lease.FakeLessor{}, &i)
|
2016-01-06 06:45:18 +03:00
|
|
|
defer cleanup(s, be, tmpPath)
|
2015-12-21 16:37:40 +03:00
|
|
|
|
|
|
|
// arbitrary number of bytes
|
|
|
|
bytesN := 64
|
|
|
|
keys := createBytesSlice(bytesN, b.N)
|
|
|
|
vals := createBytesSlice(bytesN, b.N)
|
|
|
|
|
|
|
|
b.ResetTimer()
|
|
|
|
for i := 0; i < b.N; i++ {
|
2016-01-07 13:09:50 +03:00
|
|
|
s.Put(keys[i], vals[i], lease.NoLease)
|
2015-12-21 16:37:40 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-08-31 23:20:37 +03:00
|
|
|
func BenchmarkStoreRangeKey1(b *testing.B) { benchmarkStoreRange(b, 1) }
|
|
|
|
func BenchmarkStoreRangeKey100(b *testing.B) { benchmarkStoreRange(b, 100) }
|
|
|
|
|
|
|
|
func benchmarkStoreRange(b *testing.B, n int) {
|
2017-08-21 08:06:03 +03:00
|
|
|
var i fakeConsistentIndex
|
|
|
|
be, tmpPath := backend.NewDefaultTmpBackend()
|
2018-04-16 13:58:15 +03:00
|
|
|
s := NewStore(zap.NewExample(), be, &lease.FakeLessor{}, &i)
|
2017-08-21 08:06:03 +03:00
|
|
|
defer cleanup(s, be, tmpPath)
|
|
|
|
|
|
|
|
// 64 byte key/val
|
2017-08-31 23:20:37 +03:00
|
|
|
keys, val := createBytesSlice(64, n), createBytesSlice(64, 1)
|
|
|
|
for i := range keys {
|
|
|
|
s.Put(keys[i], val[0], lease.NoLease)
|
|
|
|
}
|
2017-08-21 08:06:03 +03:00
|
|
|
// Force into boltdb tx instead of backend read tx.
|
|
|
|
s.Commit()
|
|
|
|
|
2017-08-31 23:20:37 +03:00
|
|
|
var begin, end []byte
|
|
|
|
if n == 1 {
|
|
|
|
begin, end = keys[0], nil
|
|
|
|
} else {
|
|
|
|
begin, end = []byte{}, []byte{}
|
|
|
|
}
|
|
|
|
|
2017-08-21 08:06:03 +03:00
|
|
|
b.ReportAllocs()
|
|
|
|
b.ResetTimer()
|
|
|
|
for i := 0; i < b.N; i++ {
|
2017-08-31 23:20:37 +03:00
|
|
|
s.Range(begin, end, RangeOptions{})
|
2017-08-21 08:06:03 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-05-03 03:20:51 +03:00
|
|
|
func BenchmarkConsistentIndex(b *testing.B) {
|
|
|
|
fci := fakeConsistentIndex(10)
|
|
|
|
be, tmpPath := backend.NewDefaultTmpBackend()
|
2018-04-16 13:58:15 +03:00
|
|
|
s := NewStore(zap.NewExample(), be, &lease.FakeLessor{}, &fci)
|
2017-05-03 03:20:51 +03:00
|
|
|
defer cleanup(s, be, tmpPath)
|
|
|
|
|
|
|
|
tx := s.b.BatchTx()
|
|
|
|
tx.Lock()
|
|
|
|
s.saveIndex(tx)
|
|
|
|
tx.Unlock()
|
|
|
|
|
|
|
|
b.ReportAllocs()
|
|
|
|
b.ResetTimer()
|
|
|
|
for i := 0; i < b.N; i++ {
|
|
|
|
s.ConsistentIndex()
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-10-12 07:37:09 +03:00
|
|
|
// BenchmarkStoreTxnPutUpdate is same as above, but instead updates single key
|
|
|
|
func BenchmarkStorePutUpdate(b *testing.B) {
|
|
|
|
var i fakeConsistentIndex
|
|
|
|
be, tmpPath := backend.NewDefaultTmpBackend()
|
2018-04-16 13:58:15 +03:00
|
|
|
s := NewStore(zap.NewExample(), be, &lease.FakeLessor{}, &i)
|
2016-10-12 07:37:09 +03:00
|
|
|
defer cleanup(s, be, tmpPath)
|
|
|
|
|
|
|
|
// arbitrary number of bytes
|
|
|
|
keys := createBytesSlice(64, 1)
|
|
|
|
vals := createBytesSlice(1024, 1)
|
|
|
|
|
|
|
|
b.ResetTimer()
|
|
|
|
for i := 0; i < b.N; i++ {
|
|
|
|
s.Put(keys[0], vals[0], lease.NoLease)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-12-21 16:37:40 +03:00
|
|
|
// BenchmarkStoreTxnPut benchmarks the Put operation
|
|
|
|
// with transaction begin and end, where transaction involves
|
|
|
|
// some synchronization operations, such as mutex locking.
|
|
|
|
func BenchmarkStoreTxnPut(b *testing.B) {
|
2016-05-18 19:42:37 +03:00
|
|
|
var i fakeConsistentIndex
|
2016-01-06 06:45:18 +03:00
|
|
|
be, tmpPath := backend.NewDefaultTmpBackend()
|
2018-04-16 13:58:15 +03:00
|
|
|
s := NewStore(zap.NewExample(), be, &lease.FakeLessor{}, &i)
|
2016-01-06 06:45:18 +03:00
|
|
|
defer cleanup(s, be, tmpPath)
|
2015-12-21 16:37:40 +03:00
|
|
|
|
|
|
|
// arbitrary number of bytes
|
|
|
|
bytesN := 64
|
|
|
|
keys := createBytesSlice(bytesN, b.N)
|
|
|
|
vals := createBytesSlice(bytesN, b.N)
|
|
|
|
|
|
|
|
b.ResetTimer()
|
2017-06-06 19:49:35 +03:00
|
|
|
b.ReportAllocs()
|
2015-12-21 16:37:40 +03:00
|
|
|
for i := 0; i < b.N; i++ {
|
2017-01-05 04:01:31 +03:00
|
|
|
txn := s.Write()
|
|
|
|
txn.Put(keys[i], vals[i], lease.NoLease)
|
|
|
|
txn.End()
|
2015-12-21 16:37:40 +03:00
|
|
|
}
|
|
|
|
}
|
2016-11-16 17:48:29 +03:00
|
|
|
|
|
|
|
// benchmarkStoreRestore benchmarks the restore operation
|
|
|
|
func benchmarkStoreRestore(revsPerKey int, b *testing.B) {
|
|
|
|
var i fakeConsistentIndex
|
|
|
|
be, tmpPath := backend.NewDefaultTmpBackend()
|
2018-04-16 13:58:15 +03:00
|
|
|
s := NewStore(zap.NewExample(), be, &lease.FakeLessor{}, &i)
|
2017-05-09 07:45:43 +03:00
|
|
|
// use closure to capture 's' to pick up the reassignment
|
|
|
|
defer func() { cleanup(s, be, tmpPath) }()
|
2016-11-16 17:48:29 +03:00
|
|
|
|
|
|
|
// arbitrary number of bytes
|
|
|
|
bytesN := 64
|
|
|
|
keys := createBytesSlice(bytesN, b.N)
|
|
|
|
vals := createBytesSlice(bytesN, b.N)
|
|
|
|
|
|
|
|
for i := 0; i < b.N; i++ {
|
|
|
|
for j := 0; j < revsPerKey; j++ {
|
2017-01-05 04:01:31 +03:00
|
|
|
txn := s.Write()
|
|
|
|
txn.Put(keys[i], vals[i], lease.NoLease)
|
|
|
|
txn.End()
|
2016-11-16 17:48:29 +03:00
|
|
|
}
|
|
|
|
}
|
2017-05-09 07:45:43 +03:00
|
|
|
s.Close()
|
|
|
|
|
|
|
|
b.ReportAllocs()
|
2016-11-16 17:48:29 +03:00
|
|
|
b.ResetTimer()
|
2018-04-16 13:58:15 +03:00
|
|
|
s = NewStore(zap.NewExample(), be, &lease.FakeLessor{}, &i)
|
2016-11-16 17:48:29 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
func BenchmarkStoreRestoreRevs1(b *testing.B) {
|
|
|
|
benchmarkStoreRestore(1, b)
|
|
|
|
}
|
|
|
|
|
|
|
|
func BenchmarkStoreRestoreRevs10(b *testing.B) {
|
|
|
|
benchmarkStoreRestore(10, b)
|
|
|
|
}
|
|
|
|
|
|
|
|
func BenchmarkStoreRestoreRevs20(b *testing.B) {
|
|
|
|
benchmarkStoreRestore(20, b)
|
|
|
|
}
|