Switch to standard integer types in net/.

net/quic/quic_connection_logger.cc

 // Copyright (c) 2013 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_connection_logger.h"
 
 #include <algorithm>
 #include <string>
 
 #include "base/bind.h"
@@ skipping 337 matching lines @@
       net_log_.AddEvent(
           NetLog::TYPE_QUIC_SESSION_STREAM_FRAME_SENT,
           base::Bind(&NetLogQuicStreamFrameCallback, frame.stream_frame));
       break;
     case ACK_FRAME: {
       net_log_.AddEvent(
           NetLog::TYPE_QUIC_SESSION_ACK_FRAME_SENT,
           base::Bind(&NetLogQuicAckFrameCallback, frame.ack_frame));
       const PacketNumberQueue& missing_packets =
           frame.ack_frame->missing_packets;
-      const uint8 max_ranges = std::numeric_limits<uint8>::max();
+      const uint8_t max_ranges = std::numeric_limits<uint8_t>::max();
       // Compute an upper bound on the number of NACK ranges. If the bound
       // is below the max, then it clearly isn't truncated.
       if (missing_packets.NumPacketsSlow() < max_ranges ||
           (missing_packets.Max() - missing_packets.Min() -
            missing_packets.NumPacketsSlow() + 1) < max_ranges) {
         break;
       }
       size_t num_ranges = 0;
       QuicPacketNumber last_missing = 0;
       for (QuicPacketNumber packet : missing_packets) {
@@ skipping 503 matching lines @@
       continue;
     }
     // Record some overlapping patterns, to get a better picture, since this is
     // not very expensive.
     if (i % 3 == 0)
       six_packet_histogram->Add(recent_6_mask);
   }
 }
 
 }  // namespace net