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