Line data    Source code

       1             : #include "fd_quic_ack_tx.h"
       2             : #include "fd_quic_private.h"
       3             : 
       4             : #include "fd_quic_proto.h"
       5             : #include "fd_quic_proto.c"
       6             : 
       7             : static inline int
       8             : fd_quic_range_can_extend( fd_quic_range_t const * range,
       9    78754823 :                           ulong                   idx ) {
      10    78754823 :   return idx+1UL >= range->offset_lo && idx <= range->offset_hi;
      11    78754823 : }
      12             : 
      13             : static inline int
      14             : fd_quic_range_extend( fd_quic_range_t * range,
      15    78430104 :                       ulong             idx ) {
      16    78430104 :   int lo_decreased = idx <  range->offset_lo;
      17    78430104 :   int hi_increased = idx >= range->offset_hi;
      18    78430104 :   range->offset_lo = fd_ulong_min( range->offset_lo, idx );
      19    78430104 :   range->offset_hi = fd_ulong_max( range->offset_hi, idx+1UL );
      20    78430104 :   return lo_decreased || hi_increased;
      21    78430104 : }
      22             : 
      23             : int
      24             : fd_quic_ack_pkt( fd_quic_ack_gen_t * gen,
      25             :                  ulong               pkt_number,
      26             :                  uint                enc_level,
      27    78754829 :                  long                now ) {
      28             : 
      29    78754829 :   if( pkt_number == FD_QUIC_PKT_NUM_UNUSED ) return FD_QUIC_ACK_TX_NOOP;
      30             : 
      31             :   /* Can we merge pkt_number into the most recent ACK? */
      32    78754823 :   uint            cached_seq = gen->head - 1U;
      33    78754823 :   fd_quic_ack_t * cached_ack = fd_quic_ack_queue_ele( gen, cached_seq );
      34    78754823 :   if( ( enc_level == cached_ack->enc_level ) &
      35    78754823 :       fd_quic_range_can_extend( &cached_ack->pkt_number, pkt_number ) ) {
      36             : 
      37             :     /* update timestamp */
      38    78430104 :     if( pkt_number >= cached_ack->pkt_number.offset_hi ) {
      39    78430092 :       cached_ack->ts = now;
      40    78430092 :     }
      41             : 
      42             :     /* add packet number to existing range */
      43    78430104 :     int changed = fd_quic_range_extend( &cached_ack->pkt_number, pkt_number );
      44             : 
      45             :     /* re-enqueue most recent ACK for sending */
      46    78430104 :     if( changed && gen->head==gen->tail ) {
      47      276455 :       gen->tail = cached_seq;
      48      276455 :     }
      49             : 
      50    78430104 :     FD_ACK_DEBUG( FD_LOG_DEBUG(( "gen=%p queue ACK for enc=%u pkt_num=%lu range=[%lu,%lu) seq=%u (merged)",
      51    78430104 :         (void *)gen, enc_level, pkt_number, cached_ack->pkt_number.offset_lo, cached_ack->pkt_number.offset_hi, cached_seq )); )
      52    78430104 :     return FD_QUIC_ACK_TX_MERGED;
      53             : 
      54    78430104 :   }
      55             : 
      56             :   /* Attempt to allocate another ACK queue entry */
      57      324719 :   if( gen->head - gen->tail >= FD_QUIC_ACK_QUEUE_CNT ) {
      58           3 :     FD_DEBUG( FD_LOG_DEBUG(( "ACK queue overflow! (excessive reordering)" )); )
      59           3 :     return FD_QUIC_ACK_TX_ENOSPC;
      60           3 :   }
      61             : 
      62             :   /* Start new pending ACK */
      63      324716 :   FD_ACK_DEBUG( FD_LOG_DEBUG(( "gen=%p queue ACK for enc=%u pkt_num=%lu seq=%u",
      64      324716 :     (void *)gen, enc_level, pkt_number, gen->head )); )
      65      324716 :   fd_quic_ack_t * next_ack = fd_quic_ack_queue_ele( gen, gen->head );
      66      324716 :   *next_ack = (fd_quic_ack_t) {
      67      324716 :     .pkt_number = { .offset_lo = pkt_number, .offset_hi = pkt_number+1UL },
      68      324716 :     .enc_level  = (uchar)enc_level,
      69      324716 :     .ts         = now
      70      324716 :   };
      71      324716 :   gen->head += 1U;
      72      324716 :   return FD_QUIC_ACK_TX_NEW;
      73      324719 : }
      74             : 
      75             : void
      76             : fd_quic_ack_gen_abandon_enc_level( fd_quic_ack_gen_t * gen,
      77       24276 :                                    uint                enc_level ) {
      78       36414 :   for( ; gen->tail != gen->head; gen->tail++ ) {
      79       24219 :     fd_quic_ack_t const * ack = fd_quic_ack_queue_ele( gen, gen->tail );
      80       24219 :     if( ack->enc_level > enc_level ) break;
      81       24219 :     FD_DEBUG( FD_LOG_DEBUG(( "gen=%p discard ACK for enc=%u range=[%lu,%lu) seq=%u",
      82       24219 :         (void *)gen, enc_level, ack->pkt_number.offset_lo, ack->pkt_number.offset_hi, gen->tail )); )
      83       24219 :   }
      84       24276 : }
      85             : 
      86             : extern ulong
      87             : fd_quic_encode_ack_frame( uchar *               buf,
      88             :                           ulong                 sz,
      89             :                           fd_quic_ack_frame_t * frame );
      90             : 
      91             : uchar *
      92             : fd_quic_gen_ack_frames( fd_quic_ack_gen_t * gen,
      93             :                         uchar *             payload_ptr,
      94             :                         uchar *             payload_end,
      95             :                         uint                enc_level,
      96    17097668 :                         long                now ) {
      97             : 
      98    17097668 :   FD_ACK_DEBUG( FD_LOG_DEBUG(( "[ACK gen] elicited=%d", gen->is_elicited )); )
      99             :   /* Never generate an ACK frame if no ACK-eliciting packet is pending.
     100             :      This prevents an infinite ACK loop. */
     101    17097668 :   if( !gen->is_elicited ) return payload_ptr;
     102             : 
     103             :   /* Attempt to send all ACK ranges */
     104      342788 :   ulong ranges_sent = 0UL;
     105      631342 :   for( ; gen->tail != gen->head; gen->tail++ ) {
     106      348815 :     fd_quic_ack_t * ack = fd_quic_ack_queue_ele( gen, gen->tail );
     107      348815 :     if( ack->enc_level != enc_level ) {
     108       60243 :       FD_ACK_DEBUG( FD_LOG_DEBUG(( "need encryption level %u for ACKs but have %u", ack->enc_level, enc_level )); )
     109       60243 :       break;
     110       60243 :     }
     111             : 
     112      288572 :     long ack_delay_ns = fd_long_sat_sub( now, ack->ts );
     113      288572 :     long ack_delay_us = ack_delay_ns / (long)1e3;
     114             : 
     115      288572 :     if( FD_UNLIKELY( ack->pkt_number.offset_lo == ack->pkt_number.offset_hi ) ) continue;
     116      288572 :     fd_quic_ack_frame_t ack_frame = {
     117      288572 :       .type            = 0x02, /* type 0x02 is the base ack, 0x03 indicates ECN */
     118      288572 :       .largest_ack     = ack->pkt_number.offset_hi - 1U,
     119      288572 :       .ack_delay       = (ulong)ack_delay_us,
     120      288572 :       .ack_range_count = 0, /* no fragments */
     121      288572 :       .first_ack_range = ack->pkt_number.offset_hi - ack->pkt_number.offset_lo - 1U,
     122      288572 :     };
     123      288572 :     ulong frame_sz = fd_quic_encode_ack_frame( payload_ptr, (ulong)( payload_end - payload_ptr ), &ack_frame );
     124      288572 :     if( FD_UNLIKELY( frame_sz==FD_QUIC_ENCODE_FAIL ) ) {
     125          18 :       FD_DEBUG( FD_LOG_DEBUG(( "insufficient buffer space to send ACK" )); )
     126          18 :       break;
     127          18 :     }
     128      288554 :     payload_ptr += frame_sz;
     129      288554 :     ranges_sent += 1UL;
     130      288554 :     FD_ACK_DEBUG( FD_LOG_DEBUG(( "gen=%p sending ACK enc=%u range=[%lu,%lu) seq=%u sz=%lu",
     131      288554 :         (void *)gen, enc_level, ack->pkt_number.offset_lo, ack->pkt_number.offset_hi, gen->tail, frame_sz )); )
     132      288554 :   }
     133             : 
     134             :   /* If all frames were flushed, reset status bits. */
     135      342788 :   if( gen->head == gen->tail ) {
     136      282527 :     gen->is_elicited = 0;
     137      292914 :   } else {
     138       60261 :     FD_ACK_DEBUG( FD_LOG_DEBUG(( "Not all ACK frames were flushed" )); )
     139       60261 :   }
     140             : 
     141      342788 :   int const flushed = !gen->is_elicited;
     142      342788 :   FD_DTRACE_PROBE_3( fd_quic_gen_ack_frames, enc_level, ranges_sent, flushed );
     143             : 
     144      342788 :   return payload_ptr;
     145    17097668 : }