-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtest_test.go
1285 lines (1066 loc) · 30.2 KB
/
test_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
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
package raft
//
// Raft tests.
//
// we will use the original test_test.go to test your code for grading.
// so, while you can modify this code to help you debug, please
// test with the original before submitting.
//
import (
"fmt"
"math/rand"
"sync"
"sync/atomic"
"testing"
"time"
)
// The tester generously allows solutions to complete elections in one second
// (much more than the paper's range of timeouts).
const RaftElectionTimeout = 1000 * time.Millisecond
func TestInitialElection2A(t *testing.T) {
servers := 3
cfg := make_config(t, servers, false, false)
defer cfg.cleanup()
cfg.begin("Test (2A): initial election")
// is a leader elected?
cfg.checkOneLeader()
// sleep a bit to avoid racing with followers learning of the
// election, then check that all peers agree on the term.
time.Sleep(50 * time.Millisecond)
term1 := cfg.checkTerms()
if term1 < 1 {
t.Fatalf("term is %v, but should be at least 1", term1)
}
// does the leader+term stay the same if there is no network failure?
time.Sleep(2 * RaftElectionTimeout)
term2 := cfg.checkTerms()
if term1 != term2 {
fmt.Printf("warning: term changed even though there were no failures")
}
// there should still be a leader.
cfg.checkOneLeader()
cfg.end()
}
func TestReElection2A(t *testing.T) {
servers := 3
cfg := make_config(t, servers, false, false)
defer cfg.cleanup()
cfg.begin("Test (2A): election after network failure")
leader1 := cfg.checkOneLeader()
// if the leader disconnects, a new one should be elected.
DPrintf("if the leader disconnects, a new one should be elected. discon %d", leader1)
cfg.disconnect(leader1)
cfg.checkOneLeader()
DPrintf("end - if the leader disconnects, a new one should be elected.")
// if the old leader rejoins, that shouldn't
// disturb the new leader. and the old leader
// should switch to follower.
DPrintf("the old leader rejoins, that shouldn't distrub, conn %d", leader1)
cfg.connect(leader1)
leader2 := cfg.checkOneLeader()
DPrintf("end - the old leader rejoins, that shouldn't distrub")
// if there's no quorum, no new leader should
// be elected.
DPrintf("no quorum, no new leader should be elected, disconn %d %d",
leader2, (leader2+1)%servers)
cfg.disconnect(leader2)
cfg.disconnect((leader2 + 1) % servers)
time.Sleep(2 * RaftElectionTimeout)
// check that the one connected server
// does not think it is the leader.
cfg.checkNoLeader()
DPrintf("end - no quorum, no new leader should be elected")
// if a quorum arises, it should elect a leader.
DPrintf("if a quorum arise, it should elect a leader. conn %d", (leader2+1)%servers)
cfg.connect((leader2 + 1) % servers)
cfg.checkOneLeader()
DPrintf("end - if a quorum arise, it should elect a leader.")
// re-join of last node shouldn't prevent leader from existing.
DPrintf("re-join of last node shouldn't prevent leader from existing.")
cfg.connect(leader2)
cfg.checkOneLeader()
DPrintf("end - re-join of last node shouldn't prevent leader from existing.")
cfg.end()
}
func TestManyElections2A(t *testing.T) {
servers := 7
cfg := make_config(t, servers, false, false)
defer cfg.cleanup()
cfg.begin("Test (2A): multiple elections")
cfg.checkOneLeader()
iters := 10
for ii := 1; ii < iters; ii++ {
// disconnect three nodes
i1 := rand.Int() % servers
i2 := rand.Int() % servers
i3 := rand.Int() % servers
cfg.disconnect(i1)
cfg.disconnect(i2)
cfg.disconnect(i3)
// DPrintf("\t\t discon %d %d %d\n", i1, i2, i3)
// either the current leader should still be alive,
// or the remaining four should elect a new one.
cfg.checkOneLeader()
// DPrintf("\t\t recon %d %d %d\n", i1, i2, i3)
cfg.connect(i1)
cfg.connect(i2)
cfg.connect(i3)
}
cfg.checkOneLeader()
cfg.end()
}
func TestBasicAgree2B(t *testing.T) {
servers := 3
cfg := make_config(t, servers, false, false)
defer cfg.cleanup()
cfg.begin("Test (2B): basic agreement")
iters := 3
for index := 1; index < iters+1; index++ {
nd, _ := cfg.nCommitted(index)
if nd > 0 {
t.Fatalf("some have committed before Start()")
}
xindex := cfg.one(index*100, servers, false)
if xindex != index {
t.Fatalf("got index %v but expected %v", xindex, index)
}
}
cfg.end()
}
//
// check, based on counting bytes of RPCs, that
// each command is sent to each peer just once.
//
func TestRPCBytes2B(t *testing.T) {
servers := 3
cfg := make_config(t, servers, false, false)
defer cfg.cleanup()
cfg.begin("Test (2B): RPC byte count")
cfg.one(99, servers, false)
bytes0 := cfg.bytesTotal()
iters := 10
var sent int64 = 0
for index := 2; index < iters+2; index++ {
cmd := randstring(5000)
xindex := cfg.one(cmd, servers, false)
if xindex != index {
t.Fatalf("got index %v but expected %v", xindex, index)
}
sent += int64(len(cmd))
}
bytes1 := cfg.bytesTotal()
got := bytes1 - bytes0
expected := int64(servers) * sent
if got > expected+50000 {
t.Fatalf("too many RPC bytes; got %v, expected %v", got, expected)
}
cfg.end()
}
//
// test just failure of followers.
//
func For2023TestFollowerFailure2B(t *testing.T) {
servers := 3
cfg := make_config(t, servers, false, false)
defer cfg.cleanup()
cfg.begin("Test (2B): test progressive failure of followers")
cfg.one(101, servers, false)
// disconnect one follower from the network.
leader1 := cfg.checkOneLeader()
cfg.disconnect((leader1 + 1) % servers)
// the leader and remaining follower should be
// able to agree despite the disconnected follower.
cfg.one(102, servers-1, false)
time.Sleep(RaftElectionTimeout)
cfg.one(103, servers-1, false)
// disconnect the remaining follower
leader2 := cfg.checkOneLeader()
cfg.disconnect((leader2 + 1) % servers)
cfg.disconnect((leader2 + 2) % servers)
// submit a command.
index, _, ok := cfg.rafts[leader2].Start(104)
if ok != true {
t.Fatalf("leader rejected Start()")
}
if index != 4 {
t.Fatalf("expected index 4, got %v", index)
}
time.Sleep(2 * RaftElectionTimeout)
// check that command 104 did not commit.
n, _ := cfg.nCommitted(index)
if n > 0 {
t.Fatalf("%v committed but no majority", n)
}
cfg.end()
}
//
// test just failure of leaders.
//
func For2023TestLeaderFailure2B(t *testing.T) {
servers := 3
cfg := make_config(t, servers, false, false)
defer cfg.cleanup()
cfg.begin("Test (2B): test failure of leaders")
cfg.one(101, servers, false)
// disconnect the first leader.
leader1 := cfg.checkOneLeader()
cfg.disconnect(leader1)
// the remaining followers should elect
// a new leader.
cfg.one(102, servers-1, false)
time.Sleep(RaftElectionTimeout)
cfg.one(103, servers-1, false)
// disconnect the new leader.
leader2 := cfg.checkOneLeader()
cfg.disconnect(leader2)
// submit a command to each server.
for i := 0; i < servers; i++ {
cfg.rafts[i].Start(104)
}
time.Sleep(2 * RaftElectionTimeout)
// check that command 104 did not commit.
n, _ := cfg.nCommitted(4)
if n > 0 {
t.Fatalf("%v committed but no majority", n)
}
cfg.end()
}
//
// test that a follower participates after
// disconnect and re-connect.
//
func TestFailAgree2B(t *testing.T) {
servers := 3
cfg := make_config(t, servers, false, false)
defer cfg.cleanup()
cfg.begin("Test (2B): agreement after follower reconnects")
DPrintf("\t\t\t *** one 101\n")
cfg.one(101, servers, false)
// disconnect one follower from the network.
leader := cfg.checkOneLeader()
DPrintf("\t\t\t *** discon leader+1 %d\n", (leader+1)%servers)
cfg.disconnect((leader + 1) % servers)
// the leader and remaining follower should be
// able to agree despite the disconnected follower.
cfg.one(102, servers-1, false)
cfg.one(103, servers-1, false)
time.Sleep(RaftElectionTimeout)
cfg.one(104, servers-1, false)
cfg.one(105, servers-1, false)
DPrintf("\t\t\t *** recon %d\n", (leader+1)%servers)
// re-connect
cfg.connect((leader + 1) % servers)
// the full set of servers should preserve
// previous agreements, and be able to agree
// on new commands.
cfg.one(106, servers, true)
time.Sleep(RaftElectionTimeout)
cfg.one(107, servers, true)
cfg.end()
}
func TestFailNoAgree2B(t *testing.T) {
servers := 5
cfg := make_config(t, servers, false, false)
defer cfg.cleanup()
cfg.begin("Test (2B): no agreement if too many followers disconnect")
cfg.one(10, servers, false)
DPrintf("\t\t\t *** one 10\n")
// 3 of 5 followers disconnect
leader := cfg.checkOneLeader()
cfg.disconnect((leader + 1) % servers)
cfg.disconnect((leader + 2) % servers)
cfg.disconnect((leader + 3) % servers)
DPrintf("\t\t\t *** leader %d, disconn %d %d %d\n", leader, (leader+1)%servers, (leader+2)%servers, (leader+3)%servers)
index, _, ok := cfg.rafts[leader].Start(20)
if ok != true {
t.Fatalf("leader rejected Start()")
}
if index != 2 {
t.Fatalf("expected index 2, got %v", index)
}
time.Sleep(2 * RaftElectionTimeout)
n, _ := cfg.nCommitted(index)
if n > 0 {
t.Fatalf("%v committed but no majority", n)
}
DPrintf("\t\t\t *** reconn %d %d %d\n", (leader+1)%servers, (leader+2)%servers, (leader+3)%servers)
// repair
cfg.connect((leader + 1) % servers)
cfg.connect((leader + 2) % servers)
cfg.connect((leader + 3) % servers)
// the disconnected majority may have chosen a leader from
// among their own ranks, forgetting index 2.
leader2 := cfg.checkOneLeader()
index2, _, ok2 := cfg.rafts[leader2].Start(30)
if ok2 == false {
t.Fatalf("leader2 rejected Start()")
}
if index2 < 2 || index2 > 3 {
t.Fatalf("unexpected index %v", index2)
}
cfg.one(1000, servers, true)
cfg.end()
}
func TestConcurrentStarts2B(t *testing.T) {
servers := 3
cfg := make_config(t, servers, false, false)
defer cfg.cleanup()
cfg.begin("Test (2B): concurrent Start()s")
var success bool
loop:
for try := 0; try < 5; try++ {
DPrintf("Test try: %d", try)
if try > 0 {
// give solution some time to settle
DPrintf("Test try: %d give solution some time to settle", try)
time.Sleep(3 * time.Second)
}
leader := cfg.checkOneLeader()
DPrintf("Test try: %d check one leader", try)
_, term, ok := cfg.rafts[leader].Start(1)
if !ok {
// leader moved on really quickly
DPrintf("Test try: %d leader moved on really quickly", try)
continue
}
iters := 5
var wg sync.WaitGroup
is := make(chan int, iters)
for ii := 0; ii < iters; ii++ {
wg.Add(1)
go func(i int) {
defer wg.Done()
i, term1, ok := cfg.rafts[leader].Start(100 + i)
if term1 != term {
return
}
if ok != true {
return
}
is <- i
}(ii)
}
wg.Wait()
close(is)
DPrintf("Msg: wait finish and close is")
for j := 0; j < servers; j++ {
if t, _ := cfg.rafts[j].GetState(); t != term {
// term changed -- can't expect low RPC counts
DPrintf("Msg: term changed -- can't expect low RPC counts")
continue loop
}
}
failed := false
cmds := []int{}
for index := range is {
DPrintf("Msg: cmd wait is %d", index)
cmd := cfg.wait(index, servers, term)
DPrintf("Msg: cmd wait done is %d", index)
if ix, ok := cmd.(int); ok {
if ix == -1 {
// peers have moved on to later terms
// so we can't expect all Start()s to
// have succeeded
failed = true
break
}
cmds = append(cmds, ix)
} else {
t.Fatalf("value %v is not an int", cmd)
}
}
if failed {
// avoid leaking goroutines
DPrintf("Msg: avoid leaking goroutines")
go func() {
for range is {
}
}()
continue
}
for ii := 0; ii < iters; ii++ {
x := 100 + ii
ok := false
for j := 0; j < len(cmds); j++ {
if cmds[j] == x {
ok = true
}
}
if ok == false {
t.Fatalf("cmd %v missing in %v", x, cmds)
}
}
success = true
break
}
if !success {
t.Fatalf("term changed too often")
}
cfg.end()
}
func TestRejoin2B(t *testing.T) {
servers := 3
cfg := make_config(t, servers, false, false)
defer cfg.cleanup()
cfg.begin("Test (2B): rejoin of partitioned leader")
DPrintf("\t\t **start 101")
cfg.one(101, servers, true)
DPrintf("\t\t **leader network failure")
// leader network failure
leader1 := cfg.checkOneLeader()
cfg.disconnect(leader1)
DPrintf("\t\t **make old leader try to agree on some entries")
// make old leader try to agree on some entries
cfg.rafts[leader1].Start(102)
cfg.rafts[leader1].Start(103)
cfg.rafts[leader1].Start(104)
DPrintf("\t\t **new leader commits, also for index=2")
// new leader commits, also for index=2
cfg.one(103, 2, true)
DPrintf("\t\t **new leader network failure")
// new leader network failure
leader2 := cfg.checkOneLeader()
cfg.disconnect(leader2)
DPrintf("\t\t **old leader connected again")
// old leader connected again
cfg.connect(leader1)
cfg.one(104, 2, true)
DPrintf("\t\t **all together now")
// all together now
cfg.connect(leader2)
cfg.one(105, servers, true)
cfg.end()
}
func TestBackup2B(t *testing.T) {
servers := 5
cfg := make_config(t, servers, false, false)
defer cfg.cleanup()
cfg.begin("Test (2B): leader backs up quickly over incorrect follower logs")
cfg.one(rand.Int(), servers, true)
// put leader and one follower in a partition
leader1 := cfg.checkOneLeader()
cfg.disconnect((leader1 + 2) % servers)
cfg.disconnect((leader1 + 3) % servers)
cfg.disconnect((leader1 + 4) % servers)
DPrintf("\t\t ****** put leader and one follower in a partition\n")
DPrintf("\t\t\t ****** disconn %d %d %d\n", (leader1+2)%servers, (leader1+3)%servers, (leader1+4)%servers)
DPrintf("\t\t ****** submit lots of commands that won't commit\n")
// submit lots of commands that won't commit
for i := 0; i < 50; i++ {
cfg.rafts[leader1].Start(rand.Int())
}
DPrintf("\t\t ****** end - submit lots of commands that won't commit\n")
time.Sleep(RaftElectionTimeout / 2)
cfg.disconnect((leader1 + 0) % servers)
cfg.disconnect((leader1 + 1) % servers)
DPrintf("\t\t ****** allow other partition to recover\n")
DPrintf("\t\t\t ****** disconn %d %d\n", (leader1+0)%servers, (leader1+1)%servers)
DPrintf("\t\t\t ****** conn %d %d %d\n", (leader1+2)%servers, (leader1+3)%servers, (leader1+4)%servers)
// allow other partition to recover
cfg.connect((leader1 + 2) % servers)
cfg.connect((leader1 + 3) % servers)
cfg.connect((leader1 + 4) % servers)
DPrintf("\t\t ****** lots of successful commands to new group\n")
// lots of successful commands to new group.
for i := 0; i < 50; i++ {
cfg.one(rand.Int(), 3, true)
}
DPrintf("\t\t ****** end - lots of successful commands to new group\n")
DPrintf("\t\t ****** now another paritioned leader and one follower\n")
// now another partitioned leader and one follower
leader2 := cfg.checkOneLeader()
other := (leader1 + 2) % servers
if leader2 == other {
other = (leader2 + 1) % servers
}
DPrintf("\t\t\t ****** disconn %d", other)
cfg.disconnect(other)
DPrintf("\t\t ****** lots more commands that won't commit\n")
// lots more commands that won't commit
for i := 0; i < 50; i++ {
cfg.rafts[leader2].Start(rand.Int())
}
DPrintf("\t\t ****** end - lots more commands that won't commit\n")
time.Sleep(RaftElectionTimeout / 2)
DPrintf("\t\t ****** bring original leader back to life\n")
DPrintf("\t\t\t ****** disconn ")
// bring original leader back to life,
for i := 0; i < servers; i++ {
cfg.disconnect(i)
DPrintf("%d ", i)
}
DPrintf("\n")
DPrintf("\t\t\t ****** conn %d %d %d", (leader1+0)%servers, (leader1+1)%servers, other)
cfg.connect((leader1 + 0) % servers)
cfg.connect((leader1 + 1) % servers)
cfg.connect(other)
DPrintf("\t\t ****** lots of successful commands to new group\n")
// lots of successful commands to new group.
for i := 0; i < 50; i++ {
cfg.one(rand.Int(), 3, true)
}
DPrintf("\t\t ****** now everyone\n")
// now everyone
for i := 0; i < servers; i++ {
cfg.connect(i)
}
cfg.one(rand.Int(), servers, true)
cfg.end()
}
func TestCount2B(t *testing.T) {
servers := 3
cfg := make_config(t, servers, false, false)
defer cfg.cleanup()
cfg.begin("Test (2B): RPC counts aren't too high")
rpcs := func() (n int) {
for j := 0; j < servers; j++ {
n += cfg.rpcCount(j)
}
return
}
leader := cfg.checkOneLeader()
total1 := rpcs()
if total1 > 30 || total1 < 1 {
t.Fatalf("too many or few RPCs (%v) to elect initial leader\n", total1)
}
var total2 int
var success bool
loop:
for try := 0; try < 5; try++ {
if try > 0 {
// give solution some time to settle
time.Sleep(3 * time.Second)
}
leader = cfg.checkOneLeader()
total1 = rpcs()
iters := 10
starti, term, ok := cfg.rafts[leader].Start(1)
if !ok {
// leader moved on really quickly
continue
}
cmds := []int{}
for i := 1; i < iters+2; i++ {
x := int(rand.Int31())
cmds = append(cmds, x)
index1, term1, ok := cfg.rafts[leader].Start(x)
if term1 != term {
// Term changed while starting
continue loop
}
if !ok {
// No longer the leader, so term has changed
continue loop
}
if starti+i != index1 {
t.Fatalf("Start() failed")
}
}
for i := 1; i < iters+1; i++ {
cmd := cfg.wait(starti+i, servers, term)
if ix, ok := cmd.(int); ok == false || ix != cmds[i-1] {
if ix == -1 {
// term changed -- try again
continue loop
}
t.Fatalf("wrong value %v committed for index %v; expected %v\n", cmd, starti+i, cmds)
}
}
failed := false
total2 = 0
for j := 0; j < servers; j++ {
if t, _ := cfg.rafts[j].GetState(); t != term {
// term changed -- can't expect low RPC counts
// need to keep going to update total2
failed = true
}
total2 += cfg.rpcCount(j)
}
if failed {
continue loop
}
if total2-total1 > (iters+1+3)*3 {
t.Fatalf("too many RPCs (%v) for %v entries\n", total2-total1, iters)
}
success = true
break
}
if !success {
t.Fatalf("term changed too often")
}
time.Sleep(RaftElectionTimeout)
total3 := 0
for j := 0; j < servers; j++ {
total3 += cfg.rpcCount(j)
}
if total3-total2 > 3*20 {
t.Fatalf("too many RPCs (%v) for 1 second of idleness\n", total3-total2)
}
cfg.end()
}
func TestPersist12C(t *testing.T) {
servers := 3
cfg := make_config(t, servers, false, false)
defer cfg.cleanup()
cfg.begin("Test (2C): basic persistence")
cfg.one(11, servers, true)
// crash and re-start all
for i := 0; i < servers; i++ {
cfg.start1(i, cfg.applier)
}
for i := 0; i < servers; i++ {
cfg.disconnect(i)
cfg.connect(i)
}
cfg.one(12, servers, true)
leader1 := cfg.checkOneLeader()
cfg.disconnect(leader1)
cfg.start1(leader1, cfg.applier)
cfg.connect(leader1)
cfg.one(13, servers, true)
leader2 := cfg.checkOneLeader()
cfg.disconnect(leader2)
cfg.one(14, servers-1, true)
cfg.start1(leader2, cfg.applier)
cfg.connect(leader2)
cfg.wait(4, servers, -1) // wait for leader2 to join before killing i3
i3 := (cfg.checkOneLeader() + 1) % servers
cfg.disconnect(i3)
cfg.one(15, servers-1, true)
cfg.start1(i3, cfg.applier)
cfg.connect(i3)
cfg.one(16, servers, true)
cfg.end()
}
func TestPersist22C(t *testing.T) {
servers := 5
cfg := make_config(t, servers, false, false)
defer cfg.cleanup()
cfg.begin("Test (2C): more persistence")
index := 1
for iters := 0; iters < 5; iters++ {
cfg.one(10+index, servers, true)
index++
leader1 := cfg.checkOneLeader()
cfg.disconnect((leader1 + 1) % servers)
cfg.disconnect((leader1 + 2) % servers)
cfg.one(10+index, servers-2, true)
index++
cfg.disconnect((leader1 + 0) % servers)
cfg.disconnect((leader1 + 3) % servers)
cfg.disconnect((leader1 + 4) % servers)
cfg.start1((leader1+1)%servers, cfg.applier)
cfg.start1((leader1+2)%servers, cfg.applier)
cfg.connect((leader1 + 1) % servers)
cfg.connect((leader1 + 2) % servers)
time.Sleep(RaftElectionTimeout)
cfg.start1((leader1+3)%servers, cfg.applier)
cfg.connect((leader1 + 3) % servers)
cfg.one(10+index, servers-2, true)
index++
cfg.connect((leader1 + 4) % servers)
cfg.connect((leader1 + 0) % servers)
}
cfg.one(1000, servers, true)
cfg.end()
}
func TestPersist32C(t *testing.T) {
servers := 3
cfg := make_config(t, servers, false, false)
defer cfg.cleanup()
cfg.begin("Test (2C): partitioned leader and one follower crash, leader restarts")
cfg.one(101, 3, true)
leader := cfg.checkOneLeader()
cfg.disconnect((leader + 2) % servers)
cfg.one(102, 2, true)
cfg.crash1((leader + 0) % servers)
cfg.crash1((leader + 1) % servers)
cfg.connect((leader + 2) % servers)
cfg.start1((leader+0)%servers, cfg.applier)
cfg.connect((leader + 0) % servers)
cfg.one(103, 2, true)
cfg.start1((leader+1)%servers, cfg.applier)
cfg.connect((leader + 1) % servers)
cfg.one(104, servers, true)
cfg.end()
}
//
// Test the scenarios described in Figure 8 of the extended Raft paper. Each
// iteration asks a leader, if there is one, to insert a command in the Raft
// log. If there is a leader, that leader will fail quickly with a high
// probability (perhaps without committing the command), or crash after a while
// with low probability (most likey committing the command). If the number of
// alive servers isn't enough to form a majority, perhaps start a new server.
// The leader in a new term may try to finish replicating log entries that
// haven't been committed yet.
//
func TestFigure82C(t *testing.T) {
servers := 5
cfg := make_config(t, servers, false, false)
defer cfg.cleanup()
cfg.begin("Test (2C): Figure 8")
cfg.one(rand.Int(), 1, true)
nup := servers
for iters := 0; iters < 1000; iters++ {
leader := -1
for i := 0; i < servers; i++ {
if cfg.rafts[i] != nil {
_, _, ok := cfg.rafts[i].Start(rand.Int())
if ok {
leader = i
}
}
}
if (rand.Int() % 1000) < 100 {
ms := rand.Int63() % (int64(RaftElectionTimeout/time.Millisecond) / 2)
time.Sleep(time.Duration(ms) * time.Millisecond)
} else {
ms := (rand.Int63() % 13)
time.Sleep(time.Duration(ms) * time.Millisecond)
}
if leader != -1 {
cfg.crash1(leader)
nup -= 1
}
if nup < 3 {
s := rand.Int() % servers
if cfg.rafts[s] == nil {
cfg.start1(s, cfg.applier)
cfg.connect(s)
nup += 1
}
}
}
for i := 0; i < servers; i++ {
if cfg.rafts[i] == nil {
cfg.start1(i, cfg.applier)
cfg.connect(i)
}
}
cfg.one(rand.Int(), servers, true)
cfg.end()
}
func TestUnreliableAgree2C(t *testing.T) {
servers := 5
cfg := make_config(t, servers, true, false)
defer cfg.cleanup()
cfg.begin("Test (2C): unreliable agreement")
var wg sync.WaitGroup
for iters := 1; iters < 50; iters++ {
for j := 0; j < 4; j++ {
wg.Add(1)
go func(iters, j int) {
defer wg.Done()
cfg.one((100*iters)+j, 1, true)
}(iters, j)
}
cfg.one(iters, 1, true)
}
cfg.setunreliable(false)
wg.Wait()
cfg.one(100, servers, true)
cfg.end()
}
func TestFigure8Unreliable2C(t *testing.T) {
servers := 5
cfg := make_config(t, servers, true, false)
defer cfg.cleanup()
cfg.begin("Test (2C): Figure 8 (unreliable)")
cfg.one(rand.Int()%10000, 1, true)
nup := servers
for iters := 0; iters < 1000; iters++ {
if iters == 200 {
cfg.setlongreordering(true)
}
leader := -1
for i := 0; i < servers; i++ {
_, _, ok := cfg.rafts[i].Start(rand.Int() % 10000)
if ok && cfg.connected[i] {
leader = i
}
}
if (rand.Int() % 1000) < 100 {
ms := rand.Int63() % (int64(RaftElectionTimeout/time.Millisecond) / 2)
time.Sleep(time.Duration(ms) * time.Millisecond)
} else {
ms := (rand.Int63() % 13)
time.Sleep(time.Duration(ms) * time.Millisecond)
}
if leader != -1 && (rand.Int()%1000) < int(RaftElectionTimeout/time.Millisecond)/2 {
cfg.disconnect(leader)
nup -= 1
}
if nup < 3 {
s := rand.Int() % servers
if cfg.connected[s] == false {
cfg.connect(s)
nup += 1
}
}
}
for i := 0; i < servers; i++ {
if cfg.connected[i] == false {
cfg.connect(i)
}
}
cfg.one(rand.Int()%10000, servers, true)
cfg.end()
}
func internalChurn(t *testing.T, unreliable bool) {
servers := 5
cfg := make_config(t, servers, unreliable, false)
defer cfg.cleanup()
if unreliable {
cfg.begin("Test (2C): unreliable churn")
} else {
cfg.begin("Test (2C): churn")
}