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