roysc/plugeth
1
0
Fork 0
forked from cerc-io/plugeth
Code Pull Requests Activity

p2p/discovery: fix a cornercase loop if no seeds or bootnodes are known

Browse Source
This commit is contained in:
Péter Szilágyi 2015-05-25 16:23:16 +03:00 committed by Felix Lange
parent f539ed1e66
commit 3630432dfb
1 changed files with 9 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
p2p/discover/table.go
View File

@ -278,12 +278,16 @@ func (tab *Table) refresh() {
for _, seed := range seeds {
glog.V(logger.Debug).Infoln("Seeding network with", seed)
}
peers := append(tab.nursery, seeds...)
// Bootstrap the table with a self lookup
all := tab.bondall(append(tab.nursery, seeds...))
tab.mutex.Lock()
tab.add(all)
tab.mutex.Unlock()
tab.Lookup(tab.self.ID)
if len(peers) > 0 {
tab.mutex.Lock()
tab.add(peers)
tab.mutex.Unlock()
tab.Lookup(tab.self.ID)
}
// TODO: the Kademlia paper says that we're supposed to perform
// random lookups in all buckets further away than our closest neighbor.
}