/
tracker.go
198 lines (169 loc) · 4.16 KB
/
tracker.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
package pushpull
import (
"github.com/idena-network/idena-go/common"
"github.com/libp2p/go-libp2p-core/peer"
"sort"
"sync"
"time"
)
const (
maxPendingPushes = 20000
defaultPullDelay = time.Second * 10
)
type PendingPulls struct {
Id peer.ID
Hash common.Hash128
}
type pendingRequestTime struct {
req PendingPulls
time time.Time
}
type PendingPushTracker interface {
RegisterPull(hash common.Hash128)
AddPendingPush(id peer.ID, hash common.Hash128)
Requests() chan PendingPulls
Run()
SetHolder(holder Holder)
RemovePull(hash common.Hash128)
}
type DefaultPushTracker struct {
// After that delay a node will try to pull pushpull if it hasn't been downloaded previously
pullDelay time.Duration
ppMutex sync.Mutex
//outgoing pulls to another peers
requests chan PendingPulls
//the map contains a time of sending the last pull request
activePulls *sync.Map
//pending pushes
pendingPushes *sortedPendingPushes
holder Holder
}
func NewDefaultPushTracker(pullDelay time.Duration) *DefaultPushTracker {
if pullDelay == 0 {
pullDelay = defaultPullDelay
}
return &DefaultPushTracker{
activePulls: &sync.Map{},
pendingPushes: newSortedPendingPushes(),
requests: make(chan PendingPulls, 1000),
pullDelay: pullDelay,
}
}
func (d *DefaultPushTracker) RemovePull(hash common.Hash128) {
d.activePulls.Delete(hash)
}
func (d *DefaultPushTracker) SetHolder(holder Holder) {
d.holder = holder
}
func (d *DefaultPushTracker) RegisterPull(hash common.Hash128) {
d.activePulls.Store(hash, time.Now())
}
func (d *DefaultPushTracker) AddPendingPush(id peer.ID, hash common.Hash128) {
if d.holder.Has(hash) || d.pendingPushes.Len() > maxPendingPushes {
return
}
d.ppMutex.Lock()
defer d.ppMutex.Unlock()
if timestamp, ok := d.activePulls.Load(hash); ok {
newReq := pendingRequestTime{PendingPulls{Id: id, Hash: hash}, timestamp.(time.Time)}
d.pendingPushes.Add(newReq)
}
}
func (d *DefaultPushTracker) Requests() chan PendingPulls {
return d.requests
}
func (d *DefaultPushTracker) Run() {
go d.loop()
go d.gc()
}
// infinity loop for processing pending pushes
func (d *DefaultPushTracker) loop() {
for {
if d.pendingPushes.Len() == 0 {
time.Sleep(time.Millisecond * 10)
continue
}
obj := d.pendingPushes.Peek(0)
since := time.Now().Sub(obj.time)
if since < d.pullDelay {
time.Sleep(d.pullDelay - since)
}
if d.holder.Has(obj.req.Hash) {
d.ppMutex.Lock()
d.pendingPushes.Remove(0)
d.ppMutex.Unlock()
continue
}
d.ppMutex.Lock()
if activePullTime, ok := d.activePulls.Load(obj.req.Hash); !ok {
d.pendingPushes.Remove(0)
d.ppMutex.Unlock()
continue
} else {
t := activePullTime.(time.Time)
if t.After(obj.time) {
d.pendingPushes.MoveWithNewTime(0, t)
d.ppMutex.Unlock()
continue
}
d.pendingPushes.Remove(0)
d.ppMutex.Unlock()
}
d.requests <- obj.req
d.RegisterPull(obj.req.Hash)
}
}
func (d *DefaultPushTracker) gc() {
for {
time.Sleep(time.Minute)
d.activePulls.Range(func(key, value interface{}) bool {
if time.Since(value.(time.Time)) > time.Minute*5 {
d.activePulls.Delete(key)
}
return true
})
}
}
type sortedPendingPushes struct {
list []pendingRequestTime
lock sync.Mutex
}
func newSortedPendingPushes() *sortedPendingPushes {
return &sortedPendingPushes{list: make([]pendingRequestTime, 0)}
}
func (s *sortedPendingPushes) Add(req pendingRequestTime) {
s.lock.Lock()
i := sort.Search(len(s.list), func(i int) bool {
return s.list[i].time.After(req.time)
})
s.list = append(s.list, pendingRequestTime{})
copy(s.list[i+1:], s.list[i:])
s.list[i] = req
s.lock.Unlock()
}
func (s *sortedPendingPushes) Len() int {
s.lock.Lock()
l := len(s.list)
s.lock.Unlock()
return l
}
func (s *sortedPendingPushes) Remove(i int) {
s.lock.Lock()
copy(s.list[i:], s.list[i+1:])
s.list[len(s.list)-1] = pendingRequestTime{}
s.list = s.list[:len(s.list)-1]
s.lock.Unlock()
}
func (s *sortedPendingPushes) MoveWithNewTime(i int, newTime time.Time) {
copy := pendingRequestTime{
req: s.list[i].req,
time: newTime,
}
s.Remove(i)
s.Add(copy)
}
func (s *sortedPendingPushes) Peek(i int) pendingRequestTime {
s.lock.Lock()
defer s.lock.Unlock()
return s.list[i]
}