Update from https://crrev.com/304418

net/quic/quic_framer.cc

 // Copyright (c) 2012 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "net/quic/quic_framer.h"
 
 #include "base/containers/hash_tables.h"
 #include "base/stl_util.h"
 #include "net/quic/crypto/crypto_framer.h"
 #include "net/quic/crypto/crypto_handshake_message.h"
@@ skipping 960 matching lines @@
     default:
       LOG(DFATAL) << "Unreachable case statement.";
       return PACKET_FLAGS_6BYTE_SEQUENCE;
   }
 }
 
 // static
 QuicFramer::AckFrameInfo QuicFramer::GetAckFrameInfo(
     const QuicAckFrame& frame) {
   AckFrameInfo ack_info;
-  if (!frame.missing_packets.empty()) {
-    DCHECK_GE(frame.largest_observed, *frame.missing_packets.rbegin());
-    size_t cur_range_length = 0;
-    SequenceNumberSet::const_iterator iter = frame.missing_packets.begin();
-    QuicPacketSequenceNumber last_missing = *iter;
-    ++iter;
-    for (; iter != frame.missing_packets.end(); ++iter) {
-      if (cur_range_length != numeric_limits<uint8>::max() &&
-          *iter == (last_missing + 1)) {
-        ++cur_range_length;
-      } else {
-        ack_info.nack_ranges[last_missing - cur_range_length] =
-            cur_range_length;
-        cur_range_length = 0;
-      }
-      ack_info.max_delta = max(ack_info.max_delta, *iter - last_missing);
-      last_missing = *iter;
+  if (frame.missing_packets.empty()) {
+    return ack_info;
+  }
+  DCHECK_GE(frame.largest_observed, *frame.missing_packets.rbegin());
+  size_t cur_range_length = 0;
+  SequenceNumberSet::const_iterator iter = frame.missing_packets.begin();
+  QuicPacketSequenceNumber last_missing = *iter;
+  ++iter;
+  for (; iter != frame.missing_packets.end(); ++iter) {
+    if (cur_range_length != numeric_limits<uint8>::max() &&
+        *iter == (last_missing + 1)) {
+      ++cur_range_length;
+    } else {
+      ack_info.nack_ranges[last_missing - cur_range_length] = cur_range_length;
+      cur_range_length = 0;
     }
-    // Include the last nack range.
-    ack_info.nack_ranges[last_missing - cur_range_length] = cur_range_length;
-    // Include the range to the largest observed.
-    ack_info.max_delta = max(ack_info.max_delta,
-                             frame.largest_observed - last_missing);
+    ack_info.max_delta = max(ack_info.max_delta, *iter - last_missing);
+    last_missing = *iter;
   }
+  // Include the last nack range.
+  ack_info.nack_ranges[last_missing - cur_range_length] = cur_range_length;
+  // Include the range to the largest observed.
+  ack_info.max_delta =
+      max(ack_info.max_delta, frame.largest_observed - last_missing);
   return ack_info;
 }
 
 bool QuicFramer::ProcessPacketHeader(
     QuicPacketHeader* header,
     const QuicEncryptedPacket& packet) {
   if (!ProcessPacketSequenceNumber(header->public_header.sequence_number_length,
                                    &header->packet_sequence_number)) {
     set_detailed_error("Unable to read sequence number.");
     return RaiseError(QUIC_INVALID_PACKET_HEADER);
@@ skipping 1300 matching lines @@
 
 bool QuicFramer::RaiseError(QuicErrorCode error) {
   DVLOG(1) << "Error detail: " << detailed_error_;
   set_error(error);
   visitor_->OnError(this);
   reader_.reset(nullptr);
   return false;
 }
 
 }  // namespace net