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

  /external/chromium_org/net/disk_cache/blockfile/
eviction.h 10 #include "net/disk_cache/blockfile/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_v3.cc 7 // only one list in use (Rankings::NO_USE), and elements are sent to the front
131 Rankings::ScopedRankingsBlock node(rankings_);
132 Rankings::ScopedRankingsBlock next(
133 rankings_, rankings_->GetPrev(node.get(), Rankings::NO_USE));
141 next.reset(rankings_->GetPrev(node.get(), Rankings::NO_USE));
146 if (EvictEntry(node.get(), empty, Rankings::NO_USE) && !test_mode_)
183 rankings_->Remove(entry->rankings(), Rankings::NO_USE, true);
184 rankings_->Insert(entry->rankings(), false, Rankings::LOW_USE)
    [all...]
eviction.cc 7 // only one list in use (Rankings::NO_USE), and elements are sent to the front
127 Rankings::ScopedRankingsBlock node(rankings_);
128 Rankings::ScopedRankingsBlock next(
129 rankings_, rankings_->GetPrev(node.get(), Rankings::NO_USE));
137 next.reset(rankings_->GetPrev(node.get(), Rankings::NO_USE));
142 if (EvictEntry(node.get(), empty, Rankings::NO_USE) && !test_mode_)
173 rankings_->UpdateRank(entry->rankings(), modified, GetListForEntry(entry));
185 rankings_->Insert(entry->rankings(), true, GetListForEntry(entry));
195 rankings_->Remove(entry->rankings(), GetListForEntry(entry), true);
251 return (!test_mode_ && header_->lru.sizes[Rankings::DELETED] > max_length)
    [all...]
rankings.h 53 class Rankings {
66 // Rankings whenever a CacheRankingsBlock is deleted, to keep track of cache
71 explicit ScopedRankingsBlock(Rankings* rankings);
72 ScopedRankingsBlock(Rankings* rankings, CacheRankingsBlock* node);
78 void set_rankings(Rankings* rankings) {
79 rankings_ = rankings;
90 Rankings* rankings_
    [all...]
eviction_v3.h 19 namespace Rankings {
51 bool EvictEntry(CacheRankingsBlock* node, bool empty, Rankings::List list);
rankings.cc 5 #include "net/disk_cache/blockfile/rankings.h"
33 // This class provides a simple lock for the LRU list of rankings. Whenever an
196 Rankings::ScopedRankingsBlock::ScopedRankingsBlock() : rankings_(NULL) {}
198 Rankings::ScopedRankingsBlock::ScopedRankingsBlock(Rankings* rankings)
199 : rankings_(rankings) {}
201 Rankings::ScopedRankingsBlock::ScopedRankingsBlock(
202 Rankings* rankings, CacheRankingsBlock* node
    [all...]
backend_impl.h 16 #include "net/disk_cache/blockfile/rankings.h"
118 void RecoveredEntry(CacheRankingsBlock* rankings);
143 // If the data stored by the provided |rankings| points to an open entry,
146 EntryImpl* GetOpenEntry(CacheRankingsBlock* rankings) const;
315 bool OpenFollowingEntryFromList(bool forward, Rankings::List list,
320 EntryImpl* GetEnumeratedEntry(CacheRankingsBlock* next, Rankings::List list);
363 Rankings rankings_; // Rankings to be able to trim the cache.
381 bool read_only_; // Prevents updates of the rankings data (used by tools).
backend_impl.cc 450 scoped_ptr<Rankings::Iterator> iterator(
451 reinterpret_cast<Rankings::Iterator*>(iter));
567 if (!block_files_.CreateBlock(RANKINGS, 1, &node_address)) {
593 cache_entry->rankings()->Store();
721 void BackendImpl::RecoveredEntry(CacheRankingsBlock* rankings) {
722 Addr address(rankings->Data()->contents);
831 EntryImpl* BackendImpl::GetOpenEntry(CacheRankingsBlock* rankings) const {
832 DCHECK(rankings->HasData());
834 open_entries_.find(rankings->Data()->contents);
1115 LOG(ERROR) << "Invalid rankings list, error " << num_entries
    [all...]
backend_impl_v3.cc 179 DCHECK(rankings->HasData());
181 open_entries_.find(rankings->Data()->contents);
404 LOG(ERROR) << "Invalid rankings list, error " << num_entries;
528 if (!block_files_.CreateBlock(RANKINGS, 1, &node_address)) {
554 cache_entry->rankings()->Store();
930 if (!rankings_.SanityCheck(cache_entry->rankings(), false)) {
935 // rankings node to be deleted if we find it through a list.
936 rankings_.SetContents(cache_entry->rankings(), 0);
937 } else if (!rankings_.DataSanityCheck(cache_entry->rankings(), false)) {
940 rankings_.SetContents(cache_entry->rankings(), address.value())
    [all...]
  /external/chromium_org/chrome/browser/autocomplete/
bookmark_provider_unittest.cc 297 TEST_F(BookmarkProviderTest, Rankings) {
315 // Rankings of exact-word matches with different URLs.

Completed in 2695 milliseconds