mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-04-27 10:27:59 +00:00
Koute
f8e3bdad3d
* Rework storage iterators * Make sure storage iteration is also accounted for when benchmarking * Use `trie-db` from crates.io * Appease clippy * Bump `trie-bench` to 0.35.0 * Fix tests' compilation * Update comment to clarify how `IterArgs::start_at` works * Add extra tests * Fix iterators on `Client` so that they behave as before * Add extra `unwrap`s in tests * More clippy fixes * Come on clippy, give me a break already * Rename `allow_missing` to `stop_on_incomplete_database` * Add `#[inline]` to `with_recorder_and_cache` * Use `with_recorder_and_cache` in `with_trie_db`; add doc comment * Simplify code: use `with_trie_db` in `next_storage_key_from_root` * Remove `expect`s in the benchmarking CLI * Add extra doc comments * Move `RawIter` before `TrieBackendEssence` (no code changes; just cut-paste) * Remove a TODO in tests * Update comment for `StorageIterator::was_complete` * Update `trie-db` to 0.25.1
88 lines
2.8 KiB
Rust
88 lines
2.8 KiB
Rust
// This file is part of Substrate.
|
|
|
|
// Copyright (C) Parity Technologies (UK) Ltd.
|
|
// SPDX-License-Identifier: Apache-2.0
|
|
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
|
|
use sc_cli::Result;
|
|
use sc_client_api::{Backend as ClientBackend, StorageProvider, UsageProvider};
|
|
use sp_runtime::traits::{Block as BlockT, Header as HeaderT};
|
|
|
|
use log::info;
|
|
use rand::prelude::*;
|
|
use std::{fmt::Debug, sync::Arc, time::Instant};
|
|
|
|
use super::cmd::StorageCmd;
|
|
use crate::shared::{new_rng, BenchRecord};
|
|
|
|
impl StorageCmd {
|
|
/// Benchmarks the time it takes to read a single Storage item.
|
|
/// Uses the latest state that is available for the given client.
|
|
pub(crate) fn bench_read<B, BA, C>(&self, client: Arc<C>) -> Result<BenchRecord>
|
|
where
|
|
C: UsageProvider<B> + StorageProvider<B, BA>,
|
|
B: BlockT + Debug,
|
|
BA: ClientBackend<B>,
|
|
<<B as BlockT>::Header as HeaderT>::Number: From<u32>,
|
|
{
|
|
let mut record = BenchRecord::default();
|
|
let best_hash = client.usage_info().chain.best_hash;
|
|
|
|
info!("Preparing keys from block {}", best_hash);
|
|
// Load all keys and randomly shuffle them.
|
|
let mut keys: Vec<_> = client.storage_keys(best_hash, None, None)?.collect();
|
|
let (mut rng, _) = new_rng(None);
|
|
keys.shuffle(&mut rng);
|
|
|
|
let mut child_nodes = Vec::new();
|
|
// Interesting part here:
|
|
// Read all the keys in the database and measure the time it takes to access each.
|
|
info!("Reading {} keys", keys.len());
|
|
for key in keys.as_slice() {
|
|
match (self.params.include_child_trees, self.is_child_key(key.clone().0)) {
|
|
(true, Some(info)) => {
|
|
// child tree key
|
|
for ck in client.child_storage_keys(best_hash, info.clone(), None, None)? {
|
|
child_nodes.push((ck.clone(), info.clone()));
|
|
}
|
|
},
|
|
_ => {
|
|
// regular key
|
|
let start = Instant::now();
|
|
let v = client
|
|
.storage(best_hash, &key)
|
|
.expect("Checked above to exist")
|
|
.ok_or("Value unexpectedly empty")?;
|
|
record.append(v.0.len(), start.elapsed())?;
|
|
},
|
|
}
|
|
}
|
|
|
|
if self.params.include_child_trees {
|
|
child_nodes.shuffle(&mut rng);
|
|
|
|
info!("Reading {} child keys", child_nodes.len());
|
|
for (key, info) in child_nodes.as_slice() {
|
|
let start = Instant::now();
|
|
let v = client
|
|
.child_storage(best_hash, info, key)
|
|
.expect("Checked above to exist")
|
|
.ok_or("Value unexpectedly empty")?;
|
|
record.append(v.0.len(), start.elapsed())?;
|
|
}
|
|
}
|
|
Ok(record)
|
|
}
|
|
}
|