Commit | Line | Data |
---|---|---|
252b5132 | 1 | /* ELF linker support. |
2bd171e0 | 2 | Copyright 1995, 1996, 1997, 1998, 1999, 2000 Free Software Foundation, Inc. |
252b5132 RH |
3 | |
4 | This file is part of BFD, the Binary File Descriptor library. | |
5 | ||
6 | This program is free software; you can redistribute it and/or modify | |
7 | it under the terms of the GNU General Public License as published by | |
8 | the Free Software Foundation; either version 2 of the License, or | |
9 | (at your option) any later version. | |
10 | ||
11 | This program is distributed in the hope that it will be useful, | |
12 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 | GNU General Public License for more details. | |
15 | ||
16 | You should have received a copy of the GNU General Public License | |
17 | along with this program; if not, write to the Free Software | |
18 | Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ | |
19 | ||
20 | /* ELF linker code. */ | |
21 | ||
22 | /* This struct is used to pass information to routines called via | |
23 | elf_link_hash_traverse which must return failure. */ | |
24 | ||
25 | struct elf_info_failed | |
26 | { | |
27 | boolean failed; | |
28 | struct bfd_link_info *info; | |
29 | }; | |
30 | ||
31 | static boolean elf_link_add_object_symbols | |
32 | PARAMS ((bfd *, struct bfd_link_info *)); | |
33 | static boolean elf_link_add_archive_symbols | |
34 | PARAMS ((bfd *, struct bfd_link_info *)); | |
35 | static boolean elf_merge_symbol | |
36 | PARAMS ((bfd *, struct bfd_link_info *, const char *, Elf_Internal_Sym *, | |
37 | asection **, bfd_vma *, struct elf_link_hash_entry **, | |
456981d7 | 38 | boolean *, boolean *, boolean *, boolean)); |
252b5132 RH |
39 | static boolean elf_export_symbol |
40 | PARAMS ((struct elf_link_hash_entry *, PTR)); | |
41 | static boolean elf_fix_symbol_flags | |
42 | PARAMS ((struct elf_link_hash_entry *, struct elf_info_failed *)); | |
43 | static boolean elf_adjust_dynamic_symbol | |
44 | PARAMS ((struct elf_link_hash_entry *, PTR)); | |
45 | static boolean elf_link_find_version_dependencies | |
46 | PARAMS ((struct elf_link_hash_entry *, PTR)); | |
47 | static boolean elf_link_find_version_dependencies | |
48 | PARAMS ((struct elf_link_hash_entry *, PTR)); | |
49 | static boolean elf_link_assign_sym_version | |
50 | PARAMS ((struct elf_link_hash_entry *, PTR)); | |
252b5132 RH |
51 | static boolean elf_collect_hash_codes |
52 | PARAMS ((struct elf_link_hash_entry *, PTR)); | |
6b5bd373 MM |
53 | static boolean elf_link_read_relocs_from_section |
54 | PARAMS ((bfd *, Elf_Internal_Shdr *, PTR, Elf_Internal_Rela *)); | |
23bc299b MM |
55 | static void elf_link_output_relocs |
56 | PARAMS ((bfd *, asection *, Elf_Internal_Shdr *, Elf_Internal_Rela *)); | |
57 | static boolean elf_link_size_reloc_section | |
58 | PARAMS ((bfd *, Elf_Internal_Shdr *, asection *)); | |
31367b81 MM |
59 | static void elf_link_adjust_relocs |
60 | PARAMS ((bfd *, Elf_Internal_Shdr *, unsigned int, | |
61 | struct elf_link_hash_entry **)); | |
252b5132 RH |
62 | |
63 | /* Given an ELF BFD, add symbols to the global hash table as | |
64 | appropriate. */ | |
65 | ||
66 | boolean | |
67 | elf_bfd_link_add_symbols (abfd, info) | |
68 | bfd *abfd; | |
69 | struct bfd_link_info *info; | |
70 | { | |
71 | switch (bfd_get_format (abfd)) | |
72 | { | |
73 | case bfd_object: | |
74 | return elf_link_add_object_symbols (abfd, info); | |
75 | case bfd_archive: | |
76 | return elf_link_add_archive_symbols (abfd, info); | |
77 | default: | |
78 | bfd_set_error (bfd_error_wrong_format); | |
79 | return false; | |
80 | } | |
81 | } | |
82 | \f | |
48dfb430 NC |
83 | /* Return true iff this is a non-common definition of a symbol. */ |
84 | static boolean | |
85 | is_global_symbol_definition (abfd, sym) | |
86033394 | 86 | bfd * abfd ATTRIBUTE_UNUSED; |
48dfb430 NC |
87 | Elf_Internal_Sym * sym; |
88 | { | |
89 | /* Local symbols do not count, but target specific ones might. */ | |
90 | if (ELF_ST_BIND (sym->st_info) != STB_GLOBAL | |
91 | && ELF_ST_BIND (sym->st_info) < STB_LOOS) | |
92 | return false; | |
93 | ||
94 | /* If the section is undefined, then so is the symbol. */ | |
95 | if (sym->st_shndx == SHN_UNDEF) | |
96 | return false; | |
97 | ||
98 | /* If the symbol is defined in the common section, then | |
99 | it is a common definition and so does not count. */ | |
100 | if (sym->st_shndx == SHN_COMMON) | |
101 | return false; | |
102 | ||
103 | /* If the symbol is in a target specific section then we | |
104 | must rely upon the backend to tell us what it is. */ | |
105 | if (sym->st_shndx >= SHN_LORESERVE && sym->st_shndx < SHN_ABS) | |
106 | /* FIXME - this function is not coded yet: | |
107 | ||
108 | return _bfd_is_global_symbol_definition (abfd, sym); | |
109 | ||
110 | Instead for now assume that the definition is not global, | |
111 | Even if this is wrong, at least the linker will behave | |
112 | in the same way that it used to do. */ | |
113 | return false; | |
114 | ||
115 | return true; | |
116 | } | |
117 | ||
118 | ||
a3a8c91d NC |
119 | /* Search the symbol table of the archive element of the archive ABFD |
120 | whoes archove map contains a mention of SYMDEF, and determine if | |
121 | the symbol is defined in this element. */ | |
122 | static boolean | |
123 | elf_link_is_defined_archive_symbol (abfd, symdef) | |
124 | bfd * abfd; | |
125 | carsym * symdef; | |
126 | { | |
127 | Elf_Internal_Shdr * hdr; | |
128 | Elf_External_Sym * esym; | |
129 | Elf_External_Sym * esymend; | |
130 | Elf_External_Sym * buf = NULL; | |
131 | size_t symcount; | |
132 | size_t extsymcount; | |
133 | size_t extsymoff; | |
134 | boolean result = false; | |
135 | ||
136 | abfd = _bfd_get_elt_at_filepos (abfd, symdef->file_offset); | |
137 | if (abfd == (bfd *) NULL) | |
138 | return false; | |
139 | ||
140 | if (! bfd_check_format (abfd, bfd_object)) | |
141 | return false; | |
142 | ||
48dfb430 NC |
143 | /* If we have already included the element containing this symbol in the |
144 | link then we do not need to include it again. Just claim that any symbol | |
145 | it contains is not a definition, so that our caller will not decide to | |
146 | (re)include this element. */ | |
147 | if (abfd->archive_pass) | |
148 | return false; | |
149 | ||
a3a8c91d NC |
150 | /* Select the appropriate symbol table. */ |
151 | if ((abfd->flags & DYNAMIC) == 0 || elf_dynsymtab (abfd) == 0) | |
152 | hdr = &elf_tdata (abfd)->symtab_hdr; | |
153 | else | |
154 | hdr = &elf_tdata (abfd)->dynsymtab_hdr; | |
155 | ||
156 | symcount = hdr->sh_size / sizeof (Elf_External_Sym); | |
157 | ||
158 | /* The sh_info field of the symtab header tells us where the | |
159 | external symbols start. We don't care about the local symbols. */ | |
160 | if (elf_bad_symtab (abfd)) | |
161 | { | |
162 | extsymcount = symcount; | |
163 | extsymoff = 0; | |
164 | } | |
165 | else | |
166 | { | |
167 | extsymcount = symcount - hdr->sh_info; | |
168 | extsymoff = hdr->sh_info; | |
169 | } | |
170 | ||
171 | buf = ((Elf_External_Sym *) | |
172 | bfd_malloc (extsymcount * sizeof (Elf_External_Sym))); | |
173 | if (buf == NULL && extsymcount != 0) | |
174 | return false; | |
175 | ||
176 | /* Read in the symbol table. | |
177 | FIXME: This ought to be cached somewhere. */ | |
178 | if (bfd_seek (abfd, | |
179 | hdr->sh_offset + extsymoff * sizeof (Elf_External_Sym), | |
180 | SEEK_SET) != 0 | |
181 | || (bfd_read ((PTR) buf, sizeof (Elf_External_Sym), extsymcount, abfd) | |
182 | != extsymcount * sizeof (Elf_External_Sym))) | |
183 | { | |
184 | free (buf); | |
185 | return false; | |
186 | } | |
187 | ||
188 | /* Scan the symbol table looking for SYMDEF. */ | |
189 | esymend = buf + extsymcount; | |
190 | for (esym = buf; | |
191 | esym < esymend; | |
192 | esym++) | |
193 | { | |
194 | Elf_Internal_Sym sym; | |
195 | const char * name; | |
196 | ||
197 | elf_swap_symbol_in (abfd, esym, & sym); | |
198 | ||
199 | name = bfd_elf_string_from_elf_section (abfd, hdr->sh_link, sym.st_name); | |
200 | if (name == (const char *) NULL) | |
201 | break; | |
202 | ||
203 | if (strcmp (name, symdef->name) == 0) | |
204 | { | |
48dfb430 | 205 | result = is_global_symbol_definition (abfd, & sym); |
a3a8c91d NC |
206 | break; |
207 | } | |
208 | } | |
209 | ||
210 | free (buf); | |
211 | ||
212 | return result; | |
213 | } | |
214 | \f | |
252b5132 RH |
215 | |
216 | /* Add symbols from an ELF archive file to the linker hash table. We | |
217 | don't use _bfd_generic_link_add_archive_symbols because of a | |
218 | problem which arises on UnixWare. The UnixWare libc.so is an | |
219 | archive which includes an entry libc.so.1 which defines a bunch of | |
220 | symbols. The libc.so archive also includes a number of other | |
221 | object files, which also define symbols, some of which are the same | |
222 | as those defined in libc.so.1. Correct linking requires that we | |
223 | consider each object file in turn, and include it if it defines any | |
224 | symbols we need. _bfd_generic_link_add_archive_symbols does not do | |
225 | this; it looks through the list of undefined symbols, and includes | |
226 | any object file which defines them. When this algorithm is used on | |
227 | UnixWare, it winds up pulling in libc.so.1 early and defining a | |
228 | bunch of symbols. This means that some of the other objects in the | |
229 | archive are not included in the link, which is incorrect since they | |
230 | precede libc.so.1 in the archive. | |
231 | ||
232 | Fortunately, ELF archive handling is simpler than that done by | |
233 | _bfd_generic_link_add_archive_symbols, which has to allow for a.out | |
234 | oddities. In ELF, if we find a symbol in the archive map, and the | |
235 | symbol is currently undefined, we know that we must pull in that | |
236 | object file. | |
237 | ||
238 | Unfortunately, we do have to make multiple passes over the symbol | |
239 | table until nothing further is resolved. */ | |
240 | ||
241 | static boolean | |
242 | elf_link_add_archive_symbols (abfd, info) | |
243 | bfd *abfd; | |
244 | struct bfd_link_info *info; | |
245 | { | |
246 | symindex c; | |
247 | boolean *defined = NULL; | |
248 | boolean *included = NULL; | |
249 | carsym *symdefs; | |
250 | boolean loop; | |
251 | ||
252 | if (! bfd_has_map (abfd)) | |
253 | { | |
254 | /* An empty archive is a special case. */ | |
255 | if (bfd_openr_next_archived_file (abfd, (bfd *) NULL) == NULL) | |
256 | return true; | |
257 | bfd_set_error (bfd_error_no_armap); | |
258 | return false; | |
259 | } | |
260 | ||
261 | /* Keep track of all symbols we know to be already defined, and all | |
262 | files we know to be already included. This is to speed up the | |
263 | second and subsequent passes. */ | |
264 | c = bfd_ardata (abfd)->symdef_count; | |
265 | if (c == 0) | |
266 | return true; | |
267 | defined = (boolean *) bfd_malloc (c * sizeof (boolean)); | |
268 | included = (boolean *) bfd_malloc (c * sizeof (boolean)); | |
269 | if (defined == (boolean *) NULL || included == (boolean *) NULL) | |
270 | goto error_return; | |
271 | memset (defined, 0, c * sizeof (boolean)); | |
272 | memset (included, 0, c * sizeof (boolean)); | |
273 | ||
274 | symdefs = bfd_ardata (abfd)->symdefs; | |
275 | ||
276 | do | |
277 | { | |
278 | file_ptr last; | |
279 | symindex i; | |
280 | carsym *symdef; | |
281 | carsym *symdefend; | |
282 | ||
283 | loop = false; | |
284 | last = -1; | |
285 | ||
286 | symdef = symdefs; | |
287 | symdefend = symdef + c; | |
288 | for (i = 0; symdef < symdefend; symdef++, i++) | |
289 | { | |
290 | struct elf_link_hash_entry *h; | |
291 | bfd *element; | |
292 | struct bfd_link_hash_entry *undefs_tail; | |
293 | symindex mark; | |
294 | ||
295 | if (defined[i] || included[i]) | |
296 | continue; | |
297 | if (symdef->file_offset == last) | |
298 | { | |
299 | included[i] = true; | |
300 | continue; | |
301 | } | |
302 | ||
303 | h = elf_link_hash_lookup (elf_hash_table (info), symdef->name, | |
304 | false, false, false); | |
305 | ||
306 | if (h == NULL) | |
307 | { | |
308 | char *p, *copy; | |
309 | ||
310 | /* If this is a default version (the name contains @@), | |
311 | look up the symbol again without the version. The | |
312 | effect is that references to the symbol without the | |
313 | version will be matched by the default symbol in the | |
314 | archive. */ | |
315 | ||
316 | p = strchr (symdef->name, ELF_VER_CHR); | |
317 | if (p == NULL || p[1] != ELF_VER_CHR) | |
318 | continue; | |
319 | ||
320 | copy = bfd_alloc (abfd, p - symdef->name + 1); | |
321 | if (copy == NULL) | |
322 | goto error_return; | |
323 | memcpy (copy, symdef->name, p - symdef->name); | |
324 | copy[p - symdef->name] = '\0'; | |
325 | ||
326 | h = elf_link_hash_lookup (elf_hash_table (info), copy, | |
327 | false, false, false); | |
328 | ||
329 | bfd_release (abfd, copy); | |
330 | } | |
331 | ||
332 | if (h == NULL) | |
333 | continue; | |
334 | ||
a3a8c91d NC |
335 | if (h->root.type == bfd_link_hash_common) |
336 | { | |
337 | /* We currently have a common symbol. The archive map contains | |
338 | a reference to this symbol, so we may want to include it. We | |
339 | only want to include it however, if this archive element | |
340 | contains a definition of the symbol, not just another common | |
341 | declaration of it. | |
342 | ||
343 | Unfortunately some archivers (including GNU ar) will put | |
344 | declarations of common symbols into their archive maps, as | |
345 | well as real definitions, so we cannot just go by the archive | |
346 | map alone. Instead we must read in the element's symbol | |
347 | table and check that to see what kind of symbol definition | |
348 | this is. */ | |
349 | if (! elf_link_is_defined_archive_symbol (abfd, symdef)) | |
350 | continue; | |
351 | } | |
352 | else if (h->root.type != bfd_link_hash_undefined) | |
252b5132 RH |
353 | { |
354 | if (h->root.type != bfd_link_hash_undefweak) | |
355 | defined[i] = true; | |
356 | continue; | |
357 | } | |
358 | ||
359 | /* We need to include this archive member. */ | |
252b5132 RH |
360 | element = _bfd_get_elt_at_filepos (abfd, symdef->file_offset); |
361 | if (element == (bfd *) NULL) | |
362 | goto error_return; | |
363 | ||
364 | if (! bfd_check_format (element, bfd_object)) | |
365 | goto error_return; | |
366 | ||
367 | /* Doublecheck that we have not included this object | |
368 | already--it should be impossible, but there may be | |
369 | something wrong with the archive. */ | |
370 | if (element->archive_pass != 0) | |
371 | { | |
372 | bfd_set_error (bfd_error_bad_value); | |
373 | goto error_return; | |
374 | } | |
375 | element->archive_pass = 1; | |
376 | ||
377 | undefs_tail = info->hash->undefs_tail; | |
378 | ||
379 | if (! (*info->callbacks->add_archive_element) (info, element, | |
380 | symdef->name)) | |
381 | goto error_return; | |
382 | if (! elf_link_add_object_symbols (element, info)) | |
383 | goto error_return; | |
384 | ||
385 | /* If there are any new undefined symbols, we need to make | |
386 | another pass through the archive in order to see whether | |
387 | they can be defined. FIXME: This isn't perfect, because | |
388 | common symbols wind up on undefs_tail and because an | |
389 | undefined symbol which is defined later on in this pass | |
390 | does not require another pass. This isn't a bug, but it | |
391 | does make the code less efficient than it could be. */ | |
392 | if (undefs_tail != info->hash->undefs_tail) | |
393 | loop = true; | |
394 | ||
395 | /* Look backward to mark all symbols from this object file | |
396 | which we have already seen in this pass. */ | |
397 | mark = i; | |
398 | do | |
399 | { | |
400 | included[mark] = true; | |
401 | if (mark == 0) | |
402 | break; | |
403 | --mark; | |
404 | } | |
405 | while (symdefs[mark].file_offset == symdef->file_offset); | |
406 | ||
407 | /* We mark subsequent symbols from this object file as we go | |
408 | on through the loop. */ | |
409 | last = symdef->file_offset; | |
410 | } | |
411 | } | |
412 | while (loop); | |
413 | ||
414 | free (defined); | |
415 | free (included); | |
416 | ||
417 | return true; | |
418 | ||
419 | error_return: | |
420 | if (defined != (boolean *) NULL) | |
421 | free (defined); | |
422 | if (included != (boolean *) NULL) | |
423 | free (included); | |
424 | return false; | |
425 | } | |
426 | ||
427 | /* This function is called when we want to define a new symbol. It | |
428 | handles the various cases which arise when we find a definition in | |
429 | a dynamic object, or when there is already a definition in a | |
430 | dynamic object. The new symbol is described by NAME, SYM, PSEC, | |
431 | and PVALUE. We set SYM_HASH to the hash table entry. We set | |
432 | OVERRIDE if the old symbol is overriding a new definition. We set | |
433 | TYPE_CHANGE_OK if it is OK for the type to change. We set | |
434 | SIZE_CHANGE_OK if it is OK for the size to change. By OK to | |
435 | change, we mean that we shouldn't warn if the type or size does | |
456981d7 L |
436 | change. DT_NEEDED indicates if it comes from a DT_NEEDED entry of |
437 | a shared object. */ | |
252b5132 RH |
438 | |
439 | static boolean | |
440 | elf_merge_symbol (abfd, info, name, sym, psec, pvalue, sym_hash, | |
456981d7 | 441 | override, type_change_ok, size_change_ok, dt_needed) |
252b5132 RH |
442 | bfd *abfd; |
443 | struct bfd_link_info *info; | |
444 | const char *name; | |
445 | Elf_Internal_Sym *sym; | |
446 | asection **psec; | |
447 | bfd_vma *pvalue; | |
448 | struct elf_link_hash_entry **sym_hash; | |
449 | boolean *override; | |
450 | boolean *type_change_ok; | |
451 | boolean *size_change_ok; | |
456981d7 | 452 | boolean dt_needed; |
252b5132 RH |
453 | { |
454 | asection *sec; | |
455 | struct elf_link_hash_entry *h; | |
456 | int bind; | |
457 | bfd *oldbfd; | |
458 | boolean newdyn, olddyn, olddef, newdef, newdyncommon, olddyncommon; | |
459 | ||
460 | *override = false; | |
461 | ||
462 | sec = *psec; | |
463 | bind = ELF_ST_BIND (sym->st_info); | |
464 | ||
465 | if (! bfd_is_und_section (sec)) | |
466 | h = elf_link_hash_lookup (elf_hash_table (info), name, true, false, false); | |
467 | else | |
468 | h = ((struct elf_link_hash_entry *) | |
469 | bfd_wrapped_link_hash_lookup (abfd, info, name, true, false, false)); | |
470 | if (h == NULL) | |
471 | return false; | |
472 | *sym_hash = h; | |
473 | ||
474 | /* This code is for coping with dynamic objects, and is only useful | |
475 | if we are doing an ELF link. */ | |
476 | if (info->hash->creator != abfd->xvec) | |
477 | return true; | |
478 | ||
479 | /* For merging, we only care about real symbols. */ | |
480 | ||
481 | while (h->root.type == bfd_link_hash_indirect | |
482 | || h->root.type == bfd_link_hash_warning) | |
483 | h = (struct elf_link_hash_entry *) h->root.u.i.link; | |
484 | ||
485 | /* If we just created the symbol, mark it as being an ELF symbol. | |
486 | Other than that, there is nothing to do--there is no merge issue | |
487 | with a newly defined symbol--so we just return. */ | |
488 | ||
489 | if (h->root.type == bfd_link_hash_new) | |
490 | { | |
491 | h->elf_link_hash_flags &=~ ELF_LINK_NON_ELF; | |
492 | return true; | |
493 | } | |
494 | ||
495 | /* OLDBFD is a BFD associated with the existing symbol. */ | |
496 | ||
497 | switch (h->root.type) | |
498 | { | |
499 | default: | |
500 | oldbfd = NULL; | |
501 | break; | |
502 | ||
503 | case bfd_link_hash_undefined: | |
504 | case bfd_link_hash_undefweak: | |
505 | oldbfd = h->root.u.undef.abfd; | |
506 | break; | |
507 | ||
508 | case bfd_link_hash_defined: | |
509 | case bfd_link_hash_defweak: | |
510 | oldbfd = h->root.u.def.section->owner; | |
511 | break; | |
512 | ||
513 | case bfd_link_hash_common: | |
514 | oldbfd = h->root.u.c.p->section->owner; | |
515 | break; | |
516 | } | |
517 | ||
b4536acd ILT |
518 | /* In cases involving weak versioned symbols, we may wind up trying |
519 | to merge a symbol with itself. Catch that here, to avoid the | |
520 | confusion that results if we try to override a symbol with | |
accc7f69 ILT |
521 | itself. The additional tests catch cases like |
522 | _GLOBAL_OFFSET_TABLE_, which are regular symbols defined in a | |
523 | dynamic object, which we do want to handle here. */ | |
524 | if (abfd == oldbfd | |
525 | && ((abfd->flags & DYNAMIC) == 0 | |
526 | || (h->elf_link_hash_flags & ELF_LINK_HASH_DEF_REGULAR) == 0)) | |
b4536acd ILT |
527 | return true; |
528 | ||
252b5132 RH |
529 | /* NEWDYN and OLDDYN indicate whether the new or old symbol, |
530 | respectively, is from a dynamic object. */ | |
531 | ||
532 | if ((abfd->flags & DYNAMIC) != 0) | |
533 | newdyn = true; | |
534 | else | |
535 | newdyn = false; | |
536 | ||
0035bd7b ILT |
537 | if (oldbfd != NULL) |
538 | olddyn = (oldbfd->flags & DYNAMIC) != 0; | |
252b5132 | 539 | else |
0035bd7b ILT |
540 | { |
541 | asection *hsec; | |
542 | ||
543 | /* This code handles the special SHN_MIPS_{TEXT,DATA} section | |
544 | indices used by MIPS ELF. */ | |
545 | switch (h->root.type) | |
546 | { | |
547 | default: | |
548 | hsec = NULL; | |
549 | break; | |
550 | ||
551 | case bfd_link_hash_defined: | |
552 | case bfd_link_hash_defweak: | |
553 | hsec = h->root.u.def.section; | |
554 | break; | |
555 | ||
556 | case bfd_link_hash_common: | |
557 | hsec = h->root.u.c.p->section; | |
558 | break; | |
559 | } | |
560 | ||
561 | if (hsec == NULL) | |
562 | olddyn = false; | |
563 | else | |
564 | olddyn = (hsec->symbol->flags & BSF_DYNAMIC) != 0; | |
565 | } | |
252b5132 RH |
566 | |
567 | /* NEWDEF and OLDDEF indicate whether the new or old symbol, | |
568 | respectively, appear to be a definition rather than reference. */ | |
569 | ||
570 | if (bfd_is_und_section (sec) || bfd_is_com_section (sec)) | |
571 | newdef = false; | |
572 | else | |
573 | newdef = true; | |
574 | ||
575 | if (h->root.type == bfd_link_hash_undefined | |
576 | || h->root.type == bfd_link_hash_undefweak | |
577 | || h->root.type == bfd_link_hash_common) | |
578 | olddef = false; | |
579 | else | |
580 | olddef = true; | |
581 | ||
582 | /* NEWDYNCOMMON and OLDDYNCOMMON indicate whether the new or old | |
583 | symbol, respectively, appears to be a common symbol in a dynamic | |
584 | object. If a symbol appears in an uninitialized section, and is | |
585 | not weak, and is not a function, then it may be a common symbol | |
586 | which was resolved when the dynamic object was created. We want | |
587 | to treat such symbols specially, because they raise special | |
588 | considerations when setting the symbol size: if the symbol | |
589 | appears as a common symbol in a regular object, and the size in | |
590 | the regular object is larger, we must make sure that we use the | |
591 | larger size. This problematic case can always be avoided in C, | |
592 | but it must be handled correctly when using Fortran shared | |
593 | libraries. | |
594 | ||
595 | Note that if NEWDYNCOMMON is set, NEWDEF will be set, and | |
596 | likewise for OLDDYNCOMMON and OLDDEF. | |
597 | ||
598 | Note that this test is just a heuristic, and that it is quite | |
599 | possible to have an uninitialized symbol in a shared object which | |
600 | is really a definition, rather than a common symbol. This could | |
601 | lead to some minor confusion when the symbol really is a common | |
602 | symbol in some regular object. However, I think it will be | |
603 | harmless. */ | |
604 | ||
605 | if (newdyn | |
606 | && newdef | |
607 | && (sec->flags & SEC_ALLOC) != 0 | |
608 | && (sec->flags & SEC_LOAD) == 0 | |
609 | && sym->st_size > 0 | |
610 | && bind != STB_WEAK | |
611 | && ELF_ST_TYPE (sym->st_info) != STT_FUNC) | |
612 | newdyncommon = true; | |
613 | else | |
614 | newdyncommon = false; | |
615 | ||
616 | if (olddyn | |
617 | && olddef | |
618 | && h->root.type == bfd_link_hash_defined | |
619 | && (h->elf_link_hash_flags & ELF_LINK_HASH_DEF_DYNAMIC) != 0 | |
620 | && (h->root.u.def.section->flags & SEC_ALLOC) != 0 | |
621 | && (h->root.u.def.section->flags & SEC_LOAD) == 0 | |
622 | && h->size > 0 | |
623 | && h->type != STT_FUNC) | |
624 | olddyncommon = true; | |
625 | else | |
626 | olddyncommon = false; | |
627 | ||
628 | /* It's OK to change the type if either the existing symbol or the | |
456981d7 L |
629 | new symbol is weak unless it comes from a DT_NEEDED entry of |
630 | a shared object, in which case, the DT_NEEDED entry may not be | |
631 | required at the run time. */ | |
252b5132 | 632 | |
456981d7 | 633 | if ((! dt_needed && h->root.type == bfd_link_hash_defweak) |
252b5132 RH |
634 | || h->root.type == bfd_link_hash_undefweak |
635 | || bind == STB_WEAK) | |
636 | *type_change_ok = true; | |
637 | ||
638 | /* It's OK to change the size if either the existing symbol or the | |
639 | new symbol is weak, or if the old symbol is undefined. */ | |
640 | ||
641 | if (*type_change_ok | |
642 | || h->root.type == bfd_link_hash_undefined) | |
643 | *size_change_ok = true; | |
644 | ||
645 | /* If both the old and the new symbols look like common symbols in a | |
646 | dynamic object, set the size of the symbol to the larger of the | |
647 | two. */ | |
648 | ||
649 | if (olddyncommon | |
650 | && newdyncommon | |
651 | && sym->st_size != h->size) | |
652 | { | |
653 | /* Since we think we have two common symbols, issue a multiple | |
654 | common warning if desired. Note that we only warn if the | |
655 | size is different. If the size is the same, we simply let | |
656 | the old symbol override the new one as normally happens with | |
657 | symbols defined in dynamic objects. */ | |
658 | ||
659 | if (! ((*info->callbacks->multiple_common) | |
660 | (info, h->root.root.string, oldbfd, bfd_link_hash_common, | |
661 | h->size, abfd, bfd_link_hash_common, sym->st_size))) | |
662 | return false; | |
663 | ||
664 | if (sym->st_size > h->size) | |
665 | h->size = sym->st_size; | |
666 | ||
667 | *size_change_ok = true; | |
668 | } | |
669 | ||
670 | /* If we are looking at a dynamic object, and we have found a | |
671 | definition, we need to see if the symbol was already defined by | |
672 | some other object. If so, we want to use the existing | |
673 | definition, and we do not want to report a multiple symbol | |
674 | definition error; we do this by clobbering *PSEC to be | |
675 | bfd_und_section_ptr. | |
676 | ||
677 | We treat a common symbol as a definition if the symbol in the | |
678 | shared library is a function, since common symbols always | |
679 | represent variables; this can cause confusion in principle, but | |
680 | any such confusion would seem to indicate an erroneous program or | |
681 | shared library. We also permit a common symbol in a regular | |
0525d26e ILT |
682 | object to override a weak symbol in a shared object. |
683 | ||
684 | We prefer a non-weak definition in a shared library to a weak | |
456981d7 L |
685 | definition in the executable unless it comes from a DT_NEEDED |
686 | entry of a shared object, in which case, the DT_NEEDED entry | |
687 | may not be required at the run time. */ | |
252b5132 RH |
688 | |
689 | if (newdyn | |
690 | && newdef | |
691 | && (olddef | |
692 | || (h->root.type == bfd_link_hash_common | |
693 | && (bind == STB_WEAK | |
0525d26e | 694 | || ELF_ST_TYPE (sym->st_info) == STT_FUNC))) |
456981d7 L |
695 | && (h->root.type != bfd_link_hash_defweak |
696 | || dt_needed | |
0525d26e | 697 | || bind == STB_WEAK)) |
252b5132 RH |
698 | { |
699 | *override = true; | |
700 | newdef = false; | |
701 | newdyncommon = false; | |
702 | ||
703 | *psec = sec = bfd_und_section_ptr; | |
704 | *size_change_ok = true; | |
705 | ||
706 | /* If we get here when the old symbol is a common symbol, then | |
707 | we are explicitly letting it override a weak symbol or | |
708 | function in a dynamic object, and we don't want to warn about | |
709 | a type change. If the old symbol is a defined symbol, a type | |
710 | change warning may still be appropriate. */ | |
711 | ||
712 | if (h->root.type == bfd_link_hash_common) | |
713 | *type_change_ok = true; | |
714 | } | |
715 | ||
716 | /* Handle the special case of an old common symbol merging with a | |
717 | new symbol which looks like a common symbol in a shared object. | |
718 | We change *PSEC and *PVALUE to make the new symbol look like a | |
719 | common symbol, and let _bfd_generic_link_add_one_symbol will do | |
720 | the right thing. */ | |
721 | ||
722 | if (newdyncommon | |
723 | && h->root.type == bfd_link_hash_common) | |
724 | { | |
725 | *override = true; | |
726 | newdef = false; | |
727 | newdyncommon = false; | |
728 | *pvalue = sym->st_size; | |
729 | *psec = sec = bfd_com_section_ptr; | |
730 | *size_change_ok = true; | |
731 | } | |
732 | ||
733 | /* If the old symbol is from a dynamic object, and the new symbol is | |
734 | a definition which is not from a dynamic object, then the new | |
735 | symbol overrides the old symbol. Symbols from regular files | |
736 | always take precedence over symbols from dynamic objects, even if | |
737 | they are defined after the dynamic object in the link. | |
738 | ||
739 | As above, we again permit a common symbol in a regular object to | |
740 | override a definition in a shared object if the shared object | |
0525d26e ILT |
741 | symbol is a function or is weak. |
742 | ||
743 | As above, we permit a non-weak definition in a shared object to | |
744 | override a weak definition in a regular object. */ | |
252b5132 RH |
745 | |
746 | if (! newdyn | |
747 | && (newdef | |
748 | || (bfd_is_com_section (sec) | |
749 | && (h->root.type == bfd_link_hash_defweak | |
750 | || h->type == STT_FUNC))) | |
751 | && olddyn | |
752 | && olddef | |
0525d26e ILT |
753 | && (h->elf_link_hash_flags & ELF_LINK_HASH_DEF_DYNAMIC) != 0 |
754 | && (bind != STB_WEAK | |
755 | || h->root.type == bfd_link_hash_defweak)) | |
252b5132 RH |
756 | { |
757 | /* Change the hash table entry to undefined, and let | |
758 | _bfd_generic_link_add_one_symbol do the right thing with the | |
759 | new definition. */ | |
760 | ||
761 | h->root.type = bfd_link_hash_undefined; | |
762 | h->root.u.undef.abfd = h->root.u.def.section->owner; | |
763 | *size_change_ok = true; | |
764 | ||
765 | olddef = false; | |
766 | olddyncommon = false; | |
767 | ||
768 | /* We again permit a type change when a common symbol may be | |
769 | overriding a function. */ | |
770 | ||
771 | if (bfd_is_com_section (sec)) | |
772 | *type_change_ok = true; | |
773 | ||
774 | /* This union may have been set to be non-NULL when this symbol | |
775 | was seen in a dynamic object. We must force the union to be | |
776 | NULL, so that it is correct for a regular symbol. */ | |
777 | ||
778 | h->verinfo.vertree = NULL; | |
779 | ||
780 | /* In this special case, if H is the target of an indirection, | |
781 | we want the caller to frob with H rather than with the | |
782 | indirect symbol. That will permit the caller to redefine the | |
783 | target of the indirection, rather than the indirect symbol | |
784 | itself. FIXME: This will break the -y option if we store a | |
785 | symbol with a different name. */ | |
786 | *sym_hash = h; | |
787 | } | |
788 | ||
789 | /* Handle the special case of a new common symbol merging with an | |
790 | old symbol that looks like it might be a common symbol defined in | |
791 | a shared object. Note that we have already handled the case in | |
792 | which a new common symbol should simply override the definition | |
793 | in the shared library. */ | |
794 | ||
795 | if (! newdyn | |
796 | && bfd_is_com_section (sec) | |
797 | && olddyncommon) | |
798 | { | |
799 | /* It would be best if we could set the hash table entry to a | |
800 | common symbol, but we don't know what to use for the section | |
801 | or the alignment. */ | |
802 | if (! ((*info->callbacks->multiple_common) | |
803 | (info, h->root.root.string, oldbfd, bfd_link_hash_common, | |
804 | h->size, abfd, bfd_link_hash_common, sym->st_size))) | |
805 | return false; | |
806 | ||
807 | /* If the predumed common symbol in the dynamic object is | |
808 | larger, pretend that the new symbol has its size. */ | |
809 | ||
810 | if (h->size > *pvalue) | |
811 | *pvalue = h->size; | |
812 | ||
813 | /* FIXME: We no longer know the alignment required by the symbol | |
814 | in the dynamic object, so we just wind up using the one from | |
815 | the regular object. */ | |
816 | ||
817 | olddef = false; | |
818 | olddyncommon = false; | |
819 | ||
820 | h->root.type = bfd_link_hash_undefined; | |
821 | h->root.u.undef.abfd = h->root.u.def.section->owner; | |
822 | ||
823 | *size_change_ok = true; | |
824 | *type_change_ok = true; | |
825 | ||
826 | h->verinfo.vertree = NULL; | |
827 | } | |
828 | ||
0525d26e ILT |
829 | /* Handle the special case of a weak definition in a regular object |
830 | followed by a non-weak definition in a shared object. In this | |
456981d7 L |
831 | case, we prefer the definition in the shared object unless it |
832 | comes from a DT_NEEDED entry of a shared object, in which case, | |
833 | the DT_NEEDED entry may not be required at the run time. */ | |
0525d26e | 834 | if (olddef |
456981d7 | 835 | && ! dt_needed |
0525d26e ILT |
836 | && h->root.type == bfd_link_hash_defweak |
837 | && newdef | |
838 | && newdyn | |
839 | && bind != STB_WEAK) | |
b4536acd ILT |
840 | { |
841 | /* To make this work we have to frob the flags so that the rest | |
842 | of the code does not think we are using the regular | |
843 | definition. */ | |
64df8d0b ILT |
844 | if ((h->elf_link_hash_flags & ELF_LINK_HASH_DEF_REGULAR) != 0) |
845 | h->elf_link_hash_flags |= ELF_LINK_HASH_REF_REGULAR; | |
846 | else if ((h->elf_link_hash_flags & ELF_LINK_HASH_DEF_DYNAMIC) != 0) | |
847 | h->elf_link_hash_flags |= ELF_LINK_HASH_REF_DYNAMIC; | |
848 | h->elf_link_hash_flags &= ~ (ELF_LINK_HASH_DEF_REGULAR | |
849 | | ELF_LINK_HASH_DEF_DYNAMIC); | |
b4536acd ILT |
850 | |
851 | /* If H is the target of an indirection, we want the caller to | |
852 | use H rather than the indirect symbol. Otherwise if we are | |
853 | defining a new indirect symbol we will wind up attaching it | |
854 | to the entry we are overriding. */ | |
855 | *sym_hash = h; | |
856 | } | |
0525d26e ILT |
857 | |
858 | /* Handle the special case of a non-weak definition in a shared | |
859 | object followed by a weak definition in a regular object. In | |
860 | this case we prefer to definition in the shared object. To make | |
861 | this work we have to tell the caller to not treat the new symbol | |
862 | as a definition. */ | |
863 | if (olddef | |
864 | && olddyn | |
865 | && h->root.type != bfd_link_hash_defweak | |
866 | && newdef | |
867 | && ! newdyn | |
868 | && bind == STB_WEAK) | |
869 | *override = true; | |
870 | ||
252b5132 RH |
871 | return true; |
872 | } | |
873 | ||
874 | /* Add symbols from an ELF object file to the linker hash table. */ | |
875 | ||
876 | static boolean | |
877 | elf_link_add_object_symbols (abfd, info) | |
878 | bfd *abfd; | |
879 | struct bfd_link_info *info; | |
880 | { | |
881 | boolean (*add_symbol_hook) PARAMS ((bfd *, struct bfd_link_info *, | |
882 | const Elf_Internal_Sym *, | |
883 | const char **, flagword *, | |
884 | asection **, bfd_vma *)); | |
885 | boolean (*check_relocs) PARAMS ((bfd *, struct bfd_link_info *, | |
886 | asection *, const Elf_Internal_Rela *)); | |
887 | boolean collect; | |
888 | Elf_Internal_Shdr *hdr; | |
889 | size_t symcount; | |
890 | size_t extsymcount; | |
891 | size_t extsymoff; | |
892 | Elf_External_Sym *buf = NULL; | |
893 | struct elf_link_hash_entry **sym_hash; | |
894 | boolean dynamic; | |
895 | bfd_byte *dynver = NULL; | |
896 | Elf_External_Versym *extversym = NULL; | |
897 | Elf_External_Versym *ever; | |
898 | Elf_External_Dyn *dynbuf = NULL; | |
899 | struct elf_link_hash_entry *weaks; | |
900 | Elf_External_Sym *esym; | |
901 | Elf_External_Sym *esymend; | |
c61b8717 | 902 | struct elf_backend_data *bed; |
74816898 | 903 | boolean dt_needed; |
252b5132 | 904 | |
c61b8717 RH |
905 | bed = get_elf_backend_data (abfd); |
906 | add_symbol_hook = bed->elf_add_symbol_hook; | |
907 | collect = bed->collect; | |
252b5132 RH |
908 | |
909 | if ((abfd->flags & DYNAMIC) == 0) | |
910 | dynamic = false; | |
911 | else | |
912 | { | |
913 | dynamic = true; | |
914 | ||
915 | /* You can't use -r against a dynamic object. Also, there's no | |
916 | hope of using a dynamic object which does not exactly match | |
917 | the format of the output file. */ | |
918 | if (info->relocateable || info->hash->creator != abfd->xvec) | |
919 | { | |
920 | bfd_set_error (bfd_error_invalid_operation); | |
921 | goto error_return; | |
922 | } | |
923 | } | |
924 | ||
925 | /* As a GNU extension, any input sections which are named | |
926 | .gnu.warning.SYMBOL are treated as warning symbols for the given | |
927 | symbol. This differs from .gnu.warning sections, which generate | |
928 | warnings when they are included in an output file. */ | |
929 | if (! info->shared) | |
930 | { | |
931 | asection *s; | |
932 | ||
933 | for (s = abfd->sections; s != NULL; s = s->next) | |
934 | { | |
935 | const char *name; | |
936 | ||
937 | name = bfd_get_section_name (abfd, s); | |
938 | if (strncmp (name, ".gnu.warning.", sizeof ".gnu.warning." - 1) == 0) | |
939 | { | |
940 | char *msg; | |
941 | bfd_size_type sz; | |
942 | ||
943 | name += sizeof ".gnu.warning." - 1; | |
944 | ||
945 | /* If this is a shared object, then look up the symbol | |
946 | in the hash table. If it is there, and it is already | |
947 | been defined, then we will not be using the entry | |
948 | from this shared object, so we don't need to warn. | |
949 | FIXME: If we see the definition in a regular object | |
950 | later on, we will warn, but we shouldn't. The only | |
951 | fix is to keep track of what warnings we are supposed | |
952 | to emit, and then handle them all at the end of the | |
953 | link. */ | |
954 | if (dynamic && abfd->xvec == info->hash->creator) | |
955 | { | |
956 | struct elf_link_hash_entry *h; | |
957 | ||
958 | h = elf_link_hash_lookup (elf_hash_table (info), name, | |
959 | false, false, true); | |
960 | ||
961 | /* FIXME: What about bfd_link_hash_common? */ | |
962 | if (h != NULL | |
963 | && (h->root.type == bfd_link_hash_defined | |
964 | || h->root.type == bfd_link_hash_defweak)) | |
965 | { | |
966 | /* We don't want to issue this warning. Clobber | |
967 | the section size so that the warning does not | |
968 | get copied into the output file. */ | |
969 | s->_raw_size = 0; | |
970 | continue; | |
971 | } | |
972 | } | |
973 | ||
974 | sz = bfd_section_size (abfd, s); | |
975 | msg = (char *) bfd_alloc (abfd, sz + 1); | |
976 | if (msg == NULL) | |
977 | goto error_return; | |
978 | ||
979 | if (! bfd_get_section_contents (abfd, s, msg, (file_ptr) 0, sz)) | |
980 | goto error_return; | |
981 | ||
982 | msg[sz] = '\0'; | |
983 | ||
984 | if (! (_bfd_generic_link_add_one_symbol | |
985 | (info, abfd, name, BSF_WARNING, s, (bfd_vma) 0, msg, | |
986 | false, collect, (struct bfd_link_hash_entry **) NULL))) | |
987 | goto error_return; | |
988 | ||
989 | if (! info->relocateable) | |
990 | { | |
991 | /* Clobber the section size so that the warning does | |
992 | not get copied into the output file. */ | |
993 | s->_raw_size = 0; | |
994 | } | |
995 | } | |
996 | } | |
997 | } | |
998 | ||
999 | /* If this is a dynamic object, we always link against the .dynsym | |
1000 | symbol table, not the .symtab symbol table. The dynamic linker | |
1001 | will only see the .dynsym symbol table, so there is no reason to | |
1002 | look at .symtab for a dynamic object. */ | |
1003 | ||
1004 | if (! dynamic || elf_dynsymtab (abfd) == 0) | |
1005 | hdr = &elf_tdata (abfd)->symtab_hdr; | |
1006 | else | |
1007 | hdr = &elf_tdata (abfd)->dynsymtab_hdr; | |
1008 | ||
1009 | if (dynamic) | |
1010 | { | |
1011 | /* Read in any version definitions. */ | |
1012 | ||
1013 | if (! _bfd_elf_slurp_version_tables (abfd)) | |
1014 | goto error_return; | |
1015 | ||
1016 | /* Read in the symbol versions, but don't bother to convert them | |
1017 | to internal format. */ | |
1018 | if (elf_dynversym (abfd) != 0) | |
1019 | { | |
1020 | Elf_Internal_Shdr *versymhdr; | |
1021 | ||
1022 | versymhdr = &elf_tdata (abfd)->dynversym_hdr; | |
1023 | extversym = (Elf_External_Versym *) bfd_malloc (hdr->sh_size); | |
1024 | if (extversym == NULL) | |
1025 | goto error_return; | |
1026 | if (bfd_seek (abfd, versymhdr->sh_offset, SEEK_SET) != 0 | |
1027 | || (bfd_read ((PTR) extversym, 1, versymhdr->sh_size, abfd) | |
1028 | != versymhdr->sh_size)) | |
1029 | goto error_return; | |
1030 | } | |
1031 | } | |
1032 | ||
1033 | symcount = hdr->sh_size / sizeof (Elf_External_Sym); | |
1034 | ||
1035 | /* The sh_info field of the symtab header tells us where the | |
1036 | external symbols start. We don't care about the local symbols at | |
1037 | this point. */ | |
1038 | if (elf_bad_symtab (abfd)) | |
1039 | { | |
1040 | extsymcount = symcount; | |
1041 | extsymoff = 0; | |
1042 | } | |
1043 | else | |
1044 | { | |
1045 | extsymcount = symcount - hdr->sh_info; | |
1046 | extsymoff = hdr->sh_info; | |
1047 | } | |
1048 | ||
1049 | buf = ((Elf_External_Sym *) | |
1050 | bfd_malloc (extsymcount * sizeof (Elf_External_Sym))); | |
1051 | if (buf == NULL && extsymcount != 0) | |
1052 | goto error_return; | |
1053 | ||
1054 | /* We store a pointer to the hash table entry for each external | |
1055 | symbol. */ | |
1056 | sym_hash = ((struct elf_link_hash_entry **) | |
1057 | bfd_alloc (abfd, | |
1058 | extsymcount * sizeof (struct elf_link_hash_entry *))); | |
1059 | if (sym_hash == NULL) | |
1060 | goto error_return; | |
1061 | elf_sym_hashes (abfd) = sym_hash; | |
1062 | ||
74816898 L |
1063 | dt_needed = false; |
1064 | ||
252b5132 RH |
1065 | if (! dynamic) |
1066 | { | |
1067 | /* If we are creating a shared library, create all the dynamic | |
1068 | sections immediately. We need to attach them to something, | |
1069 | so we attach them to this BFD, provided it is the right | |
1070 | format. FIXME: If there are no input BFD's of the same | |
1071 | format as the output, we can't make a shared library. */ | |
1072 | if (info->shared | |
1073 | && ! elf_hash_table (info)->dynamic_sections_created | |
1074 | && abfd->xvec == info->hash->creator) | |
1075 | { | |
1076 | if (! elf_link_create_dynamic_sections (abfd, info)) | |
1077 | goto error_return; | |
1078 | } | |
1079 | } | |
1080 | else | |
1081 | { | |
1082 | asection *s; | |
1083 | boolean add_needed; | |
1084 | const char *name; | |
1085 | bfd_size_type oldsize; | |
1086 | bfd_size_type strindex; | |
1087 | ||
1088 | /* Find the name to use in a DT_NEEDED entry that refers to this | |
1089 | object. If the object has a DT_SONAME entry, we use it. | |
1090 | Otherwise, if the generic linker stuck something in | |
1091 | elf_dt_name, we use that. Otherwise, we just use the file | |
1092 | name. If the generic linker put a null string into | |
1093 | elf_dt_name, we don't make a DT_NEEDED entry at all, even if | |
1094 | there is a DT_SONAME entry. */ | |
1095 | add_needed = true; | |
1096 | name = bfd_get_filename (abfd); | |
1097 | if (elf_dt_name (abfd) != NULL) | |
1098 | { | |
1099 | name = elf_dt_name (abfd); | |
1100 | if (*name == '\0') | |
74816898 L |
1101 | { |
1102 | if (elf_dt_soname (abfd) != NULL) | |
1103 | dt_needed = true; | |
1104 | ||
1105 | add_needed = false; | |
1106 | } | |
252b5132 RH |
1107 | } |
1108 | s = bfd_get_section_by_name (abfd, ".dynamic"); | |
1109 | if (s != NULL) | |
1110 | { | |
1111 | Elf_External_Dyn *extdyn; | |
1112 | Elf_External_Dyn *extdynend; | |
1113 | int elfsec; | |
1114 | unsigned long link; | |
a963dc6a L |
1115 | int rpath; |
1116 | int runpath; | |
252b5132 RH |
1117 | |
1118 | dynbuf = (Elf_External_Dyn *) bfd_malloc ((size_t) s->_raw_size); | |
1119 | if (dynbuf == NULL) | |
1120 | goto error_return; | |
1121 | ||
1122 | if (! bfd_get_section_contents (abfd, s, (PTR) dynbuf, | |
1123 | (file_ptr) 0, s->_raw_size)) | |
1124 | goto error_return; | |
1125 | ||
1126 | elfsec = _bfd_elf_section_from_bfd_section (abfd, s); | |
1127 | if (elfsec == -1) | |
1128 | goto error_return; | |
1129 | link = elf_elfsections (abfd)[elfsec]->sh_link; | |
1130 | ||
20e29382 JL |
1131 | { |
1132 | /* The shared libraries distributed with hpux11 have a bogus | |
1133 | sh_link field for the ".dynamic" section. This code detects | |
1134 | when LINK refers to a section that is not a string table and | |
1135 | tries to find the string table for the ".dynsym" section | |
1136 | instead. */ | |
1137 | Elf_Internal_Shdr *hdr = elf_elfsections (abfd)[link]; | |
1138 | if (hdr->sh_type != SHT_STRTAB) | |
1139 | { | |
1140 | asection *s = bfd_get_section_by_name (abfd, ".dynsym"); | |
1141 | int elfsec = _bfd_elf_section_from_bfd_section (abfd, s); | |
1142 | if (elfsec == -1) | |
1143 | goto error_return; | |
1144 | link = elf_elfsections (abfd)[elfsec]->sh_link; | |
1145 | } | |
1146 | } | |
1147 | ||
252b5132 RH |
1148 | extdyn = dynbuf; |
1149 | extdynend = extdyn + s->_raw_size / sizeof (Elf_External_Dyn); | |
a963dc6a L |
1150 | rpath = 0; |
1151 | runpath = 0; | |
252b5132 RH |
1152 | for (; extdyn < extdynend; extdyn++) |
1153 | { | |
1154 | Elf_Internal_Dyn dyn; | |
1155 | ||
1156 | elf_swap_dyn_in (abfd, extdyn, &dyn); | |
1157 | if (dyn.d_tag == DT_SONAME) | |
1158 | { | |
1159 | name = bfd_elf_string_from_elf_section (abfd, link, | |
1160 | dyn.d_un.d_val); | |
1161 | if (name == NULL) | |
1162 | goto error_return; | |
1163 | } | |
1164 | if (dyn.d_tag == DT_NEEDED) | |
1165 | { | |
1166 | struct bfd_link_needed_list *n, **pn; | |
1167 | char *fnm, *anm; | |
1168 | ||
1169 | n = ((struct bfd_link_needed_list *) | |
1170 | bfd_alloc (abfd, sizeof (struct bfd_link_needed_list))); | |
1171 | fnm = bfd_elf_string_from_elf_section (abfd, link, | |
1172 | dyn.d_un.d_val); | |
1173 | if (n == NULL || fnm == NULL) | |
1174 | goto error_return; | |
1175 | anm = bfd_alloc (abfd, strlen (fnm) + 1); | |
1176 | if (anm == NULL) | |
1177 | goto error_return; | |
1178 | strcpy (anm, fnm); | |
1179 | n->name = anm; | |
1180 | n->by = abfd; | |
1181 | n->next = NULL; | |
1182 | for (pn = &elf_hash_table (info)->needed; | |
1183 | *pn != NULL; | |
1184 | pn = &(*pn)->next) | |
1185 | ; | |
1186 | *pn = n; | |
1187 | } | |
a963dc6a L |
1188 | if (dyn.d_tag == DT_RUNPATH) |
1189 | { | |
1190 | struct bfd_link_needed_list *n, **pn; | |
1191 | char *fnm, *anm; | |
1192 | ||
1193 | /* When we see DT_RPATH before DT_RUNPATH, we have | |
512a2384 AM |
1194 | to clear runpath. Do _NOT_ bfd_release, as that |
1195 | frees all more recently bfd_alloc'd blocks as | |
1196 | well. */ | |
a963dc6a | 1197 | if (rpath && elf_hash_table (info)->runpath) |
512a2384 | 1198 | elf_hash_table (info)->runpath = NULL; |
a963dc6a L |
1199 | |
1200 | n = ((struct bfd_link_needed_list *) | |
1201 | bfd_alloc (abfd, sizeof (struct bfd_link_needed_list))); | |
1202 | fnm = bfd_elf_string_from_elf_section (abfd, link, | |
1203 | dyn.d_un.d_val); | |
1204 | if (n == NULL || fnm == NULL) | |
1205 | goto error_return; | |
1206 | anm = bfd_alloc (abfd, strlen (fnm) + 1); | |
1207 | if (anm == NULL) | |
1208 | goto error_return; | |
1209 | strcpy (anm, fnm); | |
1210 | n->name = anm; | |
1211 | n->by = abfd; | |
1212 | n->next = NULL; | |
1213 | for (pn = &elf_hash_table (info)->runpath; | |
1214 | *pn != NULL; | |
1215 | pn = &(*pn)->next) | |
1216 | ; | |
1217 | *pn = n; | |
1218 | runpath = 1; | |
1219 | rpath = 0; | |
1220 | } | |
1221 | /* Ignore DT_RPATH if we have seen DT_RUNPATH. */ | |
1222 | if (!runpath && dyn.d_tag == DT_RPATH) | |
1223 | { | |
1224 | struct bfd_link_needed_list *n, **pn; | |
1225 | char *fnm, *anm; | |
1226 | ||
1227 | n = ((struct bfd_link_needed_list *) | |
1228 | bfd_alloc (abfd, sizeof (struct bfd_link_needed_list))); | |
1229 | fnm = bfd_elf_string_from_elf_section (abfd, link, | |
1230 | dyn.d_un.d_val); | |
1231 | if (n == NULL || fnm == NULL) | |
1232 | goto error_return; | |
1233 | anm = bfd_alloc (abfd, strlen (fnm) + 1); | |
1234 | if (anm == NULL) | |
1235 | goto error_return; | |
1236 | strcpy (anm, fnm); | |
1237 | n->name = anm; | |
1238 | n->by = abfd; | |
1239 | n->next = NULL; | |
1240 | for (pn = &elf_hash_table (info)->runpath; | |
1241 | *pn != NULL; | |
1242 | pn = &(*pn)->next) | |
1243 | ; | |
1244 | *pn = n; | |
1245 | rpath = 1; | |
1246 | } | |
252b5132 RH |
1247 | } |
1248 | ||
1249 | free (dynbuf); | |
1250 | dynbuf = NULL; | |
1251 | } | |
1252 | ||
1253 | /* We do not want to include any of the sections in a dynamic | |
1254 | object in the output file. We hack by simply clobbering the | |
1255 | list of sections in the BFD. This could be handled more | |
1256 | cleanly by, say, a new section flag; the existing | |
1257 | SEC_NEVER_LOAD flag is not the one we want, because that one | |
1258 | still implies that the section takes up space in the output | |
1259 | file. */ | |
1260 | abfd->sections = NULL; | |
1261 | abfd->section_count = 0; | |
1262 | ||
1263 | /* If this is the first dynamic object found in the link, create | |
1264 | the special sections required for dynamic linking. */ | |
1265 | if (! elf_hash_table (info)->dynamic_sections_created) | |
1266 | { | |
1267 | if (! elf_link_create_dynamic_sections (abfd, info)) | |
1268 | goto error_return; | |
1269 | } | |
1270 | ||
1271 | if (add_needed) | |
1272 | { | |
1273 | /* Add a DT_NEEDED entry for this dynamic object. */ | |
1274 | oldsize = _bfd_stringtab_size (elf_hash_table (info)->dynstr); | |
1275 | strindex = _bfd_stringtab_add (elf_hash_table (info)->dynstr, name, | |
1276 | true, false); | |
1277 | if (strindex == (bfd_size_type) -1) | |
1278 | goto error_return; | |
1279 | ||
1280 | if (oldsize == _bfd_stringtab_size (elf_hash_table (info)->dynstr)) | |
1281 | { | |
1282 | asection *sdyn; | |
1283 | Elf_External_Dyn *dyncon, *dynconend; | |
1284 | ||
1285 | /* The hash table size did not change, which means that | |
1286 | the dynamic object name was already entered. If we | |
1287 | have already included this dynamic object in the | |
1288 | link, just ignore it. There is no reason to include | |
1289 | a particular dynamic object more than once. */ | |
1290 | sdyn = bfd_get_section_by_name (elf_hash_table (info)->dynobj, | |
1291 | ".dynamic"); | |
1292 | BFD_ASSERT (sdyn != NULL); | |
1293 | ||
1294 | dyncon = (Elf_External_Dyn *) sdyn->contents; | |
1295 | dynconend = (Elf_External_Dyn *) (sdyn->contents + | |
1296 | sdyn->_raw_size); | |
1297 | for (; dyncon < dynconend; dyncon++) | |
1298 | { | |
1299 | Elf_Internal_Dyn dyn; | |
1300 | ||
1301 | elf_swap_dyn_in (elf_hash_table (info)->dynobj, dyncon, | |
1302 | &dyn); | |
1303 | if (dyn.d_tag == DT_NEEDED | |
1304 | && dyn.d_un.d_val == strindex) | |
1305 | { | |
1306 | if (buf != NULL) | |
1307 | free (buf); | |
1308 | if (extversym != NULL) | |
1309 | free (extversym); | |
1310 | return true; | |
1311 | } | |
1312 | } | |
1313 | } | |
1314 | ||
1315 | if (! elf_add_dynamic_entry (info, DT_NEEDED, strindex)) | |
1316 | goto error_return; | |
1317 | } | |
1318 | ||
1319 | /* Save the SONAME, if there is one, because sometimes the | |
1320 | linker emulation code will need to know it. */ | |
1321 | if (*name == '\0') | |
1322 | name = bfd_get_filename (abfd); | |
1323 | elf_dt_name (abfd) = name; | |
1324 | } | |
1325 | ||
1326 | if (bfd_seek (abfd, | |
1327 | hdr->sh_offset + extsymoff * sizeof (Elf_External_Sym), | |
1328 | SEEK_SET) != 0 | |
1329 | || (bfd_read ((PTR) buf, sizeof (Elf_External_Sym), extsymcount, abfd) | |
1330 | != extsymcount * sizeof (Elf_External_Sym))) | |
1331 | goto error_return; | |
1332 | ||
1333 | weaks = NULL; | |
1334 | ||
1335 | ever = extversym != NULL ? extversym + extsymoff : NULL; | |
1336 | esymend = buf + extsymcount; | |
1337 | for (esym = buf; | |
1338 | esym < esymend; | |
1339 | esym++, sym_hash++, ever = (ever != NULL ? ever + 1 : NULL)) | |
1340 | { | |
1341 | Elf_Internal_Sym sym; | |
1342 | int bind; | |
1343 | bfd_vma value; | |
1344 | asection *sec; | |
1345 | flagword flags; | |
1346 | const char *name; | |
1347 | struct elf_link_hash_entry *h; | |
1348 | boolean definition; | |
1349 | boolean size_change_ok, type_change_ok; | |
1350 | boolean new_weakdef; | |
1351 | unsigned int old_alignment; | |
1352 | ||
1353 | elf_swap_symbol_in (abfd, esym, &sym); | |
1354 | ||
1355 | flags = BSF_NO_FLAGS; | |
1356 | sec = NULL; | |
1357 | value = sym.st_value; | |
1358 | *sym_hash = NULL; | |
1359 | ||
1360 | bind = ELF_ST_BIND (sym.st_info); | |
1361 | if (bind == STB_LOCAL) | |
1362 | { | |
1363 | /* This should be impossible, since ELF requires that all | |
1364 | global symbols follow all local symbols, and that sh_info | |
1365 | point to the first global symbol. Unfortunatealy, Irix 5 | |
1366 | screws this up. */ | |
1367 | continue; | |
1368 | } | |
1369 | else if (bind == STB_GLOBAL) | |
1370 | { | |
1371 | if (sym.st_shndx != SHN_UNDEF | |
1372 | && sym.st_shndx != SHN_COMMON) | |
1373 | flags = BSF_GLOBAL; | |
252b5132 RH |
1374 | } |
1375 | else if (bind == STB_WEAK) | |
1376 | flags = BSF_WEAK; | |
1377 | else | |
1378 | { | |
1379 | /* Leave it up to the processor backend. */ | |
1380 | } | |
1381 | ||
1382 | if (sym.st_shndx == SHN_UNDEF) | |
1383 | sec = bfd_und_section_ptr; | |
1384 | else if (sym.st_shndx > 0 && sym.st_shndx < SHN_LORESERVE) | |
1385 | { | |
1386 | sec = section_from_elf_index (abfd, sym.st_shndx); | |
1387 | if (sec == NULL) | |
1388 | sec = bfd_abs_section_ptr; | |
1389 | else if ((abfd->flags & (EXEC_P | DYNAMIC)) != 0) | |
1390 | value -= sec->vma; | |
1391 | } | |
1392 | else if (sym.st_shndx == SHN_ABS) | |
1393 | sec = bfd_abs_section_ptr; | |
1394 | else if (sym.st_shndx == SHN_COMMON) | |
1395 | { | |
1396 | sec = bfd_com_section_ptr; | |
1397 | /* What ELF calls the size we call the value. What ELF | |
1398 | calls the value we call the alignment. */ | |
1399 | value = sym.st_size; | |
1400 | } | |
1401 | else | |
1402 | { | |
1403 | /* Leave it up to the processor backend. */ | |
1404 | } | |
1405 | ||
1406 | name = bfd_elf_string_from_elf_section (abfd, hdr->sh_link, sym.st_name); | |
1407 | if (name == (const char *) NULL) | |
1408 | goto error_return; | |
1409 | ||
1410 | if (add_symbol_hook) | |
1411 | { | |
1412 | if (! (*add_symbol_hook) (abfd, info, &sym, &name, &flags, &sec, | |
1413 | &value)) | |
1414 | goto error_return; | |
1415 | ||
1416 | /* The hook function sets the name to NULL if this symbol | |
1417 | should be skipped for some reason. */ | |
1418 | if (name == (const char *) NULL) | |
1419 | continue; | |
1420 | } | |
1421 | ||
1422 | /* Sanity check that all possibilities were handled. */ | |
1423 | if (sec == (asection *) NULL) | |
1424 | { | |
1425 | bfd_set_error (bfd_error_bad_value); | |
1426 | goto error_return; | |
1427 | } | |
1428 | ||
1429 | if (bfd_is_und_section (sec) | |
1430 | || bfd_is_com_section (sec)) | |
1431 | definition = false; | |
1432 | else | |
1433 | definition = true; | |
1434 | ||
1435 | size_change_ok = false; | |
1436 | type_change_ok = get_elf_backend_data (abfd)->type_change_ok; | |
1437 | old_alignment = 0; | |
1438 | if (info->hash->creator->flavour == bfd_target_elf_flavour) | |
1439 | { | |
1440 | Elf_Internal_Versym iver; | |
1441 | unsigned int vernum = 0; | |
1442 | boolean override; | |
1443 | ||
1444 | if (ever != NULL) | |
1445 | { | |
1446 | _bfd_elf_swap_versym_in (abfd, ever, &iver); | |
1447 | vernum = iver.vs_vers & VERSYM_VERSION; | |
1448 | ||
1449 | /* If this is a hidden symbol, or if it is not version | |
1450 | 1, we append the version name to the symbol name. | |
1451 | However, we do not modify a non-hidden absolute | |
1452 | symbol, because it might be the version symbol | |
1453 | itself. FIXME: What if it isn't? */ | |
1454 | if ((iver.vs_vers & VERSYM_HIDDEN) != 0 | |
1455 | || (vernum > 1 && ! bfd_is_abs_section (sec))) | |
1456 | { | |
1457 | const char *verstr; | |
1458 | int namelen, newlen; | |
1459 | char *newname, *p; | |
1460 | ||
1461 | if (sym.st_shndx != SHN_UNDEF) | |
1462 | { | |
1463 | if (vernum > elf_tdata (abfd)->dynverdef_hdr.sh_info) | |
1464 | { | |
1465 | (*_bfd_error_handler) | |
1466 | (_("%s: %s: invalid version %u (max %d)"), | |
1467 | bfd_get_filename (abfd), name, vernum, | |
1468 | elf_tdata (abfd)->dynverdef_hdr.sh_info); | |
1469 | bfd_set_error (bfd_error_bad_value); | |
1470 | goto error_return; | |
1471 | } | |
1472 | else if (vernum > 1) | |
1473 | verstr = | |
1474 | elf_tdata (abfd)->verdef[vernum - 1].vd_nodename; | |
1475 | else | |
1476 | verstr = ""; | |
1477 | } | |
1478 | else | |
1479 | { | |
1480 | /* We cannot simply test for the number of | |
1481 | entries in the VERNEED section since the | |
1482 | numbers for the needed versions do not start | |
1483 | at 0. */ | |
1484 | Elf_Internal_Verneed *t; | |
1485 | ||
1486 | verstr = NULL; | |
1487 | for (t = elf_tdata (abfd)->verref; | |
1488 | t != NULL; | |
1489 | t = t->vn_nextref) | |
1490 | { | |
1491 | Elf_Internal_Vernaux *a; | |
1492 | ||
1493 | for (a = t->vn_auxptr; a != NULL; a = a->vna_nextptr) | |
1494 | { | |
1495 | if (a->vna_other == vernum) | |
1496 | { | |
1497 | verstr = a->vna_nodename; | |
1498 | break; | |
1499 | } | |
1500 | } | |
1501 | if (a != NULL) | |
1502 | break; | |
1503 | } | |
1504 | if (verstr == NULL) | |
1505 | { | |
1506 | (*_bfd_error_handler) | |
1507 | (_("%s: %s: invalid needed version %d"), | |
1508 | bfd_get_filename (abfd), name, vernum); | |
1509 | bfd_set_error (bfd_error_bad_value); | |
1510 | goto error_return; | |
1511 | } | |
1512 | } | |
1513 | ||
1514 | namelen = strlen (name); | |
1515 | newlen = namelen + strlen (verstr) + 2; | |
1516 | if ((iver.vs_vers & VERSYM_HIDDEN) == 0) | |
1517 | ++newlen; | |
1518 | ||
1519 | newname = (char *) bfd_alloc (abfd, newlen); | |
1520 | if (newname == NULL) | |
1521 | goto error_return; | |
1522 | strcpy (newname, name); | |
1523 | p = newname + namelen; | |
1524 | *p++ = ELF_VER_CHR; | |
1287d1cc ILT |
1525 | /* If this is a defined non-hidden version symbol, |
1526 | we add another @ to the name. This indicates the | |
1527 | default version of the symbol. */ | |
1528 | if ((iver.vs_vers & VERSYM_HIDDEN) == 0 | |
1529 | && sym.st_shndx != SHN_UNDEF) | |
252b5132 RH |
1530 | *p++ = ELF_VER_CHR; |
1531 | strcpy (p, verstr); | |
1532 | ||
1533 | name = newname; | |
1534 | } | |
1535 | } | |
1536 | ||
1537 | if (! elf_merge_symbol (abfd, info, name, &sym, &sec, &value, | |
1538 | sym_hash, &override, &type_change_ok, | |
456981d7 | 1539 | &size_change_ok, dt_needed)) |
252b5132 RH |
1540 | goto error_return; |
1541 | ||
1542 | if (override) | |
1543 | definition = false; | |
1544 | ||
1545 | h = *sym_hash; | |
1546 | while (h->root.type == bfd_link_hash_indirect | |
1547 | || h->root.type == bfd_link_hash_warning) | |
1548 | h = (struct elf_link_hash_entry *) h->root.u.i.link; | |
1549 | ||
1550 | /* Remember the old alignment if this is a common symbol, so | |
1551 | that we don't reduce the alignment later on. We can't | |
1552 | check later, because _bfd_generic_link_add_one_symbol | |
1553 | will set a default for the alignment which we want to | |
1554 | override. */ | |
1555 | if (h->root.type == bfd_link_hash_common) | |
1556 | old_alignment = h->root.u.c.p->alignment_power; | |
1557 | ||
1558 | if (elf_tdata (abfd)->verdef != NULL | |
1559 | && ! override | |
1560 | && vernum > 1 | |
1561 | && definition) | |
1562 | h->verinfo.verdef = &elf_tdata (abfd)->verdef[vernum - 1]; | |
1563 | } | |
1564 | ||
1565 | if (! (_bfd_generic_link_add_one_symbol | |
1566 | (info, abfd, name, flags, sec, value, (const char *) NULL, | |
1567 | false, collect, (struct bfd_link_hash_entry **) sym_hash))) | |
1568 | goto error_return; | |
1569 | ||
1570 | h = *sym_hash; | |
1571 | while (h->root.type == bfd_link_hash_indirect | |
1572 | || h->root.type == bfd_link_hash_warning) | |
1573 | h = (struct elf_link_hash_entry *) h->root.u.i.link; | |
1574 | *sym_hash = h; | |
1575 | ||
1576 | new_weakdef = false; | |
1577 | if (dynamic | |
1578 | && definition | |
1579 | && (flags & BSF_WEAK) != 0 | |
1580 | && ELF_ST_TYPE (sym.st_info) != STT_FUNC | |
1581 | && info->hash->creator->flavour == bfd_target_elf_flavour | |
1582 | && h->weakdef == NULL) | |
1583 | { | |
1584 | /* Keep a list of all weak defined non function symbols from | |
1585 | a dynamic object, using the weakdef field. Later in this | |
1586 | function we will set the weakdef field to the correct | |
1587 | value. We only put non-function symbols from dynamic | |
1588 | objects on this list, because that happens to be the only | |
1589 | time we need to know the normal symbol corresponding to a | |
1590 | weak symbol, and the information is time consuming to | |
1591 | figure out. If the weakdef field is not already NULL, | |
1592 | then this symbol was already defined by some previous | |
1593 | dynamic object, and we will be using that previous | |
1594 | definition anyhow. */ | |
1595 | ||
1596 | h->weakdef = weaks; | |
1597 | weaks = h; | |
1598 | new_weakdef = true; | |
1599 | } | |
1600 | ||
1601 | /* Set the alignment of a common symbol. */ | |
1602 | if (sym.st_shndx == SHN_COMMON | |
1603 | && h->root.type == bfd_link_hash_common) | |
1604 | { | |
1605 | unsigned int align; | |
1606 | ||
1607 | align = bfd_log2 (sym.st_value); | |
724982f6 NC |
1608 | if (align > old_alignment |
1609 | /* Permit an alignment power of zero if an alignment of one | |
1610 | is specified and no other alignments have been specified. */ | |
1611 | || (sym.st_value == 1 && old_alignment == 0)) | |
252b5132 RH |
1612 | h->root.u.c.p->alignment_power = align; |
1613 | } | |
1614 | ||
1615 | if (info->hash->creator->flavour == bfd_target_elf_flavour) | |
1616 | { | |
1617 | int old_flags; | |
1618 | boolean dynsym; | |
1619 | int new_flag; | |
1620 | ||
1621 | /* Remember the symbol size and type. */ | |
1622 | if (sym.st_size != 0 | |
1623 | && (definition || h->size == 0)) | |
1624 | { | |
1625 | if (h->size != 0 && h->size != sym.st_size && ! size_change_ok) | |
1626 | (*_bfd_error_handler) | |
1627 | (_("Warning: size of symbol `%s' changed from %lu to %lu in %s"), | |
1628 | name, (unsigned long) h->size, (unsigned long) sym.st_size, | |
1629 | bfd_get_filename (abfd)); | |
1630 | ||
1631 | h->size = sym.st_size; | |
1632 | } | |
1633 | ||
1634 | /* If this is a common symbol, then we always want H->SIZE | |
1635 | to be the size of the common symbol. The code just above | |
1636 | won't fix the size if a common symbol becomes larger. We | |
1637 | don't warn about a size change here, because that is | |
1638 | covered by --warn-common. */ | |
1639 | if (h->root.type == bfd_link_hash_common) | |
1640 | h->size = h->root.u.c.size; | |
1641 | ||
1642 | if (ELF_ST_TYPE (sym.st_info) != STT_NOTYPE | |
1643 | && (definition || h->type == STT_NOTYPE)) | |
1644 | { | |
1645 | if (h->type != STT_NOTYPE | |
1646 | && h->type != ELF_ST_TYPE (sym.st_info) | |
1647 | && ! type_change_ok) | |
1648 | (*_bfd_error_handler) | |
1649 | (_("Warning: type of symbol `%s' changed from %d to %d in %s"), | |
1650 | name, h->type, ELF_ST_TYPE (sym.st_info), | |
1651 | bfd_get_filename (abfd)); | |
1652 | ||
1653 | h->type = ELF_ST_TYPE (sym.st_info); | |
1654 | } | |
1655 | ||
7a13edea NC |
1656 | /* If st_other has a processor-specific meaning, specific code |
1657 | might be needed here. */ | |
1658 | if (sym.st_other != 0) | |
1659 | { | |
1660 | /* Combine visibilities, using the most constraining one. */ | |
1661 | unsigned char hvis = ELF_ST_VISIBILITY (h->other); | |
1662 | unsigned char symvis = ELF_ST_VISIBILITY (sym.st_other); | |
1663 | ||
1664 | if (symvis && (hvis > symvis || hvis == 0)) | |
38048eb9 | 1665 | h->other = sym.st_other; |
7a13edea NC |
1666 | |
1667 | /* If neither has visibility, use the st_other of the | |
1668 | definition. This is an arbitrary choice, since the | |
1669 | other bits have no general meaning. */ | |
1670 | if (!symvis && !hvis | |
1671 | && (definition || h->other == 0)) | |
1672 | h->other = sym.st_other; | |
1673 | } | |
252b5132 RH |
1674 | |
1675 | /* Set a flag in the hash table entry indicating the type of | |
1676 | reference or definition we just found. Keep a count of | |
1677 | the number of dynamic symbols we find. A dynamic symbol | |
1678 | is one which is referenced or defined by both a regular | |
1679 | object and a shared object. */ | |
1680 | old_flags = h->elf_link_hash_flags; | |
1681 | dynsym = false; | |
1682 | if (! dynamic) | |
1683 | { | |
1684 | if (! definition) | |
1685 | { | |
1686 | new_flag = ELF_LINK_HASH_REF_REGULAR; | |
1687 | if (bind != STB_WEAK) | |
1688 | new_flag |= ELF_LINK_HASH_REF_REGULAR_NONWEAK; | |
1689 | } | |
1690 | else | |
1691 | new_flag = ELF_LINK_HASH_DEF_REGULAR; | |
1692 | if (info->shared | |
1693 | || (old_flags & (ELF_LINK_HASH_DEF_DYNAMIC | |
1694 | | ELF_LINK_HASH_REF_DYNAMIC)) != 0) | |
1695 | dynsym = true; | |
1696 | } | |
1697 | else | |
1698 | { | |
1699 | if (! definition) | |
1700 | new_flag = ELF_LINK_HASH_REF_DYNAMIC; | |
1701 | else | |
1702 | new_flag = ELF_LINK_HASH_DEF_DYNAMIC; | |
1703 | if ((old_flags & (ELF_LINK_HASH_DEF_REGULAR | |
1704 | | ELF_LINK_HASH_REF_REGULAR)) != 0 | |
1705 | || (h->weakdef != NULL | |
1706 | && ! new_weakdef | |
1707 | && h->weakdef->dynindx != -1)) | |
1708 | dynsym = true; | |
1709 | } | |
1710 | ||
1711 | h->elf_link_hash_flags |= new_flag; | |
1712 | ||
1713 | /* If this symbol has a version, and it is the default | |
1714 | version, we create an indirect symbol from the default | |
1715 | name to the fully decorated name. This will cause | |
1716 | external references which do not specify a version to be | |
1717 | bound to this version of the symbol. */ | |
051b8577 | 1718 | if (definition || h->root.type == bfd_link_hash_common) |
252b5132 RH |
1719 | { |
1720 | char *p; | |
1721 | ||
1722 | p = strchr (name, ELF_VER_CHR); | |
1723 | if (p != NULL && p[1] == ELF_VER_CHR) | |
1724 | { | |
1725 | char *shortname; | |
1726 | struct elf_link_hash_entry *hi; | |
1727 | boolean override; | |
1728 | ||
1729 | shortname = bfd_hash_allocate (&info->hash->table, | |
1730 | p - name + 1); | |
1731 | if (shortname == NULL) | |
1732 | goto error_return; | |
1733 | strncpy (shortname, name, p - name); | |
1734 | shortname[p - name] = '\0'; | |
1735 | ||
1736 | /* We are going to create a new symbol. Merge it | |
1737 | with any existing symbol with this name. For the | |
1738 | purposes of the merge, act as though we were | |
1739 | defining the symbol we just defined, although we | |
1740 | actually going to define an indirect symbol. */ | |
1741 | type_change_ok = false; | |
1742 | size_change_ok = false; | |
1743 | if (! elf_merge_symbol (abfd, info, shortname, &sym, &sec, | |
1744 | &value, &hi, &override, | |
456981d7 L |
1745 | &type_change_ok, |
1746 | &size_change_ok, dt_needed)) | |
252b5132 RH |
1747 | goto error_return; |
1748 | ||
1749 | if (! override) | |
1750 | { | |
1751 | if (! (_bfd_generic_link_add_one_symbol | |
1752 | (info, abfd, shortname, BSF_INDIRECT, | |
1753 | bfd_ind_section_ptr, (bfd_vma) 0, name, false, | |
1754 | collect, (struct bfd_link_hash_entry **) &hi))) | |
1755 | goto error_return; | |
1756 | } | |
1757 | else | |
1758 | { | |
1759 | /* In this case the symbol named SHORTNAME is | |
1760 | overriding the indirect symbol we want to | |
1761 | add. We were planning on making SHORTNAME an | |
1762 | indirect symbol referring to NAME. SHORTNAME | |
1763 | is the name without a version. NAME is the | |
1764 | fully versioned name, and it is the default | |
1765 | version. | |
1766 | ||
1767 | Overriding means that we already saw a | |
1768 | definition for the symbol SHORTNAME in a | |
1769 | regular object, and it is overriding the | |
1770 | symbol defined in the dynamic object. | |
1771 | ||
1772 | When this happens, we actually want to change | |
1773 | NAME, the symbol we just added, to refer to | |
1774 | SHORTNAME. This will cause references to | |
1775 | NAME in the shared object to become | |
1776 | references to SHORTNAME in the regular | |
1777 | object. This is what we expect when we | |
1778 | override a function in a shared object: that | |
1779 | the references in the shared object will be | |
1780 | mapped to the definition in the regular | |
1781 | object. */ | |
1782 | ||
1783 | while (hi->root.type == bfd_link_hash_indirect | |
1784 | || hi->root.type == bfd_link_hash_warning) | |
1785 | hi = (struct elf_link_hash_entry *) hi->root.u.i.link; | |
1786 | ||
1787 | h->root.type = bfd_link_hash_indirect; | |
1788 | h->root.u.i.link = (struct bfd_link_hash_entry *) hi; | |
1789 | if (h->elf_link_hash_flags & ELF_LINK_HASH_DEF_DYNAMIC) | |
1790 | { | |
1791 | h->elf_link_hash_flags &=~ ELF_LINK_HASH_DEF_DYNAMIC; | |
1792 | hi->elf_link_hash_flags |= ELF_LINK_HASH_REF_DYNAMIC; | |
1793 | if (hi->elf_link_hash_flags | |
1794 | & (ELF_LINK_HASH_REF_REGULAR | |
1795 | | ELF_LINK_HASH_DEF_REGULAR)) | |
1796 | { | |
1797 | if (! _bfd_elf_link_record_dynamic_symbol (info, | |
1798 | hi)) | |
1799 | goto error_return; | |
1800 | } | |
1801 | } | |
1802 | ||
1803 | /* Now set HI to H, so that the following code | |
1804 | will set the other fields correctly. */ | |
1805 | hi = h; | |
1806 | } | |
1807 | ||
1808 | /* If there is a duplicate definition somewhere, | |
1809 | then HI may not point to an indirect symbol. We | |
1810 | will have reported an error to the user in that | |
1811 | case. */ | |
1812 | ||
1813 | if (hi->root.type == bfd_link_hash_indirect) | |
1814 | { | |
1815 | struct elf_link_hash_entry *ht; | |
1816 | ||
1817 | /* If the symbol became indirect, then we assume | |
1818 | that we have not seen a definition before. */ | |
1819 | BFD_ASSERT ((hi->elf_link_hash_flags | |
1820 | & (ELF_LINK_HASH_DEF_DYNAMIC | |
1821 | | ELF_LINK_HASH_DEF_REGULAR)) | |
1822 | == 0); | |
1823 | ||
1824 | ht = (struct elf_link_hash_entry *) hi->root.u.i.link; | |
c61b8717 | 1825 | (*bed->elf_backend_copy_indirect_symbol) (ht, hi); |
252b5132 RH |
1826 | |
1827 | /* See if the new flags lead us to realize that | |
1828 | the symbol must be dynamic. */ | |
1829 | if (! dynsym) | |
1830 | { | |
1831 | if (! dynamic) | |
1832 | { | |
1833 | if (info->shared | |
1834 | || ((hi->elf_link_hash_flags | |
1835 | & ELF_LINK_HASH_REF_DYNAMIC) | |
1836 | != 0)) | |
1837 | dynsym = true; | |
1838 | } | |
1839 | else | |
1840 | { | |
1841 | if ((hi->elf_link_hash_flags | |
1842 | & ELF_LINK_HASH_REF_REGULAR) != 0) | |
1843 | dynsym = true; | |
1844 | } | |
1845 | } | |
1846 | } | |
1847 | ||
1848 | /* We also need to define an indirection from the | |
1849 | nondefault version of the symbol. */ | |
1850 | ||
1851 | shortname = bfd_hash_allocate (&info->hash->table, | |
1852 | strlen (name)); | |
1853 | if (shortname == NULL) | |
1854 | goto error_return; | |
1855 | strncpy (shortname, name, p - name); | |
1856 | strcpy (shortname + (p - name), p + 1); | |
1857 | ||
1858 | /* Once again, merge with any existing symbol. */ | |
1859 | type_change_ok = false; | |
1860 | size_change_ok = false; | |
1861 | if (! elf_merge_symbol (abfd, info, shortname, &sym, &sec, | |
1862 | &value, &hi, &override, | |
456981d7 L |
1863 | &type_change_ok, |
1864 | &size_change_ok, dt_needed)) | |
252b5132 RH |
1865 | goto error_return; |
1866 | ||
1867 | if (override) | |
1868 | { | |
1869 | /* Here SHORTNAME is a versioned name, so we | |
1870 | don't expect to see the type of override we | |
1871 | do in the case above. */ | |
1872 | (*_bfd_error_handler) | |
1873 | (_("%s: warning: unexpected redefinition of `%s'"), | |
1874 | bfd_get_filename (abfd), shortname); | |
1875 | } | |
1876 | else | |
1877 | { | |
1878 | if (! (_bfd_generic_link_add_one_symbol | |
1879 | (info, abfd, shortname, BSF_INDIRECT, | |
1880 | bfd_ind_section_ptr, (bfd_vma) 0, name, false, | |
1881 | collect, (struct bfd_link_hash_entry **) &hi))) | |
1882 | goto error_return; | |
1883 | ||
1884 | /* If there is a duplicate definition somewhere, | |
1885 | then HI may not point to an indirect symbol. | |
1886 | We will have reported an error to the user in | |
1887 | that case. */ | |
1888 | ||
1889 | if (hi->root.type == bfd_link_hash_indirect) | |
1890 | { | |
1891 | /* If the symbol became indirect, then we | |
1892 | assume that we have not seen a definition | |
1893 | before. */ | |
1894 | BFD_ASSERT ((hi->elf_link_hash_flags | |
1895 | & (ELF_LINK_HASH_DEF_DYNAMIC | |
1896 | | ELF_LINK_HASH_DEF_REGULAR)) | |
1897 | == 0); | |
1898 | ||
c61b8717 | 1899 | (*bed->elf_backend_copy_indirect_symbol) (h, hi); |
252b5132 RH |
1900 | |
1901 | /* See if the new flags lead us to realize | |
1902 | that the symbol must be dynamic. */ | |
1903 | if (! dynsym) | |
1904 | { | |
1905 | if (! dynamic) | |
1906 | { | |
1907 | if (info->shared | |
1908 | || ((hi->elf_link_hash_flags | |
1909 | & ELF_LINK_HASH_REF_DYNAMIC) | |
1910 | != 0)) | |
1911 | dynsym = true; | |
1912 | } | |
1913 | else | |
1914 | { | |
1915 | if ((hi->elf_link_hash_flags | |
1916 | & ELF_LINK_HASH_REF_REGULAR) != 0) | |
1917 | dynsym = true; | |
1918 | } | |
1919 | } | |
1920 | } | |
1921 | } | |
1922 | } | |
1923 | } | |
1924 | ||
1925 | if (dynsym && h->dynindx == -1) | |
1926 | { | |
1927 | if (! _bfd_elf_link_record_dynamic_symbol (info, h)) | |
1928 | goto error_return; | |
1929 | if (h->weakdef != NULL | |
1930 | && ! new_weakdef | |
1931 | && h->weakdef->dynindx == -1) | |
1932 | { | |
1933 | if (! _bfd_elf_link_record_dynamic_symbol (info, | |
1934 | h->weakdef)) | |
1935 | goto error_return; | |
1936 | } | |
1937 | } | |
38048eb9 | 1938 | else if (dynsym && h->dynindx != -1) |
0444bdd4 L |
1939 | /* If the symbol already has a dynamic index, but |
1940 | visibility says it should not be visible, turn it into | |
1941 | a local symbol. */ | |
1942 | switch (ELF_ST_VISIBILITY (h->other)) | |
1943 | { | |
1944 | case STV_INTERNAL: | |
1945 | case STV_HIDDEN: | |
1946 | h->elf_link_hash_flags |= ELF_LINK_FORCED_LOCAL; | |
f41cbf03 | 1947 | (*bed->elf_backend_hide_symbol) (info, h); |
0444bdd4 L |
1948 | break; |
1949 | } | |
74816898 L |
1950 | |
1951 | if (dt_needed && definition | |
1952 | && (h->elf_link_hash_flags | |
1953 | & ELF_LINK_HASH_REF_REGULAR) != 0) | |
1954 | { | |
1955 | bfd_size_type oldsize; | |
1956 | bfd_size_type strindex; | |
1957 | ||
1958 | /* The symbol from a DT_NEEDED object is referenced from | |
1959 | the regular object to create a dynamic executable. We | |
1960 | have to make sure there is a DT_NEEDED entry for it. */ | |
1961 | ||
1962 | dt_needed = false; | |
1963 | oldsize = _bfd_stringtab_size (elf_hash_table (info)->dynstr); | |
1964 | strindex = _bfd_stringtab_add (elf_hash_table (info)->dynstr, | |
1965 | elf_dt_soname (abfd), | |
1966 | true, false); | |
1967 | if (strindex == (bfd_size_type) -1) | |
1968 | goto error_return; | |
1969 | ||
1970 | if (oldsize | |
1971 | == _bfd_stringtab_size (elf_hash_table (info)->dynstr)) | |
1972 | { | |
1973 | asection *sdyn; | |
1974 | Elf_External_Dyn *dyncon, *dynconend; | |
1975 | ||
1976 | sdyn = bfd_get_section_by_name (elf_hash_table (info)->dynobj, | |
1977 | ".dynamic"); | |
1978 | BFD_ASSERT (sdyn != NULL); | |
1979 | ||
1980 | dyncon = (Elf_External_Dyn *) sdyn->contents; | |
1981 | dynconend = (Elf_External_Dyn *) (sdyn->contents + | |
1982 | sdyn->_raw_size); | |
1983 | for (; dyncon < dynconend; dyncon++) | |
1984 | { | |
1985 | Elf_Internal_Dyn dyn; | |
1986 | ||
1987 | elf_swap_dyn_in (elf_hash_table (info)->dynobj, | |
1988 | dyncon, &dyn); | |
1989 | BFD_ASSERT (dyn.d_tag != DT_NEEDED || | |
1990 | dyn.d_un.d_val != strindex); | |
1991 | } | |
1992 | } | |
1993 | ||
1994 | if (! elf_add_dynamic_entry (info, DT_NEEDED, strindex)) | |
1995 | goto error_return; | |
1996 | } | |
252b5132 RH |
1997 | } |
1998 | } | |
1999 | ||
2000 | /* Now set the weakdefs field correctly for all the weak defined | |
2001 | symbols we found. The only way to do this is to search all the | |
2002 | symbols. Since we only need the information for non functions in | |
2003 | dynamic objects, that's the only time we actually put anything on | |
2004 | the list WEAKS. We need this information so that if a regular | |
2005 | object refers to a symbol defined weakly in a dynamic object, the | |
2006 | real symbol in the dynamic object is also put in the dynamic | |
2007 | symbols; we also must arrange for both symbols to point to the | |
2008 | same memory location. We could handle the general case of symbol | |
2009 | aliasing, but a general symbol alias can only be generated in | |
2010 | assembler code, handling it correctly would be very time | |
2011 | consuming, and other ELF linkers don't handle general aliasing | |
2012 | either. */ | |
2013 | while (weaks != NULL) | |
2014 | { | |
2015 | struct elf_link_hash_entry *hlook; | |
2016 | asection *slook; | |
2017 | bfd_vma vlook; | |
2018 | struct elf_link_hash_entry **hpp; | |
2019 | struct elf_link_hash_entry **hppend; | |
2020 | ||
2021 | hlook = weaks; | |
2022 | weaks = hlook->weakdef; | |
2023 | hlook->weakdef = NULL; | |
2024 | ||
2025 | BFD_ASSERT (hlook->root.type == bfd_link_hash_defined | |
2026 | || hlook->root.type == bfd_link_hash_defweak | |
2027 | || hlook->root.type == bfd_link_hash_common | |
2028 | || hlook->root.type == bfd_link_hash_indirect); | |
2029 | slook = hlook->root.u.def.section; | |
2030 | vlook = hlook->root.u.def.value; | |
2031 | ||
2032 | hpp = elf_sym_hashes (abfd); | |
2033 | hppend = hpp + extsymcount; | |
2034 | for (; hpp < hppend; hpp++) | |
2035 | { | |
2036 | struct elf_link_hash_entry *h; | |
2037 | ||
2038 | h = *hpp; | |
2039 | if (h != NULL && h != hlook | |
2040 | && h->root.type == bfd_link_hash_defined | |
2041 | && h->root.u.def.section == slook | |
2042 | && h->root.u.def.value == vlook) | |
2043 | { | |
2044 | hlook->weakdef = h; | |
2045 | ||
2046 | /* If the weak definition is in the list of dynamic | |
2047 | symbols, make sure the real definition is put there | |
2048 | as well. */ | |
2049 | if (hlook->dynindx != -1 | |
2050 | && h->dynindx == -1) | |
2051 | { | |
2052 | if (! _bfd_elf_link_record_dynamic_symbol (info, h)) | |
2053 | goto error_return; | |
2054 | } | |
2055 | ||
2056 | /* If the real definition is in the list of dynamic | |
2057 | symbols, make sure the weak definition is put there | |
2058 | as well. If we don't do this, then the dynamic | |
2059 | loader might not merge the entries for the real | |
2060 | definition and the weak definition. */ | |
2061 | if (h->dynindx != -1 | |
2062 | && hlook->dynindx == -1) | |
2063 | { | |
2064 | if (! _bfd_elf_link_record_dynamic_symbol (info, hlook)) | |
2065 | goto error_return; | |
2066 | } | |
2067 | ||
2068 | break; | |
2069 | } | |
2070 | } | |
2071 | } | |
2072 | ||
2073 | if (buf != NULL) | |
2074 | { | |
2075 | free (buf); | |
2076 | buf = NULL; | |
2077 | } | |
2078 | ||
2079 | if (extversym != NULL) | |
2080 | { | |
2081 | free (extversym); | |
2082 | extversym = NULL; | |
2083 | } | |
2084 | ||
2085 | /* If this object is the same format as the output object, and it is | |
2086 | not a shared library, then let the backend look through the | |
2087 | relocs. | |
2088 | ||
2089 | This is required to build global offset table entries and to | |
2090 | arrange for dynamic relocs. It is not required for the | |
2091 | particular common case of linking non PIC code, even when linking | |
2092 | against shared libraries, but unfortunately there is no way of | |
2093 | knowing whether an object file has been compiled PIC or not. | |
2094 | Looking through the relocs is not particularly time consuming. | |
2095 | The problem is that we must either (1) keep the relocs in memory, | |
2096 | which causes the linker to require additional runtime memory or | |
2097 | (2) read the relocs twice from the input file, which wastes time. | |
2098 | This would be a good case for using mmap. | |
2099 | ||
2100 | I have no idea how to handle linking PIC code into a file of a | |
2101 | different format. It probably can't be done. */ | |
2102 | check_relocs = get_elf_backend_data (abfd)->check_relocs; | |
2103 | if (! dynamic | |
2104 | && abfd->xvec == info->hash->creator | |
2105 | && check_relocs != NULL) | |
2106 | { | |
2107 | asection *o; | |
2108 | ||
2109 | for (o = abfd->sections; o != NULL; o = o->next) | |
2110 | { | |
2111 | Elf_Internal_Rela *internal_relocs; | |
2112 | boolean ok; | |
2113 | ||
2114 | if ((o->flags & SEC_RELOC) == 0 | |
2115 | || o->reloc_count == 0 | |
2116 | || ((info->strip == strip_all || info->strip == strip_debugger) | |
2117 | && (o->flags & SEC_DEBUGGING) != 0) | |
2118 | || bfd_is_abs_section (o->output_section)) | |
2119 | continue; | |
2120 | ||
2121 | internal_relocs = (NAME(_bfd_elf,link_read_relocs) | |
2122 | (abfd, o, (PTR) NULL, | |
2123 | (Elf_Internal_Rela *) NULL, | |
2124 | info->keep_memory)); | |
2125 | if (internal_relocs == NULL) | |
2126 | goto error_return; | |
2127 | ||
2128 | ok = (*check_relocs) (abfd, info, o, internal_relocs); | |
2129 | ||
2130 | if (! info->keep_memory) | |
2131 | free (internal_relocs); | |
2132 | ||
2133 | if (! ok) | |
2134 | goto error_return; | |
2135 | } | |
2136 | } | |
2137 | ||
2138 | /* If this is a non-traditional, non-relocateable link, try to | |
2139 | optimize the handling of the .stab/.stabstr sections. */ | |
2140 | if (! dynamic | |
2141 | && ! info->relocateable | |
2142 | && ! info->traditional_format | |
2143 | && info->hash->creator->flavour == bfd_target_elf_flavour | |
2144 | && (info->strip != strip_all && info->strip != strip_debugger)) | |
2145 | { | |
2146 | asection *stab, *stabstr; | |
2147 | ||
2148 | stab = bfd_get_section_by_name (abfd, ".stab"); | |
2149 | if (stab != NULL) | |
2150 | { | |
2151 | stabstr = bfd_get_section_by_name (abfd, ".stabstr"); | |
2152 | ||
2153 | if (stabstr != NULL) | |
2154 | { | |
2155 | struct bfd_elf_section_data *secdata; | |
2156 | ||
2157 | secdata = elf_section_data (stab); | |
2158 | if (! _bfd_link_section_stabs (abfd, | |
2159 | &elf_hash_table (info)->stab_info, | |
2160 | stab, stabstr, | |
2161 | &secdata->stab_info)) | |
2162 | goto error_return; | |
2163 | } | |
2164 | } | |
2165 | } | |
2166 | ||
2167 | return true; | |
2168 | ||
2169 | error_return: | |
2170 | if (buf != NULL) | |
2171 | free (buf); | |
2172 | if (dynbuf != NULL) | |
2173 | free (dynbuf); | |
2174 | if (dynver != NULL) | |
2175 | free (dynver); | |
2176 | if (extversym != NULL) | |
2177 | free (extversym); | |
2178 | return false; | |
2179 | } | |
2180 | ||
2181 | /* Create some sections which will be filled in with dynamic linking | |
2182 | information. ABFD is an input file which requires dynamic sections | |
2183 | to be created. The dynamic sections take up virtual memory space | |
2184 | when the final executable is run, so we need to create them before | |
2185 | addresses are assigned to the output sections. We work out the | |
2186 | actual contents and size of these sections later. */ | |
2187 | ||
2188 | boolean | |
2189 | elf_link_create_dynamic_sections (abfd, info) | |
2190 | bfd *abfd; | |
2191 | struct bfd_link_info *info; | |
2192 | { | |
2193 | flagword flags; | |
2194 | register asection *s; | |
2195 | struct elf_link_hash_entry *h; | |
2196 | struct elf_backend_data *bed; | |
2197 | ||
2198 | if (elf_hash_table (info)->dynamic_sections_created) | |
2199 | return true; | |
2200 | ||
2201 | /* Make sure that all dynamic sections use the same input BFD. */ | |
2202 | if (elf_hash_table (info)->dynobj == NULL) | |
2203 | elf_hash_table (info)->dynobj = abfd; | |
2204 | else | |
2205 | abfd = elf_hash_table (info)->dynobj; | |
2206 | ||
2207 | /* Note that we set the SEC_IN_MEMORY flag for all of these | |
2208 | sections. */ | |
2209 | flags = (SEC_ALLOC | SEC_LOAD | SEC_HAS_CONTENTS | |
2210 | | SEC_IN_MEMORY | SEC_LINKER_CREATED); | |
2211 | ||
2212 | /* A dynamically linked executable has a .interp section, but a | |
2213 | shared library does not. */ | |
2214 | if (! info->shared) | |
2215 | { | |
2216 | s = bfd_make_section (abfd, ".interp"); | |
2217 | if (s == NULL | |
2218 | || ! bfd_set_section_flags (abfd, s, flags | SEC_READONLY)) | |
2219 | return false; | |
2220 | } | |
2221 | ||
2222 | /* Create sections to hold version informations. These are removed | |
2223 | if they are not needed. */ | |
2224 | s = bfd_make_section (abfd, ".gnu.version_d"); | |
2225 | if (s == NULL | |
2226 | || ! bfd_set_section_flags (abfd, s, flags | SEC_READONLY) | |
2227 | || ! bfd_set_section_alignment (abfd, s, LOG_FILE_ALIGN)) | |
2228 | return false; | |
2229 | ||
2230 | s = bfd_make_section (abfd, ".gnu.version"); | |
2231 | if (s == NULL | |
2232 | || ! bfd_set_section_flags (abfd, s, flags | SEC_READONLY) | |
2233 | || ! bfd_set_section_alignment (abfd, s, 1)) | |
2234 | return false; | |
2235 | ||
2236 | s = bfd_make_section (abfd, ".gnu.version_r"); | |
2237 | if (s == NULL | |
2238 | || ! bfd_set_section_flags (abfd, s, flags | SEC_READONLY) | |
2239 | || ! bfd_set_section_alignment (abfd, s, LOG_FILE_ALIGN)) | |
2240 | return false; | |
2241 | ||
2242 | s = bfd_make_section (abfd, ".dynsym"); | |
2243 | if (s == NULL | |
2244 | || ! bfd_set_section_flags (abfd, s, flags | SEC_READONLY) | |
2245 | || ! bfd_set_section_alignment (abfd, s, LOG_FILE_ALIGN)) | |
2246 | return false; | |
2247 | ||
2248 | s = bfd_make_section (abfd, ".dynstr"); | |
2249 | if (s == NULL | |
2250 | || ! bfd_set_section_flags (abfd, s, flags | SEC_READONLY)) | |
2251 | return false; | |
2252 | ||
2253 | /* Create a strtab to hold the dynamic symbol names. */ | |
2254 | if (elf_hash_table (info)->dynstr == NULL) | |
2255 | { | |
2256 | elf_hash_table (info)->dynstr = elf_stringtab_init (); | |
2257 | if (elf_hash_table (info)->dynstr == NULL) | |
2258 | return false; | |
2259 | } | |
2260 | ||
2261 | s = bfd_make_section (abfd, ".dynamic"); | |
2262 | if (s == NULL | |
2263 | || ! bfd_set_section_flags (abfd, s, flags) | |
2264 | || ! bfd_set_section_alignment (abfd, s, LOG_FILE_ALIGN)) | |
2265 | return false; | |
2266 | ||
2267 | /* The special symbol _DYNAMIC is always set to the start of the | |
2268 | .dynamic section. This call occurs before we have processed the | |
2269 | symbols for any dynamic object, so we don't have to worry about | |
2270 | overriding a dynamic definition. We could set _DYNAMIC in a | |
2271 | linker script, but we only want to define it if we are, in fact, | |
2272 | creating a .dynamic section. We don't want to define it if there | |
2273 | is no .dynamic section, since on some ELF platforms the start up | |
2274 | code examines it to decide how to initialize the process. */ | |
2275 | h = NULL; | |
2276 | if (! (_bfd_generic_link_add_one_symbol | |
2277 | (info, abfd, "_DYNAMIC", BSF_GLOBAL, s, (bfd_vma) 0, | |
2278 | (const char *) NULL, false, get_elf_backend_data (abfd)->collect, | |
2279 | (struct bfd_link_hash_entry **) &h))) | |
2280 | return false; | |
2281 | h->elf_link_hash_flags |= ELF_LINK_HASH_DEF_REGULAR; | |
2282 | h->type = STT_OBJECT; | |
2283 | ||
2284 | if (info->shared | |
2285 | && ! _bfd_elf_link_record_dynamic_symbol (info, h)) | |
2286 | return false; | |
2287 | ||
c7ac6ff8 MM |
2288 | bed = get_elf_backend_data (abfd); |
2289 | ||
252b5132 RH |
2290 | s = bfd_make_section (abfd, ".hash"); |
2291 | if (s == NULL | |
2292 | || ! bfd_set_section_flags (abfd, s, flags | SEC_READONLY) | |
2293 | || ! bfd_set_section_alignment (abfd, s, LOG_FILE_ALIGN)) | |
2294 | return false; | |
c7ac6ff8 | 2295 | elf_section_data (s)->this_hdr.sh_entsize = bed->s->sizeof_hash_entry; |
252b5132 RH |
2296 | |
2297 | /* Let the backend create the rest of the sections. This lets the | |
2298 | backend set the right flags. The backend will normally create | |
2299 | the .got and .plt sections. */ | |
252b5132 RH |
2300 | if (! (*bed->elf_backend_create_dynamic_sections) (abfd, info)) |
2301 | return false; | |
2302 | ||
2303 | elf_hash_table (info)->dynamic_sections_created = true; | |
2304 | ||
2305 | return true; | |
2306 | } | |
2307 | ||
2308 | /* Add an entry to the .dynamic table. */ | |
2309 | ||
2310 | boolean | |
2311 | elf_add_dynamic_entry (info, tag, val) | |
2312 | struct bfd_link_info *info; | |
2313 | bfd_vma tag; | |
2314 | bfd_vma val; | |
2315 | { | |
2316 | Elf_Internal_Dyn dyn; | |
2317 | bfd *dynobj; | |
2318 | asection *s; | |
2319 | size_t newsize; | |
2320 | bfd_byte *newcontents; | |
2321 | ||
2322 | dynobj = elf_hash_table (info)->dynobj; | |
2323 | ||
2324 | s = bfd_get_section_by_name (dynobj, ".dynamic"); | |
2325 | BFD_ASSERT (s != NULL); | |
2326 | ||
2327 | newsize = s->_raw_size + sizeof (Elf_External_Dyn); | |
2328 | newcontents = (bfd_byte *) bfd_realloc (s->contents, newsize); | |
2329 | if (newcontents == NULL) | |
2330 | return false; | |
2331 | ||
2332 | dyn.d_tag = tag; | |
2333 | dyn.d_un.d_val = val; | |
2334 | elf_swap_dyn_out (dynobj, &dyn, | |
2335 | (Elf_External_Dyn *) (newcontents + s->_raw_size)); | |
2336 | ||
2337 | s->_raw_size = newsize; | |
2338 | s->contents = newcontents; | |
2339 | ||
2340 | return true; | |
2341 | } | |
30b30c21 RH |
2342 | |
2343 | /* Record a new local dynamic symbol. */ | |
2344 | ||
2345 | boolean | |
2346 | elf_link_record_local_dynamic_symbol (info, input_bfd, input_indx) | |
2347 | struct bfd_link_info *info; | |
2348 | bfd *input_bfd; | |
2349 | long input_indx; | |
2350 | { | |
2351 | struct elf_link_local_dynamic_entry *entry; | |
2352 | struct elf_link_hash_table *eht; | |
2353 | struct bfd_strtab_hash *dynstr; | |
2354 | Elf_External_Sym esym; | |
2355 | unsigned long dynstr_index; | |
2356 | char *name; | |
30b30c21 RH |
2357 | |
2358 | /* See if the entry exists already. */ | |
2359 | for (entry = elf_hash_table (info)->dynlocal; entry ; entry = entry->next) | |
2360 | if (entry->input_bfd == input_bfd && entry->input_indx == input_indx) | |
2361 | return true; | |
2362 | ||
2363 | entry = (struct elf_link_local_dynamic_entry *) | |
2364 | bfd_alloc (input_bfd, sizeof (*entry)); | |
2365 | if (entry == NULL) | |
2366 | return false; | |
2367 | ||
2368 | /* Go find the symbol, so that we can find it's name. */ | |
2369 | if (bfd_seek (input_bfd, | |
2370 | (elf_tdata (input_bfd)->symtab_hdr.sh_offset | |
2371 | + input_indx * sizeof (Elf_External_Sym)), | |
2372 | SEEK_SET) != 0 | |
2373 | || (bfd_read (&esym, sizeof (Elf_External_Sym), 1, input_bfd) | |
2374 | != sizeof (Elf_External_Sym))) | |
2375 | return false; | |
2376 | elf_swap_symbol_in (input_bfd, &esym, &entry->isym); | |
2377 | ||
2378 | name = (bfd_elf_string_from_elf_section | |
2379 | (input_bfd, elf_tdata (input_bfd)->symtab_hdr.sh_link, | |
2380 | entry->isym.st_name)); | |
2381 | ||
2382 | dynstr = elf_hash_table (info)->dynstr; | |
2383 | if (dynstr == NULL) | |
2384 | { | |
2385 | /* Create a strtab to hold the dynamic symbol names. */ | |
2386 | elf_hash_table (info)->dynstr = dynstr = _bfd_elf_stringtab_init (); | |
2387 | if (dynstr == NULL) | |
2388 | return false; | |
2389 | } | |
2390 | ||
2391 | dynstr_index = _bfd_stringtab_add (dynstr, name, true, false); | |
2392 | if (dynstr_index == (unsigned long) -1) | |
2393 | return false; | |
2394 | entry->isym.st_name = dynstr_index; | |
2395 | ||
2396 | eht = elf_hash_table (info); | |
2397 | ||
2398 | entry->next = eht->dynlocal; | |
2399 | eht->dynlocal = entry; | |
2400 | entry->input_bfd = input_bfd; | |
2401 | entry->input_indx = input_indx; | |
2402 | eht->dynsymcount++; | |
2403 | ||
587ff49e RH |
2404 | /* Whatever binding the symbol had before, it's now local. */ |
2405 | entry->isym.st_info | |
2406 | = ELF_ST_INFO (STB_LOCAL, ELF_ST_TYPE (entry->isym.st_info)); | |
2407 | ||
30b30c21 RH |
2408 | /* The dynindx will be set at the end of size_dynamic_sections. */ |
2409 | ||
2410 | return true; | |
2411 | } | |
252b5132 RH |
2412 | \f |
2413 | ||
6b5bd373 MM |
2414 | /* Read and swap the relocs from the section indicated by SHDR. This |
2415 | may be either a REL or a RELA section. The relocations are | |
2416 | translated into RELA relocations and stored in INTERNAL_RELOCS, | |
2417 | which should have already been allocated to contain enough space. | |
2418 | The EXTERNAL_RELOCS are a buffer where the external form of the | |
2419 | relocations should be stored. | |
2420 | ||
2421 | Returns false if something goes wrong. */ | |
2422 | ||
2423 | static boolean | |
2424 | elf_link_read_relocs_from_section (abfd, shdr, external_relocs, | |
2425 | internal_relocs) | |
2426 | bfd *abfd; | |
2427 | Elf_Internal_Shdr *shdr; | |
2428 | PTR external_relocs; | |
2429 | Elf_Internal_Rela *internal_relocs; | |
2430 | { | |
c7ac6ff8 MM |
2431 | struct elf_backend_data *bed; |
2432 | ||
6b5bd373 MM |
2433 | /* If there aren't any relocations, that's OK. */ |
2434 | if (!shdr) | |
2435 | return true; | |
2436 | ||
2437 | /* Position ourselves at the start of the section. */ | |
2438 | if (bfd_seek (abfd, shdr->sh_offset, SEEK_SET) != 0) | |
2439 | return false; | |
2440 | ||
2441 | /* Read the relocations. */ | |
2442 | if (bfd_read (external_relocs, 1, shdr->sh_size, abfd) | |
2443 | != shdr->sh_size) | |
2444 | return false; | |
2445 | ||
c7ac6ff8 MM |
2446 | bed = get_elf_backend_data (abfd); |
2447 | ||
6b5bd373 MM |
2448 | /* Convert the external relocations to the internal format. */ |
2449 | if (shdr->sh_entsize == sizeof (Elf_External_Rel)) | |
2450 | { | |
2451 | Elf_External_Rel *erel; | |
2452 | Elf_External_Rel *erelend; | |
2453 | Elf_Internal_Rela *irela; | |
c7ac6ff8 | 2454 | Elf_Internal_Rel *irel; |
6b5bd373 MM |
2455 | |
2456 | erel = (Elf_External_Rel *) external_relocs; | |
2457 | erelend = erel + shdr->sh_size / shdr->sh_entsize; | |
2458 | irela = internal_relocs; | |
c7ac6ff8 MM |
2459 | irel = bfd_alloc (abfd, (bed->s->int_rels_per_ext_rel |
2460 | * sizeof (Elf_Internal_Rel))); | |
2461 | for (; erel < erelend; erel++, irela += bed->s->int_rels_per_ext_rel) | |
6b5bd373 | 2462 | { |
65388f2d | 2463 | unsigned char i; |
c7ac6ff8 MM |
2464 | |
2465 | if (bed->s->swap_reloc_in) | |
2466 | (*bed->s->swap_reloc_in) (abfd, (bfd_byte *) erel, irel); | |
2467 | else | |
2468 | elf_swap_reloc_in (abfd, erel, irel); | |
6b5bd373 | 2469 | |
c7ac6ff8 MM |
2470 | for (i = 0; i < bed->s->int_rels_per_ext_rel; ++i) |
2471 | { | |
2472 | irela[i].r_offset = irel[i].r_offset; | |
2473 | irela[i].r_info = irel[i].r_info; | |
2474 | irela[i].r_addend = 0; | |
2475 | } | |
6b5bd373 MM |
2476 | } |
2477 | } | |
2478 | else | |
2479 | { | |
2480 | Elf_External_Rela *erela; | |
2481 | Elf_External_Rela *erelaend; | |
2482 | Elf_Internal_Rela *irela; | |
2483 | ||
2484 | BFD_ASSERT (shdr->sh_entsize == sizeof (Elf_External_Rela)); | |
2485 | ||
2486 | erela = (Elf_External_Rela *) external_relocs; | |
2487 | erelaend = erela + shdr->sh_size / shdr->sh_entsize; | |
2488 | irela = internal_relocs; | |
c7ac6ff8 MM |
2489 | for (; erela < erelaend; erela++, irela += bed->s->int_rels_per_ext_rel) |
2490 | { | |
2491 | if (bed->s->swap_reloca_in) | |
2492 | (*bed->s->swap_reloca_in) (abfd, (bfd_byte *) erela, irela); | |
2493 | else | |
2494 | elf_swap_reloca_in (abfd, erela, irela); | |
2495 | } | |
6b5bd373 MM |
2496 | } |
2497 | ||
2498 | return true; | |
2499 | } | |
2500 | ||
23bc299b MM |
2501 | /* Read and swap the relocs for a section O. They may have been |
2502 | cached. If the EXTERNAL_RELOCS and INTERNAL_RELOCS arguments are | |
2503 | not NULL, they are used as buffers to read into. They are known to | |
2504 | be large enough. If the INTERNAL_RELOCS relocs argument is NULL, | |
2505 | the return value is allocated using either malloc or bfd_alloc, | |
2506 | according to the KEEP_MEMORY argument. If O has two relocation | |
2507 | sections (both REL and RELA relocations), then the REL_HDR | |
2508 | relocations will appear first in INTERNAL_RELOCS, followed by the | |
2509 | REL_HDR2 relocations. */ | |
252b5132 RH |
2510 | |
2511 | Elf_Internal_Rela * | |
2512 | NAME(_bfd_elf,link_read_relocs) (abfd, o, external_relocs, internal_relocs, | |
2513 | keep_memory) | |
2514 | bfd *abfd; | |
2515 | asection *o; | |
2516 | PTR external_relocs; | |
2517 | Elf_Internal_Rela *internal_relocs; | |
2518 | boolean keep_memory; | |
2519 | { | |
2520 | Elf_Internal_Shdr *rel_hdr; | |
2521 | PTR alloc1 = NULL; | |
2522 | Elf_Internal_Rela *alloc2 = NULL; | |
c7ac6ff8 | 2523 | struct elf_backend_data *bed = get_elf_backend_data (abfd); |
252b5132 RH |
2524 | |
2525 | if (elf_section_data (o)->relocs != NULL) | |
2526 | return elf_section_data (o)->relocs; | |
2527 | ||
2528 | if (o->reloc_count == 0) | |
2529 | return NULL; | |
2530 | ||
2531 | rel_hdr = &elf_section_data (o)->rel_hdr; | |
2532 | ||
2533 | if (internal_relocs == NULL) | |
2534 | { | |
2535 | size_t size; | |
2536 | ||
c7ac6ff8 MM |
2537 | size = (o->reloc_count * bed->s->int_rels_per_ext_rel |
2538 | * sizeof (Elf_Internal_Rela)); | |
252b5132 RH |
2539 | if (keep_memory) |
2540 | internal_relocs = (Elf_Internal_Rela *) bfd_alloc (abfd, size); | |
2541 | else | |
2542 | internal_relocs = alloc2 = (Elf_Internal_Rela *) bfd_malloc (size); | |
2543 | if (internal_relocs == NULL) | |
2544 | goto error_return; | |
2545 | } | |
2546 | ||
2547 | if (external_relocs == NULL) | |
2548 | { | |
6b5bd373 MM |
2549 | size_t size = (size_t) rel_hdr->sh_size; |
2550 | ||
2551 | if (elf_section_data (o)->rel_hdr2) | |
2552 | size += (size_t) elf_section_data (o)->rel_hdr2->sh_size; | |
2553 | alloc1 = (PTR) bfd_malloc (size); | |
252b5132 RH |
2554 | if (alloc1 == NULL) |
2555 | goto error_return; | |
2556 | external_relocs = alloc1; | |
2557 | } | |
2558 | ||
6b5bd373 MM |
2559 | if (!elf_link_read_relocs_from_section (abfd, rel_hdr, |
2560 | external_relocs, | |
2561 | internal_relocs)) | |
2562 | goto error_return; | |
2563 | if (!elf_link_read_relocs_from_section | |
2564 | (abfd, | |
2565 | elf_section_data (o)->rel_hdr2, | |
2f5116e2 | 2566 | ((bfd_byte *) external_relocs) + rel_hdr->sh_size, |
c7ac6ff8 MM |
2567 | internal_relocs + (rel_hdr->sh_size / rel_hdr->sh_entsize |
2568 | * bed->s->int_rels_per_ext_rel))) | |
252b5132 | 2569 | goto error_return; |
252b5132 RH |
2570 | |
2571 | /* Cache the results for next time, if we can. */ | |
2572 | if (keep_memory) | |
2573 | elf_section_data (o)->relocs = internal_relocs; | |
2574 | ||
2575 | if (alloc1 != NULL) | |
2576 | free (alloc1); | |
2577 | ||
2578 | /* Don't free alloc2, since if it was allocated we are passing it | |
2579 | back (under the name of internal_relocs). */ | |
2580 | ||
2581 | return internal_relocs; | |
2582 | ||
2583 | error_return: | |
2584 | if (alloc1 != NULL) | |
2585 | free (alloc1); | |
2586 | if (alloc2 != NULL) | |
2587 | free (alloc2); | |
2588 | return NULL; | |
2589 | } | |
2590 | \f | |
2591 | ||
2592 | /* Record an assignment to a symbol made by a linker script. We need | |
2593 | this in case some dynamic object refers to this symbol. */ | |
2594 | ||
2595 | /*ARGSUSED*/ | |
2596 | boolean | |
2597 | NAME(bfd_elf,record_link_assignment) (output_bfd, info, name, provide) | |
7442e600 | 2598 | bfd *output_bfd ATTRIBUTE_UNUSED; |
252b5132 RH |
2599 | struct bfd_link_info *info; |
2600 | const char *name; | |
2601 | boolean provide; | |
2602 | { | |
2603 | struct elf_link_hash_entry *h; | |
2604 | ||
2605 | if (info->hash->creator->flavour != bfd_target_elf_flavour) | |
2606 | return true; | |
2607 | ||
2608 | h = elf_link_hash_lookup (elf_hash_table (info), name, true, true, false); | |
2609 | if (h == NULL) | |
2610 | return false; | |
2611 | ||
2612 | if (h->root.type == bfd_link_hash_new) | |
2613 | h->elf_link_hash_flags &=~ ELF_LINK_NON_ELF; | |
2614 | ||
2615 | /* If this symbol is being provided by the linker script, and it is | |
2616 | currently defined by a dynamic object, but not by a regular | |
2617 | object, then mark it as undefined so that the generic linker will | |
2618 | force the correct value. */ | |
2619 | if (provide | |
2620 | && (h->elf_link_hash_flags & ELF_LINK_HASH_DEF_DYNAMIC) != 0 | |
2621 | && (h->elf_link_hash_flags & ELF_LINK_HASH_DEF_REGULAR) == 0) | |
2622 | h->root.type = bfd_link_hash_undefined; | |
2623 | ||
2624 | /* If this symbol is not being provided by the linker script, and it is | |
2625 | currently defined by a dynamic object, but not by a regular object, | |
2626 | then clear out any version information because the symbol will not be | |
2627 | associated with the dynamic object any more. */ | |
2628 | if (!provide | |
2629 | && (h->elf_link_hash_flags & ELF_LINK_HASH_DEF_DYNAMIC) != 0 | |
2630 | && (h->elf_link_hash_flags & ELF_LINK_HASH_DEF_REGULAR) == 0) | |
2631 | h->verinfo.verdef = NULL; | |
2632 | ||
2633 | h->elf_link_hash_flags |= ELF_LINK_HASH_DEF_REGULAR; | |
994819d2 NC |
2634 | |
2635 | /* When possible, keep the original type of the symbol */ | |
2636 | if (h->type == STT_NOTYPE) | |
2637 | h->type = STT_OBJECT; | |
252b5132 RH |
2638 | |
2639 | if (((h->elf_link_hash_flags & (ELF_LINK_HASH_DEF_DYNAMIC | |
2640 | | ELF_LINK_HASH_REF_DYNAMIC)) != 0 | |
2641 | || info->shared) | |
2642 | && h->dynindx == -1) | |
2643 | { | |
2644 | if (! _bfd_elf_link_record_dynamic_symbol (info, h)) | |
2645 | return false; | |
2646 | ||
2647 | /* If this is a weak defined symbol, and we know a corresponding | |
2648 | real symbol from the same dynamic object, make sure the real | |
2649 | symbol is also made into a dynamic symbol. */ | |
2650 | if (h->weakdef != NULL | |
2651 | && h->weakdef->dynindx == -1) | |
2652 | { | |
2653 | if (! _bfd_elf_link_record_dynamic_symbol (info, h->weakdef)) | |
2654 | return false; | |
2655 | } | |
2656 | } | |
2657 | ||
2658 | return true; | |
2659 | } | |
2660 | \f | |
2661 | /* This structure is used to pass information to | |
2662 | elf_link_assign_sym_version. */ | |
2663 | ||
2664 | struct elf_assign_sym_version_info | |
2665 | { | |
2666 | /* Output BFD. */ | |
2667 | bfd *output_bfd; | |
2668 | /* General link information. */ | |
2669 | struct bfd_link_info *info; | |
2670 | /* Version tree. */ | |
2671 | struct bfd_elf_version_tree *verdefs; | |
2672 | /* Whether we are exporting all dynamic symbols. */ | |
2673 | boolean export_dynamic; | |
252b5132 RH |
2674 | /* Whether we had a failure. */ |
2675 | boolean failed; | |
2676 | }; | |
2677 | ||
2678 | /* This structure is used to pass information to | |
2679 | elf_link_find_version_dependencies. */ | |
2680 | ||
2681 | struct elf_find_verdep_info | |
2682 | { | |
2683 | /* Output BFD. */ | |
2684 | bfd *output_bfd; | |
2685 | /* General link information. */ | |
2686 | struct bfd_link_info *info; | |
2687 | /* The number of dependencies. */ | |
2688 | unsigned int vers; | |
2689 | /* Whether we had a failure. */ | |
2690 | boolean failed; | |
2691 | }; | |
2692 | ||
2693 | /* Array used to determine the number of hash table buckets to use | |
2694 | based on the number of symbols there are. If there are fewer than | |
2695 | 3 symbols we use 1 bucket, fewer than 17 symbols we use 3 buckets, | |
2696 | fewer than 37 we use 17 buckets, and so forth. We never use more | |
2697 | than 32771 buckets. */ | |
2698 | ||
2699 | static const size_t elf_buckets[] = | |
2700 | { | |
2701 | 1, 3, 17, 37, 67, 97, 131, 197, 263, 521, 1031, 2053, 4099, 8209, | |
2702 | 16411, 32771, 0 | |
2703 | }; | |
2704 | ||
2705 | /* Compute bucket count for hashing table. We do not use a static set | |
2706 | of possible tables sizes anymore. Instead we determine for all | |
2707 | possible reasonable sizes of the table the outcome (i.e., the | |
2708 | number of collisions etc) and choose the best solution. The | |
2709 | weighting functions are not too simple to allow the table to grow | |
2710 | without bounds. Instead one of the weighting factors is the size. | |
2711 | Therefore the result is always a good payoff between few collisions | |
2712 | (= short chain lengths) and table size. */ | |
2713 | static size_t | |
2714 | compute_bucket_count (info) | |
2715 | struct bfd_link_info *info; | |
2716 | { | |
2717 | size_t dynsymcount = elf_hash_table (info)->dynsymcount; | |
7442e600 | 2718 | size_t best_size = 0; |
252b5132 RH |
2719 | unsigned long int *hashcodes; |
2720 | unsigned long int *hashcodesp; | |
2721 | unsigned long int i; | |
2722 | ||
2723 | /* Compute the hash values for all exported symbols. At the same | |
2724 | time store the values in an array so that we could use them for | |
2725 | optimizations. */ | |
2726 | hashcodes = (unsigned long int *) bfd_malloc (dynsymcount | |
2727 | * sizeof (unsigned long int)); | |
2728 | if (hashcodes == NULL) | |
2729 | return 0; | |
2730 | hashcodesp = hashcodes; | |
2731 | ||
2732 | /* Put all hash values in HASHCODES. */ | |
2733 | elf_link_hash_traverse (elf_hash_table (info), | |
2734 | elf_collect_hash_codes, &hashcodesp); | |
2735 | ||
2736 | /* We have a problem here. The following code to optimize the table | |
2737 | size requires an integer type with more the 32 bits. If | |
2738 | BFD_HOST_U_64_BIT is set we know about such a type. */ | |
2739 | #ifdef BFD_HOST_U_64_BIT | |
2740 | if (info->optimize == true) | |
2741 | { | |
2742 | unsigned long int nsyms = hashcodesp - hashcodes; | |
2743 | size_t minsize; | |
2744 | size_t maxsize; | |
2745 | BFD_HOST_U_64_BIT best_chlen = ~((BFD_HOST_U_64_BIT) 0); | |
2746 | unsigned long int *counts ; | |
2747 | ||
2748 | /* Possible optimization parameters: if we have NSYMS symbols we say | |
2749 | that the hashing table must at least have NSYMS/4 and at most | |
2750 | 2*NSYMS buckets. */ | |
2751 | minsize = nsyms / 4; | |
2752 | if (minsize == 0) | |
2753 | minsize = 1; | |
2754 | best_size = maxsize = nsyms * 2; | |
2755 | ||
2756 | /* Create array where we count the collisions in. We must use bfd_malloc | |
2757 | since the size could be large. */ | |
2758 | counts = (unsigned long int *) bfd_malloc (maxsize | |
2759 | * sizeof (unsigned long int)); | |
2760 | if (counts == NULL) | |
2761 | { | |
2762 | free (hashcodes); | |
2763 | return 0; | |
2764 | } | |
2765 | ||
2766 | /* Compute the "optimal" size for the hash table. The criteria is a | |
2767 | minimal chain length. The minor criteria is (of course) the size | |
2768 | of the table. */ | |
2769 | for (i = minsize; i < maxsize; ++i) | |
2770 | { | |
2771 | /* Walk through the array of hashcodes and count the collisions. */ | |
2772 | BFD_HOST_U_64_BIT max; | |
2773 | unsigned long int j; | |
2774 | unsigned long int fact; | |
2775 | ||
2776 | memset (counts, '\0', i * sizeof (unsigned long int)); | |
2777 | ||
2778 | /* Determine how often each hash bucket is used. */ | |
2779 | for (j = 0; j < nsyms; ++j) | |
2780 | ++counts[hashcodes[j] % i]; | |
2781 | ||
2782 | /* For the weight function we need some information about the | |
2783 | pagesize on the target. This is information need not be 100% | |
2784 | accurate. Since this information is not available (so far) we | |
2785 | define it here to a reasonable default value. If it is crucial | |
2786 | to have a better value some day simply define this value. */ | |
2787 | # ifndef BFD_TARGET_PAGESIZE | |
2788 | # define BFD_TARGET_PAGESIZE (4096) | |
2789 | # endif | |
2790 | ||
2791 | /* We in any case need 2 + NSYMS entries for the size values and | |
2792 | the chains. */ | |
2793 | max = (2 + nsyms) * (ARCH_SIZE / 8); | |
2794 | ||
2795 | # if 1 | |
2796 | /* Variant 1: optimize for short chains. We add the squares | |
2797 | of all the chain lengths (which favous many small chain | |
2798 | over a few long chains). */ | |
2799 | for (j = 0; j < i; ++j) | |
2800 | max += counts[j] * counts[j]; | |
2801 | ||
2802 | /* This adds penalties for the overall size of the table. */ | |
2803 | fact = i / (BFD_TARGET_PAGESIZE / (ARCH_SIZE / 8)) + 1; | |
2804 | max *= fact * fact; | |
2805 | # else | |
2806 | /* Variant 2: Optimize a lot more for small table. Here we | |
2807 | also add squares of the size but we also add penalties for | |
2808 | empty slots (the +1 term). */ | |
2809 | for (j = 0; j < i; ++j) | |
2810 | max += (1 + counts[j]) * (1 + counts[j]); | |
2811 | ||
2812 | /* The overall size of the table is considered, but not as | |
2813 | strong as in variant 1, where it is squared. */ | |
2814 | fact = i / (BFD_TARGET_PAGESIZE / (ARCH_SIZE / 8)) + 1; | |
2815 | max *= fact; | |
2816 | # endif | |
2817 | ||
2818 | /* Compare with current best results. */ | |
2819 | if (max < best_chlen) | |
2820 | { | |
2821 | best_chlen = max; | |
2822 | best_size = i; | |
2823 | } | |
2824 | } | |
2825 | ||
2826 | free (counts); | |
2827 | } | |
2828 | else | |
2829 | #endif /* defined (BFD_HOST_U_64_BIT) */ | |
2830 | { | |
2831 | /* This is the fallback solution if no 64bit type is available or if we | |
2832 | are not supposed to spend much time on optimizations. We select the | |
2833 | bucket count using a fixed set of numbers. */ | |
2834 | for (i = 0; elf_buckets[i] != 0; i++) | |
2835 | { | |
2836 | best_size = elf_buckets[i]; | |
2837 | if (dynsymcount < elf_buckets[i + 1]) | |
2838 | break; | |
2839 | } | |
2840 | } | |
2841 | ||
2842 | /* Free the arrays we needed. */ | |
2843 | free (hashcodes); | |
2844 | ||
2845 | return best_size; | |
2846 | } | |
2847 | ||
2848 | /* Set up the sizes and contents of the ELF dynamic sections. This is | |
2849 | called by the ELF linker emulation before_allocation routine. We | |
2850 | must set the sizes of the sections before the linker sets the | |
2851 | addresses of the various sections. */ | |
2852 | ||
2853 | boolean | |
2854 | NAME(bfd_elf,size_dynamic_sections) (output_bfd, soname, rpath, | |
2855 | export_dynamic, filter_shlib, | |
2856 | auxiliary_filters, info, sinterpptr, | |
2857 | verdefs) | |
2858 | bfd *output_bfd; | |
2859 | const char *soname; | |
2860 | const char *rpath; | |
2861 | boolean export_dynamic; | |
2862 | const char *filter_shlib; | |
2863 | const char * const *auxiliary_filters; | |
2864 | struct bfd_link_info *info; | |
2865 | asection **sinterpptr; | |
2866 | struct bfd_elf_version_tree *verdefs; | |
2867 | { | |
2868 | bfd_size_type soname_indx; | |
2869 | bfd *dynobj; | |
2870 | struct elf_backend_data *bed; | |
252b5132 RH |
2871 | struct elf_assign_sym_version_info asvinfo; |
2872 | ||
2873 | *sinterpptr = NULL; | |
2874 | ||
2875 | soname_indx = (bfd_size_type) -1; | |
2876 | ||
2877 | if (info->hash->creator->flavour != bfd_target_elf_flavour) | |
2878 | return true; | |
2879 | ||
2880 | /* The backend may have to create some sections regardless of whether | |
2881 | we're dynamic or not. */ | |
2882 | bed = get_elf_backend_data (output_bfd); | |
2883 | if (bed->elf_backend_always_size_sections | |
2884 | && ! (*bed->elf_backend_always_size_sections) (output_bfd, info)) | |
2885 | return false; | |
2886 | ||
2887 | dynobj = elf_hash_table (info)->dynobj; | |
2888 | ||
2889 | /* If there were no dynamic objects in the link, there is nothing to | |
2890 | do here. */ | |
2891 | if (dynobj == NULL) | |
2892 | return true; | |
2893 | ||
252b5132 RH |
2894 | if (elf_hash_table (info)->dynamic_sections_created) |
2895 | { | |
2896 | struct elf_info_failed eif; | |
2897 | struct elf_link_hash_entry *h; | |
fc8c40a0 | 2898 | asection *dynstr; |
252b5132 RH |
2899 | |
2900 | *sinterpptr = bfd_get_section_by_name (dynobj, ".interp"); | |
2901 | BFD_ASSERT (*sinterpptr != NULL || info->shared); | |
2902 | ||
2903 | if (soname != NULL) | |
2904 | { | |
2905 | soname_indx = _bfd_stringtab_add (elf_hash_table (info)->dynstr, | |
2906 | soname, true, true); | |
2907 | if (soname_indx == (bfd_size_type) -1 | |
2908 | || ! elf_add_dynamic_entry (info, DT_SONAME, soname_indx)) | |
2909 | return false; | |
2910 | } | |
2911 | ||
2912 | if (info->symbolic) | |
2913 | { | |
2914 | if (! elf_add_dynamic_entry (info, DT_SYMBOLIC, 0)) | |
2915 | return false; | |
d6cf2879 | 2916 | info->flags |= DF_SYMBOLIC; |
252b5132 RH |
2917 | } |
2918 | ||
2919 | if (rpath != NULL) | |
2920 | { | |
2921 | bfd_size_type indx; | |
2922 | ||
2923 | indx = _bfd_stringtab_add (elf_hash_table (info)->dynstr, rpath, | |
2924 | true, true); | |
2925 | if (indx == (bfd_size_type) -1 | |
d6cf2879 | 2926 | || ! elf_add_dynamic_entry (info, DT_RPATH, indx) |
c25373b7 L |
2927 | || (info->new_dtags |
2928 | && ! elf_add_dynamic_entry (info, DT_RUNPATH, indx))) | |
252b5132 RH |
2929 | return false; |
2930 | } | |
2931 | ||
2932 | if (filter_shlib != NULL) | |
2933 | { | |
2934 | bfd_size_type indx; | |
2935 | ||
2936 | indx = _bfd_stringtab_add (elf_hash_table (info)->dynstr, | |
2937 | filter_shlib, true, true); | |
2938 | if (indx == (bfd_size_type) -1 | |
2939 | || ! elf_add_dynamic_entry (info, DT_FILTER, indx)) | |
2940 | return false; | |
2941 | } | |
2942 | ||
2943 | if (auxiliary_filters != NULL) | |
2944 | { | |
2945 | const char * const *p; | |
2946 | ||
2947 | for (p = auxiliary_filters; *p != NULL; p++) | |
2948 | { | |
2949 | bfd_size_type indx; | |
2950 | ||
2951 | indx = _bfd_stringtab_add (elf_hash_table (info)->dynstr, | |
2952 | *p, true, true); | |
2953 | if (indx == (bfd_size_type) -1 | |
2954 | || ! elf_add_dynamic_entry (info, DT_AUXILIARY, indx)) | |
2955 | return false; | |
2956 | } | |
2957 | } | |
2958 | ||
ea44b734 RH |
2959 | /* If we are supposed to export all symbols into the dynamic symbol |
2960 | table (this is not the normal case), then do so. */ | |
2961 | if (export_dynamic) | |
2962 | { | |
2963 | struct elf_info_failed eif; | |
2964 | ||
2965 | eif.failed = false; | |
2966 | eif.info = info; | |
2967 | elf_link_hash_traverse (elf_hash_table (info), elf_export_symbol, | |
2968 | (PTR) &eif); | |
2969 | if (eif.failed) | |
2970 | return false; | |
2971 | } | |
2972 | ||
252b5132 RH |
2973 | /* Attach all the symbols to their version information. */ |
2974 | asvinfo.output_bfd = output_bfd; | |
2975 | asvinfo.info = info; | |
2976 | asvinfo.verdefs = verdefs; | |
2977 | asvinfo.export_dynamic = export_dynamic; | |
252b5132 RH |
2978 | asvinfo.failed = false; |
2979 | ||
2980 | elf_link_hash_traverse (elf_hash_table (info), | |
2981 | elf_link_assign_sym_version, | |
2982 | (PTR) &asvinfo); | |
2983 | if (asvinfo.failed) | |
2984 | return false; | |
2985 | ||
2986 | /* Find all symbols which were defined in a dynamic object and make | |
2987 | the backend pick a reasonable value for them. */ | |
2988 | eif.failed = false; | |
2989 | eif.info = info; | |
2990 | elf_link_hash_traverse (elf_hash_table (info), | |
2991 | elf_adjust_dynamic_symbol, | |
2992 | (PTR) &eif); | |
2993 | if (eif.failed) | |
2994 | return false; | |
2995 | ||
2996 | /* Add some entries to the .dynamic section. We fill in some of the | |
2997 | values later, in elf_bfd_final_link, but we must add the entries | |
2998 | now so that we know the final size of the .dynamic section. */ | |
f0c2e336 MM |
2999 | |
3000 | /* If there are initialization and/or finalization functions to | |
3001 | call then add the corresponding DT_INIT/DT_FINI entries. */ | |
3002 | h = (info->init_function | |
3003 | ? elf_link_hash_lookup (elf_hash_table (info), | |
3004 | info->init_function, false, | |
3005 | false, false) | |
3006 | : NULL); | |
252b5132 RH |
3007 | if (h != NULL |
3008 | && (h->elf_link_hash_flags & (ELF_LINK_HASH_REF_REGULAR | |
3009 | | ELF_LINK_HASH_DEF_REGULAR)) != 0) | |
3010 | { | |
3011 | if (! elf_add_dynamic_entry (info, DT_INIT, 0)) | |
3012 | return false; | |
3013 | } | |
f0c2e336 MM |
3014 | h = (info->fini_function |
3015 | ? elf_link_hash_lookup (elf_hash_table (info), | |
3016 | info->fini_function, false, | |
3017 | false, false) | |
3018 | : NULL); | |
252b5132 RH |
3019 | if (h != NULL |
3020 | && (h->elf_link_hash_flags & (ELF_LINK_HASH_REF_REGULAR | |
3021 | | ELF_LINK_HASH_DEF_REGULAR)) != 0) | |
3022 | { | |
3023 | if (! elf_add_dynamic_entry (info, DT_FINI, 0)) | |
3024 | return false; | |
3025 | } | |
f0c2e336 | 3026 | |
fc8c40a0 AM |
3027 | dynstr = bfd_get_section_by_name (dynobj, ".dynstr"); |
3028 | /* If .dynstr is excluded from the link, we don't want any of | |
3029 | these tags. Strictly, we should be checking each section | |
3030 | individually; This quick check covers for the case where | |
3031 | someone does a /DISCARD/ : { *(*) }. */ | |
3032 | if (dynstr != NULL && dynstr->output_section != bfd_abs_section_ptr) | |
3033 | { | |
3034 | bfd_size_type strsize; | |
3035 | ||
3036 | strsize = _bfd_stringtab_size (elf_hash_table (info)->dynstr); | |
3037 | if (! elf_add_dynamic_entry (info, DT_HASH, 0) | |
3038 | || ! elf_add_dynamic_entry (info, DT_STRTAB, 0) | |
3039 | || ! elf_add_dynamic_entry (info, DT_SYMTAB, 0) | |
3040 | || ! elf_add_dynamic_entry (info, DT_STRSZ, strsize) | |
3041 | || ! elf_add_dynamic_entry (info, DT_SYMENT, | |
3042 | sizeof (Elf_External_Sym))) | |
3043 | return false; | |
3044 | } | |
252b5132 RH |
3045 | } |
3046 | ||
3047 | /* The backend must work out the sizes of all the other dynamic | |
3048 | sections. */ | |
252b5132 RH |
3049 | if (bed->elf_backend_size_dynamic_sections |
3050 | && ! (*bed->elf_backend_size_dynamic_sections) (output_bfd, info)) | |
3051 | return false; | |
3052 | ||
3053 | if (elf_hash_table (info)->dynamic_sections_created) | |
3054 | { | |
3055 | size_t dynsymcount; | |
3056 | asection *s; | |
3057 | size_t bucketcount = 0; | |
c7ac6ff8 | 3058 | size_t hash_entry_size; |
252b5132 RH |
3059 | |
3060 | /* Set up the version definition section. */ | |
3061 | s = bfd_get_section_by_name (dynobj, ".gnu.version_d"); | |
3062 | BFD_ASSERT (s != NULL); | |
3063 | ||
3064 | /* We may have created additional version definitions if we are | |
3065 | just linking a regular application. */ | |
3066 | verdefs = asvinfo.verdefs; | |
3067 | ||
3068 | if (verdefs == NULL) | |
7f8d5fc9 | 3069 | _bfd_strip_section_from_output (info, s); |
252b5132 RH |
3070 | else |
3071 | { | |
3072 | unsigned int cdefs; | |
3073 | bfd_size_type size; | |
3074 | struct bfd_elf_version_tree *t; | |
3075 | bfd_byte *p; | |
3076 | Elf_Internal_Verdef def; | |
3077 | Elf_Internal_Verdaux defaux; | |
3078 | ||
252b5132 RH |
3079 | cdefs = 0; |
3080 | size = 0; | |
3081 | ||
3082 | /* Make space for the base version. */ | |
3083 | size += sizeof (Elf_External_Verdef); | |
3084 | size += sizeof (Elf_External_Verdaux); | |
3085 | ++cdefs; | |
3086 | ||
3087 | for (t = verdefs; t != NULL; t = t->next) | |
3088 | { | |
3089 | struct bfd_elf_version_deps *n; | |
3090 | ||
3091 | size += sizeof (Elf_External_Verdef); | |
3092 | size += sizeof (Elf_External_Verdaux); | |
3093 | ++cdefs; | |
3094 | ||
3095 | for (n = t->deps; n != NULL; n = n->next) | |
3096 | size += sizeof (Elf_External_Verdaux); | |
3097 | } | |
3098 | ||
3099 | s->_raw_size = size; | |
3100 | s->contents = (bfd_byte *) bfd_alloc (output_bfd, s->_raw_size); | |
3101 | if (s->contents == NULL && s->_raw_size != 0) | |
3102 | return false; | |
3103 | ||
3104 | /* Fill in the version definition section. */ | |
3105 | ||
3106 | p = s->contents; | |
3107 | ||
3108 | def.vd_version = VER_DEF_CURRENT; | |
3109 | def.vd_flags = VER_FLG_BASE; | |
3110 | def.vd_ndx = 1; | |
3111 | def.vd_cnt = 1; | |
3112 | def.vd_aux = sizeof (Elf_External_Verdef); | |
3113 | def.vd_next = (sizeof (Elf_External_Verdef) | |
3114 | + sizeof (Elf_External_Verdaux)); | |
3115 | ||
3116 | if (soname_indx != (bfd_size_type) -1) | |
3117 | { | |
3a99b017 | 3118 | def.vd_hash = bfd_elf_hash (soname); |
252b5132 RH |
3119 | defaux.vda_name = soname_indx; |
3120 | } | |
3121 | else | |
3122 | { | |
3123 | const char *name; | |
3124 | bfd_size_type indx; | |
3125 | ||
3126 | name = output_bfd->filename; | |
3a99b017 | 3127 | def.vd_hash = bfd_elf_hash (name); |
252b5132 RH |
3128 | indx = _bfd_stringtab_add (elf_hash_table (info)->dynstr, |
3129 | name, true, false); | |
3130 | if (indx == (bfd_size_type) -1) | |
3131 | return false; | |
3132 | defaux.vda_name = indx; | |
3133 | } | |
3134 | defaux.vda_next = 0; | |
3135 | ||
3136 | _bfd_elf_swap_verdef_out (output_bfd, &def, | |
3137 | (Elf_External_Verdef *)p); | |
3138 | p += sizeof (Elf_External_Verdef); | |
3139 | _bfd_elf_swap_verdaux_out (output_bfd, &defaux, | |
3140 | (Elf_External_Verdaux *) p); | |
3141 | p += sizeof (Elf_External_Verdaux); | |
3142 | ||
3143 | for (t = verdefs; t != NULL; t = t->next) | |
3144 | { | |
3145 | unsigned int cdeps; | |
3146 | struct bfd_elf_version_deps *n; | |
3147 | struct elf_link_hash_entry *h; | |
3148 | ||
3149 | cdeps = 0; | |
3150 | for (n = t->deps; n != NULL; n = n->next) | |
3151 | ++cdeps; | |
3152 | ||
3153 | /* Add a symbol representing this version. */ | |
3154 | h = NULL; | |
3155 | if (! (_bfd_generic_link_add_one_symbol | |
3156 | (info, dynobj, t->name, BSF_GLOBAL, bfd_abs_section_ptr, | |
3157 | (bfd_vma) 0, (const char *) NULL, false, | |
3158 | get_elf_backend_data (dynobj)->collect, | |
3159 | (struct bfd_link_hash_entry **) &h))) | |
3160 | return false; | |
3161 | h->elf_link_hash_flags &= ~ ELF_LINK_NON_ELF; | |
3162 | h->elf_link_hash_flags |= ELF_LINK_HASH_DEF_REGULAR; | |
3163 | h->type = STT_OBJECT; | |
3164 | h->verinfo.vertree = t; | |
3165 | ||
3166 | if (! _bfd_elf_link_record_dynamic_symbol (info, h)) | |
3167 | return false; | |
3168 | ||
3169 | def.vd_version = VER_DEF_CURRENT; | |
3170 | def.vd_flags = 0; | |
3171 | if (t->globals == NULL && t->locals == NULL && ! t->used) | |
3172 | def.vd_flags |= VER_FLG_WEAK; | |
3173 | def.vd_ndx = t->vernum + 1; | |
3174 | def.vd_cnt = cdeps + 1; | |
3a99b017 | 3175 | def.vd_hash = bfd_elf_hash (t->name); |
252b5132 RH |
3176 | def.vd_aux = sizeof (Elf_External_Verdef); |
3177 | if (t->next != NULL) | |
3178 | def.vd_next = (sizeof (Elf_External_Verdef) | |
3179 | + (cdeps + 1) * sizeof (Elf_External_Verdaux)); | |
3180 | else | |
3181 | def.vd_next = 0; | |
3182 | ||
3183 | _bfd_elf_swap_verdef_out (output_bfd, &def, | |
3184 | (Elf_External_Verdef *) p); | |
3185 | p += sizeof (Elf_External_Verdef); | |
3186 | ||
3187 | defaux.vda_name = h->dynstr_index; | |
3188 | if (t->deps == NULL) | |
3189 | defaux.vda_next = 0; | |
3190 | else | |
3191 | defaux.vda_next = sizeof (Elf_External_Verdaux); | |
3192 | t->name_indx = defaux.vda_name; | |
3193 | ||
3194 | _bfd_elf_swap_verdaux_out (output_bfd, &defaux, | |
3195 | (Elf_External_Verdaux *) p); | |
3196 | p += sizeof (Elf_External_Verdaux); | |
3197 | ||
3198 | for (n = t->deps; n != NULL; n = n->next) | |
3199 | { | |
3200 | if (n->version_needed == NULL) | |
3201 | { | |
3202 | /* This can happen if there was an error in the | |
3203 | version script. */ | |
3204 | defaux.vda_name = 0; | |
3205 | } | |
3206 | else | |
3207 | defaux.vda_name = n->version_needed->name_indx; | |
3208 | if (n->next == NULL) | |
3209 | defaux.vda_next = 0; | |
3210 | else | |
3211 | defaux.vda_next = sizeof (Elf_External_Verdaux); | |
3212 | ||
3213 | _bfd_elf_swap_verdaux_out (output_bfd, &defaux, | |
3214 | (Elf_External_Verdaux *) p); | |
3215 | p += sizeof (Elf_External_Verdaux); | |
3216 | } | |
3217 | } | |
3218 | ||
3219 | if (! elf_add_dynamic_entry (info, DT_VERDEF, 0) | |
3220 | || ! elf_add_dynamic_entry (info, DT_VERDEFNUM, cdefs)) | |
3221 | return false; | |
3222 | ||
3223 | elf_tdata (output_bfd)->cverdefs = cdefs; | |
3224 | } | |
3225 | ||
c25373b7 | 3226 | if (info->new_dtags && info->flags) |
d6cf2879 L |
3227 | { |
3228 | if (! elf_add_dynamic_entry (info, DT_FLAGS, info->flags)) | |
3229 | return false; | |
3230 | } | |
3231 | ||
4d538889 | 3232 | if (info->flags_1) |
d6cf2879 L |
3233 | { |
3234 | if (! info->shared) | |
3235 | info->flags_1 &= ~ (DF_1_INITFIRST | |
3236 | | DF_1_NODELETE | |
3237 | | DF_1_NOOPEN); | |
3238 | if (! elf_add_dynamic_entry (info, DT_FLAGS_1, info->flags_1)) | |
3239 | return false; | |
3240 | } | |
3241 | ||
252b5132 RH |
3242 | /* Work out the size of the version reference section. */ |
3243 | ||
3244 | s = bfd_get_section_by_name (dynobj, ".gnu.version_r"); | |
3245 | BFD_ASSERT (s != NULL); | |
3246 | { | |
3247 | struct elf_find_verdep_info sinfo; | |
3248 | ||
3249 | sinfo.output_bfd = output_bfd; | |
3250 | sinfo.info = info; | |
3251 | sinfo.vers = elf_tdata (output_bfd)->cverdefs; | |
3252 | if (sinfo.vers == 0) | |
3253 | sinfo.vers = 1; | |
3254 | sinfo.failed = false; | |
3255 | ||
3256 | elf_link_hash_traverse (elf_hash_table (info), | |
3257 | elf_link_find_version_dependencies, | |
3258 | (PTR) &sinfo); | |
3259 | ||
3260 | if (elf_tdata (output_bfd)->verref == NULL) | |
7f8d5fc9 | 3261 | _bfd_strip_section_from_output (info, s); |
252b5132 RH |
3262 | else |
3263 | { | |
3264 | Elf_Internal_Verneed *t; | |
3265 | unsigned int size; | |
3266 | unsigned int crefs; | |
3267 | bfd_byte *p; | |
3268 | ||
3269 | /* Build the version definition section. */ | |
3270 | size = 0; | |
3271 | crefs = 0; | |
3272 | for (t = elf_tdata (output_bfd)->verref; | |
3273 | t != NULL; | |
3274 | t = t->vn_nextref) | |
3275 | { | |
3276 | Elf_Internal_Vernaux *a; | |
3277 | ||
3278 | size += sizeof (Elf_External_Verneed); | |
3279 | ++crefs; | |
3280 | for (a = t->vn_auxptr; a != NULL; a = a->vna_nextptr) | |
3281 | size += sizeof (Elf_External_Vernaux); | |
3282 | } | |
3283 | ||
3284 | s->_raw_size = size; | |
3285 | s->contents = (bfd_byte *) bfd_alloc (output_bfd, size); | |
3286 | if (s->contents == NULL) | |
3287 | return false; | |
3288 | ||
3289 | p = s->contents; | |
3290 | for (t = elf_tdata (output_bfd)->verref; | |
3291 | t != NULL; | |
3292 | t = t->vn_nextref) | |
3293 | { | |
3294 | unsigned int caux; | |
3295 | Elf_Internal_Vernaux *a; | |
3296 | bfd_size_type indx; | |
3297 | ||
3298 | caux = 0; | |
3299 | for (a = t->vn_auxptr; a != NULL; a = a->vna_nextptr) | |
3300 | ++caux; | |
3301 | ||
3302 | t->vn_version = VER_NEED_CURRENT; | |
3303 | t->vn_cnt = caux; | |
3304 | if (elf_dt_name (t->vn_bfd) != NULL) | |
3305 | indx = _bfd_stringtab_add (elf_hash_table (info)->dynstr, | |
3306 | elf_dt_name (t->vn_bfd), | |
3307 | true, false); | |
3308 | else | |
3309 | indx = _bfd_stringtab_add (elf_hash_table (info)->dynstr, | |
3310 | t->vn_bfd->filename, true, false); | |
3311 | if (indx == (bfd_size_type) -1) | |
3312 | return false; | |
3313 | t->vn_file = indx; | |
3314 | t->vn_aux = sizeof (Elf_External_Verneed); | |
3315 | if (t->vn_nextref == NULL) | |
3316 | t->vn_next = 0; | |
3317 | else | |
3318 | t->vn_next = (sizeof (Elf_External_Verneed) | |
3319 | + caux * sizeof (Elf_External_Vernaux)); | |
3320 | ||
3321 | _bfd_elf_swap_verneed_out (output_bfd, t, | |
3322 | (Elf_External_Verneed *) p); | |
3323 | p += sizeof (Elf_External_Verneed); | |
3324 | ||
3325 | for (a = t->vn_auxptr; a != NULL; a = a->vna_nextptr) | |
3326 | { | |
3a99b017 | 3327 | a->vna_hash = bfd_elf_hash (a->vna_nodename); |
252b5132 RH |
3328 | indx = _bfd_stringtab_add (elf_hash_table (info)->dynstr, |
3329 | a->vna_nodename, true, false); | |
3330 | if (indx == (bfd_size_type) -1) | |
3331 | return false; | |
3332 | a->vna_name = indx; | |
3333 | if (a->vna_nextptr == NULL) | |
3334 | a->vna_next = 0; | |
3335 | else | |
3336 | a->vna_next = sizeof (Elf_External_Vernaux); | |
3337 | ||
3338 | _bfd_elf_swap_vernaux_out (output_bfd, a, | |
3339 | (Elf_External_Vernaux *) p); | |
3340 | p += sizeof (Elf_External_Vernaux); | |
3341 | } | |
3342 | } | |
3343 | ||
3344 | if (! elf_add_dynamic_entry (info, DT_VERNEED, 0) | |
3345 | || ! elf_add_dynamic_entry (info, DT_VERNEEDNUM, crefs)) | |
3346 | return false; | |
3347 | ||
3348 | elf_tdata (output_bfd)->cverrefs = crefs; | |
3349 | } | |
3350 | } | |
3351 | ||
30b30c21 RH |
3352 | /* Assign dynsym indicies. In a shared library we generate a |
3353 | section symbol for each output section, which come first. | |
3354 | Next come all of the back-end allocated local dynamic syms, | |
3355 | followed by the rest of the global symbols. */ | |
3356 | ||
3357 | dynsymcount = _bfd_elf_link_renumber_dynsyms (output_bfd, info); | |
252b5132 RH |
3358 | |
3359 | /* Work out the size of the symbol version section. */ | |
3360 | s = bfd_get_section_by_name (dynobj, ".gnu.version"); | |
3361 | BFD_ASSERT (s != NULL); | |
3362 | if (dynsymcount == 0 | |
3363 | || (verdefs == NULL && elf_tdata (output_bfd)->verref == NULL)) | |
3364 | { | |
7f8d5fc9 | 3365 | _bfd_strip_section_from_output (info, s); |
42751cf3 MM |
3366 | /* The DYNSYMCOUNT might have changed if we were going to |
3367 | output a dynamic symbol table entry for S. */ | |
30b30c21 | 3368 | dynsymcount = _bfd_elf_link_renumber_dynsyms (output_bfd, info); |
252b5132 RH |
3369 | } |
3370 | else | |
3371 | { | |
3372 | s->_raw_size = dynsymcount * sizeof (Elf_External_Versym); | |
3373 | s->contents = (bfd_byte *) bfd_zalloc (output_bfd, s->_raw_size); | |
3374 | if (s->contents == NULL) | |
3375 | return false; | |
3376 | ||
3377 | if (! elf_add_dynamic_entry (info, DT_VERSYM, 0)) | |
3378 | return false; | |
3379 | } | |
3380 | ||
3381 | /* Set the size of the .dynsym and .hash sections. We counted | |
3382 | the number of dynamic symbols in elf_link_add_object_symbols. | |
3383 | We will build the contents of .dynsym and .hash when we build | |
3384 | the final symbol table, because until then we do not know the | |
3385 | correct value to give the symbols. We built the .dynstr | |
3386 | section as we went along in elf_link_add_object_symbols. */ | |
3387 | s = bfd_get_section_by_name (dynobj, ".dynsym"); | |
3388 | BFD_ASSERT (s != NULL); | |
3389 | s->_raw_size = dynsymcount * sizeof (Elf_External_Sym); | |
3390 | s->contents = (bfd_byte *) bfd_alloc (output_bfd, s->_raw_size); | |
3391 | if (s->contents == NULL && s->_raw_size != 0) | |
3392 | return false; | |
3393 | ||
fc8c40a0 AM |
3394 | if (dynsymcount != 0) |
3395 | { | |
3396 | Elf_Internal_Sym isym; | |
3397 | ||
3398 | /* The first entry in .dynsym is a dummy symbol. */ | |
3399 | isym.st_value = 0; | |
3400 | isym.st_size = 0; | |
3401 | isym.st_name = 0; | |
3402 | isym.st_info = 0; | |
3403 | isym.st_other = 0; | |
3404 | isym.st_shndx = 0; | |
3405 | elf_swap_symbol_out (output_bfd, &isym, | |
3406 | (PTR) (Elf_External_Sym *) s->contents); | |
3407 | } | |
252b5132 RH |
3408 | |
3409 | /* Compute the size of the hashing table. As a side effect this | |
3410 | computes the hash values for all the names we export. */ | |
3411 | bucketcount = compute_bucket_count (info); | |
3412 | ||
3413 | s = bfd_get_section_by_name (dynobj, ".hash"); | |
3414 | BFD_ASSERT (s != NULL); | |
c7ac6ff8 MM |
3415 | hash_entry_size = elf_section_data (s)->this_hdr.sh_entsize; |
3416 | s->_raw_size = ((2 + bucketcount + dynsymcount) * hash_entry_size); | |
252b5132 RH |
3417 | s->contents = (bfd_byte *) bfd_alloc (output_bfd, s->_raw_size); |
3418 | if (s->contents == NULL) | |
3419 | return false; | |
3420 | memset (s->contents, 0, (size_t) s->_raw_size); | |
3421 | ||
c7ac6ff8 MM |
3422 | bfd_put (8 * hash_entry_size, output_bfd, bucketcount, s->contents); |
3423 | bfd_put (8 * hash_entry_size, output_bfd, dynsymcount, | |
3424 | s->contents + hash_entry_size); | |
252b5132 RH |
3425 | |
3426 | elf_hash_table (info)->bucketcount = bucketcount; | |
3427 | ||
3428 | s = bfd_get_section_by_name (dynobj, ".dynstr"); | |
3429 | BFD_ASSERT (s != NULL); | |
3430 | s->_raw_size = _bfd_stringtab_size (elf_hash_table (info)->dynstr); | |
3431 | ||
3432 | if (! elf_add_dynamic_entry (info, DT_NULL, 0)) | |
3433 | return false; | |
3434 | } | |
3435 | ||
3436 | return true; | |
3437 | } | |
3438 | \f | |
3439 | /* Fix up the flags for a symbol. This handles various cases which | |
3440 | can only be fixed after all the input files are seen. This is | |
3441 | currently called by both adjust_dynamic_symbol and | |
3442 | assign_sym_version, which is unnecessary but perhaps more robust in | |
3443 | the face of future changes. */ | |
3444 | ||
3445 | static boolean | |
3446 | elf_fix_symbol_flags (h, eif) | |
3447 | struct elf_link_hash_entry *h; | |
3448 | struct elf_info_failed *eif; | |
3449 | { | |
3450 | /* If this symbol was mentioned in a non-ELF file, try to set | |
3451 | DEF_REGULAR and REF_REGULAR correctly. This is the only way to | |
3452 | permit a non-ELF file to correctly refer to a symbol defined in | |
3453 | an ELF dynamic object. */ | |
3454 | if ((h->elf_link_hash_flags & ELF_LINK_NON_ELF) != 0) | |
3455 | { | |
94b6c40a L |
3456 | while (h->root.type == bfd_link_hash_indirect) |
3457 | h = (struct elf_link_hash_entry *) h->root.u.i.link; | |
3458 | ||
252b5132 RH |
3459 | if (h->root.type != bfd_link_hash_defined |
3460 | && h->root.type != bfd_link_hash_defweak) | |
3461 | h->elf_link_hash_flags |= (ELF_LINK_HASH_REF_REGULAR | |
3462 | | ELF_LINK_HASH_REF_REGULAR_NONWEAK); | |
3463 | else | |
3464 | { | |
3465 | if (h->root.u.def.section->owner != NULL | |
3466 | && (bfd_get_flavour (h->root.u.def.section->owner) | |
3467 | == bfd_target_elf_flavour)) | |
3468 | h->elf_link_hash_flags |= (ELF_LINK_HASH_REF_REGULAR | |
3469 | | ELF_LINK_HASH_REF_REGULAR_NONWEAK); | |
3470 | else | |
3471 | h->elf_link_hash_flags |= ELF_LINK_HASH_DEF_REGULAR; | |
3472 | } | |
3473 | ||
3474 | if (h->dynindx == -1 | |
3475 | && ((h->elf_link_hash_flags & ELF_LINK_HASH_DEF_DYNAMIC) != 0 | |
3476 | || (h->elf_link_hash_flags & ELF_LINK_HASH_REF_DYNAMIC) != 0)) | |
3477 | { | |
3478 | if (! _bfd_elf_link_record_dynamic_symbol (eif->info, h)) | |
3479 | { | |
3480 | eif->failed = true; | |
3481 | return false; | |
3482 | } | |
3483 | } | |
3484 | } | |
3485 | else | |
3486 | { | |
3487 | /* Unfortunately, ELF_LINK_NON_ELF is only correct if the symbol | |
3488 | was first seen in a non-ELF file. Fortunately, if the symbol | |
3489 | was first seen in an ELF file, we're probably OK unless the | |
3490 | symbol was defined in a non-ELF file. Catch that case here. | |
3491 | FIXME: We're still in trouble if the symbol was first seen in | |
3492 | a dynamic object, and then later in a non-ELF regular object. */ | |
3493 | if ((h->root.type == bfd_link_hash_defined | |
3494 | || h->root.type == bfd_link_hash_defweak) | |
3495 | && (h->elf_link_hash_flags & ELF_LINK_HASH_DEF_REGULAR) == 0 | |
3496 | && (h->root.u.def.section->owner != NULL | |
3497 | ? (bfd_get_flavour (h->root.u.def.section->owner) | |
3498 | != bfd_target_elf_flavour) | |
3499 | : (bfd_is_abs_section (h->root.u.def.section) | |
3500 | && (h->elf_link_hash_flags | |
3501 | & ELF_LINK_HASH_DEF_DYNAMIC) == 0))) | |
3502 | h->elf_link_hash_flags |= ELF_LINK_HASH_DEF_REGULAR; | |
3503 | } | |
3504 | ||
3505 | /* If this is a final link, and the symbol was defined as a common | |
3506 | symbol in a regular object file, and there was no definition in | |
3507 | any dynamic object, then the linker will have allocated space for | |
3508 | the symbol in a common section but the ELF_LINK_HASH_DEF_REGULAR | |
3509 | flag will not have been set. */ | |
3510 | if (h->root.type == bfd_link_hash_defined | |
3511 | && (h->elf_link_hash_flags & ELF_LINK_HASH_DEF_REGULAR) == 0 | |
3512 | && (h->elf_link_hash_flags & ELF_LINK_HASH_REF_REGULAR) != 0 | |
3513 | && (h->elf_link_hash_flags & ELF_LINK_HASH_DEF_DYNAMIC) == 0 | |
3514 | && (h->root.u.def.section->owner->flags & DYNAMIC) == 0) | |
3515 | h->elf_link_hash_flags |= ELF_LINK_HASH_DEF_REGULAR; | |
3516 | ||
3517 | /* If -Bsymbolic was used (which means to bind references to global | |
3518 | symbols to the definition within the shared object), and this | |
3519 | symbol was defined in a regular object, then it actually doesn't | |
0444bdd4 L |
3520 | need a PLT entry. Likewise, if the symbol has any kind of |
3521 | visibility (internal, hidden, or protected), it doesn't need a | |
3522 | PLT. */ | |
252b5132 RH |
3523 | if ((h->elf_link_hash_flags & ELF_LINK_HASH_NEEDS_PLT) != 0 |
3524 | && eif->info->shared | |
0444bdd4 | 3525 | && (eif->info->symbolic || ELF_ST_VISIBILITY (h->other)) |
252b5132 RH |
3526 | && (h->elf_link_hash_flags & ELF_LINK_HASH_DEF_REGULAR) != 0) |
3527 | { | |
3528 | h->elf_link_hash_flags &=~ ELF_LINK_HASH_NEEDS_PLT; | |
3529 | h->plt.offset = (bfd_vma) -1; | |
3530 | } | |
3531 | ||
fc4cc5bb ILT |
3532 | /* If this is a weak defined symbol in a dynamic object, and we know |
3533 | the real definition in the dynamic object, copy interesting flags | |
3534 | over to the real definition. */ | |
3535 | if (h->weakdef != NULL) | |
3536 | { | |
3537 | struct elf_link_hash_entry *weakdef; | |
3538 | ||
3539 | BFD_ASSERT (h->root.type == bfd_link_hash_defined | |
3540 | || h->root.type == bfd_link_hash_defweak); | |
3541 | weakdef = h->weakdef; | |
3542 | BFD_ASSERT (weakdef->root.type == bfd_link_hash_defined | |
3543 | || weakdef->root.type == bfd_link_hash_defweak); | |
3544 | BFD_ASSERT (weakdef->elf_link_hash_flags & ELF_LINK_HASH_DEF_DYNAMIC); | |
3545 | ||
3546 | /* If the real definition is defined by a regular object file, | |
3547 | don't do anything special. See the longer description in | |
3548 | elf_adjust_dynamic_symbol, below. */ | |
3549 | if ((weakdef->elf_link_hash_flags & ELF_LINK_HASH_DEF_REGULAR) != 0) | |
3550 | h->weakdef = NULL; | |
3551 | else | |
3552 | weakdef->elf_link_hash_flags |= | |
3553 | (h->elf_link_hash_flags | |
3554 | & (ELF_LINK_HASH_REF_REGULAR | |
3555 | | ELF_LINK_HASH_REF_REGULAR_NONWEAK | |
3556 | | ELF_LINK_NON_GOT_REF)); | |
3557 | } | |
3558 | ||
252b5132 RH |
3559 | return true; |
3560 | } | |
3561 | ||
3562 | /* Make the backend pick a good value for a dynamic symbol. This is | |
3563 | called via elf_link_hash_traverse, and also calls itself | |
3564 | recursively. */ | |
3565 | ||
3566 | static boolean | |
3567 | elf_adjust_dynamic_symbol (h, data) | |
3568 | struct elf_link_hash_entry *h; | |
3569 | PTR data; | |
3570 | { | |
3571 | struct elf_info_failed *eif = (struct elf_info_failed *) data; | |
3572 | bfd *dynobj; | |
3573 | struct elf_backend_data *bed; | |
3574 | ||
3575 | /* Ignore indirect symbols. These are added by the versioning code. */ | |
3576 | if (h->root.type == bfd_link_hash_indirect) | |
3577 | return true; | |
3578 | ||
3579 | /* Fix the symbol flags. */ | |
3580 | if (! elf_fix_symbol_flags (h, eif)) | |
3581 | return false; | |
3582 | ||
3583 | /* If this symbol does not require a PLT entry, and it is not | |
3584 | defined by a dynamic object, or is not referenced by a regular | |
3585 | object, ignore it. We do have to handle a weak defined symbol, | |
3586 | even if no regular object refers to it, if we decided to add it | |
3587 | to the dynamic symbol table. FIXME: Do we normally need to worry | |
3588 | about symbols which are defined by one dynamic object and | |
3589 | referenced by another one? */ | |
3590 | if ((h->elf_link_hash_flags & ELF_LINK_HASH_NEEDS_PLT) == 0 | |
3591 | && ((h->elf_link_hash_flags & ELF_LINK_HASH_DEF_REGULAR) != 0 | |
3592 | || (h->elf_link_hash_flags & ELF_LINK_HASH_DEF_DYNAMIC) == 0 | |
3593 | || ((h->elf_link_hash_flags & ELF_LINK_HASH_REF_REGULAR) == 0 | |
3594 | && (h->weakdef == NULL || h->weakdef->dynindx == -1)))) | |
3595 | { | |
3596 | h->plt.offset = (bfd_vma) -1; | |
3597 | return true; | |
3598 | } | |
3599 | ||
3600 | /* If we've already adjusted this symbol, don't do it again. This | |
3601 | can happen via a recursive call. */ | |
3602 | if ((h->elf_link_hash_flags & ELF_LINK_HASH_DYNAMIC_ADJUSTED) != 0) | |
3603 | return true; | |
3604 | ||
3605 | /* Don't look at this symbol again. Note that we must set this | |
3606 | after checking the above conditions, because we may look at a | |
3607 | symbol once, decide not to do anything, and then get called | |
3608 | recursively later after REF_REGULAR is set below. */ | |
3609 | h->elf_link_hash_flags |= ELF_LINK_HASH_DYNAMIC_ADJUSTED; | |
3610 | ||
3611 | /* If this is a weak definition, and we know a real definition, and | |
3612 | the real symbol is not itself defined by a regular object file, | |
3613 | then get a good value for the real definition. We handle the | |
3614 | real symbol first, for the convenience of the backend routine. | |
3615 | ||
3616 | Note that there is a confusing case here. If the real definition | |
3617 | is defined by a regular object file, we don't get the real symbol | |
3618 | from the dynamic object, but we do get the weak symbol. If the | |
3619 | processor backend uses a COPY reloc, then if some routine in the | |
3620 | dynamic object changes the real symbol, we will not see that | |
3621 | change in the corresponding weak symbol. This is the way other | |
3622 | ELF linkers work as well, and seems to be a result of the shared | |
3623 | library model. | |
3624 | ||
3625 | I will clarify this issue. Most SVR4 shared libraries define the | |
3626 | variable _timezone and define timezone as a weak synonym. The | |
3627 | tzset call changes _timezone. If you write | |
3628 | extern int timezone; | |
3629 | int _timezone = 5; | |
3630 | int main () { tzset (); printf ("%d %d\n", timezone, _timezone); } | |
3631 | you might expect that, since timezone is a synonym for _timezone, | |
3632 | the same number will print both times. However, if the processor | |
3633 | backend uses a COPY reloc, then actually timezone will be copied | |
3634 | into your process image, and, since you define _timezone | |
3635 | yourself, _timezone will not. Thus timezone and _timezone will | |
3636 | wind up at different memory locations. The tzset call will set | |
3637 | _timezone, leaving timezone unchanged. */ | |
3638 | ||
3639 | if (h->weakdef != NULL) | |
3640 | { | |
fc4cc5bb ILT |
3641 | /* If we get to this point, we know there is an implicit |
3642 | reference by a regular object file via the weak symbol H. | |
3643 | FIXME: Is this really true? What if the traversal finds | |
3644 | H->WEAKDEF before it finds H? */ | |
3645 | h->weakdef->elf_link_hash_flags |= ELF_LINK_HASH_REF_REGULAR; | |
252b5132 | 3646 | |
fc4cc5bb ILT |
3647 | if (! elf_adjust_dynamic_symbol (h->weakdef, (PTR) eif)) |
3648 | return false; | |
252b5132 RH |
3649 | } |
3650 | ||
3651 | /* If a symbol has no type and no size and does not require a PLT | |
3652 | entry, then we are probably about to do the wrong thing here: we | |
3653 | are probably going to create a COPY reloc for an empty object. | |
3654 | This case can arise when a shared object is built with assembly | |
3655 | code, and the assembly code fails to set the symbol type. */ | |
3656 | if (h->size == 0 | |
3657 | && h->type == STT_NOTYPE | |
3658 | && (h->elf_link_hash_flags & ELF_LINK_HASH_NEEDS_PLT) == 0) | |
3659 | (*_bfd_error_handler) | |
3660 | (_("warning: type and size of dynamic symbol `%s' are not defined"), | |
3661 | h->root.root.string); | |
3662 | ||
3663 | dynobj = elf_hash_table (eif->info)->dynobj; | |
3664 | bed = get_elf_backend_data (dynobj); | |
3665 | if (! (*bed->elf_backend_adjust_dynamic_symbol) (eif->info, h)) | |
3666 | { | |
3667 | eif->failed = true; | |
3668 | return false; | |
3669 | } | |
3670 | ||
3671 | return true; | |
3672 | } | |
3673 | \f | |
3674 | /* This routine is used to export all defined symbols into the dynamic | |
3675 | symbol table. It is called via elf_link_hash_traverse. */ | |
3676 | ||
3677 | static boolean | |
3678 | elf_export_symbol (h, data) | |
3679 | struct elf_link_hash_entry *h; | |
3680 | PTR data; | |
3681 | { | |
3682 | struct elf_info_failed *eif = (struct elf_info_failed *) data; | |
3683 | ||
3684 | /* Ignore indirect symbols. These are added by the versioning code. */ | |
3685 | if (h->root.type == bfd_link_hash_indirect) | |
3686 | return true; | |
3687 | ||
3688 | if (h->dynindx == -1 | |
3689 | && (h->elf_link_hash_flags | |
3690 | & (ELF_LINK_HASH_DEF_REGULAR | ELF_LINK_HASH_REF_REGULAR)) != 0) | |
3691 | { | |
3692 | if (! _bfd_elf_link_record_dynamic_symbol (eif->info, h)) | |
3693 | { | |
3694 | eif->failed = true; | |
3695 | return false; | |
3696 | } | |
3697 | } | |
3698 | ||
3699 | return true; | |
3700 | } | |
3701 | \f | |
3702 | /* Look through the symbols which are defined in other shared | |
3703 | libraries and referenced here. Update the list of version | |
3704 | dependencies. This will be put into the .gnu.version_r section. | |
3705 | This function is called via elf_link_hash_traverse. */ | |
3706 | ||
3707 | static boolean | |
3708 | elf_link_find_version_dependencies (h, data) | |
3709 | struct elf_link_hash_entry *h; | |
3710 | PTR data; | |
3711 | { | |
3712 | struct elf_find_verdep_info *rinfo = (struct elf_find_verdep_info *) data; | |
3713 | Elf_Internal_Verneed *t; | |
3714 | Elf_Internal_Vernaux *a; | |
3715 | ||
3716 | /* We only care about symbols defined in shared objects with version | |
3717 | information. */ | |
3718 | if ((h->elf_link_hash_flags & ELF_LINK_HASH_DEF_DYNAMIC) == 0 | |
3719 | || (h->elf_link_hash_flags & ELF_LINK_HASH_DEF_REGULAR) != 0 | |
3720 | || h->dynindx == -1 | |
3721 | || h->verinfo.verdef == NULL) | |
3722 | return true; | |
3723 | ||
3724 | /* See if we already know about this version. */ | |
3725 | for (t = elf_tdata (rinfo->output_bfd)->verref; t != NULL; t = t->vn_nextref) | |
3726 | { | |
3727 | if (t->vn_bfd != h->verinfo.verdef->vd_bfd) | |
3728 | continue; | |
3729 | ||
3730 | for (a = t->vn_auxptr; a != NULL; a = a->vna_nextptr) | |
3731 | if (a->vna_nodename == h->verinfo.verdef->vd_nodename) | |
3732 | return true; | |
3733 | ||
3734 | break; | |
3735 | } | |
3736 | ||
3737 | /* This is a new version. Add it to tree we are building. */ | |
3738 | ||
3739 | if (t == NULL) | |
3740 | { | |
3741 | t = (Elf_Internal_Verneed *) bfd_zalloc (rinfo->output_bfd, sizeof *t); | |
3742 | if (t == NULL) | |
3743 | { | |
3744 | rinfo->failed = true; | |
3745 | return false; | |
3746 | } | |
3747 | ||
3748 | t->vn_bfd = h->verinfo.verdef->vd_bfd; | |
3749 | t->vn_nextref = elf_tdata (rinfo->output_bfd)->verref; | |
3750 | elf_tdata (rinfo->output_bfd)->verref = t; | |
3751 | } | |
3752 | ||
3753 | a = (Elf_Internal_Vernaux *) bfd_zalloc (rinfo->output_bfd, sizeof *a); | |
3754 | ||
3755 | /* Note that we are copying a string pointer here, and testing it | |
3756 | above. If bfd_elf_string_from_elf_section is ever changed to | |
3757 | discard the string data when low in memory, this will have to be | |
3758 | fixed. */ | |
3759 | a->vna_nodename = h->verinfo.verdef->vd_nodename; | |
3760 | ||
3761 | a->vna_flags = h->verinfo.verdef->vd_flags; | |
3762 | a->vna_nextptr = t->vn_auxptr; | |
3763 | ||
3764 | h->verinfo.verdef->vd_exp_refno = rinfo->vers; | |
3765 | ++rinfo->vers; | |
3766 | ||
3767 | a->vna_other = h->verinfo.verdef->vd_exp_refno + 1; | |
3768 | ||
3769 | t->vn_auxptr = a; | |
3770 | ||
3771 | return true; | |
3772 | } | |
3773 | ||
3774 | /* Figure out appropriate versions for all the symbols. We may not | |
3775 | have the version number script until we have read all of the input | |
3776 | files, so until that point we don't know which symbols should be | |
3777 | local. This function is called via elf_link_hash_traverse. */ | |
3778 | ||
3779 | static boolean | |
3780 | elf_link_assign_sym_version (h, data) | |
3781 | struct elf_link_hash_entry *h; | |
3782 | PTR data; | |
3783 | { | |
3784 | struct elf_assign_sym_version_info *sinfo = | |
3785 | (struct elf_assign_sym_version_info *) data; | |
3786 | struct bfd_link_info *info = sinfo->info; | |
c61b8717 | 3787 | struct elf_backend_data *bed; |
252b5132 RH |
3788 | struct elf_info_failed eif; |
3789 | char *p; | |
3790 | ||
3791 | /* Fix the symbol flags. */ | |
3792 | eif.failed = false; | |
3793 | eif.info = info; | |
3794 | if (! elf_fix_symbol_flags (h, &eif)) | |
3795 | { | |
3796 | if (eif.failed) | |
3797 | sinfo->failed = true; | |
3798 | return false; | |
3799 | } | |
3800 | ||
3801 | /* We only need version numbers for symbols defined in regular | |
3802 | objects. */ | |
3803 | if ((h->elf_link_hash_flags & ELF_LINK_HASH_DEF_REGULAR) == 0) | |
3804 | return true; | |
3805 | ||
c61b8717 | 3806 | bed = get_elf_backend_data (sinfo->output_bfd); |
252b5132 RH |
3807 | p = strchr (h->root.root.string, ELF_VER_CHR); |
3808 | if (p != NULL && h->verinfo.vertree == NULL) | |
3809 | { | |
3810 | struct bfd_elf_version_tree *t; | |
3811 | boolean hidden; | |
3812 | ||
3813 | hidden = true; | |
3814 | ||
3815 | /* There are two consecutive ELF_VER_CHR characters if this is | |
3816 | not a hidden symbol. */ | |
3817 | ++p; | |
3818 | if (*p == ELF_VER_CHR) | |
3819 | { | |
3820 | hidden = false; | |
3821 | ++p; | |
3822 | } | |
3823 | ||
3824 | /* If there is no version string, we can just return out. */ | |
3825 | if (*p == '\0') | |
3826 | { | |
3827 | if (hidden) | |
3828 | h->elf_link_hash_flags |= ELF_LINK_HIDDEN; | |
3829 | return true; | |
3830 | } | |
3831 | ||
3832 | /* Look for the version. If we find it, it is no longer weak. */ | |
3833 | for (t = sinfo->verdefs; t != NULL; t = t->next) | |
3834 | { | |
3835 | if (strcmp (t->name, p) == 0) | |
3836 | { | |
3837 | int len; | |
3838 | char *alc; | |
3839 | struct bfd_elf_version_expr *d; | |
3840 | ||
3841 | len = p - h->root.root.string; | |
3842 | alc = bfd_alloc (sinfo->output_bfd, len); | |
3843 | if (alc == NULL) | |
3844 | return false; | |
3845 | strncpy (alc, h->root.root.string, len - 1); | |
3846 | alc[len - 1] = '\0'; | |
3847 | if (alc[len - 2] == ELF_VER_CHR) | |
3848 | alc[len - 2] = '\0'; | |
3849 | ||
3850 | h->verinfo.vertree = t; | |
3851 | t->used = true; | |
3852 | d = NULL; | |
3853 | ||
3854 | if (t->globals != NULL) | |
3855 | { | |
3856 | for (d = t->globals; d != NULL; d = d->next) | |
3857 | if ((*d->match) (d, alc)) | |
3858 | break; | |
3859 | } | |
3860 | ||
3861 | /* See if there is anything to force this symbol to | |
3862 | local scope. */ | |
3863 | if (d == NULL && t->locals != NULL) | |
3864 | { | |
3865 | for (d = t->locals; d != NULL; d = d->next) | |
3866 | { | |
3867 | if ((*d->match) (d, alc)) | |
3868 | { | |
3869 | if (h->dynindx != -1 | |
3870 | && info->shared | |
3871 | && ! sinfo->export_dynamic) | |
3872 | { | |
252b5132 | 3873 | h->elf_link_hash_flags |= ELF_LINK_FORCED_LOCAL; |
f41cbf03 | 3874 | (*bed->elf_backend_hide_symbol) (info, h); |
252b5132 RH |
3875 | /* FIXME: The name of the symbol has |
3876 | already been recorded in the dynamic | |
3877 | string table section. */ | |
3878 | } | |
3879 | ||
3880 | break; | |
3881 | } | |
3882 | } | |
3883 | } | |
3884 | ||
3885 | bfd_release (sinfo->output_bfd, alc); | |
3886 | break; | |
3887 | } | |
3888 | } | |
3889 | ||
3890 | /* If we are building an application, we need to create a | |
3891 | version node for this version. */ | |
3892 | if (t == NULL && ! info->shared) | |
3893 | { | |
3894 | struct bfd_elf_version_tree **pp; | |
3895 | int version_index; | |
3896 | ||
3897 | /* If we aren't going to export this symbol, we don't need | |
3898 | to worry about it. */ | |
3899 | if (h->dynindx == -1) | |
3900 | return true; | |
3901 | ||
3902 | t = ((struct bfd_elf_version_tree *) | |
3903 | bfd_alloc (sinfo->output_bfd, sizeof *t)); | |
3904 | if (t == NULL) | |
3905 | { | |
3906 | sinfo->failed = true; | |
3907 | return false; | |
3908 | } | |
3909 | ||
3910 | t->next = NULL; | |
3911 | t->name = p; | |
3912 | t->globals = NULL; | |
3913 | t->locals = NULL; | |
3914 | t->deps = NULL; | |
3915 | t->name_indx = (unsigned int) -1; | |
3916 | t->used = true; | |
3917 | ||
3918 | version_index = 1; | |
3919 | for (pp = &sinfo->verdefs; *pp != NULL; pp = &(*pp)->next) | |
3920 | ++version_index; | |
3921 | t->vernum = version_index; | |
3922 | ||
3923 | *pp = t; | |
3924 | ||
3925 | h->verinfo.vertree = t; | |
3926 | } | |
3927 | else if (t == NULL) | |
3928 | { | |
3929 | /* We could not find the version for a symbol when | |
3930 | generating a shared archive. Return an error. */ | |
3931 | (*_bfd_error_handler) | |
3932 | (_("%s: undefined versioned symbol name %s"), | |
3933 | bfd_get_filename (sinfo->output_bfd), h->root.root.string); | |
3934 | bfd_set_error (bfd_error_bad_value); | |
3935 | sinfo->failed = true; | |
3936 | return false; | |
3937 | } | |
3938 | ||
3939 | if (hidden) | |
3940 | h->elf_link_hash_flags |= ELF_LINK_HIDDEN; | |
3941 | } | |
3942 | ||
3943 | /* If we don't have a version for this symbol, see if we can find | |
3944 | something. */ | |
3945 | if (h->verinfo.vertree == NULL && sinfo->verdefs != NULL) | |
3946 | { | |
3947 | struct bfd_elf_version_tree *t; | |
3948 | struct bfd_elf_version_tree *deflt; | |
3949 | struct bfd_elf_version_expr *d; | |
3950 | ||
3951 | /* See if can find what version this symbol is in. If the | |
3952 | symbol is supposed to be local, then don't actually register | |
3953 | it. */ | |
3954 | deflt = NULL; | |
3955 | for (t = sinfo->verdefs; t != NULL; t = t->next) | |
3956 | { | |
3957 | if (t->globals != NULL) | |
3958 | { | |
3959 | for (d = t->globals; d != NULL; d = d->next) | |
3960 | { | |
3961 | if ((*d->match) (d, h->root.root.string)) | |
3962 | { | |
3963 | h->verinfo.vertree = t; | |
3964 | break; | |
3965 | } | |
3966 | } | |
3967 | ||
3968 | if (d != NULL) | |
3969 | break; | |
3970 | } | |
3971 | ||
3972 | if (t->locals != NULL) | |
3973 | { | |
3974 | for (d = t->locals; d != NULL; d = d->next) | |
3975 | { | |
3976 | if (d->pattern[0] == '*' && d->pattern[1] == '\0') | |
3977 | deflt = t; | |
3978 | else if ((*d->match) (d, h->root.root.string)) | |
3979 | { | |
3980 | h->verinfo.vertree = t; | |
3981 | if (h->dynindx != -1 | |
3982 | && info->shared | |
3983 | && ! sinfo->export_dynamic) | |
3984 | { | |
252b5132 | 3985 | h->elf_link_hash_flags |= ELF_LINK_FORCED_LOCAL; |
f41cbf03 | 3986 | (*bed->elf_backend_hide_symbol) (info, h); |
252b5132 RH |
3987 | /* FIXME: The name of the symbol has already |
3988 | been recorded in the dynamic string table | |
3989 | section. */ | |
3990 | } | |
3991 | break; | |
3992 | } | |
3993 | } | |
3994 | ||
3995 | if (d != NULL) | |
3996 | break; | |
3997 | } | |
3998 | } | |
3999 | ||
4000 | if (deflt != NULL && h->verinfo.vertree == NULL) | |
4001 | { | |
4002 | h->verinfo.vertree = deflt; | |
4003 | if (h->dynindx != -1 | |
4004 | && info->shared | |
4005 | && ! sinfo->export_dynamic) | |
4006 | { | |
252b5132 | 4007 | h->elf_link_hash_flags |= ELF_LINK_FORCED_LOCAL; |
f41cbf03 | 4008 | (*bed->elf_backend_hide_symbol) (info, h); |
252b5132 RH |
4009 | /* FIXME: The name of the symbol has already been |
4010 | recorded in the dynamic string table section. */ | |
4011 | } | |
4012 | } | |
4013 | } | |
4014 | ||
4015 | return true; | |
4016 | } | |
252b5132 RH |
4017 | \f |
4018 | /* Final phase of ELF linker. */ | |
4019 | ||
4020 | /* A structure we use to avoid passing large numbers of arguments. */ | |
4021 | ||
4022 | struct elf_final_link_info | |
4023 | { | |
4024 | /* General link information. */ | |
4025 | struct bfd_link_info *info; | |
4026 | /* Output BFD. */ | |
4027 | bfd *output_bfd; | |
4028 | /* Symbol string table. */ | |
4029 | struct bfd_strtab_hash *symstrtab; | |
4030 | /* .dynsym section. */ | |
4031 | asection *dynsym_sec; | |
4032 | /* .hash section. */ | |
4033 | asection *hash_sec; | |
4034 | /* symbol version section (.gnu.version). */ | |
4035 | asection *symver_sec; | |
4036 | /* Buffer large enough to hold contents of any section. */ | |
4037 | bfd_byte *contents; | |
4038 | /* Buffer large enough to hold external relocs of any section. */ | |
4039 | PTR external_relocs; | |
4040 | /* Buffer large enough to hold internal relocs of any section. */ | |
4041 | Elf_Internal_Rela *internal_relocs; | |
4042 | /* Buffer large enough to hold external local symbols of any input | |
4043 | BFD. */ | |
4044 | Elf_External_Sym *external_syms; | |
4045 | /* Buffer large enough to hold internal local symbols of any input | |
4046 | BFD. */ | |
4047 | Elf_Internal_Sym *internal_syms; | |
4048 | /* Array large enough to hold a symbol index for each local symbol | |
4049 | of any input BFD. */ | |
4050 | long *indices; | |
4051 | /* Array large enough to hold a section pointer for each local | |
4052 | symbol of any input BFD. */ | |
4053 | asection **sections; | |
4054 | /* Buffer to hold swapped out symbols. */ | |
4055 | Elf_External_Sym *symbuf; | |
4056 | /* Number of swapped out symbols in buffer. */ | |
4057 | size_t symbuf_count; | |
4058 | /* Number of symbols which fit in symbuf. */ | |
4059 | size_t symbuf_size; | |
4060 | }; | |
4061 | ||
4062 | static boolean elf_link_output_sym | |
4063 | PARAMS ((struct elf_final_link_info *, const char *, | |
4064 | Elf_Internal_Sym *, asection *)); | |
4065 | static boolean elf_link_flush_output_syms | |
4066 | PARAMS ((struct elf_final_link_info *)); | |
4067 | static boolean elf_link_output_extsym | |
4068 | PARAMS ((struct elf_link_hash_entry *, PTR)); | |
4069 | static boolean elf_link_input_bfd | |
4070 | PARAMS ((struct elf_final_link_info *, bfd *)); | |
4071 | static boolean elf_reloc_link_order | |
4072 | PARAMS ((bfd *, struct bfd_link_info *, asection *, | |
4073 | struct bfd_link_order *)); | |
4074 | ||
4075 | /* This struct is used to pass information to elf_link_output_extsym. */ | |
4076 | ||
4077 | struct elf_outext_info | |
4078 | { | |
4079 | boolean failed; | |
4080 | boolean localsyms; | |
4081 | struct elf_final_link_info *finfo; | |
4082 | }; | |
4083 | ||
23bc299b MM |
4084 | /* Compute the size of, and allocate space for, REL_HDR which is the |
4085 | section header for a section containing relocations for O. */ | |
4086 | ||
4087 | static boolean | |
4088 | elf_link_size_reloc_section (abfd, rel_hdr, o) | |
4089 | bfd *abfd; | |
4090 | Elf_Internal_Shdr *rel_hdr; | |
4091 | asection *o; | |
4092 | { | |
4093 | register struct elf_link_hash_entry **p, **pend; | |
b037af20 | 4094 | unsigned reloc_count; |
23bc299b | 4095 | |
b037af20 MM |
4096 | /* Figure out how many relocations there will be. */ |
4097 | if (rel_hdr == &elf_section_data (o)->rel_hdr) | |
4098 | reloc_count = elf_section_data (o)->rel_count; | |
4099 | else | |
4100 | reloc_count = elf_section_data (o)->rel_count2; | |
4101 | ||
4102 | /* That allows us to calculate the size of the section. */ | |
4103 | rel_hdr->sh_size = rel_hdr->sh_entsize * reloc_count; | |
23bc299b MM |
4104 | |
4105 | /* The contents field must last into write_object_contents, so we | |
755cfd29 NC |
4106 | allocate it with bfd_alloc rather than malloc. Also since we |
4107 | cannot be sure that the contents will actually be filled in, | |
4108 | we zero the allocated space. */ | |
4109 | rel_hdr->contents = (PTR) bfd_zalloc (abfd, rel_hdr->sh_size); | |
23bc299b MM |
4110 | if (rel_hdr->contents == NULL && rel_hdr->sh_size != 0) |
4111 | return false; | |
b037af20 MM |
4112 | |
4113 | /* We only allocate one set of hash entries, so we only do it the | |
4114 | first time we are called. */ | |
4115 | if (elf_section_data (o)->rel_hashes == NULL) | |
4116 | { | |
4117 | p = ((struct elf_link_hash_entry **) | |
4118 | bfd_malloc (o->reloc_count | |
4119 | * sizeof (struct elf_link_hash_entry *))); | |
4120 | if (p == NULL && o->reloc_count != 0) | |
4121 | return false; | |
23bc299b | 4122 | |
b037af20 MM |
4123 | elf_section_data (o)->rel_hashes = p; |
4124 | pend = p + o->reloc_count; | |
4125 | for (; p < pend; p++) | |
4126 | *p = NULL; | |
4127 | } | |
23bc299b MM |
4128 | |
4129 | return true; | |
4130 | } | |
4131 | ||
31367b81 MM |
4132 | /* When performing a relocateable link, the input relocations are |
4133 | preserved. But, if they reference global symbols, the indices | |
4134 | referenced must be updated. Update all the relocations in | |
4135 | REL_HDR (there are COUNT of them), using the data in REL_HASH. */ | |
4136 | ||
4137 | static void | |
4138 | elf_link_adjust_relocs (abfd, rel_hdr, count, rel_hash) | |
4139 | bfd *abfd; | |
4140 | Elf_Internal_Shdr *rel_hdr; | |
4141 | unsigned int count; | |
4142 | struct elf_link_hash_entry **rel_hash; | |
4143 | { | |
4144 | unsigned int i; | |
32f0787a | 4145 | struct elf_backend_data *bed = get_elf_backend_data (abfd); |
31367b81 MM |
4146 | |
4147 | for (i = 0; i < count; i++, rel_hash++) | |
4148 | { | |
4149 | if (*rel_hash == NULL) | |
4150 | continue; | |
4151 | ||
4152 | BFD_ASSERT ((*rel_hash)->indx >= 0); | |
4153 | ||
4154 | if (rel_hdr->sh_entsize == sizeof (Elf_External_Rel)) | |
4155 | { | |
4156 | Elf_External_Rel *erel; | |
4157 | Elf_Internal_Rel irel; | |
4158 | ||
4159 | erel = (Elf_External_Rel *) rel_hdr->contents + i; | |
32f0787a UC |
4160 | if (bed->s->swap_reloc_in) |
4161 | (*bed->s->swap_reloc_in) (abfd, (bfd_byte *) erel, &irel); | |
4162 | else | |
4163 | elf_swap_reloc_in (abfd, erel, &irel); | |
31367b81 MM |
4164 | irel.r_info = ELF_R_INFO ((*rel_hash)->indx, |
4165 | ELF_R_TYPE (irel.r_info)); | |
32f0787a UC |
4166 | if (bed->s->swap_reloc_out) |
4167 | (*bed->s->swap_reloc_out) (abfd, &irel, (bfd_byte *) erel); | |
4168 | else | |
4169 | elf_swap_reloc_out (abfd, &irel, erel); | |
31367b81 MM |
4170 | } |
4171 | else | |
4172 | { | |
4173 | Elf_External_Rela *erela; | |
4174 | Elf_Internal_Rela irela; | |
4175 | ||
4176 | BFD_ASSERT (rel_hdr->sh_entsize | |
4177 | == sizeof (Elf_External_Rela)); | |
4178 | ||
4179 | erela = (Elf_External_Rela *) rel_hdr->contents + i; | |
32f0787a UC |
4180 | if (bed->s->swap_reloca_in) |
4181 | (*bed->s->swap_reloca_in) (abfd, (bfd_byte *) erela, &irela); | |
4182 | else | |
4183 | elf_swap_reloca_in (abfd, erela, &irela); | |
31367b81 MM |
4184 | irela.r_info = ELF_R_INFO ((*rel_hash)->indx, |
4185 | ELF_R_TYPE (irela.r_info)); | |
32f0787a UC |
4186 | if (bed->s->swap_reloca_out) |
4187 | (*bed->s->swap_reloca_out) (abfd, &irela, (bfd_byte *) erela); | |
4188 | else | |
4189 | elf_swap_reloca_out (abfd, &irela, erela); | |
31367b81 MM |
4190 | } |
4191 | } | |
4192 | } | |
4193 | ||
252b5132 RH |
4194 | /* Do the final step of an ELF link. */ |
4195 | ||
4196 | boolean | |
4197 | elf_bfd_final_link (abfd, info) | |
4198 | bfd *abfd; | |
4199 | struct bfd_link_info *info; | |
4200 | { | |
4201 | boolean dynamic; | |
4202 | bfd *dynobj; | |
4203 | struct elf_final_link_info finfo; | |
4204 | register asection *o; | |
4205 | register struct bfd_link_order *p; | |
4206 | register bfd *sub; | |
4207 | size_t max_contents_size; | |
4208 | size_t max_external_reloc_size; | |
4209 | size_t max_internal_reloc_count; | |
4210 | size_t max_sym_count; | |
4211 | file_ptr off; | |
4212 | Elf_Internal_Sym elfsym; | |
4213 | unsigned int i; | |
4214 | Elf_Internal_Shdr *symtab_hdr; | |
4215 | Elf_Internal_Shdr *symstrtab_hdr; | |
4216 | struct elf_backend_data *bed = get_elf_backend_data (abfd); | |
4217 | struct elf_outext_info eoinfo; | |
4218 | ||
4219 | if (info->shared) | |
4220 | abfd->flags |= DYNAMIC; | |
4221 | ||
4222 | dynamic = elf_hash_table (info)->dynamic_sections_created; | |
4223 | dynobj = elf_hash_table (info)->dynobj; | |
4224 | ||
4225 | finfo.info = info; | |
4226 | finfo.output_bfd = abfd; | |
4227 | finfo.symstrtab = elf_stringtab_init (); | |
4228 | if (finfo.symstrtab == NULL) | |
4229 | return false; | |
4230 | ||
4231 | if (! dynamic) | |
4232 | { | |
4233 | finfo.dynsym_sec = NULL; | |
4234 | finfo.hash_sec = NULL; | |
4235 | finfo.symver_sec = NULL; | |
4236 | } | |
4237 | else | |
4238 | { | |
4239 | finfo.dynsym_sec = bfd_get_section_by_name (dynobj, ".dynsym"); | |
4240 | finfo.hash_sec = bfd_get_section_by_name (dynobj, ".hash"); | |
4241 | BFD_ASSERT (finfo.dynsym_sec != NULL && finfo.hash_sec != NULL); | |
4242 | finfo.symver_sec = bfd_get_section_by_name (dynobj, ".gnu.version"); | |
4243 | /* Note that it is OK if symver_sec is NULL. */ | |
4244 | } | |
4245 | ||
4246 | finfo.contents = NULL; | |
4247 | finfo.external_relocs = NULL; | |
4248 | finfo.internal_relocs = NULL; | |
4249 | finfo.external_syms = NULL; | |
4250 | finfo.internal_syms = NULL; | |
4251 | finfo.indices = NULL; | |
4252 | finfo.sections = NULL; | |
4253 | finfo.symbuf = NULL; | |
4254 | finfo.symbuf_count = 0; | |
4255 | ||
4256 | /* Count up the number of relocations we will output for each output | |
4257 | section, so that we know the sizes of the reloc sections. We | |
4258 | also figure out some maximum sizes. */ | |
4259 | max_contents_size = 0; | |
4260 | max_external_reloc_size = 0; | |
4261 | max_internal_reloc_count = 0; | |
4262 | max_sym_count = 0; | |
4263 | for (o = abfd->sections; o != (asection *) NULL; o = o->next) | |
4264 | { | |
4265 | o->reloc_count = 0; | |
4266 | ||
4267 | for (p = o->link_order_head; p != NULL; p = p->next) | |
4268 | { | |
4269 | if (p->type == bfd_section_reloc_link_order | |
4270 | || p->type == bfd_symbol_reloc_link_order) | |
4271 | ++o->reloc_count; | |
4272 | else if (p->type == bfd_indirect_link_order) | |
4273 | { | |
4274 | asection *sec; | |
4275 | ||
4276 | sec = p->u.indirect.section; | |
4277 | ||
4278 | /* Mark all sections which are to be included in the | |
4279 | link. This will normally be every section. We need | |
4280 | to do this so that we can identify any sections which | |
4281 | the linker has decided to not include. */ | |
4282 | sec->linker_mark = true; | |
4283 | ||
a712da20 | 4284 | if (info->relocateable || info->emitrelocations) |
252b5132 RH |
4285 | o->reloc_count += sec->reloc_count; |
4286 | ||
4287 | if (sec->_raw_size > max_contents_size) | |
4288 | max_contents_size = sec->_raw_size; | |
4289 | if (sec->_cooked_size > max_contents_size) | |
4290 | max_contents_size = sec->_cooked_size; | |
4291 | ||
4292 | /* We are interested in just local symbols, not all | |
4293 | symbols. */ | |
4294 | if (bfd_get_flavour (sec->owner) == bfd_target_elf_flavour | |
4295 | && (sec->owner->flags & DYNAMIC) == 0) | |
4296 | { | |
4297 | size_t sym_count; | |
4298 | ||
4299 | if (elf_bad_symtab (sec->owner)) | |
4300 | sym_count = (elf_tdata (sec->owner)->symtab_hdr.sh_size | |
4301 | / sizeof (Elf_External_Sym)); | |
4302 | else | |
4303 | sym_count = elf_tdata (sec->owner)->symtab_hdr.sh_info; | |
4304 | ||
4305 | if (sym_count > max_sym_count) | |
4306 | max_sym_count = sym_count; | |
4307 | ||
4308 | if ((sec->flags & SEC_RELOC) != 0) | |
4309 | { | |
4310 | size_t ext_size; | |
4311 | ||
4312 | ext_size = elf_section_data (sec)->rel_hdr.sh_size; | |
4313 | if (ext_size > max_external_reloc_size) | |
4314 | max_external_reloc_size = ext_size; | |
4315 | if (sec->reloc_count > max_internal_reloc_count) | |
4316 | max_internal_reloc_count = sec->reloc_count; | |
4317 | } | |
4318 | } | |
4319 | } | |
4320 | } | |
4321 | ||
4322 | if (o->reloc_count > 0) | |
4323 | o->flags |= SEC_RELOC; | |
4324 | else | |
4325 | { | |
4326 | /* Explicitly clear the SEC_RELOC flag. The linker tends to | |
4327 | set it (this is probably a bug) and if it is set | |
4328 | assign_section_numbers will create a reloc section. */ | |
4329 | o->flags &=~ SEC_RELOC; | |
4330 | } | |
4331 | ||
4332 | /* If the SEC_ALLOC flag is not set, force the section VMA to | |
4333 | zero. This is done in elf_fake_sections as well, but forcing | |
4334 | the VMA to 0 here will ensure that relocs against these | |
4335 | sections are handled correctly. */ | |
4336 | if ((o->flags & SEC_ALLOC) == 0 | |
4337 | && ! o->user_set_vma) | |
4338 | o->vma = 0; | |
4339 | } | |
4340 | ||
4341 | /* Figure out the file positions for everything but the symbol table | |
4342 | and the relocs. We set symcount to force assign_section_numbers | |
4343 | to create a symbol table. */ | |
4344 | bfd_get_symcount (abfd) = info->strip == strip_all ? 0 : 1; | |
4345 | BFD_ASSERT (! abfd->output_has_begun); | |
4346 | if (! _bfd_elf_compute_section_file_positions (abfd, info)) | |
4347 | goto error_return; | |
4348 | ||
b037af20 MM |
4349 | /* Figure out how many relocations we will have in each section. |
4350 | Just using RELOC_COUNT isn't good enough since that doesn't | |
4351 | maintain a separate value for REL vs. RELA relocations. */ | |
a712da20 | 4352 | if (info->relocateable || info->emitrelocations) |
b037af20 MM |
4353 | for (sub = info->input_bfds; sub != NULL; sub = sub->link_next) |
4354 | for (o = sub->sections; o != NULL; o = o->next) | |
4355 | { | |
814fe68a | 4356 | asection *output_section; |
b037af20 | 4357 | |
814fe68a ILT |
4358 | if (! o->linker_mark) |
4359 | { | |
4360 | /* This section was omitted from the link. */ | |
4361 | continue; | |
4362 | } | |
4363 | ||
4364 | output_section = o->output_section; | |
4365 | ||
4366 | if (output_section != NULL | |
4367 | && (o->flags & SEC_RELOC) != 0) | |
b037af20 MM |
4368 | { |
4369 | struct bfd_elf_section_data *esdi | |
4370 | = elf_section_data (o); | |
4371 | struct bfd_elf_section_data *esdo | |
4372 | = elf_section_data (output_section); | |
ce006217 MM |
4373 | unsigned int *rel_count; |
4374 | unsigned int *rel_count2; | |
b037af20 | 4375 | |
ce006217 MM |
4376 | /* We must be careful to add the relocation froms the |
4377 | input section to the right output count. */ | |
4378 | if (esdi->rel_hdr.sh_entsize == esdo->rel_hdr.sh_entsize) | |
4379 | { | |
4380 | rel_count = &esdo->rel_count; | |
4381 | rel_count2 = &esdo->rel_count2; | |
4382 | } | |
4383 | else | |
4384 | { | |
4385 | rel_count = &esdo->rel_count2; | |
4386 | rel_count2 = &esdo->rel_count; | |
4387 | } | |
4388 | ||
4389 | *rel_count += (esdi->rel_hdr.sh_size | |
4390 | / esdi->rel_hdr.sh_entsize); | |
b037af20 | 4391 | if (esdi->rel_hdr2) |
ce006217 MM |
4392 | *rel_count2 += (esdi->rel_hdr2->sh_size |
4393 | / esdi->rel_hdr2->sh_entsize); | |
b037af20 MM |
4394 | } |
4395 | } | |
4396 | ||
252b5132 RH |
4397 | /* That created the reloc sections. Set their sizes, and assign |
4398 | them file positions, and allocate some buffers. */ | |
4399 | for (o = abfd->sections; o != NULL; o = o->next) | |
4400 | { | |
4401 | if ((o->flags & SEC_RELOC) != 0) | |
4402 | { | |
23bc299b MM |
4403 | if (!elf_link_size_reloc_section (abfd, |
4404 | &elf_section_data (o)->rel_hdr, | |
4405 | o)) | |
252b5132 RH |
4406 | goto error_return; |
4407 | ||
23bc299b MM |
4408 | if (elf_section_data (o)->rel_hdr2 |
4409 | && !elf_link_size_reloc_section (abfd, | |
4410 | elf_section_data (o)->rel_hdr2, | |
4411 | o)) | |
252b5132 | 4412 | goto error_return; |
252b5132 | 4413 | } |
b037af20 MM |
4414 | |
4415 | /* Now, reset REL_COUNT and REL_COUNT2 so that we can use them | |
4416 | to count upwards while actually outputting the relocations. */ | |
4417 | elf_section_data (o)->rel_count = 0; | |
4418 | elf_section_data (o)->rel_count2 = 0; | |
252b5132 RH |
4419 | } |
4420 | ||
4421 | _bfd_elf_assign_file_positions_for_relocs (abfd); | |
4422 | ||
4423 | /* We have now assigned file positions for all the sections except | |
4424 | .symtab and .strtab. We start the .symtab section at the current | |
4425 | file position, and write directly to it. We build the .strtab | |
4426 | section in memory. */ | |
4427 | bfd_get_symcount (abfd) = 0; | |
4428 | symtab_hdr = &elf_tdata (abfd)->symtab_hdr; | |
4429 | /* sh_name is set in prep_headers. */ | |
4430 | symtab_hdr->sh_type = SHT_SYMTAB; | |
4431 | symtab_hdr->sh_flags = 0; | |
4432 | symtab_hdr->sh_addr = 0; | |
4433 | symtab_hdr->sh_size = 0; | |
4434 | symtab_hdr->sh_entsize = sizeof (Elf_External_Sym); | |
4435 | /* sh_link is set in assign_section_numbers. */ | |
4436 | /* sh_info is set below. */ | |
4437 | /* sh_offset is set just below. */ | |
4438 | symtab_hdr->sh_addralign = 4; /* FIXME: system dependent? */ | |
4439 | ||
4440 | off = elf_tdata (abfd)->next_file_pos; | |
4441 | off = _bfd_elf_assign_file_position_for_section (symtab_hdr, off, true); | |
4442 | ||
4443 | /* Note that at this point elf_tdata (abfd)->next_file_pos is | |
4444 | incorrect. We do not yet know the size of the .symtab section. | |
4445 | We correct next_file_pos below, after we do know the size. */ | |
4446 | ||
4447 | /* Allocate a buffer to hold swapped out symbols. This is to avoid | |
4448 | continuously seeking to the right position in the file. */ | |
4449 | if (! info->keep_memory || max_sym_count < 20) | |
4450 | finfo.symbuf_size = 20; | |
4451 | else | |
4452 | finfo.symbuf_size = max_sym_count; | |
4453 | finfo.symbuf = ((Elf_External_Sym *) | |
4454 | bfd_malloc (finfo.symbuf_size * sizeof (Elf_External_Sym))); | |
4455 | if (finfo.symbuf == NULL) | |
4456 | goto error_return; | |
4457 | ||
4458 | /* Start writing out the symbol table. The first symbol is always a | |
4459 | dummy symbol. */ | |
a712da20 | 4460 | if (info->strip != strip_all || info->relocateable || info->emitrelocations) |
252b5132 RH |
4461 | { |
4462 | elfsym.st_value = 0; | |
4463 | elfsym.st_size = 0; | |
4464 | elfsym.st_info = 0; | |
4465 | elfsym.st_other = 0; | |
4466 | elfsym.st_shndx = SHN_UNDEF; | |
4467 | if (! elf_link_output_sym (&finfo, (const char *) NULL, | |
4468 | &elfsym, bfd_und_section_ptr)) | |
4469 | goto error_return; | |
4470 | } | |
4471 | ||
4472 | #if 0 | |
4473 | /* Some standard ELF linkers do this, but we don't because it causes | |
4474 | bootstrap comparison failures. */ | |
4475 | /* Output a file symbol for the output file as the second symbol. | |
4476 | We output this even if we are discarding local symbols, although | |
4477 | I'm not sure if this is correct. */ | |
4478 | elfsym.st_value = 0; | |
4479 | elfsym.st_size = 0; | |
4480 | elfsym.st_info = ELF_ST_INFO (STB_LOCAL, STT_FILE); | |
4481 | elfsym.st_other = 0; | |
4482 | elfsym.st_shndx = SHN_ABS; | |
4483 | if (! elf_link_output_sym (&finfo, bfd_get_filename (abfd), | |
4484 | &elfsym, bfd_abs_section_ptr)) | |
4485 | goto error_return; | |
4486 | #endif | |
4487 | ||
4488 | /* Output a symbol for each section. We output these even if we are | |
4489 | discarding local symbols, since they are used for relocs. These | |
4490 | symbols have no names. We store the index of each one in the | |
4491 | index field of the section, so that we can find it again when | |
4492 | outputting relocs. */ | |
a712da20 | 4493 | if (info->strip != strip_all || info->relocateable || info->emitrelocations) |
252b5132 RH |
4494 | { |
4495 | elfsym.st_size = 0; | |
4496 | elfsym.st_info = ELF_ST_INFO (STB_LOCAL, STT_SECTION); | |
4497 | elfsym.st_other = 0; | |
4498 | for (i = 1; i < elf_elfheader (abfd)->e_shnum; i++) | |
4499 | { | |
4500 | o = section_from_elf_index (abfd, i); | |
4501 | if (o != NULL) | |
4502 | o->target_index = bfd_get_symcount (abfd); | |
4503 | elfsym.st_shndx = i; | |
7ad34365 | 4504 | if (info->relocateable || o == NULL) |
252b5132 RH |
4505 | elfsym.st_value = 0; |
4506 | else | |
4507 | elfsym.st_value = o->vma; | |
4508 | if (! elf_link_output_sym (&finfo, (const char *) NULL, | |
4509 | &elfsym, o)) | |
4510 | goto error_return; | |
4511 | } | |
4512 | } | |
4513 | ||
4514 | /* Allocate some memory to hold information read in from the input | |
4515 | files. */ | |
4516 | finfo.contents = (bfd_byte *) bfd_malloc (max_contents_size); | |
4517 | finfo.external_relocs = (PTR) bfd_malloc (max_external_reloc_size); | |
4518 | finfo.internal_relocs = ((Elf_Internal_Rela *) | |
4519 | bfd_malloc (max_internal_reloc_count | |
c7ac6ff8 MM |
4520 | * sizeof (Elf_Internal_Rela) |
4521 | * bed->s->int_rels_per_ext_rel)); | |
252b5132 RH |
4522 | finfo.external_syms = ((Elf_External_Sym *) |
4523 | bfd_malloc (max_sym_count | |
4524 | * sizeof (Elf_External_Sym))); | |
4525 | finfo.internal_syms = ((Elf_Internal_Sym *) | |
4526 | bfd_malloc (max_sym_count | |
4527 | * sizeof (Elf_Internal_Sym))); | |
4528 | finfo.indices = (long *) bfd_malloc (max_sym_count * sizeof (long)); | |
4529 | finfo.sections = ((asection **) | |
4530 | bfd_malloc (max_sym_count * sizeof (asection *))); | |
4531 | if ((finfo.contents == NULL && max_contents_size != 0) | |
4532 | || (finfo.external_relocs == NULL && max_external_reloc_size != 0) | |
4533 | || (finfo.internal_relocs == NULL && max_internal_reloc_count != 0) | |
4534 | || (finfo.external_syms == NULL && max_sym_count != 0) | |
4535 | || (finfo.internal_syms == NULL && max_sym_count != 0) | |
4536 | || (finfo.indices == NULL && max_sym_count != 0) | |
4537 | || (finfo.sections == NULL && max_sym_count != 0)) | |
4538 | goto error_return; | |
4539 | ||
4540 | /* Since ELF permits relocations to be against local symbols, we | |
4541 | must have the local symbols available when we do the relocations. | |
4542 | Since we would rather only read the local symbols once, and we | |
4543 | would rather not keep them in memory, we handle all the | |
4544 | relocations for a single input file at the same time. | |
4545 | ||
4546 | Unfortunately, there is no way to know the total number of local | |
4547 | symbols until we have seen all of them, and the local symbol | |
4548 | indices precede the global symbol indices. This means that when | |
4549 | we are generating relocateable output, and we see a reloc against | |
4550 | a global symbol, we can not know the symbol index until we have | |
4551 | finished examining all the local symbols to see which ones we are | |
4552 | going to output. To deal with this, we keep the relocations in | |
4553 | memory, and don't output them until the end of the link. This is | |
4554 | an unfortunate waste of memory, but I don't see a good way around | |
4555 | it. Fortunately, it only happens when performing a relocateable | |
4556 | link, which is not the common case. FIXME: If keep_memory is set | |
4557 | we could write the relocs out and then read them again; I don't | |
4558 | know how bad the memory loss will be. */ | |
4559 | ||
4560 | for (sub = info->input_bfds; sub != NULL; sub = sub->link_next) | |
4561 | sub->output_has_begun = false; | |
4562 | for (o = abfd->sections; o != NULL; o = o->next) | |
4563 | { | |
4564 | for (p = o->link_order_head; p != NULL; p = p->next) | |
4565 | { | |
4566 | if (p->type == bfd_indirect_link_order | |
4567 | && (bfd_get_flavour (p->u.indirect.section->owner) | |
4568 | == bfd_target_elf_flavour)) | |
4569 | { | |
4570 | sub = p->u.indirect.section->owner; | |
4571 | if (! sub->output_has_begun) | |
4572 | { | |
4573 | if (! elf_link_input_bfd (&finfo, sub)) | |
4574 | goto error_return; | |
4575 | sub->output_has_begun = true; | |
4576 | } | |
4577 | } | |
4578 | else if (p->type == bfd_section_reloc_link_order | |
4579 | || p->type == bfd_symbol_reloc_link_order) | |
4580 | { | |
4581 | if (! elf_reloc_link_order (abfd, info, o, p)) | |
4582 | goto error_return; | |
4583 | } | |
4584 | else | |
4585 | { | |
4586 | if (! _bfd_default_link_order (abfd, info, o, p)) | |
4587 | goto error_return; | |
4588 | } | |
4589 | } | |
4590 | } | |
4591 | ||
4592 | /* That wrote out all the local symbols. Finish up the symbol table | |
5cc7c785 L |
4593 | with the global symbols. Even if we want to strip everything we |
4594 | can, we still need to deal with those global symbols that got | |
4595 | converted to local in a version script. */ | |
252b5132 | 4596 | |
2bd171e0 | 4597 | if (info->shared) |
252b5132 RH |
4598 | { |
4599 | /* Output any global symbols that got converted to local in a | |
4600 | version script. We do this in a separate step since ELF | |
4601 | requires all local symbols to appear prior to any global | |
4602 | symbols. FIXME: We should only do this if some global | |
4603 | symbols were, in fact, converted to become local. FIXME: | |
4604 | Will this work correctly with the Irix 5 linker? */ | |
4605 | eoinfo.failed = false; | |
4606 | eoinfo.finfo = &finfo; | |
4607 | eoinfo.localsyms = true; | |
4608 | elf_link_hash_traverse (elf_hash_table (info), elf_link_output_extsym, | |
4609 | (PTR) &eoinfo); | |
4610 | if (eoinfo.failed) | |
4611 | return false; | |
4612 | } | |
4613 | ||
30b30c21 | 4614 | /* The sh_info field records the index of the first non local symbol. */ |
252b5132 | 4615 | symtab_hdr->sh_info = bfd_get_symcount (abfd); |
30b30c21 | 4616 | |
fc8c40a0 AM |
4617 | if (dynamic |
4618 | && finfo.dynsym_sec->output_section != bfd_abs_section_ptr) | |
30b30c21 RH |
4619 | { |
4620 | Elf_Internal_Sym sym; | |
4621 | Elf_External_Sym *dynsym = | |
4622 | (Elf_External_Sym *)finfo.dynsym_sec->contents; | |
71a40b32 | 4623 | long last_local = 0; |
30b30c21 RH |
4624 | |
4625 | /* Write out the section symbols for the output sections. */ | |
4626 | if (info->shared) | |
4627 | { | |
4628 | asection *s; | |
4629 | ||
4630 | sym.st_size = 0; | |
4631 | sym.st_name = 0; | |
4632 | sym.st_info = ELF_ST_INFO (STB_LOCAL, STT_SECTION); | |
4633 | sym.st_other = 0; | |
4634 | ||
4635 | for (s = abfd->sections; s != NULL; s = s->next) | |
4636 | { | |
4637 | int indx; | |
4638 | indx = elf_section_data (s)->this_idx; | |
4639 | BFD_ASSERT (indx > 0); | |
4640 | sym.st_shndx = indx; | |
4641 | sym.st_value = s->vma; | |
4642 | ||
4643 | elf_swap_symbol_out (abfd, &sym, | |
4644 | dynsym + elf_section_data (s)->dynindx); | |
4645 | } | |
4646 | ||
4647 | last_local = bfd_count_sections (abfd); | |
4648 | } | |
4649 | ||
4650 | /* Write out the local dynsyms. */ | |
4651 | if (elf_hash_table (info)->dynlocal) | |
4652 | { | |
4653 | struct elf_link_local_dynamic_entry *e; | |
4654 | for (e = elf_hash_table (info)->dynlocal; e ; e = e->next) | |
4655 | { | |
318da145 | 4656 | asection *s; |
30b30c21 | 4657 | |
b037af20 MM |
4658 | sym.st_size = e->isym.st_size; |
4659 | sym.st_other = e->isym.st_other; | |
4660 | ||
1fa0ddb3 RH |
4661 | /* Copy the internal symbol as is. |
4662 | Note that we saved a word of storage and overwrote | |
30b30c21 | 4663 | the original st_name with the dynstr_index. */ |
1fa0ddb3 | 4664 | sym = e->isym; |
30b30c21 | 4665 | |
1fa0ddb3 | 4666 | if (e->isym.st_shndx > 0 && e->isym.st_shndx < SHN_LORESERVE) |
587ff49e RH |
4667 | { |
4668 | s = bfd_section_from_elf_index (e->input_bfd, | |
4669 | e->isym.st_shndx); | |
4670 | ||
4671 | sym.st_shndx = | |
4672 | elf_section_data (s->output_section)->this_idx; | |
4673 | sym.st_value = (s->output_section->vma | |
4674 | + s->output_offset | |
4675 | + e->isym.st_value); | |
4676 | } | |
30b30c21 RH |
4677 | |
4678 | if (last_local < e->dynindx) | |
4679 | last_local = e->dynindx; | |
4680 | ||
4681 | elf_swap_symbol_out (abfd, &sym, dynsym + e->dynindx); | |
4682 | } | |
4683 | } | |
4684 | ||
71a40b32 ILT |
4685 | elf_section_data (finfo.dynsym_sec->output_section)->this_hdr.sh_info = |
4686 | last_local + 1; | |
30b30c21 | 4687 | } |
252b5132 RH |
4688 | |
4689 | /* We get the global symbols from the hash table. */ | |
4690 | eoinfo.failed = false; | |
4691 | eoinfo.localsyms = false; | |
4692 | eoinfo.finfo = &finfo; | |
4693 | elf_link_hash_traverse (elf_hash_table (info), elf_link_output_extsym, | |
4694 | (PTR) &eoinfo); | |
4695 | if (eoinfo.failed) | |
4696 | return false; | |
4697 | ||
587ff49e RH |
4698 | /* If backend needs to output some symbols not present in the hash |
4699 | table, do it now. */ | |
4700 | if (bed->elf_backend_output_arch_syms) | |
4701 | { | |
4702 | if (! (*bed->elf_backend_output_arch_syms) | |
4703 | (abfd, info, (PTR) &finfo, | |
4704 | (boolean (*) PARAMS ((PTR, const char *, | |
4705 | Elf_Internal_Sym *, asection *))) | |
4706 | elf_link_output_sym)) | |
4707 | return false; | |
4708 | } | |
4709 | ||
252b5132 RH |
4710 | /* Flush all symbols to the file. */ |
4711 | if (! elf_link_flush_output_syms (&finfo)) | |
4712 | return false; | |
4713 | ||
4714 | /* Now we know the size of the symtab section. */ | |
4715 | off += symtab_hdr->sh_size; | |
4716 | ||
4717 | /* Finish up and write out the symbol string table (.strtab) | |
4718 | section. */ | |
4719 | symstrtab_hdr = &elf_tdata (abfd)->strtab_hdr; | |
4720 | /* sh_name was set in prep_headers. */ | |
4721 | symstrtab_hdr->sh_type = SHT_STRTAB; | |
4722 | symstrtab_hdr->sh_flags = 0; | |
4723 | symstrtab_hdr->sh_addr = 0; | |
4724 | symstrtab_hdr->sh_size = _bfd_stringtab_size (finfo.symstrtab); | |
4725 | symstrtab_hdr->sh_entsize = 0; | |
4726 | symstrtab_hdr->sh_link = 0; | |
4727 | symstrtab_hdr->sh_info = 0; | |
4728 | /* sh_offset is set just below. */ | |
4729 | symstrtab_hdr->sh_addralign = 1; | |
4730 | ||
4731 | off = _bfd_elf_assign_file_position_for_section (symstrtab_hdr, off, true); | |
4732 | elf_tdata (abfd)->next_file_pos = off; | |
4733 | ||
4734 | if (bfd_get_symcount (abfd) > 0) | |
4735 | { | |
4736 | if (bfd_seek (abfd, symstrtab_hdr->sh_offset, SEEK_SET) != 0 | |
4737 | || ! _bfd_stringtab_emit (abfd, finfo.symstrtab)) | |
4738 | return false; | |
4739 | } | |
4740 | ||
4741 | /* Adjust the relocs to have the correct symbol indices. */ | |
4742 | for (o = abfd->sections; o != NULL; o = o->next) | |
4743 | { | |
252b5132 RH |
4744 | if ((o->flags & SEC_RELOC) == 0) |
4745 | continue; | |
4746 | ||
31367b81 MM |
4747 | elf_link_adjust_relocs (abfd, &elf_section_data (o)->rel_hdr, |
4748 | elf_section_data (o)->rel_count, | |
4749 | elf_section_data (o)->rel_hashes); | |
4750 | if (elf_section_data (o)->rel_hdr2 != NULL) | |
4751 | elf_link_adjust_relocs (abfd, elf_section_data (o)->rel_hdr2, | |
4752 | elf_section_data (o)->rel_count2, | |
4753 | (elf_section_data (o)->rel_hashes | |
4754 | + elf_section_data (o)->rel_count)); | |
252b5132 RH |
4755 | |
4756 | /* Set the reloc_count field to 0 to prevent write_relocs from | |
4757 | trying to swap the relocs out itself. */ | |
4758 | o->reloc_count = 0; | |
4759 | } | |
4760 | ||
4761 | /* If we are linking against a dynamic object, or generating a | |
4762 | shared library, finish up the dynamic linking information. */ | |
4763 | if (dynamic) | |
4764 | { | |
4765 | Elf_External_Dyn *dyncon, *dynconend; | |
4766 | ||
4767 | /* Fix up .dynamic entries. */ | |
4768 | o = bfd_get_section_by_name (dynobj, ".dynamic"); | |
4769 | BFD_ASSERT (o != NULL); | |
4770 | ||
4771 | dyncon = (Elf_External_Dyn *) o->contents; | |
4772 | dynconend = (Elf_External_Dyn *) (o->contents + o->_raw_size); | |
4773 | for (; dyncon < dynconend; dyncon++) | |
4774 | { | |
4775 | Elf_Internal_Dyn dyn; | |
4776 | const char *name; | |
4777 | unsigned int type; | |
4778 | ||
4779 | elf_swap_dyn_in (dynobj, dyncon, &dyn); | |
4780 | ||
4781 | switch (dyn.d_tag) | |
4782 | { | |
4783 | default: | |
4784 | break; | |
252b5132 | 4785 | case DT_INIT: |
f0c2e336 | 4786 | name = info->init_function; |
252b5132 RH |
4787 | goto get_sym; |
4788 | case DT_FINI: | |
f0c2e336 | 4789 | name = info->fini_function; |
252b5132 RH |
4790 | get_sym: |
4791 | { | |
4792 | struct elf_link_hash_entry *h; | |
4793 | ||
4794 | h = elf_link_hash_lookup (elf_hash_table (info), name, | |
4795 | false, false, true); | |
4796 | if (h != NULL | |
4797 | && (h->root.type == bfd_link_hash_defined | |
4798 | || h->root.type == bfd_link_hash_defweak)) | |
4799 | { | |
4800 | dyn.d_un.d_val = h->root.u.def.value; | |
4801 | o = h->root.u.def.section; | |
4802 | if (o->output_section != NULL) | |
4803 | dyn.d_un.d_val += (o->output_section->vma | |
4804 | + o->output_offset); | |
4805 | else | |
4806 | { | |
4807 | /* The symbol is imported from another shared | |
4808 | library and does not apply to this one. */ | |
4809 | dyn.d_un.d_val = 0; | |
4810 | } | |
4811 | ||
4812 | elf_swap_dyn_out (dynobj, &dyn, dyncon); | |
4813 | } | |
4814 | } | |
4815 | break; | |
4816 | ||
4817 | case DT_HASH: | |
4818 | name = ".hash"; | |
4819 | goto get_vma; | |
4820 | case DT_STRTAB: | |
4821 | name = ".dynstr"; | |
4822 | goto get_vma; | |
4823 | case DT_SYMTAB: | |
4824 | name = ".dynsym"; | |
4825 | goto get_vma; | |
4826 | case DT_VERDEF: | |
4827 | name = ".gnu.version_d"; | |
4828 | goto get_vma; | |
4829 | case DT_VERNEED: | |
4830 | name = ".gnu.version_r"; | |
4831 | goto get_vma; | |
4832 | case DT_VERSYM: | |
4833 | name = ".gnu.version"; | |
4834 | get_vma: | |
4835 | o = bfd_get_section_by_name (abfd, name); | |
4836 | BFD_ASSERT (o != NULL); | |
4837 | dyn.d_un.d_ptr = o->vma; | |
4838 | elf_swap_dyn_out (dynobj, &dyn, dyncon); | |
4839 | break; | |
4840 | ||
4841 | case DT_REL: | |
4842 | case DT_RELA: | |
4843 | case DT_RELSZ: | |
4844 | case DT_RELASZ: | |
4845 | if (dyn.d_tag == DT_REL || dyn.d_tag == DT_RELSZ) | |
4846 | type = SHT_REL; | |
4847 | else | |
4848 | type = SHT_RELA; | |
4849 | dyn.d_un.d_val = 0; | |
4850 | for (i = 1; i < elf_elfheader (abfd)->e_shnum; i++) | |
4851 | { | |
4852 | Elf_Internal_Shdr *hdr; | |
4853 | ||
4854 | hdr = elf_elfsections (abfd)[i]; | |
4855 | if (hdr->sh_type == type | |
4856 | && (hdr->sh_flags & SHF_ALLOC) != 0) | |
4857 | { | |
4858 | if (dyn.d_tag == DT_RELSZ || dyn.d_tag == DT_RELASZ) | |
4859 | dyn.d_un.d_val += hdr->sh_size; | |
4860 | else | |
4861 | { | |
4862 | if (dyn.d_un.d_val == 0 | |
4863 | || hdr->sh_addr < dyn.d_un.d_val) | |
4864 | dyn.d_un.d_val = hdr->sh_addr; | |
4865 | } | |
4866 | } | |
4867 | } | |
4868 | elf_swap_dyn_out (dynobj, &dyn, dyncon); | |
4869 | break; | |
4870 | } | |
4871 | } | |
4872 | } | |
4873 | ||
4874 | /* If we have created any dynamic sections, then output them. */ | |
4875 | if (dynobj != NULL) | |
4876 | { | |
4877 | if (! (*bed->elf_backend_finish_dynamic_sections) (abfd, info)) | |
4878 | goto error_return; | |
4879 | ||
4880 | for (o = dynobj->sections; o != NULL; o = o->next) | |
4881 | { | |
4882 | if ((o->flags & SEC_HAS_CONTENTS) == 0 | |
fc8c40a0 AM |
4883 | || o->_raw_size == 0 |
4884 | || o->output_section == bfd_abs_section_ptr) | |
252b5132 RH |
4885 | continue; |
4886 | if ((o->flags & SEC_LINKER_CREATED) == 0) | |
4887 | { | |
4888 | /* At this point, we are only interested in sections | |
4889 | created by elf_link_create_dynamic_sections. */ | |
4890 | continue; | |
4891 | } | |
4892 | if ((elf_section_data (o->output_section)->this_hdr.sh_type | |
4893 | != SHT_STRTAB) | |
4894 | || strcmp (bfd_get_section_name (abfd, o), ".dynstr") != 0) | |
4895 | { | |
4896 | if (! bfd_set_section_contents (abfd, o->output_section, | |
4897 | o->contents, o->output_offset, | |
4898 | o->_raw_size)) | |
4899 | goto error_return; | |
4900 | } | |
4901 | else | |
4902 | { | |
4903 | file_ptr off; | |
4904 | ||
4905 | /* The contents of the .dynstr section are actually in a | |
4906 | stringtab. */ | |
4907 | off = elf_section_data (o->output_section)->this_hdr.sh_offset; | |
4908 | if (bfd_seek (abfd, off, SEEK_SET) != 0 | |
4909 | || ! _bfd_stringtab_emit (abfd, | |
4910 | elf_hash_table (info)->dynstr)) | |
4911 | goto error_return; | |
4912 | } | |
4913 | } | |
4914 | } | |
4915 | ||
4916 | /* If we have optimized stabs strings, output them. */ | |
4917 | if (elf_hash_table (info)->stab_info != NULL) | |
4918 | { | |
4919 | if (! _bfd_write_stab_strings (abfd, &elf_hash_table (info)->stab_info)) | |
4920 | goto error_return; | |
4921 | } | |
4922 | ||
4923 | if (finfo.symstrtab != NULL) | |
4924 | _bfd_stringtab_free (finfo.symstrtab); | |
4925 | if (finfo.contents != NULL) | |
4926 | free (finfo.contents); | |
4927 | if (finfo.external_relocs != NULL) | |
4928 | free (finfo.external_relocs); | |
4929 | if (finfo.internal_relocs != NULL) | |
4930 | free (finfo.internal_relocs); | |
4931 | if (finfo.external_syms != NULL) | |
4932 | free (finfo.external_syms); | |
4933 | if (finfo.internal_syms != NULL) | |
4934 | free (finfo.internal_syms); | |
4935 | if (finfo.indices != NULL) | |
4936 | free (finfo.indices); | |
4937 | if (finfo.sections != NULL) | |
4938 | free (finfo.sections); | |
4939 | if (finfo.symbuf != NULL) | |
4940 | free (finfo.symbuf); | |
4941 | for (o = abfd->sections; o != NULL; o = o->next) | |
4942 | { | |
4943 | if ((o->flags & SEC_RELOC) != 0 | |
4944 | && elf_section_data (o)->rel_hashes != NULL) | |
4945 | free (elf_section_data (o)->rel_hashes); | |
4946 | } | |
4947 | ||
4948 | elf_tdata (abfd)->linker = true; | |
4949 | ||
4950 | return true; | |
4951 | ||
4952 | error_return: | |
4953 | if (finfo.symstrtab != NULL) | |
4954 | _bfd_stringtab_free (finfo.symstrtab); | |
4955 | if (finfo.contents != NULL) | |
4956 | free (finfo.contents); | |
4957 | if (finfo.external_relocs != NULL) | |
4958 | free (finfo.external_relocs); | |
4959 | if (finfo.internal_relocs != NULL) | |
4960 | free (finfo.internal_relocs); | |
4961 | if (finfo.external_syms != NULL) | |
4962 | free (finfo.external_syms); | |
4963 | if (finfo.internal_syms != NULL) | |
4964 | free (finfo.internal_syms); | |
4965 | if (finfo.indices != NULL) | |
4966 | free (finfo.indices); | |
4967 | if (finfo.sections != NULL) | |
4968 | free (finfo.sections); | |
4969 | if (finfo.symbuf != NULL) | |
4970 | free (finfo.symbuf); | |
4971 | for (o = abfd->sections; o != NULL; o = o->next) | |
4972 | { | |
4973 | if ((o->flags & SEC_RELOC) != 0 | |
4974 | && elf_section_data (o)->rel_hashes != NULL) | |
4975 | free (elf_section_data (o)->rel_hashes); | |
4976 | } | |
4977 | ||
4978 | return false; | |
4979 | } | |
4980 | ||
4981 | /* Add a symbol to the output symbol table. */ | |
4982 | ||
4983 | static boolean | |
4984 | elf_link_output_sym (finfo, name, elfsym, input_sec) | |
4985 | struct elf_final_link_info *finfo; | |
4986 | const char *name; | |
4987 | Elf_Internal_Sym *elfsym; | |
4988 | asection *input_sec; | |
4989 | { | |
4990 | boolean (*output_symbol_hook) PARAMS ((bfd *, | |
4991 | struct bfd_link_info *info, | |
4992 | const char *, | |
4993 | Elf_Internal_Sym *, | |
4994 | asection *)); | |
4995 | ||
4996 | output_symbol_hook = get_elf_backend_data (finfo->output_bfd)-> | |
4997 | elf_backend_link_output_symbol_hook; | |
4998 | if (output_symbol_hook != NULL) | |
4999 | { | |
5000 | if (! ((*output_symbol_hook) | |
5001 | (finfo->output_bfd, finfo->info, name, elfsym, input_sec))) | |
5002 | return false; | |
5003 | } | |
5004 | ||
5005 | if (name == (const char *) NULL || *name == '\0') | |
5006 | elfsym->st_name = 0; | |
5007 | else if (input_sec->flags & SEC_EXCLUDE) | |
5008 | elfsym->st_name = 0; | |
5009 | else | |
5010 | { | |
5011 | elfsym->st_name = (unsigned long) _bfd_stringtab_add (finfo->symstrtab, | |
5012 | name, true, | |
5013 | false); | |
5014 | if (elfsym->st_name == (unsigned long) -1) | |
5015 | return false; | |
5016 | } | |
5017 | ||
5018 | if (finfo->symbuf_count >= finfo->symbuf_size) | |
5019 | { | |
5020 | if (! elf_link_flush_output_syms (finfo)) | |
5021 | return false; | |
5022 | } | |
5023 | ||
5024 | elf_swap_symbol_out (finfo->output_bfd, elfsym, | |
5025 | (PTR) (finfo->symbuf + finfo->symbuf_count)); | |
5026 | ++finfo->symbuf_count; | |
5027 | ||
5028 | ++ bfd_get_symcount (finfo->output_bfd); | |
5029 | ||
5030 | return true; | |
5031 | } | |
5032 | ||
5033 | /* Flush the output symbols to the file. */ | |
5034 | ||
5035 | static boolean | |
5036 | elf_link_flush_output_syms (finfo) | |
5037 | struct elf_final_link_info *finfo; | |
5038 | { | |
5039 | if (finfo->symbuf_count > 0) | |
5040 | { | |
5041 | Elf_Internal_Shdr *symtab; | |
5042 | ||
5043 | symtab = &elf_tdata (finfo->output_bfd)->symtab_hdr; | |
5044 | ||
5045 | if (bfd_seek (finfo->output_bfd, symtab->sh_offset + symtab->sh_size, | |
5046 | SEEK_SET) != 0 | |
5047 | || (bfd_write ((PTR) finfo->symbuf, finfo->symbuf_count, | |
5048 | sizeof (Elf_External_Sym), finfo->output_bfd) | |
5049 | != finfo->symbuf_count * sizeof (Elf_External_Sym))) | |
5050 | return false; | |
5051 | ||
5052 | symtab->sh_size += finfo->symbuf_count * sizeof (Elf_External_Sym); | |
5053 | ||
5054 | finfo->symbuf_count = 0; | |
5055 | } | |
5056 | ||
5057 | return true; | |
5058 | } | |
5059 | ||
5060 | /* Add an external symbol to the symbol table. This is called from | |
5061 | the hash table traversal routine. When generating a shared object, | |
5062 | we go through the symbol table twice. The first time we output | |
5063 | anything that might have been forced to local scope in a version | |
5064 | script. The second time we output the symbols that are still | |
5065 | global symbols. */ | |
5066 | ||
5067 | static boolean | |
5068 | elf_link_output_extsym (h, data) | |
5069 | struct elf_link_hash_entry *h; | |
5070 | PTR data; | |
5071 | { | |
5072 | struct elf_outext_info *eoinfo = (struct elf_outext_info *) data; | |
5073 | struct elf_final_link_info *finfo = eoinfo->finfo; | |
5074 | boolean strip; | |
5075 | Elf_Internal_Sym sym; | |
5076 | asection *input_sec; | |
5077 | ||
5078 | /* Decide whether to output this symbol in this pass. */ | |
5079 | if (eoinfo->localsyms) | |
5080 | { | |
5081 | if ((h->elf_link_hash_flags & ELF_LINK_FORCED_LOCAL) == 0) | |
5082 | return true; | |
5083 | } | |
5084 | else | |
5085 | { | |
5086 | if ((h->elf_link_hash_flags & ELF_LINK_FORCED_LOCAL) != 0) | |
5087 | return true; | |
5088 | } | |
5089 | ||
5090 | /* If we are not creating a shared library, and this symbol is | |
5091 | referenced by a shared library but is not defined anywhere, then | |
5092 | warn that it is undefined. If we do not do this, the runtime | |
5093 | linker will complain that the symbol is undefined when the | |
5094 | program is run. We don't have to worry about symbols that are | |
5095 | referenced by regular files, because we will already have issued | |
5096 | warnings for them. */ | |
5097 | if (! finfo->info->relocateable | |
5098 | && ! (finfo->info->shared | |
252b5132 RH |
5099 | && !finfo->info->no_undefined) |
5100 | && h->root.type == bfd_link_hash_undefined | |
5101 | && (h->elf_link_hash_flags & ELF_LINK_HASH_REF_DYNAMIC) != 0 | |
5102 | && (h->elf_link_hash_flags & ELF_LINK_HASH_REF_REGULAR) == 0) | |
5103 | { | |
5104 | if (! ((*finfo->info->callbacks->undefined_symbol) | |
5105 | (finfo->info, h->root.root.string, h->root.u.undef.abfd, | |
5cc7c785 | 5106 | (asection *) NULL, 0, true))) |
252b5132 RH |
5107 | { |
5108 | eoinfo->failed = true; | |
5109 | return false; | |
5110 | } | |
5111 | } | |
5112 | ||
5113 | /* We don't want to output symbols that have never been mentioned by | |
5114 | a regular file, or that we have been told to strip. However, if | |
5115 | h->indx is set to -2, the symbol is used by a reloc and we must | |
5116 | output it. */ | |
5117 | if (h->indx == -2) | |
5118 | strip = false; | |
5119 | else if (((h->elf_link_hash_flags & ELF_LINK_HASH_DEF_DYNAMIC) != 0 | |
5120 | || (h->elf_link_hash_flags & ELF_LINK_HASH_REF_DYNAMIC) != 0) | |
5121 | && (h->elf_link_hash_flags & ELF_LINK_HASH_DEF_REGULAR) == 0 | |
5122 | && (h->elf_link_hash_flags & ELF_LINK_HASH_REF_REGULAR) == 0) | |
5123 | strip = true; | |
5124 | else if (finfo->info->strip == strip_all | |
5125 | || (finfo->info->strip == strip_some | |
5126 | && bfd_hash_lookup (finfo->info->keep_hash, | |
5127 | h->root.root.string, | |
5128 | false, false) == NULL)) | |
5129 | strip = true; | |
5130 | else | |
5131 | strip = false; | |
5132 | ||
5133 | /* If we're stripping it, and it's not a dynamic symbol, there's | |
2bd171e0 ILT |
5134 | nothing else to do unless it is a forced local symbol. */ |
5135 | if (strip | |
5136 | && h->dynindx == -1 | |
5137 | && (h->elf_link_hash_flags & ELF_LINK_FORCED_LOCAL) == 0) | |
252b5132 RH |
5138 | return true; |
5139 | ||
5140 | sym.st_value = 0; | |
5141 | sym.st_size = h->size; | |
5142 | sym.st_other = h->other; | |
5143 | if ((h->elf_link_hash_flags & ELF_LINK_FORCED_LOCAL) != 0) | |
5144 | sym.st_info = ELF_ST_INFO (STB_LOCAL, h->type); | |
5145 | else if (h->root.type == bfd_link_hash_undefweak | |
5146 | || h->root.type == bfd_link_hash_defweak) | |
5147 | sym.st_info = ELF_ST_INFO (STB_WEAK, h->type); | |
5148 | else | |
5149 | sym.st_info = ELF_ST_INFO (STB_GLOBAL, h->type); | |
5150 | ||
5151 | switch (h->root.type) | |
5152 | { | |
5153 | default: | |
5154 | case bfd_link_hash_new: | |
5155 | abort (); | |
5156 | return false; | |
5157 | ||
5158 | case bfd_link_hash_undefined: | |
5159 | input_sec = bfd_und_section_ptr; | |
5160 | sym.st_shndx = SHN_UNDEF; | |
5161 | break; | |
5162 | ||
5163 | case bfd_link_hash_undefweak: | |
5164 | input_sec = bfd_und_section_ptr; | |
5165 | sym.st_shndx = SHN_UNDEF; | |
5166 | break; | |
5167 | ||
5168 | case bfd_link_hash_defined: | |
5169 | case bfd_link_hash_defweak: | |
5170 | { | |
5171 | input_sec = h->root.u.def.section; | |
5172 | if (input_sec->output_section != NULL) | |
5173 | { | |
5174 | sym.st_shndx = | |
5175 | _bfd_elf_section_from_bfd_section (finfo->output_bfd, | |
5176 | input_sec->output_section); | |
5177 | if (sym.st_shndx == (unsigned short) -1) | |
5178 | { | |
5179 | (*_bfd_error_handler) | |
5180 | (_("%s: could not find output section %s for input section %s"), | |
5181 | bfd_get_filename (finfo->output_bfd), | |
5182 | input_sec->output_section->name, | |
5183 | input_sec->name); | |
5184 | eoinfo->failed = true; | |
5185 | return false; | |
5186 | } | |
5187 | ||
5188 | /* ELF symbols in relocateable files are section relative, | |
5189 | but in nonrelocateable files they are virtual | |
5190 | addresses. */ | |
5191 | sym.st_value = h->root.u.def.value + input_sec->output_offset; | |
5192 | if (! finfo->info->relocateable) | |
5193 | sym.st_value += input_sec->output_section->vma; | |
5194 | } | |
5195 | else | |
5196 | { | |
5197 | BFD_ASSERT (input_sec->owner == NULL | |
5198 | || (input_sec->owner->flags & DYNAMIC) != 0); | |
5199 | sym.st_shndx = SHN_UNDEF; | |
5200 | input_sec = bfd_und_section_ptr; | |
5201 | } | |
5202 | } | |
5203 | break; | |
5204 | ||
5205 | case bfd_link_hash_common: | |
5206 | input_sec = h->root.u.c.p->section; | |
5207 | sym.st_shndx = SHN_COMMON; | |
5208 | sym.st_value = 1 << h->root.u.c.p->alignment_power; | |
5209 | break; | |
5210 | ||
5211 | case bfd_link_hash_indirect: | |
5212 | /* These symbols are created by symbol versioning. They point | |
5213 | to the decorated version of the name. For example, if the | |
5214 | symbol foo@@GNU_1.2 is the default, which should be used when | |
5215 | foo is used with no version, then we add an indirect symbol | |
5216 | foo which points to foo@@GNU_1.2. We ignore these symbols, | |
94b6c40a L |
5217 | since the indirected symbol is already in the hash table. */ |
5218 | return true; | |
252b5132 | 5219 | |
252b5132 RH |
5220 | case bfd_link_hash_warning: |
5221 | /* We can't represent these symbols in ELF, although a warning | |
5222 | symbol may have come from a .gnu.warning.SYMBOL section. We | |
5223 | just put the target symbol in the hash table. If the target | |
5224 | symbol does not really exist, don't do anything. */ | |
5225 | if (h->root.u.i.link->type == bfd_link_hash_new) | |
5226 | return true; | |
5227 | return (elf_link_output_extsym | |
5228 | ((struct elf_link_hash_entry *) h->root.u.i.link, data)); | |
5229 | } | |
5230 | ||
5231 | /* Give the processor backend a chance to tweak the symbol value, | |
5232 | and also to finish up anything that needs to be done for this | |
5233 | symbol. */ | |
5234 | if ((h->dynindx != -1 | |
5235 | || (h->elf_link_hash_flags & ELF_LINK_FORCED_LOCAL) != 0) | |
5236 | && elf_hash_table (finfo->info)->dynamic_sections_created) | |
5237 | { | |
5238 | struct elf_backend_data *bed; | |
5239 | ||
5240 | bed = get_elf_backend_data (finfo->output_bfd); | |
5241 | if (! ((*bed->elf_backend_finish_dynamic_symbol) | |
5242 | (finfo->output_bfd, finfo->info, h, &sym))) | |
5243 | { | |
5244 | eoinfo->failed = true; | |
5245 | return false; | |
5246 | } | |
5247 | } | |
5248 | ||
5249 | /* If we are marking the symbol as undefined, and there are no | |
5250 | non-weak references to this symbol from a regular object, then | |
91d3970e ILT |
5251 | mark the symbol as weak undefined; if there are non-weak |
5252 | references, mark the symbol as strong. We can't do this earlier, | |
252b5132 RH |
5253 | because it might not be marked as undefined until the |
5254 | finish_dynamic_symbol routine gets through with it. */ | |
5255 | if (sym.st_shndx == SHN_UNDEF | |
252b5132 | 5256 | && (h->elf_link_hash_flags & ELF_LINK_HASH_REF_REGULAR) != 0 |
91d3970e ILT |
5257 | && (ELF_ST_BIND(sym.st_info) == STB_GLOBAL |
5258 | || ELF_ST_BIND(sym.st_info) == STB_WEAK)) | |
5259 | { | |
5260 | int bindtype; | |
5261 | ||
5262 | if ((h->elf_link_hash_flags & ELF_LINK_HASH_REF_REGULAR_NONWEAK) != 0) | |
5263 | bindtype = STB_GLOBAL; | |
5264 | else | |
5265 | bindtype = STB_WEAK; | |
5266 | sym.st_info = ELF_ST_INFO (bindtype, ELF_ST_TYPE (sym.st_info)); | |
5267 | } | |
252b5132 | 5268 | |
32c092c3 L |
5269 | /* If a symbol is not defined locally, we clear the visibility |
5270 | field. */ | |
5271 | if ((h->elf_link_hash_flags & ELF_LINK_HASH_DEF_REGULAR) == 0) | |
5272 | sym.st_other ^= ELF_ST_VISIBILITY(sym.st_other); | |
5273 | ||
252b5132 RH |
5274 | /* If this symbol should be put in the .dynsym section, then put it |
5275 | there now. We have already know the symbol index. We also fill | |
5276 | in the entry in the .hash section. */ | |
5277 | if (h->dynindx != -1 | |
5278 | && elf_hash_table (finfo->info)->dynamic_sections_created) | |
5279 | { | |
5280 | size_t bucketcount; | |
5281 | size_t bucket; | |
c7ac6ff8 | 5282 | size_t hash_entry_size; |
252b5132 RH |
5283 | bfd_byte *bucketpos; |
5284 | bfd_vma chain; | |
5285 | ||
5286 | sym.st_name = h->dynstr_index; | |
5287 | ||
5288 | elf_swap_symbol_out (finfo->output_bfd, &sym, | |
5289 | (PTR) (((Elf_External_Sym *) | |
5290 | finfo->dynsym_sec->contents) | |
5291 | + h->dynindx)); | |
5292 | ||
5293 | bucketcount = elf_hash_table (finfo->info)->bucketcount; | |
5294 | bucket = h->elf_hash_value % bucketcount; | |
c7ac6ff8 MM |
5295 | hash_entry_size |
5296 | = elf_section_data (finfo->hash_sec)->this_hdr.sh_entsize; | |
252b5132 | 5297 | bucketpos = ((bfd_byte *) finfo->hash_sec->contents |
c7ac6ff8 MM |
5298 | + (bucket + 2) * hash_entry_size); |
5299 | chain = bfd_get (8 * hash_entry_size, finfo->output_bfd, bucketpos); | |
5300 | bfd_put (8 * hash_entry_size, finfo->output_bfd, h->dynindx, bucketpos); | |
5301 | bfd_put (8 * hash_entry_size, finfo->output_bfd, chain, | |
5302 | ((bfd_byte *) finfo->hash_sec->contents | |
5303 | + (bucketcount + 2 + h->dynindx) * hash_entry_size)); | |
252b5132 RH |
5304 | |
5305 | if (finfo->symver_sec != NULL && finfo->symver_sec->contents != NULL) | |
5306 | { | |
5307 | Elf_Internal_Versym iversym; | |
5308 | ||
5309 | if ((h->elf_link_hash_flags & ELF_LINK_HASH_DEF_REGULAR) == 0) | |
5310 | { | |
5311 | if (h->verinfo.verdef == NULL) | |
5312 | iversym.vs_vers = 0; | |
5313 | else | |
5314 | iversym.vs_vers = h->verinfo.verdef->vd_exp_refno + 1; | |
5315 | } | |
5316 | else | |
5317 | { | |
5318 | if (h->verinfo.vertree == NULL) | |
5319 | iversym.vs_vers = 1; | |
5320 | else | |
5321 | iversym.vs_vers = h->verinfo.vertree->vernum + 1; | |
5322 | } | |
5323 | ||
5324 | if ((h->elf_link_hash_flags & ELF_LINK_HIDDEN) != 0) | |
5325 | iversym.vs_vers |= VERSYM_HIDDEN; | |
5326 | ||
5327 | _bfd_elf_swap_versym_out (finfo->output_bfd, &iversym, | |
5328 | (((Elf_External_Versym *) | |
5329 | finfo->symver_sec->contents) | |
5330 | + h->dynindx)); | |
5331 | } | |
5332 | } | |
5333 | ||
5334 | /* If we're stripping it, then it was just a dynamic symbol, and | |
5335 | there's nothing else to do. */ | |
5336 | if (strip) | |
5337 | return true; | |
5338 | ||
5339 | h->indx = bfd_get_symcount (finfo->output_bfd); | |
5340 | ||
5341 | if (! elf_link_output_sym (finfo, h->root.root.string, &sym, input_sec)) | |
5342 | { | |
5343 | eoinfo->failed = true; | |
5344 | return false; | |
5345 | } | |
5346 | ||
5347 | return true; | |
5348 | } | |
5349 | ||
23bc299b MM |
5350 | /* Copy the relocations indicated by the INTERNAL_RELOCS (which |
5351 | originated from the section given by INPUT_REL_HDR) to the | |
5352 | OUTPUT_BFD. */ | |
5353 | ||
5354 | static void | |
5355 | elf_link_output_relocs (output_bfd, input_section, input_rel_hdr, | |
5356 | internal_relocs) | |
5357 | bfd *output_bfd; | |
5358 | asection *input_section; | |
5359 | Elf_Internal_Shdr *input_rel_hdr; | |
5360 | Elf_Internal_Rela *internal_relocs; | |
5361 | { | |
5362 | Elf_Internal_Rela *irela; | |
5363 | Elf_Internal_Rela *irelaend; | |
5364 | Elf_Internal_Shdr *output_rel_hdr; | |
5365 | asection *output_section; | |
7442e600 | 5366 | unsigned int *rel_countp = NULL; |
32f0787a | 5367 | struct elf_backend_data *bed; |
23bc299b MM |
5368 | |
5369 | output_section = input_section->output_section; | |
5370 | output_rel_hdr = NULL; | |
5371 | ||
5372 | if (elf_section_data (output_section)->rel_hdr.sh_entsize | |
5373 | == input_rel_hdr->sh_entsize) | |
5374 | { | |
5375 | output_rel_hdr = &elf_section_data (output_section)->rel_hdr; | |
5376 | rel_countp = &elf_section_data (output_section)->rel_count; | |
5377 | } | |
5378 | else if (elf_section_data (output_section)->rel_hdr2 | |
5379 | && (elf_section_data (output_section)->rel_hdr2->sh_entsize | |
5380 | == input_rel_hdr->sh_entsize)) | |
5381 | { | |
5382 | output_rel_hdr = elf_section_data (output_section)->rel_hdr2; | |
5383 | rel_countp = &elf_section_data (output_section)->rel_count2; | |
5384 | } | |
5385 | ||
5386 | BFD_ASSERT (output_rel_hdr != NULL); | |
32f0787a UC |
5387 | |
5388 | bed = get_elf_backend_data (output_bfd); | |
23bc299b MM |
5389 | irela = internal_relocs; |
5390 | irelaend = irela + input_rel_hdr->sh_size / input_rel_hdr->sh_entsize; | |
5391 | if (input_rel_hdr->sh_entsize == sizeof (Elf_External_Rel)) | |
5392 | { | |
5393 | Elf_External_Rel *erel; | |
5394 | ||
5395 | erel = ((Elf_External_Rel *) output_rel_hdr->contents + *rel_countp); | |
5396 | for (; irela < irelaend; irela++, erel++) | |
5397 | { | |
5398 | Elf_Internal_Rel irel; | |
5399 | ||
5400 | irel.r_offset = irela->r_offset; | |
5401 | irel.r_info = irela->r_info; | |
5402 | BFD_ASSERT (irela->r_addend == 0); | |
32f0787a UC |
5403 | if (bed->s->swap_reloc_out) |
5404 | (*bed->s->swap_reloc_out) (output_bfd, &irel, (PTR) erel); | |
5405 | else | |
5406 | elf_swap_reloc_out (output_bfd, &irel, erel); | |
23bc299b MM |
5407 | } |
5408 | } | |
5409 | else | |
5410 | { | |
5411 | Elf_External_Rela *erela; | |
5412 | ||
5413 | BFD_ASSERT (input_rel_hdr->sh_entsize | |
5414 | == sizeof (Elf_External_Rela)); | |
5415 | erela = ((Elf_External_Rela *) output_rel_hdr->contents + *rel_countp); | |
5416 | for (; irela < irelaend; irela++, erela++) | |
32f0787a UC |
5417 | if (bed->s->swap_reloca_out) |
5418 | (*bed->s->swap_reloca_out) (output_bfd, irela, (PTR) erela); | |
5419 | else | |
5420 | elf_swap_reloca_out (output_bfd, irela, erela); | |
23bc299b MM |
5421 | } |
5422 | ||
5423 | /* Bump the counter, so that we know where to add the next set of | |
5424 | relocations. */ | |
5425 | *rel_countp += input_rel_hdr->sh_size / input_rel_hdr->sh_entsize; | |
5426 | } | |
5427 | ||
252b5132 RH |
5428 | /* Link an input file into the linker output file. This function |
5429 | handles all the sections and relocations of the input file at once. | |
5430 | This is so that we only have to read the local symbols once, and | |
5431 | don't have to keep them in memory. */ | |
5432 | ||
5433 | static boolean | |
5434 | elf_link_input_bfd (finfo, input_bfd) | |
5435 | struct elf_final_link_info *finfo; | |
5436 | bfd *input_bfd; | |
5437 | { | |
5438 | boolean (*relocate_section) PARAMS ((bfd *, struct bfd_link_info *, | |
5439 | bfd *, asection *, bfd_byte *, | |
5440 | Elf_Internal_Rela *, | |
5441 | Elf_Internal_Sym *, asection **)); | |
5442 | bfd *output_bfd; | |
5443 | Elf_Internal_Shdr *symtab_hdr; | |
5444 | size_t locsymcount; | |
5445 | size_t extsymoff; | |
5446 | Elf_External_Sym *external_syms; | |
5447 | Elf_External_Sym *esym; | |
5448 | Elf_External_Sym *esymend; | |
5449 | Elf_Internal_Sym *isym; | |
5450 | long *pindex; | |
5451 | asection **ppsection; | |
5452 | asection *o; | |
c7ac6ff8 | 5453 | struct elf_backend_data *bed; |
252b5132 RH |
5454 | |
5455 | output_bfd = finfo->output_bfd; | |
c7ac6ff8 MM |
5456 | bed = get_elf_backend_data (output_bfd); |
5457 | relocate_section = bed->elf_backend_relocate_section; | |
252b5132 RH |
5458 | |
5459 | /* If this is a dynamic object, we don't want to do anything here: | |
5460 | we don't want the local symbols, and we don't want the section | |
5461 | contents. */ | |
5462 | if ((input_bfd->flags & DYNAMIC) != 0) | |
5463 | return true; | |
5464 | ||
5465 | symtab_hdr = &elf_tdata (input_bfd)->symtab_hdr; | |
5466 | if (elf_bad_symtab (input_bfd)) | |
5467 | { | |
5468 | locsymcount = symtab_hdr->sh_size / sizeof (Elf_External_Sym); | |
5469 | extsymoff = 0; | |
5470 | } | |
5471 | else | |
5472 | { | |
5473 | locsymcount = symtab_hdr->sh_info; | |
5474 | extsymoff = symtab_hdr->sh_info; | |
5475 | } | |
5476 | ||
5477 | /* Read the local symbols. */ | |
5478 | if (symtab_hdr->contents != NULL) | |
5479 | external_syms = (Elf_External_Sym *) symtab_hdr->contents; | |
5480 | else if (locsymcount == 0) | |
5481 | external_syms = NULL; | |
5482 | else | |
5483 | { | |
5484 | external_syms = finfo->external_syms; | |
5485 | if (bfd_seek (input_bfd, symtab_hdr->sh_offset, SEEK_SET) != 0 | |
5486 | || (bfd_read (external_syms, sizeof (Elf_External_Sym), | |
5487 | locsymcount, input_bfd) | |
5488 | != locsymcount * sizeof (Elf_External_Sym))) | |
5489 | return false; | |
5490 | } | |
5491 | ||
5492 | /* Swap in the local symbols and write out the ones which we know | |
5493 | are going into the output file. */ | |
5494 | esym = external_syms; | |
5495 | esymend = esym + locsymcount; | |
5496 | isym = finfo->internal_syms; | |
5497 | pindex = finfo->indices; | |
5498 | ppsection = finfo->sections; | |
5499 | for (; esym < esymend; esym++, isym++, pindex++, ppsection++) | |
5500 | { | |
5501 | asection *isec; | |
5502 | const char *name; | |
5503 | Elf_Internal_Sym osym; | |
5504 | ||
5505 | elf_swap_symbol_in (input_bfd, esym, isym); | |
5506 | *pindex = -1; | |
5507 | ||
5508 | if (elf_bad_symtab (input_bfd)) | |
5509 | { | |
5510 | if (ELF_ST_BIND (isym->st_info) != STB_LOCAL) | |
5511 | { | |
5512 | *ppsection = NULL; | |
5513 | continue; | |
5514 | } | |
5515 | } | |
5516 | ||
5517 | if (isym->st_shndx == SHN_UNDEF) | |
5518 | isec = bfd_und_section_ptr; | |
5519 | else if (isym->st_shndx > 0 && isym->st_shndx < SHN_LORESERVE) | |
5520 | isec = section_from_elf_index (input_bfd, isym->st_shndx); | |
5521 | else if (isym->st_shndx == SHN_ABS) | |
5522 | isec = bfd_abs_section_ptr; | |
5523 | else if (isym->st_shndx == SHN_COMMON) | |
5524 | isec = bfd_com_section_ptr; | |
5525 | else | |
5526 | { | |
5527 | /* Who knows? */ | |
5528 | isec = NULL; | |
5529 | } | |
5530 | ||
5531 | *ppsection = isec; | |
5532 | ||
5533 | /* Don't output the first, undefined, symbol. */ | |
5534 | if (esym == external_syms) | |
5535 | continue; | |
5536 | ||
24376d1b AM |
5537 | if (ELF_ST_TYPE (isym->st_info) == STT_SECTION) |
5538 | { | |
5539 | asection *ksec; | |
5540 | ||
5541 | /* Save away all section symbol values. */ | |
5542 | if (isec != NULL) | |
5543 | isec->symbol->value = isym->st_value; | |
5544 | ||
5545 | /* If this is a discarded link-once section symbol, update | |
5546 | it's value to that of the kept section symbol. The | |
5547 | linker will keep the first of any matching link-once | |
5548 | sections, so we should have already seen it's section | |
5549 | symbol. I trust no-one will have the bright idea of | |
5550 | re-ordering the bfd list... */ | |
5551 | if (isec != NULL | |
5552 | && (bfd_get_section_flags (input_bfd, isec) & SEC_LINK_ONCE) != 0 | |
5553 | && (ksec = isec->kept_section) != NULL) | |
5554 | { | |
5555 | isym->st_value = ksec->symbol->value; | |
5556 | ||
5557 | /* That put the value right, but the section info is all | |
5558 | wrong. I hope this works. */ | |
5559 | isec->output_offset = ksec->output_offset; | |
5560 | isec->output_section = ksec->output_section; | |
5561 | } | |
5562 | ||
5563 | /* We never output section symbols. Instead, we use the | |
5564 | section symbol of the corresponding section in the output | |
5565 | file. */ | |
5566 | continue; | |
5567 | } | |
5568 | ||
252b5132 RH |
5569 | /* If we are stripping all symbols, we don't want to output this |
5570 | one. */ | |
5571 | if (finfo->info->strip == strip_all) | |
5572 | continue; | |
5573 | ||
252b5132 RH |
5574 | /* If we are discarding all local symbols, we don't want to |
5575 | output this one. If we are generating a relocateable output | |
5576 | file, then some of the local symbols may be required by | |
5577 | relocs; we output them below as we discover that they are | |
5578 | needed. */ | |
5579 | if (finfo->info->discard == discard_all) | |
5580 | continue; | |
5581 | ||
5582 | /* If this symbol is defined in a section which we are | |
5583 | discarding, we don't need to keep it, but note that | |
5584 | linker_mark is only reliable for sections that have contents. | |
5585 | For the benefit of the MIPS ELF linker, we check SEC_EXCLUDE | |
5586 | as well as linker_mark. */ | |
5587 | if (isym->st_shndx > 0 | |
5588 | && isym->st_shndx < SHN_LORESERVE | |
5589 | && isec != NULL | |
5590 | && ((! isec->linker_mark && (isec->flags & SEC_HAS_CONTENTS) != 0) | |
5591 | || (! finfo->info->relocateable | |
5592 | && (isec->flags & SEC_EXCLUDE) != 0))) | |
5593 | continue; | |
5594 | ||
5595 | /* Get the name of the symbol. */ | |
5596 | name = bfd_elf_string_from_elf_section (input_bfd, symtab_hdr->sh_link, | |
5597 | isym->st_name); | |
5598 | if (name == NULL) | |
5599 | return false; | |
5600 | ||
5601 | /* See if we are discarding symbols with this name. */ | |
5602 | if ((finfo->info->strip == strip_some | |
5603 | && (bfd_hash_lookup (finfo->info->keep_hash, name, false, false) | |
5604 | == NULL)) | |
5605 | || (finfo->info->discard == discard_l | |
5606 | && bfd_is_local_label_name (input_bfd, name))) | |
5607 | continue; | |
5608 | ||
5609 | /* If we get here, we are going to output this symbol. */ | |
5610 | ||
5611 | osym = *isym; | |
5612 | ||
5613 | /* Adjust the section index for the output file. */ | |
5614 | osym.st_shndx = _bfd_elf_section_from_bfd_section (output_bfd, | |
5615 | isec->output_section); | |
5616 | if (osym.st_shndx == (unsigned short) -1) | |
5617 | return false; | |
5618 | ||
5619 | *pindex = bfd_get_symcount (output_bfd); | |
5620 | ||
5621 | /* ELF symbols in relocateable files are section relative, but | |
5622 | in executable files they are virtual addresses. Note that | |
5623 | this code assumes that all ELF sections have an associated | |
5624 | BFD section with a reasonable value for output_offset; below | |
5625 | we assume that they also have a reasonable value for | |
5626 | output_section. Any special sections must be set up to meet | |
5627 | these requirements. */ | |
5628 | osym.st_value += isec->output_offset; | |
5629 | if (! finfo->info->relocateable) | |
5630 | osym.st_value += isec->output_section->vma; | |
5631 | ||
5632 | if (! elf_link_output_sym (finfo, name, &osym, isec)) | |
5633 | return false; | |
5634 | } | |
5635 | ||
5636 | /* Relocate the contents of each section. */ | |
5637 | for (o = input_bfd->sections; o != NULL; o = o->next) | |
5638 | { | |
5639 | bfd_byte *contents; | |
5640 | ||
5641 | if (! o->linker_mark) | |
5642 | { | |
5643 | /* This section was omitted from the link. */ | |
5644 | continue; | |
5645 | } | |
5646 | ||
5647 | if ((o->flags & SEC_HAS_CONTENTS) == 0 | |
5648 | || (o->_raw_size == 0 && (o->flags & SEC_RELOC) == 0)) | |
5649 | continue; | |
5650 | ||
5651 | if ((o->flags & SEC_LINKER_CREATED) != 0) | |
5652 | { | |
5653 | /* Section was created by elf_link_create_dynamic_sections | |
5654 | or somesuch. */ | |
5655 | continue; | |
5656 | } | |
5657 | ||
5658 | /* Get the contents of the section. They have been cached by a | |
5659 | relaxation routine. Note that o is a section in an input | |
5660 | file, so the contents field will not have been set by any of | |
5661 | the routines which work on output files. */ | |
5662 | if (elf_section_data (o)->this_hdr.contents != NULL) | |
5663 | contents = elf_section_data (o)->this_hdr.contents; | |
5664 | else | |
5665 | { | |
5666 | contents = finfo->contents; | |
5667 | if (! bfd_get_section_contents (input_bfd, o, contents, | |
5668 | (file_ptr) 0, o->_raw_size)) | |
5669 | return false; | |
5670 | } | |
5671 | ||
5672 | if ((o->flags & SEC_RELOC) != 0) | |
5673 | { | |
5674 | Elf_Internal_Rela *internal_relocs; | |
5675 | ||
5676 | /* Get the swapped relocs. */ | |
5677 | internal_relocs = (NAME(_bfd_elf,link_read_relocs) | |
5678 | (input_bfd, o, finfo->external_relocs, | |
5679 | finfo->internal_relocs, false)); | |
5680 | if (internal_relocs == NULL | |
5681 | && o->reloc_count > 0) | |
5682 | return false; | |
5683 | ||
5684 | /* Relocate the section by invoking a back end routine. | |
5685 | ||
5686 | The back end routine is responsible for adjusting the | |
5687 | section contents as necessary, and (if using Rela relocs | |
5688 | and generating a relocateable output file) adjusting the | |
5689 | reloc addend as necessary. | |
5690 | ||
5691 | The back end routine does not have to worry about setting | |
5692 | the reloc address or the reloc symbol index. | |
5693 | ||
5694 | The back end routine is given a pointer to the swapped in | |
5695 | internal symbols, and can access the hash table entries | |
5696 | for the external symbols via elf_sym_hashes (input_bfd). | |
5697 | ||
5698 | When generating relocateable output, the back end routine | |
5699 | must handle STB_LOCAL/STT_SECTION symbols specially. The | |
5700 | output symbol is going to be a section symbol | |
5701 | corresponding to the output section, which will require | |
5702 | the addend to be adjusted. */ | |
5703 | ||
5704 | if (! (*relocate_section) (output_bfd, finfo->info, | |
5705 | input_bfd, o, contents, | |
5706 | internal_relocs, | |
5707 | finfo->internal_syms, | |
5708 | finfo->sections)) | |
5709 | return false; | |
5710 | ||
a712da20 | 5711 | if (finfo->info->relocateable || finfo->info->emitrelocations) |
252b5132 RH |
5712 | { |
5713 | Elf_Internal_Rela *irela; | |
5714 | Elf_Internal_Rela *irelaend; | |
5715 | struct elf_link_hash_entry **rel_hash; | |
5716 | Elf_Internal_Shdr *input_rel_hdr; | |
252b5132 RH |
5717 | |
5718 | /* Adjust the reloc addresses and symbol indices. */ | |
5719 | ||
5720 | irela = internal_relocs; | |
c7ac6ff8 MM |
5721 | irelaend = |
5722 | irela + o->reloc_count * bed->s->int_rels_per_ext_rel; | |
252b5132 | 5723 | rel_hash = (elf_section_data (o->output_section)->rel_hashes |
31367b81 MM |
5724 | + elf_section_data (o->output_section)->rel_count |
5725 | + elf_section_data (o->output_section)->rel_count2); | |
252b5132 RH |
5726 | for (; irela < irelaend; irela++, rel_hash++) |
5727 | { | |
5728 | unsigned long r_symndx; | |
5729 | Elf_Internal_Sym *isym; | |
5730 | asection *sec; | |
5731 | ||
5732 | irela->r_offset += o->output_offset; | |
5733 | ||
7ad34365 NC |
5734 | /* Relocs in an executable have to be virtual addresses. */ |
5735 | if (finfo->info->emitrelocations) | |
5736 | irela->r_offset += o->output_section->vma; | |
5737 | ||
252b5132 RH |
5738 | r_symndx = ELF_R_SYM (irela->r_info); |
5739 | ||
5740 | if (r_symndx == 0) | |
5741 | continue; | |
5742 | ||
5743 | if (r_symndx >= locsymcount | |
5744 | || (elf_bad_symtab (input_bfd) | |
5745 | && finfo->sections[r_symndx] == NULL)) | |
5746 | { | |
5747 | struct elf_link_hash_entry *rh; | |
5748 | long indx; | |
5749 | ||
5750 | /* This is a reloc against a global symbol. We | |
5751 | have not yet output all the local symbols, so | |
5752 | we do not know the symbol index of any global | |
5753 | symbol. We set the rel_hash entry for this | |
5754 | reloc to point to the global hash table entry | |
5755 | for this symbol. The symbol index is then | |
5756 | set at the end of elf_bfd_final_link. */ | |
5757 | indx = r_symndx - extsymoff; | |
5758 | rh = elf_sym_hashes (input_bfd)[indx]; | |
5759 | while (rh->root.type == bfd_link_hash_indirect | |
5760 | || rh->root.type == bfd_link_hash_warning) | |
5761 | rh = (struct elf_link_hash_entry *) rh->root.u.i.link; | |
5762 | ||
5763 | /* Setting the index to -2 tells | |
5764 | elf_link_output_extsym that this symbol is | |
5765 | used by a reloc. */ | |
5766 | BFD_ASSERT (rh->indx < 0); | |
5767 | rh->indx = -2; | |
5768 | ||
5769 | *rel_hash = rh; | |
5770 | ||
5771 | continue; | |
5772 | } | |
5773 | ||
5774 | /* This is a reloc against a local symbol. */ | |
5775 | ||
5776 | *rel_hash = NULL; | |
5777 | isym = finfo->internal_syms + r_symndx; | |
5778 | sec = finfo->sections[r_symndx]; | |
5779 | if (ELF_ST_TYPE (isym->st_info) == STT_SECTION) | |
5780 | { | |
5781 | /* I suppose the backend ought to fill in the | |
5782 | section of any STT_SECTION symbol against a | |
5783 | processor specific section. If we have | |
5784 | discarded a section, the output_section will | |
5785 | be the absolute section. */ | |
5786 | if (sec != NULL | |
5787 | && (bfd_is_abs_section (sec) | |
5788 | || (sec->output_section != NULL | |
5789 | && bfd_is_abs_section (sec->output_section)))) | |
5790 | r_symndx = 0; | |
5791 | else if (sec == NULL || sec->owner == NULL) | |
5792 | { | |
5793 | bfd_set_error (bfd_error_bad_value); | |
5794 | return false; | |
5795 | } | |
5796 | else | |
5797 | { | |
5798 | r_symndx = sec->output_section->target_index; | |
5799 | BFD_ASSERT (r_symndx != 0); | |
5800 | } | |
5801 | } | |
5802 | else | |
5803 | { | |
5804 | if (finfo->indices[r_symndx] == -1) | |
5805 | { | |
5806 | unsigned long link; | |
5807 | const char *name; | |
5808 | asection *osec; | |
5809 | ||
5810 | if (finfo->info->strip == strip_all) | |
5811 | { | |
5812 | /* You can't do ld -r -s. */ | |
5813 | bfd_set_error (bfd_error_invalid_operation); | |
5814 | return false; | |
5815 | } | |
5816 | ||
5817 | /* This symbol was skipped earlier, but | |
5818 | since it is needed by a reloc, we | |
5819 | must output it now. */ | |
5820 | link = symtab_hdr->sh_link; | |
5821 | name = bfd_elf_string_from_elf_section (input_bfd, | |
5822 | link, | |
5823 | isym->st_name); | |
5824 | if (name == NULL) | |
5825 | return false; | |
5826 | ||
5827 | osec = sec->output_section; | |
5828 | isym->st_shndx = | |
5829 | _bfd_elf_section_from_bfd_section (output_bfd, | |
5830 | osec); | |
5831 | if (isym->st_shndx == (unsigned short) -1) | |
5832 | return false; | |
5833 | ||
5834 | isym->st_value += sec->output_offset; | |
5835 | if (! finfo->info->relocateable) | |
5836 | isym->st_value += osec->vma; | |
5837 | ||
5838 | finfo->indices[r_symndx] = bfd_get_symcount (output_bfd); | |
5839 | ||
5840 | if (! elf_link_output_sym (finfo, name, isym, sec)) | |
5841 | return false; | |
5842 | } | |
5843 | ||
5844 | r_symndx = finfo->indices[r_symndx]; | |
5845 | } | |
5846 | ||
5847 | irela->r_info = ELF_R_INFO (r_symndx, | |
5848 | ELF_R_TYPE (irela->r_info)); | |
5849 | } | |
5850 | ||
5851 | /* Swap out the relocs. */ | |
5852 | input_rel_hdr = &elf_section_data (o)->rel_hdr; | |
23bc299b MM |
5853 | elf_link_output_relocs (output_bfd, o, |
5854 | input_rel_hdr, | |
5855 | internal_relocs); | |
5856 | internal_relocs | |
5857 | += input_rel_hdr->sh_size / input_rel_hdr->sh_entsize; | |
5858 | input_rel_hdr = elf_section_data (o)->rel_hdr2; | |
5859 | if (input_rel_hdr) | |
5860 | elf_link_output_relocs (output_bfd, o, | |
5861 | input_rel_hdr, | |
5862 | internal_relocs); | |
252b5132 RH |
5863 | } |
5864 | } | |
5865 | ||
5866 | /* Write out the modified section contents. */ | |
5867 | if (elf_section_data (o)->stab_info == NULL) | |
5868 | { | |
5869 | if (! (o->flags & SEC_EXCLUDE) && | |
5870 | ! bfd_set_section_contents (output_bfd, o->output_section, | |
5871 | contents, o->output_offset, | |
5872 | (o->_cooked_size != 0 | |
5873 | ? o->_cooked_size | |
5874 | : o->_raw_size))) | |
5875 | return false; | |
5876 | } | |
5877 | else | |
5878 | { | |
5879 | if (! (_bfd_write_section_stabs | |
5880 | (output_bfd, &elf_hash_table (finfo->info)->stab_info, | |
5881 | o, &elf_section_data (o)->stab_info, contents))) | |
5882 | return false; | |
5883 | } | |
5884 | } | |
5885 | ||
5886 | return true; | |
5887 | } | |
5888 | ||
5889 | /* Generate a reloc when linking an ELF file. This is a reloc | |
5890 | requested by the linker, and does come from any input file. This | |
5891 | is used to build constructor and destructor tables when linking | |
5892 | with -Ur. */ | |
5893 | ||
5894 | static boolean | |
5895 | elf_reloc_link_order (output_bfd, info, output_section, link_order) | |
5896 | bfd *output_bfd; | |
5897 | struct bfd_link_info *info; | |
5898 | asection *output_section; | |
5899 | struct bfd_link_order *link_order; | |
5900 | { | |
5901 | reloc_howto_type *howto; | |
5902 | long indx; | |
5903 | bfd_vma offset; | |
5904 | bfd_vma addend; | |
5905 | struct elf_link_hash_entry **rel_hash_ptr; | |
5906 | Elf_Internal_Shdr *rel_hdr; | |
32f0787a | 5907 | struct elf_backend_data *bed = get_elf_backend_data (output_bfd); |
252b5132 RH |
5908 | |
5909 | howto = bfd_reloc_type_lookup (output_bfd, link_order->u.reloc.p->reloc); | |
5910 | if (howto == NULL) | |
5911 | { | |
5912 | bfd_set_error (bfd_error_bad_value); | |
5913 | return false; | |
5914 | } | |
5915 | ||
5916 | addend = link_order->u.reloc.p->addend; | |
5917 | ||
5918 | /* Figure out the symbol index. */ | |
5919 | rel_hash_ptr = (elf_section_data (output_section)->rel_hashes | |
31367b81 MM |
5920 | + elf_section_data (output_section)->rel_count |
5921 | + elf_section_data (output_section)->rel_count2); | |
252b5132 RH |
5922 | if (link_order->type == bfd_section_reloc_link_order) |
5923 | { | |
5924 | indx = link_order->u.reloc.p->u.section->target_index; | |
5925 | BFD_ASSERT (indx != 0); | |
5926 | *rel_hash_ptr = NULL; | |
5927 | } | |
5928 | else | |
5929 | { | |
5930 | struct elf_link_hash_entry *h; | |
5931 | ||
5932 | /* Treat a reloc against a defined symbol as though it were | |
5933 | actually against the section. */ | |
5934 | h = ((struct elf_link_hash_entry *) | |
5935 | bfd_wrapped_link_hash_lookup (output_bfd, info, | |
5936 | link_order->u.reloc.p->u.name, | |
5937 | false, false, true)); | |
5938 | if (h != NULL | |
5939 | && (h->root.type == bfd_link_hash_defined | |
5940 | || h->root.type == bfd_link_hash_defweak)) | |
5941 | { | |
5942 | asection *section; | |
5943 | ||
5944 | section = h->root.u.def.section; | |
5945 | indx = section->output_section->target_index; | |
5946 | *rel_hash_ptr = NULL; | |
5947 | /* It seems that we ought to add the symbol value to the | |
5948 | addend here, but in practice it has already been added | |
5949 | because it was passed to constructor_callback. */ | |
5950 | addend += section->output_section->vma + section->output_offset; | |
5951 | } | |
5952 | else if (h != NULL) | |
5953 | { | |
5954 | /* Setting the index to -2 tells elf_link_output_extsym that | |
5955 | this symbol is used by a reloc. */ | |
5956 | h->indx = -2; | |
5957 | *rel_hash_ptr = h; | |
5958 | indx = 0; | |
5959 | } | |
5960 | else | |
5961 | { | |
5962 | if (! ((*info->callbacks->unattached_reloc) | |
5963 | (info, link_order->u.reloc.p->u.name, (bfd *) NULL, | |
5964 | (asection *) NULL, (bfd_vma) 0))) | |
5965 | return false; | |
5966 | indx = 0; | |
5967 | } | |
5968 | } | |
5969 | ||
5970 | /* If this is an inplace reloc, we must write the addend into the | |
5971 | object file. */ | |
5972 | if (howto->partial_inplace && addend != 0) | |
5973 | { | |
5974 | bfd_size_type size; | |
5975 | bfd_reloc_status_type rstat; | |
5976 | bfd_byte *buf; | |
5977 | boolean ok; | |
5978 | ||
5979 | size = bfd_get_reloc_size (howto); | |
5980 | buf = (bfd_byte *) bfd_zmalloc (size); | |
5981 | if (buf == (bfd_byte *) NULL) | |
5982 | return false; | |
5983 | rstat = _bfd_relocate_contents (howto, output_bfd, addend, buf); | |
5984 | switch (rstat) | |
5985 | { | |
5986 | case bfd_reloc_ok: | |
5987 | break; | |
5988 | default: | |
5989 | case bfd_reloc_outofrange: | |
5990 | abort (); | |
5991 | case bfd_reloc_overflow: | |
5992 | if (! ((*info->callbacks->reloc_overflow) | |
5993 | (info, | |
5994 | (link_order->type == bfd_section_reloc_link_order | |
5995 | ? bfd_section_name (output_bfd, | |
5996 | link_order->u.reloc.p->u.section) | |
5997 | : link_order->u.reloc.p->u.name), | |
5998 | howto->name, addend, (bfd *) NULL, (asection *) NULL, | |
5999 | (bfd_vma) 0))) | |
6000 | { | |
6001 | free (buf); | |
6002 | return false; | |
6003 | } | |
6004 | break; | |
6005 | } | |
6006 | ok = bfd_set_section_contents (output_bfd, output_section, (PTR) buf, | |
6007 | (file_ptr) link_order->offset, size); | |
6008 | free (buf); | |
6009 | if (! ok) | |
6010 | return false; | |
6011 | } | |
6012 | ||
6013 | /* The address of a reloc is relative to the section in a | |
6014 | relocateable file, and is a virtual address in an executable | |
6015 | file. */ | |
6016 | offset = link_order->offset; | |
6017 | if (! info->relocateable) | |
6018 | offset += output_section->vma; | |
6019 | ||
6020 | rel_hdr = &elf_section_data (output_section)->rel_hdr; | |
6021 | ||
6022 | if (rel_hdr->sh_type == SHT_REL) | |
6023 | { | |
6024 | Elf_Internal_Rel irel; | |
6025 | Elf_External_Rel *erel; | |
6026 | ||
6027 | irel.r_offset = offset; | |
6028 | irel.r_info = ELF_R_INFO (indx, howto->type); | |
6029 | erel = ((Elf_External_Rel *) rel_hdr->contents | |
0525d26e | 6030 | + elf_section_data (output_section)->rel_count); |
32f0787a UC |
6031 | if (bed->s->swap_reloc_out) |
6032 | (*bed->s->swap_reloc_out) (output_bfd, &irel, (bfd_byte *) erel); | |
6033 | else | |
6034 | elf_swap_reloc_out (output_bfd, &irel, erel); | |
252b5132 RH |
6035 | } |
6036 | else | |
6037 | { | |
6038 | Elf_Internal_Rela irela; | |
6039 | Elf_External_Rela *erela; | |
6040 | ||
6041 | irela.r_offset = offset; | |
6042 | irela.r_info = ELF_R_INFO (indx, howto->type); | |
6043 | irela.r_addend = addend; | |
6044 | erela = ((Elf_External_Rela *) rel_hdr->contents | |
0525d26e | 6045 | + elf_section_data (output_section)->rel_count); |
32f0787a UC |
6046 | if (bed->s->swap_reloca_out) |
6047 | (*bed->s->swap_reloca_out) (output_bfd, &irela, (bfd_byte *) erela); | |
6048 | else | |
6049 | elf_swap_reloca_out (output_bfd, &irela, erela); | |
252b5132 RH |
6050 | } |
6051 | ||
0525d26e | 6052 | ++elf_section_data (output_section)->rel_count; |
252b5132 RH |
6053 | |
6054 | return true; | |
6055 | } | |
6056 | ||
6057 | \f | |
6058 | /* Allocate a pointer to live in a linker created section. */ | |
6059 | ||
6060 | boolean | |
6061 | elf_create_pointer_linker_section (abfd, info, lsect, h, rel) | |
6062 | bfd *abfd; | |
6063 | struct bfd_link_info *info; | |
6064 | elf_linker_section_t *lsect; | |
6065 | struct elf_link_hash_entry *h; | |
6066 | const Elf_Internal_Rela *rel; | |
6067 | { | |
6068 | elf_linker_section_pointers_t **ptr_linker_section_ptr = NULL; | |
6069 | elf_linker_section_pointers_t *linker_section_ptr; | |
6070 | unsigned long r_symndx = ELF_R_SYM (rel->r_info);; | |
6071 | ||
6072 | BFD_ASSERT (lsect != NULL); | |
6073 | ||
6074 | /* Is this a global symbol? */ | |
6075 | if (h != NULL) | |
6076 | { | |
6077 | /* Has this symbol already been allocated, if so, our work is done */ | |
6078 | if (_bfd_elf_find_pointer_linker_section (h->linker_section_pointer, | |
6079 | rel->r_addend, | |
6080 | lsect->which)) | |
6081 | return true; | |
6082 | ||
6083 | ptr_linker_section_ptr = &h->linker_section_pointer; | |
6084 | /* Make sure this symbol is output as a dynamic symbol. */ | |
6085 | if (h->dynindx == -1) | |
6086 | { | |
6087 | if (! elf_link_record_dynamic_symbol (info, h)) | |
6088 | return false; | |
6089 | } | |
6090 | ||
6091 | if (lsect->rel_section) | |
6092 | lsect->rel_section->_raw_size += sizeof (Elf_External_Rela); | |
6093 | } | |
6094 | ||
6095 | else /* Allocation of a pointer to a local symbol */ | |
6096 | { | |
6097 | elf_linker_section_pointers_t **ptr = elf_local_ptr_offsets (abfd); | |
6098 | ||
6099 | /* Allocate a table to hold the local symbols if first time */ | |
6100 | if (!ptr) | |
6101 | { | |
6102 | unsigned int num_symbols = elf_tdata (abfd)->symtab_hdr.sh_info; | |
6103 | register unsigned int i; | |
6104 | ||
6105 | ptr = (elf_linker_section_pointers_t **) | |
6106 | bfd_alloc (abfd, num_symbols * sizeof (elf_linker_section_pointers_t *)); | |
6107 | ||
6108 | if (!ptr) | |
6109 | return false; | |
6110 | ||
6111 | elf_local_ptr_offsets (abfd) = ptr; | |
6112 | for (i = 0; i < num_symbols; i++) | |
6113 | ptr[i] = (elf_linker_section_pointers_t *)0; | |
6114 | } | |
6115 | ||
6116 | /* Has this symbol already been allocated, if so, our work is done */ | |
6117 | if (_bfd_elf_find_pointer_linker_section (ptr[r_symndx], | |
6118 | rel->r_addend, | |
6119 | lsect->which)) | |
6120 | return true; | |
6121 | ||
6122 | ptr_linker_section_ptr = &ptr[r_symndx]; | |
6123 | ||
6124 | if (info->shared) | |
6125 | { | |
6126 | /* If we are generating a shared object, we need to | |
6127 | output a R_<xxx>_RELATIVE reloc so that the | |
6128 | dynamic linker can adjust this GOT entry. */ | |
6129 | BFD_ASSERT (lsect->rel_section != NULL); | |
6130 | lsect->rel_section->_raw_size += sizeof (Elf_External_Rela); | |
6131 | } | |
6132 | } | |
6133 | ||
6134 | /* Allocate space for a pointer in the linker section, and allocate a new pointer record | |
6135 | from internal memory. */ | |
6136 | BFD_ASSERT (ptr_linker_section_ptr != NULL); | |
6137 | linker_section_ptr = (elf_linker_section_pointers_t *) | |
6138 | bfd_alloc (abfd, sizeof (elf_linker_section_pointers_t)); | |
6139 | ||
6140 | if (!linker_section_ptr) | |
6141 | return false; | |
6142 | ||
6143 | linker_section_ptr->next = *ptr_linker_section_ptr; | |
6144 | linker_section_ptr->addend = rel->r_addend; | |
6145 | linker_section_ptr->which = lsect->which; | |
6146 | linker_section_ptr->written_address_p = false; | |
6147 | *ptr_linker_section_ptr = linker_section_ptr; | |
6148 | ||
6149 | #if 0 | |
6150 | if (lsect->hole_size && lsect->hole_offset < lsect->max_hole_offset) | |
6151 | { | |
6152 | linker_section_ptr->offset = lsect->section->_raw_size - lsect->hole_size + (ARCH_SIZE / 8); | |
6153 | lsect->hole_offset += ARCH_SIZE / 8; | |
6154 | lsect->sym_offset += ARCH_SIZE / 8; | |
6155 | if (lsect->sym_hash) /* Bump up symbol value if needed */ | |
6156 | { | |
6157 | lsect->sym_hash->root.u.def.value += ARCH_SIZE / 8; | |
6158 | #ifdef DEBUG | |
6159 | fprintf (stderr, "Bump up %s by %ld, current value = %ld\n", | |
6160 | lsect->sym_hash->root.root.string, | |
6161 | (long)ARCH_SIZE / 8, | |
6162 | (long)lsect->sym_hash->root.u.def.value); | |
6163 | #endif | |
6164 | } | |
6165 | } | |
6166 | else | |
6167 | #endif | |
6168 | linker_section_ptr->offset = lsect->section->_raw_size; | |
6169 | ||
6170 | lsect->section->_raw_size += ARCH_SIZE / 8; | |
6171 | ||
6172 | #ifdef DEBUG | |
6173 | fprintf (stderr, "Create pointer in linker section %s, offset = %ld, section size = %ld\n", | |
6174 | lsect->name, (long)linker_section_ptr->offset, (long)lsect->section->_raw_size); | |
6175 | #endif | |
6176 | ||
6177 | return true; | |
6178 | } | |
6179 | ||
6180 | \f | |
6181 | #if ARCH_SIZE==64 | |
6182 | #define bfd_put_ptr(BFD,VAL,ADDR) bfd_put_64 (BFD, VAL, ADDR) | |
6183 | #endif | |
6184 | #if ARCH_SIZE==32 | |
6185 | #define bfd_put_ptr(BFD,VAL,ADDR) bfd_put_32 (BFD, VAL, ADDR) | |
6186 | #endif | |
6187 | ||
6188 | /* Fill in the address for a pointer generated in alinker section. */ | |
6189 | ||
6190 | bfd_vma | |
6191 | elf_finish_pointer_linker_section (output_bfd, input_bfd, info, lsect, h, relocation, rel, relative_reloc) | |
6192 | bfd *output_bfd; | |
6193 | bfd *input_bfd; | |
6194 | struct bfd_link_info *info; | |
6195 | elf_linker_section_t *lsect; | |
6196 | struct elf_link_hash_entry *h; | |
6197 | bfd_vma relocation; | |
6198 | const Elf_Internal_Rela *rel; | |
6199 | int relative_reloc; | |
6200 | { | |
6201 | elf_linker_section_pointers_t *linker_section_ptr; | |
6202 | ||
6203 | BFD_ASSERT (lsect != NULL); | |
6204 | ||
6205 | if (h != NULL) /* global symbol */ | |
6206 | { | |
6207 | linker_section_ptr = _bfd_elf_find_pointer_linker_section (h->linker_section_pointer, | |
6208 | rel->r_addend, | |
6209 | lsect->which); | |
6210 | ||
6211 | BFD_ASSERT (linker_section_ptr != NULL); | |
6212 | ||
6213 | if (! elf_hash_table (info)->dynamic_sections_created | |
6214 | || (info->shared | |
6215 | && info->symbolic | |
6216 | && (h->elf_link_hash_flags & ELF_LINK_HASH_DEF_REGULAR))) | |
6217 | { | |
6218 | /* This is actually a static link, or it is a | |
6219 | -Bsymbolic link and the symbol is defined | |
6220 | locally. We must initialize this entry in the | |
6221 | global section. | |
6222 | ||
6223 | When doing a dynamic link, we create a .rela.<xxx> | |
6224 | relocation entry to initialize the value. This | |
6225 | is done in the finish_dynamic_symbol routine. */ | |
6226 | if (!linker_section_ptr->written_address_p) | |
6227 | { | |
6228 | linker_section_ptr->written_address_p = true; | |
6229 | bfd_put_ptr (output_bfd, relocation + linker_section_ptr->addend, | |
6230 | lsect->section->contents + linker_section_ptr->offset); | |
6231 | } | |
6232 | } | |
6233 | } | |
6234 | else /* local symbol */ | |
6235 | { | |
6236 | unsigned long r_symndx = ELF_R_SYM (rel->r_info); | |
6237 | BFD_ASSERT (elf_local_ptr_offsets (input_bfd) != NULL); | |
6238 | BFD_ASSERT (elf_local_ptr_offsets (input_bfd)[r_symndx] != NULL); | |
6239 | linker_section_ptr = _bfd_elf_find_pointer_linker_section (elf_local_ptr_offsets (input_bfd)[r_symndx], | |
6240 | rel->r_addend, | |
6241 | lsect->which); | |
6242 | ||
6243 | BFD_ASSERT (linker_section_ptr != NULL); | |
6244 | ||
6245 | /* Write out pointer if it hasn't been rewritten out before */ | |
6246 | if (!linker_section_ptr->written_address_p) | |
6247 | { | |
6248 | linker_section_ptr->written_address_p = true; | |
6249 | bfd_put_ptr (output_bfd, relocation + linker_section_ptr->addend, | |
6250 | lsect->section->contents + linker_section_ptr->offset); | |
6251 | ||
6252 | if (info->shared) | |
6253 | { | |
6254 | asection *srel = lsect->rel_section; | |
6255 | Elf_Internal_Rela outrel; | |
6256 | ||
6257 | /* We need to generate a relative reloc for the dynamic linker. */ | |
6258 | if (!srel) | |
6259 | lsect->rel_section = srel = bfd_get_section_by_name (elf_hash_table (info)->dynobj, | |
6260 | lsect->rel_name); | |
6261 | ||
6262 | BFD_ASSERT (srel != NULL); | |
6263 | ||
6264 | outrel.r_offset = (lsect->section->output_section->vma | |
6265 | + lsect->section->output_offset | |
6266 | + linker_section_ptr->offset); | |
6267 | outrel.r_info = ELF_R_INFO (0, relative_reloc); | |
6268 | outrel.r_addend = 0; | |
6269 | elf_swap_reloca_out (output_bfd, &outrel, | |
6270 | (((Elf_External_Rela *) | |
6271 | lsect->section->contents) | |
0525d26e ILT |
6272 | + elf_section_data (lsect->section)->rel_count)); |
6273 | ++elf_section_data (lsect->section)->rel_count; | |
252b5132 RH |
6274 | } |
6275 | } | |
6276 | } | |
6277 | ||
6278 | relocation = (lsect->section->output_offset | |
6279 | + linker_section_ptr->offset | |
6280 | - lsect->hole_offset | |
6281 | - lsect->sym_offset); | |
6282 | ||
6283 | #ifdef DEBUG | |
6284 | fprintf (stderr, "Finish pointer in linker section %s, offset = %ld (0x%lx)\n", | |
6285 | lsect->name, (long)relocation, (long)relocation); | |
6286 | #endif | |
6287 | ||
6288 | /* Subtract out the addend, because it will get added back in by the normal | |
6289 | processing. */ | |
6290 | return relocation - linker_section_ptr->addend; | |
6291 | } | |
6292 | \f | |
6293 | /* Garbage collect unused sections. */ | |
6294 | ||
6295 | static boolean elf_gc_mark | |
6296 | PARAMS ((struct bfd_link_info *info, asection *sec, | |
6297 | asection * (*gc_mark_hook) | |
6298 | PARAMS ((bfd *, struct bfd_link_info *, Elf_Internal_Rela *, | |
6299 | struct elf_link_hash_entry *, Elf_Internal_Sym *)))); | |
6300 | ||
6301 | static boolean elf_gc_sweep | |
6302 | PARAMS ((struct bfd_link_info *info, | |
6303 | boolean (*gc_sweep_hook) | |
6304 | PARAMS ((bfd *abfd, struct bfd_link_info *info, asection *o, | |
6305 | const Elf_Internal_Rela *relocs)))); | |
6306 | ||
6307 | static boolean elf_gc_sweep_symbol | |
6308 | PARAMS ((struct elf_link_hash_entry *h, PTR idxptr)); | |
6309 | ||
6310 | static boolean elf_gc_allocate_got_offsets | |
6311 | PARAMS ((struct elf_link_hash_entry *h, PTR offarg)); | |
6312 | ||
6313 | static boolean elf_gc_propagate_vtable_entries_used | |
6314 | PARAMS ((struct elf_link_hash_entry *h, PTR dummy)); | |
6315 | ||
6316 | static boolean elf_gc_smash_unused_vtentry_relocs | |
6317 | PARAMS ((struct elf_link_hash_entry *h, PTR dummy)); | |
6318 | ||
6319 | /* The mark phase of garbage collection. For a given section, mark | |
6320 | it, and all the sections which define symbols to which it refers. */ | |
6321 | ||
6322 | static boolean | |
6323 | elf_gc_mark (info, sec, gc_mark_hook) | |
6324 | struct bfd_link_info *info; | |
6325 | asection *sec; | |
6326 | asection * (*gc_mark_hook) | |
6327 | PARAMS ((bfd *, struct bfd_link_info *, Elf_Internal_Rela *, | |
6328 | struct elf_link_hash_entry *, Elf_Internal_Sym *)); | |
6329 | { | |
6330 | boolean ret = true; | |
6331 | ||
6332 | sec->gc_mark = 1; | |
6333 | ||
6334 | /* Look through the section relocs. */ | |
6335 | ||
6336 | if ((sec->flags & SEC_RELOC) != 0 && sec->reloc_count > 0) | |
6337 | { | |
6338 | Elf_Internal_Rela *relstart, *rel, *relend; | |
6339 | Elf_Internal_Shdr *symtab_hdr; | |
6340 | struct elf_link_hash_entry **sym_hashes; | |
6341 | size_t nlocsyms; | |
6342 | size_t extsymoff; | |
6343 | Elf_External_Sym *locsyms, *freesyms = NULL; | |
6344 | bfd *input_bfd = sec->owner; | |
c7ac6ff8 | 6345 | struct elf_backend_data *bed = get_elf_backend_data (input_bfd); |
252b5132 RH |
6346 | |
6347 | /* GCFIXME: how to arrange so that relocs and symbols are not | |
6348 | reread continually? */ | |
6349 | ||
6350 | symtab_hdr = &elf_tdata (input_bfd)->symtab_hdr; | |
6351 | sym_hashes = elf_sym_hashes (input_bfd); | |
6352 | ||
6353 | /* Read the local symbols. */ | |
6354 | if (elf_bad_symtab (input_bfd)) | |
6355 | { | |
6356 | nlocsyms = symtab_hdr->sh_size / sizeof (Elf_External_Sym); | |
6357 | extsymoff = 0; | |
6358 | } | |
6359 | else | |
6360 | extsymoff = nlocsyms = symtab_hdr->sh_info; | |
6361 | if (symtab_hdr->contents) | |
6362 | locsyms = (Elf_External_Sym *) symtab_hdr->contents; | |
6363 | else if (nlocsyms == 0) | |
6364 | locsyms = NULL; | |
6365 | else | |
6366 | { | |
6367 | locsyms = freesyms = | |
6368 | bfd_malloc (nlocsyms * sizeof (Elf_External_Sym)); | |
6369 | if (freesyms == NULL | |
6370 | || bfd_seek (input_bfd, symtab_hdr->sh_offset, SEEK_SET) != 0 | |
6371 | || (bfd_read (locsyms, sizeof (Elf_External_Sym), | |
6372 | nlocsyms, input_bfd) | |
6373 | != nlocsyms * sizeof (Elf_External_Sym))) | |
6374 | { | |
6375 | ret = false; | |
6376 | goto out1; | |
6377 | } | |
6378 | } | |
6379 | ||
6380 | /* Read the relocations. */ | |
6381 | relstart = (NAME(_bfd_elf,link_read_relocs) | |
6382 | (sec->owner, sec, NULL, (Elf_Internal_Rela *) NULL, | |
6383 | info->keep_memory)); | |
6384 | if (relstart == NULL) | |
6385 | { | |
6386 | ret = false; | |
6387 | goto out1; | |
6388 | } | |
c7ac6ff8 | 6389 | relend = relstart + sec->reloc_count * bed->s->int_rels_per_ext_rel; |
252b5132 RH |
6390 | |
6391 | for (rel = relstart; rel < relend; rel++) | |
6392 | { | |
6393 | unsigned long r_symndx; | |
6394 | asection *rsec; | |
6395 | struct elf_link_hash_entry *h; | |
6396 | Elf_Internal_Sym s; | |
6397 | ||
6398 | r_symndx = ELF_R_SYM (rel->r_info); | |
6399 | if (r_symndx == 0) | |
6400 | continue; | |
6401 | ||
6402 | if (elf_bad_symtab (sec->owner)) | |
6403 | { | |
6404 | elf_swap_symbol_in (input_bfd, &locsyms[r_symndx], &s); | |
6405 | if (ELF_ST_BIND (s.st_info) == STB_LOCAL) | |
6406 | rsec = (*gc_mark_hook)(sec->owner, info, rel, NULL, &s); | |
6407 | else | |
6408 | { | |
6409 | h = sym_hashes[r_symndx - extsymoff]; | |
6410 | rsec = (*gc_mark_hook)(sec->owner, info, rel, h, NULL); | |
6411 | } | |
6412 | } | |
6413 | else if (r_symndx >= nlocsyms) | |
6414 | { | |
6415 | h = sym_hashes[r_symndx - extsymoff]; | |
6416 | rsec = (*gc_mark_hook)(sec->owner, info, rel, h, NULL); | |
6417 | } | |
6418 | else | |
6419 | { | |
6420 | elf_swap_symbol_in (input_bfd, &locsyms[r_symndx], &s); | |
6421 | rsec = (*gc_mark_hook)(sec->owner, info, rel, NULL, &s); | |
6422 | } | |
6423 | ||
6424 | if (rsec && !rsec->gc_mark) | |
6425 | if (!elf_gc_mark (info, rsec, gc_mark_hook)) | |
6426 | { | |
6427 | ret = false; | |
6428 | goto out2; | |
6429 | } | |
6430 | } | |
6431 | ||
6432 | out2: | |
6433 | if (!info->keep_memory) | |
6434 | free (relstart); | |
6435 | out1: | |
6436 | if (freesyms) | |
6437 | free (freesyms); | |
6438 | } | |
6439 | ||
6440 | return ret; | |
6441 | } | |
6442 | ||
6443 | /* The sweep phase of garbage collection. Remove all garbage sections. */ | |
6444 | ||
6445 | static boolean | |
6446 | elf_gc_sweep (info, gc_sweep_hook) | |
6447 | struct bfd_link_info *info; | |
6448 | boolean (*gc_sweep_hook) | |
6449 | PARAMS ((bfd *abfd, struct bfd_link_info *info, asection *o, | |
6450 | const Elf_Internal_Rela *relocs)); | |
6451 | { | |
6452 | bfd *sub; | |
6453 | ||
6454 | for (sub = info->input_bfds; sub != NULL; sub = sub->link_next) | |
6455 | { | |
6456 | asection *o; | |
6457 | ||
f6af82bd AM |
6458 | if (bfd_get_flavour (sub) != bfd_target_elf_flavour) |
6459 | continue; | |
6460 | ||
252b5132 RH |
6461 | for (o = sub->sections; o != NULL; o = o->next) |
6462 | { | |
6463 | /* Keep special sections. Keep .debug sections. */ | |
6464 | if ((o->flags & SEC_LINKER_CREATED) | |
6465 | || (o->flags & SEC_DEBUGGING)) | |
6466 | o->gc_mark = 1; | |
6467 | ||
6468 | if (o->gc_mark) | |
6469 | continue; | |
6470 | ||
6471 | /* Skip sweeping sections already excluded. */ | |
6472 | if (o->flags & SEC_EXCLUDE) | |
6473 | continue; | |
6474 | ||
6475 | /* Since this is early in the link process, it is simple | |
6476 | to remove a section from the output. */ | |
6477 | o->flags |= SEC_EXCLUDE; | |
6478 | ||
6479 | /* But we also have to update some of the relocation | |
6480 | info we collected before. */ | |
6481 | if (gc_sweep_hook | |
6482 | && (o->flags & SEC_RELOC) && o->reloc_count > 0) | |
6483 | { | |
6484 | Elf_Internal_Rela *internal_relocs; | |
6485 | boolean r; | |
6486 | ||
6487 | internal_relocs = (NAME(_bfd_elf,link_read_relocs) | |
6488 | (o->owner, o, NULL, NULL, info->keep_memory)); | |
6489 | if (internal_relocs == NULL) | |
6490 | return false; | |
6491 | ||
6492 | r = (*gc_sweep_hook)(o->owner, info, o, internal_relocs); | |
6493 | ||
6494 | if (!info->keep_memory) | |
6495 | free (internal_relocs); | |
6496 | ||
6497 | if (!r) | |
6498 | return false; | |
6499 | } | |
6500 | } | |
6501 | } | |
6502 | ||
6503 | /* Remove the symbols that were in the swept sections from the dynamic | |
6504 | symbol table. GCFIXME: Anyone know how to get them out of the | |
6505 | static symbol table as well? */ | |
6506 | { | |
6507 | int i = 0; | |
6508 | ||
6509 | elf_link_hash_traverse (elf_hash_table (info), | |
6510 | elf_gc_sweep_symbol, | |
6511 | (PTR) &i); | |
6512 | ||
6513 | elf_hash_table (info)->dynsymcount = i; | |
6514 | } | |
6515 | ||
6516 | return true; | |
6517 | } | |
6518 | ||
6519 | /* Sweep symbols in swept sections. Called via elf_link_hash_traverse. */ | |
6520 | ||
6521 | static boolean | |
6522 | elf_gc_sweep_symbol (h, idxptr) | |
6523 | struct elf_link_hash_entry *h; | |
6524 | PTR idxptr; | |
6525 | { | |
6526 | int *idx = (int *) idxptr; | |
6527 | ||
6528 | if (h->dynindx != -1 | |
6529 | && ((h->root.type != bfd_link_hash_defined | |
6530 | && h->root.type != bfd_link_hash_defweak) | |
6531 | || h->root.u.def.section->gc_mark)) | |
6532 | h->dynindx = (*idx)++; | |
6533 | ||
6534 | return true; | |
6535 | } | |
6536 | ||
6537 | /* Propogate collected vtable information. This is called through | |
6538 | elf_link_hash_traverse. */ | |
6539 | ||
6540 | static boolean | |
6541 | elf_gc_propagate_vtable_entries_used (h, okp) | |
6542 | struct elf_link_hash_entry *h; | |
6543 | PTR okp; | |
6544 | { | |
6545 | /* Those that are not vtables. */ | |
6546 | if (h->vtable_parent == NULL) | |
6547 | return true; | |
6548 | ||
6549 | /* Those vtables that do not have parents, we cannot merge. */ | |
6550 | if (h->vtable_parent == (struct elf_link_hash_entry *) -1) | |
6551 | return true; | |
6552 | ||
6553 | /* If we've already been done, exit. */ | |
6554 | if (h->vtable_entries_used && h->vtable_entries_used[-1]) | |
6555 | return true; | |
6556 | ||
6557 | /* Make sure the parent's table is up to date. */ | |
6558 | elf_gc_propagate_vtable_entries_used (h->vtable_parent, okp); | |
6559 | ||
6560 | if (h->vtable_entries_used == NULL) | |
6561 | { | |
6562 | /* None of this table's entries were referenced. Re-use the | |
6563 | parent's table. */ | |
6564 | h->vtable_entries_used = h->vtable_parent->vtable_entries_used; | |
6565 | h->vtable_entries_size = h->vtable_parent->vtable_entries_size; | |
6566 | } | |
6567 | else | |
6568 | { | |
6569 | size_t n; | |
6570 | boolean *cu, *pu; | |
6571 | ||
6572 | /* Or the parent's entries into ours. */ | |
6573 | cu = h->vtable_entries_used; | |
6574 | cu[-1] = true; | |
6575 | pu = h->vtable_parent->vtable_entries_used; | |
6576 | if (pu != NULL) | |
6577 | { | |
6578 | n = h->vtable_parent->vtable_entries_size / FILE_ALIGN; | |
6579 | while (--n != 0) | |
6580 | { | |
6581 | if (*pu) *cu = true; | |
6582 | pu++, cu++; | |
6583 | } | |
6584 | } | |
6585 | } | |
6586 | ||
6587 | return true; | |
6588 | } | |
6589 | ||
6590 | static boolean | |
6591 | elf_gc_smash_unused_vtentry_relocs (h, okp) | |
6592 | struct elf_link_hash_entry *h; | |
6593 | PTR okp; | |
6594 | { | |
6595 | asection *sec; | |
6596 | bfd_vma hstart, hend; | |
6597 | Elf_Internal_Rela *relstart, *relend, *rel; | |
c7ac6ff8 | 6598 | struct elf_backend_data *bed; |
252b5132 RH |
6599 | |
6600 | /* Take care of both those symbols that do not describe vtables as | |
6601 | well as those that are not loaded. */ | |
6602 | if (h->vtable_parent == NULL) | |
6603 | return true; | |
6604 | ||
6605 | BFD_ASSERT (h->root.type == bfd_link_hash_defined | |
6606 | || h->root.type == bfd_link_hash_defweak); | |
6607 | ||
6608 | sec = h->root.u.def.section; | |
6609 | hstart = h->root.u.def.value; | |
6610 | hend = hstart + h->size; | |
6611 | ||
6612 | relstart = (NAME(_bfd_elf,link_read_relocs) | |
6613 | (sec->owner, sec, NULL, (Elf_Internal_Rela *) NULL, true)); | |
6614 | if (!relstart) | |
6615 | return *(boolean *)okp = false; | |
c7ac6ff8 MM |
6616 | bed = get_elf_backend_data (sec->owner); |
6617 | relend = relstart + sec->reloc_count * bed->s->int_rels_per_ext_rel; | |
252b5132 RH |
6618 | |
6619 | for (rel = relstart; rel < relend; ++rel) | |
6620 | if (rel->r_offset >= hstart && rel->r_offset < hend) | |
6621 | { | |
6622 | /* If the entry is in use, do nothing. */ | |
6623 | if (h->vtable_entries_used | |
6624 | && (rel->r_offset - hstart) < h->vtable_entries_size) | |
6625 | { | |
6626 | bfd_vma entry = (rel->r_offset - hstart) / FILE_ALIGN; | |
6627 | if (h->vtable_entries_used[entry]) | |
6628 | continue; | |
6629 | } | |
6630 | /* Otherwise, kill it. */ | |
6631 | rel->r_offset = rel->r_info = rel->r_addend = 0; | |
6632 | } | |
6633 | ||
6634 | return true; | |
6635 | } | |
6636 | ||
6637 | /* Do mark and sweep of unused sections. */ | |
6638 | ||
6639 | boolean | |
6640 | elf_gc_sections (abfd, info) | |
6641 | bfd *abfd; | |
6642 | struct bfd_link_info *info; | |
6643 | { | |
6644 | boolean ok = true; | |
6645 | bfd *sub; | |
6646 | asection * (*gc_mark_hook) | |
6647 | PARAMS ((bfd *abfd, struct bfd_link_info *, Elf_Internal_Rela *, | |
6648 | struct elf_link_hash_entry *h, Elf_Internal_Sym *)); | |
6649 | ||
6650 | if (!get_elf_backend_data (abfd)->can_gc_sections | |
6d3e950b | 6651 | || info->relocateable || info->emitrelocations |
252b5132 RH |
6652 | || elf_hash_table (info)->dynamic_sections_created) |
6653 | return true; | |
6654 | ||
6655 | /* Apply transitive closure to the vtable entry usage info. */ | |
6656 | elf_link_hash_traverse (elf_hash_table (info), | |
6657 | elf_gc_propagate_vtable_entries_used, | |
6658 | (PTR) &ok); | |
6659 | if (!ok) | |
6660 | return false; | |
6661 | ||
6662 | /* Kill the vtable relocations that were not used. */ | |
6663 | elf_link_hash_traverse (elf_hash_table (info), | |
6664 | elf_gc_smash_unused_vtentry_relocs, | |
6665 | (PTR) &ok); | |
6666 | if (!ok) | |
6667 | return false; | |
6668 | ||
6669 | /* Grovel through relocs to find out who stays ... */ | |
6670 | ||
6671 | gc_mark_hook = get_elf_backend_data (abfd)->gc_mark_hook; | |
6672 | for (sub = info->input_bfds; sub != NULL; sub = sub->link_next) | |
6673 | { | |
6674 | asection *o; | |
f6af82bd AM |
6675 | |
6676 | if (bfd_get_flavour (sub) != bfd_target_elf_flavour) | |
6677 | continue; | |
6678 | ||
252b5132 RH |
6679 | for (o = sub->sections; o != NULL; o = o->next) |
6680 | { | |
6681 | if (o->flags & SEC_KEEP) | |
6682 | if (!elf_gc_mark (info, o, gc_mark_hook)) | |
6683 | return false; | |
6684 | } | |
6685 | } | |
6686 | ||
6687 | /* ... and mark SEC_EXCLUDE for those that go. */ | |
6688 | if (!elf_gc_sweep(info, get_elf_backend_data (abfd)->gc_sweep_hook)) | |
6689 | return false; | |
6690 | ||
6691 | return true; | |
6692 | } | |
6693 | \f | |
6694 | /* Called from check_relocs to record the existance of a VTINHERIT reloc. */ | |
6695 | ||
6696 | boolean | |
6697 | elf_gc_record_vtinherit (abfd, sec, h, offset) | |
6698 | bfd *abfd; | |
6699 | asection *sec; | |
6700 | struct elf_link_hash_entry *h; | |
6701 | bfd_vma offset; | |
6702 | { | |
6703 | struct elf_link_hash_entry **sym_hashes, **sym_hashes_end; | |
6704 | struct elf_link_hash_entry **search, *child; | |
6705 | bfd_size_type extsymcount; | |
6706 | ||
6707 | /* The sh_info field of the symtab header tells us where the | |
6708 | external symbols start. We don't care about the local symbols at | |
6709 | this point. */ | |
6710 | extsymcount = elf_tdata (abfd)->symtab_hdr.sh_size/sizeof (Elf_External_Sym); | |
6711 | if (!elf_bad_symtab (abfd)) | |
6712 | extsymcount -= elf_tdata (abfd)->symtab_hdr.sh_info; | |
6713 | ||
6714 | sym_hashes = elf_sym_hashes (abfd); | |
6715 | sym_hashes_end = sym_hashes + extsymcount; | |
6716 | ||
6717 | /* Hunt down the child symbol, which is in this section at the same | |
6718 | offset as the relocation. */ | |
6719 | for (search = sym_hashes; search != sym_hashes_end; ++search) | |
6720 | { | |
6721 | if ((child = *search) != NULL | |
6722 | && (child->root.type == bfd_link_hash_defined | |
6723 | || child->root.type == bfd_link_hash_defweak) | |
6724 | && child->root.u.def.section == sec | |
6725 | && child->root.u.def.value == offset) | |
6726 | goto win; | |
6727 | } | |
6728 | ||
6729 | (*_bfd_error_handler) ("%s: %s+%lu: No symbol found for INHERIT", | |
6730 | bfd_get_filename (abfd), sec->name, | |
6731 | (unsigned long)offset); | |
6732 | bfd_set_error (bfd_error_invalid_operation); | |
6733 | return false; | |
6734 | ||
6735 | win: | |
6736 | if (!h) | |
6737 | { | |
6738 | /* This *should* only be the absolute section. It could potentially | |
6739 | be that someone has defined a non-global vtable though, which | |
6740 | would be bad. It isn't worth paging in the local symbols to be | |
6741 | sure though; that case should simply be handled by the assembler. */ | |
6742 | ||
6743 | child->vtable_parent = (struct elf_link_hash_entry *) -1; | |
6744 | } | |
6745 | else | |
6746 | child->vtable_parent = h; | |
6747 | ||
6748 | return true; | |
6749 | } | |
6750 | ||
6751 | /* Called from check_relocs to record the existance of a VTENTRY reloc. */ | |
6752 | ||
6753 | boolean | |
6754 | elf_gc_record_vtentry (abfd, sec, h, addend) | |
7442e600 ILT |
6755 | bfd *abfd ATTRIBUTE_UNUSED; |
6756 | asection *sec ATTRIBUTE_UNUSED; | |
252b5132 RH |
6757 | struct elf_link_hash_entry *h; |
6758 | bfd_vma addend; | |
6759 | { | |
6760 | if (addend >= h->vtable_entries_size) | |
6761 | { | |
6762 | size_t size, bytes; | |
6763 | boolean *ptr = h->vtable_entries_used; | |
6764 | ||
6765 | /* While the symbol is undefined, we have to be prepared to handle | |
6766 | a zero size. */ | |
6767 | if (h->root.type == bfd_link_hash_undefined) | |
6768 | size = addend; | |
6769 | else | |
6770 | { | |
6771 | size = h->size; | |
6772 | if (size < addend) | |
6773 | { | |
6774 | /* Oops! We've got a reference past the defined end of | |
6775 | the table. This is probably a bug -- shall we warn? */ | |
6776 | size = addend; | |
6777 | } | |
6778 | } | |
6779 | ||
6780 | /* Allocate one extra entry for use as a "done" flag for the | |
6781 | consolidation pass. */ | |
fed79cc6 | 6782 | bytes = (size / FILE_ALIGN + 1) * sizeof (boolean); |
252b5132 RH |
6783 | |
6784 | if (ptr) | |
6785 | { | |
fed79cc6 NC |
6786 | ptr = bfd_realloc (ptr - 1, bytes); |
6787 | ||
6788 | if (ptr != NULL) | |
6789 | { | |
6790 | size_t oldbytes; | |
252b5132 | 6791 | |
fed79cc6 NC |
6792 | oldbytes = (h->vtable_entries_size/FILE_ALIGN + 1) * sizeof (boolean); |
6793 | memset (((char *)ptr) + oldbytes, 0, bytes - oldbytes); | |
6794 | } | |
252b5132 RH |
6795 | } |
6796 | else | |
fed79cc6 | 6797 | ptr = bfd_zmalloc (bytes); |
252b5132 | 6798 | |
fed79cc6 NC |
6799 | if (ptr == NULL) |
6800 | return false; | |
6801 | ||
252b5132 | 6802 | /* And arrange for that done flag to be at index -1. */ |
fed79cc6 | 6803 | h->vtable_entries_used = ptr + 1; |
252b5132 RH |
6804 | h->vtable_entries_size = size; |
6805 | } | |
fed79cc6 | 6806 | |
252b5132 RH |
6807 | h->vtable_entries_used[addend / FILE_ALIGN] = true; |
6808 | ||
6809 | return true; | |
6810 | } | |
6811 | ||
6812 | /* And an accompanying bit to work out final got entry offsets once | |
6813 | we're done. Should be called from final_link. */ | |
6814 | ||
6815 | boolean | |
6816 | elf_gc_common_finalize_got_offsets (abfd, info) | |
6817 | bfd *abfd; | |
6818 | struct bfd_link_info *info; | |
6819 | { | |
6820 | bfd *i; | |
6821 | struct elf_backend_data *bed = get_elf_backend_data (abfd); | |
6822 | bfd_vma gotoff; | |
6823 | ||
6824 | /* The GOT offset is relative to the .got section, but the GOT header is | |
6825 | put into the .got.plt section, if the backend uses it. */ | |
6826 | if (bed->want_got_plt) | |
6827 | gotoff = 0; | |
6828 | else | |
6829 | gotoff = bed->got_header_size; | |
6830 | ||
6831 | /* Do the local .got entries first. */ | |
6832 | for (i = info->input_bfds; i; i = i->link_next) | |
6833 | { | |
f6af82bd | 6834 | bfd_signed_vma *local_got; |
252b5132 RH |
6835 | bfd_size_type j, locsymcount; |
6836 | Elf_Internal_Shdr *symtab_hdr; | |
6837 | ||
f6af82bd AM |
6838 | if (bfd_get_flavour (i) != bfd_target_elf_flavour) |
6839 | continue; | |
6840 | ||
6841 | local_got = elf_local_got_refcounts (i); | |
252b5132 RH |
6842 | if (!local_got) |
6843 | continue; | |
6844 | ||
6845 | symtab_hdr = &elf_tdata (i)->symtab_hdr; | |
6846 | if (elf_bad_symtab (i)) | |
6847 | locsymcount = symtab_hdr->sh_size / sizeof (Elf_External_Sym); | |
6848 | else | |
6849 | locsymcount = symtab_hdr->sh_info; | |
6850 | ||
6851 | for (j = 0; j < locsymcount; ++j) | |
6852 | { | |
6853 | if (local_got[j] > 0) | |
6854 | { | |
6855 | local_got[j] = gotoff; | |
6856 | gotoff += ARCH_SIZE / 8; | |
6857 | } | |
6858 | else | |
6859 | local_got[j] = (bfd_vma) -1; | |
6860 | } | |
6861 | } | |
6862 | ||
dd5724d5 AM |
6863 | /* Then the global .got entries. .plt refcounts are handled by |
6864 | adjust_dynamic_symbol */ | |
252b5132 RH |
6865 | elf_link_hash_traverse (elf_hash_table (info), |
6866 | elf_gc_allocate_got_offsets, | |
6867 | (PTR) &gotoff); | |
6868 | return true; | |
6869 | } | |
6870 | ||
6871 | /* We need a special top-level link routine to convert got reference counts | |
6872 | to real got offsets. */ | |
6873 | ||
6874 | static boolean | |
6875 | elf_gc_allocate_got_offsets (h, offarg) | |
6876 | struct elf_link_hash_entry *h; | |
6877 | PTR offarg; | |
6878 | { | |
6879 | bfd_vma *off = (bfd_vma *) offarg; | |
6880 | ||
6881 | if (h->got.refcount > 0) | |
6882 | { | |
6883 | h->got.offset = off[0]; | |
6884 | off[0] += ARCH_SIZE / 8; | |
6885 | } | |
6886 | else | |
6887 | h->got.offset = (bfd_vma) -1; | |
6888 | ||
6889 | return true; | |
6890 | } | |
6891 | ||
6892 | /* Many folk need no more in the way of final link than this, once | |
6893 | got entry reference counting is enabled. */ | |
6894 | ||
6895 | boolean | |
6896 | elf_gc_common_final_link (abfd, info) | |
6897 | bfd *abfd; | |
6898 | struct bfd_link_info *info; | |
6899 | { | |
6900 | if (!elf_gc_common_finalize_got_offsets (abfd, info)) | |
6901 | return false; | |
6902 | ||
6903 | /* Invoke the regular ELF backend linker to do all the work. */ | |
6904 | return elf_bfd_final_link (abfd, info); | |
6905 | } | |
6906 | ||
6907 | /* This function will be called though elf_link_hash_traverse to store | |
6908 | all hash value of the exported symbols in an array. */ | |
6909 | ||
6910 | static boolean | |
6911 | elf_collect_hash_codes (h, data) | |
6912 | struct elf_link_hash_entry *h; | |
6913 | PTR data; | |
6914 | { | |
6915 | unsigned long **valuep = (unsigned long **) data; | |
6916 | const char *name; | |
6917 | char *p; | |
6918 | unsigned long ha; | |
6919 | char *alc = NULL; | |
6920 | ||
6921 | /* Ignore indirect symbols. These are added by the versioning code. */ | |
6922 | if (h->dynindx == -1) | |
6923 | return true; | |
6924 | ||
6925 | name = h->root.root.string; | |
6926 | p = strchr (name, ELF_VER_CHR); | |
6927 | if (p != NULL) | |
6928 | { | |
6929 | alc = bfd_malloc (p - name + 1); | |
6930 | memcpy (alc, name, p - name); | |
6931 | alc[p - name] = '\0'; | |
6932 | name = alc; | |
6933 | } | |
6934 | ||
6935 | /* Compute the hash value. */ | |
6936 | ha = bfd_elf_hash (name); | |
6937 | ||
6938 | /* Store the found hash value in the array given as the argument. */ | |
6939 | *(*valuep)++ = ha; | |
6940 | ||
6941 | /* And store it in the struct so that we can put it in the hash table | |
6942 | later. */ | |
6943 | h->elf_hash_value = ha; | |
6944 | ||
6945 | if (alc != NULL) | |
6946 | free (alc); | |
6947 | ||
6948 | return true; | |
6949 | } |