Commit | Line | Data |
---|---|---|
252b5132 | 1 | /* ELF linking support for BFD. |
051d5130 | 2 | Copyright 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004 |
7898deda | 3 | Free Software Foundation, Inc. |
252b5132 RH |
4 | |
5 | This file is part of BFD, the Binary File Descriptor library. | |
6 | ||
7 | This program is free software; you can redistribute it and/or modify | |
8 | it under the terms of the GNU General Public License as published by | |
9 | the Free Software Foundation; either version 2 of the License, or | |
10 | (at your option) any later version. | |
11 | ||
12 | This program is distributed in the hope that it will be useful, | |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
18 | along with this program; if not, write to the Free Software | |
19 | Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ | |
20 | ||
21 | #include "bfd.h" | |
22 | #include "sysdep.h" | |
23 | #include "bfdlink.h" | |
24 | #include "libbfd.h" | |
25 | #define ARCH_SIZE 0 | |
26 | #include "elf-bfd.h" | |
27 | ||
b34976b6 | 28 | bfd_boolean |
268b6b39 | 29 | _bfd_elf_create_got_section (bfd *abfd, struct bfd_link_info *info) |
252b5132 RH |
30 | { |
31 | flagword flags; | |
aad5d350 | 32 | asection *s; |
252b5132 | 33 | struct elf_link_hash_entry *h; |
14a793b2 | 34 | struct bfd_link_hash_entry *bh; |
9c5bfbb7 | 35 | const struct elf_backend_data *bed = get_elf_backend_data (abfd); |
252b5132 RH |
36 | int ptralign; |
37 | ||
38 | /* This function may be called more than once. */ | |
aad5d350 AM |
39 | s = bfd_get_section_by_name (abfd, ".got"); |
40 | if (s != NULL && (s->flags & SEC_LINKER_CREATED) != 0) | |
b34976b6 | 41 | return TRUE; |
252b5132 RH |
42 | |
43 | switch (bed->s->arch_size) | |
44 | { | |
bb0deeff AO |
45 | case 32: |
46 | ptralign = 2; | |
47 | break; | |
48 | ||
49 | case 64: | |
50 | ptralign = 3; | |
51 | break; | |
52 | ||
53 | default: | |
54 | bfd_set_error (bfd_error_bad_value); | |
b34976b6 | 55 | return FALSE; |
252b5132 RH |
56 | } |
57 | ||
58 | flags = (SEC_ALLOC | SEC_LOAD | SEC_HAS_CONTENTS | SEC_IN_MEMORY | |
59 | | SEC_LINKER_CREATED); | |
60 | ||
61 | s = bfd_make_section (abfd, ".got"); | |
62 | if (s == NULL | |
63 | || !bfd_set_section_flags (abfd, s, flags) | |
64 | || !bfd_set_section_alignment (abfd, s, ptralign)) | |
b34976b6 | 65 | return FALSE; |
252b5132 RH |
66 | |
67 | if (bed->want_got_plt) | |
68 | { | |
69 | s = bfd_make_section (abfd, ".got.plt"); | |
70 | if (s == NULL | |
71 | || !bfd_set_section_flags (abfd, s, flags) | |
72 | || !bfd_set_section_alignment (abfd, s, ptralign)) | |
b34976b6 | 73 | return FALSE; |
252b5132 RH |
74 | } |
75 | ||
2517a57f AM |
76 | if (bed->want_got_sym) |
77 | { | |
78 | /* Define the symbol _GLOBAL_OFFSET_TABLE_ at the start of the .got | |
79 | (or .got.plt) section. We don't do this in the linker script | |
80 | because we don't want to define the symbol if we are not creating | |
81 | a global offset table. */ | |
14a793b2 | 82 | bh = NULL; |
2517a57f AM |
83 | if (!(_bfd_generic_link_add_one_symbol |
84 | (info, abfd, "_GLOBAL_OFFSET_TABLE_", BSF_GLOBAL, s, | |
268b6b39 | 85 | bed->got_symbol_offset, NULL, FALSE, bed->collect, &bh))) |
b34976b6 | 86 | return FALSE; |
14a793b2 | 87 | h = (struct elf_link_hash_entry *) bh; |
2517a57f AM |
88 | h->elf_link_hash_flags |= ELF_LINK_HASH_DEF_REGULAR; |
89 | h->type = STT_OBJECT; | |
252b5132 | 90 | |
36af4a4e | 91 | if (! info->executable |
2517a57f | 92 | && ! _bfd_elf_link_record_dynamic_symbol (info, h)) |
b34976b6 | 93 | return FALSE; |
252b5132 | 94 | |
2517a57f AM |
95 | elf_hash_table (info)->hgot = h; |
96 | } | |
252b5132 RH |
97 | |
98 | /* The first bit of the global offset table is the header. */ | |
99 | s->_raw_size += bed->got_header_size + bed->got_symbol_offset; | |
100 | ||
b34976b6 | 101 | return TRUE; |
252b5132 RH |
102 | } |
103 | \f | |
45d6a902 AM |
104 | /* Create some sections which will be filled in with dynamic linking |
105 | information. ABFD is an input file which requires dynamic sections | |
106 | to be created. The dynamic sections take up virtual memory space | |
107 | when the final executable is run, so we need to create them before | |
108 | addresses are assigned to the output sections. We work out the | |
109 | actual contents and size of these sections later. */ | |
252b5132 | 110 | |
b34976b6 | 111 | bfd_boolean |
268b6b39 | 112 | _bfd_elf_link_create_dynamic_sections (bfd *abfd, struct bfd_link_info *info) |
252b5132 | 113 | { |
45d6a902 AM |
114 | flagword flags; |
115 | register asection *s; | |
116 | struct elf_link_hash_entry *h; | |
117 | struct bfd_link_hash_entry *bh; | |
9c5bfbb7 | 118 | const struct elf_backend_data *bed; |
252b5132 | 119 | |
0eddce27 | 120 | if (! is_elf_hash_table (info->hash)) |
45d6a902 AM |
121 | return FALSE; |
122 | ||
123 | if (elf_hash_table (info)->dynamic_sections_created) | |
124 | return TRUE; | |
125 | ||
126 | /* Make sure that all dynamic sections use the same input BFD. */ | |
127 | if (elf_hash_table (info)->dynobj == NULL) | |
128 | elf_hash_table (info)->dynobj = abfd; | |
129 | else | |
130 | abfd = elf_hash_table (info)->dynobj; | |
131 | ||
132 | /* Note that we set the SEC_IN_MEMORY flag for all of these | |
133 | sections. */ | |
134 | flags = (SEC_ALLOC | SEC_LOAD | SEC_HAS_CONTENTS | |
135 | | SEC_IN_MEMORY | SEC_LINKER_CREATED); | |
136 | ||
137 | /* A dynamically linked executable has a .interp section, but a | |
138 | shared library does not. */ | |
36af4a4e | 139 | if (info->executable) |
252b5132 | 140 | { |
45d6a902 AM |
141 | s = bfd_make_section (abfd, ".interp"); |
142 | if (s == NULL | |
143 | || ! bfd_set_section_flags (abfd, s, flags | SEC_READONLY)) | |
144 | return FALSE; | |
145 | } | |
bb0deeff | 146 | |
0eddce27 | 147 | if (! info->traditional_format) |
45d6a902 AM |
148 | { |
149 | s = bfd_make_section (abfd, ".eh_frame_hdr"); | |
150 | if (s == NULL | |
151 | || ! bfd_set_section_flags (abfd, s, flags | SEC_READONLY) | |
152 | || ! bfd_set_section_alignment (abfd, s, 2)) | |
153 | return FALSE; | |
154 | elf_hash_table (info)->eh_info.hdr_sec = s; | |
155 | } | |
bb0deeff | 156 | |
45d6a902 AM |
157 | bed = get_elf_backend_data (abfd); |
158 | ||
159 | /* Create sections to hold version informations. These are removed | |
160 | if they are not needed. */ | |
161 | s = bfd_make_section (abfd, ".gnu.version_d"); | |
162 | if (s == NULL | |
163 | || ! bfd_set_section_flags (abfd, s, flags | SEC_READONLY) | |
164 | || ! bfd_set_section_alignment (abfd, s, bed->s->log_file_align)) | |
165 | return FALSE; | |
166 | ||
167 | s = bfd_make_section (abfd, ".gnu.version"); | |
168 | if (s == NULL | |
169 | || ! bfd_set_section_flags (abfd, s, flags | SEC_READONLY) | |
170 | || ! bfd_set_section_alignment (abfd, s, 1)) | |
171 | return FALSE; | |
172 | ||
173 | s = bfd_make_section (abfd, ".gnu.version_r"); | |
174 | if (s == NULL | |
175 | || ! bfd_set_section_flags (abfd, s, flags | SEC_READONLY) | |
176 | || ! bfd_set_section_alignment (abfd, s, bed->s->log_file_align)) | |
177 | return FALSE; | |
178 | ||
179 | s = bfd_make_section (abfd, ".dynsym"); | |
180 | if (s == NULL | |
181 | || ! bfd_set_section_flags (abfd, s, flags | SEC_READONLY) | |
182 | || ! bfd_set_section_alignment (abfd, s, bed->s->log_file_align)) | |
183 | return FALSE; | |
184 | ||
185 | s = bfd_make_section (abfd, ".dynstr"); | |
186 | if (s == NULL | |
187 | || ! bfd_set_section_flags (abfd, s, flags | SEC_READONLY)) | |
188 | return FALSE; | |
189 | ||
190 | /* Create a strtab to hold the dynamic symbol names. */ | |
191 | if (elf_hash_table (info)->dynstr == NULL) | |
192 | { | |
193 | elf_hash_table (info)->dynstr = _bfd_elf_strtab_init (); | |
194 | if (elf_hash_table (info)->dynstr == NULL) | |
195 | return FALSE; | |
252b5132 RH |
196 | } |
197 | ||
45d6a902 AM |
198 | s = bfd_make_section (abfd, ".dynamic"); |
199 | if (s == NULL | |
200 | || ! bfd_set_section_flags (abfd, s, flags) | |
201 | || ! bfd_set_section_alignment (abfd, s, bed->s->log_file_align)) | |
202 | return FALSE; | |
203 | ||
204 | /* The special symbol _DYNAMIC is always set to the start of the | |
205 | .dynamic section. This call occurs before we have processed the | |
206 | symbols for any dynamic object, so we don't have to worry about | |
207 | overriding a dynamic definition. We could set _DYNAMIC in a | |
208 | linker script, but we only want to define it if we are, in fact, | |
209 | creating a .dynamic section. We don't want to define it if there | |
210 | is no .dynamic section, since on some ELF platforms the start up | |
211 | code examines it to decide how to initialize the process. */ | |
212 | bh = NULL; | |
213 | if (! (_bfd_generic_link_add_one_symbol | |
268b6b39 AM |
214 | (info, abfd, "_DYNAMIC", BSF_GLOBAL, s, 0, NULL, FALSE, |
215 | get_elf_backend_data (abfd)->collect, &bh))) | |
45d6a902 AM |
216 | return FALSE; |
217 | h = (struct elf_link_hash_entry *) bh; | |
218 | h->elf_link_hash_flags |= ELF_LINK_HASH_DEF_REGULAR; | |
219 | h->type = STT_OBJECT; | |
220 | ||
36af4a4e | 221 | if (! info->executable |
45d6a902 AM |
222 | && ! _bfd_elf_link_record_dynamic_symbol (info, h)) |
223 | return FALSE; | |
224 | ||
225 | s = bfd_make_section (abfd, ".hash"); | |
226 | if (s == NULL | |
227 | || ! bfd_set_section_flags (abfd, s, flags | SEC_READONLY) | |
228 | || ! bfd_set_section_alignment (abfd, s, bed->s->log_file_align)) | |
229 | return FALSE; | |
230 | elf_section_data (s)->this_hdr.sh_entsize = bed->s->sizeof_hash_entry; | |
231 | ||
232 | /* Let the backend create the rest of the sections. This lets the | |
233 | backend set the right flags. The backend will normally create | |
234 | the .got and .plt sections. */ | |
235 | if (! (*bed->elf_backend_create_dynamic_sections) (abfd, info)) | |
236 | return FALSE; | |
237 | ||
238 | elf_hash_table (info)->dynamic_sections_created = TRUE; | |
239 | ||
240 | return TRUE; | |
241 | } | |
242 | ||
243 | /* Create dynamic sections when linking against a dynamic object. */ | |
244 | ||
245 | bfd_boolean | |
268b6b39 | 246 | _bfd_elf_create_dynamic_sections (bfd *abfd, struct bfd_link_info *info) |
45d6a902 AM |
247 | { |
248 | flagword flags, pltflags; | |
249 | asection *s; | |
9c5bfbb7 | 250 | const struct elf_backend_data *bed = get_elf_backend_data (abfd); |
45d6a902 | 251 | |
252b5132 RH |
252 | /* We need to create .plt, .rel[a].plt, .got, .got.plt, .dynbss, and |
253 | .rel[a].bss sections. */ | |
254 | ||
255 | flags = (SEC_ALLOC | SEC_LOAD | SEC_HAS_CONTENTS | SEC_IN_MEMORY | |
256 | | SEC_LINKER_CREATED); | |
257 | ||
258 | pltflags = flags; | |
259 | pltflags |= SEC_CODE; | |
260 | if (bed->plt_not_loaded) | |
5d1634d7 | 261 | pltflags &= ~ (SEC_CODE | SEC_LOAD | SEC_HAS_CONTENTS); |
252b5132 RH |
262 | if (bed->plt_readonly) |
263 | pltflags |= SEC_READONLY; | |
264 | ||
265 | s = bfd_make_section (abfd, ".plt"); | |
266 | if (s == NULL | |
267 | || ! bfd_set_section_flags (abfd, s, pltflags) | |
268 | || ! bfd_set_section_alignment (abfd, s, bed->plt_alignment)) | |
b34976b6 | 269 | return FALSE; |
252b5132 RH |
270 | |
271 | if (bed->want_plt_sym) | |
272 | { | |
273 | /* Define the symbol _PROCEDURE_LINKAGE_TABLE_ at the start of the | |
274 | .plt section. */ | |
14a793b2 AM |
275 | struct elf_link_hash_entry *h; |
276 | struct bfd_link_hash_entry *bh = NULL; | |
277 | ||
252b5132 | 278 | if (! (_bfd_generic_link_add_one_symbol |
268b6b39 AM |
279 | (info, abfd, "_PROCEDURE_LINKAGE_TABLE_", BSF_GLOBAL, s, 0, NULL, |
280 | FALSE, get_elf_backend_data (abfd)->collect, &bh))) | |
b34976b6 | 281 | return FALSE; |
14a793b2 | 282 | h = (struct elf_link_hash_entry *) bh; |
252b5132 RH |
283 | h->elf_link_hash_flags |= ELF_LINK_HASH_DEF_REGULAR; |
284 | h->type = STT_OBJECT; | |
285 | ||
36af4a4e | 286 | if (! info->executable |
252b5132 | 287 | && ! _bfd_elf_link_record_dynamic_symbol (info, h)) |
b34976b6 | 288 | return FALSE; |
252b5132 RH |
289 | } |
290 | ||
3e932841 | 291 | s = bfd_make_section (abfd, |
bf572ba0 | 292 | bed->default_use_rela_p ? ".rela.plt" : ".rel.plt"); |
252b5132 RH |
293 | if (s == NULL |
294 | || ! bfd_set_section_flags (abfd, s, flags | SEC_READONLY) | |
45d6a902 | 295 | || ! bfd_set_section_alignment (abfd, s, bed->s->log_file_align)) |
b34976b6 | 296 | return FALSE; |
252b5132 RH |
297 | |
298 | if (! _bfd_elf_create_got_section (abfd, info)) | |
b34976b6 | 299 | return FALSE; |
252b5132 | 300 | |
3018b441 RH |
301 | if (bed->want_dynbss) |
302 | { | |
303 | /* The .dynbss section is a place to put symbols which are defined | |
304 | by dynamic objects, are referenced by regular objects, and are | |
305 | not functions. We must allocate space for them in the process | |
306 | image and use a R_*_COPY reloc to tell the dynamic linker to | |
307 | initialize them at run time. The linker script puts the .dynbss | |
308 | section into the .bss section of the final image. */ | |
309 | s = bfd_make_section (abfd, ".dynbss"); | |
310 | if (s == NULL | |
77f3d027 | 311 | || ! bfd_set_section_flags (abfd, s, SEC_ALLOC | SEC_LINKER_CREATED)) |
b34976b6 | 312 | return FALSE; |
252b5132 | 313 | |
3018b441 | 314 | /* The .rel[a].bss section holds copy relocs. This section is not |
252b5132 RH |
315 | normally needed. We need to create it here, though, so that the |
316 | linker will map it to an output section. We can't just create it | |
317 | only if we need it, because we will not know whether we need it | |
318 | until we have seen all the input files, and the first time the | |
319 | main linker code calls BFD after examining all the input files | |
320 | (size_dynamic_sections) the input sections have already been | |
321 | mapped to the output sections. If the section turns out not to | |
322 | be needed, we can discard it later. We will never need this | |
323 | section when generating a shared object, since they do not use | |
324 | copy relocs. */ | |
3018b441 RH |
325 | if (! info->shared) |
326 | { | |
3e932841 KH |
327 | s = bfd_make_section (abfd, |
328 | (bed->default_use_rela_p | |
329 | ? ".rela.bss" : ".rel.bss")); | |
3018b441 RH |
330 | if (s == NULL |
331 | || ! bfd_set_section_flags (abfd, s, flags | SEC_READONLY) | |
45d6a902 | 332 | || ! bfd_set_section_alignment (abfd, s, bed->s->log_file_align)) |
b34976b6 | 333 | return FALSE; |
3018b441 | 334 | } |
252b5132 RH |
335 | } |
336 | ||
b34976b6 | 337 | return TRUE; |
252b5132 RH |
338 | } |
339 | \f | |
252b5132 RH |
340 | /* Record a new dynamic symbol. We record the dynamic symbols as we |
341 | read the input files, since we need to have a list of all of them | |
342 | before we can determine the final sizes of the output sections. | |
343 | Note that we may actually call this function even though we are not | |
344 | going to output any dynamic symbols; in some cases we know that a | |
345 | symbol should be in the dynamic symbol table, but only if there is | |
346 | one. */ | |
347 | ||
b34976b6 | 348 | bfd_boolean |
268b6b39 AM |
349 | _bfd_elf_link_record_dynamic_symbol (struct bfd_link_info *info, |
350 | struct elf_link_hash_entry *h) | |
252b5132 RH |
351 | { |
352 | if (h->dynindx == -1) | |
353 | { | |
2b0f7ef9 | 354 | struct elf_strtab_hash *dynstr; |
68b6ddd0 | 355 | char *p; |
252b5132 | 356 | const char *name; |
252b5132 RH |
357 | bfd_size_type indx; |
358 | ||
7a13edea NC |
359 | /* XXX: The ABI draft says the linker must turn hidden and |
360 | internal symbols into STB_LOCAL symbols when producing the | |
361 | DSO. However, if ld.so honors st_other in the dynamic table, | |
362 | this would not be necessary. */ | |
363 | switch (ELF_ST_VISIBILITY (h->other)) | |
364 | { | |
365 | case STV_INTERNAL: | |
366 | case STV_HIDDEN: | |
9d6eee78 L |
367 | if (h->root.type != bfd_link_hash_undefined |
368 | && h->root.type != bfd_link_hash_undefweak) | |
38048eb9 L |
369 | { |
370 | h->elf_link_hash_flags |= ELF_LINK_FORCED_LOCAL; | |
b34976b6 | 371 | return TRUE; |
7a13edea | 372 | } |
0444bdd4 | 373 | |
7a13edea NC |
374 | default: |
375 | break; | |
376 | } | |
377 | ||
252b5132 RH |
378 | h->dynindx = elf_hash_table (info)->dynsymcount; |
379 | ++elf_hash_table (info)->dynsymcount; | |
380 | ||
381 | dynstr = elf_hash_table (info)->dynstr; | |
382 | if (dynstr == NULL) | |
383 | { | |
384 | /* Create a strtab to hold the dynamic symbol names. */ | |
2b0f7ef9 | 385 | elf_hash_table (info)->dynstr = dynstr = _bfd_elf_strtab_init (); |
252b5132 | 386 | if (dynstr == NULL) |
b34976b6 | 387 | return FALSE; |
252b5132 RH |
388 | } |
389 | ||
390 | /* We don't put any version information in the dynamic string | |
aad5d350 | 391 | table. */ |
252b5132 RH |
392 | name = h->root.root.string; |
393 | p = strchr (name, ELF_VER_CHR); | |
68b6ddd0 AM |
394 | if (p != NULL) |
395 | /* We know that the p points into writable memory. In fact, | |
396 | there are only a few symbols that have read-only names, being | |
397 | those like _GLOBAL_OFFSET_TABLE_ that are created specially | |
398 | by the backends. Most symbols will have names pointing into | |
399 | an ELF string table read from a file, or to objalloc memory. */ | |
400 | *p = 0; | |
401 | ||
402 | indx = _bfd_elf_strtab_add (dynstr, name, p != NULL); | |
403 | ||
404 | if (p != NULL) | |
405 | *p = ELF_VER_CHR; | |
252b5132 RH |
406 | |
407 | if (indx == (bfd_size_type) -1) | |
b34976b6 | 408 | return FALSE; |
252b5132 RH |
409 | h->dynstr_index = indx; |
410 | } | |
411 | ||
b34976b6 | 412 | return TRUE; |
252b5132 | 413 | } |
45d6a902 AM |
414 | \f |
415 | /* Record an assignment to a symbol made by a linker script. We need | |
416 | this in case some dynamic object refers to this symbol. */ | |
417 | ||
418 | bfd_boolean | |
268b6b39 AM |
419 | bfd_elf_record_link_assignment (bfd *output_bfd ATTRIBUTE_UNUSED, |
420 | struct bfd_link_info *info, | |
421 | const char *name, | |
422 | bfd_boolean provide) | |
45d6a902 AM |
423 | { |
424 | struct elf_link_hash_entry *h; | |
425 | ||
0eddce27 | 426 | if (!is_elf_hash_table (info->hash)) |
45d6a902 AM |
427 | return TRUE; |
428 | ||
429 | h = elf_link_hash_lookup (elf_hash_table (info), name, TRUE, TRUE, FALSE); | |
430 | if (h == NULL) | |
431 | return FALSE; | |
432 | ||
02bb6eae AO |
433 | /* Since we're defining the symbol, don't let it seem to have not |
434 | been defined. record_dynamic_symbol and size_dynamic_sections | |
435 | may depend on this. */ | |
436 | if (h->root.type == bfd_link_hash_undefweak | |
437 | || h->root.type == bfd_link_hash_undefined) | |
438 | h->root.type = bfd_link_hash_new; | |
439 | ||
45d6a902 AM |
440 | if (h->root.type == bfd_link_hash_new) |
441 | h->elf_link_hash_flags &= ~ELF_LINK_NON_ELF; | |
442 | ||
443 | /* If this symbol is being provided by the linker script, and it is | |
444 | currently defined by a dynamic object, but not by a regular | |
445 | object, then mark it as undefined so that the generic linker will | |
446 | force the correct value. */ | |
447 | if (provide | |
448 | && (h->elf_link_hash_flags & ELF_LINK_HASH_DEF_DYNAMIC) != 0 | |
449 | && (h->elf_link_hash_flags & ELF_LINK_HASH_DEF_REGULAR) == 0) | |
450 | h->root.type = bfd_link_hash_undefined; | |
451 | ||
452 | /* If this symbol is not being provided by the linker script, and it is | |
453 | currently defined by a dynamic object, but not by a regular object, | |
454 | then clear out any version information because the symbol will not be | |
455 | associated with the dynamic object any more. */ | |
456 | if (!provide | |
457 | && (h->elf_link_hash_flags & ELF_LINK_HASH_DEF_DYNAMIC) != 0 | |
458 | && (h->elf_link_hash_flags & ELF_LINK_HASH_DEF_REGULAR) == 0) | |
459 | h->verinfo.verdef = NULL; | |
460 | ||
461 | h->elf_link_hash_flags |= ELF_LINK_HASH_DEF_REGULAR; | |
462 | ||
463 | if (((h->elf_link_hash_flags & (ELF_LINK_HASH_DEF_DYNAMIC | |
464 | | ELF_LINK_HASH_REF_DYNAMIC)) != 0 | |
465 | || info->shared) | |
466 | && h->dynindx == -1) | |
467 | { | |
468 | if (! _bfd_elf_link_record_dynamic_symbol (info, h)) | |
469 | return FALSE; | |
470 | ||
471 | /* If this is a weak defined symbol, and we know a corresponding | |
472 | real symbol from the same dynamic object, make sure the real | |
473 | symbol is also made into a dynamic symbol. */ | |
474 | if (h->weakdef != NULL | |
475 | && h->weakdef->dynindx == -1) | |
476 | { | |
477 | if (! _bfd_elf_link_record_dynamic_symbol (info, h->weakdef)) | |
478 | return FALSE; | |
479 | } | |
480 | } | |
481 | ||
482 | return TRUE; | |
483 | } | |
42751cf3 | 484 | |
8c58d23b AM |
485 | /* Record a new local dynamic symbol. Returns 0 on failure, 1 on |
486 | success, and 2 on a failure caused by attempting to record a symbol | |
487 | in a discarded section, eg. a discarded link-once section symbol. */ | |
488 | ||
489 | int | |
268b6b39 AM |
490 | elf_link_record_local_dynamic_symbol (struct bfd_link_info *info, |
491 | bfd *input_bfd, | |
492 | long input_indx) | |
8c58d23b AM |
493 | { |
494 | bfd_size_type amt; | |
495 | struct elf_link_local_dynamic_entry *entry; | |
496 | struct elf_link_hash_table *eht; | |
497 | struct elf_strtab_hash *dynstr; | |
498 | unsigned long dynstr_index; | |
499 | char *name; | |
500 | Elf_External_Sym_Shndx eshndx; | |
501 | char esym[sizeof (Elf64_External_Sym)]; | |
502 | ||
0eddce27 | 503 | if (! is_elf_hash_table (info->hash)) |
8c58d23b AM |
504 | return 0; |
505 | ||
506 | /* See if the entry exists already. */ | |
507 | for (entry = elf_hash_table (info)->dynlocal; entry ; entry = entry->next) | |
508 | if (entry->input_bfd == input_bfd && entry->input_indx == input_indx) | |
509 | return 1; | |
510 | ||
511 | amt = sizeof (*entry); | |
268b6b39 | 512 | entry = bfd_alloc (input_bfd, amt); |
8c58d23b AM |
513 | if (entry == NULL) |
514 | return 0; | |
515 | ||
516 | /* Go find the symbol, so that we can find it's name. */ | |
517 | if (!bfd_elf_get_elf_syms (input_bfd, &elf_tdata (input_bfd)->symtab_hdr, | |
268b6b39 | 518 | 1, input_indx, &entry->isym, esym, &eshndx)) |
8c58d23b AM |
519 | { |
520 | bfd_release (input_bfd, entry); | |
521 | return 0; | |
522 | } | |
523 | ||
524 | if (entry->isym.st_shndx != SHN_UNDEF | |
525 | && (entry->isym.st_shndx < SHN_LORESERVE | |
526 | || entry->isym.st_shndx > SHN_HIRESERVE)) | |
527 | { | |
528 | asection *s; | |
529 | ||
530 | s = bfd_section_from_elf_index (input_bfd, entry->isym.st_shndx); | |
531 | if (s == NULL || bfd_is_abs_section (s->output_section)) | |
532 | { | |
533 | /* We can still bfd_release here as nothing has done another | |
534 | bfd_alloc. We can't do this later in this function. */ | |
535 | bfd_release (input_bfd, entry); | |
536 | return 2; | |
537 | } | |
538 | } | |
539 | ||
540 | name = (bfd_elf_string_from_elf_section | |
541 | (input_bfd, elf_tdata (input_bfd)->symtab_hdr.sh_link, | |
542 | entry->isym.st_name)); | |
543 | ||
544 | dynstr = elf_hash_table (info)->dynstr; | |
545 | if (dynstr == NULL) | |
546 | { | |
547 | /* Create a strtab to hold the dynamic symbol names. */ | |
548 | elf_hash_table (info)->dynstr = dynstr = _bfd_elf_strtab_init (); | |
549 | if (dynstr == NULL) | |
550 | return 0; | |
551 | } | |
552 | ||
b34976b6 | 553 | dynstr_index = _bfd_elf_strtab_add (dynstr, name, FALSE); |
8c58d23b AM |
554 | if (dynstr_index == (unsigned long) -1) |
555 | return 0; | |
556 | entry->isym.st_name = dynstr_index; | |
557 | ||
558 | eht = elf_hash_table (info); | |
559 | ||
560 | entry->next = eht->dynlocal; | |
561 | eht->dynlocal = entry; | |
562 | entry->input_bfd = input_bfd; | |
563 | entry->input_indx = input_indx; | |
564 | eht->dynsymcount++; | |
565 | ||
566 | /* Whatever binding the symbol had before, it's now local. */ | |
567 | entry->isym.st_info | |
568 | = ELF_ST_INFO (STB_LOCAL, ELF_ST_TYPE (entry->isym.st_info)); | |
569 | ||
570 | /* The dynindx will be set at the end of size_dynamic_sections. */ | |
571 | ||
572 | return 1; | |
573 | } | |
574 | ||
30b30c21 | 575 | /* Return the dynindex of a local dynamic symbol. */ |
42751cf3 | 576 | |
30b30c21 | 577 | long |
268b6b39 AM |
578 | _bfd_elf_link_lookup_local_dynindx (struct bfd_link_info *info, |
579 | bfd *input_bfd, | |
580 | long input_indx) | |
30b30c21 RH |
581 | { |
582 | struct elf_link_local_dynamic_entry *e; | |
583 | ||
584 | for (e = elf_hash_table (info)->dynlocal; e ; e = e->next) | |
585 | if (e->input_bfd == input_bfd && e->input_indx == input_indx) | |
586 | return e->dynindx; | |
587 | return -1; | |
588 | } | |
589 | ||
590 | /* This function is used to renumber the dynamic symbols, if some of | |
591 | them are removed because they are marked as local. This is called | |
592 | via elf_link_hash_traverse. */ | |
593 | ||
b34976b6 | 594 | static bfd_boolean |
268b6b39 AM |
595 | elf_link_renumber_hash_table_dynsyms (struct elf_link_hash_entry *h, |
596 | void *data) | |
42751cf3 | 597 | { |
268b6b39 | 598 | size_t *count = data; |
30b30c21 | 599 | |
e92d460e AM |
600 | if (h->root.type == bfd_link_hash_warning) |
601 | h = (struct elf_link_hash_entry *) h->root.u.i.link; | |
602 | ||
42751cf3 | 603 | if (h->dynindx != -1) |
30b30c21 RH |
604 | h->dynindx = ++(*count); |
605 | ||
b34976b6 | 606 | return TRUE; |
42751cf3 | 607 | } |
30b30c21 | 608 | |
062e2358 | 609 | /* Assign dynsym indices. In a shared library we generate a section |
30b30c21 RH |
610 | symbol for each output section, which come first. Next come all of |
611 | the back-end allocated local dynamic syms, followed by the rest of | |
612 | the global symbols. */ | |
613 | ||
614 | unsigned long | |
268b6b39 | 615 | _bfd_elf_link_renumber_dynsyms (bfd *output_bfd, struct bfd_link_info *info) |
30b30c21 RH |
616 | { |
617 | unsigned long dynsymcount = 0; | |
618 | ||
619 | if (info->shared) | |
620 | { | |
621 | asection *p; | |
622 | for (p = output_bfd->sections; p ; p = p->next) | |
bc0ba537 AM |
623 | if ((p->flags & SEC_EXCLUDE) == 0) |
624 | elf_section_data (p)->dynindx = ++dynsymcount; | |
30b30c21 RH |
625 | } |
626 | ||
627 | if (elf_hash_table (info)->dynlocal) | |
628 | { | |
629 | struct elf_link_local_dynamic_entry *p; | |
630 | for (p = elf_hash_table (info)->dynlocal; p ; p = p->next) | |
631 | p->dynindx = ++dynsymcount; | |
632 | } | |
633 | ||
634 | elf_link_hash_traverse (elf_hash_table (info), | |
635 | elf_link_renumber_hash_table_dynsyms, | |
636 | &dynsymcount); | |
637 | ||
638 | /* There is an unused NULL entry at the head of the table which | |
639 | we must account for in our count. Unless there weren't any | |
640 | symbols, which means we'll have no table at all. */ | |
641 | if (dynsymcount != 0) | |
642 | ++dynsymcount; | |
643 | ||
644 | return elf_hash_table (info)->dynsymcount = dynsymcount; | |
645 | } | |
252b5132 | 646 | |
45d6a902 AM |
647 | /* This function is called when we want to define a new symbol. It |
648 | handles the various cases which arise when we find a definition in | |
649 | a dynamic object, or when there is already a definition in a | |
650 | dynamic object. The new symbol is described by NAME, SYM, PSEC, | |
651 | and PVALUE. We set SYM_HASH to the hash table entry. We set | |
652 | OVERRIDE if the old symbol is overriding a new definition. We set | |
653 | TYPE_CHANGE_OK if it is OK for the type to change. We set | |
654 | SIZE_CHANGE_OK if it is OK for the size to change. By OK to | |
655 | change, we mean that we shouldn't warn if the type or size does | |
656 | change. DT_NEEDED indicates if it comes from a DT_NEEDED entry of | |
657 | a shared object. */ | |
658 | ||
659 | bfd_boolean | |
268b6b39 AM |
660 | _bfd_elf_merge_symbol (bfd *abfd, |
661 | struct bfd_link_info *info, | |
662 | const char *name, | |
663 | Elf_Internal_Sym *sym, | |
664 | asection **psec, | |
665 | bfd_vma *pvalue, | |
666 | struct elf_link_hash_entry **sym_hash, | |
667 | bfd_boolean *skip, | |
668 | bfd_boolean *override, | |
669 | bfd_boolean *type_change_ok, | |
670 | bfd_boolean *size_change_ok, | |
671 | bfd_boolean dt_needed) | |
252b5132 | 672 | { |
45d6a902 AM |
673 | asection *sec; |
674 | struct elf_link_hash_entry *h; | |
675 | struct elf_link_hash_entry *flip; | |
676 | int bind; | |
677 | bfd *oldbfd; | |
678 | bfd_boolean newdyn, olddyn, olddef, newdef, newdyncommon, olddyncommon; | |
679 | bfd_boolean newweakdef, oldweakdef, newweakundef, oldweakundef; | |
680 | ||
681 | *skip = FALSE; | |
682 | *override = FALSE; | |
683 | ||
684 | sec = *psec; | |
685 | bind = ELF_ST_BIND (sym->st_info); | |
686 | ||
687 | if (! bfd_is_und_section (sec)) | |
688 | h = elf_link_hash_lookup (elf_hash_table (info), name, TRUE, FALSE, FALSE); | |
689 | else | |
690 | h = ((struct elf_link_hash_entry *) | |
691 | bfd_wrapped_link_hash_lookup (abfd, info, name, TRUE, FALSE, FALSE)); | |
692 | if (h == NULL) | |
693 | return FALSE; | |
694 | *sym_hash = h; | |
252b5132 | 695 | |
45d6a902 AM |
696 | /* This code is for coping with dynamic objects, and is only useful |
697 | if we are doing an ELF link. */ | |
698 | if (info->hash->creator != abfd->xvec) | |
699 | return TRUE; | |
252b5132 | 700 | |
45d6a902 AM |
701 | /* For merging, we only care about real symbols. */ |
702 | ||
703 | while (h->root.type == bfd_link_hash_indirect | |
704 | || h->root.type == bfd_link_hash_warning) | |
705 | h = (struct elf_link_hash_entry *) h->root.u.i.link; | |
706 | ||
707 | /* If we just created the symbol, mark it as being an ELF symbol. | |
708 | Other than that, there is nothing to do--there is no merge issue | |
709 | with a newly defined symbol--so we just return. */ | |
710 | ||
711 | if (h->root.type == bfd_link_hash_new) | |
252b5132 | 712 | { |
45d6a902 AM |
713 | h->elf_link_hash_flags &=~ ELF_LINK_NON_ELF; |
714 | return TRUE; | |
715 | } | |
252b5132 | 716 | |
45d6a902 | 717 | /* OLDBFD is a BFD associated with the existing symbol. */ |
252b5132 | 718 | |
45d6a902 AM |
719 | switch (h->root.type) |
720 | { | |
721 | default: | |
722 | oldbfd = NULL; | |
723 | break; | |
252b5132 | 724 | |
45d6a902 AM |
725 | case bfd_link_hash_undefined: |
726 | case bfd_link_hash_undefweak: | |
727 | oldbfd = h->root.u.undef.abfd; | |
728 | break; | |
729 | ||
730 | case bfd_link_hash_defined: | |
731 | case bfd_link_hash_defweak: | |
732 | oldbfd = h->root.u.def.section->owner; | |
733 | break; | |
734 | ||
735 | case bfd_link_hash_common: | |
736 | oldbfd = h->root.u.c.p->section->owner; | |
737 | break; | |
738 | } | |
739 | ||
740 | /* In cases involving weak versioned symbols, we may wind up trying | |
741 | to merge a symbol with itself. Catch that here, to avoid the | |
742 | confusion that results if we try to override a symbol with | |
743 | itself. The additional tests catch cases like | |
744 | _GLOBAL_OFFSET_TABLE_, which are regular symbols defined in a | |
745 | dynamic object, which we do want to handle here. */ | |
746 | if (abfd == oldbfd | |
747 | && ((abfd->flags & DYNAMIC) == 0 | |
748 | || (h->elf_link_hash_flags & ELF_LINK_HASH_DEF_REGULAR) == 0)) | |
749 | return TRUE; | |
750 | ||
751 | /* NEWDYN and OLDDYN indicate whether the new or old symbol, | |
752 | respectively, is from a dynamic object. */ | |
753 | ||
754 | if ((abfd->flags & DYNAMIC) != 0) | |
755 | newdyn = TRUE; | |
756 | else | |
757 | newdyn = FALSE; | |
758 | ||
759 | if (oldbfd != NULL) | |
760 | olddyn = (oldbfd->flags & DYNAMIC) != 0; | |
761 | else | |
762 | { | |
763 | asection *hsec; | |
764 | ||
765 | /* This code handles the special SHN_MIPS_{TEXT,DATA} section | |
766 | indices used by MIPS ELF. */ | |
767 | switch (h->root.type) | |
252b5132 | 768 | { |
45d6a902 AM |
769 | default: |
770 | hsec = NULL; | |
771 | break; | |
252b5132 | 772 | |
45d6a902 AM |
773 | case bfd_link_hash_defined: |
774 | case bfd_link_hash_defweak: | |
775 | hsec = h->root.u.def.section; | |
776 | break; | |
252b5132 | 777 | |
45d6a902 AM |
778 | case bfd_link_hash_common: |
779 | hsec = h->root.u.c.p->section; | |
780 | break; | |
252b5132 | 781 | } |
252b5132 | 782 | |
45d6a902 AM |
783 | if (hsec == NULL) |
784 | olddyn = FALSE; | |
785 | else | |
786 | olddyn = (hsec->symbol->flags & BSF_DYNAMIC) != 0; | |
787 | } | |
252b5132 | 788 | |
45d6a902 AM |
789 | /* NEWDEF and OLDDEF indicate whether the new or old symbol, |
790 | respectively, appear to be a definition rather than reference. */ | |
791 | ||
792 | if (bfd_is_und_section (sec) || bfd_is_com_section (sec)) | |
793 | newdef = FALSE; | |
794 | else | |
795 | newdef = TRUE; | |
796 | ||
797 | if (h->root.type == bfd_link_hash_undefined | |
798 | || h->root.type == bfd_link_hash_undefweak | |
799 | || h->root.type == bfd_link_hash_common) | |
800 | olddef = FALSE; | |
801 | else | |
802 | olddef = TRUE; | |
803 | ||
4cc11e76 | 804 | /* We need to remember if a symbol has a definition in a dynamic |
45d6a902 AM |
805 | object or is weak in all dynamic objects. Internal and hidden |
806 | visibility will make it unavailable to dynamic objects. */ | |
807 | if (newdyn && (h->elf_link_hash_flags & ELF_LINK_DYNAMIC_DEF) == 0) | |
808 | { | |
809 | if (!bfd_is_und_section (sec)) | |
810 | h->elf_link_hash_flags |= ELF_LINK_DYNAMIC_DEF; | |
811 | else | |
252b5132 | 812 | { |
45d6a902 AM |
813 | /* Check if this symbol is weak in all dynamic objects. If it |
814 | is the first time we see it in a dynamic object, we mark | |
815 | if it is weak. Otherwise, we clear it. */ | |
816 | if ((h->elf_link_hash_flags & ELF_LINK_HASH_REF_DYNAMIC) == 0) | |
817 | { | |
818 | if (bind == STB_WEAK) | |
819 | h->elf_link_hash_flags |= ELF_LINK_DYNAMIC_WEAK; | |
252b5132 | 820 | } |
45d6a902 AM |
821 | else if (bind != STB_WEAK) |
822 | h->elf_link_hash_flags &= ~ELF_LINK_DYNAMIC_WEAK; | |
252b5132 | 823 | } |
45d6a902 | 824 | } |
252b5132 | 825 | |
45d6a902 AM |
826 | /* If the old symbol has non-default visibility, we ignore the new |
827 | definition from a dynamic object. */ | |
828 | if (newdyn | |
9c7a29a3 | 829 | && ELF_ST_VISIBILITY (h->other) != STV_DEFAULT |
45d6a902 AM |
830 | && !bfd_is_und_section (sec)) |
831 | { | |
832 | *skip = TRUE; | |
833 | /* Make sure this symbol is dynamic. */ | |
834 | h->elf_link_hash_flags |= ELF_LINK_HASH_REF_DYNAMIC; | |
835 | /* A protected symbol has external availability. Make sure it is | |
836 | recorded as dynamic. | |
837 | ||
838 | FIXME: Should we check type and size for protected symbol? */ | |
839 | if (ELF_ST_VISIBILITY (h->other) == STV_PROTECTED) | |
840 | return _bfd_elf_link_record_dynamic_symbol (info, h); | |
841 | else | |
842 | return TRUE; | |
843 | } | |
844 | else if (!newdyn | |
9c7a29a3 | 845 | && ELF_ST_VISIBILITY (sym->st_other) != STV_DEFAULT |
45d6a902 AM |
846 | && (h->elf_link_hash_flags & ELF_LINK_HASH_DEF_DYNAMIC) != 0) |
847 | { | |
848 | /* If the new symbol with non-default visibility comes from a | |
849 | relocatable file and the old definition comes from a dynamic | |
850 | object, we remove the old definition. */ | |
851 | if ((*sym_hash)->root.type == bfd_link_hash_indirect) | |
852 | h = *sym_hash; | |
1de1a317 L |
853 | |
854 | if ((h->root.und_next || info->hash->undefs_tail == &h->root) | |
855 | && bfd_is_und_section (sec)) | |
856 | { | |
857 | /* If the new symbol is undefined and the old symbol was | |
858 | also undefined before, we need to make sure | |
859 | _bfd_generic_link_add_one_symbol doesn't mess | |
860 | up the linker hash table undefs list. Since the old | |
861 | definition came from a dynamic object, it is still on the | |
862 | undefs list. */ | |
863 | h->root.type = bfd_link_hash_undefined; | |
864 | /* FIXME: What if the new symbol is weak undefined? */ | |
865 | h->root.u.undef.abfd = abfd; | |
866 | } | |
867 | else | |
868 | { | |
869 | h->root.type = bfd_link_hash_new; | |
870 | h->root.u.undef.abfd = NULL; | |
871 | } | |
872 | ||
45d6a902 | 873 | if (h->elf_link_hash_flags & ELF_LINK_HASH_DEF_DYNAMIC) |
252b5132 | 874 | { |
45d6a902 | 875 | h->elf_link_hash_flags &= ~ELF_LINK_HASH_DEF_DYNAMIC; |
22d5e339 L |
876 | h->elf_link_hash_flags |= (ELF_LINK_HASH_REF_DYNAMIC |
877 | | ELF_LINK_DYNAMIC_DEF); | |
45d6a902 AM |
878 | } |
879 | /* FIXME: Should we check type and size for protected symbol? */ | |
880 | h->size = 0; | |
881 | h->type = 0; | |
882 | return TRUE; | |
883 | } | |
14a793b2 | 884 | |
4cc11e76 | 885 | /* We need to treat weak definition right, depending on if there is a |
45d6a902 AM |
886 | definition from a dynamic object. */ |
887 | if (bind == STB_WEAK) | |
888 | { | |
889 | if (olddef) | |
890 | { | |
891 | newweakdef = TRUE; | |
892 | newweakundef = FALSE; | |
893 | } | |
894 | else | |
895 | { | |
896 | newweakdef = FALSE; | |
897 | newweakundef = TRUE; | |
898 | } | |
899 | } | |
900 | else | |
901 | newweakdef = newweakundef = FALSE; | |
14a793b2 | 902 | |
45d6a902 AM |
903 | /* If the new weak definition comes from a relocatable file and the |
904 | old symbol comes from a dynamic object, we treat the new one as | |
905 | strong. */ | |
906 | if (newweakdef && !newdyn && olddyn) | |
907 | newweakdef = FALSE; | |
252b5132 | 908 | |
45d6a902 AM |
909 | if (h->root.type == bfd_link_hash_defweak) |
910 | { | |
911 | oldweakdef = TRUE; | |
912 | oldweakundef = FALSE; | |
913 | } | |
914 | else if (h->root.type == bfd_link_hash_undefweak) | |
915 | { | |
916 | oldweakdef = FALSE; | |
917 | oldweakundef = TRUE; | |
918 | } | |
919 | else | |
920 | oldweakdef = oldweakundef = FALSE; | |
921 | ||
922 | /* If the old weak definition comes from a relocatable file and the | |
923 | new symbol comes from a dynamic object, we treat the old one as | |
924 | strong. */ | |
925 | if (oldweakdef && !olddyn && newdyn) | |
926 | oldweakdef = FALSE; | |
927 | ||
928 | /* NEWDYNCOMMON and OLDDYNCOMMON indicate whether the new or old | |
929 | symbol, respectively, appears to be a common symbol in a dynamic | |
930 | object. If a symbol appears in an uninitialized section, and is | |
931 | not weak, and is not a function, then it may be a common symbol | |
932 | which was resolved when the dynamic object was created. We want | |
933 | to treat such symbols specially, because they raise special | |
934 | considerations when setting the symbol size: if the symbol | |
935 | appears as a common symbol in a regular object, and the size in | |
936 | the regular object is larger, we must make sure that we use the | |
937 | larger size. This problematic case can always be avoided in C, | |
938 | but it must be handled correctly when using Fortran shared | |
939 | libraries. | |
940 | ||
941 | Note that if NEWDYNCOMMON is set, NEWDEF will be set, and | |
942 | likewise for OLDDYNCOMMON and OLDDEF. | |
943 | ||
944 | Note that this test is just a heuristic, and that it is quite | |
945 | possible to have an uninitialized symbol in a shared object which | |
946 | is really a definition, rather than a common symbol. This could | |
947 | lead to some minor confusion when the symbol really is a common | |
948 | symbol in some regular object. However, I think it will be | |
949 | harmless. */ | |
950 | ||
951 | if (newdyn | |
952 | && newdef | |
953 | && (sec->flags & SEC_ALLOC) != 0 | |
954 | && (sec->flags & SEC_LOAD) == 0 | |
955 | && sym->st_size > 0 | |
956 | && !newweakdef | |
957 | && !newweakundef | |
958 | && ELF_ST_TYPE (sym->st_info) != STT_FUNC) | |
959 | newdyncommon = TRUE; | |
960 | else | |
961 | newdyncommon = FALSE; | |
962 | ||
963 | if (olddyn | |
964 | && olddef | |
965 | && h->root.type == bfd_link_hash_defined | |
966 | && (h->elf_link_hash_flags & ELF_LINK_HASH_DEF_DYNAMIC) != 0 | |
967 | && (h->root.u.def.section->flags & SEC_ALLOC) != 0 | |
968 | && (h->root.u.def.section->flags & SEC_LOAD) == 0 | |
969 | && h->size > 0 | |
970 | && h->type != STT_FUNC) | |
971 | olddyncommon = TRUE; | |
972 | else | |
973 | olddyncommon = FALSE; | |
974 | ||
975 | /* It's OK to change the type if either the existing symbol or the | |
976 | new symbol is weak unless it comes from a DT_NEEDED entry of | |
977 | a shared object, in which case, the DT_NEEDED entry may not be | |
9e4d8df3 L |
978 | required at the run time. The type change is also OK if the |
979 | old symbol is undefined and the new symbol is defined. */ | |
45d6a902 AM |
980 | |
981 | if ((! dt_needed && oldweakdef) | |
982 | || oldweakundef | |
983 | || newweakdef | |
9e4d8df3 L |
984 | || newweakundef |
985 | || (newdef | |
986 | && (h->root.type == bfd_link_hash_undefined | |
987 | || h->root.type == bfd_link_hash_undefweak))) | |
45d6a902 AM |
988 | *type_change_ok = TRUE; |
989 | ||
990 | /* It's OK to change the size if either the existing symbol or the | |
991 | new symbol is weak, or if the old symbol is undefined. */ | |
992 | ||
993 | if (*type_change_ok | |
994 | || h->root.type == bfd_link_hash_undefined) | |
995 | *size_change_ok = TRUE; | |
996 | ||
997 | /* If both the old and the new symbols look like common symbols in a | |
998 | dynamic object, set the size of the symbol to the larger of the | |
999 | two. */ | |
1000 | ||
1001 | if (olddyncommon | |
1002 | && newdyncommon | |
1003 | && sym->st_size != h->size) | |
1004 | { | |
1005 | /* Since we think we have two common symbols, issue a multiple | |
1006 | common warning if desired. Note that we only warn if the | |
1007 | size is different. If the size is the same, we simply let | |
1008 | the old symbol override the new one as normally happens with | |
1009 | symbols defined in dynamic objects. */ | |
1010 | ||
1011 | if (! ((*info->callbacks->multiple_common) | |
1012 | (info, h->root.root.string, oldbfd, bfd_link_hash_common, | |
1013 | h->size, abfd, bfd_link_hash_common, sym->st_size))) | |
1014 | return FALSE; | |
252b5132 | 1015 | |
45d6a902 AM |
1016 | if (sym->st_size > h->size) |
1017 | h->size = sym->st_size; | |
252b5132 | 1018 | |
45d6a902 | 1019 | *size_change_ok = TRUE; |
252b5132 RH |
1020 | } |
1021 | ||
45d6a902 AM |
1022 | /* If we are looking at a dynamic object, and we have found a |
1023 | definition, we need to see if the symbol was already defined by | |
1024 | some other object. If so, we want to use the existing | |
1025 | definition, and we do not want to report a multiple symbol | |
1026 | definition error; we do this by clobbering *PSEC to be | |
1027 | bfd_und_section_ptr. | |
1028 | ||
1029 | We treat a common symbol as a definition if the symbol in the | |
1030 | shared library is a function, since common symbols always | |
1031 | represent variables; this can cause confusion in principle, but | |
1032 | any such confusion would seem to indicate an erroneous program or | |
1033 | shared library. We also permit a common symbol in a regular | |
1034 | object to override a weak symbol in a shared object. | |
1035 | ||
1036 | We prefer a non-weak definition in a shared library to a weak | |
1037 | definition in the executable unless it comes from a DT_NEEDED | |
1038 | entry of a shared object, in which case, the DT_NEEDED entry | |
1039 | may not be required at the run time. */ | |
1040 | ||
1041 | if (newdyn | |
1042 | && newdef | |
1043 | && (olddef | |
1044 | || (h->root.type == bfd_link_hash_common | |
1045 | && (newweakdef | |
1046 | || newweakundef | |
1047 | || ELF_ST_TYPE (sym->st_info) == STT_FUNC))) | |
1048 | && (!oldweakdef | |
1049 | || dt_needed | |
1050 | || newweakdef | |
1051 | || newweakundef)) | |
1052 | { | |
1053 | *override = TRUE; | |
1054 | newdef = FALSE; | |
1055 | newdyncommon = FALSE; | |
252b5132 | 1056 | |
45d6a902 AM |
1057 | *psec = sec = bfd_und_section_ptr; |
1058 | *size_change_ok = TRUE; | |
252b5132 | 1059 | |
45d6a902 AM |
1060 | /* If we get here when the old symbol is a common symbol, then |
1061 | we are explicitly letting it override a weak symbol or | |
1062 | function in a dynamic object, and we don't want to warn about | |
1063 | a type change. If the old symbol is a defined symbol, a type | |
1064 | change warning may still be appropriate. */ | |
252b5132 | 1065 | |
45d6a902 AM |
1066 | if (h->root.type == bfd_link_hash_common) |
1067 | *type_change_ok = TRUE; | |
1068 | } | |
1069 | ||
1070 | /* Handle the special case of an old common symbol merging with a | |
1071 | new symbol which looks like a common symbol in a shared object. | |
1072 | We change *PSEC and *PVALUE to make the new symbol look like a | |
1073 | common symbol, and let _bfd_generic_link_add_one_symbol will do | |
1074 | the right thing. */ | |
1075 | ||
1076 | if (newdyncommon | |
1077 | && h->root.type == bfd_link_hash_common) | |
1078 | { | |
1079 | *override = TRUE; | |
1080 | newdef = FALSE; | |
1081 | newdyncommon = FALSE; | |
1082 | *pvalue = sym->st_size; | |
1083 | *psec = sec = bfd_com_section_ptr; | |
1084 | *size_change_ok = TRUE; | |
1085 | } | |
1086 | ||
1087 | /* If the old symbol is from a dynamic object, and the new symbol is | |
1088 | a definition which is not from a dynamic object, then the new | |
1089 | symbol overrides the old symbol. Symbols from regular files | |
1090 | always take precedence over symbols from dynamic objects, even if | |
1091 | they are defined after the dynamic object in the link. | |
1092 | ||
1093 | As above, we again permit a common symbol in a regular object to | |
1094 | override a definition in a shared object if the shared object | |
1095 | symbol is a function or is weak. | |
1096 | ||
1097 | As above, we permit a non-weak definition in a shared object to | |
1098 | override a weak definition in a regular object. */ | |
1099 | ||
1100 | flip = NULL; | |
1101 | if (! newdyn | |
1102 | && (newdef | |
1103 | || (bfd_is_com_section (sec) | |
1104 | && (oldweakdef || h->type == STT_FUNC))) | |
1105 | && olddyn | |
1106 | && olddef | |
1107 | && (h->elf_link_hash_flags & ELF_LINK_HASH_DEF_DYNAMIC) != 0 | |
1108 | && ((!newweakdef && !newweakundef) || oldweakdef)) | |
1109 | { | |
1110 | /* Change the hash table entry to undefined, and let | |
1111 | _bfd_generic_link_add_one_symbol do the right thing with the | |
1112 | new definition. */ | |
1113 | ||
1114 | h->root.type = bfd_link_hash_undefined; | |
1115 | h->root.u.undef.abfd = h->root.u.def.section->owner; | |
1116 | *size_change_ok = TRUE; | |
1117 | ||
1118 | olddef = FALSE; | |
1119 | olddyncommon = FALSE; | |
1120 | ||
1121 | /* We again permit a type change when a common symbol may be | |
1122 | overriding a function. */ | |
1123 | ||
1124 | if (bfd_is_com_section (sec)) | |
1125 | *type_change_ok = TRUE; | |
1126 | ||
1127 | if ((*sym_hash)->root.type == bfd_link_hash_indirect) | |
1128 | flip = *sym_hash; | |
1129 | else | |
1130 | /* This union may have been set to be non-NULL when this symbol | |
1131 | was seen in a dynamic object. We must force the union to be | |
1132 | NULL, so that it is correct for a regular symbol. */ | |
1133 | h->verinfo.vertree = NULL; | |
1134 | } | |
1135 | ||
1136 | /* Handle the special case of a new common symbol merging with an | |
1137 | old symbol that looks like it might be a common symbol defined in | |
1138 | a shared object. Note that we have already handled the case in | |
1139 | which a new common symbol should simply override the definition | |
1140 | in the shared library. */ | |
1141 | ||
1142 | if (! newdyn | |
1143 | && bfd_is_com_section (sec) | |
1144 | && olddyncommon) | |
1145 | { | |
1146 | /* It would be best if we could set the hash table entry to a | |
1147 | common symbol, but we don't know what to use for the section | |
1148 | or the alignment. */ | |
1149 | if (! ((*info->callbacks->multiple_common) | |
1150 | (info, h->root.root.string, oldbfd, bfd_link_hash_common, | |
1151 | h->size, abfd, bfd_link_hash_common, sym->st_size))) | |
1152 | return FALSE; | |
1153 | ||
4cc11e76 | 1154 | /* If the presumed common symbol in the dynamic object is |
45d6a902 AM |
1155 | larger, pretend that the new symbol has its size. */ |
1156 | ||
1157 | if (h->size > *pvalue) | |
1158 | *pvalue = h->size; | |
1159 | ||
1160 | /* FIXME: We no longer know the alignment required by the symbol | |
1161 | in the dynamic object, so we just wind up using the one from | |
1162 | the regular object. */ | |
1163 | ||
1164 | olddef = FALSE; | |
1165 | olddyncommon = FALSE; | |
1166 | ||
1167 | h->root.type = bfd_link_hash_undefined; | |
1168 | h->root.u.undef.abfd = h->root.u.def.section->owner; | |
1169 | ||
1170 | *size_change_ok = TRUE; | |
1171 | *type_change_ok = TRUE; | |
1172 | ||
1173 | if ((*sym_hash)->root.type == bfd_link_hash_indirect) | |
1174 | flip = *sym_hash; | |
1175 | else | |
1176 | h->verinfo.vertree = NULL; | |
1177 | } | |
1178 | ||
1179 | if (flip != NULL) | |
1180 | { | |
1181 | /* Handle the case where we had a versioned symbol in a dynamic | |
1182 | library and now find a definition in a normal object. In this | |
1183 | case, we make the versioned symbol point to the normal one. */ | |
9c5bfbb7 | 1184 | const struct elf_backend_data *bed = get_elf_backend_data (abfd); |
45d6a902 AM |
1185 | flip->root.type = h->root.type; |
1186 | h->root.type = bfd_link_hash_indirect; | |
1187 | h->root.u.i.link = (struct bfd_link_hash_entry *) flip; | |
1188 | (*bed->elf_backend_copy_indirect_symbol) (bed, flip, h); | |
1189 | flip->root.u.undef.abfd = h->root.u.undef.abfd; | |
1190 | if (h->elf_link_hash_flags & ELF_LINK_HASH_DEF_DYNAMIC) | |
1191 | { | |
1192 | h->elf_link_hash_flags &= ~ELF_LINK_HASH_DEF_DYNAMIC; | |
1193 | flip->elf_link_hash_flags |= ELF_LINK_HASH_REF_DYNAMIC; | |
1194 | } | |
1195 | } | |
1196 | ||
1197 | /* Handle the special case of a weak definition in a regular object | |
1198 | followed by a non-weak definition in a shared object. In this | |
1199 | case, we prefer the definition in the shared object unless it | |
1200 | comes from a DT_NEEDED entry of a shared object, in which case, | |
1201 | the DT_NEEDED entry may not be required at the run time. */ | |
1202 | if (olddef | |
1203 | && ! dt_needed | |
1204 | && oldweakdef | |
1205 | && newdef | |
1206 | && newdyn | |
1207 | && !newweakdef | |
1208 | && !newweakundef) | |
1209 | { | |
1210 | /* To make this work we have to frob the flags so that the rest | |
1211 | of the code does not think we are using the regular | |
1212 | definition. */ | |
1213 | if ((h->elf_link_hash_flags & ELF_LINK_HASH_DEF_REGULAR) != 0) | |
1214 | h->elf_link_hash_flags |= ELF_LINK_HASH_REF_REGULAR; | |
1215 | else if ((h->elf_link_hash_flags & ELF_LINK_HASH_DEF_DYNAMIC) != 0) | |
1216 | h->elf_link_hash_flags |= ELF_LINK_HASH_REF_DYNAMIC; | |
1217 | h->elf_link_hash_flags &= ~ (ELF_LINK_HASH_DEF_REGULAR | |
1218 | | ELF_LINK_HASH_DEF_DYNAMIC); | |
1219 | ||
1220 | /* If H is the target of an indirection, we want the caller to | |
1221 | use H rather than the indirect symbol. Otherwise if we are | |
1222 | defining a new indirect symbol we will wind up attaching it | |
1223 | to the entry we are overriding. */ | |
1224 | *sym_hash = h; | |
1225 | } | |
1226 | ||
1227 | /* Handle the special case of a non-weak definition in a shared | |
1228 | object followed by a weak definition in a regular object. In | |
1229 | this case we prefer the definition in the shared object. To make | |
1230 | this work we have to tell the caller to not treat the new symbol | |
1231 | as a definition. */ | |
1232 | if (olddef | |
1233 | && olddyn | |
1234 | && !oldweakdef | |
1235 | && newdef | |
1236 | && ! newdyn | |
1237 | && (newweakdef || newweakundef)) | |
1238 | *override = TRUE; | |
1239 | ||
1240 | return TRUE; | |
1241 | } | |
1242 | ||
1243 | /* This function is called to create an indirect symbol from the | |
1244 | default for the symbol with the default version if needed. The | |
1245 | symbol is described by H, NAME, SYM, PSEC, VALUE, and OVERRIDE. We | |
1246 | set DYNSYM if the new indirect symbol is dynamic. DT_NEEDED | |
1247 | indicates if it comes from a DT_NEEDED entry of a shared object. */ | |
1248 | ||
1249 | bfd_boolean | |
268b6b39 AM |
1250 | _bfd_elf_add_default_symbol (bfd *abfd, |
1251 | struct bfd_link_info *info, | |
1252 | struct elf_link_hash_entry *h, | |
1253 | const char *name, | |
1254 | Elf_Internal_Sym *sym, | |
1255 | asection **psec, | |
1256 | bfd_vma *value, | |
1257 | bfd_boolean *dynsym, | |
1258 | bfd_boolean override, | |
1259 | bfd_boolean dt_needed) | |
45d6a902 AM |
1260 | { |
1261 | bfd_boolean type_change_ok; | |
1262 | bfd_boolean size_change_ok; | |
1263 | bfd_boolean skip; | |
1264 | char *shortname; | |
1265 | struct elf_link_hash_entry *hi; | |
1266 | struct bfd_link_hash_entry *bh; | |
9c5bfbb7 | 1267 | const struct elf_backend_data *bed; |
45d6a902 AM |
1268 | bfd_boolean collect; |
1269 | bfd_boolean dynamic; | |
1270 | char *p; | |
1271 | size_t len, shortlen; | |
1272 | asection *sec; | |
1273 | ||
1274 | /* If this symbol has a version, and it is the default version, we | |
1275 | create an indirect symbol from the default name to the fully | |
1276 | decorated name. This will cause external references which do not | |
1277 | specify a version to be bound to this version of the symbol. */ | |
1278 | p = strchr (name, ELF_VER_CHR); | |
1279 | if (p == NULL || p[1] != ELF_VER_CHR) | |
1280 | return TRUE; | |
1281 | ||
1282 | if (override) | |
1283 | { | |
4cc11e76 | 1284 | /* We are overridden by an old definition. We need to check if we |
45d6a902 AM |
1285 | need to create the indirect symbol from the default name. */ |
1286 | hi = elf_link_hash_lookup (elf_hash_table (info), name, TRUE, | |
1287 | FALSE, FALSE); | |
1288 | BFD_ASSERT (hi != NULL); | |
1289 | if (hi == h) | |
1290 | return TRUE; | |
1291 | while (hi->root.type == bfd_link_hash_indirect | |
1292 | || hi->root.type == bfd_link_hash_warning) | |
1293 | { | |
1294 | hi = (struct elf_link_hash_entry *) hi->root.u.i.link; | |
1295 | if (hi == h) | |
1296 | return TRUE; | |
1297 | } | |
1298 | } | |
1299 | ||
1300 | bed = get_elf_backend_data (abfd); | |
1301 | collect = bed->collect; | |
1302 | dynamic = (abfd->flags & DYNAMIC) != 0; | |
1303 | ||
1304 | shortlen = p - name; | |
1305 | shortname = bfd_hash_allocate (&info->hash->table, shortlen + 1); | |
1306 | if (shortname == NULL) | |
1307 | return FALSE; | |
1308 | memcpy (shortname, name, shortlen); | |
1309 | shortname[shortlen] = '\0'; | |
1310 | ||
1311 | /* We are going to create a new symbol. Merge it with any existing | |
1312 | symbol with this name. For the purposes of the merge, act as | |
1313 | though we were defining the symbol we just defined, although we | |
1314 | actually going to define an indirect symbol. */ | |
1315 | type_change_ok = FALSE; | |
1316 | size_change_ok = FALSE; | |
1317 | sec = *psec; | |
1318 | if (!_bfd_elf_merge_symbol (abfd, info, shortname, sym, &sec, value, | |
1319 | &hi, &skip, &override, &type_change_ok, | |
1320 | &size_change_ok, dt_needed)) | |
1321 | return FALSE; | |
1322 | ||
1323 | if (skip) | |
1324 | goto nondefault; | |
1325 | ||
1326 | if (! override) | |
1327 | { | |
1328 | bh = &hi->root; | |
1329 | if (! (_bfd_generic_link_add_one_symbol | |
1330 | (info, abfd, shortname, BSF_INDIRECT, bfd_ind_section_ptr, | |
268b6b39 | 1331 | 0, name, FALSE, collect, &bh))) |
45d6a902 AM |
1332 | return FALSE; |
1333 | hi = (struct elf_link_hash_entry *) bh; | |
1334 | } | |
1335 | else | |
1336 | { | |
1337 | /* In this case the symbol named SHORTNAME is overriding the | |
1338 | indirect symbol we want to add. We were planning on making | |
1339 | SHORTNAME an indirect symbol referring to NAME. SHORTNAME | |
1340 | is the name without a version. NAME is the fully versioned | |
1341 | name, and it is the default version. | |
1342 | ||
1343 | Overriding means that we already saw a definition for the | |
1344 | symbol SHORTNAME in a regular object, and it is overriding | |
1345 | the symbol defined in the dynamic object. | |
1346 | ||
1347 | When this happens, we actually want to change NAME, the | |
1348 | symbol we just added, to refer to SHORTNAME. This will cause | |
1349 | references to NAME in the shared object to become references | |
1350 | to SHORTNAME in the regular object. This is what we expect | |
1351 | when we override a function in a shared object: that the | |
1352 | references in the shared object will be mapped to the | |
1353 | definition in the regular object. */ | |
1354 | ||
1355 | while (hi->root.type == bfd_link_hash_indirect | |
1356 | || hi->root.type == bfd_link_hash_warning) | |
1357 | hi = (struct elf_link_hash_entry *) hi->root.u.i.link; | |
1358 | ||
1359 | h->root.type = bfd_link_hash_indirect; | |
1360 | h->root.u.i.link = (struct bfd_link_hash_entry *) hi; | |
1361 | if (h->elf_link_hash_flags & ELF_LINK_HASH_DEF_DYNAMIC) | |
1362 | { | |
1363 | h->elf_link_hash_flags &=~ ELF_LINK_HASH_DEF_DYNAMIC; | |
1364 | hi->elf_link_hash_flags |= ELF_LINK_HASH_REF_DYNAMIC; | |
1365 | if (hi->elf_link_hash_flags | |
1366 | & (ELF_LINK_HASH_REF_REGULAR | |
1367 | | ELF_LINK_HASH_DEF_REGULAR)) | |
1368 | { | |
1369 | if (! _bfd_elf_link_record_dynamic_symbol (info, hi)) | |
1370 | return FALSE; | |
1371 | } | |
1372 | } | |
1373 | ||
1374 | /* Now set HI to H, so that the following code will set the | |
1375 | other fields correctly. */ | |
1376 | hi = h; | |
1377 | } | |
1378 | ||
1379 | /* If there is a duplicate definition somewhere, then HI may not | |
1380 | point to an indirect symbol. We will have reported an error to | |
1381 | the user in that case. */ | |
1382 | ||
1383 | if (hi->root.type == bfd_link_hash_indirect) | |
1384 | { | |
1385 | struct elf_link_hash_entry *ht; | |
1386 | ||
1387 | /* If the symbol became indirect, then we assume that we have | |
1388 | not seen a definition before. */ | |
1389 | BFD_ASSERT ((hi->elf_link_hash_flags | |
1390 | & (ELF_LINK_HASH_DEF_DYNAMIC | |
1391 | | ELF_LINK_HASH_DEF_REGULAR)) == 0); | |
1392 | ||
1393 | ht = (struct elf_link_hash_entry *) hi->root.u.i.link; | |
1394 | (*bed->elf_backend_copy_indirect_symbol) (bed, ht, hi); | |
1395 | ||
1396 | /* See if the new flags lead us to realize that the symbol must | |
1397 | be dynamic. */ | |
1398 | if (! *dynsym) | |
1399 | { | |
1400 | if (! dynamic) | |
1401 | { | |
1402 | if (info->shared | |
1403 | || ((hi->elf_link_hash_flags | |
1404 | & ELF_LINK_HASH_REF_DYNAMIC) != 0)) | |
1405 | *dynsym = TRUE; | |
1406 | } | |
1407 | else | |
1408 | { | |
1409 | if ((hi->elf_link_hash_flags | |
1410 | & ELF_LINK_HASH_REF_REGULAR) != 0) | |
1411 | *dynsym = TRUE; | |
1412 | } | |
1413 | } | |
1414 | } | |
1415 | ||
1416 | /* We also need to define an indirection from the nondefault version | |
1417 | of the symbol. */ | |
1418 | ||
1419 | nondefault: | |
1420 | len = strlen (name); | |
1421 | shortname = bfd_hash_allocate (&info->hash->table, len); | |
1422 | if (shortname == NULL) | |
1423 | return FALSE; | |
1424 | memcpy (shortname, name, shortlen); | |
1425 | memcpy (shortname + shortlen, p + 1, len - shortlen); | |
1426 | ||
1427 | /* Once again, merge with any existing symbol. */ | |
1428 | type_change_ok = FALSE; | |
1429 | size_change_ok = FALSE; | |
1430 | sec = *psec; | |
1431 | if (!_bfd_elf_merge_symbol (abfd, info, shortname, sym, &sec, value, | |
1432 | &hi, &skip, &override, &type_change_ok, | |
1433 | &size_change_ok, dt_needed)) | |
1434 | return FALSE; | |
1435 | ||
1436 | if (skip) | |
1437 | return TRUE; | |
1438 | ||
1439 | if (override) | |
1440 | { | |
1441 | /* Here SHORTNAME is a versioned name, so we don't expect to see | |
1442 | the type of override we do in the case above unless it is | |
4cc11e76 | 1443 | overridden by a versioned definition. */ |
45d6a902 AM |
1444 | if (hi->root.type != bfd_link_hash_defined |
1445 | && hi->root.type != bfd_link_hash_defweak) | |
1446 | (*_bfd_error_handler) | |
1447 | (_("%s: warning: unexpected redefinition of indirect versioned symbol `%s'"), | |
1448 | bfd_archive_filename (abfd), shortname); | |
1449 | } | |
1450 | else | |
1451 | { | |
1452 | bh = &hi->root; | |
1453 | if (! (_bfd_generic_link_add_one_symbol | |
1454 | (info, abfd, shortname, BSF_INDIRECT, | |
268b6b39 | 1455 | bfd_ind_section_ptr, 0, name, FALSE, collect, &bh))) |
45d6a902 AM |
1456 | return FALSE; |
1457 | hi = (struct elf_link_hash_entry *) bh; | |
1458 | ||
1459 | /* If there is a duplicate definition somewhere, then HI may not | |
1460 | point to an indirect symbol. We will have reported an error | |
1461 | to the user in that case. */ | |
1462 | ||
1463 | if (hi->root.type == bfd_link_hash_indirect) | |
1464 | { | |
1465 | /* If the symbol became indirect, then we assume that we have | |
1466 | not seen a definition before. */ | |
1467 | BFD_ASSERT ((hi->elf_link_hash_flags | |
1468 | & (ELF_LINK_HASH_DEF_DYNAMIC | |
1469 | | ELF_LINK_HASH_DEF_REGULAR)) == 0); | |
1470 | ||
1471 | (*bed->elf_backend_copy_indirect_symbol) (bed, h, hi); | |
1472 | ||
1473 | /* See if the new flags lead us to realize that the symbol | |
1474 | must be dynamic. */ | |
1475 | if (! *dynsym) | |
1476 | { | |
1477 | if (! dynamic) | |
1478 | { | |
1479 | if (info->shared | |
1480 | || ((hi->elf_link_hash_flags | |
1481 | & ELF_LINK_HASH_REF_DYNAMIC) != 0)) | |
1482 | *dynsym = TRUE; | |
1483 | } | |
1484 | else | |
1485 | { | |
1486 | if ((hi->elf_link_hash_flags | |
1487 | & ELF_LINK_HASH_REF_REGULAR) != 0) | |
1488 | *dynsym = TRUE; | |
1489 | } | |
1490 | } | |
1491 | } | |
1492 | } | |
1493 | ||
1494 | return TRUE; | |
1495 | } | |
1496 | \f | |
1497 | /* This routine is used to export all defined symbols into the dynamic | |
1498 | symbol table. It is called via elf_link_hash_traverse. */ | |
1499 | ||
1500 | bfd_boolean | |
268b6b39 | 1501 | _bfd_elf_export_symbol (struct elf_link_hash_entry *h, void *data) |
45d6a902 | 1502 | { |
268b6b39 | 1503 | struct elf_info_failed *eif = data; |
45d6a902 AM |
1504 | |
1505 | /* Ignore indirect symbols. These are added by the versioning code. */ | |
1506 | if (h->root.type == bfd_link_hash_indirect) | |
1507 | return TRUE; | |
1508 | ||
1509 | if (h->root.type == bfd_link_hash_warning) | |
1510 | h = (struct elf_link_hash_entry *) h->root.u.i.link; | |
1511 | ||
1512 | if (h->dynindx == -1 | |
1513 | && (h->elf_link_hash_flags | |
1514 | & (ELF_LINK_HASH_DEF_REGULAR | ELF_LINK_HASH_REF_REGULAR)) != 0) | |
1515 | { | |
1516 | struct bfd_elf_version_tree *t; | |
1517 | struct bfd_elf_version_expr *d; | |
1518 | ||
1519 | for (t = eif->verdefs; t != NULL; t = t->next) | |
1520 | { | |
108ba305 | 1521 | if (t->globals.list != NULL) |
45d6a902 | 1522 | { |
108ba305 JJ |
1523 | d = (*t->match) (&t->globals, NULL, h->root.root.string); |
1524 | if (d != NULL) | |
1525 | goto doit; | |
45d6a902 AM |
1526 | } |
1527 | ||
108ba305 | 1528 | if (t->locals.list != NULL) |
45d6a902 | 1529 | { |
108ba305 JJ |
1530 | d = (*t->match) (&t->locals, NULL, h->root.root.string); |
1531 | if (d != NULL) | |
1532 | return TRUE; | |
45d6a902 AM |
1533 | } |
1534 | } | |
1535 | ||
1536 | if (!eif->verdefs) | |
1537 | { | |
1538 | doit: | |
1539 | if (! _bfd_elf_link_record_dynamic_symbol (eif->info, h)) | |
1540 | { | |
1541 | eif->failed = TRUE; | |
1542 | return FALSE; | |
1543 | } | |
1544 | } | |
1545 | } | |
1546 | ||
1547 | return TRUE; | |
1548 | } | |
1549 | \f | |
1550 | /* Look through the symbols which are defined in other shared | |
1551 | libraries and referenced here. Update the list of version | |
1552 | dependencies. This will be put into the .gnu.version_r section. | |
1553 | This function is called via elf_link_hash_traverse. */ | |
1554 | ||
1555 | bfd_boolean | |
268b6b39 AM |
1556 | _bfd_elf_link_find_version_dependencies (struct elf_link_hash_entry *h, |
1557 | void *data) | |
45d6a902 | 1558 | { |
268b6b39 | 1559 | struct elf_find_verdep_info *rinfo = data; |
45d6a902 AM |
1560 | Elf_Internal_Verneed *t; |
1561 | Elf_Internal_Vernaux *a; | |
1562 | bfd_size_type amt; | |
1563 | ||
1564 | if (h->root.type == bfd_link_hash_warning) | |
1565 | h = (struct elf_link_hash_entry *) h->root.u.i.link; | |
1566 | ||
1567 | /* We only care about symbols defined in shared objects with version | |
1568 | information. */ | |
1569 | if ((h->elf_link_hash_flags & ELF_LINK_HASH_DEF_DYNAMIC) == 0 | |
1570 | || (h->elf_link_hash_flags & ELF_LINK_HASH_DEF_REGULAR) != 0 | |
1571 | || h->dynindx == -1 | |
1572 | || h->verinfo.verdef == NULL) | |
1573 | return TRUE; | |
1574 | ||
1575 | /* See if we already know about this version. */ | |
1576 | for (t = elf_tdata (rinfo->output_bfd)->verref; t != NULL; t = t->vn_nextref) | |
1577 | { | |
1578 | if (t->vn_bfd != h->verinfo.verdef->vd_bfd) | |
1579 | continue; | |
1580 | ||
1581 | for (a = t->vn_auxptr; a != NULL; a = a->vna_nextptr) | |
1582 | if (a->vna_nodename == h->verinfo.verdef->vd_nodename) | |
1583 | return TRUE; | |
1584 | ||
1585 | break; | |
1586 | } | |
1587 | ||
1588 | /* This is a new version. Add it to tree we are building. */ | |
1589 | ||
1590 | if (t == NULL) | |
1591 | { | |
1592 | amt = sizeof *t; | |
268b6b39 | 1593 | t = bfd_zalloc (rinfo->output_bfd, amt); |
45d6a902 AM |
1594 | if (t == NULL) |
1595 | { | |
1596 | rinfo->failed = TRUE; | |
1597 | return FALSE; | |
1598 | } | |
1599 | ||
1600 | t->vn_bfd = h->verinfo.verdef->vd_bfd; | |
1601 | t->vn_nextref = elf_tdata (rinfo->output_bfd)->verref; | |
1602 | elf_tdata (rinfo->output_bfd)->verref = t; | |
1603 | } | |
1604 | ||
1605 | amt = sizeof *a; | |
268b6b39 | 1606 | a = bfd_zalloc (rinfo->output_bfd, amt); |
45d6a902 AM |
1607 | |
1608 | /* Note that we are copying a string pointer here, and testing it | |
1609 | above. If bfd_elf_string_from_elf_section is ever changed to | |
1610 | discard the string data when low in memory, this will have to be | |
1611 | fixed. */ | |
1612 | a->vna_nodename = h->verinfo.verdef->vd_nodename; | |
1613 | ||
1614 | a->vna_flags = h->verinfo.verdef->vd_flags; | |
1615 | a->vna_nextptr = t->vn_auxptr; | |
1616 | ||
1617 | h->verinfo.verdef->vd_exp_refno = rinfo->vers; | |
1618 | ++rinfo->vers; | |
1619 | ||
1620 | a->vna_other = h->verinfo.verdef->vd_exp_refno + 1; | |
1621 | ||
1622 | t->vn_auxptr = a; | |
1623 | ||
1624 | return TRUE; | |
1625 | } | |
1626 | ||
1627 | /* Figure out appropriate versions for all the symbols. We may not | |
1628 | have the version number script until we have read all of the input | |
1629 | files, so until that point we don't know which symbols should be | |
1630 | local. This function is called via elf_link_hash_traverse. */ | |
1631 | ||
1632 | bfd_boolean | |
268b6b39 | 1633 | _bfd_elf_link_assign_sym_version (struct elf_link_hash_entry *h, void *data) |
45d6a902 AM |
1634 | { |
1635 | struct elf_assign_sym_version_info *sinfo; | |
1636 | struct bfd_link_info *info; | |
9c5bfbb7 | 1637 | const struct elf_backend_data *bed; |
45d6a902 AM |
1638 | struct elf_info_failed eif; |
1639 | char *p; | |
1640 | bfd_size_type amt; | |
1641 | ||
268b6b39 | 1642 | sinfo = data; |
45d6a902 AM |
1643 | info = sinfo->info; |
1644 | ||
1645 | if (h->root.type == bfd_link_hash_warning) | |
1646 | h = (struct elf_link_hash_entry *) h->root.u.i.link; | |
1647 | ||
1648 | /* Fix the symbol flags. */ | |
1649 | eif.failed = FALSE; | |
1650 | eif.info = info; | |
1651 | if (! _bfd_elf_fix_symbol_flags (h, &eif)) | |
1652 | { | |
1653 | if (eif.failed) | |
1654 | sinfo->failed = TRUE; | |
1655 | return FALSE; | |
1656 | } | |
1657 | ||
1658 | /* We only need version numbers for symbols defined in regular | |
1659 | objects. */ | |
1660 | if ((h->elf_link_hash_flags & ELF_LINK_HASH_DEF_REGULAR) == 0) | |
1661 | return TRUE; | |
1662 | ||
1663 | bed = get_elf_backend_data (sinfo->output_bfd); | |
1664 | p = strchr (h->root.root.string, ELF_VER_CHR); | |
1665 | if (p != NULL && h->verinfo.vertree == NULL) | |
1666 | { | |
1667 | struct bfd_elf_version_tree *t; | |
1668 | bfd_boolean hidden; | |
1669 | ||
1670 | hidden = TRUE; | |
1671 | ||
1672 | /* There are two consecutive ELF_VER_CHR characters if this is | |
1673 | not a hidden symbol. */ | |
1674 | ++p; | |
1675 | if (*p == ELF_VER_CHR) | |
1676 | { | |
1677 | hidden = FALSE; | |
1678 | ++p; | |
1679 | } | |
1680 | ||
1681 | /* If there is no version string, we can just return out. */ | |
1682 | if (*p == '\0') | |
1683 | { | |
1684 | if (hidden) | |
1685 | h->elf_link_hash_flags |= ELF_LINK_HIDDEN; | |
1686 | return TRUE; | |
1687 | } | |
1688 | ||
1689 | /* Look for the version. If we find it, it is no longer weak. */ | |
1690 | for (t = sinfo->verdefs; t != NULL; t = t->next) | |
1691 | { | |
1692 | if (strcmp (t->name, p) == 0) | |
1693 | { | |
1694 | size_t len; | |
1695 | char *alc; | |
1696 | struct bfd_elf_version_expr *d; | |
1697 | ||
1698 | len = p - h->root.root.string; | |
268b6b39 | 1699 | alc = bfd_malloc (len); |
45d6a902 AM |
1700 | if (alc == NULL) |
1701 | return FALSE; | |
1702 | memcpy (alc, h->root.root.string, len - 1); | |
1703 | alc[len - 1] = '\0'; | |
1704 | if (alc[len - 2] == ELF_VER_CHR) | |
1705 | alc[len - 2] = '\0'; | |
1706 | ||
1707 | h->verinfo.vertree = t; | |
1708 | t->used = TRUE; | |
1709 | d = NULL; | |
1710 | ||
108ba305 JJ |
1711 | if (t->globals.list != NULL) |
1712 | d = (*t->match) (&t->globals, NULL, alc); | |
45d6a902 AM |
1713 | |
1714 | /* See if there is anything to force this symbol to | |
1715 | local scope. */ | |
108ba305 | 1716 | if (d == NULL && t->locals.list != NULL) |
45d6a902 | 1717 | { |
108ba305 JJ |
1718 | d = (*t->match) (&t->locals, NULL, alc); |
1719 | if (d != NULL | |
1720 | && h->dynindx != -1 | |
1721 | && info->shared | |
1722 | && ! info->export_dynamic) | |
1723 | (*bed->elf_backend_hide_symbol) (info, h, TRUE); | |
45d6a902 AM |
1724 | } |
1725 | ||
1726 | free (alc); | |
1727 | break; | |
1728 | } | |
1729 | } | |
1730 | ||
1731 | /* If we are building an application, we need to create a | |
1732 | version node for this version. */ | |
36af4a4e | 1733 | if (t == NULL && info->executable) |
45d6a902 AM |
1734 | { |
1735 | struct bfd_elf_version_tree **pp; | |
1736 | int version_index; | |
1737 | ||
1738 | /* If we aren't going to export this symbol, we don't need | |
1739 | to worry about it. */ | |
1740 | if (h->dynindx == -1) | |
1741 | return TRUE; | |
1742 | ||
1743 | amt = sizeof *t; | |
108ba305 | 1744 | t = bfd_zalloc (sinfo->output_bfd, amt); |
45d6a902 AM |
1745 | if (t == NULL) |
1746 | { | |
1747 | sinfo->failed = TRUE; | |
1748 | return FALSE; | |
1749 | } | |
1750 | ||
45d6a902 | 1751 | t->name = p; |
45d6a902 AM |
1752 | t->name_indx = (unsigned int) -1; |
1753 | t->used = TRUE; | |
1754 | ||
1755 | version_index = 1; | |
1756 | /* Don't count anonymous version tag. */ | |
1757 | if (sinfo->verdefs != NULL && sinfo->verdefs->vernum == 0) | |
1758 | version_index = 0; | |
1759 | for (pp = &sinfo->verdefs; *pp != NULL; pp = &(*pp)->next) | |
1760 | ++version_index; | |
1761 | t->vernum = version_index; | |
1762 | ||
1763 | *pp = t; | |
1764 | ||
1765 | h->verinfo.vertree = t; | |
1766 | } | |
1767 | else if (t == NULL) | |
1768 | { | |
1769 | /* We could not find the version for a symbol when | |
1770 | generating a shared archive. Return an error. */ | |
1771 | (*_bfd_error_handler) | |
1772 | (_("%s: undefined versioned symbol name %s"), | |
1773 | bfd_get_filename (sinfo->output_bfd), h->root.root.string); | |
1774 | bfd_set_error (bfd_error_bad_value); | |
1775 | sinfo->failed = TRUE; | |
1776 | return FALSE; | |
1777 | } | |
1778 | ||
1779 | if (hidden) | |
1780 | h->elf_link_hash_flags |= ELF_LINK_HIDDEN; | |
1781 | } | |
1782 | ||
1783 | /* If we don't have a version for this symbol, see if we can find | |
1784 | something. */ | |
1785 | if (h->verinfo.vertree == NULL && sinfo->verdefs != NULL) | |
1786 | { | |
1787 | struct bfd_elf_version_tree *t; | |
1788 | struct bfd_elf_version_tree *local_ver; | |
1789 | struct bfd_elf_version_expr *d; | |
1790 | ||
1791 | /* See if can find what version this symbol is in. If the | |
1792 | symbol is supposed to be local, then don't actually register | |
1793 | it. */ | |
1794 | local_ver = NULL; | |
1795 | for (t = sinfo->verdefs; t != NULL; t = t->next) | |
1796 | { | |
108ba305 | 1797 | if (t->globals.list != NULL) |
45d6a902 AM |
1798 | { |
1799 | bfd_boolean matched; | |
1800 | ||
1801 | matched = FALSE; | |
108ba305 JJ |
1802 | d = NULL; |
1803 | while ((d = (*t->match) (&t->globals, d, | |
1804 | h->root.root.string)) != NULL) | |
1805 | if (d->symver) | |
1806 | matched = TRUE; | |
1807 | else | |
1808 | { | |
1809 | /* There is a version without definition. Make | |
1810 | the symbol the default definition for this | |
1811 | version. */ | |
1812 | h->verinfo.vertree = t; | |
1813 | local_ver = NULL; | |
1814 | d->script = 1; | |
1815 | break; | |
1816 | } | |
45d6a902 AM |
1817 | if (d != NULL) |
1818 | break; | |
1819 | else if (matched) | |
1820 | /* There is no undefined version for this symbol. Hide the | |
1821 | default one. */ | |
1822 | (*bed->elf_backend_hide_symbol) (info, h, TRUE); | |
1823 | } | |
1824 | ||
108ba305 | 1825 | if (t->locals.list != NULL) |
45d6a902 | 1826 | { |
108ba305 JJ |
1827 | d = NULL; |
1828 | while ((d = (*t->match) (&t->locals, d, | |
1829 | h->root.root.string)) != NULL) | |
45d6a902 | 1830 | { |
108ba305 | 1831 | local_ver = t; |
45d6a902 | 1832 | /* If the match is "*", keep looking for a more |
108ba305 JJ |
1833 | explicit, perhaps even global, match. |
1834 | XXX: Shouldn't this be !d->wildcard instead? */ | |
1835 | if (d->pattern[0] != '*' || d->pattern[1] != '\0') | |
1836 | break; | |
45d6a902 AM |
1837 | } |
1838 | ||
1839 | if (d != NULL) | |
1840 | break; | |
1841 | } | |
1842 | } | |
1843 | ||
1844 | if (local_ver != NULL) | |
1845 | { | |
1846 | h->verinfo.vertree = local_ver; | |
1847 | if (h->dynindx != -1 | |
1848 | && info->shared | |
1849 | && ! info->export_dynamic) | |
1850 | { | |
1851 | (*bed->elf_backend_hide_symbol) (info, h, TRUE); | |
1852 | } | |
1853 | } | |
1854 | } | |
1855 | ||
1856 | return TRUE; | |
1857 | } | |
1858 | \f | |
45d6a902 AM |
1859 | /* Read and swap the relocs from the section indicated by SHDR. This |
1860 | may be either a REL or a RELA section. The relocations are | |
1861 | translated into RELA relocations and stored in INTERNAL_RELOCS, | |
1862 | which should have already been allocated to contain enough space. | |
1863 | The EXTERNAL_RELOCS are a buffer where the external form of the | |
1864 | relocations should be stored. | |
1865 | ||
1866 | Returns FALSE if something goes wrong. */ | |
1867 | ||
1868 | static bfd_boolean | |
268b6b39 | 1869 | elf_link_read_relocs_from_section (bfd *abfd, |
243ef1e0 | 1870 | asection *sec, |
268b6b39 AM |
1871 | Elf_Internal_Shdr *shdr, |
1872 | void *external_relocs, | |
1873 | Elf_Internal_Rela *internal_relocs) | |
45d6a902 | 1874 | { |
9c5bfbb7 | 1875 | const struct elf_backend_data *bed; |
268b6b39 | 1876 | void (*swap_in) (bfd *, const bfd_byte *, Elf_Internal_Rela *); |
45d6a902 AM |
1877 | const bfd_byte *erela; |
1878 | const bfd_byte *erelaend; | |
1879 | Elf_Internal_Rela *irela; | |
243ef1e0 L |
1880 | Elf_Internal_Shdr *symtab_hdr; |
1881 | size_t nsyms; | |
45d6a902 | 1882 | |
45d6a902 AM |
1883 | /* Position ourselves at the start of the section. */ |
1884 | if (bfd_seek (abfd, shdr->sh_offset, SEEK_SET) != 0) | |
1885 | return FALSE; | |
1886 | ||
1887 | /* Read the relocations. */ | |
1888 | if (bfd_bread (external_relocs, shdr->sh_size, abfd) != shdr->sh_size) | |
1889 | return FALSE; | |
1890 | ||
243ef1e0 L |
1891 | symtab_hdr = &elf_tdata (abfd)->symtab_hdr; |
1892 | nsyms = symtab_hdr->sh_size / symtab_hdr->sh_entsize; | |
1893 | ||
45d6a902 AM |
1894 | bed = get_elf_backend_data (abfd); |
1895 | ||
1896 | /* Convert the external relocations to the internal format. */ | |
1897 | if (shdr->sh_entsize == bed->s->sizeof_rel) | |
1898 | swap_in = bed->s->swap_reloc_in; | |
1899 | else if (shdr->sh_entsize == bed->s->sizeof_rela) | |
1900 | swap_in = bed->s->swap_reloca_in; | |
1901 | else | |
1902 | { | |
1903 | bfd_set_error (bfd_error_wrong_format); | |
1904 | return FALSE; | |
1905 | } | |
1906 | ||
1907 | erela = external_relocs; | |
51992aec | 1908 | erelaend = erela + shdr->sh_size; |
45d6a902 AM |
1909 | irela = internal_relocs; |
1910 | while (erela < erelaend) | |
1911 | { | |
243ef1e0 L |
1912 | bfd_vma r_symndx; |
1913 | ||
45d6a902 | 1914 | (*swap_in) (abfd, erela, irela); |
243ef1e0 L |
1915 | r_symndx = ELF32_R_SYM (irela->r_info); |
1916 | if (bed->s->arch_size == 64) | |
1917 | r_symndx >>= 24; | |
1918 | if ((size_t) r_symndx >= nsyms) | |
1919 | { | |
1920 | (*_bfd_error_handler) | |
1921 | (_("%s: bad reloc symbol index (0x%lx >= 0x%lx) for offset 0x%lx in section `%s'"), | |
1922 | bfd_archive_filename (abfd), (unsigned long) r_symndx, | |
1923 | (unsigned long) nsyms, irela->r_offset, sec->name); | |
1924 | bfd_set_error (bfd_error_bad_value); | |
1925 | return FALSE; | |
1926 | } | |
45d6a902 AM |
1927 | irela += bed->s->int_rels_per_ext_rel; |
1928 | erela += shdr->sh_entsize; | |
1929 | } | |
1930 | ||
1931 | return TRUE; | |
1932 | } | |
1933 | ||
1934 | /* Read and swap the relocs for a section O. They may have been | |
1935 | cached. If the EXTERNAL_RELOCS and INTERNAL_RELOCS arguments are | |
1936 | not NULL, they are used as buffers to read into. They are known to | |
1937 | be large enough. If the INTERNAL_RELOCS relocs argument is NULL, | |
1938 | the return value is allocated using either malloc or bfd_alloc, | |
1939 | according to the KEEP_MEMORY argument. If O has two relocation | |
1940 | sections (both REL and RELA relocations), then the REL_HDR | |
1941 | relocations will appear first in INTERNAL_RELOCS, followed by the | |
1942 | REL_HDR2 relocations. */ | |
1943 | ||
1944 | Elf_Internal_Rela * | |
268b6b39 AM |
1945 | _bfd_elf_link_read_relocs (bfd *abfd, |
1946 | asection *o, | |
1947 | void *external_relocs, | |
1948 | Elf_Internal_Rela *internal_relocs, | |
1949 | bfd_boolean keep_memory) | |
45d6a902 AM |
1950 | { |
1951 | Elf_Internal_Shdr *rel_hdr; | |
268b6b39 | 1952 | void *alloc1 = NULL; |
45d6a902 | 1953 | Elf_Internal_Rela *alloc2 = NULL; |
9c5bfbb7 | 1954 | const struct elf_backend_data *bed = get_elf_backend_data (abfd); |
45d6a902 AM |
1955 | |
1956 | if (elf_section_data (o)->relocs != NULL) | |
1957 | return elf_section_data (o)->relocs; | |
1958 | ||
1959 | if (o->reloc_count == 0) | |
1960 | return NULL; | |
1961 | ||
1962 | rel_hdr = &elf_section_data (o)->rel_hdr; | |
1963 | ||
1964 | if (internal_relocs == NULL) | |
1965 | { | |
1966 | bfd_size_type size; | |
1967 | ||
1968 | size = o->reloc_count; | |
1969 | size *= bed->s->int_rels_per_ext_rel * sizeof (Elf_Internal_Rela); | |
1970 | if (keep_memory) | |
268b6b39 | 1971 | internal_relocs = bfd_alloc (abfd, size); |
45d6a902 | 1972 | else |
268b6b39 | 1973 | internal_relocs = alloc2 = bfd_malloc (size); |
45d6a902 AM |
1974 | if (internal_relocs == NULL) |
1975 | goto error_return; | |
1976 | } | |
1977 | ||
1978 | if (external_relocs == NULL) | |
1979 | { | |
1980 | bfd_size_type size = rel_hdr->sh_size; | |
1981 | ||
1982 | if (elf_section_data (o)->rel_hdr2) | |
1983 | size += elf_section_data (o)->rel_hdr2->sh_size; | |
268b6b39 | 1984 | alloc1 = bfd_malloc (size); |
45d6a902 AM |
1985 | if (alloc1 == NULL) |
1986 | goto error_return; | |
1987 | external_relocs = alloc1; | |
1988 | } | |
1989 | ||
243ef1e0 | 1990 | if (!elf_link_read_relocs_from_section (abfd, o, rel_hdr, |
45d6a902 AM |
1991 | external_relocs, |
1992 | internal_relocs)) | |
1993 | goto error_return; | |
51992aec AM |
1994 | if (elf_section_data (o)->rel_hdr2 |
1995 | && (!elf_link_read_relocs_from_section | |
1996 | (abfd, o, | |
1997 | elf_section_data (o)->rel_hdr2, | |
1998 | ((bfd_byte *) external_relocs) + rel_hdr->sh_size, | |
1999 | internal_relocs + (NUM_SHDR_ENTRIES (rel_hdr) | |
2000 | * bed->s->int_rels_per_ext_rel)))) | |
45d6a902 AM |
2001 | goto error_return; |
2002 | ||
2003 | /* Cache the results for next time, if we can. */ | |
2004 | if (keep_memory) | |
2005 | elf_section_data (o)->relocs = internal_relocs; | |
2006 | ||
2007 | if (alloc1 != NULL) | |
2008 | free (alloc1); | |
2009 | ||
2010 | /* Don't free alloc2, since if it was allocated we are passing it | |
2011 | back (under the name of internal_relocs). */ | |
2012 | ||
2013 | return internal_relocs; | |
2014 | ||
2015 | error_return: | |
2016 | if (alloc1 != NULL) | |
2017 | free (alloc1); | |
2018 | if (alloc2 != NULL) | |
2019 | free (alloc2); | |
2020 | return NULL; | |
2021 | } | |
2022 | ||
2023 | /* Compute the size of, and allocate space for, REL_HDR which is the | |
2024 | section header for a section containing relocations for O. */ | |
2025 | ||
2026 | bfd_boolean | |
268b6b39 AM |
2027 | _bfd_elf_link_size_reloc_section (bfd *abfd, |
2028 | Elf_Internal_Shdr *rel_hdr, | |
2029 | asection *o) | |
45d6a902 AM |
2030 | { |
2031 | bfd_size_type reloc_count; | |
2032 | bfd_size_type num_rel_hashes; | |
2033 | ||
2034 | /* Figure out how many relocations there will be. */ | |
2035 | if (rel_hdr == &elf_section_data (o)->rel_hdr) | |
2036 | reloc_count = elf_section_data (o)->rel_count; | |
2037 | else | |
2038 | reloc_count = elf_section_data (o)->rel_count2; | |
2039 | ||
2040 | num_rel_hashes = o->reloc_count; | |
2041 | if (num_rel_hashes < reloc_count) | |
2042 | num_rel_hashes = reloc_count; | |
2043 | ||
2044 | /* That allows us to calculate the size of the section. */ | |
2045 | rel_hdr->sh_size = rel_hdr->sh_entsize * reloc_count; | |
2046 | ||
2047 | /* The contents field must last into write_object_contents, so we | |
2048 | allocate it with bfd_alloc rather than malloc. Also since we | |
2049 | cannot be sure that the contents will actually be filled in, | |
2050 | we zero the allocated space. */ | |
268b6b39 | 2051 | rel_hdr->contents = bfd_zalloc (abfd, rel_hdr->sh_size); |
45d6a902 AM |
2052 | if (rel_hdr->contents == NULL && rel_hdr->sh_size != 0) |
2053 | return FALSE; | |
2054 | ||
2055 | /* We only allocate one set of hash entries, so we only do it the | |
2056 | first time we are called. */ | |
2057 | if (elf_section_data (o)->rel_hashes == NULL | |
2058 | && num_rel_hashes) | |
2059 | { | |
2060 | struct elf_link_hash_entry **p; | |
2061 | ||
268b6b39 | 2062 | p = bfd_zmalloc (num_rel_hashes * sizeof (struct elf_link_hash_entry *)); |
45d6a902 AM |
2063 | if (p == NULL) |
2064 | return FALSE; | |
2065 | ||
2066 | elf_section_data (o)->rel_hashes = p; | |
2067 | } | |
2068 | ||
2069 | return TRUE; | |
2070 | } | |
2071 | ||
2072 | /* Copy the relocations indicated by the INTERNAL_RELOCS (which | |
2073 | originated from the section given by INPUT_REL_HDR) to the | |
2074 | OUTPUT_BFD. */ | |
2075 | ||
2076 | bfd_boolean | |
268b6b39 AM |
2077 | _bfd_elf_link_output_relocs (bfd *output_bfd, |
2078 | asection *input_section, | |
2079 | Elf_Internal_Shdr *input_rel_hdr, | |
2080 | Elf_Internal_Rela *internal_relocs) | |
45d6a902 AM |
2081 | { |
2082 | Elf_Internal_Rela *irela; | |
2083 | Elf_Internal_Rela *irelaend; | |
2084 | bfd_byte *erel; | |
2085 | Elf_Internal_Shdr *output_rel_hdr; | |
2086 | asection *output_section; | |
2087 | unsigned int *rel_countp = NULL; | |
9c5bfbb7 | 2088 | const struct elf_backend_data *bed; |
268b6b39 | 2089 | void (*swap_out) (bfd *, const Elf_Internal_Rela *, bfd_byte *); |
45d6a902 AM |
2090 | |
2091 | output_section = input_section->output_section; | |
2092 | output_rel_hdr = NULL; | |
2093 | ||
2094 | if (elf_section_data (output_section)->rel_hdr.sh_entsize | |
2095 | == input_rel_hdr->sh_entsize) | |
2096 | { | |
2097 | output_rel_hdr = &elf_section_data (output_section)->rel_hdr; | |
2098 | rel_countp = &elf_section_data (output_section)->rel_count; | |
2099 | } | |
2100 | else if (elf_section_data (output_section)->rel_hdr2 | |
2101 | && (elf_section_data (output_section)->rel_hdr2->sh_entsize | |
2102 | == input_rel_hdr->sh_entsize)) | |
2103 | { | |
2104 | output_rel_hdr = elf_section_data (output_section)->rel_hdr2; | |
2105 | rel_countp = &elf_section_data (output_section)->rel_count2; | |
2106 | } | |
2107 | else | |
2108 | { | |
2109 | (*_bfd_error_handler) | |
2110 | (_("%s: relocation size mismatch in %s section %s"), | |
2111 | bfd_get_filename (output_bfd), | |
2112 | bfd_archive_filename (input_section->owner), | |
2113 | input_section->name); | |
2114 | bfd_set_error (bfd_error_wrong_object_format); | |
2115 | return FALSE; | |
2116 | } | |
2117 | ||
2118 | bed = get_elf_backend_data (output_bfd); | |
2119 | if (input_rel_hdr->sh_entsize == bed->s->sizeof_rel) | |
2120 | swap_out = bed->s->swap_reloc_out; | |
2121 | else if (input_rel_hdr->sh_entsize == bed->s->sizeof_rela) | |
2122 | swap_out = bed->s->swap_reloca_out; | |
2123 | else | |
2124 | abort (); | |
2125 | ||
2126 | erel = output_rel_hdr->contents; | |
2127 | erel += *rel_countp * input_rel_hdr->sh_entsize; | |
2128 | irela = internal_relocs; | |
2129 | irelaend = irela + (NUM_SHDR_ENTRIES (input_rel_hdr) | |
2130 | * bed->s->int_rels_per_ext_rel); | |
2131 | while (irela < irelaend) | |
2132 | { | |
2133 | (*swap_out) (output_bfd, irela, erel); | |
2134 | irela += bed->s->int_rels_per_ext_rel; | |
2135 | erel += input_rel_hdr->sh_entsize; | |
2136 | } | |
2137 | ||
2138 | /* Bump the counter, so that we know where to add the next set of | |
2139 | relocations. */ | |
2140 | *rel_countp += NUM_SHDR_ENTRIES (input_rel_hdr); | |
2141 | ||
2142 | return TRUE; | |
2143 | } | |
2144 | \f | |
2145 | /* Fix up the flags for a symbol. This handles various cases which | |
2146 | can only be fixed after all the input files are seen. This is | |
2147 | currently called by both adjust_dynamic_symbol and | |
2148 | assign_sym_version, which is unnecessary but perhaps more robust in | |
2149 | the face of future changes. */ | |
2150 | ||
2151 | bfd_boolean | |
268b6b39 AM |
2152 | _bfd_elf_fix_symbol_flags (struct elf_link_hash_entry *h, |
2153 | struct elf_info_failed *eif) | |
45d6a902 AM |
2154 | { |
2155 | /* If this symbol was mentioned in a non-ELF file, try to set | |
2156 | DEF_REGULAR and REF_REGULAR correctly. This is the only way to | |
2157 | permit a non-ELF file to correctly refer to a symbol defined in | |
2158 | an ELF dynamic object. */ | |
2159 | if ((h->elf_link_hash_flags & ELF_LINK_NON_ELF) != 0) | |
2160 | { | |
2161 | while (h->root.type == bfd_link_hash_indirect) | |
2162 | h = (struct elf_link_hash_entry *) h->root.u.i.link; | |
2163 | ||
2164 | if (h->root.type != bfd_link_hash_defined | |
2165 | && h->root.type != bfd_link_hash_defweak) | |
2166 | h->elf_link_hash_flags |= (ELF_LINK_HASH_REF_REGULAR | |
2167 | | ELF_LINK_HASH_REF_REGULAR_NONWEAK); | |
2168 | else | |
2169 | { | |
2170 | if (h->root.u.def.section->owner != NULL | |
2171 | && (bfd_get_flavour (h->root.u.def.section->owner) | |
2172 | == bfd_target_elf_flavour)) | |
2173 | h->elf_link_hash_flags |= (ELF_LINK_HASH_REF_REGULAR | |
2174 | | ELF_LINK_HASH_REF_REGULAR_NONWEAK); | |
2175 | else | |
2176 | h->elf_link_hash_flags |= ELF_LINK_HASH_DEF_REGULAR; | |
2177 | } | |
2178 | ||
2179 | if (h->dynindx == -1 | |
2180 | && ((h->elf_link_hash_flags & ELF_LINK_HASH_DEF_DYNAMIC) != 0 | |
2181 | || (h->elf_link_hash_flags & ELF_LINK_HASH_REF_DYNAMIC) != 0)) | |
2182 | { | |
2183 | if (! _bfd_elf_link_record_dynamic_symbol (eif->info, h)) | |
2184 | { | |
2185 | eif->failed = TRUE; | |
2186 | return FALSE; | |
2187 | } | |
2188 | } | |
2189 | } | |
2190 | else | |
2191 | { | |
2192 | /* Unfortunately, ELF_LINK_NON_ELF is only correct if the symbol | |
2193 | was first seen in a non-ELF file. Fortunately, if the symbol | |
2194 | was first seen in an ELF file, we're probably OK unless the | |
2195 | symbol was defined in a non-ELF file. Catch that case here. | |
2196 | FIXME: We're still in trouble if the symbol was first seen in | |
2197 | a dynamic object, and then later in a non-ELF regular object. */ | |
2198 | if ((h->root.type == bfd_link_hash_defined | |
2199 | || h->root.type == bfd_link_hash_defweak) | |
2200 | && (h->elf_link_hash_flags & ELF_LINK_HASH_DEF_REGULAR) == 0 | |
2201 | && (h->root.u.def.section->owner != NULL | |
2202 | ? (bfd_get_flavour (h->root.u.def.section->owner) | |
2203 | != bfd_target_elf_flavour) | |
2204 | : (bfd_is_abs_section (h->root.u.def.section) | |
2205 | && (h->elf_link_hash_flags | |
2206 | & ELF_LINK_HASH_DEF_DYNAMIC) == 0))) | |
2207 | h->elf_link_hash_flags |= ELF_LINK_HASH_DEF_REGULAR; | |
2208 | } | |
2209 | ||
2210 | /* If this is a final link, and the symbol was defined as a common | |
2211 | symbol in a regular object file, and there was no definition in | |
2212 | any dynamic object, then the linker will have allocated space for | |
2213 | the symbol in a common section but the ELF_LINK_HASH_DEF_REGULAR | |
2214 | flag will not have been set. */ | |
2215 | if (h->root.type == bfd_link_hash_defined | |
2216 | && (h->elf_link_hash_flags & ELF_LINK_HASH_DEF_REGULAR) == 0 | |
2217 | && (h->elf_link_hash_flags & ELF_LINK_HASH_REF_REGULAR) != 0 | |
2218 | && (h->elf_link_hash_flags & ELF_LINK_HASH_DEF_DYNAMIC) == 0 | |
2219 | && (h->root.u.def.section->owner->flags & DYNAMIC) == 0) | |
2220 | h->elf_link_hash_flags |= ELF_LINK_HASH_DEF_REGULAR; | |
2221 | ||
2222 | /* If -Bsymbolic was used (which means to bind references to global | |
2223 | symbols to the definition within the shared object), and this | |
2224 | symbol was defined in a regular object, then it actually doesn't | |
9c7a29a3 AM |
2225 | need a PLT entry. Likewise, if the symbol has non-default |
2226 | visibility. If the symbol has hidden or internal visibility, we | |
c1be741f | 2227 | will force it local. */ |
45d6a902 AM |
2228 | if ((h->elf_link_hash_flags & ELF_LINK_HASH_NEEDS_PLT) != 0 |
2229 | && eif->info->shared | |
0eddce27 | 2230 | && is_elf_hash_table (eif->info->hash) |
45d6a902 | 2231 | && (eif->info->symbolic |
c1be741f | 2232 | || ELF_ST_VISIBILITY (h->other) != STV_DEFAULT) |
45d6a902 AM |
2233 | && (h->elf_link_hash_flags & ELF_LINK_HASH_DEF_REGULAR) != 0) |
2234 | { | |
9c5bfbb7 | 2235 | const struct elf_backend_data *bed; |
45d6a902 AM |
2236 | bfd_boolean force_local; |
2237 | ||
2238 | bed = get_elf_backend_data (elf_hash_table (eif->info)->dynobj); | |
2239 | ||
2240 | force_local = (ELF_ST_VISIBILITY (h->other) == STV_INTERNAL | |
2241 | || ELF_ST_VISIBILITY (h->other) == STV_HIDDEN); | |
2242 | (*bed->elf_backend_hide_symbol) (eif->info, h, force_local); | |
2243 | } | |
2244 | ||
2245 | /* If a weak undefined symbol has non-default visibility, we also | |
2246 | hide it from the dynamic linker. */ | |
9c7a29a3 | 2247 | if (ELF_ST_VISIBILITY (h->other) != STV_DEFAULT |
45d6a902 AM |
2248 | && h->root.type == bfd_link_hash_undefweak) |
2249 | { | |
9c5bfbb7 | 2250 | const struct elf_backend_data *bed; |
45d6a902 AM |
2251 | bed = get_elf_backend_data (elf_hash_table (eif->info)->dynobj); |
2252 | (*bed->elf_backend_hide_symbol) (eif->info, h, TRUE); | |
2253 | } | |
2254 | ||
2255 | /* If this is a weak defined symbol in a dynamic object, and we know | |
2256 | the real definition in the dynamic object, copy interesting flags | |
2257 | over to the real definition. */ | |
2258 | if (h->weakdef != NULL) | |
2259 | { | |
2260 | struct elf_link_hash_entry *weakdef; | |
2261 | ||
2262 | weakdef = h->weakdef; | |
2263 | if (h->root.type == bfd_link_hash_indirect) | |
2264 | h = (struct elf_link_hash_entry *) h->root.u.i.link; | |
2265 | ||
2266 | BFD_ASSERT (h->root.type == bfd_link_hash_defined | |
2267 | || h->root.type == bfd_link_hash_defweak); | |
2268 | BFD_ASSERT (weakdef->root.type == bfd_link_hash_defined | |
2269 | || weakdef->root.type == bfd_link_hash_defweak); | |
2270 | BFD_ASSERT (weakdef->elf_link_hash_flags & ELF_LINK_HASH_DEF_DYNAMIC); | |
2271 | ||
2272 | /* If the real definition is defined by a regular object file, | |
2273 | don't do anything special. See the longer description in | |
2274 | _bfd_elf_adjust_dynamic_symbol, below. */ | |
2275 | if ((weakdef->elf_link_hash_flags & ELF_LINK_HASH_DEF_REGULAR) != 0) | |
2276 | h->weakdef = NULL; | |
2277 | else | |
2278 | { | |
9c5bfbb7 | 2279 | const struct elf_backend_data *bed; |
45d6a902 AM |
2280 | |
2281 | bed = get_elf_backend_data (elf_hash_table (eif->info)->dynobj); | |
2282 | (*bed->elf_backend_copy_indirect_symbol) (bed, weakdef, h); | |
2283 | } | |
2284 | } | |
2285 | ||
2286 | return TRUE; | |
2287 | } | |
2288 | ||
2289 | /* Make the backend pick a good value for a dynamic symbol. This is | |
2290 | called via elf_link_hash_traverse, and also calls itself | |
2291 | recursively. */ | |
2292 | ||
2293 | bfd_boolean | |
268b6b39 | 2294 | _bfd_elf_adjust_dynamic_symbol (struct elf_link_hash_entry *h, void *data) |
45d6a902 | 2295 | { |
268b6b39 | 2296 | struct elf_info_failed *eif = data; |
45d6a902 | 2297 | bfd *dynobj; |
9c5bfbb7 | 2298 | const struct elf_backend_data *bed; |
45d6a902 | 2299 | |
0eddce27 | 2300 | if (! is_elf_hash_table (eif->info->hash)) |
45d6a902 AM |
2301 | return FALSE; |
2302 | ||
2303 | if (h->root.type == bfd_link_hash_warning) | |
2304 | { | |
2305 | h->plt = elf_hash_table (eif->info)->init_offset; | |
2306 | h->got = elf_hash_table (eif->info)->init_offset; | |
2307 | ||
2308 | /* When warning symbols are created, they **replace** the "real" | |
2309 | entry in the hash table, thus we never get to see the real | |
2310 | symbol in a hash traversal. So look at it now. */ | |
2311 | h = (struct elf_link_hash_entry *) h->root.u.i.link; | |
2312 | } | |
2313 | ||
2314 | /* Ignore indirect symbols. These are added by the versioning code. */ | |
2315 | if (h->root.type == bfd_link_hash_indirect) | |
2316 | return TRUE; | |
2317 | ||
2318 | /* Fix the symbol flags. */ | |
2319 | if (! _bfd_elf_fix_symbol_flags (h, eif)) | |
2320 | return FALSE; | |
2321 | ||
2322 | /* If this symbol does not require a PLT entry, and it is not | |
2323 | defined by a dynamic object, or is not referenced by a regular | |
2324 | object, ignore it. We do have to handle a weak defined symbol, | |
2325 | even if no regular object refers to it, if we decided to add it | |
2326 | to the dynamic symbol table. FIXME: Do we normally need to worry | |
2327 | about symbols which are defined by one dynamic object and | |
2328 | referenced by another one? */ | |
2329 | if ((h->elf_link_hash_flags & ELF_LINK_HASH_NEEDS_PLT) == 0 | |
2330 | && ((h->elf_link_hash_flags & ELF_LINK_HASH_DEF_REGULAR) != 0 | |
2331 | || (h->elf_link_hash_flags & ELF_LINK_HASH_DEF_DYNAMIC) == 0 | |
2332 | || ((h->elf_link_hash_flags & ELF_LINK_HASH_REF_REGULAR) == 0 | |
2333 | && (h->weakdef == NULL || h->weakdef->dynindx == -1)))) | |
2334 | { | |
2335 | h->plt = elf_hash_table (eif->info)->init_offset; | |
2336 | return TRUE; | |
2337 | } | |
2338 | ||
2339 | /* If we've already adjusted this symbol, don't do it again. This | |
2340 | can happen via a recursive call. */ | |
2341 | if ((h->elf_link_hash_flags & ELF_LINK_HASH_DYNAMIC_ADJUSTED) != 0) | |
2342 | return TRUE; | |
2343 | ||
2344 | /* Don't look at this symbol again. Note that we must set this | |
2345 | after checking the above conditions, because we may look at a | |
2346 | symbol once, decide not to do anything, and then get called | |
2347 | recursively later after REF_REGULAR is set below. */ | |
2348 | h->elf_link_hash_flags |= ELF_LINK_HASH_DYNAMIC_ADJUSTED; | |
2349 | ||
2350 | /* If this is a weak definition, and we know a real definition, and | |
2351 | the real symbol is not itself defined by a regular object file, | |
2352 | then get a good value for the real definition. We handle the | |
2353 | real symbol first, for the convenience of the backend routine. | |
2354 | ||
2355 | Note that there is a confusing case here. If the real definition | |
2356 | is defined by a regular object file, we don't get the real symbol | |
2357 | from the dynamic object, but we do get the weak symbol. If the | |
2358 | processor backend uses a COPY reloc, then if some routine in the | |
2359 | dynamic object changes the real symbol, we will not see that | |
2360 | change in the corresponding weak symbol. This is the way other | |
2361 | ELF linkers work as well, and seems to be a result of the shared | |
2362 | library model. | |
2363 | ||
2364 | I will clarify this issue. Most SVR4 shared libraries define the | |
2365 | variable _timezone and define timezone as a weak synonym. The | |
2366 | tzset call changes _timezone. If you write | |
2367 | extern int timezone; | |
2368 | int _timezone = 5; | |
2369 | int main () { tzset (); printf ("%d %d\n", timezone, _timezone); } | |
2370 | you might expect that, since timezone is a synonym for _timezone, | |
2371 | the same number will print both times. However, if the processor | |
2372 | backend uses a COPY reloc, then actually timezone will be copied | |
2373 | into your process image, and, since you define _timezone | |
2374 | yourself, _timezone will not. Thus timezone and _timezone will | |
2375 | wind up at different memory locations. The tzset call will set | |
2376 | _timezone, leaving timezone unchanged. */ | |
2377 | ||
2378 | if (h->weakdef != NULL) | |
2379 | { | |
2380 | /* If we get to this point, we know there is an implicit | |
2381 | reference by a regular object file via the weak symbol H. | |
2382 | FIXME: Is this really true? What if the traversal finds | |
2383 | H->WEAKDEF before it finds H? */ | |
2384 | h->weakdef->elf_link_hash_flags |= ELF_LINK_HASH_REF_REGULAR; | |
2385 | ||
268b6b39 | 2386 | if (! _bfd_elf_adjust_dynamic_symbol (h->weakdef, eif)) |
45d6a902 AM |
2387 | return FALSE; |
2388 | } | |
2389 | ||
2390 | /* If a symbol has no type and no size and does not require a PLT | |
2391 | entry, then we are probably about to do the wrong thing here: we | |
2392 | are probably going to create a COPY reloc for an empty object. | |
2393 | This case can arise when a shared object is built with assembly | |
2394 | code, and the assembly code fails to set the symbol type. */ | |
2395 | if (h->size == 0 | |
2396 | && h->type == STT_NOTYPE | |
2397 | && (h->elf_link_hash_flags & ELF_LINK_HASH_NEEDS_PLT) == 0) | |
2398 | (*_bfd_error_handler) | |
2399 | (_("warning: type and size of dynamic symbol `%s' are not defined"), | |
2400 | h->root.root.string); | |
2401 | ||
2402 | dynobj = elf_hash_table (eif->info)->dynobj; | |
2403 | bed = get_elf_backend_data (dynobj); | |
2404 | if (! (*bed->elf_backend_adjust_dynamic_symbol) (eif->info, h)) | |
2405 | { | |
2406 | eif->failed = TRUE; | |
2407 | return FALSE; | |
2408 | } | |
2409 | ||
2410 | return TRUE; | |
2411 | } | |
2412 | ||
2413 | /* Adjust all external symbols pointing into SEC_MERGE sections | |
2414 | to reflect the object merging within the sections. */ | |
2415 | ||
2416 | bfd_boolean | |
268b6b39 | 2417 | _bfd_elf_link_sec_merge_syms (struct elf_link_hash_entry *h, void *data) |
45d6a902 AM |
2418 | { |
2419 | asection *sec; | |
2420 | ||
2421 | if (h->root.type == bfd_link_hash_warning) | |
2422 | h = (struct elf_link_hash_entry *) h->root.u.i.link; | |
2423 | ||
2424 | if ((h->root.type == bfd_link_hash_defined | |
2425 | || h->root.type == bfd_link_hash_defweak) | |
2426 | && ((sec = h->root.u.def.section)->flags & SEC_MERGE) | |
2427 | && sec->sec_info_type == ELF_INFO_TYPE_MERGE) | |
2428 | { | |
268b6b39 | 2429 | bfd *output_bfd = data; |
45d6a902 AM |
2430 | |
2431 | h->root.u.def.value = | |
2432 | _bfd_merged_section_offset (output_bfd, | |
2433 | &h->root.u.def.section, | |
2434 | elf_section_data (sec)->sec_info, | |
268b6b39 | 2435 | h->root.u.def.value, 0); |
45d6a902 AM |
2436 | } |
2437 | ||
2438 | return TRUE; | |
2439 | } | |
986a241f RH |
2440 | |
2441 | /* Returns false if the symbol referred to by H should be considered | |
2442 | to resolve local to the current module, and true if it should be | |
2443 | considered to bind dynamically. */ | |
2444 | ||
2445 | bfd_boolean | |
268b6b39 AM |
2446 | _bfd_elf_dynamic_symbol_p (struct elf_link_hash_entry *h, |
2447 | struct bfd_link_info *info, | |
2448 | bfd_boolean ignore_protected) | |
986a241f RH |
2449 | { |
2450 | bfd_boolean binding_stays_local_p; | |
2451 | ||
2452 | if (h == NULL) | |
2453 | return FALSE; | |
2454 | ||
2455 | while (h->root.type == bfd_link_hash_indirect | |
2456 | || h->root.type == bfd_link_hash_warning) | |
2457 | h = (struct elf_link_hash_entry *) h->root.u.i.link; | |
2458 | ||
2459 | /* If it was forced local, then clearly it's not dynamic. */ | |
2460 | if (h->dynindx == -1) | |
2461 | return FALSE; | |
2462 | if (h->elf_link_hash_flags & ELF_LINK_FORCED_LOCAL) | |
2463 | return FALSE; | |
2464 | ||
2465 | /* Identify the cases where name binding rules say that a | |
2466 | visible symbol resolves locally. */ | |
2467 | binding_stays_local_p = info->executable || info->symbolic; | |
2468 | ||
2469 | switch (ELF_ST_VISIBILITY (h->other)) | |
2470 | { | |
2471 | case STV_INTERNAL: | |
2472 | case STV_HIDDEN: | |
2473 | return FALSE; | |
2474 | ||
2475 | case STV_PROTECTED: | |
2476 | /* Proper resolution for function pointer equality may require | |
2477 | that these symbols perhaps be resolved dynamically, even though | |
2478 | we should be resolving them to the current module. */ | |
2479 | if (!ignore_protected) | |
2480 | binding_stays_local_p = TRUE; | |
2481 | break; | |
2482 | ||
2483 | default: | |
986a241f RH |
2484 | break; |
2485 | } | |
2486 | ||
aa37626c L |
2487 | /* If it isn't defined locally, then clearly it's dynamic. */ |
2488 | if ((h->elf_link_hash_flags & ELF_LINK_HASH_DEF_REGULAR) == 0) | |
2489 | return TRUE; | |
2490 | ||
986a241f RH |
2491 | /* Otherwise, the symbol is dynamic if binding rules don't tell |
2492 | us that it remains local. */ | |
2493 | return !binding_stays_local_p; | |
2494 | } | |
f6c52c13 AM |
2495 | |
2496 | /* Return true if the symbol referred to by H should be considered | |
2497 | to resolve local to the current module, and false otherwise. Differs | |
2498 | from (the inverse of) _bfd_elf_dynamic_symbol_p in the treatment of | |
2499 | undefined symbols and weak symbols. */ | |
2500 | ||
2501 | bfd_boolean | |
268b6b39 AM |
2502 | _bfd_elf_symbol_refs_local_p (struct elf_link_hash_entry *h, |
2503 | struct bfd_link_info *info, | |
2504 | bfd_boolean local_protected) | |
f6c52c13 AM |
2505 | { |
2506 | /* If it's a local sym, of course we resolve locally. */ | |
2507 | if (h == NULL) | |
2508 | return TRUE; | |
2509 | ||
2510 | /* If we don't have a definition in a regular file, then we can't | |
2511 | resolve locally. The sym is either undefined or dynamic. */ | |
2512 | if ((h->elf_link_hash_flags & ELF_LINK_HASH_DEF_REGULAR) == 0) | |
2513 | return FALSE; | |
2514 | ||
2515 | /* Forced local symbols resolve locally. */ | |
2516 | if ((h->elf_link_hash_flags & ELF_LINK_FORCED_LOCAL) != 0) | |
2517 | return TRUE; | |
2518 | ||
2519 | /* As do non-dynamic symbols. */ | |
2520 | if (h->dynindx == -1) | |
2521 | return TRUE; | |
2522 | ||
2523 | /* At this point, we know the symbol is defined and dynamic. In an | |
2524 | executable it must resolve locally, likewise when building symbolic | |
2525 | shared libraries. */ | |
2526 | if (info->executable || info->symbolic) | |
2527 | return TRUE; | |
2528 | ||
2529 | /* Now deal with defined dynamic symbols in shared libraries. Ones | |
2530 | with default visibility might not resolve locally. */ | |
2531 | if (ELF_ST_VISIBILITY (h->other) == STV_DEFAULT) | |
2532 | return FALSE; | |
2533 | ||
2534 | /* However, STV_HIDDEN or STV_INTERNAL ones must be local. */ | |
2535 | if (ELF_ST_VISIBILITY (h->other) != STV_PROTECTED) | |
2536 | return TRUE; | |
2537 | ||
2538 | /* Function pointer equality tests may require that STV_PROTECTED | |
2539 | symbols be treated as dynamic symbols, even when we know that the | |
2540 | dynamic linker will resolve them locally. */ | |
2541 | return local_protected; | |
2542 | } | |
e1918d23 AM |
2543 | |
2544 | /* Caches some TLS segment info, and ensures that the TLS segment vma is | |
2545 | aligned. Returns the first TLS output section. */ | |
2546 | ||
2547 | struct bfd_section * | |
2548 | _bfd_elf_tls_setup (bfd *obfd, struct bfd_link_info *info) | |
2549 | { | |
2550 | struct bfd_section *sec, *tls; | |
2551 | unsigned int align = 0; | |
2552 | ||
2553 | for (sec = obfd->sections; sec != NULL; sec = sec->next) | |
2554 | if ((sec->flags & SEC_THREAD_LOCAL) != 0) | |
2555 | break; | |
2556 | tls = sec; | |
2557 | ||
2558 | for (; sec != NULL && (sec->flags & SEC_THREAD_LOCAL) != 0; sec = sec->next) | |
2559 | if (sec->alignment_power > align) | |
2560 | align = sec->alignment_power; | |
2561 | ||
2562 | elf_hash_table (info)->tls_sec = tls; | |
2563 | ||
2564 | /* Ensure the alignment of the first section is the largest alignment, | |
2565 | so that the tls segment starts aligned. */ | |
2566 | if (tls != NULL) | |
2567 | tls->alignment_power = align; | |
2568 | ||
2569 | return tls; | |
2570 | } | |
0ad989f9 L |
2571 | |
2572 | /* Return TRUE iff this is a non-common, definition of a non-function symbol. */ | |
2573 | static bfd_boolean | |
2574 | is_global_data_symbol_definition (bfd *abfd ATTRIBUTE_UNUSED, | |
2575 | Elf_Internal_Sym *sym) | |
2576 | { | |
2577 | /* Local symbols do not count, but target specific ones might. */ | |
2578 | if (ELF_ST_BIND (sym->st_info) != STB_GLOBAL | |
2579 | && ELF_ST_BIND (sym->st_info) < STB_LOOS) | |
2580 | return FALSE; | |
2581 | ||
2582 | /* Function symbols do not count. */ | |
2583 | if (ELF_ST_TYPE (sym->st_info) == STT_FUNC) | |
2584 | return FALSE; | |
2585 | ||
2586 | /* If the section is undefined, then so is the symbol. */ | |
2587 | if (sym->st_shndx == SHN_UNDEF) | |
2588 | return FALSE; | |
2589 | ||
2590 | /* If the symbol is defined in the common section, then | |
2591 | it is a common definition and so does not count. */ | |
2592 | if (sym->st_shndx == SHN_COMMON) | |
2593 | return FALSE; | |
2594 | ||
2595 | /* If the symbol is in a target specific section then we | |
2596 | must rely upon the backend to tell us what it is. */ | |
2597 | if (sym->st_shndx >= SHN_LORESERVE && sym->st_shndx < SHN_ABS) | |
2598 | /* FIXME - this function is not coded yet: | |
2599 | ||
2600 | return _bfd_is_global_symbol_definition (abfd, sym); | |
2601 | ||
2602 | Instead for now assume that the definition is not global, | |
2603 | Even if this is wrong, at least the linker will behave | |
2604 | in the same way that it used to do. */ | |
2605 | return FALSE; | |
2606 | ||
2607 | return TRUE; | |
2608 | } | |
2609 | ||
2610 | /* Search the symbol table of the archive element of the archive ABFD | |
2611 | whose archive map contains a mention of SYMDEF, and determine if | |
2612 | the symbol is defined in this element. */ | |
2613 | static bfd_boolean | |
2614 | elf_link_is_defined_archive_symbol (bfd * abfd, carsym * symdef) | |
2615 | { | |
2616 | Elf_Internal_Shdr * hdr; | |
2617 | bfd_size_type symcount; | |
2618 | bfd_size_type extsymcount; | |
2619 | bfd_size_type extsymoff; | |
2620 | Elf_Internal_Sym *isymbuf; | |
2621 | Elf_Internal_Sym *isym; | |
2622 | Elf_Internal_Sym *isymend; | |
2623 | bfd_boolean result; | |
2624 | ||
2625 | abfd = _bfd_get_elt_at_filepos (abfd, symdef->file_offset); | |
2626 | if (abfd == NULL) | |
2627 | return FALSE; | |
2628 | ||
2629 | if (! bfd_check_format (abfd, bfd_object)) | |
2630 | return FALSE; | |
2631 | ||
2632 | /* If we have already included the element containing this symbol in the | |
2633 | link then we do not need to include it again. Just claim that any symbol | |
2634 | it contains is not a definition, so that our caller will not decide to | |
2635 | (re)include this element. */ | |
2636 | if (abfd->archive_pass) | |
2637 | return FALSE; | |
2638 | ||
2639 | /* Select the appropriate symbol table. */ | |
2640 | if ((abfd->flags & DYNAMIC) == 0 || elf_dynsymtab (abfd) == 0) | |
2641 | hdr = &elf_tdata (abfd)->symtab_hdr; | |
2642 | else | |
2643 | hdr = &elf_tdata (abfd)->dynsymtab_hdr; | |
2644 | ||
2645 | symcount = hdr->sh_size / get_elf_backend_data (abfd)->s->sizeof_sym; | |
2646 | ||
2647 | /* The sh_info field of the symtab header tells us where the | |
2648 | external symbols start. We don't care about the local symbols. */ | |
2649 | if (elf_bad_symtab (abfd)) | |
2650 | { | |
2651 | extsymcount = symcount; | |
2652 | extsymoff = 0; | |
2653 | } | |
2654 | else | |
2655 | { | |
2656 | extsymcount = symcount - hdr->sh_info; | |
2657 | extsymoff = hdr->sh_info; | |
2658 | } | |
2659 | ||
2660 | if (extsymcount == 0) | |
2661 | return FALSE; | |
2662 | ||
2663 | /* Read in the symbol table. */ | |
2664 | isymbuf = bfd_elf_get_elf_syms (abfd, hdr, extsymcount, extsymoff, | |
2665 | NULL, NULL, NULL); | |
2666 | if (isymbuf == NULL) | |
2667 | return FALSE; | |
2668 | ||
2669 | /* Scan the symbol table looking for SYMDEF. */ | |
2670 | result = FALSE; | |
2671 | for (isym = isymbuf, isymend = isymbuf + extsymcount; isym < isymend; isym++) | |
2672 | { | |
2673 | const char *name; | |
2674 | ||
2675 | name = bfd_elf_string_from_elf_section (abfd, hdr->sh_link, | |
2676 | isym->st_name); | |
2677 | if (name == NULL) | |
2678 | break; | |
2679 | ||
2680 | if (strcmp (name, symdef->name) == 0) | |
2681 | { | |
2682 | result = is_global_data_symbol_definition (abfd, isym); | |
2683 | break; | |
2684 | } | |
2685 | } | |
2686 | ||
2687 | free (isymbuf); | |
2688 | ||
2689 | return result; | |
2690 | } | |
2691 | \f | |
2692 | /* Add symbols from an ELF archive file to the linker hash table. We | |
2693 | don't use _bfd_generic_link_add_archive_symbols because of a | |
2694 | problem which arises on UnixWare. The UnixWare libc.so is an | |
2695 | archive which includes an entry libc.so.1 which defines a bunch of | |
2696 | symbols. The libc.so archive also includes a number of other | |
2697 | object files, which also define symbols, some of which are the same | |
2698 | as those defined in libc.so.1. Correct linking requires that we | |
2699 | consider each object file in turn, and include it if it defines any | |
2700 | symbols we need. _bfd_generic_link_add_archive_symbols does not do | |
2701 | this; it looks through the list of undefined symbols, and includes | |
2702 | any object file which defines them. When this algorithm is used on | |
2703 | UnixWare, it winds up pulling in libc.so.1 early and defining a | |
2704 | bunch of symbols. This means that some of the other objects in the | |
2705 | archive are not included in the link, which is incorrect since they | |
2706 | precede libc.so.1 in the archive. | |
2707 | ||
2708 | Fortunately, ELF archive handling is simpler than that done by | |
2709 | _bfd_generic_link_add_archive_symbols, which has to allow for a.out | |
2710 | oddities. In ELF, if we find a symbol in the archive map, and the | |
2711 | symbol is currently undefined, we know that we must pull in that | |
2712 | object file. | |
2713 | ||
2714 | Unfortunately, we do have to make multiple passes over the symbol | |
2715 | table until nothing further is resolved. */ | |
2716 | ||
2717 | bfd_boolean | |
2718 | _bfd_elf_link_add_archive_symbols (bfd *abfd, | |
2719 | struct bfd_link_info *info) | |
2720 | { | |
2721 | symindex c; | |
2722 | bfd_boolean *defined = NULL; | |
2723 | bfd_boolean *included = NULL; | |
2724 | carsym *symdefs; | |
2725 | bfd_boolean loop; | |
2726 | bfd_size_type amt; | |
2727 | ||
2728 | if (! bfd_has_map (abfd)) | |
2729 | { | |
2730 | /* An empty archive is a special case. */ | |
2731 | if (bfd_openr_next_archived_file (abfd, NULL) == NULL) | |
2732 | return TRUE; | |
2733 | bfd_set_error (bfd_error_no_armap); | |
2734 | return FALSE; | |
2735 | } | |
2736 | ||
2737 | /* Keep track of all symbols we know to be already defined, and all | |
2738 | files we know to be already included. This is to speed up the | |
2739 | second and subsequent passes. */ | |
2740 | c = bfd_ardata (abfd)->symdef_count; | |
2741 | if (c == 0) | |
2742 | return TRUE; | |
2743 | amt = c; | |
2744 | amt *= sizeof (bfd_boolean); | |
2745 | defined = bfd_zmalloc (amt); | |
2746 | included = bfd_zmalloc (amt); | |
2747 | if (defined == NULL || included == NULL) | |
2748 | goto error_return; | |
2749 | ||
2750 | symdefs = bfd_ardata (abfd)->symdefs; | |
2751 | ||
2752 | do | |
2753 | { | |
2754 | file_ptr last; | |
2755 | symindex i; | |
2756 | carsym *symdef; | |
2757 | carsym *symdefend; | |
2758 | ||
2759 | loop = FALSE; | |
2760 | last = -1; | |
2761 | ||
2762 | symdef = symdefs; | |
2763 | symdefend = symdef + c; | |
2764 | for (i = 0; symdef < symdefend; symdef++, i++) | |
2765 | { | |
2766 | struct elf_link_hash_entry *h; | |
2767 | bfd *element; | |
2768 | struct bfd_link_hash_entry *undefs_tail; | |
2769 | symindex mark; | |
2770 | ||
2771 | if (defined[i] || included[i]) | |
2772 | continue; | |
2773 | if (symdef->file_offset == last) | |
2774 | { | |
2775 | included[i] = TRUE; | |
2776 | continue; | |
2777 | } | |
2778 | ||
2779 | h = elf_link_hash_lookup (elf_hash_table (info), symdef->name, | |
2780 | FALSE, FALSE, FALSE); | |
2781 | ||
2782 | if (h == NULL) | |
2783 | { | |
2784 | char *p, *copy; | |
2785 | size_t len, first; | |
2786 | ||
2787 | /* If this is a default version (the name contains @@), | |
2788 | look up the symbol again with only one `@' as well | |
2789 | as without the version. The effect is that references | |
2790 | to the symbol with and without the version will be | |
2791 | matched by the default symbol in the archive. */ | |
2792 | ||
2793 | p = strchr (symdef->name, ELF_VER_CHR); | |
2794 | if (p == NULL || p[1] != ELF_VER_CHR) | |
2795 | continue; | |
2796 | ||
2797 | /* First check with only one `@'. */ | |
2798 | len = strlen (symdef->name); | |
2799 | copy = bfd_alloc (abfd, len); | |
2800 | if (copy == NULL) | |
2801 | goto error_return; | |
2802 | first = p - symdef->name + 1; | |
2803 | memcpy (copy, symdef->name, first); | |
2804 | memcpy (copy + first, symdef->name + first + 1, len - first); | |
2805 | ||
2806 | h = elf_link_hash_lookup (elf_hash_table (info), copy, | |
2807 | FALSE, FALSE, FALSE); | |
2808 | ||
2809 | if (h == NULL) | |
2810 | { | |
2811 | /* We also need to check references to the symbol | |
2812 | without the version. */ | |
2813 | ||
2814 | copy[first - 1] = '\0'; | |
2815 | h = elf_link_hash_lookup (elf_hash_table (info), | |
2816 | copy, FALSE, FALSE, FALSE); | |
2817 | } | |
2818 | ||
2819 | bfd_release (abfd, copy); | |
2820 | } | |
2821 | ||
2822 | if (h == NULL) | |
2823 | continue; | |
2824 | ||
2825 | if (h->root.type == bfd_link_hash_common) | |
2826 | { | |
2827 | /* We currently have a common symbol. The archive map contains | |
2828 | a reference to this symbol, so we may want to include it. We | |
2829 | only want to include it however, if this archive element | |
2830 | contains a definition of the symbol, not just another common | |
2831 | declaration of it. | |
2832 | ||
2833 | Unfortunately some archivers (including GNU ar) will put | |
2834 | declarations of common symbols into their archive maps, as | |
2835 | well as real definitions, so we cannot just go by the archive | |
2836 | map alone. Instead we must read in the element's symbol | |
2837 | table and check that to see what kind of symbol definition | |
2838 | this is. */ | |
2839 | if (! elf_link_is_defined_archive_symbol (abfd, symdef)) | |
2840 | continue; | |
2841 | } | |
2842 | else if (h->root.type != bfd_link_hash_undefined) | |
2843 | { | |
2844 | if (h->root.type != bfd_link_hash_undefweak) | |
2845 | defined[i] = TRUE; | |
2846 | continue; | |
2847 | } | |
2848 | ||
2849 | /* We need to include this archive member. */ | |
2850 | element = _bfd_get_elt_at_filepos (abfd, symdef->file_offset); | |
2851 | if (element == NULL) | |
2852 | goto error_return; | |
2853 | ||
2854 | if (! bfd_check_format (element, bfd_object)) | |
2855 | goto error_return; | |
2856 | ||
2857 | /* Doublecheck that we have not included this object | |
2858 | already--it should be impossible, but there may be | |
2859 | something wrong with the archive. */ | |
2860 | if (element->archive_pass != 0) | |
2861 | { | |
2862 | bfd_set_error (bfd_error_bad_value); | |
2863 | goto error_return; | |
2864 | } | |
2865 | element->archive_pass = 1; | |
2866 | ||
2867 | undefs_tail = info->hash->undefs_tail; | |
2868 | ||
2869 | if (! (*info->callbacks->add_archive_element) (info, element, | |
2870 | symdef->name)) | |
2871 | goto error_return; | |
2872 | if (! bfd_link_add_symbols (element, info)) | |
2873 | goto error_return; | |
2874 | ||
2875 | /* If there are any new undefined symbols, we need to make | |
2876 | another pass through the archive in order to see whether | |
2877 | they can be defined. FIXME: This isn't perfect, because | |
2878 | common symbols wind up on undefs_tail and because an | |
2879 | undefined symbol which is defined later on in this pass | |
2880 | does not require another pass. This isn't a bug, but it | |
2881 | does make the code less efficient than it could be. */ | |
2882 | if (undefs_tail != info->hash->undefs_tail) | |
2883 | loop = TRUE; | |
2884 | ||
2885 | /* Look backward to mark all symbols from this object file | |
2886 | which we have already seen in this pass. */ | |
2887 | mark = i; | |
2888 | do | |
2889 | { | |
2890 | included[mark] = TRUE; | |
2891 | if (mark == 0) | |
2892 | break; | |
2893 | --mark; | |
2894 | } | |
2895 | while (symdefs[mark].file_offset == symdef->file_offset); | |
2896 | ||
2897 | /* We mark subsequent symbols from this object file as we go | |
2898 | on through the loop. */ | |
2899 | last = symdef->file_offset; | |
2900 | } | |
2901 | } | |
2902 | while (loop); | |
2903 | ||
2904 | free (defined); | |
2905 | free (included); | |
2906 | ||
2907 | return TRUE; | |
2908 | ||
2909 | error_return: | |
2910 | if (defined != NULL) | |
2911 | free (defined); | |
2912 | if (included != NULL) | |
2913 | free (included); | |
2914 | return FALSE; | |
2915 | } |