forked from cenkalti/rain
/
dht.go
71 lines (61 loc) 路 1.22 KB
/
dht.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
package announcer
import (
"time"
"github.com/cenkalti/rain/internal/logger"
)
type DHTAnnouncer struct {
lastAnnounce time.Time
needMorePeers bool
needMorePeersC chan bool
closeC chan struct{}
doneC chan struct{}
}
func NewDHTAnnouncer() *DHTAnnouncer {
return &DHTAnnouncer{
needMorePeersC: make(chan bool),
closeC: make(chan struct{}),
doneC: make(chan struct{}),
}
}
func (a *DHTAnnouncer) Close() {
close(a.closeC)
<-a.doneC
}
func (a *DHTAnnouncer) NeedMorePeers(val bool) {
select {
case a.needMorePeersC <- val:
case <-a.doneC:
}
}
func (a *DHTAnnouncer) Run(announceFunc func(), interval, minInterval time.Duration, l logger.Logger) {
defer close(a.doneC)
ticker := time.NewTicker(interval)
defer ticker.Stop()
announce := func() {
announceFunc()
a.lastAnnounce = time.Now()
}
announce()
for {
select {
case <-ticker.C:
announce()
case val := <-a.needMorePeersC:
if val {
if !a.needMorePeers {
announce()
ticker.Stop()
ticker = time.NewTicker(minInterval)
}
} else {
if a.needMorePeers {
ticker.Stop()
ticker = time.NewTicker(interval)
}
}
a.needMorePeers = val
case <-a.closeC:
return
}
}
}