|
| 1 | +use std::collections::HashMap; |
| 2 | + |
| 3 | +use async_trait::async_trait; |
| 4 | +use starknet_api::core::ContractAddress; |
| 5 | +use starknet_api::hash::HashOutput; |
| 6 | +use starknet_patricia::patricia_merkle_tree::filled_tree::node::FilledNode; |
| 7 | +use starknet_patricia::patricia_merkle_tree::filled_tree::tree::FilledTree; |
| 8 | +use starknet_patricia::patricia_merkle_tree::node_data::leaf::{Leaf, LeafModifications}; |
| 9 | +use starknet_patricia::patricia_merkle_tree::types::{NodeIndex, SortedLeafIndices}; |
| 10 | +use starknet_patricia::patricia_merkle_tree::updated_skeleton_tree::hash_function::TreeHashFunction; |
| 11 | +use starknet_patricia_storage::db_object::{EmptyKeyContext, HasStaticPrefix}; |
| 12 | +use starknet_patricia_storage::errors::SerializationResult; |
| 13 | +use starknet_patricia_storage::storage_trait::{DbHashMap, DbKey, Storage}; |
| 14 | + |
| 15 | +use crate::block_committer::input::{FactsDbInitialRead, ReaderConfig, StarknetStorageValue}; |
| 16 | +use crate::db::db_layout::NodeLayout; |
| 17 | +use crate::db::forest_trait::{ForestMetadata, ForestMetadataType, ForestReader, ForestWriter}; |
| 18 | +use crate::db::index_db::leaves::{ |
| 19 | + IndexLayoutCompiledClassHash, |
| 20 | + IndexLayoutContractState, |
| 21 | + IndexLayoutStarknetStorageValue, |
| 22 | + TrieType, |
| 23 | +}; |
| 24 | +use crate::db::index_db::types::{IndexFilledNode, IndexLayoutSubTree, IndexNodeContext}; |
| 25 | +use crate::db::trie_traversal::{create_classes_trie, create_contracts_trie, create_storage_tries}; |
| 26 | +use crate::forest::filled_forest::FilledForest; |
| 27 | +use crate::forest::forest_errors::ForestResult; |
| 28 | +use crate::forest::original_skeleton_forest::{ForestSortedIndices, OriginalSkeletonForest}; |
| 29 | +use crate::hash_function::hash::TreeHashFunctionImpl; |
| 30 | +use crate::patricia_merkle_tree::leaf::leaf_impl::ContractState; |
| 31 | +use crate::patricia_merkle_tree::types::CompiledClassHash; |
| 32 | + |
| 33 | +pub struct IndexDb<S: Storage> { |
| 34 | + pub storage: S, |
| 35 | +} |
| 36 | + |
| 37 | +impl<S: Storage> IndexDb<S> { |
| 38 | + pub fn new(storage: S) -> Self { |
| 39 | + Self { storage } |
| 40 | + } |
| 41 | +} |
| 42 | + |
| 43 | +pub struct IndexNodeLayout {} |
| 44 | + |
| 45 | +impl<'a, L: Leaf> NodeLayout<'a, L> for IndexNodeLayout |
| 46 | +where |
| 47 | + L: HasStaticPrefix<KeyContext = TrieType>, |
| 48 | + TreeHashFunctionImpl: TreeHashFunction<L>, |
| 49 | +{ |
| 50 | + type NodeData = (); |
| 51 | + type NodeDbObject = IndexFilledNode<L>; |
| 52 | + type DeserializationContext = IndexNodeContext; |
| 53 | + type SubTree = IndexLayoutSubTree<'a>; |
| 54 | + |
| 55 | + fn create_subtree( |
| 56 | + sorted_leaf_indices: SortedLeafIndices<'a>, |
| 57 | + root_index: NodeIndex, |
| 58 | + _root_hash: HashOutput, |
| 59 | + ) -> Self::SubTree { |
| 60 | + IndexLayoutSubTree { sorted_leaf_indices, root_index } |
| 61 | + } |
| 62 | + |
| 63 | + fn generate_key_context(trie_type: TrieType) -> <L as HasStaticPrefix>::KeyContext { |
| 64 | + trie_type |
| 65 | + } |
| 66 | + |
| 67 | + fn get_filled_node(node_db_object: Self::NodeDbObject) -> FilledNode<L, Self::NodeData> { |
| 68 | + node_db_object.0 |
| 69 | + } |
| 70 | +} |
| 71 | + |
| 72 | +// TODO(Ariel): define an IndexDbInitialRead empty type, and check whether each tree is empty inside |
| 73 | +// create_xxx_trie. |
| 74 | +#[async_trait] |
| 75 | +impl<S: Storage> ForestReader<FactsDbInitialRead> for IndexDb<S> { |
| 76 | + /// Creates an original skeleton forest that includes the storage tries of the modified |
| 77 | + /// contracts, the classes trie and the contracts trie. Additionally, returns the original |
| 78 | + /// contract states that are needed to compute the contract state tree. |
| 79 | + async fn read<'a>( |
| 80 | + &mut self, |
| 81 | + context: FactsDbInitialRead, |
| 82 | + storage_updates: &'a HashMap<ContractAddress, LeafModifications<StarknetStorageValue>>, |
| 83 | + classes_updates: &'a LeafModifications<CompiledClassHash>, |
| 84 | + forest_sorted_indices: &'a ForestSortedIndices<'a>, |
| 85 | + config: ReaderConfig, |
| 86 | + ) -> ForestResult<(OriginalSkeletonForest<'a>, HashMap<NodeIndex, ContractState>)> { |
| 87 | + let (contracts_trie, original_contracts_trie_leaves) = |
| 88 | + create_contracts_trie::<IndexLayoutContractState, IndexNodeLayout>( |
| 89 | + &mut self.storage, |
| 90 | + context.0.contracts_trie_root_hash, |
| 91 | + forest_sorted_indices.contracts_trie_sorted_indices, |
| 92 | + ) |
| 93 | + .await?; |
| 94 | + let storage_tries = |
| 95 | + create_storage_tries::<IndexLayoutStarknetStorageValue, IndexNodeLayout>( |
| 96 | + &mut self.storage, |
| 97 | + storage_updates, |
| 98 | + &original_contracts_trie_leaves, |
| 99 | + &config, |
| 100 | + &forest_sorted_indices.storage_tries_sorted_indices, |
| 101 | + ) |
| 102 | + .await?; |
| 103 | + let classes_trie = create_classes_trie::<IndexLayoutCompiledClassHash, IndexNodeLayout>( |
| 104 | + &mut self.storage, |
| 105 | + classes_updates, |
| 106 | + context.0.classes_trie_root_hash, |
| 107 | + &config, |
| 108 | + forest_sorted_indices.classes_trie_sorted_indices, |
| 109 | + ) |
| 110 | + .await?; |
| 111 | + |
| 112 | + Ok(( |
| 113 | + OriginalSkeletonForest { classes_trie, contracts_trie, storage_tries }, |
| 114 | + original_contracts_trie_leaves, |
| 115 | + )) |
| 116 | + } |
| 117 | +} |
| 118 | + |
| 119 | +#[async_trait] |
| 120 | +impl<S: Storage> ForestWriter for IndexDb<S> { |
| 121 | + fn serialize_forest(filled_forest: &FilledForest) -> SerializationResult<DbHashMap> { |
| 122 | + let mut serialized_forest = DbHashMap::new(); |
| 123 | + |
| 124 | + // TODO(Ariel): use a different key context when FilledForest is generic over leaf types. |
| 125 | + for tree in filled_forest.storage_tries.values() { |
| 126 | + serialized_forest.extend(tree.serialize(&EmptyKeyContext)?); |
| 127 | + } |
| 128 | + |
| 129 | + // Contracts and classes tries. |
| 130 | + serialized_forest.extend(filled_forest.contracts_trie.serialize(&EmptyKeyContext)?); |
| 131 | + serialized_forest.extend(filled_forest.classes_trie.serialize(&EmptyKeyContext)?); |
| 132 | + |
| 133 | + Ok(serialized_forest) |
| 134 | + } |
| 135 | + |
| 136 | + async fn write_updates(&mut self, updates: DbHashMap) -> usize { |
| 137 | + let n_updates = updates.len(); |
| 138 | + self.storage |
| 139 | + .mset(updates) |
| 140 | + .await |
| 141 | + .unwrap_or_else(|_| panic!("Write of {n_updates} new updates to storage failed")); |
| 142 | + n_updates |
| 143 | + } |
| 144 | +} |
| 145 | + |
| 146 | +// TODO(Ariel): Add index DB metadata keys. |
| 147 | +impl<S: Storage> ForestMetadata for IndexDb<S> { |
| 148 | + /// Returns the db key for the metadata type. |
| 149 | + /// The data keys in an index DB are the result of a hash function; therefore, they are not |
| 150 | + /// expected to collide with these metadata keys. |
| 151 | + fn metadata_key(_metadata_type: ForestMetadataType) -> DbKey { |
| 152 | + DbKey(vec![0]) |
| 153 | + } |
| 154 | +} |
0 commit comments