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