mirror of
https://gitlab.com/pulsechaincom/prysm-pulse.git
synced 2024-12-25 12:57:18 +00:00
2d53ae79df
* Minor cleanups to pulltips * Feedbacks Co-authored-by: prylabs-bulldozer[bot] <58059840+prylabs-bulldozer[bot]@users.noreply.github.com>
120 lines
4.2 KiB
Go
120 lines
4.2 KiB
Go
package doublylinkedtree
|
|
|
|
import (
|
|
"github.com/pkg/errors"
|
|
"github.com/prysmaticlabs/prysm/beacon-chain/core/epoch/precompute"
|
|
forkchoicetypes "github.com/prysmaticlabs/prysm/beacon-chain/forkchoice/types"
|
|
"github.com/prysmaticlabs/prysm/beacon-chain/state"
|
|
"github.com/prysmaticlabs/prysm/config/params"
|
|
types "github.com/prysmaticlabs/prysm/consensus-types/primitives"
|
|
"github.com/prysmaticlabs/prysm/encoding/bytesutil"
|
|
ethpb "github.com/prysmaticlabs/prysm/proto/prysm/v1alpha1"
|
|
"github.com/prysmaticlabs/prysm/time/slots"
|
|
)
|
|
|
|
func (s *Store) setUnrealizedJustifiedEpoch(root [32]byte, epoch types.Epoch) error {
|
|
s.nodesLock.Lock()
|
|
defer s.nodesLock.Unlock()
|
|
|
|
node, ok := s.nodeByRoot[root]
|
|
if !ok || node == nil {
|
|
return errors.Wrap(ErrNilNode, "could not set unrealized justified epoch")
|
|
}
|
|
if epoch < node.unrealizedJustifiedEpoch {
|
|
return errInvalidUnrealizedJustifiedEpoch
|
|
}
|
|
node.unrealizedJustifiedEpoch = epoch
|
|
return nil
|
|
}
|
|
|
|
func (s *Store) setUnrealizedFinalizedEpoch(root [32]byte, epoch types.Epoch) error {
|
|
s.nodesLock.Lock()
|
|
defer s.nodesLock.Unlock()
|
|
|
|
node, ok := s.nodeByRoot[root]
|
|
if !ok || node == nil {
|
|
return errors.Wrap(ErrNilNode, "could not set unrealized finalized epoch")
|
|
}
|
|
if epoch < node.unrealizedFinalizedEpoch {
|
|
return errInvalidUnrealizedFinalizedEpoch
|
|
}
|
|
node.unrealizedFinalizedEpoch = epoch
|
|
return nil
|
|
}
|
|
|
|
// updateUnrealizedCheckpoints "realizes" the unrealized justified and finalized
|
|
// epochs stored within nodes. It should be called at the beginning of each epoch.
|
|
func (f *ForkChoice) updateUnrealizedCheckpoints() {
|
|
f.store.nodesLock.Lock()
|
|
defer f.store.nodesLock.Unlock()
|
|
for _, node := range f.store.nodeByRoot {
|
|
node.justifiedEpoch = node.unrealizedJustifiedEpoch
|
|
node.finalizedEpoch = node.unrealizedFinalizedEpoch
|
|
if node.justifiedEpoch > f.store.justifiedCheckpoint.Epoch {
|
|
f.store.justifiedCheckpoint = f.store.unrealizedJustifiedCheckpoint
|
|
if node.justifiedEpoch > f.store.bestJustifiedCheckpoint.Epoch {
|
|
f.store.bestJustifiedCheckpoint = f.store.unrealizedJustifiedCheckpoint
|
|
}
|
|
}
|
|
if node.finalizedEpoch > f.store.finalizedCheckpoint.Epoch {
|
|
f.store.justifiedCheckpoint = f.store.unrealizedJustifiedCheckpoint
|
|
f.store.finalizedCheckpoint = f.store.unrealizedFinalizedCheckpoint
|
|
}
|
|
}
|
|
}
|
|
|
|
func (s *Store) pullTips(state state.BeaconState, node *Node, jc, fc *ethpb.Checkpoint) (*ethpb.Checkpoint, *ethpb.Checkpoint) {
|
|
s.nodesLock.Lock()
|
|
defer s.nodesLock.Unlock()
|
|
|
|
if node.parent == nil { // Nothing to do if the parent is nil.
|
|
return jc, fc
|
|
}
|
|
|
|
s.checkpointsLock.Lock()
|
|
defer s.checkpointsLock.Unlock()
|
|
|
|
currentEpoch := slots.ToEpoch(slots.CurrentSlot(s.genesisTime))
|
|
stateSlot := state.Slot()
|
|
stateEpoch := slots.ToEpoch(stateSlot)
|
|
currJustified := node.parent.unrealizedJustifiedEpoch == currentEpoch
|
|
prevJustified := node.parent.unrealizedJustifiedEpoch+1 == currentEpoch
|
|
tooEarlyForCurr := slots.SinceEpochStarts(stateSlot)*3 < params.BeaconConfig().SlotsPerEpoch*2
|
|
// Exit early if it's justified or too early to be justified.
|
|
if currJustified || (stateEpoch == currentEpoch && prevJustified && tooEarlyForCurr) {
|
|
node.unrealizedJustifiedEpoch = node.parent.unrealizedJustifiedEpoch
|
|
node.unrealizedFinalizedEpoch = node.parent.unrealizedFinalizedEpoch
|
|
return jc, fc
|
|
}
|
|
|
|
uj, uf, err := precompute.UnrealizedCheckpoints(state)
|
|
if err != nil {
|
|
log.WithError(err).Debug("could not compute unrealized checkpoints")
|
|
uj, uf = jc, fc
|
|
}
|
|
|
|
// Update store's unrealized checkpoints.
|
|
if uj.Epoch > s.unrealizedJustifiedCheckpoint.Epoch {
|
|
s.unrealizedJustifiedCheckpoint = &forkchoicetypes.Checkpoint{
|
|
Epoch: uj.Epoch, Root: bytesutil.ToBytes32(uj.Root),
|
|
}
|
|
}
|
|
if uf.Epoch > s.unrealizedFinalizedCheckpoint.Epoch {
|
|
s.unrealizedJustifiedCheckpoint = &forkchoicetypes.Checkpoint{
|
|
Epoch: uj.Epoch, Root: bytesutil.ToBytes32(uj.Root),
|
|
}
|
|
s.unrealizedFinalizedCheckpoint = &forkchoicetypes.Checkpoint{
|
|
Epoch: uf.Epoch, Root: bytesutil.ToBytes32(uf.Root),
|
|
}
|
|
}
|
|
|
|
// Update node's checkpoints.
|
|
node.unrealizedJustifiedEpoch, node.unrealizedFinalizedEpoch = uj.Epoch, uf.Epoch
|
|
if stateEpoch < currentEpoch {
|
|
jc, fc = uj, uf
|
|
node.justifiedEpoch = uj.Epoch
|
|
node.finalizedEpoch = uf.Epoch
|
|
}
|
|
return jc, fc
|
|
}
|