Struct BenchmarkingState

pub struct BenchmarkingState<Hasher: Hash> { /* private fields */ }

State that manages the backend database reference. Allows runtime to control the database.

Implementations

impl<Hasher: Hash> BenchmarkingState<Hasher>

pub fn new( genesis: Storage, _cache_size_mb: Option<usize>, record_proof: bool, enable_tracking: bool, ) -> Result<Self, String>

Create a new instance that creates a database in a temporary dir.

pub fn recorder(&self) -> Option<Recorder<Hasher>>

Get the proof recorder for this state

Trait Implementations

impl<Hasher: Hash> Backend<Hasher> for BenchmarkingState<Hasher>

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

Get the key tracking information for the state db.

1. reads - Total number of DB reads.
2. repeat_reads - Total number of in-memory reads.
3. writes - Total number of DB writes.
4. repeat_writes - Total number of in-memory writes.

fn reset_read_write_count(&self)

Reset the key tracking information for the state db.

type Error = <TrieBackend<Arc<dyn Storage<Hasher>>, Hasher> as Backend<Hasher>>::Error

An error type when fetching data is not possible.

type TrieBackendStorage = <TrieBackend<Arc<dyn Storage<Hasher>>, Hasher> as Backend<Hasher>>::TrieBackendStorage

Type of trie backend storage.

type RawIter = RawIter<Hasher>

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<Hasher::Output>, 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<Hasher::Output>, 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<Hasher::Output>>, 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<Hasher::Output>>, 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, ) -> (Hasher::Output, BackendTransaction<Hasher>)

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, ) -> (Hasher::Output, bool, BackendTransaction<Hasher>)

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 commit( &self, storage_root: <Hasher as DbHasher>::Out, transaction: BackendTransaction<Hasher>, main_storage_changes: StorageCollection, child_storage_changes: ChildStorageCollection, ) -> Result<(), Self::Error>

Commit given transaction to storage.

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

Wipe the state database.

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

Get the whitelist for tracking db reads/writes

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

Update the whitelist for tracking db reads/writes

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

Extend storage info for benchmarking db

fn register_overlay_stats(&self, stats: &StateMachineStats)

Register stats from overlay of state machine.

fn usage_info(&self) -> UsageInfo

Query backend usage statistics (i/o, memory)

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

Estimate proof size

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.

impl<Hasher: Hash> Debug for BenchmarkingState<Hasher>

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

Formats the value using the given formatter.