forked from dominant-strategies/go-quai
-
Notifications
You must be signed in to change notification settings - Fork 0
/
handler.go
525 lines (461 loc) · 17.1 KB
/
handler.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
// Copyright 2015 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 eth
import (
"errors"
"math"
"math/big"
"math/rand"
"sync"
"sync/atomic"
"time"
"github.com/dominant-strategies/go-quai/common"
"github.com/dominant-strategies/go-quai/core"
"github.com/dominant-strategies/go-quai/core/forkid"
"github.com/dominant-strategies/go-quai/core/types"
"github.com/dominant-strategies/go-quai/eth/downloader"
"github.com/dominant-strategies/go-quai/eth/fetcher"
"github.com/dominant-strategies/go-quai/eth/protocols/eth"
"github.com/dominant-strategies/go-quai/ethdb"
"github.com/dominant-strategies/go-quai/event"
"github.com/dominant-strategies/go-quai/log"
"github.com/dominant-strategies/go-quai/p2p"
lru "github.com/hashicorp/golang-lru"
)
const (
// txChanSize is the size of channel listening to NewTxsEvent.
// The number is referenced from the size of tx pool.
txChanSize = 4096
// missingBlockChanSize is the size of channel listening to the MissingBlockEvent
missingBlockChanSize = 60
// minPeerSend is the threshold for sending the block updates. If
// sqrt of len(peers) is less than 5 we make the block announcement
// to as much as minPeerSend peers otherwise send it to sqrt of len(peers).
minPeerSend = 5
// minPeerRequest is the threshold for requesting the body. If
// sqrt of len(peers) is less than minPeerRequest we make the body request
// to as much as minPeerSend peers otherwise send it to sqrt of len(peers).
minPeerRequest = 3
// minPeerSendTx is the minimum number of peers that will receive a new transaction.
minPeerSendTx = 2
// c_broadcastCacheSize is the Max number of broadcast block hashes to be kept for Logging
c_broadcastCacheSize = 10
// c_subSyncCacheSize is the Max number of block hashes requested from peers
c_subSyncCacheSize = 100000
)
// txPool defines the methods needed from a transaction pool implementation to
// support all the operations needed by the Quai chain protocols.
type txPool interface {
// Has returns an indicator whether txpool has a transaction
// cached with the given hash.
Has(hash common.Hash) bool
// Get retrieves the transaction from local txpool with given
// tx hash.
Get(hash common.Hash) *types.Transaction
// AddRemotes should add the given transactions to the pool.
AddRemotes([]*types.Transaction) []error
// Pending should return pending transactions.
// The slice should be modifiable by the caller.
TxPoolPending(enforceTips bool, etxSet types.EtxSet) (map[common.AddressBytes]types.Transactions, error)
// SubscribeNewTxsEvent should return an event subscription of
// NewTxsEvent and send events to the given channel.
SubscribeNewTxsEvent(chan<- core.NewTxsEvent) event.Subscription
}
// handlerConfig is the collection of initialization parameters to create a full
// node network handler.
type handlerConfig struct {
Database ethdb.Database // Database for direct sync insertions
Core *core.Core // Core to serve data from
TxPool txPool // Transaction pool to propagate from
Network uint64 // Network identifier to adfvertise
Sync downloader.SyncMode // Whether to fast or full sync
BloomCache uint64 // Megabytes to alloc for fast sync bloom
EventMux *event.TypeMux // Legacy event mux, deprecate for `feed`
Whitelist map[uint64]common.Hash // Hard coded whitelist for sync challenged
SlicesRunning []common.Location // Slices run by the node
}
type handler struct {
networkID uint64
forkFilter forkid.Filter // Fork ID filter, constant across the lifetime of the node
slicesRunning []common.Location // Slices running on the node
acceptTxs uint32 // Flag whether we're considered synchronised (enables transaction processing)
database ethdb.Database
txpool txPool
core *core.Core
maxPeers int
downloader *downloader.Downloader
blockFetcher *fetcher.BlockFetcher
txFetcher *fetcher.TxFetcher
peers *peerSet
eventMux *event.TypeMux
txsCh chan core.NewTxsEvent
txsSub event.Subscription
minedBlockSub *event.TypeMuxSubscription
missingBlockCh chan types.BlockRequest
missingBlockSub event.Subscription
subSyncQueue *lru.Cache
whitelist map[uint64]common.Hash
// channels for fetcher, syncer, txsyncLoop
txsyncCh chan *txsync
quitSync chan struct{}
chainSync *chainSyncer
wg sync.WaitGroup
peerWG sync.WaitGroup
broadcastCache *lru.Cache
}
// newHandler returns a handler for all Quai chain management protocol.
func newHandler(config *handlerConfig) (*handler, error) {
nodeCtx := common.NodeLocation.Context()
// Create the protocol manager with the base fields
if config.EventMux == nil {
config.EventMux = new(event.TypeMux) // Nicety initialization for tests
}
h := &handler{
networkID: config.Network,
slicesRunning: config.SlicesRunning,
forkFilter: forkid.NewFilter(config.Core),
eventMux: config.EventMux,
database: config.Database,
txpool: config.TxPool,
core: config.Core,
peers: newPeerSet(),
whitelist: config.Whitelist,
txsyncCh: make(chan *txsync),
quitSync: make(chan struct{}),
}
broadcastCache, _ := lru.New(c_broadcastCacheSize)
h.broadcastCache = broadcastCache
subSyncQueue, _ := lru.New(c_subSyncCacheSize)
h.subSyncQueue = subSyncQueue
h.downloader = downloader.New(h.eventMux, h.core, h.removePeer)
// Construct the fetcher (short sync)
validator := func(header *types.Header) error {
return h.core.Engine().VerifyHeader(h.core, header)
}
verifySeal := func(header *types.Header) (common.Hash, error) {
return h.core.Engine().VerifySeal(header)
}
heighter := func() uint64 {
return h.core.CurrentHeader().NumberU64()
}
currentThresholdS := func() *big.Int {
return h.core.Engine().IntrinsicLogS(h.core.CurrentHeader().Hash())
}
currentS := func() *big.Int {
// This is the sync target entropy which updates based on the block broadcasts
entropy, _ := h.core.SyncTargetEntropy()
return entropy
}
currentDifficulty := func() *big.Int {
return h.core.CurrentHeader().Difficulty()
}
// writeBlock writes the block to the DB
writeBlock := func(block *types.Block) {
if nodeCtx == common.ZONE_CTX && block.NumberU64()-1 == h.core.CurrentHeader().NumberU64() && h.core.ProcessingState() {
if atomic.LoadUint32(&h.acceptTxs) != 1 {
atomic.StoreUint32(&h.acceptTxs, 1)
}
}
h.core.WriteBlock(block)
}
h.blockFetcher = fetcher.NewBlockFetcher(h.core.GetBlockOrCandidateByHash, writeBlock, validator, verifySeal, h.BroadcastBlock, heighter, currentThresholdS, currentS, currentDifficulty, h.removePeer, h.core.IsBlockHashABadHash)
// Only initialize the Tx fetcher in zone
if nodeCtx == common.ZONE_CTX && h.core.ProcessingState() {
fetchTx := func(peer string, hashes []common.Hash) error {
p := h.peers.peer(peer)
if p == nil {
return errors.New("unknown peer")
}
return p.RequestTxs(hashes)
}
h.txFetcher = fetcher.NewTxFetcher(h.txpool.Has, h.txpool.AddRemotes, fetchTx)
}
h.chainSync = newChainSyncer(h)
return h, nil
}
// runEthPeer registers an eth peer into the joint eth peerset, adds it to
// various subsystems and starts handling messages.
func (h *handler) runEthPeer(peer *eth.Peer, handler eth.Handler) error {
nodeCtx := common.NodeLocation.Context()
if !h.chainSync.handlePeerEvent(peer) {
return p2p.DiscQuitting
}
h.peerWG.Add(1)
defer h.peerWG.Done()
// Execute the Quai handshake
var (
genesis = h.core.Genesis()
head = h.core.CurrentHeader()
hash = head.Hash()
entropy = h.core.CurrentLogEntropy()
)
forkID := forkid.NewID(h.core.Config(), h.core.Genesis().Hash(), h.core.CurrentHeader().Number().Uint64())
if err := peer.Handshake(h.networkID, h.slicesRunning, entropy, hash, genesis.Hash(), forkID, h.forkFilter); err != nil {
peer.Log().Debug("Quai handshake failed", "err", err)
return err
}
reject := false // reserved peer slots
// Ignore maxPeers if this is a trusted peer
if !peer.Peer.Info().Network.Trusted {
if reject || h.peers.len() >= h.maxPeers {
return p2p.DiscTooManyPeers
}
}
peer.Log().Debug("Quai peer connected", "name", peer.Name())
// Register the peer locally
if err := h.peers.registerPeer(peer); err != nil {
peer.Log().Error("Quai peer registration failed", "err", err)
return err
}
defer h.unregisterPeer(peer.ID())
p := h.peers.peer(peer.ID())
if p == nil {
return errors.New("peer dropped during handling")
}
// Register the peer in the downloader. If the downloader considers it banned, we disconnect
if err := h.downloader.RegisterPeer(peer.ID(), peer.Version(), peer); err != nil {
peer.Log().Error("Failed to register peer in eth syncer", "err", err)
return err
}
h.chainSync.handlePeerEvent(peer)
if nodeCtx == common.ZONE_CTX && h.core.ProcessingState() {
// Propagate existing transactions. new transactions appearing
// after this will be sent via broadcasts.
h.syncTransactions(peer)
}
// If we have any explicit whitelist block hashes, request them
for number := range h.whitelist {
if err := peer.RequestHeadersByNumber(number, 1, 1, 0, false, false); err != nil {
return err
}
}
// Handle incoming messages until the connection is torn down
return handler(peer)
}
// removePeer requests disconnection of a peer.
func (h *handler) removePeer(id string) {
peer := h.peers.peer(id)
if peer != nil {
peer.Peer.Disconnect(p2p.DiscUselessPeer)
}
}
// unregisterPeer removes a peer from the downloader, fetchers and main peer set.
func (h *handler) unregisterPeer(id string) {
// Create a custom logger to avoid printing the entire id
var logger log.Logger
if len(id) < 16 {
// Tests use short IDs, don't choke on them
logger = log.Log
} else {
logger = log.Log
}
// Abort if the peer does not exist
peer := h.peers.peer(id)
if peer == nil {
logger.Error("Quai peer removal failed", "err", errPeerNotRegistered)
return
}
h.downloader.UnregisterPeer(id)
nodeCtx := common.NodeLocation.Context()
if nodeCtx == common.ZONE_CTX && h.core.ProcessingState() {
h.txFetcher.Drop(id)
}
if err := h.peers.unregisterPeer(id); err != nil {
logger.Error("Quai peer removal failed", "err", err)
}
}
func (h *handler) Start(maxPeers int) {
h.maxPeers = maxPeers
nodeCtx := common.NodeLocation.Context()
if nodeCtx == common.ZONE_CTX && h.core.ProcessingState() {
// broadcast transactions
h.wg.Add(1)
h.txsCh = make(chan core.NewTxsEvent, txChanSize)
h.txsSub = h.txpool.SubscribeNewTxsEvent(h.txsCh)
go h.txBroadcastLoop()
}
h.wg.Add(1)
h.missingBlockCh = make(chan types.BlockRequest, missingBlockChanSize)
h.missingBlockSub = h.core.SubscribeMissingBlockEvent(h.missingBlockCh)
go h.missingBlockLoop()
// broadcast mined blocks
h.wg.Add(1)
h.minedBlockSub = h.eventMux.Subscribe(core.NewMinedBlockEvent{})
go h.minedBroadcastLoop()
// start sync handlers
h.wg.Add(1)
go h.chainSync.loop()
if nodeCtx == common.ZONE_CTX && h.core.ProcessingState() {
h.wg.Add(1)
go h.txsyncLoop64() //Legacy initial tx echange, drop with eth/64.
}
}
func (h *handler) Stop() {
nodeCtx := common.NodeLocation.Context()
if nodeCtx == common.ZONE_CTX && h.core.ProcessingState() {
h.txsSub.Unsubscribe() // quits txBroadcastLoop
}
h.minedBlockSub.Unsubscribe() // quits blockBroadcastLoop
h.missingBlockSub.Unsubscribe() // quits missingBlockLoop
// Quit chainSync and txsync64.
// After this is done, no new peers will be accepted.
close(h.quitSync)
h.wg.Wait()
// Disconnect existing sessions.
// This also closes the gate for any new registrations on the peer set.
// sessions which are already established but not added to h.peers yet
// will exit when they try to register.
h.peers.close()
h.peerWG.Wait()
log.Info("Quai protocol stopped")
}
// BroadcastBlock will either propagate a block to a subset of its peers, or
// will only announce its availability (depending what's requested).
func (h *handler) BroadcastBlock(block *types.Block, propagate bool) {
hash := block.Hash()
peers := h.peers.peersWithoutBlock(hash)
// If propagation is requested, send to a subset of the peer
if propagate {
// Send the block to a subset of our peers
var peerThreshold int
sqrtNumPeers := int(math.Sqrt(float64(len(peers))))
if sqrtNumPeers < minPeerSend {
peerThreshold = len(peers)
} else {
peerThreshold = sqrtNumPeers
}
transfer := peers[:peerThreshold]
for _, peer := range transfer {
currentHead := h.core.CurrentHeader()
entropy := big.NewInt(0)
if currentHead != nil {
entropy = h.core.Engine().TotalLogS(h.core.CurrentHeader())
}
peer.AsyncSendNewBlock(block, entropy)
}
log.Trace("Propagated block", "hash", hash, "recipients", len(transfer), "duration", common.PrettyDuration(time.Since(block.ReceivedAt)))
return
}
// Otherwise if the block is indeed in out own chain, announce it
if h.core.HasBlock(hash, block.NumberU64()) {
for _, peer := range peers {
peer.AsyncSendNewBlockHash(block)
}
log.Trace("Announced block", "hash", hash, "recipients", len(peers), "duration", common.PrettyDuration(time.Since(block.ReceivedAt)))
}
}
// BroadcastTransactions will propagate a batch of transactions
// - To a square root of all peers
// - And, separately, as announcements to all peers which are not known to
// already have the given transaction.
func (h *handler) BroadcastTransactions(txs types.Transactions) {
var (
annoCount int // Count of announcements made
annoPeers int
directCount int // Count of the txs sent directly to peers
directPeers int // Count of the peers that were sent transactions directly
txset = make(map[*ethPeer][]common.Hash) // Set peer->hash to transfer directly
annos = make(map[*ethPeer][]common.Hash) // Set peer->hash to announce
)
// Broadcast transactions to a batch of peers not knowing about it
for _, tx := range txs {
peers := h.peers.peersWithoutTransaction(tx.Hash())
// Send the tx unconditionally to a subset of our peers
numDirect := int(math.Sqrt(float64(len(peers))))
subset := peers[:numDirect]
if len(subset) < minPeerSendTx {
// If we have less peers than the minimum, send to all peers
if len(peers) < minPeerSendTx {
subset = peers
} else {
// If our subset is less than the minimum, send to the minimum
subset = peers[:minPeerSendTx] // The high bound is exclusive
}
}
for _, peer := range subset {
txset[peer] = append(txset[peer], tx.Hash())
}
// For the remaining peers, send announcement only
for _, peer := range peers[numDirect:] {
annos[peer] = append(annos[peer], tx.Hash())
}
}
for peer, hashes := range txset {
directPeers++
directCount += len(hashes)
peer.AsyncSendTransactions(hashes)
}
for peer, hashes := range annos {
annoPeers++
annoCount += len(hashes)
peer.AsyncSendPooledTransactionHashes(hashes)
}
log.Debug("Transaction broadcast", "txs", len(txs),
"announce packs", annoPeers, "announced hashes", annoCount,
"tx packs", directPeers, "broadcast txs", directCount)
}
// minedBroadcastLoop sends mined blocks to connected peers.
func (h *handler) minedBroadcastLoop() {
defer h.wg.Done()
for obj := range h.minedBlockSub.Chan() {
if ev, ok := obj.Data.(core.NewMinedBlockEvent); ok {
h.BroadcastBlock(ev.Block, true) // First propagate block to peers
h.BroadcastBlock(ev.Block, false) // Only then announce to the rest
}
}
}
// txBroadcastLoop announces new transactions to connected peers.
func (h *handler) txBroadcastLoop() {
defer h.wg.Done()
for {
select {
case event := <-h.txsCh:
h.BroadcastTransactions(event.Txs)
case <-h.txsSub.Err():
return
}
}
}
// missingBlockLoop announces new pendingEtxs to connected peers.
func (h *handler) missingBlockLoop() {
defer h.wg.Done()
for {
select {
case blockRequest := <-h.missingBlockCh:
headerRequested := 0
// Check if any of the peers have the body
allPeers := h.peers.allPeers()
// shuffle the filteredPeers
rand.Shuffle(len(allPeers), func(i, j int) { allPeers[i], allPeers[j] = allPeers[j], allPeers[i] })
for _, peer := range allPeers {
log.Trace("Fetching the missing parent from", "peer", peer.ID(), "hash", blockRequest.Hash)
_, _, peerEntropy, _ := peer.Head()
if peerEntropy != nil {
if peerEntropy.Cmp(blockRequest.Entropy) > 0 {
peer.RequestBlockByHash(blockRequest.Hash)
headerRequested++
}
}
if headerRequested == minPeerRequest {
break
}
}
h.subSyncQueue.ContainsOrAdd(blockRequest.Hash, blockRequest)
case <-h.missingBlockSub.Err():
return
}
}
}