Struct account_state::backend::Proving

pub struct Proving<H> { /* fields omitted */ }

Proving state backend. This keeps track of all state values loaded during usage of this backend. The proof-of-execution can be extracted with extract_proof.

This doesn’t cache anything or rely on the canonical state caches.

Implementations

impl<H: AsHashDB<KeccakHasher, DBValue>> Proving<H>

pub fn new(base: H) -> Self

Create a new Proving over a base database. This will store all values ever fetched from that base.

pub fn extract_proof(self) -> Vec<DBValue>

Consume the backend, extracting the gathered proof in lexicographical order by value.

Trait Implementations

impl<AH: AsHashDB<KeccakHasher, DBValue> + Send + Sync> AsHashDB<KeccakHasher, Vec<u8, Global>> for Proving<AH>

fn as_hash_db(&self) -> &dyn HashDB<KeccakHasher, DBValue>

Perform upcast to HashDB for anything that derives from HashDB.

fn as_hash_db_mut(&mut self) -> &mut dyn HashDB<KeccakHasher, DBValue>

Perform mutable upcast to HashDB for anything that derives from HashDB.

impl<H: AsHashDB<KeccakHasher, DBValue> + Send + Sync> Backend for Proving<H>

fn as_hash_db(&self) -> &dyn HashDB<KeccakHasher, DBValue>

Treat the backend as a read-only hashdb.

fn as_hash_db_mut(&mut self) -> &mut dyn HashDB<KeccakHasher, DBValue>

Treat the backend as a writeable hashdb.

fn add_to_account_cache(&mut self, _: Address, _: Option<Account>, _: bool)

Add an account entry to the cache.

fn cache_code(&self, _: H256, _: Arc<Vec<u8>>)

Add a global code cache entry. This doesn’t need to worry about canonicality because it simply maps hashes to raw code and will always be correct in the absence of hash collisions.

fn get_cached_account(&self, _: &Address) -> Option<Option<Account>>

Get basic copy of the cached account. Not required to include storage. Returns ‘None’ if cache is disabled or if the account is not cached.

fn get_cached<F, U>(&self, _: &Address, _: F) -> Option<U> where
    F: FnOnce(Option<&mut Account>) -> U, 

Get value from a cached account. None is passed to the closure if the account entry cached is known not to exist. None is returned if the entry is not cached.

fn get_cached_code(&self, _: &H256) -> Option<Arc<Vec<u8>>>

Get cached code based on hash.

fn note_non_null_account(&self, _: &Address)

Note that an account with the given address is non-null.

fn is_known_null(&self, _: &Address) -> bool

Check whether an account is known to be empty. Returns true if known to be empty, false otherwise.

impl<H: AsHashDB<KeccakHasher, DBValue> + Clone> Clone for Proving<H>

fn clone(&self) -> Self

Returns a copy of the value.

pub fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<H: AsHashDB<KeccakHasher, DBValue> + Send + Sync> HashDB<KeccakHasher, Vec<u8, Global>> for Proving<H>

fn get(&self, key: &H256, prefix: Prefix<'_>) -> Option<DBValue>

Look up a given hash into the bytes that hash to it, returning None if the hash is not known.

fn contains(&self, key: &H256, prefix: Prefix<'_>) -> bool

Check for the existence of a hash-key.

fn insert(&mut self, prefix: Prefix<'_>, value: &[u8]) -> H256

Insert a datum item into the DB and return the datum’s hash for a later lookup. Insertions are counted and the equivalent number of remove()s must be performed before the data is considered dead.

fn emplace(&mut self, key: H256, prefix: Prefix<'_>, value: DBValue)

Like insert(), except you provide the key and the data is all moved.

fn remove(&mut self, key: &H256, prefix: Prefix<'_>)

Remove a datum previously inserted. Insertions can be “owed” such that the same number of insert()s may happen without the data being eventually being inserted into the DB. It can be “owed” more than once.