58521dd84530de2fd1b838ddcf82bdb3b705c0bc
[deliverable/binutils-gdb.git] / binutils / objdump.c
1 /* objdump.c -- dump information about an object file.
2 Copyright (C) 1990-2017 Free Software Foundation, Inc.
3
4 This file is part of GNU Binutils.
5
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 3, or (at your option)
9 any later version.
10
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
15
16 You should have received a copy of the GNU General Public License
17 along with this program; if not, write to the Free Software
18 Foundation, 51 Franklin Street - Fifth Floor, Boston,
19 MA 02110-1301, USA. */
20
21
22 /* Objdump overview.
23
24 Objdump displays information about one or more object files, either on
25 their own, or inside libraries. It is commonly used as a disassembler,
26 but it can also display information about file headers, symbol tables,
27 relocations, debugging directives and more.
28
29 The flow of execution is as follows:
30
31 1. Command line arguments are checked for control switches and the
32 information to be displayed is selected.
33
34 2. Any remaining arguments are assumed to be object files, and they are
35 processed in order by display_bfd(). If the file is an archive each
36 of its elements is processed in turn.
37
38 3. The file's target architecture and binary file format are determined
39 by bfd_check_format(). If they are recognised, then dump_bfd() is
40 called.
41
42 4. dump_bfd() in turn calls separate functions to display the requested
43 item(s) of information(s). For example disassemble_data() is called if
44 a disassembly has been requested.
45
46 When disassembling the code loops through blocks of instructions bounded
47 by symbols, calling disassemble_bytes() on each block. The actual
48 disassembling is done by the libopcodes library, via a function pointer
49 supplied by the disassembler() function. */
50
51 #include "sysdep.h"
52 #include "bfd.h"
53 #include "elf-bfd.h"
54 #include "coff-bfd.h"
55 #include "progress.h"
56 #include "bucomm.h"
57 #include "elfcomm.h"
58 #include "dwarf.h"
59 #include "getopt.h"
60 #include "safe-ctype.h"
61 #include "dis-asm.h"
62 #include "libiberty.h"
63 #include "demangle.h"
64 #include "filenames.h"
65 #include "debug.h"
66 #include "budbg.h"
67 #include "objdump.h"
68
69 #ifdef HAVE_MMAP
70 #include <sys/mman.h>
71 #endif
72
73 /* Internal headers for the ELF .stab-dump code - sorry. */
74 #define BYTES_IN_WORD 32
75 #include "aout/aout64.h"
76
77 /* Exit status. */
78 static int exit_status = 0;
79
80 static char *default_target = NULL; /* Default at runtime. */
81
82 /* The following variables are set based on arguments passed on the
83 command line. */
84 static int show_version = 0; /* Show the version number. */
85 static int dump_section_contents; /* -s */
86 static int dump_section_headers; /* -h */
87 static bfd_boolean dump_file_header; /* -f */
88 static int dump_symtab; /* -t */
89 static int dump_dynamic_symtab; /* -T */
90 static int dump_reloc_info; /* -r */
91 static int dump_dynamic_reloc_info; /* -R */
92 static int dump_ar_hdrs; /* -a */
93 static int dump_private_headers; /* -p */
94 static char *dump_private_options; /* -P */
95 static int prefix_addresses; /* --prefix-addresses */
96 static int with_line_numbers; /* -l */
97 static bfd_boolean with_source_code; /* -S */
98 static int show_raw_insn; /* --show-raw-insn */
99 static int dump_dwarf_section_info; /* --dwarf */
100 static int dump_stab_section_info; /* --stabs */
101 static int do_demangle; /* -C, --demangle */
102 static bfd_boolean disassemble; /* -d */
103 static bfd_boolean disassemble_all; /* -D */
104 static int disassemble_zeroes; /* --disassemble-zeroes */
105 static bfd_boolean formats_info; /* -i */
106 static int wide_output; /* -w */
107 static int insn_width; /* --insn-width */
108 static bfd_vma start_address = (bfd_vma) -1; /* --start-address */
109 static bfd_vma stop_address = (bfd_vma) -1; /* --stop-address */
110 static int dump_debugging; /* --debugging */
111 static int dump_debugging_tags; /* --debugging-tags */
112 static int suppress_bfd_header;
113 static int dump_special_syms = 0; /* --special-syms */
114 static bfd_vma adjust_section_vma = 0; /* --adjust-vma */
115 static int file_start_context = 0; /* --file-start-context */
116 static bfd_boolean display_file_offsets;/* -F */
117 static const char *prefix; /* --prefix */
118 static int prefix_strip; /* --prefix-strip */
119 static size_t prefix_length;
120 static bfd_boolean unwind_inlines; /* --inlines. */
121
122 /* A structure to record the sections mentioned in -j switches. */
123 struct only
124 {
125 const char * name; /* The name of the section. */
126 bfd_boolean seen; /* A flag to indicate that the section has been found in one or more input files. */
127 struct only * next; /* Pointer to the next structure in the list. */
128 };
129 /* Pointer to an array of 'only' structures.
130 This pointer is NULL if the -j switch has not been used. */
131 static struct only * only_list = NULL;
132
133 /* Variables for handling include file path table. */
134 static const char **include_paths;
135 static int include_path_count;
136
137 /* Extra info to pass to the section disassembler and address printing
138 function. */
139 struct objdump_disasm_info
140 {
141 bfd * abfd;
142 asection * sec;
143 bfd_boolean require_sec;
144 arelent ** dynrelbuf;
145 long dynrelcount;
146 disassembler_ftype disassemble_fn;
147 arelent * reloc;
148 };
149
150 /* Architecture to disassemble for, or default if NULL. */
151 static char *machine = NULL;
152
153 /* Target specific options to the disassembler. */
154 static char *disassembler_options = NULL;
155
156 /* Endianness to disassemble for, or default if BFD_ENDIAN_UNKNOWN. */
157 static enum bfd_endian endian = BFD_ENDIAN_UNKNOWN;
158
159 /* The symbol table. */
160 static asymbol **syms;
161
162 /* Number of symbols in `syms'. */
163 static long symcount = 0;
164
165 /* The sorted symbol table. */
166 static asymbol **sorted_syms;
167
168 /* Number of symbols in `sorted_syms'. */
169 static long sorted_symcount = 0;
170
171 /* The dynamic symbol table. */
172 static asymbol **dynsyms;
173
174 /* The synthetic symbol table. */
175 static asymbol *synthsyms;
176 static long synthcount = 0;
177
178 /* Number of symbols in `dynsyms'. */
179 static long dynsymcount = 0;
180
181 static bfd_byte *stabs;
182 static bfd_size_type stab_size;
183
184 static char *strtab;
185 static bfd_size_type stabstr_size;
186
187 static bfd_boolean is_relocatable = FALSE;
188
189 /* Handlers for -P/--private. */
190 static const struct objdump_private_desc * const objdump_private_vectors[] =
191 {
192 OBJDUMP_PRIVATE_VECTORS
193 NULL
194 };
195 \f
196 static void usage (FILE *, int) ATTRIBUTE_NORETURN;
197 static void
198 usage (FILE *stream, int status)
199 {
200 fprintf (stream, _("Usage: %s <option(s)> <file(s)>\n"), program_name);
201 fprintf (stream, _(" Display information from object <file(s)>.\n"));
202 fprintf (stream, _(" At least one of the following switches must be given:\n"));
203 fprintf (stream, _("\
204 -a, --archive-headers Display archive header information\n\
205 -f, --file-headers Display the contents of the overall file header\n\
206 -p, --private-headers Display object format specific file header contents\n\
207 -P, --private=OPT,OPT... Display object format specific contents\n\
208 -h, --[section-]headers Display the contents of the section headers\n\
209 -x, --all-headers Display the contents of all headers\n\
210 -d, --disassemble Display assembler contents of executable sections\n\
211 -D, --disassemble-all Display assembler contents of all sections\n\
212 -S, --source Intermix source code with disassembly\n\
213 -s, --full-contents Display the full contents of all sections requested\n\
214 -g, --debugging Display debug information in object file\n\
215 -e, --debugging-tags Display debug information using ctags style\n\
216 -G, --stabs Display (in raw form) any STABS info in the file\n\
217 -W[lLiaprmfFsoRt] or\n\
218 --dwarf[=rawline,=decodedline,=info,=abbrev,=pubnames,=aranges,=macro,=frames,\n\
219 =frames-interp,=str,=loc,=Ranges,=pubtypes,\n\
220 =gdb_index,=trace_info,=trace_abbrev,=trace_aranges,\n\
221 =addr,=cu_index]\n\
222 Display DWARF info in the file\n\
223 -t, --syms Display the contents of the symbol table(s)\n\
224 -T, --dynamic-syms Display the contents of the dynamic symbol table\n\
225 -r, --reloc Display the relocation entries in the file\n\
226 -R, --dynamic-reloc Display the dynamic relocation entries in the file\n\
227 @<file> Read options from <file>\n\
228 -v, --version Display this program's version number\n\
229 -i, --info List object formats and architectures supported\n\
230 -H, --help Display this information\n\
231 "));
232 if (status != 2)
233 {
234 const struct objdump_private_desc * const *desc;
235
236 fprintf (stream, _("\n The following switches are optional:\n"));
237 fprintf (stream, _("\
238 -b, --target=BFDNAME Specify the target object format as BFDNAME\n\
239 -m, --architecture=MACHINE Specify the target architecture as MACHINE\n\
240 -j, --section=NAME Only display information for section NAME\n\
241 -M, --disassembler-options=OPT Pass text OPT on to the disassembler\n\
242 -EB --endian=big Assume big endian format when disassembling\n\
243 -EL --endian=little Assume little endian format when disassembling\n\
244 --file-start-context Include context from start of file (with -S)\n\
245 -I, --include=DIR Add DIR to search list for source files\n\
246 -l, --line-numbers Include line numbers and filenames in output\n\
247 -F, --file-offsets Include file offsets when displaying information\n\
248 -C, --demangle[=STYLE] Decode mangled/processed symbol names\n\
249 The STYLE, if specified, can be `auto', `gnu',\n\
250 `lucid', `arm', `hp', `edg', `gnu-v3', `java'\n\
251 or `gnat'\n\
252 -w, --wide Format output for more than 80 columns\n\
253 -z, --disassemble-zeroes Do not skip blocks of zeroes when disassembling\n\
254 --start-address=ADDR Only process data whose address is >= ADDR\n\
255 --stop-address=ADDR Only process data whose address is <= ADDR\n\
256 --prefix-addresses Print complete address alongside disassembly\n\
257 --[no-]show-raw-insn Display hex alongside symbolic disassembly\n\
258 --insn-width=WIDTH Display WIDTH bytes on a single line for -d\n\
259 --adjust-vma=OFFSET Add OFFSET to all displayed section addresses\n\
260 --special-syms Include special symbols in symbol dumps\n\
261 --inlines Print all inlines for source line (with -l)\n\
262 --prefix=PREFIX Add PREFIX to absolute paths for -S\n\
263 --prefix-strip=LEVEL Strip initial directory names for -S\n"));
264 fprintf (stream, _("\
265 --dwarf-depth=N Do not display DIEs at depth N or greater\n\
266 --dwarf-start=N Display DIEs starting with N, at the same depth\n\
267 or deeper\n\
268 --dwarf-check Make additional dwarf internal consistency checks.\
269 \n\n"));
270 list_supported_targets (program_name, stream);
271 list_supported_architectures (program_name, stream);
272
273 disassembler_usage (stream);
274
275 if (objdump_private_vectors[0] != NULL)
276 {
277 fprintf (stream,
278 _("\nOptions supported for -P/--private switch:\n"));
279 for (desc = objdump_private_vectors; *desc != NULL; desc++)
280 (*desc)->help (stream);
281 }
282 }
283 if (REPORT_BUGS_TO[0] && status == 0)
284 fprintf (stream, _("Report bugs to %s.\n"), REPORT_BUGS_TO);
285 exit (status);
286 }
287
288 /* 150 isn't special; it's just an arbitrary non-ASCII char value. */
289 enum option_values
290 {
291 OPTION_ENDIAN=150,
292 OPTION_START_ADDRESS,
293 OPTION_STOP_ADDRESS,
294 OPTION_DWARF,
295 OPTION_PREFIX,
296 OPTION_PREFIX_STRIP,
297 OPTION_INSN_WIDTH,
298 OPTION_ADJUST_VMA,
299 OPTION_DWARF_DEPTH,
300 OPTION_DWARF_CHECK,
301 OPTION_DWARF_START,
302 OPTION_INLINES
303 };
304
305 static struct option long_options[]=
306 {
307 {"adjust-vma", required_argument, NULL, OPTION_ADJUST_VMA},
308 {"all-headers", no_argument, NULL, 'x'},
309 {"private-headers", no_argument, NULL, 'p'},
310 {"private", required_argument, NULL, 'P'},
311 {"architecture", required_argument, NULL, 'm'},
312 {"archive-headers", no_argument, NULL, 'a'},
313 {"debugging", no_argument, NULL, 'g'},
314 {"debugging-tags", no_argument, NULL, 'e'},
315 {"demangle", optional_argument, NULL, 'C'},
316 {"disassemble", no_argument, NULL, 'd'},
317 {"disassemble-all", no_argument, NULL, 'D'},
318 {"disassembler-options", required_argument, NULL, 'M'},
319 {"disassemble-zeroes", no_argument, NULL, 'z'},
320 {"dynamic-reloc", no_argument, NULL, 'R'},
321 {"dynamic-syms", no_argument, NULL, 'T'},
322 {"endian", required_argument, NULL, OPTION_ENDIAN},
323 {"file-headers", no_argument, NULL, 'f'},
324 {"file-offsets", no_argument, NULL, 'F'},
325 {"file-start-context", no_argument, &file_start_context, 1},
326 {"full-contents", no_argument, NULL, 's'},
327 {"headers", no_argument, NULL, 'h'},
328 {"help", no_argument, NULL, 'H'},
329 {"info", no_argument, NULL, 'i'},
330 {"line-numbers", no_argument, NULL, 'l'},
331 {"no-show-raw-insn", no_argument, &show_raw_insn, -1},
332 {"prefix-addresses", no_argument, &prefix_addresses, 1},
333 {"reloc", no_argument, NULL, 'r'},
334 {"section", required_argument, NULL, 'j'},
335 {"section-headers", no_argument, NULL, 'h'},
336 {"show-raw-insn", no_argument, &show_raw_insn, 1},
337 {"source", no_argument, NULL, 'S'},
338 {"special-syms", no_argument, &dump_special_syms, 1},
339 {"include", required_argument, NULL, 'I'},
340 {"dwarf", optional_argument, NULL, OPTION_DWARF},
341 {"stabs", no_argument, NULL, 'G'},
342 {"start-address", required_argument, NULL, OPTION_START_ADDRESS},
343 {"stop-address", required_argument, NULL, OPTION_STOP_ADDRESS},
344 {"syms", no_argument, NULL, 't'},
345 {"target", required_argument, NULL, 'b'},
346 {"version", no_argument, NULL, 'V'},
347 {"wide", no_argument, NULL, 'w'},
348 {"prefix", required_argument, NULL, OPTION_PREFIX},
349 {"prefix-strip", required_argument, NULL, OPTION_PREFIX_STRIP},
350 {"insn-width", required_argument, NULL, OPTION_INSN_WIDTH},
351 {"dwarf-depth", required_argument, 0, OPTION_DWARF_DEPTH},
352 {"dwarf-start", required_argument, 0, OPTION_DWARF_START},
353 {"dwarf-check", no_argument, 0, OPTION_DWARF_CHECK},
354 {"inlines", no_argument, 0, OPTION_INLINES},
355 {0, no_argument, 0, 0}
356 };
357 \f
358 static void
359 nonfatal (const char *msg)
360 {
361 bfd_nonfatal (msg);
362 exit_status = 1;
363 }
364 \f
365 /* Returns TRUE if the specified section should be dumped. */
366
367 static bfd_boolean
368 process_section_p (asection * section)
369 {
370 struct only * only;
371
372 if (only_list == NULL)
373 return TRUE;
374
375 for (only = only_list; only; only = only->next)
376 if (strcmp (only->name, section->name) == 0)
377 {
378 only->seen = TRUE;
379 return TRUE;
380 }
381
382 return FALSE;
383 }
384
385 /* Add an entry to the 'only' list. */
386
387 static void
388 add_only (char * name)
389 {
390 struct only * only;
391
392 /* First check to make sure that we do not
393 already have an entry for this name. */
394 for (only = only_list; only; only = only->next)
395 if (strcmp (only->name, name) == 0)
396 return;
397
398 only = xmalloc (sizeof * only);
399 only->name = name;
400 only->seen = FALSE;
401 only->next = only_list;
402 only_list = only;
403 }
404
405 /* Release the memory used by the 'only' list.
406 PR 11225: Issue a warning message for unseen sections.
407 Only do this if none of the sections were seen. This is mainly to support
408 tools like the GAS testsuite where an object file is dumped with a list of
409 generic section names known to be present in a range of different file
410 formats. */
411
412 static void
413 free_only_list (void)
414 {
415 bfd_boolean at_least_one_seen = FALSE;
416 struct only * only;
417 struct only * next;
418
419 if (only_list == NULL)
420 return;
421
422 for (only = only_list; only; only = only->next)
423 if (only->seen)
424 {
425 at_least_one_seen = TRUE;
426 break;
427 }
428
429 for (only = only_list; only; only = next)
430 {
431 if (! at_least_one_seen)
432 {
433 non_fatal (_("section '%s' mentioned in a -j option, "
434 "but not found in any input file"),
435 only->name);
436 exit_status = 1;
437 }
438 next = only->next;
439 free (only);
440 }
441 }
442
443 \f
444 static void
445 dump_section_header (bfd *abfd, asection *section, void *data)
446 {
447 char *comma = "";
448 unsigned int opb = bfd_octets_per_byte (abfd);
449 int longest_section_name = *((int *) data);
450
451 /* Ignore linker created section. See elfNN_ia64_object_p in
452 bfd/elfxx-ia64.c. */
453 if (section->flags & SEC_LINKER_CREATED)
454 return;
455
456 /* PR 10413: Skip sections that we are ignoring. */
457 if (! process_section_p (section))
458 return;
459
460 printf ("%3d %-*s %08lx ", section->index, longest_section_name,
461 bfd_get_section_name (abfd, section),
462 (unsigned long) bfd_section_size (abfd, section) / opb);
463 bfd_printf_vma (abfd, bfd_get_section_vma (abfd, section));
464 printf (" ");
465 bfd_printf_vma (abfd, section->lma);
466 printf (" %08lx 2**%u", (unsigned long) section->filepos,
467 bfd_get_section_alignment (abfd, section));
468 if (! wide_output)
469 printf ("\n ");
470 printf (" ");
471
472 #define PF(x, y) \
473 if (section->flags & x) { printf ("%s%s", comma, y); comma = ", "; }
474
475 PF (SEC_HAS_CONTENTS, "CONTENTS");
476 PF (SEC_ALLOC, "ALLOC");
477 PF (SEC_CONSTRUCTOR, "CONSTRUCTOR");
478 PF (SEC_LOAD, "LOAD");
479 PF (SEC_RELOC, "RELOC");
480 PF (SEC_READONLY, "READONLY");
481 PF (SEC_CODE, "CODE");
482 PF (SEC_DATA, "DATA");
483 PF (SEC_ROM, "ROM");
484 PF (SEC_DEBUGGING, "DEBUGGING");
485 PF (SEC_NEVER_LOAD, "NEVER_LOAD");
486 PF (SEC_EXCLUDE, "EXCLUDE");
487 PF (SEC_SORT_ENTRIES, "SORT_ENTRIES");
488 if (bfd_get_arch (abfd) == bfd_arch_tic54x)
489 {
490 PF (SEC_TIC54X_BLOCK, "BLOCK");
491 PF (SEC_TIC54X_CLINK, "CLINK");
492 }
493 PF (SEC_SMALL_DATA, "SMALL_DATA");
494 if (bfd_get_flavour (abfd) == bfd_target_coff_flavour)
495 {
496 PF (SEC_COFF_SHARED, "SHARED");
497 PF (SEC_COFF_NOREAD, "NOREAD");
498 }
499 else if (bfd_get_flavour (abfd) == bfd_target_elf_flavour)
500 PF (SEC_ELF_PURECODE, "PURECODE");
501 PF (SEC_THREAD_LOCAL, "THREAD_LOCAL");
502 PF (SEC_GROUP, "GROUP");
503 if (bfd_get_arch (abfd) == bfd_arch_mep)
504 {
505 PF (SEC_MEP_VLIW, "VLIW");
506 }
507
508 if ((section->flags & SEC_LINK_ONCE) != 0)
509 {
510 const char *ls;
511 struct coff_comdat_info *comdat;
512
513 switch (section->flags & SEC_LINK_DUPLICATES)
514 {
515 default:
516 abort ();
517 case SEC_LINK_DUPLICATES_DISCARD:
518 ls = "LINK_ONCE_DISCARD";
519 break;
520 case SEC_LINK_DUPLICATES_ONE_ONLY:
521 ls = "LINK_ONCE_ONE_ONLY";
522 break;
523 case SEC_LINK_DUPLICATES_SAME_SIZE:
524 ls = "LINK_ONCE_SAME_SIZE";
525 break;
526 case SEC_LINK_DUPLICATES_SAME_CONTENTS:
527 ls = "LINK_ONCE_SAME_CONTENTS";
528 break;
529 }
530 printf ("%s%s", comma, ls);
531
532 comdat = bfd_coff_get_comdat_section (abfd, section);
533 if (comdat != NULL)
534 printf (" (COMDAT %s %ld)", comdat->name, comdat->symbol);
535
536 comma = ", ";
537 }
538
539 printf ("\n");
540 #undef PF
541 }
542
543 /* Called on each SECTION in ABFD, update the int variable pointed to by
544 DATA which contains the string length of the longest section name. */
545
546 static void
547 find_longest_section_name (bfd *abfd, asection *section, void *data)
548 {
549 int *longest_so_far = (int *) data;
550 const char *name;
551 int len;
552
553 /* Ignore linker created section. */
554 if (section->flags & SEC_LINKER_CREATED)
555 return;
556
557 /* Skip sections that we are ignoring. */
558 if (! process_section_p (section))
559 return;
560
561 name = bfd_get_section_name (abfd, section);
562 len = (int) strlen (name);
563 if (len > *longest_so_far)
564 *longest_so_far = len;
565 }
566
567 static void
568 dump_headers (bfd *abfd)
569 {
570 /* The default width of 13 is just an arbitrary choice. */
571 int max_section_name_length = 13;
572 int bfd_vma_width;
573
574 #ifndef BFD64
575 bfd_vma_width = 10;
576 #else
577 /* With BFD64, non-ELF returns -1 and wants always 64 bit addresses. */
578 if (bfd_get_arch_size (abfd) == 32)
579 bfd_vma_width = 10;
580 else
581 bfd_vma_width = 18;
582 #endif
583
584 printf (_("Sections:\n"));
585
586 if (wide_output)
587 bfd_map_over_sections (abfd, find_longest_section_name,
588 &max_section_name_length);
589
590 printf (_("Idx %-*s Size %-*s%-*sFile off Algn"),
591 max_section_name_length, "Name",
592 bfd_vma_width, "VMA",
593 bfd_vma_width, "LMA");
594
595 if (wide_output)
596 printf (_(" Flags"));
597 printf ("\n");
598
599 bfd_map_over_sections (abfd, dump_section_header,
600 &max_section_name_length);
601 }
602 \f
603 static asymbol **
604 slurp_symtab (bfd *abfd)
605 {
606 asymbol **sy = NULL;
607 long storage;
608
609 if (!(bfd_get_file_flags (abfd) & HAS_SYMS))
610 {
611 symcount = 0;
612 return NULL;
613 }
614
615 storage = bfd_get_symtab_upper_bound (abfd);
616 if (storage < 0)
617 {
618 non_fatal (_("failed to read symbol table from: %s"), bfd_get_filename (abfd));
619 bfd_fatal (_("error message was"));
620 }
621 if (storage)
622 sy = (asymbol **) xmalloc (storage);
623
624 symcount = bfd_canonicalize_symtab (abfd, sy);
625 if (symcount < 0)
626 bfd_fatal (bfd_get_filename (abfd));
627 return sy;
628 }
629
630 /* Read in the dynamic symbols. */
631
632 static asymbol **
633 slurp_dynamic_symtab (bfd *abfd)
634 {
635 asymbol **sy = NULL;
636 long storage;
637
638 storage = bfd_get_dynamic_symtab_upper_bound (abfd);
639 if (storage < 0)
640 {
641 if (!(bfd_get_file_flags (abfd) & DYNAMIC))
642 {
643 non_fatal (_("%s: not a dynamic object"), bfd_get_filename (abfd));
644 exit_status = 1;
645 dynsymcount = 0;
646 return NULL;
647 }
648
649 bfd_fatal (bfd_get_filename (abfd));
650 }
651 if (storage)
652 sy = (asymbol **) xmalloc (storage);
653
654 dynsymcount = bfd_canonicalize_dynamic_symtab (abfd, sy);
655 if (dynsymcount < 0)
656 bfd_fatal (bfd_get_filename (abfd));
657 return sy;
658 }
659
660 /* Some symbol names are significant and should be kept in the
661 table of sorted symbol names, even if they are marked as
662 debugging/section symbols. */
663
664 static bfd_boolean
665 is_significant_symbol_name (const char * name)
666 {
667 return strcmp (name, ".plt") == 0
668 || strcmp (name, ".got") == 0
669 || strcmp (name, ".plt.got") == 0;
670 }
671
672 /* Filter out (in place) symbols that are useless for disassembly.
673 COUNT is the number of elements in SYMBOLS.
674 Return the number of useful symbols. */
675
676 static long
677 remove_useless_symbols (asymbol **symbols, long count)
678 {
679 asymbol **in_ptr = symbols, **out_ptr = symbols;
680
681 while (--count >= 0)
682 {
683 asymbol *sym = *in_ptr++;
684
685 if (sym->name == NULL || sym->name[0] == '\0')
686 continue;
687 if ((sym->flags & (BSF_DEBUGGING | BSF_SECTION_SYM))
688 && ! is_significant_symbol_name (sym->name))
689 continue;
690 if (bfd_is_und_section (sym->section)
691 || bfd_is_com_section (sym->section))
692 continue;
693
694 *out_ptr++ = sym;
695 }
696 return out_ptr - symbols;
697 }
698
699 /* Sort symbols into value order. */
700
701 static int
702 compare_symbols (const void *ap, const void *bp)
703 {
704 const asymbol *a = * (const asymbol **) ap;
705 const asymbol *b = * (const asymbol **) bp;
706 const char *an;
707 const char *bn;
708 size_t anl;
709 size_t bnl;
710 bfd_boolean af;
711 bfd_boolean bf;
712 flagword aflags;
713 flagword bflags;
714
715 if (bfd_asymbol_value (a) > bfd_asymbol_value (b))
716 return 1;
717 else if (bfd_asymbol_value (a) < bfd_asymbol_value (b))
718 return -1;
719
720 if (a->section > b->section)
721 return 1;
722 else if (a->section < b->section)
723 return -1;
724
725 an = bfd_asymbol_name (a);
726 bn = bfd_asymbol_name (b);
727 anl = strlen (an);
728 bnl = strlen (bn);
729
730 /* The symbols gnu_compiled and gcc2_compiled convey no real
731 information, so put them after other symbols with the same value. */
732 af = (strstr (an, "gnu_compiled") != NULL
733 || strstr (an, "gcc2_compiled") != NULL);
734 bf = (strstr (bn, "gnu_compiled") != NULL
735 || strstr (bn, "gcc2_compiled") != NULL);
736
737 if (af && ! bf)
738 return 1;
739 if (! af && bf)
740 return -1;
741
742 /* We use a heuristic for the file name, to try to sort it after
743 more useful symbols. It may not work on non Unix systems, but it
744 doesn't really matter; the only difference is precisely which
745 symbol names get printed. */
746
747 #define file_symbol(s, sn, snl) \
748 (((s)->flags & BSF_FILE) != 0 \
749 || ((sn)[(snl) - 2] == '.' \
750 && ((sn)[(snl) - 1] == 'o' \
751 || (sn)[(snl) - 1] == 'a')))
752
753 af = file_symbol (a, an, anl);
754 bf = file_symbol (b, bn, bnl);
755
756 if (af && ! bf)
757 return 1;
758 if (! af && bf)
759 return -1;
760
761 /* Try to sort global symbols before local symbols before function
762 symbols before debugging symbols. */
763
764 aflags = a->flags;
765 bflags = b->flags;
766
767 if ((aflags & BSF_DEBUGGING) != (bflags & BSF_DEBUGGING))
768 {
769 if ((aflags & BSF_DEBUGGING) != 0)
770 return 1;
771 else
772 return -1;
773 }
774 if ((aflags & BSF_FUNCTION) != (bflags & BSF_FUNCTION))
775 {
776 if ((aflags & BSF_FUNCTION) != 0)
777 return -1;
778 else
779 return 1;
780 }
781 if ((aflags & BSF_LOCAL) != (bflags & BSF_LOCAL))
782 {
783 if ((aflags & BSF_LOCAL) != 0)
784 return 1;
785 else
786 return -1;
787 }
788 if ((aflags & BSF_GLOBAL) != (bflags & BSF_GLOBAL))
789 {
790 if ((aflags & BSF_GLOBAL) != 0)
791 return -1;
792 else
793 return 1;
794 }
795
796 if (bfd_get_flavour (bfd_asymbol_bfd (a)) == bfd_target_elf_flavour
797 && bfd_get_flavour (bfd_asymbol_bfd (b)) == bfd_target_elf_flavour)
798 {
799 bfd_vma asz, bsz;
800
801 asz = 0;
802 if ((a->flags & BSF_SYNTHETIC) == 0)
803 asz = ((elf_symbol_type *) a)->internal_elf_sym.st_size;
804 bsz = 0;
805 if ((b->flags & BSF_SYNTHETIC) == 0)
806 bsz = ((elf_symbol_type *) b)->internal_elf_sym.st_size;
807 if (asz != bsz)
808 return asz > bsz ? -1 : 1;
809 }
810
811 /* Symbols that start with '.' might be section names, so sort them
812 after symbols that don't start with '.'. */
813 if (an[0] == '.' && bn[0] != '.')
814 return 1;
815 if (an[0] != '.' && bn[0] == '.')
816 return -1;
817
818 /* Finally, if we can't distinguish them in any other way, try to
819 get consistent results by sorting the symbols by name. */
820 return strcmp (an, bn);
821 }
822
823 /* Sort relocs into address order. */
824
825 static int
826 compare_relocs (const void *ap, const void *bp)
827 {
828 const arelent *a = * (const arelent **) ap;
829 const arelent *b = * (const arelent **) bp;
830
831 if (a->address > b->address)
832 return 1;
833 else if (a->address < b->address)
834 return -1;
835
836 /* So that associated relocations tied to the same address show up
837 in the correct order, we don't do any further sorting. */
838 if (a > b)
839 return 1;
840 else if (a < b)
841 return -1;
842 else
843 return 0;
844 }
845
846 /* Print an address (VMA) to the output stream in INFO.
847 If SKIP_ZEROES is TRUE, omit leading zeroes. */
848
849 static void
850 objdump_print_value (bfd_vma vma, struct disassemble_info *inf,
851 bfd_boolean skip_zeroes)
852 {
853 char buf[30];
854 char *p;
855 struct objdump_disasm_info *aux;
856
857 aux = (struct objdump_disasm_info *) inf->application_data;
858 bfd_sprintf_vma (aux->abfd, buf, vma);
859 if (! skip_zeroes)
860 p = buf;
861 else
862 {
863 for (p = buf; *p == '0'; ++p)
864 ;
865 if (*p == '\0')
866 --p;
867 }
868 (*inf->fprintf_func) (inf->stream, "%s", p);
869 }
870
871 /* Print the name of a symbol. */
872
873 static void
874 objdump_print_symname (bfd *abfd, struct disassemble_info *inf,
875 asymbol *sym)
876 {
877 char *alloc;
878 const char *name, *version_string = NULL;
879 bfd_boolean hidden = FALSE;
880
881 alloc = NULL;
882 name = bfd_asymbol_name (sym);
883 if (do_demangle && name[0] != '\0')
884 {
885 /* Demangle the name. */
886 alloc = bfd_demangle (abfd, name, DMGL_ANSI | DMGL_PARAMS);
887 if (alloc != NULL)
888 name = alloc;
889 }
890
891 if ((sym->flags & BSF_SYNTHETIC) == 0)
892 version_string = bfd_get_symbol_version_string (abfd, sym, &hidden);
893
894 if (bfd_is_und_section (bfd_get_section (sym)))
895 hidden = TRUE;
896
897 if (inf != NULL)
898 {
899 (*inf->fprintf_func) (inf->stream, "%s", name);
900 if (version_string && *version_string != '\0')
901 (*inf->fprintf_func) (inf->stream, hidden ? "@%s" : "@@%s",
902 version_string);
903 }
904 else
905 {
906 printf ("%s", name);
907 if (version_string && *version_string != '\0')
908 printf (hidden ? "@%s" : "@@%s", version_string);
909 }
910
911 if (alloc != NULL)
912 free (alloc);
913 }
914
915 /* Locate a symbol given a bfd and a section (from INFO->application_data),
916 and a VMA. If INFO->application_data->require_sec is TRUE, then always
917 require the symbol to be in the section. Returns NULL if there is no
918 suitable symbol. If PLACE is not NULL, then *PLACE is set to the index
919 of the symbol in sorted_syms. */
920
921 static asymbol *
922 find_symbol_for_address (bfd_vma vma,
923 struct disassemble_info *inf,
924 long *place)
925 {
926 /* @@ Would it speed things up to cache the last two symbols returned,
927 and maybe their address ranges? For many processors, only one memory
928 operand can be present at a time, so the 2-entry cache wouldn't be
929 constantly churned by code doing heavy memory accesses. */
930
931 /* Indices in `sorted_syms'. */
932 long min = 0;
933 long max_count = sorted_symcount;
934 long thisplace;
935 struct objdump_disasm_info *aux;
936 bfd *abfd;
937 asection *sec;
938 unsigned int opb;
939 bfd_boolean want_section;
940
941 if (sorted_symcount < 1)
942 return NULL;
943
944 aux = (struct objdump_disasm_info *) inf->application_data;
945 abfd = aux->abfd;
946 sec = aux->sec;
947 opb = inf->octets_per_byte;
948
949 /* Perform a binary search looking for the closest symbol to the
950 required value. We are searching the range (min, max_count]. */
951 while (min + 1 < max_count)
952 {
953 asymbol *sym;
954
955 thisplace = (max_count + min) / 2;
956 sym = sorted_syms[thisplace];
957
958 if (bfd_asymbol_value (sym) > vma)
959 max_count = thisplace;
960 else if (bfd_asymbol_value (sym) < vma)
961 min = thisplace;
962 else
963 {
964 min = thisplace;
965 break;
966 }
967 }
968
969 /* The symbol we want is now in min, the low end of the range we
970 were searching. If there are several symbols with the same
971 value, we want the first (non-section/non-debugging) one. */
972 thisplace = min;
973 while (thisplace > 0
974 && (bfd_asymbol_value (sorted_syms[thisplace])
975 == bfd_asymbol_value (sorted_syms[thisplace - 1]))
976 && ((sorted_syms[thisplace - 1]->flags
977 & (BSF_SECTION_SYM | BSF_DEBUGGING)) == 0)
978 )
979 --thisplace;
980
981 /* Prefer a symbol in the current section if we have multple symbols
982 with the same value, as can occur with overlays or zero size
983 sections. */
984 min = thisplace;
985 while (min < max_count
986 && (bfd_asymbol_value (sorted_syms[min])
987 == bfd_asymbol_value (sorted_syms[thisplace])))
988 {
989 if (sorted_syms[min]->section == sec
990 && inf->symbol_is_valid (sorted_syms[min], inf))
991 {
992 thisplace = min;
993
994 if (place != NULL)
995 *place = thisplace;
996
997 return sorted_syms[thisplace];
998 }
999 ++min;
1000 }
1001
1002 /* If the file is relocatable, and the symbol could be from this
1003 section, prefer a symbol from this section over symbols from
1004 others, even if the other symbol's value might be closer.
1005
1006 Note that this may be wrong for some symbol references if the
1007 sections have overlapping memory ranges, but in that case there's
1008 no way to tell what's desired without looking at the relocation
1009 table.
1010
1011 Also give the target a chance to reject symbols. */
1012 want_section = (aux->require_sec
1013 || ((abfd->flags & HAS_RELOC) != 0
1014 && vma >= bfd_get_section_vma (abfd, sec)
1015 && vma < (bfd_get_section_vma (abfd, sec)
1016 + bfd_section_size (abfd, sec) / opb)));
1017 if ((sorted_syms[thisplace]->section != sec && want_section)
1018 || ! inf->symbol_is_valid (sorted_syms[thisplace], inf))
1019 {
1020 long i;
1021 long newplace = sorted_symcount;
1022
1023 for (i = min - 1; i >= 0; i--)
1024 {
1025 if ((sorted_syms[i]->section == sec || !want_section)
1026 && inf->symbol_is_valid (sorted_syms[i], inf))
1027 {
1028 if (newplace == sorted_symcount)
1029 newplace = i;
1030
1031 if (bfd_asymbol_value (sorted_syms[i])
1032 != bfd_asymbol_value (sorted_syms[newplace]))
1033 break;
1034
1035 /* Remember this symbol and keep searching until we reach
1036 an earlier address. */
1037 newplace = i;
1038 }
1039 }
1040
1041 if (newplace != sorted_symcount)
1042 thisplace = newplace;
1043 else
1044 {
1045 /* We didn't find a good symbol with a smaller value.
1046 Look for one with a larger value. */
1047 for (i = thisplace + 1; i < sorted_symcount; i++)
1048 {
1049 if ((sorted_syms[i]->section == sec || !want_section)
1050 && inf->symbol_is_valid (sorted_syms[i], inf))
1051 {
1052 thisplace = i;
1053 break;
1054 }
1055 }
1056 }
1057
1058 if ((sorted_syms[thisplace]->section != sec && want_section)
1059 || ! inf->symbol_is_valid (sorted_syms[thisplace], inf))
1060 /* There is no suitable symbol. */
1061 return NULL;
1062 }
1063
1064 /* If we have not found an exact match for the specified address
1065 and we have dynamic relocations available, then we can produce
1066 a better result by matching a relocation to the address and
1067 using the symbol associated with that relocation. */
1068 if (!want_section
1069 && aux->dynrelbuf != NULL
1070 && sorted_syms[thisplace]->value != vma
1071 /* If we have matched a synthetic symbol, then stick with that. */
1072 && (sorted_syms[thisplace]->flags & BSF_SYNTHETIC) == 0)
1073 {
1074 long rel_count;
1075 arelent ** rel_pp;
1076
1077 for (rel_count = aux->dynrelcount, rel_pp = aux->dynrelbuf;
1078 rel_count--;)
1079 {
1080 arelent * rel = rel_pp[rel_count];
1081
1082 if (rel->address == vma
1083 && rel->sym_ptr_ptr != NULL
1084 /* Absolute relocations do not provide a more helpful symbolic address. */
1085 && ! bfd_is_abs_section ((* rel->sym_ptr_ptr)->section))
1086 {
1087 if (place != NULL)
1088 * place = thisplace;
1089 return * rel->sym_ptr_ptr;
1090 }
1091
1092 /* We are scanning backwards, so if we go below the target address
1093 we have failed. */
1094 if (rel_pp[rel_count]->address < vma)
1095 break;
1096 }
1097 }
1098
1099 if (place != NULL)
1100 *place = thisplace;
1101
1102 return sorted_syms[thisplace];
1103 }
1104
1105 /* Print an address and the offset to the nearest symbol. */
1106
1107 static void
1108 objdump_print_addr_with_sym (bfd *abfd, asection *sec, asymbol *sym,
1109 bfd_vma vma, struct disassemble_info *inf,
1110 bfd_boolean skip_zeroes)
1111 {
1112 objdump_print_value (vma, inf, skip_zeroes);
1113
1114 if (sym == NULL)
1115 {
1116 bfd_vma secaddr;
1117
1118 (*inf->fprintf_func) (inf->stream, " <%s",
1119 bfd_get_section_name (abfd, sec));
1120 secaddr = bfd_get_section_vma (abfd, sec);
1121 if (vma < secaddr)
1122 {
1123 (*inf->fprintf_func) (inf->stream, "-0x");
1124 objdump_print_value (secaddr - vma, inf, TRUE);
1125 }
1126 else if (vma > secaddr)
1127 {
1128 (*inf->fprintf_func) (inf->stream, "+0x");
1129 objdump_print_value (vma - secaddr, inf, TRUE);
1130 }
1131 (*inf->fprintf_func) (inf->stream, ">");
1132 }
1133 else
1134 {
1135 (*inf->fprintf_func) (inf->stream, " <");
1136
1137 objdump_print_symname (abfd, inf, sym);
1138
1139 if (bfd_asymbol_value (sym) == vma)
1140 ;
1141 /* Undefined symbols in an executables and dynamic objects do not have
1142 a value associated with them, so it does not make sense to display
1143 an offset relative to them. Normally we would not be provided with
1144 this kind of symbol, but the target backend might choose to do so,
1145 and the code in find_symbol_for_address might return an as yet
1146 unresolved symbol associated with a dynamic reloc. */
1147 else if ((bfd_get_file_flags (abfd) & (EXEC_P | DYNAMIC))
1148 && bfd_is_und_section (sym->section))
1149 ;
1150 else if (bfd_asymbol_value (sym) > vma)
1151 {
1152 (*inf->fprintf_func) (inf->stream, "-0x");
1153 objdump_print_value (bfd_asymbol_value (sym) - vma, inf, TRUE);
1154 }
1155 else if (vma > bfd_asymbol_value (sym))
1156 {
1157 (*inf->fprintf_func) (inf->stream, "+0x");
1158 objdump_print_value (vma - bfd_asymbol_value (sym), inf, TRUE);
1159 }
1160
1161 (*inf->fprintf_func) (inf->stream, ">");
1162 }
1163
1164 if (display_file_offsets)
1165 inf->fprintf_func (inf->stream, _(" (File Offset: 0x%lx)"),
1166 (long int)(sec->filepos + (vma - sec->vma)));
1167 }
1168
1169 /* Print an address (VMA), symbolically if possible.
1170 If SKIP_ZEROES is TRUE, don't output leading zeroes. */
1171
1172 static void
1173 objdump_print_addr (bfd_vma vma,
1174 struct disassemble_info *inf,
1175 bfd_boolean skip_zeroes)
1176 {
1177 struct objdump_disasm_info *aux;
1178 asymbol *sym = NULL;
1179 bfd_boolean skip_find = FALSE;
1180
1181 aux = (struct objdump_disasm_info *) inf->application_data;
1182
1183 if (sorted_symcount < 1)
1184 {
1185 (*inf->fprintf_func) (inf->stream, "0x");
1186 objdump_print_value (vma, inf, skip_zeroes);
1187
1188 if (display_file_offsets)
1189 inf->fprintf_func (inf->stream, _(" (File Offset: 0x%lx)"),
1190 (long int)(aux->sec->filepos + (vma - aux->sec->vma)));
1191 return;
1192 }
1193
1194 if (aux->reloc != NULL
1195 && aux->reloc->sym_ptr_ptr != NULL
1196 && * aux->reloc->sym_ptr_ptr != NULL)
1197 {
1198 sym = * aux->reloc->sym_ptr_ptr;
1199
1200 /* Adjust the vma to the reloc. */
1201 vma += bfd_asymbol_value (sym);
1202
1203 if (bfd_is_und_section (bfd_get_section (sym)))
1204 skip_find = TRUE;
1205 }
1206
1207 if (!skip_find)
1208 sym = find_symbol_for_address (vma, inf, NULL);
1209
1210 objdump_print_addr_with_sym (aux->abfd, aux->sec, sym, vma, inf,
1211 skip_zeroes);
1212 }
1213
1214 /* Print VMA to INFO. This function is passed to the disassembler
1215 routine. */
1216
1217 static void
1218 objdump_print_address (bfd_vma vma, struct disassemble_info *inf)
1219 {
1220 objdump_print_addr (vma, inf, ! prefix_addresses);
1221 }
1222
1223 /* Determine if the given address has a symbol associated with it. */
1224
1225 static int
1226 objdump_symbol_at_address (bfd_vma vma, struct disassemble_info * inf)
1227 {
1228 asymbol * sym;
1229
1230 sym = find_symbol_for_address (vma, inf, NULL);
1231
1232 return (sym != NULL && (bfd_asymbol_value (sym) == vma));
1233 }
1234
1235 /* Hold the last function name and the last line number we displayed
1236 in a disassembly. */
1237
1238 static char *prev_functionname;
1239 static unsigned int prev_line;
1240 static unsigned int prev_discriminator;
1241
1242 /* We keep a list of all files that we have seen when doing a
1243 disassembly with source, so that we know how much of the file to
1244 display. This can be important for inlined functions. */
1245
1246 struct print_file_list
1247 {
1248 struct print_file_list *next;
1249 const char *filename;
1250 const char *modname;
1251 const char *map;
1252 size_t mapsize;
1253 const char **linemap;
1254 unsigned maxline;
1255 unsigned last_line;
1256 unsigned max_printed;
1257 int first;
1258 };
1259
1260 static struct print_file_list *print_files;
1261
1262 /* The number of preceding context lines to show when we start
1263 displaying a file for the first time. */
1264
1265 #define SHOW_PRECEDING_CONTEXT_LINES (5)
1266
1267 /* Read a complete file into memory. */
1268
1269 static const char *
1270 slurp_file (const char *fn, size_t *size, struct stat *fst)
1271 {
1272 #ifdef HAVE_MMAP
1273 int ps = getpagesize ();
1274 size_t msize;
1275 #endif
1276 const char *map;
1277 int fd = open (fn, O_RDONLY | O_BINARY);
1278
1279 if (fd < 0)
1280 return NULL;
1281 if (fstat (fd, fst) < 0)
1282 {
1283 close (fd);
1284 return NULL;
1285 }
1286 *size = fst->st_size;
1287 #ifdef HAVE_MMAP
1288 msize = (*size + ps - 1) & ~(ps - 1);
1289 map = mmap (NULL, msize, PROT_READ, MAP_SHARED, fd, 0);
1290 if (map != (char *) -1L)
1291 {
1292 close (fd);
1293 return map;
1294 }
1295 #endif
1296 map = (const char *) malloc (*size);
1297 if (!map || (size_t) read (fd, (char *) map, *size) != *size)
1298 {
1299 free ((void *) map);
1300 map = NULL;
1301 }
1302 close (fd);
1303 return map;
1304 }
1305
1306 #define line_map_decrease 5
1307
1308 /* Precompute array of lines for a mapped file. */
1309
1310 static const char **
1311 index_file (const char *map, size_t size, unsigned int *maxline)
1312 {
1313 const char *p, *lstart, *end;
1314 int chars_per_line = 45; /* First iteration will use 40. */
1315 unsigned int lineno;
1316 const char **linemap = NULL;
1317 unsigned long line_map_size = 0;
1318
1319 lineno = 0;
1320 lstart = map;
1321 end = map + size;
1322
1323 for (p = map; p < end; p++)
1324 {
1325 if (*p == '\n')
1326 {
1327 if (p + 1 < end && p[1] == '\r')
1328 p++;
1329 }
1330 else if (*p == '\r')
1331 {
1332 if (p + 1 < end && p[1] == '\n')
1333 p++;
1334 }
1335 else
1336 continue;
1337
1338 /* End of line found. */
1339
1340 if (linemap == NULL || line_map_size < lineno + 1)
1341 {
1342 unsigned long newsize;
1343
1344 chars_per_line -= line_map_decrease;
1345 if (chars_per_line <= 1)
1346 chars_per_line = 1;
1347 line_map_size = size / chars_per_line + 1;
1348 if (line_map_size < lineno + 1)
1349 line_map_size = lineno + 1;
1350 newsize = line_map_size * sizeof (char *);
1351 linemap = (const char **) xrealloc (linemap, newsize);
1352 }
1353
1354 linemap[lineno++] = lstart;
1355 lstart = p + 1;
1356 }
1357
1358 *maxline = lineno;
1359 return linemap;
1360 }
1361
1362 /* Tries to open MODNAME, and if successful adds a node to print_files
1363 linked list and returns that node. Returns NULL on failure. */
1364
1365 static struct print_file_list *
1366 try_print_file_open (const char *origname, const char *modname, struct stat *fst)
1367 {
1368 struct print_file_list *p;
1369
1370 p = (struct print_file_list *) xmalloc (sizeof (struct print_file_list));
1371
1372 p->map = slurp_file (modname, &p->mapsize, fst);
1373 if (p->map == NULL)
1374 {
1375 free (p);
1376 return NULL;
1377 }
1378
1379 p->linemap = index_file (p->map, p->mapsize, &p->maxline);
1380 p->last_line = 0;
1381 p->max_printed = 0;
1382 p->filename = origname;
1383 p->modname = modname;
1384 p->next = print_files;
1385 p->first = 1;
1386 print_files = p;
1387 return p;
1388 }
1389
1390 /* If the source file, as described in the symtab, is not found
1391 try to locate it in one of the paths specified with -I
1392 If found, add location to print_files linked list. */
1393
1394 static struct print_file_list *
1395 update_source_path (const char *filename, bfd *abfd)
1396 {
1397 struct print_file_list *p;
1398 const char *fname;
1399 struct stat fst;
1400 int i;
1401
1402 p = try_print_file_open (filename, filename, &fst);
1403 if (p == NULL)
1404 {
1405 if (include_path_count == 0)
1406 return NULL;
1407
1408 /* Get the name of the file. */
1409 fname = lbasename (filename);
1410
1411 /* If file exists under a new path, we need to add it to the list
1412 so that show_line knows about it. */
1413 for (i = 0; i < include_path_count; i++)
1414 {
1415 char *modname = concat (include_paths[i], "/", fname,
1416 (const char *) 0);
1417
1418 p = try_print_file_open (filename, modname, &fst);
1419 if (p)
1420 break;
1421
1422 free (modname);
1423 }
1424 }
1425
1426 if (p != NULL)
1427 {
1428 long mtime = bfd_get_mtime (abfd);
1429
1430 if (fst.st_mtime > mtime)
1431 warn (_("source file %s is more recent than object file\n"),
1432 filename);
1433 }
1434
1435 return p;
1436 }
1437
1438 /* Print a source file line. */
1439
1440 static void
1441 print_line (struct print_file_list *p, unsigned int linenum)
1442 {
1443 const char *l;
1444 size_t len;
1445
1446 --linenum;
1447 if (linenum >= p->maxline)
1448 return;
1449 l = p->linemap [linenum];
1450 /* Test fwrite return value to quiet glibc warning. */
1451 len = strcspn (l, "\n\r");
1452 if (len == 0 || fwrite (l, len, 1, stdout) == 1)
1453 putchar ('\n');
1454 }
1455
1456 /* Print a range of source code lines. */
1457
1458 static void
1459 dump_lines (struct print_file_list *p, unsigned int start, unsigned int end)
1460 {
1461 if (p->map == NULL)
1462 return;
1463 while (start <= end)
1464 {
1465 print_line (p, start);
1466 start++;
1467 }
1468 }
1469
1470 /* Show the line number, or the source line, in a disassembly
1471 listing. */
1472
1473 static void
1474 show_line (bfd *abfd, asection *section, bfd_vma addr_offset)
1475 {
1476 const char *filename;
1477 const char *functionname;
1478 unsigned int linenumber;
1479 unsigned int discriminator;
1480 bfd_boolean reloc;
1481 char *path = NULL;
1482
1483 if (! with_line_numbers && ! with_source_code)
1484 return;
1485
1486 if (! bfd_find_nearest_line_discriminator (abfd, section, syms, addr_offset,
1487 &filename, &functionname,
1488 &linenumber, &discriminator))
1489 return;
1490
1491 if (filename != NULL && *filename == '\0')
1492 filename = NULL;
1493 if (functionname != NULL && *functionname == '\0')
1494 functionname = NULL;
1495
1496 if (filename
1497 && IS_ABSOLUTE_PATH (filename)
1498 && prefix)
1499 {
1500 char *path_up;
1501 const char *fname = filename;
1502
1503 path = xmalloc (prefix_length + PATH_MAX + 1);
1504
1505 if (prefix_length)
1506 memcpy (path, prefix, prefix_length);
1507 path_up = path + prefix_length;
1508
1509 /* Build relocated filename, stripping off leading directories
1510 from the initial filename if requested. */
1511 if (prefix_strip > 0)
1512 {
1513 int level = 0;
1514 const char *s;
1515
1516 /* Skip selected directory levels. */
1517 for (s = fname + 1; *s != '\0' && level < prefix_strip; s++)
1518 if (IS_DIR_SEPARATOR(*s))
1519 {
1520 fname = s;
1521 level++;
1522 }
1523 }
1524
1525 /* Update complete filename. */
1526 strncpy (path_up, fname, PATH_MAX);
1527 path_up[PATH_MAX] = '\0';
1528
1529 filename = path;
1530 reloc = TRUE;
1531 }
1532 else
1533 reloc = FALSE;
1534
1535 if (with_line_numbers)
1536 {
1537 if (functionname != NULL
1538 && (prev_functionname == NULL
1539 || strcmp (functionname, prev_functionname) != 0))
1540 printf ("%s():\n", functionname);
1541 if (linenumber > 0 && (linenumber != prev_line ||
1542 (discriminator != prev_discriminator)))
1543 {
1544 if (discriminator > 0)
1545 printf ("%s:%u (discriminator %u)\n", filename == NULL ? "???" : filename,
1546 linenumber, discriminator);
1547 else
1548 printf ("%s:%u\n", filename == NULL ? "???" : filename, linenumber);
1549 }
1550 if (unwind_inlines)
1551 {
1552 const char *filename2;
1553 const char *functionname2;
1554 unsigned line2;
1555
1556 while (bfd_find_inliner_info (abfd, &filename2, &functionname2,
1557 &line2))
1558 printf ("inlined by %s:%u (%s)\n", filename2, line2,
1559 functionname2);
1560 }
1561 }
1562
1563 if (with_source_code
1564 && filename != NULL
1565 && linenumber > 0)
1566 {
1567 struct print_file_list **pp, *p;
1568 unsigned l;
1569
1570 for (pp = &print_files; *pp != NULL; pp = &(*pp)->next)
1571 if (filename_cmp ((*pp)->filename, filename) == 0)
1572 break;
1573 p = *pp;
1574
1575 if (p == NULL)
1576 {
1577 if (reloc)
1578 filename = xstrdup (filename);
1579 p = update_source_path (filename, abfd);
1580 }
1581
1582 if (p != NULL && linenumber != p->last_line)
1583 {
1584 if (file_start_context && p->first)
1585 l = 1;
1586 else
1587 {
1588 l = linenumber - SHOW_PRECEDING_CONTEXT_LINES;
1589 if (l >= linenumber)
1590 l = 1;
1591 if (p->max_printed >= l)
1592 {
1593 if (p->max_printed < linenumber)
1594 l = p->max_printed + 1;
1595 else
1596 l = linenumber;
1597 }
1598 }
1599 dump_lines (p, l, linenumber);
1600 if (p->max_printed < linenumber)
1601 p->max_printed = linenumber;
1602 p->last_line = linenumber;
1603 p->first = 0;
1604 }
1605 }
1606
1607 if (functionname != NULL
1608 && (prev_functionname == NULL
1609 || strcmp (functionname, prev_functionname) != 0))
1610 {
1611 if (prev_functionname != NULL)
1612 free (prev_functionname);
1613 prev_functionname = (char *) xmalloc (strlen (functionname) + 1);
1614 strcpy (prev_functionname, functionname);
1615 }
1616
1617 if (linenumber > 0 && linenumber != prev_line)
1618 prev_line = linenumber;
1619
1620 if (discriminator != prev_discriminator)
1621 prev_discriminator = discriminator;
1622
1623 if (path)
1624 free (path);
1625 }
1626
1627 /* Pseudo FILE object for strings. */
1628 typedef struct
1629 {
1630 char *buffer;
1631 size_t pos;
1632 size_t alloc;
1633 } SFILE;
1634
1635 /* sprintf to a "stream". */
1636
1637 static int ATTRIBUTE_PRINTF_2
1638 objdump_sprintf (SFILE *f, const char *format, ...)
1639 {
1640 size_t n;
1641 va_list args;
1642
1643 while (1)
1644 {
1645 size_t space = f->alloc - f->pos;
1646
1647 va_start (args, format);
1648 n = vsnprintf (f->buffer + f->pos, space, format, args);
1649 va_end (args);
1650
1651 if (space > n)
1652 break;
1653
1654 f->alloc = (f->alloc + n) * 2;
1655 f->buffer = (char *) xrealloc (f->buffer, f->alloc);
1656 }
1657 f->pos += n;
1658
1659 return n;
1660 }
1661
1662 /* The number of zeroes we want to see before we start skipping them.
1663 The number is arbitrarily chosen. */
1664
1665 #define DEFAULT_SKIP_ZEROES 8
1666
1667 /* The number of zeroes to skip at the end of a section. If the
1668 number of zeroes at the end is between SKIP_ZEROES_AT_END and
1669 SKIP_ZEROES, they will be disassembled. If there are fewer than
1670 SKIP_ZEROES_AT_END, they will be skipped. This is a heuristic
1671 attempt to avoid disassembling zeroes inserted by section
1672 alignment. */
1673
1674 #define DEFAULT_SKIP_ZEROES_AT_END 3
1675
1676 /* Disassemble some data in memory between given values. */
1677
1678 static void
1679 disassemble_bytes (struct disassemble_info * inf,
1680 disassembler_ftype disassemble_fn,
1681 bfd_boolean insns,
1682 bfd_byte * data,
1683 bfd_vma start_offset,
1684 bfd_vma stop_offset,
1685 bfd_vma rel_offset,
1686 arelent *** relppp,
1687 arelent ** relppend)
1688 {
1689 struct objdump_disasm_info *aux;
1690 asection *section;
1691 int octets_per_line;
1692 int skip_addr_chars;
1693 bfd_vma addr_offset;
1694 unsigned int opb = inf->octets_per_byte;
1695 unsigned int skip_zeroes = inf->skip_zeroes;
1696 unsigned int skip_zeroes_at_end = inf->skip_zeroes_at_end;
1697 int octets = opb;
1698 SFILE sfile;
1699
1700 aux = (struct objdump_disasm_info *) inf->application_data;
1701 section = aux->sec;
1702
1703 sfile.alloc = 120;
1704 sfile.buffer = (char *) xmalloc (sfile.alloc);
1705 sfile.pos = 0;
1706
1707 if (insn_width)
1708 octets_per_line = insn_width;
1709 else if (insns)
1710 octets_per_line = 4;
1711 else
1712 octets_per_line = 16;
1713
1714 /* Figure out how many characters to skip at the start of an
1715 address, to make the disassembly look nicer. We discard leading
1716 zeroes in chunks of 4, ensuring that there is always a leading
1717 zero remaining. */
1718 skip_addr_chars = 0;
1719 if (! prefix_addresses)
1720 {
1721 char buf[30];
1722
1723 bfd_sprintf_vma (aux->abfd, buf, section->vma + section->size / opb);
1724
1725 while (buf[skip_addr_chars] == '0')
1726 ++skip_addr_chars;
1727
1728 /* Don't discard zeros on overflow. */
1729 if (buf[skip_addr_chars] == '\0' && section->vma != 0)
1730 skip_addr_chars = 0;
1731
1732 if (skip_addr_chars != 0)
1733 skip_addr_chars = (skip_addr_chars - 1) & -4;
1734 }
1735
1736 inf->insn_info_valid = 0;
1737
1738 addr_offset = start_offset;
1739 while (addr_offset < stop_offset)
1740 {
1741 bfd_vma z;
1742 bfd_boolean need_nl = FALSE;
1743 int previous_octets;
1744
1745 /* Remember the length of the previous instruction. */
1746 previous_octets = octets;
1747 octets = 0;
1748
1749 /* Make sure we don't use relocs from previous instructions. */
1750 aux->reloc = NULL;
1751
1752 /* If we see more than SKIP_ZEROES octets of zeroes, we just
1753 print `...'. */
1754 for (z = addr_offset * opb; z < stop_offset * opb; z++)
1755 if (data[z] != 0)
1756 break;
1757 if (! disassemble_zeroes
1758 && (inf->insn_info_valid == 0
1759 || inf->branch_delay_insns == 0)
1760 && (z - addr_offset * opb >= skip_zeroes
1761 || (z == stop_offset * opb &&
1762 z - addr_offset * opb < skip_zeroes_at_end)))
1763 {
1764 /* If there are more nonzero octets to follow, we only skip
1765 zeroes in multiples of 4, to try to avoid running over
1766 the start of an instruction which happens to start with
1767 zero. */
1768 if (z != stop_offset * opb)
1769 z = addr_offset * opb + ((z - addr_offset * opb) &~ 3);
1770
1771 octets = z - addr_offset * opb;
1772
1773 /* If we are going to display more data, and we are displaying
1774 file offsets, then tell the user how many zeroes we skip
1775 and the file offset from where we resume dumping. */
1776 if (display_file_offsets && ((addr_offset + (octets / opb)) < stop_offset))
1777 printf ("\t... (skipping %d zeroes, resuming at file offset: 0x%lx)\n",
1778 octets / opb,
1779 (unsigned long) (section->filepos
1780 + (addr_offset + (octets / opb))));
1781 else
1782 printf ("\t...\n");
1783 }
1784 else
1785 {
1786 char buf[50];
1787 int bpc = 0;
1788 int pb = 0;
1789
1790 if (with_line_numbers || with_source_code)
1791 show_line (aux->abfd, section, addr_offset);
1792
1793 if (! prefix_addresses)
1794 {
1795 char *s;
1796
1797 bfd_sprintf_vma (aux->abfd, buf, section->vma + addr_offset);
1798 for (s = buf + skip_addr_chars; *s == '0'; s++)
1799 *s = ' ';
1800 if (*s == '\0')
1801 *--s = '0';
1802 printf ("%s:\t", buf + skip_addr_chars);
1803 }
1804 else
1805 {
1806 aux->require_sec = TRUE;
1807 objdump_print_address (section->vma + addr_offset, inf);
1808 aux->require_sec = FALSE;
1809 putchar (' ');
1810 }
1811
1812 if (insns)
1813 {
1814 sfile.pos = 0;
1815 inf->fprintf_func = (fprintf_ftype) objdump_sprintf;
1816 inf->stream = &sfile;
1817 inf->bytes_per_line = 0;
1818 inf->bytes_per_chunk = 0;
1819 inf->flags = disassemble_all ? DISASSEMBLE_DATA : 0;
1820 if (machine)
1821 inf->flags |= USER_SPECIFIED_MACHINE_TYPE;
1822
1823 if (inf->disassembler_needs_relocs
1824 && (bfd_get_file_flags (aux->abfd) & EXEC_P) == 0
1825 && (bfd_get_file_flags (aux->abfd) & DYNAMIC) == 0
1826 && *relppp < relppend)
1827 {
1828 bfd_signed_vma distance_to_rel;
1829
1830 distance_to_rel = (**relppp)->address
1831 - (rel_offset + addr_offset);
1832
1833 /* Check to see if the current reloc is associated with
1834 the instruction that we are about to disassemble. */
1835 if (distance_to_rel == 0
1836 /* FIXME: This is wrong. We are trying to catch
1837 relocs that are addressed part way through the
1838 current instruction, as might happen with a packed
1839 VLIW instruction. Unfortunately we do not know the
1840 length of the current instruction since we have not
1841 disassembled it yet. Instead we take a guess based
1842 upon the length of the previous instruction. The
1843 proper solution is to have a new target-specific
1844 disassembler function which just returns the length
1845 of an instruction at a given address without trying
1846 to display its disassembly. */
1847 || (distance_to_rel > 0
1848 && distance_to_rel < (bfd_signed_vma) (previous_octets/ opb)))
1849 {
1850 inf->flags |= INSN_HAS_RELOC;
1851 aux->reloc = **relppp;
1852 }
1853 }
1854
1855 if (! disassemble_all
1856 && (section->flags & (SEC_CODE | SEC_HAS_CONTENTS))
1857 == (SEC_CODE | SEC_HAS_CONTENTS))
1858 /* Set a stop_vma so that the disassembler will not read
1859 beyond the next symbol. We assume that symbols appear on
1860 the boundaries between instructions. We only do this when
1861 disassembling code of course, and when -D is in effect. */
1862 inf->stop_vma = section->vma + stop_offset;
1863
1864 octets = (*disassemble_fn) (section->vma + addr_offset, inf);
1865
1866 inf->stop_vma = 0;
1867 inf->fprintf_func = (fprintf_ftype) fprintf;
1868 inf->stream = stdout;
1869 if (insn_width == 0 && inf->bytes_per_line != 0)
1870 octets_per_line = inf->bytes_per_line;
1871 if (octets < (int) opb)
1872 {
1873 if (sfile.pos)
1874 printf ("%s\n", sfile.buffer);
1875 if (octets >= 0)
1876 {
1877 non_fatal (_("disassemble_fn returned length %d"),
1878 octets);
1879 exit_status = 1;
1880 }
1881 break;
1882 }
1883 }
1884 else
1885 {
1886 bfd_vma j;
1887
1888 octets = octets_per_line;
1889 if (addr_offset + octets / opb > stop_offset)
1890 octets = (stop_offset - addr_offset) * opb;
1891
1892 for (j = addr_offset * opb; j < addr_offset * opb + octets; ++j)
1893 {
1894 if (ISPRINT (data[j]))
1895 buf[j - addr_offset * opb] = data[j];
1896 else
1897 buf[j - addr_offset * opb] = '.';
1898 }
1899 buf[j - addr_offset * opb] = '\0';
1900 }
1901
1902 if (prefix_addresses
1903 ? show_raw_insn > 0
1904 : show_raw_insn >= 0)
1905 {
1906 bfd_vma j;
1907
1908 /* If ! prefix_addresses and ! wide_output, we print
1909 octets_per_line octets per line. */
1910 pb = octets;
1911 if (pb > octets_per_line && ! prefix_addresses && ! wide_output)
1912 pb = octets_per_line;
1913
1914 if (inf->bytes_per_chunk)
1915 bpc = inf->bytes_per_chunk;
1916 else
1917 bpc = 1;
1918
1919 for (j = addr_offset * opb; j < addr_offset * opb + pb; j += bpc)
1920 {
1921 int k;
1922
1923 if (bpc > 1 && inf->display_endian == BFD_ENDIAN_LITTLE)
1924 {
1925 for (k = bpc - 1; k >= 0; k--)
1926 printf ("%02x", (unsigned) data[j + k]);
1927 putchar (' ');
1928 }
1929 else
1930 {
1931 for (k = 0; k < bpc; k++)
1932 printf ("%02x", (unsigned) data[j + k]);
1933 putchar (' ');
1934 }
1935 }
1936
1937 for (; pb < octets_per_line; pb += bpc)
1938 {
1939 int k;
1940
1941 for (k = 0; k < bpc; k++)
1942 printf (" ");
1943 putchar (' ');
1944 }
1945
1946 /* Separate raw data from instruction by extra space. */
1947 if (insns)
1948 putchar ('\t');
1949 else
1950 printf (" ");
1951 }
1952
1953 if (! insns)
1954 printf ("%s", buf);
1955 else if (sfile.pos)
1956 printf ("%s", sfile.buffer);
1957
1958 if (prefix_addresses
1959 ? show_raw_insn > 0
1960 : show_raw_insn >= 0)
1961 {
1962 while (pb < octets)
1963 {
1964 bfd_vma j;
1965 char *s;
1966
1967 putchar ('\n');
1968 j = addr_offset * opb + pb;
1969
1970 bfd_sprintf_vma (aux->abfd, buf, section->vma + j / opb);
1971 for (s = buf + skip_addr_chars; *s == '0'; s++)
1972 *s = ' ';
1973 if (*s == '\0')
1974 *--s = '0';
1975 printf ("%s:\t", buf + skip_addr_chars);
1976
1977 pb += octets_per_line;
1978 if (pb > octets)
1979 pb = octets;
1980 for (; j < addr_offset * opb + pb; j += bpc)
1981 {
1982 int k;
1983
1984 if (bpc > 1 && inf->display_endian == BFD_ENDIAN_LITTLE)
1985 {
1986 for (k = bpc - 1; k >= 0; k--)
1987 printf ("%02x", (unsigned) data[j + k]);
1988 putchar (' ');
1989 }
1990 else
1991 {
1992 for (k = 0; k < bpc; k++)
1993 printf ("%02x", (unsigned) data[j + k]);
1994 putchar (' ');
1995 }
1996 }
1997 }
1998 }
1999
2000 if (!wide_output)
2001 putchar ('\n');
2002 else
2003 need_nl = TRUE;
2004 }
2005
2006 while ((*relppp) < relppend
2007 && (**relppp)->address < rel_offset + addr_offset + octets / opb)
2008 {
2009 if (dump_reloc_info || dump_dynamic_reloc_info)
2010 {
2011 arelent *q;
2012
2013 q = **relppp;
2014
2015 if (wide_output)
2016 putchar ('\t');
2017 else
2018 printf ("\t\t\t");
2019
2020 objdump_print_value (section->vma - rel_offset + q->address,
2021 inf, TRUE);
2022
2023 if (q->howto == NULL)
2024 printf (": *unknown*\t");
2025 else if (q->howto->name)
2026 printf (": %s\t", q->howto->name);
2027 else
2028 printf (": %d\t", q->howto->type);
2029
2030 if (q->sym_ptr_ptr == NULL || *q->sym_ptr_ptr == NULL)
2031 printf ("*unknown*");
2032 else
2033 {
2034 const char *sym_name;
2035
2036 sym_name = bfd_asymbol_name (*q->sym_ptr_ptr);
2037 if (sym_name != NULL && *sym_name != '\0')
2038 objdump_print_symname (aux->abfd, inf, *q->sym_ptr_ptr);
2039 else
2040 {
2041 asection *sym_sec;
2042
2043 sym_sec = bfd_get_section (*q->sym_ptr_ptr);
2044 sym_name = bfd_get_section_name (aux->abfd, sym_sec);
2045 if (sym_name == NULL || *sym_name == '\0')
2046 sym_name = "*unknown*";
2047 printf ("%s", sym_name);
2048 }
2049 }
2050
2051 if (q->addend)
2052 {
2053 bfd_signed_vma addend = q->addend;
2054 if (addend < 0)
2055 {
2056 printf ("-0x");
2057 addend = -addend;
2058 }
2059 else
2060 printf ("+0x");
2061 objdump_print_value (addend, inf, TRUE);
2062 }
2063
2064 printf ("\n");
2065 need_nl = FALSE;
2066 }
2067 ++(*relppp);
2068 }
2069
2070 if (need_nl)
2071 printf ("\n");
2072
2073 addr_offset += octets / opb;
2074 }
2075
2076 free (sfile.buffer);
2077 }
2078
2079 static void
2080 disassemble_section (bfd *abfd, asection *section, void *inf)
2081 {
2082 const struct elf_backend_data * bed;
2083 bfd_vma sign_adjust = 0;
2084 struct disassemble_info * pinfo = (struct disassemble_info *) inf;
2085 struct objdump_disasm_info * paux;
2086 unsigned int opb = pinfo->octets_per_byte;
2087 bfd_byte * data = NULL;
2088 bfd_size_type datasize = 0;
2089 arelent ** rel_pp = NULL;
2090 arelent ** rel_ppstart = NULL;
2091 arelent ** rel_ppend;
2092 bfd_vma stop_offset;
2093 asymbol * sym = NULL;
2094 long place = 0;
2095 long rel_count;
2096 bfd_vma rel_offset;
2097 unsigned long addr_offset;
2098
2099 /* Sections that do not contain machine
2100 code are not normally disassembled. */
2101 if (! disassemble_all
2102 && only_list == NULL
2103 && ((section->flags & (SEC_CODE | SEC_HAS_CONTENTS))
2104 != (SEC_CODE | SEC_HAS_CONTENTS)))
2105 return;
2106
2107 if (! process_section_p (section))
2108 return;
2109
2110 datasize = bfd_get_section_size (section);
2111 if (datasize == 0)
2112 return;
2113
2114 if (start_address == (bfd_vma) -1
2115 || start_address < section->vma)
2116 addr_offset = 0;
2117 else
2118 addr_offset = start_address - section->vma;
2119
2120 if (stop_address == (bfd_vma) -1)
2121 stop_offset = datasize / opb;
2122 else
2123 {
2124 if (stop_address < section->vma)
2125 stop_offset = 0;
2126 else
2127 stop_offset = stop_address - section->vma;
2128 if (stop_offset > datasize / opb)
2129 stop_offset = datasize / opb;
2130 }
2131
2132 if (addr_offset >= stop_offset)
2133 return;
2134
2135 /* Decide which set of relocs to use. Load them if necessary. */
2136 paux = (struct objdump_disasm_info *) pinfo->application_data;
2137 if (paux->dynrelbuf && dump_dynamic_reloc_info)
2138 {
2139 rel_pp = paux->dynrelbuf;
2140 rel_count = paux->dynrelcount;
2141 /* Dynamic reloc addresses are absolute, non-dynamic are section
2142 relative. REL_OFFSET specifies the reloc address corresponding
2143 to the start of this section. */
2144 rel_offset = section->vma;
2145 }
2146 else
2147 {
2148 rel_count = 0;
2149 rel_pp = NULL;
2150 rel_offset = 0;
2151
2152 if ((section->flags & SEC_RELOC) != 0
2153 && (dump_reloc_info || pinfo->disassembler_needs_relocs))
2154 {
2155 long relsize;
2156
2157 relsize = bfd_get_reloc_upper_bound (abfd, section);
2158 if (relsize < 0)
2159 bfd_fatal (bfd_get_filename (abfd));
2160
2161 if (relsize > 0)
2162 {
2163 rel_ppstart = rel_pp = (arelent **) xmalloc (relsize);
2164 rel_count = bfd_canonicalize_reloc (abfd, section, rel_pp, syms);
2165 if (rel_count < 0)
2166 bfd_fatal (bfd_get_filename (abfd));
2167
2168 /* Sort the relocs by address. */
2169 qsort (rel_pp, rel_count, sizeof (arelent *), compare_relocs);
2170 }
2171 }
2172 }
2173 rel_ppend = rel_pp + rel_count;
2174
2175 data = (bfd_byte *) xmalloc (datasize);
2176
2177 bfd_get_section_contents (abfd, section, data, 0, datasize);
2178
2179 paux->sec = section;
2180 pinfo->buffer = data;
2181 pinfo->buffer_vma = section->vma;
2182 pinfo->buffer_length = datasize;
2183 pinfo->section = section;
2184
2185 /* Skip over the relocs belonging to addresses below the
2186 start address. */
2187 while (rel_pp < rel_ppend
2188 && (*rel_pp)->address < rel_offset + addr_offset)
2189 ++rel_pp;
2190
2191 printf (_("\nDisassembly of section %s:\n"), section->name);
2192
2193 /* Find the nearest symbol forwards from our current position. */
2194 paux->require_sec = TRUE;
2195 sym = (asymbol *) find_symbol_for_address (section->vma + addr_offset,
2196 (struct disassemble_info *) inf,
2197 &place);
2198 paux->require_sec = FALSE;
2199
2200 /* PR 9774: If the target used signed addresses then we must make
2201 sure that we sign extend the value that we calculate for 'addr'
2202 in the loop below. */
2203 if (bfd_get_flavour (abfd) == bfd_target_elf_flavour
2204 && (bed = get_elf_backend_data (abfd)) != NULL
2205 && bed->sign_extend_vma)
2206 sign_adjust = (bfd_vma) 1 << (bed->s->arch_size - 1);
2207
2208 /* Disassemble a block of instructions up to the address associated with
2209 the symbol we have just found. Then print the symbol and find the
2210 next symbol on. Repeat until we have disassembled the entire section
2211 or we have reached the end of the address range we are interested in. */
2212 while (addr_offset < stop_offset)
2213 {
2214 bfd_vma addr;
2215 asymbol *nextsym;
2216 bfd_vma nextstop_offset;
2217 bfd_boolean insns;
2218
2219 addr = section->vma + addr_offset;
2220 addr = ((addr & ((sign_adjust << 1) - 1)) ^ sign_adjust) - sign_adjust;
2221
2222 if (sym != NULL && bfd_asymbol_value (sym) <= addr)
2223 {
2224 int x;
2225
2226 for (x = place;
2227 (x < sorted_symcount
2228 && (bfd_asymbol_value (sorted_syms[x]) <= addr));
2229 ++x)
2230 continue;
2231
2232 pinfo->symbols = sorted_syms + place;
2233 pinfo->num_symbols = x - place;
2234 pinfo->symtab_pos = place;
2235 }
2236 else
2237 {
2238 pinfo->symbols = NULL;
2239 pinfo->num_symbols = 0;
2240 pinfo->symtab_pos = -1;
2241 }
2242
2243 if (! prefix_addresses)
2244 {
2245 pinfo->fprintf_func (pinfo->stream, "\n");
2246 objdump_print_addr_with_sym (abfd, section, sym, addr,
2247 pinfo, FALSE);
2248 pinfo->fprintf_func (pinfo->stream, ":\n");
2249 }
2250
2251 if (sym != NULL && bfd_asymbol_value (sym) > addr)
2252 nextsym = sym;
2253 else if (sym == NULL)
2254 nextsym = NULL;
2255 else
2256 {
2257 #define is_valid_next_sym(SYM) \
2258 ((SYM)->section == section \
2259 && (bfd_asymbol_value (SYM) > bfd_asymbol_value (sym)) \
2260 && pinfo->symbol_is_valid (SYM, pinfo))
2261
2262 /* Search forward for the next appropriate symbol in
2263 SECTION. Note that all the symbols are sorted
2264 together into one big array, and that some sections
2265 may have overlapping addresses. */
2266 while (place < sorted_symcount
2267 && ! is_valid_next_sym (sorted_syms [place]))
2268 ++place;
2269
2270 if (place >= sorted_symcount)
2271 nextsym = NULL;
2272 else
2273 nextsym = sorted_syms[place];
2274 }
2275
2276 if (sym != NULL && bfd_asymbol_value (sym) > addr)
2277 nextstop_offset = bfd_asymbol_value (sym) - section->vma;
2278 else if (nextsym == NULL)
2279 nextstop_offset = stop_offset;
2280 else
2281 nextstop_offset = bfd_asymbol_value (nextsym) - section->vma;
2282
2283 if (nextstop_offset > stop_offset
2284 || nextstop_offset <= addr_offset)
2285 nextstop_offset = stop_offset;
2286
2287 /* If a symbol is explicitly marked as being an object
2288 rather than a function, just dump the bytes without
2289 disassembling them. */
2290 if (disassemble_all
2291 || sym == NULL
2292 || sym->section != section
2293 || bfd_asymbol_value (sym) > addr
2294 || ((sym->flags & BSF_OBJECT) == 0
2295 && (strstr (bfd_asymbol_name (sym), "gnu_compiled")
2296 == NULL)
2297 && (strstr (bfd_asymbol_name (sym), "gcc2_compiled")
2298 == NULL))
2299 || (sym->flags & BSF_FUNCTION) != 0)
2300 insns = TRUE;
2301 else
2302 insns = FALSE;
2303
2304 disassemble_bytes (pinfo, paux->disassemble_fn, insns, data,
2305 addr_offset, nextstop_offset,
2306 rel_offset, &rel_pp, rel_ppend);
2307
2308 addr_offset = nextstop_offset;
2309 sym = nextsym;
2310 }
2311
2312 free (data);
2313
2314 if (rel_ppstart != NULL)
2315 free (rel_ppstart);
2316 }
2317
2318 /* Disassemble the contents of an object file. */
2319
2320 static void
2321 disassemble_data (bfd *abfd)
2322 {
2323 struct disassemble_info disasm_info;
2324 struct objdump_disasm_info aux;
2325 long i;
2326
2327 print_files = NULL;
2328 prev_functionname = NULL;
2329 prev_line = -1;
2330 prev_discriminator = 0;
2331
2332 /* We make a copy of syms to sort. We don't want to sort syms
2333 because that will screw up the relocs. */
2334 sorted_symcount = symcount ? symcount : dynsymcount;
2335 sorted_syms = (asymbol **) xmalloc ((sorted_symcount + synthcount)
2336 * sizeof (asymbol *));
2337 memcpy (sorted_syms, symcount ? syms : dynsyms,
2338 sorted_symcount * sizeof (asymbol *));
2339
2340 sorted_symcount = remove_useless_symbols (sorted_syms, sorted_symcount);
2341
2342 for (i = 0; i < synthcount; ++i)
2343 {
2344 sorted_syms[sorted_symcount] = synthsyms + i;
2345 ++sorted_symcount;
2346 }
2347
2348 /* Sort the symbols into section and symbol order. */
2349 qsort (sorted_syms, sorted_symcount, sizeof (asymbol *), compare_symbols);
2350
2351 init_disassemble_info (&disasm_info, stdout, (fprintf_ftype) fprintf);
2352
2353 disasm_info.application_data = (void *) &aux;
2354 aux.abfd = abfd;
2355 aux.require_sec = FALSE;
2356 aux.dynrelbuf = NULL;
2357 aux.dynrelcount = 0;
2358 aux.reloc = NULL;
2359
2360 disasm_info.print_address_func = objdump_print_address;
2361 disasm_info.symbol_at_address_func = objdump_symbol_at_address;
2362
2363 if (machine != NULL)
2364 {
2365 const bfd_arch_info_type *inf = bfd_scan_arch (machine);
2366
2367 if (inf == NULL)
2368 fatal (_("can't use supplied machine %s"), machine);
2369
2370 abfd->arch_info = inf;
2371 }
2372
2373 if (endian != BFD_ENDIAN_UNKNOWN)
2374 {
2375 struct bfd_target *xvec;
2376
2377 xvec = (struct bfd_target *) xmalloc (sizeof (struct bfd_target));
2378 memcpy (xvec, abfd->xvec, sizeof (struct bfd_target));
2379 xvec->byteorder = endian;
2380 abfd->xvec = xvec;
2381 }
2382
2383 /* Use libopcodes to locate a suitable disassembler. */
2384 aux.disassemble_fn = disassembler (abfd);
2385 if (!aux.disassemble_fn)
2386 {
2387 non_fatal (_("can't disassemble for architecture %s\n"),
2388 bfd_printable_arch_mach (bfd_get_arch (abfd), 0));
2389 exit_status = 1;
2390 return;
2391 }
2392
2393 disasm_info.flavour = bfd_get_flavour (abfd);
2394 disasm_info.arch = bfd_get_arch (abfd);
2395 disasm_info.mach = bfd_get_mach (abfd);
2396 disasm_info.disassembler_options = disassembler_options;
2397 disasm_info.octets_per_byte = bfd_octets_per_byte (abfd);
2398 disasm_info.skip_zeroes = DEFAULT_SKIP_ZEROES;
2399 disasm_info.skip_zeroes_at_end = DEFAULT_SKIP_ZEROES_AT_END;
2400 disasm_info.disassembler_needs_relocs = FALSE;
2401
2402 if (bfd_big_endian (abfd))
2403 disasm_info.display_endian = disasm_info.endian = BFD_ENDIAN_BIG;
2404 else if (bfd_little_endian (abfd))
2405 disasm_info.display_endian = disasm_info.endian = BFD_ENDIAN_LITTLE;
2406 else
2407 /* ??? Aborting here seems too drastic. We could default to big or little
2408 instead. */
2409 disasm_info.endian = BFD_ENDIAN_UNKNOWN;
2410
2411 /* Allow the target to customize the info structure. */
2412 disassemble_init_for_target (& disasm_info);
2413
2414 /* Pre-load the dynamic relocs as we may need them during the disassembly. */
2415 {
2416 long relsize = bfd_get_dynamic_reloc_upper_bound (abfd);
2417
2418 if (relsize < 0 && dump_dynamic_reloc_info)
2419 bfd_fatal (bfd_get_filename (abfd));
2420
2421 if (relsize > 0)
2422 {
2423 aux.dynrelbuf = (arelent **) xmalloc (relsize);
2424 aux.dynrelcount = bfd_canonicalize_dynamic_reloc (abfd,
2425 aux.dynrelbuf,
2426 dynsyms);
2427 if (aux.dynrelcount < 0)
2428 bfd_fatal (bfd_get_filename (abfd));
2429
2430 /* Sort the relocs by address. */
2431 qsort (aux.dynrelbuf, aux.dynrelcount, sizeof (arelent *),
2432 compare_relocs);
2433 }
2434 }
2435 disasm_info.symtab = sorted_syms;
2436 disasm_info.symtab_size = sorted_symcount;
2437
2438 bfd_map_over_sections (abfd, disassemble_section, & disasm_info);
2439
2440 if (aux.dynrelbuf != NULL)
2441 free (aux.dynrelbuf);
2442 free (sorted_syms);
2443 }
2444 \f
2445 static int
2446 load_specific_debug_section (enum dwarf_section_display_enum debug,
2447 asection *sec, void *file)
2448 {
2449 struct dwarf_section *section = &debug_displays [debug].section;
2450 bfd *abfd = (bfd *) file;
2451 bfd_boolean ret;
2452
2453 /* If it is already loaded, do nothing. */
2454 if (section->start != NULL)
2455 return 1;
2456
2457 section->reloc_info = NULL;
2458 section->num_relocs = 0;
2459 section->address = bfd_get_section_vma (abfd, sec);
2460 section->size = bfd_get_section_size (sec);
2461 section->start = NULL;
2462 section->user_data = sec;
2463 ret = bfd_get_full_section_contents (abfd, sec, &section->start);
2464
2465 if (! ret)
2466 {
2467 free_debug_section (debug);
2468 printf (_("\nCan't get contents for section '%s'.\n"),
2469 section->name);
2470 return 0;
2471 }
2472
2473 if (is_relocatable && debug_displays [debug].relocate)
2474 {
2475 bfd_cache_section_contents (sec, section->start);
2476
2477 ret = bfd_simple_get_relocated_section_contents (abfd,
2478 sec,
2479 section->start,
2480 syms) != NULL;
2481
2482 if (! ret)
2483 {
2484 free_debug_section (debug);
2485 printf (_("\nCan't get contents for section '%s'.\n"),
2486 section->name);
2487 return 0;
2488 }
2489
2490 long reloc_size;
2491
2492 reloc_size = bfd_get_reloc_upper_bound (abfd, sec);
2493 if (reloc_size > 0)
2494 {
2495 unsigned long reloc_count;
2496 arelent **relocs;
2497
2498 relocs = (arelent **) xmalloc (reloc_size);
2499
2500 reloc_count = bfd_canonicalize_reloc (abfd, sec, relocs, NULL);
2501 if (reloc_count == 0)
2502 free (relocs);
2503 else
2504 {
2505 section->reloc_info = relocs;
2506 section->num_relocs = reloc_count;
2507 }
2508 }
2509 }
2510
2511 return 1;
2512 }
2513
2514 bfd_boolean
2515 reloc_at (struct dwarf_section * dsec, dwarf_vma offset)
2516 {
2517 arelent ** relocs;
2518 arelent * rp;
2519
2520 if (dsec == NULL || dsec->reloc_info == NULL)
2521 return FALSE;
2522
2523 relocs = (arelent **) dsec->reloc_info;
2524
2525 for (; (rp = * relocs) != NULL; ++ relocs)
2526 if (rp->address == offset)
2527 return TRUE;
2528
2529 return FALSE;
2530 }
2531
2532 int
2533 load_debug_section (enum dwarf_section_display_enum debug, void *file)
2534 {
2535 struct dwarf_section *section = &debug_displays [debug].section;
2536 bfd *abfd = (bfd *) file;
2537 asection *sec;
2538
2539 /* If it is already loaded, do nothing. */
2540 if (section->start != NULL)
2541 return 1;
2542
2543 /* Locate the debug section. */
2544 sec = bfd_get_section_by_name (abfd, section->uncompressed_name);
2545 if (sec != NULL)
2546 section->name = section->uncompressed_name;
2547 else
2548 {
2549 sec = bfd_get_section_by_name (abfd, section->compressed_name);
2550 if (sec != NULL)
2551 section->name = section->compressed_name;
2552 }
2553 if (sec == NULL)
2554 return 0;
2555
2556 return load_specific_debug_section (debug, sec, file);
2557 }
2558
2559 void
2560 free_debug_section (enum dwarf_section_display_enum debug)
2561 {
2562 struct dwarf_section *section = &debug_displays [debug].section;
2563
2564 if (section->start == NULL)
2565 return;
2566
2567 /* PR 17512: file: 0f67f69d. */
2568 if (section->user_data != NULL)
2569 {
2570 asection * sec = (asection *) section->user_data;
2571
2572 /* If we are freeing contents that are also pointed to by the BFD
2573 library's section structure then make sure to update those pointers
2574 too. Otherwise, the next time we try to load data for this section
2575 we can end up using a stale pointer. */
2576 if (section->start == sec->contents)
2577 {
2578 sec->contents = NULL;
2579 sec->flags &= ~ SEC_IN_MEMORY;
2580 sec->compress_status = COMPRESS_SECTION_NONE;
2581 }
2582 }
2583
2584 free ((char *) section->start);
2585 section->start = NULL;
2586 section->address = 0;
2587 section->size = 0;
2588 }
2589
2590 static void
2591 dump_dwarf_section (bfd *abfd, asection *section,
2592 void *arg ATTRIBUTE_UNUSED)
2593 {
2594 const char *name = bfd_get_section_name (abfd, section);
2595 const char *match;
2596 int i;
2597
2598 if (CONST_STRNEQ (name, ".gnu.linkonce.wi."))
2599 match = ".debug_info";
2600 else
2601 match = name;
2602
2603 for (i = 0; i < max; i++)
2604 if ((strcmp (debug_displays [i].section.uncompressed_name, match) == 0
2605 || strcmp (debug_displays [i].section.compressed_name, match) == 0)
2606 && debug_displays [i].enabled != NULL
2607 && *debug_displays [i].enabled)
2608 {
2609 struct dwarf_section *sec = &debug_displays [i].section;
2610
2611 if (strcmp (sec->uncompressed_name, match) == 0)
2612 sec->name = sec->uncompressed_name;
2613 else
2614 sec->name = sec->compressed_name;
2615 if (load_specific_debug_section ((enum dwarf_section_display_enum) i,
2616 section, abfd))
2617 {
2618 debug_displays [i].display (sec, abfd);
2619
2620 if (i != info && i != abbrev)
2621 free_debug_section ((enum dwarf_section_display_enum) i);
2622 }
2623 break;
2624 }
2625 }
2626
2627 /* Dump the dwarf debugging information. */
2628
2629 static void
2630 dump_dwarf (bfd *abfd)
2631 {
2632 is_relocatable = (abfd->flags & (EXEC_P | DYNAMIC)) == 0;
2633
2634 eh_addr_size = bfd_arch_bits_per_address (abfd) / 8;
2635
2636 if (bfd_big_endian (abfd))
2637 byte_get = byte_get_big_endian;
2638 else if (bfd_little_endian (abfd))
2639 byte_get = byte_get_little_endian;
2640 else
2641 /* PR 17512: file: objdump-s-endless-loop.tekhex. */
2642 {
2643 warn (_("File %s does not contain any dwarf debug information\n"),
2644 bfd_get_filename (abfd));
2645 return;
2646 }
2647
2648 switch (bfd_get_arch (abfd))
2649 {
2650 case bfd_arch_i386:
2651 switch (bfd_get_mach (abfd))
2652 {
2653 case bfd_mach_x86_64:
2654 case bfd_mach_x86_64_intel_syntax:
2655 case bfd_mach_x86_64_nacl:
2656 case bfd_mach_x64_32:
2657 case bfd_mach_x64_32_intel_syntax:
2658 case bfd_mach_x64_32_nacl:
2659 init_dwarf_regnames_x86_64 ();
2660 break;
2661
2662 default:
2663 init_dwarf_regnames_i386 ();
2664 break;
2665 }
2666 break;
2667
2668 case bfd_arch_iamcu:
2669 init_dwarf_regnames_iamcu ();
2670 break;
2671
2672 case bfd_arch_aarch64:
2673 init_dwarf_regnames_aarch64();
2674 break;
2675
2676 case bfd_arch_s390:
2677 init_dwarf_regnames_s390 ();
2678 break;
2679
2680 default:
2681 break;
2682 }
2683
2684 bfd_map_over_sections (abfd, dump_dwarf_section, NULL);
2685
2686 free_debug_memory ();
2687 }
2688 \f
2689 /* Read ABFD's stabs section STABSECT_NAME, and return a pointer to
2690 it. Return NULL on failure. */
2691
2692 static char *
2693 read_section_stabs (bfd *abfd, const char *sect_name, bfd_size_type *size_ptr)
2694 {
2695 asection *stabsect;
2696 bfd_size_type size;
2697 char *contents;
2698
2699 stabsect = bfd_get_section_by_name (abfd, sect_name);
2700 if (stabsect == NULL)
2701 {
2702 printf (_("No %s section present\n\n"), sect_name);
2703 return FALSE;
2704 }
2705
2706 size = bfd_section_size (abfd, stabsect);
2707 contents = (char *) xmalloc (size);
2708
2709 if (! bfd_get_section_contents (abfd, stabsect, contents, 0, size))
2710 {
2711 non_fatal (_("reading %s section of %s failed: %s"),
2712 sect_name, bfd_get_filename (abfd),
2713 bfd_errmsg (bfd_get_error ()));
2714 exit_status = 1;
2715 free (contents);
2716 return NULL;
2717 }
2718
2719 *size_ptr = size;
2720
2721 return contents;
2722 }
2723
2724 /* Stabs entries use a 12 byte format:
2725 4 byte string table index
2726 1 byte stab type
2727 1 byte stab other field
2728 2 byte stab desc field
2729 4 byte stab value
2730 FIXME: This will have to change for a 64 bit object format. */
2731
2732 #define STRDXOFF (0)
2733 #define TYPEOFF (4)
2734 #define OTHEROFF (5)
2735 #define DESCOFF (6)
2736 #define VALOFF (8)
2737 #define STABSIZE (12)
2738
2739 /* Print ABFD's stabs section STABSECT_NAME (in `stabs'),
2740 using string table section STRSECT_NAME (in `strtab'). */
2741
2742 static void
2743 print_section_stabs (bfd *abfd,
2744 const char *stabsect_name,
2745 unsigned *string_offset_ptr)
2746 {
2747 int i;
2748 unsigned file_string_table_offset = 0;
2749 unsigned next_file_string_table_offset = *string_offset_ptr;
2750 bfd_byte *stabp, *stabs_end;
2751
2752 stabp = stabs;
2753 stabs_end = stabp + stab_size;
2754
2755 printf (_("Contents of %s section:\n\n"), stabsect_name);
2756 printf ("Symnum n_type n_othr n_desc n_value n_strx String\n");
2757
2758 /* Loop through all symbols and print them.
2759
2760 We start the index at -1 because there is a dummy symbol on
2761 the front of stabs-in-{coff,elf} sections that supplies sizes. */
2762 for (i = -1; stabp <= stabs_end - STABSIZE; stabp += STABSIZE, i++)
2763 {
2764 const char *name;
2765 unsigned long strx;
2766 unsigned char type, other;
2767 unsigned short desc;
2768 bfd_vma value;
2769
2770 strx = bfd_h_get_32 (abfd, stabp + STRDXOFF);
2771 type = bfd_h_get_8 (abfd, stabp + TYPEOFF);
2772 other = bfd_h_get_8 (abfd, stabp + OTHEROFF);
2773 desc = bfd_h_get_16 (abfd, stabp + DESCOFF);
2774 value = bfd_h_get_32 (abfd, stabp + VALOFF);
2775
2776 printf ("\n%-6d ", i);
2777 /* Either print the stab name, or, if unnamed, print its number
2778 again (makes consistent formatting for tools like awk). */
2779 name = bfd_get_stab_name (type);
2780 if (name != NULL)
2781 printf ("%-6s", name);
2782 else if (type == N_UNDF)
2783 printf ("HdrSym");
2784 else
2785 printf ("%-6d", type);
2786 printf (" %-6d %-6d ", other, desc);
2787 bfd_printf_vma (abfd, value);
2788 printf (" %-6lu", strx);
2789
2790 /* Symbols with type == 0 (N_UNDF) specify the length of the
2791 string table associated with this file. We use that info
2792 to know how to relocate the *next* file's string table indices. */
2793 if (type == N_UNDF)
2794 {
2795 file_string_table_offset = next_file_string_table_offset;
2796 next_file_string_table_offset += value;
2797 }
2798 else
2799 {
2800 bfd_size_type amt = strx + file_string_table_offset;
2801
2802 /* Using the (possibly updated) string table offset, print the
2803 string (if any) associated with this symbol. */
2804 if (amt < stabstr_size)
2805 /* PR 17512: file: 079-79389-0.001:0.1. */
2806 printf (" %.*s", (int)(stabstr_size - amt), strtab + amt);
2807 else
2808 printf (" *");
2809 }
2810 }
2811 printf ("\n\n");
2812 *string_offset_ptr = next_file_string_table_offset;
2813 }
2814
2815 typedef struct
2816 {
2817 const char * section_name;
2818 const char * string_section_name;
2819 unsigned string_offset;
2820 }
2821 stab_section_names;
2822
2823 static void
2824 find_stabs_section (bfd *abfd, asection *section, void *names)
2825 {
2826 int len;
2827 stab_section_names * sought = (stab_section_names *) names;
2828
2829 /* Check for section names for which stabsect_name is a prefix, to
2830 handle .stab.N, etc. */
2831 len = strlen (sought->section_name);
2832
2833 /* If the prefix matches, and the files section name ends with a
2834 nul or a digit, then we match. I.e., we want either an exact
2835 match or a section followed by a number. */
2836 if (strncmp (sought->section_name, section->name, len) == 0
2837 && (section->name[len] == 0
2838 || (section->name[len] == '.' && ISDIGIT (section->name[len + 1]))))
2839 {
2840 if (strtab == NULL)
2841 strtab = read_section_stabs (abfd, sought->string_section_name,
2842 &stabstr_size);
2843
2844 if (strtab)
2845 {
2846 stabs = (bfd_byte *) read_section_stabs (abfd, section->name,
2847 &stab_size);
2848 if (stabs)
2849 print_section_stabs (abfd, section->name, &sought->string_offset);
2850 }
2851 }
2852 }
2853
2854 static void
2855 dump_stabs_section (bfd *abfd, char *stabsect_name, char *strsect_name)
2856 {
2857 stab_section_names s;
2858
2859 s.section_name = stabsect_name;
2860 s.string_section_name = strsect_name;
2861 s.string_offset = 0;
2862
2863 bfd_map_over_sections (abfd, find_stabs_section, & s);
2864
2865 free (strtab);
2866 strtab = NULL;
2867 }
2868
2869 /* Dump the any sections containing stabs debugging information. */
2870
2871 static void
2872 dump_stabs (bfd *abfd)
2873 {
2874 dump_stabs_section (abfd, ".stab", ".stabstr");
2875 dump_stabs_section (abfd, ".stab.excl", ".stab.exclstr");
2876 dump_stabs_section (abfd, ".stab.index", ".stab.indexstr");
2877
2878 /* For Darwin. */
2879 dump_stabs_section (abfd, "LC_SYMTAB.stabs", "LC_SYMTAB.stabstr");
2880
2881 dump_stabs_section (abfd, "$GDB_SYMBOLS$", "$GDB_STRINGS$");
2882 }
2883 \f
2884 static void
2885 dump_bfd_header (bfd *abfd)
2886 {
2887 char *comma = "";
2888
2889 printf (_("architecture: %s, "),
2890 bfd_printable_arch_mach (bfd_get_arch (abfd),
2891 bfd_get_mach (abfd)));
2892 printf (_("flags 0x%08x:\n"), abfd->flags & ~BFD_FLAGS_FOR_BFD_USE_MASK);
2893
2894 #define PF(x, y) if (abfd->flags & x) {printf("%s%s", comma, y); comma=", ";}
2895 PF (HAS_RELOC, "HAS_RELOC");
2896 PF (EXEC_P, "EXEC_P");
2897 PF (HAS_LINENO, "HAS_LINENO");
2898 PF (HAS_DEBUG, "HAS_DEBUG");
2899 PF (HAS_SYMS, "HAS_SYMS");
2900 PF (HAS_LOCALS, "HAS_LOCALS");
2901 PF (DYNAMIC, "DYNAMIC");
2902 PF (WP_TEXT, "WP_TEXT");
2903 PF (D_PAGED, "D_PAGED");
2904 PF (BFD_IS_RELAXABLE, "BFD_IS_RELAXABLE");
2905 printf (_("\nstart address 0x"));
2906 bfd_printf_vma (abfd, abfd->start_address);
2907 printf ("\n");
2908 }
2909
2910 \f
2911 static void
2912 dump_bfd_private_header (bfd *abfd)
2913 {
2914 bfd_print_private_bfd_data (abfd, stdout);
2915 }
2916
2917 static void
2918 dump_target_specific (bfd *abfd)
2919 {
2920 const struct objdump_private_desc * const *desc;
2921 struct objdump_private_option *opt;
2922 char *e, *b;
2923
2924 /* Find the desc. */
2925 for (desc = objdump_private_vectors; *desc != NULL; desc++)
2926 if ((*desc)->filter (abfd))
2927 break;
2928
2929 if (*desc == NULL)
2930 {
2931 non_fatal (_("option -P/--private not supported by this file"));
2932 return;
2933 }
2934
2935 /* Clear all options. */
2936 for (opt = (*desc)->options; opt->name; opt++)
2937 opt->selected = FALSE;
2938
2939 /* Decode options. */
2940 b = dump_private_options;
2941 do
2942 {
2943 e = strchr (b, ',');
2944
2945 if (e)
2946 *e = 0;
2947
2948 for (opt = (*desc)->options; opt->name; opt++)
2949 if (strcmp (opt->name, b) == 0)
2950 {
2951 opt->selected = TRUE;
2952 break;
2953 }
2954 if (opt->name == NULL)
2955 non_fatal (_("target specific dump '%s' not supported"), b);
2956
2957 if (e)
2958 {
2959 *e = ',';
2960 b = e + 1;
2961 }
2962 }
2963 while (e != NULL);
2964
2965 /* Dump. */
2966 (*desc)->dump (abfd);
2967 }
2968 \f
2969 /* Display a section in hexadecimal format with associated characters.
2970 Each line prefixed by the zero padded address. */
2971
2972 static void
2973 dump_section (bfd *abfd, asection *section, void *dummy ATTRIBUTE_UNUSED)
2974 {
2975 bfd_byte *data = 0;
2976 bfd_size_type datasize;
2977 bfd_vma addr_offset;
2978 bfd_vma start_offset;
2979 bfd_vma stop_offset;
2980 unsigned int opb = bfd_octets_per_byte (abfd);
2981 /* Bytes per line. */
2982 const int onaline = 16;
2983 char buf[64];
2984 int count;
2985 int width;
2986
2987 if ((section->flags & SEC_HAS_CONTENTS) == 0)
2988 return;
2989
2990 if (! process_section_p (section))
2991 return;
2992
2993 if ((datasize = bfd_section_size (abfd, section)) == 0)
2994 return;
2995
2996 /* Compute the address range to display. */
2997 if (start_address == (bfd_vma) -1
2998 || start_address < section->vma)
2999 start_offset = 0;
3000 else
3001 start_offset = start_address - section->vma;
3002
3003 if (stop_address == (bfd_vma) -1)
3004 stop_offset = datasize / opb;
3005 else
3006 {
3007 if (stop_address < section->vma)
3008 stop_offset = 0;
3009 else
3010 stop_offset = stop_address - section->vma;
3011
3012 if (stop_offset > datasize / opb)
3013 stop_offset = datasize / opb;
3014 }
3015
3016 if (start_offset >= stop_offset)
3017 return;
3018
3019 printf (_("Contents of section %s:"), section->name);
3020 if (display_file_offsets)
3021 printf (_(" (Starting at file offset: 0x%lx)"),
3022 (unsigned long) (section->filepos + start_offset));
3023 printf ("\n");
3024
3025 if (!bfd_get_full_section_contents (abfd, section, &data))
3026 {
3027 non_fatal (_("Reading section %s failed because: %s"),
3028 section->name, bfd_errmsg (bfd_get_error ()));
3029 return;
3030 }
3031
3032 width = 4;
3033
3034 bfd_sprintf_vma (abfd, buf, start_offset + section->vma);
3035 if (strlen (buf) >= sizeof (buf))
3036 abort ();
3037
3038 count = 0;
3039 while (buf[count] == '0' && buf[count+1] != '\0')
3040 count++;
3041 count = strlen (buf) - count;
3042 if (count > width)
3043 width = count;
3044
3045 bfd_sprintf_vma (abfd, buf, stop_offset + section->vma - 1);
3046 if (strlen (buf) >= sizeof (buf))
3047 abort ();
3048
3049 count = 0;
3050 while (buf[count] == '0' && buf[count+1] != '\0')
3051 count++;
3052 count = strlen (buf) - count;
3053 if (count > width)
3054 width = count;
3055
3056 for (addr_offset = start_offset;
3057 addr_offset < stop_offset; addr_offset += onaline / opb)
3058 {
3059 bfd_size_type j;
3060
3061 bfd_sprintf_vma (abfd, buf, (addr_offset + section->vma));
3062 count = strlen (buf);
3063 if ((size_t) count >= sizeof (buf))
3064 abort ();
3065
3066 putchar (' ');
3067 while (count < width)
3068 {
3069 putchar ('0');
3070 count++;
3071 }
3072 fputs (buf + count - width, stdout);
3073 putchar (' ');
3074
3075 for (j = addr_offset * opb;
3076 j < addr_offset * opb + onaline; j++)
3077 {
3078 if (j < stop_offset * opb)
3079 printf ("%02x", (unsigned) (data[j]));
3080 else
3081 printf (" ");
3082 if ((j & 3) == 3)
3083 printf (" ");
3084 }
3085
3086 printf (" ");
3087 for (j = addr_offset * opb;
3088 j < addr_offset * opb + onaline; j++)
3089 {
3090 if (j >= stop_offset * opb)
3091 printf (" ");
3092 else
3093 printf ("%c", ISPRINT (data[j]) ? data[j] : '.');
3094 }
3095 putchar ('\n');
3096 }
3097 free (data);
3098 }
3099
3100 /* Actually display the various requested regions. */
3101
3102 static void
3103 dump_data (bfd *abfd)
3104 {
3105 bfd_map_over_sections (abfd, dump_section, NULL);
3106 }
3107
3108 /* Should perhaps share code and display with nm? */
3109
3110 static void
3111 dump_symbols (bfd *abfd ATTRIBUTE_UNUSED, bfd_boolean dynamic)
3112 {
3113 asymbol **current;
3114 long max_count;
3115 long count;
3116
3117 if (dynamic)
3118 {
3119 current = dynsyms;
3120 max_count = dynsymcount;
3121 printf ("DYNAMIC SYMBOL TABLE:\n");
3122 }
3123 else
3124 {
3125 current = syms;
3126 max_count = symcount;
3127 printf ("SYMBOL TABLE:\n");
3128 }
3129
3130 if (max_count == 0)
3131 printf (_("no symbols\n"));
3132
3133 for (count = 0; count < max_count; count++)
3134 {
3135 bfd *cur_bfd;
3136
3137 if (*current == NULL)
3138 printf (_("no information for symbol number %ld\n"), count);
3139
3140 else if ((cur_bfd = bfd_asymbol_bfd (*current)) == NULL)
3141 printf (_("could not determine the type of symbol number %ld\n"),
3142 count);
3143
3144 else if (process_section_p ((* current)->section)
3145 && (dump_special_syms
3146 || !bfd_is_target_special_symbol (cur_bfd, *current)))
3147 {
3148 const char *name = (*current)->name;
3149
3150 if (do_demangle && name != NULL && *name != '\0')
3151 {
3152 char *alloc;
3153
3154 /* If we want to demangle the name, we demangle it
3155 here, and temporarily clobber it while calling
3156 bfd_print_symbol. FIXME: This is a gross hack. */
3157 alloc = bfd_demangle (cur_bfd, name, DMGL_ANSI | DMGL_PARAMS);
3158 if (alloc != NULL)
3159 (*current)->name = alloc;
3160 bfd_print_symbol (cur_bfd, stdout, *current,
3161 bfd_print_symbol_all);
3162 if (alloc != NULL)
3163 {
3164 (*current)->name = name;
3165 free (alloc);
3166 }
3167 }
3168 else
3169 bfd_print_symbol (cur_bfd, stdout, *current,
3170 bfd_print_symbol_all);
3171 printf ("\n");
3172 }
3173
3174 current++;
3175 }
3176 printf ("\n\n");
3177 }
3178 \f
3179 static void
3180 dump_reloc_set (bfd *abfd, asection *sec, arelent **relpp, long relcount)
3181 {
3182 arelent **p;
3183 char *last_filename, *last_functionname;
3184 unsigned int last_line;
3185 unsigned int last_discriminator;
3186
3187 /* Get column headers lined up reasonably. */
3188 {
3189 static int width;
3190
3191 if (width == 0)
3192 {
3193 char buf[30];
3194
3195 bfd_sprintf_vma (abfd, buf, (bfd_vma) -1);
3196 width = strlen (buf) - 7;
3197 }
3198 printf ("OFFSET %*s TYPE %*s VALUE \n", width, "", 12, "");
3199 }
3200
3201 last_filename = NULL;
3202 last_functionname = NULL;
3203 last_line = 0;
3204 last_discriminator = 0;
3205
3206 for (p = relpp; relcount && *p != NULL; p++, relcount--)
3207 {
3208 arelent *q = *p;
3209 const char *filename, *functionname;
3210 unsigned int linenumber;
3211 unsigned int discriminator;
3212 const char *sym_name;
3213 const char *section_name;
3214 bfd_vma addend2 = 0;
3215
3216 if (start_address != (bfd_vma) -1
3217 && q->address < start_address)
3218 continue;
3219 if (stop_address != (bfd_vma) -1
3220 && q->address > stop_address)
3221 continue;
3222
3223 if (with_line_numbers
3224 && sec != NULL
3225 && bfd_find_nearest_line_discriminator (abfd, sec, syms, q->address,
3226 &filename, &functionname,
3227 &linenumber, &discriminator))
3228 {
3229 if (functionname != NULL
3230 && (last_functionname == NULL
3231 || strcmp (functionname, last_functionname) != 0))
3232 {
3233 printf ("%s():\n", functionname);
3234 if (last_functionname != NULL)
3235 free (last_functionname);
3236 last_functionname = xstrdup (functionname);
3237 }
3238
3239 if (linenumber > 0
3240 && (linenumber != last_line
3241 || (filename != NULL
3242 && last_filename != NULL
3243 && filename_cmp (filename, last_filename) != 0)
3244 || (discriminator != last_discriminator)))
3245 {
3246 if (discriminator > 0)
3247 printf ("%s:%u\n", filename == NULL ? "???" : filename, linenumber);
3248 else
3249 printf ("%s:%u (discriminator %u)\n", filename == NULL ? "???" : filename,
3250 linenumber, discriminator);
3251 last_line = linenumber;
3252 last_discriminator = discriminator;
3253 if (last_filename != NULL)
3254 free (last_filename);
3255 if (filename == NULL)
3256 last_filename = NULL;
3257 else
3258 last_filename = xstrdup (filename);
3259 }
3260 }
3261
3262 if (q->sym_ptr_ptr && *q->sym_ptr_ptr)
3263 {
3264 sym_name = (*(q->sym_ptr_ptr))->name;
3265 section_name = (*(q->sym_ptr_ptr))->section->name;
3266 }
3267 else
3268 {
3269 sym_name = NULL;
3270 section_name = NULL;
3271 }
3272
3273 bfd_printf_vma (abfd, q->address);
3274 if (q->howto == NULL)
3275 printf (" *unknown* ");
3276 else if (q->howto->name)
3277 {
3278 const char *name = q->howto->name;
3279
3280 /* R_SPARC_OLO10 relocations contain two addends.
3281 But because 'arelent' lacks enough storage to
3282 store them both, the 64-bit ELF Sparc backend
3283 records this as two relocations. One R_SPARC_LO10
3284 and one R_SPARC_13, both pointing to the same
3285 address. This is merely so that we have some
3286 place to store both addend fields.
3287
3288 Undo this transformation, otherwise the output
3289 will be confusing. */
3290 if (abfd->xvec->flavour == bfd_target_elf_flavour
3291 && elf_tdata(abfd)->elf_header->e_machine == EM_SPARCV9
3292 && relcount > 1
3293 && !strcmp (q->howto->name, "R_SPARC_LO10"))
3294 {
3295 arelent *q2 = *(p + 1);
3296 if (q2 != NULL
3297 && q2->howto
3298 && q->address == q2->address
3299 && !strcmp (q2->howto->name, "R_SPARC_13"))
3300 {
3301 name = "R_SPARC_OLO10";
3302 addend2 = q2->addend;
3303 p++;
3304 }
3305 }
3306 printf (" %-16s ", name);
3307 }
3308 else
3309 printf (" %-16d ", q->howto->type);
3310
3311 if (sym_name)
3312 {
3313 objdump_print_symname (abfd, NULL, *q->sym_ptr_ptr);
3314 }
3315 else
3316 {
3317 if (section_name == NULL)
3318 section_name = "*unknown*";
3319 printf ("[%s]", section_name);
3320 }
3321
3322 if (q->addend)
3323 {
3324 bfd_signed_vma addend = q->addend;
3325 if (addend < 0)
3326 {
3327 printf ("-0x");
3328 addend = -addend;
3329 }
3330 else
3331 printf ("+0x");
3332 bfd_printf_vma (abfd, addend);
3333 }
3334 if (addend2)
3335 {
3336 printf ("+0x");
3337 bfd_printf_vma (abfd, addend2);
3338 }
3339
3340 printf ("\n");
3341 }
3342
3343 if (last_filename != NULL)
3344 free (last_filename);
3345 if (last_functionname != NULL)
3346 free (last_functionname);
3347 }
3348
3349 static void
3350 dump_relocs_in_section (bfd *abfd,
3351 asection *section,
3352 void *dummy ATTRIBUTE_UNUSED)
3353 {
3354 arelent **relpp;
3355 long relcount;
3356 long relsize;
3357
3358 if ( bfd_is_abs_section (section)
3359 || bfd_is_und_section (section)
3360 || bfd_is_com_section (section)
3361 || (! process_section_p (section))
3362 || ((section->flags & SEC_RELOC) == 0))
3363 return;
3364
3365 relsize = bfd_get_reloc_upper_bound (abfd, section);
3366 if (relsize < 0)
3367 bfd_fatal (bfd_get_filename (abfd));
3368
3369 printf ("RELOCATION RECORDS FOR [%s]:", section->name);
3370
3371 if (relsize == 0)
3372 {
3373 printf (" (none)\n\n");
3374 return;
3375 }
3376
3377 relpp = (arelent **) xmalloc (relsize);
3378 relcount = bfd_canonicalize_reloc (abfd, section, relpp, syms);
3379
3380 if (relcount < 0)
3381 {
3382 printf ("\n");
3383 non_fatal (_("failed to read relocs in: %s"), bfd_get_filename (abfd));
3384 bfd_fatal (_("error message was"));
3385 }
3386 else if (relcount == 0)
3387 printf (" (none)\n\n");
3388 else
3389 {
3390 printf ("\n");
3391 dump_reloc_set (abfd, section, relpp, relcount);
3392 printf ("\n\n");
3393 }
3394 free (relpp);
3395 }
3396
3397 static void
3398 dump_relocs (bfd *abfd)
3399 {
3400 bfd_map_over_sections (abfd, dump_relocs_in_section, NULL);
3401 }
3402
3403 static void
3404 dump_dynamic_relocs (bfd *abfd)
3405 {
3406 long relsize;
3407 arelent **relpp;
3408 long relcount;
3409
3410 relsize = bfd_get_dynamic_reloc_upper_bound (abfd);
3411 if (relsize < 0)
3412 bfd_fatal (bfd_get_filename (abfd));
3413
3414 printf ("DYNAMIC RELOCATION RECORDS");
3415
3416 if (relsize == 0)
3417 printf (" (none)\n\n");
3418 else
3419 {
3420 relpp = (arelent **) xmalloc (relsize);
3421 relcount = bfd_canonicalize_dynamic_reloc (abfd, relpp, dynsyms);
3422
3423 if (relcount < 0)
3424 bfd_fatal (bfd_get_filename (abfd));
3425 else if (relcount == 0)
3426 printf (" (none)\n\n");
3427 else
3428 {
3429 printf ("\n");
3430 dump_reloc_set (abfd, NULL, relpp, relcount);
3431 printf ("\n\n");
3432 }
3433 free (relpp);
3434 }
3435 }
3436
3437 /* Creates a table of paths, to search for source files. */
3438
3439 static void
3440 add_include_path (const char *path)
3441 {
3442 if (path[0] == 0)
3443 return;
3444 include_path_count++;
3445 include_paths = (const char **)
3446 xrealloc (include_paths, include_path_count * sizeof (*include_paths));
3447 #ifdef HAVE_DOS_BASED_FILE_SYSTEM
3448 if (path[1] == ':' && path[2] == 0)
3449 path = concat (path, ".", (const char *) 0);
3450 #endif
3451 include_paths[include_path_count - 1] = path;
3452 }
3453
3454 static void
3455 adjust_addresses (bfd *abfd ATTRIBUTE_UNUSED,
3456 asection *section,
3457 void *arg)
3458 {
3459 if ((section->flags & SEC_DEBUGGING) == 0)
3460 {
3461 bfd_boolean *has_reloc_p = (bfd_boolean *) arg;
3462 section->vma += adjust_section_vma;
3463 if (*has_reloc_p)
3464 section->lma += adjust_section_vma;
3465 }
3466 }
3467
3468 /* Dump selected contents of ABFD. */
3469
3470 static void
3471 dump_bfd (bfd *abfd)
3472 {
3473 /* If we are adjusting section VMA's, change them all now. Changing
3474 the BFD information is a hack. However, we must do it, or
3475 bfd_find_nearest_line will not do the right thing. */
3476 if (adjust_section_vma != 0)
3477 {
3478 bfd_boolean has_reloc = (abfd->flags & HAS_RELOC);
3479 bfd_map_over_sections (abfd, adjust_addresses, &has_reloc);
3480 }
3481
3482 if (! dump_debugging_tags && ! suppress_bfd_header)
3483 printf (_("\n%s: file format %s\n"), bfd_get_filename (abfd),
3484 abfd->xvec->name);
3485 if (dump_ar_hdrs)
3486 print_arelt_descr (stdout, abfd, TRUE);
3487 if (dump_file_header)
3488 dump_bfd_header (abfd);
3489 if (dump_private_headers)
3490 dump_bfd_private_header (abfd);
3491 if (dump_private_options != NULL)
3492 dump_target_specific (abfd);
3493 if (! dump_debugging_tags && ! suppress_bfd_header)
3494 putchar ('\n');
3495
3496 if (dump_symtab
3497 || dump_reloc_info
3498 || disassemble
3499 || dump_debugging
3500 || dump_dwarf_section_info)
3501 syms = slurp_symtab (abfd);
3502
3503 if (dump_section_headers)
3504 dump_headers (abfd);
3505
3506 if (dump_dynamic_symtab || dump_dynamic_reloc_info
3507 || (disassemble && bfd_get_dynamic_symtab_upper_bound (abfd) > 0))
3508 dynsyms = slurp_dynamic_symtab (abfd);
3509 if (disassemble)
3510 {
3511 synthcount = bfd_get_synthetic_symtab (abfd, symcount, syms,
3512 dynsymcount, dynsyms, &synthsyms);
3513 if (synthcount < 0)
3514 synthcount = 0;
3515 }
3516
3517 if (dump_symtab)
3518 dump_symbols (abfd, FALSE);
3519 if (dump_dynamic_symtab)
3520 dump_symbols (abfd, TRUE);
3521 if (dump_dwarf_section_info)
3522 dump_dwarf (abfd);
3523 if (dump_stab_section_info)
3524 dump_stabs (abfd);
3525 if (dump_reloc_info && ! disassemble)
3526 dump_relocs (abfd);
3527 if (dump_dynamic_reloc_info && ! disassemble)
3528 dump_dynamic_relocs (abfd);
3529 if (dump_section_contents)
3530 dump_data (abfd);
3531 if (disassemble)
3532 disassemble_data (abfd);
3533
3534 if (dump_debugging)
3535 {
3536 void *dhandle;
3537
3538 dhandle = read_debugging_info (abfd, syms, symcount, TRUE);
3539 if (dhandle != NULL)
3540 {
3541 if (!print_debugging_info (stdout, dhandle, abfd, syms,
3542 bfd_demangle,
3543 dump_debugging_tags ? TRUE : FALSE))
3544 {
3545 non_fatal (_("%s: printing debugging information failed"),
3546 bfd_get_filename (abfd));
3547 exit_status = 1;
3548 }
3549 }
3550 /* PR 6483: If there was no STABS or IEEE debug
3551 info in the file, try DWARF instead. */
3552 else if (! dump_dwarf_section_info)
3553 {
3554 dwarf_select_sections_all ();
3555 dump_dwarf (abfd);
3556 }
3557 }
3558
3559 if (syms)
3560 {
3561 free (syms);
3562 syms = NULL;
3563 }
3564
3565 if (dynsyms)
3566 {
3567 free (dynsyms);
3568 dynsyms = NULL;
3569 }
3570
3571 if (synthsyms)
3572 {
3573 free (synthsyms);
3574 synthsyms = NULL;
3575 }
3576
3577 symcount = 0;
3578 dynsymcount = 0;
3579 synthcount = 0;
3580 }
3581
3582 static void
3583 display_object_bfd (bfd *abfd)
3584 {
3585 char **matching;
3586
3587 if (bfd_check_format_matches (abfd, bfd_object, &matching))
3588 {
3589 dump_bfd (abfd);
3590 return;
3591 }
3592
3593 if (bfd_get_error () == bfd_error_file_ambiguously_recognized)
3594 {
3595 nonfatal (bfd_get_filename (abfd));
3596 list_matching_formats (matching);
3597 free (matching);
3598 return;
3599 }
3600
3601 if (bfd_get_error () != bfd_error_file_not_recognized)
3602 {
3603 nonfatal (bfd_get_filename (abfd));
3604 return;
3605 }
3606
3607 if (bfd_check_format_matches (abfd, bfd_core, &matching))
3608 {
3609 dump_bfd (abfd);
3610 return;
3611 }
3612
3613 nonfatal (bfd_get_filename (abfd));
3614
3615 if (bfd_get_error () == bfd_error_file_ambiguously_recognized)
3616 {
3617 list_matching_formats (matching);
3618 free (matching);
3619 }
3620 }
3621
3622 static void
3623 display_any_bfd (bfd *file, int level)
3624 {
3625 /* Decompress sections unless dumping the section contents. */
3626 if (!dump_section_contents)
3627 file->flags |= BFD_DECOMPRESS;
3628
3629 /* If the file is an archive, process all of its elements. */
3630 if (bfd_check_format (file, bfd_archive))
3631 {
3632 bfd *arfile = NULL;
3633 bfd *last_arfile = NULL;
3634
3635 if (level == 0)
3636 printf (_("In archive %s:\n"), bfd_get_filename (file));
3637 else if (level > 100)
3638 {
3639 /* Prevent corrupted files from spinning us into an
3640 infinite loop. 100 is an arbitrary heuristic. */
3641 fatal (_("Archive nesting is too deep"));
3642 return;
3643 }
3644 else
3645 printf (_("In nested archive %s:\n"), bfd_get_filename (file));
3646
3647 for (;;)
3648 {
3649 bfd_set_error (bfd_error_no_error);
3650
3651 arfile = bfd_openr_next_archived_file (file, arfile);
3652 if (arfile == NULL)
3653 {
3654 if (bfd_get_error () != bfd_error_no_more_archived_files)
3655 nonfatal (bfd_get_filename (file));
3656 break;
3657 }
3658
3659 display_any_bfd (arfile, level + 1);
3660
3661 if (last_arfile != NULL)
3662 {
3663 bfd_close (last_arfile);
3664 /* PR 17512: file: ac585d01. */
3665 if (arfile == last_arfile)
3666 {
3667 last_arfile = NULL;
3668 break;
3669 }
3670 }
3671 last_arfile = arfile;
3672 }
3673
3674 if (last_arfile != NULL)
3675 bfd_close (last_arfile);
3676 }
3677 else
3678 display_object_bfd (file);
3679 }
3680
3681 static void
3682 display_file (char *filename, char *target, bfd_boolean last_file)
3683 {
3684 bfd *file;
3685
3686 if (get_file_size (filename) < 1)
3687 {
3688 exit_status = 1;
3689 return;
3690 }
3691
3692 file = bfd_openr (filename, target);
3693 if (file == NULL)
3694 {
3695 nonfatal (filename);
3696 return;
3697 }
3698
3699 display_any_bfd (file, 0);
3700
3701 /* This is an optimization to improve the speed of objdump, especially when
3702 dumping a file with lots of associated debug informatiom. Calling
3703 bfd_close on such a file can take a non-trivial amount of time as there
3704 are lots of lists to walk and buffers to free. This is only really
3705 necessary however if we are about to load another file and we need the
3706 memory back. Otherwise, if we are about to exit, then we can save (a lot
3707 of) time by only doing a quick close, and allowing the OS to reclaim the
3708 memory for us. */
3709 if (! last_file)
3710 bfd_close (file);
3711 else
3712 bfd_close_all_done (file);
3713 }
3714 \f
3715 int
3716 main (int argc, char **argv)
3717 {
3718 int c;
3719 char *target = default_target;
3720 bfd_boolean seenflag = FALSE;
3721
3722 #if defined (HAVE_SETLOCALE)
3723 #if defined (HAVE_LC_MESSAGES)
3724 setlocale (LC_MESSAGES, "");
3725 #endif
3726 setlocale (LC_CTYPE, "");
3727 #endif
3728
3729 bindtextdomain (PACKAGE, LOCALEDIR);
3730 textdomain (PACKAGE);
3731
3732 program_name = *argv;
3733 xmalloc_set_program_name (program_name);
3734 bfd_set_error_program_name (program_name);
3735
3736 START_PROGRESS (program_name, 0);
3737
3738 expandargv (&argc, &argv);
3739
3740 bfd_init ();
3741 set_default_bfd_target ();
3742
3743 while ((c = getopt_long (argc, argv,
3744 "pP:ib:m:M:VvCdDlfFaHhrRtTxsSI:j:wE:zgeGW::",
3745 long_options, (int *) 0))
3746 != EOF)
3747 {
3748 switch (c)
3749 {
3750 case 0:
3751 break; /* We've been given a long option. */
3752 case 'm':
3753 machine = optarg;
3754 break;
3755 case 'M':
3756 {
3757 char *options;
3758 if (disassembler_options)
3759 /* Ignore potential memory leak for now. */
3760 options = concat (disassembler_options, ",",
3761 optarg, (const char *) NULL);
3762 else
3763 options = optarg;
3764 disassembler_options = remove_whitespace_and_extra_commas (options);
3765 }
3766 break;
3767 case 'j':
3768 add_only (optarg);
3769 break;
3770 case 'F':
3771 display_file_offsets = TRUE;
3772 break;
3773 case 'l':
3774 with_line_numbers = TRUE;
3775 break;
3776 case 'b':
3777 target = optarg;
3778 break;
3779 case 'C':
3780 do_demangle = TRUE;
3781 if (optarg != NULL)
3782 {
3783 enum demangling_styles style;
3784
3785 style = cplus_demangle_name_to_style (optarg);
3786 if (style == unknown_demangling)
3787 fatal (_("unknown demangling style `%s'"),
3788 optarg);
3789
3790 cplus_demangle_set_style (style);
3791 }
3792 break;
3793 case 'w':
3794 do_wide = wide_output = TRUE;
3795 break;
3796 case OPTION_ADJUST_VMA:
3797 adjust_section_vma = parse_vma (optarg, "--adjust-vma");
3798 break;
3799 case OPTION_START_ADDRESS:
3800 start_address = parse_vma (optarg, "--start-address");
3801 if ((stop_address != (bfd_vma) -1) && stop_address <= start_address)
3802 fatal (_("error: the start address should be before the end address"));
3803 break;
3804 case OPTION_STOP_ADDRESS:
3805 stop_address = parse_vma (optarg, "--stop-address");
3806 if ((start_address != (bfd_vma) -1) && stop_address <= start_address)
3807 fatal (_("error: the stop address should be after the start address"));
3808 break;
3809 case OPTION_PREFIX:
3810 prefix = optarg;
3811 prefix_length = strlen (prefix);
3812 /* Remove an unnecessary trailing '/' */
3813 while (IS_DIR_SEPARATOR (prefix[prefix_length - 1]))
3814 prefix_length--;
3815 break;
3816 case OPTION_PREFIX_STRIP:
3817 prefix_strip = atoi (optarg);
3818 if (prefix_strip < 0)
3819 fatal (_("error: prefix strip must be non-negative"));
3820 break;
3821 case OPTION_INSN_WIDTH:
3822 insn_width = strtoul (optarg, NULL, 0);
3823 if (insn_width <= 0)
3824 fatal (_("error: instruction width must be positive"));
3825 break;
3826 case OPTION_INLINES:
3827 unwind_inlines = TRUE;
3828 break;
3829 case 'E':
3830 if (strcmp (optarg, "B") == 0)
3831 endian = BFD_ENDIAN_BIG;
3832 else if (strcmp (optarg, "L") == 0)
3833 endian = BFD_ENDIAN_LITTLE;
3834 else
3835 {
3836 nonfatal (_("unrecognized -E option"));
3837 usage (stderr, 1);
3838 }
3839 break;
3840 case OPTION_ENDIAN:
3841 if (strncmp (optarg, "big", strlen (optarg)) == 0)
3842 endian = BFD_ENDIAN_BIG;
3843 else if (strncmp (optarg, "little", strlen (optarg)) == 0)
3844 endian = BFD_ENDIAN_LITTLE;
3845 else
3846 {
3847 non_fatal (_("unrecognized --endian type `%s'"), optarg);
3848 exit_status = 1;
3849 usage (stderr, 1);
3850 }
3851 break;
3852
3853 case 'f':
3854 dump_file_header = TRUE;
3855 seenflag = TRUE;
3856 break;
3857 case 'i':
3858 formats_info = TRUE;
3859 seenflag = TRUE;
3860 break;
3861 case 'I':
3862 add_include_path (optarg);
3863 break;
3864 case 'p':
3865 dump_private_headers = TRUE;
3866 seenflag = TRUE;
3867 break;
3868 case 'P':
3869 dump_private_options = optarg;
3870 seenflag = TRUE;
3871 break;
3872 case 'x':
3873 dump_private_headers = TRUE;
3874 dump_symtab = TRUE;
3875 dump_reloc_info = TRUE;
3876 dump_file_header = TRUE;
3877 dump_ar_hdrs = TRUE;
3878 dump_section_headers = TRUE;
3879 seenflag = TRUE;
3880 break;
3881 case 't':
3882 dump_symtab = TRUE;
3883 seenflag = TRUE;
3884 break;
3885 case 'T':
3886 dump_dynamic_symtab = TRUE;
3887 seenflag = TRUE;
3888 break;
3889 case 'd':
3890 disassemble = TRUE;
3891 seenflag = TRUE;
3892 break;
3893 case 'z':
3894 disassemble_zeroes = TRUE;
3895 break;
3896 case 'D':
3897 disassemble = TRUE;
3898 disassemble_all = TRUE;
3899 seenflag = TRUE;
3900 break;
3901 case 'S':
3902 disassemble = TRUE;
3903 with_source_code = TRUE;
3904 seenflag = TRUE;
3905 break;
3906 case 'g':
3907 dump_debugging = 1;
3908 seenflag = TRUE;
3909 break;
3910 case 'e':
3911 dump_debugging = 1;
3912 dump_debugging_tags = 1;
3913 do_demangle = TRUE;
3914 seenflag = TRUE;
3915 break;
3916 case 'W':
3917 dump_dwarf_section_info = TRUE;
3918 seenflag = TRUE;
3919 if (optarg)
3920 dwarf_select_sections_by_letters (optarg);
3921 else
3922 dwarf_select_sections_all ();
3923 break;
3924 case OPTION_DWARF:
3925 dump_dwarf_section_info = TRUE;
3926 seenflag = TRUE;
3927 if (optarg)
3928 dwarf_select_sections_by_names (optarg);
3929 else
3930 dwarf_select_sections_all ();
3931 break;
3932 case OPTION_DWARF_DEPTH:
3933 {
3934 char *cp;
3935 dwarf_cutoff_level = strtoul (optarg, & cp, 0);
3936 }
3937 break;
3938 case OPTION_DWARF_START:
3939 {
3940 char *cp;
3941 dwarf_start_die = strtoul (optarg, & cp, 0);
3942 suppress_bfd_header = 1;
3943 }
3944 break;
3945 case OPTION_DWARF_CHECK:
3946 dwarf_check = TRUE;
3947 break;
3948 case 'G':
3949 dump_stab_section_info = TRUE;
3950 seenflag = TRUE;
3951 break;
3952 case 's':
3953 dump_section_contents = TRUE;
3954 seenflag = TRUE;
3955 break;
3956 case 'r':
3957 dump_reloc_info = TRUE;
3958 seenflag = TRUE;
3959 break;
3960 case 'R':
3961 dump_dynamic_reloc_info = TRUE;
3962 seenflag = TRUE;
3963 break;
3964 case 'a':
3965 dump_ar_hdrs = TRUE;
3966 seenflag = TRUE;
3967 break;
3968 case 'h':
3969 dump_section_headers = TRUE;
3970 seenflag = TRUE;
3971 break;
3972 case 'v':
3973 case 'V':
3974 show_version = TRUE;
3975 seenflag = TRUE;
3976 break;
3977
3978 case 'H':
3979 usage (stdout, 0);
3980 /* No need to set seenflag or to break - usage() does not return. */
3981 default:
3982 usage (stderr, 1);
3983 }
3984 }
3985
3986 if (show_version)
3987 print_version ("objdump");
3988
3989 if (!seenflag)
3990 usage (stderr, 2);
3991
3992 if (formats_info)
3993 exit_status = display_info ();
3994 else
3995 {
3996 if (optind == argc)
3997 display_file ("a.out", target, TRUE);
3998 else
3999 for (; optind < argc;)
4000 {
4001 display_file (argv[optind], target, optind == argc - 1);
4002 optind++;
4003 }
4004 }
4005
4006 free_only_list ();
4007
4008 END_PROGRESS (program_name);
4009
4010 return exit_status;
4011 }
This page took 0.126076 seconds and 4 git commands to generate.