1 /* bfdlink.h -- header file for BFD link routines
2 Copyright 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
3 2003, 2004, 2005, 2006, 2007, 2008 Free Software Foundation, Inc.
4 Written by Steve Chamberlain and Ian Lance Taylor, Cygnus Support.
6 This file is part of BFD, the Binary File Descriptor library.
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software
20 Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
21 MA 02110-1301, USA. */
26 /* Which symbols to strip during a link. */
29 strip_none, /* Don't strip any symbols. */
30 strip_debugger, /* Strip debugging symbols. */
31 strip_some, /* keep_hash is the list of symbols to keep. */
32 strip_all /* Strip all symbols. */
35 /* Which local symbols to discard during a link. This is irrelevant
36 if strip_all is used. */
39 discard_sec_merge, /* Discard local temporary symbols in SEC_MERGE
41 discard_none, /* Don't discard any locals. */
42 discard_l, /* Discard local temporary symbols. */
43 discard_all /* Discard all locals. */
46 /* Describes the type of hash table entry structure being used.
47 Different hash table structure have different fields and so
48 support different linking features. */
49 enum bfd_link_hash_table_type
51 bfd_link_generic_hash_table,
52 bfd_link_elf_hash_table
55 /* These are the possible types of an entry in the BFD link hash
58 enum bfd_link_hash_type
60 bfd_link_hash_new, /* Symbol is new. */
61 bfd_link_hash_undefined, /* Symbol seen before, but undefined. */
62 bfd_link_hash_undefweak, /* Symbol is weak and undefined. */
63 bfd_link_hash_defined, /* Symbol is defined. */
64 bfd_link_hash_defweak, /* Symbol is weak and defined. */
65 bfd_link_hash_common, /* Symbol is common. */
66 bfd_link_hash_indirect, /* Symbol is an indirect link. */
67 bfd_link_hash_warning /* Like indirect, but warn if referenced. */
70 enum bfd_link_common_skip_ar_aymbols
72 bfd_link_common_skip_none,
73 bfd_link_common_skip_text,
74 bfd_link_common_skip_data,
75 bfd_link_common_skip_all
78 /* The linking routines use a hash table which uses this structure for
81 struct bfd_link_hash_entry
83 /* Base hash table entry structure. */
84 struct bfd_hash_entry root;
86 /* Type of this entry. */
87 enum bfd_link_hash_type type;
89 /* A union of information depending upon the type. */
92 /* Nothing is kept for bfd_hash_new. */
93 /* bfd_link_hash_undefined, bfd_link_hash_undefweak. */
96 /* Undefined and common symbols are kept in a linked list through
97 this field. This field is present in all of the union element
98 so that we don't need to remove entries from the list when we
99 change their type. Removing entries would either require the
100 list to be doubly linked, which would waste more memory, or
101 require a traversal. When an undefined or common symbol is
102 created, it should be added to this list, the head of which is in
103 the link hash table itself. As symbols are defined, they need
104 not be removed from the list; anything which reads the list must
105 doublecheck the symbol type.
107 Weak symbols are not kept on this list.
109 Defined and defweak symbols use this field as a reference marker.
110 If the field is not NULL, or this structure is the tail of the
111 undefined symbol list, the symbol has been referenced. If the
112 symbol is undefined and becomes defined, this field will
113 automatically be non-NULL since the symbol will have been on the
114 undefined symbol list. */
115 struct bfd_link_hash_entry *next;
116 bfd *abfd; /* BFD symbol was found in. */
117 bfd *weak; /* BFD weak symbol was found in. */
119 /* bfd_link_hash_defined, bfd_link_hash_defweak. */
122 struct bfd_link_hash_entry *next;
123 asection *section; /* Symbol section. */
124 bfd_vma value; /* Symbol value. */
126 /* bfd_link_hash_indirect, bfd_link_hash_warning. */
129 struct bfd_link_hash_entry *next;
130 struct bfd_link_hash_entry *link; /* Real symbol. */
131 const char *warning; /* Warning (bfd_link_hash_warning only). */
133 /* bfd_link_hash_common. */
136 struct bfd_link_hash_entry *next;
137 /* The linker needs to know three things about common
138 symbols: the size, the alignment, and the section in
139 which the symbol should be placed. We store the size
140 here, and we allocate a small structure to hold the
141 section and the alignment. The alignment is stored as a
142 power of two. We don't store all the information
143 directly because we don't want to increase the size of
144 the union; this structure is a major space user in the
146 struct bfd_link_hash_common_entry
148 unsigned int alignment_power; /* Alignment. */
149 asection *section; /* Symbol section. */
151 bfd_size_type size; /* Common symbol size. */
156 /* This is the link hash table. It is a derived class of
159 struct bfd_link_hash_table
161 /* The hash table itself. */
162 struct bfd_hash_table table;
163 /* A linked list of undefined and common symbols, linked through the
164 next field in the bfd_link_hash_entry structure. */
165 struct bfd_link_hash_entry *undefs;
166 /* Entries are added to the tail of the undefs list. */
167 struct bfd_link_hash_entry *undefs_tail;
168 /* The type of the link hash table. */
169 enum bfd_link_hash_table_type type;
172 /* Look up an entry in a link hash table. If FOLLOW is TRUE, this
173 follows bfd_link_hash_indirect and bfd_link_hash_warning links to
175 extern struct bfd_link_hash_entry *bfd_link_hash_lookup
176 (struct bfd_link_hash_table *, const char *, bfd_boolean create,
177 bfd_boolean copy, bfd_boolean follow);
179 /* Look up an entry in the main linker hash table if the symbol might
180 be wrapped. This should only be used for references to an
181 undefined symbol, not for definitions of a symbol. */
183 extern struct bfd_link_hash_entry *bfd_wrapped_link_hash_lookup
184 (bfd *, struct bfd_link_info *, const char *, bfd_boolean,
185 bfd_boolean, bfd_boolean);
187 /* Traverse a link hash table. */
188 extern void bfd_link_hash_traverse
189 (struct bfd_link_hash_table *,
190 bfd_boolean (*) (struct bfd_link_hash_entry *, void *),
193 /* Add an entry to the undefs list. */
194 extern void bfd_link_add_undef
195 (struct bfd_link_hash_table *, struct bfd_link_hash_entry *);
197 /* Remove symbols from the undefs list that don't belong there. */
198 extern void bfd_link_repair_undef_list
199 (struct bfd_link_hash_table *table);
201 /* Read symbols and cache symbol pointer array in outsymbols. */
202 extern bfd_boolean bfd_generic_link_read_symbols (bfd *);
206 struct bfd_sym_chain *next;
210 /* How to handle unresolved symbols.
211 There are four possibilities which are enumerated below: */
214 /* This is the initial value when then link_info structure is created.
215 It allows the various stages of the linker to determine whether they
216 allowed to set the value. */
223 struct bfd_elf_dynamic_list;
225 /* This structure holds all the information needed to communicate
226 between BFD and the linker when doing a link. */
230 /* TRUE if BFD should generate a relocatable object file. */
231 unsigned int relocatable: 1;
233 /* TRUE if BFD should generate relocation information in the final
235 unsigned int emitrelocations: 1;
237 /* TRUE if BFD should generate a "task linked" object file,
238 similar to relocatable but also with globals converted to
240 unsigned int task_link: 1;
242 /* TRUE if BFD should generate a shared object. */
243 unsigned int shared: 1;
245 /* TRUE if BFD should pre-bind symbols in a shared object. */
246 unsigned int symbolic: 1;
248 /* TRUE if BFD should export all symbols in the dynamic symbol table
249 of an executable, rather than only those used. */
250 unsigned int export_dynamic: 1;
252 /* TRUE if shared objects should be linked directly, not shared. */
253 unsigned int static_link: 1;
255 /* TRUE if the output file should be in a traditional format. This
256 is equivalent to the setting of the BFD_TRADITIONAL_FORMAT flag
257 on the output file, but may be checked when reading the input
259 unsigned int traditional_format: 1;
261 /* TRUE if we want to produced optimized output files. This might
262 need much more time and therefore must be explicitly selected. */
263 unsigned int optimize: 1;
265 /* TRUE if ok to have multiple definition. */
266 unsigned int allow_multiple_definition: 1;
268 /* TRUE if ok to have version with no definition. */
269 unsigned int allow_undefined_version: 1;
271 /* TRUE if a default symbol version should be created and used for
273 unsigned int create_default_symver: 1;
275 /* TRUE if a default symbol version should be created and used for
277 unsigned int default_imported_symver: 1;
279 /* TRUE if symbols should be retained in memory, FALSE if they
280 should be freed and reread. */
281 unsigned int keep_memory: 1;
283 /* TRUE if every symbol should be reported back via the notice
285 unsigned int notice_all: 1;
287 /* TRUE if executable should not contain copy relocs.
288 Setting this true may result in a non-sharable text segment. */
289 unsigned int nocopyreloc: 1;
291 /* TRUE if the new ELF dynamic tags are enabled. */
292 unsigned int new_dtags: 1;
294 /* TRUE if non-PLT relocs should be merged into one reloc section
295 and sorted so that relocs against the same symbol come together. */
296 unsigned int combreloc: 1;
298 /* TRUE if .eh_frame_hdr section and PT_GNU_EH_FRAME ELF segment
299 should be created. */
300 unsigned int eh_frame_hdr: 1;
302 /* TRUE if global symbols in discarded sections should be stripped. */
303 unsigned int strip_discarded: 1;
305 /* TRUE if generating a position independent executable. */
308 /* TRUE if generating an executable, position independent or not. */
309 unsigned int executable : 1;
311 /* TRUE if PT_GNU_STACK segment should be created with PF_R|PF_W|PF_X
313 unsigned int execstack: 1;
315 /* TRUE if PT_GNU_STACK segment should be created with PF_R|PF_W
317 unsigned int noexecstack: 1;
319 /* TRUE if PT_GNU_RELRO segment should be created. */
320 unsigned int relro: 1;
322 /* TRUE if we should warn when adding a DT_TEXTREL to a shared object. */
323 unsigned int warn_shared_textrel: 1;
325 /* TRUE if unreferenced sections should be removed. */
326 unsigned int gc_sections: 1;
328 /* TRUE if user shoudl be informed of removed unreferenced sections. */
329 unsigned int print_gc_sections: 1;
331 /* TRUE if .hash section should be created. */
332 unsigned int emit_hash: 1;
334 /* TRUE if .gnu.hash section should be created. */
335 unsigned int emit_gnu_hash: 1;
337 /* If TRUE reduce memory overheads, at the expense of speed. This will
338 cause map file generation to use an O(N^2) algorithm and disable
339 caching ELF symbol buffer. */
340 unsigned int reduce_memory_overheads: 1;
342 /* TRUE if all data symbols should be dynamic. */
343 unsigned int dynamic_data: 1;
345 /* TRUE if some symbols have to be dynamic, controlled by
346 --dynamic-list command line options. */
347 unsigned int dynamic: 1;
349 /* Non-NULL if .note.gnu.build-id section should be created. */
350 char *emit_note_gnu_build_id;
352 /* What to do with unresolved symbols in an object file.
353 When producing executables the default is GENERATE_ERROR.
354 When producing shared libraries the default is IGNORE. The
355 assumption with shared libraries is that the reference will be
356 resolved at load/execution time. */
357 enum report_method unresolved_syms_in_objects;
359 /* What to do with unresolved symbols in a shared library.
360 The same defaults apply. */
361 enum report_method unresolved_syms_in_shared_libs;
363 /* Which symbols to strip. */
364 enum bfd_link_strip strip;
366 /* Which local symbols to discard. */
367 enum bfd_link_discard discard;
369 /* Criteria for skipping symbols when detemining
370 whether to include an object from an archive. */
371 enum bfd_link_common_skip_ar_aymbols common_skip_ar_aymbols;
373 /* Char that may appear as the first char of a symbol, but should be
374 skipped (like symbol_leading_char) when looking up symbols in
375 wrap_hash. Used by PowerPC Linux for 'dot' symbols. */
378 /* Separator between archive and filename in linker script filespecs. */
381 /* Function callbacks. */
382 const struct bfd_link_callbacks *callbacks;
384 /* Hash table handled by BFD. */
385 struct bfd_link_hash_table *hash;
387 /* Hash table of symbols to keep. This is NULL unless strip is
389 struct bfd_hash_table *keep_hash;
391 /* Hash table of symbols to report back via the notice callback. If
392 this is NULL, and notice_all is FALSE, then no symbols are
394 struct bfd_hash_table *notice_hash;
396 /* Hash table of symbols which are being wrapped (the --wrap linker
397 option). If this is NULL, no symbols are being wrapped. */
398 struct bfd_hash_table *wrap_hash;
400 /* The output BFD. */
403 /* The list of input BFD's involved in the link. These are chained
404 together via the link_next field. */
406 bfd **input_bfds_tail;
408 /* If a symbol should be created for each input BFD, this is section
409 where those symbols should be placed. It must be a section in
410 the output BFD. It may be NULL, in which case no such symbols
411 will be created. This is to support CREATE_OBJECT_SYMBOLS in the
412 linker command language. */
413 asection *create_object_symbols_section;
415 /* List of global symbol names that are starting points for marking
416 sections against garbage collection. */
417 struct bfd_sym_chain *gc_sym_list;
419 /* If a base output file is wanted, then this points to it */
422 /* The function to call when the executable or shared object is
424 const char *init_function;
426 /* The function to call when the executable or shared object is
428 const char *fini_function;
430 /* Number of relaxation passes. Usually only one relaxation pass
431 is needed. But a backend can have as many relaxation passes as
432 necessary. During bfd_relax_section call, it is set to the
433 current pass, starting from 0. */
436 /* Number of relaxation trips. This number is incremented every
437 time the relaxation pass is restarted due to a previous
438 relaxation returning true in *AGAIN. */
441 /* Non-zero if auto-import thunks for DATA items in pei386 DLLs
442 should be generated/linked against. Set to 1 if this feature
443 is explicitly requested by the user, -1 if enabled by default. */
444 int pei386_auto_import;
446 /* Non-zero if runtime relocs for DATA items with non-zero addends
447 in pei386 DLLs should be generated. Set to 1 if this feature
448 is explicitly requested by the user, -1 if enabled by default. */
449 int pei386_runtime_pseudo_reloc;
451 /* How many spare .dynamic DT_NULL entries should be added? */
452 unsigned int spare_dynamic_tags;
454 /* May be used to set DT_FLAGS for ELF. */
457 /* May be used to set DT_FLAGS_1 for ELF. */
460 /* Start and end of RELRO region. */
461 bfd_vma relro_start, relro_end;
463 /* List of symbols should be dynamic. */
464 struct bfd_elf_dynamic_list *dynamic_list;
467 /* This structures holds a set of callback functions. These are called
468 by the BFD linker routines. Except for the info functions, the first
469 argument to each callback function is the bfd_link_info structure
470 being used and each function returns a boolean value. If the
471 function returns FALSE, then the BFD function which called it should
472 return with a failure indication. */
474 struct bfd_link_callbacks
476 /* A function which is called when an object is added from an
477 archive. ABFD is the archive element being added. NAME is the
478 name of the symbol which caused the archive element to be pulled
480 bfd_boolean (*add_archive_element)
481 (struct bfd_link_info *, bfd *abfd, const char *name);
482 /* A function which is called when a symbol is found with multiple
483 definitions. NAME is the symbol which is defined multiple times.
484 OBFD is the old BFD, OSEC is the old section, OVAL is the old
485 value, NBFD is the new BFD, NSEC is the new section, and NVAL is
486 the new value. OBFD may be NULL. OSEC and NSEC may be
487 bfd_com_section or bfd_ind_section. */
488 bfd_boolean (*multiple_definition)
489 (struct bfd_link_info *, const char *name,
490 bfd *obfd, asection *osec, bfd_vma oval,
491 bfd *nbfd, asection *nsec, bfd_vma nval);
492 /* A function which is called when a common symbol is defined
493 multiple times. NAME is the symbol appearing multiple times.
494 OBFD is the BFD of the existing symbol; it may be NULL if this is
495 not known. OTYPE is the type of the existing symbol, which may
496 be bfd_link_hash_defined, bfd_link_hash_defweak,
497 bfd_link_hash_common, or bfd_link_hash_indirect. If OTYPE is
498 bfd_link_hash_common, OSIZE is the size of the existing symbol.
499 NBFD is the BFD of the new symbol. NTYPE is the type of the new
500 symbol, one of bfd_link_hash_defined, bfd_link_hash_common, or
501 bfd_link_hash_indirect. If NTYPE is bfd_link_hash_common, NSIZE
502 is the size of the new symbol. */
503 bfd_boolean (*multiple_common)
504 (struct bfd_link_info *, const char *name,
505 bfd *obfd, enum bfd_link_hash_type otype, bfd_vma osize,
506 bfd *nbfd, enum bfd_link_hash_type ntype, bfd_vma nsize);
507 /* A function which is called to add a symbol to a set. ENTRY is
508 the link hash table entry for the set itself (e.g.,
509 __CTOR_LIST__). RELOC is the relocation to use for an entry in
510 the set when generating a relocatable file, and is also used to
511 get the size of the entry when generating an executable file.
512 ABFD, SEC and VALUE identify the value to add to the set. */
513 bfd_boolean (*add_to_set)
514 (struct bfd_link_info *, struct bfd_link_hash_entry *entry,
515 bfd_reloc_code_real_type reloc, bfd *abfd, asection *sec, bfd_vma value);
516 /* A function which is called when the name of a g++ constructor or
517 destructor is found. This is only called by some object file
518 formats. CONSTRUCTOR is TRUE for a constructor, FALSE for a
519 destructor. This will use BFD_RELOC_CTOR when generating a
520 relocatable file. NAME is the name of the symbol found. ABFD,
521 SECTION and VALUE are the value of the symbol. */
522 bfd_boolean (*constructor)
523 (struct bfd_link_info *, bfd_boolean constructor, const char *name,
524 bfd *abfd, asection *sec, bfd_vma value);
525 /* A function which is called to issue a linker warning. For
526 example, this is called when there is a reference to a warning
527 symbol. WARNING is the warning to be issued. SYMBOL is the name
528 of the symbol which triggered the warning; it may be NULL if
529 there is none. ABFD, SECTION and ADDRESS identify the location
530 which trigerred the warning; either ABFD or SECTION or both may
531 be NULL if the location is not known. */
532 bfd_boolean (*warning)
533 (struct bfd_link_info *, const char *warning, const char *symbol,
534 bfd *abfd, asection *section, bfd_vma address);
535 /* A function which is called when a relocation is attempted against
536 an undefined symbol. NAME is the symbol which is undefined.
537 ABFD, SECTION and ADDRESS identify the location from which the
538 reference is made. FATAL indicates whether an undefined symbol is
539 a fatal error or not. In some cases SECTION may be NULL. */
540 bfd_boolean (*undefined_symbol)
541 (struct bfd_link_info *, const char *name, bfd *abfd,
542 asection *section, bfd_vma address, bfd_boolean fatal);
543 /* A function which is called when a reloc overflow occurs. ENTRY is
544 the link hash table entry for the symbol the reloc is against.
545 NAME is the name of the local symbol or section the reloc is
546 against, RELOC_NAME is the name of the relocation, and ADDEND is
547 any addend that is used. ABFD, SECTION and ADDRESS identify the
548 location at which the overflow occurs; if this is the result of a
549 bfd_section_reloc_link_order or bfd_symbol_reloc_link_order, then
550 ABFD will be NULL. */
551 bfd_boolean (*reloc_overflow)
552 (struct bfd_link_info *, struct bfd_link_hash_entry *entry,
553 const char *name, const char *reloc_name, bfd_vma addend,
554 bfd *abfd, asection *section, bfd_vma address);
555 /* A function which is called when a dangerous reloc is performed.
556 MESSAGE is an appropriate message.
557 ABFD, SECTION and ADDRESS identify the location at which the
558 problem occurred; if this is the result of a
559 bfd_section_reloc_link_order or bfd_symbol_reloc_link_order, then
560 ABFD will be NULL. */
561 bfd_boolean (*reloc_dangerous)
562 (struct bfd_link_info *, const char *message,
563 bfd *abfd, asection *section, bfd_vma address);
564 /* A function which is called when a reloc is found to be attached
565 to a symbol which is not being written out. NAME is the name of
566 the symbol. ABFD, SECTION and ADDRESS identify the location of
567 the reloc; if this is the result of a
568 bfd_section_reloc_link_order or bfd_symbol_reloc_link_order, then
569 ABFD will be NULL. */
570 bfd_boolean (*unattached_reloc)
571 (struct bfd_link_info *, const char *name,
572 bfd *abfd, asection *section, bfd_vma address);
573 /* A function which is called when a symbol in notice_hash is
574 defined or referenced. NAME is the symbol. ABFD, SECTION and
575 ADDRESS are the value of the symbol. If SECTION is
576 bfd_und_section, this is a reference. */
577 bfd_boolean (*notice)
578 (struct bfd_link_info *, const char *name,
579 bfd *abfd, asection *section, bfd_vma address);
580 /* Error or warning link info message. */
582 (const char *fmt, ...);
583 /* General link info message. */
585 (const char *fmt, ...);
586 /* Message to be printed in linker map file. */
588 (const char *fmt, ...);
589 /* This callback provides a chance for users of the BFD library to
590 override its decision about whether to place two adjacent sections
591 into the same segment. */
592 bfd_boolean (*override_segment_assignment)
593 (struct bfd_link_info *, bfd * abfd,
594 asection * current_section, asection * previous_section,
595 bfd_boolean new_segment);
598 /* The linker builds link_order structures which tell the code how to
599 include input data in the output file. */
601 /* These are the types of link_order structures. */
603 enum bfd_link_order_type
605 bfd_undefined_link_order, /* Undefined. */
606 bfd_indirect_link_order, /* Built from a section. */
607 bfd_data_link_order, /* Set to explicit data. */
608 bfd_section_reloc_link_order, /* Relocate against a section. */
609 bfd_symbol_reloc_link_order /* Relocate against a symbol. */
612 /* This is the link_order structure itself. These form a chain
613 attached to the output section whose contents they are describing. */
615 struct bfd_link_order
617 /* Next link_order in chain. */
618 struct bfd_link_order *next;
619 /* Type of link_order. */
620 enum bfd_link_order_type type;
621 /* Offset within output section. */
623 /* Size within output section. */
625 /* Type specific information. */
630 /* Section to include. If this is used, then
631 section->output_section must be the section the
632 link_order is attached to, section->output_offset must
633 equal the link_order offset field, and section->size
634 must equal the link_order size field. Maybe these
635 restrictions should be relaxed someday. */
640 /* Size of contents, or zero when contents size == size
641 within output section.
642 A non-zero value allows filling of the output section
643 with an arbitrary repeated pattern. */
645 /* Data to put into file. */
650 /* Description of reloc to generate. Used for
651 bfd_section_reloc_link_order and
652 bfd_symbol_reloc_link_order. */
653 struct bfd_link_order_reloc *p;
658 /* A linker order of type bfd_section_reloc_link_order or
659 bfd_symbol_reloc_link_order means to create a reloc against a
660 section or symbol, respectively. This is used to implement -Ur to
661 generate relocs for the constructor tables. The
662 bfd_link_order_reloc structure describes the reloc that BFD should
663 create. It is similar to a arelent, but I didn't use arelent
664 because the linker does not know anything about most symbols, and
665 any asymbol structure it creates will be partially meaningless.
666 This information could logically be in the bfd_link_order struct,
667 but I didn't want to waste the space since these types of relocs
668 are relatively rare. */
670 struct bfd_link_order_reloc
673 bfd_reloc_code_real_type reloc;
677 /* For type bfd_section_reloc_link_order, this is the section
678 the reloc should be against. This must be a section in the
679 output BFD, not any of the input BFDs. */
681 /* For type bfd_symbol_reloc_link_order, this is the name of the
682 symbol the reloc should be against. */
686 /* Addend to use. The object file should contain zero. The BFD
687 backend is responsible for filling in the contents of the object
688 file correctly. For some object file formats (e.g., COFF) the
689 addend must be stored into in the object file, and for some
690 (e.g., SPARC a.out) it is kept in the reloc. */
694 /* Allocate a new link_order for a section. */
695 extern struct bfd_link_order *bfd_new_link_order (bfd *, asection *);
697 /* These structures are used to describe version information for the
698 ELF linker. These structures could be manipulated entirely inside
699 BFD, but it would be a pain. Instead, the regular linker sets up
700 these structures, and then passes them into BFD. */
702 /* Glob pattern for a version. */
704 struct bfd_elf_version_expr
706 /* Next glob pattern for this version. */
707 struct bfd_elf_version_expr *next;
710 /* NULL for a glob pattern, otherwise a straight symbol. */
712 /* Defined by ".symver". */
713 unsigned int symver : 1;
714 /* Defined by version script. */
715 unsigned int script : 1;
717 #define BFD_ELF_VERSION_C_TYPE 1
718 #define BFD_ELF_VERSION_CXX_TYPE 2
719 #define BFD_ELF_VERSION_JAVA_TYPE 4
720 unsigned int mask : 3;
723 struct bfd_elf_version_expr_head
725 /* List of all patterns, both wildcards and non-wildcards. */
726 struct bfd_elf_version_expr *list;
727 /* Hash table for non-wildcards. */
729 /* Remaining patterns. */
730 struct bfd_elf_version_expr *remaining;
731 /* What kind of pattern types are present in list (bitmask). */
735 /* Version dependencies. */
737 struct bfd_elf_version_deps
739 /* Next dependency for this version. */
740 struct bfd_elf_version_deps *next;
741 /* The version which this version depends upon. */
742 struct bfd_elf_version_tree *version_needed;
745 /* A node in the version tree. */
747 struct bfd_elf_version_tree
750 struct bfd_elf_version_tree *next;
751 /* Name of this version. */
753 /* Version number. */
755 /* Regular expressions for global symbols in this version. */
756 struct bfd_elf_version_expr_head globals;
757 /* Regular expressions for local symbols in this version. */
758 struct bfd_elf_version_expr_head locals;
759 /* List of versions which this version depends upon. */
760 struct bfd_elf_version_deps *deps;
761 /* Index of the version name. This is used within BFD. */
762 unsigned int name_indx;
763 /* Whether this version tree was used. This is used within BFD. */
766 struct bfd_elf_version_expr *(*match)
767 (struct bfd_elf_version_expr_head *head,
768 struct bfd_elf_version_expr *prev, const char *sym);
771 struct bfd_elf_dynamic_list
773 struct bfd_elf_version_expr_head head;
774 struct bfd_elf_version_expr *(*match)
775 (struct bfd_elf_version_expr_head *head,
776 struct bfd_elf_version_expr *prev, const char *sym);