Commit | Line | Data |
---|---|---|
252b5132 | 1 | /* Linker command language support. |
a2b64bed | 2 | Copyright 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, |
264b6205 | 3 | 2001, 2002, 2003, 2004, 2005, 2006, 2007 |
252b5132 RH |
4 | Free Software Foundation, Inc. |
5 | ||
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; |
b34976b6 | 55 | static bfd_boolean placed_commons = FALSE; |
8423293d | 56 | static bfd_boolean stripped_excluded_sections = FALSE; |
252b5132 | 57 | static lang_output_section_statement_type *default_common_section; |
b34976b6 | 58 | static bfd_boolean map_option_f; |
252b5132 RH |
59 | static bfd_vma print_dot; |
60 | static lang_input_statement_type *first_file; | |
5f992e62 AM |
61 | static const char *current_target; |
62 | static const char *output_target; | |
252b5132 | 63 | static lang_statement_list_type statement_list; |
420e579c | 64 | static struct bfd_hash_table lang_definedness_table; |
252b5132 | 65 | |
cf888e70 | 66 | /* Forward declarations. */ |
1579bae1 | 67 | static void exp_init_os (etree_type *); |
35835446 | 68 | static void init_map_userdata (bfd *, asection *, void *); |
1579bae1 | 69 | static lang_input_statement_type *lookup_name (const char *); |
420e579c HPN |
70 | static struct bfd_hash_entry *lang_definedness_newfunc |
71 | (struct bfd_hash_entry *, struct bfd_hash_table *, const char *); | |
1579bae1 | 72 | static void insert_undefined (const char *); |
35835446 | 73 | static bfd_boolean sort_def_symbol (struct bfd_link_hash_entry *, void *); |
1579bae1 AM |
74 | static void print_statement (lang_statement_union_type *, |
75 | lang_output_section_statement_type *); | |
76 | static void print_statement_list (lang_statement_union_type *, | |
77 | lang_output_section_statement_type *); | |
78 | static void print_statements (void); | |
4d4920ec | 79 | static void print_input_section (asection *); |
1579bae1 AM |
80 | static bfd_boolean lang_one_common (struct bfd_link_hash_entry *, void *); |
81 | static void lang_record_phdrs (void); | |
82 | static void lang_do_version_exports_section (void); | |
55255dae L |
83 | static void lang_finalize_version_expr_head |
84 | (struct bfd_elf_version_expr_head *); | |
1579bae1 | 85 | |
cf888e70 | 86 | /* Exported variables. */ |
252b5132 | 87 | lang_output_section_statement_type *abs_output_section; |
aea4bd9d | 88 | lang_statement_list_type lang_output_section_statement; |
252b5132 | 89 | lang_statement_list_type *stat_ptr = &statement_list; |
87f2a346 | 90 | lang_statement_list_type file_chain = { NULL, NULL }; |
dc27aea4 | 91 | lang_statement_list_type input_file_chain; |
e3e942e9 | 92 | struct bfd_sym_chain entry_symbol = { NULL, NULL }; |
a359509e | 93 | static const char *entry_symbol_default = "start"; |
1e281515 | 94 | const char *entry_section = ".text"; |
b34976b6 AM |
95 | bfd_boolean entry_from_cmdline; |
96 | bfd_boolean lang_has_input_file = FALSE; | |
97 | bfd_boolean had_output_filename = FALSE; | |
98 | bfd_boolean lang_float_flag = FALSE; | |
99 | bfd_boolean delete_output_file_on_failure = FALSE; | |
f5ff60a6 | 100 | struct lang_phdr *lang_phdr_list; |
252b5132 | 101 | struct lang_nocrossrefs *nocrossref_list; |
279e75dc | 102 | static struct unique_sections *unique_section_list; |
e3f2db7f | 103 | static bfd_boolean ldlang_sysrooted_script = FALSE; |
e9ee469a AM |
104 | |
105 | /* Functions that traverse the linker script and might evaluate | |
106 | DEFINED() need to increment this. */ | |
420e579c | 107 | int lang_statement_iteration = 0; |
252b5132 RH |
108 | |
109 | etree_type *base; /* Relocation base - or null */ | |
110 | ||
61f5d054 L |
111 | /* Return TRUE if the PATTERN argument is a wildcard pattern. |
112 | Although backslashes are treated specially if a pattern contains | |
113 | wildcards, we do not consider the mere presence of a backslash to | |
114 | be enough to cause the pattern to be treated as a wildcard. | |
115 | That lets us handle DOS filenames more naturally. */ | |
116 | #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL) | |
117 | ||
d1778b88 | 118 | #define new_stat(x, y) \ |
1579bae1 | 119 | (x##_type *) new_statement (x##_enum, sizeof (x##_type), y) |
252b5132 | 120 | |
d1778b88 AM |
121 | #define outside_section_address(q) \ |
122 | ((q)->output_offset + (q)->output_section->vma) | |
252b5132 | 123 | |
d1778b88 AM |
124 | #define outside_symbol_address(q) \ |
125 | ((q)->value + outside_section_address (q->section)) | |
252b5132 RH |
126 | |
127 | #define SECTION_NAME_MAP_LENGTH (16) | |
128 | ||
1579bae1 AM |
129 | void * |
130 | stat_alloc (size_t size) | |
252b5132 RH |
131 | { |
132 | return obstack_alloc (&stat_obstack, size); | |
133 | } | |
134 | ||
b34976b6 | 135 | bfd_boolean |
d0d6a25b | 136 | unique_section_p (const asection *sec) |
577a0623 AM |
137 | { |
138 | struct unique_sections *unam; | |
d0d6a25b | 139 | const char *secnam; |
577a0623 | 140 | |
d0d6a25b AM |
141 | if (link_info.relocatable |
142 | && sec->owner != NULL | |
143 | && bfd_is_group_section (sec->owner, sec)) | |
144 | return TRUE; | |
145 | ||
146 | secnam = sec->name; | |
577a0623 AM |
147 | for (unam = unique_section_list; unam; unam = unam->next) |
148 | if (wildcardp (unam->name) | |
149 | ? fnmatch (unam->name, secnam, 0) == 0 | |
150 | : strcmp (unam->name, secnam) == 0) | |
151 | { | |
b34976b6 | 152 | return TRUE; |
577a0623 AM |
153 | } |
154 | ||
b34976b6 | 155 | return FALSE; |
577a0623 AM |
156 | } |
157 | ||
08da4cac | 158 | /* Generic traversal routines for finding matching sections. */ |
4dec4d4e | 159 | |
72223188 JJ |
160 | /* Try processing a section against a wildcard. This just calls |
161 | the callback unless the filename exclusion list is present | |
162 | and excludes the file. It's hardly ever present so this | |
163 | function is very fast. */ | |
164 | ||
4dec4d4e | 165 | static void |
72223188 JJ |
166 | walk_wild_consider_section (lang_wild_statement_type *ptr, |
167 | lang_input_statement_type *file, | |
168 | asection *s, | |
169 | struct wildcard_list *sec, | |
170 | callback_t callback, | |
171 | void *data) | |
4dec4d4e | 172 | { |
72223188 JJ |
173 | bfd_boolean skip = FALSE; |
174 | struct name_list *list_tmp; | |
175 | ||
176 | /* Don't process sections from files which were | |
177 | excluded. */ | |
178 | for (list_tmp = sec->spec.exclude_name_list; | |
179 | list_tmp; | |
180 | list_tmp = list_tmp->next) | |
181 | { | |
182 | bfd_boolean is_wildcard = wildcardp (list_tmp->name); | |
183 | if (is_wildcard) | |
184 | skip = fnmatch (list_tmp->name, file->filename, 0) == 0; | |
185 | else | |
186 | skip = strcmp (list_tmp->name, file->filename) == 0; | |
b6bf44ba | 187 | |
72223188 JJ |
188 | /* If this file is part of an archive, and the archive is |
189 | excluded, exclude this file. */ | |
190 | if (! skip && file->the_bfd != NULL | |
191 | && file->the_bfd->my_archive != NULL | |
192 | && file->the_bfd->my_archive->filename != NULL) | |
193 | { | |
194 | if (is_wildcard) | |
195 | skip = fnmatch (list_tmp->name, | |
196 | file->the_bfd->my_archive->filename, | |
197 | 0) == 0; | |
198 | else | |
199 | skip = strcmp (list_tmp->name, | |
200 | file->the_bfd->my_archive->filename) == 0; | |
201 | } | |
202 | ||
203 | if (skip) | |
204 | break; | |
205 | } | |
206 | ||
207 | if (!skip) | |
208 | (*callback) (ptr, sec, s, file, data); | |
209 | } | |
210 | ||
211 | /* Lowest common denominator routine that can handle everything correctly, | |
212 | but slowly. */ | |
213 | ||
214 | static void | |
215 | walk_wild_section_general (lang_wild_statement_type *ptr, | |
216 | lang_input_statement_type *file, | |
217 | callback_t callback, | |
218 | void *data) | |
219 | { | |
220 | asection *s; | |
221 | struct wildcard_list *sec; | |
b6bf44ba AM |
222 | |
223 | for (s = file->the_bfd->sections; s != NULL; s = s->next) | |
4dec4d4e | 224 | { |
b6bf44ba | 225 | sec = ptr->section_list; |
2181f54f AM |
226 | if (sec == NULL) |
227 | (*callback) (ptr, sec, s, file, data); | |
228 | ||
229 | while (sec != NULL) | |
08da4cac | 230 | { |
b34976b6 | 231 | bfd_boolean skip = FALSE; |
2181f54f | 232 | |
72223188 | 233 | if (sec->spec.name != NULL) |
b6bf44ba | 234 | { |
2181f54f AM |
235 | const char *sname = bfd_get_section_name (file->the_bfd, s); |
236 | ||
237 | if (wildcardp (sec->spec.name)) | |
238 | skip = fnmatch (sec->spec.name, sname, 0) != 0; | |
239 | else | |
240 | skip = strcmp (sec->spec.name, sname) != 0; | |
b6bf44ba | 241 | } |
4dec4d4e | 242 | |
b6bf44ba | 243 | if (!skip) |
72223188 | 244 | walk_wild_consider_section (ptr, file, s, sec, callback, data); |
4dec4d4e | 245 | |
2181f54f | 246 | sec = sec->next; |
4dec4d4e RH |
247 | } |
248 | } | |
249 | } | |
250 | ||
72223188 JJ |
251 | /* Routines to find a single section given its name. If there's more |
252 | than one section with that name, we report that. */ | |
253 | ||
254 | typedef struct | |
255 | { | |
256 | asection *found_section; | |
257 | bfd_boolean multiple_sections_found; | |
258 | } section_iterator_callback_data; | |
259 | ||
260 | static bfd_boolean | |
261 | section_iterator_callback (bfd *bfd ATTRIBUTE_UNUSED, asection *s, void *data) | |
262 | { | |
263 | section_iterator_callback_data *d = data; | |
264 | ||
265 | if (d->found_section != NULL) | |
266 | { | |
267 | d->multiple_sections_found = TRUE; | |
268 | return TRUE; | |
269 | } | |
270 | ||
271 | d->found_section = s; | |
272 | return FALSE; | |
273 | } | |
274 | ||
275 | static asection * | |
276 | find_section (lang_input_statement_type *file, | |
277 | struct wildcard_list *sec, | |
278 | bfd_boolean *multiple_sections_found) | |
279 | { | |
280 | section_iterator_callback_data cb_data = { NULL, FALSE }; | |
281 | ||
329c1c86 | 282 | bfd_get_section_by_name_if (file->the_bfd, sec->spec.name, |
72223188 JJ |
283 | section_iterator_callback, &cb_data); |
284 | *multiple_sections_found = cb_data.multiple_sections_found; | |
285 | return cb_data.found_section; | |
286 | } | |
287 | ||
288 | /* Code for handling simple wildcards without going through fnmatch, | |
289 | which can be expensive because of charset translations etc. */ | |
290 | ||
291 | /* A simple wild is a literal string followed by a single '*', | |
292 | where the literal part is at least 4 characters long. */ | |
293 | ||
294 | static bfd_boolean | |
295 | is_simple_wild (const char *name) | |
296 | { | |
297 | size_t len = strcspn (name, "*?["); | |
298 | return len >= 4 && name[len] == '*' && name[len + 1] == '\0'; | |
299 | } | |
300 | ||
301 | static bfd_boolean | |
302 | match_simple_wild (const char *pattern, const char *name) | |
303 | { | |
304 | /* The first four characters of the pattern are guaranteed valid | |
305 | non-wildcard characters. So we can go faster. */ | |
306 | if (pattern[0] != name[0] || pattern[1] != name[1] | |
307 | || pattern[2] != name[2] || pattern[3] != name[3]) | |
308 | return FALSE; | |
309 | ||
310 | pattern += 4; | |
311 | name += 4; | |
312 | while (*pattern != '*') | |
313 | if (*name++ != *pattern++) | |
314 | return FALSE; | |
315 | ||
316 | return TRUE; | |
317 | } | |
318 | ||
50c77e5d NC |
319 | /* Compare sections ASEC and BSEC according to SORT. */ |
320 | ||
321 | static int | |
322 | compare_section (sort_type sort, asection *asec, asection *bsec) | |
323 | { | |
324 | int ret; | |
325 | ||
326 | switch (sort) | |
327 | { | |
328 | default: | |
329 | abort (); | |
330 | ||
331 | case by_alignment_name: | |
332 | ret = (bfd_section_alignment (bsec->owner, bsec) | |
333 | - bfd_section_alignment (asec->owner, asec)); | |
334 | if (ret) | |
335 | break; | |
336 | /* Fall through. */ | |
337 | ||
338 | case by_name: | |
339 | ret = strcmp (bfd_get_section_name (asec->owner, asec), | |
340 | bfd_get_section_name (bsec->owner, bsec)); | |
341 | break; | |
342 | ||
343 | case by_name_alignment: | |
344 | ret = strcmp (bfd_get_section_name (asec->owner, asec), | |
345 | bfd_get_section_name (bsec->owner, bsec)); | |
346 | if (ret) | |
347 | break; | |
348 | /* Fall through. */ | |
349 | ||
350 | case by_alignment: | |
351 | ret = (bfd_section_alignment (bsec->owner, bsec) | |
352 | - bfd_section_alignment (asec->owner, asec)); | |
353 | break; | |
354 | } | |
355 | ||
356 | return ret; | |
357 | } | |
358 | ||
329c1c86 | 359 | /* Build a Binary Search Tree to sort sections, unlike insertion sort |
50c77e5d NC |
360 | used in wild_sort(). BST is considerably faster if the number of |
361 | of sections are large. */ | |
362 | ||
363 | static lang_section_bst_type ** | |
364 | wild_sort_fast (lang_wild_statement_type *wild, | |
329c1c86 AM |
365 | struct wildcard_list *sec, |
366 | lang_input_statement_type *file ATTRIBUTE_UNUSED, | |
367 | asection *section) | |
50c77e5d | 368 | { |
329c1c86 | 369 | lang_section_bst_type **tree; |
50c77e5d | 370 | |
e6f2cbf5 | 371 | tree = &wild->tree; |
50c77e5d | 372 | if (!wild->filenames_sorted |
329c1c86 | 373 | && (sec == NULL || sec->spec.sorted == none)) |
50c77e5d NC |
374 | { |
375 | /* Append at the right end of tree. */ | |
376 | while (*tree) | |
329c1c86 | 377 | tree = &((*tree)->right); |
50c77e5d NC |
378 | return tree; |
379 | } | |
380 | ||
329c1c86 | 381 | while (*tree) |
50c77e5d NC |
382 | { |
383 | /* Find the correct node to append this section. */ | |
329c1c86 AM |
384 | if (compare_section (sec->spec.sorted, section, (*tree)->section) < 0) |
385 | tree = &((*tree)->left); | |
386 | else | |
387 | tree = &((*tree)->right); | |
50c77e5d NC |
388 | } |
389 | ||
390 | return tree; | |
391 | } | |
392 | ||
393 | /* Use wild_sort_fast to build a BST to sort sections. */ | |
394 | ||
395 | static void | |
396 | output_section_callback_fast (lang_wild_statement_type *ptr, | |
329c1c86 AM |
397 | struct wildcard_list *sec, |
398 | asection *section, | |
399 | lang_input_statement_type *file, | |
400 | void *output ATTRIBUTE_UNUSED) | |
50c77e5d NC |
401 | { |
402 | lang_section_bst_type *node; | |
403 | lang_section_bst_type **tree; | |
404 | ||
405 | if (unique_section_p (section)) | |
406 | return; | |
407 | ||
408 | node = xmalloc (sizeof (lang_section_bst_type)); | |
409 | node->left = 0; | |
410 | node->right = 0; | |
411 | node->section = section; | |
412 | ||
413 | tree = wild_sort_fast (ptr, sec, file, section); | |
414 | if (tree != NULL) | |
415 | *tree = node; | |
416 | } | |
417 | ||
418 | /* Convert a sorted sections' BST back to list form. */ | |
419 | ||
420 | static void | |
329c1c86 AM |
421 | output_section_callback_tree_to_list (lang_wild_statement_type *ptr, |
422 | lang_section_bst_type *tree, | |
423 | void *output) | |
50c77e5d NC |
424 | { |
425 | if (tree->left) | |
426 | output_section_callback_tree_to_list (ptr, tree->left, output); | |
427 | ||
329c1c86 AM |
428 | lang_add_section (&ptr->children, tree->section, |
429 | (lang_output_section_statement_type *) output); | |
50c77e5d NC |
430 | |
431 | if (tree->right) | |
432 | output_section_callback_tree_to_list (ptr, tree->right, output); | |
433 | ||
434 | free (tree); | |
435 | } | |
436 | ||
72223188 JJ |
437 | /* Specialized, optimized routines for handling different kinds of |
438 | wildcards */ | |
439 | ||
440 | static void | |
441 | walk_wild_section_specs1_wild0 (lang_wild_statement_type *ptr, | |
442 | lang_input_statement_type *file, | |
443 | callback_t callback, | |
444 | void *data) | |
445 | { | |
446 | /* We can just do a hash lookup for the section with the right name. | |
447 | But if that lookup discovers more than one section with the name | |
448 | (should be rare), we fall back to the general algorithm because | |
449 | we would otherwise have to sort the sections to make sure they | |
450 | get processed in the bfd's order. */ | |
451 | bfd_boolean multiple_sections_found; | |
452 | struct wildcard_list *sec0 = ptr->handler_data[0]; | |
453 | asection *s0 = find_section (file, sec0, &multiple_sections_found); | |
454 | ||
455 | if (multiple_sections_found) | |
456 | walk_wild_section_general (ptr, file, callback, data); | |
457 | else if (s0) | |
458 | walk_wild_consider_section (ptr, file, s0, sec0, callback, data); | |
459 | } | |
460 | ||
461 | static void | |
462 | walk_wild_section_specs1_wild1 (lang_wild_statement_type *ptr, | |
463 | lang_input_statement_type *file, | |
464 | callback_t callback, | |
465 | void *data) | |
466 | { | |
467 | asection *s; | |
468 | struct wildcard_list *wildsec0 = ptr->handler_data[0]; | |
469 | ||
470 | for (s = file->the_bfd->sections; s != NULL; s = s->next) | |
471 | { | |
472 | const char *sname = bfd_get_section_name (file->the_bfd, s); | |
473 | bfd_boolean skip = !match_simple_wild (wildsec0->spec.name, sname); | |
474 | ||
475 | if (!skip) | |
476 | walk_wild_consider_section (ptr, file, s, wildsec0, callback, data); | |
477 | } | |
478 | } | |
479 | ||
480 | static void | |
481 | walk_wild_section_specs2_wild1 (lang_wild_statement_type *ptr, | |
482 | lang_input_statement_type *file, | |
483 | callback_t callback, | |
484 | void *data) | |
485 | { | |
486 | asection *s; | |
487 | struct wildcard_list *sec0 = ptr->handler_data[0]; | |
488 | struct wildcard_list *wildsec1 = ptr->handler_data[1]; | |
489 | bfd_boolean multiple_sections_found; | |
490 | asection *s0 = find_section (file, sec0, &multiple_sections_found); | |
491 | ||
492 | if (multiple_sections_found) | |
493 | { | |
494 | walk_wild_section_general (ptr, file, callback, data); | |
495 | return; | |
496 | } | |
497 | ||
498 | /* Note that if the section was not found, s0 is NULL and | |
499 | we'll simply never succeed the s == s0 test below. */ | |
500 | for (s = file->the_bfd->sections; s != NULL; s = s->next) | |
501 | { | |
502 | /* Recall that in this code path, a section cannot satisfy more | |
503 | than one spec, so if s == s0 then it cannot match | |
504 | wildspec1. */ | |
505 | if (s == s0) | |
506 | walk_wild_consider_section (ptr, file, s, sec0, callback, data); | |
507 | else | |
508 | { | |
509 | const char *sname = bfd_get_section_name (file->the_bfd, s); | |
510 | bfd_boolean skip = !match_simple_wild (wildsec1->spec.name, sname); | |
511 | ||
512 | if (!skip) | |
513 | walk_wild_consider_section (ptr, file, s, wildsec1, callback, | |
514 | data); | |
515 | } | |
516 | } | |
517 | } | |
518 | ||
519 | static void | |
520 | walk_wild_section_specs3_wild2 (lang_wild_statement_type *ptr, | |
521 | lang_input_statement_type *file, | |
522 | callback_t callback, | |
523 | void *data) | |
524 | { | |
525 | asection *s; | |
526 | struct wildcard_list *sec0 = ptr->handler_data[0]; | |
527 | struct wildcard_list *wildsec1 = ptr->handler_data[1]; | |
528 | struct wildcard_list *wildsec2 = ptr->handler_data[2]; | |
529 | bfd_boolean multiple_sections_found; | |
530 | asection *s0 = find_section (file, sec0, &multiple_sections_found); | |
531 | ||
532 | if (multiple_sections_found) | |
533 | { | |
534 | walk_wild_section_general (ptr, file, callback, data); | |
535 | return; | |
536 | } | |
537 | ||
538 | for (s = file->the_bfd->sections; s != NULL; s = s->next) | |
539 | { | |
540 | if (s == s0) | |
541 | walk_wild_consider_section (ptr, file, s, sec0, callback, data); | |
542 | else | |
543 | { | |
544 | const char *sname = bfd_get_section_name (file->the_bfd, s); | |
545 | bfd_boolean skip = !match_simple_wild (wildsec1->spec.name, sname); | |
546 | ||
547 | if (!skip) | |
548 | walk_wild_consider_section (ptr, file, s, wildsec1, callback, data); | |
549 | else | |
550 | { | |
551 | skip = !match_simple_wild (wildsec2->spec.name, sname); | |
552 | if (!skip) | |
553 | walk_wild_consider_section (ptr, file, s, wildsec2, callback, | |
554 | data); | |
555 | } | |
556 | } | |
557 | } | |
558 | } | |
559 | ||
560 | static void | |
561 | walk_wild_section_specs4_wild2 (lang_wild_statement_type *ptr, | |
562 | lang_input_statement_type *file, | |
563 | callback_t callback, | |
564 | void *data) | |
565 | { | |
566 | asection *s; | |
567 | struct wildcard_list *sec0 = ptr->handler_data[0]; | |
568 | struct wildcard_list *sec1 = ptr->handler_data[1]; | |
569 | struct wildcard_list *wildsec2 = ptr->handler_data[2]; | |
570 | struct wildcard_list *wildsec3 = ptr->handler_data[3]; | |
571 | bfd_boolean multiple_sections_found; | |
572 | asection *s0 = find_section (file, sec0, &multiple_sections_found), *s1; | |
573 | ||
574 | if (multiple_sections_found) | |
575 | { | |
576 | walk_wild_section_general (ptr, file, callback, data); | |
577 | return; | |
578 | } | |
579 | ||
580 | s1 = find_section (file, sec1, &multiple_sections_found); | |
581 | if (multiple_sections_found) | |
582 | { | |
583 | walk_wild_section_general (ptr, file, callback, data); | |
584 | return; | |
585 | } | |
586 | ||
587 | for (s = file->the_bfd->sections; s != NULL; s = s->next) | |
588 | { | |
589 | if (s == s0) | |
590 | walk_wild_consider_section (ptr, file, s, sec0, callback, data); | |
591 | else | |
592 | if (s == s1) | |
593 | walk_wild_consider_section (ptr, file, s, sec1, callback, data); | |
594 | else | |
595 | { | |
596 | const char *sname = bfd_get_section_name (file->the_bfd, s); | |
597 | bfd_boolean skip = !match_simple_wild (wildsec2->spec.name, | |
598 | sname); | |
599 | ||
600 | if (!skip) | |
601 | walk_wild_consider_section (ptr, file, s, wildsec2, callback, | |
602 | data); | |
603 | else | |
604 | { | |
605 | skip = !match_simple_wild (wildsec3->spec.name, sname); | |
606 | if (!skip) | |
607 | walk_wild_consider_section (ptr, file, s, wildsec3, | |
608 | callback, data); | |
609 | } | |
610 | } | |
611 | } | |
612 | } | |
613 | ||
614 | static void | |
615 | walk_wild_section (lang_wild_statement_type *ptr, | |
616 | lang_input_statement_type *file, | |
617 | callback_t callback, | |
618 | void *data) | |
619 | { | |
620 | if (file->just_syms_flag) | |
621 | return; | |
622 | ||
623 | (*ptr->walk_wild_section_handler) (ptr, file, callback, data); | |
624 | } | |
625 | ||
626 | /* Returns TRUE when name1 is a wildcard spec that might match | |
627 | something name2 can match. We're conservative: we return FALSE | |
628 | only if the prefixes of name1 and name2 are different up to the | |
629 | first wildcard character. */ | |
630 | ||
631 | static bfd_boolean | |
632 | wild_spec_can_overlap (const char *name1, const char *name2) | |
633 | { | |
634 | size_t prefix1_len = strcspn (name1, "?*["); | |
635 | size_t prefix2_len = strcspn (name2, "?*["); | |
636 | size_t min_prefix_len; | |
637 | ||
638 | /* Note that if there is no wildcard character, then we treat the | |
639 | terminating 0 as part of the prefix. Thus ".text" won't match | |
640 | ".text." or ".text.*", for example. */ | |
641 | if (name1[prefix1_len] == '\0') | |
642 | prefix1_len++; | |
643 | if (name2[prefix2_len] == '\0') | |
644 | prefix2_len++; | |
645 | ||
646 | min_prefix_len = prefix1_len < prefix2_len ? prefix1_len : prefix2_len; | |
647 | ||
648 | return memcmp (name1, name2, min_prefix_len) == 0; | |
649 | } | |
650 | ||
651 | /* Select specialized code to handle various kinds of wildcard | |
652 | statements. */ | |
653 | ||
654 | static void | |
655 | analyze_walk_wild_section_handler (lang_wild_statement_type *ptr) | |
656 | { | |
657 | int sec_count = 0; | |
658 | int wild_name_count = 0; | |
659 | struct wildcard_list *sec; | |
660 | int signature; | |
661 | int data_counter; | |
662 | ||
663 | ptr->walk_wild_section_handler = walk_wild_section_general; | |
7544697a AM |
664 | ptr->handler_data[0] = NULL; |
665 | ptr->handler_data[1] = NULL; | |
666 | ptr->handler_data[2] = NULL; | |
667 | ptr->handler_data[3] = NULL; | |
e6f2cbf5 | 668 | ptr->tree = NULL; |
72223188 JJ |
669 | |
670 | /* Count how many wildcard_specs there are, and how many of those | |
671 | actually use wildcards in the name. Also, bail out if any of the | |
672 | wildcard names are NULL. (Can this actually happen? | |
673 | walk_wild_section used to test for it.) And bail out if any | |
674 | of the wildcards are more complex than a simple string | |
675 | ending in a single '*'. */ | |
676 | for (sec = ptr->section_list; sec != NULL; sec = sec->next) | |
677 | { | |
678 | ++sec_count; | |
679 | if (sec->spec.name == NULL) | |
680 | return; | |
681 | if (wildcardp (sec->spec.name)) | |
682 | { | |
683 | ++wild_name_count; | |
684 | if (!is_simple_wild (sec->spec.name)) | |
685 | return; | |
686 | } | |
687 | } | |
688 | ||
689 | /* The zero-spec case would be easy to optimize but it doesn't | |
690 | happen in practice. Likewise, more than 4 specs doesn't | |
691 | happen in practice. */ | |
692 | if (sec_count == 0 || sec_count > 4) | |
693 | return; | |
694 | ||
695 | /* Check that no two specs can match the same section. */ | |
696 | for (sec = ptr->section_list; sec != NULL; sec = sec->next) | |
697 | { | |
698 | struct wildcard_list *sec2; | |
699 | for (sec2 = sec->next; sec2 != NULL; sec2 = sec2->next) | |
700 | { | |
701 | if (wild_spec_can_overlap (sec->spec.name, sec2->spec.name)) | |
702 | return; | |
703 | } | |
704 | } | |
705 | ||
706 | signature = (sec_count << 8) + wild_name_count; | |
707 | switch (signature) | |
708 | { | |
709 | case 0x0100: | |
710 | ptr->walk_wild_section_handler = walk_wild_section_specs1_wild0; | |
711 | break; | |
712 | case 0x0101: | |
713 | ptr->walk_wild_section_handler = walk_wild_section_specs1_wild1; | |
714 | break; | |
715 | case 0x0201: | |
716 | ptr->walk_wild_section_handler = walk_wild_section_specs2_wild1; | |
717 | break; | |
718 | case 0x0302: | |
719 | ptr->walk_wild_section_handler = walk_wild_section_specs3_wild2; | |
720 | break; | |
721 | case 0x0402: | |
722 | ptr->walk_wild_section_handler = walk_wild_section_specs4_wild2; | |
723 | break; | |
724 | default: | |
725 | return; | |
726 | } | |
727 | ||
728 | /* Now fill the data array with pointers to the specs, first the | |
729 | specs with non-wildcard names, then the specs with wildcard | |
730 | names. It's OK to process the specs in different order from the | |
731 | given order, because we've already determined that no section | |
732 | will match more than one spec. */ | |
733 | data_counter = 0; | |
734 | for (sec = ptr->section_list; sec != NULL; sec = sec->next) | |
735 | if (!wildcardp (sec->spec.name)) | |
736 | ptr->handler_data[data_counter++] = sec; | |
737 | for (sec = ptr->section_list; sec != NULL; sec = sec->next) | |
738 | if (wildcardp (sec->spec.name)) | |
739 | ptr->handler_data[data_counter++] = sec; | |
740 | } | |
741 | ||
4dec4d4e RH |
742 | /* Handle a wild statement for a single file F. */ |
743 | ||
744 | static void | |
1579bae1 AM |
745 | walk_wild_file (lang_wild_statement_type *s, |
746 | lang_input_statement_type *f, | |
747 | callback_t callback, | |
748 | void *data) | |
4dec4d4e RH |
749 | { |
750 | if (f->the_bfd == NULL | |
751 | || ! bfd_check_format (f->the_bfd, bfd_archive)) | |
b6bf44ba | 752 | walk_wild_section (s, f, callback, data); |
4dec4d4e RH |
753 | else |
754 | { | |
755 | bfd *member; | |
756 | ||
757 | /* This is an archive file. We must map each member of the | |
758 | archive separately. */ | |
1579bae1 | 759 | member = bfd_openr_next_archived_file (f->the_bfd, NULL); |
4dec4d4e RH |
760 | while (member != NULL) |
761 | { | |
762 | /* When lookup_name is called, it will call the add_symbols | |
763 | entry point for the archive. For each element of the | |
764 | archive which is included, BFD will call ldlang_add_file, | |
765 | which will set the usrdata field of the member to the | |
766 | lang_input_statement. */ | |
767 | if (member->usrdata != NULL) | |
768 | { | |
1579bae1 | 769 | walk_wild_section (s, member->usrdata, callback, data); |
4dec4d4e RH |
770 | } |
771 | ||
772 | member = bfd_openr_next_archived_file (f->the_bfd, member); | |
773 | } | |
774 | } | |
775 | } | |
776 | ||
777 | static void | |
1579bae1 | 778 | walk_wild (lang_wild_statement_type *s, callback_t callback, void *data) |
4dec4d4e | 779 | { |
b6bf44ba AM |
780 | const char *file_spec = s->filename; |
781 | ||
782 | if (file_spec == NULL) | |
4dec4d4e RH |
783 | { |
784 | /* Perform the iteration over all files in the list. */ | |
e50d8076 | 785 | LANG_FOR_EACH_INPUT_STATEMENT (f) |
4dec4d4e | 786 | { |
b6bf44ba | 787 | walk_wild_file (s, f, callback, data); |
4dec4d4e RH |
788 | } |
789 | } | |
b6bf44ba | 790 | else if (wildcardp (file_spec)) |
4dec4d4e | 791 | { |
e50d8076 | 792 | LANG_FOR_EACH_INPUT_STATEMENT (f) |
4dec4d4e | 793 | { |
68bbb9f7 | 794 | if (fnmatch (file_spec, f->filename, 0) == 0) |
b6bf44ba | 795 | walk_wild_file (s, f, callback, data); |
4dec4d4e RH |
796 | } |
797 | } | |
798 | else | |
799 | { | |
e50d8076 NC |
800 | lang_input_statement_type *f; |
801 | ||
4dec4d4e | 802 | /* Perform the iteration over a single file. */ |
b6bf44ba | 803 | f = lookup_name (file_spec); |
6770ec8c | 804 | if (f) |
b6bf44ba | 805 | walk_wild_file (s, f, callback, data); |
4dec4d4e | 806 | } |
5f992e62 AM |
807 | } |
808 | ||
08da4cac KH |
809 | /* lang_for_each_statement walks the parse tree and calls the provided |
810 | function for each node. */ | |
252b5132 RH |
811 | |
812 | static void | |
1579bae1 AM |
813 | lang_for_each_statement_worker (void (*func) (lang_statement_union_type *), |
814 | lang_statement_union_type *s) | |
252b5132 | 815 | { |
1579bae1 | 816 | for (; s != NULL; s = s->header.next) |
252b5132 RH |
817 | { |
818 | func (s); | |
819 | ||
820 | switch (s->header.type) | |
821 | { | |
822 | case lang_constructors_statement_enum: | |
823 | lang_for_each_statement_worker (func, constructor_list.head); | |
824 | break; | |
825 | case lang_output_section_statement_enum: | |
826 | lang_for_each_statement_worker | |
6feb9908 | 827 | (func, s->output_section_statement.children.head); |
252b5132 RH |
828 | break; |
829 | case lang_wild_statement_enum: | |
6feb9908 AM |
830 | lang_for_each_statement_worker (func, |
831 | s->wild_statement.children.head); | |
252b5132 RH |
832 | break; |
833 | case lang_group_statement_enum: | |
834 | lang_for_each_statement_worker (func, | |
835 | s->group_statement.children.head); | |
836 | break; | |
837 | case lang_data_statement_enum: | |
838 | case lang_reloc_statement_enum: | |
839 | case lang_object_symbols_statement_enum: | |
840 | case lang_output_statement_enum: | |
841 | case lang_target_statement_enum: | |
842 | case lang_input_section_enum: | |
843 | case lang_input_statement_enum: | |
844 | case lang_assignment_statement_enum: | |
845 | case lang_padding_statement_enum: | |
846 | case lang_address_statement_enum: | |
847 | case lang_fill_statement_enum: | |
848 | break; | |
849 | default: | |
850 | FAIL (); | |
851 | break; | |
852 | } | |
853 | } | |
854 | } | |
855 | ||
856 | void | |
1579bae1 | 857 | lang_for_each_statement (void (*func) (lang_statement_union_type *)) |
252b5132 | 858 | { |
08da4cac | 859 | lang_for_each_statement_worker (func, statement_list.head); |
252b5132 RH |
860 | } |
861 | ||
862 | /*----------------------------------------------------------------------*/ | |
08da4cac | 863 | |
252b5132 | 864 | void |
1579bae1 | 865 | lang_list_init (lang_statement_list_type *list) |
252b5132 | 866 | { |
1579bae1 | 867 | list->head = NULL; |
252b5132 RH |
868 | list->tail = &list->head; |
869 | } | |
870 | ||
08da4cac | 871 | /* Build a new statement node for the parse tree. */ |
252b5132 | 872 | |
08da4cac | 873 | static lang_statement_union_type * |
1579bae1 AM |
874 | new_statement (enum statement_enum type, |
875 | size_t size, | |
876 | lang_statement_list_type *list) | |
252b5132 | 877 | { |
1579bae1 | 878 | lang_statement_union_type *new; |
252b5132 | 879 | |
1579bae1 | 880 | new = stat_alloc (size); |
252b5132 | 881 | new->header.type = type; |
1579bae1 | 882 | new->header.next = NULL; |
252b5132 RH |
883 | lang_statement_append (list, new, &new->header.next); |
884 | return new; | |
885 | } | |
886 | ||
08da4cac KH |
887 | /* Build a new input file node for the language. There are several |
888 | ways in which we treat an input file, eg, we only look at symbols, | |
889 | or prefix it with a -l etc. | |
252b5132 | 890 | |
08da4cac | 891 | We can be supplied with requests for input files more than once; |
396a2467 | 892 | they may, for example be split over several lines like foo.o(.text) |
d1778b88 | 893 | foo.o(.data) etc, so when asked for a file we check that we haven't |
08da4cac | 894 | got it already so we don't duplicate the bfd. */ |
252b5132 | 895 | |
252b5132 | 896 | static lang_input_statement_type * |
1579bae1 AM |
897 | new_afile (const char *name, |
898 | lang_input_file_enum_type file_type, | |
899 | const char *target, | |
900 | bfd_boolean add_to_list) | |
252b5132 RH |
901 | { |
902 | lang_input_statement_type *p; | |
903 | ||
904 | if (add_to_list) | |
905 | p = new_stat (lang_input_statement, stat_ptr); | |
906 | else | |
907 | { | |
1579bae1 | 908 | p = stat_alloc (sizeof (lang_input_statement_type)); |
bd4d42c1 | 909 | p->header.type = lang_input_statement_enum; |
252b5132 RH |
910 | p->header.next = NULL; |
911 | } | |
912 | ||
b34976b6 | 913 | lang_has_input_file = TRUE; |
252b5132 | 914 | p->target = target; |
e3f2db7f | 915 | p->sysrooted = FALSE; |
252b5132 RH |
916 | switch (file_type) |
917 | { | |
918 | case lang_input_file_is_symbols_only_enum: | |
919 | p->filename = name; | |
b34976b6 AM |
920 | p->is_archive = FALSE; |
921 | p->real = TRUE; | |
252b5132 | 922 | p->local_sym_name = name; |
b34976b6 AM |
923 | p->just_syms_flag = TRUE; |
924 | p->search_dirs_flag = FALSE; | |
252b5132 RH |
925 | break; |
926 | case lang_input_file_is_fake_enum: | |
927 | p->filename = name; | |
b34976b6 AM |
928 | p->is_archive = FALSE; |
929 | p->real = FALSE; | |
252b5132 | 930 | p->local_sym_name = name; |
b34976b6 AM |
931 | p->just_syms_flag = FALSE; |
932 | p->search_dirs_flag = FALSE; | |
252b5132 RH |
933 | break; |
934 | case lang_input_file_is_l_enum: | |
b34976b6 | 935 | p->is_archive = TRUE; |
252b5132 | 936 | p->filename = name; |
b34976b6 | 937 | p->real = TRUE; |
1579bae1 | 938 | p->local_sym_name = concat ("-l", name, NULL); |
b34976b6 AM |
939 | p->just_syms_flag = FALSE; |
940 | p->search_dirs_flag = TRUE; | |
252b5132 RH |
941 | break; |
942 | case lang_input_file_is_marker_enum: | |
943 | p->filename = name; | |
b34976b6 AM |
944 | p->is_archive = FALSE; |
945 | p->real = FALSE; | |
252b5132 | 946 | p->local_sym_name = name; |
b34976b6 AM |
947 | p->just_syms_flag = FALSE; |
948 | p->search_dirs_flag = TRUE; | |
252b5132 RH |
949 | break; |
950 | case lang_input_file_is_search_file_enum: | |
e3f2db7f | 951 | p->sysrooted = ldlang_sysrooted_script; |
252b5132 | 952 | p->filename = name; |
b34976b6 AM |
953 | p->is_archive = FALSE; |
954 | p->real = TRUE; | |
252b5132 | 955 | p->local_sym_name = name; |
b34976b6 AM |
956 | p->just_syms_flag = FALSE; |
957 | p->search_dirs_flag = TRUE; | |
252b5132 RH |
958 | break; |
959 | case lang_input_file_is_file_enum: | |
960 | p->filename = name; | |
b34976b6 AM |
961 | p->is_archive = FALSE; |
962 | p->real = TRUE; | |
252b5132 | 963 | p->local_sym_name = name; |
b34976b6 AM |
964 | p->just_syms_flag = FALSE; |
965 | p->search_dirs_flag = FALSE; | |
252b5132 RH |
966 | break; |
967 | default: | |
968 | FAIL (); | |
969 | } | |
1579bae1 AM |
970 | p->the_bfd = NULL; |
971 | p->asymbols = NULL; | |
972 | p->next_real_file = NULL; | |
973 | p->next = NULL; | |
252b5132 RH |
974 | p->symbol_count = 0; |
975 | p->dynamic = config.dynamic_link; | |
e56f61be | 976 | p->add_needed = add_needed; |
4a43e768 | 977 | p->as_needed = as_needed; |
252b5132 | 978 | p->whole_archive = whole_archive; |
b34976b6 | 979 | p->loaded = FALSE; |
252b5132 RH |
980 | lang_statement_append (&input_file_chain, |
981 | (lang_statement_union_type *) p, | |
982 | &p->next_real_file); | |
983 | return p; | |
984 | } | |
985 | ||
986 | lang_input_statement_type * | |
1579bae1 AM |
987 | lang_add_input_file (const char *name, |
988 | lang_input_file_enum_type file_type, | |
989 | const char *target) | |
252b5132 | 990 | { |
b34976b6 | 991 | return new_afile (name, file_type, target, TRUE); |
252b5132 RH |
992 | } |
993 | ||
409d7240 | 994 | struct out_section_hash_entry |
750877ba L |
995 | { |
996 | struct bfd_hash_entry root; | |
409d7240 | 997 | lang_statement_union_type s; |
750877ba L |
998 | }; |
999 | ||
1000 | /* The hash table. */ | |
1001 | ||
409d7240 | 1002 | static struct bfd_hash_table output_section_statement_table; |
750877ba | 1003 | |
384a9dda | 1004 | /* Support routines for the hash table used by lang_output_section_find, |
750877ba L |
1005 | initialize the table, fill in an entry and remove the table. */ |
1006 | ||
1007 | static struct bfd_hash_entry * | |
329c1c86 | 1008 | output_section_statement_newfunc (struct bfd_hash_entry *entry, |
409d7240 AM |
1009 | struct bfd_hash_table *table, |
1010 | const char *string) | |
750877ba | 1011 | { |
384a9dda | 1012 | lang_output_section_statement_type **nextp; |
409d7240 | 1013 | struct out_section_hash_entry *ret; |
384a9dda AM |
1014 | |
1015 | if (entry == NULL) | |
1016 | { | |
1017 | entry = bfd_hash_allocate (table, sizeof (*ret)); | |
1018 | if (entry == NULL) | |
1019 | return entry; | |
1020 | } | |
1021 | ||
1022 | entry = bfd_hash_newfunc (entry, table, string); | |
1023 | if (entry == NULL) | |
1024 | return entry; | |
1025 | ||
409d7240 AM |
1026 | ret = (struct out_section_hash_entry *) entry; |
1027 | memset (&ret->s, 0, sizeof (ret->s)); | |
1028 | ret->s.header.type = lang_output_section_statement_enum; | |
1029 | ret->s.output_section_statement.subsection_alignment = -1; | |
1030 | ret->s.output_section_statement.section_alignment = -1; | |
1031 | ret->s.output_section_statement.block_value = 1; | |
1032 | lang_list_init (&ret->s.output_section_statement.children); | |
1033 | lang_statement_append (stat_ptr, &ret->s, &ret->s.header.next); | |
384a9dda | 1034 | |
218868ba AM |
1035 | /* For every output section statement added to the list, except the |
1036 | first one, lang_output_section_statement.tail points to the "next" | |
1037 | field of the last element of the list. */ | |
1038 | if (lang_output_section_statement.head != NULL) | |
409d7240 AM |
1039 | ret->s.output_section_statement.prev |
1040 | = ((lang_output_section_statement_type *) | |
1041 | ((char *) lang_output_section_statement.tail | |
1042 | - offsetof (lang_output_section_statement_type, next))); | |
218868ba | 1043 | |
384a9dda AM |
1044 | /* GCC's strict aliasing rules prevent us from just casting the |
1045 | address, so we store the pointer in a variable and cast that | |
1046 | instead. */ | |
409d7240 | 1047 | nextp = &ret->s.output_section_statement.next; |
384a9dda | 1048 | lang_statement_append (&lang_output_section_statement, |
409d7240 | 1049 | &ret->s, |
384a9dda AM |
1050 | (lang_statement_union_type **) nextp); |
1051 | return &ret->root; | |
750877ba L |
1052 | } |
1053 | ||
1054 | static void | |
409d7240 | 1055 | output_section_statement_table_init (void) |
750877ba | 1056 | { |
409d7240 AM |
1057 | if (!bfd_hash_table_init_n (&output_section_statement_table, |
1058 | output_section_statement_newfunc, | |
1059 | sizeof (struct out_section_hash_entry), | |
66eb6687 | 1060 | 61)) |
384a9dda | 1061 | einfo (_("%P%F: can not create hash table: %E\n")); |
750877ba L |
1062 | } |
1063 | ||
1064 | static void | |
409d7240 | 1065 | output_section_statement_table_free (void) |
750877ba | 1066 | { |
409d7240 | 1067 | bfd_hash_table_free (&output_section_statement_table); |
750877ba L |
1068 | } |
1069 | ||
08da4cac KH |
1070 | /* Build enough state so that the parser can build its tree. */ |
1071 | ||
252b5132 | 1072 | void |
1579bae1 | 1073 | lang_init (void) |
252b5132 RH |
1074 | { |
1075 | obstack_begin (&stat_obstack, 1000); | |
1076 | ||
1077 | stat_ptr = &statement_list; | |
1078 | ||
409d7240 | 1079 | output_section_statement_table_init (); |
750877ba | 1080 | |
252b5132 RH |
1081 | lang_list_init (stat_ptr); |
1082 | ||
1083 | lang_list_init (&input_file_chain); | |
1084 | lang_list_init (&lang_output_section_statement); | |
1085 | lang_list_init (&file_chain); | |
1579bae1 AM |
1086 | first_file = lang_add_input_file (NULL, lang_input_file_is_marker_enum, |
1087 | NULL); | |
08da4cac KH |
1088 | abs_output_section = |
1089 | lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME); | |
252b5132 RH |
1090 | |
1091 | abs_output_section->bfd_section = bfd_abs_section_ptr; | |
420e579c HPN |
1092 | |
1093 | /* The value "3" is ad-hoc, somewhat related to the expected number of | |
1094 | DEFINED expressions in a linker script. For most default linker | |
1095 | scripts, there are none. Why a hash table then? Well, it's somewhat | |
1096 | simpler to re-use working machinery than using a linked list in terms | |
1097 | of code-complexity here in ld, besides the initialization which just | |
1098 | looks like other code here. */ | |
688c58f3 | 1099 | if (!bfd_hash_table_init_n (&lang_definedness_table, |
66eb6687 AM |
1100 | lang_definedness_newfunc, |
1101 | sizeof (struct lang_definedness_hash_entry), | |
1102 | 3)) | |
384a9dda | 1103 | einfo (_("%P%F: can not create hash table: %E\n")); |
252b5132 RH |
1104 | } |
1105 | ||
750877ba L |
1106 | void |
1107 | lang_finish (void) | |
1108 | { | |
409d7240 | 1109 | output_section_statement_table_free (); |
750877ba L |
1110 | } |
1111 | ||
252b5132 | 1112 | /*---------------------------------------------------------------------- |
08da4cac KH |
1113 | A region is an area of memory declared with the |
1114 | MEMORY { name:org=exp, len=exp ... } | |
1115 | syntax. | |
252b5132 | 1116 | |
08da4cac | 1117 | We maintain a list of all the regions here. |
252b5132 | 1118 | |
08da4cac | 1119 | If no regions are specified in the script, then the default is used |
a747ee4d NC |
1120 | which is created when looked up to be the entire data space. |
1121 | ||
1122 | If create is true we are creating a region inside a MEMORY block. | |
1123 | In this case it is probably an error to create a region that has | |
1124 | already been created. If we are not inside a MEMORY block it is | |
1125 | dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION) | |
1126 | and so we issue a warning. */ | |
252b5132 RH |
1127 | |
1128 | static lang_memory_region_type *lang_memory_region_list; | |
6feb9908 AM |
1129 | static lang_memory_region_type **lang_memory_region_list_tail |
1130 | = &lang_memory_region_list; | |
252b5132 RH |
1131 | |
1132 | lang_memory_region_type * | |
a747ee4d | 1133 | lang_memory_region_lookup (const char *const name, bfd_boolean create) |
252b5132 RH |
1134 | { |
1135 | lang_memory_region_type *p; | |
1579bae1 | 1136 | lang_memory_region_type *new; |
252b5132 | 1137 | |
9f88b410 RS |
1138 | /* NAME is NULL for LMA memspecs if no region was specified. */ |
1139 | if (name == NULL) | |
1140 | return NULL; | |
1141 | ||
1579bae1 | 1142 | for (p = lang_memory_region_list; p != NULL; p = p->next) |
a747ee4d NC |
1143 | if (strcmp (p->name, name) == 0) |
1144 | { | |
1145 | if (create) | |
6feb9908 AM |
1146 | einfo (_("%P:%S: warning: redeclaration of memory region '%s'\n"), |
1147 | name); | |
1579bae1 | 1148 | return p; |
a747ee4d | 1149 | } |
252b5132 | 1150 | |
a747ee4d NC |
1151 | if (!create && strcmp (name, DEFAULT_MEMORY_REGION)) |
1152 | einfo (_("%P:%S: warning: memory region %s not declared\n"), name); | |
1153 | ||
1579bae1 | 1154 | new = stat_alloc (sizeof (lang_memory_region_type)); |
252b5132 | 1155 | |
1579bae1 AM |
1156 | new->name = xstrdup (name); |
1157 | new->next = NULL; | |
1579bae1 | 1158 | new->origin = 0; |
1579bae1 AM |
1159 | new->length = ~(bfd_size_type) 0; |
1160 | new->current = 0; | |
66e28d60 AM |
1161 | new->last_os = NULL; |
1162 | new->flags = 0; | |
1163 | new->not_flags = 0; | |
1579bae1 | 1164 | new->had_full_message = FALSE; |
252b5132 | 1165 | |
66e28d60 AM |
1166 | *lang_memory_region_list_tail = new; |
1167 | lang_memory_region_list_tail = &new->next; | |
1168 | ||
1579bae1 | 1169 | return new; |
252b5132 RH |
1170 | } |
1171 | ||
5f992e62 | 1172 | static lang_memory_region_type * |
1579bae1 | 1173 | lang_memory_default (asection *section) |
252b5132 RH |
1174 | { |
1175 | lang_memory_region_type *p; | |
1176 | ||
1177 | flagword sec_flags = section->flags; | |
1178 | ||
1179 | /* Override SEC_DATA to mean a writable section. */ | |
1180 | if ((sec_flags & (SEC_ALLOC | SEC_READONLY | SEC_CODE)) == SEC_ALLOC) | |
1181 | sec_flags |= SEC_DATA; | |
1182 | ||
1579bae1 | 1183 | for (p = lang_memory_region_list; p != NULL; p = p->next) |
252b5132 RH |
1184 | { |
1185 | if ((p->flags & sec_flags) != 0 | |
1186 | && (p->not_flags & sec_flags) == 0) | |
1187 | { | |
1188 | return p; | |
1189 | } | |
1190 | } | |
a747ee4d | 1191 | return lang_memory_region_lookup (DEFAULT_MEMORY_REGION, FALSE); |
252b5132 RH |
1192 | } |
1193 | ||
384a9dda AM |
1194 | lang_output_section_statement_type * |
1195 | lang_output_section_find (const char *const name) | |
252b5132 | 1196 | { |
409d7240 | 1197 | struct out_section_hash_entry *entry; |
750877ba | 1198 | unsigned long hash; |
252b5132 | 1199 | |
409d7240 AM |
1200 | entry = ((struct out_section_hash_entry *) |
1201 | bfd_hash_lookup (&output_section_statement_table, name, | |
1202 | FALSE, FALSE)); | |
384a9dda | 1203 | if (entry == NULL) |
750877ba L |
1204 | return NULL; |
1205 | ||
1206 | hash = entry->root.hash; | |
1207 | do | |
252b5132 | 1208 | { |
409d7240 AM |
1209 | if (entry->s.output_section_statement.constraint != -1) |
1210 | return &entry->s.output_section_statement; | |
1211 | entry = (struct out_section_hash_entry *) entry->root.next; | |
252b5132 | 1212 | } |
750877ba L |
1213 | while (entry != NULL |
1214 | && entry->root.hash == hash | |
409d7240 | 1215 | && strcmp (name, entry->s.output_section_statement.name) == 0); |
750877ba | 1216 | |
1579bae1 | 1217 | return NULL; |
252b5132 RH |
1218 | } |
1219 | ||
0841712e JJ |
1220 | static lang_output_section_statement_type * |
1221 | lang_output_section_statement_lookup_1 (const char *const name, int constraint) | |
252b5132 | 1222 | { |
409d7240 AM |
1223 | struct out_section_hash_entry *entry; |
1224 | struct out_section_hash_entry *last_ent; | |
384a9dda AM |
1225 | unsigned long hash; |
1226 | ||
409d7240 AM |
1227 | entry = ((struct out_section_hash_entry *) |
1228 | bfd_hash_lookup (&output_section_statement_table, name, | |
1229 | TRUE, FALSE)); | |
384a9dda AM |
1230 | if (entry == NULL) |
1231 | { | |
1232 | einfo (_("%P%F: failed creating section `%s': %E\n"), name); | |
1233 | return NULL; | |
1234 | } | |
252b5132 | 1235 | |
409d7240 | 1236 | if (entry->s.output_section_statement.name != NULL) |
252b5132 | 1237 | { |
384a9dda AM |
1238 | /* We have a section of this name, but it might not have the correct |
1239 | constraint. */ | |
1240 | hash = entry->root.hash; | |
1241 | do | |
1242 | { | |
409d7240 | 1243 | if (entry->s.output_section_statement.constraint != -1 |
384a9dda | 1244 | && (constraint == 0 |
409d7240 | 1245 | || (constraint == entry->s.output_section_statement.constraint |
384a9dda | 1246 | && constraint != SPECIAL))) |
409d7240 | 1247 | return &entry->s.output_section_statement; |
384a9dda | 1248 | last_ent = entry; |
409d7240 | 1249 | entry = (struct out_section_hash_entry *) entry->root.next; |
384a9dda AM |
1250 | } |
1251 | while (entry != NULL | |
1252 | && entry->root.hash == hash | |
409d7240 | 1253 | && strcmp (name, entry->s.output_section_statement.name) == 0); |
252b5132 | 1254 | |
409d7240 AM |
1255 | entry |
1256 | = ((struct out_section_hash_entry *) | |
1257 | output_section_statement_newfunc (NULL, | |
1258 | &output_section_statement_table, | |
1259 | name)); | |
750877ba | 1260 | if (entry == NULL) |
384a9dda AM |
1261 | { |
1262 | einfo (_("%P%F: failed creating section `%s': %E\n"), name); | |
1263 | return NULL; | |
1264 | } | |
1265 | entry->root = last_ent->root; | |
1266 | last_ent->root.next = &entry->root; | |
252b5132 | 1267 | } |
384a9dda | 1268 | |
409d7240 AM |
1269 | entry->s.output_section_statement.name = name; |
1270 | entry->s.output_section_statement.constraint = constraint; | |
1271 | return &entry->s.output_section_statement; | |
252b5132 RH |
1272 | } |
1273 | ||
0841712e JJ |
1274 | lang_output_section_statement_type * |
1275 | lang_output_section_statement_lookup (const char *const name) | |
1276 | { | |
1277 | return lang_output_section_statement_lookup_1 (name, 0); | |
1278 | } | |
1279 | ||
afd7a018 AM |
1280 | /* A variant of lang_output_section_find used by place_orphan. |
1281 | Returns the output statement that should precede a new output | |
1282 | statement for SEC. If an exact match is found on certain flags, | |
1283 | sets *EXACT too. */ | |
1284 | ||
1285 | lang_output_section_statement_type * | |
1286 | lang_output_section_find_by_flags (const asection *sec, | |
390fbbf1 AM |
1287 | lang_output_section_statement_type **exact, |
1288 | lang_match_sec_type_func match_type) | |
afd7a018 AM |
1289 | { |
1290 | lang_output_section_statement_type *first, *look, *found; | |
1291 | flagword flags; | |
1292 | ||
1293 | /* We know the first statement on this list is *ABS*. May as well | |
1294 | skip it. */ | |
1295 | first = &lang_output_section_statement.head->output_section_statement; | |
1296 | first = first->next; | |
1297 | ||
1298 | /* First try for an exact match. */ | |
1299 | found = NULL; | |
1300 | for (look = first; look; look = look->next) | |
1301 | { | |
1302 | flags = look->flags; | |
1303 | if (look->bfd_section != NULL) | |
ecca9871 L |
1304 | { |
1305 | flags = look->bfd_section->flags; | |
390fbbf1 AM |
1306 | if (match_type && !match_type (output_bfd, look->bfd_section, |
1307 | sec->owner, sec)) | |
ecca9871 L |
1308 | continue; |
1309 | } | |
afd7a018 AM |
1310 | flags ^= sec->flags; |
1311 | if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD | SEC_READONLY | |
1312 | | SEC_CODE | SEC_SMALL_DATA | SEC_THREAD_LOCAL))) | |
1313 | found = look; | |
1314 | } | |
1315 | if (found != NULL) | |
1316 | { | |
390fbbf1 AM |
1317 | if (exact != NULL) |
1318 | *exact = found; | |
afd7a018 AM |
1319 | return found; |
1320 | } | |
1321 | ||
1322 | if (sec->flags & SEC_CODE) | |
1323 | { | |
1324 | /* Try for a rw code section. */ | |
1325 | for (look = first; look; look = look->next) | |
1326 | { | |
1327 | flags = look->flags; | |
1328 | if (look->bfd_section != NULL) | |
ecca9871 L |
1329 | { |
1330 | flags = look->bfd_section->flags; | |
390fbbf1 AM |
1331 | if (match_type && !match_type (output_bfd, look->bfd_section, |
1332 | sec->owner, sec)) | |
ecca9871 L |
1333 | continue; |
1334 | } | |
afd7a018 AM |
1335 | flags ^= sec->flags; |
1336 | if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD | |
1337 | | SEC_CODE | SEC_SMALL_DATA | SEC_THREAD_LOCAL))) | |
1338 | found = look; | |
1339 | } | |
afd7a018 | 1340 | } |
390fbbf1 | 1341 | else if (sec->flags & (SEC_READONLY | SEC_THREAD_LOCAL)) |
afd7a018 AM |
1342 | { |
1343 | /* .rodata can go after .text, .sdata2 after .rodata. */ | |
1344 | for (look = first; look; look = look->next) | |
1345 | { | |
1346 | flags = look->flags; | |
1347 | if (look->bfd_section != NULL) | |
ecca9871 L |
1348 | { |
1349 | flags = look->bfd_section->flags; | |
390fbbf1 AM |
1350 | if (match_type && !match_type (output_bfd, look->bfd_section, |
1351 | sec->owner, sec)) | |
ecca9871 L |
1352 | continue; |
1353 | } | |
afd7a018 AM |
1354 | flags ^= sec->flags; |
1355 | if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD | |
1356 | | SEC_READONLY)) | |
1357 | && !(look->flags & (SEC_SMALL_DATA | SEC_THREAD_LOCAL))) | |
1358 | found = look; | |
1359 | } | |
afd7a018 | 1360 | } |
390fbbf1 | 1361 | else if (sec->flags & SEC_SMALL_DATA) |
afd7a018 AM |
1362 | { |
1363 | /* .sdata goes after .data, .sbss after .sdata. */ | |
1364 | for (look = first; look; look = look->next) | |
1365 | { | |
1366 | flags = look->flags; | |
1367 | if (look->bfd_section != NULL) | |
ecca9871 L |
1368 | { |
1369 | flags = look->bfd_section->flags; | |
390fbbf1 AM |
1370 | if (match_type && !match_type (output_bfd, look->bfd_section, |
1371 | sec->owner, sec)) | |
ecca9871 L |
1372 | continue; |
1373 | } | |
afd7a018 AM |
1374 | flags ^= sec->flags; |
1375 | if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD | |
1376 | | SEC_THREAD_LOCAL)) | |
1377 | || ((look->flags & SEC_SMALL_DATA) | |
1378 | && !(sec->flags & SEC_HAS_CONTENTS))) | |
1379 | found = look; | |
1380 | } | |
afd7a018 | 1381 | } |
390fbbf1 | 1382 | else if (sec->flags & SEC_HAS_CONTENTS) |
afd7a018 AM |
1383 | { |
1384 | /* .data goes after .rodata. */ | |
1385 | for (look = first; look; look = look->next) | |
1386 | { | |
1387 | flags = look->flags; | |
1388 | if (look->bfd_section != NULL) | |
ecca9871 L |
1389 | { |
1390 | flags = look->bfd_section->flags; | |
390fbbf1 AM |
1391 | if (match_type && !match_type (output_bfd, look->bfd_section, |
1392 | sec->owner, sec)) | |
ecca9871 L |
1393 | continue; |
1394 | } | |
afd7a018 AM |
1395 | flags ^= sec->flags; |
1396 | if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD | |
1397 | | SEC_SMALL_DATA | SEC_THREAD_LOCAL))) | |
1398 | found = look; | |
1399 | } | |
afd7a018 | 1400 | } |
390fbbf1 | 1401 | else |
afd7a018 | 1402 | { |
390fbbf1 AM |
1403 | /* .bss goes last. */ |
1404 | for (look = first; look; look = look->next) | |
ecca9871 | 1405 | { |
390fbbf1 AM |
1406 | flags = look->flags; |
1407 | if (look->bfd_section != NULL) | |
1408 | { | |
1409 | flags = look->bfd_section->flags; | |
1410 | if (match_type && !match_type (output_bfd, look->bfd_section, | |
1411 | sec->owner, sec)) | |
1412 | continue; | |
1413 | } | |
1414 | flags ^= sec->flags; | |
1415 | if (!(flags & SEC_ALLOC)) | |
1416 | found = look; | |
ecca9871 | 1417 | } |
afd7a018 AM |
1418 | } |
1419 | ||
390fbbf1 AM |
1420 | if (found || !match_type) |
1421 | return found; | |
1422 | ||
1423 | return lang_output_section_find_by_flags (sec, NULL, NULL); | |
afd7a018 AM |
1424 | } |
1425 | ||
1426 | /* Find the last output section before given output statement. | |
1427 | Used by place_orphan. */ | |
1428 | ||
1429 | static asection * | |
1430 | output_prev_sec_find (lang_output_section_statement_type *os) | |
1431 | { | |
afd7a018 AM |
1432 | lang_output_section_statement_type *lookup; |
1433 | ||
218868ba | 1434 | for (lookup = os->prev; lookup != NULL; lookup = lookup->prev) |
afd7a018 AM |
1435 | { |
1436 | if (lookup->constraint == -1) | |
1437 | continue; | |
afd7a018 AM |
1438 | |
1439 | if (lookup->bfd_section != NULL && lookup->bfd_section->owner != NULL) | |
218868ba | 1440 | return lookup->bfd_section; |
afd7a018 AM |
1441 | } |
1442 | ||
1443 | return NULL; | |
1444 | } | |
1445 | ||
1446 | lang_output_section_statement_type * | |
7b986e99 | 1447 | lang_insert_orphan (asection *s, |
afd7a018 AM |
1448 | const char *secname, |
1449 | lang_output_section_statement_type *after, | |
1450 | struct orphan_save *place, | |
1451 | etree_type *address, | |
1452 | lang_statement_list_type *add_child) | |
1453 | { | |
1454 | lang_statement_list_type *old; | |
1455 | lang_statement_list_type add; | |
1456 | const char *ps; | |
afd7a018 AM |
1457 | lang_output_section_statement_type *os; |
1458 | lang_output_section_statement_type **os_tail; | |
1459 | ||
1460 | /* Start building a list of statements for this section. | |
1461 | First save the current statement pointer. */ | |
1462 | old = stat_ptr; | |
1463 | ||
1464 | /* If we have found an appropriate place for the output section | |
1465 | statements for this orphan, add them to our own private list, | |
1466 | inserting them later into the global statement list. */ | |
1467 | if (after != NULL) | |
1468 | { | |
1469 | stat_ptr = &add; | |
1470 | lang_list_init (stat_ptr); | |
1471 | } | |
1472 | ||
1473 | ps = NULL; | |
1474 | if (config.build_constructors) | |
1475 | { | |
1476 | /* If the name of the section is representable in C, then create | |
1477 | symbols to mark the start and the end of the section. */ | |
1478 | for (ps = secname; *ps != '\0'; ps++) | |
1479 | if (! ISALNUM ((unsigned char) *ps) && *ps != '_') | |
1480 | break; | |
1481 | if (*ps == '\0') | |
1482 | { | |
1483 | char *symname; | |
1484 | etree_type *e_align; | |
1485 | ||
1486 | symname = (char *) xmalloc (ps - secname + sizeof "__start_" + 1); | |
1487 | symname[0] = bfd_get_symbol_leading_char (output_bfd); | |
1488 | sprintf (symname + (symname[0] != 0), "__start_%s", secname); | |
1489 | e_align = exp_unop (ALIGN_K, | |
1490 | exp_intop ((bfd_vma) 1 << s->alignment_power)); | |
1491 | lang_add_assignment (exp_assop ('=', ".", e_align)); | |
34711ca3 AM |
1492 | lang_add_assignment (exp_provide (symname, |
1493 | exp_nameop (NAME, "."), | |
1494 | FALSE)); | |
afd7a018 AM |
1495 | } |
1496 | } | |
1497 | ||
1498 | if (link_info.relocatable || (s->flags & (SEC_LOAD | SEC_ALLOC)) == 0) | |
1499 | address = exp_intop (0); | |
1500 | ||
afd7a018 AM |
1501 | os_tail = ((lang_output_section_statement_type **) |
1502 | lang_output_section_statement.tail); | |
1503 | os = lang_enter_output_section_statement (secname, address, 0, NULL, NULL, | |
66e28d60 | 1504 | NULL, 0); |
afd7a018 AM |
1505 | |
1506 | if (add_child == NULL) | |
1507 | add_child = &os->children; | |
7b986e99 | 1508 | lang_add_section (add_child, s, os); |
afd7a018 AM |
1509 | |
1510 | lang_leave_output_section_statement (0, "*default*", NULL, NULL); | |
1511 | ||
1512 | if (config.build_constructors && *ps == '\0') | |
1513 | { | |
1514 | char *symname; | |
1515 | ||
1516 | /* lang_leave_ouput_section_statement resets stat_ptr. | |
1517 | Put stat_ptr back where we want it. */ | |
1518 | if (after != NULL) | |
1519 | stat_ptr = &add; | |
1520 | ||
1521 | symname = (char *) xmalloc (ps - secname + sizeof "__stop_" + 1); | |
1522 | symname[0] = bfd_get_symbol_leading_char (output_bfd); | |
1523 | sprintf (symname + (symname[0] != 0), "__stop_%s", secname); | |
34711ca3 AM |
1524 | lang_add_assignment (exp_provide (symname, |
1525 | exp_nameop (NAME, "."), | |
1526 | FALSE)); | |
afd7a018 AM |
1527 | } |
1528 | ||
1529 | /* Restore the global list pointer. */ | |
1530 | if (after != NULL) | |
1531 | stat_ptr = old; | |
1532 | ||
1533 | if (after != NULL && os->bfd_section != NULL) | |
1534 | { | |
5daa8fe7 | 1535 | asection *snew, *as; |
afd7a018 AM |
1536 | |
1537 | snew = os->bfd_section; | |
1538 | ||
1539 | /* Shuffle the bfd section list to make the output file look | |
1540 | neater. This is really only cosmetic. */ | |
1541 | if (place->section == NULL | |
1542 | && after != (&lang_output_section_statement.head | |
1543 | ->output_section_statement)) | |
1544 | { | |
1545 | asection *bfd_section = after->bfd_section; | |
1546 | ||
1547 | /* If the output statement hasn't been used to place any input | |
1548 | sections (and thus doesn't have an output bfd_section), | |
1549 | look for the closest prior output statement having an | |
1550 | output section. */ | |
1551 | if (bfd_section == NULL) | |
1552 | bfd_section = output_prev_sec_find (after); | |
1553 | ||
1554 | if (bfd_section != NULL && bfd_section != snew) | |
1555 | place->section = &bfd_section->next; | |
1556 | } | |
1557 | ||
1558 | if (place->section == NULL) | |
1559 | place->section = &output_bfd->sections; | |
1560 | ||
5daa8fe7 | 1561 | as = *place->section; |
5e542ba7 MS |
1562 | |
1563 | if (!as) | |
329c1c86 AM |
1564 | { |
1565 | /* Put the section at the end of the list. */ | |
5e542ba7 MS |
1566 | |
1567 | /* Unlink the section. */ | |
1568 | bfd_section_list_remove (output_bfd, snew); | |
1569 | ||
1570 | /* Now tack it back on in the right place. */ | |
1571 | bfd_section_list_append (output_bfd, snew); | |
329c1c86 | 1572 | } |
5e542ba7 | 1573 | else if (as != snew && as->prev != snew) |
5daa8fe7 L |
1574 | { |
1575 | /* Unlink the section. */ | |
1576 | bfd_section_list_remove (output_bfd, snew); | |
afd7a018 | 1577 | |
5daa8fe7 L |
1578 | /* Now tack it back on in the right place. */ |
1579 | bfd_section_list_insert_before (output_bfd, as, snew); | |
1580 | } | |
afd7a018 AM |
1581 | |
1582 | /* Save the end of this list. Further ophans of this type will | |
1583 | follow the one we've just added. */ | |
1584 | place->section = &snew->next; | |
1585 | ||
1586 | /* The following is non-cosmetic. We try to put the output | |
1587 | statements in some sort of reasonable order here, because they | |
1588 | determine the final load addresses of the orphan sections. | |
1589 | In addition, placing output statements in the wrong order may | |
1590 | require extra segments. For instance, given a typical | |
1591 | situation of all read-only sections placed in one segment and | |
1592 | following that a segment containing all the read-write | |
1593 | sections, we wouldn't want to place an orphan read/write | |
1594 | section before or amongst the read-only ones. */ | |
1595 | if (add.head != NULL) | |
1596 | { | |
1597 | lang_output_section_statement_type *newly_added_os; | |
1598 | ||
1599 | if (place->stmt == NULL) | |
1600 | { | |
1601 | lang_statement_union_type **where; | |
1602 | lang_statement_union_type **assign = NULL; | |
be529132 | 1603 | bfd_boolean ignore_first; |
afd7a018 AM |
1604 | |
1605 | /* Look for a suitable place for the new statement list. | |
1606 | The idea is to skip over anything that might be inside | |
1607 | a SECTIONS {} statement in a script, before we find | |
1608 | another output_section_statement. Assignments to "dot" | |
1609 | before an output section statement are assumed to | |
be529132 AM |
1610 | belong to it. An exception to this rule is made for |
1611 | the first assignment to dot, otherwise we might put an | |
1612 | orphan before . = . + SIZEOF_HEADERS or similar | |
1613 | assignments that set the initial address. */ | |
1614 | ||
1615 | ignore_first = after == (&lang_output_section_statement.head | |
1616 | ->output_section_statement); | |
afd7a018 AM |
1617 | for (where = &after->header.next; |
1618 | *where != NULL; | |
1619 | where = &(*where)->header.next) | |
1620 | { | |
1621 | switch ((*where)->header.type) | |
1622 | { | |
1623 | case lang_assignment_statement_enum: | |
1624 | if (assign == NULL) | |
1625 | { | |
1626 | lang_assignment_statement_type *ass; | |
1627 | ass = &(*where)->assignment_statement; | |
1628 | if (ass->exp->type.node_class != etree_assert | |
1629 | && ass->exp->assign.dst[0] == '.' | |
be529132 AM |
1630 | && ass->exp->assign.dst[1] == 0 |
1631 | && !ignore_first) | |
afd7a018 AM |
1632 | assign = where; |
1633 | } | |
be529132 | 1634 | ignore_first = FALSE; |
afd7a018 AM |
1635 | continue; |
1636 | case lang_wild_statement_enum: | |
1637 | case lang_input_section_enum: | |
1638 | case lang_object_symbols_statement_enum: | |
1639 | case lang_fill_statement_enum: | |
1640 | case lang_data_statement_enum: | |
1641 | case lang_reloc_statement_enum: | |
1642 | case lang_padding_statement_enum: | |
1643 | case lang_constructors_statement_enum: | |
1644 | assign = NULL; | |
1645 | continue; | |
1646 | case lang_output_section_statement_enum: | |
1647 | if (assign != NULL) | |
1648 | where = assign; | |
1649 | case lang_input_statement_enum: | |
1650 | case lang_address_statement_enum: | |
1651 | case lang_target_statement_enum: | |
1652 | case lang_output_statement_enum: | |
1653 | case lang_group_statement_enum: | |
1654 | case lang_afile_asection_pair_statement_enum: | |
1655 | break; | |
1656 | } | |
1657 | break; | |
1658 | } | |
1659 | ||
1660 | *add.tail = *where; | |
1661 | *where = add.head; | |
1662 | ||
1663 | place->os_tail = &after->next; | |
1664 | } | |
1665 | else | |
1666 | { | |
1667 | /* Put it after the last orphan statement we added. */ | |
1668 | *add.tail = *place->stmt; | |
1669 | *place->stmt = add.head; | |
1670 | } | |
1671 | ||
1672 | /* Fix the global list pointer if we happened to tack our | |
1673 | new list at the tail. */ | |
1674 | if (*old->tail == add.head) | |
1675 | old->tail = add.tail; | |
1676 | ||
1677 | /* Save the end of this list. */ | |
1678 | place->stmt = add.tail; | |
1679 | ||
1680 | /* Do the same for the list of output section statements. */ | |
1681 | newly_added_os = *os_tail; | |
1682 | *os_tail = NULL; | |
218868ba AM |
1683 | newly_added_os->prev = (lang_output_section_statement_type *) |
1684 | ((char *) place->os_tail | |
1685 | - offsetof (lang_output_section_statement_type, next)); | |
afd7a018 | 1686 | newly_added_os->next = *place->os_tail; |
218868ba AM |
1687 | if (newly_added_os->next != NULL) |
1688 | newly_added_os->next->prev = newly_added_os; | |
afd7a018 AM |
1689 | *place->os_tail = newly_added_os; |
1690 | place->os_tail = &newly_added_os->next; | |
1691 | ||
1692 | /* Fixing the global list pointer here is a little different. | |
1693 | We added to the list in lang_enter_output_section_statement, | |
1694 | trimmed off the new output_section_statment above when | |
1695 | assigning *os_tail = NULL, but possibly added it back in | |
1696 | the same place when assigning *place->os_tail. */ | |
1697 | if (*os_tail == NULL) | |
1698 | lang_output_section_statement.tail | |
1699 | = (lang_statement_union_type **) os_tail; | |
1700 | } | |
1701 | } | |
1702 | return os; | |
1703 | } | |
1704 | ||
252b5132 | 1705 | static void |
1579bae1 | 1706 | lang_map_flags (flagword flag) |
252b5132 RH |
1707 | { |
1708 | if (flag & SEC_ALLOC) | |
1709 | minfo ("a"); | |
1710 | ||
1711 | if (flag & SEC_CODE) | |
1712 | minfo ("x"); | |
1713 | ||
1714 | if (flag & SEC_READONLY) | |
1715 | minfo ("r"); | |
1716 | ||
1717 | if (flag & SEC_DATA) | |
1718 | minfo ("w"); | |
1719 | ||
1720 | if (flag & SEC_LOAD) | |
1721 | minfo ("l"); | |
1722 | } | |
1723 | ||
1724 | void | |
1579bae1 | 1725 | lang_map (void) |
252b5132 RH |
1726 | { |
1727 | lang_memory_region_type *m; | |
4d4920ec | 1728 | bfd_boolean dis_header_printed = FALSE; |
35835446 | 1729 | bfd *p; |
252b5132 | 1730 | |
4d4920ec EB |
1731 | LANG_FOR_EACH_INPUT_STATEMENT (file) |
1732 | { | |
1733 | asection *s; | |
1734 | ||
1735 | if ((file->the_bfd->flags & (BFD_LINKER_CREATED | DYNAMIC)) != 0 | |
1736 | || file->just_syms_flag) | |
1737 | continue; | |
1738 | ||
1739 | for (s = file->the_bfd->sections; s != NULL; s = s->next) | |
a14a5de3 AM |
1740 | if ((s->output_section == NULL |
1741 | || s->output_section->owner != output_bfd) | |
1742 | && (s->flags & (SEC_LINKER_CREATED | SEC_KEEP)) == 0) | |
4d4920ec EB |
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 | ||
c0f00686 | 1798 | if (! link_info.reduce_memory_overheads) |
35835446 JR |
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 | |
c0f00686 | 1877 | if (!link_info.reduce_memory_overheads) |
72223188 JJ |
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 | 1969 | if (!(abfd->flags & DYNAMIC)) |
c0f00686 | 1970 | bfd_section_already_linked (abfd, sec, &link_info); |
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 | ||
e9f53129 | 2390 | 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. */ | |
74541ad4 AM |
3374 | if (!os->section_relative_symbol) |
3375 | os->ignored = TRUE; | |
e9ee469a | 3376 | output_section->flags |= SEC_EXCLUDE; |
32124d5b AM |
3377 | bfd_section_list_remove (output_bfd, output_section); |
3378 | output_bfd->section_count--; | |
4bd5a393 AM |
3379 | } |
3380 | } | |
8423293d AM |
3381 | |
3382 | /* Stop future calls to lang_add_section from messing with map_head | |
3383 | and map_tail link_order fields. */ | |
3384 | stripped_excluded_sections = TRUE; | |
4bd5a393 AM |
3385 | } |
3386 | ||
252b5132 | 3387 | static void |
1579bae1 AM |
3388 | print_output_section_statement |
3389 | (lang_output_section_statement_type *output_section_statement) | |
252b5132 RH |
3390 | { |
3391 | asection *section = output_section_statement->bfd_section; | |
3392 | int len; | |
3393 | ||
3394 | if (output_section_statement != abs_output_section) | |
3395 | { | |
3396 | minfo ("\n%s", output_section_statement->name); | |
3397 | ||
3398 | if (section != NULL) | |
3399 | { | |
3400 | print_dot = section->vma; | |
3401 | ||
3402 | len = strlen (output_section_statement->name); | |
3403 | if (len >= SECTION_NAME_MAP_LENGTH - 1) | |
3404 | { | |
3405 | print_nl (); | |
3406 | len = 0; | |
3407 | } | |
3408 | while (len < SECTION_NAME_MAP_LENGTH) | |
3409 | { | |
3410 | print_space (); | |
3411 | ++len; | |
3412 | } | |
3413 | ||
eea6121a | 3414 | minfo ("0x%V %W", section->vma, section->size); |
252b5132 | 3415 | |
67f744f3 AM |
3416 | if (section->vma != section->lma) |
3417 | minfo (_(" load address 0x%V"), section->lma); | |
252b5132 RH |
3418 | } |
3419 | ||
3420 | print_nl (); | |
3421 | } | |
3422 | ||
3423 | print_statement_list (output_section_statement->children.head, | |
3424 | output_section_statement); | |
3425 | } | |
3426 | ||
3b83e13a NC |
3427 | /* Scan for the use of the destination in the right hand side |
3428 | of an expression. In such cases we will not compute the | |
3429 | correct expression, since the value of DST that is used on | |
3430 | the right hand side will be its final value, not its value | |
3431 | just before this expression is evaluated. */ | |
329c1c86 | 3432 | |
3b83e13a NC |
3433 | static bfd_boolean |
3434 | scan_for_self_assignment (const char * dst, etree_type * rhs) | |
3435 | { | |
3436 | if (rhs == NULL || dst == NULL) | |
3437 | return FALSE; | |
3438 | ||
3439 | switch (rhs->type.node_class) | |
3440 | { | |
3441 | case etree_binary: | |
3442 | return scan_for_self_assignment (dst, rhs->binary.lhs) | |
3443 | || scan_for_self_assignment (dst, rhs->binary.rhs); | |
3444 | ||
3445 | case etree_trinary: | |
3446 | return scan_for_self_assignment (dst, rhs->trinary.lhs) | |
3447 | || scan_for_self_assignment (dst, rhs->trinary.rhs); | |
3448 | ||
3449 | case etree_assign: | |
3450 | case etree_provided: | |
3451 | case etree_provide: | |
3452 | if (strcmp (dst, rhs->assign.dst) == 0) | |
3453 | return TRUE; | |
3454 | return scan_for_self_assignment (dst, rhs->assign.src); | |
3455 | ||
3456 | case etree_unary: | |
3457 | return scan_for_self_assignment (dst, rhs->unary.child); | |
3458 | ||
3459 | case etree_value: | |
3460 | if (rhs->value.str) | |
3461 | return strcmp (dst, rhs->value.str) == 0; | |
3462 | return FALSE; | |
3463 | ||
3464 | case etree_name: | |
3465 | if (rhs->name.name) | |
3466 | return strcmp (dst, rhs->name.name) == 0; | |
3467 | return FALSE; | |
3468 | ||
3469 | default: | |
3470 | break; | |
3471 | } | |
3472 | ||
3473 | return FALSE; | |
3474 | } | |
3475 | ||
3476 | ||
252b5132 | 3477 | static void |
1579bae1 AM |
3478 | print_assignment (lang_assignment_statement_type *assignment, |
3479 | lang_output_section_statement_type *output_section) | |
252b5132 | 3480 | { |
3b83e13a NC |
3481 | unsigned int i; |
3482 | bfd_boolean is_dot; | |
3483 | bfd_boolean computation_is_valid = TRUE; | |
afd7a018 | 3484 | etree_type *tree; |
252b5132 RH |
3485 | |
3486 | for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++) | |
3487 | print_space (); | |
3488 | ||
afd7a018 AM |
3489 | if (assignment->exp->type.node_class == etree_assert) |
3490 | { | |
3b83e13a | 3491 | is_dot = FALSE; |
afd7a018 | 3492 | tree = assignment->exp->assert_s.child; |
3b83e13a | 3493 | computation_is_valid = TRUE; |
afd7a018 AM |
3494 | } |
3495 | else | |
3496 | { | |
3497 | const char *dst = assignment->exp->assign.dst; | |
3b83e13a NC |
3498 | |
3499 | is_dot = (dst[0] == '.' && dst[1] == 0); | |
afd7a018 | 3500 | tree = assignment->exp->assign.src; |
3b83e13a | 3501 | computation_is_valid = is_dot || (scan_for_self_assignment (dst, tree) == FALSE); |
afd7a018 AM |
3502 | } |
3503 | ||
e9ee469a AM |
3504 | exp_fold_tree (tree, output_section->bfd_section, &print_dot); |
3505 | if (expld.result.valid_p) | |
7b17f854 | 3506 | { |
7b17f854 RS |
3507 | bfd_vma value; |
3508 | ||
3b83e13a NC |
3509 | if (computation_is_valid) |
3510 | { | |
e9ee469a | 3511 | value = expld.result.value; |
10dbd1f3 | 3512 | |
e9ee469a AM |
3513 | if (expld.result.section) |
3514 | value += expld.result.section->vma; | |
7b17f854 | 3515 | |
3b83e13a NC |
3516 | minfo ("0x%V", value); |
3517 | if (is_dot) | |
3518 | print_dot = value; | |
3519 | } | |
3520 | else | |
3521 | { | |
3522 | struct bfd_link_hash_entry *h; | |
3523 | ||
3524 | h = bfd_link_hash_lookup (link_info.hash, assignment->exp->assign.dst, | |
3525 | FALSE, FALSE, TRUE); | |
3526 | if (h) | |
3527 | { | |
10dbd1f3 NC |
3528 | value = h->u.def.value; |
3529 | ||
e9ee469a AM |
3530 | if (expld.result.section) |
3531 | value += expld.result.section->vma; | |
3b83e13a NC |
3532 | |
3533 | minfo ("[0x%V]", value); | |
3534 | } | |
3535 | else | |
3536 | minfo ("[unresolved]"); | |
3537 | } | |
7b17f854 | 3538 | } |
252b5132 RH |
3539 | else |
3540 | { | |
3541 | minfo ("*undef* "); | |
3542 | #ifdef BFD64 | |
3543 | minfo (" "); | |
3544 | #endif | |
3545 | } | |
3546 | ||
3547 | minfo (" "); | |
252b5132 | 3548 | exp_print_tree (assignment->exp); |
252b5132 RH |
3549 | print_nl (); |
3550 | } | |
3551 | ||
3552 | static void | |
1579bae1 | 3553 | print_input_statement (lang_input_statement_type *statm) |
252b5132 | 3554 | { |
1579bae1 | 3555 | if (statm->filename != NULL) |
252b5132 RH |
3556 | { |
3557 | fprintf (config.map_file, "LOAD %s\n", statm->filename); | |
3558 | } | |
3559 | } | |
3560 | ||
3561 | /* Print all symbols defined in a particular section. This is called | |
35835446 | 3562 | via bfd_link_hash_traverse, or by print_all_symbols. */ |
252b5132 | 3563 | |
b34976b6 | 3564 | static bfd_boolean |
1579bae1 | 3565 | print_one_symbol (struct bfd_link_hash_entry *hash_entry, void *ptr) |
252b5132 | 3566 | { |
1579bae1 | 3567 | asection *sec = ptr; |
252b5132 RH |
3568 | |
3569 | if ((hash_entry->type == bfd_link_hash_defined | |
3570 | || hash_entry->type == bfd_link_hash_defweak) | |
3571 | && sec == hash_entry->u.def.section) | |
3572 | { | |
3573 | int i; | |
3574 | ||
3575 | for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++) | |
3576 | print_space (); | |
3577 | minfo ("0x%V ", | |
3578 | (hash_entry->u.def.value | |
3579 | + hash_entry->u.def.section->output_offset | |
3580 | + hash_entry->u.def.section->output_section->vma)); | |
3581 | ||
3582 | minfo (" %T\n", hash_entry->root.string); | |
3583 | } | |
3584 | ||
b34976b6 | 3585 | return TRUE; |
252b5132 RH |
3586 | } |
3587 | ||
35835446 | 3588 | static void |
e0f6802f | 3589 | print_all_symbols (asection *sec) |
35835446 JR |
3590 | { |
3591 | struct fat_user_section_struct *ud = get_userdata (sec); | |
3592 | struct map_symbol_def *def; | |
3593 | ||
afd7a018 AM |
3594 | if (!ud) |
3595 | return; | |
3596 | ||
35835446 JR |
3597 | *ud->map_symbol_def_tail = 0; |
3598 | for (def = ud->map_symbol_def_head; def; def = def->next) | |
3599 | print_one_symbol (def->entry, sec); | |
3600 | } | |
3601 | ||
252b5132 RH |
3602 | /* Print information about an input section to the map file. */ |
3603 | ||
3604 | static void | |
4d4920ec | 3605 | print_input_section (asection *i) |
252b5132 | 3606 | { |
eea6121a | 3607 | bfd_size_type size = i->size; |
abe6ac95 AM |
3608 | int len; |
3609 | bfd_vma addr; | |
e5caa5e0 AM |
3610 | |
3611 | init_opb (); | |
4d4920ec | 3612 | |
abe6ac95 AM |
3613 | print_space (); |
3614 | minfo ("%s", i->name); | |
252b5132 | 3615 | |
abe6ac95 AM |
3616 | len = 1 + strlen (i->name); |
3617 | if (len >= SECTION_NAME_MAP_LENGTH - 1) | |
3618 | { | |
3619 | print_nl (); | |
3620 | len = 0; | |
3621 | } | |
3622 | while (len < SECTION_NAME_MAP_LENGTH) | |
3623 | { | |
57ceae94 | 3624 | print_space (); |
abe6ac95 AM |
3625 | ++len; |
3626 | } | |
252b5132 | 3627 | |
abe6ac95 AM |
3628 | if (i->output_section != NULL && i->output_section->owner == output_bfd) |
3629 | addr = i->output_section->vma + i->output_offset; | |
3630 | else | |
3631 | { | |
3632 | addr = print_dot; | |
3633 | size = 0; | |
3634 | } | |
252b5132 | 3635 | |
abe6ac95 | 3636 | minfo ("0x%V %W %B\n", addr, TO_ADDR (size), i->owner); |
252b5132 | 3637 | |
abe6ac95 AM |
3638 | if (size != i->rawsize && i->rawsize != 0) |
3639 | { | |
3640 | len = SECTION_NAME_MAP_LENGTH + 3; | |
252b5132 | 3641 | #ifdef BFD64 |
abe6ac95 | 3642 | len += 16; |
252b5132 | 3643 | #else |
abe6ac95 | 3644 | len += 8; |
252b5132 | 3645 | #endif |
abe6ac95 AM |
3646 | while (len > 0) |
3647 | { | |
3648 | print_space (); | |
3649 | --len; | |
57ceae94 AM |
3650 | } |
3651 | ||
abe6ac95 AM |
3652 | minfo (_("%W (size before relaxing)\n"), i->rawsize); |
3653 | } | |
252b5132 | 3654 | |
abe6ac95 AM |
3655 | if (i->output_section != NULL && i->output_section->owner == output_bfd) |
3656 | { | |
c0f00686 | 3657 | if (link_info.reduce_memory_overheads) |
abe6ac95 AM |
3658 | bfd_link_hash_traverse (link_info.hash, print_one_symbol, i); |
3659 | else | |
3660 | print_all_symbols (i); | |
3661 | ||
3662 | print_dot = addr + TO_ADDR (size); | |
252b5132 RH |
3663 | } |
3664 | } | |
3665 | ||
3666 | static void | |
1579bae1 | 3667 | print_fill_statement (lang_fill_statement_type *fill) |
252b5132 | 3668 | { |
2c382fb6 AM |
3669 | size_t size; |
3670 | unsigned char *p; | |
3671 | fputs (" FILL mask 0x", config.map_file); | |
3672 | for (p = fill->fill->data, size = fill->fill->size; size != 0; p++, size--) | |
3673 | fprintf (config.map_file, "%02x", *p); | |
3674 | fputs ("\n", config.map_file); | |
252b5132 RH |
3675 | } |
3676 | ||
3677 | static void | |
1579bae1 | 3678 | print_data_statement (lang_data_statement_type *data) |
252b5132 RH |
3679 | { |
3680 | int i; | |
3681 | bfd_vma addr; | |
3682 | bfd_size_type size; | |
3683 | const char *name; | |
3684 | ||
e5caa5e0 | 3685 | init_opb (); |
252b5132 RH |
3686 | for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++) |
3687 | print_space (); | |
3688 | ||
7fabd029 | 3689 | addr = data->output_offset; |
252b5132 RH |
3690 | if (data->output_section != NULL) |
3691 | addr += data->output_section->vma; | |
3692 | ||
3693 | switch (data->type) | |
3694 | { | |
3695 | default: | |
3696 | abort (); | |
3697 | case BYTE: | |
3698 | size = BYTE_SIZE; | |
3699 | name = "BYTE"; | |
3700 | break; | |
3701 | case SHORT: | |
3702 | size = SHORT_SIZE; | |
3703 | name = "SHORT"; | |
3704 | break; | |
3705 | case LONG: | |
3706 | size = LONG_SIZE; | |
3707 | name = "LONG"; | |
3708 | break; | |
3709 | case QUAD: | |
3710 | size = QUAD_SIZE; | |
3711 | name = "QUAD"; | |
3712 | break; | |
3713 | case SQUAD: | |
3714 | size = QUAD_SIZE; | |
3715 | name = "SQUAD"; | |
3716 | break; | |
3717 | } | |
3718 | ||
3719 | minfo ("0x%V %W %s 0x%v", addr, size, name, data->value); | |
3720 | ||
3721 | if (data->exp->type.node_class != etree_value) | |
3722 | { | |
3723 | print_space (); | |
3724 | exp_print_tree (data->exp); | |
3725 | } | |
3726 | ||
3727 | print_nl (); | |
3728 | ||
e5caa5e0 | 3729 | print_dot = addr + TO_ADDR (size); |
252b5132 RH |
3730 | } |
3731 | ||
3732 | /* Print an address statement. These are generated by options like | |
3733 | -Ttext. */ | |
3734 | ||
3735 | static void | |
1579bae1 | 3736 | print_address_statement (lang_address_statement_type *address) |
252b5132 RH |
3737 | { |
3738 | minfo (_("Address of section %s set to "), address->section_name); | |
3739 | exp_print_tree (address->address); | |
3740 | print_nl (); | |
3741 | } | |
3742 | ||
3743 | /* Print a reloc statement. */ | |
3744 | ||
3745 | static void | |
1579bae1 | 3746 | print_reloc_statement (lang_reloc_statement_type *reloc) |
252b5132 RH |
3747 | { |
3748 | int i; | |
3749 | bfd_vma addr; | |
3750 | bfd_size_type size; | |
3751 | ||
e5caa5e0 | 3752 | init_opb (); |
252b5132 RH |
3753 | for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++) |
3754 | print_space (); | |
3755 | ||
7fabd029 | 3756 | addr = reloc->output_offset; |
252b5132 RH |
3757 | if (reloc->output_section != NULL) |
3758 | addr += reloc->output_section->vma; | |
3759 | ||
3760 | size = bfd_get_reloc_size (reloc->howto); | |
3761 | ||
3762 | minfo ("0x%V %W RELOC %s ", addr, size, reloc->howto->name); | |
3763 | ||
3764 | if (reloc->name != NULL) | |
3765 | minfo ("%s+", reloc->name); | |
3766 | else | |
3767 | minfo ("%s+", reloc->section->name); | |
3768 | ||
3769 | exp_print_tree (reloc->addend_exp); | |
3770 | ||
3771 | print_nl (); | |
3772 | ||
e5caa5e0 | 3773 | print_dot = addr + TO_ADDR (size); |
5f992e62 | 3774 | } |
252b5132 RH |
3775 | |
3776 | static void | |
1579bae1 | 3777 | print_padding_statement (lang_padding_statement_type *s) |
252b5132 RH |
3778 | { |
3779 | int len; | |
3780 | bfd_vma addr; | |
3781 | ||
e5caa5e0 | 3782 | init_opb (); |
252b5132 RH |
3783 | minfo (" *fill*"); |
3784 | ||
3785 | len = sizeof " *fill*" - 1; | |
3786 | while (len < SECTION_NAME_MAP_LENGTH) | |
3787 | { | |
3788 | print_space (); | |
3789 | ++len; | |
3790 | } | |
3791 | ||
3792 | addr = s->output_offset; | |
3793 | if (s->output_section != NULL) | |
3794 | addr += s->output_section->vma; | |
5f9b8920 | 3795 | minfo ("0x%V %W ", addr, (bfd_vma) s->size); |
252b5132 | 3796 | |
2c382fb6 AM |
3797 | if (s->fill->size != 0) |
3798 | { | |
3799 | size_t size; | |
3800 | unsigned char *p; | |
3801 | for (p = s->fill->data, size = s->fill->size; size != 0; p++, size--) | |
3802 | fprintf (config.map_file, "%02x", *p); | |
3803 | } | |
252b5132 RH |
3804 | |
3805 | print_nl (); | |
3806 | ||
e5caa5e0 | 3807 | print_dot = addr + TO_ADDR (s->size); |
252b5132 RH |
3808 | } |
3809 | ||
3810 | static void | |
1579bae1 AM |
3811 | print_wild_statement (lang_wild_statement_type *w, |
3812 | lang_output_section_statement_type *os) | |
252b5132 | 3813 | { |
b6bf44ba AM |
3814 | struct wildcard_list *sec; |
3815 | ||
252b5132 RH |
3816 | print_space (); |
3817 | ||
3818 | if (w->filenames_sorted) | |
3819 | minfo ("SORT("); | |
08da4cac | 3820 | if (w->filename != NULL) |
252b5132 RH |
3821 | minfo ("%s", w->filename); |
3822 | else | |
3823 | minfo ("*"); | |
3824 | if (w->filenames_sorted) | |
3825 | minfo (")"); | |
3826 | ||
3827 | minfo ("("); | |
b6bf44ba AM |
3828 | for (sec = w->section_list; sec; sec = sec->next) |
3829 | { | |
3830 | if (sec->spec.sorted) | |
3831 | minfo ("SORT("); | |
3832 | if (sec->spec.exclude_name_list != NULL) | |
3833 | { | |
3834 | name_list *tmp; | |
34786259 | 3835 | minfo ("EXCLUDE_FILE(%s", sec->spec.exclude_name_list->name); |
b6bf44ba | 3836 | for (tmp = sec->spec.exclude_name_list->next; tmp; tmp = tmp->next) |
34786259 AM |
3837 | minfo (" %s", tmp->name); |
3838 | minfo (") "); | |
b6bf44ba AM |
3839 | } |
3840 | if (sec->spec.name != NULL) | |
3841 | minfo ("%s", sec->spec.name); | |
3842 | else | |
3843 | minfo ("*"); | |
3844 | if (sec->spec.sorted) | |
3845 | minfo (")"); | |
34786259 AM |
3846 | if (sec->next) |
3847 | minfo (" "); | |
b6bf44ba | 3848 | } |
252b5132 RH |
3849 | minfo (")"); |
3850 | ||
3851 | print_nl (); | |
3852 | ||
3853 | print_statement_list (w->children.head, os); | |
3854 | } | |
3855 | ||
3856 | /* Print a group statement. */ | |
3857 | ||
3858 | static void | |
1579bae1 AM |
3859 | print_group (lang_group_statement_type *s, |
3860 | lang_output_section_statement_type *os) | |
252b5132 RH |
3861 | { |
3862 | fprintf (config.map_file, "START GROUP\n"); | |
3863 | print_statement_list (s->children.head, os); | |
3864 | fprintf (config.map_file, "END GROUP\n"); | |
3865 | } | |
3866 | ||
3867 | /* Print the list of statements in S. | |
3868 | This can be called for any statement type. */ | |
3869 | ||
3870 | static void | |
1579bae1 AM |
3871 | print_statement_list (lang_statement_union_type *s, |
3872 | lang_output_section_statement_type *os) | |
252b5132 RH |
3873 | { |
3874 | while (s != NULL) | |
3875 | { | |
3876 | print_statement (s, os); | |
bba1a0c0 | 3877 | s = s->header.next; |
252b5132 RH |
3878 | } |
3879 | } | |
3880 | ||
3881 | /* Print the first statement in statement list S. | |
3882 | This can be called for any statement type. */ | |
3883 | ||
3884 | static void | |
1579bae1 AM |
3885 | print_statement (lang_statement_union_type *s, |
3886 | lang_output_section_statement_type *os) | |
252b5132 RH |
3887 | { |
3888 | switch (s->header.type) | |
3889 | { | |
3890 | default: | |
3891 | fprintf (config.map_file, _("Fail with %d\n"), s->header.type); | |
3892 | FAIL (); | |
3893 | break; | |
3894 | case lang_constructors_statement_enum: | |
3895 | if (constructor_list.head != NULL) | |
3896 | { | |
3897 | if (constructors_sorted) | |
3898 | minfo (" SORT (CONSTRUCTORS)\n"); | |
3899 | else | |
3900 | minfo (" CONSTRUCTORS\n"); | |
3901 | print_statement_list (constructor_list.head, os); | |
3902 | } | |
3903 | break; | |
3904 | case lang_wild_statement_enum: | |
3905 | print_wild_statement (&s->wild_statement, os); | |
3906 | break; | |
3907 | case lang_address_statement_enum: | |
3908 | print_address_statement (&s->address_statement); | |
3909 | break; | |
3910 | case lang_object_symbols_statement_enum: | |
3911 | minfo (" CREATE_OBJECT_SYMBOLS\n"); | |
3912 | break; | |
3913 | case lang_fill_statement_enum: | |
3914 | print_fill_statement (&s->fill_statement); | |
3915 | break; | |
3916 | case lang_data_statement_enum: | |
3917 | print_data_statement (&s->data_statement); | |
3918 | break; | |
3919 | case lang_reloc_statement_enum: | |
3920 | print_reloc_statement (&s->reloc_statement); | |
3921 | break; | |
3922 | case lang_input_section_enum: | |
4d4920ec | 3923 | print_input_section (s->input_section.section); |
252b5132 RH |
3924 | break; |
3925 | case lang_padding_statement_enum: | |
3926 | print_padding_statement (&s->padding_statement); | |
3927 | break; | |
3928 | case lang_output_section_statement_enum: | |
3929 | print_output_section_statement (&s->output_section_statement); | |
3930 | break; | |
3931 | case lang_assignment_statement_enum: | |
3932 | print_assignment (&s->assignment_statement, os); | |
3933 | break; | |
3934 | case lang_target_statement_enum: | |
3935 | fprintf (config.map_file, "TARGET(%s)\n", s->target_statement.target); | |
3936 | break; | |
3937 | case lang_output_statement_enum: | |
3938 | minfo ("OUTPUT(%s", s->output_statement.name); | |
3939 | if (output_target != NULL) | |
3940 | minfo (" %s", output_target); | |
3941 | minfo (")\n"); | |
3942 | break; | |
3943 | case lang_input_statement_enum: | |
3944 | print_input_statement (&s->input_statement); | |
3945 | break; | |
3946 | case lang_group_statement_enum: | |
3947 | print_group (&s->group_statement, os); | |
3948 | break; | |
3949 | case lang_afile_asection_pair_statement_enum: | |
3950 | FAIL (); | |
3951 | break; | |
3952 | } | |
3953 | } | |
3954 | ||
3955 | static void | |
1579bae1 | 3956 | print_statements (void) |
252b5132 RH |
3957 | { |
3958 | print_statement_list (statement_list.head, abs_output_section); | |
3959 | } | |
3960 | ||
3961 | /* Print the first N statements in statement list S to STDERR. | |
3962 | If N == 0, nothing is printed. | |
3963 | If N < 0, the entire list is printed. | |
3964 | Intended to be called from GDB. */ | |
3965 | ||
3966 | void | |
1579bae1 | 3967 | dprint_statement (lang_statement_union_type *s, int n) |
252b5132 RH |
3968 | { |
3969 | FILE *map_save = config.map_file; | |
3970 | ||
3971 | config.map_file = stderr; | |
3972 | ||
3973 | if (n < 0) | |
3974 | print_statement_list (s, abs_output_section); | |
3975 | else | |
3976 | { | |
3977 | while (s && --n >= 0) | |
3978 | { | |
3979 | print_statement (s, abs_output_section); | |
bba1a0c0 | 3980 | s = s->header.next; |
252b5132 RH |
3981 | } |
3982 | } | |
3983 | ||
3984 | config.map_file = map_save; | |
3985 | } | |
3986 | ||
b3327aad | 3987 | static void |
1579bae1 AM |
3988 | insert_pad (lang_statement_union_type **ptr, |
3989 | fill_type *fill, | |
3990 | unsigned int alignment_needed, | |
3991 | asection *output_section, | |
3992 | bfd_vma dot) | |
252b5132 | 3993 | { |
2c382fb6 | 3994 | static fill_type zero_fill = { 1, { 0 } }; |
e9ee469a | 3995 | lang_statement_union_type *pad = NULL; |
b3327aad | 3996 | |
e9ee469a AM |
3997 | if (ptr != &statement_list.head) |
3998 | pad = ((lang_statement_union_type *) | |
3999 | ((char *) ptr - offsetof (lang_statement_union_type, header.next))); | |
4000 | if (pad != NULL | |
4001 | && pad->header.type == lang_padding_statement_enum | |
4002 | && pad->padding_statement.output_section == output_section) | |
4003 | { | |
4004 | /* Use the existing pad statement. */ | |
4005 | } | |
4006 | else if ((pad = *ptr) != NULL | |
2af02257 | 4007 | && pad->header.type == lang_padding_statement_enum |
b3327aad | 4008 | && pad->padding_statement.output_section == output_section) |
252b5132 | 4009 | { |
e9ee469a | 4010 | /* Use the existing pad statement. */ |
252b5132 | 4011 | } |
b3327aad | 4012 | else |
252b5132 | 4013 | { |
b3327aad | 4014 | /* Make a new padding statement, linked into existing chain. */ |
1579bae1 | 4015 | pad = stat_alloc (sizeof (lang_padding_statement_type)); |
b3327aad AM |
4016 | pad->header.next = *ptr; |
4017 | *ptr = pad; | |
4018 | pad->header.type = lang_padding_statement_enum; | |
4019 | pad->padding_statement.output_section = output_section; | |
1579bae1 | 4020 | if (fill == NULL) |
2c382fb6 | 4021 | fill = &zero_fill; |
b3327aad | 4022 | pad->padding_statement.fill = fill; |
252b5132 | 4023 | } |
b3327aad AM |
4024 | pad->padding_statement.output_offset = dot - output_section->vma; |
4025 | pad->padding_statement.size = alignment_needed; | |
eea6121a | 4026 | output_section->size += alignment_needed; |
252b5132 RH |
4027 | } |
4028 | ||
08da4cac KH |
4029 | /* Work out how much this section will move the dot point. */ |
4030 | ||
252b5132 | 4031 | static bfd_vma |
6feb9908 AM |
4032 | size_input_section |
4033 | (lang_statement_union_type **this_ptr, | |
4034 | lang_output_section_statement_type *output_section_statement, | |
4035 | fill_type *fill, | |
4036 | bfd_vma dot) | |
252b5132 RH |
4037 | { |
4038 | lang_input_section_type *is = &((*this_ptr)->input_section); | |
4039 | asection *i = is->section; | |
4040 | ||
7b986e99 AM |
4041 | if (!((lang_input_statement_type *) i->owner->usrdata)->just_syms_flag |
4042 | && (i->flags & SEC_EXCLUDE) == 0) | |
252b5132 | 4043 | { |
b3327aad AM |
4044 | unsigned int alignment_needed; |
4045 | asection *o; | |
4046 | ||
4047 | /* Align this section first to the input sections requirement, | |
4048 | then to the output section's requirement. If this alignment | |
4049 | is greater than any seen before, then record it too. Perform | |
4050 | the alignment by inserting a magic 'padding' statement. */ | |
4051 | ||
252b5132 | 4052 | if (output_section_statement->subsection_alignment != -1) |
b3327aad AM |
4053 | i->alignment_power = output_section_statement->subsection_alignment; |
4054 | ||
4055 | o = output_section_statement->bfd_section; | |
4056 | if (o->alignment_power < i->alignment_power) | |
4057 | o->alignment_power = i->alignment_power; | |
252b5132 | 4058 | |
b3327aad AM |
4059 | alignment_needed = align_power (dot, i->alignment_power) - dot; |
4060 | ||
4061 | if (alignment_needed != 0) | |
4062 | { | |
e5caa5e0 | 4063 | insert_pad (this_ptr, fill, TO_SIZE (alignment_needed), o, dot); |
b3327aad AM |
4064 | dot += alignment_needed; |
4065 | } | |
252b5132 | 4066 | |
08da4cac | 4067 | /* Remember where in the output section this input section goes. */ |
252b5132 | 4068 | |
b3327aad | 4069 | i->output_offset = dot - o->vma; |
252b5132 | 4070 | |
08da4cac | 4071 | /* Mark how big the output section must be to contain this now. */ |
eea6121a AM |
4072 | dot += TO_ADDR (i->size); |
4073 | o->size = TO_SIZE (dot - o->vma); | |
252b5132 RH |
4074 | } |
4075 | else | |
4076 | { | |
4077 | i->output_offset = i->vma - output_section_statement->bfd_section->vma; | |
4078 | } | |
4079 | ||
4080 | return dot; | |
4081 | } | |
4082 | ||
5daa8fe7 L |
4083 | static int |
4084 | sort_sections_by_lma (const void *arg1, const void *arg2) | |
4085 | { | |
4086 | const asection *sec1 = *(const asection **) arg1; | |
4087 | const asection *sec2 = *(const asection **) arg2; | |
4088 | ||
4089 | if (bfd_section_lma (sec1->owner, sec1) | |
4090 | < bfd_section_lma (sec2->owner, sec2)) | |
4091 | return -1; | |
4092 | else if (bfd_section_lma (sec1->owner, sec1) | |
4093 | > bfd_section_lma (sec2->owner, sec2)) | |
4094 | return 1; | |
4095 | ||
4096 | return 0; | |
4097 | } | |
4098 | ||
eea6121a | 4099 | #define IGNORE_SECTION(s) \ |
afd7a018 AM |
4100 | ((s->flags & SEC_NEVER_LOAD) != 0 \ |
4101 | || (s->flags & SEC_ALLOC) == 0 \ | |
4102 | || ((s->flags & SEC_THREAD_LOCAL) != 0 \ | |
de7f8cc8 | 4103 | && (s->flags & SEC_LOAD) == 0)) |
d1778b88 | 4104 | |
252b5132 | 4105 | /* Check to see if any allocated sections overlap with other allocated |
afd7a018 AM |
4106 | sections. This can happen if a linker script specifies the output |
4107 | section addresses of the two sections. */ | |
08da4cac | 4108 | |
252b5132 | 4109 | static void |
1579bae1 | 4110 | lang_check_section_addresses (void) |
252b5132 | 4111 | { |
5daa8fe7 L |
4112 | asection *s, *os; |
4113 | asection **sections, **spp; | |
4114 | unsigned int count; | |
4115 | bfd_vma s_start; | |
4116 | bfd_vma s_end; | |
4117 | bfd_vma os_start; | |
4118 | bfd_vma os_end; | |
4119 | bfd_size_type amt; | |
4120 | ||
4121 | if (bfd_count_sections (output_bfd) <= 1) | |
4122 | return; | |
4123 | ||
4124 | amt = bfd_count_sections (output_bfd) * sizeof (asection *); | |
4125 | sections = xmalloc (amt); | |
252b5132 RH |
4126 | |
4127 | /* Scan all sections in the output list. */ | |
5daa8fe7 | 4128 | count = 0; |
252b5132 | 4129 | for (s = output_bfd->sections; s != NULL; s = s->next) |
33275c22 | 4130 | { |
5daa8fe7 | 4131 | /* Only consider loadable sections with real contents. */ |
de7f8cc8 | 4132 | if (IGNORE_SECTION (s) || s->size == 0) |
33275c22 | 4133 | continue; |
5f992e62 | 4134 | |
5daa8fe7 L |
4135 | sections[count] = s; |
4136 | count++; | |
4137 | } | |
329c1c86 | 4138 | |
5daa8fe7 L |
4139 | if (count <= 1) |
4140 | return; | |
5f992e62 | 4141 | |
5daa8fe7 L |
4142 | qsort (sections, (size_t) count, sizeof (asection *), |
4143 | sort_sections_by_lma); | |
5f992e62 | 4144 | |
5daa8fe7 L |
4145 | spp = sections; |
4146 | s = *spp++; | |
4147 | s_start = bfd_section_lma (output_bfd, s); | |
4148 | s_end = s_start + TO_ADDR (s->size) - 1; | |
4149 | for (count--; count; count--) | |
4150 | { | |
4151 | /* We must check the sections' LMA addresses not their VMA | |
4152 | addresses because overlay sections can have overlapping VMAs | |
4153 | but they must have distinct LMAs. */ | |
4154 | os = s; | |
329c1c86 | 4155 | os_start = s_start; |
5daa8fe7 L |
4156 | os_end = s_end; |
4157 | s = *spp++; | |
4158 | s_start = bfd_section_lma (output_bfd, s); | |
4159 | s_end = s_start + TO_ADDR (s->size) - 1; | |
5f992e62 | 4160 | |
5daa8fe7 L |
4161 | /* Look for an overlap. */ |
4162 | if (s_end >= os_start && s_start <= os_end) | |
4163 | einfo (_("%X%P: section %s [%V -> %V] overlaps section %s [%V -> %V]\n"), | |
4164 | s->name, s_start, s_end, os->name, os_start, os_end); | |
33275c22 | 4165 | } |
5daa8fe7 L |
4166 | |
4167 | free (sections); | |
252b5132 RH |
4168 | } |
4169 | ||
562d3460 TW |
4170 | /* Make sure the new address is within the region. We explicitly permit the |
4171 | current address to be at the exact end of the region when the address is | |
4172 | non-zero, in case the region is at the end of addressable memory and the | |
5f992e62 | 4173 | calculation wraps around. */ |
562d3460 TW |
4174 | |
4175 | static void | |
1579bae1 | 4176 | os_region_check (lang_output_section_statement_type *os, |
6bdafbeb | 4177 | lang_memory_region_type *region, |
1579bae1 AM |
4178 | etree_type *tree, |
4179 | bfd_vma base) | |
562d3460 TW |
4180 | { |
4181 | if ((region->current < region->origin | |
4182 | || (region->current - region->origin > region->length)) | |
4183 | && ((region->current != region->origin + region->length) | |
b7a26f91 | 4184 | || base == 0)) |
562d3460 | 4185 | { |
1579bae1 | 4186 | if (tree != NULL) |
b7a26f91 | 4187 | { |
6feb9908 AM |
4188 | einfo (_("%X%P: address 0x%v of %B section %s" |
4189 | " is not within region %s\n"), | |
b7a26f91 KH |
4190 | region->current, |
4191 | os->bfd_section->owner, | |
4192 | os->bfd_section->name, | |
4193 | region->name); | |
4194 | } | |
562d3460 | 4195 | else |
b7a26f91 KH |
4196 | { |
4197 | einfo (_("%X%P: region %s is full (%B section %s)\n"), | |
4198 | region->name, | |
4199 | os->bfd_section->owner, | |
4200 | os->bfd_section->name); | |
4201 | } | |
562d3460 TW |
4202 | /* Reset the region pointer. */ |
4203 | region->current = region->origin; | |
4204 | } | |
4205 | } | |
4206 | ||
252b5132 RH |
4207 | /* Set the sizes for all the output sections. */ |
4208 | ||
2d20f7bf | 4209 | static bfd_vma |
1579bae1 AM |
4210 | lang_size_sections_1 |
4211 | (lang_statement_union_type *s, | |
4212 | lang_output_section_statement_type *output_section_statement, | |
4213 | lang_statement_union_type **prev, | |
4214 | fill_type *fill, | |
4215 | bfd_vma dot, | |
4216 | bfd_boolean *relax, | |
4217 | bfd_boolean check_regions) | |
252b5132 RH |
4218 | { |
4219 | /* Size up the sections from their constituent parts. */ | |
1579bae1 | 4220 | for (; s != NULL; s = s->header.next) |
252b5132 RH |
4221 | { |
4222 | switch (s->header.type) | |
4223 | { | |
4224 | case lang_output_section_statement_enum: | |
4225 | { | |
e9ee469a | 4226 | bfd_vma newdot, after; |
d1778b88 | 4227 | lang_output_section_statement_type *os; |
cde9e0be | 4228 | lang_memory_region_type *r; |
252b5132 | 4229 | |
d1778b88 | 4230 | os = &s->output_section_statement; |
a5df8c84 AM |
4231 | if (os->addr_tree != NULL) |
4232 | { | |
cde9e0be | 4233 | os->processed_vma = FALSE; |
a5df8c84 | 4234 | exp_fold_tree (os->addr_tree, bfd_abs_section_ptr, &dot); |
a5df8c84 AM |
4235 | |
4236 | if (!expld.result.valid_p | |
4237 | && expld.phase != lang_mark_phase_enum) | |
4238 | einfo (_("%F%S: non constant or forward reference" | |
4239 | " address expression for section %s\n"), | |
4240 | os->name); | |
4241 | ||
4242 | dot = expld.result.value + expld.result.section->vma; | |
4243 | } | |
4244 | ||
e9ee469a | 4245 | if (os->bfd_section == NULL) |
75ff4589 | 4246 | /* This section was removed or never actually created. */ |
252b5132 RH |
4247 | break; |
4248 | ||
4249 | /* If this is a COFF shared library section, use the size and | |
4250 | address from the input section. FIXME: This is COFF | |
4251 | specific; it would be cleaner if there were some other way | |
4252 | to do this, but nothing simple comes to mind. */ | |
ebe372c1 L |
4253 | if ((bfd_get_flavour (output_bfd) == bfd_target_ecoff_flavour |
4254 | || bfd_get_flavour (output_bfd) == bfd_target_coff_flavour) | |
4255 | && (os->bfd_section->flags & SEC_COFF_SHARED_LIBRARY) != 0) | |
252b5132 | 4256 | { |
08da4cac | 4257 | asection *input; |
252b5132 RH |
4258 | |
4259 | if (os->children.head == NULL | |
bba1a0c0 | 4260 | || os->children.head->header.next != NULL |
6feb9908 AM |
4261 | || (os->children.head->header.type |
4262 | != lang_input_section_enum)) | |
4263 | einfo (_("%P%X: Internal error on COFF shared library" | |
4264 | " section %s\n"), os->name); | |
252b5132 RH |
4265 | |
4266 | input = os->children.head->input_section.section; | |
4267 | bfd_set_section_vma (os->bfd_section->owner, | |
4268 | os->bfd_section, | |
4269 | bfd_section_vma (input->owner, input)); | |
eea6121a | 4270 | os->bfd_section->size = input->size; |
252b5132 RH |
4271 | break; |
4272 | } | |
4273 | ||
a5df8c84 | 4274 | newdot = dot; |
252b5132 RH |
4275 | if (bfd_is_abs_section (os->bfd_section)) |
4276 | { | |
4277 | /* No matter what happens, an abs section starts at zero. */ | |
4278 | ASSERT (os->bfd_section->vma == 0); | |
4279 | } | |
4280 | else | |
4281 | { | |
94b50910 | 4282 | int align; |
7270c5ed | 4283 | |
1579bae1 | 4284 | if (os->addr_tree == NULL) |
252b5132 RH |
4285 | { |
4286 | /* No address specified for this section, get one | |
4287 | from the region specification. */ | |
1579bae1 | 4288 | if (os->region == NULL |
6feb9908 | 4289 | || ((os->bfd_section->flags & (SEC_ALLOC | SEC_LOAD)) |
252b5132 | 4290 | && os->region->name[0] == '*' |
6feb9908 AM |
4291 | && strcmp (os->region->name, |
4292 | DEFAULT_MEMORY_REGION) == 0)) | |
252b5132 RH |
4293 | { |
4294 | os->region = lang_memory_default (os->bfd_section); | |
4295 | } | |
4296 | ||
4297 | /* If a loadable section is using the default memory | |
4298 | region, and some non default memory regions were | |
66184979 | 4299 | defined, issue an error message. */ |
f0636a44 AM |
4300 | if (!os->ignored |
4301 | && !IGNORE_SECTION (os->bfd_section) | |
1049f94e | 4302 | && ! link_info.relocatable |
cf888e70 | 4303 | && check_regions |
6feb9908 AM |
4304 | && strcmp (os->region->name, |
4305 | DEFAULT_MEMORY_REGION) == 0 | |
252b5132 | 4306 | && lang_memory_region_list != NULL |
d1778b88 | 4307 | && (strcmp (lang_memory_region_list->name, |
a747ee4d | 4308 | DEFAULT_MEMORY_REGION) != 0 |
e9ee469a AM |
4309 | || lang_memory_region_list->next != NULL) |
4310 | && expld.phase != lang_mark_phase_enum) | |
66184979 NC |
4311 | { |
4312 | /* By default this is an error rather than just a | |
4313 | warning because if we allocate the section to the | |
4314 | default memory region we can end up creating an | |
07f3b6ad KH |
4315 | excessively large binary, or even seg faulting when |
4316 | attempting to perform a negative seek. See | |
6feb9908 | 4317 | sources.redhat.com/ml/binutils/2003-04/msg00423.html |
66184979 NC |
4318 | for an example of this. This behaviour can be |
4319 | overridden by the using the --no-check-sections | |
4320 | switch. */ | |
4321 | if (command_line.check_section_addresses) | |
6feb9908 AM |
4322 | einfo (_("%P%F: error: no memory region specified" |
4323 | " for loadable section `%s'\n"), | |
66184979 NC |
4324 | bfd_get_section_name (output_bfd, |
4325 | os->bfd_section)); | |
4326 | else | |
6feb9908 AM |
4327 | einfo (_("%P: warning: no memory region specified" |
4328 | " for loadable section `%s'\n"), | |
66184979 NC |
4329 | bfd_get_section_name (output_bfd, |
4330 | os->bfd_section)); | |
4331 | } | |
252b5132 | 4332 | |
e9ee469a | 4333 | newdot = os->region->current; |
94b50910 | 4334 | align = os->bfd_section->alignment_power; |
252b5132 | 4335 | } |
94b50910 AM |
4336 | else |
4337 | align = os->section_alignment; | |
5f992e62 | 4338 | |
7270c5ed | 4339 | /* Align to what the section needs. */ |
94b50910 AM |
4340 | if (align > 0) |
4341 | { | |
4342 | bfd_vma savedot = newdot; | |
4343 | newdot = align_power (newdot, align); | |
252b5132 | 4344 | |
94b50910 AM |
4345 | if (newdot != savedot |
4346 | && (config.warn_section_align | |
4347 | || os->addr_tree != NULL) | |
4348 | && expld.phase != lang_mark_phase_enum) | |
4349 | einfo (_("%P: warning: changing start of section" | |
4350 | " %s by %lu bytes\n"), | |
4351 | os->name, (unsigned long) (newdot - savedot)); | |
4352 | } | |
252b5132 | 4353 | |
e9ee469a | 4354 | bfd_set_section_vma (0, os->bfd_section, newdot); |
5f992e62 | 4355 | |
252b5132 RH |
4356 | os->bfd_section->output_offset = 0; |
4357 | } | |
4358 | ||
2d20f7bf | 4359 | lang_size_sections_1 (os->children.head, os, &os->children.head, |
e9ee469a AM |
4360 | os->fill, newdot, relax, check_regions); |
4361 | ||
cde9e0be | 4362 | os->processed_vma = TRUE; |
e9ee469a AM |
4363 | |
4364 | if (bfd_is_abs_section (os->bfd_section) || os->ignored) | |
2f475487 AM |
4365 | /* Except for some special linker created sections, |
4366 | no output section should change from zero size | |
4367 | after strip_excluded_output_sections. A non-zero | |
4368 | size on an ignored section indicates that some | |
4369 | input section was not sized early enough. */ | |
4370 | ASSERT (os->bfd_section->size == 0); | |
cde9e0be | 4371 | else |
e9ee469a | 4372 | { |
cde9e0be AM |
4373 | dot = os->bfd_section->vma; |
4374 | ||
4375 | /* Put the section within the requested block size, or | |
4376 | align at the block boundary. */ | |
4377 | after = ((dot | |
4378 | + TO_ADDR (os->bfd_section->size) | |
4379 | + os->block_value - 1) | |
4380 | & - (bfd_vma) os->block_value); | |
4381 | ||
4382 | os->bfd_section->size = TO_SIZE (after - os->bfd_section->vma); | |
4383 | } | |
4384 | ||
4385 | /* Set section lma. */ | |
4386 | r = os->region; | |
4387 | if (r == NULL) | |
4388 | r = lang_memory_region_lookup (DEFAULT_MEMORY_REGION, FALSE); | |
4389 | ||
4390 | if (os->load_base) | |
4391 | { | |
4392 | bfd_vma lma = exp_get_abs_int (os->load_base, 0, "load base"); | |
4393 | os->bfd_section->lma = lma; | |
e9ee469a | 4394 | } |
cde9e0be AM |
4395 | else if (os->region != NULL |
4396 | && os->lma_region != NULL | |
4397 | && os->lma_region != os->region) | |
4398 | { | |
4399 | bfd_vma lma = os->lma_region->current; | |
e9ee469a | 4400 | |
cde9e0be AM |
4401 | if (os->section_alignment != -1) |
4402 | lma = align_power (lma, os->section_alignment); | |
4403 | os->bfd_section->lma = lma; | |
4404 | } | |
dc0b6aa0 AM |
4405 | else if (r->last_os != NULL |
4406 | && (os->bfd_section->flags & SEC_ALLOC) != 0) | |
cde9e0be AM |
4407 | { |
4408 | bfd_vma lma; | |
4409 | asection *last; | |
4410 | ||
4411 | last = r->last_os->output_section_statement.bfd_section; | |
dc0b6aa0 AM |
4412 | |
4413 | /* A backwards move of dot should be accompanied by | |
4414 | an explicit assignment to the section LMA (ie. | |
91eb6c46 | 4415 | os->load_base set) because backwards moves can |
dc0b6aa0 | 4416 | create overlapping LMAs. */ |
264b6205 | 4417 | if (dot < last->vma |
91eb6c46 AM |
4418 | && os->bfd_section->size != 0 |
4419 | && dot + os->bfd_section->size <= last->vma) | |
dc0b6aa0 | 4420 | { |
dc0b6aa0 AM |
4421 | /* If dot moved backwards then leave lma equal to |
4422 | vma. This is the old default lma, which might | |
4423 | just happen to work when the backwards move is | |
91eb6c46 AM |
4424 | sufficiently large. Nag if this changes anything, |
4425 | so people can fix their linker scripts. */ | |
4426 | ||
4427 | if (last->vma != last->lma) | |
4428 | einfo (_("%P: warning: dot moved backwards before `%s'\n"), | |
4429 | os->name); | |
dc0b6aa0 AM |
4430 | } |
4431 | else | |
cde9e0be AM |
4432 | { |
4433 | /* If the current vma overlaps the previous section, | |
4434 | then set the current lma to that at the end of | |
4435 | the previous section. The previous section was | |
4436 | probably an overlay. */ | |
4437 | if ((dot >= last->vma | |
4438 | && dot < last->vma + last->size) | |
4439 | || (last->vma >= dot | |
4440 | && last->vma < dot + os->bfd_section->size)) | |
4441 | lma = last->lma + last->size; | |
4442 | ||
4443 | /* Otherwise, keep the same lma to vma relationship | |
4444 | as the previous section. */ | |
4445 | else | |
4446 | lma = dot + last->lma - last->vma; | |
4447 | ||
4448 | if (os->section_alignment != -1) | |
4449 | lma = align_power (lma, os->section_alignment); | |
4450 | os->bfd_section->lma = lma; | |
4451 | } | |
4452 | } | |
4453 | os->processed_lma = TRUE; | |
5f992e62 | 4454 | |
cde9e0be AM |
4455 | if (bfd_is_abs_section (os->bfd_section) || os->ignored) |
4456 | break; | |
252b5132 | 4457 | |
cde9e0be AM |
4458 | /* Keep track of normal sections using the default |
4459 | lma region. We use this to set the lma for | |
4460 | following sections. Overlays or other linker | |
4461 | script assignment to lma might mean that the | |
dc0b6aa0 AM |
4462 | default lma == vma is incorrect. |
4463 | To avoid warnings about dot moving backwards when using | |
4464 | -Ttext, don't start tracking sections until we find one | |
4465 | of non-zero size or with lma set differently to vma. */ | |
cde9e0be AM |
4466 | if (((os->bfd_section->flags & SEC_HAS_CONTENTS) != 0 |
4467 | || (os->bfd_section->flags & SEC_THREAD_LOCAL) == 0) | |
dc0b6aa0 AM |
4468 | && (os->bfd_section->flags & SEC_ALLOC) != 0 |
4469 | && (os->bfd_section->size != 0 | |
264b6205 AM |
4470 | || (r->last_os == NULL |
4471 | && os->bfd_section->vma != os->bfd_section->lma) | |
4472 | || (r->last_os != NULL | |
4473 | && dot >= (r->last_os->output_section_statement | |
ea0c3cd5 | 4474 | .bfd_section->vma))) |
cde9e0be AM |
4475 | && os->lma_region == NULL |
4476 | && !link_info.relocatable) | |
4477 | r->last_os = s; | |
9f88b410 | 4478 | |
e5caec89 NS |
4479 | /* .tbss sections effectively have zero size. */ |
4480 | if ((os->bfd_section->flags & SEC_HAS_CONTENTS) != 0 | |
4481 | || (os->bfd_section->flags & SEC_THREAD_LOCAL) == 0 | |
4482 | || link_info.relocatable) | |
eea6121a | 4483 | dot += TO_ADDR (os->bfd_section->size); |
e5caec89 | 4484 | |
9f88b410 | 4485 | if (os->update_dot_tree != 0) |
e9ee469a | 4486 | exp_fold_tree (os->update_dot_tree, bfd_abs_section_ptr, &dot); |
9f88b410 | 4487 | |
252b5132 RH |
4488 | /* Update dot in the region ? |
4489 | We only do this if the section is going to be allocated, | |
4490 | since unallocated sections do not contribute to the region's | |
13392b77 | 4491 | overall size in memory. |
5f992e62 | 4492 | |
cce4c4c5 NC |
4493 | If the SEC_NEVER_LOAD bit is not set, it will affect the |
4494 | addresses of sections after it. We have to update | |
4495 | dot. */ | |
1579bae1 | 4496 | if (os->region != NULL |
6feb9908 AM |
4497 | && ((os->bfd_section->flags & SEC_NEVER_LOAD) == 0 |
4498 | || (os->bfd_section->flags & (SEC_ALLOC | SEC_LOAD)))) | |
252b5132 RH |
4499 | { |
4500 | os->region->current = dot; | |
5f992e62 | 4501 | |
cf888e70 NC |
4502 | if (check_regions) |
4503 | /* Make sure the new address is within the region. */ | |
4504 | os_region_check (os, os->region, os->addr_tree, | |
4505 | os->bfd_section->vma); | |
08da4cac | 4506 | |
ee3cc2e2 | 4507 | if (os->lma_region != NULL && os->lma_region != os->region) |
08da4cac | 4508 | { |
cde9e0be AM |
4509 | os->lma_region->current |
4510 | = os->bfd_section->lma + TO_ADDR (os->bfd_section->size); | |
66e28d60 | 4511 | |
cf888e70 NC |
4512 | if (check_regions) |
4513 | os_region_check (os, os->lma_region, NULL, | |
cde9e0be | 4514 | os->bfd_section->lma); |
08da4cac | 4515 | } |
252b5132 RH |
4516 | } |
4517 | } | |
4518 | break; | |
4519 | ||
4520 | case lang_constructors_statement_enum: | |
2d20f7bf JJ |
4521 | dot = lang_size_sections_1 (constructor_list.head, |
4522 | output_section_statement, | |
4523 | &s->wild_statement.children.head, | |
cf888e70 | 4524 | fill, dot, relax, check_regions); |
252b5132 RH |
4525 | break; |
4526 | ||
4527 | case lang_data_statement_enum: | |
4528 | { | |
4529 | unsigned int size = 0; | |
4530 | ||
7fabd029 | 4531 | s->data_statement.output_offset = |
08da4cac | 4532 | dot - output_section_statement->bfd_section->vma; |
252b5132 RH |
4533 | s->data_statement.output_section = |
4534 | output_section_statement->bfd_section; | |
4535 | ||
1b493742 NS |
4536 | /* We might refer to provided symbols in the expression, and |
4537 | need to mark them as needed. */ | |
e9ee469a | 4538 | exp_fold_tree (s->data_statement.exp, bfd_abs_section_ptr, &dot); |
1b493742 | 4539 | |
252b5132 RH |
4540 | switch (s->data_statement.type) |
4541 | { | |
08da4cac KH |
4542 | default: |
4543 | abort (); | |
252b5132 RH |
4544 | case QUAD: |
4545 | case SQUAD: | |
4546 | size = QUAD_SIZE; | |
4547 | break; | |
4548 | case LONG: | |
4549 | size = LONG_SIZE; | |
4550 | break; | |
4551 | case SHORT: | |
4552 | size = SHORT_SIZE; | |
4553 | break; | |
4554 | case BYTE: | |
4555 | size = BYTE_SIZE; | |
4556 | break; | |
4557 | } | |
e5caa5e0 AM |
4558 | if (size < TO_SIZE ((unsigned) 1)) |
4559 | size = TO_SIZE ((unsigned) 1); | |
4560 | dot += TO_ADDR (size); | |
eea6121a | 4561 | output_section_statement->bfd_section->size += size; |
252b5132 RH |
4562 | } |
4563 | break; | |
4564 | ||
4565 | case lang_reloc_statement_enum: | |
4566 | { | |
4567 | int size; | |
4568 | ||
7fabd029 | 4569 | s->reloc_statement.output_offset = |
252b5132 RH |
4570 | dot - output_section_statement->bfd_section->vma; |
4571 | s->reloc_statement.output_section = | |
4572 | output_section_statement->bfd_section; | |
4573 | size = bfd_get_reloc_size (s->reloc_statement.howto); | |
e5caa5e0 | 4574 | dot += TO_ADDR (size); |
eea6121a | 4575 | output_section_statement->bfd_section->size += size; |
252b5132 RH |
4576 | } |
4577 | break; | |
5f992e62 | 4578 | |
252b5132 | 4579 | case lang_wild_statement_enum: |
2d20f7bf JJ |
4580 | dot = lang_size_sections_1 (s->wild_statement.children.head, |
4581 | output_section_statement, | |
4582 | &s->wild_statement.children.head, | |
cf888e70 | 4583 | fill, dot, relax, check_regions); |
252b5132 RH |
4584 | break; |
4585 | ||
4586 | case lang_object_symbols_statement_enum: | |
4587 | link_info.create_object_symbols_section = | |
4588 | output_section_statement->bfd_section; | |
4589 | break; | |
e9ee469a | 4590 | |
252b5132 RH |
4591 | case lang_output_statement_enum: |
4592 | case lang_target_statement_enum: | |
4593 | break; | |
e9ee469a | 4594 | |
252b5132 RH |
4595 | case lang_input_section_enum: |
4596 | { | |
4597 | asection *i; | |
4598 | ||
4599 | i = (*prev)->input_section.section; | |
eea6121a | 4600 | if (relax) |
252b5132 | 4601 | { |
b34976b6 | 4602 | bfd_boolean again; |
252b5132 RH |
4603 | |
4604 | if (! bfd_relax_section (i->owner, i, &link_info, &again)) | |
4605 | einfo (_("%P%F: can't relax section: %E\n")); | |
4606 | if (again) | |
b34976b6 | 4607 | *relax = TRUE; |
252b5132 | 4608 | } |
b3327aad AM |
4609 | dot = size_input_section (prev, output_section_statement, |
4610 | output_section_statement->fill, dot); | |
252b5132 RH |
4611 | } |
4612 | break; | |
e9ee469a | 4613 | |
252b5132 RH |
4614 | case lang_input_statement_enum: |
4615 | break; | |
e9ee469a | 4616 | |
252b5132 | 4617 | case lang_fill_statement_enum: |
08da4cac KH |
4618 | s->fill_statement.output_section = |
4619 | output_section_statement->bfd_section; | |
252b5132 RH |
4620 | |
4621 | fill = s->fill_statement.fill; | |
4622 | break; | |
e9ee469a | 4623 | |
252b5132 RH |
4624 | case lang_assignment_statement_enum: |
4625 | { | |
4626 | bfd_vma newdot = dot; | |
49c13adb | 4627 | etree_type *tree = s->assignment_statement.exp; |
252b5132 | 4628 | |
49c13adb | 4629 | exp_fold_tree (tree, |
408082ec | 4630 | output_section_statement->bfd_section, |
252b5132 RH |
4631 | &newdot); |
4632 | ||
49c13adb | 4633 | /* This symbol is relative to this section. */ |
a14a5de3 | 4634 | if ((tree->type.node_class == etree_provided |
49c13adb L |
4635 | || tree->type.node_class == etree_assign) |
4636 | && (tree->assign.dst [0] != '.' | |
4637 | || tree->assign.dst [1] != '\0')) | |
4638 | output_section_statement->section_relative_symbol = 1; | |
4639 | ||
85852e36 | 4640 | if (!output_section_statement->ignored) |
252b5132 | 4641 | { |
252b5132 RH |
4642 | if (output_section_statement == abs_output_section) |
4643 | { | |
4644 | /* If we don't have an output section, then just adjust | |
4645 | the default memory address. */ | |
6feb9908 AM |
4646 | lang_memory_region_lookup (DEFAULT_MEMORY_REGION, |
4647 | FALSE)->current = newdot; | |
252b5132 | 4648 | } |
85852e36 | 4649 | else if (newdot != dot) |
252b5132 | 4650 | { |
b3327aad AM |
4651 | /* Insert a pad after this statement. We can't |
4652 | put the pad before when relaxing, in case the | |
4653 | assignment references dot. */ | |
e5caa5e0 | 4654 | insert_pad (&s->header.next, fill, TO_SIZE (newdot - dot), |
b3327aad AM |
4655 | output_section_statement->bfd_section, dot); |
4656 | ||
4657 | /* Don't neuter the pad below when relaxing. */ | |
4658 | s = s->header.next; | |
9dfc8ab2 | 4659 | |
e9ee469a AM |
4660 | /* If dot is advanced, this implies that the section |
4661 | should have space allocated to it, unless the | |
4662 | user has explicitly stated that the section | |
4663 | should never be loaded. */ | |
4664 | if (!(output_section_statement->flags | |
4665 | & (SEC_NEVER_LOAD | SEC_ALLOC))) | |
4666 | output_section_statement->bfd_section->flags |= SEC_ALLOC; | |
4667 | } | |
252b5132 RH |
4668 | dot = newdot; |
4669 | } | |
4670 | } | |
4671 | break; | |
4672 | ||
4673 | case lang_padding_statement_enum: | |
c0c330a7 AM |
4674 | /* If this is the first time lang_size_sections is called, |
4675 | we won't have any padding statements. If this is the | |
4676 | second or later passes when relaxing, we should allow | |
4677 | padding to shrink. If padding is needed on this pass, it | |
4678 | will be added back in. */ | |
4679 | s->padding_statement.size = 0; | |
6e814ff8 AM |
4680 | |
4681 | /* Make sure output_offset is valid. If relaxation shrinks | |
4682 | the section and this pad isn't needed, it's possible to | |
4683 | have output_offset larger than the final size of the | |
4684 | section. bfd_set_section_contents will complain even for | |
4685 | a pad size of zero. */ | |
4686 | s->padding_statement.output_offset | |
4687 | = dot - output_section_statement->bfd_section->vma; | |
252b5132 RH |
4688 | break; |
4689 | ||
4690 | case lang_group_statement_enum: | |
2d20f7bf JJ |
4691 | dot = lang_size_sections_1 (s->group_statement.children.head, |
4692 | output_section_statement, | |
4693 | &s->group_statement.children.head, | |
cf888e70 | 4694 | fill, dot, relax, check_regions); |
252b5132 RH |
4695 | break; |
4696 | ||
4697 | default: | |
4698 | FAIL (); | |
4699 | break; | |
4700 | ||
c0c330a7 | 4701 | /* We can only get here when relaxing is turned on. */ |
252b5132 RH |
4702 | case lang_address_statement_enum: |
4703 | break; | |
4704 | } | |
4705 | prev = &s->header.next; | |
4706 | } | |
4707 | return dot; | |
4708 | } | |
4709 | ||
591a748a NC |
4710 | /* Callback routine that is used in _bfd_elf_map_sections_to_segments. |
4711 | The BFD library has set NEW_SEGMENT to TRUE iff it thinks that | |
4712 | CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different | |
4713 | segments. We are allowed an opportunity to override this decision. */ | |
2889e75b NC |
4714 | |
4715 | bfd_boolean | |
4716 | ldlang_override_segment_assignment (struct bfd_link_info * info ATTRIBUTE_UNUSED, | |
4717 | bfd * abfd ATTRIBUTE_UNUSED, | |
4718 | asection * current_section, | |
4719 | asection * previous_section, | |
4720 | bfd_boolean new_segment) | |
4721 | { | |
4722 | lang_output_section_statement_type * cur; | |
4723 | lang_output_section_statement_type * prev; | |
591a748a NC |
4724 | |
4725 | /* The checks below are only necessary when the BFD library has decided | |
4726 | that the two sections ought to be placed into the same segment. */ | |
2889e75b NC |
4727 | if (new_segment) |
4728 | return TRUE; | |
4729 | ||
4730 | /* Paranoia checks. */ | |
4731 | if (current_section == NULL || previous_section == NULL) | |
4732 | return new_segment; | |
4733 | ||
4734 | /* Find the memory regions associated with the two sections. | |
4735 | We call lang_output_section_find() here rather than scanning the list | |
4736 | of output sections looking for a matching section pointer because if | |
591a748a | 4737 | we have a large number of sections then a hash lookup is faster. */ |
2889e75b NC |
4738 | cur = lang_output_section_find (current_section->name); |
4739 | prev = lang_output_section_find (previous_section->name); | |
4740 | ||
591a748a | 4741 | /* More paranoia. */ |
2889e75b NC |
4742 | if (cur == NULL || prev == NULL) |
4743 | return new_segment; | |
4744 | ||
4745 | /* If the regions are different then force the sections to live in | |
591a748a NC |
4746 | different segments. See the email thread starting at the following |
4747 | URL for the reasons why this is necessary: | |
2889e75b NC |
4748 | http://sourceware.org/ml/binutils/2007-02/msg00216.html */ |
4749 | return cur->region != prev->region; | |
4750 | } | |
4751 | ||
e9ee469a AM |
4752 | void |
4753 | one_lang_size_sections_pass (bfd_boolean *relax, bfd_boolean check_regions) | |
2d20f7bf | 4754 | { |
420e579c | 4755 | lang_statement_iteration++; |
e9ee469a AM |
4756 | lang_size_sections_1 (statement_list.head, abs_output_section, |
4757 | &statement_list.head, 0, 0, relax, check_regions); | |
4758 | } | |
420e579c | 4759 | |
e9ee469a AM |
4760 | void |
4761 | lang_size_sections (bfd_boolean *relax, bfd_boolean check_regions) | |
4762 | { | |
4763 | expld.phase = lang_allocating_phase_enum; | |
4764 | expld.dataseg.phase = exp_dataseg_none; | |
4765 | ||
4766 | one_lang_size_sections_pass (relax, check_regions); | |
4767 | if (expld.dataseg.phase == exp_dataseg_end_seen | |
4768 | && link_info.relro && expld.dataseg.relro_end) | |
8c37241b JJ |
4769 | { |
4770 | /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try | |
e9ee469a | 4771 | to put expld.dataseg.relro on a (common) page boundary. */ |
e3070fef | 4772 | bfd_vma old_min_base, relro_end, maxpage; |
8c37241b | 4773 | |
e9ee469a AM |
4774 | expld.dataseg.phase = exp_dataseg_relro_adjust; |
4775 | old_min_base = expld.dataseg.min_base; | |
4776 | maxpage = expld.dataseg.maxpagesize; | |
4777 | expld.dataseg.base += (-expld.dataseg.relro_end | |
4778 | & (expld.dataseg.pagesize - 1)); | |
a4f5ad88 | 4779 | /* Compute the expected PT_GNU_RELRO segment end. */ |
e9ee469a AM |
4780 | relro_end = (expld.dataseg.relro_end + expld.dataseg.pagesize - 1) |
4781 | & ~(expld.dataseg.pagesize - 1); | |
4782 | if (old_min_base + maxpage < expld.dataseg.base) | |
e3070fef | 4783 | { |
e9ee469a | 4784 | expld.dataseg.base -= maxpage; |
e3070fef JJ |
4785 | relro_end -= maxpage; |
4786 | } | |
f86a8756 | 4787 | lang_reset_memory_regions (); |
e9ee469a AM |
4788 | one_lang_size_sections_pass (relax, check_regions); |
4789 | if (expld.dataseg.relro_end > relro_end) | |
a4f5ad88 JJ |
4790 | { |
4791 | /* The alignment of sections between DATA_SEGMENT_ALIGN | |
4792 | and DATA_SEGMENT_RELRO_END caused huge padding to be | |
4793 | inserted at DATA_SEGMENT_RELRO_END. Try some other base. */ | |
4794 | asection *sec; | |
4795 | unsigned int max_alignment_power = 0; | |
4796 | ||
4797 | /* Find maximum alignment power of sections between | |
4798 | DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */ | |
4799 | for (sec = output_bfd->sections; sec; sec = sec->next) | |
e9ee469a AM |
4800 | if (sec->vma >= expld.dataseg.base |
4801 | && sec->vma < expld.dataseg.relro_end | |
a4f5ad88 JJ |
4802 | && sec->alignment_power > max_alignment_power) |
4803 | max_alignment_power = sec->alignment_power; | |
4804 | ||
e9ee469a | 4805 | if (((bfd_vma) 1 << max_alignment_power) < expld.dataseg.pagesize) |
a4f5ad88 | 4806 | { |
e9ee469a | 4807 | if (expld.dataseg.base - (1 << max_alignment_power) |
e3070fef | 4808 | < old_min_base) |
e9ee469a AM |
4809 | expld.dataseg.base += expld.dataseg.pagesize; |
4810 | expld.dataseg.base -= (1 << max_alignment_power); | |
f86a8756 | 4811 | lang_reset_memory_regions (); |
e9ee469a | 4812 | one_lang_size_sections_pass (relax, check_regions); |
a4f5ad88 JJ |
4813 | } |
4814 | } | |
e9ee469a AM |
4815 | link_info.relro_start = expld.dataseg.base; |
4816 | link_info.relro_end = expld.dataseg.relro_end; | |
8c37241b | 4817 | } |
e9ee469a | 4818 | else if (expld.dataseg.phase == exp_dataseg_end_seen) |
2d20f7bf JJ |
4819 | { |
4820 | /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether | |
4821 | a page could be saved in the data segment. */ | |
4822 | bfd_vma first, last; | |
4823 | ||
e9ee469a AM |
4824 | first = -expld.dataseg.base & (expld.dataseg.pagesize - 1); |
4825 | last = expld.dataseg.end & (expld.dataseg.pagesize - 1); | |
2d20f7bf | 4826 | if (first && last |
e9ee469a AM |
4827 | && ((expld.dataseg.base & ~(expld.dataseg.pagesize - 1)) |
4828 | != (expld.dataseg.end & ~(expld.dataseg.pagesize - 1))) | |
4829 | && first + last <= expld.dataseg.pagesize) | |
2d20f7bf | 4830 | { |
e9ee469a | 4831 | expld.dataseg.phase = exp_dataseg_adjust; |
f86a8756 | 4832 | lang_reset_memory_regions (); |
e9ee469a | 4833 | one_lang_size_sections_pass (relax, check_regions); |
2d20f7bf JJ |
4834 | } |
4835 | } | |
4836 | ||
e9ee469a | 4837 | expld.phase = lang_final_phase_enum; |
2d20f7bf JJ |
4838 | } |
4839 | ||
420e579c HPN |
4840 | /* Worker function for lang_do_assignments. Recursiveness goes here. */ |
4841 | ||
4842 | static bfd_vma | |
66e28d60 AM |
4843 | lang_do_assignments_1 (lang_statement_union_type *s, |
4844 | lang_output_section_statement_type *current_os, | |
4845 | fill_type *fill, | |
4846 | bfd_vma dot) | |
252b5132 | 4847 | { |
1579bae1 | 4848 | for (; s != NULL; s = s->header.next) |
252b5132 RH |
4849 | { |
4850 | switch (s->header.type) | |
4851 | { | |
4852 | case lang_constructors_statement_enum: | |
420e579c | 4853 | dot = lang_do_assignments_1 (constructor_list.head, |
66e28d60 | 4854 | current_os, fill, dot); |
252b5132 RH |
4855 | break; |
4856 | ||
4857 | case lang_output_section_statement_enum: | |
4858 | { | |
d1778b88 | 4859 | lang_output_section_statement_type *os; |
252b5132 | 4860 | |
d1778b88 | 4861 | os = &(s->output_section_statement); |
75ff4589 | 4862 | if (os->bfd_section != NULL && !os->ignored) |
252b5132 RH |
4863 | { |
4864 | dot = os->bfd_section->vma; | |
66e28d60 | 4865 | |
cde9e0be | 4866 | lang_do_assignments_1 (os->children.head, os, os->fill, dot); |
66e28d60 | 4867 | |
3737f867 JJ |
4868 | /* .tbss sections effectively have zero size. */ |
4869 | if ((os->bfd_section->flags & SEC_HAS_CONTENTS) != 0 | |
4870 | || (os->bfd_section->flags & SEC_THREAD_LOCAL) == 0 | |
4871 | || link_info.relocatable) | |
cde9e0be | 4872 | dot += TO_ADDR (os->bfd_section->size); |
252b5132 RH |
4873 | } |
4874 | } | |
4875 | break; | |
e9ee469a | 4876 | |
252b5132 RH |
4877 | case lang_wild_statement_enum: |
4878 | ||
420e579c | 4879 | dot = lang_do_assignments_1 (s->wild_statement.children.head, |
66e28d60 | 4880 | current_os, fill, dot); |
252b5132 RH |
4881 | break; |
4882 | ||
4883 | case lang_object_symbols_statement_enum: | |
4884 | case lang_output_statement_enum: | |
4885 | case lang_target_statement_enum: | |
252b5132 | 4886 | break; |
e9ee469a | 4887 | |
252b5132 | 4888 | case lang_data_statement_enum: |
e9ee469a AM |
4889 | exp_fold_tree (s->data_statement.exp, bfd_abs_section_ptr, &dot); |
4890 | if (expld.result.valid_p) | |
4891 | s->data_statement.value = (expld.result.value | |
4892 | + expld.result.section->vma); | |
4893 | else | |
4894 | einfo (_("%F%P: invalid data statement\n")); | |
b7a26f91 KH |
4895 | { |
4896 | unsigned int size; | |
08da4cac KH |
4897 | switch (s->data_statement.type) |
4898 | { | |
4899 | default: | |
4900 | abort (); | |
4901 | case QUAD: | |
4902 | case SQUAD: | |
4903 | size = QUAD_SIZE; | |
4904 | break; | |
4905 | case LONG: | |
4906 | size = LONG_SIZE; | |
4907 | break; | |
4908 | case SHORT: | |
4909 | size = SHORT_SIZE; | |
4910 | break; | |
4911 | case BYTE: | |
4912 | size = BYTE_SIZE; | |
4913 | break; | |
4914 | } | |
e5caa5e0 AM |
4915 | if (size < TO_SIZE ((unsigned) 1)) |
4916 | size = TO_SIZE ((unsigned) 1); | |
4917 | dot += TO_ADDR (size); | |
08da4cac | 4918 | } |
252b5132 RH |
4919 | break; |
4920 | ||
4921 | case lang_reloc_statement_enum: | |
e9ee469a AM |
4922 | exp_fold_tree (s->reloc_statement.addend_exp, |
4923 | bfd_abs_section_ptr, &dot); | |
4924 | if (expld.result.valid_p) | |
4925 | s->reloc_statement.addend_value = expld.result.value; | |
4926 | else | |
4927 | einfo (_("%F%P: invalid reloc statement\n")); | |
e5caa5e0 | 4928 | dot += TO_ADDR (bfd_get_reloc_size (s->reloc_statement.howto)); |
252b5132 RH |
4929 | break; |
4930 | ||
4931 | case lang_input_section_enum: | |
4932 | { | |
4933 | asection *in = s->input_section.section; | |
4934 | ||
57ceae94 | 4935 | if ((in->flags & SEC_EXCLUDE) == 0) |
eea6121a | 4936 | dot += TO_ADDR (in->size); |
252b5132 RH |
4937 | } |
4938 | break; | |
4939 | ||
4940 | case lang_input_statement_enum: | |
4941 | break; | |
e9ee469a | 4942 | |
252b5132 RH |
4943 | case lang_fill_statement_enum: |
4944 | fill = s->fill_statement.fill; | |
4945 | break; | |
252b5132 | 4946 | |
e9ee469a AM |
4947 | case lang_assignment_statement_enum: |
4948 | exp_fold_tree (s->assignment_statement.exp, | |
66e28d60 | 4949 | current_os->bfd_section, |
e9ee469a | 4950 | &dot); |
252b5132 | 4951 | break; |
e9ee469a | 4952 | |
252b5132 | 4953 | case lang_padding_statement_enum: |
e5caa5e0 | 4954 | dot += TO_ADDR (s->padding_statement.size); |
252b5132 RH |
4955 | break; |
4956 | ||
4957 | case lang_group_statement_enum: | |
420e579c | 4958 | dot = lang_do_assignments_1 (s->group_statement.children.head, |
66e28d60 | 4959 | current_os, fill, dot); |
252b5132 RH |
4960 | break; |
4961 | ||
4962 | default: | |
4963 | FAIL (); | |
4964 | break; | |
e9ee469a | 4965 | |
252b5132 RH |
4966 | case lang_address_statement_enum: |
4967 | break; | |
4968 | } | |
252b5132 RH |
4969 | } |
4970 | return dot; | |
4971 | } | |
4972 | ||
f2241121 | 4973 | void |
e9ee469a | 4974 | lang_do_assignments (void) |
420e579c | 4975 | { |
420e579c | 4976 | lang_statement_iteration++; |
e9ee469a | 4977 | lang_do_assignments_1 (statement_list.head, abs_output_section, NULL, 0); |
420e579c HPN |
4978 | } |
4979 | ||
252b5132 RH |
4980 | /* Fix any .startof. or .sizeof. symbols. When the assemblers see the |
4981 | operator .startof. (section_name), it produces an undefined symbol | |
4982 | .startof.section_name. Similarly, when it sees | |
4983 | .sizeof. (section_name), it produces an undefined symbol | |
4984 | .sizeof.section_name. For all the output sections, we look for | |
4985 | such symbols, and set them to the correct value. */ | |
4986 | ||
4987 | static void | |
1579bae1 | 4988 | lang_set_startof (void) |
252b5132 RH |
4989 | { |
4990 | asection *s; | |
4991 | ||
1049f94e | 4992 | if (link_info.relocatable) |
252b5132 RH |
4993 | return; |
4994 | ||
4995 | for (s = output_bfd->sections; s != NULL; s = s->next) | |
4996 | { | |
4997 | const char *secname; | |
4998 | char *buf; | |
4999 | struct bfd_link_hash_entry *h; | |
5000 | ||
5001 | secname = bfd_get_section_name (output_bfd, s); | |
5002 | buf = xmalloc (10 + strlen (secname)); | |
5003 | ||
5004 | sprintf (buf, ".startof.%s", secname); | |
b34976b6 | 5005 | h = bfd_link_hash_lookup (link_info.hash, buf, FALSE, FALSE, TRUE); |
252b5132 RH |
5006 | if (h != NULL && h->type == bfd_link_hash_undefined) |
5007 | { | |
5008 | h->type = bfd_link_hash_defined; | |
5009 | h->u.def.value = bfd_get_section_vma (output_bfd, s); | |
5010 | h->u.def.section = bfd_abs_section_ptr; | |
5011 | } | |
5012 | ||
5013 | sprintf (buf, ".sizeof.%s", secname); | |
b34976b6 | 5014 | h = bfd_link_hash_lookup (link_info.hash, buf, FALSE, FALSE, TRUE); |
252b5132 RH |
5015 | if (h != NULL && h->type == bfd_link_hash_undefined) |
5016 | { | |
5017 | h->type = bfd_link_hash_defined; | |
eea6121a | 5018 | h->u.def.value = TO_ADDR (s->size); |
252b5132 RH |
5019 | h->u.def.section = bfd_abs_section_ptr; |
5020 | } | |
5021 | ||
5022 | free (buf); | |
5023 | } | |
5024 | } | |
5025 | ||
5026 | static void | |
750877ba | 5027 | lang_end (void) |
252b5132 RH |
5028 | { |
5029 | struct bfd_link_hash_entry *h; | |
b34976b6 | 5030 | bfd_boolean warn; |
252b5132 | 5031 | |
1049f94e | 5032 | if (link_info.relocatable || link_info.shared) |
b34976b6 | 5033 | warn = FALSE; |
252b5132 | 5034 | else |
b34976b6 | 5035 | warn = TRUE; |
252b5132 | 5036 | |
1579bae1 | 5037 | if (entry_symbol.name == NULL) |
252b5132 | 5038 | { |
a359509e ZW |
5039 | /* No entry has been specified. Look for the default entry, but |
5040 | don't warn if we don't find it. */ | |
5041 | entry_symbol.name = entry_symbol_default; | |
b34976b6 | 5042 | warn = FALSE; |
252b5132 RH |
5043 | } |
5044 | ||
e3e942e9 | 5045 | h = bfd_link_hash_lookup (link_info.hash, entry_symbol.name, |
b34976b6 | 5046 | FALSE, FALSE, TRUE); |
1579bae1 | 5047 | if (h != NULL |
252b5132 RH |
5048 | && (h->type == bfd_link_hash_defined |
5049 | || h->type == bfd_link_hash_defweak) | |
5050 | && h->u.def.section->output_section != NULL) | |
5051 | { | |
5052 | bfd_vma val; | |
5053 | ||
5054 | val = (h->u.def.value | |
5055 | + bfd_get_section_vma (output_bfd, | |
5056 | h->u.def.section->output_section) | |
5057 | + h->u.def.section->output_offset); | |
5058 | if (! bfd_set_start_address (output_bfd, val)) | |
e3e942e9 | 5059 | einfo (_("%P%F:%s: can't set start address\n"), entry_symbol.name); |
252b5132 RH |
5060 | } |
5061 | else | |
5062 | { | |
5063 | bfd_vma val; | |
5f992e62 | 5064 | const char *send; |
252b5132 RH |
5065 | |
5066 | /* We couldn't find the entry symbol. Try parsing it as a | |
afd7a018 | 5067 | number. */ |
e3e942e9 | 5068 | val = bfd_scan_vma (entry_symbol.name, &send, 0); |
252b5132 RH |
5069 | if (*send == '\0') |
5070 | { | |
5071 | if (! bfd_set_start_address (output_bfd, val)) | |
5072 | einfo (_("%P%F: can't set start address\n")); | |
5073 | } | |
5074 | else | |
5075 | { | |
5076 | asection *ts; | |
5077 | ||
5078 | /* Can't find the entry symbol, and it's not a number. Use | |
5079 | the first address in the text section. */ | |
1e281515 | 5080 | ts = bfd_get_section_by_name (output_bfd, entry_section); |
1579bae1 | 5081 | if (ts != NULL) |
252b5132 RH |
5082 | { |
5083 | if (warn) | |
6feb9908 AM |
5084 | einfo (_("%P: warning: cannot find entry symbol %s;" |
5085 | " defaulting to %V\n"), | |
e3e942e9 AM |
5086 | entry_symbol.name, |
5087 | bfd_get_section_vma (output_bfd, ts)); | |
252b5132 RH |
5088 | if (! bfd_set_start_address (output_bfd, |
5089 | bfd_get_section_vma (output_bfd, | |
5090 | ts))) | |
5091 | einfo (_("%P%F: can't set start address\n")); | |
5092 | } | |
5093 | else | |
5094 | { | |
5095 | if (warn) | |
6feb9908 AM |
5096 | einfo (_("%P: warning: cannot find entry symbol %s;" |
5097 | " not setting start address\n"), | |
e3e942e9 | 5098 | entry_symbol.name); |
252b5132 RH |
5099 | } |
5100 | } | |
5101 | } | |
420e579c | 5102 | |
7115639b AM |
5103 | /* Don't bfd_hash_table_free (&lang_definedness_table); |
5104 | map file output may result in a call of lang_track_definedness. */ | |
252b5132 RH |
5105 | } |
5106 | ||
5107 | /* This is a small function used when we want to ignore errors from | |
5108 | BFD. */ | |
5109 | ||
5110 | static void | |
87f2a346 | 5111 | ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED, ...) |
252b5132 RH |
5112 | { |
5113 | /* Don't do anything. */ | |
5114 | } | |
5115 | ||
5116 | /* Check that the architecture of all the input files is compatible | |
5117 | with the output file. Also call the backend to let it do any | |
5118 | other checking that is needed. */ | |
5119 | ||
5120 | static void | |
1579bae1 | 5121 | lang_check (void) |
252b5132 RH |
5122 | { |
5123 | lang_statement_union_type *file; | |
5124 | bfd *input_bfd; | |
5f992e62 | 5125 | const bfd_arch_info_type *compatible; |
252b5132 | 5126 | |
1579bae1 | 5127 | for (file = file_chain.head; file != NULL; file = file->input_statement.next) |
252b5132 RH |
5128 | { |
5129 | input_bfd = file->input_statement.the_bfd; | |
6feb9908 AM |
5130 | compatible |
5131 | = bfd_arch_get_compatible (input_bfd, output_bfd, | |
5132 | command_line.accept_unknown_input_arch); | |
30cba025 AM |
5133 | |
5134 | /* In general it is not possible to perform a relocatable | |
5135 | link between differing object formats when the input | |
5136 | file has relocations, because the relocations in the | |
5137 | input format may not have equivalent representations in | |
5138 | the output format (and besides BFD does not translate | |
5139 | relocs for other link purposes than a final link). */ | |
1049f94e | 5140 | if ((link_info.relocatable || link_info.emitrelocations) |
30cba025 | 5141 | && (compatible == NULL |
d35a52e2 | 5142 | || bfd_get_flavour (input_bfd) != bfd_get_flavour (output_bfd)) |
30cba025 AM |
5143 | && (bfd_get_file_flags (input_bfd) & HAS_RELOC) != 0) |
5144 | { | |
6feb9908 AM |
5145 | einfo (_("%P%F: Relocatable linking with relocations from" |
5146 | " format %s (%B) to format %s (%B) is not supported\n"), | |
30cba025 AM |
5147 | bfd_get_target (input_bfd), input_bfd, |
5148 | bfd_get_target (output_bfd), output_bfd); | |
5149 | /* einfo with %F exits. */ | |
5150 | } | |
5151 | ||
252b5132 RH |
5152 | if (compatible == NULL) |
5153 | { | |
5154 | if (command_line.warn_mismatch) | |
6feb9908 AM |
5155 | einfo (_("%P: warning: %s architecture of input file `%B'" |
5156 | " is incompatible with %s output\n"), | |
252b5132 RH |
5157 | bfd_printable_name (input_bfd), input_bfd, |
5158 | bfd_printable_name (output_bfd)); | |
5159 | } | |
b9247304 | 5160 | else if (bfd_count_sections (input_bfd)) |
252b5132 | 5161 | { |
b9247304 | 5162 | /* If the input bfd has no contents, it shouldn't set the |
b7a26f91 | 5163 | private data of the output bfd. */ |
b9247304 | 5164 | |
252b5132 RH |
5165 | bfd_error_handler_type pfn = NULL; |
5166 | ||
5167 | /* If we aren't supposed to warn about mismatched input | |
afd7a018 AM |
5168 | files, temporarily set the BFD error handler to a |
5169 | function which will do nothing. We still want to call | |
5170 | bfd_merge_private_bfd_data, since it may set up | |
5171 | information which is needed in the output file. */ | |
252b5132 RH |
5172 | if (! command_line.warn_mismatch) |
5173 | pfn = bfd_set_error_handler (ignore_bfd_errors); | |
5174 | if (! bfd_merge_private_bfd_data (input_bfd, output_bfd)) | |
5175 | { | |
5176 | if (command_line.warn_mismatch) | |
6feb9908 AM |
5177 | einfo (_("%P%X: failed to merge target specific data" |
5178 | " of file %B\n"), input_bfd); | |
252b5132 RH |
5179 | } |
5180 | if (! command_line.warn_mismatch) | |
5181 | bfd_set_error_handler (pfn); | |
5182 | } | |
5183 | } | |
5184 | } | |
5185 | ||
5186 | /* Look through all the global common symbols and attach them to the | |
5187 | correct section. The -sort-common command line switch may be used | |
5188 | to roughly sort the entries by size. */ | |
5189 | ||
5190 | static void | |
1579bae1 | 5191 | lang_common (void) |
252b5132 | 5192 | { |
4818e05f AM |
5193 | if (command_line.inhibit_common_definition) |
5194 | return; | |
1049f94e | 5195 | if (link_info.relocatable |
252b5132 RH |
5196 | && ! command_line.force_common_definition) |
5197 | return; | |
5198 | ||
5199 | if (! config.sort_common) | |
1579bae1 | 5200 | bfd_link_hash_traverse (link_info.hash, lang_one_common, NULL); |
252b5132 RH |
5201 | else |
5202 | { | |
5203 | int power; | |
5204 | ||
5205 | for (power = 4; power >= 0; power--) | |
1579bae1 | 5206 | bfd_link_hash_traverse (link_info.hash, lang_one_common, &power); |
252b5132 RH |
5207 | } |
5208 | } | |
5209 | ||
5210 | /* Place one common symbol in the correct section. */ | |
5211 | ||
b34976b6 | 5212 | static bfd_boolean |
1579bae1 | 5213 | lang_one_common (struct bfd_link_hash_entry *h, void *info) |
252b5132 RH |
5214 | { |
5215 | unsigned int power_of_two; | |
5216 | bfd_vma size; | |
5217 | asection *section; | |
5218 | ||
5219 | if (h->type != bfd_link_hash_common) | |
b34976b6 | 5220 | return TRUE; |
252b5132 RH |
5221 | |
5222 | size = h->u.c.size; | |
5223 | power_of_two = h->u.c.p->alignment_power; | |
5224 | ||
5225 | if (config.sort_common | |
5226 | && power_of_two < (unsigned int) *(int *) info) | |
b34976b6 | 5227 | return TRUE; |
252b5132 RH |
5228 | |
5229 | section = h->u.c.p->section; | |
5230 | ||
e5caa5e0 | 5231 | /* Increase the size of the section to align the common sym. */ |
eea6121a AM |
5232 | section->size += ((bfd_vma) 1 << (power_of_two + opb_shift)) - 1; |
5233 | section->size &= (- (bfd_vma) 1 << (power_of_two + opb_shift)); | |
252b5132 RH |
5234 | |
5235 | /* Adjust the alignment if necessary. */ | |
5236 | if (power_of_two > section->alignment_power) | |
5237 | section->alignment_power = power_of_two; | |
5238 | ||
5239 | /* Change the symbol from common to defined. */ | |
5240 | h->type = bfd_link_hash_defined; | |
5241 | h->u.def.section = section; | |
eea6121a | 5242 | h->u.def.value = section->size; |
252b5132 RH |
5243 | |
5244 | /* Increase the size of the section. */ | |
eea6121a | 5245 | section->size += size; |
252b5132 RH |
5246 | |
5247 | /* Make sure the section is allocated in memory, and make sure that | |
5248 | it is no longer a common section. */ | |
5249 | section->flags |= SEC_ALLOC; | |
08da4cac | 5250 | section->flags &= ~SEC_IS_COMMON; |
252b5132 RH |
5251 | |
5252 | if (config.map_file != NULL) | |
5253 | { | |
b34976b6 | 5254 | static bfd_boolean header_printed; |
252b5132 RH |
5255 | int len; |
5256 | char *name; | |
5257 | char buf[50]; | |
5258 | ||
5259 | if (! header_printed) | |
5260 | { | |
5261 | minfo (_("\nAllocating common symbols\n")); | |
5262 | minfo (_("Common symbol size file\n\n")); | |
b34976b6 | 5263 | header_printed = TRUE; |
252b5132 RH |
5264 | } |
5265 | ||
5266 | name = demangle (h->root.string); | |
5267 | minfo ("%s", name); | |
5268 | len = strlen (name); | |
5269 | free (name); | |
5270 | ||
5271 | if (len >= 19) | |
5272 | { | |
5273 | print_nl (); | |
5274 | len = 0; | |
5275 | } | |
5276 | while (len < 20) | |
5277 | { | |
5278 | print_space (); | |
5279 | ++len; | |
5280 | } | |
5281 | ||
5282 | minfo ("0x"); | |
5283 | if (size <= 0xffffffff) | |
5284 | sprintf (buf, "%lx", (unsigned long) size); | |
5285 | else | |
5286 | sprintf_vma (buf, size); | |
5287 | minfo ("%s", buf); | |
5288 | len = strlen (buf); | |
5289 | ||
5290 | while (len < 16) | |
5291 | { | |
5292 | print_space (); | |
5293 | ++len; | |
5294 | } | |
5295 | ||
5296 | minfo ("%B\n", section->owner); | |
5297 | } | |
5298 | ||
b34976b6 | 5299 | return TRUE; |
252b5132 RH |
5300 | } |
5301 | ||
08da4cac KH |
5302 | /* Run through the input files and ensure that every input section has |
5303 | somewhere to go. If one is found without a destination then create | |
5304 | an input request and place it into the statement tree. */ | |
252b5132 RH |
5305 | |
5306 | static void | |
1579bae1 | 5307 | lang_place_orphans (void) |
252b5132 | 5308 | { |
e50d8076 | 5309 | LANG_FOR_EACH_INPUT_STATEMENT (file) |
252b5132 RH |
5310 | { |
5311 | asection *s; | |
5312 | ||
1579bae1 | 5313 | for (s = file->the_bfd->sections; s != NULL; s = s->next) |
252b5132 | 5314 | { |
1579bae1 | 5315 | if (s->output_section == NULL) |
252b5132 | 5316 | { |
396a2467 | 5317 | /* This section of the file is not attached, root |
afd7a018 | 5318 | around for a sensible place for it to go. */ |
252b5132 RH |
5319 | |
5320 | if (file->just_syms_flag) | |
1449d79b AM |
5321 | bfd_link_just_syms (file->the_bfd, s, &link_info); |
5322 | else if ((s->flags & SEC_EXCLUDE) != 0) | |
164e712d | 5323 | s->output_section = bfd_abs_section_ptr; |
252b5132 RH |
5324 | else if (strcmp (s->name, "COMMON") == 0) |
5325 | { | |
5326 | /* This is a lonely common section which must have | |
5327 | come from an archive. We attach to the section | |
5328 | with the wildcard. */ | |
1049f94e | 5329 | if (! link_info.relocatable |
252b5132 RH |
5330 | || command_line.force_common_definition) |
5331 | { | |
5332 | if (default_common_section == NULL) | |
5333 | { | |
252b5132 RH |
5334 | default_common_section = |
5335 | lang_output_section_statement_lookup (".bss"); | |
5336 | ||
5337 | } | |
39dcfe18 | 5338 | lang_add_section (&default_common_section->children, s, |
7b986e99 | 5339 | default_common_section); |
252b5132 RH |
5340 | } |
5341 | } | |
7b986e99 | 5342 | else if (ldemul_place_orphan (s)) |
252b5132 RH |
5343 | ; |
5344 | else | |
5345 | { | |
39dcfe18 | 5346 | lang_output_section_statement_type *os; |
252b5132 | 5347 | |
39dcfe18 | 5348 | os = lang_output_section_statement_lookup (s->name); |
7b986e99 | 5349 | lang_add_section (&os->children, s, os); |
252b5132 RH |
5350 | } |
5351 | } | |
5352 | } | |
5353 | } | |
5354 | } | |
5355 | ||
252b5132 | 5356 | void |
1579bae1 | 5357 | lang_set_flags (lang_memory_region_type *ptr, const char *flags, int invert) |
252b5132 | 5358 | { |
aa8804e4 | 5359 | flagword *ptr_flags; |
252b5132 | 5360 | |
aa8804e4 | 5361 | ptr_flags = invert ? &ptr->not_flags : &ptr->flags; |
252b5132 RH |
5362 | while (*flags) |
5363 | { | |
5364 | switch (*flags) | |
5365 | { | |
252b5132 RH |
5366 | case 'A': case 'a': |
5367 | *ptr_flags |= SEC_ALLOC; | |
5368 | break; | |
5369 | ||
5370 | case 'R': case 'r': | |
5371 | *ptr_flags |= SEC_READONLY; | |
5372 | break; | |
5373 | ||
5374 | case 'W': case 'w': | |
5375 | *ptr_flags |= SEC_DATA; | |
5376 | break; | |
5377 | ||
5378 | case 'X': case 'x': | |
5379 | *ptr_flags |= SEC_CODE; | |
5380 | break; | |
5381 | ||
5382 | case 'L': case 'l': | |
5383 | case 'I': case 'i': | |
5384 | *ptr_flags |= SEC_LOAD; | |
5385 | break; | |
5386 | ||
5387 | default: | |
5388 | einfo (_("%P%F: invalid syntax in flags\n")); | |
5389 | break; | |
5390 | } | |
5391 | flags++; | |
5392 | } | |
5393 | } | |
5394 | ||
5395 | /* Call a function on each input file. This function will be called | |
5396 | on an archive, but not on the elements. */ | |
5397 | ||
5398 | void | |
1579bae1 | 5399 | lang_for_each_input_file (void (*func) (lang_input_statement_type *)) |
252b5132 RH |
5400 | { |
5401 | lang_input_statement_type *f; | |
5402 | ||
5403 | for (f = (lang_input_statement_type *) input_file_chain.head; | |
5404 | f != NULL; | |
5405 | f = (lang_input_statement_type *) f->next_real_file) | |
5406 | func (f); | |
5407 | } | |
5408 | ||
5409 | /* Call a function on each file. The function will be called on all | |
5410 | the elements of an archive which are included in the link, but will | |
5411 | not be called on the archive file itself. */ | |
5412 | ||
5413 | void | |
1579bae1 | 5414 | lang_for_each_file (void (*func) (lang_input_statement_type *)) |
252b5132 | 5415 | { |
e50d8076 | 5416 | LANG_FOR_EACH_INPUT_STATEMENT (f) |
252b5132 RH |
5417 | { |
5418 | func (f); | |
5419 | } | |
5420 | } | |
5421 | ||
252b5132 | 5422 | void |
1579bae1 | 5423 | ldlang_add_file (lang_input_statement_type *entry) |
252b5132 RH |
5424 | { |
5425 | bfd **pp; | |
5426 | ||
5427 | lang_statement_append (&file_chain, | |
5428 | (lang_statement_union_type *) entry, | |
5429 | &entry->next); | |
5430 | ||
5431 | /* The BFD linker needs to have a list of all input BFDs involved in | |
5432 | a link. */ | |
1579bae1 | 5433 | ASSERT (entry->the_bfd->link_next == NULL); |
252b5132 | 5434 | ASSERT (entry->the_bfd != output_bfd); |
1579bae1 | 5435 | for (pp = &link_info.input_bfds; *pp != NULL; pp = &(*pp)->link_next) |
252b5132 RH |
5436 | ; |
5437 | *pp = entry->the_bfd; | |
1579bae1 | 5438 | entry->the_bfd->usrdata = entry; |
252b5132 RH |
5439 | bfd_set_gp_size (entry->the_bfd, g_switch_value); |
5440 | ||
5441 | /* Look through the sections and check for any which should not be | |
5442 | included in the link. We need to do this now, so that we can | |
5443 | notice when the backend linker tries to report multiple | |
5444 | definition errors for symbols which are in sections we aren't | |
5445 | going to link. FIXME: It might be better to entirely ignore | |
5446 | symbols which are defined in sections which are going to be | |
5447 | discarded. This would require modifying the backend linker for | |
5448 | each backend which might set the SEC_LINK_ONCE flag. If we do | |
5449 | this, we should probably handle SEC_EXCLUDE in the same way. */ | |
5450 | ||
1579bae1 | 5451 | bfd_map_over_sections (entry->the_bfd, section_already_linked, entry); |
252b5132 RH |
5452 | } |
5453 | ||
5454 | void | |
1579bae1 | 5455 | lang_add_output (const char *name, int from_script) |
252b5132 RH |
5456 | { |
5457 | /* Make -o on command line override OUTPUT in script. */ | |
7c519c12 | 5458 | if (!had_output_filename || !from_script) |
252b5132 RH |
5459 | { |
5460 | output_filename = name; | |
b34976b6 | 5461 | had_output_filename = TRUE; |
252b5132 RH |
5462 | } |
5463 | } | |
5464 | ||
252b5132 RH |
5465 | static lang_output_section_statement_type *current_section; |
5466 | ||
5467 | static int | |
1579bae1 | 5468 | topower (int x) |
252b5132 RH |
5469 | { |
5470 | unsigned int i = 1; | |
5471 | int l; | |
5472 | ||
5473 | if (x < 0) | |
5474 | return -1; | |
5475 | ||
5f992e62 | 5476 | for (l = 0; l < 32; l++) |
252b5132 RH |
5477 | { |
5478 | if (i >= (unsigned int) x) | |
5479 | return l; | |
5480 | i <<= 1; | |
5481 | } | |
5482 | ||
5483 | return 0; | |
5484 | } | |
5485 | ||
aea4bd9d | 5486 | lang_output_section_statement_type * |
1579bae1 AM |
5487 | lang_enter_output_section_statement (const char *output_section_statement_name, |
5488 | etree_type *address_exp, | |
5489 | enum section_type sectype, | |
1579bae1 AM |
5490 | etree_type *align, |
5491 | etree_type *subalign, | |
0841712e JJ |
5492 | etree_type *ebase, |
5493 | int constraint) | |
252b5132 RH |
5494 | { |
5495 | lang_output_section_statement_type *os; | |
5496 | ||
bd4d42c1 AM |
5497 | os = lang_output_section_statement_lookup_1 (output_section_statement_name, |
5498 | constraint); | |
5499 | current_section = os; | |
252b5132 | 5500 | |
08da4cac | 5501 | /* Make next things chain into subchain of this. */ |
252b5132 | 5502 | |
1579bae1 | 5503 | if (os->addr_tree == NULL) |
08da4cac KH |
5504 | { |
5505 | os->addr_tree = address_exp; | |
5506 | } | |
252b5132 RH |
5507 | os->sectype = sectype; |
5508 | if (sectype != noload_section) | |
5509 | os->flags = SEC_NO_FLAGS; | |
5510 | else | |
5511 | os->flags = SEC_NEVER_LOAD; | |
e5caa5e0 | 5512 | os->block_value = 1; |
252b5132 RH |
5513 | stat_ptr = &os->children; |
5514 | ||
08da4cac | 5515 | os->subsection_alignment = |
e9ee469a | 5516 | topower (exp_get_value_int (subalign, -1, "subsection alignment")); |
08da4cac | 5517 | os->section_alignment = |
e9ee469a | 5518 | topower (exp_get_value_int (align, -1, "section alignment")); |
252b5132 RH |
5519 | |
5520 | os->load_base = ebase; | |
aea4bd9d | 5521 | return os; |
252b5132 RH |
5522 | } |
5523 | ||
252b5132 | 5524 | void |
1579bae1 | 5525 | lang_final (void) |
252b5132 | 5526 | { |
bd4d42c1 | 5527 | lang_output_statement_type *new; |
252b5132 | 5528 | |
bd4d42c1 | 5529 | new = new_stat (lang_output_statement, stat_ptr); |
252b5132 RH |
5530 | new->name = output_filename; |
5531 | } | |
5532 | ||
08da4cac KH |
5533 | /* Reset the current counters in the regions. */ |
5534 | ||
e3dc8847 | 5535 | void |
1579bae1 | 5536 | lang_reset_memory_regions (void) |
252b5132 RH |
5537 | { |
5538 | lang_memory_region_type *p = lang_memory_region_list; | |
b3327aad | 5539 | asection *o; |
e9ee469a | 5540 | lang_output_section_statement_type *os; |
252b5132 | 5541 | |
1579bae1 | 5542 | for (p = lang_memory_region_list; p != NULL; p = p->next) |
252b5132 | 5543 | { |
252b5132 | 5544 | p->current = p->origin; |
66e28d60 | 5545 | p->last_os = NULL; |
252b5132 | 5546 | } |
b3327aad | 5547 | |
e9ee469a AM |
5548 | for (os = &lang_output_section_statement.head->output_section_statement; |
5549 | os != NULL; | |
5550 | os = os->next) | |
cde9e0be AM |
5551 | { |
5552 | os->processed_vma = FALSE; | |
5553 | os->processed_lma = FALSE; | |
5554 | } | |
e9ee469a | 5555 | |
b3327aad | 5556 | for (o = output_bfd->sections; o != NULL; o = o->next) |
1a23a9e6 AM |
5557 | { |
5558 | /* Save the last size for possible use by bfd_relax_section. */ | |
5559 | o->rawsize = o->size; | |
5560 | o->size = 0; | |
5561 | } | |
252b5132 RH |
5562 | } |
5563 | ||
164e712d | 5564 | /* Worker for lang_gc_sections_1. */ |
252b5132 RH |
5565 | |
5566 | static void | |
1579bae1 AM |
5567 | gc_section_callback (lang_wild_statement_type *ptr, |
5568 | struct wildcard_list *sec ATTRIBUTE_UNUSED, | |
5569 | asection *section, | |
5570 | lang_input_statement_type *file ATTRIBUTE_UNUSED, | |
5571 | void *data ATTRIBUTE_UNUSED) | |
252b5132 | 5572 | { |
164e712d AM |
5573 | /* If the wild pattern was marked KEEP, the member sections |
5574 | should be as well. */ | |
4dec4d4e RH |
5575 | if (ptr->keep_sections) |
5576 | section->flags |= SEC_KEEP; | |
252b5132 RH |
5577 | } |
5578 | ||
252b5132 RH |
5579 | /* Iterate over sections marking them against GC. */ |
5580 | ||
5581 | static void | |
1579bae1 | 5582 | lang_gc_sections_1 (lang_statement_union_type *s) |
252b5132 | 5583 | { |
1579bae1 | 5584 | for (; s != NULL; s = s->header.next) |
252b5132 RH |
5585 | { |
5586 | switch (s->header.type) | |
5587 | { | |
5588 | case lang_wild_statement_enum: | |
164e712d | 5589 | walk_wild (&s->wild_statement, gc_section_callback, NULL); |
abc6ab0a | 5590 | break; |
252b5132 RH |
5591 | case lang_constructors_statement_enum: |
5592 | lang_gc_sections_1 (constructor_list.head); | |
5593 | break; | |
5594 | case lang_output_section_statement_enum: | |
5595 | lang_gc_sections_1 (s->output_section_statement.children.head); | |
5596 | break; | |
5597 | case lang_group_statement_enum: | |
5598 | lang_gc_sections_1 (s->group_statement.children.head); | |
5599 | break; | |
5600 | default: | |
5601 | break; | |
5602 | } | |
5603 | } | |
5604 | } | |
5605 | ||
5606 | static void | |
1579bae1 | 5607 | lang_gc_sections (void) |
252b5132 RH |
5608 | { |
5609 | struct bfd_link_hash_entry *h; | |
e3e942e9 | 5610 | ldlang_undef_chain_list_type *ulist; |
252b5132 RH |
5611 | |
5612 | /* Keep all sections so marked in the link script. */ | |
5613 | ||
5614 | lang_gc_sections_1 (statement_list.head); | |
5615 | ||
e3e942e9 AM |
5616 | /* Keep all sections containing symbols undefined on the command-line, |
5617 | and the section containing the entry symbol. */ | |
252b5132 | 5618 | |
e3e942e9 | 5619 | for (ulist = link_info.gc_sym_list; ulist; ulist = ulist->next) |
252b5132 | 5620 | { |
5f992e62 | 5621 | h = bfd_link_hash_lookup (link_info.hash, ulist->name, |
b34976b6 | 5622 | FALSE, FALSE, FALSE); |
252b5132 | 5623 | |
1579bae1 | 5624 | if (h != NULL |
08da4cac KH |
5625 | && (h->type == bfd_link_hash_defined |
5626 | || h->type == bfd_link_hash_defweak) | |
252b5132 RH |
5627 | && ! bfd_is_abs_section (h->u.def.section)) |
5628 | { | |
5629 | h->u.def.section->flags |= SEC_KEEP; | |
5630 | } | |
5631 | } | |
5632 | ||
9ca57817 AM |
5633 | /* SEC_EXCLUDE is ignored when doing a relocatable link, except in |
5634 | the special case of debug info. (See bfd/stabs.c) | |
5635 | Twiddle the flag here, to simplify later linker code. */ | |
5636 | if (link_info.relocatable) | |
5637 | { | |
5638 | LANG_FOR_EACH_INPUT_STATEMENT (f) | |
5639 | { | |
5640 | asection *sec; | |
5641 | for (sec = f->the_bfd->sections; sec != NULL; sec = sec->next) | |
5642 | if ((sec->flags & SEC_DEBUGGING) == 0) | |
5643 | sec->flags &= ~SEC_EXCLUDE; | |
5644 | } | |
5645 | } | |
5646 | ||
57316bff | 5647 | if (link_info.gc_sections) |
164e712d | 5648 | bfd_gc_sections (output_bfd, &link_info); |
252b5132 RH |
5649 | } |
5650 | ||
fbbc3759 L |
5651 | /* Relax all sections until bfd_relax_section gives up. */ |
5652 | ||
5653 | static void | |
5654 | relax_sections (void) | |
5655 | { | |
5656 | /* Keep relaxing until bfd_relax_section gives up. */ | |
5657 | bfd_boolean relax_again; | |
5658 | ||
5659 | do | |
5660 | { | |
329c1c86 | 5661 | relax_again = FALSE; |
fbbc3759 L |
5662 | |
5663 | /* Note: pe-dll.c does something like this also. If you find | |
5664 | you need to change this code, you probably need to change | |
5665 | pe-dll.c also. DJ */ | |
5666 | ||
5667 | /* Do all the assignments with our current guesses as to | |
5668 | section sizes. */ | |
5669 | lang_do_assignments (); | |
5670 | ||
5671 | /* We must do this after lang_do_assignments, because it uses | |
5672 | size. */ | |
5673 | lang_reset_memory_regions (); | |
5674 | ||
5675 | /* Perform another relax pass - this time we know where the | |
5676 | globals are, so can make a better guess. */ | |
5677 | lang_size_sections (&relax_again, FALSE); | |
5678 | } | |
5679 | while (relax_again); | |
5680 | } | |
5681 | ||
252b5132 | 5682 | void |
1579bae1 | 5683 | lang_process (void) |
252b5132 | 5684 | { |
55255dae | 5685 | /* Finalize dynamic list. */ |
40b36307 L |
5686 | if (link_info.dynamic_list) |
5687 | lang_finalize_version_expr_head (&link_info.dynamic_list->head); | |
55255dae | 5688 | |
252b5132 RH |
5689 | current_target = default_target; |
5690 | ||
08da4cac KH |
5691 | /* Open the output file. */ |
5692 | lang_for_each_statement (ldlang_open_output); | |
e5caa5e0 | 5693 | init_opb (); |
252b5132 RH |
5694 | |
5695 | ldemul_create_output_section_statements (); | |
5696 | ||
08da4cac | 5697 | /* Add to the hash table all undefineds on the command line. */ |
252b5132 RH |
5698 | lang_place_undefineds (); |
5699 | ||
082b7297 L |
5700 | if (!bfd_section_already_linked_table_init ()) |
5701 | einfo (_("%P%F: Failed to create hash table\n")); | |
9503fd87 | 5702 | |
08da4cac | 5703 | /* Create a bfd for each input file. */ |
252b5132 | 5704 | current_target = default_target; |
b34976b6 | 5705 | open_input_bfds (statement_list.head, FALSE); |
252b5132 | 5706 | |
e3e942e9 AM |
5707 | link_info.gc_sym_list = &entry_symbol; |
5708 | if (entry_symbol.name == NULL) | |
5709 | link_info.gc_sym_list = ldlang_undef_chain_list_head; | |
5710 | ||
252b5132 RH |
5711 | ldemul_after_open (); |
5712 | ||
082b7297 | 5713 | bfd_section_already_linked_table_free (); |
9503fd87 | 5714 | |
252b5132 RH |
5715 | /* Make sure that we're not mixing architectures. We call this |
5716 | after all the input files have been opened, but before we do any | |
5717 | other processing, so that any operations merge_private_bfd_data | |
5718 | does on the output file will be known during the rest of the | |
5719 | link. */ | |
5720 | lang_check (); | |
5721 | ||
5722 | /* Handle .exports instead of a version script if we're told to do so. */ | |
5723 | if (command_line.version_exports_section) | |
5724 | lang_do_version_exports_section (); | |
5725 | ||
5726 | /* Build all sets based on the information gathered from the input | |
5727 | files. */ | |
5728 | ldctor_build_sets (); | |
5729 | ||
5730 | /* Remove unreferenced sections if asked to. */ | |
164e712d | 5731 | lang_gc_sections (); |
252b5132 | 5732 | |
08da4cac | 5733 | /* Size up the common data. */ |
252b5132 RH |
5734 | lang_common (); |
5735 | ||
bcaa7b3e L |
5736 | /* Update wild statements. */ |
5737 | update_wild_statements (statement_list.head); | |
5738 | ||
252b5132 | 5739 | /* Run through the contours of the script and attach input sections |
08da4cac | 5740 | to the correct output sections. */ |
1579bae1 | 5741 | map_input_to_output_sections (statement_list.head, NULL, NULL); |
252b5132 | 5742 | |
08da4cac | 5743 | /* Find any sections not attached explicitly and handle them. */ |
252b5132 RH |
5744 | lang_place_orphans (); |
5745 | ||
1049f94e | 5746 | if (! link_info.relocatable) |
862120bd | 5747 | { |
57ceae94 AM |
5748 | asection *found; |
5749 | ||
5750 | /* Merge SEC_MERGE sections. This has to be done after GC of | |
5751 | sections, so that GCed sections are not merged, but before | |
5752 | assigning dynamic symbols, since removing whole input sections | |
5753 | is hard then. */ | |
5754 | bfd_merge_sections (output_bfd, &link_info); | |
5755 | ||
862120bd | 5756 | /* Look for a text section and set the readonly attribute in it. */ |
57ceae94 | 5757 | found = bfd_get_section_by_name (output_bfd, ".text"); |
862120bd | 5758 | |
1579bae1 | 5759 | if (found != NULL) |
862120bd AM |
5760 | { |
5761 | if (config.text_read_only) | |
5762 | found->flags |= SEC_READONLY; | |
5763 | else | |
5764 | found->flags &= ~SEC_READONLY; | |
5765 | } | |
5766 | } | |
5767 | ||
5768 | /* Do anything special before sizing sections. This is where ELF | |
5769 | and other back-ends size dynamic sections. */ | |
252b5132 RH |
5770 | ldemul_before_allocation (); |
5771 | ||
5772 | /* We must record the program headers before we try to fix the | |
5773 | section positions, since they will affect SIZEOF_HEADERS. */ | |
5774 | lang_record_phdrs (); | |
5775 | ||
b3327aad | 5776 | /* Size up the sections. */ |
e9ee469a | 5777 | lang_size_sections (NULL, !command_line.relax); |
b3327aad | 5778 | |
08da4cac | 5779 | /* Now run around and relax if we can. */ |
252b5132 RH |
5780 | if (command_line.relax) |
5781 | { | |
fbbc3759 L |
5782 | /* We may need more than one relaxation pass. */ |
5783 | int i = link_info.relax_pass; | |
252b5132 | 5784 | |
fbbc3759 L |
5785 | /* The backend can use it to determine the current pass. */ |
5786 | link_info.relax_pass = 0; | |
252b5132 | 5787 | |
fbbc3759 L |
5788 | while (i--) |
5789 | { | |
5790 | relax_sections (); | |
5791 | link_info.relax_pass++; | |
252b5132 | 5792 | } |
cf888e70 NC |
5793 | |
5794 | /* Final extra sizing to report errors. */ | |
e9ee469a | 5795 | lang_do_assignments (); |
5a46fe39 | 5796 | lang_reset_memory_regions (); |
e9ee469a | 5797 | lang_size_sections (NULL, TRUE); |
252b5132 | 5798 | } |
252b5132 RH |
5799 | |
5800 | /* See if anything special should be done now we know how big | |
5801 | everything is. */ | |
5802 | ldemul_after_allocation (); | |
5803 | ||
5804 | /* Fix any .startof. or .sizeof. symbols. */ | |
5805 | lang_set_startof (); | |
5806 | ||
08da4cac KH |
5807 | /* Do all the assignments, now that we know the final resting places |
5808 | of all the symbols. */ | |
252b5132 | 5809 | |
e9ee469a | 5810 | lang_do_assignments (); |
252b5132 | 5811 | |
8ded5a0f AM |
5812 | ldemul_finish (); |
5813 | ||
252b5132 | 5814 | /* Make sure that the section addresses make sense. */ |
1049f94e | 5815 | if (! link_info.relocatable |
252b5132 RH |
5816 | && command_line.check_section_addresses) |
5817 | lang_check_section_addresses (); | |
5f992e62 | 5818 | |
750877ba | 5819 | lang_end (); |
252b5132 RH |
5820 | } |
5821 | ||
5822 | /* EXPORTED TO YACC */ | |
5823 | ||
5824 | void | |
1579bae1 AM |
5825 | lang_add_wild (struct wildcard_spec *filespec, |
5826 | struct wildcard_list *section_list, | |
5827 | bfd_boolean keep_sections) | |
252b5132 | 5828 | { |
b6bf44ba AM |
5829 | struct wildcard_list *curr, *next; |
5830 | lang_wild_statement_type *new; | |
5831 | ||
5832 | /* Reverse the list as the parser puts it back to front. */ | |
5833 | for (curr = section_list, section_list = NULL; | |
5834 | curr != NULL; | |
5835 | section_list = curr, curr = next) | |
5836 | { | |
5837 | if (curr->spec.name != NULL && strcmp (curr->spec.name, "COMMON") == 0) | |
b34976b6 | 5838 | placed_commons = TRUE; |
252b5132 | 5839 | |
b6bf44ba AM |
5840 | next = curr->next; |
5841 | curr->next = section_list; | |
5842 | } | |
5843 | ||
5844 | if (filespec != NULL && filespec->name != NULL) | |
252b5132 | 5845 | { |
b6bf44ba AM |
5846 | if (strcmp (filespec->name, "*") == 0) |
5847 | filespec->name = NULL; | |
5848 | else if (! wildcardp (filespec->name)) | |
b34976b6 | 5849 | lang_has_input_file = TRUE; |
252b5132 | 5850 | } |
b6bf44ba AM |
5851 | |
5852 | new = new_stat (lang_wild_statement, stat_ptr); | |
5853 | new->filename = NULL; | |
b34976b6 | 5854 | new->filenames_sorted = FALSE; |
b6bf44ba | 5855 | if (filespec != NULL) |
252b5132 | 5856 | { |
b6bf44ba | 5857 | new->filename = filespec->name; |
bcaa7b3e | 5858 | new->filenames_sorted = filespec->sorted == by_name; |
252b5132 | 5859 | } |
b6bf44ba | 5860 | new->section_list = section_list; |
252b5132 | 5861 | new->keep_sections = keep_sections; |
252b5132 | 5862 | lang_list_init (&new->children); |
72223188 | 5863 | analyze_walk_wild_section_handler (new); |
252b5132 RH |
5864 | } |
5865 | ||
5866 | void | |
ba916c8a MM |
5867 | lang_section_start (const char *name, etree_type *address, |
5868 | const segment_type *segment) | |
252b5132 | 5869 | { |
d1778b88 | 5870 | lang_address_statement_type *ad; |
252b5132 | 5871 | |
d1778b88 | 5872 | ad = new_stat (lang_address_statement, stat_ptr); |
252b5132 RH |
5873 | ad->section_name = name; |
5874 | ad->address = address; | |
ba916c8a | 5875 | ad->segment = segment; |
252b5132 RH |
5876 | } |
5877 | ||
5878 | /* Set the start symbol to NAME. CMDLINE is nonzero if this is called | |
5879 | because of a -e argument on the command line, or zero if this is | |
5880 | called by ENTRY in a linker script. Command line arguments take | |
5881 | precedence. */ | |
5882 | ||
5883 | void | |
1579bae1 | 5884 | lang_add_entry (const char *name, bfd_boolean cmdline) |
252b5132 | 5885 | { |
e3e942e9 | 5886 | if (entry_symbol.name == NULL |
252b5132 RH |
5887 | || cmdline |
5888 | || ! entry_from_cmdline) | |
5889 | { | |
e3e942e9 | 5890 | entry_symbol.name = name; |
252b5132 RH |
5891 | entry_from_cmdline = cmdline; |
5892 | } | |
5893 | } | |
5894 | ||
a359509e ZW |
5895 | /* Set the default start symbol to NAME. .em files should use this, |
5896 | not lang_add_entry, to override the use of "start" if neither the | |
5897 | linker script nor the command line specifies an entry point. NAME | |
5898 | must be permanently allocated. */ | |
5899 | void | |
5900 | lang_default_entry (const char *name) | |
5901 | { | |
5902 | entry_symbol_default = name; | |
5903 | } | |
5904 | ||
252b5132 | 5905 | void |
1579bae1 | 5906 | lang_add_target (const char *name) |
252b5132 | 5907 | { |
bd4d42c1 | 5908 | lang_target_statement_type *new; |
252b5132 | 5909 | |
bd4d42c1 | 5910 | new = new_stat (lang_target_statement, stat_ptr); |
252b5132 | 5911 | new->target = name; |
252b5132 RH |
5912 | } |
5913 | ||
5914 | void | |
1579bae1 | 5915 | lang_add_map (const char *name) |
252b5132 RH |
5916 | { |
5917 | while (*name) | |
5918 | { | |
5919 | switch (*name) | |
5920 | { | |
08da4cac | 5921 | case 'F': |
b34976b6 | 5922 | map_option_f = TRUE; |
252b5132 RH |
5923 | break; |
5924 | } | |
5925 | name++; | |
5926 | } | |
5927 | } | |
5928 | ||
5929 | void | |
1579bae1 | 5930 | lang_add_fill (fill_type *fill) |
252b5132 | 5931 | { |
bd4d42c1 | 5932 | lang_fill_statement_type *new; |
252b5132 | 5933 | |
bd4d42c1 | 5934 | new = new_stat (lang_fill_statement, stat_ptr); |
2c382fb6 | 5935 | new->fill = fill; |
252b5132 RH |
5936 | } |
5937 | ||
5938 | void | |
1579bae1 | 5939 | lang_add_data (int type, union etree_union *exp) |
252b5132 | 5940 | { |
bd4d42c1 | 5941 | lang_data_statement_type *new; |
252b5132 | 5942 | |
bd4d42c1 | 5943 | new = new_stat (lang_data_statement, stat_ptr); |
252b5132 RH |
5944 | new->exp = exp; |
5945 | new->type = type; | |
252b5132 RH |
5946 | } |
5947 | ||
5948 | /* Create a new reloc statement. RELOC is the BFD relocation type to | |
5949 | generate. HOWTO is the corresponding howto structure (we could | |
5950 | look this up, but the caller has already done so). SECTION is the | |
5951 | section to generate a reloc against, or NAME is the name of the | |
5952 | symbol to generate a reloc against. Exactly one of SECTION and | |
5953 | NAME must be NULL. ADDEND is an expression for the addend. */ | |
5954 | ||
5955 | void | |
1579bae1 AM |
5956 | lang_add_reloc (bfd_reloc_code_real_type reloc, |
5957 | reloc_howto_type *howto, | |
5958 | asection *section, | |
5959 | const char *name, | |
5960 | union etree_union *addend) | |
252b5132 RH |
5961 | { |
5962 | lang_reloc_statement_type *p = new_stat (lang_reloc_statement, stat_ptr); | |
5f992e62 | 5963 | |
252b5132 RH |
5964 | p->reloc = reloc; |
5965 | p->howto = howto; | |
5966 | p->section = section; | |
5967 | p->name = name; | |
5968 | p->addend_exp = addend; | |
5969 | ||
5970 | p->addend_value = 0; | |
5971 | p->output_section = NULL; | |
7fabd029 | 5972 | p->output_offset = 0; |
252b5132 RH |
5973 | } |
5974 | ||
5975 | lang_assignment_statement_type * | |
1579bae1 | 5976 | lang_add_assignment (etree_type *exp) |
252b5132 | 5977 | { |
bd4d42c1 | 5978 | lang_assignment_statement_type *new; |
252b5132 | 5979 | |
bd4d42c1 | 5980 | new = new_stat (lang_assignment_statement, stat_ptr); |
252b5132 RH |
5981 | new->exp = exp; |
5982 | return new; | |
5983 | } | |
5984 | ||
5985 | void | |
1579bae1 | 5986 | lang_add_attribute (enum statement_enum attribute) |
252b5132 | 5987 | { |
bd4d42c1 | 5988 | new_statement (attribute, sizeof (lang_statement_header_type), stat_ptr); |
252b5132 RH |
5989 | } |
5990 | ||
5991 | void | |
1579bae1 | 5992 | lang_startup (const char *name) |
252b5132 | 5993 | { |
1579bae1 | 5994 | if (startup_file != NULL) |
252b5132 | 5995 | { |
4520f868 | 5996 | einfo (_("%P%F: multiple STARTUP files\n")); |
252b5132 RH |
5997 | } |
5998 | first_file->filename = name; | |
5999 | first_file->local_sym_name = name; | |
b34976b6 | 6000 | first_file->real = TRUE; |
252b5132 RH |
6001 | |
6002 | startup_file = name; | |
6003 | } | |
6004 | ||
6005 | void | |
1579bae1 | 6006 | lang_float (bfd_boolean maybe) |
252b5132 RH |
6007 | { |
6008 | lang_float_flag = maybe; | |
6009 | } | |
6010 | ||
ee3cc2e2 RS |
6011 | |
6012 | /* Work out the load- and run-time regions from a script statement, and | |
6013 | store them in *LMA_REGION and *REGION respectively. | |
6014 | ||
a747ee4d NC |
6015 | MEMSPEC is the name of the run-time region, or the value of |
6016 | DEFAULT_MEMORY_REGION if the statement didn't specify one. | |
6017 | LMA_MEMSPEC is the name of the load-time region, or null if the | |
6018 | statement didn't specify one.HAVE_LMA_P is TRUE if the statement | |
6019 | had an explicit load address. | |
ee3cc2e2 RS |
6020 | |
6021 | It is an error to specify both a load region and a load address. */ | |
6022 | ||
6023 | static void | |
6bdafbeb NC |
6024 | lang_get_regions (lang_memory_region_type **region, |
6025 | lang_memory_region_type **lma_region, | |
1579bae1 AM |
6026 | const char *memspec, |
6027 | const char *lma_memspec, | |
6bdafbeb NC |
6028 | bfd_boolean have_lma, |
6029 | bfd_boolean have_vma) | |
ee3cc2e2 | 6030 | { |
a747ee4d | 6031 | *lma_region = lang_memory_region_lookup (lma_memspec, FALSE); |
ee3cc2e2 | 6032 | |
6feb9908 AM |
6033 | /* If no runtime region or VMA has been specified, but the load region |
6034 | has been specified, then use the load region for the runtime region | |
6035 | as well. */ | |
6bdafbeb NC |
6036 | if (lma_memspec != NULL |
6037 | && ! have_vma | |
6038 | && strcmp (memspec, DEFAULT_MEMORY_REGION) == 0) | |
ee3cc2e2 RS |
6039 | *region = *lma_region; |
6040 | else | |
a747ee4d | 6041 | *region = lang_memory_region_lookup (memspec, FALSE); |
ee3cc2e2 | 6042 | |
6bdafbeb | 6043 | if (have_lma && lma_memspec != 0) |
ee3cc2e2 RS |
6044 | einfo (_("%X%P:%S: section has both a load address and a load region\n")); |
6045 | } | |
6046 | ||
252b5132 | 6047 | void |
6bdafbeb NC |
6048 | lang_leave_output_section_statement (fill_type *fill, const char *memspec, |
6049 | lang_output_section_phdr_list *phdrs, | |
6050 | const char *lma_memspec) | |
252b5132 | 6051 | { |
ee3cc2e2 RS |
6052 | lang_get_regions (¤t_section->region, |
6053 | ¤t_section->lma_region, | |
6054 | memspec, lma_memspec, | |
6bdafbeb NC |
6055 | current_section->load_base != NULL, |
6056 | current_section->addr_tree != NULL); | |
252b5132 | 6057 | current_section->fill = fill; |
252b5132 RH |
6058 | current_section->phdrs = phdrs; |
6059 | stat_ptr = &statement_list; | |
6060 | } | |
6061 | ||
08da4cac KH |
6062 | /* Create an absolute symbol with the given name with the value of the |
6063 | address of first byte of the section named. | |
6064 | ||
6065 | If the symbol already exists, then do nothing. */ | |
252b5132 | 6066 | |
252b5132 | 6067 | void |
1579bae1 | 6068 | lang_abs_symbol_at_beginning_of (const char *secname, const char *name) |
252b5132 RH |
6069 | { |
6070 | struct bfd_link_hash_entry *h; | |
6071 | ||
b34976b6 | 6072 | h = bfd_link_hash_lookup (link_info.hash, name, TRUE, TRUE, TRUE); |
1579bae1 | 6073 | if (h == NULL) |
252b5132 RH |
6074 | einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n")); |
6075 | ||
6076 | if (h->type == bfd_link_hash_new | |
6077 | || h->type == bfd_link_hash_undefined) | |
6078 | { | |
6079 | asection *sec; | |
6080 | ||
6081 | h->type = bfd_link_hash_defined; | |
6082 | ||
6083 | sec = bfd_get_section_by_name (output_bfd, secname); | |
1579bae1 | 6084 | if (sec == NULL) |
252b5132 RH |
6085 | h->u.def.value = 0; |
6086 | else | |
6087 | h->u.def.value = bfd_get_section_vma (output_bfd, sec); | |
6088 | ||
6089 | h->u.def.section = bfd_abs_section_ptr; | |
6090 | } | |
6091 | } | |
6092 | ||
08da4cac KH |
6093 | /* Create an absolute symbol with the given name with the value of the |
6094 | address of the first byte after the end of the section named. | |
6095 | ||
6096 | If the symbol already exists, then do nothing. */ | |
252b5132 | 6097 | |
252b5132 | 6098 | void |
1579bae1 | 6099 | lang_abs_symbol_at_end_of (const char *secname, const char *name) |
252b5132 RH |
6100 | { |
6101 | struct bfd_link_hash_entry *h; | |
6102 | ||
b34976b6 | 6103 | h = bfd_link_hash_lookup (link_info.hash, name, TRUE, TRUE, TRUE); |
1579bae1 | 6104 | if (h == NULL) |
252b5132 RH |
6105 | einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n")); |
6106 | ||
6107 | if (h->type == bfd_link_hash_new | |
6108 | || h->type == bfd_link_hash_undefined) | |
6109 | { | |
6110 | asection *sec; | |
6111 | ||
6112 | h->type = bfd_link_hash_defined; | |
6113 | ||
6114 | sec = bfd_get_section_by_name (output_bfd, secname); | |
1579bae1 | 6115 | if (sec == NULL) |
252b5132 RH |
6116 | h->u.def.value = 0; |
6117 | else | |
6118 | h->u.def.value = (bfd_get_section_vma (output_bfd, sec) | |
eea6121a | 6119 | + TO_ADDR (sec->size)); |
252b5132 RH |
6120 | |
6121 | h->u.def.section = bfd_abs_section_ptr; | |
6122 | } | |
6123 | } | |
6124 | ||
6125 | void | |
1579bae1 AM |
6126 | lang_statement_append (lang_statement_list_type *list, |
6127 | lang_statement_union_type *element, | |
6128 | lang_statement_union_type **field) | |
252b5132 RH |
6129 | { |
6130 | *(list->tail) = element; | |
6131 | list->tail = field; | |
6132 | } | |
6133 | ||
6134 | /* Set the output format type. -oformat overrides scripts. */ | |
6135 | ||
6136 | void | |
1579bae1 AM |
6137 | lang_add_output_format (const char *format, |
6138 | const char *big, | |
6139 | const char *little, | |
6140 | int from_script) | |
252b5132 RH |
6141 | { |
6142 | if (output_target == NULL || !from_script) | |
6143 | { | |
6144 | if (command_line.endian == ENDIAN_BIG | |
6145 | && big != NULL) | |
6146 | format = big; | |
6147 | else if (command_line.endian == ENDIAN_LITTLE | |
6148 | && little != NULL) | |
6149 | format = little; | |
6150 | ||
6151 | output_target = format; | |
6152 | } | |
6153 | } | |
6154 | ||
6155 | /* Enter a group. This creates a new lang_group_statement, and sets | |
6156 | stat_ptr to build new statements within the group. */ | |
6157 | ||
6158 | void | |
1579bae1 | 6159 | lang_enter_group (void) |
252b5132 RH |
6160 | { |
6161 | lang_group_statement_type *g; | |
6162 | ||
6163 | g = new_stat (lang_group_statement, stat_ptr); | |
6164 | lang_list_init (&g->children); | |
6165 | stat_ptr = &g->children; | |
6166 | } | |
6167 | ||
6168 | /* Leave a group. This just resets stat_ptr to start writing to the | |
6169 | regular list of statements again. Note that this will not work if | |
6170 | groups can occur inside anything else which can adjust stat_ptr, | |
6171 | but currently they can't. */ | |
6172 | ||
6173 | void | |
1579bae1 | 6174 | lang_leave_group (void) |
252b5132 RH |
6175 | { |
6176 | stat_ptr = &statement_list; | |
6177 | } | |
6178 | ||
6179 | /* Add a new program header. This is called for each entry in a PHDRS | |
6180 | command in a linker script. */ | |
6181 | ||
6182 | void | |
1579bae1 AM |
6183 | lang_new_phdr (const char *name, |
6184 | etree_type *type, | |
6185 | bfd_boolean filehdr, | |
6186 | bfd_boolean phdrs, | |
6187 | etree_type *at, | |
6188 | etree_type *flags) | |
252b5132 RH |
6189 | { |
6190 | struct lang_phdr *n, **pp; | |
6191 | ||
1579bae1 | 6192 | n = stat_alloc (sizeof (struct lang_phdr)); |
252b5132 RH |
6193 | n->next = NULL; |
6194 | n->name = name; | |
e9ee469a | 6195 | n->type = exp_get_value_int (type, 0, "program header type"); |
252b5132 RH |
6196 | n->filehdr = filehdr; |
6197 | n->phdrs = phdrs; | |
6198 | n->at = at; | |
6199 | n->flags = flags; | |
6200 | ||
6201 | for (pp = &lang_phdr_list; *pp != NULL; pp = &(*pp)->next) | |
6202 | ; | |
6203 | *pp = n; | |
6204 | } | |
6205 | ||
6206 | /* Record the program header information in the output BFD. FIXME: We | |
6207 | should not be calling an ELF specific function here. */ | |
6208 | ||
6209 | static void | |
1579bae1 | 6210 | lang_record_phdrs (void) |
252b5132 RH |
6211 | { |
6212 | unsigned int alc; | |
6213 | asection **secs; | |
6bdafbeb | 6214 | lang_output_section_phdr_list *last; |
252b5132 | 6215 | struct lang_phdr *l; |
afd7a018 | 6216 | lang_output_section_statement_type *os; |
252b5132 RH |
6217 | |
6218 | alc = 10; | |
1579bae1 | 6219 | secs = xmalloc (alc * sizeof (asection *)); |
252b5132 | 6220 | last = NULL; |
591a748a | 6221 | |
252b5132 RH |
6222 | for (l = lang_phdr_list; l != NULL; l = l->next) |
6223 | { | |
6224 | unsigned int c; | |
6225 | flagword flags; | |
6226 | bfd_vma at; | |
6227 | ||
6228 | c = 0; | |
afd7a018 AM |
6229 | for (os = &lang_output_section_statement.head->output_section_statement; |
6230 | os != NULL; | |
6231 | os = os->next) | |
252b5132 | 6232 | { |
6bdafbeb | 6233 | lang_output_section_phdr_list *pl; |
252b5132 | 6234 | |
0841712e JJ |
6235 | if (os->constraint == -1) |
6236 | continue; | |
252b5132 RH |
6237 | |
6238 | pl = os->phdrs; | |
6239 | if (pl != NULL) | |
6240 | last = pl; | |
6241 | else | |
6242 | { | |
6243 | if (os->sectype == noload_section | |
6244 | || os->bfd_section == NULL | |
6245 | || (os->bfd_section->flags & SEC_ALLOC) == 0) | |
6246 | continue; | |
591a748a NC |
6247 | |
6248 | if (last) | |
6249 | pl = last; | |
6250 | else | |
6251 | { | |
6252 | lang_output_section_statement_type * tmp_os; | |
6253 | ||
6254 | /* If we have not run across a section with a program | |
6255 | header assigned to it yet, then scan forwards to find | |
6256 | one. This prevents inconsistencies in the linker's | |
6257 | behaviour when a script has specified just a single | |
6258 | header and there are sections in that script which are | |
6259 | not assigned to it, and which occur before the first | |
6260 | use of that header. See here for more details: | |
6261 | http://sourceware.org/ml/binutils/2007-02/msg00291.html */ | |
6262 | for (tmp_os = os; tmp_os; tmp_os = tmp_os->next) | |
6263 | if (tmp_os->phdrs) | |
6264 | break; | |
6265 | pl = tmp_os->phdrs; | |
6266 | } | |
252b5132 RH |
6267 | } |
6268 | ||
6269 | if (os->bfd_section == NULL) | |
6270 | continue; | |
6271 | ||
6272 | for (; pl != NULL; pl = pl->next) | |
6273 | { | |
6274 | if (strcmp (pl->name, l->name) == 0) | |
6275 | { | |
6276 | if (c >= alc) | |
6277 | { | |
6278 | alc *= 2; | |
1579bae1 | 6279 | secs = xrealloc (secs, alc * sizeof (asection *)); |
252b5132 RH |
6280 | } |
6281 | secs[c] = os->bfd_section; | |
6282 | ++c; | |
b34976b6 | 6283 | pl->used = TRUE; |
252b5132 RH |
6284 | } |
6285 | } | |
6286 | } | |
6287 | ||
6288 | if (l->flags == NULL) | |
6289 | flags = 0; | |
6290 | else | |
e9ee469a | 6291 | flags = exp_get_vma (l->flags, 0, "phdr flags"); |
252b5132 RH |
6292 | |
6293 | if (l->at == NULL) | |
6294 | at = 0; | |
6295 | else | |
e9ee469a | 6296 | at = exp_get_vma (l->at, 0, "phdr load address"); |
252b5132 RH |
6297 | |
6298 | if (! bfd_record_phdr (output_bfd, l->type, | |
d1778b88 | 6299 | l->flags != NULL, flags, l->at != NULL, |
252b5132 RH |
6300 | at, l->filehdr, l->phdrs, c, secs)) |
6301 | einfo (_("%F%P: bfd_record_phdr failed: %E\n")); | |
6302 | } | |
6303 | ||
6304 | free (secs); | |
6305 | ||
6306 | /* Make sure all the phdr assignments succeeded. */ | |
afd7a018 AM |
6307 | for (os = &lang_output_section_statement.head->output_section_statement; |
6308 | os != NULL; | |
6309 | os = os->next) | |
252b5132 | 6310 | { |
6bdafbeb | 6311 | lang_output_section_phdr_list *pl; |
252b5132 | 6312 | |
afd7a018 AM |
6313 | if (os->constraint == -1 |
6314 | || os->bfd_section == NULL) | |
252b5132 RH |
6315 | continue; |
6316 | ||
afd7a018 | 6317 | for (pl = os->phdrs; |
252b5132 RH |
6318 | pl != NULL; |
6319 | pl = pl->next) | |
6320 | if (! pl->used && strcmp (pl->name, "NONE") != 0) | |
6321 | einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"), | |
afd7a018 | 6322 | os->name, pl->name); |
252b5132 RH |
6323 | } |
6324 | } | |
6325 | ||
6326 | /* Record a list of sections which may not be cross referenced. */ | |
6327 | ||
6328 | void | |
6bdafbeb | 6329 | lang_add_nocrossref (lang_nocrossref_type *l) |
252b5132 RH |
6330 | { |
6331 | struct lang_nocrossrefs *n; | |
6332 | ||
1579bae1 | 6333 | n = xmalloc (sizeof *n); |
252b5132 RH |
6334 | n->next = nocrossref_list; |
6335 | n->list = l; | |
6336 | nocrossref_list = n; | |
6337 | ||
6338 | /* Set notice_all so that we get informed about all symbols. */ | |
b34976b6 | 6339 | link_info.notice_all = TRUE; |
252b5132 RH |
6340 | } |
6341 | \f | |
6342 | /* Overlay handling. We handle overlays with some static variables. */ | |
6343 | ||
6344 | /* The overlay virtual address. */ | |
6345 | static etree_type *overlay_vma; | |
7e7d5768 AM |
6346 | /* And subsection alignment. */ |
6347 | static etree_type *overlay_subalign; | |
252b5132 | 6348 | |
252b5132 RH |
6349 | /* An expression for the maximum section size seen so far. */ |
6350 | static etree_type *overlay_max; | |
6351 | ||
6352 | /* A list of all the sections in this overlay. */ | |
6353 | ||
89cdebba | 6354 | struct overlay_list { |
252b5132 RH |
6355 | struct overlay_list *next; |
6356 | lang_output_section_statement_type *os; | |
6357 | }; | |
6358 | ||
6359 | static struct overlay_list *overlay_list; | |
6360 | ||
6361 | /* Start handling an overlay. */ | |
6362 | ||
6363 | void | |
7e7d5768 | 6364 | lang_enter_overlay (etree_type *vma_expr, etree_type *subalign) |
252b5132 RH |
6365 | { |
6366 | /* The grammar should prevent nested overlays from occurring. */ | |
7e7d5768 AM |
6367 | ASSERT (overlay_vma == NULL |
6368 | && overlay_subalign == NULL | |
6369 | && overlay_max == NULL); | |
252b5132 RH |
6370 | |
6371 | overlay_vma = vma_expr; | |
7e7d5768 | 6372 | overlay_subalign = subalign; |
252b5132 RH |
6373 | } |
6374 | ||
6375 | /* Start a section in an overlay. We handle this by calling | |
9f88b410 RS |
6376 | lang_enter_output_section_statement with the correct VMA. |
6377 | lang_leave_overlay sets up the LMA and memory regions. */ | |
252b5132 RH |
6378 | |
6379 | void | |
1579bae1 | 6380 | lang_enter_overlay_section (const char *name) |
252b5132 RH |
6381 | { |
6382 | struct overlay_list *n; | |
6383 | etree_type *size; | |
6384 | ||
6385 | lang_enter_output_section_statement (name, overlay_vma, normal_section, | |
0841712e | 6386 | 0, overlay_subalign, 0, 0); |
252b5132 | 6387 | |
9f88b410 | 6388 | /* If this is the first section, then base the VMA of future |
252b5132 RH |
6389 | sections on this one. This will work correctly even if `.' is |
6390 | used in the addresses. */ | |
6391 | if (overlay_list == NULL) | |
9f88b410 | 6392 | overlay_vma = exp_nameop (ADDR, name); |
252b5132 RH |
6393 | |
6394 | /* Remember the section. */ | |
1579bae1 | 6395 | n = xmalloc (sizeof *n); |
252b5132 RH |
6396 | n->os = current_section; |
6397 | n->next = overlay_list; | |
6398 | overlay_list = n; | |
6399 | ||
6400 | size = exp_nameop (SIZEOF, name); | |
6401 | ||
252b5132 RH |
6402 | /* Arrange to work out the maximum section end address. */ |
6403 | if (overlay_max == NULL) | |
6404 | overlay_max = size; | |
6405 | else | |
6406 | overlay_max = exp_binop (MAX_K, overlay_max, size); | |
6407 | } | |
6408 | ||
6409 | /* Finish a section in an overlay. There isn't any special to do | |
6410 | here. */ | |
6411 | ||
6412 | void | |
1579bae1 | 6413 | lang_leave_overlay_section (fill_type *fill, |
6bdafbeb | 6414 | lang_output_section_phdr_list *phdrs) |
252b5132 RH |
6415 | { |
6416 | const char *name; | |
6417 | char *clean, *s2; | |
6418 | const char *s1; | |
6419 | char *buf; | |
6420 | ||
6421 | name = current_section->name; | |
6422 | ||
a747ee4d NC |
6423 | /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory |
6424 | region and that no load-time region has been specified. It doesn't | |
6425 | really matter what we say here, since lang_leave_overlay will | |
6426 | override it. */ | |
6427 | lang_leave_output_section_statement (fill, DEFAULT_MEMORY_REGION, phdrs, 0); | |
252b5132 RH |
6428 | |
6429 | /* Define the magic symbols. */ | |
6430 | ||
6431 | clean = xmalloc (strlen (name) + 1); | |
6432 | s2 = clean; | |
6433 | for (s1 = name; *s1 != '\0'; s1++) | |
3882b010 | 6434 | if (ISALNUM (*s1) || *s1 == '_') |
252b5132 RH |
6435 | *s2++ = *s1; |
6436 | *s2 = '\0'; | |
6437 | ||
6438 | buf = xmalloc (strlen (clean) + sizeof "__load_start_"); | |
6439 | sprintf (buf, "__load_start_%s", clean); | |
34711ca3 AM |
6440 | lang_add_assignment (exp_provide (buf, |
6441 | exp_nameop (LOADADDR, name), | |
6442 | FALSE)); | |
252b5132 RH |
6443 | |
6444 | buf = xmalloc (strlen (clean) + sizeof "__load_stop_"); | |
6445 | sprintf (buf, "__load_stop_%s", clean); | |
34711ca3 AM |
6446 | lang_add_assignment (exp_provide (buf, |
6447 | exp_binop ('+', | |
6448 | exp_nameop (LOADADDR, name), | |
6449 | exp_nameop (SIZEOF, name)), | |
6450 | FALSE)); | |
252b5132 RH |
6451 | |
6452 | free (clean); | |
6453 | } | |
6454 | ||
6455 | /* Finish an overlay. If there are any overlay wide settings, this | |
6456 | looks through all the sections in the overlay and sets them. */ | |
6457 | ||
6458 | void | |
1579bae1 AM |
6459 | lang_leave_overlay (etree_type *lma_expr, |
6460 | int nocrossrefs, | |
6461 | fill_type *fill, | |
6462 | const char *memspec, | |
6bdafbeb | 6463 | lang_output_section_phdr_list *phdrs, |
1579bae1 | 6464 | const char *lma_memspec) |
252b5132 RH |
6465 | { |
6466 | lang_memory_region_type *region; | |
562d3460 | 6467 | lang_memory_region_type *lma_region; |
252b5132 | 6468 | struct overlay_list *l; |
6bdafbeb | 6469 | lang_nocrossref_type *nocrossref; |
252b5132 | 6470 | |
ee3cc2e2 RS |
6471 | lang_get_regions (®ion, &lma_region, |
6472 | memspec, lma_memspec, | |
6bdafbeb | 6473 | lma_expr != NULL, FALSE); |
562d3460 | 6474 | |
252b5132 RH |
6475 | nocrossref = NULL; |
6476 | ||
9f88b410 RS |
6477 | /* After setting the size of the last section, set '.' to end of the |
6478 | overlay region. */ | |
6479 | if (overlay_list != NULL) | |
6480 | overlay_list->os->update_dot_tree | |
6481 | = exp_assop ('=', ".", exp_binop ('+', overlay_vma, overlay_max)); | |
6482 | ||
252b5132 RH |
6483 | l = overlay_list; |
6484 | while (l != NULL) | |
6485 | { | |
6486 | struct overlay_list *next; | |
6487 | ||
1579bae1 | 6488 | if (fill != NULL && l->os->fill == NULL) |
252b5132 | 6489 | l->os->fill = fill; |
1545243b | 6490 | |
9f88b410 RS |
6491 | l->os->region = region; |
6492 | l->os->lma_region = lma_region; | |
6493 | ||
6494 | /* The first section has the load address specified in the | |
6495 | OVERLAY statement. The rest are worked out from that. | |
6496 | The base address is not needed (and should be null) if | |
6497 | an LMA region was specified. */ | |
6498 | if (l->next == 0) | |
6499 | l->os->load_base = lma_expr; | |
252b5132 RH |
6500 | if (phdrs != NULL && l->os->phdrs == NULL) |
6501 | l->os->phdrs = phdrs; | |
6502 | ||
9f88b410 | 6503 | if (nocrossrefs) |
252b5132 | 6504 | { |
6bdafbeb | 6505 | lang_nocrossref_type *nc; |
252b5132 | 6506 | |
1579bae1 | 6507 | nc = xmalloc (sizeof *nc); |
252b5132 RH |
6508 | nc->name = l->os->name; |
6509 | nc->next = nocrossref; | |
6510 | nocrossref = nc; | |
6511 | } | |
6512 | ||
6513 | next = l->next; | |
6514 | free (l); | |
6515 | l = next; | |
6516 | } | |
6517 | ||
6518 | if (nocrossref != NULL) | |
6519 | lang_add_nocrossref (nocrossref); | |
6520 | ||
252b5132 | 6521 | overlay_vma = NULL; |
252b5132 RH |
6522 | overlay_list = NULL; |
6523 | overlay_max = NULL; | |
6524 | } | |
6525 | \f | |
6526 | /* Version handling. This is only useful for ELF. */ | |
6527 | ||
6528 | /* This global variable holds the version tree that we build. */ | |
6529 | ||
6530 | struct bfd_elf_version_tree *lang_elf_version_info; | |
6531 | ||
108ba305 JJ |
6532 | /* If PREV is NULL, return first version pattern matching particular symbol. |
6533 | If PREV is non-NULL, return first version pattern matching particular | |
6534 | symbol after PREV (previously returned by lang_vers_match). */ | |
252b5132 | 6535 | |
108ba305 JJ |
6536 | static struct bfd_elf_version_expr * |
6537 | lang_vers_match (struct bfd_elf_version_expr_head *head, | |
6538 | struct bfd_elf_version_expr *prev, | |
6539 | const char *sym) | |
252b5132 | 6540 | { |
108ba305 JJ |
6541 | const char *cxx_sym = sym; |
6542 | const char *java_sym = sym; | |
6543 | struct bfd_elf_version_expr *expr = NULL; | |
252b5132 | 6544 | |
108ba305 | 6545 | if (head->mask & BFD_ELF_VERSION_CXX_TYPE) |
252b5132 | 6546 | { |
2f97444a | 6547 | cxx_sym = cplus_demangle (sym, DMGL_PARAMS | DMGL_ANSI); |
108ba305 JJ |
6548 | if (!cxx_sym) |
6549 | cxx_sym = sym; | |
252b5132 | 6550 | } |
df816215 | 6551 | if (head->mask & BFD_ELF_VERSION_JAVA_TYPE) |
252b5132 | 6552 | { |
108ba305 JJ |
6553 | java_sym = cplus_demangle (sym, DMGL_JAVA); |
6554 | if (!java_sym) | |
6555 | java_sym = sym; | |
252b5132 RH |
6556 | } |
6557 | ||
5e35cbc2 | 6558 | if (head->htab && (prev == NULL || prev->symbol)) |
252b5132 | 6559 | { |
108ba305 JJ |
6560 | struct bfd_elf_version_expr e; |
6561 | ||
6562 | switch (prev ? prev->mask : 0) | |
6563 | { | |
6564 | case 0: | |
6565 | if (head->mask & BFD_ELF_VERSION_C_TYPE) | |
6566 | { | |
5e35cbc2 | 6567 | e.symbol = sym; |
108ba305 | 6568 | expr = htab_find (head->htab, &e); |
5e35cbc2 | 6569 | while (expr && strcmp (expr->symbol, sym) == 0) |
108ba305 JJ |
6570 | if (expr->mask == BFD_ELF_VERSION_C_TYPE) |
6571 | goto out_ret; | |
86043bbb MM |
6572 | else |
6573 | expr = expr->next; | |
108ba305 JJ |
6574 | } |
6575 | /* Fallthrough */ | |
6576 | case BFD_ELF_VERSION_C_TYPE: | |
6577 | if (head->mask & BFD_ELF_VERSION_CXX_TYPE) | |
6578 | { | |
5e35cbc2 | 6579 | e.symbol = cxx_sym; |
108ba305 | 6580 | expr = htab_find (head->htab, &e); |
7a995eb3 | 6581 | while (expr && strcmp (expr->symbol, cxx_sym) == 0) |
108ba305 JJ |
6582 | if (expr->mask == BFD_ELF_VERSION_CXX_TYPE) |
6583 | goto out_ret; | |
86043bbb MM |
6584 | else |
6585 | expr = expr->next; | |
108ba305 JJ |
6586 | } |
6587 | /* Fallthrough */ | |
6588 | case BFD_ELF_VERSION_CXX_TYPE: | |
6589 | if (head->mask & BFD_ELF_VERSION_JAVA_TYPE) | |
6590 | { | |
5e35cbc2 | 6591 | e.symbol = java_sym; |
108ba305 | 6592 | expr = htab_find (head->htab, &e); |
7a995eb3 | 6593 | while (expr && strcmp (expr->symbol, java_sym) == 0) |
108ba305 JJ |
6594 | if (expr->mask == BFD_ELF_VERSION_JAVA_TYPE) |
6595 | goto out_ret; | |
86043bbb MM |
6596 | else |
6597 | expr = expr->next; | |
108ba305 JJ |
6598 | } |
6599 | /* Fallthrough */ | |
6600 | default: | |
6601 | break; | |
6602 | } | |
252b5132 | 6603 | } |
108ba305 JJ |
6604 | |
6605 | /* Finally, try the wildcards. */ | |
5e35cbc2 | 6606 | if (prev == NULL || prev->symbol) |
108ba305 | 6607 | expr = head->remaining; |
252b5132 | 6608 | else |
108ba305 | 6609 | expr = prev->next; |
86043bbb | 6610 | for (; expr; expr = expr->next) |
252b5132 | 6611 | { |
108ba305 JJ |
6612 | const char *s; |
6613 | ||
86043bbb MM |
6614 | if (!expr->pattern) |
6615 | continue; | |
6616 | ||
108ba305 JJ |
6617 | if (expr->pattern[0] == '*' && expr->pattern[1] == '\0') |
6618 | break; | |
6619 | ||
6620 | if (expr->mask == BFD_ELF_VERSION_JAVA_TYPE) | |
6621 | s = java_sym; | |
6622 | else if (expr->mask == BFD_ELF_VERSION_CXX_TYPE) | |
6623 | s = cxx_sym; | |
6624 | else | |
6625 | s = sym; | |
5e35cbc2 | 6626 | if (fnmatch (expr->pattern, s, 0) == 0) |
108ba305 | 6627 | break; |
252b5132 RH |
6628 | } |
6629 | ||
108ba305 JJ |
6630 | out_ret: |
6631 | if (cxx_sym != sym) | |
6632 | free ((char *) cxx_sym); | |
6633 | if (java_sym != sym) | |
6634 | free ((char *) java_sym); | |
6635 | return expr; | |
252b5132 RH |
6636 | } |
6637 | ||
5e35cbc2 L |
6638 | /* Return NULL if the PATTERN argument is a glob pattern, otherwise, |
6639 | return a string pointing to the symbol name. */ | |
6640 | ||
6641 | static const char * | |
6642 | realsymbol (const char *pattern) | |
6643 | { | |
6644 | const char *p; | |
6645 | bfd_boolean changed = FALSE, backslash = FALSE; | |
6646 | char *s, *symbol = xmalloc (strlen (pattern) + 1); | |
6647 | ||
6648 | for (p = pattern, s = symbol; *p != '\0'; ++p) | |
6649 | { | |
6650 | /* It is a glob pattern only if there is no preceding | |
6651 | backslash. */ | |
6652 | if (! backslash && (*p == '?' || *p == '*' || *p == '[')) | |
6653 | { | |
6654 | free (symbol); | |
6655 | return NULL; | |
6656 | } | |
6657 | ||
6658 | if (backslash) | |
6659 | { | |
6660 | /* Remove the preceding backslash. */ | |
6661 | *(s - 1) = *p; | |
6662 | changed = TRUE; | |
6663 | } | |
6664 | else | |
6665 | *s++ = *p; | |
6666 | ||
6667 | backslash = *p == '\\'; | |
6668 | } | |
6669 | ||
6670 | if (changed) | |
6671 | { | |
6672 | *s = '\0'; | |
6673 | return symbol; | |
6674 | } | |
6675 | else | |
6676 | { | |
6677 | free (symbol); | |
6678 | return pattern; | |
6679 | } | |
6680 | } | |
6681 | ||
86043bbb MM |
6682 | /* This is called for each variable name or match expression. NEW is |
6683 | the name of the symbol to match, or, if LITERAL_P is FALSE, a glob | |
6684 | pattern to be matched against symbol names. */ | |
252b5132 RH |
6685 | |
6686 | struct bfd_elf_version_expr * | |
1579bae1 AM |
6687 | lang_new_vers_pattern (struct bfd_elf_version_expr *orig, |
6688 | const char *new, | |
86043bbb MM |
6689 | const char *lang, |
6690 | bfd_boolean literal_p) | |
252b5132 RH |
6691 | { |
6692 | struct bfd_elf_version_expr *ret; | |
6693 | ||
1579bae1 | 6694 | ret = xmalloc (sizeof *ret); |
252b5132 | 6695 | ret->next = orig; |
86043bbb | 6696 | ret->pattern = literal_p ? NULL : new; |
31941635 L |
6697 | ret->symver = 0; |
6698 | ret->script = 0; | |
86043bbb | 6699 | ret->symbol = literal_p ? new : realsymbol (new); |
252b5132 RH |
6700 | |
6701 | if (lang == NULL || strcasecmp (lang, "C") == 0) | |
108ba305 | 6702 | ret->mask = BFD_ELF_VERSION_C_TYPE; |
252b5132 | 6703 | else if (strcasecmp (lang, "C++") == 0) |
108ba305 | 6704 | ret->mask = BFD_ELF_VERSION_CXX_TYPE; |
252b5132 | 6705 | else if (strcasecmp (lang, "Java") == 0) |
108ba305 | 6706 | ret->mask = BFD_ELF_VERSION_JAVA_TYPE; |
252b5132 RH |
6707 | else |
6708 | { | |
6709 | einfo (_("%X%P: unknown language `%s' in version information\n"), | |
6710 | lang); | |
108ba305 | 6711 | ret->mask = BFD_ELF_VERSION_C_TYPE; |
252b5132 RH |
6712 | } |
6713 | ||
fac1652d | 6714 | return ldemul_new_vers_pattern (ret); |
252b5132 RH |
6715 | } |
6716 | ||
6717 | /* This is called for each set of variable names and match | |
6718 | expressions. */ | |
6719 | ||
6720 | struct bfd_elf_version_tree * | |
1579bae1 AM |
6721 | lang_new_vers_node (struct bfd_elf_version_expr *globals, |
6722 | struct bfd_elf_version_expr *locals) | |
252b5132 RH |
6723 | { |
6724 | struct bfd_elf_version_tree *ret; | |
6725 | ||
108ba305 JJ |
6726 | ret = xcalloc (1, sizeof *ret); |
6727 | ret->globals.list = globals; | |
6728 | ret->locals.list = locals; | |
6729 | ret->match = lang_vers_match; | |
252b5132 | 6730 | ret->name_indx = (unsigned int) -1; |
252b5132 RH |
6731 | return ret; |
6732 | } | |
6733 | ||
6734 | /* This static variable keeps track of version indices. */ | |
6735 | ||
6736 | static int version_index; | |
6737 | ||
108ba305 JJ |
6738 | static hashval_t |
6739 | version_expr_head_hash (const void *p) | |
6740 | { | |
6741 | const struct bfd_elf_version_expr *e = p; | |
6742 | ||
5e35cbc2 | 6743 | return htab_hash_string (e->symbol); |
108ba305 JJ |
6744 | } |
6745 | ||
6746 | static int | |
6747 | version_expr_head_eq (const void *p1, const void *p2) | |
6748 | { | |
6749 | const struct bfd_elf_version_expr *e1 = p1; | |
6750 | const struct bfd_elf_version_expr *e2 = p2; | |
6751 | ||
5e35cbc2 | 6752 | return strcmp (e1->symbol, e2->symbol) == 0; |
108ba305 JJ |
6753 | } |
6754 | ||
6755 | static void | |
6756 | lang_finalize_version_expr_head (struct bfd_elf_version_expr_head *head) | |
6757 | { | |
6758 | size_t count = 0; | |
6759 | struct bfd_elf_version_expr *e, *next; | |
6760 | struct bfd_elf_version_expr **list_loc, **remaining_loc; | |
6761 | ||
6762 | for (e = head->list; e; e = e->next) | |
6763 | { | |
5e35cbc2 | 6764 | if (e->symbol) |
108ba305 JJ |
6765 | count++; |
6766 | head->mask |= e->mask; | |
6767 | } | |
6768 | ||
6769 | if (count) | |
6770 | { | |
6771 | head->htab = htab_create (count * 2, version_expr_head_hash, | |
6772 | version_expr_head_eq, NULL); | |
6773 | list_loc = &head->list; | |
6774 | remaining_loc = &head->remaining; | |
6775 | for (e = head->list; e; e = next) | |
6776 | { | |
6777 | next = e->next; | |
5e35cbc2 | 6778 | if (!e->symbol) |
108ba305 JJ |
6779 | { |
6780 | *remaining_loc = e; | |
6781 | remaining_loc = &e->next; | |
6782 | } | |
6783 | else | |
6784 | { | |
6785 | void **loc = htab_find_slot (head->htab, e, INSERT); | |
6786 | ||
6787 | if (*loc) | |
6788 | { | |
6789 | struct bfd_elf_version_expr *e1, *last; | |
6790 | ||
6791 | e1 = *loc; | |
6792 | last = NULL; | |
6793 | do | |
6794 | { | |
6795 | if (e1->mask == e->mask) | |
6796 | { | |
6797 | last = NULL; | |
6798 | break; | |
6799 | } | |
6800 | last = e1; | |
6801 | e1 = e1->next; | |
6802 | } | |
5e35cbc2 | 6803 | while (e1 && strcmp (e1->symbol, e->symbol) == 0); |
108ba305 JJ |
6804 | |
6805 | if (last == NULL) | |
6806 | { | |
6807 | /* This is a duplicate. */ | |
6808 | /* FIXME: Memory leak. Sometimes pattern is not | |
6809 | xmalloced alone, but in larger chunk of memory. */ | |
5e35cbc2 | 6810 | /* free (e->symbol); */ |
108ba305 JJ |
6811 | free (e); |
6812 | } | |
6813 | else | |
6814 | { | |
6815 | e->next = last->next; | |
6816 | last->next = e; | |
6817 | } | |
6818 | } | |
6819 | else | |
6820 | { | |
6821 | *loc = e; | |
6822 | *list_loc = e; | |
6823 | list_loc = &e->next; | |
6824 | } | |
6825 | } | |
6826 | } | |
6827 | *remaining_loc = NULL; | |
6828 | *list_loc = head->remaining; | |
6829 | } | |
6830 | else | |
6831 | head->remaining = head->list; | |
6832 | } | |
6833 | ||
252b5132 RH |
6834 | /* This is called when we know the name and dependencies of the |
6835 | version. */ | |
6836 | ||
6837 | void | |
1579bae1 AM |
6838 | lang_register_vers_node (const char *name, |
6839 | struct bfd_elf_version_tree *version, | |
6840 | struct bfd_elf_version_deps *deps) | |
252b5132 RH |
6841 | { |
6842 | struct bfd_elf_version_tree *t, **pp; | |
6843 | struct bfd_elf_version_expr *e1; | |
6844 | ||
6b9b879a JJ |
6845 | if (name == NULL) |
6846 | name = ""; | |
6847 | ||
6848 | if ((name[0] == '\0' && lang_elf_version_info != NULL) | |
6849 | || (lang_elf_version_info && lang_elf_version_info->name[0] == '\0')) | |
6850 | { | |
6feb9908 AM |
6851 | einfo (_("%X%P: anonymous version tag cannot be combined" |
6852 | " with other version tags\n")); | |
5ed6aba4 | 6853 | free (version); |
6b9b879a JJ |
6854 | return; |
6855 | } | |
6856 | ||
252b5132 RH |
6857 | /* Make sure this node has a unique name. */ |
6858 | for (t = lang_elf_version_info; t != NULL; t = t->next) | |
6859 | if (strcmp (t->name, name) == 0) | |
6860 | einfo (_("%X%P: duplicate version tag `%s'\n"), name); | |
6861 | ||
108ba305 JJ |
6862 | lang_finalize_version_expr_head (&version->globals); |
6863 | lang_finalize_version_expr_head (&version->locals); | |
6864 | ||
252b5132 RH |
6865 | /* Check the global and local match names, and make sure there |
6866 | aren't any duplicates. */ | |
6867 | ||
108ba305 | 6868 | for (e1 = version->globals.list; e1 != NULL; e1 = e1->next) |
252b5132 RH |
6869 | { |
6870 | for (t = lang_elf_version_info; t != NULL; t = t->next) | |
6871 | { | |
6872 | struct bfd_elf_version_expr *e2; | |
6873 | ||
5e35cbc2 | 6874 | if (t->locals.htab && e1->symbol) |
108ba305 JJ |
6875 | { |
6876 | e2 = htab_find (t->locals.htab, e1); | |
5e35cbc2 | 6877 | while (e2 && strcmp (e1->symbol, e2->symbol) == 0) |
108ba305 JJ |
6878 | { |
6879 | if (e1->mask == e2->mask) | |
6feb9908 AM |
6880 | einfo (_("%X%P: duplicate expression `%s'" |
6881 | " in version information\n"), e1->symbol); | |
108ba305 JJ |
6882 | e2 = e2->next; |
6883 | } | |
6884 | } | |
5e35cbc2 | 6885 | else if (!e1->symbol) |
108ba305 | 6886 | for (e2 = t->locals.remaining; e2 != NULL; e2 = e2->next) |
6feb9908 AM |
6887 | if (strcmp (e1->pattern, e2->pattern) == 0 |
6888 | && e1->mask == e2->mask) | |
6889 | einfo (_("%X%P: duplicate expression `%s'" | |
6890 | " in version information\n"), e1->pattern); | |
252b5132 RH |
6891 | } |
6892 | } | |
6893 | ||
108ba305 | 6894 | for (e1 = version->locals.list; e1 != NULL; e1 = e1->next) |
252b5132 RH |
6895 | { |
6896 | for (t = lang_elf_version_info; t != NULL; t = t->next) | |
6897 | { | |
6898 | struct bfd_elf_version_expr *e2; | |
6899 | ||
5e35cbc2 | 6900 | if (t->globals.htab && e1->symbol) |
108ba305 JJ |
6901 | { |
6902 | e2 = htab_find (t->globals.htab, e1); | |
5e35cbc2 | 6903 | while (e2 && strcmp (e1->symbol, e2->symbol) == 0) |
108ba305 JJ |
6904 | { |
6905 | if (e1->mask == e2->mask) | |
6feb9908 AM |
6906 | einfo (_("%X%P: duplicate expression `%s'" |
6907 | " in version information\n"), | |
5e35cbc2 | 6908 | e1->symbol); |
108ba305 JJ |
6909 | e2 = e2->next; |
6910 | } | |
6911 | } | |
5e35cbc2 | 6912 | else if (!e1->symbol) |
108ba305 | 6913 | for (e2 = t->globals.remaining; e2 != NULL; e2 = e2->next) |
6feb9908 AM |
6914 | if (strcmp (e1->pattern, e2->pattern) == 0 |
6915 | && e1->mask == e2->mask) | |
6916 | einfo (_("%X%P: duplicate expression `%s'" | |
6917 | " in version information\n"), e1->pattern); | |
252b5132 RH |
6918 | } |
6919 | } | |
6920 | ||
6921 | version->deps = deps; | |
6922 | version->name = name; | |
6b9b879a JJ |
6923 | if (name[0] != '\0') |
6924 | { | |
6925 | ++version_index; | |
6926 | version->vernum = version_index; | |
6927 | } | |
6928 | else | |
6929 | version->vernum = 0; | |
252b5132 RH |
6930 | |
6931 | for (pp = &lang_elf_version_info; *pp != NULL; pp = &(*pp)->next) | |
6932 | ; | |
6933 | *pp = version; | |
6934 | } | |
6935 | ||
6936 | /* This is called when we see a version dependency. */ | |
6937 | ||
6938 | struct bfd_elf_version_deps * | |
1579bae1 | 6939 | lang_add_vers_depend (struct bfd_elf_version_deps *list, const char *name) |
252b5132 RH |
6940 | { |
6941 | struct bfd_elf_version_deps *ret; | |
6942 | struct bfd_elf_version_tree *t; | |
6943 | ||
1579bae1 | 6944 | ret = xmalloc (sizeof *ret); |
252b5132 RH |
6945 | ret->next = list; |
6946 | ||
6947 | for (t = lang_elf_version_info; t != NULL; t = t->next) | |
6948 | { | |
6949 | if (strcmp (t->name, name) == 0) | |
6950 | { | |
6951 | ret->version_needed = t; | |
6952 | return ret; | |
6953 | } | |
6954 | } | |
6955 | ||
6956 | einfo (_("%X%P: unable to find version dependency `%s'\n"), name); | |
6957 | ||
6958 | return ret; | |
6959 | } | |
6960 | ||
6961 | static void | |
1579bae1 | 6962 | lang_do_version_exports_section (void) |
252b5132 RH |
6963 | { |
6964 | struct bfd_elf_version_expr *greg = NULL, *lreg; | |
6965 | ||
6966 | LANG_FOR_EACH_INPUT_STATEMENT (is) | |
6967 | { | |
6968 | asection *sec = bfd_get_section_by_name (is->the_bfd, ".exports"); | |
6969 | char *contents, *p; | |
6970 | bfd_size_type len; | |
6971 | ||
6972 | if (sec == NULL) | |
b7a26f91 | 6973 | continue; |
252b5132 | 6974 | |
eea6121a | 6975 | len = sec->size; |
252b5132 RH |
6976 | contents = xmalloc (len); |
6977 | if (!bfd_get_section_contents (is->the_bfd, sec, contents, 0, len)) | |
6f9efd97 | 6978 | einfo (_("%X%P: unable to read .exports section contents\n"), sec); |
252b5132 RH |
6979 | |
6980 | p = contents; | |
89cdebba | 6981 | while (p < contents + len) |
252b5132 | 6982 | { |
86043bbb | 6983 | greg = lang_new_vers_pattern (greg, p, NULL, FALSE); |
252b5132 RH |
6984 | p = strchr (p, '\0') + 1; |
6985 | } | |
6986 | ||
6987 | /* Do not free the contents, as we used them creating the regex. */ | |
6988 | ||
6989 | /* Do not include this section in the link. */ | |
a14a5de3 | 6990 | sec->flags |= SEC_EXCLUDE | SEC_KEEP; |
252b5132 RH |
6991 | } |
6992 | ||
86043bbb | 6993 | lreg = lang_new_vers_pattern (NULL, "*", NULL, FALSE); |
252b5132 RH |
6994 | lang_register_vers_node (command_line.version_exports_section, |
6995 | lang_new_vers_node (greg, lreg), NULL); | |
6996 | } | |
577a0623 AM |
6997 | |
6998 | void | |
1579bae1 | 6999 | lang_add_unique (const char *name) |
577a0623 AM |
7000 | { |
7001 | struct unique_sections *ent; | |
7002 | ||
7003 | for (ent = unique_section_list; ent; ent = ent->next) | |
7004 | if (strcmp (ent->name, name) == 0) | |
7005 | return; | |
7006 | ||
1579bae1 | 7007 | ent = xmalloc (sizeof *ent); |
577a0623 AM |
7008 | ent->name = xstrdup (name); |
7009 | ent->next = unique_section_list; | |
7010 | unique_section_list = ent; | |
7011 | } | |
55255dae L |
7012 | |
7013 | /* Append the list of dynamic symbols to the existing one. */ | |
7014 | ||
7015 | void | |
7016 | lang_append_dynamic_list (struct bfd_elf_version_expr *dynamic) | |
7017 | { | |
40b36307 | 7018 | if (link_info.dynamic_list) |
55255dae | 7019 | { |
07806542 JJ |
7020 | struct bfd_elf_version_expr *tail; |
7021 | for (tail = dynamic; tail->next != NULL; tail = tail->next) | |
7022 | ; | |
40b36307 L |
7023 | tail->next = link_info.dynamic_list->head.list; |
7024 | link_info.dynamic_list->head.list = dynamic; | |
55255dae L |
7025 | } |
7026 | else | |
7027 | { | |
7028 | struct bfd_elf_dynamic_list *d; | |
7029 | ||
7030 | d = xcalloc (1, sizeof *d); | |
7031 | d->head.list = dynamic; | |
7032 | d->match = lang_vers_match; | |
40b36307 | 7033 | link_info.dynamic_list = d; |
55255dae L |
7034 | } |
7035 | } | |
7036 | ||
7037 | /* Append the list of C++ typeinfo dynamic symbols to the existing | |
7038 | one. */ | |
7039 | ||
7040 | void | |
7041 | lang_append_dynamic_list_cpp_typeinfo (void) | |
7042 | { | |
7043 | const char * symbols [] = | |
7044 | { | |
7045 | "typeinfo name for*", | |
7046 | "typeinfo for*" | |
7047 | }; | |
7048 | struct bfd_elf_version_expr *dynamic = NULL; | |
7049 | unsigned int i; | |
7050 | ||
7051 | for (i = 0; i < ARRAY_SIZE (symbols); i++) | |
7052 | dynamic = lang_new_vers_pattern (dynamic, symbols [i], "C++", | |
7053 | FALSE); | |
7054 | ||
7055 | lang_append_dynamic_list (dynamic); | |
7056 | } | |
40b36307 L |
7057 | |
7058 | /* Append the list of C++ operator new and delete dynamic symbols to the | |
7059 | existing one. */ | |
7060 | ||
7061 | void | |
7062 | lang_append_dynamic_list_cpp_new (void) | |
7063 | { | |
7064 | const char * symbols [] = | |
7065 | { | |
7066 | "operator new*", | |
7067 | "operator delete*" | |
7068 | }; | |
7069 | struct bfd_elf_version_expr *dynamic = NULL; | |
7070 | unsigned int i; | |
7071 | ||
7072 | for (i = 0; i < ARRAY_SIZE (symbols); i++) | |
7073 | dynamic = lang_new_vers_pattern (dynamic, symbols [i], "C++", | |
7074 | FALSE); | |
7075 | ||
7076 | lang_append_dynamic_list (dynamic); | |
7077 | } |