Lines Matching refs:line
35 /* This Structure is used to store line number information.
36 We need a different sort of line table from the normal one cuz we can't
37 depend upon implicit line-end pc's for lines to do the
42 int line;
79 val = mle1->line - mle2->line;
98 int line;
118 &line, &unmapped))
120 /* We don't care now about line, filename and
185 if (le[i].line == le[i + 1].line && le[i].pc == le[i + 1].pc)
189 if (le[i].line == 0)
192 mle[newlines].line = le[i].line;
193 if (le[i].line > le[i + 1].line)
200 /* If we're on the last line, and it's part of the function,
205 mle[newlines].line = le[i].line;
212 /* Now, sort mle by line #s (and, then by addresses within
218 /* Now, for each line entry, emit the specified lines (unless
220 for that line. */
226 /* Print out everything from next_line to the current line. */
227 if (mle[i].line >= next_line)
231 /* Just one line to print. */
232 if (next_line == mle[i].line)
237 print_source_lines (symtab, next_line, mle[i].line + 1, 0);
242 for (; next_line < mle[i].line; next_line++)
258 /* Print the last line and leave list open for
263 print_source_lines (symtab, next_line, mle[i].line + 1, 0);
270 print_source_lines (symtab, mle[i].line, mle[i].line + 1, 0);
273 next_line = mle[i].line + 1;
282 assembly range for this source line, close out the list/tuple. */
283 if (i == (newlines - 1) || mle[i + 1].line > mle[i].line)