Index: net/quic/quic_fec_group.cc |
diff --git a/net/quic/quic_fec_group.cc b/net/quic/quic_fec_group.cc |
index aac272fb57bfa3a0eeba06c3fd0c4e01ec6cc49e..938c0cb5883a63035b8e0b5de305203a4e62838d 100644 |
--- a/net/quic/quic_fec_group.cc |
+++ b/net/quic/quic_fec_group.cc |
@@ -25,7 +25,8 @@ QuicFecGroup::QuicFecGroup() |
payload_parity_len_(0) { |
} |
-QuicFecGroup::~QuicFecGroup() {} |
+QuicFecGroup::~QuicFecGroup() { |
+} |
bool QuicFecGroup::Update(const QuicPacketHeader& header, |
StringPiece decrypted_payload) { |
@@ -89,7 +90,8 @@ size_t QuicFecGroup::Revive(QuicPacketHeader* header, |
// Identify the packet sequence number to be resurrected. |
QuicPacketSequenceNumber missing = kNoSequenceNumber; |
for (QuicPacketSequenceNumber i = min_protected_packet_; |
- i <= max_protected_packet_; ++i) { |
+ i <= max_protected_packet_; |
+ ++i) { |
// Is this packet missing? |
if (received_packets_.count(i) == 0) { |
missing = i; |
@@ -132,14 +134,13 @@ bool QuicFecGroup::UpdateParity(StringPiece payload) { |
payload_parity_len_ = payload.size(); |
} |
DCHECK_LE(payload.size(), kMaxPacketSize); |
- if (received_packets_.empty() && |
- min_protected_packet_ == kNoSequenceNumber) { |
+ if (received_packets_.empty() && min_protected_packet_ == kNoSequenceNumber) { |
// Initialize the parity to the value of this payload |
memcpy(payload_parity_, payload.data(), payload.size()); |
if (payload.size() < kMaxPacketSize) { |
// TODO(rch): expand as needed. |
- memset(payload_parity_ + payload.size(), 0, |
- kMaxPacketSize - payload.size()); |
+ memset( |
+ payload_parity_ + payload.size(), 0, kMaxPacketSize - payload.size()); |
} |
return true; |
} |
@@ -155,7 +156,7 @@ size_t QuicFecGroup::NumMissingPackets() const { |
if (min_protected_packet_ == kNoSequenceNumber) |
return numeric_limits<size_t>::max(); |
return (max_protected_packet_ - min_protected_packet_ + 1) - |
- received_packets_.size(); |
+ received_packets_.size(); |
} |
} // namespace net |