1d9afec992397c4683e56516ce3ef80b91d5360a
[deliverable/binutils-gdb.git] / binutils / objdump.c
1 /* objdump.c -- dump information about an object file.
2 Copyright (C) 1990-2020 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 "ctf-api.h"
60 #include "getopt.h"
61 #include "safe-ctype.h"
62 #include "dis-asm.h"
63 #include "libiberty.h"
64 #include "demangle.h"
65 #include "filenames.h"
66 #include "debug.h"
67 #include "budbg.h"
68 #include "objdump.h"
69
70 #ifdef HAVE_MMAP
71 #include <sys/mman.h>
72 #endif
73
74 /* Internal headers for the ELF .stab-dump code - sorry. */
75 #define BYTES_IN_WORD 32
76 #include "aout/aout64.h"
77
78 /* Exit status. */
79 static int exit_status = 0;
80
81 static char *default_target = NULL; /* Default at runtime. */
82
83 /* The following variables are set based on arguments passed on the
84 command line. */
85 static int show_version = 0; /* Show the version number. */
86 static int dump_section_contents; /* -s */
87 static int dump_section_headers; /* -h */
88 static bfd_boolean dump_file_header; /* -f */
89 static int dump_symtab; /* -t */
90 static int dump_dynamic_symtab; /* -T */
91 static int dump_reloc_info; /* -r */
92 static int dump_dynamic_reloc_info; /* -R */
93 static int dump_ar_hdrs; /* -a */
94 static int dump_private_headers; /* -p */
95 static char *dump_private_options; /* -P */
96 static int no_addresses; /* --no-addresses */
97 static int prefix_addresses; /* --prefix-addresses */
98 static int with_line_numbers; /* -l */
99 static bfd_boolean with_source_code; /* -S */
100 static int show_raw_insn; /* --show-raw-insn */
101 static int dump_dwarf_section_info; /* --dwarf */
102 static int dump_stab_section_info; /* --stabs */
103 static int dump_ctf_section_info; /* --ctf */
104 static char *dump_ctf_section_name;
105 static char *dump_ctf_parent_name; /* --ctf-parent */
106 static int do_demangle; /* -C, --demangle */
107 static bfd_boolean disassemble; /* -d */
108 static bfd_boolean disassemble_all; /* -D */
109 static int disassemble_zeroes; /* --disassemble-zeroes */
110 static bfd_boolean formats_info; /* -i */
111 static int wide_output; /* -w */
112 static int insn_width; /* --insn-width */
113 static bfd_vma start_address = (bfd_vma) -1; /* --start-address */
114 static bfd_vma stop_address = (bfd_vma) -1; /* --stop-address */
115 static int dump_debugging; /* --debugging */
116 static int dump_debugging_tags; /* --debugging-tags */
117 static int suppress_bfd_header;
118 static int dump_special_syms = 0; /* --special-syms */
119 static bfd_vma adjust_section_vma = 0; /* --adjust-vma */
120 static int file_start_context = 0; /* --file-start-context */
121 static bfd_boolean display_file_offsets;/* -F */
122 static const char *prefix; /* --prefix */
123 static int prefix_strip; /* --prefix-strip */
124 static size_t prefix_length;
125 static bfd_boolean unwind_inlines; /* --inlines. */
126 static const char * disasm_sym; /* Disassembly start symbol. */
127 static const char * source_comment; /* --source_comment. */
128 static bfd_boolean visualize_jumps = FALSE; /* --visualize-jumps. */
129 static bfd_boolean color_output = FALSE; /* --visualize-jumps=color. */
130 static bfd_boolean extended_color_output = FALSE; /* --visualize-jumps=extended-color. */
131
132 static int demangle_flags = DMGL_ANSI | DMGL_PARAMS;
133
134 /* A structure to record the sections mentioned in -j switches. */
135 struct only
136 {
137 const char * name; /* The name of the section. */
138 bfd_boolean seen; /* A flag to indicate that the section has been found in one or more input files. */
139 struct only * next; /* Pointer to the next structure in the list. */
140 };
141 /* Pointer to an array of 'only' structures.
142 This pointer is NULL if the -j switch has not been used. */
143 static struct only * only_list = NULL;
144
145 /* Variables for handling include file path table. */
146 static const char **include_paths;
147 static int include_path_count;
148
149 /* Extra info to pass to the section disassembler and address printing
150 function. */
151 struct objdump_disasm_info
152 {
153 bfd * abfd;
154 bfd_boolean require_sec;
155 arelent ** dynrelbuf;
156 long dynrelcount;
157 disassembler_ftype disassemble_fn;
158 arelent * reloc;
159 const char * symbol;
160 };
161
162 /* Architecture to disassemble for, or default if NULL. */
163 static char *machine = NULL;
164
165 /* Target specific options to the disassembler. */
166 static char *disassembler_options = NULL;
167
168 /* Endianness to disassemble for, or default if BFD_ENDIAN_UNKNOWN. */
169 static enum bfd_endian endian = BFD_ENDIAN_UNKNOWN;
170
171 /* The symbol table. */
172 static asymbol **syms;
173
174 /* Number of symbols in `syms'. */
175 static long symcount = 0;
176
177 /* The sorted symbol table. */
178 static asymbol **sorted_syms;
179
180 /* Number of symbols in `sorted_syms'. */
181 static long sorted_symcount = 0;
182
183 /* The dynamic symbol table. */
184 static asymbol **dynsyms;
185
186 /* The synthetic symbol table. */
187 static asymbol *synthsyms;
188 static long synthcount = 0;
189
190 /* Number of symbols in `dynsyms'. */
191 static long dynsymcount = 0;
192
193 static bfd_byte *stabs;
194 static bfd_size_type stab_size;
195
196 static bfd_byte *strtab;
197 static bfd_size_type stabstr_size;
198
199 /* Handlers for -P/--private. */
200 static const struct objdump_private_desc * const objdump_private_vectors[] =
201 {
202 OBJDUMP_PRIVATE_VECTORS
203 NULL
204 };
205
206 /* The list of detected jumps inside a function. */
207 static struct jump_info *detected_jumps = NULL;
208 \f
209 static void usage (FILE *, int) ATTRIBUTE_NORETURN;
210 static void
211 usage (FILE *stream, int status)
212 {
213 fprintf (stream, _("Usage: %s <option(s)> <file(s)>\n"), program_name);
214 fprintf (stream, _(" Display information from object <file(s)>.\n"));
215 fprintf (stream, _(" At least one of the following switches must be given:\n"));
216 fprintf (stream, _("\
217 -a, --archive-headers Display archive header information\n\
218 -f, --file-headers Display the contents of the overall file header\n\
219 -p, --private-headers Display object format specific file header contents\n\
220 -P, --private=OPT,OPT... Display object format specific contents\n\
221 -h, --[section-]headers Display the contents of the section headers\n\
222 -x, --all-headers Display the contents of all headers\n\
223 -d, --disassemble Display assembler contents of executable sections\n\
224 -D, --disassemble-all Display assembler contents of all sections\n\
225 --disassemble=<sym> Display assembler contents from <sym>\n\
226 -S, --source Intermix source code with disassembly\n\
227 --source-comment[=<txt>] Prefix lines of source code with <txt>\n\
228 -s, --full-contents Display the full contents of all sections requested\n\
229 -g, --debugging Display debug information in object file\n\
230 -e, --debugging-tags Display debug information using ctags style\n\
231 -G, --stabs Display (in raw form) any STABS info in the file\n\
232 -W[lLiaprmfFsoRtUuTgAckK] or\n\
233 --dwarf[=rawline,=decodedline,=info,=abbrev,=pubnames,=aranges,=macro,=frames,\n\
234 =frames-interp,=str,=loc,=Ranges,=pubtypes,\n\
235 =gdb_index,=trace_info,=trace_abbrev,=trace_aranges,\n\
236 =addr,=cu_index,=links,=follow-links]\n\
237 Display DWARF info in the file\n\
238 --ctf=SECTION Display CTF info from SECTION\n\
239 -t, --syms Display the contents of the symbol table(s)\n\
240 -T, --dynamic-syms Display the contents of the dynamic symbol table\n\
241 -r, --reloc Display the relocation entries in the file\n\
242 -R, --dynamic-reloc Display the dynamic relocation entries in the file\n\
243 @<file> Read options from <file>\n\
244 -v, --version Display this program's version number\n\
245 -i, --info List object formats and architectures supported\n\
246 -H, --help Display this information\n\
247 "));
248 if (status != 2)
249 {
250 const struct objdump_private_desc * const *desc;
251
252 fprintf (stream, _("\n The following switches are optional:\n"));
253 fprintf (stream, _("\
254 -b, --target=BFDNAME Specify the target object format as BFDNAME\n\
255 -m, --architecture=MACHINE Specify the target architecture as MACHINE\n\
256 -j, --section=NAME Only display information for section NAME\n\
257 -M, --disassembler-options=OPT Pass text OPT on to the disassembler\n\
258 -EB --endian=big Assume big endian format when disassembling\n\
259 -EL --endian=little Assume little endian format when disassembling\n\
260 --file-start-context Include context from start of file (with -S)\n\
261 -I, --include=DIR Add DIR to search list for source files\n\
262 -l, --line-numbers Include line numbers and filenames in output\n\
263 -F, --file-offsets Include file offsets when displaying information\n\
264 -C, --demangle[=STYLE] Decode mangled/processed symbol names\n\
265 The STYLE, if specified, can be `auto', `gnu',\n\
266 `lucid', `arm', `hp', `edg', `gnu-v3', `java'\n\
267 or `gnat'\n\
268 --recurse-limit Enable a limit on recursion whilst demangling. [Default]\n\
269 --no-recurse-limit Disable a limit on recursion whilst demangling\n\
270 -w, --wide Format output for more than 80 columns\n\
271 -z, --disassemble-zeroes Do not skip blocks of zeroes when disassembling\n\
272 --start-address=ADDR Only process data whose address is >= ADDR\n\
273 --stop-address=ADDR Only process data whose address is < ADDR\n\
274 --no-addresses Do not print address alongside disassembly\n\
275 --prefix-addresses Print complete address alongside disassembly\n\
276 --[no-]show-raw-insn Display hex alongside symbolic disassembly\n\
277 --insn-width=WIDTH Display WIDTH bytes on a single line for -d\n\
278 --adjust-vma=OFFSET Add OFFSET to all displayed section addresses\n\
279 --special-syms Include special symbols in symbol dumps\n\
280 --inlines Print all inlines for source line (with -l)\n\
281 --prefix=PREFIX Add PREFIX to absolute paths for -S\n\
282 --prefix-strip=LEVEL Strip initial directory names for -S\n"));
283 fprintf (stream, _("\
284 --dwarf-depth=N Do not display DIEs at depth N or greater\n\
285 --dwarf-start=N Display DIEs starting with N, at the same depth\n\
286 or deeper\n\
287 --dwarf-check Make additional dwarf internal consistency checks.\
288 \n\
289 --ctf-parent=SECTION Use SECTION as the CTF parent\n\
290 --visualize-jumps Visualize jumps by drawing ASCII art lines\n\
291 --visualize-jumps=color Use colors in the ASCII art\n\
292 --visualize-jumps=extended-color Use extended 8-bit color codes\n\
293 --visualize-jumps=off Disable jump visualization\n\n"));
294
295 list_supported_targets (program_name, stream);
296 list_supported_architectures (program_name, stream);
297
298 disassembler_usage (stream);
299
300 if (objdump_private_vectors[0] != NULL)
301 {
302 fprintf (stream,
303 _("\nOptions supported for -P/--private switch:\n"));
304 for (desc = objdump_private_vectors; *desc != NULL; desc++)
305 (*desc)->help (stream);
306 }
307 }
308 if (REPORT_BUGS_TO[0] && status == 0)
309 fprintf (stream, _("Report bugs to %s.\n"), REPORT_BUGS_TO);
310 exit (status);
311 }
312
313 /* 150 isn't special; it's just an arbitrary non-ASCII char value. */
314 enum option_values
315 {
316 OPTION_ENDIAN=150,
317 OPTION_START_ADDRESS,
318 OPTION_STOP_ADDRESS,
319 OPTION_DWARF,
320 OPTION_PREFIX,
321 OPTION_PREFIX_STRIP,
322 OPTION_INSN_WIDTH,
323 OPTION_ADJUST_VMA,
324 OPTION_DWARF_DEPTH,
325 OPTION_DWARF_CHECK,
326 OPTION_DWARF_START,
327 OPTION_RECURSE_LIMIT,
328 OPTION_NO_RECURSE_LIMIT,
329 OPTION_INLINES,
330 OPTION_SOURCE_COMMENT,
331 OPTION_CTF,
332 OPTION_CTF_PARENT,
333 OPTION_VISUALIZE_JUMPS
334 };
335
336 static struct option long_options[]=
337 {
338 {"adjust-vma", required_argument, NULL, OPTION_ADJUST_VMA},
339 {"all-headers", no_argument, NULL, 'x'},
340 {"private-headers", no_argument, NULL, 'p'},
341 {"private", required_argument, NULL, 'P'},
342 {"architecture", required_argument, NULL, 'm'},
343 {"archive-headers", no_argument, NULL, 'a'},
344 {"debugging", no_argument, NULL, 'g'},
345 {"debugging-tags", no_argument, NULL, 'e'},
346 {"demangle", optional_argument, NULL, 'C'},
347 {"disassemble", optional_argument, NULL, 'd'},
348 {"disassemble-all", no_argument, NULL, 'D'},
349 {"disassembler-options", required_argument, NULL, 'M'},
350 {"disassemble-zeroes", no_argument, NULL, 'z'},
351 {"dynamic-reloc", no_argument, NULL, 'R'},
352 {"dynamic-syms", no_argument, NULL, 'T'},
353 {"endian", required_argument, NULL, OPTION_ENDIAN},
354 {"file-headers", no_argument, NULL, 'f'},
355 {"file-offsets", no_argument, NULL, 'F'},
356 {"file-start-context", no_argument, &file_start_context, 1},
357 {"full-contents", no_argument, NULL, 's'},
358 {"headers", no_argument, NULL, 'h'},
359 {"help", no_argument, NULL, 'H'},
360 {"info", no_argument, NULL, 'i'},
361 {"line-numbers", no_argument, NULL, 'l'},
362 {"no-show-raw-insn", no_argument, &show_raw_insn, -1},
363 {"no-addresses", no_argument, &no_addresses, 1},
364 {"prefix-addresses", no_argument, &prefix_addresses, 1},
365 {"recurse-limit", no_argument, NULL, OPTION_RECURSE_LIMIT},
366 {"recursion-limit", no_argument, NULL, OPTION_RECURSE_LIMIT},
367 {"no-recurse-limit", no_argument, NULL, OPTION_NO_RECURSE_LIMIT},
368 {"no-recursion-limit", no_argument, NULL, OPTION_NO_RECURSE_LIMIT},
369 {"reloc", no_argument, NULL, 'r'},
370 {"section", required_argument, NULL, 'j'},
371 {"section-headers", no_argument, NULL, 'h'},
372 {"show-raw-insn", no_argument, &show_raw_insn, 1},
373 {"source", no_argument, NULL, 'S'},
374 {"source-comment", optional_argument, NULL, OPTION_SOURCE_COMMENT},
375 {"special-syms", no_argument, &dump_special_syms, 1},
376 {"include", required_argument, NULL, 'I'},
377 {"dwarf", optional_argument, NULL, OPTION_DWARF},
378 {"ctf", required_argument, NULL, OPTION_CTF},
379 {"ctf-parent", required_argument, NULL, OPTION_CTF_PARENT},
380 {"stabs", no_argument, NULL, 'G'},
381 {"start-address", required_argument, NULL, OPTION_START_ADDRESS},
382 {"stop-address", required_argument, NULL, OPTION_STOP_ADDRESS},
383 {"syms", no_argument, NULL, 't'},
384 {"target", required_argument, NULL, 'b'},
385 {"version", no_argument, NULL, 'V'},
386 {"wide", no_argument, NULL, 'w'},
387 {"prefix", required_argument, NULL, OPTION_PREFIX},
388 {"prefix-strip", required_argument, NULL, OPTION_PREFIX_STRIP},
389 {"insn-width", required_argument, NULL, OPTION_INSN_WIDTH},
390 {"dwarf-depth", required_argument, 0, OPTION_DWARF_DEPTH},
391 {"dwarf-start", required_argument, 0, OPTION_DWARF_START},
392 {"dwarf-check", no_argument, 0, OPTION_DWARF_CHECK},
393 {"inlines", no_argument, 0, OPTION_INLINES},
394 {"visualize-jumps", optional_argument, 0, OPTION_VISUALIZE_JUMPS},
395 {0, no_argument, 0, 0}
396 };
397 \f
398 static void
399 nonfatal (const char *msg)
400 {
401 bfd_nonfatal (msg);
402 exit_status = 1;
403 }
404
405 /* Returns a version of IN with any control characters
406 replaced by escape sequences. Uses a static buffer
407 if necessary. */
408
409 static const char *
410 sanitize_string (const char * in)
411 {
412 static char * buffer = NULL;
413 static size_t buffer_len = 0;
414 const char * original = in;
415 char * out;
416
417 /* Paranoia. */
418 if (in == NULL)
419 return "";
420
421 /* See if any conversion is necessary. In the majority
422 of cases it will not be needed. */
423 do
424 {
425 char c = *in++;
426
427 if (c == 0)
428 return original;
429
430 if (ISCNTRL (c))
431 break;
432 }
433 while (1);
434
435 /* Copy the input, translating as needed. */
436 in = original;
437 if (buffer_len < (strlen (in) * 2))
438 {
439 free ((void *) buffer);
440 buffer_len = strlen (in) * 2;
441 buffer = xmalloc (buffer_len + 1);
442 }
443
444 out = buffer;
445 do
446 {
447 char c = *in++;
448
449 if (c == 0)
450 break;
451
452 if (!ISCNTRL (c))
453 *out++ = c;
454 else
455 {
456 *out++ = '^';
457 *out++ = c + 0x40;
458 }
459 }
460 while (1);
461
462 *out = 0;
463 return buffer;
464 }
465
466 \f
467 /* Returns TRUE if the specified section should be dumped. */
468
469 static bfd_boolean
470 process_section_p (asection * section)
471 {
472 struct only * only;
473
474 if (only_list == NULL)
475 return TRUE;
476
477 for (only = only_list; only; only = only->next)
478 if (strcmp (only->name, section->name) == 0)
479 {
480 only->seen = TRUE;
481 return TRUE;
482 }
483
484 return FALSE;
485 }
486
487 /* Add an entry to the 'only' list. */
488
489 static void
490 add_only (char * name)
491 {
492 struct only * only;
493
494 /* First check to make sure that we do not
495 already have an entry for this name. */
496 for (only = only_list; only; only = only->next)
497 if (strcmp (only->name, name) == 0)
498 return;
499
500 only = xmalloc (sizeof * only);
501 only->name = name;
502 only->seen = FALSE;
503 only->next = only_list;
504 only_list = only;
505 }
506
507 /* Release the memory used by the 'only' list.
508 PR 11225: Issue a warning message for unseen sections.
509 Only do this if none of the sections were seen. This is mainly to support
510 tools like the GAS testsuite where an object file is dumped with a list of
511 generic section names known to be present in a range of different file
512 formats. */
513
514 static void
515 free_only_list (void)
516 {
517 bfd_boolean at_least_one_seen = FALSE;
518 struct only * only;
519 struct only * next;
520
521 if (only_list == NULL)
522 return;
523
524 for (only = only_list; only; only = only->next)
525 if (only->seen)
526 {
527 at_least_one_seen = TRUE;
528 break;
529 }
530
531 for (only = only_list; only; only = next)
532 {
533 if (! at_least_one_seen)
534 {
535 non_fatal (_("section '%s' mentioned in a -j option, "
536 "but not found in any input file"),
537 only->name);
538 exit_status = 1;
539 }
540 next = only->next;
541 free (only);
542 }
543 }
544
545 \f
546 static void
547 dump_section_header (bfd *abfd, asection *section, void *data)
548 {
549 char *comma = "";
550 unsigned int opb = bfd_octets_per_byte (abfd, section);
551 int longest_section_name = *((int *) data);
552
553 /* Ignore linker created section. See elfNN_ia64_object_p in
554 bfd/elfxx-ia64.c. */
555 if (section->flags & SEC_LINKER_CREATED)
556 return;
557
558 /* PR 10413: Skip sections that we are ignoring. */
559 if (! process_section_p (section))
560 return;
561
562 printf ("%3d %-*s %08lx ", section->index, longest_section_name,
563 sanitize_string (bfd_section_name (section)),
564 (unsigned long) bfd_section_size (section) / opb);
565 bfd_printf_vma (abfd, bfd_section_vma (section));
566 printf (" ");
567 bfd_printf_vma (abfd, section->lma);
568 printf (" %08lx 2**%u", (unsigned long) section->filepos,
569 bfd_section_alignment (section));
570 if (! wide_output)
571 printf ("\n ");
572 printf (" ");
573
574 #define PF(x, y) \
575 if (section->flags & x) { printf ("%s%s", comma, y); comma = ", "; }
576
577 PF (SEC_HAS_CONTENTS, "CONTENTS");
578 PF (SEC_ALLOC, "ALLOC");
579 PF (SEC_CONSTRUCTOR, "CONSTRUCTOR");
580 PF (SEC_LOAD, "LOAD");
581 PF (SEC_RELOC, "RELOC");
582 PF (SEC_READONLY, "READONLY");
583 PF (SEC_CODE, "CODE");
584 PF (SEC_DATA, "DATA");
585 PF (SEC_ROM, "ROM");
586 PF (SEC_DEBUGGING, "DEBUGGING");
587 PF (SEC_NEVER_LOAD, "NEVER_LOAD");
588 PF (SEC_EXCLUDE, "EXCLUDE");
589 PF (SEC_SORT_ENTRIES, "SORT_ENTRIES");
590 if (bfd_get_arch (abfd) == bfd_arch_tic54x)
591 {
592 PF (SEC_TIC54X_BLOCK, "BLOCK");
593 PF (SEC_TIC54X_CLINK, "CLINK");
594 }
595 PF (SEC_SMALL_DATA, "SMALL_DATA");
596 if (bfd_get_flavour (abfd) == bfd_target_coff_flavour)
597 {
598 PF (SEC_COFF_SHARED, "SHARED");
599 PF (SEC_COFF_NOREAD, "NOREAD");
600 }
601 else if (bfd_get_flavour (abfd) == bfd_target_elf_flavour)
602 {
603 PF (SEC_ELF_OCTETS, "OCTETS");
604 PF (SEC_ELF_PURECODE, "PURECODE");
605 }
606 PF (SEC_THREAD_LOCAL, "THREAD_LOCAL");
607 PF (SEC_GROUP, "GROUP");
608 if (bfd_get_arch (abfd) == bfd_arch_mep)
609 {
610 PF (SEC_MEP_VLIW, "VLIW");
611 }
612
613 if ((section->flags & SEC_LINK_ONCE) != 0)
614 {
615 const char *ls;
616 struct coff_comdat_info *comdat;
617
618 switch (section->flags & SEC_LINK_DUPLICATES)
619 {
620 default:
621 abort ();
622 case SEC_LINK_DUPLICATES_DISCARD:
623 ls = "LINK_ONCE_DISCARD";
624 break;
625 case SEC_LINK_DUPLICATES_ONE_ONLY:
626 ls = "LINK_ONCE_ONE_ONLY";
627 break;
628 case SEC_LINK_DUPLICATES_SAME_SIZE:
629 ls = "LINK_ONCE_SAME_SIZE";
630 break;
631 case SEC_LINK_DUPLICATES_SAME_CONTENTS:
632 ls = "LINK_ONCE_SAME_CONTENTS";
633 break;
634 }
635 printf ("%s%s", comma, ls);
636
637 comdat = bfd_coff_get_comdat_section (abfd, section);
638 if (comdat != NULL)
639 printf (" (COMDAT %s %ld)", comdat->name, comdat->symbol);
640
641 comma = ", ";
642 }
643
644 printf ("\n");
645 #undef PF
646 }
647
648 /* Called on each SECTION in ABFD, update the int variable pointed to by
649 DATA which contains the string length of the longest section name. */
650
651 static void
652 find_longest_section_name (bfd *abfd ATTRIBUTE_UNUSED,
653 asection *section, void *data)
654 {
655 int *longest_so_far = (int *) data;
656 const char *name;
657 int len;
658
659 /* Ignore linker created section. */
660 if (section->flags & SEC_LINKER_CREATED)
661 return;
662
663 /* Skip sections that we are ignoring. */
664 if (! process_section_p (section))
665 return;
666
667 name = bfd_section_name (section);
668 len = (int) strlen (name);
669 if (len > *longest_so_far)
670 *longest_so_far = len;
671 }
672
673 static void
674 dump_headers (bfd *abfd)
675 {
676 /* The default width of 13 is just an arbitrary choice. */
677 int max_section_name_length = 13;
678 int bfd_vma_width;
679
680 #ifndef BFD64
681 bfd_vma_width = 10;
682 #else
683 /* With BFD64, non-ELF returns -1 and wants always 64 bit addresses. */
684 if (bfd_get_arch_size (abfd) == 32)
685 bfd_vma_width = 10;
686 else
687 bfd_vma_width = 18;
688 #endif
689
690 printf (_("Sections:\n"));
691
692 if (wide_output)
693 bfd_map_over_sections (abfd, find_longest_section_name,
694 &max_section_name_length);
695
696 printf (_("Idx %-*s Size %-*s%-*sFile off Algn"),
697 max_section_name_length, "Name",
698 bfd_vma_width, "VMA",
699 bfd_vma_width, "LMA");
700
701 if (wide_output)
702 printf (_(" Flags"));
703 printf ("\n");
704
705 bfd_map_over_sections (abfd, dump_section_header,
706 &max_section_name_length);
707 }
708 \f
709 static asymbol **
710 slurp_symtab (bfd *abfd)
711 {
712 asymbol **sy = NULL;
713 long storage;
714
715 if (!(bfd_get_file_flags (abfd) & HAS_SYMS))
716 {
717 symcount = 0;
718 return NULL;
719 }
720
721 storage = bfd_get_symtab_upper_bound (abfd);
722 if (storage < 0)
723 {
724 non_fatal (_("failed to read symbol table from: %s"), bfd_get_filename (abfd));
725 bfd_fatal (_("error message was"));
726 }
727 if (storage)
728 {
729 off_t filesize = bfd_get_file_size (abfd);
730
731 /* qv PR 24707. */
732 if (filesize > 0
733 && filesize < storage
734 /* The MMO file format supports its own special compression
735 technique, so its sections can be larger than the file size. */
736 && bfd_get_flavour (abfd) != bfd_target_mmo_flavour)
737 {
738 bfd_nonfatal_message (bfd_get_filename (abfd), abfd, NULL,
739 _("error: symbol table size (%#lx) is larger than filesize (%#lx)"),
740 storage, (long) filesize);
741 exit_status = 1;
742 symcount = 0;
743 return NULL;
744 }
745
746 sy = (asymbol **) xmalloc (storage);
747 }
748
749 symcount = bfd_canonicalize_symtab (abfd, sy);
750 if (symcount < 0)
751 bfd_fatal (bfd_get_filename (abfd));
752 return sy;
753 }
754
755 /* Read in the dynamic symbols. */
756
757 static asymbol **
758 slurp_dynamic_symtab (bfd *abfd)
759 {
760 asymbol **sy = NULL;
761 long storage;
762
763 storage = bfd_get_dynamic_symtab_upper_bound (abfd);
764 if (storage < 0)
765 {
766 if (!(bfd_get_file_flags (abfd) & DYNAMIC))
767 {
768 non_fatal (_("%s: not a dynamic object"), bfd_get_filename (abfd));
769 exit_status = 1;
770 dynsymcount = 0;
771 return NULL;
772 }
773
774 bfd_fatal (bfd_get_filename (abfd));
775 }
776 if (storage)
777 sy = (asymbol **) xmalloc (storage);
778
779 dynsymcount = bfd_canonicalize_dynamic_symtab (abfd, sy);
780 if (dynsymcount < 0)
781 bfd_fatal (bfd_get_filename (abfd));
782 return sy;
783 }
784
785 /* Some symbol names are significant and should be kept in the
786 table of sorted symbol names, even if they are marked as
787 debugging/section symbols. */
788
789 static bfd_boolean
790 is_significant_symbol_name (const char * name)
791 {
792 return strncmp (name, ".plt", 4) == 0 || strcmp (name, ".got") == 0;
793 }
794
795 /* Filter out (in place) symbols that are useless for disassembly.
796 COUNT is the number of elements in SYMBOLS.
797 Return the number of useful symbols. */
798
799 static long
800 remove_useless_symbols (asymbol **symbols, long count)
801 {
802 asymbol **in_ptr = symbols, **out_ptr = symbols;
803
804 while (--count >= 0)
805 {
806 asymbol *sym = *in_ptr++;
807
808 if (sym->name == NULL || sym->name[0] == '\0')
809 continue;
810 if ((sym->flags & (BSF_DEBUGGING | BSF_SECTION_SYM))
811 && ! is_significant_symbol_name (sym->name))
812 continue;
813 if (bfd_is_und_section (sym->section)
814 || bfd_is_com_section (sym->section))
815 continue;
816
817 *out_ptr++ = sym;
818 }
819 return out_ptr - symbols;
820 }
821
822 static const asection *compare_section;
823
824 /* Sort symbols into value order. */
825
826 static int
827 compare_symbols (const void *ap, const void *bp)
828 {
829 const asymbol *a = * (const asymbol **) ap;
830 const asymbol *b = * (const asymbol **) bp;
831 const char *an;
832 const char *bn;
833 size_t anl;
834 size_t bnl;
835 bfd_boolean as, af, bs, bf;
836 flagword aflags;
837 flagword bflags;
838
839 if (bfd_asymbol_value (a) > bfd_asymbol_value (b))
840 return 1;
841 else if (bfd_asymbol_value (a) < bfd_asymbol_value (b))
842 return -1;
843
844 /* Prefer symbols from the section currently being disassembled.
845 Don't sort symbols from other sections by section, since there
846 isn't much reason to prefer one section over another otherwise.
847 See sym_ok comment for why we compare by section name. */
848 as = strcmp (compare_section->name, a->section->name) == 0;
849 bs = strcmp (compare_section->name, b->section->name) == 0;
850 if (as && !bs)
851 return -1;
852 if (!as && bs)
853 return 1;
854
855 an = bfd_asymbol_name (a);
856 bn = bfd_asymbol_name (b);
857 anl = strlen (an);
858 bnl = strlen (bn);
859
860 /* The symbols gnu_compiled and gcc2_compiled convey no real
861 information, so put them after other symbols with the same value. */
862 af = (strstr (an, "gnu_compiled") != NULL
863 || strstr (an, "gcc2_compiled") != NULL);
864 bf = (strstr (bn, "gnu_compiled") != NULL
865 || strstr (bn, "gcc2_compiled") != NULL);
866
867 if (af && ! bf)
868 return 1;
869 if (! af && bf)
870 return -1;
871
872 /* We use a heuristic for the file name, to try to sort it after
873 more useful symbols. It may not work on non Unix systems, but it
874 doesn't really matter; the only difference is precisely which
875 symbol names get printed. */
876
877 #define file_symbol(s, sn, snl) \
878 (((s)->flags & BSF_FILE) != 0 \
879 || ((snl) > 2 \
880 && (sn)[(snl) - 2] == '.' \
881 && ((sn)[(snl) - 1] == 'o' \
882 || (sn)[(snl) - 1] == 'a')))
883
884 af = file_symbol (a, an, anl);
885 bf = file_symbol (b, bn, bnl);
886
887 if (af && ! bf)
888 return 1;
889 if (! af && bf)
890 return -1;
891
892 /* Sort function and object symbols before global symbols before
893 local symbols before section symbols before debugging symbols. */
894
895 aflags = a->flags;
896 bflags = b->flags;
897
898 if ((aflags & BSF_DEBUGGING) != (bflags & BSF_DEBUGGING))
899 {
900 if ((aflags & BSF_DEBUGGING) != 0)
901 return 1;
902 else
903 return -1;
904 }
905 if ((aflags & BSF_SECTION_SYM) != (bflags & BSF_SECTION_SYM))
906 {
907 if ((aflags & BSF_SECTION_SYM) != 0)
908 return 1;
909 else
910 return -1;
911 }
912 if ((aflags & BSF_FUNCTION) != (bflags & BSF_FUNCTION))
913 {
914 if ((aflags & BSF_FUNCTION) != 0)
915 return -1;
916 else
917 return 1;
918 }
919 if ((aflags & BSF_OBJECT) != (bflags & BSF_OBJECT))
920 {
921 if ((aflags & BSF_OBJECT) != 0)
922 return -1;
923 else
924 return 1;
925 }
926 if ((aflags & BSF_LOCAL) != (bflags & BSF_LOCAL))
927 {
928 if ((aflags & BSF_LOCAL) != 0)
929 return 1;
930 else
931 return -1;
932 }
933 if ((aflags & BSF_GLOBAL) != (bflags & BSF_GLOBAL))
934 {
935 if ((aflags & BSF_GLOBAL) != 0)
936 return -1;
937 else
938 return 1;
939 }
940
941 if (bfd_get_flavour (bfd_asymbol_bfd (a)) == bfd_target_elf_flavour
942 && bfd_get_flavour (bfd_asymbol_bfd (b)) == bfd_target_elf_flavour)
943 {
944 bfd_vma asz, bsz;
945
946 asz = 0;
947 if ((a->flags & (BSF_SECTION_SYM | BSF_SYNTHETIC)) == 0)
948 asz = ((elf_symbol_type *) a)->internal_elf_sym.st_size;
949 bsz = 0;
950 if ((b->flags & (BSF_SECTION_SYM | BSF_SYNTHETIC)) == 0)
951 bsz = ((elf_symbol_type *) b)->internal_elf_sym.st_size;
952 if (asz != bsz)
953 return asz > bsz ? -1 : 1;
954 }
955
956 /* Symbols that start with '.' might be section names, so sort them
957 after symbols that don't start with '.'. */
958 if (an[0] == '.' && bn[0] != '.')
959 return 1;
960 if (an[0] != '.' && bn[0] == '.')
961 return -1;
962
963 /* Finally, if we can't distinguish them in any other way, try to
964 get consistent results by sorting the symbols by name. */
965 return strcmp (an, bn);
966 }
967
968 /* Sort relocs into address order. */
969
970 static int
971 compare_relocs (const void *ap, const void *bp)
972 {
973 const arelent *a = * (const arelent **) ap;
974 const arelent *b = * (const arelent **) bp;
975
976 if (a->address > b->address)
977 return 1;
978 else if (a->address < b->address)
979 return -1;
980
981 /* So that associated relocations tied to the same address show up
982 in the correct order, we don't do any further sorting. */
983 if (a > b)
984 return 1;
985 else if (a < b)
986 return -1;
987 else
988 return 0;
989 }
990
991 /* Print an address (VMA) to the output stream in INFO.
992 If SKIP_ZEROES is TRUE, omit leading zeroes. */
993
994 static void
995 objdump_print_value (bfd_vma vma, struct disassemble_info *inf,
996 bfd_boolean skip_zeroes)
997 {
998 char buf[30];
999 char *p;
1000 struct objdump_disasm_info *aux;
1001
1002 aux = (struct objdump_disasm_info *) inf->application_data;
1003 bfd_sprintf_vma (aux->abfd, buf, vma);
1004 if (! skip_zeroes)
1005 p = buf;
1006 else
1007 {
1008 for (p = buf; *p == '0'; ++p)
1009 ;
1010 if (*p == '\0')
1011 --p;
1012 }
1013 (*inf->fprintf_func) (inf->stream, "%s", p);
1014 }
1015
1016 /* Print the name of a symbol. */
1017
1018 static void
1019 objdump_print_symname (bfd *abfd, struct disassemble_info *inf,
1020 asymbol *sym)
1021 {
1022 char *alloc;
1023 const char *name, *version_string = NULL;
1024 bfd_boolean hidden = FALSE;
1025
1026 alloc = NULL;
1027 name = bfd_asymbol_name (sym);
1028 if (do_demangle && name[0] != '\0')
1029 {
1030 /* Demangle the name. */
1031 alloc = bfd_demangle (abfd, name, demangle_flags);
1032 if (alloc != NULL)
1033 name = alloc;
1034 }
1035
1036 if ((sym->flags & (BSF_SECTION_SYM | BSF_SYNTHETIC)) == 0)
1037 version_string = bfd_get_symbol_version_string (abfd, sym, TRUE,
1038 &hidden);
1039
1040 if (bfd_is_und_section (bfd_asymbol_section (sym)))
1041 hidden = TRUE;
1042
1043 name = sanitize_string (name);
1044
1045 if (inf != NULL)
1046 {
1047 (*inf->fprintf_func) (inf->stream, "%s", name);
1048 if (version_string && *version_string != '\0')
1049 (*inf->fprintf_func) (inf->stream, hidden ? "@%s" : "@@%s",
1050 version_string);
1051 }
1052 else
1053 {
1054 printf ("%s", name);
1055 if (version_string && *version_string != '\0')
1056 printf (hidden ? "@%s" : "@@%s", version_string);
1057 }
1058
1059 if (alloc != NULL)
1060 free (alloc);
1061 }
1062
1063 static inline bfd_boolean
1064 sym_ok (bfd_boolean want_section,
1065 bfd * abfd ATTRIBUTE_UNUSED,
1066 long place,
1067 asection * sec,
1068 struct disassemble_info * inf)
1069 {
1070 if (want_section)
1071 {
1072 /* NB: An object file can have different sections with the same
1073 section name. Compare compare section pointers if they have
1074 the same owner. */
1075 if (sorted_syms[place]->section->owner == sec->owner
1076 && sorted_syms[place]->section != sec)
1077 return FALSE;
1078
1079 /* Note - we cannot just compare section pointers because they could
1080 be different, but the same... Ie the symbol that we are trying to
1081 find could have come from a separate debug info file. Under such
1082 circumstances the symbol will be associated with a section in the
1083 debug info file, whilst the section we want is in a normal file.
1084 So the section pointers will be different, but the section names
1085 will be the same. */
1086 if (strcmp (bfd_section_name (sorted_syms[place]->section),
1087 bfd_section_name (sec)) != 0)
1088 return FALSE;
1089 }
1090
1091 return inf->symbol_is_valid (sorted_syms[place], inf);
1092 }
1093
1094 /* Locate a symbol given a bfd and a section (from INFO->application_data),
1095 and a VMA. If INFO->application_data->require_sec is TRUE, then always
1096 require the symbol to be in the section. Returns NULL if there is no
1097 suitable symbol. If PLACE is not NULL, then *PLACE is set to the index
1098 of the symbol in sorted_syms. */
1099
1100 static asymbol *
1101 find_symbol_for_address (bfd_vma vma,
1102 struct disassemble_info *inf,
1103 long *place)
1104 {
1105 /* @@ Would it speed things up to cache the last two symbols returned,
1106 and maybe their address ranges? For many processors, only one memory
1107 operand can be present at a time, so the 2-entry cache wouldn't be
1108 constantly churned by code doing heavy memory accesses. */
1109
1110 /* Indices in `sorted_syms'. */
1111 long min = 0;
1112 long max_count = sorted_symcount;
1113 long thisplace;
1114 struct objdump_disasm_info *aux;
1115 bfd *abfd;
1116 asection *sec;
1117 unsigned int opb;
1118 bfd_boolean want_section;
1119 long rel_count;
1120
1121 if (sorted_symcount < 1)
1122 return NULL;
1123
1124 aux = (struct objdump_disasm_info *) inf->application_data;
1125 abfd = aux->abfd;
1126 sec = inf->section;
1127 opb = inf->octets_per_byte;
1128
1129 /* Perform a binary search looking for the closest symbol to the
1130 required value. We are searching the range (min, max_count]. */
1131 while (min + 1 < max_count)
1132 {
1133 asymbol *sym;
1134
1135 thisplace = (max_count + min) / 2;
1136 sym = sorted_syms[thisplace];
1137
1138 if (bfd_asymbol_value (sym) > vma)
1139 max_count = thisplace;
1140 else if (bfd_asymbol_value (sym) < vma)
1141 min = thisplace;
1142 else
1143 {
1144 min = thisplace;
1145 break;
1146 }
1147 }
1148
1149 /* The symbol we want is now in min, the low end of the range we
1150 were searching. If there are several symbols with the same
1151 value, we want the first one. */
1152 thisplace = min;
1153 while (thisplace > 0
1154 && (bfd_asymbol_value (sorted_syms[thisplace])
1155 == bfd_asymbol_value (sorted_syms[thisplace - 1])))
1156 --thisplace;
1157
1158 /* Prefer a symbol in the current section if we have multple symbols
1159 with the same value, as can occur with overlays or zero size
1160 sections. */
1161 min = thisplace;
1162 while (min < max_count
1163 && (bfd_asymbol_value (sorted_syms[min])
1164 == bfd_asymbol_value (sorted_syms[thisplace])))
1165 {
1166 if (sym_ok (TRUE, abfd, min, sec, inf))
1167 {
1168 thisplace = min;
1169
1170 if (place != NULL)
1171 *place = thisplace;
1172
1173 return sorted_syms[thisplace];
1174 }
1175 ++min;
1176 }
1177
1178 /* If the file is relocatable, and the symbol could be from this
1179 section, prefer a symbol from this section over symbols from
1180 others, even if the other symbol's value might be closer.
1181
1182 Note that this may be wrong for some symbol references if the
1183 sections have overlapping memory ranges, but in that case there's
1184 no way to tell what's desired without looking at the relocation
1185 table.
1186
1187 Also give the target a chance to reject symbols. */
1188 want_section = (aux->require_sec
1189 || ((abfd->flags & HAS_RELOC) != 0
1190 && vma >= bfd_section_vma (sec)
1191 && vma < (bfd_section_vma (sec)
1192 + bfd_section_size (sec) / opb)));
1193
1194 if (! sym_ok (want_section, abfd, thisplace, sec, inf))
1195 {
1196 long i;
1197 long newplace = sorted_symcount;
1198
1199 for (i = min - 1; i >= 0; i--)
1200 {
1201 if (sym_ok (want_section, abfd, i, sec, inf))
1202 {
1203 if (newplace == sorted_symcount)
1204 newplace = i;
1205
1206 if (bfd_asymbol_value (sorted_syms[i])
1207 != bfd_asymbol_value (sorted_syms[newplace]))
1208 break;
1209
1210 /* Remember this symbol and keep searching until we reach
1211 an earlier address. */
1212 newplace = i;
1213 }
1214 }
1215
1216 if (newplace != sorted_symcount)
1217 thisplace = newplace;
1218 else
1219 {
1220 /* We didn't find a good symbol with a smaller value.
1221 Look for one with a larger value. */
1222 for (i = thisplace + 1; i < sorted_symcount; i++)
1223 {
1224 if (sym_ok (want_section, abfd, i, sec, inf))
1225 {
1226 thisplace = i;
1227 break;
1228 }
1229 }
1230 }
1231
1232 if (! sym_ok (want_section, abfd, thisplace, sec, inf))
1233 /* There is no suitable symbol. */
1234 return NULL;
1235 }
1236
1237 /* If we have not found an exact match for the specified address
1238 and we have dynamic relocations available, then we can produce
1239 a better result by matching a relocation to the address and
1240 using the symbol associated with that relocation. */
1241 rel_count = aux->dynrelcount;
1242 if (!want_section
1243 && sorted_syms[thisplace]->value != vma
1244 && rel_count > 0
1245 && aux->dynrelbuf != NULL
1246 && aux->dynrelbuf[0]->address <= vma
1247 && aux->dynrelbuf[rel_count - 1]->address >= vma
1248 /* If we have matched a synthetic symbol, then stick with that. */
1249 && (sorted_syms[thisplace]->flags & BSF_SYNTHETIC) == 0)
1250 {
1251 arelent ** rel_low;
1252 arelent ** rel_high;
1253
1254 rel_low = aux->dynrelbuf;
1255 rel_high = rel_low + rel_count - 1;
1256 while (rel_low <= rel_high)
1257 {
1258 arelent **rel_mid = &rel_low[(rel_high - rel_low) / 2];
1259 arelent * rel = *rel_mid;
1260
1261 if (rel->address == vma)
1262 {
1263 /* Absolute relocations do not provide a more helpful
1264 symbolic address. Find a non-absolute relocation
1265 with the same address. */
1266 arelent **rel_vma = rel_mid;
1267 for (rel_mid--;
1268 rel_mid >= rel_low && rel_mid[0]->address == vma;
1269 rel_mid--)
1270 rel_vma = rel_mid;
1271
1272 for (; rel_vma <= rel_high && rel_vma[0]->address == vma;
1273 rel_vma++)
1274 {
1275 rel = *rel_vma;
1276 if (rel->sym_ptr_ptr != NULL
1277 && ! bfd_is_abs_section ((* rel->sym_ptr_ptr)->section))
1278 {
1279 if (place != NULL)
1280 * place = thisplace;
1281 return * rel->sym_ptr_ptr;
1282 }
1283 }
1284 break;
1285 }
1286
1287 if (vma < rel->address)
1288 rel_high = rel_mid;
1289 else if (vma >= rel_mid[1]->address)
1290 rel_low = rel_mid + 1;
1291 else
1292 break;
1293 }
1294 }
1295
1296 if (place != NULL)
1297 *place = thisplace;
1298
1299 return sorted_syms[thisplace];
1300 }
1301
1302 /* Print an address and the offset to the nearest symbol. */
1303
1304 static void
1305 objdump_print_addr_with_sym (bfd *abfd, asection *sec, asymbol *sym,
1306 bfd_vma vma, struct disassemble_info *inf,
1307 bfd_boolean skip_zeroes)
1308 {
1309 if (!no_addresses)
1310 {
1311 objdump_print_value (vma, inf, skip_zeroes);
1312 (*inf->fprintf_func) (inf->stream, " ");
1313 }
1314
1315 if (sym == NULL)
1316 {
1317 bfd_vma secaddr;
1318
1319 (*inf->fprintf_func) (inf->stream, "<%s",
1320 sanitize_string (bfd_section_name (sec)));
1321 secaddr = bfd_section_vma (sec);
1322 if (vma < secaddr)
1323 {
1324 (*inf->fprintf_func) (inf->stream, "-0x");
1325 objdump_print_value (secaddr - vma, inf, TRUE);
1326 }
1327 else if (vma > secaddr)
1328 {
1329 (*inf->fprintf_func) (inf->stream, "+0x");
1330 objdump_print_value (vma - secaddr, inf, TRUE);
1331 }
1332 (*inf->fprintf_func) (inf->stream, ">");
1333 }
1334 else
1335 {
1336 (*inf->fprintf_func) (inf->stream, "<");
1337
1338 objdump_print_symname (abfd, inf, sym);
1339
1340 if (bfd_asymbol_value (sym) == vma)
1341 ;
1342 /* Undefined symbols in an executables and dynamic objects do not have
1343 a value associated with them, so it does not make sense to display
1344 an offset relative to them. Normally we would not be provided with
1345 this kind of symbol, but the target backend might choose to do so,
1346 and the code in find_symbol_for_address might return an as yet
1347 unresolved symbol associated with a dynamic reloc. */
1348 else if ((bfd_get_file_flags (abfd) & (EXEC_P | DYNAMIC))
1349 && bfd_is_und_section (sym->section))
1350 ;
1351 else if (bfd_asymbol_value (sym) > vma)
1352 {
1353 (*inf->fprintf_func) (inf->stream, "-0x");
1354 objdump_print_value (bfd_asymbol_value (sym) - vma, inf, TRUE);
1355 }
1356 else if (vma > bfd_asymbol_value (sym))
1357 {
1358 (*inf->fprintf_func) (inf->stream, "+0x");
1359 objdump_print_value (vma - bfd_asymbol_value (sym), inf, TRUE);
1360 }
1361
1362 (*inf->fprintf_func) (inf->stream, ">");
1363 }
1364
1365 if (display_file_offsets)
1366 inf->fprintf_func (inf->stream, _(" (File Offset: 0x%lx)"),
1367 (long int)(sec->filepos + (vma - sec->vma)));
1368 }
1369
1370 /* Print an address (VMA), symbolically if possible.
1371 If SKIP_ZEROES is TRUE, don't output leading zeroes. */
1372
1373 static void
1374 objdump_print_addr (bfd_vma vma,
1375 struct disassemble_info *inf,
1376 bfd_boolean skip_zeroes)
1377 {
1378 struct objdump_disasm_info *aux;
1379 asymbol *sym = NULL;
1380 bfd_boolean skip_find = FALSE;
1381
1382 aux = (struct objdump_disasm_info *) inf->application_data;
1383
1384 if (sorted_symcount < 1)
1385 {
1386 if (!no_addresses)
1387 {
1388 (*inf->fprintf_func) (inf->stream, "0x");
1389 objdump_print_value (vma, inf, skip_zeroes);
1390 }
1391
1392 if (display_file_offsets)
1393 inf->fprintf_func (inf->stream, _(" (File Offset: 0x%lx)"),
1394 (long int) (inf->section->filepos
1395 + (vma - inf->section->vma)));
1396 return;
1397 }
1398
1399 if (aux->reloc != NULL
1400 && aux->reloc->sym_ptr_ptr != NULL
1401 && * aux->reloc->sym_ptr_ptr != NULL)
1402 {
1403 sym = * aux->reloc->sym_ptr_ptr;
1404
1405 /* Adjust the vma to the reloc. */
1406 vma += bfd_asymbol_value (sym);
1407
1408 if (bfd_is_und_section (bfd_asymbol_section (sym)))
1409 skip_find = TRUE;
1410 }
1411
1412 if (!skip_find)
1413 sym = find_symbol_for_address (vma, inf, NULL);
1414
1415 objdump_print_addr_with_sym (aux->abfd, inf->section, sym, vma, inf,
1416 skip_zeroes);
1417 }
1418
1419 /* Print VMA to INFO. This function is passed to the disassembler
1420 routine. */
1421
1422 static void
1423 objdump_print_address (bfd_vma vma, struct disassemble_info *inf)
1424 {
1425 objdump_print_addr (vma, inf, ! prefix_addresses);
1426 }
1427
1428 /* Determine if the given address has a symbol associated with it. */
1429
1430 static int
1431 objdump_symbol_at_address (bfd_vma vma, struct disassemble_info * inf)
1432 {
1433 asymbol * sym;
1434
1435 sym = find_symbol_for_address (vma, inf, NULL);
1436
1437 return (sym != NULL && (bfd_asymbol_value (sym) == vma));
1438 }
1439
1440 /* Hold the last function name and the last line number we displayed
1441 in a disassembly. */
1442
1443 static char *prev_functionname;
1444 static unsigned int prev_line;
1445 static unsigned int prev_discriminator;
1446
1447 /* We keep a list of all files that we have seen when doing a
1448 disassembly with source, so that we know how much of the file to
1449 display. This can be important for inlined functions. */
1450
1451 struct print_file_list
1452 {
1453 struct print_file_list *next;
1454 const char *filename;
1455 const char *modname;
1456 const char *map;
1457 size_t mapsize;
1458 const char **linemap;
1459 unsigned maxline;
1460 unsigned last_line;
1461 unsigned max_printed;
1462 int first;
1463 };
1464
1465 static struct print_file_list *print_files;
1466
1467 /* The number of preceding context lines to show when we start
1468 displaying a file for the first time. */
1469
1470 #define SHOW_PRECEDING_CONTEXT_LINES (5)
1471
1472 /* Read a complete file into memory. */
1473
1474 static const char *
1475 slurp_file (const char *fn, size_t *size, struct stat *fst)
1476 {
1477 #ifdef HAVE_MMAP
1478 int ps = getpagesize ();
1479 size_t msize;
1480 #endif
1481 const char *map;
1482 int fd = open (fn, O_RDONLY | O_BINARY);
1483
1484 if (fd < 0)
1485 return NULL;
1486 if (fstat (fd, fst) < 0)
1487 {
1488 close (fd);
1489 return NULL;
1490 }
1491 *size = fst->st_size;
1492 #ifdef HAVE_MMAP
1493 msize = (*size + ps - 1) & ~(ps - 1);
1494 map = mmap (NULL, msize, PROT_READ, MAP_SHARED, fd, 0);
1495 if (map != (char *) -1L)
1496 {
1497 close (fd);
1498 return map;
1499 }
1500 #endif
1501 map = (const char *) malloc (*size);
1502 if (!map || (size_t) read (fd, (char *) map, *size) != *size)
1503 {
1504 free ((void *) map);
1505 map = NULL;
1506 }
1507 close (fd);
1508 return map;
1509 }
1510
1511 #define line_map_decrease 5
1512
1513 /* Precompute array of lines for a mapped file. */
1514
1515 static const char **
1516 index_file (const char *map, size_t size, unsigned int *maxline)
1517 {
1518 const char *p, *lstart, *end;
1519 int chars_per_line = 45; /* First iteration will use 40. */
1520 unsigned int lineno;
1521 const char **linemap = NULL;
1522 unsigned long line_map_size = 0;
1523
1524 lineno = 0;
1525 lstart = map;
1526 end = map + size;
1527
1528 for (p = map; p < end; p++)
1529 {
1530 if (*p == '\n')
1531 {
1532 if (p + 1 < end && p[1] == '\r')
1533 p++;
1534 }
1535 else if (*p == '\r')
1536 {
1537 if (p + 1 < end && p[1] == '\n')
1538 p++;
1539 }
1540 else
1541 continue;
1542
1543 /* End of line found. */
1544
1545 if (linemap == NULL || line_map_size < lineno + 1)
1546 {
1547 unsigned long newsize;
1548
1549 chars_per_line -= line_map_decrease;
1550 if (chars_per_line <= 1)
1551 chars_per_line = 1;
1552 line_map_size = size / chars_per_line + 1;
1553 if (line_map_size < lineno + 1)
1554 line_map_size = lineno + 1;
1555 newsize = line_map_size * sizeof (char *);
1556 linemap = (const char **) xrealloc (linemap, newsize);
1557 }
1558
1559 linemap[lineno++] = lstart;
1560 lstart = p + 1;
1561 }
1562
1563 *maxline = lineno;
1564 return linemap;
1565 }
1566
1567 /* Tries to open MODNAME, and if successful adds a node to print_files
1568 linked list and returns that node. Returns NULL on failure. */
1569
1570 static struct print_file_list *
1571 try_print_file_open (const char *origname, const char *modname, struct stat *fst)
1572 {
1573 struct print_file_list *p;
1574
1575 p = (struct print_file_list *) xmalloc (sizeof (struct print_file_list));
1576
1577 p->map = slurp_file (modname, &p->mapsize, fst);
1578 if (p->map == NULL)
1579 {
1580 free (p);
1581 return NULL;
1582 }
1583
1584 p->linemap = index_file (p->map, p->mapsize, &p->maxline);
1585 p->last_line = 0;
1586 p->max_printed = 0;
1587 p->filename = origname;
1588 p->modname = modname;
1589 p->next = print_files;
1590 p->first = 1;
1591 print_files = p;
1592 return p;
1593 }
1594
1595 /* If the source file, as described in the symtab, is not found
1596 try to locate it in one of the paths specified with -I
1597 If found, add location to print_files linked list. */
1598
1599 static struct print_file_list *
1600 update_source_path (const char *filename, bfd *abfd)
1601 {
1602 struct print_file_list *p;
1603 const char *fname;
1604 struct stat fst;
1605 int i;
1606
1607 p = try_print_file_open (filename, filename, &fst);
1608 if (p == NULL)
1609 {
1610 if (include_path_count == 0)
1611 return NULL;
1612
1613 /* Get the name of the file. */
1614 fname = lbasename (filename);
1615
1616 /* If file exists under a new path, we need to add it to the list
1617 so that show_line knows about it. */
1618 for (i = 0; i < include_path_count; i++)
1619 {
1620 char *modname = concat (include_paths[i], "/", fname,
1621 (const char *) 0);
1622
1623 p = try_print_file_open (filename, modname, &fst);
1624 if (p)
1625 break;
1626
1627 free (modname);
1628 }
1629 }
1630
1631 if (p != NULL)
1632 {
1633 long mtime = bfd_get_mtime (abfd);
1634
1635 if (fst.st_mtime > mtime)
1636 warn (_("source file %s is more recent than object file\n"),
1637 filename);
1638 }
1639
1640 return p;
1641 }
1642
1643 /* Print a source file line. */
1644
1645 static void
1646 print_line (struct print_file_list *p, unsigned int linenum)
1647 {
1648 const char *l;
1649 size_t len;
1650
1651 --linenum;
1652 if (linenum >= p->maxline)
1653 return;
1654 l = p->linemap [linenum];
1655 if (source_comment != NULL && strlen (l) > 0)
1656 printf ("%s", source_comment);
1657 len = strcspn (l, "\n\r");
1658 /* Test fwrite return value to quiet glibc warning. */
1659 if (len == 0 || fwrite (l, len, 1, stdout) == 1)
1660 putchar ('\n');
1661 }
1662
1663 /* Print a range of source code lines. */
1664
1665 static void
1666 dump_lines (struct print_file_list *p, unsigned int start, unsigned int end)
1667 {
1668 if (p->map == NULL)
1669 return;
1670 while (start <= end)
1671 {
1672 print_line (p, start);
1673 start++;
1674 }
1675 }
1676
1677 /* Show the line number, or the source line, in a disassembly
1678 listing. */
1679
1680 static void
1681 show_line (bfd *abfd, asection *section, bfd_vma addr_offset)
1682 {
1683 const char *filename;
1684 const char *functionname;
1685 unsigned int linenumber;
1686 unsigned int discriminator;
1687 bfd_boolean reloc;
1688 char *path = NULL;
1689
1690 if (! with_line_numbers && ! with_source_code)
1691 return;
1692
1693 if (! bfd_find_nearest_line_discriminator (abfd, section, syms, addr_offset,
1694 &filename, &functionname,
1695 &linenumber, &discriminator))
1696 return;
1697
1698 if (filename != NULL && *filename == '\0')
1699 filename = NULL;
1700 if (functionname != NULL && *functionname == '\0')
1701 functionname = NULL;
1702
1703 if (filename
1704 && IS_ABSOLUTE_PATH (filename)
1705 && prefix)
1706 {
1707 char *path_up;
1708 const char *fname = filename;
1709
1710 path = xmalloc (prefix_length + PATH_MAX + 1);
1711
1712 if (prefix_length)
1713 memcpy (path, prefix, prefix_length);
1714 path_up = path + prefix_length;
1715
1716 /* Build relocated filename, stripping off leading directories
1717 from the initial filename if requested. */
1718 if (prefix_strip > 0)
1719 {
1720 int level = 0;
1721 const char *s;
1722
1723 /* Skip selected directory levels. */
1724 for (s = fname + 1; *s != '\0' && level < prefix_strip; s++)
1725 if (IS_DIR_SEPARATOR (*s))
1726 {
1727 fname = s;
1728 level++;
1729 }
1730 }
1731
1732 /* Update complete filename. */
1733 strncpy (path_up, fname, PATH_MAX);
1734 path_up[PATH_MAX] = '\0';
1735
1736 filename = path;
1737 reloc = TRUE;
1738 }
1739 else
1740 reloc = FALSE;
1741
1742 if (with_line_numbers)
1743 {
1744 if (functionname != NULL
1745 && (prev_functionname == NULL
1746 || strcmp (functionname, prev_functionname) != 0))
1747 {
1748 char *demangle_alloc = NULL;
1749 if (do_demangle && functionname[0] != '\0')
1750 {
1751 /* Demangle the name. */
1752 demangle_alloc = bfd_demangle (abfd, functionname,
1753 demangle_flags);
1754 }
1755
1756 /* Demangling adds trailing parens, so don't print those. */
1757 if (demangle_alloc != NULL)
1758 printf ("%s:\n", sanitize_string (demangle_alloc));
1759 else
1760 printf ("%s():\n", sanitize_string (functionname));
1761
1762 prev_line = -1;
1763 free (demangle_alloc);
1764 }
1765 if (linenumber > 0
1766 && (linenumber != prev_line
1767 || discriminator != prev_discriminator))
1768 {
1769 if (discriminator > 0)
1770 printf ("%s:%u (discriminator %u)\n",
1771 filename == NULL ? "???" : sanitize_string (filename),
1772 linenumber, discriminator);
1773 else
1774 printf ("%s:%u\n", filename == NULL
1775 ? "???" : sanitize_string (filename),
1776 linenumber);
1777 }
1778 if (unwind_inlines)
1779 {
1780 const char *filename2;
1781 const char *functionname2;
1782 unsigned line2;
1783
1784 while (bfd_find_inliner_info (abfd, &filename2, &functionname2,
1785 &line2))
1786 {
1787 printf ("inlined by %s:%u",
1788 sanitize_string (filename2), line2);
1789 printf (" (%s)\n", sanitize_string (functionname2));
1790 }
1791 }
1792 }
1793
1794 if (with_source_code
1795 && filename != NULL
1796 && linenumber > 0)
1797 {
1798 struct print_file_list **pp, *p;
1799 unsigned l;
1800
1801 for (pp = &print_files; *pp != NULL; pp = &(*pp)->next)
1802 if (filename_cmp ((*pp)->filename, filename) == 0)
1803 break;
1804 p = *pp;
1805
1806 if (p == NULL)
1807 {
1808 if (reloc)
1809 filename = xstrdup (filename);
1810 p = update_source_path (filename, abfd);
1811 }
1812
1813 if (p != NULL && linenumber != p->last_line)
1814 {
1815 if (file_start_context && p->first)
1816 l = 1;
1817 else
1818 {
1819 l = linenumber - SHOW_PRECEDING_CONTEXT_LINES;
1820 if (l >= linenumber)
1821 l = 1;
1822 if (p->max_printed >= l)
1823 {
1824 if (p->max_printed < linenumber)
1825 l = p->max_printed + 1;
1826 else
1827 l = linenumber;
1828 }
1829 }
1830 dump_lines (p, l, linenumber);
1831 if (p->max_printed < linenumber)
1832 p->max_printed = linenumber;
1833 p->last_line = linenumber;
1834 p->first = 0;
1835 }
1836 }
1837
1838 if (functionname != NULL
1839 && (prev_functionname == NULL
1840 || strcmp (functionname, prev_functionname) != 0))
1841 {
1842 if (prev_functionname != NULL)
1843 free (prev_functionname);
1844 prev_functionname = (char *) xmalloc (strlen (functionname) + 1);
1845 strcpy (prev_functionname, functionname);
1846 }
1847
1848 if (linenumber > 0 && linenumber != prev_line)
1849 prev_line = linenumber;
1850
1851 if (discriminator != prev_discriminator)
1852 prev_discriminator = discriminator;
1853
1854 if (path)
1855 free (path);
1856 }
1857
1858 /* Pseudo FILE object for strings. */
1859 typedef struct
1860 {
1861 char *buffer;
1862 size_t pos;
1863 size_t alloc;
1864 } SFILE;
1865
1866 /* sprintf to a "stream". */
1867
1868 static int ATTRIBUTE_PRINTF_2
1869 objdump_sprintf (SFILE *f, const char *format, ...)
1870 {
1871 size_t n;
1872 va_list args;
1873
1874 while (1)
1875 {
1876 size_t space = f->alloc - f->pos;
1877
1878 va_start (args, format);
1879 n = vsnprintf (f->buffer + f->pos, space, format, args);
1880 va_end (args);
1881
1882 if (space > n)
1883 break;
1884
1885 f->alloc = (f->alloc + n) * 2;
1886 f->buffer = (char *) xrealloc (f->buffer, f->alloc);
1887 }
1888 f->pos += n;
1889
1890 return n;
1891 }
1892
1893 /* Code for generating (colored) diagrams of control flow start and end
1894 points. */
1895
1896 /* Structure used to store the properties of a jump. */
1897
1898 struct jump_info
1899 {
1900 /* The next jump, or NULL if this is the last object. */
1901 struct jump_info *next;
1902 /* The previous jump, or NULL if this is the first object. */
1903 struct jump_info *prev;
1904 /* The start addresses of the jump. */
1905 struct
1906 {
1907 /* The list of start addresses. */
1908 bfd_vma *addresses;
1909 /* The number of elements. */
1910 size_t count;
1911 /* The maximum number of elements that fit into the array. */
1912 size_t max_count;
1913 } start;
1914 /* The end address of the jump. */
1915 bfd_vma end;
1916 /* The drawing level of the jump. */
1917 int level;
1918 };
1919
1920 /* Construct a jump object for a jump from start
1921 to end with the corresponding level. */
1922
1923 static struct jump_info *
1924 jump_info_new (bfd_vma start, bfd_vma end, int level)
1925 {
1926 struct jump_info *result = xmalloc (sizeof (struct jump_info));
1927
1928 result->next = NULL;
1929 result->prev = NULL;
1930 result->start.addresses = xmalloc (sizeof (bfd_vma *) * 2);
1931 result->start.addresses[0] = start;
1932 result->start.count = 1;
1933 result->start.max_count = 2;
1934 result->end = end;
1935 result->level = level;
1936
1937 return result;
1938 }
1939
1940 /* Free a jump object and return the next object
1941 or NULL if this was the last one. */
1942
1943 static struct jump_info *
1944 jump_info_free (struct jump_info *ji)
1945 {
1946 struct jump_info *result = NULL;
1947
1948 if (ji)
1949 {
1950 result = ji->next;
1951 if (ji->start.addresses)
1952 free (ji->start.addresses);
1953 free (ji);
1954 }
1955
1956 return result;
1957 }
1958
1959 /* Get the smallest value of all start and end addresses. */
1960
1961 static bfd_vma
1962 jump_info_min_address (const struct jump_info *ji)
1963 {
1964 bfd_vma min_address = ji->end;
1965 size_t i;
1966
1967 for (i = ji->start.count; i-- > 0;)
1968 if (ji->start.addresses[i] < min_address)
1969 min_address = ji->start.addresses[i];
1970 return min_address;
1971 }
1972
1973 /* Get the largest value of all start and end addresses. */
1974
1975 static bfd_vma
1976 jump_info_max_address (const struct jump_info *ji)
1977 {
1978 bfd_vma max_address = ji->end;
1979 size_t i;
1980
1981 for (i = ji->start.count; i-- > 0;)
1982 if (ji->start.addresses[i] > max_address)
1983 max_address = ji->start.addresses[i];
1984 return max_address;
1985 }
1986
1987 /* Get the target address of a jump. */
1988
1989 static bfd_vma
1990 jump_info_end_address (const struct jump_info *ji)
1991 {
1992 return ji->end;
1993 }
1994
1995 /* Test if an address is one of the start addresses of a jump. */
1996
1997 static bfd_boolean
1998 jump_info_is_start_address (const struct jump_info *ji, bfd_vma address)
1999 {
2000 bfd_boolean result = FALSE;
2001 size_t i;
2002
2003 for (i = ji->start.count; i-- > 0;)
2004 if (address == ji->start.addresses[i])
2005 {
2006 result = TRUE;
2007 break;
2008 }
2009
2010 return result;
2011 }
2012
2013 /* Test if an address is the target address of a jump. */
2014
2015 static bfd_boolean
2016 jump_info_is_end_address (const struct jump_info *ji, bfd_vma address)
2017 {
2018 return (address == ji->end);
2019 }
2020
2021 /* Get the difference between the smallest and largest address of a jump. */
2022
2023 static bfd_vma
2024 jump_info_size (const struct jump_info *ji)
2025 {
2026 return jump_info_max_address (ji) - jump_info_min_address (ji);
2027 }
2028
2029 /* Unlink a jump object from a list. */
2030
2031 static void
2032 jump_info_unlink (struct jump_info *node,
2033 struct jump_info **base)
2034 {
2035 if (node->next)
2036 node->next->prev = node->prev;
2037 if (node->prev)
2038 node->prev->next = node->next;
2039 else
2040 *base = node->next;
2041 node->next = NULL;
2042 node->prev = NULL;
2043 }
2044
2045 /* Insert unlinked jump info node into a list. */
2046
2047 static void
2048 jump_info_insert (struct jump_info *node,
2049 struct jump_info *target,
2050 struct jump_info **base)
2051 {
2052 node->next = target;
2053 node->prev = target->prev;
2054 target->prev = node;
2055 if (node->prev)
2056 node->prev->next = node;
2057 else
2058 *base = node;
2059 }
2060
2061 /* Add unlinked node to the front of a list. */
2062
2063 static void
2064 jump_info_add_front (struct jump_info *node,
2065 struct jump_info **base)
2066 {
2067 node->next = *base;
2068 if (node->next)
2069 node->next->prev = node;
2070 node->prev = NULL;
2071 *base = node;
2072 }
2073
2074 /* Move linked node to target position. */
2075
2076 static void
2077 jump_info_move_linked (struct jump_info *node,
2078 struct jump_info *target,
2079 struct jump_info **base)
2080 {
2081 /* Unlink node. */
2082 jump_info_unlink (node, base);
2083 /* Insert node at target position. */
2084 jump_info_insert (node, target, base);
2085 }
2086
2087 /* Test if two jumps intersect. */
2088
2089 static bfd_boolean
2090 jump_info_intersect (const struct jump_info *a,
2091 const struct jump_info *b)
2092 {
2093 return ((jump_info_max_address (a) >= jump_info_min_address (b))
2094 && (jump_info_min_address (a) <= jump_info_max_address (b)));
2095 }
2096
2097 /* Merge two compatible jump info objects. */
2098
2099 static void
2100 jump_info_merge (struct jump_info **base)
2101 {
2102 struct jump_info *a;
2103
2104 for (a = *base; a; a = a->next)
2105 {
2106 struct jump_info *b;
2107
2108 for (b = a->next; b; b = b->next)
2109 {
2110 /* Merge both jumps into one. */
2111 if (a->end == b->end)
2112 {
2113 /* Reallocate addresses. */
2114 size_t needed_size = a->start.count + b->start.count;
2115 size_t i;
2116
2117 if (needed_size > a->start.max_count)
2118 {
2119 a->start.max_count += b->start.max_count;
2120 a->start.addresses =
2121 xrealloc (a->start.addresses,
2122 a->start.max_count * sizeof (bfd_vma *));
2123 }
2124
2125 /* Append start addresses. */
2126 for (i = 0; i < b->start.count; ++i)
2127 a->start.addresses[a->start.count++] =
2128 b->start.addresses[i];
2129
2130 /* Remove and delete jump. */
2131 struct jump_info *tmp = b->prev;
2132 jump_info_unlink (b, base);
2133 jump_info_free (b);
2134 b = tmp;
2135 }
2136 }
2137 }
2138 }
2139
2140 /* Sort jumps by their size and starting point using a stable
2141 minsort. This could be improved if sorting performance is
2142 an issue, for example by using mergesort. */
2143
2144 static void
2145 jump_info_sort (struct jump_info **base)
2146 {
2147 struct jump_info *current_element = *base;
2148
2149 while (current_element)
2150 {
2151 struct jump_info *best_match = current_element;
2152 struct jump_info *runner = current_element->next;
2153 bfd_vma best_size = jump_info_size (best_match);
2154
2155 while (runner)
2156 {
2157 bfd_vma runner_size = jump_info_size (runner);
2158
2159 if ((runner_size < best_size)
2160 || ((runner_size == best_size)
2161 && (jump_info_min_address (runner)
2162 < jump_info_min_address (best_match))))
2163 {
2164 best_match = runner;
2165 best_size = runner_size;
2166 }
2167
2168 runner = runner->next;
2169 }
2170
2171 if (best_match == current_element)
2172 current_element = current_element->next;
2173 else
2174 jump_info_move_linked (best_match, current_element, base);
2175 }
2176 }
2177
2178 /* Visualize all jumps at a given address. */
2179
2180 static void
2181 jump_info_visualize_address (bfd_vma address,
2182 int max_level,
2183 char *line_buffer,
2184 uint8_t *color_buffer)
2185 {
2186 struct jump_info *ji = detected_jumps;
2187 size_t len = (max_level + 1) * 3;
2188
2189 /* Clear line buffer. */
2190 memset (line_buffer, ' ', len);
2191 memset (color_buffer, 0, len);
2192
2193 /* Iterate over jumps and add their ASCII art. */
2194 while (ji)
2195 {
2196 /* Discard jumps that are never needed again. */
2197 if (jump_info_max_address (ji) < address)
2198 {
2199 struct jump_info *tmp = ji;
2200
2201 ji = ji->next;
2202 jump_info_unlink (tmp, &detected_jumps);
2203 jump_info_free (tmp);
2204 continue;
2205 }
2206
2207 /* This jump intersects with the current address. */
2208 if (jump_info_min_address (ji) <= address)
2209 {
2210 /* Hash target address to get an even
2211 distribution between all values. */
2212 bfd_vma hash_address = jump_info_end_address (ji);
2213 uint8_t color = iterative_hash_object (hash_address, 0);
2214 /* Fetch line offset. */
2215 int offset = (max_level - ji->level) * 3;
2216
2217 /* Draw start line. */
2218 if (jump_info_is_start_address (ji, address))
2219 {
2220 size_t i = offset + 1;
2221
2222 for (; i < len - 1; ++i)
2223 if (line_buffer[i] == ' ')
2224 {
2225 line_buffer[i] = '-';
2226 color_buffer[i] = color;
2227 }
2228
2229 if (line_buffer[i] == ' ')
2230 {
2231 line_buffer[i] = '-';
2232 color_buffer[i] = color;
2233 }
2234 else if (line_buffer[i] == '>')
2235 {
2236 line_buffer[i] = 'X';
2237 color_buffer[i] = color;
2238 }
2239
2240 if (line_buffer[offset] == ' ')
2241 {
2242 if (address <= ji->end)
2243 line_buffer[offset] =
2244 (jump_info_min_address (ji) == address) ? '/': '+';
2245 else
2246 line_buffer[offset] =
2247 (jump_info_max_address (ji) == address) ? '\\': '+';
2248 color_buffer[offset] = color;
2249 }
2250 }
2251 /* Draw jump target. */
2252 else if (jump_info_is_end_address (ji, address))
2253 {
2254 size_t i = offset + 1;
2255
2256 for (; i < len - 1; ++i)
2257 if (line_buffer[i] == ' ')
2258 {
2259 line_buffer[i] = '-';
2260 color_buffer[i] = color;
2261 }
2262
2263 if (line_buffer[i] == ' ')
2264 {
2265 line_buffer[i] = '>';
2266 color_buffer[i] = color;
2267 }
2268 else if (line_buffer[i] == '-')
2269 {
2270 line_buffer[i] = 'X';
2271 color_buffer[i] = color;
2272 }
2273
2274 if (line_buffer[offset] == ' ')
2275 {
2276 if (jump_info_min_address (ji) < address)
2277 line_buffer[offset] =
2278 (jump_info_max_address (ji) > address) ? '>' : '\\';
2279 else
2280 line_buffer[offset] = '/';
2281 color_buffer[offset] = color;
2282 }
2283 }
2284 /* Draw intermediate line segment. */
2285 else if (line_buffer[offset] == ' ')
2286 {
2287 line_buffer[offset] = '|';
2288 color_buffer[offset] = color;
2289 }
2290 }
2291
2292 ji = ji->next;
2293 }
2294 }
2295
2296 /* Clone of disassemble_bytes to detect jumps inside a function. */
2297 /* FIXME: is this correct? Can we strip it down even further? */
2298
2299 static struct jump_info *
2300 disassemble_jumps (struct disassemble_info * inf,
2301 disassembler_ftype disassemble_fn,
2302 bfd_vma start_offset,
2303 bfd_vma stop_offset,
2304 bfd_vma rel_offset,
2305 arelent *** relppp,
2306 arelent ** relppend)
2307 {
2308 struct objdump_disasm_info *aux;
2309 struct jump_info *jumps = NULL;
2310 asection *section;
2311 bfd_vma addr_offset;
2312 unsigned int opb = inf->octets_per_byte;
2313 int octets = opb;
2314 SFILE sfile;
2315
2316 aux = (struct objdump_disasm_info *) inf->application_data;
2317 section = inf->section;
2318
2319 sfile.alloc = 120;
2320 sfile.buffer = (char *) xmalloc (sfile.alloc);
2321 sfile.pos = 0;
2322
2323 inf->insn_info_valid = 0;
2324 inf->fprintf_func = (fprintf_ftype) objdump_sprintf;
2325 inf->stream = &sfile;
2326
2327 addr_offset = start_offset;
2328 while (addr_offset < stop_offset)
2329 {
2330 int previous_octets;
2331
2332 /* Remember the length of the previous instruction. */
2333 previous_octets = octets;
2334 octets = 0;
2335
2336 sfile.pos = 0;
2337 inf->bytes_per_line = 0;
2338 inf->bytes_per_chunk = 0;
2339 inf->flags = ((disassemble_all ? DISASSEMBLE_DATA : 0)
2340 | (wide_output ? WIDE_OUTPUT : 0));
2341 if (machine)
2342 inf->flags |= USER_SPECIFIED_MACHINE_TYPE;
2343
2344 if (inf->disassembler_needs_relocs
2345 && (bfd_get_file_flags (aux->abfd) & EXEC_P) == 0
2346 && (bfd_get_file_flags (aux->abfd) & DYNAMIC) == 0
2347 && *relppp < relppend)
2348 {
2349 bfd_signed_vma distance_to_rel;
2350
2351 distance_to_rel = (**relppp)->address - (rel_offset + addr_offset);
2352
2353 /* Check to see if the current reloc is associated with
2354 the instruction that we are about to disassemble. */
2355 if (distance_to_rel == 0
2356 /* FIXME: This is wrong. We are trying to catch
2357 relocs that are addressed part way through the
2358 current instruction, as might happen with a packed
2359 VLIW instruction. Unfortunately we do not know the
2360 length of the current instruction since we have not
2361 disassembled it yet. Instead we take a guess based
2362 upon the length of the previous instruction. The
2363 proper solution is to have a new target-specific
2364 disassembler function which just returns the length
2365 of an instruction at a given address without trying
2366 to display its disassembly. */
2367 || (distance_to_rel > 0
2368 && distance_to_rel < (bfd_signed_vma) (previous_octets/ opb)))
2369 {
2370 inf->flags |= INSN_HAS_RELOC;
2371 }
2372 }
2373
2374 if (! disassemble_all
2375 && (section->flags & (SEC_CODE | SEC_HAS_CONTENTS))
2376 == (SEC_CODE | SEC_HAS_CONTENTS))
2377 /* Set a stop_vma so that the disassembler will not read
2378 beyond the next symbol. We assume that symbols appear on
2379 the boundaries between instructions. We only do this when
2380 disassembling code of course, and when -D is in effect. */
2381 inf->stop_vma = section->vma + stop_offset;
2382
2383 inf->stop_offset = stop_offset;
2384
2385 /* Extract jump information. */
2386 inf->insn_info_valid = 0;
2387 octets = (*disassemble_fn) (section->vma + addr_offset, inf);
2388 /* Test if a jump was detected. */
2389 if (inf->insn_info_valid
2390 && ((inf->insn_type == dis_branch)
2391 || (inf->insn_type == dis_condbranch)
2392 || (inf->insn_type == dis_jsr)
2393 || (inf->insn_type == dis_condjsr))
2394 && (inf->target >= section->vma + start_offset)
2395 && (inf->target < section->vma + stop_offset))
2396 {
2397 struct jump_info *ji =
2398 jump_info_new (section->vma + addr_offset, inf->target, -1);
2399 jump_info_add_front (ji, &jumps);
2400 }
2401
2402 inf->stop_vma = 0;
2403
2404 addr_offset += octets / opb;
2405 }
2406
2407 inf->fprintf_func = (fprintf_ftype) fprintf;
2408 inf->stream = stdout;
2409
2410 free (sfile.buffer);
2411
2412 /* Merge jumps. */
2413 jump_info_merge (&jumps);
2414 /* Process jumps. */
2415 jump_info_sort (&jumps);
2416
2417 /* Group jumps by level. */
2418 struct jump_info *last_jump = jumps;
2419 int max_level = -1;
2420
2421 while (last_jump)
2422 {
2423 /* The last jump is part of the next group. */
2424 struct jump_info *base = last_jump;
2425 /* Increment level. */
2426 base->level = ++max_level;
2427
2428 /* Find jumps that can be combined on the same
2429 level, with the largest jumps tested first.
2430 This has the advantage that large jumps are on
2431 lower levels and do not intersect with small
2432 jumps that get grouped on higher levels. */
2433 struct jump_info *exchange_item = last_jump->next;
2434 struct jump_info *it = exchange_item;
2435
2436 for (; it; it = it->next)
2437 {
2438 /* Test if the jump intersects with any
2439 jump from current group. */
2440 bfd_boolean ok = TRUE;
2441 struct jump_info *it_collision;
2442
2443 for (it_collision = base;
2444 it_collision != exchange_item;
2445 it_collision = it_collision->next)
2446 {
2447 /* This jump intersects so we leave it out. */
2448 if (jump_info_intersect (it_collision, it))
2449 {
2450 ok = FALSE;
2451 break;
2452 }
2453 }
2454
2455 /* Add jump to group. */
2456 if (ok)
2457 {
2458 /* Move current element to the front. */
2459 if (it != exchange_item)
2460 {
2461 struct jump_info *save = it->prev;
2462 jump_info_move_linked (it, exchange_item, &jumps);
2463 last_jump = it;
2464 it = save;
2465 }
2466 else
2467 {
2468 last_jump = exchange_item;
2469 exchange_item = exchange_item->next;
2470 }
2471 last_jump->level = max_level;
2472 }
2473 }
2474
2475 /* Move to next group. */
2476 last_jump = exchange_item;
2477 }
2478
2479 return jumps;
2480 }
2481
2482 /* The number of zeroes we want to see before we start skipping them.
2483 The number is arbitrarily chosen. */
2484
2485 #define DEFAULT_SKIP_ZEROES 8
2486
2487 /* The number of zeroes to skip at the end of a section. If the
2488 number of zeroes at the end is between SKIP_ZEROES_AT_END and
2489 SKIP_ZEROES, they will be disassembled. If there are fewer than
2490 SKIP_ZEROES_AT_END, they will be skipped. This is a heuristic
2491 attempt to avoid disassembling zeroes inserted by section
2492 alignment. */
2493
2494 #define DEFAULT_SKIP_ZEROES_AT_END 3
2495
2496 static int
2497 null_print (const void * stream ATTRIBUTE_UNUSED, const char * format ATTRIBUTE_UNUSED, ...)
2498 {
2499 return 1;
2500 }
2501
2502 /* Print out jump visualization. */
2503
2504 static void
2505 print_jump_visualisation (bfd_vma addr, int max_level, char *line_buffer,
2506 uint8_t *color_buffer)
2507 {
2508 if (!line_buffer)
2509 return;
2510
2511 jump_info_visualize_address (addr, max_level, line_buffer, color_buffer);
2512
2513 size_t line_buffer_size = strlen (line_buffer);
2514 char last_color = 0;
2515 size_t i;
2516
2517 for (i = 0; i <= line_buffer_size; ++i)
2518 {
2519 if (color_output)
2520 {
2521 uint8_t color = (i < line_buffer_size) ? color_buffer[i]: 0;
2522
2523 if (color != last_color)
2524 {
2525 if (color)
2526 if (extended_color_output)
2527 /* Use extended 8bit color, but
2528 do not choose dark colors. */
2529 printf ("\033[38;5;%dm", 124 + (color % 108));
2530 else
2531 /* Use simple terminal colors. */
2532 printf ("\033[%dm", 31 + (color % 7));
2533 else
2534 /* Clear color. */
2535 printf ("\033[0m");
2536 last_color = color;
2537 }
2538 }
2539 putchar ((i < line_buffer_size) ? line_buffer[i]: ' ');
2540 }
2541 }
2542
2543 /* Disassemble some data in memory between given values. */
2544
2545 static void
2546 disassemble_bytes (struct disassemble_info * inf,
2547 disassembler_ftype disassemble_fn,
2548 bfd_boolean insns,
2549 bfd_byte * data,
2550 bfd_vma start_offset,
2551 bfd_vma stop_offset,
2552 bfd_vma rel_offset,
2553 arelent *** relppp,
2554 arelent ** relppend)
2555 {
2556 struct objdump_disasm_info *aux;
2557 asection *section;
2558 int octets_per_line;
2559 int skip_addr_chars;
2560 bfd_vma addr_offset;
2561 unsigned int opb = inf->octets_per_byte;
2562 unsigned int skip_zeroes = inf->skip_zeroes;
2563 unsigned int skip_zeroes_at_end = inf->skip_zeroes_at_end;
2564 int octets = opb;
2565 SFILE sfile;
2566
2567 aux = (struct objdump_disasm_info *) inf->application_data;
2568 section = inf->section;
2569
2570 sfile.alloc = 120;
2571 sfile.buffer = (char *) xmalloc (sfile.alloc);
2572 sfile.pos = 0;
2573
2574 if (insn_width)
2575 octets_per_line = insn_width;
2576 else if (insns)
2577 octets_per_line = 4;
2578 else
2579 octets_per_line = 16;
2580
2581 /* Figure out how many characters to skip at the start of an
2582 address, to make the disassembly look nicer. We discard leading
2583 zeroes in chunks of 4, ensuring that there is always a leading
2584 zero remaining. */
2585 skip_addr_chars = 0;
2586 if (!no_addresses && !prefix_addresses)
2587 {
2588 char buf[30];
2589
2590 bfd_sprintf_vma (aux->abfd, buf, section->vma + section->size / opb);
2591
2592 while (buf[skip_addr_chars] == '0')
2593 ++skip_addr_chars;
2594
2595 /* Don't discard zeros on overflow. */
2596 if (buf[skip_addr_chars] == '\0' && section->vma != 0)
2597 skip_addr_chars = 0;
2598
2599 if (skip_addr_chars != 0)
2600 skip_addr_chars = (skip_addr_chars - 1) & -4;
2601 }
2602
2603 inf->insn_info_valid = 0;
2604
2605 /* Determine maximum level. */
2606 uint8_t *color_buffer = NULL;
2607 char *line_buffer = NULL;
2608 int max_level = -1;
2609
2610 /* Some jumps were detected. */
2611 if (detected_jumps)
2612 {
2613 struct jump_info *ji;
2614
2615 /* Find maximum jump level. */
2616 for (ji = detected_jumps; ji; ji = ji->next)
2617 {
2618 if (ji->level > max_level)
2619 max_level = ji->level;
2620 }
2621
2622 /* Allocate buffers. */
2623 size_t len = (max_level + 1) * 3 + 1;
2624 line_buffer = xmalloc (len);
2625 line_buffer[len - 1] = 0;
2626 color_buffer = xmalloc (len);
2627 color_buffer[len - 1] = 0;
2628 }
2629
2630 addr_offset = start_offset;
2631 while (addr_offset < stop_offset)
2632 {
2633 bfd_vma z;
2634 bfd_boolean need_nl = FALSE;
2635
2636 octets = 0;
2637
2638 /* Make sure we don't use relocs from previous instructions. */
2639 aux->reloc = NULL;
2640
2641 /* If we see more than SKIP_ZEROES octets of zeroes, we just
2642 print `...'. */
2643 for (z = addr_offset * opb; z < stop_offset * opb; z++)
2644 if (data[z] != 0)
2645 break;
2646 if (! disassemble_zeroes
2647 && (inf->insn_info_valid == 0
2648 || inf->branch_delay_insns == 0)
2649 && (z - addr_offset * opb >= skip_zeroes
2650 || (z == stop_offset * opb &&
2651 z - addr_offset * opb < skip_zeroes_at_end)))
2652 {
2653 /* If there are more nonzero octets to follow, we only skip
2654 zeroes in multiples of 4, to try to avoid running over
2655 the start of an instruction which happens to start with
2656 zero. */
2657 if (z != stop_offset * opb)
2658 z = addr_offset * opb + ((z - addr_offset * opb) &~ 3);
2659
2660 octets = z - addr_offset * opb;
2661
2662 /* If we are going to display more data, and we are displaying
2663 file offsets, then tell the user how many zeroes we skip
2664 and the file offset from where we resume dumping. */
2665 if (display_file_offsets && ((addr_offset + (octets / opb)) < stop_offset))
2666 printf ("\t... (skipping %d zeroes, resuming at file offset: 0x%lx)\n",
2667 octets / opb,
2668 (unsigned long) (section->filepos
2669 + (addr_offset + (octets / opb))));
2670 else
2671 printf ("\t...\n");
2672 }
2673 else
2674 {
2675 char buf[50];
2676 int bpc = 0;
2677 int pb = 0;
2678
2679 if (with_line_numbers || with_source_code)
2680 show_line (aux->abfd, section, addr_offset);
2681
2682 if (no_addresses)
2683 printf ("\t");
2684 else if (!prefix_addresses)
2685 {
2686 char *s;
2687
2688 bfd_sprintf_vma (aux->abfd, buf, section->vma + addr_offset);
2689 for (s = buf + skip_addr_chars; *s == '0'; s++)
2690 *s = ' ';
2691 if (*s == '\0')
2692 *--s = '0';
2693 printf ("%s:\t", buf + skip_addr_chars);
2694 }
2695 else
2696 {
2697 aux->require_sec = TRUE;
2698 objdump_print_address (section->vma + addr_offset, inf);
2699 aux->require_sec = FALSE;
2700 putchar (' ');
2701 }
2702
2703 print_jump_visualisation (section->vma + addr_offset,
2704 max_level, line_buffer,
2705 color_buffer);
2706
2707 if (insns)
2708 {
2709 sfile.pos = 0;
2710 inf->fprintf_func = (fprintf_ftype) objdump_sprintf;
2711 inf->stream = &sfile;
2712 inf->bytes_per_line = 0;
2713 inf->bytes_per_chunk = 0;
2714 inf->flags = ((disassemble_all ? DISASSEMBLE_DATA : 0)
2715 | (wide_output ? WIDE_OUTPUT : 0));
2716 if (machine)
2717 inf->flags |= USER_SPECIFIED_MACHINE_TYPE;
2718
2719 if (inf->disassembler_needs_relocs
2720 && (bfd_get_file_flags (aux->abfd) & EXEC_P) == 0
2721 && (bfd_get_file_flags (aux->abfd) & DYNAMIC) == 0
2722 && *relppp < relppend)
2723 {
2724 bfd_signed_vma distance_to_rel;
2725 int insn_size = 0;
2726 int max_reloc_offset
2727 = aux->abfd->arch_info->max_reloc_offset_into_insn;
2728
2729 distance_to_rel = ((**relppp)->address - rel_offset
2730 - addr_offset);
2731
2732 if (distance_to_rel > 0
2733 && (max_reloc_offset < 0
2734 || distance_to_rel <= max_reloc_offset))
2735 {
2736 /* This reloc *might* apply to the current insn,
2737 starting somewhere inside it. Discover the length
2738 of the current insn so that the check below will
2739 work. */
2740 if (insn_width)
2741 insn_size = insn_width;
2742 else
2743 {
2744 /* We find the length by calling the dissassembler
2745 function with a dummy print handler. This should
2746 work unless the disassembler is not expecting to
2747 be called multiple times for the same address.
2748
2749 This does mean disassembling the instruction
2750 twice, but we only do this when there is a high
2751 probability that there is a reloc that will
2752 affect the instruction. */
2753 inf->fprintf_func = (fprintf_ftype) null_print;
2754 insn_size = disassemble_fn (section->vma
2755 + addr_offset, inf);
2756 inf->fprintf_func = (fprintf_ftype) objdump_sprintf;
2757 }
2758 }
2759
2760 /* Check to see if the current reloc is associated with
2761 the instruction that we are about to disassemble. */
2762 if (distance_to_rel == 0
2763 || (distance_to_rel > 0
2764 && distance_to_rel < insn_size / (int) opb))
2765 {
2766 inf->flags |= INSN_HAS_RELOC;
2767 aux->reloc = **relppp;
2768 }
2769 }
2770
2771 if (! disassemble_all
2772 && (section->flags & (SEC_CODE | SEC_HAS_CONTENTS))
2773 == (SEC_CODE | SEC_HAS_CONTENTS))
2774 /* Set a stop_vma so that the disassembler will not read
2775 beyond the next symbol. We assume that symbols appear on
2776 the boundaries between instructions. We only do this when
2777 disassembling code of course, and when -D is in effect. */
2778 inf->stop_vma = section->vma + stop_offset;
2779
2780 inf->stop_offset = stop_offset;
2781 octets = (*disassemble_fn) (section->vma + addr_offset, inf);
2782
2783 inf->stop_vma = 0;
2784 inf->fprintf_func = (fprintf_ftype) fprintf;
2785 inf->stream = stdout;
2786 if (insn_width == 0 && inf->bytes_per_line != 0)
2787 octets_per_line = inf->bytes_per_line;
2788 if (octets < (int) opb)
2789 {
2790 if (sfile.pos)
2791 printf ("%s\n", sfile.buffer);
2792 if (octets >= 0)
2793 {
2794 non_fatal (_("disassemble_fn returned length %d"),
2795 octets);
2796 exit_status = 1;
2797 }
2798 break;
2799 }
2800 }
2801 else
2802 {
2803 bfd_vma j;
2804
2805 octets = octets_per_line;
2806 if (addr_offset + octets / opb > stop_offset)
2807 octets = (stop_offset - addr_offset) * opb;
2808
2809 for (j = addr_offset * opb; j < addr_offset * opb + octets; ++j)
2810 {
2811 if (ISPRINT (data[j]))
2812 buf[j - addr_offset * opb] = data[j];
2813 else
2814 buf[j - addr_offset * opb] = '.';
2815 }
2816 buf[j - addr_offset * opb] = '\0';
2817 }
2818
2819 if (prefix_addresses
2820 ? show_raw_insn > 0
2821 : show_raw_insn >= 0)
2822 {
2823 bfd_vma j;
2824
2825 /* If ! prefix_addresses and ! wide_output, we print
2826 octets_per_line octets per line. */
2827 pb = octets;
2828 if (pb > octets_per_line && ! prefix_addresses && ! wide_output)
2829 pb = octets_per_line;
2830
2831 if (inf->bytes_per_chunk)
2832 bpc = inf->bytes_per_chunk;
2833 else
2834 bpc = 1;
2835
2836 for (j = addr_offset * opb; j < addr_offset * opb + pb; j += bpc)
2837 {
2838 /* PR 21580: Check for a buffer ending early. */
2839 if (j + bpc <= stop_offset * opb)
2840 {
2841 int k;
2842
2843 if (inf->display_endian == BFD_ENDIAN_LITTLE)
2844 {
2845 for (k = bpc - 1; k >= 0; k--)
2846 printf ("%02x", (unsigned) data[j + k]);
2847 }
2848 else
2849 {
2850 for (k = 0; k < bpc; k++)
2851 printf ("%02x", (unsigned) data[j + k]);
2852 }
2853 }
2854 putchar (' ');
2855 }
2856
2857 for (; pb < octets_per_line; pb += bpc)
2858 {
2859 int k;
2860
2861 for (k = 0; k < bpc; k++)
2862 printf (" ");
2863 putchar (' ');
2864 }
2865
2866 /* Separate raw data from instruction by extra space. */
2867 if (insns)
2868 putchar ('\t');
2869 else
2870 printf (" ");
2871 }
2872
2873 if (! insns)
2874 printf ("%s", buf);
2875 else if (sfile.pos)
2876 printf ("%s", sfile.buffer);
2877
2878 if (prefix_addresses
2879 ? show_raw_insn > 0
2880 : show_raw_insn >= 0)
2881 {
2882 while (pb < octets)
2883 {
2884 bfd_vma j;
2885 char *s;
2886
2887 putchar ('\n');
2888 j = addr_offset * opb + pb;
2889
2890 if (no_addresses)
2891 printf ("\t");
2892 else
2893 {
2894 bfd_sprintf_vma (aux->abfd, buf, section->vma + j / opb);
2895 for (s = buf + skip_addr_chars; *s == '0'; s++)
2896 *s = ' ';
2897 if (*s == '\0')
2898 *--s = '0';
2899 printf ("%s:\t", buf + skip_addr_chars);
2900 }
2901
2902 print_jump_visualisation (section->vma + j / opb,
2903 max_level, line_buffer,
2904 color_buffer);
2905
2906 pb += octets_per_line;
2907 if (pb > octets)
2908 pb = octets;
2909 for (; j < addr_offset * opb + pb; j += bpc)
2910 {
2911 /* PR 21619: Check for a buffer ending early. */
2912 if (j + bpc <= stop_offset * opb)
2913 {
2914 int k;
2915
2916 if (inf->display_endian == BFD_ENDIAN_LITTLE)
2917 {
2918 for (k = bpc - 1; k >= 0; k--)
2919 printf ("%02x", (unsigned) data[j + k]);
2920 }
2921 else
2922 {
2923 for (k = 0; k < bpc; k++)
2924 printf ("%02x", (unsigned) data[j + k]);
2925 }
2926 }
2927 putchar (' ');
2928 }
2929 }
2930 }
2931
2932 if (!wide_output)
2933 putchar ('\n');
2934 else
2935 need_nl = TRUE;
2936 }
2937
2938 while ((*relppp) < relppend
2939 && (**relppp)->address < rel_offset + addr_offset + octets / opb)
2940 {
2941 if (dump_reloc_info || dump_dynamic_reloc_info)
2942 {
2943 arelent *q;
2944
2945 q = **relppp;
2946
2947 if (wide_output)
2948 putchar ('\t');
2949 else
2950 printf ("\t\t\t");
2951
2952 if (!no_addresses)
2953 {
2954 objdump_print_value (section->vma - rel_offset + q->address,
2955 inf, TRUE);
2956 printf (": ");
2957 }
2958
2959 if (q->howto == NULL)
2960 printf ("*unknown*\t");
2961 else if (q->howto->name)
2962 printf ("%s\t", q->howto->name);
2963 else
2964 printf ("%d\t", q->howto->type);
2965
2966 if (q->sym_ptr_ptr == NULL || *q->sym_ptr_ptr == NULL)
2967 printf ("*unknown*");
2968 else
2969 {
2970 const char *sym_name;
2971
2972 sym_name = bfd_asymbol_name (*q->sym_ptr_ptr);
2973 if (sym_name != NULL && *sym_name != '\0')
2974 objdump_print_symname (aux->abfd, inf, *q->sym_ptr_ptr);
2975 else
2976 {
2977 asection *sym_sec;
2978
2979 sym_sec = bfd_asymbol_section (*q->sym_ptr_ptr);
2980 sym_name = bfd_section_name (sym_sec);
2981 if (sym_name == NULL || *sym_name == '\0')
2982 sym_name = "*unknown*";
2983 printf ("%s", sanitize_string (sym_name));
2984 }
2985 }
2986
2987 if (q->addend)
2988 {
2989 bfd_signed_vma addend = q->addend;
2990 if (addend < 0)
2991 {
2992 printf ("-0x");
2993 addend = -addend;
2994 }
2995 else
2996 printf ("+0x");
2997 objdump_print_value (addend, inf, TRUE);
2998 }
2999
3000 printf ("\n");
3001 need_nl = FALSE;
3002 }
3003 ++(*relppp);
3004 }
3005
3006 if (need_nl)
3007 printf ("\n");
3008
3009 addr_offset += octets / opb;
3010 }
3011
3012 free (sfile.buffer);
3013 free (line_buffer);
3014 free (color_buffer);
3015 }
3016
3017 static void
3018 disassemble_section (bfd *abfd, asection *section, void *inf)
3019 {
3020 const struct elf_backend_data * bed;
3021 bfd_vma sign_adjust = 0;
3022 struct disassemble_info * pinfo = (struct disassemble_info *) inf;
3023 struct objdump_disasm_info * paux;
3024 unsigned int opb = pinfo->octets_per_byte;
3025 bfd_byte * data = NULL;
3026 bfd_size_type datasize = 0;
3027 arelent ** rel_pp = NULL;
3028 arelent ** rel_ppstart = NULL;
3029 arelent ** rel_ppend;
3030 bfd_vma stop_offset;
3031 asymbol * sym = NULL;
3032 long place = 0;
3033 long rel_count;
3034 bfd_vma rel_offset;
3035 unsigned long addr_offset;
3036 bfd_boolean do_print;
3037 enum loop_control
3038 {
3039 stop_offset_reached,
3040 function_sym,
3041 next_sym
3042 } loop_until;
3043
3044 /* Sections that do not contain machine
3045 code are not normally disassembled. */
3046 if (! disassemble_all
3047 && only_list == NULL
3048 && ((section->flags & (SEC_CODE | SEC_HAS_CONTENTS))
3049 != (SEC_CODE | SEC_HAS_CONTENTS)))
3050 return;
3051
3052 if (! process_section_p (section))
3053 return;
3054
3055 datasize = bfd_section_size (section);
3056 if (datasize == 0)
3057 return;
3058
3059 if (start_address == (bfd_vma) -1
3060 || start_address < section->vma)
3061 addr_offset = 0;
3062 else
3063 addr_offset = start_address - section->vma;
3064
3065 if (stop_address == (bfd_vma) -1)
3066 stop_offset = datasize / opb;
3067 else
3068 {
3069 if (stop_address < section->vma)
3070 stop_offset = 0;
3071 else
3072 stop_offset = stop_address - section->vma;
3073 if (stop_offset > datasize / opb)
3074 stop_offset = datasize / opb;
3075 }
3076
3077 if (addr_offset >= stop_offset)
3078 return;
3079
3080 /* Decide which set of relocs to use. Load them if necessary. */
3081 paux = (struct objdump_disasm_info *) pinfo->application_data;
3082 if (paux->dynrelbuf && dump_dynamic_reloc_info)
3083 {
3084 rel_pp = paux->dynrelbuf;
3085 rel_count = paux->dynrelcount;
3086 /* Dynamic reloc addresses are absolute, non-dynamic are section
3087 relative. REL_OFFSET specifies the reloc address corresponding
3088 to the start of this section. */
3089 rel_offset = section->vma;
3090 }
3091 else
3092 {
3093 rel_count = 0;
3094 rel_pp = NULL;
3095 rel_offset = 0;
3096
3097 if ((section->flags & SEC_RELOC) != 0
3098 && (dump_reloc_info || pinfo->disassembler_needs_relocs))
3099 {
3100 long relsize;
3101
3102 relsize = bfd_get_reloc_upper_bound (abfd, section);
3103 if (relsize < 0)
3104 bfd_fatal (bfd_get_filename (abfd));
3105
3106 if (relsize > 0)
3107 {
3108 rel_ppstart = rel_pp = (arelent **) xmalloc (relsize);
3109 rel_count = bfd_canonicalize_reloc (abfd, section, rel_pp, syms);
3110 if (rel_count < 0)
3111 bfd_fatal (bfd_get_filename (abfd));
3112
3113 /* Sort the relocs by address. */
3114 qsort (rel_pp, rel_count, sizeof (arelent *), compare_relocs);
3115 }
3116 }
3117 }
3118 rel_ppend = rel_pp + rel_count;
3119
3120 if (!bfd_malloc_and_get_section (abfd, section, &data))
3121 {
3122 non_fatal (_("Reading section %s failed because: %s"),
3123 section->name, bfd_errmsg (bfd_get_error ()));
3124 return;
3125 }
3126
3127 pinfo->buffer = data;
3128 pinfo->buffer_vma = section->vma;
3129 pinfo->buffer_length = datasize;
3130 pinfo->section = section;
3131
3132 /* Sort the symbols into value and section order. */
3133 compare_section = section;
3134 if (sorted_symcount > 1)
3135 qsort (sorted_syms, sorted_symcount, sizeof (asymbol *), compare_symbols);
3136
3137 /* Skip over the relocs belonging to addresses below the
3138 start address. */
3139 while (rel_pp < rel_ppend
3140 && (*rel_pp)->address < rel_offset + addr_offset)
3141 ++rel_pp;
3142
3143 printf (_("\nDisassembly of section %s:\n"), sanitize_string (section->name));
3144
3145 /* Find the nearest symbol forwards from our current position. */
3146 paux->require_sec = TRUE;
3147 sym = (asymbol *) find_symbol_for_address (section->vma + addr_offset,
3148 (struct disassemble_info *) inf,
3149 &place);
3150 paux->require_sec = FALSE;
3151
3152 /* PR 9774: If the target used signed addresses then we must make
3153 sure that we sign extend the value that we calculate for 'addr'
3154 in the loop below. */
3155 if (bfd_get_flavour (abfd) == bfd_target_elf_flavour
3156 && (bed = get_elf_backend_data (abfd)) != NULL
3157 && bed->sign_extend_vma)
3158 sign_adjust = (bfd_vma) 1 << (bed->s->arch_size - 1);
3159
3160 /* Disassemble a block of instructions up to the address associated with
3161 the symbol we have just found. Then print the symbol and find the
3162 next symbol on. Repeat until we have disassembled the entire section
3163 or we have reached the end of the address range we are interested in. */
3164 do_print = paux->symbol == NULL;
3165 loop_until = stop_offset_reached;
3166
3167 while (addr_offset < stop_offset)
3168 {
3169 bfd_vma addr;
3170 asymbol *nextsym;
3171 bfd_vma nextstop_offset;
3172 bfd_boolean insns;
3173
3174 addr = section->vma + addr_offset;
3175 addr = ((addr & ((sign_adjust << 1) - 1)) ^ sign_adjust) - sign_adjust;
3176
3177 if (sym != NULL && bfd_asymbol_value (sym) <= addr)
3178 {
3179 int x;
3180
3181 for (x = place;
3182 (x < sorted_symcount
3183 && (bfd_asymbol_value (sorted_syms[x]) <= addr));
3184 ++x)
3185 continue;
3186
3187 pinfo->symbols = sorted_syms + place;
3188 pinfo->num_symbols = x - place;
3189 pinfo->symtab_pos = place;
3190 }
3191 else
3192 {
3193 pinfo->symbols = NULL;
3194 pinfo->num_symbols = 0;
3195 pinfo->symtab_pos = -1;
3196 }
3197
3198 /* If we are only disassembling from a specific symbol,
3199 check to see if we should start or stop displaying. */
3200 if (sym && paux->symbol)
3201 {
3202 if (do_print)
3203 {
3204 /* See if we should stop printing. */
3205 switch (loop_until)
3206 {
3207 case function_sym:
3208 if (sym->flags & BSF_FUNCTION)
3209 do_print = FALSE;
3210 break;
3211
3212 case stop_offset_reached:
3213 /* Handled by the while loop. */
3214 break;
3215
3216 case next_sym:
3217 /* FIXME: There is an implicit assumption here
3218 that the name of sym is different from
3219 paux->symbol. */
3220 if (! bfd_is_local_label (abfd, sym))
3221 do_print = FALSE;
3222 break;
3223 }
3224 }
3225 else
3226 {
3227 const char * name = bfd_asymbol_name (sym);
3228 char * alloc = NULL;
3229
3230 if (do_demangle && name[0] != '\0')
3231 {
3232 /* Demangle the name. */
3233 alloc = bfd_demangle (abfd, name, demangle_flags);
3234 if (alloc != NULL)
3235 name = alloc;
3236 }
3237
3238 /* We are not currently printing. Check to see
3239 if the current symbol matches the requested symbol. */
3240 if (streq (name, paux->symbol))
3241 {
3242 do_print = TRUE;
3243
3244 if (sym->flags & BSF_FUNCTION)
3245 {
3246 if (bfd_get_flavour (abfd) == bfd_target_elf_flavour
3247 && ((elf_symbol_type *) sym)->internal_elf_sym.st_size > 0)
3248 {
3249 /* Sym is a function symbol with a size associated
3250 with it. Turn on automatic disassembly for the
3251 next VALUE bytes. */
3252 stop_offset = addr_offset
3253 + ((elf_symbol_type *) sym)->internal_elf_sym.st_size;
3254 loop_until = stop_offset_reached;
3255 }
3256 else
3257 {
3258 /* Otherwise we need to tell the loop heuristic to
3259 loop until the next function symbol is encountered. */
3260 loop_until = function_sym;
3261 }
3262 }
3263 else
3264 {
3265 /* Otherwise loop until the next symbol is encountered. */
3266 loop_until = next_sym;
3267 }
3268 }
3269
3270 free (alloc);
3271 }
3272 }
3273
3274 if (! prefix_addresses && do_print)
3275 {
3276 pinfo->fprintf_func (pinfo->stream, "\n");
3277 objdump_print_addr_with_sym (abfd, section, sym, addr,
3278 pinfo, FALSE);
3279 pinfo->fprintf_func (pinfo->stream, ":\n");
3280 }
3281
3282 if (sym != NULL && bfd_asymbol_value (sym) > addr)
3283 nextsym = sym;
3284 else if (sym == NULL)
3285 nextsym = NULL;
3286 else
3287 {
3288 #define is_valid_next_sym(SYM) \
3289 (strcmp (bfd_section_name ((SYM)->section), bfd_section_name (section)) == 0 \
3290 && (bfd_asymbol_value (SYM) > bfd_asymbol_value (sym)) \
3291 && pinfo->symbol_is_valid (SYM, pinfo))
3292
3293 /* Search forward for the next appropriate symbol in
3294 SECTION. Note that all the symbols are sorted
3295 together into one big array, and that some sections
3296 may have overlapping addresses. */
3297 while (place < sorted_symcount
3298 && ! is_valid_next_sym (sorted_syms [place]))
3299 ++place;
3300
3301 if (place >= sorted_symcount)
3302 nextsym = NULL;
3303 else
3304 nextsym = sorted_syms[place];
3305 }
3306
3307 if (sym != NULL && bfd_asymbol_value (sym) > addr)
3308 nextstop_offset = bfd_asymbol_value (sym) - section->vma;
3309 else if (nextsym == NULL)
3310 nextstop_offset = stop_offset;
3311 else
3312 nextstop_offset = bfd_asymbol_value (nextsym) - section->vma;
3313
3314 if (nextstop_offset > stop_offset
3315 || nextstop_offset <= addr_offset)
3316 nextstop_offset = stop_offset;
3317
3318 /* If a symbol is explicitly marked as being an object
3319 rather than a function, just dump the bytes without
3320 disassembling them. */
3321 if (disassemble_all
3322 || sym == NULL
3323 || sym->section != section
3324 || bfd_asymbol_value (sym) > addr
3325 || ((sym->flags & BSF_OBJECT) == 0
3326 && (strstr (bfd_asymbol_name (sym), "gnu_compiled")
3327 == NULL)
3328 && (strstr (bfd_asymbol_name (sym), "gcc2_compiled")
3329 == NULL))
3330 || (sym->flags & BSF_FUNCTION) != 0)
3331 insns = TRUE;
3332 else
3333 insns = FALSE;
3334
3335 if (do_print)
3336 {
3337 /* Resolve symbol name. */
3338 if (visualize_jumps && abfd && sym && sym->name)
3339 {
3340 struct disassemble_info di;
3341 SFILE sf;
3342
3343 sf.alloc = strlen (sym->name) + 40;
3344 sf.buffer = (char*) xmalloc (sf.alloc);
3345 sf.pos = 0;
3346 di.fprintf_func = (fprintf_ftype) objdump_sprintf;
3347 di.stream = &sf;
3348
3349 objdump_print_symname (abfd, &di, sym);
3350
3351 /* Fetch jump information. */
3352 detected_jumps = disassemble_jumps
3353 (pinfo, paux->disassemble_fn,
3354 addr_offset, nextstop_offset,
3355 rel_offset, &rel_pp, rel_ppend);
3356
3357 /* Free symbol name. */
3358 free (sf.buffer);
3359 }
3360
3361 /* Add jumps to output. */
3362 disassemble_bytes (pinfo, paux->disassemble_fn, insns, data,
3363 addr_offset, nextstop_offset,
3364 rel_offset, &rel_pp, rel_ppend);
3365
3366 /* Free jumps. */
3367 while (detected_jumps)
3368 {
3369 detected_jumps = jump_info_free (detected_jumps);
3370 }
3371 }
3372
3373 addr_offset = nextstop_offset;
3374 sym = nextsym;
3375 }
3376
3377 free (data);
3378
3379 if (rel_ppstart != NULL)
3380 free (rel_ppstart);
3381 }
3382
3383 /* Disassemble the contents of an object file. */
3384
3385 static void
3386 disassemble_data (bfd *abfd)
3387 {
3388 struct disassemble_info disasm_info;
3389 struct objdump_disasm_info aux;
3390 long i;
3391
3392 print_files = NULL;
3393 prev_functionname = NULL;
3394 prev_line = -1;
3395 prev_discriminator = 0;
3396
3397 /* We make a copy of syms to sort. We don't want to sort syms
3398 because that will screw up the relocs. */
3399 sorted_symcount = symcount ? symcount : dynsymcount;
3400 sorted_syms = (asymbol **) xmalloc ((sorted_symcount + synthcount)
3401 * sizeof (asymbol *));
3402 if (sorted_symcount != 0)
3403 {
3404 memcpy (sorted_syms, symcount ? syms : dynsyms,
3405 sorted_symcount * sizeof (asymbol *));
3406
3407 sorted_symcount = remove_useless_symbols (sorted_syms, sorted_symcount);
3408 }
3409
3410 for (i = 0; i < synthcount; ++i)
3411 {
3412 sorted_syms[sorted_symcount] = synthsyms + i;
3413 ++sorted_symcount;
3414 }
3415
3416 init_disassemble_info (&disasm_info, stdout, (fprintf_ftype) fprintf);
3417
3418 disasm_info.application_data = (void *) &aux;
3419 aux.abfd = abfd;
3420 aux.require_sec = FALSE;
3421 aux.dynrelbuf = NULL;
3422 aux.dynrelcount = 0;
3423 aux.reloc = NULL;
3424 aux.symbol = disasm_sym;
3425
3426 disasm_info.print_address_func = objdump_print_address;
3427 disasm_info.symbol_at_address_func = objdump_symbol_at_address;
3428
3429 if (machine != NULL)
3430 {
3431 const bfd_arch_info_type *inf = bfd_scan_arch (machine);
3432
3433 if (inf == NULL)
3434 fatal (_("can't use supplied machine %s"), machine);
3435
3436 abfd->arch_info = inf;
3437 }
3438
3439 if (endian != BFD_ENDIAN_UNKNOWN)
3440 {
3441 struct bfd_target *xvec;
3442
3443 xvec = (struct bfd_target *) xmalloc (sizeof (struct bfd_target));
3444 memcpy (xvec, abfd->xvec, sizeof (struct bfd_target));
3445 xvec->byteorder = endian;
3446 abfd->xvec = xvec;
3447 }
3448
3449 /* Use libopcodes to locate a suitable disassembler. */
3450 aux.disassemble_fn = disassembler (bfd_get_arch (abfd),
3451 bfd_big_endian (abfd),
3452 bfd_get_mach (abfd), abfd);
3453 if (!aux.disassemble_fn)
3454 {
3455 non_fatal (_("can't disassemble for architecture %s\n"),
3456 bfd_printable_arch_mach (bfd_get_arch (abfd), 0));
3457 exit_status = 1;
3458 return;
3459 }
3460
3461 disasm_info.flavour = bfd_get_flavour (abfd);
3462 disasm_info.arch = bfd_get_arch (abfd);
3463 disasm_info.mach = bfd_get_mach (abfd);
3464 disasm_info.disassembler_options = disassembler_options;
3465 disasm_info.octets_per_byte = bfd_octets_per_byte (abfd, NULL);
3466 disasm_info.skip_zeroes = DEFAULT_SKIP_ZEROES;
3467 disasm_info.skip_zeroes_at_end = DEFAULT_SKIP_ZEROES_AT_END;
3468 disasm_info.disassembler_needs_relocs = FALSE;
3469
3470 if (bfd_big_endian (abfd))
3471 disasm_info.display_endian = disasm_info.endian = BFD_ENDIAN_BIG;
3472 else if (bfd_little_endian (abfd))
3473 disasm_info.display_endian = disasm_info.endian = BFD_ENDIAN_LITTLE;
3474 else
3475 /* ??? Aborting here seems too drastic. We could default to big or little
3476 instead. */
3477 disasm_info.endian = BFD_ENDIAN_UNKNOWN;
3478
3479 /* Allow the target to customize the info structure. */
3480 disassemble_init_for_target (& disasm_info);
3481
3482 /* Pre-load the dynamic relocs as we may need them during the disassembly. */
3483 {
3484 long relsize = bfd_get_dynamic_reloc_upper_bound (abfd);
3485
3486 if (relsize < 0 && dump_dynamic_reloc_info)
3487 bfd_fatal (bfd_get_filename (abfd));
3488
3489 if (relsize > 0)
3490 {
3491 aux.dynrelbuf = (arelent **) xmalloc (relsize);
3492 aux.dynrelcount = bfd_canonicalize_dynamic_reloc (abfd,
3493 aux.dynrelbuf,
3494 dynsyms);
3495 if (aux.dynrelcount < 0)
3496 bfd_fatal (bfd_get_filename (abfd));
3497
3498 /* Sort the relocs by address. */
3499 qsort (aux.dynrelbuf, aux.dynrelcount, sizeof (arelent *),
3500 compare_relocs);
3501 }
3502 }
3503 disasm_info.symtab = sorted_syms;
3504 disasm_info.symtab_size = sorted_symcount;
3505
3506 bfd_map_over_sections (abfd, disassemble_section, & disasm_info);
3507
3508 if (aux.dynrelbuf != NULL)
3509 free (aux.dynrelbuf);
3510 free (sorted_syms);
3511 disassemble_free_target (&disasm_info);
3512 }
3513 \f
3514 static bfd_boolean
3515 load_specific_debug_section (enum dwarf_section_display_enum debug,
3516 asection *sec, void *file)
3517 {
3518 struct dwarf_section *section = &debug_displays [debug].section;
3519 bfd *abfd = (bfd *) file;
3520 bfd_byte *contents;
3521 bfd_size_type amt;
3522 size_t alloced;
3523
3524 if (section->start != NULL)
3525 {
3526 /* If it is already loaded, do nothing. */
3527 if (streq (section->filename, bfd_get_filename (abfd)))
3528 return TRUE;
3529 free (section->start);
3530 }
3531
3532 section->filename = bfd_get_filename (abfd);
3533 section->reloc_info = NULL;
3534 section->num_relocs = 0;
3535 section->address = bfd_section_vma (sec);
3536 section->user_data = sec;
3537 section->size = bfd_section_size (sec);
3538 /* PR 24360: On 32-bit hosts sizeof (size_t) < sizeof (bfd_size_type). */
3539 alloced = amt = section->size + 1;
3540 if (alloced != amt || alloced == 0)
3541 {
3542 section->start = NULL;
3543 free_debug_section (debug);
3544 printf (_("\nSection '%s' has an invalid size: %#llx.\n"),
3545 sanitize_string (section->name),
3546 (unsigned long long) section->size);
3547 return FALSE;
3548 }
3549 section->start = contents = malloc (alloced);
3550 if (section->start == NULL
3551 || !bfd_get_full_section_contents (abfd, sec, &contents))
3552 {
3553 free_debug_section (debug);
3554 printf (_("\nCan't get contents for section '%s'.\n"),
3555 sanitize_string (section->name));
3556 return FALSE;
3557 }
3558 /* Ensure any string section has a terminating NUL. */
3559 section->start[section->size] = 0;
3560
3561 if ((abfd->flags & (EXEC_P | DYNAMIC)) == 0
3562 && debug_displays [debug].relocate)
3563 {
3564 long reloc_size;
3565 bfd_boolean ret;
3566
3567 bfd_cache_section_contents (sec, section->start);
3568
3569 ret = bfd_simple_get_relocated_section_contents (abfd,
3570 sec,
3571 section->start,
3572 syms) != NULL;
3573
3574 if (! ret)
3575 {
3576 free_debug_section (debug);
3577 printf (_("\nCan't get contents for section '%s'.\n"),
3578 sanitize_string (section->name));
3579 return FALSE;
3580 }
3581
3582 reloc_size = bfd_get_reloc_upper_bound (abfd, sec);
3583 if (reloc_size > 0)
3584 {
3585 unsigned long reloc_count;
3586 arelent **relocs;
3587
3588 relocs = (arelent **) xmalloc (reloc_size);
3589
3590 reloc_count = bfd_canonicalize_reloc (abfd, sec, relocs, NULL);
3591 if (reloc_count == 0)
3592 free (relocs);
3593 else
3594 {
3595 section->reloc_info = relocs;
3596 section->num_relocs = reloc_count;
3597 }
3598 }
3599 }
3600
3601 return TRUE;
3602 }
3603
3604 bfd_boolean
3605 reloc_at (struct dwarf_section * dsec, dwarf_vma offset)
3606 {
3607 arelent ** relocs;
3608 arelent * rp;
3609
3610 if (dsec == NULL || dsec->reloc_info == NULL)
3611 return FALSE;
3612
3613 relocs = (arelent **) dsec->reloc_info;
3614
3615 for (; (rp = * relocs) != NULL; ++ relocs)
3616 if (rp->address == offset)
3617 return TRUE;
3618
3619 return FALSE;
3620 }
3621
3622 bfd_boolean
3623 load_debug_section (enum dwarf_section_display_enum debug, void *file)
3624 {
3625 struct dwarf_section *section = &debug_displays [debug].section;
3626 bfd *abfd = (bfd *) file;
3627 asection *sec;
3628
3629 /* If it is already loaded, do nothing. */
3630 if (section->start != NULL)
3631 {
3632 if (streq (section->filename, bfd_get_filename (abfd)))
3633 return TRUE;
3634 }
3635
3636 /* Locate the debug section. */
3637 sec = bfd_get_section_by_name (abfd, section->uncompressed_name);
3638 if (sec != NULL)
3639 section->name = section->uncompressed_name;
3640 else
3641 {
3642 sec = bfd_get_section_by_name (abfd, section->compressed_name);
3643 if (sec != NULL)
3644 section->name = section->compressed_name;
3645 }
3646 if (sec == NULL)
3647 return FALSE;
3648
3649 return load_specific_debug_section (debug, sec, file);
3650 }
3651
3652 void
3653 free_debug_section (enum dwarf_section_display_enum debug)
3654 {
3655 struct dwarf_section *section = &debug_displays [debug].section;
3656
3657 if (section->start == NULL)
3658 return;
3659
3660 /* PR 17512: file: 0f67f69d. */
3661 if (section->user_data != NULL)
3662 {
3663 asection * sec = (asection *) section->user_data;
3664
3665 /* If we are freeing contents that are also pointed to by the BFD
3666 library's section structure then make sure to update those pointers
3667 too. Otherwise, the next time we try to load data for this section
3668 we can end up using a stale pointer. */
3669 if (section->start == sec->contents)
3670 {
3671 sec->contents = NULL;
3672 sec->flags &= ~ SEC_IN_MEMORY;
3673 sec->compress_status = COMPRESS_SECTION_NONE;
3674 }
3675 }
3676
3677 free ((char *) section->start);
3678 section->start = NULL;
3679 section->address = 0;
3680 section->size = 0;
3681 }
3682
3683 void
3684 close_debug_file (void * file)
3685 {
3686 bfd * abfd = (bfd *) file;
3687
3688 bfd_close (abfd);
3689 }
3690
3691 void *
3692 open_debug_file (const char * pathname)
3693 {
3694 bfd * data;
3695
3696 data = bfd_openr (pathname, NULL);
3697 if (data == NULL)
3698 return NULL;
3699
3700 if (! bfd_check_format (data, bfd_object))
3701 return NULL;
3702
3703 return data;
3704 }
3705
3706 #if HAVE_LIBDEBUGINFOD
3707 /* Return a hex string represention of the build-id. */
3708
3709 unsigned char *
3710 get_build_id (void * data)
3711 {
3712 unsigned i;
3713 char * build_id_str;
3714 bfd * abfd = (bfd *) data;
3715 const struct bfd_build_id * build_id;
3716
3717 build_id = abfd->build_id;
3718 if (build_id == NULL)
3719 return NULL;
3720
3721 build_id_str = malloc (build_id->size * 2 + 1);
3722 if (build_id_str == NULL)
3723 return NULL;
3724
3725 for (i = 0; i < build_id->size; i++)
3726 sprintf (build_id_str + (i * 2), "%02x", build_id->data[i]);
3727 build_id_str[build_id->size * 2] = '\0';
3728
3729 return (unsigned char *)build_id_str;
3730 }
3731 #endif /* HAVE_LIBDEBUGINFOD */
3732
3733 static void
3734 dump_dwarf_section (bfd *abfd, asection *section,
3735 void *arg ATTRIBUTE_UNUSED)
3736 {
3737 const char *name = bfd_section_name (section);
3738 const char *match;
3739 int i;
3740
3741 if (CONST_STRNEQ (name, ".gnu.linkonce.wi."))
3742 match = ".debug_info";
3743 else
3744 match = name;
3745
3746 for (i = 0; i < max; i++)
3747 if ((strcmp (debug_displays [i].section.uncompressed_name, match) == 0
3748 || strcmp (debug_displays [i].section.compressed_name, match) == 0)
3749 && debug_displays [i].enabled != NULL
3750 && *debug_displays [i].enabled)
3751 {
3752 struct dwarf_section *sec = &debug_displays [i].section;
3753
3754 if (strcmp (sec->uncompressed_name, match) == 0)
3755 sec->name = sec->uncompressed_name;
3756 else
3757 sec->name = sec->compressed_name;
3758 if (load_specific_debug_section ((enum dwarf_section_display_enum) i,
3759 section, abfd))
3760 {
3761 debug_displays [i].display (sec, abfd);
3762
3763 if (i != info && i != abbrev)
3764 free_debug_section ((enum dwarf_section_display_enum) i);
3765 }
3766 break;
3767 }
3768 }
3769
3770 /* Dump the dwarf debugging information. */
3771
3772 static void
3773 dump_dwarf (bfd *abfd)
3774 {
3775 /* The byte_get pointer should have been set at the start of dump_bfd(). */
3776 if (byte_get == NULL)
3777 {
3778 warn (_("File %s does not contain any dwarf debug information\n"),
3779 bfd_get_filename (abfd));
3780 return;
3781 }
3782
3783 switch (bfd_get_arch (abfd))
3784 {
3785 case bfd_arch_s12z:
3786 /* S12Z has a 24 bit address space. But the only known
3787 producer of dwarf_info encodes addresses into 32 bits. */
3788 eh_addr_size = 4;
3789 break;
3790
3791 default:
3792 eh_addr_size = bfd_arch_bits_per_address (abfd) / 8;
3793 break;
3794 }
3795
3796 init_dwarf_regnames_by_bfd_arch_and_mach (bfd_get_arch (abfd),
3797 bfd_get_mach (abfd));
3798
3799 bfd_map_over_sections (abfd, dump_dwarf_section, NULL);
3800 }
3801 \f
3802 /* Read ABFD's stabs section STABSECT_NAME, and return a pointer to
3803 it. Return NULL on failure. */
3804
3805 static bfd_byte *
3806 read_section_stabs (bfd *abfd, const char *sect_name, bfd_size_type *size_ptr,
3807 bfd_size_type *entsize_ptr)
3808 {
3809 asection *stabsect;
3810 bfd_byte *contents;
3811
3812 stabsect = bfd_get_section_by_name (abfd, sect_name);
3813 if (stabsect == NULL)
3814 {
3815 printf (_("No %s section present\n\n"),
3816 sanitize_string (sect_name));
3817 return FALSE;
3818 }
3819
3820 if (!bfd_malloc_and_get_section (abfd, stabsect, &contents))
3821 {
3822 non_fatal (_("reading %s section of %s failed: %s"),
3823 sect_name, bfd_get_filename (abfd),
3824 bfd_errmsg (bfd_get_error ()));
3825 exit_status = 1;
3826 free (contents);
3827 return NULL;
3828 }
3829
3830 *size_ptr = bfd_section_size (stabsect);
3831 if (entsize_ptr)
3832 *entsize_ptr = stabsect->entsize;
3833
3834 return contents;
3835 }
3836
3837 /* Stabs entries use a 12 byte format:
3838 4 byte string table index
3839 1 byte stab type
3840 1 byte stab other field
3841 2 byte stab desc field
3842 4 byte stab value
3843 FIXME: This will have to change for a 64 bit object format. */
3844
3845 #define STRDXOFF (0)
3846 #define TYPEOFF (4)
3847 #define OTHEROFF (5)
3848 #define DESCOFF (6)
3849 #define VALOFF (8)
3850 #define STABSIZE (12)
3851
3852 /* Print ABFD's stabs section STABSECT_NAME (in `stabs'),
3853 using string table section STRSECT_NAME (in `strtab'). */
3854
3855 static void
3856 print_section_stabs (bfd *abfd,
3857 const char *stabsect_name,
3858 unsigned *string_offset_ptr)
3859 {
3860 int i;
3861 unsigned file_string_table_offset = 0;
3862 unsigned next_file_string_table_offset = *string_offset_ptr;
3863 bfd_byte *stabp, *stabs_end;
3864
3865 stabp = stabs;
3866 stabs_end = stabp + stab_size;
3867
3868 printf (_("Contents of %s section:\n\n"), sanitize_string (stabsect_name));
3869 printf ("Symnum n_type n_othr n_desc n_value n_strx String\n");
3870
3871 /* Loop through all symbols and print them.
3872
3873 We start the index at -1 because there is a dummy symbol on
3874 the front of stabs-in-{coff,elf} sections that supplies sizes. */
3875 for (i = -1; stabp <= stabs_end - STABSIZE; stabp += STABSIZE, i++)
3876 {
3877 const char *name;
3878 unsigned long strx;
3879 unsigned char type, other;
3880 unsigned short desc;
3881 bfd_vma value;
3882
3883 strx = bfd_h_get_32 (abfd, stabp + STRDXOFF);
3884 type = bfd_h_get_8 (abfd, stabp + TYPEOFF);
3885 other = bfd_h_get_8 (abfd, stabp + OTHEROFF);
3886 desc = bfd_h_get_16 (abfd, stabp + DESCOFF);
3887 value = bfd_h_get_32 (abfd, stabp + VALOFF);
3888
3889 printf ("\n%-6d ", i);
3890 /* Either print the stab name, or, if unnamed, print its number
3891 again (makes consistent formatting for tools like awk). */
3892 name = bfd_get_stab_name (type);
3893 if (name != NULL)
3894 printf ("%-6s", sanitize_string (name));
3895 else if (type == N_UNDF)
3896 printf ("HdrSym");
3897 else
3898 printf ("%-6d", type);
3899 printf (" %-6d %-6d ", other, desc);
3900 bfd_printf_vma (abfd, value);
3901 printf (" %-6lu", strx);
3902
3903 /* Symbols with type == 0 (N_UNDF) specify the length of the
3904 string table associated with this file. We use that info
3905 to know how to relocate the *next* file's string table indices. */
3906 if (type == N_UNDF)
3907 {
3908 file_string_table_offset = next_file_string_table_offset;
3909 next_file_string_table_offset += value;
3910 }
3911 else
3912 {
3913 bfd_size_type amt = strx + file_string_table_offset;
3914
3915 /* Using the (possibly updated) string table offset, print the
3916 string (if any) associated with this symbol. */
3917 if (amt < stabstr_size)
3918 /* PR 17512: file: 079-79389-0.001:0.1.
3919 FIXME: May need to sanitize this string before displaying. */
3920 printf (" %.*s", (int)(stabstr_size - amt), strtab + amt);
3921 else
3922 printf (" *");
3923 }
3924 }
3925 printf ("\n\n");
3926 *string_offset_ptr = next_file_string_table_offset;
3927 }
3928
3929 typedef struct
3930 {
3931 const char * section_name;
3932 const char * string_section_name;
3933 unsigned string_offset;
3934 }
3935 stab_section_names;
3936
3937 static void
3938 find_stabs_section (bfd *abfd, asection *section, void *names)
3939 {
3940 int len;
3941 stab_section_names * sought = (stab_section_names *) names;
3942
3943 /* Check for section names for which stabsect_name is a prefix, to
3944 handle .stab.N, etc. */
3945 len = strlen (sought->section_name);
3946
3947 /* If the prefix matches, and the files section name ends with a
3948 nul or a digit, then we match. I.e., we want either an exact
3949 match or a section followed by a number. */
3950 if (strncmp (sought->section_name, section->name, len) == 0
3951 && (section->name[len] == 0
3952 || (section->name[len] == '.' && ISDIGIT (section->name[len + 1]))))
3953 {
3954 if (strtab == NULL)
3955 strtab = read_section_stabs (abfd, sought->string_section_name,
3956 &stabstr_size, NULL);
3957
3958 if (strtab)
3959 {
3960 stabs = read_section_stabs (abfd, section->name, &stab_size, NULL);
3961 if (stabs)
3962 print_section_stabs (abfd, section->name, &sought->string_offset);
3963 }
3964 }
3965 }
3966
3967 static void
3968 dump_stabs_section (bfd *abfd, char *stabsect_name, char *strsect_name)
3969 {
3970 stab_section_names s;
3971
3972 s.section_name = stabsect_name;
3973 s.string_section_name = strsect_name;
3974 s.string_offset = 0;
3975
3976 bfd_map_over_sections (abfd, find_stabs_section, & s);
3977
3978 free (strtab);
3979 strtab = NULL;
3980 }
3981
3982 /* Dump the any sections containing stabs debugging information. */
3983
3984 static void
3985 dump_stabs (bfd *abfd)
3986 {
3987 dump_stabs_section (abfd, ".stab", ".stabstr");
3988 dump_stabs_section (abfd, ".stab.excl", ".stab.exclstr");
3989 dump_stabs_section (abfd, ".stab.index", ".stab.indexstr");
3990
3991 /* For Darwin. */
3992 dump_stabs_section (abfd, "LC_SYMTAB.stabs", "LC_SYMTAB.stabstr");
3993
3994 dump_stabs_section (abfd, "$GDB_SYMBOLS$", "$GDB_STRINGS$");
3995 }
3996 \f
3997 static void
3998 dump_bfd_header (bfd *abfd)
3999 {
4000 char *comma = "";
4001
4002 printf (_("architecture: %s, "),
4003 bfd_printable_arch_mach (bfd_get_arch (abfd),
4004 bfd_get_mach (abfd)));
4005 printf (_("flags 0x%08x:\n"), abfd->flags & ~BFD_FLAGS_FOR_BFD_USE_MASK);
4006
4007 #define PF(x, y) if (abfd->flags & x) {printf ("%s%s", comma, y); comma=", ";}
4008 PF (HAS_RELOC, "HAS_RELOC");
4009 PF (EXEC_P, "EXEC_P");
4010 PF (HAS_LINENO, "HAS_LINENO");
4011 PF (HAS_DEBUG, "HAS_DEBUG");
4012 PF (HAS_SYMS, "HAS_SYMS");
4013 PF (HAS_LOCALS, "HAS_LOCALS");
4014 PF (DYNAMIC, "DYNAMIC");
4015 PF (WP_TEXT, "WP_TEXT");
4016 PF (D_PAGED, "D_PAGED");
4017 PF (BFD_IS_RELAXABLE, "BFD_IS_RELAXABLE");
4018 printf (_("\nstart address 0x"));
4019 bfd_printf_vma (abfd, abfd->start_address);
4020 printf ("\n");
4021 }
4022 \f
4023
4024 /* Formatting callback function passed to ctf_dump. Returns either the pointer
4025 it is passed, or a pointer to newly-allocated storage, in which case
4026 dump_ctf() will free it when it no longer needs it. */
4027
4028 static char *
4029 dump_ctf_indent_lines (ctf_sect_names_t sect ATTRIBUTE_UNUSED,
4030 char *s, void *arg)
4031 {
4032 const char *blanks = arg;
4033 char *new_s;
4034
4035 if (asprintf (&new_s, "%s%s", blanks, s) < 0)
4036 return s;
4037 return new_s;
4038 }
4039
4040 /* Make a ctfsect suitable for ctf_bfdopen_ctfsect(). */
4041 static ctf_sect_t
4042 make_ctfsect (const char *name, bfd_byte *data,
4043 bfd_size_type size)
4044 {
4045 ctf_sect_t ctfsect;
4046
4047 ctfsect.cts_name = name;
4048 ctfsect.cts_entsize = 1;
4049 ctfsect.cts_size = size;
4050 ctfsect.cts_data = data;
4051
4052 return ctfsect;
4053 }
4054
4055 /* Dump one CTF archive member. */
4056
4057 static int
4058 dump_ctf_archive_member (ctf_file_t *ctf, const char *name, void *arg)
4059 {
4060 ctf_file_t *parent = (ctf_file_t *) arg;
4061 const char *things[] = {"Header", "Labels", "Data objects",
4062 "Function objects", "Variables", "Types", "Strings",
4063 ""};
4064 const char **thing;
4065 size_t i;
4066
4067 /* Only print out the name of non-default-named archive members.
4068 The name .ctf appears everywhere, even for things that aren't
4069 really archives, so printing it out is liable to be confusing.
4070
4071 The parent, if there is one, is the default-owned archive member:
4072 avoid importing it into itself. (This does no harm, but looks
4073 confusing.) */
4074
4075 if (strcmp (name, ".ctf") != 0)
4076 {
4077 printf (_("\nCTF archive member: %s:\n"), sanitize_string (name));
4078 ctf_import (ctf, parent);
4079 }
4080
4081 for (i = 0, thing = things; *thing[0]; thing++, i++)
4082 {
4083 ctf_dump_state_t *s = NULL;
4084 char *item;
4085
4086 printf ("\n %s:\n", *thing);
4087 while ((item = ctf_dump (ctf, &s, i, dump_ctf_indent_lines,
4088 (void *) " ")) != NULL)
4089 {
4090 printf ("%s\n", item);
4091 free (item);
4092 }
4093
4094 if (ctf_errno (ctf))
4095 {
4096 non_fatal (_("Iteration failed: %s, %s\n"), *thing,
4097 ctf_errmsg (ctf_errno (ctf)));
4098 break;
4099 }
4100 }
4101 return 0;
4102 }
4103
4104 /* Dump the CTF debugging information. */
4105
4106 static void
4107 dump_ctf (bfd *abfd, const char *sect_name, const char *parent_name)
4108 {
4109 ctf_archive_t *ctfa, *parenta = NULL, *lookparent;
4110 bfd_byte *ctfdata, *parentdata = NULL;
4111 bfd_size_type ctfsize, parentsize;
4112 ctf_sect_t ctfsect;
4113 ctf_file_t *parent = NULL;
4114 int err;
4115
4116 if ((ctfdata = read_section_stabs (abfd, sect_name, &ctfsize, NULL)) == NULL)
4117 bfd_fatal (bfd_get_filename (abfd));
4118
4119 if (parent_name
4120 && (parentdata = read_section_stabs (abfd, parent_name, &parentsize,
4121 NULL)) == NULL)
4122 bfd_fatal (bfd_get_filename (abfd));
4123
4124 /* Load the CTF file and dump it. */
4125
4126 ctfsect = make_ctfsect (sect_name, ctfdata, ctfsize);
4127 if ((ctfa = ctf_bfdopen_ctfsect (abfd, &ctfsect, &err)) == NULL)
4128 {
4129 non_fatal (_("CTF open failure: %s\n"), ctf_errmsg (err));
4130 bfd_fatal (bfd_get_filename (abfd));
4131 }
4132
4133 if (parentdata)
4134 {
4135 ctfsect = make_ctfsect (parent_name, parentdata, parentsize);
4136 if ((parenta = ctf_bfdopen_ctfsect (abfd, &ctfsect, &err)) == NULL)
4137 {
4138 non_fatal (_("CTF open failure: %s\n"), ctf_errmsg (err));
4139 bfd_fatal (bfd_get_filename (abfd));
4140 }
4141
4142 lookparent = parenta;
4143 }
4144 else
4145 lookparent = ctfa;
4146
4147 /* Assume that the applicable parent archive member is the default one.
4148 (This is what all known implementations are expected to do, if they
4149 put CTFs and their parents in archives together.) */
4150 if ((parent = ctf_arc_open_by_name (lookparent, NULL, &err)) == NULL)
4151 {
4152 non_fatal (_("CTF open failure: %s\n"), ctf_errmsg (err));
4153 bfd_fatal (bfd_get_filename (abfd));
4154 }
4155
4156 printf (_("Contents of CTF section %s:\n"), sanitize_string (sect_name));
4157
4158 ctf_archive_iter (ctfa, dump_ctf_archive_member, parent);
4159 ctf_file_close (parent);
4160 ctf_close (ctfa);
4161 ctf_close (parenta);
4162 free (parentdata);
4163 free (ctfdata);
4164 }
4165
4166 \f
4167 static void
4168 dump_bfd_private_header (bfd *abfd)
4169 {
4170 if (!bfd_print_private_bfd_data (abfd, stdout))
4171 non_fatal (_("warning: private headers incomplete: %s"),
4172 bfd_errmsg (bfd_get_error ()));
4173 }
4174
4175 static void
4176 dump_target_specific (bfd *abfd)
4177 {
4178 const struct objdump_private_desc * const *desc;
4179 struct objdump_private_option *opt;
4180 char *e, *b;
4181
4182 /* Find the desc. */
4183 for (desc = objdump_private_vectors; *desc != NULL; desc++)
4184 if ((*desc)->filter (abfd))
4185 break;
4186
4187 if (*desc == NULL)
4188 {
4189 non_fatal (_("option -P/--private not supported by this file"));
4190 return;
4191 }
4192
4193 /* Clear all options. */
4194 for (opt = (*desc)->options; opt->name; opt++)
4195 opt->selected = FALSE;
4196
4197 /* Decode options. */
4198 b = dump_private_options;
4199 do
4200 {
4201 e = strchr (b, ',');
4202
4203 if (e)
4204 *e = 0;
4205
4206 for (opt = (*desc)->options; opt->name; opt++)
4207 if (strcmp (opt->name, b) == 0)
4208 {
4209 opt->selected = TRUE;
4210 break;
4211 }
4212 if (opt->name == NULL)
4213 non_fatal (_("target specific dump '%s' not supported"), b);
4214
4215 if (e)
4216 {
4217 *e = ',';
4218 b = e + 1;
4219 }
4220 }
4221 while (e != NULL);
4222
4223 /* Dump. */
4224 (*desc)->dump (abfd);
4225 }
4226 \f
4227 /* Display a section in hexadecimal format with associated characters.
4228 Each line prefixed by the zero padded address. */
4229
4230 static void
4231 dump_section (bfd *abfd, asection *section, void *dummy ATTRIBUTE_UNUSED)
4232 {
4233 bfd_byte *data = NULL;
4234 bfd_size_type datasize;
4235 bfd_vma addr_offset;
4236 bfd_vma start_offset;
4237 bfd_vma stop_offset;
4238 unsigned int opb = bfd_octets_per_byte (abfd, section);
4239 /* Bytes per line. */
4240 const int onaline = 16;
4241 char buf[64];
4242 int count;
4243 int width;
4244
4245 if ((section->flags & SEC_HAS_CONTENTS) == 0)
4246 return;
4247
4248 if (! process_section_p (section))
4249 return;
4250
4251 if ((datasize = bfd_section_size (section)) == 0)
4252 return;
4253
4254 /* Compute the address range to display. */
4255 if (start_address == (bfd_vma) -1
4256 || start_address < section->vma)
4257 start_offset = 0;
4258 else
4259 start_offset = start_address - section->vma;
4260
4261 if (stop_address == (bfd_vma) -1)
4262 stop_offset = datasize / opb;
4263 else
4264 {
4265 if (stop_address < section->vma)
4266 stop_offset = 0;
4267 else
4268 stop_offset = stop_address - section->vma;
4269
4270 if (stop_offset > datasize / opb)
4271 stop_offset = datasize / opb;
4272 }
4273
4274 if (start_offset >= stop_offset)
4275 return;
4276
4277 printf (_("Contents of section %s:"), sanitize_string (section->name));
4278 if (display_file_offsets)
4279 printf (_(" (Starting at file offset: 0x%lx)"),
4280 (unsigned long) (section->filepos + start_offset));
4281 printf ("\n");
4282
4283 if (!bfd_get_full_section_contents (abfd, section, &data))
4284 {
4285 non_fatal (_("Reading section %s failed because: %s"),
4286 section->name, bfd_errmsg (bfd_get_error ()));
4287 return;
4288 }
4289
4290 width = 4;
4291
4292 bfd_sprintf_vma (abfd, buf, start_offset + section->vma);
4293 if (strlen (buf) >= sizeof (buf))
4294 abort ();
4295
4296 count = 0;
4297 while (buf[count] == '0' && buf[count+1] != '\0')
4298 count++;
4299 count = strlen (buf) - count;
4300 if (count > width)
4301 width = count;
4302
4303 bfd_sprintf_vma (abfd, buf, stop_offset + section->vma - 1);
4304 if (strlen (buf) >= sizeof (buf))
4305 abort ();
4306
4307 count = 0;
4308 while (buf[count] == '0' && buf[count+1] != '\0')
4309 count++;
4310 count = strlen (buf) - count;
4311 if (count > width)
4312 width = count;
4313
4314 for (addr_offset = start_offset;
4315 addr_offset < stop_offset; addr_offset += onaline / opb)
4316 {
4317 bfd_size_type j;
4318
4319 bfd_sprintf_vma (abfd, buf, (addr_offset + section->vma));
4320 count = strlen (buf);
4321 if ((size_t) count >= sizeof (buf))
4322 abort ();
4323
4324 putchar (' ');
4325 while (count < width)
4326 {
4327 putchar ('0');
4328 count++;
4329 }
4330 fputs (buf + count - width, stdout);
4331 putchar (' ');
4332
4333 for (j = addr_offset * opb;
4334 j < addr_offset * opb + onaline; j++)
4335 {
4336 if (j < stop_offset * opb)
4337 printf ("%02x", (unsigned) (data[j]));
4338 else
4339 printf (" ");
4340 if ((j & 3) == 3)
4341 printf (" ");
4342 }
4343
4344 printf (" ");
4345 for (j = addr_offset * opb;
4346 j < addr_offset * opb + onaline; j++)
4347 {
4348 if (j >= stop_offset * opb)
4349 printf (" ");
4350 else
4351 printf ("%c", ISPRINT (data[j]) ? data[j] : '.');
4352 }
4353 putchar ('\n');
4354 }
4355 free (data);
4356 }
4357
4358 /* Actually display the various requested regions. */
4359
4360 static void
4361 dump_data (bfd *abfd)
4362 {
4363 bfd_map_over_sections (abfd, dump_section, NULL);
4364 }
4365
4366 /* Should perhaps share code and display with nm? */
4367
4368 static void
4369 dump_symbols (bfd *abfd ATTRIBUTE_UNUSED, bfd_boolean dynamic)
4370 {
4371 asymbol **current;
4372 long max_count;
4373 long count;
4374
4375 if (dynamic)
4376 {
4377 current = dynsyms;
4378 max_count = dynsymcount;
4379 printf ("DYNAMIC SYMBOL TABLE:\n");
4380 }
4381 else
4382 {
4383 current = syms;
4384 max_count = symcount;
4385 printf ("SYMBOL TABLE:\n");
4386 }
4387
4388 if (max_count == 0)
4389 printf (_("no symbols\n"));
4390
4391 for (count = 0; count < max_count; count++)
4392 {
4393 bfd *cur_bfd;
4394
4395 if (*current == NULL)
4396 printf (_("no information for symbol number %ld\n"), count);
4397
4398 else if ((cur_bfd = bfd_asymbol_bfd (*current)) == NULL)
4399 printf (_("could not determine the type of symbol number %ld\n"),
4400 count);
4401
4402 else if (process_section_p ((* current)->section)
4403 && (dump_special_syms
4404 || !bfd_is_target_special_symbol (cur_bfd, *current)))
4405 {
4406 const char *name = (*current)->name;
4407
4408 if (do_demangle && name != NULL && *name != '\0')
4409 {
4410 char *alloc;
4411
4412 /* If we want to demangle the name, we demangle it
4413 here, and temporarily clobber it while calling
4414 bfd_print_symbol. FIXME: This is a gross hack. */
4415 alloc = bfd_demangle (cur_bfd, name, demangle_flags);
4416 if (alloc != NULL)
4417 (*current)->name = alloc;
4418 bfd_print_symbol (cur_bfd, stdout, *current,
4419 bfd_print_symbol_all);
4420 if (alloc != NULL)
4421 {
4422 (*current)->name = name;
4423 free (alloc);
4424 }
4425 }
4426 else
4427 bfd_print_symbol (cur_bfd, stdout, *current,
4428 bfd_print_symbol_all);
4429 printf ("\n");
4430 }
4431
4432 current++;
4433 }
4434 printf ("\n\n");
4435 }
4436 \f
4437 static void
4438 dump_reloc_set (bfd *abfd, asection *sec, arelent **relpp, long relcount)
4439 {
4440 arelent **p;
4441 char *last_filename, *last_functionname;
4442 unsigned int last_line;
4443 unsigned int last_discriminator;
4444
4445 /* Get column headers lined up reasonably. */
4446 {
4447 static int width;
4448
4449 if (width == 0)
4450 {
4451 char buf[30];
4452
4453 bfd_sprintf_vma (abfd, buf, (bfd_vma) -1);
4454 width = strlen (buf) - 7;
4455 }
4456 printf ("OFFSET %*s TYPE %*s VALUE \n", width, "", 12, "");
4457 }
4458
4459 last_filename = NULL;
4460 last_functionname = NULL;
4461 last_line = 0;
4462 last_discriminator = 0;
4463
4464 for (p = relpp; relcount && *p != NULL; p++, relcount--)
4465 {
4466 arelent *q = *p;
4467 const char *filename, *functionname;
4468 unsigned int linenumber;
4469 unsigned int discriminator;
4470 const char *sym_name;
4471 const char *section_name;
4472 bfd_vma addend2 = 0;
4473
4474 if (start_address != (bfd_vma) -1
4475 && q->address < start_address)
4476 continue;
4477 if (stop_address != (bfd_vma) -1
4478 && q->address > stop_address)
4479 continue;
4480
4481 if (with_line_numbers
4482 && sec != NULL
4483 && bfd_find_nearest_line_discriminator (abfd, sec, syms, q->address,
4484 &filename, &functionname,
4485 &linenumber, &discriminator))
4486 {
4487 if (functionname != NULL
4488 && (last_functionname == NULL
4489 || strcmp (functionname, last_functionname) != 0))
4490 {
4491 printf ("%s():\n", sanitize_string (functionname));
4492 if (last_functionname != NULL)
4493 free (last_functionname);
4494 last_functionname = xstrdup (functionname);
4495 }
4496
4497 if (linenumber > 0
4498 && (linenumber != last_line
4499 || (filename != NULL
4500 && last_filename != NULL
4501 && filename_cmp (filename, last_filename) != 0)
4502 || (discriminator != last_discriminator)))
4503 {
4504 if (discriminator > 0)
4505 printf ("%s:%u\n", filename == NULL ? "???" :
4506 sanitize_string (filename), linenumber);
4507 else
4508 printf ("%s:%u (discriminator %u)\n",
4509 filename == NULL ? "???" : sanitize_string (filename),
4510 linenumber, discriminator);
4511 last_line = linenumber;
4512 last_discriminator = discriminator;
4513 if (last_filename != NULL)
4514 free (last_filename);
4515 if (filename == NULL)
4516 last_filename = NULL;
4517 else
4518 last_filename = xstrdup (filename);
4519 }
4520 }
4521
4522 if (q->sym_ptr_ptr && *q->sym_ptr_ptr)
4523 {
4524 sym_name = (*(q->sym_ptr_ptr))->name;
4525 section_name = (*(q->sym_ptr_ptr))->section->name;
4526 }
4527 else
4528 {
4529 sym_name = NULL;
4530 section_name = NULL;
4531 }
4532
4533 bfd_printf_vma (abfd, q->address);
4534 if (q->howto == NULL)
4535 printf (" *unknown* ");
4536 else if (q->howto->name)
4537 {
4538 const char *name = q->howto->name;
4539
4540 /* R_SPARC_OLO10 relocations contain two addends.
4541 But because 'arelent' lacks enough storage to
4542 store them both, the 64-bit ELF Sparc backend
4543 records this as two relocations. One R_SPARC_LO10
4544 and one R_SPARC_13, both pointing to the same
4545 address. This is merely so that we have some
4546 place to store both addend fields.
4547
4548 Undo this transformation, otherwise the output
4549 will be confusing. */
4550 if (abfd->xvec->flavour == bfd_target_elf_flavour
4551 && elf_tdata (abfd)->elf_header->e_machine == EM_SPARCV9
4552 && relcount > 1
4553 && !strcmp (q->howto->name, "R_SPARC_LO10"))
4554 {
4555 arelent *q2 = *(p + 1);
4556 if (q2 != NULL
4557 && q2->howto
4558 && q->address == q2->address
4559 && !strcmp (q2->howto->name, "R_SPARC_13"))
4560 {
4561 name = "R_SPARC_OLO10";
4562 addend2 = q2->addend;
4563 p++;
4564 }
4565 }
4566 printf (" %-16s ", name);
4567 }
4568 else
4569 printf (" %-16d ", q->howto->type);
4570
4571 if (sym_name)
4572 {
4573 objdump_print_symname (abfd, NULL, *q->sym_ptr_ptr);
4574 }
4575 else
4576 {
4577 if (section_name == NULL)
4578 section_name = "*unknown*";
4579 printf ("[%s]", sanitize_string (section_name));
4580 }
4581
4582 if (q->addend)
4583 {
4584 bfd_signed_vma addend = q->addend;
4585 if (addend < 0)
4586 {
4587 printf ("-0x");
4588 addend = -addend;
4589 }
4590 else
4591 printf ("+0x");
4592 bfd_printf_vma (abfd, addend);
4593 }
4594 if (addend2)
4595 {
4596 printf ("+0x");
4597 bfd_printf_vma (abfd, addend2);
4598 }
4599
4600 printf ("\n");
4601 }
4602
4603 if (last_filename != NULL)
4604 free (last_filename);
4605 if (last_functionname != NULL)
4606 free (last_functionname);
4607 }
4608
4609 static void
4610 dump_relocs_in_section (bfd *abfd,
4611 asection *section,
4612 void *dummy ATTRIBUTE_UNUSED)
4613 {
4614 arelent **relpp = NULL;
4615 long relcount;
4616 long relsize;
4617
4618 if ( bfd_is_abs_section (section)
4619 || bfd_is_und_section (section)
4620 || bfd_is_com_section (section)
4621 || (! process_section_p (section))
4622 || ((section->flags & SEC_RELOC) == 0))
4623 return;
4624
4625 printf ("RELOCATION RECORDS FOR [%s]:", sanitize_string (section->name));
4626
4627 relsize = bfd_get_reloc_upper_bound (abfd, section);
4628 if (relsize == 0)
4629 {
4630 printf (" (none)\n\n");
4631 return;
4632 }
4633
4634 if (relsize < 0)
4635 relcount = relsize;
4636 else
4637 {
4638 relpp = (arelent **) xmalloc (relsize);
4639 relcount = bfd_canonicalize_reloc (abfd, section, relpp, syms);
4640 }
4641
4642 if (relcount < 0)
4643 {
4644 printf ("\n");
4645 non_fatal (_("failed to read relocs in: %s"),
4646 sanitize_string (bfd_get_filename (abfd)));
4647 bfd_fatal (_("error message was"));
4648 }
4649 else if (relcount == 0)
4650 printf (" (none)\n\n");
4651 else
4652 {
4653 printf ("\n");
4654 dump_reloc_set (abfd, section, relpp, relcount);
4655 printf ("\n\n");
4656 }
4657 free (relpp);
4658 }
4659
4660 static void
4661 dump_relocs (bfd *abfd)
4662 {
4663 bfd_map_over_sections (abfd, dump_relocs_in_section, NULL);
4664 }
4665
4666 static void
4667 dump_dynamic_relocs (bfd *abfd)
4668 {
4669 long relsize;
4670 arelent **relpp;
4671 long relcount;
4672
4673 relsize = bfd_get_dynamic_reloc_upper_bound (abfd);
4674 if (relsize < 0)
4675 bfd_fatal (bfd_get_filename (abfd));
4676
4677 printf ("DYNAMIC RELOCATION RECORDS");
4678
4679 if (relsize == 0)
4680 printf (" (none)\n\n");
4681 else
4682 {
4683 relpp = (arelent **) xmalloc (relsize);
4684 relcount = bfd_canonicalize_dynamic_reloc (abfd, relpp, dynsyms);
4685
4686 if (relcount < 0)
4687 bfd_fatal (bfd_get_filename (abfd));
4688 else if (relcount == 0)
4689 printf (" (none)\n\n");
4690 else
4691 {
4692 printf ("\n");
4693 dump_reloc_set (abfd, NULL, relpp, relcount);
4694 printf ("\n\n");
4695 }
4696 free (relpp);
4697 }
4698 }
4699
4700 /* Creates a table of paths, to search for source files. */
4701
4702 static void
4703 add_include_path (const char *path)
4704 {
4705 if (path[0] == 0)
4706 return;
4707 include_path_count++;
4708 include_paths = (const char **)
4709 xrealloc (include_paths, include_path_count * sizeof (*include_paths));
4710 #ifdef HAVE_DOS_BASED_FILE_SYSTEM
4711 if (path[1] == ':' && path[2] == 0)
4712 path = concat (path, ".", (const char *) 0);
4713 #endif
4714 include_paths[include_path_count - 1] = path;
4715 }
4716
4717 static void
4718 adjust_addresses (bfd *abfd ATTRIBUTE_UNUSED,
4719 asection *section,
4720 void *arg)
4721 {
4722 if ((section->flags & SEC_DEBUGGING) == 0)
4723 {
4724 bfd_boolean *has_reloc_p = (bfd_boolean *) arg;
4725 section->vma += adjust_section_vma;
4726 if (*has_reloc_p)
4727 section->lma += adjust_section_vma;
4728 }
4729 }
4730
4731 /* Return the sign-extended form of an ARCH_SIZE sized VMA. */
4732
4733 static bfd_vma
4734 sign_extend_address (bfd *abfd ATTRIBUTE_UNUSED,
4735 bfd_vma vma,
4736 unsigned arch_size)
4737 {
4738 bfd_vma mask;
4739 mask = (bfd_vma) 1 << (arch_size - 1);
4740 return (((vma & ((mask << 1) - 1)) ^ mask) - mask);
4741 }
4742
4743 /* Dump selected contents of ABFD. */
4744
4745 static void
4746 dump_bfd (bfd *abfd, bfd_boolean is_mainfile)
4747 {
4748 const struct elf_backend_data * bed;
4749
4750 if (bfd_big_endian (abfd))
4751 byte_get = byte_get_big_endian;
4752 else if (bfd_little_endian (abfd))
4753 byte_get = byte_get_little_endian;
4754 else
4755 byte_get = NULL;
4756
4757 /* Load any separate debug information files.
4758 We do this now and without checking do_follow_links because separate
4759 debug info files may contain symbol tables that we will need when
4760 displaying information about the main file. Any memory allocated by
4761 load_separate_debug_files will be released when we call
4762 free_debug_memory below.
4763
4764 The test on is_mainfile is there because the chain of separate debug
4765 info files is a global variable shared by all invocations of dump_bfd. */
4766 if (is_mainfile)
4767 {
4768 load_separate_debug_files (abfd, bfd_get_filename (abfd));
4769
4770 /* If asked to do so, recursively dump the separate files. */
4771 if (do_follow_links)
4772 {
4773 separate_info * i;
4774
4775 for (i = first_separate_info; i != NULL; i = i->next)
4776 dump_bfd (i->handle, FALSE);
4777 }
4778 }
4779
4780 /* Adjust user-specified start and stop limits for targets that use
4781 signed addresses. */
4782 if (bfd_get_flavour (abfd) == bfd_target_elf_flavour
4783 && (bed = get_elf_backend_data (abfd)) != NULL
4784 && bed->sign_extend_vma)
4785 {
4786 start_address = sign_extend_address (abfd, start_address,
4787 bed->s->arch_size);
4788 stop_address = sign_extend_address (abfd, stop_address,
4789 bed->s->arch_size);
4790 }
4791
4792 /* If we are adjusting section VMA's, change them all now. Changing
4793 the BFD information is a hack. However, we must do it, or
4794 bfd_find_nearest_line will not do the right thing. */
4795 if (adjust_section_vma != 0)
4796 {
4797 bfd_boolean has_reloc = (abfd->flags & HAS_RELOC);
4798 bfd_map_over_sections (abfd, adjust_addresses, &has_reloc);
4799 }
4800
4801 if (! dump_debugging_tags && ! suppress_bfd_header)
4802 printf (_("\n%s: file format %s\n"),
4803 sanitize_string (bfd_get_filename (abfd)),
4804 abfd->xvec->name);
4805 if (dump_ar_hdrs)
4806 print_arelt_descr (stdout, abfd, TRUE, FALSE);
4807 if (dump_file_header)
4808 dump_bfd_header (abfd);
4809 if (dump_private_headers)
4810 dump_bfd_private_header (abfd);
4811 if (dump_private_options != NULL)
4812 dump_target_specific (abfd);
4813 if (! dump_debugging_tags && ! suppress_bfd_header)
4814 putchar ('\n');
4815
4816 if (dump_symtab
4817 || dump_reloc_info
4818 || disassemble
4819 || dump_debugging
4820 || dump_dwarf_section_info)
4821 {
4822 syms = slurp_symtab (abfd);
4823
4824 /* If following links, load any symbol tables from the linked files as well. */
4825 if (do_follow_links && is_mainfile)
4826 {
4827 separate_info * i;
4828
4829 for (i = first_separate_info; i != NULL; i = i->next)
4830 {
4831 asymbol ** extra_syms;
4832 long old_symcount = symcount;
4833
4834 extra_syms = slurp_symtab (i->handle);
4835
4836 if (extra_syms)
4837 {
4838 if (old_symcount == 0)
4839 {
4840 syms = extra_syms;
4841 }
4842 else
4843 {
4844 syms = xrealloc (syms, (symcount + old_symcount) * sizeof (asymbol *));
4845 memcpy (syms + old_symcount,
4846 extra_syms,
4847 symcount * sizeof (asymbol *));
4848 }
4849 }
4850
4851 symcount += old_symcount;
4852 }
4853 }
4854 }
4855
4856 if (dump_section_headers)
4857 dump_headers (abfd);
4858
4859 if (dump_dynamic_symtab || dump_dynamic_reloc_info
4860 || (disassemble && bfd_get_dynamic_symtab_upper_bound (abfd) > 0))
4861 dynsyms = slurp_dynamic_symtab (abfd);
4862
4863 if (disassemble)
4864 {
4865 synthcount = bfd_get_synthetic_symtab (abfd, symcount, syms,
4866 dynsymcount, dynsyms, &synthsyms);
4867 if (synthcount < 0)
4868 synthcount = 0;
4869 }
4870
4871 if (dump_symtab)
4872 dump_symbols (abfd, FALSE);
4873 if (dump_dynamic_symtab)
4874 dump_symbols (abfd, TRUE);
4875 if (dump_dwarf_section_info)
4876 dump_dwarf (abfd);
4877 if (dump_ctf_section_info)
4878 dump_ctf (abfd, dump_ctf_section_name, dump_ctf_parent_name);
4879 if (dump_stab_section_info)
4880 dump_stabs (abfd);
4881 if (dump_reloc_info && ! disassemble)
4882 dump_relocs (abfd);
4883 if (dump_dynamic_reloc_info && ! disassemble)
4884 dump_dynamic_relocs (abfd);
4885 if (dump_section_contents)
4886 dump_data (abfd);
4887 if (disassemble)
4888 disassemble_data (abfd);
4889
4890 if (dump_debugging)
4891 {
4892 void *dhandle;
4893
4894 dhandle = read_debugging_info (abfd, syms, symcount, TRUE);
4895 if (dhandle != NULL)
4896 {
4897 if (!print_debugging_info (stdout, dhandle, abfd, syms,
4898 bfd_demangle,
4899 dump_debugging_tags ? TRUE : FALSE))
4900 {
4901 non_fatal (_("%s: printing debugging information failed"),
4902 bfd_get_filename (abfd));
4903 exit_status = 1;
4904 }
4905
4906 free (dhandle);
4907 }
4908 /* PR 6483: If there was no STABS debug info in the file, try
4909 DWARF instead. */
4910 else if (! dump_dwarf_section_info)
4911 {
4912 dwarf_select_sections_all ();
4913 dump_dwarf (abfd);
4914 }
4915 }
4916
4917 if (syms)
4918 {
4919 free (syms);
4920 syms = NULL;
4921 }
4922
4923 if (dynsyms)
4924 {
4925 free (dynsyms);
4926 dynsyms = NULL;
4927 }
4928
4929 if (synthsyms)
4930 {
4931 free (synthsyms);
4932 synthsyms = NULL;
4933 }
4934
4935 symcount = 0;
4936 dynsymcount = 0;
4937 synthcount = 0;
4938
4939 if (is_mainfile)
4940 free_debug_memory ();
4941 }
4942
4943 static void
4944 display_object_bfd (bfd *abfd)
4945 {
4946 char **matching;
4947
4948 if (bfd_check_format_matches (abfd, bfd_object, &matching))
4949 {
4950 dump_bfd (abfd, TRUE);
4951 return;
4952 }
4953
4954 if (bfd_get_error () == bfd_error_file_ambiguously_recognized)
4955 {
4956 nonfatal (bfd_get_filename (abfd));
4957 list_matching_formats (matching);
4958 free (matching);
4959 return;
4960 }
4961
4962 if (bfd_get_error () != bfd_error_file_not_recognized)
4963 {
4964 nonfatal (bfd_get_filename (abfd));
4965 return;
4966 }
4967
4968 if (bfd_check_format_matches (abfd, bfd_core, &matching))
4969 {
4970 dump_bfd (abfd, TRUE);
4971 return;
4972 }
4973
4974 nonfatal (bfd_get_filename (abfd));
4975
4976 if (bfd_get_error () == bfd_error_file_ambiguously_recognized)
4977 {
4978 list_matching_formats (matching);
4979 free (matching);
4980 }
4981 }
4982
4983 static void
4984 display_any_bfd (bfd *file, int level)
4985 {
4986 /* Decompress sections unless dumping the section contents. */
4987 if (!dump_section_contents)
4988 file->flags |= BFD_DECOMPRESS;
4989
4990 /* If the file is an archive, process all of its elements. */
4991 if (bfd_check_format (file, bfd_archive))
4992 {
4993 bfd *arfile = NULL;
4994 bfd *last_arfile = NULL;
4995
4996 if (level == 0)
4997 printf (_("In archive %s:\n"), sanitize_string (bfd_get_filename (file)));
4998 else if (level > 100)
4999 {
5000 /* Prevent corrupted files from spinning us into an
5001 infinite loop. 100 is an arbitrary heuristic. */
5002 fatal (_("Archive nesting is too deep"));
5003 return;
5004 }
5005 else
5006 printf (_("In nested archive %s:\n"),
5007 sanitize_string (bfd_get_filename (file)));
5008
5009 for (;;)
5010 {
5011 bfd_set_error (bfd_error_no_error);
5012
5013 arfile = bfd_openr_next_archived_file (file, arfile);
5014 if (arfile == NULL)
5015 {
5016 if (bfd_get_error () != bfd_error_no_more_archived_files)
5017 nonfatal (bfd_get_filename (file));
5018 break;
5019 }
5020
5021 display_any_bfd (arfile, level + 1);
5022
5023 if (last_arfile != NULL)
5024 {
5025 bfd_close (last_arfile);
5026 /* PR 17512: file: ac585d01. */
5027 if (arfile == last_arfile)
5028 {
5029 last_arfile = NULL;
5030 break;
5031 }
5032 }
5033 last_arfile = arfile;
5034 }
5035
5036 if (last_arfile != NULL)
5037 bfd_close (last_arfile);
5038 }
5039 else
5040 display_object_bfd (file);
5041 }
5042
5043 static void
5044 display_file (char *filename, char *target, bfd_boolean last_file)
5045 {
5046 bfd *file;
5047
5048 if (get_file_size (filename) < 1)
5049 {
5050 exit_status = 1;
5051 return;
5052 }
5053
5054 file = bfd_openr (filename, target);
5055 if (file == NULL)
5056 {
5057 nonfatal (filename);
5058 return;
5059 }
5060
5061 display_any_bfd (file, 0);
5062
5063 /* This is an optimization to improve the speed of objdump, especially when
5064 dumping a file with lots of associated debug informatiom. Calling
5065 bfd_close on such a file can take a non-trivial amount of time as there
5066 are lots of lists to walk and buffers to free. This is only really
5067 necessary however if we are about to load another file and we need the
5068 memory back. Otherwise, if we are about to exit, then we can save (a lot
5069 of) time by only doing a quick close, and allowing the OS to reclaim the
5070 memory for us. */
5071 if (! last_file)
5072 bfd_close (file);
5073 else
5074 bfd_close_all_done (file);
5075 }
5076 \f
5077 int
5078 main (int argc, char **argv)
5079 {
5080 int c;
5081 char *target = default_target;
5082 bfd_boolean seenflag = FALSE;
5083
5084 #if defined (HAVE_SETLOCALE)
5085 #if defined (HAVE_LC_MESSAGES)
5086 setlocale (LC_MESSAGES, "");
5087 #endif
5088 setlocale (LC_CTYPE, "");
5089 #endif
5090
5091 bindtextdomain (PACKAGE, LOCALEDIR);
5092 textdomain (PACKAGE);
5093
5094 program_name = *argv;
5095 xmalloc_set_program_name (program_name);
5096 bfd_set_error_program_name (program_name);
5097
5098 START_PROGRESS (program_name, 0);
5099
5100 expandargv (&argc, &argv);
5101
5102 if (bfd_init () != BFD_INIT_MAGIC)
5103 fatal (_("fatal error: libbfd ABI mismatch"));
5104 set_default_bfd_target ();
5105
5106 while ((c = getopt_long (argc, argv,
5107 "pP:ib:m:M:VvCdDlfFaHhrRtTxsSI:j:wE:zgeGW::",
5108 long_options, (int *) 0))
5109 != EOF)
5110 {
5111 switch (c)
5112 {
5113 case 0:
5114 break; /* We've been given a long option. */
5115 case 'm':
5116 machine = optarg;
5117 break;
5118 case 'M':
5119 {
5120 char *options;
5121 if (disassembler_options)
5122 /* Ignore potential memory leak for now. */
5123 options = concat (disassembler_options, ",",
5124 optarg, (const char *) NULL);
5125 else
5126 options = optarg;
5127 disassembler_options = remove_whitespace_and_extra_commas (options);
5128 }
5129 break;
5130 case 'j':
5131 add_only (optarg);
5132 break;
5133 case 'F':
5134 display_file_offsets = TRUE;
5135 break;
5136 case 'l':
5137 with_line_numbers = TRUE;
5138 break;
5139 case 'b':
5140 target = optarg;
5141 break;
5142 case 'C':
5143 do_demangle = TRUE;
5144 if (optarg != NULL)
5145 {
5146 enum demangling_styles style;
5147
5148 style = cplus_demangle_name_to_style (optarg);
5149 if (style == unknown_demangling)
5150 fatal (_("unknown demangling style `%s'"),
5151 optarg);
5152
5153 cplus_demangle_set_style (style);
5154 }
5155 break;
5156 case OPTION_RECURSE_LIMIT:
5157 demangle_flags &= ~ DMGL_NO_RECURSE_LIMIT;
5158 break;
5159 case OPTION_NO_RECURSE_LIMIT:
5160 demangle_flags |= DMGL_NO_RECURSE_LIMIT;
5161 break;
5162 case 'w':
5163 do_wide = wide_output = TRUE;
5164 break;
5165 case OPTION_ADJUST_VMA:
5166 adjust_section_vma = parse_vma (optarg, "--adjust-vma");
5167 break;
5168 case OPTION_START_ADDRESS:
5169 start_address = parse_vma (optarg, "--start-address");
5170 if ((stop_address != (bfd_vma) -1) && stop_address <= start_address)
5171 fatal (_("error: the start address should be before the end address"));
5172 break;
5173 case OPTION_STOP_ADDRESS:
5174 stop_address = parse_vma (optarg, "--stop-address");
5175 if ((start_address != (bfd_vma) -1) && stop_address <= start_address)
5176 fatal (_("error: the stop address should be after the start address"));
5177 break;
5178 case OPTION_PREFIX:
5179 prefix = optarg;
5180 prefix_length = strlen (prefix);
5181 /* Remove an unnecessary trailing '/' */
5182 while (IS_DIR_SEPARATOR (prefix[prefix_length - 1]))
5183 prefix_length--;
5184 break;
5185 case OPTION_PREFIX_STRIP:
5186 prefix_strip = atoi (optarg);
5187 if (prefix_strip < 0)
5188 fatal (_("error: prefix strip must be non-negative"));
5189 break;
5190 case OPTION_INSN_WIDTH:
5191 insn_width = strtoul (optarg, NULL, 0);
5192 if (insn_width <= 0)
5193 fatal (_("error: instruction width must be positive"));
5194 break;
5195 case OPTION_INLINES:
5196 unwind_inlines = TRUE;
5197 break;
5198 case OPTION_VISUALIZE_JUMPS:
5199 visualize_jumps = TRUE;
5200 color_output = FALSE;
5201 extended_color_output = FALSE;
5202 if (optarg != NULL)
5203 {
5204 if (streq (optarg, "color"))
5205 color_output = TRUE;
5206 else if (streq (optarg, "extended-color"))
5207 {
5208 color_output = TRUE;
5209 extended_color_output = TRUE;
5210 }
5211 else if (streq (optarg, "off"))
5212 visualize_jumps = FALSE;
5213 else
5214 nonfatal (_("unrecognized argument to --visualize-option"));
5215 }
5216 break;
5217 case 'E':
5218 if (strcmp (optarg, "B") == 0)
5219 endian = BFD_ENDIAN_BIG;
5220 else if (strcmp (optarg, "L") == 0)
5221 endian = BFD_ENDIAN_LITTLE;
5222 else
5223 {
5224 nonfatal (_("unrecognized -E option"));
5225 usage (stderr, 1);
5226 }
5227 break;
5228 case OPTION_ENDIAN:
5229 if (strncmp (optarg, "big", strlen (optarg)) == 0)
5230 endian = BFD_ENDIAN_BIG;
5231 else if (strncmp (optarg, "little", strlen (optarg)) == 0)
5232 endian = BFD_ENDIAN_LITTLE;
5233 else
5234 {
5235 non_fatal (_("unrecognized --endian type `%s'"), optarg);
5236 exit_status = 1;
5237 usage (stderr, 1);
5238 }
5239 break;
5240
5241 case 'f':
5242 dump_file_header = TRUE;
5243 seenflag = TRUE;
5244 break;
5245 case 'i':
5246 formats_info = TRUE;
5247 seenflag = TRUE;
5248 break;
5249 case 'I':
5250 add_include_path (optarg);
5251 break;
5252 case 'p':
5253 dump_private_headers = TRUE;
5254 seenflag = TRUE;
5255 break;
5256 case 'P':
5257 dump_private_options = optarg;
5258 seenflag = TRUE;
5259 break;
5260 case 'x':
5261 dump_private_headers = TRUE;
5262 dump_symtab = TRUE;
5263 dump_reloc_info = TRUE;
5264 dump_file_header = TRUE;
5265 dump_ar_hdrs = TRUE;
5266 dump_section_headers = TRUE;
5267 seenflag = TRUE;
5268 break;
5269 case 't':
5270 dump_symtab = TRUE;
5271 seenflag = TRUE;
5272 break;
5273 case 'T':
5274 dump_dynamic_symtab = TRUE;
5275 seenflag = TRUE;
5276 break;
5277 case 'd':
5278 disassemble = TRUE;
5279 seenflag = TRUE;
5280 disasm_sym = optarg;
5281 break;
5282 case 'z':
5283 disassemble_zeroes = TRUE;
5284 break;
5285 case 'D':
5286 disassemble = TRUE;
5287 disassemble_all = TRUE;
5288 seenflag = TRUE;
5289 break;
5290 case 'S':
5291 disassemble = TRUE;
5292 with_source_code = TRUE;
5293 seenflag = TRUE;
5294 break;
5295 case OPTION_SOURCE_COMMENT:
5296 disassemble = TRUE;
5297 with_source_code = TRUE;
5298 seenflag = TRUE;
5299 if (optarg)
5300 source_comment = xstrdup (sanitize_string (optarg));
5301 else
5302 source_comment = xstrdup ("# ");
5303 break;
5304 case 'g':
5305 dump_debugging = 1;
5306 seenflag = TRUE;
5307 break;
5308 case 'e':
5309 dump_debugging = 1;
5310 dump_debugging_tags = 1;
5311 do_demangle = TRUE;
5312 seenflag = TRUE;
5313 break;
5314 case 'W':
5315 dump_dwarf_section_info = TRUE;
5316 seenflag = TRUE;
5317 if (optarg)
5318 dwarf_select_sections_by_letters (optarg);
5319 else
5320 dwarf_select_sections_all ();
5321 break;
5322 case OPTION_DWARF:
5323 dump_dwarf_section_info = TRUE;
5324 seenflag = TRUE;
5325 if (optarg)
5326 dwarf_select_sections_by_names (optarg);
5327 else
5328 dwarf_select_sections_all ();
5329 break;
5330 case OPTION_DWARF_DEPTH:
5331 {
5332 char *cp;
5333 dwarf_cutoff_level = strtoul (optarg, & cp, 0);
5334 }
5335 break;
5336 case OPTION_DWARF_START:
5337 {
5338 char *cp;
5339 dwarf_start_die = strtoul (optarg, & cp, 0);
5340 suppress_bfd_header = 1;
5341 }
5342 break;
5343 case OPTION_DWARF_CHECK:
5344 dwarf_check = TRUE;
5345 break;
5346 case OPTION_CTF:
5347 dump_ctf_section_info = TRUE;
5348 dump_ctf_section_name = xstrdup (optarg);
5349 seenflag = TRUE;
5350 break;
5351 case OPTION_CTF_PARENT:
5352 dump_ctf_parent_name = xstrdup (optarg);
5353 break;
5354 case 'G':
5355 dump_stab_section_info = TRUE;
5356 seenflag = TRUE;
5357 break;
5358 case 's':
5359 dump_section_contents = TRUE;
5360 seenflag = TRUE;
5361 break;
5362 case 'r':
5363 dump_reloc_info = TRUE;
5364 seenflag = TRUE;
5365 break;
5366 case 'R':
5367 dump_dynamic_reloc_info = TRUE;
5368 seenflag = TRUE;
5369 break;
5370 case 'a':
5371 dump_ar_hdrs = TRUE;
5372 seenflag = TRUE;
5373 break;
5374 case 'h':
5375 dump_section_headers = TRUE;
5376 seenflag = TRUE;
5377 break;
5378 case 'v':
5379 case 'V':
5380 show_version = TRUE;
5381 seenflag = TRUE;
5382 break;
5383
5384 case 'H':
5385 usage (stdout, 0);
5386 /* No need to set seenflag or to break - usage() does not return. */
5387 default:
5388 usage (stderr, 1);
5389 }
5390 }
5391
5392 if (show_version)
5393 print_version ("objdump");
5394
5395 if (!seenflag)
5396 usage (stderr, 2);
5397
5398 if (formats_info)
5399 exit_status = display_info ();
5400 else
5401 {
5402 if (optind == argc)
5403 display_file ("a.out", target, TRUE);
5404 else
5405 for (; optind < argc;)
5406 {
5407 display_file (argv[optind], target, optind == argc - 1);
5408 optind++;
5409 }
5410 }
5411
5412 free_only_list ();
5413 free (dump_ctf_section_name);
5414 free (dump_ctf_parent_name);
5415 free ((void *) source_comment);
5416
5417 END_PROGRESS (program_name);
5418
5419 return exit_status;
5420 }
This page took 0.147138 seconds and 4 git commands to generate.