Add Terminate() to the Process object, have RenderProcessHost use this to avo...

chrome/browser/visitedlink_master.h

 // 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.
 
 #ifndef CHROME_BROWSER_VISITEDLINK_MASTER_H__
 #define CHROME_BROWSER_VISITEDLINK_MASTER_H__
 
 #include <windows.h>
 #include <set>
 #include <string>
 #include <vector>
 
 #include "base/ref_counted.h"
 #include "base/shared_memory.h"
 #include "chrome/browser/history/history.h"
 #include "chrome/common/visitedlink_common.h"
 #include "testing/gtest/include/gtest/gtest_prod.h"
 
 class GURL;
 class Profile;
 
 // Controls the link coloring database. The master controls all writing to the
 // database as well as disk I/O. There should be only one master.
 //
 // This class will optionally defer writing operations to another thread. This
 // means that after class destruction, the file may still be open since
 // operations are pending on another thread.
 class VisitedLinkMaster : public VisitedLinkCommon {
  public:
-  typedef void (PostNewTableEvent)(SharedMemory*);
+   typedef void (PostNewTableEvent)(base::SharedMemory*);
 
   // The |file_thread| may be NULL, in which case write operations will be
   // synchronous.
   VisitedLinkMaster(base::Thread* file_thread,
                     PostNewTableEvent* poster,
                     Profile* profile);
 
   // In unit test mode, we allow the caller to optionally specify the database
   // filename so that it can be run from a unit test. The directory where this
   // file resides must exist in this mode. You can also specify the default
@@ skipping 17 matching lines @@
                     int32 default_table_size);
   virtual ~VisitedLinkMaster();
 
   // Must be called immediately after object creation. Nothing else will work
   // until this is called. Returns true on success, false means that this
   // object won't work.
   bool Init();
 
   // Duplicates the handle to the shared memory to another process.
   // Returns true on success.
-  bool ShareToProcess(ProcessHandle process, SharedMemoryHandle *new_handle);
+  bool ShareToProcess(base::ProcessHandle process,
+                      base::SharedMemoryHandle *new_handle);
 
   // returns the name of the shared memory object that slaves can use to map
   // the data
   std::wstring GetSharedMemoryName() const;
 
   // Returns the handle to the shared memory
-  SharedMemoryHandle GetSharedMemoryHandle();
+  base::SharedMemoryHandle GetSharedMemoryHandle();
 
   // Adds a URL to the table.
   void AddURL(const GURL& url);
 
   // Adds a set of URLs to the table.
   void AddURLs(const std::vector<GURL>& url);
 
   // Deletes the specified URLs from the table.
   void DeleteURLs(const std::set<GURL>& urls);
 
@@ skipping 236 matching lines @@
   // deleted during the rebuild here. Then we should delete any of these
   // entries from the complete table later.
   //std::vector<Fingerprint> removed_since_rebuild_;
 
   // The currently open file with the table in it. This may be NULL if we're
   // rebuilding and haven't written a new version yet. Writing to the file may
   // be safely ignored in this case.
   HANDLE file_;
 
   // Shared memory consists of a SharedHeader followed by the table.
-  SharedMemory *shared_memory_;
+  base::SharedMemory *shared_memory_;
 
   // When we generate new tables, we increment the serial number of the
   // shared memory object.
   int32 shared_memory_serial_;
 
   // Number of non-empty items in the table, used to compute fullness.
   int32 used_items_;
 
   // Testing values -----------------------------------------------------------
   //
@@ skipping 34 matching lines @@
   for (int32 i = 0; i < table_length_; i++) {
     if (hash_table_[i])
       used_count++;
   }
   DCHECK(used_count == used_items_);
 }
 #endif
 
 #endif // CHROME_BROWSER_VISITEDLINK_MASTER_H__