QUIC_PN_INVALID
if (apkt->largest_acked != QUIC_PN_INVALID)
ackm->largest_acked_pkt[i] = QUIC_PN_INVALID;
if (ackm->largest_acked_pkt[pkt_space] == QUIC_PN_INVALID)
QUIC_PN highest = QUIC_PN_INVALID;
highest = (highest == QUIC_PN_INVALID)
if (highest != QUIC_PN_INVALID)
assert(ackm->largest_acked_pkt[pkt_space] != QUIC_PN_INVALID);
rxe->pn = QUIC_PN_INVALID;
tpkt->ackm_pkt.largest_acked = QUIC_PN_INVALID;
= (largest_acked == QUIC_PN_INVALID) ? pn + 1 : pn - largest_acked;
tx->largest_acked = QUIC_PN_INVALID;
tx->largest_acked = QUIC_PN_INVALID;
RX_OP_TX(0, 0, QUIC_PN_INVALID)
pkt->ackm_pkt.largest_acked = QUIC_PN_INVALID;
pkt2->ackm_pkt.largest_acked = QUIC_PN_INVALID;