diff options
| author | Tom Tromey <tromey@adacore.com> | 2023-04-21 09:36:54 -0600 |
|---|---|---|
| committer | Tom Tromey <tromey@adacore.com> | 2023-06-05 09:59:18 -0600 |
| commit | 0434c3ef8dc4cfa17e6bce21da206e312f5722fb (patch) | |
| tree | 26d7ef80161a08f1797f880f329a67e6685ea23b /gdb/disasm.c | |
| parent | d8175bcb7e35fb98ef40c458c8475a6d7122d813 (diff) | |
| download | binutils-0434c3ef8dc4cfa17e6bce21da206e312f5722fb.zip binutils-0434c3ef8dc4cfa17e6bce21da206e312f5722fb.tar.gz binutils-0434c3ef8dc4cfa17e6bce21da206e312f5722fb.tar.bz2 | |
Use "unrelocated" terminology in linetable_entry
I forgot to convert struct linetable_entry to use the "unrelocated"
(as opposed to "raw") terminology. This patch corrects the oversight.
Diffstat (limited to 'gdb/disasm.c')
| -rw-r--r-- | gdb/disasm.c | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/gdb/disasm.c b/gdb/disasm.c index e6b31bf..aa5c6da 100644 --- a/gdb/disasm.c +++ b/gdb/disasm.c @@ -606,11 +606,11 @@ do_mixed_source_and_assembly_deprecated /* First, skip all the preceding functions. */ - for (i = 0; i < nlines - 1 && le[i].raw_pc () < unrel_low; i++); + for (i = 0; i < nlines - 1 && le[i].unrelocated_pc () < unrel_low; i++); /* Now, copy all entries before the end of this function. */ - for (; i < nlines - 1 && le[i].raw_pc () < unrel_high; i++) + for (; i < nlines - 1 && le[i].unrelocated_pc () < unrel_high; i++) { if (le[i] == le[i + 1]) continue; /* Ignore duplicates. */ @@ -630,7 +630,7 @@ do_mixed_source_and_assembly_deprecated /* If we're on the last line, and it's part of the function, then we need to get the end pc in a special way. */ - if (i == nlines - 1 && le[i].raw_pc () < unrel_high) + if (i == nlines - 1 && le[i].unrelocated_pc () < unrel_high) { mle[newlines].line = le[i].line; mle[newlines].start_pc = le[i].pc (objfile); @@ -761,10 +761,10 @@ do_mixed_source_and_assembly (struct gdbarch *gdbarch, first_le = NULL; /* Skip all the preceding functions. */ - for (i = 0; i < nlines && le[i].raw_pc () < unrel_low; i++) + for (i = 0; i < nlines && le[i].unrelocated_pc () < unrel_low; i++) continue; - if (i < nlines && le[i].raw_pc () < unrel_high) + if (i < nlines && le[i].unrelocated_pc () < unrel_high) first_le = &le[i]; /* Add lines for every pc value. */ |