Disk cache: Update the disk cache tools and tests to use...

net/disk_cache/stress_cache.cc

-// Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.
+// Copyright (c) 2006-2010 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.
 
 // This is a simple application that stress-tests the crash recovery of the disk
 // cache. The main application starts a copy of itself on a loop, checking the
 // exit code of the child process. When the child dies in an unexpected way,
 // the main application quits.
 
 // The child application has two threads: one to exercise the cache in an
 // infinite loop, and another one to asynchronously kill the process.
 
 #include <string>
 #include <vector>
 
 #include "base/at_exit.h"
 #include "base/command_line.h"
 #include "base/debug_util.h"
 #include "base/file_path.h"
 #include "base/logging.h"
 #include "base/message_loop.h"
 #include "base/path_service.h"
 #include "base/platform_thread.h"
 #include "base/process_util.h"
 #include "base/string_util.h"
 #include "base/thread.h"
+#include "net/base/net_errors.h"
+#include "net/base/test_completion_callback.h"
 #include "net/base/io_buffer.h"
 #include "net/disk_cache/backend_impl.h"
 #include "net/disk_cache/disk_cache.h"
 #include "net/disk_cache/disk_cache_test_util.h"
 
 using base::Time;
 
 const int kError = -1;
 const int kExpectedCrash = 100;
 
@@ skipping 33 matching lines @@
 }
 
 // -----------------------------------------------------------------------
 
 // This thread will loop forever, adding and removing entries from the cache.
 // iteration is the current crash cycle, so the entries on the cache are marked
 // to know which instance of the application wrote them.
 void StressTheCache(int iteration) {
   int cache_size = 0x800000;  // 8MB
   FilePath path = GetCacheFilePath().AppendASCII("_stress");
-  disk_cache::BackendImpl* cache = new disk_cache::BackendImpl(path);
-  cache->SetFlags(disk_cache::kNoLoadProtection | disk_cache::kNoRandom);
-  cache->SetMaxSize(cache_size);
-  cache->SetType(net::DISK_CACHE);
-  if (!cache->Init()) {
+
+  base::Thread cache_thread("CacheThread");
+  if (!cache_thread.StartWithOptions(
+          base::Thread::Options(MessageLoop::TYPE_IO, 0)))
+    return;
+
+  TestCompletionCallback cb;
+  disk_cache::Backend* cache;
+  int rv = disk_cache::BackendImpl::CreateBackend(
+               path, false, cache_size, net::DISK_CACHE,
+               disk_cache::kNoLoadProtection | disk_cache::kNoRandom,
+               cache_thread.message_loop_proxy(), &cache, &cb);
+
+  if (cb.GetResult(rv) != net::OK) {
     printf("Unable to initialize cache.\n");
     return;
   }
   printf("Iteration %d, initial entries: %d\n", iteration,
          cache->GetEntryCount());
 
   int seed = static_cast<int>(Time::Now().ToInternalValue());
   srand(seed);
 
   const int kNumKeys = 5000;
   const int kNumEntries = 30;
   std::string keys[kNumKeys];
   disk_cache::Entry* entries[kNumEntries] = {0};
 
   for (int i = 0; i < kNumKeys; i++) {
     keys[i] = GenerateKey(true);
   }
 
   const int kSize = 4000;
   scoped_refptr<net::IOBuffer> buffer = new net::IOBuffer(kSize);
   memset(buffer->data(), 'k', kSize);
 
   for (int i = 0;; i++) {
     int slot = rand() % kNumEntries;
     int key = rand() % kNumKeys;
 
     if (entries[slot])
       entries[slot]->Close();
 
-    if (!cache->OpenEntry(keys[key], &entries[slot]))
-      CHECK(cache->CreateEntry(keys[key], &entries[slot]));
+    rv = cache->OpenEntry(keys[key], &entries[slot], &cb);
+    if (cb.GetResult(rv) != net::OK) {
+      rv = cache->CreateEntry(keys[key], &entries[slot], &cb);
+      CHECK_EQ(net::OK, cb.GetResult(rv));
+    }
 
     base::snprintf(buffer->data(), kSize, "%d %d", iteration, i);
-    CHECK_EQ(kSize,
-             entries[slot]->WriteData(0, 0, buffer, kSize, NULL, false));
+    rv = entries[slot]->WriteData(0, 0, buffer, kSize, &cb, false);
+    CHECK_EQ(kSize, cb.GetResult(rv));
 
     if (rand() % 100 > 80) {
       key = rand() % kNumKeys;
       cache->DoomEntry(keys[key]);
     }
 
     if (!(i % 100))
       printf("Entries: %d    \r", i);
     MessageLoop::current()->RunAllPending();
   }
@@ skipping 69 matching lines @@
   long int iteration = strtol(argv[1], &end, 0);
 
   if (!StartCrashThread()) {
     printf("failed to start thread\n");
     return kError;
   }
 
   StressTheCache(iteration);
   return 0;
 }