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

  /external/chromium/net/disk_cache/
eviction.h 12 #include "net/disk_cache/rankings.h"
52 Rankings::List GetListForEntry(EntryImpl* entry);
53 bool EvictEntry(CacheRankingsBlock* node, bool empty, Rankings::List list);
64 Rankings::List GetListForEntryV2(EntryImpl* entry);
69 int SelectListByLength(Rankings::ScopedRankingsBlock* next);
73 Rankings* rankings_;
eviction.cc 7 // only one list in use (Rankings::NO_USE), and elements are sent to the front
115 Rankings::ScopedRankingsBlock node(rankings_);
116 Rankings::ScopedRankingsBlock next(rankings_,
117 rankings_->GetPrev(node.get(), Rankings::NO_USE));
124 next.reset(rankings_->GetPrev(node.get(), Rankings::NO_USE));
129 if (!EvictEntry(node.get(), empty, Rankings::NO_USE) && !test_mode_)
161 rankings_->UpdateRank(entry->rankings(), modified, GetListForEntry(entry));
173 rankings_->Insert(entry->rankings(), true, GetListForEntry(entry));
183 rankings_->Remove(entry->rankings(), GetListForEntry(entry), true);
255 Rankings::List Eviction::GetListForEntry(EntryImpl* entry)
    [all...]
rankings.h 51 class Rankings {
64 // Rankings whenever a CacheRankingsBlock is deleted, to keep track of cache
69 explicit ScopedRankingsBlock(Rankings* rankings) : rankings_(rankings) {}
70 ScopedRankingsBlock(Rankings* rankings, CacheRankingsBlock* node)
71 : scoped_ptr<CacheRankingsBlock>(node), rankings_(rankings) {}
77 void set_rankings(Rankings* rankings) {
    [all...]
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.h 18 #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;
299 bool OpenFollowingEntryFromList(bool forward, Rankings::List list,
304 EntryImpl* GetEnumeratedEntry(CacheRankingsBlock* next, Rankings::List list);
347 Rankings rankings_; // Rankings to be able to trim the cache.
365 bool read_only_; // Prevents updates of the rankings data (used by tools).
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...]

Completed in 204 milliseconds