| /* Alpha specific support for 64-bit ELF |
| Copyright (C) 1996-2024 Free Software Foundation, Inc. |
| Contributed by Richard Henderson <rth@tamu.edu>. |
| |
| 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 3 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., 51 Franklin Street - Fifth Floor, Boston, |
| MA 02110-1301, USA. */ |
| |
| |
| /* We need a published ABI spec for this. Until one comes out, don't |
| assume this'll remain unchanged forever. */ |
| |
| #include "sysdep.h" |
| #include "bfd.h" |
| #include "libbfd.h" |
| #include "elf-bfd.h" |
| #include "ecoff-bfd.h" |
| |
| #include "elf/alpha.h" |
| |
| #define ALPHAECOFF |
| |
| #define NO_COFF_RELOCS |
| #define NO_COFF_SYMBOLS |
| #define NO_COFF_LINENOS |
| |
| /* Get the ECOFF swapping routines. Needed for the debug information. */ |
| #include "coff/internal.h" |
| #include "coff/sym.h" |
| #include "coff/symconst.h" |
| #include "coff/ecoff.h" |
| #include "coff/alpha.h" |
| #include "aout/ar.h" |
| #include "libcoff.h" |
| #include "libecoff.h" |
| #define ECOFF_64 |
| #include "ecoffswap.h" |
| |
| |
| /* Instruction data for plt generation and relaxation. */ |
| |
| #define OP_LDA 0x08U |
| #define OP_LDAH 0x09U |
| #define OP_LDQ 0x29U |
| #define OP_BR 0x30U |
| #define OP_BSR 0x34U |
| |
| #define INSN_LDA (OP_LDA << 26) |
| #define INSN_LDAH (OP_LDAH << 26) |
| #define INSN_LDQ (OP_LDQ << 26) |
| #define INSN_BR (OP_BR << 26) |
| |
| #define INSN_ADDQ 0x40000400 |
| #define INSN_RDUNIQ 0x0000009e |
| #define INSN_SUBQ 0x40000520 |
| #define INSN_S4SUBQ 0x40000560 |
| #define INSN_UNOP 0x2ffe0000 |
| |
| #define INSN_JSR 0x68004000 |
| #define INSN_JMP 0x68000000 |
| #define INSN_JSR_MASK 0xfc00c000 |
| |
| #define INSN_A(I,A) (I | ((unsigned) A << 21)) |
| #define INSN_AB(I,A,B) (INSN_A (I, A) | (B << 16)) |
| #define INSN_ABC(I,A,B,C) (INSN_A (I, A) | (B << 16) | C) |
| #define INSN_ABO(I,A,B,O) (INSN_A (I, A) | (B << 16) | ((O) & 0xffff)) |
| #define INSN_AD(I,A,D) (INSN_A (I, A) | (((D) >> 2) & 0x1fffff)) |
| |
| /* PLT/GOT Stuff */ |
| |
| /* Set by ld emulation. Putting this into the link_info or hash structure |
| is simply working too hard. */ |
| #ifdef USE_SECUREPLT |
| bool elf64_alpha_use_secureplt = true; |
| #else |
| bool elf64_alpha_use_secureplt = false; |
| #endif |
| |
| #define OLD_PLT_HEADER_SIZE 32 |
| #define OLD_PLT_ENTRY_SIZE 12 |
| #define NEW_PLT_HEADER_SIZE 36 |
| #define NEW_PLT_ENTRY_SIZE 4 |
| |
| #define PLT_HEADER_SIZE \ |
| (elf64_alpha_use_secureplt ? NEW_PLT_HEADER_SIZE : OLD_PLT_HEADER_SIZE) |
| #define PLT_ENTRY_SIZE \ |
| (elf64_alpha_use_secureplt ? NEW_PLT_ENTRY_SIZE : OLD_PLT_ENTRY_SIZE) |
| |
| #define MAX_GOT_SIZE (64*1024) |
| |
| #define ELF_DYNAMIC_INTERPRETER "/usr/lib/ld.so" |
| |
| |
| /* Used to implement multiple .got subsections. */ |
| struct alpha_elf_got_entry |
| { |
| struct alpha_elf_got_entry *next; |
| |
| /* Which .got subsection? */ |
| bfd *gotobj; |
| |
| /* The addend in effect for this entry. */ |
| bfd_vma addend; |
| |
| /* The .got offset for this entry. */ |
| int got_offset; |
| |
| /* The .plt offset for this entry. */ |
| int plt_offset; |
| |
| /* How many references to this entry? */ |
| int use_count; |
| |
| /* The relocation type of this entry. */ |
| unsigned char reloc_type; |
| |
| /* How a LITERAL is used. */ |
| unsigned char flags; |
| |
| /* Have we initialized the dynamic relocation for this entry? */ |
| unsigned char reloc_done; |
| |
| /* Have we adjusted this entry for SEC_MERGE? */ |
| unsigned char reloc_xlated; |
| }; |
| |
| struct alpha_elf_reloc_entry |
| { |
| struct alpha_elf_reloc_entry *next; |
| |
| /* Which .reloc section? */ |
| asection *srel; |
| |
| /* Which section this relocation is against? */ |
| asection *sec; |
| |
| /* How many did we find? */ |
| unsigned long count; |
| |
| /* What kind of relocation? */ |
| unsigned int rtype; |
| }; |
| |
| struct alpha_elf_link_hash_entry |
| { |
| struct elf_link_hash_entry root; |
| |
| /* External symbol information. */ |
| EXTR esym; |
| |
| /* Cumulative flags for all the .got entries. */ |
| int flags; |
| |
| /* Contexts in which a literal was referenced. */ |
| #define ALPHA_ELF_LINK_HASH_LU_ADDR 0x01 |
| #define ALPHA_ELF_LINK_HASH_LU_MEM 0x02 |
| #define ALPHA_ELF_LINK_HASH_LU_BYTE 0x04 |
| #define ALPHA_ELF_LINK_HASH_LU_JSR 0x08 |
| #define ALPHA_ELF_LINK_HASH_LU_TLSGD 0x10 |
| #define ALPHA_ELF_LINK_HASH_LU_TLSLDM 0x20 |
| #define ALPHA_ELF_LINK_HASH_LU_JSRDIRECT 0x40 |
| #define ALPHA_ELF_LINK_HASH_LU_PLT 0x38 |
| #define ALPHA_ELF_LINK_HASH_TLS_IE 0x80 |
| |
| /* Used to implement multiple .got subsections. */ |
| struct alpha_elf_got_entry *got_entries; |
| |
| /* Used to count non-got, non-plt relocations for delayed sizing |
| of relocation sections. */ |
| struct alpha_elf_reloc_entry *reloc_entries; |
| }; |
| |
| /* Alpha ELF linker hash table. */ |
| |
| struct alpha_elf_link_hash_table |
| { |
| struct elf_link_hash_table root; |
| |
| /* The head of a list of .got subsections linked through |
| alpha_elf_tdata(abfd)->got_link_next. */ |
| bfd *got_list; |
| |
| /* The most recent relax pass that we've seen. The GOTs |
| should be regenerated if this doesn't match. */ |
| int relax_trip; |
| }; |
| |
| /* Look up an entry in a Alpha ELF linker hash table. */ |
| |
| #define alpha_elf_link_hash_lookup(table, string, create, copy, follow) \ |
| ((struct alpha_elf_link_hash_entry *) \ |
| elf_link_hash_lookup (&(table)->root, (string), (create), \ |
| (copy), (follow))) |
| |
| /* Traverse a Alpha ELF linker hash table. */ |
| |
| #define alpha_elf_link_hash_traverse(table, func, info) \ |
| (elf_link_hash_traverse \ |
| (&(table)->root, \ |
| (bool (*) (struct elf_link_hash_entry *, void *)) (func), \ |
| (info))) |
| |
| /* Get the Alpha ELF linker hash table from a link_info structure. */ |
| |
| #define alpha_elf_hash_table(p) \ |
| ((is_elf_hash_table ((p)->hash) \ |
| && elf_hash_table_id (elf_hash_table (p)) == ALPHA_ELF_DATA) \ |
| ? (struct alpha_elf_link_hash_table *) (p)->hash : NULL) |
| |
| /* Get the object's symbols as our own entry type. */ |
| |
| #define alpha_elf_sym_hashes(abfd) \ |
| ((struct alpha_elf_link_hash_entry **)elf_sym_hashes(abfd)) |
| |
| /* Should we do dynamic things to this symbol? This differs from the |
| generic version in that we never need to consider function pointer |
| equality wrt PLT entries -- we don't create a PLT entry if a symbol's |
| address is ever taken. */ |
| |
| static inline bool |
| alpha_elf_dynamic_symbol_p (struct elf_link_hash_entry *h, |
| struct bfd_link_info *info) |
| { |
| return _bfd_elf_dynamic_symbol_p (h, info, 0); |
| } |
| |
| /* Create an entry in a Alpha ELF linker hash table. */ |
| |
| static struct bfd_hash_entry * |
| elf64_alpha_link_hash_newfunc (struct bfd_hash_entry *entry, |
| struct bfd_hash_table *table, |
| const char *string) |
| { |
| struct alpha_elf_link_hash_entry *ret = |
| (struct alpha_elf_link_hash_entry *) entry; |
| |
| /* Allocate the structure if it has not already been allocated by a |
| subclass. */ |
| if (ret == (struct alpha_elf_link_hash_entry *) NULL) |
| ret = ((struct alpha_elf_link_hash_entry *) |
| bfd_hash_allocate (table, |
| sizeof (struct alpha_elf_link_hash_entry))); |
| if (ret == (struct alpha_elf_link_hash_entry *) NULL) |
| return (struct bfd_hash_entry *) ret; |
| |
| /* Call the allocation method of the superclass. */ |
| ret = ((struct alpha_elf_link_hash_entry *) |
| _bfd_elf_link_hash_newfunc ((struct bfd_hash_entry *) ret, |
| table, string)); |
| if (ret != (struct alpha_elf_link_hash_entry *) NULL) |
| { |
| /* Set local fields. */ |
| memset (&ret->esym, 0, sizeof (EXTR)); |
| /* We use -2 as a marker to indicate that the information has |
| not been set. -1 means there is no associated ifd. */ |
| ret->esym.ifd = -2; |
| ret->flags = 0; |
| ret->got_entries = NULL; |
| ret->reloc_entries = NULL; |
| } |
| |
| return (struct bfd_hash_entry *) ret; |
| } |
| |
| /* Create a Alpha ELF linker hash table. */ |
| |
| static struct bfd_link_hash_table * |
| elf64_alpha_bfd_link_hash_table_create (bfd *abfd) |
| { |
| struct alpha_elf_link_hash_table *ret; |
| size_t amt = sizeof (struct alpha_elf_link_hash_table); |
| |
| ret = (struct alpha_elf_link_hash_table *) bfd_zmalloc (amt); |
| if (ret == (struct alpha_elf_link_hash_table *) NULL) |
| return NULL; |
| |
| if (!_bfd_elf_link_hash_table_init (&ret->root, abfd, |
| elf64_alpha_link_hash_newfunc, |
| sizeof (struct alpha_elf_link_hash_entry), |
| ALPHA_ELF_DATA)) |
| { |
| free (ret); |
| return NULL; |
| } |
| |
| return &ret->root.root; |
| } |
| |
| /* Alpha ELF follows MIPS ELF in using a special find_nearest_line |
| routine in order to handle the ECOFF debugging information. */ |
| |
| struct alpha_elf_find_line |
| { |
| struct ecoff_debug_info d; |
| struct ecoff_find_line i; |
| }; |
| |
| /* We have some private fields hanging off of the elf_tdata structure. */ |
| |
| struct alpha_elf_obj_tdata |
| { |
| struct elf_obj_tdata root; |
| |
| /* For every input file, these are the got entries for that object's |
| local symbols. */ |
| struct alpha_elf_got_entry ** local_got_entries; |
| |
| /* For every input file, this is the object that owns the got that |
| this input file uses. */ |
| bfd *gotobj; |
| |
| /* For every got, this is a linked list through the objects using this got */ |
| bfd *in_got_link_next; |
| |
| /* For every got, this is a link to the next got subsegment. */ |
| bfd *got_link_next; |
| |
| /* For every got, this is the section. */ |
| asection *got; |
| |
| /* For every got, this is it's total number of words. */ |
| int total_got_size; |
| |
| /* For every got, this is the sum of the number of words required |
| to hold all of the member object's local got. */ |
| int local_got_size; |
| |
| /* Used by elf64_alpha_find_nearest_line entry point. */ |
| struct alpha_elf_find_line *find_line_info; |
| |
| }; |
| |
| #define alpha_elf_tdata(abfd) \ |
| ((struct alpha_elf_obj_tdata *) (abfd)->tdata.any) |
| |
| #define is_alpha_elf(bfd) \ |
| (bfd_get_flavour (bfd) == bfd_target_elf_flavour \ |
| && elf_tdata (bfd) != NULL \ |
| && elf_object_id (bfd) == ALPHA_ELF_DATA) |
| |
| static bool |
| elf64_alpha_mkobject (bfd *abfd) |
| { |
| return bfd_elf_allocate_object (abfd, sizeof (struct alpha_elf_obj_tdata), |
| ALPHA_ELF_DATA); |
| } |
| |
| static bool |
| elf64_alpha_object_p (bfd *abfd) |
| { |
| /* Set the right machine number for an Alpha ELF file. */ |
| return bfd_default_set_arch_mach (abfd, bfd_arch_alpha, 0); |
| } |
| |
| /* A relocation function which doesn't do anything. */ |
| |
| static bfd_reloc_status_type |
| elf64_alpha_reloc_nil (bfd *abfd ATTRIBUTE_UNUSED, arelent *reloc, |
| asymbol *sym ATTRIBUTE_UNUSED, |
| void * data ATTRIBUTE_UNUSED, asection *sec, |
| bfd *output_bfd, char **error_message ATTRIBUTE_UNUSED) |
| { |
| if (output_bfd) |
| reloc->address += sec->output_offset; |
| return bfd_reloc_ok; |
| } |
| |
| /* A relocation function used for an unsupported reloc. */ |
| |
| static bfd_reloc_status_type |
| elf64_alpha_reloc_bad (bfd *abfd ATTRIBUTE_UNUSED, arelent *reloc, |
| asymbol *sym ATTRIBUTE_UNUSED, |
| void * data ATTRIBUTE_UNUSED, asection *sec, |
| bfd *output_bfd, char **error_message ATTRIBUTE_UNUSED) |
| { |
| if (output_bfd) |
| reloc->address += sec->output_offset; |
| return bfd_reloc_notsupported; |
| } |
| |
| /* Do the work of the GPDISP relocation. */ |
| |
| static bfd_reloc_status_type |
| elf64_alpha_do_reloc_gpdisp (bfd *abfd, bfd_vma gpdisp, bfd_byte *p_ldah, |
| bfd_byte *p_lda) |
| { |
| bfd_reloc_status_type ret = bfd_reloc_ok; |
| bfd_vma addend; |
| unsigned long i_ldah, i_lda; |
| |
| i_ldah = bfd_get_32 (abfd, p_ldah); |
| i_lda = bfd_get_32 (abfd, p_lda); |
| |
| /* Complain if the instructions are not correct. */ |
| if (((i_ldah >> 26) & 0x3f) != 0x09 |
| || ((i_lda >> 26) & 0x3f) != 0x08) |
| ret = bfd_reloc_dangerous; |
| |
| /* Extract the user-supplied offset, mirroring the sign extensions |
| that the instructions perform. */ |
| addend = ((i_ldah & 0xffff) << 16) | (i_lda & 0xffff); |
| addend = (addend ^ 0x80008000) - 0x80008000; |
| |
| gpdisp += addend; |
| |
| if ((bfd_signed_vma) gpdisp < -(bfd_signed_vma) 0x80000000 |
| || (bfd_signed_vma) gpdisp >= (bfd_signed_vma) 0x7fff8000) |
| ret = bfd_reloc_overflow; |
| |
| /* compensate for the sign extension again. */ |
| i_ldah = ((i_ldah & 0xffff0000) |
| | (((gpdisp >> 16) + ((gpdisp >> 15) & 1)) & 0xffff)); |
| i_lda = (i_lda & 0xffff0000) | (gpdisp & 0xffff); |
| |
| bfd_put_32 (abfd, (bfd_vma) i_ldah, p_ldah); |
| bfd_put_32 (abfd, (bfd_vma) i_lda, p_lda); |
| |
| return ret; |
| } |
| |
| /* The special function for the GPDISP reloc. */ |
| |
| static bfd_reloc_status_type |
| elf64_alpha_reloc_gpdisp (bfd *abfd, arelent *reloc_entry, |
| asymbol *sym ATTRIBUTE_UNUSED, void * data, |
| asection *input_section, bfd *output_bfd, |
| char **err_msg) |
| { |
| bfd_reloc_status_type ret; |
| bfd_vma gp, relocation; |
| bfd_vma high_address; |
| bfd_byte *p_ldah, *p_lda; |
| |
| /* Don't do anything if we're not doing a final link. */ |
| if (output_bfd) |
| { |
| reloc_entry->address += input_section->output_offset; |
| return bfd_reloc_ok; |
| } |
| |
| high_address = bfd_get_section_limit (abfd, input_section); |
| if (reloc_entry->address > high_address |
| || reloc_entry->address + reloc_entry->addend > high_address) |
| return bfd_reloc_outofrange; |
| |
| /* The gp used in the portion of the output object to which this |
| input object belongs is cached on the input bfd. */ |
| gp = _bfd_get_gp_value (abfd); |
| |
| relocation = (input_section->output_section->vma |
| + input_section->output_offset |
| + reloc_entry->address); |
| |
| p_ldah = (bfd_byte *) data + reloc_entry->address; |
| p_lda = p_ldah + reloc_entry->addend; |
| |
| ret = elf64_alpha_do_reloc_gpdisp (abfd, gp - relocation, p_ldah, p_lda); |
| |
| /* Complain if the instructions are not correct. */ |
| if (ret == bfd_reloc_dangerous) |
| *err_msg = _("GPDISP relocation did not find ldah and lda instructions"); |
| |
| return ret; |
| } |
| |
| /* In case we're on a 32-bit machine, construct a 64-bit "-1" value |
| from smaller values. Start with zero, widen, *then* decrement. */ |
| #define MINUS_ONE (((bfd_vma)0) - 1) |
| |
| |
| #define SKIP_HOWTO(N) \ |
| HOWTO(N, 0, 0, 0, 0, 0, complain_overflow_dont, elf64_alpha_reloc_bad, 0, 0, 0, 0, 0) |
| |
| static reloc_howto_type elf64_alpha_howto_table[] = |
| { |
| HOWTO (R_ALPHA_NONE, /* type */ |
| 0, /* rightshift */ |
| 0, /* size */ |
| 0, /* bitsize */ |
| true, /* pc_relative */ |
| 0, /* bitpos */ |
| complain_overflow_dont, /* complain_on_overflow */ |
| elf64_alpha_reloc_nil, /* special_function */ |
| "NONE", /* name */ |
| false, /* partial_inplace */ |
| 0, /* src_mask */ |
| 0, /* dst_mask */ |
| true), /* pcrel_offset */ |
| |
| /* A 32 bit reference to a symbol. */ |
| HOWTO (R_ALPHA_REFLONG, /* type */ |
| 0, /* rightshift */ |
| 4, /* size */ |
| 32, /* bitsize */ |
| false, /* pc_relative */ |
| 0, /* bitpos */ |
| complain_overflow_bitfield, /* complain_on_overflow */ |
| bfd_elf_generic_reloc, /* special_function */ |
| "REFLONG", /* name */ |
| false, /* partial_inplace */ |
| 0xffffffff, /* src_mask */ |
| 0xffffffff, /* dst_mask */ |
| false), /* pcrel_offset */ |
| |
| /* A 64 bit reference to a symbol. */ |
| HOWTO (R_ALPHA_REFQUAD, /* type */ |
| 0, /* rightshift */ |
| 8, /* size */ |
| 64, /* bitsize */ |
| false, /* pc_relative */ |
| 0, /* bitpos */ |
| complain_overflow_bitfield, /* complain_on_overflow */ |
| bfd_elf_generic_reloc, /* special_function */ |
| "REFQUAD", /* name */ |
| false, /* partial_inplace */ |
| MINUS_ONE, /* src_mask */ |
| MINUS_ONE, /* dst_mask */ |
| false), /* pcrel_offset */ |
| |
| /* A 32 bit GP relative offset. This is just like REFLONG except |
| that when the value is used the value of the gp register will be |
| added in. */ |
| HOWTO (R_ALPHA_GPREL32, /* type */ |
| 0, /* rightshift */ |
| 4, /* size */ |
| 32, /* bitsize */ |
| false, /* pc_relative */ |
| 0, /* bitpos */ |
| complain_overflow_bitfield, /* complain_on_overflow */ |
| bfd_elf_generic_reloc, /* special_function */ |
| "GPREL32", /* name */ |
| false, /* partial_inplace */ |
| 0xffffffff, /* src_mask */ |
| 0xffffffff, /* dst_mask */ |
| false), /* pcrel_offset */ |
| |
| /* Used for an instruction that refers to memory off the GP register. */ |
| HOWTO (R_ALPHA_LITERAL, /* type */ |
| 0, /* rightshift */ |
| 2, /* size */ |
| 16, /* bitsize */ |
| false, /* pc_relative */ |
| 0, /* bitpos */ |
| complain_overflow_signed, /* complain_on_overflow */ |
| bfd_elf_generic_reloc, /* special_function */ |
| "ELF_LITERAL", /* name */ |
| false, /* partial_inplace */ |
| 0xffff, /* src_mask */ |
| 0xffff, /* dst_mask */ |
| false), /* pcrel_offset */ |
| |
| /* This reloc only appears immediately following an ELF_LITERAL reloc. |
| It identifies a use of the literal. The symbol index is special: |
| 1 means the literal address is in the base register of a memory |
| format instruction; 2 means the literal address is in the byte |
| offset register of a byte-manipulation instruction; 3 means the |
| literal address is in the target register of a jsr instruction. |
| This does not actually do any relocation. */ |
| HOWTO (R_ALPHA_LITUSE, /* type */ |
| 0, /* rightshift */ |
| 2, /* size */ |
| 32, /* bitsize */ |
| false, /* pc_relative */ |
| 0, /* bitpos */ |
| complain_overflow_dont, /* complain_on_overflow */ |
| elf64_alpha_reloc_nil, /* special_function */ |
| "LITUSE", /* name */ |
| false, /* partial_inplace */ |
| 0, /* src_mask */ |
| 0, /* dst_mask */ |
| false), /* pcrel_offset */ |
| |
| /* Load the gp register. This is always used for a ldah instruction |
| which loads the upper 16 bits of the gp register. The symbol |
| index of the GPDISP instruction is an offset in bytes to the lda |
| instruction that loads the lower 16 bits. The value to use for |
| the relocation is the difference between the GP value and the |
| current location; the load will always be done against a register |
| holding the current address. |
| |
| NOTE: Unlike ECOFF, partial in-place relocation is not done. If |
| any offset is present in the instructions, it is an offset from |
| the register to the ldah instruction. This lets us avoid any |
| stupid hackery like inventing a gp value to do partial relocation |
| against. Also unlike ECOFF, we do the whole relocation off of |
| the GPDISP rather than a GPDISP_HI16/GPDISP_LO16 pair. An odd, |
| space consuming bit, that, since all the information was present |
| in the GPDISP_HI16 reloc. */ |
| HOWTO (R_ALPHA_GPDISP, /* type */ |
| 16, /* rightshift */ |
| 4, /* size */ |
| 16, /* bitsize */ |
| false, /* pc_relative */ |
| 0, /* bitpos */ |
| complain_overflow_dont, /* complain_on_overflow */ |
| elf64_alpha_reloc_gpdisp, /* special_function */ |
| "GPDISP", /* name */ |
| false, /* partial_inplace */ |
| 0xffff, /* src_mask */ |
| 0xffff, /* dst_mask */ |
| true), /* pcrel_offset */ |
| |
| /* A 21 bit branch. */ |
| HOWTO (R_ALPHA_BRADDR, /* type */ |
| 2, /* rightshift */ |
| 4, /* size */ |
| 21, /* bitsize */ |
| true, /* pc_relative */ |
| 0, /* bitpos */ |
| complain_overflow_signed, /* complain_on_overflow */ |
| bfd_elf_generic_reloc, /* special_function */ |
| "BRADDR", /* name */ |
| false, /* partial_inplace */ |
| 0x1fffff, /* src_mask */ |
| 0x1fffff, /* dst_mask */ |
| true), /* pcrel_offset */ |
| |
| /* A hint for a jump to a register. */ |
| HOWTO (R_ALPHA_HINT, /* type */ |
| 2, /* rightshift */ |
| 2, /* size */ |
| 14, /* bitsize */ |
| true, /* pc_relative */ |
| 0, /* bitpos */ |
| complain_overflow_dont, /* complain_on_overflow */ |
| bfd_elf_generic_reloc, /* special_function */ |
| "HINT", /* name */ |
| false, /* partial_inplace */ |
| 0x3fff, /* src_mask */ |
| 0x3fff, /* dst_mask */ |
| true), /* pcrel_offset */ |
| |
| /* 16 bit PC relative offset. */ |
| HOWTO (R_ALPHA_SREL16, /* type */ |
| 0, /* rightshift */ |
| 2, /* size */ |
| 16, /* bitsize */ |
| true, /* pc_relative */ |
| 0, /* bitpos */ |
| complain_overflow_signed, /* complain_on_overflow */ |
| bfd_elf_generic_reloc, /* special_function */ |
| "SREL16", /* name */ |
| false, /* partial_inplace */ |
| 0xffff, /* src_mask */ |
| 0xffff, /* dst_mask */ |
| true), /* pcrel_offset */ |
| |
| /* 32 bit PC relative offset. */ |
| HOWTO (R_ALPHA_SREL32, /* type */ |
| 0, /* rightshift */ |
| 4, /* size */ |
| 32, /* bitsize */ |
| true, /* pc_relative */ |
| 0, /* bitpos */ |
| complain_overflow_signed, /* complain_on_overflow */ |
| bfd_elf_generic_reloc, /* special_function */ |
| "SREL32", /* name */ |
| false, /* partial_inplace */ |
| 0xffffffff, /* src_mask */ |
| 0xffffffff, /* dst_mask */ |
| true), /* pcrel_offset */ |
| |
| /* A 64 bit PC relative offset. */ |
| HOWTO (R_ALPHA_SREL64, /* type */ |
| 0, /* rightshift */ |
| 8, /* size */ |
| 64, /* bitsize */ |
| true, /* pc_relative */ |
| 0, /* bitpos */ |
| complain_overflow_signed, /* complain_on_overflow */ |
| bfd_elf_generic_reloc, /* special_function */ |
| "SREL64", /* name */ |
| false, /* partial_inplace */ |
| MINUS_ONE, /* src_mask */ |
| MINUS_ONE, /* dst_mask */ |
| true), /* pcrel_offset */ |
| |
| /* Skip 12 - 16; deprecated ECOFF relocs. */ |
| SKIP_HOWTO (12), |
| SKIP_HOWTO (13), |
| SKIP_HOWTO (14), |
| SKIP_HOWTO (15), |
| SKIP_HOWTO (16), |
| |
| /* The high 16 bits of the displacement from GP to the target. */ |
| HOWTO (R_ALPHA_GPRELHIGH, |
| 0, /* rightshift */ |
| 2, /* size */ |
| 16, /* bitsize */ |
| false, /* pc_relative */ |
| 0, /* bitpos */ |
| complain_overflow_signed, /* complain_on_overflow */ |
| bfd_elf_generic_reloc, /* special_function */ |
| "GPRELHIGH", /* name */ |
| false, /* partial_inplace */ |
| 0xffff, /* src_mask */ |
| 0xffff, /* dst_mask */ |
| false), /* pcrel_offset */ |
| |
| /* The low 16 bits of the displacement from GP to the target. */ |
| HOWTO (R_ALPHA_GPRELLOW, |
| 0, /* rightshift */ |
| 2, /* size */ |
| 16, /* bitsize */ |
| false, /* pc_relative */ |
| 0, /* bitpos */ |
| complain_overflow_dont, /* complain_on_overflow */ |
| bfd_elf_generic_reloc, /* special_function */ |
| "GPRELLOW", /* name */ |
| false, /* partial_inplace */ |
| 0xffff, /* src_mask */ |
| 0xffff, /* dst_mask */ |
| false), /* pcrel_offset */ |
| |
| /* A 16-bit displacement from the GP to the target. */ |
| HOWTO (R_ALPHA_GPREL16, |
| 0, /* rightshift */ |
| 2, /* size */ |
| 16, /* bitsize */ |
| false, /* pc_relative */ |
| 0, /* bitpos */ |
| complain_overflow_signed, /* complain_on_overflow */ |
| bfd_elf_generic_reloc, /* special_function */ |
| "GPREL16", /* name */ |
| false, /* partial_inplace */ |
| 0xffff, /* src_mask */ |
| 0xffff, /* dst_mask */ |
| false), /* pcrel_offset */ |
| |
| /* Skip 20 - 23; deprecated ECOFF relocs. */ |
| SKIP_HOWTO (20), |
| SKIP_HOWTO (21), |
| SKIP_HOWTO (22), |
| SKIP_HOWTO (23), |
| |
| /* Misc ELF relocations. */ |
| |
| /* A dynamic relocation to copy the target into our .dynbss section. */ |
| /* Not generated, as all Alpha objects use PIC, so it is not needed. It |
| is present because every other ELF has one, but should not be used |
| because .dynbss is an ugly thing. */ |
| HOWTO (R_ALPHA_COPY, |
| 0, |
| 0, |
| 0, |
| false, |
| 0, |
| complain_overflow_dont, |
| bfd_elf_generic_reloc, |
| "COPY", |
| false, |
| 0, |
| 0, |
| true), |
| |
| /* A dynamic relocation for a .got entry. */ |
| HOWTO (R_ALPHA_GLOB_DAT, |
| 0, |
| 0, |
| 0, |
| false, |
| 0, |
| complain_overflow_dont, |
| bfd_elf_generic_reloc, |
| "GLOB_DAT", |
| false, |
| 0, |
| 0, |
| true), |
| |
| /* A dynamic relocation for a .plt entry. */ |
| HOWTO (R_ALPHA_JMP_SLOT, |
| 0, |
| 0, |
| 0, |
| false, |
| 0, |
| complain_overflow_dont, |
| bfd_elf_generic_reloc, |
| "JMP_SLOT", |
| false, |
| 0, |
| 0, |
| true), |
| |
| /* A dynamic relocation to add the base of the DSO to a 64-bit field. */ |
| HOWTO (R_ALPHA_RELATIVE, |
| 0, |
| 0, |
| 0, |
| false, |
| 0, |
| complain_overflow_dont, |
| bfd_elf_generic_reloc, |
| "RELATIVE", |
| false, |
| 0, |
| 0, |
| true), |
| |
| /* A 21 bit branch that adjusts for gp loads. */ |
| HOWTO (R_ALPHA_BRSGP, /* type */ |
| 2, /* rightshift */ |
| 4, /* size */ |
| 21, /* bitsize */ |
| true, /* pc_relative */ |
| 0, /* bitpos */ |
| complain_overflow_signed, /* complain_on_overflow */ |
| bfd_elf_generic_reloc, /* special_function */ |
| "BRSGP", /* name */ |
| false, /* partial_inplace */ |
| 0x1fffff, /* src_mask */ |
| 0x1fffff, /* dst_mask */ |
| true), /* pcrel_offset */ |
| |
| /* Creates a tls_index for the symbol in the got. */ |
| HOWTO (R_ALPHA_TLSGD, /* type */ |
| 0, /* rightshift */ |
| 2, /* size */ |
| 16, /* bitsize */ |
| false, /* pc_relative */ |
| 0, /* bitpos */ |
| complain_overflow_signed, /* complain_on_overflow */ |
| bfd_elf_generic_reloc, /* special_function */ |
| "TLSGD", /* name */ |
| false, /* partial_inplace */ |
| 0xffff, /* src_mask */ |
| 0xffff, /* dst_mask */ |
| false), /* pcrel_offset */ |
| |
| /* Creates a tls_index for the (current) module in the got. */ |
| HOWTO (R_ALPHA_TLSLDM, /* type */ |
| 0, /* rightshift */ |
| 2, /* size */ |
| 16, /* bitsize */ |
| false, /* pc_relative */ |
| 0, /* bitpos */ |
| complain_overflow_signed, /* complain_on_overflow */ |
| bfd_elf_generic_reloc, /* special_function */ |
| "TLSLDM", /* name */ |
| false, /* partial_inplace */ |
| 0xffff, /* src_mask */ |
| 0xffff, /* dst_mask */ |
| false), /* pcrel_offset */ |
| |
| /* A dynamic relocation for a DTP module entry. */ |
| HOWTO (R_ALPHA_DTPMOD64, /* type */ |
| 0, /* rightshift */ |
| 8, /* size */ |
| 64, /* bitsize */ |
| false, /* pc_relative */ |
| 0, /* bitpos */ |
| complain_overflow_bitfield, /* complain_on_overflow */ |
| bfd_elf_generic_reloc, /* special_function */ |
| "DTPMOD64", /* name */ |
| false, /* partial_inplace */ |
| MINUS_ONE, /* src_mask */ |
| MINUS_ONE, /* dst_mask */ |
| false), /* pcrel_offset */ |
| |
| /* Creates a 64-bit offset in the got for the displacement |
| from DTP to the target. */ |
| HOWTO (R_ALPHA_GOTDTPREL, /* type */ |
| 0, /* rightshift */ |
| 2, /* size */ |
| 16, /* bitsize */ |
| false, /* pc_relative */ |
| 0, /* bitpos */ |
| complain_overflow_signed, /* complain_on_overflow */ |
| bfd_elf_generic_reloc, /* special_function */ |
| "GOTDTPREL", /* name */ |
| false, /* partial_inplace */ |
| 0xffff, /* src_mask */ |
| 0xffff, /* dst_mask */ |
| false), /* pcrel_offset */ |
| |
| /* A dynamic relocation for a displacement from DTP to the target. */ |
| HOWTO (R_ALPHA_DTPREL64, /* type */ |
| 0, /* rightshift */ |
| 8, /* size */ |
| 64, /* bitsize */ |
| false, /* pc_relative */ |
| 0, /* bitpos */ |
| complain_overflow_bitfield, /* complain_on_overflow */ |
| bfd_elf_generic_reloc, /* special_function */ |
| "DTPREL64", /* name */ |
| false, /* partial_inplace */ |
| MINUS_ONE, /* src_mask */ |
| MINUS_ONE, /* dst_mask */ |
| false), /* pcrel_offset */ |
| |
| /* The high 16 bits of the displacement from DTP to the target. */ |
| HOWTO (R_ALPHA_DTPRELHI, /* type */ |
| 0, /* rightshift */ |
| 2, /* size */ |
| 16, /* bitsize */ |
| false, /* pc_relative */ |
| 0, /* bitpos */ |
| complain_overflow_signed, /* complain_on_overflow */ |
| bfd_elf_generic_reloc, /* special_function */ |
| "DTPRELHI", /* name */ |
| false, /* partial_inplace */ |
| 0xffff, /* src_mask */ |
| 0xffff, /* dst_mask */ |
| false), /* pcrel_offset */ |
| |
| /* The low 16 bits of the displacement from DTP to the target. */ |
| HOWTO (R_ALPHA_DTPRELLO, /* type */ |
| 0, /* rightshift */ |
| 2, /* size */ |
| 16, /* bitsize */ |
| false, /* pc_relative */ |
| 0, /* bitpos */ |
| complain_overflow_dont, /* complain_on_overflow */ |
| bfd_elf_generic_reloc, /* special_function */ |
| "DTPRELLO", /* name */ |
| false, /* partial_inplace */ |
| 0xffff, /* src_mask */ |
| 0xffff, /* dst_mask */ |
| false), /* pcrel_offset */ |
| |
| /* A 16-bit displacement from DTP to the target. */ |
| HOWTO (R_ALPHA_DTPREL16, /* type */ |
| 0, /* rightshift */ |
| 2, /* size */ |
| 16, /* bitsize */ |
| false, /* pc_relative */ |
| 0, /* bitpos */ |
| complain_overflow_signed, /* complain_on_overflow */ |
| bfd_elf_generic_reloc, /* special_function */ |
| "DTPREL16", /* name */ |
| false, /* partial_inplace */ |
| 0xffff, /* src_mask */ |
| 0xffff, /* dst_mask */ |
| false), /* pcrel_offset */ |
| |
| /* Creates a 64-bit offset in the got for the displacement |
| from TP to the target. */ |
| HOWTO (R_ALPHA_GOTTPREL, /* type */ |
| 0, /* rightshift */ |
| 2, /* size */ |
| 16, /* bitsize */ |
| false, /* pc_relative */ |
| 0, /* bitpos */ |
| complain_overflow_signed, /* complain_on_overflow */ |
| bfd_elf_generic_reloc, /* special_function */ |
| "GOTTPREL", /* name */ |
| false, /* partial_inplace */ |
| 0xffff, /* src_mask */ |
| 0xffff, /* dst_mask */ |
| false), /* pcrel_offset */ |
| |
| /* A dynamic relocation for a displacement from TP to the target. */ |
| HOWTO (R_ALPHA_TPREL64, /* type */ |
| 0, /* rightshift */ |
| 8, /* size */ |
| 64, /* bitsize */ |
| false, /* pc_relative */ |
| 0, /* bitpos */ |
| complain_overflow_bitfield, /* complain_on_overflow */ |
| bfd_elf_generic_reloc, /* special_function */ |
| "TPREL64", /* name */ |
| false, /* partial_inplace */ |
| MINUS_ONE, /* src_mask */ |
| MINUS_ONE, /* dst_mask */ |
| false), /* pcrel_offset */ |
| |
| /* The high 16 bits of the displacement from TP to the target. */ |
| HOWTO (R_ALPHA_TPRELHI, /* type */ |
| 0, /* rightshift */ |
| 2, /* size */ |
| 16, /* bitsize */ |
| false, /* pc_relative */ |
| 0, /* bitpos */ |
| complain_overflow_signed, /* complain_on_overflow */ |
| bfd_elf_generic_reloc, /* special_function */ |
| "TPRELHI", /* name */ |
| false, /* partial_inplace */ |
| 0xffff, /* src_mask */ |
| 0xffff, /* dst_mask */ |
| false), /* pcrel_offset */ |
| |
| /* The low 16 bits of the displacement from TP to the target. */ |
| HOWTO (R_ALPHA_TPRELLO, /* type */ |
| 0, /* rightshift */ |
| 2, /* size */ |
| 16, /* bitsize */ |
| false, /* pc_relative */ |
| 0, /* bitpos */ |
| complain_overflow_dont, /* complain_on_overflow */ |
| bfd_elf_generic_reloc, /* special_function */ |
| "TPRELLO", /* name */ |
| false, /* partial_inplace */ |
| 0xffff, /* src_mask */ |
| 0xffff, /* dst_mask */ |
| false), /* pcrel_offset */ |
| |
| /* A 16-bit displacement from TP to the target. */ |
| HOWTO (R_ALPHA_TPREL16, /* type */ |
| 0, /* rightshift */ |
| 2, /* size */ |
| 16, /* bitsize */ |
| false, /* pc_relative */ |
| 0, /* bitpos */ |
| complain_overflow_signed, /* complain_on_overflow */ |
| bfd_elf_generic_reloc, /* special_function */ |
| "TPREL16", /* name */ |
| false, /* partial_inplace */ |
| 0xffff, /* src_mask */ |
| 0xffff, /* dst_mask */ |
| false), /* pcrel_offset */ |
| }; |
| |
| /* A mapping from BFD reloc types to Alpha ELF reloc types. */ |
| |
| struct elf_reloc_map |
| { |
| bfd_reloc_code_real_type bfd_reloc_val; |
| int elf_reloc_val; |
| }; |
| |
| static const struct elf_reloc_map elf64_alpha_reloc_map[] = |
| { |
| {BFD_RELOC_NONE, R_ALPHA_NONE}, |
| {BFD_RELOC_32, R_ALPHA_REFLONG}, |
| {BFD_RELOC_64, R_ALPHA_REFQUAD}, |
| {BFD_RELOC_CTOR, R_ALPHA_REFQUAD}, |
| {BFD_RELOC_GPREL32, R_ALPHA_GPREL32}, |
| {BFD_RELOC_ALPHA_ELF_LITERAL, R_ALPHA_LITERAL}, |
| {BFD_RELOC_ALPHA_LITUSE, R_ALPHA_LITUSE}, |
| {BFD_RELOC_ALPHA_GPDISP, R_ALPHA_GPDISP}, |
| {BFD_RELOC_23_PCREL_S2, R_ALPHA_BRADDR}, |
| {BFD_RELOC_ALPHA_HINT, R_ALPHA_HINT}, |
| {BFD_RELOC_16_PCREL, R_ALPHA_SREL16}, |
| {BFD_RELOC_32_PCREL, R_ALPHA_SREL32}, |
| {BFD_RELOC_64_PCREL, R_ALPHA_SREL64}, |
| {BFD_RELOC_ALPHA_GPREL_HI16, R_ALPHA_GPRELHIGH}, |
| {BFD_RELOC_ALPHA_GPREL_LO16, R_ALPHA_GPRELLOW}, |
| {BFD_RELOC_GPREL16, R_ALPHA_GPREL16}, |
| {BFD_RELOC_ALPHA_BRSGP, R_ALPHA_BRSGP}, |
| {BFD_RELOC_ALPHA_TLSGD, R_ALPHA_TLSGD}, |
| {BFD_RELOC_ALPHA_TLSLDM, R_ALPHA_TLSLDM}, |
| {BFD_RELOC_ALPHA_DTPMOD64, R_ALPHA_DTPMOD64}, |
| {BFD_RELOC_ALPHA_GOTDTPREL16, R_ALPHA_GOTDTPREL}, |
| {BFD_RELOC_ALPHA_DTPREL64, R_ALPHA_DTPREL64}, |
| {BFD_RELOC_ALPHA_DTPREL_HI16, R_ALPHA_DTPRELHI}, |
| {BFD_RELOC_ALPHA_DTPREL_LO16, R_ALPHA_DTPRELLO}, |
| {BFD_RELOC_ALPHA_DTPREL16, R_ALPHA_DTPREL16}, |
| {BFD_RELOC_ALPHA_GOTTPREL16, R_ALPHA_GOTTPREL}, |
| {BFD_RELOC_ALPHA_TPREL64, R_ALPHA_TPREL64}, |
| {BFD_RELOC_ALPHA_TPREL_HI16, R_ALPHA_TPRELHI}, |
| {BFD_RELOC_ALPHA_TPREL_LO16, R_ALPHA_TPRELLO}, |
| {BFD_RELOC_ALPHA_TPREL16, R_ALPHA_TPREL16}, |
| }; |
| |
| /* Given a BFD reloc type, return a HOWTO structure. */ |
| |
| static reloc_howto_type * |
| elf64_alpha_bfd_reloc_type_lookup (bfd *abfd ATTRIBUTE_UNUSED, |
| bfd_reloc_code_real_type code) |
| { |
| const struct elf_reloc_map *i, *e; |
| i = e = elf64_alpha_reloc_map; |
| e += sizeof (elf64_alpha_reloc_map) / sizeof (struct elf_reloc_map); |
| for (; i != e; ++i) |
| { |
| if (i->bfd_reloc_val == code) |
| return &elf64_alpha_howto_table[i->elf_reloc_val]; |
| } |
| return 0; |
| } |
| |
| static reloc_howto_type * |
| elf64_alpha_bfd_reloc_name_lookup (bfd *abfd ATTRIBUTE_UNUSED, |
| const char *r_name) |
| { |
| unsigned int i; |
| |
| for (i = 0; |
| i < (sizeof (elf64_alpha_howto_table) |
| / sizeof (elf64_alpha_howto_table[0])); |
| i++) |
| if (elf64_alpha_howto_table[i].name != NULL |
| && strcasecmp (elf64_alpha_howto_table[i].name, r_name) == 0) |
| return &elf64_alpha_howto_table[i]; |
| |
| return NULL; |
| } |
| |
| /* Given an Alpha ELF reloc type, fill in an arelent structure. */ |
| |
| static bool |
| elf64_alpha_info_to_howto (bfd *abfd, arelent *cache_ptr, |
| Elf_Internal_Rela *dst) |
| { |
| unsigned r_type = ELF64_R_TYPE(dst->r_info); |
| |
| if (r_type >= R_ALPHA_max) |
| { |
| /* xgettext:c-format */ |
| _bfd_error_handler (_("%pB: unsupported relocation type %#x"), |
| abfd, r_type); |
| bfd_set_error (bfd_error_bad_value); |
| return false; |
| } |
| cache_ptr->howto = &elf64_alpha_howto_table[r_type]; |
| return true; |
| } |
| |
| /* These two relocations create a two-word entry in the got. */ |
| #define alpha_got_entry_size(r_type) \ |
| (r_type == R_ALPHA_TLSGD || r_type == R_ALPHA_TLSLDM ? 16 : 8) |
| |
| /* This is PT_TLS segment p_vaddr. */ |
| #define alpha_get_dtprel_base(info) \ |
| (elf_hash_table (info)->tls_sec->vma) |
| |
| /* Main program TLS (whose template starts at PT_TLS p_vaddr) |
| is assigned offset round(16, PT_TLS p_align). */ |
| #define alpha_get_tprel_base(info) \ |
| (elf_hash_table (info)->tls_sec->vma \ |
| - align_power ((bfd_vma) 16, \ |
| elf_hash_table (info)->tls_sec->alignment_power)) |
| |
| /* Handle an Alpha specific section when reading an object file. This |
| is called when bfd_section_from_shdr finds a section with an unknown |
| type. */ |
| |
| static bool |
| elf64_alpha_section_from_shdr (bfd *abfd, |
| Elf_Internal_Shdr *hdr, |
| const char *name, |
| int shindex) |
| { |
| asection *newsect; |
| |
| /* There ought to be a place to keep ELF backend specific flags, but |
| at the moment there isn't one. We just keep track of the |
| sections by their name, instead. Fortunately, the ABI gives |
| suggested names for all the MIPS specific sections, so we will |
| probably get away with this. */ |
| switch (hdr->sh_type) |
| { |
| case SHT_ALPHA_DEBUG: |
| if (strcmp (name, ".mdebug") != 0) |
| return false; |
| break; |
| default: |
| return false; |
| } |
| |
| if (! _bfd_elf_make_section_from_shdr (abfd, hdr, name, shindex)) |
| return false; |
| newsect = hdr->bfd_section; |
| |
| if (hdr->sh_type == SHT_ALPHA_DEBUG) |
| { |
| if (!bfd_set_section_flags (newsect, |
| bfd_section_flags (newsect) | SEC_DEBUGGING)) |
| return false; |
| } |
| |
| return true; |
| } |
| |
| /* Convert Alpha specific section flags to bfd internal section flags. */ |
| |
| static bool |
| elf64_alpha_section_flags (const Elf_Internal_Shdr *hdr) |
| { |
| if (hdr->sh_flags & SHF_ALPHA_GPREL) |
| hdr->bfd_section->flags |= SEC_SMALL_DATA; |
| |
| return true; |
| } |
| |
| /* Set the correct type for an Alpha ELF section. We do this by the |
| section name, which is a hack, but ought to work. */ |
| |
| static bool |
| elf64_alpha_fake_sections (bfd *abfd, Elf_Internal_Shdr *hdr, asection *sec) |
| { |
| register const char *name; |
| |
| name = bfd_section_name (sec); |
| |
| if (strcmp (name, ".mdebug") == 0) |
| { |
| hdr->sh_type = SHT_ALPHA_DEBUG; |
| /* In a shared object on Irix 5.3, the .mdebug section has an |
| entsize of 0. FIXME: Does this matter? */ |
| if ((abfd->flags & DYNAMIC) != 0 ) |
| hdr->sh_entsize = 0; |
| else |
| hdr->sh_entsize = 1; |
| } |
| else if ((sec->flags & SEC_SMALL_DATA) |
| || strcmp (name, ".sdata") == 0 |
| || strcmp (name, ".sbss") == 0 |
| || strcmp (name, ".lit4") == 0 |
| || strcmp (name, ".lit8") == 0) |
| hdr->sh_flags |= SHF_ALPHA_GPREL; |
| |
| return true; |
| } |
| |
| /* Hook called by the linker routine which adds symbols from an object |
| file. We use it to put .comm items in .sbss, and not .bss. */ |
| |
| static bool |
| elf64_alpha_add_symbol_hook (bfd *abfd, struct bfd_link_info *info, |
| Elf_Internal_Sym *sym, |
| const char **namep ATTRIBUTE_UNUSED, |
| flagword *flagsp ATTRIBUTE_UNUSED, |
| asection **secp, bfd_vma *valp) |
| { |
| if (sym->st_shndx == SHN_COMMON |
| && !bfd_link_relocatable (info) |
| && sym->st_size <= elf_gp_size (abfd)) |
| { |
| /* Common symbols less than or equal to -G nn bytes are |
| automatically put into .sbss. */ |
| |
| asection *scomm = bfd_get_section_by_name (abfd, ".scommon"); |
| |
| if (scomm == NULL) |
| { |
| scomm = bfd_make_section_with_flags (abfd, ".scommon", |
| (SEC_ALLOC |
| | SEC_IS_COMMON |
| | SEC_SMALL_DATA |
| | SEC_LINKER_CREATED)); |
| if (scomm == NULL) |
| return false; |
| } |
| |
| *secp = scomm; |
| *valp = sym->st_size; |
| } |
| |
| return true; |
| } |
| |
| /* Create the .got section. */ |
| |
| static bool |
| elf64_alpha_create_got_section (bfd *abfd, |
| struct bfd_link_info *info ATTRIBUTE_UNUSED) |
| { |
| flagword flags; |
| asection *s; |
| |
| if (! is_alpha_elf (abfd)) |
| return false; |
| |
| flags = (SEC_ALLOC | SEC_LOAD | SEC_HAS_CONTENTS | SEC_IN_MEMORY |
| | SEC_LINKER_CREATED); |
| s = bfd_make_section_anyway_with_flags (abfd, ".got", flags); |
| if (s == NULL |
| || !bfd_set_section_alignment (s, 3)) |
| return false; |
| |
| alpha_elf_tdata (abfd)->got = s; |
| |
| /* Make sure the object's gotobj is set to itself so that we default |
| to every object with its own .got. We'll merge .gots later once |
| we've collected each object's info. */ |
| alpha_elf_tdata (abfd)->gotobj = abfd; |
| |
| return true; |
| } |
| |
| /* Create all the dynamic sections. */ |
| |
| static bool |
| elf64_alpha_create_dynamic_sections (bfd *abfd, struct bfd_link_info *info) |
| { |
| asection *s; |
| flagword flags; |
| struct elf_link_hash_entry *h; |
| |
| if (! is_alpha_elf (abfd)) |
| return false; |
| |
| /* We need to create .plt, .rela.plt, .got, and .rela.got sections. */ |
| |
| flags = (SEC_ALLOC | SEC_LOAD | SEC_CODE | SEC_HAS_CONTENTS | SEC_IN_MEMORY |
| | SEC_LINKER_CREATED |
| | (elf64_alpha_use_secureplt ? SEC_READONLY : 0)); |
| s = bfd_make_section_anyway_with_flags (abfd, ".plt", flags); |
| elf_hash_table (info)->splt = s; |
| if (s == NULL || ! bfd_set_section_alignment (s, 4)) |
| return false; |
| |
| /* Define the symbol _PROCEDURE_LINKAGE_TABLE_ at the start of the |
| .plt section. */ |
| h = _bfd_elf_define_linkage_sym (abfd, info, s, |
| "_PROCEDURE_LINKAGE_TABLE_"); |
| elf_hash_table (info)->hplt = h; |
| if (h == NULL) |
| return false; |
| |
| flags = (SEC_ALLOC | SEC_LOAD | SEC_HAS_CONTENTS | SEC_IN_MEMORY |
| | SEC_LINKER_CREATED | SEC_READONLY); |
| s = bfd_make_section_anyway_with_flags (abfd, ".rela.plt", flags); |
| elf_hash_table (info)->srelplt = s; |
| if (s == NULL || ! bfd_set_section_alignment (s, 3)) |
| return false; |
| |
| if (elf64_alpha_use_secureplt) |
| { |
| flags = SEC_ALLOC | SEC_LINKER_CREATED; |
| s = bfd_make_section_anyway_with_flags (abfd, ".got.plt", flags); |
| elf_hash_table (info)->sgotplt = s; |
| if (s == NULL || ! bfd_set_section_alignment (s, 3)) |
| return false; |
| } |
| |
| /* We may or may not have created a .got section for this object, but |
| we definitely havn't done the rest of the work. */ |
| |
| if (alpha_elf_tdata(abfd)->gotobj == NULL) |
| { |
| if (!elf64_alpha_create_got_section (abfd, info)) |
| return false; |
| } |
| |
| flags = (SEC_ALLOC | SEC_LOAD | SEC_HAS_CONTENTS | SEC_IN_MEMORY |
| | SEC_LINKER_CREATED | SEC_READONLY); |
| s = bfd_make_section_anyway_with_flags (abfd, ".rela.got", flags); |
| elf_hash_table (info)->srelgot = s; |
| if (s == NULL |
| || !bfd_set_section_alignment (s, 3)) |
| return false; |
| |
| /* Define the symbol _GLOBAL_OFFSET_TABLE_ at the start of the |
| dynobj's .got section. We don't do this in the linker script |
| because we don't want to define the symbol if we are not creating |
| a global offset table. */ |
| h = _bfd_elf_define_linkage_sym (abfd, info, alpha_elf_tdata(abfd)->got, |
| "_GLOBAL_OFFSET_TABLE_"); |
| elf_hash_table (info)->hgot = h; |
| if (h == NULL) |
| return false; |
| |
| return true; |
| } |
| |
| /* Read ECOFF debugging information from a .mdebug section into a |
| ecoff_debug_info structure. */ |
| |
| static bool |
| elf64_alpha_read_ecoff_info (bfd *abfd, asection *section, |
| struct ecoff_debug_info *debug) |
| { |
| HDRR *symhdr; |
| const struct ecoff_debug_swap *swap; |
| char *ext_hdr = NULL; |
| |
| swap = get_elf_backend_data (abfd)->elf_backend_ecoff_debug_swap; |
| memset (debug, 0, sizeof (*debug)); |
| |
| ext_hdr = (char *) bfd_malloc (swap->external_hdr_size); |
| if (ext_hdr == NULL && swap->external_hdr_size != 0) |
| goto error_return; |
| |
| if (! bfd_get_section_contents (abfd, section, ext_hdr, (file_ptr) 0, |
| swap->external_hdr_size)) |
| goto error_return; |
| |
| symhdr = &debug->symbolic_header; |
| (*swap->swap_hdr_in) (abfd, ext_hdr, symhdr); |
| |
| /* The symbolic header contains absolute file offsets and sizes to |
| read. */ |
| #define READ(ptr, offset, count, size, type) \ |
| do \ |
| { \ |
| size_t amt; \ |
| debug->ptr = NULL; \ |
| if (symhdr->count == 0) \ |
| break; \ |
| if (_bfd_mul_overflow (size, symhdr->count, &amt)) \ |
| { \ |
| bfd_set_error (bfd_error_file_too_big); \ |
| goto error_return; \ |
| } \ |
| if (bfd_seek (abfd, symhdr->offset, SEEK_SET) != 0) \ |
| goto error_return; \ |
| debug->ptr = (type) _bfd_malloc_and_read (abfd, amt, amt); \ |
| if (debug->ptr == NULL) \ |
| goto error_return; \ |
| } while (0) |
| |
| READ (line, cbLineOffset, cbLine, sizeof (unsigned char), unsigned char *); |
| READ (external_dnr, cbDnOffset, idnMax, swap->external_dnr_size, void *); |
| READ (external_pdr, cbPdOffset, ipdMax, swap->external_pdr_size, void *); |
| READ (external_sym, cbSymOffset, isymMax, swap->external_sym_size, void *); |
| READ (external_opt, cbOptOffset, ioptMax, swap->external_opt_size, void *); |
| READ (external_aux, cbAuxOffset, iauxMax, sizeof (union aux_ext), |
| union aux_ext *); |
| READ (ss, cbSsOffset, issMax, sizeof (char), char *); |
| READ (ssext, cbSsExtOffset, issExtMax, sizeof (char), char *); |
| READ (external_fdr, cbFdOffset, ifdMax, swap->external_fdr_size, void *); |
| READ (external_rfd, cbRfdOffset, crfd, swap->external_rfd_size, void *); |
| READ (external_ext, cbExtOffset, iextMax, swap->external_ext_size, void *); |
| #undef READ |
| |
| debug->fdr = NULL; |
| |
| return true; |
| |
| error_return: |
| free (ext_hdr); |
| _bfd_ecoff_free_ecoff_debug_info (debug); |
| return false; |
| } |
| |
| /* Alpha ELF local labels start with '$'. */ |
| |
| static bool |
| elf64_alpha_is_local_label_name (bfd *abfd ATTRIBUTE_UNUSED, const char *name) |
| { |
| return name[0] == '$'; |
| } |
| |
| static bool |
| elf64_alpha_find_nearest_line (bfd *abfd, asymbol **symbols, |
| asection *section, bfd_vma offset, |
| const char **filename_ptr, |
| const char **functionname_ptr, |
| unsigned int *line_ptr, |
| unsigned int *discriminator_ptr) |
| { |
| asection *msec; |
| |
| if (_bfd_dwarf2_find_nearest_line (abfd, symbols, NULL, section, offset, |
| filename_ptr, functionname_ptr, |
| line_ptr, discriminator_ptr, |
| dwarf_debug_sections, |
| &elf_tdata (abfd)->dwarf2_find_line_info) |
| == 1) |
| return true; |
| |
| msec = bfd_get_section_by_name (abfd, ".mdebug"); |
| if (msec != NULL) |
| { |
| flagword origflags; |
| struct alpha_elf_find_line *fi; |
| const struct ecoff_debug_swap * const swap = |
| get_elf_backend_data (abfd)->elf_backend_ecoff_debug_swap; |
| |
| /* If we are called during a link, alpha_elf_final_link may have |
| cleared the SEC_HAS_CONTENTS field. We force it back on here |
| if appropriate (which it normally will be). */ |
| origflags = msec->flags; |
| if (elf_section_data (msec)->this_hdr.sh_type != SHT_NOBITS) |
| msec->flags |= SEC_HAS_CONTENTS; |
| |
| fi = alpha_elf_tdata (abfd)->find_line_info; |
| if (fi == NULL) |
| { |
| bfd_size_type external_fdr_size; |
| char *fraw_src; |
| char *fraw_end; |
| struct fdr *fdr_ptr; |
| bfd_size_type amt = sizeof (struct alpha_elf_find_line); |
| |
| fi = (struct alpha_elf_find_line *) bfd_zalloc (abfd, amt); |
| if (fi == NULL) |
| { |
| msec->flags = origflags; |
| return false; |
| } |
| |
| if (!elf64_alpha_read_ecoff_info (abfd, msec, &fi->d)) |
| { |
| msec->flags = origflags; |
| return false; |
| } |
| |
| /* Swap in the FDR information. */ |
| amt = fi->d.symbolic_header.ifdMax * sizeof (struct fdr); |
| fi->d.fdr = (struct fdr *) bfd_alloc (abfd, amt); |
| if (fi->d.fdr == NULL) |
| { |
| msec->flags = origflags; |
| return false; |
| } |
| external_fdr_size = swap->external_fdr_size; |
| fdr_ptr = fi->d.fdr; |
| fraw_src = (char *) fi->d.external_fdr; |
| fraw_end = (fraw_src |
| + fi->d.symbolic_header.ifdMax * external_fdr_size); |
| for (; fraw_src < fraw_end; fraw_src += external_fdr_size, fdr_ptr++) |
| (*swap->swap_fdr_in) (abfd, fraw_src, fdr_ptr); |
| |
| alpha_elf_tdata (abfd)->find_line_info = fi; |
| } |
| |
| if (_bfd_ecoff_locate_line (abfd, section, offset, &fi->d, swap, |
| &fi->i, filename_ptr, functionname_ptr, |
| line_ptr)) |
| { |
| msec->flags = origflags; |
| return true; |
| } |
| |
| msec->flags = origflags; |
| } |
| |
| /* Fall back on the generic ELF find_nearest_line routine. */ |
| |
| return _bfd_elf_find_nearest_line (abfd, symbols, section, offset, |
| filename_ptr, functionname_ptr, |
| line_ptr, discriminator_ptr); |
| } |
| |
| /* Structure used to pass information to alpha_elf_output_extsym. */ |
| |
| struct extsym_info |
| { |
| bfd *abfd; |
| struct bfd_link_info *info; |
| struct ecoff_debug_info *debug; |
| const struct ecoff_debug_swap *swap; |
| bool failed; |
| }; |
| |
| static bool |
| elf64_alpha_output_extsym (struct elf_link_hash_entry *x, void * data) |
| { |
| struct alpha_elf_link_hash_entry *h = (struct alpha_elf_link_hash_entry *) x; |
| struct extsym_info *einfo = (struct extsym_info *) data; |
| bool strip; |
| asection *sec, *output_section; |
| |
| if (h->root.indx == -2) |
| strip = false; |
| else if ((h->root.def_dynamic |
| || h->root.ref_dynamic |
| || h->root.root.type == bfd_link_hash_new) |
| && !h->root.def_regular |
| && !h->root.ref_regular) |
| strip = true; |
| else if (einfo->info->strip == strip_all |
| || (einfo->info->strip == strip_some |
| && bfd_hash_lookup (einfo->info->keep_hash, |
| h->root.root.root.string, |
| false, false) == NULL)) |
| strip = true; |
| else |
| strip = false; |
| |
| if (strip) |
| return true; |
| |
| if (h->esym.ifd == -2) |
| { |
| h->esym.jmptbl = 0; |
| h->esym.cobol_main = 0; |
| h->esym.weakext = 0; |
| h->esym.reserved = 0; |
| h->esym.ifd = ifdNil; |
| h->esym.asym.value = 0; |
| h->esym.asym.st = stGlobal; |
| |
| if (h->root.root.type != bfd_link_hash_defined |
| && h->root.root.type != bfd_link_hash_defweak) |
| h->esym.asym.sc = scAbs; |
| else |
| { |
| const char *name; |
| |
| sec = h->root.root.u.def.section; |
| output_section = sec->output_section; |
| |
| /* When making a shared library and symbol h is the one from |
| the another shared library, OUTPUT_SECTION may be null. */ |
| if (output_section == NULL) |
| h->esym.asym.sc = scUndefined; |
| else |
| { |
| name = bfd_section_name (output_section); |
| |
| if (strcmp (name, ".text") == 0) |
| h->esym.asym.sc = scText; |
| else if (strcmp (name, ".data") == 0) |
| h->esym.asym.sc = scData; |
| else if (strcmp (name, ".sdata") == 0) |
| h->esym.asym.sc = scSData; |
| else if (strcmp (name, ".rodata") == 0 |
| || strcmp (name, ".rdata") == 0) |
| h->esym.asym.sc = scRData; |
| else if (strcmp (name, ".bss") == 0) |
| h->esym.asym.sc = scBss; |
| else if (strcmp (name, ".sbss") == 0) |
| h->esym.asym.sc = scSBss; |
| else if (strcmp (name, ".init") == 0) |
| h->esym.asym.sc = scInit; |
| else if (strcmp (name, ".fini") == 0) |
| h->esym.asym.sc = scFini; |
| else |
| h->esym.asym.sc = scAbs; |
| } |
| } |
| |
| h->esym.asym.reserved = 0; |
| h->esym.asym.index = indexNil; |
| } |
| |
| if (h->root.root.type == bfd_link_hash_common) |
| h->esym.asym.value = h->root.root.u.c.size; |
| else if (h->root.root.type == bfd_link_hash_defined |
| || h->root.root.type == bfd_link_hash_defweak) |
| { |
| if (h->esym.asym.sc == scCommon) |
| h->esym.asym.sc = scBss; |
| else if (h->esym.asym.sc == scSCommon) |
| h->esym.asym.sc = scSBss; |
| |
| sec = h->root.root.u.def.section; |
| output_section = sec->output_section; |
| if (output_section != NULL) |
| h->esym.asym.value = (h->root.root.u.def.value |
| + sec->output_offset |
| + output_section->vma); |
| else |
| h->esym.asym.value = 0; |
| } |
| |
| if (! bfd_ecoff_debug_one_external (einfo->abfd, einfo->debug, einfo->swap, |
| h->root.root.root.string, |
| &h->esym)) |
| { |
| einfo->failed = true; |
| return false; |
| } |
| |
| return true; |
| } |
| |
| /* Search for and possibly create a got entry. */ |
| |
| static struct alpha_elf_got_entry * |
| get_got_entry (bfd *abfd, struct alpha_elf_link_hash_entry *h, |
| unsigned long r_type, unsigned long r_symndx, |
| bfd_vma r_addend) |
| { |
| struct alpha_elf_got_entry *gotent; |
| struct alpha_elf_got_entry **slot; |
| |
| if (h) |
| slot = &h->got_entries; |
| else |
| { |
| /* This is a local .got entry -- record for merge. */ |
| |
| struct alpha_elf_got_entry **local_got_entries; |
| |
| local_got_entries = alpha_elf_tdata(abfd)->local_got_entries; |
| if (!local_got_entries) |
| { |
| bfd_size_type size; |
| Elf_Internal_Shdr *symtab_hdr; |
| |
| symtab_hdr = &elf_tdata(abfd)->symtab_hdr; |
| size = symtab_hdr->sh_info; |
| size *= sizeof (struct alpha_elf_got_entry *); |
| |
| local_got_entries |
| = (struct alpha_elf_got_entry **) bfd_zalloc (abfd, size); |
| if (!local_got_entries) |
| return NULL; |
| |
| alpha_elf_tdata (abfd)->local_got_entries = local_got_entries; |
| } |
| |
| slot = &local_got_entries[r_symndx]; |
| } |
| |
| for (gotent = *slot; gotent ; gotent = gotent->next) |
| if (gotent->gotobj == abfd |
| && gotent->reloc_type == r_type |
| && gotent->addend == r_addend) |
| break; |
| |
| if (!gotent) |
| { |
| int entry_size; |
| size_t amt; |
| |
| amt = sizeof (struct alpha_elf_got_entry); |
| gotent = (struct alpha_elf_got_entry *) bfd_alloc (abfd, amt); |
| if (!gotent) |
| return NULL; |
| |
| gotent->gotobj = abfd; |
| gotent->addend = r_addend; |
| gotent->got_offset = -1; |
| gotent->plt_offset = -1; |
| gotent->use_count = 1; |
| gotent->reloc_type = r_type; |
| gotent->reloc_done = 0; |
| gotent->reloc_xlated = 0; |
| |
| gotent->next = *slot; |
| *slot = gotent; |
| |
| entry_size = alpha_got_entry_size (r_type); |
| alpha_elf_tdata (abfd)->total_got_size += entry_size; |
| if (!h) |
| alpha_elf_tdata(abfd)->local_got_size += entry_size; |
| } |
| else |
| gotent->use_count += 1; |
| |
| return gotent; |
| } |
| |
| static bool |
| elf64_alpha_want_plt (struct alpha_elf_link_hash_entry *ah) |
| { |
| return ((ah->root.type == STT_FUNC |
| || ah->root.root.type == bfd_link_hash_undefweak |
| || ah->root.root.type == bfd_link_hash_undefined) |
| && (ah->flags & ALPHA_ELF_LINK_HASH_LU_PLT) != 0 |
| && (ah->flags & ~ALPHA_ELF_LINK_HASH_LU_PLT) == 0); |
| } |
| |
| /* Whether to sort relocs output by ld -r or ld --emit-relocs, by r_offset. |
| Don't do so for code sections. We want to keep ordering of LITERAL/LITUSE |
| as is. On the other hand, elf-eh-frame.c processing requires .eh_frame |
| relocs to be sorted. */ |
| |
| static bool |
| elf64_alpha_sort_relocs_p (asection *sec) |
| { |
| return (sec->flags & SEC_CODE) == 0; |
| } |
| |
| |
| /* Handle dynamic relocations when doing an Alpha ELF link. */ |
| |
| static bool |
| elf64_alpha_check_relocs (bfd *abfd, struct bfd_link_info *info, |
| asection *sec, const Elf_Internal_Rela *relocs) |
| { |
| bfd *dynobj; |
| asection *sreloc; |
| Elf_Internal_Shdr *symtab_hdr; |
| struct alpha_elf_link_hash_entry **sym_hashes; |
| const Elf_Internal_Rela *rel, *relend; |
| |
| if (bfd_link_relocatable (info)) |
| return true; |
| |
| BFD_ASSERT (is_alpha_elf (abfd)); |
| |
| dynobj = elf_hash_table (info)->dynobj; |
| if (dynobj == NULL) |
| elf_hash_table (info)->dynobj = dynobj = abfd; |
| |
| sreloc = NULL; |
| symtab_hdr = &elf_symtab_hdr (abfd); |
| sym_hashes = alpha_elf_sym_hashes (abfd); |
| |
| relend = relocs + sec->reloc_count; |
| for (rel = relocs; rel < relend; ++rel) |
| { |
| enum { |
| NEED_GOT = 1, |
| NEED_GOT_ENTRY = 2, |
| NEED_DYNREL = 4 |
| }; |
| |
| unsigned long r_symndx, r_type; |
| struct alpha_elf_link_hash_entry *h; |
| unsigned int gotent_flags; |
| bool maybe_dynamic; |
| unsigned int need; |
| bfd_vma addend; |
| |
| r_symndx = ELF64_R_SYM (rel->r_info); |
| if (r_symndx < symtab_hdr->sh_info) |
| h = NULL; |
| else |
| { |
| h = sym_hashes[r_symndx - symtab_hdr->sh_info]; |
| |
| while (h->root.root.type == bfd_link_hash_indirect |
| || h->root.root.type == bfd_link_hash_warning) |
| h = (struct alpha_elf_link_hash_entry *)h->root.root.u.i.link; |
| |
| /* PR15323, ref flags aren't set for references in the same |
| object. */ |
| h->root.ref_regular = 1; |
| } |
| |
| /* We can only get preliminary data on whether a symbol is |
| locally or externally defined, as not all of the input files |
| have yet been processed. Do something with what we know, as |
| this may help reduce memory usage and processing time later. */ |
| maybe_dynamic = false; |
| if (h && ((bfd_link_pic (info) |
| && (!info->symbolic |
| || info->unresolved_syms_in_shared_libs == RM_IGNORE)) |
| || !h->root.def_regular |
| || h->root.root.type == bfd_link_hash_defweak)) |
| maybe_dynamic = true; |
| |
| need = 0; |
| gotent_flags = 0; |
| r_type = ELF64_R_TYPE (rel->r_info); |
| addend = rel->r_addend; |
| |
| switch (r_type) |
| { |
| case R_ALPHA_LITERAL: |
| need = NEED_GOT | NEED_GOT_ENTRY; |
| |
| /* Remember how this literal is used from its LITUSEs. |
| This will be important when it comes to decide if we can |
| create a .plt entry for a function symbol. */ |
| while (++rel < relend && ELF64_R_TYPE (rel->r_info) == R_ALPHA_LITUSE) |
| if (rel->r_addend >= 1 && rel->r_addend <= 6) |
| gotent_flags |= 1 << rel->r_addend; |
| --rel; |
| |
| /* No LITUSEs -- presumably the address is used somehow. */ |
| if (gotent_flags == 0) |
| gotent_flags = ALPHA_ELF_LINK_HASH_LU_ADDR; |
| break; |
| |
| case R_ALPHA_GPDISP: |
| case R_ALPHA_GPREL16: |
| case R_ALPHA_GPREL32: |
| case R_ALPHA_GPRELHIGH: |
| case R_ALPHA_GPRELLOW: |
| case R_ALPHA_BRSGP: |
| need = NEED_GOT; |
| break; |
| |
| case R_ALPHA_REFLONG: |
| case R_ALPHA_REFQUAD: |
| if (bfd_link_pic (info) || maybe_dynamic) |
| need = NEED_DYNREL; |
| break; |
| |
| case R_ALPHA_TLSLDM: |
| /* The symbol for a TLSLDM reloc is ignored. Collapse the |
| reloc to the STN_UNDEF (0) symbol so that they all match. */ |
| r_symndx = STN_UNDEF; |
| h = 0; |
| maybe_dynamic = false; |
| /* FALLTHRU */ |
| |
| case R_ALPHA_TLSGD: |
| case R_ALPHA_GOTDTPREL: |
| need = NEED_GOT | NEED_GOT_ENTRY; |
| break; |
| |
| case R_ALPHA_GOTTPREL: |
| need = NEED_GOT | NEED_GOT_ENTRY; |
| gotent_flags = ALPHA_ELF_LINK_HASH_TLS_IE; |
| if (bfd_link_pic (info)) |
| info->flags |= DF_STATIC_TLS; |
| break; |
| |
| case R_ALPHA_TPREL64: |
| if (bfd_link_dll (info)) |
| { |
| info->flags |= DF_STATIC_TLS; |
| need = NEED_DYNREL; |
| } |
| else if (maybe_dynamic) |
| need = NEED_DYNREL; |
| break; |
| } |
| |
| if (need & NEED_GOT) |
| { |
| if (alpha_elf_tdata(abfd)->gotobj == NULL) |
| { |
| if (!elf64_alpha_create_got_section (abfd, info)) |
| return false; |
| } |
| } |
| |
| if (need & NEED_GOT_ENTRY) |
| { |
| struct alpha_elf_got_entry *gotent; |
| |
| gotent = get_got_entry (abfd, h, r_type, r_symndx, addend); |
| if (!gotent) |
| return false; |
| |
| if (gotent_flags) |
| { |
| gotent->flags |= gotent_flags; |
| if (h) |
| { |
| gotent_flags |= h->flags; |
| h->flags = gotent_flags; |
| |
| /* Make a guess as to whether a .plt entry is needed. */ |
| /* ??? It appears that we won't make it into |
| adjust_dynamic_symbol for symbols that remain |
| totally undefined. Copying this check here means |
| we can create a plt entry for them too. */ |
| h->root.needs_plt |
| = (maybe_dynamic && elf64_alpha_want_plt (h)); |
| } |
| } |
| } |
| |
| if (need & NEED_DYNREL) |
| { |
| /* We need to create the section here now whether we eventually |
| use it or not so that it gets mapped to an output section by |
| the linker. If not used, we'll kill it in size_dynamic_sections. */ |
| if (sreloc == NULL) |
| { |
| sreloc = _bfd_elf_make_dynamic_reloc_section |
| (sec, dynobj, 3, abfd, /*rela?*/ true); |
| |
| if (sreloc == NULL) |
| return false; |
| } |
| |
| if (h) |
| { |
| /* Since we havn't seen all of the input symbols yet, we |
| don't know whether we'll actually need a dynamic relocation |
| entry for this reloc. So make a record of it. Once we |
| find out if this thing needs dynamic relocation we'll |
| expand the relocation sections by the appropriate amount. */ |
| |
| struct alpha_elf_reloc_entry *rent; |
| |
| for (rent = h->reloc_entries; rent; rent = rent->next) |
| if (rent->rtype == r_type && rent->srel == sreloc) |
| break; |
| |
| if (!rent) |
| { |
| size_t amt = sizeof (struct alpha_elf_reloc_entry); |
| rent = (struct alpha_elf_reloc_entry *) bfd_alloc (abfd, amt); |
| if (!rent) |
| return false; |
| |
| rent->srel = sreloc; |
| rent->sec = sec; |
| rent->rtype = r_type; |
| rent->count = 1; |
| |
| rent->next = h->reloc_entries; |
| h->reloc_entries = rent; |
| } |
| else |
| rent->count++; |
| } |
| else if (bfd_link_pic (info)) |
| { |
| /* If this is a shared library, and the section is to be |
| loaded into memory, we need a RELATIVE reloc. */ |
| sreloc->size += sizeof (Elf64_External_Rela); |
| if (sec->flags & SEC_READONLY) |
| { |
| info->flags |= DF_TEXTREL; |
| info->callbacks->minfo |
| (_("%pB: dynamic relocation against a local symbol in " |
| "read-only section `%pA'\n"), |
| sec->owner, sec); |
| } |
| } |
| } |
| } |
| |
| return true; |
| } |
| |
| /* Return the section that should be marked against GC for a given |
| relocation. */ |
| |
| static asection * |
| elf64_alpha_gc_mark_hook (asection *sec, struct bfd_link_info *info, |
| Elf_Internal_Rela *rel, |
| struct elf_link_hash_entry *h, Elf_Internal_Sym *sym) |
| { |
| /* These relocations don't really reference a symbol. Instead we store |
| extra data in their addend slot. Ignore the symbol. */ |
| switch (ELF64_R_TYPE (rel->r_info)) |
| { |
| case R_ALPHA_LITUSE: |
| case R_ALPHA_GPDISP: |
| case R_ALPHA_HINT: |
| return NULL; |
| } |
| |
| return _bfd_elf_gc_mark_hook (sec, info, rel, h, sym); |
| } |
| |
| /* Adjust a symbol defined by a dynamic object and referenced by a |
| regular object. The current definition is in some section of the |
| dynamic object, but we're not including those sections. We have to |
| change the definition to something the rest of the link can |
| understand. */ |
| |
| static bool |
| elf64_alpha_adjust_dynamic_symbol (struct bfd_link_info *info, |
| struct elf_link_hash_entry *h) |
| { |
| bfd *dynobj; |
| asection *s; |
| struct alpha_elf_link_hash_entry *ah; |
| |
| dynobj = elf_hash_table(info)->dynobj; |
| ah = (struct alpha_elf_link_hash_entry *)h; |
| |
| /* Now that we've seen all of the input symbols, finalize our decision |
| about whether this symbol should get a .plt entry. Irritatingly, it |
| is common for folk to leave undefined symbols in shared libraries, |
| and they still expect lazy binding; accept undefined symbols in lieu |
| of STT_FUNC. */ |
| if (alpha_elf_dynamic_symbol_p (h, info) && elf64_alpha_want_plt (ah)) |
| { |
| h->needs_plt = true; |
| |
| s = elf_hash_table(info)->splt; |
| if (!s && !elf64_alpha_create_dynamic_sections (dynobj, info)) |
| return false; |
| |
| /* We need one plt entry per got subsection. Delay allocation of |
| the actual plt entries until size_plt_section, called from |
| size_dynamic_sections or during relaxation. */ |
| |
| return true; |
| } |
| else |
| h->needs_plt = false; |
| |
| /* If this is a weak symbol, and there is a real definition, the |
| processor independent code will have arranged for us to see the |
| real definition first, and we can just use the same value. */ |
| if (h->is_weakalias) |
| { |
| struct elf_link_hash_entry *def = weakdef (h); |
| BFD_ASSERT (def->root.type == bfd_link_hash_defined); |
| h->root.u.def.section = def->root.u.def.section; |
| h->root.u.def.value = def->root.u.def.value; |
| return true; |
| } |
| |
| /* This is a reference to a symbol defined by a dynamic object which |
| is not a function. The Alpha, since it uses .got entries for all |
| symbols even in regular objects, does not need the hackery of a |
| .dynbss section and COPY dynamic relocations. */ |
| |
| return true; |
| } |
| |
| /* Record STO_ALPHA_NOPV and STO_ALPHA_STD_GPLOAD. */ |
| |
| static void |
| elf64_alpha_merge_symbol_attribute (struct elf_link_hash_entry *h, |
| unsigned int st_other, |
| bool definition, |
| bool dynamic) |
| { |
| if (!dynamic && definition) |
| h->other = ((h->other & ELF_ST_VISIBILITY (-1)) |
| | (st_other & ~ELF_ST_VISIBILITY (-1))); |
| } |
| |
| /* Symbol versioning can create new symbols, and make our old symbols |
| indirect to the new ones. Consolidate the got and reloc information |
| in these situations. */ |
| |
| static void |
| elf64_alpha_copy_indirect_symbol (struct bfd_link_info *info, |
| struct elf_link_hash_entry *dir, |
| struct elf_link_hash_entry *ind) |
| { |
| struct alpha_elf_link_hash_entry *hi |
| = (struct alpha_elf_link_hash_entry *) ind; |
| struct alpha_elf_link_hash_entry *hs |
| = (struct alpha_elf_link_hash_entry *) dir; |
| |
| /* Do the merging in the superclass. */ |
| _bfd_elf_link_hash_copy_indirect(info, dir, ind); |
| |
| /* Merge the flags. Whee. */ |
| hs->flags |= hi->flags; |
| |
| /* ??? It's unclear to me what's really supposed to happen when |
| "merging" defweak and defined symbols, given that we don't |
| actually throw away the defweak. This more-or-less copies |
| the logic related to got and plt entries in the superclass. */ |
| if (ind->root.type != bfd_link_hash_indirect) |
| return; |
| |
| /* Merge the .got entries. Cannibalize the old symbol's list in |
| doing so, since we don't need it anymore. */ |
| |
| if (hs->got_entries == NULL) |
| hs->got_entries = hi->got_entries; |
| else |
| { |
| struct alpha_elf_got_entry *gi, *gs, *gin, *gsh; |
| |
| gsh = hs->got_entries; |
| for (gi = hi->got_entries; gi ; gi = gin) |
| { |
| gin = gi->next; |
| for (gs = gsh; gs ; gs = gs->next) |
| if (gi->gotobj == gs->gotobj |
| && gi->reloc_type == gs->reloc_type |
| && gi->addend == gs->addend) |
| { |
| gs->use_count += gi->use_count; |
| goto got_found; |
| } |
| gi->next = hs->got_entries; |
| hs->got_entries = gi; |
| got_found:; |
| } |
| } |
| hi->got_entries = NULL; |
| |
| /* And similar for the reloc entries. */ |
| |
| if (hs->reloc_entries == NULL) |
| hs->reloc_entries = hi->reloc_entries; |
| else |
| { |
| struct alpha_elf_reloc_entry *ri, *rs, *rin, *rsh; |
| |
| rsh = hs->reloc_entries; |
| for (ri = hi->reloc_entries; ri ; ri = rin) |
| { |
| rin = ri->next; |
| for (rs = rsh; rs ; rs = rs->next) |
| if (ri->rtype == rs->rtype && ri->srel == rs->srel) |
| { |
| rs->count += ri->count; |
| goto found_reloc; |
| } |
| ri->next = hs->reloc_entries; |
| hs->reloc_entries = ri; |
| found_reloc:; |
| } |
| } |
| hi->reloc_entries = NULL; |
| } |
| |
| /* Is it possible to merge two object file's .got tables? */ |
| |
| static bool |
| elf64_alpha_can_merge_gots (bfd *a, bfd *b) |
| { |
| int total = alpha_elf_tdata (a)->total_got_size; |
| bfd *bsub; |
| |
| /* Trivial quick fallout test. */ |
| if (total + alpha_elf_tdata (b)->total_got_size <= MAX_GOT_SIZE) |
| return true; |
| |
| /* By their nature, local .got entries cannot be merged. */ |
| if ((total += alpha_elf_tdata (b)->local_got_size) > MAX_GOT_SIZE) |
| return false; |
| |
| /* Failing the common trivial comparison, we must effectively |
| perform the merge. Not actually performing the merge means that |
| we don't have to store undo information in case we fail. */ |
| for (bsub = b; bsub ; bsub = alpha_elf_tdata (bsub)->in_got_link_next) |
| { |
| struct alpha_elf_link_hash_entry **hashes = alpha_elf_sym_hashes (bsub); |
| Elf_Internal_Shdr *symtab_hdr = &elf_tdata (bsub)->symtab_hdr; |
| int i, n; |
| |
| n = NUM_SHDR_ENTRIES (symtab_hdr) - symtab_hdr->sh_info; |
| for (i = 0; i < n; ++i) |
| { |
| struct alpha_elf_got_entry *ae, *be; |
| struct alpha_elf_link_hash_entry *h; |
| |
| h = hashes[i]; |
| while (h->root.root.type == bfd_link_hash_indirect |
| || h->root.root.type == bfd_link_hash_warning) |
| h = (struct alpha_elf_link_hash_entry *)h->root.root.u.i.link; |
| |
| for (be = h->got_entries; be ; be = be->next) |
| { |
| if (be->use_count == 0) |
| continue; |
| if (be->gotobj != b) |
| continue; |
| |
| for (ae = h->got_entries; ae ; ae = ae->next) |
| if (ae->gotobj == a |
| && ae->reloc_type == be->reloc_type |
| && ae->addend == be->addend) |
| goto global_found; |
| |
| total += alpha_got_entry_size (be->reloc_type); |
| if (total > MAX_GOT_SIZE) |
| return false; |
| global_found:; |
| } |
| } |
| } |
| |
| return true; |
| } |
| |
| /* Actually merge two .got tables. */ |
| |
| static void |
| elf64_alpha_merge_gots (bfd *a, bfd *b) |
| { |
| int total = alpha_elf_tdata (a)->total_got_size; |
| bfd *bsub; |
| |
| /* Remember local expansion. */ |
| { |
| int e = alpha_elf_tdata (b)->local_got_size; |
| total += e; |
| alpha_elf_tdata (a)->local_got_size += e; |
| } |
| |
| for (bsub = b; bsub ; bsub = alpha_elf_tdata (bsub)->in_got_link_next) |
| { |
| struct alpha_elf_got_entry **local_got_entries; |
| struct alpha_elf_link_hash_entry **hashes; |
| Elf_Internal_Shdr *symtab_hdr; |
| int i, n; |
| |
| /* Let the local .got entries know they are part of a new subsegment. */ |
| local_got_entries = alpha_elf_tdata (bsub)->local_got_entries; |
| if (local_got_entries) |
| { |
| n = elf_tdata (bsub)->symtab_hdr.sh_info; |
| for (i = 0; i < n; ++i) |
| { |
| struct alpha_elf_got_entry *ent; |
| for (ent = local_got_entries[i]; ent; ent = ent->next) |
| ent->gotobj = a; |
| } |
| } |
| |
| /* Merge the global .got entries. */ |
| hashes = alpha_elf_sym_hashes (bsub); |
| symtab_hdr = &elf_tdata (bsub)->symtab_hdr; |
| |
| n = NUM_SHDR_ENTRIES (symtab_hdr) - symtab_hdr->sh_info; |
| for (i = 0; i < n; ++i) |
| { |
| struct alpha_elf_got_entry *ae, *be, **pbe, **start; |
| struct alpha_elf_link_hash_entry *h; |
| |
| h = hashes[i]; |
| while (h->root.root.type == bfd_link_hash_indirect |
| || h->root.root.type == bfd_link_hash_warning) |
| h = (struct alpha_elf_link_hash_entry *)h->root.root.u.i.link; |
| |
| pbe = start = &h->got_entries; |
| while ((be = *pbe) != NULL) |
| { |
| if (be->use_count == 0) |
| { |
| *pbe = be->next; |
| memset (be, 0xa5, sizeof (*be)); |
| goto kill; |
| } |
| if (be->gotobj != b) |
| goto next; |
| |
| for (ae = *start; ae ; ae = ae->next) |
| if (ae->gotobj == a |
| && ae->reloc_type == be->reloc_type |
| && ae->addend == be->addend) |
| { |
| ae->flags |= be->flags; |
| ae->use_count += be->use_count; |
| *pbe = be->next; |
| memset (be, 0xa5, sizeof (*be)); |
| goto kill; |
| } |
| be->gotobj = a; |
| total += alpha_got_entry_size (be->reloc_type); |
| |
| next:; |
| pbe = &be->next; |
| kill:; |
| } |
| } |
| |
| alpha_elf_tdata (bsub)->gotobj = a; |
| } |
| alpha_elf_tdata (a)->total_got_size = total; |
| |
| /* Merge the two in_got chains. */ |
| { |
| bfd *next; |
| |
| bsub = a; |
| while ((next = alpha_elf_tdata (bsub)->in_got_link_next) != NULL) |
| bsub = next; |
| |
| alpha_elf_tdata (bsub)->in_got_link_next = b; |
| } |
| } |
| |
| /* Calculate the offsets for the got entries. */ |
| |
| static bool |
| elf64_alpha_calc_got_offsets_for_symbol (struct alpha_elf_link_hash_entry *h, |
| void * arg ATTRIBUTE_UNUSED) |
| { |
| struct alpha_elf_got_entry *gotent; |
| |
| for (gotent = h->got_entries; gotent; gotent = gotent->next) |
| if (gotent->use_count > 0) |
| { |
| struct alpha_elf_obj_tdata *td; |
| bfd_size_type *plge; |
| |
| td = alpha_elf_tdata (gotent->gotobj); |
| plge = &td->got->size; |
| gotent->got_offset = *plge; |
| *plge += alpha_got_entry_size (gotent->reloc_type); |
| } |
| |
| return true; |
| } |
| |
| static void |
| elf64_alpha_calc_got_offsets (struct bfd_link_info *info) |
| { |
| bfd *i, *got_list; |
| struct alpha_elf_link_hash_table * htab; |
| |
| htab = alpha_elf_hash_table (info); |
| if (htab == NULL) |
| return; |
| got_list = htab->got_list; |
| |
| /* First, zero out the .got sizes, as we may be recalculating the |
| .got after optimizing it. */ |
| for (i = got_list; i ; i = alpha_elf_tdata(i)->got_link_next) |
| alpha_elf_tdata(i)->got->size = 0; |
| |
| /* Next, fill in the offsets for all the global entries. */ |
| alpha_elf_link_hash_traverse (htab, |
| elf64_alpha_calc_got_offsets_for_symbol, |
| NULL); |
| |
| /* Finally, fill in the offsets for the local entries. */ |
| for (i = got_list; i ; i = alpha_elf_tdata(i)->got_link_next) |
| { |
| bfd_size_type got_offset = alpha_elf_tdata(i)->got->size; |
| bfd *j; |
| |
| for (j = i; j ; j = alpha_elf_tdata(j)->in_got_link_next) |
| { |
| struct alpha_elf_got_entry **local_got_entries, *gotent; |
| int k, n; |
| |
| local_got_entries = alpha_elf_tdata(j)->local_got_entries; |
| if (!local_got_entries) |
| continue; |
| |
| for (k = 0, n = elf_tdata(j)->symtab_hdr.sh_info; k < n; ++k) |
| for (gotent = local_got_entries[k]; gotent; gotent = gotent->next) |
| if (gotent->use_count > 0) |
| { |
| gotent->got_offset = got_offset; |
| got_offset += alpha_got_entry_size (gotent->reloc_type); |
| } |
| } |
| |
| alpha_elf_tdata(i)->got->size = got_offset; |
| } |
| } |
| |
| /* Constructs the gots. */ |
| |
| static bool |
| elf64_alpha_size_got_sections (struct bfd_link_info *info, |
| bool may_merge) |
| { |
| bfd *i, *got_list, *cur_got_obj = NULL; |
| struct alpha_elf_link_hash_table * htab; |
| |
| htab = alpha_elf_hash_table (info); |
| if (htab == NULL) |
| return false; |
| got_list = htab->got_list; |
| |
| /* On the first time through, pretend we have an existing got list |
| consisting of all of the input files. */ |
| if (got_list == NULL) |
| { |
| for (i = info->input_bfds; i ; i = i->link.next) |
| { |
| bfd *this_got; |
| |
| if (! is_alpha_elf (i)) |
| continue; |
| |
| this_got = alpha_elf_tdata (i)->gotobj; |
| if (this_got == NULL) |
| continue; |
| |
| /* We are assuming no merging has yet occurred. */ |
| BFD_ASSERT (this_got == i); |
| |
| if (alpha_elf_tdata (this_got)->total_got_size > MAX_GOT_SIZE) |
| { |
| /* Yikes! A single object file has too many entries. */ |
| _bfd_error_handler |
| /* xgettext:c-format */ |
| (_("%pB: .got subsegment exceeds 64K (size %d)"), |
| i, alpha_elf_tdata (this_got)->total_got_size); |
| return false; |
| } |
| |
| if (got_list == NULL) |
| got_list = this_got; |
| else |
| alpha_elf_tdata(cur_got_obj)->got_link_next = this_got; |
| cur_got_obj = this_got; |
| } |
| |
| /* Strange degenerate case of no got references. */ |
| if (got_list == NULL) |
| return true; |
| |
| htab->got_list = got_list; |
| } |
| |
| cur_got_obj = got_list; |
| if (cur_got_obj == NULL) |
| return false; |
| |
| if (may_merge) |
| { |
| i = alpha_elf_tdata(cur_got_obj)->got_link_next; |
| while (i != NULL) |
| { |
| if (elf64_alpha_can_merge_gots (cur_got_obj, i)) |
| { |
| elf64_alpha_merge_gots (cur_got_obj, i); |
| |
| alpha_elf_tdata(i)->got->size = 0; |
| i = alpha_elf_tdata(i)->got_link_next; |
| alpha_elf_tdata(cur_got_obj)->got_link_next = i; |
| } |
| else |
| { |
| cur_got_obj = i; |
| i = alpha_elf_tdata(i)->got_link_next; |
| } |
| } |
| } |
| |
| /* Once the gots have been merged, fill in the got offsets for |
| everything therein. */ |
| elf64_alpha_calc_got_offsets (info); |
| |
| return true; |
| } |
| |
| static bool |
| elf64_alpha_size_plt_section_1 (struct alpha_elf_link_hash_entry *h, |
| void * data) |
| { |
| asection *splt = (asection *) data; |
| struct alpha_elf_got_entry *gotent; |
| bool saw_one = false; |
| |
| /* If we didn't need an entry before, we still don't. */ |
| if (!h->root.needs_plt) |
| return true; |
| |
| /* For each LITERAL got entry still in use, allocate a plt entry. */ |
| for (gotent = h->got_entries; gotent ; gotent = gotent->next) |
| if (gotent->reloc_type == R_ALPHA_LITERAL |
| && gotent->use_count > 0) |
| { |
| if (splt->size == 0) |
| splt->size = PLT_HEADER_SIZE; |
| gotent->plt_offset = splt->size; |
| splt->size += PLT_ENTRY_SIZE; |
| saw_one = true; |
| } |
| |
| /* If there weren't any, there's no longer a need for the PLT entry. */ |
| if (!saw_one) |
| h->root.needs_plt = false; |
| |
| return true; |
| } |
| |
| /* Called from relax_section to rebuild the PLT in light of potential changes |
| in the function's status. */ |
| |
| static void |
| elf64_alpha_size_plt_section (struct bfd_link_info *info) |
| { |
| asection *splt, *spltrel, *sgotplt; |
| unsigned long entries; |
| struct alpha_elf_link_hash_table * htab; |
| |
| htab = alpha_elf_hash_table (info); |
| if (htab == NULL) |
| return; |
| |
| splt = elf_hash_table(info)->splt; |
| if (splt == NULL) |
| return; |
| |
| splt->size = 0; |
| |
| alpha_elf_link_hash_traverse (htab, |
| elf64_alpha_size_plt_section_1, splt); |
| |
| /* Every plt entry requires a JMP_SLOT relocation. */ |
| spltrel = elf_hash_table(info)->srelplt; |
| entries = 0; |
| if (splt->size) |
| { |
| if (elf64_alpha_use_secureplt) |
| entries = (splt->size - NEW_PLT_HEADER_SIZE) / NEW_PLT_ENTRY_SIZE; |
| else |
| entries = (splt->size - OLD_PLT_HEADER_SIZE) / OLD_PLT_ENTRY_SIZE; |
| } |
| spltrel->size = entries * sizeof (Elf64_External_Rela); |
| |
| /* When using the secureplt, we need two words somewhere in the data |
| segment for the dynamic linker to tell us where to go. This is the |
| entire contents of the .got.plt section. */ |
| if (elf64_alpha_use_secureplt) |
| { |
| sgotplt = elf_hash_table(info)->sgotplt; |
| sgotplt->size = entries ? 16 : 0; |
| } |
| } |
| |
| static bool |
| elf64_alpha_early_size_sections (bfd *output_bfd ATTRIBUTE_UNUSED, |
| struct bfd_link_info *info) |
| { |
| bfd *i; |
| struct alpha_elf_link_hash_table * htab; |
| |
| if (bfd_link_relocatable (info)) |
| return true; |
| |
| htab = alpha_elf_hash_table (info); |
| if (htab == NULL) |
| return false; |
| |
| if (!elf64_alpha_size_got_sections (info, true)) |
| return false; |
| |
| /* Allocate space for all of the .got subsections. */ |
| i = htab->got_list; |
| for ( ; i ; i = alpha_elf_tdata(i)->got_link_next) |
| { |
| asection *s = alpha_elf_tdata(i)->got; |
| if (s->size > 0) |
| { |
| s->contents = (bfd_byte *) bfd_zalloc (i, s->size); |
| if (s->contents == NULL) |
| return false; |
| } |
| } |
| |
| return true; |
| } |
| |
| /* The number of dynamic relocations required by a static relocation. */ |
| |
| static int |
| alpha_dynamic_entries_for_reloc (int r_type, int dynamic, int shared, int pie) |
| { |
| switch (r_type) |
| { |
| /* May appear in GOT entries. */ |
| case R_ALPHA_TLSGD: |
| return (dynamic ? 2 : shared ? 1 : 0); |
| case R_ALPHA_TLSLDM: |
| return shared; |
| case R_ALPHA_LITERAL: |
| return dynamic || shared; |
| case R_ALPHA_GOTTPREL: |
| return dynamic || (shared && !pie); |
| case R_ALPHA_GOTDTPREL: |
| return dynamic; |
| |
| /* May appear in data sections. */ |
| case R_ALPHA_REFLONG: |
| case R_ALPHA_REFQUAD: |
| return dynamic || shared; |
| case R_ALPHA_TPREL64: |
| return dynamic || (shared && !pie); |
| |
| /* Everything else is illegal. We'll issue an error during |
| relocate_section. */ |
| default: |
| return 0; |
| } |
| } |
| |
| /* Work out the sizes of the dynamic relocation entries. */ |
| |
| static bool |
| elf64_alpha_calc_dynrel_sizes (struct alpha_elf_link_hash_entry *h, |
| struct bfd_link_info *info) |
| { |
| bool dynamic; |
| struct alpha_elf_reloc_entry *relent; |
| unsigned long entries; |
| |
| /* If the symbol was defined as a common symbol in a regular object |
| file, and there was no definition in any dynamic object, then the |
| linker will have allocated space for the symbol in a common |
| section but the ELF_LINK_HASH_DEF_REGULAR flag will not have been |
| set. This is done for dynamic symbols in |
| elf_adjust_dynamic_symbol but this is not done for non-dynamic |
| symbols, somehow. */ |
| if (!h->root.def_regular |
| && h->root.ref_regular |
| && !h->root.def_dynamic |
| && (h->root.root.type == bfd_link_hash_defined |
| || h->root.root.type == bfd_link_hash_defweak) |
| && !(h->root.root.u.def.section->owner->flags & DYNAMIC)) |
| h->root.def_regular = 1; |
| |
| /* If the symbol is dynamic, we'll need all the relocations in their |
| natural form. If this is a shared object, and it has been forced |
| local, we'll need the same number of RELATIVE relocations. */ |
| dynamic = alpha_elf_dynamic_symbol_p (&h->root, info); |
| |
| /* If the symbol is a hidden undefined weak, then we never have any |
| relocations. Avoid the loop which may want to add RELATIVE relocs |
| based on bfd_link_pic (info). */ |
| if (h->root.root.type == bfd_link_hash_undefweak && !dynamic) |
| return true; |
| |
| for (relent = h->reloc_entries; relent; relent = relent->next) |
| { |
| entries = alpha_dynamic_entries_for_reloc (relent->rtype, dynamic, |
| bfd_link_pic (info), |
| bfd_link_pie (info)); |
| if (entries) |
| { |
| asection *sec = relent->sec; |
| relent->srel->size += |
| entries * sizeof (Elf64_External_Rela) * relent->count; |
| if ((sec->flags & SEC_READONLY) != 0) |
| { |
| info->flags |= DT_TEXTREL; |
| info->callbacks->minfo |
| (_("%pB: dynamic relocation against `%pT' in " |
| "read-only section `%pA'\n"), |
| sec->owner, h->root.root.root.string, sec); |
| } |
| } |
| } |
| |
| return true; |
| } |
| |
| /* Subroutine of elf64_alpha_size_rela_got_section for doing the |
| global symbols. */ |
| |
| static bool |
| elf64_alpha_size_rela_got_1 (struct alpha_elf_link_hash_entry *h, |
| struct bfd_link_info *info) |
| { |
| bool dynamic; |
| struct alpha_elf_got_entry *gotent; |
| unsigned long entries; |
| |
| /* If we're using a plt for this symbol, then all of its relocations |
| for its got entries go into .rela.plt. */ |
| if (h->root.needs_plt) |
| return true; |
| |
| /* If the symbol is dynamic, we'll need all the relocations in their |
| natural form. If this is a shared object, and it has been forced |
| local, we'll need the same number of RELATIVE relocations. */ |
| dynamic = alpha_elf_dynamic_symbol_p (&h->root, info); |
| |
| /* If the symbol is a hidden undefined weak, then we never have any |
| relocations. Avoid the loop which may want to add RELATIVE relocs |
| based on bfd_link_pic (info). */ |
| if (h->root.root.type == bfd_link_hash_undefweak && !dynamic) |
| return true; |
| |
| entries = 0; |
| for (gotent = h->got_entries; gotent ; gotent = gotent->next) |
| if (gotent->use_count > 0) |
| entries += alpha_dynamic_entries_for_reloc (gotent->reloc_type, dynamic, |
| bfd_link_pic (info), |
| bfd_link_pie (info)); |
| |
| if (entries > 0) |
| { |
| asection *srel = elf_hash_table(info)->srelgot; |
| BFD_ASSERT (srel != NULL); |
| srel->size += sizeof (Elf64_External_Rela) * entries; |
| } |
| |
| return true; |
| } |
| |
| /* Set the sizes of the dynamic relocation sections. */ |
| |
| static void |
| elf64_alpha_size_rela_got_section (struct bfd_link_info *info) |
| { |
| unsigned long entries; |
| bfd *i; |
| asection *srel; |
| struct alpha_elf_link_hash_table * htab; |
| |
| htab = alpha_elf_hash_table (info); |
| if (htab == NULL) |
| return; |
| |
| /* Shared libraries often require RELATIVE relocs, and some relocs |
| require attention for the main application as well. */ |
| |
| entries = 0; |
| for (i = htab->got_list; |
| i ; i = alpha_elf_tdata(i)->got_link_next) |
| { |
| bfd *j; |
| |
| for (j = i; j ; j = alpha_elf_tdata(j)->in_got_link_next) |
| { |
| struct alpha_elf_got_entry **local_got_entries, *gotent; |
| int k, n; |
| |
| local_got_entries = alpha_elf_tdata(j)->local_got_entries; |
| if (!local_got_entries) |
| continue; |
| |
| for (k = 0, n = elf_tdata(j)->symtab_hdr.sh_info; k < n; ++k) |
| for (gotent = local_got_entries[k]; |
| gotent ; gotent = gotent->next) |
| if (gotent->use_count > 0) |
| entries += (alpha_dynamic_entries_for_reloc |
| (gotent->reloc_type, 0, bfd_link_pic (info), |
| bfd_link_pie (info))); |
| } |
| } |
| |
| srel = elf_hash_table(info)->srelgot; |
| if (!srel) |
| { |
| BFD_ASSERT (entries == 0); |
| return; |
| } |
| srel->size = sizeof (Elf64_External_Rela) * entries; |
| |
| /* Now do the non-local symbols. */ |
| alpha_elf_link_hash_traverse (htab, |
| elf64_alpha_size_rela_got_1, info); |
| } |
| |
| /* Set the sizes of the dynamic sections. */ |
| |
| static bool |
| elf64_alpha_late_size_sections (bfd *output_bfd ATTRIBUTE_UNUSED, |
| struct bfd_link_info *info) |
| { |
| bfd *dynobj; |
| asection *s; |
| bool relplt, relocs; |
| struct alpha_elf_link_hash_table * htab; |
| |
| htab = alpha_elf_hash_table (info); |
| if (htab == NULL) |
| return false; |
| |
| dynobj = elf_hash_table(info)->dynobj; |
| if (dynobj == NULL) |
| return true; |
| |
| if (elf_hash_table (info)->dynamic_sections_created) |
| { |
| /* Set the contents of the .interp section to the interpreter. */ |
| if (bfd_link_executable (info) && !info->nointerp) |
| { |
| s = bfd_get_linker_section (dynobj, ".interp"); |
| BFD_ASSERT (s != NULL); |
| s->size = sizeof ELF_DYNAMIC_INTERPRETER; |
| s->contents = (unsigned char *) ELF_DYNAMIC_INTERPRETER; |
| } |
| |
| /* Now that we've seen all of the input files, we can decide which |
| symbols need dynamic relocation entries and which don't. We've |
| collected information in check_relocs that we can now apply to |
| size the dynamic relocation sections. */ |
| alpha_elf_link_hash_traverse (htab, |
| elf64_alpha_calc_dynrel_sizes, info); |
| |
| elf64_alpha_size_rela_got_section (info); |
| elf64_alpha_size_plt_section (info); |
| } |
| /* else we're not dynamic and by definition we don't need such things. */ |
| |
| /* The check_relocs and adjust_dynamic_symbol entry points have |
| determined the sizes of the various dynamic sections. Allocate |
| memory for them. */ |
| relplt = false; |
| relocs = false; |
| for (s = dynobj->sections; s != NULL; s = s->next) |
| { |
| const char *name; |
| |
| if (!(s->flags & SEC_LINKER_CREATED)) |
| continue; |
| |
| /* It's OK to base decisions on the section name, because none |
| of the dynobj section names depend upon the input files. */ |
| name = bfd_section_name (s); |
| |
| if (startswith (name, ".rela")) |
| { |
| if (s->size != 0) |
| { |
| if (strcmp (name, ".rela.plt") == 0) |
| relplt = true; |
| else |
| relocs = true; |
| |
| /* We use the reloc_count field as a counter if we need |
| to copy relocs into the output file. */ |
| s->reloc_count = 0; |
| } |
| } |
| else if (! startswith (name, ".got") |
| && strcmp (name, ".plt") != 0 |
| && strcmp (name, ".dynbss") != 0) |
| { |
| /* It's not one of our dynamic sections, so don't allocate space. */ |
| continue; |
| } |
| |
| if (s->size == 0) |
| { |
| /* If we don't need this section, strip it from the output file. |
| This is to handle .rela.bss and .rela.plt. We must create it |
| in create_dynamic_sections, because it must be created before |
| the linker maps input sections to output sections. The |
| linker does that before adjust_dynamic_symbol is called, and |
| it is that function which decides whether anything needs to |
| go into these sections. */ |
| if (!startswith (name, ".got")) |
| s->flags |= SEC_EXCLUDE; |
| } |
| else if ((s->flags & SEC_HAS_CONTENTS) != 0) |
| { |
| /* Allocate memory for the section contents. */ |
| s->contents = (bfd_byte *) bfd_zalloc (dynobj, s->size); |
| if (s->contents == NULL) |
| return false; |
| } |
| } |
| |
| if (elf_hash_table (info)->dynamic_sections_created) |
| { |
| /* Add some entries to the .dynamic section. We fill in the |
| values later, in elf64_alpha_finish_dynamic_sections, but we |
| must add the entries now so that we get the correct size for |
| the .dynamic section. The DT_DEBUG entry is filled in by the |
| dynamic linker and used by the debugger. */ |
| #define add_dynamic_entry(TAG, VAL) \ |
| _bfd_elf_add_dynamic_entry (info, TAG, VAL) |
| |
| if (!_bfd_elf_add_dynamic_tags (output_bfd, info, |
| relocs || relplt)) |
| return false; |
| |
| if (relplt |
| && elf64_alpha_use_secureplt |
| && !add_dynamic_entry (DT_ALPHA_PLTRO, 1)) |
| return false; |
| } |
| #undef add_dynamic_entry |
| |
| return true; |
| } |
| |
| /* These functions do relaxation for Alpha ELF. |
| |
| Currently I'm only handling what I can do with existing compiler |
| and assembler support, which means no instructions are removed, |
| though some may be nopped. At this time GCC does not emit enough |
| information to do all of the relaxing that is possible. It will |
| take some not small amount of work for that to happen. |
| |
| There are a couple of interesting papers that I once read on this |
| subject, that I cannot find references to at the moment, that |
| related to Alpha in particular. They are by David Wall, then of |
| DEC WRL. */ |
| |
| struct alpha_relax_info |
| { |
| bfd *abfd; |
| asection *sec; |
| bfd_byte *contents; |
| Elf_Internal_Shdr *symtab_hdr; |
| Elf_Internal_Rela *relocs, *relend; |
| struct bfd_link_info *link_info; |
| bfd_vma gp; |
| bfd *gotobj; |
| asection *tsec; |
| struct alpha_elf_link_hash_entry *h; |
| struct alpha_elf_got_entry **first_gotent; |
| struct alpha_elf_got_entry *gotent; |
| bool changed_contents; |
| bool changed_relocs; |
| unsigned char other; |
| }; |
| |
| static Elf_Internal_Rela * |
| elf64_alpha_find_reloc_at_ofs (Elf_Internal_Rela *rel, |
| Elf_Internal_Rela *relend, |
| bfd_vma offset, int type) |
| { |
| while (rel < relend) |
| { |
| if (rel->r_offset == offset |
| && ELF64_R_TYPE (rel->r_info) == (unsigned int) type) |
| return rel; |
| ++rel; |
| } |
| return NULL; |
| } |
| |
| static bool |
| elf64_alpha_relax_got_load (struct alpha_relax_info *info, bfd_vma symval, |
| Elf_Internal_Rela *irel, unsigned long r_type) |
| { |
| unsigned int insn; |
| bfd_signed_vma disp; |
| |
| /* Get the instruction. */ |
| insn = bfd_get_32 (info->abfd, info->contents + irel->r_offset); |
| |
| if (insn >> 26 != OP_LDQ) |
| { |
| reloc_howto_type *howto = elf64_alpha_howto_table + r_type; |
| _bfd_error_handler |
| /* xgettext:c-format */ |
| (_("%pB: %pA+%#" PRIx64 ": warning: " |
| "%s relocation against unexpected insn"), |
| info->abfd, info->sec, (uint64_t) irel->r_offset, howto->name); |
| return true; |
| } |
| |
| /* Can't relax dynamic symbols. */ |
| if (info->h != NULL |
| && alpha_elf_dynamic_symbol_p (&info->h->root, info->link_info)) |
| return true; |
| |
| /* Can't use local-exec relocations in shared libraries. */ |
| if (r_type == R_ALPHA_GOTTPREL |
| && bfd_link_dll (info->link_info)) |
| return true; |
| |
| if (r_type == R_ALPHA_LITERAL) |
| { |
| /* Look for nice constant addresses. This includes the not-uncommon |
| special case of 0 for undefweak symbols. */ |
| if ((info->h && info->h->root.root.type == bfd_link_hash_undefweak) |
| || (!bfd_link_pic (info->link_info) |
| && (symval >= (bfd_vma)-0x8000 || symval < 0x8000))) |
| { |
| disp = 0; |
| insn = (OP_LDA << 26) | (insn & (31 << 21)) | (31 << 16); |
| insn |= (symval & 0xffff); |
| r_type = R_ALPHA_NONE; |
| } |
| else |
| { |
| /* We may only create GPREL relocs during the second pass. */ |
| if (info->link_info->relax_pass == 0) |
| return true; |
| |
| disp = symval - info->gp; |
| insn = (OP_LDA << 26) | (insn & 0x03ff0000); |
| r_type = R_ALPHA_GPREL16; |
| } |
| } |
| else |
| { |
| bfd_vma dtp_base, tp_base; |
| |
| BFD_ASSERT (elf_hash_table (info->link_info)->tls_sec != NULL); |
| dtp_base = alpha_get_dtprel_base (info->link_info); |
| tp_base = alpha_get_tprel_base (info->link_info); |
| disp = symval - (r_type == R_ALPHA_GOTDTPREL ? dtp_base : tp_base); |
| |
| insn = (OP_LDA << 26) | (insn & (31 << 21)) | (31 << 16); |
| |
| switch (r_type) |
| { |
| case R_ALPHA_GOTDTPREL: |
| r_type = R_ALPHA_DTPREL16; |
| break; |
| case R_ALPHA_GOTTPREL: |
| r_type = R_ALPHA_TPREL16; |
| break; |
| default: |
| BFD_ASSERT (0); |
| return false; |
| } |
| } |
| |
| if (disp < -0x8000 || disp >= 0x8000) |
| return true; |
| |
| bfd_put_32 (info->abfd, (bfd_vma) insn, info->contents + irel->r_offset); |
| info->changed_contents = true; |
| |
| /* Reduce the use count on this got entry by one, possibly |
| eliminating it. */ |
| if (--info->gotent->use_count == 0) |
| { |
| int sz = alpha_got_entry_size (r_type); |
| alpha_elf_tdata (info->gotobj)->total_got_size -= sz; |
| if (!info->h) |
| alpha_elf_tdata (info->gotobj)->local_got_size -= sz; |
| } |
| |
| /* Smash the existing GOT relocation for its 16-bit immediate pair. */ |
| irel->r_info = ELF64_R_INFO (ELF64_R_SYM (irel->r_info), r_type); |
| info->changed_relocs = true; |
| |
| /* ??? Search forward through this basic block looking for insns |
| that use the target register. Stop after an insn modifying the |
| register is seen, or after a branch or call. |
| |
| Any such memory load insn may be substituted by a load directly |
| off the GP. This allows the memory load insn to be issued before |
| the calculated GP register would otherwise be ready. |
| |
| Any such jsr insn can be replaced by a bsr if it is in range. |
| |
| This would mean that we'd have to _add_ relocations, the pain of |
| which gives one pause. */ |
| |
| return true; |
| } |
| |
| static bfd_vma |
| elf64_alpha_relax_opt_call (struct alpha_relax_info *info, bfd_vma symval) |
| { |
| /* If the function has the same gp, and we can identify that the |
| function does not use its function pointer, we can eliminate the |
| address load. */ |
| |
| /* If the symbol is marked NOPV, we are being told the function never |
| needs its procedure value. */ |
| if ((info->other & STO_ALPHA_STD_GPLOAD) == STO_ALPHA_NOPV) |
| return symval; |
| |
| /* If the symbol is marked STD_GP, we are being told the function does |
| a normal ldgp in the first two words. */ |
| else if ((info->other & STO_ALPHA_STD_GPLOAD) == STO_ALPHA_STD_GPLOAD) |
| ; |
| |
| /* Otherwise, we may be able to identify a GP load in the first two |
| words, which we can then skip. */ |
| else |
| { |
| Elf_Internal_Rela *tsec_relocs, *tsec_relend, *tsec_free, *gpdisp; |
| bfd_vma ofs; |
| |
| /* Load the relocations from the section that the target symbol is in. */ |
| if (info->sec == info->tsec) |
| { |
| tsec_relocs = info->relocs; |
| tsec_relend = info->relend; |
| tsec_free = NULL; |
| } |
| else |
| { |
| tsec_relocs = (_bfd_elf_link_read_relocs |
| (info->abfd, info->tsec, NULL, |
| (Elf_Internal_Rela *) NULL, |
| info->link_info->keep_memory)); |
| if (tsec_relocs == NULL) |
| return 0; |
| tsec_relend = tsec_relocs + info->tsec->reloc_count; |
| tsec_free = (elf_section_data (info->tsec)->relocs == tsec_relocs |
| ? NULL |
| : tsec_relocs); |
| } |
| |
| /* Recover the symbol's offset within the section. */ |
| ofs = (symval - info->tsec->output_section->vma |
| - info->tsec->output_offset); |
| |
| /* Look for a GPDISP reloc. */ |
| gpdisp = (elf64_alpha_find_reloc_at_ofs |
| (tsec_relocs, tsec_relend, ofs, R_ALPHA_GPDISP)); |
| |
| if (!gpdisp || gpdisp->r_addend != 4) |
| { |
| free (tsec_free); |
| return 0; |
| } |
| free (tsec_free); |
| } |
| |
| /* We've now determined that we can skip an initial gp load. Verify |
| that the call and the target use the same gp. */ |
| if (info->link_info->output_bfd->xvec != info->tsec->owner->xvec |
| || info->gotobj |