/
selector.go
346 lines (287 loc) · 8.26 KB
/
selector.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
package client
import (
"context"
"fmt"
"math/rand"
"sync"
"github.com/filecoin-project/lotus/api"
"golang.org/x/xerrors"
)
// common errors
var (
ErrNoNodeAvailable = fmt.Errorf("no node available")
)
type MajorMinorVersion struct {
major uint32
minor uint32
}
func fromVersion(v api.Version) MajorMinorVersion {
major, minor, _ := v.Ints()
return MajorMinorVersion{
major: major,
minor: minor,
}
}
type Selector struct {
prior struct {
sync.RWMutex
addrs []string
}
live struct {
sync.RWMutex
addrs []string
addrVersions map[string]api.Version
versions map[api.Version][]string
majorMinorVersions map[MajorMinorVersion][]string
}
all struct {
sync.RWMutex
addrs []string
nodes map[string]struct {
*Node
abort context.CancelFunc
}
}
}
func newSelector() *Selector {
sel := new(Selector)
sel.prior.addrs = make([]string, 0)
sel.live.addrs = make([]string, 0)
sel.live.addrVersions = make(map[string]api.Version)
sel.live.versions = make(map[api.Version][]string)
sel.live.majorMinorVersions = make(map[MajorMinorVersion][]string)
sel.all.addrs = make([]string, 0)
sel.all.nodes = make(map[string]struct {
*Node
abort context.CancelFunc
})
return sel
}
func (s *Selector) RunNode(ctx context.Context, node *Node) error {
if _, exist := s.all.nodes[node.address]; exist {
return nil
}
apiVersion, err := node.CheckHealth(ctx)
if err != nil {
return err
}
s.markLiveNode(struct {
addr string
version api.Version
}{
addr: node.address,
version: apiVersion,
})
s.all.Lock()
s.all.addrs = append(s.all.addrs, node.address)
s.all.nodes[node.address] = struct {
*Node
abort context.CancelFunc
}{
Node: node,
abort: node.Start(ctx),
}
s.all.Unlock()
return nil
}
func (s *Selector) StopNodes(nodeAddrs []string) {
for _, nodeAddr := range nodeAddrs {
if _, exist := s.all.nodes[nodeAddr]; !exist {
continue
}
s.all.Lock()
s.all.addrs = remove(s.all.addrs, nodeAddr)
s.all.nodes[nodeAddr].abort()
delete(s.all.nodes, nodeAddr)
s.all.Unlock()
s.prior.Lock()
s.prior.addrs = remove(s.prior.addrs, nodeAddr)
s.prior.Unlock()
s.live.Lock()
version := s.live.addrVersions[nodeAddr]
s.live.addrs = remove(s.live.addrs, nodeAddr)
delete(s.live.addrVersions, nodeAddr)
s.live.versions[version] = remove(s.live.versions[version], nodeAddr)
s.live.majorMinorVersions[fromVersion(version)] = remove(s.live.majorMinorVersions[fromVersion(version)], nodeAddr)
s.live.Unlock()
}
}
func remove(s []string, r string) []string {
for i, v := range s {
if v == r {
return append(s[:i], s[i+1:]...)
}
}
return s
}
func contain(s []string, r string) bool {
for _, v := range s {
if v == r {
return true
}
}
return false
}
func (s *Selector) StopAllNode() {
s.all.Lock()
s.all.addrs = s.all.addrs[:0]
for _, addr := range s.all.addrs {
s.all.nodes[addr].abort()
delete(s.all.nodes, addr)
}
s.all.Unlock()
s.prior.Lock()
s.prior.addrs = s.prior.addrs[:0]
s.prior.Unlock()
s.live.Lock()
s.live.addrs = s.live.addrs[:0]
s.live.addrVersions = make(map[string]api.Version)
s.live.versions = make(map[api.Version][]string)
s.live.majorMinorVersions = make(map[MajorMinorVersion][]string)
s.live.Unlock()
}
func (s *Selector) markBestNodes(addrs ...string) {
s.prior.Lock()
s.prior.addrs = append(s.prior.addrs[:0], addrs...)
s.prior.Unlock()
}
func (s *Selector) markLiveNode(liveNode struct {
addr string
version api.Version
}) {
addr := liveNode.addr
version := liveNode.version
if _, exist := s.live.addrVersions[addr]; exist {
return
}
s.live.Lock()
defer s.live.Unlock()
if _, exist := s.live.addrVersions[addr]; exist {
return
}
log.Infof("mark live Node %v: %v", liveNode.addr, liveNode.version)
s.live.addrs = append(s.live.addrs, addr)
s.live.addrVersions[addr] = version
oldVersionAddrs := s.live.versions[version]
if oldVersionAddrs == nil {
oldVersionAddrs = []string{addr}
} else {
oldVersionAddrs = append(oldVersionAddrs, addr)
}
s.live.versions[version] = oldVersionAddrs
oldMajorMinorAddrs := s.live.majorMinorVersions[fromVersion(version)]
if oldMajorMinorAddrs == nil {
oldMajorMinorAddrs = []string{addr}
} else {
oldMajorMinorAddrs = append(oldMajorMinorAddrs, addr)
}
s.live.majorMinorVersions[fromVersion(version)] = oldMajorMinorAddrs
}
func (s *Selector) markLoseHeartNode(addr string) {
s.live.RLock()
if _, exist := s.live.addrVersions[addr]; !exist {
s.live.RUnlock()
return
}
s.live.RUnlock()
log.Warnf("mark loseHeart Node %s", addr)
s.prior.Lock()
s.prior.addrs = remove(s.prior.addrs, addr)
s.prior.Unlock()
s.live.Lock()
version := s.live.addrVersions[addr]
s.live.addrs = remove(s.live.addrs, addr)
delete(s.live.addrVersions, addr)
s.live.versions[version] = remove(s.live.versions[version], addr)
s.live.majorMinorVersions[fromVersion(version)] = remove(s.live.majorMinorVersions[fromVersion(version)], addr)
s.live.Unlock()
}
func (s *Selector) GetAllLiveNodes() ([]*Node, error) {
s.all.RLock()
defer s.all.RUnlock()
s.live.RLock()
defer s.live.RUnlock()
allLiveAddrs := s.live.addrs
if len(allLiveAddrs) == 0 {
return nil, xerrors.New("No live nodes found")
}
allLiveNodes := []*Node{}
for _, liveAddr := range allLiveAddrs {
if n, exist := s.all.nodes[liveAddr]; !exist {
continue
} else {
allLiveNodes = append(allLiveNodes, n.Node)
}
}
return allLiveNodes, nil
}
// Select tries to choose a node from the candidates
func (s *Selector) Select() (*Node, error) {
var priorAddrs []string
clientAPIVersion := api.FullAPIVersion1
clientMajorMinorVersion := fromVersion(clientAPIVersion)
s.prior.RLock()
priorAddrs = s.prior.addrs
s.prior.RUnlock()
s.all.RLock()
defer s.all.RUnlock()
s.live.RLock()
defer s.live.RUnlock()
//1.Select nodes with the same version from the best chain address
if len(priorAddrs) != 0 {
targetNodes := make([]*Node, 0)
for _, priorAddr := range priorAddrs {
if version, exist := s.live.addrVersions[priorAddr]; exist {
if version == clientAPIVersion {
if node, ok := s.all.nodes[priorAddr]; ok {
log.Debugf("Choose the best chain node with the same API version:%v, Client:%v Server:%v", priorAddr,
clientAPIVersion, version)
targetNodes = append(targetNodes, node.Node)
}
}
}
}
if len(targetNodes) != 0 {
return targetNodes[rand.Intn(len(targetNodes))], nil
}
}
//2.Randomly select a node from nodes with the same version
sameVerLiveAddrs := s.live.versions[clientAPIVersion]
sameVerLiveSize := len(sameVerLiveAddrs)
if sameVerLiveSize != 0 {
randSameVerLiveAddr := sameVerLiveAddrs[rand.Intn(sameVerLiveSize)]
if node, ok := s.all.nodes[randSameVerLiveAddr]; ok {
log.Debugf("Select live node with the same API version:%v", randSameVerLiveAddr)
return node.Node, nil
}
}
//3.Randomly select a node from the compatible version nodes
compatibleVerLiveAddrs := s.live.majorMinorVersions[clientMajorMinorVersion]
compatibleVerLiveSize := len(compatibleVerLiveAddrs)
if compatibleVerLiveSize != 0 {
randCompatibleVerLiveAddr := compatibleVerLiveAddrs[rand.Intn(compatibleVerLiveSize)]
if node, ok := s.all.nodes[randCompatibleVerLiveAddr]; ok {
log.Warnf("No node with the same API version found! Select a compatible live node:%v, Client:%v Server:%v", randCompatibleVerLiveAddr,
clientAPIVersion, s.live.addrVersions[randCompatibleVerLiveAddr])
return node.Node, nil
}
}
//4.If no node with the same version/compatible version is found, a node is randomly selected from all live nodes
allLiveSize := len(s.live.addrs)
if allLiveSize != 0 {
randLiveAddr := s.live.addrs[rand.Intn(allLiveSize)]
if node, ok := s.all.nodes[randLiveAddr]; ok {
log.Warnf("No node with the same version/compatible version found!! Select a live node:%v, Client:%v Server:%v", randLiveAddr, clientAPIVersion,
s.live.addrVersions[randLiveAddr])
return node.Node, nil
}
}
//5.If no node with the same version/compatible version/live state is found, a node is randomly selected from all nodes
allSize := len(s.all.addrs)
if allSize == 0 {
return nil, ErrNoNodeAvailable
}
randAddr := s.all.addrs[rand.Intn(allSize)]
log.Errorf("No node with the same version/compatible version/live state found!!! Select node:%v", randAddr)
return s.all.nodes[randAddr].Node, nil
}