22     : m_comp_unit(comp_unit), m_entries() {}  in LineTable()
26     : m_comp_unit(comp_unit), m_entries() {  in LineTable()
31     m_entries.insert(m_entries.end(), seq->m_entries.begin(),  in LineTable()
32                      seq->m_entries.end());  in LineTable()
51       llvm::upper_bound(m_entries, entry, less_than_bp);  in InsertLineEntry()
56   m_entries.insert(pos, entry);  in InsertLineEntry()
63 void LineTable::LineSequenceImpl::Clear() { m_entries.clear(); }  in Clear()
79   entry_collection &entries = seq->m_entries;  in AppendLineEntryToSequence()
108   if (seq->m_entries.empty())  in InsertSequence()
110   Entry &entry = seq->m_entries.front();  in InsertSequence()
114   if (m_entries.empty() ||  in InsertSequence()
115       !Entry::EntryAddressLessThan(entry, m_entries.back())) {  in InsertSequence()
116     m_entries.insert(m_entries.end(), 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()
142   m_entries.insert(pos, seq->m_entries.begin(), seq->m_entries.end());  in InsertSequence()
174   return (*this)(seq_a->m_entries.front(), seq_b->m_entries.front());  in operator ()()
177 uint32_t LineTable::GetSize() const { return m_entries.size(); }  in GetSize()
180   if (idx < m_entries.size()) {  in GetLineEntryAtIndex()
200       entry_collection::const_iterator begin_pos = m_entries.begin();  in FindLineEntryByAddress()
201       entry_collection::const_iterator end_pos = m_entries.end();  in FindLineEntryByAddress()
262   if (idx >= m_entries.size())  in ConvertEntryAtIndexToLineEntry()
265   const Entry &entry = m_entries[idx];  in ConvertEntryAtIndexToLineEntry()
285   if (!entry.is_terminal_entry && idx + 1 < m_entries.size())  in ConvertEntryAtIndexToLineEntry()
286     line_entry.range.SetByteSize(m_entries[idx + 1].file_addr -  in ConvertEntryAtIndexToLineEntry()
309   const size_t count = m_entries.size();  in FindLineEntryIndexByFileIndex()
315     if (m_entries[idx].is_terminal_entry)  in FindLineEntryIndexByFileIndex()
318     if (!llvm::is_contained(file_indexes, m_entries[idx].file_idx))  in FindLineEntryIndexByFileIndex()
327     if (m_entries[idx].line < line) {  in FindLineEntryIndexByFileIndex()
329     } else if (m_entries[idx].line == line) {  in FindLineEntryIndexByFileIndex()
336       else if (m_entries[idx].line < m_entries[best_match].line)  in FindLineEntryIndexByFileIndex()
353   const size_t count = m_entries.size();  in FindLineEntryIndexByFileIndex()
359     if (m_entries[idx].is_terminal_entry)  in FindLineEntryIndexByFileIndex()
362     if (m_entries[idx].file_idx != file_idx)  in FindLineEntryIndexByFileIndex()
371     if (m_entries[idx].line < line) {  in FindLineEntryIndexByFileIndex()
373     } else if (m_entries[idx].line == line) {  in FindLineEntryIndexByFileIndex()
380       else if (m_entries[idx].line < m_entries[best_match].line)  in FindLineEntryIndexByFileIndex()
400   const size_t count = m_entries.size();  in FineLineEntriesForFileIndex()
407       if (m_entries[idx].is_terminal_entry)  in FineLineEntriesForFileIndex()
410       if (m_entries[idx].file_idx == file_idx) {  in FineLineEntriesForFileIndex()
423   const size_t count = m_entries.size();  in Dump()
437   const size_t count = m_entries.size();  in GetDescription()
452   const size_t count = m_entries.size();  in GetContiguousFileAddressRanges()
456     const Entry &entry = m_entries[idx];  in GetContiguousFileAddressRanges()
474   const size_t count = m_entries.size();  in LinkLineTable()
482     const Entry &entry = m_entries[idx];  in LinkLineTable()
516       if (!sequence.m_entries.empty() &&  in LinkLineTable()
517           !sequence.m_entries.back().is_terminal_entry) {  in LinkLineTable()
522     if (terminate_previous_entry && !sequence.m_entries.empty()) {  in LinkLineTable()
525       sequence.m_entries.push_back(sequence.m_entries.back());  in LinkLineTable()
531       sequence.m_entries.back().file_addr = prev_end_entry_linked_file_addr;  in LinkLineTable()
532       sequence.m_entries.back().is_terminal_entry = true;  in LinkLineTable()
543       sequence.m_entries.push_back(entry);  in LinkLineTable()
544       sequence.m_entries.back().file_addr = entry_linked_file_addr;  in LinkLineTable()
549     if (!sequence.m_entries.empty() &&  in LinkLineTable()
550         sequence.m_entries.back().is_terminal_entry) {  in LinkLineTable()
560   if (line_table_up->m_entries.empty())  in LinkLineTable()