1 /* linker.c -- BFD linker routines
2 Copyright (C) 1993-2018 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. */
33 The linker uses three special entry points in the BFD target
34 vector. It is not necessary to write special routines for
35 these entry points when creating a new BFD back end, since
36 generic versions are provided. However, writing them can
37 speed up linking and make it use significantly less runtime
40 The first routine creates a hash table used by the other
41 routines. The second routine adds the symbols from an object
42 file to the hash table. The third routine takes all the
43 object files and links them together to create the output
44 file. These routines are designed so that the linker proper
45 does not need to know anything about the symbols in the object
46 files that it is linking. The linker merely arranges the
47 sections as directed by the linker script and lets BFD handle
48 the details of symbols and relocs.
50 The second routine and third routines are passed a pointer to
51 a <<struct bfd_link_info>> structure (defined in
52 <<bfdlink.h>>) which holds information relevant to the link,
53 including the linker hash table (which was created by the
54 first routine) and a set of callback functions to the linker
57 The generic linker routines are in <<linker.c>>, and use the
58 header file <<genlink.h>>. As of this writing, the only back
59 ends which have implemented versions of these routines are
60 a.out (in <<aoutx.h>>) and ECOFF (in <<ecoff.c>>). The a.out
61 routines are used as examples throughout this section.
64 @* Creating a Linker Hash Table::
65 @* Adding Symbols to the Hash Table::
66 @* Performing the Final Link::
70 Creating a Linker Hash Table, Adding Symbols to the Hash Table, Linker Functions, Linker Functions
72 Creating a linker hash table
74 @cindex _bfd_link_hash_table_create in target vector
75 @cindex target vector (_bfd_link_hash_table_create)
76 The linker routines must create a hash table, which must be
77 derived from <<struct bfd_link_hash_table>> described in
78 <<bfdlink.c>>. @xref{Hash Tables}, for information on how to
79 create a derived hash table. This entry point is called using
80 the target vector of the linker output file.
82 The <<_bfd_link_hash_table_create>> entry point must allocate
83 and initialize an instance of the desired hash table. If the
84 back end does not require any additional information to be
85 stored with the entries in the hash table, the entry point may
86 simply create a <<struct bfd_link_hash_table>>. Most likely,
87 however, some additional information will be needed.
89 For example, with each entry in the hash table the a.out
90 linker keeps the index the symbol has in the final output file
91 (this index number is used so that when doing a relocatable
92 link the symbol index used in the output file can be quickly
93 filled in when copying over a reloc). The a.out linker code
94 defines the required structures and functions for a hash table
95 derived from <<struct bfd_link_hash_table>>. The a.out linker
96 hash table is created by the function
97 <<NAME(aout,link_hash_table_create)>>; it simply allocates
98 space for the hash table, initializes it, and returns a
101 When writing the linker routines for a new back end, you will
102 generally not know exactly which fields will be required until
103 you have finished. You should simply create a new hash table
104 which defines no additional fields, and then simply add fields
105 as they become necessary.
108 Adding Symbols to the Hash Table, Performing the Final Link, Creating a Linker Hash Table, Linker Functions
110 Adding symbols to the hash table
112 @cindex _bfd_link_add_symbols in target vector
113 @cindex target vector (_bfd_link_add_symbols)
114 The linker proper will call the <<_bfd_link_add_symbols>>
115 entry point for each object file or archive which is to be
116 linked (typically these are the files named on the command
117 line, but some may also come from the linker script). The
118 entry point is responsible for examining the file. For an
119 object file, BFD must add any relevant symbol information to
120 the hash table. For an archive, BFD must determine which
121 elements of the archive should be used and adding them to the
124 The a.out version of this entry point is
125 <<NAME(aout,link_add_symbols)>>.
128 @* Differing file formats::
129 @* Adding symbols from an object file::
130 @* Adding symbols from an archive::
134 Differing file formats, Adding symbols from an object file, Adding Symbols to the Hash Table, Adding Symbols to the Hash Table
136 Differing file formats
138 Normally all the files involved in a link will be of the same
139 format, but it is also possible to link together different
140 format object files, and the back end must support that. The
141 <<_bfd_link_add_symbols>> entry point is called via the target
142 vector of the file to be added. This has an important
143 consequence: the function may not assume that the hash table
144 is the type created by the corresponding
145 <<_bfd_link_hash_table_create>> vector. All the
146 <<_bfd_link_add_symbols>> function can assume about the hash
147 table is that it is derived from <<struct
148 bfd_link_hash_table>>.
150 Sometimes the <<_bfd_link_add_symbols>> function must store
151 some information in the hash table entry to be used by the
152 <<_bfd_final_link>> function. In such a case the output bfd
153 xvec must be checked to make sure that the hash table was
154 created by an object file of the same format.
156 The <<_bfd_final_link>> routine must be prepared to handle a
157 hash entry without any extra information added by the
158 <<_bfd_link_add_symbols>> function. A hash entry without
159 extra information will also occur when the linker script
160 directs the linker to create a symbol. Note that, regardless
161 of how a hash table entry is added, all the fields will be
162 initialized to some sort of null value by the hash table entry
163 initialization function.
165 See <<ecoff_link_add_externals>> for an example of how to
166 check the output bfd before saving information (in this
167 case, the ECOFF external symbol debugging information) in a
171 Adding symbols from an object file, Adding symbols from an archive, Differing file formats, Adding Symbols to the Hash Table
173 Adding symbols from an object file
175 When the <<_bfd_link_add_symbols>> routine is passed an object
176 file, it must add all externally visible symbols in that
177 object file to the hash table. The actual work of adding the
178 symbol to the hash table is normally handled by the function
179 <<_bfd_generic_link_add_one_symbol>>. The
180 <<_bfd_link_add_symbols>> routine is responsible for reading
181 all the symbols from the object file and passing the correct
182 information to <<_bfd_generic_link_add_one_symbol>>.
184 The <<_bfd_link_add_symbols>> routine should not use
185 <<bfd_canonicalize_symtab>> to read the symbols. The point of
186 providing this routine is to avoid the overhead of converting
187 the symbols into generic <<asymbol>> structures.
189 @findex _bfd_generic_link_add_one_symbol
190 <<_bfd_generic_link_add_one_symbol>> handles the details of
191 combining common symbols, warning about multiple definitions,
192 and so forth. It takes arguments which describe the symbol to
193 add, notably symbol flags, a section, and an offset. The
194 symbol flags include such things as <<BSF_WEAK>> or
195 <<BSF_INDIRECT>>. The section is a section in the object
196 file, or something like <<bfd_und_section_ptr>> for an undefined
197 symbol or <<bfd_com_section_ptr>> for a common symbol.
199 If the <<_bfd_final_link>> routine is also going to need to
200 read the symbol information, the <<_bfd_link_add_symbols>>
201 routine should save it somewhere attached to the object file
202 BFD. However, the information should only be saved if the
203 <<keep_memory>> field of the <<info>> argument is TRUE, so
204 that the <<-no-keep-memory>> linker switch is effective.
206 The a.out function which adds symbols from an object file is
207 <<aout_link_add_object_symbols>>, and most of the interesting
208 work is in <<aout_link_add_symbols>>. The latter saves
209 pointers to the hash tables entries created by
210 <<_bfd_generic_link_add_one_symbol>> indexed by symbol number,
211 so that the <<_bfd_final_link>> routine does not have to call
212 the hash table lookup routine to locate the entry.
215 Adding symbols from an archive, , Adding symbols from an object file, Adding Symbols to the Hash Table
217 Adding symbols from an archive
219 When the <<_bfd_link_add_symbols>> routine is passed an
220 archive, it must look through the symbols defined by the
221 archive and decide which elements of the archive should be
222 included in the link. For each such element it must call the
223 <<add_archive_element>> linker callback, and it must add the
224 symbols from the object file to the linker hash table. (The
225 callback may in fact indicate that a replacement BFD should be
226 used, in which case the symbols from that BFD should be added
227 to the linker hash table instead.)
229 @findex _bfd_generic_link_add_archive_symbols
230 In most cases the work of looking through the symbols in the
231 archive should be done by the
232 <<_bfd_generic_link_add_archive_symbols>> function.
233 <<_bfd_generic_link_add_archive_symbols>> is passed a function
234 to call to make the final decision about adding an archive
235 element to the link and to do the actual work of adding the
236 symbols to the linker hash table. If the element is to
237 be included, the <<add_archive_element>> linker callback
238 routine must be called with the element as an argument, and
239 the element's symbols must be added to the linker hash table
240 just as though the element had itself been passed to the
241 <<_bfd_link_add_symbols>> function.
243 When the a.out <<_bfd_link_add_symbols>> function receives an
244 archive, it calls <<_bfd_generic_link_add_archive_symbols>>
245 passing <<aout_link_check_archive_element>> as the function
246 argument. <<aout_link_check_archive_element>> calls
247 <<aout_link_check_ar_symbols>>. If the latter decides to add
248 the element (an element is only added if it provides a real,
249 non-common, definition for a previously undefined or common
250 symbol) it calls the <<add_archive_element>> callback and then
251 <<aout_link_check_archive_element>> calls
252 <<aout_link_add_symbols>> to actually add the symbols to the
253 linker hash table - possibly those of a substitute BFD, if the
254 <<add_archive_element>> callback avails itself of that option.
256 The ECOFF back end is unusual in that it does not normally
257 call <<_bfd_generic_link_add_archive_symbols>>, because ECOFF
258 archives already contain a hash table of symbols. The ECOFF
259 back end searches the archive itself to avoid the overhead of
260 creating a new hash table.
263 Performing the Final Link, , Adding Symbols to the Hash Table, Linker Functions
265 Performing the final link
267 @cindex _bfd_link_final_link in target vector
268 @cindex target vector (_bfd_final_link)
269 When all the input files have been processed, the linker calls
270 the <<_bfd_final_link>> entry point of the output BFD. This
271 routine is responsible for producing the final output file,
272 which has several aspects. It must relocate the contents of
273 the input sections and copy the data into the output sections.
274 It must build an output symbol table including any local
275 symbols from the input files and the global symbols from the
276 hash table. When producing relocatable output, it must
277 modify the input relocs and write them into the output file.
278 There may also be object format dependent work to be done.
280 The linker will also call the <<write_object_contents>> entry
281 point when the BFD is closed. The two entry points must work
282 together in order to produce the correct output file.
284 The details of how this works are inevitably dependent upon
285 the specific object file format. The a.out
286 <<_bfd_final_link>> routine is <<NAME(aout,final_link)>>.
289 @* Information provided by the linker::
290 @* Relocating the section contents::
291 @* Writing the symbol table::
295 Information provided by the linker, Relocating the section contents, Performing the Final Link, Performing the Final Link
297 Information provided by the linker
299 Before the linker calls the <<_bfd_final_link>> entry point,
300 it sets up some data structures for the function to use.
302 The <<input_bfds>> field of the <<bfd_link_info>> structure
303 will point to a list of all the input files included in the
304 link. These files are linked through the <<link.next>> field
305 of the <<bfd>> structure.
307 Each section in the output file will have a list of
308 <<link_order>> structures attached to the <<map_head.link_order>>
309 field (the <<link_order>> structure is defined in
310 <<bfdlink.h>>). These structures describe how to create the
311 contents of the output section in terms of the contents of
312 various input sections, fill constants, and, eventually, other
313 types of information. They also describe relocs that must be
314 created by the BFD backend, but do not correspond to any input
315 file; this is used to support -Ur, which builds constructors
316 while generating a relocatable object file.
319 Relocating the section contents, Writing the symbol table, Information provided by the linker, Performing the Final Link
321 Relocating the section contents
323 The <<_bfd_final_link>> function should look through the
324 <<link_order>> structures attached to each section of the
325 output file. Each <<link_order>> structure should either be
326 handled specially, or it should be passed to the function
327 <<_bfd_default_link_order>> which will do the right thing
328 (<<_bfd_default_link_order>> is defined in <<linker.c>>).
330 For efficiency, a <<link_order>> of type
331 <<bfd_indirect_link_order>> whose associated section belongs
332 to a BFD of the same format as the output BFD must be handled
333 specially. This type of <<link_order>> describes part of an
334 output section in terms of a section belonging to one of the
335 input files. The <<_bfd_final_link>> function should read the
336 contents of the section and any associated relocs, apply the
337 relocs to the section contents, and write out the modified
338 section contents. If performing a relocatable link, the
339 relocs themselves must also be modified and written out.
341 @findex _bfd_relocate_contents
342 @findex _bfd_final_link_relocate
343 The functions <<_bfd_relocate_contents>> and
344 <<_bfd_final_link_relocate>> provide some general support for
345 performing the actual relocations, notably overflow checking.
346 Their arguments include information about the symbol the
347 relocation is against and a <<reloc_howto_type>> argument
348 which describes the relocation to perform. These functions
349 are defined in <<reloc.c>>.
351 The a.out function which handles reading, relocating, and
352 writing section contents is <<aout_link_input_section>>. The
353 actual relocation is done in <<aout_link_input_section_std>>
354 and <<aout_link_input_section_ext>>.
357 Writing the symbol table, , Relocating the section contents, Performing the Final Link
359 Writing the symbol table
361 The <<_bfd_final_link>> function must gather all the symbols
362 in the input files and write them out. It must also write out
363 all the symbols in the global hash table. This must be
364 controlled by the <<strip>> and <<discard>> fields of the
365 <<bfd_link_info>> structure.
367 The local symbols of the input files will not have been
368 entered into the linker hash table. The <<_bfd_final_link>>
369 routine must consider each input file and include the symbols
370 in the output file. It may be convenient to do this when
371 looking through the <<link_order>> structures, or it may be
372 done by stepping through the <<input_bfds>> list.
374 The <<_bfd_final_link>> routine must also traverse the global
375 hash table to gather all the externally visible symbols. It
376 is possible that most of the externally visible symbols may be
377 written out when considering the symbols of each input file,
378 but it is still necessary to traverse the hash table since the
379 linker script may have defined some symbols that are not in
380 any of the input files.
382 The <<strip>> field of the <<bfd_link_info>> structure
383 controls which symbols are written out. The possible values
384 are listed in <<bfdlink.h>>. If the value is <<strip_some>>,
385 then the <<keep_hash>> field of the <<bfd_link_info>>
386 structure is a hash table of symbols to keep; each symbol
387 should be looked up in this hash table, and only symbols which
388 are present should be included in the output file.
390 If the <<strip>> field of the <<bfd_link_info>> structure
391 permits local symbols to be written out, the <<discard>> field
392 is used to further controls which local symbols are included
393 in the output file. If the value is <<discard_l>>, then all
394 local symbols which begin with a certain prefix are discarded;
395 this is controlled by the <<bfd_is_local_label_name>> entry point.
397 The a.out backend handles symbols by calling
398 <<aout_link_write_symbols>> on each input BFD and then
399 traversing the global hash table with the function
400 <<aout_link_write_other_symbol>>. It builds a string table
401 while writing out the symbols, which is written to the output
402 file at the end of <<NAME(aout,final_link)>>.
405 static bfd_boolean generic_link_add_object_symbols
406 (bfd
*, struct bfd_link_info
*);
407 static bfd_boolean generic_link_check_archive_element
408 (bfd
*, struct bfd_link_info
*, struct bfd_link_hash_entry
*, const char *,
410 static bfd_boolean generic_link_add_symbol_list
411 (bfd
*, struct bfd_link_info
*, bfd_size_type count
, asymbol
**);
412 static bfd_boolean generic_add_output_symbol
413 (bfd
*, size_t *psymalloc
, asymbol
*);
414 static bfd_boolean default_data_link_order
415 (bfd
*, struct bfd_link_info
*, asection
*, struct bfd_link_order
*);
416 static bfd_boolean default_indirect_link_order
417 (bfd
*, struct bfd_link_info
*, asection
*, struct bfd_link_order
*,
420 /* The link hash table structure is defined in bfdlink.h. It provides
421 a base hash table which the backend specific hash tables are built
424 /* Routine to create an entry in the link hash table. */
426 struct bfd_hash_entry
*
427 _bfd_link_hash_newfunc (struct bfd_hash_entry
*entry
,
428 struct bfd_hash_table
*table
,
431 /* Allocate the structure if it has not already been allocated by a
435 entry
= (struct bfd_hash_entry
*)
436 bfd_hash_allocate (table
, sizeof (struct bfd_link_hash_entry
));
441 /* Call the allocation method of the superclass. */
442 entry
= bfd_hash_newfunc (entry
, table
, string
);
445 struct bfd_link_hash_entry
*h
= (struct bfd_link_hash_entry
*) entry
;
447 /* Initialize the local fields. */
448 memset ((char *) &h
->root
+ sizeof (h
->root
), 0,
449 sizeof (*h
) - sizeof (h
->root
));
455 /* Initialize a link hash table. The BFD argument is the one
456 responsible for creating this table. */
459 _bfd_link_hash_table_init
460 (struct bfd_link_hash_table
*table
,
461 bfd
*abfd ATTRIBUTE_UNUSED
,
462 struct bfd_hash_entry
*(*newfunc
) (struct bfd_hash_entry
*,
463 struct bfd_hash_table
*,
465 unsigned int entsize
)
469 BFD_ASSERT (!abfd
->is_linker_output
&& !abfd
->link
.hash
);
470 table
->undefs
= NULL
;
471 table
->undefs_tail
= NULL
;
472 table
->type
= bfd_link_generic_hash_table
;
474 ret
= bfd_hash_table_init (&table
->table
, newfunc
, entsize
);
477 /* Arrange for destruction of this hash table on closing ABFD. */
478 table
->hash_table_free
= _bfd_generic_link_hash_table_free
;
479 abfd
->link
.hash
= table
;
480 abfd
->is_linker_output
= TRUE
;
485 /* Look up a symbol in a link hash table. If follow is TRUE, we
486 follow bfd_link_hash_indirect and bfd_link_hash_warning links to
489 struct bfd_link_hash_entry
*
490 bfd_link_hash_lookup (struct bfd_link_hash_table
*table
,
496 struct bfd_link_hash_entry
*ret
;
498 if (table
== NULL
|| string
== NULL
)
501 ret
= ((struct bfd_link_hash_entry
*)
502 bfd_hash_lookup (&table
->table
, string
, create
, copy
));
504 if (follow
&& ret
!= NULL
)
506 while (ret
->type
== bfd_link_hash_indirect
507 || ret
->type
== bfd_link_hash_warning
)
514 /* Look up a symbol in the main linker hash table if the symbol might
515 be wrapped. This should only be used for references to an
516 undefined symbol, not for definitions of a symbol. */
518 struct bfd_link_hash_entry
*
519 bfd_wrapped_link_hash_lookup (bfd
*abfd
,
520 struct bfd_link_info
*info
,
528 if (info
->wrap_hash
!= NULL
)
534 if (*l
== bfd_get_symbol_leading_char (abfd
) || *l
== info
->wrap_char
)
541 #define WRAP "__wrap_"
543 if (bfd_hash_lookup (info
->wrap_hash
, l
, FALSE
, FALSE
) != NULL
)
546 struct bfd_link_hash_entry
*h
;
548 /* This symbol is being wrapped. We want to replace all
549 references to SYM with references to __wrap_SYM. */
551 amt
= strlen (l
) + sizeof WRAP
+ 1;
552 n
= (char *) bfd_malloc (amt
);
560 h
= bfd_link_hash_lookup (info
->hash
, n
, create
, TRUE
, follow
);
566 #define REAL "__real_"
569 && CONST_STRNEQ (l
, REAL
)
570 && bfd_hash_lookup (info
->wrap_hash
, l
+ sizeof REAL
- 1,
571 FALSE
, FALSE
) != NULL
)
574 struct bfd_link_hash_entry
*h
;
576 /* This is a reference to __real_SYM, where SYM is being
577 wrapped. We want to replace all references to __real_SYM
578 with references to SYM. */
580 amt
= strlen (l
+ sizeof REAL
- 1) + 2;
581 n
= (char *) bfd_malloc (amt
);
587 strcat (n
, l
+ sizeof REAL
- 1);
588 h
= bfd_link_hash_lookup (info
->hash
, n
, create
, TRUE
, follow
);
596 return bfd_link_hash_lookup (info
->hash
, string
, create
, copy
, follow
);
599 /* If H is a wrapped symbol, ie. the symbol name starts with "__wrap_"
600 and the remainder is found in wrap_hash, return the real symbol. */
602 struct bfd_link_hash_entry
*
603 unwrap_hash_lookup (struct bfd_link_info
*info
,
605 struct bfd_link_hash_entry
*h
)
607 const char *l
= h
->root
.string
;
609 if (*l
== bfd_get_symbol_leading_char (input_bfd
)
610 || *l
== info
->wrap_char
)
613 if (CONST_STRNEQ (l
, WRAP
))
615 l
+= sizeof WRAP
- 1;
617 if (bfd_hash_lookup (info
->wrap_hash
, l
, FALSE
, FALSE
) != NULL
)
620 if (l
- (sizeof WRAP
- 1) != h
->root
.string
)
624 *(char *) l
= *h
->root
.string
;
626 h
= bfd_link_hash_lookup (info
->hash
, l
, FALSE
, FALSE
, FALSE
);
635 /* Traverse a generic link hash table. Differs from bfd_hash_traverse
636 in the treatment of warning symbols. When warning symbols are
637 created they replace the real symbol, so you don't get to see the
638 real symbol in a bfd_hash_traverse. This traversal calls func with
642 bfd_link_hash_traverse
643 (struct bfd_link_hash_table
*htab
,
644 bfd_boolean (*func
) (struct bfd_link_hash_entry
*, void *),
649 htab
->table
.frozen
= 1;
650 for (i
= 0; i
< htab
->table
.size
; i
++)
652 struct bfd_link_hash_entry
*p
;
654 p
= (struct bfd_link_hash_entry
*) htab
->table
.table
[i
];
655 for (; p
!= NULL
; p
= (struct bfd_link_hash_entry
*) p
->root
.next
)
656 if (!(*func
) (p
->type
== bfd_link_hash_warning
? p
->u
.i
.link
: p
, info
))
660 htab
->table
.frozen
= 0;
663 /* Add a symbol to the linker hash table undefs list. */
666 bfd_link_add_undef (struct bfd_link_hash_table
*table
,
667 struct bfd_link_hash_entry
*h
)
669 BFD_ASSERT (h
->u
.undef
.next
== NULL
);
670 if (table
->undefs_tail
!= NULL
)
671 table
->undefs_tail
->u
.undef
.next
= h
;
672 if (table
->undefs
== NULL
)
674 table
->undefs_tail
= h
;
677 /* The undefs list was designed so that in normal use we don't need to
678 remove entries. However, if symbols on the list are changed from
679 bfd_link_hash_undefined to either bfd_link_hash_undefweak or
680 bfd_link_hash_new for some reason, then they must be removed from the
681 list. Failure to do so might result in the linker attempting to add
682 the symbol to the list again at a later stage. */
685 bfd_link_repair_undef_list (struct bfd_link_hash_table
*table
)
687 struct bfd_link_hash_entry
**pun
;
689 pun
= &table
->undefs
;
692 struct bfd_link_hash_entry
*h
= *pun
;
694 if (h
->type
== bfd_link_hash_new
695 || h
->type
== bfd_link_hash_undefweak
)
697 *pun
= h
->u
.undef
.next
;
698 h
->u
.undef
.next
= NULL
;
699 if (h
== table
->undefs_tail
)
701 if (pun
== &table
->undefs
)
702 table
->undefs_tail
= NULL
;
704 /* pun points at an u.undef.next field. Go back to
705 the start of the link_hash_entry. */
706 table
->undefs_tail
= (struct bfd_link_hash_entry
*)
707 ((char *) pun
- ((char *) &h
->u
.undef
.next
- (char *) h
));
712 pun
= &h
->u
.undef
.next
;
716 /* Routine to create an entry in a generic link hash table. */
718 struct bfd_hash_entry
*
719 _bfd_generic_link_hash_newfunc (struct bfd_hash_entry
*entry
,
720 struct bfd_hash_table
*table
,
723 /* Allocate the structure if it has not already been allocated by a
727 entry
= (struct bfd_hash_entry
*)
728 bfd_hash_allocate (table
, sizeof (struct generic_link_hash_entry
));
733 /* Call the allocation method of the superclass. */
734 entry
= _bfd_link_hash_newfunc (entry
, table
, string
);
737 struct generic_link_hash_entry
*ret
;
739 /* Set local fields. */
740 ret
= (struct generic_link_hash_entry
*) entry
;
741 ret
->written
= FALSE
;
748 /* Create a generic link hash table. */
750 struct bfd_link_hash_table
*
751 _bfd_generic_link_hash_table_create (bfd
*abfd
)
753 struct generic_link_hash_table
*ret
;
754 bfd_size_type amt
= sizeof (struct generic_link_hash_table
);
756 ret
= (struct generic_link_hash_table
*) bfd_malloc (amt
);
759 if (! _bfd_link_hash_table_init (&ret
->root
, abfd
,
760 _bfd_generic_link_hash_newfunc
,
761 sizeof (struct generic_link_hash_entry
)))
770 _bfd_generic_link_hash_table_free (bfd
*obfd
)
772 struct generic_link_hash_table
*ret
;
774 BFD_ASSERT (obfd
->is_linker_output
&& obfd
->link
.hash
);
775 ret
= (struct generic_link_hash_table
*) obfd
->link
.hash
;
776 bfd_hash_table_free (&ret
->root
.table
);
778 obfd
->link
.hash
= NULL
;
779 obfd
->is_linker_output
= FALSE
;
782 /* Grab the symbols for an object file when doing a generic link. We
783 store the symbols in the outsymbols field. We need to keep them
784 around for the entire link to ensure that we only read them once.
785 If we read them multiple times, we might wind up with relocs and
786 the hash table pointing to different instances of the symbol
790 bfd_generic_link_read_symbols (bfd
*abfd
)
792 if (bfd_get_outsymbols (abfd
) == NULL
)
797 symsize
= bfd_get_symtab_upper_bound (abfd
);
800 bfd_get_outsymbols (abfd
) = (struct bfd_symbol
**) bfd_alloc (abfd
,
802 if (bfd_get_outsymbols (abfd
) == NULL
&& symsize
!= 0)
804 symcount
= bfd_canonicalize_symtab (abfd
, bfd_get_outsymbols (abfd
));
807 bfd_get_symcount (abfd
) = symcount
;
813 /* Indicate that we are only retrieving symbol values from this
814 section. We want the symbols to act as though the values in the
815 file are absolute. */
818 _bfd_generic_link_just_syms (asection
*sec
,
819 struct bfd_link_info
*info ATTRIBUTE_UNUSED
)
821 sec
->sec_info_type
= SEC_INFO_TYPE_JUST_SYMS
;
822 sec
->output_section
= bfd_abs_section_ptr
;
823 sec
->output_offset
= sec
->vma
;
826 /* Copy the symbol type and other attributes for a linker script
827 assignment from HSRC to HDEST.
828 The default implementation does nothing. */
830 _bfd_generic_copy_link_hash_symbol_type (bfd
*abfd ATTRIBUTE_UNUSED
,
831 struct bfd_link_hash_entry
*hdest ATTRIBUTE_UNUSED
,
832 struct bfd_link_hash_entry
*hsrc ATTRIBUTE_UNUSED
)
836 /* Generic function to add symbols from an object file to the
837 global hash table. */
840 _bfd_generic_link_add_symbols (bfd
*abfd
, struct bfd_link_info
*info
)
844 switch (bfd_get_format (abfd
))
847 ret
= generic_link_add_object_symbols (abfd
, info
);
850 ret
= (_bfd_generic_link_add_archive_symbols
851 (abfd
, info
, generic_link_check_archive_element
));
854 bfd_set_error (bfd_error_wrong_format
);
861 /* Add symbols from an object file to the global hash table. */
864 generic_link_add_object_symbols (bfd
*abfd
,
865 struct bfd_link_info
*info
)
867 bfd_size_type symcount
;
868 struct bfd_symbol
**outsyms
;
870 if (!bfd_generic_link_read_symbols (abfd
))
872 symcount
= _bfd_generic_link_get_symcount (abfd
);
873 outsyms
= _bfd_generic_link_get_symbols (abfd
);
874 return generic_link_add_symbol_list (abfd
, info
, symcount
, outsyms
);
877 /* Generic function to add symbols from an archive file to the global
878 hash file. This function presumes that the archive symbol table
879 has already been read in (this is normally done by the
880 bfd_check_format entry point). It looks through the archive symbol
881 table for symbols that are undefined or common in the linker global
882 symbol hash table. When one is found, the CHECKFN argument is used
883 to see if an object file should be included. This allows targets
884 to customize common symbol behaviour. CHECKFN should set *PNEEDED
885 to TRUE if the object file should be included, and must also call
886 the bfd_link_info add_archive_element callback function and handle
887 adding the symbols to the global hash table. CHECKFN must notice
888 if the callback indicates a substitute BFD, and arrange to add
889 those symbols instead if it does so. CHECKFN should only return
890 FALSE if some sort of error occurs. */
893 _bfd_generic_link_add_archive_symbols
895 struct bfd_link_info
*info
,
896 bfd_boolean (*checkfn
) (bfd
*, struct bfd_link_info
*,
897 struct bfd_link_hash_entry
*, const char *,
902 unsigned char *included
;
904 if (! bfd_has_map (abfd
))
906 /* An empty archive is a special case. */
907 if (bfd_openr_next_archived_file (abfd
, NULL
) == NULL
)
909 bfd_set_error (bfd_error_no_armap
);
913 amt
= bfd_ardata (abfd
)->symdef_count
;
916 amt
*= sizeof (*included
);
917 included
= (unsigned char *) bfd_zmalloc (amt
);
918 if (included
== NULL
)
927 file_ptr last_ar_offset
= -1;
928 bfd_boolean needed
= FALSE
;
932 arsyms
= bfd_ardata (abfd
)->symdefs
;
933 arsym_end
= arsyms
+ bfd_ardata (abfd
)->symdef_count
;
934 for (arsym
= arsyms
, indx
= 0; arsym
< arsym_end
; arsym
++, indx
++)
936 struct bfd_link_hash_entry
*h
;
937 struct bfd_link_hash_entry
*undefs_tail
;
941 if (needed
&& arsym
->file_offset
== last_ar_offset
)
947 if (arsym
->name
== NULL
)
950 h
= bfd_link_hash_lookup (info
->hash
, arsym
->name
,
954 && info
->pei386_auto_import
955 && CONST_STRNEQ (arsym
->name
, "__imp_"))
956 h
= bfd_link_hash_lookup (info
->hash
, arsym
->name
+ 6,
961 if (h
->type
!= bfd_link_hash_undefined
962 && h
->type
!= bfd_link_hash_common
)
964 if (h
->type
!= bfd_link_hash_undefweak
)
965 /* Symbol must be defined. Don't check it again. */
970 if (last_ar_offset
!= arsym
->file_offset
)
972 last_ar_offset
= arsym
->file_offset
;
973 element
= _bfd_get_elt_at_filepos (abfd
, last_ar_offset
);
975 || !bfd_check_format (element
, bfd_object
))
979 undefs_tail
= info
->hash
->undefs_tail
;
981 /* CHECKFN will see if this element should be included, and
982 go ahead and include it if appropriate. */
983 if (! (*checkfn
) (element
, info
, h
, arsym
->name
, &needed
))
990 /* Look backward to mark all symbols from this object file
991 which we have already seen in this pass. */
1000 while (arsyms
[mark
].file_offset
== last_ar_offset
);
1002 if (undefs_tail
!= info
->hash
->undefs_tail
)
1016 /* See if we should include an archive element. */
1019 generic_link_check_archive_element (bfd
*abfd
,
1020 struct bfd_link_info
*info
,
1021 struct bfd_link_hash_entry
*h
,
1022 const char *name ATTRIBUTE_UNUSED
,
1023 bfd_boolean
*pneeded
)
1025 asymbol
**pp
, **ppend
;
1029 if (!bfd_generic_link_read_symbols (abfd
))
1032 pp
= _bfd_generic_link_get_symbols (abfd
);
1033 ppend
= pp
+ _bfd_generic_link_get_symcount (abfd
);
1034 for (; pp
< ppend
; pp
++)
1040 /* We are only interested in globally visible symbols. */
1041 if (! bfd_is_com_section (p
->section
)
1042 && (p
->flags
& (BSF_GLOBAL
| BSF_INDIRECT
| BSF_WEAK
)) == 0)
1045 /* We are only interested if we know something about this
1046 symbol, and it is undefined or common. An undefined weak
1047 symbol (type bfd_link_hash_undefweak) is not considered to be
1048 a reference when pulling files out of an archive. See the
1049 SVR4 ABI, p. 4-27. */
1050 h
= bfd_link_hash_lookup (info
->hash
, bfd_asymbol_name (p
), FALSE
,
1053 || (h
->type
!= bfd_link_hash_undefined
1054 && h
->type
!= bfd_link_hash_common
))
1057 /* P is a symbol we are looking for. */
1059 if (! bfd_is_com_section (p
->section
)
1060 || (h
->type
== bfd_link_hash_undefined
1061 && h
->u
.undef
.abfd
== NULL
))
1063 /* P is not a common symbol, or an undefined reference was
1064 created from outside BFD such as from a linker -u option.
1065 This object file defines the symbol, so pull it in. */
1067 if (!(*info
->callbacks
1068 ->add_archive_element
) (info
, abfd
, bfd_asymbol_name (p
),
1071 /* Potentially, the add_archive_element hook may have set a
1072 substitute BFD for us. */
1073 return bfd_link_add_symbols (abfd
, info
);
1076 /* P is a common symbol. */
1078 if (h
->type
== bfd_link_hash_undefined
)
1084 /* Turn the symbol into a common symbol but do not link in
1085 the object file. This is how a.out works. Object
1086 formats that require different semantics must implement
1087 this function differently. This symbol is already on the
1088 undefs list. We add the section to a common section
1089 attached to symbfd to ensure that it is in a BFD which
1090 will be linked in. */
1091 symbfd
= h
->u
.undef
.abfd
;
1092 h
->type
= bfd_link_hash_common
;
1093 h
->u
.c
.p
= (struct bfd_link_hash_common_entry
*)
1094 bfd_hash_allocate (&info
->hash
->table
,
1095 sizeof (struct bfd_link_hash_common_entry
));
1096 if (h
->u
.c
.p
== NULL
)
1099 size
= bfd_asymbol_value (p
);
1102 power
= bfd_log2 (size
);
1105 h
->u
.c
.p
->alignment_power
= power
;
1107 if (p
->section
== bfd_com_section_ptr
)
1108 h
->u
.c
.p
->section
= bfd_make_section_old_way (symbfd
, "COMMON");
1110 h
->u
.c
.p
->section
= bfd_make_section_old_way (symbfd
,
1112 h
->u
.c
.p
->section
->flags
|= SEC_ALLOC
;
1116 /* Adjust the size of the common symbol if necessary. This
1117 is how a.out works. Object formats that require
1118 different semantics must implement this function
1120 if (bfd_asymbol_value (p
) > h
->u
.c
.size
)
1121 h
->u
.c
.size
= bfd_asymbol_value (p
);
1125 /* This archive element is not needed. */
1129 /* Add the symbols from an object file to the global hash table. ABFD
1130 is the object file. INFO is the linker information. SYMBOL_COUNT
1131 is the number of symbols. SYMBOLS is the list of symbols. */
1134 generic_link_add_symbol_list (bfd
*abfd
,
1135 struct bfd_link_info
*info
,
1136 bfd_size_type symbol_count
,
1139 asymbol
**pp
, **ppend
;
1142 ppend
= symbols
+ symbol_count
;
1143 for (; pp
< ppend
; pp
++)
1149 if ((p
->flags
& (BSF_INDIRECT
1154 || bfd_is_und_section (bfd_get_section (p
))
1155 || bfd_is_com_section (bfd_get_section (p
))
1156 || bfd_is_ind_section (bfd_get_section (p
)))
1160 struct generic_link_hash_entry
*h
;
1161 struct bfd_link_hash_entry
*bh
;
1163 string
= name
= bfd_asymbol_name (p
);
1164 if (((p
->flags
& BSF_INDIRECT
) != 0
1165 || bfd_is_ind_section (p
->section
))
1169 string
= bfd_asymbol_name (*pp
);
1171 else if ((p
->flags
& BSF_WARNING
) != 0
1174 /* The name of P is actually the warning string, and the
1175 next symbol is the one to warn about. */
1177 name
= bfd_asymbol_name (*pp
);
1181 if (! (_bfd_generic_link_add_one_symbol
1182 (info
, abfd
, name
, p
->flags
, bfd_get_section (p
),
1183 p
->value
, string
, FALSE
, FALSE
, &bh
)))
1185 h
= (struct generic_link_hash_entry
*) bh
;
1187 /* If this is a constructor symbol, and the linker didn't do
1188 anything with it, then we want to just pass the symbol
1189 through to the output file. This will happen when
1191 if ((p
->flags
& BSF_CONSTRUCTOR
) != 0
1192 && (h
== NULL
|| h
->root
.type
== bfd_link_hash_new
))
1198 /* Save the BFD symbol so that we don't lose any backend
1199 specific information that may be attached to it. We only
1200 want this one if it gives more information than the
1201 existing one; we don't want to replace a defined symbol
1202 with an undefined one. This routine may be called with a
1203 hash table other than the generic hash table, so we only
1204 do this if we are certain that the hash table is a
1206 if (info
->output_bfd
->xvec
== abfd
->xvec
)
1209 || (! bfd_is_und_section (bfd_get_section (p
))
1210 && (! bfd_is_com_section (bfd_get_section (p
))
1211 || bfd_is_und_section (bfd_get_section (h
->sym
)))))
1214 /* BSF_OLD_COMMON is a hack to support COFF reloc
1215 reading, and it should go away when the COFF
1216 linker is switched to the new version. */
1217 if (bfd_is_com_section (bfd_get_section (p
)))
1218 p
->flags
|= BSF_OLD_COMMON
;
1222 /* Store a back pointer from the symbol to the hash
1223 table entry for the benefit of relaxation code until
1224 it gets rewritten to not use asymbol structures.
1225 Setting this is also used to check whether these
1226 symbols were set up by the generic linker. */
1234 /* We use a state table to deal with adding symbols from an object
1235 file. The first index into the state table describes the symbol
1236 from the object file. The second index into the state table is the
1237 type of the symbol in the hash table. */
1239 /* The symbol from the object file is turned into one of these row
1244 UNDEF_ROW
, /* Undefined. */
1245 UNDEFW_ROW
, /* Weak undefined. */
1246 DEF_ROW
, /* Defined. */
1247 DEFW_ROW
, /* Weak defined. */
1248 COMMON_ROW
, /* Common. */
1249 INDR_ROW
, /* Indirect. */
1250 WARN_ROW
, /* Warning. */
1251 SET_ROW
/* Member of set. */
1254 /* apparently needed for Hitachi 3050R(HI-UX/WE2)? */
1257 /* The actions to take in the state table. */
1262 UND
, /* Mark symbol undefined. */
1263 WEAK
, /* Mark symbol weak undefined. */
1264 DEF
, /* Mark symbol defined. */
1265 DEFW
, /* Mark symbol weak defined. */
1266 COM
, /* Mark symbol common. */
1267 REF
, /* Mark defined symbol referenced. */
1268 CREF
, /* Possibly warn about common reference to defined symbol. */
1269 CDEF
, /* Define existing common symbol. */
1270 NOACT
, /* No action. */
1271 BIG
, /* Mark symbol common using largest size. */
1272 MDEF
, /* Multiple definition error. */
1273 MIND
, /* Multiple indirect symbols. */
1274 IND
, /* Make indirect symbol. */
1275 CIND
, /* Make indirect symbol from existing common symbol. */
1276 SET
, /* Add value to set. */
1277 MWARN
, /* Make warning symbol. */
1278 WARN
, /* Warn if referenced, else MWARN. */
1279 CYCLE
, /* Repeat with symbol pointed to. */
1280 REFC
, /* Mark indirect symbol referenced and then CYCLE. */
1281 WARNC
/* Issue warning and then CYCLE. */
1284 /* The state table itself. The first index is a link_row and the
1285 second index is a bfd_link_hash_type. */
1287 static const enum link_action link_action
[8][8] =
1289 /* current\prev new undef undefw def defw com indr warn */
1290 /* UNDEF_ROW */ {UND
, NOACT
, UND
, REF
, REF
, NOACT
, REFC
, WARNC
},
1291 /* UNDEFW_ROW */ {WEAK
, NOACT
, NOACT
, REF
, REF
, NOACT
, REFC
, WARNC
},
1292 /* DEF_ROW */ {DEF
, DEF
, DEF
, MDEF
, DEF
, CDEF
, MDEF
, CYCLE
},
1293 /* DEFW_ROW */ {DEFW
, DEFW
, DEFW
, NOACT
, NOACT
, NOACT
, NOACT
, CYCLE
},
1294 /* COMMON_ROW */ {COM
, COM
, COM
, CREF
, COM
, BIG
, REFC
, WARNC
},
1295 /* INDR_ROW */ {IND
, IND
, IND
, MDEF
, IND
, CIND
, MIND
, CYCLE
},
1296 /* WARN_ROW */ {MWARN
, WARN
, WARN
, WARN
, WARN
, WARN
, WARN
, NOACT
},
1297 /* SET_ROW */ {SET
, SET
, SET
, SET
, SET
, SET
, CYCLE
, CYCLE
}
1300 /* Most of the entries in the LINK_ACTION table are straightforward,
1301 but a few are somewhat subtle.
1303 A reference to an indirect symbol (UNDEF_ROW/indr or
1304 UNDEFW_ROW/indr) is counted as a reference both to the indirect
1305 symbol and to the symbol the indirect symbol points to.
1307 A reference to a warning symbol (UNDEF_ROW/warn or UNDEFW_ROW/warn)
1308 causes the warning to be issued.
1310 A common definition of an indirect symbol (COMMON_ROW/indr) is
1311 treated as a multiple definition error. Likewise for an indirect
1312 definition of a common symbol (INDR_ROW/com).
1314 An indirect definition of a warning (INDR_ROW/warn) does not cause
1315 the warning to be issued.
1317 If a warning is created for an indirect symbol (WARN_ROW/indr) no
1318 warning is created for the symbol the indirect symbol points to.
1320 Adding an entry to a set does not count as a reference to a set,
1321 and no warning is issued (SET_ROW/warn). */
1323 /* Return the BFD in which a hash entry has been defined, if known. */
1326 hash_entry_bfd (struct bfd_link_hash_entry
*h
)
1328 while (h
->type
== bfd_link_hash_warning
)
1334 case bfd_link_hash_undefined
:
1335 case bfd_link_hash_undefweak
:
1336 return h
->u
.undef
.abfd
;
1337 case bfd_link_hash_defined
:
1338 case bfd_link_hash_defweak
:
1339 return h
->u
.def
.section
->owner
;
1340 case bfd_link_hash_common
:
1341 return h
->u
.c
.p
->section
->owner
;
1346 /* Add a symbol to the global hash table.
1347 ABFD is the BFD the symbol comes from.
1348 NAME is the name of the symbol.
1349 FLAGS is the BSF_* bits associated with the symbol.
1350 SECTION is the section in which the symbol is defined; this may be
1351 bfd_und_section_ptr or bfd_com_section_ptr.
1352 VALUE is the value of the symbol, relative to the section.
1353 STRING is used for either an indirect symbol, in which case it is
1354 the name of the symbol to indirect to, or a warning symbol, in
1355 which case it is the warning string.
1356 COPY is TRUE if NAME or STRING must be copied into locally
1357 allocated memory if they need to be saved.
1358 COLLECT is TRUE if we should automatically collect gcc constructor
1359 or destructor names as collect2 does.
1360 HASHP, if not NULL, is a place to store the created hash table
1361 entry; if *HASHP is not NULL, the caller has already looked up
1362 the hash table entry, and stored it in *HASHP. */
1365 _bfd_generic_link_add_one_symbol (struct bfd_link_info
*info
,
1373 bfd_boolean collect
,
1374 struct bfd_link_hash_entry
**hashp
)
1377 struct bfd_link_hash_entry
*h
;
1378 struct bfd_link_hash_entry
*inh
= NULL
;
1381 BFD_ASSERT (section
!= NULL
);
1383 if (bfd_is_ind_section (section
)
1384 || (flags
& BSF_INDIRECT
) != 0)
1387 /* Create the indirect symbol here. This is for the benefit of
1388 the plugin "notice" function.
1389 STRING is the name of the symbol we want to indirect to. */
1390 inh
= bfd_wrapped_link_hash_lookup (abfd
, info
, string
, TRUE
,
1395 else if ((flags
& BSF_WARNING
) != 0)
1397 else if ((flags
& BSF_CONSTRUCTOR
) != 0)
1399 else if (bfd_is_und_section (section
))
1401 if ((flags
& BSF_WEAK
) != 0)
1406 else if ((flags
& BSF_WEAK
) != 0)
1408 else if (bfd_is_com_section (section
))
1411 if (!bfd_link_relocatable (info
)
1414 && strcmp (name
+ (name
[2] == '_'), "__gnu_lto_slim") == 0)
1416 (_("%pB: plugin needed to handle lto object"), abfd
);
1421 if (hashp
!= NULL
&& *hashp
!= NULL
)
1425 if (row
== UNDEF_ROW
|| row
== UNDEFW_ROW
)
1426 h
= bfd_wrapped_link_hash_lookup (abfd
, info
, name
, TRUE
, copy
, FALSE
);
1428 h
= bfd_link_hash_lookup (info
->hash
, name
, TRUE
, copy
, FALSE
);
1437 if (info
->notice_all
1438 || (info
->notice_hash
!= NULL
1439 && bfd_hash_lookup (info
->notice_hash
, name
, FALSE
, FALSE
) != NULL
))
1441 if (! (*info
->callbacks
->notice
) (info
, h
, inh
,
1442 abfd
, section
, value
, flags
))
1451 enum link_action action
;
1455 /* Treat symbols defined by early linker script pass as undefined. */
1456 if (h
->ldscript_def
)
1457 prev
= bfd_link_hash_undefined
;
1459 action
= link_action
[(int) row
][prev
];
1470 /* Make a new undefined symbol. */
1471 h
->type
= bfd_link_hash_undefined
;
1472 h
->u
.undef
.abfd
= abfd
;
1473 bfd_link_add_undef (info
->hash
, h
);
1477 /* Make a new weak undefined symbol. */
1478 h
->type
= bfd_link_hash_undefweak
;
1479 h
->u
.undef
.abfd
= abfd
;
1483 /* We have found a definition for a symbol which was
1484 previously common. */
1485 BFD_ASSERT (h
->type
== bfd_link_hash_common
);
1486 (*info
->callbacks
->multiple_common
) (info
, h
, abfd
,
1487 bfd_link_hash_defined
, 0);
1492 enum bfd_link_hash_type oldtype
;
1494 /* Define a symbol. */
1497 h
->type
= bfd_link_hash_defweak
;
1499 h
->type
= bfd_link_hash_defined
;
1500 h
->u
.def
.section
= section
;
1501 h
->u
.def
.value
= value
;
1503 h
->ldscript_def
= 0;
1505 /* If we have been asked to, we act like collect2 and
1506 identify all functions that might be global
1507 constructors and destructors and pass them up in a
1508 callback. We only do this for certain object file
1509 types, since many object file types can handle this
1511 if (collect
&& name
[0] == '_')
1515 /* A constructor or destructor name starts like this:
1516 _+GLOBAL_[_.$][ID][_.$] where the first [_.$] and
1517 the second are the same character (we accept any
1518 character there, in case a new object file format
1519 comes along with even worse naming restrictions). */
1521 #define CONS_PREFIX "GLOBAL_"
1522 #define CONS_PREFIX_LEN (sizeof CONS_PREFIX - 1)
1527 if (s
[0] == 'G' && CONST_STRNEQ (s
, CONS_PREFIX
))
1531 c
= s
[CONS_PREFIX_LEN
+ 1];
1532 if ((c
== 'I' || c
== 'D')
1533 && s
[CONS_PREFIX_LEN
] == s
[CONS_PREFIX_LEN
+ 2])
1535 /* If this is a definition of a symbol which
1536 was previously weakly defined, we are in
1537 trouble. We have already added a
1538 constructor entry for the weak defined
1539 symbol, and now we are trying to add one
1540 for the new symbol. Fortunately, this case
1541 should never arise in practice. */
1542 if (oldtype
== bfd_link_hash_defweak
)
1545 (*info
->callbacks
->constructor
) (info
, c
== 'I',
1546 h
->root
.string
, abfd
,
1556 /* We have found a common definition for a symbol. */
1557 if (h
->type
== bfd_link_hash_new
)
1558 bfd_link_add_undef (info
->hash
, h
);
1559 h
->type
= bfd_link_hash_common
;
1560 h
->u
.c
.p
= (struct bfd_link_hash_common_entry
*)
1561 bfd_hash_allocate (&info
->hash
->table
,
1562 sizeof (struct bfd_link_hash_common_entry
));
1563 if (h
->u
.c
.p
== NULL
)
1566 h
->u
.c
.size
= value
;
1568 /* Select a default alignment based on the size. This may
1569 be overridden by the caller. */
1573 power
= bfd_log2 (value
);
1576 h
->u
.c
.p
->alignment_power
= power
;
1579 /* The section of a common symbol is only used if the common
1580 symbol is actually allocated. It basically provides a
1581 hook for the linker script to decide which output section
1582 the common symbols should be put in. In most cases, the
1583 section of a common symbol will be bfd_com_section_ptr,
1584 the code here will choose a common symbol section named
1585 "COMMON", and the linker script will contain *(COMMON) in
1586 the appropriate place. A few targets use separate common
1587 sections for small symbols, and they require special
1589 if (section
== bfd_com_section_ptr
)
1591 h
->u
.c
.p
->section
= bfd_make_section_old_way (abfd
, "COMMON");
1592 h
->u
.c
.p
->section
->flags
|= SEC_ALLOC
;
1594 else if (section
->owner
!= abfd
)
1596 h
->u
.c
.p
->section
= bfd_make_section_old_way (abfd
,
1598 h
->u
.c
.p
->section
->flags
|= SEC_ALLOC
;
1601 h
->u
.c
.p
->section
= section
;
1603 h
->ldscript_def
= 0;
1607 /* A reference to a defined symbol. */
1608 if (h
->u
.undef
.next
== NULL
&& info
->hash
->undefs_tail
!= h
)
1609 h
->u
.undef
.next
= h
;
1613 /* We have found a common definition for a symbol which
1614 already had a common definition. Use the maximum of the
1615 two sizes, and use the section required by the larger symbol. */
1616 BFD_ASSERT (h
->type
== bfd_link_hash_common
);
1617 (*info
->callbacks
->multiple_common
) (info
, h
, abfd
,
1618 bfd_link_hash_common
, value
);
1619 if (value
> h
->u
.c
.size
)
1623 h
->u
.c
.size
= value
;
1625 /* Select a default alignment based on the size. This may
1626 be overridden by the caller. */
1627 power
= bfd_log2 (value
);
1630 h
->u
.c
.p
->alignment_power
= power
;
1632 /* Some systems have special treatment for small commons,
1633 hence we want to select the section used by the larger
1634 symbol. This makes sure the symbol does not go in a
1635 small common section if it is now too large. */
1636 if (section
== bfd_com_section_ptr
)
1639 = bfd_make_section_old_way (abfd
, "COMMON");
1640 h
->u
.c
.p
->section
->flags
|= SEC_ALLOC
;
1642 else if (section
->owner
!= abfd
)
1645 = bfd_make_section_old_way (abfd
, section
->name
);
1646 h
->u
.c
.p
->section
->flags
|= SEC_ALLOC
;
1649 h
->u
.c
.p
->section
= section
;
1654 /* We have found a common definition for a symbol which
1655 was already defined. */
1656 (*info
->callbacks
->multiple_common
) (info
, h
, abfd
,
1657 bfd_link_hash_common
, value
);
1661 /* Multiple indirect symbols. This is OK if they both point
1662 to the same symbol. */
1663 if (strcmp (h
->u
.i
.link
->root
.string
, string
) == 0)
1667 /* Handle a multiple definition. */
1668 (*info
->callbacks
->multiple_definition
) (info
, h
,
1669 abfd
, section
, value
);
1673 /* Create an indirect symbol from an existing common symbol. */
1674 BFD_ASSERT (h
->type
== bfd_link_hash_common
);
1675 (*info
->callbacks
->multiple_common
) (info
, h
, abfd
,
1676 bfd_link_hash_indirect
, 0);
1679 if (inh
->type
== bfd_link_hash_indirect
1680 && inh
->u
.i
.link
== h
)
1683 /* xgettext:c-format */
1684 (_("%pB: indirect symbol `%s' to `%s' is a loop"),
1685 abfd
, name
, string
);
1686 bfd_set_error (bfd_error_invalid_operation
);
1689 if (inh
->type
== bfd_link_hash_new
)
1691 inh
->type
= bfd_link_hash_undefined
;
1692 inh
->u
.undef
.abfd
= abfd
;
1693 bfd_link_add_undef (info
->hash
, inh
);
1696 /* If the indirect symbol has been referenced, we need to
1697 push the reference down to the symbol we are referencing. */
1698 if (h
->type
!= bfd_link_hash_new
)
1700 /* ??? If inh->type == bfd_link_hash_undefweak this
1701 converts inh to bfd_link_hash_undefined. */
1706 h
->type
= bfd_link_hash_indirect
;
1708 /* Not setting h = h->u.i.link here means that when cycle is
1709 set above we'll always go to REFC, and then cycle again
1710 to the indirected symbol. This means that any successful
1711 change of an existing symbol to indirect counts as a
1712 reference. ??? That may not be correct when the existing
1713 symbol was defweak. */
1717 /* Add an entry to a set. */
1718 (*info
->callbacks
->add_to_set
) (info
, h
, BFD_RELOC_CTOR
,
1719 abfd
, section
, value
);
1723 /* Issue a warning and cycle, except when the reference is
1725 if (h
->u
.i
.warning
!= NULL
1726 && (abfd
->flags
& BFD_PLUGIN
) == 0)
1728 (*info
->callbacks
->warning
) (info
, h
->u
.i
.warning
,
1729 h
->root
.string
, abfd
, NULL
, 0);
1730 /* Only issue a warning once. */
1731 h
->u
.i
.warning
= NULL
;
1735 /* Try again with the referenced symbol. */
1741 /* A reference to an indirect symbol. */
1742 if (h
->u
.undef
.next
== NULL
&& info
->hash
->undefs_tail
!= h
)
1743 h
->u
.undef
.next
= h
;
1749 /* Warn if this symbol has been referenced already from non-IR,
1750 otherwise add a warning. */
1751 if ((!info
->lto_plugin_active
1752 && (h
->u
.undef
.next
!= NULL
|| info
->hash
->undefs_tail
== h
))
1753 || h
->non_ir_ref_regular
1754 || h
->non_ir_ref_dynamic
)
1756 (*info
->callbacks
->warning
) (info
, string
, h
->root
.string
,
1757 hash_entry_bfd (h
), NULL
, 0);
1762 /* Make a warning symbol. */
1764 struct bfd_link_hash_entry
*sub
;
1766 /* STRING is the warning to give. */
1767 sub
= ((struct bfd_link_hash_entry
*)
1768 ((*info
->hash
->table
.newfunc
)
1769 (NULL
, &info
->hash
->table
, h
->root
.string
)));
1773 sub
->type
= bfd_link_hash_warning
;
1776 sub
->u
.i
.warning
= string
;
1780 size_t len
= strlen (string
) + 1;
1782 w
= (char *) bfd_hash_allocate (&info
->hash
->table
, len
);
1785 memcpy (w
, string
, len
);
1786 sub
->u
.i
.warning
= w
;
1789 bfd_hash_replace (&info
->hash
->table
,
1790 (struct bfd_hash_entry
*) h
,
1791 (struct bfd_hash_entry
*) sub
);
1803 /* Generic final link routine. */
1806 _bfd_generic_final_link (bfd
*abfd
, struct bfd_link_info
*info
)
1810 struct bfd_link_order
*p
;
1812 struct generic_write_global_symbol_info wginfo
;
1814 bfd_get_outsymbols (abfd
) = NULL
;
1815 bfd_get_symcount (abfd
) = 0;
1818 /* Mark all sections which will be included in the output file. */
1819 for (o
= abfd
->sections
; o
!= NULL
; o
= o
->next
)
1820 for (p
= o
->map_head
.link_order
; p
!= NULL
; p
= p
->next
)
1821 if (p
->type
== bfd_indirect_link_order
)
1822 p
->u
.indirect
.section
->linker_mark
= TRUE
;
1824 /* Build the output symbol table. */
1825 for (sub
= info
->input_bfds
; sub
!= NULL
; sub
= sub
->link
.next
)
1826 if (! _bfd_generic_link_output_symbols (abfd
, sub
, info
, &outsymalloc
))
1829 /* Accumulate the global symbols. */
1831 wginfo
.output_bfd
= abfd
;
1832 wginfo
.psymalloc
= &outsymalloc
;
1833 _bfd_generic_link_hash_traverse (_bfd_generic_hash_table (info
),
1834 _bfd_generic_link_write_global_symbol
,
1837 /* Make sure we have a trailing NULL pointer on OUTSYMBOLS. We
1838 shouldn't really need one, since we have SYMCOUNT, but some old
1839 code still expects one. */
1840 if (! generic_add_output_symbol (abfd
, &outsymalloc
, NULL
))
1843 if (bfd_link_relocatable (info
))
1845 /* Allocate space for the output relocs for each section. */
1846 for (o
= abfd
->sections
; o
!= NULL
; o
= o
->next
)
1849 for (p
= o
->map_head
.link_order
; p
!= NULL
; p
= p
->next
)
1851 if (p
->type
== bfd_section_reloc_link_order
1852 || p
->type
== bfd_symbol_reloc_link_order
)
1854 else if (p
->type
== bfd_indirect_link_order
)
1856 asection
*input_section
;
1863 input_section
= p
->u
.indirect
.section
;
1864 input_bfd
= input_section
->owner
;
1865 relsize
= bfd_get_reloc_upper_bound (input_bfd
,
1869 relocs
= (arelent
**) bfd_malloc (relsize
);
1870 if (!relocs
&& relsize
!= 0)
1872 symbols
= _bfd_generic_link_get_symbols (input_bfd
);
1873 reloc_count
= bfd_canonicalize_reloc (input_bfd
,
1878 if (reloc_count
< 0)
1880 BFD_ASSERT ((unsigned long) reloc_count
1881 == input_section
->reloc_count
);
1882 o
->reloc_count
+= reloc_count
;
1885 if (o
->reloc_count
> 0)
1889 amt
= o
->reloc_count
;
1890 amt
*= sizeof (arelent
*);
1891 o
->orelocation
= (struct reloc_cache_entry
**) bfd_alloc (abfd
, amt
);
1892 if (!o
->orelocation
)
1894 o
->flags
|= SEC_RELOC
;
1895 /* Reset the count so that it can be used as an index
1896 when putting in the output relocs. */
1902 /* Handle all the link order information for the sections. */
1903 for (o
= abfd
->sections
; o
!= NULL
; o
= o
->next
)
1905 for (p
= o
->map_head
.link_order
; p
!= NULL
; p
= p
->next
)
1909 case bfd_section_reloc_link_order
:
1910 case bfd_symbol_reloc_link_order
:
1911 if (! _bfd_generic_reloc_link_order (abfd
, info
, o
, p
))
1914 case bfd_indirect_link_order
:
1915 if (! default_indirect_link_order (abfd
, info
, o
, p
, TRUE
))
1919 if (! _bfd_default_link_order (abfd
, info
, o
, p
))
1929 /* Add an output symbol to the output BFD. */
1932 generic_add_output_symbol (bfd
*output_bfd
, size_t *psymalloc
, asymbol
*sym
)
1934 if (bfd_get_symcount (output_bfd
) >= *psymalloc
)
1939 if (*psymalloc
== 0)
1944 amt
*= sizeof (asymbol
*);
1945 newsyms
= (asymbol
**) bfd_realloc (bfd_get_outsymbols (output_bfd
), amt
);
1946 if (newsyms
== NULL
)
1948 bfd_get_outsymbols (output_bfd
) = newsyms
;
1951 bfd_get_outsymbols (output_bfd
) [bfd_get_symcount (output_bfd
)] = sym
;
1953 ++ bfd_get_symcount (output_bfd
);
1958 /* Handle the symbols for an input BFD. */
1961 _bfd_generic_link_output_symbols (bfd
*output_bfd
,
1963 struct bfd_link_info
*info
,
1969 if (!bfd_generic_link_read_symbols (input_bfd
))
1972 /* Create a filename symbol if we are supposed to. */
1973 if (info
->create_object_symbols_section
!= NULL
)
1977 for (sec
= input_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
1979 if (sec
->output_section
== info
->create_object_symbols_section
)
1983 newsym
= bfd_make_empty_symbol (input_bfd
);
1986 newsym
->name
= input_bfd
->filename
;
1988 newsym
->flags
= BSF_LOCAL
| BSF_FILE
;
1989 newsym
->section
= sec
;
1991 if (! generic_add_output_symbol (output_bfd
, psymalloc
,
2000 /* Adjust the values of the globally visible symbols, and write out
2002 sym_ptr
= _bfd_generic_link_get_symbols (input_bfd
);
2003 sym_end
= sym_ptr
+ _bfd_generic_link_get_symcount (input_bfd
);
2004 for (; sym_ptr
< sym_end
; sym_ptr
++)
2007 struct generic_link_hash_entry
*h
;
2012 if ((sym
->flags
& (BSF_INDIRECT
2017 || bfd_is_und_section (bfd_get_section (sym
))
2018 || bfd_is_com_section (bfd_get_section (sym
))
2019 || bfd_is_ind_section (bfd_get_section (sym
)))
2021 if (sym
->udata
.p
!= NULL
)
2022 h
= (struct generic_link_hash_entry
*) sym
->udata
.p
;
2023 else if ((sym
->flags
& BSF_CONSTRUCTOR
) != 0)
2025 /* This case normally means that the main linker code
2026 deliberately ignored this constructor symbol. We
2027 should just pass it through. This will screw up if
2028 the constructor symbol is from a different,
2029 non-generic, object file format, but the case will
2030 only arise when linking with -r, which will probably
2031 fail anyhow, since there will be no way to represent
2032 the relocs in the output format being used. */
2035 else if (bfd_is_und_section (bfd_get_section (sym
)))
2036 h
= ((struct generic_link_hash_entry
*)
2037 bfd_wrapped_link_hash_lookup (output_bfd
, info
,
2038 bfd_asymbol_name (sym
),
2039 FALSE
, FALSE
, TRUE
));
2041 h
= _bfd_generic_link_hash_lookup (_bfd_generic_hash_table (info
),
2042 bfd_asymbol_name (sym
),
2043 FALSE
, FALSE
, TRUE
);
2047 /* Force all references to this symbol to point to
2048 the same area in memory. It is possible that
2049 this routine will be called with a hash table
2050 other than a generic hash table, so we double
2052 if (info
->output_bfd
->xvec
== input_bfd
->xvec
)
2055 *sym_ptr
= sym
= h
->sym
;
2058 switch (h
->root
.type
)
2061 case bfd_link_hash_new
:
2063 case bfd_link_hash_undefined
:
2065 case bfd_link_hash_undefweak
:
2066 sym
->flags
|= BSF_WEAK
;
2068 case bfd_link_hash_indirect
:
2069 h
= (struct generic_link_hash_entry
*) h
->root
.u
.i
.link
;
2071 case bfd_link_hash_defined
:
2072 sym
->flags
|= BSF_GLOBAL
;
2073 sym
->flags
&=~ (BSF_WEAK
| BSF_CONSTRUCTOR
);
2074 sym
->value
= h
->root
.u
.def
.value
;
2075 sym
->section
= h
->root
.u
.def
.section
;
2077 case bfd_link_hash_defweak
:
2078 sym
->flags
|= BSF_WEAK
;
2079 sym
->flags
&=~ BSF_CONSTRUCTOR
;
2080 sym
->value
= h
->root
.u
.def
.value
;
2081 sym
->section
= h
->root
.u
.def
.section
;
2083 case bfd_link_hash_common
:
2084 sym
->value
= h
->root
.u
.c
.size
;
2085 sym
->flags
|= BSF_GLOBAL
;
2086 if (! bfd_is_com_section (sym
->section
))
2088 BFD_ASSERT (bfd_is_und_section (sym
->section
));
2089 sym
->section
= bfd_com_section_ptr
;
2091 /* We do not set the section of the symbol to
2092 h->root.u.c.p->section. That value was saved so
2093 that we would know where to allocate the symbol
2094 if it was defined. In this case the type is
2095 still bfd_link_hash_common, so we did not define
2096 it, so we do not want to use that section. */
2102 /* This switch is straight from the old code in
2103 write_file_locals in ldsym.c. */
2104 if (info
->strip
== strip_all
2105 || (info
->strip
== strip_some
2106 && bfd_hash_lookup (info
->keep_hash
, bfd_asymbol_name (sym
),
2107 FALSE
, FALSE
) == NULL
))
2109 else if ((sym
->flags
& (BSF_GLOBAL
| BSF_WEAK
| BSF_GNU_UNIQUE
)) != 0)
2111 /* If this symbol is marked as occurring now, rather
2112 than at the end, output it now. This is used for
2113 COFF C_EXT FCN symbols. FIXME: There must be a
2115 if (bfd_asymbol_bfd (sym
) == input_bfd
2116 && (sym
->flags
& BSF_NOT_AT_END
) != 0)
2121 else if (bfd_is_ind_section (sym
->section
))
2123 else if ((sym
->flags
& BSF_DEBUGGING
) != 0)
2125 if (info
->strip
== strip_none
)
2130 else if (bfd_is_und_section (sym
->section
)
2131 || bfd_is_com_section (sym
->section
))
2133 else if ((sym
->flags
& BSF_LOCAL
) != 0)
2135 if ((sym
->flags
& BSF_WARNING
) != 0)
2139 switch (info
->discard
)
2145 case discard_sec_merge
:
2147 if (bfd_link_relocatable (info
)
2148 || ! (sym
->section
->flags
& SEC_MERGE
))
2152 if (bfd_is_local_label (input_bfd
, sym
))
2163 else if ((sym
->flags
& BSF_CONSTRUCTOR
))
2165 if (info
->strip
!= strip_all
)
2170 else if (sym
->flags
== 0
2171 && (sym
->section
->owner
->flags
& BFD_PLUGIN
) != 0)
2172 /* LTO doesn't set symbol information. We get here with the
2173 generic linker for a symbol that was "common" but no longer
2174 needs to be global. */
2179 /* If this symbol is in a section which is not being included
2180 in the output file, then we don't want to output the
2182 if (!bfd_is_abs_section (sym
->section
)
2183 && bfd_section_removed_from_list (output_bfd
,
2184 sym
->section
->output_section
))
2189 if (! generic_add_output_symbol (output_bfd
, psymalloc
, sym
))
2199 /* Set the section and value of a generic BFD symbol based on a linker
2200 hash table entry. */
2203 set_symbol_from_hash (asymbol
*sym
, struct bfd_link_hash_entry
*h
)
2210 case bfd_link_hash_new
:
2211 /* This can happen when a constructor symbol is seen but we are
2212 not building constructors. */
2213 if (sym
->section
!= NULL
)
2215 BFD_ASSERT ((sym
->flags
& BSF_CONSTRUCTOR
) != 0);
2219 sym
->flags
|= BSF_CONSTRUCTOR
;
2220 sym
->section
= bfd_abs_section_ptr
;
2224 case bfd_link_hash_undefined
:
2225 sym
->section
= bfd_und_section_ptr
;
2228 case bfd_link_hash_undefweak
:
2229 sym
->section
= bfd_und_section_ptr
;
2231 sym
->flags
|= BSF_WEAK
;
2233 case bfd_link_hash_defined
:
2234 sym
->section
= h
->u
.def
.section
;
2235 sym
->value
= h
->u
.def
.value
;
2237 case bfd_link_hash_defweak
:
2238 sym
->flags
|= BSF_WEAK
;
2239 sym
->section
= h
->u
.def
.section
;
2240 sym
->value
= h
->u
.def
.value
;
2242 case bfd_link_hash_common
:
2243 sym
->value
= h
->u
.c
.size
;
2244 if (sym
->section
== NULL
)
2245 sym
->section
= bfd_com_section_ptr
;
2246 else if (! bfd_is_com_section (sym
->section
))
2248 BFD_ASSERT (bfd_is_und_section (sym
->section
));
2249 sym
->section
= bfd_com_section_ptr
;
2251 /* Do not set the section; see _bfd_generic_link_output_symbols. */
2253 case bfd_link_hash_indirect
:
2254 case bfd_link_hash_warning
:
2255 /* FIXME: What should we do here? */
2260 /* Write out a global symbol, if it hasn't already been written out.
2261 This is called for each symbol in the hash table. */
2264 _bfd_generic_link_write_global_symbol (struct generic_link_hash_entry
*h
,
2267 struct generic_write_global_symbol_info
*wginfo
=
2268 (struct generic_write_global_symbol_info
*) data
;
2276 if (wginfo
->info
->strip
== strip_all
2277 || (wginfo
->info
->strip
== strip_some
2278 && bfd_hash_lookup (wginfo
->info
->keep_hash
, h
->root
.root
.string
,
2279 FALSE
, FALSE
) == NULL
))
2286 sym
= bfd_make_empty_symbol (wginfo
->output_bfd
);
2289 sym
->name
= h
->root
.root
.string
;
2293 set_symbol_from_hash (sym
, &h
->root
);
2295 sym
->flags
|= BSF_GLOBAL
;
2297 if (! generic_add_output_symbol (wginfo
->output_bfd
, wginfo
->psymalloc
,
2300 /* FIXME: No way to return failure. */
2307 /* Create a relocation. */
2310 _bfd_generic_reloc_link_order (bfd
*abfd
,
2311 struct bfd_link_info
*info
,
2313 struct bfd_link_order
*link_order
)
2317 if (! bfd_link_relocatable (info
))
2319 if (sec
->orelocation
== NULL
)
2322 r
= (arelent
*) bfd_alloc (abfd
, sizeof (arelent
));
2326 r
->address
= link_order
->offset
;
2327 r
->howto
= bfd_reloc_type_lookup (abfd
, link_order
->u
.reloc
.p
->reloc
);
2330 bfd_set_error (bfd_error_bad_value
);
2334 /* Get the symbol to use for the relocation. */
2335 if (link_order
->type
== bfd_section_reloc_link_order
)
2336 r
->sym_ptr_ptr
= link_order
->u
.reloc
.p
->u
.section
->symbol_ptr_ptr
;
2339 struct generic_link_hash_entry
*h
;
2341 h
= ((struct generic_link_hash_entry
*)
2342 bfd_wrapped_link_hash_lookup (abfd
, info
,
2343 link_order
->u
.reloc
.p
->u
.name
,
2344 FALSE
, FALSE
, TRUE
));
2348 (*info
->callbacks
->unattached_reloc
)
2349 (info
, link_order
->u
.reloc
.p
->u
.name
, NULL
, NULL
, 0);
2350 bfd_set_error (bfd_error_bad_value
);
2353 r
->sym_ptr_ptr
= &h
->sym
;
2356 /* If this is an inplace reloc, write the addend to the object file.
2357 Otherwise, store it in the reloc addend. */
2358 if (! r
->howto
->partial_inplace
)
2359 r
->addend
= link_order
->u
.reloc
.p
->addend
;
2363 bfd_reloc_status_type rstat
;
2368 size
= bfd_get_reloc_size (r
->howto
);
2369 buf
= (bfd_byte
*) bfd_zmalloc (size
);
2370 if (buf
== NULL
&& size
!= 0)
2372 rstat
= _bfd_relocate_contents (r
->howto
, abfd
,
2373 (bfd_vma
) link_order
->u
.reloc
.p
->addend
,
2380 case bfd_reloc_outofrange
:
2382 case bfd_reloc_overflow
:
2383 (*info
->callbacks
->reloc_overflow
)
2385 (link_order
->type
== bfd_section_reloc_link_order
2386 ? bfd_section_name (abfd
, link_order
->u
.reloc
.p
->u
.section
)
2387 : link_order
->u
.reloc
.p
->u
.name
),
2388 r
->howto
->name
, link_order
->u
.reloc
.p
->addend
,
2392 loc
= link_order
->offset
* bfd_octets_per_byte (abfd
);
2393 ok
= bfd_set_section_contents (abfd
, sec
, buf
, loc
, size
);
2401 sec
->orelocation
[sec
->reloc_count
] = r
;
2407 /* Allocate a new link_order for a section. */
2409 struct bfd_link_order
*
2410 bfd_new_link_order (bfd
*abfd
, asection
*section
)
2412 bfd_size_type amt
= sizeof (struct bfd_link_order
);
2413 struct bfd_link_order
*new_lo
;
2415 new_lo
= (struct bfd_link_order
*) bfd_zalloc (abfd
, amt
);
2419 new_lo
->type
= bfd_undefined_link_order
;
2421 if (section
->map_tail
.link_order
!= NULL
)
2422 section
->map_tail
.link_order
->next
= new_lo
;
2424 section
->map_head
.link_order
= new_lo
;
2425 section
->map_tail
.link_order
= new_lo
;
2430 /* Default link order processing routine. Note that we can not handle
2431 the reloc_link_order types here, since they depend upon the details
2432 of how the particular backends generates relocs. */
2435 _bfd_default_link_order (bfd
*abfd
,
2436 struct bfd_link_info
*info
,
2438 struct bfd_link_order
*link_order
)
2440 switch (link_order
->type
)
2442 case bfd_undefined_link_order
:
2443 case bfd_section_reloc_link_order
:
2444 case bfd_symbol_reloc_link_order
:
2447 case bfd_indirect_link_order
:
2448 return default_indirect_link_order (abfd
, info
, sec
, link_order
,
2450 case bfd_data_link_order
:
2451 return default_data_link_order (abfd
, info
, sec
, link_order
);
2455 /* Default routine to handle a bfd_data_link_order. */
2458 default_data_link_order (bfd
*abfd
,
2459 struct bfd_link_info
*info ATTRIBUTE_UNUSED
,
2461 struct bfd_link_order
*link_order
)
2469 BFD_ASSERT ((sec
->flags
& SEC_HAS_CONTENTS
) != 0);
2471 size
= link_order
->size
;
2475 fill
= link_order
->u
.data
.contents
;
2476 fill_size
= link_order
->u
.data
.size
;
2479 fill
= abfd
->arch_info
->fill (size
, bfd_big_endian (abfd
),
2480 (sec
->flags
& SEC_CODE
) != 0);
2484 else if (fill_size
< size
)
2487 fill
= (bfd_byte
*) bfd_malloc (size
);
2492 memset (p
, (int) link_order
->u
.data
.contents
[0], (size_t) size
);
2497 memcpy (p
, link_order
->u
.data
.contents
, fill_size
);
2501 while (size
>= fill_size
);
2503 memcpy (p
, link_order
->u
.data
.contents
, (size_t) size
);
2504 size
= link_order
->size
;
2508 loc
= link_order
->offset
* bfd_octets_per_byte (abfd
);
2509 result
= bfd_set_section_contents (abfd
, sec
, fill
, loc
, size
);
2511 if (fill
!= link_order
->u
.data
.contents
)
2516 /* Default routine to handle a bfd_indirect_link_order. */
2519 default_indirect_link_order (bfd
*output_bfd
,
2520 struct bfd_link_info
*info
,
2521 asection
*output_section
,
2522 struct bfd_link_order
*link_order
,
2523 bfd_boolean generic_linker
)
2525 asection
*input_section
;
2527 bfd_byte
*contents
= NULL
;
2528 bfd_byte
*new_contents
;
2529 bfd_size_type sec_size
;
2532 BFD_ASSERT ((output_section
->flags
& SEC_HAS_CONTENTS
) != 0);
2534 input_section
= link_order
->u
.indirect
.section
;
2535 input_bfd
= input_section
->owner
;
2536 if (input_section
->size
== 0)
2539 BFD_ASSERT (input_section
->output_section
== output_section
);
2540 BFD_ASSERT (input_section
->output_offset
== link_order
->offset
);
2541 BFD_ASSERT (input_section
->size
== link_order
->size
);
2543 if (bfd_link_relocatable (info
)
2544 && input_section
->reloc_count
> 0
2545 && output_section
->orelocation
== NULL
)
2547 /* Space has not been allocated for the output relocations.
2548 This can happen when we are called by a specific backend
2549 because somebody is attempting to link together different
2550 types of object files. Handling this case correctly is
2551 difficult, and sometimes impossible. */
2553 /* xgettext:c-format */
2554 (_("attempt to do relocatable link with %s input and %s output"),
2555 bfd_get_target (input_bfd
), bfd_get_target (output_bfd
));
2556 bfd_set_error (bfd_error_wrong_format
);
2560 if (! generic_linker
)
2565 /* Get the canonical symbols. The generic linker will always
2566 have retrieved them by this point, but we are being called by
2567 a specific linker, presumably because we are linking
2568 different types of object files together. */
2569 if (!bfd_generic_link_read_symbols (input_bfd
))
2572 /* Since we have been called by a specific linker, rather than
2573 the generic linker, the values of the symbols will not be
2574 right. They will be the values as seen in the input file,
2575 not the values of the final link. We need to fix them up
2576 before we can relocate the section. */
2577 sympp
= _bfd_generic_link_get_symbols (input_bfd
);
2578 symppend
= sympp
+ _bfd_generic_link_get_symcount (input_bfd
);
2579 for (; sympp
< symppend
; sympp
++)
2582 struct bfd_link_hash_entry
*h
;
2586 if ((sym
->flags
& (BSF_INDIRECT
2591 || bfd_is_und_section (bfd_get_section (sym
))
2592 || bfd_is_com_section (bfd_get_section (sym
))
2593 || bfd_is_ind_section (bfd_get_section (sym
)))
2595 /* sym->udata may have been set by
2596 generic_link_add_symbol_list. */
2597 if (sym
->udata
.p
!= NULL
)
2598 h
= (struct bfd_link_hash_entry
*) sym
->udata
.p
;
2599 else if (bfd_is_und_section (bfd_get_section (sym
)))
2600 h
= bfd_wrapped_link_hash_lookup (output_bfd
, info
,
2601 bfd_asymbol_name (sym
),
2602 FALSE
, FALSE
, TRUE
);
2604 h
= bfd_link_hash_lookup (info
->hash
,
2605 bfd_asymbol_name (sym
),
2606 FALSE
, FALSE
, TRUE
);
2608 set_symbol_from_hash (sym
, h
);
2613 if ((output_section
->flags
& (SEC_GROUP
| SEC_LINKER_CREATED
)) == SEC_GROUP
2614 && input_section
->size
!= 0)
2616 /* Group section contents are set by bfd_elf_set_group_contents. */
2617 if (!output_bfd
->output_has_begun
)
2619 /* FIXME: This hack ensures bfd_elf_set_group_contents is called. */
2620 if (!bfd_set_section_contents (output_bfd
, output_section
, "", 0, 1))
2623 new_contents
= output_section
->contents
;
2624 BFD_ASSERT (new_contents
!= NULL
);
2625 BFD_ASSERT (input_section
->output_offset
== 0);
2629 /* Get and relocate the section contents. */
2630 sec_size
= (input_section
->rawsize
> input_section
->size
2631 ? input_section
->rawsize
2632 : input_section
->size
);
2633 contents
= (bfd_byte
*) bfd_malloc (sec_size
);
2634 if (contents
== NULL
&& sec_size
!= 0)
2636 new_contents
= (bfd_get_relocated_section_contents
2637 (output_bfd
, info
, link_order
, contents
,
2638 bfd_link_relocatable (info
),
2639 _bfd_generic_link_get_symbols (input_bfd
)));
2644 /* Output the section contents. */
2645 loc
= input_section
->output_offset
* bfd_octets_per_byte (output_bfd
);
2646 if (! bfd_set_section_contents (output_bfd
, output_section
,
2647 new_contents
, loc
, input_section
->size
))
2650 if (contents
!= NULL
)
2655 if (contents
!= NULL
)
2660 /* A little routine to count the number of relocs in a link_order
2664 _bfd_count_link_order_relocs (struct bfd_link_order
*link_order
)
2666 register unsigned int c
;
2667 register struct bfd_link_order
*l
;
2670 for (l
= link_order
; l
!= NULL
; l
= l
->next
)
2672 if (l
->type
== bfd_section_reloc_link_order
2673 || l
->type
== bfd_symbol_reloc_link_order
)
2682 bfd_link_split_section
2685 bfd_boolean bfd_link_split_section (bfd *abfd, asection *sec);
2688 Return nonzero if @var{sec} should be split during a
2689 reloceatable or final link.
2691 .#define bfd_link_split_section(abfd, sec) \
2692 . BFD_SEND (abfd, _bfd_link_split_section, (abfd, sec))
2698 _bfd_generic_link_split_section (bfd
*abfd ATTRIBUTE_UNUSED
,
2699 asection
*sec ATTRIBUTE_UNUSED
)
2706 bfd_section_already_linked
2709 bfd_boolean bfd_section_already_linked (bfd *abfd,
2711 struct bfd_link_info *info);
2714 Check if @var{data} has been already linked during a reloceatable
2715 or final link. Return TRUE if it has.
2717 .#define bfd_section_already_linked(abfd, sec, info) \
2718 . BFD_SEND (abfd, _section_already_linked, (abfd, sec, info))
2723 /* Sections marked with the SEC_LINK_ONCE flag should only be linked
2724 once into the output. This routine checks each section, and
2725 arrange to discard it if a section of the same name has already
2726 been linked. This code assumes that all relevant sections have the
2727 SEC_LINK_ONCE flag set; that is, it does not depend solely upon the
2728 section name. bfd_section_already_linked is called via
2729 bfd_map_over_sections. */
2731 /* The hash table. */
2733 static struct bfd_hash_table _bfd_section_already_linked_table
;
2735 /* Support routines for the hash table used by section_already_linked,
2736 initialize the table, traverse, lookup, fill in an entry and remove
2740 bfd_section_already_linked_table_traverse
2741 (bfd_boolean (*func
) (struct bfd_section_already_linked_hash_entry
*,
2742 void *), void *info
)
2744 bfd_hash_traverse (&_bfd_section_already_linked_table
,
2745 (bfd_boolean (*) (struct bfd_hash_entry
*,
2750 struct bfd_section_already_linked_hash_entry
*
2751 bfd_section_already_linked_table_lookup (const char *name
)
2753 return ((struct bfd_section_already_linked_hash_entry
*)
2754 bfd_hash_lookup (&_bfd_section_already_linked_table
, name
,
2759 bfd_section_already_linked_table_insert
2760 (struct bfd_section_already_linked_hash_entry
*already_linked_list
,
2763 struct bfd_section_already_linked
*l
;
2765 /* Allocate the memory from the same obstack as the hash table is
2767 l
= (struct bfd_section_already_linked
*)
2768 bfd_hash_allocate (&_bfd_section_already_linked_table
, sizeof *l
);
2772 l
->next
= already_linked_list
->entry
;
2773 already_linked_list
->entry
= l
;
2777 static struct bfd_hash_entry
*
2778 already_linked_newfunc (struct bfd_hash_entry
*entry ATTRIBUTE_UNUSED
,
2779 struct bfd_hash_table
*table
,
2780 const char *string ATTRIBUTE_UNUSED
)
2782 struct bfd_section_already_linked_hash_entry
*ret
=
2783 (struct bfd_section_already_linked_hash_entry
*)
2784 bfd_hash_allocate (table
, sizeof *ret
);
2795 bfd_section_already_linked_table_init (void)
2797 return bfd_hash_table_init_n (&_bfd_section_already_linked_table
,
2798 already_linked_newfunc
,
2799 sizeof (struct bfd_section_already_linked_hash_entry
),
2804 bfd_section_already_linked_table_free (void)
2806 bfd_hash_table_free (&_bfd_section_already_linked_table
);
2809 /* Report warnings as appropriate for duplicate section SEC.
2810 Return FALSE if we decide to keep SEC after all. */
2813 _bfd_handle_already_linked (asection
*sec
,
2814 struct bfd_section_already_linked
*l
,
2815 struct bfd_link_info
*info
)
2817 switch (sec
->flags
& SEC_LINK_DUPLICATES
)
2822 case SEC_LINK_DUPLICATES_DISCARD
:
2823 /* If we found an LTO IR match for this comdat group on
2824 the first pass, replace it with the LTO output on the
2825 second pass. We can't simply choose real object
2826 files over IR because the first pass may contain a
2827 mix of LTO and normal objects and we must keep the
2828 first match, be it IR or real. */
2829 if (sec
->owner
->lto_output
2830 && (l
->sec
->owner
->flags
& BFD_PLUGIN
) != 0)
2837 case SEC_LINK_DUPLICATES_ONE_ONLY
:
2838 info
->callbacks
->einfo
2839 /* xgettext:c-format */
2840 (_("%pB: ignoring duplicate section `%pA'\n"),
2844 case SEC_LINK_DUPLICATES_SAME_SIZE
:
2845 if ((l
->sec
->owner
->flags
& BFD_PLUGIN
) != 0)
2847 else if (sec
->size
!= l
->sec
->size
)
2848 info
->callbacks
->einfo
2849 /* xgettext:c-format */
2850 (_("%pB: duplicate section `%pA' has different size\n"),
2854 case SEC_LINK_DUPLICATES_SAME_CONTENTS
:
2855 if ((l
->sec
->owner
->flags
& BFD_PLUGIN
) != 0)
2857 else if (sec
->size
!= l
->sec
->size
)
2858 info
->callbacks
->einfo
2859 /* xgettext:c-format */
2860 (_("%pB: duplicate section `%pA' has different size\n"),
2862 else if (sec
->size
!= 0)
2864 bfd_byte
*sec_contents
, *l_sec_contents
= NULL
;
2866 if (!bfd_malloc_and_get_section (sec
->owner
, sec
, &sec_contents
))
2867 info
->callbacks
->einfo
2868 /* xgettext:c-format */
2869 (_("%pB: could not read contents of section `%pA'\n"),
2871 else if (!bfd_malloc_and_get_section (l
->sec
->owner
, l
->sec
,
2873 info
->callbacks
->einfo
2874 /* xgettext:c-format */
2875 (_("%pB: could not read contents of section `%pA'\n"),
2876 l
->sec
->owner
, l
->sec
);
2877 else if (memcmp (sec_contents
, l_sec_contents
, sec
->size
) != 0)
2878 info
->callbacks
->einfo
2879 /* xgettext:c-format */
2880 (_("%pB: duplicate section `%pA' has different contents\n"),
2884 free (sec_contents
);
2886 free (l_sec_contents
);
2891 /* Set the output_section field so that lang_add_section
2892 does not create a lang_input_section structure for this
2893 section. Since there might be a symbol in the section
2894 being discarded, we must retain a pointer to the section
2895 which we are really going to use. */
2896 sec
->output_section
= bfd_abs_section_ptr
;
2897 sec
->kept_section
= l
->sec
;
2901 /* This is used on non-ELF inputs. */
2904 _bfd_generic_section_already_linked (bfd
*abfd ATTRIBUTE_UNUSED
,
2906 struct bfd_link_info
*info
)
2909 struct bfd_section_already_linked
*l
;
2910 struct bfd_section_already_linked_hash_entry
*already_linked_list
;
2912 if ((sec
->flags
& SEC_LINK_ONCE
) == 0)
2915 /* The generic linker doesn't handle section groups. */
2916 if ((sec
->flags
& SEC_GROUP
) != 0)
2919 /* FIXME: When doing a relocatable link, we may have trouble
2920 copying relocations in other sections that refer to local symbols
2921 in the section being discarded. Those relocations will have to
2922 be converted somehow; as of this writing I'm not sure that any of
2923 the backends handle that correctly.
2925 It is tempting to instead not discard link once sections when
2926 doing a relocatable link (technically, they should be discarded
2927 whenever we are building constructors). However, that fails,
2928 because the linker winds up combining all the link once sections
2929 into a single large link once section, which defeats the purpose
2930 of having link once sections in the first place. */
2932 name
= bfd_get_section_name (abfd
, sec
);
2934 already_linked_list
= bfd_section_already_linked_table_lookup (name
);
2936 l
= already_linked_list
->entry
;
2939 /* The section has already been linked. See if we should
2941 return _bfd_handle_already_linked (sec
, l
, info
);
2944 /* This is the first section with this name. Record it. */
2945 if (!bfd_section_already_linked_table_insert (already_linked_list
, sec
))
2946 info
->callbacks
->einfo (_("%F%P: already_linked_table: %E\n"));
2950 /* Choose a neighbouring section to S in OBFD that will be output, or
2951 the absolute section if ADDR is out of bounds of the neighbours. */
2954 _bfd_nearby_section (bfd
*obfd
, asection
*s
, bfd_vma addr
)
2956 asection
*next
, *prev
, *best
;
2958 /* Find preceding kept section. */
2959 for (prev
= s
->prev
; prev
!= NULL
; prev
= prev
->prev
)
2960 if ((prev
->flags
& SEC_EXCLUDE
) == 0
2961 && !bfd_section_removed_from_list (obfd
, prev
))
2964 /* Find following kept section. Start at prev->next because
2965 other sections may have been added after S was removed. */
2966 if (s
->prev
!= NULL
)
2967 next
= s
->prev
->next
;
2969 next
= s
->owner
->sections
;
2970 for (; next
!= NULL
; next
= next
->next
)
2971 if ((next
->flags
& SEC_EXCLUDE
) == 0
2972 && !bfd_section_removed_from_list (obfd
, next
))
2975 /* Choose better of two sections, based on flags. The idea
2976 is to choose a section that will be in the same segment
2977 as S would have been if it was kept. */
2982 best
= bfd_abs_section_ptr
;
2984 else if (next
== NULL
)
2986 else if (((prev
->flags
^ next
->flags
)
2987 & (SEC_ALLOC
| SEC_THREAD_LOCAL
| SEC_LOAD
)) != 0)
2989 if (((next
->flags
^ s
->flags
)
2990 & (SEC_ALLOC
| SEC_THREAD_LOCAL
)) != 0
2991 /* We prefer to choose a loaded section. Section S
2992 doesn't have SEC_LOAD set (it being excluded, that
2993 part of the flag processing didn't happen) so we
2994 can't compare that flag to those of NEXT and PREV. */
2995 || ((prev
->flags
& SEC_LOAD
) != 0
2996 && (next
->flags
& SEC_LOAD
) == 0))
2999 else if (((prev
->flags
^ next
->flags
) & SEC_READONLY
) != 0)
3001 if (((next
->flags
^ s
->flags
) & SEC_READONLY
) != 0)
3004 else if (((prev
->flags
^ next
->flags
) & SEC_CODE
) != 0)
3006 if (((next
->flags
^ s
->flags
) & SEC_CODE
) != 0)
3011 /* Flags we care about are the same. Prefer the following
3012 section if that will result in a positive valued sym. */
3013 if (addr
< next
->vma
)
3020 /* Convert symbols in excluded output sections to use a kept section. */
3023 fix_syms (struct bfd_link_hash_entry
*h
, void *data
)
3025 bfd
*obfd
= (bfd
*) data
;
3027 if (h
->type
== bfd_link_hash_defined
3028 || h
->type
== bfd_link_hash_defweak
)
3030 asection
*s
= h
->u
.def
.section
;
3032 && s
->output_section
!= NULL
3033 && (s
->output_section
->flags
& SEC_EXCLUDE
) != 0
3034 && bfd_section_removed_from_list (obfd
, s
->output_section
))
3038 h
->u
.def
.value
+= s
->output_offset
+ s
->output_section
->vma
;
3039 op
= _bfd_nearby_section (obfd
, s
->output_section
, h
->u
.def
.value
);
3040 h
->u
.def
.value
-= op
->vma
;
3041 h
->u
.def
.section
= op
;
3049 _bfd_fix_excluded_sec_syms (bfd
*obfd
, struct bfd_link_info
*info
)
3051 bfd_link_hash_traverse (info
->hash
, fix_syms
, obfd
);
3056 bfd_generic_define_common_symbol
3059 bfd_boolean bfd_generic_define_common_symbol
3060 (bfd *output_bfd, struct bfd_link_info *info,
3061 struct bfd_link_hash_entry *h);
3064 Convert common symbol @var{h} into a defined symbol.
3065 Return TRUE on success and FALSE on failure.
3067 .#define bfd_define_common_symbol(output_bfd, info, h) \
3068 . BFD_SEND (output_bfd, _bfd_define_common_symbol, (output_bfd, info, h))
3073 bfd_generic_define_common_symbol (bfd
*output_bfd
,
3074 struct bfd_link_info
*info ATTRIBUTE_UNUSED
,
3075 struct bfd_link_hash_entry
*h
)
3077 unsigned int power_of_two
;
3078 bfd_vma alignment
, size
;
3081 BFD_ASSERT (h
!= NULL
&& h
->type
== bfd_link_hash_common
);
3084 power_of_two
= h
->u
.c
.p
->alignment_power
;
3085 section
= h
->u
.c
.p
->section
;
3087 /* Increase the size of the section to align the common symbol.
3088 The alignment must be a power of two. */
3089 alignment
= bfd_octets_per_byte (output_bfd
) << power_of_two
;
3090 BFD_ASSERT (alignment
!= 0 && (alignment
& -alignment
) == alignment
);
3091 section
->size
+= alignment
- 1;
3092 section
->size
&= -alignment
;
3094 /* Adjust the section's overall alignment if necessary. */
3095 if (power_of_two
> section
->alignment_power
)
3096 section
->alignment_power
= power_of_two
;
3098 /* Change the symbol from common to defined. */
3099 h
->type
= bfd_link_hash_defined
;
3100 h
->u
.def
.section
= section
;
3101 h
->u
.def
.value
= section
->size
;
3103 /* Increase the size of the section. */
3104 section
->size
+= size
;
3106 /* Make sure the section is allocated in memory, and make sure that
3107 it is no longer a common section. */
3108 section
->flags
|= SEC_ALLOC
;
3109 section
->flags
&= ~SEC_IS_COMMON
;
3115 _bfd_generic_link_hide_symbol
3118 void _bfd_generic_link_hide_symbol
3119 (bfd *output_bfd, struct bfd_link_info *info,
3120 struct bfd_link_hash_entry *h);
3123 Hide symbol @var{h}.
3124 This is an internal function. It should not be called from
3125 outside the BFD library.
3127 .#define bfd_link_hide_symbol(output_bfd, info, h) \
3128 . BFD_SEND (output_bfd, _bfd_link_hide_symbol, (output_bfd, info, h))
3133 _bfd_generic_link_hide_symbol (bfd
*output_bfd ATTRIBUTE_UNUSED
,
3134 struct bfd_link_info
*info ATTRIBUTE_UNUSED
,
3135 struct bfd_link_hash_entry
*h ATTRIBUTE_UNUSED
)
3141 bfd_generic_define_start_stop
3144 struct bfd_link_hash_entry *bfd_generic_define_start_stop
3145 (struct bfd_link_info *info,
3146 const char *symbol, asection *sec);
3149 Define a __start, __stop, .startof. or .sizeof. symbol.
3150 Return the symbol or NULL if no such undefined symbol exists.
3152 .#define bfd_define_start_stop(output_bfd, info, symbol, sec) \
3153 . BFD_SEND (output_bfd, _bfd_define_start_stop, (info, symbol, sec))
3157 struct bfd_link_hash_entry
*
3158 bfd_generic_define_start_stop (struct bfd_link_info
*info
,
3159 const char *symbol
, asection
*sec
)
3161 struct bfd_link_hash_entry
*h
;
3163 h
= bfd_link_hash_lookup (info
->hash
, symbol
, FALSE
, FALSE
, TRUE
);
3165 && (h
->type
== bfd_link_hash_undefined
3166 || h
->type
== bfd_link_hash_undefweak
))
3168 h
->type
= bfd_link_hash_defined
;
3169 h
->u
.def
.section
= sec
;
3178 bfd_find_version_for_sym
3181 struct bfd_elf_version_tree * bfd_find_version_for_sym
3182 (struct bfd_elf_version_tree *verdefs,
3183 const char *sym_name, bfd_boolean *hide);
3186 Search an elf version script tree for symbol versioning
3187 info and export / don't-export status for a given symbol.
3188 Return non-NULL on success and NULL on failure; also sets
3189 the output @samp{hide} boolean parameter.
3193 struct bfd_elf_version_tree
*
3194 bfd_find_version_for_sym (struct bfd_elf_version_tree
*verdefs
,
3195 const char *sym_name
,
3198 struct bfd_elf_version_tree
*t
;
3199 struct bfd_elf_version_tree
*local_ver
, *global_ver
, *exist_ver
;
3200 struct bfd_elf_version_tree
*star_local_ver
, *star_global_ver
;
3204 star_local_ver
= NULL
;
3205 star_global_ver
= NULL
;
3207 for (t
= verdefs
; t
!= NULL
; t
= t
->next
)
3209 if (t
->globals
.list
!= NULL
)
3211 struct bfd_elf_version_expr
*d
= NULL
;
3213 while ((d
= (*t
->match
) (&t
->globals
, d
, sym_name
)) != NULL
)
3215 if (d
->literal
|| strcmp (d
->pattern
, "*") != 0)
3218 star_global_ver
= t
;
3222 /* If the match is a wildcard pattern, keep looking for
3223 a more explicit, perhaps even local, match. */
3232 if (t
->locals
.list
!= NULL
)
3234 struct bfd_elf_version_expr
*d
= NULL
;
3236 while ((d
= (*t
->match
) (&t
->locals
, d
, sym_name
)) != NULL
)
3238 if (d
->literal
|| strcmp (d
->pattern
, "*") != 0)
3242 /* If the match is a wildcard pattern, keep looking for
3243 a more explicit, perhaps even global, match. */
3246 /* An exact match overrides a global wildcard. */
3248 star_global_ver
= NULL
;
3258 if (global_ver
== NULL
&& local_ver
== NULL
)
3259 global_ver
= star_global_ver
;
3261 if (global_ver
!= NULL
)
3263 /* If we already have a versioned symbol that matches the
3264 node for this symbol, then we don't want to create a
3265 duplicate from the unversioned symbol. Instead hide the
3266 unversioned symbol. */
3267 *hide
= exist_ver
== global_ver
;
3271 if (local_ver
== NULL
)
3272 local_ver
= star_local_ver
;
3274 if (local_ver
!= NULL
)
3285 bfd_hide_sym_by_version
3288 bfd_boolean bfd_hide_sym_by_version
3289 (struct bfd_elf_version_tree *verdefs, const char *sym_name);
3292 Search an elf version script tree for symbol versioning
3293 info for a given symbol. Return TRUE if the symbol is hidden.
3298 bfd_hide_sym_by_version (struct bfd_elf_version_tree
*verdefs
,
3299 const char *sym_name
)
3301 bfd_boolean hidden
= FALSE
;
3302 bfd_find_version_for_sym (verdefs
, sym_name
, &hidden
);
3308 bfd_link_check_relocs
3311 bfd_boolean bfd_link_check_relocs
3312 (bfd *abfd, struct bfd_link_info *info);
3315 Checks the relocs in ABFD for validity.
3316 Does not execute the relocs.
3317 Return TRUE if everything is OK, FALSE otherwise.
3318 This is the external entry point to this code.
3322 bfd_link_check_relocs (bfd
*abfd
, struct bfd_link_info
*info
)
3324 return BFD_SEND (abfd
, _bfd_link_check_relocs
, (abfd
, info
));
3329 _bfd_generic_link_check_relocs
3332 bfd_boolean _bfd_generic_link_check_relocs
3333 (bfd *abfd, struct bfd_link_info *info);
3336 Stub function for targets that do not implement reloc checking.
3338 This is an internal function. It should not be called from
3339 outside the BFD library.
3343 _bfd_generic_link_check_relocs (bfd
*abfd ATTRIBUTE_UNUSED
,
3344 struct bfd_link_info
*info ATTRIBUTE_UNUSED
)
3351 bfd_merge_private_bfd_data
3354 bfd_boolean bfd_merge_private_bfd_data
3355 (bfd *ibfd, struct bfd_link_info *info);
3358 Merge private BFD information from the BFD @var{ibfd} to the
3359 the output file BFD when linking. Return <<TRUE>> on success,
3360 <<FALSE>> on error. Possible error returns are:
3362 o <<bfd_error_no_memory>> -
3363 Not enough memory exists to create private data for @var{obfd}.
3365 .#define bfd_merge_private_bfd_data(ibfd, info) \
3366 . BFD_SEND ((info)->output_bfd, _bfd_merge_private_bfd_data, \
3372 _bfd_generic_verify_endian_match
3375 bfd_boolean _bfd_generic_verify_endian_match
3376 (bfd *ibfd, struct bfd_link_info *info);
3379 Can be used from / for bfd_merge_private_bfd_data to check that
3380 endianness matches between input and output file. Returns
3381 TRUE for a match, otherwise returns FALSE and emits an error.
3385 _bfd_generic_verify_endian_match (bfd
*ibfd
, struct bfd_link_info
*info
)
3387 bfd
*obfd
= info
->output_bfd
;
3389 if (ibfd
->xvec
->byteorder
!= obfd
->xvec
->byteorder
3390 && ibfd
->xvec
->byteorder
!= BFD_ENDIAN_UNKNOWN
3391 && obfd
->xvec
->byteorder
!= BFD_ENDIAN_UNKNOWN
)
3393 if (bfd_big_endian (ibfd
))
3394 _bfd_error_handler (_("%pB: compiled for a big endian system "
3395 "and target is little endian"), ibfd
);
3397 _bfd_error_handler (_("%pB: compiled for a little endian system "
3398 "and target is big endian"), ibfd
);
3399 bfd_set_error (bfd_error_wrong_format
);
3407 _bfd_nolink_sizeof_headers (bfd
*abfd ATTRIBUTE_UNUSED
,
3408 struct bfd_link_info
*info ATTRIBUTE_UNUSED
)
3414 _bfd_nolink_bfd_relax_section (bfd
*abfd
,
3415 asection
*section ATTRIBUTE_UNUSED
,
3416 struct bfd_link_info
*link_info ATTRIBUTE_UNUSED
,
3417 bfd_boolean
*again ATTRIBUTE_UNUSED
)
3419 return _bfd_bool_bfd_false_error (abfd
);
3423 _bfd_nolink_bfd_get_relocated_section_contents
3425 struct bfd_link_info
*link_info ATTRIBUTE_UNUSED
,
3426 struct bfd_link_order
*link_order ATTRIBUTE_UNUSED
,
3427 bfd_byte
*data ATTRIBUTE_UNUSED
,
3428 bfd_boolean relocatable ATTRIBUTE_UNUSED
,
3429 asymbol
**symbols ATTRIBUTE_UNUSED
)
3431 return (bfd_byte
*) _bfd_ptr_bfd_null_error (abfd
);
3435 _bfd_nolink_bfd_lookup_section_flags
3436 (struct bfd_link_info
*info ATTRIBUTE_UNUSED
,
3437 struct flag_info
*flaginfo ATTRIBUTE_UNUSED
,
3440 return _bfd_bool_bfd_false_error (section
->owner
);
3444 _bfd_nolink_bfd_is_group_section (bfd
*abfd
,
3445 const asection
*sec ATTRIBUTE_UNUSED
)
3447 return _bfd_bool_bfd_false_error (abfd
);
3451 _bfd_nolink_bfd_discard_group (bfd
*abfd
, asection
*sec ATTRIBUTE_UNUSED
)
3453 return _bfd_bool_bfd_false_error (abfd
);
3456 struct bfd_link_hash_table
*
3457 _bfd_nolink_bfd_link_hash_table_create (bfd
*abfd
)
3459 return (struct bfd_link_hash_table
*) _bfd_ptr_bfd_null_error (abfd
);
3463 _bfd_nolink_bfd_link_just_syms (asection
*sec ATTRIBUTE_UNUSED
,
3464 struct bfd_link_info
*info ATTRIBUTE_UNUSED
)
3469 _bfd_nolink_bfd_copy_link_hash_symbol_type
3470 (bfd
*abfd ATTRIBUTE_UNUSED
,
3471 struct bfd_link_hash_entry
*from ATTRIBUTE_UNUSED
,
3472 struct bfd_link_hash_entry
*to ATTRIBUTE_UNUSED
)
3477 _bfd_nolink_bfd_link_split_section (bfd
*abfd
, asection
*sec ATTRIBUTE_UNUSED
)
3479 return _bfd_bool_bfd_false_error (abfd
);
3483 _bfd_nolink_section_already_linked (bfd
*abfd
,
3484 asection
*sec ATTRIBUTE_UNUSED
,
3485 struct bfd_link_info
*info ATTRIBUTE_UNUSED
)
3487 return _bfd_bool_bfd_false_error (abfd
);
3491 _bfd_nolink_bfd_define_common_symbol
3493 struct bfd_link_info
*info ATTRIBUTE_UNUSED
,
3494 struct bfd_link_hash_entry
*h ATTRIBUTE_UNUSED
)
3496 return _bfd_bool_bfd_false_error (abfd
);
3499 struct bfd_link_hash_entry
*
3500 _bfd_nolink_bfd_define_start_stop (struct bfd_link_info
*info ATTRIBUTE_UNUSED
,
3501 const char *name ATTRIBUTE_UNUSED
,
3504 return (struct bfd_link_hash_entry
*) _bfd_ptr_bfd_null_error (sec
->owner
);