chrome/browser: Update calls from RunAllPending() to RunUntilIdle().

chrome/browser/net/predictor_unittest.cc

 // Copyright (c) 2012 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 <time.h>
 
 #include <algorithm>
 #include <sstream>
 #include <string>
 
@@ skipping 120 matching lines @@
       FROM_HERE,
       MessageLoop::QuitClosure(),
       base::TimeDelta::FromMilliseconds(500));
   MessageLoop::current()->Run();
 
   EXPECT_FALSE(testing_master.WasFound(localhost));
 
   testing_master.Shutdown();
 
   // Clean up after ourselves.
-  MessageLoop::current()->RunAllPending();
+  MessageLoop::current()->RunUntilIdle();
 }
 
 TEST_F(PredictorTest, SingleLookupTest) {
   Predictor testing_master(true);
   testing_master.SetHostResolver(host_resolver_.get());
 
   GURL goog("http://www.google.com:80");
 
   UrlList names;
   names.push_back(goog);
 
   // Try to flood the predictor with many concurrent requests.
   for (int i = 0; i < 10; i++)
     testing_master.ResolveList(names, UrlInfo::PAGE_SCAN_MOTIVATED);
 
   WaitForResolution(&testing_master, names);
 
   EXPECT_TRUE(testing_master.WasFound(goog));
 
-  MessageLoop::current()->RunAllPending();
+  MessageLoop::current()->RunUntilIdle();
 
   EXPECT_GT(testing_master.peak_pending_lookups(), names.size() / 2);
   EXPECT_LE(testing_master.peak_pending_lookups(), names.size());
   EXPECT_LE(testing_master.peak_pending_lookups(),
             testing_master.max_concurrent_dns_lookups());
 
   testing_master.Shutdown();
 }
 
 TEST_F(PredictorTest, ConcurrentLookupTest) {
@@ skipping 24 matching lines @@
 
   WaitForResolution(&testing_master, names);
 
   EXPECT_TRUE(testing_master.WasFound(goog));
   EXPECT_TRUE(testing_master.WasFound(goog3));
   EXPECT_TRUE(testing_master.WasFound(goog2));
   EXPECT_TRUE(testing_master.WasFound(goog4));
   EXPECT_FALSE(testing_master.WasFound(bad1));
   EXPECT_FALSE(testing_master.WasFound(bad2));
 
-  MessageLoop::current()->RunAllPending();
+  MessageLoop::current()->RunUntilIdle();
 
   EXPECT_FALSE(testing_master.WasFound(bad1));
   EXPECT_FALSE(testing_master.WasFound(bad2));
 
   EXPECT_LE(testing_master.peak_pending_lookups(), names.size());
   EXPECT_LE(testing_master.peak_pending_lookups(),
             testing_master.max_concurrent_dns_lookups());
 
   testing_master.Shutdown();
 }
 
 TEST_F(PredictorTest, MassiveConcurrentLookupTest) {
   host_resolver_->rules()->AddSimulatedFailure("*.notfound");
 
   Predictor testing_master(true);
   testing_master.SetHostResolver(host_resolver_.get());
 
   UrlList names;
   for (int i = 0; i < 100; i++)
     names.push_back(GURL(
         "http://host" + base::IntToString(i) + ".notfound:80"));
 
   // Try to flood the predictor with many concurrent requests.
   for (int i = 0; i < 10; i++)
     testing_master.ResolveList(names, UrlInfo::PAGE_SCAN_MOTIVATED);
 
   WaitForResolution(&testing_master, names);
 
-  MessageLoop::current()->RunAllPending();
+  MessageLoop::current()->RunUntilIdle();
 
   EXPECT_LE(testing_master.peak_pending_lookups(), names.size());
   EXPECT_LE(testing_master.peak_pending_lookups(),
             testing_master.max_concurrent_dns_lookups());
 
   testing_master.Shutdown();
 }
 
 //------------------------------------------------------------------------------
 // Functions to help synthesize and test serializations of subresource referrer
@@ skipping 429 matching lines @@
   EXPECT_EQ(2U, referral_list.GetSize());
 
   predictor.DiscardAllResults();
   predictor.SerializeReferrers(&referral_list);
   EXPECT_EQ(1U, referral_list.GetSize());
 
   predictor.Shutdown();
 }
 
 }  // namespace chrome_browser_net