Searched refs:rankings (Results 1 - 9 of 9) sorted by relevance

/external/chromium/net/disk_cache/
H A Drankings.h69 explicit ScopedRankingsBlock(Rankings* rankings) : rankings_(rankings) {} argument
70 ScopedRankingsBlock(Rankings* rankings, CacheRankingsBlock* node) argument
71 : scoped_ptr<CacheRankingsBlock>(node), rankings_(rankings) {}
77 void set_rankings(Rankings* rankings) { argument
78 rankings_ = rankings;
96 explicit Iterator(Rankings* rankings);
154 // Gets the rankings information for a given rankings node. We may end up
156 // reference to that entry, so |rankings| mus
[all...]
H A Deviction.cc161 rankings_->UpdateRank(entry->rankings(), modified, GetListForEntry(entry));
173 rankings_->Insert(entry->rankings(), true, GetListForEntry(entry));
183 rankings_->Remove(entry->rankings(), GetListForEntry(entry), true);
275 rankings_->Remove(entry->rankings(), GetListForEntryV2(entry), true);
278 rankings_->Insert(entry->rankings(), true, Rankings::DELETED);
371 rankings_->UpdateRank(entry->rankings(), modified, GetListForEntryV2(entry));
384 rankings_->Remove(entry->rankings(), Rankings::NO_USE, true);
385 rankings_->Insert(entry->rankings(), false, Rankings::LOW_USE);
388 rankings_->Remove(entry->rankings(), Rankings::LOW_USE, true);
389 rankings_->Insert(entry->rankings(), fals
[all...]
H A Drankings.cc5 #include "net/disk_cache/rankings.h"
26 // This class provides a simple lock for the LRU list of rankings. Whenever an
189 Rankings::Iterator::Iterator(Rankings* rankings) { argument
191 my_rankings = rankings;
313 LOG(ERROR) << "Invalid rankings info.";
554 bool Rankings::GetRanking(CacheRankingsBlock* rankings) { argument
555 if (!rankings->address().is_initialized())
559 if (!rankings->Load())
562 if (!SanityCheck(rankings, true)) {
570 if (!rankings
593 ConvertToLongLived(CacheRankingsBlock* rankings) argument
716 CheckEntry(CacheRankingsBlock* rankings) argument
[all...]
H A Dbackend_impl.cc773 block_files_.GetFile(node_address)->Store(cache_entry->rankings());
896 void BackendImpl::RecoveredEntry(CacheRankingsBlock* rankings) { argument
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;
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(),
[all...]
H A Dbackend_impl.h18 #include "net/disk_cache/rankings.h"
124 void RecoveredEntry(CacheRankingsBlock* rankings);
141 // If the data stored by the provided |rankings| points to an open entry,
144 EntryImpl* GetOpenEntry(CacheRankingsBlock* rankings) const;
365 bool read_only_; // Prevents updates of the rankings data (used by tools).
H A Dentry_impl.h54 inline CacheRankingsBlock* rankings() { function in class:disk_cache::EntryImpl
82 // Reloads the rankings node information.
H A Dentry_impl.cc536 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.
/external/chromium/net/tools/dump_cache/
H A Ddump_files.cc127 disk_cache::RankingsNode* rankings);
215 disk_cache::RankingsNode* rankings) {
225 memcpy(rankings, rank_block.Data(), sizeof(*rankings));
240 printf("rankings: 0x%x\n", entry.rankings_node);
254 void DumpRankings(const disk_cache::RankingsNode& rankings) { argument
255 printf("next: 0x%x\n", rankings.next);
256 printf("prev: 0x%x\n", rankings.prev);
257 printf("entry: 0x%x\n", rankings.contents);
258 printf("dirty: %d\n", rankings
214 LoadRankings(disk_cache::CacheAddr addr, disk_cache::RankingsNode* rankings) argument
319 disk_cache::RankingsNode rankings; local
[all...]
/external/chromium/
H A DAndroid.mk232 net/disk_cache/rankings.cc \

Completed in 938 milliseconds