OLD | NEW |
1 // Copyright 2014 The Chromium Authors. All rights reserved. | 1 // Copyright 2014 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/time_loss_algorithm.h" | 5 #include "net/quic/congestion_control/time_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 18 matching lines...) Expand all Loading... |
29 QuicTime::Delta::Zero(), | 29 QuicTime::Delta::Zero(), |
30 clock_.Now()); | 30 clock_.Now()); |
31 } | 31 } |
32 | 32 |
33 ~TimeLossAlgorithmTest() override { | 33 ~TimeLossAlgorithmTest() override { |
34 STLDeleteElements(&packets_); | 34 STLDeleteElements(&packets_); |
35 } | 35 } |
36 | 36 |
37 void SendDataPacket(QuicPacketNumber packet_number) { | 37 void SendDataPacket(QuicPacketNumber packet_number) { |
38 packets_.push_back(new QuicEncryptedPacket(nullptr, kDefaultLength)); | 38 packets_.push_back(new QuicEncryptedPacket(nullptr, kDefaultLength)); |
39 SerializedPacket packet(packet_number, PACKET_1BYTE_PACKET_NUMBER, | 39 SerializedPacket packet(kDefaultPathId, packet_number, |
40 packets_.back(), 0, new RetransmittableFrames(), | 40 PACKET_1BYTE_PACKET_NUMBER, packets_.back(), 0, |
41 false, false); | 41 new RetransmittableFrames(), false, false); |
42 unacked_packets_.AddSentPacket(&packet, 0, NOT_RETRANSMISSION, clock_.Now(), | 42 unacked_packets_.AddSentPacket(&packet, 0, NOT_RETRANSMISSION, clock_.Now(), |
43 1000, true); | 43 1000, true); |
44 } | 44 } |
45 | 45 |
46 void VerifyLosses(QuicPacketNumber largest_observed, | 46 void VerifyLosses(QuicPacketNumber largest_observed, |
47 QuicPacketNumber* losses_expected, | 47 QuicPacketNumber* losses_expected, |
48 size_t num_losses) { | 48 size_t num_losses) { |
49 PacketNumberSet lost_packets = loss_algorithm_.DetectLostPackets( | 49 PacketNumberSet lost_packets = loss_algorithm_.DetectLostPackets( |
50 unacked_packets_, clock_.Now(), largest_observed, rtt_stats_); | 50 unacked_packets_, clock_.Now(), largest_observed, rtt_stats_); |
51 EXPECT_EQ(num_losses, lost_packets.size()); | 51 EXPECT_EQ(num_losses, lost_packets.size()); |
(...skipping 90 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
142 loss_algorithm_.GetLossTimeout().Subtract(clock_.Now())); | 142 loss_algorithm_.GetLossTimeout().Subtract(clock_.Now())); |
143 clock_.AdvanceTime(rtt_stats_.smoothed_rtt().Multiply(0.25)); | 143 clock_.AdvanceTime(rtt_stats_.smoothed_rtt().Multiply(0.25)); |
144 QuicPacketNumber lost[] = {1, 2, 3, 4, 5, 6, 7, 8, 9}; | 144 QuicPacketNumber lost[] = {1, 2, 3, 4, 5, 6, 7, 8, 9}; |
145 VerifyLosses(10, lost, arraysize(lost)); | 145 VerifyLosses(10, lost, arraysize(lost)); |
146 EXPECT_EQ(QuicTime::Zero(), loss_algorithm_.GetLossTimeout()); | 146 EXPECT_EQ(QuicTime::Zero(), loss_algorithm_.GetLossTimeout()); |
147 } | 147 } |
148 | 148 |
149 } // namespace | 149 } // namespace |
150 } // namespace test | 150 } // namespace test |
151 } // namespace net | 151 } // namespace net |
OLD | NEW |