1 /* linker.c -- BFD linker routines
2 Copyright 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001
3 Free Software Foundation, Inc.
4 Written by Steve Chamberlain and Ian Lance Taylor, Cygnus Support
6 This file is part of BFD, the Binary File Descriptor library.
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software
20 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
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 relocateable
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 <<creator>>
153 field of the hash table must be checked to make sure that the
154 hash table was 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 <<creator>> field 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.
226 @findex _bfd_generic_link_add_archive_symbols
227 In most cases the work of looking through the symbols in the
228 archive should be done by the
229 <<_bfd_generic_link_add_archive_symbols>> function. This
230 function builds a hash table from the archive symbol table and
231 looks through the list of undefined symbols to see which
232 elements should be included.
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.
238 The function passed to
239 <<_bfd_generic_link_add_archive_symbols>> must read the
240 symbols of the archive element and decide whether the archive
241 element should be included in the link. If the element is to
242 be included, the <<add_archive_element>> linker callback
243 routine must be called with the element as an argument, and
244 the elements symbols must be added to the linker hash table
245 just as though the element had itself been passed to the
246 <<_bfd_link_add_symbols>> function.
248 When the a.out <<_bfd_link_add_symbols>> function receives an
249 archive, it calls <<_bfd_generic_link_add_archive_symbols>>
250 passing <<aout_link_check_archive_element>> as the function
251 argument. <<aout_link_check_archive_element>> calls
252 <<aout_link_check_ar_symbols>>. If the latter decides to add
253 the element (an element is only added if it provides a real,
254 non-common, definition for a previously undefined or common
255 symbol) it calls the <<add_archive_element>> callback and then
256 <<aout_link_check_archive_element>> calls
257 <<aout_link_add_symbols>> to actually add the symbols to the
260 The ECOFF back end is unusual in that it does not normally
261 call <<_bfd_generic_link_add_archive_symbols>>, because ECOFF
262 archives already contain a hash table of symbols. The ECOFF
263 back end searches the archive itself to avoid the overhead of
264 creating a new hash table.
267 Performing the Final Link, , Adding Symbols to the Hash Table, Linker Functions
269 Performing the final link
271 @cindex _bfd_link_final_link in target vector
272 @cindex target vector (_bfd_final_link)
273 When all the input files have been processed, the linker calls
274 the <<_bfd_final_link>> entry point of the output BFD. This
275 routine is responsible for producing the final output file,
276 which has several aspects. It must relocate the contents of
277 the input sections and copy the data into the output sections.
278 It must build an output symbol table including any local
279 symbols from the input files and the global symbols from the
280 hash table. When producing relocateable output, it must
281 modify the input relocs and write them into the output file.
282 There may also be object format dependent work to be done.
284 The linker will also call the <<write_object_contents>> entry
285 point when the BFD is closed. The two entry points must work
286 together in order to produce the correct output file.
288 The details of how this works are inevitably dependent upon
289 the specific object file format. The a.out
290 <<_bfd_final_link>> routine is <<NAME(aout,final_link)>>.
293 @* Information provided by the linker::
294 @* Relocating the section contents::
295 @* Writing the symbol table::
299 Information provided by the linker, Relocating the section contents, Performing the Final Link, Performing the Final Link
301 Information provided by the linker
303 Before the linker calls the <<_bfd_final_link>> entry point,
304 it sets up some data structures for the function to use.
306 The <<input_bfds>> field of the <<bfd_link_info>> structure
307 will point to a list of all the input files included in the
308 link. These files are linked through the <<link_next>> field
309 of the <<bfd>> structure.
311 Each section in the output file will have a list of
312 <<link_order>> structures attached to the <<link_order_head>>
313 field (the <<link_order>> structure is defined in
314 <<bfdlink.h>>). These structures describe how to create the
315 contents of the output section in terms of the contents of
316 various input sections, fill constants, and, eventually, other
317 types of information. They also describe relocs that must be
318 created by the BFD backend, but do not correspond to any input
319 file; this is used to support -Ur, which builds constructors
320 while generating a relocateable object file.
323 Relocating the section contents, Writing the symbol table, Information provided by the linker, Performing the Final Link
325 Relocating the section contents
327 The <<_bfd_final_link>> function should look through the
328 <<link_order>> structures attached to each section of the
329 output file. Each <<link_order>> structure should either be
330 handled specially, or it should be passed to the function
331 <<_bfd_default_link_order>> which will do the right thing
332 (<<_bfd_default_link_order>> is defined in <<linker.c>>).
334 For efficiency, a <<link_order>> of type
335 <<bfd_indirect_link_order>> whose associated section belongs
336 to a BFD of the same format as the output BFD must be handled
337 specially. This type of <<link_order>> describes part of an
338 output section in terms of a section belonging to one of the
339 input files. The <<_bfd_final_link>> function should read the
340 contents of the section and any associated relocs, apply the
341 relocs to the section contents, and write out the modified
342 section contents. If performing a relocateable link, the
343 relocs themselves must also be modified and written out.
345 @findex _bfd_relocate_contents
346 @findex _bfd_final_link_relocate
347 The functions <<_bfd_relocate_contents>> and
348 <<_bfd_final_link_relocate>> provide some general support for
349 performing the actual relocations, notably overflow checking.
350 Their arguments include information about the symbol the
351 relocation is against and a <<reloc_howto_type>> argument
352 which describes the relocation to perform. These functions
353 are defined in <<reloc.c>>.
355 The a.out function which handles reading, relocating, and
356 writing section contents is <<aout_link_input_section>>. The
357 actual relocation is done in <<aout_link_input_section_std>>
358 and <<aout_link_input_section_ext>>.
361 Writing the symbol table, , Relocating the section contents, Performing the Final Link
363 Writing the symbol table
365 The <<_bfd_final_link>> function must gather all the symbols
366 in the input files and write them out. It must also write out
367 all the symbols in the global hash table. This must be
368 controlled by the <<strip>> and <<discard>> fields of the
369 <<bfd_link_info>> structure.
371 The local symbols of the input files will not have been
372 entered into the linker hash table. The <<_bfd_final_link>>
373 routine must consider each input file and include the symbols
374 in the output file. It may be convenient to do this when
375 looking through the <<link_order>> structures, or it may be
376 done by stepping through the <<input_bfds>> list.
378 The <<_bfd_final_link>> routine must also traverse the global
379 hash table to gather all the externally visible symbols. It
380 is possible that most of the externally visible symbols may be
381 written out when considering the symbols of each input file,
382 but it is still necessary to traverse the hash table since the
383 linker script may have defined some symbols that are not in
384 any of the input files.
386 The <<strip>> field of the <<bfd_link_info>> structure
387 controls which symbols are written out. The possible values
388 are listed in <<bfdlink.h>>. If the value is <<strip_some>>,
389 then the <<keep_hash>> field of the <<bfd_link_info>>
390 structure is a hash table of symbols to keep; each symbol
391 should be looked up in this hash table, and only symbols which
392 are present should be included in the output file.
394 If the <<strip>> field of the <<bfd_link_info>> structure
395 permits local symbols to be written out, the <<discard>> field
396 is used to further controls which local symbols are included
397 in the output file. If the value is <<discard_l>>, then all
398 local symbols which begin with a certain prefix are discarded;
399 this is controlled by the <<bfd_is_local_label_name>> entry point.
401 The a.out backend handles symbols by calling
402 <<aout_link_write_symbols>> on each input BFD and then
403 traversing the global hash table with the function
404 <<aout_link_write_other_symbol>>. It builds a string table
405 while writing out the symbols, which is written to the output
406 file at the end of <<NAME(aout,final_link)>>.
409 static boolean generic_link_read_symbols
411 static boolean generic_link_add_symbols
412 PARAMS ((bfd
*, struct bfd_link_info
*, boolean collect
));
413 static boolean generic_link_add_object_symbols
414 PARAMS ((bfd
*, struct bfd_link_info
*, boolean collect
));
415 static boolean generic_link_check_archive_element_no_collect
416 PARAMS ((bfd
*, struct bfd_link_info
*, boolean
*pneeded
));
417 static boolean generic_link_check_archive_element_collect
418 PARAMS ((bfd
*, struct bfd_link_info
*, boolean
*pneeded
));
419 static boolean generic_link_check_archive_element
420 PARAMS ((bfd
*, struct bfd_link_info
*, boolean
*pneeded
, boolean collect
));
421 static boolean generic_link_add_symbol_list
422 PARAMS ((bfd
*, struct bfd_link_info
*, bfd_size_type count
, asymbol
**,
424 static bfd
*hash_entry_bfd
PARAMS ((struct bfd_link_hash_entry
*));
425 static void set_symbol_from_hash
426 PARAMS ((asymbol
*, struct bfd_link_hash_entry
*));
427 static boolean generic_add_output_symbol
428 PARAMS ((bfd
*, size_t *psymalloc
, asymbol
*));
429 static boolean default_fill_link_order
430 PARAMS ((bfd
*, struct bfd_link_info
*, asection
*,
431 struct bfd_link_order
*));
432 static boolean default_indirect_link_order
433 PARAMS ((bfd
*, struct bfd_link_info
*, asection
*,
434 struct bfd_link_order
*, boolean
));
436 /* The link hash table structure is defined in bfdlink.h. It provides
437 a base hash table which the backend specific hash tables are built
440 /* Routine to create an entry in the link hash table. */
442 struct bfd_hash_entry
*
443 _bfd_link_hash_newfunc (entry
, table
, string
)
444 struct bfd_hash_entry
*entry
;
445 struct bfd_hash_table
*table
;
448 struct bfd_link_hash_entry
*ret
= (struct bfd_link_hash_entry
*) entry
;
450 /* Allocate the structure if it has not already been allocated by a
452 if (ret
== (struct bfd_link_hash_entry
*) NULL
)
453 ret
= ((struct bfd_link_hash_entry
*)
454 bfd_hash_allocate (table
, sizeof (struct bfd_link_hash_entry
)));
455 if (ret
== (struct bfd_link_hash_entry
*) NULL
)
458 /* Call the allocation method of the superclass. */
459 ret
= ((struct bfd_link_hash_entry
*)
460 bfd_hash_newfunc ((struct bfd_hash_entry
*) ret
, table
, string
));
464 /* Initialize the local fields. */
465 ret
->type
= bfd_link_hash_new
;
469 return (struct bfd_hash_entry
*) ret
;
472 /* Initialize a link hash table. The BFD argument is the one
473 responsible for creating this table. */
476 _bfd_link_hash_table_init (table
, abfd
, newfunc
)
477 struct bfd_link_hash_table
*table
;
479 struct bfd_hash_entry
*(*newfunc
) PARAMS ((struct bfd_hash_entry
*,
480 struct bfd_hash_table
*,
483 table
->creator
= abfd
->xvec
;
484 table
->undefs
= NULL
;
485 table
->undefs_tail
= NULL
;
486 return bfd_hash_table_init (&table
->table
, newfunc
);
489 /* Look up a symbol in a link hash table. If follow is true, we
490 follow bfd_link_hash_indirect and bfd_link_hash_warning links to
493 struct bfd_link_hash_entry
*
494 bfd_link_hash_lookup (table
, string
, create
, copy
, follow
)
495 struct bfd_link_hash_table
*table
;
501 struct bfd_link_hash_entry
*ret
;
503 ret
= ((struct bfd_link_hash_entry
*)
504 bfd_hash_lookup (&table
->table
, string
, create
, copy
));
506 if (follow
&& ret
!= (struct bfd_link_hash_entry
*) NULL
)
508 while (ret
->type
== bfd_link_hash_indirect
509 || ret
->type
== bfd_link_hash_warning
)
516 /* Look up a symbol in the main linker hash table if the symbol might
517 be wrapped. This should only be used for references to an
518 undefined symbol, not for definitions of a symbol. */
520 struct bfd_link_hash_entry
*
521 bfd_wrapped_link_hash_lookup (abfd
, info
, string
, create
, copy
, follow
)
523 struct bfd_link_info
*info
;
529 if (info
->wrap_hash
!= NULL
)
534 if (*l
== bfd_get_symbol_leading_char (abfd
))
538 #define WRAP "__wrap_"
540 if (bfd_hash_lookup (info
->wrap_hash
, l
, false, false) != NULL
)
543 struct bfd_link_hash_entry
*h
;
545 /* This symbol is being wrapped. We want to replace all
546 references to SYM with references to __wrap_SYM. */
548 n
= (char *) bfd_malloc (strlen (l
) + sizeof WRAP
+ 1);
552 /* Note that symbol_leading_char may be '\0'. */
553 n
[0] = bfd_get_symbol_leading_char (abfd
);
557 h
= bfd_link_hash_lookup (info
->hash
, n
, create
, true, follow
);
565 #define REAL "__real_"
568 && strncmp (l
, REAL
, sizeof REAL
- 1) == 0
569 && bfd_hash_lookup (info
->wrap_hash
, l
+ sizeof REAL
- 1,
570 false, false) != NULL
)
573 struct bfd_link_hash_entry
*h
;
575 /* This is a reference to __real_SYM, where SYM is being
576 wrapped. We want to replace all references to __real_SYM
577 with references to SYM. */
579 n
= (char *) bfd_malloc (strlen (l
+ sizeof REAL
- 1) + 2);
583 /* Note that symbol_leading_char may be '\0'. */
584 n
[0] = bfd_get_symbol_leading_char (abfd
);
586 strcat (n
, l
+ sizeof REAL
- 1);
587 h
= bfd_link_hash_lookup (info
->hash
, n
, create
, true, follow
);
595 return bfd_link_hash_lookup (info
->hash
, string
, create
, copy
, follow
);
598 /* Traverse a generic link hash table. The only reason this is not a
599 macro is to do better type checking. This code presumes that an
600 argument passed as a struct bfd_hash_entry * may be caught as a
601 struct bfd_link_hash_entry * with no explicit cast required on the
605 bfd_link_hash_traverse (table
, func
, info
)
606 struct bfd_link_hash_table
*table
;
607 boolean (*func
) PARAMS ((struct bfd_link_hash_entry
*, PTR
));
610 bfd_hash_traverse (&table
->table
,
611 ((boolean (*) PARAMS ((struct bfd_hash_entry
*, PTR
)))
616 /* Add a symbol to the linker hash table undefs list. */
619 bfd_link_add_undef (table
, h
)
620 struct bfd_link_hash_table
*table
;
621 struct bfd_link_hash_entry
*h
;
623 BFD_ASSERT (h
->next
== NULL
);
624 if (table
->undefs_tail
!= (struct bfd_link_hash_entry
*) NULL
)
625 table
->undefs_tail
->next
= h
;
626 if (table
->undefs
== (struct bfd_link_hash_entry
*) NULL
)
628 table
->undefs_tail
= h
;
631 /* Routine to create an entry in an generic link hash table. */
633 struct bfd_hash_entry
*
634 _bfd_generic_link_hash_newfunc (entry
, table
, string
)
635 struct bfd_hash_entry
*entry
;
636 struct bfd_hash_table
*table
;
639 struct generic_link_hash_entry
*ret
=
640 (struct generic_link_hash_entry
*) entry
;
642 /* Allocate the structure if it has not already been allocated by a
644 if (ret
== (struct generic_link_hash_entry
*) NULL
)
645 ret
= ((struct generic_link_hash_entry
*)
646 bfd_hash_allocate (table
, sizeof (struct generic_link_hash_entry
)));
647 if (ret
== (struct generic_link_hash_entry
*) NULL
)
650 /* Call the allocation method of the superclass. */
651 ret
= ((struct generic_link_hash_entry
*)
652 _bfd_link_hash_newfunc ((struct bfd_hash_entry
*) ret
,
657 /* Set local fields. */
658 ret
->written
= false;
662 return (struct bfd_hash_entry
*) ret
;
665 /* Create an generic link hash table. */
667 struct bfd_link_hash_table
*
668 _bfd_generic_link_hash_table_create (abfd
)
671 struct generic_link_hash_table
*ret
;
673 ret
= ((struct generic_link_hash_table
*)
674 bfd_alloc (abfd
, sizeof (struct generic_link_hash_table
)));
676 return (struct bfd_link_hash_table
*) NULL
;
677 if (! _bfd_link_hash_table_init (&ret
->root
, abfd
,
678 _bfd_generic_link_hash_newfunc
))
681 return (struct bfd_link_hash_table
*) NULL
;
686 /* Grab the symbols for an object file when doing a generic link. We
687 store the symbols in the outsymbols field. We need to keep them
688 around for the entire link to ensure that we only read them once.
689 If we read them multiple times, we might wind up with relocs and
690 the hash table pointing to different instances of the symbol
694 generic_link_read_symbols (abfd
)
697 if (bfd_get_outsymbols (abfd
) == (asymbol
**) NULL
)
702 symsize
= bfd_get_symtab_upper_bound (abfd
);
705 bfd_get_outsymbols (abfd
) = (asymbol
**) bfd_alloc (abfd
, symsize
);
706 if (bfd_get_outsymbols (abfd
) == NULL
&& symsize
!= 0)
708 symcount
= bfd_canonicalize_symtab (abfd
, bfd_get_outsymbols (abfd
));
711 bfd_get_symcount (abfd
) = symcount
;
717 /* Generic function to add symbols to from an object file to the
718 global hash table. This version does not automatically collect
719 constructors by name. */
722 _bfd_generic_link_add_symbols (abfd
, info
)
724 struct bfd_link_info
*info
;
726 return generic_link_add_symbols (abfd
, info
, false);
729 /* Generic function to add symbols from an object file to the global
730 hash table. This version automatically collects constructors by
731 name, as the collect2 program does. It should be used for any
732 target which does not provide some other mechanism for setting up
733 constructors and destructors; these are approximately those targets
734 for which gcc uses collect2 and do not support stabs. */
737 _bfd_generic_link_add_symbols_collect (abfd
, info
)
739 struct bfd_link_info
*info
;
741 return generic_link_add_symbols (abfd
, info
, true);
744 /* Add symbols from an object file to the global hash table. */
747 generic_link_add_symbols (abfd
, info
, collect
)
749 struct bfd_link_info
*info
;
754 switch (bfd_get_format (abfd
))
757 ret
= generic_link_add_object_symbols (abfd
, info
, collect
);
760 ret
= (_bfd_generic_link_add_archive_symbols
763 ? generic_link_check_archive_element_collect
764 : generic_link_check_archive_element_no_collect
)));
767 bfd_set_error (bfd_error_wrong_format
);
774 /* Add symbols from an object file to the global hash table. */
777 generic_link_add_object_symbols (abfd
, info
, collect
)
779 struct bfd_link_info
*info
;
782 if (! generic_link_read_symbols (abfd
))
784 return generic_link_add_symbol_list (abfd
, info
,
785 _bfd_generic_link_get_symcount (abfd
),
786 _bfd_generic_link_get_symbols (abfd
),
790 /* We build a hash table of all symbols defined in an archive. */
792 /* An archive symbol may be defined by multiple archive elements.
793 This linked list is used to hold the elements. */
797 struct archive_list
*next
;
801 /* An entry in an archive hash table. */
803 struct archive_hash_entry
805 struct bfd_hash_entry root
;
806 /* Where the symbol is defined. */
807 struct archive_list
*defs
;
810 /* An archive hash table itself. */
812 struct archive_hash_table
814 struct bfd_hash_table table
;
817 static struct bfd_hash_entry
*archive_hash_newfunc
818 PARAMS ((struct bfd_hash_entry
*, struct bfd_hash_table
*, const char *));
819 static boolean archive_hash_table_init
820 PARAMS ((struct archive_hash_table
*,
821 struct bfd_hash_entry
*(*) (struct bfd_hash_entry
*,
822 struct bfd_hash_table
*,
825 /* Create a new entry for an archive hash table. */
827 static struct bfd_hash_entry
*
828 archive_hash_newfunc (entry
, table
, string
)
829 struct bfd_hash_entry
*entry
;
830 struct bfd_hash_table
*table
;
833 struct archive_hash_entry
*ret
= (struct archive_hash_entry
*) entry
;
835 /* Allocate the structure if it has not already been allocated by a
837 if (ret
== (struct archive_hash_entry
*) NULL
)
838 ret
= ((struct archive_hash_entry
*)
839 bfd_hash_allocate (table
, sizeof (struct archive_hash_entry
)));
840 if (ret
== (struct archive_hash_entry
*) NULL
)
843 /* Call the allocation method of the superclass. */
844 ret
= ((struct archive_hash_entry
*)
845 bfd_hash_newfunc ((struct bfd_hash_entry
*) ret
, table
, string
));
849 /* Initialize the local fields. */
850 ret
->defs
= (struct archive_list
*) NULL
;
853 return (struct bfd_hash_entry
*) ret
;
856 /* Initialize an archive hash table. */
859 archive_hash_table_init (table
, newfunc
)
860 struct archive_hash_table
*table
;
861 struct bfd_hash_entry
*(*newfunc
) PARAMS ((struct bfd_hash_entry
*,
862 struct bfd_hash_table
*,
865 return bfd_hash_table_init (&table
->table
, newfunc
);
868 /* Look up an entry in an archive hash table. */
870 #define archive_hash_lookup(t, string, create, copy) \
871 ((struct archive_hash_entry *) \
872 bfd_hash_lookup (&(t)->table, (string), (create), (copy)))
874 /* Allocate space in an archive hash table. */
876 #define archive_hash_allocate(t, size) bfd_hash_allocate (&(t)->table, (size))
878 /* Free an archive hash table. */
880 #define archive_hash_table_free(t) bfd_hash_table_free (&(t)->table)
882 /* Generic function to add symbols from an archive file to the global
883 hash file. This function presumes that the archive symbol table
884 has already been read in (this is normally done by the
885 bfd_check_format entry point). It looks through the undefined and
886 common symbols and searches the archive symbol table for them. If
887 it finds an entry, it includes the associated object file in the
890 The old linker looked through the archive symbol table for
891 undefined symbols. We do it the other way around, looking through
892 undefined symbols for symbols defined in the archive. The
893 advantage of the newer scheme is that we only have to look through
894 the list of undefined symbols once, whereas the old method had to
895 re-search the symbol table each time a new object file was added.
897 The CHECKFN argument is used to see if an object file should be
898 included. CHECKFN should set *PNEEDED to true if the object file
899 should be included, and must also call the bfd_link_info
900 add_archive_element callback function and handle adding the symbols
901 to the global hash table. CHECKFN should only return false if some
902 sort of error occurs.
904 For some formats, such as a.out, it is possible to look through an
905 object file but not actually include it in the link. The
906 archive_pass field in a BFD is used to avoid checking the symbols
907 of an object files too many times. When an object is included in
908 the link, archive_pass is set to -1. If an object is scanned but
909 not included, archive_pass is set to the pass number. The pass
910 number is incremented each time a new object file is included. The
911 pass number is used because when a new object file is included it
912 may create new undefined symbols which cause a previously examined
913 object file to be included. */
916 _bfd_generic_link_add_archive_symbols (abfd
, info
, checkfn
)
918 struct bfd_link_info
*info
;
919 boolean (*checkfn
) PARAMS ((bfd
*, struct bfd_link_info
*,
924 register carsym
*arsym
;
926 struct archive_hash_table arsym_hash
;
928 struct bfd_link_hash_entry
**pundef
;
930 if (! bfd_has_map (abfd
))
932 /* An empty archive is a special case. */
933 if (bfd_openr_next_archived_file (abfd
, (bfd
*) NULL
) == NULL
)
935 bfd_set_error (bfd_error_no_armap
);
939 arsyms
= bfd_ardata (abfd
)->symdefs
;
940 arsym_end
= arsyms
+ bfd_ardata (abfd
)->symdef_count
;
942 /* In order to quickly determine whether an symbol is defined in
943 this archive, we build a hash table of the symbols. */
944 if (! archive_hash_table_init (&arsym_hash
, archive_hash_newfunc
))
946 for (arsym
= arsyms
, indx
= 0; arsym
< arsym_end
; arsym
++, indx
++)
948 struct archive_hash_entry
*arh
;
949 struct archive_list
*l
, **pp
;
951 arh
= archive_hash_lookup (&arsym_hash
, arsym
->name
, true, false);
952 if (arh
== (struct archive_hash_entry
*) NULL
)
954 l
= ((struct archive_list
*)
955 archive_hash_allocate (&arsym_hash
, sizeof (struct archive_list
)));
959 for (pp
= &arh
->defs
;
960 *pp
!= (struct archive_list
*) NULL
;
967 /* The archive_pass field in the archive itself is used to
968 initialize PASS, sine we may search the same archive multiple
970 pass
= abfd
->archive_pass
+ 1;
972 /* New undefined symbols are added to the end of the list, so we
973 only need to look through it once. */
974 pundef
= &info
->hash
->undefs
;
975 while (*pundef
!= (struct bfd_link_hash_entry
*) NULL
)
977 struct bfd_link_hash_entry
*h
;
978 struct archive_hash_entry
*arh
;
979 struct archive_list
*l
;
983 /* When a symbol is defined, it is not necessarily removed from
985 if (h
->type
!= bfd_link_hash_undefined
986 && h
->type
!= bfd_link_hash_common
)
988 /* Remove this entry from the list, for general cleanliness
989 and because we are going to look through the list again
990 if we search any more libraries. We can't remove the
991 entry if it is the tail, because that would lose any
992 entries we add to the list later on (it would also cause
993 us to lose track of whether the symbol has been
995 if (*pundef
!= info
->hash
->undefs_tail
)
996 *pundef
= (*pundef
)->next
;
998 pundef
= &(*pundef
)->next
;
1002 /* Look for this symbol in the archive symbol map. */
1003 arh
= archive_hash_lookup (&arsym_hash
, h
->root
.string
, false, false);
1004 if (arh
== (struct archive_hash_entry
*) NULL
)
1006 /* If we haven't found the exact symbol we're looking for,
1007 let's look for its import thunk */
1008 if (info
->pei386_auto_import
)
1010 char *buf
= (char *) bfd_malloc (strlen (h
->root
.string
) + 10);
1014 sprintf (buf
, "__imp_%s", h
->root
.string
);
1015 arh
= archive_hash_lookup (&arsym_hash
, buf
, false, false);
1018 if (arh
== (struct archive_hash_entry
*) NULL
)
1020 pundef
= &(*pundef
)->next
;
1024 /* Look at all the objects which define this symbol. */
1025 for (l
= arh
->defs
; l
!= (struct archive_list
*) NULL
; l
= l
->next
)
1030 /* If the symbol has gotten defined along the way, quit. */
1031 if (h
->type
!= bfd_link_hash_undefined
1032 && h
->type
!= bfd_link_hash_common
)
1035 element
= bfd_get_elt_at_index (abfd
, l
->indx
);
1036 if (element
== (bfd
*) NULL
)
1039 /* If we've already included this element, or if we've
1040 already checked it on this pass, continue. */
1041 if (element
->archive_pass
== -1
1042 || element
->archive_pass
== pass
)
1045 /* If we can't figure this element out, just ignore it. */
1046 if (! bfd_check_format (element
, bfd_object
))
1048 element
->archive_pass
= -1;
1052 /* CHECKFN will see if this element should be included, and
1053 go ahead and include it if appropriate. */
1054 if (! (*checkfn
) (element
, info
, &needed
))
1058 element
->archive_pass
= pass
;
1061 element
->archive_pass
= -1;
1063 /* Increment the pass count to show that we may need to
1064 recheck object files which were already checked. */
1069 pundef
= &(*pundef
)->next
;
1072 archive_hash_table_free (&arsym_hash
);
1074 /* Save PASS in case we are called again. */
1075 abfd
->archive_pass
= pass
;
1080 archive_hash_table_free (&arsym_hash
);
1084 /* See if we should include an archive element. This version is used
1085 when we do not want to automatically collect constructors based on
1086 the symbol name, presumably because we have some other mechanism
1087 for finding them. */
1090 generic_link_check_archive_element_no_collect (abfd
, info
, pneeded
)
1092 struct bfd_link_info
*info
;
1095 return generic_link_check_archive_element (abfd
, info
, pneeded
, false);
1098 /* See if we should include an archive element. This version is used
1099 when we want to automatically collect constructors based on the
1100 symbol name, as collect2 does. */
1103 generic_link_check_archive_element_collect (abfd
, info
, pneeded
)
1105 struct bfd_link_info
*info
;
1108 return generic_link_check_archive_element (abfd
, info
, pneeded
, true);
1111 /* See if we should include an archive element. Optionally collect
1115 generic_link_check_archive_element (abfd
, info
, pneeded
, collect
)
1117 struct bfd_link_info
*info
;
1121 asymbol
**pp
, **ppend
;
1125 if (! generic_link_read_symbols (abfd
))
1128 pp
= _bfd_generic_link_get_symbols (abfd
);
1129 ppend
= pp
+ _bfd_generic_link_get_symcount (abfd
);
1130 for (; pp
< ppend
; pp
++)
1133 struct bfd_link_hash_entry
*h
;
1137 /* We are only interested in globally visible symbols. */
1138 if (! bfd_is_com_section (p
->section
)
1139 && (p
->flags
& (BSF_GLOBAL
| BSF_INDIRECT
| BSF_WEAK
)) == 0)
1142 /* We are only interested if we know something about this
1143 symbol, and it is undefined or common. An undefined weak
1144 symbol (type bfd_link_hash_undefweak) is not considered to be
1145 a reference when pulling files out of an archive. See the
1146 SVR4 ABI, p. 4-27. */
1147 h
= bfd_link_hash_lookup (info
->hash
, bfd_asymbol_name (p
), false,
1149 if (h
== (struct bfd_link_hash_entry
*) NULL
1150 || (h
->type
!= bfd_link_hash_undefined
1151 && h
->type
!= bfd_link_hash_common
))
1154 /* P is a symbol we are looking for. */
1156 if (! bfd_is_com_section (p
->section
))
1158 bfd_size_type symcount
;
1161 /* This object file defines this symbol, so pull it in. */
1162 if (! (*info
->callbacks
->add_archive_element
) (info
, abfd
,
1163 bfd_asymbol_name (p
)))
1165 symcount
= _bfd_generic_link_get_symcount (abfd
);
1166 symbols
= _bfd_generic_link_get_symbols (abfd
);
1167 if (! generic_link_add_symbol_list (abfd
, info
, symcount
,
1174 /* P is a common symbol. */
1176 if (h
->type
== bfd_link_hash_undefined
)
1182 symbfd
= h
->u
.undef
.abfd
;
1183 if (symbfd
== (bfd
*) NULL
)
1185 /* This symbol was created as undefined from outside
1186 BFD. We assume that we should link in the object
1187 file. This is for the -u option in the linker. */
1188 if (! (*info
->callbacks
->add_archive_element
)
1189 (info
, abfd
, bfd_asymbol_name (p
)))
1195 /* Turn the symbol into a common symbol but do not link in
1196 the object file. This is how a.out works. Object
1197 formats that require different semantics must implement
1198 this function differently. This symbol is already on the
1199 undefs list. We add the section to a common section
1200 attached to symbfd to ensure that it is in a BFD which
1201 will be linked in. */
1202 h
->type
= bfd_link_hash_common
;
1204 ((struct bfd_link_hash_common_entry
*)
1205 bfd_hash_allocate (&info
->hash
->table
,
1206 sizeof (struct bfd_link_hash_common_entry
)));
1207 if (h
->u
.c
.p
== NULL
)
1210 size
= bfd_asymbol_value (p
);
1213 power
= bfd_log2 (size
);
1216 h
->u
.c
.p
->alignment_power
= power
;
1218 if (p
->section
== bfd_com_section_ptr
)
1219 h
->u
.c
.p
->section
= bfd_make_section_old_way (symbfd
, "COMMON");
1221 h
->u
.c
.p
->section
= bfd_make_section_old_way (symbfd
,
1223 h
->u
.c
.p
->section
->flags
= SEC_ALLOC
;
1227 /* Adjust the size of the common symbol if necessary. This
1228 is how a.out works. Object formats that require
1229 different semantics must implement this function
1231 if (bfd_asymbol_value (p
) > h
->u
.c
.size
)
1232 h
->u
.c
.size
= bfd_asymbol_value (p
);
1236 /* This archive element is not needed. */
1240 /* Add the symbols from an object file to the global hash table. ABFD
1241 is the object file. INFO is the linker information. SYMBOL_COUNT
1242 is the number of symbols. SYMBOLS is the list of symbols. COLLECT
1243 is true if constructors should be automatically collected by name
1244 as is done by collect2. */
1247 generic_link_add_symbol_list (abfd
, info
, symbol_count
, symbols
, collect
)
1249 struct bfd_link_info
*info
;
1250 bfd_size_type symbol_count
;
1254 asymbol
**pp
, **ppend
;
1257 ppend
= symbols
+ symbol_count
;
1258 for (; pp
< ppend
; pp
++)
1264 if ((p
->flags
& (BSF_INDIRECT
1269 || bfd_is_und_section (bfd_get_section (p
))
1270 || bfd_is_com_section (bfd_get_section (p
))
1271 || bfd_is_ind_section (bfd_get_section (p
)))
1275 struct generic_link_hash_entry
*h
;
1277 name
= bfd_asymbol_name (p
);
1278 if (((p
->flags
& BSF_INDIRECT
) != 0
1279 || bfd_is_ind_section (p
->section
))
1283 string
= bfd_asymbol_name (*pp
);
1285 else if ((p
->flags
& BSF_WARNING
) != 0
1288 /* The name of P is actually the warning string, and the
1289 next symbol is the one to warn about. */
1292 name
= bfd_asymbol_name (*pp
);
1298 if (! (_bfd_generic_link_add_one_symbol
1299 (info
, abfd
, name
, p
->flags
, bfd_get_section (p
),
1300 p
->value
, string
, false, collect
,
1301 (struct bfd_link_hash_entry
**) &h
)))
1304 /* If this is a constructor symbol, and the linker didn't do
1305 anything with it, then we want to just pass the symbol
1306 through to the output file. This will happen when
1308 if ((p
->flags
& BSF_CONSTRUCTOR
) != 0
1309 && (h
== NULL
|| h
->root
.type
== bfd_link_hash_new
))
1315 /* Save the BFD symbol so that we don't lose any backend
1316 specific information that may be attached to it. We only
1317 want this one if it gives more information than the
1318 existing one; we don't want to replace a defined symbol
1319 with an undefined one. This routine may be called with a
1320 hash table other than the generic hash table, so we only
1321 do this if we are certain that the hash table is a
1323 if (info
->hash
->creator
== abfd
->xvec
)
1325 if (h
->sym
== (asymbol
*) NULL
1326 || (! bfd_is_und_section (bfd_get_section (p
))
1327 && (! bfd_is_com_section (bfd_get_section (p
))
1328 || bfd_is_und_section (bfd_get_section (h
->sym
)))))
1331 /* BSF_OLD_COMMON is a hack to support COFF reloc
1332 reading, and it should go away when the COFF
1333 linker is switched to the new version. */
1334 if (bfd_is_com_section (bfd_get_section (p
)))
1335 p
->flags
|= BSF_OLD_COMMON
;
1339 /* Store a back pointer from the symbol to the hash
1340 table entry for the benefit of relaxation code until
1341 it gets rewritten to not use asymbol structures.
1342 Setting this is also used to check whether these
1343 symbols were set up by the generic linker. */
1344 p
->udata
.p
= (PTR
) h
;
1351 /* We use a state table to deal with adding symbols from an object
1352 file. The first index into the state table describes the symbol
1353 from the object file. The second index into the state table is the
1354 type of the symbol in the hash table. */
1356 /* The symbol from the object file is turned into one of these row
1361 UNDEF_ROW
, /* Undefined. */
1362 UNDEFW_ROW
, /* Weak undefined. */
1363 DEF_ROW
, /* Defined. */
1364 DEFW_ROW
, /* Weak defined. */
1365 COMMON_ROW
, /* Common. */
1366 INDR_ROW
, /* Indirect. */
1367 WARN_ROW
, /* Warning. */
1368 SET_ROW
/* Member of set. */
1371 /* apparently needed for Hitachi 3050R(HI-UX/WE2)? */
1374 /* The actions to take in the state table. */
1379 UND
, /* Mark symbol undefined. */
1380 WEAK
, /* Mark symbol weak undefined. */
1381 DEF
, /* Mark symbol defined. */
1382 DEFW
, /* Mark symbol weak defined. */
1383 COM
, /* Mark symbol common. */
1384 REF
, /* Mark defined symbol referenced. */
1385 CREF
, /* Possibly warn about common reference to defined symbol. */
1386 CDEF
, /* Define existing common symbol. */
1387 NOACT
, /* No action. */
1388 BIG
, /* Mark symbol common using largest size. */
1389 MDEF
, /* Multiple definition error. */
1390 MIND
, /* Multiple indirect symbols. */
1391 IND
, /* Make indirect symbol. */
1392 CIND
, /* Make indirect symbol from existing common symbol. */
1393 SET
, /* Add value to set. */
1394 MWARN
, /* Make warning symbol. */
1395 WARN
, /* Issue warning. */
1396 CWARN
, /* Warn if referenced, else MWARN. */
1397 CYCLE
, /* Repeat with symbol pointed to. */
1398 REFC
, /* Mark indirect symbol referenced and then CYCLE. */
1399 WARNC
/* Issue warning and then CYCLE. */
1402 /* The state table itself. The first index is a link_row and the
1403 second index is a bfd_link_hash_type. */
1405 static const enum link_action link_action
[8][8] =
1407 /* current\prev new undef undefw def defw com indr warn */
1408 /* UNDEF_ROW */ {UND
, NOACT
, UND
, REF
, REF
, NOACT
, REFC
, WARNC
},
1409 /* UNDEFW_ROW */ {WEAK
, NOACT
, NOACT
, REF
, REF
, NOACT
, REFC
, WARNC
},
1410 /* DEF_ROW */ {DEF
, DEF
, DEF
, MDEF
, DEF
, CDEF
, MDEF
, CYCLE
},
1411 /* DEFW_ROW */ {DEFW
, DEFW
, DEFW
, NOACT
, NOACT
, NOACT
, NOACT
, CYCLE
},
1412 /* COMMON_ROW */ {COM
, COM
, COM
, CREF
, CREF
, BIG
, REFC
, WARNC
},
1413 /* INDR_ROW */ {IND
, IND
, IND
, MDEF
, IND
, CIND
, MIND
, CYCLE
},
1414 /* WARN_ROW */ {MWARN
, WARN
, WARN
, CWARN
, CWARN
, WARN
, CWARN
, MWARN
},
1415 /* SET_ROW */ {SET
, SET
, SET
, SET
, SET
, SET
, CYCLE
, CYCLE
}
1418 /* Most of the entries in the LINK_ACTION table are straightforward,
1419 but a few are somewhat subtle.
1421 A reference to an indirect symbol (UNDEF_ROW/indr or
1422 UNDEFW_ROW/indr) is counted as a reference both to the indirect
1423 symbol and to the symbol the indirect symbol points to.
1425 A reference to a warning symbol (UNDEF_ROW/warn or UNDEFW_ROW/warn)
1426 causes the warning to be issued.
1428 A common definition of an indirect symbol (COMMON_ROW/indr) is
1429 treated as a multiple definition error. Likewise for an indirect
1430 definition of a common symbol (INDR_ROW/com).
1432 An indirect definition of a warning (INDR_ROW/warn) does not cause
1433 the warning to be issued.
1435 If a warning is created for an indirect symbol (WARN_ROW/indr) no
1436 warning is created for the symbol the indirect symbol points to.
1438 Adding an entry to a set does not count as a reference to a set,
1439 and no warning is issued (SET_ROW/warn). */
1441 /* Return the BFD in which a hash entry has been defined, if known. */
1445 struct bfd_link_hash_entry
*h
;
1447 while (h
->type
== bfd_link_hash_warning
)
1453 case bfd_link_hash_undefined
:
1454 case bfd_link_hash_undefweak
:
1455 return h
->u
.undef
.abfd
;
1456 case bfd_link_hash_defined
:
1457 case bfd_link_hash_defweak
:
1458 return h
->u
.def
.section
->owner
;
1459 case bfd_link_hash_common
:
1460 return h
->u
.c
.p
->section
->owner
;
1465 /* Add a symbol to the global hash table.
1466 ABFD is the BFD the symbol comes from.
1467 NAME is the name of the symbol.
1468 FLAGS is the BSF_* bits associated with the symbol.
1469 SECTION is the section in which the symbol is defined; this may be
1470 bfd_und_section_ptr or bfd_com_section_ptr.
1471 VALUE is the value of the symbol, relative to the section.
1472 STRING is used for either an indirect symbol, in which case it is
1473 the name of the symbol to indirect to, or a warning symbol, in
1474 which case it is the warning string.
1475 COPY is true if NAME or STRING must be copied into locally
1476 allocated memory if they need to be saved.
1477 COLLECT is true if we should automatically collect gcc constructor
1478 or destructor names as collect2 does.
1479 HASHP, if not NULL, is a place to store the created hash table
1480 entry; if *HASHP is not NULL, the caller has already looked up
1481 the hash table entry, and stored it in *HASHP. */
1484 _bfd_generic_link_add_one_symbol (info
, abfd
, name
, flags
, section
, value
,
1485 string
, copy
, collect
, hashp
)
1486 struct bfd_link_info
*info
;
1495 struct bfd_link_hash_entry
**hashp
;
1498 struct bfd_link_hash_entry
*h
;
1501 if (bfd_is_ind_section (section
)
1502 || (flags
& BSF_INDIRECT
) != 0)
1504 else if ((flags
& BSF_WARNING
) != 0)
1506 else if ((flags
& BSF_CONSTRUCTOR
) != 0)
1508 else if (bfd_is_und_section (section
))
1510 if ((flags
& BSF_WEAK
) != 0)
1515 else if ((flags
& BSF_WEAK
) != 0)
1517 else if (bfd_is_com_section (section
))
1522 if (hashp
!= NULL
&& *hashp
!= NULL
)
1526 if (row
== UNDEF_ROW
|| row
== UNDEFW_ROW
)
1527 h
= bfd_wrapped_link_hash_lookup (abfd
, info
, name
, true, copy
, false);
1529 h
= bfd_link_hash_lookup (info
->hash
, name
, true, copy
, false);
1538 if (info
->notice_all
1539 || (info
->notice_hash
!= (struct bfd_hash_table
*) NULL
1540 && (bfd_hash_lookup (info
->notice_hash
, name
, false, false)
1541 != (struct bfd_hash_entry
*) NULL
)))
1543 if (! (*info
->callbacks
->notice
) (info
, h
->root
.string
, abfd
, section
,
1548 if (hashp
!= (struct bfd_link_hash_entry
**) NULL
)
1553 enum link_action action
;
1556 action
= link_action
[(int) row
][(int) h
->type
];
1567 /* Make a new undefined symbol. */
1568 h
->type
= bfd_link_hash_undefined
;
1569 h
->u
.undef
.abfd
= abfd
;
1570 bfd_link_add_undef (info
->hash
, h
);
1574 /* Make a new weak undefined symbol. */
1575 h
->type
= bfd_link_hash_undefweak
;
1576 h
->u
.undef
.abfd
= abfd
;
1580 /* We have found a definition for a symbol which was
1581 previously common. */
1582 BFD_ASSERT (h
->type
== bfd_link_hash_common
);
1583 if (! ((*info
->callbacks
->multiple_common
)
1584 (info
, h
->root
.string
,
1585 h
->u
.c
.p
->section
->owner
, bfd_link_hash_common
, h
->u
.c
.size
,
1586 abfd
, bfd_link_hash_defined
, (bfd_vma
) 0)))
1592 enum bfd_link_hash_type oldtype
;
1594 /* Define a symbol. */
1597 h
->type
= bfd_link_hash_defweak
;
1599 h
->type
= bfd_link_hash_defined
;
1600 h
->u
.def
.section
= section
;
1601 h
->u
.def
.value
= value
;
1603 /* If we have been asked to, we act like collect2 and
1604 identify all functions that might be global
1605 constructors and destructors and pass them up in a
1606 callback. We only do this for certain object file
1607 types, since many object file types can handle this
1609 if (collect
&& name
[0] == '_')
1613 /* A constructor or destructor name starts like this:
1614 _+GLOBAL_[_.$][ID][_.$] where the first [_.$] and
1615 the second are the same character (we accept any
1616 character there, in case a new object file format
1617 comes along with even worse naming restrictions). */
1619 #define CONS_PREFIX "GLOBAL_"
1620 #define CONS_PREFIX_LEN (sizeof CONS_PREFIX - 1)
1626 && strncmp (s
, CONS_PREFIX
, CONS_PREFIX_LEN
- 1) == 0)
1630 c
= s
[CONS_PREFIX_LEN
+ 1];
1631 if ((c
== 'I' || c
== 'D')
1632 && s
[CONS_PREFIX_LEN
] == s
[CONS_PREFIX_LEN
+ 2])
1634 /* If this is a definition of a symbol which
1635 was previously weakly defined, we are in
1636 trouble. We have already added a
1637 constructor entry for the weak defined
1638 symbol, and now we are trying to add one
1639 for the new symbol. Fortunately, this case
1640 should never arise in practice. */
1641 if (oldtype
== bfd_link_hash_defweak
)
1644 if (! ((*info
->callbacks
->constructor
)
1646 c
== 'I' ? true : false,
1647 h
->root
.string
, abfd
, section
, value
)))
1657 /* We have found a common definition for a symbol. */
1658 if (h
->type
== bfd_link_hash_new
)
1659 bfd_link_add_undef (info
->hash
, h
);
1660 h
->type
= bfd_link_hash_common
;
1662 ((struct bfd_link_hash_common_entry
*)
1663 bfd_hash_allocate (&info
->hash
->table
,
1664 sizeof (struct bfd_link_hash_common_entry
)));
1665 if (h
->u
.c
.p
== NULL
)
1668 h
->u
.c
.size
= value
;
1670 /* Select a default alignment based on the size. This may
1671 be overridden by the caller. */
1675 power
= bfd_log2 (value
);
1678 h
->u
.c
.p
->alignment_power
= power
;
1681 /* The section of a common symbol is only used if the common
1682 symbol is actually allocated. It basically provides a
1683 hook for the linker script to decide which output section
1684 the common symbols should be put in. In most cases, the
1685 section of a common symbol will be bfd_com_section_ptr,
1686 the code here will choose a common symbol section named
1687 "COMMON", and the linker script will contain *(COMMON) in
1688 the appropriate place. A few targets use separate common
1689 sections for small symbols, and they require special
1691 if (section
== bfd_com_section_ptr
)
1693 h
->u
.c
.p
->section
= bfd_make_section_old_way (abfd
, "COMMON");
1694 h
->u
.c
.p
->section
->flags
= SEC_ALLOC
;
1696 else if (section
->owner
!= abfd
)
1698 h
->u
.c
.p
->section
= bfd_make_section_old_way (abfd
,
1700 h
->u
.c
.p
->section
->flags
= SEC_ALLOC
;
1703 h
->u
.c
.p
->section
= section
;
1707 /* A reference to a defined symbol. */
1708 if (h
->next
== NULL
&& info
->hash
->undefs_tail
!= h
)
1713 /* We have found a common definition for a symbol which
1714 already had a common definition. Use the maximum of the
1715 two sizes, and use the section required by the larger symbol. */
1716 BFD_ASSERT (h
->type
== bfd_link_hash_common
);
1717 if (! ((*info
->callbacks
->multiple_common
)
1718 (info
, h
->root
.string
,
1719 h
->u
.c
.p
->section
->owner
, bfd_link_hash_common
, h
->u
.c
.size
,
1720 abfd
, bfd_link_hash_common
, value
)))
1722 if (value
> h
->u
.c
.size
)
1726 h
->u
.c
.size
= value
;
1728 /* Select a default alignment based on the size. This may
1729 be overridden by the caller. */
1730 power
= bfd_log2 (value
);
1733 h
->u
.c
.p
->alignment_power
= power
;
1735 /* Some systems have special treatment for small commons,
1736 hence we want to select the section used by the larger
1737 symbol. This makes sure the symbol does not go in a
1738 small common section if it is now too large. */
1739 if (section
== bfd_com_section_ptr
)
1742 = bfd_make_section_old_way (abfd
, "COMMON");
1743 h
->u
.c
.p
->section
->flags
= SEC_ALLOC
;
1745 else if (section
->owner
!= abfd
)
1748 = bfd_make_section_old_way (abfd
, section
->name
);
1749 h
->u
.c
.p
->section
->flags
= SEC_ALLOC
;
1752 h
->u
.c
.p
->section
= section
;
1760 /* We have found a common definition for a symbol which
1761 was already defined. FIXME: It would nice if we could
1762 report the BFD which defined an indirect symbol, but we
1763 don't have anywhere to store the information. */
1764 if (h
->type
== bfd_link_hash_defined
1765 || h
->type
== bfd_link_hash_defweak
)
1766 obfd
= h
->u
.def
.section
->owner
;
1769 if (! ((*info
->callbacks
->multiple_common
)
1770 (info
, h
->root
.string
, obfd
, h
->type
, (bfd_vma
) 0,
1771 abfd
, bfd_link_hash_common
, value
)))
1777 /* Multiple indirect symbols. This is OK if they both point
1778 to the same symbol. */
1779 if (strcmp (h
->u
.i
.link
->root
.string
, string
) == 0)
1783 /* Handle a multiple definition. */
1785 asection
*msec
= NULL
;
1790 case bfd_link_hash_defined
:
1791 msec
= h
->u
.def
.section
;
1792 mval
= h
->u
.def
.value
;
1794 case bfd_link_hash_indirect
:
1795 msec
= bfd_ind_section_ptr
;
1802 /* Ignore a redefinition of an absolute symbol to the same
1803 value; it's harmless. */
1804 if (h
->type
== bfd_link_hash_defined
1805 && bfd_is_abs_section (msec
)
1806 && bfd_is_abs_section (section
)
1810 if (! ((*info
->callbacks
->multiple_definition
)
1811 (info
, h
->root
.string
, msec
->owner
, msec
, mval
, abfd
,
1818 /* Create an indirect symbol from an existing common symbol. */
1819 BFD_ASSERT (h
->type
== bfd_link_hash_common
);
1820 if (! ((*info
->callbacks
->multiple_common
)
1821 (info
, h
->root
.string
,
1822 h
->u
.c
.p
->section
->owner
, bfd_link_hash_common
, h
->u
.c
.size
,
1823 abfd
, bfd_link_hash_indirect
, (bfd_vma
) 0)))
1827 /* Create an indirect symbol. */
1829 struct bfd_link_hash_entry
*inh
;
1831 /* STRING is the name of the symbol we want to indirect
1833 inh
= bfd_wrapped_link_hash_lookup (abfd
, info
, string
, true,
1835 if (inh
== (struct bfd_link_hash_entry
*) NULL
)
1837 if (inh
->type
== bfd_link_hash_indirect
1838 && inh
->u
.i
.link
== h
)
1840 (*_bfd_error_handler
)
1841 (_("%s: indirect symbol `%s' to `%s' is a loop"),
1842 bfd_get_filename (abfd
), name
, string
);
1843 bfd_set_error (bfd_error_invalid_operation
);
1846 if (inh
->type
== bfd_link_hash_new
)
1848 inh
->type
= bfd_link_hash_undefined
;
1849 inh
->u
.undef
.abfd
= abfd
;
1850 bfd_link_add_undef (info
->hash
, inh
);
1853 /* If the indirect symbol has been referenced, we need to
1854 push the reference down to the symbol we are
1856 if (h
->type
!= bfd_link_hash_new
)
1862 h
->type
= bfd_link_hash_indirect
;
1868 /* Add an entry to a set. */
1869 if (! (*info
->callbacks
->add_to_set
) (info
, h
, BFD_RELOC_CTOR
,
1870 abfd
, section
, value
))
1875 /* Issue a warning and cycle. */
1876 if (h
->u
.i
.warning
!= NULL
)
1878 if (! (*info
->callbacks
->warning
) (info
, h
->u
.i
.warning
,
1879 h
->root
.string
, abfd
,
1883 /* Only issue a warning once. */
1884 h
->u
.i
.warning
= NULL
;
1888 /* Try again with the referenced symbol. */
1894 /* A reference to an indirect symbol. */
1895 if (h
->next
== NULL
&& info
->hash
->undefs_tail
!= h
)
1902 /* Issue a warning. */
1903 if (! (*info
->callbacks
->warning
) (info
, string
, h
->root
.string
,
1905 (asection
*) NULL
, (bfd_vma
) 0))
1910 /* Warn if this symbol has been referenced already,
1911 otherwise add a warning. A symbol has been referenced if
1912 the next field is not NULL, or it is the tail of the
1913 undefined symbol list. The REF case above helps to
1915 if (h
->next
!= NULL
|| info
->hash
->undefs_tail
== h
)
1917 if (! (*info
->callbacks
->warning
) (info
, string
, h
->root
.string
,
1926 /* Make a warning symbol. */
1928 struct bfd_link_hash_entry
*sub
;
1930 /* STRING is the warning to give. */
1931 sub
= ((struct bfd_link_hash_entry
*)
1932 ((*info
->hash
->table
.newfunc
)
1933 ((struct bfd_hash_entry
*) NULL
, &info
->hash
->table
,
1938 sub
->type
= bfd_link_hash_warning
;
1941 sub
->u
.i
.warning
= string
;
1946 w
= bfd_hash_allocate (&info
->hash
->table
,
1947 strlen (string
) + 1);
1951 sub
->u
.i
.warning
= w
;
1954 bfd_hash_replace (&info
->hash
->table
,
1955 (struct bfd_hash_entry
*) h
,
1956 (struct bfd_hash_entry
*) sub
);
1968 /* Generic final link routine. */
1971 _bfd_generic_final_link (abfd
, info
)
1973 struct bfd_link_info
*info
;
1977 struct bfd_link_order
*p
;
1979 struct generic_write_global_symbol_info wginfo
;
1981 bfd_get_outsymbols (abfd
) = (asymbol
**) NULL
;
1982 bfd_get_symcount (abfd
) = 0;
1985 /* Mark all sections which will be included in the output file. */
1986 for (o
= abfd
->sections
; o
!= NULL
; o
= o
->next
)
1987 for (p
= o
->link_order_head
; p
!= NULL
; p
= p
->next
)
1988 if (p
->type
== bfd_indirect_link_order
)
1989 p
->u
.indirect
.section
->linker_mark
= true;
1991 /* Build the output symbol table. */
1992 for (sub
= info
->input_bfds
; sub
!= (bfd
*) NULL
; sub
= sub
->link_next
)
1993 if (! _bfd_generic_link_output_symbols (abfd
, sub
, info
, &outsymalloc
))
1996 /* Accumulate the global symbols. */
1998 wginfo
.output_bfd
= abfd
;
1999 wginfo
.psymalloc
= &outsymalloc
;
2000 _bfd_generic_link_hash_traverse (_bfd_generic_hash_table (info
),
2001 _bfd_generic_link_write_global_symbol
,
2004 /* Make sure we have a trailing NULL pointer on OUTSYMBOLS. We
2005 shouldn't really need one, since we have SYMCOUNT, but some old
2006 code still expects one. */
2007 if (! generic_add_output_symbol (abfd
, &outsymalloc
, NULL
))
2010 if (info
->relocateable
)
2012 /* Allocate space for the output relocs for each section. */
2013 for (o
= abfd
->sections
;
2014 o
!= (asection
*) NULL
;
2018 for (p
= o
->link_order_head
;
2019 p
!= (struct bfd_link_order
*) NULL
;
2022 if (p
->type
== bfd_section_reloc_link_order
2023 || p
->type
== bfd_symbol_reloc_link_order
)
2025 else if (p
->type
== bfd_indirect_link_order
)
2027 asection
*input_section
;
2034 input_section
= p
->u
.indirect
.section
;
2035 input_bfd
= input_section
->owner
;
2036 relsize
= bfd_get_reloc_upper_bound (input_bfd
,
2040 relocs
= (arelent
**) bfd_malloc ((size_t) relsize
);
2041 if (!relocs
&& relsize
!= 0)
2043 symbols
= _bfd_generic_link_get_symbols (input_bfd
);
2044 reloc_count
= bfd_canonicalize_reloc (input_bfd
,
2048 if (reloc_count
< 0)
2050 BFD_ASSERT ((unsigned long) reloc_count
2051 == input_section
->reloc_count
);
2052 o
->reloc_count
+= reloc_count
;
2056 if (o
->reloc_count
> 0)
2058 o
->orelocation
= ((arelent
**)
2061 * sizeof (arelent
*))));
2062 if (!o
->orelocation
)
2064 o
->flags
|= SEC_RELOC
;
2065 /* Reset the count so that it can be used as an index
2066 when putting in the output relocs. */
2072 /* Handle all the link order information for the sections. */
2073 for (o
= abfd
->sections
;
2074 o
!= (asection
*) NULL
;
2077 for (p
= o
->link_order_head
;
2078 p
!= (struct bfd_link_order
*) NULL
;
2083 case bfd_section_reloc_link_order
:
2084 case bfd_symbol_reloc_link_order
:
2085 if (! _bfd_generic_reloc_link_order (abfd
, info
, o
, p
))
2088 case bfd_indirect_link_order
:
2089 if (! default_indirect_link_order (abfd
, info
, o
, p
, true))
2093 if (! _bfd_default_link_order (abfd
, info
, o
, p
))
2103 /* Add an output symbol to the output BFD. */
2106 generic_add_output_symbol (output_bfd
, psymalloc
, sym
)
2111 if (bfd_get_symcount (output_bfd
) >= *psymalloc
)
2115 if (*psymalloc
== 0)
2119 newsyms
= (asymbol
**) bfd_realloc (bfd_get_outsymbols (output_bfd
),
2120 *psymalloc
* sizeof (asymbol
*));
2121 if (newsyms
== (asymbol
**) NULL
)
2123 bfd_get_outsymbols (output_bfd
) = newsyms
;
2126 bfd_get_outsymbols (output_bfd
) [bfd_get_symcount (output_bfd
)] = sym
;
2128 ++ bfd_get_symcount (output_bfd
);
2133 /* Handle the symbols for an input BFD. */
2136 _bfd_generic_link_output_symbols (output_bfd
, input_bfd
, info
, psymalloc
)
2139 struct bfd_link_info
*info
;
2145 if (! generic_link_read_symbols (input_bfd
))
2148 /* Create a filename symbol if we are supposed to. */
2149 if (info
->create_object_symbols_section
!= (asection
*) NULL
)
2153 for (sec
= input_bfd
->sections
;
2154 sec
!= (asection
*) NULL
;
2157 if (sec
->output_section
== info
->create_object_symbols_section
)
2161 newsym
= bfd_make_empty_symbol (input_bfd
);
2164 newsym
->name
= input_bfd
->filename
;
2166 newsym
->flags
= BSF_LOCAL
| BSF_FILE
;
2167 newsym
->section
= sec
;
2169 if (! generic_add_output_symbol (output_bfd
, psymalloc
,
2178 /* Adjust the values of the globally visible symbols, and write out
2180 sym_ptr
= _bfd_generic_link_get_symbols (input_bfd
);
2181 sym_end
= sym_ptr
+ _bfd_generic_link_get_symcount (input_bfd
);
2182 for (; sym_ptr
< sym_end
; sym_ptr
++)
2185 struct generic_link_hash_entry
*h
;
2188 h
= (struct generic_link_hash_entry
*) NULL
;
2190 if ((sym
->flags
& (BSF_INDIRECT
2195 || bfd_is_und_section (bfd_get_section (sym
))
2196 || bfd_is_com_section (bfd_get_section (sym
))
2197 || bfd_is_ind_section (bfd_get_section (sym
)))
2199 if (sym
->udata
.p
!= NULL
)
2200 h
= (struct generic_link_hash_entry
*) sym
->udata
.p
;
2201 else if ((sym
->flags
& BSF_CONSTRUCTOR
) != 0)
2203 /* This case normally means that the main linker code
2204 deliberately ignored this constructor symbol. We
2205 should just pass it through. This will screw up if
2206 the constructor symbol is from a different,
2207 non-generic, object file format, but the case will
2208 only arise when linking with -r, which will probably
2209 fail anyhow, since there will be no way to represent
2210 the relocs in the output format being used. */
2213 else if (bfd_is_und_section (bfd_get_section (sym
)))
2214 h
= ((struct generic_link_hash_entry
*)
2215 bfd_wrapped_link_hash_lookup (output_bfd
, info
,
2216 bfd_asymbol_name (sym
),
2217 false, false, true));
2219 h
= _bfd_generic_link_hash_lookup (_bfd_generic_hash_table (info
),
2220 bfd_asymbol_name (sym
),
2221 false, false, true);
2223 if (h
!= (struct generic_link_hash_entry
*) NULL
)
2225 /* Force all references to this symbol to point to
2226 the same area in memory. It is possible that
2227 this routine will be called with a hash table
2228 other than a generic hash table, so we double
2230 if (info
->hash
->creator
== input_bfd
->xvec
)
2232 if (h
->sym
!= (asymbol
*) NULL
)
2233 *sym_ptr
= sym
= h
->sym
;
2236 switch (h
->root
.type
)
2239 case bfd_link_hash_new
:
2241 case bfd_link_hash_undefined
:
2243 case bfd_link_hash_undefweak
:
2244 sym
->flags
|= BSF_WEAK
;
2246 case bfd_link_hash_indirect
:
2247 h
= (struct generic_link_hash_entry
*) h
->root
.u
.i
.link
;
2249 case bfd_link_hash_defined
:
2250 sym
->flags
|= BSF_GLOBAL
;
2251 sym
->flags
&=~ BSF_CONSTRUCTOR
;
2252 sym
->value
= h
->root
.u
.def
.value
;
2253 sym
->section
= h
->root
.u
.def
.section
;
2255 case bfd_link_hash_defweak
:
2256 sym
->flags
|= BSF_WEAK
;
2257 sym
->flags
&=~ BSF_CONSTRUCTOR
;
2258 sym
->value
= h
->root
.u
.def
.value
;
2259 sym
->section
= h
->root
.u
.def
.section
;
2261 case bfd_link_hash_common
:
2262 sym
->value
= h
->root
.u
.c
.size
;
2263 sym
->flags
|= BSF_GLOBAL
;
2264 if (! bfd_is_com_section (sym
->section
))
2266 BFD_ASSERT (bfd_is_und_section (sym
->section
));
2267 sym
->section
= bfd_com_section_ptr
;
2269 /* We do not set the section of the symbol to
2270 h->root.u.c.p->section. That value was saved so
2271 that we would know where to allocate the symbol
2272 if it was defined. In this case the type is
2273 still bfd_link_hash_common, so we did not define
2274 it, so we do not want to use that section. */
2280 /* This switch is straight from the old code in
2281 write_file_locals in ldsym.c. */
2282 if (info
->strip
== strip_all
2283 || (info
->strip
== strip_some
2284 && (bfd_hash_lookup (info
->keep_hash
, bfd_asymbol_name (sym
),
2286 == (struct bfd_hash_entry
*) NULL
)))
2288 else if ((sym
->flags
& (BSF_GLOBAL
| BSF_WEAK
)) != 0)
2290 /* If this symbol is marked as occurring now, rather
2291 than at the end, output it now. This is used for
2292 COFF C_EXT FCN symbols. FIXME: There must be a
2294 if (bfd_asymbol_bfd (sym
) == input_bfd
2295 && (sym
->flags
& BSF_NOT_AT_END
) != 0)
2300 else if (bfd_is_ind_section (sym
->section
))
2302 else if ((sym
->flags
& BSF_DEBUGGING
) != 0)
2304 if (info
->strip
== strip_none
)
2309 else if (bfd_is_und_section (sym
->section
)
2310 || bfd_is_com_section (sym
->section
))
2312 else if ((sym
->flags
& BSF_LOCAL
) != 0)
2314 if ((sym
->flags
& BSF_WARNING
) != 0)
2318 switch (info
->discard
)
2324 case discard_sec_merge
:
2326 if (info
->relocateable
2327 || ! (sym
->section
->flags
& SEC_MERGE
))
2331 if (bfd_is_local_label (input_bfd
, sym
))
2342 else if ((sym
->flags
& BSF_CONSTRUCTOR
))
2344 if (info
->strip
!= strip_all
)
2352 /* If this symbol is in a section which is not being included
2353 in the output file, then we don't want to output the symbol.
2355 Gross. .bss and similar sections won't have the linker_mark
2357 if ((sym
->section
->flags
& SEC_HAS_CONTENTS
) != 0
2358 && sym
->section
->linker_mark
== false)
2363 if (! generic_add_output_symbol (output_bfd
, psymalloc
, sym
))
2365 if (h
!= (struct generic_link_hash_entry
*) NULL
)
2373 /* Set the section and value of a generic BFD symbol based on a linker
2374 hash table entry. */
2377 set_symbol_from_hash (sym
, h
)
2379 struct bfd_link_hash_entry
*h
;
2386 case bfd_link_hash_new
:
2387 /* This can happen when a constructor symbol is seen but we are
2388 not building constructors. */
2389 if (sym
->section
!= NULL
)
2391 BFD_ASSERT ((sym
->flags
& BSF_CONSTRUCTOR
) != 0);
2395 sym
->flags
|= BSF_CONSTRUCTOR
;
2396 sym
->section
= bfd_abs_section_ptr
;
2400 case bfd_link_hash_undefined
:
2401 sym
->section
= bfd_und_section_ptr
;
2404 case bfd_link_hash_undefweak
:
2405 sym
->section
= bfd_und_section_ptr
;
2407 sym
->flags
|= BSF_WEAK
;
2409 case bfd_link_hash_defined
:
2410 sym
->section
= h
->u
.def
.section
;
2411 sym
->value
= h
->u
.def
.value
;
2413 case bfd_link_hash_defweak
:
2414 sym
->flags
|= BSF_WEAK
;
2415 sym
->section
= h
->u
.def
.section
;
2416 sym
->value
= h
->u
.def
.value
;
2418 case bfd_link_hash_common
:
2419 sym
->value
= h
->u
.c
.size
;
2420 if (sym
->section
== NULL
)
2421 sym
->section
= bfd_com_section_ptr
;
2422 else if (! bfd_is_com_section (sym
->section
))
2424 BFD_ASSERT (bfd_is_und_section (sym
->section
));
2425 sym
->section
= bfd_com_section_ptr
;
2427 /* Do not set the section; see _bfd_generic_link_output_symbols. */
2429 case bfd_link_hash_indirect
:
2430 case bfd_link_hash_warning
:
2431 /* FIXME: What should we do here? */
2436 /* Write out a global symbol, if it hasn't already been written out.
2437 This is called for each symbol in the hash table. */
2440 _bfd_generic_link_write_global_symbol (h
, data
)
2441 struct generic_link_hash_entry
*h
;
2444 struct generic_write_global_symbol_info
*wginfo
=
2445 (struct generic_write_global_symbol_info
*) data
;
2453 if (wginfo
->info
->strip
== strip_all
2454 || (wginfo
->info
->strip
== strip_some
2455 && bfd_hash_lookup (wginfo
->info
->keep_hash
, h
->root
.root
.string
,
2456 false, false) == NULL
))
2459 if (h
->sym
!= (asymbol
*) NULL
)
2463 sym
= bfd_make_empty_symbol (wginfo
->output_bfd
);
2466 sym
->name
= h
->root
.root
.string
;
2470 set_symbol_from_hash (sym
, &h
->root
);
2472 sym
->flags
|= BSF_GLOBAL
;
2474 if (! generic_add_output_symbol (wginfo
->output_bfd
, wginfo
->psymalloc
,
2477 /* FIXME: No way to return failure. */
2484 /* Create a relocation. */
2487 _bfd_generic_reloc_link_order (abfd
, info
, sec
, link_order
)
2489 struct bfd_link_info
*info
;
2491 struct bfd_link_order
*link_order
;
2495 if (! info
->relocateable
)
2497 if (sec
->orelocation
== (arelent
**) NULL
)
2500 r
= (arelent
*) bfd_alloc (abfd
, sizeof (arelent
));
2501 if (r
== (arelent
*) NULL
)
2504 r
->address
= link_order
->offset
;
2505 r
->howto
= bfd_reloc_type_lookup (abfd
, link_order
->u
.reloc
.p
->reloc
);
2508 bfd_set_error (bfd_error_bad_value
);
2512 /* Get the symbol to use for the relocation. */
2513 if (link_order
->type
== bfd_section_reloc_link_order
)
2514 r
->sym_ptr_ptr
= link_order
->u
.reloc
.p
->u
.section
->symbol_ptr_ptr
;
2517 struct generic_link_hash_entry
*h
;
2519 h
= ((struct generic_link_hash_entry
*)
2520 bfd_wrapped_link_hash_lookup (abfd
, info
,
2521 link_order
->u
.reloc
.p
->u
.name
,
2522 false, false, true));
2523 if (h
== (struct generic_link_hash_entry
*) NULL
2526 if (! ((*info
->callbacks
->unattached_reloc
)
2527 (info
, link_order
->u
.reloc
.p
->u
.name
,
2528 (bfd
*) NULL
, (asection
*) NULL
, (bfd_vma
) 0)))
2530 bfd_set_error (bfd_error_bad_value
);
2533 r
->sym_ptr_ptr
= &h
->sym
;
2536 /* If this is an inplace reloc, write the addend to the object file.
2537 Otherwise, store it in the reloc addend. */
2538 if (! r
->howto
->partial_inplace
)
2539 r
->addend
= link_order
->u
.reloc
.p
->addend
;
2543 bfd_reloc_status_type rstat
;
2547 size
= bfd_get_reloc_size (r
->howto
);
2548 buf
= (bfd_byte
*) bfd_zmalloc (size
);
2549 if (buf
== (bfd_byte
*) NULL
)
2551 rstat
= _bfd_relocate_contents (r
->howto
, abfd
,
2552 link_order
->u
.reloc
.p
->addend
, buf
);
2558 case bfd_reloc_outofrange
:
2560 case bfd_reloc_overflow
:
2561 if (! ((*info
->callbacks
->reloc_overflow
)
2563 (link_order
->type
== bfd_section_reloc_link_order
2564 ? bfd_section_name (abfd
, link_order
->u
.reloc
.p
->u
.section
)
2565 : link_order
->u
.reloc
.p
->u
.name
),
2566 r
->howto
->name
, link_order
->u
.reloc
.p
->addend
,
2567 (bfd
*) NULL
, (asection
*) NULL
, (bfd_vma
) 0)))
2574 ok
= bfd_set_section_contents (abfd
, sec
, (PTR
) buf
,
2576 (link_order
->offset
*
2577 bfd_octets_per_byte (abfd
)), size
);
2585 sec
->orelocation
[sec
->reloc_count
] = r
;
2591 /* Allocate a new link_order for a section. */
2593 struct bfd_link_order
*
2594 bfd_new_link_order (abfd
, section
)
2598 struct bfd_link_order
*new;
2600 new = ((struct bfd_link_order
*)
2601 bfd_alloc (abfd
, sizeof (struct bfd_link_order
)));
2605 new->type
= bfd_undefined_link_order
;
2608 new->next
= (struct bfd_link_order
*) NULL
;
2610 if (section
->link_order_tail
!= (struct bfd_link_order
*) NULL
)
2611 section
->link_order_tail
->next
= new;
2613 section
->link_order_head
= new;
2614 section
->link_order_tail
= new;
2619 /* Default link order processing routine. Note that we can not handle
2620 the reloc_link_order types here, since they depend upon the details
2621 of how the particular backends generates relocs. */
2624 _bfd_default_link_order (abfd
, info
, sec
, link_order
)
2626 struct bfd_link_info
*info
;
2628 struct bfd_link_order
*link_order
;
2630 switch (link_order
->type
)
2632 case bfd_undefined_link_order
:
2633 case bfd_section_reloc_link_order
:
2634 case bfd_symbol_reloc_link_order
:
2637 case bfd_indirect_link_order
:
2638 return default_indirect_link_order (abfd
, info
, sec
, link_order
,
2640 case bfd_fill_link_order
:
2641 return default_fill_link_order (abfd
, info
, sec
, link_order
);
2642 case bfd_data_link_order
:
2643 return bfd_set_section_contents (abfd
, sec
,
2644 (PTR
) link_order
->u
.data
.contents
,
2646 (link_order
->offset
*
2647 bfd_octets_per_byte (abfd
)),
2652 /* Default routine to handle a bfd_fill_link_order. */
2655 default_fill_link_order (abfd
, info
, sec
, link_order
)
2657 struct bfd_link_info
*info ATTRIBUTE_UNUSED
;
2659 struct bfd_link_order
*link_order
;
2662 unsigned char *space
;
2668 BFD_ASSERT ((sec
->flags
& SEC_HAS_CONTENTS
) != 0);
2670 size
= (size_t) link_order
->size
;
2674 space
= (unsigned char *) bfd_malloc (size
);
2678 fill
= link_order
->u
.fill
.value
;
2679 for (i
= 0; i
< size
; i
+= 4)
2680 space
[i
] = fill
>> 24;
2681 for (i
= 1; i
< size
; i
+= 4)
2682 space
[i
] = fill
>> 16;
2683 for (i
= 2; i
< size
; i
+= 4)
2684 space
[i
] = fill
>> 8;
2685 for (i
= 3; i
< size
; i
+= 4)
2688 loc
= (file_ptr
) (link_order
->offset
* bfd_octets_per_byte (abfd
));
2689 result
= bfd_set_section_contents (abfd
, sec
, space
, loc
, link_order
->size
);
2695 /* Default routine to handle a bfd_indirect_link_order. */
2698 default_indirect_link_order (output_bfd
, info
, output_section
, link_order
,
2701 struct bfd_link_info
*info
;
2702 asection
*output_section
;
2703 struct bfd_link_order
*link_order
;
2704 boolean generic_linker
;
2706 asection
*input_section
;
2708 bfd_byte
*contents
= NULL
;
2709 bfd_byte
*new_contents
;
2711 BFD_ASSERT ((output_section
->flags
& SEC_HAS_CONTENTS
) != 0);
2713 if (link_order
->size
== 0)
2716 input_section
= link_order
->u
.indirect
.section
;
2717 input_bfd
= input_section
->owner
;
2719 BFD_ASSERT (input_section
->output_section
== output_section
);
2720 BFD_ASSERT (input_section
->output_offset
== link_order
->offset
);
2721 BFD_ASSERT (input_section
->_cooked_size
== link_order
->size
);
2723 if (info
->relocateable
2724 && input_section
->reloc_count
> 0
2725 && output_section
->orelocation
== (arelent
**) NULL
)
2727 /* Space has not been allocated for the output relocations.
2728 This can happen when we are called by a specific backend
2729 because somebody is attempting to link together different
2730 types of object files. Handling this case correctly is
2731 difficult, and sometimes impossible. */
2732 (*_bfd_error_handler
)
2733 (_("Attempt to do relocateable link with %s input and %s output"),
2734 bfd_get_target (input_bfd
), bfd_get_target (output_bfd
));
2735 bfd_set_error (bfd_error_wrong_format
);
2739 if (! generic_linker
)
2744 /* Get the canonical symbols. The generic linker will always
2745 have retrieved them by this point, but we are being called by
2746 a specific linker, presumably because we are linking
2747 different types of object files together. */
2748 if (! generic_link_read_symbols (input_bfd
))
2751 /* Since we have been called by a specific linker, rather than
2752 the generic linker, the values of the symbols will not be
2753 right. They will be the values as seen in the input file,
2754 not the values of the final link. We need to fix them up
2755 before we can relocate the section. */
2756 sympp
= _bfd_generic_link_get_symbols (input_bfd
);
2757 symppend
= sympp
+ _bfd_generic_link_get_symcount (input_bfd
);
2758 for (; sympp
< symppend
; sympp
++)
2761 struct bfd_link_hash_entry
*h
;
2765 if ((sym
->flags
& (BSF_INDIRECT
2770 || bfd_is_und_section (bfd_get_section (sym
))
2771 || bfd_is_com_section (bfd_get_section (sym
))
2772 || bfd_is_ind_section (bfd_get_section (sym
)))
2774 /* sym->udata may have been set by
2775 generic_link_add_symbol_list. */
2776 if (sym
->udata
.p
!= NULL
)
2777 h
= (struct bfd_link_hash_entry
*) sym
->udata
.p
;
2778 else if (bfd_is_und_section (bfd_get_section (sym
)))
2779 h
= bfd_wrapped_link_hash_lookup (output_bfd
, info
,
2780 bfd_asymbol_name (sym
),
2781 false, false, true);
2783 h
= bfd_link_hash_lookup (info
->hash
,
2784 bfd_asymbol_name (sym
),
2785 false, false, true);
2787 set_symbol_from_hash (sym
, h
);
2792 /* Get and relocate the section contents. */
2793 contents
= ((bfd_byte
*)
2794 bfd_malloc (bfd_section_size (input_bfd
, input_section
)));
2795 if (contents
== NULL
&& bfd_section_size (input_bfd
, input_section
) != 0)
2797 new_contents
= (bfd_get_relocated_section_contents
2798 (output_bfd
, info
, link_order
, contents
, info
->relocateable
,
2799 _bfd_generic_link_get_symbols (input_bfd
)));
2803 /* Output the section contents. */
2804 if (! bfd_set_section_contents (output_bfd
, output_section
,
2807 (link_order
->offset
*
2808 bfd_octets_per_byte (output_bfd
)),
2812 if (contents
!= NULL
)
2817 if (contents
!= NULL
)
2822 /* A little routine to count the number of relocs in a link_order
2826 _bfd_count_link_order_relocs (link_order
)
2827 struct bfd_link_order
*link_order
;
2829 register unsigned int c
;
2830 register struct bfd_link_order
*l
;
2833 for (l
= link_order
; l
!= (struct bfd_link_order
*) NULL
; l
= l
->next
)
2835 if (l
->type
== bfd_section_reloc_link_order
2836 || l
->type
== bfd_symbol_reloc_link_order
)
2845 bfd_link_split_section
2848 boolean bfd_link_split_section(bfd *abfd, asection *sec);
2851 Return nonzero if @var{sec} should be split during a
2852 reloceatable or final link.
2854 .#define bfd_link_split_section(abfd, sec) \
2855 . BFD_SEND (abfd, _bfd_link_split_section, (abfd, sec))
2861 _bfd_generic_link_split_section (abfd
, sec
)
2862 bfd
*abfd ATTRIBUTE_UNUSED
;
2863 asection
*sec ATTRIBUTE_UNUSED
;