Struct pallet_im_online::pallet::Pallet [−][src]
pub struct Pallet<T>(_);
Expand description
The pallet implementing the on-chain logic.
Implementations
pub fn heartbeat(
origin: OriginFor<T>,
heartbeat: Heartbeat<T::BlockNumber>,
_signature: <T::AuthorityId as RuntimeAppPublic>::Signature
) -> DispatchResult
pub fn heartbeat(
origin: OriginFor<T>,
heartbeat: Heartbeat<T::BlockNumber>,
_signature: <T::AuthorityId as RuntimeAppPublic>::Signature
) -> DispatchResult
- Complexity:
O(K + E)
where K is length ofKeys
(heartbeat.validators_len) and E is length ofheartbeat.network_state.external_address
O(K)
: decoding of lengthK
O(E)
: decoding/encoding of lengthE
- DbReads: pallet_session
Validators
, pallet_sessionCurrentIndex
,Keys
,ReceivedHeartbeats
- DbWrites:
ReceivedHeartbeats
The block number after which it’s ok to send heartbeats in the current session.
At the beginning of each session we set this to a value that should fall roughly in the middle of the session duration. The idea is to first wait for the validators to produce a block in the current session, so that the heartbeat later on will not be necessary.
This value will only be used as a fallback if we fail to get a proper session
progress estimate from NextSessionRotation
, as those estimates should be
more accurate then the value we calculate for HeartbeatAfter
.
The current set of keys that may issue a heartbeat.
pub fn received_heartbeats<KArg1, KArg2>(
k1: KArg1,
k2: KArg2
) -> Option<Vec<u8>> where
KArg1: EncodeLike<SessionIndex>,
KArg2: EncodeLike<AuthIndex>,
pub fn received_heartbeats<KArg1, KArg2>(
k1: KArg1,
k2: KArg2
) -> Option<Vec<u8>> where
KArg1: EncodeLike<SessionIndex>,
KArg2: EncodeLike<AuthIndex>,
For each session index, we keep a mapping of AuthIndex
to
offchain::OpaqueNetworkState
.
For each session index, we keep a mapping of ValidatorId<T>
to the
number of blocks authored by the given authority.
Returns true
if a heartbeat has been received for the authority at
authority_index
in the authorities series or if the authority has
authored at least one block, during the current session. Otherwise
false
.
Returns true
if a heartbeat has been received for the authority at authority_index
in
the authorities series, during the current session. Otherwise false
.
Trait Implementations
Get the benchmarks available for this pallet. Generally there is one benchmark per extrinsic, so these are sometimes just called “extrinsics”. Read more
fn run_benchmark(
extrinsic: &[u8],
c: &[(BenchmarkParameter, u32)],
whitelist: &[TrackedStorageKey],
verify: bool,
internal_repeats: u32
) -> Result<Vec<BenchmarkResults>, &'static str>
fn run_benchmark(
extrinsic: &[u8],
c: &[(BenchmarkParameter, u32)],
whitelist: &[TrackedStorageKey],
verify: bool,
internal_repeats: u32
) -> Result<Vec<BenchmarkResults>, &'static str>
Run the benchmarks for this pallet.
type Public = T::AuthorityId
type Public = T::AuthorityId
The RuntimeAppPublic
this type is bound to.
impl<T: Config + Config> EventHandler<<<T as Config>::ValidatorSet as ValidatorSet<<T as Config>::AccountId>>::ValidatorId, <T as Config>::BlockNumber> for Pallet<T>
impl<T: Config + Config> EventHandler<<<T as Config>::ValidatorSet as ValidatorSet<<T as Config>::AccountId>>::ValidatorId, <T as Config>::BlockNumber> for Pallet<T>
Keep track of number of authored blocks per authority, uncles are counted as well since they’re a valid proof of being online.
Note that the given account ID is the author of the current block.
Note that the given account ID authored the given uncle, and how many blocks older than the current block it is (age >= 0, so siblings are allowed) Read more
Returns the current storage version as supported by the pallet.
Returns the on-chain storage version of the pallet as stored in the storage.
Implementing this function on a module allows you to perform long-running tasks that make (by default) validators generate transactions that feed results of those long-running computations back on chain. Read more
The block is being finalized. Implement to have something happen.
This will be run when the block is being finalized (before on_finalize
).
Implement to have something happen using the remaining weight.
Will not fire if the remaining weight is 0.
Return the weight used, the hook will subtract it from current weight used
and pass the result to the next on_idle
hook if it exists. Read more
The block is being initialized. Implement to have something happen. Read more
Perform a module upgrade. Read more
Execute some pre-checks prior to a runtime upgrade. Read more
Execute some post-checks after a runtime upgrade. Read more
Run integrity test. Read more
Run integrity test. Read more
This function is being called after every block import (when fully synced). Read more
The block is being finalized. Implement to have something happen. Read more
Something that should happen at genesis.
The block is being finalized.
Implement to have something happen in case there is leftover weight.
Check the passed remaining_weight
to make sure it is high enough to allow for
your pallet’s extra computation. Read more
The block is being initialized. Implement to have something happen. Read more
type Key = T::AuthorityId
type Key = T::AuthorityId
The key type expected.
fn on_genesis_session<'a, I: 'a>(validators: I) where
I: Iterator<Item = (&'a T::AccountId, T::AuthorityId)>,
fn on_genesis_session<'a, I: 'a>(validators: I) where
I: Iterator<Item = (&'a T::AccountId, T::AuthorityId)>,
The given validator set will be used for the genesis session.
It is guaranteed that the given validator set will also be used
for the second session, therefore the first call to on_new_session
should provide the same validator set. Read more
fn on_new_session<'a, I: 'a>(
_changed: bool,
validators: I,
_queued_validators: I
) where
I: Iterator<Item = (&'a T::AccountId, T::AuthorityId)>,
fn on_new_session<'a, I: 'a>(
_changed: bool,
validators: I,
_queued_validators: I
) where
I: Iterator<Item = (&'a T::AccountId, T::AuthorityId)>,
Session set has changed; act appropriately. Note that this can be called before initialization of your module. Read more
A notification for end of the session. Read more
A validator got disabled. Act accordingly until a new session begins.
Auto Trait Implementations
impl<T> RefUnwindSafe for Pallet<T> where
T: RefUnwindSafe,
impl<T> UnwindSafe for Pallet<T> where
T: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
impl<T> Downcast for T where
T: Any,
impl<T> Downcast for T where
T: Any,
Convert Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
. Read more
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
Convert Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
. Read more
Convert &Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s. Read more
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert &mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s. Read more
Instruments this type with the provided Span
, returning an
Instrumented
wrapper. Read more
Generate a storage key unique to this runtime upgrade. Read more
Get temporary storage data written by Self::set_temp_storage
. Read more
Write some temporary data to a specific storage that can be read (potentially in
post-upgrade hook) via Self::get_temp_storage
. Read more
impl<T> PalletVersionToStorageVersionHelper for T where
T: GetStorageVersion + PalletInfoAccess,
impl<T> PalletVersionToStorageVersionHelper for T where
T: GetStorageVersion + PalletInfoAccess,
type Output = T
type Output = T
Should always be Self
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.
The counterpart to unchecked_from
.
Consume self to return an equivalent value of T
.
pub fn vzip(self) -> V
impl<T> MaybeDebug for T where
T: Debug,
impl<T> MaybeDebug for T where
T: Debug,