-
Notifications
You must be signed in to change notification settings - Fork 4
/
gpool_test.go
546 lines (441 loc) · 12.1 KB
/
gpool_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
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
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
package gpool
import (
"context"
"fmt"
"sync"
"testing"
"time"
)
var implementations = []struct {
name string
new func(workerCount int) interface{}
}{
{name: "Semaphore", new: func(i int) interface{} {
return NewSemaphorePool(i)
}},
{name: "Workerpool", new: func(i int) interface{} {
return NewWorkerPool(i)
}},
}
// -------------- Testing --------------
func TestPool_Start(t *testing.T) {
for _, implementation := range implementations {
// Test both < 0, 0 and > 0 size.
for size := -1; size <= 1; size++ {
t.Run(fmt.Sprintf("%sS[%d]", implementation.name, size), func(t *testing.T) {
pool := implementation.new(size).(Pool)
/// Send Work before Worker Start
Err := pool.Enqueue(context.TODO(), func() {})
if Err == nil {
t.Error("Pool Enqueued a Job before pool starts.")
}
if Err != ErrPoolClosed {
t.Error("Pool Sent an incorrect error type")
}
/// Start Worker
Err = pool.Start()
// Test subsequent Calls to Start too
_ = pool.Start()
if size <= 0 {
if Err == nil {
t.Errorf("Pool of invalid size should return error when starting")
}
if Err != ErrPoolInvalidSize {
t.Error("returned incorrect error type")
}
return
}
if Err != nil {
t.Errorf("Pool failed to start, Error: %s", Err)
}
// Enqueue a Job
Err = pool.Enqueue(context.TODO(), func() {})
if Err != nil {
t.Errorf("Pool Enqueued Errored after Start. Error: %s", Err.Error())
}
})
}
}
}
func TestPool_Stop(t *testing.T) {
for _, implementation := range implementations {
pool := implementation.new(10).(Pool)
t.Run(implementation.name, func(t *testing.T) {
/// Start Worker
_ = pool.Start()
pool.Stop()
// test subsequent calls to Stop()
pool.Stop()
x := make(chan int)
Err := pool.Enqueue(context.TODO(), func() {
x <- 123
})
if Err == nil {
t.Errorf("Accepted Job after Stopping the pool")
}
if Err != ErrPoolClosed {
t.Errorf("Returned Incorrect Error after sending job to stopped pool")
}
})
}
}
func TestPool_Restart(t *testing.T) {
for _, implementation := range implementations {
pool := implementation.new(1).(Pool)
t.Run(implementation.name, func(t *testing.T) {
/// Start Worker
_ = pool.Start()
/// Restarting the Pool
pool.Stop()
/// Send Work to pool_closed Pool
Err := pool.Enqueue(context.TODO(), func() {})
if Err == nil {
t.Error("Enqueued a job on a stopped pool.")
}
_ = pool.Start()
/// Send Work to pool that has been restarted.
Err = pool.Enqueue(context.TODO(), func() {})
if Err != nil {
t.Errorf("Pool Enqueued Errored after restart. Error: %s", Err.Error())
}
})
}
}
func TestPool_Enqueue(t *testing.T) {
for _, implementation := range implementations {
pool := implementation.new(2).(Pool)
t.Run(implementation.name, func(t *testing.T) {
// Start Worker
_ = pool.Start()
// Enqueue a Job
x := make(chan int, 1)
Err := pool.Enqueue(context.TODO(), func() {
x <- 123
})
if Err != nil {
t.Errorf("Error returned in a pool_started and free pool. Error: %s", Err.Error())
}
result := <-x
if result != 123 {
t.Errorf("Wrong Result by Job")
}
})
}
}
func TestPool_EnqueueBlocking(t *testing.T) {
for _, implementation := range implementations {
pool := implementation.new(2).(Pool)
t.Run(implementation.name, func(t *testing.T) {
// Create Context
ctx := context.TODO()
// Start Worker
_ = pool.Start()
/// TEST BLOCKING WHEN POOL IS FULL
a := make(chan int)
b := make(chan int)
c := make(chan int)
d := make(chan int)
/// SEND 4 JOBS ( TWO TO FILL THE POOL, A ONE TO BE CANCELED BY CTX, AND ONE TO WAIT THE FIRST TWO )
// Two Jobs
Err1 := pool.Enqueue(ctx, func() { a <- 123 })
Err2 := pool.Enqueue(ctx, func() { b <- 123 })
// Enqueue a job with a canceled ctx
canceledCtx, cancel := context.WithCancel(context.TODO())
go cancel()
Err3 := pool.Enqueue(canceledCtx, func() { c <- 123 })
// Send a waiting Job
go func() {
_ = pool.Enqueue(ctx, func() { d <- 123 })
}()
if Err1 != nil {
t.Errorf("Returned Error and it shouldn't #1, Error: %s", Err1.Error())
}
if Err2 != nil {
t.Errorf("Returned Error and it shouldn't #2, Error: %s", Err2.Error())
}
if Err3 == nil {
t.Error("Didn't Return Error in a waiting & canceled job")
}
if Err3 != ErrJobCanceled {
t.Errorf("Canceled Job returned wronge type of Error. Error: %s", Err3.Error())
}
// Check that Job C didn't finish before ONE of A & B finish and make room in the pool.
for i := 0; i < 3; i++ {
select {
case <-a:
if i > 2 {
t.Error("Job Finished AFTER a job that should have been finished AFTER.")
}
i++
case <-b:
if i > 2 {
t.Error("Job Finished AFTER a job that should have been finished AFTER.")
}
i++
case <-c:
t.Error("Received a result in a job that shouldn't have been run (it was canceled by ctx).")
case <-d:
if i < 1 {
t.Error("Job Finished BEFORE jobs that should have been blocking this job.")
}
i++
}
}
})
}
}
func TestPool_TryEnqueue(t *testing.T) {
for _, implementation := range implementations {
pool := implementation.new(2).(Pool)
t.Run(implementation.name, func(t *testing.T) {
x := make(chan int, 1)
/// Start Worker
_ = pool.Start()
success := pool.TryEnqueue(func() {
x <- 123
})
if success != true {
t.Errorf("TryEnqueue an empty pool failed")
}
result := <-x
if result != 123 {
t.Errorf("Wrong Result by Job")
}
/// TEST BLOCKING
a := make(chan int)
b := make(chan int)
c := make(chan int)
/// SEND 3 JOBS ( TWO TO FILL THE POOL, AND ONE TO FAIL BECAUSE THE FIRST TWO FILL THE POOL )
// Two Jobs
success1 := pool.TryEnqueue(func() { a <- 123 })
success2 := pool.TryEnqueue(func() { b <- 123 })
if success1 == false || success2 == false {
t.Errorf("Failed to TryEnqueue to the MAX pool limit.")
}
success3 := pool.TryEnqueue(func() { c <- 123 })
if success3 == true {
t.Errorf("TryEnqueue success on a FILLED queue")
}
<-a
<-b
})
}
}
func TestPool_GetSize(t *testing.T) {
for _, implementation := range implementations {
t.Run(implementation.name, func(t *testing.T) {
size := 10
pool := implementation.new(size).(Pool)
_ = pool.Start()
if pool.GetSize() != size {
t.Errorf("GetSize() returned incorrect size")
}
size = 5
_ = pool.Resize(size)
if pool.GetSize() != size {
t.Errorf("GetSize() returned incorrect size")
}
size = 15
_ = pool.Resize(size)
if pool.GetSize() != size {
t.Errorf("GetSize() returned incorrect size")
}
})
}
}
func TestPool_Resize(t *testing.T) {
for _, implementation := range implementations {
t.Run(implementation.name, func(t *testing.T) {
size := 10
pool := implementation.new(size).(Pool)
// resize to new size
size = 0
err := pool.Resize(size)
if err == nil {
t.Errorf("Resize to invalid size didn't return error!")
}
if err != ErrPoolInvalidSize {
t.Errorf("Resize to invalid size returned wrong error!")
}
size = 15
err = pool.Resize(size)
if err != nil {
t.Errorf("Resize failed error: %v", err.Error())
}
_ = pool.Start()
if pool.GetSize() != size {
t.Errorf("resize didn't return correct size")
}
})
}
}
func TestPool_PositiveResizeLive(t *testing.T) {
for _, implementation := range implementations {
t.Run(implementation.name, func(t *testing.T) {
size := 2
pool := implementation.new(size).(Pool)
_ = pool.Start()
// Create Context
ctx := context.TODO()
/// TEST BLOCKING WHEN POOL IS FULL
a := make(chan int)
b := make(chan int)
c := make(chan int)
/// SEND 3 JOBS ( TWO TO FILL THE POOL, A ONE TO BE CANCELED BY CTX, AND ONE TO WAIT THE FIRST TWO )
// Two Jobs
_ = pool.Enqueue(ctx, func() { a <- 123 })
_ = pool.Enqueue(ctx, func() { b <- 123 })
// Send a job that will block
go func() {
_ = pool.Enqueue(ctx, func() { c <- 123 })
}()
select {
case <-c:
t.Error("Job Finished BEFORE jobs that should have been blocking this job.")
default:
// job C is blocked, now resize should unblock it.
_ = pool.Resize(pool.GetSize() + 1)
select {
case <-c:
// Give some time for the job to be picked.
case <-time.After(500 * time.Millisecond):
t.Error("Job Blocked after resize.")
}
}
<-a
<-b
})
}
}
func TestPool_NegativeResizeLive(t *testing.T) {
for _, implementation := range implementations {
t.Run(implementation.name, func(t *testing.T) {
size := 3
pool := implementation.new(size).(Pool)
_ = pool.Start()
// Create Context
ctx := context.TODO()
/// TEST BLOCKING WHEN POOL IS FULL
a := make(chan int)
b := make(chan int)
c := make(chan int)
/// SEND 3 JOBS
// Two Jobs
_ = pool.Enqueue(ctx, func() { a <- 123 })
_ = pool.Enqueue(ctx, func() { b <- 123 })
_ = pool.Resize(pool.GetSize() - 1)
// Now this should block
go func() {
_ = pool.Enqueue(ctx, func() { c <- 123 })
}()
select {
case <-c:
t.Error("Job Finished BEFORE jobs that should have been blocking this job.")
default:
}
// Get all results.
<-a
<-b
<-c
})
}
}
// --------------------------------------
// ------------ Benchmarking ------------
func BenchmarkOneThroughput(b *testing.B) {
var workersCountValues = []int{10, 100, 1000, 10000}
for _, implementation := range implementations {
for _, workercount := range workersCountValues {
b.Run(fmt.Sprintf("[%s]S[%d]", implementation.name, workercount), func(b *testing.B) {
pool := implementation.new(workercount).(Pool)
_ = pool.Start()
b.ResetTimer()
b.StartTimer()
for i2 := 0; i2 < b.N; i2++ {
_ = pool.Enqueue(context.TODO(), func() {
})
}
b.StopTimer()
pool.Stop()
})
}
}
}
func BenchmarkOneJobSync(b *testing.B) {
var workersCountValues = []int{10, 100, 1000, 10000}
for _, implementation := range implementations {
for _, workercount := range workersCountValues {
b.Run(fmt.Sprintf("[%s]S[%d]", implementation.name, workercount), func(b *testing.B) {
pool := implementation.new(workercount).(Pool)
_ = pool.Start()
b.ResetTimer()
resultChan := make(chan int, 1)
for i2 := 0; i2 < b.N; i2++ {
_ = pool.Enqueue(context.TODO(), func() {
resultChan <- 123
})
<-resultChan
}
b.StopTimer()
pool.Stop()
})
}
}
}
func BenchmarkBulkJobs_UnderLimit(b *testing.B) {
var workersCountValues = []int{10000}
var workAmountValues = []int{100, 1000, 10000}
for _, implementation := range implementations {
for _, workercount := range workersCountValues {
for _, work := range workAmountValues {
b.Run(fmt.Sprintf("[%s]S[%d]J[%d]", implementation.name, workercount, work), func(b *testing.B) {
pool := implementation.new(workercount).(Pool)
_ = pool.Start()
b.ResetTimer()
for i2 := 0; i2 < b.N; i2++ {
wg := sync.WaitGroup{}
wg.Add(work)
for i3 := 0; i3 < work; i3++ {
go func() {
_ = pool.Enqueue(context.TODO(), func() {})
wg.Done()
}()
}
wg.Wait()
}
b.StopTimer()
pool.Stop()
})
}
}
}
}
func BenchmarkBulkJobs_OverLimit(b *testing.B) {
var workersCountValues = []int{100, 1000}
var workAmountValues = []int{1000, 10000}
for _, implementation := range implementations {
for _, workercount := range workersCountValues {
for _, work := range workAmountValues {
b.Run(fmt.Sprintf("[%s]S[%d]J[%d]", implementation.name, workercount, work), func(b *testing.B) {
pool := implementation.new(workercount).(Pool)
_ = pool.Start()
b.ResetTimer()
for i2 := 0; i2 < b.N; i2++ {
wg := sync.WaitGroup{}
wg.Add(work)
for i3 := 0; i3 < work; i3++ {
go func() {
_ = pool.Enqueue(context.TODO(), func() {})
wg.Done()
}()
}
wg.Wait()
}
b.StopTimer()
pool.Stop()
})
}
}
}
}
// --------------------------------------