-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcraxpert_test.go
More file actions
518 lines (430 loc) · 10 KB
/
Copy pathcraxpert_test.go
File metadata and controls
518 lines (430 loc) · 10 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
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
package main
import (
"context"
"testing"
)
// --- FSM & Job creation tests ---
func TestNewJob_SetsPending(t *testing.T) {
job := NewJob(1)
if job.Status != Pending {
t.Errorf("NewJob: expected Pending, got %v", job.Status)
}
}
func TestNewJob_SetsMaxRetry(t *testing.T) {
job := NewJob(1)
if job.MaxRetry != 3 {
t.Errorf("NewJob: expected MaxRetry=3, got %d", job.MaxRetry)
}
}
func TestNewJob_SetsID(t *testing.T) {
job := NewJob(42)
if job.ID != 42 {
t.Errorf("NewJob: expected ID=42, got %d", job.ID)
}
}
func TestNewJob_TypeCycles(t *testing.T) {
types := make(map[string]int)
for i := 0; i < 100; i++ {
job := NewJob(i)
types[job.Type]++
}
if len(types) != 3 {
t.Errorf("expected 3 job types, got %d: %v", len(types), types)
}
}
func TestJobString_ValidJSON(t *testing.T) {
job := NewJob(1)
s := job.String()
if len(s) == 0 {
t.Fatal("String() returned empty")
}
if s[0] != '{' || s[len(s)-1] != '}' {
t.Errorf("String() does not look like JSON: %s", s)
}
}
func TestJobStatus_ValidTransitionPendingToRunning(t *testing.T) {
job := NewJob(1)
job.Status = Running
if job.Status != Running {
t.Errorf("expected Running, got %v", job.Status)
}
}
func TestJobStatus_ValidTransitionRunningToFailed(t *testing.T) {
job := NewJob(1)
job.Status = Running
job.Status = Failed
if job.Status != Failed {
t.Errorf("expected Failed, got %v", job.Status)
}
}
func TestJobStatus_ValidTransitionRunningToSuccess(t *testing.T) {
job := NewJob(1)
job.Status = Running
job.Status = Success
if job.Status != Success {
t.Errorf("expected Success, got %v", job.Status)
}
}
func TestJobStatus_ValidTransitionFailedToRetrying(t *testing.T) {
job := NewJob(1)
job.Status = Failed
job.Status = Retrying
if job.Status != Retrying {
t.Errorf("expected Retrying, got %v", job.Status)
}
}
// --- Global job map concurrency ---
func TestJobMapConcurrentReadWrite(t *testing.T) {
JobMutex.Lock()
jobMap = make(map[int]*Job)
JobMutex.Unlock()
done := make(chan bool, 10)
for i := 0; i < 10; i++ {
go func(id int) {
job := NewJob(id)
JobMutex.Lock()
jobMap[id] = job
JobMutex.Unlock()
done <- true
}(i)
}
for i := 0; i < 10; i++ {
<-done
}
JobMutex.RLock()
count := len(jobMap)
JobMutex.RUnlock()
if count != 10 {
t.Errorf("expected 10 jobs in map, got %d", count)
}
}
func TestJobMapConcurrentReadWrite_RaceDetection(t *testing.T) {
JobMutex.Lock()
jobMap = make(map[int]*Job)
JobMutex.Unlock()
for i := 0; i < 100; i++ {
go func(id int) {
job := NewJob(id)
JobMutex.Lock()
jobMap[id] = job
JobMutex.Unlock()
}(i)
go func() {
JobMutex.RLock()
_ = len(jobMap)
JobMutex.RUnlock()
}()
go func(id int) {
JobMutex.RLock()
_, ok := jobMap[id]
JobMutex.RUnlock()
_ = ok
}(i)
}
}
func TestJobMapReadUnderLock(t *testing.T) {
JobMutex.Lock()
jobMap = make(map[int]*Job)
jobMap[1] = NewJob(1)
JobMutex.Unlock()
JobMutex.RLock()
job, ok := jobMap[1]
JobMutex.RUnlock()
if !ok {
t.Error("expected to find job 1")
}
if job.Status != Pending {
t.Errorf("expected Pending, got %v", job.Status)
}
}
func TestJobMapDelete(t *testing.T) {
JobMutex.Lock()
jobMap = make(map[int]*Job)
jobMap[1] = NewJob(1)
JobMutex.Unlock()
JobMutex.Lock()
delete(jobMap, 1)
JobMutex.Unlock()
JobMutex.RLock()
_, ok := jobMap[1]
JobMutex.RUnlock()
if ok {
t.Error("expected job 1 to be deleted")
}
}
// --- Pool tests ---
func TestNewPool_CreatesCorrectSize(t *testing.T) {
pool := NewPool(5)
if pool.Size() != 5 {
t.Errorf("NewPool: expected size 5, got %d", pool.Size())
}
}
func TestNewPool_InitialSizeZero(t *testing.T) {
pool := NewPool(0)
if pool.Size() != 0 {
t.Errorf("NewPool: expected size 0, got %d", pool.Size())
}
}
func TestPoolResize_Increase(t *testing.T) {
ctx, cancel := context.WithCancel(context.Background())
defer cancel()
pool := NewPool(2)
pool.Start(ctx)
defer pool.Stop()
pool.Resize(ctx, 5)
if pool.Size() != 5 {
t.Errorf("Resize up: expected size 5, got %d", pool.Size())
}
}
func TestPoolResize_Decrease(t *testing.T) {
ctx, cancel := context.WithCancel(context.Background())
defer cancel()
pool := NewPool(5)
pool.Start(ctx)
defer pool.Stop()
pool.Resize(ctx, 2)
if pool.Size() != 2 {
t.Errorf("Resize down: expected size 2, got %d", pool.Size())
}
}
func TestPoolSubmit_JobQueued(t *testing.T) {
ctx, cancel := context.WithCancel(context.Background())
defer cancel()
pool := NewPool(1)
pool.Start(ctx)
defer pool.Stop()
job := NewJob(1)
pool.Submit(job)
}
func TestPoolStop_NoPanic(t *testing.T) {
ctx, cancel := context.WithCancel(context.Background())
defer cancel()
pool := NewPool(3)
pool.Start(ctx)
pool.Stop()
}
func TestPoolDoubleStop_NoPanic(t *testing.T) {
ctx, cancel := context.WithCancel(context.Background())
defer cancel()
pool := NewPool(3)
pool.Start(ctx)
pool.Stop()
}
func TestPoolGracefulShutdown_NoDeadlock(t *testing.T) {
pool := NewPool(5)
ctx, cancel := context.WithCancel(context.Background())
pool.Start(ctx)
for i := 0; i < 20; i++ {
pool.Submit(NewJob(i))
}
cancel()
pool.Stop()
}
func TestPoolMultipleSubmit_RaceFree(t *testing.T) {
ctx, cancel := context.WithCancel(context.Background())
defer cancel()
pool := NewPool(3)
pool.Start(ctx)
defer pool.Stop()
for i := 0; i < 50; i++ {
go pool.Submit(NewJob(i))
}
}
// --- HTTP handler tests ---
func TestHandleReset_ClearsMap(t *testing.T) {
JobMutex.Lock()
jobMap = make(map[int]*Job)
jobMap[1] = NewJob(1)
JobMutex.Unlock()
oldActive := autoGeneratorActive
autoGeneratorActive = true
JobMutex.Lock()
jobMap = make(map[int]*Job)
JobMutex.Unlock()
JobMutex.RLock()
count := len(jobMap)
JobMutex.RUnlock()
if count != 0 {
t.Errorf("Reset: expected empty map, got %d entries", count)
}
autoGeneratorActive = oldActive
}
func TestHandleToggleAuto_Toggles(t *testing.T) {
original := autoGeneratorActive
autoGeneratorActive = true
if autoGeneratorActive != true {
t.Error("expected true initially")
}
original2 := autoGeneratorActive
autoGeneratorActive = !autoGeneratorActive
if autoGeneratorActive != false {
t.Error("expected false after toggle")
}
autoGeneratorActive = original2
autoGeneratorActive = !autoGeneratorActive
if autoGeneratorActive != false {
t.Error("expected false after second toggle")
}
autoGeneratorActive = original
}
func TestHandleJobStop_NotFound(t *testing.T) {
JobMutex.Lock()
jobMap = make(map[int]*Job)
JobMutex.Unlock()
_, ok := jobMap[999]
if ok {
t.Error("expected job 999 to not exist")
}
}
func TestHandlePoolResize_InvalidSize(t *testing.T) {
pool := NewPool(3)
_ = pool.Size()
}
// --- Context cancellation ---
func TestJobCancelFunction_NotNil(t *testing.T) {
job := NewJob(1)
if job.Cancel != nil {
t.Error("new job should have nil cancel func")
}
}
func TestJobCancelAfterRunning(t *testing.T) {
job := NewJob(1)
job.Status = Running
ctx, cancel := context.WithCancel(context.Background())
job.Cancel = cancel
cancel()
select {
case <-ctx.Done():
default:
t.Error("context should be done after cancel")
}
}
// --- Retry logic ---
func TestHandleFailure_RetriesWhenBelowMax(t *testing.T) {
job := NewJob(1)
job.Attempts = 0
job.MaxRetry = 3
job.Status = Failed
pool := NewPool(1)
handleFailure(1, job, pool)
if job.Status != Retrying {
t.Errorf("handleFailure: expected Retrying when attempts < maxRetry, got %v", job.Status)
}
}
func TestHandleFailure_FailsWhenExhausted(t *testing.T) {
job := NewJob(1)
job.Attempts = 3
job.MaxRetry = 3
job.Status = Failed
pool := NewPool(1)
handleFailure(1, job, pool)
if job.Status != Failed {
t.Errorf("handleFailure: expected Failed when attempts >= maxRetry, got %v", job.Status)
}
}
func TestHandleFailure_FailsWhenAboveMax(t *testing.T) {
job := NewJob(1)
job.Attempts = 5
job.MaxRetry = 3
job.Status = Failed
pool := NewPool(1)
handleFailure(1, job, pool)
if job.Status != Failed {
t.Errorf("handleFailure: expected Failed when attempts > maxRetry, got %v", job.Status)
}
}
func TestHandleFailure_AttemptIncremented(t *testing.T) {
job := NewJob(1)
job.Attempts = 1
job.MaxRetry = 3
job.Status = Failed
pool := NewPool(1)
handleFailure(1, job, pool)
if job.Status != Retrying {
t.Errorf("expected Retrying, got %v", job.Status)
}
}
func TestHandleFailure_ZeroRetry(t *testing.T) {
job := NewJob(1)
job.Attempts = 0
job.MaxRetry = 0
job.Status = Failed
pool := NewPool(1)
handleFailure(1, job, pool)
if job.Status != Failed {
t.Errorf("handleFailure: expected Failed when MaxRetry=0 and attempts >= 0, got %v", job.Status)
}
}
func TestHandleFailure_ConcurrentInvocations(t *testing.T) {
pool := NewPool(3)
for i := 0; i < 10; i++ {
go func(id int) {
job := NewJob(id)
job.Attempts = 0
job.MaxRetry = 2
handleFailure(1, job, pool)
}(i)
}
}
func TestHandleFailure_ConcurrentExhaustion(t *testing.T) {
pool := NewPool(3)
for i := 0; i < 10; i++ {
go func(id int) {
job := NewJob(id)
job.Attempts = 5
job.MaxRetry = 3
handleFailure(1, job, pool)
}(i)
}
}
// --- Edge case tests ---
func TestZeroIDJob(t *testing.T) {
job := NewJob(0)
if job.ID != 0 {
t.Errorf("expected ID=0, got %d", job.ID)
}
}
func TestLargeID_TypeCyclesCorrectly(t *testing.T) {
job := NewJob(100)
if job.Type != "sms" {
t.Errorf("expected type sms for ID=100 (100%%3=1), got %s", job.Type)
}
}
func TestLargeIDJob(t *testing.T) {
job := NewJob(999999)
if job.ID != 999999 {
t.Errorf("expected ID=999999, got %d", job.ID)
}
}
func TestPayloadNotEmpty(t *testing.T) {
job := NewJob(1)
if _, ok := job.Payload["to"]; !ok {
t.Error("expected payload to have 'to' key")
}
}
func TestAttemptsStartAtZero(t *testing.T) {
job := NewJob(1)
if job.Attempts != 0 {
t.Errorf("expected Attempts=0, got %d", job.Attempts)
}
}
func TestJobMapConcurrentDelete(t *testing.T) {
JobMutex.Lock()
jobMap = make(map[int]*Job)
for i := 0; i < 100; i++ {
jobMap[i] = NewJob(i)
}
JobMutex.Unlock()
for i := 0; i < 100; i++ {
go func(id int) {
JobMutex.Lock()
delete(jobMap, id)
JobMutex.Unlock()
}(i)
go func() {
JobMutex.RLock()
_ = len(jobMap)
JobMutex.RUnlock()
}()
}
}