This repository has been archived by the owner on Sep 21, 2023. It is now read-only.
/
job-queue_test.go
327 lines (252 loc) · 5.74 KB
/
job-queue_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
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
package workqueue
import (
"sync"
"testing"
. "github.com/onsi/gomega"
set "gopkg.in/fatih/set.v0"
)
func TestJobQueueSimpleUseCase(t *testing.T) {
RegisterTestingT(t)
q := newJobListQueue()
Ω(q).ShouldNot(BeNil())
// [1]
q.Push(1)
j, ok := q.Top()
Ω(ok).Should(BeTrue())
Ω(j).Should(Equal(1))
// [1,2,3]
q.Push(2)
q.Push(3)
j, ok = q.Top()
Ω(ok).Should(BeTrue())
Ω(j).Should(Equal(1))
// [2,3]
j, ok = q.Pop()
Ω(ok).Should(BeTrue())
Ω(j).Should(Equal(1))
j, ok = q.Top()
Ω(ok).Should(BeTrue())
Ω(j).Should(Equal(2))
}
func TestJobQueueIsEmpty(t *testing.T) {
RegisterTestingT(t)
q := newJobListQueue()
Ω(q).ShouldNot(BeNil())
j, ok := q.Top()
Ω(ok).Should(BeFalse())
Ω(j).Should(BeNil())
j, ok = q.Pop()
Ω(ok).Should(BeFalse())
Ω(j).Should(BeNil())
}
func TestJobQueueEmpty(t *testing.T) {
RegisterTestingT(t)
q := newJobListQueue()
Ω(q).ShouldNot(BeNil())
Ω(q.Empty()).Should(BeTrue())
q.Push(1)
Ω(q.Empty()).Should(BeFalse())
_, _ = q.Top()
Ω(q.Empty()).Should(BeFalse())
_, _ = q.Pop()
Ω(q.Empty()).Should(BeTrue())
}
func TestJobQueueWaitSyncPath(t *testing.T) {
RegisterTestingT(t)
q := newJobListQueue()
Ω(q).ShouldNot(BeNil())
q.Push(1)
j, ok := q.WaitForJob()
Ω(j).Should(Equal(1))
Ω(ok).Should(BeTrue())
}
func TestJobQueueWaitAsyncPath(t *testing.T) {
RegisterTestingT(t)
q := newJobListQueue()
Ω(q).ShouldNot(BeNil())
wg := sync.WaitGroup{}
wg.Add(3)
go func() {
j1, ok := q.WaitForJob()
Ω(j1).Should(Equal(1))
Ω(ok).Should(BeTrue())
wg.Done()
j2, ok := q.WaitForJob()
Ω(j2).Should(Equal(2))
Ω(ok).Should(BeTrue())
wg.Done()
j3, ok := q.WaitForJob()
Ω(j3).Should(Equal(3))
Ω(ok).Should(BeTrue())
wg.Done()
}()
q.Push(1)
q.Push(2)
q.Push(3)
wg.Wait()
}
func TestJobQueueAbortWaiters(t *testing.T) {
RegisterTestingT(t)
q := newJobListQueue()
Ω(q).ShouldNot(BeNil())
waiterPending := sync.WaitGroup{}
waiterFinished := sync.WaitGroup{}
waiter := func() {
waiterPending.Done()
defer waiterFinished.Done()
j, ok := q.WaitForJob()
Ω(j).Should(BeNil())
Ω(ok).Should(BeFalse())
}
waiterPending.Add(3)
waiterFinished.Add(3)
go waiter()
go waiter()
go waiter()
waiterPending.Wait()
q.AbortWaiters(true)
q.AbortWaiters(false)
waiterFinished.Wait() // Make sure Gomega tests are done
waiterPending.Add(2)
waiterFinished.Add(2)
go waiter()
go waiter()
waiterPending.Wait()
q.AbortWaiters(true)
q.AbortWaiters(false)
waiterFinished.Wait() // Make sure Gomega tests are done
waiterPending.Add(1)
waiterFinished.Add(1)
go waiter()
waiterPending.Wait()
q.AbortWaiters(true)
q.AbortWaiters(false)
waiterFinished.Wait() // Make sure Gomega tests are done
waiterPending.Wait()
q.AbortWaiters(true)
waiterFinished.Wait() // Make sure Gomega tests are done
// The abortWaiters flag is still enabled
waiterPending.Add(1)
waiterFinished.Add(1)
go waiter()
waiterPending.Wait()
q.AbortWaiters(false)
waiterFinished.Wait() // Make sure Gomega tests are done
}
func TestJobQueuePushWaitStress(t *testing.T) {
RegisterTestingT(t)
if testing.Short() {
t.Skip("skipping test in short mode.")
}
pushed := set.New()
popped := set.New()
q := newJobListQueue()
Ω(q).ShouldNot(BeNil())
wg := sync.WaitGroup{}
N := 50 * 1000
wg.Add(N)
for i := 0; i < N; i++ {
pusher, item := i%2 == 0, i/2
if pusher {
go func(item int) {
defer wg.Done()
pushed.Add(item)
q.Push(item)
}(item)
} else {
go func() {
defer wg.Done()
item, ok := q.WaitForJob()
Ω(ok).ShouldNot(BeFalse())
popped.Add(item)
}()
}
}
wg.Wait()
unpopped := set.Difference(pushed, popped)
Ω(set.IntSlice(unpopped)).Should(BeEmpty())
unpushed := set.Difference(popped, pushed)
Ω(set.IntSlice(unpushed)).Should(BeEmpty())
Ω(set.IntSlice(pushed)).Should(HaveLen(N / 2))
Ω(set.IntSlice(popped)).Should(HaveLen(N / 2))
}
func BenchmarkJobQueuePush1(b *testing.B) {
benchJobQueuePush(b, 1)
}
func BenchmarkJobQueuePush2(b *testing.B) {
benchJobQueuePush(b, 2)
}
func BenchmarkJobQueuePush4(b *testing.B) {
benchJobQueuePush(b, 4)
}
func BenchmarkJobQueuePush8(b *testing.B) {
benchJobQueuePush(b, 8)
}
func BenchmarkJobQueuePush16(b *testing.B) {
benchJobQueuePush(b, 16)
}
func BenchmarkJobQueuePush32(b *testing.B) {
benchJobQueuePush(b, 32)
}
func BenchmarkJobQueuePush64(b *testing.B) {
benchJobQueuePush(b, 64)
}
func benchJobQueuePush(b *testing.B, nroutines int) {
q := newJobListQueue()
wg := sync.WaitGroup{}
wg.Add(nroutines)
for routine := 0; routine < nroutines; routine++ {
go func() {
for i := 0; i < b.N; i++ {
q.Push(i)
}
wg.Done()
}()
}
wg.Wait()
}
func BenchmarkJobQueuePushWait1(b *testing.B) {
// The result should be similar to BenchmarkJobQueuePush1
benchJobQueuePushWait(b, 1)
}
func BenchmarkJobQueuePushWait2(b *testing.B) {
// The result should be similar to BenchmarkJobQueuePushWait1
benchJobQueuePushWait(b, 2)
}
func BenchmarkJobQueuePushWait4(b *testing.B) {
benchJobQueuePushWait(b, 4)
}
func BenchmarkJobQueuePushWait8(b *testing.B) {
benchJobQueuePushWait(b, 8)
}
func BenchmarkJobQueuePushWait16(b *testing.B) {
benchJobQueuePushWait(b, 16)
}
func BenchmarkJobQueuePushWait32(b *testing.B) {
benchJobQueuePushWait(b, 32)
}
func BenchmarkJobQueuePushWait64(b *testing.B) {
benchJobQueuePushWait(b, 64)
}
func BenchmarkJobQueuePushWait128(b *testing.B) {
benchJobQueuePushWait(b, 128)
}
func benchJobQueuePushWait(b *testing.B, nroutines int) {
q := newJobListQueue()
wg := sync.WaitGroup{}
wg.Add(nroutines)
for routine := 0; routine < nroutines; routine++ {
pusher := routine%3 < 2
go func(pusher bool) {
for i := 0; i < b.N; i++ {
if pusher {
q.Push(i)
} else {
q.WaitForJob()
}
}
wg.Done()
}(pusher)
}
wg.Wait()
}