Commit | Line | Data |
---|---|---|
252b5132 | 1 | /* linker.c -- BFD linker routines |
b9cf773d | 2 | Copyright 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, |
77cfaee6 | 3 | 2003, 2004, 2005 Free Software Foundation, Inc. |
252b5132 RH |
4 | Written by Steve Chamberlain and Ian Lance Taylor, Cygnus Support |
5 | ||
5ed6aba4 | 6 | This file is part of BFD, the Binary File Descriptor library. |
252b5132 | 7 | |
5ed6aba4 NC |
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. | |
252b5132 | 12 | |
5ed6aba4 NC |
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. | |
252b5132 | 17 | |
5ed6aba4 NC |
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. */ | |
252b5132 RH |
21 | |
22 | #include "bfd.h" | |
23 | #include "sysdep.h" | |
24 | #include "libbfd.h" | |
25 | #include "bfdlink.h" | |
26 | #include "genlink.h" | |
27 | ||
28 | /* | |
29 | SECTION | |
30 | Linker Functions | |
31 | ||
32 | @cindex Linker | |
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 | |
38 | memory. | |
39 | ||
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. | |
49 | ||
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 | |
55 | proper. | |
56 | ||
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. | |
62 | ||
509945ae | 63 | @menu |
252b5132 RH |
64 | @* Creating a Linker Hash Table:: |
65 | @* Adding Symbols to the Hash Table:: | |
66 | @* Performing the Final Link:: | |
67 | @end menu | |
68 | ||
69 | INODE | |
70 | Creating a Linker Hash Table, Adding Symbols to the Hash Table, Linker Functions, Linker Functions | |
71 | SUBSECTION | |
72 | Creating a linker hash table | |
73 | ||
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 | |
dc1bc0c9 | 78 | <<bfdlink.c>>. @xref{Hash Tables}, for information on how to |
252b5132 RH |
79 | create a derived hash table. This entry point is called using |
80 | the target vector of the linker output file. | |
81 | ||
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. | |
88 | ||
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 | |
1049f94e | 91 | (this index number is used so that when doing a relocatable |
252b5132 RH |
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 | |
99 | pointer to it. | |
100 | ||
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. | |
106 | ||
107 | INODE | |
108 | Adding Symbols to the Hash Table, Performing the Final Link, Creating a Linker Hash Table, Linker Functions | |
109 | SUBSECTION | |
110 | Adding symbols to the hash table | |
111 | ||
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 | |
122 | link. | |
123 | ||
124 | The a.out version of this entry point is | |
125 | <<NAME(aout,link_add_symbols)>>. | |
126 | ||
127 | @menu | |
128 | @* Differing file formats:: | |
129 | @* Adding symbols from an object file:: | |
130 | @* Adding symbols from an archive:: | |
131 | @end menu | |
132 | ||
133 | INODE | |
134 | Differing file formats, Adding symbols from an object file, Adding Symbols to the Hash Table, Adding Symbols to the Hash Table | |
135 | SUBSUBSECTION | |
136 | Differing file formats | |
137 | ||
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>>. | |
149 | ||
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. | |
155 | ||
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. | |
164 | ||
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 | |
168 | hash table entry. | |
169 | ||
170 | INODE | |
171 | Adding symbols from an object file, Adding symbols from an archive, Differing file formats, Adding Symbols to the Hash Table | |
172 | SUBSUBSECTION | |
173 | Adding symbols from an object file | |
174 | ||
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>>. | |
183 | ||
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. | |
188 | ||
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. | |
198 | ||
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 | |
b34976b6 | 203 | <<keep_memory>> field of the <<info>> argument is TRUE, so |
252b5132 RH |
204 | that the <<-no-keep-memory>> linker switch is effective. |
205 | ||
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. | |
213 | ||
214 | INODE | |
215 | Adding symbols from an archive, , Adding symbols from an object file, Adding Symbols to the Hash Table | |
216 | SUBSUBSECTION | |
217 | Adding symbols from an archive | |
218 | ||
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. | |
225 | ||
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. | |
237 | ||
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. | |
247 | ||
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 | |
258 | linker hash table. | |
259 | ||
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. | |
265 | ||
266 | INODE | |
267 | Performing the Final Link, , Adding Symbols to the Hash Table, Linker Functions | |
268 | SUBSECTION | |
269 | Performing the final link | |
270 | ||
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 | |
1049f94e | 280 | hash table. When producing relocatable output, it must |
252b5132 RH |
281 | modify the input relocs and write them into the output file. |
282 | There may also be object format dependent work to be done. | |
283 | ||
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. | |
287 | ||
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)>>. | |
291 | ||
292 | @menu | |
293 | @* Information provided by the linker:: | |
294 | @* Relocating the section contents:: | |
295 | @* Writing the symbol table:: | |
296 | @end menu | |
297 | ||
298 | INODE | |
299 | Information provided by the linker, Relocating the section contents, Performing the Final Link, Performing the Final Link | |
300 | SUBSUBSECTION | |
301 | Information provided by the linker | |
302 | ||
303 | Before the linker calls the <<_bfd_final_link>> entry point, | |
304 | it sets up some data structures for the function to use. | |
305 | ||
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. | |
310 | ||
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 | |
1049f94e | 320 | while generating a relocatable object file. |
252b5132 RH |
321 | |
322 | INODE | |
323 | Relocating the section contents, Writing the symbol table, Information provided by the linker, Performing the Final Link | |
324 | SUBSUBSECTION | |
325 | Relocating the section contents | |
326 | ||
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>>). | |
333 | ||
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 | |
1049f94e | 342 | section contents. If performing a relocatable link, the |
252b5132 RH |
343 | relocs themselves must also be modified and written out. |
344 | ||
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>>. | |
354 | ||
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>>. | |
359 | ||
360 | INODE | |
361 | Writing the symbol table, , Relocating the section contents, Performing the Final Link | |
362 | SUBSUBSECTION | |
363 | Writing the symbol table | |
364 | ||
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. | |
370 | ||
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. | |
377 | ||
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. | |
385 | ||
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. | |
393 | ||
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. | |
400 | ||
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)>>. | |
407 | */ | |
408 | ||
b34976b6 | 409 | static bfd_boolean generic_link_add_object_symbols |
c58b9523 AM |
410 | (bfd *, struct bfd_link_info *, bfd_boolean collect); |
411 | static bfd_boolean generic_link_add_symbols | |
412 | (bfd *, struct bfd_link_info *, bfd_boolean); | |
b34976b6 | 413 | static bfd_boolean generic_link_check_archive_element_no_collect |
c58b9523 | 414 | (bfd *, struct bfd_link_info *, bfd_boolean *); |
b34976b6 | 415 | static bfd_boolean generic_link_check_archive_element_collect |
c58b9523 | 416 | (bfd *, struct bfd_link_info *, bfd_boolean *); |
b34976b6 | 417 | static bfd_boolean generic_link_check_archive_element |
c58b9523 | 418 | (bfd *, struct bfd_link_info *, bfd_boolean *, bfd_boolean); |
b34976b6 | 419 | static bfd_boolean generic_link_add_symbol_list |
c58b9523 AM |
420 | (bfd *, struct bfd_link_info *, bfd_size_type count, asymbol **, |
421 | bfd_boolean); | |
b34976b6 | 422 | static bfd_boolean generic_add_output_symbol |
c58b9523 | 423 | (bfd *, size_t *psymalloc, asymbol *); |
b34976b6 | 424 | static bfd_boolean default_data_link_order |
c58b9523 | 425 | (bfd *, struct bfd_link_info *, asection *, struct bfd_link_order *); |
b34976b6 | 426 | static bfd_boolean default_indirect_link_order |
c58b9523 AM |
427 | (bfd *, struct bfd_link_info *, asection *, struct bfd_link_order *, |
428 | bfd_boolean); | |
252b5132 RH |
429 | |
430 | /* The link hash table structure is defined in bfdlink.h. It provides | |
431 | a base hash table which the backend specific hash tables are built | |
432 | upon. */ | |
433 | ||
434 | /* Routine to create an entry in the link hash table. */ | |
435 | ||
436 | struct bfd_hash_entry * | |
c58b9523 AM |
437 | _bfd_link_hash_newfunc (struct bfd_hash_entry *entry, |
438 | struct bfd_hash_table *table, | |
439 | const char *string) | |
252b5132 | 440 | { |
252b5132 RH |
441 | /* Allocate the structure if it has not already been allocated by a |
442 | subclass. */ | |
51b64d56 AM |
443 | if (entry == NULL) |
444 | { | |
c58b9523 | 445 | entry = bfd_hash_allocate (table, sizeof (struct bfd_link_hash_entry)); |
51b64d56 AM |
446 | if (entry == NULL) |
447 | return entry; | |
448 | } | |
252b5132 RH |
449 | |
450 | /* Call the allocation method of the superclass. */ | |
51b64d56 AM |
451 | entry = bfd_hash_newfunc (entry, table, string); |
452 | if (entry) | |
252b5132 | 453 | { |
51b64d56 AM |
454 | struct bfd_link_hash_entry *h = (struct bfd_link_hash_entry *) entry; |
455 | ||
252b5132 | 456 | /* Initialize the local fields. */ |
51b64d56 | 457 | h->type = bfd_link_hash_new; |
f6e332e6 | 458 | h->u.undef.next = NULL; |
252b5132 RH |
459 | } |
460 | ||
51b64d56 | 461 | return entry; |
252b5132 RH |
462 | } |
463 | ||
464 | /* Initialize a link hash table. The BFD argument is the one | |
465 | responsible for creating this table. */ | |
466 | ||
b34976b6 | 467 | bfd_boolean |
c58b9523 AM |
468 | _bfd_link_hash_table_init |
469 | (struct bfd_link_hash_table *table, | |
470 | bfd *abfd, | |
471 | struct bfd_hash_entry *(*newfunc) (struct bfd_hash_entry *, | |
472 | struct bfd_hash_table *, | |
473 | const char *)) | |
252b5132 RH |
474 | { |
475 | table->creator = abfd->xvec; | |
476 | table->undefs = NULL; | |
477 | table->undefs_tail = NULL; | |
8ea2e4bd NC |
478 | table->type = bfd_link_generic_hash_table; |
479 | ||
252b5132 RH |
480 | return bfd_hash_table_init (&table->table, newfunc); |
481 | } | |
482 | ||
b34976b6 | 483 | /* Look up a symbol in a link hash table. If follow is TRUE, we |
252b5132 RH |
484 | follow bfd_link_hash_indirect and bfd_link_hash_warning links to |
485 | the real symbol. */ | |
486 | ||
487 | struct bfd_link_hash_entry * | |
c58b9523 AM |
488 | bfd_link_hash_lookup (struct bfd_link_hash_table *table, |
489 | const char *string, | |
490 | bfd_boolean create, | |
491 | bfd_boolean copy, | |
492 | bfd_boolean follow) | |
252b5132 RH |
493 | { |
494 | struct bfd_link_hash_entry *ret; | |
495 | ||
496 | ret = ((struct bfd_link_hash_entry *) | |
497 | bfd_hash_lookup (&table->table, string, create, copy)); | |
498 | ||
c58b9523 | 499 | if (follow && ret != NULL) |
252b5132 RH |
500 | { |
501 | while (ret->type == bfd_link_hash_indirect | |
502 | || ret->type == bfd_link_hash_warning) | |
503 | ret = ret->u.i.link; | |
504 | } | |
505 | ||
506 | return ret; | |
507 | } | |
508 | ||
509 | /* Look up a symbol in the main linker hash table if the symbol might | |
510 | be wrapped. This should only be used for references to an | |
511 | undefined symbol, not for definitions of a symbol. */ | |
512 | ||
513 | struct bfd_link_hash_entry * | |
c58b9523 AM |
514 | bfd_wrapped_link_hash_lookup (bfd *abfd, |
515 | struct bfd_link_info *info, | |
516 | const char *string, | |
517 | bfd_boolean create, | |
518 | bfd_boolean copy, | |
519 | bfd_boolean follow) | |
252b5132 | 520 | { |
dc810e39 AM |
521 | bfd_size_type amt; |
522 | ||
252b5132 RH |
523 | if (info->wrap_hash != NULL) |
524 | { | |
525 | const char *l; | |
b9cf773d | 526 | char prefix = '\0'; |
252b5132 RH |
527 | |
528 | l = string; | |
b9cf773d AM |
529 | if (*l == bfd_get_symbol_leading_char (abfd) || *l == info->wrap_char) |
530 | { | |
531 | prefix = *l; | |
532 | ++l; | |
533 | } | |
252b5132 RH |
534 | |
535 | #undef WRAP | |
536 | #define WRAP "__wrap_" | |
537 | ||
b34976b6 | 538 | if (bfd_hash_lookup (info->wrap_hash, l, FALSE, FALSE) != NULL) |
252b5132 RH |
539 | { |
540 | char *n; | |
541 | struct bfd_link_hash_entry *h; | |
542 | ||
543 | /* This symbol is being wrapped. We want to replace all | |
544 | references to SYM with references to __wrap_SYM. */ | |
545 | ||
dc810e39 | 546 | amt = strlen (l) + sizeof WRAP + 1; |
c58b9523 | 547 | n = bfd_malloc (amt); |
252b5132 RH |
548 | if (n == NULL) |
549 | return NULL; | |
550 | ||
b9cf773d | 551 | n[0] = prefix; |
252b5132 RH |
552 | n[1] = '\0'; |
553 | strcat (n, WRAP); | |
554 | strcat (n, l); | |
b34976b6 | 555 | h = bfd_link_hash_lookup (info->hash, n, create, TRUE, follow); |
252b5132 RH |
556 | free (n); |
557 | return h; | |
558 | } | |
559 | ||
560 | #undef WRAP | |
561 | ||
562 | #undef REAL | |
563 | #define REAL "__real_" | |
564 | ||
565 | if (*l == '_' | |
566 | && strncmp (l, REAL, sizeof REAL - 1) == 0 | |
567 | && bfd_hash_lookup (info->wrap_hash, l + sizeof REAL - 1, | |
b34976b6 | 568 | FALSE, FALSE) != NULL) |
252b5132 RH |
569 | { |
570 | char *n; | |
571 | struct bfd_link_hash_entry *h; | |
572 | ||
573 | /* This is a reference to __real_SYM, where SYM is being | |
574 | wrapped. We want to replace all references to __real_SYM | |
575 | with references to SYM. */ | |
576 | ||
dc810e39 | 577 | amt = strlen (l + sizeof REAL - 1) + 2; |
c58b9523 | 578 | n = bfd_malloc (amt); |
252b5132 RH |
579 | if (n == NULL) |
580 | return NULL; | |
581 | ||
b9cf773d | 582 | n[0] = prefix; |
252b5132 RH |
583 | n[1] = '\0'; |
584 | strcat (n, l + sizeof REAL - 1); | |
b34976b6 | 585 | h = bfd_link_hash_lookup (info->hash, n, create, TRUE, follow); |
252b5132 RH |
586 | free (n); |
587 | return h; | |
588 | } | |
589 | ||
590 | #undef REAL | |
591 | } | |
592 | ||
593 | return bfd_link_hash_lookup (info->hash, string, create, copy, follow); | |
594 | } | |
595 | ||
596 | /* Traverse a generic link hash table. The only reason this is not a | |
597 | macro is to do better type checking. This code presumes that an | |
598 | argument passed as a struct bfd_hash_entry * may be caught as a | |
599 | struct bfd_link_hash_entry * with no explicit cast required on the | |
600 | call. */ | |
601 | ||
509945ae | 602 | void |
c58b9523 AM |
603 | bfd_link_hash_traverse |
604 | (struct bfd_link_hash_table *table, | |
605 | bfd_boolean (*func) (struct bfd_link_hash_entry *, void *), | |
606 | void *info) | |
252b5132 RH |
607 | { |
608 | bfd_hash_traverse (&table->table, | |
c58b9523 | 609 | (bfd_boolean (*) (struct bfd_hash_entry *, void *)) func, |
252b5132 RH |
610 | info); |
611 | } | |
612 | ||
613 | /* Add a symbol to the linker hash table undefs list. */ | |
614 | ||
c58b9523 AM |
615 | void |
616 | bfd_link_add_undef (struct bfd_link_hash_table *table, | |
617 | struct bfd_link_hash_entry *h) | |
252b5132 | 618 | { |
f6e332e6 | 619 | BFD_ASSERT (h->u.undef.next == NULL); |
c58b9523 | 620 | if (table->undefs_tail != NULL) |
f6e332e6 | 621 | table->undefs_tail->u.undef.next = h; |
c58b9523 | 622 | if (table->undefs == NULL) |
252b5132 RH |
623 | table->undefs = h; |
624 | table->undefs_tail = h; | |
625 | } | |
77cfaee6 AM |
626 | |
627 | /* The undefs list was designed so that in normal use we don't need to | |
628 | remove entries. However, if symbols on the list are changed from | |
629 | bfd_link_hash_undefined to either bfd_link_hash_undefweak or | |
630 | bfd_link_hash_new for some reason, then they must be removed from the | |
631 | list. Failure to do so might result in the linker attempting to add | |
632 | the symbol to the list again at a later stage. */ | |
633 | ||
634 | void | |
635 | bfd_link_repair_undef_list (struct bfd_link_hash_table *table) | |
636 | { | |
637 | struct bfd_link_hash_entry **pun; | |
638 | ||
639 | pun = &table->undefs; | |
640 | while (*pun != NULL) | |
641 | { | |
642 | struct bfd_link_hash_entry *h = *pun; | |
643 | ||
644 | if (h->type == bfd_link_hash_new | |
645 | || h->type == bfd_link_hash_undefweak) | |
646 | { | |
647 | *pun = h->u.undef.next; | |
648 | h->u.undef.next = NULL; | |
649 | if (h == table->undefs_tail) | |
650 | { | |
651 | if (pun == &table->undefs) | |
652 | table->undefs_tail = NULL; | |
653 | else | |
654 | /* pun points at an u.undef.next field. Go back to | |
655 | the start of the link_hash_entry. */ | |
656 | table->undefs_tail = (struct bfd_link_hash_entry *) | |
657 | ((char *) pun - ((char *) &h->u.undef.next - (char *) h)); | |
658 | break; | |
659 | } | |
660 | } | |
661 | else | |
662 | pun = &h->u.undef.next; | |
663 | } | |
664 | } | |
252b5132 | 665 | \f |
19852a2a | 666 | /* Routine to create an entry in a generic link hash table. */ |
252b5132 RH |
667 | |
668 | struct bfd_hash_entry * | |
c58b9523 AM |
669 | _bfd_generic_link_hash_newfunc (struct bfd_hash_entry *entry, |
670 | struct bfd_hash_table *table, | |
671 | const char *string) | |
252b5132 | 672 | { |
252b5132 RH |
673 | /* Allocate the structure if it has not already been allocated by a |
674 | subclass. */ | |
51b64d56 AM |
675 | if (entry == NULL) |
676 | { | |
c58b9523 | 677 | entry = |
d45913a0 | 678 | bfd_hash_allocate (table, sizeof (struct generic_link_hash_entry)); |
51b64d56 AM |
679 | if (entry == NULL) |
680 | return entry; | |
681 | } | |
252b5132 RH |
682 | |
683 | /* Call the allocation method of the superclass. */ | |
51b64d56 AM |
684 | entry = _bfd_link_hash_newfunc (entry, table, string); |
685 | if (entry) | |
252b5132 | 686 | { |
51b64d56 AM |
687 | struct generic_link_hash_entry *ret; |
688 | ||
252b5132 | 689 | /* Set local fields. */ |
51b64d56 | 690 | ret = (struct generic_link_hash_entry *) entry; |
b34976b6 | 691 | ret->written = FALSE; |
252b5132 RH |
692 | ret->sym = NULL; |
693 | } | |
694 | ||
51b64d56 | 695 | return entry; |
252b5132 RH |
696 | } |
697 | ||
19852a2a | 698 | /* Create a generic link hash table. */ |
252b5132 RH |
699 | |
700 | struct bfd_link_hash_table * | |
c58b9523 | 701 | _bfd_generic_link_hash_table_create (bfd *abfd) |
252b5132 RH |
702 | { |
703 | struct generic_link_hash_table *ret; | |
dc810e39 | 704 | bfd_size_type amt = sizeof (struct generic_link_hash_table); |
252b5132 | 705 | |
c58b9523 | 706 | ret = bfd_malloc (amt); |
252b5132 | 707 | if (ret == NULL) |
c58b9523 | 708 | return NULL; |
252b5132 RH |
709 | if (! _bfd_link_hash_table_init (&ret->root, abfd, |
710 | _bfd_generic_link_hash_newfunc)) | |
711 | { | |
712 | free (ret); | |
c58b9523 | 713 | return NULL; |
252b5132 RH |
714 | } |
715 | return &ret->root; | |
716 | } | |
717 | ||
e2d34d7d | 718 | void |
c58b9523 | 719 | _bfd_generic_link_hash_table_free (struct bfd_link_hash_table *hash) |
e2d34d7d DJ |
720 | { |
721 | struct generic_link_hash_table *ret | |
722 | = (struct generic_link_hash_table *) hash; | |
723 | ||
724 | bfd_hash_table_free (&ret->root.table); | |
725 | free (ret); | |
726 | } | |
727 | ||
252b5132 RH |
728 | /* Grab the symbols for an object file when doing a generic link. We |
729 | store the symbols in the outsymbols field. We need to keep them | |
730 | around for the entire link to ensure that we only read them once. | |
731 | If we read them multiple times, we might wind up with relocs and | |
732 | the hash table pointing to different instances of the symbol | |
733 | structure. */ | |
734 | ||
b34976b6 | 735 | static bfd_boolean |
c58b9523 | 736 | generic_link_read_symbols (bfd *abfd) |
252b5132 | 737 | { |
c58b9523 | 738 | if (bfd_get_outsymbols (abfd) == NULL) |
252b5132 RH |
739 | { |
740 | long symsize; | |
741 | long symcount; | |
742 | ||
743 | symsize = bfd_get_symtab_upper_bound (abfd); | |
744 | if (symsize < 0) | |
b34976b6 | 745 | return FALSE; |
c58b9523 | 746 | bfd_get_outsymbols (abfd) = bfd_alloc (abfd, symsize); |
252b5132 | 747 | if (bfd_get_outsymbols (abfd) == NULL && symsize != 0) |
b34976b6 | 748 | return FALSE; |
252b5132 RH |
749 | symcount = bfd_canonicalize_symtab (abfd, bfd_get_outsymbols (abfd)); |
750 | if (symcount < 0) | |
b34976b6 | 751 | return FALSE; |
252b5132 RH |
752 | bfd_get_symcount (abfd) = symcount; |
753 | } | |
754 | ||
b34976b6 | 755 | return TRUE; |
252b5132 RH |
756 | } |
757 | \f | |
758 | /* Generic function to add symbols to from an object file to the | |
759 | global hash table. This version does not automatically collect | |
760 | constructors by name. */ | |
761 | ||
b34976b6 | 762 | bfd_boolean |
c58b9523 | 763 | _bfd_generic_link_add_symbols (bfd *abfd, struct bfd_link_info *info) |
252b5132 | 764 | { |
b34976b6 | 765 | return generic_link_add_symbols (abfd, info, FALSE); |
252b5132 RH |
766 | } |
767 | ||
768 | /* Generic function to add symbols from an object file to the global | |
769 | hash table. This version automatically collects constructors by | |
770 | name, as the collect2 program does. It should be used for any | |
771 | target which does not provide some other mechanism for setting up | |
772 | constructors and destructors; these are approximately those targets | |
773 | for which gcc uses collect2 and do not support stabs. */ | |
774 | ||
b34976b6 | 775 | bfd_boolean |
c58b9523 | 776 | _bfd_generic_link_add_symbols_collect (bfd *abfd, struct bfd_link_info *info) |
252b5132 | 777 | { |
b34976b6 | 778 | return generic_link_add_symbols (abfd, info, TRUE); |
252b5132 RH |
779 | } |
780 | ||
2d653fc7 AM |
781 | /* Indicate that we are only retrieving symbol values from this |
782 | section. We want the symbols to act as though the values in the | |
783 | file are absolute. */ | |
784 | ||
785 | void | |
c58b9523 AM |
786 | _bfd_generic_link_just_syms (asection *sec, |
787 | struct bfd_link_info *info ATTRIBUTE_UNUSED) | |
2d653fc7 AM |
788 | { |
789 | sec->output_section = bfd_abs_section_ptr; | |
790 | sec->output_offset = sec->vma; | |
791 | } | |
792 | ||
252b5132 RH |
793 | /* Add symbols from an object file to the global hash table. */ |
794 | ||
b34976b6 | 795 | static bfd_boolean |
c58b9523 AM |
796 | generic_link_add_symbols (bfd *abfd, |
797 | struct bfd_link_info *info, | |
798 | bfd_boolean collect) | |
252b5132 | 799 | { |
b34976b6 | 800 | bfd_boolean ret; |
252b5132 RH |
801 | |
802 | switch (bfd_get_format (abfd)) | |
803 | { | |
804 | case bfd_object: | |
805 | ret = generic_link_add_object_symbols (abfd, info, collect); | |
806 | break; | |
807 | case bfd_archive: | |
808 | ret = (_bfd_generic_link_add_archive_symbols | |
809 | (abfd, info, | |
810 | (collect | |
811 | ? generic_link_check_archive_element_collect | |
812 | : generic_link_check_archive_element_no_collect))); | |
813 | break; | |
814 | default: | |
815 | bfd_set_error (bfd_error_wrong_format); | |
b34976b6 | 816 | ret = FALSE; |
252b5132 RH |
817 | } |
818 | ||
819 | return ret; | |
820 | } | |
821 | ||
822 | /* Add symbols from an object file to the global hash table. */ | |
823 | ||
b34976b6 | 824 | static bfd_boolean |
c58b9523 AM |
825 | generic_link_add_object_symbols (bfd *abfd, |
826 | struct bfd_link_info *info, | |
827 | bfd_boolean collect) | |
252b5132 | 828 | { |
dc810e39 | 829 | bfd_size_type symcount; |
fc0a2244 | 830 | struct bfd_symbol **outsyms; |
dc810e39 | 831 | |
252b5132 | 832 | if (! generic_link_read_symbols (abfd)) |
b34976b6 | 833 | return FALSE; |
dc810e39 AM |
834 | symcount = _bfd_generic_link_get_symcount (abfd); |
835 | outsyms = _bfd_generic_link_get_symbols (abfd); | |
836 | return generic_link_add_symbol_list (abfd, info, symcount, outsyms, collect); | |
252b5132 RH |
837 | } |
838 | \f | |
839 | /* We build a hash table of all symbols defined in an archive. */ | |
840 | ||
841 | /* An archive symbol may be defined by multiple archive elements. | |
842 | This linked list is used to hold the elements. */ | |
843 | ||
844 | struct archive_list | |
845 | { | |
846 | struct archive_list *next; | |
dc810e39 | 847 | unsigned int indx; |
252b5132 RH |
848 | }; |
849 | ||
850 | /* An entry in an archive hash table. */ | |
851 | ||
852 | struct archive_hash_entry | |
853 | { | |
854 | struct bfd_hash_entry root; | |
855 | /* Where the symbol is defined. */ | |
856 | struct archive_list *defs; | |
857 | }; | |
858 | ||
859 | /* An archive hash table itself. */ | |
860 | ||
861 | struct archive_hash_table | |
862 | { | |
863 | struct bfd_hash_table table; | |
864 | }; | |
865 | ||
252b5132 RH |
866 | /* Create a new entry for an archive hash table. */ |
867 | ||
868 | static struct bfd_hash_entry * | |
c58b9523 AM |
869 | archive_hash_newfunc (struct bfd_hash_entry *entry, |
870 | struct bfd_hash_table *table, | |
871 | const char *string) | |
252b5132 RH |
872 | { |
873 | struct archive_hash_entry *ret = (struct archive_hash_entry *) entry; | |
874 | ||
875 | /* Allocate the structure if it has not already been allocated by a | |
876 | subclass. */ | |
c58b9523 AM |
877 | if (ret == NULL) |
878 | ret = bfd_hash_allocate (table, sizeof (struct archive_hash_entry)); | |
879 | if (ret == NULL) | |
252b5132 RH |
880 | return NULL; |
881 | ||
882 | /* Call the allocation method of the superclass. */ | |
883 | ret = ((struct archive_hash_entry *) | |
884 | bfd_hash_newfunc ((struct bfd_hash_entry *) ret, table, string)); | |
885 | ||
886 | if (ret) | |
887 | { | |
888 | /* Initialize the local fields. */ | |
c58b9523 | 889 | ret->defs = NULL; |
252b5132 RH |
890 | } |
891 | ||
c58b9523 | 892 | return &ret->root; |
252b5132 RH |
893 | } |
894 | ||
895 | /* Initialize an archive hash table. */ | |
896 | ||
b34976b6 | 897 | static bfd_boolean |
c58b9523 AM |
898 | archive_hash_table_init |
899 | (struct archive_hash_table *table, | |
900 | struct bfd_hash_entry *(*newfunc) (struct bfd_hash_entry *, | |
901 | struct bfd_hash_table *, | |
902 | const char *)) | |
252b5132 RH |
903 | { |
904 | return bfd_hash_table_init (&table->table, newfunc); | |
905 | } | |
906 | ||
907 | /* Look up an entry in an archive hash table. */ | |
908 | ||
909 | #define archive_hash_lookup(t, string, create, copy) \ | |
910 | ((struct archive_hash_entry *) \ | |
911 | bfd_hash_lookup (&(t)->table, (string), (create), (copy))) | |
912 | ||
913 | /* Allocate space in an archive hash table. */ | |
914 | ||
915 | #define archive_hash_allocate(t, size) bfd_hash_allocate (&(t)->table, (size)) | |
916 | ||
917 | /* Free an archive hash table. */ | |
918 | ||
919 | #define archive_hash_table_free(t) bfd_hash_table_free (&(t)->table) | |
920 | ||
921 | /* Generic function to add symbols from an archive file to the global | |
922 | hash file. This function presumes that the archive symbol table | |
923 | has already been read in (this is normally done by the | |
924 | bfd_check_format entry point). It looks through the undefined and | |
925 | common symbols and searches the archive symbol table for them. If | |
926 | it finds an entry, it includes the associated object file in the | |
927 | link. | |
928 | ||
929 | The old linker looked through the archive symbol table for | |
930 | undefined symbols. We do it the other way around, looking through | |
931 | undefined symbols for symbols defined in the archive. The | |
932 | advantage of the newer scheme is that we only have to look through | |
933 | the list of undefined symbols once, whereas the old method had to | |
934 | re-search the symbol table each time a new object file was added. | |
935 | ||
936 | The CHECKFN argument is used to see if an object file should be | |
b34976b6 | 937 | included. CHECKFN should set *PNEEDED to TRUE if the object file |
252b5132 RH |
938 | should be included, and must also call the bfd_link_info |
939 | add_archive_element callback function and handle adding the symbols | |
b34976b6 | 940 | to the global hash table. CHECKFN should only return FALSE if some |
252b5132 RH |
941 | sort of error occurs. |
942 | ||
943 | For some formats, such as a.out, it is possible to look through an | |
944 | object file but not actually include it in the link. The | |
945 | archive_pass field in a BFD is used to avoid checking the symbols | |
946 | of an object files too many times. When an object is included in | |
947 | the link, archive_pass is set to -1. If an object is scanned but | |
948 | not included, archive_pass is set to the pass number. The pass | |
949 | number is incremented each time a new object file is included. The | |
950 | pass number is used because when a new object file is included it | |
951 | may create new undefined symbols which cause a previously examined | |
952 | object file to be included. */ | |
953 | ||
b34976b6 | 954 | bfd_boolean |
c58b9523 AM |
955 | _bfd_generic_link_add_archive_symbols |
956 | (bfd *abfd, | |
957 | struct bfd_link_info *info, | |
958 | bfd_boolean (*checkfn) (bfd *, struct bfd_link_info *, bfd_boolean *)) | |
252b5132 RH |
959 | { |
960 | carsym *arsyms; | |
961 | carsym *arsym_end; | |
962 | register carsym *arsym; | |
963 | int pass; | |
964 | struct archive_hash_table arsym_hash; | |
dc810e39 | 965 | unsigned int indx; |
252b5132 RH |
966 | struct bfd_link_hash_entry **pundef; |
967 | ||
968 | if (! bfd_has_map (abfd)) | |
969 | { | |
970 | /* An empty archive is a special case. */ | |
c58b9523 | 971 | if (bfd_openr_next_archived_file (abfd, NULL) == NULL) |
b34976b6 | 972 | return TRUE; |
252b5132 | 973 | bfd_set_error (bfd_error_no_armap); |
b34976b6 | 974 | return FALSE; |
252b5132 RH |
975 | } |
976 | ||
977 | arsyms = bfd_ardata (abfd)->symdefs; | |
978 | arsym_end = arsyms + bfd_ardata (abfd)->symdef_count; | |
979 | ||
980 | /* In order to quickly determine whether an symbol is defined in | |
981 | this archive, we build a hash table of the symbols. */ | |
982 | if (! archive_hash_table_init (&arsym_hash, archive_hash_newfunc)) | |
b34976b6 | 983 | return FALSE; |
252b5132 RH |
984 | for (arsym = arsyms, indx = 0; arsym < arsym_end; arsym++, indx++) |
985 | { | |
986 | struct archive_hash_entry *arh; | |
987 | struct archive_list *l, **pp; | |
988 | ||
b34976b6 | 989 | arh = archive_hash_lookup (&arsym_hash, arsym->name, TRUE, FALSE); |
c58b9523 | 990 | if (arh == NULL) |
252b5132 RH |
991 | goto error_return; |
992 | l = ((struct archive_list *) | |
993 | archive_hash_allocate (&arsym_hash, sizeof (struct archive_list))); | |
994 | if (l == NULL) | |
995 | goto error_return; | |
996 | l->indx = indx; | |
c58b9523 | 997 | for (pp = &arh->defs; *pp != NULL; pp = &(*pp)->next) |
252b5132 RH |
998 | ; |
999 | *pp = l; | |
1000 | l->next = NULL; | |
1001 | } | |
1002 | ||
1003 | /* The archive_pass field in the archive itself is used to | |
1004 | initialize PASS, sine we may search the same archive multiple | |
1005 | times. */ | |
1006 | pass = abfd->archive_pass + 1; | |
1007 | ||
1008 | /* New undefined symbols are added to the end of the list, so we | |
1009 | only need to look through it once. */ | |
1010 | pundef = &info->hash->undefs; | |
c58b9523 | 1011 | while (*pundef != NULL) |
252b5132 RH |
1012 | { |
1013 | struct bfd_link_hash_entry *h; | |
1014 | struct archive_hash_entry *arh; | |
1015 | struct archive_list *l; | |
1016 | ||
1017 | h = *pundef; | |
1018 | ||
1019 | /* When a symbol is defined, it is not necessarily removed from | |
1020 | the list. */ | |
1021 | if (h->type != bfd_link_hash_undefined | |
1022 | && h->type != bfd_link_hash_common) | |
1023 | { | |
1024 | /* Remove this entry from the list, for general cleanliness | |
1025 | and because we are going to look through the list again | |
1026 | if we search any more libraries. We can't remove the | |
1027 | entry if it is the tail, because that would lose any | |
1028 | entries we add to the list later on (it would also cause | |
1029 | us to lose track of whether the symbol has been | |
1030 | referenced). */ | |
1031 | if (*pundef != info->hash->undefs_tail) | |
f6e332e6 | 1032 | *pundef = (*pundef)->u.undef.next; |
252b5132 | 1033 | else |
f6e332e6 | 1034 | pundef = &(*pundef)->u.undef.next; |
252b5132 RH |
1035 | continue; |
1036 | } | |
1037 | ||
1038 | /* Look for this symbol in the archive symbol map. */ | |
b34976b6 | 1039 | arh = archive_hash_lookup (&arsym_hash, h->root.string, FALSE, FALSE); |
c58b9523 | 1040 | if (arh == NULL) |
252b5132 | 1041 | { |
dc810e39 | 1042 | /* If we haven't found the exact symbol we're looking for, |
8ceb7a1b CW |
1043 | let's look for its import thunk */ |
1044 | if (info->pei386_auto_import) | |
1045 | { | |
dc810e39 | 1046 | bfd_size_type amt = strlen (h->root.string) + 10; |
c58b9523 | 1047 | char *buf = bfd_malloc (amt); |
f6be24f9 | 1048 | if (buf == NULL) |
b34976b6 | 1049 | return FALSE; |
f6be24f9 | 1050 | |
8ceb7a1b | 1051 | sprintf (buf, "__imp_%s", h->root.string); |
b34976b6 | 1052 | arh = archive_hash_lookup (&arsym_hash, buf, FALSE, FALSE); |
f6be24f9 | 1053 | free(buf); |
8ceb7a1b | 1054 | } |
c58b9523 | 1055 | if (arh == NULL) |
8ceb7a1b | 1056 | { |
f6e332e6 | 1057 | pundef = &(*pundef)->u.undef.next; |
8ceb7a1b CW |
1058 | continue; |
1059 | } | |
252b5132 | 1060 | } |
252b5132 | 1061 | /* Look at all the objects which define this symbol. */ |
c58b9523 | 1062 | for (l = arh->defs; l != NULL; l = l->next) |
252b5132 RH |
1063 | { |
1064 | bfd *element; | |
b34976b6 | 1065 | bfd_boolean needed; |
252b5132 RH |
1066 | |
1067 | /* If the symbol has gotten defined along the way, quit. */ | |
1068 | if (h->type != bfd_link_hash_undefined | |
1069 | && h->type != bfd_link_hash_common) | |
1070 | break; | |
1071 | ||
1072 | element = bfd_get_elt_at_index (abfd, l->indx); | |
c58b9523 | 1073 | if (element == NULL) |
252b5132 RH |
1074 | goto error_return; |
1075 | ||
1076 | /* If we've already included this element, or if we've | |
1077 | already checked it on this pass, continue. */ | |
1078 | if (element->archive_pass == -1 | |
1079 | || element->archive_pass == pass) | |
1080 | continue; | |
1081 | ||
1082 | /* If we can't figure this element out, just ignore it. */ | |
1083 | if (! bfd_check_format (element, bfd_object)) | |
1084 | { | |
1085 | element->archive_pass = -1; | |
1086 | continue; | |
1087 | } | |
1088 | ||
1089 | /* CHECKFN will see if this element should be included, and | |
1090 | go ahead and include it if appropriate. */ | |
1091 | if (! (*checkfn) (element, info, &needed)) | |
1092 | goto error_return; | |
1093 | ||
1094 | if (! needed) | |
1095 | element->archive_pass = pass; | |
1096 | else | |
1097 | { | |
1098 | element->archive_pass = -1; | |
1099 | ||
1100 | /* Increment the pass count to show that we may need to | |
1101 | recheck object files which were already checked. */ | |
1102 | ++pass; | |
1103 | } | |
1104 | } | |
1105 | ||
f6e332e6 | 1106 | pundef = &(*pundef)->u.undef.next; |
252b5132 RH |
1107 | } |
1108 | ||
1109 | archive_hash_table_free (&arsym_hash); | |
1110 | ||
1111 | /* Save PASS in case we are called again. */ | |
1112 | abfd->archive_pass = pass; | |
1113 | ||
b34976b6 | 1114 | return TRUE; |
252b5132 RH |
1115 | |
1116 | error_return: | |
1117 | archive_hash_table_free (&arsym_hash); | |
b34976b6 | 1118 | return FALSE; |
252b5132 RH |
1119 | } |
1120 | \f | |
1121 | /* See if we should include an archive element. This version is used | |
1122 | when we do not want to automatically collect constructors based on | |
1123 | the symbol name, presumably because we have some other mechanism | |
1124 | for finding them. */ | |
1125 | ||
b34976b6 | 1126 | static bfd_boolean |
c58b9523 AM |
1127 | generic_link_check_archive_element_no_collect ( |
1128 | bfd *abfd, | |
1129 | struct bfd_link_info *info, | |
1130 | bfd_boolean *pneeded) | |
252b5132 | 1131 | { |
b34976b6 | 1132 | return generic_link_check_archive_element (abfd, info, pneeded, FALSE); |
252b5132 RH |
1133 | } |
1134 | ||
1135 | /* See if we should include an archive element. This version is used | |
1136 | when we want to automatically collect constructors based on the | |
1137 | symbol name, as collect2 does. */ | |
1138 | ||
b34976b6 | 1139 | static bfd_boolean |
c58b9523 AM |
1140 | generic_link_check_archive_element_collect (bfd *abfd, |
1141 | struct bfd_link_info *info, | |
1142 | bfd_boolean *pneeded) | |
252b5132 | 1143 | { |
b34976b6 | 1144 | return generic_link_check_archive_element (abfd, info, pneeded, TRUE); |
252b5132 RH |
1145 | } |
1146 | ||
1147 | /* See if we should include an archive element. Optionally collect | |
1148 | constructors. */ | |
1149 | ||
b34976b6 | 1150 | static bfd_boolean |
c58b9523 AM |
1151 | generic_link_check_archive_element (bfd *abfd, |
1152 | struct bfd_link_info *info, | |
1153 | bfd_boolean *pneeded, | |
1154 | bfd_boolean collect) | |
252b5132 RH |
1155 | { |
1156 | asymbol **pp, **ppend; | |
1157 | ||
b34976b6 | 1158 | *pneeded = FALSE; |
252b5132 RH |
1159 | |
1160 | if (! generic_link_read_symbols (abfd)) | |
b34976b6 | 1161 | return FALSE; |
252b5132 RH |
1162 | |
1163 | pp = _bfd_generic_link_get_symbols (abfd); | |
1164 | ppend = pp + _bfd_generic_link_get_symcount (abfd); | |
1165 | for (; pp < ppend; pp++) | |
1166 | { | |
1167 | asymbol *p; | |
1168 | struct bfd_link_hash_entry *h; | |
1169 | ||
1170 | p = *pp; | |
1171 | ||
1172 | /* We are only interested in globally visible symbols. */ | |
1173 | if (! bfd_is_com_section (p->section) | |
1174 | && (p->flags & (BSF_GLOBAL | BSF_INDIRECT | BSF_WEAK)) == 0) | |
1175 | continue; | |
1176 | ||
1177 | /* We are only interested if we know something about this | |
1178 | symbol, and it is undefined or common. An undefined weak | |
1179 | symbol (type bfd_link_hash_undefweak) is not considered to be | |
1180 | a reference when pulling files out of an archive. See the | |
1181 | SVR4 ABI, p. 4-27. */ | |
b34976b6 AM |
1182 | h = bfd_link_hash_lookup (info->hash, bfd_asymbol_name (p), FALSE, |
1183 | FALSE, TRUE); | |
c58b9523 | 1184 | if (h == NULL |
252b5132 RH |
1185 | || (h->type != bfd_link_hash_undefined |
1186 | && h->type != bfd_link_hash_common)) | |
1187 | continue; | |
1188 | ||
1189 | /* P is a symbol we are looking for. */ | |
1190 | ||
1191 | if (! bfd_is_com_section (p->section)) | |
1192 | { | |
1193 | bfd_size_type symcount; | |
1194 | asymbol **symbols; | |
1195 | ||
1196 | /* This object file defines this symbol, so pull it in. */ | |
1197 | if (! (*info->callbacks->add_archive_element) (info, abfd, | |
1198 | bfd_asymbol_name (p))) | |
b34976b6 | 1199 | return FALSE; |
252b5132 RH |
1200 | symcount = _bfd_generic_link_get_symcount (abfd); |
1201 | symbols = _bfd_generic_link_get_symbols (abfd); | |
1202 | if (! generic_link_add_symbol_list (abfd, info, symcount, | |
1203 | symbols, collect)) | |
b34976b6 AM |
1204 | return FALSE; |
1205 | *pneeded = TRUE; | |
1206 | return TRUE; | |
252b5132 RH |
1207 | } |
1208 | ||
1209 | /* P is a common symbol. */ | |
1210 | ||
1211 | if (h->type == bfd_link_hash_undefined) | |
1212 | { | |
1213 | bfd *symbfd; | |
1214 | bfd_vma size; | |
1215 | unsigned int power; | |
1216 | ||
1217 | symbfd = h->u.undef.abfd; | |
c58b9523 | 1218 | if (symbfd == NULL) |
252b5132 RH |
1219 | { |
1220 | /* This symbol was created as undefined from outside | |
1221 | BFD. We assume that we should link in the object | |
1222 | file. This is for the -u option in the linker. */ | |
1223 | if (! (*info->callbacks->add_archive_element) | |
1224 | (info, abfd, bfd_asymbol_name (p))) | |
b34976b6 AM |
1225 | return FALSE; |
1226 | *pneeded = TRUE; | |
1227 | return TRUE; | |
252b5132 RH |
1228 | } |
1229 | ||
1230 | /* Turn the symbol into a common symbol but do not link in | |
1231 | the object file. This is how a.out works. Object | |
1232 | formats that require different semantics must implement | |
1233 | this function differently. This symbol is already on the | |
1234 | undefs list. We add the section to a common section | |
1235 | attached to symbfd to ensure that it is in a BFD which | |
1236 | will be linked in. */ | |
1237 | h->type = bfd_link_hash_common; | |
1238 | h->u.c.p = | |
c58b9523 AM |
1239 | bfd_hash_allocate (&info->hash->table, |
1240 | sizeof (struct bfd_link_hash_common_entry)); | |
252b5132 | 1241 | if (h->u.c.p == NULL) |
b34976b6 | 1242 | return FALSE; |
252b5132 RH |
1243 | |
1244 | size = bfd_asymbol_value (p); | |
1245 | h->u.c.size = size; | |
1246 | ||
1247 | power = bfd_log2 (size); | |
1248 | if (power > 4) | |
1249 | power = 4; | |
1250 | h->u.c.p->alignment_power = power; | |
1251 | ||
1252 | if (p->section == bfd_com_section_ptr) | |
1253 | h->u.c.p->section = bfd_make_section_old_way (symbfd, "COMMON"); | |
1254 | else | |
1255 | h->u.c.p->section = bfd_make_section_old_way (symbfd, | |
1256 | p->section->name); | |
1257 | h->u.c.p->section->flags = SEC_ALLOC; | |
1258 | } | |
1259 | else | |
1260 | { | |
1261 | /* Adjust the size of the common symbol if necessary. This | |
1262 | is how a.out works. Object formats that require | |
1263 | different semantics must implement this function | |
1264 | differently. */ | |
1265 | if (bfd_asymbol_value (p) > h->u.c.size) | |
1266 | h->u.c.size = bfd_asymbol_value (p); | |
1267 | } | |
1268 | } | |
1269 | ||
1270 | /* This archive element is not needed. */ | |
b34976b6 | 1271 | return TRUE; |
252b5132 RH |
1272 | } |
1273 | ||
1274 | /* Add the symbols from an object file to the global hash table. ABFD | |
1275 | is the object file. INFO is the linker information. SYMBOL_COUNT | |
1276 | is the number of symbols. SYMBOLS is the list of symbols. COLLECT | |
b34976b6 | 1277 | is TRUE if constructors should be automatically collected by name |
252b5132 RH |
1278 | as is done by collect2. */ |
1279 | ||
b34976b6 | 1280 | static bfd_boolean |
c58b9523 AM |
1281 | generic_link_add_symbol_list (bfd *abfd, |
1282 | struct bfd_link_info *info, | |
1283 | bfd_size_type symbol_count, | |
1284 | asymbol **symbols, | |
1285 | bfd_boolean collect) | |
252b5132 RH |
1286 | { |
1287 | asymbol **pp, **ppend; | |
1288 | ||
1289 | pp = symbols; | |
1290 | ppend = symbols + symbol_count; | |
1291 | for (; pp < ppend; pp++) | |
1292 | { | |
1293 | asymbol *p; | |
1294 | ||
1295 | p = *pp; | |
1296 | ||
1297 | if ((p->flags & (BSF_INDIRECT | |
1298 | | BSF_WARNING | |
1299 | | BSF_GLOBAL | |
1300 | | BSF_CONSTRUCTOR | |
1301 | | BSF_WEAK)) != 0 | |
1302 | || bfd_is_und_section (bfd_get_section (p)) | |
1303 | || bfd_is_com_section (bfd_get_section (p)) | |
1304 | || bfd_is_ind_section (bfd_get_section (p))) | |
1305 | { | |
1306 | const char *name; | |
1307 | const char *string; | |
1308 | struct generic_link_hash_entry *h; | |
14a793b2 | 1309 | struct bfd_link_hash_entry *bh; |
252b5132 RH |
1310 | |
1311 | name = bfd_asymbol_name (p); | |
1312 | if (((p->flags & BSF_INDIRECT) != 0 | |
1313 | || bfd_is_ind_section (p->section)) | |
1314 | && pp + 1 < ppend) | |
1315 | { | |
1316 | pp++; | |
1317 | string = bfd_asymbol_name (*pp); | |
1318 | } | |
1319 | else if ((p->flags & BSF_WARNING) != 0 | |
1320 | && pp + 1 < ppend) | |
1321 | { | |
1322 | /* The name of P is actually the warning string, and the | |
1323 | next symbol is the one to warn about. */ | |
1324 | string = name; | |
1325 | pp++; | |
1326 | name = bfd_asymbol_name (*pp); | |
1327 | } | |
1328 | else | |
1329 | string = NULL; | |
1330 | ||
14a793b2 | 1331 | bh = NULL; |
252b5132 RH |
1332 | if (! (_bfd_generic_link_add_one_symbol |
1333 | (info, abfd, name, p->flags, bfd_get_section (p), | |
b34976b6 AM |
1334 | p->value, string, FALSE, collect, &bh))) |
1335 | return FALSE; | |
14a793b2 | 1336 | h = (struct generic_link_hash_entry *) bh; |
252b5132 RH |
1337 | |
1338 | /* If this is a constructor symbol, and the linker didn't do | |
1339 | anything with it, then we want to just pass the symbol | |
1340 | through to the output file. This will happen when | |
1341 | linking with -r. */ | |
1342 | if ((p->flags & BSF_CONSTRUCTOR) != 0 | |
1343 | && (h == NULL || h->root.type == bfd_link_hash_new)) | |
1344 | { | |
1345 | p->udata.p = NULL; | |
1346 | continue; | |
1347 | } | |
1348 | ||
1349 | /* Save the BFD symbol so that we don't lose any backend | |
1350 | specific information that may be attached to it. We only | |
1351 | want this one if it gives more information than the | |
1352 | existing one; we don't want to replace a defined symbol | |
1353 | with an undefined one. This routine may be called with a | |
1354 | hash table other than the generic hash table, so we only | |
1355 | do this if we are certain that the hash table is a | |
1356 | generic one. */ | |
1357 | if (info->hash->creator == abfd->xvec) | |
1358 | { | |
c58b9523 | 1359 | if (h->sym == NULL |
252b5132 RH |
1360 | || (! bfd_is_und_section (bfd_get_section (p)) |
1361 | && (! bfd_is_com_section (bfd_get_section (p)) | |
1362 | || bfd_is_und_section (bfd_get_section (h->sym))))) | |
1363 | { | |
1364 | h->sym = p; | |
1365 | /* BSF_OLD_COMMON is a hack to support COFF reloc | |
1366 | reading, and it should go away when the COFF | |
1367 | linker is switched to the new version. */ | |
1368 | if (bfd_is_com_section (bfd_get_section (p))) | |
1369 | p->flags |= BSF_OLD_COMMON; | |
1370 | } | |
1371 | } | |
1372 | ||
1373 | /* Store a back pointer from the symbol to the hash | |
1374 | table entry for the benefit of relaxation code until | |
1375 | it gets rewritten to not use asymbol structures. | |
1376 | Setting this is also used to check whether these | |
1377 | symbols were set up by the generic linker. */ | |
c58b9523 | 1378 | p->udata.p = h; |
252b5132 RH |
1379 | } |
1380 | } | |
1381 | ||
b34976b6 | 1382 | return TRUE; |
252b5132 RH |
1383 | } |
1384 | \f | |
1385 | /* We use a state table to deal with adding symbols from an object | |
1386 | file. The first index into the state table describes the symbol | |
1387 | from the object file. The second index into the state table is the | |
1388 | type of the symbol in the hash table. */ | |
1389 | ||
1390 | /* The symbol from the object file is turned into one of these row | |
1391 | values. */ | |
1392 | ||
1393 | enum link_row | |
1394 | { | |
1395 | UNDEF_ROW, /* Undefined. */ | |
1396 | UNDEFW_ROW, /* Weak undefined. */ | |
1397 | DEF_ROW, /* Defined. */ | |
1398 | DEFW_ROW, /* Weak defined. */ | |
1399 | COMMON_ROW, /* Common. */ | |
1400 | INDR_ROW, /* Indirect. */ | |
1401 | WARN_ROW, /* Warning. */ | |
1402 | SET_ROW /* Member of set. */ | |
1403 | }; | |
1404 | ||
1405 | /* apparently needed for Hitachi 3050R(HI-UX/WE2)? */ | |
1406 | #undef FAIL | |
1407 | ||
1408 | /* The actions to take in the state table. */ | |
1409 | ||
1410 | enum link_action | |
1411 | { | |
509945ae | 1412 | FAIL, /* Abort. */ |
252b5132 RH |
1413 | UND, /* Mark symbol undefined. */ |
1414 | WEAK, /* Mark symbol weak undefined. */ | |
1415 | DEF, /* Mark symbol defined. */ | |
1416 | DEFW, /* Mark symbol weak defined. */ | |
1417 | COM, /* Mark symbol common. */ | |
1418 | REF, /* Mark defined symbol referenced. */ | |
1419 | CREF, /* Possibly warn about common reference to defined symbol. */ | |
1420 | CDEF, /* Define existing common symbol. */ | |
1421 | NOACT, /* No action. */ | |
1422 | BIG, /* Mark symbol common using largest size. */ | |
1423 | MDEF, /* Multiple definition error. */ | |
1424 | MIND, /* Multiple indirect symbols. */ | |
1425 | IND, /* Make indirect symbol. */ | |
1426 | CIND, /* Make indirect symbol from existing common symbol. */ | |
1427 | SET, /* Add value to set. */ | |
1428 | MWARN, /* Make warning symbol. */ | |
1429 | WARN, /* Issue warning. */ | |
1430 | CWARN, /* Warn if referenced, else MWARN. */ | |
1431 | CYCLE, /* Repeat with symbol pointed to. */ | |
1432 | REFC, /* Mark indirect symbol referenced and then CYCLE. */ | |
1433 | WARNC /* Issue warning and then CYCLE. */ | |
1434 | }; | |
1435 | ||
1436 | /* The state table itself. The first index is a link_row and the | |
1437 | second index is a bfd_link_hash_type. */ | |
1438 | ||
1439 | static const enum link_action link_action[8][8] = | |
1440 | { | |
1441 | /* current\prev new undef undefw def defw com indr warn */ | |
1442 | /* UNDEF_ROW */ {UND, NOACT, UND, REF, REF, NOACT, REFC, WARNC }, | |
1443 | /* UNDEFW_ROW */ {WEAK, NOACT, NOACT, REF, REF, NOACT, REFC, WARNC }, | |
1444 | /* DEF_ROW */ {DEF, DEF, DEF, MDEF, DEF, CDEF, MDEF, CYCLE }, | |
1445 | /* DEFW_ROW */ {DEFW, DEFW, DEFW, NOACT, NOACT, NOACT, NOACT, CYCLE }, | |
146f1a87 | 1446 | /* COMMON_ROW */ {COM, COM, COM, CREF, COM, BIG, REFC, WARNC }, |
252b5132 | 1447 | /* INDR_ROW */ {IND, IND, IND, MDEF, IND, CIND, MIND, CYCLE }, |
e92d460e | 1448 | /* WARN_ROW */ {MWARN, WARN, WARN, CWARN, CWARN, WARN, CWARN, NOACT }, |
252b5132 RH |
1449 | /* SET_ROW */ {SET, SET, SET, SET, SET, SET, CYCLE, CYCLE } |
1450 | }; | |
1451 | ||
1452 | /* Most of the entries in the LINK_ACTION table are straightforward, | |
1453 | but a few are somewhat subtle. | |
1454 | ||
1455 | A reference to an indirect symbol (UNDEF_ROW/indr or | |
1456 | UNDEFW_ROW/indr) is counted as a reference both to the indirect | |
1457 | symbol and to the symbol the indirect symbol points to. | |
1458 | ||
1459 | A reference to a warning symbol (UNDEF_ROW/warn or UNDEFW_ROW/warn) | |
1460 | causes the warning to be issued. | |
1461 | ||
1462 | A common definition of an indirect symbol (COMMON_ROW/indr) is | |
1463 | treated as a multiple definition error. Likewise for an indirect | |
1464 | definition of a common symbol (INDR_ROW/com). | |
1465 | ||
1466 | An indirect definition of a warning (INDR_ROW/warn) does not cause | |
1467 | the warning to be issued. | |
1468 | ||
1469 | If a warning is created for an indirect symbol (WARN_ROW/indr) no | |
1470 | warning is created for the symbol the indirect symbol points to. | |
1471 | ||
1472 | Adding an entry to a set does not count as a reference to a set, | |
1473 | and no warning is issued (SET_ROW/warn). */ | |
1474 | ||
1475 | /* Return the BFD in which a hash entry has been defined, if known. */ | |
1476 | ||
1477 | static bfd * | |
c58b9523 | 1478 | hash_entry_bfd (struct bfd_link_hash_entry *h) |
252b5132 RH |
1479 | { |
1480 | while (h->type == bfd_link_hash_warning) | |
1481 | h = h->u.i.link; | |
1482 | switch (h->type) | |
1483 | { | |
1484 | default: | |
1485 | return NULL; | |
1486 | case bfd_link_hash_undefined: | |
1487 | case bfd_link_hash_undefweak: | |
1488 | return h->u.undef.abfd; | |
1489 | case bfd_link_hash_defined: | |
1490 | case bfd_link_hash_defweak: | |
1491 | return h->u.def.section->owner; | |
1492 | case bfd_link_hash_common: | |
1493 | return h->u.c.p->section->owner; | |
1494 | } | |
1495 | /*NOTREACHED*/ | |
1496 | } | |
1497 | ||
1498 | /* Add a symbol to the global hash table. | |
1499 | ABFD is the BFD the symbol comes from. | |
1500 | NAME is the name of the symbol. | |
1501 | FLAGS is the BSF_* bits associated with the symbol. | |
1502 | SECTION is the section in which the symbol is defined; this may be | |
1503 | bfd_und_section_ptr or bfd_com_section_ptr. | |
1504 | VALUE is the value of the symbol, relative to the section. | |
1505 | STRING is used for either an indirect symbol, in which case it is | |
1506 | the name of the symbol to indirect to, or a warning symbol, in | |
1507 | which case it is the warning string. | |
b34976b6 | 1508 | COPY is TRUE if NAME or STRING must be copied into locally |
252b5132 | 1509 | allocated memory if they need to be saved. |
b34976b6 | 1510 | COLLECT is TRUE if we should automatically collect gcc constructor |
252b5132 RH |
1511 | or destructor names as collect2 does. |
1512 | HASHP, if not NULL, is a place to store the created hash table | |
1513 | entry; if *HASHP is not NULL, the caller has already looked up | |
509945ae | 1514 | the hash table entry, and stored it in *HASHP. */ |
252b5132 | 1515 | |
b34976b6 | 1516 | bfd_boolean |
c58b9523 AM |
1517 | _bfd_generic_link_add_one_symbol (struct bfd_link_info *info, |
1518 | bfd *abfd, | |
1519 | const char *name, | |
1520 | flagword flags, | |
1521 | asection *section, | |
1522 | bfd_vma value, | |
1523 | const char *string, | |
1524 | bfd_boolean copy, | |
1525 | bfd_boolean collect, | |
1526 | struct bfd_link_hash_entry **hashp) | |
252b5132 RH |
1527 | { |
1528 | enum link_row row; | |
1529 | struct bfd_link_hash_entry *h; | |
b34976b6 | 1530 | bfd_boolean cycle; |
252b5132 RH |
1531 | |
1532 | if (bfd_is_ind_section (section) | |
1533 | || (flags & BSF_INDIRECT) != 0) | |
1534 | row = INDR_ROW; | |
1535 | else if ((flags & BSF_WARNING) != 0) | |
1536 | row = WARN_ROW; | |
1537 | else if ((flags & BSF_CONSTRUCTOR) != 0) | |
1538 | row = SET_ROW; | |
1539 | else if (bfd_is_und_section (section)) | |
1540 | { | |
1541 | if ((flags & BSF_WEAK) != 0) | |
1542 | row = UNDEFW_ROW; | |
1543 | else | |
1544 | row = UNDEF_ROW; | |
1545 | } | |
1546 | else if ((flags & BSF_WEAK) != 0) | |
1547 | row = DEFW_ROW; | |
1548 | else if (bfd_is_com_section (section)) | |
1549 | row = COMMON_ROW; | |
1550 | else | |
1551 | row = DEF_ROW; | |
1552 | ||
1553 | if (hashp != NULL && *hashp != NULL) | |
1554 | h = *hashp; | |
1555 | else | |
1556 | { | |
1557 | if (row == UNDEF_ROW || row == UNDEFW_ROW) | |
b34976b6 | 1558 | h = bfd_wrapped_link_hash_lookup (abfd, info, name, TRUE, copy, FALSE); |
252b5132 | 1559 | else |
b34976b6 | 1560 | h = bfd_link_hash_lookup (info->hash, name, TRUE, copy, FALSE); |
252b5132 RH |
1561 | if (h == NULL) |
1562 | { | |
1563 | if (hashp != NULL) | |
1564 | *hashp = NULL; | |
b34976b6 | 1565 | return FALSE; |
252b5132 RH |
1566 | } |
1567 | } | |
1568 | ||
1569 | if (info->notice_all | |
c58b9523 AM |
1570 | || (info->notice_hash != NULL |
1571 | && bfd_hash_lookup (info->notice_hash, name, FALSE, FALSE) != NULL)) | |
252b5132 RH |
1572 | { |
1573 | if (! (*info->callbacks->notice) (info, h->root.string, abfd, section, | |
1574 | value)) | |
b34976b6 | 1575 | return FALSE; |
252b5132 RH |
1576 | } |
1577 | ||
c58b9523 | 1578 | if (hashp != NULL) |
252b5132 RH |
1579 | *hashp = h; |
1580 | ||
1581 | do | |
1582 | { | |
1583 | enum link_action action; | |
1584 | ||
b34976b6 | 1585 | cycle = FALSE; |
252b5132 RH |
1586 | action = link_action[(int) row][(int) h->type]; |
1587 | switch (action) | |
1588 | { | |
1589 | case FAIL: | |
1590 | abort (); | |
1591 | ||
1592 | case NOACT: | |
1593 | /* Do nothing. */ | |
1594 | break; | |
1595 | ||
1596 | case UND: | |
1597 | /* Make a new undefined symbol. */ | |
1598 | h->type = bfd_link_hash_undefined; | |
1599 | h->u.undef.abfd = abfd; | |
1600 | bfd_link_add_undef (info->hash, h); | |
1601 | break; | |
1602 | ||
1603 | case WEAK: | |
1604 | /* Make a new weak undefined symbol. */ | |
1605 | h->type = bfd_link_hash_undefweak; | |
1606 | h->u.undef.abfd = abfd; | |
11f25ea6 | 1607 | h->u.undef.weak = abfd; |
252b5132 RH |
1608 | break; |
1609 | ||
1610 | case CDEF: | |
1611 | /* We have found a definition for a symbol which was | |
1612 | previously common. */ | |
1613 | BFD_ASSERT (h->type == bfd_link_hash_common); | |
1614 | if (! ((*info->callbacks->multiple_common) | |
1615 | (info, h->root.string, | |
1616 | h->u.c.p->section->owner, bfd_link_hash_common, h->u.c.size, | |
c58b9523 | 1617 | abfd, bfd_link_hash_defined, 0))) |
b34976b6 | 1618 | return FALSE; |
252b5132 RH |
1619 | /* Fall through. */ |
1620 | case DEF: | |
1621 | case DEFW: | |
1622 | { | |
1623 | enum bfd_link_hash_type oldtype; | |
1624 | ||
1625 | /* Define a symbol. */ | |
1626 | oldtype = h->type; | |
1627 | if (action == DEFW) | |
1628 | h->type = bfd_link_hash_defweak; | |
1629 | else | |
1630 | h->type = bfd_link_hash_defined; | |
1631 | h->u.def.section = section; | |
1632 | h->u.def.value = value; | |
1633 | ||
1634 | /* If we have been asked to, we act like collect2 and | |
1635 | identify all functions that might be global | |
1636 | constructors and destructors and pass them up in a | |
1637 | callback. We only do this for certain object file | |
1638 | types, since many object file types can handle this | |
1639 | automatically. */ | |
1640 | if (collect && name[0] == '_') | |
1641 | { | |
1642 | const char *s; | |
1643 | ||
1644 | /* A constructor or destructor name starts like this: | |
1645 | _+GLOBAL_[_.$][ID][_.$] where the first [_.$] and | |
1646 | the second are the same character (we accept any | |
1647 | character there, in case a new object file format | |
1648 | comes along with even worse naming restrictions). */ | |
1649 | ||
1650 | #define CONS_PREFIX "GLOBAL_" | |
1651 | #define CONS_PREFIX_LEN (sizeof CONS_PREFIX - 1) | |
1652 | ||
1653 | s = name + 1; | |
1654 | while (*s == '_') | |
1655 | ++s; | |
1656 | if (s[0] == 'G' | |
1657 | && strncmp (s, CONS_PREFIX, CONS_PREFIX_LEN - 1) == 0) | |
1658 | { | |
1659 | char c; | |
1660 | ||
1661 | c = s[CONS_PREFIX_LEN + 1]; | |
1662 | if ((c == 'I' || c == 'D') | |
1663 | && s[CONS_PREFIX_LEN] == s[CONS_PREFIX_LEN + 2]) | |
1664 | { | |
1665 | /* If this is a definition of a symbol which | |
1666 | was previously weakly defined, we are in | |
1667 | trouble. We have already added a | |
1668 | constructor entry for the weak defined | |
1669 | symbol, and now we are trying to add one | |
1670 | for the new symbol. Fortunately, this case | |
1671 | should never arise in practice. */ | |
1672 | if (oldtype == bfd_link_hash_defweak) | |
1673 | abort (); | |
1674 | ||
1675 | if (! ((*info->callbacks->constructor) | |
82e51918 | 1676 | (info, c == 'I', |
252b5132 | 1677 | h->root.string, abfd, section, value))) |
b34976b6 | 1678 | return FALSE; |
252b5132 RH |
1679 | } |
1680 | } | |
1681 | } | |
1682 | } | |
1683 | ||
1684 | break; | |
1685 | ||
1686 | case COM: | |
1687 | /* We have found a common definition for a symbol. */ | |
1688 | if (h->type == bfd_link_hash_new) | |
1689 | bfd_link_add_undef (info->hash, h); | |
1690 | h->type = bfd_link_hash_common; | |
1691 | h->u.c.p = | |
c58b9523 AM |
1692 | bfd_hash_allocate (&info->hash->table, |
1693 | sizeof (struct bfd_link_hash_common_entry)); | |
252b5132 | 1694 | if (h->u.c.p == NULL) |
b34976b6 | 1695 | return FALSE; |
252b5132 RH |
1696 | |
1697 | h->u.c.size = value; | |
1698 | ||
1699 | /* Select a default alignment based on the size. This may | |
1700 | be overridden by the caller. */ | |
1701 | { | |
1702 | unsigned int power; | |
1703 | ||
1704 | power = bfd_log2 (value); | |
1705 | if (power > 4) | |
1706 | power = 4; | |
1707 | h->u.c.p->alignment_power = power; | |
1708 | } | |
1709 | ||
1710 | /* The section of a common symbol is only used if the common | |
1711 | symbol is actually allocated. It basically provides a | |
1712 | hook for the linker script to decide which output section | |
1713 | the common symbols should be put in. In most cases, the | |
1714 | section of a common symbol will be bfd_com_section_ptr, | |
1715 | the code here will choose a common symbol section named | |
1716 | "COMMON", and the linker script will contain *(COMMON) in | |
1717 | the appropriate place. A few targets use separate common | |
1718 | sections for small symbols, and they require special | |
1719 | handling. */ | |
1720 | if (section == bfd_com_section_ptr) | |
1721 | { | |
1722 | h->u.c.p->section = bfd_make_section_old_way (abfd, "COMMON"); | |
1723 | h->u.c.p->section->flags = SEC_ALLOC; | |
1724 | } | |
1725 | else if (section->owner != abfd) | |
1726 | { | |
1727 | h->u.c.p->section = bfd_make_section_old_way (abfd, | |
1728 | section->name); | |
1729 | h->u.c.p->section->flags = SEC_ALLOC; | |
1730 | } | |
1731 | else | |
1732 | h->u.c.p->section = section; | |
1733 | break; | |
1734 | ||
1735 | case REF: | |
1736 | /* A reference to a defined symbol. */ | |
f6e332e6 AM |
1737 | if (h->u.undef.next == NULL && info->hash->undefs_tail != h) |
1738 | h->u.undef.next = h; | |
252b5132 RH |
1739 | break; |
1740 | ||
1741 | case BIG: | |
1742 | /* We have found a common definition for a symbol which | |
1743 | already had a common definition. Use the maximum of the | |
0a2afbc1 | 1744 | two sizes, and use the section required by the larger symbol. */ |
252b5132 RH |
1745 | BFD_ASSERT (h->type == bfd_link_hash_common); |
1746 | if (! ((*info->callbacks->multiple_common) | |
1747 | (info, h->root.string, | |
1748 | h->u.c.p->section->owner, bfd_link_hash_common, h->u.c.size, | |
1749 | abfd, bfd_link_hash_common, value))) | |
b34976b6 | 1750 | return FALSE; |
252b5132 RH |
1751 | if (value > h->u.c.size) |
1752 | { | |
1753 | unsigned int power; | |
1754 | ||
1755 | h->u.c.size = value; | |
1756 | ||
1757 | /* Select a default alignment based on the size. This may | |
1758 | be overridden by the caller. */ | |
1759 | power = bfd_log2 (value); | |
1760 | if (power > 4) | |
1761 | power = 4; | |
1762 | h->u.c.p->alignment_power = power; | |
0a2afbc1 JW |
1763 | |
1764 | /* Some systems have special treatment for small commons, | |
1765 | hence we want to select the section used by the larger | |
1766 | symbol. This makes sure the symbol does not go in a | |
1767 | small common section if it is now too large. */ | |
1768 | if (section == bfd_com_section_ptr) | |
1769 | { | |
1770 | h->u.c.p->section | |
1771 | = bfd_make_section_old_way (abfd, "COMMON"); | |
1772 | h->u.c.p->section->flags = SEC_ALLOC; | |
1773 | } | |
1774 | else if (section->owner != abfd) | |
1775 | { | |
1776 | h->u.c.p->section | |
1777 | = bfd_make_section_old_way (abfd, section->name); | |
1778 | h->u.c.p->section->flags = SEC_ALLOC; | |
1779 | } | |
1780 | else | |
1781 | h->u.c.p->section = section; | |
252b5132 RH |
1782 | } |
1783 | break; | |
1784 | ||
1785 | case CREF: | |
1786 | { | |
1787 | bfd *obfd; | |
1788 | ||
1789 | /* We have found a common definition for a symbol which | |
1790 | was already defined. FIXME: It would nice if we could | |
1791 | report the BFD which defined an indirect symbol, but we | |
1792 | don't have anywhere to store the information. */ | |
1793 | if (h->type == bfd_link_hash_defined | |
1794 | || h->type == bfd_link_hash_defweak) | |
1795 | obfd = h->u.def.section->owner; | |
1796 | else | |
1797 | obfd = NULL; | |
1798 | if (! ((*info->callbacks->multiple_common) | |
c58b9523 | 1799 | (info, h->root.string, obfd, h->type, 0, |
252b5132 | 1800 | abfd, bfd_link_hash_common, value))) |
b34976b6 | 1801 | return FALSE; |
252b5132 RH |
1802 | } |
1803 | break; | |
1804 | ||
1805 | case MIND: | |
1806 | /* Multiple indirect symbols. This is OK if they both point | |
1807 | to the same symbol. */ | |
1808 | if (strcmp (h->u.i.link->root.string, string) == 0) | |
1809 | break; | |
1810 | /* Fall through. */ | |
1811 | case MDEF: | |
1812 | /* Handle a multiple definition. */ | |
c5a43a5d L |
1813 | if (!info->allow_multiple_definition) |
1814 | { | |
1815 | asection *msec = NULL; | |
1816 | bfd_vma mval = 0; | |
252b5132 | 1817 | |
c5a43a5d L |
1818 | switch (h->type) |
1819 | { | |
1820 | case bfd_link_hash_defined: | |
1821 | msec = h->u.def.section; | |
1822 | mval = h->u.def.value; | |
1823 | break; | |
1824 | case bfd_link_hash_indirect: | |
1825 | msec = bfd_ind_section_ptr; | |
1826 | mval = 0; | |
1827 | break; | |
1828 | default: | |
1829 | abort (); | |
1830 | } | |
1831 | ||
1832 | /* Ignore a redefinition of an absolute symbol to the | |
1833 | same value; it's harmless. */ | |
1834 | if (h->type == bfd_link_hash_defined | |
1835 | && bfd_is_abs_section (msec) | |
1836 | && bfd_is_abs_section (section) | |
1837 | && value == mval) | |
252b5132 | 1838 | break; |
252b5132 | 1839 | |
c5a43a5d L |
1840 | if (! ((*info->callbacks->multiple_definition) |
1841 | (info, h->root.string, msec->owner, msec, mval, | |
1842 | abfd, section, value))) | |
b34976b6 | 1843 | return FALSE; |
c5a43a5d | 1844 | } |
252b5132 RH |
1845 | break; |
1846 | ||
1847 | case CIND: | |
1848 | /* Create an indirect symbol from an existing common symbol. */ | |
1849 | BFD_ASSERT (h->type == bfd_link_hash_common); | |
1850 | if (! ((*info->callbacks->multiple_common) | |
1851 | (info, h->root.string, | |
1852 | h->u.c.p->section->owner, bfd_link_hash_common, h->u.c.size, | |
c58b9523 | 1853 | abfd, bfd_link_hash_indirect, 0))) |
b34976b6 | 1854 | return FALSE; |
252b5132 RH |
1855 | /* Fall through. */ |
1856 | case IND: | |
1857 | /* Create an indirect symbol. */ | |
1858 | { | |
1859 | struct bfd_link_hash_entry *inh; | |
1860 | ||
1861 | /* STRING is the name of the symbol we want to indirect | |
1862 | to. */ | |
b34976b6 AM |
1863 | inh = bfd_wrapped_link_hash_lookup (abfd, info, string, TRUE, |
1864 | copy, FALSE); | |
c58b9523 | 1865 | if (inh == NULL) |
b34976b6 | 1866 | return FALSE; |
689effed L |
1867 | if (inh->type == bfd_link_hash_indirect |
1868 | && inh->u.i.link == h) | |
1869 | { | |
1870 | (*_bfd_error_handler) | |
d003868e AM |
1871 | (_("%B: indirect symbol `%s' to `%s' is a loop"), |
1872 | abfd, name, string); | |
689effed | 1873 | bfd_set_error (bfd_error_invalid_operation); |
b34976b6 | 1874 | return FALSE; |
689effed | 1875 | } |
252b5132 RH |
1876 | if (inh->type == bfd_link_hash_new) |
1877 | { | |
1878 | inh->type = bfd_link_hash_undefined; | |
1879 | inh->u.undef.abfd = abfd; | |
1880 | bfd_link_add_undef (info->hash, inh); | |
1881 | } | |
1882 | ||
1883 | /* If the indirect symbol has been referenced, we need to | |
1884 | push the reference down to the symbol we are | |
1885 | referencing. */ | |
1886 | if (h->type != bfd_link_hash_new) | |
1887 | { | |
1888 | row = UNDEF_ROW; | |
b34976b6 | 1889 | cycle = TRUE; |
252b5132 RH |
1890 | } |
1891 | ||
1892 | h->type = bfd_link_hash_indirect; | |
1893 | h->u.i.link = inh; | |
1894 | } | |
1895 | break; | |
1896 | ||
1897 | case SET: | |
1898 | /* Add an entry to a set. */ | |
1899 | if (! (*info->callbacks->add_to_set) (info, h, BFD_RELOC_CTOR, | |
1900 | abfd, section, value)) | |
b34976b6 | 1901 | return FALSE; |
252b5132 RH |
1902 | break; |
1903 | ||
1904 | case WARNC: | |
1905 | /* Issue a warning and cycle. */ | |
1906 | if (h->u.i.warning != NULL) | |
1907 | { | |
1908 | if (! (*info->callbacks->warning) (info, h->u.i.warning, | |
1909 | h->root.string, abfd, | |
c58b9523 | 1910 | NULL, 0)) |
b34976b6 | 1911 | return FALSE; |
252b5132 RH |
1912 | /* Only issue a warning once. */ |
1913 | h->u.i.warning = NULL; | |
1914 | } | |
1915 | /* Fall through. */ | |
1916 | case CYCLE: | |
1917 | /* Try again with the referenced symbol. */ | |
1918 | h = h->u.i.link; | |
b34976b6 | 1919 | cycle = TRUE; |
252b5132 RH |
1920 | break; |
1921 | ||
1922 | case REFC: | |
1923 | /* A reference to an indirect symbol. */ | |
f6e332e6 AM |
1924 | if (h->u.undef.next == NULL && info->hash->undefs_tail != h) |
1925 | h->u.undef.next = h; | |
252b5132 | 1926 | h = h->u.i.link; |
b34976b6 | 1927 | cycle = TRUE; |
252b5132 RH |
1928 | break; |
1929 | ||
1930 | case WARN: | |
1931 | /* Issue a warning. */ | |
1932 | if (! (*info->callbacks->warning) (info, string, h->root.string, | |
c58b9523 | 1933 | hash_entry_bfd (h), NULL, 0)) |
b34976b6 | 1934 | return FALSE; |
252b5132 RH |
1935 | break; |
1936 | ||
1937 | case CWARN: | |
1938 | /* Warn if this symbol has been referenced already, | |
1939 | otherwise add a warning. A symbol has been referenced if | |
f6e332e6 | 1940 | the u.undef.next field is not NULL, or it is the tail of the |
252b5132 RH |
1941 | undefined symbol list. The REF case above helps to |
1942 | ensure this. */ | |
f6e332e6 | 1943 | if (h->u.undef.next != NULL || info->hash->undefs_tail == h) |
252b5132 RH |
1944 | { |
1945 | if (! (*info->callbacks->warning) (info, string, h->root.string, | |
c58b9523 | 1946 | hash_entry_bfd (h), NULL, 0)) |
b34976b6 | 1947 | return FALSE; |
252b5132 RH |
1948 | break; |
1949 | } | |
1950 | /* Fall through. */ | |
1951 | case MWARN: | |
1952 | /* Make a warning symbol. */ | |
1953 | { | |
1954 | struct bfd_link_hash_entry *sub; | |
1955 | ||
1956 | /* STRING is the warning to give. */ | |
1957 | sub = ((struct bfd_link_hash_entry *) | |
1958 | ((*info->hash->table.newfunc) | |
c58b9523 | 1959 | (NULL, &info->hash->table, h->root.string))); |
252b5132 | 1960 | if (sub == NULL) |
b34976b6 | 1961 | return FALSE; |
252b5132 RH |
1962 | *sub = *h; |
1963 | sub->type = bfd_link_hash_warning; | |
1964 | sub->u.i.link = h; | |
1965 | if (! copy) | |
1966 | sub->u.i.warning = string; | |
1967 | else | |
1968 | { | |
1969 | char *w; | |
d4c88bbb | 1970 | size_t len = strlen (string) + 1; |
252b5132 | 1971 | |
d4c88bbb | 1972 | w = bfd_hash_allocate (&info->hash->table, len); |
252b5132 | 1973 | if (w == NULL) |
b34976b6 | 1974 | return FALSE; |
d4c88bbb | 1975 | memcpy (w, string, len); |
252b5132 RH |
1976 | sub->u.i.warning = w; |
1977 | } | |
1978 | ||
1979 | bfd_hash_replace (&info->hash->table, | |
1980 | (struct bfd_hash_entry *) h, | |
1981 | (struct bfd_hash_entry *) sub); | |
1982 | if (hashp != NULL) | |
1983 | *hashp = sub; | |
1984 | } | |
1985 | break; | |
1986 | } | |
1987 | } | |
1988 | while (cycle); | |
1989 | ||
b34976b6 | 1990 | return TRUE; |
252b5132 RH |
1991 | } |
1992 | \f | |
1993 | /* Generic final link routine. */ | |
1994 | ||
b34976b6 | 1995 | bfd_boolean |
c58b9523 | 1996 | _bfd_generic_final_link (bfd *abfd, struct bfd_link_info *info) |
252b5132 RH |
1997 | { |
1998 | bfd *sub; | |
1999 | asection *o; | |
2000 | struct bfd_link_order *p; | |
2001 | size_t outsymalloc; | |
2002 | struct generic_write_global_symbol_info wginfo; | |
2003 | ||
c58b9523 | 2004 | bfd_get_outsymbols (abfd) = NULL; |
252b5132 RH |
2005 | bfd_get_symcount (abfd) = 0; |
2006 | outsymalloc = 0; | |
2007 | ||
2008 | /* Mark all sections which will be included in the output file. */ | |
2009 | for (o = abfd->sections; o != NULL; o = o->next) | |
2010 | for (p = o->link_order_head; p != NULL; p = p->next) | |
2011 | if (p->type == bfd_indirect_link_order) | |
b34976b6 | 2012 | p->u.indirect.section->linker_mark = TRUE; |
252b5132 RH |
2013 | |
2014 | /* Build the output symbol table. */ | |
c58b9523 | 2015 | for (sub = info->input_bfds; sub != NULL; sub = sub->link_next) |
252b5132 | 2016 | if (! _bfd_generic_link_output_symbols (abfd, sub, info, &outsymalloc)) |
b34976b6 | 2017 | return FALSE; |
252b5132 RH |
2018 | |
2019 | /* Accumulate the global symbols. */ | |
2020 | wginfo.info = info; | |
2021 | wginfo.output_bfd = abfd; | |
2022 | wginfo.psymalloc = &outsymalloc; | |
2023 | _bfd_generic_link_hash_traverse (_bfd_generic_hash_table (info), | |
2024 | _bfd_generic_link_write_global_symbol, | |
c58b9523 | 2025 | &wginfo); |
252b5132 RH |
2026 | |
2027 | /* Make sure we have a trailing NULL pointer on OUTSYMBOLS. We | |
2028 | shouldn't really need one, since we have SYMCOUNT, but some old | |
2029 | code still expects one. */ | |
2030 | if (! generic_add_output_symbol (abfd, &outsymalloc, NULL)) | |
b34976b6 | 2031 | return FALSE; |
252b5132 | 2032 | |
1049f94e | 2033 | if (info->relocatable) |
252b5132 RH |
2034 | { |
2035 | /* Allocate space for the output relocs for each section. */ | |
c58b9523 | 2036 | for (o = abfd->sections; o != NULL; o = o->next) |
252b5132 RH |
2037 | { |
2038 | o->reloc_count = 0; | |
c58b9523 | 2039 | for (p = o->link_order_head; p != NULL; p = p->next) |
252b5132 RH |
2040 | { |
2041 | if (p->type == bfd_section_reloc_link_order | |
2042 | || p->type == bfd_symbol_reloc_link_order) | |
2043 | ++o->reloc_count; | |
2044 | else if (p->type == bfd_indirect_link_order) | |
2045 | { | |
2046 | asection *input_section; | |
2047 | bfd *input_bfd; | |
2048 | long relsize; | |
2049 | arelent **relocs; | |
2050 | asymbol **symbols; | |
2051 | long reloc_count; | |
2052 | ||
2053 | input_section = p->u.indirect.section; | |
2054 | input_bfd = input_section->owner; | |
2055 | relsize = bfd_get_reloc_upper_bound (input_bfd, | |
2056 | input_section); | |
2057 | if (relsize < 0) | |
b34976b6 | 2058 | return FALSE; |
c58b9523 | 2059 | relocs = bfd_malloc (relsize); |
252b5132 | 2060 | if (!relocs && relsize != 0) |
b34976b6 | 2061 | return FALSE; |
252b5132 RH |
2062 | symbols = _bfd_generic_link_get_symbols (input_bfd); |
2063 | reloc_count = bfd_canonicalize_reloc (input_bfd, | |
2064 | input_section, | |
2065 | relocs, | |
2066 | symbols); | |
5ed6aba4 | 2067 | free (relocs); |
252b5132 | 2068 | if (reloc_count < 0) |
b34976b6 | 2069 | return FALSE; |
252b5132 RH |
2070 | BFD_ASSERT ((unsigned long) reloc_count |
2071 | == input_section->reloc_count); | |
2072 | o->reloc_count += reloc_count; | |
252b5132 RH |
2073 | } |
2074 | } | |
2075 | if (o->reloc_count > 0) | |
2076 | { | |
dc810e39 AM |
2077 | bfd_size_type amt; |
2078 | ||
2079 | amt = o->reloc_count; | |
2080 | amt *= sizeof (arelent *); | |
c58b9523 | 2081 | o->orelocation = bfd_alloc (abfd, amt); |
252b5132 | 2082 | if (!o->orelocation) |
b34976b6 | 2083 | return FALSE; |
252b5132 RH |
2084 | o->flags |= SEC_RELOC; |
2085 | /* Reset the count so that it can be used as an index | |
2086 | when putting in the output relocs. */ | |
2087 | o->reloc_count = 0; | |
2088 | } | |
2089 | } | |
2090 | } | |
2091 | ||
2092 | /* Handle all the link order information for the sections. */ | |
c58b9523 | 2093 | for (o = abfd->sections; o != NULL; o = o->next) |
252b5132 | 2094 | { |
c58b9523 | 2095 | for (p = o->link_order_head; p != NULL; p = p->next) |
252b5132 RH |
2096 | { |
2097 | switch (p->type) | |
2098 | { | |
2099 | case bfd_section_reloc_link_order: | |
2100 | case bfd_symbol_reloc_link_order: | |
2101 | if (! _bfd_generic_reloc_link_order (abfd, info, o, p)) | |
b34976b6 | 2102 | return FALSE; |
252b5132 RH |
2103 | break; |
2104 | case bfd_indirect_link_order: | |
b34976b6 AM |
2105 | if (! default_indirect_link_order (abfd, info, o, p, TRUE)) |
2106 | return FALSE; | |
252b5132 RH |
2107 | break; |
2108 | default: | |
2109 | if (! _bfd_default_link_order (abfd, info, o, p)) | |
b34976b6 | 2110 | return FALSE; |
252b5132 RH |
2111 | break; |
2112 | } | |
2113 | } | |
2114 | } | |
509945ae | 2115 | |
b34976b6 | 2116 | return TRUE; |
252b5132 RH |
2117 | } |
2118 | ||
2119 | /* Add an output symbol to the output BFD. */ | |
2120 | ||
b34976b6 | 2121 | static bfd_boolean |
c58b9523 | 2122 | generic_add_output_symbol (bfd *output_bfd, size_t *psymalloc, asymbol *sym) |
252b5132 RH |
2123 | { |
2124 | if (bfd_get_symcount (output_bfd) >= *psymalloc) | |
2125 | { | |
2126 | asymbol **newsyms; | |
dc810e39 | 2127 | bfd_size_type amt; |
252b5132 RH |
2128 | |
2129 | if (*psymalloc == 0) | |
2130 | *psymalloc = 124; | |
2131 | else | |
2132 | *psymalloc *= 2; | |
dc810e39 AM |
2133 | amt = *psymalloc; |
2134 | amt *= sizeof (asymbol *); | |
c58b9523 AM |
2135 | newsyms = bfd_realloc (bfd_get_outsymbols (output_bfd), amt); |
2136 | if (newsyms == NULL) | |
b34976b6 | 2137 | return FALSE; |
252b5132 RH |
2138 | bfd_get_outsymbols (output_bfd) = newsyms; |
2139 | } | |
2140 | ||
2141 | bfd_get_outsymbols (output_bfd) [bfd_get_symcount (output_bfd)] = sym; | |
2142 | if (sym != NULL) | |
2143 | ++ bfd_get_symcount (output_bfd); | |
2144 | ||
b34976b6 | 2145 | return TRUE; |
252b5132 RH |
2146 | } |
2147 | ||
2148 | /* Handle the symbols for an input BFD. */ | |
2149 | ||
b34976b6 | 2150 | bfd_boolean |
c58b9523 AM |
2151 | _bfd_generic_link_output_symbols (bfd *output_bfd, |
2152 | bfd *input_bfd, | |
2153 | struct bfd_link_info *info, | |
2154 | size_t *psymalloc) | |
252b5132 RH |
2155 | { |
2156 | asymbol **sym_ptr; | |
2157 | asymbol **sym_end; | |
2158 | ||
2159 | if (! generic_link_read_symbols (input_bfd)) | |
b34976b6 | 2160 | return FALSE; |
252b5132 RH |
2161 | |
2162 | /* Create a filename symbol if we are supposed to. */ | |
c58b9523 | 2163 | if (info->create_object_symbols_section != NULL) |
252b5132 RH |
2164 | { |
2165 | asection *sec; | |
2166 | ||
c58b9523 | 2167 | for (sec = input_bfd->sections; sec != NULL; sec = sec->next) |
252b5132 RH |
2168 | { |
2169 | if (sec->output_section == info->create_object_symbols_section) | |
2170 | { | |
2171 | asymbol *newsym; | |
2172 | ||
2173 | newsym = bfd_make_empty_symbol (input_bfd); | |
2174 | if (!newsym) | |
b34976b6 | 2175 | return FALSE; |
252b5132 RH |
2176 | newsym->name = input_bfd->filename; |
2177 | newsym->value = 0; | |
2178 | newsym->flags = BSF_LOCAL | BSF_FILE; | |
2179 | newsym->section = sec; | |
2180 | ||
2181 | if (! generic_add_output_symbol (output_bfd, psymalloc, | |
2182 | newsym)) | |
b34976b6 | 2183 | return FALSE; |
252b5132 RH |
2184 | |
2185 | break; | |
2186 | } | |
2187 | } | |
2188 | } | |
2189 | ||
2190 | /* Adjust the values of the globally visible symbols, and write out | |
2191 | local symbols. */ | |
2192 | sym_ptr = _bfd_generic_link_get_symbols (input_bfd); | |
2193 | sym_end = sym_ptr + _bfd_generic_link_get_symcount (input_bfd); | |
2194 | for (; sym_ptr < sym_end; sym_ptr++) | |
2195 | { | |
2196 | asymbol *sym; | |
2197 | struct generic_link_hash_entry *h; | |
b34976b6 | 2198 | bfd_boolean output; |
252b5132 | 2199 | |
c58b9523 | 2200 | h = NULL; |
252b5132 RH |
2201 | sym = *sym_ptr; |
2202 | if ((sym->flags & (BSF_INDIRECT | |
2203 | | BSF_WARNING | |
2204 | | BSF_GLOBAL | |
2205 | | BSF_CONSTRUCTOR | |
2206 | | BSF_WEAK)) != 0 | |
2207 | || bfd_is_und_section (bfd_get_section (sym)) | |
2208 | || bfd_is_com_section (bfd_get_section (sym)) | |
2209 | || bfd_is_ind_section (bfd_get_section (sym))) | |
2210 | { | |
2211 | if (sym->udata.p != NULL) | |
c58b9523 | 2212 | h = sym->udata.p; |
252b5132 RH |
2213 | else if ((sym->flags & BSF_CONSTRUCTOR) != 0) |
2214 | { | |
2215 | /* This case normally means that the main linker code | |
2216 | deliberately ignored this constructor symbol. We | |
2217 | should just pass it through. This will screw up if | |
2218 | the constructor symbol is from a different, | |
2219 | non-generic, object file format, but the case will | |
2220 | only arise when linking with -r, which will probably | |
2221 | fail anyhow, since there will be no way to represent | |
2222 | the relocs in the output format being used. */ | |
2223 | h = NULL; | |
2224 | } | |
2225 | else if (bfd_is_und_section (bfd_get_section (sym))) | |
2226 | h = ((struct generic_link_hash_entry *) | |
2227 | bfd_wrapped_link_hash_lookup (output_bfd, info, | |
2228 | bfd_asymbol_name (sym), | |
b34976b6 | 2229 | FALSE, FALSE, TRUE)); |
252b5132 RH |
2230 | else |
2231 | h = _bfd_generic_link_hash_lookup (_bfd_generic_hash_table (info), | |
2232 | bfd_asymbol_name (sym), | |
b34976b6 | 2233 | FALSE, FALSE, TRUE); |
252b5132 | 2234 | |
c58b9523 | 2235 | if (h != NULL) |
252b5132 RH |
2236 | { |
2237 | /* Force all references to this symbol to point to | |
2238 | the same area in memory. It is possible that | |
2239 | this routine will be called with a hash table | |
2240 | other than a generic hash table, so we double | |
2241 | check that. */ | |
2242 | if (info->hash->creator == input_bfd->xvec) | |
2243 | { | |
c58b9523 | 2244 | if (h->sym != NULL) |
252b5132 RH |
2245 | *sym_ptr = sym = h->sym; |
2246 | } | |
2247 | ||
2248 | switch (h->root.type) | |
2249 | { | |
2250 | default: | |
2251 | case bfd_link_hash_new: | |
2252 | abort (); | |
2253 | case bfd_link_hash_undefined: | |
2254 | break; | |
2255 | case bfd_link_hash_undefweak: | |
2256 | sym->flags |= BSF_WEAK; | |
2257 | break; | |
2258 | case bfd_link_hash_indirect: | |
2259 | h = (struct generic_link_hash_entry *) h->root.u.i.link; | |
2260 | /* fall through */ | |
2261 | case bfd_link_hash_defined: | |
2262 | sym->flags |= BSF_GLOBAL; | |
2263 | sym->flags &=~ BSF_CONSTRUCTOR; | |
2264 | sym->value = h->root.u.def.value; | |
2265 | sym->section = h->root.u.def.section; | |
2266 | break; | |
2267 | case bfd_link_hash_defweak: | |
2268 | sym->flags |= BSF_WEAK; | |
2269 | sym->flags &=~ BSF_CONSTRUCTOR; | |
2270 | sym->value = h->root.u.def.value; | |
2271 | sym->section = h->root.u.def.section; | |
2272 | break; | |
2273 | case bfd_link_hash_common: | |
2274 | sym->value = h->root.u.c.size; | |
2275 | sym->flags |= BSF_GLOBAL; | |
2276 | if (! bfd_is_com_section (sym->section)) | |
2277 | { | |
2278 | BFD_ASSERT (bfd_is_und_section (sym->section)); | |
2279 | sym->section = bfd_com_section_ptr; | |
2280 | } | |
2281 | /* We do not set the section of the symbol to | |
2282 | h->root.u.c.p->section. That value was saved so | |
2283 | that we would know where to allocate the symbol | |
2284 | if it was defined. In this case the type is | |
2285 | still bfd_link_hash_common, so we did not define | |
2286 | it, so we do not want to use that section. */ | |
2287 | break; | |
2288 | } | |
2289 | } | |
2290 | } | |
2291 | ||
2292 | /* This switch is straight from the old code in | |
2293 | write_file_locals in ldsym.c. */ | |
2294 | if (info->strip == strip_all | |
2295 | || (info->strip == strip_some | |
c58b9523 AM |
2296 | && bfd_hash_lookup (info->keep_hash, bfd_asymbol_name (sym), |
2297 | FALSE, FALSE) == NULL)) | |
b34976b6 | 2298 | output = FALSE; |
252b5132 RH |
2299 | else if ((sym->flags & (BSF_GLOBAL | BSF_WEAK)) != 0) |
2300 | { | |
2301 | /* If this symbol is marked as occurring now, rather | |
2302 | than at the end, output it now. This is used for | |
2303 | COFF C_EXT FCN symbols. FIXME: There must be a | |
2304 | better way. */ | |
2305 | if (bfd_asymbol_bfd (sym) == input_bfd | |
2306 | && (sym->flags & BSF_NOT_AT_END) != 0) | |
b34976b6 | 2307 | output = TRUE; |
252b5132 | 2308 | else |
b34976b6 | 2309 | output = FALSE; |
252b5132 RH |
2310 | } |
2311 | else if (bfd_is_ind_section (sym->section)) | |
b34976b6 | 2312 | output = FALSE; |
252b5132 RH |
2313 | else if ((sym->flags & BSF_DEBUGGING) != 0) |
2314 | { | |
2315 | if (info->strip == strip_none) | |
b34976b6 | 2316 | output = TRUE; |
252b5132 | 2317 | else |
b34976b6 | 2318 | output = FALSE; |
252b5132 RH |
2319 | } |
2320 | else if (bfd_is_und_section (sym->section) | |
2321 | || bfd_is_com_section (sym->section)) | |
b34976b6 | 2322 | output = FALSE; |
252b5132 RH |
2323 | else if ((sym->flags & BSF_LOCAL) != 0) |
2324 | { | |
2325 | if ((sym->flags & BSF_WARNING) != 0) | |
b34976b6 | 2326 | output = FALSE; |
252b5132 RH |
2327 | else |
2328 | { | |
2329 | switch (info->discard) | |
2330 | { | |
2331 | default: | |
2332 | case discard_all: | |
b34976b6 | 2333 | output = FALSE; |
252b5132 | 2334 | break; |
f5fa8ca2 | 2335 | case discard_sec_merge: |
b34976b6 | 2336 | output = TRUE; |
1049f94e | 2337 | if (info->relocatable |
f5fa8ca2 JJ |
2338 | || ! (sym->section->flags & SEC_MERGE)) |
2339 | break; | |
2340 | /* FALLTHROUGH */ | |
252b5132 RH |
2341 | case discard_l: |
2342 | if (bfd_is_local_label (input_bfd, sym)) | |
b34976b6 | 2343 | output = FALSE; |
252b5132 | 2344 | else |
b34976b6 | 2345 | output = TRUE; |
252b5132 RH |
2346 | break; |
2347 | case discard_none: | |
b34976b6 | 2348 | output = TRUE; |
252b5132 RH |
2349 | break; |
2350 | } | |
2351 | } | |
2352 | } | |
2353 | else if ((sym->flags & BSF_CONSTRUCTOR)) | |
2354 | { | |
2355 | if (info->strip != strip_all) | |
b34976b6 | 2356 | output = TRUE; |
252b5132 | 2357 | else |
b34976b6 | 2358 | output = FALSE; |
252b5132 RH |
2359 | } |
2360 | else | |
2361 | abort (); | |
2362 | ||
2363 | /* If this symbol is in a section which is not being included | |
2364 | in the output file, then we don't want to output the symbol. | |
2365 | ||
2366 | Gross. .bss and similar sections won't have the linker_mark | |
2367 | field set. */ | |
2368 | if ((sym->section->flags & SEC_HAS_CONTENTS) != 0 | |
82e51918 | 2369 | && ! sym->section->linker_mark) |
b34976b6 | 2370 | output = FALSE; |
252b5132 RH |
2371 | |
2372 | if (output) | |
2373 | { | |
2374 | if (! generic_add_output_symbol (output_bfd, psymalloc, sym)) | |
b34976b6 | 2375 | return FALSE; |
c58b9523 | 2376 | if (h != NULL) |
b34976b6 | 2377 | h->written = TRUE; |
252b5132 RH |
2378 | } |
2379 | } | |
2380 | ||
b34976b6 | 2381 | return TRUE; |
252b5132 RH |
2382 | } |
2383 | ||
2384 | /* Set the section and value of a generic BFD symbol based on a linker | |
2385 | hash table entry. */ | |
2386 | ||
2387 | static void | |
c58b9523 | 2388 | set_symbol_from_hash (asymbol *sym, struct bfd_link_hash_entry *h) |
252b5132 RH |
2389 | { |
2390 | switch (h->type) | |
2391 | { | |
2392 | default: | |
2393 | abort (); | |
2394 | break; | |
2395 | case bfd_link_hash_new: | |
2396 | /* This can happen when a constructor symbol is seen but we are | |
2397 | not building constructors. */ | |
2398 | if (sym->section != NULL) | |
2399 | { | |
2400 | BFD_ASSERT ((sym->flags & BSF_CONSTRUCTOR) != 0); | |
2401 | } | |
2402 | else | |
2403 | { | |
2404 | sym->flags |= BSF_CONSTRUCTOR; | |
2405 | sym->section = bfd_abs_section_ptr; | |
2406 | sym->value = 0; | |
2407 | } | |
2408 | break; | |
2409 | case bfd_link_hash_undefined: | |
2410 | sym->section = bfd_und_section_ptr; | |
2411 | sym->value = 0; | |
2412 | break; | |
2413 | case bfd_link_hash_undefweak: | |
2414 | sym->section = bfd_und_section_ptr; | |
2415 | sym->value = 0; | |
2416 | sym->flags |= BSF_WEAK; | |
2417 | break; | |
2418 | case bfd_link_hash_defined: | |
2419 | sym->section = h->u.def.section; | |
2420 | sym->value = h->u.def.value; | |
2421 | break; | |
2422 | case bfd_link_hash_defweak: | |
2423 | sym->flags |= BSF_WEAK; | |
2424 | sym->section = h->u.def.section; | |
2425 | sym->value = h->u.def.value; | |
2426 | break; | |
2427 | case bfd_link_hash_common: | |
2428 | sym->value = h->u.c.size; | |
2429 | if (sym->section == NULL) | |
2430 | sym->section = bfd_com_section_ptr; | |
2431 | else if (! bfd_is_com_section (sym->section)) | |
2432 | { | |
2433 | BFD_ASSERT (bfd_is_und_section (sym->section)); | |
2434 | sym->section = bfd_com_section_ptr; | |
2435 | } | |
2436 | /* Do not set the section; see _bfd_generic_link_output_symbols. */ | |
2437 | break; | |
2438 | case bfd_link_hash_indirect: | |
2439 | case bfd_link_hash_warning: | |
2440 | /* FIXME: What should we do here? */ | |
2441 | break; | |
2442 | } | |
2443 | } | |
2444 | ||
2445 | /* Write out a global symbol, if it hasn't already been written out. | |
2446 | This is called for each symbol in the hash table. */ | |
2447 | ||
b34976b6 | 2448 | bfd_boolean |
c58b9523 AM |
2449 | _bfd_generic_link_write_global_symbol (struct generic_link_hash_entry *h, |
2450 | void *data) | |
252b5132 | 2451 | { |
c58b9523 | 2452 | struct generic_write_global_symbol_info *wginfo = data; |
252b5132 RH |
2453 | asymbol *sym; |
2454 | ||
e92d460e AM |
2455 | if (h->root.type == bfd_link_hash_warning) |
2456 | h = (struct generic_link_hash_entry *) h->root.u.i.link; | |
2457 | ||
252b5132 | 2458 | if (h->written) |
b34976b6 | 2459 | return TRUE; |
252b5132 | 2460 | |
b34976b6 | 2461 | h->written = TRUE; |
252b5132 RH |
2462 | |
2463 | if (wginfo->info->strip == strip_all | |
2464 | || (wginfo->info->strip == strip_some | |
2465 | && bfd_hash_lookup (wginfo->info->keep_hash, h->root.root.string, | |
b34976b6 AM |
2466 | FALSE, FALSE) == NULL)) |
2467 | return TRUE; | |
252b5132 | 2468 | |
c58b9523 | 2469 | if (h->sym != NULL) |
252b5132 RH |
2470 | sym = h->sym; |
2471 | else | |
2472 | { | |
2473 | sym = bfd_make_empty_symbol (wginfo->output_bfd); | |
2474 | if (!sym) | |
b34976b6 | 2475 | return FALSE; |
252b5132 RH |
2476 | sym->name = h->root.root.string; |
2477 | sym->flags = 0; | |
2478 | } | |
2479 | ||
2480 | set_symbol_from_hash (sym, &h->root); | |
2481 | ||
2482 | sym->flags |= BSF_GLOBAL; | |
2483 | ||
2484 | if (! generic_add_output_symbol (wginfo->output_bfd, wginfo->psymalloc, | |
2485 | sym)) | |
2486 | { | |
2487 | /* FIXME: No way to return failure. */ | |
2488 | abort (); | |
2489 | } | |
2490 | ||
b34976b6 | 2491 | return TRUE; |
252b5132 RH |
2492 | } |
2493 | ||
2494 | /* Create a relocation. */ | |
2495 | ||
b34976b6 | 2496 | bfd_boolean |
c58b9523 AM |
2497 | _bfd_generic_reloc_link_order (bfd *abfd, |
2498 | struct bfd_link_info *info, | |
2499 | asection *sec, | |
2500 | struct bfd_link_order *link_order) | |
252b5132 RH |
2501 | { |
2502 | arelent *r; | |
2503 | ||
1049f94e | 2504 | if (! info->relocatable) |
252b5132 | 2505 | abort (); |
c58b9523 | 2506 | if (sec->orelocation == NULL) |
252b5132 RH |
2507 | abort (); |
2508 | ||
c58b9523 AM |
2509 | r = bfd_alloc (abfd, sizeof (arelent)); |
2510 | if (r == NULL) | |
b34976b6 | 2511 | return FALSE; |
509945ae | 2512 | |
252b5132 RH |
2513 | r->address = link_order->offset; |
2514 | r->howto = bfd_reloc_type_lookup (abfd, link_order->u.reloc.p->reloc); | |
2515 | if (r->howto == 0) | |
2516 | { | |
2517 | bfd_set_error (bfd_error_bad_value); | |
b34976b6 | 2518 | return FALSE; |
252b5132 RH |
2519 | } |
2520 | ||
2521 | /* Get the symbol to use for the relocation. */ | |
2522 | if (link_order->type == bfd_section_reloc_link_order) | |
2523 | r->sym_ptr_ptr = link_order->u.reloc.p->u.section->symbol_ptr_ptr; | |
2524 | else | |
2525 | { | |
2526 | struct generic_link_hash_entry *h; | |
2527 | ||
2528 | h = ((struct generic_link_hash_entry *) | |
2529 | bfd_wrapped_link_hash_lookup (abfd, info, | |
2530 | link_order->u.reloc.p->u.name, | |
b34976b6 | 2531 | FALSE, FALSE, TRUE)); |
c58b9523 | 2532 | if (h == NULL |
252b5132 RH |
2533 | || ! h->written) |
2534 | { | |
2535 | if (! ((*info->callbacks->unattached_reloc) | |
c58b9523 | 2536 | (info, link_order->u.reloc.p->u.name, NULL, NULL, 0))) |
b34976b6 | 2537 | return FALSE; |
252b5132 | 2538 | bfd_set_error (bfd_error_bad_value); |
b34976b6 | 2539 | return FALSE; |
252b5132 RH |
2540 | } |
2541 | r->sym_ptr_ptr = &h->sym; | |
2542 | } | |
2543 | ||
2544 | /* If this is an inplace reloc, write the addend to the object file. | |
2545 | Otherwise, store it in the reloc addend. */ | |
2546 | if (! r->howto->partial_inplace) | |
2547 | r->addend = link_order->u.reloc.p->addend; | |
2548 | else | |
2549 | { | |
2550 | bfd_size_type size; | |
2551 | bfd_reloc_status_type rstat; | |
2552 | bfd_byte *buf; | |
b34976b6 | 2553 | bfd_boolean ok; |
dc810e39 | 2554 | file_ptr loc; |
252b5132 RH |
2555 | |
2556 | size = bfd_get_reloc_size (r->howto); | |
c58b9523 AM |
2557 | buf = bfd_zmalloc (size); |
2558 | if (buf == NULL) | |
b34976b6 | 2559 | return FALSE; |
252b5132 | 2560 | rstat = _bfd_relocate_contents (r->howto, abfd, |
dc810e39 AM |
2561 | (bfd_vma) link_order->u.reloc.p->addend, |
2562 | buf); | |
252b5132 RH |
2563 | switch (rstat) |
2564 | { | |
2565 | case bfd_reloc_ok: | |
2566 | break; | |
2567 | default: | |
2568 | case bfd_reloc_outofrange: | |
2569 | abort (); | |
2570 | case bfd_reloc_overflow: | |
2571 | if (! ((*info->callbacks->reloc_overflow) | |
dfeffb9f | 2572 | (info, NULL, |
252b5132 RH |
2573 | (link_order->type == bfd_section_reloc_link_order |
2574 | ? bfd_section_name (abfd, link_order->u.reloc.p->u.section) | |
2575 | : link_order->u.reloc.p->u.name), | |
2576 | r->howto->name, link_order->u.reloc.p->addend, | |
c58b9523 | 2577 | NULL, NULL, 0))) |
252b5132 RH |
2578 | { |
2579 | free (buf); | |
b34976b6 | 2580 | return FALSE; |
252b5132 RH |
2581 | } |
2582 | break; | |
2583 | } | |
dc810e39 | 2584 | loc = link_order->offset * bfd_octets_per_byte (abfd); |
c58b9523 | 2585 | ok = bfd_set_section_contents (abfd, sec, buf, loc, size); |
252b5132 RH |
2586 | free (buf); |
2587 | if (! ok) | |
b34976b6 | 2588 | return FALSE; |
252b5132 RH |
2589 | |
2590 | r->addend = 0; | |
2591 | } | |
2592 | ||
2593 | sec->orelocation[sec->reloc_count] = r; | |
2594 | ++sec->reloc_count; | |
2595 | ||
b34976b6 | 2596 | return TRUE; |
252b5132 RH |
2597 | } |
2598 | \f | |
2599 | /* Allocate a new link_order for a section. */ | |
2600 | ||
2601 | struct bfd_link_order * | |
c58b9523 | 2602 | bfd_new_link_order (bfd *abfd, asection *section) |
252b5132 | 2603 | { |
dc810e39 | 2604 | bfd_size_type amt = sizeof (struct bfd_link_order); |
fd96f80f AM |
2605 | struct bfd_link_order *new; |
2606 | ||
c58b9523 | 2607 | new = bfd_zalloc (abfd, amt); |
252b5132 RH |
2608 | if (!new) |
2609 | return NULL; | |
2610 | ||
2611 | new->type = bfd_undefined_link_order; | |
252b5132 | 2612 | |
c58b9523 | 2613 | if (section->link_order_tail != NULL) |
252b5132 RH |
2614 | section->link_order_tail->next = new; |
2615 | else | |
2616 | section->link_order_head = new; | |
2617 | section->link_order_tail = new; | |
2618 | ||
2619 | return new; | |
2620 | } | |
2621 | ||
2622 | /* Default link order processing routine. Note that we can not handle | |
2623 | the reloc_link_order types here, since they depend upon the details | |
2624 | of how the particular backends generates relocs. */ | |
2625 | ||
b34976b6 | 2626 | bfd_boolean |
c58b9523 AM |
2627 | _bfd_default_link_order (bfd *abfd, |
2628 | struct bfd_link_info *info, | |
2629 | asection *sec, | |
2630 | struct bfd_link_order *link_order) | |
252b5132 RH |
2631 | { |
2632 | switch (link_order->type) | |
2633 | { | |
2634 | case bfd_undefined_link_order: | |
2635 | case bfd_section_reloc_link_order: | |
2636 | case bfd_symbol_reloc_link_order: | |
2637 | default: | |
2638 | abort (); | |
2639 | case bfd_indirect_link_order: | |
2640 | return default_indirect_link_order (abfd, info, sec, link_order, | |
b34976b6 | 2641 | FALSE); |
252b5132 | 2642 | case bfd_data_link_order: |
fd96f80f | 2643 | return default_data_link_order (abfd, info, sec, link_order); |
252b5132 RH |
2644 | } |
2645 | } | |
2646 | ||
fd96f80f | 2647 | /* Default routine to handle a bfd_data_link_order. */ |
252b5132 | 2648 | |
b34976b6 | 2649 | static bfd_boolean |
c58b9523 AM |
2650 | default_data_link_order (bfd *abfd, |
2651 | struct bfd_link_info *info ATTRIBUTE_UNUSED, | |
2652 | asection *sec, | |
2653 | struct bfd_link_order *link_order) | |
252b5132 | 2654 | { |
dc810e39 | 2655 | bfd_size_type size; |
fd96f80f AM |
2656 | size_t fill_size; |
2657 | bfd_byte *fill; | |
0ac450b6 | 2658 | file_ptr loc; |
b34976b6 | 2659 | bfd_boolean result; |
252b5132 RH |
2660 | |
2661 | BFD_ASSERT ((sec->flags & SEC_HAS_CONTENTS) != 0); | |
2662 | ||
dc810e39 | 2663 | size = link_order->size; |
0ac450b6 | 2664 | if (size == 0) |
b34976b6 | 2665 | return TRUE; |
0ac450b6 | 2666 | |
fd96f80f AM |
2667 | fill = link_order->u.data.contents; |
2668 | fill_size = link_order->u.data.size; | |
2669 | if (fill_size != 0 && fill_size < size) | |
2670 | { | |
2671 | bfd_byte *p; | |
c58b9523 | 2672 | fill = bfd_malloc (size); |
fd96f80f | 2673 | if (fill == NULL) |
b34976b6 | 2674 | return FALSE; |
fd96f80f AM |
2675 | p = fill; |
2676 | if (fill_size == 1) | |
2677 | memset (p, (int) link_order->u.data.contents[0], (size_t) size); | |
2678 | else | |
2679 | { | |
2680 | do | |
2681 | { | |
2682 | memcpy (p, link_order->u.data.contents, fill_size); | |
2683 | p += fill_size; | |
2684 | size -= fill_size; | |
2685 | } | |
2686 | while (size >= fill_size); | |
2687 | if (size != 0) | |
2688 | memcpy (p, link_order->u.data.contents, (size_t) size); | |
2689 | size = link_order->size; | |
2690 | } | |
2691 | } | |
0ac450b6 | 2692 | |
dc810e39 | 2693 | loc = link_order->offset * bfd_octets_per_byte (abfd); |
fd96f80f | 2694 | result = bfd_set_section_contents (abfd, sec, fill, loc, size); |
0ac450b6 | 2695 | |
fd96f80f AM |
2696 | if (fill != link_order->u.data.contents) |
2697 | free (fill); | |
252b5132 RH |
2698 | return result; |
2699 | } | |
2700 | ||
2701 | /* Default routine to handle a bfd_indirect_link_order. */ | |
2702 | ||
b34976b6 | 2703 | static bfd_boolean |
c58b9523 AM |
2704 | default_indirect_link_order (bfd *output_bfd, |
2705 | struct bfd_link_info *info, | |
2706 | asection *output_section, | |
2707 | struct bfd_link_order *link_order, | |
2708 | bfd_boolean generic_linker) | |
252b5132 RH |
2709 | { |
2710 | asection *input_section; | |
2711 | bfd *input_bfd; | |
2712 | bfd_byte *contents = NULL; | |
2713 | bfd_byte *new_contents; | |
dc810e39 AM |
2714 | bfd_size_type sec_size; |
2715 | file_ptr loc; | |
252b5132 RH |
2716 | |
2717 | BFD_ASSERT ((output_section->flags & SEC_HAS_CONTENTS) != 0); | |
2718 | ||
2719 | if (link_order->size == 0) | |
b34976b6 | 2720 | return TRUE; |
252b5132 RH |
2721 | |
2722 | input_section = link_order->u.indirect.section; | |
2723 | input_bfd = input_section->owner; | |
2724 | ||
2725 | BFD_ASSERT (input_section->output_section == output_section); | |
2726 | BFD_ASSERT (input_section->output_offset == link_order->offset); | |
eea6121a | 2727 | BFD_ASSERT (input_section->size == link_order->size); |
252b5132 | 2728 | |
1049f94e | 2729 | if (info->relocatable |
252b5132 | 2730 | && input_section->reloc_count > 0 |
c58b9523 | 2731 | && output_section->orelocation == NULL) |
252b5132 RH |
2732 | { |
2733 | /* Space has not been allocated for the output relocations. | |
2734 | This can happen when we are called by a specific backend | |
2735 | because somebody is attempting to link together different | |
2736 | types of object files. Handling this case correctly is | |
2737 | difficult, and sometimes impossible. */ | |
2738 | (*_bfd_error_handler) | |
1049f94e | 2739 | (_("Attempt to do relocatable link with %s input and %s output"), |
252b5132 RH |
2740 | bfd_get_target (input_bfd), bfd_get_target (output_bfd)); |
2741 | bfd_set_error (bfd_error_wrong_format); | |
b34976b6 | 2742 | return FALSE; |
252b5132 RH |
2743 | } |
2744 | ||
2745 | if (! generic_linker) | |
2746 | { | |
2747 | asymbol **sympp; | |
2748 | asymbol **symppend; | |
2749 | ||
2750 | /* Get the canonical symbols. The generic linker will always | |
2751 | have retrieved them by this point, but we are being called by | |
2752 | a specific linker, presumably because we are linking | |
2753 | different types of object files together. */ | |
2754 | if (! generic_link_read_symbols (input_bfd)) | |
b34976b6 | 2755 | return FALSE; |
252b5132 RH |
2756 | |
2757 | /* Since we have been called by a specific linker, rather than | |
2758 | the generic linker, the values of the symbols will not be | |
2759 | right. They will be the values as seen in the input file, | |
2760 | not the values of the final link. We need to fix them up | |
2761 | before we can relocate the section. */ | |
2762 | sympp = _bfd_generic_link_get_symbols (input_bfd); | |
2763 | symppend = sympp + _bfd_generic_link_get_symcount (input_bfd); | |
2764 | for (; sympp < symppend; sympp++) | |
2765 | { | |
2766 | asymbol *sym; | |
2767 | struct bfd_link_hash_entry *h; | |
2768 | ||
2769 | sym = *sympp; | |
2770 | ||
2771 | if ((sym->flags & (BSF_INDIRECT | |
2772 | | BSF_WARNING | |
2773 | | BSF_GLOBAL | |
2774 | | BSF_CONSTRUCTOR | |
2775 | | BSF_WEAK)) != 0 | |
2776 | || bfd_is_und_section (bfd_get_section (sym)) | |
2777 | || bfd_is_com_section (bfd_get_section (sym)) | |
2778 | || bfd_is_ind_section (bfd_get_section (sym))) | |
2779 | { | |
2780 | /* sym->udata may have been set by | |
2781 | generic_link_add_symbol_list. */ | |
2782 | if (sym->udata.p != NULL) | |
c58b9523 | 2783 | h = sym->udata.p; |
252b5132 RH |
2784 | else if (bfd_is_und_section (bfd_get_section (sym))) |
2785 | h = bfd_wrapped_link_hash_lookup (output_bfd, info, | |
2786 | bfd_asymbol_name (sym), | |
b34976b6 | 2787 | FALSE, FALSE, TRUE); |
252b5132 RH |
2788 | else |
2789 | h = bfd_link_hash_lookup (info->hash, | |
2790 | bfd_asymbol_name (sym), | |
b34976b6 | 2791 | FALSE, FALSE, TRUE); |
252b5132 RH |
2792 | if (h != NULL) |
2793 | set_symbol_from_hash (sym, h); | |
2794 | } | |
509945ae | 2795 | } |
252b5132 RH |
2796 | } |
2797 | ||
2798 | /* Get and relocate the section contents. */ | |
1a23a9e6 AM |
2799 | sec_size = (input_section->rawsize > input_section->size |
2800 | ? input_section->rawsize | |
2801 | : input_section->size); | |
c58b9523 | 2802 | contents = bfd_malloc (sec_size); |
dc810e39 | 2803 | if (contents == NULL && sec_size != 0) |
252b5132 RH |
2804 | goto error_return; |
2805 | new_contents = (bfd_get_relocated_section_contents | |
1049f94e | 2806 | (output_bfd, info, link_order, contents, info->relocatable, |
252b5132 RH |
2807 | _bfd_generic_link_get_symbols (input_bfd))); |
2808 | if (!new_contents) | |
2809 | goto error_return; | |
2810 | ||
2811 | /* Output the section contents. */ | |
dc810e39 | 2812 | loc = link_order->offset * bfd_octets_per_byte (output_bfd); |
252b5132 | 2813 | if (! bfd_set_section_contents (output_bfd, output_section, |
c58b9523 | 2814 | new_contents, loc, link_order->size)) |
252b5132 RH |
2815 | goto error_return; |
2816 | ||
2817 | if (contents != NULL) | |
2818 | free (contents); | |
b34976b6 | 2819 | return TRUE; |
252b5132 RH |
2820 | |
2821 | error_return: | |
2822 | if (contents != NULL) | |
2823 | free (contents); | |
b34976b6 | 2824 | return FALSE; |
252b5132 RH |
2825 | } |
2826 | ||
2827 | /* A little routine to count the number of relocs in a link_order | |
2828 | list. */ | |
2829 | ||
2830 | unsigned int | |
c58b9523 | 2831 | _bfd_count_link_order_relocs (struct bfd_link_order *link_order) |
252b5132 RH |
2832 | { |
2833 | register unsigned int c; | |
2834 | register struct bfd_link_order *l; | |
2835 | ||
2836 | c = 0; | |
c58b9523 | 2837 | for (l = link_order; l != NULL; l = l->next) |
252b5132 RH |
2838 | { |
2839 | if (l->type == bfd_section_reloc_link_order | |
2840 | || l->type == bfd_symbol_reloc_link_order) | |
2841 | ++c; | |
2842 | } | |
2843 | ||
2844 | return c; | |
2845 | } | |
2846 | ||
2847 | /* | |
2848 | FUNCTION | |
2849 | bfd_link_split_section | |
2850 | ||
2851 | SYNOPSIS | |
c58b9523 | 2852 | bfd_boolean bfd_link_split_section (bfd *abfd, asection *sec); |
252b5132 RH |
2853 | |
2854 | DESCRIPTION | |
2855 | Return nonzero if @var{sec} should be split during a | |
2856 | reloceatable or final link. | |
2857 | ||
2858 | .#define bfd_link_split_section(abfd, sec) \ | |
2859 | . BFD_SEND (abfd, _bfd_link_split_section, (abfd, sec)) | |
2860 | . | |
2861 | ||
2862 | */ | |
2863 | ||
b34976b6 | 2864 | bfd_boolean |
c58b9523 AM |
2865 | _bfd_generic_link_split_section (bfd *abfd ATTRIBUTE_UNUSED, |
2866 | asection *sec ATTRIBUTE_UNUSED) | |
252b5132 | 2867 | { |
b34976b6 | 2868 | return FALSE; |
252b5132 | 2869 | } |
082b7297 L |
2870 | |
2871 | /* | |
2872 | FUNCTION | |
2873 | bfd_section_already_linked | |
2874 | ||
2875 | SYNOPSIS | |
2876 | void bfd_section_already_linked (bfd *abfd, asection *sec); | |
2877 | ||
2878 | DESCRIPTION | |
2879 | Check if @var{sec} has been already linked during a reloceatable | |
2880 | or final link. | |
2881 | ||
2882 | .#define bfd_section_already_linked(abfd, sec) \ | |
2883 | . BFD_SEND (abfd, _section_already_linked, (abfd, sec)) | |
2884 | . | |
2885 | ||
2886 | */ | |
2887 | ||
2888 | /* Sections marked with the SEC_LINK_ONCE flag should only be linked | |
2889 | once into the output. This routine checks each section, and | |
2890 | arrange to discard it if a section of the same name has already | |
2891 | been linked. This code assumes that all relevant sections have the | |
2892 | SEC_LINK_ONCE flag set; that is, it does not depend solely upon the | |
2893 | section name. bfd_section_already_linked is called via | |
2894 | bfd_map_over_sections. */ | |
2895 | ||
2896 | /* The hash table. */ | |
2897 | ||
2898 | static struct bfd_hash_table _bfd_section_already_linked_table; | |
2899 | ||
2900 | /* Support routines for the hash table used by section_already_linked, | |
3d7f7666 L |
2901 | initialize the table, traverse, lookup, fill in an entry and remove |
2902 | the table. */ | |
2903 | ||
2904 | void | |
2905 | bfd_section_already_linked_table_traverse | |
2906 | (bfd_boolean (*func) (struct bfd_section_already_linked_hash_entry *, | |
2907 | void *), void *info) | |
2908 | { | |
2909 | bfd_hash_traverse (&_bfd_section_already_linked_table, | |
2910 | (bfd_boolean (*) (struct bfd_hash_entry *, | |
2911 | void *)) func, | |
2912 | info); | |
2913 | } | |
082b7297 L |
2914 | |
2915 | struct bfd_section_already_linked_hash_entry * | |
2916 | bfd_section_already_linked_table_lookup (const char *name) | |
2917 | { | |
2918 | return ((struct bfd_section_already_linked_hash_entry *) | |
2919 | bfd_hash_lookup (&_bfd_section_already_linked_table, name, | |
2920 | TRUE, FALSE)); | |
2921 | } | |
2922 | ||
2923 | void | |
2924 | bfd_section_already_linked_table_insert | |
2925 | (struct bfd_section_already_linked_hash_entry *already_linked_list, | |
2926 | asection *sec) | |
2927 | { | |
2928 | struct bfd_section_already_linked *l; | |
2929 | ||
2930 | /* Allocate the memory from the same obstack as the hash table is | |
2931 | kept in. */ | |
2932 | l = bfd_hash_allocate (&_bfd_section_already_linked_table, sizeof *l); | |
2933 | l->sec = sec; | |
2934 | l->next = already_linked_list->entry; | |
2935 | already_linked_list->entry = l; | |
2936 | } | |
2937 | ||
2938 | static struct bfd_hash_entry * | |
2939 | already_linked_newfunc (struct bfd_hash_entry *entry ATTRIBUTE_UNUSED, | |
2940 | struct bfd_hash_table *table, | |
2941 | const char *string ATTRIBUTE_UNUSED) | |
2942 | { | |
2943 | struct bfd_section_already_linked_hash_entry *ret = | |
2944 | bfd_hash_allocate (table, sizeof *ret); | |
2945 | ||
2946 | ret->entry = NULL; | |
2947 | ||
2948 | return &ret->root; | |
2949 | } | |
2950 | ||
2951 | bfd_boolean | |
2952 | bfd_section_already_linked_table_init (void) | |
2953 | { | |
2954 | return bfd_hash_table_init_n (&_bfd_section_already_linked_table, | |
2955 | already_linked_newfunc, 42); | |
2956 | } | |
2957 | ||
2958 | void | |
2959 | bfd_section_already_linked_table_free (void) | |
2960 | { | |
2961 | bfd_hash_table_free (&_bfd_section_already_linked_table); | |
2962 | } | |
2963 | ||
2964 | /* This is used on non-ELF inputs. */ | |
2965 | ||
2966 | void | |
2967 | _bfd_generic_section_already_linked (bfd *abfd, asection *sec) | |
2968 | { | |
2969 | flagword flags; | |
2970 | const char *name; | |
2971 | struct bfd_section_already_linked *l; | |
2972 | struct bfd_section_already_linked_hash_entry *already_linked_list; | |
2973 | ||
2974 | flags = sec->flags; | |
2975 | if ((flags & SEC_LINK_ONCE) == 0) | |
2976 | return; | |
2977 | ||
2978 | /* FIXME: When doing a relocatable link, we may have trouble | |
2979 | copying relocations in other sections that refer to local symbols | |
2980 | in the section being discarded. Those relocations will have to | |
2981 | be converted somehow; as of this writing I'm not sure that any of | |
2982 | the backends handle that correctly. | |
2983 | ||
2984 | It is tempting to instead not discard link once sections when | |
2985 | doing a relocatable link (technically, they should be discarded | |
2986 | whenever we are building constructors). However, that fails, | |
2987 | because the linker winds up combining all the link once sections | |
2988 | into a single large link once section, which defeats the purpose | |
2989 | of having link once sections in the first place. */ | |
2990 | ||
2991 | name = bfd_get_section_name (abfd, sec); | |
2992 | ||
2993 | already_linked_list = bfd_section_already_linked_table_lookup (name); | |
2994 | ||
2995 | for (l = already_linked_list->entry; l != NULL; l = l->next) | |
2996 | { | |
2997 | bfd_boolean skip = FALSE; | |
2998 | struct coff_comdat_info *s_comdat | |
2999 | = bfd_coff_get_comdat_section (abfd, sec); | |
3000 | struct coff_comdat_info *l_comdat | |
3001 | = bfd_coff_get_comdat_section (l->sec->owner, l->sec); | |
3002 | ||
3003 | /* We may have 3 different sections on the list: group section, | |
3004 | comdat section and linkonce section. SEC may be a linkonce or | |
3005 | comdat section. We always ignore group section. For non-COFF | |
3006 | inputs, we also ignore comdat section. | |
3007 | ||
3008 | FIXME: Is that safe to match a linkonce section with a comdat | |
3009 | section for COFF inputs? */ | |
3010 | if ((l->sec->flags & SEC_GROUP) != 0) | |
3011 | skip = TRUE; | |
3012 | else if (bfd_get_flavour (abfd) == bfd_target_coff_flavour) | |
3013 | { | |
3014 | if (s_comdat != NULL | |
3015 | && l_comdat != NULL | |
3016 | && strcmp (s_comdat->name, l_comdat->name) != 0) | |
3017 | skip = TRUE; | |
3018 | } | |
3019 | else if (l_comdat != NULL) | |
3020 | skip = TRUE; | |
3021 | ||
3022 | if (!skip) | |
3023 | { | |
3024 | /* The section has already been linked. See if we should | |
3025 | issue a warning. */ | |
3026 | switch (flags & SEC_LINK_DUPLICATES) | |
3027 | { | |
3028 | default: | |
3029 | abort (); | |
3030 | ||
3031 | case SEC_LINK_DUPLICATES_DISCARD: | |
3032 | break; | |
3033 | ||
3034 | case SEC_LINK_DUPLICATES_ONE_ONLY: | |
d003868e AM |
3035 | (*_bfd_error_handler) |
3036 | (_("%B: warning: ignoring duplicate section `%A'\n"), | |
3037 | abfd, sec); | |
082b7297 L |
3038 | break; |
3039 | ||
3040 | case SEC_LINK_DUPLICATES_SAME_CONTENTS: | |
3041 | /* FIXME: We should really dig out the contents of both | |
3042 | sections and memcmp them. The COFF/PE spec says that | |
3043 | the Microsoft linker does not implement this | |
3044 | correctly, so I'm not going to bother doing it | |
3045 | either. */ | |
3046 | /* Fall through. */ | |
3047 | case SEC_LINK_DUPLICATES_SAME_SIZE: | |
3048 | if (sec->size != l->sec->size) | |
3049 | (*_bfd_error_handler) | |
d003868e AM |
3050 | (_("%B: warning: duplicate section `%A' has different size\n"), |
3051 | abfd, sec); | |
082b7297 L |
3052 | break; |
3053 | } | |
3054 | ||
3055 | /* Set the output_section field so that lang_add_section | |
3056 | does not create a lang_input_section structure for this | |
3057 | section. Since there might be a symbol in the section | |
3058 | being discarded, we must retain a pointer to the section | |
3059 | which we are really going to use. */ | |
3060 | sec->output_section = bfd_abs_section_ptr; | |
3061 | sec->kept_section = l->sec; | |
3062 | ||
3063 | return; | |
3064 | } | |
3065 | } | |
3066 | ||
3067 | /* This is the first section with this name. Record it. */ | |
3068 | bfd_section_already_linked_table_insert (already_linked_list, sec); | |
3069 | } |