Rename QUIC's TransmissionInfo pending to in_flight and the associated

net/quic/congestion_control/tcp_loss_algorithm_test.cc

 // Copyright 2014 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include <algorithm>
 
 #include "base/logging.h"
 #include "base/stl_util.h"
 #include "net/quic/congestion_control/rtt_stats.h"
 #include "net/quic/congestion_control/tcp_loss_algorithm.h"
@@ skipping 38 matching lines @@
   MockClock clock_;
 };
 
 TEST_F(TcpLossAlgorithmTest, NackRetransmit1Packet) {
   const size_t kNumSentPackets = 5;
   // Transmit 5 packets.
   for (size_t i = 1; i <= kNumSentPackets; ++i) {
     SendDataPacket(i);
   }
   // No loss on one ack.
-  unacked_packets_.SetNotPending(2);
+  unacked_packets_.RemoveFromInFlight(2);
   unacked_packets_.NackPacket(1, 1);
   VerifyLosses(2, NULL, 0);
   // No loss on two acks.
-  unacked_packets_.SetNotPending(3);
+  unacked_packets_.RemoveFromInFlight(3);
   unacked_packets_.NackPacket(1, 2);
   VerifyLosses(3, NULL, 0);
   // Loss on three acks.
-  unacked_packets_.SetNotPending(4);
+  unacked_packets_.RemoveFromInFlight(4);
   unacked_packets_.NackPacket(1, 3);
   QuicPacketSequenceNumber lost[] = { 1 };
   VerifyLosses(4, lost, arraysize(lost));
   EXPECT_EQ(QuicTime::Zero(), loss_algorithm_.GetLossTimeout());
 }
 
 // A stretch ack is an ack that covers more than 1 packet of previously
 // unacknowledged data.
 TEST_F(TcpLossAlgorithmTest, NackRetransmit1PacketWith1StretchAck) {
   const size_t kNumSentPackets = 10;
   // Transmit 10 packets.
   for (size_t i = 1; i <= kNumSentPackets; ++i) {
     SendDataPacket(i);
   }
 
   // Nack the first packet 3 times in a single StretchAck.
   unacked_packets_.NackPacket(1, 3);
-  unacked_packets_.SetNotPending(2);
-  unacked_packets_.SetNotPending(3);
-  unacked_packets_.SetNotPending(4);
+  unacked_packets_.RemoveFromInFlight(2);
+  unacked_packets_.RemoveFromInFlight(3);
+  unacked_packets_.RemoveFromInFlight(4);
   QuicPacketSequenceNumber lost[] = { 1 };
   VerifyLosses(4, lost, arraysize(lost));
   EXPECT_EQ(QuicTime::Zero(), loss_algorithm_.GetLossTimeout());
 }
 
 // Ack a packet 3 packets ahead, causing a retransmit.
 TEST_F(TcpLossAlgorithmTest, NackRetransmit1PacketSingleAck) {
   const size_t kNumSentPackets = 10;
   // Transmit 10 packets.
   for (size_t i = 1; i <= kNumSentPackets; ++i) {
     SendDataPacket(i);
   }
 
   // Nack the first packet 3 times in an AckFrame with three missing packets.
   unacked_packets_.NackPacket(1, 3);
   unacked_packets_.NackPacket(2, 2);
   unacked_packets_.NackPacket(3, 1);
-  unacked_packets_.SetNotPending(4);
+  unacked_packets_.RemoveFromInFlight(4);
   QuicPacketSequenceNumber lost[] = { 1 };
   VerifyLosses(4, lost, arraysize(lost));
   EXPECT_EQ(QuicTime::Zero(), loss_algorithm_.GetLossTimeout());
 }
 
 TEST_F(TcpLossAlgorithmTest, EarlyRetransmit1Packet) {
   const size_t kNumSentPackets = 2;
   // Transmit 2 packets.
   for (size_t i = 1; i <= kNumSentPackets; ++i) {
     SendDataPacket(i);
   }
   // Early retransmit when the final packet gets acked and the first is nacked.
-  unacked_packets_.SetNotPending(2);
+  unacked_packets_.RemoveFromInFlight(2);
   unacked_packets_.NackPacket(1, 1);
   VerifyLosses(2, NULL, 0);
   EXPECT_EQ(clock_.Now().Add(rtt_stats_.SmoothedRtt().Multiply(1.25)),
             loss_algorithm_.GetLossTimeout());
 
   clock_.AdvanceTime(rtt_stats_.latest_rtt().Multiply(1.25));
   QuicPacketSequenceNumber lost[] = { 1 };
   VerifyLosses(2, lost, arraysize(lost));
   EXPECT_EQ(QuicTime::Zero(), loss_algorithm_.GetLossTimeout());
 }
 
 TEST_F(TcpLossAlgorithmTest, EarlyRetransmitAllPackets) {
   const size_t kNumSentPackets = 5;
   for (size_t i = 1; i <= kNumSentPackets; ++i) {
     SendDataPacket(i);
     // Advance the time 1/4 RTT between 3 and 4.
     if (i == 3) {
       clock_.AdvanceTime(rtt_stats_.SmoothedRtt().Multiply(0.25));
     }
   }
 
   // Early retransmit when the final packet gets acked and 1.25 RTTs have
   // elapsed since the packets were sent.
-  unacked_packets_.SetNotPending(kNumSentPackets);
+  unacked_packets_.RemoveFromInFlight(kNumSentPackets);
   // This simulates a single ack following multiple missing packets with FACK.
   for (size_t i = 1; i < kNumSentPackets; ++i) {
     unacked_packets_.NackPacket(i, kNumSentPackets - i);
   }
   QuicPacketSequenceNumber lost[] = { 1, 2 };
   VerifyLosses(kNumSentPackets, lost, arraysize(lost));
   // The time has already advanced 1/4 an RTT, so ensure the timeout is set
   // 1.25 RTTs after the earliest pending packet(3), not the last(4).
   EXPECT_EQ(clock_.Now().Add(rtt_stats_.SmoothedRtt()),
             loss_algorithm_.GetLossTimeout());
@@ skipping 13 matching lines @@
   const size_t kNumSentPackets = 2;
   // Transmit 2 packets.
   for (size_t i = 1; i <= kNumSentPackets; ++i) {
     SendDataPacket(i);
   }
   // Neuter packet 1.
   unacked_packets_.RemoveRetransmittability(1);
 
   // Early retransmit when the final packet gets acked and the first is nacked.
   unacked_packets_.IncreaseLargestObserved(2);
-  unacked_packets_.SetNotPending(2);
+  unacked_packets_.RemoveFromInFlight(2);
   unacked_packets_.NackPacket(1, 1);
   VerifyLosses(2, NULL, 0);
   EXPECT_EQ(QuicTime::Zero(), loss_algorithm_.GetLossTimeout());
 }
 
 }  // namespace test
 }  // namespace net