| /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...] |
| /external/chromium_org/net/disk_cache/ |
| eviction.h | 10 #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
123 Rankings::ScopedRankingsBlock node(rankings_);
124 Rankings::ScopedRankingsBlock next(
125 rankings_, rankings_->GetPrev(node.get(), Rankings::NO_USE));
133 next.reset(rankings_->GetPrev(node.get(), Rankings::NO_USE));
138 if (EvictEntry(node.get(), empty, Rankings::NO_USE) && !test_mode_)
169 rankings_->UpdateRank(entry->rankings(), modified, GetListForEntry(entry));
181 rankings_->Insert(entry->rankings(), true, GetListForEntry(entry));
191 rankings_->Remove(entry->rankings(), GetListForEntry(entry), true);
247 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...] |
| rankings.cc | 5 #include "net/disk_cache/rankings.h"
30 // This class provides a simple lock for the LRU list of rankings. Whenever an
193 Rankings::ScopedRankingsBlock::ScopedRankingsBlock() : rankings_(NULL) {}
195 Rankings::ScopedRankingsBlock::ScopedRankingsBlock(Rankings* rankings)
196 : rankings_(rankings) {}
198 Rankings::ScopedRankingsBlock::ScopedRankingsBlock(
199 Rankings* rankings, CacheRankingsBlock* node
[all...] |
| backend_impl.h | 17 #include "net/disk_cache/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;
312 bool OpenFollowingEntryFromList(bool forward, Rankings::List list,
317 EntryImpl* GetEnumeratedEntry(CacheRankingsBlock* next, Rankings::List list);
360 Rankings rankings_; // Rankings to be able to trim the cache.
378 bool read_only_; // Prevents updates of the rankings data (used by tools).
|
| backend_impl.cc | 475 scoped_ptr<Rankings::Iterator> iterator(
476 reinterpret_cast<Rankings::Iterator*>(iter));
588 if (!block_files_.CreateBlock(RANKINGS, 1, &node_address)) {
614 cache_entry->rankings()->Store();
745 void BackendImpl::RecoveredEntry(CacheRankingsBlock* rankings) {
746 Addr address(rankings->Data()->contents);
855 EntryImpl* BackendImpl::GetOpenEntry(CacheRankingsBlock* rankings) const {
856 DCHECK(rankings->HasData());
858 open_entries_.find(rankings->Data()->contents);
1132 LOG(ERROR) << "Invalid rankings list, error " << num_entries
[all...] |
| /external/chromium_org/net/disk_cache/v3/ |
| eviction_v3.cc | 7 // only one list in use (Rankings::NO_USE), and elements are sent to the front
122 Rankings::ScopedRankingsBlock node(rankings_);
123 Rankings::ScopedRankingsBlock next(
124 rankings_, rankings_->GetPrev(node.get(), Rankings::NO_USE));
132 next.reset(rankings_->GetPrev(node.get(), Rankings::NO_USE));
137 if (EvictEntry(node.get(), empty, Rankings::NO_USE) && !test_mode_)
174 rankings_->Remove(entry->rankings(), Rankings::NO_USE, true);
175 rankings_->Insert(entry->rankings(), false, Rankings::LOW_USE)
[all...] |
| eviction_v3.h | 11 #include "net/disk_cache/rankings.h"
46 bool EvictEntry(CacheRankingsBlock* node, bool empty, Rankings::List list);
52 int SelectListByLength(Rankings::ScopedRankingsBlock* next);
56 Rankings* rankings_;
|
| backend_impl_v3.cc | 246 EntryImpl* BackendImpl::GetOpenEntry(CacheRankingsBlock* rankings) const {
247 DCHECK(rankings->HasData());
249 open_entries_.find(rankings->Data()->contents);
472 LOG(ERROR) << "Invalid rankings list, error " << num_entries;
499 data_->header.lru.sizes[Rankings::DELETED];
602 if (!block_files_.CreateBlock(RANKINGS, 1, &node_address)) {
628 cache_entry->rankings()->Store();
1006 if (!rankings_.SanityCheck(cache_entry->rankings(), false)) {
1011 // rankings node to be deleted if we find it through a list.
1012 rankings_.SetContents(cache_entry->rankings(), 0)
[all...] |
| /external/chromium_org/chrome/browser/autocomplete/ |
| bookmark_provider_unittest.cc | 279 TEST_F(BookmarkProviderTest, Rankings) {
296 // Rankings of exact-word matches with different URLs.
|
