mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-05-31 06:21:02 +00:00
1e0c2a6e02
* Remove unused trait implementations Signed-off-by: Serban Iorga <serban@parity.io> * Define encoded_size_hint_u32() Signed-off-by: Serban Iorga <serban@parity.io> * Define TransactionEstimationParams trait Signed-off-by: Serban Iorga <serban@parity.io> * Rework TransactionEstimation Signed-off-by: Serban Iorga <serban@parity.io> * Docs + Renamings Signed-off-by: Serban Iorga <serban@parity.io>
570 lines
17 KiB
Rust
570 lines
17 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,
|
|
UnrewardedRelayer,
|
|
};
|
|
use bp_runtime::messages::MessageDispatchResult;
|
|
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 {
|
|
/// Delivery and dispatch fee type on source chain.
|
|
type MessageFee;
|
|
/// 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,
|
|
T::MaxUnconfirmedMessagesAtInboundLane::get() as usize,
|
|
)
|
|
.unwrap_or(usize::MAX)
|
|
}
|
|
}
|
|
|
|
/// Result of single message receival.
|
|
#[derive(RuntimeDebug, PartialEq, Eq)]
|
|
pub enum ReceivalResult {
|
|
/// Message has been received and dispatched. Note that we don't care whether dispatch has
|
|
/// been successful or not - in both case message falls into this category.
|
|
///
|
|
/// The message dispatch result is also returned.
|
|
Dispatched(MessageDispatchResult),
|
|
/// Message has invalid nonce and lane has rejected to accept this message.
|
|
InvalidNonce,
|
|
/// There are too many unrewarded relayer entries at the lane.
|
|
TooManyUnrewardedRelayers,
|
|
/// There are too many unconfirmed messages at the lane.
|
|
TooManyUnconfirmedMessages,
|
|
}
|
|
|
|
/// 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 }
|
|
}
|
|
|
|
/// 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.dispatch_results = entry
|
|
.messages
|
|
.dispatch_results
|
|
.split_off((new_confirmed_nonce + 1 - entry.messages.begin) as _);
|
|
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<P: MessageDispatch<AccountId, S::MessageFee>, AccountId>(
|
|
&mut self,
|
|
relayer_at_bridged_chain: &S::Relayer,
|
|
relayer_at_this_chain: &AccountId,
|
|
nonce: MessageNonce,
|
|
message_data: DispatchMessageData<P::DispatchPayload, S::MessageFee>,
|
|
) -> ReceivalResult {
|
|
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 = P::dispatch(
|
|
relayer_at_this_chain,
|
|
DispatchMessage {
|
|
key: MessageKey { lane_id: self.storage.id(), nonce },
|
|
data: message_data,
|
|
},
|
|
);
|
|
|
|
// now let's update inbound lane storage
|
|
let push_new = match data.relayers.back_mut() {
|
|
Some(entry) if entry.relayer == *relayer_at_bridged_chain => {
|
|
entry.messages.note_dispatched_message(dispatch_result.dispatch_result);
|
|
false
|
|
},
|
|
_ => true,
|
|
};
|
|
if push_new {
|
|
data.relayers.push_back(UnrewardedRelayer {
|
|
relayer: (*relayer_at_bridged_chain).clone(),
|
|
messages: DeliveredMessages::new(nonce, dispatch_result.dispatch_result),
|
|
});
|
|
}
|
|
self.storage.set_data(data);
|
|
|
|
ReceivalResult::Dispatched(dispatch_result)
|
|
}
|
|
}
|
|
|
|
#[cfg(test)]
|
|
mod tests {
|
|
use super::*;
|
|
use crate::{
|
|
inbound_lane,
|
|
mock::{
|
|
dispatch_result, message_data, run_test, unrewarded_relayer, TestMessageDispatch,
|
|
TestRuntime, REGULAR_PAYLOAD, TEST_LANE_ID, TEST_RELAYER_A, TEST_RELAYER_B,
|
|
TEST_RELAYER_C,
|
|
},
|
|
RuntimeInboundLaneStorage,
|
|
};
|
|
|
|
fn receive_regular_message(
|
|
lane: &mut InboundLane<RuntimeInboundLaneStorage<TestRuntime, ()>>,
|
|
nonce: MessageNonce,
|
|
) {
|
|
assert_eq!(
|
|
lane.receive_message::<TestMessageDispatch, _>(
|
|
&TEST_RELAYER_A,
|
|
&TEST_RELAYER_A,
|
|
nonce,
|
|
message_data(REGULAR_PAYLOAD).into()
|
|
),
|
|
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,
|
|
&TEST_RELAYER_A,
|
|
10,
|
|
message_data(REGULAR_PAYLOAD).into()
|
|
),
|
|
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),
|
|
&(TEST_RELAYER_A + current_nonce),
|
|
current_nonce,
|
|
message_data(REGULAR_PAYLOAD).into()
|
|
),
|
|
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),
|
|
&(TEST_RELAYER_A + max_nonce + 1),
|
|
max_nonce + 1,
|
|
message_data(REGULAR_PAYLOAD).into()
|
|
),
|
|
ReceivalResult::TooManyUnrewardedRelayers,
|
|
);
|
|
// Fails to dispatch new messages from latest relayer. Prevents griefing attacks.
|
|
assert_eq!(
|
|
lane.receive_message::<TestMessageDispatch, _>(
|
|
&(TEST_RELAYER_A + max_nonce),
|
|
&(TEST_RELAYER_A + max_nonce),
|
|
max_nonce + 1,
|
|
message_data(REGULAR_PAYLOAD).into()
|
|
),
|
|
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,
|
|
&TEST_RELAYER_A,
|
|
current_nonce,
|
|
message_data(REGULAR_PAYLOAD).into()
|
|
),
|
|
ReceivalResult::Dispatched(dispatch_result(0))
|
|
);
|
|
}
|
|
// Fails to dispatch new message from different than latest relayer.
|
|
assert_eq!(
|
|
lane.receive_message::<TestMessageDispatch, _>(
|
|
&TEST_RELAYER_B,
|
|
&TEST_RELAYER_B,
|
|
max_nonce + 1,
|
|
message_data(REGULAR_PAYLOAD).into()
|
|
),
|
|
ReceivalResult::TooManyUnconfirmedMessages,
|
|
);
|
|
// Fails to dispatch new messages from latest relayer.
|
|
assert_eq!(
|
|
lane.receive_message::<TestMessageDispatch, _>(
|
|
&TEST_RELAYER_A,
|
|
&TEST_RELAYER_A,
|
|
max_nonce + 1,
|
|
message_data(REGULAR_PAYLOAD).into()
|
|
),
|
|
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,
|
|
&TEST_RELAYER_A,
|
|
1,
|
|
message_data(REGULAR_PAYLOAD).into()
|
|
),
|
|
ReceivalResult::Dispatched(dispatch_result(0))
|
|
);
|
|
assert_eq!(
|
|
lane.receive_message::<TestMessageDispatch, _>(
|
|
&TEST_RELAYER_B,
|
|
&TEST_RELAYER_B,
|
|
2,
|
|
message_data(REGULAR_PAYLOAD).into()
|
|
),
|
|
ReceivalResult::Dispatched(dispatch_result(0))
|
|
);
|
|
assert_eq!(
|
|
lane.receive_message::<TestMessageDispatch, _>(
|
|
&TEST_RELAYER_A,
|
|
&TEST_RELAYER_A,
|
|
3,
|
|
message_data(REGULAR_PAYLOAD).into()
|
|
),
|
|
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,
|
|
&TEST_RELAYER_A,
|
|
1,
|
|
message_data(REGULAR_PAYLOAD).into()
|
|
),
|
|
ReceivalResult::Dispatched(dispatch_result(0))
|
|
);
|
|
assert_eq!(
|
|
lane.receive_message::<TestMessageDispatch, _>(
|
|
&TEST_RELAYER_B,
|
|
&TEST_RELAYER_B,
|
|
1,
|
|
message_data(REGULAR_PAYLOAD).into()
|
|
),
|
|
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 = 1;
|
|
assert_eq!(
|
|
lane.receive_message::<TestMessageDispatch, _>(
|
|
&TEST_RELAYER_A,
|
|
&TEST_RELAYER_A,
|
|
1,
|
|
message_data(payload).into()
|
|
),
|
|
ReceivalResult::Dispatched(dispatch_result(1))
|
|
);
|
|
});
|
|
}
|
|
}
|