Official Go implementation of the Ethereum protocol

You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

Felix Lange d36276d85e p2p/dnsdisc: fix hot-spin when all trees are empty (#22313) ... In the random sync algorithm used by the DNS node iterator, we first pick a random tree and then perform one sync action on that tree. This happens in a loop until any node is found. If no trees contain any nodes, the iterator will enter a hot loop spinning at 100% CPU. The fix is complicated. The iterator now checks if a meaningful sync action can be performed on any tree. If there is nothing to do, it waits for the next root record recheck time to arrive and then tries again. Fixes #22306		4 years ago
..
client.go	p2p/dnsdisc: fix hot-spin when all trees are empty (#22313)	4 years ago
client_test.go	p2p/dnsdisc: fix hot-spin when all trees are empty (#22313)	4 years ago
doc.go	p2p/dnsdisc: add implementation of EIP-1459 (#20094)	5 years ago
error.go	p2p/dnsdisc: add implementation of EIP-1459 (#20094)	5 years ago
sync.go	p2p/dnsdisc: fix hot-spin when all trees are empty (#22313)	4 years ago
sync_test.go	p2p/dnsdisc: add enode.Iterator API (#20437)	5 years ago
tree.go	p2p/dnsdisc: add enode.Iterator API (#20437)	5 years ago
tree_test.go	p2p/dnsdisc: add enode.Iterator API (#20437)	5 years ago