mirror of
https://github.com/hl-archive-node/nanoreth.git
synced 2025-12-06 10:59:55 +00:00
167 lines
5.6 KiB
Rust
167 lines
5.6 KiB
Rust
//! Database adapters for payload building.
|
|
|
|
use reth_primitives::{
|
|
revm_primitives::{
|
|
db::{Database, DatabaseRef},
|
|
AccountInfo, Address, Bytecode, B256,
|
|
},
|
|
U256,
|
|
};
|
|
use std::{
|
|
cell::RefCell,
|
|
collections::{hash_map::Entry, HashMap},
|
|
};
|
|
|
|
/// A container type that caches reads from an underlying [DatabaseRef].
|
|
///
|
|
/// This is intended to be used in conjunction with `revm::db::State`
|
|
/// during payload building which repeatedly accesses the same data.
|
|
///
|
|
/// # Example
|
|
///
|
|
/// ```
|
|
/// use reth_payload_builder::database::CachedReads;
|
|
/// use revm::db::{DatabaseRef, State};
|
|
///
|
|
/// fn build_payload<DB: DatabaseRef>(db: DB) {
|
|
/// let mut cached_reads = CachedReads::default();
|
|
/// let db_ref = cached_reads.as_db(db);
|
|
/// // this is `Database` and can be used to build a payload, it never writes to `CachedReads` or the underlying database, but all reads from the underlying database are cached in `CachedReads`.
|
|
/// // Subsequent payload build attempts can use cached reads and avoid hitting the underlying database.
|
|
/// let db = State::builder().with_database_ref(db_ref).build();
|
|
/// }
|
|
/// ```
|
|
#[derive(Debug, Clone, Default)]
|
|
pub struct CachedReads {
|
|
accounts: HashMap<Address, CachedAccount>,
|
|
contracts: HashMap<B256, Bytecode>,
|
|
block_hashes: HashMap<U256, B256>,
|
|
}
|
|
|
|
// === impl CachedReads ===
|
|
|
|
impl CachedReads {
|
|
/// Gets a [DatabaseRef] that will cache reads from the given database.
|
|
pub fn as_db<DB>(&mut self, db: DB) -> CachedReadsDBRef<'_, DB> {
|
|
CachedReadsDBRef { inner: RefCell::new(self.as_db_mut(db)) }
|
|
}
|
|
|
|
fn as_db_mut<DB>(&mut self, db: DB) -> CachedReadsDbMut<'_, DB> {
|
|
CachedReadsDbMut { cached: self, db }
|
|
}
|
|
|
|
/// Inserts an account info into the cache.
|
|
pub fn insert_account(
|
|
&mut self,
|
|
address: Address,
|
|
info: AccountInfo,
|
|
storage: HashMap<U256, U256>,
|
|
) {
|
|
self.accounts.insert(address, CachedAccount { info: Some(info), storage });
|
|
}
|
|
}
|
|
|
|
/// A [Database] that caches reads inside [CachedReads].
|
|
#[derive(Debug)]
|
|
pub struct CachedReadsDbMut<'a, DB> {
|
|
/// The cache of reads.
|
|
pub cached: &'a mut CachedReads,
|
|
/// The underlying database.
|
|
pub db: DB,
|
|
}
|
|
|
|
impl<'a, DB: DatabaseRef> Database for CachedReadsDbMut<'a, DB> {
|
|
type Error = <DB as DatabaseRef>::Error;
|
|
|
|
fn basic(&mut self, address: Address) -> Result<Option<AccountInfo>, Self::Error> {
|
|
let basic = match self.cached.accounts.entry(address) {
|
|
Entry::Occupied(entry) => entry.get().info.clone(),
|
|
Entry::Vacant(entry) => {
|
|
entry.insert(CachedAccount::new(self.db.basic_ref(address)?)).info.clone()
|
|
}
|
|
};
|
|
Ok(basic)
|
|
}
|
|
|
|
fn code_by_hash(&mut self, code_hash: B256) -> Result<Bytecode, Self::Error> {
|
|
let code = match self.cached.contracts.entry(code_hash) {
|
|
Entry::Occupied(entry) => entry.get().clone(),
|
|
Entry::Vacant(entry) => entry.insert(self.db.code_by_hash_ref(code_hash)?).clone(),
|
|
};
|
|
Ok(code)
|
|
}
|
|
|
|
fn storage(&mut self, address: Address, index: U256) -> Result<U256, Self::Error> {
|
|
match self.cached.accounts.entry(address) {
|
|
Entry::Occupied(mut acc_entry) => match acc_entry.get_mut().storage.entry(index) {
|
|
Entry::Occupied(entry) => Ok(*entry.get()),
|
|
Entry::Vacant(entry) => Ok(*entry.insert(self.db.storage_ref(address, index)?)),
|
|
},
|
|
Entry::Vacant(acc_entry) => {
|
|
// acc needs to be loaded for us to access slots.
|
|
let info = self.db.basic_ref(address)?;
|
|
let (account, value) = if info.is_some() {
|
|
let value = self.db.storage_ref(address, index)?;
|
|
let mut account = CachedAccount::new(info);
|
|
account.storage.insert(index, value);
|
|
(account, value)
|
|
} else {
|
|
(CachedAccount::new(info), U256::ZERO)
|
|
};
|
|
acc_entry.insert(account);
|
|
Ok(value)
|
|
}
|
|
}
|
|
}
|
|
|
|
fn block_hash(&mut self, number: U256) -> Result<B256, Self::Error> {
|
|
let code = match self.cached.block_hashes.entry(number) {
|
|
Entry::Occupied(entry) => *entry.get(),
|
|
Entry::Vacant(entry) => *entry.insert(self.db.block_hash_ref(number)?),
|
|
};
|
|
Ok(code)
|
|
}
|
|
}
|
|
|
|
/// A [DatabaseRef] that caches reads inside [CachedReads].
|
|
///
|
|
/// This is intended to be used as the [DatabaseRef] for
|
|
/// `revm::db::State` for repeated payload build jobs.
|
|
#[derive(Debug)]
|
|
pub struct CachedReadsDBRef<'a, DB> {
|
|
/// The inner cache reads db mut.
|
|
pub inner: RefCell<CachedReadsDbMut<'a, DB>>,
|
|
}
|
|
|
|
impl<'a, DB: DatabaseRef> DatabaseRef for CachedReadsDBRef<'a, DB> {
|
|
type Error = <DB as DatabaseRef>::Error;
|
|
|
|
fn basic_ref(&self, address: Address) -> Result<Option<AccountInfo>, Self::Error> {
|
|
self.inner.borrow_mut().basic(address)
|
|
}
|
|
|
|
fn code_by_hash_ref(&self, code_hash: B256) -> Result<Bytecode, Self::Error> {
|
|
self.inner.borrow_mut().code_by_hash(code_hash)
|
|
}
|
|
|
|
fn storage_ref(&self, address: Address, index: U256) -> Result<U256, Self::Error> {
|
|
self.inner.borrow_mut().storage(address, index)
|
|
}
|
|
|
|
fn block_hash_ref(&self, number: U256) -> Result<B256, Self::Error> {
|
|
self.inner.borrow_mut().block_hash(number)
|
|
}
|
|
}
|
|
|
|
#[derive(Debug, Clone)]
|
|
struct CachedAccount {
|
|
info: Option<AccountInfo>,
|
|
storage: HashMap<U256, U256>,
|
|
}
|
|
|
|
impl CachedAccount {
|
|
fn new(info: Option<AccountInfo>) -> Self {
|
|
Self { info, storage: HashMap::new() }
|
|
}
|
|
}
|