| 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/quic_unacked_packet_map.h" | 5 #include "net/quic/quic_unacked_packet_map.h" |
| 6 | 6 |
| 7 #include "base/logging.h" | 7 #include "base/logging.h" |
| 8 #include "base/stl_util.h" | 8 #include "base/stl_util.h" |
| 9 #include "net/quic/quic_connection_stats.h" | 9 #include "net/quic/quic_connection_stats.h" |
| 10 #include "net/quic/quic_utils_chromium.h" | 10 #include "net/quic/quic_utils_chromium.h" |
| (...skipping 164 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 175 | 175 |
| 176 bool QuicUnackedPacketMap::HasRetransmittableFrames( | 176 bool QuicUnackedPacketMap::HasRetransmittableFrames( |
| 177 QuicPacketSequenceNumber sequence_number) const { | 177 QuicPacketSequenceNumber sequence_number) const { |
| 178 DCHECK_GE(sequence_number, least_unacked_); | 178 DCHECK_GE(sequence_number, least_unacked_); |
| 179 DCHECK_LT(sequence_number, least_unacked_ + unacked_packets_.size()); | 179 DCHECK_LT(sequence_number, least_unacked_ + unacked_packets_.size()); |
| 180 return unacked_packets_[sequence_number - least_unacked_] | 180 return unacked_packets_[sequence_number - least_unacked_] |
| 181 .retransmittable_frames != nullptr; | 181 .retransmittable_frames != nullptr; |
| 182 } | 182 } |
| 183 | 183 |
| 184 void QuicUnackedPacketMap::NackPacket(QuicPacketSequenceNumber sequence_number, | 184 void QuicUnackedPacketMap::NackPacket(QuicPacketSequenceNumber sequence_number, |
| 185 size_t min_nacks) { | 185 QuicPacketCount min_nacks) { |
| 186 DCHECK_GE(sequence_number, least_unacked_); | 186 DCHECK_GE(sequence_number, least_unacked_); |
| 187 DCHECK_LT(sequence_number, least_unacked_ + unacked_packets_.size()); | 187 DCHECK_LT(sequence_number, least_unacked_ + unacked_packets_.size()); |
| 188 unacked_packets_[sequence_number - least_unacked_].nack_count = | 188 unacked_packets_[sequence_number - least_unacked_].nack_count = |
| 189 max(min_nacks, | 189 max(min_nacks, |
| 190 unacked_packets_[sequence_number - least_unacked_].nack_count); | 190 unacked_packets_[sequence_number - least_unacked_].nack_count); |
| 191 } | 191 } |
| 192 | 192 |
| 193 void QuicUnackedPacketMap::RemoveRetransmittability( | 193 void QuicUnackedPacketMap::RemoveRetransmittability( |
| 194 QuicPacketSequenceNumber sequence_number) { | 194 QuicPacketSequenceNumber sequence_number) { |
| 195 DCHECK_GE(sequence_number, least_unacked_); | 195 DCHECK_GE(sequence_number, least_unacked_); |
| (...skipping 181 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 377 TransmissionInfo* info = &unacked_packets_[sequence_number - least_unacked_]; | 377 TransmissionInfo* info = &unacked_packets_[sequence_number - least_unacked_]; |
| 378 DCHECK(!info->in_flight); | 378 DCHECK(!info->in_flight); |
| 379 DCHECK_NE(0u, info->bytes_sent); | 379 DCHECK_NE(0u, info->bytes_sent); |
| 380 DCHECK(info->sent_time.IsInitialized()); | 380 DCHECK(info->sent_time.IsInitialized()); |
| 381 | 381 |
| 382 bytes_in_flight_ += info->bytes_sent; | 382 bytes_in_flight_ += info->bytes_sent; |
| 383 info->in_flight = true; | 383 info->in_flight = true; |
| 384 } | 384 } |
| 385 | 385 |
| 386 } // namespace net | 386 } // namespace net |
| OLD | NEW |