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