Home
last modified time | relevance | path

Searched refs:GetPrev (Results 1 – 7 of 7) sorted by relevance

/external/chromium/net/disk_cache/
Deviction.cc117 rankings_->GetPrev(node.get(), Rankings::NO_USE)); in TrimCache()
124 next.reset(rankings_->GetPrev(node.get(), Rankings::NO_USE)); in TrimCache()
303 next[i].reset(rankings_->GetPrev(NULL, static_cast<Rankings::List>(i))); in TrimCacheV2()
327 next[list].reset(rankings_->GetPrev(node.get(), in TrimCacheV2()
472 rankings_->GetPrev(node.get(), Rankings::DELETED)); in TrimDeleted()
477 next.reset(rankings_->GetPrev(node.get(), Rankings::DELETED)); in TrimDeleted()
551 rankings_->GetPrev(NULL, Rankings::NO_USE)); in ReportListStats()
553 rankings_->GetPrev(NULL, Rankings::LOW_USE)); in ReportListStats()
555 rankings_->GetPrev(NULL, Rankings::HIGH_USE)); in ReportListStats()
557 rankings_->GetPrev(NULL, Rankings::DELETED)); in ReportListStats()
Dmem_rankings.h34 MemEntryImpl* GetPrev(MemEntryImpl* node);
Dmem_rankings.cc60 MemEntryImpl* MemRankings::GetPrev(MemEntryImpl* node) { in GetPrev() function in disk_cache::MemRankings
Dmem_backend_impl.cc294 MemEntryImpl* next = rankings_.GetPrev(NULL); in TrimCache()
301 next = rankings_.GetPrev(next); in TrimCache()
Drankings.h127 CacheRankingsBlock* GetPrev(CacheRankingsBlock* node, List list);
Drankings.cc433 CacheRankingsBlock* Rankings::GetPrev(CacheRankingsBlock* node, List list) { in GetPrev() function in disk_cache::Rankings
Dbackend_impl.cc1761 rankings_.GetPrev(rankings.get(), list); in OpenFollowingEntryFromList()