Commit | Line | Data |
---|---|---|
252b5132 | 1 | /* Linker command language support. |
a2b64bed | 2 | Copyright 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, |
264b6205 | 3 | 2001, 2002, 2003, 2004, 2005, 2006, 2007 |
252b5132 RH |
4 | Free Software Foundation, Inc. |
5 | ||
f96b4a7b | 6 | This file is part of the GNU Binutils. |
252b5132 | 7 | |
f96b4a7b | 8 | This program is free software; you can redistribute it and/or modify |
53b2a62f | 9 | it under the terms of the GNU General Public License as published by |
f96b4a7b NC |
10 | the Free Software Foundation; either version 3 of the License, or |
11 | (at your option) any later version. | |
252b5132 | 12 | |
f96b4a7b | 13 | This program is distributed in the hope that it will be useful, |
53b2a62f NC |
14 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
16 | GNU General Public License for more details. | |
252b5132 | 17 | |
53b2a62f | 18 | You should have received a copy of the GNU General Public License |
f96b4a7b NC |
19 | along with this program; if not, write to the Free Software |
20 | Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, | |
21 | MA 02110-1301, USA. */ | |
252b5132 | 22 | |
252b5132 | 23 | #include "sysdep.h" |
3db64b00 | 24 | #include "bfd.h" |
252b5132 | 25 | #include "libiberty.h" |
3882b010 | 26 | #include "safe-ctype.h" |
252b5132 RH |
27 | #include "obstack.h" |
28 | #include "bfdlink.h" | |
29 | ||
30 | #include "ld.h" | |
31 | #include "ldmain.h" | |
252b5132 RH |
32 | #include "ldexp.h" |
33 | #include "ldlang.h" | |
df2a7313 | 34 | #include <ldgram.h> |
252b5132 RH |
35 | #include "ldlex.h" |
36 | #include "ldmisc.h" | |
37 | #include "ldctor.h" | |
38 | #include "ldfile.h" | |
b71e2778 | 39 | #include "ldemul.h" |
252b5132 RH |
40 | #include "fnmatch.h" |
41 | #include "demangle.h" | |
108ba305 | 42 | #include "hashtab.h" |
252b5132 | 43 | |
7abb6dea | 44 | #ifndef offsetof |
cf888e70 | 45 | #define offsetof(TYPE, MEMBER) ((size_t) & (((TYPE*) 0)->MEMBER)) |
7abb6dea AM |
46 | #endif |
47 | ||
cf888e70 | 48 | /* Locals variables. */ |
252b5132 | 49 | static struct obstack stat_obstack; |
35835446 | 50 | static struct obstack map_obstack; |
252b5132 RH |
51 | |
52 | #define obstack_chunk_alloc xmalloc | |
53 | #define obstack_chunk_free free | |
5f992e62 | 54 | static const char *startup_file; |
b34976b6 | 55 | static bfd_boolean placed_commons = FALSE; |
8423293d | 56 | static bfd_boolean stripped_excluded_sections = FALSE; |
252b5132 | 57 | static lang_output_section_statement_type *default_common_section; |
b34976b6 | 58 | static bfd_boolean map_option_f; |
252b5132 RH |
59 | static bfd_vma print_dot; |
60 | static lang_input_statement_type *first_file; | |
5f992e62 AM |
61 | static const char *current_target; |
62 | static const char *output_target; | |
252b5132 | 63 | static lang_statement_list_type statement_list; |
420e579c | 64 | static struct bfd_hash_table lang_definedness_table; |
252b5132 | 65 | |
cf888e70 | 66 | /* Forward declarations. */ |
1579bae1 | 67 | static void exp_init_os (etree_type *); |
35835446 | 68 | static void init_map_userdata (bfd *, asection *, void *); |
1579bae1 | 69 | static lang_input_statement_type *lookup_name (const char *); |
420e579c HPN |
70 | static struct bfd_hash_entry *lang_definedness_newfunc |
71 | (struct bfd_hash_entry *, struct bfd_hash_table *, const char *); | |
1579bae1 | 72 | static void insert_undefined (const char *); |
35835446 | 73 | static bfd_boolean sort_def_symbol (struct bfd_link_hash_entry *, void *); |
1579bae1 AM |
74 | static void print_statement (lang_statement_union_type *, |
75 | lang_output_section_statement_type *); | |
76 | static void print_statement_list (lang_statement_union_type *, | |
77 | lang_output_section_statement_type *); | |
78 | static void print_statements (void); | |
4d4920ec | 79 | static void print_input_section (asection *); |
1579bae1 AM |
80 | static bfd_boolean lang_one_common (struct bfd_link_hash_entry *, void *); |
81 | static void lang_record_phdrs (void); | |
82 | static void lang_do_version_exports_section (void); | |
55255dae L |
83 | static void lang_finalize_version_expr_head |
84 | (struct bfd_elf_version_expr_head *); | |
1579bae1 | 85 | |
cf888e70 | 86 | /* Exported variables. */ |
252b5132 | 87 | lang_output_section_statement_type *abs_output_section; |
aea4bd9d | 88 | lang_statement_list_type lang_output_section_statement; |
252b5132 | 89 | lang_statement_list_type *stat_ptr = &statement_list; |
87f2a346 | 90 | lang_statement_list_type file_chain = { NULL, NULL }; |
dc27aea4 | 91 | lang_statement_list_type input_file_chain; |
e3e942e9 | 92 | struct bfd_sym_chain entry_symbol = { NULL, NULL }; |
a359509e | 93 | static const char *entry_symbol_default = "start"; |
1e281515 | 94 | const char *entry_section = ".text"; |
b34976b6 AM |
95 | bfd_boolean entry_from_cmdline; |
96 | bfd_boolean lang_has_input_file = FALSE; | |
97 | bfd_boolean had_output_filename = FALSE; | |
98 | bfd_boolean lang_float_flag = FALSE; | |
99 | bfd_boolean delete_output_file_on_failure = FALSE; | |
f5ff60a6 | 100 | struct lang_phdr *lang_phdr_list; |
252b5132 | 101 | struct lang_nocrossrefs *nocrossref_list; |
279e75dc | 102 | static struct unique_sections *unique_section_list; |
e3f2db7f | 103 | static bfd_boolean ldlang_sysrooted_script = FALSE; |
e9ee469a AM |
104 | |
105 | /* Functions that traverse the linker script and might evaluate | |
106 | DEFINED() need to increment this. */ | |
420e579c | 107 | int lang_statement_iteration = 0; |
252b5132 RH |
108 | |
109 | etree_type *base; /* Relocation base - or null */ | |
110 | ||
61f5d054 L |
111 | /* Return TRUE if the PATTERN argument is a wildcard pattern. |
112 | Although backslashes are treated specially if a pattern contains | |
113 | wildcards, we do not consider the mere presence of a backslash to | |
114 | be enough to cause the pattern to be treated as a wildcard. | |
115 | That lets us handle DOS filenames more naturally. */ | |
116 | #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL) | |
117 | ||
d1778b88 | 118 | #define new_stat(x, y) \ |
1579bae1 | 119 | (x##_type *) new_statement (x##_enum, sizeof (x##_type), y) |
252b5132 | 120 | |
d1778b88 AM |
121 | #define outside_section_address(q) \ |
122 | ((q)->output_offset + (q)->output_section->vma) | |
252b5132 | 123 | |
d1778b88 AM |
124 | #define outside_symbol_address(q) \ |
125 | ((q)->value + outside_section_address (q->section)) | |
252b5132 RH |
126 | |
127 | #define SECTION_NAME_MAP_LENGTH (16) | |
128 | ||
1579bae1 AM |
129 | void * |
130 | stat_alloc (size_t size) | |
252b5132 RH |
131 | { |
132 | return obstack_alloc (&stat_obstack, size); | |
133 | } | |
134 | ||
b34976b6 | 135 | bfd_boolean |
d0d6a25b | 136 | unique_section_p (const asection *sec) |
577a0623 AM |
137 | { |
138 | struct unique_sections *unam; | |
d0d6a25b | 139 | const char *secnam; |
577a0623 | 140 | |
d0d6a25b AM |
141 | if (link_info.relocatable |
142 | && sec->owner != NULL | |
143 | && bfd_is_group_section (sec->owner, sec)) | |
144 | return TRUE; | |
145 | ||
146 | secnam = sec->name; | |
577a0623 AM |
147 | for (unam = unique_section_list; unam; unam = unam->next) |
148 | if (wildcardp (unam->name) | |
149 | ? fnmatch (unam->name, secnam, 0) == 0 | |
150 | : strcmp (unam->name, secnam) == 0) | |
151 | { | |
b34976b6 | 152 | return TRUE; |
577a0623 AM |
153 | } |
154 | ||
b34976b6 | 155 | return FALSE; |
577a0623 AM |
156 | } |
157 | ||
08da4cac | 158 | /* Generic traversal routines for finding matching sections. */ |
4dec4d4e | 159 | |
72223188 JJ |
160 | /* Try processing a section against a wildcard. This just calls |
161 | the callback unless the filename exclusion list is present | |
162 | and excludes the file. It's hardly ever present so this | |
163 | function is very fast. */ | |
164 | ||
4dec4d4e | 165 | static void |
72223188 JJ |
166 | walk_wild_consider_section (lang_wild_statement_type *ptr, |
167 | lang_input_statement_type *file, | |
168 | asection *s, | |
169 | struct wildcard_list *sec, | |
170 | callback_t callback, | |
171 | void *data) | |
4dec4d4e | 172 | { |
72223188 JJ |
173 | bfd_boolean skip = FALSE; |
174 | struct name_list *list_tmp; | |
175 | ||
176 | /* Don't process sections from files which were | |
177 | excluded. */ | |
178 | for (list_tmp = sec->spec.exclude_name_list; | |
179 | list_tmp; | |
180 | list_tmp = list_tmp->next) | |
181 | { | |
182 | bfd_boolean is_wildcard = wildcardp (list_tmp->name); | |
183 | if (is_wildcard) | |
184 | skip = fnmatch (list_tmp->name, file->filename, 0) == 0; | |
185 | else | |
186 | skip = strcmp (list_tmp->name, file->filename) == 0; | |
b6bf44ba | 187 | |
72223188 JJ |
188 | /* If this file is part of an archive, and the archive is |
189 | excluded, exclude this file. */ | |
190 | if (! skip && file->the_bfd != NULL | |
191 | && file->the_bfd->my_archive != NULL | |
192 | && file->the_bfd->my_archive->filename != NULL) | |
193 | { | |
194 | if (is_wildcard) | |
195 | skip = fnmatch (list_tmp->name, | |
196 | file->the_bfd->my_archive->filename, | |
197 | 0) == 0; | |
198 | else | |
199 | skip = strcmp (list_tmp->name, | |
200 | file->the_bfd->my_archive->filename) == 0; | |
201 | } | |
202 | ||
203 | if (skip) | |
204 | break; | |
205 | } | |
206 | ||
207 | if (!skip) | |
208 | (*callback) (ptr, sec, s, file, data); | |
209 | } | |
210 | ||
211 | /* Lowest common denominator routine that can handle everything correctly, | |
212 | but slowly. */ | |
213 | ||
214 | static void | |
215 | walk_wild_section_general (lang_wild_statement_type *ptr, | |
216 | lang_input_statement_type *file, | |
217 | callback_t callback, | |
218 | void *data) | |
219 | { | |
220 | asection *s; | |
221 | struct wildcard_list *sec; | |
b6bf44ba AM |
222 | |
223 | for (s = file->the_bfd->sections; s != NULL; s = s->next) | |
4dec4d4e | 224 | { |
b6bf44ba | 225 | sec = ptr->section_list; |
2181f54f AM |
226 | if (sec == NULL) |
227 | (*callback) (ptr, sec, s, file, data); | |
228 | ||
229 | while (sec != NULL) | |
08da4cac | 230 | { |
b34976b6 | 231 | bfd_boolean skip = FALSE; |
2181f54f | 232 | |
72223188 | 233 | if (sec->spec.name != NULL) |
b6bf44ba | 234 | { |
2181f54f AM |
235 | const char *sname = bfd_get_section_name (file->the_bfd, s); |
236 | ||
237 | if (wildcardp (sec->spec.name)) | |
238 | skip = fnmatch (sec->spec.name, sname, 0) != 0; | |
239 | else | |
240 | skip = strcmp (sec->spec.name, sname) != 0; | |
b6bf44ba | 241 | } |
4dec4d4e | 242 | |
b6bf44ba | 243 | if (!skip) |
72223188 | 244 | walk_wild_consider_section (ptr, file, s, sec, callback, data); |
4dec4d4e | 245 | |
2181f54f | 246 | sec = sec->next; |
4dec4d4e RH |
247 | } |
248 | } | |
249 | } | |
250 | ||
72223188 JJ |
251 | /* Routines to find a single section given its name. If there's more |
252 | than one section with that name, we report that. */ | |
253 | ||
254 | typedef struct | |
255 | { | |
256 | asection *found_section; | |
257 | bfd_boolean multiple_sections_found; | |
258 | } section_iterator_callback_data; | |
259 | ||
260 | static bfd_boolean | |
261 | section_iterator_callback (bfd *bfd ATTRIBUTE_UNUSED, asection *s, void *data) | |
262 | { | |
263 | section_iterator_callback_data *d = data; | |
264 | ||
265 | if (d->found_section != NULL) | |
266 | { | |
267 | d->multiple_sections_found = TRUE; | |
268 | return TRUE; | |
269 | } | |
270 | ||
271 | d->found_section = s; | |
272 | return FALSE; | |
273 | } | |
274 | ||
275 | static asection * | |
276 | find_section (lang_input_statement_type *file, | |
277 | struct wildcard_list *sec, | |
278 | bfd_boolean *multiple_sections_found) | |
279 | { | |
280 | section_iterator_callback_data cb_data = { NULL, FALSE }; | |
281 | ||
329c1c86 | 282 | bfd_get_section_by_name_if (file->the_bfd, sec->spec.name, |
72223188 JJ |
283 | section_iterator_callback, &cb_data); |
284 | *multiple_sections_found = cb_data.multiple_sections_found; | |
285 | return cb_data.found_section; | |
286 | } | |
287 | ||
288 | /* Code for handling simple wildcards without going through fnmatch, | |
289 | which can be expensive because of charset translations etc. */ | |
290 | ||
291 | /* A simple wild is a literal string followed by a single '*', | |
292 | where the literal part is at least 4 characters long. */ | |
293 | ||
294 | static bfd_boolean | |
295 | is_simple_wild (const char *name) | |
296 | { | |
297 | size_t len = strcspn (name, "*?["); | |
298 | return len >= 4 && name[len] == '*' && name[len + 1] == '\0'; | |
299 | } | |
300 | ||
301 | static bfd_boolean | |
302 | match_simple_wild (const char *pattern, const char *name) | |
303 | { | |
304 | /* The first four characters of the pattern are guaranteed valid | |
305 | non-wildcard characters. So we can go faster. */ | |
306 | if (pattern[0] != name[0] || pattern[1] != name[1] | |
307 | || pattern[2] != name[2] || pattern[3] != name[3]) | |
308 | return FALSE; | |
309 | ||
310 | pattern += 4; | |
311 | name += 4; | |
312 | while (*pattern != '*') | |
313 | if (*name++ != *pattern++) | |
314 | return FALSE; | |
315 | ||
316 | return TRUE; | |
317 | } | |
318 | ||
50c77e5d NC |
319 | /* Compare sections ASEC and BSEC according to SORT. */ |
320 | ||
321 | static int | |
322 | compare_section (sort_type sort, asection *asec, asection *bsec) | |
323 | { | |
324 | int ret; | |
325 | ||
326 | switch (sort) | |
327 | { | |
328 | default: | |
329 | abort (); | |
330 | ||
331 | case by_alignment_name: | |
332 | ret = (bfd_section_alignment (bsec->owner, bsec) | |
333 | - bfd_section_alignment (asec->owner, asec)); | |
334 | if (ret) | |
335 | break; | |
336 | /* Fall through. */ | |
337 | ||
338 | case by_name: | |
339 | ret = strcmp (bfd_get_section_name (asec->owner, asec), | |
340 | bfd_get_section_name (bsec->owner, bsec)); | |
341 | break; | |
342 | ||
343 | case by_name_alignment: | |
344 | ret = strcmp (bfd_get_section_name (asec->owner, asec), | |
345 | bfd_get_section_name (bsec->owner, bsec)); | |
346 | if (ret) | |
347 | break; | |
348 | /* Fall through. */ | |
349 | ||
350 | case by_alignment: | |
351 | ret = (bfd_section_alignment (bsec->owner, bsec) | |
352 | - bfd_section_alignment (asec->owner, asec)); | |
353 | break; | |
354 | } | |
355 | ||
356 | return ret; | |
357 | } | |
358 | ||
329c1c86 | 359 | /* Build a Binary Search Tree to sort sections, unlike insertion sort |
50c77e5d NC |
360 | used in wild_sort(). BST is considerably faster if the number of |
361 | of sections are large. */ | |
362 | ||
363 | static lang_section_bst_type ** | |
364 | wild_sort_fast (lang_wild_statement_type *wild, | |
329c1c86 AM |
365 | struct wildcard_list *sec, |
366 | lang_input_statement_type *file ATTRIBUTE_UNUSED, | |
367 | asection *section) | |
50c77e5d | 368 | { |
329c1c86 | 369 | lang_section_bst_type **tree; |
50c77e5d | 370 | |
e6f2cbf5 | 371 | tree = &wild->tree; |
50c77e5d | 372 | if (!wild->filenames_sorted |
329c1c86 | 373 | && (sec == NULL || sec->spec.sorted == none)) |
50c77e5d NC |
374 | { |
375 | /* Append at the right end of tree. */ | |
376 | while (*tree) | |
329c1c86 | 377 | tree = &((*tree)->right); |
50c77e5d NC |
378 | return tree; |
379 | } | |
380 | ||
329c1c86 | 381 | while (*tree) |
50c77e5d NC |
382 | { |
383 | /* Find the correct node to append this section. */ | |
329c1c86 AM |
384 | if (compare_section (sec->spec.sorted, section, (*tree)->section) < 0) |
385 | tree = &((*tree)->left); | |
386 | else | |
387 | tree = &((*tree)->right); | |
50c77e5d NC |
388 | } |
389 | ||
390 | return tree; | |
391 | } | |
392 | ||
393 | /* Use wild_sort_fast to build a BST to sort sections. */ | |
394 | ||
395 | static void | |
396 | output_section_callback_fast (lang_wild_statement_type *ptr, | |
329c1c86 AM |
397 | struct wildcard_list *sec, |
398 | asection *section, | |
399 | lang_input_statement_type *file, | |
400 | void *output ATTRIBUTE_UNUSED) | |
50c77e5d NC |
401 | { |
402 | lang_section_bst_type *node; | |
403 | lang_section_bst_type **tree; | |
404 | ||
405 | if (unique_section_p (section)) | |
406 | return; | |
407 | ||
408 | node = xmalloc (sizeof (lang_section_bst_type)); | |
409 | node->left = 0; | |
410 | node->right = 0; | |
411 | node->section = section; | |
412 | ||
413 | tree = wild_sort_fast (ptr, sec, file, section); | |
414 | if (tree != NULL) | |
415 | *tree = node; | |
416 | } | |
417 | ||
418 | /* Convert a sorted sections' BST back to list form. */ | |
419 | ||
420 | static void | |
329c1c86 AM |
421 | output_section_callback_tree_to_list (lang_wild_statement_type *ptr, |
422 | lang_section_bst_type *tree, | |
423 | void *output) | |
50c77e5d NC |
424 | { |
425 | if (tree->left) | |
426 | output_section_callback_tree_to_list (ptr, tree->left, output); | |
427 | ||
329c1c86 AM |
428 | lang_add_section (&ptr->children, tree->section, |
429 | (lang_output_section_statement_type *) output); | |
50c77e5d NC |
430 | |
431 | if (tree->right) | |
432 | output_section_callback_tree_to_list (ptr, tree->right, output); | |
433 | ||
434 | free (tree); | |
435 | } | |
436 | ||
72223188 JJ |
437 | /* Specialized, optimized routines for handling different kinds of |
438 | wildcards */ | |
439 | ||
440 | static void | |
441 | walk_wild_section_specs1_wild0 (lang_wild_statement_type *ptr, | |
442 | lang_input_statement_type *file, | |
443 | callback_t callback, | |
444 | void *data) | |
445 | { | |
446 | /* We can just do a hash lookup for the section with the right name. | |
447 | But if that lookup discovers more than one section with the name | |
448 | (should be rare), we fall back to the general algorithm because | |
449 | we would otherwise have to sort the sections to make sure they | |
450 | get processed in the bfd's order. */ | |
451 | bfd_boolean multiple_sections_found; | |
452 | struct wildcard_list *sec0 = ptr->handler_data[0]; | |
453 | asection *s0 = find_section (file, sec0, &multiple_sections_found); | |
454 | ||
455 | if (multiple_sections_found) | |
456 | walk_wild_section_general (ptr, file, callback, data); | |
457 | else if (s0) | |
458 | walk_wild_consider_section (ptr, file, s0, sec0, callback, data); | |
459 | } | |
460 | ||
461 | static void | |
462 | walk_wild_section_specs1_wild1 (lang_wild_statement_type *ptr, | |
463 | lang_input_statement_type *file, | |
464 | callback_t callback, | |
465 | void *data) | |
466 | { | |
467 | asection *s; | |
468 | struct wildcard_list *wildsec0 = ptr->handler_data[0]; | |
469 | ||
470 | for (s = file->the_bfd->sections; s != NULL; s = s->next) | |
471 | { | |
472 | const char *sname = bfd_get_section_name (file->the_bfd, s); | |
473 | bfd_boolean skip = !match_simple_wild (wildsec0->spec.name, sname); | |
474 | ||
475 | if (!skip) | |
476 | walk_wild_consider_section (ptr, file, s, wildsec0, callback, data); | |
477 | } | |
478 | } | |
479 | ||
480 | static void | |
481 | walk_wild_section_specs2_wild1 (lang_wild_statement_type *ptr, | |
482 | lang_input_statement_type *file, | |
483 | callback_t callback, | |
484 | void *data) | |
485 | { | |
486 | asection *s; | |
487 | struct wildcard_list *sec0 = ptr->handler_data[0]; | |
488 | struct wildcard_list *wildsec1 = ptr->handler_data[1]; | |
489 | bfd_boolean multiple_sections_found; | |
490 | asection *s0 = find_section (file, sec0, &multiple_sections_found); | |
491 | ||
492 | if (multiple_sections_found) | |
493 | { | |
494 | walk_wild_section_general (ptr, file, callback, data); | |
495 | return; | |
496 | } | |
497 | ||
498 | /* Note that if the section was not found, s0 is NULL and | |
499 | we'll simply never succeed the s == s0 test below. */ | |
500 | for (s = file->the_bfd->sections; s != NULL; s = s->next) | |
501 | { | |
502 | /* Recall that in this code path, a section cannot satisfy more | |
503 | than one spec, so if s == s0 then it cannot match | |
504 | wildspec1. */ | |
505 | if (s == s0) | |
506 | walk_wild_consider_section (ptr, file, s, sec0, callback, data); | |
507 | else | |
508 | { | |
509 | const char *sname = bfd_get_section_name (file->the_bfd, s); | |
510 | bfd_boolean skip = !match_simple_wild (wildsec1->spec.name, sname); | |
511 | ||
512 | if (!skip) | |
513 | walk_wild_consider_section (ptr, file, s, wildsec1, callback, | |
514 | data); | |
515 | } | |
516 | } | |
517 | } | |
518 | ||
519 | static void | |
520 | walk_wild_section_specs3_wild2 (lang_wild_statement_type *ptr, | |
521 | lang_input_statement_type *file, | |
522 | callback_t callback, | |
523 | void *data) | |
524 | { | |
525 | asection *s; | |
526 | struct wildcard_list *sec0 = ptr->handler_data[0]; | |
527 | struct wildcard_list *wildsec1 = ptr->handler_data[1]; | |
528 | struct wildcard_list *wildsec2 = ptr->handler_data[2]; | |
529 | bfd_boolean multiple_sections_found; | |
530 | asection *s0 = find_section (file, sec0, &multiple_sections_found); | |
531 | ||
532 | if (multiple_sections_found) | |
533 | { | |
534 | walk_wild_section_general (ptr, file, callback, data); | |
535 | return; | |
536 | } | |
537 | ||
538 | for (s = file->the_bfd->sections; s != NULL; s = s->next) | |
539 | { | |
540 | if (s == s0) | |
541 | walk_wild_consider_section (ptr, file, s, sec0, callback, data); | |
542 | else | |
543 | { | |
544 | const char *sname = bfd_get_section_name (file->the_bfd, s); | |
545 | bfd_boolean skip = !match_simple_wild (wildsec1->spec.name, sname); | |
546 | ||
547 | if (!skip) | |
548 | walk_wild_consider_section (ptr, file, s, wildsec1, callback, data); | |
549 | else | |
550 | { | |
551 | skip = !match_simple_wild (wildsec2->spec.name, sname); | |
552 | if (!skip) | |
553 | walk_wild_consider_section (ptr, file, s, wildsec2, callback, | |
554 | data); | |
555 | } | |
556 | } | |
557 | } | |
558 | } | |
559 | ||
560 | static void | |
561 | walk_wild_section_specs4_wild2 (lang_wild_statement_type *ptr, | |
562 | lang_input_statement_type *file, | |
563 | callback_t callback, | |
564 | void *data) | |
565 | { | |
566 | asection *s; | |
567 | struct wildcard_list *sec0 = ptr->handler_data[0]; | |
568 | struct wildcard_list *sec1 = ptr->handler_data[1]; | |
569 | struct wildcard_list *wildsec2 = ptr->handler_data[2]; | |
570 | struct wildcard_list *wildsec3 = ptr->handler_data[3]; | |
571 | bfd_boolean multiple_sections_found; | |
572 | asection *s0 = find_section (file, sec0, &multiple_sections_found), *s1; | |
573 | ||
574 | if (multiple_sections_found) | |
575 | { | |
576 | walk_wild_section_general (ptr, file, callback, data); | |
577 | return; | |
578 | } | |
579 | ||
580 | s1 = find_section (file, sec1, &multiple_sections_found); | |
581 | if (multiple_sections_found) | |
582 | { | |
583 | walk_wild_section_general (ptr, file, callback, data); | |
584 | return; | |
585 | } | |
586 | ||
587 | for (s = file->the_bfd->sections; s != NULL; s = s->next) | |
588 | { | |
589 | if (s == s0) | |
590 | walk_wild_consider_section (ptr, file, s, sec0, callback, data); | |
591 | else | |
592 | if (s == s1) | |
593 | walk_wild_consider_section (ptr, file, s, sec1, callback, data); | |
594 | else | |
595 | { | |
596 | const char *sname = bfd_get_section_name (file->the_bfd, s); | |
597 | bfd_boolean skip = !match_simple_wild (wildsec2->spec.name, | |
598 | sname); | |
599 | ||
600 | if (!skip) | |
601 | walk_wild_consider_section (ptr, file, s, wildsec2, callback, | |
602 | data); | |
603 | else | |
604 | { | |
605 | skip = !match_simple_wild (wildsec3->spec.name, sname); | |
606 | if (!skip) | |
607 | walk_wild_consider_section (ptr, file, s, wildsec3, | |
608 | callback, data); | |
609 | } | |
610 | } | |
611 | } | |
612 | } | |
613 | ||
614 | static void | |
615 | walk_wild_section (lang_wild_statement_type *ptr, | |
616 | lang_input_statement_type *file, | |
617 | callback_t callback, | |
618 | void *data) | |
619 | { | |
620 | if (file->just_syms_flag) | |
621 | return; | |
622 | ||
623 | (*ptr->walk_wild_section_handler) (ptr, file, callback, data); | |
624 | } | |
625 | ||
626 | /* Returns TRUE when name1 is a wildcard spec that might match | |
627 | something name2 can match. We're conservative: we return FALSE | |
628 | only if the prefixes of name1 and name2 are different up to the | |
629 | first wildcard character. */ | |
630 | ||
631 | static bfd_boolean | |
632 | wild_spec_can_overlap (const char *name1, const char *name2) | |
633 | { | |
634 | size_t prefix1_len = strcspn (name1, "?*["); | |
635 | size_t prefix2_len = strcspn (name2, "?*["); | |
636 | size_t min_prefix_len; | |
637 | ||
638 | /* Note that if there is no wildcard character, then we treat the | |
639 | terminating 0 as part of the prefix. Thus ".text" won't match | |
640 | ".text." or ".text.*", for example. */ | |
641 | if (name1[prefix1_len] == '\0') | |
642 | prefix1_len++; | |
643 | if (name2[prefix2_len] == '\0') | |
644 | prefix2_len++; | |
645 | ||
646 | min_prefix_len = prefix1_len < prefix2_len ? prefix1_len : prefix2_len; | |
647 | ||
648 | return memcmp (name1, name2, min_prefix_len) == 0; | |
649 | } | |
650 | ||
651 | /* Select specialized code to handle various kinds of wildcard | |
652 | statements. */ | |
653 | ||
654 | static void | |
655 | analyze_walk_wild_section_handler (lang_wild_statement_type *ptr) | |
656 | { | |
657 | int sec_count = 0; | |
658 | int wild_name_count = 0; | |
659 | struct wildcard_list *sec; | |
660 | int signature; | |
661 | int data_counter; | |
662 | ||
663 | ptr->walk_wild_section_handler = walk_wild_section_general; | |
7544697a AM |
664 | ptr->handler_data[0] = NULL; |
665 | ptr->handler_data[1] = NULL; | |
666 | ptr->handler_data[2] = NULL; | |
667 | ptr->handler_data[3] = NULL; | |
e6f2cbf5 | 668 | ptr->tree = NULL; |
72223188 JJ |
669 | |
670 | /* Count how many wildcard_specs there are, and how many of those | |
671 | actually use wildcards in the name. Also, bail out if any of the | |
672 | wildcard names are NULL. (Can this actually happen? | |
673 | walk_wild_section used to test for it.) And bail out if any | |
674 | of the wildcards are more complex than a simple string | |
675 | ending in a single '*'. */ | |
676 | for (sec = ptr->section_list; sec != NULL; sec = sec->next) | |
677 | { | |
678 | ++sec_count; | |
679 | if (sec->spec.name == NULL) | |
680 | return; | |
681 | if (wildcardp (sec->spec.name)) | |
682 | { | |
683 | ++wild_name_count; | |
684 | if (!is_simple_wild (sec->spec.name)) | |
685 | return; | |
686 | } | |
687 | } | |
688 | ||
689 | /* The zero-spec case would be easy to optimize but it doesn't | |
690 | happen in practice. Likewise, more than 4 specs doesn't | |
691 | happen in practice. */ | |
692 | if (sec_count == 0 || sec_count > 4) | |
693 | return; | |
694 | ||
695 | /* Check that no two specs can match the same section. */ | |
696 | for (sec = ptr->section_list; sec != NULL; sec = sec->next) | |
697 | { | |
698 | struct wildcard_list *sec2; | |
699 | for (sec2 = sec->next; sec2 != NULL; sec2 = sec2->next) | |
700 | { | |
701 | if (wild_spec_can_overlap (sec->spec.name, sec2->spec.name)) | |
702 | return; | |
703 | } | |
704 | } | |
705 | ||
706 | signature = (sec_count << 8) + wild_name_count; | |
707 | switch (signature) | |
708 | { | |
709 | case 0x0100: | |
710 | ptr->walk_wild_section_handler = walk_wild_section_specs1_wild0; | |
711 | break; | |
712 | case 0x0101: | |
713 | ptr->walk_wild_section_handler = walk_wild_section_specs1_wild1; | |
714 | break; | |
715 | case 0x0201: | |
716 | ptr->walk_wild_section_handler = walk_wild_section_specs2_wild1; | |
717 | break; | |
718 | case 0x0302: | |
719 | ptr->walk_wild_section_handler = walk_wild_section_specs3_wild2; | |
720 | break; | |
721 | case 0x0402: | |
722 | ptr->walk_wild_section_handler = walk_wild_section_specs4_wild2; | |
723 | break; | |
724 | default: | |
725 | return; | |
726 | } | |
727 | ||
728 | /* Now fill the data array with pointers to the specs, first the | |
729 | specs with non-wildcard names, then the specs with wildcard | |
730 | names. It's OK to process the specs in different order from the | |
731 | given order, because we've already determined that no section | |
732 | will match more than one spec. */ | |
733 | data_counter = 0; | |
734 | for (sec = ptr->section_list; sec != NULL; sec = sec->next) | |
735 | if (!wildcardp (sec->spec.name)) | |
736 | ptr->handler_data[data_counter++] = sec; | |
737 | for (sec = ptr->section_list; sec != NULL; sec = sec->next) | |
738 | if (wildcardp (sec->spec.name)) | |
739 | ptr->handler_data[data_counter++] = sec; | |
740 | } | |
741 | ||
4dec4d4e RH |
742 | /* Handle a wild statement for a single file F. */ |
743 | ||
744 | static void | |
1579bae1 AM |
745 | walk_wild_file (lang_wild_statement_type *s, |
746 | lang_input_statement_type *f, | |
747 | callback_t callback, | |
748 | void *data) | |
4dec4d4e RH |
749 | { |
750 | if (f->the_bfd == NULL | |
751 | || ! bfd_check_format (f->the_bfd, bfd_archive)) | |
b6bf44ba | 752 | walk_wild_section (s, f, callback, data); |
4dec4d4e RH |
753 | else |
754 | { | |
755 | bfd *member; | |
756 | ||
757 | /* This is an archive file. We must map each member of the | |
758 | archive separately. */ | |
1579bae1 | 759 | member = bfd_openr_next_archived_file (f->the_bfd, NULL); |
4dec4d4e RH |
760 | while (member != NULL) |
761 | { | |
762 | /* When lookup_name is called, it will call the add_symbols | |
763 | entry point for the archive. For each element of the | |
764 | archive which is included, BFD will call ldlang_add_file, | |
765 | which will set the usrdata field of the member to the | |
766 | lang_input_statement. */ | |
767 | if (member->usrdata != NULL) | |
768 | { | |
1579bae1 | 769 | walk_wild_section (s, member->usrdata, callback, data); |
4dec4d4e RH |
770 | } |
771 | ||
772 | member = bfd_openr_next_archived_file (f->the_bfd, member); | |
773 | } | |
774 | } | |
775 | } | |
776 | ||
777 | static void | |
1579bae1 | 778 | walk_wild (lang_wild_statement_type *s, callback_t callback, void *data) |
4dec4d4e | 779 | { |
b6bf44ba AM |
780 | const char *file_spec = s->filename; |
781 | ||
782 | if (file_spec == NULL) | |
4dec4d4e RH |
783 | { |
784 | /* Perform the iteration over all files in the list. */ | |
e50d8076 | 785 | LANG_FOR_EACH_INPUT_STATEMENT (f) |
4dec4d4e | 786 | { |
b6bf44ba | 787 | walk_wild_file (s, f, callback, data); |
4dec4d4e RH |
788 | } |
789 | } | |
b6bf44ba | 790 | else if (wildcardp (file_spec)) |
4dec4d4e | 791 | { |
e50d8076 | 792 | LANG_FOR_EACH_INPUT_STATEMENT (f) |
4dec4d4e | 793 | { |
68bbb9f7 | 794 | if (fnmatch (file_spec, f->filename, 0) == 0) |
b6bf44ba | 795 | walk_wild_file (s, f, callback, data); |
4dec4d4e RH |
796 | } |
797 | } | |
798 | else | |
799 | { | |
e50d8076 NC |
800 | lang_input_statement_type *f; |
801 | ||
4dec4d4e | 802 | /* Perform the iteration over a single file. */ |
b6bf44ba | 803 | f = lookup_name (file_spec); |
6770ec8c | 804 | if (f) |
b6bf44ba | 805 | walk_wild_file (s, f, callback, data); |
4dec4d4e | 806 | } |
5f992e62 AM |
807 | } |
808 | ||
08da4cac KH |
809 | /* lang_for_each_statement walks the parse tree and calls the provided |
810 | function for each node. */ | |
252b5132 RH |
811 | |
812 | static void | |
1579bae1 AM |
813 | lang_for_each_statement_worker (void (*func) (lang_statement_union_type *), |
814 | lang_statement_union_type *s) | |
252b5132 | 815 | { |
1579bae1 | 816 | for (; s != NULL; s = s->header.next) |
252b5132 RH |
817 | { |
818 | func (s); | |
819 | ||
820 | switch (s->header.type) | |
821 | { | |
822 | case lang_constructors_statement_enum: | |
823 | lang_for_each_statement_worker (func, constructor_list.head); | |
824 | break; | |
825 | case lang_output_section_statement_enum: | |
826 | lang_for_each_statement_worker | |
6feb9908 | 827 | (func, s->output_section_statement.children.head); |
252b5132 RH |
828 | break; |
829 | case lang_wild_statement_enum: | |
6feb9908 AM |
830 | lang_for_each_statement_worker (func, |
831 | s->wild_statement.children.head); | |
252b5132 RH |
832 | break; |
833 | case lang_group_statement_enum: | |
834 | lang_for_each_statement_worker (func, | |
835 | s->group_statement.children.head); | |
836 | break; | |
837 | case lang_data_statement_enum: | |
838 | case lang_reloc_statement_enum: | |
839 | case lang_object_symbols_statement_enum: | |
840 | case lang_output_statement_enum: | |
841 | case lang_target_statement_enum: | |
842 | case lang_input_section_enum: | |
843 | case lang_input_statement_enum: | |
844 | case lang_assignment_statement_enum: | |
845 | case lang_padding_statement_enum: | |
846 | case lang_address_statement_enum: | |
847 | case lang_fill_statement_enum: | |
848 | break; | |
849 | default: | |
850 | FAIL (); | |
851 | break; | |
852 | } | |
853 | } | |
854 | } | |
855 | ||
856 | void | |
1579bae1 | 857 | lang_for_each_statement (void (*func) (lang_statement_union_type *)) |
252b5132 | 858 | { |
08da4cac | 859 | lang_for_each_statement_worker (func, statement_list.head); |
252b5132 RH |
860 | } |
861 | ||
862 | /*----------------------------------------------------------------------*/ | |
08da4cac | 863 | |
252b5132 | 864 | void |
1579bae1 | 865 | lang_list_init (lang_statement_list_type *list) |
252b5132 | 866 | { |
1579bae1 | 867 | list->head = NULL; |
252b5132 RH |
868 | list->tail = &list->head; |
869 | } | |
870 | ||
08da4cac | 871 | /* Build a new statement node for the parse tree. */ |
252b5132 | 872 | |
08da4cac | 873 | static lang_statement_union_type * |
1579bae1 AM |
874 | new_statement (enum statement_enum type, |
875 | size_t size, | |
876 | lang_statement_list_type *list) | |
252b5132 | 877 | { |
1579bae1 | 878 | lang_statement_union_type *new; |
252b5132 | 879 | |
1579bae1 | 880 | new = stat_alloc (size); |
252b5132 | 881 | new->header.type = type; |
1579bae1 | 882 | new->header.next = NULL; |
252b5132 RH |
883 | lang_statement_append (list, new, &new->header.next); |
884 | return new; | |
885 | } | |
886 | ||
08da4cac KH |
887 | /* Build a new input file node for the language. There are several |
888 | ways in which we treat an input file, eg, we only look at symbols, | |
889 | or prefix it with a -l etc. | |
252b5132 | 890 | |
08da4cac | 891 | We can be supplied with requests for input files more than once; |
396a2467 | 892 | they may, for example be split over several lines like foo.o(.text) |
d1778b88 | 893 | foo.o(.data) etc, so when asked for a file we check that we haven't |
08da4cac | 894 | got it already so we don't duplicate the bfd. */ |
252b5132 | 895 | |
252b5132 | 896 | static lang_input_statement_type * |
1579bae1 AM |
897 | new_afile (const char *name, |
898 | lang_input_file_enum_type file_type, | |
899 | const char *target, | |
900 | bfd_boolean add_to_list) | |
252b5132 RH |
901 | { |
902 | lang_input_statement_type *p; | |
903 | ||
904 | if (add_to_list) | |
905 | p = new_stat (lang_input_statement, stat_ptr); | |
906 | else | |
907 | { | |
1579bae1 | 908 | p = stat_alloc (sizeof (lang_input_statement_type)); |
bd4d42c1 | 909 | p->header.type = lang_input_statement_enum; |
252b5132 RH |
910 | p->header.next = NULL; |
911 | } | |
912 | ||
b34976b6 | 913 | lang_has_input_file = TRUE; |
252b5132 | 914 | p->target = target; |
e3f2db7f | 915 | p->sysrooted = FALSE; |
bcb674cf RS |
916 | |
917 | if (file_type == lang_input_file_is_l_enum | |
918 | && name[0] == ':' && name[1] != '\0') | |
919 | { | |
920 | file_type = lang_input_file_is_search_file_enum; | |
921 | name = name + 1; | |
922 | } | |
923 | ||
252b5132 RH |
924 | switch (file_type) |
925 | { | |
926 | case lang_input_file_is_symbols_only_enum: | |
927 | p->filename = name; | |
b34976b6 AM |
928 | p->is_archive = FALSE; |
929 | p->real = TRUE; | |
252b5132 | 930 | p->local_sym_name = name; |
b34976b6 AM |
931 | p->just_syms_flag = TRUE; |
932 | p->search_dirs_flag = FALSE; | |
252b5132 RH |
933 | break; |
934 | case lang_input_file_is_fake_enum: | |
935 | p->filename = name; | |
b34976b6 AM |
936 | p->is_archive = FALSE; |
937 | p->real = FALSE; | |
252b5132 | 938 | p->local_sym_name = name; |
b34976b6 AM |
939 | p->just_syms_flag = FALSE; |
940 | p->search_dirs_flag = FALSE; | |
252b5132 RH |
941 | break; |
942 | case lang_input_file_is_l_enum: | |
b34976b6 | 943 | p->is_archive = TRUE; |
252b5132 | 944 | p->filename = name; |
b34976b6 | 945 | p->real = TRUE; |
1579bae1 | 946 | p->local_sym_name = concat ("-l", name, NULL); |
b34976b6 AM |
947 | p->just_syms_flag = FALSE; |
948 | p->search_dirs_flag = TRUE; | |
252b5132 RH |
949 | break; |
950 | case lang_input_file_is_marker_enum: | |
951 | p->filename = name; | |
b34976b6 AM |
952 | p->is_archive = FALSE; |
953 | p->real = FALSE; | |
252b5132 | 954 | p->local_sym_name = name; |
b34976b6 AM |
955 | p->just_syms_flag = FALSE; |
956 | p->search_dirs_flag = TRUE; | |
252b5132 RH |
957 | break; |
958 | case lang_input_file_is_search_file_enum: | |
e3f2db7f | 959 | p->sysrooted = ldlang_sysrooted_script; |
252b5132 | 960 | p->filename = name; |
b34976b6 AM |
961 | p->is_archive = FALSE; |
962 | p->real = TRUE; | |
252b5132 | 963 | p->local_sym_name = name; |
b34976b6 AM |
964 | p->just_syms_flag = FALSE; |
965 | p->search_dirs_flag = TRUE; | |
252b5132 RH |
966 | break; |
967 | case lang_input_file_is_file_enum: | |
968 | p->filename = name; | |
b34976b6 AM |
969 | p->is_archive = FALSE; |
970 | p->real = TRUE; | |
252b5132 | 971 | p->local_sym_name = name; |
b34976b6 AM |
972 | p->just_syms_flag = FALSE; |
973 | p->search_dirs_flag = FALSE; | |
252b5132 RH |
974 | break; |
975 | default: | |
976 | FAIL (); | |
977 | } | |
1579bae1 AM |
978 | p->the_bfd = NULL; |
979 | p->asymbols = NULL; | |
980 | p->next_real_file = NULL; | |
981 | p->next = NULL; | |
252b5132 RH |
982 | p->symbol_count = 0; |
983 | p->dynamic = config.dynamic_link; | |
e56f61be | 984 | p->add_needed = add_needed; |
4a43e768 | 985 | p->as_needed = as_needed; |
252b5132 | 986 | p->whole_archive = whole_archive; |
b34976b6 | 987 | p->loaded = FALSE; |
252b5132 RH |
988 | lang_statement_append (&input_file_chain, |
989 | (lang_statement_union_type *) p, | |
990 | &p->next_real_file); | |
991 | return p; | |
992 | } | |
993 | ||
994 | lang_input_statement_type * | |
1579bae1 AM |
995 | lang_add_input_file (const char *name, |
996 | lang_input_file_enum_type file_type, | |
997 | const char *target) | |
252b5132 | 998 | { |
b34976b6 | 999 | return new_afile (name, file_type, target, TRUE); |
252b5132 RH |
1000 | } |
1001 | ||
409d7240 | 1002 | struct out_section_hash_entry |
750877ba L |
1003 | { |
1004 | struct bfd_hash_entry root; | |
409d7240 | 1005 | lang_statement_union_type s; |
750877ba L |
1006 | }; |
1007 | ||
1008 | /* The hash table. */ | |
1009 | ||
409d7240 | 1010 | static struct bfd_hash_table output_section_statement_table; |
750877ba | 1011 | |
384a9dda | 1012 | /* Support routines for the hash table used by lang_output_section_find, |
750877ba L |
1013 | initialize the table, fill in an entry and remove the table. */ |
1014 | ||
1015 | static struct bfd_hash_entry * | |
329c1c86 | 1016 | output_section_statement_newfunc (struct bfd_hash_entry *entry, |
409d7240 AM |
1017 | struct bfd_hash_table *table, |
1018 | const char *string) | |
750877ba | 1019 | { |
384a9dda | 1020 | lang_output_section_statement_type **nextp; |
409d7240 | 1021 | struct out_section_hash_entry *ret; |
384a9dda AM |
1022 | |
1023 | if (entry == NULL) | |
1024 | { | |
1025 | entry = bfd_hash_allocate (table, sizeof (*ret)); | |
1026 | if (entry == NULL) | |
1027 | return entry; | |
1028 | } | |
1029 | ||
1030 | entry = bfd_hash_newfunc (entry, table, string); | |
1031 | if (entry == NULL) | |
1032 | return entry; | |
1033 | ||
409d7240 AM |
1034 | ret = (struct out_section_hash_entry *) entry; |
1035 | memset (&ret->s, 0, sizeof (ret->s)); | |
1036 | ret->s.header.type = lang_output_section_statement_enum; | |
1037 | ret->s.output_section_statement.subsection_alignment = -1; | |
1038 | ret->s.output_section_statement.section_alignment = -1; | |
1039 | ret->s.output_section_statement.block_value = 1; | |
1040 | lang_list_init (&ret->s.output_section_statement.children); | |
1041 | lang_statement_append (stat_ptr, &ret->s, &ret->s.header.next); | |
384a9dda | 1042 | |
218868ba AM |
1043 | /* For every output section statement added to the list, except the |
1044 | first one, lang_output_section_statement.tail points to the "next" | |
1045 | field of the last element of the list. */ | |
1046 | if (lang_output_section_statement.head != NULL) | |
409d7240 AM |
1047 | ret->s.output_section_statement.prev |
1048 | = ((lang_output_section_statement_type *) | |
1049 | ((char *) lang_output_section_statement.tail | |
1050 | - offsetof (lang_output_section_statement_type, next))); | |
218868ba | 1051 | |
384a9dda AM |
1052 | /* GCC's strict aliasing rules prevent us from just casting the |
1053 | address, so we store the pointer in a variable and cast that | |
1054 | instead. */ | |
409d7240 | 1055 | nextp = &ret->s.output_section_statement.next; |
384a9dda | 1056 | lang_statement_append (&lang_output_section_statement, |
409d7240 | 1057 | &ret->s, |
384a9dda AM |
1058 | (lang_statement_union_type **) nextp); |
1059 | return &ret->root; | |
750877ba L |
1060 | } |
1061 | ||
1062 | static void | |
409d7240 | 1063 | output_section_statement_table_init (void) |
750877ba | 1064 | { |
409d7240 AM |
1065 | if (!bfd_hash_table_init_n (&output_section_statement_table, |
1066 | output_section_statement_newfunc, | |
1067 | sizeof (struct out_section_hash_entry), | |
66eb6687 | 1068 | 61)) |
384a9dda | 1069 | einfo (_("%P%F: can not create hash table: %E\n")); |
750877ba L |
1070 | } |
1071 | ||
1072 | static void | |
409d7240 | 1073 | output_section_statement_table_free (void) |
750877ba | 1074 | { |
409d7240 | 1075 | bfd_hash_table_free (&output_section_statement_table); |
750877ba L |
1076 | } |
1077 | ||
08da4cac KH |
1078 | /* Build enough state so that the parser can build its tree. */ |
1079 | ||
252b5132 | 1080 | void |
1579bae1 | 1081 | lang_init (void) |
252b5132 RH |
1082 | { |
1083 | obstack_begin (&stat_obstack, 1000); | |
1084 | ||
1085 | stat_ptr = &statement_list; | |
1086 | ||
409d7240 | 1087 | output_section_statement_table_init (); |
750877ba | 1088 | |
252b5132 RH |
1089 | lang_list_init (stat_ptr); |
1090 | ||
1091 | lang_list_init (&input_file_chain); | |
1092 | lang_list_init (&lang_output_section_statement); | |
1093 | lang_list_init (&file_chain); | |
1579bae1 AM |
1094 | first_file = lang_add_input_file (NULL, lang_input_file_is_marker_enum, |
1095 | NULL); | |
08da4cac KH |
1096 | abs_output_section = |
1097 | lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME); | |
252b5132 RH |
1098 | |
1099 | abs_output_section->bfd_section = bfd_abs_section_ptr; | |
420e579c HPN |
1100 | |
1101 | /* The value "3" is ad-hoc, somewhat related to the expected number of | |
1102 | DEFINED expressions in a linker script. For most default linker | |
1103 | scripts, there are none. Why a hash table then? Well, it's somewhat | |
1104 | simpler to re-use working machinery than using a linked list in terms | |
1105 | of code-complexity here in ld, besides the initialization which just | |
1106 | looks like other code here. */ | |
688c58f3 | 1107 | if (!bfd_hash_table_init_n (&lang_definedness_table, |
66eb6687 AM |
1108 | lang_definedness_newfunc, |
1109 | sizeof (struct lang_definedness_hash_entry), | |
1110 | 3)) | |
384a9dda | 1111 | einfo (_("%P%F: can not create hash table: %E\n")); |
252b5132 RH |
1112 | } |
1113 | ||
750877ba L |
1114 | void |
1115 | lang_finish (void) | |
1116 | { | |
409d7240 | 1117 | output_section_statement_table_free (); |
750877ba L |
1118 | } |
1119 | ||
252b5132 | 1120 | /*---------------------------------------------------------------------- |
08da4cac KH |
1121 | A region is an area of memory declared with the |
1122 | MEMORY { name:org=exp, len=exp ... } | |
1123 | syntax. | |
252b5132 | 1124 | |
08da4cac | 1125 | We maintain a list of all the regions here. |
252b5132 | 1126 | |
08da4cac | 1127 | If no regions are specified in the script, then the default is used |
a747ee4d NC |
1128 | which is created when looked up to be the entire data space. |
1129 | ||
1130 | If create is true we are creating a region inside a MEMORY block. | |
1131 | In this case it is probably an error to create a region that has | |
1132 | already been created. If we are not inside a MEMORY block it is | |
1133 | dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION) | |
1134 | and so we issue a warning. */ | |
252b5132 RH |
1135 | |
1136 | static lang_memory_region_type *lang_memory_region_list; | |
6feb9908 AM |
1137 | static lang_memory_region_type **lang_memory_region_list_tail |
1138 | = &lang_memory_region_list; | |
252b5132 RH |
1139 | |
1140 | lang_memory_region_type * | |
a747ee4d | 1141 | lang_memory_region_lookup (const char *const name, bfd_boolean create) |
252b5132 RH |
1142 | { |
1143 | lang_memory_region_type *p; | |
1579bae1 | 1144 | lang_memory_region_type *new; |
252b5132 | 1145 | |
9f88b410 RS |
1146 | /* NAME is NULL for LMA memspecs if no region was specified. */ |
1147 | if (name == NULL) | |
1148 | return NULL; | |
1149 | ||
1579bae1 | 1150 | for (p = lang_memory_region_list; p != NULL; p = p->next) |
a747ee4d NC |
1151 | if (strcmp (p->name, name) == 0) |
1152 | { | |
1153 | if (create) | |
6feb9908 AM |
1154 | einfo (_("%P:%S: warning: redeclaration of memory region '%s'\n"), |
1155 | name); | |
1579bae1 | 1156 | return p; |
a747ee4d | 1157 | } |
252b5132 | 1158 | |
a747ee4d NC |
1159 | if (!create && strcmp (name, DEFAULT_MEMORY_REGION)) |
1160 | einfo (_("%P:%S: warning: memory region %s not declared\n"), name); | |
1161 | ||
1579bae1 | 1162 | new = stat_alloc (sizeof (lang_memory_region_type)); |
252b5132 | 1163 | |
1579bae1 AM |
1164 | new->name = xstrdup (name); |
1165 | new->next = NULL; | |
1579bae1 | 1166 | new->origin = 0; |
1579bae1 AM |
1167 | new->length = ~(bfd_size_type) 0; |
1168 | new->current = 0; | |
66e28d60 AM |
1169 | new->last_os = NULL; |
1170 | new->flags = 0; | |
1171 | new->not_flags = 0; | |
1579bae1 | 1172 | new->had_full_message = FALSE; |
252b5132 | 1173 | |
66e28d60 AM |
1174 | *lang_memory_region_list_tail = new; |
1175 | lang_memory_region_list_tail = &new->next; | |
1176 | ||
1579bae1 | 1177 | return new; |
252b5132 RH |
1178 | } |
1179 | ||
5f992e62 | 1180 | static lang_memory_region_type * |
1579bae1 | 1181 | lang_memory_default (asection *section) |
252b5132 RH |
1182 | { |
1183 | lang_memory_region_type *p; | |
1184 | ||
1185 | flagword sec_flags = section->flags; | |
1186 | ||
1187 | /* Override SEC_DATA to mean a writable section. */ | |
1188 | if ((sec_flags & (SEC_ALLOC | SEC_READONLY | SEC_CODE)) == SEC_ALLOC) | |
1189 | sec_flags |= SEC_DATA; | |
1190 | ||
1579bae1 | 1191 | for (p = lang_memory_region_list; p != NULL; p = p->next) |
252b5132 RH |
1192 | { |
1193 | if ((p->flags & sec_flags) != 0 | |
1194 | && (p->not_flags & sec_flags) == 0) | |
1195 | { | |
1196 | return p; | |
1197 | } | |
1198 | } | |
a747ee4d | 1199 | return lang_memory_region_lookup (DEFAULT_MEMORY_REGION, FALSE); |
252b5132 RH |
1200 | } |
1201 | ||
384a9dda AM |
1202 | lang_output_section_statement_type * |
1203 | lang_output_section_find (const char *const name) | |
252b5132 | 1204 | { |
409d7240 | 1205 | struct out_section_hash_entry *entry; |
750877ba | 1206 | unsigned long hash; |
252b5132 | 1207 | |
409d7240 AM |
1208 | entry = ((struct out_section_hash_entry *) |
1209 | bfd_hash_lookup (&output_section_statement_table, name, | |
1210 | FALSE, FALSE)); | |
384a9dda | 1211 | if (entry == NULL) |
750877ba L |
1212 | return NULL; |
1213 | ||
1214 | hash = entry->root.hash; | |
1215 | do | |
252b5132 | 1216 | { |
409d7240 AM |
1217 | if (entry->s.output_section_statement.constraint != -1) |
1218 | return &entry->s.output_section_statement; | |
1219 | entry = (struct out_section_hash_entry *) entry->root.next; | |
252b5132 | 1220 | } |
750877ba L |
1221 | while (entry != NULL |
1222 | && entry->root.hash == hash | |
409d7240 | 1223 | && strcmp (name, entry->s.output_section_statement.name) == 0); |
750877ba | 1224 | |
1579bae1 | 1225 | return NULL; |
252b5132 RH |
1226 | } |
1227 | ||
0841712e JJ |
1228 | static lang_output_section_statement_type * |
1229 | lang_output_section_statement_lookup_1 (const char *const name, int constraint) | |
252b5132 | 1230 | { |
409d7240 AM |
1231 | struct out_section_hash_entry *entry; |
1232 | struct out_section_hash_entry *last_ent; | |
384a9dda AM |
1233 | unsigned long hash; |
1234 | ||
409d7240 AM |
1235 | entry = ((struct out_section_hash_entry *) |
1236 | bfd_hash_lookup (&output_section_statement_table, name, | |
1237 | TRUE, FALSE)); | |
384a9dda AM |
1238 | if (entry == NULL) |
1239 | { | |
1240 | einfo (_("%P%F: failed creating section `%s': %E\n"), name); | |
1241 | return NULL; | |
1242 | } | |
252b5132 | 1243 | |
409d7240 | 1244 | if (entry->s.output_section_statement.name != NULL) |
252b5132 | 1245 | { |
384a9dda AM |
1246 | /* We have a section of this name, but it might not have the correct |
1247 | constraint. */ | |
1248 | hash = entry->root.hash; | |
1249 | do | |
1250 | { | |
409d7240 | 1251 | if (entry->s.output_section_statement.constraint != -1 |
384a9dda | 1252 | && (constraint == 0 |
409d7240 | 1253 | || (constraint == entry->s.output_section_statement.constraint |
384a9dda | 1254 | && constraint != SPECIAL))) |
409d7240 | 1255 | return &entry->s.output_section_statement; |
384a9dda | 1256 | last_ent = entry; |
409d7240 | 1257 | entry = (struct out_section_hash_entry *) entry->root.next; |
384a9dda AM |
1258 | } |
1259 | while (entry != NULL | |
1260 | && entry->root.hash == hash | |
409d7240 | 1261 | && strcmp (name, entry->s.output_section_statement.name) == 0); |
252b5132 | 1262 | |
409d7240 AM |
1263 | entry |
1264 | = ((struct out_section_hash_entry *) | |
1265 | output_section_statement_newfunc (NULL, | |
1266 | &output_section_statement_table, | |
1267 | name)); | |
750877ba | 1268 | if (entry == NULL) |
384a9dda AM |
1269 | { |
1270 | einfo (_("%P%F: failed creating section `%s': %E\n"), name); | |
1271 | return NULL; | |
1272 | } | |
1273 | entry->root = last_ent->root; | |
1274 | last_ent->root.next = &entry->root; | |
252b5132 | 1275 | } |
384a9dda | 1276 | |
409d7240 AM |
1277 | entry->s.output_section_statement.name = name; |
1278 | entry->s.output_section_statement.constraint = constraint; | |
1279 | return &entry->s.output_section_statement; | |
252b5132 RH |
1280 | } |
1281 | ||
0841712e JJ |
1282 | lang_output_section_statement_type * |
1283 | lang_output_section_statement_lookup (const char *const name) | |
1284 | { | |
1285 | return lang_output_section_statement_lookup_1 (name, 0); | |
1286 | } | |
1287 | ||
afd7a018 AM |
1288 | /* A variant of lang_output_section_find used by place_orphan. |
1289 | Returns the output statement that should precede a new output | |
1290 | statement for SEC. If an exact match is found on certain flags, | |
1291 | sets *EXACT too. */ | |
1292 | ||
1293 | lang_output_section_statement_type * | |
1294 | lang_output_section_find_by_flags (const asection *sec, | |
390fbbf1 AM |
1295 | lang_output_section_statement_type **exact, |
1296 | lang_match_sec_type_func match_type) | |
afd7a018 AM |
1297 | { |
1298 | lang_output_section_statement_type *first, *look, *found; | |
1299 | flagword flags; | |
1300 | ||
1301 | /* We know the first statement on this list is *ABS*. May as well | |
1302 | skip it. */ | |
1303 | first = &lang_output_section_statement.head->output_section_statement; | |
1304 | first = first->next; | |
1305 | ||
1306 | /* First try for an exact match. */ | |
1307 | found = NULL; | |
1308 | for (look = first; look; look = look->next) | |
1309 | { | |
1310 | flags = look->flags; | |
1311 | if (look->bfd_section != NULL) | |
ecca9871 L |
1312 | { |
1313 | flags = look->bfd_section->flags; | |
390fbbf1 AM |
1314 | if (match_type && !match_type (output_bfd, look->bfd_section, |
1315 | sec->owner, sec)) | |
ecca9871 L |
1316 | continue; |
1317 | } | |
afd7a018 AM |
1318 | flags ^= sec->flags; |
1319 | if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD | SEC_READONLY | |
1320 | | SEC_CODE | SEC_SMALL_DATA | SEC_THREAD_LOCAL))) | |
1321 | found = look; | |
1322 | } | |
1323 | if (found != NULL) | |
1324 | { | |
390fbbf1 AM |
1325 | if (exact != NULL) |
1326 | *exact = found; | |
afd7a018 AM |
1327 | return found; |
1328 | } | |
1329 | ||
1330 | if (sec->flags & SEC_CODE) | |
1331 | { | |
1332 | /* Try for a rw code section. */ | |
1333 | for (look = first; look; look = look->next) | |
1334 | { | |
1335 | flags = look->flags; | |
1336 | if (look->bfd_section != NULL) | |
ecca9871 L |
1337 | { |
1338 | flags = look->bfd_section->flags; | |
390fbbf1 AM |
1339 | if (match_type && !match_type (output_bfd, look->bfd_section, |
1340 | sec->owner, sec)) | |
ecca9871 L |
1341 | continue; |
1342 | } | |
afd7a018 AM |
1343 | flags ^= sec->flags; |
1344 | if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD | |
1345 | | SEC_CODE | SEC_SMALL_DATA | SEC_THREAD_LOCAL))) | |
1346 | found = look; | |
1347 | } | |
afd7a018 | 1348 | } |
390fbbf1 | 1349 | else if (sec->flags & (SEC_READONLY | SEC_THREAD_LOCAL)) |
afd7a018 AM |
1350 | { |
1351 | /* .rodata can go after .text, .sdata2 after .rodata. */ | |
1352 | for (look = first; look; look = look->next) | |
1353 | { | |
1354 | flags = look->flags; | |
1355 | if (look->bfd_section != NULL) | |
ecca9871 L |
1356 | { |
1357 | flags = look->bfd_section->flags; | |
390fbbf1 AM |
1358 | if (match_type && !match_type (output_bfd, look->bfd_section, |
1359 | sec->owner, sec)) | |
ecca9871 L |
1360 | continue; |
1361 | } | |
afd7a018 AM |
1362 | flags ^= sec->flags; |
1363 | if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD | |
1364 | | SEC_READONLY)) | |
1365 | && !(look->flags & (SEC_SMALL_DATA | SEC_THREAD_LOCAL))) | |
1366 | found = look; | |
1367 | } | |
afd7a018 | 1368 | } |
390fbbf1 | 1369 | else if (sec->flags & SEC_SMALL_DATA) |
afd7a018 AM |
1370 | { |
1371 | /* .sdata goes after .data, .sbss after .sdata. */ | |
1372 | for (look = first; look; look = look->next) | |
1373 | { | |
1374 | flags = look->flags; | |
1375 | if (look->bfd_section != NULL) | |
ecca9871 L |
1376 | { |
1377 | flags = look->bfd_section->flags; | |
390fbbf1 AM |
1378 | if (match_type && !match_type (output_bfd, look->bfd_section, |
1379 | sec->owner, sec)) | |
ecca9871 L |
1380 | continue; |
1381 | } | |
afd7a018 AM |
1382 | flags ^= sec->flags; |
1383 | if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD | |
1384 | | SEC_THREAD_LOCAL)) | |
1385 | || ((look->flags & SEC_SMALL_DATA) | |
1386 | && !(sec->flags & SEC_HAS_CONTENTS))) | |
1387 | found = look; | |
1388 | } | |
afd7a018 | 1389 | } |
390fbbf1 | 1390 | else if (sec->flags & SEC_HAS_CONTENTS) |
afd7a018 AM |
1391 | { |
1392 | /* .data goes after .rodata. */ | |
1393 | for (look = first; look; look = look->next) | |
1394 | { | |
1395 | flags = look->flags; | |
1396 | if (look->bfd_section != NULL) | |
ecca9871 L |
1397 | { |
1398 | flags = look->bfd_section->flags; | |
390fbbf1 AM |
1399 | if (match_type && !match_type (output_bfd, look->bfd_section, |
1400 | sec->owner, sec)) | |
ecca9871 L |
1401 | continue; |
1402 | } | |
afd7a018 AM |
1403 | flags ^= sec->flags; |
1404 | if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD | |
1405 | | SEC_SMALL_DATA | SEC_THREAD_LOCAL))) | |
1406 | found = look; | |
1407 | } | |
afd7a018 | 1408 | } |
390fbbf1 | 1409 | else |
afd7a018 | 1410 | { |
390fbbf1 AM |
1411 | /* .bss goes last. */ |
1412 | for (look = first; look; look = look->next) | |
ecca9871 | 1413 | { |
390fbbf1 AM |
1414 | flags = look->flags; |
1415 | if (look->bfd_section != NULL) | |
1416 | { | |
1417 | flags = look->bfd_section->flags; | |
1418 | if (match_type && !match_type (output_bfd, look->bfd_section, | |
1419 | sec->owner, sec)) | |
1420 | continue; | |
1421 | } | |
1422 | flags ^= sec->flags; | |
1423 | if (!(flags & SEC_ALLOC)) | |
1424 | found = look; | |
ecca9871 | 1425 | } |
afd7a018 AM |
1426 | } |
1427 | ||
390fbbf1 AM |
1428 | if (found || !match_type) |
1429 | return found; | |
1430 | ||
1431 | return lang_output_section_find_by_flags (sec, NULL, NULL); | |
afd7a018 AM |
1432 | } |
1433 | ||
1434 | /* Find the last output section before given output statement. | |
1435 | Used by place_orphan. */ | |
1436 | ||
1437 | static asection * | |
1438 | output_prev_sec_find (lang_output_section_statement_type *os) | |
1439 | { | |
afd7a018 AM |
1440 | lang_output_section_statement_type *lookup; |
1441 | ||
218868ba | 1442 | for (lookup = os->prev; lookup != NULL; lookup = lookup->prev) |
afd7a018 AM |
1443 | { |
1444 | if (lookup->constraint == -1) | |
1445 | continue; | |
afd7a018 AM |
1446 | |
1447 | if (lookup->bfd_section != NULL && lookup->bfd_section->owner != NULL) | |
218868ba | 1448 | return lookup->bfd_section; |
afd7a018 AM |
1449 | } |
1450 | ||
1451 | return NULL; | |
1452 | } | |
1453 | ||
1454 | lang_output_section_statement_type * | |
7b986e99 | 1455 | lang_insert_orphan (asection *s, |
afd7a018 AM |
1456 | const char *secname, |
1457 | lang_output_section_statement_type *after, | |
1458 | struct orphan_save *place, | |
1459 | etree_type *address, | |
1460 | lang_statement_list_type *add_child) | |
1461 | { | |
1462 | lang_statement_list_type *old; | |
1463 | lang_statement_list_type add; | |
1464 | const char *ps; | |
afd7a018 AM |
1465 | lang_output_section_statement_type *os; |
1466 | lang_output_section_statement_type **os_tail; | |
1467 | ||
1468 | /* Start building a list of statements for this section. | |
1469 | First save the current statement pointer. */ | |
1470 | old = stat_ptr; | |
1471 | ||
1472 | /* If we have found an appropriate place for the output section | |
1473 | statements for this orphan, add them to our own private list, | |
1474 | inserting them later into the global statement list. */ | |
1475 | if (after != NULL) | |
1476 | { | |
1477 | stat_ptr = &add; | |
1478 | lang_list_init (stat_ptr); | |
1479 | } | |
1480 | ||
1481 | ps = NULL; | |
1482 | if (config.build_constructors) | |
1483 | { | |
1484 | /* If the name of the section is representable in C, then create | |
1485 | symbols to mark the start and the end of the section. */ | |
1486 | for (ps = secname; *ps != '\0'; ps++) | |
1487 | if (! ISALNUM ((unsigned char) *ps) && *ps != '_') | |
1488 | break; | |
1489 | if (*ps == '\0') | |
1490 | { | |
1491 | char *symname; | |
1492 | etree_type *e_align; | |
1493 | ||
1494 | symname = (char *) xmalloc (ps - secname + sizeof "__start_" + 1); | |
1495 | symname[0] = bfd_get_symbol_leading_char (output_bfd); | |
1496 | sprintf (symname + (symname[0] != 0), "__start_%s", secname); | |
1497 | e_align = exp_unop (ALIGN_K, | |
1498 | exp_intop ((bfd_vma) 1 << s->alignment_power)); | |
1499 | lang_add_assignment (exp_assop ('=', ".", e_align)); | |
34711ca3 AM |
1500 | lang_add_assignment (exp_provide (symname, |
1501 | exp_nameop (NAME, "."), | |
1502 | FALSE)); | |
afd7a018 AM |
1503 | } |
1504 | } | |
1505 | ||
1506 | if (link_info.relocatable || (s->flags & (SEC_LOAD | SEC_ALLOC)) == 0) | |
1507 | address = exp_intop (0); | |
1508 | ||
afd7a018 AM |
1509 | os_tail = ((lang_output_section_statement_type **) |
1510 | lang_output_section_statement.tail); | |
1511 | os = lang_enter_output_section_statement (secname, address, 0, NULL, NULL, | |
66e28d60 | 1512 | NULL, 0); |
afd7a018 AM |
1513 | |
1514 | if (add_child == NULL) | |
1515 | add_child = &os->children; | |
7b986e99 | 1516 | lang_add_section (add_child, s, os); |
afd7a018 AM |
1517 | |
1518 | lang_leave_output_section_statement (0, "*default*", NULL, NULL); | |
1519 | ||
1520 | if (config.build_constructors && *ps == '\0') | |
1521 | { | |
1522 | char *symname; | |
1523 | ||
1524 | /* lang_leave_ouput_section_statement resets stat_ptr. | |
1525 | Put stat_ptr back where we want it. */ | |
1526 | if (after != NULL) | |
1527 | stat_ptr = &add; | |
1528 | ||
1529 | symname = (char *) xmalloc (ps - secname + sizeof "__stop_" + 1); | |
1530 | symname[0] = bfd_get_symbol_leading_char (output_bfd); | |
1531 | sprintf (symname + (symname[0] != 0), "__stop_%s", secname); | |
34711ca3 AM |
1532 | lang_add_assignment (exp_provide (symname, |
1533 | exp_nameop (NAME, "."), | |
1534 | FALSE)); | |
afd7a018 AM |
1535 | } |
1536 | ||
1537 | /* Restore the global list pointer. */ | |
1538 | if (after != NULL) | |
1539 | stat_ptr = old; | |
1540 | ||
1541 | if (after != NULL && os->bfd_section != NULL) | |
1542 | { | |
5daa8fe7 | 1543 | asection *snew, *as; |
afd7a018 AM |
1544 | |
1545 | snew = os->bfd_section; | |
1546 | ||
1547 | /* Shuffle the bfd section list to make the output file look | |
1548 | neater. This is really only cosmetic. */ | |
1549 | if (place->section == NULL | |
1550 | && after != (&lang_output_section_statement.head | |
1551 | ->output_section_statement)) | |
1552 | { | |
1553 | asection *bfd_section = after->bfd_section; | |
1554 | ||
1555 | /* If the output statement hasn't been used to place any input | |
1556 | sections (and thus doesn't have an output bfd_section), | |
1557 | look for the closest prior output statement having an | |
1558 | output section. */ | |
1559 | if (bfd_section == NULL) | |
1560 | bfd_section = output_prev_sec_find (after); | |
1561 | ||
1562 | if (bfd_section != NULL && bfd_section != snew) | |
1563 | place->section = &bfd_section->next; | |
1564 | } | |
1565 | ||
1566 | if (place->section == NULL) | |
1567 | place->section = &output_bfd->sections; | |
1568 | ||
5daa8fe7 | 1569 | as = *place->section; |
5e542ba7 MS |
1570 | |
1571 | if (!as) | |
329c1c86 AM |
1572 | { |
1573 | /* Put the section at the end of the list. */ | |
5e542ba7 MS |
1574 | |
1575 | /* Unlink the section. */ | |
1576 | bfd_section_list_remove (output_bfd, snew); | |
1577 | ||
1578 | /* Now tack it back on in the right place. */ | |
1579 | bfd_section_list_append (output_bfd, snew); | |
329c1c86 | 1580 | } |
5e542ba7 | 1581 | else if (as != snew && as->prev != snew) |
5daa8fe7 L |
1582 | { |
1583 | /* Unlink the section. */ | |
1584 | bfd_section_list_remove (output_bfd, snew); | |
afd7a018 | 1585 | |
5daa8fe7 L |
1586 | /* Now tack it back on in the right place. */ |
1587 | bfd_section_list_insert_before (output_bfd, as, snew); | |
1588 | } | |
afd7a018 AM |
1589 | |
1590 | /* Save the end of this list. Further ophans of this type will | |
1591 | follow the one we've just added. */ | |
1592 | place->section = &snew->next; | |
1593 | ||
1594 | /* The following is non-cosmetic. We try to put the output | |
1595 | statements in some sort of reasonable order here, because they | |
1596 | determine the final load addresses of the orphan sections. | |
1597 | In addition, placing output statements in the wrong order may | |
1598 | require extra segments. For instance, given a typical | |
1599 | situation of all read-only sections placed in one segment and | |
1600 | following that a segment containing all the read-write | |
1601 | sections, we wouldn't want to place an orphan read/write | |
1602 | section before or amongst the read-only ones. */ | |
1603 | if (add.head != NULL) | |
1604 | { | |
1605 | lang_output_section_statement_type *newly_added_os; | |
1606 | ||
1607 | if (place->stmt == NULL) | |
1608 | { | |
1609 | lang_statement_union_type **where; | |
1610 | lang_statement_union_type **assign = NULL; | |
be529132 | 1611 | bfd_boolean ignore_first; |
afd7a018 AM |
1612 | |
1613 | /* Look for a suitable place for the new statement list. | |
1614 | The idea is to skip over anything that might be inside | |
1615 | a SECTIONS {} statement in a script, before we find | |
1616 | another output_section_statement. Assignments to "dot" | |
1617 | before an output section statement are assumed to | |
be529132 AM |
1618 | belong to it. An exception to this rule is made for |
1619 | the first assignment to dot, otherwise we might put an | |
1620 | orphan before . = . + SIZEOF_HEADERS or similar | |
1621 | assignments that set the initial address. */ | |
1622 | ||
1623 | ignore_first = after == (&lang_output_section_statement.head | |
1624 | ->output_section_statement); | |
afd7a018 AM |
1625 | for (where = &after->header.next; |
1626 | *where != NULL; | |
1627 | where = &(*where)->header.next) | |
1628 | { | |
1629 | switch ((*where)->header.type) | |
1630 | { | |
1631 | case lang_assignment_statement_enum: | |
1632 | if (assign == NULL) | |
1633 | { | |
1634 | lang_assignment_statement_type *ass; | |
1635 | ass = &(*where)->assignment_statement; | |
1636 | if (ass->exp->type.node_class != etree_assert | |
1637 | && ass->exp->assign.dst[0] == '.' | |
be529132 AM |
1638 | && ass->exp->assign.dst[1] == 0 |
1639 | && !ignore_first) | |
afd7a018 AM |
1640 | assign = where; |
1641 | } | |
be529132 | 1642 | ignore_first = FALSE; |
afd7a018 AM |
1643 | continue; |
1644 | case lang_wild_statement_enum: | |
1645 | case lang_input_section_enum: | |
1646 | case lang_object_symbols_statement_enum: | |
1647 | case lang_fill_statement_enum: | |
1648 | case lang_data_statement_enum: | |
1649 | case lang_reloc_statement_enum: | |
1650 | case lang_padding_statement_enum: | |
1651 | case lang_constructors_statement_enum: | |
1652 | assign = NULL; | |
1653 | continue; | |
1654 | case lang_output_section_statement_enum: | |
1655 | if (assign != NULL) | |
1656 | where = assign; | |
48f2ff54 | 1657 | break; |
afd7a018 AM |
1658 | case lang_input_statement_enum: |
1659 | case lang_address_statement_enum: | |
1660 | case lang_target_statement_enum: | |
1661 | case lang_output_statement_enum: | |
1662 | case lang_group_statement_enum: | |
1663 | case lang_afile_asection_pair_statement_enum: | |
48f2ff54 | 1664 | continue; |
afd7a018 AM |
1665 | } |
1666 | break; | |
1667 | } | |
1668 | ||
1669 | *add.tail = *where; | |
1670 | *where = add.head; | |
1671 | ||
1672 | place->os_tail = &after->next; | |
1673 | } | |
1674 | else | |
1675 | { | |
1676 | /* Put it after the last orphan statement we added. */ | |
1677 | *add.tail = *place->stmt; | |
1678 | *place->stmt = add.head; | |
1679 | } | |
1680 | ||
1681 | /* Fix the global list pointer if we happened to tack our | |
1682 | new list at the tail. */ | |
1683 | if (*old->tail == add.head) | |
1684 | old->tail = add.tail; | |
1685 | ||
1686 | /* Save the end of this list. */ | |
1687 | place->stmt = add.tail; | |
1688 | ||
1689 | /* Do the same for the list of output section statements. */ | |
1690 | newly_added_os = *os_tail; | |
1691 | *os_tail = NULL; | |
218868ba AM |
1692 | newly_added_os->prev = (lang_output_section_statement_type *) |
1693 | ((char *) place->os_tail | |
1694 | - offsetof (lang_output_section_statement_type, next)); | |
afd7a018 | 1695 | newly_added_os->next = *place->os_tail; |
218868ba AM |
1696 | if (newly_added_os->next != NULL) |
1697 | newly_added_os->next->prev = newly_added_os; | |
afd7a018 AM |
1698 | *place->os_tail = newly_added_os; |
1699 | place->os_tail = &newly_added_os->next; | |
1700 | ||
1701 | /* Fixing the global list pointer here is a little different. | |
1702 | We added to the list in lang_enter_output_section_statement, | |
1703 | trimmed off the new output_section_statment above when | |
1704 | assigning *os_tail = NULL, but possibly added it back in | |
1705 | the same place when assigning *place->os_tail. */ | |
1706 | if (*os_tail == NULL) | |
1707 | lang_output_section_statement.tail | |
1708 | = (lang_statement_union_type **) os_tail; | |
1709 | } | |
1710 | } | |
1711 | return os; | |
1712 | } | |
1713 | ||
252b5132 | 1714 | static void |
1579bae1 | 1715 | lang_map_flags (flagword flag) |
252b5132 RH |
1716 | { |
1717 | if (flag & SEC_ALLOC) | |
1718 | minfo ("a"); | |
1719 | ||
1720 | if (flag & SEC_CODE) | |
1721 | minfo ("x"); | |
1722 | ||
1723 | if (flag & SEC_READONLY) | |
1724 | minfo ("r"); | |
1725 | ||
1726 | if (flag & SEC_DATA) | |
1727 | minfo ("w"); | |
1728 | ||
1729 | if (flag & SEC_LOAD) | |
1730 | minfo ("l"); | |
1731 | } | |
1732 | ||
1733 | void | |
1579bae1 | 1734 | lang_map (void) |
252b5132 RH |
1735 | { |
1736 | lang_memory_region_type *m; | |
4d4920ec | 1737 | bfd_boolean dis_header_printed = FALSE; |
35835446 | 1738 | bfd *p; |
252b5132 | 1739 | |
4d4920ec EB |
1740 | LANG_FOR_EACH_INPUT_STATEMENT (file) |
1741 | { | |
1742 | asection *s; | |
1743 | ||
1744 | if ((file->the_bfd->flags & (BFD_LINKER_CREATED | DYNAMIC)) != 0 | |
1745 | || file->just_syms_flag) | |
1746 | continue; | |
1747 | ||
1748 | for (s = file->the_bfd->sections; s != NULL; s = s->next) | |
a14a5de3 AM |
1749 | if ((s->output_section == NULL |
1750 | || s->output_section->owner != output_bfd) | |
1751 | && (s->flags & (SEC_LINKER_CREATED | SEC_KEEP)) == 0) | |
4d4920ec EB |
1752 | { |
1753 | if (! dis_header_printed) | |
1754 | { | |
1755 | fprintf (config.map_file, _("\nDiscarded input sections\n\n")); | |
1756 | dis_header_printed = TRUE; | |
1757 | } | |
1758 | ||
1759 | print_input_section (s); | |
1760 | } | |
1761 | } | |
1762 | ||
252b5132 RH |
1763 | minfo (_("\nMemory Configuration\n\n")); |
1764 | fprintf (config.map_file, "%-16s %-18s %-18s %s\n", | |
1765 | _("Name"), _("Origin"), _("Length"), _("Attributes")); | |
1766 | ||
1579bae1 | 1767 | for (m = lang_memory_region_list; m != NULL; m = m->next) |
252b5132 RH |
1768 | { |
1769 | char buf[100]; | |
1770 | int len; | |
1771 | ||
1772 | fprintf (config.map_file, "%-16s ", m->name); | |
1773 | ||
1774 | sprintf_vma (buf, m->origin); | |
1775 | minfo ("0x%s ", buf); | |
1776 | len = strlen (buf); | |
1777 | while (len < 16) | |
1778 | { | |
1779 | print_space (); | |
1780 | ++len; | |
1781 | } | |
1782 | ||
1783 | minfo ("0x%V", m->length); | |
1784 | if (m->flags || m->not_flags) | |
1785 | { | |
1786 | #ifndef BFD64 | |
1787 | minfo (" "); | |
1788 | #endif | |
1789 | if (m->flags) | |
1790 | { | |
1791 | print_space (); | |
1792 | lang_map_flags (m->flags); | |
1793 | } | |
1794 | ||
1795 | if (m->not_flags) | |
1796 | { | |
1797 | minfo (" !"); | |
1798 | lang_map_flags (m->not_flags); | |
1799 | } | |
1800 | } | |
1801 | ||
1802 | print_nl (); | |
1803 | } | |
1804 | ||
1805 | fprintf (config.map_file, _("\nLinker script and memory map\n\n")); | |
1806 | ||
c0f00686 | 1807 | if (! link_info.reduce_memory_overheads) |
35835446 JR |
1808 | { |
1809 | obstack_begin (&map_obstack, 1000); | |
1810 | for (p = link_info.input_bfds; p != (bfd *) NULL; p = p->link_next) | |
1811 | bfd_map_over_sections (p, init_map_userdata, 0); | |
1812 | bfd_link_hash_traverse (link_info.hash, sort_def_symbol, 0); | |
1813 | } | |
252b5132 RH |
1814 | print_statements (); |
1815 | } | |
1816 | ||
35835446 JR |
1817 | static void |
1818 | init_map_userdata (abfd, sec, data) | |
1819 | bfd *abfd ATTRIBUTE_UNUSED; | |
1820 | asection *sec; | |
1821 | void *data ATTRIBUTE_UNUSED; | |
1822 | { | |
1823 | fat_section_userdata_type *new_data | |
1824 | = ((fat_section_userdata_type *) (stat_alloc | |
1825 | (sizeof (fat_section_userdata_type)))); | |
1826 | ||
1827 | ASSERT (get_userdata (sec) == NULL); | |
1828 | get_userdata (sec) = new_data; | |
1829 | new_data->map_symbol_def_tail = &new_data->map_symbol_def_head; | |
1830 | } | |
1831 | ||
1832 | static bfd_boolean | |
1833 | sort_def_symbol (hash_entry, info) | |
1834 | struct bfd_link_hash_entry *hash_entry; | |
1835 | void *info ATTRIBUTE_UNUSED; | |
1836 | { | |
1837 | if (hash_entry->type == bfd_link_hash_defined | |
1838 | || hash_entry->type == bfd_link_hash_defweak) | |
1839 | { | |
1840 | struct fat_user_section_struct *ud; | |
1841 | struct map_symbol_def *def; | |
1842 | ||
1843 | ud = get_userdata (hash_entry->u.def.section); | |
1844 | if (! ud) | |
1845 | { | |
1846 | /* ??? What do we have to do to initialize this beforehand? */ | |
1847 | /* The first time we get here is bfd_abs_section... */ | |
1848 | init_map_userdata (0, hash_entry->u.def.section, 0); | |
1849 | ud = get_userdata (hash_entry->u.def.section); | |
1850 | } | |
1851 | else if (!ud->map_symbol_def_tail) | |
1852 | ud->map_symbol_def_tail = &ud->map_symbol_def_head; | |
afd7a018 | 1853 | |
6feb9908 | 1854 | def = obstack_alloc (&map_obstack, sizeof *def); |
35835446 | 1855 | def->entry = hash_entry; |
76d7af2d | 1856 | *(ud->map_symbol_def_tail) = def; |
35835446 JR |
1857 | ud->map_symbol_def_tail = &def->next; |
1858 | } | |
1859 | return TRUE; | |
1860 | } | |
1861 | ||
252b5132 RH |
1862 | /* Initialize an output section. */ |
1863 | ||
1864 | static void | |
12d814e1 L |
1865 | init_os (lang_output_section_statement_type *s, asection *isec, |
1866 | flagword flags) | |
252b5132 | 1867 | { |
252b5132 RH |
1868 | if (s->bfd_section != NULL) |
1869 | return; | |
1870 | ||
1871 | if (strcmp (s->name, DISCARD_SECTION_NAME) == 0) | |
6f9efd97 | 1872 | einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME); |
252b5132 | 1873 | |
252b5132 | 1874 | s->bfd_section = bfd_get_section_by_name (output_bfd, s->name); |
1579bae1 | 1875 | if (s->bfd_section == NULL) |
12d814e1 L |
1876 | s->bfd_section = bfd_make_section_with_flags (output_bfd, s->name, |
1877 | flags); | |
1579bae1 | 1878 | if (s->bfd_section == NULL) |
252b5132 RH |
1879 | { |
1880 | einfo (_("%P%F: output format %s cannot represent section called %s\n"), | |
1881 | output_bfd->xvec->name, s->name); | |
1882 | } | |
1883 | s->bfd_section->output_section = s->bfd_section; | |
252b5132 | 1884 | s->bfd_section->output_offset = 0; |
e0f6802f | 1885 | |
c0f00686 | 1886 | if (!link_info.reduce_memory_overheads) |
72223188 JJ |
1887 | { |
1888 | fat_section_userdata_type *new | |
1889 | = stat_alloc (sizeof (fat_section_userdata_type)); | |
1890 | memset (new, 0, sizeof (fat_section_userdata_type)); | |
1891 | get_userdata (s->bfd_section) = new; | |
1892 | } | |
1893 | ||
252b5132 RH |
1894 | /* If there is a base address, make sure that any sections it might |
1895 | mention are initialized. */ | |
1896 | if (s->addr_tree != NULL) | |
1897 | exp_init_os (s->addr_tree); | |
18794b0c AM |
1898 | |
1899 | if (s->load_base != NULL) | |
1900 | exp_init_os (s->load_base); | |
ccd2ec6a | 1901 | |
7270c5ed AM |
1902 | /* If supplied an alignment, set it. */ |
1903 | if (s->section_alignment != -1) | |
1904 | s->bfd_section->alignment_power = s->section_alignment; | |
1905 | ||
ccd2ec6a L |
1906 | if (isec) |
1907 | bfd_init_private_section_data (isec->owner, isec, | |
1908 | output_bfd, s->bfd_section, | |
1909 | &link_info); | |
252b5132 RH |
1910 | } |
1911 | ||
1912 | /* Make sure that all output sections mentioned in an expression are | |
1913 | initialized. */ | |
1914 | ||
1915 | static void | |
1579bae1 | 1916 | exp_init_os (etree_type *exp) |
252b5132 RH |
1917 | { |
1918 | switch (exp->type.node_class) | |
1919 | { | |
1920 | case etree_assign: | |
9f4fb502 | 1921 | case etree_provide: |
252b5132 RH |
1922 | exp_init_os (exp->assign.src); |
1923 | break; | |
1924 | ||
1925 | case etree_binary: | |
1926 | exp_init_os (exp->binary.lhs); | |
1927 | exp_init_os (exp->binary.rhs); | |
1928 | break; | |
1929 | ||
1930 | case etree_trinary: | |
1931 | exp_init_os (exp->trinary.cond); | |
1932 | exp_init_os (exp->trinary.lhs); | |
1933 | exp_init_os (exp->trinary.rhs); | |
1934 | break; | |
1935 | ||
b6ca8815 NS |
1936 | case etree_assert: |
1937 | exp_init_os (exp->assert_s.child); | |
1938 | break; | |
afd7a018 | 1939 | |
252b5132 RH |
1940 | case etree_unary: |
1941 | exp_init_os (exp->unary.child); | |
1942 | break; | |
1943 | ||
1944 | case etree_name: | |
1945 | switch (exp->type.node_code) | |
1946 | { | |
1947 | case ADDR: | |
1948 | case LOADADDR: | |
1949 | case SIZEOF: | |
1950 | { | |
1951 | lang_output_section_statement_type *os; | |
1952 | ||
1953 | os = lang_output_section_find (exp->name.name); | |
1954 | if (os != NULL && os->bfd_section == NULL) | |
12d814e1 | 1955 | init_os (os, NULL, 0); |
252b5132 RH |
1956 | } |
1957 | } | |
1958 | break; | |
1959 | ||
1960 | default: | |
1961 | break; | |
1962 | } | |
1963 | } | |
9503fd87 | 1964 | \f |
252b5132 | 1965 | static void |
1579bae1 | 1966 | section_already_linked (bfd *abfd, asection *sec, void *data) |
252b5132 | 1967 | { |
1579bae1 | 1968 | lang_input_statement_type *entry = data; |
252b5132 RH |
1969 | |
1970 | /* If we are only reading symbols from this object, then we want to | |
1971 | discard all sections. */ | |
1972 | if (entry->just_syms_flag) | |
1973 | { | |
1449d79b | 1974 | bfd_link_just_syms (abfd, sec, &link_info); |
252b5132 RH |
1975 | return; |
1976 | } | |
1977 | ||
ace66bb2 | 1978 | if (!(abfd->flags & DYNAMIC)) |
c0f00686 | 1979 | bfd_section_already_linked (abfd, sec, &link_info); |
252b5132 RH |
1980 | } |
1981 | \f | |
1982 | /* The wild routines. | |
1983 | ||
1984 | These expand statements like *(.text) and foo.o to a list of | |
1985 | explicit actions, like foo.o(.text), bar.o(.text) and | |
1986 | foo.o(.text, .data). */ | |
1987 | ||
252b5132 RH |
1988 | /* Add SECTION to the output section OUTPUT. Do this by creating a |
1989 | lang_input_section statement which is placed at PTR. FILE is the | |
1990 | input file which holds SECTION. */ | |
1991 | ||
1992 | void | |
1579bae1 AM |
1993 | lang_add_section (lang_statement_list_type *ptr, |
1994 | asection *section, | |
7b986e99 | 1995 | lang_output_section_statement_type *output) |
252b5132 | 1996 | { |
164e712d | 1997 | flagword flags = section->flags; |
b34976b6 | 1998 | bfd_boolean discard; |
252b5132 | 1999 | |
e49f5022 | 2000 | /* Discard sections marked with SEC_EXCLUDE. */ |
b3096250 | 2001 | discard = (flags & SEC_EXCLUDE) != 0; |
252b5132 RH |
2002 | |
2003 | /* Discard input sections which are assigned to a section named | |
2004 | DISCARD_SECTION_NAME. */ | |
2005 | if (strcmp (output->name, DISCARD_SECTION_NAME) == 0) | |
b34976b6 | 2006 | discard = TRUE; |
252b5132 RH |
2007 | |
2008 | /* Discard debugging sections if we are stripping debugging | |
2009 | information. */ | |
2010 | if ((link_info.strip == strip_debugger || link_info.strip == strip_all) | |
2011 | && (flags & SEC_DEBUGGING) != 0) | |
b34976b6 | 2012 | discard = TRUE; |
252b5132 RH |
2013 | |
2014 | if (discard) | |
2015 | { | |
2016 | if (section->output_section == NULL) | |
2017 | { | |
2018 | /* This prevents future calls from assigning this section. */ | |
2019 | section->output_section = bfd_abs_section_ptr; | |
2020 | } | |
2021 | return; | |
2022 | } | |
2023 | ||
2024 | if (section->output_section == NULL) | |
2025 | { | |
b34976b6 | 2026 | bfd_boolean first; |
252b5132 RH |
2027 | lang_input_section_type *new; |
2028 | flagword flags; | |
2029 | ||
12d814e1 L |
2030 | flags = section->flags; |
2031 | ||
2032 | /* We don't copy the SEC_NEVER_LOAD flag from an input section | |
2033 | to an output section, because we want to be able to include a | |
2034 | SEC_NEVER_LOAD section in the middle of an otherwise loaded | |
2035 | section (I don't know why we want to do this, but we do). | |
2036 | build_link_order in ldwrite.c handles this case by turning | |
2037 | the embedded SEC_NEVER_LOAD section into a fill. */ | |
2038 | ||
2039 | flags &= ~ SEC_NEVER_LOAD; | |
2040 | ||
2041 | switch (output->sectype) | |
2042 | { | |
2043 | case normal_section: | |
152d792f | 2044 | case overlay_section: |
12d814e1 L |
2045 | break; |
2046 | case noalloc_section: | |
2047 | flags &= ~SEC_ALLOC; | |
2048 | break; | |
2049 | case noload_section: | |
2050 | flags &= ~SEC_LOAD; | |
2051 | flags |= SEC_NEVER_LOAD; | |
2052 | break; | |
2053 | } | |
2054 | ||
252b5132 | 2055 | if (output->bfd_section == NULL) |
12d814e1 | 2056 | init_os (output, section, flags); |
d1778b88 AM |
2057 | |
2058 | first = ! output->bfd_section->linker_has_input; | |
2059 | output->bfd_section->linker_has_input = 1; | |
252b5132 | 2060 | |
8423293d AM |
2061 | if (!link_info.relocatable |
2062 | && !stripped_excluded_sections) | |
2063 | { | |
2064 | asection *s = output->bfd_section->map_tail.s; | |
2065 | output->bfd_section->map_tail.s = section; | |
2066 | section->map_head.s = NULL; | |
2067 | section->map_tail.s = s; | |
2068 | if (s != NULL) | |
2069 | s->map_head.s = section; | |
2070 | else | |
2071 | output->bfd_section->map_head.s = section; | |
2072 | } | |
2073 | ||
08da4cac | 2074 | /* Add a section reference to the list. */ |
252b5132 RH |
2075 | new = new_stat (lang_input_section, ptr); |
2076 | ||
2077 | new->section = section; | |
252b5132 RH |
2078 | section->output_section = output->bfd_section; |
2079 | ||
252b5132 RH |
2080 | /* If final link, don't copy the SEC_LINK_ONCE flags, they've |
2081 | already been processed. One reason to do this is that on pe | |
2082 | format targets, .text$foo sections go into .text and it's odd | |
2083 | to see .text with SEC_LINK_ONCE set. */ | |
2084 | ||
1049f94e | 2085 | if (! link_info.relocatable) |
252b5132 RH |
2086 | flags &= ~ (SEC_LINK_ONCE | SEC_LINK_DUPLICATES); |
2087 | ||
2088 | /* If this is not the first input section, and the SEC_READONLY | |
afd7a018 AM |
2089 | flag is not currently set, then don't set it just because the |
2090 | input section has it set. */ | |
252b5132 | 2091 | |
afd7a018 | 2092 | if (! first && (output->bfd_section->flags & SEC_READONLY) == 0) |
252b5132 RH |
2093 | flags &= ~ SEC_READONLY; |
2094 | ||
f5fa8ca2 JJ |
2095 | /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */ |
2096 | if (! first | |
afd7a018 | 2097 | && ((output->bfd_section->flags & (SEC_MERGE | SEC_STRINGS)) |
f5fa8ca2 JJ |
2098 | != (flags & (SEC_MERGE | SEC_STRINGS)) |
2099 | || ((flags & SEC_MERGE) | |
afd7a018 | 2100 | && output->bfd_section->entsize != section->entsize))) |
f5fa8ca2 | 2101 | { |
afd7a018 | 2102 | output->bfd_section->flags &= ~ (SEC_MERGE | SEC_STRINGS); |
f5fa8ca2 JJ |
2103 | flags &= ~ (SEC_MERGE | SEC_STRINGS); |
2104 | } | |
2105 | ||
afd7a018 | 2106 | output->bfd_section->flags |= flags; |
252b5132 | 2107 | |
f5fa8ca2 | 2108 | if (flags & SEC_MERGE) |
afd7a018 | 2109 | output->bfd_section->entsize = section->entsize; |
f5fa8ca2 | 2110 | |
252b5132 | 2111 | /* If SEC_READONLY is not set in the input section, then clear |
afd7a018 | 2112 | it from the output section. */ |
252b5132 | 2113 | if ((section->flags & SEC_READONLY) == 0) |
afd7a018 | 2114 | output->bfd_section->flags &= ~SEC_READONLY; |
252b5132 | 2115 | |
667f5177 ILT |
2116 | /* Copy over SEC_SMALL_DATA. */ |
2117 | if (section->flags & SEC_SMALL_DATA) | |
afd7a018 | 2118 | output->bfd_section->flags |= SEC_SMALL_DATA; |
9e41f973 | 2119 | |
252b5132 RH |
2120 | if (section->alignment_power > output->bfd_section->alignment_power) |
2121 | output->bfd_section->alignment_power = section->alignment_power; | |
2122 | ||
ebe372c1 L |
2123 | if (bfd_get_arch (section->owner) == bfd_arch_tic54x |
2124 | && (section->flags & SEC_TIC54X_BLOCK) != 0) | |
08da4cac | 2125 | { |
ebe372c1 | 2126 | output->bfd_section->flags |= SEC_TIC54X_BLOCK; |
08da4cac KH |
2127 | /* FIXME: This value should really be obtained from the bfd... */ |
2128 | output->block_value = 128; | |
2129 | } | |
252b5132 RH |
2130 | } |
2131 | } | |
2132 | ||
2133 | /* Handle wildcard sorting. This returns the lang_input_section which | |
2134 | should follow the one we are going to create for SECTION and FILE, | |
2135 | based on the sorting requirements of WILD. It returns NULL if the | |
2136 | new section should just go at the end of the current list. */ | |
2137 | ||
2138 | static lang_statement_union_type * | |
1579bae1 AM |
2139 | wild_sort (lang_wild_statement_type *wild, |
2140 | struct wildcard_list *sec, | |
2141 | lang_input_statement_type *file, | |
2142 | asection *section) | |
252b5132 RH |
2143 | { |
2144 | const char *section_name; | |
2145 | lang_statement_union_type *l; | |
2146 | ||
bcaa7b3e L |
2147 | if (!wild->filenames_sorted |
2148 | && (sec == NULL || sec->spec.sorted == none)) | |
252b5132 RH |
2149 | return NULL; |
2150 | ||
2151 | section_name = bfd_get_section_name (file->the_bfd, section); | |
bba1a0c0 | 2152 | for (l = wild->children.head; l != NULL; l = l->header.next) |
252b5132 RH |
2153 | { |
2154 | lang_input_section_type *ls; | |
2155 | ||
2156 | if (l->header.type != lang_input_section_enum) | |
2157 | continue; | |
2158 | ls = &l->input_section; | |
2159 | ||
2160 | /* Sorting by filename takes precedence over sorting by section | |
afd7a018 | 2161 | name. */ |
252b5132 RH |
2162 | |
2163 | if (wild->filenames_sorted) | |
2164 | { | |
2165 | const char *fn, *ln; | |
b34976b6 | 2166 | bfd_boolean fa, la; |
252b5132 RH |
2167 | int i; |
2168 | ||
2169 | /* The PE support for the .idata section as generated by | |
afd7a018 AM |
2170 | dlltool assumes that files will be sorted by the name of |
2171 | the archive and then the name of the file within the | |
2172 | archive. */ | |
252b5132 RH |
2173 | |
2174 | if (file->the_bfd != NULL | |
2175 | && bfd_my_archive (file->the_bfd) != NULL) | |
2176 | { | |
2177 | fn = bfd_get_filename (bfd_my_archive (file->the_bfd)); | |
b34976b6 | 2178 | fa = TRUE; |
252b5132 RH |
2179 | } |
2180 | else | |
2181 | { | |
2182 | fn = file->filename; | |
b34976b6 | 2183 | fa = FALSE; |
252b5132 RH |
2184 | } |
2185 | ||
7b986e99 | 2186 | if (bfd_my_archive (ls->section->owner) != NULL) |
252b5132 | 2187 | { |
7b986e99 | 2188 | ln = bfd_get_filename (bfd_my_archive (ls->section->owner)); |
b34976b6 | 2189 | la = TRUE; |
252b5132 RH |
2190 | } |
2191 | else | |
2192 | { | |
7b986e99 | 2193 | ln = ls->section->owner->filename; |
b34976b6 | 2194 | la = FALSE; |
252b5132 RH |
2195 | } |
2196 | ||
2197 | i = strcmp (fn, ln); | |
2198 | if (i > 0) | |
2199 | continue; | |
2200 | else if (i < 0) | |
2201 | break; | |
2202 | ||
2203 | if (fa || la) | |
2204 | { | |
2205 | if (fa) | |
2206 | fn = file->filename; | |
2207 | if (la) | |
7b986e99 | 2208 | ln = ls->section->owner->filename; |
252b5132 RH |
2209 | |
2210 | i = strcmp (fn, ln); | |
2211 | if (i > 0) | |
2212 | continue; | |
2213 | else if (i < 0) | |
2214 | break; | |
2215 | } | |
2216 | } | |
2217 | ||
2218 | /* Here either the files are not sorted by name, or we are | |
afd7a018 | 2219 | looking at the sections for this file. */ |
252b5132 | 2220 | |
bcaa7b3e | 2221 | if (sec != NULL && sec->spec.sorted != none) |
32124d5b AM |
2222 | if (compare_section (sec->spec.sorted, section, ls->section) < 0) |
2223 | break; | |
252b5132 RH |
2224 | } |
2225 | ||
2226 | return l; | |
2227 | } | |
2228 | ||
2229 | /* Expand a wild statement for a particular FILE. SECTION may be | |
2230 | NULL, in which case it is a wild card. */ | |
2231 | ||
2232 | static void | |
1579bae1 AM |
2233 | output_section_callback (lang_wild_statement_type *ptr, |
2234 | struct wildcard_list *sec, | |
2235 | asection *section, | |
2236 | lang_input_statement_type *file, | |
2237 | void *output) | |
4dec4d4e RH |
2238 | { |
2239 | lang_statement_union_type *before; | |
5f992e62 | 2240 | |
b6bf44ba | 2241 | /* Exclude sections that match UNIQUE_SECTION_LIST. */ |
d0d6a25b | 2242 | if (unique_section_p (section)) |
b6bf44ba AM |
2243 | return; |
2244 | ||
b6bf44ba | 2245 | before = wild_sort (ptr, sec, file, section); |
5f992e62 | 2246 | |
4dec4d4e RH |
2247 | /* Here BEFORE points to the lang_input_section which |
2248 | should follow the one we are about to add. If BEFORE | |
2249 | is NULL, then the section should just go at the end | |
2250 | of the current list. */ | |
5f992e62 | 2251 | |
4dec4d4e | 2252 | if (before == NULL) |
39dcfe18 | 2253 | lang_add_section (&ptr->children, section, |
7b986e99 | 2254 | (lang_output_section_statement_type *) output); |
4dec4d4e | 2255 | else |
252b5132 | 2256 | { |
4dec4d4e RH |
2257 | lang_statement_list_type list; |
2258 | lang_statement_union_type **pp; | |
5f992e62 | 2259 | |
4dec4d4e | 2260 | lang_list_init (&list); |
39dcfe18 | 2261 | lang_add_section (&list, section, |
7b986e99 | 2262 | (lang_output_section_statement_type *) output); |
5f992e62 | 2263 | |
4dec4d4e RH |
2264 | /* If we are discarding the section, LIST.HEAD will |
2265 | be NULL. */ | |
2266 | if (list.head != NULL) | |
252b5132 | 2267 | { |
bba1a0c0 | 2268 | ASSERT (list.head->header.next == NULL); |
5f992e62 | 2269 | |
4dec4d4e RH |
2270 | for (pp = &ptr->children.head; |
2271 | *pp != before; | |
bba1a0c0 | 2272 | pp = &(*pp)->header.next) |
4dec4d4e | 2273 | ASSERT (*pp != NULL); |
5f992e62 | 2274 | |
bba1a0c0 | 2275 | list.head->header.next = *pp; |
4dec4d4e | 2276 | *pp = list.head; |
252b5132 RH |
2277 | } |
2278 | } | |
2279 | } | |
2280 | ||
0841712e JJ |
2281 | /* Check if all sections in a wild statement for a particular FILE |
2282 | are readonly. */ | |
2283 | ||
2284 | static void | |
2285 | check_section_callback (lang_wild_statement_type *ptr ATTRIBUTE_UNUSED, | |
2286 | struct wildcard_list *sec ATTRIBUTE_UNUSED, | |
2287 | asection *section, | |
2288 | lang_input_statement_type *file ATTRIBUTE_UNUSED, | |
6feb9908 | 2289 | void *data) |
0841712e JJ |
2290 | { |
2291 | /* Exclude sections that match UNIQUE_SECTION_LIST. */ | |
2292 | if (unique_section_p (section)) | |
2293 | return; | |
2294 | ||
6feb9908 AM |
2295 | if (section->output_section == NULL && (section->flags & SEC_READONLY) == 0) |
2296 | ((lang_output_section_statement_type *) data)->all_input_readonly = FALSE; | |
0841712e JJ |
2297 | } |
2298 | ||
252b5132 RH |
2299 | /* This is passed a file name which must have been seen already and |
2300 | added to the statement tree. We will see if it has been opened | |
2301 | already and had its symbols read. If not then we'll read it. */ | |
2302 | ||
2303 | static lang_input_statement_type * | |
1579bae1 | 2304 | lookup_name (const char *name) |
252b5132 RH |
2305 | { |
2306 | lang_input_statement_type *search; | |
2307 | ||
2308 | for (search = (lang_input_statement_type *) input_file_chain.head; | |
1579bae1 | 2309 | search != NULL; |
252b5132 RH |
2310 | search = (lang_input_statement_type *) search->next_real_file) |
2311 | { | |
0013291d NC |
2312 | /* Use the local_sym_name as the name of the file that has |
2313 | already been loaded as filename might have been transformed | |
2314 | via the search directory lookup mechanism. */ | |
87aa7f19 | 2315 | const char *filename = search->local_sym_name; |
0013291d | 2316 | |
0013291d | 2317 | if (filename != NULL |
0013291d | 2318 | && strcmp (filename, name) == 0) |
252b5132 RH |
2319 | break; |
2320 | } | |
2321 | ||
1579bae1 | 2322 | if (search == NULL) |
6feb9908 AM |
2323 | search = new_afile (name, lang_input_file_is_search_file_enum, |
2324 | default_target, FALSE); | |
252b5132 RH |
2325 | |
2326 | /* If we have already added this file, or this file is not real | |
87aa7f19 AM |
2327 | don't add this file. */ |
2328 | if (search->loaded || !search->real) | |
252b5132 RH |
2329 | return search; |
2330 | ||
1579bae1 | 2331 | if (! load_symbols (search, NULL)) |
6770ec8c | 2332 | return NULL; |
252b5132 RH |
2333 | |
2334 | return search; | |
2335 | } | |
2336 | ||
b58f81ae DJ |
2337 | /* Save LIST as a list of libraries whose symbols should not be exported. */ |
2338 | ||
2339 | struct excluded_lib | |
2340 | { | |
2341 | char *name; | |
2342 | struct excluded_lib *next; | |
2343 | }; | |
2344 | static struct excluded_lib *excluded_libs; | |
2345 | ||
2346 | void | |
2347 | add_excluded_libs (const char *list) | |
2348 | { | |
2349 | const char *p = list, *end; | |
2350 | ||
2351 | while (*p != '\0') | |
2352 | { | |
2353 | struct excluded_lib *entry; | |
2354 | end = strpbrk (p, ",:"); | |
2355 | if (end == NULL) | |
2356 | end = p + strlen (p); | |
2357 | entry = xmalloc (sizeof (*entry)); | |
2358 | entry->next = excluded_libs; | |
2359 | entry->name = xmalloc (end - p + 1); | |
2360 | memcpy (entry->name, p, end - p); | |
2361 | entry->name[end - p] = '\0'; | |
2362 | excluded_libs = entry; | |
2363 | if (*end == '\0') | |
329c1c86 | 2364 | break; |
b58f81ae DJ |
2365 | p = end + 1; |
2366 | } | |
2367 | } | |
2368 | ||
2369 | static void | |
2370 | check_excluded_libs (bfd *abfd) | |
2371 | { | |
2372 | struct excluded_lib *lib = excluded_libs; | |
2373 | ||
2374 | while (lib) | |
2375 | { | |
2376 | int len = strlen (lib->name); | |
2377 | const char *filename = lbasename (abfd->filename); | |
2378 | ||
2379 | if (strcmp (lib->name, "ALL") == 0) | |
2380 | { | |
2381 | abfd->no_export = TRUE; | |
2382 | return; | |
2383 | } | |
2384 | ||
2385 | if (strncmp (lib->name, filename, len) == 0 | |
2386 | && (filename[len] == '\0' | |
2387 | || (filename[len] == '.' && filename[len + 1] == 'a' | |
2388 | && filename[len + 2] == '\0'))) | |
2389 | { | |
2390 | abfd->no_export = TRUE; | |
2391 | return; | |
2392 | } | |
2393 | ||
2394 | lib = lib->next; | |
2395 | } | |
2396 | } | |
2397 | ||
252b5132 RH |
2398 | /* Get the symbols for an input file. */ |
2399 | ||
e9f53129 | 2400 | bfd_boolean |
1579bae1 AM |
2401 | load_symbols (lang_input_statement_type *entry, |
2402 | lang_statement_list_type *place) | |
252b5132 RH |
2403 | { |
2404 | char **matching; | |
2405 | ||
2406 | if (entry->loaded) | |
b34976b6 | 2407 | return TRUE; |
252b5132 RH |
2408 | |
2409 | ldfile_open_file (entry); | |
2410 | ||
2411 | if (! bfd_check_format (entry->the_bfd, bfd_archive) | |
2412 | && ! bfd_check_format_matches (entry->the_bfd, bfd_object, &matching)) | |
2413 | { | |
2414 | bfd_error_type err; | |
2415 | lang_statement_list_type *hold; | |
b34976b6 | 2416 | bfd_boolean bad_load = TRUE; |
e3f2db7f | 2417 | bfd_boolean save_ldlang_sysrooted_script; |
f2e349f9 | 2418 | bfd_boolean save_as_needed, save_add_needed; |
b7a26f91 | 2419 | |
252b5132 | 2420 | err = bfd_get_error (); |
884fb58e NC |
2421 | |
2422 | /* See if the emulation has some special knowledge. */ | |
2423 | if (ldemul_unrecognized_file (entry)) | |
b34976b6 | 2424 | return TRUE; |
884fb58e | 2425 | |
252b5132 RH |
2426 | if (err == bfd_error_file_ambiguously_recognized) |
2427 | { | |
2428 | char **p; | |
2429 | ||
2430 | einfo (_("%B: file not recognized: %E\n"), entry->the_bfd); | |
2431 | einfo (_("%B: matching formats:"), entry->the_bfd); | |
2432 | for (p = matching; *p != NULL; p++) | |
2433 | einfo (" %s", *p); | |
2434 | einfo ("%F\n"); | |
2435 | } | |
2436 | else if (err != bfd_error_file_not_recognized | |
2437 | || place == NULL) | |
6770ec8c NC |
2438 | einfo (_("%F%B: file not recognized: %E\n"), entry->the_bfd); |
2439 | else | |
b34976b6 | 2440 | bad_load = FALSE; |
b7a26f91 | 2441 | |
252b5132 RH |
2442 | bfd_close (entry->the_bfd); |
2443 | entry->the_bfd = NULL; | |
2444 | ||
252b5132 | 2445 | /* Try to interpret the file as a linker script. */ |
252b5132 RH |
2446 | ldfile_open_command_file (entry->filename); |
2447 | ||
2448 | hold = stat_ptr; | |
2449 | stat_ptr = place; | |
e3f2db7f AO |
2450 | save_ldlang_sysrooted_script = ldlang_sysrooted_script; |
2451 | ldlang_sysrooted_script = entry->sysrooted; | |
f2e349f9 KK |
2452 | save_as_needed = as_needed; |
2453 | as_needed = entry->as_needed; | |
2454 | save_add_needed = add_needed; | |
2455 | add_needed = entry->add_needed; | |
252b5132 | 2456 | |
b34976b6 | 2457 | ldfile_assumed_script = TRUE; |
252b5132 | 2458 | parser_input = input_script; |
532345f2 L |
2459 | /* We want to use the same -Bdynamic/-Bstatic as the one for |
2460 | ENTRY. */ | |
2461 | config.dynamic_link = entry->dynamic; | |
252b5132 | 2462 | yyparse (); |
b34976b6 | 2463 | ldfile_assumed_script = FALSE; |
252b5132 | 2464 | |
e3f2db7f | 2465 | ldlang_sysrooted_script = save_ldlang_sysrooted_script; |
f2e349f9 KK |
2466 | as_needed = save_as_needed; |
2467 | add_needed = save_add_needed; | |
252b5132 RH |
2468 | stat_ptr = hold; |
2469 | ||
6770ec8c | 2470 | return ! bad_load; |
252b5132 RH |
2471 | } |
2472 | ||
2473 | if (ldemul_recognized_file (entry)) | |
b34976b6 | 2474 | return TRUE; |
252b5132 RH |
2475 | |
2476 | /* We don't call ldlang_add_file for an archive. Instead, the | |
2477 | add_symbols entry point will call ldlang_add_file, via the | |
2478 | add_archive_element callback, for each element of the archive | |
2479 | which is used. */ | |
2480 | switch (bfd_get_format (entry->the_bfd)) | |
2481 | { | |
2482 | default: | |
2483 | break; | |
2484 | ||
2485 | case bfd_object: | |
2486 | ldlang_add_file (entry); | |
2487 | if (trace_files || trace_file_tries) | |
2488 | info_msg ("%I\n", entry); | |
2489 | break; | |
2490 | ||
2491 | case bfd_archive: | |
b58f81ae DJ |
2492 | check_excluded_libs (entry->the_bfd); |
2493 | ||
252b5132 RH |
2494 | if (entry->whole_archive) |
2495 | { | |
b7a26f91 | 2496 | bfd *member = NULL; |
b34976b6 | 2497 | bfd_boolean loaded = TRUE; |
6770ec8c NC |
2498 | |
2499 | for (;;) | |
252b5132 | 2500 | { |
6770ec8c NC |
2501 | member = bfd_openr_next_archived_file (entry->the_bfd, member); |
2502 | ||
2503 | if (member == NULL) | |
2504 | break; | |
b7a26f91 | 2505 | |
252b5132 | 2506 | if (! bfd_check_format (member, bfd_object)) |
6770ec8c NC |
2507 | { |
2508 | einfo (_("%F%B: member %B in archive is not an object\n"), | |
2509 | entry->the_bfd, member); | |
b34976b6 | 2510 | loaded = FALSE; |
6770ec8c NC |
2511 | } |
2512 | ||
252b5132 RH |
2513 | if (! ((*link_info.callbacks->add_archive_element) |
2514 | (&link_info, member, "--whole-archive"))) | |
2515 | abort (); | |
6770ec8c | 2516 | |
252b5132 | 2517 | if (! bfd_link_add_symbols (member, &link_info)) |
6770ec8c NC |
2518 | { |
2519 | einfo (_("%F%B: could not read symbols: %E\n"), member); | |
b34976b6 | 2520 | loaded = FALSE; |
6770ec8c | 2521 | } |
252b5132 RH |
2522 | } |
2523 | ||
6770ec8c NC |
2524 | entry->loaded = loaded; |
2525 | return loaded; | |
252b5132 | 2526 | } |
6770ec8c | 2527 | break; |
252b5132 RH |
2528 | } |
2529 | ||
03bdc404 | 2530 | if (bfd_link_add_symbols (entry->the_bfd, &link_info)) |
b34976b6 | 2531 | entry->loaded = TRUE; |
6770ec8c | 2532 | else |
252b5132 RH |
2533 | einfo (_("%F%B: could not read symbols: %E\n"), entry->the_bfd); |
2534 | ||
6770ec8c | 2535 | return entry->loaded; |
252b5132 RH |
2536 | } |
2537 | ||
b6bf44ba AM |
2538 | /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both |
2539 | may be NULL, indicating that it is a wildcard. Separate | |
2540 | lang_input_section statements are created for each part of the | |
2541 | expansion; they are added after the wild statement S. OUTPUT is | |
2542 | the output section. */ | |
252b5132 RH |
2543 | |
2544 | static void | |
1579bae1 AM |
2545 | wild (lang_wild_statement_type *s, |
2546 | const char *target ATTRIBUTE_UNUSED, | |
2547 | lang_output_section_statement_type *output) | |
252b5132 | 2548 | { |
b6bf44ba | 2549 | struct wildcard_list *sec; |
252b5132 | 2550 | |
50c77e5d | 2551 | if (s->handler_data[0] |
329c1c86 | 2552 | && s->handler_data[0]->spec.sorted == by_name |
50c77e5d NC |
2553 | && !s->filenames_sorted) |
2554 | { | |
329c1c86 AM |
2555 | lang_section_bst_type *tree; |
2556 | ||
50c77e5d NC |
2557 | walk_wild (s, output_section_callback_fast, output); |
2558 | ||
e6f2cbf5 | 2559 | tree = s->tree; |
329c1c86 | 2560 | if (tree) |
e6f2cbf5 L |
2561 | { |
2562 | output_section_callback_tree_to_list (s, tree, output); | |
2563 | s->tree = NULL; | |
2564 | } | |
50c77e5d | 2565 | } |
329c1c86 | 2566 | else |
50c77e5d | 2567 | walk_wild (s, output_section_callback, output); |
b6bf44ba | 2568 | |
abe6ac95 AM |
2569 | if (default_common_section == NULL) |
2570 | for (sec = s->section_list; sec != NULL; sec = sec->next) | |
b6bf44ba AM |
2571 | if (sec->spec.name != NULL && strcmp (sec->spec.name, "COMMON") == 0) |
2572 | { | |
2573 | /* Remember the section that common is going to in case we | |
b7a26f91 | 2574 | later get something which doesn't know where to put it. */ |
b6bf44ba | 2575 | default_common_section = output; |
abe6ac95 | 2576 | break; |
b6bf44ba | 2577 | } |
252b5132 RH |
2578 | } |
2579 | ||
b34976b6 | 2580 | /* Return TRUE iff target is the sought target. */ |
08da4cac | 2581 | |
e50d8076 | 2582 | static int |
1579bae1 | 2583 | get_target (const bfd_target *target, void *data) |
e50d8076 | 2584 | { |
1579bae1 | 2585 | const char *sought = data; |
5f992e62 | 2586 | |
e50d8076 NC |
2587 | return strcmp (target->name, sought) == 0; |
2588 | } | |
2589 | ||
2590 | /* Like strcpy() but convert to lower case as well. */ | |
08da4cac | 2591 | |
e50d8076 | 2592 | static void |
1579bae1 | 2593 | stricpy (char *dest, char *src) |
e50d8076 NC |
2594 | { |
2595 | char c; | |
5f992e62 | 2596 | |
08da4cac | 2597 | while ((c = *src++) != 0) |
3882b010 | 2598 | *dest++ = TOLOWER (c); |
e50d8076 | 2599 | |
08da4cac | 2600 | *dest = 0; |
e50d8076 NC |
2601 | } |
2602 | ||
396a2467 | 2603 | /* Remove the first occurrence of needle (if any) in haystack |
e50d8076 | 2604 | from haystack. */ |
08da4cac | 2605 | |
e50d8076 | 2606 | static void |
1579bae1 | 2607 | strcut (char *haystack, char *needle) |
e50d8076 NC |
2608 | { |
2609 | haystack = strstr (haystack, needle); | |
5f992e62 | 2610 | |
e50d8076 NC |
2611 | if (haystack) |
2612 | { | |
08da4cac | 2613 | char *src; |
e50d8076 | 2614 | |
08da4cac KH |
2615 | for (src = haystack + strlen (needle); *src;) |
2616 | *haystack++ = *src++; | |
5f992e62 | 2617 | |
08da4cac | 2618 | *haystack = 0; |
e50d8076 NC |
2619 | } |
2620 | } | |
2621 | ||
2622 | /* Compare two target format name strings. | |
2623 | Return a value indicating how "similar" they are. */ | |
08da4cac | 2624 | |
e50d8076 | 2625 | static int |
1579bae1 | 2626 | name_compare (char *first, char *second) |
e50d8076 | 2627 | { |
08da4cac KH |
2628 | char *copy1; |
2629 | char *copy2; | |
2630 | int result; | |
5f992e62 | 2631 | |
e50d8076 NC |
2632 | copy1 = xmalloc (strlen (first) + 1); |
2633 | copy2 = xmalloc (strlen (second) + 1); | |
2634 | ||
2635 | /* Convert the names to lower case. */ | |
2636 | stricpy (copy1, first); | |
2637 | stricpy (copy2, second); | |
2638 | ||
1579bae1 | 2639 | /* Remove size and endian strings from the name. */ |
e50d8076 NC |
2640 | strcut (copy1, "big"); |
2641 | strcut (copy1, "little"); | |
2642 | strcut (copy2, "big"); | |
2643 | strcut (copy2, "little"); | |
2644 | ||
2645 | /* Return a value based on how many characters match, | |
2646 | starting from the beginning. If both strings are | |
2647 | the same then return 10 * their length. */ | |
08da4cac KH |
2648 | for (result = 0; copy1[result] == copy2[result]; result++) |
2649 | if (copy1[result] == 0) | |
e50d8076 NC |
2650 | { |
2651 | result *= 10; | |
2652 | break; | |
2653 | } | |
5f992e62 | 2654 | |
e50d8076 NC |
2655 | free (copy1); |
2656 | free (copy2); | |
2657 | ||
2658 | return result; | |
2659 | } | |
2660 | ||
2661 | /* Set by closest_target_match() below. */ | |
08da4cac | 2662 | static const bfd_target *winner; |
e50d8076 NC |
2663 | |
2664 | /* Scan all the valid bfd targets looking for one that has the endianness | |
2665 | requirement that was specified on the command line, and is the nearest | |
2666 | match to the original output target. */ | |
08da4cac | 2667 | |
e50d8076 | 2668 | static int |
1579bae1 | 2669 | closest_target_match (const bfd_target *target, void *data) |
e50d8076 | 2670 | { |
1579bae1 | 2671 | const bfd_target *original = data; |
5f992e62 | 2672 | |
08da4cac KH |
2673 | if (command_line.endian == ENDIAN_BIG |
2674 | && target->byteorder != BFD_ENDIAN_BIG) | |
e50d8076 | 2675 | return 0; |
5f992e62 | 2676 | |
08da4cac KH |
2677 | if (command_line.endian == ENDIAN_LITTLE |
2678 | && target->byteorder != BFD_ENDIAN_LITTLE) | |
e50d8076 NC |
2679 | return 0; |
2680 | ||
2681 | /* Must be the same flavour. */ | |
2682 | if (target->flavour != original->flavour) | |
2683 | return 0; | |
2684 | ||
2685 | /* If we have not found a potential winner yet, then record this one. */ | |
2686 | if (winner == NULL) | |
2687 | { | |
2688 | winner = target; | |
2689 | return 0; | |
2690 | } | |
2691 | ||
2692 | /* Oh dear, we now have two potential candidates for a successful match. | |
4de2d33d | 2693 | Compare their names and choose the better one. */ |
d1778b88 AM |
2694 | if (name_compare (target->name, original->name) |
2695 | > name_compare (winner->name, original->name)) | |
e50d8076 NC |
2696 | winner = target; |
2697 | ||
2698 | /* Keep on searching until wqe have checked them all. */ | |
2699 | return 0; | |
2700 | } | |
2701 | ||
2702 | /* Return the BFD target format of the first input file. */ | |
08da4cac | 2703 | |
e50d8076 | 2704 | static char * |
1579bae1 | 2705 | get_first_input_target (void) |
e50d8076 | 2706 | { |
08da4cac | 2707 | char *target = NULL; |
e50d8076 NC |
2708 | |
2709 | LANG_FOR_EACH_INPUT_STATEMENT (s) | |
2710 | { | |
2711 | if (s->header.type == lang_input_statement_enum | |
2712 | && s->real) | |
2713 | { | |
2714 | ldfile_open_file (s); | |
5f992e62 | 2715 | |
e50d8076 NC |
2716 | if (s->the_bfd != NULL |
2717 | && bfd_check_format (s->the_bfd, bfd_object)) | |
2718 | { | |
2719 | target = bfd_get_target (s->the_bfd); | |
5f992e62 | 2720 | |
e50d8076 NC |
2721 | if (target != NULL) |
2722 | break; | |
2723 | } | |
2724 | } | |
2725 | } | |
5f992e62 | 2726 | |
e50d8076 NC |
2727 | return target; |
2728 | } | |
2729 | ||
599917b8 | 2730 | const char * |
1579bae1 | 2731 | lang_get_output_target (void) |
599917b8 JJ |
2732 | { |
2733 | const char *target; | |
2734 | ||
2735 | /* Has the user told us which output format to use? */ | |
1579bae1 | 2736 | if (output_target != NULL) |
599917b8 JJ |
2737 | return output_target; |
2738 | ||
2739 | /* No - has the current target been set to something other than | |
2740 | the default? */ | |
2741 | if (current_target != default_target) | |
2742 | return current_target; | |
2743 | ||
2744 | /* No - can we determine the format of the first input file? */ | |
2745 | target = get_first_input_target (); | |
2746 | if (target != NULL) | |
2747 | return target; | |
2748 | ||
2749 | /* Failed - use the default output target. */ | |
2750 | return default_target; | |
2751 | } | |
2752 | ||
252b5132 RH |
2753 | /* Open the output file. */ |
2754 | ||
2755 | static bfd * | |
1579bae1 | 2756 | open_output (const char *name) |
252b5132 | 2757 | { |
08da4cac | 2758 | bfd *output; |
252b5132 | 2759 | |
599917b8 | 2760 | output_target = lang_get_output_target (); |
5f992e62 | 2761 | |
08da4cac KH |
2762 | /* Has the user requested a particular endianness on the command |
2763 | line? */ | |
e50d8076 NC |
2764 | if (command_line.endian != ENDIAN_UNSET) |
2765 | { | |
08da4cac | 2766 | const bfd_target *target; |
1b69a0bf | 2767 | enum bfd_endian desired_endian; |
e50d8076 NC |
2768 | |
2769 | /* Get the chosen target. */ | |
1579bae1 | 2770 | target = bfd_search_for_target (get_target, (void *) output_target); |
e50d8076 | 2771 | |
c13b1b77 NC |
2772 | /* If the target is not supported, we cannot do anything. */ |
2773 | if (target != NULL) | |
e50d8076 | 2774 | { |
c13b1b77 NC |
2775 | if (command_line.endian == ENDIAN_BIG) |
2776 | desired_endian = BFD_ENDIAN_BIG; | |
e50d8076 | 2777 | else |
c13b1b77 | 2778 | desired_endian = BFD_ENDIAN_LITTLE; |
5f992e62 AM |
2779 | |
2780 | /* See if the target has the wrong endianness. This should | |
2781 | not happen if the linker script has provided big and | |
2782 | little endian alternatives, but some scrips don't do | |
2783 | this. */ | |
c13b1b77 | 2784 | if (target->byteorder != desired_endian) |
e50d8076 | 2785 | { |
c13b1b77 NC |
2786 | /* If it does, then see if the target provides |
2787 | an alternative with the correct endianness. */ | |
2788 | if (target->alternative_target != NULL | |
2789 | && (target->alternative_target->byteorder == desired_endian)) | |
2790 | output_target = target->alternative_target->name; | |
e50d8076 | 2791 | else |
c13b1b77 | 2792 | { |
5f992e62 AM |
2793 | /* Try to find a target as similar as possible to |
2794 | the default target, but which has the desired | |
2795 | endian characteristic. */ | |
1579bae1 AM |
2796 | bfd_search_for_target (closest_target_match, |
2797 | (void *) target); | |
5f992e62 AM |
2798 | |
2799 | /* Oh dear - we could not find any targets that | |
2800 | satisfy our requirements. */ | |
c13b1b77 | 2801 | if (winner == NULL) |
6feb9908 AM |
2802 | einfo (_("%P: warning: could not find any targets" |
2803 | " that match endianness requirement\n")); | |
c13b1b77 NC |
2804 | else |
2805 | output_target = winner->name; | |
2806 | } | |
e50d8076 NC |
2807 | } |
2808 | } | |
252b5132 | 2809 | } |
5f992e62 | 2810 | |
252b5132 RH |
2811 | output = bfd_openw (name, output_target); |
2812 | ||
1579bae1 | 2813 | if (output == NULL) |
252b5132 RH |
2814 | { |
2815 | if (bfd_get_error () == bfd_error_invalid_target) | |
e50d8076 NC |
2816 | einfo (_("%P%F: target %s not found\n"), output_target); |
2817 | ||
252b5132 RH |
2818 | einfo (_("%P%F: cannot open output file %s: %E\n"), name); |
2819 | } | |
2820 | ||
b34976b6 | 2821 | delete_output_file_on_failure = TRUE; |
252b5132 | 2822 | |
252b5132 RH |
2823 | if (! bfd_set_format (output, bfd_object)) |
2824 | einfo (_("%P%F:%s: can not make object file: %E\n"), name); | |
2825 | if (! bfd_set_arch_mach (output, | |
2826 | ldfile_output_architecture, | |
2827 | ldfile_output_machine)) | |
2828 | einfo (_("%P%F:%s: can not set architecture: %E\n"), name); | |
2829 | ||
2830 | link_info.hash = bfd_link_hash_table_create (output); | |
1579bae1 | 2831 | if (link_info.hash == NULL) |
384a9dda | 2832 | einfo (_("%P%F: can not create hash table: %E\n")); |
252b5132 RH |
2833 | |
2834 | bfd_set_gp_size (output, g_switch_value); | |
2835 | return output; | |
2836 | } | |
2837 | ||
252b5132 | 2838 | static void |
1579bae1 | 2839 | ldlang_open_output (lang_statement_union_type *statement) |
252b5132 RH |
2840 | { |
2841 | switch (statement->header.type) | |
2842 | { | |
2843 | case lang_output_statement_enum: | |
1579bae1 | 2844 | ASSERT (output_bfd == NULL); |
252b5132 RH |
2845 | output_bfd = open_output (statement->output_statement.name); |
2846 | ldemul_set_output_arch (); | |
1049f94e | 2847 | if (config.magic_demand_paged && !link_info.relocatable) |
252b5132 RH |
2848 | output_bfd->flags |= D_PAGED; |
2849 | else | |
2850 | output_bfd->flags &= ~D_PAGED; | |
2851 | if (config.text_read_only) | |
2852 | output_bfd->flags |= WP_TEXT; | |
2853 | else | |
2854 | output_bfd->flags &= ~WP_TEXT; | |
2855 | if (link_info.traditional_format) | |
2856 | output_bfd->flags |= BFD_TRADITIONAL_FORMAT; | |
2857 | else | |
2858 | output_bfd->flags &= ~BFD_TRADITIONAL_FORMAT; | |
2859 | break; | |
2860 | ||
2861 | case lang_target_statement_enum: | |
2862 | current_target = statement->target_statement.target; | |
2863 | break; | |
2864 | default: | |
2865 | break; | |
2866 | } | |
2867 | } | |
2868 | ||
e5caa5e0 AM |
2869 | /* Convert between addresses in bytes and sizes in octets. |
2870 | For currently supported targets, octets_per_byte is always a power | |
2871 | of two, so we can use shifts. */ | |
2872 | #define TO_ADDR(X) ((X) >> opb_shift) | |
2873 | #define TO_SIZE(X) ((X) << opb_shift) | |
2874 | ||
2875 | /* Support the above. */ | |
2876 | static unsigned int opb_shift = 0; | |
2877 | ||
2878 | static void | |
2879 | init_opb (void) | |
2880 | { | |
2881 | unsigned x = bfd_arch_mach_octets_per_byte (ldfile_output_architecture, | |
2882 | ldfile_output_machine); | |
2883 | opb_shift = 0; | |
2884 | if (x > 1) | |
2885 | while ((x & 1) == 0) | |
2886 | { | |
2887 | x >>= 1; | |
2888 | ++opb_shift; | |
2889 | } | |
2890 | ASSERT (x == 1); | |
2891 | } | |
2892 | ||
252b5132 RH |
2893 | /* Open all the input files. */ |
2894 | ||
2895 | static void | |
1579bae1 | 2896 | open_input_bfds (lang_statement_union_type *s, bfd_boolean force) |
252b5132 | 2897 | { |
1579bae1 | 2898 | for (; s != NULL; s = s->header.next) |
252b5132 RH |
2899 | { |
2900 | switch (s->header.type) | |
2901 | { | |
2902 | case lang_constructors_statement_enum: | |
2903 | open_input_bfds (constructor_list.head, force); | |
2904 | break; | |
2905 | case lang_output_section_statement_enum: | |
2906 | open_input_bfds (s->output_section_statement.children.head, force); | |
2907 | break; | |
2908 | case lang_wild_statement_enum: | |
08da4cac | 2909 | /* Maybe we should load the file's symbols. */ |
252b5132 RH |
2910 | if (s->wild_statement.filename |
2911 | && ! wildcardp (s->wild_statement.filename)) | |
4a43e768 | 2912 | lookup_name (s->wild_statement.filename); |
252b5132 RH |
2913 | open_input_bfds (s->wild_statement.children.head, force); |
2914 | break; | |
2915 | case lang_group_statement_enum: | |
2916 | { | |
2917 | struct bfd_link_hash_entry *undefs; | |
2918 | ||
2919 | /* We must continually search the entries in the group | |
08da4cac KH |
2920 | until no new symbols are added to the list of undefined |
2921 | symbols. */ | |
252b5132 RH |
2922 | |
2923 | do | |
2924 | { | |
2925 | undefs = link_info.hash->undefs_tail; | |
b34976b6 | 2926 | open_input_bfds (s->group_statement.children.head, TRUE); |
252b5132 RH |
2927 | } |
2928 | while (undefs != link_info.hash->undefs_tail); | |
2929 | } | |
2930 | break; | |
2931 | case lang_target_statement_enum: | |
2932 | current_target = s->target_statement.target; | |
2933 | break; | |
2934 | case lang_input_statement_enum: | |
e50d8076 | 2935 | if (s->input_statement.real) |
252b5132 RH |
2936 | { |
2937 | lang_statement_list_type add; | |
2938 | ||
2939 | s->input_statement.target = current_target; | |
2940 | ||
2941 | /* If we are being called from within a group, and this | |
afd7a018 AM |
2942 | is an archive which has already been searched, then |
2943 | force it to be researched unless the whole archive | |
cd4c806a | 2944 | has been loaded already. */ |
252b5132 | 2945 | if (force |
cd4c806a | 2946 | && !s->input_statement.whole_archive |
252b5132 RH |
2947 | && s->input_statement.loaded |
2948 | && bfd_check_format (s->input_statement.the_bfd, | |
2949 | bfd_archive)) | |
b34976b6 | 2950 | s->input_statement.loaded = FALSE; |
252b5132 | 2951 | |
d1778b88 | 2952 | lang_list_init (&add); |
1276aefa | 2953 | |
6770ec8c | 2954 | if (! load_symbols (&s->input_statement, &add)) |
b34976b6 | 2955 | config.make_executable = FALSE; |
252b5132 RH |
2956 | |
2957 | if (add.head != NULL) | |
2958 | { | |
bba1a0c0 AM |
2959 | *add.tail = s->header.next; |
2960 | s->header.next = add.head; | |
252b5132 RH |
2961 | } |
2962 | } | |
2963 | break; | |
2964 | default: | |
2965 | break; | |
2966 | } | |
2967 | } | |
2968 | } | |
2969 | ||
420e579c HPN |
2970 | /* Add a symbol to a hash of symbols used in DEFINED (NAME) expressions. */ |
2971 | ||
2972 | void | |
2973 | lang_track_definedness (const char *name) | |
2974 | { | |
2975 | if (bfd_hash_lookup (&lang_definedness_table, name, TRUE, FALSE) == NULL) | |
2976 | einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name); | |
2977 | } | |
2978 | ||
2979 | /* New-function for the definedness hash table. */ | |
2980 | ||
2981 | static struct bfd_hash_entry * | |
2982 | lang_definedness_newfunc (struct bfd_hash_entry *entry, | |
2983 | struct bfd_hash_table *table ATTRIBUTE_UNUSED, | |
2984 | const char *name ATTRIBUTE_UNUSED) | |
2985 | { | |
2986 | struct lang_definedness_hash_entry *ret | |
2987 | = (struct lang_definedness_hash_entry *) entry; | |
2988 | ||
2989 | if (ret == NULL) | |
2990 | ret = (struct lang_definedness_hash_entry *) | |
2991 | bfd_hash_allocate (table, sizeof (struct lang_definedness_hash_entry)); | |
2992 | ||
2993 | if (ret == NULL) | |
2994 | einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name); | |
2995 | ||
2996 | ret->iteration = -1; | |
2997 | return &ret->root; | |
2998 | } | |
2999 | ||
3000 | /* Return the iteration when the definition of NAME was last updated. A | |
3001 | value of -1 means that the symbol is not defined in the linker script | |
3002 | or the command line, but may be defined in the linker symbol table. */ | |
3003 | ||
3004 | int | |
3005 | lang_symbol_definition_iteration (const char *name) | |
3006 | { | |
3007 | struct lang_definedness_hash_entry *defentry | |
3008 | = (struct lang_definedness_hash_entry *) | |
3009 | bfd_hash_lookup (&lang_definedness_table, name, FALSE, FALSE); | |
3010 | ||
3011 | /* We've already created this one on the presence of DEFINED in the | |
3012 | script, so it can't be NULL unless something is borked elsewhere in | |
3013 | the code. */ | |
3014 | if (defentry == NULL) | |
3015 | FAIL (); | |
3016 | ||
3017 | return defentry->iteration; | |
3018 | } | |
3019 | ||
3020 | /* Update the definedness state of NAME. */ | |
3021 | ||
3022 | void | |
3023 | lang_update_definedness (const char *name, struct bfd_link_hash_entry *h) | |
3024 | { | |
3025 | struct lang_definedness_hash_entry *defentry | |
3026 | = (struct lang_definedness_hash_entry *) | |
3027 | bfd_hash_lookup (&lang_definedness_table, name, FALSE, FALSE); | |
3028 | ||
3029 | /* We don't keep track of symbols not tested with DEFINED. */ | |
3030 | if (defentry == NULL) | |
3031 | return; | |
3032 | ||
3033 | /* If the symbol was already defined, and not from an earlier statement | |
3034 | iteration, don't update the definedness iteration, because that'd | |
3035 | make the symbol seem defined in the linker script at this point, and | |
3036 | it wasn't; it was defined in some object. If we do anyway, DEFINED | |
3037 | would start to yield false before this point and the construct "sym = | |
3038 | DEFINED (sym) ? sym : X;" would change sym to X despite being defined | |
3039 | in an object. */ | |
3040 | if (h->type != bfd_link_hash_undefined | |
3041 | && h->type != bfd_link_hash_common | |
3042 | && h->type != bfd_link_hash_new | |
3043 | && defentry->iteration == -1) | |
3044 | return; | |
3045 | ||
3046 | defentry->iteration = lang_statement_iteration; | |
3047 | } | |
3048 | ||
08da4cac | 3049 | /* Add the supplied name to the symbol table as an undefined reference. |
fcf0e35b AM |
3050 | This is a two step process as the symbol table doesn't even exist at |
3051 | the time the ld command line is processed. First we put the name | |
3052 | on a list, then, once the output file has been opened, transfer the | |
3053 | name to the symbol table. */ | |
3054 | ||
e3e942e9 | 3055 | typedef struct bfd_sym_chain ldlang_undef_chain_list_type; |
252b5132 | 3056 | |
e3e942e9 | 3057 | #define ldlang_undef_chain_list_head entry_symbol.next |
252b5132 RH |
3058 | |
3059 | void | |
1579bae1 | 3060 | ldlang_add_undef (const char *const name) |
252b5132 RH |
3061 | { |
3062 | ldlang_undef_chain_list_type *new = | |
1579bae1 | 3063 | stat_alloc (sizeof (ldlang_undef_chain_list_type)); |
252b5132 RH |
3064 | |
3065 | new->next = ldlang_undef_chain_list_head; | |
3066 | ldlang_undef_chain_list_head = new; | |
3067 | ||
d1b2b2dc | 3068 | new->name = xstrdup (name); |
fcf0e35b AM |
3069 | |
3070 | if (output_bfd != NULL) | |
3071 | insert_undefined (new->name); | |
3072 | } | |
3073 | ||
3074 | /* Insert NAME as undefined in the symbol table. */ | |
3075 | ||
3076 | static void | |
1579bae1 | 3077 | insert_undefined (const char *name) |
fcf0e35b AM |
3078 | { |
3079 | struct bfd_link_hash_entry *h; | |
3080 | ||
b34976b6 | 3081 | h = bfd_link_hash_lookup (link_info.hash, name, TRUE, FALSE, TRUE); |
1579bae1 | 3082 | if (h == NULL) |
fcf0e35b AM |
3083 | einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n")); |
3084 | if (h->type == bfd_link_hash_new) | |
3085 | { | |
3086 | h->type = bfd_link_hash_undefined; | |
3087 | h->u.undef.abfd = NULL; | |
3088 | bfd_link_add_undef (link_info.hash, h); | |
3089 | } | |
252b5132 RH |
3090 | } |
3091 | ||
3092 | /* Run through the list of undefineds created above and place them | |
3093 | into the linker hash table as undefined symbols belonging to the | |
08da4cac KH |
3094 | script file. */ |
3095 | ||
252b5132 | 3096 | static void |
1579bae1 | 3097 | lang_place_undefineds (void) |
252b5132 RH |
3098 | { |
3099 | ldlang_undef_chain_list_type *ptr; | |
3100 | ||
1579bae1 AM |
3101 | for (ptr = ldlang_undef_chain_list_head; ptr != NULL; ptr = ptr->next) |
3102 | insert_undefined (ptr->name); | |
252b5132 RH |
3103 | } |
3104 | ||
0841712e JJ |
3105 | /* Check for all readonly or some readwrite sections. */ |
3106 | ||
3107 | static void | |
6feb9908 AM |
3108 | check_input_sections |
3109 | (lang_statement_union_type *s, | |
3110 | lang_output_section_statement_type *output_section_statement) | |
0841712e JJ |
3111 | { |
3112 | for (; s != (lang_statement_union_type *) NULL; s = s->header.next) | |
3113 | { | |
3114 | switch (s->header.type) | |
3115 | { | |
3116 | case lang_wild_statement_enum: | |
3117 | walk_wild (&s->wild_statement, check_section_callback, | |
3118 | output_section_statement); | |
3119 | if (! output_section_statement->all_input_readonly) | |
3120 | return; | |
3121 | break; | |
3122 | case lang_constructors_statement_enum: | |
3123 | check_input_sections (constructor_list.head, | |
3124 | output_section_statement); | |
3125 | if (! output_section_statement->all_input_readonly) | |
3126 | return; | |
3127 | break; | |
3128 | case lang_group_statement_enum: | |
3129 | check_input_sections (s->group_statement.children.head, | |
3130 | output_section_statement); | |
3131 | if (! output_section_statement->all_input_readonly) | |
3132 | return; | |
3133 | break; | |
3134 | default: | |
3135 | break; | |
3136 | } | |
3137 | } | |
3138 | } | |
3139 | ||
bcaa7b3e L |
3140 | /* Update wildcard statements if needed. */ |
3141 | ||
3142 | static void | |
3143 | update_wild_statements (lang_statement_union_type *s) | |
3144 | { | |
3145 | struct wildcard_list *sec; | |
3146 | ||
3147 | switch (sort_section) | |
3148 | { | |
3149 | default: | |
3150 | FAIL (); | |
3151 | ||
3152 | case none: | |
3153 | break; | |
3154 | ||
3155 | case by_name: | |
3156 | case by_alignment: | |
3157 | for (; s != NULL; s = s->header.next) | |
3158 | { | |
3159 | switch (s->header.type) | |
3160 | { | |
3161 | default: | |
3162 | break; | |
3163 | ||
3164 | case lang_wild_statement_enum: | |
3165 | sec = s->wild_statement.section_list; | |
0d0999db L |
3166 | for (sec = s->wild_statement.section_list; sec != NULL; |
3167 | sec = sec->next) | |
bcaa7b3e L |
3168 | { |
3169 | switch (sec->spec.sorted) | |
3170 | { | |
3171 | case none: | |
3172 | sec->spec.sorted = sort_section; | |
3173 | break; | |
3174 | case by_name: | |
3175 | if (sort_section == by_alignment) | |
3176 | sec->spec.sorted = by_name_alignment; | |
3177 | break; | |
3178 | case by_alignment: | |
3179 | if (sort_section == by_name) | |
3180 | sec->spec.sorted = by_alignment_name; | |
3181 | break; | |
3182 | default: | |
3183 | break; | |
3184 | } | |
3185 | } | |
3186 | break; | |
3187 | ||
3188 | case lang_constructors_statement_enum: | |
3189 | update_wild_statements (constructor_list.head); | |
3190 | break; | |
3191 | ||
3192 | case lang_output_section_statement_enum: | |
3193 | update_wild_statements | |
3194 | (s->output_section_statement.children.head); | |
3195 | break; | |
3196 | ||
3197 | case lang_group_statement_enum: | |
3198 | update_wild_statements (s->group_statement.children.head); | |
3199 | break; | |
3200 | } | |
3201 | } | |
3202 | break; | |
3203 | } | |
3204 | } | |
3205 | ||
396a2467 | 3206 | /* Open input files and attach to output sections. */ |
08da4cac | 3207 | |
252b5132 | 3208 | static void |
1579bae1 AM |
3209 | map_input_to_output_sections |
3210 | (lang_statement_union_type *s, const char *target, | |
afd7a018 | 3211 | lang_output_section_statement_type *os) |
252b5132 | 3212 | { |
12d814e1 L |
3213 | flagword flags; |
3214 | ||
1579bae1 | 3215 | for (; s != NULL; s = s->header.next) |
252b5132 RH |
3216 | { |
3217 | switch (s->header.type) | |
3218 | { | |
252b5132 | 3219 | case lang_wild_statement_enum: |
afd7a018 | 3220 | wild (&s->wild_statement, target, os); |
abc6ab0a | 3221 | break; |
252b5132 RH |
3222 | case lang_constructors_statement_enum: |
3223 | map_input_to_output_sections (constructor_list.head, | |
3224 | target, | |
afd7a018 | 3225 | os); |
252b5132 RH |
3226 | break; |
3227 | case lang_output_section_statement_enum: | |
0841712e JJ |
3228 | if (s->output_section_statement.constraint) |
3229 | { | |
0cf7d72c AM |
3230 | if (s->output_section_statement.constraint != ONLY_IF_RW |
3231 | && s->output_section_statement.constraint != ONLY_IF_RO) | |
0841712e JJ |
3232 | break; |
3233 | s->output_section_statement.all_input_readonly = TRUE; | |
3234 | check_input_sections (s->output_section_statement.children.head, | |
3235 | &s->output_section_statement); | |
3236 | if ((s->output_section_statement.all_input_readonly | |
3237 | && s->output_section_statement.constraint == ONLY_IF_RW) | |
3238 | || (!s->output_section_statement.all_input_readonly | |
3239 | && s->output_section_statement.constraint == ONLY_IF_RO)) | |
3240 | { | |
3241 | s->output_section_statement.constraint = -1; | |
3242 | break; | |
3243 | } | |
3244 | } | |
3245 | ||
252b5132 RH |
3246 | map_input_to_output_sections (s->output_section_statement.children.head, |
3247 | target, | |
3248 | &s->output_section_statement); | |
3249 | break; | |
3250 | case lang_output_statement_enum: | |
3251 | break; | |
3252 | case lang_target_statement_enum: | |
3253 | target = s->target_statement.target; | |
3254 | break; | |
3255 | case lang_group_statement_enum: | |
3256 | map_input_to_output_sections (s->group_statement.children.head, | |
3257 | target, | |
afd7a018 | 3258 | os); |
252b5132 | 3259 | break; |
384d938f NS |
3260 | case lang_data_statement_enum: |
3261 | /* Make sure that any sections mentioned in the expression | |
3262 | are initialized. */ | |
3263 | exp_init_os (s->data_statement.exp); | |
12d814e1 | 3264 | flags = SEC_HAS_CONTENTS; |
afd7a018 AM |
3265 | /* The output section gets contents, and then we inspect for |
3266 | any flags set in the input script which override any ALLOC. */ | |
afd7a018 | 3267 | if (!(os->flags & SEC_NEVER_LOAD)) |
12d814e1 L |
3268 | flags |= SEC_ALLOC | SEC_LOAD; |
3269 | if (os->bfd_section == NULL) | |
3270 | init_os (os, NULL, flags); | |
3271 | else | |
3272 | os->bfd_section->flags |= flags; | |
afd7a018 | 3273 | break; |
252b5132 | 3274 | case lang_input_section_enum: |
e0f6802f AM |
3275 | break; |
3276 | case lang_fill_statement_enum: | |
252b5132 | 3277 | case lang_object_symbols_statement_enum: |
252b5132 RH |
3278 | case lang_reloc_statement_enum: |
3279 | case lang_padding_statement_enum: | |
3280 | case lang_input_statement_enum: | |
afd7a018 | 3281 | if (os != NULL && os->bfd_section == NULL) |
12d814e1 | 3282 | init_os (os, NULL, 0); |
252b5132 RH |
3283 | break; |
3284 | case lang_assignment_statement_enum: | |
afd7a018 | 3285 | if (os != NULL && os->bfd_section == NULL) |
12d814e1 | 3286 | init_os (os, NULL, 0); |
252b5132 RH |
3287 | |
3288 | /* Make sure that any sections mentioned in the assignment | |
08da4cac | 3289 | are initialized. */ |
252b5132 RH |
3290 | exp_init_os (s->assignment_statement.exp); |
3291 | break; | |
3292 | case lang_afile_asection_pair_statement_enum: | |
3293 | FAIL (); | |
3294 | break; | |
3295 | case lang_address_statement_enum: | |
329c1c86 | 3296 | /* Mark the specified section with the supplied address. |
ba916c8a MM |
3297 | |
3298 | If this section was actually a segment marker, then the | |
3299 | directive is ignored if the linker script explicitly | |
3300 | processed the segment marker. Originally, the linker | |
3301 | treated segment directives (like -Ttext on the | |
3302 | command-line) as section directives. We honor the | |
3303 | section directive semantics for backwards compatibilty; | |
3304 | linker scripts that do not specifically check for | |
3305 | SEGMENT_START automatically get the old semantics. */ | |
329c1c86 | 3306 | if (!s->address_statement.segment |
ba916c8a MM |
3307 | || !s->address_statement.segment->used) |
3308 | { | |
3309 | lang_output_section_statement_type *aos | |
3310 | = (lang_output_section_statement_lookup | |
3311 | (s->address_statement.section_name)); | |
329c1c86 | 3312 | |
ba916c8a | 3313 | if (aos->bfd_section == NULL) |
12d814e1 | 3314 | init_os (aos, NULL, 0); |
ba916c8a MM |
3315 | aos->addr_tree = s->address_statement.address; |
3316 | } | |
252b5132 RH |
3317 | break; |
3318 | } | |
3319 | } | |
3320 | } | |
3321 | ||
4bd5a393 AM |
3322 | /* An output section might have been removed after its statement was |
3323 | added. For example, ldemul_before_allocation can remove dynamic | |
3324 | sections if they turn out to be not needed. Clean them up here. */ | |
3325 | ||
8423293d | 3326 | void |
1579bae1 | 3327 | strip_excluded_output_sections (void) |
4bd5a393 | 3328 | { |
afd7a018 | 3329 | lang_output_section_statement_type *os; |
4bd5a393 | 3330 | |
046183de | 3331 | /* Run lang_size_sections (if not already done). */ |
e9ee469a AM |
3332 | if (expld.phase != lang_mark_phase_enum) |
3333 | { | |
3334 | expld.phase = lang_mark_phase_enum; | |
3335 | expld.dataseg.phase = exp_dataseg_none; | |
3336 | one_lang_size_sections_pass (NULL, FALSE); | |
3337 | lang_reset_memory_regions (); | |
3338 | } | |
3339 | ||
afd7a018 AM |
3340 | for (os = &lang_output_section_statement.head->output_section_statement; |
3341 | os != NULL; | |
3342 | os = os->next) | |
4bd5a393 | 3343 | { |
75ff4589 L |
3344 | asection *output_section; |
3345 | bfd_boolean exclude; | |
4bd5a393 | 3346 | |
0841712e JJ |
3347 | if (os->constraint == -1) |
3348 | continue; | |
8423293d | 3349 | |
75ff4589 L |
3350 | output_section = os->bfd_section; |
3351 | if (output_section == NULL) | |
8423293d AM |
3352 | continue; |
3353 | ||
32124d5b AM |
3354 | exclude = (output_section->rawsize == 0 |
3355 | && (output_section->flags & SEC_KEEP) == 0 | |
3356 | && !bfd_section_removed_from_list (output_bfd, | |
3357 | output_section)); | |
3358 | ||
3359 | /* Some sections have not yet been sized, notably .gnu.version, | |
3360 | .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED | |
3361 | input sections, so don't drop output sections that have such | |
3362 | input sections unless they are also marked SEC_EXCLUDE. */ | |
3363 | if (exclude && output_section->map_head.s != NULL) | |
75ff4589 L |
3364 | { |
3365 | asection *s; | |
8423293d | 3366 | |
32124d5b AM |
3367 | for (s = output_section->map_head.s; s != NULL; s = s->map_head.s) |
3368 | if ((s->flags & SEC_LINKER_CREATED) != 0 | |
3369 | && (s->flags & SEC_EXCLUDE) == 0) | |
e9ee469a AM |
3370 | { |
3371 | exclude = FALSE; | |
3372 | break; | |
3373 | } | |
75ff4589 | 3374 | } |
8423293d | 3375 | |
32124d5b AM |
3376 | /* TODO: Don't just junk map_head.s, turn them into link_orders. */ |
3377 | output_section->map_head.link_order = NULL; | |
3378 | output_section->map_tail.link_order = NULL; | |
3379 | ||
3380 | if (exclude) | |
4bd5a393 | 3381 | { |
e9ee469a AM |
3382 | /* We don't set bfd_section to NULL since bfd_section of the |
3383 | removed output section statement may still be used. */ | |
3d263d86 AM |
3384 | if (!os->section_relative_symbol |
3385 | && !os->update_dot_tree) | |
74541ad4 | 3386 | os->ignored = TRUE; |
e9ee469a | 3387 | output_section->flags |= SEC_EXCLUDE; |
32124d5b AM |
3388 | bfd_section_list_remove (output_bfd, output_section); |
3389 | output_bfd->section_count--; | |
4bd5a393 AM |
3390 | } |
3391 | } | |
8423293d AM |
3392 | |
3393 | /* Stop future calls to lang_add_section from messing with map_head | |
3394 | and map_tail link_order fields. */ | |
3395 | stripped_excluded_sections = TRUE; | |
4bd5a393 AM |
3396 | } |
3397 | ||
252b5132 | 3398 | static void |
1579bae1 AM |
3399 | print_output_section_statement |
3400 | (lang_output_section_statement_type *output_section_statement) | |
252b5132 RH |
3401 | { |
3402 | asection *section = output_section_statement->bfd_section; | |
3403 | int len; | |
3404 | ||
3405 | if (output_section_statement != abs_output_section) | |
3406 | { | |
3407 | minfo ("\n%s", output_section_statement->name); | |
3408 | ||
3409 | if (section != NULL) | |
3410 | { | |
3411 | print_dot = section->vma; | |
3412 | ||
3413 | len = strlen (output_section_statement->name); | |
3414 | if (len >= SECTION_NAME_MAP_LENGTH - 1) | |
3415 | { | |
3416 | print_nl (); | |
3417 | len = 0; | |
3418 | } | |
3419 | while (len < SECTION_NAME_MAP_LENGTH) | |
3420 | { | |
3421 | print_space (); | |
3422 | ++len; | |
3423 | } | |
3424 | ||
eea6121a | 3425 | minfo ("0x%V %W", section->vma, section->size); |
252b5132 | 3426 | |
67f744f3 AM |
3427 | if (section->vma != section->lma) |
3428 | minfo (_(" load address 0x%V"), section->lma); | |
252b5132 RH |
3429 | } |
3430 | ||
3431 | print_nl (); | |
3432 | } | |
3433 | ||
3434 | print_statement_list (output_section_statement->children.head, | |
3435 | output_section_statement); | |
3436 | } | |
3437 | ||
3b83e13a NC |
3438 | /* Scan for the use of the destination in the right hand side |
3439 | of an expression. In such cases we will not compute the | |
3440 | correct expression, since the value of DST that is used on | |
3441 | the right hand side will be its final value, not its value | |
3442 | just before this expression is evaluated. */ | |
329c1c86 | 3443 | |
3b83e13a NC |
3444 | static bfd_boolean |
3445 | scan_for_self_assignment (const char * dst, etree_type * rhs) | |
3446 | { | |
3447 | if (rhs == NULL || dst == NULL) | |
3448 | return FALSE; | |
3449 | ||
3450 | switch (rhs->type.node_class) | |
3451 | { | |
3452 | case etree_binary: | |
3453 | return scan_for_self_assignment (dst, rhs->binary.lhs) | |
3454 | || scan_for_self_assignment (dst, rhs->binary.rhs); | |
3455 | ||
3456 | case etree_trinary: | |
3457 | return scan_for_self_assignment (dst, rhs->trinary.lhs) | |
3458 | || scan_for_self_assignment (dst, rhs->trinary.rhs); | |
3459 | ||
3460 | case etree_assign: | |
3461 | case etree_provided: | |
3462 | case etree_provide: | |
3463 | if (strcmp (dst, rhs->assign.dst) == 0) | |
3464 | return TRUE; | |
3465 | return scan_for_self_assignment (dst, rhs->assign.src); | |
3466 | ||
3467 | case etree_unary: | |
3468 | return scan_for_self_assignment (dst, rhs->unary.child); | |
3469 | ||
3470 | case etree_value: | |
3471 | if (rhs->value.str) | |
3472 | return strcmp (dst, rhs->value.str) == 0; | |
3473 | return FALSE; | |
3474 | ||
3475 | case etree_name: | |
3476 | if (rhs->name.name) | |
3477 | return strcmp (dst, rhs->name.name) == 0; | |
3478 | return FALSE; | |
3479 | ||
3480 | default: | |
3481 | break; | |
3482 | } | |
3483 | ||
3484 | return FALSE; | |
3485 | } | |
3486 | ||
3487 | ||
252b5132 | 3488 | static void |
1579bae1 AM |
3489 | print_assignment (lang_assignment_statement_type *assignment, |
3490 | lang_output_section_statement_type *output_section) | |
252b5132 | 3491 | { |
3b83e13a NC |
3492 | unsigned int i; |
3493 | bfd_boolean is_dot; | |
3494 | bfd_boolean computation_is_valid = TRUE; | |
afd7a018 | 3495 | etree_type *tree; |
252b5132 RH |
3496 | |
3497 | for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++) | |
3498 | print_space (); | |
3499 | ||
afd7a018 AM |
3500 | if (assignment->exp->type.node_class == etree_assert) |
3501 | { | |
3b83e13a | 3502 | is_dot = FALSE; |
afd7a018 | 3503 | tree = assignment->exp->assert_s.child; |
3b83e13a | 3504 | computation_is_valid = TRUE; |
afd7a018 AM |
3505 | } |
3506 | else | |
3507 | { | |
3508 | const char *dst = assignment->exp->assign.dst; | |
3b83e13a NC |
3509 | |
3510 | is_dot = (dst[0] == '.' && dst[1] == 0); | |
afd7a018 | 3511 | tree = assignment->exp->assign.src; |
3b83e13a | 3512 | computation_is_valid = is_dot || (scan_for_self_assignment (dst, tree) == FALSE); |
afd7a018 AM |
3513 | } |
3514 | ||
e9ee469a AM |
3515 | exp_fold_tree (tree, output_section->bfd_section, &print_dot); |
3516 | if (expld.result.valid_p) | |
7b17f854 | 3517 | { |
7b17f854 RS |
3518 | bfd_vma value; |
3519 | ||
3b83e13a NC |
3520 | if (computation_is_valid) |
3521 | { | |
e9ee469a | 3522 | value = expld.result.value; |
10dbd1f3 | 3523 | |
e9ee469a AM |
3524 | if (expld.result.section) |
3525 | value += expld.result.section->vma; | |
7b17f854 | 3526 | |
3b83e13a NC |
3527 | minfo ("0x%V", value); |
3528 | if (is_dot) | |
3529 | print_dot = value; | |
3530 | } | |
3531 | else | |
3532 | { | |
3533 | struct bfd_link_hash_entry *h; | |
3534 | ||
3535 | h = bfd_link_hash_lookup (link_info.hash, assignment->exp->assign.dst, | |
3536 | FALSE, FALSE, TRUE); | |
3537 | if (h) | |
3538 | { | |
10dbd1f3 NC |
3539 | value = h->u.def.value; |
3540 | ||
e9ee469a AM |
3541 | if (expld.result.section) |
3542 | value += expld.result.section->vma; | |
3b83e13a NC |
3543 | |
3544 | minfo ("[0x%V]", value); | |
3545 | } | |
3546 | else | |
3547 | minfo ("[unresolved]"); | |
3548 | } | |
7b17f854 | 3549 | } |
252b5132 RH |
3550 | else |
3551 | { | |
3552 | minfo ("*undef* "); | |
3553 | #ifdef BFD64 | |
3554 | minfo (" "); | |
3555 | #endif | |
3556 | } | |
3557 | ||
3558 | minfo (" "); | |
252b5132 | 3559 | exp_print_tree (assignment->exp); |
252b5132 RH |
3560 | print_nl (); |
3561 | } | |
3562 | ||
3563 | static void | |
1579bae1 | 3564 | print_input_statement (lang_input_statement_type *statm) |
252b5132 | 3565 | { |
1579bae1 | 3566 | if (statm->filename != NULL) |
252b5132 RH |
3567 | { |
3568 | fprintf (config.map_file, "LOAD %s\n", statm->filename); | |
3569 | } | |
3570 | } | |
3571 | ||
3572 | /* Print all symbols defined in a particular section. This is called | |
35835446 | 3573 | via bfd_link_hash_traverse, or by print_all_symbols. */ |
252b5132 | 3574 | |
b34976b6 | 3575 | static bfd_boolean |
1579bae1 | 3576 | print_one_symbol (struct bfd_link_hash_entry *hash_entry, void *ptr) |
252b5132 | 3577 | { |
1579bae1 | 3578 | asection *sec = ptr; |
252b5132 RH |
3579 | |
3580 | if ((hash_entry->type == bfd_link_hash_defined | |
3581 | || hash_entry->type == bfd_link_hash_defweak) | |
3582 | && sec == hash_entry->u.def.section) | |
3583 | { | |
3584 | int i; | |
3585 | ||
3586 | for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++) | |
3587 | print_space (); | |
3588 | minfo ("0x%V ", | |
3589 | (hash_entry->u.def.value | |
3590 | + hash_entry->u.def.section->output_offset | |
3591 | + hash_entry->u.def.section->output_section->vma)); | |
3592 | ||
3593 | minfo (" %T\n", hash_entry->root.string); | |
3594 | } | |
3595 | ||
b34976b6 | 3596 | return TRUE; |
252b5132 RH |
3597 | } |
3598 | ||
35835446 | 3599 | static void |
e0f6802f | 3600 | print_all_symbols (asection *sec) |
35835446 JR |
3601 | { |
3602 | struct fat_user_section_struct *ud = get_userdata (sec); | |
3603 | struct map_symbol_def *def; | |
3604 | ||
afd7a018 AM |
3605 | if (!ud) |
3606 | return; | |
3607 | ||
35835446 JR |
3608 | *ud->map_symbol_def_tail = 0; |
3609 | for (def = ud->map_symbol_def_head; def; def = def->next) | |
3610 | print_one_symbol (def->entry, sec); | |
3611 | } | |
3612 | ||
252b5132 RH |
3613 | /* Print information about an input section to the map file. */ |
3614 | ||
3615 | static void | |
4d4920ec | 3616 | print_input_section (asection *i) |
252b5132 | 3617 | { |
eea6121a | 3618 | bfd_size_type size = i->size; |
abe6ac95 AM |
3619 | int len; |
3620 | bfd_vma addr; | |
e5caa5e0 AM |
3621 | |
3622 | init_opb (); | |
4d4920ec | 3623 | |
abe6ac95 AM |
3624 | print_space (); |
3625 | minfo ("%s", i->name); | |
252b5132 | 3626 | |
abe6ac95 AM |
3627 | len = 1 + strlen (i->name); |
3628 | if (len >= SECTION_NAME_MAP_LENGTH - 1) | |
3629 | { | |
3630 | print_nl (); | |
3631 | len = 0; | |
3632 | } | |
3633 | while (len < SECTION_NAME_MAP_LENGTH) | |
3634 | { | |
57ceae94 | 3635 | print_space (); |
abe6ac95 AM |
3636 | ++len; |
3637 | } | |
252b5132 | 3638 | |
abe6ac95 AM |
3639 | if (i->output_section != NULL && i->output_section->owner == output_bfd) |
3640 | addr = i->output_section->vma + i->output_offset; | |
3641 | else | |
3642 | { | |
3643 | addr = print_dot; | |
3644 | size = 0; | |
3645 | } | |
252b5132 | 3646 | |
abe6ac95 | 3647 | minfo ("0x%V %W %B\n", addr, TO_ADDR (size), i->owner); |
252b5132 | 3648 | |
abe6ac95 AM |
3649 | if (size != i->rawsize && i->rawsize != 0) |
3650 | { | |
3651 | len = SECTION_NAME_MAP_LENGTH + 3; | |
252b5132 | 3652 | #ifdef BFD64 |
abe6ac95 | 3653 | len += 16; |
252b5132 | 3654 | #else |
abe6ac95 | 3655 | len += 8; |
252b5132 | 3656 | #endif |
abe6ac95 AM |
3657 | while (len > 0) |
3658 | { | |
3659 | print_space (); | |
3660 | --len; | |
57ceae94 AM |
3661 | } |
3662 | ||
abe6ac95 AM |
3663 | minfo (_("%W (size before relaxing)\n"), i->rawsize); |
3664 | } | |
252b5132 | 3665 | |
abe6ac95 AM |
3666 | if (i->output_section != NULL && i->output_section->owner == output_bfd) |
3667 | { | |
c0f00686 | 3668 | if (link_info.reduce_memory_overheads) |
abe6ac95 AM |
3669 | bfd_link_hash_traverse (link_info.hash, print_one_symbol, i); |
3670 | else | |
3671 | print_all_symbols (i); | |
3672 | ||
3673 | print_dot = addr + TO_ADDR (size); | |
252b5132 RH |
3674 | } |
3675 | } | |
3676 | ||
3677 | static void | |
1579bae1 | 3678 | print_fill_statement (lang_fill_statement_type *fill) |
252b5132 | 3679 | { |
2c382fb6 AM |
3680 | size_t size; |
3681 | unsigned char *p; | |
3682 | fputs (" FILL mask 0x", config.map_file); | |
3683 | for (p = fill->fill->data, size = fill->fill->size; size != 0; p++, size--) | |
3684 | fprintf (config.map_file, "%02x", *p); | |
3685 | fputs ("\n", config.map_file); | |
252b5132 RH |
3686 | } |
3687 | ||
3688 | static void | |
1579bae1 | 3689 | print_data_statement (lang_data_statement_type *data) |
252b5132 RH |
3690 | { |
3691 | int i; | |
3692 | bfd_vma addr; | |
3693 | bfd_size_type size; | |
3694 | const char *name; | |
3695 | ||
e5caa5e0 | 3696 | init_opb (); |
252b5132 RH |
3697 | for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++) |
3698 | print_space (); | |
3699 | ||
7fabd029 | 3700 | addr = data->output_offset; |
252b5132 RH |
3701 | if (data->output_section != NULL) |
3702 | addr += data->output_section->vma; | |
3703 | ||
3704 | switch (data->type) | |
3705 | { | |
3706 | default: | |
3707 | abort (); | |
3708 | case BYTE: | |
3709 | size = BYTE_SIZE; | |
3710 | name = "BYTE"; | |
3711 | break; | |
3712 | case SHORT: | |
3713 | size = SHORT_SIZE; | |
3714 | name = "SHORT"; | |
3715 | break; | |
3716 | case LONG: | |
3717 | size = LONG_SIZE; | |
3718 | name = "LONG"; | |
3719 | break; | |
3720 | case QUAD: | |
3721 | size = QUAD_SIZE; | |
3722 | name = "QUAD"; | |
3723 | break; | |
3724 | case SQUAD: | |
3725 | size = QUAD_SIZE; | |
3726 | name = "SQUAD"; | |
3727 | break; | |
3728 | } | |
3729 | ||
3730 | minfo ("0x%V %W %s 0x%v", addr, size, name, data->value); | |
3731 | ||
3732 | if (data->exp->type.node_class != etree_value) | |
3733 | { | |
3734 | print_space (); | |
3735 | exp_print_tree (data->exp); | |
3736 | } | |
3737 | ||
3738 | print_nl (); | |
3739 | ||
e5caa5e0 | 3740 | print_dot = addr + TO_ADDR (size); |
252b5132 RH |
3741 | } |
3742 | ||
3743 | /* Print an address statement. These are generated by options like | |
3744 | -Ttext. */ | |
3745 | ||
3746 | static void | |
1579bae1 | 3747 | print_address_statement (lang_address_statement_type *address) |
252b5132 RH |
3748 | { |
3749 | minfo (_("Address of section %s set to "), address->section_name); | |
3750 | exp_print_tree (address->address); | |
3751 | print_nl (); | |
3752 | } | |
3753 | ||
3754 | /* Print a reloc statement. */ | |
3755 | ||
3756 | static void | |
1579bae1 | 3757 | print_reloc_statement (lang_reloc_statement_type *reloc) |
252b5132 RH |
3758 | { |
3759 | int i; | |
3760 | bfd_vma addr; | |
3761 | bfd_size_type size; | |
3762 | ||
e5caa5e0 | 3763 | init_opb (); |
252b5132 RH |
3764 | for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++) |
3765 | print_space (); | |
3766 | ||
7fabd029 | 3767 | addr = reloc->output_offset; |
252b5132 RH |
3768 | if (reloc->output_section != NULL) |
3769 | addr += reloc->output_section->vma; | |
3770 | ||
3771 | size = bfd_get_reloc_size (reloc->howto); | |
3772 | ||
3773 | minfo ("0x%V %W RELOC %s ", addr, size, reloc->howto->name); | |
3774 | ||
3775 | if (reloc->name != NULL) | |
3776 | minfo ("%s+", reloc->name); | |
3777 | else | |
3778 | minfo ("%s+", reloc->section->name); | |
3779 | ||
3780 | exp_print_tree (reloc->addend_exp); | |
3781 | ||
3782 | print_nl (); | |
3783 | ||
e5caa5e0 | 3784 | print_dot = addr + TO_ADDR (size); |
5f992e62 | 3785 | } |
252b5132 RH |
3786 | |
3787 | static void | |
1579bae1 | 3788 | print_padding_statement (lang_padding_statement_type *s) |
252b5132 RH |
3789 | { |
3790 | int len; | |
3791 | bfd_vma addr; | |
3792 | ||
e5caa5e0 | 3793 | init_opb (); |
252b5132 RH |
3794 | minfo (" *fill*"); |
3795 | ||
3796 | len = sizeof " *fill*" - 1; | |
3797 | while (len < SECTION_NAME_MAP_LENGTH) | |
3798 | { | |
3799 | print_space (); | |
3800 | ++len; | |
3801 | } | |
3802 | ||
3803 | addr = s->output_offset; | |
3804 | if (s->output_section != NULL) | |
3805 | addr += s->output_section->vma; | |
5f9b8920 | 3806 | minfo ("0x%V %W ", addr, (bfd_vma) s->size); |
252b5132 | 3807 | |
2c382fb6 AM |
3808 | if (s->fill->size != 0) |
3809 | { | |
3810 | size_t size; | |
3811 | unsigned char *p; | |
3812 | for (p = s->fill->data, size = s->fill->size; size != 0; p++, size--) | |
3813 | fprintf (config.map_file, "%02x", *p); | |
3814 | } | |
252b5132 RH |
3815 | |
3816 | print_nl (); | |
3817 | ||
e5caa5e0 | 3818 | print_dot = addr + TO_ADDR (s->size); |
252b5132 RH |
3819 | } |
3820 | ||
3821 | static void | |
1579bae1 AM |
3822 | print_wild_statement (lang_wild_statement_type *w, |
3823 | lang_output_section_statement_type *os) | |
252b5132 | 3824 | { |
b6bf44ba AM |
3825 | struct wildcard_list *sec; |
3826 | ||
252b5132 RH |
3827 | print_space (); |
3828 | ||
3829 | if (w->filenames_sorted) | |
3830 | minfo ("SORT("); | |
08da4cac | 3831 | if (w->filename != NULL) |
252b5132 RH |
3832 | minfo ("%s", w->filename); |
3833 | else | |
3834 | minfo ("*"); | |
3835 | if (w->filenames_sorted) | |
3836 | minfo (")"); | |
3837 | ||
3838 | minfo ("("); | |
b6bf44ba AM |
3839 | for (sec = w->section_list; sec; sec = sec->next) |
3840 | { | |
3841 | if (sec->spec.sorted) | |
3842 | minfo ("SORT("); | |
3843 | if (sec->spec.exclude_name_list != NULL) | |
3844 | { | |
3845 | name_list *tmp; | |
34786259 | 3846 | minfo ("EXCLUDE_FILE(%s", sec->spec.exclude_name_list->name); |
b6bf44ba | 3847 | for (tmp = sec->spec.exclude_name_list->next; tmp; tmp = tmp->next) |
34786259 AM |
3848 | minfo (" %s", tmp->name); |
3849 | minfo (") "); | |
b6bf44ba AM |
3850 | } |
3851 | if (sec->spec.name != NULL) | |
3852 | minfo ("%s", sec->spec.name); | |
3853 | else | |
3854 | minfo ("*"); | |
3855 | if (sec->spec.sorted) | |
3856 | minfo (")"); | |
34786259 AM |
3857 | if (sec->next) |
3858 | minfo (" "); | |
b6bf44ba | 3859 | } |
252b5132 RH |
3860 | minfo (")"); |
3861 | ||
3862 | print_nl (); | |
3863 | ||
3864 | print_statement_list (w->children.head, os); | |
3865 | } | |
3866 | ||
3867 | /* Print a group statement. */ | |
3868 | ||
3869 | static void | |
1579bae1 AM |
3870 | print_group (lang_group_statement_type *s, |
3871 | lang_output_section_statement_type *os) | |
252b5132 RH |
3872 | { |
3873 | fprintf (config.map_file, "START GROUP\n"); | |
3874 | print_statement_list (s->children.head, os); | |
3875 | fprintf (config.map_file, "END GROUP\n"); | |
3876 | } | |
3877 | ||
3878 | /* Print the list of statements in S. | |
3879 | This can be called for any statement type. */ | |
3880 | ||
3881 | static void | |
1579bae1 AM |
3882 | print_statement_list (lang_statement_union_type *s, |
3883 | lang_output_section_statement_type *os) | |
252b5132 RH |
3884 | { |
3885 | while (s != NULL) | |
3886 | { | |
3887 | print_statement (s, os); | |
bba1a0c0 | 3888 | s = s->header.next; |
252b5132 RH |
3889 | } |
3890 | } | |
3891 | ||
3892 | /* Print the first statement in statement list S. | |
3893 | This can be called for any statement type. */ | |
3894 | ||
3895 | static void | |
1579bae1 AM |
3896 | print_statement (lang_statement_union_type *s, |
3897 | lang_output_section_statement_type *os) | |
252b5132 RH |
3898 | { |
3899 | switch (s->header.type) | |
3900 | { | |
3901 | default: | |
3902 | fprintf (config.map_file, _("Fail with %d\n"), s->header.type); | |
3903 | FAIL (); | |
3904 | break; | |
3905 | case lang_constructors_statement_enum: | |
3906 | if (constructor_list.head != NULL) | |
3907 | { | |
3908 | if (constructors_sorted) | |
3909 | minfo (" SORT (CONSTRUCTORS)\n"); | |
3910 | else | |
3911 | minfo (" CONSTRUCTORS\n"); | |
3912 | print_statement_list (constructor_list.head, os); | |
3913 | } | |
3914 | break; | |
3915 | case lang_wild_statement_enum: | |
3916 | print_wild_statement (&s->wild_statement, os); | |
3917 | break; | |
3918 | case lang_address_statement_enum: | |
3919 | print_address_statement (&s->address_statement); | |
3920 | break; | |
3921 | case lang_object_symbols_statement_enum: | |
3922 | minfo (" CREATE_OBJECT_SYMBOLS\n"); | |
3923 | break; | |
3924 | case lang_fill_statement_enum: | |
3925 | print_fill_statement (&s->fill_statement); | |
3926 | break; | |
3927 | case lang_data_statement_enum: | |
3928 | print_data_statement (&s->data_statement); | |
3929 | break; | |
3930 | case lang_reloc_statement_enum: | |
3931 | print_reloc_statement (&s->reloc_statement); | |
3932 | break; | |
3933 | case lang_input_section_enum: | |
4d4920ec | 3934 | print_input_section (s->input_section.section); |
252b5132 RH |
3935 | break; |
3936 | case lang_padding_statement_enum: | |
3937 | print_padding_statement (&s->padding_statement); | |
3938 | break; | |
3939 | case lang_output_section_statement_enum: | |
3940 | print_output_section_statement (&s->output_section_statement); | |
3941 | break; | |
3942 | case lang_assignment_statement_enum: | |
3943 | print_assignment (&s->assignment_statement, os); | |
3944 | break; | |
3945 | case lang_target_statement_enum: | |
3946 | fprintf (config.map_file, "TARGET(%s)\n", s->target_statement.target); | |
3947 | break; | |
3948 | case lang_output_statement_enum: | |
3949 | minfo ("OUTPUT(%s", s->output_statement.name); | |
3950 | if (output_target != NULL) | |
3951 | minfo (" %s", output_target); | |
3952 | minfo (")\n"); | |
3953 | break; | |
3954 | case lang_input_statement_enum: | |
3955 | print_input_statement (&s->input_statement); | |
3956 | break; | |
3957 | case lang_group_statement_enum: | |
3958 | print_group (&s->group_statement, os); | |
3959 | break; | |
3960 | case lang_afile_asection_pair_statement_enum: | |
3961 | FAIL (); | |
3962 | break; | |
3963 | } | |
3964 | } | |
3965 | ||
3966 | static void | |
1579bae1 | 3967 | print_statements (void) |
252b5132 RH |
3968 | { |
3969 | print_statement_list (statement_list.head, abs_output_section); | |
3970 | } | |
3971 | ||
3972 | /* Print the first N statements in statement list S to STDERR. | |
3973 | If N == 0, nothing is printed. | |
3974 | If N < 0, the entire list is printed. | |
3975 | Intended to be called from GDB. */ | |
3976 | ||
3977 | void | |
1579bae1 | 3978 | dprint_statement (lang_statement_union_type *s, int n) |
252b5132 RH |
3979 | { |
3980 | FILE *map_save = config.map_file; | |
3981 | ||
3982 | config.map_file = stderr; | |
3983 | ||
3984 | if (n < 0) | |
3985 | print_statement_list (s, abs_output_section); | |
3986 | else | |
3987 | { | |
3988 | while (s && --n >= 0) | |
3989 | { | |
3990 | print_statement (s, abs_output_section); | |
bba1a0c0 | 3991 | s = s->header.next; |
252b5132 RH |
3992 | } |
3993 | } | |
3994 | ||
3995 | config.map_file = map_save; | |
3996 | } | |
3997 | ||
b3327aad | 3998 | static void |
1579bae1 AM |
3999 | insert_pad (lang_statement_union_type **ptr, |
4000 | fill_type *fill, | |
4001 | unsigned int alignment_needed, | |
4002 | asection *output_section, | |
4003 | bfd_vma dot) | |
252b5132 | 4004 | { |
2c382fb6 | 4005 | static fill_type zero_fill = { 1, { 0 } }; |
e9ee469a | 4006 | lang_statement_union_type *pad = NULL; |
b3327aad | 4007 | |
e9ee469a AM |
4008 | if (ptr != &statement_list.head) |
4009 | pad = ((lang_statement_union_type *) | |
4010 | ((char *) ptr - offsetof (lang_statement_union_type, header.next))); | |
4011 | if (pad != NULL | |
4012 | && pad->header.type == lang_padding_statement_enum | |
4013 | && pad->padding_statement.output_section == output_section) | |
4014 | { | |
4015 | /* Use the existing pad statement. */ | |
4016 | } | |
4017 | else if ((pad = *ptr) != NULL | |
2af02257 | 4018 | && pad->header.type == lang_padding_statement_enum |
b3327aad | 4019 | && pad->padding_statement.output_section == output_section) |
252b5132 | 4020 | { |
e9ee469a | 4021 | /* Use the existing pad statement. */ |
252b5132 | 4022 | } |
b3327aad | 4023 | else |
252b5132 | 4024 | { |
b3327aad | 4025 | /* Make a new padding statement, linked into existing chain. */ |
1579bae1 | 4026 | pad = stat_alloc (sizeof (lang_padding_statement_type)); |
b3327aad AM |
4027 | pad->header.next = *ptr; |
4028 | *ptr = pad; | |
4029 | pad->header.type = lang_padding_statement_enum; | |
4030 | pad->padding_statement.output_section = output_section; | |
1579bae1 | 4031 | if (fill == NULL) |
2c382fb6 | 4032 | fill = &zero_fill; |
b3327aad | 4033 | pad->padding_statement.fill = fill; |
252b5132 | 4034 | } |
b3327aad AM |
4035 | pad->padding_statement.output_offset = dot - output_section->vma; |
4036 | pad->padding_statement.size = alignment_needed; | |
eea6121a | 4037 | output_section->size += alignment_needed; |
252b5132 RH |
4038 | } |
4039 | ||
08da4cac KH |
4040 | /* Work out how much this section will move the dot point. */ |
4041 | ||
252b5132 | 4042 | static bfd_vma |
6feb9908 AM |
4043 | size_input_section |
4044 | (lang_statement_union_type **this_ptr, | |
4045 | lang_output_section_statement_type *output_section_statement, | |
4046 | fill_type *fill, | |
4047 | bfd_vma dot) | |
252b5132 RH |
4048 | { |
4049 | lang_input_section_type *is = &((*this_ptr)->input_section); | |
4050 | asection *i = is->section; | |
4051 | ||
7b986e99 AM |
4052 | if (!((lang_input_statement_type *) i->owner->usrdata)->just_syms_flag |
4053 | && (i->flags & SEC_EXCLUDE) == 0) | |
252b5132 | 4054 | { |
b3327aad AM |
4055 | unsigned int alignment_needed; |
4056 | asection *o; | |
4057 | ||
4058 | /* Align this section first to the input sections requirement, | |
4059 | then to the output section's requirement. If this alignment | |
4060 | is greater than any seen before, then record it too. Perform | |
4061 | the alignment by inserting a magic 'padding' statement. */ | |
4062 | ||
252b5132 | 4063 | if (output_section_statement->subsection_alignment != -1) |
b3327aad AM |
4064 | i->alignment_power = output_section_statement->subsection_alignment; |
4065 | ||
4066 | o = output_section_statement->bfd_section; | |
4067 | if (o->alignment_power < i->alignment_power) | |
4068 | o->alignment_power = i->alignment_power; | |
252b5132 | 4069 | |
b3327aad AM |
4070 | alignment_needed = align_power (dot, i->alignment_power) - dot; |
4071 | ||
4072 | if (alignment_needed != 0) | |
4073 | { | |
e5caa5e0 | 4074 | insert_pad (this_ptr, fill, TO_SIZE (alignment_needed), o, dot); |
b3327aad AM |
4075 | dot += alignment_needed; |
4076 | } | |
252b5132 | 4077 | |
08da4cac | 4078 | /* Remember where in the output section this input section goes. */ |
252b5132 | 4079 | |
b3327aad | 4080 | i->output_offset = dot - o->vma; |
252b5132 | 4081 | |
08da4cac | 4082 | /* Mark how big the output section must be to contain this now. */ |
eea6121a AM |
4083 | dot += TO_ADDR (i->size); |
4084 | o->size = TO_SIZE (dot - o->vma); | |
252b5132 RH |
4085 | } |
4086 | else | |
4087 | { | |
4088 | i->output_offset = i->vma - output_section_statement->bfd_section->vma; | |
4089 | } | |
4090 | ||
4091 | return dot; | |
4092 | } | |
4093 | ||
5daa8fe7 L |
4094 | static int |
4095 | sort_sections_by_lma (const void *arg1, const void *arg2) | |
4096 | { | |
4097 | const asection *sec1 = *(const asection **) arg1; | |
4098 | const asection *sec2 = *(const asection **) arg2; | |
4099 | ||
4100 | if (bfd_section_lma (sec1->owner, sec1) | |
4101 | < bfd_section_lma (sec2->owner, sec2)) | |
4102 | return -1; | |
4103 | else if (bfd_section_lma (sec1->owner, sec1) | |
4104 | > bfd_section_lma (sec2->owner, sec2)) | |
4105 | return 1; | |
4106 | ||
4107 | return 0; | |
4108 | } | |
4109 | ||
eea6121a | 4110 | #define IGNORE_SECTION(s) \ |
afd7a018 AM |
4111 | ((s->flags & SEC_NEVER_LOAD) != 0 \ |
4112 | || (s->flags & SEC_ALLOC) == 0 \ | |
4113 | || ((s->flags & SEC_THREAD_LOCAL) != 0 \ | |
de7f8cc8 | 4114 | && (s->flags & SEC_LOAD) == 0)) |
d1778b88 | 4115 | |
252b5132 | 4116 | /* Check to see if any allocated sections overlap with other allocated |
afd7a018 AM |
4117 | sections. This can happen if a linker script specifies the output |
4118 | section addresses of the two sections. */ | |
08da4cac | 4119 | |
252b5132 | 4120 | static void |
1579bae1 | 4121 | lang_check_section_addresses (void) |
252b5132 | 4122 | { |
5daa8fe7 L |
4123 | asection *s, *os; |
4124 | asection **sections, **spp; | |
4125 | unsigned int count; | |
4126 | bfd_vma s_start; | |
4127 | bfd_vma s_end; | |
4128 | bfd_vma os_start; | |
4129 | bfd_vma os_end; | |
4130 | bfd_size_type amt; | |
4131 | ||
4132 | if (bfd_count_sections (output_bfd) <= 1) | |
4133 | return; | |
4134 | ||
4135 | amt = bfd_count_sections (output_bfd) * sizeof (asection *); | |
4136 | sections = xmalloc (amt); | |
252b5132 RH |
4137 | |
4138 | /* Scan all sections in the output list. */ | |
5daa8fe7 | 4139 | count = 0; |
252b5132 | 4140 | for (s = output_bfd->sections; s != NULL; s = s->next) |
33275c22 | 4141 | { |
5daa8fe7 | 4142 | /* Only consider loadable sections with real contents. */ |
de7f8cc8 | 4143 | if (IGNORE_SECTION (s) || s->size == 0) |
33275c22 | 4144 | continue; |
5f992e62 | 4145 | |
5daa8fe7 L |
4146 | sections[count] = s; |
4147 | count++; | |
4148 | } | |
329c1c86 | 4149 | |
5daa8fe7 L |
4150 | if (count <= 1) |
4151 | return; | |
5f992e62 | 4152 | |
5daa8fe7 L |
4153 | qsort (sections, (size_t) count, sizeof (asection *), |
4154 | sort_sections_by_lma); | |
5f992e62 | 4155 | |
5daa8fe7 L |
4156 | spp = sections; |
4157 | s = *spp++; | |
4158 | s_start = bfd_section_lma (output_bfd, s); | |
4159 | s_end = s_start + TO_ADDR (s->size) - 1; | |
4160 | for (count--; count; count--) | |
4161 | { | |
4162 | /* We must check the sections' LMA addresses not their VMA | |
4163 | addresses because overlay sections can have overlapping VMAs | |
4164 | but they must have distinct LMAs. */ | |
4165 | os = s; | |
329c1c86 | 4166 | os_start = s_start; |
5daa8fe7 L |
4167 | os_end = s_end; |
4168 | s = *spp++; | |
4169 | s_start = bfd_section_lma (output_bfd, s); | |
4170 | s_end = s_start + TO_ADDR (s->size) - 1; | |
5f992e62 | 4171 | |
5daa8fe7 L |
4172 | /* Look for an overlap. */ |
4173 | if (s_end >= os_start && s_start <= os_end) | |
4174 | einfo (_("%X%P: section %s [%V -> %V] overlaps section %s [%V -> %V]\n"), | |
4175 | s->name, s_start, s_end, os->name, os_start, os_end); | |
33275c22 | 4176 | } |
5daa8fe7 L |
4177 | |
4178 | free (sections); | |
252b5132 RH |
4179 | } |
4180 | ||
562d3460 TW |
4181 | /* Make sure the new address is within the region. We explicitly permit the |
4182 | current address to be at the exact end of the region when the address is | |
4183 | non-zero, in case the region is at the end of addressable memory and the | |
5f992e62 | 4184 | calculation wraps around. */ |
562d3460 TW |
4185 | |
4186 | static void | |
1579bae1 | 4187 | os_region_check (lang_output_section_statement_type *os, |
6bdafbeb | 4188 | lang_memory_region_type *region, |
1579bae1 AM |
4189 | etree_type *tree, |
4190 | bfd_vma base) | |
562d3460 TW |
4191 | { |
4192 | if ((region->current < region->origin | |
4193 | || (region->current - region->origin > region->length)) | |
4194 | && ((region->current != region->origin + region->length) | |
b7a26f91 | 4195 | || base == 0)) |
562d3460 | 4196 | { |
1579bae1 | 4197 | if (tree != NULL) |
b7a26f91 | 4198 | { |
6feb9908 AM |
4199 | einfo (_("%X%P: address 0x%v of %B section %s" |
4200 | " is not within region %s\n"), | |
b7a26f91 KH |
4201 | region->current, |
4202 | os->bfd_section->owner, | |
4203 | os->bfd_section->name, | |
4204 | region->name); | |
4205 | } | |
562d3460 | 4206 | else |
b7a26f91 KH |
4207 | { |
4208 | einfo (_("%X%P: region %s is full (%B section %s)\n"), | |
4209 | region->name, | |
4210 | os->bfd_section->owner, | |
4211 | os->bfd_section->name); | |
4212 | } | |
562d3460 TW |
4213 | /* Reset the region pointer. */ |
4214 | region->current = region->origin; | |
4215 | } | |
4216 | } | |
4217 | ||
252b5132 RH |
4218 | /* Set the sizes for all the output sections. */ |
4219 | ||
2d20f7bf | 4220 | static bfd_vma |
1579bae1 AM |
4221 | lang_size_sections_1 |
4222 | (lang_statement_union_type *s, | |
4223 | lang_output_section_statement_type *output_section_statement, | |
4224 | lang_statement_union_type **prev, | |
4225 | fill_type *fill, | |
4226 | bfd_vma dot, | |
4227 | bfd_boolean *relax, | |
4228 | bfd_boolean check_regions) | |
252b5132 RH |
4229 | { |
4230 | /* Size up the sections from their constituent parts. */ | |
1579bae1 | 4231 | for (; s != NULL; s = s->header.next) |
252b5132 RH |
4232 | { |
4233 | switch (s->header.type) | |
4234 | { | |
4235 | case lang_output_section_statement_enum: | |
4236 | { | |
e9ee469a | 4237 | bfd_vma newdot, after; |
d1778b88 | 4238 | lang_output_section_statement_type *os; |
cde9e0be | 4239 | lang_memory_region_type *r; |
252b5132 | 4240 | |
d1778b88 | 4241 | os = &s->output_section_statement; |
a5df8c84 AM |
4242 | if (os->addr_tree != NULL) |
4243 | { | |
cde9e0be | 4244 | os->processed_vma = FALSE; |
a5df8c84 | 4245 | exp_fold_tree (os->addr_tree, bfd_abs_section_ptr, &dot); |
a5df8c84 | 4246 | |
3bf9618b AM |
4247 | if (expld.result.valid_p) |
4248 | dot = expld.result.value + expld.result.section->vma; | |
4249 | else if (expld.phase != lang_mark_phase_enum) | |
a5df8c84 AM |
4250 | einfo (_("%F%S: non constant or forward reference" |
4251 | " address expression for section %s\n"), | |
4252 | os->name); | |
a5df8c84 AM |
4253 | } |
4254 | ||
e9ee469a | 4255 | if (os->bfd_section == NULL) |
75ff4589 | 4256 | /* This section was removed or never actually created. */ |
252b5132 RH |
4257 | break; |
4258 | ||
4259 | /* If this is a COFF shared library section, use the size and | |
4260 | address from the input section. FIXME: This is COFF | |
4261 | specific; it would be cleaner if there were some other way | |
4262 | to do this, but nothing simple comes to mind. */ | |
ebe372c1 L |
4263 | if ((bfd_get_flavour (output_bfd) == bfd_target_ecoff_flavour |
4264 | || bfd_get_flavour (output_bfd) == bfd_target_coff_flavour) | |
4265 | && (os->bfd_section->flags & SEC_COFF_SHARED_LIBRARY) != 0) | |
252b5132 | 4266 | { |
08da4cac | 4267 | asection *input; |
252b5132 RH |
4268 | |
4269 | if (os->children.head == NULL | |
bba1a0c0 | 4270 | || os->children.head->header.next != NULL |
6feb9908 AM |
4271 | || (os->children.head->header.type |
4272 | != lang_input_section_enum)) | |
4273 | einfo (_("%P%X: Internal error on COFF shared library" | |
4274 | " section %s\n"), os->name); | |
252b5132 RH |
4275 | |
4276 | input = os->children.head->input_section.section; | |
4277 | bfd_set_section_vma (os->bfd_section->owner, | |
4278 | os->bfd_section, | |
4279 | bfd_section_vma (input->owner, input)); | |
eea6121a | 4280 | os->bfd_section->size = input->size; |
252b5132 RH |
4281 | break; |
4282 | } | |
4283 | ||
a5df8c84 | 4284 | newdot = dot; |
252b5132 RH |
4285 | if (bfd_is_abs_section (os->bfd_section)) |
4286 | { | |
4287 | /* No matter what happens, an abs section starts at zero. */ | |
4288 | ASSERT (os->bfd_section->vma == 0); | |
4289 | } | |
4290 | else | |
4291 | { | |
94b50910 | 4292 | int align; |
7270c5ed | 4293 | |
1579bae1 | 4294 | if (os->addr_tree == NULL) |
252b5132 RH |
4295 | { |
4296 | /* No address specified for this section, get one | |
4297 | from the region specification. */ | |
1579bae1 | 4298 | if (os->region == NULL |
6feb9908 | 4299 | || ((os->bfd_section->flags & (SEC_ALLOC | SEC_LOAD)) |
252b5132 | 4300 | && os->region->name[0] == '*' |
6feb9908 AM |
4301 | && strcmp (os->region->name, |
4302 | DEFAULT_MEMORY_REGION) == 0)) | |
252b5132 RH |
4303 | { |
4304 | os->region = lang_memory_default (os->bfd_section); | |
4305 | } | |
4306 | ||
4307 | /* If a loadable section is using the default memory | |
4308 | region, and some non default memory regions were | |
66184979 | 4309 | defined, issue an error message. */ |
f0636a44 AM |
4310 | if (!os->ignored |
4311 | && !IGNORE_SECTION (os->bfd_section) | |
1049f94e | 4312 | && ! link_info.relocatable |
cf888e70 | 4313 | && check_regions |
6feb9908 AM |
4314 | && strcmp (os->region->name, |
4315 | DEFAULT_MEMORY_REGION) == 0 | |
252b5132 | 4316 | && lang_memory_region_list != NULL |
d1778b88 | 4317 | && (strcmp (lang_memory_region_list->name, |
a747ee4d | 4318 | DEFAULT_MEMORY_REGION) != 0 |
e9ee469a AM |
4319 | || lang_memory_region_list->next != NULL) |
4320 | && expld.phase != lang_mark_phase_enum) | |
66184979 NC |
4321 | { |
4322 | /* By default this is an error rather than just a | |
4323 | warning because if we allocate the section to the | |
4324 | default memory region we can end up creating an | |
07f3b6ad KH |
4325 | excessively large binary, or even seg faulting when |
4326 | attempting to perform a negative seek. See | |
6feb9908 | 4327 | sources.redhat.com/ml/binutils/2003-04/msg00423.html |
66184979 NC |
4328 | for an example of this. This behaviour can be |
4329 | overridden by the using the --no-check-sections | |
4330 | switch. */ | |
4331 | if (command_line.check_section_addresses) | |
6feb9908 AM |
4332 | einfo (_("%P%F: error: no memory region specified" |
4333 | " for loadable section `%s'\n"), | |
66184979 NC |
4334 | bfd_get_section_name (output_bfd, |
4335 | os->bfd_section)); | |
4336 | else | |
6feb9908 AM |
4337 | einfo (_("%P: warning: no memory region specified" |
4338 | " for loadable section `%s'\n"), | |
66184979 NC |
4339 | bfd_get_section_name (output_bfd, |
4340 | os->bfd_section)); | |
4341 | } | |
252b5132 | 4342 | |
e9ee469a | 4343 | newdot = os->region->current; |
94b50910 | 4344 | align = os->bfd_section->alignment_power; |
252b5132 | 4345 | } |
94b50910 AM |
4346 | else |
4347 | align = os->section_alignment; | |
5f992e62 | 4348 | |
7270c5ed | 4349 | /* Align to what the section needs. */ |
94b50910 AM |
4350 | if (align > 0) |
4351 | { | |
4352 | bfd_vma savedot = newdot; | |
4353 | newdot = align_power (newdot, align); | |
252b5132 | 4354 | |
94b50910 AM |
4355 | if (newdot != savedot |
4356 | && (config.warn_section_align | |
4357 | || os->addr_tree != NULL) | |
4358 | && expld.phase != lang_mark_phase_enum) | |
4359 | einfo (_("%P: warning: changing start of section" | |
4360 | " %s by %lu bytes\n"), | |
4361 | os->name, (unsigned long) (newdot - savedot)); | |
4362 | } | |
252b5132 | 4363 | |
e9ee469a | 4364 | bfd_set_section_vma (0, os->bfd_section, newdot); |
5f992e62 | 4365 | |
252b5132 RH |
4366 | os->bfd_section->output_offset = 0; |
4367 | } | |
4368 | ||
2d20f7bf | 4369 | lang_size_sections_1 (os->children.head, os, &os->children.head, |
e9ee469a AM |
4370 | os->fill, newdot, relax, check_regions); |
4371 | ||
cde9e0be | 4372 | os->processed_vma = TRUE; |
e9ee469a AM |
4373 | |
4374 | if (bfd_is_abs_section (os->bfd_section) || os->ignored) | |
2f475487 AM |
4375 | /* Except for some special linker created sections, |
4376 | no output section should change from zero size | |
4377 | after strip_excluded_output_sections. A non-zero | |
4378 | size on an ignored section indicates that some | |
4379 | input section was not sized early enough. */ | |
4380 | ASSERT (os->bfd_section->size == 0); | |
cde9e0be | 4381 | else |
e9ee469a | 4382 | { |
cde9e0be AM |
4383 | dot = os->bfd_section->vma; |
4384 | ||
4385 | /* Put the section within the requested block size, or | |
4386 | align at the block boundary. */ | |
4387 | after = ((dot | |
4388 | + TO_ADDR (os->bfd_section->size) | |
4389 | + os->block_value - 1) | |
4390 | & - (bfd_vma) os->block_value); | |
4391 | ||
4392 | os->bfd_section->size = TO_SIZE (after - os->bfd_section->vma); | |
4393 | } | |
4394 | ||
4395 | /* Set section lma. */ | |
4396 | r = os->region; | |
4397 | if (r == NULL) | |
4398 | r = lang_memory_region_lookup (DEFAULT_MEMORY_REGION, FALSE); | |
4399 | ||
4400 | if (os->load_base) | |
4401 | { | |
4402 | bfd_vma lma = exp_get_abs_int (os->load_base, 0, "load base"); | |
4403 | os->bfd_section->lma = lma; | |
e9ee469a | 4404 | } |
cde9e0be AM |
4405 | else if (os->region != NULL |
4406 | && os->lma_region != NULL | |
4407 | && os->lma_region != os->region) | |
4408 | { | |
4409 | bfd_vma lma = os->lma_region->current; | |
e9ee469a | 4410 | |
cde9e0be AM |
4411 | if (os->section_alignment != -1) |
4412 | lma = align_power (lma, os->section_alignment); | |
4413 | os->bfd_section->lma = lma; | |
4414 | } | |
dc0b6aa0 AM |
4415 | else if (r->last_os != NULL |
4416 | && (os->bfd_section->flags & SEC_ALLOC) != 0) | |
cde9e0be AM |
4417 | { |
4418 | bfd_vma lma; | |
4419 | asection *last; | |
4420 | ||
4421 | last = r->last_os->output_section_statement.bfd_section; | |
dc0b6aa0 AM |
4422 | |
4423 | /* A backwards move of dot should be accompanied by | |
4424 | an explicit assignment to the section LMA (ie. | |
91eb6c46 | 4425 | os->load_base set) because backwards moves can |
dc0b6aa0 | 4426 | create overlapping LMAs. */ |
264b6205 | 4427 | if (dot < last->vma |
91eb6c46 AM |
4428 | && os->bfd_section->size != 0 |
4429 | && dot + os->bfd_section->size <= last->vma) | |
dc0b6aa0 | 4430 | { |
dc0b6aa0 AM |
4431 | /* If dot moved backwards then leave lma equal to |
4432 | vma. This is the old default lma, which might | |
4433 | just happen to work when the backwards move is | |
91eb6c46 AM |
4434 | sufficiently large. Nag if this changes anything, |
4435 | so people can fix their linker scripts. */ | |
4436 | ||
4437 | if (last->vma != last->lma) | |
4438 | einfo (_("%P: warning: dot moved backwards before `%s'\n"), | |
4439 | os->name); | |
dc0b6aa0 AM |
4440 | } |
4441 | else | |
cde9e0be | 4442 | { |
152d792f AM |
4443 | /* If this is an overlay, set the current lma to that |
4444 | at the end of the previous section. */ | |
4445 | if (os->sectype == overlay_section) | |
cde9e0be AM |
4446 | lma = last->lma + last->size; |
4447 | ||
4448 | /* Otherwise, keep the same lma to vma relationship | |
4449 | as the previous section. */ | |
4450 | else | |
4451 | lma = dot + last->lma - last->vma; | |
4452 | ||
4453 | if (os->section_alignment != -1) | |
4454 | lma = align_power (lma, os->section_alignment); | |
4455 | os->bfd_section->lma = lma; | |
4456 | } | |
4457 | } | |
4458 | os->processed_lma = TRUE; | |
5f992e62 | 4459 | |
cde9e0be AM |
4460 | if (bfd_is_abs_section (os->bfd_section) || os->ignored) |
4461 | break; | |
252b5132 | 4462 | |
cde9e0be AM |
4463 | /* Keep track of normal sections using the default |
4464 | lma region. We use this to set the lma for | |
4465 | following sections. Overlays or other linker | |
4466 | script assignment to lma might mean that the | |
dc0b6aa0 AM |
4467 | default lma == vma is incorrect. |
4468 | To avoid warnings about dot moving backwards when using | |
4469 | -Ttext, don't start tracking sections until we find one | |
4470 | of non-zero size or with lma set differently to vma. */ | |
cde9e0be AM |
4471 | if (((os->bfd_section->flags & SEC_HAS_CONTENTS) != 0 |
4472 | || (os->bfd_section->flags & SEC_THREAD_LOCAL) == 0) | |
dc0b6aa0 AM |
4473 | && (os->bfd_section->flags & SEC_ALLOC) != 0 |
4474 | && (os->bfd_section->size != 0 | |
264b6205 AM |
4475 | || (r->last_os == NULL |
4476 | && os->bfd_section->vma != os->bfd_section->lma) | |
4477 | || (r->last_os != NULL | |
4478 | && dot >= (r->last_os->output_section_statement | |
ea0c3cd5 | 4479 | .bfd_section->vma))) |
cde9e0be AM |
4480 | && os->lma_region == NULL |
4481 | && !link_info.relocatable) | |
4482 | r->last_os = s; | |
9f88b410 | 4483 | |
e5caec89 NS |
4484 | /* .tbss sections effectively have zero size. */ |
4485 | if ((os->bfd_section->flags & SEC_HAS_CONTENTS) != 0 | |
4486 | || (os->bfd_section->flags & SEC_THREAD_LOCAL) == 0 | |
4487 | || link_info.relocatable) | |
eea6121a | 4488 | dot += TO_ADDR (os->bfd_section->size); |
e5caec89 | 4489 | |
9f88b410 | 4490 | if (os->update_dot_tree != 0) |
e9ee469a | 4491 | exp_fold_tree (os->update_dot_tree, bfd_abs_section_ptr, &dot); |
9f88b410 | 4492 | |
252b5132 RH |
4493 | /* Update dot in the region ? |
4494 | We only do this if the section is going to be allocated, | |
4495 | since unallocated sections do not contribute to the region's | |
13392b77 | 4496 | overall size in memory. |
5f992e62 | 4497 | |
cce4c4c5 NC |
4498 | If the SEC_NEVER_LOAD bit is not set, it will affect the |
4499 | addresses of sections after it. We have to update | |
4500 | dot. */ | |
1579bae1 | 4501 | if (os->region != NULL |
6feb9908 AM |
4502 | && ((os->bfd_section->flags & SEC_NEVER_LOAD) == 0 |
4503 | || (os->bfd_section->flags & (SEC_ALLOC | SEC_LOAD)))) | |
252b5132 RH |
4504 | { |
4505 | os->region->current = dot; | |
5f992e62 | 4506 | |
cf888e70 NC |
4507 | if (check_regions) |
4508 | /* Make sure the new address is within the region. */ | |
4509 | os_region_check (os, os->region, os->addr_tree, | |
4510 | os->bfd_section->vma); | |
08da4cac | 4511 | |
ee3cc2e2 | 4512 | if (os->lma_region != NULL && os->lma_region != os->region) |
08da4cac | 4513 | { |
cde9e0be AM |
4514 | os->lma_region->current |
4515 | = os->bfd_section->lma + TO_ADDR (os->bfd_section->size); | |
66e28d60 | 4516 | |
cf888e70 NC |
4517 | if (check_regions) |
4518 | os_region_check (os, os->lma_region, NULL, | |
cde9e0be | 4519 | os->bfd_section->lma); |
08da4cac | 4520 | } |
252b5132 RH |
4521 | } |
4522 | } | |
4523 | break; | |
4524 | ||
4525 | case lang_constructors_statement_enum: | |
2d20f7bf JJ |
4526 | dot = lang_size_sections_1 (constructor_list.head, |
4527 | output_section_statement, | |
4528 | &s->wild_statement.children.head, | |
cf888e70 | 4529 | fill, dot, relax, check_regions); |
252b5132 RH |
4530 | break; |
4531 | ||
4532 | case lang_data_statement_enum: | |
4533 | { | |
4534 | unsigned int size = 0; | |
4535 | ||
7fabd029 | 4536 | s->data_statement.output_offset = |
08da4cac | 4537 | dot - output_section_statement->bfd_section->vma; |
252b5132 RH |
4538 | s->data_statement.output_section = |
4539 | output_section_statement->bfd_section; | |
4540 | ||
1b493742 NS |
4541 | /* We might refer to provided symbols in the expression, and |
4542 | need to mark them as needed. */ | |
e9ee469a | 4543 | exp_fold_tree (s->data_statement.exp, bfd_abs_section_ptr, &dot); |
1b493742 | 4544 | |
252b5132 RH |
4545 | switch (s->data_statement.type) |
4546 | { | |
08da4cac KH |
4547 | default: |
4548 | abort (); | |
252b5132 RH |
4549 | case QUAD: |
4550 | case SQUAD: | |
4551 | size = QUAD_SIZE; | |
4552 | break; | |
4553 | case LONG: | |
4554 | size = LONG_SIZE; | |
4555 | break; | |
4556 | case SHORT: | |
4557 | size = SHORT_SIZE; | |
4558 | break; | |
4559 | case BYTE: | |
4560 | size = BYTE_SIZE; | |
4561 | break; | |
4562 | } | |
e5caa5e0 AM |
4563 | if (size < TO_SIZE ((unsigned) 1)) |
4564 | size = TO_SIZE ((unsigned) 1); | |
4565 | dot += TO_ADDR (size); | |
eea6121a | 4566 | output_section_statement->bfd_section->size += size; |
252b5132 RH |
4567 | } |
4568 | break; | |
4569 | ||
4570 | case lang_reloc_statement_enum: | |
4571 | { | |
4572 | int size; | |
4573 | ||
7fabd029 | 4574 | s->reloc_statement.output_offset = |
252b5132 RH |
4575 | dot - output_section_statement->bfd_section->vma; |
4576 | s->reloc_statement.output_section = | |
4577 | output_section_statement->bfd_section; | |
4578 | size = bfd_get_reloc_size (s->reloc_statement.howto); | |
e5caa5e0 | 4579 | dot += TO_ADDR (size); |
eea6121a | 4580 | output_section_statement->bfd_section->size += size; |
252b5132 RH |
4581 | } |
4582 | break; | |
5f992e62 | 4583 | |
252b5132 | 4584 | case lang_wild_statement_enum: |
2d20f7bf JJ |
4585 | dot = lang_size_sections_1 (s->wild_statement.children.head, |
4586 | output_section_statement, | |
4587 | &s->wild_statement.children.head, | |
cf888e70 | 4588 | fill, dot, relax, check_regions); |
252b5132 RH |
4589 | break; |
4590 | ||
4591 | case lang_object_symbols_statement_enum: | |
4592 | link_info.create_object_symbols_section = | |
4593 | output_section_statement->bfd_section; | |
4594 | break; | |
e9ee469a | 4595 | |
252b5132 RH |
4596 | case lang_output_statement_enum: |
4597 | case lang_target_statement_enum: | |
4598 | break; | |
e9ee469a | 4599 | |
252b5132 RH |
4600 | case lang_input_section_enum: |
4601 | { | |
4602 | asection *i; | |
4603 | ||
4604 | i = (*prev)->input_section.section; | |
eea6121a | 4605 | if (relax) |
252b5132 | 4606 | { |
b34976b6 | 4607 | bfd_boolean again; |
252b5132 RH |
4608 | |
4609 | if (! bfd_relax_section (i->owner, i, &link_info, &again)) | |
4610 | einfo (_("%P%F: can't relax section: %E\n")); | |
4611 | if (again) | |
b34976b6 | 4612 | *relax = TRUE; |
252b5132 | 4613 | } |
b3327aad AM |
4614 | dot = size_input_section (prev, output_section_statement, |
4615 | output_section_statement->fill, dot); | |
252b5132 RH |
4616 | } |
4617 | break; | |
e9ee469a | 4618 | |
252b5132 RH |
4619 | case lang_input_statement_enum: |
4620 | break; | |
e9ee469a | 4621 | |
252b5132 | 4622 | case lang_fill_statement_enum: |
08da4cac KH |
4623 | s->fill_statement.output_section = |
4624 | output_section_statement->bfd_section; | |
252b5132 RH |
4625 | |
4626 | fill = s->fill_statement.fill; | |
4627 | break; | |
e9ee469a | 4628 | |
252b5132 RH |
4629 | case lang_assignment_statement_enum: |
4630 | { | |
4631 | bfd_vma newdot = dot; | |
49c13adb | 4632 | etree_type *tree = s->assignment_statement.exp; |
252b5132 | 4633 | |
49c13adb | 4634 | exp_fold_tree (tree, |
408082ec | 4635 | output_section_statement->bfd_section, |
252b5132 RH |
4636 | &newdot); |
4637 | ||
49c13adb | 4638 | /* This symbol is relative to this section. */ |
a14a5de3 | 4639 | if ((tree->type.node_class == etree_provided |
49c13adb L |
4640 | || tree->type.node_class == etree_assign) |
4641 | && (tree->assign.dst [0] != '.' | |
4642 | || tree->assign.dst [1] != '\0')) | |
4643 | output_section_statement->section_relative_symbol = 1; | |
4644 | ||
85852e36 | 4645 | if (!output_section_statement->ignored) |
252b5132 | 4646 | { |
252b5132 RH |
4647 | if (output_section_statement == abs_output_section) |
4648 | { | |
4649 | /* If we don't have an output section, then just adjust | |
4650 | the default memory address. */ | |
6feb9908 AM |
4651 | lang_memory_region_lookup (DEFAULT_MEMORY_REGION, |
4652 | FALSE)->current = newdot; | |
252b5132 | 4653 | } |
85852e36 | 4654 | else if (newdot != dot) |
252b5132 | 4655 | { |
b3327aad AM |
4656 | /* Insert a pad after this statement. We can't |
4657 | put the pad before when relaxing, in case the | |
4658 | assignment references dot. */ | |
e5caa5e0 | 4659 | insert_pad (&s->header.next, fill, TO_SIZE (newdot - dot), |
b3327aad AM |
4660 | output_section_statement->bfd_section, dot); |
4661 | ||
4662 | /* Don't neuter the pad below when relaxing. */ | |
4663 | s = s->header.next; | |
9dfc8ab2 | 4664 | |
e9ee469a AM |
4665 | /* If dot is advanced, this implies that the section |
4666 | should have space allocated to it, unless the | |
4667 | user has explicitly stated that the section | |
4668 | should never be loaded. */ | |
4669 | if (!(output_section_statement->flags | |
4670 | & (SEC_NEVER_LOAD | SEC_ALLOC))) | |
4671 | output_section_statement->bfd_section->flags |= SEC_ALLOC; | |
4672 | } | |
252b5132 RH |
4673 | dot = newdot; |
4674 | } | |
4675 | } | |
4676 | break; | |
4677 | ||
4678 | case lang_padding_statement_enum: | |
c0c330a7 AM |
4679 | /* If this is the first time lang_size_sections is called, |
4680 | we won't have any padding statements. If this is the | |
4681 | second or later passes when relaxing, we should allow | |
4682 | padding to shrink. If padding is needed on this pass, it | |
4683 | will be added back in. */ | |
4684 | s->padding_statement.size = 0; | |
6e814ff8 AM |
4685 | |
4686 | /* Make sure output_offset is valid. If relaxation shrinks | |
4687 | the section and this pad isn't needed, it's possible to | |
4688 | have output_offset larger than the final size of the | |
4689 | section. bfd_set_section_contents will complain even for | |
4690 | a pad size of zero. */ | |
4691 | s->padding_statement.output_offset | |
4692 | = dot - output_section_statement->bfd_section->vma; | |
252b5132 RH |
4693 | break; |
4694 | ||
4695 | case lang_group_statement_enum: | |
2d20f7bf JJ |
4696 | dot = lang_size_sections_1 (s->group_statement.children.head, |
4697 | output_section_statement, | |
4698 | &s->group_statement.children.head, | |
cf888e70 | 4699 | fill, dot, relax, check_regions); |
252b5132 RH |
4700 | break; |
4701 | ||
4702 | default: | |
4703 | FAIL (); | |
4704 | break; | |
4705 | ||
c0c330a7 | 4706 | /* We can only get here when relaxing is turned on. */ |
252b5132 RH |
4707 | case lang_address_statement_enum: |
4708 | break; | |
4709 | } | |
4710 | prev = &s->header.next; | |
4711 | } | |
4712 | return dot; | |
4713 | } | |
4714 | ||
591a748a NC |
4715 | /* Callback routine that is used in _bfd_elf_map_sections_to_segments. |
4716 | The BFD library has set NEW_SEGMENT to TRUE iff it thinks that | |
4717 | CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different | |
4718 | segments. We are allowed an opportunity to override this decision. */ | |
2889e75b NC |
4719 | |
4720 | bfd_boolean | |
4721 | ldlang_override_segment_assignment (struct bfd_link_info * info ATTRIBUTE_UNUSED, | |
4722 | bfd * abfd ATTRIBUTE_UNUSED, | |
4723 | asection * current_section, | |
4724 | asection * previous_section, | |
4725 | bfd_boolean new_segment) | |
4726 | { | |
4727 | lang_output_section_statement_type * cur; | |
4728 | lang_output_section_statement_type * prev; | |
591a748a NC |
4729 | |
4730 | /* The checks below are only necessary when the BFD library has decided | |
4731 | that the two sections ought to be placed into the same segment. */ | |
2889e75b NC |
4732 | if (new_segment) |
4733 | return TRUE; | |
4734 | ||
4735 | /* Paranoia checks. */ | |
4736 | if (current_section == NULL || previous_section == NULL) | |
4737 | return new_segment; | |
4738 | ||
4739 | /* Find the memory regions associated with the two sections. | |
4740 | We call lang_output_section_find() here rather than scanning the list | |
4741 | of output sections looking for a matching section pointer because if | |
591a748a | 4742 | we have a large number of sections then a hash lookup is faster. */ |
2889e75b NC |
4743 | cur = lang_output_section_find (current_section->name); |
4744 | prev = lang_output_section_find (previous_section->name); | |
4745 | ||
591a748a | 4746 | /* More paranoia. */ |
2889e75b NC |
4747 | if (cur == NULL || prev == NULL) |
4748 | return new_segment; | |
4749 | ||
4750 | /* If the regions are different then force the sections to live in | |
591a748a NC |
4751 | different segments. See the email thread starting at the following |
4752 | URL for the reasons why this is necessary: | |
2889e75b NC |
4753 | http://sourceware.org/ml/binutils/2007-02/msg00216.html */ |
4754 | return cur->region != prev->region; | |
4755 | } | |
4756 | ||
e9ee469a AM |
4757 | void |
4758 | one_lang_size_sections_pass (bfd_boolean *relax, bfd_boolean check_regions) | |
2d20f7bf | 4759 | { |
420e579c | 4760 | lang_statement_iteration++; |
e9ee469a AM |
4761 | lang_size_sections_1 (statement_list.head, abs_output_section, |
4762 | &statement_list.head, 0, 0, relax, check_regions); | |
4763 | } | |
420e579c | 4764 | |
e9ee469a AM |
4765 | void |
4766 | lang_size_sections (bfd_boolean *relax, bfd_boolean check_regions) | |
4767 | { | |
4768 | expld.phase = lang_allocating_phase_enum; | |
4769 | expld.dataseg.phase = exp_dataseg_none; | |
4770 | ||
4771 | one_lang_size_sections_pass (relax, check_regions); | |
4772 | if (expld.dataseg.phase == exp_dataseg_end_seen | |
4773 | && link_info.relro && expld.dataseg.relro_end) | |
8c37241b JJ |
4774 | { |
4775 | /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try | |
e9ee469a | 4776 | to put expld.dataseg.relro on a (common) page boundary. */ |
e3070fef | 4777 | bfd_vma old_min_base, relro_end, maxpage; |
8c37241b | 4778 | |
e9ee469a AM |
4779 | expld.dataseg.phase = exp_dataseg_relro_adjust; |
4780 | old_min_base = expld.dataseg.min_base; | |
4781 | maxpage = expld.dataseg.maxpagesize; | |
4782 | expld.dataseg.base += (-expld.dataseg.relro_end | |
4783 | & (expld.dataseg.pagesize - 1)); | |
a4f5ad88 | 4784 | /* Compute the expected PT_GNU_RELRO segment end. */ |
e9ee469a AM |
4785 | relro_end = (expld.dataseg.relro_end + expld.dataseg.pagesize - 1) |
4786 | & ~(expld.dataseg.pagesize - 1); | |
4787 | if (old_min_base + maxpage < expld.dataseg.base) | |
e3070fef | 4788 | { |
e9ee469a | 4789 | expld.dataseg.base -= maxpage; |
e3070fef JJ |
4790 | relro_end -= maxpage; |
4791 | } | |
f86a8756 | 4792 | lang_reset_memory_regions (); |
e9ee469a AM |
4793 | one_lang_size_sections_pass (relax, check_regions); |
4794 | if (expld.dataseg.relro_end > relro_end) | |
a4f5ad88 JJ |
4795 | { |
4796 | /* The alignment of sections between DATA_SEGMENT_ALIGN | |
4797 | and DATA_SEGMENT_RELRO_END caused huge padding to be | |
4798 | inserted at DATA_SEGMENT_RELRO_END. Try some other base. */ | |
4799 | asection *sec; | |
4800 | unsigned int max_alignment_power = 0; | |
4801 | ||
4802 | /* Find maximum alignment power of sections between | |
4803 | DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */ | |
4804 | for (sec = output_bfd->sections; sec; sec = sec->next) | |
e9ee469a AM |
4805 | if (sec->vma >= expld.dataseg.base |
4806 | && sec->vma < expld.dataseg.relro_end | |
a4f5ad88 JJ |
4807 | && sec->alignment_power > max_alignment_power) |
4808 | max_alignment_power = sec->alignment_power; | |
4809 | ||
e9ee469a | 4810 | if (((bfd_vma) 1 << max_alignment_power) < expld.dataseg.pagesize) |
a4f5ad88 | 4811 | { |
e9ee469a | 4812 | if (expld.dataseg.base - (1 << max_alignment_power) |
e3070fef | 4813 | < old_min_base) |
e9ee469a AM |
4814 | expld.dataseg.base += expld.dataseg.pagesize; |
4815 | expld.dataseg.base -= (1 << max_alignment_power); | |
f86a8756 | 4816 | lang_reset_memory_regions (); |
e9ee469a | 4817 | one_lang_size_sections_pass (relax, check_regions); |
a4f5ad88 JJ |
4818 | } |
4819 | } | |
e9ee469a AM |
4820 | link_info.relro_start = expld.dataseg.base; |
4821 | link_info.relro_end = expld.dataseg.relro_end; | |
8c37241b | 4822 | } |
e9ee469a | 4823 | else if (expld.dataseg.phase == exp_dataseg_end_seen) |
2d20f7bf JJ |
4824 | { |
4825 | /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether | |
4826 | a page could be saved in the data segment. */ | |
4827 | bfd_vma first, last; | |
4828 | ||
e9ee469a AM |
4829 | first = -expld.dataseg.base & (expld.dataseg.pagesize - 1); |
4830 | last = expld.dataseg.end & (expld.dataseg.pagesize - 1); | |
2d20f7bf | 4831 | if (first && last |
e9ee469a AM |
4832 | && ((expld.dataseg.base & ~(expld.dataseg.pagesize - 1)) |
4833 | != (expld.dataseg.end & ~(expld.dataseg.pagesize - 1))) | |
4834 | && first + last <= expld.dataseg.pagesize) | |
2d20f7bf | 4835 | { |
e9ee469a | 4836 | expld.dataseg.phase = exp_dataseg_adjust; |
f86a8756 | 4837 | lang_reset_memory_regions (); |
e9ee469a | 4838 | one_lang_size_sections_pass (relax, check_regions); |
2d20f7bf JJ |
4839 | } |
4840 | } | |
4841 | ||
e9ee469a | 4842 | expld.phase = lang_final_phase_enum; |
2d20f7bf JJ |
4843 | } |
4844 | ||
420e579c HPN |
4845 | /* Worker function for lang_do_assignments. Recursiveness goes here. */ |
4846 | ||
4847 | static bfd_vma | |
66e28d60 AM |
4848 | lang_do_assignments_1 (lang_statement_union_type *s, |
4849 | lang_output_section_statement_type *current_os, | |
4850 | fill_type *fill, | |
4851 | bfd_vma dot) | |
252b5132 | 4852 | { |
1579bae1 | 4853 | for (; s != NULL; s = s->header.next) |
252b5132 RH |
4854 | { |
4855 | switch (s->header.type) | |
4856 | { | |
4857 | case lang_constructors_statement_enum: | |
420e579c | 4858 | dot = lang_do_assignments_1 (constructor_list.head, |
66e28d60 | 4859 | current_os, fill, dot); |
252b5132 RH |
4860 | break; |
4861 | ||
4862 | case lang_output_section_statement_enum: | |
4863 | { | |
d1778b88 | 4864 | lang_output_section_statement_type *os; |
252b5132 | 4865 | |
d1778b88 | 4866 | os = &(s->output_section_statement); |
75ff4589 | 4867 | if (os->bfd_section != NULL && !os->ignored) |
252b5132 RH |
4868 | { |
4869 | dot = os->bfd_section->vma; | |
66e28d60 | 4870 | |
cde9e0be | 4871 | lang_do_assignments_1 (os->children.head, os, os->fill, dot); |
66e28d60 | 4872 | |
3737f867 JJ |
4873 | /* .tbss sections effectively have zero size. */ |
4874 | if ((os->bfd_section->flags & SEC_HAS_CONTENTS) != 0 | |
4875 | || (os->bfd_section->flags & SEC_THREAD_LOCAL) == 0 | |
4876 | || link_info.relocatable) | |
cde9e0be | 4877 | dot += TO_ADDR (os->bfd_section->size); |
252b5132 RH |
4878 | } |
4879 | } | |
4880 | break; | |
e9ee469a | 4881 | |
252b5132 RH |
4882 | case lang_wild_statement_enum: |
4883 | ||
420e579c | 4884 | dot = lang_do_assignments_1 (s->wild_statement.children.head, |
66e28d60 | 4885 | current_os, fill, dot); |
252b5132 RH |
4886 | break; |
4887 | ||
4888 | case lang_object_symbols_statement_enum: | |
4889 | case lang_output_statement_enum: | |
4890 | case lang_target_statement_enum: | |
252b5132 | 4891 | break; |
e9ee469a | 4892 | |
252b5132 | 4893 | case lang_data_statement_enum: |
e9ee469a AM |
4894 | exp_fold_tree (s->data_statement.exp, bfd_abs_section_ptr, &dot); |
4895 | if (expld.result.valid_p) | |
4896 | s->data_statement.value = (expld.result.value | |
4897 | + expld.result.section->vma); | |
4898 | else | |
4899 | einfo (_("%F%P: invalid data statement\n")); | |
b7a26f91 KH |
4900 | { |
4901 | unsigned int size; | |
08da4cac KH |
4902 | switch (s->data_statement.type) |
4903 | { | |
4904 | default: | |
4905 | abort (); | |
4906 | case QUAD: | |
4907 | case SQUAD: | |
4908 | size = QUAD_SIZE; | |
4909 | break; | |
4910 | case LONG: | |
4911 | size = LONG_SIZE; | |
4912 | break; | |
4913 | case SHORT: | |
4914 | size = SHORT_SIZE; | |
4915 | break; | |
4916 | case BYTE: | |
4917 | size = BYTE_SIZE; | |
4918 | break; | |
4919 | } | |
e5caa5e0 AM |
4920 | if (size < TO_SIZE ((unsigned) 1)) |
4921 | size = TO_SIZE ((unsigned) 1); | |
4922 | dot += TO_ADDR (size); | |
08da4cac | 4923 | } |
252b5132 RH |
4924 | break; |
4925 | ||
4926 | case lang_reloc_statement_enum: | |
e9ee469a AM |
4927 | exp_fold_tree (s->reloc_statement.addend_exp, |
4928 | bfd_abs_section_ptr, &dot); | |
4929 | if (expld.result.valid_p) | |
4930 | s->reloc_statement.addend_value = expld.result.value; | |
4931 | else | |
4932 | einfo (_("%F%P: invalid reloc statement\n")); | |
e5caa5e0 | 4933 | dot += TO_ADDR (bfd_get_reloc_size (s->reloc_statement.howto)); |
252b5132 RH |
4934 | break; |
4935 | ||
4936 | case lang_input_section_enum: | |
4937 | { | |
4938 | asection *in = s->input_section.section; | |
4939 | ||
57ceae94 | 4940 | if ((in->flags & SEC_EXCLUDE) == 0) |
eea6121a | 4941 | dot += TO_ADDR (in->size); |
252b5132 RH |
4942 | } |
4943 | break; | |
4944 | ||
4945 | case lang_input_statement_enum: | |
4946 | break; | |
e9ee469a | 4947 | |
252b5132 RH |
4948 | case lang_fill_statement_enum: |
4949 | fill = s->fill_statement.fill; | |
4950 | break; | |
252b5132 | 4951 | |
e9ee469a AM |
4952 | case lang_assignment_statement_enum: |
4953 | exp_fold_tree (s->assignment_statement.exp, | |
66e28d60 | 4954 | current_os->bfd_section, |
e9ee469a | 4955 | &dot); |
252b5132 | 4956 | break; |
e9ee469a | 4957 | |
252b5132 | 4958 | case lang_padding_statement_enum: |
e5caa5e0 | 4959 | dot += TO_ADDR (s->padding_statement.size); |
252b5132 RH |
4960 | break; |
4961 | ||
4962 | case lang_group_statement_enum: | |
420e579c | 4963 | dot = lang_do_assignments_1 (s->group_statement.children.head, |
66e28d60 | 4964 | current_os, fill, dot); |
252b5132 RH |
4965 | break; |
4966 | ||
4967 | default: | |
4968 | FAIL (); | |
4969 | break; | |
e9ee469a | 4970 | |
252b5132 RH |
4971 | case lang_address_statement_enum: |
4972 | break; | |
4973 | } | |
252b5132 RH |
4974 | } |
4975 | return dot; | |
4976 | } | |
4977 | ||
f2241121 | 4978 | void |
e9ee469a | 4979 | lang_do_assignments (void) |
420e579c | 4980 | { |
420e579c | 4981 | lang_statement_iteration++; |
e9ee469a | 4982 | lang_do_assignments_1 (statement_list.head, abs_output_section, NULL, 0); |
420e579c HPN |
4983 | } |
4984 | ||
252b5132 RH |
4985 | /* Fix any .startof. or .sizeof. symbols. When the assemblers see the |
4986 | operator .startof. (section_name), it produces an undefined symbol | |
4987 | .startof.section_name. Similarly, when it sees | |
4988 | .sizeof. (section_name), it produces an undefined symbol | |
4989 | .sizeof.section_name. For all the output sections, we look for | |
4990 | such symbols, and set them to the correct value. */ | |
4991 | ||
4992 | static void | |
1579bae1 | 4993 | lang_set_startof (void) |
252b5132 RH |
4994 | { |
4995 | asection *s; | |
4996 | ||
1049f94e | 4997 | if (link_info.relocatable) |
252b5132 RH |
4998 | return; |
4999 | ||
5000 | for (s = output_bfd->sections; s != NULL; s = s->next) | |
5001 | { | |
5002 | const char *secname; | |
5003 | char *buf; | |
5004 | struct bfd_link_hash_entry *h; | |
5005 | ||
5006 | secname = bfd_get_section_name (output_bfd, s); | |
5007 | buf = xmalloc (10 + strlen (secname)); | |
5008 | ||
5009 | sprintf (buf, ".startof.%s", secname); | |
b34976b6 | 5010 | h = bfd_link_hash_lookup (link_info.hash, buf, FALSE, FALSE, TRUE); |
252b5132 RH |
5011 | if (h != NULL && h->type == bfd_link_hash_undefined) |
5012 | { | |
5013 | h->type = bfd_link_hash_defined; | |
5014 | h->u.def.value = bfd_get_section_vma (output_bfd, s); | |
5015 | h->u.def.section = bfd_abs_section_ptr; | |
5016 | } | |
5017 | ||
5018 | sprintf (buf, ".sizeof.%s", secname); | |
b34976b6 | 5019 | h = bfd_link_hash_lookup (link_info.hash, buf, FALSE, FALSE, TRUE); |
252b5132 RH |
5020 | if (h != NULL && h->type == bfd_link_hash_undefined) |
5021 | { | |
5022 | h->type = bfd_link_hash_defined; | |
eea6121a | 5023 | h->u.def.value = TO_ADDR (s->size); |
252b5132 RH |
5024 | h->u.def.section = bfd_abs_section_ptr; |
5025 | } | |
5026 | ||
5027 | free (buf); | |
5028 | } | |
5029 | } | |
5030 | ||
5031 | static void | |
750877ba | 5032 | lang_end (void) |
252b5132 RH |
5033 | { |
5034 | struct bfd_link_hash_entry *h; | |
b34976b6 | 5035 | bfd_boolean warn; |
252b5132 | 5036 | |
1049f94e | 5037 | if (link_info.relocatable || link_info.shared) |
b34976b6 | 5038 | warn = FALSE; |
252b5132 | 5039 | else |
b34976b6 | 5040 | warn = TRUE; |
252b5132 | 5041 | |
1579bae1 | 5042 | if (entry_symbol.name == NULL) |
252b5132 | 5043 | { |
a359509e ZW |
5044 | /* No entry has been specified. Look for the default entry, but |
5045 | don't warn if we don't find it. */ | |
5046 | entry_symbol.name = entry_symbol_default; | |
b34976b6 | 5047 | warn = FALSE; |
252b5132 RH |
5048 | } |
5049 | ||
e3e942e9 | 5050 | h = bfd_link_hash_lookup (link_info.hash, entry_symbol.name, |
b34976b6 | 5051 | FALSE, FALSE, TRUE); |
1579bae1 | 5052 | if (h != NULL |
252b5132 RH |
5053 | && (h->type == bfd_link_hash_defined |
5054 | || h->type == bfd_link_hash_defweak) | |
5055 | && h->u.def.section->output_section != NULL) | |
5056 | { | |
5057 | bfd_vma val; | |
5058 | ||
5059 | val = (h->u.def.value | |
5060 | + bfd_get_section_vma (output_bfd, | |
5061 | h->u.def.section->output_section) | |
5062 | + h->u.def.section->output_offset); | |
5063 | if (! bfd_set_start_address (output_bfd, val)) | |
e3e942e9 | 5064 | einfo (_("%P%F:%s: can't set start address\n"), entry_symbol.name); |
252b5132 RH |
5065 | } |
5066 | else | |
5067 | { | |
5068 | bfd_vma val; | |
5f992e62 | 5069 | const char *send; |
252b5132 RH |
5070 | |
5071 | /* We couldn't find the entry symbol. Try parsing it as a | |
afd7a018 | 5072 | number. */ |
e3e942e9 | 5073 | val = bfd_scan_vma (entry_symbol.name, &send, 0); |
252b5132 RH |
5074 | if (*send == '\0') |
5075 | { | |
5076 | if (! bfd_set_start_address (output_bfd, val)) | |
5077 | einfo (_("%P%F: can't set start address\n")); | |
5078 | } | |
5079 | else | |
5080 | { | |
5081 | asection *ts; | |
5082 | ||
5083 | /* Can't find the entry symbol, and it's not a number. Use | |
5084 | the first address in the text section. */ | |
1e281515 | 5085 | ts = bfd_get_section_by_name (output_bfd, entry_section); |
1579bae1 | 5086 | if (ts != NULL) |
252b5132 RH |
5087 | { |
5088 | if (warn) | |
6feb9908 AM |
5089 | einfo (_("%P: warning: cannot find entry symbol %s;" |
5090 | " defaulting to %V\n"), | |
e3e942e9 AM |
5091 | entry_symbol.name, |
5092 | bfd_get_section_vma (output_bfd, ts)); | |
252b5132 RH |
5093 | if (! bfd_set_start_address (output_bfd, |
5094 | bfd_get_section_vma (output_bfd, | |
5095 | ts))) | |
5096 | einfo (_("%P%F: can't set start address\n")); | |
5097 | } | |
5098 | else | |
5099 | { | |
5100 | if (warn) | |
6feb9908 AM |
5101 | einfo (_("%P: warning: cannot find entry symbol %s;" |
5102 | " not setting start address\n"), | |
e3e942e9 | 5103 | entry_symbol.name); |
252b5132 RH |
5104 | } |
5105 | } | |
5106 | } | |
420e579c | 5107 | |
7115639b AM |
5108 | /* Don't bfd_hash_table_free (&lang_definedness_table); |
5109 | map file output may result in a call of lang_track_definedness. */ | |
252b5132 RH |
5110 | } |
5111 | ||
5112 | /* This is a small function used when we want to ignore errors from | |
5113 | BFD. */ | |
5114 | ||
5115 | static void | |
87f2a346 | 5116 | ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED, ...) |
252b5132 RH |
5117 | { |
5118 | /* Don't do anything. */ | |
5119 | } | |
5120 | ||
5121 | /* Check that the architecture of all the input files is compatible | |
5122 | with the output file. Also call the backend to let it do any | |
5123 | other checking that is needed. */ | |
5124 | ||
5125 | static void | |
1579bae1 | 5126 | lang_check (void) |
252b5132 RH |
5127 | { |
5128 | lang_statement_union_type *file; | |
5129 | bfd *input_bfd; | |
5f992e62 | 5130 | const bfd_arch_info_type *compatible; |
252b5132 | 5131 | |
1579bae1 | 5132 | for (file = file_chain.head; file != NULL; file = file->input_statement.next) |
252b5132 RH |
5133 | { |
5134 | input_bfd = file->input_statement.the_bfd; | |
6feb9908 AM |
5135 | compatible |
5136 | = bfd_arch_get_compatible (input_bfd, output_bfd, | |
5137 | command_line.accept_unknown_input_arch); | |
30cba025 AM |
5138 | |
5139 | /* In general it is not possible to perform a relocatable | |
5140 | link between differing object formats when the input | |
5141 | file has relocations, because the relocations in the | |
5142 | input format may not have equivalent representations in | |
5143 | the output format (and besides BFD does not translate | |
5144 | relocs for other link purposes than a final link). */ | |
1049f94e | 5145 | if ((link_info.relocatable || link_info.emitrelocations) |
30cba025 | 5146 | && (compatible == NULL |
d35a52e2 | 5147 | || bfd_get_flavour (input_bfd) != bfd_get_flavour (output_bfd)) |
30cba025 AM |
5148 | && (bfd_get_file_flags (input_bfd) & HAS_RELOC) != 0) |
5149 | { | |
6feb9908 AM |
5150 | einfo (_("%P%F: Relocatable linking with relocations from" |
5151 | " format %s (%B) to format %s (%B) is not supported\n"), | |
30cba025 AM |
5152 | bfd_get_target (input_bfd), input_bfd, |
5153 | bfd_get_target (output_bfd), output_bfd); | |
5154 | /* einfo with %F exits. */ | |
5155 | } | |
5156 | ||
252b5132 RH |
5157 | if (compatible == NULL) |
5158 | { | |
5159 | if (command_line.warn_mismatch) | |
9e7750f2 | 5160 | einfo (_("%P%X: %s architecture of input file `%B'" |
6feb9908 | 5161 | " is incompatible with %s output\n"), |
252b5132 RH |
5162 | bfd_printable_name (input_bfd), input_bfd, |
5163 | bfd_printable_name (output_bfd)); | |
5164 | } | |
b9247304 | 5165 | else if (bfd_count_sections (input_bfd)) |
252b5132 | 5166 | { |
b9247304 | 5167 | /* If the input bfd has no contents, it shouldn't set the |
b7a26f91 | 5168 | private data of the output bfd. */ |
b9247304 | 5169 | |
252b5132 RH |
5170 | bfd_error_handler_type pfn = NULL; |
5171 | ||
5172 | /* If we aren't supposed to warn about mismatched input | |
afd7a018 AM |
5173 | files, temporarily set the BFD error handler to a |
5174 | function which will do nothing. We still want to call | |
5175 | bfd_merge_private_bfd_data, since it may set up | |
5176 | information which is needed in the output file. */ | |
252b5132 RH |
5177 | if (! command_line.warn_mismatch) |
5178 | pfn = bfd_set_error_handler (ignore_bfd_errors); | |
5179 | if (! bfd_merge_private_bfd_data (input_bfd, output_bfd)) | |
5180 | { | |
5181 | if (command_line.warn_mismatch) | |
6feb9908 AM |
5182 | einfo (_("%P%X: failed to merge target specific data" |
5183 | " of file %B\n"), input_bfd); | |
252b5132 RH |
5184 | } |
5185 | if (! command_line.warn_mismatch) | |
5186 | bfd_set_error_handler (pfn); | |
5187 | } | |
5188 | } | |
5189 | } | |
5190 | ||
5191 | /* Look through all the global common symbols and attach them to the | |
5192 | correct section. The -sort-common command line switch may be used | |
5193 | to roughly sort the entries by size. */ | |
5194 | ||
5195 | static void | |
1579bae1 | 5196 | lang_common (void) |
252b5132 | 5197 | { |
4818e05f AM |
5198 | if (command_line.inhibit_common_definition) |
5199 | return; | |
1049f94e | 5200 | if (link_info.relocatable |
252b5132 RH |
5201 | && ! command_line.force_common_definition) |
5202 | return; | |
5203 | ||
5204 | if (! config.sort_common) | |
1579bae1 | 5205 | bfd_link_hash_traverse (link_info.hash, lang_one_common, NULL); |
252b5132 RH |
5206 | else |
5207 | { | |
5208 | int power; | |
5209 | ||
5210 | for (power = 4; power >= 0; power--) | |
1579bae1 | 5211 | bfd_link_hash_traverse (link_info.hash, lang_one_common, &power); |
252b5132 RH |
5212 | } |
5213 | } | |
5214 | ||
5215 | /* Place one common symbol in the correct section. */ | |
5216 | ||
b34976b6 | 5217 | static bfd_boolean |
1579bae1 | 5218 | lang_one_common (struct bfd_link_hash_entry *h, void *info) |
252b5132 RH |
5219 | { |
5220 | unsigned int power_of_two; | |
5221 | bfd_vma size; | |
5222 | asection *section; | |
5223 | ||
5224 | if (h->type != bfd_link_hash_common) | |
b34976b6 | 5225 | return TRUE; |
252b5132 RH |
5226 | |
5227 | size = h->u.c.size; | |
5228 | power_of_two = h->u.c.p->alignment_power; | |
5229 | ||
5230 | if (config.sort_common | |
5231 | && power_of_two < (unsigned int) *(int *) info) | |
b34976b6 | 5232 | return TRUE; |
252b5132 RH |
5233 | |
5234 | section = h->u.c.p->section; | |
5235 | ||
e5caa5e0 | 5236 | /* Increase the size of the section to align the common sym. */ |
eea6121a AM |
5237 | section->size += ((bfd_vma) 1 << (power_of_two + opb_shift)) - 1; |
5238 | section->size &= (- (bfd_vma) 1 << (power_of_two + opb_shift)); | |
252b5132 RH |
5239 | |
5240 | /* Adjust the alignment if necessary. */ | |
5241 | if (power_of_two > section->alignment_power) | |
5242 | section->alignment_power = power_of_two; | |
5243 | ||
5244 | /* Change the symbol from common to defined. */ | |
5245 | h->type = bfd_link_hash_defined; | |
5246 | h->u.def.section = section; | |
eea6121a | 5247 | h->u.def.value = section->size; |
252b5132 RH |
5248 | |
5249 | /* Increase the size of the section. */ | |
eea6121a | 5250 | section->size += size; |
252b5132 RH |
5251 | |
5252 | /* Make sure the section is allocated in memory, and make sure that | |
5253 | it is no longer a common section. */ | |
5254 | section->flags |= SEC_ALLOC; | |
08da4cac | 5255 | section->flags &= ~SEC_IS_COMMON; |
252b5132 RH |
5256 | |
5257 | if (config.map_file != NULL) | |
5258 | { | |
b34976b6 | 5259 | static bfd_boolean header_printed; |
252b5132 RH |
5260 | int len; |
5261 | char *name; | |
5262 | char buf[50]; | |
5263 | ||
5264 | if (! header_printed) | |
5265 | { | |
5266 | minfo (_("\nAllocating common symbols\n")); | |
5267 | minfo (_("Common symbol size file\n\n")); | |
b34976b6 | 5268 | header_printed = TRUE; |
252b5132 RH |
5269 | } |
5270 | ||
73705ac3 AM |
5271 | name = bfd_demangle (output_bfd, h->root.string, |
5272 | DMGL_ANSI | DMGL_PARAMS); | |
d7d4c8de AM |
5273 | if (name == NULL) |
5274 | { | |
5275 | minfo ("%s", h->root.string); | |
5276 | len = strlen (h->root.string); | |
5277 | } | |
5278 | else | |
5279 | { | |
5280 | minfo ("%s", name); | |
5281 | len = strlen (name); | |
5282 | free (name); | |
5283 | } | |
252b5132 RH |
5284 | |
5285 | if (len >= 19) | |
5286 | { | |
5287 | print_nl (); | |
5288 | len = 0; | |
5289 | } | |
5290 | while (len < 20) | |
5291 | { | |
5292 | print_space (); | |
5293 | ++len; | |
5294 | } | |
5295 | ||
5296 | minfo ("0x"); | |
5297 | if (size <= 0xffffffff) | |
5298 | sprintf (buf, "%lx", (unsigned long) size); | |
5299 | else | |
5300 | sprintf_vma (buf, size); | |
5301 | minfo ("%s", buf); | |
5302 | len = strlen (buf); | |
5303 | ||
5304 | while (len < 16) | |
5305 | { | |
5306 | print_space (); | |
5307 | ++len; | |
5308 | } | |
5309 | ||
5310 | minfo ("%B\n", section->owner); | |
5311 | } | |
5312 | ||
b34976b6 | 5313 | return TRUE; |
252b5132 RH |
5314 | } |
5315 | ||
08da4cac KH |
5316 | /* Run through the input files and ensure that every input section has |
5317 | somewhere to go. If one is found without a destination then create | |
5318 | an input request and place it into the statement tree. */ | |
252b5132 RH |
5319 | |
5320 | static void | |
1579bae1 | 5321 | lang_place_orphans (void) |
252b5132 | 5322 | { |
e50d8076 | 5323 | LANG_FOR_EACH_INPUT_STATEMENT (file) |
252b5132 RH |
5324 | { |
5325 | asection *s; | |
5326 | ||
1579bae1 | 5327 | for (s = file->the_bfd->sections; s != NULL; s = s->next) |
252b5132 | 5328 | { |
1579bae1 | 5329 | if (s->output_section == NULL) |
252b5132 | 5330 | { |
396a2467 | 5331 | /* This section of the file is not attached, root |
afd7a018 | 5332 | around for a sensible place for it to go. */ |
252b5132 RH |
5333 | |
5334 | if (file->just_syms_flag) | |
1449d79b AM |
5335 | bfd_link_just_syms (file->the_bfd, s, &link_info); |
5336 | else if ((s->flags & SEC_EXCLUDE) != 0) | |
164e712d | 5337 | s->output_section = bfd_abs_section_ptr; |
252b5132 RH |
5338 | else if (strcmp (s->name, "COMMON") == 0) |
5339 | { | |
5340 | /* This is a lonely common section which must have | |
5341 | come from an archive. We attach to the section | |
5342 | with the wildcard. */ | |
1049f94e | 5343 | if (! link_info.relocatable |
252b5132 RH |
5344 | || command_line.force_common_definition) |
5345 | { | |
5346 | if (default_common_section == NULL) | |
5347 | { | |
252b5132 RH |
5348 | default_common_section = |
5349 | lang_output_section_statement_lookup (".bss"); | |
5350 | ||
5351 | } | |
39dcfe18 | 5352 | lang_add_section (&default_common_section->children, s, |
7b986e99 | 5353 | default_common_section); |
252b5132 RH |
5354 | } |
5355 | } | |
7b986e99 | 5356 | else if (ldemul_place_orphan (s)) |
252b5132 RH |
5357 | ; |
5358 | else | |
5359 | { | |
39dcfe18 | 5360 | lang_output_section_statement_type *os; |
252b5132 | 5361 | |
39dcfe18 | 5362 | os = lang_output_section_statement_lookup (s->name); |
7b986e99 | 5363 | lang_add_section (&os->children, s, os); |
252b5132 RH |
5364 | } |
5365 | } | |
5366 | } | |
5367 | } | |
5368 | } | |
5369 | ||
252b5132 | 5370 | void |
1579bae1 | 5371 | lang_set_flags (lang_memory_region_type *ptr, const char *flags, int invert) |
252b5132 | 5372 | { |
aa8804e4 | 5373 | flagword *ptr_flags; |
252b5132 | 5374 | |
aa8804e4 | 5375 | ptr_flags = invert ? &ptr->not_flags : &ptr->flags; |
252b5132 RH |
5376 | while (*flags) |
5377 | { | |
5378 | switch (*flags) | |
5379 | { | |
252b5132 RH |
5380 | case 'A': case 'a': |
5381 | *ptr_flags |= SEC_ALLOC; | |
5382 | break; | |
5383 | ||
5384 | case 'R': case 'r': | |
5385 | *ptr_flags |= SEC_READONLY; | |
5386 | break; | |
5387 | ||
5388 | case 'W': case 'w': | |
5389 | *ptr_flags |= SEC_DATA; | |
5390 | break; | |
5391 | ||
5392 | case 'X': case 'x': | |
5393 | *ptr_flags |= SEC_CODE; | |
5394 | break; | |
5395 | ||
5396 | case 'L': case 'l': | |
5397 | case 'I': case 'i': | |
5398 | *ptr_flags |= SEC_LOAD; | |
5399 | break; | |
5400 | ||
5401 | default: | |
5402 | einfo (_("%P%F: invalid syntax in flags\n")); | |
5403 | break; | |
5404 | } | |
5405 | flags++; | |
5406 | } | |
5407 | } | |
5408 | ||
5409 | /* Call a function on each input file. This function will be called | |
5410 | on an archive, but not on the elements. */ | |
5411 | ||
5412 | void | |
1579bae1 | 5413 | lang_for_each_input_file (void (*func) (lang_input_statement_type *)) |
252b5132 RH |
5414 | { |
5415 | lang_input_statement_type *f; | |
5416 | ||
5417 | for (f = (lang_input_statement_type *) input_file_chain.head; | |
5418 | f != NULL; | |
5419 | f = (lang_input_statement_type *) f->next_real_file) | |
5420 | func (f); | |
5421 | } | |
5422 | ||
5423 | /* Call a function on each file. The function will be called on all | |
5424 | the elements of an archive which are included in the link, but will | |
5425 | not be called on the archive file itself. */ | |
5426 | ||
5427 | void | |
1579bae1 | 5428 | lang_for_each_file (void (*func) (lang_input_statement_type *)) |
252b5132 | 5429 | { |
e50d8076 | 5430 | LANG_FOR_EACH_INPUT_STATEMENT (f) |
252b5132 RH |
5431 | { |
5432 | func (f); | |
5433 | } | |
5434 | } | |
5435 | ||
252b5132 | 5436 | void |
1579bae1 | 5437 | ldlang_add_file (lang_input_statement_type *entry) |
252b5132 | 5438 | { |
252b5132 RH |
5439 | lang_statement_append (&file_chain, |
5440 | (lang_statement_union_type *) entry, | |
5441 | &entry->next); | |
5442 | ||
5443 | /* The BFD linker needs to have a list of all input BFDs involved in | |
5444 | a link. */ | |
1579bae1 | 5445 | ASSERT (entry->the_bfd->link_next == NULL); |
252b5132 | 5446 | ASSERT (entry->the_bfd != output_bfd); |
a9a4c53e AM |
5447 | |
5448 | *link_info.input_bfds_tail = entry->the_bfd; | |
5449 | link_info.input_bfds_tail = &entry->the_bfd->link_next; | |
1579bae1 | 5450 | entry->the_bfd->usrdata = entry; |
252b5132 RH |
5451 | bfd_set_gp_size (entry->the_bfd, g_switch_value); |
5452 | ||
5453 | /* Look through the sections and check for any which should not be | |
5454 | included in the link. We need to do this now, so that we can | |
5455 | notice when the backend linker tries to report multiple | |
5456 | definition errors for symbols which are in sections we aren't | |
5457 | going to link. FIXME: It might be better to entirely ignore | |
5458 | symbols which are defined in sections which are going to be | |
5459 | discarded. This would require modifying the backend linker for | |
5460 | each backend which might set the SEC_LINK_ONCE flag. If we do | |
5461 | this, we should probably handle SEC_EXCLUDE in the same way. */ | |
5462 | ||
1579bae1 | 5463 | bfd_map_over_sections (entry->the_bfd, section_already_linked, entry); |
252b5132 RH |
5464 | } |
5465 | ||
5466 | void | |
1579bae1 | 5467 | lang_add_output (const char *name, int from_script) |
252b5132 RH |
5468 | { |
5469 | /* Make -o on command line override OUTPUT in script. */ | |
7c519c12 | 5470 | if (!had_output_filename || !from_script) |
252b5132 RH |
5471 | { |
5472 | output_filename = name; | |
b34976b6 | 5473 | had_output_filename = TRUE; |
252b5132 RH |
5474 | } |
5475 | } | |
5476 | ||
252b5132 RH |
5477 | static lang_output_section_statement_type *current_section; |
5478 | ||
5479 | static int | |
1579bae1 | 5480 | topower (int x) |
252b5132 RH |
5481 | { |
5482 | unsigned int i = 1; | |
5483 | int l; | |
5484 | ||
5485 | if (x < 0) | |
5486 | return -1; | |
5487 | ||
5f992e62 | 5488 | for (l = 0; l < 32; l++) |
252b5132 RH |
5489 | { |
5490 | if (i >= (unsigned int) x) | |
5491 | return l; | |
5492 | i <<= 1; | |
5493 | } | |
5494 | ||
5495 | return 0; | |
5496 | } | |
5497 | ||
aea4bd9d | 5498 | lang_output_section_statement_type * |
1579bae1 AM |
5499 | lang_enter_output_section_statement (const char *output_section_statement_name, |
5500 | etree_type *address_exp, | |
5501 | enum section_type sectype, | |
1579bae1 AM |
5502 | etree_type *align, |
5503 | etree_type *subalign, | |
0841712e JJ |
5504 | etree_type *ebase, |
5505 | int constraint) | |
252b5132 RH |
5506 | { |
5507 | lang_output_section_statement_type *os; | |
5508 | ||
bd4d42c1 AM |
5509 | os = lang_output_section_statement_lookup_1 (output_section_statement_name, |
5510 | constraint); | |
5511 | current_section = os; | |
252b5132 | 5512 | |
08da4cac | 5513 | /* Make next things chain into subchain of this. */ |
252b5132 | 5514 | |
1579bae1 | 5515 | if (os->addr_tree == NULL) |
08da4cac KH |
5516 | { |
5517 | os->addr_tree = address_exp; | |
5518 | } | |
252b5132 RH |
5519 | os->sectype = sectype; |
5520 | if (sectype != noload_section) | |
5521 | os->flags = SEC_NO_FLAGS; | |
5522 | else | |
5523 | os->flags = SEC_NEVER_LOAD; | |
e5caa5e0 | 5524 | os->block_value = 1; |
252b5132 RH |
5525 | stat_ptr = &os->children; |
5526 | ||
08da4cac | 5527 | os->subsection_alignment = |
e9ee469a | 5528 | topower (exp_get_value_int (subalign, -1, "subsection alignment")); |
08da4cac | 5529 | os->section_alignment = |
e9ee469a | 5530 | topower (exp_get_value_int (align, -1, "section alignment")); |
252b5132 RH |
5531 | |
5532 | os->load_base = ebase; | |
aea4bd9d | 5533 | return os; |
252b5132 RH |
5534 | } |
5535 | ||
252b5132 | 5536 | void |
1579bae1 | 5537 | lang_final (void) |
252b5132 | 5538 | { |
bd4d42c1 | 5539 | lang_output_statement_type *new; |
252b5132 | 5540 | |
bd4d42c1 | 5541 | new = new_stat (lang_output_statement, stat_ptr); |
252b5132 RH |
5542 | new->name = output_filename; |
5543 | } | |
5544 | ||
08da4cac KH |
5545 | /* Reset the current counters in the regions. */ |
5546 | ||
e3dc8847 | 5547 | void |
1579bae1 | 5548 | lang_reset_memory_regions (void) |
252b5132 RH |
5549 | { |
5550 | lang_memory_region_type *p = lang_memory_region_list; | |
b3327aad | 5551 | asection *o; |
e9ee469a | 5552 | lang_output_section_statement_type *os; |
252b5132 | 5553 | |
1579bae1 | 5554 | for (p = lang_memory_region_list; p != NULL; p = p->next) |
252b5132 | 5555 | { |
252b5132 | 5556 | p->current = p->origin; |
66e28d60 | 5557 | p->last_os = NULL; |
252b5132 | 5558 | } |
b3327aad | 5559 | |
e9ee469a AM |
5560 | for (os = &lang_output_section_statement.head->output_section_statement; |
5561 | os != NULL; | |
5562 | os = os->next) | |
cde9e0be AM |
5563 | { |
5564 | os->processed_vma = FALSE; | |
5565 | os->processed_lma = FALSE; | |
5566 | } | |
e9ee469a | 5567 | |
b3327aad | 5568 | for (o = output_bfd->sections; o != NULL; o = o->next) |
1a23a9e6 AM |
5569 | { |
5570 | /* Save the last size for possible use by bfd_relax_section. */ | |
5571 | o->rawsize = o->size; | |
5572 | o->size = 0; | |
5573 | } | |
252b5132 RH |
5574 | } |
5575 | ||
164e712d | 5576 | /* Worker for lang_gc_sections_1. */ |
252b5132 RH |
5577 | |
5578 | static void | |
1579bae1 AM |
5579 | gc_section_callback (lang_wild_statement_type *ptr, |
5580 | struct wildcard_list *sec ATTRIBUTE_UNUSED, | |
5581 | asection *section, | |
5582 | lang_input_statement_type *file ATTRIBUTE_UNUSED, | |
5583 | void *data ATTRIBUTE_UNUSED) | |
252b5132 | 5584 | { |
164e712d AM |
5585 | /* If the wild pattern was marked KEEP, the member sections |
5586 | should be as well. */ | |
4dec4d4e RH |
5587 | if (ptr->keep_sections) |
5588 | section->flags |= SEC_KEEP; | |
252b5132 RH |
5589 | } |
5590 | ||
252b5132 RH |
5591 | /* Iterate over sections marking them against GC. */ |
5592 | ||
5593 | static void | |
1579bae1 | 5594 | lang_gc_sections_1 (lang_statement_union_type *s) |
252b5132 | 5595 | { |
1579bae1 | 5596 | for (; s != NULL; s = s->header.next) |
252b5132 RH |
5597 | { |
5598 | switch (s->header.type) | |
5599 | { | |
5600 | case lang_wild_statement_enum: | |
164e712d | 5601 | walk_wild (&s->wild_statement, gc_section_callback, NULL); |
abc6ab0a | 5602 | break; |
252b5132 RH |
5603 | case lang_constructors_statement_enum: |
5604 | lang_gc_sections_1 (constructor_list.head); | |
5605 | break; | |
5606 | case lang_output_section_statement_enum: | |
5607 | lang_gc_sections_1 (s->output_section_statement.children.head); | |
5608 | break; | |
5609 | case lang_group_statement_enum: | |
5610 | lang_gc_sections_1 (s->group_statement.children.head); | |
5611 | break; | |
5612 | default: | |
5613 | break; | |
5614 | } | |
5615 | } | |
5616 | } | |
5617 | ||
5618 | static void | |
1579bae1 | 5619 | lang_gc_sections (void) |
252b5132 RH |
5620 | { |
5621 | struct bfd_link_hash_entry *h; | |
e3e942e9 | 5622 | ldlang_undef_chain_list_type *ulist; |
252b5132 RH |
5623 | |
5624 | /* Keep all sections so marked in the link script. */ | |
5625 | ||
5626 | lang_gc_sections_1 (statement_list.head); | |
5627 | ||
e3e942e9 AM |
5628 | /* Keep all sections containing symbols undefined on the command-line, |
5629 | and the section containing the entry symbol. */ | |
252b5132 | 5630 | |
e3e942e9 | 5631 | for (ulist = link_info.gc_sym_list; ulist; ulist = ulist->next) |
252b5132 | 5632 | { |
5f992e62 | 5633 | h = bfd_link_hash_lookup (link_info.hash, ulist->name, |
b34976b6 | 5634 | FALSE, FALSE, FALSE); |
252b5132 | 5635 | |
1579bae1 | 5636 | if (h != NULL |
08da4cac KH |
5637 | && (h->type == bfd_link_hash_defined |
5638 | || h->type == bfd_link_hash_defweak) | |
252b5132 RH |
5639 | && ! bfd_is_abs_section (h->u.def.section)) |
5640 | { | |
5641 | h->u.def.section->flags |= SEC_KEEP; | |
5642 | } | |
5643 | } | |
5644 | ||
9ca57817 AM |
5645 | /* SEC_EXCLUDE is ignored when doing a relocatable link, except in |
5646 | the special case of debug info. (See bfd/stabs.c) | |
5647 | Twiddle the flag here, to simplify later linker code. */ | |
5648 | if (link_info.relocatable) | |
5649 | { | |
5650 | LANG_FOR_EACH_INPUT_STATEMENT (f) | |
5651 | { | |
5652 | asection *sec; | |
5653 | for (sec = f->the_bfd->sections; sec != NULL; sec = sec->next) | |
5654 | if ((sec->flags & SEC_DEBUGGING) == 0) | |
5655 | sec->flags &= ~SEC_EXCLUDE; | |
5656 | } | |
5657 | } | |
5658 | ||
57316bff | 5659 | if (link_info.gc_sections) |
164e712d | 5660 | bfd_gc_sections (output_bfd, &link_info); |
252b5132 RH |
5661 | } |
5662 | ||
fbbc3759 L |
5663 | /* Relax all sections until bfd_relax_section gives up. */ |
5664 | ||
5665 | static void | |
5666 | relax_sections (void) | |
5667 | { | |
5668 | /* Keep relaxing until bfd_relax_section gives up. */ | |
5669 | bfd_boolean relax_again; | |
5670 | ||
4a828aab | 5671 | link_info.relax_trip = -1; |
fbbc3759 L |
5672 | do |
5673 | { | |
329c1c86 | 5674 | relax_again = FALSE; |
4a828aab | 5675 | link_info.relax_trip++; |
fbbc3759 L |
5676 | |
5677 | /* Note: pe-dll.c does something like this also. If you find | |
5678 | you need to change this code, you probably need to change | |
5679 | pe-dll.c also. DJ */ | |
5680 | ||
5681 | /* Do all the assignments with our current guesses as to | |
5682 | section sizes. */ | |
5683 | lang_do_assignments (); | |
5684 | ||
5685 | /* We must do this after lang_do_assignments, because it uses | |
5686 | size. */ | |
5687 | lang_reset_memory_regions (); | |
5688 | ||
5689 | /* Perform another relax pass - this time we know where the | |
5690 | globals are, so can make a better guess. */ | |
5691 | lang_size_sections (&relax_again, FALSE); | |
5692 | } | |
5693 | while (relax_again); | |
5694 | } | |
5695 | ||
252b5132 | 5696 | void |
1579bae1 | 5697 | lang_process (void) |
252b5132 | 5698 | { |
55255dae | 5699 | /* Finalize dynamic list. */ |
40b36307 L |
5700 | if (link_info.dynamic_list) |
5701 | lang_finalize_version_expr_head (&link_info.dynamic_list->head); | |
55255dae | 5702 | |
252b5132 RH |
5703 | current_target = default_target; |
5704 | ||
08da4cac KH |
5705 | /* Open the output file. */ |
5706 | lang_for_each_statement (ldlang_open_output); | |
e5caa5e0 | 5707 | init_opb (); |
252b5132 RH |
5708 | |
5709 | ldemul_create_output_section_statements (); | |
5710 | ||
08da4cac | 5711 | /* Add to the hash table all undefineds on the command line. */ |
252b5132 RH |
5712 | lang_place_undefineds (); |
5713 | ||
082b7297 L |
5714 | if (!bfd_section_already_linked_table_init ()) |
5715 | einfo (_("%P%F: Failed to create hash table\n")); | |
9503fd87 | 5716 | |
08da4cac | 5717 | /* Create a bfd for each input file. */ |
252b5132 | 5718 | current_target = default_target; |
b34976b6 | 5719 | open_input_bfds (statement_list.head, FALSE); |
252b5132 | 5720 | |
e3e942e9 AM |
5721 | link_info.gc_sym_list = &entry_symbol; |
5722 | if (entry_symbol.name == NULL) | |
5723 | link_info.gc_sym_list = ldlang_undef_chain_list_head; | |
5724 | ||
252b5132 RH |
5725 | ldemul_after_open (); |
5726 | ||
082b7297 | 5727 | bfd_section_already_linked_table_free (); |
9503fd87 | 5728 | |
252b5132 RH |
5729 | /* Make sure that we're not mixing architectures. We call this |
5730 | after all the input files have been opened, but before we do any | |
5731 | other processing, so that any operations merge_private_bfd_data | |
5732 | does on the output file will be known during the rest of the | |
5733 | link. */ | |
5734 | lang_check (); | |
5735 | ||
5736 | /* Handle .exports instead of a version script if we're told to do so. */ | |
5737 | if (command_line.version_exports_section) | |
5738 | lang_do_version_exports_section (); | |
5739 | ||
5740 | /* Build all sets based on the information gathered from the input | |
5741 | files. */ | |
5742 | ldctor_build_sets (); | |
5743 | ||
5744 | /* Remove unreferenced sections if asked to. */ | |
164e712d | 5745 | lang_gc_sections (); |
252b5132 | 5746 | |
08da4cac | 5747 | /* Size up the common data. */ |
252b5132 RH |
5748 | lang_common (); |
5749 | ||
bcaa7b3e L |
5750 | /* Update wild statements. */ |
5751 | update_wild_statements (statement_list.head); | |
5752 | ||
252b5132 | 5753 | /* Run through the contours of the script and attach input sections |
08da4cac | 5754 | to the correct output sections. */ |
1579bae1 | 5755 | map_input_to_output_sections (statement_list.head, NULL, NULL); |
252b5132 | 5756 | |
08da4cac | 5757 | /* Find any sections not attached explicitly and handle them. */ |
252b5132 RH |
5758 | lang_place_orphans (); |
5759 | ||
1049f94e | 5760 | if (! link_info.relocatable) |
862120bd | 5761 | { |
57ceae94 AM |
5762 | asection *found; |
5763 | ||
5764 | /* Merge SEC_MERGE sections. This has to be done after GC of | |
5765 | sections, so that GCed sections are not merged, but before | |
5766 | assigning dynamic symbols, since removing whole input sections | |
5767 | is hard then. */ | |
5768 | bfd_merge_sections (output_bfd, &link_info); | |
5769 | ||
862120bd | 5770 | /* Look for a text section and set the readonly attribute in it. */ |
57ceae94 | 5771 | found = bfd_get_section_by_name (output_bfd, ".text"); |
862120bd | 5772 | |
1579bae1 | 5773 | if (found != NULL) |
862120bd AM |
5774 | { |
5775 | if (config.text_read_only) | |
5776 | found->flags |= SEC_READONLY; | |
5777 | else | |
5778 | found->flags &= ~SEC_READONLY; | |
5779 | } | |
5780 | } | |
5781 | ||
5782 | /* Do anything special before sizing sections. This is where ELF | |
5783 | and other back-ends size dynamic sections. */ | |
252b5132 RH |
5784 | ldemul_before_allocation (); |
5785 | ||
5786 | /* We must record the program headers before we try to fix the | |
5787 | section positions, since they will affect SIZEOF_HEADERS. */ | |
5788 | lang_record_phdrs (); | |
5789 | ||
b3327aad | 5790 | /* Size up the sections. */ |
e9ee469a | 5791 | lang_size_sections (NULL, !command_line.relax); |
b3327aad | 5792 | |
08da4cac | 5793 | /* Now run around and relax if we can. */ |
252b5132 RH |
5794 | if (command_line.relax) |
5795 | { | |
fbbc3759 L |
5796 | /* We may need more than one relaxation pass. */ |
5797 | int i = link_info.relax_pass; | |
252b5132 | 5798 | |
fbbc3759 L |
5799 | /* The backend can use it to determine the current pass. */ |
5800 | link_info.relax_pass = 0; | |
252b5132 | 5801 | |
fbbc3759 L |
5802 | while (i--) |
5803 | { | |
5804 | relax_sections (); | |
5805 | link_info.relax_pass++; | |
252b5132 | 5806 | } |
cf888e70 NC |
5807 | |
5808 | /* Final extra sizing to report errors. */ | |
e9ee469a | 5809 | lang_do_assignments (); |
5a46fe39 | 5810 | lang_reset_memory_regions (); |
e9ee469a | 5811 | lang_size_sections (NULL, TRUE); |
252b5132 | 5812 | } |
252b5132 RH |
5813 | |
5814 | /* See if anything special should be done now we know how big | |
5815 | everything is. */ | |
5816 | ldemul_after_allocation (); | |
5817 | ||
5818 | /* Fix any .startof. or .sizeof. symbols. */ | |
5819 | lang_set_startof (); | |
5820 | ||
08da4cac KH |
5821 | /* Do all the assignments, now that we know the final resting places |
5822 | of all the symbols. */ | |
252b5132 | 5823 | |
e9ee469a | 5824 | lang_do_assignments (); |
252b5132 | 5825 | |
8ded5a0f AM |
5826 | ldemul_finish (); |
5827 | ||
252b5132 | 5828 | /* Make sure that the section addresses make sense. */ |
1049f94e | 5829 | if (! link_info.relocatable |
252b5132 RH |
5830 | && command_line.check_section_addresses) |
5831 | lang_check_section_addresses (); | |
5f992e62 | 5832 | |
750877ba | 5833 | lang_end (); |
252b5132 RH |
5834 | } |
5835 | ||
5836 | /* EXPORTED TO YACC */ | |
5837 | ||
5838 | void | |
1579bae1 AM |
5839 | lang_add_wild (struct wildcard_spec *filespec, |
5840 | struct wildcard_list *section_list, | |
5841 | bfd_boolean keep_sections) | |
252b5132 | 5842 | { |
b6bf44ba AM |
5843 | struct wildcard_list *curr, *next; |
5844 | lang_wild_statement_type *new; | |
5845 | ||
5846 | /* Reverse the list as the parser puts it back to front. */ | |
5847 | for (curr = section_list, section_list = NULL; | |
5848 | curr != NULL; | |
5849 | section_list = curr, curr = next) | |
5850 | { | |
5851 | if (curr->spec.name != NULL && strcmp (curr->spec.name, "COMMON") == 0) | |
b34976b6 | 5852 | placed_commons = TRUE; |
252b5132 | 5853 | |
b6bf44ba AM |
5854 | next = curr->next; |
5855 | curr->next = section_list; | |
5856 | } | |
5857 | ||
5858 | if (filespec != NULL && filespec->name != NULL) | |
252b5132 | 5859 | { |
b6bf44ba AM |
5860 | if (strcmp (filespec->name, "*") == 0) |
5861 | filespec->name = NULL; | |
5862 | else if (! wildcardp (filespec->name)) | |
b34976b6 | 5863 | lang_has_input_file = TRUE; |
252b5132 | 5864 | } |
b6bf44ba AM |
5865 | |
5866 | new = new_stat (lang_wild_statement, stat_ptr); | |
5867 | new->filename = NULL; | |
b34976b6 | 5868 | new->filenames_sorted = FALSE; |
b6bf44ba | 5869 | if (filespec != NULL) |
252b5132 | 5870 | { |
b6bf44ba | 5871 | new->filename = filespec->name; |
bcaa7b3e | 5872 | new->filenames_sorted = filespec->sorted == by_name; |
252b5132 | 5873 | } |
b6bf44ba | 5874 | new->section_list = section_list; |
252b5132 | 5875 | new->keep_sections = keep_sections; |
252b5132 | 5876 | lang_list_init (&new->children); |
72223188 | 5877 | analyze_walk_wild_section_handler (new); |
252b5132 RH |
5878 | } |
5879 | ||
5880 | void | |
ba916c8a MM |
5881 | lang_section_start (const char *name, etree_type *address, |
5882 | const segment_type *segment) | |
252b5132 | 5883 | { |
d1778b88 | 5884 | lang_address_statement_type *ad; |
252b5132 | 5885 | |
d1778b88 | 5886 | ad = new_stat (lang_address_statement, stat_ptr); |
252b5132 RH |
5887 | ad->section_name = name; |
5888 | ad->address = address; | |
ba916c8a | 5889 | ad->segment = segment; |
252b5132 RH |
5890 | } |
5891 | ||
5892 | /* Set the start symbol to NAME. CMDLINE is nonzero if this is called | |
5893 | because of a -e argument on the command line, or zero if this is | |
5894 | called by ENTRY in a linker script. Command line arguments take | |
5895 | precedence. */ | |
5896 | ||
5897 | void | |
1579bae1 | 5898 | lang_add_entry (const char *name, bfd_boolean cmdline) |
252b5132 | 5899 | { |
e3e942e9 | 5900 | if (entry_symbol.name == NULL |
252b5132 RH |
5901 | || cmdline |
5902 | || ! entry_from_cmdline) | |
5903 | { | |
e3e942e9 | 5904 | entry_symbol.name = name; |
252b5132 RH |
5905 | entry_from_cmdline = cmdline; |
5906 | } | |
5907 | } | |
5908 | ||
a359509e ZW |
5909 | /* Set the default start symbol to NAME. .em files should use this, |
5910 | not lang_add_entry, to override the use of "start" if neither the | |
5911 | linker script nor the command line specifies an entry point. NAME | |
5912 | must be permanently allocated. */ | |
5913 | void | |
5914 | lang_default_entry (const char *name) | |
5915 | { | |
5916 | entry_symbol_default = name; | |
5917 | } | |
5918 | ||
252b5132 | 5919 | void |
1579bae1 | 5920 | lang_add_target (const char *name) |
252b5132 | 5921 | { |
bd4d42c1 | 5922 | lang_target_statement_type *new; |
252b5132 | 5923 | |
bd4d42c1 | 5924 | new = new_stat (lang_target_statement, stat_ptr); |
252b5132 | 5925 | new->target = name; |
252b5132 RH |
5926 | } |
5927 | ||
5928 | void | |
1579bae1 | 5929 | lang_add_map (const char *name) |
252b5132 RH |
5930 | { |
5931 | while (*name) | |
5932 | { | |
5933 | switch (*name) | |
5934 | { | |
08da4cac | 5935 | case 'F': |
b34976b6 | 5936 | map_option_f = TRUE; |
252b5132 RH |
5937 | break; |
5938 | } | |
5939 | name++; | |
5940 | } | |
5941 | } | |
5942 | ||
5943 | void | |
1579bae1 | 5944 | lang_add_fill (fill_type *fill) |
252b5132 | 5945 | { |
bd4d42c1 | 5946 | lang_fill_statement_type *new; |
252b5132 | 5947 | |
bd4d42c1 | 5948 | new = new_stat (lang_fill_statement, stat_ptr); |
2c382fb6 | 5949 | new->fill = fill; |
252b5132 RH |
5950 | } |
5951 | ||
5952 | void | |
1579bae1 | 5953 | lang_add_data (int type, union etree_union *exp) |
252b5132 | 5954 | { |
bd4d42c1 | 5955 | lang_data_statement_type *new; |
252b5132 | 5956 | |
bd4d42c1 | 5957 | new = new_stat (lang_data_statement, stat_ptr); |
252b5132 RH |
5958 | new->exp = exp; |
5959 | new->type = type; | |
252b5132 RH |
5960 | } |
5961 | ||
5962 | /* Create a new reloc statement. RELOC is the BFD relocation type to | |
5963 | generate. HOWTO is the corresponding howto structure (we could | |
5964 | look this up, but the caller has already done so). SECTION is the | |
5965 | section to generate a reloc against, or NAME is the name of the | |
5966 | symbol to generate a reloc against. Exactly one of SECTION and | |
5967 | NAME must be NULL. ADDEND is an expression for the addend. */ | |
5968 | ||
5969 | void | |
1579bae1 AM |
5970 | lang_add_reloc (bfd_reloc_code_real_type reloc, |
5971 | reloc_howto_type *howto, | |
5972 | asection *section, | |
5973 | const char *name, | |
5974 | union etree_union *addend) | |
252b5132 RH |
5975 | { |
5976 | lang_reloc_statement_type *p = new_stat (lang_reloc_statement, stat_ptr); | |
5f992e62 | 5977 | |
252b5132 RH |
5978 | p->reloc = reloc; |
5979 | p->howto = howto; | |
5980 | p->section = section; | |
5981 | p->name = name; | |
5982 | p->addend_exp = addend; | |
5983 | ||
5984 | p->addend_value = 0; | |
5985 | p->output_section = NULL; | |
7fabd029 | 5986 | p->output_offset = 0; |
252b5132 RH |
5987 | } |
5988 | ||
5989 | lang_assignment_statement_type * | |
1579bae1 | 5990 | lang_add_assignment (etree_type *exp) |
252b5132 | 5991 | { |
bd4d42c1 | 5992 | lang_assignment_statement_type *new; |
252b5132 | 5993 | |
bd4d42c1 | 5994 | new = new_stat (lang_assignment_statement, stat_ptr); |
252b5132 RH |
5995 | new->exp = exp; |
5996 | return new; | |
5997 | } | |
5998 | ||
5999 | void | |
1579bae1 | 6000 | lang_add_attribute (enum statement_enum attribute) |
252b5132 | 6001 | { |
bd4d42c1 | 6002 | new_statement (attribute, sizeof (lang_statement_header_type), stat_ptr); |
252b5132 RH |
6003 | } |
6004 | ||
6005 | void | |
1579bae1 | 6006 | lang_startup (const char *name) |
252b5132 | 6007 | { |
1579bae1 | 6008 | if (startup_file != NULL) |
252b5132 | 6009 | { |
4520f868 | 6010 | einfo (_("%P%F: multiple STARTUP files\n")); |
252b5132 RH |
6011 | } |
6012 | first_file->filename = name; | |
6013 | first_file->local_sym_name = name; | |
b34976b6 | 6014 | first_file->real = TRUE; |
252b5132 RH |
6015 | |
6016 | startup_file = name; | |
6017 | } | |
6018 | ||
6019 | void | |
1579bae1 | 6020 | lang_float (bfd_boolean maybe) |
252b5132 RH |
6021 | { |
6022 | lang_float_flag = maybe; | |
6023 | } | |
6024 | ||
ee3cc2e2 RS |
6025 | |
6026 | /* Work out the load- and run-time regions from a script statement, and | |
6027 | store them in *LMA_REGION and *REGION respectively. | |
6028 | ||
a747ee4d NC |
6029 | MEMSPEC is the name of the run-time region, or the value of |
6030 | DEFAULT_MEMORY_REGION if the statement didn't specify one. | |
6031 | LMA_MEMSPEC is the name of the load-time region, or null if the | |
6032 | statement didn't specify one.HAVE_LMA_P is TRUE if the statement | |
6033 | had an explicit load address. | |
ee3cc2e2 RS |
6034 | |
6035 | It is an error to specify both a load region and a load address. */ | |
6036 | ||
6037 | static void | |
6bdafbeb NC |
6038 | lang_get_regions (lang_memory_region_type **region, |
6039 | lang_memory_region_type **lma_region, | |
1579bae1 AM |
6040 | const char *memspec, |
6041 | const char *lma_memspec, | |
6bdafbeb NC |
6042 | bfd_boolean have_lma, |
6043 | bfd_boolean have_vma) | |
ee3cc2e2 | 6044 | { |
a747ee4d | 6045 | *lma_region = lang_memory_region_lookup (lma_memspec, FALSE); |
ee3cc2e2 | 6046 | |
6feb9908 AM |
6047 | /* If no runtime region or VMA has been specified, but the load region |
6048 | has been specified, then use the load region for the runtime region | |
6049 | as well. */ | |
6bdafbeb NC |
6050 | if (lma_memspec != NULL |
6051 | && ! have_vma | |
6052 | && strcmp (memspec, DEFAULT_MEMORY_REGION) == 0) | |
ee3cc2e2 RS |
6053 | *region = *lma_region; |
6054 | else | |
a747ee4d | 6055 | *region = lang_memory_region_lookup (memspec, FALSE); |
ee3cc2e2 | 6056 | |
6bdafbeb | 6057 | if (have_lma && lma_memspec != 0) |
ee3cc2e2 RS |
6058 | einfo (_("%X%P:%S: section has both a load address and a load region\n")); |
6059 | } | |
6060 | ||
252b5132 | 6061 | void |
6bdafbeb NC |
6062 | lang_leave_output_section_statement (fill_type *fill, const char *memspec, |
6063 | lang_output_section_phdr_list *phdrs, | |
6064 | const char *lma_memspec) | |
252b5132 | 6065 | { |
ee3cc2e2 RS |
6066 | lang_get_regions (¤t_section->region, |
6067 | ¤t_section->lma_region, | |
6068 | memspec, lma_memspec, | |
6bdafbeb NC |
6069 | current_section->load_base != NULL, |
6070 | current_section->addr_tree != NULL); | |
252b5132 | 6071 | current_section->fill = fill; |
252b5132 RH |
6072 | current_section->phdrs = phdrs; |
6073 | stat_ptr = &statement_list; | |
6074 | } | |
6075 | ||
08da4cac KH |
6076 | /* Create an absolute symbol with the given name with the value of the |
6077 | address of first byte of the section named. | |
6078 | ||
6079 | If the symbol already exists, then do nothing. */ | |
252b5132 | 6080 | |
252b5132 | 6081 | void |
1579bae1 | 6082 | lang_abs_symbol_at_beginning_of (const char *secname, const char *name) |
252b5132 RH |
6083 | { |
6084 | struct bfd_link_hash_entry *h; | |
6085 | ||
b34976b6 | 6086 | h = bfd_link_hash_lookup (link_info.hash, name, TRUE, TRUE, TRUE); |
1579bae1 | 6087 | if (h == NULL) |
252b5132 RH |
6088 | einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n")); |
6089 | ||
6090 | if (h->type == bfd_link_hash_new | |
6091 | || h->type == bfd_link_hash_undefined) | |
6092 | { | |
6093 | asection *sec; | |
6094 | ||
6095 | h->type = bfd_link_hash_defined; | |
6096 | ||
6097 | sec = bfd_get_section_by_name (output_bfd, secname); | |
1579bae1 | 6098 | if (sec == NULL) |
252b5132 RH |
6099 | h->u.def.value = 0; |
6100 | else | |
6101 | h->u.def.value = bfd_get_section_vma (output_bfd, sec); | |
6102 | ||
6103 | h->u.def.section = bfd_abs_section_ptr; | |
6104 | } | |
6105 | } | |
6106 | ||
08da4cac KH |
6107 | /* Create an absolute symbol with the given name with the value of the |
6108 | address of the first byte after the end of the section named. | |
6109 | ||
6110 | If the symbol already exists, then do nothing. */ | |
252b5132 | 6111 | |
252b5132 | 6112 | void |
1579bae1 | 6113 | lang_abs_symbol_at_end_of (const char *secname, const char *name) |
252b5132 RH |
6114 | { |
6115 | struct bfd_link_hash_entry *h; | |
6116 | ||
b34976b6 | 6117 | h = bfd_link_hash_lookup (link_info.hash, name, TRUE, TRUE, TRUE); |
1579bae1 | 6118 | if (h == NULL) |
252b5132 RH |
6119 | einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n")); |
6120 | ||
6121 | if (h->type == bfd_link_hash_new | |
6122 | || h->type == bfd_link_hash_undefined) | |
6123 | { | |
6124 | asection *sec; | |
6125 | ||
6126 | h->type = bfd_link_hash_defined; | |
6127 | ||
6128 | sec = bfd_get_section_by_name (output_bfd, secname); | |
1579bae1 | 6129 | if (sec == NULL) |
252b5132 RH |
6130 | h->u.def.value = 0; |
6131 | else | |
6132 | h->u.def.value = (bfd_get_section_vma (output_bfd, sec) | |
eea6121a | 6133 | + TO_ADDR (sec->size)); |
252b5132 RH |
6134 | |
6135 | h->u.def.section = bfd_abs_section_ptr; | |
6136 | } | |
6137 | } | |
6138 | ||
6139 | void | |
1579bae1 AM |
6140 | lang_statement_append (lang_statement_list_type *list, |
6141 | lang_statement_union_type *element, | |
6142 | lang_statement_union_type **field) | |
252b5132 RH |
6143 | { |
6144 | *(list->tail) = element; | |
6145 | list->tail = field; | |
6146 | } | |
6147 | ||
6148 | /* Set the output format type. -oformat overrides scripts. */ | |
6149 | ||
6150 | void | |
1579bae1 AM |
6151 | lang_add_output_format (const char *format, |
6152 | const char *big, | |
6153 | const char *little, | |
6154 | int from_script) | |
252b5132 RH |
6155 | { |
6156 | if (output_target == NULL || !from_script) | |
6157 | { | |
6158 | if (command_line.endian == ENDIAN_BIG | |
6159 | && big != NULL) | |
6160 | format = big; | |
6161 | else if (command_line.endian == ENDIAN_LITTLE | |
6162 | && little != NULL) | |
6163 | format = little; | |
6164 | ||
6165 | output_target = format; | |
6166 | } | |
6167 | } | |
6168 | ||
6169 | /* Enter a group. This creates a new lang_group_statement, and sets | |
6170 | stat_ptr to build new statements within the group. */ | |
6171 | ||
6172 | void | |
1579bae1 | 6173 | lang_enter_group (void) |
252b5132 RH |
6174 | { |
6175 | lang_group_statement_type *g; | |
6176 | ||
6177 | g = new_stat (lang_group_statement, stat_ptr); | |
6178 | lang_list_init (&g->children); | |
6179 | stat_ptr = &g->children; | |
6180 | } | |
6181 | ||
6182 | /* Leave a group. This just resets stat_ptr to start writing to the | |
6183 | regular list of statements again. Note that this will not work if | |
6184 | groups can occur inside anything else which can adjust stat_ptr, | |
6185 | but currently they can't. */ | |
6186 | ||
6187 | void | |
1579bae1 | 6188 | lang_leave_group (void) |
252b5132 RH |
6189 | { |
6190 | stat_ptr = &statement_list; | |
6191 | } | |
6192 | ||
6193 | /* Add a new program header. This is called for each entry in a PHDRS | |
6194 | command in a linker script. */ | |
6195 | ||
6196 | void | |
1579bae1 AM |
6197 | lang_new_phdr (const char *name, |
6198 | etree_type *type, | |
6199 | bfd_boolean filehdr, | |
6200 | bfd_boolean phdrs, | |
6201 | etree_type *at, | |
6202 | etree_type *flags) | |
252b5132 RH |
6203 | { |
6204 | struct lang_phdr *n, **pp; | |
6205 | ||
1579bae1 | 6206 | n = stat_alloc (sizeof (struct lang_phdr)); |
252b5132 RH |
6207 | n->next = NULL; |
6208 | n->name = name; | |
e9ee469a | 6209 | n->type = exp_get_value_int (type, 0, "program header type"); |
252b5132 RH |
6210 | n->filehdr = filehdr; |
6211 | n->phdrs = phdrs; | |
6212 | n->at = at; | |
6213 | n->flags = flags; | |
6214 | ||
6215 | for (pp = &lang_phdr_list; *pp != NULL; pp = &(*pp)->next) | |
6216 | ; | |
6217 | *pp = n; | |
6218 | } | |
6219 | ||
6220 | /* Record the program header information in the output BFD. FIXME: We | |
6221 | should not be calling an ELF specific function here. */ | |
6222 | ||
6223 | static void | |
1579bae1 | 6224 | lang_record_phdrs (void) |
252b5132 RH |
6225 | { |
6226 | unsigned int alc; | |
6227 | asection **secs; | |
6bdafbeb | 6228 | lang_output_section_phdr_list *last; |
252b5132 | 6229 | struct lang_phdr *l; |
afd7a018 | 6230 | lang_output_section_statement_type *os; |
252b5132 RH |
6231 | |
6232 | alc = 10; | |
1579bae1 | 6233 | secs = xmalloc (alc * sizeof (asection *)); |
252b5132 | 6234 | last = NULL; |
591a748a | 6235 | |
252b5132 RH |
6236 | for (l = lang_phdr_list; l != NULL; l = l->next) |
6237 | { | |
6238 | unsigned int c; | |
6239 | flagword flags; | |
6240 | bfd_vma at; | |
6241 | ||
6242 | c = 0; | |
afd7a018 AM |
6243 | for (os = &lang_output_section_statement.head->output_section_statement; |
6244 | os != NULL; | |
6245 | os = os->next) | |
252b5132 | 6246 | { |
6bdafbeb | 6247 | lang_output_section_phdr_list *pl; |
252b5132 | 6248 | |
0841712e JJ |
6249 | if (os->constraint == -1) |
6250 | continue; | |
252b5132 RH |
6251 | |
6252 | pl = os->phdrs; | |
6253 | if (pl != NULL) | |
6254 | last = pl; | |
6255 | else | |
6256 | { | |
6257 | if (os->sectype == noload_section | |
6258 | || os->bfd_section == NULL | |
6259 | || (os->bfd_section->flags & SEC_ALLOC) == 0) | |
6260 | continue; | |
591a748a NC |
6261 | |
6262 | if (last) | |
6263 | pl = last; | |
6264 | else | |
6265 | { | |
6266 | lang_output_section_statement_type * tmp_os; | |
6267 | ||
6268 | /* If we have not run across a section with a program | |
6269 | header assigned to it yet, then scan forwards to find | |
6270 | one. This prevents inconsistencies in the linker's | |
6271 | behaviour when a script has specified just a single | |
6272 | header and there are sections in that script which are | |
6273 | not assigned to it, and which occur before the first | |
6274 | use of that header. See here for more details: | |
6275 | http://sourceware.org/ml/binutils/2007-02/msg00291.html */ | |
6276 | for (tmp_os = os; tmp_os; tmp_os = tmp_os->next) | |
6277 | if (tmp_os->phdrs) | |
6278 | break; | |
6279 | pl = tmp_os->phdrs; | |
6280 | } | |
252b5132 RH |
6281 | } |
6282 | ||
6283 | if (os->bfd_section == NULL) | |
6284 | continue; | |
6285 | ||
6286 | for (; pl != NULL; pl = pl->next) | |
6287 | { | |
6288 | if (strcmp (pl->name, l->name) == 0) | |
6289 | { | |
6290 | if (c >= alc) | |
6291 | { | |
6292 | alc *= 2; | |
1579bae1 | 6293 | secs = xrealloc (secs, alc * sizeof (asection *)); |
252b5132 RH |
6294 | } |
6295 | secs[c] = os->bfd_section; | |
6296 | ++c; | |
b34976b6 | 6297 | pl->used = TRUE; |
252b5132 RH |
6298 | } |
6299 | } | |
6300 | } | |
6301 | ||
6302 | if (l->flags == NULL) | |
6303 | flags = 0; | |
6304 | else | |
e9ee469a | 6305 | flags = exp_get_vma (l->flags, 0, "phdr flags"); |
252b5132 RH |
6306 | |
6307 | if (l->at == NULL) | |
6308 | at = 0; | |
6309 | else | |
e9ee469a | 6310 | at = exp_get_vma (l->at, 0, "phdr load address"); |
252b5132 RH |
6311 | |
6312 | if (! bfd_record_phdr (output_bfd, l->type, | |
d1778b88 | 6313 | l->flags != NULL, flags, l->at != NULL, |
252b5132 RH |
6314 | at, l->filehdr, l->phdrs, c, secs)) |
6315 | einfo (_("%F%P: bfd_record_phdr failed: %E\n")); | |
6316 | } | |
6317 | ||
6318 | free (secs); | |
6319 | ||
6320 | /* Make sure all the phdr assignments succeeded. */ | |
afd7a018 AM |
6321 | for (os = &lang_output_section_statement.head->output_section_statement; |
6322 | os != NULL; | |
6323 | os = os->next) | |
252b5132 | 6324 | { |
6bdafbeb | 6325 | lang_output_section_phdr_list *pl; |
252b5132 | 6326 | |
afd7a018 AM |
6327 | if (os->constraint == -1 |
6328 | || os->bfd_section == NULL) | |
252b5132 RH |
6329 | continue; |
6330 | ||
afd7a018 | 6331 | for (pl = os->phdrs; |
252b5132 RH |
6332 | pl != NULL; |
6333 | pl = pl->next) | |
6334 | if (! pl->used && strcmp (pl->name, "NONE") != 0) | |
6335 | einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"), | |
afd7a018 | 6336 | os->name, pl->name); |
252b5132 RH |
6337 | } |
6338 | } | |
6339 | ||
6340 | /* Record a list of sections which may not be cross referenced. */ | |
6341 | ||
6342 | void | |
6bdafbeb | 6343 | lang_add_nocrossref (lang_nocrossref_type *l) |
252b5132 RH |
6344 | { |
6345 | struct lang_nocrossrefs *n; | |
6346 | ||
1579bae1 | 6347 | n = xmalloc (sizeof *n); |
252b5132 RH |
6348 | n->next = nocrossref_list; |
6349 | n->list = l; | |
6350 | nocrossref_list = n; | |
6351 | ||
6352 | /* Set notice_all so that we get informed about all symbols. */ | |
b34976b6 | 6353 | link_info.notice_all = TRUE; |
252b5132 RH |
6354 | } |
6355 | \f | |
6356 | /* Overlay handling. We handle overlays with some static variables. */ | |
6357 | ||
6358 | /* The overlay virtual address. */ | |
6359 | static etree_type *overlay_vma; | |
7e7d5768 AM |
6360 | /* And subsection alignment. */ |
6361 | static etree_type *overlay_subalign; | |
252b5132 | 6362 | |
252b5132 RH |
6363 | /* An expression for the maximum section size seen so far. */ |
6364 | static etree_type *overlay_max; | |
6365 | ||
6366 | /* A list of all the sections in this overlay. */ | |
6367 | ||
89cdebba | 6368 | struct overlay_list { |
252b5132 RH |
6369 | struct overlay_list *next; |
6370 | lang_output_section_statement_type *os; | |
6371 | }; | |
6372 | ||
6373 | static struct overlay_list *overlay_list; | |
6374 | ||
6375 | /* Start handling an overlay. */ | |
6376 | ||
6377 | void | |
7e7d5768 | 6378 | lang_enter_overlay (etree_type *vma_expr, etree_type *subalign) |
252b5132 RH |
6379 | { |
6380 | /* The grammar should prevent nested overlays from occurring. */ | |
7e7d5768 AM |
6381 | ASSERT (overlay_vma == NULL |
6382 | && overlay_subalign == NULL | |
6383 | && overlay_max == NULL); | |
252b5132 RH |
6384 | |
6385 | overlay_vma = vma_expr; | |
7e7d5768 | 6386 | overlay_subalign = subalign; |
252b5132 RH |
6387 | } |
6388 | ||
6389 | /* Start a section in an overlay. We handle this by calling | |
9f88b410 RS |
6390 | lang_enter_output_section_statement with the correct VMA. |
6391 | lang_leave_overlay sets up the LMA and memory regions. */ | |
252b5132 RH |
6392 | |
6393 | void | |
1579bae1 | 6394 | lang_enter_overlay_section (const char *name) |
252b5132 RH |
6395 | { |
6396 | struct overlay_list *n; | |
6397 | etree_type *size; | |
6398 | ||
152d792f | 6399 | lang_enter_output_section_statement (name, overlay_vma, overlay_section, |
0841712e | 6400 | 0, overlay_subalign, 0, 0); |
252b5132 | 6401 | |
9f88b410 | 6402 | /* If this is the first section, then base the VMA of future |
252b5132 RH |
6403 | sections on this one. This will work correctly even if `.' is |
6404 | used in the addresses. */ | |
6405 | if (overlay_list == NULL) | |
9f88b410 | 6406 | overlay_vma = exp_nameop (ADDR, name); |
252b5132 RH |
6407 | |
6408 | /* Remember the section. */ | |
1579bae1 | 6409 | n = xmalloc (sizeof *n); |
252b5132 RH |
6410 | n->os = current_section; |
6411 | n->next = overlay_list; | |
6412 | overlay_list = n; | |
6413 | ||
6414 | size = exp_nameop (SIZEOF, name); | |
6415 | ||
252b5132 RH |
6416 | /* Arrange to work out the maximum section end address. */ |
6417 | if (overlay_max == NULL) | |
6418 | overlay_max = size; | |
6419 | else | |
6420 | overlay_max = exp_binop (MAX_K, overlay_max, size); | |
6421 | } | |
6422 | ||
6423 | /* Finish a section in an overlay. There isn't any special to do | |
6424 | here. */ | |
6425 | ||
6426 | void | |
1579bae1 | 6427 | lang_leave_overlay_section (fill_type *fill, |
6bdafbeb | 6428 | lang_output_section_phdr_list *phdrs) |
252b5132 RH |
6429 | { |
6430 | const char *name; | |
6431 | char *clean, *s2; | |
6432 | const char *s1; | |
6433 | char *buf; | |
6434 | ||
6435 | name = current_section->name; | |
6436 | ||
a747ee4d NC |
6437 | /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory |
6438 | region and that no load-time region has been specified. It doesn't | |
6439 | really matter what we say here, since lang_leave_overlay will | |
6440 | override it. */ | |
6441 | lang_leave_output_section_statement (fill, DEFAULT_MEMORY_REGION, phdrs, 0); | |
252b5132 RH |
6442 | |
6443 | /* Define the magic symbols. */ | |
6444 | ||
6445 | clean = xmalloc (strlen (name) + 1); | |
6446 | s2 = clean; | |
6447 | for (s1 = name; *s1 != '\0'; s1++) | |
3882b010 | 6448 | if (ISALNUM (*s1) || *s1 == '_') |
252b5132 RH |
6449 | *s2++ = *s1; |
6450 | *s2 = '\0'; | |
6451 | ||
6452 | buf = xmalloc (strlen (clean) + sizeof "__load_start_"); | |
6453 | sprintf (buf, "__load_start_%s", clean); | |
34711ca3 AM |
6454 | lang_add_assignment (exp_provide (buf, |
6455 | exp_nameop (LOADADDR, name), | |
6456 | FALSE)); | |
252b5132 RH |
6457 | |
6458 | buf = xmalloc (strlen (clean) + sizeof "__load_stop_"); | |
6459 | sprintf (buf, "__load_stop_%s", clean); | |
34711ca3 AM |
6460 | lang_add_assignment (exp_provide (buf, |
6461 | exp_binop ('+', | |
6462 | exp_nameop (LOADADDR, name), | |
6463 | exp_nameop (SIZEOF, name)), | |
6464 | FALSE)); | |
252b5132 RH |
6465 | |
6466 | free (clean); | |
6467 | } | |
6468 | ||
6469 | /* Finish an overlay. If there are any overlay wide settings, this | |
6470 | looks through all the sections in the overlay and sets them. */ | |
6471 | ||
6472 | void | |
1579bae1 AM |
6473 | lang_leave_overlay (etree_type *lma_expr, |
6474 | int nocrossrefs, | |
6475 | fill_type *fill, | |
6476 | const char *memspec, | |
6bdafbeb | 6477 | lang_output_section_phdr_list *phdrs, |
1579bae1 | 6478 | const char *lma_memspec) |
252b5132 RH |
6479 | { |
6480 | lang_memory_region_type *region; | |
562d3460 | 6481 | lang_memory_region_type *lma_region; |
252b5132 | 6482 | struct overlay_list *l; |
6bdafbeb | 6483 | lang_nocrossref_type *nocrossref; |
252b5132 | 6484 | |
ee3cc2e2 RS |
6485 | lang_get_regions (®ion, &lma_region, |
6486 | memspec, lma_memspec, | |
6bdafbeb | 6487 | lma_expr != NULL, FALSE); |
562d3460 | 6488 | |
252b5132 RH |
6489 | nocrossref = NULL; |
6490 | ||
9f88b410 RS |
6491 | /* After setting the size of the last section, set '.' to end of the |
6492 | overlay region. */ | |
6493 | if (overlay_list != NULL) | |
6494 | overlay_list->os->update_dot_tree | |
6495 | = exp_assop ('=', ".", exp_binop ('+', overlay_vma, overlay_max)); | |
6496 | ||
252b5132 RH |
6497 | l = overlay_list; |
6498 | while (l != NULL) | |
6499 | { | |
6500 | struct overlay_list *next; | |
6501 | ||
1579bae1 | 6502 | if (fill != NULL && l->os->fill == NULL) |
252b5132 | 6503 | l->os->fill = fill; |
1545243b | 6504 | |
9f88b410 RS |
6505 | l->os->region = region; |
6506 | l->os->lma_region = lma_region; | |
6507 | ||
6508 | /* The first section has the load address specified in the | |
6509 | OVERLAY statement. The rest are worked out from that. | |
6510 | The base address is not needed (and should be null) if | |
6511 | an LMA region was specified. */ | |
6512 | if (l->next == 0) | |
152d792f AM |
6513 | { |
6514 | l->os->load_base = lma_expr; | |
6515 | l->os->sectype = normal_section; | |
6516 | } | |
252b5132 RH |
6517 | if (phdrs != NULL && l->os->phdrs == NULL) |
6518 | l->os->phdrs = phdrs; | |
6519 | ||
9f88b410 | 6520 | if (nocrossrefs) |
252b5132 | 6521 | { |
6bdafbeb | 6522 | lang_nocrossref_type *nc; |
252b5132 | 6523 | |
1579bae1 | 6524 | nc = xmalloc (sizeof *nc); |
252b5132 RH |
6525 | nc->name = l->os->name; |
6526 | nc->next = nocrossref; | |
6527 | nocrossref = nc; | |
6528 | } | |
6529 | ||
6530 | next = l->next; | |
6531 | free (l); | |
6532 | l = next; | |
6533 | } | |
6534 | ||
6535 | if (nocrossref != NULL) | |
6536 | lang_add_nocrossref (nocrossref); | |
6537 | ||
252b5132 | 6538 | overlay_vma = NULL; |
252b5132 RH |
6539 | overlay_list = NULL; |
6540 | overlay_max = NULL; | |
6541 | } | |
6542 | \f | |
6543 | /* Version handling. This is only useful for ELF. */ | |
6544 | ||
6545 | /* This global variable holds the version tree that we build. */ | |
6546 | ||
6547 | struct bfd_elf_version_tree *lang_elf_version_info; | |
6548 | ||
108ba305 JJ |
6549 | /* If PREV is NULL, return first version pattern matching particular symbol. |
6550 | If PREV is non-NULL, return first version pattern matching particular | |
6551 | symbol after PREV (previously returned by lang_vers_match). */ | |
252b5132 | 6552 | |
108ba305 JJ |
6553 | static struct bfd_elf_version_expr * |
6554 | lang_vers_match (struct bfd_elf_version_expr_head *head, | |
6555 | struct bfd_elf_version_expr *prev, | |
6556 | const char *sym) | |
252b5132 | 6557 | { |
108ba305 JJ |
6558 | const char *cxx_sym = sym; |
6559 | const char *java_sym = sym; | |
6560 | struct bfd_elf_version_expr *expr = NULL; | |
252b5132 | 6561 | |
108ba305 | 6562 | if (head->mask & BFD_ELF_VERSION_CXX_TYPE) |
252b5132 | 6563 | { |
2f97444a | 6564 | cxx_sym = cplus_demangle (sym, DMGL_PARAMS | DMGL_ANSI); |
108ba305 JJ |
6565 | if (!cxx_sym) |
6566 | cxx_sym = sym; | |
252b5132 | 6567 | } |
df816215 | 6568 | if (head->mask & BFD_ELF_VERSION_JAVA_TYPE) |
252b5132 | 6569 | { |
108ba305 JJ |
6570 | java_sym = cplus_demangle (sym, DMGL_JAVA); |
6571 | if (!java_sym) | |
6572 | java_sym = sym; | |
252b5132 RH |
6573 | } |
6574 | ||
5e35cbc2 | 6575 | if (head->htab && (prev == NULL || prev->symbol)) |
252b5132 | 6576 | { |
108ba305 JJ |
6577 | struct bfd_elf_version_expr e; |
6578 | ||
6579 | switch (prev ? prev->mask : 0) | |
6580 | { | |
6581 | case 0: | |
6582 | if (head->mask & BFD_ELF_VERSION_C_TYPE) | |
6583 | { | |
5e35cbc2 | 6584 | e.symbol = sym; |
108ba305 | 6585 | expr = htab_find (head->htab, &e); |
5e35cbc2 | 6586 | while (expr && strcmp (expr->symbol, sym) == 0) |
108ba305 JJ |
6587 | if (expr->mask == BFD_ELF_VERSION_C_TYPE) |
6588 | goto out_ret; | |
86043bbb MM |
6589 | else |
6590 | expr = expr->next; | |
108ba305 JJ |
6591 | } |
6592 | /* Fallthrough */ | |
6593 | case BFD_ELF_VERSION_C_TYPE: | |
6594 | if (head->mask & BFD_ELF_VERSION_CXX_TYPE) | |
6595 | { | |
5e35cbc2 | 6596 | e.symbol = cxx_sym; |
108ba305 | 6597 | expr = htab_find (head->htab, &e); |
7a995eb3 | 6598 | while (expr && strcmp (expr->symbol, cxx_sym) == 0) |
108ba305 JJ |
6599 | if (expr->mask == BFD_ELF_VERSION_CXX_TYPE) |
6600 | goto out_ret; | |
86043bbb MM |
6601 | else |
6602 | expr = expr->next; | |
108ba305 JJ |
6603 | } |
6604 | /* Fallthrough */ | |
6605 | case BFD_ELF_VERSION_CXX_TYPE: | |
6606 | if (head->mask & BFD_ELF_VERSION_JAVA_TYPE) | |
6607 | { | |
5e35cbc2 | 6608 | e.symbol = java_sym; |
108ba305 | 6609 | expr = htab_find (head->htab, &e); |
7a995eb3 | 6610 | while (expr && strcmp (expr->symbol, java_sym) == 0) |
108ba305 JJ |
6611 | if (expr->mask == BFD_ELF_VERSION_JAVA_TYPE) |
6612 | goto out_ret; | |
86043bbb MM |
6613 | else |
6614 | expr = expr->next; | |
108ba305 JJ |
6615 | } |
6616 | /* Fallthrough */ | |
6617 | default: | |
6618 | break; | |
6619 | } | |
252b5132 | 6620 | } |
108ba305 JJ |
6621 | |
6622 | /* Finally, try the wildcards. */ | |
5e35cbc2 | 6623 | if (prev == NULL || prev->symbol) |
108ba305 | 6624 | expr = head->remaining; |
252b5132 | 6625 | else |
108ba305 | 6626 | expr = prev->next; |
86043bbb | 6627 | for (; expr; expr = expr->next) |
252b5132 | 6628 | { |
108ba305 JJ |
6629 | const char *s; |
6630 | ||
86043bbb MM |
6631 | if (!expr->pattern) |
6632 | continue; | |
6633 | ||
108ba305 JJ |
6634 | if (expr->pattern[0] == '*' && expr->pattern[1] == '\0') |
6635 | break; | |
6636 | ||
6637 | if (expr->mask == BFD_ELF_VERSION_JAVA_TYPE) | |
6638 | s = java_sym; | |
6639 | else if (expr->mask == BFD_ELF_VERSION_CXX_TYPE) | |
6640 | s = cxx_sym; | |
6641 | else | |
6642 | s = sym; | |
5e35cbc2 | 6643 | if (fnmatch (expr->pattern, s, 0) == 0) |
108ba305 | 6644 | break; |
252b5132 RH |
6645 | } |
6646 | ||
108ba305 JJ |
6647 | out_ret: |
6648 | if (cxx_sym != sym) | |
6649 | free ((char *) cxx_sym); | |
6650 | if (java_sym != sym) | |
6651 | free ((char *) java_sym); | |
6652 | return expr; | |
252b5132 RH |
6653 | } |
6654 | ||
5e35cbc2 L |
6655 | /* Return NULL if the PATTERN argument is a glob pattern, otherwise, |
6656 | return a string pointing to the symbol name. */ | |
6657 | ||
6658 | static const char * | |
6659 | realsymbol (const char *pattern) | |
6660 | { | |
6661 | const char *p; | |
6662 | bfd_boolean changed = FALSE, backslash = FALSE; | |
6663 | char *s, *symbol = xmalloc (strlen (pattern) + 1); | |
6664 | ||
6665 | for (p = pattern, s = symbol; *p != '\0'; ++p) | |
6666 | { | |
6667 | /* It is a glob pattern only if there is no preceding | |
6668 | backslash. */ | |
6669 | if (! backslash && (*p == '?' || *p == '*' || *p == '[')) | |
6670 | { | |
6671 | free (symbol); | |
6672 | return NULL; | |
6673 | } | |
6674 | ||
6675 | if (backslash) | |
6676 | { | |
6677 | /* Remove the preceding backslash. */ | |
6678 | *(s - 1) = *p; | |
6679 | changed = TRUE; | |
6680 | } | |
6681 | else | |
6682 | *s++ = *p; | |
6683 | ||
6684 | backslash = *p == '\\'; | |
6685 | } | |
6686 | ||
6687 | if (changed) | |
6688 | { | |
6689 | *s = '\0'; | |
6690 | return symbol; | |
6691 | } | |
6692 | else | |
6693 | { | |
6694 | free (symbol); | |
6695 | return pattern; | |
6696 | } | |
6697 | } | |
6698 | ||
86043bbb MM |
6699 | /* This is called for each variable name or match expression. NEW is |
6700 | the name of the symbol to match, or, if LITERAL_P is FALSE, a glob | |
6701 | pattern to be matched against symbol names. */ | |
252b5132 RH |
6702 | |
6703 | struct bfd_elf_version_expr * | |
1579bae1 AM |
6704 | lang_new_vers_pattern (struct bfd_elf_version_expr *orig, |
6705 | const char *new, | |
86043bbb MM |
6706 | const char *lang, |
6707 | bfd_boolean literal_p) | |
252b5132 RH |
6708 | { |
6709 | struct bfd_elf_version_expr *ret; | |
6710 | ||
1579bae1 | 6711 | ret = xmalloc (sizeof *ret); |
252b5132 | 6712 | ret->next = orig; |
86043bbb | 6713 | ret->pattern = literal_p ? NULL : new; |
31941635 L |
6714 | ret->symver = 0; |
6715 | ret->script = 0; | |
86043bbb | 6716 | ret->symbol = literal_p ? new : realsymbol (new); |
252b5132 RH |
6717 | |
6718 | if (lang == NULL || strcasecmp (lang, "C") == 0) | |
108ba305 | 6719 | ret->mask = BFD_ELF_VERSION_C_TYPE; |
252b5132 | 6720 | else if (strcasecmp (lang, "C++") == 0) |
108ba305 | 6721 | ret->mask = BFD_ELF_VERSION_CXX_TYPE; |
252b5132 | 6722 | else if (strcasecmp (lang, "Java") == 0) |
108ba305 | 6723 | ret->mask = BFD_ELF_VERSION_JAVA_TYPE; |
252b5132 RH |
6724 | else |
6725 | { | |
6726 | einfo (_("%X%P: unknown language `%s' in version information\n"), | |
6727 | lang); | |
108ba305 | 6728 | ret->mask = BFD_ELF_VERSION_C_TYPE; |
252b5132 RH |
6729 | } |
6730 | ||
fac1652d | 6731 | return ldemul_new_vers_pattern (ret); |
252b5132 RH |
6732 | } |
6733 | ||
6734 | /* This is called for each set of variable names and match | |
6735 | expressions. */ | |
6736 | ||
6737 | struct bfd_elf_version_tree * | |
1579bae1 AM |
6738 | lang_new_vers_node (struct bfd_elf_version_expr *globals, |
6739 | struct bfd_elf_version_expr *locals) | |
252b5132 RH |
6740 | { |
6741 | struct bfd_elf_version_tree *ret; | |
6742 | ||
108ba305 JJ |
6743 | ret = xcalloc (1, sizeof *ret); |
6744 | ret->globals.list = globals; | |
6745 | ret->locals.list = locals; | |
6746 | ret->match = lang_vers_match; | |
252b5132 | 6747 | ret->name_indx = (unsigned int) -1; |
252b5132 RH |
6748 | return ret; |
6749 | } | |
6750 | ||
6751 | /* This static variable keeps track of version indices. */ | |
6752 | ||
6753 | static int version_index; | |
6754 | ||
108ba305 JJ |
6755 | static hashval_t |
6756 | version_expr_head_hash (const void *p) | |
6757 | { | |
6758 | const struct bfd_elf_version_expr *e = p; | |
6759 | ||
5e35cbc2 | 6760 | return htab_hash_string (e->symbol); |
108ba305 JJ |
6761 | } |
6762 | ||
6763 | static int | |
6764 | version_expr_head_eq (const void *p1, const void *p2) | |
6765 | { | |
6766 | const struct bfd_elf_version_expr *e1 = p1; | |
6767 | const struct bfd_elf_version_expr *e2 = p2; | |
6768 | ||
5e35cbc2 | 6769 | return strcmp (e1->symbol, e2->symbol) == 0; |
108ba305 JJ |
6770 | } |
6771 | ||
6772 | static void | |
6773 | lang_finalize_version_expr_head (struct bfd_elf_version_expr_head *head) | |
6774 | { | |
6775 | size_t count = 0; | |
6776 | struct bfd_elf_version_expr *e, *next; | |
6777 | struct bfd_elf_version_expr **list_loc, **remaining_loc; | |
6778 | ||
6779 | for (e = head->list; e; e = e->next) | |
6780 | { | |
5e35cbc2 | 6781 | if (e->symbol) |
108ba305 JJ |
6782 | count++; |
6783 | head->mask |= e->mask; | |
6784 | } | |
6785 | ||
6786 | if (count) | |
6787 | { | |
6788 | head->htab = htab_create (count * 2, version_expr_head_hash, | |
6789 | version_expr_head_eq, NULL); | |
6790 | list_loc = &head->list; | |
6791 | remaining_loc = &head->remaining; | |
6792 | for (e = head->list; e; e = next) | |
6793 | { | |
6794 | next = e->next; | |
5e35cbc2 | 6795 | if (!e->symbol) |
108ba305 JJ |
6796 | { |
6797 | *remaining_loc = e; | |
6798 | remaining_loc = &e->next; | |
6799 | } | |
6800 | else | |
6801 | { | |
6802 | void **loc = htab_find_slot (head->htab, e, INSERT); | |
6803 | ||
6804 | if (*loc) | |
6805 | { | |
6806 | struct bfd_elf_version_expr *e1, *last; | |
6807 | ||
6808 | e1 = *loc; | |
6809 | last = NULL; | |
6810 | do | |
6811 | { | |
6812 | if (e1->mask == e->mask) | |
6813 | { | |
6814 | last = NULL; | |
6815 | break; | |
6816 | } | |
6817 | last = e1; | |
6818 | e1 = e1->next; | |
6819 | } | |
5e35cbc2 | 6820 | while (e1 && strcmp (e1->symbol, e->symbol) == 0); |
108ba305 JJ |
6821 | |
6822 | if (last == NULL) | |
6823 | { | |
6824 | /* This is a duplicate. */ | |
6825 | /* FIXME: Memory leak. Sometimes pattern is not | |
6826 | xmalloced alone, but in larger chunk of memory. */ | |
5e35cbc2 | 6827 | /* free (e->symbol); */ |
108ba305 JJ |
6828 | free (e); |
6829 | } | |
6830 | else | |
6831 | { | |
6832 | e->next = last->next; | |
6833 | last->next = e; | |
6834 | } | |
6835 | } | |
6836 | else | |
6837 | { | |
6838 | *loc = e; | |
6839 | *list_loc = e; | |
6840 | list_loc = &e->next; | |
6841 | } | |
6842 | } | |
6843 | } | |
6844 | *remaining_loc = NULL; | |
6845 | *list_loc = head->remaining; | |
6846 | } | |
6847 | else | |
6848 | head->remaining = head->list; | |
6849 | } | |
6850 | ||
252b5132 RH |
6851 | /* This is called when we know the name and dependencies of the |
6852 | version. */ | |
6853 | ||
6854 | void | |
1579bae1 AM |
6855 | lang_register_vers_node (const char *name, |
6856 | struct bfd_elf_version_tree *version, | |
6857 | struct bfd_elf_version_deps *deps) | |
252b5132 RH |
6858 | { |
6859 | struct bfd_elf_version_tree *t, **pp; | |
6860 | struct bfd_elf_version_expr *e1; | |
6861 | ||
6b9b879a JJ |
6862 | if (name == NULL) |
6863 | name = ""; | |
6864 | ||
6865 | if ((name[0] == '\0' && lang_elf_version_info != NULL) | |
6866 | || (lang_elf_version_info && lang_elf_version_info->name[0] == '\0')) | |
6867 | { | |
6feb9908 AM |
6868 | einfo (_("%X%P: anonymous version tag cannot be combined" |
6869 | " with other version tags\n")); | |
5ed6aba4 | 6870 | free (version); |
6b9b879a JJ |
6871 | return; |
6872 | } | |
6873 | ||
252b5132 RH |
6874 | /* Make sure this node has a unique name. */ |
6875 | for (t = lang_elf_version_info; t != NULL; t = t->next) | |
6876 | if (strcmp (t->name, name) == 0) | |
6877 | einfo (_("%X%P: duplicate version tag `%s'\n"), name); | |
6878 | ||
108ba305 JJ |
6879 | lang_finalize_version_expr_head (&version->globals); |
6880 | lang_finalize_version_expr_head (&version->locals); | |
6881 | ||
252b5132 RH |
6882 | /* Check the global and local match names, and make sure there |
6883 | aren't any duplicates. */ | |
6884 | ||
108ba305 | 6885 | for (e1 = version->globals.list; e1 != NULL; e1 = e1->next) |
252b5132 RH |
6886 | { |
6887 | for (t = lang_elf_version_info; t != NULL; t = t->next) | |
6888 | { | |
6889 | struct bfd_elf_version_expr *e2; | |
6890 | ||
5e35cbc2 | 6891 | if (t->locals.htab && e1->symbol) |
108ba305 JJ |
6892 | { |
6893 | e2 = htab_find (t->locals.htab, e1); | |
5e35cbc2 | 6894 | while (e2 && strcmp (e1->symbol, e2->symbol) == 0) |
108ba305 JJ |
6895 | { |
6896 | if (e1->mask == e2->mask) | |
6feb9908 AM |
6897 | einfo (_("%X%P: duplicate expression `%s'" |
6898 | " in version information\n"), e1->symbol); | |
108ba305 JJ |
6899 | e2 = e2->next; |
6900 | } | |
6901 | } | |
5e35cbc2 | 6902 | else if (!e1->symbol) |
108ba305 | 6903 | for (e2 = t->locals.remaining; e2 != NULL; e2 = e2->next) |
6feb9908 AM |
6904 | if (strcmp (e1->pattern, e2->pattern) == 0 |
6905 | && e1->mask == e2->mask) | |
6906 | einfo (_("%X%P: duplicate expression `%s'" | |
6907 | " in version information\n"), e1->pattern); | |
252b5132 RH |
6908 | } |
6909 | } | |
6910 | ||
108ba305 | 6911 | for (e1 = version->locals.list; e1 != NULL; e1 = e1->next) |
252b5132 RH |
6912 | { |
6913 | for (t = lang_elf_version_info; t != NULL; t = t->next) | |
6914 | { | |
6915 | struct bfd_elf_version_expr *e2; | |
6916 | ||
5e35cbc2 | 6917 | if (t->globals.htab && e1->symbol) |
108ba305 JJ |
6918 | { |
6919 | e2 = htab_find (t->globals.htab, e1); | |
5e35cbc2 | 6920 | while (e2 && strcmp (e1->symbol, e2->symbol) == 0) |
108ba305 JJ |
6921 | { |
6922 | if (e1->mask == e2->mask) | |
6feb9908 AM |
6923 | einfo (_("%X%P: duplicate expression `%s'" |
6924 | " in version information\n"), | |
5e35cbc2 | 6925 | e1->symbol); |
108ba305 JJ |
6926 | e2 = e2->next; |
6927 | } | |
6928 | } | |
5e35cbc2 | 6929 | else if (!e1->symbol) |
108ba305 | 6930 | for (e2 = t->globals.remaining; e2 != NULL; e2 = e2->next) |
6feb9908 AM |
6931 | if (strcmp (e1->pattern, e2->pattern) == 0 |
6932 | && e1->mask == e2->mask) | |
6933 | einfo (_("%X%P: duplicate expression `%s'" | |
6934 | " in version information\n"), e1->pattern); | |
252b5132 RH |
6935 | } |
6936 | } | |
6937 | ||
6938 | version->deps = deps; | |
6939 | version->name = name; | |
6b9b879a JJ |
6940 | if (name[0] != '\0') |
6941 | { | |
6942 | ++version_index; | |
6943 | version->vernum = version_index; | |
6944 | } | |
6945 | else | |
6946 | version->vernum = 0; | |
252b5132 RH |
6947 | |
6948 | for (pp = &lang_elf_version_info; *pp != NULL; pp = &(*pp)->next) | |
6949 | ; | |
6950 | *pp = version; | |
6951 | } | |
6952 | ||
6953 | /* This is called when we see a version dependency. */ | |
6954 | ||
6955 | struct bfd_elf_version_deps * | |
1579bae1 | 6956 | lang_add_vers_depend (struct bfd_elf_version_deps *list, const char *name) |
252b5132 RH |
6957 | { |
6958 | struct bfd_elf_version_deps *ret; | |
6959 | struct bfd_elf_version_tree *t; | |
6960 | ||
1579bae1 | 6961 | ret = xmalloc (sizeof *ret); |
252b5132 RH |
6962 | ret->next = list; |
6963 | ||
6964 | for (t = lang_elf_version_info; t != NULL; t = t->next) | |
6965 | { | |
6966 | if (strcmp (t->name, name) == 0) | |
6967 | { | |
6968 | ret->version_needed = t; | |
6969 | return ret; | |
6970 | } | |
6971 | } | |
6972 | ||
6973 | einfo (_("%X%P: unable to find version dependency `%s'\n"), name); | |
6974 | ||
6975 | return ret; | |
6976 | } | |
6977 | ||
6978 | static void | |
1579bae1 | 6979 | lang_do_version_exports_section (void) |
252b5132 RH |
6980 | { |
6981 | struct bfd_elf_version_expr *greg = NULL, *lreg; | |
6982 | ||
6983 | LANG_FOR_EACH_INPUT_STATEMENT (is) | |
6984 | { | |
6985 | asection *sec = bfd_get_section_by_name (is->the_bfd, ".exports"); | |
6986 | char *contents, *p; | |
6987 | bfd_size_type len; | |
6988 | ||
6989 | if (sec == NULL) | |
b7a26f91 | 6990 | continue; |
252b5132 | 6991 | |
eea6121a | 6992 | len = sec->size; |
252b5132 RH |
6993 | contents = xmalloc (len); |
6994 | if (!bfd_get_section_contents (is->the_bfd, sec, contents, 0, len)) | |
6f9efd97 | 6995 | einfo (_("%X%P: unable to read .exports section contents\n"), sec); |
252b5132 RH |
6996 | |
6997 | p = contents; | |
89cdebba | 6998 | while (p < contents + len) |
252b5132 | 6999 | { |
86043bbb | 7000 | greg = lang_new_vers_pattern (greg, p, NULL, FALSE); |
252b5132 RH |
7001 | p = strchr (p, '\0') + 1; |
7002 | } | |
7003 | ||
7004 | /* Do not free the contents, as we used them creating the regex. */ | |
7005 | ||
7006 | /* Do not include this section in the link. */ | |
a14a5de3 | 7007 | sec->flags |= SEC_EXCLUDE | SEC_KEEP; |
252b5132 RH |
7008 | } |
7009 | ||
86043bbb | 7010 | lreg = lang_new_vers_pattern (NULL, "*", NULL, FALSE); |
252b5132 RH |
7011 | lang_register_vers_node (command_line.version_exports_section, |
7012 | lang_new_vers_node (greg, lreg), NULL); | |
7013 | } | |
577a0623 AM |
7014 | |
7015 | void | |
1579bae1 | 7016 | lang_add_unique (const char *name) |
577a0623 AM |
7017 | { |
7018 | struct unique_sections *ent; | |
7019 | ||
7020 | for (ent = unique_section_list; ent; ent = ent->next) | |
7021 | if (strcmp (ent->name, name) == 0) | |
7022 | return; | |
7023 | ||
1579bae1 | 7024 | ent = xmalloc (sizeof *ent); |
577a0623 AM |
7025 | ent->name = xstrdup (name); |
7026 | ent->next = unique_section_list; | |
7027 | unique_section_list = ent; | |
7028 | } | |
55255dae L |
7029 | |
7030 | /* Append the list of dynamic symbols to the existing one. */ | |
7031 | ||
7032 | void | |
7033 | lang_append_dynamic_list (struct bfd_elf_version_expr *dynamic) | |
7034 | { | |
40b36307 | 7035 | if (link_info.dynamic_list) |
55255dae | 7036 | { |
07806542 JJ |
7037 | struct bfd_elf_version_expr *tail; |
7038 | for (tail = dynamic; tail->next != NULL; tail = tail->next) | |
7039 | ; | |
40b36307 L |
7040 | tail->next = link_info.dynamic_list->head.list; |
7041 | link_info.dynamic_list->head.list = dynamic; | |
55255dae L |
7042 | } |
7043 | else | |
7044 | { | |
7045 | struct bfd_elf_dynamic_list *d; | |
7046 | ||
7047 | d = xcalloc (1, sizeof *d); | |
7048 | d->head.list = dynamic; | |
7049 | d->match = lang_vers_match; | |
40b36307 | 7050 | link_info.dynamic_list = d; |
55255dae L |
7051 | } |
7052 | } | |
7053 | ||
7054 | /* Append the list of C++ typeinfo dynamic symbols to the existing | |
7055 | one. */ | |
7056 | ||
7057 | void | |
7058 | lang_append_dynamic_list_cpp_typeinfo (void) | |
7059 | { | |
7060 | const char * symbols [] = | |
7061 | { | |
7062 | "typeinfo name for*", | |
7063 | "typeinfo for*" | |
7064 | }; | |
7065 | struct bfd_elf_version_expr *dynamic = NULL; | |
7066 | unsigned int i; | |
7067 | ||
7068 | for (i = 0; i < ARRAY_SIZE (symbols); i++) | |
7069 | dynamic = lang_new_vers_pattern (dynamic, symbols [i], "C++", | |
7070 | FALSE); | |
7071 | ||
7072 | lang_append_dynamic_list (dynamic); | |
7073 | } | |
40b36307 L |
7074 | |
7075 | /* Append the list of C++ operator new and delete dynamic symbols to the | |
7076 | existing one. */ | |
7077 | ||
7078 | void | |
7079 | lang_append_dynamic_list_cpp_new (void) | |
7080 | { | |
7081 | const char * symbols [] = | |
7082 | { | |
7083 | "operator new*", | |
7084 | "operator delete*" | |
7085 | }; | |
7086 | struct bfd_elf_version_expr *dynamic = NULL; | |
7087 | unsigned int i; | |
7088 | ||
7089 | for (i = 0; i < ARRAY_SIZE (symbols); i++) | |
7090 | dynamic = lang_new_vers_pattern (dynamic, symbols [i], "C++", | |
7091 | FALSE); | |
7092 | ||
7093 | lang_append_dynamic_list (dynamic); | |
7094 | } |