2018-04-11 14:41:50 +01:00
|
|
|
// Copyright (C) 2018 Storj Labs, Inc.
|
|
|
|
// See LICENSE for copying information.
|
|
|
|
|
|
|
|
package eestream
|
|
|
|
|
|
|
|
import (
|
2018-05-14 21:30:57 +01:00
|
|
|
"context"
|
2018-04-11 14:41:50 +01:00
|
|
|
"io"
|
|
|
|
"io/ioutil"
|
2018-09-14 15:10:43 +01:00
|
|
|
"sync"
|
2018-04-11 14:41:50 +01:00
|
|
|
|
2018-04-17 14:39:14 +01:00
|
|
|
"storj.io/storj/internal/pkg/readcloser"
|
2018-04-11 14:41:50 +01:00
|
|
|
"storj.io/storj/pkg/ranger"
|
2018-09-14 15:10:43 +01:00
|
|
|
"storj.io/storj/pkg/utils"
|
2018-04-11 14:41:50 +01:00
|
|
|
)
|
|
|
|
|
|
|
|
type decodedReader struct {
|
2018-08-24 14:06:27 +01:00
|
|
|
ctx context.Context
|
|
|
|
cancel context.CancelFunc
|
|
|
|
readers map[int]io.ReadCloser
|
|
|
|
scheme ErasureScheme
|
|
|
|
stripeReader *StripeReader
|
|
|
|
outbuf []byte
|
|
|
|
err error
|
|
|
|
currentStripe int64
|
|
|
|
expectedStripes int64
|
2018-09-14 15:10:43 +01:00
|
|
|
close sync.Once
|
|
|
|
closeErr error
|
2018-04-24 03:17:50 +01:00
|
|
|
}
|
|
|
|
|
2018-04-11 14:41:50 +01:00
|
|
|
// DecodeReaders takes a map of readers and an ErasureScheme returning a
|
2018-05-30 16:27:09 +01:00
|
|
|
// combined Reader.
|
|
|
|
//
|
|
|
|
// rs is a map of erasure piece numbers to erasure piece streams.
|
|
|
|
// expectedSize is the number of bytes expected to be returned by the Reader.
|
|
|
|
// mbm is the maximum memory (in bytes) to be allocated for read buffers. If
|
|
|
|
// set to 0, the minimum possible memory will be used.
|
2018-05-14 21:30:57 +01:00
|
|
|
func DecodeReaders(ctx context.Context, rs map[int]io.ReadCloser,
|
2018-05-30 16:27:09 +01:00
|
|
|
es ErasureScheme, expectedSize int64, mbm int) io.ReadCloser {
|
2018-05-14 21:30:57 +01:00
|
|
|
if expectedSize < 0 {
|
|
|
|
return readcloser.FatalReadCloser(Error.New("negative expected size"))
|
|
|
|
}
|
|
|
|
if expectedSize%int64(es.DecodedBlockSize()) != 0 {
|
|
|
|
return readcloser.FatalReadCloser(
|
2018-08-06 15:24:30 +01:00
|
|
|
Error.New("expected size (%d) not a factor decoded block size (%d)",
|
|
|
|
expectedSize, es.DecodedBlockSize()))
|
2018-05-14 21:30:57 +01:00
|
|
|
}
|
2018-07-03 09:35:01 +01:00
|
|
|
if err := checkMBM(mbm); err != nil {
|
|
|
|
return readcloser.FatalReadCloser(err)
|
2018-05-14 21:30:57 +01:00
|
|
|
}
|
2018-04-11 14:41:50 +01:00
|
|
|
dr := &decodedReader{
|
2018-08-24 14:06:27 +01:00
|
|
|
readers: rs,
|
|
|
|
scheme: es,
|
|
|
|
stripeReader: NewStripeReader(rs, es, mbm),
|
|
|
|
outbuf: make([]byte, 0, es.DecodedBlockSize()),
|
|
|
|
expectedStripes: expectedSize / int64(es.DecodedBlockSize()),
|
|
|
|
}
|
|
|
|
dr.ctx, dr.cancel = context.WithCancel(ctx)
|
|
|
|
// Kick off a goroutine to watch for context cancelation.
|
|
|
|
go func() {
|
|
|
|
<-dr.ctx.Done()
|
2018-08-27 18:28:16 +01:00
|
|
|
_ = dr.Close()
|
2018-08-24 14:06:27 +01:00
|
|
|
}()
|
2018-04-11 14:41:50 +01:00
|
|
|
return dr
|
|
|
|
}
|
|
|
|
|
|
|
|
func (dr *decodedReader) Read(p []byte) (n int, err error) {
|
|
|
|
if len(dr.outbuf) <= 0 {
|
|
|
|
// if the output buffer is empty, let's fill it again
|
|
|
|
// if we've already had an error, fail
|
|
|
|
if dr.err != nil {
|
2018-05-14 21:30:57 +01:00
|
|
|
return 0, dr.err
|
2018-04-11 14:41:50 +01:00
|
|
|
}
|
2018-08-24 14:06:27 +01:00
|
|
|
// return EOF is the expected stripes were read
|
|
|
|
if dr.currentStripe >= dr.expectedStripes {
|
2018-05-14 21:30:57 +01:00
|
|
|
dr.err = io.EOF
|
|
|
|
return 0, dr.err
|
2018-04-11 14:41:50 +01:00
|
|
|
}
|
2018-08-24 14:06:27 +01:00
|
|
|
// read the input buffers of the next stripe - may also decode it
|
|
|
|
dr.outbuf, dr.err = dr.stripeReader.ReadStripe(dr.currentStripe, dr.outbuf)
|
2018-05-14 21:30:57 +01:00
|
|
|
if dr.err != nil {
|
|
|
|
return 0, dr.err
|
|
|
|
}
|
2018-08-24 14:06:27 +01:00
|
|
|
dr.currentStripe++
|
2018-04-11 14:41:50 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// copy what data we have to the output
|
|
|
|
n = copy(p, dr.outbuf)
|
|
|
|
// slide the remaining bytes to the beginning
|
|
|
|
copy(dr.outbuf, dr.outbuf[n:])
|
|
|
|
// shrink the remaining buffer
|
|
|
|
dr.outbuf = dr.outbuf[:len(dr.outbuf)-n]
|
|
|
|
return n, nil
|
|
|
|
}
|
|
|
|
|
2018-04-17 14:39:14 +01:00
|
|
|
func (dr *decodedReader) Close() error {
|
2018-05-14 21:30:57 +01:00
|
|
|
// cancel the context to terminate reader goroutines
|
|
|
|
dr.cancel()
|
2018-09-14 15:10:43 +01:00
|
|
|
// avoid double close of readers
|
|
|
|
dr.close.Do(func() {
|
|
|
|
errs := make([]error, len(dr.readers)+1)
|
|
|
|
// close the readers
|
|
|
|
for i, r := range dr.readers {
|
|
|
|
errs[i] = r.Close()
|
2018-04-17 14:39:14 +01:00
|
|
|
}
|
2018-09-14 15:10:43 +01:00
|
|
|
// close the stripe reader
|
|
|
|
errs[len(dr.readers)] = dr.stripeReader.Close()
|
|
|
|
dr.closeErr = utils.CombineErrors(errs...)
|
|
|
|
})
|
|
|
|
return dr.closeErr
|
2018-05-14 21:30:57 +01:00
|
|
|
}
|
|
|
|
|
2018-04-11 14:41:50 +01:00
|
|
|
type decodedRanger struct {
|
2018-05-30 16:27:09 +01:00
|
|
|
es ErasureScheme
|
2018-09-14 15:10:43 +01:00
|
|
|
rrs map[int]ranger.Ranger
|
2018-05-30 16:27:09 +01:00
|
|
|
inSize int64
|
|
|
|
mbm int // max buffer memory
|
2018-04-11 14:41:50 +01:00
|
|
|
}
|
|
|
|
|
2018-05-30 16:27:09 +01:00
|
|
|
// Decode takes a map of Rangers and an ErasureScheme and returns a combined
|
|
|
|
// Ranger.
|
|
|
|
//
|
|
|
|
// rrs is a map of erasure piece numbers to erasure piece rangers.
|
|
|
|
// mbm is the maximum memory (in bytes) to be allocated for read buffers. If
|
|
|
|
// set to 0, the minimum possible memory will be used.
|
2018-09-14 15:10:43 +01:00
|
|
|
func Decode(rrs map[int]ranger.Ranger, es ErasureScheme, mbm int) (ranger.Ranger, error) {
|
2018-07-03 09:35:01 +01:00
|
|
|
if err := checkMBM(mbm); err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
if len(rrs) < es.RequiredCount() {
|
|
|
|
return nil, Error.New("not enough readers to reconstruct data!")
|
2018-05-14 21:30:57 +01:00
|
|
|
}
|
2018-04-11 14:41:50 +01:00
|
|
|
size := int64(-1)
|
|
|
|
for _, rr := range rrs {
|
|
|
|
if size == -1 {
|
|
|
|
size = rr.Size()
|
|
|
|
} else {
|
|
|
|
if size != rr.Size() {
|
2018-07-03 09:35:01 +01:00
|
|
|
return nil, Error.New(
|
|
|
|
"decode failure: range reader sizes don't all match")
|
2018-04-11 14:41:50 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if size == -1 {
|
2018-09-14 15:10:43 +01:00
|
|
|
return ranger.ByteRanger(nil), nil
|
2018-04-11 14:41:50 +01:00
|
|
|
}
|
|
|
|
if size%int64(es.EncodedBlockSize()) != 0 {
|
2018-08-06 15:24:30 +01:00
|
|
|
return nil, Error.New("invalid erasure decoder and range reader combo. "+
|
|
|
|
"range reader size (%d) must be a multiple of erasure encoder block size (%d)",
|
|
|
|
size, es.EncodedBlockSize())
|
2018-04-11 14:41:50 +01:00
|
|
|
}
|
|
|
|
return &decodedRanger{
|
2018-05-30 16:27:09 +01:00
|
|
|
es: es,
|
|
|
|
rrs: rrs,
|
|
|
|
inSize: size,
|
|
|
|
mbm: mbm,
|
2018-04-11 14:41:50 +01:00
|
|
|
}, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
func (dr *decodedRanger) Size() int64 {
|
|
|
|
blocks := dr.inSize / int64(dr.es.EncodedBlockSize())
|
|
|
|
return blocks * int64(dr.es.DecodedBlockSize())
|
|
|
|
}
|
|
|
|
|
2018-06-19 16:59:09 +01:00
|
|
|
func (dr *decodedRanger) Range(ctx context.Context, offset, length int64) (io.ReadCloser, error) {
|
2018-04-11 14:41:50 +01:00
|
|
|
// offset and length might not be block-aligned. figure out which
|
|
|
|
// blocks contain this request
|
|
|
|
firstBlock, blockCount := calcEncompassingBlocks(
|
|
|
|
offset, length, dr.es.DecodedBlockSize())
|
|
|
|
// go ask for ranges for all those block boundaries
|
2018-04-26 13:51:49 +01:00
|
|
|
// do it parallel to save from network latency
|
2018-04-17 14:39:14 +01:00
|
|
|
readers := make(map[int]io.ReadCloser, len(dr.rrs))
|
2018-04-26 18:51:28 +01:00
|
|
|
type indexReadCloser struct {
|
2018-06-18 17:46:49 +01:00
|
|
|
i int
|
|
|
|
r io.ReadCloser
|
|
|
|
err error
|
2018-04-26 18:51:28 +01:00
|
|
|
}
|
2018-04-26 13:51:49 +01:00
|
|
|
result := make(chan indexReadCloser, len(dr.rrs))
|
2018-04-11 14:41:50 +01:00
|
|
|
for i, rr := range dr.rrs {
|
2018-04-26 13:51:49 +01:00
|
|
|
go func(i int, rr ranger.Ranger) {
|
2018-06-19 16:59:09 +01:00
|
|
|
r, err := rr.Range(ctx,
|
2018-04-26 13:51:49 +01:00
|
|
|
firstBlock*int64(dr.es.EncodedBlockSize()),
|
|
|
|
blockCount*int64(dr.es.EncodedBlockSize()))
|
2018-06-18 17:46:49 +01:00
|
|
|
result <- indexReadCloser{i: i, r: r, err: err}
|
2018-04-26 13:51:49 +01:00
|
|
|
}(i, rr)
|
|
|
|
}
|
|
|
|
// wait for all goroutines to finish and save result in readers map
|
|
|
|
for range dr.rrs {
|
|
|
|
res := <-result
|
2018-06-18 17:46:49 +01:00
|
|
|
if res.err != nil {
|
|
|
|
readers[res.i] = readcloser.FatalReadCloser(res.err)
|
|
|
|
} else {
|
|
|
|
readers[res.i] = res.r
|
|
|
|
}
|
2018-04-11 14:41:50 +01:00
|
|
|
}
|
|
|
|
// decode from all those ranges
|
2018-08-06 15:24:30 +01:00
|
|
|
r := DecodeReaders(ctx, readers, dr.es, blockCount*int64(dr.es.DecodedBlockSize()), dr.mbm)
|
2018-04-11 14:41:50 +01:00
|
|
|
// offset might start a few bytes in, potentially discard the initial bytes
|
|
|
|
_, err := io.CopyN(ioutil.Discard, r,
|
|
|
|
offset-firstBlock*int64(dr.es.DecodedBlockSize()))
|
|
|
|
if err != nil {
|
2018-06-18 17:46:49 +01:00
|
|
|
return nil, Error.Wrap(err)
|
2018-04-11 14:41:50 +01:00
|
|
|
}
|
|
|
|
// length might not have included all of the blocks, limit what we return
|
2018-06-18 17:46:49 +01:00
|
|
|
return readcloser.LimitReadCloser(r, length), nil
|
2018-04-11 14:41:50 +01:00
|
|
|
}
|