binutils-gdb/binutils/objdump.c

1384 lines
32 KiB
C
Raw Normal View History

/* objdump.c -- dump information about an object file.
1994-01-23 08:31:14 +08:00
Copyright 1990, 1991, 1992, 1993, 1994 Free Software Foundation, Inc.
1991-03-22 05:29:06 +08:00
This file is part of GNU Binutils.
1991-03-22 05:29:06 +08:00
This program is free software; you can redistribute it and/or modify
1991-03-22 05:29:06 +08:00
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
1991-03-22 05:29:06 +08:00
any later version.
This program is distributed in the hope that it will be useful,
1991-03-22 05:29:06 +08:00
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
1991-03-22 05:29:06 +08:00
#include "bfd.h"
#include "sysdep.h"
1991-03-22 05:29:06 +08:00
#include "getopt.h"
#include "bucomm.h"
1991-03-22 05:29:06 +08:00
#include <stdio.h>
#include <ctype.h>
#include "dis-asm.h"
1991-03-22 05:29:06 +08:00
/* Internal headers for the ELF .stab-dump code - sorry. */
#define BYTES_IN_WORD 32
#include "aout/aout64.h"
#include "elf/internal.h"
extern Elf_Internal_Shdr *bfd_elf_find_section();
1991-04-19 06:14:53 +09:00
#ifndef FPRINTF_ALREADY_DECLARED
1993-04-27 09:39:38 +08:00
extern int fprintf PARAMS ((FILE *, CONST char *, ...));
#endif
1991-03-22 05:29:06 +08:00
char *default_target = NULL; /* default at runtime */
extern char *program_version;
1991-03-22 05:29:06 +08:00
int show_version = 0; /* show the version number */
1991-03-22 05:29:06 +08:00
int dump_section_contents; /* -s */
int dump_section_headers; /* -h */
boolean dump_file_header; /* -f */
int dump_symtab; /* -t */
int dump_reloc_info; /* -r */
int dump_ar_hdrs; /* -a */
int with_line_numbers; /* -l */
1993-09-23 13:21:21 +08:00
int dump_stab_section_info; /* --stabs */
boolean disassemble; /* -d */
boolean formats_info; /* -i */
char *only; /* -j secname */
/* Extra info to pass to the disassembler address printing function. */
struct objdump_disasm_info {
bfd *abfd;
asection *sec;
};
1991-03-22 05:29:06 +08:00
/* Architecture to disassemble for, or default if NULL. */
char *machine = (char *) NULL;
/* The symbol table. */
asymbol **syms;
1991-03-22 05:29:06 +08:00
/* Number of bytes allocated for `syms'. */
1991-03-22 05:29:06 +08:00
unsigned int storage;
/* Number of symbols in `syms'. */
1991-03-22 05:29:06 +08:00
unsigned int symcount = 0;
/* Forward declarations. */
static void
display_file PARAMS ((char *filename, char *target));
static void
dump_data PARAMS ((bfd *abfd));
static void
dump_relocs PARAMS ((bfd *abfd));
static void
dump_symbols PARAMS ((bfd *abfd));
static void
display_bfd PARAMS ((bfd *abfd));
1991-03-22 05:29:06 +08:00
void
usage (stream, status)
FILE *stream;
int status;
1991-03-22 05:29:06 +08:00
{
fprintf (stream, "\
Usage: %s [-ahifdrtxsl] [-b bfdname] [-m machine] [-j section-name]\n\
[--archive-headers] [--target=bfdname] [--disassemble] [--file-headers]\n\
[--section-headers] [--headers] [--info] [--section=section-name]\n\
[--line-numbers] [--architecture=machine] [--reloc] [--full-contents]\n\
[--stabs] [--syms] [--all-headers] [--version] [--help] objfile...\n\
at least one option besides -l (--line-numbers) must be given\n",
program_name);
exit (status);
1991-03-22 05:29:06 +08:00
}
static struct option long_options[]=
{
{"all-headers", no_argument, NULL, 'x'},
{"architecture", required_argument, NULL, 'm'},
{"archive-headers", no_argument, NULL, 'a'},
{"disassemble", no_argument, NULL, 'd'},
{"file-headers", no_argument, NULL, 'f'},
{"full-contents", no_argument, NULL, 's'},
{"headers", no_argument, NULL, 'h'},
{"help", no_argument, NULL, 'H'},
{"info", no_argument, NULL, 'i'},
{"line-numbers", no_argument, NULL, 'l'},
{"reloc", no_argument, NULL, 'r'},
{"section", required_argument, NULL, 'j'},
{"section-headers", no_argument, NULL, 'h'},
{"stabs", no_argument, &dump_stab_section_info, 1},
{"syms", no_argument, NULL, 't'},
{"target", required_argument, NULL, 'b'},
{"version", no_argument, &show_version, 1},
{0, no_argument, 0, 0}
};
1991-03-22 05:29:06 +08:00
static void
dump_section_header (abfd, section, ignored)
bfd *abfd;
asection *section;
PTR ignored;
1991-03-22 05:29:06 +08:00
{
char *comma = "";
1991-03-22 05:29:06 +08:00
#define PF(x,y) \
if (section->flags & x) { printf("%s%s",comma,y); comma = ", "; }
printf ("SECTION %d [%s]\t: size %08x",
section->index,
section->name,
(unsigned) bfd_get_section_size_before_reloc (section));
printf (" vma ");
printf_vma (section->vma);
printf (" align 2**%u\n ",
section->alignment_power);
PF (SEC_ALLOC, "ALLOC");
PF (SEC_CONSTRUCTOR, "CONSTRUCTOR");
PF (SEC_CONSTRUCTOR_TEXT, "CONSTRUCTOR TEXT");
PF (SEC_CONSTRUCTOR_DATA, "CONSTRUCTOR DATA");
PF (SEC_CONSTRUCTOR_BSS, "CONSTRUCTOR BSS");
PF (SEC_LOAD, "LOAD");
PF (SEC_RELOC, "RELOC");
#ifdef SEC_BALIGN
PF (SEC_BALIGN, "BALIGN");
#endif
PF (SEC_READONLY, "READONLY");
PF (SEC_CODE, "CODE");
PF (SEC_DATA, "DATA");
PF (SEC_ROM, "ROM");
PF (SEC_DEBUGGING, "DEBUGGING");
printf ("\n");
1991-03-22 05:29:06 +08:00
#undef PF
}
static void
dump_headers (abfd)
bfd *abfd;
{
bfd_map_over_sections (abfd, dump_section_header, (PTR) NULL);
}
1991-03-22 05:29:06 +08:00
static asymbol **
slurp_symtab (abfd)
bfd *abfd;
1991-03-22 05:29:06 +08:00
{
asymbol **sy = (asymbol **) NULL;
1991-03-22 05:29:06 +08:00
if (!(bfd_get_file_flags (abfd) & HAS_SYMS))
{
printf ("No symbols in \"%s\".\n", bfd_get_filename (abfd));
return NULL;
}
storage = get_symtab_upper_bound (abfd);
if (storage)
{
sy = (asymbol **) xmalloc (storage);
}
symcount = bfd_canonicalize_symtab (abfd, sy);
if (symcount <= 0)
{
fprintf (stderr, "%s: %s: Invalid symbol table\n",
program_name, bfd_get_filename (abfd));
exit (1);
}
return sy;
1991-03-22 05:29:06 +08:00
}
/* Filter out (in place) symbols that are useless for disassembly.
COUNT is the number of elements in SYMBOLS.
Return the number of useful symbols. */
int
remove_useless_symbols (symbols, count)
asymbol **symbols;
int count;
{
register asymbol **in_ptr = symbols, **out_ptr = symbols;
while (--count >= 0)
{
asymbol *sym = *in_ptr++;
if (sym->name == NULL || sym->name[0] == '\0')
continue;
if (sym->flags & (BSF_DEBUGGING))
continue;
if (sym->section == &bfd_und_section
|| bfd_is_com_section (sym->section))
continue;
*out_ptr++ = sym;
}
return out_ptr - symbols;
}
1994-01-23 08:31:14 +08:00
/* Sort symbols into value order. */
static int
1994-01-23 08:31:14 +08:00
compare_symbols (ap, bp)
1992-06-13 13:24:22 +08:00
PTR ap;
PTR bp;
1991-03-22 05:29:06 +08:00
{
1992-06-13 13:24:22 +08:00
asymbol *a = *(asymbol **)ap;
asymbol *b = *(asymbol **)bp;
1991-03-22 05:29:06 +08:00
if (a->value > b->value)
return 1;
else if (a->value < b->value)
return -1;
1991-03-22 05:29:06 +08:00
if (a->section > b->section)
return 1;
else if (a->section < b->section)
return -1;
return 0;
1991-03-22 05:29:06 +08:00
}
/* Print VMA symbolically to INFO if possible. */
1991-03-22 05:29:06 +08:00
void
objdump_print_address (vma, info)
bfd_vma vma;
struct disassemble_info *info;
1991-03-22 05:29:06 +08:00
{
/* @@ For relocateable files, should filter out symbols belonging to
the wrong section. Unfortunately, not enough information is supplied
to this routine to determine the correct section in all cases. */
/* @@ Would it speed things up to cache the last two symbols returned,
and maybe their address ranges? For many processors, only one memory
operand can be present at a time, so the 2-entry cache wouldn't be
constantly churned by code doing heavy memory accesses. */
1991-03-22 05:29:06 +08:00
/* Indices in `syms'. */
1991-03-22 05:29:06 +08:00
unsigned int min = 0;
unsigned int max = symcount;
unsigned int thisplace = 1;
unsigned int oldthisplace;
1991-03-22 05:29:06 +08:00
int vardiff;
fprintf_vma (info->stream, vma);
if (symcount < 1)
return;
/* Perform a binary search looking for the closest symbol to
the required value. */
while (true)
{
asymbol *sym;
#if 0
asection *sym_sec;
#endif
oldthisplace = thisplace;
thisplace = (max + min) / 2;
if (thisplace == oldthisplace)
break;
sym = syms[thisplace];
vardiff = sym->value - vma;
#if 0
sym_sec = sym->section;
#endif
if (vardiff > 0)
max = thisplace;
else if (vardiff < 0)
min = thisplace;
else
goto found;
}
/* We've run out of places to look; see whether this or the
symbol before this describes this location the best. */
if (thisplace != 0)
{
if (syms[thisplace - 1]->value - vma < syms[thisplace]->value - vma)
{
/* Previous symbol is in correct section and is closer. */
thisplace--;
}
}
found:
{
/* If this symbol isn't global, search for one with the same value
that is. */
bfd_vma val = syms[thisplace]->value;
int i;
if (syms[thisplace]->flags & (BSF_LOCAL|BSF_DEBUGGING))
for (i = thisplace - 1; i >= 0; i--)
{
if (syms[i]->value == val
&& (!(syms[i]->flags & (BSF_LOCAL|BSF_DEBUGGING))
|| ((syms[thisplace]->flags & BSF_DEBUGGING)
&& !(syms[i]->flags & BSF_DEBUGGING))))
{
thisplace = i;
break;
}
}
if (syms[thisplace]->flags & (BSF_LOCAL|BSF_DEBUGGING))
for (i = thisplace + 1; i < symcount; i++)
{
if (syms[i]->value == val
&& (!(syms[i]->flags & (BSF_LOCAL|BSF_DEBUGGING))
|| ((syms[thisplace]->flags & BSF_DEBUGGING)
&& !(syms[i]->flags & BSF_DEBUGGING))))
{
thisplace = i;
break;
}
}
}
{
/* If the file is relocateable, and the symbol could be from this
section, prefer a symbol from this section over symbols from
others, even if the other symbol's value might be closer.
Note that this may be wrong for some symbol references if the
sections have overlapping memory ranges, but in that case there's
no way to tell what's desired without looking at the relocation
table. */
struct objdump_disasm_info *aux;
int i;
aux = (struct objdump_disasm_info *) info->application_data;
if ((aux->abfd->flags & HAS_RELOC)
&& vma >= bfd_get_section_vma (aux->abfd, aux->sec)
&& vma < (bfd_get_section_vma (aux->abfd, aux->sec)
+ bfd_get_section_size_before_reloc (aux->sec))
&& syms[thisplace]->section != aux->sec)
{
for (i = thisplace + 1; i < symcount; i++)
if (syms[i]->value != syms[thisplace]->value)
break;
while (--i >= 0)
if (syms[i]->section == aux->sec)
{
thisplace = i;
break;
}
}
}
fprintf (info->stream, " <%s", syms[thisplace]->name);
if (syms[thisplace]->value > vma)
{
char buf[30], *p = buf;
sprintf_vma (buf, syms[thisplace]->value - vma);
while (*p == '0')
p++;
fprintf (info->stream, "-%s", p);
}
else if (vma > syms[thisplace]->value)
{
char buf[30], *p = buf;
sprintf_vma (buf, vma - syms[thisplace]->value);
while (*p == '0')
p++;
fprintf (info->stream, "+%s", p);
1991-03-22 05:29:06 +08:00
}
fprintf (info->stream, ">");
1991-03-22 05:29:06 +08:00
}
#ifdef ARCH_all
#define ARCH_a29k
#define ARCH_alpha
#define ARCH_h8300
#define ARCH_h8500
#define ARCH_hppa
#define ARCH_i386
#define ARCH_i960
#define ARCH_m68k
#define ARCH_m88k
#define ARCH_mips
#define ARCH_rs6000
#define ARCH_sh
#define ARCH_sparc
#define ARCH_z8k
#endif
1991-03-22 05:29:06 +08:00
void
disassemble_data (abfd)
bfd *abfd;
1991-03-22 05:29:06 +08:00
{
bfd_size_type i;
unsigned int (*print) () = 0; /* Old style */
disassembler_ftype disassemble = 0; /* New style */
struct disassemble_info disasm_info;
struct objdump_disasm_info aux;
int prevline;
CONST char *prev_function = "";
1991-03-22 05:29:06 +08:00
asection *section;
boolean done_dot = false;
/* Replace symbol section relative values with abs values. */
for (i = 0; i < symcount; i++)
{
1991-03-22 05:29:06 +08:00
syms[i]->value += syms[i]->section->vma;
}
1991-03-22 05:29:06 +08:00
symcount = remove_useless_symbols (syms, symcount);
1991-03-22 05:29:06 +08:00
/* Sort the symbols into section and symbol order */
qsort (syms, symcount, sizeof (asymbol *), compare_symbols);
1991-03-22 05:29:06 +08:00
INIT_DISASSEMBLE_INFO(disasm_info, stdout);
disasm_info.application_data = (PTR) &aux;
aux.abfd = abfd;
disasm_info.print_address_func = objdump_print_address;
if (machine != (char *) NULL)
{
bfd_arch_info_type *info = bfd_scan_arch (machine);
if (info == NULL)
{
fprintf (stderr, "%s: Can't use supplied machine %s\n",
program_name,
machine);
exit (1);
}
abfd->arch_info = info;
1991-03-22 05:29:06 +08:00
}
/* See if we can disassemble using bfd. */
if (abfd->arch_info->disassemble)
{
print = abfd->arch_info->disassemble;
}
else
{
enum bfd_architecture a = bfd_get_arch (abfd);
switch (a)
{
/* If you add a case to this table, also add it to the
ARCH_all definition right above this function. */
#ifdef ARCH_a29k
case bfd_arch_a29k:
/* As far as I know we only handle big-endian 29k objects. */
disassemble = print_insn_big_a29k;
break;
#endif
#ifdef ARCH_alpha
case bfd_arch_alpha:
disassemble = print_insn_alpha;
break;
#endif
#ifdef ARCH_h8300
case bfd_arch_h8300:
if (bfd_get_mach(abfd) == bfd_mach_h8300h)
disassemble = print_insn_h8300h;
else
disassemble = print_insn_h8300;
break;
#endif
#ifdef ARCH_h8500
case bfd_arch_h8500:
disassemble = print_insn_h8500;
1993-04-27 09:39:38 +08:00
break;
#endif
#ifdef ARCH_hppa
case bfd_arch_hppa:
disassemble = print_insn_hppa;
break;
#endif
#ifdef ARCH_i386
case bfd_arch_i386:
disassemble = print_insn_i386;
break;
#endif
#ifdef ARCH_i960
case bfd_arch_i960:
disassemble = print_insn_i960;
break;
#endif
#ifdef ARCH_m68k
case bfd_arch_m68k:
disassemble = print_insn_m68k;
break;
#endif
#ifdef ARCH_m88k
case bfd_arch_m88k:
disassemble = print_insn_m88k;
break;
#endif
#ifdef ARCH_mips
case bfd_arch_mips:
if (abfd->xvec->byteorder_big_p)
disassemble = print_insn_big_mips;
else
disassemble = print_insn_little_mips;
break;
#endif
#ifdef ARCH_rs6000
case bfd_arch_rs6000:
disassemble = print_insn_rs6000;
break;
#endif
#ifdef ARCH_sh
case bfd_arch_sh:
disassemble = print_insn_sh;
break;
#endif
#ifdef ARCH_sparc
case bfd_arch_sparc:
disassemble = print_insn_sparc;
break;
#endif
#ifdef ARCH_z8k
case bfd_arch_z8k:
if (bfd_get_mach(abfd) == bfd_mach_z8001)
disassemble = print_insn_z8001;
else
disassemble = print_insn_z8002;
break;
#endif
default:
fprintf (stderr, "%s: Can't disassemble for architecture %s\n",
program_name,
bfd_printable_arch_mach (a, 0));
exit (1);
}
1991-03-22 05:29:06 +08:00
}
1991-03-22 05:29:06 +08:00
for (section = abfd->sections;
section != (asection *) NULL;
section = section->next)
{
bfd_byte *data = NULL;
bfd_size_type datasize = 0;
1991-03-22 05:29:06 +08:00
if (!(section->flags & SEC_LOAD))
continue;
if (only != (char *) NULL && strcmp (only, section->name) != 0)
continue;
1991-03-22 05:29:06 +08:00
printf ("Disassembly of section %s:\n", section->name);
1991-03-22 05:29:06 +08:00
datasize = bfd_get_section_size_before_reloc (section);
if (datasize == 0)
continue;
1991-03-22 05:29:06 +08:00
data = (bfd_byte *) xmalloc ((size_t) datasize);
1991-03-22 05:29:06 +08:00
bfd_get_section_contents (abfd, section, data, 0, datasize);
1991-03-22 05:29:06 +08:00
aux.sec = section;
disasm_info.buffer = data;
disasm_info.buffer_vma = section->vma;
disasm_info.buffer_length = datasize;
i = 0;
while (i < disasm_info.buffer_length)
{
if (data[i] == 0 && data[i + 1] == 0 && data[i + 2] == 0 &&
data[i + 3] == 0)
{
if (done_dot == false)
{
printf ("...\n");
done_dot = true;
}
i += 4;
}
else
{
done_dot = false;
if (with_line_numbers)
{
CONST char *filename;
CONST char *functionname;
unsigned int line;
if (bfd_find_nearest_line (abfd,
section,
syms,
section->vma + i,
&filename,
&functionname,
&line))
{
if (functionname && *functionname
&& strcmp(functionname, prev_function))
{
printf ("%s():\n", functionname);
prev_function = functionname;
}
if (!filename)
filename = "???";
if (line && line != prevline)
{
printf ("%s:%u\n", filename, line);
prevline = line;
}
}
}
objdump_print_address (section->vma + i, &disasm_info);
putchar (' ');
if (disassemble) /* New style */
{
int bytes = (*disassemble)(section->vma + i,
&disasm_info);
if (bytes < 0)
break;
i += bytes;
}
else /* Old style */
i += print (section->vma + i,
data + i,
stdout);
putchar ('\n');
}
}
free (data);
1991-03-22 05:29:06 +08:00
}
}
/* Define a table of stab values and print-strings. We wish the initializer
could be a direct-mapped table, but instead we build one the first
time we need it. */
char **stab_name;
struct stab_print {
int value;
char *string;
};
struct stab_print stab_print[] = {
#define __define_stab(NAME, CODE, STRING) {CODE, STRING},
#include "aout/stab.def"
#undef __define_stab
{0, ""}
};
1993-09-23 13:21:21 +08:00
void dump_stabs_1 ();
1993-09-23 13:21:21 +08:00
/* This dumps the stabs section from object files that have a section that
uses Sun stabs encoding. It has to use some hooks into BFD because
string table sections are not normally visible to BFD callers. */
void
1993-09-23 13:21:21 +08:00
dump_stabs (abfd)
bfd *abfd;
{
int i;
/* Allocate and initialize stab name array if first time. */
if (stab_name == NULL)
{
stab_name = (char **) xmalloc (256 * sizeof(char *));
/* Clear the array. */
for (i = 0; i < 256; i++)
stab_name[i] = NULL;
/* Fill in the defined stabs. */
for (i = 0; *stab_print[i].string; i++)
stab_name[stab_print[i].value] = stab_print[i].string;
}
1993-09-23 13:21:21 +08:00
dump_stabs_1 (abfd, ".stab", ".stabstr");
dump_stabs_1 (abfd, ".stab.excl", ".stab.exclstr");
dump_stabs_1 (abfd, ".stab.index", ".stab.indexstr");
dump_stabs_1 (abfd, "$GDB_SYMBOLS$", "$GDB_STRINGS$");
}
void
1993-09-23 13:21:21 +08:00
dump_stabs_1 (abfd, name1, name2)
bfd *abfd;
char *name1; /* Section name of .stab */
char *name2; /* Section name of its string section */
{
Elf_Internal_Shdr *stab_hdr, *stabstr_hdr;
1993-09-23 13:21:21 +08:00
asection *stabsect, *stabstrsect;
char *strtab;
struct internal_nlist *stabs, *stabs_end;
int i;
1993-09-23 13:21:21 +08:00
int stab_size, stabstr_size;
unsigned file_string_table_offset, next_file_string_table_offset;
1993-09-23 13:21:21 +08:00
int is_elf = (0 == strncmp ("elf", abfd->xvec->name, 3));
if (is_elf)
{
stab_hdr = bfd_elf_find_section (abfd, name1);
}
else
{
stabsect = bfd_get_section_by_name (abfd, name1);
}
1993-09-23 13:21:21 +08:00
if (is_elf ? (0 == stab_hdr) : (0 == stabsect))
{
1993-09-23 13:21:21 +08:00
printf ("No %s section present.\n\n", name1);
return;
}
1993-09-23 13:21:21 +08:00
if (is_elf)
{
stabstr_hdr = bfd_elf_find_section (abfd, name2);
}
else
{
stabstrsect = bfd_get_section_by_name (abfd, name2);
}
if (is_elf ? (0 == stabstr_hdr) : (0 == stabstrsect))
{
fprintf (stderr, "%s: %s has no %s section\n", program_name,
bfd_get_filename (abfd), name2);
return;
}
1993-09-23 13:21:21 +08:00
stab_size = (is_elf ? stab_hdr ->sh_size : bfd_section_size (abfd, stabsect));
stabstr_size = (is_elf ? stabstr_hdr->sh_size : bfd_section_size (abfd, stabstrsect));
1993-09-23 13:21:21 +08:00
stabs = (struct internal_nlist *) xmalloc (stab_size);
strtab = (char *) xmalloc (stabstr_size);
stabs_end = (struct internal_nlist *) (stab_size + (char *) stabs);
1993-09-23 13:21:21 +08:00
if (is_elf)
{
1993-09-23 13:21:21 +08:00
if (bfd_seek (abfd, stab_hdr->sh_offset, SEEK_SET) < 0 ||
stab_size != bfd_read ((PTR) stabs, stab_size, 1, abfd))
{
fprintf (stderr, "%s: Reading %s section of %s failed\n",
1993-09-23 13:21:21 +08:00
program_name, name1,
bfd_get_filename (abfd));
1993-09-23 13:21:21 +08:00
return;
}
}
else
{
bfd_get_section_contents (abfd, stabsect, (PTR) stabs, 0, stab_size);
}
1991-03-22 05:29:06 +08:00
1993-09-23 13:21:21 +08:00
if (is_elf)
{
1993-09-23 13:21:21 +08:00
if (bfd_seek (abfd, stabstr_hdr->sh_offset, SEEK_SET) < 0 ||
stabstr_size != bfd_read ((PTR) strtab, stabstr_size, 1, abfd))
{
fprintf (stderr, "%s: Reading %s section of %s failed\n",
1993-09-23 13:21:21 +08:00
program_name, name2,
bfd_get_filename (abfd));
1993-09-23 13:21:21 +08:00
return;
}
}
else
{
bfd_get_section_contents (abfd, stabstrsect, (PTR) strtab, 0, stabstr_size);
}
#define SWAP_SYMBOL(symp, abfd) \
{ \
(symp)->n_strx = bfd_h_get_32(abfd, \
(unsigned char *)&(symp)->n_strx); \
(symp)->n_desc = bfd_h_get_16 (abfd, \
(unsigned char *)&(symp)->n_desc); \
(symp)->n_value = bfd_h_get_32 (abfd, \
(unsigned char *)&(symp)->n_value); \
}
printf ("Contents of %s section:\n\n", name1);
printf ("Symnum n_type n_othr n_desc n_value n_strx String\n");
file_string_table_offset = 0;
next_file_string_table_offset = 0;
/* Loop through all symbols and print them.
We start the index at -1 because there is a dummy symbol on
the front of stabs-in-{coff,elf} sections that supplies sizes. */
for (i = -1; stabs < stabs_end; stabs++, i++)
{
SWAP_SYMBOL (stabs, abfd);
printf ("\n%-6d ", i);
/* Print either the stab name, or, if unnamed, print its number
again (makes consistent formatting for tools like awk). */
if (stab_name[stabs->n_type])
printf ("%-6s", stab_name[stabs->n_type]);
else
printf ("%-6d", i);
printf (" %-6d %-6d ", stabs->n_other, stabs->n_desc);
printf_vma (stabs->n_value);
printf (" %-6lu", stabs->n_strx);
/* Symbols with type == 0 (N_UNDF) specify the length of the
string table associated with this file. We use that info
to know how to relocate the *next* file's string table indices. */
if (stabs->n_type == N_UNDF)
{
file_string_table_offset = next_file_string_table_offset;
next_file_string_table_offset += stabs->n_value;
}
else
{
/* Now, using the possibly updated string table offset, print the
string (if any) associated with this symbol. */
if ((stabs->n_strx + file_string_table_offset) < stabstr_size)
printf (" %s", &strtab[stabs->n_strx + file_string_table_offset]);
else
printf (" *");
}
}
printf ("\n\n");
}
static void
dump_bfd_header (abfd)
bfd *abfd;
{
char *comma = "";
printf ("architecture: %s, ",
bfd_printable_arch_mach (bfd_get_arch (abfd),
bfd_get_mach (abfd)));
printf ("flags 0x%08x:\n", abfd->flags);
#define PF(x, y) if (abfd->flags & x) {printf("%s%s", comma, y); comma=", ";}
PF (HAS_RELOC, "HAS_RELOC");
PF (EXEC_P, "EXEC_P");
PF (HAS_LINENO, "HAS_LINENO");
PF (HAS_DEBUG, "HAS_DEBUG");
PF (HAS_SYMS, "HAS_SYMS");
PF (HAS_LOCALS, "HAS_LOCALS");
PF (DYNAMIC, "DYNAMIC");
PF (WP_TEXT, "WP_TEXT");
PF (D_PAGED, "D_PAGED");
PF (BFD_IS_RELAXABLE, "BFD_IS_RELAXABLE");
printf ("\nstart address 0x");
printf_vma (abfd->start_address);
}
static void
1991-03-22 05:29:06 +08:00
display_bfd (abfd)
bfd *abfd;
{
char **matching;
if (!bfd_check_format_matches (abfd, bfd_object, &matching))
{
bfd_nonfatal (bfd_get_filename (abfd));
if (bfd_error == file_ambiguously_recognized)
{
list_matching_formats (matching);
free (matching);
}
return;
}
printf ("\n%s: file format %s\n", bfd_get_filename (abfd),
abfd->xvec->name);
if (dump_ar_hdrs)
print_arelt_descr (stdout, abfd, true);
if (dump_file_header)
dump_bfd_header (abfd);
putchar ('\n');
1991-03-22 05:29:06 +08:00
if (dump_section_headers)
dump_headers (abfd);
if (dump_symtab || dump_reloc_info || disassemble)
{
syms = slurp_symtab (abfd);
}
if (dump_symtab)
dump_symbols (abfd);
if (dump_stab_section_info)
1993-09-23 13:21:21 +08:00
dump_stabs (abfd);
if (dump_reloc_info)
dump_relocs (abfd);
if (dump_section_contents)
dump_data (abfd);
/* Note that disassemble_data re-orders the syms table, but that is
safe - as long as it is done last! */
if (disassemble)
disassemble_data (abfd);
1991-03-22 05:29:06 +08:00
}
static void
1991-03-22 05:29:06 +08:00
display_file (filename, target)
char *filename;
char *target;
{
bfd *file, *arfile = (bfd *) NULL;
file = bfd_openr (filename, target);
if (file == NULL)
{
bfd_nonfatal (filename);
return;
}
1991-03-22 05:29:06 +08:00
if (bfd_check_format (file, bfd_archive) == true)
{
printf ("In archive %s:\n", bfd_get_filename (file));
for (;;)
{
bfd_error = no_error;
arfile = bfd_openr_next_archived_file (file, arfile);
if (arfile == NULL)
{
if (bfd_error != no_more_archived_files)
{
bfd_nonfatal (bfd_get_filename (file));
}
return;
}
1991-03-22 05:29:06 +08:00
display_bfd (arfile);
/* Don't close the archive elements; we need them for next_archive */
}
1991-03-22 05:29:06 +08:00
}
else
display_bfd (file);
1991-03-22 05:29:06 +08:00
bfd_close (file);
1991-03-22 05:29:06 +08:00
}
/* Actually display the various requested regions */
static void
1991-03-22 05:29:06 +08:00
dump_data (abfd)
bfd *abfd;
{
asection *section;
bfd_byte *data = 0;
bfd_size_type datasize = 0;
bfd_size_type i;
1991-03-22 05:29:06 +08:00
for (section = abfd->sections; section != NULL; section =
section->next)
{
int onaline = 16;
1991-03-22 05:29:06 +08:00
if (only == (char *) NULL ||
strcmp (only, section->name) == 0)
1992-05-02 06:45:45 +08:00
{
if (section->flags & SEC_HAS_CONTENTS)
{
printf ("Contents of section %s:\n", section->name);
1993-09-23 13:21:21 +08:00
if (bfd_section_size (abfd, section) == 0)
continue;
data = (bfd_byte *) xmalloc ((size_t) bfd_section_size (abfd, section));
1993-09-23 13:21:21 +08:00
datasize = bfd_section_size (abfd, section);
1991-03-22 05:29:06 +08:00
1993-09-23 13:21:21 +08:00
bfd_get_section_contents (abfd, section, (PTR) data, 0, bfd_section_size (abfd, section));
1991-03-22 05:29:06 +08:00
1993-09-23 13:21:21 +08:00
for (i = 0; i < bfd_section_size (abfd, section); i += onaline)
{
bfd_size_type j;
printf (" %04lx ", (unsigned long int) (i + section->vma));
for (j = i; j < i + onaline; j++)
{
1993-09-23 13:21:21 +08:00
if (j < bfd_section_size (abfd, section))
printf ("%02x", (unsigned) (data[j]));
else
printf (" ");
if ((j & 3) == 3)
printf (" ");
}
1991-03-22 05:29:06 +08:00
printf (" ");
for (j = i; j < i + onaline; j++)
{
1993-09-23 13:21:21 +08:00
if (j >= bfd_section_size (abfd, section))
printf (" ");
else
printf ("%c", isprint (data[j]) ? data[j] : '.');
}
putchar ('\n');
}
free (data);
1992-05-02 06:45:45 +08:00
}
1991-03-22 05:29:06 +08:00
}
}
}
/* Should perhaps share code and display with nm? */
static void
1991-03-22 05:29:06 +08:00
dump_symbols (abfd)
bfd *abfd;
{
unsigned int count;
asymbol **current = syms;
printf ("SYMBOL TABLE:\n");
for (count = 0; count < symcount; count++)
{
1991-03-22 05:29:06 +08:00
if (*current)
{
bfd *cur_bfd = bfd_asymbol_bfd(*current);
if (cur_bfd)
{
bfd_print_symbol (cur_bfd,
stdout,
*current, bfd_print_symbol_all);
printf ("\n");
}
}
current++;
1991-03-22 05:29:06 +08:00
}
printf ("\n");
printf ("\n");
1991-03-22 05:29:06 +08:00
}
static void
dump_relocs (abfd)
bfd *abfd;
1991-03-22 05:29:06 +08:00
{
arelent **relpp;
unsigned int relcount;
asection *a;
for (a = abfd->sections; a != (asection *) NULL; a = a->next)
{
if (a == &bfd_abs_section)
continue;
if (a == &bfd_und_section)
continue;
if (bfd_is_com_section (a))
continue;
if (only)
{
if (strcmp (only, a->name))
continue;
}
else if ((a->flags & SEC_RELOC) == 0)
continue;
printf ("RELOCATION RECORDS FOR [%s]:", a->name);
if (bfd_get_reloc_upper_bound (abfd, a) == 0)
{
printf (" (none)\n\n");
}
else
{
arelent **p;
relpp = (arelent **) xmalloc (bfd_get_reloc_upper_bound (abfd, a));
/* Note that this must be done *before* we sort the syms table. */
relcount = bfd_canonicalize_reloc (abfd, a, relpp, syms);
if (relcount == 0)
{
printf (" (none)\n\n");
}
else
{
printf ("\n");
/* Get column headers lined up reasonably. */
{
static int width;
if (width == 0)
{
char buf[30];
sprintf_vma (buf, (bfd_vma) -1);
width = strlen (buf) - 7;
}
printf ("OFFSET %*s TYPE %*s VALUE \n", width, "", 12, "");
}
for (p = relpp; relcount && *p != (arelent *) NULL; p++,
relcount--)
{
arelent *q = *p;
CONST char *sym_name;
CONST char *section_name;
if (q->sym_ptr_ptr && *q->sym_ptr_ptr)
{
sym_name = (*(q->sym_ptr_ptr))->name;
section_name = (*(q->sym_ptr_ptr))->section->name;
}
else
{
sym_name = NULL;
section_name = NULL;
}
if (sym_name)
{
printf_vma (q->address);
printf (" %-16s %s",
q->howto->name,
sym_name);
}
else
{
if (section_name == (CONST char *) NULL)
section_name = "*unknown*";
printf_vma (q->address);
printf (" %-16s [%s]",
q->howto->name,
section_name);
}
if (q->addend)
{
printf ("+0x");
printf_vma (q->addend);
}
printf ("\n");
}
printf ("\n\n");
free (relpp);
}
1991-03-22 05:29:06 +08:00
}
}
1991-03-22 05:29:06 +08:00
}
/* A file to open each BFD on. It will never actually be written to. */
#ifdef unix
#define _DUMMY_NAME_ "/dev/null"
#else
#define _DUMMY_NAME_ "##dummy"
#endif
/* The length of the longest architecture name + 1. */
#define LONGEST_ARCH sizeof("rs6000:6000")
/* List the targets that BFD is configured to support, each followed
by its endianness and the architectures it supports. */
static void
display_target_list ()
{
extern bfd_target *bfd_target_vector[];
int t;
for (t = 0; bfd_target_vector[t]; t++)
{
int a;
bfd_target *p = bfd_target_vector[t];
bfd *abfd = bfd_openw (_DUMMY_NAME_, p->name);
/* It *is* possible that bfd_openw might fail; avoid the
tragic consequences that would otherwise ensue. */
if (abfd == NULL)
{
bfd_nonfatal (_DUMMY_NAME_);
return;
}
bfd_set_format (abfd, bfd_object);
printf ("%s\n (header %s, data %s)\n", p->name,
p->header_byteorder_big_p ? "big endian" : "little endian",
p->byteorder_big_p ? "big endian" : "little endian");
for (a = (int) bfd_arch_obscure + 1; a < (int) bfd_arch_last; a++)
if (bfd_set_arch_mach (abfd, (enum bfd_architecture) a, 0))
printf (" %s\n",
bfd_printable_arch_mach ((enum bfd_architecture) a, 0));
}
}
/* Print a table showing which architectures are supported for entries
FIRST through LAST-1 of bfd_target_vector (targets across,
architectures down). */
1991-04-24 01:02:09 +09:00
static void
display_info_table (first, last)
int first;
int last;
1991-04-24 01:02:09 +09:00
{
int t, a;
extern bfd_target *bfd_target_vector[];
1991-04-24 01:02:09 +09:00
/* Print heading of target names. */
printf ("\n%*s", LONGEST_ARCH, " ");
for (t = first; t++ < last && bfd_target_vector[t];)
printf ("%s ", bfd_target_vector[t]->name);
putchar ('\n');
1991-04-24 01:02:09 +09:00
for (a = (int) bfd_arch_obscure + 1; a < (int) bfd_arch_last; a++)
if (strcmp (bfd_printable_arch_mach (a, 0), "UNKNOWN!") != 0)
{
printf ("%*s ", LONGEST_ARCH - 1, bfd_printable_arch_mach (a, 0));
for (t = first; t++ < last && bfd_target_vector[t];)
{
bfd_target *p = bfd_target_vector[t];
bfd *abfd = bfd_openw (_DUMMY_NAME_, p->name);
/* Just in case the open failed somehow. */
if (abfd == NULL)
{
bfd_nonfatal (_DUMMY_NAME_);
return;
}
bfd_set_format (abfd, bfd_object);
if (bfd_set_arch_mach (abfd, a, 0))
printf ("%s ", p->name);
else
{
int l = strlen (p->name);
while (l--)
putchar ('-');
putchar (' ');
}
}
putchar ('\n');
}
1991-04-24 01:02:09 +09:00
}
/* Print tables of all the target-architecture combinations that
BFD has been configured to support. */
static void
display_target_tables ()
{
int t, columns;
extern bfd_target *bfd_target_vector[];
char *colum;
extern char *getenv ();
columns = 0;
colum = getenv ("COLUMNS");
if (colum != NULL)
columns = atoi (colum);
if (columns == 0)
columns = 80;
for (t = 0; bfd_target_vector[t];)
{
int oldt = t, wid;
for (wid = LONGEST_ARCH; bfd_target_vector[t] && wid < columns; t++)
wid += strlen (bfd_target_vector[t]->name) + 1;
t--;
if (oldt == t)
break;
display_info_table (oldt, t);
}
}
static void
display_info ()
{
printf ("BFD header file version %s\n", BFD_VERSION);
display_target_list ();
display_target_tables ();
}
1991-03-22 05:29:06 +08:00
int
main (argc, argv)
int argc;
char **argv;
{
int c;
char *target = default_target;
boolean seenflag = false;
bfd_init ();
1991-03-22 05:29:06 +08:00
program_name = *argv;
while ((c = getopt_long (argc, argv, "ib:m:Vdlfahrtxsj:", long_options,
(int *) 0))
!= EOF)
{
seenflag = true;
switch (c)
{
case 0:
break; /* we've been given a long option */
case 'm':
machine = optarg;
break;
case 'j':
only = optarg;
break;
case 'l':
with_line_numbers = 1;
break;
case 'b':
target = optarg;
break;
case 'f':
dump_file_header = true;
break;
case 'i':
formats_info = true;
break;
case 'x':
dump_symtab = 1;
dump_reloc_info = 1;
dump_file_header = true;
dump_ar_hdrs = 1;
dump_section_headers = 1;
break;
case 't':
dump_symtab = 1;
break;
case 'd':
disassemble = true;
break;
case 's':
dump_section_contents = 1;
break;
case 'r':
dump_reloc_info = 1;
break;
case 'a':
dump_ar_hdrs = 1;
break;
case 'h':
dump_section_headers = 1;
break;
case 'H':
usage (stdout, 0);
case 'V':
show_version = 1;
break;
default:
usage (stderr, 1);
}
1991-03-22 05:29:06 +08:00
}
if (show_version)
{
printf ("GNU %s version %s\n", program_name, program_version);
exit (0);
}
1991-03-22 05:29:06 +08:00
if (seenflag == false)
usage (stderr, 1);
1991-03-22 05:29:06 +08:00
if (formats_info)
{
display_info ();
}
else
{
if (optind == argc)
display_file ("a.out", target);
else
for (; optind < argc;)
display_file (argv[optind++], target);
}
1991-03-22 05:29:06 +08:00
return 0;
}