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