Lines Matching refs:m_entries
26 m_entries() in LineTable()
53 entry_collection::iterator begin_pos = m_entries.begin(); in InsertLineEntry()
54 entry_collection::iterator end_pos = m_entries.end(); in InsertLineEntry()
61 m_entries.insert(pos, entry); in InsertLineEntry()
73 m_entries.clear(); in Clear()
99 seq->m_entries.push_back (entry); in AppendLineEntryToSequence()
107 if (seq->m_entries.empty()) in InsertSequence()
109 Entry& entry = seq->m_entries.front(); in InsertSequence()
113 if (m_entries.empty() || !Entry::EntryAddressLessThan(entry, m_entries.back())) in InsertSequence()
115 m_entries.insert(m_entries.end(), in InsertSequence()
116 seq->m_entries.begin(), in InsertSequence()
117 seq->m_entries.end()); in InsertSequence()
122 entry_collection::iterator begin_pos = m_entries.begin(); in InsertSequence()
123 entry_collection::iterator end_pos = m_entries.end(); in InsertSequence()
135 m_entries.insert(pos, seq->m_entries.begin(), seq->m_entries.end()); in InsertSequence()
168 return m_entries.size(); in GetSize()
174 if (idx < m_entries.size()) in GetLineEntryAtIndex()
197 entry_collection::const_iterator begin_pos = m_entries.begin(); in FindLineEntryByAddress()
198 entry_collection::const_iterator end_pos = m_entries.end(); in FindLineEntryByAddress()
263 if (idx < m_entries.size()) in ConvertEntryAtIndexToLineEntry()
265 const Entry& entry = m_entries[idx]; in ConvertEntryAtIndexToLineEntry()
269 if (!entry.is_terminal_entry && idx + 1 < m_entries.size()) in ConvertEntryAtIndexToLineEntry()
270 line_entry.range.SetByteSize(m_entries[idx+1].file_addr - entry.file_addr); in ConvertEntryAtIndexToLineEntry()
299 const size_t count = m_entries.size(); in FindLineEntryIndexByFileIndex()
307 if (m_entries[idx].is_terminal_entry) in FindLineEntryIndexByFileIndex()
310 if (find (begin_pos, end_pos, m_entries[idx].file_idx) == end_pos) in FindLineEntryIndexByFileIndex()
318 if (m_entries[idx].line < line) in FindLineEntryIndexByFileIndex()
322 else if (m_entries[idx].line == line) in FindLineEntryIndexByFileIndex()
332 else if (m_entries[idx].line < m_entries[best_match].line) in FindLineEntryIndexByFileIndex()
349 const size_t count = m_entries.size(); in FindLineEntryIndexByFileIndex()
355 if (m_entries[idx].is_terminal_entry) in FindLineEntryIndexByFileIndex()
358 if (m_entries[idx].file_idx != file_idx) in FindLineEntryIndexByFileIndex()
366 if (m_entries[idx].line < line) in FindLineEntryIndexByFileIndex()
370 else if (m_entries[idx].line == line) in FindLineEntryIndexByFileIndex()
380 else if (m_entries[idx].line < m_entries[best_match].line) in FindLineEntryIndexByFileIndex()
404 const size_t count = m_entries.size(); in FineLineEntriesForFileIndex()
412 if (m_entries[idx].is_terminal_entry) in FineLineEntriesForFileIndex()
415 if (m_entries[idx].file_idx == file_idx) in FineLineEntriesForFileIndex()
432 const size_t count = m_entries.size(); in Dump()
448 const size_t count = m_entries.size(); in GetDescription()
465 const size_t count = m_entries.size(); in GetContiguousFileAddressRanges()
470 const Entry& entry = m_entries[idx]; in GetContiguousFileAddressRanges()
494 const size_t count = m_entries.size(); in LinkLineTable()
503 const Entry& entry = m_entries[idx]; in LinkLineTable()
536 !sequence.m_entries.empty() && in LinkLineTable()
537 !sequence.m_entries.back().is_terminal_entry) in LinkLineTable()
543 if (terminate_previous_entry && !sequence.m_entries.empty()) in LinkLineTable()
546 sequence.m_entries.push_back(sequence.m_entries.back()); in LinkLineTable()
549 sequence.m_entries.back().file_addr = prev_end_entry_linked_file_addr; in LinkLineTable()
550 sequence.m_entries.back().is_terminal_entry = true; in LinkLineTable()
562 sequence.m_entries.push_back(entry); in LinkLineTable()
563 sequence.m_entries.back().file_addr = entry_linked_file_addr; in LinkLineTable()
568 if (!sequence.m_entries.empty() && sequence.m_entries.back().is_terminal_entry) in LinkLineTable()
581 if (line_table_ap->m_entries.empty()) in LinkLineTable()