mirror of
https://gitlab.com/pulsechaincom/erigon-pulse.git
synced 2024-12-22 19:50:36 +00:00
179 lines
4.3 KiB
Go
179 lines
4.3 KiB
Go
|
package sync
|
||
|
|
||
|
import (
|
||
|
"context"
|
||
|
"errors"
|
||
|
"github.com/ledgerwatch/erigon/consensus/bor/heimdall"
|
||
|
"github.com/ledgerwatch/erigon/consensus/bor/heimdall/checkpoint"
|
||
|
"github.com/ledgerwatch/erigon/consensus/bor/heimdall/milestone"
|
||
|
"github.com/ledgerwatch/erigon/consensus/bor/heimdall/span"
|
||
|
"github.com/ledgerwatch/log/v3"
|
||
|
"math/big"
|
||
|
"time"
|
||
|
)
|
||
|
|
||
|
// Heimdall is a wrapper of Heimdall HTTP API
|
||
|
type Heimdall interface {
|
||
|
FetchCheckpoints(ctx context.Context, start uint64) ([]*checkpoint.Checkpoint, error)
|
||
|
FetchMilestones(ctx context.Context, start uint64) ([]*milestone.Milestone, error)
|
||
|
FetchSpan(ctx context.Context) (*span.HeimdallSpan, error)
|
||
|
OnMilestoneEvent(ctx context.Context, callback func(*milestone.Milestone)) error
|
||
|
}
|
||
|
|
||
|
// ErrIncompleteMilestoneRange happens when FetchMilestones is called with an old start block because old milestones are evicted
|
||
|
var ErrIncompleteMilestoneRange = errors.New("milestone range doesn't contain the start block")
|
||
|
|
||
|
type HeimdallImpl struct {
|
||
|
client heimdall.IHeimdallClient
|
||
|
pollDelay time.Duration
|
||
|
logger log.Logger
|
||
|
}
|
||
|
|
||
|
func NewHeimdall(client heimdall.IHeimdallClient, logger log.Logger) Heimdall {
|
||
|
impl := HeimdallImpl{
|
||
|
client: client,
|
||
|
pollDelay: time.Second,
|
||
|
logger: logger,
|
||
|
}
|
||
|
return &impl
|
||
|
}
|
||
|
|
||
|
func cmpNumToRange(n uint64, min *big.Int, max *big.Int) int {
|
||
|
num := new(big.Int).SetUint64(n)
|
||
|
if num.Cmp(min) < 0 {
|
||
|
return -1
|
||
|
}
|
||
|
if num.Cmp(max) > 0 {
|
||
|
return 1
|
||
|
}
|
||
|
return 0
|
||
|
}
|
||
|
|
||
|
func cmpBlockNumToCheckpointRange(n uint64, c *checkpoint.Checkpoint) int {
|
||
|
return cmpNumToRange(n, c.StartBlock, c.EndBlock)
|
||
|
}
|
||
|
|
||
|
func cmpBlockNumToMilestoneRange(n uint64, m *milestone.Milestone) int {
|
||
|
return cmpNumToRange(n, m.StartBlock, m.EndBlock)
|
||
|
}
|
||
|
|
||
|
func reverse[T any](s []T) {
|
||
|
for i, j := 0, len(s)-1; i < j; i, j = i+1, j-1 {
|
||
|
s[i], s[j] = s[j], s[i]
|
||
|
}
|
||
|
}
|
||
|
|
||
|
func (impl *HeimdallImpl) FetchCheckpoints(ctx context.Context, start uint64) ([]*checkpoint.Checkpoint, error) {
|
||
|
count, err := impl.client.FetchCheckpointCount(ctx)
|
||
|
if err != nil {
|
||
|
return nil, err
|
||
|
}
|
||
|
|
||
|
var checkpoints []*checkpoint.Checkpoint
|
||
|
|
||
|
for i := count; i >= 1; i-- {
|
||
|
c, err := impl.client.FetchCheckpoint(ctx, i)
|
||
|
if err != nil {
|
||
|
return nil, err
|
||
|
}
|
||
|
|
||
|
cmpResult := cmpBlockNumToCheckpointRange(start, c)
|
||
|
// the start block is past the last checkpoint
|
||
|
if cmpResult > 0 {
|
||
|
return nil, nil
|
||
|
}
|
||
|
|
||
|
checkpoints = append(checkpoints, c)
|
||
|
|
||
|
// the checkpoint contains the start block
|
||
|
if cmpResult == 0 {
|
||
|
break
|
||
|
}
|
||
|
}
|
||
|
|
||
|
reverse(checkpoints)
|
||
|
return checkpoints, nil
|
||
|
}
|
||
|
|
||
|
func (impl *HeimdallImpl) FetchMilestones(ctx context.Context, start uint64) ([]*milestone.Milestone, error) {
|
||
|
count, err := impl.client.FetchMilestoneCount(ctx)
|
||
|
if err != nil {
|
||
|
return nil, err
|
||
|
}
|
||
|
|
||
|
var milestones []*milestone.Milestone
|
||
|
|
||
|
for i := count; i >= 1; i-- {
|
||
|
m, err := impl.client.FetchMilestone(ctx, i)
|
||
|
if err != nil {
|
||
|
if errors.Is(err, heimdall.ErrNotInMilestoneList) {
|
||
|
reverse(milestones)
|
||
|
return milestones, ErrIncompleteMilestoneRange
|
||
|
}
|
||
|
return nil, err
|
||
|
}
|
||
|
|
||
|
cmpResult := cmpBlockNumToMilestoneRange(start, m)
|
||
|
// the start block is past the last milestone
|
||
|
if cmpResult > 0 {
|
||
|
return nil, nil
|
||
|
}
|
||
|
|
||
|
milestones = append(milestones, m)
|
||
|
|
||
|
// the checkpoint contains the start block
|
||
|
if cmpResult == 0 {
|
||
|
break
|
||
|
}
|
||
|
}
|
||
|
|
||
|
reverse(milestones)
|
||
|
return milestones, nil
|
||
|
}
|
||
|
|
||
|
func (impl *HeimdallImpl) FetchSpan(ctx context.Context) (*span.HeimdallSpan, error) {
|
||
|
// TODO: calc last spanID
|
||
|
return impl.client.Span(ctx, 0)
|
||
|
}
|
||
|
|
||
|
func (impl *HeimdallImpl) OnMilestoneEvent(ctx context.Context, callback func(*milestone.Milestone)) error {
|
||
|
currentCount, err := impl.client.FetchMilestoneCount(ctx)
|
||
|
if err != nil {
|
||
|
return err
|
||
|
}
|
||
|
|
||
|
go func() {
|
||
|
for {
|
||
|
count, err := impl.client.FetchMilestoneCount(ctx)
|
||
|
if err != nil {
|
||
|
if !errors.Is(err, context.Canceled) {
|
||
|
impl.logger.Error("HeimdallImpl.OnMilestoneEvent FetchMilestoneCount error", "err", err)
|
||
|
}
|
||
|
break
|
||
|
}
|
||
|
|
||
|
if count <= currentCount {
|
||
|
pollDelayTimer := time.NewTimer(impl.pollDelay)
|
||
|
select {
|
||
|
case <-ctx.Done():
|
||
|
return
|
||
|
case <-pollDelayTimer.C:
|
||
|
}
|
||
|
} else {
|
||
|
currentCount = count
|
||
|
m, err := impl.client.FetchMilestone(ctx, count)
|
||
|
if err != nil {
|
||
|
if !errors.Is(err, context.Canceled) {
|
||
|
impl.logger.Error("HeimdallImpl.OnMilestoneEvent FetchMilestone error", "err", err)
|
||
|
}
|
||
|
break
|
||
|
}
|
||
|
|
||
|
go callback(m)
|
||
|
}
|
||
|
}
|
||
|
}()
|
||
|
|
||
|
return nil
|
||
|
}
|