good morning!!!!

Skip to content
Snippets Groups Projects
Forked from github / maticnetwork / bor
Source project has a limited visibility.
  • Felix Lange's avatar
    191364c3
    p2p/dnsdisc: add enode.Iterator API (#20437) · 191364c3
    Felix Lange authored
    * p2p/dnsdisc: add support for enode.Iterator
    
    This changes the dnsdisc.Client API to support the enode.Iterator
    interface.
    
    * p2p/dnsdisc: rate-limit DNS requests
    
    * p2p/dnsdisc: preserve linked trees across root updates
    
    This improves the way links are handled when the link root changes.
    Previously, sync would simply remove all links from the current tree and
    garbage-collect all unreachable trees before syncing the new list of
    links.
    
    This behavior isn't great in certain cases: Consider a structure where
    trees A, B, and C reference each other and D links to A. If D's link
    root changed, the sync code would first remove trees A, B and C, only to
    re-sync them later when the link to A was found again.
    
    The fix for this problem is to track the current set of links in each
    clientTree and removing old links only AFTER all links are synced.
    
    * p2p/dnsdisc: deflake iterator test
    
    * cmd/devp2p: adapt dnsClient to new p2p/dnsdisc API
    
    * p2p/dnsdisc: tiny comment fix
    191364c3
    History
    p2p/dnsdisc: add enode.Iterator API (#20437)
    Felix Lange authored
    * p2p/dnsdisc: add support for enode.Iterator
    
    This changes the dnsdisc.Client API to support the enode.Iterator
    interface.
    
    * p2p/dnsdisc: rate-limit DNS requests
    
    * p2p/dnsdisc: preserve linked trees across root updates
    
    This improves the way links are handled when the link root changes.
    Previously, sync would simply remove all links from the current tree and
    garbage-collect all unreachable trees before syncing the new list of
    links.
    
    This behavior isn't great in certain cases: Consider a structure where
    trees A, B, and C reference each other and D links to A. If D's link
    root changed, the sync code would first remove trees A, B and C, only to
    re-sync them later when the link to A was found again.
    
    The fix for this problem is to track the current set of links in each
    clientTree and removing old links only AFTER all links are synced.
    
    * p2p/dnsdisc: deflake iterator test
    
    * cmd/devp2p: adapt dnsClient to new p2p/dnsdisc API
    
    * p2p/dnsdisc: tiny comment fix
Code owners
Assign users and groups as approvers for specific file changes. Learn more.
This project manages its dependencies using Go Modules. Learn more