623b17ba20
This pull request introduces a state.Reader interface for state accessing. The interface could be implemented in various ways. It can be pure trie only reader, or the combination of trie and state snapshot. What's more, this interface allows us to have more flexibility in the future, e.g. the archive reader (for accessing archive state). Additionally, this pull request removes the following metrics - `chain/snapshot/account/reads` - `chain/snapshot/storage/reads`
109 lines
3.0 KiB
Go
109 lines
3.0 KiB
Go
// Copyright 2016 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 state
|
|
|
|
import (
|
|
"testing"
|
|
|
|
"github.com/ethereum/go-ethereum/common"
|
|
"github.com/ethereum/go-ethereum/core/rawdb"
|
|
"github.com/ethereum/go-ethereum/crypto"
|
|
)
|
|
|
|
// Tests that the node iterator indeed walks over the entire database contents.
|
|
func TestNodeIteratorCoverage(t *testing.T) {
|
|
testNodeIteratorCoverage(t, rawdb.HashScheme)
|
|
testNodeIteratorCoverage(t, rawdb.PathScheme)
|
|
}
|
|
|
|
func testNodeIteratorCoverage(t *testing.T, scheme string) {
|
|
// Create some arbitrary test state to iterate
|
|
db, sdb, ndb, root, _ := makeTestState(scheme)
|
|
ndb.Commit(root, false)
|
|
|
|
state, err := New(root, sdb)
|
|
if err != nil {
|
|
t.Fatalf("failed to create state trie at %x: %v", root, err)
|
|
}
|
|
// Gather all the node hashes found by the iterator
|
|
hashes := make(map[common.Hash]struct{})
|
|
for it := newNodeIterator(state); it.Next(); {
|
|
if it.Hash != (common.Hash{}) {
|
|
hashes[it.Hash] = struct{}{}
|
|
}
|
|
}
|
|
// Check in-disk nodes
|
|
var (
|
|
seenNodes = make(map[common.Hash]struct{})
|
|
seenCodes = make(map[common.Hash]struct{})
|
|
)
|
|
it := db.NewIterator(nil, nil)
|
|
for it.Next() {
|
|
ok, hash := isTrieNode(scheme, it.Key(), it.Value())
|
|
if !ok {
|
|
continue
|
|
}
|
|
seenNodes[hash] = struct{}{}
|
|
}
|
|
it.Release()
|
|
|
|
// Check in-disk codes
|
|
it = db.NewIterator(nil, nil)
|
|
for it.Next() {
|
|
ok, hash := rawdb.IsCodeKey(it.Key())
|
|
if !ok {
|
|
continue
|
|
}
|
|
if _, ok := hashes[common.BytesToHash(hash)]; !ok {
|
|
t.Errorf("state entry not reported %x", it.Key())
|
|
}
|
|
seenCodes[common.BytesToHash(hash)] = struct{}{}
|
|
}
|
|
it.Release()
|
|
|
|
// Cross check the iterated hashes and the database/nodepool content
|
|
for hash := range hashes {
|
|
_, ok := seenNodes[hash]
|
|
if !ok {
|
|
_, ok = seenCodes[hash]
|
|
}
|
|
if !ok {
|
|
t.Errorf("failed to retrieve reported node %x", hash)
|
|
}
|
|
}
|
|
}
|
|
|
|
// isTrieNode is a helper function which reports if the provided
|
|
// database entry belongs to a trie node or not.
|
|
func isTrieNode(scheme string, key, val []byte) (bool, common.Hash) {
|
|
if scheme == rawdb.HashScheme {
|
|
if rawdb.IsLegacyTrieNode(key, val) {
|
|
return true, common.BytesToHash(key)
|
|
}
|
|
} else {
|
|
ok := rawdb.IsAccountTrieNode(key)
|
|
if ok {
|
|
return true, crypto.Keccak256Hash(val)
|
|
}
|
|
ok = rawdb.IsStorageTrieNode(key)
|
|
if ok {
|
|
return true, crypto.Keccak256Hash(val)
|
|
}
|
|
}
|
|
return false, common.Hash{}
|
|
}
|