forked from bnb-chain/reth
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
10b4a02
commit 50ddf6a
Showing
4 changed files
with
185 additions
and
39 deletions.
There are no files selected for viewing
Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,144 @@ | ||
| use lazy_static::lazy_static; | ||
| use quick_cache::sync::Cache; | ||
| use reth_primitives::{Account, Address, Bytecode, StorageKey, StorageValue, B256, U256}; | ||
| use reth_revm::db::{BundleState, OriginalValuesKnown}; | ||
| use schnellru::{ByLength, LruMap}; | ||
| use std::{ | ||
| collections::{HashMap, HashSet}, | ||
| sync::{Arc, Mutex, RwLock}, | ||
| }; | ||
| use tracing::info; | ||
|
|
||
| // Cache sizes | ||
| const ACCOUNT_CACHE_SIZE: usize = 1000000; | ||
| const STORAGE_CACHE_SIZE: usize = ACCOUNT_CACHE_SIZE * 10; | ||
| const CONTRACT_CACHE_SIZE: usize = ACCOUNT_CACHE_SIZE / 100; | ||
|
|
||
| // Type alias for address and storage key tuple | ||
| type AddressStorageKey = (Address, StorageKey); | ||
|
|
||
| lazy_static! { | ||
| /// Account cache | ||
| pub(crate) static ref PLAIN_ACCOUNTS: Cache<Address, Account> = Cache::new(ACCOUNT_CACHE_SIZE); | ||
|
|
||
| /// Storage cache | ||
| pub(crate) static ref PLAIN_STORAGES: Cache<AddressStorageKey, StorageValue> = Cache::new(STORAGE_CACHE_SIZE); | ||
|
|
||
| /// Contract cache | ||
| /// The size of contract is large and the hot contracts should be limited. | ||
| pub(crate) static ref CONTRACT_CODES: Cache<B256, Bytecode> = Cache::new(CONTRACT_CACHE_SIZE); | ||
|
|
||
| /// Mapping for deleting storages | ||
| static ref PLAIN_STORAGES_MAPPING: Mutex<HashMap<Address, HashSet<B256>>> = Mutex::new(HashMap::new()); | ||
|
|
||
| pub(crate) static ref STORAGES: Arc<RwLock<LruMap<Address,HashMap<B256, U256>>>> = Arc::new(RwLock::new(LruMap::new(ByLength::new(ACCOUNT_CACHE_SIZE as u32)))); | ||
| } | ||
|
|
||
| pub(crate) fn insert_account(k: Address, v: Account) { | ||
| PLAIN_ACCOUNTS.insert(k, v); | ||
| } | ||
|
|
||
| /// Insert storage into the cache | ||
| pub(crate) fn insert_storage(k: AddressStorageKey, v: U256) { | ||
| { | ||
| let mut map = PLAIN_STORAGES_MAPPING.lock().unwrap(); | ||
| if let Some(set) = map.get_mut(&k.0) { | ||
| set.insert(k.1); | ||
| } else { | ||
| map.insert(k.0, HashSet::from([k.1])); | ||
| } | ||
| } | ||
|
|
||
| PLAIN_STORAGES.insert(k, v); | ||
| } | ||
|
|
||
| pub(crate) fn remove_storages(address: Address) { | ||
| let mut map = PLAIN_STORAGES_MAPPING.lock().unwrap(); | ||
| if let Some(set) = map.remove(&address) { | ||
| for s in &set { | ||
| let storage_key = (address, *s); | ||
| PLAIN_STORAGES.remove(&storage_key); | ||
| } | ||
| } | ||
| } | ||
| pub(crate) fn insert_storages(address: Address, storages: Vec<(U256, U256)>) { | ||
| if storages.is_empty() { | ||
| return; | ||
| } | ||
|
|
||
| { | ||
| let mut map = PLAIN_STORAGES_MAPPING.lock().unwrap(); | ||
| if let Some(set) = map.get_mut(&address) { | ||
| set.extend(storages.iter().map(|(k, _)| StorageKey::from(*k))); | ||
| } else { | ||
| map.insert( | ||
| address, | ||
| HashSet::from_iter(storages.iter().map(|(k, _)| StorageKey::from(*k))), | ||
| ); | ||
| } | ||
| } | ||
|
|
||
| for (k, v) in storages { | ||
| PLAIN_STORAGES.insert((address, StorageKey::from(k)), v); | ||
| } | ||
| } | ||
|
|
||
| // Get account from cache | ||
| pub(crate) fn get_account(k: &Address) -> Option<Account> { | ||
| PLAIN_ACCOUNTS.get(k) | ||
| } | ||
|
|
||
| // Get storage from cache | ||
| pub(crate) fn get_storage(k: &AddressStorageKey) -> Option<StorageValue> { | ||
| PLAIN_STORAGES.get(k) | ||
| } | ||
|
|
||
| // Get code from cache | ||
| pub(crate) fn get_code(k: &B256) -> Option<Bytecode> { | ||
| CONTRACT_CODES.get(k) | ||
| } | ||
|
|
||
| // Insert code into cache | ||
| pub(crate) fn insert_code(k: B256, v: Bytecode) { | ||
| CONTRACT_CODES.insert(k, v); | ||
| } | ||
|
|
||
| /// Write committed state to cache. | ||
| pub(crate) fn write_plain_state(bundle: BundleState) { | ||
| let change_set = bundle.into_plain_state(OriginalValuesKnown::Yes); | ||
|
|
||
| // Update account cache | ||
| for (address, account_info) in &change_set.accounts { | ||
| match account_info { | ||
| None => { | ||
| PLAIN_ACCOUNTS.remove(address); | ||
| } | ||
| Some(acc) => { | ||
| PLAIN_ACCOUNTS.insert( | ||
| *address, | ||
| Account { | ||
| nonce: acc.nonce, | ||
| balance: acc.balance, | ||
| bytecode_hash: Some(acc.code_hash), | ||
| }, | ||
| ); | ||
| } | ||
| } | ||
| } | ||
|
|
||
| // Update storage cache | ||
| for storage in &change_set.storage { | ||
| if storage.wipe_storage { | ||
| info!(target: "blockchain_tree", "wipe_storage is true."); | ||
| remove_storages(storage.address); | ||
| } | ||
|
|
||
| insert_storages(storage.address, storage.storage.clone()); | ||
| } | ||
| } | ||
|
|
||
| /// Clear cached accounts and storages. | ||
| pub(crate) fn clear_plain_state() { | ||
| PLAIN_ACCOUNTS.clear(); | ||
| PLAIN_STORAGES.clear(); | ||
| } |