forked from grafana-cold-storage/metrictank
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathreorder_buffer_test.go
More file actions
336 lines (309 loc) · 8.04 KB
/
Copy pathreorder_buffer_test.go
File metadata and controls
336 lines (309 loc) · 8.04 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
package mdata
import (
"reflect"
"testing"
"gopkg.in/raintank/schema.v1"
)
func testAddAndGet(t *testing.T, reorderWindow uint32, testData, expectedData []schema.Point, expectAddFail, expectReordered uint32) []schema.Point {
var flushed []schema.Point
b := NewReorderBuffer(reorderWindow, 1)
metricsTooOld.SetUint32(0)
metricsReordered.SetUint32(0)
for _, point := range testData {
addRes := b.Add(point.Ts, point.Val)
flushed = append(flushed, addRes...)
}
if expectAddFail != metricsTooOld.Peek() {
t.Fatalf("Expected %d failures, but had %d", expectAddFail, metricsTooOld.Peek())
}
if metricsReordered.Peek() != expectReordered {
t.Fatalf("Expected %d metrics to get reordered, but had %d", expectReordered, metricsReordered.Peek())
}
returned := b.Get()
if !reflect.DeepEqual(expectedData, returned) {
t.Fatalf("Returned data does not match expected data\n%+v\n %+v", testData, expectedData)
}
return flushed
}
// mixes up a sorted slice, but only within a certain range
// it simply reverses the order of bunches of a fixed size that's defined by the unsortBy parameter
// for example if unsortBy is 3, then this:
// [0,1,2,3,4,5,6,7,8,9]
// will be turned into this:
// [2,1,0,5,4,3,8,7,6,9]
func unsort(data []schema.Point, unsortBy int) []schema.Point {
out := make([]schema.Point, len(data))
i := 0
for ; i < len(data)-unsortBy; i = i + unsortBy {
for j := 0; j < unsortBy; j++ {
out[i+j] = data[i+unsortBy-j-1]
}
}
for ; i < len(data); i++ {
out[i] = data[i]
}
return out
}
func TestReorderBufferUnsort(t *testing.T) {
testData := []schema.Point{
{Ts: 0, Val: 0},
{Ts: 1, Val: 100},
{Ts: 2, Val: 200},
{Ts: 3, Val: 300},
{Ts: 4, Val: 400},
{Ts: 5, Val: 500},
{Ts: 6, Val: 600},
{Ts: 7, Val: 700},
{Ts: 8, Val: 800},
{Ts: 9, Val: 900},
}
expectedData := []schema.Point{
{Ts: 2, Val: 200},
{Ts: 1, Val: 100},
{Ts: 0, Val: 0},
{Ts: 5, Val: 500},
{Ts: 4, Val: 400},
{Ts: 3, Val: 300},
{Ts: 8, Val: 800},
{Ts: 7, Val: 700},
{Ts: 6, Val: 600},
{Ts: 9, Val: 900},
}
unsortedData := unsort(testData, 3)
for i := 0; i < len(expectedData); i++ {
if unsortedData[i] != expectedData[i] {
t.Fatalf("unsort function returned unexpected data %+v", unsortedData)
}
}
}
func TestReorderBufferAddAndGetInOrder(t *testing.T) {
testData := []schema.Point{
{Ts: 1001, Val: 100},
{Ts: 1002, Val: 200},
{Ts: 1003, Val: 300},
}
expectedData := []schema.Point{
{Ts: 1001, Val: 100},
{Ts: 1002, Val: 200},
{Ts: 1003, Val: 300},
}
testAddAndGet(t, 600, testData, expectedData, 0, 0)
}
func TestReorderBufferAddAndGetInReverseOrderOutOfWindow(t *testing.T) {
testData := []schema.Point{
{Ts: 1003, Val: 300},
{Ts: 1002, Val: 200},
{Ts: 1001, Val: 100},
}
expectedData := []schema.Point{
{Ts: 1003, Val: 300},
}
testAddAndGet(t, 1, testData, expectedData, 2, 0)
}
func TestReorderBufferAddAndGetOutOfOrderInsideWindow(t *testing.T) {
testData := []schema.Point{
{Ts: 1001, Val: 100},
{Ts: 1002, Val: 200},
{Ts: 1004, Val: 400},
{Ts: 1003, Val: 300},
{Ts: 1005, Val: 500},
{Ts: 1006, Val: 600},
{Ts: 1008, Val: 800},
{Ts: 1007, Val: 700},
{Ts: 1009, Val: 900},
}
expectedData := []schema.Point{
{Ts: 1001, Val: 100},
{Ts: 1002, Val: 200},
{Ts: 1003, Val: 300},
{Ts: 1004, Val: 400},
{Ts: 1005, Val: 500},
{Ts: 1006, Val: 600},
{Ts: 1007, Val: 700},
{Ts: 1008, Val: 800},
{Ts: 1009, Val: 900},
}
testAddAndGet(t, 600, testData, expectedData, 0, 2)
}
func TestReorderBufferAddAndGetOutOfOrderInsideWindowAsFirstPoint(t *testing.T) {
testData := []schema.Point{
{Ts: 1002, Val: 200},
{Ts: 1004, Val: 400},
{Ts: 1003, Val: 300},
{Ts: 1005, Val: 500},
{Ts: 1001, Val: 100},
{Ts: 1006, Val: 600},
{Ts: 1008, Val: 800},
{Ts: 1007, Val: 700},
{Ts: 1009, Val: 900},
}
expectedData := []schema.Point{
{Ts: 1001, Val: 100},
{Ts: 1002, Val: 200},
{Ts: 1003, Val: 300},
{Ts: 1004, Val: 400},
{Ts: 1005, Val: 500},
{Ts: 1006, Val: 600},
{Ts: 1007, Val: 700},
{Ts: 1008, Val: 800},
{Ts: 1009, Val: 900},
}
testAddAndGet(t, 600, testData, expectedData, 0, 3)
}
func TestReorderBufferOmitFlushIfNotEnoughData(t *testing.T) {
b := NewReorderBuffer(9, 1)
for i := uint32(1); i < 10; i++ {
flushed := b.Add(i, float64(i*100))
if len(flushed) > 0 {
t.Fatalf("Expected no data to get flushed out")
}
}
}
func TestReorderBufferAddAndGetOutOfOrderOutOfWindow(t *testing.T) {
testData := []schema.Point{
{Ts: 1001, Val: 100},
{Ts: 1004, Val: 400},
{Ts: 1003, Val: 300},
{Ts: 1005, Val: 500},
{Ts: 1006, Val: 600},
{Ts: 1008, Val: 800},
{Ts: 1007, Val: 700},
{Ts: 1009, Val: 900},
{Ts: 1002, Val: 200},
}
expectedData := []schema.Point{
{Ts: 1005, Val: 500},
{Ts: 1006, Val: 600},
{Ts: 1007, Val: 700},
{Ts: 1008, Val: 800},
{Ts: 1009, Val: 900},
}
// point 2 should be missing because out of reorder window
expectedFlushedData := []schema.Point{
{Ts: 1001, Val: 100},
{Ts: 1003, Val: 300},
{Ts: 1004, Val: 400},
}
flushedData := testAddAndGet(t, 5, testData, expectedData, 1, 2)
if !reflect.DeepEqual(flushedData, expectedFlushedData) {
t.Fatalf("Flushed data does not match expected flushed data:\n%+v\n%+v", flushedData, expectedFlushedData)
}
}
func TestReorderBufferFlushSortedData(t *testing.T) {
var results []schema.Point
buf := NewReorderBuffer(600, 1)
metricsTooOld.SetUint32(0)
for i := 1100; i < 2100; i++ {
flushed := buf.Add(uint32(i), float64(i))
if metricsTooOld.Peek() != 0 {
t.Fatalf("Adding failed")
}
results = append(results, flushed...)
}
for i := 0; i < 400; i++ {
if results[i].Ts != uint32(i+1100) || results[i].Val != float64(i+1100) {
t.Fatalf("Unexpected results %+v", results)
}
}
}
func TestReorderBufferFlushUnsortedData1(t *testing.T) {
var results []schema.Point
buf := NewReorderBuffer(3, 1)
data := []schema.Point{
{10, 10},
{11, 11},
{9, 9},
{12, 12},
{13, 13},
{20, 20},
{11, 11},
{19, 19},
}
failedCount := 0
metricsTooOld.SetUint32(0)
for _, p := range data {
flushed := buf.Add(p.Ts, p.Val)
if metricsTooOld.Peek() != 0 {
failedCount++
metricsTooOld.SetUint32(0)
} else {
results = append(results, flushed...)
}
}
expecting := []schema.Point{
{9, 9},
{10, 10},
{11, 11},
{12, 12},
{13, 13},
}
for i := range expecting {
if expecting[i] != results[i] {
t.Fatalf("Unexpected results %+v, %+v", expecting, results)
}
}
if failedCount != 1 {
t.Fatalf("expecting failed count to be 1, not %d", failedCount)
}
}
func TestReorderBufferFlushUnsortedData2(t *testing.T) {
var results []schema.Point
buf := NewReorderBuffer(600, 1)
data := make([]schema.Point, 1000)
for i := 0; i < 1000; i++ {
data[i] = schema.Point{Ts: uint32(i + 1000), Val: float64(i + 1000)}
}
unsortedData := unsort(data, 10)
for i := 0; i < len(data); i++ {
flushed := buf.Add(unsortedData[i].Ts, unsortedData[i].Val)
results = append(results, flushed...)
}
for i := 0; i < 400; i++ {
if results[i].Ts != uint32(i+1000) || results[i].Val != float64(i+1000) {
t.Fatalf("Unexpected results %+v", results)
}
}
}
func BenchmarkAddInOrder(b *testing.B) {
data := make([]schema.Point, b.N)
buf := NewReorderBuffer(uint32(b.N), 1)
b.ResetTimer()
for i := 0; i < b.N; i++ {
buf.Add(data[i].Ts, data[i].Val)
}
}
func BenchmarkAddOutOfOrder(b *testing.B) {
data := make([]schema.Point, b.N)
unsortedData := unsort(data, 10)
buf := NewReorderBuffer(uint32(b.N), 1)
b.ResetTimer()
for i := 0; i < b.N; i++ {
buf.Add(unsortedData[i].Ts, unsortedData[i].Val)
}
}
func benchmarkAddAndFlushX(b *testing.B, datapoints, reorderWindow uint32) {
buf := NewReorderBuffer(
reorderWindow,
1,
)
ts := uint32(1)
for ; ts <= datapoints; ts++ {
buf.Add(ts, float64(ts*100))
}
b.ResetTimer()
for run := 0; run < b.N; run++ {
ts := uint32(1)
for ; ts <= datapoints; ts++ {
buf.Add(ts, float64(ts*100))
}
}
}
func BenchmarkAddAndFlush10000(b *testing.B) {
benchmarkAddAndFlushX(b, 10000, 1000)
}
func BenchmarkAddAndFlush1000(b *testing.B) {
benchmarkAddAndFlushX(b, 1000, 100)
}
func BenchmarkAddAndFlush100(b *testing.B) {
benchmarkAddAndFlushX(b, 100, 10)
}