HomeSort by relevance Sort by last modified time
    Searched refs:RANKINGS (Results 1 - 16 of 16) sorted by null

  /external/chromium/net/disk_cache/
addr.h 18 RANKINGS = 1,
37 // 1 = rankings block file
98 case RANKINGS:
block_files_unittest.cc 43 EXPECT_TRUE(files.CreateBlock(RANKINGS, 4, &address[i]));
51 EXPECT_TRUE(files.CreateBlock(RANKINGS, 4, &address[target]));
70 EXPECT_TRUE(files.CreateBlock(RANKINGS, 4, &address[i]));
97 EXPECT_TRUE(files.CreateBlock(RANKINGS, size, &address));
189 EXPECT_TRUE(files.CreateBlock(RANKINGS, 2, &address));
block_files.cc 244 if (block_type < RANKINGS || block_type > BLOCK_4K ||
302 if (Addr::BlockSizeForFileType(RANKINGS) == header->entry_size)
303 type = RANKINGS;
470 COMPILE_ASSERT(RANKINGS == 1, invalid_fily_type);
496 // RANKINGS is not reported as a type for small entries, but we may be
497 // extending the rankings block file.
499 if (header->entry_size == Addr::BlockSizeForFileType(RANKINGS))
500 type = RANKINGS;
disk_cache_perftest.cc 237 EXPECT_TRUE(files.CreateBlock(disk_cache::RANKINGS, BlockSize(),
250 EXPECT_TRUE(files.CreateBlock(disk_cache::RANKINGS, BlockSize(),
rankings.cc 5 #include "net/disk_cache/rankings.h"
26 // This class provides a simple lock for the LRU list of rankings. Whenever an
193 Rankings::Iterator::Iterator(Rankings* rankings) {
195 my_rankings = rankings;
198 Rankings::Iterator::~Iterator() {
203 Rankings::Rankings() : init_(false) {}
205 Rankings::~Rankings() {
    [all...]
backend_impl.cc 662 scoped_ptr<Rankings::Iterator> iterator(
663 reinterpret_cast<Rankings::Iterator*>(iter));
747 if (!block_files_.CreateBlock(RANKINGS, 1, &node_address)) {
773 block_files_.GetFile(node_address)->Store(cache_entry->rankings());
896 void BackendImpl::RecoveredEntry(CacheRankingsBlock* rankings) {
897 Addr address(rankings->Data()->contents);
965 EntryImpl* BackendImpl::GetOpenEntry(CacheRankingsBlock* rankings) const {
966 DCHECK(rankings->HasData());
968 open_entries_.find(rankings->Data()->contents);
    [all...]
entry_impl.cc 536 RankingsNode* rankings = node_.Data();
537 if (!rankings->dirty) {
538 rankings->dirty = backend_->GetCurrentEntryId();
572 // if it is possible to load the rankings node and delete them together.
583 rankings_addr.file_type() != RANKINGS || rankings_addr.num_blocks() != 1)
    [all...]
  /external/chromium_org/net/disk_cache/
addr.cc 86 if (is_separate_file() || file_type() != RANKINGS || num_blocks() != 1)
block_files_unittest.cc 44 EXPECT_TRUE(files.CreateBlock(RANKINGS, 4, &address[i]));
52 EXPECT_TRUE(files.CreateBlock(RANKINGS, 4, &address[target]));
70 EXPECT_TRUE(files.CreateBlock(RANKINGS, 4, &address[i]));
96 EXPECT_TRUE(files.CreateBlock(RANKINGS, size, &address));
186 EXPECT_TRUE(files.CreateBlock(RANKINGS, 2, &address));
211 EXPECT_TRUE(files.CreateBlock(RANKINGS, 2, &address));
addr.h 18 RANKINGS = 1,
41 // 1 = rankings block file
121 case RANKINGS:
disk_cache_perftest.cc 230 EXPECT_TRUE(files.CreateBlock(disk_cache::RANKINGS, BlockSize(),
243 EXPECT_TRUE(files.CreateBlock(disk_cache::RANKINGS, BlockSize(),
block_files.cc 375 if (Addr::BlockSizeForFileType(RANKINGS) ==
377 type = RANKINGS;
553 COMPILE_ASSERT(RANKINGS == 1, invalid_file_type);
580 // RANKINGS is not reported as a type for small entries, but we may be
581 // extending the rankings block file.
583 if (header->entry_size == Addr::BlockSizeForFileType(RANKINGS))
584 type = RANKINGS;
rankings.cc 5 #include "net/disk_cache/rankings.h"
30 // This class provides a simple lock for the LRU list of rankings. Whenever an
193 Rankings::ScopedRankingsBlock::ScopedRankingsBlock() : rankings_(NULL) {}
195 Rankings::ScopedRankingsBlock::ScopedRankingsBlock(Rankings* rankings)
196 : rankings_(rankings) {}
198 Rankings::ScopedRankingsBlock::ScopedRankingsBlock(
199 Rankings* rankings, CacheRankingsBlock* node
    [all...]
backend_impl.cc 443 scoped_ptr<Rankings::Iterator> iterator(
444 reinterpret_cast<Rankings::Iterator*>(iter));
556 if (!block_files_.CreateBlock(RANKINGS, 1, &node_address)) {
582 cache_entry->rankings()->Store();
713 void BackendImpl::RecoveredEntry(CacheRankingsBlock* rankings) {
714 Addr address(rankings->Data()->contents);
823 EntryImpl* BackendImpl::GetOpenEntry(CacheRankingsBlock* rankings) const {
824 DCHECK(rankings->HasData());
826 open_entries_.find(rankings->Data()->contents);
1100 LOG(ERROR) << "Invalid rankings list, error " << num_entries
    [all...]
  /external/chromium_org/net/disk_cache/v3/
block_bitmaps.cc 30 DCHECK_NE(block_type, RANKINGS);
backend_impl_v3.cc 246 EntryImpl* BackendImpl::GetOpenEntry(CacheRankingsBlock* rankings) const {
247 DCHECK(rankings->HasData());
249 open_entries_.find(rankings->Data()->contents);
472 LOG(ERROR) << "Invalid rankings list, error " << num_entries;
499 data_->header.lru.sizes[Rankings::DELETED];
602 if (!block_files_.CreateBlock(RANKINGS, 1, &node_address)) {
628 cache_entry->rankings()->Store();
1006 if (!rankings_.SanityCheck(cache_entry->rankings(), false)) {
1011 // rankings node to be deleted if we find it through a list.
1012 rankings_.SetContents(cache_entry->rankings(), 0)
    [all...]

Completed in 223 milliseconds