* as.c: added new option -ad for hll listings without debug info
[deliverable/binutils-gdb.git] / binutils / objdump.c
1 /* objdump.c -- dump information about an object file.
2 Copyright (C) 1990, 1991 Free Software Foundation, Inc.
3
4 This file is part of BFD, the Binary File Diddler.
5
6 BFD is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
9 any later version.
10
11 BFD is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
15
16 You should have received a copy of the GNU General Public License
17 along with BFD; see the file COPYING. If not, write to
18 the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
19
20 /*
21 $Id$
22 */
23 /*
24 * Until there is other documentation, refer to the manual page dump(1) in
25 * the system 5 program's reference manual
26 */
27
28 #include "bfd.h"
29 #include "sysdep.h"
30 #include "getopt.h"
31 #include <stdio.h>
32 #include <ctype.h>
33
34
35
36 char *xmalloc();
37
38 char *default_target = NULL; /* default at runtime */
39
40 char *program_name = NULL;
41
42 int dump_section_contents; /* -s */
43 int dump_section_headers; /* -h */
44 boolean dump_file_header; /* -f */
45 int dump_symtab; /* -t */
46 int dump_reloc_info; /* -r */
47 int dump_ar_hdrs; /* -a */
48 int with_line_numbers; /* -l */
49 boolean disassemble; /* -d */
50 boolean info; /* -i */
51 char *only;
52
53 PROTO (void, display_file, (char *filename, char *target));
54 PROTO (void, dump_data, (bfd *abfd));
55 PROTO (void, dump_relocs, (bfd *abfd));
56 PROTO (void, dump_symbols, (bfd *abfd));
57 PROTO (void, print_arelt_descr, (bfd *abfd, boolean verbose));
58
59
60
61
62
63
64 \f
65 char *machine = (char *)NULL;
66 asymbol **syms;
67 asymbol **syms2;
68
69
70 unsigned int storage;
71
72 unsigned int symcount = 0;
73
74 void
75 usage ()
76 {
77 fprintf (stderr,
78 "usage: %s [-ahifdrtxsl] [-m machine] [-j section_name] obj ...\n",
79 program_name);
80 exit (1);
81 }
82
83 static struct option long_options[] =
84 {{"syms", 0, &dump_symtab, 1},
85 {"reloc", 0, &dump_reloc_info, 1},
86 {"header", 0, &dump_section_headers, 1},
87 {0, 0, 0, 0}};
88
89
90
91 static void
92 dump_headers(abfd)
93 bfd *abfd;
94 {
95 asection *section;
96 for (section = abfd->sections;
97 section != (asection *) NULL;
98 section = section->next)
99 {
100 char *comma = "";
101 #define PF(x,y) \
102 if (section->flags & x) { printf("%s%s",comma,y); comma = ", "; }
103
104
105 printf("SECTION %d [%s]\t: size %08x",
106 section->index,
107 section->name,
108 (unsigned) bfd_get_section_size_before_reloc(section));
109 printf(" vma ");
110 printf_vma(section->vma);
111 printf(" align 2**%u\n ",
112 section->alignment_power);
113 PF(SEC_ALLOC,"ALLOC");
114 PF(SEC_CONSTRUCTOR,"CONSTRUCTOR");
115 PF(SEC_CONSTRUCTOR_TEXT,"CONSTRUCTOR TEXT");
116 PF(SEC_CONSTRUCTOR_DATA,"CONSTRUCTOR DATA");
117 PF(SEC_CONSTRUCTOR_BSS,"CONSTRUCTOR BSS");
118 PF(SEC_LOAD,"LOAD");
119 PF(SEC_RELOC,"RELOC");
120 PF(SEC_BALIGN,"BALIGN");
121 PF(SEC_READONLY,"READONLY");
122 PF(SEC_CODE,"CODE");
123 PF(SEC_DATA,"DATA");
124 PF(SEC_ROM,"ROM");
125 printf("\n");
126 #undef PF
127 }
128 }
129
130 static asymbol **
131 DEFUN(slurp_symtab,(abfd),
132 bfd *abfd)
133 {
134 asymbol **sy = (asymbol **)NULL;
135
136 if (!(bfd_get_file_flags (abfd) & HAS_SYMS)) {
137 (void) printf ("No symbols in \"%s\".\n", bfd_get_filename (abfd));
138 return(NULL);
139 }
140
141 storage = get_symtab_upper_bound (abfd);
142 if (storage) {
143 sy = (asymbol **) malloc (storage);
144 if (sy == NULL) {
145 fprintf (stderr, "%s: out of memory.\n", program_name);
146 exit (1);
147 }
148 }
149 symcount = bfd_canonicalize_symtab (abfd, sy);
150 return sy;
151 }
152 /* Sort symbols into value order */
153 static int comp(ap,bp)
154 asymbol **ap;
155 asymbol **bp;
156 {
157 asymbol *a = *ap;
158 asymbol *b = *bp;
159 int diff;
160
161 if ( a->name== (char *)NULL || (a->flags &( BSF_DEBUGGING| BSF_UNDEFINED) ))
162 a->the_bfd = 0;
163 if ( b->name== (char *)NULL || (b->flags &( BSF_DEBUGGING|BSF_UNDEFINED)))
164 b->the_bfd =0;
165
166 diff = a->the_bfd - b->the_bfd;
167 if (diff) {
168 return -diff;
169 }
170 diff = a->value - b->value;
171 if (diff) {
172 return diff;
173 }
174 return a->section - b->section;
175 }
176
177 /* Print the supplied address symbolically if possible */
178 void
179 print_address(vma, stream)
180 bfd_vma vma;
181 FILE *stream;
182 {
183 /* Perform a binary search looking for the closest symbol to
184 the required value */
185
186 unsigned int min = 0;
187 unsigned int max = symcount;
188
189 unsigned int thisplace = 1;
190 unsigned int oldthisplace ;
191
192 int vardiff;
193 if (symcount == 0) {
194 fprintf_vma(stream, vma);
195 }
196 else {
197 while (true) {
198 oldthisplace = thisplace;
199 thisplace = (max + min )/2 ;
200 if (thisplace == oldthisplace) break;
201 vardiff = syms[thisplace]->value - vma;
202
203 if (vardiff) {
204 if (vardiff > 0) {
205 max = thisplace;
206 }
207 else {
208 min = thisplace;
209 }
210 }
211 else {
212 /* Totally awesome! the exact right symbol */
213 CONST char *match_name = syms[thisplace]->name;
214 int sym_len = strlen(match_name);
215 /* Avoid "filename.o" as a match */
216 if (sym_len > 2
217 && match_name[sym_len - 2] == '.'
218 && match_name[sym_len - 1] == 'o'
219 && thisplace + 1 < symcount
220 && syms[thisplace+1]->value == vma)
221 match_name = syms[thisplace+1]->name;
222 /* Totally awesome! the exact right symbol */
223 fprintf_vma(stream, vma);
224 fprintf(stream," (%s+)0000", syms[thisplace]->name);
225 return;
226 }
227 }
228 /* We've run out of places to look, print the symbol before this one
229 see if this or the symbol before describes this location the best */
230
231 if (thisplace != 0) {
232 if (syms[thisplace-1]->value - vma >
233 syms[thisplace]->value-vma) {
234 /* Previous symbol is in correct section and is closer */
235 thisplace --;
236 }
237 }
238
239 fprintf_vma(stream, vma);
240 if (syms[thisplace]->value > vma) {
241 fprintf(stream," (%s-)", syms[thisplace]->name);
242 fprintf(stream,"%04x", syms[thisplace]->value - vma);
243
244 }
245 else {
246 fprintf(stream," (%s+)", syms[thisplace]->name);
247 fprintf(stream, "%04x", vma - syms[thisplace]->value);
248
249
250 }
251 }
252 }
253
254 void
255 disassemble_data(abfd)
256 bfd *abfd;
257 {
258 bfd_byte *data = NULL;
259 bfd_arch_info_type *info ;
260 bfd_size_type datasize = 0;
261 bfd_size_type i;
262 unsigned int (*print)() =0;
263 unsigned int print_insn_m68k();
264 unsigned int print_insn_a29k();
265 unsigned int print_insn_i960();
266 unsigned int print_insn_sparc();
267 unsigned int print_insn_h8300();
268 enum bfd_architecture a;
269
270 asection *section;
271 /* Replace symbol section relative values with abs values */
272 boolean done_dot = false;
273
274 for (i = 0; i < symcount; i++) {
275 syms[i]->value += syms[i]->section->vma;
276 }
277
278 /* We keep a copy of the symbols in the original order */
279 syms2 = slurp_symtab(abfd);
280
281 /* Sort the symbols into section and symbol order */
282 (void) qsort(syms, symcount, sizeof(asymbol *), comp);
283
284 /* Find the first useless symbol */
285 { unsigned int i;
286 for (i =0; i < symcount; i++) {
287 if (syms[i]->the_bfd == 0) {
288 symcount =i;
289 break;
290 }
291 }
292 }
293
294
295
296
297 if (machine!= (char *)NULL) {
298 info = bfd_scan_arch(machine);
299 if (info == 0) {
300 fprintf(stderr,"%s: Can't use supplied machine %s\n",
301 program_name,
302 machine);
303 exit(1);
304 }
305 abfd->arch_info = info;
306 }
307
308 /* See if we can disassemble using bfd */
309
310 if(abfd->arch_info->disassemble) {
311 print = abfd->arch_info->disassemble;
312 }
313 else {
314 a = bfd_get_arch(abfd);
315 switch (a) {
316 case bfd_arch_sparc:
317 print = print_insn_sparc;
318 break;
319 case bfd_arch_m68k:
320 print = print_insn_m68k;
321 break;
322 case bfd_arch_a29k:
323 print = print_insn_a29k;
324 break;
325 case bfd_arch_i960:
326 print = print_insn_i960;
327 break;
328 default:
329 fprintf(stderr,"%s: Can't disassemble for architecture %s\n",
330 program_name,
331 bfd_printable_arch_mach(bfd_get_arch(abfd),0));
332 exit(1);
333 }
334
335 }
336
337 for (section = abfd->sections;
338 section != (asection *)NULL;
339 section = section->next) {
340
341 if (only == (char *)NULL || strcmp(only,section->name) == 0){
342 printf("Disassembly of section %s:\n", section->name);
343
344 if (bfd_get_section_size_before_reloc(section) == 0) continue;
345
346 data = (bfd_byte *)malloc(bfd_get_section_size_before_reloc(section));
347
348 if (data == (bfd_byte *)NULL) {
349 fprintf (stderr, "%s: memory exhausted.\n", program_name);
350 exit (1);
351 }
352 datasize = bfd_get_section_size_before_reloc(section);
353
354
355 bfd_get_section_contents (abfd, section, data, 0, bfd_get_section_size_before_reloc(section));
356
357 i = 0;
358 while (i <bfd_get_section_size_before_reloc(section)) {
359 if (data[i] ==0 && data[i+1] == 0 && data[i+2] == 0 &&
360 data[i+3] == 0) {
361 if (done_dot == false) {
362 printf("...\n");
363 done_dot=true;
364 }
365 i+=4;
366 }
367 else {
368 done_dot = false;
369 if (with_line_numbers) {
370 static prevline;
371 CONST char *filename;
372 CONST char *functionname;
373 unsigned int line;
374 bfd_find_nearest_line(abfd,
375 section,
376 syms,
377 section->vma + i,
378 &filename,
379 &functionname,
380 &line);
381
382 if (filename && functionname && line && line != prevline) {
383 printf("%s:%u\n", filename, line);
384 prevline = line;
385 }
386 }
387 print_address(section->vma + i, stdout);
388 printf(" ");
389
390 i += print(section->vma + i,
391 data + i,
392 stdout);
393 putchar ('\n') ;
394 }
395 }
396
397
398
399 free(data);
400 }
401 }
402 }
403
404 void
405 display_bfd (abfd)
406 bfd *abfd;
407 {
408
409 if (!bfd_check_format (abfd, bfd_object)) {
410 fprintf (stderr,"%s: %s not an object file\n", program_name,
411 abfd->filename);
412 return;
413 }
414 printf ("\n%s: file format %s\n", abfd->filename, abfd->xvec->name);
415 if (dump_ar_hdrs) print_arelt_descr (abfd, true);
416
417 if (dump_file_header) {
418 char *comma = "";
419
420 printf("architecture: %s, ",
421 bfd_printable_arch_mach (bfd_get_arch (abfd),
422 bfd_get_mach (abfd)));
423 printf("flags 0x%08x:\n", abfd->flags);
424
425 #define PF(x, y) if (abfd->flags & x) {printf("%s%s", comma, y); comma=", ";}
426 PF(HAS_RELOC, "HAS_RELOC");
427 PF(EXEC_P, "EXEC_P");
428 PF(HAS_LINENO, "HAS_LINENO");
429 PF(HAS_DEBUG, "HAS_DEBUG");
430 PF(HAS_SYMS, "HAS_SYMS");
431 PF(HAS_LOCALS, "HAS_LOCALS");
432 PF(DYNAMIC, "DYNAMIC");
433 PF(WP_TEXT, "WP_TEXT");
434 PF(D_PAGED, "D_PAGED");
435 printf("\nstart address 0x");
436 printf_vma(abfd->start_address);
437 }
438 printf("\n");
439
440 if (dump_section_headers)
441 dump_headers(abfd);
442 if (dump_symtab || dump_reloc_info || disassemble) {
443 syms = slurp_symtab(abfd);
444 }
445 if (dump_symtab) dump_symbols (abfd);
446 if (dump_reloc_info) dump_relocs(abfd);
447 if (dump_section_contents) dump_data (abfd);
448 if (disassemble) disassemble_data(abfd);
449 }
450
451 void
452 display_file (filename, target)
453 char *filename;
454 char *target;
455 {
456 bfd *file, *arfile = (bfd *) NULL;
457
458 file = bfd_openr (filename, target);
459 if (file == NULL) {
460 bfd_perror (filename);
461 return;
462 }
463
464 if (bfd_check_format (file, bfd_archive) == true) {
465 printf ("In archive %s:\n", bfd_get_filename (file));
466 for(;;) {
467 bfd_error = no_error;
468
469 arfile = bfd_openr_next_archived_file (file, arfile);
470 if (arfile == NULL) {
471 if (bfd_error != no_more_archived_files)
472 bfd_perror (bfd_get_filename(file));
473 return;
474 }
475
476 display_bfd (arfile);
477 /* Don't close the archive elements; we need them for next_archive */
478 }
479 }
480 else
481 display_bfd(file);
482
483 bfd_close(file);
484 }
485 \f
486 /* Actually display the various requested regions */
487
488
489
490
491
492
493
494
495
496
497 void
498 dump_data (abfd)
499 bfd *abfd;
500 {
501 asection *section;
502 bfd_byte *data = 0;
503 bfd_size_type datasize = 0;
504 bfd_size_type i;
505
506 for (section = abfd->sections; section != NULL; section =
507 section->next) {
508 int onaline = 16;
509
510 if (only == (char *)NULL ||
511 strcmp(only,section->name) == 0){
512
513
514
515 printf("Contents of section %s:\n", section->name);
516
517 if (bfd_get_section_size_before_reloc(section) == 0) continue;
518 data = (bfd_byte *)malloc(bfd_get_section_size_before_reloc(section));
519 if (data == (bfd_byte *)NULL) {
520 fprintf (stderr, "%s: memory exhausted.\n", program_name);
521 exit (1);
522 }
523 datasize = bfd_get_section_size_before_reloc(section);
524
525
526 bfd_get_section_contents (abfd, section, (PTR)data, 0, bfd_get_section_size_before_reloc(section));
527
528 for (i= 0; i < bfd_get_section_size_before_reloc(section); i += onaline) {
529 bfd_size_type j;
530 printf(" %04lx ", (unsigned long int)(i + section->vma));
531 for (j = i; j < i+ onaline; j++) {
532 if (j < bfd_get_section_size_before_reloc(section))
533 printf("%02x", (unsigned)(data[j]));
534 else
535 printf(" ");
536 if ((j & 3 ) == 3) printf(" ");
537 }
538
539 printf(" ");
540 for (j = i; j < i+onaline ; j++) {
541 if (j >= bfd_get_section_size_before_reloc(section))
542 printf(" ");
543 else
544 printf("%c", isprint(data[j]) ?data[j] : '.');
545 }
546 putchar ('\n');
547 }
548 }
549
550 free (data);
551 }
552 }
553
554
555
556 /* Should perhaps share code and display with nm? */
557 void
558 dump_symbols (abfd)
559 bfd *abfd;
560 {
561
562 unsigned int count;
563 asymbol **current = syms;
564 printf("SYMBOL TABLE:\n");
565
566 for (count = 0; count < symcount; count++) {
567
568 if (*current && (*current)->the_bfd) {
569 bfd_print_symbol((*current)->the_bfd,
570 stdout,
571 *current, bfd_print_symbol_all);
572
573 printf("\n");
574
575 }
576 current++;
577 }
578 printf("\n");
579 printf("\n");
580 }
581
582
583 void
584 dump_relocs(abfd)
585 bfd *abfd;
586 {
587 arelent **relpp;
588 unsigned int relcount;
589 asection *a;
590 for (a = abfd->sections; a != (asection *)NULL; a = a->next) {
591 if (a == &bfd_abs_section) continue;
592 if (a == &bfd_und_section) continue;
593 if (a == &bfd_com_section) continue;
594
595 printf("RELOCATION RECORDS FOR [%s]:",a->name);
596
597 if (bfd_get_reloc_upper_bound(abfd, a) == 0) {
598 printf(" (none)\n\n");
599 }
600 else {
601 arelent **p;
602
603 relpp = (arelent **) xmalloc( bfd_get_reloc_upper_bound(abfd,a) );
604 relcount = bfd_canonicalize_reloc(abfd,a,relpp, syms);
605 if (relcount == 0) {
606 printf(" (none)\n\n");
607 }
608 else {
609 printf("\n");
610 printf("OFFSET TYPE VALUE \n");
611
612 for (p =relpp; relcount && *p != (arelent *)NULL; p++,
613 relcount --) {
614 arelent *q = *p;
615 CONST char *sym_name;
616 /* CONST char *section_name = q->section == (asection *)NULL ? "*abs" :*/
617 /* q->section->name;*/
618 CONST char *section_name = (*( q->sym_ptr_ptr))->section->name;
619
620 if (q->sym_ptr_ptr && *q->sym_ptr_ptr) {
621 sym_name = (*(q->sym_ptr_ptr))->name ;
622 }
623 else {
624 sym_name = 0;
625 }
626 if (sym_name) {
627 printf_vma(q->address);
628 printf(" %-8s %s",
629 q->howto->name,
630 sym_name);
631 }
632 else {
633 printf_vma(q->address);
634 printf(" %-8s [%s]",
635 q->howto->name,
636 section_name);
637 }
638 if (q->addend) {
639 printf("+0x");
640 printf_vma(q->addend);
641 }
642 printf("\n");
643 }
644 printf("\n\n");
645 free(relpp);
646 }
647 }
648
649 }
650 }
651
652 static void
653 DEFUN_VOID(display_info)
654 {
655 unsigned int i, j;
656 extern bfd_target *target_vector[];
657
658 printf("BFD header file version %s\n", BFD_VERSION);
659 for (i = 0; target_vector[i] != (bfd_target *)NULL; i++)
660 {
661 bfd_target *p = target_vector[i];
662 bfd *abfd = bfd_openw("##dummy",p->name);
663 printf("%s\n (header %s, data %s)\n", p->name,
664 p->header_byteorder_big_p ? "big endian" : "little endian",
665 p->byteorder_big_p ? "big endian" : "little endian" );
666 {
667 for (j = (int)bfd_arch_obscure +1; j < (int)bfd_arch_last; j++)
668 {
669
670 if (bfd_set_arch_mach(abfd, (enum bfd_architecture)j, 0))
671 printf(" %s\n",
672 bfd_printable_arch_mach((enum bfd_architecture)j,0));
673
674 }
675
676 }
677 }
678 /* Again as a table */
679 printf("%12s"," ");
680 for (i = 0; target_vector[i]; i++) {
681 printf("%s ",target_vector[i]->name);
682 }
683 printf("\n");
684
685
686 for (j = (int)bfd_arch_obscure +1; (int)j <(int) bfd_arch_last; j++)
687 {
688 if (strcmp(bfd_printable_arch_mach(j,0),"UNKNOWN!") != 0) {
689 printf("%11s ", bfd_printable_arch_mach(j,0));
690 for (i = 0; target_vector[i]; i++) {
691 {
692 bfd_target *p = target_vector[i];
693 bfd *abfd = bfd_openw("##dummy",p->name);
694 int l = strlen(p->name);
695 int ok = bfd_set_arch_mach(abfd, j, 0);
696 if (ok) {
697 printf("%s ", p->name);
698 }
699 else {
700 while (l--) {
701 printf("%c",ok?'*':'-');
702 }
703 printf(" ");
704 }
705
706 }
707
708 }
709 printf("\n");
710 }
711 }
712 }
713 /** main and like trivia */
714 int
715 main (argc, argv)
716 int argc;
717 char **argv;
718 {
719 int c;
720 extern int optind;
721 extern char *optarg;
722 char *target = default_target;
723 boolean seenflag = false;
724 int ind = 0;
725
726 bfd_init();
727 program_name = *argv;
728
729 while ((c = getopt_long (argc, argv, "ib:m:dlfahrtxsj:", long_options, &ind))
730 != EOF) {
731 seenflag = true;
732 switch (c) {
733 case 'm':
734 machine = optarg;
735 break;
736 case 'j':
737 only = optarg;
738 break;
739 case 'l':
740 with_line_numbers = 1;
741 break;
742 case 'b':
743 target = optarg;
744 break;
745 case 'f':
746 dump_file_header = true;
747 break;
748 case 'i':
749 info = true;
750 break;
751 case 'x':
752 dump_symtab = 1;
753 dump_reloc_info = 1;
754 dump_file_header = true;
755 dump_ar_hdrs = 1;
756 dump_section_headers = 1;
757 break;
758 case 0 : break; /* we've been given a long option */
759 case 't': dump_symtab = 1; break;
760 case 'd': disassemble = true ; break;
761 case 's': dump_section_contents = 1; break;
762 case 'r': dump_reloc_info = 1; break;
763 case 'a': dump_ar_hdrs = 1; break;
764 case 'h': dump_section_headers = 1; break;
765 default:
766 usage ();
767 }
768 }
769
770 if (seenflag == false)
771 usage ();
772
773 if (info) {
774 display_info();
775 }
776 else {
777 if (optind == argc)
778 display_file ("a.out", target);
779 else
780 for (; optind < argc;)
781 display_file (argv[optind++], target);
782 }
783 return 0;
784 }
This page took 0.048638 seconds and 4 git commands to generate.