-
Notifications
You must be signed in to change notification settings - Fork 15
Expand file tree
/
Copy pathcyclic_barrier_test.go
More file actions
388 lines (321 loc) · 7.65 KB
/
Copy pathcyclic_barrier_test.go
File metadata and controls
388 lines (321 loc) · 7.65 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
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
package async
import (
"context"
"sync"
"sync/atomic"
"testing"
"time"
"github.com/reugn/async/internal/assert"
)
func TestCyclicBarrier_Basic(t *testing.T) {
t.Parallel()
barrier := NewCyclicBarrier(3)
var (
wg sync.WaitGroup
count atomic.Int32
)
for i := 0; i < 3; i++ {
wg.Add(1)
go func() {
defer wg.Done()
count.Add(1)
assert.IsNil(t, barrier.Await())
// all parties should be released together
assert.Equal(t, int32(3), count.Load())
assert.Equal(t, 3, barrier.Parties())
assert.Equal(t, 0, barrier.Waiting())
}()
}
wg.Wait()
assert.Equal(t, int32(3), count.Load())
assert.Equal(t, 3, barrier.Parties())
assert.Equal(t, 0, barrier.Waiting())
}
func TestCyclicBarrier_AwaitContext(t *testing.T) {
t.Parallel()
barrier := NewCyclicBarrier(3)
ctx, cancel := context.WithCancel(context.Background())
var wg sync.WaitGroup
for i := 0; i < 2; i++ {
wg.Add(1)
go func() {
defer wg.Done()
assert.ErrorIs(t, barrier.AwaitContext(ctx), ErrBrokenBarrier)
}()
}
// sleep to ensure the goroutine is waiting
time.Sleep(10 * time.Millisecond)
assert.Equal(t, 2, barrier.Waiting())
// cancel the context to release the goroutine
cancel()
wg.Wait()
assert.Equal(t, 0, barrier.Waiting())
}
func TestCyclicBarrier_ContextCancelRace(t *testing.T) {
t.Parallel()
barrier := NewCyclicBarrier(3)
ctx, cancel := context.WithCancel(context.Background())
var wg sync.WaitGroup
for i := 0; i < 10; i++ {
wg.Add(3)
go func() {
defer wg.Done()
// first cycle
assert.ErrorIs(t, barrier.AwaitContext(ctx), ErrBrokenBarrier)
// second cycle
assert.IsNil(t, barrier.Await())
}()
go func() {
defer wg.Done()
// first cycle
assert.ErrorIs(t, barrier.AwaitContext(ctx), ErrBrokenBarrier)
// second cycle
assert.IsNil(t, barrier.Await())
}()
go func() {
defer wg.Done()
// skip the first cycle to ensure the barrier is reset
time.Sleep(10 * time.Millisecond)
// second cycle
assert.IsNil(t, barrier.Await())
}()
// wait before canceling the context to ensure the first cycle is registered
time.Sleep(2 * time.Millisecond)
cancel()
wg.Wait()
ctx, cancel = context.WithCancel(context.Background())
}
cancel() // cancel the final context created in the loop
// all goroutines should be released
assert.Equal(t, 0, barrier.Waiting())
}
func TestCyclicBarrier_SingleParty(t *testing.T) {
t.Parallel()
barrier := NewCyclicBarrier(1)
var (
wg sync.WaitGroup
released atomic.Bool
)
wg.Add(1)
go func() {
defer wg.Done()
assert.IsNil(t, barrier.Await())
released.Store(true)
}()
wg.Wait()
assert.Equal(t, true, released.Load())
}
func TestCyclicBarrier_Validation(t *testing.T) {
t.Parallel()
assert.PanicMsgContains(t, func() { NewCyclicBarrier(0) }, "async: number of parties must be at least 1")
assert.PanicMsgContains(t, func() { NewCyclicBarrier(-1) }, "async: number of parties must be at least 1")
}
func TestCyclicBarrier_Reusability(t *testing.T) {
t.Parallel()
barrier := NewCyclicBarrier(3)
var (
wg sync.WaitGroup
phase atomic.Int32
)
// phase 1
wg.Add(3)
for i := 0; i < 3; i++ {
go func() {
defer wg.Done()
assert.IsNil(t, barrier.Await())
phase.Add(1)
}()
}
wg.Wait()
assert.Equal(t, int32(3), phase.Load())
// phase 2 - reuse the same barrier
phase.Store(0)
wg.Add(3)
for i := 0; i < 3; i++ {
go func() {
defer wg.Done()
assert.IsNil(t, barrier.Await())
phase.Add(1)
}()
}
wg.Wait()
assert.Equal(t, int32(3), phase.Load())
}
func TestCyclicBarrier_ConcurrentCycles(t *testing.T) {
t.Parallel()
barrier := NewCyclicBarrier(20)
var (
wg sync.WaitGroup
completed atomic.Int32
)
// many goroutines calling Await concurrently
for i := 0; i < 100; i++ {
wg.Add(1)
go func() {
defer wg.Done()
assert.IsNil(t, barrier.Await())
completed.Add(1)
}()
}
wg.Wait()
// should complete in groups of 20
assert.Equal(t, int32(100), completed.Load())
}
func TestCyclicBarrier_LastPartyReleasesAll(t *testing.T) {
t.Parallel()
barrier := NewCyclicBarrier(4)
var (
wg sync.WaitGroup
released atomic.Int32
)
// first 3 parties arrive quickly
for i := 0; i < 3; i++ {
wg.Add(1)
go func() {
defer wg.Done()
assert.IsNil(t, barrier.Await())
released.Add(1)
}()
}
// last party arrives after delay
time.Sleep(50 * time.Millisecond)
wg.Add(1)
go func() {
defer wg.Done()
assert.IsNil(t, barrier.Await())
released.Add(1)
}()
wg.Wait()
// all 4 should be released
assert.Equal(t, int32(4), released.Load())
}
func TestCyclicBarrier_MixedTiming(t *testing.T) {
t.Parallel()
// different arrival times in milliseconds
delays := []int{100, 50, 200, 10, 150, 30}
barrier := NewCyclicBarrier(len(delays))
var (
wg sync.WaitGroup
count atomic.Int32
)
for _, delay := range delays {
wg.Add(1)
go func(d int) {
defer wg.Done()
time.Sleep(time.Duration(d) * time.Millisecond)
count.Add(1)
assert.IsNil(t, barrier.Await())
// after barrier, all parties should have arrived
assert.Equal(t, int32(len(delays)), count.Load())
}(delay)
}
wg.Wait()
// all parties should have arrived
assert.Equal(t, int32(len(delays)), count.Load())
}
func TestCyclicBarrier_Reset(t *testing.T) {
t.Parallel()
barrier := NewCyclicBarrier(5)
var (
wg sync.WaitGroup
released atomic.Int32
)
// start 3 goroutines waiting at the barrier
for i := 0; i < 3; i++ {
wg.Add(1)
go func() {
defer wg.Done()
assert.ErrorIs(t, barrier.Await(), ErrBrokenBarrier)
released.Add(1)
}()
}
// wait a bit to ensure they're waiting
time.Sleep(50 * time.Millisecond)
assert.Equal(t, 3, barrier.Waiting())
// reset should release all waiting goroutines
barrier.Reset()
wg.Wait()
// all 3 should be released
assert.Equal(t, int32(3), released.Load())
assert.Equal(t, 0, barrier.Waiting())
}
func TestCyclicBarrier_ResetWhenEmpty(t *testing.T) {
t.Parallel()
barrier := NewCyclicBarrier(3)
// reset when no one is waiting should not panic
barrier.Reset()
assert.Equal(t, 0, barrier.Waiting())
// barrier should still be usable after reset
var wg sync.WaitGroup
var released atomic.Int32
wg.Add(3)
for i := 0; i < 3; i++ {
go func() {
defer wg.Done()
assert.IsNil(t, barrier.Await())
released.Add(1)
}()
}
wg.Wait()
assert.Equal(t, int32(3), released.Load())
}
func TestCyclicBarrier_ResetAndReuse(t *testing.T) {
t.Parallel()
barrier := NewCyclicBarrier(4)
var (
wg sync.WaitGroup
released atomic.Int32
)
// first cycle - start 2 goroutines, then reset
for i := 0; i < 2; i++ {
wg.Add(1)
go func() {
defer wg.Done()
assert.ErrorIs(t, barrier.Await(), ErrBrokenBarrier)
released.Add(1)
}()
}
time.Sleep(50 * time.Millisecond)
barrier.Reset()
// second cycle - use barrier again after reset
for i := 0; i < 4; i++ {
wg.Add(1)
go func() {
defer wg.Done()
assert.IsNil(t, barrier.Await())
released.Add(1)
}()
}
wg.Wait()
// 2 from first cycle + 4 from second cycle
assert.Equal(t, int32(6), released.Load())
assert.Equal(t, 0, barrier.Waiting())
}
func TestCyclicBarrier_MultipleResets(t *testing.T) {
t.Parallel()
barrier := NewCyclicBarrier(5)
var (
wg sync.WaitGroup
released atomic.Int32
)
// multiple reset cycles
for cycle := 0; cycle < 3; cycle++ {
// start some goroutines
for i := 0; i < 3; i++ {
wg.Add(1)
go func() {
defer wg.Done()
assert.ErrorIs(t, barrier.Await(), ErrBrokenBarrier)
released.Add(1)
}()
}
time.Sleep(20 * time.Millisecond)
assert.Equal(t, 3, barrier.Waiting())
// reset
barrier.Reset()
assert.Equal(t, 0, barrier.Waiting())
}
wg.Wait()
// 3 cycles * 3 goroutines
assert.Equal(t, int32(9), released.Load())
}