Struct ShareableBlockchainTree

pub struct ShareableBlockchainTree<N: NodeTypesWithDB, E> {
    pub tree: Arc<RwLock<BlockchainTree<N, E>>>,
}

Shareable blockchain tree that is behind a RwLock

Fields

tree: Arc<RwLock<BlockchainTree<N, E>>>

BlockchainTree

Implementations

impl<N: NodeTypesWithDB, E> ShareableBlockchainTree<N, E>

pub fn new(tree: BlockchainTree<N, E>) -> Self

Create a new shareable database.

Trait Implementations

impl<N, E> BlockchainTreeEngine for ShareableBlockchainTree<N, E>

where N: TreeNodeTypes, E: BlockExecutorProvider<Primitives = N::Primitives>,

fn buffer_block( &self, block: SealedBlockWithSenders, ) -> Result<(), InsertBlockError>

Buffer block with senders

fn insert_block( &self, block: SealedBlockWithSenders, validation_kind: BlockValidationKind, ) -> Result<InsertPayloadOk, InsertBlockError>

Inserts block with senders

fn finalize_block(&self, finalized_block: BlockNumber) -> ProviderResult<()>

Finalize blocks up until and including finalized_block, and remove them from the tree.

fn connect_buffered_blocks_to_canonical_hashes_and_finalize( &self, last_finalized_block: BlockNumber, ) -> Result<(), CanonicalError>

Reads the last N canonical hashes from the database and updates the block indices of the tree by attempting to connect the buffered blocks to canonical hashes.

fn update_block_hashes_and_clear_buffered( &self, ) -> Result<BTreeMap<BlockNumber, BlockHash>, CanonicalError>

Update all block hashes. iterate over present and new list of canonical hashes and compare them. Remove all mismatches, disconnect them, removes all chains and clears all buffered blocks before the tip.

fn connect_buffered_blocks_to_canonical_hashes( &self, ) -> Result<(), CanonicalError>

Reads the last N canonical hashes from the database and updates the block indices of the tree by attempting to connect the buffered blocks to canonical hashes.

fn make_canonical( &self, block_hash: BlockHash, ) -> Result<CanonicalOutcome, CanonicalError>

Make a block and its parent chain part of the canonical chain by committing it to the database.

fn insert_block_without_senders( &self, block: SealedBlock, validation_kind: BlockValidationKind, ) -> Result<InsertPayloadOk, InsertBlockError>

Recover senders and call BlockchainTreeEngine::insert_block.

fn buffer_block_without_senders( &self, block: SealedBlock, ) -> Result<(), InsertBlockError>

Recover senders and call BlockchainTreeEngine::buffer_block.

impl<N, E> BlockchainTreePendingStateProvider for ShareableBlockchainTree<N, E>

where N: TreeNodeTypes, E: BlockExecutorProvider<Primitives = N::Primitives>,

fn find_pending_state_provider( &self, block_hash: BlockHash, ) -> Option<Box<dyn FullExecutionDataProvider>>

Returns state provider if a matching block exists.

fn pending_state_provider( &self, block_hash: FixedBytes<32>, ) -> Result<Box<dyn FullExecutionDataProvider>, ProviderError>

Returns a state provider that includes all state changes of the given (pending) block hash.

impl<N, E> BlockchainTreeViewer for ShareableBlockchainTree<N, E>

where N: TreeNodeTypes, E: BlockExecutorProvider<Primitives = N::Primitives>,

fn header_by_hash(&self, hash: BlockHash) -> Option<SealedHeader>

Returns the header with matching hash from the tree, if it exists.

fn block_by_hash(&self, block_hash: BlockHash) -> Option<SealedBlock>

Returns the block with matching hash from the tree, if it exists.

fn block_with_senders_by_hash( &self, block_hash: BlockHash, ) -> Option<SealedBlockWithSenders>

Returns the block with matching hash from the tree, if it exists.

fn buffered_header_by_hash(&self, block_hash: BlockHash) -> Option<SealedHeader>

Returns the buffered (disconnected) header with matching hash from the internal buffer if it exists.

fn is_canonical(&self, hash: BlockHash) -> Result<bool, ProviderError>

Return whether or not the block is known and in the canonical chain.

fn lowest_buffered_ancestor( &self, hash: BlockHash, ) -> Option<SealedBlockWithSenders>

Given the hash of a block, this checks the buffered blocks for the lowest ancestor in the buffer.

fn canonical_tip(&self) -> BlockNumHash

Return BlockchainTree best known canonical chain tip (BlockHash, BlockNumber)

fn pending_block_num_hash(&self) -> Option<BlockNumHash>

Return block number and hash that extends the canonical chain tip by one.

fn pending_block(&self) -> Option<SealedBlock>

Returns the pending block if there is one.

fn pending_block_and_receipts(&self) -> Option<(SealedBlock, Vec<Receipt>)>

Returns the pending block and its receipts in one call.

fn receipts_by_block_hash(&self, block_hash: BlockHash) -> Option<Vec<Receipt>>

Returns the pending receipts if there is one.

fn contains(&self, hash: FixedBytes<32>) -> bool

Returns true if the tree contains the block with matching hash.

fn pending_block_with_senders(&self) -> Option<SealedBlockWithSenders>

Returns the pending block if there is one.

fn pending_receipts(&self) -> Option<Vec<Receipt>>

Returns the pending receipts if there is one.

fn pending_header(&self) -> Option<SealedHeader>

Returns the pending block if there is one.

impl<N, E> CanonStateSubscriptions for ShareableBlockchainTree<N, E>

where N: TreeNodeTypes, E: Send + Sync,

fn subscribe_to_canonical_state(&self) -> CanonStateNotifications

Get notified when a new canonical chain was imported.

fn canonical_state_stream( &self, ) -> CanonStateNotificationStream<Self::Primitives>

Convenience method to get a stream of [CanonStateNotification].

impl<N: Clone + NodeTypesWithDB, E: Clone> Clone for ShareableBlockchainTree<N, E>

fn clone(&self) -> ShareableBlockchainTree<N, E>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<N: Debug + NodeTypesWithDB, E: Debug> Debug for ShareableBlockchainTree<N, E>

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

Formats the value using the given formatter.

impl<N, E> NodePrimitivesProvider for ShareableBlockchainTree<N, E>

where N: ProviderNodeTypes, E: Send + Sync,

type Primitives = <N as NodeTypes>::Primitives

The node primitive types.

Layout

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

Size: 8 bytes