mirror of
https://github.com/ethereum/go-ethereum.git
synced 2026-02-28 08:37:22 +00:00
35e0525bf4
This pull request defines a gentrie for snap sync purpose. The stackTrie is used to generate the merkle tree nodes upon receiving a state batch. Several additional options have been added into stackTrie to handle incomplete states (either missing states before or after). In this pull request, these options have been relocated from stackTrie to genTrie, which serves as a wrapper for stackTrie specifically for snap sync purposes. Further, the logic for managing incomplete state has been enhanced in this change. Originally, there are two cases handled: - boundary node filtering - internal (covered by extension node) node clearing This changes adds one more: - Clearing leftover nodes on the boundaries. This feature is necessary if there are leftover trie nodes in database, otherwise node inconsistency may break the state healing.
53 lines
1.6 KiB
Go
53 lines
1.6 KiB
Go
// Copyright 2023 The go-ethereum Authors
|
|
// This file is part of the go-ethereum library.
|
|
//
|
|
// The go-ethereum library is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU Lesser General Public License as published by
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
//
|
|
// The go-ethereum library is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU Lesser General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU Lesser General Public License
|
|
// along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
package testrand
|
|
|
|
import (
|
|
crand "crypto/rand"
|
|
"encoding/binary"
|
|
mrand "math/rand"
|
|
|
|
"github.com/ethereum/go-ethereum/common"
|
|
)
|
|
|
|
// prng is a pseudo random number generator seeded by strong randomness.
|
|
// The randomness is printed on startup in order to make failures reproducible.
|
|
var prng = initRand()
|
|
|
|
func initRand() *mrand.Rand {
|
|
var seed [8]byte
|
|
crand.Read(seed[:])
|
|
rnd := mrand.New(mrand.NewSource(int64(binary.LittleEndian.Uint64(seed[:]))))
|
|
return rnd
|
|
}
|
|
|
|
// Bytes generates a random byte slice with specified length.
|
|
func Bytes(n int) []byte {
|
|
r := make([]byte, n)
|
|
prng.Read(r)
|
|
return r
|
|
}
|
|
|
|
// Hash generates a random hash.
|
|
func Hash() common.Hash {
|
|
return common.BytesToHash(Bytes(common.HashLength))
|
|
}
|
|
|
|
// Address generates a random address.
|
|
func Address() common.Address {
|
|
return common.BytesToAddress(Bytes(common.AddressLength))
|
|
}
|