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