reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
37 entry_collection::iterator begin_pos = m_entries.begin(); 38 entry_collection::iterator end_pos = m_entries.end(); 46 m_entries.insert(pos, entry); 104 if (m_entries.empty() || 105 !Entry::EntryAddressLessThan(entry, m_entries.back())) { 106 m_entries.insert(m_entries.end(), seq->m_entries.begin(), 106 m_entries.insert(m_entries.end(), seq->m_entries.begin(), 112 entry_collection::iterator begin_pos = m_entries.begin(); 113 entry_collection::iterator end_pos = m_entries.end(); 132 m_entries.insert(pos, seq->m_entries.begin(), seq->m_entries.end()); 159 uint32_t LineTable::GetSize() const { return m_entries.size(); } 162 if (idx < m_entries.size()) { 182 entry_collection::const_iterator begin_pos = m_entries.begin(); 183 entry_collection::const_iterator end_pos = m_entries.end(); 244 if (idx >= m_entries.size()) 247 const Entry &entry = m_entries[idx]; 267 if (!entry.is_terminal_entry && idx + 1 < m_entries.size()) 268 line_entry.range.SetByteSize(m_entries[idx + 1].file_addr - 291 const size_t count = m_entries.size(); 299 if (m_entries[idx].is_terminal_entry) 302 if (find(begin_pos, end_pos, m_entries[idx].file_idx) == end_pos) 311 if (m_entries[idx].line < line) { 313 } else if (m_entries[idx].line == line) { 320 else if (m_entries[idx].line < m_entries[best_match].line) 320 else if (m_entries[idx].line < m_entries[best_match].line) 337 const size_t count = m_entries.size(); 343 if (m_entries[idx].is_terminal_entry) 346 if (m_entries[idx].file_idx != file_idx) 355 if (m_entries[idx].line < line) { 357 } else if (m_entries[idx].line == line) { 364 else if (m_entries[idx].line < m_entries[best_match].line) 364 else if (m_entries[idx].line < m_entries[best_match].line) 384 const size_t count = m_entries.size(); 391 if (m_entries[idx].is_terminal_entry) 394 if (m_entries[idx].file_idx == file_idx) { 407 const size_t count = m_entries.size(); 421 const size_t count = m_entries.size(); 436 const size_t count = m_entries.size(); 440 const Entry &entry = m_entries[idx]; 458 const size_t count = m_entries.size(); 466 const Entry &entry = m_entries[idx]; 544 if (line_table_up->m_entries.empty())