LOG(INFO) tidying in net/

net/quic/congestion_control/inter_arrival_sender_test.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/congestion_control/inter_arrival_sender.h"
 
 #include "base/logging.h"
 #include "base/memory/scoped_ptr.h"
 #include "base/stl_util.h"
 #include "net/quic/test_tools/mock_clock.h"
@@ skipping 135 matching lines @@
       NOT_RETRANSMISSION, HAS_RETRANSMITTABLE_DATA, NOT_HANDSHAKE));
   EXPECT_TRUE(sender_.TimeUntilSend(send_clock_.Now(),
       NOT_RETRANSMISSION, HAS_RETRANSMITTABLE_DATA, NOT_HANDSHAKE).IsZero());
 
   // We should now have our probe rate.
   QuicTime::Delta acc_arrival_time = QuicTime::Delta::FromMilliseconds(41);
   int64 probe_rate = kDefaultMaxPacketSize * 9 * kNumMicrosPerSecond /
       acc_arrival_time.ToMicroseconds();
   EXPECT_NEAR(0.7f * probe_rate,
               sender_.BandwidthEstimate().ToBytesPerSecond(), 1000);
-  DLOG(INFO) << "After probe";
+  DVLOG(0) << "After probe";
   // Send 50 bursts, make sure that we move fast in the beginning.
   for (int i = 0; i < 50; ++i) {
     SendAvailableCongestionWindow();
     QuicTime::Delta time_until_send = sender_.TimeUntilSend(send_clock_.Now(),
         NOT_RETRANSMISSION, HAS_RETRANSMITTABLE_DATA, NOT_HANDSHAKE);
     send_clock_.AdvanceTime(time_until_send);
     EXPECT_TRUE(sender_.TimeUntilSend(send_clock_.Now(),
         NOT_RETRANSMISSION, HAS_RETRANSMITTABLE_DATA, NOT_HANDSHAKE).IsZero());
     AckNPackets(2);
     SendFeedbackMessageNPackets(2, one_ms_, time_until_send.Subtract(one_ms_));
@@ skipping 24 matching lines @@
         NOT_RETRANSMISSION, HAS_RETRANSMITTABLE_DATA, NOT_HANDSHAKE);
     send_clock_.AdvanceTime(time_until_send);
     EXPECT_TRUE(sender_.TimeUntilSend(send_clock_.Now(),
         NOT_RETRANSMISSION, HAS_RETRANSMITTABLE_DATA, NOT_HANDSHAKE).IsZero());
     AckNPackets(2);
     SendFeedbackMessageNPackets(2, one_ms_, time_until_send.Subtract(one_ms_));
   }
   EXPECT_NEAR(0.99f * probe_rate,
               sender_.BandwidthEstimate().ToBytesPerSecond(), 1000);
   EXPECT_NEAR(SenderDeltaSinceStart().ToMilliseconds(), 1560, 10);
-  DLOG(INFO) << "Near available channel estimate";
+  DVLOG(0) << "Near available channel estimate";
 
   // Send 50 bursts, make sure that we move very slow close to the probe rate.
   for (int i = 0; i < 50; ++i) {
     SendAvailableCongestionWindow();
     QuicTime::Delta time_until_send = sender_.TimeUntilSend(send_clock_.Now(),
         NOT_RETRANSMISSION, HAS_RETRANSMITTABLE_DATA, NOT_HANDSHAKE);
     send_clock_.AdvanceTime(time_until_send);
     EXPECT_TRUE(sender_.TimeUntilSend(send_clock_.Now(),
         NOT_RETRANSMISSION, HAS_RETRANSMITTABLE_DATA, NOT_HANDSHAKE).IsZero());
     AckNPackets(2);
     SendFeedbackMessageNPackets(2, one_ms_, time_until_send.Subtract(one_ms_));
   }
   EXPECT_NEAR(1.00f * probe_rate,
               sender_.BandwidthEstimate().ToBytesPerSecond(), 2000);
   EXPECT_NEAR(SenderDeltaSinceStart().ToMilliseconds(), 2000, 100);
-  DLOG(INFO) << "At available channel estimate";
+  DVLOG(0) << "At available channel estimate";
 
   // Send 50 bursts, make sure that we move very slow close to the probe rate.
   for (int i = 0; i < 50; ++i) {
     SendAvailableCongestionWindow();
     QuicTime::Delta time_until_send = sender_.TimeUntilSend(send_clock_.Now(),
         NOT_RETRANSMISSION, HAS_RETRANSMITTABLE_DATA, NOT_HANDSHAKE);
     send_clock_.AdvanceTime(time_until_send);
     EXPECT_TRUE(sender_.TimeUntilSend(send_clock_.Now(),
         NOT_RETRANSMISSION, HAS_RETRANSMITTABLE_DATA, NOT_HANDSHAKE).IsZero());
     AckNPackets(2);
@@ skipping 45 matching lines @@
         NOT_RETRANSMISSION, HAS_RETRANSMITTABLE_DATA, NOT_HANDSHAKE);
     send_clock_.AdvanceTime(time_until_send);
     EXPECT_TRUE(sender_.TimeUntilSend(send_clock_.Now(),
         NOT_RETRANSMISSION, HAS_RETRANSMITTABLE_DATA, NOT_HANDSHAKE).IsZero());
     AckNPackets(2);
     SendFeedbackMessageNPackets(2, one_ms_, time_until_send.Subtract(one_ms_));
   }
   EXPECT_NEAR(halfway_rate,
               sender_.BandwidthEstimate().ToBytesPerSecond(), 5000);
   EXPECT_NEAR(SenderDeltaSinceStart().ToMilliseconds(), 6600, 100);
-  DLOG(INFO) << "Near halfway point";
+  DVLOG(0) << "Near halfway point";
 
   // Send until we reach max channel capacity.
   for (int i = 0; i < 1500; ++i) {
     SendAvailableCongestionWindow();
     QuicTime::Delta time_until_send = sender_.TimeUntilSend(send_clock_.Now(),
         NOT_RETRANSMISSION, HAS_RETRANSMITTABLE_DATA, NOT_HANDSHAKE);
     send_clock_.AdvanceTime(time_until_send);
     EXPECT_TRUE(sender_.TimeUntilSend(send_clock_.Now(),
         NOT_RETRANSMISSION, HAS_RETRANSMITTABLE_DATA, NOT_HANDSHAKE).IsZero());
     AckNPackets(2);
@@ skipping 266 matching lines @@
     acked_sequence_number_ += 2;  // Create a loss by not acking both packets.
     SendFeedbackMessageNPackets(2, nine_ms_, nine_ms_);
 
     // Make sure our bitrate is fixed at the expected_min_bitrate.
     EXPECT_EQ(expected_min_bitrate, sender_.BandwidthEstimate());
   }
 }
 
 }  // namespace test
 }  // namespace net