mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-06-28 19:07:26 +00:00
002d9260f9
**Update:** Pushed additional changes based on the review comments. **This pull request fixes various spelling mistakes in this repository.** Most of the changes are contained in the first **3** commits: - `Fix spelling mistakes in comments and docs` - `Fix spelling mistakes in test names` - `Fix spelling mistakes in error messages, panic messages, logs and tracing` Other source code spelling mistakes are separated into individual commits for easier reviewing: - `Fix the spelling of 'authority'` - `Fix the spelling of 'REASONABLE_HEADERS_IN_JUSTIFICATION_ANCESTRY'` - `Fix the spelling of 'prev_enqueud_messages'` - `Fix the spelling of 'endpoint'` - `Fix the spelling of 'children'` - `Fix the spelling of 'PenpalSiblingSovereignAccount'` - `Fix the spelling of 'PenpalSudoAccount'` - `Fix the spelling of 'insufficient'` - `Fix the spelling of 'PalletXcmExtrinsicsBenchmark'` - `Fix the spelling of 'subtracted'` - `Fix the spelling of 'CandidatePendingAvailability'` - `Fix the spelling of 'exclusive'` - `Fix the spelling of 'until'` - `Fix the spelling of 'discriminator'` - `Fix the spelling of 'nonexistent'` - `Fix the spelling of 'subsystem'` - `Fix the spelling of 'indices'` - `Fix the spelling of 'committed'` - `Fix the spelling of 'topology'` - `Fix the spelling of 'response'` - `Fix the spelling of 'beneficiary'` - `Fix the spelling of 'formatted'` - `Fix the spelling of 'UNKNOWN_PROOF_REQUEST'` - `Fix the spelling of 'succeeded'` - `Fix the spelling of 'reopened'` - `Fix the spelling of 'proposer'` - `Fix the spelling of 'InstantiationNonce'` - `Fix the spelling of 'depositor'` - `Fix the spelling of 'expiration'` - `Fix the spelling of 'phantom'` - `Fix the spelling of 'AggregatedKeyValue'` - `Fix the spelling of 'randomness'` - `Fix the spelling of 'defendant'` - `Fix the spelling of 'AquaticMammal'` - `Fix the spelling of 'transactions'` - `Fix the spelling of 'PassingTracingSubscriber'` - `Fix the spelling of 'TxSignaturePayload'` - `Fix the spelling of 'versioning'` - `Fix the spelling of 'descendant'` - `Fix the spelling of 'overridden'` - `Fix the spelling of 'network'` Let me know if this structure is adequate. **Note:** The usage of the words `Merkle`, `Merkelize`, `Merklization`, `Merkelization`, `Merkleization`, is somewhat inconsistent but I left it as it is. ~~**Note:** In some places the term `Receival` is used to refer to message reception, IMO `Reception` is the correct word here, but I left it as it is.~~ ~~**Note:** In some places the term `Overlayed` is used instead of the more acceptable version `Overlaid` but I also left it as it is.~~ ~~**Note:** In some places the term `Applyable` is used instead of the correct version `Applicable` but I also left it as it is.~~ **Note:** Some usage of British vs American english e.g. `judgement` vs `judgment`, `initialise` vs `initialize`, `optimise` vs `optimize` etc. are both present in different places, but I suppose that's understandable given the number of contributors. ~~**Note:** There is a spelling mistake in `.github/CODEOWNERS` but it triggers errors in CI when I make changes to it, so I left it as it is.~~
806 lines
24 KiB
Rust
806 lines
24 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 super::{writer, ListOutput, PalletCmd};
|
|
use codec::{Decode, Encode};
|
|
use frame_benchmarking::{
|
|
Analysis, BenchmarkBatch, BenchmarkBatchSplitResults, BenchmarkList, BenchmarkParameter,
|
|
BenchmarkResult, BenchmarkSelector,
|
|
};
|
|
use frame_support::traits::StorageInfo;
|
|
use linked_hash_map::LinkedHashMap;
|
|
use sc_cli::{execution_method_from_cli, CliConfiguration, Result, SharedParams};
|
|
use sc_client_db::BenchmarkingState;
|
|
use sc_executor::{HeapAllocStrategy, WasmExecutor, DEFAULT_HEAP_ALLOC_STRATEGY};
|
|
use sc_service::Configuration;
|
|
use serde::Serialize;
|
|
use sp_core::{
|
|
offchain::{
|
|
testing::{TestOffchainExt, TestTransactionPoolExt},
|
|
OffchainDbExt, OffchainWorkerExt, TransactionPoolExt,
|
|
},
|
|
traits::{CallContext, ReadRuntimeVersionExt},
|
|
};
|
|
use sp_externalities::Extensions;
|
|
use sp_keystore::{testing::MemoryKeystore, KeystoreExt};
|
|
use sp_runtime::traits::Hash;
|
|
use sp_state_machine::StateMachine;
|
|
use std::{
|
|
collections::{BTreeMap, BTreeSet, HashMap},
|
|
fmt::Debug,
|
|
fs,
|
|
str::FromStr,
|
|
time,
|
|
};
|
|
|
|
/// Logging target
|
|
const LOG_TARGET: &'static str = "frame::benchmark::pallet";
|
|
|
|
/// The inclusive range of a component.
|
|
#[derive(Serialize, Debug, Clone, Eq, PartialEq)]
|
|
pub(crate) struct ComponentRange {
|
|
/// Name of the component.
|
|
name: String,
|
|
/// Minimal valid value of the component.
|
|
min: u32,
|
|
/// Maximal valid value of the component.
|
|
max: u32,
|
|
}
|
|
|
|
/// How the PoV size of a storage item should be estimated.
|
|
#[derive(clap::ValueEnum, Debug, Eq, PartialEq, Clone, Copy)]
|
|
pub enum PovEstimationMode {
|
|
/// Use the maximal encoded length as provided by [`codec::MaxEncodedLen`].
|
|
MaxEncodedLen,
|
|
/// Measure the accessed value size in the pallet benchmarking and add some trie overhead.
|
|
Measured,
|
|
/// Do not estimate the PoV size for this storage item or benchmark.
|
|
Ignored,
|
|
}
|
|
|
|
impl FromStr for PovEstimationMode {
|
|
type Err = &'static str;
|
|
|
|
fn from_str(s: &str) -> std::result::Result<Self, Self::Err> {
|
|
match s {
|
|
"MaxEncodedLen" => Ok(Self::MaxEncodedLen),
|
|
"Measured" => Ok(Self::Measured),
|
|
"Ignored" => Ok(Self::Ignored),
|
|
_ => unreachable!("The benchmark! macro should have prevented this"),
|
|
}
|
|
}
|
|
}
|
|
|
|
/// Maps (pallet, benchmark) -> ((pallet, storage) -> PovEstimationMode)
|
|
pub(crate) type PovModesMap =
|
|
HashMap<(Vec<u8>, Vec<u8>), HashMap<(String, String), PovEstimationMode>>;
|
|
|
|
// This takes multiple benchmark batches and combines all the results where the pallet, instance,
|
|
// and benchmark are the same.
|
|
fn combine_batches(
|
|
time_batches: Vec<BenchmarkBatch>,
|
|
db_batches: Vec<BenchmarkBatch>,
|
|
) -> Vec<BenchmarkBatchSplitResults> {
|
|
if time_batches.is_empty() && db_batches.is_empty() {
|
|
return Default::default()
|
|
}
|
|
|
|
let mut all_benchmarks =
|
|
LinkedHashMap::<_, (Vec<BenchmarkResult>, Vec<BenchmarkResult>)>::new();
|
|
|
|
db_batches
|
|
.into_iter()
|
|
.for_each(|BenchmarkBatch { pallet, instance, benchmark, results }| {
|
|
// We use this key to uniquely identify a benchmark among batches.
|
|
let key = (pallet, instance, benchmark);
|
|
|
|
match all_benchmarks.get_mut(&key) {
|
|
// We already have this benchmark, so we extend the results.
|
|
Some(x) => x.1.extend(results),
|
|
// New benchmark, so we add a new entry with the initial results.
|
|
None => {
|
|
all_benchmarks.insert(key, (Vec::new(), results));
|
|
},
|
|
}
|
|
});
|
|
|
|
time_batches
|
|
.into_iter()
|
|
.for_each(|BenchmarkBatch { pallet, instance, benchmark, results }| {
|
|
// We use this key to uniquely identify a benchmark among batches.
|
|
let key = (pallet, instance, benchmark);
|
|
|
|
match all_benchmarks.get_mut(&key) {
|
|
// We already have this benchmark, so we extend the results.
|
|
Some(x) => x.0.extend(results),
|
|
None => panic!("all benchmark keys should have been populated by db batches"),
|
|
}
|
|
});
|
|
|
|
all_benchmarks
|
|
.into_iter()
|
|
.map(|((pallet, instance, benchmark), (time_results, db_results))| {
|
|
BenchmarkBatchSplitResults { pallet, instance, benchmark, time_results, db_results }
|
|
})
|
|
.collect::<Vec<_>>()
|
|
}
|
|
|
|
/// Explains possible reasons why the metadata for the benchmarking could not be found.
|
|
const ERROR_METADATA_NOT_FOUND: &'static str = "Did not find the benchmarking metadata. \
|
|
This could mean that you either did not build the node correctly with the \
|
|
`--features runtime-benchmarks` flag, or the chain spec that you are using was \
|
|
not created by a node that was compiled with the flag";
|
|
|
|
impl PalletCmd {
|
|
/// Runs the command and benchmarks a pallet.
|
|
pub fn run<Hasher, ExtraHostFunctions>(&self, config: Configuration) -> Result<()>
|
|
where
|
|
Hasher: Hash,
|
|
ExtraHostFunctions: sp_wasm_interface::HostFunctions,
|
|
{
|
|
let _d = self.execution.as_ref().map(|exec| {
|
|
// We print the warning at the end, since there is often A LOT of output.
|
|
sp_core::defer::DeferGuard::new(move || {
|
|
log::warn!(
|
|
target: LOG_TARGET,
|
|
"⚠️ Argument `--execution` is deprecated. Its value of `{exec}` has on effect.",
|
|
)
|
|
})
|
|
});
|
|
|
|
if let Some(output_path) = &self.output {
|
|
if !output_path.is_dir() && output_path.file_name().is_none() {
|
|
return Err("Output file or path is invalid!".into())
|
|
}
|
|
}
|
|
|
|
if let Some(header_file) = &self.header {
|
|
if !header_file.is_file() {
|
|
return Err("Header file is invalid!".into())
|
|
};
|
|
}
|
|
|
|
if let Some(handlebars_template_file) = &self.template {
|
|
if !handlebars_template_file.is_file() {
|
|
return Err("Handlebars template file is invalid!".into())
|
|
};
|
|
}
|
|
|
|
if let Some(json_input) = &self.json_input {
|
|
let raw_data = match std::fs::read(json_input) {
|
|
Ok(raw_data) => raw_data,
|
|
Err(error) =>
|
|
return Err(format!("Failed to read {:?}: {}", json_input, error).into()),
|
|
};
|
|
let batches: Vec<BenchmarkBatchSplitResults> = match serde_json::from_slice(&raw_data) {
|
|
Ok(batches) => batches,
|
|
Err(error) =>
|
|
return Err(format!("Failed to deserialize {:?}: {}", json_input, error).into()),
|
|
};
|
|
return self.output_from_results(&batches)
|
|
}
|
|
|
|
let spec = config.chain_spec;
|
|
let pallet = self.pallet.clone().unwrap_or_default();
|
|
let pallet = pallet.as_bytes();
|
|
|
|
let extrinsic = self.extrinsic.clone().unwrap_or_default();
|
|
let extrinsic_split: Vec<&str> = extrinsic.split(',').collect();
|
|
let extrinsics: Vec<_> = extrinsic_split.iter().map(|x| x.trim().as_bytes()).collect();
|
|
|
|
let genesis_storage = spec.build_storage()?;
|
|
let mut changes = Default::default();
|
|
let cache_size = Some(self.database_cache_size as usize);
|
|
let state_with_tracking = BenchmarkingState::<Hasher>::new(
|
|
genesis_storage.clone(),
|
|
cache_size,
|
|
// Record proof size
|
|
true,
|
|
// Enable storage tracking
|
|
true,
|
|
)?;
|
|
let state_without_tracking = BenchmarkingState::<Hasher>::new(
|
|
genesis_storage,
|
|
cache_size,
|
|
// Do not record proof size
|
|
false,
|
|
// Do not enable storage tracking
|
|
false,
|
|
)?;
|
|
|
|
let method =
|
|
execution_method_from_cli(self.wasm_method, self.wasmtime_instantiation_strategy);
|
|
|
|
let heap_pages =
|
|
self.heap_pages
|
|
.map_or(DEFAULT_HEAP_ALLOC_STRATEGY, |p| HeapAllocStrategy::Static {
|
|
extra_pages: p as _,
|
|
});
|
|
|
|
let executor = WasmExecutor::<(
|
|
sp_io::SubstrateHostFunctions,
|
|
frame_benchmarking::benchmarking::HostFunctions,
|
|
ExtraHostFunctions,
|
|
)>::builder()
|
|
.with_execution_method(method)
|
|
.with_onchain_heap_alloc_strategy(heap_pages)
|
|
.with_offchain_heap_alloc_strategy(heap_pages)
|
|
.with_max_runtime_instances(2)
|
|
.with_runtime_cache_size(2)
|
|
.build();
|
|
|
|
let extensions = || -> Extensions {
|
|
let mut extensions = Extensions::default();
|
|
let (offchain, _) = TestOffchainExt::new();
|
|
let (pool, _) = TestTransactionPoolExt::new();
|
|
let keystore = MemoryKeystore::new();
|
|
extensions.register(KeystoreExt::new(keystore));
|
|
extensions.register(OffchainWorkerExt::new(offchain.clone()));
|
|
extensions.register(OffchainDbExt::new(offchain));
|
|
extensions.register(TransactionPoolExt::new(pool));
|
|
extensions.register(ReadRuntimeVersionExt::new(executor.clone()));
|
|
extensions
|
|
};
|
|
|
|
// Get Benchmark List
|
|
let state = &state_without_tracking;
|
|
let result = StateMachine::new(
|
|
state,
|
|
&mut changes,
|
|
&executor,
|
|
"Benchmark_benchmark_metadata",
|
|
&(self.extra).encode(),
|
|
&mut extensions(),
|
|
&sp_state_machine::backend::BackendRuntimeCode::new(state).runtime_code()?,
|
|
CallContext::Offchain,
|
|
)
|
|
.execute()
|
|
.map_err(|e| format!("{}: {}", ERROR_METADATA_NOT_FOUND, e))?;
|
|
|
|
let (list, storage_info) =
|
|
<(Vec<BenchmarkList>, Vec<StorageInfo>) as Decode>::decode(&mut &result[..])
|
|
.map_err(|e| format!("Failed to decode benchmark metadata: {:?}", e))?;
|
|
|
|
// Use the benchmark list and the user input to determine the set of benchmarks to run.
|
|
let mut benchmarks_to_run = Vec::new();
|
|
list.iter()
|
|
.filter(|item| pallet.is_empty() || pallet == &b"*"[..] || pallet == &item.pallet[..])
|
|
.for_each(|item| {
|
|
for benchmark in &item.benchmarks {
|
|
let benchmark_name = &benchmark.name;
|
|
if extrinsic.is_empty() ||
|
|
extrinsic.as_bytes() == &b"*"[..] ||
|
|
extrinsics.contains(&&benchmark_name[..])
|
|
{
|
|
benchmarks_to_run.push((
|
|
item.pallet.clone(),
|
|
benchmark.name.clone(),
|
|
benchmark.components.clone(),
|
|
benchmark.pov_modes.clone(),
|
|
))
|
|
}
|
|
}
|
|
});
|
|
// Convert `Vec<u8>` to `String` for better readability.
|
|
let benchmarks_to_run: Vec<_> = benchmarks_to_run
|
|
.into_iter()
|
|
.map(|(pallet, extrinsic, components, pov_modes)| {
|
|
let pallet_name =
|
|
String::from_utf8(pallet.clone()).expect("Encoded from String; qed");
|
|
let extrinsic_name =
|
|
String::from_utf8(extrinsic.clone()).expect("Encoded from String; qed");
|
|
(
|
|
pallet,
|
|
extrinsic,
|
|
components,
|
|
pov_modes
|
|
.into_iter()
|
|
.map(|(p, s)| {
|
|
(String::from_utf8(p).unwrap(), String::from_utf8(s).unwrap())
|
|
})
|
|
.collect(),
|
|
pallet_name,
|
|
extrinsic_name,
|
|
)
|
|
})
|
|
.collect();
|
|
|
|
if benchmarks_to_run.is_empty() {
|
|
return Err("No benchmarks found which match your input.".into())
|
|
}
|
|
|
|
if let Some(list_output) = self.list {
|
|
list_benchmark(benchmarks_to_run, list_output, self.no_csv_header);
|
|
return Ok(())
|
|
}
|
|
|
|
// Run the benchmarks
|
|
let mut batches = Vec::new();
|
|
let mut batches_db = Vec::new();
|
|
let mut timer = time::SystemTime::now();
|
|
// Maps (pallet, extrinsic) to its component ranges.
|
|
let mut component_ranges = HashMap::<(Vec<u8>, Vec<u8>), Vec<ComponentRange>>::new();
|
|
let pov_modes = Self::parse_pov_modes(&benchmarks_to_run)?;
|
|
|
|
for (pallet, extrinsic, components, _, pallet_name, extrinsic_name) in
|
|
benchmarks_to_run.clone()
|
|
{
|
|
log::info!(
|
|
target: LOG_TARGET,
|
|
"Starting benchmark: {pallet_name}::{extrinsic_name}"
|
|
);
|
|
let all_components = if components.is_empty() {
|
|
vec![Default::default()]
|
|
} else {
|
|
let mut all_components = Vec::new();
|
|
for (idx, (name, low, high)) in components.iter().enumerate() {
|
|
let lowest = self.lowest_range_values.get(idx).cloned().unwrap_or(*low);
|
|
let highest = self.highest_range_values.get(idx).cloned().unwrap_or(*high);
|
|
|
|
let diff =
|
|
highest.checked_sub(lowest).ok_or("`low` cannot be higher than `high`")?;
|
|
|
|
// The slope logic needs at least two points
|
|
// to compute a slope.
|
|
if self.steps < 2 {
|
|
return Err("`steps` must be at least 2.".into())
|
|
}
|
|
|
|
let step_size = (diff as f32 / (self.steps - 1) as f32).max(0.0);
|
|
|
|
for s in 0..self.steps {
|
|
// This is the value we will be testing for component `name`
|
|
let component_value =
|
|
((lowest as f32 + step_size * s as f32) as u32).clamp(lowest, highest);
|
|
|
|
// Select the max value for all the other components.
|
|
let c: Vec<(BenchmarkParameter, u32)> = components
|
|
.iter()
|
|
.enumerate()
|
|
.map(|(idx, (n, _, h))| {
|
|
if n == name {
|
|
(*n, component_value)
|
|
} else {
|
|
(*n, *self.highest_range_values.get(idx).unwrap_or(h))
|
|
}
|
|
})
|
|
.collect();
|
|
all_components.push(c);
|
|
}
|
|
|
|
component_ranges
|
|
.entry((pallet.clone(), extrinsic.clone()))
|
|
.or_default()
|
|
.push(ComponentRange { name: name.to_string(), min: lowest, max: highest });
|
|
}
|
|
all_components
|
|
};
|
|
for (s, selected_components) in all_components.iter().enumerate() {
|
|
// First we run a verification
|
|
if !self.no_verify {
|
|
let state = &state_without_tracking;
|
|
let result = StateMachine::new(
|
|
state,
|
|
&mut changes,
|
|
&executor,
|
|
"Benchmark_dispatch_benchmark",
|
|
&(
|
|
&pallet,
|
|
&extrinsic,
|
|
&selected_components.clone(),
|
|
true, // run verification code
|
|
1, // no need to do internal repeats
|
|
)
|
|
.encode(),
|
|
&mut extensions(),
|
|
&sp_state_machine::backend::BackendRuntimeCode::new(state)
|
|
.runtime_code()?,
|
|
CallContext::Offchain,
|
|
)
|
|
.execute()
|
|
.map_err(|e| {
|
|
format!("Error executing and verifying runtime benchmark: {}", e)
|
|
})?;
|
|
// Don't use these results since verification code will add overhead.
|
|
let _batch =
|
|
<std::result::Result<Vec<BenchmarkBatch>, String> as Decode>::decode(
|
|
&mut &result[..],
|
|
)
|
|
.map_err(|e| format!("Failed to decode benchmark results: {:?}", e))?
|
|
.map_err(|e| {
|
|
format!("Benchmark {pallet_name}::{extrinsic_name} failed: {e}",)
|
|
})?;
|
|
}
|
|
// Do one loop of DB tracking.
|
|
{
|
|
let state = &state_with_tracking;
|
|
let result = StateMachine::new(
|
|
state, // todo remove tracking
|
|
&mut changes,
|
|
&executor,
|
|
"Benchmark_dispatch_benchmark",
|
|
&(
|
|
&pallet.clone(),
|
|
&extrinsic.clone(),
|
|
&selected_components.clone(),
|
|
false, // don't run verification code for final values
|
|
self.repeat,
|
|
)
|
|
.encode(),
|
|
&mut extensions(),
|
|
&sp_state_machine::backend::BackendRuntimeCode::new(state)
|
|
.runtime_code()?,
|
|
CallContext::Offchain,
|
|
)
|
|
.execute()
|
|
.map_err(|e| format!("Error executing runtime benchmark: {}", e))?;
|
|
|
|
let batch =
|
|
<std::result::Result<Vec<BenchmarkBatch>, String> as Decode>::decode(
|
|
&mut &result[..],
|
|
)
|
|
.map_err(|e| format!("Failed to decode benchmark results: {:?}", e))??;
|
|
|
|
batches_db.extend(batch);
|
|
}
|
|
// Finally run a bunch of loops to get extrinsic timing information.
|
|
for r in 0..self.external_repeat {
|
|
let state = &state_without_tracking;
|
|
let result = StateMachine::new(
|
|
state, // todo remove tracking
|
|
&mut changes,
|
|
&executor,
|
|
"Benchmark_dispatch_benchmark",
|
|
&(
|
|
&pallet.clone(),
|
|
&extrinsic.clone(),
|
|
&selected_components.clone(),
|
|
false, // don't run verification code for final values
|
|
self.repeat,
|
|
)
|
|
.encode(),
|
|
&mut extensions(),
|
|
&sp_state_machine::backend::BackendRuntimeCode::new(state)
|
|
.runtime_code()?,
|
|
CallContext::Offchain,
|
|
)
|
|
.execute()
|
|
.map_err(|e| format!("Error executing runtime benchmark: {}", e))?;
|
|
|
|
let batch =
|
|
<std::result::Result<Vec<BenchmarkBatch>, String> as Decode>::decode(
|
|
&mut &result[..],
|
|
)
|
|
.map_err(|e| format!("Failed to decode benchmark results: {:?}", e))??;
|
|
|
|
batches.extend(batch);
|
|
|
|
// Show progress information
|
|
if let Ok(elapsed) = timer.elapsed() {
|
|
if elapsed >= time::Duration::from_secs(5) {
|
|
timer = time::SystemTime::now();
|
|
|
|
log::info!(
|
|
target: LOG_TARGET,
|
|
"Running benchmark: {pallet_name}::{extrinsic_name}({} args) {}/{} {}/{}",
|
|
components.len(),
|
|
s + 1, // s starts at 0.
|
|
all_components.len(),
|
|
r + 1,
|
|
self.external_repeat,
|
|
);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
// Combine all of the benchmark results, so that benchmarks of the same pallet/function
|
|
// are together.
|
|
let batches = combine_batches(batches, batches_db);
|
|
self.output(&batches, &storage_info, &component_ranges, pov_modes)
|
|
}
|
|
|
|
fn output(
|
|
&self,
|
|
batches: &[BenchmarkBatchSplitResults],
|
|
storage_info: &[StorageInfo],
|
|
component_ranges: &HashMap<(Vec<u8>, Vec<u8>), Vec<ComponentRange>>,
|
|
pov_modes: PovModesMap,
|
|
) -> Result<()> {
|
|
// Jsonify the result and write it to a file or stdout if desired.
|
|
if !self.jsonify(&batches)? {
|
|
// Print the summary only if `jsonify` did not write to stdout.
|
|
self.print_summary(&batches, &storage_info, pov_modes.clone())
|
|
}
|
|
|
|
// Create the weights.rs file.
|
|
if let Some(output_path) = &self.output {
|
|
writer::write_results(
|
|
&batches,
|
|
&storage_info,
|
|
&component_ranges,
|
|
pov_modes,
|
|
self.default_pov_mode,
|
|
output_path,
|
|
self,
|
|
)?;
|
|
}
|
|
|
|
Ok(())
|
|
}
|
|
|
|
/// Re-analyze a batch historic benchmark timing data. Will not take the PoV into account.
|
|
fn output_from_results(&self, batches: &[BenchmarkBatchSplitResults]) -> Result<()> {
|
|
let mut component_ranges =
|
|
HashMap::<(Vec<u8>, Vec<u8>), HashMap<String, (u32, u32)>>::new();
|
|
for batch in batches {
|
|
let range = component_ranges
|
|
.entry((batch.pallet.clone(), batch.benchmark.clone()))
|
|
.or_default();
|
|
for result in &batch.time_results {
|
|
for (param, value) in &result.components {
|
|
let name = param.to_string();
|
|
let (ref mut min, ref mut max) = range.entry(name).or_insert((*value, *value));
|
|
if *value < *min {
|
|
*min = *value;
|
|
}
|
|
if *value > *max {
|
|
*max = *value;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
let component_ranges: HashMap<_, _> = component_ranges
|
|
.into_iter()
|
|
.map(|(key, ranges)| {
|
|
let ranges = ranges
|
|
.into_iter()
|
|
.map(|(name, (min, max))| ComponentRange { name, min, max })
|
|
.collect();
|
|
(key, ranges)
|
|
})
|
|
.collect();
|
|
|
|
self.output(batches, &[], &component_ranges, Default::default())
|
|
}
|
|
|
|
/// Jsonifies the passed batches and writes them to stdout or into a file.
|
|
/// Can be configured via `--json` and `--json-file`.
|
|
/// Returns whether it wrote to stdout.
|
|
fn jsonify(&self, batches: &[BenchmarkBatchSplitResults]) -> Result<bool> {
|
|
if self.json_output || self.json_file.is_some() {
|
|
let json = serde_json::to_string_pretty(&batches)
|
|
.map_err(|e| format!("Serializing into JSON: {:?}", e))?;
|
|
|
|
if let Some(path) = &self.json_file {
|
|
fs::write(path, json)?;
|
|
} else {
|
|
print!("{json}");
|
|
return Ok(true)
|
|
}
|
|
}
|
|
|
|
Ok(false)
|
|
}
|
|
|
|
/// Prints the results as human-readable summary without raw timing data.
|
|
fn print_summary(
|
|
&self,
|
|
batches: &[BenchmarkBatchSplitResults],
|
|
storage_info: &[StorageInfo],
|
|
pov_modes: PovModesMap,
|
|
) {
|
|
for batch in batches.iter() {
|
|
// Print benchmark metadata
|
|
println!(
|
|
"Pallet: {:?}, Extrinsic: {:?}, Lowest values: {:?}, Highest values: {:?}, Steps: {:?}, Repeat: {:?}",
|
|
String::from_utf8(batch.pallet.clone()).expect("Encoded from String; qed"),
|
|
String::from_utf8(batch.benchmark.clone()).expect("Encoded from String; qed"),
|
|
self.lowest_range_values,
|
|
self.highest_range_values,
|
|
self.steps,
|
|
self.repeat,
|
|
);
|
|
|
|
// Skip raw data + analysis if there are no results
|
|
if batch.time_results.is_empty() {
|
|
continue
|
|
}
|
|
|
|
if !self.no_storage_info {
|
|
let mut storage_per_prefix = HashMap::<Vec<u8>, Vec<BenchmarkResult>>::new();
|
|
let pov_mode = pov_modes
|
|
.get(&(batch.pallet.clone(), batch.benchmark.clone()))
|
|
.cloned()
|
|
.unwrap_or_default();
|
|
|
|
let comments = writer::process_storage_results(
|
|
&mut storage_per_prefix,
|
|
&batch.db_results,
|
|
storage_info,
|
|
&pov_mode,
|
|
self.default_pov_mode,
|
|
self.worst_case_map_values,
|
|
self.additional_trie_layers,
|
|
);
|
|
println!("Raw Storage Info\n========");
|
|
for comment in comments {
|
|
println!("{}", comment);
|
|
}
|
|
println!();
|
|
}
|
|
|
|
// Conduct analysis.
|
|
if !self.no_median_slopes {
|
|
println!("Median Slopes Analysis\n========");
|
|
if let Some(analysis) =
|
|
Analysis::median_slopes(&batch.time_results, BenchmarkSelector::ExtrinsicTime)
|
|
{
|
|
println!("-- Extrinsic Time --\n{}", analysis);
|
|
}
|
|
if let Some(analysis) =
|
|
Analysis::median_slopes(&batch.db_results, BenchmarkSelector::Reads)
|
|
{
|
|
println!("Reads = {:?}", analysis);
|
|
}
|
|
if let Some(analysis) =
|
|
Analysis::median_slopes(&batch.db_results, BenchmarkSelector::Writes)
|
|
{
|
|
println!("Writes = {:?}", analysis);
|
|
}
|
|
if let Some(analysis) =
|
|
Analysis::median_slopes(&batch.db_results, BenchmarkSelector::ProofSize)
|
|
{
|
|
println!("Recorded proof Size = {:?}", analysis);
|
|
}
|
|
println!();
|
|
}
|
|
if !self.no_min_squares {
|
|
println!("Min Squares Analysis\n========");
|
|
if let Some(analysis) =
|
|
Analysis::min_squares_iqr(&batch.time_results, BenchmarkSelector::ExtrinsicTime)
|
|
{
|
|
println!("-- Extrinsic Time --\n{}", analysis);
|
|
}
|
|
if let Some(analysis) =
|
|
Analysis::min_squares_iqr(&batch.db_results, BenchmarkSelector::Reads)
|
|
{
|
|
println!("Reads = {:?}", analysis);
|
|
}
|
|
if let Some(analysis) =
|
|
Analysis::min_squares_iqr(&batch.db_results, BenchmarkSelector::Writes)
|
|
{
|
|
println!("Writes = {:?}", analysis);
|
|
}
|
|
if let Some(analysis) =
|
|
Analysis::min_squares_iqr(&batch.db_results, BenchmarkSelector::ProofSize)
|
|
{
|
|
println!("Recorded proof Size = {:?}", analysis);
|
|
}
|
|
println!();
|
|
}
|
|
}
|
|
}
|
|
|
|
/// Parses the PoV modes per benchmark that were specified by the `#[pov_mode]` attribute.
|
|
fn parse_pov_modes(
|
|
benchmarks: &Vec<(
|
|
Vec<u8>,
|
|
Vec<u8>,
|
|
Vec<(BenchmarkParameter, u32, u32)>,
|
|
Vec<(String, String)>,
|
|
String,
|
|
String,
|
|
)>,
|
|
) -> Result<PovModesMap> {
|
|
use std::collections::hash_map::Entry;
|
|
let mut parsed = PovModesMap::new();
|
|
|
|
for (pallet, call, _components, pov_modes, _, _) in benchmarks {
|
|
for (pallet_storage, mode) in pov_modes {
|
|
let mode = PovEstimationMode::from_str(&mode)?;
|
|
let splits = pallet_storage.split("::").collect::<Vec<_>>();
|
|
if splits.is_empty() || splits.len() > 2 {
|
|
return Err(format!(
|
|
"Expected 'Pallet::Storage' as storage name but got: {}",
|
|
pallet_storage
|
|
)
|
|
.into())
|
|
}
|
|
let (pov_pallet, pov_storage) = (splits[0], splits.get(1).unwrap_or(&"ALL"));
|
|
|
|
match parsed
|
|
.entry((pallet.clone(), call.clone()))
|
|
.or_default()
|
|
.entry((pov_pallet.to_string(), pov_storage.to_string()))
|
|
{
|
|
Entry::Occupied(_) =>
|
|
return Err(format!(
|
|
"Cannot specify pov_mode tag twice for the same key: {}",
|
|
pallet_storage
|
|
)
|
|
.into()),
|
|
Entry::Vacant(e) => {
|
|
e.insert(mode);
|
|
},
|
|
}
|
|
}
|
|
}
|
|
Ok(parsed)
|
|
}
|
|
}
|
|
|
|
impl CliConfiguration for PalletCmd {
|
|
fn shared_params(&self) -> &SharedParams {
|
|
&self.shared_params
|
|
}
|
|
|
|
fn chain_id(&self, _is_dev: bool) -> Result<String> {
|
|
Ok(match self.shared_params.chain {
|
|
Some(ref chain) => chain.clone(),
|
|
None => "dev".into(),
|
|
})
|
|
}
|
|
}
|
|
|
|
/// List the benchmarks available in the runtime, in a CSV friendly format.
|
|
fn list_benchmark(
|
|
benchmarks_to_run: Vec<(
|
|
Vec<u8>,
|
|
Vec<u8>,
|
|
Vec<(BenchmarkParameter, u32, u32)>,
|
|
Vec<(String, String)>,
|
|
String,
|
|
String,
|
|
)>,
|
|
list_output: ListOutput,
|
|
no_csv_header: bool,
|
|
) {
|
|
let mut benchmarks = BTreeMap::new();
|
|
|
|
// Sort and de-dub by pallet and function name.
|
|
benchmarks_to_run.iter().for_each(|(_, _, _, _, pallet_name, extrinsic_name)| {
|
|
benchmarks
|
|
.entry(pallet_name)
|
|
.or_insert_with(BTreeSet::new)
|
|
.insert(extrinsic_name);
|
|
});
|
|
|
|
match list_output {
|
|
ListOutput::All => {
|
|
if !no_csv_header {
|
|
println!("pallet,extrinsic");
|
|
}
|
|
for (pallet, extrinsics) in benchmarks {
|
|
for extrinsic in extrinsics {
|
|
println!("{pallet},{extrinsic}");
|
|
}
|
|
}
|
|
},
|
|
ListOutput::Pallets => {
|
|
if !no_csv_header {
|
|
println!("pallet");
|
|
};
|
|
for pallet in benchmarks.keys() {
|
|
println!("{pallet}");
|
|
}
|
|
},
|
|
}
|
|
}
|