mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-05-31 16:51: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>
557 lines
16 KiB
Rust
557 lines
16 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/>.
|
|
|
|
//! Everything about incoming messages receival.
|
|
|
|
use crate::Config;
|
|
|
|
use bp_messages::{
|
|
target_chain::{DispatchMessage, DispatchMessageData, MessageDispatch},
|
|
DeliveredMessages, InboundLaneData, LaneId, MessageKey, MessageNonce, OutboundLaneData,
|
|
ReceivalResult, UnrewardedRelayer,
|
|
};
|
|
use codec::{Decode, Encode, EncodeLike, MaxEncodedLen};
|
|
use frame_support::traits::Get;
|
|
use scale_info::{Type, TypeInfo};
|
|
use sp_runtime::RuntimeDebug;
|
|
use sp_std::prelude::PartialEq;
|
|
|
|
/// Inbound lane storage.
|
|
pub trait InboundLaneStorage {
|
|
/// Id of relayer on source chain.
|
|
type Relayer: Clone + PartialEq;
|
|
|
|
/// Lane id.
|
|
fn id(&self) -> LaneId;
|
|
/// Return maximal number of unrewarded relayer entries in inbound lane.
|
|
fn max_unrewarded_relayer_entries(&self) -> MessageNonce;
|
|
/// Return maximal number of unconfirmed messages in inbound lane.
|
|
fn max_unconfirmed_messages(&self) -> MessageNonce;
|
|
/// Get lane data from the storage.
|
|
fn get_or_init_data(&mut self) -> InboundLaneData<Self::Relayer>;
|
|
/// Update lane data in the storage.
|
|
fn set_data(&mut self, data: InboundLaneData<Self::Relayer>);
|
|
}
|
|
|
|
/// Inbound lane data wrapper that implements `MaxEncodedLen`.
|
|
///
|
|
/// We have already had `MaxEncodedLen`-like functionality before, but its usage has
|
|
/// been localized and we haven't been passing bounds (maximal count of unrewarded relayer entries,
|
|
/// maximal count of unconfirmed messages) everywhere. This wrapper allows us to avoid passing
|
|
/// these generic bounds all over the code.
|
|
///
|
|
/// The encoding of this type matches encoding of the corresponding `MessageData`.
|
|
#[derive(Encode, Decode, Clone, RuntimeDebug, PartialEq, Eq)]
|
|
pub struct StoredInboundLaneData<T: Config<I>, I: 'static>(pub InboundLaneData<T::InboundRelayer>);
|
|
|
|
impl<T: Config<I>, I: 'static> sp_std::ops::Deref for StoredInboundLaneData<T, I> {
|
|
type Target = InboundLaneData<T::InboundRelayer>;
|
|
|
|
fn deref(&self) -> &Self::Target {
|
|
&self.0
|
|
}
|
|
}
|
|
|
|
impl<T: Config<I>, I: 'static> sp_std::ops::DerefMut for StoredInboundLaneData<T, I> {
|
|
fn deref_mut(&mut self) -> &mut Self::Target {
|
|
&mut self.0
|
|
}
|
|
}
|
|
|
|
impl<T: Config<I>, I: 'static> Default for StoredInboundLaneData<T, I> {
|
|
fn default() -> Self {
|
|
StoredInboundLaneData(Default::default())
|
|
}
|
|
}
|
|
|
|
impl<T: Config<I>, I: 'static> From<StoredInboundLaneData<T, I>>
|
|
for InboundLaneData<T::InboundRelayer>
|
|
{
|
|
fn from(data: StoredInboundLaneData<T, I>) -> Self {
|
|
data.0
|
|
}
|
|
}
|
|
|
|
impl<T: Config<I>, I: 'static> EncodeLike<StoredInboundLaneData<T, I>>
|
|
for InboundLaneData<T::InboundRelayer>
|
|
{
|
|
}
|
|
|
|
impl<T: Config<I>, I: 'static> TypeInfo for StoredInboundLaneData<T, I> {
|
|
type Identity = Self;
|
|
|
|
fn type_info() -> Type {
|
|
InboundLaneData::<T::InboundRelayer>::type_info()
|
|
}
|
|
}
|
|
|
|
impl<T: Config<I>, I: 'static> MaxEncodedLen for StoredInboundLaneData<T, I> {
|
|
fn max_encoded_len() -> usize {
|
|
InboundLaneData::<T::InboundRelayer>::encoded_size_hint(
|
|
T::MaxUnrewardedRelayerEntriesAtInboundLane::get() as usize,
|
|
)
|
|
.unwrap_or(usize::MAX)
|
|
}
|
|
}
|
|
|
|
/// Inbound messages lane.
|
|
pub struct InboundLane<S> {
|
|
storage: S,
|
|
}
|
|
|
|
impl<S: InboundLaneStorage> InboundLane<S> {
|
|
/// Create new inbound lane backed by given storage.
|
|
pub fn new(storage: S) -> Self {
|
|
InboundLane { storage }
|
|
}
|
|
|
|
/// Returns `mut` storage reference.
|
|
pub fn storage_mut(&mut self) -> &mut S {
|
|
&mut self.storage
|
|
}
|
|
|
|
/// Receive state of the corresponding outbound lane.
|
|
pub fn receive_state_update(
|
|
&mut self,
|
|
outbound_lane_data: OutboundLaneData,
|
|
) -> Option<MessageNonce> {
|
|
let mut data = self.storage.get_or_init_data();
|
|
let last_delivered_nonce = data.last_delivered_nonce();
|
|
|
|
if outbound_lane_data.latest_received_nonce > last_delivered_nonce {
|
|
// this is something that should never happen if proofs are correct
|
|
return None
|
|
}
|
|
if outbound_lane_data.latest_received_nonce <= data.last_confirmed_nonce {
|
|
return None
|
|
}
|
|
|
|
let new_confirmed_nonce = outbound_lane_data.latest_received_nonce;
|
|
data.last_confirmed_nonce = new_confirmed_nonce;
|
|
// Firstly, remove all of the records where higher nonce <= new confirmed nonce
|
|
while data
|
|
.relayers
|
|
.front()
|
|
.map(|entry| entry.messages.end <= new_confirmed_nonce)
|
|
.unwrap_or(false)
|
|
{
|
|
data.relayers.pop_front();
|
|
}
|
|
// Secondly, update the next record with lower nonce equal to new confirmed nonce if needed.
|
|
// Note: There will be max. 1 record to update as we don't allow messages from relayers to
|
|
// overlap.
|
|
match data.relayers.front_mut() {
|
|
Some(entry) if entry.messages.begin <= new_confirmed_nonce => {
|
|
entry.messages.begin = new_confirmed_nonce + 1;
|
|
},
|
|
_ => {},
|
|
}
|
|
|
|
self.storage.set_data(data);
|
|
Some(outbound_lane_data.latest_received_nonce)
|
|
}
|
|
|
|
/// Receive new message.
|
|
pub fn receive_message<Dispatch: MessageDispatch>(
|
|
&mut self,
|
|
relayer_at_bridged_chain: &S::Relayer,
|
|
nonce: MessageNonce,
|
|
message_data: DispatchMessageData<Dispatch::DispatchPayload>,
|
|
) -> ReceivalResult<Dispatch::DispatchLevelResult> {
|
|
let mut data = self.storage.get_or_init_data();
|
|
if Some(nonce) != data.last_delivered_nonce().checked_add(1) {
|
|
return ReceivalResult::InvalidNonce
|
|
}
|
|
|
|
// if there are more unrewarded relayer entries than we may accept, reject this message
|
|
if data.relayers.len() as MessageNonce >= self.storage.max_unrewarded_relayer_entries() {
|
|
return ReceivalResult::TooManyUnrewardedRelayers
|
|
}
|
|
|
|
// if there are more unconfirmed messages than we may accept, reject this message
|
|
let unconfirmed_messages_count = nonce.saturating_sub(data.last_confirmed_nonce);
|
|
if unconfirmed_messages_count > self.storage.max_unconfirmed_messages() {
|
|
return ReceivalResult::TooManyUnconfirmedMessages
|
|
}
|
|
|
|
// then, dispatch message
|
|
let dispatch_result = Dispatch::dispatch(DispatchMessage {
|
|
key: MessageKey { lane_id: self.storage.id(), nonce },
|
|
data: message_data,
|
|
});
|
|
|
|
// now let's update inbound lane storage
|
|
match data.relayers.back_mut() {
|
|
Some(entry) if entry.relayer == *relayer_at_bridged_chain => {
|
|
entry.messages.note_dispatched_message();
|
|
},
|
|
_ => {
|
|
data.relayers.push_back(UnrewardedRelayer {
|
|
relayer: relayer_at_bridged_chain.clone(),
|
|
messages: DeliveredMessages::new(nonce),
|
|
});
|
|
},
|
|
};
|
|
self.storage.set_data(data);
|
|
|
|
ReceivalResult::Dispatched(dispatch_result)
|
|
}
|
|
}
|
|
|
|
#[cfg(test)]
|
|
mod tests {
|
|
use super::*;
|
|
use crate::{
|
|
inbound_lane,
|
|
mock::{
|
|
dispatch_result, inbound_message_data, inbound_unrewarded_relayers_state, run_test,
|
|
unrewarded_relayer, TestMessageDispatch, TestRuntime, REGULAR_PAYLOAD, TEST_LANE_ID,
|
|
TEST_RELAYER_A, TEST_RELAYER_B, TEST_RELAYER_C,
|
|
},
|
|
RuntimeInboundLaneStorage,
|
|
};
|
|
use bp_messages::UnrewardedRelayersState;
|
|
|
|
fn receive_regular_message(
|
|
lane: &mut InboundLane<RuntimeInboundLaneStorage<TestRuntime, ()>>,
|
|
nonce: MessageNonce,
|
|
) {
|
|
assert_eq!(
|
|
lane.receive_message::<TestMessageDispatch>(
|
|
&TEST_RELAYER_A,
|
|
nonce,
|
|
inbound_message_data(REGULAR_PAYLOAD)
|
|
),
|
|
ReceivalResult::Dispatched(dispatch_result(0))
|
|
);
|
|
}
|
|
|
|
#[test]
|
|
fn receive_status_update_ignores_status_from_the_future() {
|
|
run_test(|| {
|
|
let mut lane = inbound_lane::<TestRuntime, _>(TEST_LANE_ID);
|
|
receive_regular_message(&mut lane, 1);
|
|
assert_eq!(
|
|
lane.receive_state_update(OutboundLaneData {
|
|
latest_received_nonce: 10,
|
|
..Default::default()
|
|
}),
|
|
None,
|
|
);
|
|
|
|
assert_eq!(lane.storage.get_or_init_data().last_confirmed_nonce, 0);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn receive_status_update_ignores_obsolete_status() {
|
|
run_test(|| {
|
|
let mut lane = inbound_lane::<TestRuntime, _>(TEST_LANE_ID);
|
|
receive_regular_message(&mut lane, 1);
|
|
receive_regular_message(&mut lane, 2);
|
|
receive_regular_message(&mut lane, 3);
|
|
assert_eq!(
|
|
lane.receive_state_update(OutboundLaneData {
|
|
latest_received_nonce: 3,
|
|
..Default::default()
|
|
}),
|
|
Some(3),
|
|
);
|
|
assert_eq!(lane.storage.get_or_init_data().last_confirmed_nonce, 3);
|
|
|
|
assert_eq!(
|
|
lane.receive_state_update(OutboundLaneData {
|
|
latest_received_nonce: 3,
|
|
..Default::default()
|
|
}),
|
|
None,
|
|
);
|
|
assert_eq!(lane.storage.get_or_init_data().last_confirmed_nonce, 3);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn receive_status_update_works() {
|
|
run_test(|| {
|
|
let mut lane = inbound_lane::<TestRuntime, _>(TEST_LANE_ID);
|
|
receive_regular_message(&mut lane, 1);
|
|
receive_regular_message(&mut lane, 2);
|
|
receive_regular_message(&mut lane, 3);
|
|
assert_eq!(lane.storage.get_or_init_data().last_confirmed_nonce, 0);
|
|
assert_eq!(
|
|
lane.storage.get_or_init_data().relayers,
|
|
vec![unrewarded_relayer(1, 3, TEST_RELAYER_A)]
|
|
);
|
|
|
|
assert_eq!(
|
|
lane.receive_state_update(OutboundLaneData {
|
|
latest_received_nonce: 2,
|
|
..Default::default()
|
|
}),
|
|
Some(2),
|
|
);
|
|
assert_eq!(lane.storage.get_or_init_data().last_confirmed_nonce, 2);
|
|
assert_eq!(
|
|
lane.storage.get_or_init_data().relayers,
|
|
vec![unrewarded_relayer(3, 3, TEST_RELAYER_A)]
|
|
);
|
|
|
|
assert_eq!(
|
|
lane.receive_state_update(OutboundLaneData {
|
|
latest_received_nonce: 3,
|
|
..Default::default()
|
|
}),
|
|
Some(3),
|
|
);
|
|
assert_eq!(lane.storage.get_or_init_data().last_confirmed_nonce, 3);
|
|
assert_eq!(lane.storage.get_or_init_data().relayers, vec![]);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn receive_status_update_works_with_batches_from_relayers() {
|
|
run_test(|| {
|
|
let mut lane = inbound_lane::<TestRuntime, _>(TEST_LANE_ID);
|
|
let mut seed_storage_data = lane.storage.get_or_init_data();
|
|
// Prepare data
|
|
seed_storage_data.last_confirmed_nonce = 0;
|
|
seed_storage_data.relayers.push_back(unrewarded_relayer(1, 1, TEST_RELAYER_A));
|
|
// Simulate messages batch (2, 3, 4) from relayer #2
|
|
seed_storage_data.relayers.push_back(unrewarded_relayer(2, 4, TEST_RELAYER_B));
|
|
seed_storage_data.relayers.push_back(unrewarded_relayer(5, 5, TEST_RELAYER_C));
|
|
lane.storage.set_data(seed_storage_data);
|
|
// Check
|
|
assert_eq!(
|
|
lane.receive_state_update(OutboundLaneData {
|
|
latest_received_nonce: 3,
|
|
..Default::default()
|
|
}),
|
|
Some(3),
|
|
);
|
|
assert_eq!(lane.storage.get_or_init_data().last_confirmed_nonce, 3);
|
|
assert_eq!(
|
|
lane.storage.get_or_init_data().relayers,
|
|
vec![
|
|
unrewarded_relayer(4, 4, TEST_RELAYER_B),
|
|
unrewarded_relayer(5, 5, TEST_RELAYER_C)
|
|
]
|
|
);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn fails_to_receive_message_with_incorrect_nonce() {
|
|
run_test(|| {
|
|
let mut lane = inbound_lane::<TestRuntime, _>(TEST_LANE_ID);
|
|
assert_eq!(
|
|
lane.receive_message::<TestMessageDispatch>(
|
|
&TEST_RELAYER_A,
|
|
10,
|
|
inbound_message_data(REGULAR_PAYLOAD)
|
|
),
|
|
ReceivalResult::InvalidNonce
|
|
);
|
|
assert_eq!(lane.storage.get_or_init_data().last_delivered_nonce(), 0);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn fails_to_receive_messages_above_unrewarded_relayer_entries_limit_per_lane() {
|
|
run_test(|| {
|
|
let mut lane = inbound_lane::<TestRuntime, _>(TEST_LANE_ID);
|
|
let max_nonce =
|
|
<TestRuntime as Config>::MaxUnrewardedRelayerEntriesAtInboundLane::get();
|
|
for current_nonce in 1..max_nonce + 1 {
|
|
assert_eq!(
|
|
lane.receive_message::<TestMessageDispatch>(
|
|
&(TEST_RELAYER_A + current_nonce),
|
|
current_nonce,
|
|
inbound_message_data(REGULAR_PAYLOAD)
|
|
),
|
|
ReceivalResult::Dispatched(dispatch_result(0))
|
|
);
|
|
}
|
|
// Fails to dispatch new message from different than latest relayer.
|
|
assert_eq!(
|
|
lane.receive_message::<TestMessageDispatch>(
|
|
&(TEST_RELAYER_A + max_nonce + 1),
|
|
max_nonce + 1,
|
|
inbound_message_data(REGULAR_PAYLOAD)
|
|
),
|
|
ReceivalResult::TooManyUnrewardedRelayers,
|
|
);
|
|
// Fails to dispatch new messages from latest relayer. Prevents griefing attacks.
|
|
assert_eq!(
|
|
lane.receive_message::<TestMessageDispatch>(
|
|
&(TEST_RELAYER_A + max_nonce),
|
|
max_nonce + 1,
|
|
inbound_message_data(REGULAR_PAYLOAD)
|
|
),
|
|
ReceivalResult::TooManyUnrewardedRelayers,
|
|
);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn fails_to_receive_messages_above_unconfirmed_messages_limit_per_lane() {
|
|
run_test(|| {
|
|
let mut lane = inbound_lane::<TestRuntime, _>(TEST_LANE_ID);
|
|
let max_nonce = <TestRuntime as Config>::MaxUnconfirmedMessagesAtInboundLane::get();
|
|
for current_nonce in 1..=max_nonce {
|
|
assert_eq!(
|
|
lane.receive_message::<TestMessageDispatch>(
|
|
&TEST_RELAYER_A,
|
|
current_nonce,
|
|
inbound_message_data(REGULAR_PAYLOAD)
|
|
),
|
|
ReceivalResult::Dispatched(dispatch_result(0))
|
|
);
|
|
}
|
|
// Fails to dispatch new message from different than latest relayer.
|
|
assert_eq!(
|
|
lane.receive_message::<TestMessageDispatch>(
|
|
&TEST_RELAYER_B,
|
|
max_nonce + 1,
|
|
inbound_message_data(REGULAR_PAYLOAD)
|
|
),
|
|
ReceivalResult::TooManyUnconfirmedMessages,
|
|
);
|
|
// Fails to dispatch new messages from latest relayer.
|
|
assert_eq!(
|
|
lane.receive_message::<TestMessageDispatch>(
|
|
&TEST_RELAYER_A,
|
|
max_nonce + 1,
|
|
inbound_message_data(REGULAR_PAYLOAD)
|
|
),
|
|
ReceivalResult::TooManyUnconfirmedMessages,
|
|
);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn correctly_receives_following_messages_from_two_relayers_alternately() {
|
|
run_test(|| {
|
|
let mut lane = inbound_lane::<TestRuntime, _>(TEST_LANE_ID);
|
|
assert_eq!(
|
|
lane.receive_message::<TestMessageDispatch>(
|
|
&TEST_RELAYER_A,
|
|
1,
|
|
inbound_message_data(REGULAR_PAYLOAD)
|
|
),
|
|
ReceivalResult::Dispatched(dispatch_result(0))
|
|
);
|
|
assert_eq!(
|
|
lane.receive_message::<TestMessageDispatch>(
|
|
&TEST_RELAYER_B,
|
|
2,
|
|
inbound_message_data(REGULAR_PAYLOAD)
|
|
),
|
|
ReceivalResult::Dispatched(dispatch_result(0))
|
|
);
|
|
assert_eq!(
|
|
lane.receive_message::<TestMessageDispatch>(
|
|
&TEST_RELAYER_A,
|
|
3,
|
|
inbound_message_data(REGULAR_PAYLOAD)
|
|
),
|
|
ReceivalResult::Dispatched(dispatch_result(0))
|
|
);
|
|
assert_eq!(
|
|
lane.storage.get_or_init_data().relayers,
|
|
vec![
|
|
unrewarded_relayer(1, 1, TEST_RELAYER_A),
|
|
unrewarded_relayer(2, 2, TEST_RELAYER_B),
|
|
unrewarded_relayer(3, 3, TEST_RELAYER_A)
|
|
]
|
|
);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn rejects_same_message_from_two_different_relayers() {
|
|
run_test(|| {
|
|
let mut lane = inbound_lane::<TestRuntime, _>(TEST_LANE_ID);
|
|
assert_eq!(
|
|
lane.receive_message::<TestMessageDispatch>(
|
|
&TEST_RELAYER_A,
|
|
1,
|
|
inbound_message_data(REGULAR_PAYLOAD)
|
|
),
|
|
ReceivalResult::Dispatched(dispatch_result(0))
|
|
);
|
|
assert_eq!(
|
|
lane.receive_message::<TestMessageDispatch>(
|
|
&TEST_RELAYER_B,
|
|
1,
|
|
inbound_message_data(REGULAR_PAYLOAD)
|
|
),
|
|
ReceivalResult::InvalidNonce,
|
|
);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn correct_message_is_processed_instantly() {
|
|
run_test(|| {
|
|
let mut lane = inbound_lane::<TestRuntime, _>(TEST_LANE_ID);
|
|
receive_regular_message(&mut lane, 1);
|
|
assert_eq!(lane.storage.get_or_init_data().last_delivered_nonce(), 1);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn unspent_weight_is_returned_by_receive_message() {
|
|
run_test(|| {
|
|
let mut lane = inbound_lane::<TestRuntime, _>(TEST_LANE_ID);
|
|
let mut payload = REGULAR_PAYLOAD;
|
|
*payload.dispatch_result.unspent_weight.ref_time_mut() = 1;
|
|
assert_eq!(
|
|
lane.receive_message::<TestMessageDispatch>(
|
|
&TEST_RELAYER_A,
|
|
1,
|
|
inbound_message_data(payload)
|
|
),
|
|
ReceivalResult::Dispatched(dispatch_result(1))
|
|
);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn first_message_is_confirmed_correctly() {
|
|
run_test(|| {
|
|
let mut lane = inbound_lane::<TestRuntime, _>(TEST_LANE_ID);
|
|
receive_regular_message(&mut lane, 1);
|
|
receive_regular_message(&mut lane, 2);
|
|
assert_eq!(
|
|
lane.receive_state_update(OutboundLaneData {
|
|
latest_received_nonce: 1,
|
|
..Default::default()
|
|
}),
|
|
Some(1),
|
|
);
|
|
assert_eq!(
|
|
inbound_unrewarded_relayers_state(TEST_LANE_ID),
|
|
UnrewardedRelayersState {
|
|
unrewarded_relayer_entries: 1,
|
|
messages_in_oldest_entry: 1,
|
|
total_messages: 1,
|
|
last_delivered_nonce: 2,
|
|
},
|
|
);
|
|
});
|
|
}
|
|
}
|