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