Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(140)

Side by Side Diff: net/quic/congestion_control/tcp_loss_algorithm.cc

Issue 302783003: Rename QUIC's TransmissionInfo pending to in_flight and the associated (Closed) Base URL: svn://svn.chromium.org/chrome/trunk/src
Patch Set: Created 6 years, 7 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch | Annotate | Revision Log
« no previous file with comments | « no previous file | net/quic/congestion_control/tcp_loss_algorithm_test.cc » ('j') | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
OLDNEW
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/tcp_loss_algorithm.h" 5 #include "net/quic/congestion_control/tcp_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 22 matching lines...) Expand all
33 const QuicTime& time, 33 const QuicTime& time,
34 QuicPacketSequenceNumber largest_observed, 34 QuicPacketSequenceNumber largest_observed,
35 const RttStats& rtt_stats) { 35 const RttStats& rtt_stats) {
36 SequenceNumberSet lost_packets; 36 SequenceNumberSet lost_packets;
37 loss_detection_timeout_ = QuicTime::Zero(); 37 loss_detection_timeout_ = QuicTime::Zero();
38 QuicTime::Delta loss_delay = 38 QuicTime::Delta loss_delay =
39 rtt_stats.SmoothedRtt().Multiply(kEarlyRetransmitLossDelayMultiplier); 39 rtt_stats.SmoothedRtt().Multiply(kEarlyRetransmitLossDelayMultiplier);
40 40
41 for (QuicUnackedPacketMap::const_iterator it = unacked_packets.begin(); 41 for (QuicUnackedPacketMap::const_iterator it = unacked_packets.begin();
42 it != unacked_packets.end() && it->first <= largest_observed; ++it) { 42 it != unacked_packets.end() && it->first <= largest_observed; ++it) {
43 if (!it->second.pending) { 43 if (!it->second.in_flight) {
44 continue; 44 continue;
45 } 45 }
46 46
47 LOG_IF(DFATAL, it->second.nack_count == 0) 47 LOG_IF(DFATAL, it->second.nack_count == 0)
48 << "All packets less than largest observed should have been nacked."; 48 << "All packets less than largest observed should have been nacked.";
49 if (it->second.nack_count >= kNumberOfNacksBeforeRetransmission) { 49 if (it->second.nack_count >= kNumberOfNacksBeforeRetransmission) {
50 lost_packets.insert(it->first); 50 lost_packets.insert(it->first);
51 continue; 51 continue;
52 } 52 }
53 53
54 // Only early retransmit(RFC5827) when the last packet gets acked and 54 // Only early retransmit(RFC5827) when the last packet gets acked and
55 // there are pending retransmittable packets. 55 // there are retransmittable packets in flight.
56 // This also implements a timer-protected variant of FACK. 56 // This also implements a timer-protected variant of FACK.
57 if (it->second.retransmittable_frames && 57 if (it->second.retransmittable_frames &&
58 unacked_packets.largest_sent_packet() == largest_observed) { 58 unacked_packets.largest_sent_packet() == largest_observed) {
59 // Early retransmit marks the packet as lost once 1.25RTTs have passed 59 // Early retransmit marks the packet as lost once 1.25RTTs have passed
60 // since the packet was sent and otherwise sets an alarm. 60 // since the packet was sent and otherwise sets an alarm.
61 if (time >= it->second.sent_time.Add(loss_delay)) { 61 if (time >= it->second.sent_time.Add(loss_delay)) {
62 lost_packets.insert(it->first); 62 lost_packets.insert(it->first);
63 } else { 63 } else {
64 // Set the timeout for the earliest retransmittable packet where early 64 // Set the timeout for the earliest retransmittable packet where early
65 // retransmit applies. 65 // retransmit applies.
66 loss_detection_timeout_ = it->second.sent_time.Add(loss_delay); 66 loss_detection_timeout_ = it->second.sent_time.Add(loss_delay);
67 break; 67 break;
68 } 68 }
69 } 69 }
70 } 70 }
71 71
72 return lost_packets; 72 return lost_packets;
73 } 73 }
74 74
75 QuicTime TCPLossAlgorithm::GetLossTimeout() const { 75 QuicTime TCPLossAlgorithm::GetLossTimeout() const {
76 return loss_detection_timeout_; 76 return loss_detection_timeout_;
77 } 77 }
78 78
79 } // namespace net 79 } // namespace net
OLDNEW
« no previous file with comments | « no previous file | net/quic/congestion_control/tcp_loss_algorithm_test.cc » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698