pub struct BenchmarkingState<B: BlockT> { /* private fields */ }
Expand description

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

Implementations§

source§

impl<B: BlockT> BenchmarkingState<B>

source

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.

Trait Implementations§

source§

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

source§

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.
source§

fn reset_read_write_count(&self)

Reset the key tracking information for the state db.

§

type Error = <TrieBackend<Arc<dyn Storage<<<B as Block>::Header as Header>::Hashing> + 'static>, <<B as Block>::Header as Header>::Hashing, LocalTrieCache<<<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> + 'static>, <<B as Block>::Header as Header>::Hashing, LocalTrieCache<<<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.
source§

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

Get keyed storage or None if there is nothing associated.
source§

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

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

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

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

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.
source§

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

true if a key exists in storage.
source§

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

true if a key exists in child storage.
source§

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.
source§

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.
source§

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.
source§

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.
source§

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

Returns a lifetimeless raw storage iterator.
source§

fn commit( &self, storage_root: <HashingFor<B> as Hasher>::Out, transaction: BackendTransaction<HashingFor<B>>, main_storage_changes: StorageCollection, child_storage_changes: ChildStorageCollection ) -> Result<(), Self::Error>

Commit given transaction to storage.
source§

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

Wipe the state database.
source§

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

Get the whitelist for tracking db reads/writes
source§

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

Update the whitelist for tracking db reads/writes
source§

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

Extend storage info for benchmarking db
source§

fn register_overlay_stats(&self, stats: &StateMachineStats)

Register stats from overlay of state machine. Read more
source§

fn usage_info(&self) -> UsageInfo

Query backend usage statistics (i/o, memory) Read more
source§

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

Estimate proof size
source§

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

Get an iterator over key/value pairs.
source§

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

Get an iterator over keys.
source§

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

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<B> !RefUnwindSafe for BenchmarkingState<B>

§

impl<B> Send for BenchmarkingState<B>

§

impl<B> !Sync for BenchmarkingState<B>

§

impl<B> Unpin for BenchmarkingState<B>where <B as Block>::Hash: Unpin,

§

impl<B> !UnwindSafe for BenchmarkingState<B>

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> CheckedConversion for T

source§

fn checked_from<T>(t: T) -> Option<Self>where Self: TryFrom<T>,

Convert from a value of T into an equivalent instance of Option<Self>. Read more
source§

fn checked_into<T>(self) -> Option<T>where Self: TryInto<T>,

Consume self to return Some equivalent value of Option<T>. Read more
source§

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<H, B> InspectState<H, B> for Bwhere H: Hasher, B: Backend<H>, <H as Hasher>::Out: Encode,

source§

fn inspect_state<F, R>(&self, f: F) -> Rwhere F: FnOnce() -> R,

Inspect state with a closure. Read more
source§

impl<T> Instrument for T

source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
source§

impl<T, U> Into<U> for Twhere U: From<T>,

const: unstable · source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T, Outer> IsWrappedBy<Outer> for Twhere Outer: AsRef<T> + AsMut<T> + From<T>, T: From<Outer>,

source§

fn from_ref(outer: &Outer) -> &T

Get a reference to the inner from the outer.

source§

fn from_mut(outer: &mut Outer) -> &mut T

Get a mutable reference to the inner from the outer.

§

impl<T> Pointable for T

§

const ALIGN: usize = mem::align_of::<T>()

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
source§

impl<T> Same<T> for T

§

type Output = T

Should always be Self
source§

impl<T> SaturatedConversion for T

source§

fn saturated_from<T>(t: T) -> Selfwhere Self: UniqueSaturatedFrom<T>,

Convert from a value of T into an equivalent instance of Self. Read more
source§

fn saturated_into<T>(self) -> Twhere Self: UniqueSaturatedInto<T>,

Consume self to return an equivalent value of T. Read more
source§

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
const: unstable · source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
const: unstable · source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<S, T> UncheckedInto<T> for Swhere T: UncheckedFrom<S>,

source§

fn unchecked_into(self) -> T

The counterpart to unchecked_from.
source§

impl<T, S> UniqueSaturatedInto<T> for Swhere T: Bounded, S: TryInto<T>,

source§

fn unique_saturated_into(self) -> T

Consume self to return an equivalent value of T.
§

impl<V, T> VZip<V> for Twhere V: MultiLane<T>,

§

fn vzip(self) -> V

source§

impl<T> WithSubscriber for T

source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more
§

impl<T> JsonSchemaMaybe for T

§

impl<T> MaybeDebug for Twhere T: Debug,