mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-07-11 14:05:42 +00:00
d810f65044
* Initial version of bridges pallet as subtree of https://github.com/paritytech/parity-bridges-common Added `Bridges subtree files` pr review rule * Squashed 'bridges/' content from commit d30927c08 git-subtree-dir: bridges git-subtree-split: d30927c089bd9e73092d1ec1a62895603cb277a3 * Updated REAMDE.md and BRIDGES.md (inspired by original https://github.com/paritytech/polkadot/blob/d22eb62fe40e55e15eb91d375f48cc540d83a47e/BRIDGES.md) * Squashed 'bridges/' changes from d30927c08..d3970944b d3970944b Small simplifications (#2050) git-subtree-dir: bridges git-subtree-split: d3970944b0cfc4ea5226225e1ca07dab234c3556 * Squashed 'bridges/' changes from d3970944b..2180797fb 2180797fb Removed CODEOWNERS (#2051) git-subtree-dir: bridges git-subtree-split: 2180797fbf8a990490c67853dcffd81bc8dd083c * Squashed 'bridges/' changes from 2180797fbf..4850aac8ce 4850aac8ce Removed relayer_account: &AccountId from MessageDispatch (#2080) 8c8adafd54 Revert "Fix max-size messages at test chains (#2064)" (#2077) c01a63efd8 Fixed off-by-one when confirming rewards in messages pallet (#2075) a298be96aa Update subxt dependencies (#2072) c0eef51eab Fix max-size messages at test chains (#2064) 3a658e3697 Messages relay fixes (#2073) 0022b5ab22 Slash relayers for invalid transactions (#2025) 198104007f Bump enumflags2 from 0.7.5 to 0.7.7 9229b257e5 [ci] Fix rules for docker build (#2069) 660d791390 [ci] Update buildah command and version (#2058) e4535c0ca4 fix the way latest_confirmed_nonce_at_source is "calculated" (#2067) dbc2d37590 select nothing if we have already selected nonces to submit or have submitted something (#2065) a7eedd21fe [relay-substrate-client] Bump jsonrpsee (#2066) 8875d5aeae Bump clap from 4.2.2 to 4.2.4 25f9cf55e2 Another use of RangeInclusiveExt::checked_len() (#2060) 4942c12a5f submit lane unblock transactions from relay (#2030) c0325d3c9c Test deployments fixes (#2057) fc7b9b7ed7 Use the new matrix server (#2056) 63bcb5c10b Fixed delivery alert rule (#2052) git-subtree-dir: bridges git-subtree-split: 4850aac8ce6c34e5ca6246b88cd14c873a879cba * Squashed 'bridges/' changes from 4850aac8ce..66aaf0dd23 66aaf0dd23 Nits (#2083) git-subtree-dir: bridges git-subtree-split: 66aaf0dd239dde40b64264061a77c921e2c82568 * Squashed 'bridges/' changes from 66aaf0dd23..557ecbcecc 557ecbcecc Fix sized messages (Follow-up on #2064) (#2103) 54f587a066 Add weight of refund extension post_dispatch to the weights of messages pallet (#2089) 5b1626f8c4 fix pallet param for nightly benchmarks check (#2099) ae44c6b7a1 Add millau specific messages weights (#2097) 6ad0bd1f1e Add integrity tests to rialto parachain runtiime (#2096) 6919556de5 Bump tokio from 1.27.0 to 1.28.0 58795fcb75 Bump clap from 4.2.4 to 4.2.5 01bf31085b Bump scale-info from 2.5.0 to 2.6.0 8fe383240d Bump anyhow from 1.0.70 to 1.0.71 8d94e82ad5 deployments: add new BEEFY metrics and alarms (#2090) e9a4749e7e Bump wasmtime from 6.0.1 to 6.0.2 9d9936c0d9 Bump wasmtime from 6.0.1 to 6.0.2 in /tools/runtime-codegen 5d77cd7bee Add more logs to relayer and message pallets (#2082) 75fbb9d3ef Update comment (#2081) 9904d09cf6 Benchmarks for new relayers pallet calls (#2040) git-subtree-dir: bridges git-subtree-split: 557ecbcecc585547b744a5ac9fb8d7f3b9de4521 * fmt * Squashed 'bridges/' changes from 557ecbcecc..04b3dda6aa 04b3dda6aa Remove from subtree (#2111) f8ff15e7e7 Add `MessagesPalletInstance` for integrity tests (#2107) 92ccef58e6 Use generated runtimes for BHR/BHW (#2106) b33e0a585b Fix comment (#2105) git-subtree-dir: bridges git-subtree-split: 04b3dda6aa38599e612ff637710b6d2cff275ef3 * ".git/.scripts/commands/fmt/fmt.sh" --------- Co-authored-by: parity-processbot <>
557 lines
16 KiB
Rust
557 lines
16 KiB
Rust
// Copyright 2019-2021 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, RuntimeDebug};
|
|
use scale_info::{Type, TypeInfo};
|
|
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 data(&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 storage reference.
|
|
pub fn storage(&self) -> &S {
|
|
&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.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.data();
|
|
let is_correct_message = nonce == data.last_delivered_nonce() + 1;
|
|
if !is_correct_message {
|
|
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.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.data().last_confirmed_nonce, 3);
|
|
|
|
assert_eq!(
|
|
lane.receive_state_update(OutboundLaneData {
|
|
latest_received_nonce: 3,
|
|
..Default::default()
|
|
}),
|
|
None,
|
|
);
|
|
assert_eq!(lane.storage.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.data().last_confirmed_nonce, 0);
|
|
assert_eq!(
|
|
lane.storage.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.data().last_confirmed_nonce, 2);
|
|
assert_eq!(
|
|
lane.storage.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.data().last_confirmed_nonce, 3);
|
|
assert_eq!(lane.storage.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.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.data().last_confirmed_nonce, 3);
|
|
assert_eq!(
|
|
lane.storage.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.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.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.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,
|
|
},
|
|
);
|
|
});
|
|
}
|
|
}
|