/
mock_localhost_cluster_test.go
117 lines (100 loc) · 3.01 KB
/
mock_localhost_cluster_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
package node
// xlNode_go/mock_localHost_cluster_test.go
import (
"crypto/rsa"
"fmt"
xi "github.com/jddixon/xlNodeID_go"
xo "github.com/jddixon/xlOverlay_go"
xt "github.com/jddixon/xlTransport_go"
. "gopkg.in/check.v1"
)
var _ = fmt.Print
var _ = xo.NewIPOverlay
// XXX ROUGH CODE, NEEDS REVIEW. A test was split into two parts.
// One became MockLocalHostCluster() and this is the other part.
func (s *XLSuite) TestMockLocalHostTcpCluster(c *C) {
if VERBOSITY > 0 {
fmt.Println("TEST_MOCK_LOCAL_HOST_TCP_CLUSTER")
}
var err error
const K = 5
nodes, accs := MockLocalHostCluster(K)
defer func() {
for i := 0; i < K; i++ {
if accs[i] != nil {
accs[i].Close()
}
}
}()
for i := 0; i < K; i++ {
c.Assert(nodes, Not(IsNil))
c.Assert(accs, Not(IsNil))
}
nameSet := make(map[string]bool)
names := make([]string, K)
nodeIDs := make([]*xi.NodeID, K)
for i := 0; i < K; i++ {
names[i] = nodes[i].GetName()
_, ok := nameSet[names[i]]
c.Assert(ok, Equals, false)
nameSet[names[i]] = true
// XXX should also verify nodeIDs are unique
nodeIDs[i] = nodes[i].GetNodeID()
}
ar, err := xo.NewCIDRAddrRange("127.0.0.0/8")
c.Assert(err, Equals, nil)
overlay, err := xo.NewIPOverlay("XO", ar, "tcp", 1.0)
c.Assert(err, Equals, nil)
_ = overlay
accEndPoints := make([]*xt.TcpEndPoint, K)
for i := 0; i < K; i++ {
accEndPoints[i] = accs[i].GetEndPoint().(*xt.TcpEndPoint)
c.Assert(accEndPoints[i], Not(IsNil))
c.Assert(nodes[i].SizeEndPoints(), Equals, 1)
c.Assert(nodes[i].SizeAcceptors(), Equals, 1)
c.Assert(nodes[i].SizeOverlays(), Equals, 1)
c.Assert(overlay.Equal(nodes[i].GetOverlay(0)), Equals, true)
}
// XXX NEEDS CHECKING FROM HERE
commsKeys := make([]*rsa.PublicKey, K)
sigKeys := make([]*rsa.PublicKey, K)
ctors := make([]*xt.TcpConnector, K)
for i := 0; i < K; i++ {
commsKeys[i] = nodes[i].GetCommsPublicKey()
sigKeys[i] = nodes[i].GetSigPublicKey()
ctors[i], err = xt.NewTcpConnector(accEndPoints[i])
c.Assert(err, Equals, nil)
}
//overlaySlice := []xo.OverlayI{overlay}
// peers := make([]*Peer, K)
for i := 0; i < K; i++ {
//ctorSlice := []xt.ConnectorI{ctors[i]}
//_ = ctorSlice
//peers[i], err = NewPeer(names[i], nodeIDs[i], commsKeys[i], sigKeys[i],
// overlaySlice, ctorSlice)
//c.Assert(err, Equals, nil)
}
// Use the information collected to configure each node.
for i := 0; i < K; i++ {
//for j := 0; j < K; j++ {
// if i != j {
// ndx, err := nodes[i].AddPeer(peers[j])
// c.Assert(err, Equals, nil)
// var expectedNdx int
// if j < i {
// expectedNdx = j
// } else {
// expectedNdx = j - 1
// }
// c.Assert(ndx, Equals, expectedNdx)
// }
//} // GEEP
c.Assert(nodes[i].SizeAcceptors(), Equals, 1)
// XXX WRONG APPROACH - SizeConnectors() is a Peer
// function, and in this case should return 1 for each peer.
// c.Assert(nodes[i].SizeConnectors(),Equals, K-1)
c.Assert(nodes[i].SizeEndPoints(), Equals, 1)
c.Assert(nodes[i].SizeOverlays(), Equals, 1)
c.Assert(nodes[i].SizePeers(), Equals, K-1)
} // GEEP
}