github.com/m3shine/gochain@v2.2.26+incompatible/eth/sync.go

// 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 (
	"context"
	"math"
	"sync/atomic"
	"time"

	"go.opencensus.io/trace"

	"github.com/gochain-io/gochain/common"
	"github.com/gochain-io/gochain/core/types"
	"github.com/gochain-io/gochain/eth/downloader"
	"github.com/gochain-io/gochain/log"
	"github.com/gochain-io/gochain/p2p/discover"
)

const (
	forceSyncCycle      = 10 * time.Second // Time interval to force syncs, even if few peers are available
	minDesiredPeerCount = 5                // Amount of peers desired to start syncing

	// This is the target size for the packs of transactions sent by txsyncLoop.
	// A pack can get larger than this if a single transactions exceeds this size.
	txsyncPackSize   = 1000 * 1024
	txResyncInterval = 1 * time.Minute // How often to re-sync pending txs with peers.
)

type txsync struct {
	p   *peer
	txs []*types.Transaction
}

// syncTransactions starts sending all currently pending transactions to the given peer.
func (pm *ProtocolManager) syncTransactions(ctx context.Context, p *peer) {
	ctx, span := trace.StartSpan(context.Background(), "ProtocolManager.syncTransactions")
	defer span.End()
	txs := pm.txpool.PendingList(ctx)
	if len(txs) == 0 {
		return
	}
	select {
	case pm.txsyncCh <- &txsync{p, txs}:
	case <-pm.quitSync:
	}
}

// syncTransactionsAllPeers syncs pending txs to all peers.
func (pm *ProtocolManager) syncTransactionsAllPeers() {
	ctx := context.TODO()
	txs := pm.txpool.PendingList(ctx)
	if len(txs) == 0 {
		return
	}
	peers := pm.peers.All()
	max := int(math.Sqrt(float64(len(peers))))
	if max < minBroadcastPeers {
		max = minBroadcastPeers
	}
	if max > len(peers) {
		max = len(peers)
	}
	log.Info("Resyncing pending txs", "txs", len(txs), "peers", max)
	for _, p := range peers[:max] {
		select {
		case pm.txsyncCh <- &txsync{p, txs}:
		case <-pm.quitSync:
			return
		}
	}
}

// txResyncLoop periodically re-syncs transactions to all peers.
func (pm *ProtocolManager) txResyncLoop() {
	t := time.NewTicker(txResyncInterval)
	defer t.Stop()
	for {
		select {
		case <-t.C:
			pm.syncTransactionsAllPeers()
		case <-pm.quitSync:
			return
		}
	}
}

// txsyncLoop takes care of the initial transaction sync for each new
// connection. When a new peer appears, we relay all currently pending
// transactions. In order to minimise egress bandwidth usage, we send
// the transactions in small packs to one peer at a time.
func (pm *ProtocolManager) txsyncLoop() {
	var (
		pending = make(map[discover.NodeID]*txsync)
		sending = false               // whether a send is active
		pack    = new(txsync)         // the pack that is being sent
		done    = make(chan error, 1) // result of the send
	)

	// send starts a sending a pack of transactions from the sync.
	send := func(s *txsync) {
		_, span := trace.StartSpan(context.Background(), "ProtocolManager.txsyncLoop-send")
		defer span.End()

		// Fill pack with transactions up to the target size.
		size := common.StorageSize(0)
		pack.p = s.p
		pack.txs = pack.txs[:0]
		for i := 0; i < len(s.txs) && size < txsyncPackSize; i++ {
			pack.txs = append(pack.txs, s.txs[i])
			size += s.txs[i].Size()
		}
		// Remove the transactions that will be sent.
		s.txs = s.txs[:copy(s.txs, s.txs[len(pack.txs):])]
		if len(s.txs) == 0 {
			delete(pending, s.p.ID())
		}
		// Send the pack in the background.
		s.p.Log().Trace("Sending batch of transactions", "count", len(pack.txs), "bytes", size)
		sending = true
		go func() {
			ctx, ss := trace.StartSpan(context.Background(), "ProtocolManager.txSyncLoop-send-txs")
			defer ss.End()
			parent := span.SpanContext()
			ss.AddLink(trace.Link{
				Type:    trace.LinkTypeParent,
				TraceID: parent.TraceID,
				SpanID:  parent.SpanID,
			})
			done <- pack.p.SendTransactions(ctx, pack.txs)
		}()
	}

	// pick chooses the next pending sync.
	pick := func() *txsync {
		for _, s := range pending {
			return s
		}
		return nil
	}

	for {
		select {
		case s := <-pm.txsyncCh:
			pending[s.p.ID()] = s
			if !sending {
				send(s)
			}
		case err := <-done:
			sending = false
			// Stop tracking peers that cause send failures.
			if err != nil {
				pack.p.Log().Warn("Transaction send failed", "err", err)
				delete(pending, pack.p.ID())
			}
			// Schedule the next send.
			if s := pick(); s != nil {
				send(s)
			}
		case <-pm.quitSync:
			return
		}
	}
}

