Struct sc_client_db::Backend
source · pub struct Backend<Block: BlockT> { /* private fields */ }
Expand description
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§
source§impl<Block: BlockT> Backend<Block>
impl<Block: BlockT> Backend<Block>
sourcepub fn new(
db_config: DatabaseSettings,
canonicalization_delay: u64
) -> ClientResult<Self>
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.
Trait Implementations§
source§impl<Block> AuxStore for Backend<Block>where
Block: BlockT,
impl<Block> AuxStore for Backend<Block>where
Block: BlockT,
source§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<()>
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. Read more
source§impl<Block: BlockT> Backend<Block> for Backend<Block>
impl<Block: BlockT> Backend<Block> for Backend<Block>
§type BlockImportOperation = BlockImportOperation<Block>
type BlockImportOperation = BlockImportOperation<Block>
Associated block insertion operation type.
§type Blockchain = BlockchainDb<Block>
type Blockchain = BlockchainDb<Block>
Associated blockchain backend type.
§type State = RecordStatsState<RefTrackingState<Block>, Block>
type State = RecordStatsState<RefTrackingState<Block>, Block>
Associated state backend type.
§type OffchainStorage = LocalStorage
type OffchainStorage = LocalStorage
Offchain workers local storage.
source§fn begin_operation(&self) -> ClientResult<Self::BlockImportOperation>
fn begin_operation(&self) -> ClientResult<Self::BlockImportOperation>
Begin a new block insertion transaction with given parent block id. Read more
source§fn begin_state_operation(
&self,
operation: &mut Self::BlockImportOperation,
block: Block::Hash
) -> ClientResult<()>
fn begin_state_operation(
&self,
operation: &mut Self::BlockImportOperation,
block: Block::Hash
) -> ClientResult<()>
Note an operation to contain state transition.
source§fn commit_operation(
&self,
operation: Self::BlockImportOperation
) -> ClientResult<()>
fn commit_operation(
&self,
operation: Self::BlockImportOperation
) -> ClientResult<()>
Commit block insertion.
source§fn finalize_block(
&self,
hash: Block::Hash,
justification: Option<Justification>
) -> ClientResult<()>
fn finalize_block(
&self,
hash: Block::Hash,
justification: Option<Justification>
) -> ClientResult<()>
Finalize block with given
hash
. Read moresource§fn append_justification(
&self,
hash: Block::Hash,
justification: Justification
) -> ClientResult<()>
fn append_justification(
&self,
hash: Block::Hash,
justification: Justification
) -> ClientResult<()>
Append justification to the block with the given
hash
. Read moresource§fn offchain_storage(&self) -> Option<Self::OffchainStorage>
fn offchain_storage(&self) -> Option<Self::OffchainStorage>
Returns a handle to offchain storage.
source§fn usage_info(&self) -> Option<UsageInfo>
fn usage_info(&self) -> Option<UsageInfo>
Returns current usage statistics.
source§fn revert(
&self,
n: NumberFor<Block>,
revert_finalized: bool
) -> ClientResult<(NumberFor<Block>, HashSet<Block::Hash>)>
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
. Read moresource§fn remove_leaf_block(&self, hash: Block::Hash) -> ClientResult<()>
fn remove_leaf_block(&self, hash: Block::Hash) -> ClientResult<()>
Discard non-best, unfinalized leaf block.
source§fn blockchain(&self) -> &BlockchainDb<Block>
fn blockchain(&self) -> &BlockchainDb<Block>
Returns reference to blockchain backend.
source§fn state_at(&self, hash: Block::Hash) -> ClientResult<Self::State>
fn state_at(&self, hash: Block::Hash) -> ClientResult<Self::State>
Returns state backend with post-state of given block.
source§fn have_state_at(&self, hash: Block::Hash, number: NumberFor<Block>) -> bool
fn have_state_at(&self, hash: Block::Hash, number: NumberFor<Block>) -> bool
Returns true if state for given block is available.
source§fn get_import_lock(&self) -> &RwLock<()>
fn get_import_lock(&self) -> &RwLock<()>
Gain access to the import lock around this backend. Read more
source§fn requires_full_sync(&self) -> bool
fn requires_full_sync(&self) -> bool
Tells whether the backend requires full-sync mode.
source§fn pin_block(&self, hash: <Block as BlockT>::Hash) -> Result<()>
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
. Read moresource§fn unpin_block(&self, hash: <Block as BlockT>::Hash)
fn unpin_block(&self, hash: <Block as BlockT>::Hash)
Unpin the block to allow pruning.
source§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]>,
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.
impl<Block: BlockT> LocalBackend<Block> for Backend<Block>
Auto Trait Implementations§
impl<Block> !RefUnwindSafe for Backend<Block>
impl<Block> Send for Backend<Block>
impl<Block> Sync for Backend<Block>
impl<Block> Unpin for Backend<Block>
impl<Block> !UnwindSafe for Backend<Block>
Blanket Implementations§
source§impl<T> CheckedConversion for T
impl<T> CheckedConversion for T
source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
source§fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
Convert
Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
. Read moresource§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
Convert
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
. Read moresource§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert
&Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s. Read moresource§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert
&mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s. Read moresource§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T, Outer> IsWrappedBy<Outer> for Twhere
Outer: AsRef<T> + AsMut<T> + From<T>,
T: From<Outer>,
impl<T, Outer> IsWrappedBy<Outer> for Twhere
Outer: AsRef<T> + AsMut<T> + From<T>,
T: From<Outer>,
source§impl<T> Pointable for T
impl<T> Pointable for T
source§impl<T> SaturatedConversion for T
impl<T> SaturatedConversion for T
source§fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
source§fn saturated_into<T>(self) -> Twhere
Self: UniqueSaturatedInto<T>,
fn saturated_into<T>(self) -> Twhere
Self: UniqueSaturatedInto<T>,
Consume self to return an equivalent value of
T
. Read moresource§impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
source§fn unchecked_into(self) -> T
fn unchecked_into(self) -> T
The counterpart to
unchecked_from
.source§impl<T, S> UniqueSaturatedInto<T> for Swhere
T: Bounded,
S: TryInto<T>,
impl<T, S> UniqueSaturatedInto<T> for Swhere
T: Bounded,
S: TryInto<T>,
source§fn unique_saturated_into(self) -> T
fn unique_saturated_into(self) -> T
Consume self to return an equivalent value of
T
.