| OLD | NEW |
| 1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2012 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_fec_group.h" | 5 #include "net/quic/quic_fec_group.h" |
| 6 | 6 |
| 7 #include <limits> | 7 #include <limits> |
| 8 | 8 |
| 9 #include "base/basictypes.h" | 9 #include "base/basictypes.h" |
| 10 #include "base/logging.h" | 10 #include "base/logging.h" |
| 11 | 11 |
| 12 using base::StringPiece; | 12 using base::StringPiece; |
| 13 using std::numeric_limits; | 13 using std::numeric_limits; |
| 14 using std::set; | 14 using std::set; |
| 15 | 15 |
| 16 namespace net { | 16 namespace net { |
| 17 | 17 |
| 18 namespace { | 18 namespace { |
| 19 const QuicPacketSequenceNumber kNoSequenceNumber = kuint64max; | 19 const QuicPacketSequenceNumber kNoSequenceNumber = kuint64max; |
| 20 } // namespace | 20 } // namespace |
| 21 | 21 |
| 22 QuicFecGroup::QuicFecGroup() | 22 QuicFecGroup::QuicFecGroup() |
| 23 : min_protected_packet_(kNoSequenceNumber), | 23 : min_protected_packet_(kNoSequenceNumber), |
| 24 max_protected_packet_(kNoSequenceNumber), | 24 max_protected_packet_(kNoSequenceNumber), |
| 25 payload_parity_len_(0) { | 25 payload_parity_len_(0), |
| 26 effective_encryption_level_(NUM_ENCRYPTION_LEVELS) { |
| 26 } | 27 } |
| 27 | 28 |
| 28 QuicFecGroup::~QuicFecGroup() {} | 29 QuicFecGroup::~QuicFecGroup() {} |
| 29 | 30 |
| 30 bool QuicFecGroup::Update(const QuicPacketHeader& header, | 31 bool QuicFecGroup::Update(EncryptionLevel encryption_level, |
| 32 const QuicPacketHeader& header, |
| 31 StringPiece decrypted_payload) { | 33 StringPiece decrypted_payload) { |
| 32 if (received_packets_.count(header.packet_sequence_number) != 0) { | 34 if (received_packets_.count(header.packet_sequence_number) != 0) { |
| 33 return false; | 35 return false; |
| 34 } | 36 } |
| 35 if (min_protected_packet_ != kNoSequenceNumber && | 37 if (min_protected_packet_ != kNoSequenceNumber && |
| 36 max_protected_packet_ != kNoSequenceNumber && | 38 max_protected_packet_ != kNoSequenceNumber && |
| 37 (header.packet_sequence_number < min_protected_packet_ || | 39 (header.packet_sequence_number < min_protected_packet_ || |
| 38 header.packet_sequence_number > max_protected_packet_)) { | 40 header.packet_sequence_number > max_protected_packet_)) { |
| 39 DLOG(ERROR) << "FEC group does not cover received packet: " | 41 DLOG(ERROR) << "FEC group does not cover received packet: " |
| 40 << header.packet_sequence_number; | 42 << header.packet_sequence_number; |
| 41 return false; | 43 return false; |
| 42 } | 44 } |
| 43 if (!UpdateParity(decrypted_payload)) { | 45 if (!UpdateParity(decrypted_payload)) { |
| 44 return false; | 46 return false; |
| 45 } | 47 } |
| 46 received_packets_.insert(header.packet_sequence_number); | 48 received_packets_.insert(header.packet_sequence_number); |
| 49 if (encryption_level < effective_encryption_level_) { |
| 50 effective_encryption_level_ = encryption_level; |
| 51 } |
| 47 return true; | 52 return true; |
| 48 } | 53 } |
| 49 | 54 |
| 50 bool QuicFecGroup::UpdateFec( | 55 bool QuicFecGroup::UpdateFec( |
| 56 EncryptionLevel encryption_level, |
| 51 QuicPacketSequenceNumber fec_packet_sequence_number, | 57 QuicPacketSequenceNumber fec_packet_sequence_number, |
| 52 const QuicFecData& fec) { | 58 const QuicFecData& fec) { |
| 53 if (min_protected_packet_ != kNoSequenceNumber) { | 59 if (min_protected_packet_ != kNoSequenceNumber) { |
| 54 return false; | 60 return false; |
| 55 } | 61 } |
| 56 SequenceNumberSet::const_iterator it = received_packets_.begin(); | 62 SequenceNumberSet::const_iterator it = received_packets_.begin(); |
| 57 while (it != received_packets_.end()) { | 63 while (it != received_packets_.end()) { |
| 58 if ((*it < fec.fec_group) || (*it >= fec_packet_sequence_number)) { | 64 if ((*it < fec.fec_group) || (*it >= fec_packet_sequence_number)) { |
| 59 DLOG(ERROR) << "FEC group does not cover received packet: " << *it; | 65 DLOG(ERROR) << "FEC group does not cover received packet: " << *it; |
| 60 return false; | 66 return false; |
| 61 } | 67 } |
| 62 ++it; | 68 ++it; |
| 63 } | 69 } |
| 64 if (!UpdateParity(fec.redundancy)) { | 70 if (!UpdateParity(fec.redundancy)) { |
| 65 return false; | 71 return false; |
| 66 } | 72 } |
| 67 min_protected_packet_ = fec.fec_group; | 73 min_protected_packet_ = fec.fec_group; |
| 68 max_protected_packet_ = fec_packet_sequence_number - 1; | 74 max_protected_packet_ = fec_packet_sequence_number - 1; |
| 75 if (encryption_level < effective_encryption_level_) { |
| 76 effective_encryption_level_ = encryption_level; |
| 77 } |
| 69 return true; | 78 return true; |
| 70 } | 79 } |
| 71 | 80 |
| 72 bool QuicFecGroup::CanRevive() const { | 81 bool QuicFecGroup::CanRevive() const { |
| 73 // We can revive if we're missing exactly 1 packet. | 82 // We can revive if we're missing exactly 1 packet. |
| 74 return NumMissingPackets() == 1; | 83 return NumMissingPackets() == 1; |
| 75 } | 84 } |
| 76 | 85 |
| 77 bool QuicFecGroup::IsFinished() const { | 86 bool QuicFecGroup::IsFinished() const { |
| 78 // We are finished if we are not missing any packets. | 87 // We are finished if we are not missing any packets. |
| (...skipping 73 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 152 } | 161 } |
| 153 | 162 |
| 154 size_t QuicFecGroup::NumMissingPackets() const { | 163 size_t QuicFecGroup::NumMissingPackets() const { |
| 155 if (min_protected_packet_ == kNoSequenceNumber) | 164 if (min_protected_packet_ == kNoSequenceNumber) |
| 156 return numeric_limits<size_t>::max(); | 165 return numeric_limits<size_t>::max(); |
| 157 return (max_protected_packet_ - min_protected_packet_ + 1) - | 166 return (max_protected_packet_ - min_protected_packet_ + 1) - |
| 158 received_packets_.size(); | 167 received_packets_.size(); |
| 159 } | 168 } |
| 160 | 169 |
| 161 } // namespace net | 170 } // namespace net |
| OLD | NEW |