sync: Add method to Directory to remove all entries for a set of ModelTypes....

chrome/browser/sync/syncable/syncable.h

 // Copyright (c) 2009 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_SYNC_SYNCABLE_SYNCABLE_H_
 #define CHROME_BROWSER_SYNC_SYNCABLE_SYNCABLE_H_
 
 #include <algorithm>
 #include <bitset>
 #include <iosfwd>
@@ skipping 656 matching lines @@
   friend class ReadTransaction;
   friend class ReadTransactionWithoutDB;
   friend class ScopedKernelLock;
   friend class ScopedKernelUnlock;
   friend class WriteTransaction;
   friend class SyncableDirectoryTest;
   FRIEND_TEST_ALL_PREFIXES(SyncableDirectoryTest,
                            TakeSnapshotGetsAllDirtyHandlesTest);
   FRIEND_TEST_ALL_PREFIXES(SyncableDirectoryTest,
                            TakeSnapshotGetsOnlyDirtyHandlesTest);
+  FRIEND_TEST_ALL_PREFIXES(SyncableDirectoryTest, TestPurgeEntriesWithTypeIn);
 
  public:
   class EventListenerHookup;
 
   // Various data that the Directory::Kernel we are backing (persisting data
   // for) needs saved across runs of the application.
   struct PersistedKernelInfo {
     // Last sync timestamp fetched from the server.
     int64 last_download_timestamp[MODEL_TYPE_COUNT];
     // true iff we ever reached the end of the changelog.
@@ skipping 200 matching lines @@
   void CheckTreeInvariants(syncable::BaseTransaction* trans,
                            bool full_scan);
 
   void CheckTreeInvariants(syncable::BaseTransaction* trans,
                            const OriginalEntries* originals);
 
   void CheckTreeInvariants(syncable::BaseTransaction* trans,
                            const MetahandleSet& handles,
                            const IdFilter& idfilter);
 
+  // Purges all data associated with any entries whose ModelType or
+  // ServerModelType is found in |types|, from _both_ memory and disk.
+  // Only  valid, "real" model types are allowed in |types| (see model_type.h
+  // for definitions).  "Purge" is just meant to distinguish from "deleting"
+  // entries, which means something different in the syncable namespace.
+  // WARNING! This can be real slow, as it iterates over all entries.
+  // WARNING! Performs synchronous I/O.
+  void PurgeEntriesWithTypeIn(const std::set<ModelType>& types);
+
  private:
   // Helper to prime ids_index, parent_id_and_names_index, unsynced_metahandles
   // and unapplied_metahandles from metahandles_index.
   void InitializeIndices();
 
   // Constructs a consistent snapshot of the current Directory state and
   // indices (by deep copy) under a ReadTransaction for use in |snapshot|.
   // See SaveChanges() for more information.
   void TakeSnapshotForSaveChanges(SaveChangesSnapshot* snapshot);
 
   // Purges from memory any unused, safe to remove entries that were
   // successfully deleted on disk as a result of the SaveChanges that processed
   // |snapshot|.  See SaveChanges() for more information.
   void VacuumAfterSaveChanges(const SaveChangesSnapshot& snapshot);
 
   // Rolls back dirty bits in the event that the SaveChanges that
   // processed |snapshot| failed, for example, due to no disk space.
   void HandleSaveChangesFailure(const SaveChangesSnapshot& snapshot);
 
   // For new entry creation only
   void InsertEntry(EntryKernel* entry, ScopedKernelLock* lock);
   void InsertEntry(EntryKernel* entry);
 
   // Used by CheckTreeInvariants
   void GetAllMetaHandles(BaseTransaction* trans, MetahandleSet* result);
-
   bool SafeToPurgeFromMemory(const EntryKernel* const entry) const;
 
   // Helper method used to implement GetFirstChildId/GetLastChildId.
   Id GetChildWithNullIdField(IdField field,
                              BaseTransaction* trans,
                              const Id& parent_id);
 
   Directory& operator = (const Directory&);
 
   // TODO(sync):  If lookups and inserts in these sets become
@@ skipping 10 matching lines @@
   // This index contains EntryKernels ordered by parent ID and metahandle.
   // It allows efficient lookup of the children of a given parent.
   typedef std::set<EntryKernel*, LessParentIdAndHandle> ParentIdChildIndex;
 
   // Contains both deleted and existing entries with tags.
   // We can't store only existing tags because the client would create
   // items that had a duplicated ID in the end, resulting in a DB key
   // violation. ID reassociation would fail after an attempted commit.
   typedef std::set<EntryKernel*,
                    LessField<StringField, UNIQUE_CLIENT_TAG> > ClientTagIndex;
-  typedef std::vector<int64> MetahandlesToPurge;
 
  private:
 
   struct Kernel {
     Kernel(const FilePath& db_path, const std::string& name,
            const KernelLoadInfo& info);
 
     ~Kernel();
 
     void AddRef();  // For convenience.
@@ skipping 213 matching lines @@
 void ZeroFields(EntryKernel* entry, int first_field);
 
 }  // namespace syncable
 
 std::ostream& operator <<(std::ostream&, const syncable::Blob&);
 
 browser_sync::FastDump& operator <<
   (browser_sync::FastDump&, const syncable::Blob&);
 
 #endif  // CHROME_BROWSER_SYNC_SYNCABLE_SYNCABLE_H_