Disk Cache: Make sure that an entry that pretends to be...

net/disk_cache/backend_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 "base/basictypes.h"
 #include "base/file_util.h"
 #include "base/path_service.h"
 #include "base/platform_thread.h"
 #include "base/string_util.h"
 #include "net/base/io_buffer.h"
@@ skipping 799 matching lines @@
 
   disk_cache::Entry *entry1, *entry2;
   ASSERT_TRUE(cache->OpenEntry("the first key", &entry1));
   EXPECT_FALSE(cache->OpenEntry("some other key", &entry2));
   entry1->Close();
 
   // CheckCacheIntegrity will fail at this point.
   delete cache;
 }
 
+// We want to be able to deal with abnormal dirty entries.
+TEST_F(DiskCacheTest, Backend_NotMarkedButDirty) {
+  ASSERT_TRUE(CopyTestCache(L"dirty_entry"));
+  std::wstring path = GetCachePath();
+  disk_cache::Backend* cache = disk_cache::CreateCacheBackend(path, false, 0,
+                                                              net::DISK_CACHE);
+  ASSERT_TRUE(NULL != cache);
+
+  disk_cache::Entry *entry1, *entry2;
+  ASSERT_TRUE(cache->OpenEntry("the first key", &entry1));
+  EXPECT_FALSE(cache->OpenEntry("some other key", &entry2));
+  entry1->Close();
+
+  delete cache;
+  EXPECT_TRUE(CheckCacheIntegrity(path));
+}
+
 // We want to be able to deal with messed up entries on disk.
 TEST_F(DiskCacheTest, Backend_InvalidRankings) {
   ASSERT_TRUE(CopyTestCache(L"bad_rankings"));
   std::wstring path = GetCachePath();
   disk_cache::Backend* cache = disk_cache::CreateCacheBackend(path, false, 0,
                                                               net::DISK_CACHE);
   ASSERT_TRUE(NULL != cache);
 
   disk_cache::Entry *entry1, *entry2;
   EXPECT_FALSE(cache->OpenEntry("the first key", &entry1));
@@ skipping 186 matching lines @@
   ASSERT_TRUE(cache[0].get() != NULL && cache[1].get() != NULL &&
               cache[2].get() != NULL);
 
   std::string key("the first key");
   disk_cache::Entry* entry;
   for (int i = 0; i < kNumberOfCaches; i++) {
     ASSERT_TRUE(cache[i]->CreateEntry(key, &entry));
     entry->Close();
   }
 }