erigon-pulse/core/generate_index.go
2020-08-23 06:55:17 +07:00

220 lines
6.4 KiB
Go

package core
import (
"encoding/binary"
"errors"
"fmt"
"os"
"time"
"github.com/ledgerwatch/turbo-geth/common"
"github.com/ledgerwatch/turbo-geth/common/changeset"
"github.com/ledgerwatch/turbo-geth/common/dbutils"
"github.com/ledgerwatch/turbo-geth/common/etl"
"github.com/ledgerwatch/turbo-geth/ethdb"
"github.com/ledgerwatch/turbo-geth/log"
)
func NewIndexGenerator(db ethdb.Database, quitCh <-chan struct{}) *IndexGenerator {
return &IndexGenerator{
db: db,
ChangeSetBufSize: 256 * 1024 * 1024,
TempDir: os.TempDir(),
quitCh: quitCh,
}
}
type IndexGenerator struct {
db ethdb.Database
ChangeSetBufSize int
TempDir string
quitCh <-chan struct{}
}
func (ig *IndexGenerator) GenerateIndex(startBlock, endBlock uint64, changeSetBucket string, datadir string) error {
v, ok := changeset.Mapper[changeSetBucket]
if !ok {
return errors.New("unknown bucket type")
}
log.Debug("Index generation", "from", startBlock, "to", endBlock, "csbucket", changeSetBucket)
if endBlock < startBlock && endBlock != 0 {
return fmt.Errorf("generateIndex %s: endBlock %d smaller than startBlock %d", changeSetBucket, endBlock, startBlock)
}
t := time.Now()
err := etl.Transform(ig.db, changeSetBucket,
v.IndexBucket,
datadir,
getExtractFunc(v.WalkerAdapter),
loadFunc,
etl.TransformArgs{
ExtractStartKey: dbutils.EncodeTimestamp(startBlock),
ExtractEndKey: dbutils.EncodeTimestamp(endBlock),
FixedBits: 0,
BufferType: etl.SortableAppendBuffer,
BufferSize: ig.ChangeSetBufSize,
Quit: ig.quitCh,
LogDetailsExtract: func(k, v []byte) (additionalLogArguments []interface{}) {
blockNum, _ := dbutils.DecodeTimestamp(k)
return []interface{}{"block", blockNum}
},
},
)
if err != nil {
return err
}
log.Debug("Index generation successfully finished", "csbucket", changeSetBucket, "it took", time.Since(t))
return nil
}
func (ig *IndexGenerator) Truncate(timestampTo uint64, changeSetBucket string) error {
vv, ok := changeset.Mapper[changeSetBucket]
if !ok {
return errors.New("unknown bucket type")
}
currentKey := dbutils.EncodeTimestamp(timestampTo)
keys := make(map[string]struct{})
if err := ig.db.Walk(changeSetBucket, currentKey, 0, func(k, v []byte) (b bool, e error) {
if err := common.Stopped(ig.quitCh); err != nil {
return false, err
}
currentKey = common.CopyBytes(k)
err := vv.WalkerAdapter(v).Walk(func(kk []byte, _ []byte) error {
keys[string(common.CopyBytes(kk))] = struct{}{}
return nil
})
if err != nil {
return false, err
}
return true, nil
}); err != nil {
return err
}
historyEffects := make(map[string][]byte)
keySize := vv.KeySize
if dbutils.StorageChangeSetBucket == changeSetBucket || dbutils.PlainStorageChangeSetBucket == changeSetBucket {
keySize -= 8
}
var startKey = make([]byte, keySize+8)
for key := range keys {
copy(startKey[:keySize], dbutils.CompositeKeyWithoutIncarnation([]byte(key)))
binary.BigEndian.PutUint64(startKey[keySize:], timestampTo)
if err := ig.db.Walk(vv.IndexBucket, startKey, 8*keySize, func(k, v []byte) (bool, error) {
timestamp := binary.BigEndian.Uint64(k[keySize:]) // the last timestamp in the chunk
kStr := string(common.CopyBytes(k))
if timestamp > timestampTo {
historyEffects[kStr] = nil
// truncate the chunk
index := dbutils.WrapHistoryIndex(v)
index = index.TruncateGreater(timestampTo)
if len(index) > 8 { // If the chunk is empty after truncation, it gets simply deleted
// Truncated chunk becomes "the last chunk" with the timestamp 0xffff....ffff
lastK := make([]byte, len(k))
copy(lastK, k[:keySize])
binary.BigEndian.PutUint64(lastK[keySize:], ^uint64(0))
historyEffects[string(lastK)] = common.CopyBytes(index)
}
}
return true, nil
}); err != nil {
return err
}
}
mutation := ig.db.NewBatch()
for key, value := range historyEffects {
if value == nil {
if err := mutation.Delete(vv.IndexBucket, []byte(key)); err != nil {
return err
}
} else {
if err := mutation.Put(vv.IndexBucket, []byte(key), value); err != nil {
return err
}
}
if mutation.BatchSize() >= mutation.IdealBatchSize() {
_, err := mutation.Commit()
if err != nil {
return err
}
mutation = ig.db.NewBatch()
}
}
_, err := mutation.Commit()
return err
}
func (ig *IndexGenerator) DropIndex(bucket string) error {
casted, ok := ig.db.(ethdb.NonTransactional)
if !ok {
return errors.New("imposible to drop")
}
log.Warn("Remove bucket", "bucket", bucket)
return casted.ClearBuckets(bucket)
}
func loadFunc(k []byte, value []byte, state etl.State, next etl.LoadNextFunc) error {
if len(value)%9 != 0 {
log.Error("Value must be a multiple of 9", "ln", len(value), "k", common.Bytes2Hex(k))
return errors.New("incorrect value")
}
k = common.CopyBytes(k)
currentChunkKey := dbutils.IndexChunkKey(k, ^uint64(0))
indexBytes, err1 := state.Get(currentChunkKey)
if err1 != nil && !errors.Is(err1, ethdb.ErrKeyNotFound) {
return fmt.Errorf("find chunk failed: %w", err1)
}
currentIndex := dbutils.WrapHistoryIndex(indexBytes)
for i := 0; i < len(value); i += 9 {
b := binary.BigEndian.Uint64(value[i:])
vzero := value[i+8] == 1
blockNr := b
if err1 != nil && err1 != ethdb.ErrKeyNotFound {
return fmt.Errorf("find chunk failed: %w", err1)
}
if dbutils.CheckNewIndexChunk(currentIndex, blockNr) {
// Chunk overflow, need to write the "old" current chunk under its key derived from the last element
indexKey, err3 := currentIndex.Key(k)
if err3 != nil {
return err3
}
// Flush the old chunk
if err4 := next(k, indexKey, currentIndex); err4 != nil {
return err4
}
// Start a new chunk
currentIndex = dbutils.NewHistoryIndex()
}
currentIndex = currentIndex.Append(blockNr, vzero)
}
if err := next(k, currentChunkKey, currentIndex); err != nil {
return err
}
return nil
}
func getExtractFunc(bytes2walker func([]byte) changeset.Walker) etl.ExtractFunc { //nolint
return func(dbKey, dbValue []byte, next etl.ExtractNextFunc) error {
blockNum, _ := dbutils.DecodeTimestamp(dbKey)
return bytes2walker(dbValue).Walk(func(changesetKey, changesetValue []byte) error {
key := common.CopyBytes(changesetKey)
v := make([]byte, 9)
binary.BigEndian.PutUint64(v, blockNum)
if len(changesetValue) == 0 {
v[8] = 1
}
return next(dbKey, key, v)
})
}
}