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 "net/quic/congestion_control/rtt_stats.h" | 7 #include "net/quic/congestion_control/rtt_stats.h" |
8 #include "net/quic/quic_protocol.h" | 8 #include "net/quic/quic_protocol.h" |
9 | 9 |
10 namespace net { | 10 namespace net { |
(...skipping 21 matching lines...) Expand all Loading... |
32 const QuicTime& time, | 32 const QuicTime& time, |
33 QuicPacketSequenceNumber largest_observed, | 33 QuicPacketSequenceNumber largest_observed, |
34 const RttStats& rtt_stats) { | 34 const RttStats& rtt_stats) { |
35 SequenceNumberSet lost_packets; | 35 SequenceNumberSet lost_packets; |
36 loss_detection_timeout_ = QuicTime::Zero(); | 36 loss_detection_timeout_ = QuicTime::Zero(); |
37 QuicTime::Delta loss_delay = QuicTime::Delta::Max( | 37 QuicTime::Delta loss_delay = QuicTime::Delta::Max( |
38 QuicTime::Delta::FromMilliseconds(kMinLossDelayMs), | 38 QuicTime::Delta::FromMilliseconds(kMinLossDelayMs), |
39 QuicTime::Delta::Max(rtt_stats.SmoothedRtt(), rtt_stats.latest_rtt()) | 39 QuicTime::Delta::Max(rtt_stats.SmoothedRtt(), rtt_stats.latest_rtt()) |
40 .Multiply(kLossDelayMultiplier)); | 40 .Multiply(kLossDelayMultiplier)); |
41 | 41 |
42 QuicPacketSequenceNumber sequence_number = unacked_packets.GetLeastUnacked(); | |
43 for (QuicUnackedPacketMap::const_iterator it = unacked_packets.begin(); | 42 for (QuicUnackedPacketMap::const_iterator it = unacked_packets.begin(); |
44 it != unacked_packets.end() && sequence_number <= largest_observed; | 43 it != unacked_packets.end() && it->first <= largest_observed; ++it) { |
45 ++it, ++sequence_number) { | 44 if (!it->second.in_flight) { |
46 if (!it->in_flight) { | |
47 continue; | 45 continue; |
48 } | 46 } |
49 LOG_IF(DFATAL, it->nack_count == 0) | 47 LOG_IF(DFATAL, it->second.nack_count == 0) |
50 << "All packets less than largest observed should have been nacked."; | 48 << "All packets less than largest observed should have been nacked."; |
51 | 49 |
52 // Packets are sent in order, so break when we haven't waited long enough | 50 // Packets are sent in order, so break when we haven't waited long enough |
53 // to lose any more packets and leave the loss_time_ set for the timeout. | 51 // to lose any more packets and leave the loss_time_ set for the timeout. |
54 QuicTime when_lost = it->sent_time.Add(loss_delay); | 52 QuicTime when_lost = it->second.sent_time.Add(loss_delay); |
55 if (time < when_lost) { | 53 if (time < when_lost) { |
56 loss_detection_timeout_ = when_lost; | 54 loss_detection_timeout_ = when_lost; |
57 break; | 55 break; |
58 } | 56 } |
59 lost_packets.insert(sequence_number); | 57 lost_packets.insert(it->first); |
60 } | 58 } |
61 | 59 |
62 return lost_packets; | 60 return lost_packets; |
63 } | 61 } |
64 | 62 |
65 // loss_time_ is updated in DetectLostPackets, which must be called every time | 63 // loss_time_ is updated in DetectLostPackets, which must be called every time |
66 // an ack is received or the timeout expires. | 64 // an ack is received or the timeout expires. |
67 QuicTime TimeLossAlgorithm::GetLossTimeout() const { | 65 QuicTime TimeLossAlgorithm::GetLossTimeout() const { |
68 return loss_detection_timeout_; | 66 return loss_detection_timeout_; |
69 } | 67 } |
70 | 68 |
71 } // namespace net | 69 } // namespace net |
OLD | NEW |