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