diff options
author | Péter Szilágyi <peterke@gmail.com> | 2016-01-06 18:11:56 +0800 |
---|---|---|
committer | Péter Szilágyi <peterke@gmail.com> | 2016-02-16 18:21:08 +0800 |
commit | 5a057a8dedd1fa284e04bc2e7780e74d4600fdeb (patch) | |
tree | 3285474d93d6e83f9326c2bc0435527e12d0b768 /core/state/iterator.go | |
parent | 7e29b0b5b4e5cf7ded9a5a75789de6f8121caec9 (diff) | |
download | go-tangerine-5a057a8dedd1fa284e04bc2e7780e74d4600fdeb.tar go-tangerine-5a057a8dedd1fa284e04bc2e7780e74d4600fdeb.tar.gz go-tangerine-5a057a8dedd1fa284e04bc2e7780e74d4600fdeb.tar.bz2 go-tangerine-5a057a8dedd1fa284e04bc2e7780e74d4600fdeb.tar.lz go-tangerine-5a057a8dedd1fa284e04bc2e7780e74d4600fdeb.tar.xz go-tangerine-5a057a8dedd1fa284e04bc2e7780e74d4600fdeb.tar.zst go-tangerine-5a057a8dedd1fa284e04bc2e7780e74d4600fdeb.zip |
core/state, trie: surface iterator entry hashes
Diffstat (limited to 'core/state/iterator.go')
-rw-r--r-- | core/state/iterator.go | 14 |
1 files changed, 9 insertions, 5 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 } |