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
|
package raftchunking
import (
"io"
"testing"
"github.com/go-test/deep"
"github.com/hashicorp/raft"
)
type MockFSM struct {
logs [][]byte
}
func (m *MockFSM) Apply(log *raft.Log) interface{} {
m.logs = append(m.logs, log.Data)
return len(m.logs)
}
func (m *MockFSM) Snapshot() (raft.FSMSnapshot, error) {
return nil, nil
}
func (m *MockFSM) Restore(inp io.ReadCloser) error {
return nil
}
func TestFSM_Basic(t *testing.T) {
m := new(MockFSM)
f := NewChunkingFSM(m, nil)
data, logs := chunkData(t)
for i, l := range logs {
r := f.Apply(&l)
switch r.(type) {
case nil:
if i == len(logs)-1 {
t.Fatal("expected non-nil value for last log apply")
}
case error:
t.Fatal(r.(error))
case ChunkingSuccess:
if i != len(logs)-1 {
t.Fatal("got int back before apply should have happened")
}
if r.(ChunkingSuccess).Response.(int) != 1 {
t.Fatalf("unexpected number of logs back: %d", r.(int))
}
default:
t.Fatal("unexpected return value")
}
}
var finalData []byte
for _, l := range m.logs {
finalData = append(finalData, l...)
}
if diff := deep.Equal(data, finalData); diff != nil {
t.Fatal(diff)
}
}
func TestFSM_StateHandling(t *testing.T) {
m := new(MockFSM)
f := NewChunkingFSM(m, nil)
data, logs := chunkData(t)
for i, l := range logs {
if i == len(logs)-1 {
break
}
r := f.Apply(&l)
switch r.(type) {
case nil:
case error:
t.Fatal(r.(error))
case int:
if i != len(logs)-1 {
t.Fatal("got int back before apply should have happened")
}
if r.(int) != 1 {
t.Fatalf("unexpected number of logs back: %d", r.(int))
}
default:
t.Fatal("unexpected return value")
}
}
var opCount int
chunks, err := f.store.GetChunks()
if err != nil {
t.Fatal(err)
}
for _, v := range chunks {
opCount++
if opCount > 1 {
t.Fatalf("unexpected opcount: %d", opCount)
}
var validChunks int
for _, val := range v {
if val != nil {
validChunks++
}
}
if validChunks != len(logs)-1 {
t.Fatalf("unexpected number of chunks: %d; should be one less than len of logs which is %d", validChunks, len(logs))
}
}
currState, err := f.CurrentState()
if err != nil {
t.Fatal(err)
}
if diff := deep.Equal(chunks, currState.ChunkMap); diff != nil {
t.Fatal(diff)
}
r := f.Apply(&(logs[len(logs)-1]))
rRaw, ok := r.(ChunkingSuccess)
if !ok {
t.Fatalf("wrong type back: %T, value is %#v", r, r)
}
rInt, ok := rRaw.Response.(int)
if !ok {
t.Fatalf("wrong type back: %T, value is %#v", rRaw, rRaw)
}
if rInt != 1 {
t.Fatalf("unexpected number of logs back: %d", rInt)
}
var finalData []byte
for _, l := range m.logs {
finalData = append(finalData, l...)
}
if diff := deep.Equal(data, finalData); diff != nil {
t.Fatal(diff)
}
newState, err := f.CurrentState()
if err != nil {
t.Fatal(err)
}
if diff := deep.Equal(chunks, newState.ChunkMap); diff == nil {
t.Fatal("expected current state to not match chunked state")
}
if err := f.RestoreState(currState); err != nil {
t.Fatal(err)
}
newState, err = f.CurrentState()
if err != nil {
t.Fatal(err)
}
if diff := deep.Equal(chunks, newState.ChunkMap); diff != nil {
t.Fatal(diff)
}
}
|
