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