-
Notifications
You must be signed in to change notification settings - Fork 10
/
blocklist_test.go
257 lines (217 loc) · 6.22 KB
/
blocklist_test.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
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
package dynsampler
import (
"fmt"
"math/rand"
"sync"
"testing"
"time"
"sync/atomic"
"github.com/stretchr/testify/assert"
)
// AtomicRecord is the naive implementation of blocklist that serves as the reference implementation
// for our tests.
// This datastructure is designed to be completely linearizable, as it has a single lock that it
// acquires with every operation.
type pair struct {
index int64
count int
}
type AtomicRecord struct {
records map[string][]pair
maxKeys int
lock sync.Mutex
}
func NewAtomicRecord(maxKeys int) *AtomicRecord {
return &AtomicRecord{
records: make(map[string][]pair),
maxKeys: maxKeys,
}
}
func (r *AtomicRecord) IncrementKey(key string, keyIndex int64, count int) error {
r.lock.Lock()
defer r.lock.Unlock()
if len(r.records) >= r.maxKeys {
return MaxSizeError{key: key}
}
r.records[key] = append([]pair{{index: keyIndex, count: count}}, r.records[key]...)
return nil
}
func (r *AtomicRecord) AggregateCounts(
currentIndex int64,
lookbackIndex int64,
) (aggregateCounts map[string]int) {
r.lock.Lock()
defer r.lock.Unlock()
startIndex := currentIndex - 1
finishIndex := startIndex - lookbackIndex
aggregateCounts = make(map[string]int)
for key, record := range r.records {
// Aggregate.
lastIndex := -1
for i, r := range record {
if r.index <= startIndex && r.index > finishIndex {
aggregateCounts[key] += r.count
}
if lastIndex == -1 && r.index <= finishIndex {
lastIndex = i
}
}
if lastIndex == -1 {
continue
} else if lastIndex == 0 {
delete(r.records, key)
continue
}
r.records[key] = record[0:lastIndex]
}
return aggregateCounts
}
func getSeededRandom() (*rand.Rand, int64) {
seed := time.Now().UnixNano()
s1 := rand.NewSource(seed)
return rand.New(s1), seed
}
// Basic sanity test.
func TestSanity(t *testing.T) {
blockList := NewUnboundedBlockList()
atomicRecord := NewAtomicRecord(10)
testKey := "test_key"
currentIndex := int64(0)
for i := 0; i < 10; i++ {
blockList.IncrementKey(testKey, currentIndex, 1)
atomicRecord.IncrementKey(testKey, currentIndex, 1)
currentIndex += 1
}
assert.Equal(t, atomicRecord.AggregateCounts(1, 5), blockList.AggregateCounts(1, 5))
assert.Equal(t, atomicRecord.AggregateCounts(0, 2), blockList.AggregateCounts(0, 2))
assert.Equal(t, atomicRecord.AggregateCounts(6, 5), blockList.AggregateCounts(6, 5))
}
func TestBounded(t *testing.T) {
blockList := NewBoundedBlockList(10)
atomicRecord := NewAtomicRecord(10)
currentIndex := int64(0)
// Test basic dropping.
for i := 0; i < 15; i++ {
testKey := fmt.Sprintf("test_%d", i)
actualErr := blockList.IncrementKey(testKey, currentIndex, 1)
expectedErr := atomicRecord.IncrementKey(testKey, currentIndex, 1)
assert.Equal(t, expectedErr, actualErr)
}
// Test expire.
currentIndex = 10
assert.Equal(t, atomicRecord.AggregateCounts(currentIndex, 5),
blockList.AggregateCounts(currentIndex, 5))
// Consistent single insert per count.
for i := 0; i < 15; i++ {
testKey := fmt.Sprintf("test_%d", i)
actualErr := blockList.IncrementKey(testKey, currentIndex, 1)
expectedErr := atomicRecord.IncrementKey(testKey, currentIndex, 1)
assert.Equal(t, expectedErr, actualErr)
assert.Equal(t, atomicRecord.AggregateCounts(currentIndex, 10),
blockList.AggregateCounts(currentIndex, 10))
currentIndex += 1
}
// Random insert number of each key.
random, _ := getSeededRandom()
for i := 0; i < 30; i++ {
for j := 0; j < 10; j++ {
keySuffix := random.Intn(20)
testKey := fmt.Sprintf("test_%d", keySuffix)
actualErr := blockList.IncrementKey(testKey, currentIndex, 1)
expectedErr := atomicRecord.IncrementKey(testKey, currentIndex, 1)
assert.Equal(t, expectedErr, actualErr)
}
assert.Equal(t, atomicRecord.AggregateCounts(currentIndex, 10),
blockList.AggregateCounts(currentIndex, 10))
currentIndex += 1
}
}
// Simulate a real world use case and compare it against our reference implementation.
func compareConcurrency(t *testing.T, reference BlockList, actual BlockList) {
globalIndex := int64(0)
testKey := "test_key"
done := make(chan bool)
iterations := 50
lock := sync.Mutex{}
random, _ := getSeededRandom()
// Index Ticker
indexTicker := time.NewTicker(50 * time.Millisecond)
go func() {
for {
select {
case <-done:
return
case <-indexTicker.C:
atomic.AddInt64(&globalIndex, 1)
}
}
}()
// Update and aggregation ticker
updateTicker := time.NewTicker(55 * time.Millisecond)
go func() {
for {
select {
case <-done:
return
case <-updateTicker.C:
lock.Lock()
currentIndex := atomic.LoadInt64(&globalIndex)
referenceAggregate := reference.AggregateCounts(currentIndex, 10)
actualAggregate := actual.AggregateCounts(currentIndex, 10)
assert.Equal(t, referenceAggregate, actualAggregate)
lock.Unlock()
}
}
}()
wg := sync.WaitGroup{}
for i := 0; i < 50; i++ {
wg.Add(1)
go func() {
defer wg.Done()
for j := 0; j < iterations; j++ {
// These need to be performed atomically.
lock.Lock()
currentIndex := atomic.LoadInt64(&globalIndex)
referenceErr := reference.IncrementKey(testKey, currentIndex, 1)
actualErr := actual.IncrementKey(testKey, currentIndex, 1)
assert.Equal(t, referenceErr, actualErr)
sleepTime := time.Duration(random.Intn(100)) * time.Millisecond
lock.Unlock()
time.Sleep(sleepTime)
}
}()
}
wg.Wait()
done <- true
}
func concurrentUpdates(t *testing.T, blockList BlockList) {
start := make(chan bool)
globalIndex := int64(0)
// Concurrent inserts.
go func() {
<-start
for i := 0; i < 1000; i++ {
for j := 0; j < 15; j++ {
currentIndex := atomic.LoadInt64(&globalIndex)
testKey := fmt.Sprintf("test_%d", j)
blockList.IncrementKey(testKey, currentIndex, 1)
}
}
}()
// Concurrent aggregations.
go func() {
<-start
for i := 0; i < 1000; i++ {
currentIndex := atomic.LoadInt64(&globalIndex)
blockList.AggregateCounts(currentIndex, 10)
atomic.AddInt64(&globalIndex, 1)
}
}()
close(start)
}
func TestAllConcurrency(t *testing.T) {
compareConcurrency(t, NewUnboundedBlockList(), NewAtomicRecord(10))
compareConcurrency(t, NewBoundedBlockList(10), NewAtomicRecord(10))
concurrentUpdates(t, NewUnboundedBlockList())
concurrentUpdates(t, NewBoundedBlockList(10))
}