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