1use crate::{
2 bundle_state::StorageRevertsIter,
3 providers::{
4 database::{chain::ChainStorage, metrics},
5 static_file::StaticFileWriter,
6 NodeTypesForProvider, StaticFileProvider,
7 },
8 to_range,
9 traits::{
10 AccountExtReader, BlockSource, ChangeSetReader, ReceiptProvider, StageCheckpointWriter,
11 },
12 AccountReader, BlockBodyWriter, BlockExecutionWriter, BlockHashReader, BlockNumReader,
13 BlockReader, BlockWriter, BundleStateInit, ChainStateBlockReader, ChainStateBlockWriter,
14 DBProvider, HashingWriter, HeaderProvider, HeaderSyncGapProvider, HistoricalStateProvider,
15 HistoricalStateProviderRef, HistoryWriter, LatestStateProvider, LatestStateProviderRef,
16 OriginalValuesKnown, ProviderError, PruneCheckpointReader, PruneCheckpointWriter, RevertsInit,
17 StageCheckpointReader, StateProviderBox, StateWriter, StaticFileProviderFactory, StatsReader,
18 StorageLocation, StorageReader, StorageTrieWriter, TransactionVariant, TransactionsProvider,
19 TransactionsProviderExt, TrieWriter,
20};
21use alloy_consensus::{
22 transaction::{SignerRecoverable, TransactionMeta},
23 BlockHeader, Header, TxReceipt,
24};
25use alloy_eips::{eip2718::Encodable2718, BlockHashOrNumber};
26use alloy_primitives::{
27 keccak256,
28 map::{hash_map, B256Map, HashMap, HashSet},
29 Address, BlockHash, BlockNumber, TxHash, TxNumber, B256, U256,
30};
31use itertools::Itertools;
32use rayon::slice::ParallelSliceMut;
33use reth_chainspec::{ChainInfo, ChainSpecProvider, EthChainSpec, EthereumHardforks};
34use reth_db_api::{
35 cursor::{DbCursorRO, DbCursorRW, DbDupCursorRO, DbDupCursorRW},
36 database::Database,
37 models::{
38 sharded_key, storage_sharded_key::StorageShardedKey, AccountBeforeTx, BlockNumberAddress,
39 ShardedKey, StoredBlockBodyIndices,
40 },
41 table::Table,
42 tables,
43 transaction::{DbTx, DbTxMut},
44 BlockNumberList, DatabaseError, PlainAccountState, PlainStorageState,
45};
46use reth_execution_types::{Chain, ExecutionOutcome};
47use reth_node_types::{BlockTy, BodyTy, HeaderTy, NodeTypes, ReceiptTy, TxTy};
48use reth_primitives_traits::{
49 Account, Block as _, BlockBody as _, Bytecode, GotExpected, NodePrimitives, RecoveredBlock,
50 SealedHeader, SignedTransaction, StorageEntry,
51};
52use reth_prune_types::{
53 PruneCheckpoint, PruneMode, PruneModes, PruneSegment, MINIMUM_PRUNING_DISTANCE,
54};
55use reth_stages_types::{StageCheckpoint, StageId};
56use reth_static_file_types::StaticFileSegment;
57use reth_storage_api::{
58 BlockBodyIndicesProvider, BlockBodyReader, NodePrimitivesProvider, StateProvider,
59 StorageChangeSetReader, TryIntoHistoricalStateProvider,
60};
61use reth_storage_errors::provider::{ProviderResult, RootMismatch};
62use reth_trie::{
63 prefix_set::{PrefixSet, PrefixSetMut, TriePrefixSets},
64 updates::{StorageTrieUpdates, TrieUpdates},
65 HashedPostStateSorted, Nibbles, StateRoot, StoredNibbles,
66};
67use reth_trie_db::{DatabaseStateRoot, DatabaseStorageTrieCursor};
68use revm_database::states::{
69 PlainStateReverts, PlainStorageChangeset, PlainStorageRevert, StateChangeset,
70};
71use std::{
72 cmp::Ordering,
73 collections::{BTreeMap, BTreeSet},
74 fmt::Debug,
75 ops::{Deref, DerefMut, Range, RangeBounds, RangeInclusive},
76 sync::{mpsc, Arc},
77};
78use tracing::{debug, trace};
79
80pub type DatabaseProviderRO<DB, N> = DatabaseProvider<<DB as Database>::TX, N>;
82
83#[derive(Debug)]
88pub struct DatabaseProviderRW<DB: Database, N: NodeTypes>(
89 pub DatabaseProvider<<DB as Database>::TXMut, N>,
90);
91
92impl<DB: Database, N: NodeTypes> Deref for DatabaseProviderRW<DB, N> {
93 type Target = DatabaseProvider<<DB as Database>::TXMut, N>;
94
95 fn deref(&self) -> &Self::Target {
96 &self.0
97 }
98}
99
100impl<DB: Database, N: NodeTypes> DerefMut for DatabaseProviderRW<DB, N> {
101 fn deref_mut(&mut self) -> &mut Self::Target {
102 &mut self.0
103 }
104}
105
106impl<DB: Database, N: NodeTypes> AsRef<DatabaseProvider<<DB as Database>::TXMut, N>>
107 for DatabaseProviderRW<DB, N>
108{
109 fn as_ref(&self) -> &DatabaseProvider<<DB as Database>::TXMut, N> {
110 &self.0
111 }
112}
113
114impl<DB: Database, N: NodeTypes + 'static> DatabaseProviderRW<DB, N> {
115 pub fn commit(self) -> ProviderResult<bool> {
117 self.0.commit()
118 }
119
120 pub fn into_tx(self) -> <DB as Database>::TXMut {
122 self.0.into_tx()
123 }
124}
125
126impl<DB: Database, N: NodeTypes> From<DatabaseProviderRW<DB, N>>
127 for DatabaseProvider<<DB as Database>::TXMut, N>
128{
129 fn from(provider: DatabaseProviderRW<DB, N>) -> Self {
130 provider.0
131 }
132}
133
134#[derive(Debug)]
137pub struct DatabaseProvider<TX, N: NodeTypes> {
138 tx: TX,
140 chain_spec: Arc<N::ChainSpec>,
142 static_file_provider: StaticFileProvider<N::Primitives>,
144 prune_modes: PruneModes,
146 storage: Arc<N::Storage>,
148}
149
150impl<TX, N: NodeTypes> DatabaseProvider<TX, N> {
151 pub const fn prune_modes_ref(&self) -> &PruneModes {
153 &self.prune_modes
154 }
155}
156
157impl<TX: DbTx + 'static, N: NodeTypes> DatabaseProvider<TX, N> {
158 pub fn latest<'a>(&'a self) -> Box<dyn StateProvider + 'a> {
160 trace!(target: "providers::db", "Returning latest state provider");
161 Box::new(LatestStateProviderRef::new(self))
162 }
163
164 pub fn history_by_block_hash<'a>(
166 &'a self,
167 block_hash: BlockHash,
168 ) -> ProviderResult<Box<dyn StateProvider + 'a>> {
169 let mut block_number =
170 self.block_number(block_hash)?.ok_or(ProviderError::BlockHashNotFound(block_hash))?;
171 if block_number == self.best_block_number().unwrap_or_default() &&
172 block_number == self.last_block_number().unwrap_or_default()
173 {
174 return Ok(Box::new(LatestStateProviderRef::new(self)))
175 }
176
177 block_number += 1;
179
180 let account_history_prune_checkpoint =
181 self.get_prune_checkpoint(PruneSegment::AccountHistory)?;
182 let storage_history_prune_checkpoint =
183 self.get_prune_checkpoint(PruneSegment::StorageHistory)?;
184
185 let mut state_provider = HistoricalStateProviderRef::new(self, block_number);
186
187 if let Some(prune_checkpoint_block_number) =
190 account_history_prune_checkpoint.and_then(|checkpoint| checkpoint.block_number)
191 {
192 state_provider = state_provider.with_lowest_available_account_history_block_number(
193 prune_checkpoint_block_number + 1,
194 );
195 }
196 if let Some(prune_checkpoint_block_number) =
197 storage_history_prune_checkpoint.and_then(|checkpoint| checkpoint.block_number)
198 {
199 state_provider = state_provider.with_lowest_available_storage_history_block_number(
200 prune_checkpoint_block_number + 1,
201 );
202 }
203
204 Ok(Box::new(state_provider))
205 }
206
207 #[cfg(feature = "test-utils")]
208 pub fn set_prune_modes(&mut self, prune_modes: PruneModes) {
210 self.prune_modes = prune_modes;
211 }
212}
213
214impl<TX, N: NodeTypes> NodePrimitivesProvider for DatabaseProvider<TX, N> {
215 type Primitives = N::Primitives;
216}
217
218impl<TX, N: NodeTypes> StaticFileProviderFactory for DatabaseProvider<TX, N> {
219 fn static_file_provider(&self) -> StaticFileProvider<Self::Primitives> {
221 self.static_file_provider.clone()
222 }
223}
224
225impl<TX: Debug + Send + Sync, N: NodeTypes<ChainSpec: EthChainSpec + 'static>> ChainSpecProvider
226 for DatabaseProvider<TX, N>
227{
228 type ChainSpec = N::ChainSpec;
229
230 fn chain_spec(&self) -> Arc<Self::ChainSpec> {
231 self.chain_spec.clone()
232 }
233}
234
235impl<TX: DbTxMut, N: NodeTypes> DatabaseProvider<TX, N> {
236 pub const fn new_rw(
238 tx: TX,
239 chain_spec: Arc<N::ChainSpec>,
240 static_file_provider: StaticFileProvider<N::Primitives>,
241 prune_modes: PruneModes,
242 storage: Arc<N::Storage>,
243 ) -> Self {
244 Self { tx, chain_spec, static_file_provider, prune_modes, storage }
245 }
246}
247
248impl<TX, N: NodeTypes> AsRef<Self> for DatabaseProvider<TX, N> {
249 fn as_ref(&self) -> &Self {
250 self
251 }
252}
253
254impl<TX: DbTx + DbTxMut + 'static, N: NodeTypesForProvider> DatabaseProvider<TX, N> {
255 pub fn unwind_trie_state_range(
260 &self,
261 range: RangeInclusive<BlockNumber>,
262 ) -> ProviderResult<()> {
263 let changed_accounts = self
264 .tx
265 .cursor_read::<tables::AccountChangeSets>()?
266 .walk_range(range.clone())?
267 .collect::<Result<Vec<_>, _>>()?;
268
269 let hashed_addresses = self.unwind_account_hashing(changed_accounts.iter())?;
271 let mut account_prefix_set = PrefixSetMut::with_capacity(hashed_addresses.len());
272 let mut destroyed_accounts = HashSet::default();
273 for (hashed_address, account) in hashed_addresses {
274 account_prefix_set.insert(Nibbles::unpack(hashed_address));
275 if account.is_none() {
276 destroyed_accounts.insert(hashed_address);
277 }
278 }
279
280 self.unwind_account_history_indices(changed_accounts.iter())?;
282 let storage_range = BlockNumberAddress::range(range.clone());
283
284 let changed_storages = self
285 .tx
286 .cursor_read::<tables::StorageChangeSets>()?
287 .walk_range(storage_range)?
288 .collect::<Result<Vec<_>, _>>()?;
289
290 let mut storage_prefix_sets = B256Map::<PrefixSet>::default();
293 let storage_entries = self.unwind_storage_hashing(changed_storages.iter().copied())?;
294 for (hashed_address, hashed_slots) in storage_entries {
295 account_prefix_set.insert(Nibbles::unpack(hashed_address));
296 let mut storage_prefix_set = PrefixSetMut::with_capacity(hashed_slots.len());
297 for slot in hashed_slots {
298 storage_prefix_set.insert(Nibbles::unpack(slot));
299 }
300 storage_prefix_sets.insert(hashed_address, storage_prefix_set.freeze());
301 }
302
303 self.unwind_storage_history_indices(changed_storages.iter().copied())?;
305
306 let prefix_sets = TriePrefixSets {
310 account_prefix_set: account_prefix_set.freeze(),
311 storage_prefix_sets,
312 destroyed_accounts,
313 };
314 let (new_state_root, trie_updates) = StateRoot::from_tx(&self.tx)
315 .with_prefix_sets(prefix_sets)
316 .root_with_updates()
317 .map_err(reth_db_api::DatabaseError::from)?;
318
319 let parent_number = range.start().saturating_sub(1);
320 let parent_state_root = self
321 .header_by_number(parent_number)?
322 .ok_or_else(|| ProviderError::HeaderNotFound(parent_number.into()))?
323 .state_root();
324
325 if new_state_root != parent_state_root {
328 let parent_hash = self
329 .block_hash(parent_number)?
330 .ok_or_else(|| ProviderError::HeaderNotFound(parent_number.into()))?;
331 return Err(ProviderError::UnwindStateRootMismatch(Box::new(RootMismatch {
332 root: GotExpected { got: new_state_root, expected: parent_state_root },
333 block_number: parent_number,
334 block_hash: parent_hash,
335 })))
336 }
337 self.write_trie_updates(&trie_updates)?;
338
339 Ok(())
340 }
341
342 fn remove_receipts_from(
344 &self,
345 from_tx: TxNumber,
346 last_block: BlockNumber,
347 remove_from: StorageLocation,
348 ) -> ProviderResult<()> {
349 if remove_from.database() {
350 self.remove::<tables::Receipts<ReceiptTy<N>>>(from_tx..)?;
352 }
353
354 if remove_from.static_files() && !self.prune_modes.has_receipts_pruning() {
355 let static_file_receipt_num =
356 self.static_file_provider.get_highest_static_file_tx(StaticFileSegment::Receipts);
357
358 let to_delete = static_file_receipt_num
359 .map(|static_num| (static_num + 1).saturating_sub(from_tx))
360 .unwrap_or_default();
361
362 self.static_file_provider
363 .latest_writer(StaticFileSegment::Receipts)?
364 .prune_receipts(to_delete, last_block)?;
365 }
366
367 Ok(())
368 }
369}
370
371impl<TX: DbTx + 'static, N: NodeTypes> TryIntoHistoricalStateProvider for DatabaseProvider<TX, N> {
372 fn try_into_history_at_block(
373 self,
374 mut block_number: BlockNumber,
375 ) -> ProviderResult<StateProviderBox> {
376 if block_number == self.best_block_number().unwrap_or_default() {
379 return Ok(Box::new(LatestStateProvider::new(self)))
380 }
381
382 block_number += 1;
384
385 let account_history_prune_checkpoint =
386 self.get_prune_checkpoint(PruneSegment::AccountHistory)?;
387 let storage_history_prune_checkpoint =
388 self.get_prune_checkpoint(PruneSegment::StorageHistory)?;
389
390 let mut state_provider = HistoricalStateProvider::new(self, block_number);
391
392 if let Some(prune_checkpoint_block_number) =
395 account_history_prune_checkpoint.and_then(|checkpoint| checkpoint.block_number)
396 {
397 state_provider = state_provider.with_lowest_available_account_history_block_number(
398 prune_checkpoint_block_number + 1,
399 );
400 }
401 if let Some(prune_checkpoint_block_number) =
402 storage_history_prune_checkpoint.and_then(|checkpoint| checkpoint.block_number)
403 {
404 state_provider = state_provider.with_lowest_available_storage_history_block_number(
405 prune_checkpoint_block_number + 1,
406 );
407 }
408
409 Ok(Box::new(state_provider))
410 }
411}
412
413impl<
414 Tx: DbTx + DbTxMut + 'static,
415 N: NodeTypesForProvider<Primitives: NodePrimitives<BlockHeader = Header>>,
416 > DatabaseProvider<Tx, N>
417{
418 pub fn insert_historical_block(
422 &self,
423 block: RecoveredBlock<<Self as BlockWriter>::Block>,
424 ) -> ProviderResult<StoredBlockBodyIndices> {
425 let ttd = if block.number() == 0 {
426 block.header().difficulty()
427 } else {
428 let parent_block_number = block.number() - 1;
429 let parent_ttd = self.header_td_by_number(parent_block_number)?.unwrap_or_default();
430 parent_ttd + block.header().difficulty()
431 };
432
433 let mut writer = self.static_file_provider.latest_writer(StaticFileSegment::Headers)?;
434
435 let segment_header = writer.user_header();
437 if segment_header.block_end().is_none() && segment_header.expected_block_start() == 0 {
438 for block_number in 0..block.number() {
439 let mut prev = block.clone_header();
440 prev.number = block_number;
441 writer.append_header(&prev, U256::ZERO, &B256::ZERO)?;
442 }
443 }
444
445 writer.append_header(block.header(), ttd, &block.hash())?;
446
447 self.insert_block(block, StorageLocation::Database)
448 }
449}
450
451fn unwind_history_shards<S, T, C>(
466 cursor: &mut C,
467 start_key: T::Key,
468 block_number: BlockNumber,
469 mut shard_belongs_to_key: impl FnMut(&T::Key) -> bool,
470) -> ProviderResult<Vec<u64>>
471where
472 T: Table<Value = BlockNumberList>,
473 T::Key: AsRef<ShardedKey<S>>,
474 C: DbCursorRO<T> + DbCursorRW<T>,
475{
476 let mut item = cursor.seek_exact(start_key)?;
478 while let Some((sharded_key, list)) = item {
479 if !shard_belongs_to_key(&sharded_key) {
481 break
482 }
483
484 cursor.delete_current()?;
487
488 let first = list.iter().next().expect("List can't be empty");
491
492 if first >= block_number {
495 item = cursor.prev()?;
496 continue
497 }
498 else if block_number <= sharded_key.as_ref().highest_block_number {
501 return Ok(list.iter().take_while(|i| *i < block_number).collect::<Vec<_>>())
504 }
505 return Ok(list.iter().collect::<Vec<_>>())
508 }
509
510 Ok(Vec::new())
512}
513
514impl<TX: DbTx + 'static, N: NodeTypesForProvider> DatabaseProvider<TX, N> {
515 pub const fn new(
517 tx: TX,
518 chain_spec: Arc<N::ChainSpec>,
519 static_file_provider: StaticFileProvider<N::Primitives>,
520 prune_modes: PruneModes,
521 storage: Arc<N::Storage>,
522 ) -> Self {
523 Self { tx, chain_spec, static_file_provider, prune_modes, storage }
524 }
525
526 pub fn into_tx(self) -> TX {
528 self.tx
529 }
530
531 pub const fn tx_mut(&mut self) -> &mut TX {
533 &mut self.tx
534 }
535
536 pub const fn tx_ref(&self) -> &TX {
538 &self.tx
539 }
540
541 pub fn chain_spec(&self) -> &N::ChainSpec {
543 &self.chain_spec
544 }
545}
546
547impl<TX: DbTx + 'static, N: NodeTypesForProvider> DatabaseProvider<TX, N> {
548 fn transactions_by_tx_range_with_cursor<C>(
549 &self,
550 range: impl RangeBounds<TxNumber>,
551 cursor: &mut C,
552 ) -> ProviderResult<Vec<TxTy<N>>>
553 where
554 C: DbCursorRO<tables::Transactions<TxTy<N>>>,
555 {
556 self.static_file_provider.get_range_with_static_file_or_database(
557 StaticFileSegment::Transactions,
558 to_range(range),
559 |static_file, range, _| static_file.transactions_by_tx_range(range),
560 |range, _| self.cursor_collect(cursor, range),
561 |_| true,
562 )
563 }
564
565 fn recovered_block<H, HF, B, BF>(
566 &self,
567 id: BlockHashOrNumber,
568 _transaction_kind: TransactionVariant,
569 header_by_number: HF,
570 construct_block: BF,
571 ) -> ProviderResult<Option<B>>
572 where
573 H: AsRef<HeaderTy<N>>,
574 HF: FnOnce(BlockNumber) -> ProviderResult<Option<H>>,
575 BF: FnOnce(H, BodyTy<N>, Vec<Address>) -> ProviderResult<Option<B>>,
576 {
577 let Some(block_number) = self.convert_hash_or_number(id)? else { return Ok(None) };
578 let Some(header) = header_by_number(block_number)? else { return Ok(None) };
579
580 let Some(body) = self.block_body_indices(block_number)? else { return Ok(None) };
587
588 let tx_range = body.tx_num_range();
589
590 let (transactions, senders) = if tx_range.is_empty() {
591 (vec![], vec![])
592 } else {
593 (self.transactions_by_tx_range(tx_range.clone())?, self.senders_by_tx_range(tx_range)?)
594 };
595
596 let body = self
597 .storage
598 .reader()
599 .read_block_bodies(self, vec![(header.as_ref(), transactions)])?
600 .pop()
601 .ok_or(ProviderError::InvalidStorageOutput)?;
602
603 construct_block(header, body, senders)
604 }
605
606 fn block_range<F, H, HF, R>(
616 &self,
617 range: RangeInclusive<BlockNumber>,
618 headers_range: HF,
619 mut assemble_block: F,
620 ) -> ProviderResult<Vec<R>>
621 where
622 H: AsRef<HeaderTy<N>>,
623 HF: FnOnce(RangeInclusive<BlockNumber>) -> ProviderResult<Vec<H>>,
624 F: FnMut(H, BodyTy<N>, Range<TxNumber>) -> ProviderResult<R>,
625 {
626 if range.is_empty() {
627 return Ok(Vec::new())
628 }
629
630 let len = range.end().saturating_sub(*range.start()) as usize;
631 let mut blocks = Vec::with_capacity(len);
632
633 let headers = headers_range(range.clone())?;
634 let mut tx_cursor = self.tx.cursor_read::<tables::Transactions<TxTy<N>>>()?;
635
636 let present_headers = self
642 .block_body_indices_range(range)?
643 .into_iter()
644 .map(|b| b.tx_num_range())
645 .zip(headers)
646 .collect::<Vec<_>>();
647
648 let mut inputs = Vec::new();
649 for (tx_range, header) in &present_headers {
650 let transactions = if tx_range.is_empty() {
651 Vec::new()
652 } else {
653 self.transactions_by_tx_range_with_cursor(tx_range.clone(), &mut tx_cursor)?
654 };
655
656 inputs.push((header.as_ref(), transactions));
657 }
658
659 let bodies = self.storage.reader().read_block_bodies(self, inputs)?;
660
661 for ((tx_range, header), body) in present_headers.into_iter().zip(bodies) {
662 blocks.push(assemble_block(header, body, tx_range)?);
663 }
664
665 Ok(blocks)
666 }
667
668 fn block_with_senders_range<H, HF, B, BF>(
679 &self,
680 range: RangeInclusive<BlockNumber>,
681 headers_range: HF,
682 assemble_block: BF,
683 ) -> ProviderResult<Vec<B>>
684 where
685 H: AsRef<HeaderTy<N>>,
686 HF: Fn(RangeInclusive<BlockNumber>) -> ProviderResult<Vec<H>>,
687 BF: Fn(H, BodyTy<N>, Vec<Address>) -> ProviderResult<B>,
688 {
689 let mut senders_cursor = self.tx.cursor_read::<tables::TransactionSenders>()?;
690
691 self.block_range(range, headers_range, |header, body, tx_range| {
692 let senders = if tx_range.is_empty() {
693 Vec::new()
694 } else {
695 let known_senders =
697 senders_cursor
698 .walk_range(tx_range.clone())?
699 .collect::<Result<HashMap<_, _>, _>>()?;
700
701 let mut senders = Vec::with_capacity(body.transactions().len());
702 for (tx_num, tx) in tx_range.zip(body.transactions()) {
703 match known_senders.get(&tx_num) {
704 None => {
705 let sender = tx.recover_signer_unchecked()?;
707 senders.push(sender);
708 }
709 Some(sender) => senders.push(*sender),
710 }
711 }
712
713 senders
714 };
715
716 assemble_block(header, body, senders)
717 })
718 }
719
720 fn populate_bundle_state<A, S>(
724 &self,
725 account_changeset: Vec<(u64, AccountBeforeTx)>,
726 storage_changeset: Vec<(BlockNumberAddress, StorageEntry)>,
727 plain_accounts_cursor: &mut A,
728 plain_storage_cursor: &mut S,
729 ) -> ProviderResult<(BundleStateInit, RevertsInit)>
730 where
731 A: DbCursorRO<PlainAccountState>,
732 S: DbDupCursorRO<PlainStorageState>,
733 {
734 let mut state: BundleStateInit = HashMap::default();
738
739 let mut reverts: RevertsInit = HashMap::default();
745
746 for (block_number, account_before) in account_changeset.into_iter().rev() {
748 let AccountBeforeTx { info: old_info, address } = account_before;
749 match state.entry(address) {
750 hash_map::Entry::Vacant(entry) => {
751 let new_info = plain_accounts_cursor.seek_exact(address)?.map(|kv| kv.1);
752 entry.insert((old_info, new_info, HashMap::default()));
753 }
754 hash_map::Entry::Occupied(mut entry) => {
755 entry.get_mut().0 = old_info;
757 }
758 }
759 reverts.entry(block_number).or_default().entry(address).or_default().0 = Some(old_info);
761 }
762
763 for (block_and_address, old_storage) in storage_changeset.into_iter().rev() {
765 let BlockNumberAddress((block_number, address)) = block_and_address;
766 let account_state = match state.entry(address) {
768 hash_map::Entry::Vacant(entry) => {
769 let present_info = plain_accounts_cursor.seek_exact(address)?.map(|kv| kv.1);
770 entry.insert((present_info, present_info, HashMap::default()))
771 }
772 hash_map::Entry::Occupied(entry) => entry.into_mut(),
773 };
774
775 match account_state.2.entry(old_storage.key) {
777 hash_map::Entry::Vacant(entry) => {
778 let new_storage = plain_storage_cursor
779 .seek_by_key_subkey(address, old_storage.key)?
780 .filter(|storage| storage.key == old_storage.key)
781 .unwrap_or_default();
782 entry.insert((old_storage.value, new_storage.value));
783 }
784 hash_map::Entry::Occupied(mut entry) => {
785 entry.get_mut().0 = old_storage.value;
786 }
787 };
788
789 reverts
790 .entry(block_number)
791 .or_default()
792 .entry(address)
793 .or_default()
794 .1
795 .push(old_storage);
796 }
797
798 Ok((state, reverts))
799 }
800}
801
802impl<TX: DbTxMut + DbTx + 'static, N: NodeTypes> DatabaseProvider<TX, N> {
803 pub fn commit(self) -> ProviderResult<bool> {
805 Ok(self.tx.commit()?)
806 }
807
808 fn take_shard<T>(
811 &self,
812 cursor: &mut <TX as DbTxMut>::CursorMut<T>,
813 key: T::Key,
814 ) -> ProviderResult<Vec<u64>>
815 where
816 T: Table<Value = BlockNumberList>,
817 {
818 if let Some((_, list)) = cursor.seek_exact(key)? {
819 cursor.delete_current()?;
821 let list = list.iter().collect::<Vec<_>>();
822 return Ok(list)
823 }
824 Ok(Vec::new())
825 }
826
827 fn append_history_index<P, T>(
835 &self,
836 index_updates: impl IntoIterator<Item = (P, impl IntoIterator<Item = u64>)>,
837 mut sharded_key_factory: impl FnMut(P, BlockNumber) -> T::Key,
838 ) -> ProviderResult<()>
839 where
840 P: Copy,
841 T: Table<Value = BlockNumberList>,
842 {
843 let mut cursor = self.tx.cursor_write::<T>()?;
844 for (partial_key, indices) in index_updates {
845 let mut last_shard =
846 self.take_shard::<T>(&mut cursor, sharded_key_factory(partial_key, u64::MAX))?;
847 last_shard.extend(indices);
848 let mut chunks = last_shard.chunks(sharded_key::NUM_OF_INDICES_IN_SHARD).peekable();
850 while let Some(list) = chunks.next() {
851 let highest_block_number = if chunks.peek().is_some() {
852 *list.last().expect("`chunks` does not return empty list")
853 } else {
854 u64::MAX
856 };
857 cursor.insert(
858 sharded_key_factory(partial_key, highest_block_number),
859 &BlockNumberList::new_pre_sorted(list.iter().copied()),
860 )?;
861 }
862 }
863 Ok(())
864 }
865}
866
867impl<TX: DbTx, N: NodeTypes> AccountReader for DatabaseProvider<TX, N> {
868 fn basic_account(&self, address: &Address) -> ProviderResult<Option<Account>> {
869 Ok(self.tx.get_by_encoded_key::<tables::PlainAccountState>(address)?)
870 }
871}
872
873impl<TX: DbTx, N: NodeTypes> AccountExtReader for DatabaseProvider<TX, N> {
874 fn changed_accounts_with_range(
875 &self,
876 range: impl RangeBounds<BlockNumber>,
877 ) -> ProviderResult<BTreeSet<Address>> {
878 self.tx
879 .cursor_read::<tables::AccountChangeSets>()?
880 .walk_range(range)?
881 .map(|entry| {
882 entry.map(|(_, account_before)| account_before.address).map_err(Into::into)
883 })
884 .collect()
885 }
886
887 fn basic_accounts(
888 &self,
889 iter: impl IntoIterator<Item = Address>,
890 ) -> ProviderResult<Vec<(Address, Option<Account>)>> {
891 let mut plain_accounts = self.tx.cursor_read::<tables::PlainAccountState>()?;
892 Ok(iter
893 .into_iter()
894 .map(|address| plain_accounts.seek_exact(address).map(|a| (address, a.map(|(_, v)| v))))
895 .collect::<Result<Vec<_>, _>>()?)
896 }
897
898 fn changed_accounts_and_blocks_with_range(
899 &self,
900 range: RangeInclusive<BlockNumber>,
901 ) -> ProviderResult<BTreeMap<Address, Vec<u64>>> {
902 let mut changeset_cursor = self.tx.cursor_read::<tables::AccountChangeSets>()?;
903
904 let account_transitions = changeset_cursor.walk_range(range)?.try_fold(
905 BTreeMap::new(),
906 |mut accounts: BTreeMap<Address, Vec<u64>>, entry| -> ProviderResult<_> {
907 let (index, account) = entry?;
908 accounts.entry(account.address).or_default().push(index);
909 Ok(accounts)
910 },
911 )?;
912
913 Ok(account_transitions)
914 }
915}
916
917impl<TX: DbTx, N: NodeTypes> StorageChangeSetReader for DatabaseProvider<TX, N> {
918 fn storage_changeset(
919 &self,
920 block_number: BlockNumber,
921 ) -> ProviderResult<Vec<(BlockNumberAddress, StorageEntry)>> {
922 let range = block_number..=block_number;
923 let storage_range = BlockNumberAddress::range(range);
924 self.tx
925 .cursor_dup_read::<tables::StorageChangeSets>()?
926 .walk_range(storage_range)?
927 .map(|result| -> ProviderResult<_> { Ok(result?) })
928 .collect()
929 }
930}
931
932impl<TX: DbTx, N: NodeTypes> ChangeSetReader for DatabaseProvider<TX, N> {
933 fn account_block_changeset(
934 &self,
935 block_number: BlockNumber,
936 ) -> ProviderResult<Vec<AccountBeforeTx>> {
937 let range = block_number..=block_number;
938 self.tx
939 .cursor_read::<tables::AccountChangeSets>()?
940 .walk_range(range)?
941 .map(|result| -> ProviderResult<_> {
942 let (_, account_before) = result?;
943 Ok(account_before)
944 })
945 .collect()
946 }
947}
948
949impl<TX: DbTx + 'static, N: NodeTypesForProvider> HeaderSyncGapProvider
950 for DatabaseProvider<TX, N>
951{
952 type Header = HeaderTy<N>;
953
954 fn local_tip_header(
955 &self,
956 highest_uninterrupted_block: BlockNumber,
957 ) -> ProviderResult<SealedHeader<Self::Header>> {
958 let static_file_provider = self.static_file_provider();
959
960 let next_static_file_block_num = static_file_provider
963 .get_highest_static_file_block(StaticFileSegment::Headers)
964 .map(|id| id + 1)
965 .unwrap_or_default();
966 let next_block = highest_uninterrupted_block + 1;
967
968 match next_static_file_block_num.cmp(&next_block) {
969 Ordering::Greater => {
972 let mut static_file_producer =
973 static_file_provider.latest_writer(StaticFileSegment::Headers)?;
974 static_file_producer.prune_headers(next_static_file_block_num - next_block)?;
975 static_file_producer.commit()?
978 }
979 Ordering::Less => {
980 return Err(ProviderError::HeaderNotFound(next_static_file_block_num.into()))
982 }
983 Ordering::Equal => {}
984 }
985
986 let local_head = static_file_provider
987 .sealed_header(highest_uninterrupted_block)?
988 .ok_or_else(|| ProviderError::HeaderNotFound(highest_uninterrupted_block.into()))?;
989
990 Ok(local_head)
991 }
992}
993
994impl<TX: DbTx + 'static, N: NodeTypesForProvider> HeaderProvider for DatabaseProvider<TX, N> {
995 type Header = HeaderTy<N>;
996
997 fn header(&self, block_hash: &BlockHash) -> ProviderResult<Option<Self::Header>> {
998 if let Some(num) = self.block_number(*block_hash)? {
999 Ok(self.header_by_number(num)?)
1000 } else {
1001 Ok(None)
1002 }
1003 }
1004
1005 fn header_by_number(&self, num: BlockNumber) -> ProviderResult<Option<Self::Header>> {
1006 self.static_file_provider.get_with_static_file_or_database(
1007 StaticFileSegment::Headers,
1008 num,
1009 |static_file| static_file.header_by_number(num),
1010 || Ok(self.tx.get::<tables::Headers<Self::Header>>(num)?),
1011 )
1012 }
1013
1014 fn header_td(&self, block_hash: &BlockHash) -> ProviderResult<Option<U256>> {
1015 if let Some(num) = self.block_number(*block_hash)? {
1016 self.header_td_by_number(num)
1017 } else {
1018 Ok(None)
1019 }
1020 }
1021
1022 fn header_td_by_number(&self, number: BlockNumber) -> ProviderResult<Option<U256>> {
1023 if self.chain_spec.is_paris_active_at_block(number) {
1024 if let Some(td) = self.chain_spec.final_paris_total_difficulty() {
1025 return Ok(Some(td))
1028 }
1029 }
1030
1031 self.static_file_provider.get_with_static_file_or_database(
1032 StaticFileSegment::Headers,
1033 number,
1034 |static_file| static_file.header_td_by_number(number),
1035 || Ok(self.tx.get::<tables::HeaderTerminalDifficulties>(number)?.map(|td| td.0)),
1036 )
1037 }
1038
1039 fn headers_range(
1040 &self,
1041 range: impl RangeBounds<BlockNumber>,
1042 ) -> ProviderResult<Vec<Self::Header>> {
1043 self.static_file_provider.get_range_with_static_file_or_database(
1044 StaticFileSegment::Headers,
1045 to_range(range),
1046 |static_file, range, _| static_file.headers_range(range),
1047 |range, _| self.cursor_read_collect::<tables::Headers<Self::Header>>(range),
1048 |_| true,
1049 )
1050 }
1051
1052 fn sealed_header(
1053 &self,
1054 number: BlockNumber,
1055 ) -> ProviderResult<Option<SealedHeader<Self::Header>>> {
1056 self.static_file_provider.get_with_static_file_or_database(
1057 StaticFileSegment::Headers,
1058 number,
1059 |static_file| static_file.sealed_header(number),
1060 || {
1061 if let Some(header) = self.header_by_number(number)? {
1062 let hash = self
1063 .block_hash(number)?
1064 .ok_or_else(|| ProviderError::HeaderNotFound(number.into()))?;
1065 Ok(Some(SealedHeader::new(header, hash)))
1066 } else {
1067 Ok(None)
1068 }
1069 },
1070 )
1071 }
1072
1073 fn sealed_headers_while(
1074 &self,
1075 range: impl RangeBounds<BlockNumber>,
1076 predicate: impl FnMut(&SealedHeader<Self::Header>) -> bool,
1077 ) -> ProviderResult<Vec<SealedHeader<Self::Header>>> {
1078 self.static_file_provider.get_range_with_static_file_or_database(
1079 StaticFileSegment::Headers,
1080 to_range(range),
1081 |static_file, range, predicate| static_file.sealed_headers_while(range, predicate),
1082 |range, mut predicate| {
1083 let mut headers = vec![];
1084 for entry in
1085 self.tx.cursor_read::<tables::Headers<Self::Header>>()?.walk_range(range)?
1086 {
1087 let (number, header) = entry?;
1088 let hash = self
1089 .block_hash(number)?
1090 .ok_or_else(|| ProviderError::HeaderNotFound(number.into()))?;
1091 let sealed = SealedHeader::new(header, hash);
1092 if !predicate(&sealed) {
1093 break
1094 }
1095 headers.push(sealed);
1096 }
1097 Ok(headers)
1098 },
1099 predicate,
1100 )
1101 }
1102}
1103
1104impl<TX: DbTx + 'static, N: NodeTypes> BlockHashReader for DatabaseProvider<TX, N> {
1105 fn block_hash(&self, number: u64) -> ProviderResult<Option<B256>> {
1106 self.static_file_provider.get_with_static_file_or_database(
1107 StaticFileSegment::Headers,
1108 number,
1109 |static_file| static_file.block_hash(number),
1110 || Ok(self.tx.get::<tables::CanonicalHeaders>(number)?),
1111 )
1112 }
1113
1114 fn canonical_hashes_range(
1115 &self,
1116 start: BlockNumber,
1117 end: BlockNumber,
1118 ) -> ProviderResult<Vec<B256>> {
1119 self.static_file_provider.get_range_with_static_file_or_database(
1120 StaticFileSegment::Headers,
1121 start..end,
1122 |static_file, range, _| static_file.canonical_hashes_range(range.start, range.end),
1123 |range, _| self.cursor_read_collect::<tables::CanonicalHeaders>(range),
1124 |_| true,
1125 )
1126 }
1127}
1128
1129impl<TX: DbTx + 'static, N: NodeTypes> BlockNumReader for DatabaseProvider<TX, N> {
1130 fn chain_info(&self) -> ProviderResult<ChainInfo> {
1131 let best_number = self.best_block_number()?;
1132 let best_hash = self.block_hash(best_number)?.unwrap_or_default();
1133 Ok(ChainInfo { best_hash, best_number })
1134 }
1135
1136 fn best_block_number(&self) -> ProviderResult<BlockNumber> {
1137 Ok(self
1140 .get_stage_checkpoint(StageId::Finish)?
1141 .map(|checkpoint| checkpoint.block_number)
1142 .unwrap_or_default())
1143 }
1144
1145 fn last_block_number(&self) -> ProviderResult<BlockNumber> {
1146 Ok(self
1147 .tx
1148 .cursor_read::<tables::CanonicalHeaders>()?
1149 .last()?
1150 .map(|(num, _)| num)
1151 .max(
1152 self.static_file_provider.get_highest_static_file_block(StaticFileSegment::Headers),
1153 )
1154 .unwrap_or_default())
1155 }
1156
1157 fn block_number(&self, hash: B256) -> ProviderResult<Option<BlockNumber>> {
1158 Ok(self.tx.get::<tables::HeaderNumbers>(hash)?)
1159 }
1160}
1161
1162impl<TX: DbTx + 'static, N: NodeTypesForProvider> BlockReader for DatabaseProvider<TX, N> {
1163 type Block = BlockTy<N>;
1164
1165 fn find_block_by_hash(
1166 &self,
1167 hash: B256,
1168 source: BlockSource,
1169 ) -> ProviderResult<Option<Self::Block>> {
1170 if source.is_canonical() {
1171 self.block(hash.into())
1172 } else {
1173 Ok(None)
1174 }
1175 }
1176
1177 fn block(&self, id: BlockHashOrNumber) -> ProviderResult<Option<Self::Block>> {
1183 if let Some(number) = self.convert_hash_or_number(id)? {
1184 if let Some(header) = self.header_by_number(number)? {
1185 let Some(transactions) = self.transactions_by_block(number.into())? else {
1190 return Ok(None)
1191 };
1192
1193 let body = self
1194 .storage
1195 .reader()
1196 .read_block_bodies(self, vec![(&header, transactions)])?
1197 .pop()
1198 .ok_or(ProviderError::InvalidStorageOutput)?;
1199
1200 return Ok(Some(Self::Block::new(header, body)))
1201 }
1202 }
1203
1204 Ok(None)
1205 }
1206 fn pending_block(&self) -> ProviderResult<Option<RecoveredBlock<Self::Block>>> {
1207 Ok(None)
1208 }
1209
1210 fn pending_block_and_receipts(
1211 &self,
1212 ) -> ProviderResult<Option<(RecoveredBlock<Self::Block>, Vec<Self::Receipt>)>> {
1213 Ok(None)
1214 }
1215
1216 fn recovered_block(
1225 &self,
1226 id: BlockHashOrNumber,
1227 transaction_kind: TransactionVariant,
1228 ) -> ProviderResult<Option<RecoveredBlock<Self::Block>>> {
1229 self.recovered_block(
1230 id,
1231 transaction_kind,
1232 |block_number| self.header_by_number(block_number),
1233 |header, body, senders| {
1234 Self::Block::new(header, body)
1235 .try_into_recovered_unchecked(senders)
1239 .map(Some)
1240 .map_err(|_| ProviderError::SenderRecoveryError)
1241 },
1242 )
1243 }
1244
1245 fn sealed_block_with_senders(
1246 &self,
1247 id: BlockHashOrNumber,
1248 transaction_kind: TransactionVariant,
1249 ) -> ProviderResult<Option<RecoveredBlock<Self::Block>>> {
1250 self.recovered_block(
1251 id,
1252 transaction_kind,
1253 |block_number| self.sealed_header(block_number),
1254 |header, body, senders| {
1255 Self::Block::new_sealed(header, body)
1256 .try_with_senders_unchecked(senders)
1260 .map(Some)
1261 .map_err(|_| ProviderError::SenderRecoveryError)
1262 },
1263 )
1264 }
1265
1266 fn block_range(&self, range: RangeInclusive<BlockNumber>) -> ProviderResult<Vec<Self::Block>> {
1267 self.block_range(
1268 range,
1269 |range| self.headers_range(range),
1270 |header, body, _| Ok(Self::Block::new(header, body)),
1271 )
1272 }
1273
1274 fn block_with_senders_range(
1275 &self,
1276 range: RangeInclusive<BlockNumber>,
1277 ) -> ProviderResult<Vec<RecoveredBlock<Self::Block>>> {
1278 self.block_with_senders_range(
1279 range,
1280 |range| self.headers_range(range),
1281 |header, body, senders| {
1282 Self::Block::new(header, body)
1283 .try_into_recovered_unchecked(senders)
1284 .map_err(|_| ProviderError::SenderRecoveryError)
1285 },
1286 )
1287 }
1288
1289 fn recovered_block_range(
1290 &self,
1291 range: RangeInclusive<BlockNumber>,
1292 ) -> ProviderResult<Vec<RecoveredBlock<Self::Block>>> {
1293 self.block_with_senders_range(
1294 range,
1295 |range| self.sealed_headers_range(range),
1296 |header, body, senders| {
1297 Self::Block::new_sealed(header, body)
1298 .try_with_senders(senders)
1299 .map_err(|_| ProviderError::SenderRecoveryError)
1300 },
1301 )
1302 }
1303}
1304
1305impl<TX: DbTx + 'static, N: NodeTypesForProvider> TransactionsProviderExt
1306 for DatabaseProvider<TX, N>
1307{
1308 fn transaction_hashes_by_range(
1311 &self,
1312 tx_range: Range<TxNumber>,
1313 ) -> ProviderResult<Vec<(TxHash, TxNumber)>> {
1314 self.static_file_provider.get_range_with_static_file_or_database(
1315 StaticFileSegment::Transactions,
1316 tx_range,
1317 |static_file, range, _| static_file.transaction_hashes_by_range(range),
1318 |tx_range, _| {
1319 let mut tx_cursor = self.tx.cursor_read::<tables::Transactions<TxTy<N>>>()?;
1320 let tx_range_size = tx_range.clone().count();
1321 let tx_walker = tx_cursor.walk_range(tx_range)?;
1322
1323 let chunk_size = (tx_range_size / rayon::current_num_threads()).max(1);
1324 let mut channels = Vec::with_capacity(chunk_size);
1325 let mut transaction_count = 0;
1326
1327 #[inline]
1328 fn calculate_hash<T>(
1329 entry: Result<(TxNumber, T), DatabaseError>,
1330 rlp_buf: &mut Vec<u8>,
1331 ) -> Result<(B256, TxNumber), Box<ProviderError>>
1332 where
1333 T: Encodable2718,
1334 {
1335 let (tx_id, tx) = entry.map_err(|e| Box::new(e.into()))?;
1336 tx.encode_2718(rlp_buf);
1337 Ok((keccak256(rlp_buf), tx_id))
1338 }
1339
1340 for chunk in &tx_walker.chunks(chunk_size) {
1341 let (tx, rx) = mpsc::channel();
1342 channels.push(rx);
1343
1344 let chunk: Vec<_> = chunk.collect();
1347 transaction_count += chunk.len();
1348
1349 rayon::spawn(move || {
1353 let mut rlp_buf = Vec::with_capacity(128);
1354 for entry in chunk {
1355 rlp_buf.clear();
1356 let _ = tx.send(calculate_hash(entry, &mut rlp_buf));
1357 }
1358 });
1359 }
1360 let mut tx_list = Vec::with_capacity(transaction_count);
1361
1362 for channel in channels {
1364 while let Ok(tx) = channel.recv() {
1365 let (tx_hash, tx_id) = tx.map_err(|boxed| *boxed)?;
1366 tx_list.push((tx_hash, tx_id));
1367 }
1368 }
1369
1370 Ok(tx_list)
1371 },
1372 |_| true,
1373 )
1374 }
1375}
1376
1377impl<TX: DbTx + 'static, N: NodeTypesForProvider> TransactionsProvider for DatabaseProvider<TX, N> {
1379 type Transaction = TxTy<N>;
1380
1381 fn transaction_id(&self, tx_hash: TxHash) -> ProviderResult<Option<TxNumber>> {
1382 Ok(self.tx.get::<tables::TransactionHashNumbers>(tx_hash)?)
1383 }
1384
1385 fn transaction_by_id(&self, id: TxNumber) -> ProviderResult<Option<Self::Transaction>> {
1386 self.static_file_provider.get_with_static_file_or_database(
1387 StaticFileSegment::Transactions,
1388 id,
1389 |static_file| static_file.transaction_by_id(id),
1390 || Ok(self.tx.get::<tables::Transactions<Self::Transaction>>(id)?),
1391 )
1392 }
1393
1394 fn transaction_by_id_unhashed(
1395 &self,
1396 id: TxNumber,
1397 ) -> ProviderResult<Option<Self::Transaction>> {
1398 self.static_file_provider.get_with_static_file_or_database(
1399 StaticFileSegment::Transactions,
1400 id,
1401 |static_file| static_file.transaction_by_id_unhashed(id),
1402 || Ok(self.tx.get::<tables::Transactions<Self::Transaction>>(id)?),
1403 )
1404 }
1405
1406 fn transaction_by_hash(&self, hash: TxHash) -> ProviderResult<Option<Self::Transaction>> {
1407 if let Some(id) = self.transaction_id(hash)? {
1408 Ok(self.transaction_by_id_unhashed(id)?)
1409 } else {
1410 Ok(None)
1411 }
1412 }
1413
1414 fn transaction_by_hash_with_meta(
1415 &self,
1416 tx_hash: TxHash,
1417 ) -> ProviderResult<Option<(Self::Transaction, TransactionMeta)>> {
1418 let mut transaction_cursor = self.tx.cursor_read::<tables::TransactionBlocks>()?;
1419 if let Some(transaction_id) = self.transaction_id(tx_hash)? {
1420 if let Some(transaction) = self.transaction_by_id_unhashed(transaction_id)? {
1421 if let Some(block_number) =
1422 transaction_cursor.seek(transaction_id).map(|b| b.map(|(_, bn)| bn))?
1423 {
1424 if let Some(sealed_header) = self.sealed_header(block_number)? {
1425 let (header, block_hash) = sealed_header.split();
1426 if let Some(block_body) = self.block_body_indices(block_number)? {
1427 let index = transaction_id - block_body.first_tx_num();
1432
1433 let meta = TransactionMeta {
1434 tx_hash,
1435 index,
1436 block_hash,
1437 block_number,
1438 base_fee: header.base_fee_per_gas(),
1439 excess_blob_gas: header.excess_blob_gas(),
1440 timestamp: header.timestamp(),
1441 };
1442
1443 return Ok(Some((transaction, meta)))
1444 }
1445 }
1446 }
1447 }
1448 }
1449
1450 Ok(None)
1451 }
1452
1453 fn transaction_block(&self, id: TxNumber) -> ProviderResult<Option<BlockNumber>> {
1454 let mut cursor = self.tx.cursor_read::<tables::TransactionBlocks>()?;
1455 Ok(cursor.seek(id)?.map(|(_, bn)| bn))
1456 }
1457
1458 fn transactions_by_block(
1459 &self,
1460 id: BlockHashOrNumber,
1461 ) -> ProviderResult<Option<Vec<Self::Transaction>>> {
1462 let mut tx_cursor = self.tx.cursor_read::<tables::Transactions<Self::Transaction>>()?;
1463
1464 if let Some(block_number) = self.convert_hash_or_number(id)? {
1465 if let Some(body) = self.block_body_indices(block_number)? {
1466 let tx_range = body.tx_num_range();
1467 return if tx_range.is_empty() {
1468 Ok(Some(Vec::new()))
1469 } else {
1470 Ok(Some(self.transactions_by_tx_range_with_cursor(tx_range, &mut tx_cursor)?))
1471 }
1472 }
1473 }
1474 Ok(None)
1475 }
1476
1477 fn transactions_by_block_range(
1478 &self,
1479 range: impl RangeBounds<BlockNumber>,
1480 ) -> ProviderResult<Vec<Vec<Self::Transaction>>> {
1481 let range = to_range(range);
1482 let mut tx_cursor = self.tx.cursor_read::<tables::Transactions<Self::Transaction>>()?;
1483
1484 self.block_body_indices_range(range.start..=range.end.saturating_sub(1))?
1485 .into_iter()
1486 .map(|body| {
1487 let tx_num_range = body.tx_num_range();
1488 if tx_num_range.is_empty() {
1489 Ok(Vec::new())
1490 } else {
1491 Ok(self
1492 .transactions_by_tx_range_with_cursor(tx_num_range, &mut tx_cursor)?
1493 .into_iter()
1494 .collect())
1495 }
1496 })
1497 .collect()
1498 }
1499
1500 fn transactions_by_tx_range(
1501 &self,
1502 range: impl RangeBounds<TxNumber>,
1503 ) -> ProviderResult<Vec<Self::Transaction>> {
1504 self.transactions_by_tx_range_with_cursor(
1505 range,
1506 &mut self.tx.cursor_read::<tables::Transactions<_>>()?,
1507 )
1508 }
1509
1510 fn senders_by_tx_range(
1511 &self,
1512 range: impl RangeBounds<TxNumber>,
1513 ) -> ProviderResult<Vec<Address>> {
1514 self.cursor_read_collect::<tables::TransactionSenders>(range)
1515 }
1516
1517 fn transaction_sender(&self, id: TxNumber) -> ProviderResult<Option<Address>> {
1518 Ok(self.tx.get::<tables::TransactionSenders>(id)?)
1519 }
1520}
1521
1522impl<TX: DbTx + 'static, N: NodeTypesForProvider> ReceiptProvider for DatabaseProvider<TX, N> {
1523 type Receipt = ReceiptTy<N>;
1524
1525 fn receipt(&self, id: TxNumber) -> ProviderResult<Option<Self::Receipt>> {
1526 self.static_file_provider.get_with_static_file_or_database(
1527 StaticFileSegment::Receipts,
1528 id,
1529 |static_file| static_file.receipt(id),
1530 || Ok(self.tx.get::<tables::Receipts<Self::Receipt>>(id)?),
1531 )
1532 }
1533
1534 fn receipt_by_hash(&self, hash: TxHash) -> ProviderResult<Option<Self::Receipt>> {
1535 if let Some(id) = self.transaction_id(hash)? {
1536 self.receipt(id)
1537 } else {
1538 Ok(None)
1539 }
1540 }
1541
1542 fn receipts_by_block(
1543 &self,
1544 block: BlockHashOrNumber,
1545 ) -> ProviderResult<Option<Vec<Self::Receipt>>> {
1546 if let Some(number) = self.convert_hash_or_number(block)? {
1547 if let Some(body) = self.block_body_indices(number)? {
1548 let tx_range = body.tx_num_range();
1549 return if tx_range.is_empty() {
1550 Ok(Some(Vec::new()))
1551 } else {
1552 self.receipts_by_tx_range(tx_range).map(Some)
1553 }
1554 }
1555 }
1556 Ok(None)
1557 }
1558
1559 fn receipts_by_tx_range(
1560 &self,
1561 range: impl RangeBounds<TxNumber>,
1562 ) -> ProviderResult<Vec<Self::Receipt>> {
1563 self.static_file_provider.get_range_with_static_file_or_database(
1564 StaticFileSegment::Receipts,
1565 to_range(range),
1566 |static_file, range, _| static_file.receipts_by_tx_range(range),
1567 |range, _| self.cursor_read_collect::<tables::Receipts<Self::Receipt>>(range),
1568 |_| true,
1569 )
1570 }
1571
1572 fn receipts_by_block_range(
1573 &self,
1574 block_range: RangeInclusive<BlockNumber>,
1575 ) -> ProviderResult<Vec<Vec<Self::Receipt>>> {
1576 if block_range.is_empty() {
1577 return Ok(Vec::new());
1578 }
1579
1580 let mut block_body_indices = Vec::new();
1582 for block_num in block_range {
1583 if let Some(indices) = self.block_body_indices(block_num)? {
1584 block_body_indices.push(indices);
1585 } else {
1586 block_body_indices.push(StoredBlockBodyIndices::default());
1588 }
1589 }
1590
1591 if block_body_indices.is_empty() {
1592 return Ok(Vec::new());
1593 }
1594
1595 let non_empty_blocks: Vec<_> =
1597 block_body_indices.iter().filter(|indices| indices.tx_count > 0).collect();
1598
1599 if non_empty_blocks.is_empty() {
1600 return Ok(vec![Vec::new(); block_body_indices.len()]);
1602 }
1603
1604 let first_tx = non_empty_blocks[0].first_tx_num();
1606 let last_tx = non_empty_blocks[non_empty_blocks.len() - 1].last_tx_num();
1607
1608 let all_receipts = self.receipts_by_tx_range(first_tx..=last_tx)?;
1610 let mut receipts_iter = all_receipts.into_iter();
1611
1612 let mut result = Vec::with_capacity(block_body_indices.len());
1614 for indices in &block_body_indices {
1615 if indices.tx_count == 0 {
1616 result.push(Vec::new());
1617 } else {
1618 let block_receipts =
1619 receipts_iter.by_ref().take(indices.tx_count as usize).collect();
1620 result.push(block_receipts);
1621 }
1622 }
1623
1624 Ok(result)
1625 }
1626}
1627
1628impl<TX: DbTx + 'static, N: NodeTypesForProvider> BlockBodyIndicesProvider
1629 for DatabaseProvider<TX, N>
1630{
1631 fn block_body_indices(&self, num: u64) -> ProviderResult<Option<StoredBlockBodyIndices>> {
1632 Ok(self.tx.get::<tables::BlockBodyIndices>(num)?)
1633 }
1634
1635 fn block_body_indices_range(
1636 &self,
1637 range: RangeInclusive<BlockNumber>,
1638 ) -> ProviderResult<Vec<StoredBlockBodyIndices>> {
1639 self.cursor_read_collect::<tables::BlockBodyIndices>(range)
1640 }
1641}
1642
1643impl<TX: DbTx, N: NodeTypes> StageCheckpointReader for DatabaseProvider<TX, N> {
1644 fn get_stage_checkpoint(&self, id: StageId) -> ProviderResult<Option<StageCheckpoint>> {
1645 Ok(if let Some(encoded) = id.get_pre_encoded() {
1646 self.tx.get_by_encoded_key::<tables::StageCheckpoints>(encoded)?
1647 } else {
1648 self.tx.get::<tables::StageCheckpoints>(id.to_string())?
1649 })
1650 }
1651
1652 fn get_stage_checkpoint_progress(&self, id: StageId) -> ProviderResult<Option<Vec<u8>>> {
1654 Ok(self.tx.get::<tables::StageCheckpointProgresses>(id.to_string())?)
1655 }
1656
1657 fn get_all_checkpoints(&self) -> ProviderResult<Vec<(String, StageCheckpoint)>> {
1658 self.tx
1659 .cursor_read::<tables::StageCheckpoints>()?
1660 .walk(None)?
1661 .collect::<Result<Vec<(String, StageCheckpoint)>, _>>()
1662 .map_err(ProviderError::Database)
1663 }
1664}
1665
1666impl<TX: DbTxMut, N: NodeTypes> StageCheckpointWriter for DatabaseProvider<TX, N> {
1667 fn save_stage_checkpoint(
1669 &self,
1670 id: StageId,
1671 checkpoint: StageCheckpoint,
1672 ) -> ProviderResult<()> {
1673 Ok(self.tx.put::<tables::StageCheckpoints>(id.to_string(), checkpoint)?)
1674 }
1675
1676 fn save_stage_checkpoint_progress(
1678 &self,
1679 id: StageId,
1680 checkpoint: Vec<u8>,
1681 ) -> ProviderResult<()> {
1682 Ok(self.tx.put::<tables::StageCheckpointProgresses>(id.to_string(), checkpoint)?)
1683 }
1684
1685 fn update_pipeline_stages(
1686 &self,
1687 block_number: BlockNumber,
1688 drop_stage_checkpoint: bool,
1689 ) -> ProviderResult<()> {
1690 let mut cursor = self.tx.cursor_write::<tables::StageCheckpoints>()?;
1692 for stage_id in StageId::ALL {
1693 let (_, checkpoint) = cursor.seek_exact(stage_id.to_string())?.unwrap_or_default();
1694 cursor.upsert(
1695 stage_id.to_string(),
1696 &StageCheckpoint {
1697 block_number,
1698 ..if drop_stage_checkpoint { Default::default() } else { checkpoint }
1699 },
1700 )?;
1701 }
1702
1703 Ok(())
1704 }
1705}
1706
1707impl<TX: DbTx + 'static, N: NodeTypes> StorageReader for DatabaseProvider<TX, N> {
1708 fn plain_state_storages(
1709 &self,
1710 addresses_with_keys: impl IntoIterator<Item = (Address, impl IntoIterator<Item = B256>)>,
1711 ) -> ProviderResult<Vec<(Address, Vec<StorageEntry>)>> {
1712 let mut plain_storage = self.tx.cursor_dup_read::<tables::PlainStorageState>()?;
1713
1714 addresses_with_keys
1715 .into_iter()
1716 .map(|(address, storage)| {
1717 storage
1718 .into_iter()
1719 .map(|key| -> ProviderResult<_> {
1720 Ok(plain_storage
1721 .seek_by_key_subkey(address, key)?
1722 .filter(|v| v.key == key)
1723 .unwrap_or_else(|| StorageEntry { key, value: Default::default() }))
1724 })
1725 .collect::<ProviderResult<Vec<_>>>()
1726 .map(|storage| (address, storage))
1727 })
1728 .collect::<ProviderResult<Vec<(_, _)>>>()
1729 }
1730
1731 fn changed_storages_with_range(
1732 &self,
1733 range: RangeInclusive<BlockNumber>,
1734 ) -> ProviderResult<BTreeMap<Address, BTreeSet<B256>>> {
1735 self.tx
1736 .cursor_read::<tables::StorageChangeSets>()?
1737 .walk_range(BlockNumberAddress::range(range))?
1738 .try_fold(BTreeMap::new(), |mut accounts: BTreeMap<Address, BTreeSet<B256>>, entry| {
1741 let (BlockNumberAddress((_, address)), storage_entry) = entry?;
1742 accounts.entry(address).or_default().insert(storage_entry.key);
1743 Ok(accounts)
1744 })
1745 }
1746
1747 fn changed_storages_and_blocks_with_range(
1748 &self,
1749 range: RangeInclusive<BlockNumber>,
1750 ) -> ProviderResult<BTreeMap<(Address, B256), Vec<u64>>> {
1751 let mut changeset_cursor = self.tx.cursor_read::<tables::StorageChangeSets>()?;
1752
1753 let storage_changeset_lists =
1754 changeset_cursor.walk_range(BlockNumberAddress::range(range))?.try_fold(
1755 BTreeMap::new(),
1756 |mut storages: BTreeMap<(Address, B256), Vec<u64>>, entry| -> ProviderResult<_> {
1757 let (index, storage) = entry?;
1758 storages
1759 .entry((index.address(), storage.key))
1760 .or_default()
1761 .push(index.block_number());
1762 Ok(storages)
1763 },
1764 )?;
1765
1766 Ok(storage_changeset_lists)
1767 }
1768}
1769
1770impl<TX: DbTxMut + DbTx + 'static, N: NodeTypesForProvider> StateWriter
1771 for DatabaseProvider<TX, N>
1772{
1773 type Receipt = ReceiptTy<N>;
1774
1775 fn write_state(
1776 &self,
1777 execution_outcome: &ExecutionOutcome<Self::Receipt>,
1778 is_value_known: OriginalValuesKnown,
1779 write_receipts_to: StorageLocation,
1780 ) -> ProviderResult<()> {
1781 let first_block = execution_outcome.first_block();
1782 let block_count = execution_outcome.len() as u64;
1783 let last_block = execution_outcome.last_block();
1784 let block_range = first_block..=last_block;
1785
1786 let tip = self.last_block_number()?.max(last_block);
1787
1788 let (plain_state, reverts) =
1789 execution_outcome.bundle.to_plain_state_and_reverts(is_value_known);
1790
1791 self.write_state_reverts(reverts, first_block)?;
1792 self.write_state_changes(plain_state)?;
1793
1794 let block_indices: Vec<_> = self
1796 .block_body_indices_range(block_range)?
1797 .into_iter()
1798 .map(|b| b.first_tx_num)
1799 .collect();
1800
1801 if block_indices.len() < block_count as usize {
1803 let missing_blocks = block_count - block_indices.len() as u64;
1804 return Err(ProviderError::BlockBodyIndicesNotFound(
1805 last_block.saturating_sub(missing_blocks - 1),
1806 ));
1807 }
1808
1809 let has_receipts_pruning = self.prune_modes.has_receipts_pruning();
1810
1811 let mut receipts_cursor = (write_receipts_to.database() || has_receipts_pruning)
1816 .then(|| self.tx.cursor_write::<tables::Receipts<Self::Receipt>>())
1817 .transpose()?;
1818
1819 let mut receipts_static_writer = (write_receipts_to.static_files() &&
1823 !has_receipts_pruning)
1824 .then(|| self.static_file_provider.get_writer(first_block, StaticFileSegment::Receipts))
1825 .transpose()?;
1826
1827 let has_contract_log_filter = !self.prune_modes.receipts_log_filter.is_empty();
1828 let contract_log_pruner = self.prune_modes.receipts_log_filter.group_by_block(tip, None)?;
1829
1830 let prunable_receipts =
1833 PruneMode::Distance(MINIMUM_PRUNING_DISTANCE).should_prune(first_block, tip);
1834
1835 let mut allowed_addresses: HashSet<Address, _> = HashSet::new();
1837 for (_, addresses) in contract_log_pruner.range(..first_block) {
1838 allowed_addresses.extend(addresses.iter().copied());
1839 }
1840
1841 for (idx, (receipts, first_tx_index)) in
1842 execution_outcome.receipts.iter().zip(block_indices).enumerate()
1843 {
1844 let block_number = first_block + idx as u64;
1845
1846 if let Some(writer) = receipts_static_writer.as_mut() {
1848 writer.increment_block(block_number)?;
1849 }
1850
1851 if prunable_receipts &&
1853 self.prune_modes
1854 .receipts
1855 .is_some_and(|mode| mode.should_prune(block_number, tip))
1856 {
1857 continue
1858 }
1859
1860 if let Some(new_addresses) = contract_log_pruner.get(&block_number) {
1862 allowed_addresses.extend(new_addresses.iter().copied());
1863 }
1864
1865 for (idx, receipt) in receipts.iter().enumerate() {
1866 let receipt_idx = first_tx_index + idx as u64;
1867 if prunable_receipts &&
1870 has_contract_log_filter &&
1871 !receipt.logs().iter().any(|log| allowed_addresses.contains(&log.address))
1872 {
1873 continue
1874 }
1875
1876 if let Some(writer) = &mut receipts_static_writer {
1877 writer.append_receipt(receipt_idx, receipt)?;
1878 }
1879
1880 if let Some(cursor) = &mut receipts_cursor {
1881 cursor.append(receipt_idx, receipt)?;
1882 }
1883 }
1884 }
1885
1886 Ok(())
1887 }
1888
1889 fn write_state_reverts(
1890 &self,
1891 reverts: PlainStateReverts,
1892 first_block: BlockNumber,
1893 ) -> ProviderResult<()> {
1894 tracing::trace!("Writing storage changes");
1896 let mut storages_cursor = self.tx_ref().cursor_dup_write::<tables::PlainStorageState>()?;
1897 let mut storage_changeset_cursor =
1898 self.tx_ref().cursor_dup_write::<tables::StorageChangeSets>()?;
1899 for (block_index, mut storage_changes) in reverts.storage.into_iter().enumerate() {
1900 let block_number = first_block + block_index as BlockNumber;
1901
1902 tracing::trace!(block_number, "Writing block change");
1903 storage_changes.par_sort_unstable_by_key(|a| a.address);
1905 for PlainStorageRevert { address, wiped, storage_revert } in storage_changes {
1906 let storage_id = BlockNumberAddress((block_number, address));
1907
1908 let mut storage = storage_revert
1909 .into_iter()
1910 .map(|(k, v)| (B256::new(k.to_be_bytes()), v))
1911 .collect::<Vec<_>>();
1912 storage.par_sort_unstable_by_key(|a| a.0);
1914
1915 let mut wiped_storage = Vec::new();
1919 if wiped {
1920 tracing::trace!(?address, "Wiping storage");
1921 if let Some((_, entry)) = storages_cursor.seek_exact(address)? {
1922 wiped_storage.push((entry.key, entry.value));
1923 while let Some(entry) = storages_cursor.next_dup_val()? {
1924 wiped_storage.push((entry.key, entry.value))
1925 }
1926 }
1927 }
1928
1929 tracing::trace!(?address, ?storage, "Writing storage reverts");
1930 for (key, value) in StorageRevertsIter::new(storage, wiped_storage) {
1931 storage_changeset_cursor.append_dup(storage_id, StorageEntry { key, value })?;
1932 }
1933 }
1934 }
1935
1936 tracing::trace!("Writing account changes");
1938 let mut account_changeset_cursor =
1939 self.tx_ref().cursor_dup_write::<tables::AccountChangeSets>()?;
1940
1941 for (block_index, mut account_block_reverts) in reverts.accounts.into_iter().enumerate() {
1942 let block_number = first_block + block_index as BlockNumber;
1943 account_block_reverts.par_sort_by_key(|a| a.0);
1945
1946 for (address, info) in account_block_reverts {
1947 account_changeset_cursor.append_dup(
1948 block_number,
1949 AccountBeforeTx { address, info: info.map(Into::into) },
1950 )?;
1951 }
1952 }
1953
1954 Ok(())
1955 }
1956
1957 fn write_state_changes(&self, mut changes: StateChangeset) -> ProviderResult<()> {
1958 changes.accounts.par_sort_by_key(|a| a.0);
1961 changes.storage.par_sort_by_key(|a| a.address);
1962 changes.contracts.par_sort_by_key(|a| a.0);
1963
1964 tracing::trace!(len = changes.accounts.len(), "Writing new account state");
1966 let mut accounts_cursor = self.tx_ref().cursor_write::<tables::PlainAccountState>()?;
1967 for (address, account) in changes.accounts {
1969 if let Some(account) = account {
1970 tracing::trace!(?address, "Updating plain state account");
1971 accounts_cursor.upsert(address, &account.into())?;
1972 } else if accounts_cursor.seek_exact(address)?.is_some() {
1973 tracing::trace!(?address, "Deleting plain state account");
1974 accounts_cursor.delete_current()?;
1975 }
1976 }
1977
1978 tracing::trace!(len = changes.contracts.len(), "Writing bytecodes");
1980 let mut bytecodes_cursor = self.tx_ref().cursor_write::<tables::Bytecodes>()?;
1981 for (hash, bytecode) in changes.contracts {
1982 bytecodes_cursor.upsert(hash, &Bytecode(bytecode))?;
1983 }
1984
1985 tracing::trace!(len = changes.storage.len(), "Writing new storage state");
1987 let mut storages_cursor = self.tx_ref().cursor_dup_write::<tables::PlainStorageState>()?;
1988 for PlainStorageChangeset { address, wipe_storage, storage } in changes.storage {
1989 if wipe_storage && storages_cursor.seek_exact(address)?.is_some() {
1991 storages_cursor.delete_current_duplicates()?;
1992 }
1993 let mut storage = storage
1995 .into_iter()
1996 .map(|(k, value)| StorageEntry { key: k.into(), value })
1997 .collect::<Vec<_>>();
1998 storage.par_sort_unstable_by_key(|a| a.key);
2000
2001 for entry in storage {
2002 tracing::trace!(?address, ?entry.key, "Updating plain state storage");
2003 if let Some(db_entry) = storages_cursor.seek_by_key_subkey(address, entry.key)? {
2004 if db_entry.key == entry.key {
2005 storages_cursor.delete_current()?;
2006 }
2007 }
2008
2009 if !entry.value.is_zero() {
2010 storages_cursor.upsert(address, &entry)?;
2011 }
2012 }
2013 }
2014
2015 Ok(())
2016 }
2017
2018 fn write_hashed_state(&self, hashed_state: &HashedPostStateSorted) -> ProviderResult<()> {
2019 let mut hashed_accounts_cursor = self.tx_ref().cursor_write::<tables::HashedAccounts>()?;
2021 for (hashed_address, account) in hashed_state.accounts().accounts_sorted() {
2022 if let Some(account) = account {
2023 hashed_accounts_cursor.upsert(hashed_address, &account)?;
2024 } else if hashed_accounts_cursor.seek_exact(hashed_address)?.is_some() {
2025 hashed_accounts_cursor.delete_current()?;
2026 }
2027 }
2028
2029 let sorted_storages = hashed_state.account_storages().iter().sorted_by_key(|(key, _)| *key);
2031 let mut hashed_storage_cursor =
2032 self.tx_ref().cursor_dup_write::<tables::HashedStorages>()?;
2033 for (hashed_address, storage) in sorted_storages {
2034 if storage.is_wiped() && hashed_storage_cursor.seek_exact(*hashed_address)?.is_some() {
2035 hashed_storage_cursor.delete_current_duplicates()?;
2036 }
2037
2038 for (hashed_slot, value) in storage.storage_slots_sorted() {
2039 let entry = StorageEntry { key: hashed_slot, value };
2040 if let Some(db_entry) =
2041 hashed_storage_cursor.seek_by_key_subkey(*hashed_address, entry.key)?
2042 {
2043 if db_entry.key == entry.key {
2044 hashed_storage_cursor.delete_current()?;
2045 }
2046 }
2047
2048 if !entry.value.is_zero() {
2049 hashed_storage_cursor.upsert(*hashed_address, &entry)?;
2050 }
2051 }
2052 }
2053
2054 Ok(())
2055 }
2056
2057 fn remove_state_above(
2079 &self,
2080 block: BlockNumber,
2081 remove_receipts_from: StorageLocation,
2082 ) -> ProviderResult<()> {
2083 let range = block + 1..=self.last_block_number()?;
2084
2085 if range.is_empty() {
2086 return Ok(());
2087 }
2088
2089 let block_bodies = self.block_body_indices_range(range.clone())?;
2091
2092 let from_transaction_num =
2094 block_bodies.first().expect("already checked if there are blocks").first_tx_num();
2095
2096 let storage_range = BlockNumberAddress::range(range.clone());
2097
2098 let storage_changeset = self.take::<tables::StorageChangeSets>(storage_range)?;
2099 let account_changeset = self.take::<tables::AccountChangeSets>(range)?;
2100
2101 let mut plain_accounts_cursor = self.tx.cursor_write::<tables::PlainAccountState>()?;
2106 let mut plain_storage_cursor = self.tx.cursor_dup_write::<tables::PlainStorageState>()?;
2107
2108 let (state, _) = self.populate_bundle_state(
2109 account_changeset,
2110 storage_changeset,
2111 &mut plain_accounts_cursor,
2112 &mut plain_storage_cursor,
2113 )?;
2114
2115 for (address, (old_account, new_account, storage)) in &state {
2117 if old_account != new_account {
2119 let existing_entry = plain_accounts_cursor.seek_exact(*address)?;
2120 if let Some(account) = old_account {
2121 plain_accounts_cursor.upsert(*address, account)?;
2122 } else if existing_entry.is_some() {
2123 plain_accounts_cursor.delete_current()?;
2124 }
2125 }
2126
2127 for (storage_key, (old_storage_value, _new_storage_value)) in storage {
2129 let storage_entry = StorageEntry { key: *storage_key, value: *old_storage_value };
2130 if plain_storage_cursor
2133 .seek_by_key_subkey(*address, *storage_key)?
2134 .filter(|s| s.key == *storage_key)
2135 .is_some()
2136 {
2137 plain_storage_cursor.delete_current()?
2138 }
2139
2140 if !old_storage_value.is_zero() {
2142 plain_storage_cursor.upsert(*address, &storage_entry)?;
2143 }
2144 }
2145 }
2146
2147 self.remove_receipts_from(from_transaction_num, block, remove_receipts_from)?;
2148
2149 Ok(())
2150 }
2151
2152 fn take_state_above(
2174 &self,
2175 block: BlockNumber,
2176 remove_receipts_from: StorageLocation,
2177 ) -> ProviderResult<ExecutionOutcome<Self::Receipt>> {
2178 let range = block + 1..=self.last_block_number()?;
2179
2180 if range.is_empty() {
2181 return Ok(ExecutionOutcome::default())
2182 }
2183 let start_block_number = *range.start();
2184
2185 let block_bodies = self.block_body_indices_range(range.clone())?;
2187
2188 let from_transaction_num =
2190 block_bodies.first().expect("already checked if there are blocks").first_tx_num();
2191 let to_transaction_num =
2192 block_bodies.last().expect("already checked if there are blocks").last_tx_num();
2193
2194 let storage_range = BlockNumberAddress::range(range.clone());
2195
2196 let storage_changeset = self.take::<tables::StorageChangeSets>(storage_range)?;
2197 let account_changeset = self.take::<tables::AccountChangeSets>(range)?;
2198
2199 let mut plain_accounts_cursor = self.tx.cursor_write::<tables::PlainAccountState>()?;
2204 let mut plain_storage_cursor = self.tx.cursor_dup_write::<tables::PlainStorageState>()?;
2205
2206 let (state, reverts) = self.populate_bundle_state(
2209 account_changeset,
2210 storage_changeset,
2211 &mut plain_accounts_cursor,
2212 &mut plain_storage_cursor,
2213 )?;
2214
2215 for (address, (old_account, new_account, storage)) in &state {
2217 if old_account != new_account {
2219 let existing_entry = plain_accounts_cursor.seek_exact(*address)?;
2220 if let Some(account) = old_account {
2221 plain_accounts_cursor.upsert(*address, account)?;
2222 } else if existing_entry.is_some() {
2223 plain_accounts_cursor.delete_current()?;
2224 }
2225 }
2226
2227 for (storage_key, (old_storage_value, _new_storage_value)) in storage {
2229 let storage_entry = StorageEntry { key: *storage_key, value: *old_storage_value };
2230 if plain_storage_cursor
2233 .seek_by_key_subkey(*address, *storage_key)?
2234 .filter(|s| s.key == *storage_key)
2235 .is_some()
2236 {
2237 plain_storage_cursor.delete_current()?
2238 }
2239
2240 if !old_storage_value.is_zero() {
2242 plain_storage_cursor.upsert(*address, &storage_entry)?;
2243 }
2244 }
2245 }
2246
2247 let mut receipts_iter = self
2249 .static_file_provider
2250 .get_range_with_static_file_or_database(
2251 StaticFileSegment::Receipts,
2252 from_transaction_num..to_transaction_num + 1,
2253 |static_file, range, _| {
2254 static_file
2255 .receipts_by_tx_range(range.clone())
2256 .map(|r| range.into_iter().zip(r).collect())
2257 },
2258 |range, _| {
2259 self.tx
2260 .cursor_read::<tables::Receipts<Self::Receipt>>()?
2261 .walk_range(range)?
2262 .map(|r| r.map_err(Into::into))
2263 .collect()
2264 },
2265 |_| true,
2266 )?
2267 .into_iter()
2268 .peekable();
2269
2270 let mut receipts = Vec::with_capacity(block_bodies.len());
2271 for block_body in block_bodies {
2273 let mut block_receipts = Vec::with_capacity(block_body.tx_count as usize);
2274 for num in block_body.tx_num_range() {
2275 if receipts_iter.peek().is_some_and(|(n, _)| *n == num) {
2276 block_receipts.push(receipts_iter.next().unwrap().1);
2277 }
2278 }
2279 receipts.push(block_receipts);
2280 }
2281
2282 self.remove_receipts_from(from_transaction_num, block, remove_receipts_from)?;
2283
2284 Ok(ExecutionOutcome::new_init(
2285 state,
2286 reverts,
2287 Vec::new(),
2288 receipts,
2289 start_block_number,
2290 Vec::new(),
2291 ))
2292 }
2293}
2294
2295impl<TX: DbTxMut + DbTx + 'static, N: NodeTypes> TrieWriter for DatabaseProvider<TX, N> {
2296 fn write_trie_updates(&self, trie_updates: &TrieUpdates) -> ProviderResult<usize> {
2298 if trie_updates.is_empty() {
2299 return Ok(0)
2300 }
2301
2302 let mut num_entries = 0;
2304
2305 let mut account_updates = trie_updates
2307 .removed_nodes_ref()
2308 .iter()
2309 .filter_map(|n| {
2310 (!trie_updates.account_nodes_ref().contains_key(n)).then_some((n, None))
2311 })
2312 .collect::<Vec<_>>();
2313 account_updates.extend(
2314 trie_updates.account_nodes_ref().iter().map(|(nibbles, node)| (nibbles, Some(node))),
2315 );
2316 account_updates.sort_unstable_by(|a, b| a.0.cmp(b.0));
2318
2319 let tx = self.tx_ref();
2320 let mut account_trie_cursor = tx.cursor_write::<tables::AccountsTrie>()?;
2321 for (key, updated_node) in account_updates {
2322 let nibbles = StoredNibbles(*key);
2323 match updated_node {
2324 Some(node) => {
2325 if !nibbles.0.is_empty() {
2326 num_entries += 1;
2327 account_trie_cursor.upsert(nibbles, node)?;
2328 }
2329 }
2330 None => {
2331 num_entries += 1;
2332 if account_trie_cursor.seek_exact(nibbles)?.is_some() {
2333 account_trie_cursor.delete_current()?;
2334 }
2335 }
2336 }
2337 }
2338
2339 num_entries += self.write_storage_trie_updates(trie_updates.storage_tries_ref().iter())?;
2340
2341 Ok(num_entries)
2342 }
2343}
2344
2345impl<TX: DbTxMut + DbTx + 'static, N: NodeTypes> StorageTrieWriter for DatabaseProvider<TX, N> {
2346 fn write_storage_trie_updates<'a>(
2349 &self,
2350 storage_tries: impl Iterator<Item = (&'a B256, &'a StorageTrieUpdates)>,
2351 ) -> ProviderResult<usize> {
2352 let mut num_entries = 0;
2353 let mut storage_tries = storage_tries.collect::<Vec<_>>();
2354 storage_tries.sort_unstable_by(|a, b| a.0.cmp(b.0));
2355 let mut cursor = self.tx_ref().cursor_dup_write::<tables::StoragesTrie>()?;
2356 for (hashed_address, storage_trie_updates) in storage_tries {
2357 let mut db_storage_trie_cursor =
2358 DatabaseStorageTrieCursor::new(cursor, *hashed_address);
2359 num_entries +=
2360 db_storage_trie_cursor.write_storage_trie_updates(storage_trie_updates)?;
2361 cursor = db_storage_trie_cursor.cursor;
2362 }
2363
2364 Ok(num_entries)
2365 }
2366}
2367
2368impl<TX: DbTxMut + DbTx + 'static, N: NodeTypes> HashingWriter for DatabaseProvider<TX, N> {
2369 fn unwind_account_hashing<'a>(
2370 &self,
2371 changesets: impl Iterator<Item = &'a (BlockNumber, AccountBeforeTx)>,
2372 ) -> ProviderResult<BTreeMap<B256, Option<Account>>> {
2373 let hashed_accounts = changesets
2377 .into_iter()
2378 .map(|(_, e)| (keccak256(e.address), e.info))
2379 .collect::<Vec<_>>()
2380 .into_iter()
2381 .rev()
2382 .collect::<BTreeMap<_, _>>();
2383
2384 let mut hashed_accounts_cursor = self.tx.cursor_write::<tables::HashedAccounts>()?;
2386 for (hashed_address, account) in &hashed_accounts {
2387 if let Some(account) = account {
2388 hashed_accounts_cursor.upsert(*hashed_address, account)?;
2389 } else if hashed_accounts_cursor.seek_exact(*hashed_address)?.is_some() {
2390 hashed_accounts_cursor.delete_current()?;
2391 }
2392 }
2393
2394 Ok(hashed_accounts)
2395 }
2396
2397 fn unwind_account_hashing_range(
2398 &self,
2399 range: impl RangeBounds<BlockNumber>,
2400 ) -> ProviderResult<BTreeMap<B256, Option<Account>>> {
2401 let changesets = self
2402 .tx
2403 .cursor_read::<tables::AccountChangeSets>()?
2404 .walk_range(range)?
2405 .collect::<Result<Vec<_>, _>>()?;
2406 self.unwind_account_hashing(changesets.iter())
2407 }
2408
2409 fn insert_account_for_hashing(
2410 &self,
2411 changesets: impl IntoIterator<Item = (Address, Option<Account>)>,
2412 ) -> ProviderResult<BTreeMap<B256, Option<Account>>> {
2413 let mut hashed_accounts_cursor = self.tx.cursor_write::<tables::HashedAccounts>()?;
2414 let hashed_accounts =
2415 changesets.into_iter().map(|(ad, ac)| (keccak256(ad), ac)).collect::<BTreeMap<_, _>>();
2416 for (hashed_address, account) in &hashed_accounts {
2417 if let Some(account) = account {
2418 hashed_accounts_cursor.upsert(*hashed_address, account)?;
2419 } else if hashed_accounts_cursor.seek_exact(*hashed_address)?.is_some() {
2420 hashed_accounts_cursor.delete_current()?;
2421 }
2422 }
2423 Ok(hashed_accounts)
2424 }
2425
2426 fn unwind_storage_hashing(
2427 &self,
2428 changesets: impl Iterator<Item = (BlockNumberAddress, StorageEntry)>,
2429 ) -> ProviderResult<HashMap<B256, BTreeSet<B256>>> {
2430 let mut hashed_storages = changesets
2432 .into_iter()
2433 .map(|(BlockNumberAddress((_, address)), storage_entry)| {
2434 (keccak256(address), keccak256(storage_entry.key), storage_entry.value)
2435 })
2436 .collect::<Vec<_>>();
2437 hashed_storages.sort_by_key(|(ha, hk, _)| (*ha, *hk));
2438
2439 let mut hashed_storage_keys: HashMap<B256, BTreeSet<B256>> =
2441 HashMap::with_capacity_and_hasher(hashed_storages.len(), Default::default());
2442 let mut hashed_storage = self.tx.cursor_dup_write::<tables::HashedStorages>()?;
2443 for (hashed_address, key, value) in hashed_storages.into_iter().rev() {
2444 hashed_storage_keys.entry(hashed_address).or_default().insert(key);
2445
2446 if hashed_storage
2447 .seek_by_key_subkey(hashed_address, key)?
2448 .filter(|entry| entry.key == key)
2449 .is_some()
2450 {
2451 hashed_storage.delete_current()?;
2452 }
2453
2454 if !value.is_zero() {
2455 hashed_storage.upsert(hashed_address, &StorageEntry { key, value })?;
2456 }
2457 }
2458 Ok(hashed_storage_keys)
2459 }
2460
2461 fn unwind_storage_hashing_range(
2462 &self,
2463 range: impl RangeBounds<BlockNumberAddress>,
2464 ) -> ProviderResult<HashMap<B256, BTreeSet<B256>>> {
2465 let changesets = self
2466 .tx
2467 .cursor_read::<tables::StorageChangeSets>()?
2468 .walk_range(range)?
2469 .collect::<Result<Vec<_>, _>>()?;
2470 self.unwind_storage_hashing(changesets.into_iter())
2471 }
2472
2473 fn insert_storage_for_hashing(
2474 &self,
2475 storages: impl IntoIterator<Item = (Address, impl IntoIterator<Item = StorageEntry>)>,
2476 ) -> ProviderResult<HashMap<B256, BTreeSet<B256>>> {
2477 let hashed_storages =
2479 storages.into_iter().fold(BTreeMap::new(), |mut map, (address, storage)| {
2480 let storage = storage.into_iter().fold(BTreeMap::new(), |mut map, entry| {
2481 map.insert(keccak256(entry.key), entry.value);
2482 map
2483 });
2484 map.insert(keccak256(address), storage);
2485 map
2486 });
2487
2488 let hashed_storage_keys = hashed_storages
2489 .iter()
2490 .map(|(hashed_address, entries)| (*hashed_address, entries.keys().copied().collect()))
2491 .collect();
2492
2493 let mut hashed_storage_cursor = self.tx.cursor_dup_write::<tables::HashedStorages>()?;
2494 hashed_storages.into_iter().try_for_each(|(hashed_address, storage)| {
2497 storage.into_iter().try_for_each(|(key, value)| -> ProviderResult<()> {
2498 if hashed_storage_cursor
2499 .seek_by_key_subkey(hashed_address, key)?
2500 .filter(|entry| entry.key == key)
2501 .is_some()
2502 {
2503 hashed_storage_cursor.delete_current()?;
2504 }
2505
2506 if !value.is_zero() {
2507 hashed_storage_cursor.upsert(hashed_address, &StorageEntry { key, value })?;
2508 }
2509 Ok(())
2510 })
2511 })?;
2512
2513 Ok(hashed_storage_keys)
2514 }
2515}
2516
2517impl<TX: DbTxMut + DbTx + 'static, N: NodeTypes> HistoryWriter for DatabaseProvider<TX, N> {
2518 fn unwind_account_history_indices<'a>(
2519 &self,
2520 changesets: impl Iterator<Item = &'a (BlockNumber, AccountBeforeTx)>,
2521 ) -> ProviderResult<usize> {
2522 let mut last_indices = changesets
2523 .into_iter()
2524 .map(|(index, account)| (account.address, *index))
2525 .collect::<Vec<_>>();
2526 last_indices.sort_by_key(|(a, _)| *a);
2527
2528 let mut cursor = self.tx.cursor_write::<tables::AccountsHistory>()?;
2530 for &(address, rem_index) in &last_indices {
2531 let partial_shard = unwind_history_shards::<_, tables::AccountsHistory, _>(
2532 &mut cursor,
2533 ShardedKey::last(address),
2534 rem_index,
2535 |sharded_key| sharded_key.key == address,
2536 )?;
2537
2538 if !partial_shard.is_empty() {
2541 cursor.insert(
2542 ShardedKey::last(address),
2543 &BlockNumberList::new_pre_sorted(partial_shard),
2544 )?;
2545 }
2546 }
2547
2548 let changesets = last_indices.len();
2549 Ok(changesets)
2550 }
2551
2552 fn unwind_account_history_indices_range(
2553 &self,
2554 range: impl RangeBounds<BlockNumber>,
2555 ) -> ProviderResult<usize> {
2556 let changesets = self
2557 .tx
2558 .cursor_read::<tables::AccountChangeSets>()?
2559 .walk_range(range)?
2560 .collect::<Result<Vec<_>, _>>()?;
2561 self.unwind_account_history_indices(changesets.iter())
2562 }
2563
2564 fn insert_account_history_index(
2565 &self,
2566 account_transitions: impl IntoIterator<Item = (Address, impl IntoIterator<Item = u64>)>,
2567 ) -> ProviderResult<()> {
2568 self.append_history_index::<_, tables::AccountsHistory>(
2569 account_transitions,
2570 ShardedKey::new,
2571 )
2572 }
2573
2574 fn unwind_storage_history_indices(
2575 &self,
2576 changesets: impl Iterator<Item = (BlockNumberAddress, StorageEntry)>,
2577 ) -> ProviderResult<usize> {
2578 let mut storage_changesets = changesets
2579 .into_iter()
2580 .map(|(BlockNumberAddress((bn, address)), storage)| (address, storage.key, bn))
2581 .collect::<Vec<_>>();
2582 storage_changesets.sort_by_key(|(address, key, _)| (*address, *key));
2583
2584 let mut cursor = self.tx.cursor_write::<tables::StoragesHistory>()?;
2585 for &(address, storage_key, rem_index) in &storage_changesets {
2586 let partial_shard = unwind_history_shards::<_, tables::StoragesHistory, _>(
2587 &mut cursor,
2588 StorageShardedKey::last(address, storage_key),
2589 rem_index,
2590 |storage_sharded_key| {
2591 storage_sharded_key.address == address &&
2592 storage_sharded_key.sharded_key.key == storage_key
2593 },
2594 )?;
2595
2596 if !partial_shard.is_empty() {
2599 cursor.insert(
2600 StorageShardedKey::last(address, storage_key),
2601 &BlockNumberList::new_pre_sorted(partial_shard),
2602 )?;
2603 }
2604 }
2605
2606 let changesets = storage_changesets.len();
2607 Ok(changesets)
2608 }
2609
2610 fn unwind_storage_history_indices_range(
2611 &self,
2612 range: impl RangeBounds<BlockNumberAddress>,
2613 ) -> ProviderResult<usize> {
2614 let changesets = self
2615 .tx
2616 .cursor_read::<tables::StorageChangeSets>()?
2617 .walk_range(range)?
2618 .collect::<Result<Vec<_>, _>>()?;
2619 self.unwind_storage_history_indices(changesets.into_iter())
2620 }
2621
2622 fn insert_storage_history_index(
2623 &self,
2624 storage_transitions: impl IntoIterator<Item = ((Address, B256), impl IntoIterator<Item = u64>)>,
2625 ) -> ProviderResult<()> {
2626 self.append_history_index::<_, tables::StoragesHistory>(
2627 storage_transitions,
2628 |(address, storage_key), highest_block_number| {
2629 StorageShardedKey::new(address, storage_key, highest_block_number)
2630 },
2631 )
2632 }
2633
2634 fn update_history_indices(&self, range: RangeInclusive<BlockNumber>) -> ProviderResult<()> {
2635 {
2637 let indices = self.changed_accounts_and_blocks_with_range(range.clone())?;
2638 self.insert_account_history_index(indices)?;
2639 }
2640
2641 {
2643 let indices = self.changed_storages_and_blocks_with_range(range)?;
2644 self.insert_storage_history_index(indices)?;
2645 }
2646
2647 Ok(())
2648 }
2649}
2650
2651impl<TX: DbTxMut + DbTx + 'static, N: NodeTypesForProvider + 'static> BlockExecutionWriter
2652 for DatabaseProvider<TX, N>
2653{
2654 fn take_block_and_execution_above(
2655 &self,
2656 block: BlockNumber,
2657 remove_from: StorageLocation,
2658 ) -> ProviderResult<Chain<Self::Primitives>> {
2659 let range = block + 1..=self.last_block_number()?;
2660
2661 self.unwind_trie_state_range(range.clone())?;
2662
2663 let execution_state = self.take_state_above(block, remove_from)?;
2665
2666 let blocks = self.recovered_block_range(range)?;
2667
2668 self.remove_blocks_above(block, remove_from)?;
2671
2672 self.update_pipeline_stages(block, true)?;
2674
2675 Ok(Chain::new(blocks, execution_state, None))
2676 }
2677
2678 fn remove_block_and_execution_above(
2679 &self,
2680 block: BlockNumber,
2681 remove_from: StorageLocation,
2682 ) -> ProviderResult<()> {
2683 let range = block + 1..=self.last_block_number()?;
2684
2685 self.unwind_trie_state_range(range)?;
2686
2687 self.remove_state_above(block, remove_from)?;
2689
2690 self.remove_blocks_above(block, remove_from)?;
2693
2694 self.update_pipeline_stages(block, true)?;
2696
2697 Ok(())
2698 }
2699}
2700
2701impl<TX: DbTxMut + DbTx + 'static, N: NodeTypesForProvider + 'static> BlockWriter
2702 for DatabaseProvider<TX, N>
2703{
2704 type Block = BlockTy<N>;
2705 type Receipt = ReceiptTy<N>;
2706
2707 fn insert_block(
2728 &self,
2729 block: RecoveredBlock<Self::Block>,
2730 write_to: StorageLocation,
2731 ) -> ProviderResult<StoredBlockBodyIndices> {
2732 let block_number = block.number();
2733
2734 let mut durations_recorder = metrics::DurationsRecorder::default();
2735
2736 let ttd = if block_number == 0 {
2738 block.header().difficulty()
2739 } else {
2740 let parent_block_number = block_number - 1;
2741 let parent_ttd = self.header_td_by_number(parent_block_number)?.unwrap_or_default();
2742 durations_recorder.record_relative(metrics::Action::GetParentTD);
2743 parent_ttd + block.header().difficulty()
2744 };
2745
2746 if write_to.database() {
2747 self.tx.put::<tables::CanonicalHeaders>(block_number, block.hash())?;
2748 durations_recorder.record_relative(metrics::Action::InsertCanonicalHeaders);
2749
2750 self.tx.put::<tables::Headers<HeaderTy<N>>>(block_number, block.header().clone())?;
2752 durations_recorder.record_relative(metrics::Action::InsertHeaders);
2753
2754 self.tx.put::<tables::HeaderTerminalDifficulties>(block_number, ttd.into())?;
2755 durations_recorder.record_relative(metrics::Action::InsertHeaderTerminalDifficulties);
2756 }
2757
2758 if write_to.static_files() {
2759 let mut writer =
2760 self.static_file_provider.get_writer(block_number, StaticFileSegment::Headers)?;
2761 writer.append_header(block.header(), ttd, &block.hash())?;
2762 }
2763
2764 self.tx.put::<tables::HeaderNumbers>(block.hash(), block_number)?;
2765 durations_recorder.record_relative(metrics::Action::InsertHeaderNumbers);
2766
2767 let mut next_tx_num = self
2768 .tx
2769 .cursor_read::<tables::TransactionBlocks>()?
2770 .last()?
2771 .map(|(n, _)| n + 1)
2772 .unwrap_or_default();
2773 durations_recorder.record_relative(metrics::Action::GetNextTxNum);
2774 let first_tx_num = next_tx_num;
2775
2776 let tx_count = block.body().transaction_count() as u64;
2777
2778 for (transaction, sender) in block.body().transactions_iter().zip(block.senders_iter()) {
2780 let hash = transaction.tx_hash();
2781
2782 if self.prune_modes.sender_recovery.as_ref().is_none_or(|m| !m.is_full()) {
2783 self.tx.put::<tables::TransactionSenders>(next_tx_num, *sender)?;
2784 }
2785
2786 if self.prune_modes.transaction_lookup.is_none_or(|m| !m.is_full()) {
2787 self.tx.put::<tables::TransactionHashNumbers>(*hash, next_tx_num)?;
2788 }
2789 next_tx_num += 1;
2790 }
2791
2792 self.append_block_bodies(vec![(block_number, Some(block.into_body()))], write_to)?;
2793
2794 debug!(
2795 target: "providers::db",
2796 ?block_number,
2797 actions = ?durations_recorder.actions,
2798 "Inserted block"
2799 );
2800
2801 Ok(StoredBlockBodyIndices { first_tx_num, tx_count })
2802 }
2803
2804 fn append_block_bodies(
2805 &self,
2806 bodies: Vec<(BlockNumber, Option<BodyTy<N>>)>,
2807 write_to: StorageLocation,
2808 ) -> ProviderResult<()> {
2809 let Some(from_block) = bodies.first().map(|(block, _)| *block) else { return Ok(()) };
2810
2811 let mut tx_static_writer = write_to
2813 .static_files()
2814 .then(|| {
2815 self.static_file_provider.get_writer(from_block, StaticFileSegment::Transactions)
2816 })
2817 .transpose()?;
2818
2819 let mut block_indices_cursor = self.tx.cursor_write::<tables::BlockBodyIndices>()?;
2820 let mut tx_block_cursor = self.tx.cursor_write::<tables::TransactionBlocks>()?;
2821
2822 let mut tx_cursor = write_to
2824 .database()
2825 .then(|| self.tx.cursor_write::<tables::Transactions<TxTy<N>>>())
2826 .transpose()?;
2827
2828 let mut next_tx_num = tx_block_cursor.last()?.map(|(id, _)| id + 1).unwrap_or_default();
2830
2831 for (block_number, body) in &bodies {
2832 if let Some(writer) = tx_static_writer.as_mut() {
2834 writer.increment_block(*block_number)?;
2835 }
2836
2837 let tx_count = body.as_ref().map(|b| b.transactions().len() as u64).unwrap_or_default();
2838 let block_indices = StoredBlockBodyIndices { first_tx_num: next_tx_num, tx_count };
2839
2840 let mut durations_recorder = metrics::DurationsRecorder::default();
2841
2842 block_indices_cursor.append(*block_number, &block_indices)?;
2844
2845 durations_recorder.record_relative(metrics::Action::InsertBlockBodyIndices);
2846
2847 let Some(body) = body else { continue };
2848
2849 if !body.transactions().is_empty() {
2851 tx_block_cursor.append(block_indices.last_tx_num(), block_number)?;
2852 durations_recorder.record_relative(metrics::Action::InsertTransactionBlocks);
2853 }
2854
2855 for transaction in body.transactions() {
2857 if let Some(writer) = tx_static_writer.as_mut() {
2858 writer.append_transaction(next_tx_num, transaction)?;
2859 }
2860 if let Some(cursor) = tx_cursor.as_mut() {
2861 cursor.append(next_tx_num, transaction)?;
2862 }
2863
2864 next_tx_num += 1;
2866 }
2867 }
2868
2869 self.storage.writer().write_block_bodies(self, bodies, write_to)?;
2870
2871 Ok(())
2872 }
2873
2874 fn remove_blocks_above(
2875 &self,
2876 block: BlockNumber,
2877 remove_from: StorageLocation,
2878 ) -> ProviderResult<()> {
2879 for hash in self.canonical_hashes_range(block + 1, self.last_block_number()? + 1)? {
2880 self.tx.delete::<tables::HeaderNumbers>(hash, None)?;
2881 }
2882
2883 self.remove::<tables::CanonicalHeaders>(block + 1..)?;
2886 self.remove::<tables::Headers<HeaderTy<N>>>(block + 1..)?;
2887 self.remove::<tables::HeaderTerminalDifficulties>(block + 1..)?;
2888
2889 let unwind_tx_from = self
2891 .block_body_indices(block)?
2892 .map(|b| b.next_tx_num())
2893 .ok_or(ProviderError::BlockBodyIndicesNotFound(block))?;
2894
2895 let unwind_tx_to = self
2897 .tx
2898 .cursor_read::<tables::BlockBodyIndices>()?
2899 .last()?
2900 .ok_or(ProviderError::BlockBodyIndicesNotFound(block))?
2902 .1
2903 .last_tx_num();
2904
2905 if unwind_tx_from <= unwind_tx_to {
2906 for (hash, _) in self.transaction_hashes_by_range(unwind_tx_from..(unwind_tx_to + 1))? {
2907 self.tx.delete::<tables::TransactionHashNumbers>(hash, None)?;
2908 }
2909 }
2910
2911 self.remove::<tables::TransactionSenders>(unwind_tx_from..)?;
2912
2913 self.remove_bodies_above(block, remove_from)?;
2914
2915 Ok(())
2916 }
2917
2918 fn remove_bodies_above(
2919 &self,
2920 block: BlockNumber,
2921 remove_from: StorageLocation,
2922 ) -> ProviderResult<()> {
2923 self.storage.writer().remove_block_bodies_above(self, block, remove_from)?;
2924
2925 let unwind_tx_from = self
2927 .block_body_indices(block)?
2928 .map(|b| b.next_tx_num())
2929 .ok_or(ProviderError::BlockBodyIndicesNotFound(block))?;
2930
2931 self.remove::<tables::BlockBodyIndices>(block + 1..)?;
2932 self.remove::<tables::TransactionBlocks>(unwind_tx_from..)?;
2933
2934 if remove_from.database() {
2935 self.remove::<tables::Transactions<TxTy<N>>>(unwind_tx_from..)?;
2936 }
2937
2938 if remove_from.static_files() {
2939 let static_file_tx_num = self
2940 .static_file_provider
2941 .get_highest_static_file_tx(StaticFileSegment::Transactions);
2942
2943 let to_delete = static_file_tx_num
2944 .map(|static_tx| (static_tx + 1).saturating_sub(unwind_tx_from))
2945 .unwrap_or_default();
2946
2947 self.static_file_provider
2948 .latest_writer(StaticFileSegment::Transactions)?
2949 .prune_transactions(to_delete, block)?;
2950 }
2951
2952 Ok(())
2953 }
2954
2955 fn append_blocks_with_state(
2957 &self,
2958 blocks: Vec<RecoveredBlock<Self::Block>>,
2959 execution_outcome: &ExecutionOutcome<Self::Receipt>,
2960 hashed_state: HashedPostStateSorted,
2961 ) -> ProviderResult<()> {
2962 if blocks.is_empty() {
2963 debug!(target: "providers::db", "Attempted to append empty block range");
2964 return Ok(())
2965 }
2966
2967 let first_number = blocks[0].number();
2970
2971 let last_block_number = blocks[blocks.len() - 1].number();
2974
2975 let mut durations_recorder = metrics::DurationsRecorder::default();
2976
2977 for block in blocks {
2979 self.insert_block(block, StorageLocation::Database)?;
2980 durations_recorder.record_relative(metrics::Action::InsertBlock);
2981 }
2982
2983 self.write_state(execution_outcome, OriginalValuesKnown::No, StorageLocation::Database)?;
2984 durations_recorder.record_relative(metrics::Action::InsertState);
2985
2986 self.write_hashed_state(&hashed_state)?;
2988 durations_recorder.record_relative(metrics::Action::InsertHashes);
2989
2990 self.update_history_indices(first_number..=last_block_number)?;
2991 durations_recorder.record_relative(metrics::Action::InsertHistoryIndices);
2992
2993 self.update_pipeline_stages(last_block_number, false)?;
2995 durations_recorder.record_relative(metrics::Action::UpdatePipelineStages);
2996
2997 debug!(target: "providers::db", range = ?first_number..=last_block_number, actions = ?durations_recorder.actions, "Appended blocks");
2998
2999 Ok(())
3000 }
3001}
3002
3003impl<TX: DbTx + 'static, N: NodeTypes> PruneCheckpointReader for DatabaseProvider<TX, N> {
3004 fn get_prune_checkpoint(
3005 &self,
3006 segment: PruneSegment,
3007 ) -> ProviderResult<Option<PruneCheckpoint>> {
3008 Ok(self.tx.get::<tables::PruneCheckpoints>(segment)?)
3009 }
3010
3011 fn get_prune_checkpoints(&self) -> ProviderResult<Vec<(PruneSegment, PruneCheckpoint)>> {
3012 Ok(self
3013 .tx
3014 .cursor_read::<tables::PruneCheckpoints>()?
3015 .walk(None)?
3016 .collect::<Result<_, _>>()?)
3017 }
3018}
3019
3020impl<TX: DbTxMut, N: NodeTypes> PruneCheckpointWriter for DatabaseProvider<TX, N> {
3021 fn save_prune_checkpoint(
3022 &self,
3023 segment: PruneSegment,
3024 checkpoint: PruneCheckpoint,
3025 ) -> ProviderResult<()> {
3026 Ok(self.tx.put::<tables::PruneCheckpoints>(segment, checkpoint)?)
3027 }
3028}
3029
3030impl<TX: DbTx + 'static, N: NodeTypesForProvider> StatsReader for DatabaseProvider<TX, N> {
3031 fn count_entries<T: Table>(&self) -> ProviderResult<usize> {
3032 let db_entries = self.tx.entries::<T>()?;
3033 let static_file_entries = match self.static_file_provider.count_entries::<T>() {
3034 Ok(entries) => entries,
3035 Err(ProviderError::UnsupportedProvider) => 0,
3036 Err(err) => return Err(err),
3037 };
3038
3039 Ok(db_entries + static_file_entries)
3040 }
3041}
3042
3043impl<TX: DbTx + 'static, N: NodeTypes> ChainStateBlockReader for DatabaseProvider<TX, N> {
3044 fn last_finalized_block_number(&self) -> ProviderResult<Option<BlockNumber>> {
3045 let mut finalized_blocks = self
3046 .tx
3047 .cursor_read::<tables::ChainState>()?
3048 .walk(Some(tables::ChainStateKey::LastFinalizedBlock))?
3049 .take(1)
3050 .collect::<Result<BTreeMap<tables::ChainStateKey, BlockNumber>, _>>()?;
3051
3052 let last_finalized_block_number = finalized_blocks.pop_first().map(|pair| pair.1);
3053 Ok(last_finalized_block_number)
3054 }
3055
3056 fn last_safe_block_number(&self) -> ProviderResult<Option<BlockNumber>> {
3057 let mut finalized_blocks = self
3058 .tx
3059 .cursor_read::<tables::ChainState>()?
3060 .walk(Some(tables::ChainStateKey::LastSafeBlockBlock))?
3061 .take(1)
3062 .collect::<Result<BTreeMap<tables::ChainStateKey, BlockNumber>, _>>()?;
3063
3064 let last_finalized_block_number = finalized_blocks.pop_first().map(|pair| pair.1);
3065 Ok(last_finalized_block_number)
3066 }
3067}
3068
3069impl<TX: DbTxMut, N: NodeTypes> ChainStateBlockWriter for DatabaseProvider<TX, N> {
3070 fn save_finalized_block_number(&self, block_number: BlockNumber) -> ProviderResult<()> {
3071 Ok(self
3072 .tx
3073 .put::<tables::ChainState>(tables::ChainStateKey::LastFinalizedBlock, block_number)?)
3074 }
3075
3076 fn save_safe_block_number(&self, block_number: BlockNumber) -> ProviderResult<()> {
3077 Ok(self
3078 .tx
3079 .put::<tables::ChainState>(tables::ChainStateKey::LastSafeBlockBlock, block_number)?)
3080 }
3081}
3082
3083impl<TX: DbTx + 'static, N: NodeTypes + 'static> DBProvider for DatabaseProvider<TX, N> {
3084 type Tx = TX;
3085
3086 fn tx_ref(&self) -> &Self::Tx {
3087 &self.tx
3088 }
3089
3090 fn tx_mut(&mut self) -> &mut Self::Tx {
3091 &mut self.tx
3092 }
3093
3094 fn into_tx(self) -> Self::Tx {
3095 self.tx
3096 }
3097
3098 fn prune_modes_ref(&self) -> &PruneModes {
3099 self.prune_modes_ref()
3100 }
3101}
3102
3103#[cfg(test)]
3104mod tests {
3105 use super::*;
3106 use crate::{
3107 test_utils::{blocks::BlockchainTestData, create_test_provider_factory},
3108 BlockWriter,
3109 };
3110 use reth_testing_utils::generators::{self, random_block, BlockParams};
3111
3112 #[test]
3113 fn test_receipts_by_block_range_empty_range() {
3114 let factory = create_test_provider_factory();
3115 let provider = factory.provider().unwrap();
3116
3117 let start = 10u64;
3119 let end = 9u64;
3120 let result = provider.receipts_by_block_range(start..=end).unwrap();
3121 assert_eq!(result, Vec::<Vec<reth_ethereum_primitives::Receipt>>::new());
3122 }
3123
3124 #[test]
3125 fn test_receipts_by_block_range_nonexistent_blocks() {
3126 let factory = create_test_provider_factory();
3127 let provider = factory.provider().unwrap();
3128
3129 let result = provider.receipts_by_block_range(10..=12).unwrap();
3131 assert_eq!(result, vec![vec![], vec![], vec![]]);
3132 }
3133
3134 #[test]
3135 fn test_receipts_by_block_range_single_block() {
3136 let factory = create_test_provider_factory();
3137 let data = BlockchainTestData::default();
3138
3139 let provider_rw = factory.provider_rw().unwrap();
3140 provider_rw
3141 .insert_block(
3142 data.genesis.clone().try_recover().unwrap(),
3143 crate::StorageLocation::Database,
3144 )
3145 .unwrap();
3146 provider_rw
3147 .insert_block(data.blocks[0].0.clone(), crate::StorageLocation::Database)
3148 .unwrap();
3149 provider_rw
3150 .write_state(
3151 &data.blocks[0].1,
3152 crate::OriginalValuesKnown::No,
3153 crate::StorageLocation::Database,
3154 )
3155 .unwrap();
3156 provider_rw.commit().unwrap();
3157
3158 let provider = factory.provider().unwrap();
3159 let result = provider.receipts_by_block_range(1..=1).unwrap();
3160
3161 assert_eq!(result.len(), 1);
3163 assert_eq!(result[0].len(), 1);
3164 assert_eq!(result[0][0], data.blocks[0].1.receipts()[0][0]);
3165 }
3166
3167 #[test]
3168 fn test_receipts_by_block_range_multiple_blocks() {
3169 let factory = create_test_provider_factory();
3170 let data = BlockchainTestData::default();
3171
3172 let provider_rw = factory.provider_rw().unwrap();
3173 provider_rw
3174 .insert_block(
3175 data.genesis.clone().try_recover().unwrap(),
3176 crate::StorageLocation::Database,
3177 )
3178 .unwrap();
3179 for i in 0..3 {
3180 provider_rw
3181 .insert_block(data.blocks[i].0.clone(), crate::StorageLocation::Database)
3182 .unwrap();
3183 provider_rw
3184 .write_state(
3185 &data.blocks[i].1,
3186 crate::OriginalValuesKnown::No,
3187 crate::StorageLocation::Database,
3188 )
3189 .unwrap();
3190 }
3191 provider_rw.commit().unwrap();
3192
3193 let provider = factory.provider().unwrap();
3194 let result = provider.receipts_by_block_range(1..=3).unwrap();
3195
3196 assert_eq!(result.len(), 3);
3198 for (i, block_receipts) in result.iter().enumerate() {
3199 assert_eq!(block_receipts.len(), 1);
3200 assert_eq!(block_receipts[0], data.blocks[i].1.receipts()[0][0]);
3201 }
3202 }
3203
3204 #[test]
3205 fn test_receipts_by_block_range_blocks_with_varying_tx_counts() {
3206 let factory = create_test_provider_factory();
3207 let data = BlockchainTestData::default();
3208
3209 let provider_rw = factory.provider_rw().unwrap();
3210 provider_rw
3211 .insert_block(
3212 data.genesis.clone().try_recover().unwrap(),
3213 crate::StorageLocation::Database,
3214 )
3215 .unwrap();
3216
3217 for i in 0..3 {
3219 provider_rw
3220 .insert_block(data.blocks[i].0.clone(), crate::StorageLocation::Database)
3221 .unwrap();
3222 provider_rw
3223 .write_state(
3224 &data.blocks[i].1,
3225 crate::OriginalValuesKnown::No,
3226 crate::StorageLocation::Database,
3227 )
3228 .unwrap();
3229 }
3230 provider_rw.commit().unwrap();
3231
3232 let provider = factory.provider().unwrap();
3233 let result = provider.receipts_by_block_range(1..=3).unwrap();
3234
3235 assert_eq!(result.len(), 3);
3237 for block_receipts in &result {
3238 assert_eq!(block_receipts.len(), 1);
3239 }
3240 }
3241
3242 #[test]
3243 fn test_receipts_by_block_range_partial_range() {
3244 let factory = create_test_provider_factory();
3245 let data = BlockchainTestData::default();
3246
3247 let provider_rw = factory.provider_rw().unwrap();
3248 provider_rw
3249 .insert_block(
3250 data.genesis.clone().try_recover().unwrap(),
3251 crate::StorageLocation::Database,
3252 )
3253 .unwrap();
3254 for i in 0..3 {
3255 provider_rw
3256 .insert_block(data.blocks[i].0.clone(), crate::StorageLocation::Database)
3257 .unwrap();
3258 provider_rw
3259 .write_state(
3260 &data.blocks[i].1,
3261 crate::OriginalValuesKnown::No,
3262 crate::StorageLocation::Database,
3263 )
3264 .unwrap();
3265 }
3266 provider_rw.commit().unwrap();
3267
3268 let provider = factory.provider().unwrap();
3269
3270 let result = provider.receipts_by_block_range(2..=5).unwrap();
3272 assert_eq!(result.len(), 4);
3273
3274 assert_eq!(result[0].len(), 1); assert_eq!(result[1].len(), 1); assert_eq!(result[2].len(), 0); assert_eq!(result[3].len(), 0); assert_eq!(result[0][0], data.blocks[1].1.receipts()[0][0]);
3281 assert_eq!(result[1][0], data.blocks[2].1.receipts()[0][0]);
3282 }
3283
3284 #[test]
3285 fn test_receipts_by_block_range_all_empty_blocks() {
3286 let factory = create_test_provider_factory();
3287 let mut rng = generators::rng();
3288
3289 let mut blocks = Vec::new();
3291 for i in 1..=3 {
3292 let block =
3293 random_block(&mut rng, i, BlockParams { tx_count: Some(0), ..Default::default() });
3294 blocks.push(block);
3295 }
3296
3297 let provider_rw = factory.provider_rw().unwrap();
3298 for block in blocks {
3299 provider_rw
3300 .insert_block(block.try_recover().unwrap(), crate::StorageLocation::Database)
3301 .unwrap();
3302 }
3303 provider_rw.commit().unwrap();
3304
3305 let provider = factory.provider().unwrap();
3306 let result = provider.receipts_by_block_range(1..=3).unwrap();
3307
3308 assert_eq!(result.len(), 3);
3309 for block_receipts in result {
3310 assert_eq!(block_receipts.len(), 0);
3311 }
3312 }
3313
3314 #[test]
3315 fn test_receipts_by_block_range_consistency_with_individual_calls() {
3316 let factory = create_test_provider_factory();
3317 let data = BlockchainTestData::default();
3318
3319 let provider_rw = factory.provider_rw().unwrap();
3320 provider_rw
3321 .insert_block(
3322 data.genesis.clone().try_recover().unwrap(),
3323 crate::StorageLocation::Database,
3324 )
3325 .unwrap();
3326 for i in 0..3 {
3327 provider_rw
3328 .insert_block(data.blocks[i].0.clone(), crate::StorageLocation::Database)
3329 .unwrap();
3330 provider_rw
3331 .write_state(
3332 &data.blocks[i].1,
3333 crate::OriginalValuesKnown::No,
3334 crate::StorageLocation::Database,
3335 )
3336 .unwrap();
3337 }
3338 provider_rw.commit().unwrap();
3339
3340 let provider = factory.provider().unwrap();
3341
3342 let range_result = provider.receipts_by_block_range(1..=3).unwrap();
3344
3345 let mut individual_results = Vec::new();
3347 for block_num in 1..=3 {
3348 let receipts =
3349 provider.receipts_by_block(block_num.into()).unwrap().unwrap_or_default();
3350 individual_results.push(receipts);
3351 }
3352
3353 assert_eq!(range_result, individual_results);
3354 }
3355}