/
gossip.go
164 lines (136 loc) · 3.59 KB
/
gossip.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
package main
import (
"math"
"sync"
"time"
)
// Responsible for figuring out which other nodes are out there
var gossip *Gossip
type Gossip struct {
transport *NetworkTransport
nodesMux sync.RWMutex
nodes map[string]*GossipNodeState
}
// Discover seeds
func (this *Gossip) discoverSeeds() {
for _, seed := range conf.Seeds {
go this.transport._prepareConnection(seed)
}
}
// On handshake complete
func (this *Gossip) _onHelloHandshakeComplete(node string) {
log.Infof("Completed gossip handshake with %s", node)
// Send node list
this._sendNodeList(node)
// Connect binary once handshake is complete (async)
go binaryTransport.transport._prepareConnection(node)
}
// Send message
func (this *Gossip) _send(node string, msg *GossipMessage) ([]byte, error) {
return this.transport._send(node, msg.Bytes())
}
// Get nodes
func (this *Gossip) GetNodeStates() map[string]*GossipNodeState {
this.nodesMux.RLock()
defer this.nodesMux.RUnlock()
return this.nodes
}
// Get node state
func (this *Gossip) GetNodeState(node string) *GossipNodeState {
var s *GossipNodeState
this.nodesMux.RLock()
s = this.nodes[node]
this.nodesMux.RUnlock()
// Existing node?
if s == nil {
// New node
this.nodesMux.Lock()
this.nodes[node] = newGossipNodeState(node)
s = this.nodes[node]
this.nodesMux.Unlock()
// Keep list on local disk
this.PersistNodesToDisk()
}
return s
}
// New gossip service
func newGossip() *Gossip {
// Create gossip
g := &Gossip{
transport: newNetworkTransport("tcp", "gossip", conf.GossipPort, conf.GossipTransportReadBuffer, conf.GossipTransportNumStreams, false),
nodes: make(map[string]*GossipNodeState),
}
// Message
g.transport._onMessage = func(cmeta *TransportConnectionMeta, b []byte) []byte {
msg := &GossipMessage{}
msg.FromBytes(b)
switch msg.Type {
// Hello, ping-like message between nodes
case HelloGossipMessageType:
g._receiveHello(cmeta, msg)
break
// List of nodes, discovery service helper
case NodeListGossipMessageType:
g._receiveNodeList(cmeta, msg)
break
// Unknown
default:
log.Warnf("Received unknown message %v", msg)
break
}
// No response
return nil
}
// Ticker
ticker := time.NewTicker(time.Second * 1)
go func() {
for _ = range ticker.C {
// Send new hellos?
g.nodesMux.RLock()
for node, _ := range g.nodes {
timeSinceLastHelloSent := unixTsUint32() - g.GetNodeState(node).GetLastHelloSent()
if timeSinceLastHelloSent > conf.GossipHelloInterval {
go g._sendHello(node)
}
}
g.nodesMux.RUnlock()
// Collect node transport statistics
for k, tcp := range g.transport.connections {
s1 := tcp.Profiler.Stats()
s2 := &PerformanceProfilerStats{}
if binaryTransport.transport.connections[k] != nil {
s2 = binaryTransport.transport.connections[k].Profiler.Stats()
}
s := &PerformanceProfilerStats{
AvgSuccessMs: (s1.AvgSuccessMs + s2.AvgSuccessMs) / 2,
AvgErrorMs: (s1.AvgErrorMs + s2.AvgErrorMs) / 2,
}
if math.IsNaN(s.AvgSuccessMs) {
s.AvgSuccessMs = 0.0
}
if math.IsNaN(s.AvgErrorMs) {
s.AvgErrorMs = 0.0
}
g.GetNodeState(tcp.Node).SetStats(s)
}
}
}()
// Connect
g.transport._onConnect = func(cmeta *TransportConnectionMeta, node string) {
// Reset any previous state
nodeState := g.GetNodeState(node)
if nodeState.GetLastHelloReceived() > 0 {
// Re-transmit indices
go binaryTransport._sendShardIndices(node)
}
// Send hello
go g._sendHello(node)
}
// Start
g.transport.start()
// Start discovery
g.discoverSeeds()
// Discovery from disk
g.recoverGossipFromDisk()
return g
}