Searched refs:Rankings (Results 1 - 11 of 11) sorted by relevance
/external/chromium_org/net/disk_cache/blockfile/ |
H A D | eviction.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_;
|
H A D | 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); 187 rankings_->Remove(entry->rankings(), Rankings::LOW_USE, true); 188 rankings_->Insert(entry->rankings(), false, Rankings [all...] |
H A D | 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_) 251 return (!test_mode_ && header_->lru.sizes[Rankings::DELETED] > max_length); 282 Rankings::List Eviction::GetListForEntry(EntryImpl* entry) { 283 return Rankings::NO_USE; 287 Rankings [all...] |
H A D | rankings.h | 53 class Rankings { class in namespace:disk_cache 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) { 90 Rankings* rankings_; 102 Rankings* my_rankings; 105 Rankings(); 106 ~Rankings(); 209 DISALLOW_COPY_AND_ASSIGN(Rankings); [all...] |
H A D | eviction_v3.h | 19 namespace Rankings { namespace in namespace:disk_cache 51 bool EvictEntry(CacheRankingsBlock* node, bool empty, Rankings::List list);
|
H A D | rankings.cc | 196 Rankings::ScopedRankingsBlock::ScopedRankingsBlock() : rankings_(NULL) {} 198 Rankings::ScopedRankingsBlock::ScopedRankingsBlock(Rankings* rankings) 201 Rankings::ScopedRankingsBlock::ScopedRankingsBlock( 202 Rankings* rankings, CacheRankingsBlock* node) 205 Rankings::Iterator::Iterator() { 209 void Rankings::Iterator::Reset() { 217 Rankings::Rankings() : init_(false) {} function in class:disk_cache::Rankings 219 Rankings [all...] |
H A D | backend_impl.h | 77 int SyncOpenNextEntry(Rankings::Iterator* iterator, Entry** next_entry); 78 void SyncEndEnumeration(scoped_ptr<Rankings::Iterator> iterator); 84 EntryImpl* OpenNextEntryImpl(Rankings::Iterator* iter); 321 bool OpenFollowingEntryFromList(Rankings::List list, 326 EntryImpl* GetEnumeratedEntry(CacheRankingsBlock* next, Rankings::List list); 369 Rankings rankings_; // Rankings to be able to trim the cache.
|
H A D | in_flight_backend_io.h | 59 void OpenNextEntry(Rankings::Iterator* iterator, Entry** next_entry); 60 void EndEnumeration(scoped_ptr<Rankings::Iterator> iterator); 130 Rankings::Iterator* iterator_; 131 scoped_ptr<Rankings::Iterator> scoped_iterator_; 168 void OpenNextEntry(Rankings::Iterator* iterator, Entry** next_entry, 170 void EndEnumeration(scoped_ptr<Rankings::Iterator> iterator);
|
H A D | backend_impl.cc | 384 scoped_ptr<Rankings::Iterator> iterator(new Rankings::Iterator()); 418 scoped_ptr<Rankings::Iterator> iterator(new Rankings::Iterator()); 435 int BackendImpl::SyncOpenNextEntry(Rankings::Iterator* iterator, 441 void BackendImpl::SyncEndEnumeration(scoped_ptr<Rankings::Iterator> iterator) { 607 EntryImpl* BackendImpl::OpenNextEntryImpl(Rankings::Iterator* iterator) { 620 ret |= OpenFollowingEntryFromList(static_cast<Rankings::List>(i), 638 static_cast<Rankings::List>(i)); 670 iterator->list = static_cast<Rankings [all...] |
H A D | in_flight_backend_io.cc | 118 void BackendIO::OpenNextEntry(Rankings::Iterator* iterator, 125 void BackendIO::EndEnumeration(scoped_ptr<Rankings::Iterator> iterator) { 385 void InFlightBackendIO::OpenNextEntry(Rankings::Iterator* iterator, 394 scoped_ptr<Rankings::Iterator> iterator) {
|
/external/chromium_org/chrome/browser/autocomplete/ |
H A D | bookmark_provider_unittest.cc | 300 TEST_F(BookmarkProviderTest, Rankings) { 318 // Rankings of exact-word matches with different URLs.
|
Completed in 2156 milliseconds