684 lines
19 KiB
Go
684 lines
19 KiB
Go
// Copyright (C) 2019 Storj Labs, Inc.
|
|
// See LICENSE for copying information.
|
|
|
|
package eestream
|
|
|
|
import (
|
|
"bytes"
|
|
"context"
|
|
"crypto/sha256"
|
|
"errors"
|
|
"fmt"
|
|
"io"
|
|
"io/ioutil"
|
|
"math/rand"
|
|
"testing"
|
|
"time"
|
|
|
|
"github.com/stretchr/testify/assert"
|
|
"github.com/stretchr/testify/require"
|
|
"github.com/vivint/infectious"
|
|
"github.com/zeebo/errs"
|
|
|
|
"storj.io/storj/internal/memory"
|
|
"storj.io/storj/internal/readcloser"
|
|
"storj.io/storj/internal/testcontext"
|
|
"storj.io/storj/pkg/encryption"
|
|
"storj.io/storj/pkg/ranger"
|
|
"storj.io/storj/pkg/storj"
|
|
)
|
|
|
|
func randData(amount int) []byte {
|
|
buf := make([]byte, amount)
|
|
_, err := rand.Read(buf)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
return buf
|
|
}
|
|
|
|
func TestRS(t *testing.T) {
|
|
ctx := context.Background()
|
|
data := randData(32 * 1024)
|
|
fc, err := infectious.NewFEC(2, 4)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
es := NewRSScheme(fc, 8*1024)
|
|
rs, err := NewRedundancyStrategy(es, 0, 0)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
readers, err := EncodeReader(ctx, bytes.NewReader(data), rs)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
readerMap := make(map[int]io.ReadCloser, len(readers))
|
|
for i, reader := range readers {
|
|
readerMap[i] = reader
|
|
}
|
|
decoder := DecodeReaders(ctx, readerMap, rs, 32*1024, 0, false)
|
|
defer func() { assert.NoError(t, decoder.Close()) }()
|
|
data2, err := ioutil.ReadAll(decoder)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
assert.Equal(t, data, data2)
|
|
}
|
|
|
|
// Check that io.ReadFull will return io.ErrUnexpectedEOF
|
|
// if DecodeReaders return less data than expected.
|
|
func TestRSUnexpectedEOF(t *testing.T) {
|
|
ctx := context.Background()
|
|
data := randData(32 * 1024)
|
|
fc, err := infectious.NewFEC(2, 4)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
es := NewRSScheme(fc, 8*1024)
|
|
rs, err := NewRedundancyStrategy(es, 0, 0)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
readers, err := EncodeReader(ctx, bytes.NewReader(data), rs)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
readerMap := make(map[int]io.ReadCloser, len(readers))
|
|
for i, reader := range readers {
|
|
readerMap[i] = reader
|
|
}
|
|
decoder := DecodeReaders(ctx, readerMap, rs, 32*1024, 0, false)
|
|
defer func() { assert.NoError(t, decoder.Close()) }()
|
|
// Try ReadFull more data from DecodeReaders than available
|
|
data2 := make([]byte, len(data)+1024)
|
|
_, err = io.ReadFull(decoder, data2)
|
|
assert.EqualError(t, err, io.ErrUnexpectedEOF.Error())
|
|
}
|
|
|
|
func TestRSRanger(t *testing.T) {
|
|
ctx := context.Background()
|
|
data := randData(32 * 1024)
|
|
fc, err := infectious.NewFEC(2, 4)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
es := NewRSScheme(fc, 8*1024)
|
|
rs, err := NewRedundancyStrategy(es, 0, 0)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
encKey := storj.Key(sha256.Sum256([]byte("the secret key")))
|
|
var firstNonce storj.Nonce
|
|
const stripesPerBlock = 2
|
|
blockSize := stripesPerBlock * rs.StripeSize()
|
|
encrypter, err := encryption.NewEncrypter(storj.AESGCM, &encKey, &firstNonce, blockSize)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
readers, err := EncodeReader(ctx, encryption.TransformReader(PadReader(ioutil.NopCloser(
|
|
bytes.NewReader(data)), encrypter.InBlockSize()), encrypter, 0), rs)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
pieces, err := readAll(readers)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
rrs := map[int]ranger.Ranger{}
|
|
for i, piece := range pieces {
|
|
rrs[i] = ranger.ByteRanger(piece)
|
|
}
|
|
decrypter, err := encryption.NewDecrypter(storj.AESGCM, &encKey, &firstNonce, blockSize)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
rc, err := Decode(rrs, rs, 0, false)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
rr, err := encryption.Transform(rc, decrypter)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
rr, err = UnpadSlow(ctx, rr)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
r, err := rr.Range(ctx, 0, rr.Size())
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
data2, err := ioutil.ReadAll(r)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
if !bytes.Equal(data, data2) {
|
|
t.Fatalf("rs encode/decode failed")
|
|
}
|
|
}
|
|
|
|
func TestNewRedundancyStrategy(t *testing.T) {
|
|
for i, tt := range []struct {
|
|
rep int
|
|
opt int
|
|
expRep int
|
|
expOpt int
|
|
errString string
|
|
}{
|
|
{0, 0, 4, 4, ""},
|
|
{-1, 0, 0, 0, "eestream error: negative repair threshold"},
|
|
{1, 0, 0, 0, "eestream error: repair threshold less than required count"},
|
|
{5, 0, 0, 0, "eestream error: repair threshold greater than total count"},
|
|
{0, -1, 0, 0, "eestream error: negative optimal threshold"},
|
|
{0, 1, 0, 0, "eestream error: optimal threshold less than required count"},
|
|
{0, 5, 0, 0, "eestream error: optimal threshold greater than total count"},
|
|
{3, 4, 3, 4, ""},
|
|
{0, 3, 0, 0, "eestream error: repair threshold greater than optimal threshold"},
|
|
{4, 3, 0, 0, "eestream error: repair threshold greater than optimal threshold"},
|
|
{4, 4, 4, 4, ""},
|
|
} {
|
|
errTag := fmt.Sprintf("Test case #%d", i)
|
|
fc, err := infectious.NewFEC(2, 4)
|
|
if !assert.NoError(t, err, errTag) {
|
|
continue
|
|
}
|
|
es := NewRSScheme(fc, 8*1024)
|
|
rs, err := NewRedundancyStrategy(es, tt.rep, tt.opt)
|
|
if tt.errString != "" {
|
|
assert.EqualError(t, err, tt.errString, errTag)
|
|
continue
|
|
}
|
|
assert.NoError(t, err, errTag)
|
|
assert.Equal(t, tt.expRep, rs.RepairThreshold(), errTag)
|
|
assert.Equal(t, tt.expOpt, rs.OptimalThreshold(), errTag)
|
|
}
|
|
}
|
|
|
|
// Some pieces will read error.
|
|
// Test will pass if at least required number of pieces are still good.
|
|
func TestRSErrors(t *testing.T) {
|
|
for i, tt := range []testCase{
|
|
{4 * 1024, 1024, 1, 1, 0, false},
|
|
{4 * 1024, 1024, 1, 1, 1, true},
|
|
{4 * 1024, 1024, 1, 2, 0, false},
|
|
{4 * 1024, 1024, 1, 2, 1, false},
|
|
{4 * 1024, 1024, 1, 2, 2, true},
|
|
{4 * 1024, 1024, 2, 4, 0, false},
|
|
{4 * 1024, 1024, 2, 4, 1, false},
|
|
{4 * 1024, 1024, 2, 4, 2, false},
|
|
{4 * 1024, 1024, 2, 4, 3, true},
|
|
{4 * 1024, 1024, 2, 4, 4, true},
|
|
{6 * 1024, 1024, 3, 7, 0, false},
|
|
{6 * 1024, 1024, 3, 7, 1, false},
|
|
{6 * 1024, 1024, 3, 7, 2, false},
|
|
{6 * 1024, 1024, 3, 7, 3, false},
|
|
{6 * 1024, 1024, 3, 7, 4, false},
|
|
{6 * 1024, 1024, 3, 7, 5, true},
|
|
{6 * 1024, 1024, 3, 7, 6, true},
|
|
{6 * 1024, 1024, 3, 7, 7, true},
|
|
} {
|
|
testRSProblematic(t, tt, i, func(in []byte) io.ReadCloser {
|
|
return readcloser.FatalReadCloser(
|
|
errors.New("I am an error piece"))
|
|
})
|
|
}
|
|
}
|
|
|
|
// Some pieces will read EOF at the beginning (byte 0).
|
|
// Test will pass if those pieces are less than required.
|
|
func TestRSEOF(t *testing.T) {
|
|
for i, tt := range []testCase{
|
|
{4 * 1024, 1024, 1, 1, 0, false},
|
|
{4 * 1024, 1024, 1, 1, 1, true},
|
|
{4 * 1024, 1024, 1, 2, 0, false},
|
|
{4 * 1024, 1024, 1, 2, 1, false},
|
|
{4 * 1024, 1024, 1, 2, 2, true},
|
|
{4 * 1024, 1024, 2, 4, 0, false},
|
|
{4 * 1024, 1024, 2, 4, 1, false},
|
|
{4 * 1024, 1024, 2, 4, 2, false},
|
|
{4 * 1024, 1024, 2, 4, 3, true},
|
|
{4 * 1024, 1024, 2, 4, 4, true},
|
|
{6 * 1024, 1024, 3, 7, 0, false},
|
|
{6 * 1024, 1024, 3, 7, 1, false},
|
|
{6 * 1024, 1024, 3, 7, 2, false},
|
|
{6 * 1024, 1024, 3, 7, 3, false},
|
|
{6 * 1024, 1024, 3, 7, 4, false},
|
|
{6 * 1024, 1024, 3, 7, 5, true},
|
|
{6 * 1024, 1024, 3, 7, 6, true},
|
|
{6 * 1024, 1024, 3, 7, 7, true},
|
|
} {
|
|
testRSProblematic(t, tt, i, func(in []byte) io.ReadCloser {
|
|
return readcloser.LimitReadCloser(
|
|
ioutil.NopCloser(bytes.NewReader(in)), 0)
|
|
})
|
|
}
|
|
}
|
|
|
|
// Some pieces will read EOF earlier than expected
|
|
// Test will pass if those pieces are less than required.
|
|
func TestRSEarlyEOF(t *testing.T) {
|
|
for i, tt := range []testCase{
|
|
{4 * 1024, 1024, 1, 1, 0, false},
|
|
{4 * 1024, 1024, 1, 1, 1, true},
|
|
{4 * 1024, 1024, 1, 2, 0, false},
|
|
{4 * 1024, 1024, 1, 2, 1, false},
|
|
{4 * 1024, 1024, 1, 2, 2, true},
|
|
{4 * 1024, 1024, 2, 4, 0, false},
|
|
{4 * 1024, 1024, 2, 4, 1, false},
|
|
{4 * 1024, 1024, 2, 4, 2, false},
|
|
{4 * 1024, 1024, 2, 4, 3, true},
|
|
{4 * 1024, 1024, 2, 4, 4, true},
|
|
{6 * 1024, 1024, 3, 7, 0, false},
|
|
{6 * 1024, 1024, 3, 7, 1, false},
|
|
{6 * 1024, 1024, 3, 7, 2, false},
|
|
{6 * 1024, 1024, 3, 7, 3, false},
|
|
{6 * 1024, 1024, 3, 7, 4, false},
|
|
{6 * 1024, 1024, 3, 7, 5, true},
|
|
{6 * 1024, 1024, 3, 7, 6, true},
|
|
{6 * 1024, 1024, 3, 7, 7, true},
|
|
} {
|
|
testRSProblematic(t, tt, i, func(in []byte) io.ReadCloser {
|
|
// Read EOF after 500 bytes
|
|
return readcloser.LimitReadCloser(
|
|
ioutil.NopCloser(bytes.NewReader(in)), 500)
|
|
})
|
|
}
|
|
}
|
|
|
|
// Some pieces will read EOF later than expected.
|
|
// Test will pass if at least required number of pieces are still good.
|
|
func TestRSLateEOF(t *testing.T) {
|
|
for i, tt := range []testCase{
|
|
{4 * 1024, 1024, 1, 1, 0, false},
|
|
{4 * 1024, 1024, 1, 1, 1, false},
|
|
{4 * 1024, 1024, 1, 2, 0, false},
|
|
{4 * 1024, 1024, 1, 2, 1, false},
|
|
{4 * 1024, 1024, 1, 2, 2, false},
|
|
{4 * 1024, 1024, 2, 4, 0, false},
|
|
{4 * 1024, 1024, 2, 4, 1, false},
|
|
{4 * 1024, 1024, 2, 4, 2, false},
|
|
{4 * 1024, 1024, 2, 4, 3, false},
|
|
{4 * 1024, 1024, 2, 4, 4, false},
|
|
{6 * 1024, 1024, 3, 7, 0, false},
|
|
{6 * 1024, 1024, 3, 7, 1, false},
|
|
{6 * 1024, 1024, 3, 7, 2, false},
|
|
{6 * 1024, 1024, 3, 7, 3, false},
|
|
{6 * 1024, 1024, 3, 7, 4, false},
|
|
{6 * 1024, 1024, 3, 7, 5, false},
|
|
{6 * 1024, 1024, 3, 7, 6, false},
|
|
{6 * 1024, 1024, 3, 7, 7, false},
|
|
} {
|
|
testRSProblematic(t, tt, i, func(in []byte) io.ReadCloser {
|
|
// extend the input with random number of random bytes
|
|
random := randData(1 + rand.Intn(10000))
|
|
extended := append(in, random...)
|
|
return ioutil.NopCloser(bytes.NewReader(extended))
|
|
})
|
|
}
|
|
}
|
|
|
|
// Some pieces will read random data.
|
|
// Test will pass if there are enough good pieces for error correction.
|
|
func TestRSRandomData(t *testing.T) {
|
|
for i, tt := range []testCase{
|
|
{4 * 1024, 1024, 1, 1, 0, false},
|
|
{4 * 1024, 1024, 1, 1, 1, true},
|
|
{4 * 1024, 1024, 1, 2, 0, false},
|
|
{4 * 1024, 1024, 1, 2, 1, true},
|
|
{4 * 1024, 1024, 1, 2, 2, true},
|
|
{4 * 1024, 1024, 2, 4, 0, false},
|
|
{4 * 1024, 1024, 2, 4, 1, false},
|
|
{4 * 1024, 1024, 2, 4, 2, true},
|
|
{4 * 1024, 1024, 2, 4, 3, true},
|
|
{4 * 1024, 1024, 2, 4, 4, true},
|
|
{6 * 1024, 1024, 3, 7, 0, false},
|
|
{6 * 1024, 1024, 3, 7, 1, false},
|
|
{6 * 1024, 1024, 3, 7, 2, false},
|
|
{6 * 1024, 1024, 3, 7, 4, true},
|
|
{6 * 1024, 1024, 3, 7, 5, true},
|
|
{6 * 1024, 1024, 3, 7, 6, true},
|
|
{6 * 1024, 1024, 3, 7, 7, true},
|
|
} {
|
|
testRSProblematic(t, tt, i, func(in []byte) io.ReadCloser {
|
|
// return random data instead of expected one
|
|
return ioutil.NopCloser(bytes.NewReader(randData(len(in))))
|
|
})
|
|
}
|
|
}
|
|
|
|
// Some pieces will read slowly
|
|
func TestRSSlow(t *testing.T) {
|
|
for i, tt := range []testCase{
|
|
{4 * 1024, 1024, 1, 1, 0, false},
|
|
{4 * 1024, 1024, 1, 2, 0, false},
|
|
{4 * 1024, 1024, 2, 4, 0, false},
|
|
{4 * 1024, 1024, 2, 4, 1, false},
|
|
{6 * 1024, 1024, 3, 7, 0, false},
|
|
{6 * 1024, 1024, 3, 7, 1, false},
|
|
{6 * 1024, 1024, 3, 7, 2, false},
|
|
{6 * 1024, 1024, 3, 7, 3, false},
|
|
} {
|
|
start := time.Now()
|
|
testRSProblematic(t, tt, i, func(in []byte) io.ReadCloser {
|
|
// sleep 1 second before every read
|
|
return ioutil.NopCloser(SlowReader(bytes.NewReader(in), 1*time.Second))
|
|
})
|
|
if time.Since(start) > 1*time.Second {
|
|
t.Fatalf("waited for slow reader")
|
|
}
|
|
}
|
|
}
|
|
|
|
type testCase struct {
|
|
dataSize int
|
|
blockSize int
|
|
required int
|
|
total int
|
|
problematic int
|
|
fail bool
|
|
}
|
|
|
|
type problematicReadCloser func([]byte) io.ReadCloser
|
|
|
|
func testRSProblematic(t *testing.T, tt testCase, i int, fn problematicReadCloser) {
|
|
errTag := fmt.Sprintf("Test case #%d", i)
|
|
ctx := context.Background()
|
|
data := randData(tt.dataSize)
|
|
fc, err := infectious.NewFEC(tt.required, tt.total)
|
|
if !assert.NoError(t, err, errTag) {
|
|
return
|
|
}
|
|
es := NewRSScheme(fc, tt.blockSize)
|
|
rs, err := NewRedundancyStrategy(es, 0, 0)
|
|
if !assert.NoError(t, err, errTag) {
|
|
return
|
|
}
|
|
readers, err := EncodeReader(ctx, bytes.NewReader(data), rs)
|
|
if !assert.NoError(t, err, errTag) {
|
|
return
|
|
}
|
|
// read all readers in []byte buffers to avoid deadlock if later
|
|
// we don't read in parallel from all of them
|
|
pieces, err := readAll(readers)
|
|
if !assert.NoError(t, err, errTag) {
|
|
return
|
|
}
|
|
readerMap := make(map[int]io.ReadCloser, len(readers))
|
|
// some readers will have problematic behavior
|
|
for i := 0; i < tt.problematic; i++ {
|
|
readerMap[i] = fn(pieces[i])
|
|
}
|
|
// the rest will operate normally
|
|
for i := tt.problematic; i < tt.total; i++ {
|
|
readerMap[i] = ioutil.NopCloser(bytes.NewReader(pieces[i]))
|
|
}
|
|
decoder := DecodeReaders(ctx, readerMap, rs, int64(tt.dataSize), 3*1024, false)
|
|
defer func() { assert.NoError(t, decoder.Close()) }()
|
|
data2, err := ioutil.ReadAll(decoder)
|
|
if tt.fail {
|
|
if err == nil && bytes.Equal(data, data2) {
|
|
assert.Fail(t, "expected to fail, but didn't", errTag)
|
|
}
|
|
} else if assert.NoError(t, err, errTag) {
|
|
assert.Equal(t, data, data2, errTag)
|
|
}
|
|
}
|
|
|
|
func readAll(readers []io.ReadCloser) ([][]byte, error) {
|
|
pieces := make([][]byte, len(readers))
|
|
errors := make(chan error, len(readers))
|
|
for i := range readers {
|
|
go func(i int) {
|
|
var err error
|
|
pieces[i], err = ioutil.ReadAll(readers[i])
|
|
errors <- errs.Combine(err, readers[i].Close())
|
|
}(i)
|
|
}
|
|
for range readers {
|
|
err := <-errors
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
}
|
|
return pieces, nil
|
|
}
|
|
|
|
func SlowReader(r io.Reader, delay time.Duration) io.Reader {
|
|
return &slowReader{Reader: r, Delay: delay}
|
|
}
|
|
|
|
type slowReader struct {
|
|
Reader io.Reader
|
|
Delay time.Duration
|
|
}
|
|
|
|
func (s *slowReader) Read(p []byte) (n int, err error) {
|
|
time.Sleep(s.Delay)
|
|
return s.Reader.Read(p)
|
|
}
|
|
|
|
func TestEncoderStalledReaders(t *testing.T) {
|
|
ctx := context.Background()
|
|
data := randData(120 * 1024)
|
|
fc, err := infectious.NewFEC(30, 60)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
es := NewRSScheme(fc, 1024)
|
|
rs, err := NewRedundancyStrategy(es, 35, 50)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
readers, err := EncodeReader(ctx, bytes.NewReader(data), rs)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
start := time.Now()
|
|
_, err = readAllStalled(readers, 25)
|
|
assert.NoError(t, err)
|
|
if time.Since(start) > 1*time.Second {
|
|
t.Fatalf("waited for slow reader")
|
|
}
|
|
for _, reader := range readers {
|
|
assert.NoError(t, reader.Close())
|
|
}
|
|
}
|
|
|
|
func readAllStalled(readers []io.ReadCloser, stalled int) ([][]byte, error) {
|
|
pieces := make([][]byte, len(readers))
|
|
errs := make(chan error, len(readers))
|
|
for i := stalled; i < len(readers); i++ {
|
|
go func(i int) {
|
|
var err error
|
|
pieces[i], err = ioutil.ReadAll(readers[i])
|
|
errs <- err
|
|
}(i)
|
|
}
|
|
for i := stalled; i < len(readers); i++ {
|
|
err := <-errs
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
}
|
|
return pieces, nil
|
|
}
|
|
|
|
func TestDecoderErrorWithStalledReaders(t *testing.T) {
|
|
ctx := context.Background()
|
|
data := randData(10 * 1024)
|
|
fc, err := infectious.NewFEC(10, 20)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
es := NewRSScheme(fc, 1024)
|
|
rs, err := NewRedundancyStrategy(es, 0, 0)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
readers, err := EncodeReader(ctx, bytes.NewReader(data), rs)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
// read all readers in []byte buffers to avoid deadlock if later
|
|
// we don't read in parallel from all of them
|
|
pieces, err := readAll(readers)
|
|
if !assert.NoError(t, err) {
|
|
return
|
|
}
|
|
readerMap := make(map[int]io.ReadCloser, len(readers))
|
|
// just a few readers will operate normally
|
|
for i := 0; i < 4; i++ {
|
|
readerMap[i] = ioutil.NopCloser(bytes.NewReader(pieces[i]))
|
|
}
|
|
// some of the readers will be slow
|
|
for i := 4; i < 7; i++ {
|
|
readerMap[i] = ioutil.NopCloser(SlowReader(bytes.NewReader(pieces[i]), 1*time.Second))
|
|
}
|
|
// most of the readers will return error
|
|
for i := 7; i < 20; i++ {
|
|
readerMap[i] = readcloser.FatalReadCloser(errors.New("I am an error piece"))
|
|
}
|
|
decoder := DecodeReaders(ctx, readerMap, rs, int64(10*1024), 0, false)
|
|
defer func() { assert.NoError(t, decoder.Close()) }()
|
|
// record the time for reading the data from the decoder
|
|
start := time.Now()
|
|
_, err = ioutil.ReadAll(decoder)
|
|
// we expect the decoder to fail with error as there are not enough good
|
|
// nodes to reconstruct the data
|
|
assert.Error(t, err)
|
|
// but without waiting for the slowest nodes
|
|
if time.Since(start) > 1*time.Second {
|
|
t.Fatalf("waited for slow reader")
|
|
}
|
|
}
|
|
|
|
func BenchmarkReedSolomonErasureScheme(b *testing.B) {
|
|
data := randData(8 << 20)
|
|
output := make([]byte, 8<<20)
|
|
|
|
confs := []struct{ required, total int }{
|
|
{2, 4},
|
|
{20, 50},
|
|
{30, 60},
|
|
{50, 80},
|
|
}
|
|
|
|
dataSizes := []int{
|
|
100,
|
|
1 << 10,
|
|
256 << 10,
|
|
1 << 20,
|
|
5 << 20,
|
|
8 << 20,
|
|
}
|
|
|
|
bytesToStr := func(bytes int) string {
|
|
switch {
|
|
case bytes > 10000000:
|
|
return fmt.Sprintf("%.fMB", float64(bytes)/float64(1<<20))
|
|
case bytes > 1000:
|
|
return fmt.Sprintf("%.fKB", float64(bytes)/float64(1<<10))
|
|
default:
|
|
return fmt.Sprintf("%dB", bytes)
|
|
}
|
|
}
|
|
|
|
for _, conf := range confs {
|
|
configuration := conf
|
|
confname := fmt.Sprintf("r%dt%d/", configuration.required, configuration.total)
|
|
for _, expDataSize := range dataSizes {
|
|
dataSize := (expDataSize / configuration.required) * configuration.required
|
|
testname := bytesToStr(dataSize)
|
|
forwardErrorCode, _ := infectious.NewFEC(configuration.required, configuration.total)
|
|
erasureScheme := NewRSScheme(forwardErrorCode, 8*1024)
|
|
|
|
b.Run("Encode/"+confname+testname, func(b *testing.B) {
|
|
b.SetBytes(int64(dataSize))
|
|
for i := 0; i < b.N; i++ {
|
|
err := erasureScheme.Encode(data[:dataSize], func(num int, data []byte) {
|
|
_, _ = num, data
|
|
})
|
|
if err != nil {
|
|
b.Fatal(err)
|
|
}
|
|
}
|
|
})
|
|
|
|
shares := []infectious.Share{}
|
|
err := erasureScheme.Encode(data[:dataSize], func(num int, data []byte) {
|
|
shares = append(shares, infectious.Share{
|
|
Number: num,
|
|
Data: append([]byte{}, data...),
|
|
})
|
|
})
|
|
if err != nil {
|
|
b.Fatal(err)
|
|
}
|
|
|
|
b.Run("Decode/"+confname+testname, func(b *testing.B) {
|
|
b.SetBytes(int64(dataSize))
|
|
shareMap := make(map[int][]byte, configuration.total*2)
|
|
for i := 0; i < b.N; i++ {
|
|
rand.Shuffle(len(shares), func(i, k int) {
|
|
shares[i], shares[k] = shares[k], shares[i]
|
|
})
|
|
|
|
offset := i % (configuration.total / 4)
|
|
n := configuration.required + 1 + offset
|
|
if n > configuration.total {
|
|
n = configuration.total
|
|
}
|
|
|
|
for k := range shareMap {
|
|
delete(shareMap, k)
|
|
}
|
|
for i := range shares[:n] {
|
|
shareMap[shares[i].Number] = shares[i].Data
|
|
}
|
|
|
|
_, err = erasureScheme.Decode(output[:dataSize], shareMap)
|
|
if err != nil {
|
|
b.Fatal(err)
|
|
}
|
|
}
|
|
})
|
|
}
|
|
}
|
|
}
|
|
|
|
func TestCalcPieceSize(t *testing.T) {
|
|
ctx := testcontext.New(t)
|
|
defer ctx.Cleanup()
|
|
|
|
for i, dataSize := range []int64{
|
|
0,
|
|
1,
|
|
1*memory.KiB.Int64() - uint32Size,
|
|
1 * memory.KiB.Int64(),
|
|
32*memory.KiB.Int64() - uint32Size,
|
|
32 * memory.KiB.Int64(),
|
|
32*memory.KiB.Int64() + 100,
|
|
} {
|
|
errTag := fmt.Sprintf("%d. %+v", i, dataSize)
|
|
|
|
fc, err := infectious.NewFEC(2, 4)
|
|
require.NoError(t, err, errTag)
|
|
es := NewRSScheme(fc, 1*memory.KiB.Int())
|
|
rs, err := NewRedundancyStrategy(es, 0, 0)
|
|
require.NoError(t, err, errTag)
|
|
|
|
calculatedSize := CalcPieceSize(dataSize, es)
|
|
|
|
randReader := ioutil.NopCloser(io.LimitReader(rand.New(rand.NewSource(rand.Int63())), dataSize))
|
|
readers, err := EncodeReader(ctx, PadReader(randReader, es.StripeSize()), rs)
|
|
require.NoError(t, err, errTag)
|
|
|
|
for _, reader := range readers {
|
|
piece, err := ioutil.ReadAll(reader)
|
|
assert.NoError(t, err, errTag)
|
|
assert.EqualValues(t, calculatedSize, len(piece), errTag)
|
|
}
|
|
}
|
|
}
|