1 /* bfdlink.h -- header file for BFD link routines
2 Copyright (C) 1993-2015 Free Software Foundation, Inc.
3 Written by Steve Chamberlain and Ian Lance Taylor, Cygnus Support.
5 This file is part of BFD, the Binary File Descriptor library.
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3 of the License, or
10 (at your option) any later version.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software
19 Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
20 MA 02110-1301, USA. */
25 /* Which symbols to strip during a link. */
28 strip_none, /* Don't strip any symbols. */
29 strip_debugger, /* Strip debugging symbols. */
30 strip_some, /* keep_hash is the list of symbols to keep. */
31 strip_all /* Strip all symbols. */
34 /* Which local symbols to discard during a link. This is irrelevant
35 if strip_all is used. */
38 discard_sec_merge, /* Discard local temporary symbols in SEC_MERGE
40 discard_none, /* Don't discard any locals. */
41 discard_l, /* Discard local temporary symbols. */
42 discard_all /* Discard all locals. */
45 /* Describes the type of hash table entry structure being used.
46 Different hash table structure have different fields and so
47 support different linking features. */
48 enum bfd_link_hash_table_type
50 bfd_link_generic_hash_table,
51 bfd_link_elf_hash_table
54 /* These are the possible types of an entry in the BFD link hash
57 enum bfd_link_hash_type
59 bfd_link_hash_new, /* Symbol is new. */
60 bfd_link_hash_undefined, /* Symbol seen before, but undefined. */
61 bfd_link_hash_undefweak, /* Symbol is weak and undefined. */
62 bfd_link_hash_defined, /* Symbol is defined. */
63 bfd_link_hash_defweak, /* Symbol is weak and defined. */
64 bfd_link_hash_common, /* Symbol is common. */
65 bfd_link_hash_indirect, /* Symbol is an indirect link. */
66 bfd_link_hash_warning /* Like indirect, but warn if referenced. */
69 enum bfd_link_common_skip_ar_symbols
71 bfd_link_common_skip_none,
72 bfd_link_common_skip_text,
73 bfd_link_common_skip_data,
74 bfd_link_common_skip_all
77 struct bfd_link_hash_common_entry
79 unsigned int alignment_power; /* Alignment. */
80 asection *section; /* Symbol section. */
83 /* The linking routines use a hash table which uses this structure for
86 struct bfd_link_hash_entry
88 /* Base hash table entry structure. */
89 struct bfd_hash_entry root;
91 /* Type of this entry. */
92 ENUM_BITFIELD (bfd_link_hash_type) type : 8;
94 /* Symbol is referenced in a normal object file, as distict from a LTO
96 unsigned int non_ir_ref : 1;
98 /* Symbol is a built-in define. These will be overridden by PROVIDE
99 in a linker script. */
100 unsigned int linker_def : 1;
102 /* A union of information depending upon the type. */
105 /* Nothing is kept for bfd_hash_new. */
106 /* bfd_link_hash_undefined, bfd_link_hash_undefweak. */
109 /* Undefined and common symbols are kept in a linked list through
110 this field. This field is present in all of the union element
111 so that we don't need to remove entries from the list when we
112 change their type. Removing entries would either require the
113 list to be doubly linked, which would waste more memory, or
114 require a traversal. When an undefined or common symbol is
115 created, it should be added to this list, the head of which is in
116 the link hash table itself. As symbols are defined, they need
117 not be removed from the list; anything which reads the list must
118 doublecheck the symbol type.
120 Weak symbols are not kept on this list.
122 Defined and defweak symbols use this field as a reference marker.
123 If the field is not NULL, or this structure is the tail of the
124 undefined symbol list, the symbol has been referenced. If the
125 symbol is undefined and becomes defined, this field will
126 automatically be non-NULL since the symbol will have been on the
127 undefined symbol list. */
128 struct bfd_link_hash_entry *next;
129 bfd *abfd; /* BFD symbol was found in. */
131 /* bfd_link_hash_defined, bfd_link_hash_defweak. */
134 struct bfd_link_hash_entry *next;
135 asection *section; /* Symbol section. */
136 bfd_vma value; /* Symbol value. */
138 /* bfd_link_hash_indirect, bfd_link_hash_warning. */
141 struct bfd_link_hash_entry *next;
142 struct bfd_link_hash_entry *link; /* Real symbol. */
143 const char *warning; /* Warning (bfd_link_hash_warning only). */
145 /* bfd_link_hash_common. */
148 struct bfd_link_hash_entry *next;
149 /* The linker needs to know three things about common
150 symbols: the size, the alignment, and the section in
151 which the symbol should be placed. We store the size
152 here, and we allocate a small structure to hold the
153 section and the alignment. The alignment is stored as a
154 power of two. We don't store all the information
155 directly because we don't want to increase the size of
156 the union; this structure is a major space user in the
158 struct bfd_link_hash_common_entry *p;
159 bfd_size_type size; /* Common symbol size. */
164 /* This is the link hash table. It is a derived class of
167 struct bfd_link_hash_table
169 /* The hash table itself. */
170 struct bfd_hash_table table;
171 /* A linked list of undefined and common symbols, linked through the
172 next field in the bfd_link_hash_entry structure. */
173 struct bfd_link_hash_entry *undefs;
174 /* Entries are added to the tail of the undefs list. */
175 struct bfd_link_hash_entry *undefs_tail;
176 /* Function to free the hash table on closing BFD. */
177 void (*hash_table_free) (bfd *);
178 /* The type of the link hash table. */
179 enum bfd_link_hash_table_type type;
182 /* Look up an entry in a link hash table. If FOLLOW is TRUE, this
183 follows bfd_link_hash_indirect and bfd_link_hash_warning links to
185 extern struct bfd_link_hash_entry *bfd_link_hash_lookup
186 (struct bfd_link_hash_table *, const char *, bfd_boolean create,
187 bfd_boolean copy, bfd_boolean follow);
189 /* Look up an entry in the main linker hash table if the symbol might
190 be wrapped. This should only be used for references to an
191 undefined symbol, not for definitions of a symbol. */
193 extern struct bfd_link_hash_entry *bfd_wrapped_link_hash_lookup
194 (bfd *, struct bfd_link_info *, const char *, bfd_boolean,
195 bfd_boolean, bfd_boolean);
197 /* If H is a wrapped symbol, ie. the symbol name starts with "__wrap_"
198 and the remainder is found in wrap_hash, return the real symbol. */
200 extern struct bfd_link_hash_entry *unwrap_hash_lookup
201 (struct bfd_link_info *, bfd *, struct bfd_link_hash_entry *);
203 /* Traverse a link hash table. */
204 extern void bfd_link_hash_traverse
205 (struct bfd_link_hash_table *,
206 bfd_boolean (*) (struct bfd_link_hash_entry *, void *),
209 /* Add an entry to the undefs list. */
210 extern void bfd_link_add_undef
211 (struct bfd_link_hash_table *, struct bfd_link_hash_entry *);
213 /* Remove symbols from the undefs list that don't belong there. */
214 extern void bfd_link_repair_undef_list
215 (struct bfd_link_hash_table *table);
217 /* Read symbols and cache symbol pointer array in outsymbols. */
218 extern bfd_boolean bfd_generic_link_read_symbols (bfd *);
222 struct bfd_sym_chain *next;
226 /* How to handle unresolved symbols.
227 There are four possibilities which are enumerated below: */
230 /* This is the initial value when then link_info structure is created.
231 It allows the various stages of the linker to determine whether they
232 allowed to set the value. */
239 typedef enum {with_flags, without_flags} flag_type;
241 /* A section flag list. */
242 struct flag_info_list
247 struct flag_info_list *next;
250 /* Section flag info. */
253 flagword only_with_flags;
254 flagword not_with_flags;
255 struct flag_info_list *flag_list;
256 bfd_boolean flags_initialized;
259 struct bfd_elf_dynamic_list;
260 struct bfd_elf_version_tree;
262 /* This structure holds all the information needed to communicate
263 between BFD and the linker when doing a link. */
267 /* TRUE if BFD should generate a shared object (or a pie). */
268 unsigned int shared: 1;
270 /* TRUE if generating an executable, position independent or not. */
271 unsigned int executable : 1;
273 /* TRUE if generating a position independent executable. */
276 /* TRUE if BFD should generate a relocatable object file. */
277 unsigned int relocatable: 1;
279 /* TRUE if BFD should pre-bind symbols in a shared object. */
280 unsigned int symbolic: 1;
282 /* TRUE if executable should not contain copy relocs.
283 Setting this true may result in a non-sharable text segment. */
284 unsigned int nocopyreloc: 1;
286 /* TRUE if BFD should export all symbols in the dynamic symbol table
287 of an executable, rather than only those used. */
288 unsigned int export_dynamic: 1;
290 /* TRUE if a default symbol version should be created and used for
292 unsigned int create_default_symver: 1;
294 /* TRUE if unreferenced sections should be removed. */
295 unsigned int gc_sections: 1;
297 /* TRUE if every symbol should be reported back via the notice
299 unsigned int notice_all: 1;
301 /* TRUE if the LTO plugin is active. */
302 unsigned int lto_plugin_active: 1;
304 /* TRUE if global symbols in discarded sections should be stripped. */
305 unsigned int strip_discarded: 1;
307 /* TRUE if all data symbols should be dynamic. */
308 unsigned int dynamic_data: 1;
310 /* Which symbols to strip. */
311 ENUM_BITFIELD (bfd_link_strip) strip : 2;
313 /* Which local symbols to discard. */
314 ENUM_BITFIELD (bfd_link_discard) discard : 2;
316 /* Criteria for skipping symbols when determining
317 whether to include an object from an archive. */
318 ENUM_BITFIELD (bfd_link_common_skip_ar_symbols) common_skip_ar_symbols : 2;
320 /* What to do with unresolved symbols in an object file.
321 When producing executables the default is GENERATE_ERROR.
322 When producing shared libraries the default is IGNORE. The
323 assumption with shared libraries is that the reference will be
324 resolved at load/execution time. */
325 ENUM_BITFIELD (report_method) unresolved_syms_in_objects : 2;
327 /* What to do with unresolved symbols in a shared library.
328 The same defaults apply. */
329 ENUM_BITFIELD (report_method) unresolved_syms_in_shared_libs : 2;
331 /* TRUE if shared objects should be linked directly, not shared. */
332 unsigned int static_link: 1;
334 /* TRUE if symbols should be retained in memory, FALSE if they
335 should be freed and reread. */
336 unsigned int keep_memory: 1;
338 /* TRUE if BFD should generate relocation information in the final
340 unsigned int emitrelocations: 1;
342 /* TRUE if PT_GNU_RELRO segment should be created. */
343 unsigned int relro: 1;
345 /* TRUE if .eh_frame_hdr section and PT_GNU_EH_FRAME ELF segment
346 should be created. */
347 unsigned int eh_frame_hdr: 1;
349 /* TRUE if we should warn when adding a DT_TEXTREL to a shared object. */
350 unsigned int warn_shared_textrel: 1;
352 /* TRUE if we should error when adding a DT_TEXTREL. */
353 unsigned int error_textrel: 1;
355 /* TRUE if .hash section should be created. */
356 unsigned int emit_hash: 1;
358 /* TRUE if .gnu.hash section should be created. */
359 unsigned int emit_gnu_hash: 1;
361 /* If TRUE reduce memory overheads, at the expense of speed. This will
362 cause map file generation to use an O(N^2) algorithm and disable
363 caching ELF symbol buffer. */
364 unsigned int reduce_memory_overheads: 1;
366 /* TRUE if the output file should be in a traditional format. This
367 is equivalent to the setting of the BFD_TRADITIONAL_FORMAT flag
368 on the output file, but may be checked when reading the input
370 unsigned int traditional_format: 1;
372 /* TRUE if non-PLT relocs should be merged into one reloc section
373 and sorted so that relocs against the same symbol come together. */
374 unsigned int combreloc: 1;
376 /* TRUE if a default symbol version should be created and used for
378 unsigned int default_imported_symver: 1;
380 /* TRUE if the new ELF dynamic tags are enabled. */
381 unsigned int new_dtags: 1;
383 /* FALSE if .eh_frame unwind info should be generated for PLT and other
384 linker created sections, TRUE if it should be omitted. */
385 unsigned int no_ld_generated_unwind_info: 1;
387 /* TRUE if BFD should generate a "task linked" object file,
388 similar to relocatable but also with globals converted to
390 unsigned int task_link: 1;
392 /* TRUE if ok to have multiple definition. */
393 unsigned int allow_multiple_definition: 1;
395 /* TRUE if ok to have version with no definition. */
396 unsigned int allow_undefined_version: 1;
398 /* TRUE if some symbols have to be dynamic, controlled by
399 --dynamic-list command line options. */
400 unsigned int dynamic: 1;
402 /* TRUE if PT_GNU_STACK segment should be created with PF_R|PF_W|PF_X
404 unsigned int execstack: 1;
406 /* TRUE if PT_GNU_STACK segment should be created with PF_R|PF_W
408 unsigned int noexecstack: 1;
410 /* TRUE if we want to produced optimized output files. This might
411 need much more time and therefore must be explicitly selected. */
412 unsigned int optimize: 1;
414 /* TRUE if user should be informed of removed unreferenced sections. */
415 unsigned int print_gc_sections: 1;
417 /* TRUE if we should warn alternate ELF machine code. */
418 unsigned int warn_alternate_em: 1;
420 /* TRUE if the linker script contained an explicit PHDRS command. */
421 unsigned int user_phdrs: 1;
423 /* TRUE if BND prefix in PLT entries is always generated. */
424 unsigned int bndplt: 1;
426 /* Char that may appear as the first char of a symbol, but should be
427 skipped (like symbol_leading_char) when looking up symbols in
428 wrap_hash. Used by PowerPC Linux for 'dot' symbols. */
431 /* Separator between archive and filename in linker script filespecs. */
434 /* Default stack size. Zero means default (often zero itself), -1
435 means explicitly zero-sized. */
436 bfd_signed_vma stacksize;
438 /* Enable or disable target specific optimizations.
440 Not all targets have optimizations to enable.
442 Normally these optimizations are disabled by default but some targets
443 prefer to enable them by default. So this field is a tri-state variable.
446 zero: Enable the optimizations (either from --relax being specified on
447 the command line or the backend's before_allocation emulation function.
449 positive: The user has requested that these optimizations be disabled.
450 (Via the --no-relax command line option).
452 negative: The optimizations are disabled. (Set when initializing the
453 args_type structure in ldmain.c:main. */
454 signed int disable_target_specific_optimizations;
456 /* Function callbacks. */
457 const struct bfd_link_callbacks *callbacks;
459 /* Hash table handled by BFD. */
460 struct bfd_link_hash_table *hash;
462 /* Hash table of symbols to keep. This is NULL unless strip is
464 struct bfd_hash_table *keep_hash;
466 /* Hash table of symbols to report back via the notice callback. If
467 this is NULL, and notice_all is FALSE, then no symbols are
469 struct bfd_hash_table *notice_hash;
471 /* Hash table of symbols which are being wrapped (the --wrap linker
472 option). If this is NULL, no symbols are being wrapped. */
473 struct bfd_hash_table *wrap_hash;
475 /* Hash table of symbols which may be left unresolved during
476 a link. If this is NULL, no symbols can be left unresolved. */
477 struct bfd_hash_table *ignore_hash;
479 /* The output BFD. */
482 /* The list of input BFD's involved in the link. These are chained
483 together via the link.next field. */
485 bfd **input_bfds_tail;
487 /* If a symbol should be created for each input BFD, this is section
488 where those symbols should be placed. It must be a section in
489 the output BFD. It may be NULL, in which case no such symbols
490 will be created. This is to support CREATE_OBJECT_SYMBOLS in the
491 linker command language. */
492 asection *create_object_symbols_section;
494 /* List of global symbol names that are starting points for marking
495 sections against garbage collection. */
496 struct bfd_sym_chain *gc_sym_list;
498 /* If a base output file is wanted, then this points to it */
501 /* The function to call when the executable or shared object is
503 const char *init_function;
505 /* The function to call when the executable or shared object is
507 const char *fini_function;
509 /* Number of relaxation passes. Usually only one relaxation pass
510 is needed. But a backend can have as many relaxation passes as
511 necessary. During bfd_relax_section call, it is set to the
512 current pass, starting from 0. */
515 /* Number of relaxation trips. This number is incremented every
516 time the relaxation pass is restarted due to a previous
517 relaxation returning true in *AGAIN. */
520 /* Non-zero if auto-import thunks for DATA items in pei386 DLLs
521 should be generated/linked against. Set to 1 if this feature
522 is explicitly requested by the user, -1 if enabled by default. */
523 int pei386_auto_import;
525 /* Non-zero if runtime relocs for DATA items with non-zero addends
526 in pei386 DLLs should be generated. Set to 1 if this feature
527 is explicitly requested by the user, -1 if enabled by default. */
528 int pei386_runtime_pseudo_reloc;
530 /* How many spare .dynamic DT_NULL entries should be added? */
531 unsigned int spare_dynamic_tags;
533 /* May be used to set DT_FLAGS for ELF. */
536 /* May be used to set DT_FLAGS_1 for ELF. */
539 /* Start and end of RELRO region. */
540 bfd_vma relro_start, relro_end;
542 /* List of symbols should be dynamic. */
543 struct bfd_elf_dynamic_list *dynamic_list;
545 /* The version information. */
546 struct bfd_elf_version_tree *version_info;
549 /* This structures holds a set of callback functions. These are called
550 by the BFD linker routines. Except for the info functions, the first
551 argument to each callback function is the bfd_link_info structure
552 being used and each function returns a boolean value. If the
553 function returns FALSE, then the BFD function which called it should
554 return with a failure indication. */
556 struct bfd_link_callbacks
558 /* A function which is called when an object is added from an
559 archive. ABFD is the archive element being added. NAME is the
560 name of the symbol which caused the archive element to be pulled
561 in. This function may set *SUBSBFD to point to an alternative
562 BFD from which symbols should in fact be added in place of the
563 original BFD's symbols. */
564 bfd_boolean (*add_archive_element)
565 (struct bfd_link_info *, bfd *abfd, const char *name, bfd **subsbfd);
566 /* A function which is called when a symbol is found with multiple
567 definitions. H is the symbol which is defined multiple times.
568 NBFD is the new BFD, NSEC is the new section, and NVAL is the new
569 value. NSEC may be bfd_com_section or bfd_ind_section. */
570 bfd_boolean (*multiple_definition)
571 (struct bfd_link_info *, struct bfd_link_hash_entry *h,
572 bfd *nbfd, asection *nsec, bfd_vma nval);
573 /* A function which is called when a common symbol is defined
574 multiple times. H is the symbol appearing multiple times.
575 NBFD is the BFD of the new symbol. NTYPE is the type of the new
576 symbol, one of bfd_link_hash_defined, bfd_link_hash_common, or
577 bfd_link_hash_indirect. If NTYPE is bfd_link_hash_common, NSIZE
578 is the size of the new symbol. */
579 bfd_boolean (*multiple_common)
580 (struct bfd_link_info *, struct bfd_link_hash_entry *h,
581 bfd *nbfd, enum bfd_link_hash_type ntype, bfd_vma nsize);
582 /* A function which is called to add a symbol to a set. ENTRY is
583 the link hash table entry for the set itself (e.g.,
584 __CTOR_LIST__). RELOC is the relocation to use for an entry in
585 the set when generating a relocatable file, and is also used to
586 get the size of the entry when generating an executable file.
587 ABFD, SEC and VALUE identify the value to add to the set. */
588 bfd_boolean (*add_to_set)
589 (struct bfd_link_info *, struct bfd_link_hash_entry *entry,
590 bfd_reloc_code_real_type reloc, bfd *abfd, asection *sec, bfd_vma value);
591 /* A function which is called when the name of a g++ constructor or
592 destructor is found. This is only called by some object file
593 formats. CONSTRUCTOR is TRUE for a constructor, FALSE for a
594 destructor. This will use BFD_RELOC_CTOR when generating a
595 relocatable file. NAME is the name of the symbol found. ABFD,
596 SECTION and VALUE are the value of the symbol. */
597 bfd_boolean (*constructor)
598 (struct bfd_link_info *, bfd_boolean constructor, const char *name,
599 bfd *abfd, asection *sec, bfd_vma value);
600 /* A function which is called to issue a linker warning. For
601 example, this is called when there is a reference to a warning
602 symbol. WARNING is the warning to be issued. SYMBOL is the name
603 of the symbol which triggered the warning; it may be NULL if
604 there is none. ABFD, SECTION and ADDRESS identify the location
605 which trigerred the warning; either ABFD or SECTION or both may
606 be NULL if the location is not known. */
607 bfd_boolean (*warning)
608 (struct bfd_link_info *, const char *warning, const char *symbol,
609 bfd *abfd, asection *section, bfd_vma address);
610 /* A function which is called when a relocation is attempted against
611 an undefined symbol. NAME is the symbol which is undefined.
612 ABFD, SECTION and ADDRESS identify the location from which the
613 reference is made. IS_FATAL indicates whether an undefined symbol is
614 a fatal error or not. In some cases SECTION may be NULL. */
615 bfd_boolean (*undefined_symbol)
616 (struct bfd_link_info *, const char *name, bfd *abfd,
617 asection *section, bfd_vma address, bfd_boolean is_fatal);
618 /* A function which is called when a reloc overflow occurs. ENTRY is
619 the link hash table entry for the symbol the reloc is against.
620 NAME is the name of the local symbol or section the reloc is
621 against, RELOC_NAME is the name of the relocation, and ADDEND is
622 any addend that is used. ABFD, SECTION and ADDRESS identify the
623 location at which the overflow occurs; if this is the result of a
624 bfd_section_reloc_link_order or bfd_symbol_reloc_link_order, then
625 ABFD will be NULL. */
626 bfd_boolean (*reloc_overflow)
627 (struct bfd_link_info *, struct bfd_link_hash_entry *entry,
628 const char *name, const char *reloc_name, bfd_vma addend,
629 bfd *abfd, asection *section, bfd_vma address);
630 /* A function which is called when a dangerous reloc is performed.
631 MESSAGE is an appropriate message.
632 ABFD, SECTION and ADDRESS identify the location at which the
633 problem occurred; if this is the result of a
634 bfd_section_reloc_link_order or bfd_symbol_reloc_link_order, then
635 ABFD will be NULL. */
636 bfd_boolean (*reloc_dangerous)
637 (struct bfd_link_info *, const char *message,
638 bfd *abfd, asection *section, bfd_vma address);
639 /* A function which is called when a reloc is found to be attached
640 to a symbol which is not being written out. NAME is the name of
641 the symbol. ABFD, SECTION and ADDRESS identify the location of
642 the reloc; if this is the result of a
643 bfd_section_reloc_link_order or bfd_symbol_reloc_link_order, then
644 ABFD will be NULL. */
645 bfd_boolean (*unattached_reloc)
646 (struct bfd_link_info *, const char *name,
647 bfd *abfd, asection *section, bfd_vma address);
648 /* A function which is called when a symbol in notice_hash is
649 defined or referenced. H is the symbol, INH the indirect symbol
650 if applicable. ABFD, SECTION and ADDRESS are the (new) value of
651 the symbol. If SECTION is bfd_und_section, this is a reference.
652 FLAGS are the symbol BSF_* flags. */
653 bfd_boolean (*notice)
654 (struct bfd_link_info *, struct bfd_link_hash_entry *h,
655 struct bfd_link_hash_entry *inh,
656 bfd *abfd, asection *section, bfd_vma address, flagword flags);
657 /* Error or warning link info message. */
659 (const char *fmt, ...);
660 /* General link info message. */
662 (const char *fmt, ...);
663 /* Message to be printed in linker map file. */
665 (const char *fmt, ...);
666 /* This callback provides a chance for users of the BFD library to
667 override its decision about whether to place two adjacent sections
668 into the same segment. */
669 bfd_boolean (*override_segment_assignment)
670 (struct bfd_link_info *, bfd * abfd,
671 asection * current_section, asection * previous_section,
672 bfd_boolean new_segment);
675 /* The linker builds link_order structures which tell the code how to
676 include input data in the output file. */
678 /* These are the types of link_order structures. */
680 enum bfd_link_order_type
682 bfd_undefined_link_order, /* Undefined. */
683 bfd_indirect_link_order, /* Built from a section. */
684 bfd_data_link_order, /* Set to explicit data. */
685 bfd_section_reloc_link_order, /* Relocate against a section. */
686 bfd_symbol_reloc_link_order /* Relocate against a symbol. */
689 /* This is the link_order structure itself. These form a chain
690 attached to the output section whose contents they are describing. */
692 struct bfd_link_order
694 /* Next link_order in chain. */
695 struct bfd_link_order *next;
696 /* Type of link_order. */
697 enum bfd_link_order_type type;
698 /* Offset within output section. */
700 /* Size within output section. */
702 /* Type specific information. */
707 /* Section to include. If this is used, then
708 section->output_section must be the section the
709 link_order is attached to, section->output_offset must
710 equal the link_order offset field, and section->size
711 must equal the link_order size field. Maybe these
712 restrictions should be relaxed someday. */
717 /* Size of contents, or zero when contents should be filled by
718 the architecture-dependent fill function.
719 A non-zero value allows filling of the output section
720 with an arbitrary repeated pattern. */
722 /* Data to put into file. */
727 /* Description of reloc to generate. Used for
728 bfd_section_reloc_link_order and
729 bfd_symbol_reloc_link_order. */
730 struct bfd_link_order_reloc *p;
735 /* A linker order of type bfd_section_reloc_link_order or
736 bfd_symbol_reloc_link_order means to create a reloc against a
737 section or symbol, respectively. This is used to implement -Ur to
738 generate relocs for the constructor tables. The
739 bfd_link_order_reloc structure describes the reloc that BFD should
740 create. It is similar to a arelent, but I didn't use arelent
741 because the linker does not know anything about most symbols, and
742 any asymbol structure it creates will be partially meaningless.
743 This information could logically be in the bfd_link_order struct,
744 but I didn't want to waste the space since these types of relocs
745 are relatively rare. */
747 struct bfd_link_order_reloc
750 bfd_reloc_code_real_type reloc;
754 /* For type bfd_section_reloc_link_order, this is the section
755 the reloc should be against. This must be a section in the
756 output BFD, not any of the input BFDs. */
758 /* For type bfd_symbol_reloc_link_order, this is the name of the
759 symbol the reloc should be against. */
763 /* Addend to use. The object file should contain zero. The BFD
764 backend is responsible for filling in the contents of the object
765 file correctly. For some object file formats (e.g., COFF) the
766 addend must be stored into in the object file, and for some
767 (e.g., SPARC a.out) it is kept in the reloc. */
771 /* Allocate a new link_order for a section. */
772 extern struct bfd_link_order *bfd_new_link_order (bfd *, asection *);
774 /* These structures are used to describe version information for the
775 ELF linker. These structures could be manipulated entirely inside
776 BFD, but it would be a pain. Instead, the regular linker sets up
777 these structures, and then passes them into BFD. */
779 /* Glob pattern for a version. */
781 struct bfd_elf_version_expr
783 /* Next glob pattern for this version. */
784 struct bfd_elf_version_expr *next;
787 /* Set if pattern is not a glob. */
788 unsigned int literal : 1;
789 /* Defined by ".symver". */
790 unsigned int symver : 1;
791 /* Defined by version script. */
792 unsigned int script : 1;
794 #define BFD_ELF_VERSION_C_TYPE 1
795 #define BFD_ELF_VERSION_CXX_TYPE 2
796 #define BFD_ELF_VERSION_JAVA_TYPE 4
797 unsigned int mask : 3;
800 struct bfd_elf_version_expr_head
802 /* List of all patterns, both wildcards and non-wildcards. */
803 struct bfd_elf_version_expr *list;
804 /* Hash table for non-wildcards. */
806 /* Remaining patterns. */
807 struct bfd_elf_version_expr *remaining;
808 /* What kind of pattern types are present in list (bitmask). */
812 /* Version dependencies. */
814 struct bfd_elf_version_deps
816 /* Next dependency for this version. */
817 struct bfd_elf_version_deps *next;
818 /* The version which this version depends upon. */
819 struct bfd_elf_version_tree *version_needed;
822 /* A node in the version tree. */
824 struct bfd_elf_version_tree
827 struct bfd_elf_version_tree *next;
828 /* Name of this version. */
830 /* Version number. */
832 /* Regular expressions for global symbols in this version. */
833 struct bfd_elf_version_expr_head globals;
834 /* Regular expressions for local symbols in this version. */
835 struct bfd_elf_version_expr_head locals;
836 /* List of versions which this version depends upon. */
837 struct bfd_elf_version_deps *deps;
838 /* Index of the version name. This is used within BFD. */
839 unsigned int name_indx;
840 /* Whether this version tree was used. This is used within BFD. */
843 struct bfd_elf_version_expr *(*match)
844 (struct bfd_elf_version_expr_head *head,
845 struct bfd_elf_version_expr *prev, const char *sym);
848 struct bfd_elf_dynamic_list
850 struct bfd_elf_version_expr_head head;
851 struct bfd_elf_version_expr *(*match)
852 (struct bfd_elf_version_expr_head *head,
853 struct bfd_elf_version_expr *prev, const char *sym);