/
hashring.go
97 lines (81 loc) · 1.59 KB
/
hashring.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
package strategy
import (
"fmt"
"github.com/eaglc/lamer/registry"
"github.com/eaglc/lamer/selector"
"stathat.com/c/consistent"
"sync"
)
type hashRing struct {
sync.RWMutex
rings map[string]*consistent.Consistent
nodes map[string]registry.Node
replica int
}
func (h *hashRing) Do(nds []registry.Node, opts ...selector.SelectOption) selector.Next {
return func() (node registry.Node, e error) {
return nil, fmt.Errorf("not support")
}
}
func (h *hashRing) DoA(nds []registry.Node, opts ...selector.SelectOption) registry.Node {
var op selector.SelectOptions
for _, o := range opts {
o(&op)
}
name := op.Name
key := op.Key
if len(nds) > 0 {
for i := range nds {
h.Mark(name, nds[i], nil)
}
}
h.RLock()
c := h.rings[name]
h.RUnlock()
if c == nil {
return nil
}
if addr, err := c.Get(key); err != nil {
return nil
} else {
h.RLock()
n, ok := h.nodes[addr]
h.RUnlock()
if ok {
return n
} else {
return nil
}
}
}
func (h *hashRing) Mark(name string, node registry.Node, err error) {
h.RLock()
c, _ := h.rings[name]
h.RUnlock()
if c == nil {
c = consistent.New()
if h.replica > 0 {
c.NumberOfReplicas = h.replica
}
}
h.Lock()
if err == nil {
c.Add(node.Addr())
h.nodes[node.Addr()] = node
} else {
c.Remove(node.Addr())
delete(h.nodes, node.Addr())
}
h.rings[name] = c
h.Unlock()
}
func (h *hashRing) String() string {
return "hashring"
}
func NewHashRing(replica int) selector.Strategy {
return &hashRing{
rings: make(map[string]*consistent.Consistent),
nodes: make(map[string]registry.Node),
replica: replica,
}
}