Searched refs:MemEntryImpl (Results 1 – 7 of 7) sorted by relevance
15 class MemEntryImpl; variable24 void Insert(MemEntryImpl* node);27 void Remove(MemEntryImpl* node);30 void UpdateRank(MemEntryImpl* node);33 MemEntryImpl* GetNext(MemEntryImpl* node);34 MemEntryImpl* GetPrev(MemEntryImpl* node);37 MemEntryImpl* head_;38 MemEntryImpl* tail_;
48 MemEntryImpl::MemEntryImpl(MemBackendImpl* backend) { in MemEntryImpl() function in disk_cache::MemEntryImpl63 bool MemEntryImpl::CreateEntry(const std::string& key, net::NetLog* net_log) { in CreateEntry()78 void MemEntryImpl::InternalDoom() { in InternalDoom()104 void MemEntryImpl::Open() { in Open()114 bool MemEntryImpl::InUse() { in InUse()127 void MemEntryImpl::Doom() { in Doom()140 void MemEntryImpl::Close() { in Close()149 std::string MemEntryImpl::GetKey() const { in GetKey()155 Time MemEntryImpl::GetLastUsed() const { in GetLastUsed()159 Time MemEntryImpl::GetLastModified() const { in GetLastModified()[all …]
47 class MemEntryImpl : public Entry {54 explicit MemEntryImpl(MemBackendImpl* backend);66 MemEntryImpl* next() const { in next()70 MemEntryImpl* prev() const { in prev()74 void set_next(MemEntryImpl* next) { in set_next()78 void set_prev(MemEntryImpl* prev) { in set_prev()117 typedef base::hash_map<int, MemEntryImpl*> EntryMap;123 ~MemEntryImpl();149 bool InitChildEntry(MemEntryImpl* parent, int child_id, net::NetLog* net_log);155 MemEntryImpl* OpenChild(int64 offset, bool create);[all …]
16 void MemRankings::Insert(MemEntryImpl* node) { in Insert()28 void MemRankings::Remove(MemEntryImpl* node) { in Remove()29 MemEntryImpl* prev = node->prev(); in Remove()30 MemEntryImpl* next = node->next(); in Remove()48 void MemRankings::UpdateRank(MemEntryImpl* node) { in UpdateRank()53 MemEntryImpl* MemRankings::GetNext(MemEntryImpl* node) { in GetNext()60 MemEntryImpl* MemRankings::GetPrev(MemEntryImpl* node) { in GetPrev()
93 void MemBackendImpl::InternalDoomEntry(MemEntryImpl* entry) { in InternalDoomEntry()95 DCHECK(entry->type() == MemEntryImpl::kParentEntry); in InternalDoomEntry()107 void MemBackendImpl::UpdateRank(MemEntryImpl* node) { in UpdateRank()122 void MemBackendImpl::InsertIntoRankingList(MemEntryImpl* entry) { in InsertIntoRankingList()126 void MemBackendImpl::RemoveFromRankingList(MemEntryImpl* entry) { in RemoveFromRankingList()210 MemEntryImpl* cache_entry = new MemEntryImpl(this); in CreateEntry()245 MemEntryImpl* next = rankings_.GetNext(NULL); in DoomEntriesBetween()251 MemEntryImpl* node = next; in DoomEntriesBetween()277 MemEntryImpl* current = reinterpret_cast<MemEntryImpl*>(*iter); in OpenNextEntry()278 MemEntryImpl* node = rankings_.GetNext(current); in OpenNextEntry()[all …]
22 class MemEntryImpl; variable45 void InternalDoomEntry(MemEntryImpl* entry);48 void UpdateRank(MemEntryImpl* node);59 void InsertIntoRankingList(MemEntryImpl* entry);63 void RemoveFromRankingList(MemEntryImpl* entry);85 typedef base::hash_map<std::string, MemEntryImpl*> EntryMap;
1280 disk_cache::MemEntryImpl* mem_entry = in TEST_F()1281 reinterpret_cast<disk_cache::MemEntryImpl*>(entry); in TEST_F()1282 EXPECT_EQ(disk_cache::MemEntryImpl::kParentEntry, mem_entry->type()); in TEST_F()