mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-05-31 19:11:02 +00:00
9216b781fd
* Asynchronous backing PR (#2300) * Update substrate & polkadot * min changes to make async backing compile * (async backing) parachain-system: track limitations for unincluded blocks (#2438) * unincluded segment draft * read para head from storage proof * read_para_head -> read_included_para_head * Provide pub interface * add errors * fix unincluded segment update * BlockTracker -> Ancestor * add a dmp limit * Read para head depending on the storage switch * doc comments * storage items docs * add a sanity check on block initialize * Check watermark * append to the segment on block finalize * Move segment update into set_validation_data * Resolve para head todo * option watermark * fix comment * Drop dmq check * fix weight * doc-comments on inherent invariant * Remove TODO * add todo * primitives tests * pallet tests * doc comments * refactor unincluded segment length into a ConsensusHook (#2501) * refactor unincluded segment length into a ConsensusHook * add docs * refactor bandwidth_out calculation Co-authored-by: Chris Sosnin <48099298+slumber@users.noreply.github.com> * test for limits from impl * fmt * make tests compile * update comment * uncomment test * fix collator test by adding parent to state proof * patch HRMP watermark rules for unincluded segment * get consensus-common tests to pass, using unincluded segment * fix unincluded segment tests * get all tests passing * fmt * rustdoc CI * aura-ext: limit the number of authored blocks per slot (#2551) * aura_ext consensus hook * reverse dependency * include weight into hook * fix tests * remove stray println Co-authored-by: Chris Sosnin <48099298+slumber@users.noreply.github.com> * fix test warning * fix doc link --------- Co-authored-by: Chris Sosnin <48099298+slumber@users.noreply.github.com> Co-authored-by: Chris Sosnin <chris125_@live.com> * parachain-system: ignore go ahead signal once upgrade is processed (#2594) * handle goahead signal for unincluded segment * doc comment * add test * parachain-system: drop processed messages from inherent data (#2590) * implement `drop_processed_messages` * drop messages based on relay parent number * adjust tests * drop changes to mqc * fix comment * drop test * drop more dead code * clippy * aura-ext: check slot in consensus hook and remove all `CheckInherents` logic (#2658) * aura-ext: check slot in consensus hook * convert relay chain slot * Make relay chain slot duration generic * use fixed velocity hook for pallets with aura * purge timestamp inherent * fix warning * adjust runtime tests * fix slots in tests * Make `xcm-emulator` test pass for new consensus hook (#2722) * add pallets on_initialize * tests pass * add AuraExt on_init * ".git/.scripts/commands/fmt/fmt.sh" --------- Co-authored-by: command-bot <> --------- Co-authored-by: Ignacio Palacios <ignacio.palacios.santos@gmail.com> * update polkadot git refs * CollationGenerationConfig closure is now optional (#2772) * CollationGenerationConfig closure is now optional * fix test * propagate network-protocol-staging feature (#2899) * Feature Flagging Consensus Hook Type Parameter (#2911) * First pass * fmt * Added as default feature in tomls * Changed to direct dependency feature * Dealing with clippy error * Update pallets/parachain-system/src/lib.rs Co-authored-by: asynchronous rob <rphmeier@gmail.com> --------- Co-authored-by: asynchronous rob <rphmeier@gmail.com> * fmt * bump deps and remove warning * parachain-system: update RelevantMessagingState according to the unincluded segment (#2948) * mostly address 2471 with a bug introduced * adjust relevant messaging state after computing total * fmt * max -> min * fix test implementation of xcmp source * add test * fix test message sending logic * fix + test * add more to unincluded segment test * fmt --------- Co-authored-by: Chris Sosnin <chris125_@live.com> * Integrate new Aura / Parachain Consensus Logic in Parachain-Template / Polkadot-Parachain (#2864) * add a comment * refactor client/service utilities * deprecate start_collator * update parachain-template * update test-service in the same way * update polkadot-parachain crate * fmt * wire up new SubmitCollation message * some runtime utilities for implementing unincluded segment runtime APIs * allow parachains to configure their level of sybil-resistance when starting the network * make aura-ext compile * update to specify sybil resistance levels * fmt * specify relay chain slot duration in milliseconds * update Aura to explicitly produce Send futures also, make relay_chain_slot_duration a Duration * add authoring duration to basic collator and document params * integrate new basic collator into parachain-template * remove assert_send used for testing * basic-aura: only author when parent included * update polkadot-parachain-bin * fmt * some fixes * fixes * add a RelayNumberMonotonicallyIncreases * add a utility function for initializing subsystems * some logging for timestamp adjustment * fmt * some fixes for lookahead collator * add a log * update `find_potential_parents` to account for sessions * bound the loop * restore & deprecate old start_collator and start_full_node functions. * remove unnecessary await calls * fix warning * clippy * more clippy * remove unneeded logic * ci * update comment Co-authored-by: Marcin S. <marcin@bytedude.com> * (async backing) restore `CheckInherents` for backwards-compatibility (#2977) * bring back timestamp * Restore CheckInherents * revert to empty CheckInherents * make CheckInherents optional * attempt * properly end system blocks * add some more comments * ignore failing system parachain tests * update refs after main feature branch merge * comment out the offending tests because CI runs ignored tests * fix warnings * fmt * revert to polkadot master * cargo update -p polkadot-primitives -p sp-io --------- Co-authored-by: asynchronous rob <rphmeier@gmail.com> Co-authored-by: Ignacio Palacios <ignacio.palacios.santos@gmail.com> Co-authored-by: Bradley Olson <34992650+BradleyOlson64@users.noreply.github.com> Co-authored-by: Marcin S. <marcin@bytedude.com> Co-authored-by: eskimor <eskimor@users.noreply.github.com> Co-authored-by: Andronik <write@reusable.software> (cherry picked from commit6ef1117685) * Companion: restructure macro related exports (#3015) * restructure macro related exports * restructure macro related exports * wip * wip * update cargo lock * refactor RuntimeDebug on unincluded segment * fmt * Companion: restructure `benchmarking` macro related exports (#3039) * wip * wip * restructure benchmarking macro related exports * add cargo lock --------- Co-authored-by: parity-processbot <> (cherry picked from commit8349c8d18a) * Add missing workspace members (#3056) * Add dependencies Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Add missing workspace members Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Fix more Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> --------- Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> (cherry picked from commit44499cf262) * Add CI for monorepo (#1145) * Add CI for monorepo * fix frame tests * Format features Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * add note for skipping tests and disable test-linux-stable-all * Fix tests and compile issues (#1152) * Fix feature dependant import Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Bump test timeout Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Remove feature gate Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Add resolver 2 Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Remove old lockfile Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Format features Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> --------- Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Fix check-dependency-rules Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * rm test-runtime Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Actually fix script Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * enable cargo-check-each-crate-macos * Run check-each-crate on 6 machines (#1163) --------- Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> Co-authored-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> (cherry picked from commite49493442a) * Fix features (#1194) * Manually fix conflicting ? Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Remove duplicates Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Autofix feature propagation zepter lint propagate-feature --feature try-runtime --left-side-feature-missing=ignore --workspace --fix --feature-enables-dep="try-runtime:frame-try-runtime" zepter lint propagate-feature --feature runtime-benchmarks --left-side-feature-missing=ignore --workspace --fix --feature-enables-dep="runtime-benchmarks:frame-benchmarking" zepter lint propagate-feature --feature std --left-side-feature-missing=ignore --workspace --fix zepter f f Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Bump zepter Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Add some duplicates Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Revert "Add some duplicates" This reverts commit c6ce627273881c478f5b34f23d3a67db632dbebf. * Remove default enabled features Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Bump Zepter Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Bump in correct location 🤦 Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * DNM: Add some mistakes Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * DNM: Add some mistakes Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Revert "DNM: Add some mistakes" This reverts commit d469b3f0ba2aaed5f35f6ff5995f99e682da5800. * Revert "DNM: Add some mistakes" This reverts commit d892a73a35cac01e3721bdba74574b88bd04f83c. --------- Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> (cherry picked from commit0400ed9075) * Fix build profiles (#1229) * Fix build profiles Closes https://github.com/paritytech/polkadot-sdk/issues/1155 Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Manually set version to 1.0.0 Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Use workspace repo Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * 'Authors and Edition from workspace Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> --------- Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> (cherry picked from commitdcda0e50f5) * Set test crates to nopublish (#1240) * Set test crates to nopublish * Don't publish more crates * Set even more crates to nopublish --------- Co-authored-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> (cherry picked from commit1c7ef1f232) * Add missing licenses and tune the scanning workflow (#1288) * Add missing Cumulus licenses * Typo * Add missing Substrate licenses * Single job checking the sub-repos in steps * Remove dates * Remove dates * Add missing (C) * Update FRAME UI tests Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Update more UI tests Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> --------- Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> Co-authored-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> (cherry picked from commitbfb241d7f3) * Restructure `dispatch` macro related exports (#1162) * restructure dispatch macro related exports * moved Dispatchable to lib.rs * fix .gitignore final newline * ".git/.scripts/commands/fmt/fmt.sh" * fix rustdocs * wip --------- Co-authored-by: Liam Aharon <liam.aharon@hotmail.com> Co-authored-by: command-bot <> Co-authored-by: ordian <write@reusable.software> (cherry picked from commitbdbe982970) * Fixes * Fix clippy --------- Co-authored-by: Chris Sosnin <48099298+slumber@users.noreply.github.com> Co-authored-by: Juan <juangirini@gmail.com> Co-authored-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> Co-authored-by: Alexander Samusev <41779041+alvicsam@users.noreply.github.com> Co-authored-by: Lulu <morgan@parity.io> Co-authored-by: Przemek Rzad <roopert7@gmail.com>
462 lines
18 KiB
Rust
462 lines
18 KiB
Rust
// Copyright (C) Parity Technologies (UK) Ltd.
|
|
// This file is part of Parity Bridges Common.
|
|
|
|
// Parity Bridges Common 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.
|
|
|
|
// Parity Bridges Common 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 Parity Bridges Common. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
//! Messages pallet benchmarking.
|
|
|
|
use crate::{
|
|
inbound_lane::InboundLaneStorage, outbound_lane, weights_ext::EXPECTED_DEFAULT_MESSAGE_LENGTH,
|
|
Call, OutboundLanes, RuntimeInboundLaneStorage,
|
|
};
|
|
|
|
use bp_messages::{
|
|
source_chain::TargetHeaderChain, target_chain::SourceHeaderChain, DeliveredMessages,
|
|
InboundLaneData, LaneId, MessageNonce, OutboundLaneData, UnrewardedRelayer,
|
|
UnrewardedRelayersState,
|
|
};
|
|
use bp_runtime::StorageProofSize;
|
|
use codec::Decode;
|
|
use frame_benchmarking::{account, benchmarks_instance_pallet};
|
|
use frame_support::weights::Weight;
|
|
use frame_system::RawOrigin;
|
|
use sp_runtime::traits::TrailingZeroInput;
|
|
use sp_std::{ops::RangeInclusive, prelude::*};
|
|
|
|
const SEED: u32 = 0;
|
|
|
|
/// Pallet we're benchmarking here.
|
|
pub struct Pallet<T: Config<I>, I: 'static = ()>(crate::Pallet<T, I>);
|
|
|
|
/// Benchmark-specific message proof parameters.
|
|
#[derive(Debug)]
|
|
pub struct MessageProofParams {
|
|
/// Id of the lane.
|
|
pub lane: LaneId,
|
|
/// Range of messages to include in the proof.
|
|
pub message_nonces: RangeInclusive<MessageNonce>,
|
|
/// If `Some`, the proof needs to include this outbound lane data.
|
|
pub outbound_lane_data: Option<OutboundLaneData>,
|
|
/// If `true`, the caller expects that the proof will contain correct messages that will
|
|
/// be successfully dispatched. This is only called from the "optional"
|
|
/// `receive_single_message_proof_with_dispatch` benchmark. If you don't need it, just
|
|
/// return `true` from the `is_message_successfully_dispatched`.
|
|
pub is_successful_dispatch_expected: bool,
|
|
/// Proof size requirements.
|
|
pub size: StorageProofSize,
|
|
}
|
|
|
|
/// Benchmark-specific message delivery proof parameters.
|
|
#[derive(Debug)]
|
|
pub struct MessageDeliveryProofParams<ThisChainAccountId> {
|
|
/// Id of the lane.
|
|
pub lane: LaneId,
|
|
/// The proof needs to include this inbound lane data.
|
|
pub inbound_lane_data: InboundLaneData<ThisChainAccountId>,
|
|
/// Proof size requirements.
|
|
pub size: StorageProofSize,
|
|
}
|
|
|
|
/// Trait that must be implemented by runtime.
|
|
pub trait Config<I: 'static>: crate::Config<I> {
|
|
/// Lane id to use in benchmarks.
|
|
///
|
|
/// By default, lane 00000000 is used.
|
|
fn bench_lane_id() -> LaneId {
|
|
LaneId([0, 0, 0, 0])
|
|
}
|
|
|
|
/// Return id of relayer account at the bridged chain.
|
|
///
|
|
/// By default, zero account is returned.
|
|
fn bridged_relayer_id() -> Self::InboundRelayer {
|
|
Self::InboundRelayer::decode(&mut TrailingZeroInput::zeroes()).unwrap()
|
|
}
|
|
|
|
/// Create given account and give it enough balance for test purposes. Used to create
|
|
/// relayer account at the target chain. Is strictly necessary when your rewards scheme
|
|
/// assumes that the relayer account must exist.
|
|
///
|
|
/// Does nothing by default.
|
|
fn endow_account(_account: &Self::AccountId) {}
|
|
|
|
/// Prepare messages proof to receive by the module.
|
|
fn prepare_message_proof(
|
|
params: MessageProofParams,
|
|
) -> (<Self::SourceHeaderChain as SourceHeaderChain>::MessagesProof, Weight);
|
|
/// Prepare messages delivery proof to receive by the module.
|
|
fn prepare_message_delivery_proof(
|
|
params: MessageDeliveryProofParams<Self::AccountId>,
|
|
) -> <Self::TargetHeaderChain as TargetHeaderChain<Self::OutboundPayload, Self::AccountId>>::MessagesDeliveryProof;
|
|
|
|
/// Returns true if message has been successfully dispatched or not.
|
|
fn is_message_successfully_dispatched(_nonce: MessageNonce) -> bool {
|
|
true
|
|
}
|
|
|
|
/// Returns true if given relayer has been rewarded for some of its actions.
|
|
fn is_relayer_rewarded(relayer: &Self::AccountId) -> bool;
|
|
}
|
|
|
|
benchmarks_instance_pallet! {
|
|
//
|
|
// Benchmarks that are used directly by the runtime calls weight formulae.
|
|
//
|
|
|
|
// Benchmark `receive_messages_proof` extrinsic with single minimal-weight message and following conditions:
|
|
// * proof does not include outbound lane state proof;
|
|
// * inbound lane already has state, so it needs to be read and decoded;
|
|
// * message is dispatched (reminder: dispatch weight should be minimal);
|
|
// * message requires all heavy checks done by dispatcher.
|
|
//
|
|
// This is base benchmark for all other message delivery benchmarks.
|
|
receive_single_message_proof {
|
|
let relayer_id_on_source = T::bridged_relayer_id();
|
|
let relayer_id_on_target = account("relayer", 0, SEED);
|
|
T::endow_account(&relayer_id_on_target);
|
|
|
|
// mark messages 1..=20 as delivered
|
|
receive_messages::<T, I>(20);
|
|
|
|
let (proof, dispatch_weight) = T::prepare_message_proof(MessageProofParams {
|
|
lane: T::bench_lane_id(),
|
|
message_nonces: 21..=21,
|
|
outbound_lane_data: None,
|
|
is_successful_dispatch_expected: false,
|
|
size: StorageProofSize::Minimal(EXPECTED_DEFAULT_MESSAGE_LENGTH),
|
|
});
|
|
}: receive_messages_proof(RawOrigin::Signed(relayer_id_on_target), relayer_id_on_source, proof, 1, dispatch_weight)
|
|
verify {
|
|
assert_eq!(
|
|
crate::InboundLanes::<T, I>::get(&T::bench_lane_id()).last_delivered_nonce(),
|
|
21,
|
|
);
|
|
}
|
|
|
|
// Benchmark `receive_messages_proof` extrinsic with two minimal-weight messages and following conditions:
|
|
// * proof does not include outbound lane state proof;
|
|
// * inbound lane already has state, so it needs to be read and decoded;
|
|
// * message is dispatched (reminder: dispatch weight should be minimal);
|
|
// * message requires all heavy checks done by dispatcher.
|
|
//
|
|
// The weight of single message delivery could be approximated as
|
|
// `weight(receive_two_messages_proof) - weight(receive_single_message_proof)`.
|
|
// This won't be super-accurate if message has non-zero dispatch weight, but estimation should
|
|
// be close enough to real weight.
|
|
receive_two_messages_proof {
|
|
let relayer_id_on_source = T::bridged_relayer_id();
|
|
let relayer_id_on_target = account("relayer", 0, SEED);
|
|
T::endow_account(&relayer_id_on_target);
|
|
|
|
// mark messages 1..=20 as delivered
|
|
receive_messages::<T, I>(20);
|
|
|
|
let (proof, dispatch_weight) = T::prepare_message_proof(MessageProofParams {
|
|
lane: T::bench_lane_id(),
|
|
message_nonces: 21..=22,
|
|
outbound_lane_data: None,
|
|
is_successful_dispatch_expected: false,
|
|
size: StorageProofSize::Minimal(EXPECTED_DEFAULT_MESSAGE_LENGTH),
|
|
});
|
|
}: receive_messages_proof(RawOrigin::Signed(relayer_id_on_target), relayer_id_on_source, proof, 2, dispatch_weight)
|
|
verify {
|
|
assert_eq!(
|
|
crate::InboundLanes::<T, I>::get(&T::bench_lane_id()).last_delivered_nonce(),
|
|
22,
|
|
);
|
|
}
|
|
|
|
// Benchmark `receive_messages_proof` extrinsic with single minimal-weight message and following conditions:
|
|
// * proof includes outbound lane state proof;
|
|
// * inbound lane already has state, so it needs to be read and decoded;
|
|
// * message is successfully dispatched (reminder: dispatch weight should be minimal);
|
|
// * message requires all heavy checks done by dispatcher.
|
|
//
|
|
// The weight of outbound lane state delivery would be
|
|
// `weight(receive_single_message_proof_with_outbound_lane_state) - weight(receive_single_message_proof)`.
|
|
// This won't be super-accurate if message has non-zero dispatch weight, but estimation should
|
|
// be close enough to real weight.
|
|
receive_single_message_proof_with_outbound_lane_state {
|
|
let relayer_id_on_source = T::bridged_relayer_id();
|
|
let relayer_id_on_target = account("relayer", 0, SEED);
|
|
T::endow_account(&relayer_id_on_target);
|
|
|
|
// mark messages 1..=20 as delivered
|
|
receive_messages::<T, I>(20);
|
|
|
|
let (proof, dispatch_weight) = T::prepare_message_proof(MessageProofParams {
|
|
lane: T::bench_lane_id(),
|
|
message_nonces: 21..=21,
|
|
outbound_lane_data: Some(OutboundLaneData {
|
|
oldest_unpruned_nonce: 21,
|
|
latest_received_nonce: 20,
|
|
latest_generated_nonce: 21,
|
|
}),
|
|
is_successful_dispatch_expected: false,
|
|
size: StorageProofSize::Minimal(EXPECTED_DEFAULT_MESSAGE_LENGTH),
|
|
});
|
|
}: receive_messages_proof(RawOrigin::Signed(relayer_id_on_target), relayer_id_on_source, proof, 1, dispatch_weight)
|
|
verify {
|
|
let lane_state = crate::InboundLanes::<T, I>::get(&T::bench_lane_id());
|
|
assert_eq!(lane_state.last_delivered_nonce(), 21);
|
|
assert_eq!(lane_state.last_confirmed_nonce, 20);
|
|
}
|
|
|
|
// Benchmark `receive_messages_proof` extrinsic with single minimal-weight message and following conditions:
|
|
// * the proof has large leaf with total size of approximately 1KB;
|
|
// * proof does not include outbound lane state proof;
|
|
// * inbound lane already has state, so it needs to be read and decoded;
|
|
// * message is dispatched (reminder: dispatch weight should be minimal);
|
|
// * message requires all heavy checks done by dispatcher.
|
|
//
|
|
// With single KB of messages proof, the weight of the call is increased (roughly) by
|
|
// `(receive_single_message_proof_16KB - receive_single_message_proof_1_kb) / 15`.
|
|
receive_single_message_proof_1_kb {
|
|
let relayer_id_on_source = T::bridged_relayer_id();
|
|
let relayer_id_on_target = account("relayer", 0, SEED);
|
|
T::endow_account(&relayer_id_on_target);
|
|
|
|
// mark messages 1..=20 as delivered
|
|
receive_messages::<T, I>(20);
|
|
|
|
let (proof, dispatch_weight) = T::prepare_message_proof(MessageProofParams {
|
|
lane: T::bench_lane_id(),
|
|
message_nonces: 21..=21,
|
|
outbound_lane_data: None,
|
|
is_successful_dispatch_expected: false,
|
|
size: StorageProofSize::HasLargeLeaf(1024),
|
|
});
|
|
}: receive_messages_proof(RawOrigin::Signed(relayer_id_on_target), relayer_id_on_source, proof, 1, dispatch_weight)
|
|
verify {
|
|
assert_eq!(
|
|
crate::InboundLanes::<T, I>::get(&T::bench_lane_id()).last_delivered_nonce(),
|
|
21,
|
|
);
|
|
}
|
|
|
|
// Benchmark `receive_messages_proof` extrinsic with single minimal-weight message and following conditions:
|
|
// * the proof has large leaf with total size of approximately 16KB;
|
|
// * proof does not include outbound lane state proof;
|
|
// * inbound lane already has state, so it needs to be read and decoded;
|
|
// * message is dispatched (reminder: dispatch weight should be minimal);
|
|
// * message requires all heavy checks done by dispatcher.
|
|
//
|
|
// Size of proof grows because it contains extra trie nodes in it.
|
|
//
|
|
// With single KB of messages proof, the weight of the call is increased (roughly) by
|
|
// `(receive_single_message_proof_16KB - receive_single_message_proof) / 15`.
|
|
receive_single_message_proof_16_kb {
|
|
let relayer_id_on_source = T::bridged_relayer_id();
|
|
let relayer_id_on_target = account("relayer", 0, SEED);
|
|
T::endow_account(&relayer_id_on_target);
|
|
|
|
// mark messages 1..=20 as delivered
|
|
receive_messages::<T, I>(20);
|
|
|
|
let (proof, dispatch_weight) = T::prepare_message_proof(MessageProofParams {
|
|
lane: T::bench_lane_id(),
|
|
message_nonces: 21..=21,
|
|
outbound_lane_data: None,
|
|
is_successful_dispatch_expected: false,
|
|
size: StorageProofSize::HasLargeLeaf(16 * 1024),
|
|
});
|
|
}: receive_messages_proof(RawOrigin::Signed(relayer_id_on_target), relayer_id_on_source, proof, 1, dispatch_weight)
|
|
verify {
|
|
assert_eq!(
|
|
crate::InboundLanes::<T, I>::get(&T::bench_lane_id()).last_delivered_nonce(),
|
|
21,
|
|
);
|
|
}
|
|
|
|
// Benchmark `receive_messages_delivery_proof` extrinsic with following conditions:
|
|
// * single relayer is rewarded for relaying single message;
|
|
// * relayer account does not exist (in practice it needs to exist in production environment).
|
|
//
|
|
// This is base benchmark for all other confirmations delivery benchmarks.
|
|
receive_delivery_proof_for_single_message {
|
|
let relayer_id: T::AccountId = account("relayer", 0, SEED);
|
|
|
|
// send message that we're going to confirm
|
|
send_regular_message::<T, I>();
|
|
|
|
let relayers_state = UnrewardedRelayersState {
|
|
unrewarded_relayer_entries: 1,
|
|
messages_in_oldest_entry: 1,
|
|
total_messages: 1,
|
|
last_delivered_nonce: 1,
|
|
};
|
|
let proof = T::prepare_message_delivery_proof(MessageDeliveryProofParams {
|
|
lane: T::bench_lane_id(),
|
|
inbound_lane_data: InboundLaneData {
|
|
relayers: vec![UnrewardedRelayer {
|
|
relayer: relayer_id.clone(),
|
|
messages: DeliveredMessages::new(1),
|
|
}].into_iter().collect(),
|
|
last_confirmed_nonce: 0,
|
|
},
|
|
size: StorageProofSize::Minimal(0),
|
|
});
|
|
}: receive_messages_delivery_proof(RawOrigin::Signed(relayer_id.clone()), proof, relayers_state)
|
|
verify {
|
|
assert_eq!(OutboundLanes::<T, I>::get(T::bench_lane_id()).latest_received_nonce, 1);
|
|
assert!(T::is_relayer_rewarded(&relayer_id));
|
|
}
|
|
|
|
// Benchmark `receive_messages_delivery_proof` extrinsic with following conditions:
|
|
// * single relayer is rewarded for relaying two messages;
|
|
// * relayer account does not exist (in practice it needs to exist in production environment).
|
|
//
|
|
// Additional weight for paying single-message reward to the same relayer could be computed
|
|
// as `weight(receive_delivery_proof_for_two_messages_by_single_relayer)
|
|
// - weight(receive_delivery_proof_for_single_message)`.
|
|
receive_delivery_proof_for_two_messages_by_single_relayer {
|
|
let relayer_id: T::AccountId = account("relayer", 0, SEED);
|
|
|
|
// send message that we're going to confirm
|
|
send_regular_message::<T, I>();
|
|
send_regular_message::<T, I>();
|
|
|
|
let relayers_state = UnrewardedRelayersState {
|
|
unrewarded_relayer_entries: 1,
|
|
messages_in_oldest_entry: 2,
|
|
total_messages: 2,
|
|
last_delivered_nonce: 2,
|
|
};
|
|
let mut delivered_messages = DeliveredMessages::new(1);
|
|
delivered_messages.note_dispatched_message();
|
|
let proof = T::prepare_message_delivery_proof(MessageDeliveryProofParams {
|
|
lane: T::bench_lane_id(),
|
|
inbound_lane_data: InboundLaneData {
|
|
relayers: vec![UnrewardedRelayer {
|
|
relayer: relayer_id.clone(),
|
|
messages: delivered_messages,
|
|
}].into_iter().collect(),
|
|
last_confirmed_nonce: 0,
|
|
},
|
|
size: StorageProofSize::Minimal(0),
|
|
});
|
|
}: receive_messages_delivery_proof(RawOrigin::Signed(relayer_id.clone()), proof, relayers_state)
|
|
verify {
|
|
assert_eq!(OutboundLanes::<T, I>::get(T::bench_lane_id()).latest_received_nonce, 2);
|
|
assert!(T::is_relayer_rewarded(&relayer_id));
|
|
}
|
|
|
|
// Benchmark `receive_messages_delivery_proof` extrinsic with following conditions:
|
|
// * two relayers are rewarded for relaying single message each;
|
|
// * relayer account does not exist (in practice it needs to exist in production environment).
|
|
//
|
|
// Additional weight for paying reward to the next relayer could be computed
|
|
// as `weight(receive_delivery_proof_for_two_messages_by_two_relayers)
|
|
// - weight(receive_delivery_proof_for_two_messages_by_single_relayer)`.
|
|
receive_delivery_proof_for_two_messages_by_two_relayers {
|
|
let relayer1_id: T::AccountId = account("relayer1", 1, SEED);
|
|
let relayer2_id: T::AccountId = account("relayer2", 2, SEED);
|
|
|
|
// send message that we're going to confirm
|
|
send_regular_message::<T, I>();
|
|
send_regular_message::<T, I>();
|
|
|
|
let relayers_state = UnrewardedRelayersState {
|
|
unrewarded_relayer_entries: 2,
|
|
messages_in_oldest_entry: 1,
|
|
total_messages: 2,
|
|
last_delivered_nonce: 2,
|
|
};
|
|
let proof = T::prepare_message_delivery_proof(MessageDeliveryProofParams {
|
|
lane: T::bench_lane_id(),
|
|
inbound_lane_data: InboundLaneData {
|
|
relayers: vec![
|
|
UnrewardedRelayer {
|
|
relayer: relayer1_id.clone(),
|
|
messages: DeliveredMessages::new(1),
|
|
},
|
|
UnrewardedRelayer {
|
|
relayer: relayer2_id.clone(),
|
|
messages: DeliveredMessages::new(2),
|
|
},
|
|
].into_iter().collect(),
|
|
last_confirmed_nonce: 0,
|
|
},
|
|
size: StorageProofSize::Minimal(0),
|
|
});
|
|
}: receive_messages_delivery_proof(RawOrigin::Signed(relayer1_id.clone()), proof, relayers_state)
|
|
verify {
|
|
assert_eq!(OutboundLanes::<T, I>::get(T::bench_lane_id()).latest_received_nonce, 2);
|
|
assert!(T::is_relayer_rewarded(&relayer1_id));
|
|
assert!(T::is_relayer_rewarded(&relayer2_id));
|
|
}
|
|
|
|
//
|
|
// Benchmarks that the runtime developers may use for proper pallet configuration.
|
|
//
|
|
|
|
// This benchmark is optional and may be used when runtime developer need a way to compute
|
|
// message dispatch weight. In this case, he needs to provide messages that can go the whole
|
|
// dispatch
|
|
//
|
|
// Benchmark `receive_messages_proof` extrinsic with single message and following conditions:
|
|
//
|
|
// * proof does not include outbound lane state proof;
|
|
// * inbound lane already has state, so it needs to be read and decoded;
|
|
// * message is **SUCCESSFULLY** dispatched;
|
|
// * message requires all heavy checks done by dispatcher.
|
|
receive_single_message_proof_with_dispatch {
|
|
// maybe dispatch weight relies on the message size too?
|
|
let i in EXPECTED_DEFAULT_MESSAGE_LENGTH .. EXPECTED_DEFAULT_MESSAGE_LENGTH * 16;
|
|
|
|
let relayer_id_on_source = T::bridged_relayer_id();
|
|
let relayer_id_on_target = account("relayer", 0, SEED);
|
|
T::endow_account(&relayer_id_on_target);
|
|
|
|
// mark messages 1..=20 as delivered
|
|
receive_messages::<T, I>(20);
|
|
|
|
let (proof, dispatch_weight) = T::prepare_message_proof(MessageProofParams {
|
|
lane: T::bench_lane_id(),
|
|
message_nonces: 21..=21,
|
|
outbound_lane_data: None,
|
|
is_successful_dispatch_expected: true,
|
|
size: StorageProofSize::Minimal(i),
|
|
});
|
|
}: receive_messages_proof(RawOrigin::Signed(relayer_id_on_target), relayer_id_on_source, proof, 1, dispatch_weight)
|
|
verify {
|
|
assert_eq!(
|
|
crate::InboundLanes::<T, I>::get(&T::bench_lane_id()).last_delivered_nonce(),
|
|
21,
|
|
);
|
|
assert!(T::is_message_successfully_dispatched(21));
|
|
}
|
|
|
|
impl_benchmark_test_suite!(Pallet, crate::mock::new_test_ext(), crate::mock::TestRuntime)
|
|
}
|
|
|
|
fn send_regular_message<T: Config<I>, I: 'static>() {
|
|
let mut outbound_lane = outbound_lane::<T, I>(T::bench_lane_id());
|
|
outbound_lane.send_message(vec![]).expect("We craft valid messages");
|
|
}
|
|
|
|
fn receive_messages<T: Config<I>, I: 'static>(nonce: MessageNonce) {
|
|
let mut inbound_lane_storage =
|
|
RuntimeInboundLaneStorage::<T, I>::from_lane_id(T::bench_lane_id());
|
|
inbound_lane_storage.set_data(InboundLaneData {
|
|
relayers: vec![UnrewardedRelayer {
|
|
relayer: T::bridged_relayer_id(),
|
|
messages: DeliveredMessages::new(nonce),
|
|
}]
|
|
.into_iter()
|
|
.collect(),
|
|
last_confirmed_nonce: 0,
|
|
});
|
|
}
|