p2p/simulations: remove everything related to pivot from connect.go

As the concept and the related functionality was not used anywhere.
This commit is contained in:
Ferenc Szabo 2018-12-20 14:45:25 +01:00
parent 566901f92d
commit f8c18644a9
4 changed files with 6 additions and 86 deletions

View file

@ -25,21 +25,8 @@ import (
var ( var (
ErrNodeNotFound = errors.New("node not found") ErrNodeNotFound = errors.New("node not found")
ErrNoPivotNode = errors.New("no pivot node set")
) )
// ConnectToPivotNode connects the node with provided NodeID
// to the pivot node, already set by Network.SetPivotNode method.
// It is useful when constructing a star network topology
// when Network adds and removes nodes dynamically.
func (net *Network) ConnectToPivotNode(id enode.ID) (err error) {
pivot := net.GetPivotNode()
if pivot == nil {
return ErrNoPivotNode
}
return net.connect(pivot.ID(), id)
}
// ConnectToLastNode connects the node with provided NodeID // ConnectToLastNode connects the node with provided NodeID
// to the last node that is up, and avoiding connection to self. // to the last node that is up, and avoiding connection to self.
// It is useful when constructing a chain network topology // It is useful when constructing a chain network topology
@ -115,35 +102,23 @@ func (net *Network) ConnectNodesRing(ids []enode.ID) (err error) {
return net.connect(ids[l-1], ids[0]) return net.connect(ids[l-1], ids[0])
} }
// ConnectNodesStar connects all nodes in a star topology // ConnectNodesStar connects all nodes into a star topology
// with the center at provided NodeID.
// If ids argument is nil, all nodes that are up will be connected. // If ids argument is nil, all nodes that are up will be connected.
func (net *Network) ConnectNodesStar(pivot enode.ID, ids []enode.ID) (err error) { func (net *Network) ConnectNodesStar(ids []enode.ID, center enode.ID) (err error) {
if ids == nil { if ids == nil {
ids = net.getUpNodeIDs() ids = net.getUpNodeIDs()
} }
for _, id := range ids { for _, id := range ids {
if pivot == id { if center == id {
continue continue
} }
if err := net.connect(pivot, id); err != nil { if err := net.connect(center, id); err != nil {
return err return err
} }
} }
return nil return nil
} }
// ConnectNodesStarPivot connects all nodes in a star topology
// with the center at already set pivot node.
// If ids argument is nil, all nodes that are up will be connected.
func (net *Network) ConnectNodesStarPivot(ids []enode.ID) (err error) {
pivot := net.GetPivotNode()
if pivot == nil {
return ErrNoPivotNode
}
return net.ConnectNodesStar(pivot.ID(), ids)
}
// connect connects two nodes but ignores already connected error. // connect connects two nodes but ignores already connected error.
func (net *Network) connect(oneID, otherID enode.ID) error { func (net *Network) connect(oneID, otherID enode.ID) error {
return ignoreAlreadyConnectedErr(net.Connect(oneID, otherID)) return ignoreAlreadyConnectedErr(net.Connect(oneID, otherID))
@ -155,22 +130,3 @@ func ignoreAlreadyConnectedErr(err error) error {
} }
return err return err
} }
// SetPivotNode sets the NodeID of the network's pivot node.
// Pivot node is just a specific node that should be treated
// differently then other nodes in test. SetPivotNode and
// GetPivotNode are just a convenient functions to set and
// retrieve it.
func (net *Network) SetPivotNode(id enode.ID) {
net.lock.Lock()
defer net.lock.Unlock()
net.pivotNodeID = id
}
// GetPivotNode returns NodeID of the pivot node set by
// Network.SetPivotNode method.
func (net *Network) GetPivotNode() (node *Node) {
net.lock.RLock()
defer net.lock.RUnlock()
return net.getNode(net.pivotNodeID)
}

View file

@ -58,24 +58,6 @@ func newTestNetwork(t *testing.T, nodeCount int) (*Network, []enode.ID) {
return network, ids return network, ids
} }
func TestConnectToPivotNode(t *testing.T) {
net, ids := newTestNetwork(t, 2)
defer net.Shutdown()
pivot := ids[0]
net.SetPivotNode(pivot)
other := ids[1]
err := net.ConnectToPivotNode(other)
if err != nil {
t.Fatal(err)
}
if net.GetConn(pivot, other) == nil {
t.Error("pivot and the other node are not connected")
}
}
func TestConnectToLastNode(t *testing.T) { func TestConnectToLastNode(t *testing.T) {
net, ids := newTestNetwork(t, 10) net, ids := newTestNetwork(t, 10)
defer net.Shutdown() defer net.Shutdown()
@ -181,23 +163,7 @@ func TestConnectNodesStar(t *testing.T) {
pivotIndex := 2 pivotIndex := 2
err := net.ConnectNodesStar(ids[pivotIndex], ids) err := net.ConnectNodesStar(ids, ids[pivotIndex])
if err != nil {
t.Fatal(err)
}
VerifyStar(t, net, ids, pivotIndex)
}
func TestConnectNodesStarPivot(t *testing.T) {
net, ids := newTestNetwork(t, 10)
defer net.Shutdown()
pivotIndex := 4
net.SetPivotNode(ids[pivotIndex])
err := net.ConnectNodesStarPivot(ids)
if err != nil { if err != nil {
t.Fatal(err) t.Fatal(err)
} }

View file

@ -58,8 +58,6 @@ type Network struct {
Conns []*Conn `json:"conns"` Conns []*Conn `json:"conns"`
connMap map[string]int connMap map[string]int
pivotNodeID enode.ID
nodeAdapter adapters.NodeAdapter nodeAdapter adapters.NodeAdapter
events event.Feed events event.Feed
lock sync.RWMutex lock sync.RWMutex

View file

@ -188,7 +188,7 @@ func (s *Simulation) AddNodesAndConnectStar(count int, opts ...AddNodeOption) (i
if err != nil { if err != nil {
return nil, err return nil, err
} }
err = s.Net.ConnectNodesStar(ids[0], ids[1:]) err = s.Net.ConnectNodesStar(ids[1:], ids[0])
if err != nil { if err != nil {
return nil, err return nil, err
} }