full_test.go 8.49 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12
// Copyright 2020 The Swarm Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.

package full_test

import (
	"context"
	"errors"
	"fmt"
	"io/ioutil"
	"testing"
13
	"time"
14

15
	"github.com/ethersphere/bee/pkg/addressbook"
16 17
	"github.com/ethersphere/bee/pkg/bzz"
	"github.com/ethersphere/bee/pkg/crypto"
18 19 20 21
	"github.com/ethersphere/bee/pkg/discovery/mock"
	"github.com/ethersphere/bee/pkg/logging"
	"github.com/ethersphere/bee/pkg/p2p"
	p2pmock "github.com/ethersphere/bee/pkg/p2p/mock"
22
	mockstate "github.com/ethersphere/bee/pkg/statestore/mock"
23 24 25 26 27 28
	"github.com/ethersphere/bee/pkg/swarm"
	"github.com/ethersphere/bee/pkg/topology"
	"github.com/ethersphere/bee/pkg/topology/full"
	ma "github.com/multiformats/go-multiaddr"
)

29
func TestAddPeers(t *testing.T) {
30
	logger := logging.New(ioutil.Discard, 0)
31
	underlay, err := ma.NewMultiaddr("/ip4/127.0.0.1/tcp/1634/p2p/16Uiu2HAkx8ULY8cTXhdVAcMmLcH9AsTKz6uBQ7DPLKRjMLgBVYkS")
32 33 34 35
	if err != nil {
		t.Fatal(err)
	}

36
	overlay := swarm.MustParseHexAddress("ca1e9f3938cc1425c6061b96ad9eb93e134dfe8734ad490164ef20af9d1cf59a")
37 38 39 40 41 42 43 44 45
	pk, err := crypto.GenerateSecp256k1Key()
	if err != nil {
		t.Fatal(err)
	}

	bzzAddr, err := bzz.NewAddress(crypto.NewDefaultSigner(pk), underlay, overlay, 1)
	if err != nil {
		t.Fatal(err)
	}
46 47 48 49 50 51 52 53 54 55 56 57 58 59
	connectedPeers := []p2p.Peer{
		{
			Address: swarm.MustParseHexAddress("ca1e9f3938cc1425c6061b96ad9eb93e134dfe8734ad490164ef20af9d1cf59b"),
		},
		{
			Address: swarm.MustParseHexAddress("ca1e9f3938cc1425c6061b96ad9eb93e134dfe8734ad490164ef20af9d1cf59c"),
		},
		{
			Address: swarm.MustParseHexAddress("ca1e9f3938cc1425c6061b96ad9eb93e134dfe8734ad490164ef20af9d1cf59d"),
		},
	}

	t.Run("OK - no connected peers", func(t *testing.T) {
		discovery := mock.NewDiscovery()
60 61
		statestore := mockstate.NewStateStore()
		ab := addressbook.New(statestore)
62
		p2p := p2pmock.New(p2pmock.WithConnectFunc(func(_ context.Context, addr ma.Multiaddr) (*bzz.Address, error) {
63 64
			if !addr.Equal(underlay) {
				t.Fatalf("expected multiaddr %s, got %s", addr, underlay)
65
			}
66

67
			return bzzAddr, nil
68 69
		}))

70
		fullDriver := full.New(discovery, ab, p2p, logger, overlay)
71
		defer fullDriver.Close()
72

73
		if err := ab.Put(overlay, *bzzAddr); err != nil {
74 75 76
			t.Fatal(err)
		}

77
		err = fullDriver.AddPeers(context.Background(), overlay)
78 79 80 81
		if err != nil {
			t.Fatalf("full conn driver returned err %s", err.Error())
		}

82
		expectBroadcastsEventually(t, discovery, 0)
83 84 85 86
	})

	t.Run("OK - connected peers - peer already connected", func(t *testing.T) {
		discovery := mock.NewDiscovery()
87 88
		statestore := mockstate.NewStateStore()
		ab := addressbook.New(statestore)
89
		alreadyConnected := connectedPeers[0].Address
90 91 92 93
		addrAlreadyConnected, err := bzz.NewAddress(crypto.NewDefaultSigner(pk), underlay, alreadyConnected, 1)
		if err != nil {
			t.Fatal(err)
		}
94

95
		p2p := p2pmock.New(p2pmock.WithConnectFunc(func(ctx context.Context, addr ma.Multiaddr) (*bzz.Address, error) {
96
			t.Fatal("should not be called")
97
			return nil, nil
98 99 100 101
		}), p2pmock.WithPeersFunc(func() []p2p.Peer {
			return connectedPeers
		}))

102
		fullDriver := full.New(discovery, ab, p2p, logger, overlay)
103
		defer fullDriver.Close()
104

105
		err = ab.Put(alreadyConnected, *addrAlreadyConnected)
106 107 108 109
		if err != nil {
			t.Fatal(err)
		}

110
		err = fullDriver.AddPeers(context.Background(), alreadyConnected)
111 112 113 114
		if err != nil {
			t.Fatalf("full conn driver returned err %s", err.Error())
		}

115
		expectBroadcastsEventually(t, discovery, 3)
116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131

		// check newly added node
		if err := checkAddreseeRecords(discovery, alreadyConnected, connectedPeers[1:]); err != nil {
			t.Fatal(err)
		}

		// check other nodes
		for _, p := range connectedPeers[1:] {
			if err := checkAddreseeRecords(discovery, p.Address, connectedPeers[0:1]); err != nil {
				t.Fatal(err)
			}
		}
	})

	t.Run("OK - connected peers - peer not already connected", func(t *testing.T) {
		discovery := mock.NewDiscovery()
132 133
		statestore := mockstate.NewStateStore()
		ab := addressbook.New(statestore)
134

135
		p2ps := p2pmock.New(p2pmock.WithConnectFunc(func(ctx context.Context, addr ma.Multiaddr) (*bzz.Address, error) {
136
			if !addr.Equal(underlay) {
137 138
				t.Fatalf("expected multiaddr %s, got %s", addr.String(), underlay)
			}
139

140
			return bzzAddr, nil
141 142 143 144
		}), p2pmock.WithPeersFunc(func() []p2p.Peer {
			return connectedPeers
		}))

145
		fullDriver := full.New(discovery, ab, p2ps, logger, overlay)
146
		defer fullDriver.Close()
147
		if err := ab.Put(overlay, *bzzAddr); err != nil {
148 149 150
			t.Fatal(err)
		}

151
		err = fullDriver.AddPeers(context.Background(), overlay)
152 153 154 155
		if err != nil {
			t.Fatalf("full conn driver returned err %s", err.Error())
		}

156
		expectBroadcastsEventually(t, discovery, 4)
157 158 159 160 161 162 163 164 165 166 167 168 169 170 171

		// check newly added node
		if err := checkAddreseeRecords(discovery, overlay, connectedPeers); err != nil {
			t.Fatal(err)
		}

		// check other nodes
		for _, p := range connectedPeers {
			if err := checkAddreseeRecords(discovery, p.Address, []p2p.Peer{{Address: overlay}}); err != nil {
				t.Fatal(err)
			}
		}
	})
}

