Close the QUIC connection if too many sent or received packets are

net/quic/quic_received_packet_manager.h

 // Copyright 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.
 //
 // Manages the packet entropy calculation for both sent and received packets
 // for a connection.
 
 #ifndef NET_QUIC_QUIC_RECEIVED_PACKET_MANAGER_H_
 #define NET_QUIC_QUIC_RECEIVED_PACKET_MANAGER_H_
 
@@ skipping 41 matching lines @@
     // sequence_number == first_gap_.
     void RecordPacketEntropyHash(QuicPacketSequenceNumber sequence_number,
                                  QuicPacketEntropyHash entropy_hash);
 
     // Sets the entropy hash up to but not including a sequence number based
     // on the hash provided by a StopWaiting frame.  Clears older packet
     // entropy entries and performs garbage collection up to the first gap.
     void SetCumulativeEntropyUpTo(QuicPacketSequenceNumber sequence_number,
                                   QuicPacketEntropyHash entropy_hash);
 
+    size_t size() const { return packets_entropy_.size(); }
+
    private:
     friend class test::EntropyTrackerPeer;
 
     // A deque indexed by sequence number storing the packet's hash and whether
     // a hash was recorded for that sequence number.
     typedef std::deque<std::pair<QuicPacketEntropyHash, bool> >
         ReceivedEntropyHashes;
 
     // Recomputes first_gap_ and removes packets_entropy_ entries that are no
     // longer needed to compute EntropyHash.
@@ skipping 58 matching lines @@
   // the received entropy hash for the truncated ack frame.
   QuicPacketEntropyHash EntropyHash(
       QuicPacketSequenceNumber sequence_number) const override;
 
   // Updates internal state based on |stop_waiting|.
   void UpdatePacketInformationSentByPeer(
       const QuicStopWaitingFrame& stop_waiting);
 
   // Returns true when there are new missing packets to be reported within 3
   // packets of the largest observed.
-  bool HasNewMissingPackets();
+  bool HasNewMissingPackets() const;
+
+  // Returns the number of packets being tracked in the EntropyTracker.
+  size_t NumTrackedPackets() const;
 
   QuicPacketSequenceNumber peer_least_packet_awaiting_ack() {
     return peer_least_packet_awaiting_ack_;
   }
 
  private:
   friend class test::QuicConnectionPeer;
   friend class test::QuicReceivedPacketManagerPeer;
 
   // Deletes all missing packets before least unacked. The connection won't
@@ skipping 22 matching lines @@
   QuicConnectionStats* stats_;
 
   PacketTimeList received_packet_times_;
 
   DISALLOW_COPY_AND_ASSIGN(QuicReceivedPacketManager);
 };
 
 }  // namespace net
 
 #endif  // NET_QUIC_QUIC_RECEIVED_PACKET_MANAGER_H_