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