OLD | NEW |
1 // Copyright 2013 The Chromium Authors. All rights reserved. | 1 // Copyright 2013 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/core/quic_received_packet_manager.h" | 5 #include "net/quic/core/quic_received_packet_manager.h" |
6 | 6 |
7 #include <limits> | 7 #include <limits> |
8 #include <utility> | 8 #include <utility> |
9 | 9 |
10 #include "base/logging.h" | 10 #include "base/logging.h" |
(...skipping 124 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
135 ack_frame_updated_(false), | 135 ack_frame_updated_(false), |
136 time_largest_observed_(QuicTime::Zero()), | 136 time_largest_observed_(QuicTime::Zero()), |
137 stats_(stats) { | 137 stats_(stats) { |
138 ack_frame_.largest_observed = 0; | 138 ack_frame_.largest_observed = 0; |
139 ack_frame_.entropy_hash = 0; | 139 ack_frame_.entropy_hash = 0; |
140 } | 140 } |
141 | 141 |
142 QuicReceivedPacketManager::~QuicReceivedPacketManager() {} | 142 QuicReceivedPacketManager::~QuicReceivedPacketManager() {} |
143 | 143 |
144 void QuicReceivedPacketManager::RecordPacketReceived( | 144 void QuicReceivedPacketManager::RecordPacketReceived( |
145 QuicByteCount bytes, | |
146 const QuicPacketHeader& header, | 145 const QuicPacketHeader& header, |
147 QuicTime receipt_time) { | 146 QuicTime receipt_time) { |
148 QuicPacketNumber packet_number = header.packet_number; | 147 QuicPacketNumber packet_number = header.packet_number; |
149 DCHECK(IsAwaitingPacket(packet_number)); | 148 DCHECK(IsAwaitingPacket(packet_number)) << " packet_number:" << packet_number; |
150 if (!ack_frame_updated_) { | 149 if (!ack_frame_updated_) { |
151 ack_frame_.received_packet_times.clear(); | 150 ack_frame_.received_packet_times.clear(); |
152 } | 151 } |
153 ack_frame_updated_ = true; | 152 ack_frame_updated_ = true; |
154 if (ack_frame_.missing) { | 153 if (ack_frame_.missing) { |
155 // Adds the range of packet numbers from max(largest observed + 1, least | 154 // Adds the range of packet numbers from max(largest observed + 1, least |
156 // awaiting ack) up to packet_number not including packet_number. | 155 // awaiting ack) up to packet_number not including packet_number. |
157 ack_frame_.packets.Add( | 156 ack_frame_.packets.Add( |
158 max(ack_frame_.largest_observed + 1, peer_least_packet_awaiting_ack_), | 157 max(ack_frame_.largest_observed + 1, peer_least_packet_awaiting_ack_), |
159 packet_number); | 158 packet_number); |
(...skipping 157 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
317 | 316 |
318 bool QuicReceivedPacketManager::ack_frame_updated() const { | 317 bool QuicReceivedPacketManager::ack_frame_updated() const { |
319 return ack_frame_updated_; | 318 return ack_frame_updated_; |
320 } | 319 } |
321 | 320 |
322 QuicPacketNumber QuicReceivedPacketManager::GetLargestObserved() const { | 321 QuicPacketNumber QuicReceivedPacketManager::GetLargestObserved() const { |
323 return ack_frame_.largest_observed; | 322 return ack_frame_.largest_observed; |
324 } | 323 } |
325 | 324 |
326 } // namespace net | 325 } // namespace net |
OLD | NEW |