mirror of
https://github.com/paradigmxyz/reth.git
synced 2026-02-08 05:55:21 -05:00
91 lines
3.3 KiB
Rust
91 lines
3.3 KiB
Rust
mod batch_sizes;
|
|
mod checkpoint;
|
|
mod mode;
|
|
mod part;
|
|
mod target;
|
|
|
|
use crate::{Address, BlockNumber};
|
|
pub use batch_sizes::PruneBatchSizes;
|
|
pub use checkpoint::PruneCheckpoint;
|
|
pub use mode::PruneMode;
|
|
pub use part::{PrunePart, PrunePartError};
|
|
use serde::{Deserialize, Serialize};
|
|
use std::collections::BTreeMap;
|
|
pub use target::{PruneModes, MINIMUM_PRUNING_DISTANCE};
|
|
|
|
/// Configuration for pruning receipts not associated with logs emitted by the specified contracts.
|
|
#[derive(Debug, Clone, PartialEq, Eq, Default, Serialize, Deserialize)]
|
|
pub struct ReceiptsLogPruneConfig(pub BTreeMap<Address, PruneMode>);
|
|
|
|
impl ReceiptsLogPruneConfig {
|
|
/// Checks if the configuration is empty
|
|
pub fn is_empty(&self) -> bool {
|
|
self.0.is_empty()
|
|
}
|
|
|
|
/// Given the `tip` block number, consolidates the structure so it can easily be queried for
|
|
/// filtering across a range of blocks.
|
|
///
|
|
/// Example:
|
|
///
|
|
/// `{ addrA: Before(872), addrB: Before(500), addrC: Distance(128) }`
|
|
///
|
|
/// for `tip: 1000`, gets transformed to a map such as:
|
|
///
|
|
/// `{ 500: [addrB], 872: [addrA, addrC] }`
|
|
///
|
|
/// The [`BlockNumber`] key of the new map should be viewed as `PruneMode::Before(block)`, which
|
|
/// makes the previous result equivalent to
|
|
///
|
|
/// `{ Before(500): [addrB], Before(872): [addrA, addrC] }`
|
|
pub fn group_by_block(
|
|
&self,
|
|
tip: BlockNumber,
|
|
pruned_block: Option<BlockNumber>,
|
|
) -> Result<BTreeMap<BlockNumber, Vec<&Address>>, PrunePartError> {
|
|
let mut map = BTreeMap::new();
|
|
let pruned_block = pruned_block.unwrap_or_default();
|
|
|
|
for (address, mode) in self.0.iter() {
|
|
// Getting `None`, means that there is nothing to prune yet, so we need it to include in
|
|
// the BTreeMap (block = 0), otherwise it will be excluded.
|
|
// Reminder that this BTreeMap works as an inclusion list that excludes (prunes) all
|
|
// other receipts.
|
|
//
|
|
// Reminder, that we increment because the [`BlockNumber`] key of the new map should be
|
|
// viewed as `PruneMode::Before(block)`
|
|
let block = (pruned_block + 1).max(
|
|
mode.prune_target_block(tip, MINIMUM_PRUNING_DISTANCE, PrunePart::ContractLogs)?
|
|
.map(|(block, _)| block)
|
|
.unwrap_or_default() +
|
|
1,
|
|
);
|
|
|
|
map.entry(block).or_insert_with(Vec::new).push(address)
|
|
}
|
|
Ok(map)
|
|
}
|
|
|
|
/// Returns the lowest block where we start filtering logs which use `PruneMode::Distance(_)`.
|
|
pub fn lowest_block_with_distance(
|
|
&self,
|
|
tip: BlockNumber,
|
|
pruned_block: Option<BlockNumber>,
|
|
) -> Result<Option<BlockNumber>, PrunePartError> {
|
|
let pruned_block = pruned_block.unwrap_or_default();
|
|
let mut lowest = None;
|
|
|
|
for (_, mode) in self.0.iter() {
|
|
if let PruneMode::Distance(_) = mode {
|
|
if let Some((block, _)) =
|
|
mode.prune_target_block(tip, MINIMUM_PRUNING_DISTANCE, PrunePart::ContractLogs)?
|
|
{
|
|
lowest = Some(lowest.unwrap_or(u64::MAX).min(block));
|
|
}
|
|
}
|
|
}
|
|
|
|
Ok(lowest.map(|lowest| lowest.max(pruned_block)))
|
|
}
|
|
}
|