Lines Matching full:ack
41 // an ack is being delayed. This is an optimization to reduce ack latency and
42 // packet count of pure ack packets.
70 // An alarm that is scheduled to send an ack if a timeout occurs.
476 DVLOG(1) << ENDPOINT << "Received an old ack frame: ignoring";
544 // A new ack has a diminished largest_observed value. Error out.
554 // We never process old ack frames, so this number should only increase.
658 // Must called before ack processing, because processing acks removes entries
662 // If the incoming packet was missing, send an ack immediately.
699 // If there are new missing packets to report, send an ack immediately.
723 DVLOG(1) << ENDPOINT << "Creating ack frame: " << *outgoing_ack;
739 // longer planning to send, we should send an ack to raise
752 // |include_ack| is false since we decide about ack bundling below.
756 // In general, we ack every second packet. When we don't ack the first
757 // packet, we set the delayed ack alarm. Thus, if the ack alarm is set
758 // then we know this is the second packet, and we should send an ack.
765 DVLOG(1) << "Ack timer set; next packet or timer will trigger ACK.";
770 // Now the we have received an ack, we might be able to send packets which
826 // Opportunistically bundle an ack with this outgoing packet, unless it's the
844 // Opportunistically bundle an ack with this outgoing packet.
928 // Set |include_ack| to false in bundler; ack inclusion happens elsewhere.
1061 // TODO(rch): consider removing this check so that if an ACK comes in
1163 ? "data bearing " : " ack only "))
1239 // (but have to queue it for some reason) then receive an ack
1241 // then receive a truncated ACK which causes us to raise the
1254 // the peer has not yet ACK'd the data. We need the subsequent
1568 // Opportunistically bundle an ack with this outgoing packet.
1675 // Move generator into batch mode. If caller wants us to include an ack,
1676 // check the delayed-ack timer to see if there's ack info to be sent.
1682 DVLOG(1) << "Bundling ack with outgoing packet.";
