mirror of
https://source.quilibrium.com/quilibrium/ceremonyclient.git
synced 2024-11-15 04:35:17 +00:00
430 lines
11 KiB
Go
430 lines
11 KiB
Go
|
// Copyright 2019 The LevelDB-Go and Pebble Authors. All rights reserved. Use
|
||
|
// of this source code is governed by a BSD-style license that can be found in
|
||
|
// the LICENSE file.
|
||
|
|
||
|
package pebble
|
||
|
|
||
|
import (
|
||
|
"bytes"
|
||
|
"fmt"
|
||
|
"math"
|
||
|
"strings"
|
||
|
"sync/atomic"
|
||
|
"testing"
|
||
|
|
||
|
"github.com/cockroachdb/errors"
|
||
|
"github.com/cockroachdb/pebble/vfs"
|
||
|
"github.com/cockroachdb/pebble/vfs/errorfs"
|
||
|
"github.com/stretchr/testify/require"
|
||
|
)
|
||
|
|
||
|
type panicLogger struct{}
|
||
|
|
||
|
func (l panicLogger) Infof(format string, args ...interface{}) {}
|
||
|
func (l panicLogger) Errorf(format string, args ...interface{}) {}
|
||
|
|
||
|
func (l panicLogger) Fatalf(format string, args ...interface{}) {
|
||
|
panic(errors.Errorf("fatal: "+format, args...))
|
||
|
}
|
||
|
|
||
|
// corruptFS injects a corruption in the `index`th byte read.
|
||
|
type corruptFS struct {
|
||
|
vfs.FS
|
||
|
// index is the index of the byte which we will corrupt.
|
||
|
index atomic.Int32
|
||
|
bytesRead atomic.Int32
|
||
|
}
|
||
|
|
||
|
func (fs *corruptFS) maybeCorrupt(n int32, p []byte) {
|
||
|
newBytesRead := fs.bytesRead.Add(n)
|
||
|
pIdx := newBytesRead - 1 - fs.index.Load()
|
||
|
if pIdx >= 0 && pIdx < n {
|
||
|
p[pIdx]++
|
||
|
}
|
||
|
}
|
||
|
|
||
|
func (fs *corruptFS) maybeCorruptAt(n int32, p []byte, offset int64) {
|
||
|
pIdx := fs.index.Load() - int32(offset)
|
||
|
if pIdx >= 0 && pIdx < n {
|
||
|
p[pIdx]++
|
||
|
}
|
||
|
}
|
||
|
|
||
|
func (fs *corruptFS) Open(name string, opts ...vfs.OpenOption) (vfs.File, error) {
|
||
|
f, err := fs.FS.Open(name)
|
||
|
if err != nil {
|
||
|
return nil, err
|
||
|
}
|
||
|
cf := corruptFile{f, fs}
|
||
|
for _, opt := range opts {
|
||
|
opt.Apply(cf)
|
||
|
}
|
||
|
return cf, nil
|
||
|
}
|
||
|
|
||
|
type corruptFile struct {
|
||
|
vfs.File
|
||
|
fs *corruptFS
|
||
|
}
|
||
|
|
||
|
func (f corruptFile) Read(p []byte) (int, error) {
|
||
|
n, err := f.File.Read(p)
|
||
|
f.fs.maybeCorrupt(int32(n), p)
|
||
|
return n, err
|
||
|
}
|
||
|
|
||
|
func (f corruptFile) ReadAt(p []byte, off int64) (int, error) {
|
||
|
n, err := f.File.ReadAt(p, off)
|
||
|
f.fs.maybeCorruptAt(int32(n), p, off)
|
||
|
return n, err
|
||
|
}
|
||
|
|
||
|
func expectLSM(expected string, d *DB, t *testing.T) {
|
||
|
t.Helper()
|
||
|
expected = strings.TrimSpace(expected)
|
||
|
d.mu.Lock()
|
||
|
actual := d.mu.versions.currentVersion().String()
|
||
|
d.mu.Unlock()
|
||
|
actual = strings.TrimSpace(actual)
|
||
|
if expected != actual {
|
||
|
t.Fatalf("expected\n%s\nbut found\n%s", expected, actual)
|
||
|
}
|
||
|
}
|
||
|
|
||
|
// TestErrors repeatedly runs a short sequence of operations, injecting FS
|
||
|
// errors at different points, until success is achieved.
|
||
|
func TestErrors(t *testing.T) {
|
||
|
run := func(fs *errorfs.FS) (err error) {
|
||
|
defer func() {
|
||
|
if r := recover(); r != nil {
|
||
|
if e, ok := r.(error); ok {
|
||
|
err = e
|
||
|
} else {
|
||
|
t.Fatal(r)
|
||
|
}
|
||
|
}
|
||
|
}()
|
||
|
|
||
|
d, err := Open("", &Options{
|
||
|
FS: fs,
|
||
|
Logger: panicLogger{},
|
||
|
})
|
||
|
if err != nil {
|
||
|
return err
|
||
|
}
|
||
|
|
||
|
key := []byte("a")
|
||
|
value := []byte("b")
|
||
|
if err := d.Set(key, value, nil); err != nil {
|
||
|
return err
|
||
|
}
|
||
|
if err := d.Flush(); err != nil {
|
||
|
return err
|
||
|
}
|
||
|
if err := d.Compact(nil, []byte("\xff"), false); err != nil {
|
||
|
return err
|
||
|
}
|
||
|
|
||
|
iter, _ := d.NewIter(nil)
|
||
|
for valid := iter.First(); valid; valid = iter.Next() {
|
||
|
}
|
||
|
if err := iter.Close(); err != nil {
|
||
|
return err
|
||
|
}
|
||
|
return d.Close()
|
||
|
}
|
||
|
|
||
|
errorCounts := make(map[string]int)
|
||
|
for i := int32(0); ; i++ {
|
||
|
fs := errorfs.Wrap(vfs.NewMem(), errorfs.ErrInjected.If(errorfs.OnIndex(i)))
|
||
|
err := run(fs)
|
||
|
if err == nil {
|
||
|
t.Logf("success %d\n", i)
|
||
|
break
|
||
|
}
|
||
|
errorCounts[err.Error()]++
|
||
|
}
|
||
|
|
||
|
expectedErrors := []string{
|
||
|
"fatal: MANIFEST flush failed: injected error",
|
||
|
"fatal: MANIFEST sync failed: injected error",
|
||
|
"fatal: MANIFEST set current failed: injected error",
|
||
|
"fatal: MANIFEST dirsync failed: injected error",
|
||
|
}
|
||
|
for _, expected := range expectedErrors {
|
||
|
if errorCounts[expected] == 0 {
|
||
|
t.Errorf("expected error %q did not occur", expected)
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
|
||
|
// TestRequireReadError injects FS errors into read operations at successively later
|
||
|
// points until all operations can complete. It requires an operation fails any time
|
||
|
// an error was injected. This differs from the TestErrors case above as that one
|
||
|
// cannot require operations fail since it involves flush/compaction, which retry
|
||
|
// internally and succeed following an injected error.
|
||
|
func TestRequireReadError(t *testing.T) {
|
||
|
run := func(formatVersion FormatMajorVersion, index int32) (err error) {
|
||
|
// Perform setup with error injection disabled as it involves writes/background ops.
|
||
|
ii := errorfs.OnIndex(-1)
|
||
|
fs := errorfs.Wrap(vfs.NewMem(), errorfs.ErrInjected.If(ii))
|
||
|
opts := &Options{
|
||
|
FS: fs,
|
||
|
Logger: panicLogger{},
|
||
|
FormatMajorVersion: formatVersion,
|
||
|
}
|
||
|
opts.private.disableTableStats = true
|
||
|
d, err := Open("", opts)
|
||
|
require.NoError(t, err)
|
||
|
|
||
|
defer func() {
|
||
|
if d != nil {
|
||
|
require.NoError(t, d.Close())
|
||
|
}
|
||
|
}()
|
||
|
|
||
|
key1 := []byte("a1")
|
||
|
key2 := []byte("a2")
|
||
|
value := []byte("b")
|
||
|
require.NoError(t, d.Set(key1, value, nil))
|
||
|
require.NoError(t, d.Set(key2, value, nil))
|
||
|
require.NoError(t, d.Flush())
|
||
|
require.NoError(t, d.Compact(key1, key2, false))
|
||
|
require.NoError(t, d.DeleteRange(key1, key2, nil))
|
||
|
require.NoError(t, d.Set(key1, value, nil))
|
||
|
require.NoError(t, d.Flush())
|
||
|
if formatVersion < FormatSetWithDelete {
|
||
|
expectLSM(`
|
||
|
0.0:
|
||
|
000007:[a1#13,SET-a2#inf,RANGEDEL]
|
||
|
6:
|
||
|
000005:[a1#10,SET-a2#11,SET]
|
||
|
`, d, t)
|
||
|
} else {
|
||
|
expectLSM(`
|
||
|
0.0:
|
||
|
000007:[a1#13,SETWITHDEL-a2#inf,RANGEDEL]
|
||
|
6:
|
||
|
000005:[a1#10,SET-a2#11,SET]
|
||
|
`, d, t)
|
||
|
}
|
||
|
|
||
|
// Now perform foreground ops with error injection enabled.
|
||
|
ii.Store(index)
|
||
|
iter, _ := d.NewIter(nil)
|
||
|
if err := iter.Error(); err != nil {
|
||
|
return err
|
||
|
}
|
||
|
numFound := 0
|
||
|
expectedKeys := [][]byte{key1, key2}
|
||
|
for valid := iter.First(); valid; valid = iter.Next() {
|
||
|
if !bytes.Equal(iter.Key(), expectedKeys[numFound]) {
|
||
|
t.Fatalf("expected key %v; found %v", expectedKeys[numFound], iter.Key())
|
||
|
}
|
||
|
if !bytes.Equal(iter.Value(), value) {
|
||
|
t.Fatalf("expected value %v; found %v", value, iter.Value())
|
||
|
}
|
||
|
numFound++
|
||
|
}
|
||
|
if err := iter.Close(); err != nil {
|
||
|
return err
|
||
|
}
|
||
|
if err := d.Close(); err != nil {
|
||
|
d = nil
|
||
|
return err
|
||
|
}
|
||
|
d = nil
|
||
|
// Reaching here implies all read operations succeeded. This
|
||
|
// should only happen when we reached a large enough index at
|
||
|
// which `errorfs.FS` did not return any error.
|
||
|
if i := ii.Load(); i < 0 {
|
||
|
t.Errorf("FS error injected %d ops ago went unreported", -i)
|
||
|
}
|
||
|
if numFound != 2 {
|
||
|
t.Fatalf("expected 2 values; found %d", numFound)
|
||
|
}
|
||
|
return nil
|
||
|
}
|
||
|
|
||
|
versions := []FormatMajorVersion{FormatMostCompatible, FormatSetWithDelete}
|
||
|
for _, version := range versions {
|
||
|
t.Run(fmt.Sprintf("version-%s", version), func(t *testing.T) {
|
||
|
for i := int32(0); ; i++ {
|
||
|
err := run(version, i)
|
||
|
if err == nil {
|
||
|
t.Logf("no failures reported at index %d", i)
|
||
|
break
|
||
|
}
|
||
|
}
|
||
|
})
|
||
|
}
|
||
|
}
|
||
|
|
||
|
// TestCorruptReadError verifies that reads to a corrupted file detect the
|
||
|
// corruption and return an error. In this case the filesystem reads return
|
||
|
// successful status but the data they return is corrupt.
|
||
|
func TestCorruptReadError(t *testing.T) {
|
||
|
run := func(formatVersion FormatMajorVersion, index int32) (err error) {
|
||
|
// Perform setup with corruption injection disabled as it involves writes/background ops.
|
||
|
fs := &corruptFS{
|
||
|
FS: vfs.NewMem(),
|
||
|
}
|
||
|
fs.index.Store(-1)
|
||
|
opts := &Options{
|
||
|
FS: fs,
|
||
|
Logger: panicLogger{},
|
||
|
FormatMajorVersion: formatVersion,
|
||
|
}
|
||
|
opts.private.disableTableStats = true
|
||
|
d, err := Open("", opts)
|
||
|
if err != nil {
|
||
|
t.Fatalf("%v", err)
|
||
|
}
|
||
|
defer func() {
|
||
|
if d != nil {
|
||
|
require.NoError(t, d.Close())
|
||
|
}
|
||
|
}()
|
||
|
|
||
|
key1 := []byte("a1")
|
||
|
key2 := []byte("a2")
|
||
|
value := []byte("b")
|
||
|
require.NoError(t, d.Set(key1, value, nil))
|
||
|
require.NoError(t, d.Set(key2, value, nil))
|
||
|
require.NoError(t, d.Flush())
|
||
|
require.NoError(t, d.Compact(key1, key2, false))
|
||
|
require.NoError(t, d.DeleteRange(key1, key2, nil))
|
||
|
require.NoError(t, d.Set(key1, value, nil))
|
||
|
require.NoError(t, d.Flush())
|
||
|
if formatVersion < FormatSetWithDelete {
|
||
|
expectLSM(`
|
||
|
0.0:
|
||
|
000007:[a1#13,SET-a2#inf,RANGEDEL]
|
||
|
6:
|
||
|
000005:[a1#10,SET-a2#11,SET]
|
||
|
`, d, t)
|
||
|
|
||
|
} else {
|
||
|
expectLSM(`
|
||
|
0.0:
|
||
|
000007:[a1#13,SETWITHDEL-a2#inf,RANGEDEL]
|
||
|
6:
|
||
|
000005:[a1#10,SET-a2#11,SET]
|
||
|
`, d, t)
|
||
|
}
|
||
|
|
||
|
// Now perform foreground ops with corruption injection enabled.
|
||
|
fs.index.Store(index)
|
||
|
iter, _ := d.NewIter(nil)
|
||
|
if err := iter.Error(); err != nil {
|
||
|
return err
|
||
|
}
|
||
|
|
||
|
numFound := 0
|
||
|
expectedKeys := [][]byte{key1, key2}
|
||
|
for valid := iter.First(); valid; valid = iter.Next() {
|
||
|
if !bytes.Equal(iter.Key(), expectedKeys[numFound]) {
|
||
|
t.Fatalf("expected key %v; found %v", expectedKeys[numFound], iter.Key())
|
||
|
}
|
||
|
if !bytes.Equal(iter.Value(), value) {
|
||
|
t.Fatalf("expected value %v; found %v", value, iter.Value())
|
||
|
}
|
||
|
numFound++
|
||
|
}
|
||
|
if err := iter.Close(); err != nil {
|
||
|
return err
|
||
|
}
|
||
|
if err := d.Close(); err != nil {
|
||
|
return err
|
||
|
}
|
||
|
d = nil
|
||
|
// Reaching here implies all read operations succeeded. This
|
||
|
// should only happen when we reached a large enough index at
|
||
|
// which `corruptFS` did not inject any corruption.
|
||
|
if bytesRead := fs.bytesRead.Load(); bytesRead > index {
|
||
|
t.Errorf("corruption error injected at index %d went unreported", index)
|
||
|
}
|
||
|
if numFound != 2 {
|
||
|
t.Fatalf("expected 2 values; found %d", numFound)
|
||
|
}
|
||
|
return nil
|
||
|
}
|
||
|
versions := []FormatMajorVersion{FormatMostCompatible, FormatSetWithDelete}
|
||
|
for _, version := range versions {
|
||
|
t.Run(fmt.Sprintf("version-%s", version), func(t *testing.T) {
|
||
|
for i := int32(0); ; i++ {
|
||
|
err := run(version, i)
|
||
|
if err == nil {
|
||
|
t.Logf("no failures reported at index %d", i)
|
||
|
break
|
||
|
}
|
||
|
}
|
||
|
})
|
||
|
}
|
||
|
}
|
||
|
|
||
|
func TestDBWALRotationCrash(t *testing.T) {
|
||
|
memfs := vfs.NewStrictMem()
|
||
|
|
||
|
var index atomic.Int32
|
||
|
inj := errorfs.InjectorFunc(func(op errorfs.Op) error {
|
||
|
if op.Kind.ReadOrWrite() == errorfs.OpIsWrite && index.Add(-1) == -1 {
|
||
|
memfs.SetIgnoreSyncs(true)
|
||
|
}
|
||
|
return nil
|
||
|
})
|
||
|
triggered := func() bool { return index.Load() < 0 }
|
||
|
|
||
|
run := func(fs *errorfs.FS, k int32) (err error) {
|
||
|
opts := &Options{
|
||
|
FS: fs,
|
||
|
Logger: panicLogger{},
|
||
|
MemTableSize: 2048,
|
||
|
}
|
||
|
opts.private.disableTableStats = true
|
||
|
d, err := Open("", opts)
|
||
|
if err != nil || triggered() {
|
||
|
return err
|
||
|
}
|
||
|
|
||
|
// Write keys with the FS set up to simulate a crash by ignoring
|
||
|
// syncs on the k-th write operation.
|
||
|
index.Store(k)
|
||
|
key := []byte("test")
|
||
|
for i := 0; i < 10; i++ {
|
||
|
v := []byte(strings.Repeat("b", i))
|
||
|
err = d.Set(key, v, nil)
|
||
|
if err != nil || triggered() {
|
||
|
break
|
||
|
}
|
||
|
}
|
||
|
err = firstError(err, d.Close())
|
||
|
return err
|
||
|
}
|
||
|
|
||
|
fs := errorfs.Wrap(memfs, inj)
|
||
|
for k := int32(0); ; k++ {
|
||
|
// Run, simulating a crash by ignoring syncs after the k-th write
|
||
|
// operation after Open.
|
||
|
index.Store(math.MaxInt32)
|
||
|
err := run(fs, k)
|
||
|
if !triggered() {
|
||
|
// Stop when we reach a value of k greater than the number of
|
||
|
// write operations performed during `run`.
|
||
|
t.Logf("No crash at write operation %d\n", k)
|
||
|
if err != nil {
|
||
|
t.Fatalf("Filesystem did not 'crash', but error returned: %s", err)
|
||
|
}
|
||
|
break
|
||
|
}
|
||
|
t.Logf("Crashed at write operation % 2d, error: %v\n", k, err)
|
||
|
|
||
|
// Reset the filesystem to its state right before the simulated
|
||
|
// "crash", restore syncs, and run again without crashing.
|
||
|
memfs.ResetToSyncedState()
|
||
|
memfs.SetIgnoreSyncs(false)
|
||
|
index.Store(math.MaxInt32)
|
||
|
require.NoError(t, run(fs, k))
|
||
|
}
|
||
|
}
|