aboutsummaryrefslogtreecommitdiffstats
path: root/core
diff options
context:
space:
mode:
authorFelix Lange <fjl@twurst.com>2017-04-13 20:41:24 +0800
committerFelix Lange <fjl@twurst.com>2017-04-25 08:14:31 +0800
commit4047ccad2fb73fd2cfd69bf5b8cbfa788871ce0f (patch)
tree702ff4ccb7e70b4f9a063df145a13d2d54ad1292 /core
parenta13e920af01692cb07a520cda688f1cc5b5469dd (diff)
downloadgo-tangerine-4047ccad2fb73fd2cfd69bf5b8cbfa788871ce0f.tar.gz
go-tangerine-4047ccad2fb73fd2cfd69bf5b8cbfa788871ce0f.tar.zst
go-tangerine-4047ccad2fb73fd2cfd69bf5b8cbfa788871ce0f.zip
trie: add start key to NodeIterator constructors
The 'step' method is split into two parts, 'peek' and 'push'. peek returns the next state but doesn't make it current. The end of iteration was previously tracked by setting 'trie' to nil. End of iteration is now tracked using the 'iteratorEnd' error, which is slightly cleaner and requires less code.
Diffstat (limited to 'core')
-rw-r--r--core/state/dump.go4
-rw-r--r--core/state/iterator.go4
-rw-r--r--core/state/statedb.go2
3 files changed, 5 insertions, 5 deletions
diff --git a/core/state/dump.go b/core/state/dump.go
index 6338ddf88..ffa1a7283 100644
--- a/core/state/dump.go
+++ b/core/state/dump.go
@@ -45,7 +45,7 @@ func (self *StateDB) RawDump() Dump {
Accounts: make(map[string]DumpAccount),
}
- it := trie.NewIterator(self.trie.NodeIterator())
+ it := trie.NewIterator(self.trie.NodeIterator(nil))
for it.Next() {
addr := self.trie.GetKey(it.Key)
var data Account
@@ -62,7 +62,7 @@ func (self *StateDB) RawDump() Dump {
Code: common.Bytes2Hex(obj.Code(self.db)),
Storage: make(map[string]string),
}
- storageIt := trie.NewIterator(obj.getTrie(self.db).NodeIterator())
+ storageIt := trie.NewIterator(obj.getTrie(self.db).NodeIterator(nil))
for storageIt.Next() {
account.Storage[common.Bytes2Hex(self.trie.GetKey(storageIt.Key))] = common.Bytes2Hex(storageIt.Value)
}
diff --git a/core/state/iterator.go b/core/state/iterator.go
index d2dd5a74e..a8a2722ae 100644
--- a/core/state/iterator.go
+++ b/core/state/iterator.go
@@ -75,7 +75,7 @@ func (it *NodeIterator) step() error {
}
// Initialize the iterator if we've just started
if it.stateIt == nil {
- it.stateIt = it.state.trie.NodeIterator()
+ it.stateIt = it.state.trie.NodeIterator(nil)
}
// If we had data nodes previously, we surely have at least state nodes
if it.dataIt != nil {
@@ -118,7 +118,7 @@ func (it *NodeIterator) step() error {
if err != nil {
return err
}
- it.dataIt = dataTrie.NodeIterator()
+ it.dataIt = dataTrie.NodeIterator(nil)
if !it.dataIt.Next(true) {
it.dataIt = nil
}
diff --git a/core/state/statedb.go b/core/state/statedb.go
index 24381ced5..431f33e02 100644
--- a/core/state/statedb.go
+++ b/core/state/statedb.go
@@ -481,7 +481,7 @@ func (db *StateDB) ForEachStorage(addr common.Address, cb func(key, value common
cb(h, value)
}
- it := trie.NewIterator(so.getTrie(db.db).NodeIterator())
+ it := trie.NewIterator(so.getTrie(db.db).NodeIterator(nil))
for it.Next() {
// ignore cached values
key := common.BytesToHash(db.trie.GetKey(it.Key))