1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
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
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
// 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 hive_test
import (
"bytes"
"context"
"fmt"
"io/ioutil"
"math/rand"
"runtime/debug"
"strconv"
"testing"
"time"
ma "github.com/multiformats/go-multiaddr"
ab "github.com/ethersphere/bee/pkg/addressbook"
"github.com/ethersphere/bee/pkg/bzz"
"github.com/ethersphere/bee/pkg/crypto"
"github.com/ethersphere/bee/pkg/hive"
"github.com/ethersphere/bee/pkg/hive/pb"
"github.com/ethersphere/bee/pkg/logging"
"github.com/ethersphere/bee/pkg/p2p/protobuf"
"github.com/ethersphere/bee/pkg/p2p/streamtest"
"github.com/ethersphere/bee/pkg/statestore/mock"
"github.com/ethersphere/bee/pkg/swarm"
)
func TestBroadcastPeers(t *testing.T) {
rand.Seed(time.Now().UnixNano())
logger := logging.New(ioutil.Discard, 0)
statestore := mock.NewStateStore()
addressbook := ab.New(statestore)
networkID := uint64(1)
// populate all expected and needed random resources for 2 full batches
// tests cases that uses fewer resources can use sub-slices of this data
var bzzAddresses []bzz.Address
var overlays []swarm.Address
var wantMsgs []pb.Peers
for i := 0; i < 2; i++ {
wantMsgs = append(wantMsgs, pb.Peers{Peers: []*pb.BzzAddress{}})
}
for i := 0; i < 2*hive.MaxBatchSize; i++ {
underlay, err := ma.NewMultiaddr("/ip4/127.0.0.1/udp/" + strconv.Itoa(i))
if err != nil {
t.Fatal(err)
}
pk, err := crypto.GenerateSecp256k1Key()
if err != nil {
t.Fatal(err)
}
signer := crypto.NewDefaultSigner(pk)
overlay, err := crypto.NewOverlayAddress(pk.PublicKey, networkID)
if err != nil {
t.Fatal(err)
}
bzzAddr, err := bzz.NewAddress(signer, underlay, overlay, networkID)
if err != nil {
t.Fatal(err)
}
bzzAddresses = append(bzzAddresses, *bzzAddr)
overlays = append(overlays, bzzAddr.Overlay)
err = addressbook.Put(bzzAddr.Overlay, *bzzAddr)
if err != nil {
t.Fatal(err)
}
wantMsgs[i/hive.MaxBatchSize].Peers = append(wantMsgs[i/hive.MaxBatchSize].Peers, &pb.BzzAddress{
Overlay: bzzAddresses[i].Overlay.Bytes(),
Underlay: bzzAddresses[i].Underlay.Bytes(),
Signature: bzzAddresses[i].Signature,
})
}
testCases := map[string]struct {
addresee swarm.Address
peers []swarm.Address
wantMsgs []pb.Peers
wantOverlays []swarm.Address
wantBzzAddresses []bzz.Address
}{
"OK - single record": {
addresee: swarm.MustParseHexAddress("ca1e9f3938cc1425c6061b96ad9eb93e134dfe8734ad490164ef20af9d1cf59c"),
peers: []swarm.Address{overlays[0]},
wantMsgs: []pb.Peers{{Peers: wantMsgs[0].Peers[:1]}},
wantOverlays: []swarm.Address{overlays[0]},
wantBzzAddresses: []bzz.Address{bzzAddresses[0]},
},
"OK - single batch - multiple records": {
addresee: swarm.MustParseHexAddress("ca1e9f3938cc1425c6061b96ad9eb93e134dfe8734ad490164ef20af9d1cf59c"),
peers: overlays[:15],
wantMsgs: []pb.Peers{{Peers: wantMsgs[0].Peers[:15]}},
wantOverlays: overlays[:15],
wantBzzAddresses: bzzAddresses[:15],
},
"OK - single batch - max number of records": {
addresee: swarm.MustParseHexAddress("ca1e9f3938cc1425c6061b96ad9eb93e134dfe8734ad490164ef20af9d1cf59c"),
peers: overlays[:hive.MaxBatchSize],
wantMsgs: []pb.Peers{{Peers: wantMsgs[0].Peers[:hive.MaxBatchSize]}},
wantOverlays: overlays[:hive.MaxBatchSize],
wantBzzAddresses: bzzAddresses[:hive.MaxBatchSize],
},
"OK - multiple batches": {
addresee: swarm.MustParseHexAddress("ca1e9f3938cc1425c6061b96ad9eb93e134dfe8734ad490164ef20af9d1cf59c"),
peers: overlays[:hive.MaxBatchSize+10],
wantMsgs: []pb.Peers{{Peers: wantMsgs[0].Peers}, {Peers: wantMsgs[1].Peers[:10]}},
wantOverlays: overlays[:hive.MaxBatchSize+10],
wantBzzAddresses: bzzAddresses[:hive.MaxBatchSize+10],
},
"OK - multiple batches - max number of records": {
addresee: swarm.MustParseHexAddress("ca1e9f3938cc1425c6061b96ad9eb93e134dfe8734ad490164ef20af9d1cf59c"),
peers: overlays[:2*hive.MaxBatchSize],
wantMsgs: []pb.Peers{{Peers: wantMsgs[0].Peers}, {Peers: wantMsgs[1].Peers}},
wantOverlays: overlays[:2*hive.MaxBatchSize],
wantBzzAddresses: bzzAddresses[:2*hive.MaxBatchSize],
},
}
for name, tc := range testCases {
t.Run(name, func(t *testing.T) {
addressbookclean := ab.New(mock.NewStateStore())
// create a hive server that handles the incoming stream
server := hive.New(nil, addressbookclean, networkID, logger)
// setup the stream recorder to record stream data
recorder := streamtest.New(
streamtest.WithProtocols(server.Protocol()),
)
// create a hive client that will do broadcast
client := hive.New(recorder, addressbook, networkID, logger)
if err := client.BroadcastPeers(context.Background(), tc.addresee, tc.peers...); err != nil {
t.Fatal(err)
}
// get a record for this stream
records, err := recorder.Records(tc.addresee, "hive", "1.0.0", "peers")
if err != nil {
t.Fatal(err)
}
if l := len(records); l != len(tc.wantMsgs) {
t.Fatalf("got %v records, want %v", l, len(tc.wantMsgs))
}
// there is a one record per batch (wantMsg)
for i, record := range records {
messages, err := readAndAssertPeersMsgs(record.In(), 1)
if err != nil {
t.Fatal(err)
}
if fmt.Sprint(messages[0]) != fmt.Sprint(tc.wantMsgs[i]) {
t.Errorf("Messages got %v, want %v", messages, tc.wantMsgs)
}
}
expectOverlaysEventually(t, addressbookclean, tc.wantOverlays)
expectBzzAddresessEventually(t, addressbookclean, tc.wantBzzAddresses)
})
}
}
func expectOverlaysEventually(t *testing.T, exporter ab.Interface, wantOverlays []swarm.Address) {
var (
overlays []swarm.Address
err error
isIn = func(a swarm.Address, addrs []swarm.Address) bool {
for _, v := range addrs {
if a.Equal(v) {
return true
}
}
return false
}
)
for i := 0; i < 100; i++ {
time.Sleep(50 * time.Millisecond)
overlays, err = exporter.Overlays()
if err != nil {
t.Fatal(err)
}
if len(overlays) == len(wantOverlays) {
break
}
}
if len(overlays) != len(wantOverlays) {
debug.PrintStack()
t.Fatal("timed out waiting for overlays")
}
for _, v := range wantOverlays {
if !isIn(v, overlays) {
t.Errorf("overlay %s expected but not found", v.String())
}
}
if t.Failed() {
t.Errorf("overlays got %v, want %v", overlays, wantOverlays)
}
}
func expectBzzAddresessEventually(t *testing.T, exporter ab.Interface, wantBzzAddresses []bzz.Address) {
var (
addresses []bzz.Address
err error
isIn = func(a bzz.Address, addrs []bzz.Address) bool {
for _, v := range addrs {
if a.Equal(&v) {
return true
}
}
return false
}
)
for i := 0; i < 100; i++ {
time.Sleep(50 * time.Millisecond)
addresses, err = exporter.Addresses()
if err != nil {
t.Fatal(err)
}
if len(addresses) == len(wantBzzAddresses) {
break
}
}
if len(addresses) != len(wantBzzAddresses) {
debug.PrintStack()
t.Fatal("timed out waiting for bzz addresses")
}
for _, v := range wantBzzAddresses {
if !isIn(v, addresses) {
t.Errorf("address %s expected but not found", v.Overlay.String())
}
}
if t.Failed() {
t.Errorf("bzz addresses got %v, want %v", addresses, wantBzzAddresses)
}
}
func readAndAssertPeersMsgs(in []byte, expectedLen int) ([]pb.Peers, error) {
messages, err := protobuf.ReadMessages(
bytes.NewReader(in),
func() protobuf.Message {
return new(pb.Peers)
},
)
if err != nil {
return nil, err
}
if len(messages) != expectedLen {
return nil, fmt.Errorf("got %v messages, want %v", len(messages), expectedLen)
}
var peers []pb.Peers
for _, m := range messages {
peers = append(peers, *m.(*pb.Peers))
}
return peers, nil
}