mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-04-26 15:47:58 +00:00
2675741a09
* Lol * Yeah * Moare * adaasda * Convert AURA to new pallet macro * AURA: Switch to `CurrentSlot` instead of `LastTimestamp` This switches AURA to use `CurrentSlot` instead of `LastTimestamp`. * Add missing file * Update frame/aura/src/migrations.rs Co-authored-by: André Silva <123550+andresilva@users.noreply.github.com> * Remove the runtime side provide inherent code * Use correct weight * Add TODO * Remove the Inherent from AURA * 🤦 * Remove unused stuff * Update primitives authorship * Fix babe inherent data provider * Fix consensus-uncles * Fix BABE * Do some further changes to authorship primitives... :D * More work * Make it compile the happy path * Make it async! * Take hash * More stuff * Hacks * Revert "Hacks" This reverts commit cfffad88668cfdebf632a59c4fbfada001ef8251. * Fix * Make `execute_block` return the final block header * Move Aura digest stuff * Make it possible to disable equivocation checking * Fix fix fix * Some refactorings * Comment * Fixes fixes fixes * More cleanups * Some love * Better love * Make slot duration being exposed as `Duration` to the outside * Some slot info love * Add `build_aura_worker` utility function * Copy copy copy * Some stuff * Start fixing pow * Fix pow * Remove some bounds * More work * Make grandpa work * Make slots use `async_trait` * Introduce `SharedData` * Add test and fix bugs * Switch to `SharedData` * Make grandpa tests working * More Babe work * Make grandpa work * Introduce `SharedData` * Add test and fix bugs * Switch to `SharedData` * Make grandpa tests working * More Babe work * Make it async * Fix fix * Use `async_trait` in sc-consensus-slots This makes the code a little bit easier to read and also expresses that there can always only be one call at a time to `on_slot`. * Make grandpa tests compile * More Babe tests work * Fix network test * Start fixing service test * Finish service-test * Fix sc-consensus-aura * Fix fix fix * More fixes * Make everything compile *yeah* * Make manual-seal compile * More fixes * Start fixing Aura * Fix Aura tests * Fix Babe tests * Make everything compile * Move code around and switch to async_trait * Fix Babe * Docs docs docs * Move to FRAME * Fix fix fix * Make everything compile * Last cleanups * Fix integration test * Change slot usage of the timestamp * We really need to switch to `impl-trait-for-tuples` * Update primitives/inherents/src/lib.rs Co-authored-by: André Silva <123550+andresilva@users.noreply.github.com> * Update primitives/inherents/src/lib.rs Co-authored-by: André Silva <123550+andresilva@users.noreply.github.com> * Update primitives/inherents/src/lib.rs Co-authored-by: André Silva <123550+andresilva@users.noreply.github.com> * Some extra logging * Remove dbg! * Update primitives/consensus/common/src/import_queue/basic_queue.rs Co-authored-by: André Silva <123550+andresilva@users.noreply.github.com> Co-authored-by: André Silva <123550+andresilva@users.noreply.github.com>
297 lines
7.7 KiB
Rust
297 lines
7.7 KiB
Rust
// This file is part of Substrate.
|
|
|
|
// Copyright (C) 2020-2021 Parity Technologies (UK) Ltd.
|
|
// SPDX-License-Identifier: GPL-3.0-or-later WITH Classpath-exception-2.0
|
|
|
|
// This program is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU General Public License as published by
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
|
|
// This program is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU General Public License for more details.
|
|
|
|
// You should have received a copy of the GNU General Public License
|
|
// along with this program. If not, see <https://www.gnu.org/licenses/>.
|
|
|
|
//! Block construction benchmark.
|
|
//!
|
|
//! This benchmark is expected to measure block construction.
|
|
//! We want to protect against cold-cache attacks, and so this
|
|
//! benchmark should not rely on any caching (except those entries that
|
|
//! DO NOT depend on user input). Thus transaction generation should be
|
|
//! based on randomized data.
|
|
|
|
use std::{
|
|
borrow::Cow,
|
|
collections::HashMap,
|
|
pin::Pin,
|
|
sync::Arc,
|
|
};
|
|
use futures::Future;
|
|
|
|
use node_primitives::Block;
|
|
use node_testing::bench::{BenchDb, Profile, BlockType, KeyTypes, DatabaseType};
|
|
use sp_runtime::{
|
|
generic::BlockId,
|
|
traits::NumberFor,
|
|
OpaqueExtrinsic,
|
|
};
|
|
use sp_transaction_pool::{
|
|
ImportNotificationStream,
|
|
PoolFuture,
|
|
PoolStatus,
|
|
TransactionFor,
|
|
TransactionSource,
|
|
TransactionStatusStreamFor,
|
|
TxHash,
|
|
};
|
|
use sp_consensus::{Environment, Proposer};
|
|
use sp_inherents::InherentDataProvider;
|
|
|
|
use crate::{
|
|
common::SizeType,
|
|
core::{self, Path, Mode},
|
|
};
|
|
|
|
pub struct ConstructionBenchmarkDescription {
|
|
pub profile: Profile,
|
|
pub key_types: KeyTypes,
|
|
pub block_type: BlockType,
|
|
pub size: SizeType,
|
|
pub database_type: DatabaseType,
|
|
}
|
|
|
|
pub struct ConstructionBenchmark {
|
|
profile: Profile,
|
|
database: BenchDb,
|
|
transactions: Transactions,
|
|
}
|
|
|
|
impl core::BenchmarkDescription for ConstructionBenchmarkDescription {
|
|
fn path(&self) -> Path {
|
|
|
|
let mut path = Path::new(&["node", "proposer"]);
|
|
|
|
match self.profile {
|
|
Profile::Wasm => path.push("wasm"),
|
|
Profile::Native => path.push("native"),
|
|
}
|
|
|
|
match self.key_types {
|
|
KeyTypes::Sr25519 => path.push("sr25519"),
|
|
KeyTypes::Ed25519 => path.push("ed25519"),
|
|
}
|
|
|
|
match self.block_type {
|
|
BlockType::RandomTransfersKeepAlive => path.push("transfer"),
|
|
BlockType::RandomTransfersReaping => path.push("transfer_reaping"),
|
|
BlockType::Noop => path.push("noop"),
|
|
}
|
|
|
|
match self.database_type {
|
|
DatabaseType::RocksDb => path.push("rocksdb"),
|
|
DatabaseType::ParityDb => path.push("paritydb"),
|
|
}
|
|
|
|
path.push(&format!("{}", self.size));
|
|
|
|
path
|
|
}
|
|
|
|
fn setup(self: Box<Self>) -> Box<dyn core::Benchmark> {
|
|
let mut extrinsics: Vec<Arc<PoolTransaction>> = Vec::new();
|
|
|
|
let mut bench_db = BenchDb::with_key_types(
|
|
self.database_type,
|
|
50_000,
|
|
self.key_types
|
|
);
|
|
|
|
let client = bench_db.client();
|
|
|
|
let content_type = self.block_type.to_content(self.size.transactions());
|
|
for transaction in bench_db.block_content(content_type, &client) {
|
|
extrinsics.push(Arc::new(transaction.into()));
|
|
}
|
|
|
|
Box::new(ConstructionBenchmark {
|
|
profile: self.profile,
|
|
database: bench_db,
|
|
transactions: Transactions(extrinsics),
|
|
})
|
|
}
|
|
|
|
fn name(&self) -> Cow<'static, str> {
|
|
format!(
|
|
"Block construction ({:?}/{}, {:?}, {:?} backend)",
|
|
self.block_type,
|
|
self.size,
|
|
self.profile,
|
|
self.database_type,
|
|
).into()
|
|
}
|
|
}
|
|
|
|
impl core::Benchmark for ConstructionBenchmark {
|
|
fn run(&mut self, mode: Mode) -> std::time::Duration {
|
|
let context = self.database.create_context(self.profile);
|
|
|
|
let _ = context.client.runtime_version_at(&BlockId::Number(0))
|
|
.expect("Failed to get runtime version")
|
|
.spec_version;
|
|
|
|
if mode == Mode::Profile {
|
|
std::thread::park_timeout(std::time::Duration::from_secs(3));
|
|
}
|
|
|
|
let mut proposer_factory = sc_basic_authorship::ProposerFactory::new(
|
|
context.spawn_handle.clone(),
|
|
context.client.clone(),
|
|
self.transactions.clone().into(),
|
|
None,
|
|
None,
|
|
);
|
|
let timestamp_provider = sp_timestamp::InherentDataProvider::from_system_time();
|
|
|
|
let start = std::time::Instant::now();
|
|
|
|
let proposer = futures::executor::block_on(proposer_factory.init(
|
|
&context.client.header(&BlockId::number(0))
|
|
.expect("Database error querying block #0")
|
|
.expect("Block #0 should exist"),
|
|
)).expect("Proposer initialization failed");
|
|
|
|
let _block = futures::executor::block_on(
|
|
proposer.propose(
|
|
timestamp_provider.create_inherent_data().expect("Create inherent data failed"),
|
|
Default::default(),
|
|
std::time::Duration::from_secs(20),
|
|
None,
|
|
),
|
|
).map(|r| r.block).expect("Proposing failed");
|
|
|
|
let elapsed = start.elapsed();
|
|
|
|
if mode == Mode::Profile {
|
|
std::thread::park_timeout(std::time::Duration::from_secs(1));
|
|
}
|
|
|
|
elapsed
|
|
}
|
|
}
|
|
|
|
#[derive(Clone, Debug)]
|
|
pub struct PoolTransaction {
|
|
data: OpaqueExtrinsic,
|
|
hash: node_primitives::Hash,
|
|
}
|
|
|
|
impl From<OpaqueExtrinsic> for PoolTransaction {
|
|
fn from(e: OpaqueExtrinsic) -> Self {
|
|
PoolTransaction {
|
|
data: e,
|
|
hash: node_primitives::Hash::zero(),
|
|
}
|
|
}
|
|
}
|
|
|
|
impl sp_transaction_pool::InPoolTransaction for PoolTransaction {
|
|
type Transaction = OpaqueExtrinsic;
|
|
type Hash = node_primitives::Hash;
|
|
|
|
fn data(&self) -> &Self::Transaction {
|
|
&self.data
|
|
}
|
|
|
|
fn hash(&self) -> &Self::Hash {
|
|
&self.hash
|
|
}
|
|
|
|
fn priority(&self) -> &u64 { unimplemented!() }
|
|
|
|
fn longevity(&self) -> &u64 { unimplemented!() }
|
|
|
|
fn requires(&self) -> &[Vec<u8>] { unimplemented!() }
|
|
|
|
fn provides(&self) -> &[Vec<u8>] { unimplemented!() }
|
|
|
|
fn is_propagable(&self) -> bool { unimplemented!() }
|
|
}
|
|
|
|
#[derive(Clone, Debug)]
|
|
pub struct Transactions(Vec<Arc<PoolTransaction>>);
|
|
|
|
impl sp_transaction_pool::TransactionPool for Transactions {
|
|
type Block = Block;
|
|
type Hash = node_primitives::Hash;
|
|
type InPoolTransaction = PoolTransaction;
|
|
type Error = sp_transaction_pool::error::Error;
|
|
|
|
/// Returns a future that imports a bunch of unverified transactions to the pool.
|
|
fn submit_at(
|
|
&self,
|
|
_at: &BlockId<Self::Block>,
|
|
_source: TransactionSource,
|
|
_xts: Vec<TransactionFor<Self>>,
|
|
) -> PoolFuture<Vec<Result<node_primitives::Hash, Self::Error>>, Self::Error> {
|
|
unimplemented!()
|
|
}
|
|
|
|
/// Returns a future that imports one unverified transaction to the pool.
|
|
fn submit_one(
|
|
&self,
|
|
_at: &BlockId<Self::Block>,
|
|
_source: TransactionSource,
|
|
_xt: TransactionFor<Self>,
|
|
) -> PoolFuture<TxHash<Self>, Self::Error> {
|
|
unimplemented!()
|
|
}
|
|
|
|
fn submit_and_watch(
|
|
&self,
|
|
_at: &BlockId<Self::Block>,
|
|
_source: TransactionSource,
|
|
_xt: TransactionFor<Self>,
|
|
) -> PoolFuture<Box<TransactionStatusStreamFor<Self>>, Self::Error> {
|
|
unimplemented!()
|
|
}
|
|
|
|
fn ready_at(&self, _at: NumberFor<Self::Block>)
|
|
-> Pin<Box<dyn Future<Output=Box<dyn Iterator<Item=Arc<Self::InPoolTransaction>> + Send>> + Send>>
|
|
{
|
|
let iter: Box<dyn Iterator<Item=Arc<PoolTransaction>> + Send> = Box::new(self.0.clone().into_iter());
|
|
Box::pin(futures::future::ready(iter))
|
|
}
|
|
|
|
fn ready(&self) -> Box<dyn Iterator<Item=Arc<Self::InPoolTransaction>> + Send> {
|
|
unimplemented!()
|
|
}
|
|
|
|
fn remove_invalid(&self, _hashes: &[TxHash<Self>]) -> Vec<Arc<Self::InPoolTransaction>> {
|
|
Default::default()
|
|
}
|
|
|
|
fn status(&self) -> PoolStatus {
|
|
unimplemented!()
|
|
}
|
|
|
|
fn import_notification_stream(&self) -> ImportNotificationStream<TxHash<Self>> {
|
|
unimplemented!()
|
|
}
|
|
|
|
fn on_broadcasted(&self, _propagations: HashMap<TxHash<Self>, Vec<String>>) {
|
|
unimplemented!()
|
|
}
|
|
|
|
fn hash_of(&self, _xt: &TransactionFor<Self>) -> TxHash<Self> {
|
|
unimplemented!()
|
|
}
|
|
|
|
fn ready_transaction(&self, _hash: &TxHash<Self>) -> Option<Arc<Self::InPoolTransaction>> {
|
|
unimplemented!()
|
|
}
|
|
}
|