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