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