mirror of
https://gitlab.com/pulsechaincom/erigon-pulse.git
synced 2025-01-09 04:21:20 +00:00
dbf1225cb2
Implements SSZ encode/decoding and hashtreeroot for simple list-lacking data structures. does not account offset case.
155 lines
4.5 KiB
Go
155 lines
4.5 KiB
Go
package network
|
|
|
|
import (
|
|
"sync"
|
|
|
|
libcommon "github.com/ledgerwatch/erigon-lib/common"
|
|
"golang.org/x/net/context"
|
|
|
|
"github.com/ledgerwatch/erigon/cl/cltypes"
|
|
"github.com/ledgerwatch/erigon/cl/cltypes/ssz"
|
|
"github.com/ledgerwatch/erigon/cl/rpc"
|
|
)
|
|
|
|
// Input: the currently highest slot processed and the list of blocks we want to know process
|
|
// Output: the new last new highest slot processed and an error possibly?
|
|
type ProcessFn func(
|
|
highestSlotProcessed uint64,
|
|
highestBlockRootProcessed libcommon.Hash,
|
|
blocks []*cltypes.SignedBeaconBlock) (
|
|
newHighestSlotProcessed uint64,
|
|
newHighestBlockRootProcessed libcommon.Hash,
|
|
err error)
|
|
|
|
type ForwardBeaconDownloader struct {
|
|
ctx context.Context
|
|
highestSlotProcessed uint64
|
|
highestBlockRootProcessed libcommon.Hash
|
|
targetSlot uint64
|
|
rpc *rpc.BeaconRpcP2P
|
|
process ProcessFn
|
|
isDownloading bool // Should be set to true to set the blocks to download
|
|
limitSegmentsLength int // Limit how many blocks we store in the downloader without processing
|
|
|
|
segments []*cltypes.SignedBeaconBlock // Unprocessed downloaded segments
|
|
mu sync.Mutex
|
|
}
|
|
|
|
func NewForwardBeaconDownloader(ctx context.Context, rpc *rpc.BeaconRpcP2P) *ForwardBeaconDownloader {
|
|
return &ForwardBeaconDownloader{
|
|
ctx: ctx,
|
|
segments: []*cltypes.SignedBeaconBlock{},
|
|
rpc: rpc,
|
|
isDownloading: false,
|
|
}
|
|
}
|
|
|
|
// Start begins the gossip listening process.
|
|
func (f *ForwardBeaconDownloader) ReceiveGossip(obj ssz.Unmarshaler) {
|
|
signedBlock := obj.(*cltypes.SignedBeaconBlock)
|
|
if signedBlock.Block.ParentRoot == f.highestBlockRootProcessed {
|
|
f.addSegment(signedBlock)
|
|
}
|
|
}
|
|
|
|
// SetIsDownloading sets isDownloading
|
|
func (f *ForwardBeaconDownloader) SetIsDownloading(isDownloading bool) {
|
|
f.mu.Lock()
|
|
defer f.mu.Unlock()
|
|
f.isDownloading = isDownloading
|
|
}
|
|
|
|
// SetLimitSegmentsLength sets the segments limiter.
|
|
func (f *ForwardBeaconDownloader) SetLimitSegmentsLength(limitSegmentsLength int) {
|
|
f.mu.Lock()
|
|
defer f.mu.Unlock()
|
|
f.limitSegmentsLength = limitSegmentsLength
|
|
}
|
|
|
|
// SetTargetSlot sets the target slot.
|
|
func (f *ForwardBeaconDownloader) SetTargetSlot(targetSlot uint64) {
|
|
f.mu.Lock()
|
|
defer f.mu.Unlock()
|
|
f.targetSlot = targetSlot
|
|
}
|
|
|
|
// SetProcessFunction sets the function used to process segments.
|
|
func (f *ForwardBeaconDownloader) SetProcessFunction(fn ProcessFn) {
|
|
f.mu.Lock()
|
|
defer f.mu.Unlock()
|
|
f.process = fn
|
|
}
|
|
|
|
// SetHighestProcessedSlot sets the highest processed slot so far.
|
|
func (f *ForwardBeaconDownloader) SetHighestProcessedSlot(highestSlotProcessed uint64) {
|
|
f.mu.Lock()
|
|
defer f.mu.Unlock()
|
|
f.highestSlotProcessed = highestSlotProcessed
|
|
}
|
|
|
|
// SetHighestProcessedRoot sets the highest processed block root so far.
|
|
func (f *ForwardBeaconDownloader) SetHighestProcessedRoot(root libcommon.Hash) {
|
|
f.mu.Lock()
|
|
defer f.mu.Unlock()
|
|
f.highestBlockRootProcessed = root
|
|
}
|
|
|
|
// HighestProcessedRoot returns the highest processed block root so far.
|
|
func (f *ForwardBeaconDownloader) HighestProcessedRoot() libcommon.Hash {
|
|
f.mu.Lock()
|
|
defer f.mu.Unlock()
|
|
return f.highestBlockRootProcessed
|
|
}
|
|
|
|
// addSegment process new block segment.
|
|
func (f *ForwardBeaconDownloader) addSegment(block *cltypes.SignedBeaconBlock) {
|
|
// Skip if it is not downloading or limit was reached
|
|
if !f.isDownloading || len(f.segments) >= f.limitSegmentsLength {
|
|
return
|
|
}
|
|
f.mu.Lock()
|
|
defer f.mu.Unlock()
|
|
// Skip if does continue the segment.
|
|
f.segments = append(f.segments, block)
|
|
}
|
|
|
|
func (f *ForwardBeaconDownloader) RequestMore() {
|
|
count := uint64(64)
|
|
|
|
responses, err := f.rpc.SendBeaconBlocksByRangeReq(f.highestSlotProcessed+1, count)
|
|
if err != nil {
|
|
return
|
|
}
|
|
for _, response := range responses {
|
|
f.addSegment(response)
|
|
}
|
|
|
|
}
|
|
|
|
// ProcessBlocks processes blocks we accumulated.
|
|
func (f *ForwardBeaconDownloader) ProcessBlocks() error {
|
|
if len(f.segments) == 0 {
|
|
return nil
|
|
}
|
|
f.mu.Lock()
|
|
defer f.mu.Unlock()
|
|
var err error
|
|
var highestSlotProcessed uint64
|
|
var highestBlockRootProcessed libcommon.Hash
|
|
if highestSlotProcessed, highestBlockRootProcessed, err = f.process(f.highestSlotProcessed, f.highestBlockRootProcessed, f.segments); err != nil {
|
|
return err
|
|
}
|
|
f.highestSlotProcessed = highestSlotProcessed
|
|
f.highestBlockRootProcessed = highestBlockRootProcessed
|
|
// clear segments
|
|
f.segments = f.segments[:0]
|
|
return nil
|
|
}
|
|
|
|
// GetHighestProcessedSlot retrieve the highest processed slot we accumulated.
|
|
func (f *ForwardBeaconDownloader) GetHighestProcessedSlot() uint64 {
|
|
f.mu.Lock()
|
|
defer f.mu.Unlock()
|
|
return f.highestSlotProcessed
|
|
}
|