6d2aeb43d5
The state availability is checked during the creation of a state reader.
- In hash-based database, if the specified root node does not exist on disk disk, then
the state reader won't be created and an error will be returned.
- In path-based database, if the specified state layer is not available, then the
state reader won't be created and an error will be returned.
This change also contains a stricter semantics regarding the `Commit` operation: once it has been performed, the trie is no longer usable, and certain operations will return an error.
81 lines
3.0 KiB
Go
81 lines
3.0 KiB
Go
// Copyright 2022 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 trie
|
|
|
|
import (
|
|
"github.com/ethereum/go-ethereum/common"
|
|
"github.com/ethereum/go-ethereum/core/types"
|
|
"github.com/ethereum/go-ethereum/log"
|
|
)
|
|
|
|
// Reader wraps the Node method of a backing trie store.
|
|
type Reader interface {
|
|
// Node retrieves the RLP-encoded trie node blob with the provided trie
|
|
// identifier, node path and the corresponding node hash. No error will
|
|
// be returned if the node is not found.
|
|
Node(owner common.Hash, path []byte, hash common.Hash) ([]byte, error)
|
|
}
|
|
|
|
// trieReader is a wrapper of the underlying node reader. It's not safe
|
|
// for concurrent usage.
|
|
type trieReader struct {
|
|
owner common.Hash
|
|
reader Reader
|
|
banned map[string]struct{} // Marker to prevent node from being accessed, for tests
|
|
}
|
|
|
|
// newTrieReader initializes the trie reader with the given node reader.
|
|
func newTrieReader(stateRoot, owner common.Hash, db *Database) (*trieReader, error) {
|
|
if stateRoot == (common.Hash{}) || stateRoot == types.EmptyRootHash {
|
|
if stateRoot == (common.Hash{}) {
|
|
log.Error("Zero state root hash!")
|
|
}
|
|
return &trieReader{owner: owner}, nil
|
|
}
|
|
reader, err := db.Reader(stateRoot)
|
|
if err != nil {
|
|
return nil, &MissingNodeError{Owner: owner, NodeHash: stateRoot, err: err}
|
|
}
|
|
return &trieReader{owner: owner, reader: reader}, nil
|
|
}
|
|
|
|
// newEmptyReader initializes the pure in-memory reader. All read operations
|
|
// should be forbidden and returns the MissingNodeError.
|
|
func newEmptyReader() *trieReader {
|
|
return &trieReader{}
|
|
}
|
|
|
|
// node retrieves the rlp-encoded trie node with the provided trie node
|
|
// information. An MissingNodeError will be returned in case the node is
|
|
// not found or any error is encountered.
|
|
func (r *trieReader) node(path []byte, hash common.Hash) ([]byte, error) {
|
|
// Perform the logics in tests for preventing trie node access.
|
|
if r.banned != nil {
|
|
if _, ok := r.banned[string(path)]; ok {
|
|
return nil, &MissingNodeError{Owner: r.owner, NodeHash: hash, Path: path}
|
|
}
|
|
}
|
|
if r.reader == nil {
|
|
return nil, &MissingNodeError{Owner: r.owner, NodeHash: hash, Path: path}
|
|
}
|
|
blob, err := r.reader.Node(r.owner, path, hash)
|
|
if err != nil || len(blob) == 0 {
|
|
return nil, &MissingNodeError{Owner: r.owner, NodeHash: hash, Path: path, err: err}
|
|
}
|
|
return blob, nil
|
|
}
|