github/reth
1
1
Fork 0
mirror of https://github.com/paradigmxyz/reth.git synced 2026-02-19 03:04:27 -05:00
Code Issues Packages Projects Releases Wiki Activity

perf(trie-db): preallocate vectors in changeset computation (#21465)

Browse Source
This commit is contained in:
David Klank
2026-01-28 14:39:08 +02:00
committed by GitHub
parent e0a0a0d5fb
commit 6aa91b0020
1 changed files with 6 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
crates/trie/db/src/changesets.rs
View File

@@ -219,11 +219,12 @@ where
let cursor_factory = InMemoryTrieCursorFactory::new(db_cursor_factory, &reverts);
// Step 5: Collect all account trie nodes that changed in the target block
let mut account_nodes = Vec::new();
let account_nodes_ref = changesets.account_nodes_ref();
let mut account_nodes = Vec::with_capacity(account_nodes_ref.len());
let mut account_cursor = cursor_factory.account_trie_cursor()?;
// Iterate over the account nodes from the changesets
for (nibbles, _old_node) in changesets.account_nodes_ref() {
for (nibbles, _old_node) in account_nodes_ref {
// Look up the current value of this trie node using the overlay cursor
let node_value = account_cursor.seek_exact(*nibbles)?.map(|(_, node)| node);
account_nodes.push((*nibbles, node_value));
@@ -235,10 +236,11 @@ where
// Iterate over the storage tries from the changesets
for (hashed_address, storage_changeset) in changesets.storage_tries_ref() {
let mut storage_cursor = cursor_factory.storage_trie_cursor(*hashed_address)?;
let mut storage_nodes = Vec::new();
let storage_nodes_ref = storage_changeset.storage_nodes_ref();
let mut storage_nodes = Vec::with_capacity(storage_nodes_ref.len());
// Iterate over the storage nodes for this account
for (nibbles, _old_node) in storage_changeset.storage_nodes_ref() {
for (nibbles, _old_node) in storage_nodes_ref {
// Look up the current value of this storage trie node
let node_value = storage_cursor.seek_exact(*nibbles)?.map(|(_, node)| node);
storage_nodes.push((*nibbles, node_value));