Launch processes asynchronously so as not to block the UI thread. For now, re...

chrome/browser/visitedlink_unittest.cc

 // Copyright (c) 2006-2008 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 <vector>
 #include <string>
 #include <cstdio>
 
 #include "base/message_loop.h"
 #include "base/file_util.h"
@@ skipping 113 matching lines @@
     ASSERT_TRUE(InitVisited(0, true));
     master_->DebugValidate();
 
     // check that the table has the proper number of entries
     int used_count = master_->GetUsedCount();
     ASSERT_EQ(used_count, g_test_count);
 
     // Create a slave database.
     VisitedLinkSlave slave;
     base::SharedMemoryHandle new_handle = base::SharedMemory::NULLHandle();
-    master_->ShareToProcess(base::GetCurrentProcessHandle(), &new_handle);
+    master_->shared_memory()->ShareToProcess(
+        base::GetCurrentProcessHandle(), &new_handle);
     bool success = slave.Init(new_handle);
     ASSERT_TRUE(success);
     g_slaves.push_back(&slave);
 
     bool found;
     for (int i = 0; i < g_test_count; i++) {
       GURL cur = TestURL(i);
       found = master_->IsVisited(cur);
       EXPECT_TRUE(found) << "URL " << i << "not found in master.";
 
@@ skipping 119 matching lines @@
   Reload();
 }
 
 TEST_F(VisitedLinkTest, DeleteAll) {
   ASSERT_TRUE(InitHistory());
   ASSERT_TRUE(InitVisited(0, true));
 
   {
     VisitedLinkSlave slave;
     base::SharedMemoryHandle new_handle = base::SharedMemory::NULLHandle();
-    master_->ShareToProcess(base::GetCurrentProcessHandle(), &new_handle);
+    master_->shared_memory()->ShareToProcess(
+        base::GetCurrentProcessHandle(), &new_handle);
     ASSERT_TRUE(slave.Init(new_handle));
     g_slaves.push_back(&slave);
 
     // Add the test URLs.
     for (int i = 0; i < g_test_count; i++) {
       master_->AddURL(TestURL(i));
       ASSERT_EQ(i + 1, master_->GetUsedCount());
     }
     master_->DebugValidate();
 
@@ skipping 27 matching lines @@
 // full, notifies its slaves of the change, and updates the disk.
 TEST_F(VisitedLinkTest, Resizing) {
   // Create a very small database.
   const int32 initial_size = 17;
   ASSERT_TRUE(InitHistory());
   ASSERT_TRUE(InitVisited(initial_size, true));
 
   // ...and a slave
   VisitedLinkSlave slave;
   base::SharedMemoryHandle new_handle = base::SharedMemory::NULLHandle();
-  master_->ShareToProcess(base::GetCurrentProcessHandle(), &new_handle);
+  master_->shared_memory()->ShareToProcess(
+      base::GetCurrentProcessHandle(), &new_handle);
   bool success = slave.Init(new_handle);
   ASSERT_TRUE(success);
   g_slaves.push_back(&slave);
 
   int32 used_count = master_->GetUsedCount();
   ASSERT_EQ(used_count, 0);
 
   for (int i = 0; i < g_test_count; i++) {
     master_->AddURL(TestURL(i));
     used_count = master_->GetUsedCount();
@@ skipping 427 matching lines @@
   EXPECT_EQ(0, profile()->add_event_count());
   EXPECT_EQ(0, profile()->reset_event_count());
 
   rvh()->CreateRenderView(profile_->GetRequestContext());
 
   // We should now have just a reset event: adds are eaten up by a reset
   // that followed.
   EXPECT_EQ(0, profile()->add_event_count());
   EXPECT_EQ(1, profile()->reset_event_count());
 }