-
-
Notifications
You must be signed in to change notification settings - Fork 76
/
node.go
192 lines (160 loc) · 3.53 KB
/
node.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
package ktable
import (
"github.com/bitmagnet-io/bitmagnet/internal/protocol"
"net/netip"
"time"
)
type nodeKeyspace struct {
keyspace[netip.AddrPort, NodeOption, Node, *node]
}
func (k *nodeKeyspace) getLastRespondedBefore(t time.Time) []Node {
var peers []Node
for _, it := range k.items {
if it.lastRespondedAt.Before(t) {
peers = append(peers, it)
}
}
return peers
}
func (k *nodeKeyspace) getCandidatesForSampleInfoHashes(n int) []*node {
var candidates []*node
for _, it := range k.items {
if !it.IsSampleInfoHashesCandidate() {
continue
}
candidates = append(candidates, it)
if len(candidates) == n {
break
}
}
return candidates
}
type Node interface {
keyspaceItem
Addr() netip.AddrPort
Time() time.Time
Dropped() bool
IsSampleInfoHashesCandidate() bool
}
type nodeBase struct {
id ID
addr netip.AddrPort
}
func NewNode(id ID, addr netip.AddrPort) Node {
return nodeBase{
id: id,
addr: addr,
}
}
func (p nodeBase) ID() protocol.ID {
return p.id
}
func (p nodeBase) Addr() netip.AddrPort {
return p.addr
}
func (p nodeBase) Time() time.Time {
return time.Time{}
}
func (p nodeBase) Dropped() bool {
return false
}
func (p nodeBase) IsSampleInfoHashesCandidate() bool {
return true
}
type node struct {
nodeBase
discoveredAt time.Time
lastRespondedAt time.Time
dropReason error
bep51Support protocolSupport
sampledNum int
lastDiscoveredNum int
totalNum int
nextSampleInfoHashesTime time.Time
reverseMap *reverseMap
}
type NodeOption interface {
apply(*node)
}
type nodeOption struct {
fn func(*node)
}
func (p nodeOption) apply(peer *node) {
p.fn(peer)
}
type protocolSupport int
const (
protocolSupportUnknown protocolSupport = iota
protocolSupportYes
protocolSupportNo
)
var _ keyspaceItemPrivate[netip.AddrPort, NodeOption, Node] = (*node)(nil)
func (n *node) update(addr netip.AddrPort) {
if n.addr != addr {
n.reverseMap.dropAddr(n.addr.Addr())
}
n.addr = addr
n.reverseMap.putAddrPeerID(addr.Addr(), n.id)
}
func (n *node) apply(option NodeOption) {
option.apply(n)
}
func (n *node) drop(reason error) {
n.dropReason = reason
n.reverseMap.dropAddr(n.addr.Addr())
}
func (n *node) public() Node {
return n
}
func (n *node) Time() time.Time {
return n.lastRespondedAt
}
func (n *node) Dropped() bool {
return n.dropReason != nil
}
func (n *node) IsSampleInfoHashesCandidate() bool {
now := time.Now()
threshold := now.Add(-(5 * time.Second))
return n.bep51Support != protocolSupportNo &&
n.nextSampleInfoHashesTime.Before(now) &&
n.lastRespondedAt.Before(threshold)
}
func (n *node) olderThan(t time.Time) bool {
return n.lastRespondedAt.Before(t)
}
func NodeResponded() NodeOption {
return nodeOption{
fn: func(n *node) {
n.lastRespondedAt = time.Now()
},
}
}
func NodeBep51Support(supported bool) NodeOption {
return nodeOption{
fn: func(n *node) {
s := protocolSupportNo
if supported {
s = protocolSupportYes
}
n.bep51Support = s
},
}
}
func NodeSampleInfoHashesRes(discoveredNum int, totalNum int, nextSampleTime time.Time) NodeOption {
return nodeOption{
fn: func(n *node) {
n.sampledNum += discoveredNum
n.lastDiscoveredNum = discoveredNum
n.totalNum += totalNum
// a crude way of deprioritizing nodes that gave us no new samples:
if discoveredNum == 0 {
now := time.Now()
if nextSampleTime.Before(now) {
nextSampleTime = now
}
nextSampleTime = nextSampleTime.Add(5 * time.Minute)
}
n.nextSampleInfoHashesTime = nextSampleTime
},
}
}