5e4fd8e7db
* swarm/network: Revised depth calculation with tests * swarm/network: WIP remove redundant "full" function * swarm/network: WIP peerpot refactor * swarm/network: Make test methods submethod of peerpot and embed kad * swarm/network: Remove commented out code * swarm/network: Rename health test functions * swarm/network: Too many n's * swarm/network: Change hive Healthy func to accept addresses * swarm/network: Add Healthy proxy method for api in hive * swarm/network: Skip failing test out of scope for PR * swarm/network: Skip all tests dependent on SuggestPeers * swarm/network: Remove commented code and useless kad Pof member * swarm/network: Remove more unused code, add counter on depth test errors * swarm/network: WIP Create Healthy assertion tests * swarm/network: Roll back health related methods receiver change * swarm/network: Hardwire network minproxbinsize in swarm sim * swarm/network: Rework Health test to strict Pending add test for saturation And add test for as many as possible up to saturation * swarm/network: Skip discovery tests (dependent on SuggestPeer) * swarm/network: Remove useless minProxBinSize in stream * swarm/network: Remove unnecessary testing.T param to assert health * swarm/network: Implement t.Helper() in checkHealth * swarm/network: Rename check back to assert now that we have helper magic * swarm/network: Revert WaitTillHealthy change (deferred to nxt PR) * swarm/network: Kademlia tests GotNN => ConnectNN * swarm/network: Renames and comments * swarm/network: Add comments
204 lines
5.5 KiB
Go
204 lines
5.5 KiB
Go
// Copyright 2016 The go-ethereum Authors
|
|
// This file is part of the go-ethereum library.
|
|
//
|
|
// The go-ethereum library is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU Lesser General Public License as published by
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
//
|
|
// The go-ethereum library is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU Lesser General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU Lesser General Public License
|
|
// along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
package network
|
|
|
|
import (
|
|
"context"
|
|
"fmt"
|
|
"sync"
|
|
|
|
"github.com/ethereum/go-ethereum/swarm/pot"
|
|
)
|
|
|
|
// discovery bzz extension for requesting and relaying node address records
|
|
|
|
// Peer wraps BzzPeer and embeds Kademlia overlay connectivity driver
|
|
type Peer struct {
|
|
*BzzPeer
|
|
kad *Kademlia
|
|
sentPeers bool // whether we already sent peer closer to this address
|
|
mtx sync.RWMutex //
|
|
peers map[string]bool // tracks node records sent to the peer
|
|
depth uint8 // the proximity order advertised by remote as depth of saturation
|
|
}
|
|
|
|
// NewPeer constructs a discovery peer
|
|
func NewPeer(p *BzzPeer, kad *Kademlia) *Peer {
|
|
d := &Peer{
|
|
kad: kad,
|
|
BzzPeer: p,
|
|
peers: make(map[string]bool),
|
|
}
|
|
// record remote as seen so we never send a peer its own record
|
|
d.seen(p.BzzAddr)
|
|
return d
|
|
}
|
|
|
|
// HandleMsg is the message handler that delegates incoming messages
|
|
func (d *Peer) HandleMsg(ctx context.Context, msg interface{}) error {
|
|
switch msg := msg.(type) {
|
|
|
|
case *peersMsg:
|
|
return d.handlePeersMsg(msg)
|
|
|
|
case *subPeersMsg:
|
|
return d.handleSubPeersMsg(msg)
|
|
|
|
default:
|
|
return fmt.Errorf("unknown message type: %T", msg)
|
|
}
|
|
}
|
|
|
|
// NotifyDepth sends a message to all connections if depth of saturation is changed
|
|
func NotifyDepth(depth uint8, kad *Kademlia) {
|
|
f := func(val *Peer, po int, _ bool) bool {
|
|
val.NotifyDepth(depth)
|
|
return true
|
|
}
|
|
kad.EachConn(nil, 255, f)
|
|
}
|
|
|
|
// NotifyPeer informs all peers about a newly added node
|
|
func NotifyPeer(p *BzzAddr, k *Kademlia) {
|
|
f := func(val *Peer, po int, _ bool) bool {
|
|
val.NotifyPeer(p, uint8(po))
|
|
return true
|
|
}
|
|
k.EachConn(p.Address(), 255, f)
|
|
}
|
|
|
|
// NotifyPeer notifies the remote node (recipient) about a peer if
|
|
// the peer's PO is within the recipients advertised depth
|
|
// OR the peer is closer to the recipient than self
|
|
// unless already notified during the connection session
|
|
func (d *Peer) NotifyPeer(a *BzzAddr, po uint8) {
|
|
// immediately return
|
|
if (po < d.getDepth() && pot.ProxCmp(d.kad.BaseAddr(), d, a) != 1) || d.seen(a) {
|
|
return
|
|
}
|
|
resp := &peersMsg{
|
|
Peers: []*BzzAddr{a},
|
|
}
|
|
go d.Send(context.TODO(), resp)
|
|
}
|
|
|
|
// NotifyDepth sends a subPeers Msg to the receiver notifying them about
|
|
// a change in the depth of saturation
|
|
func (d *Peer) NotifyDepth(po uint8) {
|
|
go d.Send(context.TODO(), &subPeersMsg{Depth: po})
|
|
}
|
|
|
|
/*
|
|
peersMsg is the message to pass peer information
|
|
It is always a response to a peersRequestMsg
|
|
|
|
The encoding of a peer address is identical the devp2p base protocol peers
|
|
messages: [IP, Port, NodeID],
|
|
Note that a node's FileStore address is not the NodeID but the hash of the NodeID.
|
|
|
|
TODO:
|
|
To mitigate against spurious peers messages, requests should be remembered
|
|
and correctness of responses should be checked
|
|
|
|
If the proxBin of peers in the response is incorrect the sender should be
|
|
disconnected
|
|
*/
|
|
|
|
// peersMsg encapsulates an array of peer addresses
|
|
// used for communicating about known peers
|
|
// relevant for bootstrapping connectivity and updating peersets
|
|
type peersMsg struct {
|
|
Peers []*BzzAddr
|
|
}
|
|
|
|
// String pretty prints a peersMsg
|
|
func (msg peersMsg) String() string {
|
|
return fmt.Sprintf("%T: %v", msg, msg.Peers)
|
|
}
|
|
|
|
// handlePeersMsg called by the protocol when receiving peerset (for target address)
|
|
// list of nodes ([]PeerAddr in peersMsg) is added to the overlay db using the
|
|
// Register interface method
|
|
func (d *Peer) handlePeersMsg(msg *peersMsg) error {
|
|
// register all addresses
|
|
if len(msg.Peers) == 0 {
|
|
return nil
|
|
}
|
|
|
|
for _, a := range msg.Peers {
|
|
d.seen(a)
|
|
NotifyPeer(a, d.kad)
|
|
}
|
|
return d.kad.Register(msg.Peers...)
|
|
}
|
|
|
|
// subPeers msg is communicating the depth of the overlay table of a peer
|
|
type subPeersMsg struct {
|
|
Depth uint8
|
|
}
|
|
|
|
// String returns the pretty printer
|
|
func (msg subPeersMsg) String() string {
|
|
return fmt.Sprintf("%T: request peers > PO%02d. ", msg, msg.Depth)
|
|
}
|
|
|
|
func (d *Peer) handleSubPeersMsg(msg *subPeersMsg) error {
|
|
if !d.sentPeers {
|
|
d.setDepth(msg.Depth)
|
|
var peers []*BzzAddr
|
|
d.kad.EachConn(d.Over(), 255, func(p *Peer, po int, isproxbin bool) bool {
|
|
if pob, _ := Pof(d, d.kad.BaseAddr(), 0); pob > po {
|
|
return false
|
|
}
|
|
if !d.seen(p.BzzAddr) {
|
|
peers = append(peers, p.BzzAddr)
|
|
}
|
|
return true
|
|
})
|
|
if len(peers) > 0 {
|
|
go d.Send(context.TODO(), &peersMsg{Peers: peers})
|
|
}
|
|
}
|
|
d.sentPeers = true
|
|
return nil
|
|
}
|
|
|
|
// seen takes an peer address and checks if it was sent to a peer already
|
|
// if not, marks the peer as sent
|
|
func (d *Peer) seen(p *BzzAddr) bool {
|
|
d.mtx.Lock()
|
|
defer d.mtx.Unlock()
|
|
k := string(p.Address())
|
|
if d.peers[k] {
|
|
return true
|
|
}
|
|
d.peers[k] = true
|
|
return false
|
|
}
|
|
|
|
func (d *Peer) getDepth() uint8 {
|
|
d.mtx.RLock()
|
|
defer d.mtx.RUnlock()
|
|
return d.depth
|
|
}
|
|
|
|
func (d *Peer) setDepth(depth uint8) {
|
|
d.mtx.Lock()
|
|
defer d.mtx.Unlock()
|
|
d.depth = depth
|
|
}
|