Home | History | Annotate | Download | only in disk_cache

Lines Matching refs:RANKINGS

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);
1242 LOG(ERROR) << "Invalid rankings list, error " << num_entries;
1261 data_->header.lru.sizes[Rankings::DELETED];
1536 if (!rankings_.SanityCheck(cache_entry->rankings(), false)) {
1540 // rankings node to be deleted if we find it through a list.
1541 rankings_.SetContents(cache_entry->rankings(), 0);
1542 } else if (!rankings_.DataSanityCheck(cache_entry->rankings(), false)) {
1544 rankings_.SetContents(cache_entry->rankings(), address.value());
1675 scoped_ptr<Rankings::Iterator> iterator(
1676 reinterpret_cast<Rankings
1680 iterator.reset(new Rankings::Iterator(&rankings_));
1686 ret |= OpenFollowingEntryFromList(forward, static_cast<Rankings::List>(i),
1702 static_cast<Rankings::List>(i));
1733 iterator->list = static_cast<Rankings::List>(newest);
1736 iterator->list = static_cast<Rankings::List>(oldest);
1743 bool BackendImpl::OpenFollowingEntryFromList(bool forward, Rankings::List list,
1749 if (!new_eviction_ && Rankings::NO_USE != list)
1752 Rankings::ScopedRankingsBlock rankings(&rankings_, *from_entry);
1754 rankings_.GetNext(rankings.get(), list) :
1755 rankings_.GetPrev(rankings.get(), list);
1756 Rankings::ScopedRankingsBlock next(&rankings_, next_block);
1768 Rankings::List list) {
1777 // There is nothing linked from the index. Delete the rankings node.
1984 data_->header.lru.sizes[Rankings::NO_USE] = data_->header.num_entries;
2088 ok = ok && block_files_.IsValid(cache_entry->rankings()->address());
2098 RankingsNode* rankings = cache_entry->rankings()->Data();
2099 return ok && !rankings->dummy;