Reorganize net/disk_cache into backend specific directories.

net/disk_cache/blockfile/disk_format.h

 // Copyright (c) 2011 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.
 
 // The cache is stored on disk as a collection of block-files, plus an index
 // file plus a collection of external files.
 //
 // Any data blob bigger than kMaxBlockSize (disk_cache/addr.h) will be stored in
 // a separate file named f_xxx where x is a hexadecimal number. Shorter data
 // will be stored as a series of blocks on a block-file. In any case, CacheAddr
@@ skipping 24 matching lines @@
 //
 // In order to prevent dirty data to be used as valid (after a crash), every
 // cache entry has a dirty identifier. Each running instance of the cache keeps
 // a separate identifier (maintained on the "this_id" header field) that is used
 // to mark every entry that is created or modified. When the entry is closed,
 // and all the data can be trusted, the dirty flag is cleared from the entry.
 // When the cache encounters an entry whose identifier is different than the one
 // being currently used, it means that the entry was not properly closed on a
 // previous run, so it is discarded.
 
-#ifndef NET_DISK_CACHE_DISK_FORMAT_H_
-#define NET_DISK_CACHE_DISK_FORMAT_H_
+#ifndef NET_DISK_CACHE_BLOCKFILE_DISK_FORMAT_H_
+#define NET_DISK_CACHE_BLOCKFILE_DISK_FORMAT_H_
 
 #include "base/basictypes.h"
 #include "net/base/net_export.h"
-#include "net/disk_cache/disk_format_base.h"
+#include "net/disk_cache/blockfile/disk_format_base.h"
 
 namespace disk_cache {
 
 const int kIndexTablesize = 0x10000;
 const uint32 kIndexMagic = 0xC103CAC3;
 const uint32 kCurrentVersion = 0x20000;  // Version 2.0.
 
 struct LruData {
   int32     pad1[2];
   int32     filled;          // Flag to tell when we filled the cache.
@@ skipping 82 matching lines @@
   CacheAddr   contents;         // Address of the EntryStore.
   int32       dirty;            // The entry is being modifyied.
   uint32      self_hash;        // RankingsNode's hash.
 };
 #pragma pack(pop)
 
 COMPILE_ASSERT(sizeof(RankingsNode) == 36, bad_RankingsNode);
 
 }  // namespace disk_cache
 
-#endif  // NET_DISK_CACHE_DISK_FORMAT_H_
+#endif  // NET_DISK_CACHE_BLOCKFILE_DISK_FORMAT_H_