erigon-pulse/common/changeset/account_changeset.go
Alex Sharov 3db7e85994
Simplify GetAsOf (#2285)
* no reason to copy if we work with ethdb.Tx (user of ethdb.Tx expecting that all data valid until end of tx)

* less objects
2021-07-04 08:49:31 +01:00

84 lines
2.1 KiB
Go

package changeset
import (
"bytes"
"encoding/binary"
"sort"
"github.com/ledgerwatch/erigon/common"
"github.com/ledgerwatch/erigon/common/dbutils"
"github.com/ledgerwatch/erigon/ethdb"
)
type Encoder func(blockN uint64, s *ChangeSet, f func(k, v []byte) error) error
type Decoder func(dbKey, dbValue []byte) (blockN uint64, k, v []byte)
func NewAccountChangeSet() *ChangeSet {
return &ChangeSet{
Changes: make([]Change, 0),
keyLen: common.AddressLength,
}
}
func EncodeAccounts(blockN uint64, s *ChangeSet, f func(k, v []byte) error) error {
sort.Sort(s)
newK := dbutils.EncodeBlockNumber(blockN)
for _, cs := range s.Changes {
newV := make([]byte, len(cs.Key)+len(cs.Value))
copy(newV, cs.Key)
copy(newV[len(cs.Key):], cs.Value)
if err := f(newK, newV); err != nil {
return err
}
}
return nil
}
func DecodeAccounts(dbKey, dbValue []byte) (uint64, []byte, []byte) {
blockN := binary.BigEndian.Uint64(dbKey)
k := dbValue[:common.AddressLength]
v := dbValue[common.AddressLength:]
return blockN, k, v
}
func FindAccount(c ethdb.CursorDupSort, blockNumber uint64, key []byte) ([]byte, error) {
k := dbutils.EncodeBlockNumber(blockNumber)
v, err := c.SeekBothRange(k, key)
if err != nil {
return nil, err
}
_, k, v = DecodeAccounts(k, v)
if !bytes.HasPrefix(k, key) {
return nil, nil
}
return v, nil
}
// GetModifiedAccounts returns a list of addresses that were modified in the block range
func GetModifiedAccounts(db ethdb.Tx, startNum, endNum uint64) ([]common.Address, error) {
changedAddrs := make(map[common.Address]struct{})
if err := Walk(db, dbutils.AccountChangeSetBucket, dbutils.EncodeBlockNumber(startNum), 0, func(blockN uint64, k, v []byte) (bool, error) {
if blockN > endNum {
return false, nil
}
changedAddrs[common.BytesToAddress(k)] = struct{}{}
return true, nil
}); err != nil {
return nil, err
}
if len(changedAddrs) == 0 {
return nil, nil
}
idx := 0
result := make([]common.Address, len(changedAddrs))
for addr := range changedAddrs {
copy(result[idx][:], addr[:])
idx++
}
return result, nil
}