summaryrefslogtreecommitdiff
path: root/chromium/net/disk_cache/blockfile/block_files.cc
diff options
context:
space:
mode:
Diffstat (limited to 'chromium/net/disk_cache/blockfile/block_files.cc')
-rw-r--r--chromium/net/disk_cache/blockfile/block_files.cc22
1 files changed, 11 insertions, 11 deletions
diff --git a/chromium/net/disk_cache/blockfile/block_files.cc b/chromium/net/disk_cache/blockfile/block_files.cc
index 4ae217be40f..f46a9375349 100644
--- a/chromium/net/disk_cache/blockfile/block_files.cc
+++ b/chromium/net/disk_cache/blockfile/block_files.cc
@@ -20,7 +20,7 @@ using base::TimeTicks;
namespace {
-const char* kBlockName = "data_";
+const char kBlockName[] = "data_";
// This array is used to perform a fast lookup of the nibble bit pattern to the
// type of entry that can be stored there (number of consecutive blocks).
@@ -28,7 +28,7 @@ const char s_types[16] = {4, 3, 2, 2, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0};
// Returns the type of block (number of consecutive blocks that can be stored)
// for a given nibble of the bitmap.
-inline int GetMapBlockType(uint8 value) {
+inline int GetMapBlockType(uint32 value) {
value &= 0xf;
return s_types[value];
}
@@ -279,7 +279,7 @@ bool BlockFiles::Init(bool create_files) {
thread_checker_.reset(new base::ThreadChecker);
block_files_.resize(kFirstAdditionalBlockFile);
- for (int i = 0; i < kFirstAdditionalBlockFile; i++) {
+ for (int16 i = 0; i < kFirstAdditionalBlockFile; i++) {
if (create_files)
if (!CreateBlockFile(i, static_cast<FileType>(i + 1), true))
return false;
@@ -548,7 +548,7 @@ bool BlockFiles::GrowBlockFile(MappedFile* file, BlockFileHeader* header) {
}
MappedFile* BlockFiles::FileForNewBlock(FileType block_type, int block_count) {
- COMPILE_ASSERT(RANKINGS == 1, invalid_file_type);
+ static_assert(RANKINGS == 1, "invalid file type");
MappedFile* file = block_files_[block_type - 1];
BlockHeader file_header(file);
@@ -574,7 +574,7 @@ MappedFile* BlockFiles::FileForNewBlock(FileType block_type, int block_count) {
MappedFile* BlockFiles::NextFile(MappedFile* file) {
ScopedFlush flush(file);
BlockFileHeader* header = reinterpret_cast<BlockFileHeader*>(file->buffer());
- int new_file = header->next_file;
+ int16 new_file = header->next_file;
if (!new_file) {
// RANKINGS is not reported as a type for small entries, but we may be
// extending the rankings block file.
@@ -595,8 +595,8 @@ MappedFile* BlockFiles::NextFile(MappedFile* file) {
return GetFile(address);
}
-int BlockFiles::CreateNextBlockFile(FileType block_type) {
- for (int i = kFirstAdditionalBlockFile; i <= kMaxBlockFile; i++) {
+int16 BlockFiles::CreateNextBlockFile(FileType block_type) {
+ for (int16 i = kFirstAdditionalBlockFile; i <= kMaxBlockFile; i++) {
if (CreateBlockFile(i, block_type, false))
return i;
}
@@ -656,11 +656,11 @@ bool BlockFiles::FixBlockFileHeader(MappedFile* file) {
if (file_size < file_header.Size())
return false; // file_size > 2GB is also an error.
- const int kMinBlockSize = 36;
- const int kMaxBlockSize = 4096;
+ const int kMinHeaderBlockSize = 36;
+ const int kMaxHeaderBlockSize = 4096;
BlockFileHeader* header = file_header.Header();
- if (header->entry_size < kMinBlockSize ||
- header->entry_size > kMaxBlockSize || header->num_entries < 0)
+ if (header->entry_size < kMinHeaderBlockSize ||
+ header->entry_size > kMaxHeaderBlockSize || header->num_entries < 0)
return false;
// Make sure that we survive crashes.