mirror of
https://github.com/restic/restic.git
synced 2024-08-28 23:27:22 +02:00
124 lines
2.8 KiB
Go
124 lines
2.8 KiB
Go
|
package repository_test
|
||
|
|
||
|
import (
|
||
|
"math/rand"
|
||
|
"testing"
|
||
|
|
||
|
"github.com/restic/restic/internal/repository"
|
||
|
"github.com/restic/restic/internal/restic"
|
||
|
rtest "github.com/restic/restic/internal/test"
|
||
|
)
|
||
|
|
||
|
func TestMasterIndexLookup(t *testing.T) {
|
||
|
idInIdx1 := restic.NewRandomID()
|
||
|
idInIdx2 := restic.NewRandomID()
|
||
|
|
||
|
blob1 := restic.PackedBlob{
|
||
|
PackID: restic.NewRandomID(),
|
||
|
Blob: restic.Blob{
|
||
|
Type: restic.DataBlob,
|
||
|
ID: idInIdx1,
|
||
|
Length: 10,
|
||
|
Offset: 0,
|
||
|
},
|
||
|
}
|
||
|
|
||
|
blob2 := restic.PackedBlob{
|
||
|
PackID: restic.NewRandomID(),
|
||
|
Blob: restic.Blob{
|
||
|
Type: restic.DataBlob,
|
||
|
ID: idInIdx2,
|
||
|
Length: 100,
|
||
|
Offset: 10,
|
||
|
},
|
||
|
}
|
||
|
|
||
|
idx1 := repository.NewIndex()
|
||
|
idx1.Store(blob1)
|
||
|
|
||
|
idx2 := repository.NewIndex()
|
||
|
idx2.Store(blob2)
|
||
|
|
||
|
mIdx := repository.NewMasterIndex()
|
||
|
mIdx.Insert(idx1)
|
||
|
mIdx.Insert(idx2)
|
||
|
|
||
|
blobs, found := mIdx.Lookup(idInIdx1, restic.DataBlob)
|
||
|
rtest.Assert(t, found, "Expected to find blob id %v from index 1", idInIdx1)
|
||
|
rtest.Equals(t, []restic.PackedBlob{blob1}, blobs)
|
||
|
|
||
|
blobs, found = mIdx.Lookup(idInIdx2, restic.DataBlob)
|
||
|
rtest.Assert(t, found, "Expected to find blob id %v from index 2", idInIdx2)
|
||
|
rtest.Equals(t, []restic.PackedBlob{blob2}, blobs)
|
||
|
|
||
|
blobs, found = mIdx.Lookup(restic.NewRandomID(), restic.DataBlob)
|
||
|
rtest.Assert(t, !found, "Expected to not find a blob when fetching with a random id")
|
||
|
rtest.Assert(t, blobs == nil, "Expected no blobs when fetching with a random id")
|
||
|
}
|
||
|
|
||
|
func BenchmarkMasterIndexLookupSingleIndex(b *testing.B) {
|
||
|
idx1, lookupID := createRandomIndex(rand.New(rand.NewSource(0)))
|
||
|
|
||
|
mIdx := repository.NewMasterIndex()
|
||
|
mIdx.Insert(idx1)
|
||
|
|
||
|
b.ResetTimer()
|
||
|
|
||
|
for i := 0; i < b.N; i++ {
|
||
|
mIdx.Lookup(lookupID, restic.DataBlob)
|
||
|
}
|
||
|
}
|
||
|
|
||
|
func BenchmarkMasterIndexLookupMultipleIndex(b *testing.B) {
|
||
|
rng := rand.New(rand.NewSource(0))
|
||
|
mIdx := repository.NewMasterIndex()
|
||
|
|
||
|
for i := 0; i < 5; i++ {
|
||
|
idx, _ := createRandomIndex(rand.New(rng))
|
||
|
mIdx.Insert(idx)
|
||
|
}
|
||
|
|
||
|
idx1, lookupID := createRandomIndex(rand.New(rng))
|
||
|
mIdx.Insert(idx1)
|
||
|
|
||
|
b.ResetTimer()
|
||
|
|
||
|
for i := 0; i < b.N; i++ {
|
||
|
mIdx.Lookup(lookupID, restic.DataBlob)
|
||
|
}
|
||
|
}
|
||
|
|
||
|
func BenchmarkMasterIndexLookupSingleIndexUnknown(b *testing.B) {
|
||
|
lookupID := restic.NewRandomID()
|
||
|
idx1, _ := createRandomIndex(rand.New(rand.NewSource(0)))
|
||
|
|
||
|
mIdx := repository.NewMasterIndex()
|
||
|
mIdx.Insert(idx1)
|
||
|
|
||
|
b.ResetTimer()
|
||
|
|
||
|
for i := 0; i < b.N; i++ {
|
||
|
mIdx.Lookup(lookupID, restic.DataBlob)
|
||
|
}
|
||
|
}
|
||
|
|
||
|
func BenchmarkMasterIndexLookupMultipleIndexUnknown(b *testing.B) {
|
||
|
rng := rand.New(rand.NewSource(0))
|
||
|
lookupID := restic.NewRandomID()
|
||
|
mIdx := repository.NewMasterIndex()
|
||
|
|
||
|
for i := 0; i < 5; i++ {
|
||
|
idx, _ := createRandomIndex(rand.New(rng))
|
||
|
mIdx.Insert(idx)
|
||
|
}
|
||
|
|
||
|
idx1, _ := createRandomIndex(rand.New(rng))
|
||
|
mIdx.Insert(idx1)
|
||
|
|
||
|
b.ResetTimer()
|
||
|
|
||
|
for i := 0; i < b.N; i++ {
|
||
|
mIdx.Lookup(lookupID, restic.DataBlob)
|
||
|
}
|
||
|
}
|