-
Notifications
You must be signed in to change notification settings - Fork 0
/
erasure.go
207 lines (189 loc) · 4.27 KB
/
erasure.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
// Package erasure provides a common API for various erasure codes. It adds
// optional checksumming.
package erasure
import (
"bytes"
"crypto/sha1"
"encoding/gob"
"fmt"
"io"
"sort"
"sync"
)
// Code is a simple abstraction on top of a specific erasure code
// implementation.
type Code interface {
// Encode accepts a byte slice and returns a slice of sharded data.
Encode([]byte) ([][]byte, error)
// Decode accepts a slice of (possibly nil) shards and returns the original
// byte slice.
Decode([][]byte) ([]byte, error)
// Shards returns the total number of data + parity shards employed by this
// erasure code.
Shards() int
}
// Writer implements the io.Writer interface.
type Writer struct {
// ChunkSize is the number of bytes that will be used for each parity
// calculation. If this is less than 1, 1e7 (~10MB) is used.
ChunkSize int
c Code
gen int
rs []io.Reader
ws []*io.PipeWriter
encs []*gob.Encoder
buf bytes.Buffer
}
type frame struct {
Generation int
Member int
SHA1 [20]byte
Data []byte
Size int
}
type byMember []frame
func (b byMember) Len() int { return len(b) }
func (b byMember) Swap(i, j int) { b[i], b[j] = b[j], b[i] }
func (b byMember) Less(i, j int) bool { return b[i].Member < b[j].Member }
// NewWriter creates a Writer implementing the given erasure code.
func NewWriter(c Code) *Writer {
w := &Writer{
c: c,
}
w.rs = make([]io.Reader, c.Shards())
w.ws = make([]*io.PipeWriter, c.Shards())
w.encs = make([]*gob.Encoder, c.Shards())
for i := 0; i < c.Shards(); i++ {
w.rs[i], w.ws[i] = io.Pipe()
w.encs[i] = gob.NewEncoder(w.ws[i])
}
return w
}
// Readers returns Code.Shards() readers. Each reader corresponds to one shard
// from the erasure code. Readers must be read concurrently with writes.
func (w *Writer) Readers() []io.Reader {
return w.rs
}
func (w *Writer) send() error {
parts, err := w.c.Encode(w.buf.Bytes())
if err != nil {
return err
}
for i := range parts {
if err := w.encs[i].Encode(frame{
SHA1: sha1.Sum(parts[i]),
Data: parts[i],
Generation: w.gen,
Member: i,
Size: len(w.buf.Bytes()),
}); err != nil {
return err
}
}
w.gen++
w.buf.Reset()
return nil
}
func (w *Writer) Close() error {
err := w.send()
for i := range w.ws {
w.ws[i].CloseWithError(err)
}
return err
}
func (w *Writer) Write(p []byte) (int, error) {
if w.ChunkSize <= 0 {
w.ChunkSize = 1e7
}
r := w.ChunkSize - w.buf.Len()
var n int
if r < len(p) {
n, _ = w.buf.Write(p[:r])
p = p[r:]
if err := w.send(); err != nil {
return n, err
}
}
k, _ := w.buf.Write(p)
n += k
return n, nil
}
// Reader reconstructs a data stream.
type Reader struct {
c Code
decs []*gob.Decoder
gen int
buf bytes.Buffer
}
// NewReader creates a new reader. The Code passed should be identical to the
// Code that created the shards, and each reader should point to one of those
// shards. Readers can be given in any order.
func NewReader(c Code, readers ...io.Reader) *Reader {
var ds []*gob.Decoder
for _, r := range readers {
ds = append(ds, gob.NewDecoder(r))
}
return &Reader{
c: c,
decs: ds,
}
}
func (r *Reader) pull() error {
frames := make([]frame, len(r.decs))
wg := &sync.WaitGroup{}
for i := range r.decs {
wg.Add(1)
go func(i, gen int) {
// TODO: return errors. with channels I guess. ugh.
defer wg.Done()
var f frame
if err := r.decs[i].Decode(&f); err != nil {
if err == io.EOF {
return
}
fmt.Println(err)
return
}
// TODO: allow sources to get out of sync
if f.Generation != gen {
fmt.Println(fmt.Errorf("generation error: %d != %d", f.Generation, r.gen))
return
}
frames[i] = f
}(i, r.gen)
}
wg.Wait()
r.gen++
sort.Sort(byMember(frames))
bs := make([][]byte, r.c.Shards())
var size int
Frames:
for _, f := range frames {
sh := sha1.Sum(f.Data)
for i := range sh {
if sh[i] != f.SHA1[i] {
continue Frames
}
}
bs[f.Member] = f.Data
size = f.Size
}
if size == 0 {
return nil
}
data, err := r.c.Decode(bs)
if err != nil {
return err
}
r.buf.Write(data[:size])
return nil
}
func (r *Reader) Read(p []byte) (int, error) {
if r.buf.Len() == 0 {
r.buf.Reset()
if err := r.pull(); err != nil {
return 0, err
}
}
return r.buf.Read(p)
}