prysm-pulse/beacon-chain/sync/pending_blocks_queue.go
Preston Van Loon 9fcc6fc201
Wait until fully synced to process pubsub messages (#3514)
* context timeout for pubsub message processing

* add syncing check

* gofmt

* use a global cache

* lint

* fmt

* fix conflicts

* revert change

* gaz
2019-09-20 10:54:32 -07:00

97 lines
2.6 KiB
Go

package sync
import (
"context"
"encoding/hex"
"sort"
"time"
"github.com/prysmaticlabs/go-ssz"
"github.com/prysmaticlabs/prysm/beacon-chain/sync/peerstatus"
"github.com/prysmaticlabs/prysm/shared/bytesutil"
"github.com/prysmaticlabs/prysm/shared/params"
"github.com/sirupsen/logrus"
)
var processPendingBlocksPeriod = time.Duration(params.BeaconConfig().SecondsPerSlot/3) * time.Second
// processes pending blocks queue on every processPendingBlocksPeriod
func (r *RegularSync) processPendingBlocksQueue() {
ticker := time.NewTicker(processPendingBlocksPeriod)
for {
ctx := context.TODO()
select {
case <-ticker.C:
r.processPendingBlocks(ctx)
case <-r.ctx.Done():
log.Debug("p2p context is closed, exiting routine")
break
}
}
}
// processes the block tree inside the queue
func (r *RegularSync) processPendingBlocks(ctx context.Context) error {
pids := peerstatus.Keys()
slots := r.sortedPendingSlots()
for _, s := range slots {
r.pendingQueueLock.RLock()
b := r.slotToPendingBlocks[uint64(s)]
inPendingQueue := r.seenPendingBlocks[bytesutil.ToBytes32(b.ParentRoot)]
r.pendingQueueLock.RUnlock()
inDB := r.db.HasBlock(ctx, bytesutil.ToBytes32(b.ParentRoot))
hasPeer := len(pids) != 0
// Only request for missing parent block if it's not in DB, not in pending cache
// and has peer in the peer list.
if !inPendingQueue && !inDB && hasPeer {
log.WithFields(logrus.Fields{
"currentSlot": b.Slot,
"parentRoot": hex.EncodeToString(b.ParentRoot),
}).Info("Requesting parent block")
req := [][32]byte{bytesutil.ToBytes32(b.ParentRoot)}
// TODO(3450): Use round robin sync API to rotate peers for sending recent block request
if err := r.sendRecentBeaconBlocksRequest(ctx, req, pids[0]); err != nil {
log.Errorf("Could not send recent block request: %v", err)
}
continue
}
if !inDB {
continue
}
if err := r.chain.ReceiveBlockNoPubsub(ctx, b); err != nil {
log.Errorf("Could not process block from slot %d: %v", b.Slot, err)
}
r.pendingQueueLock.Lock()
delete(r.slotToPendingBlocks, uint64(s))
blkRoot, err := ssz.SigningRoot(b)
if err != nil {
return err
}
delete(r.seenPendingBlocks, blkRoot)
r.pendingQueueLock.Unlock()
log.Infof("Processed ancestor block %d and cleared pending block cache", s)
}
return nil
}
func (r *RegularSync) sortedPendingSlots() []int {
r.pendingQueueLock.RLock()
defer r.pendingQueueLock.RUnlock()
slots := make([]int, 0, len(r.slotToPendingBlocks))
for s := range r.slotToPendingBlocks {
slots = append(slots, int(s))
}
sort.Ints(slots)
return slots
}