Land Recent QUIC Changes.

net/quic/congestion_control/time_loss_algorithm.h

 // 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.
 
 #ifndef NET_QUIC_CONGESTION_CONTROL_TIME_LOSS_ALGORITHM_H_
 #define NET_QUIC_CONGESTION_CONTROL_TIME_LOSS_ALGORITHM_H_
 
 #include <algorithm>
 #include <map>
 
@@ skipping 12 matching lines @@
   TimeLossAlgorithm();
   virtual ~TimeLossAlgorithm() {}
 
   // Declares pending packets less than the largest observed lost when it has
   // been 1.25 RTT since they were sent.  Packets larger than the largest
   // observed are retransmitted via TLP.
   virtual SequenceNumberSet DetectLostPackets(
       const QuicUnackedPacketMap& unacked_packets,
       const QuicTime& time,
       QuicPacketSequenceNumber largest_observed,
-      QuicTime::Delta srtt,
-      QuicTime::Delta latest_rtt) OVERRIDE;
+      const RttStats& rtt_stats) OVERRIDE;
 
   // Returns the time the next packet will be lost, or zero if there
   // are no nacked pending packets outstanding.
   // TODO(ianswett): Ideally the RTT variance and the RTT would be used to
   // determine the time a packet is considered lost.
   // TODO(ianswett): Consider using Max(1.25 * srtt, 1.125 * last_rtt).
   virtual QuicTime GetLossTimeout() const OVERRIDE;
 
  private:
   QuicTime loss_detection_timeout_;
 };
 
 }  // namespace net
 
 #endif  // NET_QUIC_CONGESTION_CONTROL_TIME_LOSS_ALGORITHM_H_