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