HomeSort by relevance Sort by last modified time
    Searched refs:MemEntryImpl (Results 1 - 7 of 7) sorted by null

  /external/chromium/net/disk_cache/
mem_rankings.h 14 class MemEntryImpl;
23 void Insert(MemEntryImpl* node);
26 void Remove(MemEntryImpl* node);
29 void UpdateRank(MemEntryImpl* node);
32 MemEntryImpl* GetNext(MemEntryImpl* node);
33 MemEntryImpl* GetPrev(MemEntryImpl* node);
36 MemEntryImpl* head_;
37 MemEntryImpl* tail_
    [all...]
mem_rankings.cc 16 void MemRankings::Insert(MemEntryImpl* node) {
28 void MemRankings::Remove(MemEntryImpl* node) {
29 MemEntryImpl* prev = node->prev();
30 MemEntryImpl* next = node->next();
48 void MemRankings::UpdateRank(MemEntryImpl* node) {
53 MemEntryImpl* MemRankings::GetNext(MemEntryImpl* node) {
60 MemEntryImpl* MemRankings::GetPrev(MemEntryImpl* node) {
mem_entry_impl.h 45 class MemEntryImpl : public Entry {
52 explicit MemEntryImpl(MemBackendImpl* backend);
86 MemEntryImpl* next() const {
90 MemEntryImpl* prev() const {
94 void set_next(MemEntryImpl* next) {
98 void set_prev(MemEntryImpl* prev) {
107 typedef base::hash_map<int, MemEntryImpl*> EntryMap;
113 ~MemEntryImpl();
125 // Performs the initialization of a MemEntryImpl as a child entry.
128 bool InitChildEntry(MemEntryImpl* parent, int child_id)
    [all...]
mem_entry_impl.cc 38 MemEntryImpl::MemEntryImpl(MemBackendImpl* backend) {
51 MemEntryImpl::~MemEntryImpl() {
57 void MemEntryImpl::Doom() {
70 void MemEntryImpl::Close() {
79 std::string MemEntryImpl::GetKey() const {
85 Time MemEntryImpl::GetLastUsed() const {
89 Time MemEntryImpl::GetLastModified() const {
93 int32 MemEntryImpl::GetDataSize(int index) const
    [all...]
mem_backend_impl.h 17 class MemEntryImpl;
60 void InternalDoomEntry(MemEntryImpl* entry);
63 void UpdateRank(MemEntryImpl* node);
71 // Insert an MemEntryImpl into the ranking list. This method is only called
72 // from MemEntryImpl to insert child entries. The reference can be removed
74 void InsertIntoRankingList(MemEntryImpl* entry);
77 // MemEntryImpl to remove a child entry from the ranking list.
78 void RemoveFromRankingList(MemEntryImpl* entry);
90 typedef base::hash_map<std::string, MemEntryImpl*> EntryMap;
mem_backend_impl.cc 116 MemEntryImpl* cache_entry = new MemEntryImpl(this);
155 void MemBackendImpl::InternalDoomEntry(MemEntryImpl* entry) {
157 DCHECK(entry->type() == MemEntryImpl::kParentEntry);
188 MemEntryImpl* next = rankings_.GetNext(NULL);
194 MemEntryImpl* node = next;
237 MemEntryImpl* current = reinterpret_cast<MemEntryImpl*>(*iter);
238 MemEntryImpl* node = rankings_.GetNext(current);
241 while (node && node->type() != MemEntryImpl::kParentEntry)
    [all...]
entry_unittest.cc 872 disk_cache::MemEntryImpl* mem_entry =
873 reinterpret_cast<disk_cache::MemEntryImpl*>(entry);
874 EXPECT_EQ(disk_cache::MemEntryImpl::kParentEntry, mem_entry->type());
    [all...]

Completed in 8019 milliseconds