/freebsd-11-stable/contrib/binutils/bfd/ |
H A D | elf64-alpha.c | 135 /* The addend in effect for this entry. */ 138 /* The .got offset for this entry. */ 141 /* The .plt offset for this entry. */ 144 /* How many references to this entry? */ 147 /* The relocation type of this entry. */ 153 /* Have we initialized the dynamic relocation for this entry? */ 156 /* Have we adjusted this entry for SEC_MERGE? */ 195 /* Look up an entry in a Alpha ELF linker hash table. */ 215 /* Get the object's symbols as our own entry type. */ 222 equality wrt PLT entries -- we don't create a PLT entry i 233 elf64_alpha_link_hash_newfunc(struct bfd_hash_entry *entry, struct bfd_hash_table *table, const char *string) argument [all...] |
H A D | elf64-ppc.c | 118 /* The size in bytes of an entry in the procedure linkage table. */ 132 sometimes the .plt entry crosses a 64k boundary and we need to 201 /* Since .opd is an array of descriptors and each entry will end up 437 /* Like R_PPC64_ADDR16, but referring to the GOT table entry for the 453 /* Like R_PPC64_ADDR16_LO, but referring to the GOT table entry for 469 /* Like R_PPC64_ADDR16_HI, but referring to the GOT table entry for 485 /* Like R_PPC64_ADDR16_HA, but referring to the GOT table entry for 537 entry for a symbol. */ 646 /* Like R_PPC64_ADDR16_LO, but referring to the PLT table entry for 662 /* Like R_PPC64_ADDR16_HI, but referring to the PLT table entry fo 3542 stub_hash_newfunc(struct bfd_hash_entry *entry, struct bfd_hash_table *table, const char *string) argument 3578 branch_hash_newfunc(struct bfd_hash_entry *entry, struct bfd_hash_table *table, const char *string) argument 3609 link_hash_newfunc(struct bfd_hash_entry *entry, struct bfd_hash_table *table, const char *string) argument [all...] |
H A D | elf64-s390.c | 186 EMPTY_HOWTO (R_390_TLS_GD32), /* Empty entry for R_390_TLS_GD32. */ 191 EMPTY_HOWTO (R_390_TLS_GOTIE32), /* Empty entry for R_390_TLS_GOTIE32. */ 194 EMPTY_HOWTO (R_390_TLS_LDM32), /* Empty entry for R_390_TLS_LDM32. */ 197 EMPTY_HOWTO (R_390_TLS_IE32), /* Empty entry for R_390_TLS_IE32. */ 202 EMPTY_HOWTO (R_390_TLS_LE32), /* Empty entry for R_390_TLS_LE32. */ 205 EMPTY_HOWTO (R_390_TLS_LDO32), /* Empty entry for R_390_TLS_LDO32. */ 504 /* The size in bytes of the first entry in the procedure linkage table. */ 506 /* The size in bytes of an entry in the procedure linkage table. */ 526 Word 2 is used to point to the loader entry address. 537 PLT1: LARL 1,<fn>@GOTENT # 6 bytes Load address of GOT entry i [all...] |
H A D | elf64-x86-64.c | 357 /* The size in bytes of an entry in the global offset table. */ 361 /* The size in bytes of an entry in the procedure linkage table. */ 365 /* The first entry in a procedure linkage table looks like this. See the 408 /* x86-64 ELF linker hash entry. */ 432 /* Offset of the GOTPLT entry reserved for the TLS descriptor, 444 /* tls_type for each local got entry. */ 475 /* The offset into splt of the PLT entry for the TLS descriptor 480 /* The offset into sgot of the GOT entry used by the PLT entry 504 /* Create an entry i 505 link_hash_newfunc(struct bfd_hash_entry *entry, struct bfd_hash_table *table, const char *string) argument [all...] |
H A D | elflink.c | 586 struct elf_link_local_dynamic_entry *entry; 597 /* See if the entry exists already. */ 598 for (entry = elf_hash_table (info)->dynlocal; entry ; entry = entry->next) 599 if (entry->input_bfd == input_bfd && entry->input_indx == input_indx) 602 amt = sizeof (*entry); 603 entry 583 struct elf_link_local_dynamic_entry *entry; local 3127 struct elf_link_local_dynamic_entry *entry; local 10789 bfd_vma entry = (rel->r_offset - hstart) >> log_file_align; local [all...] |
H A D | elfxx-ia64.c | 56 Requires the creation of a PLTOFF entry. This does not 64 descriptor for a MIN_PLT entry, and requires one IPLT reloc. 80 /* The addend for which this entry is relevant. */ 92 /* The symbol table entry, if any, that this was derived from. */ 142 /* TRUE if this hash entry's addends was translated for 175 unsigned self_dtpmod_done : 1;/* has self DTPMOD entry been finished? */ 176 bfd_vma self_dtpmod_offset; /* .got offset to self DTPMOD entry */ 223 PARAMS ((struct bfd_hash_entry *entry, struct bfd_hash_table *table, 1057 in a branch to the PLT entry. */ 1191 /* Two alternatives: If it's a branch to a PLT entry, w 1940 struct elfNN_ia64_local_hash_entry *entry local 2001 struct elfNN_ia64_link_hash_entry *entry local 2025 struct elfNN_ia64_local_hash_entry *entry local 2074 struct elfNN_ia64_link_hash_entry *entry local 2097 struct elfNN_ia64_local_hash_entry *entry local [all...] |
H A D | elfxx-sparc.c | 477 /* SPARC ELF linker hash entry. */ 499 /* tls_type for each local got entry. */ 625 unsigned char *entry = splt->contents + offset; 639 | (((splt->contents + PLT64_ENTRY_SIZE) - (entry + 4)) / 4 & 0x7ffff); 641 bfd_put_32 (output_bfd, (bfd_vma) sethi, entry); 642 bfd_put_32 (output_bfd, (bfd_vma) ba, entry + 4); 643 bfd_put_32 (output_bfd, (bfd_vma) nop, entry + 8); 644 bfd_put_32 (output_bfd, (bfd_vma) nop, entry + 12); 645 bfd_put_32 (output_bfd, (bfd_vma) nop, entry + 16); 646 bfd_put_32 (output_bfd, (bfd_vma) nop, entry 624 unsigned char *entry = splt->contents + offset; local 790 link_hash_newfunc(struct bfd_hash_entry *entry, struct bfd_hash_table *table, const char *string) argument 2356 struct elf_link_local_dynamic_entry *entry, *e; local [all...] |
H A D | hash.c | 36 entry for it, and to traverse a hash table. There is 45 entry, because they were designed for use by the linker back 102 string in the hash table and to create a new entry. 118 If the @var{create} argument is <<TRUE>>, and a new entry is 137 hash table entry (a <<struct bfd_hash_entry *>>) and the 150 which each entry in the hash table. Some also find it 178 You must define a structure for an entry in the hash table, 181 The first field in the structure for an entry in the hash 182 table must be of the type used for an entry in the hash table 202 entry i 558 bfd_hash_newfunc(struct bfd_hash_entry *entry, struct bfd_hash_table *table, const char *string ATTRIBUTE_UNUSED) argument 649 strtab_hash_newfunc(struct bfd_hash_entry *entry, struct bfd_hash_table *table, const char *string) argument 743 struct strtab_hash_entry *entry; local 805 struct strtab_hash_entry *entry; local [all...] |
H A D | i386linux.c | 147 /* We don't need a special hash table entry structure, but we do need 191 /* Routine to create an entry in an Linux link hash table. */ 194 linux_link_hash_newfunc (entry, table, string) 195 struct bfd_hash_entry *entry; 199 struct linux_link_hash_entry *ret = (struct linux_link_hash_entry *) entry; 249 /* Look up an entry in a Linux link hash table. */ 346 If we do, and the defining entry is from a shared library, we 419 We will examine each entry and see if there are indications that we
|
H A D | ieee.c | 1539 /* Build a relocation entry for this type. */ 1972 ret->name = "* empty table entry "; 2001 fprintf (file, "* empty table entry "); 3136 bfd *entry = chain->this; 3137 ieee_data_type *entry_ieee = IEEE_DATA (entry); 3141 if (bfd_seek (entry, entry_ieee->w.r.debug_information_part, 3144 relocate_debug (abfd, entry); 3133 bfd *entry = chain->this; local
|
H A D | libbfd-in.h | 469 /* Create a new section entry. */ 475 (struct bfd_hash_entry *entry, struct bfd_hash_table *table, 720 struct bfd_section_already_linked *entry; 717 struct bfd_section_already_linked *entry; member in struct:bfd_section_already_linked_hash_entry
|
H A D | libbfd.h | 474 /* Create a new section entry. */ 480 (struct bfd_hash_entry *entry, struct bfd_hash_table *table, 725 struct bfd_section_already_linked *entry; 722 struct bfd_section_already_linked *entry; member in struct:bfd_section_already_linked_hash_entry
|
H A D | linker.c | 34 The linker uses three special entry points in the BFD target 36 these entry points when creating a new BFD back end, since 80 create a derived hash table. This entry point is called using 83 The <<_bfd_link_hash_table_create>> entry point must allocate 86 stored with the entries in the hash table, the entry point may 90 For example, with each entry in the hash table the a.out 116 entry point for each object file or archive which is to be 119 entry point is responsible for examining the file. For an 125 The a.out version of this entry point is 142 <<_bfd_link_add_symbols>> entry poin 438 _bfd_link_hash_newfunc(struct bfd_hash_entry *entry, struct bfd_hash_table *table, const char *string) argument 673 _bfd_generic_link_hash_newfunc(struct bfd_hash_entry *entry, struct bfd_hash_table *table, const char *string) argument 874 archive_hash_newfunc(struct bfd_hash_entry *entry, struct bfd_hash_table *table, const char *string) argument [all...] |
H A D | merge.c | 33 /* An entry in the section merge hash table. */ 38 /* Length of this entry. This includes the zero terminator. */ 100 /* Routine to create an entry in a section merge hashtab. */ 103 sec_merge_hash_newfunc (struct bfd_hash_entry *entry, argument 108 if (entry == NULL) 109 entry = bfd_hash_allocate (table, sizeof (struct sec_merge_hash_entry)); 110 if (entry == NULL) 114 entry = bfd_hash_newfunc (entry, table, string); 116 if (entry ! 268 register struct sec_merge_hash_entry *entry; local 289 sec_merge_emit(bfd *abfd, struct sec_merge_hash_entry *entry) argument 446 struct sec_merge_hash_entry *entry; local 807 struct sec_merge_hash_entry *entry; local [all...] |
H A D | peXXigen.c | 403 aouthdr_int->entry = GET_AOUTHDR_ENTRY (abfd, aouthdr_ext->entry); 419 a->AddressOfEntryPoint = aouthdr_int->entry; 479 if (aouthdr_int->entry) 481 aouthdr_int->entry += a->ImageBase; 483 aouthdr_int->entry &= 0xffffffff; 588 if (aouthdr_in->entry) 590 aouthdr_in->entry -= ib; 592 aouthdr_in->entry &= 0xffffffff; 625 /* Until other .idata fixes are made (pending patch), the entry fo [all...] |
H A D | section.c | 711 /* Initialize an entry in the section hash table. */ 714 bfd_section_hash_newfunc (struct bfd_hash_entry *entry, argument 720 if (entry == NULL) 722 entry = (struct bfd_hash_entry *) 724 if (entry == NULL) 725 return entry; 729 entry = bfd_hash_newfunc (entry, table, string); 730 if (entry != NULL) 731 memset (&((struct section_hash_entry *) entry) [all...] |
H A D | simple.c | 51 struct bfd_link_hash_entry *entry ATTRIBUTE_UNUSED,
|
H A D | sparclinux.c | 147 /* We don't need a special hash table entry structure, but we do need 191 /* Routine to create an entry in an Linux link hash table. */ 194 linux_link_hash_newfunc (entry, table, string) 195 struct bfd_hash_entry *entry; 199 struct linux_link_hash_entry *ret = (struct linux_link_hash_entry *) entry; 249 /* Look up an entry in a Linux link hash table. */ 346 If we do, and the defining entry is from a shared library, we 419 We will examine each entry and see if there are indications that we
|
H A D | srec.c | 820 srec_data_list_type *entry; local 822 entry = bfd_alloc (abfd, sizeof (* entry)); 823 if (entry == NULL) 849 entry->data = data; 850 entry->where = section->lma + offset; 851 entry->size = bytes_to_do; 856 && entry->where >= tdata->tail->where) 858 tdata->tail->next = entry; 859 entry [all...] |
H A D | stabs.c | 40 first entry in each unit, the type of 0, the value is the length of 67 /* An entry in the header file hash table. */ 103 this section. Otherwise the i'th entry is the number of 116 /* The function to create a new entry in the header file hash table. */ 119 stab_link_includes_newfunc (struct bfd_hash_entry *entry, 124 (struct stab_link_includes_entry *) entry; 279 (_("%B(%A+0x%lx): Stabs entry has invalid string index."), 677 /* Handle each N_BINCL entry. */ 118 stab_link_includes_newfunc(struct bfd_hash_entry *entry, struct bfd_hash_table *table, const char *string) argument
|
H A D | sunos.c | 511 /* A SPARC procedure linkage table entry is 12 bytes. The first entry 513 The remaining entries are branches back to the first entry, 536 /* This sequence is used when for the jump table entry to a defined 546 /* An m68k procedure linkage table entry is 8 bytes. The first entry 549 entry, followed by a two byte index into the relocation table. */ 567 /* An entry in the SunOS linker hash table. */ 586 the symbol does not require a GOT entry, this is 0. */ 590 If the symbol does not require a PLT entry, thi 641 sunos_link_hash_newfunc(struct bfd_hash_entry *entry, struct bfd_hash_table *table, const char *string) argument [all...] |
H A D | xcofflink.c | 45 /* The next entry in the list. */ 63 when the reloc was handled, the global hash table entry. */ 67 an entry is added to this linked list. This is not an array, 402 /* Routine to create an entry in an XCOFF link hash table. */ 405 xcoff_link_hash_newfunc (struct bfd_hash_entry *entry, 409 struct xcoff_link_hash_entry *ret = (struct xcoff_link_hash_entry *) entry; 750 /* For some reason, the path entry in the import file list for a 932 considered a section in its own right. For example, a TOC entry is 1287 they both have a relocation table entry for an external 1344 /* At this point we know that the TOC entry i 403 xcoff_link_hash_newfunc(struct bfd_hash_entry *entry, struct bfd_hash_table *table, const char *string) argument 2963 bfd_xcoff_size_dynamic_sections(bfd *output_bfd, struct bfd_link_info *info, const char *libpath, const char *entry, unsigned long file_align, unsigned long maxstack, unsigned long maxdata, bfd_boolean gc, int modtype, bfd_boolean textro, bfd_boolean export_defineds, asection **special_sections, bfd_boolean rtld) argument [all...] |
/freebsd-11-stable/contrib/binutils/binutils/ |
H A D | dlltool.c | 110 printf ("hello from the dll and the other entry point %s\n", s); 125 printf ("hello from the dll and the other entry point %s\n", s); 214 .idata$3 = null terminating entry for .idata$2. 549 int how_jtab_size; /* Size of the jtab entry. */ 1075 or entry, and there may or may not be an ordinal value associated 1098 or NULL. Exactly one of <entry> or <ord_val> must be 1103 const char *entry, int ord_val) 1108 if (entry != NULL) 1109 application_name = entry; 3390 to avoid exporting DLL entry poin 1102 def_import(const char *app_name, const char *module, const char *dllext, const char *entry, int ord_val) argument [all...] |
H A D | dwarf.c | 200 /* This variable hold the number of the last entry seen 260 printf (_(" define new File Table entry\n")); 314 unsigned long entry; member in struct:abbrev_entry 354 abbrev_entry *entry; local 356 entry = malloc (sizeof (*entry)); 358 if (entry == NULL) 362 entry->entry = number; 363 entry 414 unsigned long entry; local 1694 abbrev_entry *entry; local 2250 abbrev_entry *entry; local [all...] |
H A D | ieee.c | 34 /* This structure holds an entry on the block stack. */ 3696 /* Next entry on stack. */ 4512 /* Get an entry to the list of modified versions of a type. */ 4540 /* Initialize an entry in the hash table. */ argument 4543 ieee_name_type_newfunc (struct bfd_hash_entry *entry, 4547 (struct ieee_name_type_hash_entry *) entry; 4569 /* Look up an entry in the hash table. */ 4636 last entry in the global types, so we add a dummy entry. */ 5153 is not used for line numbers, since the lineno entry poin [all...] |