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