aboutsummaryrefslogtreecommitdiffstats
path: root/trie
diff options
context:
space:
mode:
authorFelix Lange <fjl@twurst.com>2017-04-18 19:08:17 +0800
committerFelix Lange <fjl@twurst.com>2017-04-18 20:52:11 +0800
commita31d268b76ff13df8e7d060163a842b8ed569793 (patch)
tree3660c31af1e6fc226e99b1b2767c8fe551f40681 /trie
parentc7a4d9cf8ae307a94d16dd8197824eecd320cdf7 (diff)
downloadgo-tangerine-a31d268b76ff13df8e7d060163a842b8ed569793.tar
go-tangerine-a31d268b76ff13df8e7d060163a842b8ed569793.tar.gz
go-tangerine-a31d268b76ff13df8e7d060163a842b8ed569793.tar.bz2
go-tangerine-a31d268b76ff13df8e7d060163a842b8ed569793.tar.lz
go-tangerine-a31d268b76ff13df8e7d060163a842b8ed569793.tar.xz
go-tangerine-a31d268b76ff13df8e7d060163a842b8ed569793.tar.zst
go-tangerine-a31d268b76ff13df8e7d060163a842b8ed569793.zip
trie: remove Key in MissingNodeError
The key was constructed from nibbles, which isn't possible for all nodes. Remove the only use of Key in LightTrie by always retrying with the original key that was looked up.
Diffstat (limited to 'trie')
-rw-r--r--trie/errors.go5
-rw-r--r--trie/trie.go1
2 files changed, 0 insertions, 6 deletions
diff --git a/trie/errors.go b/trie/errors.go
index 76129a70b..e23f9d563 100644
--- a/trie/errors.go
+++ b/trie/errors.go
@@ -30,10 +30,6 @@ import (
//
// RootHash is the original root of the trie that contains the node
//
-// Key is a binary-encoded key that contains the prefix that leads to the first
-// missing node and optionally a suffix that hints on which further nodes should
-// also be retrieved
-//
// PrefixLen is the nibble length of the key prefix that leads from the root to
// the missing node
//
@@ -42,7 +38,6 @@ import (
// such hints in the error message)
type MissingNodeError struct {
RootHash, NodeHash common.Hash
- Key []byte
PrefixLen, SuffixLen int
}
diff --git a/trie/trie.go b/trie/trie.go
index 2a6044068..0979eb625 100644
--- a/trie/trie.go
+++ b/trie/trie.go
@@ -450,7 +450,6 @@ func (t *Trie) resolveHash(n hashNode, prefix, suffix []byte) (node, error) {
return nil, &MissingNodeError{
RootHash: t.originalRoot,
NodeHash: common.BytesToHash(n),
- Key: compactHexEncode(append(prefix, suffix...)),
PrefixLen: len(prefix),
SuffixLen: len(suffix),
}