Struct RefTrackingState

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

A reference tracking state.

It makes sure that the hash we are using stays pinned in storage until this structure is dropped.

Trait Implementations

impl<B: BlockT> AsTrieBackend<<<B as Block>::Header as Header>::Hashing> for RefTrackingState<B>

type TrieBackendStorage = <TrieBackend<Arc<dyn Storage<<<B as Block>::Header as Header>::Hashing>>, <<B as Block>::Header as Header>::Hashing> as Backend<<<B as Block>::Header as Header>::Hashing>>::TrieBackendStorage

Type of trie backend storage.

fn as_trie_backend( &self, ) -> &TrieBackend<Self::TrieBackendStorage, HashingFor<B>>

Return the type as TrieBackend.

impl<B: BlockT> Backend<<<B as Block>::Header as Header>::Hashing> for RefTrackingState<B>

type Error = <TrieBackend<Arc<dyn Storage<<<B as Block>::Header as Header>::Hashing>>, <<B as Block>::Header as Header>::Hashing> as Backend<<<B as Block>::Header as Header>::Hashing>>::Error

An error type when fetching data is not possible.

type TrieBackendStorage = <TrieBackend<Arc<dyn Storage<<<B as Block>::Header as Header>::Hashing>>, <<B as Block>::Header as Header>::Hashing> as Backend<<<B as Block>::Header as Header>::Hashing>>::TrieBackendStorage

Type of trie backend storage.

type RawIter = RawIter<B>

Type of the raw storage iterator.

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

Get keyed storage or None if there is nothing associated.

fn storage_hash(&self, key: &[u8]) -> Result<Option<B::Hash>, Self::Error>

Get keyed storage value hash or None if there is nothing associated.

fn child_storage( &self, child_info: &ChildInfo, key: &[u8], ) -> Result<Option<Vec<u8>>, Self::Error>

Get child keyed child storage or None if there is nothing associated.

fn child_storage_hash( &self, child_info: &ChildInfo, key: &[u8], ) -> Result<Option<B::Hash>, Self::Error>

Get child keyed storage value hash or None if there is nothing associated.

fn closest_merkle_value( &self, key: &[u8], ) -> Result<Option<MerkleValue<B::Hash>>, Self::Error>

Get the merkle value or None if there is nothing associated.

fn child_closest_merkle_value( &self, child_info: &ChildInfo, key: &[u8], ) -> Result<Option<MerkleValue<B::Hash>>, Self::Error>

Get the child merkle value or None if there is nothing associated.

fn exists_storage(&self, key: &[u8]) -> Result<bool, Self::Error>

true if a key exists in storage.

fn exists_child_storage( &self, child_info: &ChildInfo, key: &[u8], ) -> Result<bool, Self::Error>

true if a key exists in child storage.

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

Return the next key in storage in lexicographic order or None if there is no value.

fn next_child_storage_key( &self, child_info: &ChildInfo, key: &[u8], ) -> Result<Option<Vec<u8>>, Self::Error>

Return the next key in child storage in lexicographic order or None if there is no value.

fn storage_root<'a>( &self, delta: impl Iterator<Item = (&'a [u8], Option<&'a [u8]>)>, state_version: StateVersion, ) -> (B::Hash, BackendTransaction<HashingFor<B>>)

Calculate the storage root, with given delta over what is already stored in the backend, and produce a “transaction” that can be used to commit. Does not include child storage updates.

fn child_storage_root<'a>( &self, child_info: &ChildInfo, delta: impl Iterator<Item = (&'a [u8], Option<&'a [u8]>)>, state_version: StateVersion, ) -> (B::Hash, bool, BackendTransaction<HashingFor<B>>)

Calculate the child storage root, with given delta over what is already stored in the backend, and produce a “transaction” that can be used to commit. The second argument is true if child storage root equals default storage root.

fn raw_iter(&self, args: IterArgs<'_>) -> Result<Self::RawIter, Self::Error>

Returns a lifetimeless raw storage iterator.

fn register_overlay_stats(&self, stats: &StateMachineStats)

Register stats from overlay of state machine.

fn usage_info(&self) -> StateUsageInfo

Query backend usage statistics (i/o, memory)

fn pairs<'a>( &'a self, args: IterArgs<'_>, ) -> Result<PairsIter<'a, H, Self::RawIter>, Self::Error>

Get an iterator over key/value pairs.

fn keys<'a>( &'a self, args: IterArgs<'_>, ) -> Result<KeysIter<'a, H, Self::RawIter>, Self::Error>

Get an iterator over keys.

fn full_storage_root<'a>( &self, delta: impl Iterator<Item = (&'a [u8], Option<&'a [u8]>)>, child_deltas: impl Iterator<Item = (&'a ChildInfo, impl Iterator<Item = (&'a [u8], Option<&'a [u8]>)>)>, state_version: StateVersion, ) -> (<H as Hasher>::Out, MemoryDB<H, PrefixedKey<H>, Vec<u8>>)

where <H as Hasher>::Out: Ord + Encode,

Calculate the storage root, with given delta over what is already stored in the backend, and produce a “transaction” that can be used to commit. Does include child storage updates.

fn wipe(&self) -> Result<(), Self::Error>

Wipe the state database.

fn commit( &self, _: <H as Hasher>::Out, _: MemoryDB<H, PrefixedKey<H>, Vec<u8>>, _: Vec<(Vec<u8>, Option<Vec<u8>>)>, _: Vec<(Vec<u8>, Vec<(Vec<u8>, Option<Vec<u8>>)>)>, ) -> Result<(), Self::Error>

Commit given transaction to storage.

fn read_write_count(&self) -> (u32, u32, u32, u32)

Get the read/write count of the db

fn reset_read_write_count(&self)

Get the read/write count of the db

fn get_whitelist(&self) -> Vec<TrackedStorageKey>

Get the whitelist for tracking db reads/writes

fn set_whitelist(&self, _: Vec<TrackedStorageKey>)

Update the whitelist for tracking db reads/writes

fn proof_size(&self) -> Option<u32>

Estimate proof size

fn get_read_and_written_keys(&self) -> Vec<(Vec<u8>, u32, u32, bool)>

Extend storage info for benchmarking db

impl<Block: BlockT> Debug for RefTrackingState<Block>

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

Formats the value using the given formatter.

impl<B: BlockT> Drop for RefTrackingState<B>

fn drop(&mut self)

Executes the destructor for this type.