PendingAck

Struct PendingAck 

Source
pub struct PendingAck<const FRAME: usize = MAX_RESEND_FRAME_LEN> {
    pub ack_tag: [u8; 8],
    pub peer: PublicKey,
    pub resend: ResendRecord<FRAME>,
    pub sent_ms: u64,
    pub ack_deadline_ms: u64,
    pub retries: u8,
    pub state: AckState,
}
Expand description

Complete tracking state for one in-flight ACK-requested transmission.

The coordinator’s IdentitySlot maintains a LinearMap of PendingAck records keyed by SendReceipt, one per active ACK-requested send. The record holds everything needed to detect completion, detect timeout, and retransmit:

  • ack_tag — the 8-byte CMAC-derived value that will appear in the destination’s MAC ACK packet. Only a node that received and successfully decrypted the original frame can produce the correct tag, so a matching ack_tag is cryptographic proof of delivery.
  • peer — the destination’s full public key, used to look up the correct pending entry when matching an inbound MAC ACK against the pending table.
  • resend — a verbatim copy of the sealed frame for retransmission. See ResendRecord.
  • sent_ms — the monotonic millisecond timestamp at which the frame was first transmitted; useful for latency measurement.
  • ack_deadline_ms — absolute deadline for the final ACK. Expiry means failure and the entry is removed.
  • retries — the number of retransmissions already attempted; capped at MAX_FORWARD_RETRIES.
  • state — current position in the AckState lifecycle (forwarding confirmation wait or final-ACK wait).

Use PendingAck::direct for sends to nodes in direct radio range, or PendingAck::forwarded when routing through a repeater.

Fields§

§ack_tag: [u8; 8]

Internal ACK tag used for inbound matching.

§peer: PublicKey

Final destination peer.

§resend: ResendRecord<FRAME>

Retransmission data.

§sent_ms: u64

Initial send timestamp in milliseconds.

§ack_deadline_ms: u64

Absolute deadline for the final ACK.

§retries: u8

Number of retries already attempted.

§state: AckState

Current state in the ACK lifecycle.

Implementations§

Source§

impl<const FRAME: usize> PendingAck<FRAME>

Source

pub fn direct( ack_tag: [u8; 8], peer: PublicKey, resend: ResendRecord<FRAME>, ) -> Self

Create pending-ACK state for a direct send.

Source

pub fn forwarded( ack_tag: [u8; 8], peer: PublicKey, resend: ResendRecord<FRAME>, ) -> Self

Create pending-ACK state for a forwarded send.

Trait Implementations§

Source§

impl<const FRAME: usize> Clone for PendingAck<FRAME>

Source§

fn clone(&self) -> PendingAck<FRAME>

Returns a duplicate of the value. Read more
1.0.0§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl<const FRAME: usize> Debug for PendingAck<FRAME>

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
Source§

impl<const FRAME: usize> PartialEq for PendingAck<FRAME>

Source§

fn eq(&self, other: &PendingAck<FRAME>) -> bool

Tests for self and other values to be equal, and is used by ==.
1.0.0§

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
Source§

impl<const FRAME: usize> Eq for PendingAck<FRAME>

Source§

impl<const FRAME: usize> StructuralPartialEq for PendingAck<FRAME>

Auto Trait Implementations§

§

impl<const FRAME: usize> Freeze for PendingAck<FRAME>

§

impl<const FRAME: usize> RefUnwindSafe for PendingAck<FRAME>

§

impl<const FRAME: usize> Send for PendingAck<FRAME>

§

impl<const FRAME: usize> Sync for PendingAck<FRAME>

§

impl<const FRAME: usize> Unpin for PendingAck<FRAME>

§

impl<const FRAME: usize> UnwindSafe for PendingAck<FRAME>

Blanket Implementations§

§

impl<T> Any for T
where T: 'static + ?Sized,

§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
§

impl<T> Borrow<T> for T
where T: ?Sized,

§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
§

impl<T> BorrowMut<T> for T
where T: ?Sized,

§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
§

impl<T> CloneToUninit for T
where T: Clone,

§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
§

impl<T> From<T> for T

§

fn from(t: T) -> T

Returns the argument unchanged.

§

impl<T, U> Into<U> for T
where U: From<T>,

§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
§

impl<T> ToOwned for T
where T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.