mirror of https://github.com/ethereum/go-ethereum
p2p/simulation: move connection methods from swarm/network/simulation (#18323)
parent
d322c9d550
commit
472c23a801
@ -0,0 +1,190 @@ |
||||
// Copyright 2018 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 simulations |
||||
|
||||
import ( |
||||
"testing" |
||||
|
||||
"github.com/ethereum/go-ethereum/node" |
||||
"github.com/ethereum/go-ethereum/p2p/enode" |
||||
"github.com/ethereum/go-ethereum/p2p/simulations/adapters" |
||||
) |
||||
|
||||
func newTestNetwork(t *testing.T, nodeCount int) (*Network, []enode.ID) { |
||||
adapter := adapters.NewSimAdapter(adapters.Services{ |
||||
"noopwoop": func(ctx *adapters.ServiceContext) (node.Service, error) { |
||||
return NewNoopService(nil), nil |
||||
}, |
||||
}) |
||||
|
||||
// create network
|
||||
network := NewNetwork(adapter, &NetworkConfig{ |
||||
DefaultService: "noopwoop", |
||||
}) |
||||
|
||||
// create and start nodes
|
||||
ids := make([]enode.ID, nodeCount) |
||||
for i := range ids { |
||||
conf := adapters.RandomNodeConfig() |
||||
node, err := network.NewNodeWithConfig(conf) |
||||
if err != nil { |
||||
t.Fatalf("error creating node: %s", err) |
||||
} |
||||
if err := network.Start(node.ID()); err != nil { |
||||
t.Fatalf("error starting node: %s", err) |
||||
} |
||||
ids[i] = node.ID() |
||||
} |
||||
|
||||
if len(network.Conns) > 0 { |
||||
t.Fatal("no connections should exist after just adding nodes") |
||||
} |
||||
|
||||
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) { |
||||
net, ids := newTestNetwork(t, 10) |
||||
defer net.Shutdown() |
||||
|
||||
first := ids[0] |
||||
if err := net.ConnectToLastNode(first); err != nil { |
||||
t.Fatal(err) |
||||
} |
||||
|
||||
last := ids[len(ids)-1] |
||||
for i, id := range ids { |
||||
if id == first || id == last { |
||||
continue |
||||
} |
||||
|
||||
if net.GetConn(first, id) != nil { |
||||
t.Errorf("connection must not exist with node(ind: %v, id: %v)", i, id) |
||||
} |
||||
} |
||||
|
||||
if net.GetConn(first, last) == nil { |
||||
t.Error("first and last node must be connected") |
||||
} |
||||
} |
||||
|
||||
func TestConnectToRandomNode(t *testing.T) { |
||||
net, ids := newTestNetwork(t, 10) |
||||
defer net.Shutdown() |
||||
|
||||
err := net.ConnectToRandomNode(ids[0]) |
||||
if err != nil { |
||||
t.Fatal(err) |
||||
} |
||||
|
||||
var cc int |
||||
for i, a := range ids { |
||||
for _, b := range ids[i:] { |
||||
if net.GetConn(a, b) != nil { |
||||
cc++ |
||||
} |
||||
} |
||||
} |
||||
|
||||
if cc != 1 { |
||||
t.Errorf("expected one connection, got %v", cc) |
||||
} |
||||
} |
||||
|
||||
func TestConnectNodesFull(t *testing.T) { |
||||
net, ids := newTestNetwork(t, 12) |
||||
defer net.Shutdown() |
||||
|
||||
err := net.ConnectNodesFull(ids) |
||||
if err != nil { |
||||
t.Fatal(err) |
||||
} |
||||
|
||||
VerifyFull(t, net, ids) |
||||
} |
||||
|
||||
func TestConnectNodesChain(t *testing.T) { |
||||
net, ids := newTestNetwork(t, 10) |
||||
defer net.Shutdown() |
||||
|
||||
err := net.ConnectNodesChain(ids) |
||||
if err != nil { |
||||
t.Fatal(err) |
||||
} |
||||
|
||||
VerifyChain(t, net, ids) |
||||
} |
||||
|
||||
func TestConnectNodesRing(t *testing.T) { |
||||
net, ids := newTestNetwork(t, 10) |
||||
defer net.Shutdown() |
||||
|
||||
err := net.ConnectNodesRing(ids) |
||||
if err != nil { |
||||
t.Fatal(err) |
||||
} |
||||
|
||||
VerifyRing(t, net, ids) |
||||
} |
||||
|
||||
func TestConnectNodesStar(t *testing.T) { |
||||
net, ids := newTestNetwork(t, 10) |
||||
defer net.Shutdown() |
||||
|
||||
pivotIndex := 2 |
||||
|
||||
err := net.ConnectNodesStar(ids[pivotIndex], ids) |
||||
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 { |
||||
t.Fatal(err) |
||||
} |
||||
|
||||
VerifyStar(t, net, ids, pivotIndex) |
||||
} |
@ -0,0 +1,134 @@ |
||||
package simulations |
||||
|
||||
import ( |
||||
"testing" |
||||
|
||||
"github.com/ethereum/go-ethereum/p2p" |
||||
"github.com/ethereum/go-ethereum/p2p/enode" |
||||
"github.com/ethereum/go-ethereum/p2p/enr" |
||||
"github.com/ethereum/go-ethereum/rpc" |
||||
) |
||||
|
||||
// NoopService is the service that does not do anything
|
||||
// but implements node.Service interface.
|
||||
type NoopService struct { |
||||
c map[enode.ID]chan struct{} |
||||
} |
||||
|
||||
func NewNoopService(ackC map[enode.ID]chan struct{}) *NoopService { |
||||
return &NoopService{ |
||||
c: ackC, |
||||
} |
||||
} |
||||
|
||||
func (t *NoopService) Protocols() []p2p.Protocol { |
||||
return []p2p.Protocol{ |
||||
{ |
||||
Name: "noop", |
||||
Version: 666, |
||||
Length: 0, |
||||
Run: func(peer *p2p.Peer, rw p2p.MsgReadWriter) error { |
||||
if t.c != nil { |
||||
t.c[peer.ID()] = make(chan struct{}) |
||||
close(t.c[peer.ID()]) |
||||
} |
||||
rw.ReadMsg() |
||||
return nil |
||||
}, |
||||
NodeInfo: func() interface{} { |
||||
return struct{}{} |
||||
}, |
||||
PeerInfo: func(id enode.ID) interface{} { |
||||
return struct{}{} |
||||
}, |
||||
Attributes: []enr.Entry{}, |
||||
}, |
||||
} |
||||
} |
||||
|
||||
func (t *NoopService) APIs() []rpc.API { |
||||
return []rpc.API{} |
||||
} |
||||
|
||||
func (t *NoopService) Start(server *p2p.Server) error { |
||||
return nil |
||||
} |
||||
|
||||
func (t *NoopService) Stop() error { |
||||
return nil |
||||
} |
||||
|
||||
func VerifyRing(t *testing.T, net *Network, ids []enode.ID) { |
||||
t.Helper() |
||||
n := len(ids) |
||||
for i := 0; i < n; i++ { |
||||
for j := i + 1; j < n; j++ { |
||||
c := net.GetConn(ids[i], ids[j]) |
||||
if i == j-1 || (i == 0 && j == n-1) { |
||||
if c == nil { |
||||
t.Errorf("nodes %v and %v are not connected, but they should be", i, j) |
||||
} |
||||
} else { |
||||
if c != nil { |
||||
t.Errorf("nodes %v and %v are connected, but they should not be", i, j) |
||||
} |
||||
} |
||||
} |
||||
} |
||||
} |
||||
|
||||
func VerifyChain(t *testing.T, net *Network, ids []enode.ID) { |
||||
t.Helper() |
||||
n := len(ids) |
||||
for i := 0; i < n; i++ { |
||||
for j := i + 1; j < n; j++ { |
||||
c := net.GetConn(ids[i], ids[j]) |
||||
if i == j-1 { |
||||
if c == nil { |
||||
t.Errorf("nodes %v and %v are not connected, but they should be", i, j) |
||||
} |
||||
} else { |
||||
if c != nil { |
||||
t.Errorf("nodes %v and %v are connected, but they should not be", i, j) |
||||
} |
||||
} |
||||
} |
||||
} |
||||
} |
||||
|
||||
func VerifyFull(t *testing.T, net *Network, ids []enode.ID) { |
||||
t.Helper() |
||||
n := len(ids) |
||||
var connections int |
||||
for i, lid := range ids { |
||||
for _, rid := range ids[i+1:] { |
||||
if net.GetConn(lid, rid) != nil { |
||||
connections++ |
||||
} |
||||
} |
||||
} |
||||
|
||||
want := n * (n - 1) / 2 |
||||
if connections != want { |
||||
t.Errorf("wrong number of connections, got: %v, want: %v", connections, want) |
||||
} |
||||
} |
||||
|
||||
func VerifyStar(t *testing.T, net *Network, ids []enode.ID, centerIndex int) { |
||||
t.Helper() |
||||
n := len(ids) |
||||
for i := 0; i < n; i++ { |
||||
for j := i + 1; j < n; j++ { |
||||
c := net.GetConn(ids[i], ids[j]) |
||||
if i == centerIndex || j == centerIndex { |
||||
if c == nil { |
||||
t.Errorf("nodes %v and %v are not connected, but they should be", i, j) |
||||
} |
||||
} else { |
||||
if c != nil { |
||||
t.Errorf("nodes %v and %v are connected, but they should not be", i, j) |
||||
} |
||||
} |
||||
} |
||||
} |
||||
} |
@ -1,306 +0,0 @@ |
||||
// Copyright 2018 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 simulation |
||||
|
||||
import ( |
||||
"testing" |
||||
|
||||
"github.com/ethereum/go-ethereum/p2p/enode" |
||||
) |
||||
|
||||
func TestConnectToPivotNode(t *testing.T) { |
||||
sim := New(noopServiceFuncMap) |
||||
defer sim.Close() |
||||
|
||||
pid, err := sim.AddNode() |
||||
if err != nil { |
||||
t.Fatal(err) |
||||
} |
||||
|
||||
sim.SetPivotNode(pid) |
||||
|
||||
id, err := sim.AddNode() |
||||
if err != nil { |
||||
t.Fatal(err) |
||||
} |
||||
|
||||
if len(sim.Net.Conns) > 0 { |
||||
t.Fatal("no connections should exist after just adding nodes") |
||||
} |
||||
|
||||
err = sim.ConnectToPivotNode(id) |
||||
if err != nil { |
||||
t.Fatal(err) |
||||
} |
||||
|
||||
if sim.Net.GetConn(id, pid) == nil { |
||||
t.Error("node did not connect to pivot node") |
||||
} |
||||
} |
||||
|
||||
func TestConnectToLastNode(t *testing.T) { |
||||
sim := New(noopServiceFuncMap) |
||||
defer sim.Close() |
||||
|
||||
n := 10 |
||||
|
||||
ids, err := sim.AddNodes(n) |
||||
if err != nil { |
||||
t.Fatal(err) |
||||
} |
||||
|
||||
id, err := sim.AddNode() |
||||
if err != nil { |
||||
t.Fatal(err) |
||||
} |
||||
|
||||
if len(sim.Net.Conns) > 0 { |
||||
t.Fatal("no connections should exist after just adding nodes") |
||||
} |
||||
|
||||
err = sim.ConnectToLastNode(id) |
||||
if err != nil { |
||||
t.Fatal(err) |
||||
} |
||||
|
||||
for _, i := range ids[:n-2] { |
||||
if sim.Net.GetConn(id, i) != nil { |
||||
t.Error("node connected to the node that is not the last") |
||||
} |
||||
} |
||||
|
||||
if sim.Net.GetConn(id, ids[n-1]) == nil { |
||||
t.Error("node did not connect to the last node") |
||||
} |
||||
} |
||||
|
||||
func TestConnectToRandomNode(t *testing.T) { |
||||
sim := New(noopServiceFuncMap) |
||||
defer sim.Close() |
||||
|
||||
n := 10 |
||||
|
||||
ids, err := sim.AddNodes(n) |
||||
if err != nil { |
||||
t.Fatal(err) |
||||
} |
||||
|
||||
if len(sim.Net.Conns) > 0 { |
||||
t.Fatal("no connections should exist after just adding nodes") |
||||
} |
||||
|
||||
err = sim.ConnectToRandomNode(ids[0]) |
||||
if err != nil { |
||||
t.Fatal(err) |
||||
} |
||||
|
||||
var cc int |
||||
for i := 0; i < n; i++ { |
||||
for j := i + 1; j < n; j++ { |
||||
if sim.Net.GetConn(ids[i], ids[j]) != nil { |
||||
cc++ |
||||
} |
||||
} |
||||
} |
||||
|
||||
if cc != 1 { |
||||
t.Errorf("expected one connection, got %v", cc) |
||||
} |
||||
} |
||||
|
||||
func TestConnectNodesFull(t *testing.T) { |
||||
sim := New(noopServiceFuncMap) |
||||
defer sim.Close() |
||||
|
||||
ids, err := sim.AddNodes(12) |
||||
if err != nil { |
||||
t.Fatal(err) |
||||
} |
||||
|
||||
if len(sim.Net.Conns) > 0 { |
||||
t.Fatal("no connections should exist after just adding nodes") |
||||
} |
||||
|
||||
err = sim.ConnectNodesFull(ids) |
||||
if err != nil { |
||||
t.Fatal(err) |
||||
} |
||||
|
||||
testFull(t, sim, ids) |
||||
} |
||||
|
||||
func testFull(t *testing.T, sim *Simulation, ids []enode.ID) { |
||||
n := len(ids) |
||||
var cc int |
||||
for i := 0; i < n; i++ { |
||||
for j := i + 1; j < n; j++ { |
||||
if sim.Net.GetConn(ids[i], ids[j]) != nil { |
||||
cc++ |
||||
} |
||||
} |
||||
} |
||||
|
||||
want := n * (n - 1) / 2 |
||||
|
||||
if cc != want { |
||||
t.Errorf("expected %v connection, got %v", want, cc) |
||||
} |
||||
} |
||||
|
||||
func TestConnectNodesChain(t *testing.T) { |
||||
sim := New(noopServiceFuncMap) |
||||
defer sim.Close() |
||||
|
||||
ids, err := sim.AddNodes(10) |
||||
if err != nil { |
||||
t.Fatal(err) |
||||
} |
||||
|
||||
if len(sim.Net.Conns) > 0 { |
||||
t.Fatal("no connections should exist after just adding nodes") |
||||
} |
||||
|
||||
err = sim.ConnectNodesChain(ids) |
||||
if err != nil { |
||||
t.Fatal(err) |
||||
} |
||||
|
||||
testChain(t, sim, ids) |
||||
} |
||||
|
||||
func testChain(t *testing.T, sim *Simulation, ids []enode.ID) { |
||||
n := len(ids) |
||||
for i := 0; i < n; i++ { |
||||
for j := i + 1; j < n; j++ { |
||||
c := sim.Net.GetConn(ids[i], ids[j]) |
||||
if i == j-1 { |
||||
if c == nil { |
||||
t.Errorf("nodes %v and %v are not connected, but they should be", i, j) |
||||
} |
||||
} else { |
||||
if c != nil { |
||||
t.Errorf("nodes %v and %v are connected, but they should not be", i, j) |
||||
} |
||||
} |
||||
} |
||||
} |
||||
} |
||||
|
||||
func TestConnectNodesRing(t *testing.T) { |
||||
sim := New(noopServiceFuncMap) |
||||
defer sim.Close() |
||||
|
||||
ids, err := sim.AddNodes(10) |
||||
if err != nil { |
||||
t.Fatal(err) |
||||
} |
||||
|
||||
if len(sim.Net.Conns) > 0 { |
||||
t.Fatal("no connections should exist after just adding nodes") |
||||
} |
||||
|
||||
err = sim.ConnectNodesRing(ids) |
||||
if err != nil { |
||||
t.Fatal(err) |
||||
} |
||||
|
||||
testRing(t, sim, ids) |
||||
} |
||||
|
||||
func testRing(t *testing.T, sim *Simulation, ids []enode.ID) { |
||||
n := len(ids) |
||||
for i := 0; i < n; i++ { |
||||
for j := i + 1; j < n; j++ { |
||||
c := sim.Net.GetConn(ids[i], ids[j]) |
||||
if i == j-1 || (i == 0 && j == n-1) { |
||||
if c == nil { |
||||
t.Errorf("nodes %v and %v are not connected, but they should be", i, j) |
||||
} |
||||
} else { |
||||
if c != nil { |
||||
t.Errorf("nodes %v and %v are connected, but they should not be", i, j) |
||||
} |
||||
} |
||||
} |
||||
} |
||||
} |
||||
|
||||
func TestConnectToNodesStar(t *testing.T) { |
||||
sim := New(noopServiceFuncMap) |
||||
defer sim.Close() |
||||
|
||||
ids, err := sim.AddNodes(10) |
||||
if err != nil { |
||||
t.Fatal(err) |
||||
} |
||||
|
||||
if len(sim.Net.Conns) > 0 { |
||||
t.Fatal("no connections should exist after just adding nodes") |
||||
} |
||||
|
||||
centerIndex := 2 |
||||
|
||||
err = sim.ConnectNodesStar(ids[centerIndex], ids) |
||||
if err != nil { |
||||
t.Fatal(err) |
||||
} |
||||
|
||||
testStar(t, sim, ids, centerIndex) |
||||
} |
||||
|
||||
func testStar(t *testing.T, sim *Simulation, ids []enode.ID, centerIndex int) { |
||||
n := len(ids) |
||||
for i := 0; i < n; i++ { |
||||
for j := i + 1; j < n; j++ { |
||||
c := sim.Net.GetConn(ids[i], ids[j]) |
||||
if i == centerIndex || j == centerIndex { |
||||
if c == nil { |
||||
t.Errorf("nodes %v and %v are not connected, but they should be", i, j) |
||||
} |
||||
} else { |
||||
if c != nil { |
||||
t.Errorf("nodes %v and %v are connected, but they should not be", i, j) |
||||
} |
||||
} |
||||
} |
||||
} |
||||
} |
||||
|
||||
func TestConnectToNodesStarPivot(t *testing.T) { |
||||
sim := New(noopServiceFuncMap) |
||||
defer sim.Close() |
||||
|
||||
ids, err := sim.AddNodes(10) |
||||
if err != nil { |
||||
t.Fatal(err) |
||||
} |
||||
|
||||
if len(sim.Net.Conns) > 0 { |
||||
t.Fatal("no connections should exist after just adding nodes") |
||||
} |
||||
|
||||
pivotIndex := 4 |
||||
|
||||
sim.SetPivotNode(ids[pivotIndex]) |
||||
|
||||
err = sim.ConnectNodesStarPivot(ids) |
||||
if err != nil { |
||||
t.Fatal(err) |
||||
} |
||||
|
||||
testStar(t, sim, ids, pivotIndex) |
||||
} |
Loading…
Reference in new issue