-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathgroup_test.go
More file actions
406 lines (326 loc) · 8.75 KB
/
Copy pathgroup_test.go
File metadata and controls
406 lines (326 loc) · 8.75 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
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
package sema_test
import (
"context"
"sync"
"testing"
"time"
"github.com/asmsh/sema"
)
func helperTestGroupRace() {
ctx, cancel := context.WithTimeout(context.Background(), 1*time.Millisecond)
defer cancel()
sg := sema.NewGroup(1)
sg.Reserve()
go func() {
if sg.ReserveN(ctx.Done(), 1) {
sg.Free()
}
}()
go func() {
if sg.ReserveN(ctx.Done(), 1) {
sg.Free()
}
}()
context.AfterFunc(ctx, func() { sg.Free() })
sg.Wait()
}
func TestGroupRace(t *testing.T) {
t.Parallel()
n := 100
for range n {
helperTestGroupRace()
}
}
func helperTestGroupRacePanic(t *testing.T) bool {
numGoroutines := 5
recoverChan := make(chan any, numGoroutines)
handleRecover := func() {
v := recover()
if v != nil && v != "sema.Group: negative group counter" {
t.Errorf("Free misue went unnoticed: %v", v)
}
recoverChan <- v
}
ctx, cancel := context.WithTimeout(context.Background(), 10*time.Millisecond)
defer cancel()
sg := sema.NewGroup(1)
sg.Reserve()
go func() {
defer handleRecover()
if sg.ReserveN(ctx.Done(), 1) {
sg.Free()
}
}()
// only one of the below Free calls below should succeed,
// the rest should panic.
for range numGoroutines - 1 {
context.AfterFunc(ctx, func() {
defer handleRecover()
sg.Free()
})
}
sg.Wait()
// retrieve the panic results.
var panics []any
for range numGoroutines {
v := <-recoverChan
if v == nil {
continue
}
panics = append(panics, v)
}
// check the results for the expected number of panics.
// note: we are expecting 2 successes.
success := false
if len(panics) == numGoroutines-2 {
success = true
}
return success
}
func TestGroupRacePanic(t *testing.T) {
t.Parallel()
success := true
for range 100 {
ret := helperTestGroupRacePanic(t)
success = success && ret
}
if !success {
t.Errorf("Free failed when racing")
}
}
// merely returning from it without panics is a success.
func helperTestGroupRaceWait(t *testing.T) {
numGoroutines := 10
ctx, cancel := context.WithTimeout(context.Background(), 10*time.Millisecond)
defer cancel()
sg := sema.NewGroup(numGoroutines)
sg.ReserveN(nil, numGoroutines)
// arrange to free the reserved N, 1 by 1, once ctx is closed.
for range numGoroutines {
context.AfterFunc(ctx, func() { sg.Free() })
}
// arrange for multiple goroutines to wait for sg,
// competing with the arranged free calls above.
// it could be really any number of goroutines, but sticking to n.
wg := sync.WaitGroup{}
wg.Add(numGoroutines)
for range numGoroutines {
context.AfterFunc(ctx, func() {
defer wg.Done()
sg.Wait()
})
}
// wait for all ongoing sg.Wait calls, without pre-initiating the WaitChan.
wg.Wait()
}
// merely returning from it without any panics is a success.
func TestGroupRaceWait(t *testing.T) {
t.Parallel()
for range 100 {
helperTestGroupRaceWait(t)
}
}
func helperGroupReserveFree(wg *sync.WaitGroup, sg *sema.Group) {
defer wg.Done()
sg.Reserve()
go func() {
time.Sleep(10 * time.Millisecond)
sg.Free()
}()
}
func helperGroupTryReserveFree(wg *sync.WaitGroup, sg *sema.Group) bool {
defer wg.Done()
if sg.TryReserveN(1) {
go func() {
time.Sleep(10 * time.Millisecond)
sg.Free()
}()
return true
}
return false
}
func TestGroupFlow(t *testing.T) {
t.Parallel()
n := 10
wg := sync.WaitGroup{}
sg := sema.NewGroup(n)
wg.Add(n)
for range n {
go helperGroupReserveFree(&wg, sg)
}
wg.Wait()
wg.Add(1)
go func() {
if helperGroupTryReserveFree(&wg, sg) {
t.Errorf("TryReserve() should be false")
}
}()
wg.Wait()
sg.Wait()
wg.Add(1)
go func() {
if !helperGroupTryReserveFree(&wg, sg) {
t.Errorf("TryReserve() should be true")
}
}()
wg.Wait()
sg.Wait()
}
func TestGroupCounters(t *testing.T) {
t.Parallel()
n := 10
t.Run("the size has to be equal to init size", func(t *testing.T) {
sg := sema.NewGroup(n)
if sg.Size() != n {
t.Errorf("Group size should be %d, got %d", n, sg.Size())
}
})
t.Run("the counters must be zero before any usage", func(t *testing.T) {
sg := sema.NewGroup(n)
if active := sg.ActiveCount(); active != 0 {
t.Errorf("Group active count should be 0, got %d", active)
}
if pending := sg.PendingCount(); pending != 0 {
t.Errorf("Group pending count should be 0, got %d", pending)
}
})
t.Run("the counters must be accurate after non-blocking reserve", func(t *testing.T) {
sg := sema.NewGroup(n)
sg.Reserve()
if active := sg.ActiveCount(); active != 1 {
t.Errorf("Group active count should be 1, got %d", active)
}
if pending := sg.PendingCount(); pending != 0 {
t.Errorf("Group pending count should be 0, got %d", pending)
}
sg.Free()
if active := sg.ActiveCount(); active != 0 {
t.Errorf("Group active count should be 0, got %d", active)
}
if pending := sg.PendingCount(); pending != 0 {
t.Errorf("Group pending count should be 0, got %d", pending)
}
})
t.Run("the counters must be accurate after blocking reserve", func(t *testing.T) {
sg := sema.NewGroup(n)
// take 1 to make the below ReserveN blocks.
sg.Reserve()
reserveNDone := make(chan struct{})
freeReady := make(chan struct{})
freeDone := make(chan struct{})
go func() {
sg.ReserveN(nil, n) // this blocks.
close(reserveNDone)
<-freeReady
sg.FreeN(n)
close(freeDone)
}()
// wait until the above ReserveN blocks.
for sg.TryReserveN(1) {
sg.Free()
}
if active := sg.ActiveCount(); active != 1 {
t.Errorf("Group active count should be %d, got %d", 1, active)
}
if pending := sg.PendingCount(); pending != n {
t.Errorf("Group pending count should be %d, got %d", n, pending)
}
// wake up the blocked ReserveN call.
sg.Free()
// wait until the Free wakes up the blocked ReserveN.
<-reserveNDone
if active := sg.ActiveCount(); active != n {
t.Errorf("Group active count should be %d, got %d", n, active)
}
if pending := sg.PendingCount(); pending != 0 {
t.Errorf("Group pending count should be %d, got %d", 0, pending)
}
// unblock the Free call and wait for it to finish.
close(freeReady)
<-freeDone
if active := sg.ActiveCount(); active != 0 {
t.Errorf("Group active count should be %d, got %d", 0, active)
}
if pending := sg.PendingCount(); pending != 0 {
t.Errorf("Group pending count should be %d, got %d", 0, pending)
}
})
t.Run("the counters must be as expected after canceled reserve", func(t *testing.T) {
sg := sema.NewGroup(n)
sg.Reserve()
// this blocks until the ReserveN below is executed,
// then closes the doneChan and returns.
doneChan := make(chan struct{})
go func() {
// wait until the ReserveN blocks.
for sg.TryReserveN(1) {
sg.Free()
}
// since the ReserveN is executed, and there's no room
// for it, it must block.
if active := sg.ActiveCount(); active != 1 {
t.Errorf("Group active count should be 1, got %d", active)
}
// at least n,
if pending := sg.PendingCount(); pending < n || pending > 2*n {
t.Errorf("Group pending count should be %d, got %d", n, pending)
}
close(doneChan)
sg.Free()
}()
// this blocks until the ReserveN below is executed,
// which triggers the above TryReserveN to return,
// which causes the doneChan to be closed.
go func() {
// wait for the TryReserveN to return.
<-doneChan
// make sure the counter can only go down.
if active := sg.ActiveCount(); active > 1 {
t.Errorf("Group active count should not be more than 1, got %d", active)
}
}()
wg := sync.WaitGroup{}
wg.Add(1)
go func() {
defer wg.Done()
if got := sg.ReserveN(doneChan, n); got != false {
t.Errorf("ReserveN with closed done chan returned wrong result: want false, got %v", got)
}
}()
if got := sg.ReserveN(doneChan, n); got != false {
t.Errorf("ReserveN with closed done chan returned wrong result: want false, got %v", got)
}
// wait for the ReserveN to execute, block, abort, and return.
wg.Wait()
if active := sg.ActiveCount(); active != 0 {
t.Errorf("Group active count should be 0, got %d", active)
}
if pending := sg.PendingCount(); pending != 0 {
t.Errorf("Group pending count should be 0, got %d", pending)
}
})
t.Run("the counters must be as expected after wait calls", func(t *testing.T) {
sg := sema.NewGroup(n)
sg.Reserve()
ctx, cancel := context.WithCancel(context.Background())
context.AfterFunc(ctx, func() {
sg.Free()
})
go func() {
for sg.TryReserveN(1) {
sg.FreeN(1)
}
cancel()
}()
if got := sg.ReserveN(ctx.Done(), n); got != false {
t.Errorf("ReserveN with canceled context chan returned wrong result: want false, got %v", got)
}
sg.Wait()
if active := sg.ActiveCount(); active != 0 {
t.Errorf("Group active count should be 0, got %d", active)
}
if pending := sg.PendingCount(); pending != 0 {
t.Errorf("Group pending count should be 0, got %d", pending)
}
})
}