| /freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/Utility/ |
| HD | RangeMap.h | 139 void Append(const Entry &entry) { m_entries.push_back(entry); } in Append() 141 void Append(B base, S size) { m_entries.emplace_back(base, size); } in Append() 144 if (idx < m_entries.size()) { in RemoveEntrtAtIndex() 145 m_entries.erase(m_entries.begin() + idx); in RemoveEntrtAtIndex() 152 if (m_entries.size() > 1) in Sort() 153 std::stable_sort(m_entries.begin(), m_entries.end()); in Sort() 159 for (pos = m_entries.begin(), end = m_entries.end(), prev = end; pos != end; in IsSorted() 173 if (m_entries.size() > 1) { in CombineConsecutiveRanges() 181 for (pos = m_entries.begin(), end = m_entries.end(), prev = end; in CombineConsecutiveRanges() 193 for (pos = m_entries.begin(), end = m_entries.end(), prev = end; in CombineConsecutiveRanges() [all …]
|
| HD | Args.h | 124 llvm::ArrayRef<ArgEntry> entries() const { return m_entries; } in entries() 128 const_iterator begin() const { return m_entries.begin(); } in begin() 129 const_iterator end() const { return m_entries.end(); } in end() 132 const ArgEntry &operator[](size_t n) const { return m_entries[n]; } 286 std::vector<ArgEntry> m_entries;
|
| /freebsd-11-stable/contrib/llvm-project/lldb/source/Symbol/ |
| HD | LineTable.cpp | 22 : m_comp_unit(comp_unit), m_entries() {} in LineTable() 39 llvm::upper_bound(m_entries, entry, less_than_bp); in InsertLineEntry() 44 m_entries.insert(pos, entry); in InsertLineEntry() 51 void LineTable::LineSequenceImpl::Clear() { m_entries.clear(); } in Clear() 67 entry_collection &entries = seq->m_entries; in AppendLineEntryToSequence() 96 if (seq->m_entries.empty()) in InsertSequence() 98 Entry &entry = seq->m_entries.front(); in InsertSequence() 102 if (m_entries.empty() || in InsertSequence() 103 !Entry::EntryAddressLessThan(entry, m_entries.back())) { in InsertSequence() 104 m_entries.insert(m_entries.end(), seq->m_entries.begin(), in InsertSequence() [all …]
|
| /freebsd-11-stable/contrib/llvm-project/lldb/source/Utility/ |
| HD | Args.cpp | 182 m_entries.clear(); in operator =() 183 for (auto &entry : rhs.m_entries) { in operator =() 184 m_entries.emplace_back(entry.ref(), entry.quote); in operator =() 185 m_argv.push_back(m_entries.back().data()); in operator =() 199 for (auto &entry : m_entries) { in Dump() 210 for (size_t i = 0; i < m_entries.size(); ++i) { in GetCommandString() 213 command += m_entries[i].ref(); in GetCommandString() 216 return !m_entries.empty(); in GetCommandString() 222 for (size_t i = 0; i < m_entries.size(); ++i) { in GetQuotedCommandString() 226 if (m_entries[i].quote) { in GetQuotedCommandString() [all …]
|
| /freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/gp_hash_table_map_/ |
| D | constructor_destructor_fn_imps.hpp | 67 m_entries(s_entry_allocator.allocate(m_num_e)) in PB_DS_CLASS_NAME() 78 m_entries(s_entry_allocator.allocate(m_num_e)) in PB_DS_CLASS_NAME() 90 m_entries(s_entry_allocator.allocate(m_num_e)) in PB_DS_CLASS_NAME() 104 m_entries(s_entry_allocator.allocate(m_num_e)) in PB_DS_CLASS_NAME() 118 m_entries(s_entry_allocator.allocate(m_num_e)) in PB_DS_CLASS_NAME() 133 m_entries(s_entry_allocator.allocate(m_num_e)) in PB_DS_CLASS_NAME() 150 m_entries(s_entry_allocator.allocate(m_num_e)) in PB_DS_CLASS_NAME() 153 m_entries[i].m_stat = (entry_status)empty_entry_status; in PB_DS_CLASS_NAME() 159 m_entries[i].m_stat = other.m_entries[i].m_stat; in PB_DS_CLASS_NAME() 160 if (m_entries[i].m_stat == valid_entry_status) in PB_DS_CLASS_NAME() [all …]
|
| D | gp_ht_map_.hpp | 404 _GLIBCXX_DEBUG_ASSERT(m_entries[pos].m_stat != valid_entry_status); in insert_new_imp() 410 _GLIBCXX_DEBUG_ASSERT(m_entries[pos].m_stat != valid_entry_status); in insert_new_imp() 412 entry* const p_e = m_entries + pos; in insert_new_imp() 426 _GLIBCXX_DEBUG_ASSERT(m_entries[r_pos_hash_pair.first].m_stat != in insert_new_imp() 433 _GLIBCXX_DEBUG_ASSERT(m_entries[r_pos_hash_pair.first].m_stat != in insert_new_imp() 436 entry* const p_e = m_entries + r_pos_hash_pair.first; in insert_new_imp() 458 entry_pointer p_e = &m_entries[pos]; in subscript_imp() 474 if (m_entries[pos_hash_pair.first].m_stat != valid_entry_status) in subscript_imp() 479 return (m_entries + pos_hash_pair.first)->m_value.second; in subscript_imp() 495 entry* const p_e = m_entries + pos; in find_key_pointer() [all …]
|
| D | resize_fn_imps.hpp | 124 erase_all_valid_entries(m_entries, old_size); in resize_imp() 125 s_entry_allocator.deallocate(m_entries, old_size); in resize_imp() 126 m_entries = a_entries_resized; in resize_imp() 136 if (m_entries[pos].m_stat == valid_entry_status) in resize_imp() 137 resize_imp_reassign(m_entries + pos, a_entries_resized, in resize_imp()
|
| D | insert_no_store_hash_fn_imps.hpp | 65 entry* const p_e = m_entries + pos; in find_ins_pos() 108 if (m_entries[pos].m_stat == valid_entry_status) in insert_imp() 111 return std::make_pair(&(m_entries + pos)->m_value, false); in insert_imp()
|
| D | constructor_destructor_no_store_hash_fn_imps.hpp | 54 _GLIBCXX_DEBUG_ASSERT(m_entries[pos].m_stat != valid_entry_status)k; in constructor_insert_new_imp() 55 entry* const p_e = m_entries + pos; in constructor_insert_new_imp()
|
| D | constructor_destructor_store_hash_fn_imps.hpp | 54 _GLIBCXX_DEBUG_ASSERT(m_entries[pos].m_stat != valid_entry_status); in constructor_insert_new_imp() 55 entry* const p_e = m_entries + pos; in constructor_insert_new_imp()
|
| D | trace_fn_imps.hpp | 61 switch(m_entries[i].m_stat) in trace() 70 std::cerr << PB_DS_V2F(m_entries[i].m_value); in trace()
|
| D | erase_fn_imps.hpp | 67 entry_pointer p_e = &m_entries[pos]; in clear() 85 entry_pointer p_e = &m_entries[pos]; in erase_if()
|
| D | insert_store_hash_fn_imps.hpp | 67 entry* const p_e = m_entries + pos; in find_ins_pos() 114 entry_pointer p_e =& m_entries[pos_hash_pair.first]; in insert_imp()
|
| /freebsd-11-stable/contrib/llvm-project/lldb/source/Plugins/SymbolFile/DWARF/ |
| HD | DWARFDeclContext.cpp | 19 if (!m_entries.empty()) { in GetQualifiedName() 20 if (m_entries.size() == 1) { in GetQualifiedName() 21 if (m_entries[0].name) { in GetQualifiedName() 23 m_qualified_name.append(m_entries[0].name); in GetQualifiedName() 27 collection::const_reverse_iterator begin = m_entries.rbegin(); in GetQualifiedName() 28 collection::const_reverse_iterator end = m_entries.rend(); in GetQualifiedName() 55 if (m_entries.size() != rhs.m_entries.size()) in operator ==() 59 collection::const_iterator begin = m_entries.begin(); in operator ==() 60 collection::const_iterator end = m_entries.end(); in operator ==() 63 collection::const_iterator rhs_begin = rhs.m_entries.begin(); in operator ==()
|
| HD | DWARFDeclContext.h | 44 DWARFDeclContext() : m_entries(), m_language(lldb::eLanguageTypeUnknown) {} in DWARFDeclContext() 47 m_entries.push_back(Entry(tag, name)); in AppendDeclContext() 52 uint32_t GetSize() const { return m_entries.size(); } in GetSize() 56 return m_entries[idx]; 61 return m_entries[idx]; 73 m_entries.clear(); in Clear() 83 collection m_entries; variable
|
| /freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/cc_hash_table_map_/ |
| D | constructor_destructor_fn_imps.hpp | 71 m_entries(s_entry_pointer_allocator.allocate(m_num_e)) in PB_DS_CLASS_NAME() 82 m_entries(s_entry_pointer_allocator.allocate(m_num_e)) in PB_DS_CLASS_NAME() 94 m_entries(s_entry_pointer_allocator.allocate(m_num_e)) in PB_DS_CLASS_NAME() 96 std::fill(m_entries, m_entries + m_num_e, (entry_pointer)NULL); in PB_DS_CLASS_NAME() 109 m_entries(s_entry_pointer_allocator.allocate(m_num_e)) in PB_DS_CLASS_NAME() 123 m_entries(s_entry_pointer_allocator.allocate(m_num_e)) in PB_DS_CLASS_NAME() 138 m_entries(m_entries = s_entry_pointer_allocator.allocate(m_num_e)) in PB_DS_CLASS_NAME() 167 std::swap(m_entries, other.m_entries); in swap() 185 s_entry_pointer_allocator.deallocate(m_entries, m_num_e); in deallocate_all() 193 std::fill(m_entries, m_entries + m_num_e, entry_pointer(NULL)); in initialize()
|
| D | erase_fn_imps.hpp | 70 while (m_entries[pos] != NULL && pred(m_entries[pos]->m_value)) in erase_if() 73 entry_pointer p_next_e = m_entries[pos]->m_p_next; in erase_if() 74 erase_entry_pointer(m_entries[pos]); in erase_if() 75 m_entries[pos] = p_next_e; in erase_if() 78 entry_pointer p_e = m_entries[pos]; in erase_if() 101 while (m_entries[pos] != NULL) in clear() 102 erase_entry_pointer(m_entries[pos]); in clear()
|
| D | cc_ht_map_.hpp | 384 entry_pointer p_e = m_entries[pos]; in subscript_imp() 410 entry_pointer p_e = m_entries[pos_hash_pair.first]; in subscript_imp() 448 p_e->m_p_next = m_entries[pos]; in insert_new_imp() 449 m_entries[pos] = p_e; in insert_new_imp() 468 p_e->m_p_next = m_entries[r_pos_hash_pair.first]; in insert_new_imp() 469 m_entries[r_pos_hash_pair.first] = p_e; in insert_new_imp() 479 entry_pointer p_e = m_entries[ranged_hash_fn_base::operator()(r_key)]; in find_key_pointer() 503 entry_pointer p_e = m_entries[pos_hash_pair.first]; in find_key_pointer() 556 if (m_entries[r_pos.second] != NULL) in inc_it_state() 558 r_pos.first = m_entries[r_pos.second]; in inc_it_state() [all …]
|
| D | resize_fn_imps.hpp | 125 entry_pointer p_e = m_entries[pos]; in resize_imp_no_exceptions() 132 s_entry_pointer_allocator.deallocate(m_entries, old_size); in resize_imp_no_exceptions() 133 m_entries = a_p_entries_resized; in resize_imp_no_exceptions()
|
| D | constructor_destructor_no_store_hash_fn_imps.hpp | 58 p->m_p_next = m_entries[pos]; in constructor_insert_new_imp() 59 m_entries[pos] = p; in constructor_insert_new_imp()
|
| D | constructor_destructor_store_hash_fn_imps.hpp | 57 p->m_p_next = m_entries[pos]; in constructor_insert_new_imp() 60 m_entries[pos] = p; in constructor_insert_new_imp()
|
| D | erase_store_hash_fn_imps.hpp | 54 entry_pointer p_e = m_entries[r_pos_hash_pair.first]; in erase_in_pos_imp() 69 erase_entry_pointer(m_entries[r_pos_hash_pair.first]); in erase_in_pos_imp()
|
| D | erase_no_store_hash_fn_imps.hpp | 63 entry_pointer p_e = m_entries[pos]; in erase_in_pos_imp() 77 erase_entry_pointer(m_entries[pos]); in erase_in_pos_imp()
|
| /freebsd-11-stable/contrib/llvm-project/lldb/source/Interpreter/ |
| HD | CommandObjectRegexCommand.cpp | 24 m_entries(), m_is_removable(is_removable) {} in CommandObjectRegexCommand() 31 EntryCollection::const_iterator pos, end = m_entries.end(); in DoExecute() 32 for (pos = m_entries.begin(); pos != end; ++pos) { in DoExecute() 74 m_entries.resize(m_entries.size() + 1); in AddRegexCommand() 76 m_entries.back().regex = in AddRegexCommand() 78 if (m_entries.back().regex.IsValid()) { in AddRegexCommand() 79 m_entries.back().command.assign(command_cstr); in AddRegexCommand() 83 m_entries.pop_back(); in AddRegexCommand()
|
| /freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/Interpreter/ |
| HD | CommandObjectRegexCommand.h | 35 bool HasRegexEntries() const { return !m_entries.empty(); } in HasRegexEntries() 50 EntryCollection m_entries; variable
|