1 /* Linker command language support.
2 Copyright (C) 1991-2016 Free Software Foundation, Inc.
4 This file is part of the GNU Binutils.
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 3 of the License, or
9 (at your option) any later version.
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program; if not, write to the Free Software
18 Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
19 MA 02110-1301, USA. */
23 #include "libiberty.h"
24 #include "filenames.h"
25 #include "safe-ctype.h"
45 #endif /* ENABLE_PLUGINS */
48 #define offsetof(TYPE, MEMBER) ((size_t) & (((TYPE*) 0)->MEMBER))
51 /* Convert between addresses in bytes and sizes in octets.
52 For currently supported targets, octets_per_byte is always a power
53 of two, so we can use shifts. */
54 #define TO_ADDR(X) ((X) >> opb_shift)
55 #define TO_SIZE(X) ((X) << opb_shift)
57 /* Local variables. */
58 static struct obstack stat_obstack;
59 static struct obstack map_obstack;
61 #define obstack_chunk_alloc xmalloc
62 #define obstack_chunk_free free
63 static const char *entry_symbol_default = "start";
64 static bfd_boolean placed_commons = FALSE;
65 static bfd_boolean map_head_is_link_order = FALSE;
66 static lang_output_section_statement_type *default_common_section;
67 static bfd_boolean map_option_f;
68 static bfd_vma print_dot;
69 static lang_input_statement_type *first_file;
70 static const char *current_target;
71 static lang_statement_list_type statement_list;
72 static lang_statement_list_type *stat_save[10];
73 static lang_statement_list_type **stat_save_ptr = &stat_save[0];
74 static struct unique_sections *unique_section_list;
75 static struct asneeded_minfo *asneeded_list_head;
76 static unsigned int opb_shift = 0;
78 /* Forward declarations. */
79 static void exp_init_os (etree_type *);
80 static lang_input_statement_type *lookup_name (const char *);
81 static void insert_undefined (const char *);
82 static bfd_boolean sort_def_symbol (struct bfd_link_hash_entry *, void *);
83 static void print_statement (lang_statement_union_type *,
84 lang_output_section_statement_type *);
85 static void print_statement_list (lang_statement_union_type *,
86 lang_output_section_statement_type *);
87 static void print_statements (void);
88 static void print_input_section (asection *, bfd_boolean);
89 static bfd_boolean lang_one_common (struct bfd_link_hash_entry *, void *);
90 static void lang_record_phdrs (void);
91 static void lang_do_version_exports_section (void);
92 static void lang_finalize_version_expr_head
93 (struct bfd_elf_version_expr_head *);
94 static void lang_do_memory_regions (void);
96 /* Exported variables. */
97 const char *output_target;
98 lang_output_section_statement_type *abs_output_section;
99 lang_statement_list_type lang_output_section_statement;
100 lang_statement_list_type *stat_ptr = &statement_list;
101 lang_statement_list_type file_chain = { NULL, NULL };
102 lang_statement_list_type input_file_chain;
103 struct bfd_sym_chain entry_symbol = { NULL, NULL };
104 const char *entry_section = ".text";
105 struct lang_input_statement_flags input_flags;
106 bfd_boolean entry_from_cmdline;
107 bfd_boolean undef_from_cmdline;
108 bfd_boolean lang_has_input_file = FALSE;
109 bfd_boolean had_output_filename = FALSE;
110 bfd_boolean lang_float_flag = FALSE;
111 bfd_boolean delete_output_file_on_failure = FALSE;
112 struct lang_phdr *lang_phdr_list;
113 struct lang_nocrossrefs *nocrossref_list;
114 struct asneeded_minfo **asneeded_list_tail;
116 /* Functions that traverse the linker script and might evaluate
117 DEFINED() need to increment this at the start of the traversal. */
118 int lang_statement_iteration = 0;
120 /* Return TRUE if the PATTERN argument is a wildcard pattern.
121 Although backslashes are treated specially if a pattern contains
122 wildcards, we do not consider the mere presence of a backslash to
123 be enough to cause the pattern to be treated as a wildcard.
124 That lets us handle DOS filenames more naturally. */
125 #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL)
127 #define new_stat(x, y) \
128 (x##_type *) new_statement (x##_enum, sizeof (x##_type), y)
130 #define outside_section_address(q) \
131 ((q)->output_offset + (q)->output_section->vma)
133 #define outside_symbol_address(q) \
134 ((q)->value + outside_section_address (q->section))
136 #define SECTION_NAME_MAP_LENGTH (16)
139 stat_alloc (size_t size)
141 return obstack_alloc (&stat_obstack, size);
145 name_match (const char *pattern, const char *name)
147 if (wildcardp (pattern))
148 return fnmatch (pattern, name, 0);
149 return strcmp (pattern, name);
152 /* If PATTERN is of the form archive:file, return a pointer to the
153 separator. If not, return NULL. */
156 archive_path (const char *pattern)
160 if (link_info.path_separator == 0)
163 p = strchr (pattern, link_info.path_separator);
164 #ifdef HAVE_DOS_BASED_FILE_SYSTEM
165 if (p == NULL || link_info.path_separator != ':')
168 /* Assume a match on the second char is part of drive specifier,
169 as in "c:\silly.dos". */
170 if (p == pattern + 1 && ISALPHA (*pattern))
171 p = strchr (p + 1, link_info.path_separator);
176 /* Given that FILE_SPEC results in a non-NULL SEP result from archive_path,
177 return whether F matches FILE_SPEC. */
180 input_statement_is_archive_path (const char *file_spec, char *sep,
181 lang_input_statement_type *f)
183 bfd_boolean match = FALSE;
186 || name_match (sep + 1, f->filename) == 0)
187 && ((sep != file_spec)
188 == (f->the_bfd != NULL && f->the_bfd->my_archive != NULL)))
192 if (sep != file_spec)
194 const char *aname = f->the_bfd->my_archive->filename;
196 match = name_match (file_spec, aname) == 0;
197 *sep = link_info.path_separator;
204 unique_section_p (const asection *sec,
205 const lang_output_section_statement_type *os)
207 struct unique_sections *unam;
210 if (bfd_link_relocatable (&link_info)
211 && sec->owner != NULL
212 && bfd_is_group_section (sec->owner, sec))
214 && strcmp (os->name, DISCARD_SECTION_NAME) == 0);
217 for (unam = unique_section_list; unam; unam = unam->next)
218 if (name_match (unam->name, secnam) == 0)
224 /* Generic traversal routines for finding matching sections. */
226 /* Return true if FILE matches a pattern in EXCLUDE_LIST, otherwise return
230 walk_wild_file_in_exclude_list (struct name_list *exclude_list,
231 lang_input_statement_type *file)
233 struct name_list *list_tmp;
235 for (list_tmp = exclude_list;
237 list_tmp = list_tmp->next)
239 char *p = archive_path (list_tmp->name);
243 if (input_statement_is_archive_path (list_tmp->name, p, file))
247 else if (name_match (list_tmp->name, file->filename) == 0)
250 /* FIXME: Perhaps remove the following at some stage? Matching
251 unadorned archives like this was never documented and has
252 been superceded by the archive:path syntax. */
253 else if (file->the_bfd != NULL
254 && file->the_bfd->my_archive != NULL
255 && name_match (list_tmp->name,
256 file->the_bfd->my_archive->filename) == 0)
263 /* Try processing a section against a wildcard. This just calls
264 the callback unless the filename exclusion list is present
265 and excludes the file. It's hardly ever present so this
266 function is very fast. */
269 walk_wild_consider_section (lang_wild_statement_type *ptr,
270 lang_input_statement_type *file,
272 struct wildcard_list *sec,
276 /* Don't process sections from files which were excluded. */
277 if (walk_wild_file_in_exclude_list (sec->spec.exclude_name_list, file))
280 (*callback) (ptr, sec, s, ptr->section_flag_list, file, data);
283 /* Lowest common denominator routine that can handle everything correctly,
287 walk_wild_section_general (lang_wild_statement_type *ptr,
288 lang_input_statement_type *file,
293 struct wildcard_list *sec;
295 for (s = file->the_bfd->sections; s != NULL; s = s->next)
297 sec = ptr->section_list;
299 (*callback) (ptr, sec, s, ptr->section_flag_list, file, data);
303 bfd_boolean skip = FALSE;
305 if (sec->spec.name != NULL)
307 const char *sname = bfd_get_section_name (file->the_bfd, s);
309 skip = name_match (sec->spec.name, sname) != 0;
313 walk_wild_consider_section (ptr, file, s, sec, callback, data);
320 /* Routines to find a single section given its name. If there's more
321 than one section with that name, we report that. */
325 asection *found_section;
326 bfd_boolean multiple_sections_found;
327 } section_iterator_callback_data;
330 section_iterator_callback (bfd *abfd ATTRIBUTE_UNUSED, asection *s, void *data)
332 section_iterator_callback_data *d = (section_iterator_callback_data *) data;
334 if (d->found_section != NULL)
336 d->multiple_sections_found = TRUE;
340 d->found_section = s;
345 find_section (lang_input_statement_type *file,
346 struct wildcard_list *sec,
347 bfd_boolean *multiple_sections_found)
349 section_iterator_callback_data cb_data = { NULL, FALSE };
351 bfd_get_section_by_name_if (file->the_bfd, sec->spec.name,
352 section_iterator_callback, &cb_data);
353 *multiple_sections_found = cb_data.multiple_sections_found;
354 return cb_data.found_section;
357 /* Code for handling simple wildcards without going through fnmatch,
358 which can be expensive because of charset translations etc. */
360 /* A simple wild is a literal string followed by a single '*',
361 where the literal part is at least 4 characters long. */
364 is_simple_wild (const char *name)
366 size_t len = strcspn (name, "*?[");
367 return len >= 4 && name[len] == '*' && name[len + 1] == '\0';
371 match_simple_wild (const char *pattern, const char *name)
373 /* The first four characters of the pattern are guaranteed valid
374 non-wildcard characters. So we can go faster. */
375 if (pattern[0] != name[0] || pattern[1] != name[1]
376 || pattern[2] != name[2] || pattern[3] != name[3])
381 while (*pattern != '*')
382 if (*name++ != *pattern++)
388 /* Return the numerical value of the init_priority attribute from
389 section name NAME. */
392 get_init_priority (const char *name)
395 unsigned long init_priority;
397 /* GCC uses the following section names for the init_priority
398 attribute with numerical values 101 and 65535 inclusive. A
399 lower value means a higher priority.
401 1: .init_array.NNNN/.fini_array.NNNN: Where NNNN is the
402 decimal numerical value of the init_priority attribute.
403 The order of execution in .init_array is forward and
404 .fini_array is backward.
405 2: .ctors.NNNN/.dtors.NNNN: Where NNNN is 65535 minus the
406 decimal numerical value of the init_priority attribute.
407 The order of execution in .ctors is backward and .dtors
410 if (strncmp (name, ".init_array.", 12) == 0
411 || strncmp (name, ".fini_array.", 12) == 0)
413 init_priority = strtoul (name + 12, &end, 10);
414 return *end ? 0 : init_priority;
416 else if (strncmp (name, ".ctors.", 7) == 0
417 || strncmp (name, ".dtors.", 7) == 0)
419 init_priority = strtoul (name + 7, &end, 10);
420 return *end ? 0 : 65535 - init_priority;
426 /* Compare sections ASEC and BSEC according to SORT. */
429 compare_section (sort_type sort, asection *asec, asection *bsec)
432 unsigned long ainit_priority, binit_priority;
439 case by_init_priority:
441 = get_init_priority (bfd_get_section_name (asec->owner, asec));
443 = get_init_priority (bfd_get_section_name (bsec->owner, bsec));
444 if (ainit_priority == 0 || binit_priority == 0)
446 ret = ainit_priority - binit_priority;
452 case by_alignment_name:
453 ret = (bfd_section_alignment (bsec->owner, bsec)
454 - bfd_section_alignment (asec->owner, asec));
461 ret = strcmp (bfd_get_section_name (asec->owner, asec),
462 bfd_get_section_name (bsec->owner, bsec));
465 case by_name_alignment:
466 ret = strcmp (bfd_get_section_name (asec->owner, asec),
467 bfd_get_section_name (bsec->owner, bsec));
473 ret = (bfd_section_alignment (bsec->owner, bsec)
474 - bfd_section_alignment (asec->owner, asec));
481 /* Build a Binary Search Tree to sort sections, unlike insertion sort
482 used in wild_sort(). BST is considerably faster if the number of
483 of sections are large. */
485 static lang_section_bst_type **
486 wild_sort_fast (lang_wild_statement_type *wild,
487 struct wildcard_list *sec,
488 lang_input_statement_type *file ATTRIBUTE_UNUSED,
491 lang_section_bst_type **tree;
494 if (!wild->filenames_sorted
495 && (sec == NULL || sec->spec.sorted == none))
497 /* Append at the right end of tree. */
499 tree = &((*tree)->right);
505 /* Find the correct node to append this section. */
506 if (compare_section (sec->spec.sorted, section, (*tree)->section) < 0)
507 tree = &((*tree)->left);
509 tree = &((*tree)->right);
515 /* Use wild_sort_fast to build a BST to sort sections. */
518 output_section_callback_fast (lang_wild_statement_type *ptr,
519 struct wildcard_list *sec,
521 struct flag_info *sflag_list ATTRIBUTE_UNUSED,
522 lang_input_statement_type *file,
525 lang_section_bst_type *node;
526 lang_section_bst_type **tree;
527 lang_output_section_statement_type *os;
529 os = (lang_output_section_statement_type *) output;
531 if (unique_section_p (section, os))
534 node = (lang_section_bst_type *) xmalloc (sizeof (lang_section_bst_type));
537 node->section = section;
539 tree = wild_sort_fast (ptr, sec, file, section);
544 /* Convert a sorted sections' BST back to list form. */
547 output_section_callback_tree_to_list (lang_wild_statement_type *ptr,
548 lang_section_bst_type *tree,
552 output_section_callback_tree_to_list (ptr, tree->left, output);
554 lang_add_section (&ptr->children, tree->section, NULL,
555 (lang_output_section_statement_type *) output);
558 output_section_callback_tree_to_list (ptr, tree->right, output);
563 /* Specialized, optimized routines for handling different kinds of
567 walk_wild_section_specs1_wild0 (lang_wild_statement_type *ptr,
568 lang_input_statement_type *file,
572 /* We can just do a hash lookup for the section with the right name.
573 But if that lookup discovers more than one section with the name
574 (should be rare), we fall back to the general algorithm because
575 we would otherwise have to sort the sections to make sure they
576 get processed in the bfd's order. */
577 bfd_boolean multiple_sections_found;
578 struct wildcard_list *sec0 = ptr->handler_data[0];
579 asection *s0 = find_section (file, sec0, &multiple_sections_found);
581 if (multiple_sections_found)
582 walk_wild_section_general (ptr, file, callback, data);
584 walk_wild_consider_section (ptr, file, s0, sec0, callback, data);
588 walk_wild_section_specs1_wild1 (lang_wild_statement_type *ptr,
589 lang_input_statement_type *file,
594 struct wildcard_list *wildsec0 = ptr->handler_data[0];
596 for (s = file->the_bfd->sections; s != NULL; s = s->next)
598 const char *sname = bfd_get_section_name (file->the_bfd, s);
599 bfd_boolean skip = !match_simple_wild (wildsec0->spec.name, sname);
602 walk_wild_consider_section (ptr, file, s, wildsec0, callback, data);
607 walk_wild_section_specs2_wild1 (lang_wild_statement_type *ptr,
608 lang_input_statement_type *file,
613 struct wildcard_list *sec0 = ptr->handler_data[0];
614 struct wildcard_list *wildsec1 = ptr->handler_data[1];
615 bfd_boolean multiple_sections_found;
616 asection *s0 = find_section (file, sec0, &multiple_sections_found);
618 if (multiple_sections_found)
620 walk_wild_section_general (ptr, file, callback, data);
624 /* Note that if the section was not found, s0 is NULL and
625 we'll simply never succeed the s == s0 test below. */
626 for (s = file->the_bfd->sections; s != NULL; s = s->next)
628 /* Recall that in this code path, a section cannot satisfy more
629 than one spec, so if s == s0 then it cannot match
632 walk_wild_consider_section (ptr, file, s, sec0, callback, data);
635 const char *sname = bfd_get_section_name (file->the_bfd, s);
636 bfd_boolean skip = !match_simple_wild (wildsec1->spec.name, sname);
639 walk_wild_consider_section (ptr, file, s, wildsec1, callback,
646 walk_wild_section_specs3_wild2 (lang_wild_statement_type *ptr,
647 lang_input_statement_type *file,
652 struct wildcard_list *sec0 = ptr->handler_data[0];
653 struct wildcard_list *wildsec1 = ptr->handler_data[1];
654 struct wildcard_list *wildsec2 = ptr->handler_data[2];
655 bfd_boolean multiple_sections_found;
656 asection *s0 = find_section (file, sec0, &multiple_sections_found);
658 if (multiple_sections_found)
660 walk_wild_section_general (ptr, file, callback, data);
664 for (s = file->the_bfd->sections; s != NULL; s = s->next)
667 walk_wild_consider_section (ptr, file, s, sec0, callback, data);
670 const char *sname = bfd_get_section_name (file->the_bfd, s);
671 bfd_boolean skip = !match_simple_wild (wildsec1->spec.name, sname);
674 walk_wild_consider_section (ptr, file, s, wildsec1, callback, data);
677 skip = !match_simple_wild (wildsec2->spec.name, sname);
679 walk_wild_consider_section (ptr, file, s, wildsec2, callback,
687 walk_wild_section_specs4_wild2 (lang_wild_statement_type *ptr,
688 lang_input_statement_type *file,
693 struct wildcard_list *sec0 = ptr->handler_data[0];
694 struct wildcard_list *sec1 = ptr->handler_data[1];
695 struct wildcard_list *wildsec2 = ptr->handler_data[2];
696 struct wildcard_list *wildsec3 = ptr->handler_data[3];
697 bfd_boolean multiple_sections_found;
698 asection *s0 = find_section (file, sec0, &multiple_sections_found), *s1;
700 if (multiple_sections_found)
702 walk_wild_section_general (ptr, file, callback, data);
706 s1 = find_section (file, sec1, &multiple_sections_found);
707 if (multiple_sections_found)
709 walk_wild_section_general (ptr, file, callback, data);
713 for (s = file->the_bfd->sections; s != NULL; s = s->next)
716 walk_wild_consider_section (ptr, file, s, sec0, callback, data);
719 walk_wild_consider_section (ptr, file, s, sec1, callback, data);
722 const char *sname = bfd_get_section_name (file->the_bfd, s);
723 bfd_boolean skip = !match_simple_wild (wildsec2->spec.name,
727 walk_wild_consider_section (ptr, file, s, wildsec2, callback,
731 skip = !match_simple_wild (wildsec3->spec.name, sname);
733 walk_wild_consider_section (ptr, file, s, wildsec3,
741 walk_wild_section (lang_wild_statement_type *ptr,
742 lang_input_statement_type *file,
746 if (file->flags.just_syms)
749 (*ptr->walk_wild_section_handler) (ptr, file, callback, data);
752 /* Returns TRUE when name1 is a wildcard spec that might match
753 something name2 can match. We're conservative: we return FALSE
754 only if the prefixes of name1 and name2 are different up to the
755 first wildcard character. */
758 wild_spec_can_overlap (const char *name1, const char *name2)
760 size_t prefix1_len = strcspn (name1, "?*[");
761 size_t prefix2_len = strcspn (name2, "?*[");
762 size_t min_prefix_len;
764 /* Note that if there is no wildcard character, then we treat the
765 terminating 0 as part of the prefix. Thus ".text" won't match
766 ".text." or ".text.*", for example. */
767 if (name1[prefix1_len] == '\0')
769 if (name2[prefix2_len] == '\0')
772 min_prefix_len = prefix1_len < prefix2_len ? prefix1_len : prefix2_len;
774 return memcmp (name1, name2, min_prefix_len) == 0;
777 /* Select specialized code to handle various kinds of wildcard
781 analyze_walk_wild_section_handler (lang_wild_statement_type *ptr)
784 int wild_name_count = 0;
785 struct wildcard_list *sec;
789 ptr->walk_wild_section_handler = walk_wild_section_general;
790 ptr->handler_data[0] = NULL;
791 ptr->handler_data[1] = NULL;
792 ptr->handler_data[2] = NULL;
793 ptr->handler_data[3] = NULL;
796 /* Count how many wildcard_specs there are, and how many of those
797 actually use wildcards in the name. Also, bail out if any of the
798 wildcard names are NULL. (Can this actually happen?
799 walk_wild_section used to test for it.) And bail out if any
800 of the wildcards are more complex than a simple string
801 ending in a single '*'. */
802 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
805 if (sec->spec.name == NULL)
807 if (wildcardp (sec->spec.name))
810 if (!is_simple_wild (sec->spec.name))
815 /* The zero-spec case would be easy to optimize but it doesn't
816 happen in practice. Likewise, more than 4 specs doesn't
817 happen in practice. */
818 if (sec_count == 0 || sec_count > 4)
821 /* Check that no two specs can match the same section. */
822 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
824 struct wildcard_list *sec2;
825 for (sec2 = sec->next; sec2 != NULL; sec2 = sec2->next)
827 if (wild_spec_can_overlap (sec->spec.name, sec2->spec.name))
832 signature = (sec_count << 8) + wild_name_count;
836 ptr->walk_wild_section_handler = walk_wild_section_specs1_wild0;
839 ptr->walk_wild_section_handler = walk_wild_section_specs1_wild1;
842 ptr->walk_wild_section_handler = walk_wild_section_specs2_wild1;
845 ptr->walk_wild_section_handler = walk_wild_section_specs3_wild2;
848 ptr->walk_wild_section_handler = walk_wild_section_specs4_wild2;
854 /* Now fill the data array with pointers to the specs, first the
855 specs with non-wildcard names, then the specs with wildcard
856 names. It's OK to process the specs in different order from the
857 given order, because we've already determined that no section
858 will match more than one spec. */
860 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
861 if (!wildcardp (sec->spec.name))
862 ptr->handler_data[data_counter++] = sec;
863 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
864 if (wildcardp (sec->spec.name))
865 ptr->handler_data[data_counter++] = sec;
868 /* Handle a wild statement for a single file F. */
871 walk_wild_file (lang_wild_statement_type *s,
872 lang_input_statement_type *f,
876 if (walk_wild_file_in_exclude_list (s->exclude_name_list, f))
879 if (f->the_bfd == NULL
880 || !bfd_check_format (f->the_bfd, bfd_archive))
881 walk_wild_section (s, f, callback, data);
886 /* This is an archive file. We must map each member of the
887 archive separately. */
888 member = bfd_openr_next_archived_file (f->the_bfd, NULL);
889 while (member != NULL)
891 /* When lookup_name is called, it will call the add_symbols
892 entry point for the archive. For each element of the
893 archive which is included, BFD will call ldlang_add_file,
894 which will set the usrdata field of the member to the
895 lang_input_statement. */
896 if (member->usrdata != NULL)
898 walk_wild_section (s,
899 (lang_input_statement_type *) member->usrdata,
903 member = bfd_openr_next_archived_file (f->the_bfd, member);
909 walk_wild (lang_wild_statement_type *s, callback_t callback, void *data)
911 const char *file_spec = s->filename;
914 if (file_spec == NULL)
916 /* Perform the iteration over all files in the list. */
917 LANG_FOR_EACH_INPUT_STATEMENT (f)
919 walk_wild_file (s, f, callback, data);
922 else if ((p = archive_path (file_spec)) != NULL)
924 LANG_FOR_EACH_INPUT_STATEMENT (f)
926 if (input_statement_is_archive_path (file_spec, p, f))
927 walk_wild_file (s, f, callback, data);
930 else if (wildcardp (file_spec))
932 LANG_FOR_EACH_INPUT_STATEMENT (f)
934 if (fnmatch (file_spec, f->filename, 0) == 0)
935 walk_wild_file (s, f, callback, data);
940 lang_input_statement_type *f;
942 /* Perform the iteration over a single file. */
943 f = lookup_name (file_spec);
945 walk_wild_file (s, f, callback, data);
949 /* lang_for_each_statement walks the parse tree and calls the provided
950 function for each node, except those inside output section statements
951 with constraint set to -1. */
954 lang_for_each_statement_worker (void (*func) (lang_statement_union_type *),
955 lang_statement_union_type *s)
957 for (; s != NULL; s = s->header.next)
961 switch (s->header.type)
963 case lang_constructors_statement_enum:
964 lang_for_each_statement_worker (func, constructor_list.head);
966 case lang_output_section_statement_enum:
967 if (s->output_section_statement.constraint != -1)
968 lang_for_each_statement_worker
969 (func, s->output_section_statement.children.head);
971 case lang_wild_statement_enum:
972 lang_for_each_statement_worker (func,
973 s->wild_statement.children.head);
975 case lang_group_statement_enum:
976 lang_for_each_statement_worker (func,
977 s->group_statement.children.head);
979 case lang_data_statement_enum:
980 case lang_reloc_statement_enum:
981 case lang_object_symbols_statement_enum:
982 case lang_output_statement_enum:
983 case lang_target_statement_enum:
984 case lang_input_section_enum:
985 case lang_input_statement_enum:
986 case lang_assignment_statement_enum:
987 case lang_padding_statement_enum:
988 case lang_address_statement_enum:
989 case lang_fill_statement_enum:
990 case lang_insert_statement_enum:
1000 lang_for_each_statement (void (*func) (lang_statement_union_type *))
1002 lang_for_each_statement_worker (func, statement_list.head);
1005 /*----------------------------------------------------------------------*/
1008 lang_list_init (lang_statement_list_type *list)
1011 list->tail = &list->head;
1015 push_stat_ptr (lang_statement_list_type *new_ptr)
1017 if (stat_save_ptr >= stat_save + sizeof (stat_save) / sizeof (stat_save[0]))
1019 *stat_save_ptr++ = stat_ptr;
1026 if (stat_save_ptr <= stat_save)
1028 stat_ptr = *--stat_save_ptr;
1031 /* Build a new statement node for the parse tree. */
1033 static lang_statement_union_type *
1034 new_statement (enum statement_enum type,
1036 lang_statement_list_type *list)
1038 lang_statement_union_type *new_stmt;
1040 new_stmt = (lang_statement_union_type *) stat_alloc (size);
1041 new_stmt->header.type = type;
1042 new_stmt->header.next = NULL;
1043 lang_statement_append (list, new_stmt, &new_stmt->header.next);
1047 /* Build a new input file node for the language. There are several
1048 ways in which we treat an input file, eg, we only look at symbols,
1049 or prefix it with a -l etc.
1051 We can be supplied with requests for input files more than once;
1052 they may, for example be split over several lines like foo.o(.text)
1053 foo.o(.data) etc, so when asked for a file we check that we haven't
1054 got it already so we don't duplicate the bfd. */
1056 static lang_input_statement_type *
1057 new_afile (const char *name,
1058 lang_input_file_enum_type file_type,
1060 bfd_boolean add_to_list)
1062 lang_input_statement_type *p;
1064 lang_has_input_file = TRUE;
1067 p = (lang_input_statement_type *) new_stat (lang_input_statement, stat_ptr);
1070 p = (lang_input_statement_type *)
1071 stat_alloc (sizeof (lang_input_statement_type));
1072 p->header.type = lang_input_statement_enum;
1073 p->header.next = NULL;
1076 memset (&p->the_bfd, 0,
1077 sizeof (*p) - offsetof (lang_input_statement_type, the_bfd));
1079 p->flags.dynamic = input_flags.dynamic;
1080 p->flags.add_DT_NEEDED_for_dynamic = input_flags.add_DT_NEEDED_for_dynamic;
1081 p->flags.add_DT_NEEDED_for_regular = input_flags.add_DT_NEEDED_for_regular;
1082 p->flags.whole_archive = input_flags.whole_archive;
1083 p->flags.sysrooted = input_flags.sysrooted;
1087 case lang_input_file_is_symbols_only_enum:
1089 p->local_sym_name = name;
1090 p->flags.real = TRUE;
1091 p->flags.just_syms = TRUE;
1093 case lang_input_file_is_fake_enum:
1095 p->local_sym_name = name;
1097 case lang_input_file_is_l_enum:
1098 if (name[0] == ':' && name[1] != '\0')
1100 p->filename = name + 1;
1101 p->flags.full_name_provided = TRUE;
1105 p->local_sym_name = concat ("-l", name, (const char *) NULL);
1106 p->flags.maybe_archive = TRUE;
1107 p->flags.real = TRUE;
1108 p->flags.search_dirs = TRUE;
1110 case lang_input_file_is_marker_enum:
1112 p->local_sym_name = name;
1113 p->flags.search_dirs = TRUE;
1115 case lang_input_file_is_search_file_enum:
1117 p->local_sym_name = name;
1118 p->flags.real = TRUE;
1119 p->flags.search_dirs = TRUE;
1121 case lang_input_file_is_file_enum:
1123 p->local_sym_name = name;
1124 p->flags.real = TRUE;
1130 lang_statement_append (&input_file_chain,
1131 (lang_statement_union_type *) p,
1132 &p->next_real_file);
1136 lang_input_statement_type *
1137 lang_add_input_file (const char *name,
1138 lang_input_file_enum_type file_type,
1141 if (name != NULL && *name == '=')
1143 lang_input_statement_type *ret;
1144 char *sysrooted_name
1145 = concat (ld_sysroot, name + 1, (const char *) NULL);
1147 /* We've now forcibly prepended the sysroot, making the input
1148 file independent of the context. Therefore, temporarily
1149 force a non-sysrooted context for this statement, so it won't
1150 get the sysroot prepended again when opened. (N.B. if it's a
1151 script, any child nodes with input files starting with "/"
1152 will be handled as "sysrooted" as they'll be found to be
1153 within the sysroot subdirectory.) */
1154 unsigned int outer_sysrooted = input_flags.sysrooted;
1155 input_flags.sysrooted = 0;
1156 ret = new_afile (sysrooted_name, file_type, target, TRUE);
1157 input_flags.sysrooted = outer_sysrooted;
1161 return new_afile (name, file_type, target, TRUE);
1164 struct out_section_hash_entry
1166 struct bfd_hash_entry root;
1167 lang_statement_union_type s;
1170 /* The hash table. */
1172 static struct bfd_hash_table output_section_statement_table;
1174 /* Support routines for the hash table used by lang_output_section_find,
1175 initialize the table, fill in an entry and remove the table. */
1177 static struct bfd_hash_entry *
1178 output_section_statement_newfunc (struct bfd_hash_entry *entry,
1179 struct bfd_hash_table *table,
1182 lang_output_section_statement_type **nextp;
1183 struct out_section_hash_entry *ret;
1187 entry = (struct bfd_hash_entry *) bfd_hash_allocate (table,
1193 entry = bfd_hash_newfunc (entry, table, string);
1197 ret = (struct out_section_hash_entry *) entry;
1198 memset (&ret->s, 0, sizeof (ret->s));
1199 ret->s.header.type = lang_output_section_statement_enum;
1200 ret->s.output_section_statement.subsection_alignment = -1;
1201 ret->s.output_section_statement.section_alignment = -1;
1202 ret->s.output_section_statement.block_value = 1;
1203 lang_list_init (&ret->s.output_section_statement.children);
1204 lang_statement_append (stat_ptr, &ret->s, &ret->s.header.next);
1206 /* For every output section statement added to the list, except the
1207 first one, lang_output_section_statement.tail points to the "next"
1208 field of the last element of the list. */
1209 if (lang_output_section_statement.head != NULL)
1210 ret->s.output_section_statement.prev
1211 = ((lang_output_section_statement_type *)
1212 ((char *) lang_output_section_statement.tail
1213 - offsetof (lang_output_section_statement_type, next)));
1215 /* GCC's strict aliasing rules prevent us from just casting the
1216 address, so we store the pointer in a variable and cast that
1218 nextp = &ret->s.output_section_statement.next;
1219 lang_statement_append (&lang_output_section_statement,
1221 (lang_statement_union_type **) nextp);
1226 output_section_statement_table_init (void)
1228 if (!bfd_hash_table_init_n (&output_section_statement_table,
1229 output_section_statement_newfunc,
1230 sizeof (struct out_section_hash_entry),
1232 einfo (_("%P%F: can not create hash table: %E\n"));
1236 output_section_statement_table_free (void)
1238 bfd_hash_table_free (&output_section_statement_table);
1241 /* Build enough state so that the parser can build its tree. */
1246 obstack_begin (&stat_obstack, 1000);
1248 stat_ptr = &statement_list;
1250 output_section_statement_table_init ();
1252 lang_list_init (stat_ptr);
1254 lang_list_init (&input_file_chain);
1255 lang_list_init (&lang_output_section_statement);
1256 lang_list_init (&file_chain);
1257 first_file = lang_add_input_file (NULL, lang_input_file_is_marker_enum,
1259 abs_output_section =
1260 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME, 0, TRUE);
1262 abs_output_section->bfd_section = bfd_abs_section_ptr;
1264 asneeded_list_head = NULL;
1265 asneeded_list_tail = &asneeded_list_head;
1271 output_section_statement_table_free ();
1274 /*----------------------------------------------------------------------
1275 A region is an area of memory declared with the
1276 MEMORY { name:org=exp, len=exp ... }
1279 We maintain a list of all the regions here.
1281 If no regions are specified in the script, then the default is used
1282 which is created when looked up to be the entire data space.
1284 If create is true we are creating a region inside a MEMORY block.
1285 In this case it is probably an error to create a region that has
1286 already been created. If we are not inside a MEMORY block it is
1287 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1288 and so we issue a warning.
1290 Each region has at least one name. The first name is either
1291 DEFAULT_MEMORY_REGION or the name given in the MEMORY block. You can add
1292 alias names to an existing region within a script with
1293 REGION_ALIAS (alias, region_name). Each name corresponds to at most one
1296 static lang_memory_region_type *lang_memory_region_list;
1297 static lang_memory_region_type **lang_memory_region_list_tail
1298 = &lang_memory_region_list;
1300 lang_memory_region_type *
1301 lang_memory_region_lookup (const char *const name, bfd_boolean create)
1303 lang_memory_region_name *n;
1304 lang_memory_region_type *r;
1305 lang_memory_region_type *new_region;
1307 /* NAME is NULL for LMA memspecs if no region was specified. */
1311 for (r = lang_memory_region_list; r != NULL; r = r->next)
1312 for (n = &r->name_list; n != NULL; n = n->next)
1313 if (strcmp (n->name, name) == 0)
1316 einfo (_("%P:%S: warning: redeclaration of memory region `%s'\n"),
1321 if (!create && strcmp (name, DEFAULT_MEMORY_REGION))
1322 einfo (_("%P:%S: warning: memory region `%s' not declared\n"),
1325 new_region = (lang_memory_region_type *)
1326 stat_alloc (sizeof (lang_memory_region_type));
1328 new_region->name_list.name = xstrdup (name);
1329 new_region->name_list.next = NULL;
1330 new_region->next = NULL;
1331 new_region->origin_exp = NULL;
1332 new_region->origin = 0;
1333 new_region->length_exp = NULL;
1334 new_region->length = ~(bfd_size_type) 0;
1335 new_region->current = 0;
1336 new_region->last_os = NULL;
1337 new_region->flags = 0;
1338 new_region->not_flags = 0;
1339 new_region->had_full_message = FALSE;
1341 *lang_memory_region_list_tail = new_region;
1342 lang_memory_region_list_tail = &new_region->next;
1348 lang_memory_region_alias (const char *alias, const char *region_name)
1350 lang_memory_region_name *n;
1351 lang_memory_region_type *r;
1352 lang_memory_region_type *region;
1354 /* The default region must be unique. This ensures that it is not necessary
1355 to iterate through the name list if someone wants the check if a region is
1356 the default memory region. */
1357 if (strcmp (region_name, DEFAULT_MEMORY_REGION) == 0
1358 || strcmp (alias, DEFAULT_MEMORY_REGION) == 0)
1359 einfo (_("%F%P:%S: error: alias for default memory region\n"), NULL);
1361 /* Look for the target region and check if the alias is not already
1364 for (r = lang_memory_region_list; r != NULL; r = r->next)
1365 for (n = &r->name_list; n != NULL; n = n->next)
1367 if (region == NULL && strcmp (n->name, region_name) == 0)
1369 if (strcmp (n->name, alias) == 0)
1370 einfo (_("%F%P:%S: error: redefinition of memory region "
1375 /* Check if the target region exists. */
1377 einfo (_("%F%P:%S: error: memory region `%s' "
1378 "for alias `%s' does not exist\n"),
1379 NULL, region_name, alias);
1381 /* Add alias to region name list. */
1382 n = (lang_memory_region_name *) stat_alloc (sizeof (lang_memory_region_name));
1383 n->name = xstrdup (alias);
1384 n->next = region->name_list.next;
1385 region->name_list.next = n;
1388 static lang_memory_region_type *
1389 lang_memory_default (asection *section)
1391 lang_memory_region_type *p;
1393 flagword sec_flags = section->flags;
1395 /* Override SEC_DATA to mean a writable section. */
1396 if ((sec_flags & (SEC_ALLOC | SEC_READONLY | SEC_CODE)) == SEC_ALLOC)
1397 sec_flags |= SEC_DATA;
1399 for (p = lang_memory_region_list; p != NULL; p = p->next)
1401 if ((p->flags & sec_flags) != 0
1402 && (p->not_flags & sec_flags) == 0)
1407 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION, FALSE);
1410 /* Get the output section statement directly from the userdata. */
1412 lang_output_section_statement_type *
1413 lang_output_section_get (const asection *output_section)
1415 return get_userdata (output_section);
1418 /* Find or create an output_section_statement with the given NAME.
1419 If CONSTRAINT is non-zero match one with that constraint, otherwise
1420 match any non-negative constraint. If CREATE, always make a
1421 new output_section_statement for SPECIAL CONSTRAINT. */
1423 lang_output_section_statement_type *
1424 lang_output_section_statement_lookup (const char *name,
1428 struct out_section_hash_entry *entry;
1430 entry = ((struct out_section_hash_entry *)
1431 bfd_hash_lookup (&output_section_statement_table, name,
1436 einfo (_("%P%F: failed creating section `%s': %E\n"), name);
1440 if (entry->s.output_section_statement.name != NULL)
1442 /* We have a section of this name, but it might not have the correct
1444 struct out_section_hash_entry *last_ent;
1446 name = entry->s.output_section_statement.name;
1447 if (create && constraint == SPECIAL)
1448 /* Not traversing to the end reverses the order of the second
1449 and subsequent SPECIAL sections in the hash table chain,
1450 but that shouldn't matter. */
1455 if (constraint == entry->s.output_section_statement.constraint
1457 && entry->s.output_section_statement.constraint >= 0))
1458 return &entry->s.output_section_statement;
1460 entry = (struct out_section_hash_entry *) entry->root.next;
1462 while (entry != NULL
1463 && name == entry->s.output_section_statement.name);
1469 = ((struct out_section_hash_entry *)
1470 output_section_statement_newfunc (NULL,
1471 &output_section_statement_table,
1475 einfo (_("%P%F: failed creating section `%s': %E\n"), name);
1478 entry->root = last_ent->root;
1479 last_ent->root.next = &entry->root;
1482 entry->s.output_section_statement.name = name;
1483 entry->s.output_section_statement.constraint = constraint;
1484 return &entry->s.output_section_statement;
1487 /* Find the next output_section_statement with the same name as OS.
1488 If CONSTRAINT is non-zero, find one with that constraint otherwise
1489 match any non-negative constraint. */
1491 lang_output_section_statement_type *
1492 next_matching_output_section_statement (lang_output_section_statement_type *os,
1495 /* All output_section_statements are actually part of a
1496 struct out_section_hash_entry. */
1497 struct out_section_hash_entry *entry = (struct out_section_hash_entry *)
1499 - offsetof (struct out_section_hash_entry, s.output_section_statement));
1500 const char *name = os->name;
1502 ASSERT (name == entry->root.string);
1505 entry = (struct out_section_hash_entry *) entry->root.next;
1507 || name != entry->s.output_section_statement.name)
1510 while (constraint != entry->s.output_section_statement.constraint
1512 || entry->s.output_section_statement.constraint < 0));
1514 return &entry->s.output_section_statement;
1517 /* A variant of lang_output_section_find used by place_orphan.
1518 Returns the output statement that should precede a new output
1519 statement for SEC. If an exact match is found on certain flags,
1522 lang_output_section_statement_type *
1523 lang_output_section_find_by_flags (const asection *sec,
1525 lang_output_section_statement_type **exact,
1526 lang_match_sec_type_func match_type)
1528 lang_output_section_statement_type *first, *look, *found;
1529 flagword look_flags, differ;
1531 /* We know the first statement on this list is *ABS*. May as well
1533 first = &lang_output_section_statement.head->output_section_statement;
1534 first = first->next;
1536 /* First try for an exact match. */
1538 for (look = first; look; look = look->next)
1540 look_flags = look->flags;
1541 if (look->bfd_section != NULL)
1543 look_flags = look->bfd_section->flags;
1544 if (match_type && !match_type (link_info.output_bfd,
1549 differ = look_flags ^ sec_flags;
1550 if (!(differ & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD | SEC_READONLY
1551 | SEC_CODE | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1561 if ((sec_flags & SEC_CODE) != 0
1562 && (sec_flags & SEC_ALLOC) != 0)
1564 /* Try for a rw code section. */
1565 for (look = first; look; look = look->next)
1567 look_flags = look->flags;
1568 if (look->bfd_section != NULL)
1570 look_flags = look->bfd_section->flags;
1571 if (match_type && !match_type (link_info.output_bfd,
1576 differ = look_flags ^ sec_flags;
1577 if (!(differ & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1578 | SEC_CODE | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1582 else if ((sec_flags & SEC_READONLY) != 0
1583 && (sec_flags & SEC_ALLOC) != 0)
1585 /* .rodata can go after .text, .sdata2 after .rodata. */
1586 for (look = first; look; look = look->next)
1588 look_flags = look->flags;
1589 if (look->bfd_section != NULL)
1591 look_flags = look->bfd_section->flags;
1592 if (match_type && !match_type (link_info.output_bfd,
1597 differ = look_flags ^ sec_flags;
1598 if (!(differ & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1599 | SEC_READONLY | SEC_SMALL_DATA))
1600 || (!(differ & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1602 && !(look_flags & SEC_SMALL_DATA)))
1606 else if ((sec_flags & SEC_THREAD_LOCAL) != 0
1607 && (sec_flags & SEC_ALLOC) != 0)
1609 /* .tdata can go after .data, .tbss after .tdata. Treat .tbss
1610 as if it were a loaded section, and don't use match_type. */
1611 bfd_boolean seen_thread_local = FALSE;
1614 for (look = first; look; look = look->next)
1616 look_flags = look->flags;
1617 if (look->bfd_section != NULL)
1618 look_flags = look->bfd_section->flags;
1620 differ = look_flags ^ (sec_flags | SEC_LOAD | SEC_HAS_CONTENTS);
1621 if (!(differ & (SEC_THREAD_LOCAL | SEC_ALLOC)))
1623 /* .tdata and .tbss must be adjacent and in that order. */
1624 if (!(look_flags & SEC_LOAD)
1625 && (sec_flags & SEC_LOAD))
1626 /* ..so if we're at a .tbss section and we're placing
1627 a .tdata section stop looking and return the
1628 previous section. */
1631 seen_thread_local = TRUE;
1633 else if (seen_thread_local)
1635 else if (!(differ & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD)))
1639 else if ((sec_flags & SEC_SMALL_DATA) != 0
1640 && (sec_flags & SEC_ALLOC) != 0)
1642 /* .sdata goes after .data, .sbss after .sdata. */
1643 for (look = first; look; look = look->next)
1645 look_flags = look->flags;
1646 if (look->bfd_section != NULL)
1648 look_flags = look->bfd_section->flags;
1649 if (match_type && !match_type (link_info.output_bfd,
1654 differ = look_flags ^ sec_flags;
1655 if (!(differ & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1656 | SEC_THREAD_LOCAL))
1657 || ((look_flags & SEC_SMALL_DATA)
1658 && !(sec_flags & SEC_HAS_CONTENTS)))
1662 else if ((sec_flags & SEC_HAS_CONTENTS) != 0
1663 && (sec_flags & SEC_ALLOC) != 0)
1665 /* .data goes after .rodata. */
1666 for (look = first; look; look = look->next)
1668 look_flags = look->flags;
1669 if (look->bfd_section != NULL)
1671 look_flags = look->bfd_section->flags;
1672 if (match_type && !match_type (link_info.output_bfd,
1677 differ = look_flags ^ sec_flags;
1678 if (!(differ & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1679 | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1683 else if ((sec_flags & SEC_ALLOC) != 0)
1685 /* .bss goes after any other alloc section. */
1686 for (look = first; look; look = look->next)
1688 look_flags = look->flags;
1689 if (look->bfd_section != NULL)
1691 look_flags = look->bfd_section->flags;
1692 if (match_type && !match_type (link_info.output_bfd,
1697 differ = look_flags ^ sec_flags;
1698 if (!(differ & SEC_ALLOC))
1704 /* non-alloc go last. */
1705 for (look = first; look; look = look->next)
1707 look_flags = look->flags;
1708 if (look->bfd_section != NULL)
1709 look_flags = look->bfd_section->flags;
1710 differ = look_flags ^ sec_flags;
1711 if (!(differ & SEC_DEBUGGING))
1717 if (found || !match_type)
1720 return lang_output_section_find_by_flags (sec, sec_flags, NULL, NULL);
1723 /* Find the last output section before given output statement.
1724 Used by place_orphan. */
1727 output_prev_sec_find (lang_output_section_statement_type *os)
1729 lang_output_section_statement_type *lookup;
1731 for (lookup = os->prev; lookup != NULL; lookup = lookup->prev)
1733 if (lookup->constraint < 0)
1736 if (lookup->bfd_section != NULL && lookup->bfd_section->owner != NULL)
1737 return lookup->bfd_section;
1743 /* Look for a suitable place for a new output section statement. The
1744 idea is to skip over anything that might be inside a SECTIONS {}
1745 statement in a script, before we find another output section
1746 statement. Assignments to "dot" before an output section statement
1747 are assumed to belong to it, except in two cases; The first
1748 assignment to dot, and assignments before non-alloc sections.
1749 Otherwise we might put an orphan before . = . + SIZEOF_HEADERS or
1750 similar assignments that set the initial address, or we might
1751 insert non-alloc note sections among assignments setting end of
1754 static lang_statement_union_type **
1755 insert_os_after (lang_output_section_statement_type *after)
1757 lang_statement_union_type **where;
1758 lang_statement_union_type **assign = NULL;
1759 bfd_boolean ignore_first;
1762 = after == &lang_output_section_statement.head->output_section_statement;
1764 for (where = &after->header.next;
1766 where = &(*where)->header.next)
1768 switch ((*where)->header.type)
1770 case lang_assignment_statement_enum:
1773 lang_assignment_statement_type *ass;
1775 ass = &(*where)->assignment_statement;
1776 if (ass->exp->type.node_class != etree_assert
1777 && ass->exp->assign.dst[0] == '.'
1778 && ass->exp->assign.dst[1] == 0
1782 ignore_first = FALSE;
1784 case lang_wild_statement_enum:
1785 case lang_input_section_enum:
1786 case lang_object_symbols_statement_enum:
1787 case lang_fill_statement_enum:
1788 case lang_data_statement_enum:
1789 case lang_reloc_statement_enum:
1790 case lang_padding_statement_enum:
1791 case lang_constructors_statement_enum:
1794 case lang_output_section_statement_enum:
1797 asection *s = (*where)->output_section_statement.bfd_section;
1800 || s->map_head.s == NULL
1801 || (s->flags & SEC_ALLOC) != 0)
1805 case lang_input_statement_enum:
1806 case lang_address_statement_enum:
1807 case lang_target_statement_enum:
1808 case lang_output_statement_enum:
1809 case lang_group_statement_enum:
1810 case lang_insert_statement_enum:
1819 lang_output_section_statement_type *
1820 lang_insert_orphan (asection *s,
1821 const char *secname,
1823 lang_output_section_statement_type *after,
1824 struct orphan_save *place,
1825 etree_type *address,
1826 lang_statement_list_type *add_child)
1828 lang_statement_list_type add;
1830 lang_assignment_statement_type *start_assign;
1831 lang_output_section_statement_type *os;
1832 lang_output_section_statement_type **os_tail;
1834 /* If we have found an appropriate place for the output section
1835 statements for this orphan, add them to our own private list,
1836 inserting them later into the global statement list. */
1839 lang_list_init (&add);
1840 push_stat_ptr (&add);
1843 if (bfd_link_relocatable (&link_info)
1844 || (s->flags & (SEC_LOAD | SEC_ALLOC)) == 0)
1845 address = exp_intop (0);
1847 os_tail = ((lang_output_section_statement_type **)
1848 lang_output_section_statement.tail);
1849 os = lang_enter_output_section_statement (secname, address, normal_section,
1850 NULL, NULL, NULL, constraint, 0);
1853 start_assign = NULL;
1854 if (config.build_constructors && *os_tail == os)
1856 /* If the name of the section is representable in C, then create
1857 symbols to mark the start and the end of the section. */
1858 for (ps = secname; *ps != '\0'; ps++)
1859 if (!ISALNUM ((unsigned char) *ps) && *ps != '_')
1865 symname = (char *) xmalloc (ps - secname + sizeof "__start_" + 1);
1866 symname[0] = bfd_get_symbol_leading_char (link_info.output_bfd);
1867 sprintf (symname + (symname[0] != 0), "__start_%s", secname);
1869 = lang_add_assignment (exp_provide (symname,
1870 exp_nameop (NAME, "."),
1875 if (add_child == NULL)
1876 add_child = &os->children;
1877 lang_add_section (add_child, s, NULL, os);
1879 if (after && (s->flags & (SEC_LOAD | SEC_ALLOC)) != 0)
1881 const char *region = (after->region
1882 ? after->region->name_list.name
1883 : DEFAULT_MEMORY_REGION);
1884 const char *lma_region = (after->lma_region
1885 ? after->lma_region->name_list.name
1887 lang_leave_output_section_statement (NULL, region, after->phdrs,
1891 lang_leave_output_section_statement (NULL, DEFAULT_MEMORY_REGION, NULL,
1894 if (start_assign != NULL)
1897 lang_assignment_statement_type *stop_assign;
1900 symname = (char *) xmalloc (ps - secname + sizeof "__stop_" + 1);
1901 symname[0] = bfd_get_symbol_leading_char (link_info.output_bfd);
1902 sprintf (symname + (symname[0] != 0), "__stop_%s", secname);
1904 = lang_add_assignment (exp_provide (symname,
1905 exp_nameop (NAME, "."),
1907 /* Evaluate the expression to define the symbol if referenced,
1908 before sizing dynamic sections. */
1909 dot = os->bfd_section->vma;
1910 exp_fold_tree (start_assign->exp, os->bfd_section, &dot);
1911 dot += TO_ADDR (s->size);
1912 exp_fold_tree (stop_assign->exp, os->bfd_section, &dot);
1915 /* Restore the global list pointer. */
1919 if (after != NULL && os->bfd_section != NULL)
1921 asection *snew, *as;
1923 snew = os->bfd_section;
1925 /* Shuffle the bfd section list to make the output file look
1926 neater. This is really only cosmetic. */
1927 if (place->section == NULL
1928 && after != (&lang_output_section_statement.head
1929 ->output_section_statement))
1931 asection *bfd_section = after->bfd_section;
1933 /* If the output statement hasn't been used to place any input
1934 sections (and thus doesn't have an output bfd_section),
1935 look for the closest prior output statement having an
1937 if (bfd_section == NULL)
1938 bfd_section = output_prev_sec_find (after);
1940 if (bfd_section != NULL && bfd_section != snew)
1941 place->section = &bfd_section->next;
1944 if (place->section == NULL)
1945 place->section = &link_info.output_bfd->sections;
1947 as = *place->section;
1951 /* Put the section at the end of the list. */
1953 /* Unlink the section. */
1954 bfd_section_list_remove (link_info.output_bfd, snew);
1956 /* Now tack it back on in the right place. */
1957 bfd_section_list_append (link_info.output_bfd, snew);
1959 else if (as != snew && as->prev != snew)
1961 /* Unlink the section. */
1962 bfd_section_list_remove (link_info.output_bfd, snew);
1964 /* Now tack it back on in the right place. */
1965 bfd_section_list_insert_before (link_info.output_bfd, as, snew);
1968 /* Save the end of this list. Further ophans of this type will
1969 follow the one we've just added. */
1970 place->section = &snew->next;
1972 /* The following is non-cosmetic. We try to put the output
1973 statements in some sort of reasonable order here, because they
1974 determine the final load addresses of the orphan sections.
1975 In addition, placing output statements in the wrong order may
1976 require extra segments. For instance, given a typical
1977 situation of all read-only sections placed in one segment and
1978 following that a segment containing all the read-write
1979 sections, we wouldn't want to place an orphan read/write
1980 section before or amongst the read-only ones. */
1981 if (add.head != NULL)
1983 lang_output_section_statement_type *newly_added_os;
1985 if (place->stmt == NULL)
1987 lang_statement_union_type **where = insert_os_after (after);
1992 place->os_tail = &after->next;
1996 /* Put it after the last orphan statement we added. */
1997 *add.tail = *place->stmt;
1998 *place->stmt = add.head;
2001 /* Fix the global list pointer if we happened to tack our
2002 new list at the tail. */
2003 if (*stat_ptr->tail == add.head)
2004 stat_ptr->tail = add.tail;
2006 /* Save the end of this list. */
2007 place->stmt = add.tail;
2009 /* Do the same for the list of output section statements. */
2010 newly_added_os = *os_tail;
2012 newly_added_os->prev = (lang_output_section_statement_type *)
2013 ((char *) place->os_tail
2014 - offsetof (lang_output_section_statement_type, next));
2015 newly_added_os->next = *place->os_tail;
2016 if (newly_added_os->next != NULL)
2017 newly_added_os->next->prev = newly_added_os;
2018 *place->os_tail = newly_added_os;
2019 place->os_tail = &newly_added_os->next;
2021 /* Fixing the global list pointer here is a little different.
2022 We added to the list in lang_enter_output_section_statement,
2023 trimmed off the new output_section_statment above when
2024 assigning *os_tail = NULL, but possibly added it back in
2025 the same place when assigning *place->os_tail. */
2026 if (*os_tail == NULL)
2027 lang_output_section_statement.tail
2028 = (lang_statement_union_type **) os_tail;
2035 lang_print_asneeded (void)
2037 struct asneeded_minfo *m;
2040 if (asneeded_list_head == NULL)
2043 sprintf (buf, _("\nAs-needed library included "
2044 "to satisfy reference by file (symbol)\n\n"));
2047 for (m = asneeded_list_head; m != NULL; m = m->next)
2051 minfo ("%s", m->soname);
2052 len = strlen (m->soname);
2066 minfo ("%B ", m->ref);
2067 minfo ("(%T)\n", m->name);
2072 lang_map_flags (flagword flag)
2074 if (flag & SEC_ALLOC)
2077 if (flag & SEC_CODE)
2080 if (flag & SEC_READONLY)
2083 if (flag & SEC_DATA)
2086 if (flag & SEC_LOAD)
2093 lang_memory_region_type *m;
2094 bfd_boolean dis_header_printed = FALSE;
2096 LANG_FOR_EACH_INPUT_STATEMENT (file)
2100 if ((file->the_bfd->flags & (BFD_LINKER_CREATED | DYNAMIC)) != 0
2101 || file->flags.just_syms)
2104 for (s = file->the_bfd->sections; s != NULL; s = s->next)
2105 if ((s->output_section == NULL
2106 || s->output_section->owner != link_info.output_bfd)
2107 && (s->flags & (SEC_LINKER_CREATED | SEC_KEEP)) == 0)
2109 if (!dis_header_printed)
2111 fprintf (config.map_file, _("\nDiscarded input sections\n\n"));
2112 dis_header_printed = TRUE;
2115 print_input_section (s, TRUE);
2119 minfo (_("\nMemory Configuration\n\n"));
2120 fprintf (config.map_file, "%-16s %-18s %-18s %s\n",
2121 _("Name"), _("Origin"), _("Length"), _("Attributes"));
2123 for (m = lang_memory_region_list; m != NULL; m = m->next)
2128 fprintf (config.map_file, "%-16s ", m->name_list.name);
2130 sprintf_vma (buf, m->origin);
2131 minfo ("0x%s ", buf);
2139 minfo ("0x%V", m->length);
2140 if (m->flags || m->not_flags)
2148 lang_map_flags (m->flags);
2154 lang_map_flags (m->not_flags);
2161 fprintf (config.map_file, _("\nLinker script and memory map\n\n"));
2163 if (!link_info.reduce_memory_overheads)
2165 obstack_begin (&map_obstack, 1000);
2166 bfd_link_hash_traverse (link_info.hash, sort_def_symbol, 0);
2168 lang_statement_iteration++;
2169 print_statements ();
2171 ldemul_extra_map_file_text (link_info.output_bfd, &link_info,
2176 sort_def_symbol (struct bfd_link_hash_entry *hash_entry,
2177 void *info ATTRIBUTE_UNUSED)
2179 if ((hash_entry->type == bfd_link_hash_defined
2180 || hash_entry->type == bfd_link_hash_defweak)
2181 && hash_entry->u.def.section->owner != link_info.output_bfd
2182 && hash_entry->u.def.section->owner != NULL)
2184 input_section_userdata_type *ud;
2185 struct map_symbol_def *def;
2187 ud = ((input_section_userdata_type *)
2188 get_userdata (hash_entry->u.def.section));
2191 ud = (input_section_userdata_type *) stat_alloc (sizeof (*ud));
2192 get_userdata (hash_entry->u.def.section) = ud;
2193 ud->map_symbol_def_tail = &ud->map_symbol_def_head;
2194 ud->map_symbol_def_count = 0;
2196 else if (!ud->map_symbol_def_tail)
2197 ud->map_symbol_def_tail = &ud->map_symbol_def_head;
2199 def = (struct map_symbol_def *) obstack_alloc (&map_obstack, sizeof *def);
2200 def->entry = hash_entry;
2201 *(ud->map_symbol_def_tail) = def;
2202 ud->map_symbol_def_tail = &def->next;
2203 ud->map_symbol_def_count++;
2208 /* Initialize an output section. */
2211 init_os (lang_output_section_statement_type *s, flagword flags)
2213 if (strcmp (s->name, DISCARD_SECTION_NAME) == 0)
2214 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME);
2216 if (s->constraint != SPECIAL)
2217 s->bfd_section = bfd_get_section_by_name (link_info.output_bfd, s->name);
2218 if (s->bfd_section == NULL)
2219 s->bfd_section = bfd_make_section_anyway_with_flags (link_info.output_bfd,
2221 if (s->bfd_section == NULL)
2223 einfo (_("%P%F: output format %s cannot represent section"
2224 " called %s: %E\n"),
2225 link_info.output_bfd->xvec->name, s->name);
2227 s->bfd_section->output_section = s->bfd_section;
2228 s->bfd_section->output_offset = 0;
2230 /* Set the userdata of the output section to the output section
2231 statement to avoid lookup. */
2232 get_userdata (s->bfd_section) = s;
2234 /* If there is a base address, make sure that any sections it might
2235 mention are initialized. */
2236 if (s->addr_tree != NULL)
2237 exp_init_os (s->addr_tree);
2239 if (s->load_base != NULL)
2240 exp_init_os (s->load_base);
2242 /* If supplied an alignment, set it. */
2243 if (s->section_alignment != -1)
2244 s->bfd_section->alignment_power = s->section_alignment;
2247 /* Make sure that all output sections mentioned in an expression are
2251 exp_init_os (etree_type *exp)
2253 switch (exp->type.node_class)
2257 exp_init_os (exp->assign.src);
2261 exp_init_os (exp->binary.lhs);
2262 exp_init_os (exp->binary.rhs);
2266 exp_init_os (exp->trinary.cond);
2267 exp_init_os (exp->trinary.lhs);
2268 exp_init_os (exp->trinary.rhs);
2272 exp_init_os (exp->assert_s.child);
2276 exp_init_os (exp->unary.child);
2280 switch (exp->type.node_code)
2286 lang_output_section_statement_type *os;
2288 os = lang_output_section_find (exp->name.name);
2289 if (os != NULL && os->bfd_section == NULL)
2301 section_already_linked (bfd *abfd, asection *sec, void *data)
2303 lang_input_statement_type *entry = (lang_input_statement_type *) data;
2305 /* If we are only reading symbols from this object, then we want to
2306 discard all sections. */
2307 if (entry->flags.just_syms)
2309 bfd_link_just_syms (abfd, sec, &link_info);
2313 /* Deal with SHF_EXCLUDE ELF sections. */
2314 if (!bfd_link_relocatable (&link_info)
2315 && (abfd->flags & BFD_PLUGIN) == 0
2316 && (sec->flags & (SEC_GROUP | SEC_KEEP | SEC_EXCLUDE)) == SEC_EXCLUDE)
2317 sec->output_section = bfd_abs_section_ptr;
2319 if (!(abfd->flags & DYNAMIC))
2320 bfd_section_already_linked (abfd, sec, &link_info);
2323 /* The wild routines.
2325 These expand statements like *(.text) and foo.o to a list of
2326 explicit actions, like foo.o(.text), bar.o(.text) and
2327 foo.o(.text, .data). */
2329 /* Add SECTION to the output section OUTPUT. Do this by creating a
2330 lang_input_section statement which is placed at PTR. */
2333 lang_add_section (lang_statement_list_type *ptr,
2335 struct flag_info *sflag_info,
2336 lang_output_section_statement_type *output)
2338 flagword flags = section->flags;
2340 bfd_boolean discard;
2341 lang_input_section_type *new_section;
2342 bfd *abfd = link_info.output_bfd;
2344 /* Discard sections marked with SEC_EXCLUDE. */
2345 discard = (flags & SEC_EXCLUDE) != 0;
2347 /* Discard input sections which are assigned to a section named
2348 DISCARD_SECTION_NAME. */
2349 if (strcmp (output->name, DISCARD_SECTION_NAME) == 0)
2352 /* Discard debugging sections if we are stripping debugging
2354 if ((link_info.strip == strip_debugger || link_info.strip == strip_all)
2355 && (flags & SEC_DEBUGGING) != 0)
2360 if (section->output_section == NULL)
2362 /* This prevents future calls from assigning this section. */
2363 section->output_section = bfd_abs_section_ptr;
2372 keep = bfd_lookup_section_flags (&link_info, sflag_info, section);
2377 if (section->output_section != NULL)
2380 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2381 to an output section, because we want to be able to include a
2382 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2383 section (I don't know why we want to do this, but we do).
2384 build_link_order in ldwrite.c handles this case by turning
2385 the embedded SEC_NEVER_LOAD section into a fill. */
2386 flags &= ~ SEC_NEVER_LOAD;
2388 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2389 already been processed. One reason to do this is that on pe
2390 format targets, .text$foo sections go into .text and it's odd
2391 to see .text with SEC_LINK_ONCE set. */
2393 if (!bfd_link_relocatable (&link_info))
2394 flags &= ~(SEC_LINK_ONCE | SEC_LINK_DUPLICATES | SEC_RELOC);
2396 switch (output->sectype)
2398 case normal_section:
2399 case overlay_section:
2401 case noalloc_section:
2402 flags &= ~SEC_ALLOC;
2404 case noload_section:
2406 flags |= SEC_NEVER_LOAD;
2407 /* Unfortunately GNU ld has managed to evolve two different
2408 meanings to NOLOAD in scripts. ELF gets a .bss style noload,
2409 alloc, no contents section. All others get a noload, noalloc
2411 if (bfd_get_flavour (link_info.output_bfd) == bfd_target_elf_flavour)
2412 flags &= ~SEC_HAS_CONTENTS;
2414 flags &= ~SEC_ALLOC;
2418 if (output->bfd_section == NULL)
2419 init_os (output, flags);
2421 /* If SEC_READONLY is not set in the input section, then clear
2422 it from the output section. */
2423 output->bfd_section->flags &= flags | ~SEC_READONLY;
2425 if (output->bfd_section->linker_has_input)
2427 /* Only set SEC_READONLY flag on the first input section. */
2428 flags &= ~ SEC_READONLY;
2430 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2431 if ((output->bfd_section->flags & (SEC_MERGE | SEC_STRINGS))
2432 != (flags & (SEC_MERGE | SEC_STRINGS))
2433 || ((flags & SEC_MERGE) != 0
2434 && output->bfd_section->entsize != section->entsize))
2436 output->bfd_section->flags &= ~ (SEC_MERGE | SEC_STRINGS);
2437 flags &= ~ (SEC_MERGE | SEC_STRINGS);
2440 output->bfd_section->flags |= flags;
2442 if (!output->bfd_section->linker_has_input)
2444 output->bfd_section->linker_has_input = 1;
2445 /* This must happen after flags have been updated. The output
2446 section may have been created before we saw its first input
2447 section, eg. for a data statement. */
2448 bfd_init_private_section_data (section->owner, section,
2449 link_info.output_bfd,
2450 output->bfd_section,
2452 if ((flags & SEC_MERGE) != 0)
2453 output->bfd_section->entsize = section->entsize;
2456 if ((flags & SEC_TIC54X_BLOCK) != 0
2457 && bfd_get_arch (section->owner) == bfd_arch_tic54x)
2459 /* FIXME: This value should really be obtained from the bfd... */
2460 output->block_value = 128;
2463 if (section->alignment_power > output->bfd_section->alignment_power)
2464 output->bfd_section->alignment_power = section->alignment_power;
2466 section->output_section = output->bfd_section;
2468 if (!map_head_is_link_order)
2470 asection *s = output->bfd_section->map_tail.s;
2471 output->bfd_section->map_tail.s = section;
2472 section->map_head.s = NULL;
2473 section->map_tail.s = s;
2475 s->map_head.s = section;
2477 output->bfd_section->map_head.s = section;
2480 /* Add a section reference to the list. */
2481 new_section = new_stat (lang_input_section, ptr);
2482 new_section->section = section;
2485 /* Handle wildcard sorting. This returns the lang_input_section which
2486 should follow the one we are going to create for SECTION and FILE,
2487 based on the sorting requirements of WILD. It returns NULL if the
2488 new section should just go at the end of the current list. */
2490 static lang_statement_union_type *
2491 wild_sort (lang_wild_statement_type *wild,
2492 struct wildcard_list *sec,
2493 lang_input_statement_type *file,
2496 lang_statement_union_type *l;
2498 if (!wild->filenames_sorted
2499 && (sec == NULL || sec->spec.sorted == none))
2502 for (l = wild->children.head; l != NULL; l = l->header.next)
2504 lang_input_section_type *ls;
2506 if (l->header.type != lang_input_section_enum)
2508 ls = &l->input_section;
2510 /* Sorting by filename takes precedence over sorting by section
2513 if (wild->filenames_sorted)
2515 const char *fn, *ln;
2519 /* The PE support for the .idata section as generated by
2520 dlltool assumes that files will be sorted by the name of
2521 the archive and then the name of the file within the
2524 if (file->the_bfd != NULL
2525 && file->the_bfd->my_archive != NULL)
2527 fn = bfd_get_filename (file->the_bfd->my_archive);
2532 fn = file->filename;
2536 if (ls->section->owner->my_archive != NULL)
2538 ln = bfd_get_filename (ls->section->owner->my_archive);
2543 ln = ls->section->owner->filename;
2547 i = filename_cmp (fn, ln);
2556 fn = file->filename;
2558 ln = ls->section->owner->filename;
2560 i = filename_cmp (fn, ln);
2568 /* Here either the files are not sorted by name, or we are
2569 looking at the sections for this file. */
2572 && sec->spec.sorted != none
2573 && sec->spec.sorted != by_none)
2574 if (compare_section (sec->spec.sorted, section, ls->section) < 0)
2581 /* Expand a wild statement for a particular FILE. SECTION may be
2582 NULL, in which case it is a wild card. */
2585 output_section_callback (lang_wild_statement_type *ptr,
2586 struct wildcard_list *sec,
2588 struct flag_info *sflag_info,
2589 lang_input_statement_type *file,
2592 lang_statement_union_type *before;
2593 lang_output_section_statement_type *os;
2595 os = (lang_output_section_statement_type *) output;
2597 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2598 if (unique_section_p (section, os))
2601 before = wild_sort (ptr, sec, file, section);
2603 /* Here BEFORE points to the lang_input_section which
2604 should follow the one we are about to add. If BEFORE
2605 is NULL, then the section should just go at the end
2606 of the current list. */
2609 lang_add_section (&ptr->children, section, sflag_info, os);
2612 lang_statement_list_type list;
2613 lang_statement_union_type **pp;
2615 lang_list_init (&list);
2616 lang_add_section (&list, section, sflag_info, os);
2618 /* If we are discarding the section, LIST.HEAD will
2620 if (list.head != NULL)
2622 ASSERT (list.head->header.next == NULL);
2624 for (pp = &ptr->children.head;
2626 pp = &(*pp)->header.next)
2627 ASSERT (*pp != NULL);
2629 list.head->header.next = *pp;
2635 /* Check if all sections in a wild statement for a particular FILE
2639 check_section_callback (lang_wild_statement_type *ptr ATTRIBUTE_UNUSED,
2640 struct wildcard_list *sec ATTRIBUTE_UNUSED,
2642 struct flag_info *sflag_info ATTRIBUTE_UNUSED,
2643 lang_input_statement_type *file ATTRIBUTE_UNUSED,
2646 lang_output_section_statement_type *os;
2648 os = (lang_output_section_statement_type *) output;
2650 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2651 if (unique_section_p (section, os))
2654 if (section->output_section == NULL && (section->flags & SEC_READONLY) == 0)
2655 os->all_input_readonly = FALSE;
2658 /* This is passed a file name which must have been seen already and
2659 added to the statement tree. We will see if it has been opened
2660 already and had its symbols read. If not then we'll read it. */
2662 static lang_input_statement_type *
2663 lookup_name (const char *name)
2665 lang_input_statement_type *search;
2667 for (search = (lang_input_statement_type *) input_file_chain.head;
2669 search = (lang_input_statement_type *) search->next_real_file)
2671 /* Use the local_sym_name as the name of the file that has
2672 already been loaded as filename might have been transformed
2673 via the search directory lookup mechanism. */
2674 const char *filename = search->local_sym_name;
2676 if (filename != NULL
2677 && filename_cmp (filename, name) == 0)
2682 search = new_afile (name, lang_input_file_is_search_file_enum,
2683 default_target, FALSE);
2685 /* If we have already added this file, or this file is not real
2686 don't add this file. */
2687 if (search->flags.loaded || !search->flags.real)
2690 if (!load_symbols (search, NULL))
2696 /* Save LIST as a list of libraries whose symbols should not be exported. */
2701 struct excluded_lib *next;
2703 static struct excluded_lib *excluded_libs;
2706 add_excluded_libs (const char *list)
2708 const char *p = list, *end;
2712 struct excluded_lib *entry;
2713 end = strpbrk (p, ",:");
2715 end = p + strlen (p);
2716 entry = (struct excluded_lib *) xmalloc (sizeof (*entry));
2717 entry->next = excluded_libs;
2718 entry->name = (char *) xmalloc (end - p + 1);
2719 memcpy (entry->name, p, end - p);
2720 entry->name[end - p] = '\0';
2721 excluded_libs = entry;
2729 check_excluded_libs (bfd *abfd)
2731 struct excluded_lib *lib = excluded_libs;
2735 int len = strlen (lib->name);
2736 const char *filename = lbasename (abfd->filename);
2738 if (strcmp (lib->name, "ALL") == 0)
2740 abfd->no_export = TRUE;
2744 if (filename_ncmp (lib->name, filename, len) == 0
2745 && (filename[len] == '\0'
2746 || (filename[len] == '.' && filename[len + 1] == 'a'
2747 && filename[len + 2] == '\0')))
2749 abfd->no_export = TRUE;
2757 /* Get the symbols for an input file. */
2760 load_symbols (lang_input_statement_type *entry,
2761 lang_statement_list_type *place)
2765 if (entry->flags.loaded)
2768 ldfile_open_file (entry);
2770 /* Do not process further if the file was missing. */
2771 if (entry->flags.missing_file)
2774 if (!bfd_check_format (entry->the_bfd, bfd_archive)
2775 && !bfd_check_format_matches (entry->the_bfd, bfd_object, &matching))
2778 struct lang_input_statement_flags save_flags;
2781 err = bfd_get_error ();
2783 /* See if the emulation has some special knowledge. */
2784 if (ldemul_unrecognized_file (entry))
2787 if (err == bfd_error_file_ambiguously_recognized)
2791 einfo (_("%B: file not recognized: %E\n"), entry->the_bfd);
2792 einfo (_("%B: matching formats:"), entry->the_bfd);
2793 for (p = matching; *p != NULL; p++)
2797 else if (err != bfd_error_file_not_recognized
2799 einfo (_("%F%B: file not recognized: %E\n"), entry->the_bfd);
2801 bfd_close (entry->the_bfd);
2802 entry->the_bfd = NULL;
2804 /* Try to interpret the file as a linker script. */
2805 save_flags = input_flags;
2806 ldfile_open_command_file (entry->filename);
2808 push_stat_ptr (place);
2809 input_flags.add_DT_NEEDED_for_regular
2810 = entry->flags.add_DT_NEEDED_for_regular;
2811 input_flags.add_DT_NEEDED_for_dynamic
2812 = entry->flags.add_DT_NEEDED_for_dynamic;
2813 input_flags.whole_archive = entry->flags.whole_archive;
2814 input_flags.dynamic = entry->flags.dynamic;
2816 ldfile_assumed_script = TRUE;
2817 parser_input = input_script;
2819 ldfile_assumed_script = FALSE;
2821 /* missing_file is sticky. sysrooted will already have been
2822 restored when seeing EOF in yyparse, but no harm to restore
2824 save_flags.missing_file |= input_flags.missing_file;
2825 input_flags = save_flags;
2829 entry->flags.loaded = TRUE;
2834 if (ldemul_recognized_file (entry))
2837 /* We don't call ldlang_add_file for an archive. Instead, the
2838 add_symbols entry point will call ldlang_add_file, via the
2839 add_archive_element callback, for each element of the archive
2841 switch (bfd_get_format (entry->the_bfd))
2847 if (!entry->flags.reload)
2848 ldlang_add_file (entry);
2849 if (trace_files || verbose)
2850 info_msg ("%I\n", entry);
2854 check_excluded_libs (entry->the_bfd);
2856 if (entry->flags.whole_archive)
2859 bfd_boolean loaded = TRUE;
2864 member = bfd_openr_next_archived_file (entry->the_bfd, member);
2869 if (!bfd_check_format (member, bfd_object))
2871 einfo (_("%F%B: member %B in archive is not an object\n"),
2872 entry->the_bfd, member);
2877 if (!(*link_info.callbacks
2878 ->add_archive_element) (&link_info, member,
2879 "--whole-archive", &subsbfd))
2882 /* Potentially, the add_archive_element hook may have set a
2883 substitute BFD for us. */
2884 if (!bfd_link_add_symbols (subsbfd, &link_info))
2886 einfo (_("%F%B: error adding symbols: %E\n"), member);
2891 entry->flags.loaded = loaded;
2897 if (bfd_link_add_symbols (entry->the_bfd, &link_info))
2898 entry->flags.loaded = TRUE;
2900 einfo (_("%F%B: error adding symbols: %E\n"), entry->the_bfd);
2902 return entry->flags.loaded;
2905 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2906 may be NULL, indicating that it is a wildcard. Separate
2907 lang_input_section statements are created for each part of the
2908 expansion; they are added after the wild statement S. OUTPUT is
2909 the output section. */
2912 wild (lang_wild_statement_type *s,
2913 const char *target ATTRIBUTE_UNUSED,
2914 lang_output_section_statement_type *output)
2916 struct wildcard_list *sec;
2918 if (s->handler_data[0]
2919 && s->handler_data[0]->spec.sorted == by_name
2920 && !s->filenames_sorted)
2922 lang_section_bst_type *tree;
2924 walk_wild (s, output_section_callback_fast, output);
2929 output_section_callback_tree_to_list (s, tree, output);
2934 walk_wild (s, output_section_callback, output);
2936 if (default_common_section == NULL)
2937 for (sec = s->section_list; sec != NULL; sec = sec->next)
2938 if (sec->spec.name != NULL && strcmp (sec->spec.name, "COMMON") == 0)
2940 /* Remember the section that common is going to in case we
2941 later get something which doesn't know where to put it. */
2942 default_common_section = output;
2947 /* Return TRUE iff target is the sought target. */
2950 get_target (const bfd_target *target, void *data)
2952 const char *sought = (const char *) data;
2954 return strcmp (target->name, sought) == 0;
2957 /* Like strcpy() but convert to lower case as well. */
2960 stricpy (char *dest, char *src)
2964 while ((c = *src++) != 0)
2965 *dest++ = TOLOWER (c);
2970 /* Remove the first occurrence of needle (if any) in haystack
2974 strcut (char *haystack, char *needle)
2976 haystack = strstr (haystack, needle);
2982 for (src = haystack + strlen (needle); *src;)
2983 *haystack++ = *src++;
2989 /* Compare two target format name strings.
2990 Return a value indicating how "similar" they are. */
2993 name_compare (char *first, char *second)
2999 copy1 = (char *) xmalloc (strlen (first) + 1);
3000 copy2 = (char *) xmalloc (strlen (second) + 1);
3002 /* Convert the names to lower case. */
3003 stricpy (copy1, first);
3004 stricpy (copy2, second);
3006 /* Remove size and endian strings from the name. */
3007 strcut (copy1, "big");
3008 strcut (copy1, "little");
3009 strcut (copy2, "big");
3010 strcut (copy2, "little");
3012 /* Return a value based on how many characters match,
3013 starting from the beginning. If both strings are
3014 the same then return 10 * their length. */
3015 for (result = 0; copy1[result] == copy2[result]; result++)
3016 if (copy1[result] == 0)
3028 /* Set by closest_target_match() below. */
3029 static const bfd_target *winner;
3031 /* Scan all the valid bfd targets looking for one that has the endianness
3032 requirement that was specified on the command line, and is the nearest
3033 match to the original output target. */
3036 closest_target_match (const bfd_target *target, void *data)
3038 const bfd_target *original = (const bfd_target *) data;
3040 if (command_line.endian == ENDIAN_BIG
3041 && target->byteorder != BFD_ENDIAN_BIG)
3044 if (command_line.endian == ENDIAN_LITTLE
3045 && target->byteorder != BFD_ENDIAN_LITTLE)
3048 /* Must be the same flavour. */
3049 if (target->flavour != original->flavour)
3052 /* Ignore generic big and little endian elf vectors. */
3053 if (strcmp (target->name, "elf32-big") == 0
3054 || strcmp (target->name, "elf64-big") == 0
3055 || strcmp (target->name, "elf32-little") == 0
3056 || strcmp (target->name, "elf64-little") == 0)
3059 /* If we have not found a potential winner yet, then record this one. */
3066 /* Oh dear, we now have two potential candidates for a successful match.
3067 Compare their names and choose the better one. */
3068 if (name_compare (target->name, original->name)
3069 > name_compare (winner->name, original->name))
3072 /* Keep on searching until wqe have checked them all. */
3076 /* Return the BFD target format of the first input file. */
3079 get_first_input_target (void)
3081 char *target = NULL;
3083 LANG_FOR_EACH_INPUT_STATEMENT (s)
3085 if (s->header.type == lang_input_statement_enum
3088 ldfile_open_file (s);
3090 if (s->the_bfd != NULL
3091 && bfd_check_format (s->the_bfd, bfd_object))
3093 target = bfd_get_target (s->the_bfd);
3105 lang_get_output_target (void)
3109 /* Has the user told us which output format to use? */
3110 if (output_target != NULL)
3111 return output_target;
3113 /* No - has the current target been set to something other than
3115 if (current_target != default_target && current_target != NULL)
3116 return current_target;
3118 /* No - can we determine the format of the first input file? */
3119 target = get_first_input_target ();
3123 /* Failed - use the default output target. */
3124 return default_target;
3127 /* Open the output file. */
3130 open_output (const char *name)
3132 output_target = lang_get_output_target ();
3134 /* Has the user requested a particular endianness on the command
3136 if (command_line.endian != ENDIAN_UNSET)
3138 /* Get the chosen target. */
3139 const bfd_target *target
3140 = bfd_iterate_over_targets (get_target, (void *) output_target);
3142 /* If the target is not supported, we cannot do anything. */
3145 enum bfd_endian desired_endian;
3147 if (command_line.endian == ENDIAN_BIG)
3148 desired_endian = BFD_ENDIAN_BIG;
3150 desired_endian = BFD_ENDIAN_LITTLE;
3152 /* See if the target has the wrong endianness. This should
3153 not happen if the linker script has provided big and
3154 little endian alternatives, but some scrips don't do
3156 if (target->byteorder != desired_endian)
3158 /* If it does, then see if the target provides
3159 an alternative with the correct endianness. */
3160 if (target->alternative_target != NULL
3161 && (target->alternative_target->byteorder == desired_endian))
3162 output_target = target->alternative_target->name;
3165 /* Try to find a target as similar as possible to
3166 the default target, but which has the desired
3167 endian characteristic. */
3168 bfd_iterate_over_targets (closest_target_match,
3171 /* Oh dear - we could not find any targets that
3172 satisfy our requirements. */
3174 einfo (_("%P: warning: could not find any targets"
3175 " that match endianness requirement\n"));
3177 output_target = winner->name;
3183 link_info.output_bfd = bfd_openw (name, output_target);
3185 if (link_info.output_bfd == NULL)
3187 if (bfd_get_error () == bfd_error_invalid_target)
3188 einfo (_("%P%F: target %s not found\n"), output_target);
3190 einfo (_("%P%F: cannot open output file %s: %E\n"), name);
3193 delete_output_file_on_failure = TRUE;
3195 if (!bfd_set_format (link_info.output_bfd, bfd_object))
3196 einfo (_("%P%F:%s: can not make object file: %E\n"), name);
3197 if (!bfd_set_arch_mach (link_info.output_bfd,
3198 ldfile_output_architecture,
3199 ldfile_output_machine))
3200 einfo (_("%P%F:%s: can not set architecture: %E\n"), name);
3202 link_info.hash = bfd_link_hash_table_create (link_info.output_bfd);
3203 if (link_info.hash == NULL)
3204 einfo (_("%P%F: can not create hash table: %E\n"));
3206 bfd_set_gp_size (link_info.output_bfd, g_switch_value);
3210 ldlang_open_output (lang_statement_union_type *statement)
3212 switch (statement->header.type)
3214 case lang_output_statement_enum:
3215 ASSERT (link_info.output_bfd == NULL);
3216 open_output (statement->output_statement.name);
3217 ldemul_set_output_arch ();
3218 if (config.magic_demand_paged
3219 && !bfd_link_relocatable (&link_info))
3220 link_info.output_bfd->flags |= D_PAGED;
3222 link_info.output_bfd->flags &= ~D_PAGED;
3223 if (config.text_read_only)
3224 link_info.output_bfd->flags |= WP_TEXT;
3226 link_info.output_bfd->flags &= ~WP_TEXT;
3227 if (link_info.traditional_format)
3228 link_info.output_bfd->flags |= BFD_TRADITIONAL_FORMAT;
3230 link_info.output_bfd->flags &= ~BFD_TRADITIONAL_FORMAT;
3233 case lang_target_statement_enum:
3234 current_target = statement->target_statement.target;
3244 unsigned x = bfd_arch_mach_octets_per_byte (ldfile_output_architecture,
3245 ldfile_output_machine);
3248 while ((x & 1) == 0)
3256 /* Open all the input files. */
3260 OPEN_BFD_NORMAL = 0,
3264 #ifdef ENABLE_PLUGINS
3265 static lang_input_statement_type *plugin_insert = NULL;
3269 open_input_bfds (lang_statement_union_type *s, enum open_bfd_mode mode)
3271 for (; s != NULL; s = s->header.next)
3273 switch (s->header.type)
3275 case lang_constructors_statement_enum:
3276 open_input_bfds (constructor_list.head, mode);
3278 case lang_output_section_statement_enum:
3279 open_input_bfds (s->output_section_statement.children.head, mode);
3281 case lang_wild_statement_enum:
3282 /* Maybe we should load the file's symbols. */
3283 if ((mode & OPEN_BFD_RESCAN) == 0
3284 && s->wild_statement.filename
3285 && !wildcardp (s->wild_statement.filename)
3286 && !archive_path (s->wild_statement.filename))
3287 lookup_name (s->wild_statement.filename);
3288 open_input_bfds (s->wild_statement.children.head, mode);
3290 case lang_group_statement_enum:
3292 struct bfd_link_hash_entry *undefs;
3294 /* We must continually search the entries in the group
3295 until no new symbols are added to the list of undefined
3300 undefs = link_info.hash->undefs_tail;
3301 open_input_bfds (s->group_statement.children.head,
3302 mode | OPEN_BFD_FORCE);
3304 while (undefs != link_info.hash->undefs_tail);
3307 case lang_target_statement_enum:
3308 current_target = s->target_statement.target;
3310 case lang_input_statement_enum:
3311 if (s->input_statement.flags.real)
3313 lang_statement_union_type **os_tail;
3314 lang_statement_list_type add;
3317 s->input_statement.target = current_target;
3319 /* If we are being called from within a group, and this
3320 is an archive which has already been searched, then
3321 force it to be researched unless the whole archive
3322 has been loaded already. Do the same for a rescan.
3323 Likewise reload --as-needed shared libs. */
3324 if (mode != OPEN_BFD_NORMAL
3325 #ifdef ENABLE_PLUGINS
3326 && ((mode & OPEN_BFD_RESCAN) == 0
3327 || plugin_insert == NULL)
3329 && s->input_statement.flags.loaded
3330 && (abfd = s->input_statement.the_bfd) != NULL
3331 && ((bfd_get_format (abfd) == bfd_archive
3332 && !s->input_statement.flags.whole_archive)
3333 || (bfd_get_format (abfd) == bfd_object
3334 && ((abfd->flags) & DYNAMIC) != 0
3335 && s->input_statement.flags.add_DT_NEEDED_for_regular
3336 && bfd_get_flavour (abfd) == bfd_target_elf_flavour
3337 && (elf_dyn_lib_class (abfd) & DYN_AS_NEEDED) != 0)))
3339 s->input_statement.flags.loaded = FALSE;
3340 s->input_statement.flags.reload = TRUE;
3343 os_tail = lang_output_section_statement.tail;
3344 lang_list_init (&add);
3346 if (!load_symbols (&s->input_statement, &add))
3347 config.make_executable = FALSE;
3349 if (add.head != NULL)
3351 /* If this was a script with output sections then
3352 tack any added statements on to the end of the
3353 list. This avoids having to reorder the output
3354 section statement list. Very likely the user
3355 forgot -T, and whatever we do here will not meet
3356 naive user expectations. */
3357 if (os_tail != lang_output_section_statement.tail)
3359 einfo (_("%P: warning: %s contains output sections;"
3360 " did you forget -T?\n"),
3361 s->input_statement.filename);
3362 *stat_ptr->tail = add.head;
3363 stat_ptr->tail = add.tail;
3367 *add.tail = s->header.next;
3368 s->header.next = add.head;
3372 #ifdef ENABLE_PLUGINS
3373 /* If we have found the point at which a plugin added new
3374 files, clear plugin_insert to enable archive rescan. */
3375 if (&s->input_statement == plugin_insert)
3376 plugin_insert = NULL;
3379 case lang_assignment_statement_enum:
3380 if (s->assignment_statement.exp->assign.defsym)
3381 /* This is from a --defsym on the command line. */
3382 exp_fold_tree_no_dot (s->assignment_statement.exp);
3389 /* Exit if any of the files were missing. */
3390 if (input_flags.missing_file)
3394 /* Add the supplied name to the symbol table as an undefined reference.
3395 This is a two step process as the symbol table doesn't even exist at
3396 the time the ld command line is processed. First we put the name
3397 on a list, then, once the output file has been opened, transfer the
3398 name to the symbol table. */
3400 typedef struct bfd_sym_chain ldlang_undef_chain_list_type;
3402 #define ldlang_undef_chain_list_head entry_symbol.next
3405 ldlang_add_undef (const char *const name, bfd_boolean cmdline)
3407 ldlang_undef_chain_list_type *new_undef;
3409 undef_from_cmdline = undef_from_cmdline || cmdline;
3410 new_undef = (ldlang_undef_chain_list_type *) stat_alloc (sizeof (*new_undef));
3411 new_undef->next = ldlang_undef_chain_list_head;
3412 ldlang_undef_chain_list_head = new_undef;
3414 new_undef->name = xstrdup (name);
3416 if (link_info.output_bfd != NULL)
3417 insert_undefined (new_undef->name);
3420 /* Insert NAME as undefined in the symbol table. */
3423 insert_undefined (const char *name)
3425 struct bfd_link_hash_entry *h;
3427 h = bfd_link_hash_lookup (link_info.hash, name, TRUE, FALSE, TRUE);
3429 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
3430 if (h->type == bfd_link_hash_new)
3432 h->type = bfd_link_hash_undefined;
3433 h->u.undef.abfd = NULL;
3434 bfd_link_add_undef (link_info.hash, h);
3438 /* Run through the list of undefineds created above and place them
3439 into the linker hash table as undefined symbols belonging to the
3443 lang_place_undefineds (void)
3445 ldlang_undef_chain_list_type *ptr;
3447 for (ptr = ldlang_undef_chain_list_head; ptr != NULL; ptr = ptr->next)
3448 insert_undefined (ptr->name);
3451 /* Structure used to build the list of symbols that the user has required
3454 struct require_defined_symbol
3457 struct require_defined_symbol *next;
3460 /* The list of symbols that the user has required be defined. */
3462 static struct require_defined_symbol *require_defined_symbol_list;
3464 /* Add a new symbol NAME to the list of symbols that are required to be
3468 ldlang_add_require_defined (const char *const name)
3470 struct require_defined_symbol *ptr;
3472 ldlang_add_undef (name, TRUE);
3473 ptr = (struct require_defined_symbol *) stat_alloc (sizeof (*ptr));
3474 ptr->next = require_defined_symbol_list;
3475 ptr->name = strdup (name);
3476 require_defined_symbol_list = ptr;
3479 /* Check that all symbols the user required to be defined, are defined,
3480 raise an error if we find a symbol that is not defined. */
3483 ldlang_check_require_defined_symbols (void)
3485 struct require_defined_symbol *ptr;
3487 for (ptr = require_defined_symbol_list; ptr != NULL; ptr = ptr->next)
3489 struct bfd_link_hash_entry *h;
3491 h = bfd_link_hash_lookup (link_info.hash, ptr->name,
3492 FALSE, FALSE, TRUE);
3494 || (h->type != bfd_link_hash_defined
3495 && h->type != bfd_link_hash_defweak))
3496 einfo(_("%P%X: required symbol `%s' not defined\n"), ptr->name);
3500 /* Check for all readonly or some readwrite sections. */
3503 check_input_sections
3504 (lang_statement_union_type *s,
3505 lang_output_section_statement_type *output_section_statement)
3507 for (; s != (lang_statement_union_type *) NULL; s = s->header.next)
3509 switch (s->header.type)
3511 case lang_wild_statement_enum:
3512 walk_wild (&s->wild_statement, check_section_callback,
3513 output_section_statement);
3514 if (!output_section_statement->all_input_readonly)
3517 case lang_constructors_statement_enum:
3518 check_input_sections (constructor_list.head,
3519 output_section_statement);
3520 if (!output_section_statement->all_input_readonly)
3523 case lang_group_statement_enum:
3524 check_input_sections (s->group_statement.children.head,
3525 output_section_statement);
3526 if (!output_section_statement->all_input_readonly)
3535 /* Update wildcard statements if needed. */
3538 update_wild_statements (lang_statement_union_type *s)
3540 struct wildcard_list *sec;
3542 switch (sort_section)
3552 for (; s != NULL; s = s->header.next)
3554 switch (s->header.type)
3559 case lang_wild_statement_enum:
3560 for (sec = s->wild_statement.section_list; sec != NULL;
3563 switch (sec->spec.sorted)
3566 sec->spec.sorted = sort_section;
3569 if (sort_section == by_alignment)
3570 sec->spec.sorted = by_name_alignment;
3573 if (sort_section == by_name)
3574 sec->spec.sorted = by_alignment_name;
3582 case lang_constructors_statement_enum:
3583 update_wild_statements (constructor_list.head);
3586 case lang_output_section_statement_enum:
3587 /* Don't sort .init/.fini sections. */
3588 if (strcmp (s->output_section_statement.name, ".init") != 0
3589 && strcmp (s->output_section_statement.name, ".fini") != 0)
3590 update_wild_statements
3591 (s->output_section_statement.children.head);
3594 case lang_group_statement_enum:
3595 update_wild_statements (s->group_statement.children.head);
3603 /* Open input files and attach to output sections. */
3606 map_input_to_output_sections
3607 (lang_statement_union_type *s, const char *target,
3608 lang_output_section_statement_type *os)
3610 for (; s != NULL; s = s->header.next)
3612 lang_output_section_statement_type *tos;
3615 switch (s->header.type)
3617 case lang_wild_statement_enum:
3618 wild (&s->wild_statement, target, os);
3620 case lang_constructors_statement_enum:
3621 map_input_to_output_sections (constructor_list.head,
3625 case lang_output_section_statement_enum:
3626 tos = &s->output_section_statement;
3627 if (tos->constraint != 0)
3629 if (tos->constraint != ONLY_IF_RW
3630 && tos->constraint != ONLY_IF_RO)
3632 tos->all_input_readonly = TRUE;
3633 check_input_sections (tos->children.head, tos);
3634 if (tos->all_input_readonly != (tos->constraint == ONLY_IF_RO))
3636 tos->constraint = -1;
3640 map_input_to_output_sections (tos->children.head,
3644 case lang_output_statement_enum:
3646 case lang_target_statement_enum:
3647 target = s->target_statement.target;
3649 case lang_group_statement_enum:
3650 map_input_to_output_sections (s->group_statement.children.head,
3654 case lang_data_statement_enum:
3655 /* Make sure that any sections mentioned in the expression
3657 exp_init_os (s->data_statement.exp);
3658 /* The output section gets CONTENTS, ALLOC and LOAD, but
3659 these may be overridden by the script. */
3660 flags = SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD;
3661 switch (os->sectype)
3663 case normal_section:
3664 case overlay_section:
3666 case noalloc_section:
3667 flags = SEC_HAS_CONTENTS;
3669 case noload_section:
3670 if (bfd_get_flavour (link_info.output_bfd)
3671 == bfd_target_elf_flavour)
3672 flags = SEC_NEVER_LOAD | SEC_ALLOC;
3674 flags = SEC_NEVER_LOAD | SEC_HAS_CONTENTS;
3677 if (os->bfd_section == NULL)
3678 init_os (os, flags);
3680 os->bfd_section->flags |= flags;
3682 case lang_input_section_enum:
3684 case lang_fill_statement_enum:
3685 case lang_object_symbols_statement_enum:
3686 case lang_reloc_statement_enum:
3687 case lang_padding_statement_enum:
3688 case lang_input_statement_enum:
3689 if (os != NULL && os->bfd_section == NULL)
3692 case lang_assignment_statement_enum:
3693 if (os != NULL && os->bfd_section == NULL)
3696 /* Make sure that any sections mentioned in the assignment
3698 exp_init_os (s->assignment_statement.exp);
3700 case lang_address_statement_enum:
3701 /* Mark the specified section with the supplied address.
3702 If this section was actually a segment marker, then the
3703 directive is ignored if the linker script explicitly
3704 processed the segment marker. Originally, the linker
3705 treated segment directives (like -Ttext on the
3706 command-line) as section directives. We honor the
3707 section directive semantics for backwards compatibilty;
3708 linker scripts that do not specifically check for
3709 SEGMENT_START automatically get the old semantics. */
3710 if (!s->address_statement.segment
3711 || !s->address_statement.segment->used)
3713 const char *name = s->address_statement.section_name;
3715 /* Create the output section statement here so that
3716 orphans with a set address will be placed after other
3717 script sections. If we let the orphan placement code
3718 place them in amongst other sections then the address
3719 will affect following script sections, which is
3720 likely to surprise naive users. */
3721 tos = lang_output_section_statement_lookup (name, 0, TRUE);
3722 tos->addr_tree = s->address_statement.address;
3723 if (tos->bfd_section == NULL)
3727 case lang_insert_statement_enum:
3733 /* An insert statement snips out all the linker statements from the
3734 start of the list and places them after the output section
3735 statement specified by the insert. This operation is complicated
3736 by the fact that we keep a doubly linked list of output section
3737 statements as well as the singly linked list of all statements. */
3740 process_insert_statements (void)
3742 lang_statement_union_type **s;
3743 lang_output_section_statement_type *first_os = NULL;
3744 lang_output_section_statement_type *last_os = NULL;
3745 lang_output_section_statement_type *os;
3747 /* "start of list" is actually the statement immediately after
3748 the special abs_section output statement, so that it isn't
3750 s = &lang_output_section_statement.head;
3751 while (*(s = &(*s)->header.next) != NULL)
3753 if ((*s)->header.type == lang_output_section_statement_enum)
3755 /* Keep pointers to the first and last output section
3756 statement in the sequence we may be about to move. */
3757 os = &(*s)->output_section_statement;
3759 ASSERT (last_os == NULL || last_os->next == os);
3762 /* Set constraint negative so that lang_output_section_find
3763 won't match this output section statement. At this
3764 stage in linking constraint has values in the range
3765 [-1, ONLY_IN_RW]. */
3766 last_os->constraint = -2 - last_os->constraint;
3767 if (first_os == NULL)
3770 else if ((*s)->header.type == lang_insert_statement_enum)
3772 lang_insert_statement_type *i = &(*s)->insert_statement;
3773 lang_output_section_statement_type *where;
3774 lang_statement_union_type **ptr;
3775 lang_statement_union_type *first;
3777 where = lang_output_section_find (i->where);
3778 if (where != NULL && i->is_before)
3781 where = where->prev;
3782 while (where != NULL && where->constraint < 0);
3786 einfo (_("%F%P: %s not found for insert\n"), i->where);
3790 /* Deal with reordering the output section statement list. */
3791 if (last_os != NULL)
3793 asection *first_sec, *last_sec;
3794 struct lang_output_section_statement_struct **next;
3796 /* Snip out the output sections we are moving. */
3797 first_os->prev->next = last_os->next;
3798 if (last_os->next == NULL)
3800 next = &first_os->prev->next;
3801 lang_output_section_statement.tail
3802 = (lang_statement_union_type **) next;
3805 last_os->next->prev = first_os->prev;
3806 /* Add them in at the new position. */
3807 last_os->next = where->next;
3808 if (where->next == NULL)
3810 next = &last_os->next;
3811 lang_output_section_statement.tail
3812 = (lang_statement_union_type **) next;
3815 where->next->prev = last_os;
3816 first_os->prev = where;
3817 where->next = first_os;
3819 /* Move the bfd sections in the same way. */
3822 for (os = first_os; os != NULL; os = os->next)
3824 os->constraint = -2 - os->constraint;
3825 if (os->bfd_section != NULL
3826 && os->bfd_section->owner != NULL)
3828 last_sec = os->bfd_section;
3829 if (first_sec == NULL)
3830 first_sec = last_sec;
3835 if (last_sec != NULL)
3837 asection *sec = where->bfd_section;
3839 sec = output_prev_sec_find (where);
3841 /* The place we want to insert must come after the
3842 sections we are moving. So if we find no
3843 section or if the section is the same as our
3844 last section, then no move is needed. */
3845 if (sec != NULL && sec != last_sec)
3847 /* Trim them off. */
3848 if (first_sec->prev != NULL)
3849 first_sec->prev->next = last_sec->next;
3851 link_info.output_bfd->sections = last_sec->next;
3852 if (last_sec->next != NULL)
3853 last_sec->next->prev = first_sec->prev;
3855 link_info.output_bfd->section_last = first_sec->prev;
3857 last_sec->next = sec->next;
3858 if (sec->next != NULL)
3859 sec->next->prev = last_sec;
3861 link_info.output_bfd->section_last = last_sec;
3862 first_sec->prev = sec;
3863 sec->next = first_sec;
3871 ptr = insert_os_after (where);
3872 /* Snip everything after the abs_section output statement we
3873 know is at the start of the list, up to and including
3874 the insert statement we are currently processing. */
3875 first = lang_output_section_statement.head->header.next;
3876 lang_output_section_statement.head->header.next = (*s)->header.next;
3877 /* Add them back where they belong. */
3880 statement_list.tail = s;
3882 s = &lang_output_section_statement.head;
3886 /* Undo constraint twiddling. */
3887 for (os = first_os; os != NULL; os = os->next)
3889 os->constraint = -2 - os->constraint;
3895 /* An output section might have been removed after its statement was
3896 added. For example, ldemul_before_allocation can remove dynamic
3897 sections if they turn out to be not needed. Clean them up here. */
3900 strip_excluded_output_sections (void)
3902 lang_output_section_statement_type *os;
3904 /* Run lang_size_sections (if not already done). */
3905 if (expld.phase != lang_mark_phase_enum)
3907 expld.phase = lang_mark_phase_enum;
3908 expld.dataseg.phase = exp_dataseg_none;
3909 one_lang_size_sections_pass (NULL, FALSE);
3910 lang_reset_memory_regions ();
3913 for (os = &lang_output_section_statement.head->output_section_statement;
3917 asection *output_section;
3918 bfd_boolean exclude;
3920 if (os->constraint < 0)
3923 output_section = os->bfd_section;
3924 if (output_section == NULL)
3927 exclude = (output_section->rawsize == 0
3928 && (output_section->flags & SEC_KEEP) == 0
3929 && !bfd_section_removed_from_list (link_info.output_bfd,
3932 /* Some sections have not yet been sized, notably .gnu.version,
3933 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3934 input sections, so don't drop output sections that have such
3935 input sections unless they are also marked SEC_EXCLUDE. */
3936 if (exclude && output_section->map_head.s != NULL)
3940 for (s = output_section->map_head.s; s != NULL; s = s->map_head.s)
3941 if ((s->flags & SEC_EXCLUDE) == 0
3942 && ((s->flags & SEC_LINKER_CREATED) != 0
3943 || link_info.emitrelocations))
3952 /* We don't set bfd_section to NULL since bfd_section of the
3953 removed output section statement may still be used. */
3954 if (!os->update_dot)
3956 output_section->flags |= SEC_EXCLUDE;
3957 bfd_section_list_remove (link_info.output_bfd, output_section);
3958 link_info.output_bfd->section_count--;
3963 /* Called from ldwrite to clear out asection.map_head and
3964 asection.map_tail for use as link_orders in ldwrite.
3965 FIXME: Except for sh64elf.em which starts creating link_orders in
3966 its after_allocation routine so needs to call it early. */
3969 lang_clear_os_map (void)
3971 lang_output_section_statement_type *os;
3973 if (map_head_is_link_order)
3976 for (os = &lang_output_section_statement.head->output_section_statement;
3980 asection *output_section;
3982 if (os->constraint < 0)
3985 output_section = os->bfd_section;
3986 if (output_section == NULL)
3989 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3990 output_section->map_head.link_order = NULL;
3991 output_section->map_tail.link_order = NULL;
3994 /* Stop future calls to lang_add_section from messing with map_head
3995 and map_tail link_order fields. */
3996 map_head_is_link_order = TRUE;
4000 print_output_section_statement
4001 (lang_output_section_statement_type *output_section_statement)
4003 asection *section = output_section_statement->bfd_section;
4006 if (output_section_statement != abs_output_section)
4008 minfo ("\n%s", output_section_statement->name);
4010 if (section != NULL)
4012 print_dot = section->vma;
4014 len = strlen (output_section_statement->name);
4015 if (len >= SECTION_NAME_MAP_LENGTH - 1)
4020 while (len < SECTION_NAME_MAP_LENGTH)
4026 minfo ("0x%V %W", section->vma, TO_ADDR (section->size));
4028 if (section->vma != section->lma)
4029 minfo (_(" load address 0x%V"), section->lma);
4031 if (output_section_statement->update_dot_tree != NULL)
4032 exp_fold_tree (output_section_statement->update_dot_tree,
4033 bfd_abs_section_ptr, &print_dot);
4039 print_statement_list (output_section_statement->children.head,
4040 output_section_statement);
4044 print_assignment (lang_assignment_statement_type *assignment,
4045 lang_output_section_statement_type *output_section)
4052 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
4055 if (assignment->exp->type.node_class == etree_assert)
4058 tree = assignment->exp->assert_s.child;
4062 const char *dst = assignment->exp->assign.dst;
4064 is_dot = (dst[0] == '.' && dst[1] == 0);
4066 expld.assign_name = dst;
4067 tree = assignment->exp->assign.src;
4070 osec = output_section->bfd_section;
4072 osec = bfd_abs_section_ptr;
4074 if (assignment->exp->type.node_class != etree_provide)
4075 exp_fold_tree (tree, osec, &print_dot);
4077 expld.result.valid_p = FALSE;
4079 if (expld.result.valid_p)
4083 if (assignment->exp->type.node_class == etree_assert
4085 || expld.assign_name != NULL)
4087 value = expld.result.value;
4089 if (expld.result.section != NULL)
4090 value += expld.result.section->vma;
4092 minfo ("0x%V", value);
4098 struct bfd_link_hash_entry *h;
4100 h = bfd_link_hash_lookup (link_info.hash, assignment->exp->assign.dst,
4101 FALSE, FALSE, TRUE);
4104 value = h->u.def.value;
4105 value += h->u.def.section->output_section->vma;
4106 value += h->u.def.section->output_offset;
4108 minfo ("[0x%V]", value);
4111 minfo ("[unresolved]");
4116 if (assignment->exp->type.node_class == etree_provide)
4117 minfo ("[!provide]");
4124 expld.assign_name = NULL;
4127 exp_print_tree (assignment->exp);
4132 print_input_statement (lang_input_statement_type *statm)
4134 if (statm->filename != NULL
4135 && (statm->the_bfd == NULL
4136 || (statm->the_bfd->flags & BFD_LINKER_CREATED) == 0))
4137 fprintf (config.map_file, "LOAD %s\n", statm->filename);
4140 /* Print all symbols defined in a particular section. This is called
4141 via bfd_link_hash_traverse, or by print_all_symbols. */
4144 print_one_symbol (struct bfd_link_hash_entry *hash_entry, void *ptr)
4146 asection *sec = (asection *) ptr;
4148 if ((hash_entry->type == bfd_link_hash_defined
4149 || hash_entry->type == bfd_link_hash_defweak)
4150 && sec == hash_entry->u.def.section)
4154 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
4157 (hash_entry->u.def.value
4158 + hash_entry->u.def.section->output_offset
4159 + hash_entry->u.def.section->output_section->vma));
4161 minfo (" %T\n", hash_entry->root.string);
4168 hash_entry_addr_cmp (const void *a, const void *b)
4170 const struct bfd_link_hash_entry *l = *(const struct bfd_link_hash_entry **)a;
4171 const struct bfd_link_hash_entry *r = *(const struct bfd_link_hash_entry **)b;
4173 if (l->u.def.value < r->u.def.value)
4175 else if (l->u.def.value > r->u.def.value)
4182 print_all_symbols (asection *sec)
4184 input_section_userdata_type *ud
4185 = (input_section_userdata_type *) get_userdata (sec);
4186 struct map_symbol_def *def;
4187 struct bfd_link_hash_entry **entries;
4193 *ud->map_symbol_def_tail = 0;
4195 /* Sort the symbols by address. */
4196 entries = (struct bfd_link_hash_entry **)
4197 obstack_alloc (&map_obstack,
4198 ud->map_symbol_def_count * sizeof (*entries));
4200 for (i = 0, def = ud->map_symbol_def_head; def; def = def->next, i++)
4201 entries[i] = def->entry;
4203 qsort (entries, ud->map_symbol_def_count, sizeof (*entries),
4204 hash_entry_addr_cmp);
4206 /* Print the symbols. */
4207 for (i = 0; i < ud->map_symbol_def_count; i++)
4208 print_one_symbol (entries[i], sec);
4210 obstack_free (&map_obstack, entries);
4213 /* Print information about an input section to the map file. */
4216 print_input_section (asection *i, bfd_boolean is_discarded)
4218 bfd_size_type size = i->size;
4225 minfo ("%s", i->name);
4227 len = 1 + strlen (i->name);
4228 if (len >= SECTION_NAME_MAP_LENGTH - 1)
4233 while (len < SECTION_NAME_MAP_LENGTH)
4239 if (i->output_section != NULL
4240 && i->output_section->owner == link_info.output_bfd)
4241 addr = i->output_section->vma + i->output_offset;
4249 minfo ("0x%V %W %B\n", addr, size, i->owner);
4251 if (size != i->rawsize && i->rawsize != 0)
4253 len = SECTION_NAME_MAP_LENGTH + 3;
4265 minfo (_("%W (size before relaxing)\n"), i->rawsize);
4268 if (i->output_section != NULL
4269 && i->output_section->owner == link_info.output_bfd)
4271 if (link_info.reduce_memory_overheads)
4272 bfd_link_hash_traverse (link_info.hash, print_one_symbol, i);
4274 print_all_symbols (i);
4276 /* Update print_dot, but make sure that we do not move it
4277 backwards - this could happen if we have overlays and a
4278 later overlay is shorter than an earier one. */
4279 if (addr + TO_ADDR (size) > print_dot)
4280 print_dot = addr + TO_ADDR (size);
4285 print_fill_statement (lang_fill_statement_type *fill)
4289 fputs (" FILL mask 0x", config.map_file);
4290 for (p = fill->fill->data, size = fill->fill->size; size != 0; p++, size--)
4291 fprintf (config.map_file, "%02x", *p);
4292 fputs ("\n", config.map_file);
4296 print_data_statement (lang_data_statement_type *data)
4304 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
4307 addr = data->output_offset;
4308 if (data->output_section != NULL)
4309 addr += data->output_section->vma;
4337 if (size < TO_SIZE ((unsigned) 1))
4338 size = TO_SIZE ((unsigned) 1);
4339 minfo ("0x%V %W %s 0x%v", addr, TO_ADDR (size), name, data->value);
4341 if (data->exp->type.node_class != etree_value)
4344 exp_print_tree (data->exp);
4349 print_dot = addr + TO_ADDR (size);
4352 /* Print an address statement. These are generated by options like
4356 print_address_statement (lang_address_statement_type *address)
4358 minfo (_("Address of section %s set to "), address->section_name);
4359 exp_print_tree (address->address);
4363 /* Print a reloc statement. */
4366 print_reloc_statement (lang_reloc_statement_type *reloc)
4373 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
4376 addr = reloc->output_offset;
4377 if (reloc->output_section != NULL)
4378 addr += reloc->output_section->vma;
4380 size = bfd_get_reloc_size (reloc->howto);
4382 minfo ("0x%V %W RELOC %s ", addr, TO_ADDR (size), reloc->howto->name);
4384 if (reloc->name != NULL)
4385 minfo ("%s+", reloc->name);
4387 minfo ("%s+", reloc->section->name);
4389 exp_print_tree (reloc->addend_exp);
4393 print_dot = addr + TO_ADDR (size);
4397 print_padding_statement (lang_padding_statement_type *s)
4405 len = sizeof " *fill*" - 1;
4406 while (len < SECTION_NAME_MAP_LENGTH)
4412 addr = s->output_offset;
4413 if (s->output_section != NULL)
4414 addr += s->output_section->vma;
4415 minfo ("0x%V %W ", addr, TO_ADDR (s->size));
4417 if (s->fill->size != 0)
4421 for (p = s->fill->data, size = s->fill->size; size != 0; p++, size--)
4422 fprintf (config.map_file, "%02x", *p);
4427 print_dot = addr + TO_ADDR (s->size);
4431 print_wild_statement (lang_wild_statement_type *w,
4432 lang_output_section_statement_type *os)
4434 struct wildcard_list *sec;
4438 if (w->exclude_name_list)
4441 minfo ("EXCLUDE_FILE(%s", w->exclude_name_list->name);
4442 for (tmp = w->exclude_name_list->next; tmp; tmp = tmp->next)
4443 minfo (" %s", tmp->name);
4447 if (w->filenames_sorted)
4449 if (w->filename != NULL)
4450 minfo ("%s", w->filename);
4453 if (w->filenames_sorted)
4457 for (sec = w->section_list; sec; sec = sec->next)
4459 if (sec->spec.sorted)
4461 if (sec->spec.exclude_name_list != NULL)
4464 minfo ("EXCLUDE_FILE(%s", sec->spec.exclude_name_list->name);
4465 for (tmp = sec->spec.exclude_name_list->next; tmp; tmp = tmp->next)
4466 minfo (" %s", tmp->name);
4469 if (sec->spec.name != NULL)
4470 minfo ("%s", sec->spec.name);
4473 if (sec->spec.sorted)
4482 print_statement_list (w->children.head, os);
4485 /* Print a group statement. */
4488 print_group (lang_group_statement_type *s,
4489 lang_output_section_statement_type *os)
4491 fprintf (config.map_file, "START GROUP\n");
4492 print_statement_list (s->children.head, os);
4493 fprintf (config.map_file, "END GROUP\n");
4496 /* Print the list of statements in S.
4497 This can be called for any statement type. */
4500 print_statement_list (lang_statement_union_type *s,
4501 lang_output_section_statement_type *os)
4505 print_statement (s, os);
4510 /* Print the first statement in statement list S.
4511 This can be called for any statement type. */
4514 print_statement (lang_statement_union_type *s,
4515 lang_output_section_statement_type *os)
4517 switch (s->header.type)
4520 fprintf (config.map_file, _("Fail with %d\n"), s->header.type);
4523 case lang_constructors_statement_enum:
4524 if (constructor_list.head != NULL)
4526 if (constructors_sorted)
4527 minfo (" SORT (CONSTRUCTORS)\n");
4529 minfo (" CONSTRUCTORS\n");
4530 print_statement_list (constructor_list.head, os);
4533 case lang_wild_statement_enum:
4534 print_wild_statement (&s->wild_statement, os);
4536 case lang_address_statement_enum:
4537 print_address_statement (&s->address_statement);
4539 case lang_object_symbols_statement_enum:
4540 minfo (" CREATE_OBJECT_SYMBOLS\n");
4542 case lang_fill_statement_enum:
4543 print_fill_statement (&s->fill_statement);
4545 case lang_data_statement_enum:
4546 print_data_statement (&s->data_statement);
4548 case lang_reloc_statement_enum:
4549 print_reloc_statement (&s->reloc_statement);
4551 case lang_input_section_enum:
4552 print_input_section (s->input_section.section, FALSE);
4554 case lang_padding_statement_enum:
4555 print_padding_statement (&s->padding_statement);
4557 case lang_output_section_statement_enum:
4558 print_output_section_statement (&s->output_section_statement);
4560 case lang_assignment_statement_enum:
4561 print_assignment (&s->assignment_statement, os);
4563 case lang_target_statement_enum:
4564 fprintf (config.map_file, "TARGET(%s)\n", s->target_statement.target);
4566 case lang_output_statement_enum:
4567 minfo ("OUTPUT(%s", s->output_statement.name);
4568 if (output_target != NULL)
4569 minfo (" %s", output_target);
4572 case lang_input_statement_enum:
4573 print_input_statement (&s->input_statement);
4575 case lang_group_statement_enum:
4576 print_group (&s->group_statement, os);
4578 case lang_insert_statement_enum:
4579 minfo ("INSERT %s %s\n",
4580 s->insert_statement.is_before ? "BEFORE" : "AFTER",
4581 s->insert_statement.where);
4587 print_statements (void)
4589 print_statement_list (statement_list.head, abs_output_section);
4592 /* Print the first N statements in statement list S to STDERR.
4593 If N == 0, nothing is printed.
4594 If N < 0, the entire list is printed.
4595 Intended to be called from GDB. */
4598 dprint_statement (lang_statement_union_type *s, int n)
4600 FILE *map_save = config.map_file;
4602 config.map_file = stderr;
4605 print_statement_list (s, abs_output_section);
4608 while (s && --n >= 0)
4610 print_statement (s, abs_output_section);
4615 config.map_file = map_save;
4619 insert_pad (lang_statement_union_type **ptr,
4621 bfd_size_type alignment_needed,
4622 asection *output_section,
4625 static fill_type zero_fill;
4626 lang_statement_union_type *pad = NULL;
4628 if (ptr != &statement_list.head)
4629 pad = ((lang_statement_union_type *)
4630 ((char *) ptr - offsetof (lang_statement_union_type, header.next)));
4632 && pad->header.type == lang_padding_statement_enum
4633 && pad->padding_statement.output_section == output_section)
4635 /* Use the existing pad statement. */
4637 else if ((pad = *ptr) != NULL
4638 && pad->header.type == lang_padding_statement_enum
4639 && pad->padding_statement.output_section == output_section)
4641 /* Use the existing pad statement. */
4645 /* Make a new padding statement, linked into existing chain. */
4646 pad = (lang_statement_union_type *)
4647 stat_alloc (sizeof (lang_padding_statement_type));
4648 pad->header.next = *ptr;
4650 pad->header.type = lang_padding_statement_enum;
4651 pad->padding_statement.output_section = output_section;
4654 pad->padding_statement.fill = fill;
4656 pad->padding_statement.output_offset = dot - output_section->vma;
4657 pad->padding_statement.size = alignment_needed;
4658 output_section->size = TO_SIZE (dot + TO_ADDR (alignment_needed)
4659 - output_section->vma);
4662 /* Work out how much this section will move the dot point. */
4666 (lang_statement_union_type **this_ptr,
4667 lang_output_section_statement_type *output_section_statement,
4671 lang_input_section_type *is = &((*this_ptr)->input_section);
4672 asection *i = is->section;
4673 asection *o = output_section_statement->bfd_section;
4675 if (i->sec_info_type == SEC_INFO_TYPE_JUST_SYMS)
4676 i->output_offset = i->vma - o->vma;
4677 else if ((i->flags & SEC_EXCLUDE) != 0)
4678 i->output_offset = dot - o->vma;
4681 bfd_size_type alignment_needed;
4683 /* Align this section first to the input sections requirement,
4684 then to the output section's requirement. If this alignment
4685 is greater than any seen before, then record it too. Perform
4686 the alignment by inserting a magic 'padding' statement. */
4688 if (output_section_statement->subsection_alignment != -1)
4689 i->alignment_power = output_section_statement->subsection_alignment;
4691 if (o->alignment_power < i->alignment_power)
4692 o->alignment_power = i->alignment_power;
4694 alignment_needed = align_power (dot, i->alignment_power) - dot;
4696 if (alignment_needed != 0)
4698 insert_pad (this_ptr, fill, TO_SIZE (alignment_needed), o, dot);
4699 dot += alignment_needed;
4702 /* Remember where in the output section this input section goes. */
4703 i->output_offset = dot - o->vma;
4705 /* Mark how big the output section must be to contain this now. */
4706 dot += TO_ADDR (i->size);
4707 o->size = TO_SIZE (dot - o->vma);
4720 sort_sections_by_lma (const void *arg1, const void *arg2)
4722 const asection *sec1 = ((const struct check_sec *) arg1)->sec;
4723 const asection *sec2 = ((const struct check_sec *) arg2)->sec;
4725 if (sec1->lma < sec2->lma)
4727 else if (sec1->lma > sec2->lma)
4729 else if (sec1->id < sec2->id)
4731 else if (sec1->id > sec2->id)
4738 sort_sections_by_vma (const void *arg1, const void *arg2)
4740 const asection *sec1 = ((const struct check_sec *) arg1)->sec;
4741 const asection *sec2 = ((const struct check_sec *) arg2)->sec;
4743 if (sec1->vma < sec2->vma)
4745 else if (sec1->vma > sec2->vma)
4747 else if (sec1->id < sec2->id)
4749 else if (sec1->id > sec2->id)
4755 #define IS_TBSS(s) \
4756 ((s->flags & (SEC_LOAD | SEC_THREAD_LOCAL)) == SEC_THREAD_LOCAL)
4758 #define IGNORE_SECTION(s) \
4759 ((s->flags & SEC_ALLOC) == 0 || IS_TBSS (s))
4761 /* Check to see if any allocated sections overlap with other allocated
4762 sections. This can happen if a linker script specifies the output
4763 section addresses of the two sections. Also check whether any memory
4764 region has overflowed. */
4767 lang_check_section_addresses (void)
4770 struct check_sec *sections;
4774 bfd_vma p_start = 0;
4776 lang_memory_region_type *m;
4777 bfd_boolean overlays;
4779 if (bfd_count_sections (link_info.output_bfd) <= 1)
4782 count = bfd_count_sections (link_info.output_bfd);
4783 sections = XNEWVEC (struct check_sec, count);
4785 /* Scan all sections in the output list. */
4787 for (s = link_info.output_bfd->sections; s != NULL; s = s->next)
4789 if (IGNORE_SECTION (s)
4793 sections[count].sec = s;
4794 sections[count].warned = FALSE;
4804 qsort (sections, count, sizeof (*sections), sort_sections_by_lma);
4806 /* First check section LMAs. There should be no overlap of LMAs on
4807 loadable sections, even with overlays. */
4808 for (p = NULL, i = 0; i < count; i++)
4810 s = sections[i].sec;
4811 if ((s->flags & SEC_LOAD) != 0)
4814 s_end = s_start + TO_ADDR (s->size) - 1;
4816 /* Look for an overlap. We have sorted sections by lma, so
4817 we know that s_start >= p_start. Besides the obvious
4818 case of overlap when the current section starts before
4819 the previous one ends, we also must have overlap if the
4820 previous section wraps around the address space. */
4822 && (s_start <= p_end
4823 || p_end < p_start))
4825 einfo (_("%X%P: section %s LMA [%V,%V]"
4826 " overlaps section %s LMA [%V,%V]\n"),
4827 s->name, s_start, s_end, p->name, p_start, p_end);
4828 sections[i].warned = TRUE;
4836 /* If any non-zero size allocated section (excluding tbss) starts at
4837 exactly the same VMA as another such section, then we have
4838 overlays. Overlays generated by the OVERLAY keyword will have
4839 this property. It is possible to intentionally generate overlays
4840 that fail this test, but it would be unusual. */
4841 qsort (sections, count, sizeof (*sections), sort_sections_by_vma);
4843 p_start = sections[0].sec->vma;
4844 for (i = 1; i < count; i++)
4846 s_start = sections[i].sec->vma;
4847 if (p_start == s_start)
4855 /* Now check section VMAs if no overlays were detected. */
4858 for (p = NULL, i = 0; i < count; i++)
4860 s = sections[i].sec;
4862 s_end = s_start + TO_ADDR (s->size) - 1;
4865 && !sections[i].warned
4866 && (s_start <= p_end
4867 || p_end < p_start))
4868 einfo (_("%X%P: section %s VMA [%V,%V]"
4869 " overlaps section %s VMA [%V,%V]\n"),
4870 s->name, s_start, s_end, p->name, p_start, p_end);
4879 /* If any memory region has overflowed, report by how much.
4880 We do not issue this diagnostic for regions that had sections
4881 explicitly placed outside their bounds; os_region_check's
4882 diagnostics are adequate for that case.
4884 FIXME: It is conceivable that m->current - (m->origin + m->length)
4885 might overflow a 32-bit integer. There is, alas, no way to print
4886 a bfd_vma quantity in decimal. */
4887 for (m = lang_memory_region_list; m; m = m->next)
4888 if (m->had_full_message)
4889 einfo (_("%X%P: region `%s' overflowed by %ld bytes\n"),
4890 m->name_list.name, (long)(m->current - (m->origin + m->length)));
4893 /* Make sure the new address is within the region. We explicitly permit the
4894 current address to be at the exact end of the region when the address is
4895 non-zero, in case the region is at the end of addressable memory and the
4896 calculation wraps around. */
4899 os_region_check (lang_output_section_statement_type *os,
4900 lang_memory_region_type *region,
4904 if ((region->current < region->origin
4905 || (region->current - region->origin > region->length))
4906 && ((region->current != region->origin + region->length)
4911 einfo (_("%X%P: address 0x%v of %B section `%s'"
4912 " is not within region `%s'\n"),
4914 os->bfd_section->owner,
4915 os->bfd_section->name,
4916 region->name_list.name);
4918 else if (!region->had_full_message)
4920 region->had_full_message = TRUE;
4922 einfo (_("%X%P: %B section `%s' will not fit in region `%s'\n"),
4923 os->bfd_section->owner,
4924 os->bfd_section->name,
4925 region->name_list.name);
4930 /* Set the sizes for all the output sections. */
4933 lang_size_sections_1
4934 (lang_statement_union_type **prev,
4935 lang_output_section_statement_type *output_section_statement,
4939 bfd_boolean check_regions)
4941 lang_statement_union_type *s;
4943 /* Size up the sections from their constituent parts. */
4944 for (s = *prev; s != NULL; s = s->header.next)
4946 switch (s->header.type)
4948 case lang_output_section_statement_enum:
4950 bfd_vma newdot, after, dotdelta;
4951 lang_output_section_statement_type *os;
4952 lang_memory_region_type *r;
4953 int section_alignment = 0;
4955 os = &s->output_section_statement;
4956 if (os->constraint == -1)
4959 /* FIXME: We shouldn't need to zero section vmas for ld -r
4960 here, in lang_insert_orphan, or in the default linker scripts.
4961 This is covering for coff backend linker bugs. See PR6945. */
4962 if (os->addr_tree == NULL
4963 && bfd_link_relocatable (&link_info)
4964 && (bfd_get_flavour (link_info.output_bfd)
4965 == bfd_target_coff_flavour))
4966 os->addr_tree = exp_intop (0);
4967 if (os->addr_tree != NULL)
4969 os->processed_vma = FALSE;
4970 exp_fold_tree (os->addr_tree, bfd_abs_section_ptr, &dot);
4972 if (expld.result.valid_p)
4974 dot = expld.result.value;
4975 if (expld.result.section != NULL)
4976 dot += expld.result.section->vma;
4978 else if (expld.phase != lang_mark_phase_enum)
4979 einfo (_("%F%S: non constant or forward reference"
4980 " address expression for section %s\n"),
4981 os->addr_tree, os->name);
4984 if (os->bfd_section == NULL)
4985 /* This section was removed or never actually created. */
4988 /* If this is a COFF shared library section, use the size and
4989 address from the input section. FIXME: This is COFF
4990 specific; it would be cleaner if there were some other way
4991 to do this, but nothing simple comes to mind. */
4992 if (((bfd_get_flavour (link_info.output_bfd)
4993 == bfd_target_ecoff_flavour)
4994 || (bfd_get_flavour (link_info.output_bfd)
4995 == bfd_target_coff_flavour))
4996 && (os->bfd_section->flags & SEC_COFF_SHARED_LIBRARY) != 0)
5000 if (os->children.head == NULL
5001 || os->children.head->header.next != NULL
5002 || (os->children.head->header.type
5003 != lang_input_section_enum))
5004 einfo (_("%P%X: Internal error on COFF shared library"
5005 " section %s\n"), os->name);
5007 input = os->children.head->input_section.section;
5008 bfd_set_section_vma (os->bfd_section->owner,
5010 bfd_section_vma (input->owner, input));
5011 os->bfd_section->size = input->size;
5017 if (bfd_is_abs_section (os->bfd_section))
5019 /* No matter what happens, an abs section starts at zero. */
5020 ASSERT (os->bfd_section->vma == 0);
5024 if (os->addr_tree == NULL)
5026 /* No address specified for this section, get one
5027 from the region specification. */
5028 if (os->region == NULL
5029 || ((os->bfd_section->flags & (SEC_ALLOC | SEC_LOAD))
5030 && os->region->name_list.name[0] == '*'
5031 && strcmp (os->region->name_list.name,
5032 DEFAULT_MEMORY_REGION) == 0))
5034 os->region = lang_memory_default (os->bfd_section);
5037 /* If a loadable section is using the default memory
5038 region, and some non default memory regions were
5039 defined, issue an error message. */
5041 && !IGNORE_SECTION (os->bfd_section)
5042 && !bfd_link_relocatable (&link_info)
5044 && strcmp (os->region->name_list.name,
5045 DEFAULT_MEMORY_REGION) == 0
5046 && lang_memory_region_list != NULL
5047 && (strcmp (lang_memory_region_list->name_list.name,
5048 DEFAULT_MEMORY_REGION) != 0
5049 || lang_memory_region_list->next != NULL)
5050 && expld.phase != lang_mark_phase_enum)
5052 /* By default this is an error rather than just a
5053 warning because if we allocate the section to the
5054 default memory region we can end up creating an
5055 excessively large binary, or even seg faulting when
5056 attempting to perform a negative seek. See
5057 sources.redhat.com/ml/binutils/2003-04/msg00423.html
5058 for an example of this. This behaviour can be
5059 overridden by the using the --no-check-sections
5061 if (command_line.check_section_addresses)
5062 einfo (_("%P%F: error: no memory region specified"
5063 " for loadable section `%s'\n"),
5064 bfd_get_section_name (link_info.output_bfd,
5067 einfo (_("%P: warning: no memory region specified"
5068 " for loadable section `%s'\n"),
5069 bfd_get_section_name (link_info.output_bfd,
5073 newdot = os->region->current;
5074 section_alignment = os->bfd_section->alignment_power;
5077 section_alignment = os->section_alignment;
5079 /* Align to what the section needs. */
5080 if (section_alignment > 0)
5082 bfd_vma savedot = newdot;
5083 newdot = align_power (newdot, section_alignment);
5085 dotdelta = newdot - savedot;
5087 && (config.warn_section_align
5088 || os->addr_tree != NULL)
5089 && expld.phase != lang_mark_phase_enum)
5090 einfo (_("%P: warning: changing start of section"
5091 " %s by %lu bytes\n"),
5092 os->name, (unsigned long) dotdelta);
5095 bfd_set_section_vma (0, os->bfd_section, newdot);
5097 os->bfd_section->output_offset = 0;
5100 lang_size_sections_1 (&os->children.head, os,
5101 os->fill, newdot, relax, check_regions);
5103 os->processed_vma = TRUE;
5105 if (bfd_is_abs_section (os->bfd_section) || os->ignored)
5106 /* Except for some special linker created sections,
5107 no output section should change from zero size
5108 after strip_excluded_output_sections. A non-zero
5109 size on an ignored section indicates that some
5110 input section was not sized early enough. */
5111 ASSERT (os->bfd_section->size == 0);
5114 dot = os->bfd_section->vma;
5116 /* Put the section within the requested block size, or
5117 align at the block boundary. */
5119 + TO_ADDR (os->bfd_section->size)
5120 + os->block_value - 1)
5121 & - (bfd_vma) os->block_value);
5123 os->bfd_section->size = TO_SIZE (after - os->bfd_section->vma);
5126 /* Set section lma. */
5129 r = lang_memory_region_lookup (DEFAULT_MEMORY_REGION, FALSE);
5133 bfd_vma lma = exp_get_abs_int (os->load_base, 0, "load base");
5134 os->bfd_section->lma = lma;
5136 else if (os->lma_region != NULL)
5138 bfd_vma lma = os->lma_region->current;
5140 if (os->align_lma_with_input)
5144 /* When LMA_REGION is the same as REGION, align the LMA
5145 as we did for the VMA, possibly including alignment
5146 from the bfd section. If a different region, then
5147 only align according to the value in the output
5149 if (os->lma_region != os->region)
5150 section_alignment = os->section_alignment;
5151 if (section_alignment > 0)
5152 lma = align_power (lma, section_alignment);
5154 os->bfd_section->lma = lma;
5156 else if (r->last_os != NULL
5157 && (os->bfd_section->flags & SEC_ALLOC) != 0)
5162 last = r->last_os->output_section_statement.bfd_section;
5164 /* A backwards move of dot should be accompanied by
5165 an explicit assignment to the section LMA (ie.
5166 os->load_base set) because backwards moves can
5167 create overlapping LMAs. */
5169 && os->bfd_section->size != 0
5170 && dot + TO_ADDR (os->bfd_section->size) <= last->vma)
5172 /* If dot moved backwards then leave lma equal to
5173 vma. This is the old default lma, which might
5174 just happen to work when the backwards move is
5175 sufficiently large. Nag if this changes anything,
5176 so people can fix their linker scripts. */
5178 if (last->vma != last->lma)
5179 einfo (_("%P: warning: dot moved backwards "
5180 "before `%s'\n"), os->name);
5184 /* If this is an overlay, set the current lma to that
5185 at the end of the previous section. */
5186 if (os->sectype == overlay_section)
5187 lma = last->lma + TO_ADDR (last->size);
5189 /* Otherwise, keep the same lma to vma relationship
5190 as the previous section. */
5192 lma = dot + last->lma - last->vma;
5194 if (section_alignment > 0)
5195 lma = align_power (lma, section_alignment);
5196 os->bfd_section->lma = lma;
5199 os->processed_lma = TRUE;
5201 if (bfd_is_abs_section (os->bfd_section) || os->ignored)
5204 /* Keep track of normal sections using the default
5205 lma region. We use this to set the lma for
5206 following sections. Overlays or other linker
5207 script assignment to lma might mean that the
5208 default lma == vma is incorrect.
5209 To avoid warnings about dot moving backwards when using
5210 -Ttext, don't start tracking sections until we find one
5211 of non-zero size or with lma set differently to vma. */
5212 if (!IGNORE_SECTION (os->bfd_section)
5213 && (os->bfd_section->size != 0
5214 || (r->last_os == NULL
5215 && os->bfd_section->vma != os->bfd_section->lma)
5216 || (r->last_os != NULL
5217 && dot >= (r->last_os->output_section_statement
5218 .bfd_section->vma)))
5219 && os->lma_region == NULL
5220 && !bfd_link_relocatable (&link_info))
5223 /* .tbss sections effectively have zero size. */
5224 if (!IS_TBSS (os->bfd_section)
5225 || bfd_link_relocatable (&link_info))
5226 dotdelta = TO_ADDR (os->bfd_section->size);
5231 if (os->update_dot_tree != 0)
5232 exp_fold_tree (os->update_dot_tree, bfd_abs_section_ptr, &dot);
5234 /* Update dot in the region ?
5235 We only do this if the section is going to be allocated,
5236 since unallocated sections do not contribute to the region's
5237 overall size in memory. */
5238 if (os->region != NULL
5239 && (os->bfd_section->flags & (SEC_ALLOC | SEC_LOAD)))
5241 os->region->current = dot;
5244 /* Make sure the new address is within the region. */
5245 os_region_check (os, os->region, os->addr_tree,
5246 os->bfd_section->vma);
5248 if (os->lma_region != NULL && os->lma_region != os->region
5249 && ((os->bfd_section->flags & SEC_LOAD)
5250 || os->align_lma_with_input))
5252 os->lma_region->current = os->bfd_section->lma + dotdelta;
5255 os_region_check (os, os->lma_region, NULL,
5256 os->bfd_section->lma);
5262 case lang_constructors_statement_enum:
5263 dot = lang_size_sections_1 (&constructor_list.head,
5264 output_section_statement,
5265 fill, dot, relax, check_regions);
5268 case lang_data_statement_enum:
5270 unsigned int size = 0;
5272 s->data_statement.output_offset =
5273 dot - output_section_statement->bfd_section->vma;
5274 s->data_statement.output_section =
5275 output_section_statement->bfd_section;
5277 /* We might refer to provided symbols in the expression, and
5278 need to mark them as needed. */
5279 exp_fold_tree (s->data_statement.exp, bfd_abs_section_ptr, &dot);
5281 switch (s->data_statement.type)
5299 if (size < TO_SIZE ((unsigned) 1))
5300 size = TO_SIZE ((unsigned) 1);
5301 dot += TO_ADDR (size);
5302 output_section_statement->bfd_section->size
5303 = TO_SIZE (dot - output_section_statement->bfd_section->vma);
5308 case lang_reloc_statement_enum:
5312 s->reloc_statement.output_offset =
5313 dot - output_section_statement->bfd_section->vma;
5314 s->reloc_statement.output_section =
5315 output_section_statement->bfd_section;
5316 size = bfd_get_reloc_size (s->reloc_statement.howto);
5317 dot += TO_ADDR (size);
5318 output_section_statement->bfd_section->size
5319 = TO_SIZE (dot - output_section_statement->bfd_section->vma);
5323 case lang_wild_statement_enum:
5324 dot = lang_size_sections_1 (&s->wild_statement.children.head,
5325 output_section_statement,
5326 fill, dot, relax, check_regions);
5329 case lang_object_symbols_statement_enum:
5330 link_info.create_object_symbols_section =
5331 output_section_statement->bfd_section;
5334 case lang_output_statement_enum:
5335 case lang_target_statement_enum:
5338 case lang_input_section_enum:
5342 i = s->input_section.section;
5347 if (!bfd_relax_section (i->owner, i, &link_info, &again))
5348 einfo (_("%P%F: can't relax section: %E\n"));
5352 dot = size_input_section (prev, output_section_statement,
5357 case lang_input_statement_enum:
5360 case lang_fill_statement_enum:
5361 s->fill_statement.output_section =
5362 output_section_statement->bfd_section;
5364 fill = s->fill_statement.fill;
5367 case lang_assignment_statement_enum:
5369 bfd_vma newdot = dot;
5370 etree_type *tree = s->assignment_statement.exp;
5372 expld.dataseg.relro = exp_dataseg_relro_none;
5374 exp_fold_tree (tree,
5375 output_section_statement->bfd_section,
5378 if (expld.dataseg.relro == exp_dataseg_relro_start)
5380 if (!expld.dataseg.relro_start_stat)
5381 expld.dataseg.relro_start_stat = s;
5384 ASSERT (expld.dataseg.relro_start_stat == s);
5387 else if (expld.dataseg.relro == exp_dataseg_relro_end)
5389 if (!expld.dataseg.relro_end_stat)
5390 expld.dataseg.relro_end_stat = s;
5393 ASSERT (expld.dataseg.relro_end_stat == s);
5396 expld.dataseg.relro = exp_dataseg_relro_none;
5398 /* This symbol may be relative to this section. */
5399 if ((tree->type.node_class == etree_provided
5400 || tree->type.node_class == etree_assign)
5401 && (tree->assign.dst [0] != '.'
5402 || tree->assign.dst [1] != '\0'))
5403 output_section_statement->update_dot = 1;
5405 if (!output_section_statement->ignored)
5407 if (output_section_statement == abs_output_section)
5409 /* If we don't have an output section, then just adjust
5410 the default memory address. */
5411 lang_memory_region_lookup (DEFAULT_MEMORY_REGION,
5412 FALSE)->current = newdot;
5414 else if (newdot != dot)
5416 /* Insert a pad after this statement. We can't
5417 put the pad before when relaxing, in case the
5418 assignment references dot. */
5419 insert_pad (&s->header.next, fill, TO_SIZE (newdot - dot),
5420 output_section_statement->bfd_section, dot);
5422 /* Don't neuter the pad below when relaxing. */
5425 /* If dot is advanced, this implies that the section
5426 should have space allocated to it, unless the
5427 user has explicitly stated that the section
5428 should not be allocated. */
5429 if (output_section_statement->sectype != noalloc_section
5430 && (output_section_statement->sectype != noload_section
5431 || (bfd_get_flavour (link_info.output_bfd)
5432 == bfd_target_elf_flavour)))
5433 output_section_statement->bfd_section->flags |= SEC_ALLOC;
5440 case lang_padding_statement_enum:
5441 /* If this is the first time lang_size_sections is called,
5442 we won't have any padding statements. If this is the
5443 second or later passes when relaxing, we should allow
5444 padding to shrink. If padding is needed on this pass, it
5445 will be added back in. */
5446 s->padding_statement.size = 0;
5448 /* Make sure output_offset is valid. If relaxation shrinks
5449 the section and this pad isn't needed, it's possible to
5450 have output_offset larger than the final size of the
5451 section. bfd_set_section_contents will complain even for
5452 a pad size of zero. */
5453 s->padding_statement.output_offset
5454 = dot - output_section_statement->bfd_section->vma;
5457 case lang_group_statement_enum:
5458 dot = lang_size_sections_1 (&s->group_statement.children.head,
5459 output_section_statement,
5460 fill, dot, relax, check_regions);
5463 case lang_insert_statement_enum:
5466 /* We can only get here when relaxing is turned on. */
5467 case lang_address_statement_enum:
5474 prev = &s->header.next;
5479 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
5480 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
5481 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
5482 segments. We are allowed an opportunity to override this decision. */
5485 ldlang_override_segment_assignment (struct bfd_link_info *info ATTRIBUTE_UNUSED,
5486 bfd *abfd ATTRIBUTE_UNUSED,
5487 asection *current_section,
5488 asection *previous_section,
5489 bfd_boolean new_segment)
5491 lang_output_section_statement_type *cur;
5492 lang_output_section_statement_type *prev;
5494 /* The checks below are only necessary when the BFD library has decided
5495 that the two sections ought to be placed into the same segment. */
5499 /* Paranoia checks. */
5500 if (current_section == NULL || previous_section == NULL)
5503 /* If this flag is set, the target never wants code and non-code
5504 sections comingled in the same segment. */
5505 if (config.separate_code
5506 && ((current_section->flags ^ previous_section->flags) & SEC_CODE))
5509 /* Find the memory regions associated with the two sections.
5510 We call lang_output_section_find() here rather than scanning the list
5511 of output sections looking for a matching section pointer because if
5512 we have a large number of sections then a hash lookup is faster. */
5513 cur = lang_output_section_find (current_section->name);
5514 prev = lang_output_section_find (previous_section->name);
5516 /* More paranoia. */
5517 if (cur == NULL || prev == NULL)
5520 /* If the regions are different then force the sections to live in
5521 different segments. See the email thread starting at the following
5522 URL for the reasons why this is necessary:
5523 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
5524 return cur->region != prev->region;
5528 one_lang_size_sections_pass (bfd_boolean *relax, bfd_boolean check_regions)
5530 lang_statement_iteration++;
5531 lang_size_sections_1 (&statement_list.head, abs_output_section,
5532 0, 0, relax, check_regions);
5536 lang_size_sections (bfd_boolean *relax, bfd_boolean check_regions)
5538 expld.phase = lang_allocating_phase_enum;
5539 expld.dataseg.phase = exp_dataseg_none;
5541 one_lang_size_sections_pass (relax, check_regions);
5542 if (expld.dataseg.phase == exp_dataseg_end_seen
5543 && link_info.relro && expld.dataseg.relro_end)
5545 bfd_vma initial_base, relro_end, desired_end;
5548 /* Compute the expected PT_GNU_RELRO segment end. */
5549 relro_end = ((expld.dataseg.relro_end + expld.dataseg.pagesize - 1)
5550 & ~(expld.dataseg.pagesize - 1));
5552 /* Adjust by the offset arg of DATA_SEGMENT_RELRO_END. */
5553 desired_end = relro_end - expld.dataseg.relro_offset;
5555 /* For sections in the relro segment.. */
5556 for (sec = link_info.output_bfd->section_last; sec; sec = sec->prev)
5557 if ((sec->flags & SEC_ALLOC) != 0
5558 && sec->vma >= expld.dataseg.base
5559 && sec->vma < expld.dataseg.relro_end - expld.dataseg.relro_offset)
5561 /* Where do we want to put this section so that it ends as
5563 bfd_vma start, end, bump;
5565 end = start = sec->vma;
5567 end += TO_ADDR (sec->size);
5568 bump = desired_end - end;
5569 /* We'd like to increase START by BUMP, but we must heed
5570 alignment so the increase might be less than optimum. */
5572 start &= ~(((bfd_vma) 1 << sec->alignment_power) - 1);
5573 /* This is now the desired end for the previous section. */
5574 desired_end = start;
5577 expld.dataseg.phase = exp_dataseg_relro_adjust;
5578 ASSERT (desired_end >= expld.dataseg.base);
5579 initial_base = expld.dataseg.base;
5580 expld.dataseg.base = desired_end;
5581 lang_reset_memory_regions ();
5582 one_lang_size_sections_pass (relax, check_regions);
5584 if (expld.dataseg.relro_end > relro_end)
5586 /* Assignments to dot, or to output section address in a
5587 user script have increased padding over the original.
5589 expld.dataseg.base = initial_base;
5590 lang_reset_memory_regions ();
5591 one_lang_size_sections_pass (relax, check_regions);
5594 link_info.relro_start = expld.dataseg.base;
5595 link_info.relro_end = expld.dataseg.relro_end;
5597 else if (expld.dataseg.phase == exp_dataseg_end_seen)
5599 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
5600 a page could be saved in the data segment. */
5601 bfd_vma first, last;
5603 first = -expld.dataseg.base & (expld.dataseg.pagesize - 1);
5604 last = expld.dataseg.end & (expld.dataseg.pagesize - 1);
5606 && ((expld.dataseg.base & ~(expld.dataseg.pagesize - 1))
5607 != (expld.dataseg.end & ~(expld.dataseg.pagesize - 1)))
5608 && first + last <= expld.dataseg.pagesize)
5610 expld.dataseg.phase = exp_dataseg_adjust;
5611 lang_reset_memory_regions ();
5612 one_lang_size_sections_pass (relax, check_regions);
5615 expld.dataseg.phase = exp_dataseg_done;
5618 expld.dataseg.phase = exp_dataseg_done;
5621 static lang_output_section_statement_type *current_section;
5622 static lang_assignment_statement_type *current_assign;
5623 static bfd_boolean prefer_next_section;
5625 /* Worker function for lang_do_assignments. Recursiveness goes here. */
5628 lang_do_assignments_1 (lang_statement_union_type *s,
5629 lang_output_section_statement_type *current_os,
5632 bfd_boolean *found_end)
5634 for (; s != NULL; s = s->header.next)
5636 switch (s->header.type)
5638 case lang_constructors_statement_enum:
5639 dot = lang_do_assignments_1 (constructor_list.head,
5640 current_os, fill, dot, found_end);
5643 case lang_output_section_statement_enum:
5645 lang_output_section_statement_type *os;
5648 os = &(s->output_section_statement);
5649 os->after_end = *found_end;
5650 if (os->bfd_section != NULL && !os->ignored)
5652 if ((os->bfd_section->flags & SEC_ALLOC) != 0)
5654 current_section = os;
5655 prefer_next_section = FALSE;
5657 dot = os->bfd_section->vma;
5659 newdot = lang_do_assignments_1 (os->children.head,
5660 os, os->fill, dot, found_end);
5663 if (os->bfd_section != NULL)
5665 /* .tbss sections effectively have zero size. */
5666 if (!IS_TBSS (os->bfd_section)
5667 || bfd_link_relocatable (&link_info))
5668 dot += TO_ADDR (os->bfd_section->size);
5670 if (os->update_dot_tree != NULL)
5671 exp_fold_tree (os->update_dot_tree,
5672 bfd_abs_section_ptr, &dot);
5680 case lang_wild_statement_enum:
5682 dot = lang_do_assignments_1 (s->wild_statement.children.head,
5683 current_os, fill, dot, found_end);
5686 case lang_object_symbols_statement_enum:
5687 case lang_output_statement_enum:
5688 case lang_target_statement_enum:
5691 case lang_data_statement_enum:
5692 exp_fold_tree (s->data_statement.exp, bfd_abs_section_ptr, &dot);
5693 if (expld.result.valid_p)
5695 s->data_statement.value = expld.result.value;
5696 if (expld.result.section != NULL)
5697 s->data_statement.value += expld.result.section->vma;
5699 else if (expld.phase == lang_final_phase_enum)
5700 einfo (_("%F%P: invalid data statement\n"));
5703 switch (s->data_statement.type)
5721 if (size < TO_SIZE ((unsigned) 1))
5722 size = TO_SIZE ((unsigned) 1);
5723 dot += TO_ADDR (size);
5727 case lang_reloc_statement_enum:
5728 exp_fold_tree (s->reloc_statement.addend_exp,
5729 bfd_abs_section_ptr, &dot);
5730 if (expld.result.valid_p)
5731 s->reloc_statement.addend_value = expld.result.value;
5732 else if (expld.phase == lang_final_phase_enum)
5733 einfo (_("%F%P: invalid reloc statement\n"));
5734 dot += TO_ADDR (bfd_get_reloc_size (s->reloc_statement.howto));
5737 case lang_input_section_enum:
5739 asection *in = s->input_section.section;
5741 if ((in->flags & SEC_EXCLUDE) == 0)
5742 dot += TO_ADDR (in->size);
5746 case lang_input_statement_enum:
5749 case lang_fill_statement_enum:
5750 fill = s->fill_statement.fill;
5753 case lang_assignment_statement_enum:
5754 current_assign = &s->assignment_statement;
5755 if (current_assign->exp->type.node_class != etree_assert)
5757 const char *p = current_assign->exp->assign.dst;
5759 if (current_os == abs_output_section && p[0] == '.' && p[1] == 0)
5760 prefer_next_section = TRUE;
5764 if (strcmp (p, "end") == 0)
5767 exp_fold_tree (s->assignment_statement.exp,
5768 (current_os->bfd_section != NULL
5769 ? current_os->bfd_section : bfd_und_section_ptr),
5773 case lang_padding_statement_enum:
5774 dot += TO_ADDR (s->padding_statement.size);
5777 case lang_group_statement_enum:
5778 dot = lang_do_assignments_1 (s->group_statement.children.head,
5779 current_os, fill, dot, found_end);
5782 case lang_insert_statement_enum:
5785 case lang_address_statement_enum:
5797 lang_do_assignments (lang_phase_type phase)
5799 bfd_boolean found_end = FALSE;
5801 current_section = NULL;
5802 prefer_next_section = FALSE;
5803 expld.phase = phase;
5804 lang_statement_iteration++;
5805 lang_do_assignments_1 (statement_list.head,
5806 abs_output_section, NULL, 0, &found_end);
5809 /* For an assignment statement outside of an output section statement,
5810 choose the best of neighbouring output sections to use for values
5814 section_for_dot (void)
5818 /* Assignments belong to the previous output section, unless there
5819 has been an assignment to "dot", in which case following
5820 assignments belong to the next output section. (The assumption
5821 is that an assignment to "dot" is setting up the address for the
5822 next output section.) Except that past the assignment to "_end"
5823 we always associate with the previous section. This exception is
5824 for targets like SH that define an alloc .stack or other
5825 weirdness after non-alloc sections. */
5826 if (current_section == NULL || prefer_next_section)
5828 lang_statement_union_type *stmt;
5829 lang_output_section_statement_type *os;
5831 for (stmt = (lang_statement_union_type *) current_assign;
5833 stmt = stmt->header.next)
5834 if (stmt->header.type == lang_output_section_statement_enum)
5837 os = &stmt->output_section_statement;
5840 && (os->bfd_section == NULL
5841 || (os->bfd_section->flags & SEC_EXCLUDE) != 0
5842 || bfd_section_removed_from_list (link_info.output_bfd,
5846 if (current_section == NULL || os == NULL || !os->after_end)
5849 s = os->bfd_section;
5851 s = link_info.output_bfd->section_last;
5853 && ((s->flags & SEC_ALLOC) == 0
5854 || (s->flags & SEC_THREAD_LOCAL) != 0))
5859 return bfd_abs_section_ptr;
5863 s = current_section->bfd_section;
5865 /* The section may have been stripped. */
5867 && ((s->flags & SEC_EXCLUDE) != 0
5868 || (s->flags & SEC_ALLOC) == 0
5869 || (s->flags & SEC_THREAD_LOCAL) != 0
5870 || bfd_section_removed_from_list (link_info.output_bfd, s)))
5873 s = link_info.output_bfd->sections;
5875 && ((s->flags & SEC_ALLOC) == 0
5876 || (s->flags & SEC_THREAD_LOCAL) != 0))
5881 return bfd_abs_section_ptr;
5884 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
5885 operator .startof. (section_name), it produces an undefined symbol
5886 .startof.section_name. Similarly, when it sees
5887 .sizeof. (section_name), it produces an undefined symbol
5888 .sizeof.section_name. For all the output sections, we look for
5889 such symbols, and set them to the correct value. */
5892 lang_set_startof (void)
5896 if (bfd_link_relocatable (&link_info))
5899 for (s = link_info.output_bfd->sections; s != NULL; s = s->next)
5901 const char *secname;
5903 struct bfd_link_hash_entry *h;
5905 secname = bfd_get_section_name (link_info.output_bfd, s);
5906 buf = (char *) xmalloc (10 + strlen (secname));
5908 sprintf (buf, ".startof.%s", secname);
5909 h = bfd_link_hash_lookup (link_info.hash, buf, FALSE, FALSE, TRUE);
5910 if (h != NULL && h->type == bfd_link_hash_undefined)
5912 h->type = bfd_link_hash_defined;
5914 h->u.def.section = s;
5917 sprintf (buf, ".sizeof.%s", secname);
5918 h = bfd_link_hash_lookup (link_info.hash, buf, FALSE, FALSE, TRUE);
5919 if (h != NULL && h->type == bfd_link_hash_undefined)
5921 h->type = bfd_link_hash_defined;
5922 h->u.def.value = TO_ADDR (s->size);
5923 h->u.def.section = bfd_abs_section_ptr;
5933 struct bfd_link_hash_entry *h;
5936 if ((bfd_link_relocatable (&link_info) && !link_info.gc_sections)
5937 || bfd_link_dll (&link_info))
5938 warn = entry_from_cmdline;
5942 /* Force the user to specify a root when generating a relocatable with
5944 if (link_info.gc_sections && bfd_link_relocatable (&link_info)
5945 && !(entry_from_cmdline || undef_from_cmdline))
5946 einfo (_("%P%F: gc-sections requires either an entry or "
5947 "an undefined symbol\n"));
5949 if (entry_symbol.name == NULL)
5951 /* No entry has been specified. Look for the default entry, but
5952 don't warn if we don't find it. */
5953 entry_symbol.name = entry_symbol_default;
5957 h = bfd_link_hash_lookup (link_info.hash, entry_symbol.name,
5958 FALSE, FALSE, TRUE);
5960 && (h->type == bfd_link_hash_defined
5961 || h->type == bfd_link_hash_defweak)
5962 && h->u.def.section->output_section != NULL)
5966 val = (h->u.def.value
5967 + bfd_get_section_vma (link_info.output_bfd,
5968 h->u.def.section->output_section)
5969 + h->u.def.section->output_offset);
5970 if (!bfd_set_start_address (link_info.output_bfd, val))
5971 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol.name);
5978 /* We couldn't find the entry symbol. Try parsing it as a
5980 val = bfd_scan_vma (entry_symbol.name, &send, 0);
5983 if (!bfd_set_start_address (link_info.output_bfd, val))
5984 einfo (_("%P%F: can't set start address\n"));
5990 /* Can't find the entry symbol, and it's not a number. Use
5991 the first address in the text section. */
5992 ts = bfd_get_section_by_name (link_info.output_bfd, entry_section);
5996 einfo (_("%P: warning: cannot find entry symbol %s;"
5997 " defaulting to %V\n"),
5999 bfd_get_section_vma (link_info.output_bfd, ts));
6000 if (!(bfd_set_start_address
6001 (link_info.output_bfd,
6002 bfd_get_section_vma (link_info.output_bfd, ts))))
6003 einfo (_("%P%F: can't set start address\n"));
6008 einfo (_("%P: warning: cannot find entry symbol %s;"
6009 " not setting start address\n"),
6016 /* This is a small function used when we want to ignore errors from
6020 ignore_bfd_errors (const char *fmt ATTRIBUTE_UNUSED,
6021 va_list ap ATTRIBUTE_UNUSED)
6023 /* Don't do anything. */
6026 /* Check that the architecture of all the input files is compatible
6027 with the output file. Also call the backend to let it do any
6028 other checking that is needed. */
6033 lang_statement_union_type *file;
6035 const bfd_arch_info_type *compatible;
6037 for (file = file_chain.head; file != NULL; file = file->input_statement.next)
6039 #ifdef ENABLE_PLUGINS
6040 /* Don't check format of files claimed by plugin. */
6041 if (file->input_statement.flags.claimed)
6043 #endif /* ENABLE_PLUGINS */
6044 input_bfd = file->input_statement.the_bfd;
6046 = bfd_arch_get_compatible (input_bfd, link_info.output_bfd,
6047 command_line.accept_unknown_input_arch);
6049 /* In general it is not possible to perform a relocatable
6050 link between differing object formats when the input
6051 file has relocations, because the relocations in the
6052 input format may not have equivalent representations in
6053 the output format (and besides BFD does not translate
6054 relocs for other link purposes than a final link). */
6055 if ((bfd_link_relocatable (&link_info)
6056 || link_info.emitrelocations)
6057 && (compatible == NULL
6058 || (bfd_get_flavour (input_bfd)
6059 != bfd_get_flavour (link_info.output_bfd)))
6060 && (bfd_get_file_flags (input_bfd) & HAS_RELOC) != 0)
6062 einfo (_("%P%F: Relocatable linking with relocations from"
6063 " format %s (%B) to format %s (%B) is not supported\n"),
6064 bfd_get_target (input_bfd), input_bfd,
6065 bfd_get_target (link_info.output_bfd), link_info.output_bfd);
6066 /* einfo with %F exits. */
6069 if (compatible == NULL)
6071 if (command_line.warn_mismatch)
6072 einfo (_("%P%X: %s architecture of input file `%B'"
6073 " is incompatible with %s output\n"),
6074 bfd_printable_name (input_bfd), input_bfd,
6075 bfd_printable_name (link_info.output_bfd));
6077 else if (bfd_count_sections (input_bfd))
6079 /* If the input bfd has no contents, it shouldn't set the
6080 private data of the output bfd. */
6082 bfd_error_handler_type pfn = NULL;
6084 /* If we aren't supposed to warn about mismatched input
6085 files, temporarily set the BFD error handler to a
6086 function which will do nothing. We still want to call
6087 bfd_merge_private_bfd_data, since it may set up
6088 information which is needed in the output file. */
6089 if (!command_line.warn_mismatch)
6090 pfn = bfd_set_error_handler (ignore_bfd_errors);
6091 if (!bfd_merge_private_bfd_data (input_bfd, &link_info))
6093 if (command_line.warn_mismatch)
6094 einfo (_("%P%X: failed to merge target specific data"
6095 " of file %B\n"), input_bfd);
6097 if (!command_line.warn_mismatch)
6098 bfd_set_error_handler (pfn);
6103 /* Look through all the global common symbols and attach them to the
6104 correct section. The -sort-common command line switch may be used
6105 to roughly sort the entries by alignment. */
6110 if (command_line.inhibit_common_definition)
6112 if (bfd_link_relocatable (&link_info)
6113 && !command_line.force_common_definition)
6116 if (!config.sort_common)
6117 bfd_link_hash_traverse (link_info.hash, lang_one_common, NULL);
6122 if (config.sort_common == sort_descending)
6124 for (power = 4; power > 0; power--)
6125 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
6128 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
6132 for (power = 0; power <= 4; power++)
6133 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
6135 power = (unsigned int) -1;
6136 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
6141 /* Place one common symbol in the correct section. */
6144 lang_one_common (struct bfd_link_hash_entry *h, void *info)
6146 unsigned int power_of_two;
6150 if (h->type != bfd_link_hash_common)
6154 power_of_two = h->u.c.p->alignment_power;
6156 if (config.sort_common == sort_descending
6157 && power_of_two < *(unsigned int *) info)
6159 else if (config.sort_common == sort_ascending
6160 && power_of_two > *(unsigned int *) info)
6163 section = h->u.c.p->section;
6164 if (!bfd_define_common_symbol (link_info.output_bfd, &link_info, h))
6165 einfo (_("%P%F: Could not define common symbol `%T': %E\n"),
6168 if (config.map_file != NULL)
6170 static bfd_boolean header_printed;
6175 if (!header_printed)
6177 minfo (_("\nAllocating common symbols\n"));
6178 minfo (_("Common symbol size file\n\n"));
6179 header_printed = TRUE;
6182 name = bfd_demangle (link_info.output_bfd, h->root.string,
6183 DMGL_ANSI | DMGL_PARAMS);
6186 minfo ("%s", h->root.string);
6187 len = strlen (h->root.string);
6192 len = strlen (name);
6208 if (size <= 0xffffffff)
6209 sprintf (buf, "%lx", (unsigned long) size);
6211 sprintf_vma (buf, size);
6221 minfo ("%B\n", section->owner);
6227 /* Handle a single orphan section S, placing the orphan into an appropriate
6228 output section. The effects of the --orphan-handling command line
6229 option are handled here. */
6232 ldlang_place_orphan (asection *s)
6234 if (config.orphan_handling == orphan_handling_discard)
6236 lang_output_section_statement_type *os;
6237 os = lang_output_section_statement_lookup (DISCARD_SECTION_NAME, 0,
6239 if (os->addr_tree == NULL
6240 && (bfd_link_relocatable (&link_info)
6241 || (s->flags & (SEC_LOAD | SEC_ALLOC)) == 0))
6242 os->addr_tree = exp_intop (0);
6243 lang_add_section (&os->children, s, NULL, os);
6247 lang_output_section_statement_type *os;
6248 const char *name = s->name;
6251 if (config.orphan_handling == orphan_handling_error)
6252 einfo ("%X%P: error: unplaced orphan section `%A' from `%B'.\n",
6255 if (config.unique_orphan_sections || unique_section_p (s, NULL))
6256 constraint = SPECIAL;
6258 os = ldemul_place_orphan (s, name, constraint);
6261 os = lang_output_section_statement_lookup (name, constraint, TRUE);
6262 if (os->addr_tree == NULL
6263 && (bfd_link_relocatable (&link_info)
6264 || (s->flags & (SEC_LOAD | SEC_ALLOC)) == 0))
6265 os->addr_tree = exp_intop (0);
6266 lang_add_section (&os->children, s, NULL, os);
6269 if (config.orphan_handling == orphan_handling_warn)
6270 einfo ("%P: warning: orphan section `%A' from `%B' being "
6271 "placed in section `%s'.\n",
6272 s, s->owner, os->name);
6276 /* Run through the input files and ensure that every input section has
6277 somewhere to go. If one is found without a destination then create
6278 an input request and place it into the statement tree. */
6281 lang_place_orphans (void)
6283 LANG_FOR_EACH_INPUT_STATEMENT (file)
6287 for (s = file->the_bfd->sections; s != NULL; s = s->next)
6289 if (s->output_section == NULL)
6291 /* This section of the file is not attached, root
6292 around for a sensible place for it to go. */
6294 if (file->flags.just_syms)
6295 bfd_link_just_syms (file->the_bfd, s, &link_info);
6296 else if ((s->flags & SEC_EXCLUDE) != 0)
6297 s->output_section = bfd_abs_section_ptr;
6298 else if (strcmp (s->name, "COMMON") == 0)
6300 /* This is a lonely common section which must have
6301 come from an archive. We attach to the section
6302 with the wildcard. */
6303 if (!bfd_link_relocatable (&link_info)
6304 || command_line.force_common_definition)
6306 if (default_common_section == NULL)
6307 default_common_section
6308 = lang_output_section_statement_lookup (".bss", 0,
6310 lang_add_section (&default_common_section->children, s,
6311 NULL, default_common_section);
6315 ldlang_place_orphan (s);
6322 lang_set_flags (lang_memory_region_type *ptr, const char *flags, int invert)
6324 flagword *ptr_flags;
6326 ptr_flags = invert ? &ptr->not_flags : &ptr->flags;
6332 /* PR 17900: An exclamation mark in the attributes reverses
6333 the sense of any of the attributes that follow. */
6336 ptr_flags = invert ? &ptr->not_flags : &ptr->flags;
6340 *ptr_flags |= SEC_ALLOC;
6344 *ptr_flags |= SEC_READONLY;
6348 *ptr_flags |= SEC_DATA;
6352 *ptr_flags |= SEC_CODE;
6357 *ptr_flags |= SEC_LOAD;
6361 einfo (_("%P%F: invalid character %c (%d) in flags\n"),
6369 /* Call a function on each input file. This function will be called
6370 on an archive, but not on the elements. */
6373 lang_for_each_input_file (void (*func) (lang_input_statement_type *))
6375 lang_input_statement_type *f;
6377 for (f = (lang_input_statement_type *) input_file_chain.head;
6379 f = (lang_input_statement_type *) f->next_real_file)
6383 /* Call a function on each file. The function will be called on all
6384 the elements of an archive which are included in the link, but will
6385 not be called on the archive file itself. */
6388 lang_for_each_file (void (*func) (lang_input_statement_type *))
6390 LANG_FOR_EACH_INPUT_STATEMENT (f)
6397 ldlang_add_file (lang_input_statement_type *entry)
6399 lang_statement_append (&file_chain,
6400 (lang_statement_union_type *) entry,
6403 /* The BFD linker needs to have a list of all input BFDs involved in
6405 ASSERT (entry->the_bfd->link.next == NULL);
6406 ASSERT (entry->the_bfd != link_info.output_bfd);
6408 *link_info.input_bfds_tail = entry->the_bfd;
6409 link_info.input_bfds_tail = &entry->the_bfd->link.next;
6410 entry->the_bfd->usrdata = entry;
6411 bfd_set_gp_size (entry->the_bfd, g_switch_value);
6413 /* Look through the sections and check for any which should not be
6414 included in the link. We need to do this now, so that we can
6415 notice when the backend linker tries to report multiple
6416 definition errors for symbols which are in sections we aren't
6417 going to link. FIXME: It might be better to entirely ignore
6418 symbols which are defined in sections which are going to be
6419 discarded. This would require modifying the backend linker for
6420 each backend which might set the SEC_LINK_ONCE flag. If we do
6421 this, we should probably handle SEC_EXCLUDE in the same way. */
6423 bfd_map_over_sections (entry->the_bfd, section_already_linked, entry);
6427 lang_add_output (const char *name, int from_script)
6429 /* Make -o on command line override OUTPUT in script. */
6430 if (!had_output_filename || !from_script)
6432 output_filename = name;
6433 had_output_filename = TRUE;
6446 for (l = 0; l < 32; l++)
6448 if (i >= (unsigned int) x)
6456 lang_output_section_statement_type *
6457 lang_enter_output_section_statement (const char *output_section_statement_name,
6458 etree_type *address_exp,
6459 enum section_type sectype,
6461 etree_type *subalign,
6464 int align_with_input)
6466 lang_output_section_statement_type *os;
6468 os = lang_output_section_statement_lookup (output_section_statement_name,
6470 current_section = os;
6472 if (os->addr_tree == NULL)
6474 os->addr_tree = address_exp;
6476 os->sectype = sectype;
6477 if (sectype != noload_section)
6478 os->flags = SEC_NO_FLAGS;
6480 os->flags = SEC_NEVER_LOAD;
6481 os->block_value = 1;
6483 /* Make next things chain into subchain of this. */
6484 push_stat_ptr (&os->children);
6486 os->align_lma_with_input = align_with_input == ALIGN_WITH_INPUT;
6487 if (os->align_lma_with_input && align != NULL)
6488 einfo (_("%F%P:%S: error: align with input and explicit align specified\n"),
6491 os->subsection_alignment =
6492 topower (exp_get_value_int (subalign, -1, "subsection alignment"));
6493 os->section_alignment =
6494 topower (exp_get_value_int (align, -1, "section alignment"));
6496 os->load_base = ebase;
6503 lang_output_statement_type *new_stmt;
6505 new_stmt = new_stat (lang_output_statement, stat_ptr);
6506 new_stmt->name = output_filename;
6509 /* Reset the current counters in the regions. */
6512 lang_reset_memory_regions (void)
6514 lang_memory_region_type *p = lang_memory_region_list;
6516 lang_output_section_statement_type *os;
6518 for (p = lang_memory_region_list; p != NULL; p = p->next)
6520 p->current = p->origin;
6524 for (os = &lang_output_section_statement.head->output_section_statement;
6528 os->processed_vma = FALSE;
6529 os->processed_lma = FALSE;
6532 for (o = link_info.output_bfd->sections; o != NULL; o = o->next)
6534 /* Save the last size for possible use by bfd_relax_section. */
6535 o->rawsize = o->size;
6540 /* Worker for lang_gc_sections_1. */
6543 gc_section_callback (lang_wild_statement_type *ptr,
6544 struct wildcard_list *sec ATTRIBUTE_UNUSED,
6546 struct flag_info *sflag_info ATTRIBUTE_UNUSED,
6547 lang_input_statement_type *file ATTRIBUTE_UNUSED,
6548 void *data ATTRIBUTE_UNUSED)
6550 /* If the wild pattern was marked KEEP, the member sections
6551 should be as well. */
6552 if (ptr->keep_sections)
6553 section->flags |= SEC_KEEP;
6556 /* Iterate over sections marking them against GC. */
6559 lang_gc_sections_1 (lang_statement_union_type *s)
6561 for (; s != NULL; s = s->header.next)
6563 switch (s->header.type)
6565 case lang_wild_statement_enum:
6566 walk_wild (&s->wild_statement, gc_section_callback, NULL);
6568 case lang_constructors_statement_enum:
6569 lang_gc_sections_1 (constructor_list.head);
6571 case lang_output_section_statement_enum:
6572 lang_gc_sections_1 (s->output_section_statement.children.head);
6574 case lang_group_statement_enum:
6575 lang_gc_sections_1 (s->group_statement.children.head);
6584 lang_gc_sections (void)
6586 /* Keep all sections so marked in the link script. */
6587 lang_gc_sections_1 (statement_list.head);
6589 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
6590 the special case of debug info. (See bfd/stabs.c)
6591 Twiddle the flag here, to simplify later linker code. */
6592 if (bfd_link_relocatable (&link_info))
6594 LANG_FOR_EACH_INPUT_STATEMENT (f)
6597 #ifdef ENABLE_PLUGINS
6598 if (f->flags.claimed)
6601 for (sec = f->the_bfd->sections; sec != NULL; sec = sec->next)
6602 if ((sec->flags & SEC_DEBUGGING) == 0)
6603 sec->flags &= ~SEC_EXCLUDE;
6607 if (link_info.gc_sections)
6608 bfd_gc_sections (link_info.output_bfd, &link_info);
6611 /* Worker for lang_find_relro_sections_1. */
6614 find_relro_section_callback (lang_wild_statement_type *ptr ATTRIBUTE_UNUSED,
6615 struct wildcard_list *sec ATTRIBUTE_UNUSED,
6617 struct flag_info *sflag_info ATTRIBUTE_UNUSED,
6618 lang_input_statement_type *file ATTRIBUTE_UNUSED,
6621 /* Discarded, excluded and ignored sections effectively have zero
6623 if (section->output_section != NULL
6624 && section->output_section->owner == link_info.output_bfd
6625 && (section->output_section->flags & SEC_EXCLUDE) == 0
6626 && !IGNORE_SECTION (section)
6627 && section->size != 0)
6629 bfd_boolean *has_relro_section = (bfd_boolean *) data;
6630 *has_relro_section = TRUE;
6634 /* Iterate over sections for relro sections. */
6637 lang_find_relro_sections_1 (lang_statement_union_type *s,
6638 bfd_boolean *has_relro_section)
6640 if (*has_relro_section)
6643 for (; s != NULL; s = s->header.next)
6645 if (s == expld.dataseg.relro_end_stat)
6648 switch (s->header.type)
6650 case lang_wild_statement_enum:
6651 walk_wild (&s->wild_statement,
6652 find_relro_section_callback,
6655 case lang_constructors_statement_enum:
6656 lang_find_relro_sections_1 (constructor_list.head,
6659 case lang_output_section_statement_enum:
6660 lang_find_relro_sections_1 (s->output_section_statement.children.head,
6663 case lang_group_statement_enum:
6664 lang_find_relro_sections_1 (s->group_statement.children.head,
6674 lang_find_relro_sections (void)
6676 bfd_boolean has_relro_section = FALSE;
6678 /* Check all sections in the link script. */
6680 lang_find_relro_sections_1 (expld.dataseg.relro_start_stat,
6681 &has_relro_section);
6683 if (!has_relro_section)
6684 link_info.relro = FALSE;
6687 /* Relax all sections until bfd_relax_section gives up. */
6690 lang_relax_sections (bfd_boolean need_layout)
6692 if (RELAXATION_ENABLED)
6694 /* We may need more than one relaxation pass. */
6695 int i = link_info.relax_pass;
6697 /* The backend can use it to determine the current pass. */
6698 link_info.relax_pass = 0;
6702 /* Keep relaxing until bfd_relax_section gives up. */
6703 bfd_boolean relax_again;
6705 link_info.relax_trip = -1;
6708 link_info.relax_trip++;
6710 /* Note: pe-dll.c does something like this also. If you find
6711 you need to change this code, you probably need to change
6712 pe-dll.c also. DJ */
6714 /* Do all the assignments with our current guesses as to
6716 lang_do_assignments (lang_assigning_phase_enum);
6718 /* We must do this after lang_do_assignments, because it uses
6720 lang_reset_memory_regions ();
6722 /* Perform another relax pass - this time we know where the
6723 globals are, so can make a better guess. */
6724 relax_again = FALSE;
6725 lang_size_sections (&relax_again, FALSE);
6727 while (relax_again);
6729 link_info.relax_pass++;
6736 /* Final extra sizing to report errors. */
6737 lang_do_assignments (lang_assigning_phase_enum);
6738 lang_reset_memory_regions ();
6739 lang_size_sections (NULL, TRUE);
6743 #ifdef ENABLE_PLUGINS
6744 /* Find the insert point for the plugin's replacement files. We
6745 place them after the first claimed real object file, or if the
6746 first claimed object is an archive member, after the last real
6747 object file immediately preceding the archive. In the event
6748 no objects have been claimed at all, we return the first dummy
6749 object file on the list as the insert point; that works, but
6750 the callee must be careful when relinking the file_chain as it
6751 is not actually on that chain, only the statement_list and the
6752 input_file list; in that case, the replacement files must be
6753 inserted at the head of the file_chain. */
6755 static lang_input_statement_type *
6756 find_replacements_insert_point (void)
6758 lang_input_statement_type *claim1, *lastobject;
6759 lastobject = &input_file_chain.head->input_statement;
6760 for (claim1 = &file_chain.head->input_statement;
6762 claim1 = &claim1->next->input_statement)
6764 if (claim1->flags.claimed)
6765 return claim1->flags.claim_archive ? lastobject : claim1;
6766 /* Update lastobject if this is a real object file. */
6767 if (claim1->the_bfd != NULL && claim1->the_bfd->my_archive == NULL)
6768 lastobject = claim1;
6770 /* No files were claimed by the plugin. Choose the last object
6771 file found on the list (maybe the first, dummy entry) as the
6776 /* Insert SRCLIST into DESTLIST after given element by chaining
6777 on FIELD as the next-pointer. (Counterintuitively does not need
6778 a pointer to the actual after-node itself, just its chain field.) */
6781 lang_list_insert_after (lang_statement_list_type *destlist,
6782 lang_statement_list_type *srclist,
6783 lang_statement_union_type **field)
6785 *(srclist->tail) = *field;
6786 *field = srclist->head;
6787 if (destlist->tail == field)
6788 destlist->tail = srclist->tail;
6791 /* Detach new nodes added to DESTLIST since the time ORIGLIST
6792 was taken as a copy of it and leave them in ORIGLIST. */
6795 lang_list_remove_tail (lang_statement_list_type *destlist,
6796 lang_statement_list_type *origlist)
6798 union lang_statement_union **savetail;
6799 /* Check that ORIGLIST really is an earlier state of DESTLIST. */
6800 ASSERT (origlist->head == destlist->head);
6801 savetail = origlist->tail;
6802 origlist->head = *(savetail);
6803 origlist->tail = destlist->tail;
6804 destlist->tail = savetail;
6807 #endif /* ENABLE_PLUGINS */
6809 /* Add NAME to the list of garbage collection entry points. */
6812 lang_add_gc_name (const char *name)
6814 struct bfd_sym_chain *sym;
6819 sym = (struct bfd_sym_chain *) stat_alloc (sizeof (*sym));
6821 sym->next = link_info.gc_sym_list;
6823 link_info.gc_sym_list = sym;
6826 /* Check relocations. */
6829 lang_check_relocs (void)
6831 if (link_info.check_relocs_after_open_input)
6835 for (abfd = link_info.input_bfds;
6836 abfd != (bfd *) NULL; abfd = abfd->link.next)
6837 if (!bfd_link_check_relocs (abfd, &link_info))
6839 /* No object output, fail return. */
6840 config.make_executable = FALSE;
6841 /* Note: we do not abort the loop, but rather
6842 continue the scan in case there are other
6843 bad relocations to report. */
6851 /* Finalize dynamic list. */
6852 if (link_info.dynamic_list)
6853 lang_finalize_version_expr_head (&link_info.dynamic_list->head);
6855 current_target = default_target;
6857 /* Open the output file. */
6858 lang_for_each_statement (ldlang_open_output);
6861 ldemul_create_output_section_statements ();
6863 /* Add to the hash table all undefineds on the command line. */
6864 lang_place_undefineds ();
6866 if (!bfd_section_already_linked_table_init ())
6867 einfo (_("%P%F: Failed to create hash table\n"));
6869 /* Create a bfd for each input file. */
6870 current_target = default_target;
6871 open_input_bfds (statement_list.head, OPEN_BFD_NORMAL);
6873 #ifdef ENABLE_PLUGINS
6874 if (link_info.lto_plugin_active)
6876 lang_statement_list_type added;
6877 lang_statement_list_type files, inputfiles;
6879 /* Now all files are read, let the plugin(s) decide if there
6880 are any more to be added to the link before we call the
6881 emulation's after_open hook. We create a private list of
6882 input statements for this purpose, which we will eventually
6883 insert into the global statment list after the first claimed
6886 /* We need to manipulate all three chains in synchrony. */
6888 inputfiles = input_file_chain;
6889 if (plugin_call_all_symbols_read ())
6890 einfo (_("%P%F: %s: plugin reported error after all symbols read\n"),
6891 plugin_error_plugin ());
6892 /* Open any newly added files, updating the file chains. */
6893 open_input_bfds (*added.tail, OPEN_BFD_NORMAL);
6894 /* Restore the global list pointer now they have all been added. */
6895 lang_list_remove_tail (stat_ptr, &added);
6896 /* And detach the fresh ends of the file lists. */
6897 lang_list_remove_tail (&file_chain, &files);
6898 lang_list_remove_tail (&input_file_chain, &inputfiles);
6899 /* Were any new files added? */
6900 if (added.head != NULL)
6902 /* If so, we will insert them into the statement list immediately
6903 after the first input file that was claimed by the plugin. */
6904 plugin_insert = find_replacements_insert_point ();
6905 /* If a plugin adds input files without having claimed any, we
6906 don't really have a good idea where to place them. Just putting
6907 them at the start or end of the list is liable to leave them
6908 outside the crtbegin...crtend range. */
6909 ASSERT (plugin_insert != NULL);
6910 /* Splice the new statement list into the old one. */
6911 lang_list_insert_after (stat_ptr, &added,
6912 &plugin_insert->header.next);
6913 /* Likewise for the file chains. */
6914 lang_list_insert_after (&input_file_chain, &inputfiles,
6915 &plugin_insert->next_real_file);
6916 /* We must be careful when relinking file_chain; we may need to
6917 insert the new files at the head of the list if the insert
6918 point chosen is the dummy first input file. */
6919 if (plugin_insert->filename)
6920 lang_list_insert_after (&file_chain, &files, &plugin_insert->next);
6922 lang_list_insert_after (&file_chain, &files, &file_chain.head);
6924 /* Rescan archives in case new undefined symbols have appeared. */
6925 open_input_bfds (statement_list.head, OPEN_BFD_RESCAN);
6928 #endif /* ENABLE_PLUGINS */
6930 /* Make sure that nobody has tried to add a symbol to this list
6932 ASSERT (link_info.gc_sym_list == NULL);
6934 link_info.gc_sym_list = &entry_symbol;
6936 if (entry_symbol.name == NULL)
6938 link_info.gc_sym_list = ldlang_undef_chain_list_head;
6940 /* entry_symbol is normally initialied by a ENTRY definition in the
6941 linker script or the -e command line option. But if neither of
6942 these have been used, the target specific backend may still have
6943 provided an entry symbol via a call to lang_default_entry().
6944 Unfortunately this value will not be processed until lang_end()
6945 is called, long after this function has finished. So detect this
6946 case here and add the target's entry symbol to the list of starting
6947 points for garbage collection resolution. */
6948 lang_add_gc_name (entry_symbol_default);
6951 lang_add_gc_name (link_info.init_function);
6952 lang_add_gc_name (link_info.fini_function);
6954 ldemul_after_open ();
6955 if (config.map_file != NULL)
6956 lang_print_asneeded ();
6958 bfd_section_already_linked_table_free ();
6960 /* Make sure that we're not mixing architectures. We call this
6961 after all the input files have been opened, but before we do any
6962 other processing, so that any operations merge_private_bfd_data
6963 does on the output file will be known during the rest of the
6967 /* Handle .exports instead of a version script if we're told to do so. */
6968 if (command_line.version_exports_section)
6969 lang_do_version_exports_section ();
6971 /* Build all sets based on the information gathered from the input
6973 ldctor_build_sets ();
6975 /* PR 13683: We must rerun the assignments prior to running garbage
6976 collection in order to make sure that all symbol aliases are resolved. */
6977 lang_do_assignments (lang_mark_phase_enum);
6979 lang_do_memory_regions();
6980 expld.phase = lang_first_phase_enum;
6982 /* Size up the common data. */
6985 /* Remove unreferenced sections if asked to. */
6986 lang_gc_sections ();
6988 /* Check relocations. */
6989 lang_check_relocs ();
6991 /* Update wild statements. */
6992 update_wild_statements (statement_list.head);
6994 /* Run through the contours of the script and attach input sections
6995 to the correct output sections. */
6996 lang_statement_iteration++;
6997 map_input_to_output_sections (statement_list.head, NULL, NULL);
6999 process_insert_statements ();
7001 /* Find any sections not attached explicitly and handle them. */
7002 lang_place_orphans ();
7004 if (!bfd_link_relocatable (&link_info))
7008 /* Merge SEC_MERGE sections. This has to be done after GC of
7009 sections, so that GCed sections are not merged, but before
7010 assigning dynamic symbols, since removing whole input sections
7012 bfd_merge_sections (link_info.output_bfd, &link_info);
7014 /* Look for a text section and set the readonly attribute in it. */
7015 found = bfd_get_section_by_name (link_info.output_bfd, ".text");
7019 if (config.text_read_only)
7020 found->flags |= SEC_READONLY;
7022 found->flags &= ~SEC_READONLY;
7026 /* Do anything special before sizing sections. This is where ELF
7027 and other back-ends size dynamic sections. */
7028 ldemul_before_allocation ();
7030 /* We must record the program headers before we try to fix the
7031 section positions, since they will affect SIZEOF_HEADERS. */
7032 lang_record_phdrs ();
7034 /* Check relro sections. */
7035 if (link_info.relro && !bfd_link_relocatable (&link_info))
7036 lang_find_relro_sections ();
7038 /* Size up the sections. */
7039 lang_size_sections (NULL, !RELAXATION_ENABLED);
7041 /* See if anything special should be done now we know how big
7042 everything is. This is where relaxation is done. */
7043 ldemul_after_allocation ();
7045 /* Fix any .startof. or .sizeof. symbols. */
7046 lang_set_startof ();
7048 /* Do all the assignments, now that we know the final resting places
7049 of all the symbols. */
7050 lang_do_assignments (lang_final_phase_enum);
7054 /* Convert absolute symbols to section relative. */
7055 ldexp_finalize_syms ();
7057 /* Make sure that the section addresses make sense. */
7058 if (command_line.check_section_addresses)
7059 lang_check_section_addresses ();
7061 /* Check any required symbols are known. */
7062 ldlang_check_require_defined_symbols ();
7067 /* EXPORTED TO YACC */
7070 lang_add_wild (struct wildcard_spec *filespec,
7071 struct wildcard_list *section_list,
7072 bfd_boolean keep_sections)
7074 struct wildcard_list *curr, *next;
7075 lang_wild_statement_type *new_stmt;
7077 /* Reverse the list as the parser puts it back to front. */
7078 for (curr = section_list, section_list = NULL;
7080 section_list = curr, curr = next)
7082 if (curr->spec.name != NULL && strcmp (curr->spec.name, "COMMON") == 0)
7083 placed_commons = TRUE;
7086 curr->next = section_list;
7089 if (filespec != NULL && filespec->name != NULL)
7091 if (strcmp (filespec->name, "*") == 0)
7092 filespec->name = NULL;
7093 else if (!wildcardp (filespec->name))
7094 lang_has_input_file = TRUE;
7097 new_stmt = new_stat (lang_wild_statement, stat_ptr);
7098 new_stmt->filename = NULL;
7099 new_stmt->filenames_sorted = FALSE;
7100 new_stmt->section_flag_list = NULL;
7101 new_stmt->exclude_name_list = NULL;
7102 if (filespec != NULL)
7104 new_stmt->filename = filespec->name;
7105 new_stmt->filenames_sorted = filespec->sorted == by_name;
7106 new_stmt->section_flag_list = filespec->section_flag_list;
7107 new_stmt->exclude_name_list = filespec->exclude_name_list;
7109 new_stmt->section_list = section_list;
7110 new_stmt->keep_sections = keep_sections;
7111 lang_list_init (&new_stmt->children);
7112 analyze_walk_wild_section_handler (new_stmt);
7116 lang_section_start (const char *name, etree_type *address,
7117 const segment_type *segment)
7119 lang_address_statement_type *ad;
7121 ad = new_stat (lang_address_statement, stat_ptr);
7122 ad->section_name = name;
7123 ad->address = address;
7124 ad->segment = segment;
7127 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
7128 because of a -e argument on the command line, or zero if this is
7129 called by ENTRY in a linker script. Command line arguments take
7133 lang_add_entry (const char *name, bfd_boolean cmdline)
7135 if (entry_symbol.name == NULL
7137 || !entry_from_cmdline)
7139 entry_symbol.name = name;
7140 entry_from_cmdline = cmdline;
7144 /* Set the default start symbol to NAME. .em files should use this,
7145 not lang_add_entry, to override the use of "start" if neither the
7146 linker script nor the command line specifies an entry point. NAME
7147 must be permanently allocated. */
7149 lang_default_entry (const char *name)
7151 entry_symbol_default = name;
7155 lang_add_target (const char *name)
7157 lang_target_statement_type *new_stmt;
7159 new_stmt = new_stat (lang_target_statement, stat_ptr);
7160 new_stmt->target = name;
7164 lang_add_map (const char *name)
7171 map_option_f = TRUE;
7179 lang_add_fill (fill_type *fill)
7181 lang_fill_statement_type *new_stmt;
7183 new_stmt = new_stat (lang_fill_statement, stat_ptr);
7184 new_stmt->fill = fill;
7188 lang_add_data (int type, union etree_union *exp)
7190 lang_data_statement_type *new_stmt;
7192 new_stmt = new_stat (lang_data_statement, stat_ptr);
7193 new_stmt->exp = exp;
7194 new_stmt->type = type;
7197 /* Create a new reloc statement. RELOC is the BFD relocation type to
7198 generate. HOWTO is the corresponding howto structure (we could
7199 look this up, but the caller has already done so). SECTION is the
7200 section to generate a reloc against, or NAME is the name of the
7201 symbol to generate a reloc against. Exactly one of SECTION and
7202 NAME must be NULL. ADDEND is an expression for the addend. */
7205 lang_add_reloc (bfd_reloc_code_real_type reloc,
7206 reloc_howto_type *howto,
7209 union etree_union *addend)
7211 lang_reloc_statement_type *p = new_stat (lang_reloc_statement, stat_ptr);
7215 p->section = section;
7217 p->addend_exp = addend;
7219 p->addend_value = 0;
7220 p->output_section = NULL;
7221 p->output_offset = 0;
7224 lang_assignment_statement_type *
7225 lang_add_assignment (etree_type *exp)
7227 lang_assignment_statement_type *new_stmt;
7229 new_stmt = new_stat (lang_assignment_statement, stat_ptr);
7230 new_stmt->exp = exp;
7235 lang_add_attribute (enum statement_enum attribute)
7237 new_statement (attribute, sizeof (lang_statement_header_type), stat_ptr);
7241 lang_startup (const char *name)
7243 if (first_file->filename != NULL)
7245 einfo (_("%P%F: multiple STARTUP files\n"));
7247 first_file->filename = name;
7248 first_file->local_sym_name = name;
7249 first_file->flags.real = TRUE;
7253 lang_float (bfd_boolean maybe)
7255 lang_float_flag = maybe;
7259 /* Work out the load- and run-time regions from a script statement, and
7260 store them in *LMA_REGION and *REGION respectively.
7262 MEMSPEC is the name of the run-time region, or the value of
7263 DEFAULT_MEMORY_REGION if the statement didn't specify one.
7264 LMA_MEMSPEC is the name of the load-time region, or null if the
7265 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
7266 had an explicit load address.
7268 It is an error to specify both a load region and a load address. */
7271 lang_get_regions (lang_memory_region_type **region,
7272 lang_memory_region_type **lma_region,
7273 const char *memspec,
7274 const char *lma_memspec,
7275 bfd_boolean have_lma,
7276 bfd_boolean have_vma)
7278 *lma_region = lang_memory_region_lookup (lma_memspec, FALSE);
7280 /* If no runtime region or VMA has been specified, but the load region
7281 has been specified, then use the load region for the runtime region
7283 if (lma_memspec != NULL
7285 && strcmp (memspec, DEFAULT_MEMORY_REGION) == 0)
7286 *region = *lma_region;
7288 *region = lang_memory_region_lookup (memspec, FALSE);
7290 if (have_lma && lma_memspec != 0)
7291 einfo (_("%X%P:%S: section has both a load address and a load region\n"),
7296 lang_leave_output_section_statement (fill_type *fill, const char *memspec,
7297 lang_output_section_phdr_list *phdrs,
7298 const char *lma_memspec)
7300 lang_get_regions (¤t_section->region,
7301 ¤t_section->lma_region,
7302 memspec, lma_memspec,
7303 current_section->load_base != NULL,
7304 current_section->addr_tree != NULL);
7306 /* If this section has no load region or base, but uses the same
7307 region as the previous section, then propagate the previous
7308 section's load region. */
7310 if (current_section->lma_region == NULL
7311 && current_section->load_base == NULL
7312 && current_section->addr_tree == NULL
7313 && current_section->region == current_section->prev->region)
7314 current_section->lma_region = current_section->prev->lma_region;
7316 current_section->fill = fill;
7317 current_section->phdrs = phdrs;
7322 lang_statement_append (lang_statement_list_type *list,
7323 lang_statement_union_type *element,
7324 lang_statement_union_type **field)
7326 *(list->tail) = element;
7330 /* Set the output format type. -oformat overrides scripts. */
7333 lang_add_output_format (const char *format,
7338 if (output_target == NULL || !from_script)
7340 if (command_line.endian == ENDIAN_BIG
7343 else if (command_line.endian == ENDIAN_LITTLE
7347 output_target = format;
7352 lang_add_insert (const char *where, int is_before)
7354 lang_insert_statement_type *new_stmt;
7356 new_stmt = new_stat (lang_insert_statement, stat_ptr);
7357 new_stmt->where = where;
7358 new_stmt->is_before = is_before;
7359 saved_script_handle = previous_script_handle;
7362 /* Enter a group. This creates a new lang_group_statement, and sets
7363 stat_ptr to build new statements within the group. */
7366 lang_enter_group (void)
7368 lang_group_statement_type *g;
7370 g = new_stat (lang_group_statement, stat_ptr);
7371 lang_list_init (&g->children);
7372 push_stat_ptr (&g->children);
7375 /* Leave a group. This just resets stat_ptr to start writing to the
7376 regular list of statements again. Note that this will not work if
7377 groups can occur inside anything else which can adjust stat_ptr,
7378 but currently they can't. */
7381 lang_leave_group (void)
7386 /* Add a new program header. This is called for each entry in a PHDRS
7387 command in a linker script. */
7390 lang_new_phdr (const char *name,
7392 bfd_boolean filehdr,
7397 struct lang_phdr *n, **pp;
7400 n = (struct lang_phdr *) stat_alloc (sizeof (struct lang_phdr));
7403 n->type = exp_get_value_int (type, 0, "program header type");
7404 n->filehdr = filehdr;
7409 hdrs = n->type == 1 && (phdrs || filehdr);
7411 for (pp = &lang_phdr_list; *pp != NULL; pp = &(*pp)->next)
7414 && !((*pp)->filehdr || (*pp)->phdrs))
7416 einfo (_("%X%P:%S: PHDRS and FILEHDR are not supported"
7417 " when prior PT_LOAD headers lack them\n"), NULL);
7424 /* Record the program header information in the output BFD. FIXME: We
7425 should not be calling an ELF specific function here. */
7428 lang_record_phdrs (void)
7432 lang_output_section_phdr_list *last;
7433 struct lang_phdr *l;
7434 lang_output_section_statement_type *os;
7437 secs = (asection **) xmalloc (alc * sizeof (asection *));
7440 for (l = lang_phdr_list; l != NULL; l = l->next)
7447 for (os = &lang_output_section_statement.head->output_section_statement;
7451 lang_output_section_phdr_list *pl;
7453 if (os->constraint < 0)
7461 if (os->sectype == noload_section
7462 || os->bfd_section == NULL
7463 || (os->bfd_section->flags & SEC_ALLOC) == 0)
7466 /* Don't add orphans to PT_INTERP header. */
7472 lang_output_section_statement_type *tmp_os;
7474 /* If we have not run across a section with a program
7475 header assigned to it yet, then scan forwards to find
7476 one. This prevents inconsistencies in the linker's
7477 behaviour when a script has specified just a single
7478 header and there are sections in that script which are
7479 not assigned to it, and which occur before the first
7480 use of that header. See here for more details:
7481 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
7482 for (tmp_os = os; tmp_os; tmp_os = tmp_os->next)
7485 last = tmp_os->phdrs;
7489 einfo (_("%F%P: no sections assigned to phdrs\n"));
7494 if (os->bfd_section == NULL)
7497 for (; pl != NULL; pl = pl->next)
7499 if (strcmp (pl->name, l->name) == 0)
7504 secs = (asection **) xrealloc (secs,
7505 alc * sizeof (asection *));
7507 secs[c] = os->bfd_section;
7514 if (l->flags == NULL)
7517 flags = exp_get_vma (l->flags, 0, "phdr flags");
7522 at = exp_get_vma (l->at, 0, "phdr load address");
7524 if (!bfd_record_phdr (link_info.output_bfd, l->type,
7525 l->flags != NULL, flags, l->at != NULL,
7526 at, l->filehdr, l->phdrs, c, secs))
7527 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
7532 /* Make sure all the phdr assignments succeeded. */
7533 for (os = &lang_output_section_statement.head->output_section_statement;
7537 lang_output_section_phdr_list *pl;
7539 if (os->constraint < 0
7540 || os->bfd_section == NULL)
7543 for (pl = os->phdrs;
7546 if (!pl->used && strcmp (pl->name, "NONE") != 0)
7547 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
7548 os->name, pl->name);
7552 /* Record a list of sections which may not be cross referenced. */
7555 lang_add_nocrossref (lang_nocrossref_type *l)
7557 struct lang_nocrossrefs *n;
7559 n = (struct lang_nocrossrefs *) xmalloc (sizeof *n);
7560 n->next = nocrossref_list;
7562 n->onlyfirst = FALSE;
7563 nocrossref_list = n;
7565 /* Set notice_all so that we get informed about all symbols. */
7566 link_info.notice_all = TRUE;
7569 /* Record a section that cannot be referenced from a list of sections. */
7572 lang_add_nocrossref_to (lang_nocrossref_type *l)
7574 lang_add_nocrossref (l);
7575 nocrossref_list->onlyfirst = TRUE;
7578 /* Overlay handling. We handle overlays with some static variables. */
7580 /* The overlay virtual address. */
7581 static etree_type *overlay_vma;
7582 /* And subsection alignment. */
7583 static etree_type *overlay_subalign;
7585 /* An expression for the maximum section size seen so far. */
7586 static etree_type *overlay_max;
7588 /* A list of all the sections in this overlay. */
7590 struct overlay_list {
7591 struct overlay_list *next;
7592 lang_output_section_statement_type *os;
7595 static struct overlay_list *overlay_list;
7597 /* Start handling an overlay. */
7600 lang_enter_overlay (etree_type *vma_expr, etree_type *subalign)
7602 /* The grammar should prevent nested overlays from occurring. */
7603 ASSERT (overlay_vma == NULL
7604 && overlay_subalign == NULL
7605 && overlay_max == NULL);
7607 overlay_vma = vma_expr;
7608 overlay_subalign = subalign;
7611 /* Start a section in an overlay. We handle this by calling
7612 lang_enter_output_section_statement with the correct VMA.
7613 lang_leave_overlay sets up the LMA and memory regions. */
7616 lang_enter_overlay_section (const char *name)
7618 struct overlay_list *n;
7621 lang_enter_output_section_statement (name, overlay_vma, overlay_section,
7622 0, overlay_subalign, 0, 0, 0);
7624 /* If this is the first section, then base the VMA of future
7625 sections on this one. This will work correctly even if `.' is
7626 used in the addresses. */
7627 if (overlay_list == NULL)
7628 overlay_vma = exp_nameop (ADDR, name);
7630 /* Remember the section. */
7631 n = (struct overlay_list *) xmalloc (sizeof *n);
7632 n->os = current_section;
7633 n->next = overlay_list;
7636 size = exp_nameop (SIZEOF, name);
7638 /* Arrange to work out the maximum section end address. */
7639 if (overlay_max == NULL)
7642 overlay_max = exp_binop (MAX_K, overlay_max, size);
7645 /* Finish a section in an overlay. There isn't any special to do
7649 lang_leave_overlay_section (fill_type *fill,
7650 lang_output_section_phdr_list *phdrs)
7657 name = current_section->name;
7659 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
7660 region and that no load-time region has been specified. It doesn't
7661 really matter what we say here, since lang_leave_overlay will
7663 lang_leave_output_section_statement (fill, DEFAULT_MEMORY_REGION, phdrs, 0);
7665 /* Define the magic symbols. */
7667 clean = (char *) xmalloc (strlen (name) + 1);
7669 for (s1 = name; *s1 != '\0'; s1++)
7670 if (ISALNUM (*s1) || *s1 == '_')
7674 buf = (char *) xmalloc (strlen (clean) + sizeof "__load_start_");
7675 sprintf (buf, "__load_start_%s", clean);
7676 lang_add_assignment (exp_provide (buf,
7677 exp_nameop (LOADADDR, name),
7680 buf = (char *) xmalloc (strlen (clean) + sizeof "__load_stop_");
7681 sprintf (buf, "__load_stop_%s", clean);
7682 lang_add_assignment (exp_provide (buf,
7684 exp_nameop (LOADADDR, name),
7685 exp_nameop (SIZEOF, name)),
7691 /* Finish an overlay. If there are any overlay wide settings, this
7692 looks through all the sections in the overlay and sets them. */
7695 lang_leave_overlay (etree_type *lma_expr,
7698 const char *memspec,
7699 lang_output_section_phdr_list *phdrs,
7700 const char *lma_memspec)
7702 lang_memory_region_type *region;
7703 lang_memory_region_type *lma_region;
7704 struct overlay_list *l;
7705 lang_nocrossref_type *nocrossref;
7707 lang_get_regions (®ion, &lma_region,
7708 memspec, lma_memspec,
7709 lma_expr != NULL, FALSE);
7713 /* After setting the size of the last section, set '.' to end of the
7715 if (overlay_list != NULL)
7717 overlay_list->os->update_dot = 1;
7718 overlay_list->os->update_dot_tree
7719 = exp_assign (".", exp_binop ('+', overlay_vma, overlay_max), FALSE);
7725 struct overlay_list *next;
7727 if (fill != NULL && l->os->fill == NULL)
7730 l->os->region = region;
7731 l->os->lma_region = lma_region;
7733 /* The first section has the load address specified in the
7734 OVERLAY statement. The rest are worked out from that.
7735 The base address is not needed (and should be null) if
7736 an LMA region was specified. */
7739 l->os->load_base = lma_expr;
7740 l->os->sectype = normal_section;
7742 if (phdrs != NULL && l->os->phdrs == NULL)
7743 l->os->phdrs = phdrs;
7747 lang_nocrossref_type *nc;
7749 nc = (lang_nocrossref_type *) xmalloc (sizeof *nc);
7750 nc->name = l->os->name;
7751 nc->next = nocrossref;
7760 if (nocrossref != NULL)
7761 lang_add_nocrossref (nocrossref);
7764 overlay_list = NULL;
7768 /* Version handling. This is only useful for ELF. */
7770 /* If PREV is NULL, return first version pattern matching particular symbol.
7771 If PREV is non-NULL, return first version pattern matching particular
7772 symbol after PREV (previously returned by lang_vers_match). */
7774 static struct bfd_elf_version_expr *
7775 lang_vers_match (struct bfd_elf_version_expr_head *head,
7776 struct bfd_elf_version_expr *prev,
7780 const char *cxx_sym = sym;
7781 const char *java_sym = sym;
7782 struct bfd_elf_version_expr *expr = NULL;
7783 enum demangling_styles curr_style;
7785 curr_style = CURRENT_DEMANGLING_STYLE;
7786 cplus_demangle_set_style (no_demangling);
7787 c_sym = bfd_demangle (link_info.output_bfd, sym, DMGL_NO_OPTS);
7790 cplus_demangle_set_style (curr_style);
7792 if (head->mask & BFD_ELF_VERSION_CXX_TYPE)
7794 cxx_sym = bfd_demangle (link_info.output_bfd, sym,
7795 DMGL_PARAMS | DMGL_ANSI);
7799 if (head->mask & BFD_ELF_VERSION_JAVA_TYPE)
7801 java_sym = bfd_demangle (link_info.output_bfd, sym, DMGL_JAVA);
7806 if (head->htab && (prev == NULL || prev->literal))
7808 struct bfd_elf_version_expr e;
7810 switch (prev ? prev->mask : 0)
7813 if (head->mask & BFD_ELF_VERSION_C_TYPE)
7816 expr = (struct bfd_elf_version_expr *)
7817 htab_find ((htab_t) head->htab, &e);
7818 while (expr && strcmp (expr->pattern, c_sym) == 0)
7819 if (expr->mask == BFD_ELF_VERSION_C_TYPE)
7825 case BFD_ELF_VERSION_C_TYPE:
7826 if (head->mask & BFD_ELF_VERSION_CXX_TYPE)
7828 e.pattern = cxx_sym;
7829 expr = (struct bfd_elf_version_expr *)
7830 htab_find ((htab_t) head->htab, &e);
7831 while (expr && strcmp (expr->pattern, cxx_sym) == 0)
7832 if (expr->mask == BFD_ELF_VERSION_CXX_TYPE)
7838 case BFD_ELF_VERSION_CXX_TYPE:
7839 if (head->mask & BFD_ELF_VERSION_JAVA_TYPE)
7841 e.pattern = java_sym;
7842 expr = (struct bfd_elf_version_expr *)
7843 htab_find ((htab_t) head->htab, &e);
7844 while (expr && strcmp (expr->pattern, java_sym) == 0)
7845 if (expr->mask == BFD_ELF_VERSION_JAVA_TYPE)
7856 /* Finally, try the wildcards. */
7857 if (prev == NULL || prev->literal)
7858 expr = head->remaining;
7861 for (; expr; expr = expr->next)
7868 if (expr->pattern[0] == '*' && expr->pattern[1] == '\0')
7871 if (expr->mask == BFD_ELF_VERSION_JAVA_TYPE)
7873 else if (expr->mask == BFD_ELF_VERSION_CXX_TYPE)
7877 if (fnmatch (expr->pattern, s, 0) == 0)
7883 free ((char *) c_sym);
7885 free ((char *) cxx_sym);
7886 if (java_sym != sym)
7887 free ((char *) java_sym);
7891 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
7892 return a pointer to the symbol name with any backslash quotes removed. */
7895 realsymbol (const char *pattern)
7898 bfd_boolean changed = FALSE, backslash = FALSE;
7899 char *s, *symbol = (char *) xmalloc (strlen (pattern) + 1);
7901 for (p = pattern, s = symbol; *p != '\0'; ++p)
7903 /* It is a glob pattern only if there is no preceding
7907 /* Remove the preceding backslash. */
7914 if (*p == '?' || *p == '*' || *p == '[')
7921 backslash = *p == '\\';
7937 /* This is called for each variable name or match expression. NEW_NAME is
7938 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
7939 pattern to be matched against symbol names. */
7941 struct bfd_elf_version_expr *
7942 lang_new_vers_pattern (struct bfd_elf_version_expr *orig,
7943 const char *new_name,
7945 bfd_boolean literal_p)
7947 struct bfd_elf_version_expr *ret;
7949 ret = (struct bfd_elf_version_expr *) xmalloc (sizeof *ret);
7953 ret->literal = TRUE;
7954 ret->pattern = literal_p ? new_name : realsymbol (new_name);
7955 if (ret->pattern == NULL)
7957 ret->pattern = new_name;
7958 ret->literal = FALSE;
7961 if (lang == NULL || strcasecmp (lang, "C") == 0)
7962 ret->mask = BFD_ELF_VERSION_C_TYPE;
7963 else if (strcasecmp (lang, "C++") == 0)
7964 ret->mask = BFD_ELF_VERSION_CXX_TYPE;
7965 else if (strcasecmp (lang, "Java") == 0)
7966 ret->mask = BFD_ELF_VERSION_JAVA_TYPE;
7969 einfo (_("%X%P: unknown language `%s' in version information\n"),
7971 ret->mask = BFD_ELF_VERSION_C_TYPE;
7974 return ldemul_new_vers_pattern (ret);
7977 /* This is called for each set of variable names and match
7980 struct bfd_elf_version_tree *
7981 lang_new_vers_node (struct bfd_elf_version_expr *globals,
7982 struct bfd_elf_version_expr *locals)
7984 struct bfd_elf_version_tree *ret;
7986 ret = (struct bfd_elf_version_tree *) xcalloc (1, sizeof *ret);
7987 ret->globals.list = globals;
7988 ret->locals.list = locals;
7989 ret->match = lang_vers_match;
7990 ret->name_indx = (unsigned int) -1;
7994 /* This static variable keeps track of version indices. */
7996 static int version_index;
7999 version_expr_head_hash (const void *p)
8001 const struct bfd_elf_version_expr *e =
8002 (const struct bfd_elf_version_expr *) p;
8004 return htab_hash_string (e->pattern);
8008 version_expr_head_eq (const void *p1, const void *p2)
8010 const struct bfd_elf_version_expr *e1 =
8011 (const struct bfd_elf_version_expr *) p1;
8012 const struct bfd_elf_version_expr *e2 =
8013 (const struct bfd_elf_version_expr *) p2;
8015 return strcmp (e1->pattern, e2->pattern) == 0;
8019 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head *head)
8022 struct bfd_elf_version_expr *e, *next;
8023 struct bfd_elf_version_expr **list_loc, **remaining_loc;
8025 for (e = head->list; e; e = e->next)
8029 head->mask |= e->mask;
8034 head->htab = htab_create (count * 2, version_expr_head_hash,
8035 version_expr_head_eq, NULL);
8036 list_loc = &head->list;
8037 remaining_loc = &head->remaining;
8038 for (e = head->list; e; e = next)
8044 remaining_loc = &e->next;
8048 void **loc = htab_find_slot ((htab_t) head->htab, e, INSERT);
8052 struct bfd_elf_version_expr *e1, *last;
8054 e1 = (struct bfd_elf_version_expr *) *loc;
8058 if (e1->mask == e->mask)
8066 while (e1 && strcmp (e1->pattern, e->pattern) == 0);
8070 /* This is a duplicate. */
8071 /* FIXME: Memory leak. Sometimes pattern is not
8072 xmalloced alone, but in larger chunk of memory. */
8073 /* free (e->pattern); */
8078 e->next = last->next;
8086 list_loc = &e->next;
8090 *remaining_loc = NULL;
8091 *list_loc = head->remaining;
8094 head->remaining = head->list;
8097 /* This is called when we know the name and dependencies of the
8101 lang_register_vers_node (const char *name,
8102 struct bfd_elf_version_tree *version,
8103 struct bfd_elf_version_deps *deps)
8105 struct bfd_elf_version_tree *t, **pp;
8106 struct bfd_elf_version_expr *e1;
8111 if (link_info.version_info != NULL
8112 && (name[0] == '\0' || link_info.version_info->name[0] == '\0'))
8114 einfo (_("%X%P: anonymous version tag cannot be combined"
8115 " with other version tags\n"));
8120 /* Make sure this node has a unique name. */
8121 for (t = link_info.version_info; t != NULL; t = t->next)
8122 if (strcmp (t->name, name) == 0)
8123 einfo (_("%X%P: duplicate version tag `%s'\n"), name);
8125 lang_finalize_version_expr_head (&version->globals);
8126 lang_finalize_version_expr_head (&version->locals);
8128 /* Check the global and local match names, and make sure there
8129 aren't any duplicates. */
8131 for (e1 = version->globals.list; e1 != NULL; e1 = e1->next)
8133 for (t = link_info.version_info; t != NULL; t = t->next)
8135 struct bfd_elf_version_expr *e2;
8137 if (t->locals.htab && e1->literal)
8139 e2 = (struct bfd_elf_version_expr *)
8140 htab_find ((htab_t) t->locals.htab, e1);
8141 while (e2 && strcmp (e1->pattern, e2->pattern) == 0)
8143 if (e1->mask == e2->mask)
8144 einfo (_("%X%P: duplicate expression `%s'"
8145 " in version information\n"), e1->pattern);
8149 else if (!e1->literal)
8150 for (e2 = t->locals.remaining; e2 != NULL; e2 = e2->next)
8151 if (strcmp (e1->pattern, e2->pattern) == 0
8152 && e1->mask == e2->mask)
8153 einfo (_("%X%P: duplicate expression `%s'"
8154 " in version information\n"), e1->pattern);
8158 for (e1 = version->locals.list; e1 != NULL; e1 = e1->next)
8160 for (t = link_info.version_info; t != NULL; t = t->next)
8162 struct bfd_elf_version_expr *e2;
8164 if (t->globals.htab && e1->literal)
8166 e2 = (struct bfd_elf_version_expr *)
8167 htab_find ((htab_t) t->globals.htab, e1);
8168 while (e2 && strcmp (e1->pattern, e2->pattern) == 0)
8170 if (e1->mask == e2->mask)
8171 einfo (_("%X%P: duplicate expression `%s'"
8172 " in version information\n"),
8177 else if (!e1->literal)
8178 for (e2 = t->globals.remaining; e2 != NULL; e2 = e2->next)
8179 if (strcmp (e1->pattern, e2->pattern) == 0
8180 && e1->mask == e2->mask)
8181 einfo (_("%X%P: duplicate expression `%s'"
8182 " in version information\n"), e1->pattern);
8186 version->deps = deps;
8187 version->name = name;
8188 if (name[0] != '\0')
8191 version->vernum = version_index;
8194 version->vernum = 0;
8196 for (pp = &link_info.version_info; *pp != NULL; pp = &(*pp)->next)
8201 /* This is called when we see a version dependency. */
8203 struct bfd_elf_version_deps *
8204 lang_add_vers_depend (struct bfd_elf_version_deps *list, const char *name)
8206 struct bfd_elf_version_deps *ret;
8207 struct bfd_elf_version_tree *t;
8209 ret = (struct bfd_elf_version_deps *) xmalloc (sizeof *ret);
8212 for (t = link_info.version_info; t != NULL; t = t->next)
8214 if (strcmp (t->name, name) == 0)
8216 ret->version_needed = t;
8221 einfo (_("%X%P: unable to find version dependency `%s'\n"), name);
8223 ret->version_needed = NULL;
8228 lang_do_version_exports_section (void)
8230 struct bfd_elf_version_expr *greg = NULL, *lreg;
8232 LANG_FOR_EACH_INPUT_STATEMENT (is)
8234 asection *sec = bfd_get_section_by_name (is->the_bfd, ".exports");
8242 contents = (char *) xmalloc (len);
8243 if (!bfd_get_section_contents (is->the_bfd, sec, contents, 0, len))
8244 einfo (_("%X%P: unable to read .exports section contents\n"), sec);
8247 while (p < contents + len)
8249 greg = lang_new_vers_pattern (greg, p, NULL, FALSE);
8250 p = strchr (p, '\0') + 1;
8253 /* Do not free the contents, as we used them creating the regex. */
8255 /* Do not include this section in the link. */
8256 sec->flags |= SEC_EXCLUDE | SEC_KEEP;
8259 lreg = lang_new_vers_pattern (NULL, "*", NULL, FALSE);
8260 lang_register_vers_node (command_line.version_exports_section,
8261 lang_new_vers_node (greg, lreg), NULL);
8264 /* Evaluate LENGTH and ORIGIN parts of MEMORY spec */
8267 lang_do_memory_regions (void)
8269 lang_memory_region_type *r = lang_memory_region_list;
8271 for (; r != NULL; r = r->next)
8275 exp_fold_tree_no_dot (r->origin_exp);
8276 if (expld.result.valid_p)
8278 r->origin = expld.result.value;
8279 r->current = r->origin;
8282 einfo (_("%F%P: invalid origin for memory region %s\n"),
8287 exp_fold_tree_no_dot (r->length_exp);
8288 if (expld.result.valid_p)
8289 r->length = expld.result.value;
8291 einfo (_("%F%P: invalid length for memory region %s\n"),
8298 lang_add_unique (const char *name)
8300 struct unique_sections *ent;
8302 for (ent = unique_section_list; ent; ent = ent->next)
8303 if (strcmp (ent->name, name) == 0)
8306 ent = (struct unique_sections *) xmalloc (sizeof *ent);
8307 ent->name = xstrdup (name);
8308 ent->next = unique_section_list;
8309 unique_section_list = ent;
8312 /* Append the list of dynamic symbols to the existing one. */
8315 lang_append_dynamic_list (struct bfd_elf_version_expr *dynamic)
8317 if (link_info.dynamic_list)
8319 struct bfd_elf_version_expr *tail;
8320 for (tail = dynamic; tail->next != NULL; tail = tail->next)
8322 tail->next = link_info.dynamic_list->head.list;
8323 link_info.dynamic_list->head.list = dynamic;
8327 struct bfd_elf_dynamic_list *d;
8329 d = (struct bfd_elf_dynamic_list *) xcalloc (1, sizeof *d);
8330 d->head.list = dynamic;
8331 d->match = lang_vers_match;
8332 link_info.dynamic_list = d;
8336 /* Append the list of C++ typeinfo dynamic symbols to the existing
8340 lang_append_dynamic_list_cpp_typeinfo (void)
8342 const char *symbols[] =
8344 "typeinfo name for*",
8347 struct bfd_elf_version_expr *dynamic = NULL;
8350 for (i = 0; i < ARRAY_SIZE (symbols); i++)
8351 dynamic = lang_new_vers_pattern (dynamic, symbols [i], "C++",
8354 lang_append_dynamic_list (dynamic);
8357 /* Append the list of C++ operator new and delete dynamic symbols to the
8361 lang_append_dynamic_list_cpp_new (void)
8363 const char *symbols[] =
8368 struct bfd_elf_version_expr *dynamic = NULL;
8371 for (i = 0; i < ARRAY_SIZE (symbols); i++)
8372 dynamic = lang_new_vers_pattern (dynamic, symbols [i], "C++",
8375 lang_append_dynamic_list (dynamic);
8378 /* Scan a space and/or comma separated string of features. */
8381 lang_ld_feature (char *str)
8389 while (*p == ',' || ISSPACE (*p))
8394 while (*q && *q != ',' && !ISSPACE (*q))
8398 if (strcasecmp (p, "SANE_EXPR") == 0)
8399 config.sane_expr = TRUE;
8401 einfo (_("%X%P: unknown feature `%s'\n"), p);
8407 /* Pretty print memory amount. */
8410 lang_print_memory_size (bfd_vma sz)
8412 if ((sz & 0x3fffffff) == 0)
8413 printf ("%10" BFD_VMA_FMT "u GB", sz >> 30);
8414 else if ((sz & 0xfffff) == 0)
8415 printf ("%10" BFD_VMA_FMT "u MB", sz >> 20);
8416 else if ((sz & 0x3ff) == 0)
8417 printf ("%10" BFD_VMA_FMT "u KB", sz >> 10);
8419 printf (" %10" BFD_VMA_FMT "u B", sz);
8422 /* Implement --print-memory-usage: disply per region memory usage. */
8425 lang_print_memory_usage (void)
8427 lang_memory_region_type *r;
8429 printf ("Memory region Used Size Region Size %%age Used\n");
8430 for (r = lang_memory_region_list; r->next != NULL; r = r->next)
8432 bfd_vma used_length = r->current - r->origin;
8435 printf ("%16s: ",r->name_list.name);
8436 lang_print_memory_size (used_length);
8437 lang_print_memory_size ((bfd_vma) r->length);
8439 percent = used_length * 100.0 / r->length;
8441 printf (" %6.2f%%\n", percent);