Lines Matching defs:line
41 uint32_t line,
51 Entry entry(file_addr, line, column, file_idx, is_start_of_statement, is_start_of_basic_block, is_prologue_end, is_epilogue_begin, is_terminal_entry);
86 uint32_t line,
98 Entry entry(file_addr, line, column, file_idx, is_start_of_statement, is_start_of_basic_block, is_prologue_end, is_epilogue_begin, is_terminal_entry);
151 LT_COMPARE (a.line, b.line);
228 // line entry that matches the address in case there are
245 // entry for a previous line...
275 line_entry.line = entry.line;
293 uint32_t line,
306 // Skip line table rows that terminate the previous row (is_terminal_entry is non-zero)
313 // Exact match always wins. Otherwise try to find the closest line > the desired
314 // line.
315 // FIXME: Maybe want to find the line closest before and the line closest after and
318 if (m_entries[idx].line < line)
322 else if (m_entries[idx].line == line)
332 else if (m_entries[idx].line < m_entries[best_match].line)
347 LineTable::FindLineEntryIndexByFileIndex (uint32_t start_idx, uint32_t file_idx, uint32_t line, bool exact, LineEntry* line_entry_ptr)
354 // Skip line table rows that terminate the previous row (is_terminal_entry is non-zero)
361 // Exact match always wins. Otherwise try to find the closest line > the desired
362 // line.
363 // FIXME: Maybe want to find the line closest before and the line closest after and
366 if (m_entries[idx].line < line)
370 else if (m_entries[idx].line == line)
380 else if (m_entries[idx].line < m_entries[best_match].line)
411 // Skip line table rows that terminate the previous row (is_terminal_entry is non-zero)
534 // be terminated now that one line entry in a sequence is not longer valid.
567 // insert this sequence into our new line table.