mirror of
https://github.com/paradigmxyz/reth.git
synced 2026-02-15 01:14:59 -05:00
83 lines
3.6 KiB
Rust
83 lines
3.6 KiB
Rust
use rayon::slice::ParallelSliceMut;
|
|
use reth_db::{
|
|
cursor::{DbCursorRO, DbCursorRW, DbDupCursorRO, DbDupCursorRW},
|
|
tables,
|
|
transaction::{DbTx, DbTxMut},
|
|
};
|
|
use reth_interfaces::db::DatabaseError;
|
|
use reth_primitives::{revm::compat::into_reth_acc, Bytecode, StorageEntry, U256};
|
|
use revm::db::states::{PlainStorageChangeset, StateChangeset};
|
|
|
|
/// A change to the state of the world.
|
|
#[derive(Debug, Default)]
|
|
pub struct StateChanges(pub StateChangeset);
|
|
|
|
impl From<StateChangeset> for StateChanges {
|
|
fn from(revm: StateChangeset) -> Self {
|
|
Self(revm)
|
|
}
|
|
}
|
|
|
|
impl StateChanges {
|
|
/// Write the bundle state to the database.
|
|
pub fn write_to_db<TX: DbTxMut + DbTx>(mut self, tx: &TX) -> Result<(), DatabaseError> {
|
|
// sort all entries so they can be written to database in more performant way.
|
|
// and take smaller memory footprint.
|
|
self.0.accounts.par_sort_by_key(|a| a.0);
|
|
self.0.storage.par_sort_by_key(|a| a.address);
|
|
self.0.contracts.par_sort_by_key(|a| a.0);
|
|
|
|
// Write new account state
|
|
tracing::trace!(target: "provider::bundle_state", len = self.0.accounts.len(), "Writing new account state");
|
|
let mut accounts_cursor = tx.cursor_write::<tables::PlainAccountState>()?;
|
|
// write account to database.
|
|
for (address, account) in self.0.accounts.into_iter() {
|
|
if let Some(account) = account {
|
|
tracing::trace!(target: "provider::bundle_state", ?address, "Updating plain state account");
|
|
accounts_cursor.upsert(address, into_reth_acc(account))?;
|
|
} else if accounts_cursor.seek_exact(address)?.is_some() {
|
|
tracing::trace!(target: "provider::bundle_state", ?address, "Deleting plain state account");
|
|
accounts_cursor.delete_current()?;
|
|
}
|
|
}
|
|
|
|
// Write bytecode
|
|
tracing::trace!(target: "provider::bundle_state", len = self.0.contracts.len(), "Writing bytecodes");
|
|
let mut bytecodes_cursor = tx.cursor_write::<tables::Bytecodes>()?;
|
|
for (hash, bytecode) in self.0.contracts.into_iter() {
|
|
bytecodes_cursor.upsert(hash, Bytecode(bytecode))?;
|
|
}
|
|
|
|
// Write new storage state and wipe storage if needed.
|
|
tracing::trace!(target: "provider::bundle_state", len = self.0.storage.len(), "Writing new storage state");
|
|
let mut storages_cursor = tx.cursor_dup_write::<tables::PlainStorageState>()?;
|
|
for PlainStorageChangeset { address, wipe_storage, storage } in self.0.storage.into_iter() {
|
|
// Wiping of storage.
|
|
if wipe_storage && storages_cursor.seek_exact(address)?.is_some() {
|
|
storages_cursor.delete_current_duplicates()?;
|
|
}
|
|
// cast storages to B256.
|
|
let mut storage = storage
|
|
.into_iter()
|
|
.map(|(k, value)| StorageEntry { key: k.into(), value })
|
|
.collect::<Vec<_>>();
|
|
// sort storage slots by key.
|
|
storage.par_sort_unstable_by_key(|a| a.key);
|
|
|
|
for entry in storage.into_iter() {
|
|
tracing::trace!(target: "provider::bundle_state", ?address, ?entry.key, "Updating plain state storage");
|
|
if let Some(db_entry) = storages_cursor.seek_by_key_subkey(address, entry.key)? {
|
|
if db_entry.key == entry.key {
|
|
storages_cursor.delete_current()?;
|
|
}
|
|
}
|
|
|
|
if entry.value != U256::ZERO {
|
|
storages_cursor.upsert(address, entry)?;
|
|
}
|
|
}
|
|
}
|
|
Ok(())
|
|
}
|
|
}
|