| OLD | NEW |
| 1 // Copyright 2015 The Chromium Authors. All rights reserved. | 1 // Copyright 2015 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #include "net/quic/congestion_control/general_loss_algorithm.h" | 5 #include "net/quic/congestion_control/general_loss_algorithm.h" |
| 6 | 6 |
| 7 #include <algorithm> | 7 #include <algorithm> |
| 8 | 8 |
| 9 #include "base/logging.h" | 9 #include "base/logging.h" |
| 10 #include "base/stl_util.h" | 10 #include "base/stl_util.h" |
| (...skipping 15 matching lines...) Expand all Loading... |
| 26 protected: | 26 protected: |
| 27 GeneralLossAlgorithmTest() { | 27 GeneralLossAlgorithmTest() { |
| 28 rtt_stats_.UpdateRtt(QuicTime::Delta::FromMilliseconds(100), | 28 rtt_stats_.UpdateRtt(QuicTime::Delta::FromMilliseconds(100), |
| 29 QuicTime::Delta::Zero(), clock_.Now()); | 29 QuicTime::Delta::Zero(), clock_.Now()); |
| 30 } | 30 } |
| 31 | 31 |
| 32 ~GeneralLossAlgorithmTest() override { STLDeleteElements(&packets_); } | 32 ~GeneralLossAlgorithmTest() override { STLDeleteElements(&packets_); } |
| 33 | 33 |
| 34 void SendDataPacket(QuicPacketNumber packet_number) { | 34 void SendDataPacket(QuicPacketNumber packet_number) { |
| 35 packets_.push_back(new QuicEncryptedPacket(nullptr, kDefaultLength)); | 35 packets_.push_back(new QuicEncryptedPacket(nullptr, kDefaultLength)); |
| 36 SerializedPacket packet( | 36 SerializedPacket packet(packet_number, PACKET_1BYTE_PACKET_NUMBER, |
| 37 packet_number, PACKET_1BYTE_PACKET_NUMBER, packets_.back(), 0, | 37 packets_.back(), 0, new RetransmittableFrames(), |
| 38 new RetransmittableFrames(ENCRYPTION_NONE), false, false); | 38 false, false); |
| 39 unacked_packets_.AddSentPacket(&packet, 0, NOT_RETRANSMISSION, clock_.Now(), | 39 unacked_packets_.AddSentPacket(&packet, 0, NOT_RETRANSMISSION, clock_.Now(), |
| 40 1000, true); | 40 1000, true); |
| 41 } | 41 } |
| 42 | 42 |
| 43 void VerifyLosses(QuicPacketNumber largest_observed, | 43 void VerifyLosses(QuicPacketNumber largest_observed, |
| 44 QuicPacketNumber* losses_expected, | 44 QuicPacketNumber* losses_expected, |
| 45 size_t num_losses) { | 45 size_t num_losses) { |
| 46 unacked_packets_.IncreaseLargestObserved(largest_observed); | 46 unacked_packets_.IncreaseLargestObserved(largest_observed); |
| 47 PacketNumberSet lost_packets = loss_algorithm_.DetectLostPackets( | 47 PacketNumberSet lost_packets = loss_algorithm_.DetectLostPackets( |
| 48 unacked_packets_, clock_.Now(), largest_observed, rtt_stats_); | 48 unacked_packets_, clock_.Now(), largest_observed, rtt_stats_); |
| (...skipping 245 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 294 loss_algorithm_.GetLossTimeout().Subtract(clock_.Now())); | 294 loss_algorithm_.GetLossTimeout().Subtract(clock_.Now())); |
| 295 clock_.AdvanceTime(rtt_stats_.smoothed_rtt().Multiply(0.25)); | 295 clock_.AdvanceTime(rtt_stats_.smoothed_rtt().Multiply(0.25)); |
| 296 QuicPacketNumber lost[] = {1, 2, 3, 4, 5, 6, 7, 8, 9}; | 296 QuicPacketNumber lost[] = {1, 2, 3, 4, 5, 6, 7, 8, 9}; |
| 297 VerifyLosses(10, lost, arraysize(lost)); | 297 VerifyLosses(10, lost, arraysize(lost)); |
| 298 EXPECT_EQ(QuicTime::Zero(), loss_algorithm_.GetLossTimeout()); | 298 EXPECT_EQ(QuicTime::Zero(), loss_algorithm_.GetLossTimeout()); |
| 299 } | 299 } |
| 300 | 300 |
| 301 } // namespace | 301 } // namespace |
| 302 } // namespace test | 302 } // namespace test |
| 303 } // namespace net | 303 } // namespace net |
| OLD | NEW |