Disk cache: Add support for an extra data stream for each cache entry....

net/tools/dump_cache/dump_files.cc

 // Copyright (c) 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.
 
 // Performs basic inspection of the disk cache files with minimal disruption
 // to the actual files (they still may change if an error is detected on the
 // files).
 
 #include <stdio.h>
 #include <string>
@@ skipping 43 matching lines @@
     return;
 
   printf("Index file:\n");
   printf("magic: %x\n", header.magic);
   printf("version: %d.%d\n", header.version >> 16, header.version & 0xffff);
   printf("entries: %d\n", header.num_entries);
   printf("total bytes: %d\n", header.num_bytes);
   printf("last file number: %d\n", header.last_file);
   printf("current id: %d\n", header.this_id);
   printf("table length: %d\n", header.table_len);
+  for (int i = 0; i < 5; i++) {
+    printf("head %d: 0x%x\n", i, header.lru.heads[i]);
+    printf("tail %d: 0x%x\n", i, header.lru.tails[i]);
+  }
+  printf("transaction: 0x%x\n", header.lru.transaction);
+  printf("operation: %d\n", header.lru.operation);
+  printf("operation list: %d\n", header.lru.operation_list);
   printf("-------------------------\n\n");
 }
 
 // Dumps the contents of a block-file header.
 void DumpBlockHeader(const std::wstring name) {
   disk_cache::BlockFileHeader header;
   if (!ReadHeader(name, reinterpret_cast<char*>(&header), sizeof(header)))
     return;
 
   std::wstring file_name = file_util::GetFilenameFromPath(name);
@@ skipping 137 matching lines @@
     if (key.size() > 50)
       key.resize(50);
   }
 
   printf("hash: 0x%x\n", entry.hash);
   printf("next entry: 0x%x\n", entry.next);
   printf("rankings: 0x%x\n", entry.rankings_node);
   printf("key length: %d\n", entry.key_len);
   printf("key: \"%s\"\n", key.c_str());
   printf("key addr: 0x%x\n", entry.long_key);
-  printf("data size 0: %d\n", entry.data_size[0]);
-  printf("data size 1: %d\n", entry.data_size[1]);
-  printf("data addr 0: 0x%x\n", entry.data_addr[0]);
-  printf("data addr 1: 0x%x\n", entry.data_addr[1]);
+  printf("reuse count: %d\n", entry.reuse_count);
+  printf("refetch count: %d\n", entry.refetch_count);
+  printf("state: %d\n", entry.state);
+  for (int i = 0; i < 4; i++) {
+    printf("data size %d: %d\n", i, entry.data_size[i]);
+    printf("data addr %d: 0x%x\n", i, entry.data_addr[i]);
+  }
   printf("----------\n\n");
 }
 
 void DumpRankings(const disk_cache::RankingsNode& rankings) {
   printf("next: 0x%x\n", rankings.next);
   printf("prev: 0x%x\n", rankings.prev);
   printf("entry: 0x%x\n", rankings.contents);
   printf("dirty: %d\n", rankings.dirty);
   printf("pointer: 0x%x\n", rankings.pointer);
   printf("----------\n\n");
@@ skipping 56 matching lines @@
     DumpEntry(entry);
     disk_cache::RankingsNode rankings;
     if (dumper.LoadRankings(entry.rankings_node, &rankings))
       DumpRankings(rankings);
   }
 
   printf("Done.\n");
 
   return 0;
 }