mirror of
https://github.com/kopia/kopia.git
synced 2026-01-26 15:28:06 -05:00
d60d33bda5
* upload: do not launch error group when doing non-parallel upload * encryption: refactored code to reduce slice allocation, this uncovered a minor subtle bug in index recovery due to manual memory management * content: fixed use-after-free bug during index recovery that started failing test after encryption memory management improvements * gather: tweaked retention and chunk sizes * gather: added typicalContiguousAllocator with 8MB chunks for default configuration
78 lines
2.1 KiB
Go
78 lines
2.1 KiB
Go
package gather
|
|
|
|
import (
|
|
"bytes"
|
|
"testing"
|
|
|
|
"github.com/kopia/kopia/repo/splitter"
|
|
)
|
|
|
|
func TestWriteBufferChunk(t *testing.T) {
|
|
// reset for testing
|
|
all := &chunkAllocator{
|
|
chunkSize: 100,
|
|
maxFreeListSize: 10,
|
|
}
|
|
|
|
// reset for testing
|
|
chunk1 := all.allocChunk()
|
|
_ = append(chunk1, []byte("chunk1")...)
|
|
|
|
if got, want := len(chunk1), 0; got != want {
|
|
t.Errorf("invalid chunk len: %v, want %v", got, want)
|
|
}
|
|
|
|
if got, want := cap(chunk1), all.chunkSize; got != want {
|
|
t.Errorf("invalid chunk cap: %v, want %v", got, want)
|
|
}
|
|
|
|
if got, want := all.freeListHighWaterMark, 0; got != want {
|
|
t.Errorf("unexpected high water mark %v, want %v", got, want)
|
|
}
|
|
|
|
chunk2 := all.allocChunk()
|
|
_ = append(chunk2, []byte("chunk2")...)
|
|
|
|
if got, want := all.freeListHighWaterMark, 0; got != want {
|
|
t.Errorf("unexpected high water mark %v, want %v", got, want)
|
|
}
|
|
|
|
all.releaseChunk(chunk2)
|
|
|
|
if got, want := all.freeListHighWaterMark, 1; got != want {
|
|
t.Errorf("unexpected high water mark %v, want %v", got, want)
|
|
}
|
|
|
|
all.releaseChunk(chunk1)
|
|
|
|
if got, want := all.freeListHighWaterMark, 2; got != want {
|
|
t.Errorf("unexpected high water mark %v, want %v", got, want)
|
|
}
|
|
|
|
// allocate chunk3 - make sure we got the same slice as chunk1 (LIFO)
|
|
chunk3 := all.allocChunk()
|
|
if got, want := chunk3[0:6], []byte("chunk1"); !bytes.Equal(got, want) {
|
|
t.Errorf("got wrong chunk data %q, want %q", string(got), string(want))
|
|
}
|
|
|
|
// allocate chunk4 - make sure we got the same slice as chunk1 (LIFO)
|
|
chunk4 := all.allocChunk()
|
|
if got, want := chunk4[0:6], []byte("chunk2"); !bytes.Equal(got, want) {
|
|
t.Errorf("got wrong chunk data %q, want %q", string(got), string(want))
|
|
}
|
|
}
|
|
|
|
func TestContigAllocatorChunkSize(t *testing.T) {
|
|
// verify that contiguous allocator has chunk size big enough for all splitter results
|
|
// + some minimal overhead.
|
|
const maxOverhead = 128
|
|
|
|
for _, s := range splitter.SupportedAlgorithms() {
|
|
mss := splitter.GetFactory(s)().MaxSegmentSize()
|
|
|
|
if got, want := maxContiguousAllocator.chunkSize, mss+maxOverhead; got < want {
|
|
t.Errorf("contiguous allocator chunk size too small: %v, want %v ", got, want)
|
|
}
|
|
}
|
|
}
|