Commit | Line | Data |
---|---|---|
252b5132 | 1 | /* Linker command language support. |
a2b64bed | 2 | Copyright 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, |
cf888e70 | 3 | 2001, 2002, 2003 |
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" | |
42 | ||
7abb6dea | 43 | #ifndef offsetof |
cf888e70 | 44 | #define offsetof(TYPE, MEMBER) ((size_t) & (((TYPE*) 0)->MEMBER)) |
7abb6dea AM |
45 | #endif |
46 | ||
cf888e70 | 47 | /* Locals variables. */ |
252b5132 RH |
48 | static struct obstack stat_obstack; |
49 | ||
50 | #define obstack_chunk_alloc xmalloc | |
51 | #define obstack_chunk_free free | |
5f992e62 | 52 | static const char *startup_file; |
252b5132 | 53 | static lang_statement_list_type input_file_chain; |
b34976b6 | 54 | static bfd_boolean placed_commons = FALSE; |
252b5132 | 55 | static lang_output_section_statement_type *default_common_section; |
b34976b6 | 56 | static bfd_boolean map_option_f; |
252b5132 RH |
57 | static bfd_vma print_dot; |
58 | static lang_input_statement_type *first_file; | |
5f992e62 AM |
59 | static const char *current_target; |
60 | static const char *output_target; | |
252b5132 RH |
61 | static lang_statement_list_type statement_list; |
62 | static struct lang_phdr *lang_phdr_list; | |
420e579c | 63 | static struct bfd_hash_table lang_definedness_table; |
252b5132 | 64 | |
cf888e70 | 65 | /* Forward declarations. */ |
1579bae1 AM |
66 | static void exp_init_os (etree_type *); |
67 | static bfd_boolean wildcardp (const char *); | |
68 | static lang_input_statement_type *lookup_name (const char *); | |
69 | static bfd_boolean load_symbols (lang_input_statement_type *, | |
70 | lang_statement_list_type *); | |
420e579c HPN |
71 | static struct bfd_hash_entry *lang_definedness_newfunc |
72 | (struct bfd_hash_entry *, struct bfd_hash_table *, const char *); | |
1579bae1 AM |
73 | static void insert_undefined (const char *); |
74 | static void print_statement (lang_statement_union_type *, | |
75 | lang_output_section_statement_type *); | |
76 | static void print_statement_list (lang_statement_union_type *, | |
77 | lang_output_section_statement_type *); | |
78 | static void print_statements (void); | |
79 | static bfd_boolean lang_one_common (struct bfd_link_hash_entry *, void *); | |
80 | static void lang_record_phdrs (void); | |
81 | static void lang_do_version_exports_section (void); | |
82 | ||
83 | typedef void (*callback_t) (lang_wild_statement_type *, struct wildcard_list *, | |
84 | asection *, lang_input_statement_type *, void *); | |
5f992e62 | 85 | |
cf888e70 | 86 | /* Exported variables. */ |
252b5132 | 87 | lang_output_section_statement_type *abs_output_section; |
aea4bd9d | 88 | lang_statement_list_type lang_output_section_statement; |
252b5132 | 89 | lang_statement_list_type *stat_ptr = &statement_list; |
87f2a346 | 90 | lang_statement_list_type file_chain = { NULL, NULL }; |
e3e942e9 | 91 | struct bfd_sym_chain entry_symbol = { NULL, NULL }; |
1e281515 | 92 | const char *entry_section = ".text"; |
b34976b6 AM |
93 | bfd_boolean entry_from_cmdline; |
94 | bfd_boolean lang_has_input_file = FALSE; | |
95 | bfd_boolean had_output_filename = FALSE; | |
96 | bfd_boolean lang_float_flag = FALSE; | |
97 | bfd_boolean delete_output_file_on_failure = FALSE; | |
252b5132 | 98 | struct lang_nocrossrefs *nocrossref_list; |
577a0623 | 99 | struct unique_sections *unique_section_list; |
e3f2db7f | 100 | static bfd_boolean ldlang_sysrooted_script = FALSE; |
420e579c | 101 | int lang_statement_iteration = 0; |
252b5132 RH |
102 | |
103 | etree_type *base; /* Relocation base - or null */ | |
104 | ||
d1778b88 | 105 | #define new_stat(x, y) \ |
1579bae1 | 106 | (x##_type *) new_statement (x##_enum, sizeof (x##_type), y) |
252b5132 | 107 | |
d1778b88 AM |
108 | #define outside_section_address(q) \ |
109 | ((q)->output_offset + (q)->output_section->vma) | |
252b5132 | 110 | |
d1778b88 AM |
111 | #define outside_symbol_address(q) \ |
112 | ((q)->value + outside_section_address (q->section)) | |
252b5132 RH |
113 | |
114 | #define SECTION_NAME_MAP_LENGTH (16) | |
115 | ||
1579bae1 AM |
116 | void * |
117 | stat_alloc (size_t size) | |
252b5132 RH |
118 | { |
119 | return obstack_alloc (&stat_obstack, size); | |
120 | } | |
121 | ||
b34976b6 | 122 | bfd_boolean |
1579bae1 | 123 | unique_section_p (const char *secnam) |
577a0623 AM |
124 | { |
125 | struct unique_sections *unam; | |
126 | ||
127 | for (unam = unique_section_list; unam; unam = unam->next) | |
128 | if (wildcardp (unam->name) | |
129 | ? fnmatch (unam->name, secnam, 0) == 0 | |
130 | : strcmp (unam->name, secnam) == 0) | |
131 | { | |
b34976b6 | 132 | return TRUE; |
577a0623 AM |
133 | } |
134 | ||
b34976b6 | 135 | return FALSE; |
577a0623 AM |
136 | } |
137 | ||
08da4cac | 138 | /* Generic traversal routines for finding matching sections. */ |
4dec4d4e RH |
139 | |
140 | static void | |
1579bae1 AM |
141 | walk_wild_section (lang_wild_statement_type *ptr, |
142 | lang_input_statement_type *file, | |
143 | callback_t callback, | |
144 | void *data) | |
4dec4d4e | 145 | { |
b6bf44ba AM |
146 | asection *s; |
147 | ||
148 | if (file->just_syms_flag) | |
149 | return; | |
150 | ||
151 | for (s = file->the_bfd->sections; s != NULL; s = s->next) | |
4dec4d4e | 152 | { |
b6bf44ba AM |
153 | struct wildcard_list *sec; |
154 | ||
155 | sec = ptr->section_list; | |
2181f54f AM |
156 | if (sec == NULL) |
157 | (*callback) (ptr, sec, s, file, data); | |
158 | ||
159 | while (sec != NULL) | |
08da4cac | 160 | { |
b34976b6 | 161 | bfd_boolean skip = FALSE; |
2181f54f AM |
162 | struct name_list *list_tmp; |
163 | ||
164 | /* Don't process sections from files which were | |
165 | excluded. */ | |
166 | for (list_tmp = sec->spec.exclude_name_list; | |
167 | list_tmp; | |
168 | list_tmp = list_tmp->next) | |
169 | { | |
170 | if (wildcardp (list_tmp->name)) | |
171 | skip = fnmatch (list_tmp->name, file->filename, 0) == 0; | |
172 | else | |
173 | skip = strcmp (list_tmp->name, file->filename) == 0; | |
4dec4d4e | 174 | |
34efb449 AO |
175 | /* If this file is part of an archive, and the archive is |
176 | excluded, exclude this file. */ | |
177 | if (! skip && file->the_bfd != NULL | |
178 | && file->the_bfd->my_archive != NULL | |
179 | && file->the_bfd->my_archive->filename != NULL) | |
180 | { | |
181 | if (wildcardp (list_tmp->name)) | |
182 | skip = fnmatch (list_tmp->name, | |
183 | file->the_bfd->my_archive->filename, | |
184 | 0) == 0; | |
185 | else | |
186 | skip = strcmp (list_tmp->name, | |
187 | file->the_bfd->my_archive->filename) == 0; | |
188 | } | |
189 | ||
2181f54f AM |
190 | if (skip) |
191 | break; | |
192 | } | |
193 | ||
194 | if (!skip && sec->spec.name != NULL) | |
b6bf44ba | 195 | { |
2181f54f AM |
196 | const char *sname = bfd_get_section_name (file->the_bfd, s); |
197 | ||
198 | if (wildcardp (sec->spec.name)) | |
199 | skip = fnmatch (sec->spec.name, sname, 0) != 0; | |
200 | else | |
201 | skip = strcmp (sec->spec.name, sname) != 0; | |
b6bf44ba | 202 | } |
4dec4d4e | 203 | |
b6bf44ba AM |
204 | if (!skip) |
205 | (*callback) (ptr, sec, s, file, data); | |
4dec4d4e | 206 | |
2181f54f | 207 | sec = sec->next; |
4dec4d4e RH |
208 | } |
209 | } | |
210 | } | |
211 | ||
212 | /* Handle a wild statement for a single file F. */ | |
213 | ||
214 | static void | |
1579bae1 AM |
215 | walk_wild_file (lang_wild_statement_type *s, |
216 | lang_input_statement_type *f, | |
217 | callback_t callback, | |
218 | void *data) | |
4dec4d4e RH |
219 | { |
220 | if (f->the_bfd == NULL | |
221 | || ! bfd_check_format (f->the_bfd, bfd_archive)) | |
b6bf44ba | 222 | walk_wild_section (s, f, callback, data); |
4dec4d4e RH |
223 | else |
224 | { | |
225 | bfd *member; | |
226 | ||
227 | /* This is an archive file. We must map each member of the | |
228 | archive separately. */ | |
1579bae1 | 229 | member = bfd_openr_next_archived_file (f->the_bfd, NULL); |
4dec4d4e RH |
230 | while (member != NULL) |
231 | { | |
232 | /* When lookup_name is called, it will call the add_symbols | |
233 | entry point for the archive. For each element of the | |
234 | archive which is included, BFD will call ldlang_add_file, | |
235 | which will set the usrdata field of the member to the | |
236 | lang_input_statement. */ | |
237 | if (member->usrdata != NULL) | |
238 | { | |
1579bae1 | 239 | walk_wild_section (s, member->usrdata, callback, data); |
4dec4d4e RH |
240 | } |
241 | ||
242 | member = bfd_openr_next_archived_file (f->the_bfd, member); | |
243 | } | |
244 | } | |
245 | } | |
246 | ||
247 | static void | |
1579bae1 | 248 | walk_wild (lang_wild_statement_type *s, callback_t callback, void *data) |
4dec4d4e | 249 | { |
b6bf44ba AM |
250 | const char *file_spec = s->filename; |
251 | ||
252 | if (file_spec == NULL) | |
4dec4d4e RH |
253 | { |
254 | /* Perform the iteration over all files in the list. */ | |
e50d8076 | 255 | LANG_FOR_EACH_INPUT_STATEMENT (f) |
4dec4d4e | 256 | { |
b6bf44ba | 257 | walk_wild_file (s, f, callback, data); |
4dec4d4e RH |
258 | } |
259 | } | |
b6bf44ba | 260 | else if (wildcardp (file_spec)) |
4dec4d4e | 261 | { |
e50d8076 | 262 | LANG_FOR_EACH_INPUT_STATEMENT (f) |
4dec4d4e | 263 | { |
b6bf44ba AM |
264 | if (fnmatch (file_spec, f->filename, FNM_FILE_NAME) == 0) |
265 | walk_wild_file (s, f, callback, data); | |
4dec4d4e RH |
266 | } |
267 | } | |
268 | else | |
269 | { | |
e50d8076 NC |
270 | lang_input_statement_type *f; |
271 | ||
4dec4d4e | 272 | /* Perform the iteration over a single file. */ |
b6bf44ba | 273 | f = lookup_name (file_spec); |
6770ec8c | 274 | if (f) |
b6bf44ba | 275 | walk_wild_file (s, f, callback, data); |
4dec4d4e | 276 | } |
5f992e62 AM |
277 | } |
278 | ||
08da4cac KH |
279 | /* lang_for_each_statement walks the parse tree and calls the provided |
280 | function for each node. */ | |
252b5132 RH |
281 | |
282 | static void | |
1579bae1 AM |
283 | lang_for_each_statement_worker (void (*func) (lang_statement_union_type *), |
284 | lang_statement_union_type *s) | |
252b5132 | 285 | { |
1579bae1 | 286 | for (; s != NULL; s = s->header.next) |
252b5132 RH |
287 | { |
288 | func (s); | |
289 | ||
290 | switch (s->header.type) | |
291 | { | |
292 | case lang_constructors_statement_enum: | |
293 | lang_for_each_statement_worker (func, constructor_list.head); | |
294 | break; | |
295 | case lang_output_section_statement_enum: | |
296 | lang_for_each_statement_worker | |
297 | (func, | |
298 | s->output_section_statement.children.head); | |
299 | break; | |
300 | case lang_wild_statement_enum: | |
301 | lang_for_each_statement_worker | |
302 | (func, | |
303 | s->wild_statement.children.head); | |
304 | break; | |
305 | case lang_group_statement_enum: | |
306 | lang_for_each_statement_worker (func, | |
307 | s->group_statement.children.head); | |
308 | break; | |
309 | case lang_data_statement_enum: | |
310 | case lang_reloc_statement_enum: | |
311 | case lang_object_symbols_statement_enum: | |
312 | case lang_output_statement_enum: | |
313 | case lang_target_statement_enum: | |
314 | case lang_input_section_enum: | |
315 | case lang_input_statement_enum: | |
316 | case lang_assignment_statement_enum: | |
317 | case lang_padding_statement_enum: | |
318 | case lang_address_statement_enum: | |
319 | case lang_fill_statement_enum: | |
320 | break; | |
321 | default: | |
322 | FAIL (); | |
323 | break; | |
324 | } | |
325 | } | |
326 | } | |
327 | ||
328 | void | |
1579bae1 | 329 | lang_for_each_statement (void (*func) (lang_statement_union_type *)) |
252b5132 | 330 | { |
08da4cac | 331 | lang_for_each_statement_worker (func, statement_list.head); |
252b5132 RH |
332 | } |
333 | ||
334 | /*----------------------------------------------------------------------*/ | |
08da4cac | 335 | |
252b5132 | 336 | void |
1579bae1 | 337 | lang_list_init (lang_statement_list_type *list) |
252b5132 | 338 | { |
1579bae1 | 339 | list->head = NULL; |
252b5132 RH |
340 | list->tail = &list->head; |
341 | } | |
342 | ||
08da4cac | 343 | /* Build a new statement node for the parse tree. */ |
252b5132 | 344 | |
08da4cac | 345 | static lang_statement_union_type * |
1579bae1 AM |
346 | new_statement (enum statement_enum type, |
347 | size_t size, | |
348 | lang_statement_list_type *list) | |
252b5132 | 349 | { |
1579bae1 | 350 | lang_statement_union_type *new; |
252b5132 | 351 | |
1579bae1 | 352 | new = stat_alloc (size); |
252b5132 | 353 | new->header.type = type; |
1579bae1 | 354 | new->header.next = NULL; |
252b5132 RH |
355 | lang_statement_append (list, new, &new->header.next); |
356 | return new; | |
357 | } | |
358 | ||
08da4cac KH |
359 | /* Build a new input file node for the language. There are several |
360 | ways in which we treat an input file, eg, we only look at symbols, | |
361 | or prefix it with a -l etc. | |
252b5132 | 362 | |
08da4cac | 363 | We can be supplied with requests for input files more than once; |
396a2467 | 364 | they may, for example be split over several lines like foo.o(.text) |
d1778b88 | 365 | foo.o(.data) etc, so when asked for a file we check that we haven't |
08da4cac | 366 | got it already so we don't duplicate the bfd. */ |
252b5132 | 367 | |
252b5132 | 368 | static lang_input_statement_type * |
1579bae1 AM |
369 | new_afile (const char *name, |
370 | lang_input_file_enum_type file_type, | |
371 | const char *target, | |
372 | bfd_boolean add_to_list) | |
252b5132 RH |
373 | { |
374 | lang_input_statement_type *p; | |
375 | ||
376 | if (add_to_list) | |
377 | p = new_stat (lang_input_statement, stat_ptr); | |
378 | else | |
379 | { | |
1579bae1 | 380 | p = stat_alloc (sizeof (lang_input_statement_type)); |
252b5132 RH |
381 | p->header.next = NULL; |
382 | } | |
383 | ||
b34976b6 | 384 | lang_has_input_file = TRUE; |
252b5132 | 385 | p->target = target; |
e3f2db7f | 386 | p->sysrooted = FALSE; |
252b5132 RH |
387 | switch (file_type) |
388 | { | |
389 | case lang_input_file_is_symbols_only_enum: | |
390 | p->filename = name; | |
b34976b6 AM |
391 | p->is_archive = FALSE; |
392 | p->real = TRUE; | |
252b5132 | 393 | p->local_sym_name = name; |
b34976b6 AM |
394 | p->just_syms_flag = TRUE; |
395 | p->search_dirs_flag = FALSE; | |
252b5132 RH |
396 | break; |
397 | case lang_input_file_is_fake_enum: | |
398 | p->filename = name; | |
b34976b6 AM |
399 | p->is_archive = FALSE; |
400 | p->real = FALSE; | |
252b5132 | 401 | p->local_sym_name = name; |
b34976b6 AM |
402 | p->just_syms_flag = FALSE; |
403 | p->search_dirs_flag = FALSE; | |
252b5132 RH |
404 | break; |
405 | case lang_input_file_is_l_enum: | |
b34976b6 | 406 | p->is_archive = TRUE; |
252b5132 | 407 | p->filename = name; |
b34976b6 | 408 | p->real = TRUE; |
1579bae1 | 409 | p->local_sym_name = concat ("-l", name, NULL); |
b34976b6 AM |
410 | p->just_syms_flag = FALSE; |
411 | p->search_dirs_flag = TRUE; | |
252b5132 RH |
412 | break; |
413 | case lang_input_file_is_marker_enum: | |
414 | p->filename = name; | |
b34976b6 AM |
415 | p->is_archive = FALSE; |
416 | p->real = FALSE; | |
252b5132 | 417 | p->local_sym_name = name; |
b34976b6 AM |
418 | p->just_syms_flag = FALSE; |
419 | p->search_dirs_flag = TRUE; | |
252b5132 RH |
420 | break; |
421 | case lang_input_file_is_search_file_enum: | |
e3f2db7f | 422 | p->sysrooted = ldlang_sysrooted_script; |
252b5132 | 423 | p->filename = name; |
b34976b6 AM |
424 | p->is_archive = FALSE; |
425 | p->real = TRUE; | |
252b5132 | 426 | p->local_sym_name = name; |
b34976b6 AM |
427 | p->just_syms_flag = FALSE; |
428 | p->search_dirs_flag = TRUE; | |
252b5132 RH |
429 | break; |
430 | case lang_input_file_is_file_enum: | |
431 | p->filename = name; | |
b34976b6 AM |
432 | p->is_archive = FALSE; |
433 | p->real = TRUE; | |
252b5132 | 434 | p->local_sym_name = name; |
b34976b6 AM |
435 | p->just_syms_flag = FALSE; |
436 | p->search_dirs_flag = FALSE; | |
252b5132 RH |
437 | break; |
438 | default: | |
439 | FAIL (); | |
440 | } | |
1579bae1 AM |
441 | p->the_bfd = NULL; |
442 | p->asymbols = NULL; | |
443 | p->next_real_file = NULL; | |
444 | p->next = NULL; | |
252b5132 RH |
445 | p->symbol_count = 0; |
446 | p->dynamic = config.dynamic_link; | |
447 | p->whole_archive = whole_archive; | |
b34976b6 | 448 | p->loaded = FALSE; |
252b5132 RH |
449 | lang_statement_append (&input_file_chain, |
450 | (lang_statement_union_type *) p, | |
451 | &p->next_real_file); | |
452 | return p; | |
453 | } | |
454 | ||
455 | lang_input_statement_type * | |
1579bae1 AM |
456 | lang_add_input_file (const char *name, |
457 | lang_input_file_enum_type file_type, | |
458 | const char *target) | |
252b5132 | 459 | { |
b34976b6 AM |
460 | lang_has_input_file = TRUE; |
461 | return new_afile (name, file_type, target, TRUE); | |
252b5132 RH |
462 | } |
463 | ||
08da4cac KH |
464 | /* Build enough state so that the parser can build its tree. */ |
465 | ||
252b5132 | 466 | void |
1579bae1 | 467 | lang_init (void) |
252b5132 RH |
468 | { |
469 | obstack_begin (&stat_obstack, 1000); | |
470 | ||
471 | stat_ptr = &statement_list; | |
472 | ||
473 | lang_list_init (stat_ptr); | |
474 | ||
475 | lang_list_init (&input_file_chain); | |
476 | lang_list_init (&lang_output_section_statement); | |
477 | lang_list_init (&file_chain); | |
1579bae1 AM |
478 | first_file = lang_add_input_file (NULL, lang_input_file_is_marker_enum, |
479 | NULL); | |
08da4cac KH |
480 | abs_output_section = |
481 | lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME); | |
252b5132 RH |
482 | |
483 | abs_output_section->bfd_section = bfd_abs_section_ptr; | |
420e579c HPN |
484 | |
485 | /* The value "3" is ad-hoc, somewhat related to the expected number of | |
486 | DEFINED expressions in a linker script. For most default linker | |
487 | scripts, there are none. Why a hash table then? Well, it's somewhat | |
488 | simpler to re-use working machinery than using a linked list in terms | |
489 | of code-complexity here in ld, besides the initialization which just | |
490 | looks like other code here. */ | |
491 | if (bfd_hash_table_init_n (&lang_definedness_table, | |
492 | lang_definedness_newfunc, 3) != TRUE) | |
493 | einfo (_("%P%F: out of memory during initialization")); | |
494 | ||
495 | /* Callers of exp_fold_tree need to increment this. */ | |
496 | lang_statement_iteration = 0; | |
252b5132 RH |
497 | } |
498 | ||
499 | /*---------------------------------------------------------------------- | |
08da4cac KH |
500 | A region is an area of memory declared with the |
501 | MEMORY { name:org=exp, len=exp ... } | |
502 | syntax. | |
252b5132 | 503 | |
08da4cac | 504 | We maintain a list of all the regions here. |
252b5132 | 505 | |
08da4cac KH |
506 | If no regions are specified in the script, then the default is used |
507 | which is created when looked up to be the entire data space. */ | |
252b5132 RH |
508 | |
509 | static lang_memory_region_type *lang_memory_region_list; | |
510 | static lang_memory_region_type **lang_memory_region_list_tail = &lang_memory_region_list; | |
511 | ||
512 | lang_memory_region_type * | |
1579bae1 | 513 | lang_memory_region_lookup (const char *const name) |
252b5132 RH |
514 | { |
515 | lang_memory_region_type *p; | |
1579bae1 | 516 | lang_memory_region_type *new; |
252b5132 | 517 | |
9f88b410 RS |
518 | /* NAME is NULL for LMA memspecs if no region was specified. */ |
519 | if (name == NULL) | |
520 | return NULL; | |
521 | ||
1579bae1 | 522 | for (p = lang_memory_region_list; p != NULL; p = p->next) |
252b5132 RH |
523 | { |
524 | if (strcmp (p->name, name) == 0) | |
1579bae1 | 525 | return p; |
252b5132 RH |
526 | } |
527 | ||
528 | #if 0 | |
529 | /* This code used to always use the first region in the list as the | |
530 | default region. I changed it to instead use a region | |
531 | encompassing all of memory as the default region. This permits | |
532 | NOLOAD sections to work reasonably without requiring a region. | |
533 | People should specify what region they mean, if they really want | |
534 | a region. */ | |
535 | if (strcmp (name, "*default*") == 0) | |
536 | { | |
1579bae1 AM |
537 | if (lang_memory_region_list != NULL) |
538 | return lang_memory_region_list; | |
252b5132 RH |
539 | } |
540 | #endif | |
541 | ||
1579bae1 | 542 | new = stat_alloc (sizeof (lang_memory_region_type)); |
252b5132 | 543 | |
1579bae1 AM |
544 | new->name = xstrdup (name); |
545 | new->next = NULL; | |
252b5132 | 546 | |
1579bae1 AM |
547 | *lang_memory_region_list_tail = new; |
548 | lang_memory_region_list_tail = &new->next; | |
549 | new->origin = 0; | |
550 | new->flags = 0; | |
551 | new->not_flags = 0; | |
552 | new->length = ~(bfd_size_type) 0; | |
553 | new->current = 0; | |
554 | new->had_full_message = FALSE; | |
252b5132 | 555 | |
1579bae1 | 556 | return new; |
252b5132 RH |
557 | } |
558 | ||
5f992e62 | 559 | static lang_memory_region_type * |
1579bae1 | 560 | lang_memory_default (asection *section) |
252b5132 RH |
561 | { |
562 | lang_memory_region_type *p; | |
563 | ||
564 | flagword sec_flags = section->flags; | |
565 | ||
566 | /* Override SEC_DATA to mean a writable section. */ | |
567 | if ((sec_flags & (SEC_ALLOC | SEC_READONLY | SEC_CODE)) == SEC_ALLOC) | |
568 | sec_flags |= SEC_DATA; | |
569 | ||
1579bae1 | 570 | for (p = lang_memory_region_list; p != NULL; p = p->next) |
252b5132 RH |
571 | { |
572 | if ((p->flags & sec_flags) != 0 | |
573 | && (p->not_flags & sec_flags) == 0) | |
574 | { | |
575 | return p; | |
576 | } | |
577 | } | |
578 | return lang_memory_region_lookup ("*default*"); | |
579 | } | |
580 | ||
581 | lang_output_section_statement_type * | |
1579bae1 | 582 | lang_output_section_find (const char *const name) |
252b5132 RH |
583 | { |
584 | lang_statement_union_type *u; | |
585 | lang_output_section_statement_type *lookup; | |
586 | ||
1579bae1 | 587 | for (u = lang_output_section_statement.head; u != NULL; u = lookup->next) |
252b5132 RH |
588 | { |
589 | lookup = &u->output_section_statement; | |
590 | if (strcmp (name, lookup->name) == 0) | |
1579bae1 | 591 | return lookup; |
252b5132 | 592 | } |
1579bae1 | 593 | return NULL; |
252b5132 RH |
594 | } |
595 | ||
596 | lang_output_section_statement_type * | |
1579bae1 | 597 | lang_output_section_statement_lookup (const char *const name) |
252b5132 RH |
598 | { |
599 | lang_output_section_statement_type *lookup; | |
600 | ||
601 | lookup = lang_output_section_find (name); | |
1579bae1 | 602 | if (lookup == NULL) |
252b5132 | 603 | { |
1579bae1 AM |
604 | lookup = new_stat (lang_output_section_statement, stat_ptr); |
605 | lookup->region = NULL; | |
606 | lookup->lma_region = NULL; | |
607 | lookup->fill = 0; | |
252b5132 RH |
608 | lookup->block_value = 1; |
609 | lookup->name = name; | |
610 | ||
1579bae1 AM |
611 | lookup->next = NULL; |
612 | lookup->bfd_section = NULL; | |
b34976b6 | 613 | lookup->processed = FALSE; |
252b5132 | 614 | lookup->sectype = normal_section; |
1579bae1 | 615 | lookup->addr_tree = NULL; |
252b5132 RH |
616 | lang_list_init (&lookup->children); |
617 | ||
1579bae1 | 618 | lookup->memspec = NULL; |
252b5132 RH |
619 | lookup->flags = 0; |
620 | lookup->subsection_alignment = -1; | |
621 | lookup->section_alignment = -1; | |
1579bae1 | 622 | lookup->load_base = NULL; |
9f88b410 | 623 | lookup->update_dot_tree = NULL; |
252b5132 RH |
624 | lookup->phdrs = NULL; |
625 | ||
626 | lang_statement_append (&lang_output_section_statement, | |
627 | (lang_statement_union_type *) lookup, | |
628 | &lookup->next); | |
629 | } | |
630 | return lookup; | |
631 | } | |
632 | ||
633 | static void | |
1579bae1 | 634 | lang_map_flags (flagword flag) |
252b5132 RH |
635 | { |
636 | if (flag & SEC_ALLOC) | |
637 | minfo ("a"); | |
638 | ||
639 | if (flag & SEC_CODE) | |
640 | minfo ("x"); | |
641 | ||
642 | if (flag & SEC_READONLY) | |
643 | minfo ("r"); | |
644 | ||
645 | if (flag & SEC_DATA) | |
646 | minfo ("w"); | |
647 | ||
648 | if (flag & SEC_LOAD) | |
649 | minfo ("l"); | |
650 | } | |
651 | ||
652 | void | |
1579bae1 | 653 | lang_map (void) |
252b5132 RH |
654 | { |
655 | lang_memory_region_type *m; | |
656 | ||
657 | minfo (_("\nMemory Configuration\n\n")); | |
658 | fprintf (config.map_file, "%-16s %-18s %-18s %s\n", | |
659 | _("Name"), _("Origin"), _("Length"), _("Attributes")); | |
660 | ||
1579bae1 | 661 | for (m = lang_memory_region_list; m != NULL; m = m->next) |
252b5132 RH |
662 | { |
663 | char buf[100]; | |
664 | int len; | |
665 | ||
666 | fprintf (config.map_file, "%-16s ", m->name); | |
667 | ||
668 | sprintf_vma (buf, m->origin); | |
669 | minfo ("0x%s ", buf); | |
670 | len = strlen (buf); | |
671 | while (len < 16) | |
672 | { | |
673 | print_space (); | |
674 | ++len; | |
675 | } | |
676 | ||
677 | minfo ("0x%V", m->length); | |
678 | if (m->flags || m->not_flags) | |
679 | { | |
680 | #ifndef BFD64 | |
681 | minfo (" "); | |
682 | #endif | |
683 | if (m->flags) | |
684 | { | |
685 | print_space (); | |
686 | lang_map_flags (m->flags); | |
687 | } | |
688 | ||
689 | if (m->not_flags) | |
690 | { | |
691 | minfo (" !"); | |
692 | lang_map_flags (m->not_flags); | |
693 | } | |
694 | } | |
695 | ||
696 | print_nl (); | |
697 | } | |
698 | ||
699 | fprintf (config.map_file, _("\nLinker script and memory map\n\n")); | |
700 | ||
701 | print_statements (); | |
702 | } | |
703 | ||
704 | /* Initialize an output section. */ | |
705 | ||
706 | static void | |
1579bae1 | 707 | init_os (lang_output_section_statement_type *s) |
252b5132 RH |
708 | { |
709 | section_userdata_type *new; | |
710 | ||
711 | if (s->bfd_section != NULL) | |
712 | return; | |
713 | ||
714 | if (strcmp (s->name, DISCARD_SECTION_NAME) == 0) | |
6f9efd97 | 715 | einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME); |
252b5132 | 716 | |
1579bae1 | 717 | new = stat_alloc (sizeof (section_userdata_type)); |
252b5132 RH |
718 | |
719 | s->bfd_section = bfd_get_section_by_name (output_bfd, s->name); | |
1579bae1 | 720 | if (s->bfd_section == NULL) |
252b5132 | 721 | s->bfd_section = bfd_make_section (output_bfd, s->name); |
1579bae1 | 722 | if (s->bfd_section == NULL) |
252b5132 RH |
723 | { |
724 | einfo (_("%P%F: output format %s cannot represent section called %s\n"), | |
725 | output_bfd->xvec->name, s->name); | |
726 | } | |
727 | s->bfd_section->output_section = s->bfd_section; | |
728 | ||
08da4cac KH |
729 | /* We initialize an output sections output offset to minus its own |
730 | vma to allow us to output a section through itself. */ | |
252b5132 | 731 | s->bfd_section->output_offset = 0; |
1579bae1 | 732 | get_userdata (s->bfd_section) = new; |
252b5132 RH |
733 | |
734 | /* If there is a base address, make sure that any sections it might | |
735 | mention are initialized. */ | |
736 | if (s->addr_tree != NULL) | |
737 | exp_init_os (s->addr_tree); | |
18794b0c AM |
738 | |
739 | if (s->load_base != NULL) | |
740 | exp_init_os (s->load_base); | |
252b5132 RH |
741 | } |
742 | ||
743 | /* Make sure that all output sections mentioned in an expression are | |
744 | initialized. */ | |
745 | ||
746 | static void | |
1579bae1 | 747 | exp_init_os (etree_type *exp) |
252b5132 RH |
748 | { |
749 | switch (exp->type.node_class) | |
750 | { | |
751 | case etree_assign: | |
752 | exp_init_os (exp->assign.src); | |
753 | break; | |
754 | ||
755 | case etree_binary: | |
756 | exp_init_os (exp->binary.lhs); | |
757 | exp_init_os (exp->binary.rhs); | |
758 | break; | |
759 | ||
760 | case etree_trinary: | |
761 | exp_init_os (exp->trinary.cond); | |
762 | exp_init_os (exp->trinary.lhs); | |
763 | exp_init_os (exp->trinary.rhs); | |
764 | break; | |
765 | ||
766 | case etree_unary: | |
767 | exp_init_os (exp->unary.child); | |
768 | break; | |
769 | ||
770 | case etree_name: | |
771 | switch (exp->type.node_code) | |
772 | { | |
773 | case ADDR: | |
774 | case LOADADDR: | |
775 | case SIZEOF: | |
776 | { | |
777 | lang_output_section_statement_type *os; | |
778 | ||
779 | os = lang_output_section_find (exp->name.name); | |
780 | if (os != NULL && os->bfd_section == NULL) | |
781 | init_os (os); | |
782 | } | |
783 | } | |
784 | break; | |
785 | ||
786 | default: | |
787 | break; | |
788 | } | |
789 | } | |
9503fd87 | 790 | \f |
252b5132 | 791 | /* Sections marked with the SEC_LINK_ONCE flag should only be linked |
9503fd87 ILT |
792 | once into the output. This routine checks each section, and |
793 | arrange to discard it if a section of the same name has already | |
bb8fe706 ILT |
794 | been linked. If the section has COMDAT information, then it uses |
795 | that to decide whether the section should be included. This code | |
796 | assumes that all relevant sections have the SEC_LINK_ONCE flag set; | |
9503fd87 ILT |
797 | that is, it does not depend solely upon the section name. |
798 | section_already_linked is called via bfd_map_over_sections. */ | |
799 | ||
800 | /* This is the shape of the elements inside the already_linked hash | |
801 | table. It maps a name onto a list of already_linked elements with | |
802 | the same name. It's possible to get more than one element in a | |
803 | list if the COMDAT sections have different names. */ | |
804 | ||
5f992e62 | 805 | struct already_linked_hash_entry |
9503fd87 ILT |
806 | { |
807 | struct bfd_hash_entry root; | |
808 | struct already_linked *entry; | |
809 | }; | |
810 | ||
5f992e62 | 811 | struct already_linked |
9503fd87 ILT |
812 | { |
813 | struct already_linked *next; | |
814 | asection *sec; | |
815 | }; | |
816 | ||
817 | /* The hash table. */ | |
818 | ||
819 | static struct bfd_hash_table already_linked_table; | |
252b5132 | 820 | |
252b5132 | 821 | static void |
1579bae1 | 822 | section_already_linked (bfd *abfd, asection *sec, void *data) |
252b5132 | 823 | { |
1579bae1 | 824 | lang_input_statement_type *entry = data; |
252b5132 RH |
825 | flagword flags; |
826 | const char *name; | |
9503fd87 ILT |
827 | struct already_linked *l; |
828 | struct already_linked_hash_entry *already_linked_list; | |
252b5132 RH |
829 | |
830 | /* If we are only reading symbols from this object, then we want to | |
831 | discard all sections. */ | |
832 | if (entry->just_syms_flag) | |
833 | { | |
c2c01aa7 | 834 | bfd_link_just_syms (sec, &link_info); |
252b5132 RH |
835 | return; |
836 | } | |
837 | ||
838 | flags = bfd_get_section_flags (abfd, sec); | |
839 | ||
840 | if ((flags & SEC_LINK_ONCE) == 0) | |
841 | return; | |
842 | ||
577a0623 | 843 | /* FIXME: When doing a relocatable link, we may have trouble |
e361c369 ILT |
844 | copying relocations in other sections that refer to local symbols |
845 | in the section being discarded. Those relocations will have to | |
846 | be converted somehow; as of this writing I'm not sure that any of | |
847 | the backends handle that correctly. | |
848 | ||
849 | It is tempting to instead not discard link once sections when | |
577a0623 | 850 | doing a relocatable link (technically, they should be discarded |
e361c369 ILT |
851 | whenever we are building constructors). However, that fails, |
852 | because the linker winds up combining all the link once sections | |
853 | into a single large link once section, which defeats the purpose | |
854 | of having link once sections in the first place. | |
855 | ||
577a0623 | 856 | Also, not merging link once sections in a relocatable link |
9ad85d9b | 857 | causes trouble for MIPS ELF, which relies on link once semantics |
e361c369 ILT |
858 | to handle the .reginfo section correctly. */ |
859 | ||
252b5132 RH |
860 | name = bfd_get_section_name (abfd, sec); |
861 | ||
5f992e62 | 862 | already_linked_list = |
9503fd87 | 863 | ((struct already_linked_hash_entry *) |
b34976b6 | 864 | bfd_hash_lookup (&already_linked_table, name, TRUE, FALSE)); |
9503fd87 | 865 | |
08da4cac | 866 | for (l = already_linked_list->entry; l != NULL; l = l->next) |
252b5132 | 867 | { |
9503fd87 ILT |
868 | if (sec->comdat == NULL |
869 | || l->sec->comdat == NULL | |
870 | || strcmp (sec->comdat->name, l->sec->comdat->name) == 0) | |
252b5132 RH |
871 | { |
872 | /* The section has already been linked. See if we should | |
873 | issue a warning. */ | |
874 | switch (flags & SEC_LINK_DUPLICATES) | |
875 | { | |
876 | default: | |
877 | abort (); | |
878 | ||
879 | case SEC_LINK_DUPLICATES_DISCARD: | |
880 | break; | |
881 | ||
882 | case SEC_LINK_DUPLICATES_ONE_ONLY: | |
bb8fe706 ILT |
883 | if (sec->comdat == NULL) |
884 | einfo (_("%P: %B: warning: ignoring duplicate section `%s'\n"), | |
885 | abfd, name); | |
886 | else | |
887 | einfo (_("%P: %B: warning: ignoring duplicate `%s' section symbol `%s'\n"), | |
888 | abfd, name, sec->comdat->name); | |
252b5132 RH |
889 | break; |
890 | ||
891 | case SEC_LINK_DUPLICATES_SAME_CONTENTS: | |
892 | /* FIXME: We should really dig out the contents of both | |
893 | sections and memcmp them. The COFF/PE spec says that | |
894 | the Microsoft linker does not implement this | |
895 | correctly, so I'm not going to bother doing it | |
896 | either. */ | |
897 | /* Fall through. */ | |
898 | case SEC_LINK_DUPLICATES_SAME_SIZE: | |
899 | if (bfd_section_size (abfd, sec) | |
900 | != bfd_section_size (l->sec->owner, l->sec)) | |
901 | einfo (_("%P: %B: warning: duplicate section `%s' has different size\n"), | |
902 | abfd, name); | |
903 | break; | |
904 | } | |
905 | ||
39dcfe18 AM |
906 | /* Set the output_section field so that lang_add_section |
907 | does not create a lang_input_section structure for this | |
f97b9cb8 L |
908 | section. Since there might be a symbol in the section |
909 | being discarded, we must retain a pointer to the section | |
910 | which we are really going to use. */ | |
252b5132 | 911 | sec->output_section = bfd_abs_section_ptr; |
f97b9cb8 | 912 | sec->kept_section = l->sec; |
252b5132 | 913 | |
9ad85d9b AM |
914 | if (flags & SEC_GROUP) |
915 | bfd_discard_group (abfd, sec); | |
916 | ||
252b5132 RH |
917 | return; |
918 | } | |
919 | } | |
920 | ||
9503fd87 ILT |
921 | /* This is the first section with this name. Record it. Allocate |
922 | the memory from the same obstack as the hash table is kept in. */ | |
923 | ||
1579bae1 | 924 | l = bfd_hash_allocate (&already_linked_table, sizeof *l); |
252b5132 | 925 | |
252b5132 | 926 | l->sec = sec; |
9503fd87 ILT |
927 | l->next = already_linked_list->entry; |
928 | already_linked_list->entry = l; | |
929 | } | |
930 | ||
931 | /* Support routines for the hash table used by section_already_linked, | |
932 | initialize the table, fill in an entry and remove the table. */ | |
933 | ||
934 | static struct bfd_hash_entry * | |
1579bae1 AM |
935 | already_linked_newfunc (struct bfd_hash_entry *entry ATTRIBUTE_UNUSED, |
936 | struct bfd_hash_table *table, | |
937 | const char *string ATTRIBUTE_UNUSED) | |
9503fd87 | 938 | { |
5f992e62 | 939 | struct already_linked_hash_entry *ret = |
9503fd87 ILT |
940 | bfd_hash_allocate (table, sizeof (struct already_linked_hash_entry)); |
941 | ||
942 | ret->entry = NULL; | |
943 | ||
1579bae1 | 944 | return &ret->root; |
9503fd87 ILT |
945 | } |
946 | ||
947 | static void | |
1579bae1 | 948 | already_linked_table_init (void) |
9503fd87 ILT |
949 | { |
950 | if (! bfd_hash_table_init_n (&already_linked_table, | |
951 | already_linked_newfunc, | |
952 | 42)) | |
953 | einfo (_("%P%F: Failed to create hash table\n")); | |
954 | } | |
955 | ||
956 | static void | |
1579bae1 | 957 | already_linked_table_free (void) |
9503fd87 ILT |
958 | { |
959 | bfd_hash_table_free (&already_linked_table); | |
252b5132 RH |
960 | } |
961 | \f | |
962 | /* The wild routines. | |
963 | ||
964 | These expand statements like *(.text) and foo.o to a list of | |
965 | explicit actions, like foo.o(.text), bar.o(.text) and | |
966 | foo.o(.text, .data). */ | |
967 | ||
b34976b6 | 968 | /* Return TRUE if the PATTERN argument is a wildcard pattern. |
252b5132 RH |
969 | Although backslashes are treated specially if a pattern contains |
970 | wildcards, we do not consider the mere presence of a backslash to | |
ca0c1d3e | 971 | be enough to cause the pattern to be treated as a wildcard. |
252b5132 RH |
972 | That lets us handle DOS filenames more naturally. */ |
973 | ||
b34976b6 | 974 | static bfd_boolean |
1579bae1 | 975 | wildcardp (const char *pattern) |
252b5132 RH |
976 | { |
977 | const char *s; | |
978 | ||
979 | for (s = pattern; *s != '\0'; ++s) | |
980 | if (*s == '?' | |
981 | || *s == '*' | |
982 | || *s == '[') | |
b34976b6 AM |
983 | return TRUE; |
984 | return FALSE; | |
252b5132 RH |
985 | } |
986 | ||
987 | /* Add SECTION to the output section OUTPUT. Do this by creating a | |
988 | lang_input_section statement which is placed at PTR. FILE is the | |
989 | input file which holds SECTION. */ | |
990 | ||
991 | void | |
1579bae1 AM |
992 | lang_add_section (lang_statement_list_type *ptr, |
993 | asection *section, | |
994 | lang_output_section_statement_type *output, | |
995 | lang_input_statement_type *file) | |
252b5132 RH |
996 | { |
997 | flagword flags; | |
b34976b6 | 998 | bfd_boolean discard; |
252b5132 RH |
999 | |
1000 | flags = bfd_get_section_flags (section->owner, section); | |
1001 | ||
b34976b6 | 1002 | discard = FALSE; |
252b5132 | 1003 | |
c4c41219 AM |
1004 | /* Discard sections marked with SEC_EXCLUDE if we are doing a final |
1005 | link. Discard debugging sections marked with SEC_EXCLUDE on a | |
1006 | relocatable link too. */ | |
1007 | if ((flags & SEC_EXCLUDE) != 0 | |
1049f94e | 1008 | && ((flags & SEC_DEBUGGING) != 0 || !link_info.relocatable)) |
b34976b6 | 1009 | discard = TRUE; |
252b5132 RH |
1010 | |
1011 | /* Discard input sections which are assigned to a section named | |
1012 | DISCARD_SECTION_NAME. */ | |
1013 | if (strcmp (output->name, DISCARD_SECTION_NAME) == 0) | |
b34976b6 | 1014 | discard = TRUE; |
252b5132 RH |
1015 | |
1016 | /* Discard debugging sections if we are stripping debugging | |
1017 | information. */ | |
1018 | if ((link_info.strip == strip_debugger || link_info.strip == strip_all) | |
1019 | && (flags & SEC_DEBUGGING) != 0) | |
b34976b6 | 1020 | discard = TRUE; |
252b5132 RH |
1021 | |
1022 | if (discard) | |
1023 | { | |
1024 | if (section->output_section == NULL) | |
1025 | { | |
1026 | /* This prevents future calls from assigning this section. */ | |
1027 | section->output_section = bfd_abs_section_ptr; | |
1028 | } | |
1029 | return; | |
1030 | } | |
1031 | ||
1032 | if (section->output_section == NULL) | |
1033 | { | |
b34976b6 | 1034 | bfd_boolean first; |
252b5132 RH |
1035 | lang_input_section_type *new; |
1036 | flagword flags; | |
1037 | ||
1038 | if (output->bfd_section == NULL) | |
d1778b88 AM |
1039 | init_os (output); |
1040 | ||
1041 | first = ! output->bfd_section->linker_has_input; | |
1042 | output->bfd_section->linker_has_input = 1; | |
252b5132 | 1043 | |
08da4cac | 1044 | /* Add a section reference to the list. */ |
252b5132 RH |
1045 | new = new_stat (lang_input_section, ptr); |
1046 | ||
1047 | new->section = section; | |
1048 | new->ifile = file; | |
1049 | section->output_section = output->bfd_section; | |
1050 | ||
1051 | flags = section->flags; | |
1052 | ||
1053 | /* We don't copy the SEC_NEVER_LOAD flag from an input section | |
1054 | to an output section, because we want to be able to include a | |
1055 | SEC_NEVER_LOAD section in the middle of an otherwise loaded | |
1056 | section (I don't know why we want to do this, but we do). | |
1057 | build_link_order in ldwrite.c handles this case by turning | |
1058 | the embedded SEC_NEVER_LOAD section into a fill. */ | |
1059 | ||
1060 | flags &= ~ SEC_NEVER_LOAD; | |
1061 | ||
1062 | /* If final link, don't copy the SEC_LINK_ONCE flags, they've | |
1063 | already been processed. One reason to do this is that on pe | |
1064 | format targets, .text$foo sections go into .text and it's odd | |
1065 | to see .text with SEC_LINK_ONCE set. */ | |
1066 | ||
1049f94e | 1067 | if (! link_info.relocatable) |
252b5132 RH |
1068 | flags &= ~ (SEC_LINK_ONCE | SEC_LINK_DUPLICATES); |
1069 | ||
1070 | /* If this is not the first input section, and the SEC_READONLY | |
1071 | flag is not currently set, then don't set it just because the | |
1072 | input section has it set. */ | |
1073 | ||
1074 | if (! first && (section->output_section->flags & SEC_READONLY) == 0) | |
1075 | flags &= ~ SEC_READONLY; | |
1076 | ||
f5fa8ca2 JJ |
1077 | /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */ |
1078 | if (! first | |
1079 | && ((section->output_section->flags & (SEC_MERGE | SEC_STRINGS)) | |
1080 | != (flags & (SEC_MERGE | SEC_STRINGS)) | |
1081 | || ((flags & SEC_MERGE) | |
1082 | && section->output_section->entsize != section->entsize))) | |
1083 | { | |
1084 | section->output_section->flags &= ~ (SEC_MERGE | SEC_STRINGS); | |
1085 | flags &= ~ (SEC_MERGE | SEC_STRINGS); | |
1086 | } | |
1087 | ||
13ae64f3 | 1088 | /* For now make .tbss normal section. */ |
1049f94e | 1089 | if ((flags & SEC_THREAD_LOCAL) && ! link_info.relocatable) |
13ae64f3 JJ |
1090 | flags |= SEC_LOAD; |
1091 | ||
252b5132 RH |
1092 | section->output_section->flags |= flags; |
1093 | ||
f5fa8ca2 JJ |
1094 | if (flags & SEC_MERGE) |
1095 | section->output_section->entsize = section->entsize; | |
1096 | ||
252b5132 RH |
1097 | /* If SEC_READONLY is not set in the input section, then clear |
1098 | it from the output section. */ | |
1099 | if ((section->flags & SEC_READONLY) == 0) | |
1100 | section->output_section->flags &= ~SEC_READONLY; | |
1101 | ||
1102 | switch (output->sectype) | |
1103 | { | |
1104 | case normal_section: | |
1105 | break; | |
1106 | case dsect_section: | |
1107 | case copy_section: | |
1108 | case info_section: | |
1109 | case overlay_section: | |
1110 | output->bfd_section->flags &= ~SEC_ALLOC; | |
1111 | break; | |
1112 | case noload_section: | |
1113 | output->bfd_section->flags &= ~SEC_LOAD; | |
1114 | output->bfd_section->flags |= SEC_NEVER_LOAD; | |
1115 | break; | |
1116 | } | |
1117 | ||
667f5177 ILT |
1118 | /* Copy over SEC_SMALL_DATA. */ |
1119 | if (section->flags & SEC_SMALL_DATA) | |
1120 | section->output_section->flags |= SEC_SMALL_DATA; | |
9e41f973 | 1121 | |
252b5132 RH |
1122 | if (section->alignment_power > output->bfd_section->alignment_power) |
1123 | output->bfd_section->alignment_power = section->alignment_power; | |
1124 | ||
396a2467 | 1125 | /* If supplied an alignment, then force it. */ |
252b5132 RH |
1126 | if (output->section_alignment != -1) |
1127 | output->bfd_section->alignment_power = output->section_alignment; | |
74459f0e TW |
1128 | |
1129 | if (section->flags & SEC_BLOCK) | |
08da4cac KH |
1130 | { |
1131 | section->output_section->flags |= SEC_BLOCK; | |
1132 | /* FIXME: This value should really be obtained from the bfd... */ | |
1133 | output->block_value = 128; | |
1134 | } | |
252b5132 RH |
1135 | } |
1136 | } | |
1137 | ||
1138 | /* Handle wildcard sorting. This returns the lang_input_section which | |
1139 | should follow the one we are going to create for SECTION and FILE, | |
1140 | based on the sorting requirements of WILD. It returns NULL if the | |
1141 | new section should just go at the end of the current list. */ | |
1142 | ||
1143 | static lang_statement_union_type * | |
1579bae1 AM |
1144 | wild_sort (lang_wild_statement_type *wild, |
1145 | struct wildcard_list *sec, | |
1146 | lang_input_statement_type *file, | |
1147 | asection *section) | |
252b5132 RH |
1148 | { |
1149 | const char *section_name; | |
1150 | lang_statement_union_type *l; | |
1151 | ||
b6bf44ba | 1152 | if (!wild->filenames_sorted && (sec == NULL || !sec->spec.sorted)) |
252b5132 RH |
1153 | return NULL; |
1154 | ||
1155 | section_name = bfd_get_section_name (file->the_bfd, section); | |
bba1a0c0 | 1156 | for (l = wild->children.head; l != NULL; l = l->header.next) |
252b5132 RH |
1157 | { |
1158 | lang_input_section_type *ls; | |
1159 | ||
1160 | if (l->header.type != lang_input_section_enum) | |
1161 | continue; | |
1162 | ls = &l->input_section; | |
1163 | ||
1164 | /* Sorting by filename takes precedence over sorting by section | |
1165 | name. */ | |
1166 | ||
1167 | if (wild->filenames_sorted) | |
1168 | { | |
1169 | const char *fn, *ln; | |
b34976b6 | 1170 | bfd_boolean fa, la; |
252b5132 RH |
1171 | int i; |
1172 | ||
1173 | /* The PE support for the .idata section as generated by | |
1174 | dlltool assumes that files will be sorted by the name of | |
1175 | the archive and then the name of the file within the | |
1176 | archive. */ | |
1177 | ||
1178 | if (file->the_bfd != NULL | |
1179 | && bfd_my_archive (file->the_bfd) != NULL) | |
1180 | { | |
1181 | fn = bfd_get_filename (bfd_my_archive (file->the_bfd)); | |
b34976b6 | 1182 | fa = TRUE; |
252b5132 RH |
1183 | } |
1184 | else | |
1185 | { | |
1186 | fn = file->filename; | |
b34976b6 | 1187 | fa = FALSE; |
252b5132 RH |
1188 | } |
1189 | ||
1190 | if (ls->ifile->the_bfd != NULL | |
1191 | && bfd_my_archive (ls->ifile->the_bfd) != NULL) | |
1192 | { | |
1193 | ln = bfd_get_filename (bfd_my_archive (ls->ifile->the_bfd)); | |
b34976b6 | 1194 | la = TRUE; |
252b5132 RH |
1195 | } |
1196 | else | |
1197 | { | |
1198 | ln = ls->ifile->filename; | |
b34976b6 | 1199 | la = FALSE; |
252b5132 RH |
1200 | } |
1201 | ||
1202 | i = strcmp (fn, ln); | |
1203 | if (i > 0) | |
1204 | continue; | |
1205 | else if (i < 0) | |
1206 | break; | |
1207 | ||
1208 | if (fa || la) | |
1209 | { | |
1210 | if (fa) | |
1211 | fn = file->filename; | |
1212 | if (la) | |
1213 | ln = ls->ifile->filename; | |
1214 | ||
1215 | i = strcmp (fn, ln); | |
1216 | if (i > 0) | |
1217 | continue; | |
1218 | else if (i < 0) | |
1219 | break; | |
1220 | } | |
1221 | } | |
1222 | ||
1223 | /* Here either the files are not sorted by name, or we are | |
1224 | looking at the sections for this file. */ | |
1225 | ||
b6bf44ba | 1226 | if (sec != NULL && sec->spec.sorted) |
252b5132 RH |
1227 | { |
1228 | if (strcmp (section_name, | |
1229 | bfd_get_section_name (ls->ifile->the_bfd, | |
1230 | ls->section)) | |
1231 | < 0) | |
1232 | break; | |
1233 | } | |
1234 | } | |
1235 | ||
1236 | return l; | |
1237 | } | |
1238 | ||
1239 | /* Expand a wild statement for a particular FILE. SECTION may be | |
1240 | NULL, in which case it is a wild card. */ | |
1241 | ||
1242 | static void | |
1579bae1 AM |
1243 | output_section_callback (lang_wild_statement_type *ptr, |
1244 | struct wildcard_list *sec, | |
1245 | asection *section, | |
1246 | lang_input_statement_type *file, | |
1247 | void *output) | |
4dec4d4e RH |
1248 | { |
1249 | lang_statement_union_type *before; | |
5f992e62 | 1250 | |
b6bf44ba AM |
1251 | /* Exclude sections that match UNIQUE_SECTION_LIST. */ |
1252 | if (unique_section_p (bfd_get_section_name (file->the_bfd, section))) | |
1253 | return; | |
1254 | ||
4dec4d4e RH |
1255 | /* If the wild pattern was marked KEEP, the member sections |
1256 | should be as well. */ | |
1257 | if (ptr->keep_sections) | |
1258 | section->flags |= SEC_KEEP; | |
5f992e62 | 1259 | |
b6bf44ba | 1260 | before = wild_sort (ptr, sec, file, section); |
5f992e62 | 1261 | |
4dec4d4e RH |
1262 | /* Here BEFORE points to the lang_input_section which |
1263 | should follow the one we are about to add. If BEFORE | |
1264 | is NULL, then the section should just go at the end | |
1265 | of the current list. */ | |
5f992e62 | 1266 | |
4dec4d4e | 1267 | if (before == NULL) |
39dcfe18 AM |
1268 | lang_add_section (&ptr->children, section, |
1269 | (lang_output_section_statement_type *) output, | |
1270 | file); | |
4dec4d4e | 1271 | else |
252b5132 | 1272 | { |
4dec4d4e RH |
1273 | lang_statement_list_type list; |
1274 | lang_statement_union_type **pp; | |
5f992e62 | 1275 | |
4dec4d4e | 1276 | lang_list_init (&list); |
39dcfe18 AM |
1277 | lang_add_section (&list, section, |
1278 | (lang_output_section_statement_type *) output, | |
1279 | file); | |
5f992e62 | 1280 | |
4dec4d4e RH |
1281 | /* If we are discarding the section, LIST.HEAD will |
1282 | be NULL. */ | |
1283 | if (list.head != NULL) | |
252b5132 | 1284 | { |
bba1a0c0 | 1285 | ASSERT (list.head->header.next == NULL); |
5f992e62 | 1286 | |
4dec4d4e RH |
1287 | for (pp = &ptr->children.head; |
1288 | *pp != before; | |
bba1a0c0 | 1289 | pp = &(*pp)->header.next) |
4dec4d4e | 1290 | ASSERT (*pp != NULL); |
5f992e62 | 1291 | |
bba1a0c0 | 1292 | list.head->header.next = *pp; |
4dec4d4e | 1293 | *pp = list.head; |
252b5132 RH |
1294 | } |
1295 | } | |
1296 | } | |
1297 | ||
1298 | /* This is passed a file name which must have been seen already and | |
1299 | added to the statement tree. We will see if it has been opened | |
1300 | already and had its symbols read. If not then we'll read it. */ | |
1301 | ||
1302 | static lang_input_statement_type * | |
1579bae1 | 1303 | lookup_name (const char *name) |
252b5132 RH |
1304 | { |
1305 | lang_input_statement_type *search; | |
1306 | ||
1307 | for (search = (lang_input_statement_type *) input_file_chain.head; | |
1579bae1 | 1308 | search != NULL; |
252b5132 RH |
1309 | search = (lang_input_statement_type *) search->next_real_file) |
1310 | { | |
1579bae1 | 1311 | if (search->filename == NULL && name == NULL) |
252b5132 | 1312 | return search; |
1579bae1 AM |
1313 | if (search->filename != NULL |
1314 | && name != NULL | |
252b5132 RH |
1315 | && strcmp (search->filename, name) == 0) |
1316 | break; | |
1317 | } | |
1318 | ||
1579bae1 | 1319 | if (search == NULL) |
252b5132 | 1320 | search = new_afile (name, lang_input_file_is_file_enum, default_target, |
b34976b6 | 1321 | FALSE); |
252b5132 RH |
1322 | |
1323 | /* If we have already added this file, or this file is not real | |
1324 | (FIXME: can that ever actually happen?) or the name is NULL | |
1325 | (FIXME: can that ever actually happen?) don't add this file. */ | |
1326 | if (search->loaded | |
1327 | || ! search->real | |
1579bae1 | 1328 | || search->filename == NULL) |
252b5132 RH |
1329 | return search; |
1330 | ||
1579bae1 | 1331 | if (! load_symbols (search, NULL)) |
6770ec8c | 1332 | return NULL; |
252b5132 RH |
1333 | |
1334 | return search; | |
1335 | } | |
1336 | ||
1337 | /* Get the symbols for an input file. */ | |
1338 | ||
b34976b6 | 1339 | static bfd_boolean |
1579bae1 AM |
1340 | load_symbols (lang_input_statement_type *entry, |
1341 | lang_statement_list_type *place) | |
252b5132 RH |
1342 | { |
1343 | char **matching; | |
1344 | ||
1345 | if (entry->loaded) | |
b34976b6 | 1346 | return TRUE; |
252b5132 RH |
1347 | |
1348 | ldfile_open_file (entry); | |
1349 | ||
1350 | if (! bfd_check_format (entry->the_bfd, bfd_archive) | |
1351 | && ! bfd_check_format_matches (entry->the_bfd, bfd_object, &matching)) | |
1352 | { | |
1353 | bfd_error_type err; | |
1354 | lang_statement_list_type *hold; | |
b34976b6 | 1355 | bfd_boolean bad_load = TRUE; |
e3f2db7f | 1356 | bfd_boolean save_ldlang_sysrooted_script; |
b7a26f91 | 1357 | |
252b5132 | 1358 | err = bfd_get_error (); |
884fb58e NC |
1359 | |
1360 | /* See if the emulation has some special knowledge. */ | |
1361 | if (ldemul_unrecognized_file (entry)) | |
b34976b6 | 1362 | return TRUE; |
884fb58e | 1363 | |
252b5132 RH |
1364 | if (err == bfd_error_file_ambiguously_recognized) |
1365 | { | |
1366 | char **p; | |
1367 | ||
1368 | einfo (_("%B: file not recognized: %E\n"), entry->the_bfd); | |
1369 | einfo (_("%B: matching formats:"), entry->the_bfd); | |
1370 | for (p = matching; *p != NULL; p++) | |
1371 | einfo (" %s", *p); | |
1372 | einfo ("%F\n"); | |
1373 | } | |
1374 | else if (err != bfd_error_file_not_recognized | |
1375 | || place == NULL) | |
6770ec8c NC |
1376 | einfo (_("%F%B: file not recognized: %E\n"), entry->the_bfd); |
1377 | else | |
b34976b6 | 1378 | bad_load = FALSE; |
b7a26f91 | 1379 | |
252b5132 RH |
1380 | bfd_close (entry->the_bfd); |
1381 | entry->the_bfd = NULL; | |
1382 | ||
252b5132 | 1383 | /* Try to interpret the file as a linker script. */ |
252b5132 RH |
1384 | ldfile_open_command_file (entry->filename); |
1385 | ||
1386 | hold = stat_ptr; | |
1387 | stat_ptr = place; | |
e3f2db7f AO |
1388 | save_ldlang_sysrooted_script = ldlang_sysrooted_script; |
1389 | ldlang_sysrooted_script = entry->sysrooted; | |
252b5132 | 1390 | |
b34976b6 | 1391 | ldfile_assumed_script = TRUE; |
252b5132 RH |
1392 | parser_input = input_script; |
1393 | yyparse (); | |
b34976b6 | 1394 | ldfile_assumed_script = FALSE; |
252b5132 | 1395 | |
e3f2db7f | 1396 | ldlang_sysrooted_script = save_ldlang_sysrooted_script; |
252b5132 RH |
1397 | stat_ptr = hold; |
1398 | ||
6770ec8c | 1399 | return ! bad_load; |
252b5132 RH |
1400 | } |
1401 | ||
1402 | if (ldemul_recognized_file (entry)) | |
b34976b6 | 1403 | return TRUE; |
252b5132 RH |
1404 | |
1405 | /* We don't call ldlang_add_file for an archive. Instead, the | |
1406 | add_symbols entry point will call ldlang_add_file, via the | |
1407 | add_archive_element callback, for each element of the archive | |
1408 | which is used. */ | |
1409 | switch (bfd_get_format (entry->the_bfd)) | |
1410 | { | |
1411 | default: | |
1412 | break; | |
1413 | ||
1414 | case bfd_object: | |
1415 | ldlang_add_file (entry); | |
1416 | if (trace_files || trace_file_tries) | |
1417 | info_msg ("%I\n", entry); | |
1418 | break; | |
1419 | ||
1420 | case bfd_archive: | |
1421 | if (entry->whole_archive) | |
1422 | { | |
b7a26f91 | 1423 | bfd *member = NULL; |
b34976b6 | 1424 | bfd_boolean loaded = TRUE; |
6770ec8c NC |
1425 | |
1426 | for (;;) | |
252b5132 | 1427 | { |
6770ec8c NC |
1428 | member = bfd_openr_next_archived_file (entry->the_bfd, member); |
1429 | ||
1430 | if (member == NULL) | |
1431 | break; | |
b7a26f91 | 1432 | |
252b5132 | 1433 | if (! bfd_check_format (member, bfd_object)) |
6770ec8c NC |
1434 | { |
1435 | einfo (_("%F%B: member %B in archive is not an object\n"), | |
1436 | entry->the_bfd, member); | |
b34976b6 | 1437 | loaded = FALSE; |
6770ec8c NC |
1438 | } |
1439 | ||
252b5132 RH |
1440 | if (! ((*link_info.callbacks->add_archive_element) |
1441 | (&link_info, member, "--whole-archive"))) | |
1442 | abort (); | |
6770ec8c | 1443 | |
252b5132 | 1444 | if (! bfd_link_add_symbols (member, &link_info)) |
6770ec8c NC |
1445 | { |
1446 | einfo (_("%F%B: could not read symbols: %E\n"), member); | |
b34976b6 | 1447 | loaded = FALSE; |
6770ec8c | 1448 | } |
252b5132 RH |
1449 | } |
1450 | ||
6770ec8c NC |
1451 | entry->loaded = loaded; |
1452 | return loaded; | |
252b5132 | 1453 | } |
6770ec8c | 1454 | break; |
252b5132 RH |
1455 | } |
1456 | ||
03bdc404 | 1457 | if (bfd_link_add_symbols (entry->the_bfd, &link_info)) |
b34976b6 | 1458 | entry->loaded = TRUE; |
6770ec8c | 1459 | else |
252b5132 RH |
1460 | einfo (_("%F%B: could not read symbols: %E\n"), entry->the_bfd); |
1461 | ||
6770ec8c | 1462 | return entry->loaded; |
252b5132 RH |
1463 | } |
1464 | ||
b6bf44ba AM |
1465 | /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both |
1466 | may be NULL, indicating that it is a wildcard. Separate | |
1467 | lang_input_section statements are created for each part of the | |
1468 | expansion; they are added after the wild statement S. OUTPUT is | |
1469 | the output section. */ | |
252b5132 RH |
1470 | |
1471 | static void | |
1579bae1 AM |
1472 | wild (lang_wild_statement_type *s, |
1473 | const char *target ATTRIBUTE_UNUSED, | |
1474 | lang_output_section_statement_type *output) | |
252b5132 | 1475 | { |
b6bf44ba | 1476 | struct wildcard_list *sec; |
252b5132 | 1477 | |
1579bae1 | 1478 | walk_wild (s, output_section_callback, output); |
b6bf44ba AM |
1479 | |
1480 | for (sec = s->section_list; sec != NULL; sec = sec->next) | |
252b5132 | 1481 | { |
b6bf44ba AM |
1482 | if (default_common_section != NULL) |
1483 | break; | |
1484 | if (sec->spec.name != NULL && strcmp (sec->spec.name, "COMMON") == 0) | |
1485 | { | |
1486 | /* Remember the section that common is going to in case we | |
b7a26f91 | 1487 | later get something which doesn't know where to put it. */ |
b6bf44ba AM |
1488 | default_common_section = output; |
1489 | } | |
252b5132 RH |
1490 | } |
1491 | } | |
1492 | ||
b34976b6 | 1493 | /* Return TRUE iff target is the sought target. */ |
08da4cac | 1494 | |
e50d8076 | 1495 | static int |
1579bae1 | 1496 | get_target (const bfd_target *target, void *data) |
e50d8076 | 1497 | { |
1579bae1 | 1498 | const char *sought = data; |
5f992e62 | 1499 | |
e50d8076 NC |
1500 | return strcmp (target->name, sought) == 0; |
1501 | } | |
1502 | ||
1503 | /* Like strcpy() but convert to lower case as well. */ | |
08da4cac | 1504 | |
e50d8076 | 1505 | static void |
1579bae1 | 1506 | stricpy (char *dest, char *src) |
e50d8076 NC |
1507 | { |
1508 | char c; | |
5f992e62 | 1509 | |
08da4cac | 1510 | while ((c = *src++) != 0) |
3882b010 | 1511 | *dest++ = TOLOWER (c); |
e50d8076 | 1512 | |
08da4cac | 1513 | *dest = 0; |
e50d8076 NC |
1514 | } |
1515 | ||
396a2467 | 1516 | /* Remove the first occurrence of needle (if any) in haystack |
e50d8076 | 1517 | from haystack. */ |
08da4cac | 1518 | |
e50d8076 | 1519 | static void |
1579bae1 | 1520 | strcut (char *haystack, char *needle) |
e50d8076 NC |
1521 | { |
1522 | haystack = strstr (haystack, needle); | |
5f992e62 | 1523 | |
e50d8076 NC |
1524 | if (haystack) |
1525 | { | |
08da4cac | 1526 | char *src; |
e50d8076 | 1527 | |
08da4cac KH |
1528 | for (src = haystack + strlen (needle); *src;) |
1529 | *haystack++ = *src++; | |
5f992e62 | 1530 | |
08da4cac | 1531 | *haystack = 0; |
e50d8076 NC |
1532 | } |
1533 | } | |
1534 | ||
1535 | /* Compare two target format name strings. | |
1536 | Return a value indicating how "similar" they are. */ | |
08da4cac | 1537 | |
e50d8076 | 1538 | static int |
1579bae1 | 1539 | name_compare (char *first, char *second) |
e50d8076 | 1540 | { |
08da4cac KH |
1541 | char *copy1; |
1542 | char *copy2; | |
1543 | int result; | |
5f992e62 | 1544 | |
e50d8076 NC |
1545 | copy1 = xmalloc (strlen (first) + 1); |
1546 | copy2 = xmalloc (strlen (second) + 1); | |
1547 | ||
1548 | /* Convert the names to lower case. */ | |
1549 | stricpy (copy1, first); | |
1550 | stricpy (copy2, second); | |
1551 | ||
1579bae1 | 1552 | /* Remove size and endian strings from the name. */ |
e50d8076 NC |
1553 | strcut (copy1, "big"); |
1554 | strcut (copy1, "little"); | |
1555 | strcut (copy2, "big"); | |
1556 | strcut (copy2, "little"); | |
1557 | ||
1558 | /* Return a value based on how many characters match, | |
1559 | starting from the beginning. If both strings are | |
1560 | the same then return 10 * their length. */ | |
08da4cac KH |
1561 | for (result = 0; copy1[result] == copy2[result]; result++) |
1562 | if (copy1[result] == 0) | |
e50d8076 NC |
1563 | { |
1564 | result *= 10; | |
1565 | break; | |
1566 | } | |
5f992e62 | 1567 | |
e50d8076 NC |
1568 | free (copy1); |
1569 | free (copy2); | |
1570 | ||
1571 | return result; | |
1572 | } | |
1573 | ||
1574 | /* Set by closest_target_match() below. */ | |
08da4cac | 1575 | static const bfd_target *winner; |
e50d8076 NC |
1576 | |
1577 | /* Scan all the valid bfd targets looking for one that has the endianness | |
1578 | requirement that was specified on the command line, and is the nearest | |
1579 | match to the original output target. */ | |
08da4cac | 1580 | |
e50d8076 | 1581 | static int |
1579bae1 | 1582 | closest_target_match (const bfd_target *target, void *data) |
e50d8076 | 1583 | { |
1579bae1 | 1584 | const bfd_target *original = data; |
5f992e62 | 1585 | |
08da4cac KH |
1586 | if (command_line.endian == ENDIAN_BIG |
1587 | && target->byteorder != BFD_ENDIAN_BIG) | |
e50d8076 | 1588 | return 0; |
5f992e62 | 1589 | |
08da4cac KH |
1590 | if (command_line.endian == ENDIAN_LITTLE |
1591 | && target->byteorder != BFD_ENDIAN_LITTLE) | |
e50d8076 NC |
1592 | return 0; |
1593 | ||
1594 | /* Must be the same flavour. */ | |
1595 | if (target->flavour != original->flavour) | |
1596 | return 0; | |
1597 | ||
1598 | /* If we have not found a potential winner yet, then record this one. */ | |
1599 | if (winner == NULL) | |
1600 | { | |
1601 | winner = target; | |
1602 | return 0; | |
1603 | } | |
1604 | ||
1605 | /* Oh dear, we now have two potential candidates for a successful match. | |
4de2d33d | 1606 | Compare their names and choose the better one. */ |
d1778b88 AM |
1607 | if (name_compare (target->name, original->name) |
1608 | > name_compare (winner->name, original->name)) | |
e50d8076 NC |
1609 | winner = target; |
1610 | ||
1611 | /* Keep on searching until wqe have checked them all. */ | |
1612 | return 0; | |
1613 | } | |
1614 | ||
1615 | /* Return the BFD target format of the first input file. */ | |
08da4cac | 1616 | |
e50d8076 | 1617 | static char * |
1579bae1 | 1618 | get_first_input_target (void) |
e50d8076 | 1619 | { |
08da4cac | 1620 | char *target = NULL; |
e50d8076 NC |
1621 | |
1622 | LANG_FOR_EACH_INPUT_STATEMENT (s) | |
1623 | { | |
1624 | if (s->header.type == lang_input_statement_enum | |
1625 | && s->real) | |
1626 | { | |
1627 | ldfile_open_file (s); | |
5f992e62 | 1628 | |
e50d8076 NC |
1629 | if (s->the_bfd != NULL |
1630 | && bfd_check_format (s->the_bfd, bfd_object)) | |
1631 | { | |
1632 | target = bfd_get_target (s->the_bfd); | |
5f992e62 | 1633 | |
e50d8076 NC |
1634 | if (target != NULL) |
1635 | break; | |
1636 | } | |
1637 | } | |
1638 | } | |
5f992e62 | 1639 | |
e50d8076 NC |
1640 | return target; |
1641 | } | |
1642 | ||
599917b8 | 1643 | const char * |
1579bae1 | 1644 | lang_get_output_target (void) |
599917b8 JJ |
1645 | { |
1646 | const char *target; | |
1647 | ||
1648 | /* Has the user told us which output format to use? */ | |
1579bae1 | 1649 | if (output_target != NULL) |
599917b8 JJ |
1650 | return output_target; |
1651 | ||
1652 | /* No - has the current target been set to something other than | |
1653 | the default? */ | |
1654 | if (current_target != default_target) | |
1655 | return current_target; | |
1656 | ||
1657 | /* No - can we determine the format of the first input file? */ | |
1658 | target = get_first_input_target (); | |
1659 | if (target != NULL) | |
1660 | return target; | |
1661 | ||
1662 | /* Failed - use the default output target. */ | |
1663 | return default_target; | |
1664 | } | |
1665 | ||
252b5132 RH |
1666 | /* Open the output file. */ |
1667 | ||
1668 | static bfd * | |
1579bae1 | 1669 | open_output (const char *name) |
252b5132 | 1670 | { |
08da4cac | 1671 | bfd *output; |
252b5132 | 1672 | |
599917b8 | 1673 | output_target = lang_get_output_target (); |
5f992e62 | 1674 | |
08da4cac KH |
1675 | /* Has the user requested a particular endianness on the command |
1676 | line? */ | |
e50d8076 NC |
1677 | if (command_line.endian != ENDIAN_UNSET) |
1678 | { | |
08da4cac | 1679 | const bfd_target *target; |
1b69a0bf | 1680 | enum bfd_endian desired_endian; |
e50d8076 NC |
1681 | |
1682 | /* Get the chosen target. */ | |
1579bae1 | 1683 | target = bfd_search_for_target (get_target, (void *) output_target); |
e50d8076 | 1684 | |
c13b1b77 NC |
1685 | /* If the target is not supported, we cannot do anything. */ |
1686 | if (target != NULL) | |
e50d8076 | 1687 | { |
c13b1b77 NC |
1688 | if (command_line.endian == ENDIAN_BIG) |
1689 | desired_endian = BFD_ENDIAN_BIG; | |
e50d8076 | 1690 | else |
c13b1b77 | 1691 | desired_endian = BFD_ENDIAN_LITTLE; |
5f992e62 AM |
1692 | |
1693 | /* See if the target has the wrong endianness. This should | |
1694 | not happen if the linker script has provided big and | |
1695 | little endian alternatives, but some scrips don't do | |
1696 | this. */ | |
c13b1b77 | 1697 | if (target->byteorder != desired_endian) |
e50d8076 | 1698 | { |
c13b1b77 NC |
1699 | /* If it does, then see if the target provides |
1700 | an alternative with the correct endianness. */ | |
1701 | if (target->alternative_target != NULL | |
1702 | && (target->alternative_target->byteorder == desired_endian)) | |
1703 | output_target = target->alternative_target->name; | |
e50d8076 | 1704 | else |
c13b1b77 | 1705 | { |
5f992e62 AM |
1706 | /* Try to find a target as similar as possible to |
1707 | the default target, but which has the desired | |
1708 | endian characteristic. */ | |
1579bae1 AM |
1709 | bfd_search_for_target (closest_target_match, |
1710 | (void *) target); | |
5f992e62 AM |
1711 | |
1712 | /* Oh dear - we could not find any targets that | |
1713 | satisfy our requirements. */ | |
c13b1b77 NC |
1714 | if (winner == NULL) |
1715 | einfo (_("%P: warning: could not find any targets that match endianness requirement\n")); | |
1716 | else | |
1717 | output_target = winner->name; | |
1718 | } | |
e50d8076 NC |
1719 | } |
1720 | } | |
252b5132 | 1721 | } |
5f992e62 | 1722 | |
252b5132 RH |
1723 | output = bfd_openw (name, output_target); |
1724 | ||
1579bae1 | 1725 | if (output == NULL) |
252b5132 RH |
1726 | { |
1727 | if (bfd_get_error () == bfd_error_invalid_target) | |
e50d8076 NC |
1728 | einfo (_("%P%F: target %s not found\n"), output_target); |
1729 | ||
252b5132 RH |
1730 | einfo (_("%P%F: cannot open output file %s: %E\n"), name); |
1731 | } | |
1732 | ||
b34976b6 | 1733 | delete_output_file_on_failure = TRUE; |
252b5132 | 1734 | |
08da4cac KH |
1735 | #if 0 |
1736 | output->flags |= D_PAGED; | |
1737 | #endif | |
252b5132 RH |
1738 | |
1739 | if (! bfd_set_format (output, bfd_object)) | |
1740 | einfo (_("%P%F:%s: can not make object file: %E\n"), name); | |
1741 | if (! bfd_set_arch_mach (output, | |
1742 | ldfile_output_architecture, | |
1743 | ldfile_output_machine)) | |
1744 | einfo (_("%P%F:%s: can not set architecture: %E\n"), name); | |
1745 | ||
1746 | link_info.hash = bfd_link_hash_table_create (output); | |
1579bae1 | 1747 | if (link_info.hash == NULL) |
252b5132 RH |
1748 | einfo (_("%P%F: can not create link hash table: %E\n")); |
1749 | ||
1750 | bfd_set_gp_size (output, g_switch_value); | |
1751 | return output; | |
1752 | } | |
1753 | ||
252b5132 | 1754 | static void |
1579bae1 | 1755 | ldlang_open_output (lang_statement_union_type *statement) |
252b5132 RH |
1756 | { |
1757 | switch (statement->header.type) | |
1758 | { | |
1759 | case lang_output_statement_enum: | |
1579bae1 | 1760 | ASSERT (output_bfd == NULL); |
252b5132 RH |
1761 | output_bfd = open_output (statement->output_statement.name); |
1762 | ldemul_set_output_arch (); | |
1049f94e | 1763 | if (config.magic_demand_paged && !link_info.relocatable) |
252b5132 RH |
1764 | output_bfd->flags |= D_PAGED; |
1765 | else | |
1766 | output_bfd->flags &= ~D_PAGED; | |
1767 | if (config.text_read_only) | |
1768 | output_bfd->flags |= WP_TEXT; | |
1769 | else | |
1770 | output_bfd->flags &= ~WP_TEXT; | |
1771 | if (link_info.traditional_format) | |
1772 | output_bfd->flags |= BFD_TRADITIONAL_FORMAT; | |
1773 | else | |
1774 | output_bfd->flags &= ~BFD_TRADITIONAL_FORMAT; | |
1775 | break; | |
1776 | ||
1777 | case lang_target_statement_enum: | |
1778 | current_target = statement->target_statement.target; | |
1779 | break; | |
1780 | default: | |
1781 | break; | |
1782 | } | |
1783 | } | |
1784 | ||
1785 | /* Open all the input files. */ | |
1786 | ||
1787 | static void | |
1579bae1 | 1788 | open_input_bfds (lang_statement_union_type *s, bfd_boolean force) |
252b5132 | 1789 | { |
1579bae1 | 1790 | for (; s != NULL; s = s->header.next) |
252b5132 RH |
1791 | { |
1792 | switch (s->header.type) | |
1793 | { | |
1794 | case lang_constructors_statement_enum: | |
1795 | open_input_bfds (constructor_list.head, force); | |
1796 | break; | |
1797 | case lang_output_section_statement_enum: | |
1798 | open_input_bfds (s->output_section_statement.children.head, force); | |
1799 | break; | |
1800 | case lang_wild_statement_enum: | |
08da4cac | 1801 | /* Maybe we should load the file's symbols. */ |
252b5132 RH |
1802 | if (s->wild_statement.filename |
1803 | && ! wildcardp (s->wild_statement.filename)) | |
1804 | (void) lookup_name (s->wild_statement.filename); | |
1805 | open_input_bfds (s->wild_statement.children.head, force); | |
1806 | break; | |
1807 | case lang_group_statement_enum: | |
1808 | { | |
1809 | struct bfd_link_hash_entry *undefs; | |
1810 | ||
1811 | /* We must continually search the entries in the group | |
08da4cac KH |
1812 | until no new symbols are added to the list of undefined |
1813 | symbols. */ | |
252b5132 RH |
1814 | |
1815 | do | |
1816 | { | |
1817 | undefs = link_info.hash->undefs_tail; | |
b34976b6 | 1818 | open_input_bfds (s->group_statement.children.head, TRUE); |
252b5132 RH |
1819 | } |
1820 | while (undefs != link_info.hash->undefs_tail); | |
1821 | } | |
1822 | break; | |
1823 | case lang_target_statement_enum: | |
1824 | current_target = s->target_statement.target; | |
1825 | break; | |
1826 | case lang_input_statement_enum: | |
e50d8076 | 1827 | if (s->input_statement.real) |
252b5132 RH |
1828 | { |
1829 | lang_statement_list_type add; | |
1830 | ||
1831 | s->input_statement.target = current_target; | |
1832 | ||
1833 | /* If we are being called from within a group, and this | |
1834 | is an archive which has already been searched, then | |
cd4c806a L |
1835 | force it to be researched unless the whole archive |
1836 | has been loaded already. */ | |
252b5132 | 1837 | if (force |
cd4c806a | 1838 | && !s->input_statement.whole_archive |
252b5132 RH |
1839 | && s->input_statement.loaded |
1840 | && bfd_check_format (s->input_statement.the_bfd, | |
1841 | bfd_archive)) | |
b34976b6 | 1842 | s->input_statement.loaded = FALSE; |
252b5132 | 1843 | |
d1778b88 | 1844 | lang_list_init (&add); |
1276aefa | 1845 | |
6770ec8c | 1846 | if (! load_symbols (&s->input_statement, &add)) |
b34976b6 | 1847 | config.make_executable = FALSE; |
252b5132 RH |
1848 | |
1849 | if (add.head != NULL) | |
1850 | { | |
bba1a0c0 AM |
1851 | *add.tail = s->header.next; |
1852 | s->header.next = add.head; | |
252b5132 RH |
1853 | } |
1854 | } | |
1855 | break; | |
1856 | default: | |
1857 | break; | |
1858 | } | |
1859 | } | |
1860 | } | |
1861 | ||
08da4cac KH |
1862 | /* If there are [COMMONS] statements, put a wild one into the bss |
1863 | section. */ | |
252b5132 RH |
1864 | |
1865 | static void | |
1579bae1 | 1866 | lang_reasonable_defaults (void) |
252b5132 RH |
1867 | { |
1868 | #if 0 | |
1869 | lang_output_section_statement_lookup (".text"); | |
1870 | lang_output_section_statement_lookup (".data"); | |
1871 | ||
08da4cac | 1872 | default_common_section = lang_output_section_statement_lookup (".bss"); |
252b5132 | 1873 | |
7c519c12 | 1874 | if (!placed_commons) |
252b5132 RH |
1875 | { |
1876 | lang_wild_statement_type *new = | |
1877 | new_stat (lang_wild_statement, | |
1878 | &default_common_section->children); | |
1879 | ||
1880 | new->section_name = "COMMON"; | |
1579bae1 | 1881 | new->filename = NULL; |
252b5132 RH |
1882 | lang_list_init (&new->children); |
1883 | } | |
1884 | #endif | |
252b5132 RH |
1885 | } |
1886 | ||
420e579c HPN |
1887 | /* Add a symbol to a hash of symbols used in DEFINED (NAME) expressions. */ |
1888 | ||
1889 | void | |
1890 | lang_track_definedness (const char *name) | |
1891 | { | |
1892 | if (bfd_hash_lookup (&lang_definedness_table, name, TRUE, FALSE) == NULL) | |
1893 | einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name); | |
1894 | } | |
1895 | ||
1896 | /* New-function for the definedness hash table. */ | |
1897 | ||
1898 | static struct bfd_hash_entry * | |
1899 | lang_definedness_newfunc (struct bfd_hash_entry *entry, | |
1900 | struct bfd_hash_table *table ATTRIBUTE_UNUSED, | |
1901 | const char *name ATTRIBUTE_UNUSED) | |
1902 | { | |
1903 | struct lang_definedness_hash_entry *ret | |
1904 | = (struct lang_definedness_hash_entry *) entry; | |
1905 | ||
1906 | if (ret == NULL) | |
1907 | ret = (struct lang_definedness_hash_entry *) | |
1908 | bfd_hash_allocate (table, sizeof (struct lang_definedness_hash_entry)); | |
1909 | ||
1910 | if (ret == NULL) | |
1911 | einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name); | |
1912 | ||
1913 | ret->iteration = -1; | |
1914 | return &ret->root; | |
1915 | } | |
1916 | ||
1917 | /* Return the iteration when the definition of NAME was last updated. A | |
1918 | value of -1 means that the symbol is not defined in the linker script | |
1919 | or the command line, but may be defined in the linker symbol table. */ | |
1920 | ||
1921 | int | |
1922 | lang_symbol_definition_iteration (const char *name) | |
1923 | { | |
1924 | struct lang_definedness_hash_entry *defentry | |
1925 | = (struct lang_definedness_hash_entry *) | |
1926 | bfd_hash_lookup (&lang_definedness_table, name, FALSE, FALSE); | |
1927 | ||
1928 | /* We've already created this one on the presence of DEFINED in the | |
1929 | script, so it can't be NULL unless something is borked elsewhere in | |
1930 | the code. */ | |
1931 | if (defentry == NULL) | |
1932 | FAIL (); | |
1933 | ||
1934 | return defentry->iteration; | |
1935 | } | |
1936 | ||
1937 | /* Update the definedness state of NAME. */ | |
1938 | ||
1939 | void | |
1940 | lang_update_definedness (const char *name, struct bfd_link_hash_entry *h) | |
1941 | { | |
1942 | struct lang_definedness_hash_entry *defentry | |
1943 | = (struct lang_definedness_hash_entry *) | |
1944 | bfd_hash_lookup (&lang_definedness_table, name, FALSE, FALSE); | |
1945 | ||
1946 | /* We don't keep track of symbols not tested with DEFINED. */ | |
1947 | if (defentry == NULL) | |
1948 | return; | |
1949 | ||
1950 | /* If the symbol was already defined, and not from an earlier statement | |
1951 | iteration, don't update the definedness iteration, because that'd | |
1952 | make the symbol seem defined in the linker script at this point, and | |
1953 | it wasn't; it was defined in some object. If we do anyway, DEFINED | |
1954 | would start to yield false before this point and the construct "sym = | |
1955 | DEFINED (sym) ? sym : X;" would change sym to X despite being defined | |
1956 | in an object. */ | |
1957 | if (h->type != bfd_link_hash_undefined | |
1958 | && h->type != bfd_link_hash_common | |
1959 | && h->type != bfd_link_hash_new | |
1960 | && defentry->iteration == -1) | |
1961 | return; | |
1962 | ||
1963 | defentry->iteration = lang_statement_iteration; | |
1964 | } | |
1965 | ||
08da4cac | 1966 | /* Add the supplied name to the symbol table as an undefined reference. |
fcf0e35b AM |
1967 | This is a two step process as the symbol table doesn't even exist at |
1968 | the time the ld command line is processed. First we put the name | |
1969 | on a list, then, once the output file has been opened, transfer the | |
1970 | name to the symbol table. */ | |
1971 | ||
e3e942e9 | 1972 | typedef struct bfd_sym_chain ldlang_undef_chain_list_type; |
252b5132 | 1973 | |
e3e942e9 | 1974 | #define ldlang_undef_chain_list_head entry_symbol.next |
252b5132 RH |
1975 | |
1976 | void | |
1579bae1 | 1977 | ldlang_add_undef (const char *const name) |
252b5132 RH |
1978 | { |
1979 | ldlang_undef_chain_list_type *new = | |
1579bae1 | 1980 | stat_alloc (sizeof (ldlang_undef_chain_list_type)); |
252b5132 RH |
1981 | |
1982 | new->next = ldlang_undef_chain_list_head; | |
1983 | ldlang_undef_chain_list_head = new; | |
1984 | ||
d1b2b2dc | 1985 | new->name = xstrdup (name); |
fcf0e35b AM |
1986 | |
1987 | if (output_bfd != NULL) | |
1988 | insert_undefined (new->name); | |
1989 | } | |
1990 | ||
1991 | /* Insert NAME as undefined in the symbol table. */ | |
1992 | ||
1993 | static void | |
1579bae1 | 1994 | insert_undefined (const char *name) |
fcf0e35b AM |
1995 | { |
1996 | struct bfd_link_hash_entry *h; | |
1997 | ||
b34976b6 | 1998 | h = bfd_link_hash_lookup (link_info.hash, name, TRUE, FALSE, TRUE); |
1579bae1 | 1999 | if (h == NULL) |
fcf0e35b AM |
2000 | einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n")); |
2001 | if (h->type == bfd_link_hash_new) | |
2002 | { | |
2003 | h->type = bfd_link_hash_undefined; | |
2004 | h->u.undef.abfd = NULL; | |
2005 | bfd_link_add_undef (link_info.hash, h); | |
2006 | } | |
252b5132 RH |
2007 | } |
2008 | ||
2009 | /* Run through the list of undefineds created above and place them | |
2010 | into the linker hash table as undefined symbols belonging to the | |
08da4cac KH |
2011 | script file. */ |
2012 | ||
252b5132 | 2013 | static void |
1579bae1 | 2014 | lang_place_undefineds (void) |
252b5132 RH |
2015 | { |
2016 | ldlang_undef_chain_list_type *ptr; | |
2017 | ||
1579bae1 AM |
2018 | for (ptr = ldlang_undef_chain_list_head; ptr != NULL; ptr = ptr->next) |
2019 | insert_undefined (ptr->name); | |
252b5132 RH |
2020 | } |
2021 | ||
396a2467 | 2022 | /* Open input files and attach to output sections. */ |
08da4cac | 2023 | |
252b5132 | 2024 | static void |
1579bae1 AM |
2025 | map_input_to_output_sections |
2026 | (lang_statement_union_type *s, const char *target, | |
2027 | lang_output_section_statement_type *output_section_statement) | |
252b5132 | 2028 | { |
1579bae1 | 2029 | for (; s != NULL; s = s->header.next) |
252b5132 RH |
2030 | { |
2031 | switch (s->header.type) | |
2032 | { | |
252b5132 | 2033 | case lang_wild_statement_enum: |
b6bf44ba | 2034 | wild (&s->wild_statement, target, output_section_statement); |
abc6ab0a | 2035 | break; |
252b5132 RH |
2036 | case lang_constructors_statement_enum: |
2037 | map_input_to_output_sections (constructor_list.head, | |
2038 | target, | |
2039 | output_section_statement); | |
2040 | break; | |
2041 | case lang_output_section_statement_enum: | |
2042 | map_input_to_output_sections (s->output_section_statement.children.head, | |
2043 | target, | |
2044 | &s->output_section_statement); | |
2045 | break; | |
2046 | case lang_output_statement_enum: | |
2047 | break; | |
2048 | case lang_target_statement_enum: | |
2049 | target = s->target_statement.target; | |
2050 | break; | |
2051 | case lang_group_statement_enum: | |
2052 | map_input_to_output_sections (s->group_statement.children.head, | |
2053 | target, | |
2054 | output_section_statement); | |
2055 | break; | |
2056 | case lang_fill_statement_enum: | |
2057 | case lang_input_section_enum: | |
2058 | case lang_object_symbols_statement_enum: | |
2059 | case lang_data_statement_enum: | |
2060 | case lang_reloc_statement_enum: | |
2061 | case lang_padding_statement_enum: | |
2062 | case lang_input_statement_enum: | |
2063 | if (output_section_statement != NULL | |
2064 | && output_section_statement->bfd_section == NULL) | |
2065 | init_os (output_section_statement); | |
2066 | break; | |
2067 | case lang_assignment_statement_enum: | |
2068 | if (output_section_statement != NULL | |
2069 | && output_section_statement->bfd_section == NULL) | |
2070 | init_os (output_section_statement); | |
2071 | ||
2072 | /* Make sure that any sections mentioned in the assignment | |
08da4cac | 2073 | are initialized. */ |
252b5132 RH |
2074 | exp_init_os (s->assignment_statement.exp); |
2075 | break; | |
2076 | case lang_afile_asection_pair_statement_enum: | |
2077 | FAIL (); | |
2078 | break; | |
2079 | case lang_address_statement_enum: | |
08da4cac | 2080 | /* Mark the specified section with the supplied address. */ |
252b5132 RH |
2081 | { |
2082 | lang_output_section_statement_type *os = | |
2083 | lang_output_section_statement_lookup | |
2084 | (s->address_statement.section_name); | |
2085 | ||
2086 | if (os->bfd_section == NULL) | |
2087 | init_os (os); | |
2088 | os->addr_tree = s->address_statement.address; | |
2089 | } | |
2090 | break; | |
2091 | } | |
2092 | } | |
2093 | } | |
2094 | ||
4bd5a393 AM |
2095 | /* An output section might have been removed after its statement was |
2096 | added. For example, ldemul_before_allocation can remove dynamic | |
2097 | sections if they turn out to be not needed. Clean them up here. */ | |
2098 | ||
2099 | static void | |
1579bae1 | 2100 | strip_excluded_output_sections (void) |
4bd5a393 AM |
2101 | { |
2102 | lang_statement_union_type *u; | |
2103 | ||
2104 | for (u = lang_output_section_statement.head; | |
2105 | u != NULL; | |
2106 | u = u->output_section_statement.next) | |
2107 | { | |
2108 | lang_output_section_statement_type *os; | |
2109 | asection *s; | |
2110 | ||
2111 | os = &u->output_section_statement; | |
2112 | s = os->bfd_section; | |
2113 | if (s != NULL && (s->flags & SEC_EXCLUDE) != 0) | |
2114 | { | |
2115 | asection **p; | |
2116 | ||
2117 | os->bfd_section = NULL; | |
2118 | ||
2119 | for (p = &output_bfd->sections; *p; p = &(*p)->next) | |
2120 | if (*p == s) | |
2121 | { | |
2122 | bfd_section_list_remove (output_bfd, p); | |
2123 | output_bfd->section_count--; | |
2124 | break; | |
2125 | } | |
2126 | } | |
2127 | } | |
2128 | } | |
2129 | ||
252b5132 | 2130 | static void |
1579bae1 AM |
2131 | print_output_section_statement |
2132 | (lang_output_section_statement_type *output_section_statement) | |
252b5132 RH |
2133 | { |
2134 | asection *section = output_section_statement->bfd_section; | |
2135 | int len; | |
2136 | ||
2137 | if (output_section_statement != abs_output_section) | |
2138 | { | |
2139 | minfo ("\n%s", output_section_statement->name); | |
2140 | ||
2141 | if (section != NULL) | |
2142 | { | |
2143 | print_dot = section->vma; | |
2144 | ||
2145 | len = strlen (output_section_statement->name); | |
2146 | if (len >= SECTION_NAME_MAP_LENGTH - 1) | |
2147 | { | |
2148 | print_nl (); | |
2149 | len = 0; | |
2150 | } | |
2151 | while (len < SECTION_NAME_MAP_LENGTH) | |
2152 | { | |
2153 | print_space (); | |
2154 | ++len; | |
2155 | } | |
2156 | ||
2157 | minfo ("0x%V %W", section->vma, section->_raw_size); | |
2158 | ||
2159 | if (output_section_statement->load_base != NULL) | |
2160 | { | |
2161 | bfd_vma addr; | |
2162 | ||
2163 | addr = exp_get_abs_int (output_section_statement->load_base, 0, | |
2164 | "load base", lang_final_phase_enum); | |
2165 | minfo (_(" load address 0x%V"), addr); | |
2166 | } | |
2167 | } | |
2168 | ||
2169 | print_nl (); | |
2170 | } | |
2171 | ||
2172 | print_statement_list (output_section_statement->children.head, | |
2173 | output_section_statement); | |
2174 | } | |
2175 | ||
2176 | static void | |
1579bae1 AM |
2177 | print_assignment (lang_assignment_statement_type *assignment, |
2178 | lang_output_section_statement_type *output_section) | |
252b5132 RH |
2179 | { |
2180 | int i; | |
2181 | etree_value_type result; | |
2182 | ||
2183 | for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++) | |
2184 | print_space (); | |
2185 | ||
2186 | result = exp_fold_tree (assignment->exp->assign.src, output_section, | |
2187 | lang_final_phase_enum, print_dot, &print_dot); | |
2188 | if (result.valid_p) | |
7b17f854 RS |
2189 | { |
2190 | const char *dst; | |
2191 | bfd_vma value; | |
2192 | ||
2193 | value = result.value + result.section->bfd_section->vma; | |
2194 | dst = assignment->exp->assign.dst; | |
2195 | ||
2196 | minfo ("0x%V", value); | |
2197 | if (dst[0] == '.' && dst[1] == 0) | |
2198 | print_dot = value; | |
2199 | } | |
252b5132 RH |
2200 | else |
2201 | { | |
2202 | minfo ("*undef* "); | |
2203 | #ifdef BFD64 | |
2204 | minfo (" "); | |
2205 | #endif | |
2206 | } | |
2207 | ||
2208 | minfo (" "); | |
2209 | ||
2210 | exp_print_tree (assignment->exp); | |
2211 | ||
2212 | print_nl (); | |
2213 | } | |
2214 | ||
2215 | static void | |
1579bae1 | 2216 | print_input_statement (lang_input_statement_type *statm) |
252b5132 | 2217 | { |
1579bae1 | 2218 | if (statm->filename != NULL) |
252b5132 RH |
2219 | { |
2220 | fprintf (config.map_file, "LOAD %s\n", statm->filename); | |
2221 | } | |
2222 | } | |
2223 | ||
2224 | /* Print all symbols defined in a particular section. This is called | |
2225 | via bfd_link_hash_traverse. */ | |
2226 | ||
b34976b6 | 2227 | static bfd_boolean |
1579bae1 | 2228 | print_one_symbol (struct bfd_link_hash_entry *hash_entry, void *ptr) |
252b5132 | 2229 | { |
1579bae1 | 2230 | asection *sec = ptr; |
252b5132 RH |
2231 | |
2232 | if ((hash_entry->type == bfd_link_hash_defined | |
2233 | || hash_entry->type == bfd_link_hash_defweak) | |
2234 | && sec == hash_entry->u.def.section) | |
2235 | { | |
2236 | int i; | |
2237 | ||
2238 | for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++) | |
2239 | print_space (); | |
2240 | minfo ("0x%V ", | |
2241 | (hash_entry->u.def.value | |
2242 | + hash_entry->u.def.section->output_offset | |
2243 | + hash_entry->u.def.section->output_section->vma)); | |
2244 | ||
2245 | minfo (" %T\n", hash_entry->root.string); | |
2246 | } | |
2247 | ||
b34976b6 | 2248 | return TRUE; |
252b5132 RH |
2249 | } |
2250 | ||
2251 | /* Print information about an input section to the map file. */ | |
2252 | ||
2253 | static void | |
1579bae1 | 2254 | print_input_section (lang_input_section_type *in) |
252b5132 RH |
2255 | { |
2256 | asection *i = in->section; | |
2257 | bfd_size_type size = i->_cooked_size != 0 ? i->_cooked_size : i->_raw_size; | |
5f992e62 | 2258 | unsigned opb = bfd_arch_mach_octets_per_byte (ldfile_output_architecture, |
f6af82bd | 2259 | ldfile_output_machine); |
252b5132 RH |
2260 | if (size != 0) |
2261 | { | |
2262 | print_space (); | |
2263 | ||
2264 | minfo ("%s", i->name); | |
2265 | ||
2266 | if (i->output_section != NULL) | |
2267 | { | |
2268 | int len; | |
2269 | ||
2270 | len = 1 + strlen (i->name); | |
2271 | if (len >= SECTION_NAME_MAP_LENGTH - 1) | |
2272 | { | |
2273 | print_nl (); | |
2274 | len = 0; | |
2275 | } | |
2276 | while (len < SECTION_NAME_MAP_LENGTH) | |
2277 | { | |
2278 | print_space (); | |
2279 | ++len; | |
2280 | } | |
2281 | ||
2282 | minfo ("0x%V %W %B\n", | |
4cbfc3ac | 2283 | i->output_section->vma + i->output_offset, size / opb, |
252b5132 RH |
2284 | i->owner); |
2285 | ||
2286 | if (i->_cooked_size != 0 && i->_cooked_size != i->_raw_size) | |
2287 | { | |
2288 | len = SECTION_NAME_MAP_LENGTH + 3; | |
2289 | #ifdef BFD64 | |
2290 | len += 16; | |
2291 | #else | |
2292 | len += 8; | |
2293 | #endif | |
2294 | while (len > 0) | |
2295 | { | |
2296 | print_space (); | |
2297 | --len; | |
2298 | } | |
2299 | ||
2300 | minfo (_("%W (size before relaxing)\n"), i->_raw_size); | |
2301 | } | |
2302 | ||
1579bae1 | 2303 | bfd_link_hash_traverse (link_info.hash, print_one_symbol, i); |
252b5132 | 2304 | |
4cbfc3ac | 2305 | print_dot = i->output_section->vma + i->output_offset + size / opb; |
252b5132 RH |
2306 | } |
2307 | } | |
2308 | } | |
2309 | ||
2310 | static void | |
1579bae1 | 2311 | print_fill_statement (lang_fill_statement_type *fill) |
252b5132 | 2312 | { |
2c382fb6 AM |
2313 | size_t size; |
2314 | unsigned char *p; | |
2315 | fputs (" FILL mask 0x", config.map_file); | |
2316 | for (p = fill->fill->data, size = fill->fill->size; size != 0; p++, size--) | |
2317 | fprintf (config.map_file, "%02x", *p); | |
2318 | fputs ("\n", config.map_file); | |
252b5132 RH |
2319 | } |
2320 | ||
2321 | static void | |
1579bae1 | 2322 | print_data_statement (lang_data_statement_type *data) |
252b5132 RH |
2323 | { |
2324 | int i; | |
2325 | bfd_vma addr; | |
2326 | bfd_size_type size; | |
2327 | const char *name; | |
5f992e62 | 2328 | unsigned opb = bfd_arch_mach_octets_per_byte (ldfile_output_architecture, |
f6af82bd | 2329 | ldfile_output_machine); |
252b5132 RH |
2330 | |
2331 | for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++) | |
2332 | print_space (); | |
2333 | ||
2334 | addr = data->output_vma; | |
2335 | if (data->output_section != NULL) | |
2336 | addr += data->output_section->vma; | |
2337 | ||
2338 | switch (data->type) | |
2339 | { | |
2340 | default: | |
2341 | abort (); | |
2342 | case BYTE: | |
2343 | size = BYTE_SIZE; | |
2344 | name = "BYTE"; | |
2345 | break; | |
2346 | case SHORT: | |
2347 | size = SHORT_SIZE; | |
2348 | name = "SHORT"; | |
2349 | break; | |
2350 | case LONG: | |
2351 | size = LONG_SIZE; | |
2352 | name = "LONG"; | |
2353 | break; | |
2354 | case QUAD: | |
2355 | size = QUAD_SIZE; | |
2356 | name = "QUAD"; | |
2357 | break; | |
2358 | case SQUAD: | |
2359 | size = QUAD_SIZE; | |
2360 | name = "SQUAD"; | |
2361 | break; | |
2362 | } | |
2363 | ||
2364 | minfo ("0x%V %W %s 0x%v", addr, size, name, data->value); | |
2365 | ||
2366 | if (data->exp->type.node_class != etree_value) | |
2367 | { | |
2368 | print_space (); | |
2369 | exp_print_tree (data->exp); | |
2370 | } | |
2371 | ||
2372 | print_nl (); | |
2373 | ||
4cbfc3ac TW |
2374 | print_dot = addr + size / opb; |
2375 | ||
252b5132 RH |
2376 | } |
2377 | ||
2378 | /* Print an address statement. These are generated by options like | |
2379 | -Ttext. */ | |
2380 | ||
2381 | static void | |
1579bae1 | 2382 | print_address_statement (lang_address_statement_type *address) |
252b5132 RH |
2383 | { |
2384 | minfo (_("Address of section %s set to "), address->section_name); | |
2385 | exp_print_tree (address->address); | |
2386 | print_nl (); | |
2387 | } | |
2388 | ||
2389 | /* Print a reloc statement. */ | |
2390 | ||
2391 | static void | |
1579bae1 | 2392 | print_reloc_statement (lang_reloc_statement_type *reloc) |
252b5132 RH |
2393 | { |
2394 | int i; | |
2395 | bfd_vma addr; | |
2396 | bfd_size_type size; | |
5f992e62 AM |
2397 | unsigned opb = bfd_arch_mach_octets_per_byte (ldfile_output_architecture, |
2398 | ldfile_output_machine); | |
252b5132 RH |
2399 | |
2400 | for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++) | |
2401 | print_space (); | |
2402 | ||
2403 | addr = reloc->output_vma; | |
2404 | if (reloc->output_section != NULL) | |
2405 | addr += reloc->output_section->vma; | |
2406 | ||
2407 | size = bfd_get_reloc_size (reloc->howto); | |
2408 | ||
2409 | minfo ("0x%V %W RELOC %s ", addr, size, reloc->howto->name); | |
2410 | ||
2411 | if (reloc->name != NULL) | |
2412 | minfo ("%s+", reloc->name); | |
2413 | else | |
2414 | minfo ("%s+", reloc->section->name); | |
2415 | ||
2416 | exp_print_tree (reloc->addend_exp); | |
2417 | ||
2418 | print_nl (); | |
2419 | ||
4cbfc3ac | 2420 | print_dot = addr + size / opb; |
5f992e62 | 2421 | } |
252b5132 RH |
2422 | |
2423 | static void | |
1579bae1 | 2424 | print_padding_statement (lang_padding_statement_type *s) |
252b5132 RH |
2425 | { |
2426 | int len; | |
2427 | bfd_vma addr; | |
5f992e62 AM |
2428 | unsigned opb = bfd_arch_mach_octets_per_byte (ldfile_output_architecture, |
2429 | ldfile_output_machine); | |
252b5132 RH |
2430 | |
2431 | minfo (" *fill*"); | |
2432 | ||
2433 | len = sizeof " *fill*" - 1; | |
2434 | while (len < SECTION_NAME_MAP_LENGTH) | |
2435 | { | |
2436 | print_space (); | |
2437 | ++len; | |
2438 | } | |
2439 | ||
2440 | addr = s->output_offset; | |
2441 | if (s->output_section != NULL) | |
2442 | addr += s->output_section->vma; | |
2c382fb6 | 2443 | minfo ("0x%V %W ", addr, s->size); |
252b5132 | 2444 | |
2c382fb6 AM |
2445 | if (s->fill->size != 0) |
2446 | { | |
2447 | size_t size; | |
2448 | unsigned char *p; | |
2449 | for (p = s->fill->data, size = s->fill->size; size != 0; p++, size--) | |
2450 | fprintf (config.map_file, "%02x", *p); | |
2451 | } | |
252b5132 RH |
2452 | |
2453 | print_nl (); | |
2454 | ||
4cbfc3ac | 2455 | print_dot = addr + s->size / opb; |
252b5132 RH |
2456 | } |
2457 | ||
2458 | static void | |
1579bae1 AM |
2459 | print_wild_statement (lang_wild_statement_type *w, |
2460 | lang_output_section_statement_type *os) | |
252b5132 | 2461 | { |
b6bf44ba AM |
2462 | struct wildcard_list *sec; |
2463 | ||
252b5132 RH |
2464 | print_space (); |
2465 | ||
2466 | if (w->filenames_sorted) | |
2467 | minfo ("SORT("); | |
08da4cac | 2468 | if (w->filename != NULL) |
252b5132 RH |
2469 | minfo ("%s", w->filename); |
2470 | else | |
2471 | minfo ("*"); | |
2472 | if (w->filenames_sorted) | |
2473 | minfo (")"); | |
2474 | ||
2475 | minfo ("("); | |
b6bf44ba AM |
2476 | for (sec = w->section_list; sec; sec = sec->next) |
2477 | { | |
2478 | if (sec->spec.sorted) | |
2479 | minfo ("SORT("); | |
2480 | if (sec->spec.exclude_name_list != NULL) | |
2481 | { | |
2482 | name_list *tmp; | |
34786259 | 2483 | minfo ("EXCLUDE_FILE(%s", sec->spec.exclude_name_list->name); |
b6bf44ba | 2484 | for (tmp = sec->spec.exclude_name_list->next; tmp; tmp = tmp->next) |
34786259 AM |
2485 | minfo (" %s", tmp->name); |
2486 | minfo (") "); | |
b6bf44ba AM |
2487 | } |
2488 | if (sec->spec.name != NULL) | |
2489 | minfo ("%s", sec->spec.name); | |
2490 | else | |
2491 | minfo ("*"); | |
2492 | if (sec->spec.sorted) | |
2493 | minfo (")"); | |
34786259 AM |
2494 | if (sec->next) |
2495 | minfo (" "); | |
b6bf44ba | 2496 | } |
252b5132 RH |
2497 | minfo (")"); |
2498 | ||
2499 | print_nl (); | |
2500 | ||
2501 | print_statement_list (w->children.head, os); | |
2502 | } | |
2503 | ||
2504 | /* Print a group statement. */ | |
2505 | ||
2506 | static void | |
1579bae1 AM |
2507 | print_group (lang_group_statement_type *s, |
2508 | lang_output_section_statement_type *os) | |
252b5132 RH |
2509 | { |
2510 | fprintf (config.map_file, "START GROUP\n"); | |
2511 | print_statement_list (s->children.head, os); | |
2512 | fprintf (config.map_file, "END GROUP\n"); | |
2513 | } | |
2514 | ||
2515 | /* Print the list of statements in S. | |
2516 | This can be called for any statement type. */ | |
2517 | ||
2518 | static void | |
1579bae1 AM |
2519 | print_statement_list (lang_statement_union_type *s, |
2520 | lang_output_section_statement_type *os) | |
252b5132 RH |
2521 | { |
2522 | while (s != NULL) | |
2523 | { | |
2524 | print_statement (s, os); | |
bba1a0c0 | 2525 | s = s->header.next; |
252b5132 RH |
2526 | } |
2527 | } | |
2528 | ||
2529 | /* Print the first statement in statement list S. | |
2530 | This can be called for any statement type. */ | |
2531 | ||
2532 | static void | |
1579bae1 AM |
2533 | print_statement (lang_statement_union_type *s, |
2534 | lang_output_section_statement_type *os) | |
252b5132 RH |
2535 | { |
2536 | switch (s->header.type) | |
2537 | { | |
2538 | default: | |
2539 | fprintf (config.map_file, _("Fail with %d\n"), s->header.type); | |
2540 | FAIL (); | |
2541 | break; | |
2542 | case lang_constructors_statement_enum: | |
2543 | if (constructor_list.head != NULL) | |
2544 | { | |
2545 | if (constructors_sorted) | |
2546 | minfo (" SORT (CONSTRUCTORS)\n"); | |
2547 | else | |
2548 | minfo (" CONSTRUCTORS\n"); | |
2549 | print_statement_list (constructor_list.head, os); | |
2550 | } | |
2551 | break; | |
2552 | case lang_wild_statement_enum: | |
2553 | print_wild_statement (&s->wild_statement, os); | |
2554 | break; | |
2555 | case lang_address_statement_enum: | |
2556 | print_address_statement (&s->address_statement); | |
2557 | break; | |
2558 | case lang_object_symbols_statement_enum: | |
2559 | minfo (" CREATE_OBJECT_SYMBOLS\n"); | |
2560 | break; | |
2561 | case lang_fill_statement_enum: | |
2562 | print_fill_statement (&s->fill_statement); | |
2563 | break; | |
2564 | case lang_data_statement_enum: | |
2565 | print_data_statement (&s->data_statement); | |
2566 | break; | |
2567 | case lang_reloc_statement_enum: | |
2568 | print_reloc_statement (&s->reloc_statement); | |
2569 | break; | |
2570 | case lang_input_section_enum: | |
2571 | print_input_section (&s->input_section); | |
2572 | break; | |
2573 | case lang_padding_statement_enum: | |
2574 | print_padding_statement (&s->padding_statement); | |
2575 | break; | |
2576 | case lang_output_section_statement_enum: | |
2577 | print_output_section_statement (&s->output_section_statement); | |
2578 | break; | |
2579 | case lang_assignment_statement_enum: | |
2580 | print_assignment (&s->assignment_statement, os); | |
2581 | break; | |
2582 | case lang_target_statement_enum: | |
2583 | fprintf (config.map_file, "TARGET(%s)\n", s->target_statement.target); | |
2584 | break; | |
2585 | case lang_output_statement_enum: | |
2586 | minfo ("OUTPUT(%s", s->output_statement.name); | |
2587 | if (output_target != NULL) | |
2588 | minfo (" %s", output_target); | |
2589 | minfo (")\n"); | |
2590 | break; | |
2591 | case lang_input_statement_enum: | |
2592 | print_input_statement (&s->input_statement); | |
2593 | break; | |
2594 | case lang_group_statement_enum: | |
2595 | print_group (&s->group_statement, os); | |
2596 | break; | |
2597 | case lang_afile_asection_pair_statement_enum: | |
2598 | FAIL (); | |
2599 | break; | |
2600 | } | |
2601 | } | |
2602 | ||
2603 | static void | |
1579bae1 | 2604 | print_statements (void) |
252b5132 RH |
2605 | { |
2606 | print_statement_list (statement_list.head, abs_output_section); | |
2607 | } | |
2608 | ||
2609 | /* Print the first N statements in statement list S to STDERR. | |
2610 | If N == 0, nothing is printed. | |
2611 | If N < 0, the entire list is printed. | |
2612 | Intended to be called from GDB. */ | |
2613 | ||
2614 | void | |
1579bae1 | 2615 | dprint_statement (lang_statement_union_type *s, int n) |
252b5132 RH |
2616 | { |
2617 | FILE *map_save = config.map_file; | |
2618 | ||
2619 | config.map_file = stderr; | |
2620 | ||
2621 | if (n < 0) | |
2622 | print_statement_list (s, abs_output_section); | |
2623 | else | |
2624 | { | |
2625 | while (s && --n >= 0) | |
2626 | { | |
2627 | print_statement (s, abs_output_section); | |
bba1a0c0 | 2628 | s = s->header.next; |
252b5132 RH |
2629 | } |
2630 | } | |
2631 | ||
2632 | config.map_file = map_save; | |
2633 | } | |
2634 | ||
b3327aad | 2635 | static void |
1579bae1 AM |
2636 | insert_pad (lang_statement_union_type **ptr, |
2637 | fill_type *fill, | |
2638 | unsigned int alignment_needed, | |
2639 | asection *output_section, | |
2640 | bfd_vma dot) | |
252b5132 | 2641 | { |
2c382fb6 | 2642 | static fill_type zero_fill = { 1, { 0 } }; |
b3327aad | 2643 | lang_statement_union_type *pad; |
b3327aad | 2644 | |
c0c330a7 | 2645 | pad = ((lang_statement_union_type *) |
2af02257 | 2646 | ((char *) ptr - offsetof (lang_statement_union_type, header.next))); |
b3327aad | 2647 | if (ptr != &statement_list.head |
2af02257 | 2648 | && pad->header.type == lang_padding_statement_enum |
b3327aad | 2649 | && pad->padding_statement.output_section == output_section) |
252b5132 | 2650 | { |
b3327aad AM |
2651 | /* Use the existing pad statement. The above test on output |
2652 | section is probably redundant, but it doesn't hurt to check. */ | |
252b5132 | 2653 | } |
b3327aad | 2654 | else |
252b5132 | 2655 | { |
b3327aad | 2656 | /* Make a new padding statement, linked into existing chain. */ |
1579bae1 | 2657 | pad = stat_alloc (sizeof (lang_padding_statement_type)); |
b3327aad AM |
2658 | pad->header.next = *ptr; |
2659 | *ptr = pad; | |
2660 | pad->header.type = lang_padding_statement_enum; | |
2661 | pad->padding_statement.output_section = output_section; | |
1579bae1 | 2662 | if (fill == NULL) |
2c382fb6 | 2663 | fill = &zero_fill; |
b3327aad | 2664 | pad->padding_statement.fill = fill; |
252b5132 | 2665 | } |
b3327aad AM |
2666 | pad->padding_statement.output_offset = dot - output_section->vma; |
2667 | pad->padding_statement.size = alignment_needed; | |
2668 | output_section->_raw_size += alignment_needed; | |
252b5132 RH |
2669 | } |
2670 | ||
08da4cac KH |
2671 | /* Work out how much this section will move the dot point. */ |
2672 | ||
252b5132 | 2673 | static bfd_vma |
1579bae1 AM |
2674 | size_input_section (lang_statement_union_type **this_ptr, |
2675 | lang_output_section_statement_type *output_section_statement, | |
2676 | fill_type *fill, | |
2677 | bfd_vma dot) | |
252b5132 RH |
2678 | { |
2679 | lang_input_section_type *is = &((*this_ptr)->input_section); | |
2680 | asection *i = is->section; | |
2681 | ||
7c519c12 | 2682 | if (!is->ifile->just_syms_flag) |
252b5132 | 2683 | { |
b3327aad AM |
2684 | unsigned opb = bfd_arch_mach_octets_per_byte (ldfile_output_architecture, |
2685 | ldfile_output_machine); | |
2686 | unsigned int alignment_needed; | |
2687 | asection *o; | |
2688 | ||
2689 | /* Align this section first to the input sections requirement, | |
2690 | then to the output section's requirement. If this alignment | |
2691 | is greater than any seen before, then record it too. Perform | |
2692 | the alignment by inserting a magic 'padding' statement. */ | |
2693 | ||
252b5132 | 2694 | if (output_section_statement->subsection_alignment != -1) |
b3327aad AM |
2695 | i->alignment_power = output_section_statement->subsection_alignment; |
2696 | ||
2697 | o = output_section_statement->bfd_section; | |
2698 | if (o->alignment_power < i->alignment_power) | |
2699 | o->alignment_power = i->alignment_power; | |
252b5132 | 2700 | |
b3327aad AM |
2701 | alignment_needed = align_power (dot, i->alignment_power) - dot; |
2702 | ||
2703 | if (alignment_needed != 0) | |
2704 | { | |
2705 | insert_pad (this_ptr, fill, alignment_needed * opb, o, dot); | |
2706 | dot += alignment_needed; | |
2707 | } | |
252b5132 | 2708 | |
08da4cac | 2709 | /* Remember where in the output section this input section goes. */ |
252b5132 | 2710 | |
b3327aad | 2711 | i->output_offset = dot - o->vma; |
252b5132 | 2712 | |
08da4cac | 2713 | /* Mark how big the output section must be to contain this now. */ |
252b5132 | 2714 | if (i->_cooked_size != 0) |
4cbfc3ac | 2715 | dot += i->_cooked_size / opb; |
252b5132 | 2716 | else |
4cbfc3ac | 2717 | dot += i->_raw_size / opb; |
b3327aad | 2718 | o->_raw_size = (dot - o->vma) * opb; |
252b5132 RH |
2719 | } |
2720 | else | |
2721 | { | |
2722 | i->output_offset = i->vma - output_section_statement->bfd_section->vma; | |
2723 | } | |
2724 | ||
2725 | return dot; | |
2726 | } | |
2727 | ||
33275c22 | 2728 | #define IGNORE_SECTION(bfd, s) \ |
d1778b88 AM |
2729 | (((bfd_get_section_flags (bfd, s) & (SEC_ALLOC | SEC_LOAD)) \ |
2730 | != (SEC_ALLOC | SEC_LOAD)) \ | |
33275c22 | 2731 | || bfd_section_size (bfd, s) == 0) |
d1778b88 | 2732 | |
252b5132 RH |
2733 | /* Check to see if any allocated sections overlap with other allocated |
2734 | sections. This can happen when the linker script specifically specifies | |
2735 | the output section addresses of the two sections. */ | |
08da4cac | 2736 | |
252b5132 | 2737 | static void |
1579bae1 | 2738 | lang_check_section_addresses (void) |
252b5132 | 2739 | { |
08da4cac | 2740 | asection *s; |
f6af82bd | 2741 | unsigned opb = bfd_octets_per_byte (output_bfd); |
252b5132 RH |
2742 | |
2743 | /* Scan all sections in the output list. */ | |
2744 | for (s = output_bfd->sections; s != NULL; s = s->next) | |
33275c22 | 2745 | { |
08da4cac | 2746 | asection *os; |
5f992e62 | 2747 | |
33275c22 NC |
2748 | /* Ignore sections which are not loaded or which have no contents. */ |
2749 | if (IGNORE_SECTION (output_bfd, s)) | |
2750 | continue; | |
5f992e62 | 2751 | |
33275c22 NC |
2752 | /* Once we reach section 's' stop our seach. This prevents two |
2753 | warning messages from being produced, one for 'section A overlaps | |
2754 | section B' and one for 'section B overlaps section A'. */ | |
2755 | for (os = output_bfd->sections; os != s; os = os->next) | |
2756 | { | |
2757 | bfd_vma s_start; | |
2758 | bfd_vma s_end; | |
2759 | bfd_vma os_start; | |
2760 | bfd_vma os_end; | |
5f992e62 | 2761 | |
33275c22 NC |
2762 | /* Only consider loadable sections with real contents. */ |
2763 | if (IGNORE_SECTION (output_bfd, os)) | |
2764 | continue; | |
252b5132 | 2765 | |
33275c22 NC |
2766 | /* We must check the sections' LMA addresses not their |
2767 | VMA addresses because overlay sections can have | |
2768 | overlapping VMAs but they must have distinct LMAs. */ | |
2769 | s_start = bfd_section_lma (output_bfd, s); | |
2770 | os_start = bfd_section_lma (output_bfd, os); | |
9e4ed18c TW |
2771 | s_end = s_start + bfd_section_size (output_bfd, s) / opb - 1; |
2772 | os_end = os_start + bfd_section_size (output_bfd, os) / opb - 1; | |
5f992e62 | 2773 | |
33275c22 NC |
2774 | /* Look for an overlap. */ |
2775 | if ((s_end < os_start) || (s_start > os_end)) | |
2776 | continue; | |
5f992e62 | 2777 | |
33275c22 | 2778 | einfo ( |
252b5132 | 2779 | _("%X%P: section %s [%V -> %V] overlaps section %s [%V -> %V]\n"), |
33275c22 | 2780 | s->name, s_start, s_end, os->name, os_start, os_end); |
5f992e62 | 2781 | |
33275c22 NC |
2782 | /* Once we have found one overlap for this section, |
2783 | stop looking for others. */ | |
2784 | break; | |
2785 | } | |
2786 | } | |
252b5132 RH |
2787 | } |
2788 | ||
562d3460 TW |
2789 | /* Make sure the new address is within the region. We explicitly permit the |
2790 | current address to be at the exact end of the region when the address is | |
2791 | non-zero, in case the region is at the end of addressable memory and the | |
5f992e62 | 2792 | calculation wraps around. */ |
562d3460 TW |
2793 | |
2794 | static void | |
1579bae1 AM |
2795 | os_region_check (lang_output_section_statement_type *os, |
2796 | struct memory_region_struct *region, | |
2797 | etree_type *tree, | |
2798 | bfd_vma base) | |
562d3460 TW |
2799 | { |
2800 | if ((region->current < region->origin | |
2801 | || (region->current - region->origin > region->length)) | |
2802 | && ((region->current != region->origin + region->length) | |
b7a26f91 | 2803 | || base == 0)) |
562d3460 | 2804 | { |
1579bae1 | 2805 | if (tree != NULL) |
b7a26f91 KH |
2806 | { |
2807 | einfo (_("%X%P: address 0x%v of %B section %s is not within region %s\n"), | |
2808 | region->current, | |
2809 | os->bfd_section->owner, | |
2810 | os->bfd_section->name, | |
2811 | region->name); | |
2812 | } | |
562d3460 | 2813 | else |
b7a26f91 KH |
2814 | { |
2815 | einfo (_("%X%P: region %s is full (%B section %s)\n"), | |
2816 | region->name, | |
2817 | os->bfd_section->owner, | |
2818 | os->bfd_section->name); | |
2819 | } | |
562d3460 TW |
2820 | /* Reset the region pointer. */ |
2821 | region->current = region->origin; | |
2822 | } | |
2823 | } | |
2824 | ||
252b5132 RH |
2825 | /* Set the sizes for all the output sections. */ |
2826 | ||
2d20f7bf | 2827 | static bfd_vma |
1579bae1 AM |
2828 | lang_size_sections_1 |
2829 | (lang_statement_union_type *s, | |
2830 | lang_output_section_statement_type *output_section_statement, | |
2831 | lang_statement_union_type **prev, | |
2832 | fill_type *fill, | |
2833 | bfd_vma dot, | |
2834 | bfd_boolean *relax, | |
2835 | bfd_boolean check_regions) | |
252b5132 | 2836 | { |
5f992e62 | 2837 | unsigned opb = bfd_arch_mach_octets_per_byte (ldfile_output_architecture, |
f6af82bd | 2838 | ldfile_output_machine); |
4cbfc3ac | 2839 | |
252b5132 | 2840 | /* Size up the sections from their constituent parts. */ |
1579bae1 | 2841 | for (; s != NULL; s = s->header.next) |
252b5132 RH |
2842 | { |
2843 | switch (s->header.type) | |
2844 | { | |
2845 | case lang_output_section_statement_enum: | |
2846 | { | |
2847 | bfd_vma after; | |
d1778b88 | 2848 | lang_output_section_statement_type *os; |
252b5132 | 2849 | |
d1778b88 | 2850 | os = &s->output_section_statement; |
252b5132 RH |
2851 | if (os->bfd_section == NULL) |
2852 | /* This section was never actually created. */ | |
2853 | break; | |
2854 | ||
2855 | /* If this is a COFF shared library section, use the size and | |
2856 | address from the input section. FIXME: This is COFF | |
2857 | specific; it would be cleaner if there were some other way | |
2858 | to do this, but nothing simple comes to mind. */ | |
2859 | if ((os->bfd_section->flags & SEC_COFF_SHARED_LIBRARY) != 0) | |
2860 | { | |
08da4cac | 2861 | asection *input; |
252b5132 RH |
2862 | |
2863 | if (os->children.head == NULL | |
bba1a0c0 | 2864 | || os->children.head->header.next != NULL |
252b5132 RH |
2865 | || os->children.head->header.type != lang_input_section_enum) |
2866 | einfo (_("%P%X: Internal error on COFF shared library section %s\n"), | |
2867 | os->name); | |
2868 | ||
2869 | input = os->children.head->input_section.section; | |
2870 | bfd_set_section_vma (os->bfd_section->owner, | |
2871 | os->bfd_section, | |
2872 | bfd_section_vma (input->owner, input)); | |
2873 | os->bfd_section->_raw_size = input->_raw_size; | |
2874 | break; | |
2875 | } | |
2876 | ||
2877 | if (bfd_is_abs_section (os->bfd_section)) | |
2878 | { | |
2879 | /* No matter what happens, an abs section starts at zero. */ | |
2880 | ASSERT (os->bfd_section->vma == 0); | |
2881 | } | |
2882 | else | |
2883 | { | |
1579bae1 | 2884 | if (os->addr_tree == NULL) |
252b5132 RH |
2885 | { |
2886 | /* No address specified for this section, get one | |
2887 | from the region specification. */ | |
1579bae1 | 2888 | if (os->region == NULL |
252b5132 RH |
2889 | || (((bfd_get_section_flags (output_bfd, os->bfd_section) |
2890 | & (SEC_ALLOC | SEC_LOAD)) != 0) | |
2891 | && os->region->name[0] == '*' | |
2892 | && strcmp (os->region->name, "*default*") == 0)) | |
2893 | { | |
2894 | os->region = lang_memory_default (os->bfd_section); | |
2895 | } | |
2896 | ||
2897 | /* If a loadable section is using the default memory | |
2898 | region, and some non default memory regions were | |
66184979 | 2899 | defined, issue an error message. */ |
a7f18fb3 | 2900 | if (!IGNORE_SECTION (output_bfd, os->bfd_section) |
d08a14c3 AM |
2901 | && (bfd_get_section_flags (output_bfd, os->bfd_section) |
2902 | & SEC_NEVER_LOAD) == 0 | |
1049f94e | 2903 | && ! link_info.relocatable |
cf888e70 | 2904 | && check_regions |
252b5132 RH |
2905 | && strcmp (os->region->name, "*default*") == 0 |
2906 | && lang_memory_region_list != NULL | |
d1778b88 AM |
2907 | && (strcmp (lang_memory_region_list->name, |
2908 | "*default*") != 0 | |
252b5132 | 2909 | || lang_memory_region_list->next != NULL)) |
66184979 NC |
2910 | { |
2911 | /* By default this is an error rather than just a | |
2912 | warning because if we allocate the section to the | |
2913 | default memory region we can end up creating an | |
2914 | excessivly large binary, or even seg faulting when | |
2915 | attmepting to perform a negative seek. See | |
1579bae1 | 2916 | http://sources.redhat.com/ml/binutils/2003-04/msg00423.html |
66184979 NC |
2917 | for an example of this. This behaviour can be |
2918 | overridden by the using the --no-check-sections | |
2919 | switch. */ | |
2920 | if (command_line.check_section_addresses) | |
2921 | einfo (_("%P%F: error: no memory region specified for loadable section `%s'\n"), | |
2922 | bfd_get_section_name (output_bfd, | |
2923 | os->bfd_section)); | |
2924 | else | |
2925 | einfo (_("%P: warning: no memory region specified for loadable section `%s'\n"), | |
2926 | bfd_get_section_name (output_bfd, | |
2927 | os->bfd_section)); | |
2928 | } | |
252b5132 RH |
2929 | |
2930 | dot = os->region->current; | |
5f992e62 | 2931 | |
252b5132 RH |
2932 | if (os->section_alignment == -1) |
2933 | { | |
2934 | bfd_vma olddot; | |
2935 | ||
2936 | olddot = dot; | |
d1778b88 AM |
2937 | dot = align_power (dot, |
2938 | os->bfd_section->alignment_power); | |
252b5132 RH |
2939 | |
2940 | if (dot != olddot && config.warn_section_align) | |
2941 | einfo (_("%P: warning: changing start of section %s by %u bytes\n"), | |
2942 | os->name, (unsigned int) (dot - olddot)); | |
2943 | } | |
2944 | } | |
2945 | else | |
2946 | { | |
2947 | etree_value_type r; | |
2948 | ||
2949 | r = exp_fold_tree (os->addr_tree, | |
2950 | abs_output_section, | |
2951 | lang_allocating_phase_enum, | |
2952 | dot, &dot); | |
7c519c12 AM |
2953 | if (!r.valid_p) |
2954 | einfo (_("%F%S: non constant address expression for section %s\n"), | |
2955 | os->name); | |
2956 | ||
252b5132 RH |
2957 | dot = r.value + r.section->bfd_section->vma; |
2958 | } | |
5f992e62 | 2959 | |
252b5132 RH |
2960 | /* The section starts here. |
2961 | First, align to what the section needs. */ | |
2962 | ||
2963 | if (os->section_alignment != -1) | |
2964 | dot = align_power (dot, os->section_alignment); | |
2965 | ||
2966 | bfd_set_section_vma (0, os->bfd_section, dot); | |
5f992e62 | 2967 | |
252b5132 RH |
2968 | os->bfd_section->output_offset = 0; |
2969 | } | |
2970 | ||
2d20f7bf | 2971 | lang_size_sections_1 (os->children.head, os, &os->children.head, |
cf888e70 | 2972 | os->fill, dot, relax, check_regions); |
5f992e62 | 2973 | |
08da4cac KH |
2974 | /* Put the section within the requested block size, or |
2975 | align at the block boundary. */ | |
c553bb91 | 2976 | after = align_n (os->bfd_section->vma |
32edc927 | 2977 | + os->bfd_section->_raw_size / opb, |
252b5132 RH |
2978 | (bfd_vma) os->block_value); |
2979 | ||
2980 | if (bfd_is_abs_section (os->bfd_section)) | |
2981 | ASSERT (after == os->bfd_section->vma); | |
13ae64f3 | 2982 | else if ((os->bfd_section->flags & SEC_HAS_CONTENTS) == 0 |
704afa60 | 2983 | && (os->bfd_section->flags & SEC_THREAD_LOCAL) |
1049f94e | 2984 | && ! link_info.relocatable) |
13ae64f3 | 2985 | os->bfd_section->_raw_size = 0; |
252b5132 | 2986 | else |
5f992e62 | 2987 | os->bfd_section->_raw_size = |
08da4cac | 2988 | (after - os->bfd_section->vma) * opb; |
9f88b410 | 2989 | |
4cbfc3ac | 2990 | dot = os->bfd_section->vma + os->bfd_section->_raw_size / opb; |
b34976b6 | 2991 | os->processed = TRUE; |
252b5132 | 2992 | |
9f88b410 RS |
2993 | if (os->update_dot_tree != 0) |
2994 | exp_fold_tree (os->update_dot_tree, abs_output_section, | |
2995 | lang_allocating_phase_enum, dot, &dot); | |
2996 | ||
252b5132 RH |
2997 | /* Update dot in the region ? |
2998 | We only do this if the section is going to be allocated, | |
2999 | since unallocated sections do not contribute to the region's | |
13392b77 | 3000 | overall size in memory. |
5f992e62 | 3001 | |
cce4c4c5 NC |
3002 | If the SEC_NEVER_LOAD bit is not set, it will affect the |
3003 | addresses of sections after it. We have to update | |
3004 | dot. */ | |
1579bae1 | 3005 | if (os->region != NULL |
cce4c4c5 NC |
3006 | && ((bfd_get_section_flags (output_bfd, os->bfd_section) |
3007 | & SEC_NEVER_LOAD) == 0 | |
3008 | || (bfd_get_section_flags (output_bfd, os->bfd_section) | |
3009 | & (SEC_ALLOC | SEC_LOAD)))) | |
252b5132 RH |
3010 | { |
3011 | os->region->current = dot; | |
5f992e62 | 3012 | |
cf888e70 NC |
3013 | if (check_regions) |
3014 | /* Make sure the new address is within the region. */ | |
3015 | os_region_check (os, os->region, os->addr_tree, | |
3016 | os->bfd_section->vma); | |
08da4cac KH |
3017 | |
3018 | /* If there's no load address specified, use the run | |
3019 | region as the load region. */ | |
3020 | if (os->lma_region == NULL && os->load_base == NULL) | |
3021 | os->lma_region = os->region; | |
3022 | ||
ee3cc2e2 | 3023 | if (os->lma_region != NULL && os->lma_region != os->region) |
08da4cac | 3024 | { |
ee3cc2e2 RS |
3025 | /* Set load_base, which will be handled later. */ |
3026 | os->load_base = exp_intop (os->lma_region->current); | |
3027 | os->lma_region->current += | |
3028 | os->bfd_section->_raw_size / opb; | |
cf888e70 NC |
3029 | if (check_regions) |
3030 | os_region_check (os, os->lma_region, NULL, | |
3031 | os->bfd_section->lma); | |
08da4cac | 3032 | } |
252b5132 RH |
3033 | } |
3034 | } | |
3035 | break; | |
3036 | ||
3037 | case lang_constructors_statement_enum: | |
2d20f7bf JJ |
3038 | dot = lang_size_sections_1 (constructor_list.head, |
3039 | output_section_statement, | |
3040 | &s->wild_statement.children.head, | |
cf888e70 | 3041 | fill, dot, relax, check_regions); |
252b5132 RH |
3042 | break; |
3043 | ||
3044 | case lang_data_statement_enum: | |
3045 | { | |
3046 | unsigned int size = 0; | |
3047 | ||
08da4cac KH |
3048 | s->data_statement.output_vma = |
3049 | dot - output_section_statement->bfd_section->vma; | |
252b5132 RH |
3050 | s->data_statement.output_section = |
3051 | output_section_statement->bfd_section; | |
3052 | ||
3053 | switch (s->data_statement.type) | |
3054 | { | |
08da4cac KH |
3055 | default: |
3056 | abort (); | |
252b5132 RH |
3057 | case QUAD: |
3058 | case SQUAD: | |
3059 | size = QUAD_SIZE; | |
3060 | break; | |
3061 | case LONG: | |
3062 | size = LONG_SIZE; | |
3063 | break; | |
3064 | case SHORT: | |
3065 | size = SHORT_SIZE; | |
3066 | break; | |
3067 | case BYTE: | |
3068 | size = BYTE_SIZE; | |
3069 | break; | |
3070 | } | |
08da4cac KH |
3071 | if (size < opb) |
3072 | size = opb; | |
4cbfc3ac | 3073 | dot += size / opb; |
252b5132 RH |
3074 | output_section_statement->bfd_section->_raw_size += size; |
3075 | /* The output section gets contents, and then we inspect for | |
3076 | any flags set in the input script which override any ALLOC. */ | |
3077 | output_section_statement->bfd_section->flags |= SEC_HAS_CONTENTS; | |
08da4cac KH |
3078 | if (!(output_section_statement->flags & SEC_NEVER_LOAD)) |
3079 | { | |
3080 | output_section_statement->bfd_section->flags |= | |
3081 | SEC_ALLOC | SEC_LOAD; | |
3082 | } | |
252b5132 RH |
3083 | } |
3084 | break; | |
3085 | ||
3086 | case lang_reloc_statement_enum: | |
3087 | { | |
3088 | int size; | |
3089 | ||
3090 | s->reloc_statement.output_vma = | |
3091 | dot - output_section_statement->bfd_section->vma; | |
3092 | s->reloc_statement.output_section = | |
3093 | output_section_statement->bfd_section; | |
3094 | size = bfd_get_reloc_size (s->reloc_statement.howto); | |
4cbfc3ac | 3095 | dot += size / opb; |
252b5132 RH |
3096 | output_section_statement->bfd_section->_raw_size += size; |
3097 | } | |
3098 | break; | |
5f992e62 | 3099 | |
252b5132 RH |
3100 | case lang_wild_statement_enum: |
3101 | ||
2d20f7bf JJ |
3102 | dot = lang_size_sections_1 (s->wild_statement.children.head, |
3103 | output_section_statement, | |
3104 | &s->wild_statement.children.head, | |
cf888e70 | 3105 | fill, dot, relax, check_regions); |
252b5132 RH |
3106 | |
3107 | break; | |
3108 | ||
3109 | case lang_object_symbols_statement_enum: | |
3110 | link_info.create_object_symbols_section = | |
3111 | output_section_statement->bfd_section; | |
3112 | break; | |
3113 | case lang_output_statement_enum: | |
3114 | case lang_target_statement_enum: | |
3115 | break; | |
3116 | case lang_input_section_enum: | |
3117 | { | |
3118 | asection *i; | |
3119 | ||
3120 | i = (*prev)->input_section.section; | |
3121 | if (! relax) | |
3122 | { | |
3123 | if (i->_cooked_size == 0) | |
3124 | i->_cooked_size = i->_raw_size; | |
3125 | } | |
3126 | else | |
3127 | { | |
b34976b6 | 3128 | bfd_boolean again; |
252b5132 RH |
3129 | |
3130 | if (! bfd_relax_section (i->owner, i, &link_info, &again)) | |
3131 | einfo (_("%P%F: can't relax section: %E\n")); | |
3132 | if (again) | |
b34976b6 | 3133 | *relax = TRUE; |
252b5132 | 3134 | } |
b3327aad AM |
3135 | dot = size_input_section (prev, output_section_statement, |
3136 | output_section_statement->fill, dot); | |
252b5132 RH |
3137 | } |
3138 | break; | |
3139 | case lang_input_statement_enum: | |
3140 | break; | |
3141 | case lang_fill_statement_enum: | |
08da4cac KH |
3142 | s->fill_statement.output_section = |
3143 | output_section_statement->bfd_section; | |
252b5132 RH |
3144 | |
3145 | fill = s->fill_statement.fill; | |
3146 | break; | |
3147 | case lang_assignment_statement_enum: | |
3148 | { | |
3149 | bfd_vma newdot = dot; | |
3150 | ||
3151 | exp_fold_tree (s->assignment_statement.exp, | |
3152 | output_section_statement, | |
3153 | lang_allocating_phase_enum, | |
3154 | dot, | |
3155 | &newdot); | |
3156 | ||
3157 | if (newdot != dot) | |
3158 | { | |
252b5132 RH |
3159 | if (output_section_statement == abs_output_section) |
3160 | { | |
3161 | /* If we don't have an output section, then just adjust | |
3162 | the default memory address. */ | |
3163 | lang_memory_region_lookup ("*default*")->current = newdot; | |
3164 | } | |
b3327aad | 3165 | else |
252b5132 | 3166 | { |
b3327aad AM |
3167 | /* Insert a pad after this statement. We can't |
3168 | put the pad before when relaxing, in case the | |
3169 | assignment references dot. */ | |
3170 | insert_pad (&s->header.next, fill, (newdot - dot) * opb, | |
3171 | output_section_statement->bfd_section, dot); | |
3172 | ||
3173 | /* Don't neuter the pad below when relaxing. */ | |
3174 | s = s->header.next; | |
252b5132 RH |
3175 | } |
3176 | ||
3177 | dot = newdot; | |
3178 | } | |
3179 | } | |
3180 | break; | |
3181 | ||
3182 | case lang_padding_statement_enum: | |
c0c330a7 AM |
3183 | /* If this is the first time lang_size_sections is called, |
3184 | we won't have any padding statements. If this is the | |
3185 | second or later passes when relaxing, we should allow | |
3186 | padding to shrink. If padding is needed on this pass, it | |
3187 | will be added back in. */ | |
3188 | s->padding_statement.size = 0; | |
6e814ff8 AM |
3189 | |
3190 | /* Make sure output_offset is valid. If relaxation shrinks | |
3191 | the section and this pad isn't needed, it's possible to | |
3192 | have output_offset larger than the final size of the | |
3193 | section. bfd_set_section_contents will complain even for | |
3194 | a pad size of zero. */ | |
3195 | s->padding_statement.output_offset | |
3196 | = dot - output_section_statement->bfd_section->vma; | |
252b5132 RH |
3197 | break; |
3198 | ||
3199 | case lang_group_statement_enum: | |
2d20f7bf JJ |
3200 | dot = lang_size_sections_1 (s->group_statement.children.head, |
3201 | output_section_statement, | |
3202 | &s->group_statement.children.head, | |
cf888e70 | 3203 | fill, dot, relax, check_regions); |
252b5132 RH |
3204 | break; |
3205 | ||
3206 | default: | |
3207 | FAIL (); | |
3208 | break; | |
3209 | ||
c0c330a7 | 3210 | /* We can only get here when relaxing is turned on. */ |
252b5132 RH |
3211 | case lang_address_statement_enum: |
3212 | break; | |
3213 | } | |
3214 | prev = &s->header.next; | |
3215 | } | |
3216 | return dot; | |
3217 | } | |
3218 | ||
2d20f7bf | 3219 | bfd_vma |
1579bae1 AM |
3220 | lang_size_sections |
3221 | (lang_statement_union_type *s, | |
3222 | lang_output_section_statement_type *output_section_statement, | |
3223 | lang_statement_union_type **prev, | |
3224 | fill_type *fill, | |
3225 | bfd_vma dot, | |
3226 | bfd_boolean *relax, | |
3227 | bfd_boolean check_regions) | |
2d20f7bf JJ |
3228 | { |
3229 | bfd_vma result; | |
86d3c9a8 | 3230 | asection *o; |
2d20f7bf | 3231 | |
420e579c HPN |
3232 | /* Callers of exp_fold_tree need to increment this. */ |
3233 | lang_statement_iteration++; | |
3234 | ||
2d20f7bf JJ |
3235 | exp_data_seg.phase = exp_dataseg_none; |
3236 | result = lang_size_sections_1 (s, output_section_statement, prev, fill, | |
cf888e70 | 3237 | dot, relax, check_regions); |
2d20f7bf JJ |
3238 | if (exp_data_seg.phase == exp_dataseg_end_seen) |
3239 | { | |
3240 | /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether | |
3241 | a page could be saved in the data segment. */ | |
3242 | bfd_vma first, last; | |
3243 | ||
3244 | first = -exp_data_seg.base & (exp_data_seg.pagesize - 1); | |
3245 | last = exp_data_seg.end & (exp_data_seg.pagesize - 1); | |
3246 | if (first && last | |
3247 | && ((exp_data_seg.base & ~(exp_data_seg.pagesize - 1)) | |
3248 | != (exp_data_seg.end & ~(exp_data_seg.pagesize - 1))) | |
3249 | && first + last <= exp_data_seg.pagesize) | |
3250 | { | |
3251 | exp_data_seg.phase = exp_dataseg_adjust; | |
3252 | result = lang_size_sections_1 (s, output_section_statement, prev, | |
cf888e70 | 3253 | fill, dot, relax, check_regions); |
2d20f7bf JJ |
3254 | } |
3255 | } | |
3256 | ||
86d3c9a8 HPN |
3257 | /* Some backend relaxers want to refer to the output section size. Give |
3258 | them a section size that does not change on the next call while they | |
3259 | relax. We can't set this at top because lang_reset_memory_regions | |
3260 | which is called before we get here, sets _raw_size to 0 on relaxing | |
3261 | rounds. */ | |
3262 | for (o = output_bfd->sections; o != NULL; o = o->next) | |
3263 | o->_cooked_size = o->_raw_size; | |
3264 | ||
2d20f7bf JJ |
3265 | return result; |
3266 | } | |
3267 | ||
420e579c HPN |
3268 | /* Worker function for lang_do_assignments. Recursiveness goes here. */ |
3269 | ||
3270 | static bfd_vma | |
3271 | lang_do_assignments_1 | |
1579bae1 AM |
3272 | (lang_statement_union_type *s, |
3273 | lang_output_section_statement_type *output_section_statement, | |
3274 | fill_type *fill, | |
3275 | bfd_vma dot) | |
252b5132 | 3276 | { |
5f992e62 AM |
3277 | unsigned opb = bfd_arch_mach_octets_per_byte (ldfile_output_architecture, |
3278 | ldfile_output_machine); | |
4cbfc3ac | 3279 | |
1579bae1 | 3280 | for (; s != NULL; s = s->header.next) |
252b5132 RH |
3281 | { |
3282 | switch (s->header.type) | |
3283 | { | |
3284 | case lang_constructors_statement_enum: | |
420e579c HPN |
3285 | dot = lang_do_assignments_1 (constructor_list.head, |
3286 | output_section_statement, | |
3287 | fill, | |
3288 | dot); | |
252b5132 RH |
3289 | break; |
3290 | ||
3291 | case lang_output_section_statement_enum: | |
3292 | { | |
d1778b88 | 3293 | lang_output_section_statement_type *os; |
252b5132 | 3294 | |
d1778b88 | 3295 | os = &(s->output_section_statement); |
252b5132 RH |
3296 | if (os->bfd_section != NULL) |
3297 | { | |
3298 | dot = os->bfd_section->vma; | |
420e579c HPN |
3299 | (void) lang_do_assignments_1 (os->children.head, os, |
3300 | os->fill, dot); | |
4cbfc3ac TW |
3301 | dot = os->bfd_section->vma + os->bfd_section->_raw_size / opb; |
3302 | ||
252b5132 | 3303 | } |
c13b1b77 | 3304 | if (os->load_base) |
252b5132 RH |
3305 | { |
3306 | /* If nothing has been placed into the output section then | |
4de2d33d | 3307 | it won't have a bfd_section. */ |
5f992e62 | 3308 | if (os->bfd_section) |
252b5132 | 3309 | { |
5f992e62 | 3310 | os->bfd_section->lma |
08da4cac KH |
3311 | = exp_get_abs_int (os->load_base, 0, "load base", |
3312 | lang_final_phase_enum); | |
252b5132 RH |
3313 | } |
3314 | } | |
3315 | } | |
3316 | break; | |
3317 | case lang_wild_statement_enum: | |
3318 | ||
420e579c HPN |
3319 | dot = lang_do_assignments_1 (s->wild_statement.children.head, |
3320 | output_section_statement, | |
3321 | fill, dot); | |
252b5132 RH |
3322 | |
3323 | break; | |
3324 | ||
3325 | case lang_object_symbols_statement_enum: | |
3326 | case lang_output_statement_enum: | |
3327 | case lang_target_statement_enum: | |
3328 | #if 0 | |
3329 | case lang_common_statement_enum: | |
3330 | #endif | |
3331 | break; | |
3332 | case lang_data_statement_enum: | |
3333 | { | |
3334 | etree_value_type value; | |
3335 | ||
3336 | value = exp_fold_tree (s->data_statement.exp, | |
3337 | abs_output_section, | |
3338 | lang_final_phase_enum, dot, &dot); | |
3339 | s->data_statement.value = value.value; | |
7c519c12 | 3340 | if (!value.valid_p) |
252b5132 RH |
3341 | einfo (_("%F%P: invalid data statement\n")); |
3342 | } | |
b7a26f91 KH |
3343 | { |
3344 | unsigned int size; | |
08da4cac KH |
3345 | switch (s->data_statement.type) |
3346 | { | |
3347 | default: | |
3348 | abort (); | |
3349 | case QUAD: | |
3350 | case SQUAD: | |
3351 | size = QUAD_SIZE; | |
3352 | break; | |
3353 | case LONG: | |
3354 | size = LONG_SIZE; | |
3355 | break; | |
3356 | case SHORT: | |
3357 | size = SHORT_SIZE; | |
3358 | break; | |
3359 | case BYTE: | |
3360 | size = BYTE_SIZE; | |
3361 | break; | |
3362 | } | |
3363 | if (size < opb) | |
3364 | size = opb; | |
3365 | dot += size / opb; | |
3366 | } | |
252b5132 RH |
3367 | break; |
3368 | ||
3369 | case lang_reloc_statement_enum: | |
3370 | { | |
3371 | etree_value_type value; | |
3372 | ||
3373 | value = exp_fold_tree (s->reloc_statement.addend_exp, | |
3374 | abs_output_section, | |
3375 | lang_final_phase_enum, dot, &dot); | |
3376 | s->reloc_statement.addend_value = value.value; | |
7c519c12 | 3377 | if (!value.valid_p) |
252b5132 RH |
3378 | einfo (_("%F%P: invalid reloc statement\n")); |
3379 | } | |
4cbfc3ac | 3380 | dot += bfd_get_reloc_size (s->reloc_statement.howto) / opb; |
252b5132 RH |
3381 | break; |
3382 | ||
3383 | case lang_input_section_enum: | |
3384 | { | |
3385 | asection *in = s->input_section.section; | |
3386 | ||
3387 | if (in->_cooked_size != 0) | |
4cbfc3ac | 3388 | dot += in->_cooked_size / opb; |
252b5132 | 3389 | else |
4cbfc3ac | 3390 | dot += in->_raw_size / opb; |
252b5132 RH |
3391 | } |
3392 | break; | |
3393 | ||
3394 | case lang_input_statement_enum: | |
3395 | break; | |
3396 | case lang_fill_statement_enum: | |
3397 | fill = s->fill_statement.fill; | |
3398 | break; | |
3399 | case lang_assignment_statement_enum: | |
3400 | { | |
3401 | exp_fold_tree (s->assignment_statement.exp, | |
3402 | output_section_statement, | |
3403 | lang_final_phase_enum, | |
3404 | dot, | |
3405 | &dot); | |
3406 | } | |
3407 | ||
3408 | break; | |
3409 | case lang_padding_statement_enum: | |
4cbfc3ac | 3410 | dot += s->padding_statement.size / opb; |
252b5132 RH |
3411 | break; |
3412 | ||
3413 | case lang_group_statement_enum: | |
420e579c HPN |
3414 | dot = lang_do_assignments_1 (s->group_statement.children.head, |
3415 | output_section_statement, | |
3416 | fill, dot); | |
252b5132 RH |
3417 | |
3418 | break; | |
3419 | ||
3420 | default: | |
3421 | FAIL (); | |
3422 | break; | |
3423 | case lang_address_statement_enum: | |
3424 | break; | |
3425 | } | |
3426 | ||
3427 | } | |
3428 | return dot; | |
3429 | } | |
3430 | ||
420e579c HPN |
3431 | bfd_vma |
3432 | lang_do_assignments (lang_statement_union_type *s, | |
3433 | lang_output_section_statement_type | |
3434 | *output_section_statement, | |
3435 | fill_type *fill, | |
3436 | bfd_vma dot) | |
3437 | { | |
3438 | /* Callers of exp_fold_tree need to increment this. */ | |
3439 | lang_statement_iteration++; | |
3440 | lang_do_assignments_1 (s, output_section_statement, fill, dot); | |
3441 | } | |
3442 | ||
252b5132 RH |
3443 | /* Fix any .startof. or .sizeof. symbols. When the assemblers see the |
3444 | operator .startof. (section_name), it produces an undefined symbol | |
3445 | .startof.section_name. Similarly, when it sees | |
3446 | .sizeof. (section_name), it produces an undefined symbol | |
3447 | .sizeof.section_name. For all the output sections, we look for | |
3448 | such symbols, and set them to the correct value. */ | |
3449 | ||
3450 | static void | |
1579bae1 | 3451 | lang_set_startof (void) |
252b5132 RH |
3452 | { |
3453 | asection *s; | |
3454 | ||
1049f94e | 3455 | if (link_info.relocatable) |
252b5132 RH |
3456 | return; |
3457 | ||
3458 | for (s = output_bfd->sections; s != NULL; s = s->next) | |
3459 | { | |
3460 | const char *secname; | |
3461 | char *buf; | |
3462 | struct bfd_link_hash_entry *h; | |
3463 | ||
3464 | secname = bfd_get_section_name (output_bfd, s); | |
3465 | buf = xmalloc (10 + strlen (secname)); | |
3466 | ||
3467 | sprintf (buf, ".startof.%s", secname); | |
b34976b6 | 3468 | h = bfd_link_hash_lookup (link_info.hash, buf, FALSE, FALSE, TRUE); |
252b5132 RH |
3469 | if (h != NULL && h->type == bfd_link_hash_undefined) |
3470 | { | |
3471 | h->type = bfd_link_hash_defined; | |
3472 | h->u.def.value = bfd_get_section_vma (output_bfd, s); | |
3473 | h->u.def.section = bfd_abs_section_ptr; | |
3474 | } | |
3475 | ||
3476 | sprintf (buf, ".sizeof.%s", secname); | |
b34976b6 | 3477 | h = bfd_link_hash_lookup (link_info.hash, buf, FALSE, FALSE, TRUE); |
252b5132 RH |
3478 | if (h != NULL && h->type == bfd_link_hash_undefined) |
3479 | { | |
b7a26f91 | 3480 | unsigned opb; |
d1778b88 | 3481 | |
b7a26f91 | 3482 | opb = bfd_arch_mach_octets_per_byte (ldfile_output_architecture, |
d1778b88 | 3483 | ldfile_output_machine); |
252b5132 RH |
3484 | h->type = bfd_link_hash_defined; |
3485 | if (s->_cooked_size != 0) | |
4cbfc3ac | 3486 | h->u.def.value = s->_cooked_size / opb; |
252b5132 | 3487 | else |
4cbfc3ac | 3488 | h->u.def.value = s->_raw_size / opb; |
252b5132 RH |
3489 | h->u.def.section = bfd_abs_section_ptr; |
3490 | } | |
3491 | ||
3492 | free (buf); | |
3493 | } | |
3494 | } | |
3495 | ||
3496 | static void | |
1579bae1 | 3497 | lang_finish (void) |
252b5132 RH |
3498 | { |
3499 | struct bfd_link_hash_entry *h; | |
b34976b6 | 3500 | bfd_boolean warn; |
252b5132 | 3501 | |
1049f94e | 3502 | if (link_info.relocatable || link_info.shared) |
b34976b6 | 3503 | warn = FALSE; |
252b5132 | 3504 | else |
b34976b6 | 3505 | warn = TRUE; |
252b5132 | 3506 | |
1579bae1 | 3507 | if (entry_symbol.name == NULL) |
252b5132 RH |
3508 | { |
3509 | /* No entry has been specified. Look for start, but don't warn | |
3510 | if we don't find it. */ | |
e3e942e9 | 3511 | entry_symbol.name = "start"; |
b34976b6 | 3512 | warn = FALSE; |
252b5132 RH |
3513 | } |
3514 | ||
e3e942e9 | 3515 | h = bfd_link_hash_lookup (link_info.hash, entry_symbol.name, |
b34976b6 | 3516 | FALSE, FALSE, TRUE); |
1579bae1 | 3517 | if (h != NULL |
252b5132 RH |
3518 | && (h->type == bfd_link_hash_defined |
3519 | || h->type == bfd_link_hash_defweak) | |
3520 | && h->u.def.section->output_section != NULL) | |
3521 | { | |
3522 | bfd_vma val; | |
3523 | ||
3524 | val = (h->u.def.value | |
3525 | + bfd_get_section_vma (output_bfd, | |
3526 | h->u.def.section->output_section) | |
3527 | + h->u.def.section->output_offset); | |
3528 | if (! bfd_set_start_address (output_bfd, val)) | |
e3e942e9 | 3529 | einfo (_("%P%F:%s: can't set start address\n"), entry_symbol.name); |
252b5132 RH |
3530 | } |
3531 | else | |
3532 | { | |
3533 | bfd_vma val; | |
5f992e62 | 3534 | const char *send; |
252b5132 RH |
3535 | |
3536 | /* We couldn't find the entry symbol. Try parsing it as a | |
3537 | number. */ | |
e3e942e9 | 3538 | val = bfd_scan_vma (entry_symbol.name, &send, 0); |
252b5132 RH |
3539 | if (*send == '\0') |
3540 | { | |
3541 | if (! bfd_set_start_address (output_bfd, val)) | |
3542 | einfo (_("%P%F: can't set start address\n")); | |
3543 | } | |
3544 | else | |
3545 | { | |
3546 | asection *ts; | |
3547 | ||
3548 | /* Can't find the entry symbol, and it's not a number. Use | |
3549 | the first address in the text section. */ | |
1e281515 | 3550 | ts = bfd_get_section_by_name (output_bfd, entry_section); |
1579bae1 | 3551 | if (ts != NULL) |
252b5132 RH |
3552 | { |
3553 | if (warn) | |
3554 | einfo (_("%P: warning: cannot find entry symbol %s; defaulting to %V\n"), | |
e3e942e9 AM |
3555 | entry_symbol.name, |
3556 | bfd_get_section_vma (output_bfd, ts)); | |
252b5132 RH |
3557 | if (! bfd_set_start_address (output_bfd, |
3558 | bfd_get_section_vma (output_bfd, | |
3559 | ts))) | |
3560 | einfo (_("%P%F: can't set start address\n")); | |
3561 | } | |
3562 | else | |
3563 | { | |
3564 | if (warn) | |
3565 | einfo (_("%P: warning: cannot find entry symbol %s; not setting start address\n"), | |
e3e942e9 | 3566 | entry_symbol.name); |
252b5132 RH |
3567 | } |
3568 | } | |
3569 | } | |
420e579c HPN |
3570 | |
3571 | bfd_hash_table_free (&lang_definedness_table); | |
252b5132 RH |
3572 | } |
3573 | ||
3574 | /* This is a small function used when we want to ignore errors from | |
3575 | BFD. */ | |
3576 | ||
3577 | static void | |
87f2a346 | 3578 | ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED, ...) |
252b5132 RH |
3579 | { |
3580 | /* Don't do anything. */ | |
3581 | } | |
3582 | ||
3583 | /* Check that the architecture of all the input files is compatible | |
3584 | with the output file. Also call the backend to let it do any | |
3585 | other checking that is needed. */ | |
3586 | ||
3587 | static void | |
1579bae1 | 3588 | lang_check (void) |
252b5132 RH |
3589 | { |
3590 | lang_statement_union_type *file; | |
3591 | bfd *input_bfd; | |
5f992e62 | 3592 | const bfd_arch_info_type *compatible; |
252b5132 | 3593 | |
1579bae1 | 3594 | for (file = file_chain.head; file != NULL; file = file->input_statement.next) |
252b5132 RH |
3595 | { |
3596 | input_bfd = file->input_statement.the_bfd; | |
312b768e NC |
3597 | compatible = bfd_arch_get_compatible (input_bfd, output_bfd, |
3598 | command_line.accept_unknown_input_arch); | |
30cba025 AM |
3599 | |
3600 | /* In general it is not possible to perform a relocatable | |
3601 | link between differing object formats when the input | |
3602 | file has relocations, because the relocations in the | |
3603 | input format may not have equivalent representations in | |
3604 | the output format (and besides BFD does not translate | |
3605 | relocs for other link purposes than a final link). */ | |
1049f94e | 3606 | if ((link_info.relocatable || link_info.emitrelocations) |
30cba025 | 3607 | && (compatible == NULL |
d35a52e2 | 3608 | || bfd_get_flavour (input_bfd) != bfd_get_flavour (output_bfd)) |
30cba025 AM |
3609 | && (bfd_get_file_flags (input_bfd) & HAS_RELOC) != 0) |
3610 | { | |
3611 | einfo (_("%P%F: Relocatable linking with relocations from format %s (%B) to format %s (%B) is not supported\n"), | |
3612 | bfd_get_target (input_bfd), input_bfd, | |
3613 | bfd_get_target (output_bfd), output_bfd); | |
3614 | /* einfo with %F exits. */ | |
3615 | } | |
3616 | ||
252b5132 RH |
3617 | if (compatible == NULL) |
3618 | { | |
3619 | if (command_line.warn_mismatch) | |
3620 | einfo (_("%P: warning: %s architecture of input file `%B' is incompatible with %s output\n"), | |
3621 | bfd_printable_name (input_bfd), input_bfd, | |
3622 | bfd_printable_name (output_bfd)); | |
3623 | } | |
b9247304 | 3624 | else if (bfd_count_sections (input_bfd)) |
252b5132 | 3625 | { |
b9247304 | 3626 | /* If the input bfd has no contents, it shouldn't set the |
b7a26f91 | 3627 | private data of the output bfd. */ |
b9247304 | 3628 | |
252b5132 RH |
3629 | bfd_error_handler_type pfn = NULL; |
3630 | ||
3631 | /* If we aren't supposed to warn about mismatched input | |
3632 | files, temporarily set the BFD error handler to a | |
3633 | function which will do nothing. We still want to call | |
3634 | bfd_merge_private_bfd_data, since it may set up | |
3635 | information which is needed in the output file. */ | |
3636 | if (! command_line.warn_mismatch) | |
3637 | pfn = bfd_set_error_handler (ignore_bfd_errors); | |
3638 | if (! bfd_merge_private_bfd_data (input_bfd, output_bfd)) | |
3639 | { | |
3640 | if (command_line.warn_mismatch) | |
3641 | einfo (_("%E%X: failed to merge target specific data of file %B\n"), | |
3642 | input_bfd); | |
3643 | } | |
3644 | if (! command_line.warn_mismatch) | |
3645 | bfd_set_error_handler (pfn); | |
3646 | } | |
3647 | } | |
3648 | } | |
3649 | ||
3650 | /* Look through all the global common symbols and attach them to the | |
3651 | correct section. The -sort-common command line switch may be used | |
3652 | to roughly sort the entries by size. */ | |
3653 | ||
3654 | static void | |
1579bae1 | 3655 | lang_common (void) |
252b5132 | 3656 | { |
4818e05f AM |
3657 | if (command_line.inhibit_common_definition) |
3658 | return; | |
1049f94e | 3659 | if (link_info.relocatable |
252b5132 RH |
3660 | && ! command_line.force_common_definition) |
3661 | return; | |
3662 | ||
3663 | if (! config.sort_common) | |
1579bae1 | 3664 | bfd_link_hash_traverse (link_info.hash, lang_one_common, NULL); |
252b5132 RH |
3665 | else |
3666 | { | |
3667 | int power; | |
3668 | ||
3669 | for (power = 4; power >= 0; power--) | |
1579bae1 | 3670 | bfd_link_hash_traverse (link_info.hash, lang_one_common, &power); |
252b5132 RH |
3671 | } |
3672 | } | |
3673 | ||
3674 | /* Place one common symbol in the correct section. */ | |
3675 | ||
b34976b6 | 3676 | static bfd_boolean |
1579bae1 | 3677 | lang_one_common (struct bfd_link_hash_entry *h, void *info) |
252b5132 RH |
3678 | { |
3679 | unsigned int power_of_two; | |
3680 | bfd_vma size; | |
3681 | asection *section; | |
5f992e62 AM |
3682 | unsigned opb = bfd_arch_mach_octets_per_byte (ldfile_output_architecture, |
3683 | ldfile_output_machine); | |
252b5132 RH |
3684 | |
3685 | if (h->type != bfd_link_hash_common) | |
b34976b6 | 3686 | return TRUE; |
252b5132 RH |
3687 | |
3688 | size = h->u.c.size; | |
3689 | power_of_two = h->u.c.p->alignment_power; | |
3690 | ||
3691 | if (config.sort_common | |
3692 | && power_of_two < (unsigned int) *(int *) info) | |
b34976b6 | 3693 | return TRUE; |
252b5132 RH |
3694 | |
3695 | section = h->u.c.p->section; | |
3696 | ||
3697 | /* Increase the size of the section. */ | |
c553bb91 AM |
3698 | section->_cooked_size = align_n ((section->_cooked_size + opb - 1) / opb, |
3699 | (bfd_vma) 1 << power_of_two) * opb; | |
252b5132 RH |
3700 | |
3701 | /* Adjust the alignment if necessary. */ | |
3702 | if (power_of_two > section->alignment_power) | |
3703 | section->alignment_power = power_of_two; | |
3704 | ||
3705 | /* Change the symbol from common to defined. */ | |
3706 | h->type = bfd_link_hash_defined; | |
3707 | h->u.def.section = section; | |
3708 | h->u.def.value = section->_cooked_size; | |
3709 | ||
3710 | /* Increase the size of the section. */ | |
3711 | section->_cooked_size += size; | |
3712 | ||
3713 | /* Make sure the section is allocated in memory, and make sure that | |
3714 | it is no longer a common section. */ | |
3715 | section->flags |= SEC_ALLOC; | |
08da4cac | 3716 | section->flags &= ~SEC_IS_COMMON; |
252b5132 RH |
3717 | |
3718 | if (config.map_file != NULL) | |
3719 | { | |
b34976b6 | 3720 | static bfd_boolean header_printed; |
252b5132 RH |
3721 | int len; |
3722 | char *name; | |
3723 | char buf[50]; | |
3724 | ||
3725 | if (! header_printed) | |
3726 | { | |
3727 | minfo (_("\nAllocating common symbols\n")); | |
3728 | minfo (_("Common symbol size file\n\n")); | |
b34976b6 | 3729 | header_printed = TRUE; |
252b5132 RH |
3730 | } |
3731 | ||
3732 | name = demangle (h->root.string); | |
3733 | minfo ("%s", name); | |
3734 | len = strlen (name); | |
3735 | free (name); | |
3736 | ||
3737 | if (len >= 19) | |
3738 | { | |
3739 | print_nl (); | |
3740 | len = 0; | |
3741 | } | |
3742 | while (len < 20) | |
3743 | { | |
3744 | print_space (); | |
3745 | ++len; | |
3746 | } | |
3747 | ||
3748 | minfo ("0x"); | |
3749 | if (size <= 0xffffffff) | |
3750 | sprintf (buf, "%lx", (unsigned long) size); | |
3751 | else | |
3752 | sprintf_vma (buf, size); | |
3753 | minfo ("%s", buf); | |
3754 | len = strlen (buf); | |
3755 | ||
3756 | while (len < 16) | |
3757 | { | |
3758 | print_space (); | |
3759 | ++len; | |
3760 | } | |
3761 | ||
3762 | minfo ("%B\n", section->owner); | |
3763 | } | |
3764 | ||
b34976b6 | 3765 | return TRUE; |
252b5132 RH |
3766 | } |
3767 | ||
08da4cac KH |
3768 | /* Run through the input files and ensure that every input section has |
3769 | somewhere to go. If one is found without a destination then create | |
3770 | an input request and place it into the statement tree. */ | |
252b5132 RH |
3771 | |
3772 | static void | |
1579bae1 | 3773 | lang_place_orphans (void) |
252b5132 | 3774 | { |
e50d8076 | 3775 | LANG_FOR_EACH_INPUT_STATEMENT (file) |
252b5132 RH |
3776 | { |
3777 | asection *s; | |
3778 | ||
1579bae1 | 3779 | for (s = file->the_bfd->sections; s != NULL; s = s->next) |
252b5132 | 3780 | { |
1579bae1 | 3781 | if (s->output_section == NULL) |
252b5132 | 3782 | { |
396a2467 | 3783 | /* This section of the file is not attached, root |
08da4cac | 3784 | around for a sensible place for it to go. */ |
252b5132 RH |
3785 | |
3786 | if (file->just_syms_flag) | |
3787 | { | |
c2c01aa7 | 3788 | abort (); |
252b5132 RH |
3789 | } |
3790 | else if (strcmp (s->name, "COMMON") == 0) | |
3791 | { | |
3792 | /* This is a lonely common section which must have | |
3793 | come from an archive. We attach to the section | |
3794 | with the wildcard. */ | |
1049f94e | 3795 | if (! link_info.relocatable |
252b5132 RH |
3796 | || command_line.force_common_definition) |
3797 | { | |
3798 | if (default_common_section == NULL) | |
3799 | { | |
3800 | #if 0 | |
3801 | /* This message happens when using the | |
3802 | svr3.ifile linker script, so I have | |
3803 | disabled it. */ | |
3804 | info_msg (_("%P: no [COMMON] command, defaulting to .bss\n")); | |
3805 | #endif | |
3806 | default_common_section = | |
3807 | lang_output_section_statement_lookup (".bss"); | |
3808 | ||
3809 | } | |
39dcfe18 AM |
3810 | lang_add_section (&default_common_section->children, s, |
3811 | default_common_section, file); | |
252b5132 RH |
3812 | } |
3813 | } | |
3814 | else if (ldemul_place_orphan (file, s)) | |
3815 | ; | |
3816 | else | |
3817 | { | |
39dcfe18 | 3818 | lang_output_section_statement_type *os; |
252b5132 | 3819 | |
39dcfe18 AM |
3820 | os = lang_output_section_statement_lookup (s->name); |
3821 | lang_add_section (&os->children, s, os, file); | |
252b5132 RH |
3822 | } |
3823 | } | |
3824 | } | |
3825 | } | |
3826 | } | |
3827 | ||
252b5132 | 3828 | void |
1579bae1 | 3829 | lang_set_flags (lang_memory_region_type *ptr, const char *flags, int invert) |
252b5132 | 3830 | { |
aa8804e4 | 3831 | flagword *ptr_flags; |
252b5132 | 3832 | |
aa8804e4 | 3833 | ptr_flags = invert ? &ptr->not_flags : &ptr->flags; |
252b5132 RH |
3834 | while (*flags) |
3835 | { | |
3836 | switch (*flags) | |
3837 | { | |
252b5132 RH |
3838 | case 'A': case 'a': |
3839 | *ptr_flags |= SEC_ALLOC; | |
3840 | break; | |
3841 | ||
3842 | case 'R': case 'r': | |
3843 | *ptr_flags |= SEC_READONLY; | |
3844 | break; | |
3845 | ||
3846 | case 'W': case 'w': | |
3847 | *ptr_flags |= SEC_DATA; | |
3848 | break; | |
3849 | ||
3850 | case 'X': case 'x': | |
3851 | *ptr_flags |= SEC_CODE; | |
3852 | break; | |
3853 | ||
3854 | case 'L': case 'l': | |
3855 | case 'I': case 'i': | |
3856 | *ptr_flags |= SEC_LOAD; | |
3857 | break; | |
3858 | ||
3859 | default: | |
3860 | einfo (_("%P%F: invalid syntax in flags\n")); | |
3861 | break; | |
3862 | } | |
3863 | flags++; | |
3864 | } | |
3865 | } | |
3866 | ||
3867 | /* Call a function on each input file. This function will be called | |
3868 | on an archive, but not on the elements. */ | |
3869 | ||
3870 | void | |
1579bae1 | 3871 | lang_for_each_input_file (void (*func) (lang_input_statement_type *)) |
252b5132 RH |
3872 | { |
3873 | lang_input_statement_type *f; | |
3874 | ||
3875 | for (f = (lang_input_statement_type *) input_file_chain.head; | |
3876 | f != NULL; | |
3877 | f = (lang_input_statement_type *) f->next_real_file) | |
3878 | func (f); | |
3879 | } | |
3880 | ||
3881 | /* Call a function on each file. The function will be called on all | |
3882 | the elements of an archive which are included in the link, but will | |
3883 | not be called on the archive file itself. */ | |
3884 | ||
3885 | void | |
1579bae1 | 3886 | lang_for_each_file (void (*func) (lang_input_statement_type *)) |
252b5132 | 3887 | { |
e50d8076 | 3888 | LANG_FOR_EACH_INPUT_STATEMENT (f) |
252b5132 RH |
3889 | { |
3890 | func (f); | |
3891 | } | |
3892 | } | |
3893 | ||
3894 | #if 0 | |
3895 | ||
3896 | /* Not used. */ | |
3897 | ||
3898 | void | |
1579bae1 | 3899 | lang_for_each_input_section (void (*func) (bfd *ab, asection *as)) |
252b5132 | 3900 | { |
e50d8076 | 3901 | LANG_FOR_EACH_INPUT_STATEMENT (f) |
252b5132 | 3902 | { |
08da4cac | 3903 | asection *s; |
252b5132 | 3904 | |
1579bae1 AM |
3905 | for (s = f->the_bfd->sections; s != NULL; s = s->next) |
3906 | func (f->the_bfd, s); | |
252b5132 RH |
3907 | } |
3908 | } | |
3909 | ||
3910 | #endif | |
3911 | ||
3912 | void | |
1579bae1 | 3913 | ldlang_add_file (lang_input_statement_type *entry) |
252b5132 RH |
3914 | { |
3915 | bfd **pp; | |
3916 | ||
3917 | lang_statement_append (&file_chain, | |
3918 | (lang_statement_union_type *) entry, | |
3919 | &entry->next); | |
3920 | ||
3921 | /* The BFD linker needs to have a list of all input BFDs involved in | |
3922 | a link. */ | |
1579bae1 | 3923 | ASSERT (entry->the_bfd->link_next == NULL); |
252b5132 | 3924 | ASSERT (entry->the_bfd != output_bfd); |
1579bae1 | 3925 | for (pp = &link_info.input_bfds; *pp != NULL; pp = &(*pp)->link_next) |
252b5132 RH |
3926 | ; |
3927 | *pp = entry->the_bfd; | |
1579bae1 | 3928 | entry->the_bfd->usrdata = entry; |
252b5132 RH |
3929 | bfd_set_gp_size (entry->the_bfd, g_switch_value); |
3930 | ||
3931 | /* Look through the sections and check for any which should not be | |
3932 | included in the link. We need to do this now, so that we can | |
3933 | notice when the backend linker tries to report multiple | |
3934 | definition errors for symbols which are in sections we aren't | |
3935 | going to link. FIXME: It might be better to entirely ignore | |
3936 | symbols which are defined in sections which are going to be | |
3937 | discarded. This would require modifying the backend linker for | |
3938 | each backend which might set the SEC_LINK_ONCE flag. If we do | |
3939 | this, we should probably handle SEC_EXCLUDE in the same way. */ | |
3940 | ||
1579bae1 | 3941 | bfd_map_over_sections (entry->the_bfd, section_already_linked, entry); |
252b5132 RH |
3942 | } |
3943 | ||
3944 | void | |
1579bae1 | 3945 | lang_add_output (const char *name, int from_script) |
252b5132 RH |
3946 | { |
3947 | /* Make -o on command line override OUTPUT in script. */ | |
7c519c12 | 3948 | if (!had_output_filename || !from_script) |
252b5132 RH |
3949 | { |
3950 | output_filename = name; | |
b34976b6 | 3951 | had_output_filename = TRUE; |
252b5132 RH |
3952 | } |
3953 | } | |
3954 | ||
252b5132 RH |
3955 | static lang_output_section_statement_type *current_section; |
3956 | ||
3957 | static int | |
1579bae1 | 3958 | topower (int x) |
252b5132 RH |
3959 | { |
3960 | unsigned int i = 1; | |
3961 | int l; | |
3962 | ||
3963 | if (x < 0) | |
3964 | return -1; | |
3965 | ||
5f992e62 | 3966 | for (l = 0; l < 32; l++) |
252b5132 RH |
3967 | { |
3968 | if (i >= (unsigned int) x) | |
3969 | return l; | |
3970 | i <<= 1; | |
3971 | } | |
3972 | ||
3973 | return 0; | |
3974 | } | |
3975 | ||
aea4bd9d | 3976 | lang_output_section_statement_type * |
1579bae1 AM |
3977 | lang_enter_output_section_statement (const char *output_section_statement_name, |
3978 | etree_type *address_exp, | |
3979 | enum section_type sectype, | |
3980 | bfd_vma block_value, | |
3981 | etree_type *align, | |
3982 | etree_type *subalign, | |
3983 | etree_type *ebase) | |
252b5132 RH |
3984 | { |
3985 | lang_output_section_statement_type *os; | |
3986 | ||
3987 | current_section = | |
3988 | os = | |
3989 | lang_output_section_statement_lookup (output_section_statement_name); | |
3990 | ||
08da4cac KH |
3991 | /* Add this statement to tree. */ |
3992 | #if 0 | |
3993 | add_statement (lang_output_section_statement_enum, | |
3994 | output_section_statement); | |
3995 | #endif | |
3996 | /* Make next things chain into subchain of this. */ | |
252b5132 | 3997 | |
1579bae1 | 3998 | if (os->addr_tree == NULL) |
08da4cac KH |
3999 | { |
4000 | os->addr_tree = address_exp; | |
4001 | } | |
252b5132 RH |
4002 | os->sectype = sectype; |
4003 | if (sectype != noload_section) | |
4004 | os->flags = SEC_NO_FLAGS; | |
4005 | else | |
4006 | os->flags = SEC_NEVER_LOAD; | |
4007 | os->block_value = block_value ? block_value : 1; | |
4008 | stat_ptr = &os->children; | |
4009 | ||
08da4cac KH |
4010 | os->subsection_alignment = |
4011 | topower (exp_get_value_int (subalign, -1, "subsection alignment", 0)); | |
4012 | os->section_alignment = | |
4013 | topower (exp_get_value_int (align, -1, "section alignment", 0)); | |
252b5132 RH |
4014 | |
4015 | os->load_base = ebase; | |
aea4bd9d | 4016 | return os; |
252b5132 RH |
4017 | } |
4018 | ||
252b5132 | 4019 | void |
1579bae1 | 4020 | lang_final (void) |
252b5132 RH |
4021 | { |
4022 | lang_output_statement_type *new = | |
4023 | new_stat (lang_output_statement, stat_ptr); | |
4024 | ||
4025 | new->name = output_filename; | |
4026 | } | |
4027 | ||
08da4cac KH |
4028 | /* Reset the current counters in the regions. */ |
4029 | ||
e3dc8847 | 4030 | void |
1579bae1 | 4031 | lang_reset_memory_regions (void) |
252b5132 RH |
4032 | { |
4033 | lang_memory_region_type *p = lang_memory_region_list; | |
b3327aad | 4034 | asection *o; |
252b5132 | 4035 | |
1579bae1 | 4036 | for (p = lang_memory_region_list; p != NULL; p = p->next) |
252b5132 RH |
4037 | { |
4038 | p->old_length = (bfd_size_type) (p->current - p->origin); | |
4039 | p->current = p->origin; | |
4040 | } | |
b3327aad AM |
4041 | |
4042 | for (o = output_bfd->sections; o != NULL; o = o->next) | |
4043 | o->_raw_size = 0; | |
252b5132 RH |
4044 | } |
4045 | ||
b6bf44ba AM |
4046 | /* If the wild pattern was marked KEEP, the member sections |
4047 | should be as well. */ | |
252b5132 RH |
4048 | |
4049 | static void | |
1579bae1 AM |
4050 | gc_section_callback (lang_wild_statement_type *ptr, |
4051 | struct wildcard_list *sec ATTRIBUTE_UNUSED, | |
4052 | asection *section, | |
4053 | lang_input_statement_type *file ATTRIBUTE_UNUSED, | |
4054 | void *data ATTRIBUTE_UNUSED) | |
252b5132 | 4055 | { |
4dec4d4e RH |
4056 | if (ptr->keep_sections) |
4057 | section->flags |= SEC_KEEP; | |
252b5132 RH |
4058 | } |
4059 | ||
b6bf44ba | 4060 | /* Handle a wild statement, marking it against GC. */ |
252b5132 RH |
4061 | |
4062 | static void | |
1579bae1 | 4063 | lang_gc_wild (lang_wild_statement_type *s) |
252b5132 | 4064 | { |
b6bf44ba | 4065 | walk_wild (s, gc_section_callback, NULL); |
252b5132 RH |
4066 | } |
4067 | ||
4068 | /* Iterate over sections marking them against GC. */ | |
4069 | ||
4070 | static void | |
1579bae1 | 4071 | lang_gc_sections_1 (lang_statement_union_type *s) |
252b5132 | 4072 | { |
1579bae1 | 4073 | for (; s != NULL; s = s->header.next) |
252b5132 RH |
4074 | { |
4075 | switch (s->header.type) | |
4076 | { | |
4077 | case lang_wild_statement_enum: | |
b6bf44ba | 4078 | lang_gc_wild (&s->wild_statement); |
abc6ab0a | 4079 | break; |
252b5132 RH |
4080 | case lang_constructors_statement_enum: |
4081 | lang_gc_sections_1 (constructor_list.head); | |
4082 | break; | |
4083 | case lang_output_section_statement_enum: | |
4084 | lang_gc_sections_1 (s->output_section_statement.children.head); | |
4085 | break; | |
4086 | case lang_group_statement_enum: | |
4087 | lang_gc_sections_1 (s->group_statement.children.head); | |
4088 | break; | |
4089 | default: | |
4090 | break; | |
4091 | } | |
4092 | } | |
4093 | } | |
4094 | ||
4095 | static void | |
1579bae1 | 4096 | lang_gc_sections (void) |
252b5132 RH |
4097 | { |
4098 | struct bfd_link_hash_entry *h; | |
e3e942e9 | 4099 | ldlang_undef_chain_list_type *ulist; |
252b5132 RH |
4100 | |
4101 | /* Keep all sections so marked in the link script. */ | |
4102 | ||
4103 | lang_gc_sections_1 (statement_list.head); | |
4104 | ||
e3e942e9 AM |
4105 | /* Keep all sections containing symbols undefined on the command-line, |
4106 | and the section containing the entry symbol. */ | |
252b5132 | 4107 | |
e3e942e9 | 4108 | for (ulist = link_info.gc_sym_list; ulist; ulist = ulist->next) |
252b5132 | 4109 | { |
5f992e62 | 4110 | h = bfd_link_hash_lookup (link_info.hash, ulist->name, |
b34976b6 | 4111 | FALSE, FALSE, FALSE); |
252b5132 | 4112 | |
1579bae1 | 4113 | if (h != NULL |
08da4cac KH |
4114 | && (h->type == bfd_link_hash_defined |
4115 | || h->type == bfd_link_hash_defweak) | |
252b5132 RH |
4116 | && ! bfd_is_abs_section (h->u.def.section)) |
4117 | { | |
4118 | h->u.def.section->flags |= SEC_KEEP; | |
4119 | } | |
4120 | } | |
4121 | ||
4122 | bfd_gc_sections (output_bfd, &link_info); | |
4123 | } | |
4124 | ||
4125 | void | |
1579bae1 | 4126 | lang_process (void) |
252b5132 RH |
4127 | { |
4128 | lang_reasonable_defaults (); | |
4129 | current_target = default_target; | |
4130 | ||
08da4cac KH |
4131 | /* Open the output file. */ |
4132 | lang_for_each_statement (ldlang_open_output); | |
252b5132 RH |
4133 | |
4134 | ldemul_create_output_section_statements (); | |
4135 | ||
08da4cac | 4136 | /* Add to the hash table all undefineds on the command line. */ |
252b5132 RH |
4137 | lang_place_undefineds (); |
4138 | ||
9503fd87 ILT |
4139 | already_linked_table_init (); |
4140 | ||
08da4cac | 4141 | /* Create a bfd for each input file. */ |
252b5132 | 4142 | current_target = default_target; |
b34976b6 | 4143 | open_input_bfds (statement_list.head, FALSE); |
252b5132 | 4144 | |
e3e942e9 AM |
4145 | link_info.gc_sym_list = &entry_symbol; |
4146 | if (entry_symbol.name == NULL) | |
4147 | link_info.gc_sym_list = ldlang_undef_chain_list_head; | |
4148 | ||
252b5132 RH |
4149 | ldemul_after_open (); |
4150 | ||
9503fd87 ILT |
4151 | already_linked_table_free (); |
4152 | ||
252b5132 RH |
4153 | /* Make sure that we're not mixing architectures. We call this |
4154 | after all the input files have been opened, but before we do any | |
4155 | other processing, so that any operations merge_private_bfd_data | |
4156 | does on the output file will be known during the rest of the | |
4157 | link. */ | |
4158 | lang_check (); | |
4159 | ||
4160 | /* Handle .exports instead of a version script if we're told to do so. */ | |
4161 | if (command_line.version_exports_section) | |
4162 | lang_do_version_exports_section (); | |
4163 | ||
4164 | /* Build all sets based on the information gathered from the input | |
4165 | files. */ | |
4166 | ldctor_build_sets (); | |
4167 | ||
4168 | /* Remove unreferenced sections if asked to. */ | |
4169 | if (command_line.gc_sections) | |
4170 | lang_gc_sections (); | |
4171 | ||
8550eb6e JJ |
4172 | /* If there were any SEC_MERGE sections, finish their merging, so that |
4173 | section sizes can be computed. This has to be done after GC of sections, | |
4174 | so that GCed sections are not merged, but before assigning output | |
4175 | sections, since removing whole input sections is hard then. */ | |
4176 | bfd_merge_sections (output_bfd, &link_info); | |
4177 | ||
08da4cac | 4178 | /* Size up the common data. */ |
252b5132 RH |
4179 | lang_common (); |
4180 | ||
4181 | /* Run through the contours of the script and attach input sections | |
08da4cac | 4182 | to the correct output sections. */ |
1579bae1 | 4183 | map_input_to_output_sections (statement_list.head, NULL, NULL); |
252b5132 | 4184 | |
08da4cac | 4185 | /* Find any sections not attached explicitly and handle them. */ |
252b5132 RH |
4186 | lang_place_orphans (); |
4187 | ||
1049f94e | 4188 | if (! link_info.relocatable) |
862120bd AM |
4189 | { |
4190 | /* Look for a text section and set the readonly attribute in it. */ | |
4191 | asection *found = bfd_get_section_by_name (output_bfd, ".text"); | |
4192 | ||
1579bae1 | 4193 | if (found != NULL) |
862120bd AM |
4194 | { |
4195 | if (config.text_read_only) | |
4196 | found->flags |= SEC_READONLY; | |
4197 | else | |
4198 | found->flags &= ~SEC_READONLY; | |
4199 | } | |
4200 | } | |
4201 | ||
4202 | /* Do anything special before sizing sections. This is where ELF | |
4203 | and other back-ends size dynamic sections. */ | |
252b5132 RH |
4204 | ldemul_before_allocation (); |
4205 | ||
1049f94e | 4206 | if (!link_info.relocatable) |
4bd5a393 AM |
4207 | strip_excluded_output_sections (); |
4208 | ||
252b5132 RH |
4209 | /* We must record the program headers before we try to fix the |
4210 | section positions, since they will affect SIZEOF_HEADERS. */ | |
4211 | lang_record_phdrs (); | |
4212 | ||
b3327aad | 4213 | /* Size up the sections. */ |
1579bae1 AM |
4214 | lang_size_sections (statement_list.head, abs_output_section, |
4215 | &statement_list.head, 0, 0, NULL, | |
cf888e70 | 4216 | command_line.relax ? FALSE : TRUE); |
b3327aad | 4217 | |
08da4cac | 4218 | /* Now run around and relax if we can. */ |
252b5132 RH |
4219 | if (command_line.relax) |
4220 | { | |
252b5132 | 4221 | /* Keep relaxing until bfd_relax_section gives up. */ |
b34976b6 | 4222 | bfd_boolean relax_again; |
b3327aad | 4223 | |
252b5132 RH |
4224 | do |
4225 | { | |
e3dc8847 | 4226 | lang_reset_memory_regions (); |
252b5132 | 4227 | |
b34976b6 | 4228 | relax_again = FALSE; |
252b5132 RH |
4229 | |
4230 | /* Note: pe-dll.c does something like this also. If you find | |
4231 | you need to change this code, you probably need to change | |
08da4cac | 4232 | pe-dll.c also. DJ */ |
252b5132 RH |
4233 | |
4234 | /* Do all the assignments with our current guesses as to | |
4235 | section sizes. */ | |
1579bae1 AM |
4236 | lang_do_assignments (statement_list.head, abs_output_section, |
4237 | NULL, 0); | |
252b5132 RH |
4238 | |
4239 | /* Perform another relax pass - this time we know where the | |
0d6d936f | 4240 | globals are, so can make a better guess. */ |
1579bae1 AM |
4241 | lang_size_sections (statement_list.head, abs_output_section, |
4242 | &statement_list.head, 0, 0, &relax_again, FALSE); | |
c7996ad6 L |
4243 | |
4244 | /* If the normal relax is done and the relax finalize pass | |
4245 | is not performed yet, we perform another relax pass. */ | |
4246 | if (!relax_again && !link_info.relax_finalizing) | |
4247 | { | |
4248 | link_info.relax_finalizing = TRUE; | |
4249 | relax_again = TRUE; | |
4250 | } | |
252b5132 RH |
4251 | } |
4252 | while (relax_again); | |
cf888e70 NC |
4253 | |
4254 | /* Final extra sizing to report errors. */ | |
4255 | lang_reset_memory_regions (); | |
1579bae1 AM |
4256 | lang_do_assignments (statement_list.head, abs_output_section, NULL, 0); |
4257 | lang_size_sections (statement_list.head, abs_output_section, | |
4258 | &statement_list.head, 0, 0, NULL, TRUE); | |
252b5132 | 4259 | } |
252b5132 RH |
4260 | |
4261 | /* See if anything special should be done now we know how big | |
4262 | everything is. */ | |
4263 | ldemul_after_allocation (); | |
4264 | ||
4265 | /* Fix any .startof. or .sizeof. symbols. */ | |
4266 | lang_set_startof (); | |
4267 | ||
08da4cac KH |
4268 | /* Do all the assignments, now that we know the final resting places |
4269 | of all the symbols. */ | |
252b5132 | 4270 | |
1579bae1 | 4271 | lang_do_assignments (statement_list.head, abs_output_section, NULL, 0); |
252b5132 RH |
4272 | |
4273 | /* Make sure that the section addresses make sense. */ | |
1049f94e | 4274 | if (! link_info.relocatable |
252b5132 RH |
4275 | && command_line.check_section_addresses) |
4276 | lang_check_section_addresses (); | |
5f992e62 | 4277 | |
08da4cac | 4278 | /* Final stuffs. */ |
252b5132 RH |
4279 | |
4280 | ldemul_finish (); | |
4281 | lang_finish (); | |
4282 | } | |
4283 | ||
4284 | /* EXPORTED TO YACC */ | |
4285 | ||
4286 | void | |
1579bae1 AM |
4287 | lang_add_wild (struct wildcard_spec *filespec, |
4288 | struct wildcard_list *section_list, | |
4289 | bfd_boolean keep_sections) | |
252b5132 | 4290 | { |
b6bf44ba AM |
4291 | struct wildcard_list *curr, *next; |
4292 | lang_wild_statement_type *new; | |
4293 | ||
4294 | /* Reverse the list as the parser puts it back to front. */ | |
4295 | for (curr = section_list, section_list = NULL; | |
4296 | curr != NULL; | |
4297 | section_list = curr, curr = next) | |
4298 | { | |
4299 | if (curr->spec.name != NULL && strcmp (curr->spec.name, "COMMON") == 0) | |
b34976b6 | 4300 | placed_commons = TRUE; |
252b5132 | 4301 | |
b6bf44ba AM |
4302 | next = curr->next; |
4303 | curr->next = section_list; | |
4304 | } | |
4305 | ||
4306 | if (filespec != NULL && filespec->name != NULL) | |
252b5132 | 4307 | { |
b6bf44ba AM |
4308 | if (strcmp (filespec->name, "*") == 0) |
4309 | filespec->name = NULL; | |
4310 | else if (! wildcardp (filespec->name)) | |
b34976b6 | 4311 | lang_has_input_file = TRUE; |
252b5132 | 4312 | } |
b6bf44ba AM |
4313 | |
4314 | new = new_stat (lang_wild_statement, stat_ptr); | |
4315 | new->filename = NULL; | |
b34976b6 | 4316 | new->filenames_sorted = FALSE; |
b6bf44ba | 4317 | if (filespec != NULL) |
252b5132 | 4318 | { |
b6bf44ba AM |
4319 | new->filename = filespec->name; |
4320 | new->filenames_sorted = filespec->sorted; | |
252b5132 | 4321 | } |
b6bf44ba | 4322 | new->section_list = section_list; |
252b5132 | 4323 | new->keep_sections = keep_sections; |
252b5132 RH |
4324 | lang_list_init (&new->children); |
4325 | } | |
4326 | ||
4327 | void | |
1579bae1 | 4328 | lang_section_start (const char *name, etree_type *address) |
252b5132 | 4329 | { |
d1778b88 | 4330 | lang_address_statement_type *ad; |
252b5132 | 4331 | |
d1778b88 | 4332 | ad = new_stat (lang_address_statement, stat_ptr); |
252b5132 RH |
4333 | ad->section_name = name; |
4334 | ad->address = address; | |
4335 | } | |
4336 | ||
4337 | /* Set the start symbol to NAME. CMDLINE is nonzero if this is called | |
4338 | because of a -e argument on the command line, or zero if this is | |
4339 | called by ENTRY in a linker script. Command line arguments take | |
4340 | precedence. */ | |
4341 | ||
4342 | void | |
1579bae1 | 4343 | lang_add_entry (const char *name, bfd_boolean cmdline) |
252b5132 | 4344 | { |
e3e942e9 | 4345 | if (entry_symbol.name == NULL |
252b5132 RH |
4346 | || cmdline |
4347 | || ! entry_from_cmdline) | |
4348 | { | |
e3e942e9 | 4349 | entry_symbol.name = name; |
252b5132 RH |
4350 | entry_from_cmdline = cmdline; |
4351 | } | |
4352 | } | |
4353 | ||
4354 | void | |
1579bae1 | 4355 | lang_add_target (const char *name) |
252b5132 RH |
4356 | { |
4357 | lang_target_statement_type *new = new_stat (lang_target_statement, | |
4358 | stat_ptr); | |
4359 | ||
4360 | new->target = name; | |
4361 | ||
4362 | } | |
4363 | ||
4364 | void | |
1579bae1 | 4365 | lang_add_map (const char *name) |
252b5132 RH |
4366 | { |
4367 | while (*name) | |
4368 | { | |
4369 | switch (*name) | |
4370 | { | |
08da4cac | 4371 | case 'F': |
b34976b6 | 4372 | map_option_f = TRUE; |
252b5132 RH |
4373 | break; |
4374 | } | |
4375 | name++; | |
4376 | } | |
4377 | } | |
4378 | ||
4379 | void | |
1579bae1 | 4380 | lang_add_fill (fill_type *fill) |
252b5132 RH |
4381 | { |
4382 | lang_fill_statement_type *new = new_stat (lang_fill_statement, | |
4383 | stat_ptr); | |
4384 | ||
2c382fb6 | 4385 | new->fill = fill; |
252b5132 RH |
4386 | } |
4387 | ||
4388 | void | |
1579bae1 | 4389 | lang_add_data (int type, union etree_union *exp) |
252b5132 RH |
4390 | { |
4391 | ||
4392 | lang_data_statement_type *new = new_stat (lang_data_statement, | |
4393 | stat_ptr); | |
4394 | ||
4395 | new->exp = exp; | |
4396 | new->type = type; | |
4397 | ||
4398 | } | |
4399 | ||
4400 | /* Create a new reloc statement. RELOC is the BFD relocation type to | |
4401 | generate. HOWTO is the corresponding howto structure (we could | |
4402 | look this up, but the caller has already done so). SECTION is the | |
4403 | section to generate a reloc against, or NAME is the name of the | |
4404 | symbol to generate a reloc against. Exactly one of SECTION and | |
4405 | NAME must be NULL. ADDEND is an expression for the addend. */ | |
4406 | ||
4407 | void | |
1579bae1 AM |
4408 | lang_add_reloc (bfd_reloc_code_real_type reloc, |
4409 | reloc_howto_type *howto, | |
4410 | asection *section, | |
4411 | const char *name, | |
4412 | union etree_union *addend) | |
252b5132 RH |
4413 | { |
4414 | lang_reloc_statement_type *p = new_stat (lang_reloc_statement, stat_ptr); | |
5f992e62 | 4415 | |
252b5132 RH |
4416 | p->reloc = reloc; |
4417 | p->howto = howto; | |
4418 | p->section = section; | |
4419 | p->name = name; | |
4420 | p->addend_exp = addend; | |
4421 | ||
4422 | p->addend_value = 0; | |
4423 | p->output_section = NULL; | |
4424 | p->output_vma = 0; | |
4425 | } | |
4426 | ||
4427 | lang_assignment_statement_type * | |
1579bae1 | 4428 | lang_add_assignment (etree_type *exp) |
252b5132 RH |
4429 | { |
4430 | lang_assignment_statement_type *new = new_stat (lang_assignment_statement, | |
4431 | stat_ptr); | |
4432 | ||
4433 | new->exp = exp; | |
4434 | return new; | |
4435 | } | |
4436 | ||
4437 | void | |
1579bae1 | 4438 | lang_add_attribute (enum statement_enum attribute) |
252b5132 RH |
4439 | { |
4440 | new_statement (attribute, sizeof (lang_statement_union_type), stat_ptr); | |
4441 | } | |
4442 | ||
4443 | void | |
1579bae1 | 4444 | lang_startup (const char *name) |
252b5132 | 4445 | { |
1579bae1 | 4446 | if (startup_file != NULL) |
252b5132 RH |
4447 | { |
4448 | einfo (_("%P%Fmultiple STARTUP files\n")); | |
4449 | } | |
4450 | first_file->filename = name; | |
4451 | first_file->local_sym_name = name; | |
b34976b6 | 4452 | first_file->real = TRUE; |
252b5132 RH |
4453 | |
4454 | startup_file = name; | |
4455 | } | |
4456 | ||
4457 | void | |
1579bae1 | 4458 | lang_float (bfd_boolean maybe) |
252b5132 RH |
4459 | { |
4460 | lang_float_flag = maybe; | |
4461 | } | |
4462 | ||
ee3cc2e2 RS |
4463 | |
4464 | /* Work out the load- and run-time regions from a script statement, and | |
4465 | store them in *LMA_REGION and *REGION respectively. | |
4466 | ||
4467 | MEMSPEC is the name of the run-time region, or "*default*" if the | |
4468 | statement didn't specify one. LMA_MEMSPEC is the name of the | |
4469 | load-time region, or null if the statement didn't specify one. | |
b34976b6 | 4470 | HAVE_LMA_P is TRUE if the statement had an explicit load address. |
ee3cc2e2 RS |
4471 | |
4472 | It is an error to specify both a load region and a load address. */ | |
4473 | ||
4474 | static void | |
1579bae1 AM |
4475 | lang_get_regions (struct memory_region_struct **region, |
4476 | struct memory_region_struct **lma_region, | |
4477 | const char *memspec, | |
4478 | const char *lma_memspec, | |
4479 | int have_lma_p) | |
ee3cc2e2 RS |
4480 | { |
4481 | *lma_region = lang_memory_region_lookup (lma_memspec); | |
4482 | ||
4483 | /* If no runtime region has been given, but the load region has | |
4484 | been, use the load region. */ | |
4485 | if (lma_memspec != 0 && strcmp (memspec, "*default*") == 0) | |
4486 | *region = *lma_region; | |
4487 | else | |
4488 | *region = lang_memory_region_lookup (memspec); | |
4489 | ||
4490 | if (have_lma_p && lma_memspec != 0) | |
4491 | einfo (_("%X%P:%S: section has both a load address and a load region\n")); | |
4492 | } | |
4493 | ||
252b5132 | 4494 | void |
1579bae1 AM |
4495 | lang_leave_output_section_statement |
4496 | (fill_type *fill, const char *memspec, | |
4497 | struct lang_output_section_phdr_list *phdrs, const char *lma_memspec) | |
252b5132 | 4498 | { |
ee3cc2e2 RS |
4499 | lang_get_regions (¤t_section->region, |
4500 | ¤t_section->lma_region, | |
4501 | memspec, lma_memspec, | |
4502 | current_section->load_base != 0); | |
252b5132 | 4503 | current_section->fill = fill; |
252b5132 RH |
4504 | current_section->phdrs = phdrs; |
4505 | stat_ptr = &statement_list; | |
4506 | } | |
4507 | ||
08da4cac KH |
4508 | /* Create an absolute symbol with the given name with the value of the |
4509 | address of first byte of the section named. | |
4510 | ||
4511 | If the symbol already exists, then do nothing. */ | |
252b5132 | 4512 | |
252b5132 | 4513 | void |
1579bae1 | 4514 | lang_abs_symbol_at_beginning_of (const char *secname, const char *name) |
252b5132 RH |
4515 | { |
4516 | struct bfd_link_hash_entry *h; | |
4517 | ||
b34976b6 | 4518 | h = bfd_link_hash_lookup (link_info.hash, name, TRUE, TRUE, TRUE); |
1579bae1 | 4519 | if (h == NULL) |
252b5132 RH |
4520 | einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n")); |
4521 | ||
4522 | if (h->type == bfd_link_hash_new | |
4523 | || h->type == bfd_link_hash_undefined) | |
4524 | { | |
4525 | asection *sec; | |
4526 | ||
4527 | h->type = bfd_link_hash_defined; | |
4528 | ||
4529 | sec = bfd_get_section_by_name (output_bfd, secname); | |
1579bae1 | 4530 | if (sec == NULL) |
252b5132 RH |
4531 | h->u.def.value = 0; |
4532 | else | |
4533 | h->u.def.value = bfd_get_section_vma (output_bfd, sec); | |
4534 | ||
4535 | h->u.def.section = bfd_abs_section_ptr; | |
4536 | } | |
4537 | } | |
4538 | ||
08da4cac KH |
4539 | /* Create an absolute symbol with the given name with the value of the |
4540 | address of the first byte after the end of the section named. | |
4541 | ||
4542 | If the symbol already exists, then do nothing. */ | |
252b5132 | 4543 | |
252b5132 | 4544 | void |
1579bae1 | 4545 | lang_abs_symbol_at_end_of (const char *secname, const char *name) |
252b5132 RH |
4546 | { |
4547 | struct bfd_link_hash_entry *h; | |
4548 | ||
b34976b6 | 4549 | h = bfd_link_hash_lookup (link_info.hash, name, TRUE, TRUE, TRUE); |
1579bae1 | 4550 | if (h == NULL) |
252b5132 RH |
4551 | einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n")); |
4552 | ||
4553 | if (h->type == bfd_link_hash_new | |
4554 | || h->type == bfd_link_hash_undefined) | |
4555 | { | |
4556 | asection *sec; | |
4557 | ||
4558 | h->type = bfd_link_hash_defined; | |
4559 | ||
4560 | sec = bfd_get_section_by_name (output_bfd, secname); | |
1579bae1 | 4561 | if (sec == NULL) |
252b5132 RH |
4562 | h->u.def.value = 0; |
4563 | else | |
4564 | h->u.def.value = (bfd_get_section_vma (output_bfd, sec) | |
4cbfc3ac TW |
4565 | + bfd_section_size (output_bfd, sec) / |
4566 | bfd_octets_per_byte (output_bfd)); | |
252b5132 RH |
4567 | |
4568 | h->u.def.section = bfd_abs_section_ptr; | |
4569 | } | |
4570 | } | |
4571 | ||
4572 | void | |
1579bae1 AM |
4573 | lang_statement_append (lang_statement_list_type *list, |
4574 | lang_statement_union_type *element, | |
4575 | lang_statement_union_type **field) | |
252b5132 RH |
4576 | { |
4577 | *(list->tail) = element; | |
4578 | list->tail = field; | |
4579 | } | |
4580 | ||
4581 | /* Set the output format type. -oformat overrides scripts. */ | |
4582 | ||
4583 | void | |
1579bae1 AM |
4584 | lang_add_output_format (const char *format, |
4585 | const char *big, | |
4586 | const char *little, | |
4587 | int from_script) | |
252b5132 RH |
4588 | { |
4589 | if (output_target == NULL || !from_script) | |
4590 | { | |
4591 | if (command_line.endian == ENDIAN_BIG | |
4592 | && big != NULL) | |
4593 | format = big; | |
4594 | else if (command_line.endian == ENDIAN_LITTLE | |
4595 | && little != NULL) | |
4596 | format = little; | |
4597 | ||
4598 | output_target = format; | |
4599 | } | |
4600 | } | |
4601 | ||
4602 | /* Enter a group. This creates a new lang_group_statement, and sets | |
4603 | stat_ptr to build new statements within the group. */ | |
4604 | ||
4605 | void | |
1579bae1 | 4606 | lang_enter_group (void) |
252b5132 RH |
4607 | { |
4608 | lang_group_statement_type *g; | |
4609 | ||
4610 | g = new_stat (lang_group_statement, stat_ptr); | |
4611 | lang_list_init (&g->children); | |
4612 | stat_ptr = &g->children; | |
4613 | } | |
4614 | ||
4615 | /* Leave a group. This just resets stat_ptr to start writing to the | |
4616 | regular list of statements again. Note that this will not work if | |
4617 | groups can occur inside anything else which can adjust stat_ptr, | |
4618 | but currently they can't. */ | |
4619 | ||
4620 | void | |
1579bae1 | 4621 | lang_leave_group (void) |
252b5132 RH |
4622 | { |
4623 | stat_ptr = &statement_list; | |
4624 | } | |
4625 | ||
4626 | /* Add a new program header. This is called for each entry in a PHDRS | |
4627 | command in a linker script. */ | |
4628 | ||
4629 | void | |
1579bae1 AM |
4630 | lang_new_phdr (const char *name, |
4631 | etree_type *type, | |
4632 | bfd_boolean filehdr, | |
4633 | bfd_boolean phdrs, | |
4634 | etree_type *at, | |
4635 | etree_type *flags) | |
252b5132 RH |
4636 | { |
4637 | struct lang_phdr *n, **pp; | |
4638 | ||
1579bae1 | 4639 | n = stat_alloc (sizeof (struct lang_phdr)); |
252b5132 RH |
4640 | n->next = NULL; |
4641 | n->name = name; | |
4642 | n->type = exp_get_value_int (type, 0, "program header type", | |
4643 | lang_final_phase_enum); | |
4644 | n->filehdr = filehdr; | |
4645 | n->phdrs = phdrs; | |
4646 | n->at = at; | |
4647 | n->flags = flags; | |
4648 | ||
4649 | for (pp = &lang_phdr_list; *pp != NULL; pp = &(*pp)->next) | |
4650 | ; | |
4651 | *pp = n; | |
4652 | } | |
4653 | ||
4654 | /* Record the program header information in the output BFD. FIXME: We | |
4655 | should not be calling an ELF specific function here. */ | |
4656 | ||
4657 | static void | |
1579bae1 | 4658 | lang_record_phdrs (void) |
252b5132 RH |
4659 | { |
4660 | unsigned int alc; | |
4661 | asection **secs; | |
4662 | struct lang_output_section_phdr_list *last; | |
4663 | struct lang_phdr *l; | |
4664 | lang_statement_union_type *u; | |
4665 | ||
4666 | alc = 10; | |
1579bae1 | 4667 | secs = xmalloc (alc * sizeof (asection *)); |
252b5132 RH |
4668 | last = NULL; |
4669 | for (l = lang_phdr_list; l != NULL; l = l->next) | |
4670 | { | |
4671 | unsigned int c; | |
4672 | flagword flags; | |
4673 | bfd_vma at; | |
4674 | ||
4675 | c = 0; | |
4676 | for (u = lang_output_section_statement.head; | |
4677 | u != NULL; | |
4678 | u = u->output_section_statement.next) | |
4679 | { | |
4680 | lang_output_section_statement_type *os; | |
4681 | struct lang_output_section_phdr_list *pl; | |
4682 | ||
4683 | os = &u->output_section_statement; | |
4684 | ||
4685 | pl = os->phdrs; | |
4686 | if (pl != NULL) | |
4687 | last = pl; | |
4688 | else | |
4689 | { | |
4690 | if (os->sectype == noload_section | |
4691 | || os->bfd_section == NULL | |
4692 | || (os->bfd_section->flags & SEC_ALLOC) == 0) | |
4693 | continue; | |
4694 | pl = last; | |
4695 | } | |
4696 | ||
4697 | if (os->bfd_section == NULL) | |
4698 | continue; | |
4699 | ||
4700 | for (; pl != NULL; pl = pl->next) | |
4701 | { | |
4702 | if (strcmp (pl->name, l->name) == 0) | |
4703 | { | |
4704 | if (c >= alc) | |
4705 | { | |
4706 | alc *= 2; | |
1579bae1 | 4707 | secs = xrealloc (secs, alc * sizeof (asection *)); |
252b5132 RH |
4708 | } |
4709 | secs[c] = os->bfd_section; | |
4710 | ++c; | |
b34976b6 | 4711 | pl->used = TRUE; |
252b5132 RH |
4712 | } |
4713 | } | |
4714 | } | |
4715 | ||
4716 | if (l->flags == NULL) | |
4717 | flags = 0; | |
4718 | else | |
4719 | flags = exp_get_vma (l->flags, 0, "phdr flags", | |
4720 | lang_final_phase_enum); | |
4721 | ||
4722 | if (l->at == NULL) | |
4723 | at = 0; | |
4724 | else | |
4725 | at = exp_get_vma (l->at, 0, "phdr load address", | |
4726 | lang_final_phase_enum); | |
4727 | ||
4728 | if (! bfd_record_phdr (output_bfd, l->type, | |
d1778b88 | 4729 | l->flags != NULL, flags, l->at != NULL, |
252b5132 RH |
4730 | at, l->filehdr, l->phdrs, c, secs)) |
4731 | einfo (_("%F%P: bfd_record_phdr failed: %E\n")); | |
4732 | } | |
4733 | ||
4734 | free (secs); | |
4735 | ||
4736 | /* Make sure all the phdr assignments succeeded. */ | |
4737 | for (u = lang_output_section_statement.head; | |
4738 | u != NULL; | |
4739 | u = u->output_section_statement.next) | |
4740 | { | |
4741 | struct lang_output_section_phdr_list *pl; | |
4742 | ||
4743 | if (u->output_section_statement.bfd_section == NULL) | |
4744 | continue; | |
4745 | ||
4746 | for (pl = u->output_section_statement.phdrs; | |
4747 | pl != NULL; | |
4748 | pl = pl->next) | |
4749 | if (! pl->used && strcmp (pl->name, "NONE") != 0) | |
4750 | einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"), | |
4751 | u->output_section_statement.name, pl->name); | |
4752 | } | |
4753 | } | |
4754 | ||
4755 | /* Record a list of sections which may not be cross referenced. */ | |
4756 | ||
4757 | void | |
1579bae1 | 4758 | lang_add_nocrossref (struct lang_nocrossref *l) |
252b5132 RH |
4759 | { |
4760 | struct lang_nocrossrefs *n; | |
4761 | ||
1579bae1 | 4762 | n = xmalloc (sizeof *n); |
252b5132 RH |
4763 | n->next = nocrossref_list; |
4764 | n->list = l; | |
4765 | nocrossref_list = n; | |
4766 | ||
4767 | /* Set notice_all so that we get informed about all symbols. */ | |
b34976b6 | 4768 | link_info.notice_all = TRUE; |
252b5132 RH |
4769 | } |
4770 | \f | |
4771 | /* Overlay handling. We handle overlays with some static variables. */ | |
4772 | ||
4773 | /* The overlay virtual address. */ | |
4774 | static etree_type *overlay_vma; | |
7e7d5768 AM |
4775 | /* And subsection alignment. */ |
4776 | static etree_type *overlay_subalign; | |
252b5132 | 4777 | |
252b5132 RH |
4778 | /* An expression for the maximum section size seen so far. */ |
4779 | static etree_type *overlay_max; | |
4780 | ||
4781 | /* A list of all the sections in this overlay. */ | |
4782 | ||
89cdebba | 4783 | struct overlay_list { |
252b5132 RH |
4784 | struct overlay_list *next; |
4785 | lang_output_section_statement_type *os; | |
4786 | }; | |
4787 | ||
4788 | static struct overlay_list *overlay_list; | |
4789 | ||
4790 | /* Start handling an overlay. */ | |
4791 | ||
4792 | void | |
7e7d5768 | 4793 | lang_enter_overlay (etree_type *vma_expr, etree_type *subalign) |
252b5132 RH |
4794 | { |
4795 | /* The grammar should prevent nested overlays from occurring. */ | |
7e7d5768 AM |
4796 | ASSERT (overlay_vma == NULL |
4797 | && overlay_subalign == NULL | |
4798 | && overlay_max == NULL); | |
252b5132 RH |
4799 | |
4800 | overlay_vma = vma_expr; | |
7e7d5768 | 4801 | overlay_subalign = subalign; |
252b5132 RH |
4802 | } |
4803 | ||
4804 | /* Start a section in an overlay. We handle this by calling | |
9f88b410 RS |
4805 | lang_enter_output_section_statement with the correct VMA. |
4806 | lang_leave_overlay sets up the LMA and memory regions. */ | |
252b5132 RH |
4807 | |
4808 | void | |
1579bae1 | 4809 | lang_enter_overlay_section (const char *name) |
252b5132 RH |
4810 | { |
4811 | struct overlay_list *n; | |
4812 | etree_type *size; | |
4813 | ||
4814 | lang_enter_output_section_statement (name, overlay_vma, normal_section, | |
7e7d5768 | 4815 | 0, 0, overlay_subalign, 0); |
252b5132 | 4816 | |
9f88b410 | 4817 | /* If this is the first section, then base the VMA of future |
252b5132 RH |
4818 | sections on this one. This will work correctly even if `.' is |
4819 | used in the addresses. */ | |
4820 | if (overlay_list == NULL) | |
9f88b410 | 4821 | overlay_vma = exp_nameop (ADDR, name); |
252b5132 RH |
4822 | |
4823 | /* Remember the section. */ | |
1579bae1 | 4824 | n = xmalloc (sizeof *n); |
252b5132 RH |
4825 | n->os = current_section; |
4826 | n->next = overlay_list; | |
4827 | overlay_list = n; | |
4828 | ||
4829 | size = exp_nameop (SIZEOF, name); | |
4830 | ||
252b5132 RH |
4831 | /* Arrange to work out the maximum section end address. */ |
4832 | if (overlay_max == NULL) | |
4833 | overlay_max = size; | |
4834 | else | |
4835 | overlay_max = exp_binop (MAX_K, overlay_max, size); | |
4836 | } | |
4837 | ||
4838 | /* Finish a section in an overlay. There isn't any special to do | |
4839 | here. */ | |
4840 | ||
4841 | void | |
1579bae1 AM |
4842 | lang_leave_overlay_section (fill_type *fill, |
4843 | struct lang_output_section_phdr_list *phdrs) | |
252b5132 RH |
4844 | { |
4845 | const char *name; | |
4846 | char *clean, *s2; | |
4847 | const char *s1; | |
4848 | char *buf; | |
4849 | ||
4850 | name = current_section->name; | |
4851 | ||
9f88b410 RS |
4852 | /* For now, assume that "*default*" is the run-time memory region and |
4853 | that no load-time region has been specified. It doesn't really | |
4854 | matter what we say here, since lang_leave_overlay will override it. */ | |
4855 | lang_leave_output_section_statement (fill, "*default*", phdrs, 0); | |
252b5132 RH |
4856 | |
4857 | /* Define the magic symbols. */ | |
4858 | ||
4859 | clean = xmalloc (strlen (name) + 1); | |
4860 | s2 = clean; | |
4861 | for (s1 = name; *s1 != '\0'; s1++) | |
3882b010 | 4862 | if (ISALNUM (*s1) || *s1 == '_') |
252b5132 RH |
4863 | *s2++ = *s1; |
4864 | *s2 = '\0'; | |
4865 | ||
4866 | buf = xmalloc (strlen (clean) + sizeof "__load_start_"); | |
4867 | sprintf (buf, "__load_start_%s", clean); | |
4868 | lang_add_assignment (exp_assop ('=', buf, | |
4869 | exp_nameop (LOADADDR, name))); | |
4870 | ||
4871 | buf = xmalloc (strlen (clean) + sizeof "__load_stop_"); | |
4872 | sprintf (buf, "__load_stop_%s", clean); | |
4873 | lang_add_assignment (exp_assop ('=', buf, | |
4874 | exp_binop ('+', | |
4875 | exp_nameop (LOADADDR, name), | |
4876 | exp_nameop (SIZEOF, name)))); | |
4877 | ||
4878 | free (clean); | |
4879 | } | |
4880 | ||
4881 | /* Finish an overlay. If there are any overlay wide settings, this | |
4882 | looks through all the sections in the overlay and sets them. */ | |
4883 | ||
4884 | void | |
1579bae1 AM |
4885 | lang_leave_overlay (etree_type *lma_expr, |
4886 | int nocrossrefs, | |
4887 | fill_type *fill, | |
4888 | const char *memspec, | |
4889 | struct lang_output_section_phdr_list *phdrs, | |
4890 | const char *lma_memspec) | |
252b5132 RH |
4891 | { |
4892 | lang_memory_region_type *region; | |
562d3460 | 4893 | lang_memory_region_type *lma_region; |
252b5132 RH |
4894 | struct overlay_list *l; |
4895 | struct lang_nocrossref *nocrossref; | |
4896 | ||
ee3cc2e2 RS |
4897 | lang_get_regions (®ion, &lma_region, |
4898 | memspec, lma_memspec, | |
4899 | lma_expr != 0); | |
562d3460 | 4900 | |
252b5132 RH |
4901 | nocrossref = NULL; |
4902 | ||
9f88b410 RS |
4903 | /* After setting the size of the last section, set '.' to end of the |
4904 | overlay region. */ | |
4905 | if (overlay_list != NULL) | |
4906 | overlay_list->os->update_dot_tree | |
4907 | = exp_assop ('=', ".", exp_binop ('+', overlay_vma, overlay_max)); | |
4908 | ||
252b5132 RH |
4909 | l = overlay_list; |
4910 | while (l != NULL) | |
4911 | { | |
4912 | struct overlay_list *next; | |
4913 | ||
1579bae1 | 4914 | if (fill != NULL && l->os->fill == NULL) |
252b5132 | 4915 | l->os->fill = fill; |
1545243b | 4916 | |
9f88b410 RS |
4917 | l->os->region = region; |
4918 | l->os->lma_region = lma_region; | |
4919 | ||
4920 | /* The first section has the load address specified in the | |
4921 | OVERLAY statement. The rest are worked out from that. | |
4922 | The base address is not needed (and should be null) if | |
4923 | an LMA region was specified. */ | |
4924 | if (l->next == 0) | |
4925 | l->os->load_base = lma_expr; | |
4926 | else if (lma_region == 0) | |
4927 | l->os->load_base = exp_binop ('+', | |
4928 | exp_nameop (LOADADDR, l->next->os->name), | |
4929 | exp_nameop (SIZEOF, l->next->os->name)); | |
1545243b | 4930 | |
252b5132 RH |
4931 | if (phdrs != NULL && l->os->phdrs == NULL) |
4932 | l->os->phdrs = phdrs; | |
4933 | ||
9f88b410 | 4934 | if (nocrossrefs) |
252b5132 RH |
4935 | { |
4936 | struct lang_nocrossref *nc; | |
4937 | ||
1579bae1 | 4938 | nc = xmalloc (sizeof *nc); |
252b5132 RH |
4939 | nc->name = l->os->name; |
4940 | nc->next = nocrossref; | |
4941 | nocrossref = nc; | |
4942 | } | |
4943 | ||
4944 | next = l->next; | |
4945 | free (l); | |
4946 | l = next; | |
4947 | } | |
4948 | ||
4949 | if (nocrossref != NULL) | |
4950 | lang_add_nocrossref (nocrossref); | |
4951 | ||
252b5132 | 4952 | overlay_vma = NULL; |
252b5132 RH |
4953 | overlay_list = NULL; |
4954 | overlay_max = NULL; | |
4955 | } | |
4956 | \f | |
4957 | /* Version handling. This is only useful for ELF. */ | |
4958 | ||
4959 | /* This global variable holds the version tree that we build. */ | |
4960 | ||
4961 | struct bfd_elf_version_tree *lang_elf_version_info; | |
4962 | ||
4963 | static int | |
1579bae1 AM |
4964 | lang_vers_match_lang_c (struct bfd_elf_version_expr *expr, |
4965 | const char *sym) | |
252b5132 RH |
4966 | { |
4967 | if (expr->pattern[0] == '*' && expr->pattern[1] == '\0') | |
4968 | return 1; | |
4969 | return fnmatch (expr->pattern, sym, 0) == 0; | |
4970 | } | |
4971 | ||
4972 | static int | |
1579bae1 AM |
4973 | lang_vers_match_lang_cplusplus (struct bfd_elf_version_expr *expr, |
4974 | const char *sym) | |
252b5132 RH |
4975 | { |
4976 | char *alt_sym; | |
4977 | int result; | |
4978 | ||
4979 | if (expr->pattern[0] == '*' && expr->pattern[1] == '\0') | |
4980 | return 1; | |
4981 | ||
08da4cac | 4982 | alt_sym = cplus_demangle (sym, /* DMGL_NO_TPARAMS */ 0); |
252b5132 RH |
4983 | if (!alt_sym) |
4984 | { | |
4985 | /* cplus_demangle (also) returns NULL when it is not a C++ symbol. | |
b34976b6 | 4986 | Should we early out FALSE in this case? */ |
252b5132 RH |
4987 | result = fnmatch (expr->pattern, sym, 0) == 0; |
4988 | } | |
4989 | else | |
4990 | { | |
4991 | result = fnmatch (expr->pattern, alt_sym, 0) == 0; | |
4992 | free (alt_sym); | |
4993 | } | |
4994 | ||
4995 | return result; | |
4996 | } | |
4997 | ||
4998 | static int | |
1579bae1 AM |
4999 | lang_vers_match_lang_java (struct bfd_elf_version_expr *expr, |
5000 | const char *sym) | |
252b5132 RH |
5001 | { |
5002 | char *alt_sym; | |
5003 | int result; | |
5004 | ||
5005 | if (expr->pattern[0] == '*' && expr->pattern[1] == '\0') | |
5006 | return 1; | |
5007 | ||
08da4cac | 5008 | alt_sym = cplus_demangle (sym, DMGL_JAVA); |
252b5132 RH |
5009 | if (!alt_sym) |
5010 | { | |
5011 | /* cplus_demangle (also) returns NULL when it is not a Java symbol. | |
b34976b6 | 5012 | Should we early out FALSE in this case? */ |
252b5132 RH |
5013 | result = fnmatch (expr->pattern, sym, 0) == 0; |
5014 | } | |
5015 | else | |
5016 | { | |
5017 | result = fnmatch (expr->pattern, alt_sym, 0) == 0; | |
5018 | free (alt_sym); | |
5019 | } | |
5020 | ||
5021 | return result; | |
5022 | } | |
5023 | ||
5024 | /* This is called for each variable name or match expression. */ | |
5025 | ||
5026 | struct bfd_elf_version_expr * | |
1579bae1 AM |
5027 | lang_new_vers_pattern (struct bfd_elf_version_expr *orig, |
5028 | const char *new, | |
5029 | const char *lang) | |
252b5132 RH |
5030 | { |
5031 | struct bfd_elf_version_expr *ret; | |
5032 | ||
1579bae1 | 5033 | ret = xmalloc (sizeof *ret); |
252b5132 RH |
5034 | ret->next = orig; |
5035 | ret->pattern = new; | |
31941635 L |
5036 | ret->symver = 0; |
5037 | ret->script = 0; | |
252b5132 RH |
5038 | |
5039 | if (lang == NULL || strcasecmp (lang, "C") == 0) | |
5040 | ret->match = lang_vers_match_lang_c; | |
5041 | else if (strcasecmp (lang, "C++") == 0) | |
5042 | ret->match = lang_vers_match_lang_cplusplus; | |
5043 | else if (strcasecmp (lang, "Java") == 0) | |
5044 | ret->match = lang_vers_match_lang_java; | |
5045 | else | |
5046 | { | |
5047 | einfo (_("%X%P: unknown language `%s' in version information\n"), | |
5048 | lang); | |
5049 | ret->match = lang_vers_match_lang_c; | |
5050 | } | |
5051 | ||
fac1652d | 5052 | return ldemul_new_vers_pattern (ret); |
252b5132 RH |
5053 | } |
5054 | ||
5055 | /* This is called for each set of variable names and match | |
5056 | expressions. */ | |
5057 | ||
5058 | struct bfd_elf_version_tree * | |
1579bae1 AM |
5059 | lang_new_vers_node (struct bfd_elf_version_expr *globals, |
5060 | struct bfd_elf_version_expr *locals) | |
252b5132 RH |
5061 | { |
5062 | struct bfd_elf_version_tree *ret; | |
5063 | ||
1579bae1 | 5064 | ret = xmalloc (sizeof *ret); |
252b5132 RH |
5065 | ret->next = NULL; |
5066 | ret->name = NULL; | |
5067 | ret->vernum = 0; | |
5068 | ret->globals = globals; | |
5069 | ret->locals = locals; | |
5070 | ret->deps = NULL; | |
5071 | ret->name_indx = (unsigned int) -1; | |
5072 | ret->used = 0; | |
5073 | return ret; | |
5074 | } | |
5075 | ||
5076 | /* This static variable keeps track of version indices. */ | |
5077 | ||
5078 | static int version_index; | |
5079 | ||
5080 | /* This is called when we know the name and dependencies of the | |
5081 | version. */ | |
5082 | ||
5083 | void | |
1579bae1 AM |
5084 | lang_register_vers_node (const char *name, |
5085 | struct bfd_elf_version_tree *version, | |
5086 | struct bfd_elf_version_deps *deps) | |
252b5132 RH |
5087 | { |
5088 | struct bfd_elf_version_tree *t, **pp; | |
5089 | struct bfd_elf_version_expr *e1; | |
5090 | ||
6b9b879a JJ |
5091 | if (name == NULL) |
5092 | name = ""; | |
5093 | ||
5094 | if ((name[0] == '\0' && lang_elf_version_info != NULL) | |
5095 | || (lang_elf_version_info && lang_elf_version_info->name[0] == '\0')) | |
5096 | { | |
5097 | einfo (_("%X%P: anonymous version tag cannot be combined with other version tags\n")); | |
5ed6aba4 | 5098 | free (version); |
6b9b879a JJ |
5099 | return; |
5100 | } | |
5101 | ||
252b5132 RH |
5102 | /* Make sure this node has a unique name. */ |
5103 | for (t = lang_elf_version_info; t != NULL; t = t->next) | |
5104 | if (strcmp (t->name, name) == 0) | |
5105 | einfo (_("%X%P: duplicate version tag `%s'\n"), name); | |
5106 | ||
5107 | /* Check the global and local match names, and make sure there | |
5108 | aren't any duplicates. */ | |
5109 | ||
5110 | for (e1 = version->globals; e1 != NULL; e1 = e1->next) | |
5111 | { | |
5112 | for (t = lang_elf_version_info; t != NULL; t = t->next) | |
5113 | { | |
5114 | struct bfd_elf_version_expr *e2; | |
5115 | ||
5116 | for (e2 = t->locals; e2 != NULL; e2 = e2->next) | |
5117 | if (strcmp (e1->pattern, e2->pattern) == 0) | |
5118 | einfo (_("%X%P: duplicate expression `%s' in version information\n"), | |
5119 | e1->pattern); | |
5120 | } | |
5121 | } | |
5122 | ||
5123 | for (e1 = version->locals; e1 != NULL; e1 = e1->next) | |
5124 | { | |
5125 | for (t = lang_elf_version_info; t != NULL; t = t->next) | |
5126 | { | |
5127 | struct bfd_elf_version_expr *e2; | |
5128 | ||
5129 | for (e2 = t->globals; e2 != NULL; e2 = e2->next) | |
5130 | if (strcmp (e1->pattern, e2->pattern) == 0) | |
5131 | einfo (_("%X%P: duplicate expression `%s' in version information\n"), | |
5132 | e1->pattern); | |
5133 | } | |
5134 | } | |
5135 | ||
5136 | version->deps = deps; | |
5137 | version->name = name; | |
6b9b879a JJ |
5138 | if (name[0] != '\0') |
5139 | { | |
5140 | ++version_index; | |
5141 | version->vernum = version_index; | |
5142 | } | |
5143 | else | |
5144 | version->vernum = 0; | |
252b5132 RH |
5145 | |
5146 | for (pp = &lang_elf_version_info; *pp != NULL; pp = &(*pp)->next) | |
5147 | ; | |
5148 | *pp = version; | |
5149 | } | |
5150 | ||
5151 | /* This is called when we see a version dependency. */ | |
5152 | ||
5153 | struct bfd_elf_version_deps * | |
1579bae1 | 5154 | lang_add_vers_depend (struct bfd_elf_version_deps *list, const char *name) |
252b5132 RH |
5155 | { |
5156 | struct bfd_elf_version_deps *ret; | |
5157 | struct bfd_elf_version_tree *t; | |
5158 | ||
1579bae1 | 5159 | ret = xmalloc (sizeof *ret); |
252b5132 RH |
5160 | ret->next = list; |
5161 | ||
5162 | for (t = lang_elf_version_info; t != NULL; t = t->next) | |
5163 | { | |
5164 | if (strcmp (t->name, name) == 0) | |
5165 | { | |
5166 | ret->version_needed = t; | |
5167 | return ret; | |
5168 | } | |
5169 | } | |
5170 | ||
5171 | einfo (_("%X%P: unable to find version dependency `%s'\n"), name); | |
5172 | ||
5173 | return ret; | |
5174 | } | |
5175 | ||
5176 | static void | |
1579bae1 | 5177 | lang_do_version_exports_section (void) |
252b5132 RH |
5178 | { |
5179 | struct bfd_elf_version_expr *greg = NULL, *lreg; | |
5180 | ||
5181 | LANG_FOR_EACH_INPUT_STATEMENT (is) | |
5182 | { | |
5183 | asection *sec = bfd_get_section_by_name (is->the_bfd, ".exports"); | |
5184 | char *contents, *p; | |
5185 | bfd_size_type len; | |
5186 | ||
5187 | if (sec == NULL) | |
b7a26f91 | 5188 | continue; |
252b5132 RH |
5189 | |
5190 | len = bfd_section_size (is->the_bfd, sec); | |
5191 | contents = xmalloc (len); | |
5192 | if (!bfd_get_section_contents (is->the_bfd, sec, contents, 0, len)) | |
6f9efd97 | 5193 | einfo (_("%X%P: unable to read .exports section contents\n"), sec); |
252b5132 RH |
5194 | |
5195 | p = contents; | |
89cdebba | 5196 | while (p < contents + len) |
252b5132 | 5197 | { |
313e35ee | 5198 | greg = lang_new_vers_pattern (greg, p, NULL); |
252b5132 RH |
5199 | p = strchr (p, '\0') + 1; |
5200 | } | |
5201 | ||
5202 | /* Do not free the contents, as we used them creating the regex. */ | |
5203 | ||
5204 | /* Do not include this section in the link. */ | |
5205 | bfd_set_section_flags (is->the_bfd, sec, | |
5206 | bfd_get_section_flags (is->the_bfd, sec) | SEC_EXCLUDE); | |
5207 | } | |
5208 | ||
313e35ee | 5209 | lreg = lang_new_vers_pattern (NULL, "*", NULL); |
252b5132 RH |
5210 | lang_register_vers_node (command_line.version_exports_section, |
5211 | lang_new_vers_node (greg, lreg), NULL); | |
5212 | } | |
577a0623 AM |
5213 | |
5214 | void | |
1579bae1 | 5215 | lang_add_unique (const char *name) |
577a0623 AM |
5216 | { |
5217 | struct unique_sections *ent; | |
5218 | ||
5219 | for (ent = unique_section_list; ent; ent = ent->next) | |
5220 | if (strcmp (ent->name, name) == 0) | |
5221 | return; | |
5222 | ||
1579bae1 | 5223 | ent = xmalloc (sizeof *ent); |
577a0623 AM |
5224 | ent->name = xstrdup (name); |
5225 | ent->next = unique_section_list; | |
5226 | unique_section_list = ent; | |
5227 | } |