2019-10-07 16:45:01 +00:00
|
|
|
package storage
|
|
|
|
|
|
|
|
import (
|
2021-12-28 14:07:52 +00:00
|
|
|
"bytes"
|
2019-10-07 16:45:01 +00:00
|
|
|
"reflect"
|
|
|
|
"runtime"
|
2021-12-28 14:07:52 +00:00
|
|
|
"sort"
|
2019-10-07 16:45:01 +00:00
|
|
|
"testing"
|
|
|
|
|
2021-07-18 13:32:10 +00:00
|
|
|
"github.com/nspcc-dev/neo-go/pkg/util/slice"
|
2019-10-07 16:45:01 +00:00
|
|
|
"github.com/stretchr/testify/assert"
|
|
|
|
"github.com/stretchr/testify/require"
|
|
|
|
)
|
|
|
|
|
|
|
|
type dbSetup struct {
|
|
|
|
name string
|
2021-10-05 12:13:19 +00:00
|
|
|
create func(testing.TB) Store
|
2019-10-07 16:45:01 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
type dbTestFunction func(*testing.T, Store)
|
|
|
|
|
|
|
|
func testStorePutAndGet(t *testing.T, s Store) {
|
|
|
|
key := []byte("foo")
|
|
|
|
value := []byte("bar")
|
|
|
|
|
|
|
|
require.NoError(t, s.Put(key, value))
|
|
|
|
|
|
|
|
result, err := s.Get(key)
|
|
|
|
assert.Nil(t, err)
|
|
|
|
require.Equal(t, value, result)
|
|
|
|
}
|
|
|
|
|
|
|
|
func testStoreGetNonExistent(t *testing.T, s Store) {
|
|
|
|
key := []byte("sparse")
|
|
|
|
|
|
|
|
_, err := s.Get(key)
|
|
|
|
assert.Equal(t, err, ErrKeyNotFound)
|
|
|
|
}
|
|
|
|
|
|
|
|
func testStoreSeek(t *testing.T, s Store) {
|
2021-12-16 13:55:50 +00:00
|
|
|
// Use the same set of kvs to test Seek with different prefix/start values.
|
|
|
|
kvs := []KeyValue{
|
|
|
|
{[]byte("10"), []byte("bar")},
|
|
|
|
{[]byte("11"), []byte("bara")},
|
|
|
|
{[]byte("20"), []byte("barb")},
|
|
|
|
{[]byte("21"), []byte("barc")},
|
|
|
|
{[]byte("22"), []byte("bard")},
|
|
|
|
{[]byte("30"), []byte("bare")},
|
|
|
|
{[]byte("31"), []byte("barf")},
|
2019-10-07 16:45:01 +00:00
|
|
|
}
|
2021-12-16 13:55:50 +00:00
|
|
|
for _, v := range kvs {
|
2021-12-28 14:07:52 +00:00
|
|
|
require.NoError(t, s.Put(v.Key, v.Value))
|
2019-10-07 16:45:01 +00:00
|
|
|
}
|
|
|
|
|
2022-01-17 17:41:51 +00:00
|
|
|
check := func(t *testing.T, goodprefix, start []byte, goodkvs []KeyValue, backwards bool, cont func(k, v []byte) bool) {
|
2021-12-28 13:01:44 +00:00
|
|
|
// Seek result expected to be sorted in an ascending (for forwards seeking) or descending (for backwards seeking) way.
|
|
|
|
cmpFunc := func(i, j int) bool {
|
2021-12-16 13:55:50 +00:00
|
|
|
return bytes.Compare(goodkvs[i].Key, goodkvs[j].Key) < 0
|
2021-12-28 13:01:44 +00:00
|
|
|
}
|
|
|
|
if backwards {
|
|
|
|
cmpFunc = func(i, j int) bool {
|
|
|
|
return bytes.Compare(goodkvs[i].Key, goodkvs[j].Key) > 0
|
|
|
|
}
|
|
|
|
}
|
|
|
|
sort.Slice(goodkvs, cmpFunc)
|
2021-12-16 13:55:50 +00:00
|
|
|
|
2021-12-28 13:01:44 +00:00
|
|
|
rng := SeekRange{
|
2021-12-16 13:55:50 +00:00
|
|
|
Prefix: goodprefix,
|
|
|
|
Start: start,
|
2021-12-28 13:01:44 +00:00
|
|
|
}
|
|
|
|
if backwards {
|
|
|
|
rng.Backwards = true
|
|
|
|
}
|
|
|
|
actual := make([]KeyValue, 0, len(goodkvs))
|
2022-01-17 17:41:51 +00:00
|
|
|
s.Seek(rng, func(k, v []byte) bool {
|
2021-12-16 13:55:50 +00:00
|
|
|
actual = append(actual, KeyValue{
|
|
|
|
Key: slice.Copy(k),
|
|
|
|
Value: slice.Copy(v),
|
|
|
|
})
|
2022-01-17 17:41:51 +00:00
|
|
|
if cont == nil {
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
return cont(k, v)
|
2021-12-16 13:55:50 +00:00
|
|
|
})
|
|
|
|
assert.Equal(t, goodkvs, actual)
|
|
|
|
}
|
|
|
|
|
|
|
|
t.Run("non-empty prefix, empty start", func(t *testing.T) {
|
2021-12-28 13:01:44 +00:00
|
|
|
t.Run("forwards", func(t *testing.T) {
|
|
|
|
t.Run("good", func(t *testing.T) {
|
|
|
|
// Given this prefix...
|
|
|
|
goodprefix := []byte("2")
|
|
|
|
// and empty start range...
|
|
|
|
start := []byte{}
|
|
|
|
// these pairs should be found.
|
|
|
|
goodkvs := []KeyValue{
|
|
|
|
kvs[2], // key = "20"
|
|
|
|
kvs[3], // key = "21"
|
|
|
|
kvs[4], // key = "22"
|
|
|
|
}
|
2022-01-17 17:41:51 +00:00
|
|
|
check(t, goodprefix, start, goodkvs, false, nil)
|
2021-12-28 13:01:44 +00:00
|
|
|
})
|
|
|
|
t.Run("no matching items", func(t *testing.T) {
|
|
|
|
goodprefix := []byte("0")
|
|
|
|
start := []byte{}
|
2022-01-17 17:41:51 +00:00
|
|
|
check(t, goodprefix, start, []KeyValue{}, false, nil)
|
|
|
|
})
|
|
|
|
t.Run("early stop", func(t *testing.T) {
|
|
|
|
// Given this prefix...
|
|
|
|
goodprefix := []byte("2")
|
|
|
|
// and empty start range...
|
|
|
|
start := []byte{}
|
|
|
|
// these pairs should be found.
|
|
|
|
goodkvs := []KeyValue{
|
|
|
|
kvs[2], // key = "20"
|
|
|
|
kvs[3], // key = "21"
|
|
|
|
}
|
|
|
|
check(t, goodprefix, start, goodkvs, false, func(k, v []byte) bool {
|
|
|
|
return string(k) < "21"
|
|
|
|
})
|
2021-12-28 13:01:44 +00:00
|
|
|
})
|
2021-12-16 13:55:50 +00:00
|
|
|
})
|
2021-12-28 13:01:44 +00:00
|
|
|
|
|
|
|
t.Run("backwards", func(t *testing.T) {
|
|
|
|
t.Run("good", func(t *testing.T) {
|
|
|
|
goodprefix := []byte("2")
|
|
|
|
start := []byte{}
|
|
|
|
goodkvs := []KeyValue{
|
|
|
|
kvs[4], // key = "22"
|
|
|
|
kvs[3], // key = "21"
|
|
|
|
kvs[2], // key = "20"
|
|
|
|
}
|
2022-01-17 17:41:51 +00:00
|
|
|
check(t, goodprefix, start, goodkvs, true, nil)
|
2021-12-28 13:01:44 +00:00
|
|
|
})
|
|
|
|
t.Run("no matching items", func(t *testing.T) {
|
|
|
|
goodprefix := []byte("0")
|
|
|
|
start := []byte{}
|
2022-01-17 17:41:51 +00:00
|
|
|
check(t, goodprefix, start, []KeyValue{}, true, nil)
|
|
|
|
})
|
|
|
|
t.Run("early stop", func(t *testing.T) {
|
|
|
|
goodprefix := []byte("2")
|
|
|
|
start := []byte{}
|
|
|
|
goodkvs := []KeyValue{
|
|
|
|
kvs[4], // key = "22"
|
|
|
|
kvs[3], // key = "21"
|
|
|
|
}
|
|
|
|
check(t, goodprefix, start, goodkvs, true, func(k, v []byte) bool {
|
|
|
|
return string(k) > "21"
|
|
|
|
})
|
2021-12-28 13:01:44 +00:00
|
|
|
})
|
2021-12-16 13:55:50 +00:00
|
|
|
})
|
|
|
|
})
|
|
|
|
|
|
|
|
t.Run("non-empty prefix, non-empty start", func(t *testing.T) {
|
2021-12-28 13:01:44 +00:00
|
|
|
t.Run("forwards", func(t *testing.T) {
|
|
|
|
t.Run("good", func(t *testing.T) {
|
|
|
|
goodprefix := []byte("2")
|
2022-01-17 17:41:51 +00:00
|
|
|
start := []byte("1") // start will be appended to goodprefix to start seek from
|
2021-12-28 13:01:44 +00:00
|
|
|
goodkvs := []KeyValue{
|
|
|
|
kvs[3], // key = "21"
|
|
|
|
kvs[4], // key = "22"
|
|
|
|
}
|
2022-01-17 17:41:51 +00:00
|
|
|
check(t, goodprefix, start, goodkvs, false, nil)
|
2021-12-28 13:01:44 +00:00
|
|
|
})
|
|
|
|
t.Run("no matching items", func(t *testing.T) {
|
|
|
|
goodprefix := []byte("2")
|
|
|
|
start := []byte("3") // start is more than all keys prefixed by '2'.
|
2022-01-17 17:41:51 +00:00
|
|
|
check(t, goodprefix, start, []KeyValue{}, false, nil)
|
|
|
|
})
|
|
|
|
t.Run("early stop", func(t *testing.T) {
|
|
|
|
goodprefix := []byte("2")
|
|
|
|
start := []byte("0") // start will be appended to goodprefix to start seek from
|
|
|
|
goodkvs := []KeyValue{
|
|
|
|
kvs[2], // key = "20"
|
|
|
|
kvs[3], // key = "21"
|
|
|
|
}
|
|
|
|
check(t, goodprefix, start, goodkvs, false, func(k, v []byte) bool {
|
|
|
|
return string(k) < "21"
|
|
|
|
})
|
2021-12-28 13:01:44 +00:00
|
|
|
})
|
2021-12-16 13:55:50 +00:00
|
|
|
})
|
2021-12-28 13:01:44 +00:00
|
|
|
t.Run("backwards", func(t *testing.T) {
|
|
|
|
t.Run("good", func(t *testing.T) {
|
|
|
|
goodprefix := []byte("2")
|
2022-01-17 17:41:51 +00:00
|
|
|
start := []byte("1") // start will be appended to goodprefix to start seek from
|
2021-12-28 13:01:44 +00:00
|
|
|
goodkvs := []KeyValue{
|
|
|
|
kvs[3], // key = "21"
|
|
|
|
kvs[2], // key = "20"
|
|
|
|
}
|
2022-01-17 17:41:51 +00:00
|
|
|
check(t, goodprefix, start, goodkvs, true, nil)
|
2021-12-28 13:01:44 +00:00
|
|
|
})
|
|
|
|
t.Run("no matching items", func(t *testing.T) {
|
|
|
|
goodprefix := []byte("2")
|
|
|
|
start := []byte(".") // start is less than all keys prefixed by '2'.
|
2022-01-17 17:41:51 +00:00
|
|
|
check(t, goodprefix, start, []KeyValue{}, true, nil)
|
|
|
|
})
|
|
|
|
t.Run("early stop", func(t *testing.T) {
|
|
|
|
goodprefix := []byte("2")
|
|
|
|
start := []byte("2") // start will be appended to goodprefix to start seek from
|
|
|
|
goodkvs := []KeyValue{
|
|
|
|
kvs[4], // key = "24"
|
|
|
|
kvs[3], // key = "21"
|
|
|
|
}
|
|
|
|
check(t, goodprefix, start, goodkvs, true, func(k, v []byte) bool {
|
|
|
|
return string(k) > "21"
|
|
|
|
})
|
2021-12-28 13:01:44 +00:00
|
|
|
})
|
2021-12-16 13:55:50 +00:00
|
|
|
})
|
2021-12-28 14:07:52 +00:00
|
|
|
})
|
2019-10-07 16:45:01 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
func testStoreDeleteNonExistent(t *testing.T, s Store) {
|
|
|
|
key := []byte("sparse")
|
|
|
|
|
|
|
|
assert.NoError(t, s.Delete(key))
|
|
|
|
}
|
|
|
|
|
|
|
|
func testStorePutAndDelete(t *testing.T, s Store) {
|
|
|
|
key := []byte("foo")
|
|
|
|
value := []byte("bar")
|
|
|
|
|
|
|
|
require.NoError(t, s.Put(key, value))
|
|
|
|
|
|
|
|
err := s.Delete(key)
|
|
|
|
assert.Nil(t, err)
|
|
|
|
|
|
|
|
_, err = s.Get(key)
|
|
|
|
assert.NotNil(t, err)
|
|
|
|
assert.Equal(t, err, ErrKeyNotFound)
|
|
|
|
|
|
|
|
// Double delete.
|
|
|
|
err = s.Delete(key)
|
|
|
|
assert.Nil(t, err)
|
|
|
|
}
|
|
|
|
|
2022-02-11 17:35:45 +00:00
|
|
|
func testStoreSeekGC(t *testing.T, s Store) {
|
|
|
|
kvs := []KeyValue{
|
|
|
|
{[]byte("10"), []byte("bar")},
|
|
|
|
{[]byte("11"), []byte("bara")},
|
|
|
|
{[]byte("20"), []byte("barb")},
|
|
|
|
{[]byte("21"), []byte("barc")},
|
|
|
|
{[]byte("22"), []byte("bard")},
|
|
|
|
{[]byte("30"), []byte("bare")},
|
|
|
|
{[]byte("31"), []byte("barf")},
|
|
|
|
}
|
|
|
|
for _, v := range kvs {
|
|
|
|
require.NoError(t, s.Put(v.Key, v.Value))
|
|
|
|
}
|
|
|
|
err := s.SeekGC(SeekRange{Prefix: []byte("1")}, func(k, v []byte) bool {
|
|
|
|
return true
|
|
|
|
})
|
|
|
|
require.NoError(t, err)
|
|
|
|
for i := range kvs {
|
|
|
|
_, err = s.Get(kvs[i].Key)
|
|
|
|
require.NoError(t, err)
|
|
|
|
}
|
|
|
|
err = s.SeekGC(SeekRange{Prefix: []byte("3")}, func(k, v []byte) bool {
|
|
|
|
return false
|
|
|
|
})
|
|
|
|
require.NoError(t, err)
|
|
|
|
for i := range kvs[:5] {
|
|
|
|
_, err = s.Get(kvs[i].Key)
|
|
|
|
require.NoError(t, err)
|
|
|
|
}
|
|
|
|
for _, kv := range kvs[5:] {
|
|
|
|
_, err = s.Get(kv.Key)
|
|
|
|
require.Error(t, err)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-10-07 16:45:01 +00:00
|
|
|
func TestAllDBs(t *testing.T) {
|
|
|
|
var DBs = []dbSetup{
|
|
|
|
{"BoltDB", newBoltStoreForTesting},
|
|
|
|
{"LevelDB", newLevelDBForTesting},
|
2019-10-16 13:41:50 +00:00
|
|
|
{"MemCached", newMemCachedStoreForTesting},
|
2019-10-07 16:45:01 +00:00
|
|
|
{"Memory", newMemoryStoreForTesting},
|
|
|
|
}
|
2022-02-14 12:42:57 +00:00
|
|
|
var tests = []dbTestFunction{testStorePutAndGet,
|
2022-02-16 12:37:27 +00:00
|
|
|
testStoreGetNonExistent, testStoreSeek,
|
2019-10-07 16:45:01 +00:00
|
|
|
testStoreDeleteNonExistent, testStorePutAndDelete,
|
2022-02-16 12:37:27 +00:00
|
|
|
testStoreSeekGC}
|
2019-10-07 16:45:01 +00:00
|
|
|
for _, db := range DBs {
|
|
|
|
for _, test := range tests {
|
|
|
|
s := db.create(t)
|
|
|
|
twrapper := func(t *testing.T) {
|
|
|
|
test(t, s)
|
|
|
|
}
|
|
|
|
fname := runtime.FuncForPC(reflect.ValueOf(test).Pointer()).Name()
|
|
|
|
t.Run(db.name+"/"+fname, twrapper)
|
2022-02-14 12:42:57 +00:00
|
|
|
require.NoError(t, s.Close())
|
2019-10-07 16:45:01 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|