PR22769, crash when running 32-bit objdump on corrupted file
[deliverable/binutils-gdb.git] / binutils / objdump.c
1 /* objdump.c -- dump information about an object file.
2 Copyright (C) 1990-2018 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 bfd_byte *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[lLiaprmfFsoRtUuTgAckK] 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,=links,=follow-links]\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_SECTION_SYM | BSF_SYNTHETIC)) == 0)
803 asz = ((elf_symbol_type *) a)->internal_elf_sym.st_size;
804 bsz = 0;
805 if ((b->flags & (BSF_SECTION_SYM | 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_SECTION_SYM | 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 {
1541 printf ("%s():\n", functionname);
1542 prev_line = -1;
1543 }
1544 if (linenumber > 0
1545 && (linenumber != prev_line
1546 || discriminator != prev_discriminator))
1547 {
1548 if (discriminator > 0)
1549 printf ("%s:%u (discriminator %u)\n",
1550 filename == NULL ? "???" : filename,
1551 linenumber, discriminator);
1552 else
1553 printf ("%s:%u\n", filename == NULL ? "???" : filename,
1554 linenumber);
1555 }
1556 if (unwind_inlines)
1557 {
1558 const char *filename2;
1559 const char *functionname2;
1560 unsigned line2;
1561
1562 while (bfd_find_inliner_info (abfd, &filename2, &functionname2,
1563 &line2))
1564 printf ("inlined by %s:%u (%s)\n", filename2, line2,
1565 functionname2);
1566 }
1567 }
1568
1569 if (with_source_code
1570 && filename != NULL
1571 && linenumber > 0)
1572 {
1573 struct print_file_list **pp, *p;
1574 unsigned l;
1575
1576 for (pp = &print_files; *pp != NULL; pp = &(*pp)->next)
1577 if (filename_cmp ((*pp)->filename, filename) == 0)
1578 break;
1579 p = *pp;
1580
1581 if (p == NULL)
1582 {
1583 if (reloc)
1584 filename = xstrdup (filename);
1585 p = update_source_path (filename, abfd);
1586 }
1587
1588 if (p != NULL && linenumber != p->last_line)
1589 {
1590 if (file_start_context && p->first)
1591 l = 1;
1592 else
1593 {
1594 l = linenumber - SHOW_PRECEDING_CONTEXT_LINES;
1595 if (l >= linenumber)
1596 l = 1;
1597 if (p->max_printed >= l)
1598 {
1599 if (p->max_printed < linenumber)
1600 l = p->max_printed + 1;
1601 else
1602 l = linenumber;
1603 }
1604 }
1605 dump_lines (p, l, linenumber);
1606 if (p->max_printed < linenumber)
1607 p->max_printed = linenumber;
1608 p->last_line = linenumber;
1609 p->first = 0;
1610 }
1611 }
1612
1613 if (functionname != NULL
1614 && (prev_functionname == NULL
1615 || strcmp (functionname, prev_functionname) != 0))
1616 {
1617 if (prev_functionname != NULL)
1618 free (prev_functionname);
1619 prev_functionname = (char *) xmalloc (strlen (functionname) + 1);
1620 strcpy (prev_functionname, functionname);
1621 }
1622
1623 if (linenumber > 0 && linenumber != prev_line)
1624 prev_line = linenumber;
1625
1626 if (discriminator != prev_discriminator)
1627 prev_discriminator = discriminator;
1628
1629 if (path)
1630 free (path);
1631 }
1632
1633 /* Pseudo FILE object for strings. */
1634 typedef struct
1635 {
1636 char *buffer;
1637 size_t pos;
1638 size_t alloc;
1639 } SFILE;
1640
1641 /* sprintf to a "stream". */
1642
1643 static int ATTRIBUTE_PRINTF_2
1644 objdump_sprintf (SFILE *f, const char *format, ...)
1645 {
1646 size_t n;
1647 va_list args;
1648
1649 while (1)
1650 {
1651 size_t space = f->alloc - f->pos;
1652
1653 va_start (args, format);
1654 n = vsnprintf (f->buffer + f->pos, space, format, args);
1655 va_end (args);
1656
1657 if (space > n)
1658 break;
1659
1660 f->alloc = (f->alloc + n) * 2;
1661 f->buffer = (char *) xrealloc (f->buffer, f->alloc);
1662 }
1663 f->pos += n;
1664
1665 return n;
1666 }
1667
1668 /* The number of zeroes we want to see before we start skipping them.
1669 The number is arbitrarily chosen. */
1670
1671 #define DEFAULT_SKIP_ZEROES 8
1672
1673 /* The number of zeroes to skip at the end of a section. If the
1674 number of zeroes at the end is between SKIP_ZEROES_AT_END and
1675 SKIP_ZEROES, they will be disassembled. If there are fewer than
1676 SKIP_ZEROES_AT_END, they will be skipped. This is a heuristic
1677 attempt to avoid disassembling zeroes inserted by section
1678 alignment. */
1679
1680 #define DEFAULT_SKIP_ZEROES_AT_END 3
1681
1682 /* Disassemble some data in memory between given values. */
1683
1684 static void
1685 disassemble_bytes (struct disassemble_info * inf,
1686 disassembler_ftype disassemble_fn,
1687 bfd_boolean insns,
1688 bfd_byte * data,
1689 bfd_vma start_offset,
1690 bfd_vma stop_offset,
1691 bfd_vma rel_offset,
1692 arelent *** relppp,
1693 arelent ** relppend)
1694 {
1695 struct objdump_disasm_info *aux;
1696 asection *section;
1697 int octets_per_line;
1698 int skip_addr_chars;
1699 bfd_vma addr_offset;
1700 unsigned int opb = inf->octets_per_byte;
1701 unsigned int skip_zeroes = inf->skip_zeroes;
1702 unsigned int skip_zeroes_at_end = inf->skip_zeroes_at_end;
1703 int octets = opb;
1704 SFILE sfile;
1705
1706 aux = (struct objdump_disasm_info *) inf->application_data;
1707 section = aux->sec;
1708
1709 sfile.alloc = 120;
1710 sfile.buffer = (char *) xmalloc (sfile.alloc);
1711 sfile.pos = 0;
1712
1713 if (insn_width)
1714 octets_per_line = insn_width;
1715 else if (insns)
1716 octets_per_line = 4;
1717 else
1718 octets_per_line = 16;
1719
1720 /* Figure out how many characters to skip at the start of an
1721 address, to make the disassembly look nicer. We discard leading
1722 zeroes in chunks of 4, ensuring that there is always a leading
1723 zero remaining. */
1724 skip_addr_chars = 0;
1725 if (! prefix_addresses)
1726 {
1727 char buf[30];
1728
1729 bfd_sprintf_vma (aux->abfd, buf, section->vma + section->size / opb);
1730
1731 while (buf[skip_addr_chars] == '0')
1732 ++skip_addr_chars;
1733
1734 /* Don't discard zeros on overflow. */
1735 if (buf[skip_addr_chars] == '\0' && section->vma != 0)
1736 skip_addr_chars = 0;
1737
1738 if (skip_addr_chars != 0)
1739 skip_addr_chars = (skip_addr_chars - 1) & -4;
1740 }
1741
1742 inf->insn_info_valid = 0;
1743
1744 addr_offset = start_offset;
1745 while (addr_offset < stop_offset)
1746 {
1747 bfd_vma z;
1748 bfd_boolean need_nl = FALSE;
1749 int previous_octets;
1750
1751 /* Remember the length of the previous instruction. */
1752 previous_octets = octets;
1753 octets = 0;
1754
1755 /* Make sure we don't use relocs from previous instructions. */
1756 aux->reloc = NULL;
1757
1758 /* If we see more than SKIP_ZEROES octets of zeroes, we just
1759 print `...'. */
1760 for (z = addr_offset * opb; z < stop_offset * opb; z++)
1761 if (data[z] != 0)
1762 break;
1763 if (! disassemble_zeroes
1764 && (inf->insn_info_valid == 0
1765 || inf->branch_delay_insns == 0)
1766 && (z - addr_offset * opb >= skip_zeroes
1767 || (z == stop_offset * opb &&
1768 z - addr_offset * opb < skip_zeroes_at_end)))
1769 {
1770 /* If there are more nonzero octets to follow, we only skip
1771 zeroes in multiples of 4, to try to avoid running over
1772 the start of an instruction which happens to start with
1773 zero. */
1774 if (z != stop_offset * opb)
1775 z = addr_offset * opb + ((z - addr_offset * opb) &~ 3);
1776
1777 octets = z - addr_offset * opb;
1778
1779 /* If we are going to display more data, and we are displaying
1780 file offsets, then tell the user how many zeroes we skip
1781 and the file offset from where we resume dumping. */
1782 if (display_file_offsets && ((addr_offset + (octets / opb)) < stop_offset))
1783 printf ("\t... (skipping %d zeroes, resuming at file offset: 0x%lx)\n",
1784 octets / opb,
1785 (unsigned long) (section->filepos
1786 + (addr_offset + (octets / opb))));
1787 else
1788 printf ("\t...\n");
1789 }
1790 else
1791 {
1792 char buf[50];
1793 int bpc = 0;
1794 int pb = 0;
1795
1796 if (with_line_numbers || with_source_code)
1797 show_line (aux->abfd, section, addr_offset);
1798
1799 if (! prefix_addresses)
1800 {
1801 char *s;
1802
1803 bfd_sprintf_vma (aux->abfd, buf, section->vma + addr_offset);
1804 for (s = buf + skip_addr_chars; *s == '0'; s++)
1805 *s = ' ';
1806 if (*s == '\0')
1807 *--s = '0';
1808 printf ("%s:\t", buf + skip_addr_chars);
1809 }
1810 else
1811 {
1812 aux->require_sec = TRUE;
1813 objdump_print_address (section->vma + addr_offset, inf);
1814 aux->require_sec = FALSE;
1815 putchar (' ');
1816 }
1817
1818 if (insns)
1819 {
1820 sfile.pos = 0;
1821 inf->fprintf_func = (fprintf_ftype) objdump_sprintf;
1822 inf->stream = &sfile;
1823 inf->bytes_per_line = 0;
1824 inf->bytes_per_chunk = 0;
1825 inf->flags = disassemble_all ? DISASSEMBLE_DATA : 0;
1826 if (machine)
1827 inf->flags |= USER_SPECIFIED_MACHINE_TYPE;
1828
1829 if (inf->disassembler_needs_relocs
1830 && (bfd_get_file_flags (aux->abfd) & EXEC_P) == 0
1831 && (bfd_get_file_flags (aux->abfd) & DYNAMIC) == 0
1832 && *relppp < relppend)
1833 {
1834 bfd_signed_vma distance_to_rel;
1835
1836 distance_to_rel = (**relppp)->address
1837 - (rel_offset + addr_offset);
1838
1839 /* Check to see if the current reloc is associated with
1840 the instruction that we are about to disassemble. */
1841 if (distance_to_rel == 0
1842 /* FIXME: This is wrong. We are trying to catch
1843 relocs that are addressed part way through the
1844 current instruction, as might happen with a packed
1845 VLIW instruction. Unfortunately we do not know the
1846 length of the current instruction since we have not
1847 disassembled it yet. Instead we take a guess based
1848 upon the length of the previous instruction. The
1849 proper solution is to have a new target-specific
1850 disassembler function which just returns the length
1851 of an instruction at a given address without trying
1852 to display its disassembly. */
1853 || (distance_to_rel > 0
1854 && distance_to_rel < (bfd_signed_vma) (previous_octets/ opb)))
1855 {
1856 inf->flags |= INSN_HAS_RELOC;
1857 aux->reloc = **relppp;
1858 }
1859 }
1860
1861 if (! disassemble_all
1862 && (section->flags & (SEC_CODE | SEC_HAS_CONTENTS))
1863 == (SEC_CODE | SEC_HAS_CONTENTS))
1864 /* Set a stop_vma so that the disassembler will not read
1865 beyond the next symbol. We assume that symbols appear on
1866 the boundaries between instructions. We only do this when
1867 disassembling code of course, and when -D is in effect. */
1868 inf->stop_vma = section->vma + stop_offset;
1869
1870 octets = (*disassemble_fn) (section->vma + addr_offset, inf);
1871
1872 inf->stop_vma = 0;
1873 inf->fprintf_func = (fprintf_ftype) fprintf;
1874 inf->stream = stdout;
1875 if (insn_width == 0 && inf->bytes_per_line != 0)
1876 octets_per_line = inf->bytes_per_line;
1877 if (octets < (int) opb)
1878 {
1879 if (sfile.pos)
1880 printf ("%s\n", sfile.buffer);
1881 if (octets >= 0)
1882 {
1883 non_fatal (_("disassemble_fn returned length %d"),
1884 octets);
1885 exit_status = 1;
1886 }
1887 break;
1888 }
1889 }
1890 else
1891 {
1892 bfd_vma j;
1893
1894 octets = octets_per_line;
1895 if (addr_offset + octets / opb > stop_offset)
1896 octets = (stop_offset - addr_offset) * opb;
1897
1898 for (j = addr_offset * opb; j < addr_offset * opb + octets; ++j)
1899 {
1900 if (ISPRINT (data[j]))
1901 buf[j - addr_offset * opb] = data[j];
1902 else
1903 buf[j - addr_offset * opb] = '.';
1904 }
1905 buf[j - addr_offset * opb] = '\0';
1906 }
1907
1908 if (prefix_addresses
1909 ? show_raw_insn > 0
1910 : show_raw_insn >= 0)
1911 {
1912 bfd_vma j;
1913
1914 /* If ! prefix_addresses and ! wide_output, we print
1915 octets_per_line octets per line. */
1916 pb = octets;
1917 if (pb > octets_per_line && ! prefix_addresses && ! wide_output)
1918 pb = octets_per_line;
1919
1920 if (inf->bytes_per_chunk)
1921 bpc = inf->bytes_per_chunk;
1922 else
1923 bpc = 1;
1924
1925 for (j = addr_offset * opb; j < addr_offset * opb + pb; j += bpc)
1926 {
1927 /* PR 21580: Check for a buffer ending early. */
1928 if (j + bpc <= stop_offset * opb)
1929 {
1930 int k;
1931
1932 if (inf->display_endian == BFD_ENDIAN_LITTLE)
1933 {
1934 for (k = bpc - 1; k >= 0; k--)
1935 printf ("%02x", (unsigned) data[j + k]);
1936 }
1937 else
1938 {
1939 for (k = 0; k < bpc; k++)
1940 printf ("%02x", (unsigned) data[j + k]);
1941 }
1942 }
1943 putchar (' ');
1944 }
1945
1946 for (; pb < octets_per_line; pb += bpc)
1947 {
1948 int k;
1949
1950 for (k = 0; k < bpc; k++)
1951 printf (" ");
1952 putchar (' ');
1953 }
1954
1955 /* Separate raw data from instruction by extra space. */
1956 if (insns)
1957 putchar ('\t');
1958 else
1959 printf (" ");
1960 }
1961
1962 if (! insns)
1963 printf ("%s", buf);
1964 else if (sfile.pos)
1965 printf ("%s", sfile.buffer);
1966
1967 if (prefix_addresses
1968 ? show_raw_insn > 0
1969 : show_raw_insn >= 0)
1970 {
1971 while (pb < octets)
1972 {
1973 bfd_vma j;
1974 char *s;
1975
1976 putchar ('\n');
1977 j = addr_offset * opb + pb;
1978
1979 bfd_sprintf_vma (aux->abfd, buf, section->vma + j / opb);
1980 for (s = buf + skip_addr_chars; *s == '0'; s++)
1981 *s = ' ';
1982 if (*s == '\0')
1983 *--s = '0';
1984 printf ("%s:\t", buf + skip_addr_chars);
1985
1986 pb += octets_per_line;
1987 if (pb > octets)
1988 pb = octets;
1989 for (; j < addr_offset * opb + pb; j += bpc)
1990 {
1991 /* PR 21619: Check for a buffer ending early. */
1992 if (j + bpc <= stop_offset * opb)
1993 {
1994 int k;
1995
1996 if (inf->display_endian == BFD_ENDIAN_LITTLE)
1997 {
1998 for (k = bpc - 1; k >= 0; k--)
1999 printf ("%02x", (unsigned) data[j + k]);
2000 }
2001 else
2002 {
2003 for (k = 0; k < bpc; k++)
2004 printf ("%02x", (unsigned) data[j + k]);
2005 }
2006 }
2007 putchar (' ');
2008 }
2009 }
2010 }
2011
2012 if (!wide_output)
2013 putchar ('\n');
2014 else
2015 need_nl = TRUE;
2016 }
2017
2018 while ((*relppp) < relppend
2019 && (**relppp)->address < rel_offset + addr_offset + octets / opb)
2020 {
2021 if (dump_reloc_info || dump_dynamic_reloc_info)
2022 {
2023 arelent *q;
2024
2025 q = **relppp;
2026
2027 if (wide_output)
2028 putchar ('\t');
2029 else
2030 printf ("\t\t\t");
2031
2032 objdump_print_value (section->vma - rel_offset + q->address,
2033 inf, TRUE);
2034
2035 if (q->howto == NULL)
2036 printf (": *unknown*\t");
2037 else if (q->howto->name)
2038 printf (": %s\t", q->howto->name);
2039 else
2040 printf (": %d\t", q->howto->type);
2041
2042 if (q->sym_ptr_ptr == NULL || *q->sym_ptr_ptr == NULL)
2043 printf ("*unknown*");
2044 else
2045 {
2046 const char *sym_name;
2047
2048 sym_name = bfd_asymbol_name (*q->sym_ptr_ptr);
2049 if (sym_name != NULL && *sym_name != '\0')
2050 objdump_print_symname (aux->abfd, inf, *q->sym_ptr_ptr);
2051 else
2052 {
2053 asection *sym_sec;
2054
2055 sym_sec = bfd_get_section (*q->sym_ptr_ptr);
2056 sym_name = bfd_get_section_name (aux->abfd, sym_sec);
2057 if (sym_name == NULL || *sym_name == '\0')
2058 sym_name = "*unknown*";
2059 printf ("%s", sym_name);
2060 }
2061 }
2062
2063 if (q->addend)
2064 {
2065 bfd_signed_vma addend = q->addend;
2066 if (addend < 0)
2067 {
2068 printf ("-0x");
2069 addend = -addend;
2070 }
2071 else
2072 printf ("+0x");
2073 objdump_print_value (addend, inf, TRUE);
2074 }
2075
2076 printf ("\n");
2077 need_nl = FALSE;
2078 }
2079 ++(*relppp);
2080 }
2081
2082 if (need_nl)
2083 printf ("\n");
2084
2085 addr_offset += octets / opb;
2086 }
2087
2088 free (sfile.buffer);
2089 }
2090
2091 static void
2092 disassemble_section (bfd *abfd, asection *section, void *inf)
2093 {
2094 const struct elf_backend_data * bed;
2095 bfd_vma sign_adjust = 0;
2096 struct disassemble_info * pinfo = (struct disassemble_info *) inf;
2097 struct objdump_disasm_info * paux;
2098 unsigned int opb = pinfo->octets_per_byte;
2099 bfd_byte * data = NULL;
2100 bfd_size_type datasize = 0;
2101 arelent ** rel_pp = NULL;
2102 arelent ** rel_ppstart = NULL;
2103 arelent ** rel_ppend;
2104 bfd_vma stop_offset;
2105 asymbol * sym = NULL;
2106 long place = 0;
2107 long rel_count;
2108 bfd_vma rel_offset;
2109 unsigned long addr_offset;
2110
2111 /* Sections that do not contain machine
2112 code are not normally disassembled. */
2113 if (! disassemble_all
2114 && only_list == NULL
2115 && ((section->flags & (SEC_CODE | SEC_HAS_CONTENTS))
2116 != (SEC_CODE | SEC_HAS_CONTENTS)))
2117 return;
2118
2119 if (! process_section_p (section))
2120 return;
2121
2122 datasize = bfd_get_section_size (section);
2123 if (datasize == 0)
2124 return;
2125
2126 if (start_address == (bfd_vma) -1
2127 || start_address < section->vma)
2128 addr_offset = 0;
2129 else
2130 addr_offset = start_address - section->vma;
2131
2132 if (stop_address == (bfd_vma) -1)
2133 stop_offset = datasize / opb;
2134 else
2135 {
2136 if (stop_address < section->vma)
2137 stop_offset = 0;
2138 else
2139 stop_offset = stop_address - section->vma;
2140 if (stop_offset > datasize / opb)
2141 stop_offset = datasize / opb;
2142 }
2143
2144 if (addr_offset >= stop_offset)
2145 return;
2146
2147 /* Decide which set of relocs to use. Load them if necessary. */
2148 paux = (struct objdump_disasm_info *) pinfo->application_data;
2149 if (paux->dynrelbuf && dump_dynamic_reloc_info)
2150 {
2151 rel_pp = paux->dynrelbuf;
2152 rel_count = paux->dynrelcount;
2153 /* Dynamic reloc addresses are absolute, non-dynamic are section
2154 relative. REL_OFFSET specifies the reloc address corresponding
2155 to the start of this section. */
2156 rel_offset = section->vma;
2157 }
2158 else
2159 {
2160 rel_count = 0;
2161 rel_pp = NULL;
2162 rel_offset = 0;
2163
2164 if ((section->flags & SEC_RELOC) != 0
2165 && (dump_reloc_info || pinfo->disassembler_needs_relocs))
2166 {
2167 long relsize;
2168
2169 relsize = bfd_get_reloc_upper_bound (abfd, section);
2170 if (relsize < 0)
2171 bfd_fatal (bfd_get_filename (abfd));
2172
2173 if (relsize > 0)
2174 {
2175 rel_ppstart = rel_pp = (arelent **) xmalloc (relsize);
2176 rel_count = bfd_canonicalize_reloc (abfd, section, rel_pp, syms);
2177 if (rel_count < 0)
2178 bfd_fatal (bfd_get_filename (abfd));
2179
2180 /* Sort the relocs by address. */
2181 qsort (rel_pp, rel_count, sizeof (arelent *), compare_relocs);
2182 }
2183 }
2184 }
2185 rel_ppend = rel_pp + rel_count;
2186
2187 if (!bfd_malloc_and_get_section (abfd, section, &data))
2188 {
2189 non_fatal (_("Reading section %s failed because: %s"),
2190 section->name, bfd_errmsg (bfd_get_error ()));
2191 return;
2192 }
2193
2194 paux->sec = section;
2195 pinfo->buffer = data;
2196 pinfo->buffer_vma = section->vma;
2197 pinfo->buffer_length = datasize;
2198 pinfo->section = section;
2199
2200 /* Skip over the relocs belonging to addresses below the
2201 start address. */
2202 while (rel_pp < rel_ppend
2203 && (*rel_pp)->address < rel_offset + addr_offset)
2204 ++rel_pp;
2205
2206 printf (_("\nDisassembly of section %s:\n"), section->name);
2207
2208 /* Find the nearest symbol forwards from our current position. */
2209 paux->require_sec = TRUE;
2210 sym = (asymbol *) find_symbol_for_address (section->vma + addr_offset,
2211 (struct disassemble_info *) inf,
2212 &place);
2213 paux->require_sec = FALSE;
2214
2215 /* PR 9774: If the target used signed addresses then we must make
2216 sure that we sign extend the value that we calculate for 'addr'
2217 in the loop below. */
2218 if (bfd_get_flavour (abfd) == bfd_target_elf_flavour
2219 && (bed = get_elf_backend_data (abfd)) != NULL
2220 && bed->sign_extend_vma)
2221 sign_adjust = (bfd_vma) 1 << (bed->s->arch_size - 1);
2222
2223 /* Disassemble a block of instructions up to the address associated with
2224 the symbol we have just found. Then print the symbol and find the
2225 next symbol on. Repeat until we have disassembled the entire section
2226 or we have reached the end of the address range we are interested in. */
2227 while (addr_offset < stop_offset)
2228 {
2229 bfd_vma addr;
2230 asymbol *nextsym;
2231 bfd_vma nextstop_offset;
2232 bfd_boolean insns;
2233
2234 addr = section->vma + addr_offset;
2235 addr = ((addr & ((sign_adjust << 1) - 1)) ^ sign_adjust) - sign_adjust;
2236
2237 if (sym != NULL && bfd_asymbol_value (sym) <= addr)
2238 {
2239 int x;
2240
2241 for (x = place;
2242 (x < sorted_symcount
2243 && (bfd_asymbol_value (sorted_syms[x]) <= addr));
2244 ++x)
2245 continue;
2246
2247 pinfo->symbols = sorted_syms + place;
2248 pinfo->num_symbols = x - place;
2249 pinfo->symtab_pos = place;
2250 }
2251 else
2252 {
2253 pinfo->symbols = NULL;
2254 pinfo->num_symbols = 0;
2255 pinfo->symtab_pos = -1;
2256 }
2257
2258 if (! prefix_addresses)
2259 {
2260 pinfo->fprintf_func (pinfo->stream, "\n");
2261 objdump_print_addr_with_sym (abfd, section, sym, addr,
2262 pinfo, FALSE);
2263 pinfo->fprintf_func (pinfo->stream, ":\n");
2264 }
2265
2266 if (sym != NULL && bfd_asymbol_value (sym) > addr)
2267 nextsym = sym;
2268 else if (sym == NULL)
2269 nextsym = NULL;
2270 else
2271 {
2272 #define is_valid_next_sym(SYM) \
2273 ((SYM)->section == section \
2274 && (bfd_asymbol_value (SYM) > bfd_asymbol_value (sym)) \
2275 && pinfo->symbol_is_valid (SYM, pinfo))
2276
2277 /* Search forward for the next appropriate symbol in
2278 SECTION. Note that all the symbols are sorted
2279 together into one big array, and that some sections
2280 may have overlapping addresses. */
2281 while (place < sorted_symcount
2282 && ! is_valid_next_sym (sorted_syms [place]))
2283 ++place;
2284
2285 if (place >= sorted_symcount)
2286 nextsym = NULL;
2287 else
2288 nextsym = sorted_syms[place];
2289 }
2290
2291 if (sym != NULL && bfd_asymbol_value (sym) > addr)
2292 nextstop_offset = bfd_asymbol_value (sym) - section->vma;
2293 else if (nextsym == NULL)
2294 nextstop_offset = stop_offset;
2295 else
2296 nextstop_offset = bfd_asymbol_value (nextsym) - section->vma;
2297
2298 if (nextstop_offset > stop_offset
2299 || nextstop_offset <= addr_offset)
2300 nextstop_offset = stop_offset;
2301
2302 /* If a symbol is explicitly marked as being an object
2303 rather than a function, just dump the bytes without
2304 disassembling them. */
2305 if (disassemble_all
2306 || sym == NULL
2307 || sym->section != section
2308 || bfd_asymbol_value (sym) > addr
2309 || ((sym->flags & BSF_OBJECT) == 0
2310 && (strstr (bfd_asymbol_name (sym), "gnu_compiled")
2311 == NULL)
2312 && (strstr (bfd_asymbol_name (sym), "gcc2_compiled")
2313 == NULL))
2314 || (sym->flags & BSF_FUNCTION) != 0)
2315 insns = TRUE;
2316 else
2317 insns = FALSE;
2318
2319 disassemble_bytes (pinfo, paux->disassemble_fn, insns, data,
2320 addr_offset, nextstop_offset,
2321 rel_offset, &rel_pp, rel_ppend);
2322
2323 addr_offset = nextstop_offset;
2324 sym = nextsym;
2325 }
2326
2327 free (data);
2328
2329 if (rel_ppstart != NULL)
2330 free (rel_ppstart);
2331 }
2332
2333 /* Disassemble the contents of an object file. */
2334
2335 static void
2336 disassemble_data (bfd *abfd)
2337 {
2338 struct disassemble_info disasm_info;
2339 struct objdump_disasm_info aux;
2340 long i;
2341
2342 print_files = NULL;
2343 prev_functionname = NULL;
2344 prev_line = -1;
2345 prev_discriminator = 0;
2346
2347 /* We make a copy of syms to sort. We don't want to sort syms
2348 because that will screw up the relocs. */
2349 sorted_symcount = symcount ? symcount : dynsymcount;
2350 sorted_syms = (asymbol **) xmalloc ((sorted_symcount + synthcount)
2351 * sizeof (asymbol *));
2352 memcpy (sorted_syms, symcount ? syms : dynsyms,
2353 sorted_symcount * sizeof (asymbol *));
2354
2355 sorted_symcount = remove_useless_symbols (sorted_syms, sorted_symcount);
2356
2357 for (i = 0; i < synthcount; ++i)
2358 {
2359 sorted_syms[sorted_symcount] = synthsyms + i;
2360 ++sorted_symcount;
2361 }
2362
2363 /* Sort the symbols into section and symbol order. */
2364 qsort (sorted_syms, sorted_symcount, sizeof (asymbol *), compare_symbols);
2365
2366 init_disassemble_info (&disasm_info, stdout, (fprintf_ftype) fprintf);
2367
2368 disasm_info.application_data = (void *) &aux;
2369 aux.abfd = abfd;
2370 aux.require_sec = FALSE;
2371 aux.dynrelbuf = NULL;
2372 aux.dynrelcount = 0;
2373 aux.reloc = NULL;
2374
2375 disasm_info.print_address_func = objdump_print_address;
2376 disasm_info.symbol_at_address_func = objdump_symbol_at_address;
2377
2378 if (machine != NULL)
2379 {
2380 const bfd_arch_info_type *inf = bfd_scan_arch (machine);
2381
2382 if (inf == NULL)
2383 fatal (_("can't use supplied machine %s"), machine);
2384
2385 abfd->arch_info = inf;
2386 }
2387
2388 if (endian != BFD_ENDIAN_UNKNOWN)
2389 {
2390 struct bfd_target *xvec;
2391
2392 xvec = (struct bfd_target *) xmalloc (sizeof (struct bfd_target));
2393 memcpy (xvec, abfd->xvec, sizeof (struct bfd_target));
2394 xvec->byteorder = endian;
2395 abfd->xvec = xvec;
2396 }
2397
2398 /* Use libopcodes to locate a suitable disassembler. */
2399 aux.disassemble_fn = disassembler (bfd_get_arch (abfd),
2400 bfd_big_endian (abfd),
2401 bfd_get_mach (abfd), abfd);
2402 if (!aux.disassemble_fn)
2403 {
2404 non_fatal (_("can't disassemble for architecture %s\n"),
2405 bfd_printable_arch_mach (bfd_get_arch (abfd), 0));
2406 exit_status = 1;
2407 return;
2408 }
2409
2410 disasm_info.flavour = bfd_get_flavour (abfd);
2411 disasm_info.arch = bfd_get_arch (abfd);
2412 disasm_info.mach = bfd_get_mach (abfd);
2413 disasm_info.disassembler_options = disassembler_options;
2414 disasm_info.octets_per_byte = bfd_octets_per_byte (abfd);
2415 disasm_info.skip_zeroes = DEFAULT_SKIP_ZEROES;
2416 disasm_info.skip_zeroes_at_end = DEFAULT_SKIP_ZEROES_AT_END;
2417 disasm_info.disassembler_needs_relocs = FALSE;
2418
2419 if (bfd_big_endian (abfd))
2420 disasm_info.display_endian = disasm_info.endian = BFD_ENDIAN_BIG;
2421 else if (bfd_little_endian (abfd))
2422 disasm_info.display_endian = disasm_info.endian = BFD_ENDIAN_LITTLE;
2423 else
2424 /* ??? Aborting here seems too drastic. We could default to big or little
2425 instead. */
2426 disasm_info.endian = BFD_ENDIAN_UNKNOWN;
2427
2428 /* Allow the target to customize the info structure. */
2429 disassemble_init_for_target (& disasm_info);
2430
2431 /* Pre-load the dynamic relocs as we may need them during the disassembly. */
2432 {
2433 long relsize = bfd_get_dynamic_reloc_upper_bound (abfd);
2434
2435 if (relsize < 0 && dump_dynamic_reloc_info)
2436 bfd_fatal (bfd_get_filename (abfd));
2437
2438 if (relsize > 0)
2439 {
2440 aux.dynrelbuf = (arelent **) xmalloc (relsize);
2441 aux.dynrelcount = bfd_canonicalize_dynamic_reloc (abfd,
2442 aux.dynrelbuf,
2443 dynsyms);
2444 if (aux.dynrelcount < 0)
2445 bfd_fatal (bfd_get_filename (abfd));
2446
2447 /* Sort the relocs by address. */
2448 qsort (aux.dynrelbuf, aux.dynrelcount, sizeof (arelent *),
2449 compare_relocs);
2450 }
2451 }
2452 disasm_info.symtab = sorted_syms;
2453 disasm_info.symtab_size = sorted_symcount;
2454
2455 bfd_map_over_sections (abfd, disassemble_section, & disasm_info);
2456
2457 if (aux.dynrelbuf != NULL)
2458 free (aux.dynrelbuf);
2459 free (sorted_syms);
2460 }
2461 \f
2462 static bfd_boolean
2463 load_specific_debug_section (enum dwarf_section_display_enum debug,
2464 asection *sec, void *file)
2465 {
2466 struct dwarf_section *section = &debug_displays [debug].section;
2467 bfd *abfd = (bfd *) file;
2468 bfd_byte *contents;
2469 bfd_size_type amt;
2470
2471 if (section->start != NULL)
2472 {
2473 /* If it is already loaded, do nothing. */
2474 if (streq (section->filename, bfd_get_filename (abfd)))
2475 return TRUE;
2476 free (section->start);
2477 }
2478
2479 section->filename = bfd_get_filename (abfd);
2480 section->reloc_info = NULL;
2481 section->num_relocs = 0;
2482 section->address = bfd_get_section_vma (abfd, sec);
2483 section->size = bfd_get_section_size (sec);
2484 amt = section->size + 1;
2485 section->start = contents = malloc (amt);
2486 section->user_data = sec;
2487 if (amt == 0
2488 || section->start == NULL
2489 || !bfd_get_full_section_contents (abfd, sec, &contents))
2490 {
2491 free_debug_section (debug);
2492 printf (_("\nCan't get contents for section '%s'.\n"),
2493 section->name);
2494 return FALSE;
2495 }
2496 /* Ensure any string section has a terminating NUL. */
2497 section->start[section->size] = 0;
2498
2499 if (is_relocatable && debug_displays [debug].relocate)
2500 {
2501 long reloc_size;
2502 bfd_boolean ret;
2503
2504 bfd_cache_section_contents (sec, section->start);
2505
2506 ret = bfd_simple_get_relocated_section_contents (abfd,
2507 sec,
2508 section->start,
2509 syms) != NULL;
2510
2511 if (! ret)
2512 {
2513 free_debug_section (debug);
2514 printf (_("\nCan't get contents for section '%s'.\n"),
2515 section->name);
2516 return FALSE;
2517 }
2518
2519 reloc_size = bfd_get_reloc_upper_bound (abfd, sec);
2520 if (reloc_size > 0)
2521 {
2522 unsigned long reloc_count;
2523 arelent **relocs;
2524
2525 relocs = (arelent **) xmalloc (reloc_size);
2526
2527 reloc_count = bfd_canonicalize_reloc (abfd, sec, relocs, NULL);
2528 if (reloc_count == 0)
2529 free (relocs);
2530 else
2531 {
2532 section->reloc_info = relocs;
2533 section->num_relocs = reloc_count;
2534 }
2535 }
2536 }
2537
2538 return TRUE;
2539 }
2540
2541 bfd_boolean
2542 reloc_at (struct dwarf_section * dsec, dwarf_vma offset)
2543 {
2544 arelent ** relocs;
2545 arelent * rp;
2546
2547 if (dsec == NULL || dsec->reloc_info == NULL)
2548 return FALSE;
2549
2550 relocs = (arelent **) dsec->reloc_info;
2551
2552 for (; (rp = * relocs) != NULL; ++ relocs)
2553 if (rp->address == offset)
2554 return TRUE;
2555
2556 return FALSE;
2557 }
2558
2559 bfd_boolean
2560 load_debug_section (enum dwarf_section_display_enum debug, void *file)
2561 {
2562 struct dwarf_section *section = &debug_displays [debug].section;
2563 bfd *abfd = (bfd *) file;
2564 asection *sec;
2565
2566 /* If it is already loaded, do nothing. */
2567 if (section->start != NULL)
2568 {
2569 if (streq (section->filename, bfd_get_filename (abfd)))
2570 return TRUE;
2571 }
2572
2573 /* Locate the debug section. */
2574 sec = bfd_get_section_by_name (abfd, section->uncompressed_name);
2575 if (sec != NULL)
2576 section->name = section->uncompressed_name;
2577 else
2578 {
2579 sec = bfd_get_section_by_name (abfd, section->compressed_name);
2580 if (sec != NULL)
2581 section->name = section->compressed_name;
2582 }
2583 if (sec == NULL)
2584 return FALSE;
2585
2586 return load_specific_debug_section (debug, sec, file);
2587 }
2588
2589 void
2590 free_debug_section (enum dwarf_section_display_enum debug)
2591 {
2592 struct dwarf_section *section = &debug_displays [debug].section;
2593
2594 if (section->start == NULL)
2595 return;
2596
2597 /* PR 17512: file: 0f67f69d. */
2598 if (section->user_data != NULL)
2599 {
2600 asection * sec = (asection *) section->user_data;
2601
2602 /* If we are freeing contents that are also pointed to by the BFD
2603 library's section structure then make sure to update those pointers
2604 too. Otherwise, the next time we try to load data for this section
2605 we can end up using a stale pointer. */
2606 if (section->start == sec->contents)
2607 {
2608 sec->contents = NULL;
2609 sec->flags &= ~ SEC_IN_MEMORY;
2610 sec->compress_status = COMPRESS_SECTION_NONE;
2611 }
2612 }
2613
2614 free ((char *) section->start);
2615 section->start = NULL;
2616 section->address = 0;
2617 section->size = 0;
2618 }
2619
2620 void
2621 close_debug_file (void * file)
2622 {
2623 bfd * abfd = (bfd *) file;
2624
2625 bfd_close (abfd);
2626 }
2627
2628 void *
2629 open_debug_file (const char * pathname)
2630 {
2631 bfd * data;
2632
2633 data = bfd_openr (pathname, NULL);
2634 if (data == NULL)
2635 return NULL;
2636
2637 if (! bfd_check_format (data, bfd_object))
2638 return NULL;
2639
2640 return data;
2641 }
2642
2643 static void
2644 dump_dwarf_section (bfd *abfd, asection *section,
2645 void *arg ATTRIBUTE_UNUSED)
2646 {
2647 const char *name = bfd_get_section_name (abfd, section);
2648 const char *match;
2649 int i;
2650
2651 if (CONST_STRNEQ (name, ".gnu.linkonce.wi."))
2652 match = ".debug_info";
2653 else
2654 match = name;
2655
2656 for (i = 0; i < max; i++)
2657 if ((strcmp (debug_displays [i].section.uncompressed_name, match) == 0
2658 || strcmp (debug_displays [i].section.compressed_name, match) == 0)
2659 && debug_displays [i].enabled != NULL
2660 && *debug_displays [i].enabled)
2661 {
2662 struct dwarf_section *sec = &debug_displays [i].section;
2663
2664 if (strcmp (sec->uncompressed_name, match) == 0)
2665 sec->name = sec->uncompressed_name;
2666 else
2667 sec->name = sec->compressed_name;
2668 if (load_specific_debug_section ((enum dwarf_section_display_enum) i,
2669 section, abfd))
2670 {
2671 debug_displays [i].display (sec, abfd);
2672
2673 if (i != info && i != abbrev)
2674 free_debug_section ((enum dwarf_section_display_enum) i);
2675 }
2676 break;
2677 }
2678 }
2679
2680 /* Dump the dwarf debugging information. */
2681
2682 static void
2683 dump_dwarf (bfd *abfd)
2684 {
2685 bfd * separates;
2686
2687 is_relocatable = (abfd->flags & (EXEC_P | DYNAMIC)) == 0;
2688
2689 eh_addr_size = bfd_arch_bits_per_address (abfd) / 8;
2690
2691 if (bfd_big_endian (abfd))
2692 byte_get = byte_get_big_endian;
2693 else if (bfd_little_endian (abfd))
2694 byte_get = byte_get_little_endian;
2695 else
2696 /* PR 17512: file: objdump-s-endless-loop.tekhex. */
2697 {
2698 warn (_("File %s does not contain any dwarf debug information\n"),
2699 bfd_get_filename (abfd));
2700 return;
2701 }
2702
2703 switch (bfd_get_arch (abfd))
2704 {
2705 case bfd_arch_i386:
2706 switch (bfd_get_mach (abfd))
2707 {
2708 case bfd_mach_x86_64:
2709 case bfd_mach_x86_64_intel_syntax:
2710 case bfd_mach_x86_64_nacl:
2711 case bfd_mach_x64_32:
2712 case bfd_mach_x64_32_intel_syntax:
2713 case bfd_mach_x64_32_nacl:
2714 init_dwarf_regnames_x86_64 ();
2715 break;
2716
2717 default:
2718 init_dwarf_regnames_i386 ();
2719 break;
2720 }
2721 break;
2722
2723 case bfd_arch_iamcu:
2724 init_dwarf_regnames_iamcu ();
2725 break;
2726
2727 case bfd_arch_aarch64:
2728 init_dwarf_regnames_aarch64();
2729 break;
2730
2731 case bfd_arch_s390:
2732 init_dwarf_regnames_s390 ();
2733 break;
2734
2735 default:
2736 break;
2737 }
2738
2739 separates = load_separate_debug_file (abfd, bfd_get_filename (abfd));
2740
2741 bfd_map_over_sections (abfd, dump_dwarf_section, NULL);
2742
2743 if (separates)
2744 bfd_map_over_sections (separates, dump_dwarf_section, NULL);
2745
2746 free_debug_memory ();
2747 }
2748 \f
2749 /* Read ABFD's stabs section STABSECT_NAME, and return a pointer to
2750 it. Return NULL on failure. */
2751
2752 static bfd_byte *
2753 read_section_stabs (bfd *abfd, const char *sect_name, bfd_size_type *size_ptr)
2754 {
2755 asection *stabsect;
2756 bfd_byte *contents;
2757
2758 stabsect = bfd_get_section_by_name (abfd, sect_name);
2759 if (stabsect == NULL)
2760 {
2761 printf (_("No %s section present\n\n"), sect_name);
2762 return FALSE;
2763 }
2764
2765 if (!bfd_malloc_and_get_section (abfd, stabsect, &contents))
2766 {
2767 non_fatal (_("reading %s section of %s failed: %s"),
2768 sect_name, bfd_get_filename (abfd),
2769 bfd_errmsg (bfd_get_error ()));
2770 exit_status = 1;
2771 free (contents);
2772 return NULL;
2773 }
2774
2775 *size_ptr = bfd_section_size (abfd, stabsect);
2776
2777 return contents;
2778 }
2779
2780 /* Stabs entries use a 12 byte format:
2781 4 byte string table index
2782 1 byte stab type
2783 1 byte stab other field
2784 2 byte stab desc field
2785 4 byte stab value
2786 FIXME: This will have to change for a 64 bit object format. */
2787
2788 #define STRDXOFF (0)
2789 #define TYPEOFF (4)
2790 #define OTHEROFF (5)
2791 #define DESCOFF (6)
2792 #define VALOFF (8)
2793 #define STABSIZE (12)
2794
2795 /* Print ABFD's stabs section STABSECT_NAME (in `stabs'),
2796 using string table section STRSECT_NAME (in `strtab'). */
2797
2798 static void
2799 print_section_stabs (bfd *abfd,
2800 const char *stabsect_name,
2801 unsigned *string_offset_ptr)
2802 {
2803 int i;
2804 unsigned file_string_table_offset = 0;
2805 unsigned next_file_string_table_offset = *string_offset_ptr;
2806 bfd_byte *stabp, *stabs_end;
2807
2808 stabp = stabs;
2809 stabs_end = stabp + stab_size;
2810
2811 printf (_("Contents of %s section:\n\n"), stabsect_name);
2812 printf ("Symnum n_type n_othr n_desc n_value n_strx String\n");
2813
2814 /* Loop through all symbols and print them.
2815
2816 We start the index at -1 because there is a dummy symbol on
2817 the front of stabs-in-{coff,elf} sections that supplies sizes. */
2818 for (i = -1; stabp <= stabs_end - STABSIZE; stabp += STABSIZE, i++)
2819 {
2820 const char *name;
2821 unsigned long strx;
2822 unsigned char type, other;
2823 unsigned short desc;
2824 bfd_vma value;
2825
2826 strx = bfd_h_get_32 (abfd, stabp + STRDXOFF);
2827 type = bfd_h_get_8 (abfd, stabp + TYPEOFF);
2828 other = bfd_h_get_8 (abfd, stabp + OTHEROFF);
2829 desc = bfd_h_get_16 (abfd, stabp + DESCOFF);
2830 value = bfd_h_get_32 (abfd, stabp + VALOFF);
2831
2832 printf ("\n%-6d ", i);
2833 /* Either print the stab name, or, if unnamed, print its number
2834 again (makes consistent formatting for tools like awk). */
2835 name = bfd_get_stab_name (type);
2836 if (name != NULL)
2837 printf ("%-6s", name);
2838 else if (type == N_UNDF)
2839 printf ("HdrSym");
2840 else
2841 printf ("%-6d", type);
2842 printf (" %-6d %-6d ", other, desc);
2843 bfd_printf_vma (abfd, value);
2844 printf (" %-6lu", strx);
2845
2846 /* Symbols with type == 0 (N_UNDF) specify the length of the
2847 string table associated with this file. We use that info
2848 to know how to relocate the *next* file's string table indices. */
2849 if (type == N_UNDF)
2850 {
2851 file_string_table_offset = next_file_string_table_offset;
2852 next_file_string_table_offset += value;
2853 }
2854 else
2855 {
2856 bfd_size_type amt = strx + file_string_table_offset;
2857
2858 /* Using the (possibly updated) string table offset, print the
2859 string (if any) associated with this symbol. */
2860 if (amt < stabstr_size)
2861 /* PR 17512: file: 079-79389-0.001:0.1. */
2862 printf (" %.*s", (int)(stabstr_size - amt), strtab + amt);
2863 else
2864 printf (" *");
2865 }
2866 }
2867 printf ("\n\n");
2868 *string_offset_ptr = next_file_string_table_offset;
2869 }
2870
2871 typedef struct
2872 {
2873 const char * section_name;
2874 const char * string_section_name;
2875 unsigned string_offset;
2876 }
2877 stab_section_names;
2878
2879 static void
2880 find_stabs_section (bfd *abfd, asection *section, void *names)
2881 {
2882 int len;
2883 stab_section_names * sought = (stab_section_names *) names;
2884
2885 /* Check for section names for which stabsect_name is a prefix, to
2886 handle .stab.N, etc. */
2887 len = strlen (sought->section_name);
2888
2889 /* If the prefix matches, and the files section name ends with a
2890 nul or a digit, then we match. I.e., we want either an exact
2891 match or a section followed by a number. */
2892 if (strncmp (sought->section_name, section->name, len) == 0
2893 && (section->name[len] == 0
2894 || (section->name[len] == '.' && ISDIGIT (section->name[len + 1]))))
2895 {
2896 if (strtab == NULL)
2897 strtab = read_section_stabs (abfd, sought->string_section_name,
2898 &stabstr_size);
2899
2900 if (strtab)
2901 {
2902 stabs = read_section_stabs (abfd, section->name, &stab_size);
2903 if (stabs)
2904 print_section_stabs (abfd, section->name, &sought->string_offset);
2905 }
2906 }
2907 }
2908
2909 static void
2910 dump_stabs_section (bfd *abfd, char *stabsect_name, char *strsect_name)
2911 {
2912 stab_section_names s;
2913
2914 s.section_name = stabsect_name;
2915 s.string_section_name = strsect_name;
2916 s.string_offset = 0;
2917
2918 bfd_map_over_sections (abfd, find_stabs_section, & s);
2919
2920 free (strtab);
2921 strtab = NULL;
2922 }
2923
2924 /* Dump the any sections containing stabs debugging information. */
2925
2926 static void
2927 dump_stabs (bfd *abfd)
2928 {
2929 dump_stabs_section (abfd, ".stab", ".stabstr");
2930 dump_stabs_section (abfd, ".stab.excl", ".stab.exclstr");
2931 dump_stabs_section (abfd, ".stab.index", ".stab.indexstr");
2932
2933 /* For Darwin. */
2934 dump_stabs_section (abfd, "LC_SYMTAB.stabs", "LC_SYMTAB.stabstr");
2935
2936 dump_stabs_section (abfd, "$GDB_SYMBOLS$", "$GDB_STRINGS$");
2937 }
2938 \f
2939 static void
2940 dump_bfd_header (bfd *abfd)
2941 {
2942 char *comma = "";
2943
2944 printf (_("architecture: %s, "),
2945 bfd_printable_arch_mach (bfd_get_arch (abfd),
2946 bfd_get_mach (abfd)));
2947 printf (_("flags 0x%08x:\n"), abfd->flags & ~BFD_FLAGS_FOR_BFD_USE_MASK);
2948
2949 #define PF(x, y) if (abfd->flags & x) {printf("%s%s", comma, y); comma=", ";}
2950 PF (HAS_RELOC, "HAS_RELOC");
2951 PF (EXEC_P, "EXEC_P");
2952 PF (HAS_LINENO, "HAS_LINENO");
2953 PF (HAS_DEBUG, "HAS_DEBUG");
2954 PF (HAS_SYMS, "HAS_SYMS");
2955 PF (HAS_LOCALS, "HAS_LOCALS");
2956 PF (DYNAMIC, "DYNAMIC");
2957 PF (WP_TEXT, "WP_TEXT");
2958 PF (D_PAGED, "D_PAGED");
2959 PF (BFD_IS_RELAXABLE, "BFD_IS_RELAXABLE");
2960 printf (_("\nstart address 0x"));
2961 bfd_printf_vma (abfd, abfd->start_address);
2962 printf ("\n");
2963 }
2964
2965 \f
2966 static void
2967 dump_bfd_private_header (bfd *abfd)
2968 {
2969 bfd_print_private_bfd_data (abfd, stdout);
2970 }
2971
2972 static void
2973 dump_target_specific (bfd *abfd)
2974 {
2975 const struct objdump_private_desc * const *desc;
2976 struct objdump_private_option *opt;
2977 char *e, *b;
2978
2979 /* Find the desc. */
2980 for (desc = objdump_private_vectors; *desc != NULL; desc++)
2981 if ((*desc)->filter (abfd))
2982 break;
2983
2984 if (*desc == NULL)
2985 {
2986 non_fatal (_("option -P/--private not supported by this file"));
2987 return;
2988 }
2989
2990 /* Clear all options. */
2991 for (opt = (*desc)->options; opt->name; opt++)
2992 opt->selected = FALSE;
2993
2994 /* Decode options. */
2995 b = dump_private_options;
2996 do
2997 {
2998 e = strchr (b, ',');
2999
3000 if (e)
3001 *e = 0;
3002
3003 for (opt = (*desc)->options; opt->name; opt++)
3004 if (strcmp (opt->name, b) == 0)
3005 {
3006 opt->selected = TRUE;
3007 break;
3008 }
3009 if (opt->name == NULL)
3010 non_fatal (_("target specific dump '%s' not supported"), b);
3011
3012 if (e)
3013 {
3014 *e = ',';
3015 b = e + 1;
3016 }
3017 }
3018 while (e != NULL);
3019
3020 /* Dump. */
3021 (*desc)->dump (abfd);
3022 }
3023 \f
3024 /* Display a section in hexadecimal format with associated characters.
3025 Each line prefixed by the zero padded address. */
3026
3027 static void
3028 dump_section (bfd *abfd, asection *section, void *dummy ATTRIBUTE_UNUSED)
3029 {
3030 bfd_byte *data = NULL;
3031 bfd_size_type datasize;
3032 bfd_vma addr_offset;
3033 bfd_vma start_offset;
3034 bfd_vma stop_offset;
3035 unsigned int opb = bfd_octets_per_byte (abfd);
3036 /* Bytes per line. */
3037 const int onaline = 16;
3038 char buf[64];
3039 int count;
3040 int width;
3041
3042 if ((section->flags & SEC_HAS_CONTENTS) == 0)
3043 return;
3044
3045 if (! process_section_p (section))
3046 return;
3047
3048 if ((datasize = bfd_section_size (abfd, section)) == 0)
3049 return;
3050
3051 /* Compute the address range to display. */
3052 if (start_address == (bfd_vma) -1
3053 || start_address < section->vma)
3054 start_offset = 0;
3055 else
3056 start_offset = start_address - section->vma;
3057
3058 if (stop_address == (bfd_vma) -1)
3059 stop_offset = datasize / opb;
3060 else
3061 {
3062 if (stop_address < section->vma)
3063 stop_offset = 0;
3064 else
3065 stop_offset = stop_address - section->vma;
3066
3067 if (stop_offset > datasize / opb)
3068 stop_offset = datasize / opb;
3069 }
3070
3071 if (start_offset >= stop_offset)
3072 return;
3073
3074 printf (_("Contents of section %s:"), section->name);
3075 if (display_file_offsets)
3076 printf (_(" (Starting at file offset: 0x%lx)"),
3077 (unsigned long) (section->filepos + start_offset));
3078 printf ("\n");
3079
3080 if (!bfd_get_full_section_contents (abfd, section, &data))
3081 {
3082 non_fatal (_("Reading section %s failed because: %s"),
3083 section->name, bfd_errmsg (bfd_get_error ()));
3084 return;
3085 }
3086
3087 width = 4;
3088
3089 bfd_sprintf_vma (abfd, buf, start_offset + section->vma);
3090 if (strlen (buf) >= sizeof (buf))
3091 abort ();
3092
3093 count = 0;
3094 while (buf[count] == '0' && buf[count+1] != '\0')
3095 count++;
3096 count = strlen (buf) - count;
3097 if (count > width)
3098 width = count;
3099
3100 bfd_sprintf_vma (abfd, buf, stop_offset + section->vma - 1);
3101 if (strlen (buf) >= sizeof (buf))
3102 abort ();
3103
3104 count = 0;
3105 while (buf[count] == '0' && buf[count+1] != '\0')
3106 count++;
3107 count = strlen (buf) - count;
3108 if (count > width)
3109 width = count;
3110
3111 for (addr_offset = start_offset;
3112 addr_offset < stop_offset; addr_offset += onaline / opb)
3113 {
3114 bfd_size_type j;
3115
3116 bfd_sprintf_vma (abfd, buf, (addr_offset + section->vma));
3117 count = strlen (buf);
3118 if ((size_t) count >= sizeof (buf))
3119 abort ();
3120
3121 putchar (' ');
3122 while (count < width)
3123 {
3124 putchar ('0');
3125 count++;
3126 }
3127 fputs (buf + count - width, stdout);
3128 putchar (' ');
3129
3130 for (j = addr_offset * opb;
3131 j < addr_offset * opb + onaline; j++)
3132 {
3133 if (j < stop_offset * opb)
3134 printf ("%02x", (unsigned) (data[j]));
3135 else
3136 printf (" ");
3137 if ((j & 3) == 3)
3138 printf (" ");
3139 }
3140
3141 printf (" ");
3142 for (j = addr_offset * opb;
3143 j < addr_offset * opb + onaline; j++)
3144 {
3145 if (j >= stop_offset * opb)
3146 printf (" ");
3147 else
3148 printf ("%c", ISPRINT (data[j]) ? data[j] : '.');
3149 }
3150 putchar ('\n');
3151 }
3152 free (data);
3153 }
3154
3155 /* Actually display the various requested regions. */
3156
3157 static void
3158 dump_data (bfd *abfd)
3159 {
3160 bfd_map_over_sections (abfd, dump_section, NULL);
3161 }
3162
3163 /* Should perhaps share code and display with nm? */
3164
3165 static void
3166 dump_symbols (bfd *abfd ATTRIBUTE_UNUSED, bfd_boolean dynamic)
3167 {
3168 asymbol **current;
3169 long max_count;
3170 long count;
3171
3172 if (dynamic)
3173 {
3174 current = dynsyms;
3175 max_count = dynsymcount;
3176 printf ("DYNAMIC SYMBOL TABLE:\n");
3177 }
3178 else
3179 {
3180 current = syms;
3181 max_count = symcount;
3182 printf ("SYMBOL TABLE:\n");
3183 }
3184
3185 if (max_count == 0)
3186 printf (_("no symbols\n"));
3187
3188 for (count = 0; count < max_count; count++)
3189 {
3190 bfd *cur_bfd;
3191
3192 if (*current == NULL)
3193 printf (_("no information for symbol number %ld\n"), count);
3194
3195 else if ((cur_bfd = bfd_asymbol_bfd (*current)) == NULL)
3196 printf (_("could not determine the type of symbol number %ld\n"),
3197 count);
3198
3199 else if (process_section_p ((* current)->section)
3200 && (dump_special_syms
3201 || !bfd_is_target_special_symbol (cur_bfd, *current)))
3202 {
3203 const char *name = (*current)->name;
3204
3205 if (do_demangle && name != NULL && *name != '\0')
3206 {
3207 char *alloc;
3208
3209 /* If we want to demangle the name, we demangle it
3210 here, and temporarily clobber it while calling
3211 bfd_print_symbol. FIXME: This is a gross hack. */
3212 alloc = bfd_demangle (cur_bfd, name, DMGL_ANSI | DMGL_PARAMS);
3213 if (alloc != NULL)
3214 (*current)->name = alloc;
3215 bfd_print_symbol (cur_bfd, stdout, *current,
3216 bfd_print_symbol_all);
3217 if (alloc != NULL)
3218 {
3219 (*current)->name = name;
3220 free (alloc);
3221 }
3222 }
3223 else
3224 bfd_print_symbol (cur_bfd, stdout, *current,
3225 bfd_print_symbol_all);
3226 printf ("\n");
3227 }
3228
3229 current++;
3230 }
3231 printf ("\n\n");
3232 }
3233 \f
3234 static void
3235 dump_reloc_set (bfd *abfd, asection *sec, arelent **relpp, long relcount)
3236 {
3237 arelent **p;
3238 char *last_filename, *last_functionname;
3239 unsigned int last_line;
3240 unsigned int last_discriminator;
3241
3242 /* Get column headers lined up reasonably. */
3243 {
3244 static int width;
3245
3246 if (width == 0)
3247 {
3248 char buf[30];
3249
3250 bfd_sprintf_vma (abfd, buf, (bfd_vma) -1);
3251 width = strlen (buf) - 7;
3252 }
3253 printf ("OFFSET %*s TYPE %*s VALUE \n", width, "", 12, "");
3254 }
3255
3256 last_filename = NULL;
3257 last_functionname = NULL;
3258 last_line = 0;
3259 last_discriminator = 0;
3260
3261 for (p = relpp; relcount && *p != NULL; p++, relcount--)
3262 {
3263 arelent *q = *p;
3264 const char *filename, *functionname;
3265 unsigned int linenumber;
3266 unsigned int discriminator;
3267 const char *sym_name;
3268 const char *section_name;
3269 bfd_vma addend2 = 0;
3270
3271 if (start_address != (bfd_vma) -1
3272 && q->address < start_address)
3273 continue;
3274 if (stop_address != (bfd_vma) -1
3275 && q->address > stop_address)
3276 continue;
3277
3278 if (with_line_numbers
3279 && sec != NULL
3280 && bfd_find_nearest_line_discriminator (abfd, sec, syms, q->address,
3281 &filename, &functionname,
3282 &linenumber, &discriminator))
3283 {
3284 if (functionname != NULL
3285 && (last_functionname == NULL
3286 || strcmp (functionname, last_functionname) != 0))
3287 {
3288 printf ("%s():\n", functionname);
3289 if (last_functionname != NULL)
3290 free (last_functionname);
3291 last_functionname = xstrdup (functionname);
3292 }
3293
3294 if (linenumber > 0
3295 && (linenumber != last_line
3296 || (filename != NULL
3297 && last_filename != NULL
3298 && filename_cmp (filename, last_filename) != 0)
3299 || (discriminator != last_discriminator)))
3300 {
3301 if (discriminator > 0)
3302 printf ("%s:%u\n", filename == NULL ? "???" : filename, linenumber);
3303 else
3304 printf ("%s:%u (discriminator %u)\n", filename == NULL ? "???" : filename,
3305 linenumber, discriminator);
3306 last_line = linenumber;
3307 last_discriminator = discriminator;
3308 if (last_filename != NULL)
3309 free (last_filename);
3310 if (filename == NULL)
3311 last_filename = NULL;
3312 else
3313 last_filename = xstrdup (filename);
3314 }
3315 }
3316
3317 if (q->sym_ptr_ptr && *q->sym_ptr_ptr)
3318 {
3319 sym_name = (*(q->sym_ptr_ptr))->name;
3320 section_name = (*(q->sym_ptr_ptr))->section->name;
3321 }
3322 else
3323 {
3324 sym_name = NULL;
3325 section_name = NULL;
3326 }
3327
3328 bfd_printf_vma (abfd, q->address);
3329 if (q->howto == NULL)
3330 printf (" *unknown* ");
3331 else if (q->howto->name)
3332 {
3333 const char *name = q->howto->name;
3334
3335 /* R_SPARC_OLO10 relocations contain two addends.
3336 But because 'arelent' lacks enough storage to
3337 store them both, the 64-bit ELF Sparc backend
3338 records this as two relocations. One R_SPARC_LO10
3339 and one R_SPARC_13, both pointing to the same
3340 address. This is merely so that we have some
3341 place to store both addend fields.
3342
3343 Undo this transformation, otherwise the output
3344 will be confusing. */
3345 if (abfd->xvec->flavour == bfd_target_elf_flavour
3346 && elf_tdata(abfd)->elf_header->e_machine == EM_SPARCV9
3347 && relcount > 1
3348 && !strcmp (q->howto->name, "R_SPARC_LO10"))
3349 {
3350 arelent *q2 = *(p + 1);
3351 if (q2 != NULL
3352 && q2->howto
3353 && q->address == q2->address
3354 && !strcmp (q2->howto->name, "R_SPARC_13"))
3355 {
3356 name = "R_SPARC_OLO10";
3357 addend2 = q2->addend;
3358 p++;
3359 }
3360 }
3361 printf (" %-16s ", name);
3362 }
3363 else
3364 printf (" %-16d ", q->howto->type);
3365
3366 if (sym_name)
3367 {
3368 objdump_print_symname (abfd, NULL, *q->sym_ptr_ptr);
3369 }
3370 else
3371 {
3372 if (section_name == NULL)
3373 section_name = "*unknown*";
3374 printf ("[%s]", section_name);
3375 }
3376
3377 if (q->addend)
3378 {
3379 bfd_signed_vma addend = q->addend;
3380 if (addend < 0)
3381 {
3382 printf ("-0x");
3383 addend = -addend;
3384 }
3385 else
3386 printf ("+0x");
3387 bfd_printf_vma (abfd, addend);
3388 }
3389 if (addend2)
3390 {
3391 printf ("+0x");
3392 bfd_printf_vma (abfd, addend2);
3393 }
3394
3395 printf ("\n");
3396 }
3397
3398 if (last_filename != NULL)
3399 free (last_filename);
3400 if (last_functionname != NULL)
3401 free (last_functionname);
3402 }
3403
3404 static void
3405 dump_relocs_in_section (bfd *abfd,
3406 asection *section,
3407 void *dummy ATTRIBUTE_UNUSED)
3408 {
3409 arelent **relpp;
3410 long relcount;
3411 long relsize;
3412
3413 if ( bfd_is_abs_section (section)
3414 || bfd_is_und_section (section)
3415 || bfd_is_com_section (section)
3416 || (! process_section_p (section))
3417 || ((section->flags & SEC_RELOC) == 0))
3418 return;
3419
3420 relsize = bfd_get_reloc_upper_bound (abfd, section);
3421 if (relsize < 0)
3422 bfd_fatal (bfd_get_filename (abfd));
3423
3424 printf ("RELOCATION RECORDS FOR [%s]:", section->name);
3425
3426 if (relsize == 0)
3427 {
3428 printf (" (none)\n\n");
3429 return;
3430 }
3431
3432 if ((bfd_get_file_flags (abfd) & (BFD_IN_MEMORY | BFD_LINKER_CREATED)) == 0
3433 && (((ufile_ptr) relsize > bfd_get_file_size (abfd))
3434 /* Also check the section's reloc count since if this is negative
3435 (or very large) the computation in bfd_get_reloc_upper_bound
3436 may have resulted in returning a small, positive integer.
3437 See PR 22508 for a reproducer.
3438
3439 Note - we check against file size rather than section size as
3440 it is possible for there to be more relocs that apply to a
3441 section than there are bytes in that section. */
3442 || (section->reloc_count > bfd_get_file_size (abfd))))
3443 {
3444 printf (" (too many: 0x%x)\n", section->reloc_count);
3445 bfd_set_error (bfd_error_file_truncated);
3446 bfd_fatal (bfd_get_filename (abfd));
3447 }
3448
3449 relpp = (arelent **) xmalloc (relsize);
3450 relcount = bfd_canonicalize_reloc (abfd, section, relpp, syms);
3451
3452 if (relcount < 0)
3453 {
3454 printf ("\n");
3455 non_fatal (_("failed to read relocs in: %s"), bfd_get_filename (abfd));
3456 bfd_fatal (_("error message was"));
3457 }
3458 else if (relcount == 0)
3459 printf (" (none)\n\n");
3460 else
3461 {
3462 printf ("\n");
3463 dump_reloc_set (abfd, section, relpp, relcount);
3464 printf ("\n\n");
3465 }
3466 free (relpp);
3467 }
3468
3469 static void
3470 dump_relocs (bfd *abfd)
3471 {
3472 bfd_map_over_sections (abfd, dump_relocs_in_section, NULL);
3473 }
3474
3475 static void
3476 dump_dynamic_relocs (bfd *abfd)
3477 {
3478 long relsize;
3479 arelent **relpp;
3480 long relcount;
3481
3482 relsize = bfd_get_dynamic_reloc_upper_bound (abfd);
3483 if (relsize < 0)
3484 bfd_fatal (bfd_get_filename (abfd));
3485
3486 printf ("DYNAMIC RELOCATION RECORDS");
3487
3488 if (relsize == 0)
3489 printf (" (none)\n\n");
3490 else
3491 {
3492 relpp = (arelent **) xmalloc (relsize);
3493 relcount = bfd_canonicalize_dynamic_reloc (abfd, relpp, dynsyms);
3494
3495 if (relcount < 0)
3496 bfd_fatal (bfd_get_filename (abfd));
3497 else if (relcount == 0)
3498 printf (" (none)\n\n");
3499 else
3500 {
3501 printf ("\n");
3502 dump_reloc_set (abfd, NULL, relpp, relcount);
3503 printf ("\n\n");
3504 }
3505 free (relpp);
3506 }
3507 }
3508
3509 /* Creates a table of paths, to search for source files. */
3510
3511 static void
3512 add_include_path (const char *path)
3513 {
3514 if (path[0] == 0)
3515 return;
3516 include_path_count++;
3517 include_paths = (const char **)
3518 xrealloc (include_paths, include_path_count * sizeof (*include_paths));
3519 #ifdef HAVE_DOS_BASED_FILE_SYSTEM
3520 if (path[1] == ':' && path[2] == 0)
3521 path = concat (path, ".", (const char *) 0);
3522 #endif
3523 include_paths[include_path_count - 1] = path;
3524 }
3525
3526 static void
3527 adjust_addresses (bfd *abfd ATTRIBUTE_UNUSED,
3528 asection *section,
3529 void *arg)
3530 {
3531 if ((section->flags & SEC_DEBUGGING) == 0)
3532 {
3533 bfd_boolean *has_reloc_p = (bfd_boolean *) arg;
3534 section->vma += adjust_section_vma;
3535 if (*has_reloc_p)
3536 section->lma += adjust_section_vma;
3537 }
3538 }
3539
3540 /* Dump selected contents of ABFD. */
3541
3542 static void
3543 dump_bfd (bfd *abfd)
3544 {
3545 /* If we are adjusting section VMA's, change them all now. Changing
3546 the BFD information is a hack. However, we must do it, or
3547 bfd_find_nearest_line will not do the right thing. */
3548 if (adjust_section_vma != 0)
3549 {
3550 bfd_boolean has_reloc = (abfd->flags & HAS_RELOC);
3551 bfd_map_over_sections (abfd, adjust_addresses, &has_reloc);
3552 }
3553
3554 if (! dump_debugging_tags && ! suppress_bfd_header)
3555 printf (_("\n%s: file format %s\n"), bfd_get_filename (abfd),
3556 abfd->xvec->name);
3557 if (dump_ar_hdrs)
3558 print_arelt_descr (stdout, abfd, TRUE);
3559 if (dump_file_header)
3560 dump_bfd_header (abfd);
3561 if (dump_private_headers)
3562 dump_bfd_private_header (abfd);
3563 if (dump_private_options != NULL)
3564 dump_target_specific (abfd);
3565 if (! dump_debugging_tags && ! suppress_bfd_header)
3566 putchar ('\n');
3567
3568 if (dump_symtab
3569 || dump_reloc_info
3570 || disassemble
3571 || dump_debugging
3572 || dump_dwarf_section_info)
3573 syms = slurp_symtab (abfd);
3574
3575 if (dump_section_headers)
3576 dump_headers (abfd);
3577
3578 if (dump_dynamic_symtab || dump_dynamic_reloc_info
3579 || (disassemble && bfd_get_dynamic_symtab_upper_bound (abfd) > 0))
3580 dynsyms = slurp_dynamic_symtab (abfd);
3581 if (disassemble)
3582 {
3583 synthcount = bfd_get_synthetic_symtab (abfd, symcount, syms,
3584 dynsymcount, dynsyms, &synthsyms);
3585 if (synthcount < 0)
3586 synthcount = 0;
3587 }
3588
3589 if (dump_symtab)
3590 dump_symbols (abfd, FALSE);
3591 if (dump_dynamic_symtab)
3592 dump_symbols (abfd, TRUE);
3593 if (dump_dwarf_section_info)
3594 dump_dwarf (abfd);
3595 if (dump_stab_section_info)
3596 dump_stabs (abfd);
3597 if (dump_reloc_info && ! disassemble)
3598 dump_relocs (abfd);
3599 if (dump_dynamic_reloc_info && ! disassemble)
3600 dump_dynamic_relocs (abfd);
3601 if (dump_section_contents)
3602 dump_data (abfd);
3603 if (disassemble)
3604 disassemble_data (abfd);
3605
3606 if (dump_debugging)
3607 {
3608 void *dhandle;
3609
3610 dhandle = read_debugging_info (abfd, syms, symcount, TRUE);
3611 if (dhandle != NULL)
3612 {
3613 if (!print_debugging_info (stdout, dhandle, abfd, syms,
3614 bfd_demangle,
3615 dump_debugging_tags ? TRUE : FALSE))
3616 {
3617 non_fatal (_("%s: printing debugging information failed"),
3618 bfd_get_filename (abfd));
3619 exit_status = 1;
3620 }
3621 }
3622 /* PR 6483: If there was no STABS or IEEE debug
3623 info in the file, try DWARF instead. */
3624 else if (! dump_dwarf_section_info)
3625 {
3626 dwarf_select_sections_all ();
3627 dump_dwarf (abfd);
3628 }
3629 }
3630
3631 if (syms)
3632 {
3633 free (syms);
3634 syms = NULL;
3635 }
3636
3637 if (dynsyms)
3638 {
3639 free (dynsyms);
3640 dynsyms = NULL;
3641 }
3642
3643 if (synthsyms)
3644 {
3645 free (synthsyms);
3646 synthsyms = NULL;
3647 }
3648
3649 symcount = 0;
3650 dynsymcount = 0;
3651 synthcount = 0;
3652 }
3653
3654 static void
3655 display_object_bfd (bfd *abfd)
3656 {
3657 char **matching;
3658
3659 if (bfd_check_format_matches (abfd, bfd_object, &matching))
3660 {
3661 dump_bfd (abfd);
3662 return;
3663 }
3664
3665 if (bfd_get_error () == bfd_error_file_ambiguously_recognized)
3666 {
3667 nonfatal (bfd_get_filename (abfd));
3668 list_matching_formats (matching);
3669 free (matching);
3670 return;
3671 }
3672
3673 if (bfd_get_error () != bfd_error_file_not_recognized)
3674 {
3675 nonfatal (bfd_get_filename (abfd));
3676 return;
3677 }
3678
3679 if (bfd_check_format_matches (abfd, bfd_core, &matching))
3680 {
3681 dump_bfd (abfd);
3682 return;
3683 }
3684
3685 nonfatal (bfd_get_filename (abfd));
3686
3687 if (bfd_get_error () == bfd_error_file_ambiguously_recognized)
3688 {
3689 list_matching_formats (matching);
3690 free (matching);
3691 }
3692 }
3693
3694 static void
3695 display_any_bfd (bfd *file, int level)
3696 {
3697 /* Decompress sections unless dumping the section contents. */
3698 if (!dump_section_contents)
3699 file->flags |= BFD_DECOMPRESS;
3700
3701 /* If the file is an archive, process all of its elements. */
3702 if (bfd_check_format (file, bfd_archive))
3703 {
3704 bfd *arfile = NULL;
3705 bfd *last_arfile = NULL;
3706
3707 if (level == 0)
3708 printf (_("In archive %s:\n"), bfd_get_filename (file));
3709 else if (level > 100)
3710 {
3711 /* Prevent corrupted files from spinning us into an
3712 infinite loop. 100 is an arbitrary heuristic. */
3713 fatal (_("Archive nesting is too deep"));
3714 return;
3715 }
3716 else
3717 printf (_("In nested archive %s:\n"), bfd_get_filename (file));
3718
3719 for (;;)
3720 {
3721 bfd_set_error (bfd_error_no_error);
3722
3723 arfile = bfd_openr_next_archived_file (file, arfile);
3724 if (arfile == NULL)
3725 {
3726 if (bfd_get_error () != bfd_error_no_more_archived_files)
3727 nonfatal (bfd_get_filename (file));
3728 break;
3729 }
3730
3731 display_any_bfd (arfile, level + 1);
3732
3733 if (last_arfile != NULL)
3734 {
3735 bfd_close (last_arfile);
3736 /* PR 17512: file: ac585d01. */
3737 if (arfile == last_arfile)
3738 {
3739 last_arfile = NULL;
3740 break;
3741 }
3742 }
3743 last_arfile = arfile;
3744 }
3745
3746 if (last_arfile != NULL)
3747 bfd_close (last_arfile);
3748 }
3749 else
3750 display_object_bfd (file);
3751 }
3752
3753 static void
3754 display_file (char *filename, char *target, bfd_boolean last_file)
3755 {
3756 bfd *file;
3757
3758 if (get_file_size (filename) < 1)
3759 {
3760 exit_status = 1;
3761 return;
3762 }
3763
3764 file = bfd_openr (filename, target);
3765 if (file == NULL)
3766 {
3767 nonfatal (filename);
3768 return;
3769 }
3770
3771 display_any_bfd (file, 0);
3772
3773 /* This is an optimization to improve the speed of objdump, especially when
3774 dumping a file with lots of associated debug informatiom. Calling
3775 bfd_close on such a file can take a non-trivial amount of time as there
3776 are lots of lists to walk and buffers to free. This is only really
3777 necessary however if we are about to load another file and we need the
3778 memory back. Otherwise, if we are about to exit, then we can save (a lot
3779 of) time by only doing a quick close, and allowing the OS to reclaim the
3780 memory for us. */
3781 if (! last_file)
3782 bfd_close (file);
3783 else
3784 bfd_close_all_done (file);
3785 }
3786 \f
3787 int
3788 main (int argc, char **argv)
3789 {
3790 int c;
3791 char *target = default_target;
3792 bfd_boolean seenflag = FALSE;
3793
3794 #if defined (HAVE_SETLOCALE)
3795 #if defined (HAVE_LC_MESSAGES)
3796 setlocale (LC_MESSAGES, "");
3797 #endif
3798 setlocale (LC_CTYPE, "");
3799 #endif
3800
3801 bindtextdomain (PACKAGE, LOCALEDIR);
3802 textdomain (PACKAGE);
3803
3804 program_name = *argv;
3805 xmalloc_set_program_name (program_name);
3806 bfd_set_error_program_name (program_name);
3807
3808 START_PROGRESS (program_name, 0);
3809
3810 expandargv (&argc, &argv);
3811
3812 bfd_init ();
3813 set_default_bfd_target ();
3814
3815 while ((c = getopt_long (argc, argv,
3816 "pP:ib:m:M:VvCdDlfFaHhrRtTxsSI:j:wE:zgeGW::",
3817 long_options, (int *) 0))
3818 != EOF)
3819 {
3820 switch (c)
3821 {
3822 case 0:
3823 break; /* We've been given a long option. */
3824 case 'm':
3825 machine = optarg;
3826 break;
3827 case 'M':
3828 {
3829 char *options;
3830 if (disassembler_options)
3831 /* Ignore potential memory leak for now. */
3832 options = concat (disassembler_options, ",",
3833 optarg, (const char *) NULL);
3834 else
3835 options = optarg;
3836 disassembler_options = remove_whitespace_and_extra_commas (options);
3837 }
3838 break;
3839 case 'j':
3840 add_only (optarg);
3841 break;
3842 case 'F':
3843 display_file_offsets = TRUE;
3844 break;
3845 case 'l':
3846 with_line_numbers = TRUE;
3847 break;
3848 case 'b':
3849 target = optarg;
3850 break;
3851 case 'C':
3852 do_demangle = TRUE;
3853 if (optarg != NULL)
3854 {
3855 enum demangling_styles style;
3856
3857 style = cplus_demangle_name_to_style (optarg);
3858 if (style == unknown_demangling)
3859 fatal (_("unknown demangling style `%s'"),
3860 optarg);
3861
3862 cplus_demangle_set_style (style);
3863 }
3864 break;
3865 case 'w':
3866 do_wide = wide_output = TRUE;
3867 break;
3868 case OPTION_ADJUST_VMA:
3869 adjust_section_vma = parse_vma (optarg, "--adjust-vma");
3870 break;
3871 case OPTION_START_ADDRESS:
3872 start_address = parse_vma (optarg, "--start-address");
3873 if ((stop_address != (bfd_vma) -1) && stop_address <= start_address)
3874 fatal (_("error: the start address should be before the end address"));
3875 break;
3876 case OPTION_STOP_ADDRESS:
3877 stop_address = parse_vma (optarg, "--stop-address");
3878 if ((start_address != (bfd_vma) -1) && stop_address <= start_address)
3879 fatal (_("error: the stop address should be after the start address"));
3880 break;
3881 case OPTION_PREFIX:
3882 prefix = optarg;
3883 prefix_length = strlen (prefix);
3884 /* Remove an unnecessary trailing '/' */
3885 while (IS_DIR_SEPARATOR (prefix[prefix_length - 1]))
3886 prefix_length--;
3887 break;
3888 case OPTION_PREFIX_STRIP:
3889 prefix_strip = atoi (optarg);
3890 if (prefix_strip < 0)
3891 fatal (_("error: prefix strip must be non-negative"));
3892 break;
3893 case OPTION_INSN_WIDTH:
3894 insn_width = strtoul (optarg, NULL, 0);
3895 if (insn_width <= 0)
3896 fatal (_("error: instruction width must be positive"));
3897 break;
3898 case OPTION_INLINES:
3899 unwind_inlines = TRUE;
3900 break;
3901 case 'E':
3902 if (strcmp (optarg, "B") == 0)
3903 endian = BFD_ENDIAN_BIG;
3904 else if (strcmp (optarg, "L") == 0)
3905 endian = BFD_ENDIAN_LITTLE;
3906 else
3907 {
3908 nonfatal (_("unrecognized -E option"));
3909 usage (stderr, 1);
3910 }
3911 break;
3912 case OPTION_ENDIAN:
3913 if (strncmp (optarg, "big", strlen (optarg)) == 0)
3914 endian = BFD_ENDIAN_BIG;
3915 else if (strncmp (optarg, "little", strlen (optarg)) == 0)
3916 endian = BFD_ENDIAN_LITTLE;
3917 else
3918 {
3919 non_fatal (_("unrecognized --endian type `%s'"), optarg);
3920 exit_status = 1;
3921 usage (stderr, 1);
3922 }
3923 break;
3924
3925 case 'f':
3926 dump_file_header = TRUE;
3927 seenflag = TRUE;
3928 break;
3929 case 'i':
3930 formats_info = TRUE;
3931 seenflag = TRUE;
3932 break;
3933 case 'I':
3934 add_include_path (optarg);
3935 break;
3936 case 'p':
3937 dump_private_headers = TRUE;
3938 seenflag = TRUE;
3939 break;
3940 case 'P':
3941 dump_private_options = optarg;
3942 seenflag = TRUE;
3943 break;
3944 case 'x':
3945 dump_private_headers = TRUE;
3946 dump_symtab = TRUE;
3947 dump_reloc_info = TRUE;
3948 dump_file_header = TRUE;
3949 dump_ar_hdrs = TRUE;
3950 dump_section_headers = TRUE;
3951 seenflag = TRUE;
3952 break;
3953 case 't':
3954 dump_symtab = TRUE;
3955 seenflag = TRUE;
3956 break;
3957 case 'T':
3958 dump_dynamic_symtab = TRUE;
3959 seenflag = TRUE;
3960 break;
3961 case 'd':
3962 disassemble = TRUE;
3963 seenflag = TRUE;
3964 break;
3965 case 'z':
3966 disassemble_zeroes = TRUE;
3967 break;
3968 case 'D':
3969 disassemble = TRUE;
3970 disassemble_all = TRUE;
3971 seenflag = TRUE;
3972 break;
3973 case 'S':
3974 disassemble = TRUE;
3975 with_source_code = TRUE;
3976 seenflag = TRUE;
3977 break;
3978 case 'g':
3979 dump_debugging = 1;
3980 seenflag = TRUE;
3981 break;
3982 case 'e':
3983 dump_debugging = 1;
3984 dump_debugging_tags = 1;
3985 do_demangle = TRUE;
3986 seenflag = TRUE;
3987 break;
3988 case 'W':
3989 dump_dwarf_section_info = TRUE;
3990 seenflag = TRUE;
3991 if (optarg)
3992 dwarf_select_sections_by_letters (optarg);
3993 else
3994 dwarf_select_sections_all ();
3995 break;
3996 case OPTION_DWARF:
3997 dump_dwarf_section_info = TRUE;
3998 seenflag = TRUE;
3999 if (optarg)
4000 dwarf_select_sections_by_names (optarg);
4001 else
4002 dwarf_select_sections_all ();
4003 break;
4004 case OPTION_DWARF_DEPTH:
4005 {
4006 char *cp;
4007 dwarf_cutoff_level = strtoul (optarg, & cp, 0);
4008 }
4009 break;
4010 case OPTION_DWARF_START:
4011 {
4012 char *cp;
4013 dwarf_start_die = strtoul (optarg, & cp, 0);
4014 suppress_bfd_header = 1;
4015 }
4016 break;
4017 case OPTION_DWARF_CHECK:
4018 dwarf_check = TRUE;
4019 break;
4020 case 'G':
4021 dump_stab_section_info = TRUE;
4022 seenflag = TRUE;
4023 break;
4024 case 's':
4025 dump_section_contents = TRUE;
4026 seenflag = TRUE;
4027 break;
4028 case 'r':
4029 dump_reloc_info = TRUE;
4030 seenflag = TRUE;
4031 break;
4032 case 'R':
4033 dump_dynamic_reloc_info = TRUE;
4034 seenflag = TRUE;
4035 break;
4036 case 'a':
4037 dump_ar_hdrs = TRUE;
4038 seenflag = TRUE;
4039 break;
4040 case 'h':
4041 dump_section_headers = TRUE;
4042 seenflag = TRUE;
4043 break;
4044 case 'v':
4045 case 'V':
4046 show_version = TRUE;
4047 seenflag = TRUE;
4048 break;
4049
4050 case 'H':
4051 usage (stdout, 0);
4052 /* No need to set seenflag or to break - usage() does not return. */
4053 default:
4054 usage (stderr, 1);
4055 }
4056 }
4057
4058 if (show_version)
4059 print_version ("objdump");
4060
4061 if (!seenflag)
4062 usage (stderr, 2);
4063
4064 if (formats_info)
4065 exit_status = display_info ();
4066 else
4067 {
4068 if (optind == argc)
4069 display_file ("a.out", target, TRUE);
4070 else
4071 for (; optind < argc;)
4072 {
4073 display_file (argv[optind], target, optind == argc - 1);
4074 optind++;
4075 }
4076 }
4077
4078 free_only_list ();
4079
4080 END_PROGRESS (program_name);
4081
4082 return exit_status;
4083 }
This page took 0.116139 seconds and 5 git commands to generate.