Largest received -> largest observed.

net/quic/congestion_control/quic_send_scheduler.cc

Index: net/quic/congestion_control/quic_send_scheduler.cc
diff --git a/net/quic/congestion_control/quic_send_scheduler.cc b/net/quic/congestion_control/quic_send_scheduler.cc
index 17c4a2fb28b8d68f4790005f14e09b96551b111e..7b30ee0140db0f4ebb02a3fd06cec0f21ee3070c 100644
--- a/net/quic/congestion_control/quic_send_scheduler.cc
+++ b/net/quic/congestion_control/quic_send_scheduler.cc
@@ -86,7 +86,7 @@ void QuicSendScheduler::OnIncomingQuicCongestionFeedbackFrame(
 
 void QuicSendScheduler::OnIncomingAckFrame(const QuicAckFrame& ack_frame) {
   // We want to.
-  // * Get all packets lower(including) than largest_received
+  // * Get all packets lower(including) than largest_observed
   //   from pending_packets_.
   // * Remove all missing packets.
   // * Send each ACK in the list to send_algorithm_.
@@ -96,7 +96,7 @@ void QuicSendScheduler::OnIncomingAckFrame(const QuicAckFrame& ack_frame) {
   PendingPacketsMap::iterator it, it_upper;
   it = pending_packets_.begin();
   it_upper = pending_packets_.upper_bound(
-      ack_frame.received_info.largest_received);
+      ack_frame.received_info.largest_observed);
 
   while (it != it_upper) {
     QuicPacketSequenceNumber sequence_number = it->first;