172 173 174 175 176 177 178 179 180 181 182
func expectBroadcastsEventually(t *testing.T, discovery *mock.Discovery, expected int) {
	for i := 0; i < 100; i++ {
		time.Sleep(50 * time.Millisecond)
		if discovery.Broadcasts() == expected {
			return
		}
	}

	t.Fatalf("broadcasts expected %v, got %v ", expected, discovery.Broadcasts())
}

183
// TestSyncPeer tests that SyncPeer method returns closest connected peer to a given chunk.
184
func TestClosestPeer(t *testing.T) {
185 186
	logger := logging.New(ioutil.Discard, 0)
	baseOverlay := swarm.MustParseHexAddress("0000000000000000000000000000000000000000000000000000000000000000") // base is 0000
187 188 189 190
	bzzAddr := &bzz.Address{
		Overlay: baseOverlay,
	}

191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206
	connectedPeers := []p2p.Peer{
		{
			Address: swarm.MustParseHexAddress("8000000000000000000000000000000000000000000000000000000000000000"), // binary 1000 -> po 0 to base
		},
		{
			Address: swarm.MustParseHexAddress("4000000000000000000000000000000000000000000000000000000000000000"), // binary 0100 -> po 1 to base
		},
		{
			Address: swarm.MustParseHexAddress("6000000000000000000000000000000000000000000000000000000000000000"), // binary 0110 -> po 1 to base
		},
	}

	discovery := mock.NewDiscovery()
	statestore := mockstate.NewStateStore()
	ab := addressbook.New(statestore)

207 208
	p2ps := p2pmock.New(p2pmock.WithConnectFunc(func(ctx context.Context, addr ma.Multiaddr) (*bzz.Address, error) {
		return bzzAddr, nil
209 210 211 212 213
	}), p2pmock.WithPeersFunc(func() []p2p.Peer {
		return connectedPeers
	}))

	fullDriver := full.New(discovery, ab, p2ps, logger, baseOverlay)
214
	defer fullDriver.Close()
215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248

	for _, tc := range []struct {
		chunkAddress swarm.Address // chunk address to test
		expectedPeer int           // points to the index of the connectedPeers slice. -1 means self (baseOverlay)
	}{
		{
			chunkAddress: swarm.MustParseHexAddress("7000000000000000000000000000000000000000000000000000000000000000"), // 0111, wants peer 2
			expectedPeer: 2,
		},
		{
			chunkAddress: swarm.MustParseHexAddress("c000000000000000000000000000000000000000000000000000000000000000"), // 1100, want peer 0
			expectedPeer: 0,
		},
		{
			chunkAddress: swarm.MustParseHexAddress("e000000000000000000000000000000000000000000000000000000000000000"), // 1110, want peer 0
			expectedPeer: 0,
		},
		{
			chunkAddress: swarm.MustParseHexAddress("a000000000000000000000000000000000000000000000000000000000000000"), // 1010, want peer 0
			expectedPeer: 0,
		},
		{
			chunkAddress: swarm.MustParseHexAddress("4000000000000000000000000000000000000000000000000000000000000000"), // 0100, want peer 1
			expectedPeer: 1,
		},
		{
			chunkAddress: swarm.MustParseHexAddress("5000000000000000000000000000000000000000000000000000000000000000"), // 0101, want peer 1
			expectedPeer: 1,
		},
		{
			chunkAddress: swarm.MustParseHexAddress("0000001000000000000000000000000000000000000000000000000000000000"), // want self
			expectedPeer: -1,
		},
	} {
249
		peer, err := fullDriver.ClosestPeer(tc.chunkAddress)
250 251 252 253 254 255 256 257 258 259 260 261 262 263 264
		if err != nil {
			if tc.expectedPeer == -1 && !errors.Is(err, topology.ErrWantSelf) {
				t.Fatalf("wanted %v but got %v", topology.ErrWantSelf, err)
			}
			continue
		}

		expected := connectedPeers[tc.expectedPeer].Address

		if !peer.Equal(expected) {
			t.Fatalf("peers not equal. got %s expected %s", peer, expected)
		}
	}
}

265 266 267 268 269 270 271 272 273 274 275 276 277
func checkAddreseeRecords(discovery *mock.Discovery, addr swarm.Address, expected []p2p.Peer) error {
	got, exists := discovery.AddresseeRecords(addr)
	if exists != true {
		return errors.New("addressee record does not exist")
	}

	for i, e := range expected {
		if !e.Address.Equal(got[i]) {
			return fmt.Errorf("addressee record expected %s, got %s ", e.Address.String(), got[i].String())
		}
	}
	return nil
}