You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

101 lines
3.0 KiB

mempool no gossip back (#2778) Closes #1798 This is done by making every mempool tx maintain a list of peers who its received the tx from. Instead of using the 20byte peer ID, it instead uses a local map from peerID to uint16 counter, so every peer adds 2 bytes. (Word aligned to probably make it 8 bytes) This also required resetting the callback function on every CheckTx. This likely has performance ramifications for instruction caching. The actual setting operation isn't costly with the removal of defers in this PR. * Make the mempool not gossip txs back to peers its received it from * Fix adversarial memleak * Don't break interface * Update changelog * Forgot to add a mtx * forgot a mutex * Update mempool/reactor.go Co-Authored-By: ValarDragon <ValarDragon@users.noreply.github.com> * Update mempool/mempool.go Co-Authored-By: ValarDragon <ValarDragon@users.noreply.github.com> * Use unknown peer ID Co-Authored-By: ValarDragon <ValarDragon@users.noreply.github.com> * fix compilation * use next wait chan logic when skipping * Minor fixes * Add TxInfo * Add reverse map * Make activeID's auto-reserve 0 * 0 -> UnknownPeerID Co-Authored-By: ValarDragon <ValarDragon@users.noreply.github.com> * Switch to making the normal case set a callback on the reqres object The recheck case is still done via the global callback, and stats are also set via global callback * fix merge conflict * Addres comments * Add cache tests * add cache tests * minor fixes * update metrics in reqResCb and reformat code * goimport -w mempool/reactor.go * mempool: update memTx senders I had to introduce txsMap for quick mempoolTx lookups. * change senders type from []uint16 to sync.Map Fixes DATA RACE: ``` Read at 0x00c0013fcd3a by goroutine 183: github.com/tendermint/tendermint/mempool.(*MempoolReactor).broadcastTxRoutine() /go/src/github.com/tendermint/tendermint/mempool/reactor.go:195 +0x3c7 Previous write at 0x00c0013fcd3a by D[2019-02-27|10:10:49.058] Read PacketMsg switch=3 peer=35bc1e3558c182927b31987eeff3feb3d58a0fc5@127.0.0.1 :46552 conn=MConn{pipe} packet="PacketMsg{30:2B06579D0A143EB78F3D3299DE8213A51D4E11FB05ACE4D6A14F T:1}" goroutine 190: github.com/tendermint/tendermint/mempool.(*Mempool).CheckTxWithInfo() /go/src/github.com/tendermint/tendermint/mempool/mempool.go:387 +0xdc1 github.com/tendermint/tendermint/mempool.(*MempoolReactor).Receive() /go/src/github.com/tendermint/tendermint/mempool/reactor.go:134 +0xb04 github.com/tendermint/tendermint/p2p.createMConnection.func1() /go/src/github.com/tendermint/tendermint/p2p/peer.go:374 +0x25b github.com/tendermint/tendermint/p2p/conn.(*MConnection).recvRoutine() /go/src/github.com/tendermint/tendermint/p2p/conn/connection.go:599 +0xcce Goroutine 183 (running) created at: D[2019-02-27|10:10:49.058] Send switch=2 peer=1efafad5443abeea4b7a8155218e4369525d987e@127.0.0.1:46193 channel=48 conn=MConn{pipe} m sgBytes=2B06579D0A146194480ADAE00C2836ED7125FEE65C1D9DD51049 github.com/tendermint/tendermint/mempool.(*MempoolReactor).AddPeer() /go/src/github.com/tendermint/tendermint/mempool/reactor.go:105 +0x1b1 github.com/tendermint/tendermint/p2p.(*Switch).startInitPeer() /go/src/github.com/tendermint/tendermint/p2p/switch.go:683 +0x13b github.com/tendermint/tendermint/p2p.(*Switch).addPeer() /go/src/github.com/tendermint/tendermint/p2p/switch.go:650 +0x585 github.com/tendermint/tendermint/p2p.(*Switch).addPeerWithConnection() /go/src/github.com/tendermint/tendermint/p2p/test_util.go:145 +0x939 github.com/tendermint/tendermint/p2p.Connect2Switches.func2() /go/src/github.com/tendermint/tendermint/p2p/test_util.go:109 +0x50 I[2019-02-27|10:10:49.058] Added good transaction validator=0 tx=43B4D1F0F03460BD262835C4AA560DB860CFBBE85BD02386D83DAC38C67B3AD7 res="&{CheckTx:gas_w anted:1 }" height=0 total=375 Goroutine 190 (running) created at: github.com/tendermint/tendermint/p2p/conn.(*MConnection).OnStart() /go/src/github.com/tendermint/tendermint/p2p/conn/connection.go:210 +0x313 github.com/tendermint/tendermint/libs/common.(*BaseService).Start() /go/src/github.com/tendermint/tendermint/libs/common/service.go:139 +0x4df github.com/tendermint/tendermint/p2p.(*peer).OnStart() /go/src/github.com/tendermint/tendermint/p2p/peer.go:179 +0x56 github.com/tendermint/tendermint/libs/common.(*BaseService).Start() /go/src/github.com/tendermint/tendermint/libs/common/service.go:139 +0x4df github.com/tendermint/tendermint/p2p.(*peer).Start() <autogenerated>:1 +0x43 github.com/tendermint/tendermint/p2p.(*Switch).startInitPeer() ``` * explain the choice of a map DS for senders * extract ids pool/mapper to a separate struct * fix literal copies lock value from senders: sync.Map contains sync.Mutex * use sync.Map#LoadOrStore instead of Load * fixes after Ismail's review * rename resCbNormal to resCbFirstTime
6 years ago
  1. package mempool
  2. import (
  3. "crypto/rand"
  4. "crypto/sha256"
  5. "testing"
  6. "github.com/stretchr/testify/require"
  7. "github.com/tendermint/tendermint/abci/example/kvstore"
  8. "github.com/tendermint/tendermint/proxy"
  9. "github.com/tendermint/tendermint/types"
  10. )
  11. func TestCacheRemove(t *testing.T) {
  12. cache := newMapTxCache(100)
  13. numTxs := 10
  14. txs := make([][]byte, numTxs)
  15. for i := 0; i < numTxs; i++ {
  16. // probability of collision is 2**-256
  17. txBytes := make([]byte, 32)
  18. rand.Read(txBytes)
  19. txs[i] = txBytes
  20. cache.Push(txBytes)
  21. // make sure its added to both the linked list and the map
  22. require.Equal(t, i+1, len(cache.map_))
  23. require.Equal(t, i+1, cache.list.Len())
  24. }
  25. for i := 0; i < numTxs; i++ {
  26. cache.Remove(txs[i])
  27. // make sure its removed from both the map and the linked list
  28. require.Equal(t, numTxs-(i+1), len(cache.map_))
  29. require.Equal(t, numTxs-(i+1), cache.list.Len())
  30. }
  31. }
  32. func TestCacheAfterUpdate(t *testing.T) {
  33. app := kvstore.NewKVStoreApplication()
  34. cc := proxy.NewLocalClientCreator(app)
  35. mempool, cleanup := newMempoolWithApp(cc)
  36. defer cleanup()
  37. // reAddIndices & txsInCache can have elements > numTxsToCreate
  38. // also assumes max index is 255 for convenience
  39. // txs in cache also checks order of elements
  40. tests := []struct {
  41. numTxsToCreate int
  42. updateIndices []int
  43. reAddIndices []int
  44. txsInCache []int
  45. }{
  46. {1, []int{}, []int{1}, []int{1, 0}}, // adding new txs works
  47. {2, []int{1}, []int{}, []int{1, 0}}, // update doesn't remove tx from cache
  48. {2, []int{2}, []int{}, []int{2, 1, 0}}, // update adds new tx to cache
  49. {2, []int{1}, []int{1}, []int{1, 0}}, // re-adding after update doesn't make dupe
  50. }
  51. for tcIndex, tc := range tests {
  52. for i := 0; i < tc.numTxsToCreate; i++ {
  53. tx := types.Tx{byte(i)}
  54. err := mempool.CheckTx(tx, nil)
  55. require.NoError(t, err)
  56. }
  57. updateTxs := []types.Tx{}
  58. for _, v := range tc.updateIndices {
  59. tx := types.Tx{byte(v)}
  60. updateTxs = append(updateTxs, tx)
  61. }
  62. mempool.Update(int64(tcIndex), updateTxs, nil, nil)
  63. for _, v := range tc.reAddIndices {
  64. tx := types.Tx{byte(v)}
  65. _ = mempool.CheckTx(tx, nil)
  66. }
  67. cache := mempool.cache.(*mapTxCache)
  68. node := cache.list.Front()
  69. counter := 0
  70. for node != nil {
  71. require.NotEqual(t, len(tc.txsInCache), counter,
  72. "cache larger than expected on testcase %d", tcIndex)
  73. nodeVal := node.Value.([sha256.Size]byte)
  74. expectedBz := sha256.Sum256([]byte{byte(tc.txsInCache[len(tc.txsInCache)-counter-1])})
  75. // Reference for reading the errors:
  76. // >>> sha256('\x00').hexdigest()
  77. // '6e340b9cffb37a989ca544e6bb780a2c78901d3fb33738768511a30617afa01d'
  78. // >>> sha256('\x01').hexdigest()
  79. // '4bf5122f344554c53bde2ebb8cd2b7e3d1600ad631c385a5d7cce23c7785459a'
  80. // >>> sha256('\x02').hexdigest()
  81. // 'dbc1b4c900ffe48d575b5da5c638040125f65db0fe3e24494b76ea986457d986'
  82. require.Equal(t, expectedBz, nodeVal, "Equality failed on index %d, tc %d", counter, tcIndex)
  83. counter++
  84. node = node.Next()
  85. }
  86. require.Equal(t, len(tc.txsInCache), counter,
  87. "cache smaller than expected on testcase %d", tcIndex)
  88. mempool.Flush()
  89. }
  90. }