// syncer is responsible for periodically synchronising with the network, both
// downloading hashes and blocks as well as handling the announcement handler.
func (pm *ProtocolManager) syncer() {
	// Start and ensure cleanup of sync mechanisms
	pm.fetcher.Start()
	defer pm.fetcher.Stop()
	defer pm.downloader.Terminate()

	// Wait for different events to fire synchronisation operations
	forceSync := time.NewTicker(forceSyncCycle)
	defer forceSync.Stop()

	for {
		select {
		case <-pm.newPeerCh:
			// Make sure we have peers to select from, then sync
			if pm.peers.Len() < minDesiredPeerCount {
				break
			}

			go func() {
				ctx, span := trace.StartSpan(context.Background(), "protocolManager.syncer-newPeerCh")
				defer span.End()
				pm.synchronise(ctx, pm.peers.BestPeer(ctx))
			}()

		case <-forceSync.C:
			// Force a sync even if not enough peers are present
			go func() {
				ctx, span := trace.StartSpan(context.Background(), "protocolManager.syncer-forceSync")
				defer span.End()
				pm.synchronise(ctx, pm.peers.BestPeer(ctx))
			}()

		case <-pm.noMorePeers:
			return
		}
	}
}

// synchronise tries to sync up our local block chain with a remote peer.
func (pm *ProtocolManager) synchronise(ctx context.Context, peer *peer) {
	ctx, span := trace.StartSpan(ctx, "ProtocolManager.synchronise")
	defer span.End()

	// Short circuit if no peers are available
	if peer == nil {
		return
	}
	// Make sure the peer's TD is higher than our own
	currentBlock := pm.blockchain.CurrentBlock()
	hash := currentBlock.Hash()
	td := pm.blockchain.GetTd(hash, currentBlock.NumberU64())

	pHead, pTd := peer.Head()
	// Skip if lesser total difficulty, or same TD and same hash.
	if cmp := pTd.Cmp(td); cmp < 0 {
		return
	} else if cmp == 0 && pHead == hash {
		return
	}
	// Otherwise try to sync with the downloader
	mode := downloader.FullSync
	if atomic.LoadUint32(&pm.fastSync) == 1 {
		// Fast sync was explicitly requested, and explicitly granted
		mode = downloader.FastSync
	} else if currentBlock.NumberU64() == 0 && pm.blockchain.CurrentFastBlock().NumberU64() > 0 {
		// The database seems empty as the current block is the genesis. Yet the fast
		// block is ahead, so fast sync was enabled for this node at a certain point.
		// The only scenario where this can happen is if the user manually (or via a
		// bad block) rolled back a fast sync node below the sync point. In this case
		// however it's safe to reenable fast sync.
		atomic.StoreUint32(&pm.fastSync, 1)
		mode = downloader.FastSync
	}

	if mode == downloader.FastSync {
		// Make sure the peer's total difficulty we are synchronizing is higher.
		if pm.blockchain.GetTdByHash(pm.blockchain.CurrentFastBlock().Hash()).Cmp(pTd) >= 0 {
			return
		}
	}

	// Run the sync cycle, and disable fast sync if we've went past the pivot block
	if err := pm.downloader.Synchronise(ctx, peer.id, pHead, pTd, mode); err != nil {
		return
	}
	if atomic.LoadUint32(&pm.fastSync) == 1 {
		log.Info("Fast sync complete, auto disabling")
		atomic.StoreUint32(&pm.fastSync, 0)
	}
	atomic.StoreUint32(&pm.acceptTxs, 1) // Mark initial sync done
	if head := pm.blockchain.CurrentBlock(); head.NumberU64() > 0 {
		// We've completed a sync cycle, notify all peers of new state. This path is
		// essential in star-topology networks where a gateway node needs to notify
		// all its out-of-date peers of the availability of a new block. This failure
		// scenario will most often crop up in private and hackathon networks with
		// degenerate connectivity, but it should be healthy for the mainnet too to
		// more reliably update peers or the local TD state.
		go func() {
			ctx, bs := trace.StartSpan(context.Background(), "ProtocolManager.syncronise-announce")
			defer bs.End()
			parent := span.SpanContext()
			bs.AddLink(trace.Link{
				Type:    trace.LinkTypeParent,
				TraceID: parent.TraceID,
				SpanID:  parent.SpanID,
			})
			pm.BroadcastBlock(ctx, head, false)
		}()
	}
}