| /external/chromium/net/disk_cache/ |
| 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...] |
| 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.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.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...] |
| 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).
|
| entry_impl.h | 54 inline CacheRankingsBlock* rankings() { function in class:disk_cache::EntryImpl
82 // Reloads the rankings node information.
247 CacheRankingsBlock node_; // Rankings related information for this entry.
|
| entry_impl.cc | 536 RankingsNode* rankings = node_.Data();
537 if (!rankings->dirty) {
538 rankings->dirty = backend_->GetCurrentEntryId();
572 // if it is possible to load the rankings node and delete them together.
583 rankings_addr.file_type() != RANKINGS || rankings_addr.num_blocks() != 1)
[all...] |
| /external/chromium_org/net/disk_cache/ |
| 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
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.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.cc | 443 scoped_ptr<Rankings::Iterator> iterator(
444 reinterpret_cast<Rankings::Iterator*>(iter));
556 if (!block_files_.CreateBlock(RANKINGS, 1, &node_address)) {
582 cache_entry->rankings()->Store();
713 void BackendImpl::RecoveredEntry(CacheRankingsBlock* rankings) {
714 Addr address(rankings->Data()->contents);
823 EntryImpl* BackendImpl::GetOpenEntry(CacheRankingsBlock* rankings) const {
824 DCHECK(rankings->HasData());
826 open_entries_.find(rankings->Data()->contents);
1100 LOG(ERROR) << "Invalid rankings list, error " << num_entries
[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).
|
| 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 | 538 RankingsNode* rankings = node_.Data();
539 if (!rankings->dirty) {
540 rankings->dirty = backend_->GetCurrentEntryId();
568 // if it is possible to load the rankings node and delete them together.
[all...] |
| backend_unittest.cc | 197 // Order in rankings list:
216 // Order in rankings list:
[all...] |
| /external/chromium/net/tools/dump_cache/ |
| dump_files.cc | 127 disk_cache::RankingsNode* rankings);
215 disk_cache::RankingsNode* rankings) {
225 memcpy(rankings, rank_block.Data(), sizeof(*rankings));
226 printf("Rankings at 0x%x\n", addr);
240 printf("rankings: 0x%x\n", entry.rankings_node);
254 void DumpRankings(const disk_cache::RankingsNode& rankings) {
255 printf("next: 0x%x\n", rankings.next);
256 printf("prev: 0x%x\n", rankings.prev);
257 printf("entry: 0x%x\n", rankings.contents)
319 disk_cache::RankingsNode rankings; local
[all...] |
| /external/chromium_org/net/tools/dump_cache/ |
| dump_files.cc | 172 disk_cache::RankingsNode* rankings);
259 disk_cache::RankingsNode* rankings) {
269 memcpy(rankings, rank_block.Data(), sizeof(*rankings));
270 printf("Rankings at 0x%x\n", addr);
284 printf("rankings: 0x%x\n", entry.rankings_node);
298 void DumpRankings(const disk_cache::RankingsNode& rankings) {
299 printf("next: 0x%x\n", rankings.next);
300 printf("prev: 0x%x\n", rankings.prev);
301 printf("entry: 0x%x\n", rankings.contents)
366 disk_cache::RankingsNode rankings; local
[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...] |
| backend_impl_v3.h | 17 #include "net/disk_cache/rankings.h"
84 // If the data stored by the provided |rankings| points to an open entry,
87 EntryImpl* GetOpenEntry(CacheRankingsBlock* rankings) const;
267 bool read_only_; // Prevents updates of the rankings data (used by tools).
|
| 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/ |
| Android.mk | 231 net/disk_cache/rankings.cc \
|
| /external/chromium_org/net/ |
| net.target.darwin-arm.mk | 156 net/disk_cache/rankings.cc \
|
| net.target.darwin-mips.mk | 156 net/disk_cache/rankings.cc \
|
| net.target.darwin-x86.mk | 156 net/disk_cache/rankings.cc \
|
| net.target.linux-arm.mk | 156 net/disk_cache/rankings.cc \
|
