/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/Utility/ |
H A D | RangeMap.h | 139 void Append(const Entry &entry) { m_entries.push_back(entry); } 141 void Append(B base, S size) { m_entries.emplace_back(base, size); } 144 if (idx < m_entries.size()) { 145 m_entries.erase(m_entries.begin() + idx); 152 if (m_entries.size() > 1) 153 std::stable_sort(m_entries.begin(), m_entries.end()); 159 for (pos = m_entries.begin(), end = m_entries 329 Collection m_entries; member in class:lldb_private::RangeArray 585 Collection m_entries; member in class:lldb_private::RangeVector 807 Collection m_entries; member in class:lldb_private::RangeDataVector 924 Collection m_entries; member in class:lldb_private::AddressDataArray [all...] |
H A D | Args.h | 124 llvm::ArrayRef<ArgEntry> entries() const { return m_entries; } 128 const_iterator begin() const { return m_entries.begin(); } 129 const_iterator end() const { return m_entries.end(); } 132 const ArgEntry &operator[](size_t n) const { return m_entries[n]; } 286 std::vector<ArgEntry> m_entries; member in class:lldb_private::Args
|
/freebsd-11-stable/contrib/llvm-project/lldb/source/Plugins/SymbolFile/DWARF/ |
H A D | DWARFDeclContext.cpp | 19 if (!m_entries.empty()) { 20 if (m_entries.size() == 1) { 21 if (m_entries[0].name) { 23 m_qualified_name.append(m_entries[0].name); 27 collection::const_reverse_iterator begin = m_entries.rbegin(); 28 collection::const_reverse_iterator end = m_entries.rend(); 55 if (m_entries.size() != rhs.m_entries.size()) 59 collection::const_iterator begin = m_entries.begin(); 60 collection::const_iterator end = m_entries [all...] |
H A D | DWARFDeclContext.h | 44 DWARFDeclContext() : m_entries(), m_language(lldb::eLanguageTypeUnknown) {} 47 m_entries.push_back(Entry(tag, name)); 52 uint32_t GetSize() const { return m_entries.size(); } 56 return m_entries[idx]; 61 return m_entries[idx]; 73 m_entries.clear(); 83 collection m_entries; member in class:DWARFDeclContext
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/cc_hash_table_map_/ |
H A D | constructor_destructor_no_store_hash_fn_imps.hpp | 58 p->m_p_next = m_entries[pos]; 59 m_entries[pos] = p;
|
H A D | erase_fn_imps.hpp | 70 while (m_entries[pos] != NULL && pred(m_entries[pos]->m_value)) 73 entry_pointer p_next_e = m_entries[pos]->m_p_next; 74 erase_entry_pointer(m_entries[pos]); 75 m_entries[pos] = p_next_e; 78 entry_pointer p_e = m_entries[pos]; 101 while (m_entries[pos] != NULL) 102 erase_entry_pointer(m_entries[pos]);
|
H A D | constructor_destructor_store_hash_fn_imps.hpp | 57 p->m_p_next = m_entries[pos]; 60 m_entries[pos] = p;
|
H A D | constructor_destructor_fn_imps.hpp | 71 m_entries(s_entry_pointer_allocator.allocate(m_num_e)) 82 m_entries(s_entry_pointer_allocator.allocate(m_num_e)) 94 m_entries(s_entry_pointer_allocator.allocate(m_num_e)) 96 std::fill(m_entries, m_entries + m_num_e, (entry_pointer)NULL); 109 m_entries(s_entry_pointer_allocator.allocate(m_num_e)) 123 m_entries(s_entry_pointer_allocator.allocate(m_num_e)) 138 m_entries(m_entries = s_entry_pointer_allocator.allocate(m_num_e)) 167 std::swap(m_entries, othe [all...] |
H A D | resize_fn_imps.hpp | 125 entry_pointer p_e = m_entries[pos]; 132 s_entry_pointer_allocator.deallocate(m_entries, old_size); 133 m_entries = a_p_entries_resized;
|
H A D | debug_fn_imps.hpp | 55 assert_entry_pointer_array_valid(m_entries);
|
H A D | trace_fn_imps.hpp | 60 trace_list(m_entries[i]);
|
H A D | erase_no_store_hash_fn_imps.hpp | 63 entry_pointer p_e = m_entries[pos]; 77 erase_entry_pointer(m_entries[pos]);
|
H A D | erase_store_hash_fn_imps.hpp | 54 entry_pointer p_e = m_entries[r_pos_hash_pair.first]; 69 erase_entry_pointer(m_entries[r_pos_hash_pair.first]);
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/gp_hash_table_map_/ |
H A D | constructor_destructor_no_store_hash_fn_imps.hpp | 54 _GLIBCXX_DEBUG_ASSERT(m_entries[pos].m_stat != valid_entry_status)k; 55 entry* const p_e = m_entries + pos;
|
H A D | constructor_destructor_store_hash_fn_imps.hpp | 54 _GLIBCXX_DEBUG_ASSERT(m_entries[pos].m_stat != valid_entry_status); 55 entry* const p_e = m_entries + pos;
|
H A D | trace_fn_imps.hpp | 61 switch(m_entries[i].m_stat) 70 std::cerr << PB_DS_V2F(m_entries[i].m_value);
|
H A D | constructor_destructor_fn_imps.hpp | 67 m_entries(s_entry_allocator.allocate(m_num_e)) 78 m_entries(s_entry_allocator.allocate(m_num_e)) 90 m_entries(s_entry_allocator.allocate(m_num_e)) 104 m_entries(s_entry_allocator.allocate(m_num_e)) 118 m_entries(s_entry_allocator.allocate(m_num_e)) 133 m_entries(s_entry_allocator.allocate(m_num_e)) 150 m_entries(s_entry_allocator.allocate(m_num_e)) 153 m_entries[i].m_stat = (entry_status)empty_entry_status; 159 m_entries[i].m_stat = other.m_entries[ [all...] |
H A D | debug_fn_imps.hpp | 55 assert_entry_array_valid(m_entries, traits_base::m_store_extra_indicator);
|
H A D | resize_fn_imps.hpp | 124 erase_all_valid_entries(m_entries, old_size); 125 s_entry_allocator.deallocate(m_entries, old_size); 126 m_entries = a_entries_resized; 136 if (m_entries[pos].m_stat == valid_entry_status) 137 resize_imp_reassign(m_entries + pos, a_entries_resized,
|
H A D | insert_no_store_hash_fn_imps.hpp | 65 entry* const p_e = m_entries + pos; 108 if (m_entries[pos].m_stat == valid_entry_status) 111 return std::make_pair(&(m_entries + pos)->m_value, false);
|
H A D | erase_fn_imps.hpp | 67 entry_pointer p_e = &m_entries[pos]; 85 entry_pointer p_e = &m_entries[pos];
|
/freebsd-11-stable/contrib/llvm-project/lldb/source/Symbol/ |
H A D | LineTable.cpp | 22 : m_comp_unit(comp_unit), m_entries() {} 39 llvm::upper_bound(m_entries, entry, less_than_bp); 44 m_entries.insert(pos, entry); 51 void LineTable::LineSequenceImpl::Clear() { m_entries.clear(); } 67 entry_collection &entries = seq->m_entries; 96 if (seq->m_entries.empty()) 98 Entry &entry = seq->m_entries.front(); 102 if (m_entries.empty() || 103 !Entry::EntryAddressLessThan(entry, m_entries.back())) { 104 m_entries [all...] |
/freebsd-11-stable/contrib/llvm-project/lldb/source/Utility/ |
H A D | Args.cpp | 182 m_entries.clear(); 183 for (auto &entry : rhs.m_entries) { 184 m_entries.emplace_back(entry.ref(), entry.quote); 185 m_argv.push_back(m_entries.back().data()); 199 for (auto &entry : m_entries) { 210 for (size_t i = 0; i < m_entries.size(); ++i) { 213 command += m_entries[i].ref(); 216 return !m_entries.empty(); 222 for (size_t i = 0; i < m_entries.size(); ++i) { 226 if (m_entries[ [all...] |
/freebsd-11-stable/contrib/llvm-project/lldb/source/Interpreter/ |
H A D | CommandObjectRegexCommand.cpp | 24 m_entries(), m_is_removable(is_removable) {} 31 EntryCollection::const_iterator pos, end = m_entries.end(); 32 for (pos = m_entries.begin(); pos != end; ++pos) { 74 m_entries.resize(m_entries.size() + 1); 76 m_entries.back().regex = 78 if (m_entries.back().regex.IsValid()) { 79 m_entries.back().command.assign(command_cstr); 83 m_entries.pop_back();
|
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/Interpreter/ |
H A D | CommandObjectRegexCommand.h | 35 bool HasRegexEntries() const { return !m_entries.empty(); } 50 EntryCollection m_entries; member in class:lldb_private::CommandObjectRegexCommand
|