Struct ExecutionCache 

pub struct ExecutionCache(/* private fields */);

Execution cache used during block processing.

Optimizes state access by maintaining in-memory copies of frequently accessed accounts, storage slots, and bytecode. Works in conjunction with prewarming to reduce database I/O during block execution.

Storage Invalidation

Since EIP-6780, SELFDESTRUCT only works within the same transaction where the contract was created, so we don’t need to handle clearing the storage.

Implementations

impl ExecutionCache

pub const fn bytes_to_entries(size_bytes: usize, entry_size: usize) -> usize

Converts a byte size to number of cache entries, rounding down to a power of two.

Fixed-cache requires power-of-two sizes for efficient indexing. With epochs enabled, the minimum size is 4096 entries.

pub fn new(total_cache_size: usize) -> Self

Build an ExecutionCache struct, so that execution caches can be easily cloned.

pub fn get_or_try_insert_code_with<E>( &self, hash: B256, f: impl FnOnce() -> Result<Option<Bytecode>, E>, ) -> Result<CachedStatus<Option<Bytecode>>, E>

Gets code from cache, or inserts using the provided function.

pub fn get_or_try_insert_storage_with<E>( &self, address: Address, key: StorageKey, f: impl FnOnce() -> Result<StorageValue, E>, ) -> Result<CachedStatus<StorageValue>, E>

Gets storage from cache, or inserts using the provided function.

pub fn get_or_try_insert_account_with<E>( &self, address: Address, f: impl FnOnce() -> Result<Option<Account>, E>, ) -> Result<CachedStatus<Option<Account>>, E>

Gets account from cache, or inserts using the provided function.

pub fn insert_storage( &self, address: Address, key: StorageKey, value: Option<StorageValue>, )

Insert storage value into cache.

pub fn insert_state(&self, state_updates: &BundleState) -> Result<(), ()>

Inserts the post-execution state changes into the cache.

This method is called after transaction execution to update the cache with the touched and modified state. The insertion order is critical:

1. Bytecodes: Insert contract code first
2. Storage slots: Update storage values for each account
3. Accounts: Update account info (nonce, balance, code hash)

Why This Order Matters

Account information references bytecode via code hash. If we update accounts before bytecode, we might create cache entries pointing to non-existent code. The current order ensures cache consistency.

Error Handling

Returns an error if the state updates are inconsistent and should be discarded.

Trait Implementations

impl Clone for ExecutionCache

fn clone(&self) -> ExecutionCache

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for ExecutionCache

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 8 bytes