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