forked from ethereum/go-ethereum
-
Notifications
You must be signed in to change notification settings - Fork 13
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #6 from gballet/trie_gen
Trie gen PR-ception
- Loading branch information
Showing
4 changed files
with
133 additions
and
9 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,117 @@ | ||
| // Copyright 2020 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 trie | ||
|
|
||
| import ( | ||
| "fmt" | ||
| "github.com/ethereum/go-ethereum/common" | ||
| ) | ||
|
|
||
| // HashTrie is a Merkle Patricia Trie, which can only be used for | ||
| // constructing a trie from a sequence of sorted leafs, in descending order | ||
| type HashTrie struct { | ||
| root node | ||
| rootKey []byte | ||
| build []node | ||
| } | ||
|
|
||
| func NewHashTrie() *HashTrie { | ||
| return &HashTrie{root: nil, rootKey: nil, build: nil} | ||
| } | ||
|
|
||
| func (t *HashTrie) TryUpdate(key, value []byte) error { | ||
| k := keybytesToHex(key) | ||
| if len(value) == 0 { | ||
| panic("deletion not supported") | ||
| } | ||
| t.root = t.insert(t.root, nil, k, valueNode(value)) | ||
| return nil | ||
| } | ||
|
|
||
| func (t *HashTrie) insert(n node, prefix, key []byte, value node) node { | ||
| if len(key) == 0 { | ||
| return value | ||
| } | ||
| switch n := n.(type) { | ||
| case *shortNode: | ||
| matchlen := prefixLen(key, n.Key) | ||
| // If the whole key matches, it already exists | ||
| if matchlen == len(n.Key) { | ||
| n.Val = t.insert(n.Val, append(prefix, key[:matchlen]...), key[matchlen:], value) | ||
| n.flags = nodeFlag{dirty: true} | ||
| return n | ||
| } | ||
| // Otherwise branch out at the index where they differ. | ||
| branch := &fullNode{flags: nodeFlag{dirty: true}} | ||
| branch.Children[n.Key[matchlen]] = t.insert(nil, append(prefix, n.Key[:matchlen+1]...), n.Key[matchlen+1:], n.Val) | ||
| // Hashing the sub-node, nothing will be added to this sub-branch | ||
| hashed, _ := newHasher(false).hash(t.insert(nil, append(prefix, key[:matchlen+1]...), key[matchlen+1:], value), true) | ||
| branch.Children[key[matchlen]] = hashed.(hashNode) | ||
|
|
||
| // Replace this shortNode with the branch if it occurs at index 0. | ||
| if matchlen == 0 { | ||
| return branch | ||
| } | ||
| // Otherwise, replace it with a short node leading up to the branch. | ||
| n.Key = key[:matchlen] | ||
| n.Val = branch | ||
| n.flags = nodeFlag{dirty: true} | ||
| return n | ||
|
|
||
| case *fullNode: | ||
| n.flags = nodeFlag{dirty: true} | ||
| // If any previous child wasn't already hashed, do it now since | ||
| // the keys arrive in order, so if a branch is here then whatever | ||
| // came before can safely be hashed. | ||
| for i := int(key[0]) - 1; i > 0; i -= 1 { | ||
| switch n.Children[i].(type) { | ||
| case *shortNode, *fullNode, *valueNode: | ||
| hashed, _ := newHasher(false).hash(n.Children[i], true) | ||
| n.Children[i] = hashed | ||
| // hash encountred, the rest has already been hashed | ||
| case hashNode: | ||
| break | ||
| default: | ||
| panic("invalid node") | ||
| } | ||
| } | ||
| n.Children[key[0]] = t.insert(n.Children[key[0]], append(prefix, key[0]), key[1:], value) | ||
| return n | ||
|
|
||
| case nil: | ||
| return &shortNode{key, value, nodeFlag{dirty: true}} | ||
|
|
||
| case hashNode: | ||
| // We've hit a part of the trie that isn't loaded yet -- this means | ||
| // someone inserted | ||
| panic("hash resolution not supported") | ||
|
|
||
| default: | ||
| panic(fmt.Sprintf("%T: invalid node: %v", n, n)) | ||
| } | ||
| } | ||
|
|
||
| func (t *HashTrie) Hash() common.Hash { | ||
| if t.root == nil { | ||
| return emptyRoot | ||
| } | ||
| h := newHasher(false) | ||
| defer returnHasherToPool(h) | ||
| hashed, cached := h.hash(t.root, true) | ||
| t.root = cached | ||
| return common.BytesToHash(hashed.(hashNode)) | ||
| } |