Searched refs:m_entries (Results 1 - 4 of 4) sorted by relevance

/gem5/src/systemc/ext/tlm_core/2/generic_payload/
H A Darray.hh50 tlm_array(size_type size=0) : base_type(size), m_entries() {}
71 void insert_in_cache(T *p) { m_entries.push_back(p - &(*this)[0]); }
77 while (m_entries.size()) {
79 if ((*this)[m_entries.back()]) {
81 (*this)[m_entries.back()]->free();
84 (*this)[m_entries.back()] = nullptr;
85 m_entries.pop_back();
90 std::vector<size_type> m_entries; member in class:tlm::tlm_array
/gem5/ext/systemc/src/tlm_core/tlm_2/tlm_generic_payload/
H A Dtlm_array.h60 , m_entries()
63 //m_entries.reserve(size); // optional
84 //m_entries.reserve(new_size); // optional
96 m_entries.push_back( p-&(*this)[0] );
102 while(m_entries.size())
104 if ((*this)[m_entries.back()]) //we make sure no one cleared the slot manually
105 (*this)[m_entries.back()]->free();//...and then we call free on the content of the slot
106 (*this)[m_entries.back()]=0; //afterwards we set the slot to NULL
107 m_entries.pop_back();
112 std::vector<size_type> m_entries; member in class:tlm::tlm_array
[all...]
/gem5/src/mem/ruby/structures/
H A DDirectoryMemory.cc71 m_entries = new AbstractEntry*[m_num_entries];
73 m_entries[i] = NULL;
80 if (m_entries[i] != NULL) {
81 delete m_entries[i];
84 delete [] m_entries;
120 return m_entries[idx];
133 m_entries[idx] = entry;
H A DDirectoryMemory.hh92 AbstractEntry **m_entries; member in class:DirectoryMemory

Completed in 6 milliseconds