mirror of
https://github.com/cwinfo/yggdrasil-go.git
synced 2024-11-22 21:10:29 +00:00
store one callback instead of many, needed to prevent search failures if there are multiple outstanding packets
This commit is contained in:
parent
9937a6102e
commit
7954fa3c33
@ -61,7 +61,7 @@ type dht struct {
|
|||||||
nodeID NodeID
|
nodeID NodeID
|
||||||
peers chan *dhtInfo // other goroutines put incoming dht updates here
|
peers chan *dhtInfo // other goroutines put incoming dht updates here
|
||||||
reqs map[dhtReqKey]time.Time // Keeps track of recent outstanding requests
|
reqs map[dhtReqKey]time.Time // Keeps track of recent outstanding requests
|
||||||
callbacks map[dhtReqKey][]func(*dhtRes) // Search and admin lookup callbacks
|
callbacks map[dhtReqKey]dht_callbackInfo // Search and admin lookup callbacks
|
||||||
// These next two could be replaced by a single linked list or similar...
|
// These next two could be replaced by a single linked list or similar...
|
||||||
table map[NodeID]*dhtInfo
|
table map[NodeID]*dhtInfo
|
||||||
imp []*dhtInfo
|
imp []*dhtInfo
|
||||||
@ -72,7 +72,7 @@ func (t *dht) init(c *Core) {
|
|||||||
t.core = c
|
t.core = c
|
||||||
t.nodeID = *t.core.GetNodeID()
|
t.nodeID = *t.core.GetNodeID()
|
||||||
t.peers = make(chan *dhtInfo, 1024)
|
t.peers = make(chan *dhtInfo, 1024)
|
||||||
t.callbacks = make(map[dhtReqKey][]func(*dhtRes))
|
t.callbacks = make(map[dhtReqKey]dht_callbackInfo)
|
||||||
t.reset()
|
t.reset()
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -202,26 +202,25 @@ func (t *dht) sendRes(res *dhtRes, req *dhtReq) {
|
|||||||
t.core.router.out(packet)
|
t.core.router.out(packet)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
type dht_callbackInfo struct {
|
||||||
|
f func(*dhtRes)
|
||||||
|
time time.Time
|
||||||
|
}
|
||||||
|
|
||||||
// Adds a callback and removes it after some timeout.
|
// Adds a callback and removes it after some timeout.
|
||||||
func (t *dht) addCallback(rq *dhtReqKey, callback func(*dhtRes)) {
|
func (t *dht) addCallback(rq *dhtReqKey, callback func(*dhtRes)) {
|
||||||
t.callbacks[*rq] = append(t.callbacks[*rq], callback)
|
info := dht_callbackInfo{callback, time.Now().Add(6 * time.Second)}
|
||||||
go func() {
|
t.callbacks[*rq] = info
|
||||||
time.Sleep(6 * time.Second)
|
|
||||||
t.core.router.admin <- func() {
|
|
||||||
delete(t.callbacks, *rq)
|
|
||||||
}
|
|
||||||
}()
|
|
||||||
}
|
}
|
||||||
|
|
||||||
// Reads a lookup response, checks that we had sent a matching request, and processes the response info.
|
// Reads a lookup response, checks that we had sent a matching request, and processes the response info.
|
||||||
// This mainly consists of updating the node we asked in our DHT (they responded, so we know they're still alive), and deciding if we want to do anything with their responses
|
// This mainly consists of updating the node we asked in our DHT (they responded, so we know they're still alive), and deciding if we want to do anything with their responses
|
||||||
func (t *dht) handleRes(res *dhtRes) {
|
func (t *dht) handleRes(res *dhtRes) {
|
||||||
rq := dhtReqKey{res.Key, res.Dest}
|
rq := dhtReqKey{res.Key, res.Dest}
|
||||||
for _, callback := range t.callbacks[rq] {
|
if callback, isIn := t.callbacks[rq]; isIn {
|
||||||
callback(res)
|
callback.f(res)
|
||||||
}
|
|
||||||
delete(t.callbacks, rq)
|
delete(t.callbacks, rq)
|
||||||
t.core.searches.handleDHTRes(res)
|
}
|
||||||
_, isIn := t.reqs[rq]
|
_, isIn := t.reqs[rq]
|
||||||
if !isIn {
|
if !isIn {
|
||||||
return
|
return
|
||||||
@ -263,7 +262,7 @@ func (t *dht) sendReq(req *dhtReq, dest *dhtInfo) {
|
|||||||
}
|
}
|
||||||
packet := p.encode()
|
packet := p.encode()
|
||||||
t.core.router.out(packet)
|
t.core.router.out(packet)
|
||||||
rq := dhtReqKey{req.Key, req.Dest}
|
rq := dhtReqKey{dest.key, req.Dest}
|
||||||
t.reqs[rq] = time.Now()
|
t.reqs[rq] = time.Now()
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -293,10 +292,12 @@ func (t *dht) doMaintenance() {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
t.reqs = newReqs
|
t.reqs = newReqs
|
||||||
newCallbacks := make(map[dhtReqKey][]func(*dhtRes), len(t.callbacks))
|
newCallbacks := make(map[dhtReqKey]dht_callbackInfo, len(t.callbacks))
|
||||||
for key, callback := range t.callbacks {
|
for key, callback := range t.callbacks {
|
||||||
|
if now.Before(callback.time) {
|
||||||
newCallbacks[key] = callback
|
newCallbacks[key] = callback
|
||||||
}
|
}
|
||||||
|
}
|
||||||
t.callbacks = newCallbacks
|
t.callbacks = newCallbacks
|
||||||
for infoID, info := range t.table {
|
for infoID, info := range t.table {
|
||||||
if now.Sub(info.recv) > time.Minute || info.pings > 3 {
|
if now.Sub(info.recv) > time.Minute || info.pings > 3 {
|
||||||
|
Loading…
Reference in New Issue
Block a user