forked from tiglabs/raft
-
Notifications
You must be signed in to change notification settings - Fork 0
/
raft_log_unstable_test.go
191 lines (178 loc) · 4.72 KB
/
raft_log_unstable_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
package raft
import (
"reflect"
"testing"
"github.com/tiglabs/raft/proto"
)
func TestMaybeLastIndex(t *testing.T) {
tests := []struct {
entries []*proto.Entry
offset uint64
wok bool
windex uint64
}{
// last in entries
{
[]*proto.Entry{&proto.Entry{Index: 5, Term: 1}}, 5, true, 5,
},
// empty unstable
{
[]*proto.Entry{}, 0, false, 0,
},
}
for i, tt := range tests {
u := unstable{
entries: tt.entries,
offset: tt.offset,
}
index, ok := u.maybeLastIndex()
if ok != tt.wok {
t.Errorf("#%d: ok = %t, want %t", i, ok, tt.wok)
}
if index != tt.windex {
t.Errorf("#%d: index = %d, want %d", i, index, tt.windex)
}
}
}
func TestUnstableMaybeTerm(t *testing.T) {
tests := []struct {
entries []*proto.Entry
offset uint64
index uint64
wok bool
wterm uint64
}{
// term from entries
{
[]*proto.Entry{&proto.Entry{Index: 5, Term: 1}}, 5, 5, true, 1,
},
{
[]*proto.Entry{&proto.Entry{Index: 5, Term: 1}}, 5, 6, false, 0,
},
{
[]*proto.Entry{&proto.Entry{Index: 5, Term: 1}}, 5, 4, false, 0,
},
{
[]*proto.Entry{}, 0, 5, false, 0,
},
}
for i, tt := range tests {
u := unstable{
entries: tt.entries,
offset: tt.offset,
}
term, ok := u.maybeTerm(tt.index)
if ok != tt.wok {
t.Errorf("#%d: ok = %t, want %t", i, ok, tt.wok)
}
if term != tt.wterm {
t.Errorf("#%d: term = %d, want %d", i, term, tt.wterm)
}
}
}
func TestUnstableRestore(t *testing.T) {
u := unstable{
entries: []*proto.Entry{&proto.Entry{Index: 5, Term: 1}},
offset: 5,
}
u.restore(6)
if u.offset != 7 {
t.Errorf("offset = %d, want %d", u.offset, 7)
}
if len(u.entries) != 0 {
t.Errorf("len = %d, want 0", len(u.entries))
}
}
func TestUnstableStableTo(t *testing.T) {
tests := []struct {
entries []*proto.Entry
offset uint64
index, term uint64
woffset uint64
wlen int
}{
{
[]*proto.Entry{}, 0, 5, 1, 0, 0,
},
{
[]*proto.Entry{&proto.Entry{Index: 5, Term: 1}}, 5, 5, 1, 6, 0,
},
{
[]*proto.Entry{&proto.Entry{Index: 5, Term: 1}, &proto.Entry{Index: 6, Term: 1}}, 5,
5, 1, 6, 1,
},
{
[]*proto.Entry{&proto.Entry{Index: 6, Term: 2}}, 6, 6, 1, 6, 1,
},
{
[]*proto.Entry{&proto.Entry{Index: 5, Term: 1}}, 5, 4, 1, 5, 1,
},
{
[]*proto.Entry{&proto.Entry{Index: 5, Term: 1}}, 5, 4, 2, 5, 1,
},
}
for i, tt := range tests {
u := unstable{
entries: tt.entries,
offset: tt.offset,
}
u.stableTo(tt.index, tt.term)
if u.offset != tt.woffset {
t.Errorf("#%d: offset = %d, want %d", i, u.offset, tt.woffset)
}
if len(u.entries) != tt.wlen {
t.Errorf("#%d: len = %d, want %d", i, len(u.entries), tt.wlen)
}
}
}
func TestUnstableTruncateAndAppend(t *testing.T) {
tests := []struct {
entries []*proto.Entry
offset uint64
toappend []*proto.Entry
woffset uint64
wentries []*proto.Entry
}{
// append to the end
{
[]*proto.Entry{&proto.Entry{Index: 5, Term: 1}}, 5,
[]*proto.Entry{&proto.Entry{Index: 6, Term: 1}, &proto.Entry{Index: 7, Term: 1}},
5, []*proto.Entry{&proto.Entry{Index: 5, Term: 1}, &proto.Entry{Index: 6, Term: 1}, &proto.Entry{Index: 7, Term: 1}},
},
// replace the unstable entries
{
[]*proto.Entry{&proto.Entry{Index: 5, Term: 1}}, 5,
[]*proto.Entry{&proto.Entry{Index: 5, Term: 2}, &proto.Entry{Index: 6, Term: 2}},
5, []*proto.Entry{&proto.Entry{Index: 5, Term: 2}, &proto.Entry{Index: 6, Term: 2}},
},
{
[]*proto.Entry{&proto.Entry{Index: 5, Term: 1}}, 5,
[]*proto.Entry{&proto.Entry{Index: 4, Term: 2}, &proto.Entry{Index: 5, Term: 2}, &proto.Entry{Index: 6, Term: 2}},
4, []*proto.Entry{&proto.Entry{Index: 4, Term: 2}, &proto.Entry{Index: 5, Term: 2}, &proto.Entry{Index: 6, Term: 2}},
},
// truncate the existing entries and append
{
[]*proto.Entry{&proto.Entry{Index: 5, Term: 1}, &proto.Entry{Index: 6, Term: 1}, &proto.Entry{Index: 7, Term: 1}}, 5,
[]*proto.Entry{&proto.Entry{Index: 6, Term: 2}},
5, []*proto.Entry{&proto.Entry{Index: 5, Term: 1}, &proto.Entry{Index: 6, Term: 2}},
},
{
[]*proto.Entry{&proto.Entry{Index: 5, Term: 1}, &proto.Entry{Index: 6, Term: 1}, &proto.Entry{Index: 7, Term: 1}}, 5,
[]*proto.Entry{&proto.Entry{Index: 7, Term: 2}, &proto.Entry{Index: 8, Term: 2}},
5, []*proto.Entry{&proto.Entry{Index: 5, Term: 1}, &proto.Entry{Index: 6, Term: 1}, &proto.Entry{Index: 7, Term: 2}, &proto.Entry{Index: 8, Term: 2}},
},
}
for i, tt := range tests {
u := unstable{
entries: tt.entries,
offset: tt.offset,
}
u.truncateAndAppend(tt.toappend)
if u.offset != tt.woffset {
t.Errorf("#%d: offset = %d, want %d", i, u.offset, tt.woffset)
}
if !reflect.DeepEqual(u.entries, tt.wentries) {
t.Errorf("#%d: entries = %v, want %v", i, u.entries, tt.wentries)
}
}
}