forked from cometbft/cometbft
-
Notifications
You must be signed in to change notification settings - Fork 0
/
reactor_test.go
709 lines (612 loc) · 21.4 KB
/
reactor_test.go
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
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
package mempool
import (
"encoding/hex"
"errors"
"sync"
"testing"
"time"
"github.com/fortytw2/leaktest"
"github.com/go-kit/log/term"
"github.com/stretchr/testify/assert"
"github.com/stretchr/testify/require"
"github.com/cometbft/cometbft/abci/example/kvstore"
abci "github.com/cometbft/cometbft/abci/types"
memproto "github.com/cometbft/cometbft/api/cometbft/mempool/v1"
cfg "github.com/cometbft/cometbft/config"
"github.com/cometbft/cometbft/libs/log"
"github.com/cometbft/cometbft/p2p"
"github.com/cometbft/cometbft/proxy"
"github.com/cometbft/cometbft/types"
)
const (
numTxs = 1000
timeout = 120 * time.Second // ridiculously high because CircleCI is slow
)
type peerState struct {
height int64
}
func (ps peerState) GetHeight() int64 {
return ps.height
}
// Send a bunch of txs to the first reactor's mempool and wait for them all to
// be received in the others.
func TestReactorBroadcastTxsMessage(t *testing.T) {
config := cfg.TestConfig()
// if there were more than two reactors, the order of transactions could not be
// asserted in waitForTxsOnReactors (due to transactions gossiping). If we
// replace Connect2Switches (full mesh) with a func, which connects first
// reactor to others and nothing else, this test should also pass with >2 reactors.
const n = 2
reactors, _ := makeAndConnectReactors(config, n)
defer func() {
for _, r := range reactors {
if err := r.Stop(); err != nil {
require.NoError(t, err)
}
}
}()
for _, r := range reactors {
for _, peer := range r.Switch.Peers().Copy() {
peer.Set(types.PeerStateKey, peerState{1})
}
}
txs := checkTxs(t, reactors[0].mempool, numTxs)
waitForReactors(t, txs, reactors, checkTxsInOrder)
}
// regression test for https://github.com/tendermint/tendermint/issues/5408
func TestReactorConcurrency(t *testing.T) {
config := cfg.TestConfig()
config.Mempool.Size = 5000
config.Mempool.CacheSize = 5000
const n = 2
reactors, _ := makeAndConnectReactors(config, n)
defer func() {
for _, r := range reactors {
if err := r.Stop(); err != nil {
require.NoError(t, err)
}
}
}()
for _, r := range reactors {
for _, peer := range r.Switch.Peers().Copy() {
peer.Set(types.PeerStateKey, peerState{1})
}
}
var wg sync.WaitGroup
const numTxs = 5
for i := 0; i < 1000; i++ {
wg.Add(2)
// 1. submit a bunch of txs
// 2. update the whole mempool
txs := checkTxs(t, reactors[0].mempool, numTxs)
go func() {
defer wg.Done()
reactors[0].mempool.Lock()
defer reactors[0].mempool.Unlock()
err := reactors[0].mempool.Update(1, txs, abciResponses(len(txs), abci.CodeTypeOK), nil, nil)
require.NoError(t, err)
}()
// 1. submit a bunch of txs
// 2. update none
_ = checkTxs(t, reactors[1].mempool, numTxs)
go func() {
defer wg.Done()
reactors[1].mempool.Lock()
defer reactors[1].mempool.Unlock()
err := reactors[1].mempool.Update(1, []types.Tx{}, make([]*abci.ExecTxResult, 0), nil, nil)
require.NoError(t, err)
}()
// 1. flush the mempool
reactors[1].mempool.Flush()
}
wg.Wait()
}
// Send a bunch of txs to the first reactor's mempool, claiming it came from peer
// ensure peer gets no txs.
func TestReactorNoBroadcastToSender(t *testing.T) {
config := cfg.TestConfig()
const n = 2
reactors, _ := makeAndConnectReactors(config, n)
defer func() {
for _, r := range reactors {
if err := r.Stop(); err != nil {
require.NoError(t, err)
}
}
}()
for _, r := range reactors {
for _, peer := range r.Switch.Peers().Copy() {
peer.Set(types.PeerStateKey, peerState{1})
}
}
// create random transactions
txs := NewRandomTxs(numTxs, 20)
// the second peer sends all the transactions to the first peer
secondNodeID := reactors[1].Switch.NodeInfo().ID()
for _, tx := range txs {
reactors[0].addSender(tx.Key(), secondNodeID)
_, err := reactors[0].mempool.CheckTx(tx)
require.NoError(t, err)
}
// the second peer should not receive any transaction
ensureNoTxs(t, reactors[1], 100*time.Millisecond)
}
func TestReactor_MaxTxBytes(t *testing.T) {
config := cfg.TestConfig()
const n = 2
reactors, _ := makeAndConnectReactors(config, n)
defer func() {
for _, r := range reactors {
if err := r.Stop(); err != nil {
require.NoError(t, err)
}
}
}()
for _, r := range reactors {
for _, peer := range r.Switch.Peers().Copy() {
peer.Set(types.PeerStateKey, peerState{1})
}
}
// Broadcast a tx, which has the max size
// => ensure it's received by the second reactor.
tx1 := kvstore.NewRandomTx(config.Mempool.MaxTxBytes)
reqRes, err := reactors[0].mempool.CheckTx(tx1)
require.NoError(t, err)
require.False(t, reqRes.Response.GetCheckTx().IsErr())
waitForReactors(t, []types.Tx{tx1}, reactors, checkTxsInOrder)
reactors[0].mempool.Flush()
reactors[1].mempool.Flush()
// Broadcast a tx, which is beyond the max size
// => ensure it's not sent
tx2 := kvstore.NewRandomTx(config.Mempool.MaxTxBytes + 1)
reqRes, err = reactors[0].mempool.CheckTx(tx2)
require.Error(t, err)
require.Nil(t, reqRes)
}
func TestBroadcastTxForPeerStopsWhenPeerStops(t *testing.T) {
if testing.Short() {
t.Skip("skipping test in short mode.")
}
config := cfg.TestConfig()
const n = 2
reactors, _ := makeAndConnectReactors(config, n)
defer func() {
for _, r := range reactors {
if err := r.Stop(); err != nil {
require.NoError(t, err)
}
}
}()
// stop peer
sw := reactors[1].Switch
sw.StopPeerForError(sw.Peers().Copy()[0], errors.New("some reason"))
// check that we are not leaking any go-routines
// i.e. broadcastTxRoutine finishes when peer is stopped
leaktest.CheckTimeout(t, 10*time.Second)()
}
func TestBroadcastTxForPeerStopsWhenReactorStops(t *testing.T) {
if testing.Short() {
t.Skip("skipping test in short mode.")
}
config := cfg.TestConfig()
const n = 2
_, switches := makeAndConnectReactors(config, n)
// stop reactors
for _, s := range switches {
require.NoError(t, s.Stop())
}
// check that we are not leaking any go-routines
// i.e. broadcastTxRoutine finishes when reactor is stopped
leaktest.CheckTimeout(t, 10*time.Second)()
}
func TestReactorTxSendersLocal(t *testing.T) {
config := cfg.TestConfig()
const n = 1
reactors, _ := makeAndConnectReactors(config, n)
defer func() {
for _, r := range reactors {
if err := r.Stop(); err != nil {
require.NoError(t, err)
}
}
}()
reactor := reactors[0]
tx1 := kvstore.NewTxFromID(1)
tx2 := kvstore.NewTxFromID(2)
require.False(t, reactor.isSender(types.Tx(tx1).Key(), "peer1"))
reactor.addSender(types.Tx(tx1).Key(), "peer1")
reactor.addSender(types.Tx(tx1).Key(), "peer2")
reactor.addSender(types.Tx(tx2).Key(), "peer1")
require.True(t, reactor.isSender(types.Tx(tx1).Key(), "peer1"))
require.True(t, reactor.isSender(types.Tx(tx1).Key(), "peer2"))
require.True(t, reactor.isSender(types.Tx(tx2).Key(), "peer1"))
reactor.removeSenders(types.Tx(tx1).Key())
require.False(t, reactor.isSender(types.Tx(tx1).Key(), "peer1"))
require.False(t, reactor.isSender(types.Tx(tx1).Key(), "peer2"))
require.True(t, reactor.isSender(types.Tx(tx2).Key(), "peer1"))
}
// Test that:
// - If a transaction came from a peer AND if the transaction is added to the
// mempool, it must have a non-empty list of senders in the reactor.
// - If a transaction is removed from the mempool, it must also be removed from
// the list of senders in the reactor.
func TestReactorTxSendersMultiNode(t *testing.T) {
config := cfg.TestConfig()
config.Mempool.Size = 1000
config.Mempool.CacheSize = 1000
const n = 3
reactors, _ := makeAndConnectReactors(config, n)
defer func() {
for _, r := range reactors {
if err := r.Stop(); err != nil {
require.NoError(t, err)
}
}
}()
for _, r := range reactors {
for _, peer := range r.Switch.Peers().Copy() {
peer.Set(types.PeerStateKey, peerState{1})
}
}
firstReactor := reactors[0]
numTxs := config.Mempool.Size
txs := newUniqueTxs(numTxs)
// Initially, there are no transactions (and no senders).
for _, r := range reactors {
require.Zero(t, len(r.txSenders))
}
// Add transactions to the first reactor.
callCheckTx(t, firstReactor.mempool, txs)
// Wait for all txs to be in the mempool of each reactor.
waitForReactors(t, txs, reactors, checkTxsInMempool)
for i, r := range reactors {
checkTxsInMempoolAndSenders(t, r, txs, i)
}
// Split the transactions in three groups of different sizes.
splitIndex := numTxs / 6
validTxs := txs[:splitIndex] // will be used to update the mempool, as valid txs
invalidTxs := txs[splitIndex : 3*splitIndex] // will be used to update the mempool, as invalid txs
ignoredTxs := txs[3*splitIndex:] // will remain in the mempool
// Update the mempools with a list of valid and invalid transactions.
for i, r := range reactors {
updateMempool(t, r.mempool, validTxs, invalidTxs)
// Txs included in a block should have been removed from the mempool and
// have no senders.
for _, tx := range append(validTxs, invalidTxs...) {
require.False(t, r.mempool.InMempool(tx.Key()))
_, hasSenders := r.txSenders[tx.Key()]
require.False(t, hasSenders)
}
// Ignored txs should still be in the mempool.
checkTxsInMempoolAndSenders(t, r, ignoredTxs, i)
}
// The first reactor should not receive transactions from other peers.
require.Zero(t, len(firstReactor.txSenders))
}
// Finding a solution for guaranteeing FIFO ordering is not easy; it would
// require changes at the p2p level. The order of messages is just best-effort,
// but this is not documented anywhere. If this is well understood and
// documented, we don't need this test. Until then, let's keep the test.
func TestMempoolFIFOWithParallelCheckTx(t *testing.T) {
t.Skip("FIFO is not supposed to be guaranteed and this this is just used to evidence one of the cases where it does not happen. Hence we skip this test.")
config := cfg.TestConfig()
reactors, _ := makeAndConnectReactors(config, 4)
defer func() {
for _, r := range reactors {
if err := r.Stop(); err != nil {
require.NoError(t, err)
}
}
}()
for _, r := range reactors {
for _, peer := range r.Switch.Peers().Copy() {
peer.Set(types.PeerStateKey, peerState{1})
}
}
// Deliver the same sequence of transactions from multiple sources, in parallel.
txs := newUniqueTxs(200)
mp := reactors[0].mempool
for i := 0; i < 3; i++ {
go func() {
for _, tx := range txs {
mp.CheckTx(tx) //nolint:errcheck
}
}()
}
// Confirm that FIFO order was respected.
checkTxsInOrder(t, txs, reactors[0], 0)
}
// Test the experimental feature that limits the number of outgoing connections for gossiping
// transactions (only non-persistent peers).
// Note: in this test we know which gossip connections are active or not because of how the p2p
// functions are currently implemented, which affects the order in which peers are added to the
// mempool reactor.
func TestMempoolReactorMaxActiveOutboundConnections(t *testing.T) {
config := cfg.TestConfig()
config.Mempool.ExperimentalMaxGossipConnectionsToNonPersistentPeers = 1
reactors, _ := makeAndConnectReactors(config, 4)
defer func() {
for _, r := range reactors {
if err := r.Stop(); err != nil {
require.NoError(t, err)
}
}
}()
for _, r := range reactors {
for _, peer := range r.Switch.Peers().Copy() {
peer.Set(types.PeerStateKey, peerState{1})
}
}
// Add a bunch transactions to the first reactor.
txs := newUniqueTxs(100)
callCheckTx(t, reactors[0].mempool, txs)
// Wait for all txs to be in the mempool of the second reactor; the other reactors should not
// receive any tx. (The second reactor only sends transactions to the first reactor.)
checkTxsInMempool(t, txs, reactors[1], 0)
for _, r := range reactors[2:] {
require.Zero(t, r.mempool.Size())
}
// Disconnect the second reactor from the first reactor.
firstPeer := reactors[0].Switch.Peers().Copy()[0]
reactors[0].Switch.StopPeerGracefully(firstPeer)
// Now the third reactor should start receiving transactions from the first reactor; the fourth
// reactor's mempool should still be empty.
checkTxsInMempool(t, txs, reactors[2], 0)
for _, r := range reactors[3:] {
require.Zero(t, r.mempool.Size())
}
}
// Test the experimental feature that limits the number of outgoing connections for gossiping
// transactions (only non-persistent peers).
// Given the disconnections, no transaction should be received in duplicate.
// Note: in this test we know which gossip connections are active or not because of how the p2p
// functions are currently implemented, which affects the order in which peers are added to the
// mempool reactor.
func TestMempoolReactorMaxActiveOutboundConnectionsNoDuplicate(t *testing.T) {
config := cfg.TestConfig()
config.Mempool.ExperimentalMaxGossipConnectionsToNonPersistentPeers = 1
reactors, _ := makeAndConnectReactors(config, 4)
defer func() {
for _, r := range reactors {
if err := r.Stop(); err != nil {
require.NoError(t, err)
}
}
}()
for _, r := range reactors {
for _, peer := range r.Switch.Peers().Copy() {
peer.Set(types.PeerStateKey, peerState{1})
}
}
// Disconnect the second reactor from the third reactor.
pCon1_2 := reactors[1].Switch.Peers().Copy()[1]
reactors[1].Switch.StopPeerGracefully(pCon1_2)
// Add a bunch transactions to the first reactor.
txs := newUniqueTxs(100)
callCheckTx(t, reactors[0].mempool, txs)
// Wait for all txs to be in the mempool of the second reactor; the other reactors should not
// receive any tx. (The second reactor only sends transactions to the first reactor.)
checkTxsInOrder(t, txs, reactors[1], 0)
for _, r := range reactors[2:] {
require.Zero(t, r.mempool.Size())
}
// Disconnect the second reactor from the first reactor.
pCon0_1 := reactors[0].Switch.Peers().Copy()[0]
reactors[0].Switch.StopPeerGracefully(pCon0_1)
// Now the third reactor should start receiving transactions from the first reactor and
// the fourth reactor from the second
checkTxsInOrder(t, txs, reactors[2], 0)
checkTxsInOrder(t, txs, reactors[3], 0)
}
// Test the experimental feature that limits the number of outgoing connections for gossiping
// transactions (only non-persistent peers) on a star shaped network.
// The star center will need to deliver the transactions to each point.
// Note: in this test we know which gossip connections are active or not because of how the p2p
// functions are currently implemented, which affects the order in which peers are added to the
// mempool reactor.
func TestMempoolReactorMaxActiveOutboundConnectionsStar(t *testing.T) {
config := cfg.TestConfig()
config.Mempool.ExperimentalMaxGossipConnectionsToNonPersistentPeers = 1
reactors, _ := makeAndConnectReactorsStar(config, 0, 4)
defer func() {
for _, r := range reactors {
if err := r.Stop(); err != nil {
require.NoError(t, err)
}
}
}()
for _, r := range reactors {
for _, peer := range r.Switch.Peers().Copy() {
peer.Set(types.PeerStateKey, peerState{1})
}
}
// Add a bunch transactions to the first reactor.
txs := newUniqueTxs(5)
callCheckTx(t, reactors[0].mempool, txs)
// Wait for all txs to be in the mempool of the second reactor; the other reactors should not
// receive any tx. (The second reactor only sends transactions to the first reactor.)
checkTxsInOrder(t, txs, reactors[0], 0)
checkTxsInOrder(t, txs, reactors[1], 0)
for _, r := range reactors[2:] {
require.Zero(t, r.mempool.Size())
}
// Disconnect the second reactor from the first reactor.
firstPeer := reactors[0].Switch.Peers().Copy()[0]
reactors[0].Switch.StopPeerGracefully(firstPeer)
// Now the third reactor should start receiving transactions from the first reactor; the fourth
// reactor's mempool should still be empty.
checkTxsInOrder(t, txs, reactors[0], 0)
checkTxsInOrder(t, txs, reactors[1], 0)
checkTxsInOrder(t, txs, reactors[2], 0)
for _, r := range reactors[3:] {
require.Zero(t, r.mempool.Size())
}
}
// Check that the mempool has exactly the given list of txs and, if it's not the
// first reactor (reactorIndex == 0), then each tx has a non-empty list of senders.
func checkTxsInMempoolAndSenders(t *testing.T, r *Reactor, txs types.Txs, reactorIndex int) {
t.Helper()
r.txSendersMtx.Lock()
defer r.txSendersMtx.Unlock()
require.Len(t, txs, r.mempool.Size())
if reactorIndex == 0 {
require.Zero(t, len(r.txSenders))
} else {
require.Equal(t, len(txs), len(r.txSenders))
}
// Each transaction is in the mempool and, if it's not the first reactor, it
// has a non-empty list of senders.
for _, tx := range txs {
assert.True(t, r.mempool.InMempool(tx.Key()))
senders, hasSenders := r.txSenders[tx.Key()]
if reactorIndex == 0 {
require.False(t, hasSenders)
} else {
require.True(t, hasSenders && len(senders) > 0)
}
}
}
// mempoolLogger is a TestingLogger which uses a different
// color for each validator ("validator" key must exist).
func mempoolLogger() log.Logger {
return log.TestingLoggerWithColorFn(func(keyvals ...any) term.FgBgColor {
for i := 0; i < len(keyvals)-1; i += 2 {
if keyvals[i] == "validator" {
return term.FgBgColor{Fg: term.Color(uint8(keyvals[i+1].(int) + 1))}
}
}
return term.FgBgColor{}
})
}
// connect N mempool reactors through N switches.
func makeAndConnectReactors(config *cfg.Config, n int) ([]*Reactor, []*p2p.Switch) {
reactors := make([]*Reactor, n)
logger := mempoolLogger()
for i := 0; i < n; i++ {
app := kvstore.NewInMemoryApplication()
cc := proxy.NewLocalClientCreator(app)
mempool, cleanup := newMempoolWithApp(cc)
defer cleanup()
reactors[i] = NewReactor(config.Mempool, mempool, false) // so we dont start the consensus states
reactors[i].SetLogger(logger.With("validator", i))
}
switches := p2p.MakeConnectedSwitches(config.P2P, n, func(i int, s *p2p.Switch) *p2p.Switch {
s.AddReactor("MEMPOOL", reactors[i])
return s
}, p2p.Connect2Switches)
return reactors, switches
}
// connect N mempool reactors through N switches as a star centered in c.
func makeAndConnectReactorsStar(config *cfg.Config, c, n int) ([]*Reactor, []*p2p.Switch) {
reactors := make([]*Reactor, n)
logger := mempoolLogger()
for i := 0; i < n; i++ {
app := kvstore.NewInMemoryApplication()
cc := proxy.NewLocalClientCreator(app)
mempool, cleanup := newMempoolWithApp(cc)
defer cleanup()
reactors[i] = NewReactor(config.Mempool, mempool, false) // so we dont start the consensus states
reactors[i].SetLogger(logger.With("validator", i))
}
switches := p2p.MakeConnectedSwitches(config.P2P, n, func(i int, s *p2p.Switch) *p2p.Switch {
s.AddReactor("MEMPOOL", reactors[i])
return s
}, p2p.ConnectStarSwitches(c))
return reactors, switches
}
func newUniqueTxs(n int) types.Txs {
txs := make(types.Txs, n)
for i := 0; i < n; i++ {
txs[i] = kvstore.NewTxFromID(i)
}
return txs
}
// Wait for all reactors to finish applying a testing function to a list of
// transactions.
func waitForReactors(t *testing.T, txs types.Txs, reactors []*Reactor, testFunc func(*testing.T, types.Txs, *Reactor, int)) {
t.Helper()
wg := new(sync.WaitGroup)
for i, reactor := range reactors {
wg.Add(1)
go func(r *Reactor, reactorIndex int) {
defer wg.Done()
testFunc(t, txs, r, reactorIndex)
}(reactor, i)
}
done := make(chan struct{})
go func() {
wg.Wait()
close(done)
}()
timer := time.After(timeout)
select {
case <-timer:
t.Fatal("Timed out waiting for txs")
case <-done:
}
}
// Wait until the mempool has a certain number of transactions.
func waitForNumTxsInMempool(numTxs int, mempool Mempool) {
for mempool.Size() < numTxs {
time.Sleep(time.Millisecond * 100)
}
}
// Wait until all txs are in the mempool and check that the number of txs in the
// mempool is as expected.
func checkTxsInMempool(t *testing.T, txs types.Txs, reactor *Reactor, _ int) {
t.Helper()
waitForNumTxsInMempool(len(txs), reactor.mempool)
reapedTxs := reactor.mempool.ReapMaxTxs(len(txs))
require.Len(t, txs, len(reapedTxs))
require.Len(t, txs, reactor.mempool.Size())
}
// Wait until all txs are in the mempool and check that they are in the same
// order as given.
func checkTxsInOrder(t *testing.T, txs types.Txs, reactor *Reactor, reactorIndex int) {
t.Helper()
waitForNumTxsInMempool(len(txs), reactor.mempool)
// Check that all transactions in the mempool are in the same order as txs.
reapedTxs := reactor.mempool.ReapMaxTxs(len(txs))
for i, tx := range txs {
assert.Equalf(t, tx, reapedTxs[i],
"txs at index %d on reactor %d don't match: %v vs %v", i, reactorIndex, tx, reapedTxs[i])
}
}
func updateMempool(t *testing.T, mp Mempool, validTxs types.Txs, invalidTxs types.Txs) {
t.Helper()
allTxs := append(validTxs, invalidTxs...)
validTxResponses := abciResponses(len(validTxs), abci.CodeTypeOK)
invalidTxResponses := abciResponses(len(invalidTxs), 1)
allResponses := append(validTxResponses, invalidTxResponses...)
mp.Lock()
err := mp.Update(1, allTxs, allResponses, nil, nil)
mp.Unlock()
require.NoError(t, err)
}
// ensure no txs on reactor after some timeout.
func ensureNoTxs(t *testing.T, reactor *Reactor, timeout time.Duration) {
t.Helper()
time.Sleep(timeout) // wait for the txs in all mempools
assert.Zero(t, reactor.mempool.Size())
}
func TestMempoolVectors(t *testing.T) {
testCases := []struct {
testName string
tx []byte
expBytes string
}{
{"tx 1", []byte{123}, "0a030a017b"},
{"tx 2", []byte("proto encoding in mempool"), "0a1b0a1970726f746f20656e636f64696e6720696e206d656d706f6f6c"},
}
for _, tc := range testCases {
tc := tc
msg := memproto.Message{
Sum: &memproto.Message_Txs{
Txs: &memproto.Txs{Txs: [][]byte{tc.tx}},
},
}
bz, err := msg.Marshal()
require.NoError(t, err, tc.testName)
require.Equal(t, tc.expBytes, hex.EncodeToString(bz), tc.testName)
}
}