espressif/binutils-gdb
1
0
Fork 0
mirror of https://github.com/espressif/binutils-gdb.git synced 2025-06-26 13:56:22 +08:00
Code Issues Packages Projects Releases Wiki Activity

clean up mechanics of mosberger-tang's changes

Browse Source
This commit is contained in:
Ken Raeburn
1995-02-07 20:06:28 +00:00
parent 95b0f14bce
commit 2559e01429
2 changed files with 147 additions and 162 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
bfd/ChangeLog
View File

@ -1,3 +1,10 @@
Tue Feb 7 14:43:33 1995 Ken Raeburn (raeburn@kr-pc.cygnus.com)
* ecoff.c: Reformatted some comments and brace constructs in
recent changes to GNU style.
(cmp_fdrtab_entry, mk_fdrtab, lookup): Use old-style function
definitions.
Tue Feb 7 14:21:28 1995 Ian Lance Taylor <ian@cygnus.com> Tue Feb 7 14:21:28 1995 Ian Lance Taylor <ian@cygnus.com>
* ecoffswap.h (ecoff_swap_pdr_in): Zero out intern before setting * ecoffswap.h (ecoff_swap_pdr_in): Zero out intern before setting

230
bfd/ecoff.c
View File

@ -2004,7 +2004,8 @@ _bfd_ecoff_canonicalize_reloc (abfd, section, relptr, symbols)
static int static int
cmp_fdrtab_entry (const void *leftp, const void *rightp) cmp_fdrtab_entry (leftp, rightp)
const void *leftp, *rightp;
{ {
const struct ecoff_fdrtab_entry *lp = leftp; const struct ecoff_fdrtab_entry *lp = leftp;
const struct ecoff_fdrtab_entry *rp = rightp; const struct ecoff_fdrtab_entry *rp = rightp;
@ -2016,15 +2017,14 @@ cmp_fdrtab_entry (const void *leftp, const void *rightp)
return 0; return 0;
} }
/* /* Each file descriptor (FDR) has a memory address, to simplify
* Each file descriptor (FDR) has a memory address, to simplify looking up an FDR by address, we build a table covering all FDRs
* looking up an FDR by address, we build a table covering all FDRs that have a least one procedure descriptor in them. The final
* that have a least one procedure descriptor in them. The final table will be sorted by address so we can look it up via binary
* table will be sorted by address so we can look it up via binary search. */
* search.
*/
static boolean static boolean
mk_fdrtab (bfd *abfd) mk_fdrtab (abfd)
bfd *abfd;
{ {
struct ecoff_debug_info * const debug_info = &ecoff_data (abfd)->debug_info; struct ecoff_debug_info * const debug_info = &ecoff_data (abfd)->debug_info;
const struct ecoff_debug_swap * const debug_swap const struct ecoff_debug_swap * const debug_swap
@ -2069,11 +2069,9 @@ mk_fdrtab (bfd *abfd)
if (fdr_ptr->cpd == 0) if (fdr_ptr->cpd == 0)
continue; continue;
/* /* Check whether this file has stabs debugging information. In
* Check whether this file has stabs debugging information. In a file with stabs debugging information, the second local
* a file with stabs debugging information, the second local symbol is named @stabs. */
* symbol is named @stabs.
*/
stabs = false; stabs = false;
if (fdr_ptr->csym >= 2) if (fdr_ptr->csym >= 2)
{ {
@ -2099,40 +2097,34 @@ mk_fdrtab (bfd *abfd)
pdr_ptr = ((char *) debug_info->external_pdr pdr_ptr = ((char *) debug_info->external_pdr
+ fdr_ptr->ipdFirst * external_pdr_size); + fdr_ptr->ipdFirst * external_pdr_size);
(*debug_swap->swap_pdr_in) (abfd, (PTR) pdr_ptr, &pdr); (*debug_swap->swap_pdr_in) (abfd, (PTR) pdr_ptr, &pdr);
/* /* The address of the first PDR is the offset of that
* The address of the first PDR is the offset of that procedure relative to the beginning of file FDR. */
* procedure relative to the beginning of file FDR.
*/
tab->base_addr = fdr_ptr->adr - pdr.adr; tab->base_addr = fdr_ptr->adr - pdr.adr;
} }
else else
{ {
/* /* XXX I don't know about stabs, so this is a guess
* XXX I don't know about stabs, so this is a guess (davidm@cs.arizona.edu): */
* (davidm@cs.arizona.edu):
*/
tab->base_addr = fdr_ptr->adr; tab->base_addr = fdr_ptr->adr;
} }
tab->fdr = fdr_ptr; tab->fdr = fdr_ptr;
++tab; ++tab;
} }
/* /* Finally, the table is sorted in increasing memory-address order.
* Finally, the table is sorted in increasing memory-address order. The table is mostly sorted already, but there are cases (e.g.,
* The table is mostly sorted already, but there are cases (e.g., static functions in include files), where this does not hold.
* static functions in include files), where this does not hold Use "odump -PFv" to verify... */
* Use "odump -PFv" to verify...
*/
qsort((char*) ecoff_data (abfd)->fdrtab, len, qsort((char*) ecoff_data (abfd)->fdrtab, len,
sizeof(struct ecoff_fdrtab_entry), cmp_fdrtab_entry); sizeof(struct ecoff_fdrtab_entry), cmp_fdrtab_entry);
return true; return true;
} }
/* /* Return index of first FDR that covers to OFFSET. */
* Return index of first FDR that covers to OFFSET.
*/
static long static long
lookup (bfd *abfd, bfd_vma offset) lookup (abfd, offset)
bfd *abfd;
bfd_vma offset;
{ {
long low, high, len; long low, high, len;
long mid = -1; long mid = -1;
@ -2193,21 +2185,16 @@ _bfd_ecoff_find_nearest_line (abfd, section, ignore_symbols, offset,
int i; int i;
offset += section->vma; offset += section->vma;
/* /* If we're not in the .text section, we don't have any line
* If we're not in the .text section, we don't have any line numbers. */
* numbers.
*/
if (strcmp (section->name, _TEXT) != 0 if (strcmp (section->name, _TEXT) != 0
|| offset < ecoff_data (abfd)->text_start || offset < ecoff_data (abfd)->text_start
|| offset >= ecoff_data (abfd)->text_end) || offset >= ecoff_data (abfd)->text_end)
return false; return false;
/* /* Build FDR table (sorted by object file's base-address) if we
* Build FDR table (sorted by object file's base-address) if don't have it already. */
* we don't have it already: if (!ecoff_data (abfd)->fdrtab && !mk_fdrtab (abfd))
*/
if (!ecoff_data (abfd)->fdrtab && !mk_fdrtab (abfd)) {
return false; return false;
}
tab = ecoff_data (abfd)->fdrtab; tab = ecoff_data (abfd)->fdrtab;
i = lookup(abfd, offset); /* find first FDR for address OFFSET */ i = lookup(abfd, offset); /* find first FDR for address OFFSET */
@ -2215,11 +2202,9 @@ _bfd_ecoff_find_nearest_line (abfd, section, ignore_symbols, offset,
return false; /* no FDR, no fun... */ return false; /* no FDR, no fun... */
fdr_ptr = tab[i].fdr; fdr_ptr = tab[i].fdr;
/* /* Check whether this file has stabs debugging information. In a
* Check whether this file has stabs debugging information. In a file with stabs debugging information, the second local symbol is
* file with stabs debugging information, the second local symbol is named @stabs. */
* named @stabs.
*/
stabs = false; stabs = false;
if (fdr_ptr->csym >= 2) if (fdr_ptr->csym >= 2)
{ {
@ -2245,72 +2230,70 @@ _bfd_ecoff_find_nearest_line (abfd, section, ignore_symbols, offset,
unsigned char *line_ptr; unsigned char *line_ptr;
unsigned char *line_end; unsigned char *line_end;
int lineno; int lineno;
/* /* This file uses ECOFF debugging information. Each FDR has a
* This file uses ECOFF debugging information. Each FDR has a list of procedure descriptors (PDR). The address in the FDR
* list of procedure descriptors (PDR). The address in the FDR is the absolute address of the first procedure. The address
* is the absolute address of the first procedure. The address in the first PDR gives the offset of that procedure relative
* in the first PDR gives the offset of that procedure relative to the object file's base-address. The addresses in
* to the object file's base-address. The addresses in subsequent PDRs specify each procedure's address relative to
* subsequent PDRs specify each procedure's address relative to the object file's base-address. To make things more juicy,
* the object file's base-address. To make things more juicy, whenever the PROF bit in the PDR is set, the real entry point
* whenever the PROF bit in the PDR is set, the real entry point of the procedure may be 16 bytes below what would normally be
* of the procedure may be 16 bytes below what would normally be the procedure's entry point. Instead, DEC came up with a
* the procedure's entry point. Instead, DEC came up with a wicked scheme to create profiled libraries "on the fly":
* wicked scheme to create profiled libraries "on the fly": instead of shipping a regular and a profiled version of each
* instead of shipping a regular and a profiled version of each library, they insert 16 bytes of unused space in front of
* library, they insert 16 bytes of unused space in front of each procedure and set the "prof" bit in the PDR to indicate
* each procedure and set the "prof" bit in the PDR to indicate that there is a gap there (this is done automagically by "as"
* that there is a gap there (this is done automagically by "as" when option "-pg" is specified). Thus, normally, you link
* when option "-pg" is specified). Thus, normally, you link against such a library and, except for lots of 16 byte gaps
* against such a library and, except for lots of 16 byte gaps between functions, things will behave as usual. However,
* between functions, things will behave as usual. However, when invoking "ld" with option "-pg", it will fill those gaps
* when invoking "ld" with option "-pg", it will fill those gaps with code that calls mcount(). It then moves the function's
* with code that calls mcount(). It then moves the function's entry point down by 16 bytes, and out pops a binary that has
* entry point down by 16 bytes, and out pops a binary that has all functions profiled.
* all functions profiled.
* NOTE: Neither FDRs nor PDRs are strictly sorted in memory
* NOTE: Neither FDRs nor PDRs are strictly sorted in memory order. order. For example, when including header-files that
* For example, when including header-files that define define functions, the FDRs follow behind the including
* functions, the FDRs follow behind the including file, file, even though their code may have been generated at
* even though their code may have been generated at a lower a lower address. File coff-alpha.c from libbfd
* address. File coff-alpha.c from libbfd illustrates this illustrates this (use "odump -PFv" to look at a file's
* (use "odump -PFv" to look at a file's FDR/PDR). Similarly, FDR/PDR). Similarly, PDRs are sometimes out of order
* PDRs are sometimes out of order as well. An example of this as well. An example of this is OSF/1 v3.0 libc's
* is OSF/1 v3.0 libc's malloc.c. I'm not sure why this happens, malloc.c. I'm not sure why this happens, but it could
* but it could be due to optimizations that reorder a function's be due to optimizations that reorder a function's
* position within an object-file. position within an object-file.
*
* Strategy: Strategy:
*
* On the first call to this function, we build a table of FDRs On the first call to this function, we build a table of FDRs
* that is sorted by the base-address of the object-file the FDR that is sorted by the base-address of the object-file the FDR
* is referring to. Notice that each object-file may contain is referring to. Notice that each object-file may contain
* code from multiple source files (e.g., due to code defined in code from multiple source files (e.g., due to code defined in
* include files). Thus, for any given base-address, there may include files). Thus, for any given base-address, there may
* be multiple FDRs (but this case is, fortunately, uncommon). be multiple FDRs (but this case is, fortunately, uncommon).
* lookup(addr) guarantees to return the first FDR that applies lookup(addr) guarantees to return the first FDR that applies
* to address ADDR. Thus, after invoking lookup(), we have a to address ADDR. Thus, after invoking lookup(), we have a
* list of FDRs that may contain the PDR for ADDR. Next, we walk list of FDRs that may contain the PDR for ADDR. Next, we
* through the PDRs of these FDRs and locate the one that is walk through the PDRs of these FDRs and locate the one that
* closest to ADDR (i.e., for which the difference between ADDR is closest to ADDR (i.e., for which the difference between
* and the PDR's entry point is positive and minimal). Once, ADDR and the PDR's entry point is positive and minimal).
* the right FDR and PDR are located, we simply walk through the Once, the right FDR and PDR are located, we simply walk
* line-number table to lookup the line-number that best matches through the line-number table to lookup the line-number that
* ADDR. Obviously, things could be sped up by keeping a sorted best matches ADDR. Obviously, things could be sped up by
* list of PDRs instead of a sorted list of FDRs. However, this keeping a sorted list of PDRs instead of a sorted list of
* would increase space requirements considerably, which is FDRs. However, this would increase space requirements
* undesirable. considerably, which is undesirable. */
*/
external_pdr_size = debug_swap->external_pdr_size; external_pdr_size = debug_swap->external_pdr_size;
/* Make offset relative to object file's start-address: */ /* Make offset relative to object file's start-address: */
offset -= tab[i].base_addr; offset -= tab[i].base_addr;
/* /* Search FDR list starting at tab[i] for the PDR that best matches
* Search FDR list starting at tab[i] for the PDR that best matches OFFSET. Normally, the FDR list is only one entry long. */
* OFFSET. Normally, the FDR list is only one entry long.
*/
best_fdr = NULL; best_fdr = NULL;
do { do
{
bfd_vma dist, min_dist = 0; bfd_vma dist, min_dist = 0;
char *pdr_hold; char *pdr_hold;
char *pdr_end; char *pdr_end;
@ -2321,13 +2304,11 @@ _bfd_ecoff_find_nearest_line (abfd, section, ignore_symbols, offset,
+ fdr_ptr->ipdFirst * external_pdr_size); + fdr_ptr->ipdFirst * external_pdr_size);
pdr_end = pdr_ptr + fdr_ptr->cpd * external_pdr_size; pdr_end = pdr_ptr + fdr_ptr->cpd * external_pdr_size;
(*debug_swap->swap_pdr_in) (abfd, (PTR) pdr_ptr, &pdr); (*debug_swap->swap_pdr_in) (abfd, (PTR) pdr_ptr, &pdr);
/* /* Find PDR that is closest to OFFSET. If pdr.prof is set,
* Find PDR that is closest to OFFSET. If pdr.prof is set, the procedure entry-point *may* be 0x10 below pdr.adr. We
* the procedure entry-point *may* be 0x10 below pdr.adr. simply pretend that pdr.prof *implies* a lower entry-point.
* We simply pretend that pdr.prof *implies* a lower entry-point. This is safe because it just means that may identify 4 NOPs
* This is safe because it just means that may identify in front of the function as belonging to the function. */
* 4 NOPs in front of the function as belonging to the function.
*/
for (pdr_hold = NULL; for (pdr_hold = NULL;
pdr_ptr < pdr_end; pdr_ptr < pdr_end;
(pdr_ptr += external_pdr_size, (pdr_ptr += external_pdr_size,
@ -2351,7 +2332,8 @@ _bfd_ecoff_find_nearest_line (abfd, section, ignore_symbols, offset,
best_pdr = pdr_hold; best_pdr = pdr_hold;
} }
/* continue looping until base_addr of next entry is different: */ /* continue looping until base_addr of next entry is different: */
} while (++i < ecoff_data (abfd)->fdrtab_len }
while (++i < ecoff_data (abfd)->fdrtab_len
&& tab[i].base_addr == tab[i - 1].base_addr); && tab[i].base_addr == tab[i - 1].base_addr);
if (!best_fdr || !best_pdr) if (!best_fdr || !best_pdr)
@ -2361,12 +2343,10 @@ _bfd_ecoff_find_nearest_line (abfd, section, ignore_symbols, offset,
fdr_ptr = best_fdr; fdr_ptr = best_fdr;
pdr_ptr = best_pdr; pdr_ptr = best_pdr;
(*debug_swap->swap_pdr_in) (abfd, (PTR) pdr_ptr, &pdr); (*debug_swap->swap_pdr_in) (abfd, (PTR) pdr_ptr, &pdr);
/* /* Now we can look for the actual line number. The line numbers
* Now we can look for the actual line number. The line numbers are stored in a very funky format, which I won't try to
* are stored in a very funky format, which I won't try to describe. The search is bounded by the end of the FDRs line
* describe. The search is bounded by the end of the FDRs line number entries. */
* number entries.
*/
line_end = debug_info->line + fdr_ptr->cbLineOffset + fdr_ptr->cbLine; line_end = debug_info->line + fdr_ptr->cbLineOffset + fdr_ptr->cbLine;
/* Make offset relative to procedure entry: */ /* Make offset relative to procedure entry: */
@ -2396,10 +2376,8 @@ _bfd_ecoff_find_nearest_line (abfd, section, ignore_symbols, offset,
offset -= count * 4; offset -= count * 4;
} }
/* /* If fdr_ptr->rss is -1, then this file does not have full
* If fdr_ptr->rss is -1, then this file does not have full symbols, at least according to gdb/mipsread.c. */
* symbols, at least according to gdb/mipsread.c.
*/
if (fdr_ptr->rss == -1) if (fdr_ptr->rss == -1)
{ {
*filename_ptr = NULL; *filename_ptr = NULL;