LOG(INFO) tidying in net/

net/quic/congestion_control/inter_arrival_overuse_detector_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 <stdlib.h>
 
 #include <cmath>
 
 #include "base/logging.h"
 #include "base/rand_util.h"
@@ skipping 251 matching lines @@
 
 TEST_F(InterArrivalOveruseDetectorTest, DISABLED_TestNoise) {
   int count[100];
   memset(count, 0, sizeof(count));
   for (int i = 0; i < 10000; ++i) {
     QuicTime::Delta mean = QuicTime::Delta::FromMilliseconds(30);
     QuicTime::Delta standard_deviation = QuicTime::Delta::FromMilliseconds(10);
     count[GaussianRandom(mean, standard_deviation).ToMilliseconds()]++;
   }
   for (int j = 0; j < 100; ++j) {
-    DLOG(INFO) << j << ":" << count[j];
+    DVLOG(0) << j << ":" << count[j];
   }
 }
 
 TEST_F(InterArrivalOveruseDetectorTest, DISABLED_SimpleNonOveruse) {
   QuicPacketSequenceNumber sequence_number = 1;
   QuicTime::Delta delta = QuicTime::Delta::FromMilliseconds(10);
 
   for (int i = 0; i < 1000; ++i) {
     QuicTime send_time = send_clock_.ApproximateNow();
     QuicTime receive_time = receive_clock_.ApproximateNow();
@@ skipping 822 matching lines @@
   drift_per_burst = QuicTime::Delta::FromMilliseconds(0);
   int bursts_until_steady = RunUntilSteady(packets_per_burst,
                                            mean,
                                            standard_deviation,
                                            drift_per_burst);
   EXPECT_GE(41, bursts_until_steady);
 }
 
 }  // namespace test
 }  // namespace net