forked from ulikunitz/xz
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathparallelreader_test.go
More file actions
351 lines (323 loc) · 10.2 KB
/
Copy pathparallelreader_test.go
File metadata and controls
351 lines (323 loc) · 10.2 KB
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
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
// Copyright 2014-2022 Ulrich Kunitz. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
package xz
import (
"bytes"
"errors"
"io"
"math/rand"
"os"
"runtime"
"testing"
"time"
)
// parallelTestData generates compressible data with literals, matches
// and runs.
func parallelTestData(n int) []byte {
rng := rand.New(rand.NewSource(7))
words := []string{"the ", "quick ", "brown ", "fox ", "jumps ",
"over ", "lazy ", "dog ", "0000000000000000", "\n"}
var buf bytes.Buffer
for buf.Len() < n {
buf.WriteString(words[rng.Intn(len(words))])
}
return buf.Bytes()[:n]
}
// compressMultiBlock compresses data into an xz stream with the given
// block size.
func compressMultiBlock(tb testing.TB, data []byte, blockSize int64) []byte {
tb.Helper()
var buf bytes.Buffer
w, err := WriterConfig{BlockSize: blockSize}.NewWriter(&buf)
if err != nil {
tb.Fatalf("NewWriter error %s", err)
}
if _, err = w.Write(data); err != nil {
tb.Fatalf("Write error %s", err)
}
if err = w.Close(); err != nil {
tb.Fatalf("Close error %s", err)
}
return buf.Bytes()
}
func testParallelRead(t *testing.T, xz []byte, want []byte, workers int) {
t.Helper()
c := ParallelReaderConfig{Workers: workers}
r, err := c.NewParallelReader(bytes.NewReader(xz), int64(len(xz)))
if err != nil {
t.Fatalf("NewParallelReader error %s", err)
}
if r.Size() != int64(len(want)) {
t.Fatalf("Size() is %d; want %d", r.Size(), len(want))
}
got, err := io.ReadAll(r)
if err != nil {
t.Fatalf("ReadAll error %s", err)
}
if !bytes.Equal(got, want) {
t.Fatalf("decoded data differs from original")
}
}
func TestParallelReaderMultiBlock(t *testing.T) {
data := parallelTestData(1 << 20)
xz := compressMultiBlock(t, data, 64<<10)
for _, workers := range []int{0, 1, 4} {
testParallelRead(t, xz, data, workers)
}
}
func TestParallelReaderSingleBlock(t *testing.T) {
data := parallelTestData(1 << 18)
xz := compressMultiBlock(t, data, 0) // default: one block
testParallelRead(t, xz, data, 4)
}
func TestParallelReaderMultiStream(t *testing.T) {
a := parallelTestData(1 << 19)
b := parallelTestData(1 << 18)
xza := compressMultiBlock(t, a, 32<<10)
xzb := compressMultiBlock(t, b, 32<<10)
// concatenated streams with stream padding in between
pad := make([]byte, 8)
file := append(append(append([]byte{}, xza...), pad...), xzb...)
testParallelRead(t, file, append(append([]byte{}, a...), b...), 3)
}
func TestParallelReaderEmpty(t *testing.T) {
xz := compressMultiBlock(t, nil, 64<<10)
testParallelRead(t, xz, nil, 2)
}
func TestParallelReaderWriteTo(t *testing.T) {
data := parallelTestData(1 << 20)
xz := compressMultiBlock(t, data, 64<<10)
r, err := NewParallelReader(bytes.NewReader(xz), int64(len(xz)))
if err != nil {
t.Fatalf("NewParallelReader error %s", err)
}
var buf bytes.Buffer
n, err := r.WriteTo(&buf)
if err != nil {
t.Fatalf("WriteTo error %s", err)
}
if n != int64(len(data)) || !bytes.Equal(buf.Bytes(), data) {
t.Fatalf("WriteTo result differs from original")
}
}
func TestParallelReaderAgainstReader(t *testing.T) {
data := parallelTestData(1 << 20)
xz := compressMultiBlock(t, data, 128<<10)
sr, err := NewReader(bytes.NewReader(xz))
if err != nil {
t.Fatalf("NewReader error %s", err)
}
want, err := io.ReadAll(sr)
if err != nil {
t.Fatalf("streaming ReadAll error %s", err)
}
testParallelRead(t, xz, want, 4)
}
func TestParallelReaderTruncated(t *testing.T) {
data := parallelTestData(1 << 20)
xz := compressMultiBlock(t, data, 64<<10)
// missing footer
if _, err := NewParallelReader(bytes.NewReader(xz[:len(xz)-4]),
int64(len(xz)-4)); err == nil {
t.Fatalf("NewParallelReader on truncated file: no error")
}
// corrupt a byte in the middle of some block
bad := append([]byte{}, xz...)
bad[len(bad)/2] ^= 0xff
r, err := NewParallelReader(bytes.NewReader(bad), int64(len(bad)))
if err != nil {
// corruption may already be detected during parsing
return
}
if _, err = io.ReadAll(r); err == nil {
t.Fatalf("ReadAll on corrupted file: no error")
}
_ = r.Close()
}
// slowReaderAt delays every read so that a decode is reliably still in flight
// when the test calls Close.
type slowReaderAt struct {
r io.ReaderAt
delay time.Duration
}
func (s slowReaderAt) ReadAt(p []byte, off int64) (int, error) {
time.Sleep(s.delay)
return s.r.ReadAt(p, off)
}
// TestParallelReaderCloseUnblocksRead covers cancelling a read in progress.
// Close is documented as the way to abandon a reader, and the natural moment
// to want that is when the input has gone slow — which is exactly when Read is
// parked waiting for a block. A cancelled dispatcher used to leave both the
// block queue and the pending result unattended, so Read waited forever.
func TestParallelReaderCloseUnblocksRead(t *testing.T) {
data := parallelTestData(1 << 20)
xz := compressMultiBlock(t, data, 16<<10)
src := slowReaderAt{r: bytes.NewReader(xz), delay: 2 * time.Millisecond}
before := runtime.NumGoroutine()
r, err := ParallelReaderConfig{Workers: 2}.NewParallelReader(src, int64(len(xz)))
if err != nil {
t.Fatalf("NewParallelReader error %s", err)
}
copyDone := make(chan error, 1)
go func() {
_, err := io.Copy(io.Discard, r)
copyDone <- err
}()
// Let the copy get properly under way before pulling the rug.
time.Sleep(50 * time.Millisecond)
if err := r.Close(); err != nil {
t.Fatalf("Close error %s", err)
}
select {
case err := <-copyDone:
if !errors.Is(err, errReaderClosed) {
t.Fatalf("io.Copy returned %v; want %v", err, errReaderClosed)
}
case <-time.After(10 * time.Second):
t.Fatal("Read did not return after Close: the reader is deadlocked")
}
// Releasing the reader is only half the job; the workers and the
// dispatcher have to wind up too, or Close just moves the leak.
deadline := time.Now().Add(5 * time.Second)
for {
n := runtime.NumGoroutine()
if n <= before+2 {
break
}
if time.Now().After(deadline) {
t.Fatalf("%d goroutines still running after Close; started from %d",
n, before)
}
time.Sleep(10 * time.Millisecond)
}
}
// TestParallelReaderCloseAfterEOFKeepsEOF checks that cancelling a reader that
// already finished does not rewrite why it finished.
func TestParallelReaderCloseAfterEOFKeepsEOF(t *testing.T) {
data := parallelTestData(1 << 16)
xz := compressMultiBlock(t, data, 8<<10)
r, err := NewParallelReader(bytes.NewReader(xz), int64(len(xz)))
if err != nil {
t.Fatalf("NewParallelReader error %s", err)
}
if _, err = io.Copy(io.Discard, r); err != nil {
t.Fatalf("io.Copy error %s", err)
}
if err = r.Close(); err != nil {
t.Fatalf("Close error %s", err)
}
if _, err = r.Read(make([]byte, 8)); !errors.Is(err, io.EOF) {
t.Fatalf("Read after EOF then Close returned %v; want io.EOF", err)
}
}
func TestParallelReaderClose(t *testing.T) {
data := parallelTestData(1 << 20)
xz := compressMultiBlock(t, data, 16<<10)
r, err := NewParallelReader(bytes.NewReader(xz), int64(len(xz)))
if err != nil {
t.Fatalf("NewParallelReader error %s", err)
}
p := make([]byte, 100)
if _, err = io.ReadFull(r, p); err != nil {
t.Fatalf("Read error %s", err)
}
if err = r.Close(); err != nil {
t.Fatalf("Close error %s", err)
}
if _, err = r.Read(p); !errors.Is(err, errReaderClosed) {
t.Fatalf("Read after Close returned %v; want %v",
err, errReaderClosed)
}
// closing an unstarted reader must not panic
r2, err := NewParallelReader(bytes.NewReader(xz), int64(len(xz)))
if err != nil {
t.Fatalf("NewParallelReader error %s", err)
}
if err = r2.Close(); err != nil {
t.Fatalf("Close error %s", err)
}
}
// TestParallelReaderAbandonedReleasesGoroutines covers a reader that is
// dropped mid-stream without Close. The dispatcher and the workers must not
// keep the abandoned reader reachable, or the cleanup that cancels them could
// never fire and they would run for the life of the process, pinned on a full
// block queue.
func TestParallelReaderAbandonedReleasesGoroutines(t *testing.T) {
data := parallelTestData(1 << 20)
xz := compressMultiBlock(t, data, 16<<10) // 64 blocks, far more than the queue holds
before := runtime.NumGoroutine()
// The reader must go out of scope with blocks still undispatched, so the
// dispatcher is parked on a full queue when the reader becomes garbage.
func() {
r, err := ParallelReaderConfig{Workers: 4}.NewParallelReader(
bytes.NewReader(xz), int64(len(xz)))
if err != nil {
t.Fatalf("NewParallelReader error %s", err)
}
p := make([]byte, 100)
if _, err = io.ReadFull(r, p); err != nil {
t.Fatalf("Read error %s", err)
}
}()
deadline := time.Now().Add(5 * time.Second)
for {
runtime.GC()
n := runtime.NumGoroutine()
if n <= before+2 {
break
}
if time.Now().After(deadline) {
t.Fatalf("%d goroutines still running after the reader was "+
"abandoned; started from %d", n, before)
}
time.Sleep(10 * time.Millisecond)
}
}
// benchmarkBlocks compresses testdata/enwik7 with the given block size and
// measures decoding it with the reader the bench function builds.
func benchmarkBlocks(b *testing.B, blockSize int64,
newReader func(xz []byte) (io.Reader, func()),
) {
b.Helper()
data, err := os.ReadFile("testdata/enwik7")
if err != nil {
b.Fatalf("os.ReadFile error %s", err)
}
xz := compressMultiBlock(b, data, blockSize)
b.SetBytes(int64(len(data)))
b.ReportAllocs()
b.ResetTimer()
for range b.N {
r, done := newReader(xz)
n, err := io.Copy(io.Discard, r)
if err != nil {
b.Fatalf("io.Copy error %s", err)
}
if n != int64(len(data)) {
b.Fatalf("decoded %d bytes; want %d", n, len(data))
}
done()
}
}
// BenchmarkReaderMultiBlock decodes a many-block file with the sequential
// reader; per-block setup cost dominates the difference to BenchmarkReader.
func BenchmarkReaderMultiBlock(b *testing.B) {
benchmarkBlocks(b, 64<<10, func(xz []byte) (io.Reader, func()) {
r, err := NewReader(bytes.NewReader(xz))
if err != nil {
b.Fatalf("NewReader error %s", err)
}
return r, func() {}
})
}
// BenchmarkParallelReader decodes a multi-block file with all workers.
func BenchmarkParallelReader(b *testing.B) {
benchmarkBlocks(b, 1<<20, func(xz []byte) (io.Reader, func()) {
r, err := NewParallelReader(bytes.NewReader(xz), int64(len(xz)))
if err != nil {
b.Fatalf("NewParallelReader error %s", err)
}
return r, func() { _ = r.Close() }
})
}