| /* ELF executable support for BFD. |
| Copyright 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001 |
| Free Software Foundation, Inc. |
| |
| This file is part of BFD, the Binary File Descriptor library. |
| |
| This program is free software; you can redistribute it and/or modify |
| it under the terms of the GNU General Public License as published by |
| the Free Software Foundation; either version 2 of the License, or |
| (at your option) any later version. |
| |
| This program is distributed in the hope that it will be useful, |
| but WITHOUT ANY WARRANTY; without even the implied warranty of |
| MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| GNU General Public License for more details. |
| |
| You should have received a copy of the GNU General Public License |
| along with this program; if not, write to the Free Software |
| Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ |
| |
| /* |
| |
| SECTION |
| ELF backends |
| |
| BFD support for ELF formats is being worked on. |
| Currently, the best supported back ends are for sparc and i386 |
| (running svr4 or Solaris 2). |
| |
| Documentation of the internals of the support code still needs |
| to be written. The code is changing quickly enough that we |
| haven't bothered yet. |
| */ |
| |
| /* For sparc64-cross-sparc32. */ |
| #define _SYSCALL32 |
| #include "bfd.h" |
| #include "sysdep.h" |
| #include "bfdlink.h" |
| #include "libbfd.h" |
| #define ARCH_SIZE 0 |
| #include "elf-bfd.h" |
| |
| static INLINE struct elf_segment_map *make_mapping |
| PARAMS ((bfd *, asection **, unsigned int, unsigned int, boolean)); |
| static boolean map_sections_to_segments PARAMS ((bfd *)); |
| static int elf_sort_sections PARAMS ((const PTR, const PTR)); |
| static boolean assign_file_positions_for_segments PARAMS ((bfd *)); |
| static boolean assign_file_positions_except_relocs PARAMS ((bfd *)); |
| static boolean prep_headers PARAMS ((bfd *)); |
| static boolean swap_out_syms PARAMS ((bfd *, struct bfd_strtab_hash **, int)); |
| static boolean copy_private_bfd_data PARAMS ((bfd *, bfd *)); |
| static char *elf_read PARAMS ((bfd *, long, unsigned int)); |
| static void elf_fake_sections PARAMS ((bfd *, asection *, PTR)); |
| static boolean assign_section_numbers PARAMS ((bfd *)); |
| static INLINE int sym_is_global PARAMS ((bfd *, asymbol *)); |
| static boolean elf_map_symbols PARAMS ((bfd *)); |
| static bfd_size_type get_program_header_size PARAMS ((bfd *)); |
| static boolean elfcore_read_notes PARAMS ((bfd *, bfd_vma, bfd_vma)); |
| static boolean elf_find_function PARAMS ((bfd *, asection *, |
| asymbol **, |
| bfd_vma, const char **, |
| const char **)); |
| |
| /* Swap version information in and out. The version information is |
| currently size independent. If that ever changes, this code will |
| need to move into elfcode.h. */ |
| |
| /* Swap in a Verdef structure. */ |
| |
| void |
| _bfd_elf_swap_verdef_in (abfd, src, dst) |
| bfd *abfd; |
| const Elf_External_Verdef *src; |
| Elf_Internal_Verdef *dst; |
| { |
| dst->vd_version = bfd_h_get_16 (abfd, src->vd_version); |
| dst->vd_flags = bfd_h_get_16 (abfd, src->vd_flags); |
| dst->vd_ndx = bfd_h_get_16 (abfd, src->vd_ndx); |
| dst->vd_cnt = bfd_h_get_16 (abfd, src->vd_cnt); |
| dst->vd_hash = bfd_h_get_32 (abfd, src->vd_hash); |
| dst->vd_aux = bfd_h_get_32 (abfd, src->vd_aux); |
| dst->vd_next = bfd_h_get_32 (abfd, src->vd_next); |
| } |
| |
| /* Swap out a Verdef structure. */ |
| |
| void |
| _bfd_elf_swap_verdef_out (abfd, src, dst) |
| bfd *abfd; |
| const Elf_Internal_Verdef *src; |
| Elf_External_Verdef *dst; |
| { |
| bfd_h_put_16 (abfd, src->vd_version, dst->vd_version); |
| bfd_h_put_16 (abfd, src->vd_flags, dst->vd_flags); |
| bfd_h_put_16 (abfd, src->vd_ndx, dst->vd_ndx); |
| bfd_h_put_16 (abfd, src->vd_cnt, dst->vd_cnt); |
| bfd_h_put_32 (abfd, src->vd_hash, dst->vd_hash); |
| bfd_h_put_32 (abfd, src->vd_aux, dst->vd_aux); |
| bfd_h_put_32 (abfd, src->vd_next, dst->vd_next); |
| } |
| |
| /* Swap in a Verdaux structure. */ |
| |
| void |
| _bfd_elf_swap_verdaux_in (abfd, src, dst) |
| bfd *abfd; |
| const Elf_External_Verdaux *src; |
| Elf_Internal_Verdaux *dst; |
| { |
| dst->vda_name = bfd_h_get_32 (abfd, src->vda_name); |
| dst->vda_next = bfd_h_get_32 (abfd, src->vda_next); |
| } |
| |
| /* Swap out a Verdaux structure. */ |
| |
| void |
| _bfd_elf_swap_verdaux_out (abfd, src, dst) |
| bfd *abfd; |
| const Elf_Internal_Verdaux *src; |
| Elf_External_Verdaux *dst; |
| { |
| bfd_h_put_32 (abfd, src->vda_name, dst->vda_name); |
| bfd_h_put_32 (abfd, src->vda_next, dst->vda_next); |
| } |
| |
| /* Swap in a Verneed structure. */ |
| |
| void |
| _bfd_elf_swap_verneed_in (abfd, src, dst) |
| bfd *abfd; |
| const Elf_External_Verneed *src; |
| Elf_Internal_Verneed *dst; |
| { |
| dst->vn_version = bfd_h_get_16 (abfd, src->vn_version); |
| dst->vn_cnt = bfd_h_get_16 (abfd, src->vn_cnt); |
| dst->vn_file = bfd_h_get_32 (abfd, src->vn_file); |
| dst->vn_aux = bfd_h_get_32 (abfd, src->vn_aux); |
| dst->vn_next = bfd_h_get_32 (abfd, src->vn_next); |
| } |
| |
| /* Swap out a Verneed structure. */ |
| |
| void |
| _bfd_elf_swap_verneed_out (abfd, src, dst) |
| bfd *abfd; |
| const Elf_Internal_Verneed *src; |
| Elf_External_Verneed *dst; |
| { |
| bfd_h_put_16 (abfd, src->vn_version, dst->vn_version); |
| bfd_h_put_16 (abfd, src->vn_cnt, dst->vn_cnt); |
| bfd_h_put_32 (abfd, src->vn_file, dst->vn_file); |
| bfd_h_put_32 (abfd, src->vn_aux, dst->vn_aux); |
| bfd_h_put_32 (abfd, src->vn_next, dst->vn_next); |
| } |
| |
| /* Swap in a Vernaux structure. */ |
| |
| void |
| _bfd_elf_swap_vernaux_in (abfd, src, dst) |
| bfd *abfd; |
| const Elf_External_Vernaux *src; |
| Elf_Internal_Vernaux *dst; |
| { |
| dst->vna_hash = bfd_h_get_32 (abfd, src->vna_hash); |
| dst->vna_flags = bfd_h_get_16 (abfd, src->vna_flags); |
| dst->vna_other = bfd_h_get_16 (abfd, src->vna_other); |
| dst->vna_name = bfd_h_get_32 (abfd, src->vna_name); |
| dst->vna_next = bfd_h_get_32 (abfd, src->vna_next); |
| } |
| |
| /* Swap out a Vernaux structure. */ |
| |
| void |
| _bfd_elf_swap_vernaux_out (abfd, src, dst) |
| bfd *abfd; |
| const Elf_Internal_Vernaux *src; |
| Elf_External_Vernaux *dst; |
| { |
| bfd_h_put_32 (abfd, src->vna_hash, dst->vna_hash); |
| bfd_h_put_16 (abfd, src->vna_flags, dst->vna_flags); |
| bfd_h_put_16 (abfd, src->vna_other, dst->vna_other); |
| bfd_h_put_32 (abfd, src->vna_name, dst->vna_name); |
| bfd_h_put_32 (abfd, src->vna_next, dst->vna_next); |
| } |
| |
| /* Swap in a Versym structure. */ |
| |
| void |
| _bfd_elf_swap_versym_in (abfd, src, dst) |
| bfd *abfd; |
| const Elf_External_Versym *src; |
| Elf_Internal_Versym *dst; |
| { |
| dst->vs_vers = bfd_h_get_16 (abfd, src->vs_vers); |
| } |
| |
| /* Swap out a Versym structure. */ |
| |
| void |
| _bfd_elf_swap_versym_out (abfd, src, dst) |
| bfd *abfd; |
| const Elf_Internal_Versym *src; |
| Elf_External_Versym *dst; |
| { |
| bfd_h_put_16 (abfd, src->vs_vers, dst->vs_vers); |
| } |
| |
| /* Standard ELF hash function. Do not change this function; you will |
| cause invalid hash tables to be generated. */ |
| |
| unsigned long |
| bfd_elf_hash (namearg) |
| const char *namearg; |
| { |
| const unsigned char *name = (const unsigned char *) namearg; |
| unsigned long h = 0; |
| unsigned long g; |
| int ch; |
| |
| while ((ch = *name++) != '\0') |
| { |
| h = (h << 4) + ch; |
| if ((g = (h & 0xf0000000)) != 0) |
| { |
| h ^= g >> 24; |
| /* The ELF ABI says `h &= ~g', but this is equivalent in |
| this case and on some machines one insn instead of two. */ |
| h ^= g; |
| } |
| } |
| return h; |
| } |
| |
| /* Read a specified number of bytes at a specified offset in an ELF |
| file, into a newly allocated buffer, and return a pointer to the |
| buffer. */ |
| |
| static char * |
| elf_read (abfd, offset, size) |
| bfd *abfd; |
| long offset; |
| unsigned int size; |
| { |
| char *buf; |
| |
| if ((buf = bfd_alloc (abfd, size)) == NULL) |
| return NULL; |
| if (bfd_seek (abfd, offset, SEEK_SET) == -1) |
| return NULL; |
| if (bfd_read ((PTR) buf, size, 1, abfd) != size) |
| { |
| if (bfd_get_error () != bfd_error_system_call) |
| bfd_set_error (bfd_error_file_truncated); |
| return NULL; |
| } |
| return buf; |
| } |
| |
| boolean |
| bfd_elf_mkobject (abfd) |
| bfd *abfd; |
| { |
| /* This just does initialization. */ |
| /* coff_mkobject zalloc's space for tdata.coff_obj_data ... */ |
| elf_tdata (abfd) = (struct elf_obj_tdata *) |
| bfd_zalloc (abfd, sizeof (struct elf_obj_tdata)); |
| if (elf_tdata (abfd) == 0) |
| return false; |
| /* Since everything is done at close time, do we need any |
| initialization? */ |
| |
| return true; |
| } |
| |
| boolean |
| bfd_elf_mkcorefile (abfd) |
| bfd *abfd; |
| { |
| /* I think this can be done just like an object file. */ |
| return bfd_elf_mkobject (abfd); |
| } |
| |
| char * |
| bfd_elf_get_str_section (abfd, shindex) |
| bfd *abfd; |
| unsigned int shindex; |
| { |
| Elf_Internal_Shdr **i_shdrp; |
| char *shstrtab = NULL; |
| unsigned int offset; |
| unsigned int shstrtabsize; |
| |
| i_shdrp = elf_elfsections (abfd); |
| if (i_shdrp == 0 || i_shdrp[shindex] == 0) |
| return 0; |
| |
| shstrtab = (char *) i_shdrp[shindex]->contents; |
| if (shstrtab == NULL) |
| { |
| /* No cached one, attempt to read, and cache what we read. */ |
| offset = i_shdrp[shindex]->sh_offset; |
| shstrtabsize = i_shdrp[shindex]->sh_size; |
| shstrtab = elf_read (abfd, offset, shstrtabsize); |
| i_shdrp[shindex]->contents = (PTR) shstrtab; |
| } |
| return shstrtab; |
| } |
| |
| char * |
| bfd_elf_string_from_elf_section (abfd, shindex, strindex) |
| bfd *abfd; |
| unsigned int shindex; |
| unsigned int strindex; |
| { |
| Elf_Internal_Shdr *hdr; |
| |
| if (strindex == 0) |
| return ""; |
| |
| hdr = elf_elfsections (abfd)[shindex]; |
| |
| if (hdr->contents == NULL |
| && bfd_elf_get_str_section (abfd, shindex) == NULL) |
| return NULL; |
| |
| if (strindex >= hdr->sh_size) |
| { |
| (*_bfd_error_handler) |
| (_("%s: invalid string offset %u >= %lu for section `%s'"), |
| bfd_get_filename (abfd), strindex, (unsigned long) hdr->sh_size, |
| ((shindex == elf_elfheader(abfd)->e_shstrndx |
| && strindex == hdr->sh_name) |
| ? ".shstrtab" |
| : elf_string_from_elf_strtab (abfd, hdr->sh_name))); |
| return ""; |
| } |
| |
| return ((char *) hdr->contents) + strindex; |
| } |
| |
| /* Make a BFD section from an ELF section. We store a pointer to the |
| BFD section in the bfd_section field of the header. */ |
| |
| boolean |
| _bfd_elf_make_section_from_shdr (abfd, hdr, name) |
| bfd *abfd; |
| Elf_Internal_Shdr *hdr; |
| const char *name; |
| { |
| asection *newsect; |
| flagword flags; |
| struct elf_backend_data *bed; |
| |
| if (hdr->bfd_section != NULL) |
| { |
| BFD_ASSERT (strcmp (name, |
| bfd_get_section_name (abfd, hdr->bfd_section)) == 0); |
| return true; |
| } |
| |
| newsect = bfd_make_section_anyway (abfd, name); |
| if (newsect == NULL) |
| return false; |
| |
| newsect->filepos = hdr->sh_offset; |
| |
| if (! bfd_set_section_vma (abfd, newsect, hdr->sh_addr) |
| || ! bfd_set_section_size (abfd, newsect, hdr->sh_size) |
| || ! bfd_set_section_alignment (abfd, newsect, |
| bfd_log2 (hdr->sh_addralign))) |
| return false; |
| |
| flags = SEC_NO_FLAGS; |
| if (hdr->sh_type != SHT_NOBITS) |
| flags |= SEC_HAS_CONTENTS; |
| if ((hdr->sh_flags & SHF_ALLOC) != 0) |
| { |
| flags |= SEC_ALLOC; |
| if (hdr->sh_type != SHT_NOBITS) |
| flags |= SEC_LOAD; |
| } |
| if ((hdr->sh_flags & SHF_WRITE) == 0) |
| flags |= SEC_READONLY; |
| if ((hdr->sh_flags & SHF_EXECINSTR) != 0) |
| flags |= SEC_CODE; |
| else if ((flags & SEC_LOAD) != 0) |
| flags |= SEC_DATA; |
| |
| /* The debugging sections appear to be recognized only by name, not |
| any sort of flag. */ |
| { |
| static const char *debug_sec_names [] = |
| { |
| ".debug", |
| ".gnu.linkonce.wi.", |
| ".line", |
| ".stab" |
| }; |
| int i; |
| |
| for (i = sizeof (debug_sec_names) / sizeof (debug_sec_names[0]); i--;) |
| if (strncmp (name, debug_sec_names[i], strlen (debug_sec_names[i])) == 0) |
| break; |
| |
| if (i >= 0) |
| flags |= SEC_DEBUGGING; |
| } |
| |
| /* As a GNU extension, if the name begins with .gnu.linkonce, we |
| only link a single copy of the section. This is used to support |
| g++. g++ will emit each template expansion in its own section. |
| The symbols will be defined as weak, so that multiple definitions |
| are permitted. The GNU linker extension is to actually discard |
| all but one of the sections. */ |
| if (strncmp (name, ".gnu.linkonce", sizeof ".gnu.linkonce" - 1) == 0) |
| flags |= SEC_LINK_ONCE | SEC_LINK_DUPLICATES_DISCARD; |
| |
| bed = get_elf_backend_data (abfd); |
| if (bed->elf_backend_section_flags) |
| if (! bed->elf_backend_section_flags (&flags, hdr)) |
| return false; |
| |
| if (! bfd_set_section_flags (abfd, newsect, flags)) |
| return false; |
| |
| if ((flags & SEC_ALLOC) != 0) |
| { |
| Elf_Internal_Phdr *phdr; |
| unsigned int i; |
| |
| /* Look through the phdrs to see if we need to adjust the lma. |
| If all the p_paddr fields are zero, we ignore them, since |
| some ELF linkers produce such output. */ |
| phdr = elf_tdata (abfd)->phdr; |
| for (i = 0; i < elf_elfheader (abfd)->e_phnum; i++, phdr++) |
| { |
| if (phdr->p_paddr != 0) |
| break; |
| } |
| if (i < elf_elfheader (abfd)->e_phnum) |
| { |
| phdr = elf_tdata (abfd)->phdr; |
| for (i = 0; i < elf_elfheader (abfd)->e_phnum; i++, phdr++) |
| { |
| if (phdr->p_type == PT_LOAD |
| && phdr->p_vaddr != phdr->p_paddr |
| && phdr->p_vaddr <= hdr->sh_addr |
| && (phdr->p_vaddr + phdr->p_memsz |
| >= hdr->sh_addr + hdr->sh_size) |
| && ((flags & SEC_LOAD) == 0 |
| || (phdr->p_offset <= (bfd_vma) hdr->sh_offset |
| && (phdr->p_offset + phdr->p_filesz |
| >= hdr->sh_offset + hdr->sh_size)))) |
| { |
| newsect->lma += phdr->p_paddr - phdr->p_vaddr; |
| break; |
| } |
| } |
| } |
| } |
| |
| hdr->bfd_section = newsect; |
| elf_section_data (newsect)->this_hdr = *hdr; |
| |
| return true; |
| } |
| |
| /* |
| INTERNAL_FUNCTION |
| bfd_elf_find_section |
| |
| SYNOPSIS |
| struct elf_internal_shdr *bfd_elf_find_section (bfd *abfd, char *name); |
| |
| DESCRIPTION |
| Helper functions for GDB to locate the string tables. |
| Since BFD hides string tables from callers, GDB needs to use an |
| internal hook to find them. Sun's .stabstr, in particular, |
| isn't even pointed to by the .stab section, so ordinary |
| mechanisms wouldn't work to find it, even if we had some. |
| */ |
| |
| struct elf_internal_shdr * |
| bfd_elf_find_section (abfd, name) |
| bfd *abfd; |
| char *name; |
| { |
| Elf_Internal_Shdr **i_shdrp; |
| char *shstrtab; |
| unsigned int max; |
| unsigned int i; |
| |
| i_shdrp = elf_elfsections (abfd); |
| if (i_shdrp != NULL) |
| { |
| shstrtab = bfd_elf_get_str_section |
| (abfd, elf_elfheader (abfd)->e_shstrndx); |
| if (shstrtab != NULL) |
| { |
| max = elf_elfheader (abfd)->e_shnum; |
| for (i = 1; i < max; i++) |
| if (!strcmp (&shstrtab[i_shdrp[i]->sh_name], name)) |
| return i_shdrp[i]; |
| } |
| } |
| return 0; |
| } |
| |
| const char *const bfd_elf_section_type_names[] = { |
| "SHT_NULL", "SHT_PROGBITS", "SHT_SYMTAB", "SHT_STRTAB", |
| "SHT_RELA", "SHT_HASH", "SHT_DYNAMIC", "SHT_NOTE", |
| "SHT_NOBITS", "SHT_REL", "SHT_SHLIB", "SHT_DYNSYM", |
| }; |
| |
| /* ELF relocs are against symbols. If we are producing relocateable |
| output, and the reloc is against an external symbol, and nothing |
| has given us any additional addend, the resulting reloc will also |
| be against the same symbol. In such a case, we don't want to |
| change anything about the way the reloc is handled, since it will |
| all be done at final link time. Rather than put special case code |
| into bfd_perform_relocation, all the reloc types use this howto |
| function. It just short circuits the reloc if producing |
| relocateable output against an external symbol. */ |
| |
| bfd_reloc_status_type |
| bfd_elf_generic_reloc (abfd, |
| reloc_entry, |
| symbol, |
| data, |
| input_section, |
| output_bfd, |
| error_message) |
| bfd *abfd ATTRIBUTE_UNUSED; |
| arelent *reloc_entry; |
| asymbol *symbol; |
| PTR data ATTRIBUTE_UNUSED; |
| asection *input_section; |
| bfd *output_bfd; |
| char **error_message ATTRIBUTE_UNUSED; |
| { |
| if (output_bfd != (bfd *) NULL |
| && (symbol->flags & BSF_SECTION_SYM) == 0 |
| && (! reloc_entry->howto->partial_inplace |
| || reloc_entry->addend == 0)) |
| { |
| reloc_entry->address += input_section->output_offset; |
| return bfd_reloc_ok; |
| } |
| |
| return bfd_reloc_continue; |
| } |
| |
| /* Print out the program headers. */ |
| |
| boolean |
| _bfd_elf_print_private_bfd_data (abfd, farg) |
| bfd *abfd; |
| PTR farg; |
| { |
| FILE *f = (FILE *) farg; |
| Elf_Internal_Phdr *p; |
| asection *s; |
| bfd_byte *dynbuf = NULL; |
| |
| p = elf_tdata (abfd)->phdr; |
| if (p != NULL) |
| { |
| unsigned int i, c; |
| |
| fprintf (f, _("\nProgram Header:\n")); |
| c = elf_elfheader (abfd)->e_phnum; |
| for (i = 0; i < c; i++, p++) |
| { |
| const char *s; |
| char buf[20]; |
| |
| switch (p->p_type) |
| { |
| case PT_NULL: s = "NULL"; break; |
| case PT_LOAD: s = "LOAD"; break; |
| case PT_DYNAMIC: s = "DYNAMIC"; break; |
| case PT_INTERP: s = "INTERP"; break; |
| case PT_NOTE: s = "NOTE"; break; |
| case PT_SHLIB: s = "SHLIB"; break; |
| case PT_PHDR: s = "PHDR"; break; |
| default: sprintf (buf, "0x%lx", p->p_type); s = buf; break; |
| } |
| fprintf (f, "%8s off 0x", s); |
| fprintf_vma (f, p->p_offset); |
| fprintf (f, " vaddr 0x"); |
| fprintf_vma (f, p->p_vaddr); |
| fprintf (f, " paddr 0x"); |
| fprintf_vma (f, p->p_paddr); |
| fprintf (f, " align 2**%u\n", bfd_log2 (p->p_align)); |
| fprintf (f, " filesz 0x"); |
| fprintf_vma (f, p->p_filesz); |
| fprintf (f, " memsz 0x"); |
| fprintf_vma (f, p->p_memsz); |
| fprintf (f, " flags %c%c%c", |
| (p->p_flags & PF_R) != 0 ? 'r' : '-', |
| (p->p_flags & PF_W) != 0 ? 'w' : '-', |
| (p->p_flags & PF_X) != 0 ? 'x' : '-'); |
| if ((p->p_flags &~ (PF_R | PF_W | PF_X)) != 0) |
| fprintf (f, " %lx", p->p_flags &~ (PF_R | PF_W | PF_X)); |
| fprintf (f, "\n"); |
| } |
| } |
| |
| s = bfd_get_section_by_name (abfd, ".dynamic"); |
| if (s != NULL) |
| { |
| int elfsec; |
| unsigned long link; |
| bfd_byte *extdyn, *extdynend; |
| size_t extdynsize; |
| void (*swap_dyn_in) PARAMS ((bfd *, const PTR, Elf_Internal_Dyn *)); |
| |
| fprintf (f, _("\nDynamic Section:\n")); |
| |
| dynbuf = (bfd_byte *) bfd_malloc (s->_raw_size); |
| if (dynbuf == NULL) |
| goto error_return; |
| if (! bfd_get_section_contents (abfd, s, (PTR) dynbuf, (file_ptr) 0, |
| s->_raw_size)) |
| goto error_return; |
| |
| elfsec = _bfd_elf_section_from_bfd_section (abfd, s); |
| if (elfsec == -1) |
| goto error_return; |
| link = elf_elfsections (abfd)[elfsec]->sh_link; |
| |
| extdynsize = get_elf_backend_data (abfd)->s->sizeof_dyn; |
| swap_dyn_in = get_elf_backend_data (abfd)->s->swap_dyn_in; |
| |
| extdyn = dynbuf; |
| extdynend = extdyn + s->_raw_size; |
| for (; extdyn < extdynend; extdyn += extdynsize) |
| { |
| Elf_Internal_Dyn dyn; |
| const char *name; |
| char ab[20]; |
| boolean stringp; |
| |
| (*swap_dyn_in) (abfd, (PTR) extdyn, &dyn); |
| |
| if (dyn.d_tag == DT_NULL) |
| break; |
| |
| stringp = false; |
| switch (dyn.d_tag) |
| { |
| default: |
| sprintf (ab, "0x%lx", (unsigned long) dyn.d_tag); |
| name = ab; |
| break; |
| |
| case DT_NEEDED: name = "NEEDED"; stringp = true; break; |
| case DT_PLTRELSZ: name = "PLTRELSZ"; break; |
| case DT_PLTGOT: name = "PLTGOT"; break; |
| case DT_HASH: name = "HASH"; break; |
| case DT_STRTAB: name = "STRTAB"; break; |
| case DT_SYMTAB: name = "SYMTAB"; break; |
| case DT_RELA: name = "RELA"; break; |
| case DT_RELASZ: name = "RELASZ"; break; |
| case DT_RELAENT: name = "RELAENT"; break; |
| case DT_STRSZ: name = "STRSZ"; break; |
| case DT_SYMENT: name = "SYMENT"; break; |
| case DT_INIT: name = "INIT"; break; |
| case DT_FINI: name = "FINI"; break; |
| case DT_SONAME: name = "SONAME"; stringp = true; break; |
| case DT_RPATH: name = "RPATH"; stringp = true; break; |
| case DT_SYMBOLIC: name = "SYMBOLIC"; break; |
| case DT_REL: name = "REL"; break; |
| case DT_RELSZ: name = "RELSZ"; break; |
| case DT_RELENT: name = "RELENT"; break; |
| case DT_PLTREL: name = "PLTREL"; break; |
| case DT_DEBUG: name = "DEBUG"; break; |
| case DT_TEXTREL: name = "TEXTREL"; break; |
| case DT_JMPREL: name = "JMPREL"; break; |
| case DT_BIND_NOW: name = "BIND_NOW"; break; |
| case DT_INIT_ARRAY: name = "INIT_ARRAY"; break; |
| case DT_FINI_ARRAY: name = "FINI_ARRAY"; break; |
| case DT_INIT_ARRAYSZ: name = "INIT_ARRAYSZ"; break; |
| case DT_FINI_ARRAYSZ: name = "FINI_ARRAYSZ"; break; |
| case DT_RUNPATH: name = "RUNPATH"; stringp = true; break; |
| case DT_FLAGS: name = "FLAGS"; break; |
| case DT_PREINIT_ARRAY: name = "PREINIT_ARRAY"; break; |
| case DT_PREINIT_ARRAYSZ: name = "PREINIT_ARRAYSZ"; break; |
| case DT_CHECKSUM: name = "CHECKSUM"; break; |
| case DT_PLTPADSZ: name = "PLTPADSZ"; break; |
| case DT_MOVEENT: name = "MOVEENT"; break; |
| case DT_MOVESZ: name = "MOVESZ"; break; |
| case DT_FEATURE: name = "FEATURE"; break; |
| case DT_POSFLAG_1: name = "POSFLAG_1"; break; |
| case DT_SYMINSZ: name = "SYMINSZ"; break; |
| case DT_SYMINENT: name = "SYMINENT"; break; |
| case DT_CONFIG: name = "CONFIG"; stringp = true; break; |
| case DT_DEPAUDIT: name = "DEPAUDIT"; stringp = true; break; |
| case DT_AUDIT: name = "AUDIT"; stringp = true; break; |
| case DT_PLTPAD: name = "PLTPAD"; break; |
| case DT_MOVETAB: name = "MOVETAB"; break; |
| case DT_SYMINFO: name = "SYMINFO"; break; |
| case DT_RELACOUNT: name = "RELACOUNT"; break; |
| case DT_RELCOUNT: name = "RELCOUNT"; break; |
| case DT_FLAGS_1: name = "FLAGS_1"; break; |
| case DT_VERSYM: name = "VERSYM"; break; |
| case DT_VERDEF: name = "VERDEF"; break; |
| case DT_VERDEFNUM: name = "VERDEFNUM"; break; |
| case DT_VERNEED: name = "VERNEED"; break; |
| case DT_VERNEEDNUM: name = "VERNEEDNUM"; break; |
| case DT_AUXILIARY: name = "AUXILIARY"; stringp = true; break; |
| case DT_USED: name = "USED"; break; |
| case DT_FILTER: name = "FILTER"; stringp = true; break; |
| } |
| |
| fprintf (f, " %-11s ", name); |
| if (! stringp) |
| fprintf (f, "0x%lx", (unsigned long) dyn.d_un.d_val); |
| else |
| { |
| const char *string; |
| |
| string = bfd_elf_string_from_elf_section (abfd, link, |
| dyn.d_un.d_val); |
| if (string == NULL) |
| goto error_return; |
| fprintf (f, "%s", string); |
| } |
| fprintf (f, "\n"); |
| } |
| |
| free (dynbuf); |
| dynbuf = NULL; |
| } |
| |
| if ((elf_dynverdef (abfd) != 0 && elf_tdata (abfd)->verdef == NULL) |
| || (elf_dynverref (abfd) != 0 && elf_tdata (abfd)->verref == NULL)) |
| { |
| if (! _bfd_elf_slurp_version_tables (abfd)) |
| return false; |
| } |
| |
| if (elf_dynverdef (abfd) != 0) |
| { |
| Elf_Internal_Verdef *t; |
| |
| fprintf (f, _("\nVersion definitions:\n")); |
| for (t = elf_tdata (abfd)->verdef; t != NULL; t = t->vd_nextdef) |
| { |
| fprintf (f, "%d 0x%2.2x 0x%8.8lx %s\n", t->vd_ndx, |
| t->vd_flags, t->vd_hash, t->vd_nodename); |
| if (t->vd_auxptr->vda_nextptr != NULL) |
| { |
| Elf_Internal_Verdaux *a; |
| |
| fprintf (f, "\t"); |
| for (a = t->vd_auxptr->vda_nextptr; |
| a != NULL; |
| a = a->vda_nextptr) |
| fprintf (f, "%s ", a->vda_nodename); |
| fprintf (f, "\n"); |
| } |
| } |
| } |
| |
| if (elf_dynverref (abfd) != 0) |
| { |
| Elf_Internal_Verneed *t; |
| |
| fprintf (f, _("\nVersion References:\n")); |
| for (t = elf_tdata (abfd)->verref; t != NULL; t = t->vn_nextref) |
| { |
| Elf_Internal_Vernaux *a; |
| |
| fprintf (f, _(" required from %s:\n"), t->vn_filename); |
| for (a = t->vn_auxptr; a != NULL; a = a->vna_nextptr) |
| fprintf (f, " 0x%8.8lx 0x%2.2x %2.2d %s\n", a->vna_hash, |
| a->vna_flags, a->vna_other, a->vna_nodename); |
| } |
| } |
| |
| return true; |
| |
| error_return: |
| if (dynbuf != NULL) |
| free (dynbuf); |
| return false; |
| } |
| |
| /* Display ELF-specific fields of a symbol. */ |
| |
| void |
| bfd_elf_print_symbol (abfd, filep, symbol, how) |
| bfd *abfd; |
| PTR filep; |
| asymbol *symbol; |
| bfd_print_symbol_type how; |
| { |
| FILE *file = (FILE *) filep; |
| switch (how) |
| { |
| case bfd_print_symbol_name: |
| fprintf (file, "%s", symbol->name); |
| break; |
| case bfd_print_symbol_more: |
| fprintf (file, "elf "); |
| fprintf_vma (file, symbol->value); |
| fprintf (file, " %lx", (long) symbol->flags); |
| break; |
| case bfd_print_symbol_all: |
| { |
| const char *section_name; |
| const char *name = NULL; |
| struct elf_backend_data *bed; |
| unsigned char st_other; |
| |
| section_name = symbol->section ? symbol->section->name : "(*none*)"; |
| |
| bed = get_elf_backend_data (abfd); |
| if (bed->elf_backend_print_symbol_all) |
| name = (*bed->elf_backend_print_symbol_all) (abfd, filep, symbol); |
| |
| if (name == NULL) |
| { |
| name = symbol->name; |
| bfd_print_symbol_vandf ((PTR) file, symbol); |
| } |
| |
| fprintf (file, " %s\t", section_name); |
| /* Print the "other" value for a symbol. For common symbols, |
| we've already printed the size; now print the alignment. |
| For other symbols, we have no specified alignment, and |
| we've printed the address; now print the size. */ |
| fprintf_vma (file, |
| (bfd_is_com_section (symbol->section) |
| ? ((elf_symbol_type *) symbol)->internal_elf_sym.st_value |
| : ((elf_symbol_type *) symbol)->internal_elf_sym.st_size)); |
| |
| /* If we have version information, print it. */ |
| if (elf_tdata (abfd)->dynversym_section != 0 |
| && (elf_tdata (abfd)->dynverdef_section != 0 |
| || elf_tdata (abfd)->dynverref_section != 0)) |
| { |
| unsigned int vernum; |
| const char *version_string; |
| |
| vernum = ((elf_symbol_type *) symbol)->version & VERSYM_VERSION; |
| |
| if (vernum == 0) |
| version_string = ""; |
| else if (vernum == 1) |
| version_string = "Base"; |
| else if (vernum <= elf_tdata (abfd)->cverdefs) |
| version_string = |
| elf_tdata (abfd)->verdef[vernum - 1].vd_nodename; |
| else |
| { |
| Elf_Internal_Verneed *t; |
| |
| version_string = ""; |
| for (t = elf_tdata (abfd)->verref; |
| t != NULL; |
| t = t->vn_nextref) |
| { |
| Elf_Internal_Vernaux *a; |
| |
| for (a = t->vn_auxptr; a != NULL; a = a->vna_nextptr) |
| { |
| if (a->vna_other == vernum) |
| { |
| version_string = a->vna_nodename; |
| break; |
| } |
| } |
| } |
| } |
| |
| if ((((elf_symbol_type *) symbol)->version & VERSYM_HIDDEN) == 0) |
| fprintf (file, " %-11s", version_string); |
| else |
| { |
| int i; |
| |
| fprintf (file, " (%s)", version_string); |
| for (i = 10 - strlen (version_string); i > 0; --i) |
| putc (' ', file); |
| } |
| } |
| |
| /* If the st_other field is not zero, print it. */ |
| st_other = ((elf_symbol_type *) symbol)->internal_elf_sym.st_other; |
| |
| switch (st_other) |
| { |
| case 0: break; |
| case STV_INTERNAL: fprintf (file, " .internal"); break; |
| case STV_HIDDEN: fprintf (file, " .hidden"); break; |
| case STV_PROTECTED: fprintf (file, " .protected"); break; |
| default: |
| /* Some other non-defined flags are also present, so print |
| everything hex. */ |
| fprintf (file, " 0x%02x", (unsigned int) st_other); |
| } |
| |
| fprintf (file, " %s", name); |
| } |
| break; |
| } |
| } |
| |
| /* Create an entry in an ELF linker hash table. */ |
| |
| struct bfd_hash_entry * |
| _bfd_elf_link_hash_newfunc (entry, table, string) |
| struct bfd_hash_entry *entry; |
| struct bfd_hash_table *table; |
| const char *string; |
| { |
| struct elf_link_hash_entry *ret = (struct elf_link_hash_entry *) entry; |
| |
| /* Allocate the structure if it has not already been allocated by a |
| subclass. */ |
| if (ret == (struct elf_link_hash_entry *) NULL) |
| ret = ((struct elf_link_hash_entry *) |
| bfd_hash_allocate (table, sizeof (struct elf_link_hash_entry))); |
| if (ret == (struct elf_link_hash_entry *) NULL) |
| return (struct bfd_hash_entry *) ret; |
| |
| /* Call the allocation method of the superclass. */ |
| ret = ((struct elf_link_hash_entry *) |
| _bfd_link_hash_newfunc ((struct bfd_hash_entry *) ret, |
| table, string)); |
| if (ret != (struct elf_link_hash_entry *) NULL) |
| { |
| /* Set local fields. */ |
| ret->indx = -1; |
| ret->size = 0; |
| ret->dynindx = -1; |
| ret->dynstr_index = 0; |
| ret->weakdef = NULL; |
| ret->got.offset = (bfd_vma) -1; |
| ret->plt.offset = (bfd_vma) -1; |
| ret->linker_section_pointer = (elf_linker_section_pointers_t *)0; |
| ret->verinfo.verdef = NULL; |
| ret->vtable_entries_used = NULL; |
| ret->vtable_entries_size = 0; |
| ret->vtable_parent = NULL; |
| ret->type = STT_NOTYPE; |
| ret->other = 0; |
| /* Assume that we have been called by a non-ELF symbol reader. |
| This flag is then reset by the code which reads an ELF input |
| file. This ensures that a symbol created by a non-ELF symbol |
| reader will have the flag set correctly. */ |
| ret->elf_link_hash_flags = ELF_LINK_NON_ELF; |
| } |
| |
| return (struct bfd_hash_entry *) ret; |
| } |
| |
| /* Copy data from an indirect symbol to its direct symbol, hiding the |
| old indirect symbol. */ |
| |
| void |
| _bfd_elf_link_hash_copy_indirect (dir, ind) |
| struct elf_link_hash_entry *dir, *ind; |
| { |
| /* Copy down any references that we may have already seen to the |
| symbol which just became indirect. */ |
| |
| dir->elf_link_hash_flags |= |
| (ind->elf_link_hash_flags |
| & (ELF_LINK_HASH_REF_DYNAMIC |
| | ELF_LINK_HASH_REF_REGULAR |
| | ELF_LINK_HASH_REF_REGULAR_NONWEAK |
| | ELF_LINK_NON_GOT_REF)); |
| |
| /* Copy over the global and procedure linkage table offset entries. |
| These may have been already set up by a check_relocs routine. */ |
| if (dir->got.offset == (bfd_vma) -1) |
| { |
| dir->got.offset = ind->got.offset; |
| ind->got.offset = (bfd_vma) -1; |
| } |
| BFD_ASSERT (ind->got.offset == (bfd_vma) -1); |
| |
| if (dir->plt.offset == (bfd_vma) -1) |
| { |
| dir->plt.offset = ind->plt.offset; |
| ind->plt.offset = (bfd_vma) -1; |
| } |
| BFD_ASSERT (ind->plt.offset == (bfd_vma) -1); |
| |
| if (dir->dynindx == -1) |
| { |
| dir->dynindx = ind->dynindx; |
| dir->dynstr_index = ind->dynstr_index; |
| ind->dynindx = -1; |
| ind->dynstr_index = 0; |
| } |
| BFD_ASSERT (ind->dynindx == -1); |
| } |
| |
| void |
| _bfd_elf_link_hash_hide_symbol (info, h) |
| struct bfd_link_info *info ATTRIBUTE_UNUSED; |
| struct elf_link_hash_entry *h; |
| { |
| h->elf_link_hash_flags &= ~ELF_LINK_HASH_NEEDS_PLT; |
| h->plt.offset = (bfd_vma) -1; |
| if ((h->elf_link_hash_flags & ELF_LINK_FORCED_LOCAL) != 0) |
| h->dynindx = -1; |
| } |
| |
| /* Initialize an ELF linker hash table. */ |
| |
| boolean |
| _bfd_elf_link_hash_table_init (table, abfd, newfunc) |
| struct elf_link_hash_table *table; |
| bfd *abfd; |
| struct bfd_hash_entry *(*newfunc) PARAMS ((struct bfd_hash_entry *, |
| struct bfd_hash_table *, |
| const char *)); |
| { |
| table->dynamic_sections_created = false; |
| table->dynobj = NULL; |
| /* The first dynamic symbol is a dummy. */ |
| table->dynsymcount = 1; |
| table->dynstr = NULL; |
| table->bucketcount = 0; |
| table->needed = NULL; |
| table->runpath = NULL; |
| table->hgot = NULL; |
| table->stab_info = NULL; |
| table->dynlocal = NULL; |
| return _bfd_link_hash_table_init (&table->root, abfd, newfunc); |
| } |
| |
| /* Create an ELF linker hash table. */ |
| |
| struct bfd_link_hash_table * |
| _bfd_elf_link_hash_table_create (abfd) |
| bfd *abfd; |
| { |
| struct elf_link_hash_table *ret; |
| |
| ret = ((struct elf_link_hash_table *) |
| bfd_alloc (abfd, sizeof (struct elf_link_hash_table))); |
| if (ret == (struct elf_link_hash_table *) NULL) |
| return NULL; |
| |
| if (! _bfd_elf_link_hash_table_init (ret, abfd, _bfd_elf_link_hash_newfunc)) |
| { |
| bfd_release (abfd, ret); |
| return NULL; |
| } |
| |
| return &ret->root; |
| } |
| |
| /* This is a hook for the ELF emulation code in the generic linker to |
| tell the backend linker what file name to use for the DT_NEEDED |
| entry for a dynamic object. The generic linker passes name as an |
| empty string to indicate that no DT_NEEDED entry should be made. */ |
| |
| void |
| bfd_elf_set_dt_needed_name (abfd, name) |
| bfd *abfd; |
| const char *name; |
| { |
| if (bfd_get_flavour (abfd) == bfd_target_elf_flavour |
| && bfd_get_format (abfd) == bfd_object) |
| elf_dt_name (abfd) = name; |
| } |
| |
| void |
| bfd_elf_set_dt_needed_soname (abfd, name) |
| bfd *abfd; |
| const char *name; |
| { |
| if (bfd_get_flavour (abfd) == bfd_target_elf_flavour |
| && bfd_get_format (abfd) == bfd_object) |
| elf_dt_soname (abfd) = name; |
| } |
| |
| /* Get the list of DT_NEEDED entries for a link. This is a hook for |
| the linker ELF emulation code. */ |
| |
| struct bfd_link_needed_list * |
| bfd_elf_get_needed_list (abfd, info) |
| bfd *abfd ATTRIBUTE_UNUSED; |
| struct bfd_link_info *info; |
| { |
| if (info->hash->creator->flavour != bfd_target_elf_flavour) |
| return NULL; |
| return elf_hash_table (info)->needed; |
| } |
| |
| /* Get the list of DT_RPATH/DT_RUNPATH entries for a link. This is a |
| hook for the linker ELF emulation code. */ |
| |
| struct bfd_link_needed_list * |
| bfd_elf_get_runpath_list (abfd, info) |
| bfd *abfd ATTRIBUTE_UNUSED; |
| struct bfd_link_info *info; |
| { |
| if (info->hash->creator->flavour != bfd_target_elf_flavour) |
| return NULL; |
| return elf_hash_table (info)->runpath; |
| } |
| |
| /* Get the name actually used for a dynamic object for a link. This |
| is the SONAME entry if there is one. Otherwise, it is the string |
| passed to bfd_elf_set_dt_needed_name, or it is the filename. */ |
| |
| const char * |
| bfd_elf_get_dt_soname (abfd) |
| bfd *abfd; |
| { |
| if (bfd_get_flavour (abfd) == bfd_target_elf_flavour |
| && bfd_get_format (abfd) == bfd_object) |
| return elf_dt_name (abfd); |
| return NULL; |
| } |
| |
| /* Get the list of DT_NEEDED entries from a BFD. This is a hook for |
| the ELF linker emulation code. */ |
| |
| boolean |
| bfd_elf_get_bfd_needed_list (abfd, pneeded) |
| bfd *abfd; |
| struct bfd_link_needed_list **pneeded; |
| { |
| asection *s; |
| bfd_byte *dynbuf = NULL; |
| int elfsec; |
| unsigned long link; |
| bfd_byte *extdyn, *extdynend; |
| size_t extdynsize; |
| void (*swap_dyn_in) PARAMS ((bfd *, const PTR, Elf_Internal_Dyn *)); |
| |
| *pneeded = NULL; |
| |
| if (bfd_get_flavour (abfd) != bfd_target_elf_flavour |
| || bfd_get_format (abfd) != bfd_object) |
| return true; |
| |
| s = bfd_get_section_by_name (abfd, ".dynamic"); |
| if (s == NULL || s->_raw_size == 0) |
| return true; |
| |
| dynbuf = (bfd_byte *) bfd_malloc (s->_raw_size); |
| if (dynbuf == NULL) |
| goto error_return; |
| |
| if (! bfd_get_section_contents (abfd, s, (PTR) dynbuf, (file_ptr) 0, |
| s->_raw_size)) |
| goto error_return; |
| |
| elfsec = _bfd_elf_section_from_bfd_section (abfd, s); |
| if (elfsec == -1) |
| goto error_return; |
| |
| link = elf_elfsections (abfd)[elfsec]->sh_link; |
| |
| extdynsize = get_elf_backend_data (abfd)->s->sizeof_dyn; |
| swap_dyn_in = get_elf_backend_data (abfd)->s->swap_dyn_in; |
| |
| extdyn = dynbuf; |
| extdynend = extdyn + s->_raw_size; |
| for (; extdyn < extdynend; extdyn += extdynsize) |
| { |
| Elf_Internal_Dyn dyn; |
| |
| (*swap_dyn_in) (abfd, (PTR) extdyn, &dyn); |
| |
| if (dyn.d_tag == DT_NULL) |
| break; |
| |
| if (dyn.d_tag == DT_NEEDED) |
| { |
| const char *string; |
| struct bfd_link_needed_list *l; |
| |
| string = bfd_elf_string_from_elf_section (abfd, link, |
| dyn.d_un.d_val); |
| if (string == NULL) |
| goto error_return; |
| |
| l = (struct bfd_link_needed_list *) bfd_alloc (abfd, sizeof *l); |
| if (l == NULL) |
| goto error_return; |
| |
| l->by = abfd; |
| l->name = string; |
| l->next = *pneeded; |
| *pneeded = l; |
| } |
| } |
| |
| free (dynbuf); |
| |
| return true; |
| |
| error_return: |
| if (dynbuf != NULL) |
| free (dynbuf); |
| return false; |
| } |
| |
| /* Allocate an ELF string table--force the first byte to be zero. */ |
| |
| struct bfd_strtab_hash * |
| _bfd_elf_stringtab_init () |
| { |
| struct bfd_strtab_hash *ret; |
| |
| ret = _bfd_stringtab_init (); |
| if (ret != NULL) |
| { |
| bfd_size_type loc; |
| |
| loc = _bfd_stringtab_add (ret, "", true, false); |
| BFD_ASSERT (loc == 0 || loc == (bfd_size_type) -1); |
| if (loc == (bfd_size_type) -1) |
| { |
| _bfd_stringtab_free (ret); |
| ret = NULL; |
| } |
| } |
| return ret; |
| } |
| |
| /* ELF .o/exec file reading */ |
| |
| /* Create a new bfd section from an ELF section header. */ |
| |
| boolean |
| bfd_section_from_shdr (abfd, shindex) |
| bfd *abfd; |
| unsigned int shindex; |
| { |
| Elf_Internal_Shdr *hdr = elf_elfsections (abfd)[shindex]; |
| Elf_Internal_Ehdr *ehdr = elf_elfheader (abfd); |
| struct elf_backend_data *bed = get_elf_backend_data (abfd); |
| char *name; |
| |
| name = elf_string_from_elf_strtab (abfd, hdr->sh_name); |
| |
| switch (hdr->sh_type) |
| { |
| case SHT_NULL: |
| /* Inactive section. Throw it away. */ |
| return true; |
| |
| case SHT_PROGBITS: /* Normal section with contents. */ |
| case SHT_DYNAMIC: /* Dynamic linking information. */ |
| case SHT_NOBITS: /* .bss section. */ |
| case SHT_HASH: /* .hash section. */ |
| case SHT_NOTE: /* .note section. */ |
| return _bfd_elf_make_section_from_shdr (abfd, hdr, name); |
| |
| case SHT_SYMTAB: /* A symbol table */ |
| if (elf_onesymtab (abfd) == shindex) |
| return true; |
| |
| BFD_ASSERT (hdr->sh_entsize == bed->s->sizeof_sym); |
| BFD_ASSERT (elf_onesymtab (abfd) == 0); |
| elf_onesymtab (abfd) = shindex; |
| elf_tdata (abfd)->symtab_hdr = *hdr; |
| elf_elfsections (abfd)[shindex] = hdr = &elf_tdata (abfd)->symtab_hdr; |
| abfd->flags |= HAS_SYMS; |
| |
| /* Sometimes a shared object will map in the symbol table. If |
| SHF_ALLOC is set, and this is a shared object, then we also |
| treat this section as a BFD section. We can not base the |
| decision purely on SHF_ALLOC, because that flag is sometimes |
| set in a relocateable object file, which would confuse the |
| linker. */ |
| if ((hdr->sh_flags & SHF_ALLOC) != 0 |
| && (abfd->flags & DYNAMIC) != 0 |
| && ! _bfd_elf_make_section_from_shdr (abfd, hdr, name)) |
| return false; |
| |
| return true; |
| |
| case SHT_DYNSYM: /* A dynamic symbol table */ |
| if (elf_dynsymtab (abfd) == shindex) |
| return true; |
| |
| BFD_ASSERT (hdr->sh_entsize == bed->s->sizeof_sym); |
| BFD_ASSERT (elf_dynsymtab (abfd) == 0); |
| elf_dynsymtab (abfd) = shindex; |
| elf_tdata (abfd)->dynsymtab_hdr = *hdr; |
| elf_elfsections (abfd)[shindex] = hdr = &elf_tdata (abfd)->dynsymtab_hdr; |
| abfd->flags |= HAS_SYMS; |
| |
| /* Besides being a symbol table, we also treat this as a regular |
| section, so that objcopy can handle it. */ |
| return _bfd_elf_make_section_from_shdr (abfd, hdr, name); |
| |
| case SHT_STRTAB: /* A string table */ |
| if (hdr->bfd_section != NULL) |
| return true; |
| if (ehdr->e_shstrndx == shindex) |
| { |
| elf_tdata (abfd)->shstrtab_hdr = *hdr; |
| elf_elfsections (abfd)[shindex] = &elf_tdata (abfd)->shstrtab_hdr; |
| return true; |
| } |
| { |
| unsigned int i; |
| |
| for (i = 1; i < ehdr->e_shnum; i++) |
| { |
| Elf_Internal_Shdr *hdr2 = elf_elfsections (abfd)[i]; |
| if (hdr2->sh_link == shindex) |
| { |
| if (! bfd_section_from_shdr (abfd, i)) |
| return false; |
| if (elf_onesymtab (abfd) == i) |
| { |
| elf_tdata (abfd)->strtab_hdr = *hdr; |
| elf_elfsections (abfd)[shindex] = |
| &elf_tdata (abfd)->strtab_hdr; |
| return true; |
| } |
| if (elf_dynsymtab (abfd) == i) |
| { |
| elf_tdata (abfd)->dynstrtab_hdr = *hdr; |
| elf_elfsections (abfd)[shindex] = hdr = |
| &elf_tdata (abfd)->dynstrtab_hdr; |
| /* We also treat this as a regular section, so |
| that objcopy can handle it. */ |
| break; |
| } |
| #if 0 /* Not handling other string tables specially right now. */ |
| hdr2 = elf_elfsections (abfd)[i]; /* in case it moved */ |
| /* We have a strtab for some random other section. */ |
| newsect = (asection *) hdr2->bfd_section; |
| if (!newsect) |
| break; |
| hdr->bfd_section = newsect; |
| hdr2 = &elf_section_data (newsect)->str_hdr; |
| *hdr2 = *hdr; |
| elf_elfsections (abfd)[shindex] = hdr2; |
| #endif |
| } |
| } |
| } |
| |
| return _bfd_elf_make_section_from_shdr (abfd, hdr, name); |
| |
| case SHT_REL: |
| case SHT_RELA: |
| /* *These* do a lot of work -- but build no sections! */ |
| { |
| asection *target_sect; |
| Elf_Internal_Shdr *hdr2; |
| |
| /* Check for a bogus link to avoid crashing. */ |
| if (hdr->sh_link >= ehdr->e_shnum) |
| { |
| ((*_bfd_error_handler) |
| (_("%s: invalid link %lu for reloc section %s (index %u)"), |
| bfd_get_filename (abfd), hdr->sh_link, name, shindex)); |
| return _bfd_elf_make_section_from_shdr (abfd, hdr, name); |
| } |
| |
| /* For some incomprehensible reason Oracle distributes |
| libraries for Solaris in which some of the objects have |
| bogus sh_link fields. It would be nice if we could just |
| reject them, but, unfortunately, some people need to use |
| them. We scan through the section headers; if we find only |
| one suitable symbol table, we clobber the sh_link to point |
| to it. I hope this doesn't break anything. */ |
| if (elf_elfsections (abfd)[hdr->sh_link]->sh_type != SHT_SYMTAB |
| && elf_elfsections (abfd)[hdr->sh_link]->sh_type != SHT_DYNSYM) |
| { |
| int scan; |
| int found; |
| |
| found = 0; |
| for (scan = 1; scan < ehdr->e_shnum; scan++) |
| { |
| if (elf_elfsections (abfd)[scan]->sh_type == SHT_SYMTAB |
| || elf_elfsections (abfd)[scan]->sh_type == SHT_DYNSYM) |
| { |
| if (found != 0) |
| { |
| found = 0; |
| break; |
| } |
| found = scan; |
| } |
| } |
| if (found != 0) |
| hdr->sh_link = found; |
| } |
| |
| /* Get the symbol table. */ |
| if (elf_elfsections (abfd)[hdr->sh_link]->sh_type == SHT_SYMTAB |
| && ! bfd_section_from_shdr (abfd, hdr->sh_link)) |
| return false; |
| |
| /* If this reloc section does not use the main symbol table we |
| don't treat it as a reloc section. BFD can't adequately |
| represent such a section, so at least for now, we don't |
| try. We just present it as a normal section. We also |
| can't use it as a reloc section if it points to the null |
| section. */ |
| if (hdr->sh_link != elf_onesymtab (abfd) || hdr->sh_info == SHN_UNDEF) |
| return _bfd_elf_make_section_from_shdr (abfd, hdr, name); |
| |
| if (! bfd_section_from_shdr (abfd, hdr->sh_info)) |
| return false; |
| target_sect = bfd_section_from_elf_index (abfd, hdr->sh_info); |
| if (target_sect == NULL) |
| return false; |
| |
| if ((target_sect->flags & SEC_RELOC) == 0 |
| || target_sect->reloc_count == 0) |
| hdr2 = &elf_section_data (target_sect)->rel_hdr; |
| else |
| { |
| BFD_ASSERT (elf_section_data (target_sect)->rel_hdr2 == NULL); |
| hdr2 = (Elf_Internal_Shdr *) bfd_alloc (abfd, sizeof (*hdr2)); |
| elf_section_data (target_sect)->rel_hdr2 = hdr2; |
| } |
| *hdr2 = *hdr; |
| elf_elfsections (abfd)[shindex] = hdr2; |
| target_sect->reloc_count += NUM_SHDR_ENTRIES (hdr); |
| target_sect->flags |= SEC_RELOC; |
| target_sect->relocation = NULL; |
| target_sect->rel_filepos = hdr->sh_offset; |
| /* In the section to which the relocations apply, mark whether |
| its relocations are of the REL or RELA variety. */ |
| if (hdr->sh_size != 0) |
| elf_section_data (target_sect)->use_rela_p |
| = (hdr->sh_type == SHT_RELA); |
| abfd->flags |= HAS_RELOC; |
| return true; |
| } |
| break; |
| |
| case SHT_GNU_verdef: |
| elf_dynverdef (abfd) = shindex; |
| elf_tdata (abfd)->dynverdef_hdr = *hdr; |
| return _bfd_elf_make_section_from_shdr (abfd, hdr, name); |
| break; |
| |
| case SHT_GNU_versym: |
| elf_dynversym (abfd) = shindex; |
| elf_tdata (abfd)->dynversym_hdr = *hdr; |
| return _bfd_elf_make_section_from_shdr (abfd, hdr, name); |
| break; |
| |
| case SHT_GNU_verneed: |
| elf_dynverref (abfd) = shindex; |
| elf_tdata (abfd)->dynverref_hdr = *hdr; |
| return _bfd_elf_make_section_from_shdr (abfd, hdr, name); |
| break; |
| |
| case SHT_SHLIB: |
| return true; |
| |
| default: |
| /* Check for any processor-specific section types. */ |
| { |
| if (bed->elf_backend_section_from_shdr) |
| (*bed->elf_backend_section_from_shdr) (abfd, hdr, name); |
| } |
| break; |
| } |
| |
| return true; |
| } |
| |
| /* Given an ELF section number, retrieve the corresponding BFD |
| section. */ |
| |
| asection * |
| bfd_section_from_elf_index (abfd, index) |
| bfd *abfd; |
| unsigned int index; |
| { |
| BFD_ASSERT (index > 0 && index < SHN_LORESERVE); |
| if (index >= elf_elfheader (abfd)->e_shnum) |
| return NULL; |
| return elf_elfsections (abfd)[index]->bfd_section; |
| } |
| |
| boolean |
| _bfd_elf_new_section_hook (abfd, sec) |
| bfd *abfd; |
| asection *sec; |
| { |
| struct bfd_elf_section_data *sdata; |
| |
| sdata = (struct bfd_elf_section_data *) bfd_zalloc (abfd, sizeof (*sdata)); |
| if (!sdata) |
| return false; |
| sec->used_by_bfd = (PTR) sdata; |
| |
| /* Indicate whether or not this section should use RELA relocations. */ |
| sdata->use_rela_p |
| = get_elf_backend_data (abfd)->default_use_rela_p; |
| |
| return true; |
| } |
| |
| /* Create a new bfd section from an ELF program header. |
| |
| Since program segments have no names, we generate a synthetic name |
| of the form segment<NUM>, where NUM is generally the index in the |
| program header table. For segments that are split (see below) we |
| generate the names segment<NUM>a and segment<NUM>b. |
| |
| Note that some program segments may have a file size that is different than |
| (less than) the memory size. All this means is that at execution the |
| system must allocate the amount of memory specified by the memory size, |
| but only initialize it with the first "file size" bytes read from the |
| file. This would occur for example, with program segments consisting |
| of combined data+bss. |
| |
| To handle the above situation, this routine generates TWO bfd sections |
| for the single program segment. The first has the length specified by |
| the file size of the segment, and the second has the length specified |
| by the difference between the two sizes. In effect, the segment is split |
| into it's initialized and uninitialized parts. |
| |
| */ |
| |
| boolean |
| _bfd_elf_make_section_from_phdr (abfd, hdr, index, typename) |
| bfd *abfd; |
| Elf_Internal_Phdr *hdr; |
| int index; |
| const char *typename; |
| { |
| asection *newsect; |
| char *name; |
| char namebuf[64]; |
| int split; |
| |
| split = ((hdr->p_memsz > 0) |
| && (hdr->p_filesz > 0) |
| && (hdr->p_memsz > hdr->p_filesz)); |
| sprintf (namebuf, "%s%d%s", typename, index, split ? "a" : ""); |
| name = bfd_alloc (abfd, strlen (namebuf) + 1); |
| if (!name) |
| return false; |
| strcpy (name, namebuf); |
| newsect = bfd_make_section (abfd, name); |
| if (newsect == NULL) |
| return false; |
| newsect->vma = hdr->p_vaddr; |
| newsect->lma = hdr->p_paddr; |
| newsect->_raw_size = hdr->p_filesz; |
| newsect->filepos = hdr->p_offset; |
| newsect->flags |= SEC_HAS_CONTENTS; |
| if (hdr->p_type == PT_LOAD) |
| { |
| newsect->flags |= SEC_ALLOC; |
| newsect->flags |= SEC_LOAD; |
| if (hdr->p_flags & PF_X) |
| { |
| /* FIXME: all we known is that it has execute PERMISSION, |
| may be data. */ |
| newsect->flags |= SEC_CODE; |
| } |
| } |
| if (!(hdr->p_flags & PF_W)) |
| { |
| newsect->flags |= SEC_READONLY; |
| } |
| |
| if (split) |
| { |
| sprintf (namebuf, "%s%db", typename, index); |
| name = bfd_alloc (abfd, strlen (namebuf) + 1); |
| if (!name) |
| return false; |
| strcpy (name, namebuf); |
| newsect = bfd_make_section (abfd, name); |
| if (newsect == NULL) |
| return false; |
| newsect->vma = hdr->p_vaddr + hdr->p_filesz; |
| newsect->lma = hdr->p_paddr + hdr->p_filesz; |
| newsect->_raw_size = hdr->p_memsz - hdr->p_filesz; |
| if (hdr->p_type == PT_LOAD) |
| { |
| newsect->flags |= SEC_ALLOC; |
| if (hdr->p_flags & PF_X) |
| newsect->flags |= SEC_CODE; |
| } |
| if (!(hdr->p_flags & PF_W)) |
| newsect->flags |= SEC_READONLY; |
| } |
| |
| return true; |
| } |
| |
| boolean |
| bfd_section_from_phdr (abfd, hdr, index) |
| bfd *abfd; |
| Elf_Internal_Phdr *hdr; |
| int index; |
| { |
| struct elf_backend_data *bed; |
| |
| switch (hdr->p_type) |
| { |
| case PT_NULL: |
| return _bfd_elf_make_section_from_phdr (abfd, hdr, index, "null"); |
| |
| case PT_LOAD: |
| return _bfd_elf_make_section_from_phdr (abfd, hdr, index, "load"); |
| |
| case PT_DYNAMIC: |
| return _bfd_elf_make_section_from_phdr (abfd, hdr, index, "dynamic"); |
| |
| case PT_INTERP: |
| return _bfd_elf_make_section_from_phdr (abfd, hdr, index, "interp"); |
| |
| case PT_NOTE: |
| if (! _bfd_elf_make_section_from_phdr (abfd, hdr, index, "note")) |
| return false; |
| if (! elfcore_read_notes (abfd, hdr->p_offset, hdr->p_filesz)) |
| return false; |
| return true; |
| |
| case PT_SHLIB: |
| return _bfd_elf_make_section_from_phdr (abfd, hdr, index, "shlib"); |
| |
| case PT_PHDR: |
| return _bfd_elf_make_section_from_phdr (abfd, hdr, index, "phdr"); |
| |
| default: |
| /* Check for any processor-specific program segment types. |
| If no handler for them, default to making "segment" sections. */ |
| bed = get_elf_backend_data (abfd); |
| if (bed->elf_backend_section_from_phdr) |
| return (*bed->elf_backend_section_from_phdr) (abfd, hdr, index); |
| else |
| return _bfd_elf_make_section_from_phdr (abfd, hdr, index, "segment"); |
| } |
| } |
| |
| /* Initialize REL_HDR, the section-header for new section, containing |
| relocations against ASECT. If USE_RELA_P is true, we use RELA |
| relocations; otherwise, we use REL relocations. */ |
| |
| boolean |
| _bfd_elf_init_reloc_shdr (abfd, rel_hdr, asect, use_rela_p) |
| bfd *abfd; |
| Elf_Internal_Shdr *rel_hdr; |
| asection *asect; |
| boolean use_rela_p; |
| { |
| char *name; |
| struct elf_backend_data *bed; |
| |
| bed = get_elf_backend_data (abfd); |
| name = bfd_alloc (abfd, sizeof ".rela" + strlen (asect->name)); |
| if (name == NULL) |
| return false; |
| sprintf (name, "%s%s", use_rela_p ? ".rela" : ".rel", asect->name); |
| rel_hdr->sh_name = |
| (unsigned int) _bfd_stringtab_add (elf_shstrtab (abfd), name, |
| true, false); |
| if (rel_hdr->sh_name == (unsigned int) -1) |
| return false; |
| rel_hdr->sh_type = use_rela_p ? SHT_RELA : SHT_REL; |
| rel_hdr->sh_entsize = (use_rela_p |
| ? bed->s->sizeof_rela |
| : bed->s->sizeof_rel); |
| rel_hdr->sh_addralign = bed->s->file_align; |
| rel_hdr->sh_flags = 0; |
| rel_hdr->sh_addr = 0; |
| rel_hdr->sh_size = 0; |
| rel_hdr->sh_offset = 0; |
| |
| return true; |
| } |
| |
| /* Set up an ELF internal section header for a section. */ |
| |
| static void |
| elf_fake_sections (abfd, asect, failedptrarg) |
| bfd *abfd; |
| asection *asect; |
| PTR failedptrarg; |
| { |
| struct elf_backend_data *bed = get_elf_backend_data (abfd); |
| boolean *failedptr = (boolean *) failedptrarg; |
| Elf_Internal_Shdr *this_hdr; |
| |
| if (*failedptr) |
| { |
| /* We already failed; just get out of the bfd_map_over_sections |
| loop. */ |
| return; |
| } |
| |
| this_hdr = &elf_section_data (asect)->this_hdr; |
| |
| this_hdr->sh_name = (unsigned long) _bfd_stringtab_add (elf_shstrtab (abfd), |
| asect->name, |
| true, false); |
| if (this_hdr->sh_name == (unsigned long) -1) |
| { |
| *failedptr = true; |
| return; |
| } |
| |
| this_hdr->sh_flags = 0; |
| |
| if ((asect->flags & SEC_ALLOC) != 0 |
| || asect->user_set_vma) |
| this_hdr->sh_addr = asect->vma; |
| else |
| this_hdr->sh_addr = 0; |
| |
| this_hdr->sh_offset = 0; |
| this_hdr->sh_size = asect->_raw_size; |
| this_hdr->sh_link = 0; |
| this_hdr->sh_addralign = 1 << asect->alignment_power; |
| /* The sh_entsize and sh_info fields may have been set already by |
| copy_private_section_data. */ |
| |
| this_hdr->bfd_section = asect; |
| this_hdr->contents = NULL; |
| |
| /* FIXME: This should not be based on section names. */ |
| if (strcmp (asect->name, ".dynstr") == 0) |
| this_hdr->sh_type = SHT_STRTAB; |
| else if (strcmp (asect->name, ".hash") == 0) |
| { |
| this_hdr->sh_type = SHT_HASH; |
| this_hdr->sh_entsize = bed->s->sizeof_hash_entry; |
| } |
| else if (strcmp (asect->name, ".dynsym") == 0) |
| { |
| this_hdr->sh_type = SHT_DYNSYM; |
| this_hdr->sh_entsize = bed->s->sizeof_sym; |
| } |
| else if (strcmp (asect->name, ".dynamic") == 0) |
| { |
| this_hdr->sh_type = SHT_DYNAMIC; |
| this_hdr->sh_entsize = bed->s->sizeof_dyn; |
| } |
| else if (strncmp (asect->name, ".rela", 5) == 0 |
| && get_elf_backend_data (abfd)->may_use_rela_p) |
| { |
| this_hdr->sh_type = SHT_RELA; |
| this_hdr->sh_entsize = bed->s->sizeof_rela; |
| } |
| else if (strncmp (asect->name, ".rel", 4) == 0 |
| && get_elf_backend_data (abfd)->may_use_rel_p) |
| { |
| this_hdr->sh_type = SHT_REL; |
| this_hdr->sh_entsize = bed->s->sizeof_rel; |
| } |
| else if (strncmp (asect->name, ".note", 5) == 0) |
| this_hdr->sh_type = SHT_NOTE; |
| else if (strncmp (asect->name, ".stab", 5) == 0 |
| && strcmp (asect->name + strlen (asect->name) - 3, "str") == 0) |
| this_hdr->sh_type = SHT_STRTAB; |
| else if (strcmp (asect->name, ".gnu.version") == 0) |
| { |
| this_hdr->sh_type = SHT_GNU_versym; |
| this_hdr->sh_entsize = sizeof (Elf_External_Versym); |
| } |
| else if (strcmp (asect->name, ".gnu.version_d") == 0) |
| { |
| this_hdr->sh_type = SHT_GNU_verdef; |
| this_hdr->sh_entsize = 0; |
| /* objcopy or strip will copy over sh_info, but may not set |
| cverdefs. The linker will set cverdefs, but sh_info will be |
| zero. */ |
| if (this_hdr->sh_info == 0) |
| this_hdr->sh_info = elf_tdata (abfd)->cverdefs; |
| else |
| BFD_ASSERT (elf_tdata (abfd)->cverdefs == 0 |
| || this_hdr->sh_info == elf_tdata (abfd)->cverdefs); |
| } |
| else if (strcmp (asect->name, ".gnu.version_r") == 0) |
| { |
| this_hdr->sh_type = SHT_GNU_verneed; |
| this_hdr->sh_entsize = 0; |
| /* objcopy or strip will copy over sh_info, but may not set |
| cverrefs. The linker will set cverrefs, but sh_info will be |
| zero. */ |
| if (this_hdr->sh_info == 0) |
| this_hdr->sh_info = elf_tdata (abfd)->cverrefs; |
| else |
| BFD_ASSERT (elf_tdata (abfd)->cverrefs == 0 |
| || this_hdr->sh_info == elf_tdata (abfd)->cverrefs); |
| } |
| else if ((asect->flags & SEC_ALLOC) != 0 |
| && ((asect->flags & (SEC_LOAD | SEC_HAS_CONTENTS)) == 0)) |
| this_hdr->sh_type = SHT_NOBITS; |
| else |
| this_hdr->sh_type = SHT_PROGBITS; |
| |
| if ((asect->flags & SEC_ALLOC) != 0) |
| this_hdr->sh_flags |= SHF_ALLOC; |
| if ((asect->flags & SEC_READONLY) == 0) |
| this_hdr->sh_flags |= SHF_WRITE; |
| if ((asect->flags & SEC_CODE) != 0) |
| this_hdr->sh_flags |= SHF_EXECINSTR; |
| |
| /* Check for processor-specific section types. */ |
| if (bed->elf_backend_fake_sections) |
| (*bed->elf_backend_fake_sections) (abfd, this_hdr, asect); |
| |
| /* If the section has relocs, set up a section header for the |
| SHT_REL[A] section. If two relocation sections are required for |
| this section, it is up to the processor-specific back-end to |
| create the other. */ |
| if ((asect->flags & SEC_RELOC) != 0 |
| && !_bfd_elf_init_reloc_shdr (abfd, |
| &elf_section_data (asect)->rel_hdr, |
| asect, |
| elf_section_data (asect)->use_rela_p)) |
| *failedptr = true; |
| } |
| |
| /* Assign all ELF section numbers. The dummy first section is handled here |
| too. The link/info pointers for the standard section types are filled |
| in here too, while we're at it. */ |
| |
| static boolean |
| assign_section_numbers (abfd) |
| bfd *abfd; |
| { |
| struct elf_obj_tdata *t = elf_tdata (abfd); |
| asection *sec; |
| unsigned int section_number; |
| Elf_Internal_Shdr **i_shdrp; |
| |
| section_number = 1; |
| |
| for (sec = abfd->sections; sec; sec = sec->next) |
| { |
| struct bfd_elf_section_data *d = elf_section_data (sec); |
| |
| d->this_idx = section_number++; |
| if ((sec->flags & SEC_RELOC) == 0) |
| d->rel_idx = 0; |
| else |
| d->rel_idx = section_number++; |
| |
| if (d->rel_hdr2) |
| d->rel_idx2 = section_number++; |
| else |
| d->rel_idx2 = 0; |
| } |
| |
| t->shstrtab_section = section_number++; |
| elf_elfheader (abfd)->e_shstrndx = t->shstrtab_section; |
| t->shstrtab_hdr.sh_size = _bfd_stringtab_size (elf_shstrtab (abfd)); |
| |
| if (bfd_get_symcount (abfd) > 0) |
| { |
| t->symtab_section = section_number++; |
| t->strtab_section = section_number++; |
| } |
| |
| elf_elfheader (abfd)->e_shnum = section_number; |
| |
| /* Set up the list of section header pointers, in agreement with the |
| indices. */ |
| i_shdrp = ((Elf_Internal_Shdr **) |
| bfd_alloc (abfd, section_number * sizeof (Elf_Internal_Shdr *))); |
| if (i_shdrp == NULL) |
| return false; |
| |
| i_shdrp[0] = ((Elf_Internal_Shdr *) |
| bfd_alloc (abfd, sizeof (Elf_Internal_Shdr))); |
| if (i_shdrp[0] == NULL) |
| { |
| bfd_release (abfd, i_shdrp); |
| return false; |
| } |
| memset (i_shdrp[0], 0, sizeof (Elf_Internal_Shdr)); |
| |
| elf_elfsections (abfd) = i_shdrp; |
| |
| i_shdrp[t->shstrtab_section] = &t->shstrtab_hdr; |
| if (bfd_get_symcount (abfd) > 0) |
| { |
| i_shdrp[t->symtab_section] = &t->symtab_hdr; |
| i_shdrp[t->strtab_section] = &t->strtab_hdr; |
| t->symtab_hdr.sh_link = t->strtab_section; |
| } |
| for (sec = abfd->sections; sec; sec = sec->next) |
| { |
| struct bfd_elf_section_data *d = elf_section_data (sec); |
| asection *s; |
| const char *name; |
| |
| i_shdrp[d->this_idx] = &d->this_hdr; |
| if (d->rel_idx != 0) |
| i_shdrp[d->rel_idx] = &d->rel_hdr; |
| if (d->rel_idx2 != 0) |
| i_shdrp[d->rel_idx2] = d->rel_hdr2; |
| |
| /* Fill in the sh_link and sh_info fields while we're at it. */ |
| |
| /* sh_link of a reloc section is the section index of the symbol |
| table. sh_info is the section index of the section to which |
| the relocation entries apply. */ |
| if (d->rel_idx != 0) |
| { |
| d->rel_hdr.sh_link = t->symtab_section; |
| d->rel_hdr.sh_info = d->this_idx; |
| } |
| if (d->rel_idx2 != 0) |
| { |
| d->rel_hdr2->sh_link = t->symtab_section; |
| d->rel_hdr2->sh_info = d->this_idx; |
| } |
| |
| switch (d->this_hdr.sh_type) |
| { |
| case SHT_REL: |
| case SHT_RELA: |
| /* A reloc section which we are treating as a normal BFD |
| section. sh_link is the section index of the symbol |
| table. sh_info is the section index of the section to |
| which the relocation entries apply. We assume that an |
| allocated reloc section uses the dynamic symbol table. |
| FIXME: How can we be sure? */ |
| s = bfd_get_section_by_name (abfd, ".dynsym"); |
| if (s != NULL) |
| d->this_hdr.sh_link = elf_section_data (s)->this_idx; |
| |
| /* We look up the section the relocs apply to by name. */ |
| name = sec->name; |
| if (d->this_hdr.sh_type == SHT_REL) |
| name += 4; |
| else |
| name += 5; |
| s = bfd_get_section_by_name (abfd, name); |
| if (s != NULL) |
| d->this_hdr.sh_info = elf_section_data (s)->this_idx; |
| break; |
| |
| case SHT_STRTAB: |
| /* We assume that a section named .stab*str is a stabs |
| string section. We look for a section with the same name |
| but without the trailing ``str'', and set its sh_link |
| field to point to this section. */ |
| if (strncmp (sec->name, ".stab", sizeof ".stab" - 1) == 0 |
| && strcmp (sec->name + strlen (sec->name) - 3, "str") == 0) |
| { |
| size_t len; |
| char *alc; |
| |
| len = strlen (sec->name); |
| alc = (char *) bfd_malloc (len - 2); |
| if (alc == NULL) |
| return false; |
| strncpy (alc, sec->name, len - 3); |
| alc[len - 3] = '\0'; |
| s = bfd_get_section_by_name (abfd, alc); |
| free (alc); |
| if (s != NULL) |
| { |
| elf_section_data (s)->this_hdr.sh_link = d->this_idx; |
| |
| /* This is a .stab section. */ |
| elf_section_data (s)->this_hdr.sh_entsize = |
| 4 + 2 * bfd_get_arch_size (abfd) / 8; |
| } |
| } |
| break; |
| |
| case SHT_DYNAMIC: |
| case SHT_DYNSYM: |
| case SHT_GNU_verneed: |
| case SHT_GNU_verdef: |
| /* sh_link is the section header index of the string table |
| used for the dynamic entries, or the symbol table, or the |
| version strings. */ |
| s = bfd_get_section_by_name (abfd, ".dynstr"); |
| if (s != NULL) |
| d->this_hdr.sh_link = elf_section_data (s)->this_idx; |
| break; |
| |
| case SHT_HASH: |
| case SHT_GNU_versym: |
| /* sh_link is the section header index of the symbol table |
| this hash table or version table is for. */ |
| s = bfd_get_section_by_name (abfd, ".dynsym"); |
| if (s != NULL) |
| d->this_hdr.sh_link = elf_section_data (s)->this_idx; |
| break; |
| } |
| } |
| |
| return true; |
| } |
| |
| /* Map symbol from it's internal number to the external number, moving |
| all local symbols to be at the head of the list. */ |
| |
| static INLINE int |
| sym_is_global (abfd, sym) |
| bfd *abfd; |
| asymbol *sym; |
| { |
| /* If the backend has a special mapping, use it. */ |
| if (get_elf_backend_data (abfd)->elf_backend_sym_is_global) |
| return ((*get_elf_backend_data (abfd)->elf_backend_sym_is_global) |
| (abfd, sym)); |
| |
| return ((sym->flags & (BSF_GLOBAL | BSF_WEAK)) != 0 |
| || bfd_is_und_section (bfd_get_section (sym)) |
| || bfd_is_com_section (bfd_get_section (sym))); |
| } |
| |
| static boolean |
| elf_map_symbols (abfd) |
| bfd *abfd; |
| { |
| int symcount = bfd_get_symcount (abfd); |
| asymbol **syms = bfd_get_outsymbols (abfd); |
| asymbol **sect_syms; |
| int num_locals = 0; |
| int num_globals = 0; |
| int num_locals2 = 0; |
| int num_globals2 = 0; |
| int max_index = 0; |
| int num_sections = 0; |
| int idx; |
| asection *asect; |
| asymbol **new_syms; |
| asymbol *sym; |
| |
| #ifdef DEBUG |
| fprintf (stderr, "elf_map_symbols\n"); |
| fflush (stderr); |
| #endif |
| |
| /* Add a section symbol for each BFD section. FIXME: Is this really |
| necessary? */ |
| for (asect = abfd->sections; asect; asect = asect->next) |
| { |
| if (max_index < asect->index) |
| max_index = asect->index; |
| } |
| |
| max_index++; |
| sect_syms = (asymbol **) bfd_zalloc (abfd, max_index * sizeof (asymbol *)); |
| if (sect_syms == NULL) |
| return false; |
| elf_section_syms (abfd) = sect_syms; |
| |
| for (idx = 0; idx < symcount; idx++) |
| { |
| sym = syms[idx]; |
| |
| if ((sym->flags & BSF_SECTION_SYM) != 0 |
| && sym->value == 0) |
| { |
| asection *sec; |
| |
| sec = sym->section; |
| |
| if (sec->owner != NULL) |
| { |
| if (sec->owner != abfd) |
| { |
| if (sec->output_offset != 0) |
| continue; |
| |
| sec = sec->output_section; |
| |
| /* Empty sections in the input files may have had a section |
| symbol created for them. (See the comment near the end of |
| _bfd_generic_link_output_symbols in linker.c). If the linker |
| script discards such sections then we will reach this point. |
| Since we know that we cannot avoid this case, we detect it |
| and skip the abort and the assignment to the sect_syms array. |
| To reproduce this particular case try running the linker |
| testsuite test ld-scripts/weak.exp for an ELF port that uses |
| the generic linker. */ |
| if (sec->owner == NULL) |
| continue; |
| |
| BFD_ASSERT (sec->owner == abfd); |
| } |
| sect_syms[sec->index] = syms[idx]; |
| } |
| } |
| } |
| |
| for (asect = abfd->sections; asect; asect = asect->next) |
| { |
| if (sect_syms[asect->index] != NULL) |
| continue; |
| |
| sym = bfd_make_empty_symbol (abfd); |
| if (sym == NULL) |
| return false; |
| sym->the_bfd = abfd; |
| sym->name = asect->name; |
| sym->value = 0; |
| /* Set the flags to 0 to indicate that this one was newly added. */ |
| sym->flags = 0; |
| sym->section = asect; |
| sect_syms[asect->index] = sym; |
| num_sections++; |
| #ifdef DEBUG |
| fprintf (stderr, |
| _("creating section symbol, name = %s, value = 0x%.8lx, index = %d, section = 0x%.8lx\n"), |
| asect->name, (long) asect->vma, asect->index, (long) asect); |
| #endif |
| } |
| |
| /* Classify all of the symbols. */ |
| for (idx = 0; idx < symcount; idx++) |
| { |
| if (!sym_is_global (abfd, syms[idx])) |
| num_locals++; |
| else |
| num_globals++; |
| } |
| for (asect = abfd->sections; asect; asect = asect->next) |
| { |
| if (sect_syms[asect->index] != NULL |
| && sect_syms[asect->index]->flags == 0) |
| { |
| sect_syms[asect->index]->flags = BSF_SECTION_SYM; |
| if (!sym_is_global (abfd, sect_syms[asect->index])) |
| num_locals++; |
| else |
| num_globals++; |
| sect_syms[asect->index]->flags = 0; |
| } |
| } |
| |
| /* Now sort the symbols so the local symbols are first. */ |
| new_syms = ((asymbol **) |
| bfd_alloc (abfd, |
| (num_locals + num_globals) * sizeof (asymbol *))); |
| if (new_syms == NULL) |
| return false; |
| |
| for (idx = 0; idx < symcount; idx++) |
| { |
| asymbol *sym = syms[idx]; |
| int i; |
| |
| if (!sym_is_global (abfd, sym)) |
| i = num_locals2++; |
| else |
| i = num_locals + num_globals2++; |
| new_syms[i] = sym; |
| sym->udata.i = i + 1; |
| } |
| for (asect = abfd->sections; asect; asect = asect->next) |
| { |
| if (sect_syms[asect->index] != NULL |
| && sect_syms[asect->index]->flags == 0) |
| { |
| asymbol *sym = sect_syms[asect->index]; |
| int i; |
| |
| sym->flags = BSF_SECTION_SYM; |
| if (!sym_is_global (abfd, sym)) |
| i = num_locals2++; |
| else |
| i = num_locals + num_globals2++; |
| new_syms[i] = sym; |
| sym->udata.i = i + 1; |
| } |
| } |
| |
| bfd_set_symtab (abfd, new_syms, num_locals + num_globals); |
| |
| elf_num_locals (abfd) = num_locals; |
| elf_num_globals (abfd) = num_globals; |
| return true; |
| } |
| |
| /* Align to the maximum file alignment that could be required for any |
| ELF data structure. */ |
| |
| static INLINE file_ptr align_file_position PARAMS ((file_ptr, int)); |
| static INLINE file_ptr |
| align_file_position (off, align) |
| file_ptr off; |
| int align; |
| { |
| return (off + align - 1) & ~(align - 1); |
| } |
| |
| /* Assign a file position to a section, optionally aligning to the |
| required section alignment. */ |
| |
| INLINE file_ptr |
| _bfd_elf_assign_file_position_for_section (i_shdrp, offset, align) |
| Elf_Internal_Shdr *i_shdrp; |
| file_ptr offset; |
| boolean align; |
| { |
| if (align) |
| { |
| unsigned int al; |
| |
| al = i_shdrp->sh_addralign; |
| if (al > 1) |
| offset = BFD_ALIGN (offset, al); |
| } |
| i_shdrp->sh_offset = offset; |
| if (i_shdrp->bfd_section != NULL) |
| i_shdrp->bfd_section->filepos = offset; |
| if (i_shdrp->sh_type != SHT_NOBITS) |
| offset += i_shdrp->sh_size; |
| return offset; |
| } |
| |
| /* Compute the file positions we are going to put the sections at, and |
| otherwise prepare to begin writing out the ELF file. If LINK_INFO |
| is not NULL, this is being called by the ELF backend linker. */ |
| |
| boolean |
| _bfd_elf_compute_section_file_positions (abfd, link_info) |
| bfd *abfd; |
| struct bfd_link_info *link_info; |
| { |
| struct elf_backend_data *bed = get_elf_backend_data (abfd); |
| boolean failed; |
| struct bfd_strtab_hash *strtab; |
| Elf_Internal_Shdr *shstrtab_hdr; |
| |
| if (abfd->output_has_begun) |
| return true; |
| |
| /* Do any elf backend specific processing first. */ |
| if (bed->elf_backend_begin_write_processing) |
| (*bed->elf_backend_begin_write_processing) (abfd, link_info); |
| |
| if (! prep_headers (abfd)) |
| return false; |
| |
| /* Post process the headers if necessary. */ |
| if (bed->elf_backend_post_process_headers) |
| (*bed->elf_backend_post_process_headers) (abfd, link_info); |
| |
| failed = false; |
| bfd_map_over_sections (abfd, elf_fake_sections, &failed); |
| if (failed) |
| return false; |
| |
| if (!assign_section_numbers (abfd)) |
| return false; |
| |
| /* The backend linker builds symbol table information itself. */ |
| if (link_info == NULL && bfd_get_symcount (abfd) > 0) |
| { |
| /* Non-zero if doing a relocatable link. */ |
| int relocatable_p = ! (abfd->flags & (EXEC_P | DYNAMIC)); |
| |
| if (! swap_out_syms (abfd, &strtab, relocatable_p)) |
| return false; |
| } |
| |
| shstrtab_hdr = &elf_tdata (abfd)->shstrtab_hdr; |
| /* sh_name was set in prep_headers. */ |
| shstrtab_hdr->sh_type = SHT_STRTAB; |
| shstrtab_hdr->sh_flags = 0; |
| shstrtab_hdr->sh_addr = 0; |
| shstrtab_hdr->sh_size = _bfd_stringtab_size (elf_shstrtab (abfd)); |
| shstrtab_hdr->sh_entsize = 0; |
| shstrtab_hdr->sh_link = 0; |
| shstrtab_hdr->sh_info = 0; |
| /* sh_offset is set in assign_file_positions_except_relocs. */ |
| shstrtab_hdr->sh_addralign = 1; |
| |
| if (!assign_file_positions_except_relocs (abfd)) |
| return false; |
| |
| if (link_info == NULL && bfd_get_symcount (abfd) > 0) |
| { |
| file_ptr off; |
| Elf_Internal_Shdr *hdr; |
| |
| off = elf_tdata (abfd)->next_file_pos; |
| |
| hdr = &elf_tdata (abfd)->symtab_hdr; |
| off = _bfd_elf_assign_file_position_for_section (hdr, off, true); |
| |
| hdr = &elf_tdata (abfd)->strtab_hdr; |
| off = _bfd_elf_assign_file_position_for_section (hdr, off, true); |
| |
| elf_tdata (abfd)->next_file_pos = off; |
| |
| /* Now that we know where the .strtab section goes, write it |
| out. */ |
| if (bfd_seek (abfd, hdr->sh_offset, SEEK_SET) != 0 |
| || ! _bfd_stringtab_emit (abfd, strtab)) |
| return false; |
| _bfd_stringtab_free (strtab); |
| } |
| |
| abfd->output_has_begun = true; |
| |
| return true; |
| } |
| |
| /* Create a mapping from a set of sections to a program segment. */ |
| |
| static INLINE struct elf_segment_map * |
| make_mapping (abfd, sections, from, to, phdr) |
| bfd *abfd; |
| asection **sections; |
| unsigned int from; |
| unsigned int to; |
| boolean phdr; |
| { |
| struct elf_segment_map *m; |
| unsigned int i; |
| asection **hdrpp; |
| |
| m = ((struct elf_segment_map *) |
| bfd_zalloc (abfd, |
| (sizeof (struct elf_segment_map) |
| + (to - from - 1) * sizeof (asection *)))); |
| if (m == NULL) |
| return NULL; |
| m->next = NULL; |
| m->p_type = PT_LOAD; |
| for (i = from, hdrpp = sections + from; i < to; i++, hdrpp++) |
| m->sections[i - from] = *hdrpp; |
| m->count = to - from; |
| |
| if (from == 0 && phdr) |
| { |
| /* Include the headers in the first PT_LOAD segment. */ |
| m->includes_filehdr = 1; |
| m->includes_phdrs = 1; |
| } |
| |
| return m; |
| } |
| |
| /* Set up a mapping from BFD sections to program segments. */ |
| |
| static boolean |
| map_sections_to_segments (abfd) |
| bfd *abfd; |
| { |
| asection **sections = NULL; |
| asection *s; |
| unsigned int i; |
| unsigned int count; |
| struct elf_segment_map *mfirst; |
| struct elf_segment_map **pm; |
| struct elf_segment_map *m; |
| asection *last_hdr; |
| unsigned int phdr_index; |
| bfd_vma maxpagesize; |
| asection **hdrpp; |
| boolean phdr_in_segment = true; |
| boolean writable; |
| asection *dynsec; |
| |
| if (elf_tdata (abfd)->segment_map != NULL) |
| return true; |
| |
| if (bfd_count_sections (abfd) == 0) |
| return true; |
| |
| /* Select the allocated sections, and sort them. */ |
| |
| sections = (asection **) bfd_malloc (bfd_count_sections (abfd) |
| * sizeof (asection *)); |
| if (sections == NULL) |
| goto error_return; |
| |
| i = 0; |
| for (s = abfd->sections; s != NULL; s = s->next) |
| { |
| if ((s->flags & SEC_ALLOC) != 0) |
| { |
| sections[i] = s; |
| ++i; |
| } |
| } |
| BFD_ASSERT (i <= bfd_count_sections (abfd)); |
| count = i; |
| |
| qsort (sections, (size_t) count, sizeof (asection *), elf_sort_sections); |
| |
| /* Build the mapping. */ |
| |
| mfirst = NULL; |
| pm = &mfirst; |
| |
| /* If we have a .interp section, then create a PT_PHDR segment for |
| the program headers and a PT_INTERP segment for the .interp |
| section. */ |
| s = bfd_get_section_by_name (abfd, ".interp"); |
| if (s != NULL && (s->flags & SEC_LOAD) != 0) |
| { |
| m = ((struct elf_segment_map *) |
| bfd_zalloc (abfd, sizeof (struct elf_segment_map))); |
| if (m == NULL) |
| goto error_return; |
| m->next = NULL; |
| m->p_type = PT_PHDR; |
| /* FIXME: UnixWare and Solaris set PF_X, Irix 5 does not. */ |
| m->p_flags = PF_R | PF_X; |
| m->p_flags_valid = 1; |
| m->includes_phdrs = 1; |
| |
| *pm = m; |
| pm = &m->next; |
| |
| m = ((struct elf_segment_map *) |
| bfd_zalloc (abfd, sizeof (struct elf_segment_map))); |
| if (m == NULL) |
| goto error_return; |
| m->next = NULL; |
| m->p_type = PT_INTERP; |
| m->count = 1; |
| m->sections[0] = s; |
| |
| *pm = m; |
| pm = &m->next; |
| } |
| |
| /* Look through the sections. We put sections in the same program |
| segment when the start of the second section can be placed within |
| a few bytes of the end of the first section. */ |
| last_hdr = NULL; |
| phdr_index = 0; |
| maxpagesize = get_elf_backend_data (abfd)->maxpagesize; |
| writable = false; |
| dynsec = bfd_get_section_by_name (abfd, ".dynamic"); |
| if (dynsec != NULL |
| && (dynsec->flags & SEC_LOAD) == 0) |
| dynsec = NULL; |
| |
| /* Deal with -Ttext or something similar such that the first section |
| is not adjacent to the program headers. This is an |
| approximation, since at this point we don't know exactly how many |
| program headers we will need. */ |
| if (count > 0) |
| { |
| bfd_size_type phdr_size; |
| |
| phdr_size = elf_tdata (abfd)->program_header_size; |
| if (phdr_size == 0) |
| phdr_size = get_elf_backend_data (abfd)->s->sizeof_phdr; |
| if ((abfd->flags & D_PAGED) == 0 |
| || sections[0]->lma < phdr_size |
| || sections[0]->lma % maxpagesize < phdr_size % maxpagesize) |
| phdr_in_segment = false; |
| } |
| |
| for (i = 0, hdrpp = sections; i < count; i++, hdrpp++) |
| { |
| asection *hdr; |
| boolean new_segment; |
| |
| hdr = *hdrpp; |
| |
| /* See if this section and the last one will fit in the same |
| segment. */ |
| |
| if (last_hdr == NULL) |
| { |
| /* If we don't have a segment yet, then we don't need a new |
| one (we build the last one after this loop). */ |
| new_segment = false; |
| } |
| else if (last_hdr->lma - last_hdr->vma != hdr->lma - hdr->vma) |
| { |
| /* If this section has a different relation between the |
| virtual address and the load address, then we need a new |
| segment. */ |
| new_segment = true; |
| } |
| else if (BFD_ALIGN (last_hdr->lma + last_hdr->_raw_size, maxpagesize) |
| < BFD_ALIGN (hdr->lma, maxpagesize)) |
| { |
| /* If putting this section in this segment would force us to |
| skip a page in the segment, then we need a new segment. */ |
| new_segment = true; |
| } |
| else if ((last_hdr->flags & SEC_LOAD) == 0 |
| && (hdr->flags & SEC_LOAD) != 0) |
| { |
| /* We don't want to put a loadable section after a |
| nonloadable section in the same segment. */ |
| new_segment = true; |
| } |
| else if ((abfd->flags & D_PAGED) == 0) |
| { |
| /* If the file is not demand paged, which means that we |
| don't require the sections to be correctly aligned in the |
| file, then there is no other reason for a new segment. */ |
| new_segment = false; |
| } |
| else if (! writable |
| && (hdr->flags & SEC_READONLY) == 0 |
| && (BFD_ALIGN (last_hdr->lma + last_hdr->_raw_size, maxpagesize) |
| == hdr->lma)) |
| { |
| /* We don't want to put a writable section in a read only |
| segment, unless they are on the same page in memory |
| anyhow. We already know that the last section does not |
| bring us past the current section on the page, so the |
| only case in which the new section is not on the same |
| page as the previous section is when the previous section |
| ends precisely on a page boundary. */ |
| new_segment = true; |
| } |
| else |
| { |
| /* Otherwise, we can use the same segment. */ |
| new_segment = false; |
| } |
| |
| if (! new_segment) |
| { |
| if ((hdr->flags & SEC_READONLY) == 0) |
| writable = true; |
| last_hdr = hdr; |
| continue; |
| } |
| |
| /* We need a new program segment. We must create a new program |
| header holding all the sections from phdr_index until hdr. */ |
| |
| m = make_mapping (abfd, sections, phdr_index, i, phdr_in_segment); |
| if (m == NULL) |
| goto error_return; |
| |
| *pm = m; |
| pm = &m->next; |
| |
| if ((hdr->flags & SEC_READONLY) == 0) |
| writable = true; |
| else |
| writable = false; |
| |
| last_hdr = hdr; |
| phdr_index = i; |
| phdr_in_segment = false; |
| } |
| |
| /* Create a final PT_LOAD program segment. */ |
| if (last_hdr != NULL) |
| { |
| m = make_mapping (abfd, sections, phdr_index, i, phdr_in_segment); |
| if (m == NULL) |
| goto error_return; |
| |
| *pm = m; |
| pm = &m->next; |
| } |
| |
| /* If there is a .dynamic section, throw in a PT_DYNAMIC segment. */ |
| if (dynsec != NULL) |
| { |
| m = ((struct elf_segment_map *) |
| bfd_zalloc (abfd, sizeof (struct elf_segment_map))); |
| if (m == NULL) |
| goto error_return; |
| m->next = NULL; |
| m->p_type = PT_DYNAMIC; |
| m->count = 1; |
| m->sections[0] = dynsec; |
| |
| *pm = m; |
| pm = &m->next; |
| } |
| |
| /* For each loadable .note section, add a PT_NOTE segment. We don't |
| use bfd_get_section_by_name, because if we link together |
| nonloadable .note sections and loadable .note sections, we will |
| generate two .note sections in the output file. FIXME: Using |
| names for section types is bogus anyhow. */ |
| for (s = abfd->sections; s != NULL; s = s->next) |
| { |
| if ((s->flags & SEC_LOAD) != 0 |
| && strncmp (s->name, ".note", 5) == 0) |
| { |
| m = ((struct elf_segment_map *) |
| bfd_zalloc (abfd, sizeof (struct elf_segment_map))); |
| if (m == NULL) |
| goto error_return; |
| m->next = NULL; |
| m->p_type = PT_NOTE; |
| m->count = 1; |
| m->sections[0] = s; |
| |
| *pm = m; |
| pm = &m->next; |
| } |
| } |
| |
| free (sections); |
| sections = NULL; |
| |
| elf_tdata (abfd)->segment_map = mfirst; |
| return true; |
| |
| error_return: |
| if (sections != NULL) |
| free (sections); |
| return false; |
| } |
| |
| /* Sort sections by address. */ |
| |
| static int |
| elf_sort_sections (arg1, arg2) |
| const PTR arg1; |
| const PTR arg2; |
| { |
| const asection *sec1 = *(const asection **) arg1; |
| const asection *sec2 = *(const asection **) arg2; |
| |
| /* Sort by LMA first, since this is the address used to |
| place the section into a segment. */ |
| if (sec1->lma < sec2->lma) |
| return -1; |
| else if (sec1->lma > sec2->lma) |
| return 1; |
| |
| /* Then sort by VMA. Normally the LMA and the VMA will be |
| the same, and this will do nothing. */ |
| if (sec1->vma < sec2->vma) |
| return -1; |
| else if (sec1->vma > sec2->vma) |
| return 1; |
| |
| /* Put !SEC_LOAD sections after SEC_LOAD ones. */ |
| |
| #define TOEND(x) (((x)->flags & SEC_LOAD) == 0) |
| |
| if (TOEND (sec1)) |
| { |
| if (TOEND (sec2)) |
| return sec1->target_index - sec2->target_index; |
| else |
| return 1; |
| } |
| |
| if (TOEND (sec2)) |
| return -1; |
| |
| #undef TOEND |
| |
| /* Sort by size, to put zero sized sections before others at the |
| same address. */ |
| |
| if (sec1->_raw_size < sec2->_raw_size) |
| return -1; |
| if (sec1->_raw_size > sec2->_raw_size) |
| return 1; |
| |
| return sec1->target_index - sec2->target_index; |
|