Struct Backend 

pub struct Backend<Block: BlockT> { /* private fields */ }

Disk backend.

Disk backend keeps data in a key-value store. In archive mode, trie nodes are kept from all blocks. Otherwise, trie nodes are kept only from some recent blocks.

Implementations

impl<Block: BlockT> Backend<Block>

pub fn new( db_config: DatabaseSettings, canonicalization_delay: u64, ) -> ClientResult<Self>

Create a new instance of database backend.

The pruning window is how old a block must be before the state is pruned.

pub fn reset_trie_cache(&self)

Reset the shared trie cache.

pub fn new_test(blocks_pruning: u32, canonicalization_delay: u64) -> Self

Create new memory-backed client backend for tests.

pub fn new_test_with_pruning_filters( blocks_pruning: u32, canonicalization_delay: u64, pruning_filters: Vec<Arc<dyn PruningFilter>>, ) -> Self

Create new memory-backed client backend for tests with custom pruning filters.

pub fn new_test_with_tx_storage( blocks_pruning: BlocksPruning, canonicalization_delay: u64, ) -> Self

Create new memory-backed client backend for tests.

pub fn new_test_with_tx_storage_and_filters( blocks_pruning: BlocksPruning, canonicalization_delay: u64, pruning_filters: Vec<Arc<dyn PruningFilter>>, ) -> Self

Create new memory-backed client backend for tests with custom pruning filters.

pub fn new_test_with_tx_storage_source( blocks_pruning: BlocksPruning, canonicalization_delay: u64, source: DatabaseSource, pruning_filters: Vec<Arc<dyn PruningFilter>>, ) -> Self

Test backend with caller-chosen DatabaseSource (memdb / rocksdb / parity-db).

pub fn expose_db(&self) -> (Arc<dyn Database<DbHash>>, ColumnId)

Expose the Database that is used by this backend. The second argument is the Column that stores the State.

Should only be needed for benchmarking.

pub fn expose_storage(&self) -> Arc<dyn Storage<HashingFor<Block>>>

Expose the Storage that is used by this backend.

Should only be needed for benchmarking.

pub fn expose_shared_trie_cache( &self, ) -> Option<SharedTrieCache<HashingFor<Block>>>

Expose the shared trie cache that is used by this backend.

Should only be needed for benchmarking.

Trait Implementations

impl<Block> AuxStore for Backend<Block>

where Block: BlockT,

fn insert_aux<'a, 'b: 'a, 'c: 'a, I: IntoIterator<Item = &'a (&'c [u8], &'c [u8])>, D: IntoIterator<Item = &'a &'b [u8]>>( &self, insert: I, delete: D, ) -> ClientResult<()>

Insert auxiliary data into key-value store.

fn get_aux(&self, key: &[u8]) -> ClientResult<Option<Vec<u8>>>

Query auxiliary data from key-value store.

impl<Block: BlockT> Backend<Block> for Backend<Block>

type BlockImportOperation = BlockImportOperation<Block>

Associated block insertion operation type.

type Blockchain = BlockchainDb<Block>

Associated blockchain backend type.

type State = RecordStatsState<RefTrackingState<Block>, Block>

Associated state backend type.

type OffchainStorage = LocalStorage

Offchain workers local storage.

fn begin_operation(&self) -> ClientResult<Self::BlockImportOperation>

Begin a new block insertion transaction with given parent block id.

fn begin_state_operation( &self, operation: &mut Self::BlockImportOperation, block: Block::Hash, ) -> ClientResult<()>

Note an operation to contain state transition.

fn commit_operation( &self, operation: Self::BlockImportOperation, ) -> ClientResult<()>

Commit block insertion.

fn finalize_block( &self, hash: Block::Hash, justification: Option<Justification>, ) -> ClientResult<()>

Finalize block with given hash.

fn append_justification( &self, hash: Block::Hash, justification: Justification, ) -> ClientResult<()>

Append justification to the block with the given hash.

fn offchain_storage(&self) -> Option<Self::OffchainStorage>

Returns a handle to offchain storage.

fn usage_info(&self) -> Option<UsageInfo>

Returns current usage statistics.

fn revert( &self, n: NumberFor<Block>, revert_finalized: bool, ) -> ClientResult<(NumberFor<Block>, HashSet<Block::Hash>)>

Attempts to revert the chain by n blocks. If revert_finalized is set it will attempt to revert past any finalized block, this is unsafe and can potentially leave the node in an inconsistent state. All blocks higher than the best block are also reverted and not counting towards n.

fn remove_leaf_block(&self, hash: Block::Hash) -> ClientResult<()>

Discard non-best, unfinalized leaf block.

fn blockchain(&self) -> &BlockchainDb<Block>

Returns reference to blockchain backend.

fn state_at( &self, hash: Block::Hash, trie_cache_context: TrieCacheContext, ) -> ClientResult<Self::State>

Returns state backend with post-state of given block.

fn have_state_at(&self, hash: Block::Hash, number: NumberFor<Block>) -> bool

Returns true if state for given block is available.

fn get_import_lock(&self) -> &RwLock<()>

Gain access to the import lock around this backend.

fn requires_full_sync(&self) -> bool

Tells whether the backend requires full-sync mode.

fn pin_block(&self, hash: <Block as BlockT>::Hash) -> Result<()>

Pin the block to keep body, justification and state available after pruning. Number of pins are reference counted. Users need to make sure to perform one call to [Self::unpin_block] per call to [Self::pin_block].

fn unpin_block(&self, hash: <Block as BlockT>::Hash)

Unpin the block to allow pruning.

fn insert_aux<'a, 'b, 'c, I, D>( &self, insert: I, delete: D, ) -> Result<(), Error>

where 'b: 'a, 'c: 'a, I: IntoIterator<Item = &'a (&'c [u8], &'c [u8])>, D: IntoIterator<Item = &'a &'b [u8]>,

Insert auxiliary data into key-value store.

fn get_aux(&self, key: &[u8]) -> Result<Option<Vec<u8>>, Error>

Query auxiliary data from key-value store.

impl<Block: BlockT> LocalBackend<Block> for Backend<Block>