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