mirror of
https://gitlab.com/pulsechaincom/erigon-pulse.git
synced 2024-12-25 21:17:16 +00:00
11f4978ed4
Following our previous discussion on erigon's discord, this PR requests to upstream all Otterscan modifications to erigon's repo. That decision comes after getting feedback from lots of users at events this year, and although it may introduce some friction for development, it will make integrators life easier by having all our modifications available out of box, e.g., dappnode users will get our RPCs since their official packages are built from erigon repo. I'm submitting the source-code as-is, please let me know if you think there is a better code organization. The current set of modifications comprises only new RPCs. There are some proposals for extra-stages that would add new tables, but they are still WIP and will be submitted separately in future after more testing.
108 lines
2.4 KiB
Go
108 lines
2.4 KiB
Go
package commands
|
|
|
|
import (
|
|
"bytes"
|
|
|
|
"github.com/RoaringBitmap/roaring/roaring64"
|
|
"github.com/ledgerwatch/erigon-lib/kv"
|
|
"github.com/ledgerwatch/erigon/common"
|
|
)
|
|
|
|
// Given a ChunkLocator, moves forward over the chunks and inside each chunk, moves
|
|
// forward over the block numbers.
|
|
func NewForwardBlockProvider(chunkLocator ChunkLocator, minBlock uint64) BlockProvider {
|
|
var iter roaring64.IntPeekable64
|
|
var chunkProvider ChunkProvider
|
|
isFirst := true
|
|
finished := false
|
|
|
|
return func() (uint64, bool, error) {
|
|
if finished {
|
|
return 0, false, nil
|
|
}
|
|
|
|
if isFirst {
|
|
isFirst = false
|
|
|
|
// Try to get first chunk
|
|
var ok bool
|
|
var err error
|
|
chunkProvider, ok, err = chunkLocator(minBlock)
|
|
if err != nil {
|
|
finished = true
|
|
return 0, false, err
|
|
}
|
|
if !ok {
|
|
finished = true
|
|
return 0, false, nil
|
|
}
|
|
if chunkProvider == nil {
|
|
finished = true
|
|
return 0, false, nil
|
|
}
|
|
|
|
// Has at least the first chunk; initialize the iterator
|
|
chunk, ok, err := chunkProvider()
|
|
if err != nil {
|
|
finished = true
|
|
return 0, false, err
|
|
}
|
|
if !ok {
|
|
finished = true
|
|
return 0, false, nil
|
|
}
|
|
|
|
bm := roaring64.NewBitmap()
|
|
if _, err := bm.ReadFrom(bytes.NewReader(chunk)); err != nil {
|
|
finished = true
|
|
return 0, false, err
|
|
}
|
|
iter = bm.Iterator()
|
|
|
|
// It can happen that on the first chunk we'll get a chunk that contains
|
|
// the first block >= minBlock in the middle of the chunk/bitmap, so we
|
|
// skip all previous blocks before it.
|
|
iter.AdvanceIfNeeded(minBlock)
|
|
|
|
// This means it is the last chunk and the min block is > the last one
|
|
if !iter.HasNext() {
|
|
finished = true
|
|
return 0, false, nil
|
|
}
|
|
}
|
|
|
|
nextBlock := iter.Next()
|
|
hasNext := iter.HasNext()
|
|
if !hasNext {
|
|
iter = nil
|
|
|
|
// Check if there is another chunk to get blocks from
|
|
chunk, ok, err := chunkProvider()
|
|
if err != nil {
|
|
finished = true
|
|
return 0, false, err
|
|
}
|
|
if !ok {
|
|
finished = true
|
|
return nextBlock, false, nil
|
|
}
|
|
|
|
hasNext = true
|
|
|
|
bm := roaring64.NewBitmap()
|
|
if _, err := bm.ReadFrom(bytes.NewReader(chunk)); err != nil {
|
|
finished = true
|
|
return 0, false, err
|
|
}
|
|
iter = bm.Iterator()
|
|
}
|
|
|
|
return nextBlock, hasNext, nil
|
|
}
|
|
}
|
|
|
|
func NewCallCursorForwardBlockProvider(cursor kv.Cursor, addr common.Address, minBlock uint64) BlockProvider {
|
|
chunkLocator := newCallChunkLocator(cursor, addr, true)
|
|
return NewForwardBlockProvider(chunkLocator, minBlock)
|
|
}
|