65ed1a6871
This change speeds up trie hashing and all other activities that require RLP encoding of trie nodes by approximately 20%. The speedup is achieved by avoiding reflection overhead during node encoding. The interface type trie.node now contains a method 'encode' that works with rlp.EncoderBuffer. Management of EncoderBuffers is left to calling code. trie.hasher, which is pooled to avoid allocations, now maintains an EncoderBuffer. This means memory resources related to trie node encoding are tied to the hasher pool. Co-authored-by: Felix Lange <fjl@twurst.com>
88 lines
1.9 KiB
Go
88 lines
1.9 KiB
Go
// Copyright 2022 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 (
|
|
"github.com/ethereum/go-ethereum/rlp"
|
|
)
|
|
|
|
func nodeToBytes(n node) []byte {
|
|
w := rlp.NewEncoderBuffer(nil)
|
|
n.encode(w)
|
|
result := w.ToBytes()
|
|
w.Flush()
|
|
return result
|
|
}
|
|
|
|
func (n *fullNode) encode(w rlp.EncoderBuffer) {
|
|
offset := w.List()
|
|
for _, c := range n.Children {
|
|
if c != nil {
|
|
c.encode(w)
|
|
} else {
|
|
w.Write(rlp.EmptyString)
|
|
}
|
|
}
|
|
w.ListEnd(offset)
|
|
}
|
|
|
|
func (n *shortNode) encode(w rlp.EncoderBuffer) {
|
|
offset := w.List()
|
|
w.WriteBytes(n.Key)
|
|
if n.Val != nil {
|
|
n.Val.encode(w)
|
|
} else {
|
|
w.Write(rlp.EmptyString)
|
|
}
|
|
w.ListEnd(offset)
|
|
}
|
|
|
|
func (n hashNode) encode(w rlp.EncoderBuffer) {
|
|
w.WriteBytes(n)
|
|
}
|
|
|
|
func (n valueNode) encode(w rlp.EncoderBuffer) {
|
|
w.WriteBytes(n)
|
|
}
|
|
|
|
func (n rawFullNode) encode(w rlp.EncoderBuffer) {
|
|
offset := w.List()
|
|
for _, c := range n {
|
|
if c != nil {
|
|
c.encode(w)
|
|
} else {
|
|
w.Write(rlp.EmptyString)
|
|
}
|
|
}
|
|
w.ListEnd(offset)
|
|
}
|
|
|
|
func (n *rawShortNode) encode(w rlp.EncoderBuffer) {
|
|
offset := w.List()
|
|
w.WriteBytes(n.Key)
|
|
if n.Val != nil {
|
|
n.Val.encode(w)
|
|
} else {
|
|
w.Write(rlp.EmptyString)
|
|
}
|
|
w.ListEnd(offset)
|
|
}
|
|
|
|
func (n rawNode) encode(w rlp.EncoderBuffer) {
|
|
w.Write(n)
|
|
}
|