| /external/chromium_org/net/disk_cache/blockfile/ |
| 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.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.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...] |
| 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...] |
| backend_impl.h | 17 #include "net/disk_cache/blockfile/rankings.h"
77 int SyncOpenNextEntry(Rankings::Iterator* iterator, Entry** next_entry);
78 void SyncEndEnumeration(scoped_ptr<Rankings::Iterator> iterator);
84 EntryImpl* OpenNextEntryImpl(Rankings::Iterator* iter);
120 void RecoveredEntry(CacheRankingsBlock* rankings);
145 // If the data stored by the provided |rankings| points to an open entry,
148 EntryImpl* GetOpenEntry(CacheRankingsBlock* rankings) const;
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
[all...] |
| 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) {
558 if (!block_files_.CreateBlock(RANKINGS, 1, &node_address)) {
584 cache_entry->rankings()->Store();
607 EntryImpl* BackendImpl::OpenNextEntryImpl(Rankings::Iterator* iterator) {
620 ret |= OpenFollowingEntryFromList(static_cast<Rankings::List>(i)
[all...] |
| backend_impl_v3.cc | 172 DCHECK(rankings->HasData());
174 open_entries_.find(rankings->Data()->contents);
397 LOG(ERROR) << "Invalid rankings list, error " << num_entries;
521 if (!block_files_.CreateBlock(RANKINGS, 1, &node_address)) {
547 cache_entry->rankings()->Store();
933 if (!rankings_.SanityCheck(cache_entry->rankings(), false)) {
938 // rankings node to be deleted if we find it through a list.
939 rankings_.SetContents(cache_entry->rankings(), 0);
940 } else if (!rankings_.DataSanityCheck(cache_entry->rankings(), false)) {
943 rankings_.SetContents(cache_entry->rankings(), address.value())
[all...] |
| entry_impl.h | 61 inline CacheRankingsBlock* rankings() { function in class:disk_cache::EntryImpl
89 // Reloads the rankings node information.
258 CacheRankingsBlock node_; // Rankings related information for this entry.
|
| entry_impl.cc | 541 RankingsNode* rankings = node_.Data();
542 if (!rankings->dirty) {
543 rankings->dirty = backend_->GetCurrentEntryId();
571 // if it is possible to load the rankings node and delete them together.
[all...] |
| /external/chromium_org/net/tools/dump_cache/ |
| dump_files.cc | 171 disk_cache::RankingsNode* rankings);
258 disk_cache::RankingsNode* rankings) {
268 memcpy(rankings, rank_block.Data(), sizeof(*rankings));
269 printf("Rankings at 0x%x\n", addr);
283 printf("rankings: 0x%x\n", entry.rankings_node);
297 void DumpRankings(const disk_cache::RankingsNode& rankings) {
298 printf("next: 0x%x\n", rankings.next);
299 printf("prev: 0x%x\n", rankings.prev);
300 printf("entry: 0x%x\n", rankings.contents)
365 disk_cache::RankingsNode rankings; local
[all...] |
| /external/chromium_org/net/disk_cache/ |
| backend_unittest.cc | 199 // Order in rankings list:
218 // Order in rankings list:
[all...] |
| /external/chromium_org/net/ |
| net.target.darwin-arm.mk | 188 net/disk_cache/blockfile/rankings.cc \
|
| net.target.darwin-arm64.mk | 188 net/disk_cache/blockfile/rankings.cc \
|
| net.target.darwin-mips.mk | 188 net/disk_cache/blockfile/rankings.cc \
|
| net.target.darwin-mips64.mk | 188 net/disk_cache/blockfile/rankings.cc \
|
| net.target.darwin-x86.mk | 188 net/disk_cache/blockfile/rankings.cc \
|
| net.target.darwin-x86_64.mk | 188 net/disk_cache/blockfile/rankings.cc \
|
| net.target.linux-arm.mk | 188 net/disk_cache/blockfile/rankings.cc \
|
| net.target.linux-arm64.mk | 188 net/disk_cache/blockfile/rankings.cc \
|
| net.target.linux-mips.mk | 188 net/disk_cache/blockfile/rankings.cc \
|
| net.target.linux-mips64.mk | 188 net/disk_cache/blockfile/rankings.cc \
|
| net.target.linux-x86.mk | 188 net/disk_cache/blockfile/rankings.cc \
|