Cache discovery results up to five minutes (fixes #358)
This commit is contained in:
parent
ace87ad7bb
commit
49a0bfccba
@ -25,8 +25,9 @@ type Discoverer struct {
|
|||||||
localBcastIntv time.Duration
|
localBcastIntv time.Duration
|
||||||
globalBcastIntv time.Duration
|
globalBcastIntv time.Duration
|
||||||
errorRetryIntv time.Duration
|
errorRetryIntv time.Duration
|
||||||
|
cacheLifetime time.Duration
|
||||||
beacon *beacon.Beacon
|
beacon *beacon.Beacon
|
||||||
registry map[protocol.NodeID][]string
|
registry map[protocol.NodeID][]cacheEntry
|
||||||
registryLock sync.RWMutex
|
registryLock sync.RWMutex
|
||||||
extServer string
|
extServer string
|
||||||
extPort uint16
|
extPort uint16
|
||||||
@ -39,6 +40,11 @@ type Discoverer struct {
|
|||||||
globalBcastStop chan bool
|
globalBcastStop chan bool
|
||||||
}
|
}
|
||||||
|
|
||||||
|
type cacheEntry struct {
|
||||||
|
addr string
|
||||||
|
seen time.Time
|
||||||
|
}
|
||||||
|
|
||||||
var (
|
var (
|
||||||
ErrIncorrectMagic = errors.New("incorrect magic number")
|
ErrIncorrectMagic = errors.New("incorrect magic number")
|
||||||
)
|
)
|
||||||
@ -59,8 +65,9 @@ func NewDiscoverer(id protocol.NodeID, addresses []string, localPort int) (*Disc
|
|||||||
localBcastIntv: 30 * time.Second,
|
localBcastIntv: 30 * time.Second,
|
||||||
globalBcastIntv: 1800 * time.Second,
|
globalBcastIntv: 1800 * time.Second,
|
||||||
errorRetryIntv: 60 * time.Second,
|
errorRetryIntv: 60 * time.Second,
|
||||||
|
cacheLifetime: 5 * time.Minute,
|
||||||
beacon: b,
|
beacon: b,
|
||||||
registry: make(map[protocol.NodeID][]string),
|
registry: make(map[protocol.NodeID][]cacheEntry),
|
||||||
}
|
}
|
||||||
|
|
||||||
go disc.recvAnnouncements()
|
go disc.recvAnnouncements()
|
||||||
@ -97,14 +104,28 @@ func (d *Discoverer) ExtAnnounceOK() bool {
|
|||||||
|
|
||||||
func (d *Discoverer) Lookup(node protocol.NodeID) []string {
|
func (d *Discoverer) Lookup(node protocol.NodeID) []string {
|
||||||
d.registryLock.Lock()
|
d.registryLock.Lock()
|
||||||
addr, ok := d.registry[node]
|
cached := d.filterCached(d.registry[node])
|
||||||
d.registryLock.Unlock()
|
d.registryLock.Unlock()
|
||||||
|
|
||||||
if ok {
|
if len(cached) > 0 {
|
||||||
return addr
|
addrs := make([]string, len(cached))
|
||||||
|
for i := range cached {
|
||||||
|
addrs[i] = cached[i].addr
|
||||||
|
}
|
||||||
|
return addrs
|
||||||
} else if len(d.extServer) != 0 {
|
} else if len(d.extServer) != 0 {
|
||||||
// We might want to cache this, but not permanently so it needs some intelligence
|
addrs := d.externalLookup(node)
|
||||||
return d.externalLookup(node)
|
cached = make([]cacheEntry, len(addrs))
|
||||||
|
for i := range addrs {
|
||||||
|
cached[i] = cacheEntry{
|
||||||
|
addr: addrs[i],
|
||||||
|
seen: time.Now(),
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
d.registryLock.Lock()
|
||||||
|
d.registry[node] = cached
|
||||||
|
d.registryLock.Unlock()
|
||||||
}
|
}
|
||||||
return nil
|
return nil
|
||||||
}
|
}
|
||||||
@ -119,11 +140,11 @@ func (d *Discoverer) Hint(node string, addrs []string) {
|
|||||||
})
|
})
|
||||||
}
|
}
|
||||||
|
|
||||||
func (d *Discoverer) All() map[protocol.NodeID][]string {
|
func (d *Discoverer) All() map[protocol.NodeID][]cacheEntry {
|
||||||
d.registryLock.RLock()
|
d.registryLock.RLock()
|
||||||
nodes := make(map[protocol.NodeID][]string, len(d.registry))
|
nodes := make(map[protocol.NodeID][]cacheEntry, len(d.registry))
|
||||||
for node, addrs := range d.registry {
|
for node, addrs := range d.registry {
|
||||||
addrsCopy := make([]string, len(addrs))
|
addrsCopy := make([]cacheEntry, len(addrs))
|
||||||
copy(addrsCopy, addrs)
|
copy(addrsCopy, addrs)
|
||||||
nodes[node] = addrsCopy
|
nodes[node] = addrsCopy
|
||||||
}
|
}
|
||||||
@ -163,21 +184,10 @@ func (d *Discoverer) sendLocalAnnouncements() {
|
|||||||
Magic: AnnouncementMagic,
|
Magic: AnnouncementMagic,
|
||||||
This: Node{d.myID[:], addrs},
|
This: Node{d.myID[:], addrs},
|
||||||
}
|
}
|
||||||
|
msg := pkt.MarshalXDR()
|
||||||
|
|
||||||
for {
|
for {
|
||||||
pkt.Extra = nil
|
d.beacon.Send(msg)
|
||||||
d.registryLock.RLock()
|
|
||||||
for node, addrs := range d.registry {
|
|
||||||
if len(pkt.Extra) == 16 {
|
|
||||||
break
|
|
||||||
}
|
|
||||||
|
|
||||||
anode := Node{node[:], resolveAddrs(addrs)}
|
|
||||||
pkt.Extra = append(pkt.Extra, anode)
|
|
||||||
}
|
|
||||||
d.registryLock.RUnlock()
|
|
||||||
|
|
||||||
d.beacon.Send(pkt.MarshalXDR())
|
|
||||||
|
|
||||||
select {
|
select {
|
||||||
case <-d.localBcastTick:
|
case <-d.localBcastTick:
|
||||||
@ -279,7 +289,7 @@ func (d *Discoverer) recvAnnouncements() {
|
|||||||
buf, addr := d.beacon.Recv()
|
buf, addr := d.beacon.Recv()
|
||||||
|
|
||||||
if debug {
|
if debug {
|
||||||
l.Debugf("discover: read announcement:\n%s", hex.Dump(buf))
|
l.Debugf("discover: read announcement from %s:\n%s", addr, hex.Dump(buf))
|
||||||
}
|
}
|
||||||
|
|
||||||
var pkt Announce
|
var pkt Announce
|
||||||
@ -288,20 +298,9 @@ func (d *Discoverer) recvAnnouncements() {
|
|||||||
continue
|
continue
|
||||||
}
|
}
|
||||||
|
|
||||||
if debug {
|
|
||||||
l.Debugf("discover: parsed announcement: %#v", pkt)
|
|
||||||
}
|
|
||||||
|
|
||||||
var newNode bool
|
var newNode bool
|
||||||
if bytes.Compare(pkt.This.ID, d.myID[:]) != 0 {
|
if bytes.Compare(pkt.This.ID, d.myID[:]) != 0 {
|
||||||
newNode = d.registerNode(addr, pkt.This)
|
newNode = d.registerNode(addr, pkt.This)
|
||||||
for _, node := range pkt.Extra {
|
|
||||||
if bytes.Compare(node.ID, d.myID[:]) != 0 {
|
|
||||||
if d.registerNode(nil, node) {
|
|
||||||
newNode = true
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
||||||
if newNode {
|
if newNode {
|
||||||
@ -313,41 +312,57 @@ func (d *Discoverer) recvAnnouncements() {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func (d *Discoverer) registerNode(addr net.Addr, node Node) bool {
|
func (d *Discoverer) registerNode(addr net.Addr, node Node) bool {
|
||||||
var addrs []string
|
var id protocol.NodeID
|
||||||
|
copy(id[:], node.ID)
|
||||||
|
|
||||||
|
d.registryLock.RLock()
|
||||||
|
current := d.filterCached(d.registry[id])
|
||||||
|
d.registryLock.RUnlock()
|
||||||
|
|
||||||
|
orig := current
|
||||||
|
|
||||||
for _, a := range node.Addresses {
|
for _, a := range node.Addresses {
|
||||||
var nodeAddr string
|
var nodeAddr string
|
||||||
if len(a.IP) > 0 {
|
if len(a.IP) > 0 {
|
||||||
nodeAddr = fmt.Sprintf("%s:%d", net.IP(a.IP), a.Port)
|
nodeAddr = fmt.Sprintf("%s:%d", net.IP(a.IP), a.Port)
|
||||||
addrs = append(addrs, nodeAddr)
|
|
||||||
} else if addr != nil {
|
} else if addr != nil {
|
||||||
ua := addr.(*net.UDPAddr)
|
ua := addr.(*net.UDPAddr)
|
||||||
ua.Port = int(a.Port)
|
ua.Port = int(a.Port)
|
||||||
nodeAddr = ua.String()
|
nodeAddr = ua.String()
|
||||||
addrs = append(addrs, nodeAddr)
|
|
||||||
}
|
}
|
||||||
}
|
for i := range current {
|
||||||
if len(addrs) == 0 {
|
if current[i].addr == nodeAddr {
|
||||||
if debug {
|
current[i].seen = time.Now()
|
||||||
l.Debugln("discover: no valid address for", node.ID)
|
goto done
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
current = append(current, cacheEntry{
|
||||||
|
addr: nodeAddr,
|
||||||
|
seen: time.Now(),
|
||||||
|
})
|
||||||
|
done:
|
||||||
}
|
}
|
||||||
|
|
||||||
if debug {
|
if debug {
|
||||||
l.Debugf("discover: register: %v -> %#v", node.ID, addrs)
|
l.Debugf("discover: register: %v -> %v", id, current)
|
||||||
}
|
}
|
||||||
var id protocol.NodeID
|
|
||||||
copy(id[:], node.ID)
|
|
||||||
d.registryLock.Lock()
|
d.registryLock.Lock()
|
||||||
_, seen := d.registry[id]
|
d.registry[id] = current
|
||||||
d.registry[id] = addrs
|
|
||||||
d.registryLock.Unlock()
|
d.registryLock.Unlock()
|
||||||
|
|
||||||
if !seen {
|
if len(current) > len(orig) {
|
||||||
|
addrs := make([]string, len(current))
|
||||||
|
for i := range current {
|
||||||
|
addrs[i] = current[i].addr
|
||||||
|
}
|
||||||
events.Default.Log(events.NodeDiscovered, map[string]interface{}{
|
events.Default.Log(events.NodeDiscovered, map[string]interface{}{
|
||||||
"node": id.String(),
|
"node": id.String(),
|
||||||
"addrs": addrs,
|
"addrs": addrs,
|
||||||
})
|
})
|
||||||
}
|
}
|
||||||
return !seen
|
|
||||||
|
return len(current) > len(orig)
|
||||||
}
|
}
|
||||||
|
|
||||||
func (d *Discoverer) externalLookup(node protocol.NodeID) []string {
|
func (d *Discoverer) externalLookup(node protocol.NodeID) []string {
|
||||||
@ -411,10 +426,6 @@ func (d *Discoverer) externalLookup(node protocol.NodeID) []string {
|
|||||||
return nil
|
return nil
|
||||||
}
|
}
|
||||||
|
|
||||||
if debug {
|
|
||||||
l.Debugf("discover: parsed external: %#v", pkt)
|
|
||||||
}
|
|
||||||
|
|
||||||
var addrs []string
|
var addrs []string
|
||||||
for _, a := range pkt.This.Addresses {
|
for _, a := range pkt.This.Addresses {
|
||||||
nodeAddr := fmt.Sprintf("%s:%d", net.IP(a.IP), a.Port)
|
nodeAddr := fmt.Sprintf("%s:%d", net.IP(a.IP), a.Port)
|
||||||
@ -423,6 +434,21 @@ func (d *Discoverer) externalLookup(node protocol.NodeID) []string {
|
|||||||
return addrs
|
return addrs
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func (d *Discoverer) filterCached(c []cacheEntry) []cacheEntry {
|
||||||
|
for i := 0; i < len(c); {
|
||||||
|
if ago := time.Since(c[i].seen); ago > d.cacheLifetime {
|
||||||
|
if debug {
|
||||||
|
l.Debugf("removing cached address %s: seen %v ago", c[i].addr, ago)
|
||||||
|
}
|
||||||
|
c[i] = c[len(c)-1]
|
||||||
|
c = c[:len(c)-1]
|
||||||
|
} else {
|
||||||
|
i++
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return c
|
||||||
|
}
|
||||||
|
|
||||||
func addrToAddr(addr *net.TCPAddr) Address {
|
func addrToAddr(addr *net.TCPAddr) Address {
|
||||||
if len(addr.IP) == 0 || addr.IP.IsUnspecified() {
|
if len(addr.IP) == 0 || addr.IP.IsUnspecified() {
|
||||||
return Address{Port: uint16(addr.Port)}
|
return Address{Port: uint16(addr.Port)}
|
||||||
|
|||||||
Loading…
x
Reference in New Issue
Block a user