1 /* bfdlink.h -- header file for BFD link routines
2 Copyright 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2002, 2003,
3 2004 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 2 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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, 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_aymbols
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 /* The linking routines use a hash table which uses this structure for
80 struct bfd_link_hash_entry
82 /* Base hash table entry structure. */
83 struct bfd_hash_entry root
;
85 /* Type of this entry. */
86 enum bfd_link_hash_type type
;
88 /* Undefined and common symbols are kept in a linked list through
89 this field. This field is not in the union because that would
90 force us to remove entries from the list when we changed their
91 type, which would force the list to be doubly linked, which would
92 waste more memory. When an undefined or common symbol is
93 created, it should be added to this list, the head of which is in
94 the link hash table itself. As symbols are defined, they need
95 not be removed from the list; anything which reads the list must
96 doublecheck the symbol type.
98 Weak symbols are not kept on this list.
100 Defined and defweak symbols use this field as a reference marker.
101 If the field is not NULL, or this structure is the tail of the
102 undefined symbol list, the symbol has been referenced. If the
103 symbol is undefined and becomes defined, this field will
104 automatically be non-NULL since the symbol will have been on the
105 undefined symbol list. */
106 struct bfd_link_hash_entry
*und_next
;
108 /* A union of information depending upon the type. */
111 /* Nothing is kept for bfd_hash_new. */
112 /* bfd_link_hash_undefined, bfd_link_hash_undefweak. */
115 bfd
*abfd
; /* BFD symbol was found in. */
117 /* bfd_link_hash_defined, bfd_link_hash_defweak. */
120 bfd_vma value
; /* Symbol value. */
121 asection
*section
; /* Symbol section. */
123 /* bfd_link_hash_indirect, bfd_link_hash_warning. */
126 struct bfd_link_hash_entry
*link
; /* Real symbol. */
127 const char *warning
; /* Warning (bfd_link_hash_warning only). */
129 /* bfd_link_hash_common. */
132 /* The linker needs to know three things about common
133 symbols: the size, the alignment, and the section in
134 which the symbol should be placed. We store the size
135 here, and we allocate a small structure to hold the
136 section and the alignment. The alignment is stored as a
137 power of two. We don't store all the information
138 directly because we don't want to increase the size of
139 the union; this structure is a major space user in the
141 bfd_size_type size
; /* Common symbol size. */
142 struct bfd_link_hash_common_entry
144 unsigned int alignment_power
; /* Alignment. */
145 asection
*section
; /* Symbol section. */
151 /* This is the link hash table. It is a derived class of
154 struct bfd_link_hash_table
156 /* The hash table itself. */
157 struct bfd_hash_table table
;
158 /* The back end which created this hash table. This indicates the
159 type of the entries in the hash table, which is sometimes
160 important information when linking object files of different
162 const bfd_target
*creator
;
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
*);
199 struct bfd_sym_chain
*next
;
203 /* How to handle unresolved symbols.
204 There are four possibilities which are enumerated below: */
207 /* This is the initial value when then link_info structure is created.
208 It allows the various stages of the linker to determine whether they
209 allowed to set the value. */
216 /* This structure holds all the information needed to communicate
217 between BFD and the linker when doing a link. */
221 /* TRUE if BFD should generate a relocatable object file. */
222 unsigned int relocatable
: 1;
224 /* TRUE if BFD should generate relocation information in the final
226 unsigned int emitrelocations
: 1;
228 /* TRUE if BFD should generate a "task linked" object file,
229 similar to relocatable but also with globals converted to
231 unsigned int task_link
: 1;
233 /* TRUE if BFD should generate a shared object. */
234 unsigned int shared
: 1;
236 /* TRUE if BFD should pre-bind symbols in a shared object. */
237 unsigned int symbolic
: 1;
239 /* TRUE if BFD should export all symbols in the dynamic symbol table
240 of an executable, rather than only those used. */
241 unsigned int export_dynamic
: 1;
243 /* TRUE if shared objects should be linked directly, not shared. */
244 unsigned int static_link
: 1;
246 /* TRUE if the output file should be in a traditional format. This
247 is equivalent to the setting of the BFD_TRADITIONAL_FORMAT flag
248 on the output file, but may be checked when reading the input
250 unsigned int traditional_format
: 1;
252 /* TRUE if we want to produced optimized output files. This might
253 need much more time and therefore must be explicitly selected. */
254 unsigned int optimize
: 1;
256 /* TRUE if ok to have multiple definition. */
257 unsigned int allow_multiple_definition
: 1;
259 /* TRUE if ok to have version with no definition. */
260 unsigned int allow_undefined_version
: 1;
262 /* TRUE if symbols should be retained in memory, FALSE if they
263 should be freed and reread. */
264 unsigned int keep_memory
: 1;
266 /* TRUE if every symbol should be reported back via the notice
268 unsigned int notice_all
: 1;
270 /* TRUE if executable should not contain copy relocs.
271 Setting this true may result in a non-sharable text segment. */
272 unsigned int nocopyreloc
: 1;
274 /* TRUE if the new ELF dynamic tags are enabled. */
275 unsigned int new_dtags
: 1;
277 /* TRUE if non-PLT relocs should be merged into one reloc section
278 and sorted so that relocs against the same symbol come together. */
279 unsigned int combreloc
: 1;
281 /* TRUE if .eh_frame_hdr section and PT_GNU_EH_FRAME ELF segment
282 should be created. */
283 unsigned int eh_frame_hdr
: 1;
285 /* TRUE if global symbols in discarded sections should be stripped. */
286 unsigned int strip_discarded
: 1;
288 /* TRUE if the final relax pass is needed. */
289 unsigned int need_relax_finalize
: 1;
291 /* TRUE if generating a position independent executable. */
294 /* TRUE if generating an executable, position independent or not. */
295 unsigned int executable
: 1;
297 /* TRUE if PT_GNU_STACK segment should be created with PF_R|PF_W|PF_X
299 unsigned int execstack
: 1;
301 /* TRUE if PT_GNU_STACK segment should be created with PF_R|PF_W
303 unsigned int noexecstack
: 1;
305 /* TRUE if PT_GNU_RELRO segment should be created. */
306 unsigned int relro
: 1;
308 /* What to do with unresolved symbols in an object file.
309 When producing executables the default is GENERATE_ERROR.
310 When producing shared libraries the default is IGNORE. The
311 assumption with shared libraries is that the reference will be
312 resolved at load/execution time. */
313 enum report_method unresolved_syms_in_objects
;
315 /* What to do with unresolved symbols in a shared library.
316 The same defaults apply. */
317 enum report_method unresolved_syms_in_shared_libs
;
319 /* Which symbols to strip. */
320 enum bfd_link_strip strip
;
322 /* Which local symbols to discard. */
323 enum bfd_link_discard discard
;
325 /* Criteria for skipping symbols when detemining
326 whether to include an object from an archive. */
327 enum bfd_link_common_skip_ar_aymbols common_skip_ar_aymbols
;
329 /* Char that may appear as the first char of a symbol, but should be
330 skipped (like symbol_leading_char) when looking up symbols in
331 wrap_hash. Used by PowerPC Linux for 'dot' symbols. */
334 /* Function callbacks. */
335 const struct bfd_link_callbacks
*callbacks
;
337 /* Hash table handled by BFD. */
338 struct bfd_link_hash_table
*hash
;
340 /* Hash table of symbols to keep. This is NULL unless strip is
342 struct bfd_hash_table
*keep_hash
;
344 /* Hash table of symbols to report back via the notice callback. If
345 this is NULL, and notice_all is FALSE, then no symbols are
347 struct bfd_hash_table
*notice_hash
;
349 /* Hash table of symbols which are being wrapped (the --wrap linker
350 option). If this is NULL, no symbols are being wrapped. */
351 struct bfd_hash_table
*wrap_hash
;
353 /* The list of input BFD's involved in the link. These are chained
354 together via the link_next field. */
357 /* If a symbol should be created for each input BFD, this is section
358 where those symbols should be placed. It must be a section in
359 the output BFD. It may be NULL, in which case no such symbols
360 will be created. This is to support CREATE_OBJECT_SYMBOLS in the
361 linker command language. */
362 asection
*create_object_symbols_section
;
364 /* List of global symbol names that are starting points for marking
365 sections against garbage collection. */
366 struct bfd_sym_chain
*gc_sym_list
;
368 /* If a base output file is wanted, then this points to it */
371 /* The function to call when the executable or shared object is
373 const char *init_function
;
375 /* The function to call when the executable or shared object is
377 const char *fini_function
;
379 /* Non-zero if auto-import thunks for DATA items in pei386 DLLs
380 should be generated/linked against. Set to 1 if this feature
381 is explicitly requested by the user, -1 if enabled by default. */
382 int pei386_auto_import
;
384 /* Non-zero if runtime relocs for DATA items with non-zero addends
385 in pei386 DLLs should be generated. Set to 1 if this feature
386 is explicitly requested by the user, -1 if enabled by default. */
387 int pei386_runtime_pseudo_reloc
;
389 /* How many spare .dynamic DT_NULL entries should be added? */
390 unsigned int spare_dynamic_tags
;
392 /* May be used to set DT_FLAGS for ELF. */
395 /* May be used to set DT_FLAGS_1 for ELF. */
398 /* Start and end of RELRO region. */
399 bfd_vma relro_start
, relro_end
;
402 /* This structures holds a set of callback functions. These are
403 called by the BFD linker routines. The first argument to each
404 callback function is the bfd_link_info structure being used. Each
405 function returns a boolean value. If the function returns FALSE,
406 then the BFD function which called it will return with a failure
409 struct bfd_link_callbacks
411 /* A function which is called when an object is added from an
412 archive. ABFD is the archive element being added. NAME is the
413 name of the symbol which caused the archive element to be pulled
415 bfd_boolean (*add_archive_element
)
416 (struct bfd_link_info
*, bfd
*abfd
, const char *name
);
417 /* A function which is called when a symbol is found with multiple
418 definitions. NAME is the symbol which is defined multiple times.
419 OBFD is the old BFD, OSEC is the old section, OVAL is the old
420 value, NBFD is the new BFD, NSEC is the new section, and NVAL is
421 the new value. OBFD may be NULL. OSEC and NSEC may be
422 bfd_com_section or bfd_ind_section. */
423 bfd_boolean (*multiple_definition
)
424 (struct bfd_link_info
*, const char *name
,
425 bfd
*obfd
, asection
*osec
, bfd_vma oval
,
426 bfd
*nbfd
, asection
*nsec
, bfd_vma nval
);
427 /* A function which is called when a common symbol is defined
428 multiple times. NAME is the symbol appearing multiple times.
429 OBFD is the BFD of the existing symbol; it may be NULL if this is
430 not known. OTYPE is the type of the existing symbol, which may
431 be bfd_link_hash_defined, bfd_link_hash_defweak,
432 bfd_link_hash_common, or bfd_link_hash_indirect. If OTYPE is
433 bfd_link_hash_common, OSIZE is the size of the existing symbol.
434 NBFD is the BFD of the new symbol. NTYPE is the type of the new
435 symbol, one of bfd_link_hash_defined, bfd_link_hash_common, or
436 bfd_link_hash_indirect. If NTYPE is bfd_link_hash_common, NSIZE
437 is the size of the new symbol. */
438 bfd_boolean (*multiple_common
)
439 (struct bfd_link_info
*, const char *name
,
440 bfd
*obfd
, enum bfd_link_hash_type otype
, bfd_vma osize
,
441 bfd
*nbfd
, enum bfd_link_hash_type ntype
, bfd_vma nsize
);
442 /* A function which is called to add a symbol to a set. ENTRY is
443 the link hash table entry for the set itself (e.g.,
444 __CTOR_LIST__). RELOC is the relocation to use for an entry in
445 the set when generating a relocatable file, and is also used to
446 get the size of the entry when generating an executable file.
447 ABFD, SEC and VALUE identify the value to add to the set. */
448 bfd_boolean (*add_to_set
)
449 (struct bfd_link_info
*, struct bfd_link_hash_entry
*entry
,
450 bfd_reloc_code_real_type reloc
, bfd
*abfd
, asection
*sec
, bfd_vma value
);
451 /* A function which is called when the name of a g++ constructor or
452 destructor is found. This is only called by some object file
453 formats. CONSTRUCTOR is TRUE for a constructor, FALSE for a
454 destructor. This will use BFD_RELOC_CTOR when generating a
455 relocatable file. NAME is the name of the symbol found. ABFD,
456 SECTION and VALUE are the value of the symbol. */
457 bfd_boolean (*constructor
)
458 (struct bfd_link_info
*, bfd_boolean constructor
, const char *name
,
459 bfd
*abfd
, asection
*sec
, bfd_vma value
);
460 /* A function which is called to issue a linker warning. For
461 example, this is called when there is a reference to a warning
462 symbol. WARNING is the warning to be issued. SYMBOL is the name
463 of the symbol which triggered the warning; it may be NULL if
464 there is none. ABFD, SECTION and ADDRESS identify the location
465 which trigerred the warning; either ABFD or SECTION or both may
466 be NULL if the location is not known. */
467 bfd_boolean (*warning
)
468 (struct bfd_link_info
*, const char *warning
, const char *symbol
,
469 bfd
*abfd
, asection
*section
, bfd_vma address
);
470 /* A function which is called when a relocation is attempted against
471 an undefined symbol. NAME is the symbol which is undefined.
472 ABFD, SECTION and ADDRESS identify the location from which the
473 reference is made. FATAL indicates whether an undefined symbol is
474 a fatal error or not. In some cases SECTION may be NULL. */
475 bfd_boolean (*undefined_symbol
)
476 (struct bfd_link_info
*, const char *name
, bfd
*abfd
,
477 asection
*section
, bfd_vma address
, bfd_boolean fatal
);
478 /* A function which is called when a reloc overflow occurs. NAME is
479 the name of the symbol or section the reloc is against,
480 RELOC_NAME is the name of the relocation, and ADDEND is any
481 addend that is used. ABFD, SECTION and ADDRESS identify the
482 location at which the overflow occurs; if this is the result of a
483 bfd_section_reloc_link_order or bfd_symbol_reloc_link_order, then
484 ABFD will be NULL. */
485 bfd_boolean (*reloc_overflow
)
486 (struct bfd_link_info
*, const char *name
, const char *reloc_name
,
487 bfd_vma addend
, bfd
*abfd
, asection
*section
, bfd_vma address
);
488 /* A function which is called when a dangerous reloc is performed.
489 The canonical example is an a29k IHCONST reloc which does not
490 follow an IHIHALF reloc. MESSAGE is an appropriate message.
491 ABFD, SECTION and ADDRESS identify the location at which the
492 problem occurred; if this is the result of a
493 bfd_section_reloc_link_order or bfd_symbol_reloc_link_order, then
494 ABFD will be NULL. */
495 bfd_boolean (*reloc_dangerous
)
496 (struct bfd_link_info
*, const char *message
,
497 bfd
*abfd
, asection
*section
, bfd_vma address
);
498 /* A function which is called when a reloc is found to be attached
499 to a symbol which is not being written out. NAME is the name of
500 the symbol. ABFD, SECTION and ADDRESS identify the location of
501 the reloc; if this is the result of a
502 bfd_section_reloc_link_order or bfd_symbol_reloc_link_order, then
503 ABFD will be NULL. */
504 bfd_boolean (*unattached_reloc
)
505 (struct bfd_link_info
*, const char *name
,
506 bfd
*abfd
, asection
*section
, bfd_vma address
);
507 /* A function which is called when a symbol in notice_hash is
508 defined or referenced. NAME is the symbol. ABFD, SECTION and
509 ADDRESS are the value of the symbol. If SECTION is
510 bfd_und_section, this is a reference. */
511 bfd_boolean (*notice
)
512 (struct bfd_link_info
*, const char *name
,
513 bfd
*abfd
, asection
*section
, bfd_vma address
);
514 /* A function which is called for reporting a linker error. ID is the
515 error identifier. The remaining input is the same as einfo () in
517 bfd_boolean (*error_handler
)
518 (int id
, const char *fmt
, ...);
520 /* Identifiers of linker error messages used by error_handler. */
521 #define LD_DEFINITION_IN_DISCARDED_SECTION 1
524 /* The linker builds link_order structures which tell the code how to
525 include input data in the output file. */
527 /* These are the types of link_order structures. */
529 enum bfd_link_order_type
531 bfd_undefined_link_order
, /* Undefined. */
532 bfd_indirect_link_order
, /* Built from a section. */
533 bfd_data_link_order
, /* Set to explicit data. */
534 bfd_section_reloc_link_order
, /* Relocate against a section. */
535 bfd_symbol_reloc_link_order
/* Relocate against a symbol. */
538 /* This is the link_order structure itself. These form a chain
539 attached to the section whose contents they are describing. */
541 struct bfd_link_order
543 /* Next link_order in chain. */
544 struct bfd_link_order
*next
;
545 /* Type of link_order. */
546 enum bfd_link_order_type type
;
547 /* Offset within output section. */
549 /* Size within output section. */
551 /* Type specific information. */
556 /* Section to include. If this is used, then
557 section->output_section must be the section the
558 link_order is attached to, section->output_offset must
559 equal the link_order offset field, and section->_raw_size
560 must equal the link_order size field. Maybe these
561 restrictions should be relaxed someday. */
566 /* Size of contents, or zero when contents size == size
567 within output section.
568 A non-zero value allows filling of the output section
569 with an arbitrary repeated pattern. */
571 /* Data to put into file. */
576 /* Description of reloc to generate. Used for
577 bfd_section_reloc_link_order and
578 bfd_symbol_reloc_link_order. */
579 struct bfd_link_order_reloc
*p
;
584 /* A linker order of type bfd_section_reloc_link_order or
585 bfd_symbol_reloc_link_order means to create a reloc against a
586 section or symbol, respectively. This is used to implement -Ur to
587 generate relocs for the constructor tables. The
588 bfd_link_order_reloc structure describes the reloc that BFD should
589 create. It is similar to a arelent, but I didn't use arelent
590 because the linker does not know anything about most symbols, and
591 any asymbol structure it creates will be partially meaningless.
592 This information could logically be in the bfd_link_order struct,
593 but I didn't want to waste the space since these types of relocs
594 are relatively rare. */
596 struct bfd_link_order_reloc
599 bfd_reloc_code_real_type reloc
;
603 /* For type bfd_section_reloc_link_order, this is the section
604 the reloc should be against. This must be a section in the
605 output BFD, not any of the input BFDs. */
607 /* For type bfd_symbol_reloc_link_order, this is the name of the
608 symbol the reloc should be against. */
612 /* Addend to use. The object file should contain zero. The BFD
613 backend is responsible for filling in the contents of the object
614 file correctly. For some object file formats (e.g., COFF) the
615 addend must be stored into in the object file, and for some
616 (e.g., SPARC a.out) it is kept in the reloc. */
620 /* Allocate a new link_order for a section. */
621 extern struct bfd_link_order
*bfd_new_link_order (bfd
*, asection
*);
623 /* These structures are used to describe version information for the
624 ELF linker. These structures could be manipulated entirely inside
625 BFD, but it would be a pain. Instead, the regular linker sets up
626 these structures, and then passes them into BFD. */
628 /* Glob pattern for a version. */
630 struct bfd_elf_version_expr
632 /* Next glob pattern for this version. */
633 struct bfd_elf_version_expr
*next
;
636 /* NULL for a glob pattern, otherwise a straight symbol. */
638 /* Defined by ".symver". */
639 unsigned int symver
: 1;
640 /* Defined by version script. */
641 unsigned int script
: 1;
643 #define BFD_ELF_VERSION_C_TYPE 1
644 #define BFD_ELF_VERSION_CXX_TYPE 2
645 #define BFD_ELF_VERSION_JAVA_TYPE 4
646 unsigned int mask
: 3;
649 struct bfd_elf_version_expr_head
651 /* List of all patterns, both wildcards and non-wildcards. */
652 struct bfd_elf_version_expr
*list
;
653 /* Hash table for non-wildcards. */
655 /* Remaining patterns. */
656 struct bfd_elf_version_expr
*remaining
;
657 /* What kind of pattern types are present in list (bitmask). */
661 /* Version dependencies. */
663 struct bfd_elf_version_deps
665 /* Next dependency for this version. */
666 struct bfd_elf_version_deps
*next
;
667 /* The version which this version depends upon. */
668 struct bfd_elf_version_tree
*version_needed
;
671 /* A node in the version tree. */
673 struct bfd_elf_version_tree
676 struct bfd_elf_version_tree
*next
;
677 /* Name of this version. */
679 /* Version number. */
681 /* Regular expressions for global symbols in this version. */
682 struct bfd_elf_version_expr_head globals
;
683 /* Regular expressions for local symbols in this version. */
684 struct bfd_elf_version_expr_head locals
;
685 /* List of versions which this version depends upon. */
686 struct bfd_elf_version_deps
*deps
;
687 /* Index of the version name. This is used within BFD. */
688 unsigned int name_indx
;
689 /* Whether this version tree was used. This is used within BFD. */
692 struct bfd_elf_version_expr
*(*match
)
693 (struct bfd_elf_version_expr_head
*head
,
694 struct bfd_elf_version_expr
*prev
, const char *sym
);