mirror of
https://github.com/ethereum/go-ethereum.git
synced 2026-06-12 09:51:36 +00:00
8a5e777fde
Replace the BinaryNode interface (which uses Go interface pointers that the GC must scan) with NodeRef uint32 indices into typed arena pools. NodeRef packs a 2-bit kind tag and 30-bit pool index into a single uint32, making it invisible to the garbage collector. NodeStore manages chunked typed pools per node kind: - InternalNode pool: ZERO Go pointers (children are NodeRef, hash is [32]byte) → allocated in noscan spans, GC skips entirely - HashedNode pool: ZERO Go pointers → noscan spans - StemNode pool: ONE pointer per node (valueData []byte) → minimal GC For a trie with 25K InternalNodes, this reduces GC-scanned pointer-words from ~125K to ~10K (85% reduction). CPU profiling showed 44% of time in GC; this refactor directly addresses that bottleneck. Serialization format is unchanged — the on-disk representation is fully compatible. All existing tests pass.
58 lines
2 KiB
Go
58 lines
2 KiB
Go
// Copyright 2025 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 bintrie
|
|
|
|
import "github.com/ethereum/go-ethereum/common"
|
|
|
|
// zero is the zero value for a 32-byte array.
|
|
var zero [32]byte
|
|
|
|
const (
|
|
StemNodeWidth = 256 // Number of children per leaf node
|
|
StemSize = 31 // Number of bytes to travel before reaching a group of leaves
|
|
NodeTypeBytes = 1 // Size of node type prefix in serialization
|
|
HashSize = 32 // Size of a hash in bytes
|
|
StemBitmapSize = 32 // Size of the bitmap in a stem node (256 values = 32 bytes)
|
|
|
|
// MaxGroupDepth is the maximum allowed group depth for InternalNode serialization.
|
|
MaxGroupDepth = 8
|
|
)
|
|
|
|
// BitmapSizeForDepth returns the bitmap size in bytes for a given group depth.
|
|
func BitmapSizeForDepth(groupDepth int) int {
|
|
if groupDepth <= 3 {
|
|
return 1
|
|
}
|
|
return 1 << (groupDepth - 3)
|
|
}
|
|
|
|
const (
|
|
nodeTypeStem = iota + 1
|
|
nodeTypeInternal
|
|
)
|
|
|
|
// DeserializeAndHash deserializes a node from bytes and returns its hash.
|
|
// This is a convenience function for external callers that need to compute
|
|
// the hash of a serialized node without maintaining a NodeStore.
|
|
func DeserializeAndHash(blob []byte, depth int) (common.Hash, error) {
|
|
s := NewNodeStore()
|
|
ref, err := s.DeserializeNode(blob, depth)
|
|
if err != nil {
|
|
return common.Hash{}, err
|
|
}
|
|
return s.ComputeHash(ref), nil
|
|
}
|