mirror of https://github.com/ethereum/go-ethereum
core/rawdb: freezer batch write (#23462)
This change is a rewrite of the freezer code. When writing ancient chain data to the freezer, the previous version first encoded each individual item to a temporary buffer, then wrote the buffer. For small item sizes (for example, in the block hash freezer table), this strategy causes a lot of system calls for writing tiny chunks of data. It also allocated a lot of temporary []byte buffers. In the new version, we instead encode multiple items into a re-useable batch buffer, which is then written to the file all at once. This avoids performing a system call for every inserted item. To make the internal batching work, the ancient database API had to be changed. While integrating this new API in BlockChain.InsertReceiptChain, additional optimizations were also added there. Co-authored-by: Felix Lange <fjl@twurst.com>pull/23542/head
Martin Holst Swende
3 years ago
committed by
GitHub
parent
9a0df80bbc
commit
794c6133ef
@ -0,0 +1,248 @@ |
|||||||
|
// Copyright 2021 The go-ethereum Authors
|
||||||
|
// This file is part of the go-ethereum library.
|
||||||
|
//
|
||||||
|
// The go-ethereum library is free software: you can redistribute it and/or modify
|
||||||
|
// it under the terms of the GNU Lesser General Public License as published by
|
||||||
|
// the Free Software Foundation, either version 3 of the License, or
|
||||||
|
// (at your option) any later version.
|
||||||
|
//
|
||||||
|
// The go-ethereum library is distributed in the hope that it will be useful,
|
||||||
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||||
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||||
|
// GNU Lesser General Public License for more details.
|
||||||
|
//
|
||||||
|
// You should have received a copy of the GNU Lesser General Public License
|
||||||
|
// along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.
|
||||||
|
|
||||||
|
package rawdb |
||||||
|
|
||||||
|
import ( |
||||||
|
"fmt" |
||||||
|
"sync/atomic" |
||||||
|
|
||||||
|
"github.com/ethereum/go-ethereum/common/math" |
||||||
|
"github.com/ethereum/go-ethereum/rlp" |
||||||
|
"github.com/golang/snappy" |
||||||
|
) |
||||||
|
|
||||||
|
// This is the maximum amount of data that will be buffered in memory
|
||||||
|
// for a single freezer table batch.
|
||||||
|
const freezerBatchBufferLimit = 2 * 1024 * 1024 |
||||||
|
|
||||||
|
// freezerBatch is a write operation of multiple items on a freezer.
|
||||||
|
type freezerBatch struct { |
||||||
|
tables map[string]*freezerTableBatch |
||||||
|
} |
||||||
|
|
||||||
|
func newFreezerBatch(f *freezer) *freezerBatch { |
||||||
|
batch := &freezerBatch{tables: make(map[string]*freezerTableBatch, len(f.tables))} |
||||||
|
for kind, table := range f.tables { |
||||||
|
batch.tables[kind] = table.newBatch() |
||||||
|
} |
||||||
|
return batch |
||||||
|
} |
||||||
|
|
||||||
|
// Append adds an RLP-encoded item of the given kind.
|
||||||
|
func (batch *freezerBatch) Append(kind string, num uint64, item interface{}) error { |
||||||
|
return batch.tables[kind].Append(num, item) |
||||||
|
} |
||||||
|
|
||||||
|
// AppendRaw adds an item of the given kind.
|
||||||
|
func (batch *freezerBatch) AppendRaw(kind string, num uint64, item []byte) error { |
||||||
|
return batch.tables[kind].AppendRaw(num, item) |
||||||
|
} |
||||||
|
|
||||||
|
// reset initializes the batch.
|
||||||
|
func (batch *freezerBatch) reset() { |
||||||
|
for _, tb := range batch.tables { |
||||||
|
tb.reset() |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
// commit is called at the end of a write operation and
|
||||||
|
// writes all remaining data to tables.
|
||||||
|
func (batch *freezerBatch) commit() (item uint64, writeSize int64, err error) { |
||||||
|
// Check that count agrees on all batches.
|
||||||
|
item = uint64(math.MaxUint64) |
||||||
|
for name, tb := range batch.tables { |
||||||
|
if item < math.MaxUint64 && tb.curItem != item { |
||||||
|
return 0, 0, fmt.Errorf("table %s is at item %d, want %d", name, tb.curItem, item) |
||||||
|
} |
||||||
|
item = tb.curItem |
||||||
|
} |
||||||
|
|
||||||
|
// Commit all table batches.
|
||||||
|
for _, tb := range batch.tables { |
||||||
|
if err := tb.commit(); err != nil { |
||||||
|
return 0, 0, err |
||||||
|
} |
||||||
|
writeSize += tb.totalBytes |
||||||
|
} |
||||||
|
return item, writeSize, nil |
||||||
|
} |
||||||
|
|
||||||
|
// freezerTableBatch is a batch for a freezer table.
|
||||||
|
type freezerTableBatch struct { |
||||||
|
t *freezerTable |
||||||
|
|
||||||
|
sb *snappyBuffer |
||||||
|
encBuffer writeBuffer |
||||||
|
dataBuffer []byte |
||||||
|
indexBuffer []byte |
||||||
|
curItem uint64 // expected index of next append
|
||||||
|
totalBytes int64 // counts written bytes since reset
|
||||||
|
} |
||||||
|
|
||||||
|
// newBatch creates a new batch for the freezer table.
|
||||||
|
func (t *freezerTable) newBatch() *freezerTableBatch { |
||||||
|
batch := &freezerTableBatch{t: t} |
||||||
|
if !t.noCompression { |
||||||
|
batch.sb = new(snappyBuffer) |
||||||
|
} |
||||||
|
batch.reset() |
||||||
|
return batch |
||||||
|
} |
||||||
|
|
||||||
|
// reset clears the batch for reuse.
|
||||||
|
func (batch *freezerTableBatch) reset() { |
||||||
|
batch.dataBuffer = batch.dataBuffer[:0] |
||||||
|
batch.indexBuffer = batch.indexBuffer[:0] |
||||||
|
batch.curItem = atomic.LoadUint64(&batch.t.items) |
||||||
|
batch.totalBytes = 0 |
||||||
|
} |
||||||
|
|
||||||
|
// Append rlp-encodes and adds data at the end of the freezer table. The item number is a
|
||||||
|
// precautionary parameter to ensure data correctness, but the table will reject already
|
||||||
|
// existing data.
|
||||||
|
func (batch *freezerTableBatch) Append(item uint64, data interface{}) error { |
||||||
|
if item != batch.curItem { |
||||||
|
return errOutOrderInsertion |
||||||
|
} |
||||||
|
|
||||||
|
// Encode the item.
|
||||||
|
batch.encBuffer.Reset() |
||||||
|
if err := rlp.Encode(&batch.encBuffer, data); err != nil { |
||||||
|
return err |
||||||
|
} |
||||||
|
encItem := batch.encBuffer.data |
||||||
|
if batch.sb != nil { |
||||||
|
encItem = batch.sb.compress(encItem) |
||||||
|
} |
||||||
|
return batch.appendItem(encItem) |
||||||
|
} |
||||||
|
|
||||||
|
// AppendRaw injects a binary blob at the end of the freezer table. The item number is a
|
||||||
|
// precautionary parameter to ensure data correctness, but the table will reject already
|
||||||
|
// existing data.
|
||||||
|
func (batch *freezerTableBatch) AppendRaw(item uint64, blob []byte) error { |
||||||
|
if item != batch.curItem { |
||||||
|
return errOutOrderInsertion |
||||||
|
} |
||||||
|
|
||||||
|
encItem := blob |
||||||
|
if batch.sb != nil { |
||||||
|
encItem = batch.sb.compress(blob) |
||||||
|
} |
||||||
|
return batch.appendItem(encItem) |
||||||
|
} |
||||||
|
|
||||||
|
func (batch *freezerTableBatch) appendItem(data []byte) error { |
||||||
|
// Check if item fits into current data file.
|
||||||
|
itemSize := int64(len(data)) |
||||||
|
itemOffset := batch.t.headBytes + int64(len(batch.dataBuffer)) |
||||||
|
if itemOffset+itemSize > int64(batch.t.maxFileSize) { |
||||||
|
// It doesn't fit, go to next file first.
|
||||||
|
if err := batch.commit(); err != nil { |
||||||
|
return err |
||||||
|
} |
||||||
|
if err := batch.t.advanceHead(); err != nil { |
||||||
|
return err |
||||||
|
} |
||||||
|
itemOffset = 0 |
||||||
|
} |
||||||
|
|
||||||
|
// Put data to buffer.
|
||||||
|
batch.dataBuffer = append(batch.dataBuffer, data...) |
||||||
|
batch.totalBytes += itemSize |
||||||
|
|
||||||
|
// Put index entry to buffer.
|
||||||
|
entry := indexEntry{filenum: batch.t.headId, offset: uint32(itemOffset + itemSize)} |
||||||
|
batch.indexBuffer = entry.append(batch.indexBuffer) |
||||||
|
batch.curItem++ |
||||||
|
|
||||||
|
return batch.maybeCommit() |
||||||
|
} |
||||||
|
|
||||||
|
// maybeCommit writes the buffered data if the buffer is full enough.
|
||||||
|
func (batch *freezerTableBatch) maybeCommit() error { |
||||||
|
if len(batch.dataBuffer) > freezerBatchBufferLimit { |
||||||
|
return batch.commit() |
||||||
|
} |
||||||
|
return nil |
||||||
|
} |
||||||
|
|
||||||
|
// commit writes the batched items to the backing freezerTable.
|
||||||
|
func (batch *freezerTableBatch) commit() error { |
||||||
|
// Write data.
|
||||||
|
_, err := batch.t.head.Write(batch.dataBuffer) |
||||||
|
if err != nil { |
||||||
|
return err |
||||||
|
} |
||||||
|
dataSize := int64(len(batch.dataBuffer)) |
||||||
|
batch.dataBuffer = batch.dataBuffer[:0] |
||||||
|
|
||||||
|
// Write index.
|
||||||
|
_, err = batch.t.index.Write(batch.indexBuffer) |
||||||
|
if err != nil { |
||||||
|
return err |
||||||
|
} |
||||||
|
indexSize := int64(len(batch.indexBuffer)) |
||||||
|
batch.indexBuffer = batch.indexBuffer[:0] |
||||||
|
|
||||||
|
// Update headBytes of table.
|
||||||
|
batch.t.headBytes += dataSize |
||||||
|
atomic.StoreUint64(&batch.t.items, batch.curItem) |
||||||
|
|
||||||
|
// Update metrics.
|
||||||
|
batch.t.sizeGauge.Inc(dataSize + indexSize) |
||||||
|
batch.t.writeMeter.Mark(dataSize + indexSize) |
||||||
|
return nil |
||||||
|
} |
||||||
|
|
||||||
|
// snappyBuffer writes snappy in block format, and can be reused. It is
|
||||||
|
// reset when WriteTo is called.
|
||||||
|
type snappyBuffer struct { |
||||||
|
dst []byte |
||||||
|
} |
||||||
|
|
||||||
|
// compress snappy-compresses the data.
|
||||||
|
func (s *snappyBuffer) compress(data []byte) []byte { |
||||||
|
// The snappy library does not care what the capacity of the buffer is,
|
||||||
|
// but only checks the length. If the length is too small, it will
|
||||||
|
// allocate a brand new buffer.
|
||||||
|
// To avoid that, we check the required size here, and grow the size of the
|
||||||
|
// buffer to utilize the full capacity.
|
||||||
|
if n := snappy.MaxEncodedLen(len(data)); len(s.dst) < n { |
||||||
|
if cap(s.dst) < n { |
||||||
|
s.dst = make([]byte, n) |
||||||
|
} |
||||||
|
s.dst = s.dst[:n] |
||||||
|
} |
||||||
|
|
||||||
|
s.dst = snappy.Encode(s.dst, data) |
||||||
|
return s.dst |
||||||
|
} |
||||||
|
|
||||||
|
// writeBuffer implements io.Writer for a byte slice.
|
||||||
|
type writeBuffer struct { |
||||||
|
data []byte |
||||||
|
} |
||||||
|
|
||||||
|
func (wb *writeBuffer) Write(data []byte) (int, error) { |
||||||
|
wb.data = append(wb.data, data...) |
||||||
|
return len(data), nil |
||||||
|
} |
||||||
|
|
||||||
|
func (wb *writeBuffer) Reset() { |
||||||
|
wb.data = wb.data[:0] |
||||||
|
} |
||||||
@ -0,0 +1,301 @@ |
|||||||
|
// Copyright 2021 The go-ethereum Authors
|
||||||
|
// This file is part of the go-ethereum library.
|
||||||
|
//
|
||||||
|
// The go-ethereum library is free software: you can redistribute it and/or modify
|
||||||
|
// it under the terms of the GNU Lesser General Public License as published by
|
||||||
|
// the Free Software Foundation, either version 3 of the License, or
|
||||||
|
// (at your option) any later version.
|
||||||
|
//
|
||||||
|
// The go-ethereum library is distributed in the hope that it will be useful,
|
||||||
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||||
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||||
|
// GNU Lesser General Public License for more details.
|
||||||
|
//
|
||||||
|
// You should have received a copy of the GNU Lesser General Public License
|
||||||
|
// along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.
|
||||||
|
|
||||||
|
package rawdb |
||||||
|
|
||||||
|
import ( |
||||||
|
"bytes" |
||||||
|
"errors" |
||||||
|
"fmt" |
||||||
|
"io/ioutil" |
||||||
|
"math/big" |
||||||
|
"math/rand" |
||||||
|
"os" |
||||||
|
"sync" |
||||||
|
"testing" |
||||||
|
|
||||||
|
"github.com/ethereum/go-ethereum/ethdb" |
||||||
|
"github.com/ethereum/go-ethereum/rlp" |
||||||
|
"github.com/stretchr/testify/require" |
||||||
|
) |
||||||
|
|
||||||
|
var freezerTestTableDef = map[string]bool{"test": true} |
||||||
|
|
||||||
|
func TestFreezerModify(t *testing.T) { |
||||||
|
t.Parallel() |
||||||
|
|
||||||
|
// Create test data.
|
||||||
|
var valuesRaw [][]byte |
||||||
|
var valuesRLP []*big.Int |
||||||
|
for x := 0; x < 100; x++ { |
||||||
|
v := getChunk(256, x) |
||||||
|
valuesRaw = append(valuesRaw, v) |
||||||
|
iv := big.NewInt(int64(x)) |
||||||
|
iv = iv.Exp(iv, iv, nil) |
||||||
|
valuesRLP = append(valuesRLP, iv) |
||||||
|
} |
||||||
|
|
||||||
|
tables := map[string]bool{"raw": true, "rlp": false} |
||||||
|
f, dir := newFreezerForTesting(t, tables) |
||||||
|
defer os.RemoveAll(dir) |
||||||
|
defer f.Close() |
||||||
|
|
||||||
|
// Commit test data.
|
||||||
|
_, err := f.ModifyAncients(func(op ethdb.AncientWriteOp) error { |
||||||
|
for i := range valuesRaw { |
||||||
|
if err := op.AppendRaw("raw", uint64(i), valuesRaw[i]); err != nil { |
||||||
|
return err |
||||||
|
} |
||||||
|
if err := op.Append("rlp", uint64(i), valuesRLP[i]); err != nil { |
||||||
|
return err |
||||||
|
} |
||||||
|
} |
||||||
|
return nil |
||||||
|
}) |
||||||
|
if err != nil { |
||||||
|
t.Fatal("ModifyAncients failed:", err) |
||||||
|
} |
||||||
|
|
||||||
|
// Dump indexes.
|
||||||
|
for _, table := range f.tables { |
||||||
|
t.Log(table.name, "index:", table.dumpIndexString(0, int64(len(valuesRaw)))) |
||||||
|
} |
||||||
|
|
||||||
|
// Read back test data.
|
||||||
|
checkAncientCount(t, f, "raw", uint64(len(valuesRaw))) |
||||||
|
checkAncientCount(t, f, "rlp", uint64(len(valuesRLP))) |
||||||
|
for i := range valuesRaw { |
||||||
|
v, _ := f.Ancient("raw", uint64(i)) |
||||||
|
if !bytes.Equal(v, valuesRaw[i]) { |
||||||
|
t.Fatalf("wrong raw value at %d: %x", i, v) |
||||||
|
} |
||||||
|
ivEnc, _ := f.Ancient("rlp", uint64(i)) |
||||||
|
want, _ := rlp.EncodeToBytes(valuesRLP[i]) |
||||||
|
if !bytes.Equal(ivEnc, want) { |
||||||
|
t.Fatalf("wrong RLP value at %d: %x", i, ivEnc) |
||||||
|
} |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
// This checks that ModifyAncients rolls back freezer updates
|
||||||
|
// when the function passed to it returns an error.
|
||||||
|
func TestFreezerModifyRollback(t *testing.T) { |
||||||
|
t.Parallel() |
||||||
|
|
||||||
|
f, dir := newFreezerForTesting(t, freezerTestTableDef) |
||||||
|
defer os.RemoveAll(dir) |
||||||
|
|
||||||
|
theError := errors.New("oops") |
||||||
|
_, err := f.ModifyAncients(func(op ethdb.AncientWriteOp) error { |
||||||
|
// Append three items. This creates two files immediately,
|
||||||
|
// because the table size limit of the test freezer is 2048.
|
||||||
|
require.NoError(t, op.AppendRaw("test", 0, make([]byte, 2048))) |
||||||
|
require.NoError(t, op.AppendRaw("test", 1, make([]byte, 2048))) |
||||||
|
require.NoError(t, op.AppendRaw("test", 2, make([]byte, 2048))) |
||||||
|
return theError |
||||||
|
}) |
||||||
|
if err != theError { |
||||||
|
t.Errorf("ModifyAncients returned wrong error %q", err) |
||||||
|
} |
||||||
|
checkAncientCount(t, f, "test", 0) |
||||||
|
f.Close() |
||||||
|
|
||||||
|
// Reopen and check that the rolled-back data doesn't reappear.
|
||||||
|
tables := map[string]bool{"test": true} |
||||||
|
f2, err := newFreezer(dir, "", false, 2049, tables) |
||||||
|
if err != nil { |
||||||
|
t.Fatalf("can't reopen freezer after failed ModifyAncients: %v", err) |
||||||
|
} |
||||||
|
defer f2.Close() |
||||||
|
checkAncientCount(t, f2, "test", 0) |
||||||
|
} |
||||||
|
|
||||||
|
// This test runs ModifyAncients and Ancient concurrently with each other.
|
||||||
|
func TestFreezerConcurrentModifyRetrieve(t *testing.T) { |
||||||
|
t.Parallel() |
||||||
|
|
||||||
|
f, dir := newFreezerForTesting(t, freezerTestTableDef) |
||||||
|
defer os.RemoveAll(dir) |
||||||
|
defer f.Close() |
||||||
|
|
||||||
|
var ( |
||||||
|
numReaders = 5 |
||||||
|
writeBatchSize = uint64(50) |
||||||
|
written = make(chan uint64, numReaders*6) |
||||||
|
wg sync.WaitGroup |
||||||
|
) |
||||||
|
wg.Add(numReaders + 1) |
||||||
|
|
||||||
|
// Launch the writer. It appends 10000 items in batches.
|
||||||
|
go func() { |
||||||
|
defer wg.Done() |
||||||
|
defer close(written) |
||||||
|
for item := uint64(0); item < 10000; item += writeBatchSize { |
||||||
|
_, err := f.ModifyAncients(func(op ethdb.AncientWriteOp) error { |
||||||
|
for i := uint64(0); i < writeBatchSize; i++ { |
||||||
|
item := item + i |
||||||
|
value := getChunk(32, int(item)) |
||||||
|
if err := op.AppendRaw("test", item, value); err != nil { |
||||||
|
return err |
||||||
|
} |
||||||
|
} |
||||||
|
return nil |
||||||
|
}) |
||||||
|
if err != nil { |
||||||
|
panic(err) |
||||||
|
} |
||||||
|
for i := 0; i < numReaders; i++ { |
||||||
|
written <- item + writeBatchSize |
||||||
|
} |
||||||
|
} |
||||||
|
}() |
||||||
|
|
||||||
|
// Launch the readers. They read random items from the freezer up to the
|
||||||
|
// current frozen item count.
|
||||||
|
for i := 0; i < numReaders; i++ { |
||||||
|
go func() { |
||||||
|
defer wg.Done() |
||||||
|
for frozen := range written { |
||||||
|
for rc := 0; rc < 80; rc++ { |
||||||
|
num := uint64(rand.Intn(int(frozen))) |
||||||
|
value, err := f.Ancient("test", num) |
||||||
|
if err != nil { |
||||||
|
panic(fmt.Errorf("error reading %d (frozen %d): %v", num, frozen, err)) |
||||||
|
} |
||||||
|
if !bytes.Equal(value, getChunk(32, int(num))) { |
||||||
|
panic(fmt.Errorf("wrong value at %d", num)) |
||||||
|
} |
||||||
|
} |
||||||
|
} |
||||||
|
}() |
||||||
|
} |
||||||
|
|
||||||
|
wg.Wait() |
||||||
|
} |
||||||
|
|
||||||
|
// This test runs ModifyAncients and TruncateAncients concurrently with each other.
|
||||||
|
func TestFreezerConcurrentModifyTruncate(t *testing.T) { |
||||||
|
f, dir := newFreezerForTesting(t, freezerTestTableDef) |
||||||
|
defer os.RemoveAll(dir) |
||||||
|
defer f.Close() |
||||||
|
|
||||||
|
var item = make([]byte, 256) |
||||||
|
|
||||||
|
for i := 0; i < 1000; i++ { |
||||||
|
// First reset and write 100 items.
|
||||||
|
if err := f.TruncateAncients(0); err != nil { |
||||||
|
t.Fatal("truncate failed:", err) |
||||||
|
} |
||||||
|
_, err := f.ModifyAncients(func(op ethdb.AncientWriteOp) error { |
||||||
|
for i := uint64(0); i < 100; i++ { |
||||||
|
if err := op.AppendRaw("test", i, item); err != nil { |
||||||
|
return err |
||||||
|
} |
||||||
|
} |
||||||
|
return nil |
||||||
|
}) |
||||||
|
if err != nil { |
||||||
|
t.Fatal("modify failed:", err) |
||||||
|
} |
||||||
|
checkAncientCount(t, f, "test", 100) |
||||||
|
|
||||||
|
// Now append 100 more items and truncate concurrently.
|
||||||
|
var ( |
||||||
|
wg sync.WaitGroup |
||||||
|
truncateErr error |
||||||
|
modifyErr error |
||||||
|
) |
||||||
|
wg.Add(3) |
||||||
|
go func() { |
||||||
|
_, modifyErr = f.ModifyAncients(func(op ethdb.AncientWriteOp) error { |
||||||
|
for i := uint64(100); i < 200; i++ { |
||||||
|
if err := op.AppendRaw("test", i, item); err != nil { |
||||||
|
return err |
||||||
|
} |
||||||
|
} |
||||||
|
return nil |
||||||
|
}) |
||||||
|
wg.Done() |
||||||
|
}() |
||||||
|
go func() { |
||||||
|
truncateErr = f.TruncateAncients(10) |
||||||
|
wg.Done() |
||||||
|
}() |
||||||
|
go func() { |
||||||
|
f.AncientSize("test") |
||||||
|
wg.Done() |
||||||
|
}() |
||||||
|
wg.Wait() |
||||||
|
|
||||||
|
// Now check the outcome. If the truncate operation went through first, the append
|
||||||
|
// fails, otherwise it succeeds. In either case, the freezer should be positioned
|
||||||
|
// at 10 after both operations are done.
|
||||||
|
if truncateErr != nil { |
||||||
|
t.Fatal("concurrent truncate failed:", err) |
||||||
|
} |
||||||
|
if !(modifyErr == nil || modifyErr == errOutOrderInsertion) { |
||||||
|
t.Fatal("wrong error from concurrent modify:", modifyErr) |
||||||
|
} |
||||||
|
checkAncientCount(t, f, "test", 10) |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
func newFreezerForTesting(t *testing.T, tables map[string]bool) (*freezer, string) { |
||||||
|
t.Helper() |
||||||
|
|
||||||
|
dir, err := ioutil.TempDir("", "freezer") |
||||||
|
if err != nil { |
||||||
|
t.Fatal(err) |
||||||
|
} |
||||||
|
// note: using low max table size here to ensure the tests actually
|
||||||
|
// switch between multiple files.
|
||||||
|
f, err := newFreezer(dir, "", false, 2049, tables) |
||||||
|
if err != nil { |
||||||
|
t.Fatal("can't open freezer", err) |
||||||
|
} |
||||||
|
return f, dir |
||||||
|
} |
||||||
|
|
||||||
|
// checkAncientCount verifies that the freezer contains n items.
|
||||||
|
func checkAncientCount(t *testing.T, f *freezer, kind string, n uint64) { |
||||||
|
t.Helper() |
||||||
|
|
||||||
|
if frozen, _ := f.Ancients(); frozen != n { |
||||||
|
t.Fatalf("Ancients() returned %d, want %d", frozen, n) |
||||||
|
} |
||||||
|
|
||||||
|
// Check at index n-1.
|
||||||
|
if n > 0 { |
||||||
|
index := n - 1 |
||||||
|
if ok, _ := f.HasAncient(kind, index); !ok { |
||||||
|
t.Errorf("HasAncient(%q, %d) returned false unexpectedly", kind, index) |
||||||
|
} |
||||||
|
if _, err := f.Ancient(kind, index); err != nil { |
||||||
|
t.Errorf("Ancient(%q, %d) returned unexpected error %q", kind, index, err) |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
// Check at index n.
|
||||||
|
index := n |
||||||
|
if ok, _ := f.HasAncient(kind, index); ok { |
||||||
|
t.Errorf("HasAncient(%q, %d) returned true unexpectedly", kind, index) |
||||||
|
} |
||||||
|
if _, err := f.Ancient(kind, index); err == nil { |
||||||
|
t.Errorf("Ancient(%q, %d) didn't return expected error", kind, index) |
||||||
|
} else if err != errOutOfBounds { |
||||||
|
t.Errorf("Ancient(%q, %d) returned unexpected error %q", kind, index, err) |
||||||
|
} |
||||||
|
} |
||||||
Loading…
Reference in new issue