aboutsummaryrefslogtreecommitdiffstats
path: root/core
diff options
context:
space:
mode:
authorPéter Szilágyi <peterke@gmail.com>2016-01-06 18:11:56 +0800
committerPéter Szilágyi <peterke@gmail.com>2016-02-16 18:21:08 +0800
commit5a057a8dedd1fa284e04bc2e7780e74d4600fdeb (patch)
tree3285474d93d6e83f9326c2bc0435527e12d0b768 /core
parent7e29b0b5b4e5cf7ded9a5a75789de6f8121caec9 (diff)
downloadgo-tangerine-5a057a8dedd1fa284e04bc2e7780e74d4600fdeb.tar.gz
go-tangerine-5a057a8dedd1fa284e04bc2e7780e74d4600fdeb.tar.zst
go-tangerine-5a057a8dedd1fa284e04bc2e7780e74d4600fdeb.zip
core/state, trie: surface iterator entry hashes
Diffstat (limited to 'core')
-rw-r--r--core/state/iterator.go14
-rw-r--r--core/state/iterator_test.go57
-rw-r--r--core/state/sync_test.go3
3 files changed, 67 insertions, 7 deletions
diff --git a/core/state/iterator.go b/core/state/iterator.go
index a0b71f3ee..59a8e0242 100644
--- a/core/state/iterator.go
+++ b/core/state/iterator.go
@@ -33,8 +33,11 @@ type NodeIterator struct {
stateIt *trie.NodeIterator // Primary iterator for the global state trie
dataIt *trie.NodeIterator // Secondary iterator for the data trie of a contract
- code []byte // Source code associated with a contract
+ codeHash common.Hash // Hash of the contract source code
+ code []byte // Source code associated with a contract
+
+ Hash common.Hash // Hash of the current entry being iterated (nil if not standalone)
Entry interface{} // Current state entry being iterated (internal representation)
}
@@ -103,6 +106,7 @@ func (it *NodeIterator) step() {
it.dataIt = nil
}
if bytes.Compare(account.CodeHash, emptyCodeHash) != 0 {
+ it.codeHash = common.BytesToHash(account.CodeHash)
it.code, err = it.state.db.Get(account.CodeHash)
if err != nil {
panic(fmt.Sprintf("code %x: %v", account.CodeHash, err))
@@ -114,7 +118,7 @@ func (it *NodeIterator) step() {
// The method returns whether there are any more data left for inspection.
func (it *NodeIterator) retrieve() bool {
// Clear out any previously set values
- it.Entry = nil
+ it.Hash, it.Entry = common.Hash{}, nil
// If the iteration's done, return no available data
if it.state == nil {
@@ -123,11 +127,11 @@ func (it *NodeIterator) retrieve() bool {
// Otherwise retrieve the current entry
switch {
case it.dataIt != nil:
- it.Entry = it.dataIt.Node
+ it.Hash, it.Entry = it.dataIt.Hash, it.dataIt.Node
case it.code != nil:
- it.Entry = it.code
+ it.Hash, it.Entry = it.codeHash, it.code
case it.stateIt != nil:
- it.Entry = it.stateIt.Node
+ it.Hash, it.Entry = it.stateIt.Hash, it.stateIt.Node
}
return true
}
diff --git a/core/state/iterator_test.go b/core/state/iterator_test.go
new file mode 100644
index 000000000..8b68870c6
--- /dev/null
+++ b/core/state/iterator_test.go
@@ -0,0 +1,57 @@
+// Copyright 2015 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 (
+ "bytes"
+ "testing"
+
+ "github.com/ethereum/go-ethereum/common"
+ "github.com/ethereum/go-ethereum/ethdb"
+)
+
+// Tests that the node iterator indeed walks over the entire database contents.
+func TestNodeIteratorCoverage(t *testing.T) {
+ // Create some arbitrary test state to iterate
+ db, root, _ := makeTestState()
+
+ state, err := New(root, db)
+ 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{}{}
+ }
+ }
+ // Cross check the hashes and the database itself
+ for hash, _ := range hashes {
+ if _, err := db.Get(hash.Bytes()); err != nil {
+ t.Errorf("failed to retrieve reported node %x: %v", hash, err)
+ }
+ }
+ for _, key := range db.(*ethdb.MemDatabase).Keys() {
+ if bytes.HasPrefix(key, []byte("secure-key-")) {
+ continue
+ }
+ if _, ok := hashes[common.BytesToHash(key)]; !ok {
+ t.Errorf("state entry not reported %x", key)
+ }
+ }
+}
diff --git a/core/state/sync_test.go b/core/state/sync_test.go
index 5d6d90d5d..727a276a5 100644
--- a/core/state/sync_test.go
+++ b/core/state/sync_test.go
@@ -116,8 +116,7 @@ func checkStateConsistency(db ethdb.Database, root common.Hash) (failure error)
if err != nil {
return
}
- it := NewNodeIterator(state)
- for it.Next() {
+ for it := NewNodeIterator(state); it.Next(); {
}
return nil
}