#[repr(C)]pub enum RecoveryField {
Show 18 variants
LatestRtt,
SmoothedRtt,
Rttvar,
MinRtt,
FirstRttSample,
MaxAckDelay,
LossDetectionTimer,
PtoCount(KPacketNumberSpace),
TimeOfLastAckElicitingPacket(KPacketNumberSpace),
LargestAckedPacket(KPacketNumberSpace),
LossTime(KPacketNumberSpace),
SentPackets(KPacketNumberSpace, u64),
MaxDatagramSize,
EcnCeCounters(KPacketNumberSpace),
BytesInFlight,
CongestionWindow,
CongestionRecoveryStartTime,
Ssthresh,
}
Expand description
Fields for the Recovery as defined by quic-recovery, Section A.3. These fields also include the congestion control ones, as defined by quic-recovery, Section B.2.
Variants§
LatestRtt
The most recent RTT measurement made when receiving an ack for a previously unacked packet.
SmoothedRtt
The smoothed RTT of the connection, computed as described in Section 5.3 of quic-recovery.
Rttvar
The RTT variation, computed as described in Section 5.3 of quic-recovery.
MinRtt
The minimum RTT seen in the connection, ignoring acknowledgment delay, as described in Section 5.2 of quic-recovery.
FirstRttSample
The time that the first RTT sample was obtained.
MaxAckDelay
The maximum amount of time by which the receiver intends to delay acknowledgments for packets in the Application Data packet number space, as defined by the eponymous transport parameter (Section 18.2 of [QUIC-TRANSPORT]). Note that the actual ack_delay in a received ACK frame may be larger due to late timers, reordering, or loss.
LossDetectionTimer
Multi-modal timer used for loss detection.
PtoCount(KPacketNumberSpace)
The number of times a PTO has been sent without receiving an ack.
Unlike specified in the recovery draft, this value is returned on a
per-epoch basis. Returns a usize
.
TimeOfLastAckElicitingPacket(KPacketNumberSpace)
The time the most recent ack-eliciting packet was sent.
LargestAckedPacket(KPacketNumberSpace)
The largest packet number acknowledged in the packet number space so far.
LossTime(KPacketNumberSpace)
The time at which the next packet inthat packet number space will be considered lost based on exceeding the reordering window in time.
SentPackets(KPacketNumberSpace, u64)
An association of packet numbers in a packet number space to information about them. Described in detail above in Appendix A.1 of quic-recovery.
MaxDatagramSize
The sender’s current maximum payload size. Does not include UDP or IP overhead. The max datagram size is used for congestion window computations. An endpoint sets the value of this variable based on its Path Maximum Transmission Unit (PMTU; see Section 14.2 of [QUIC-TRANSPORT]), with a minimum value of 1200 bytes.
EcnCeCounters(KPacketNumberSpace)
The highest value reported for the ECN-CE counter in the packet number space by the peer in an ACK frame. This value is used to detect increases in the reported ECN-CE counter.
BytesInFlight
The sum of the size in bytes of all sent packets that contain at least one ack-eliciting or PADDING frame, and have not been acknowledged or declared lost. The size does not include IP or UDP overhead, but does include the QUIC header and AEAD overhead. Packets only containing ACK frames do not count towards bytes_in_flight to ensure congestion control does not impede congestion feedback.
CongestionWindow
Maximum number of bytes-in-flight that may be sent.
CongestionRecoveryStartTime
The time when QUIC first detects congestion due to loss or ECN, causing it to enter congestion recovery. When a packet sent after this time is acknowledged, QUIC exits congestion recovery.
Ssthresh
Slow start threshold in bytes. When the congestion window is below ssthresh, the mode is slow start and the window grows by the number of bytes acknowledged.
Trait Implementations§
Source§impl Clone for RecoveryField
impl Clone for RecoveryField
Source§fn clone(&self) -> RecoveryField
fn clone(&self) -> RecoveryField
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moreSource§impl Debug for RecoveryField
impl Debug for RecoveryField
Source§impl<'de> Deserialize<'de> for RecoveryField
impl<'de> Deserialize<'de> for RecoveryField
Source§fn deserialize<__D>(
__deserializer: __D,
) -> Result<RecoveryField, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(
__deserializer: __D,
) -> Result<RecoveryField, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
Source§impl Serialize for RecoveryField
impl Serialize for RecoveryField
Source§fn serialize<__S>(
&self,
__serializer: __S,
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
fn serialize<__S>(
&self,
__serializer: __S,
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
impl Copy for RecoveryField
Auto Trait Implementations§
impl Freeze for RecoveryField
impl RefUnwindSafe for RecoveryField
impl Send for RecoveryField
impl Sync for RecoveryField
impl Unpin for RecoveryField
impl UnwindSafe for RecoveryField
Blanket Implementations§
Source§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
Source§type ArchivedMetadata = ()
type ArchivedMetadata = ()
Source§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
Source§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
Source§impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
Source§unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
Source§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
out
indicating that a T
is niched.