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