storj/pkg/datarepair/queue/queue_test.go
Egon Elbre c56307f5b9
datarepair: remove unneeded debug message (#839)
* datarepair: remove unneeded debug message
* Make overlay-cache and routing table logs more specific
2018-12-12 17:39:16 +02:00

230 lines
4.8 KiB
Go

// Copyright (C) 2018 Storj Labs, Inc.
// See LICENSE for copying information.
package queue
import (
"sort"
"strconv"
"sync"
"testing"
"github.com/gogo/protobuf/proto"
"github.com/stretchr/testify/assert"
"storj.io/storj/pkg/pb"
"storj.io/storj/storage/redis"
"storj.io/storj/storage/redis/redisserver"
"storj.io/storj/storage/testqueue"
)
func TestEnqueueDequeue(t *testing.T) {
q := NewQueue(testqueue.New())
seg := &pb.InjuredSegment{
Path: "abc",
LostPieces: []int32{int32(1), int32(3)},
}
err := q.Enqueue(seg)
assert.NoError(t, err)
s, err := q.Dequeue()
assert.NoError(t, err)
assert.True(t, proto.Equal(&s, seg))
}
func TestDequeueEmptyQueue(t *testing.T) {
q := NewQueue(testqueue.New())
s, err := q.Dequeue()
assert.Error(t, err)
assert.Equal(t, pb.InjuredSegment{}, s)
}
func TestSequential(t *testing.T) {
q := NewQueue(testqueue.New())
const N = 100
var addSegs []*pb.InjuredSegment
for i := 0; i < N; i++ {
seg := &pb.InjuredSegment{
Path: strconv.Itoa(i),
LostPieces: []int32{int32(i)},
}
err := q.Enqueue(seg)
assert.NoError(t, err)
addSegs = append(addSegs, seg)
}
list, err := q.Peekqueue(100)
assert.NoError(t, err)
for i := 0; i < N; i++ {
assert.True(t, proto.Equal(addSegs[i], &list[i]))
}
for i := 0; i < N; i++ {
dqSeg, err := q.Dequeue()
assert.NoError(t, err)
assert.True(t, proto.Equal(addSegs[i], &dqSeg))
}
}
func TestParallel(t *testing.T) {
queue := NewQueue(testqueue.New())
const N = 100
errs := make(chan error, N*2)
entries := make(chan *pb.InjuredSegment, N*2)
var wg sync.WaitGroup
wg.Add(N)
// Add to queue concurrently
for i := 0; i < N; i++ {
go func(i int) {
defer wg.Done()
err := queue.Enqueue(&pb.InjuredSegment{
Path: strconv.Itoa(i),
LostPieces: []int32{int32(i)},
})
if err != nil {
errs <- err
}
}(i)
}
wg.Wait()
wg.Add(N)
// Remove from queue concurrently
for i := 0; i < N; i++ {
go func(i int) {
defer wg.Done()
segment, err := queue.Dequeue()
if err != nil {
errs <- err
}
entries <- &segment
}(i)
}
wg.Wait()
close(errs)
close(entries)
for err := range errs {
t.Error(err)
}
var items []*pb.InjuredSegment
for segment := range entries {
items = append(items, segment)
}
sort.Slice(items, func(i, k int) bool { return items[i].LostPieces[0] < items[k].LostPieces[0] })
// check if the enqueued and dequeued elements match
for i := 0; i < N; i++ {
assert.Equal(t, items[i].LostPieces[0], int32(i))
}
}
func BenchmarkRedisSequential(b *testing.B) {
addr, cleanup, err := redisserver.Start()
defer cleanup()
assert.NoError(b, err)
client, err := redis.NewQueue(addr, "", 1)
assert.NoError(b, err)
q := NewQueue(client)
benchmarkSequential(b, q)
}
func BenchmarkTeststoreSequential(b *testing.B) {
q := NewQueue(testqueue.New())
benchmarkSequential(b, q)
}
func benchmarkSequential(b *testing.B, q RepairQueue) {
b.ResetTimer()
for n := 0; n < b.N; n++ {
const N = 100
var addSegs []*pb.InjuredSegment
for i := 0; i < N; i++ {
seg := &pb.InjuredSegment{
Path: strconv.Itoa(i),
LostPieces: []int32{int32(i)},
}
err := q.Enqueue(seg)
assert.NoError(b, err)
addSegs = append(addSegs, seg)
}
for i := 0; i < N; i++ {
dqSeg, err := q.Dequeue()
assert.NoError(b, err)
assert.True(b, proto.Equal(addSegs[i], &dqSeg))
}
}
}
func BenchmarkRedisParallel(b *testing.B) {
addr, cleanup, err := redisserver.Start()
defer cleanup()
assert.NoError(b, err)
client, err := redis.NewQueue(addr, "", 1)
assert.NoError(b, err)
q := NewQueue(client)
benchmarkParallel(b, q)
}
func BenchmarkTeststoreParallel(b *testing.B) {
q := NewQueue(testqueue.New())
benchmarkParallel(b, q)
}
func benchmarkParallel(b *testing.B, q RepairQueue) {
b.ResetTimer()
for n := 0; n < b.N; n++ {
const N = 100
errs := make(chan error, N*2)
entries := make(chan *pb.InjuredSegment, N*2)
var wg sync.WaitGroup
wg.Add(N)
// Add to queue concurrently
for i := 0; i < N; i++ {
go func(i int) {
defer wg.Done()
err := q.Enqueue(&pb.InjuredSegment{
Path: strconv.Itoa(i),
LostPieces: []int32{int32(i)},
})
if err != nil {
errs <- err
}
}(i)
}
wg.Wait()
wg.Add(N)
// Remove from queue concurrently
for i := 0; i < N; i++ {
go func(i int) {
defer wg.Done()
segment, err := q.Dequeue()
if err != nil {
errs <- err
}
entries <- &segment
}(i)
}
wg.Wait()
close(errs)
close(entries)
for err := range errs {
b.Error(err)
}
var items []*pb.InjuredSegment
for segment := range entries {
items = append(items, segment)
}
sort.Slice(items, func(i, k int) bool { return items[i].LostPieces[0] < items[k].LostPieces[0] })
// check if the enqueued and dequeued elements match
for i := 0; i < N; i++ {
assert.Equal(b, items[i].LostPieces[0], int32(i))
}
}
}