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"
46 #endif /* ENABLE_PLUGINS */
49 #define offsetof(TYPE, MEMBER) ((size_t) & (((TYPE*) 0)->MEMBER))
52 /* Locals variables. */
53 static struct obstack stat_obstack;
54 static struct obstack map_obstack;
56 #define obstack_chunk_alloc xmalloc
57 #define obstack_chunk_free free
58 static const char *entry_symbol_default = "start";
59 static bfd_boolean placed_commons = FALSE;
60 static bfd_boolean map_head_is_link_order = FALSE;
61 static lang_output_section_statement_type *default_common_section;
62 static bfd_boolean map_option_f;
63 static bfd_vma print_dot;
64 static lang_input_statement_type *first_file;
65 static const char *current_target;
66 static lang_statement_list_type statement_list;
67 static lang_statement_list_type *stat_save[10];
68 static lang_statement_list_type **stat_save_ptr = &stat_save[0];
69 static struct unique_sections *unique_section_list;
70 static struct asneeded_minfo *asneeded_list_head;
71 static bfd_boolean maybe_overlays = FALSE;
73 /* Forward declarations. */
74 static void exp_init_os (etree_type *);
75 static lang_input_statement_type *lookup_name (const char *);
76 static void insert_undefined (const char *);
77 static bfd_boolean sort_def_symbol (struct bfd_link_hash_entry *, void *);
78 static void print_statement (lang_statement_union_type *,
79 lang_output_section_statement_type *);
80 static void print_statement_list (lang_statement_union_type *,
81 lang_output_section_statement_type *);
82 static void print_statements (void);
83 static void print_input_section (asection *, bfd_boolean);
84 static bfd_boolean lang_one_common (struct bfd_link_hash_entry *, void *);
85 static void lang_record_phdrs (void);
86 static void lang_do_version_exports_section (void);
87 static void lang_finalize_version_expr_head
88 (struct bfd_elf_version_expr_head *);
89 static void lang_do_memory_regions (void);
91 /* Exported variables. */
92 const char *output_target;
93 lang_output_section_statement_type *abs_output_section;
94 lang_statement_list_type lang_output_section_statement;
95 lang_statement_list_type *stat_ptr = &statement_list;
96 lang_statement_list_type file_chain = { NULL, NULL };
97 lang_statement_list_type input_file_chain;
98 struct bfd_sym_chain entry_symbol = { NULL, NULL };
99 const char *entry_section = ".text";
100 struct lang_input_statement_flags input_flags;
101 bfd_boolean entry_from_cmdline;
102 bfd_boolean undef_from_cmdline;
103 bfd_boolean lang_has_input_file = FALSE;
104 bfd_boolean had_output_filename = FALSE;
105 bfd_boolean lang_float_flag = FALSE;
106 bfd_boolean delete_output_file_on_failure = FALSE;
107 struct lang_phdr *lang_phdr_list;
108 struct lang_nocrossrefs *nocrossref_list;
109 struct asneeded_minfo **asneeded_list_tail;
111 /* Functions that traverse the linker script and might evaluate
112 DEFINED() need to increment this at the start of the traversal. */
113 int lang_statement_iteration = 0;
115 /* Return TRUE if the PATTERN argument is a wildcard pattern.
116 Although backslashes are treated specially if a pattern contains
117 wildcards, we do not consider the mere presence of a backslash to
118 be enough to cause the pattern to be treated as a wildcard.
119 That lets us handle DOS filenames more naturally. */
120 #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL)
122 #define new_stat(x, y) \
123 (x##_type *) new_statement (x##_enum, sizeof (x##_type), y)
125 #define outside_section_address(q) \
126 ((q)->output_offset + (q)->output_section->vma)
128 #define outside_symbol_address(q) \
129 ((q)->value + outside_section_address (q->section))
131 #define SECTION_NAME_MAP_LENGTH (16)
134 stat_alloc (size_t size)
136 return obstack_alloc (&stat_obstack, size);
140 name_match (const char *pattern, const char *name)
142 if (wildcardp (pattern))
143 return fnmatch (pattern, name, 0);
144 return strcmp (pattern, name);
147 /* If PATTERN is of the form archive:file, return a pointer to the
148 separator. If not, return NULL. */
151 archive_path (const char *pattern)
155 if (link_info.path_separator == 0)
158 p = strchr (pattern, link_info.path_separator);
159 #ifdef HAVE_DOS_BASED_FILE_SYSTEM
160 if (p == NULL || link_info.path_separator != ':')
163 /* Assume a match on the second char is part of drive specifier,
164 as in "c:\silly.dos". */
165 if (p == pattern + 1 && ISALPHA (*pattern))
166 p = strchr (p + 1, link_info.path_separator);
171 /* Given that FILE_SPEC results in a non-NULL SEP result from archive_path,
172 return whether F matches FILE_SPEC. */
175 input_statement_is_archive_path (const char *file_spec, char *sep,
176 lang_input_statement_type *f)
178 bfd_boolean match = FALSE;
181 || name_match (sep + 1, f->filename) == 0)
182 && ((sep != file_spec)
183 == (f->the_bfd != NULL && f->the_bfd->my_archive != NULL)))
187 if (sep != file_spec)
189 const char *aname = f->the_bfd->my_archive->filename;
191 match = name_match (file_spec, aname) == 0;
192 *sep = link_info.path_separator;
199 unique_section_p (const asection *sec,
200 const lang_output_section_statement_type *os)
202 struct unique_sections *unam;
205 if (bfd_link_relocatable (&link_info)
206 && sec->owner != NULL
207 && bfd_is_group_section (sec->owner, sec))
209 && strcmp (os->name, DISCARD_SECTION_NAME) == 0);
212 for (unam = unique_section_list; unam; unam = unam->next)
213 if (name_match (unam->name, secnam) == 0)
219 /* Generic traversal routines for finding matching sections. */
221 /* Try processing a section against a wildcard. This just calls
222 the callback unless the filename exclusion list is present
223 and excludes the file. It's hardly ever present so this
224 function is very fast. */
227 walk_wild_consider_section (lang_wild_statement_type *ptr,
228 lang_input_statement_type *file,
230 struct wildcard_list *sec,
234 struct name_list *list_tmp;
236 /* Don't process sections from files which were excluded. */
237 for (list_tmp = sec->spec.exclude_name_list;
239 list_tmp = list_tmp->next)
241 char *p = archive_path (list_tmp->name);
245 if (input_statement_is_archive_path (list_tmp->name, p, file))
249 else if (name_match (list_tmp->name, file->filename) == 0)
252 /* FIXME: Perhaps remove the following at some stage? Matching
253 unadorned archives like this was never documented and has
254 been superceded by the archive:path syntax. */
255 else if (file->the_bfd != NULL
256 && file->the_bfd->my_archive != NULL
257 && name_match (list_tmp->name,
258 file->the_bfd->my_archive->filename) == 0)
262 (*callback) (ptr, sec, s, ptr->section_flag_list, file, data);
265 /* Lowest common denominator routine that can handle everything correctly,
269 walk_wild_section_general (lang_wild_statement_type *ptr,
270 lang_input_statement_type *file,
275 struct wildcard_list *sec;
277 for (s = file->the_bfd->sections; s != NULL; s = s->next)
279 sec = ptr->section_list;
281 (*callback) (ptr, sec, s, ptr->section_flag_list, file, data);
285 bfd_boolean skip = FALSE;
287 if (sec->spec.name != NULL)
289 const char *sname = bfd_get_section_name (file->the_bfd, s);
291 skip = name_match (sec->spec.name, sname) != 0;
295 walk_wild_consider_section (ptr, file, s, sec, callback, data);
302 /* Routines to find a single section given its name. If there's more
303 than one section with that name, we report that. */
307 asection *found_section;
308 bfd_boolean multiple_sections_found;
309 } section_iterator_callback_data;
312 section_iterator_callback (bfd *abfd ATTRIBUTE_UNUSED, asection *s, void *data)
314 section_iterator_callback_data *d = (section_iterator_callback_data *) data;
316 if (d->found_section != NULL)
318 d->multiple_sections_found = TRUE;
322 d->found_section = s;
327 find_section (lang_input_statement_type *file,
328 struct wildcard_list *sec,
329 bfd_boolean *multiple_sections_found)
331 section_iterator_callback_data cb_data = { NULL, FALSE };
333 bfd_get_section_by_name_if (file->the_bfd, sec->spec.name,
334 section_iterator_callback, &cb_data);
335 *multiple_sections_found = cb_data.multiple_sections_found;
336 return cb_data.found_section;
339 /* Code for handling simple wildcards without going through fnmatch,
340 which can be expensive because of charset translations etc. */
342 /* A simple wild is a literal string followed by a single '*',
343 where the literal part is at least 4 characters long. */
346 is_simple_wild (const char *name)
348 size_t len = strcspn (name, "*?[");
349 return len >= 4 && name[len] == '*' && name[len + 1] == '\0';
353 match_simple_wild (const char *pattern, const char *name)
355 /* The first four characters of the pattern are guaranteed valid
356 non-wildcard characters. So we can go faster. */
357 if (pattern[0] != name[0] || pattern[1] != name[1]
358 || pattern[2] != name[2] || pattern[3] != name[3])
363 while (*pattern != '*')
364 if (*name++ != *pattern++)
370 /* Return the numerical value of the init_priority attribute from
371 section name NAME. */
374 get_init_priority (const char *name)
377 unsigned long init_priority;
379 /* GCC uses the following section names for the init_priority
380 attribute with numerical values 101 and 65535 inclusive. A
381 lower value means a higher priority.
383 1: .init_array.NNNN/.fini_array.NNNN: Where NNNN is the
384 decimal numerical value of the init_priority attribute.
385 The order of execution in .init_array is forward and
386 .fini_array is backward.
387 2: .ctors.NNNN/.dtors.NNNN: Where NNNN is 65535 minus the
388 decimal numerical value of the init_priority attribute.
389 The order of execution in .ctors is backward and .dtors
392 if (strncmp (name, ".init_array.", 12) == 0
393 || strncmp (name, ".fini_array.", 12) == 0)
395 init_priority = strtoul (name + 12, &end, 10);
396 return *end ? 0 : init_priority;
398 else if (strncmp (name, ".ctors.", 7) == 0
399 || strncmp (name, ".dtors.", 7) == 0)
401 init_priority = strtoul (name + 7, &end, 10);
402 return *end ? 0 : 65535 - init_priority;
408 /* Compare sections ASEC and BSEC according to SORT. */
411 compare_section (sort_type sort, asection *asec, asection *bsec)
414 unsigned long ainit_priority, binit_priority;
421 case by_init_priority:
423 = get_init_priority (bfd_get_section_name (asec->owner, asec));
425 = get_init_priority (bfd_get_section_name (bsec->owner, bsec));
426 if (ainit_priority == 0 || binit_priority == 0)
428 ret = ainit_priority - binit_priority;
434 case by_alignment_name:
435 ret = (bfd_section_alignment (bsec->owner, bsec)
436 - bfd_section_alignment (asec->owner, asec));
443 ret = strcmp (bfd_get_section_name (asec->owner, asec),
444 bfd_get_section_name (bsec->owner, bsec));
447 case by_name_alignment:
448 ret = strcmp (bfd_get_section_name (asec->owner, asec),
449 bfd_get_section_name (bsec->owner, bsec));
455 ret = (bfd_section_alignment (bsec->owner, bsec)
456 - bfd_section_alignment (asec->owner, asec));
463 /* Build a Binary Search Tree to sort sections, unlike insertion sort
464 used in wild_sort(). BST is considerably faster if the number of
465 of sections are large. */
467 static lang_section_bst_type **
468 wild_sort_fast (lang_wild_statement_type *wild,
469 struct wildcard_list *sec,
470 lang_input_statement_type *file ATTRIBUTE_UNUSED,
473 lang_section_bst_type **tree;
476 if (!wild->filenames_sorted
477 && (sec == NULL || sec->spec.sorted == none))
479 /* Append at the right end of tree. */
481 tree = &((*tree)->right);
487 /* Find the correct node to append this section. */
488 if (compare_section (sec->spec.sorted, section, (*tree)->section) < 0)
489 tree = &((*tree)->left);
491 tree = &((*tree)->right);
497 /* Use wild_sort_fast to build a BST to sort sections. */
500 output_section_callback_fast (lang_wild_statement_type *ptr,
501 struct wildcard_list *sec,
503 struct flag_info *sflag_list ATTRIBUTE_UNUSED,
504 lang_input_statement_type *file,
507 lang_section_bst_type *node;
508 lang_section_bst_type **tree;
509 lang_output_section_statement_type *os;
511 os = (lang_output_section_statement_type *) output;
513 if (unique_section_p (section, os))
516 node = (lang_section_bst_type *) xmalloc (sizeof (lang_section_bst_type));
519 node->section = section;
521 tree = wild_sort_fast (ptr, sec, file, section);
526 /* Convert a sorted sections' BST back to list form. */
529 output_section_callback_tree_to_list (lang_wild_statement_type *ptr,
530 lang_section_bst_type *tree,
534 output_section_callback_tree_to_list (ptr, tree->left, output);
536 lang_add_section (&ptr->children, tree->section, NULL,
537 (lang_output_section_statement_type *) output);
540 output_section_callback_tree_to_list (ptr, tree->right, output);
545 /* Specialized, optimized routines for handling different kinds of
549 walk_wild_section_specs1_wild0 (lang_wild_statement_type *ptr,
550 lang_input_statement_type *file,
554 /* We can just do a hash lookup for the section with the right name.
555 But if that lookup discovers more than one section with the name
556 (should be rare), we fall back to the general algorithm because
557 we would otherwise have to sort the sections to make sure they
558 get processed in the bfd's order. */
559 bfd_boolean multiple_sections_found;
560 struct wildcard_list *sec0 = ptr->handler_data[0];
561 asection *s0 = find_section (file, sec0, &multiple_sections_found);
563 if (multiple_sections_found)
564 walk_wild_section_general (ptr, file, callback, data);
566 walk_wild_consider_section (ptr, file, s0, sec0, callback, data);
570 walk_wild_section_specs1_wild1 (lang_wild_statement_type *ptr,
571 lang_input_statement_type *file,
576 struct wildcard_list *wildsec0 = ptr->handler_data[0];
578 for (s = file->the_bfd->sections; s != NULL; s = s->next)
580 const char *sname = bfd_get_section_name (file->the_bfd, s);
581 bfd_boolean skip = !match_simple_wild (wildsec0->spec.name, sname);
584 walk_wild_consider_section (ptr, file, s, wildsec0, callback, data);
589 walk_wild_section_specs2_wild1 (lang_wild_statement_type *ptr,
590 lang_input_statement_type *file,
595 struct wildcard_list *sec0 = ptr->handler_data[0];
596 struct wildcard_list *wildsec1 = ptr->handler_data[1];
597 bfd_boolean multiple_sections_found;
598 asection *s0 = find_section (file, sec0, &multiple_sections_found);
600 if (multiple_sections_found)
602 walk_wild_section_general (ptr, file, callback, data);
606 /* Note that if the section was not found, s0 is NULL and
607 we'll simply never succeed the s == s0 test below. */
608 for (s = file->the_bfd->sections; s != NULL; s = s->next)
610 /* Recall that in this code path, a section cannot satisfy more
611 than one spec, so if s == s0 then it cannot match
614 walk_wild_consider_section (ptr, file, s, sec0, callback, data);
617 const char *sname = bfd_get_section_name (file->the_bfd, s);
618 bfd_boolean skip = !match_simple_wild (wildsec1->spec.name, sname);
621 walk_wild_consider_section (ptr, file, s, wildsec1, callback,
628 walk_wild_section_specs3_wild2 (lang_wild_statement_type *ptr,
629 lang_input_statement_type *file,
634 struct wildcard_list *sec0 = ptr->handler_data[0];
635 struct wildcard_list *wildsec1 = ptr->handler_data[1];
636 struct wildcard_list *wildsec2 = ptr->handler_data[2];
637 bfd_boolean multiple_sections_found;
638 asection *s0 = find_section (file, sec0, &multiple_sections_found);
640 if (multiple_sections_found)
642 walk_wild_section_general (ptr, file, callback, data);
646 for (s = file->the_bfd->sections; s != NULL; s = s->next)
649 walk_wild_consider_section (ptr, file, s, sec0, callback, data);
652 const char *sname = bfd_get_section_name (file->the_bfd, s);
653 bfd_boolean skip = !match_simple_wild (wildsec1->spec.name, sname);
656 walk_wild_consider_section (ptr, file, s, wildsec1, callback, data);
659 skip = !match_simple_wild (wildsec2->spec.name, sname);
661 walk_wild_consider_section (ptr, file, s, wildsec2, callback,
669 walk_wild_section_specs4_wild2 (lang_wild_statement_type *ptr,
670 lang_input_statement_type *file,
675 struct wildcard_list *sec0 = ptr->handler_data[0];
676 struct wildcard_list *sec1 = ptr->handler_data[1];
677 struct wildcard_list *wildsec2 = ptr->handler_data[2];
678 struct wildcard_list *wildsec3 = ptr->handler_data[3];
679 bfd_boolean multiple_sections_found;
680 asection *s0 = find_section (file, sec0, &multiple_sections_found), *s1;
682 if (multiple_sections_found)
684 walk_wild_section_general (ptr, file, callback, data);
688 s1 = find_section (file, sec1, &multiple_sections_found);
689 if (multiple_sections_found)
691 walk_wild_section_general (ptr, file, callback, data);
695 for (s = file->the_bfd->sections; s != NULL; s = s->next)
698 walk_wild_consider_section (ptr, file, s, sec0, callback, data);
701 walk_wild_consider_section (ptr, file, s, sec1, callback, data);
704 const char *sname = bfd_get_section_name (file->the_bfd, s);
705 bfd_boolean skip = !match_simple_wild (wildsec2->spec.name,
709 walk_wild_consider_section (ptr, file, s, wildsec2, callback,
713 skip = !match_simple_wild (wildsec3->spec.name, sname);
715 walk_wild_consider_section (ptr, file, s, wildsec3,
723 walk_wild_section (lang_wild_statement_type *ptr,
724 lang_input_statement_type *file,
728 if (file->flags.just_syms)
731 (*ptr->walk_wild_section_handler) (ptr, file, callback, data);
734 /* Returns TRUE when name1 is a wildcard spec that might match
735 something name2 can match. We're conservative: we return FALSE
736 only if the prefixes of name1 and name2 are different up to the
737 first wildcard character. */
740 wild_spec_can_overlap (const char *name1, const char *name2)
742 size_t prefix1_len = strcspn (name1, "?*[");
743 size_t prefix2_len = strcspn (name2, "?*[");
744 size_t min_prefix_len;
746 /* Note that if there is no wildcard character, then we treat the
747 terminating 0 as part of the prefix. Thus ".text" won't match
748 ".text." or ".text.*", for example. */
749 if (name1[prefix1_len] == '\0')
751 if (name2[prefix2_len] == '\0')
754 min_prefix_len = prefix1_len < prefix2_len ? prefix1_len : prefix2_len;
756 return memcmp (name1, name2, min_prefix_len) == 0;
759 /* Select specialized code to handle various kinds of wildcard
763 analyze_walk_wild_section_handler (lang_wild_statement_type *ptr)
766 int wild_name_count = 0;
767 struct wildcard_list *sec;
771 ptr->walk_wild_section_handler = walk_wild_section_general;
772 ptr->handler_data[0] = NULL;
773 ptr->handler_data[1] = NULL;
774 ptr->handler_data[2] = NULL;
775 ptr->handler_data[3] = NULL;
778 /* Count how many wildcard_specs there are, and how many of those
779 actually use wildcards in the name. Also, bail out if any of the
780 wildcard names are NULL. (Can this actually happen?
781 walk_wild_section used to test for it.) And bail out if any
782 of the wildcards are more complex than a simple string
783 ending in a single '*'. */
784 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
787 if (sec->spec.name == NULL)
789 if (wildcardp (sec->spec.name))
792 if (!is_simple_wild (sec->spec.name))
797 /* The zero-spec case would be easy to optimize but it doesn't
798 happen in practice. Likewise, more than 4 specs doesn't
799 happen in practice. */
800 if (sec_count == 0 || sec_count > 4)
803 /* Check that no two specs can match the same section. */
804 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
806 struct wildcard_list *sec2;
807 for (sec2 = sec->next; sec2 != NULL; sec2 = sec2->next)
809 if (wild_spec_can_overlap (sec->spec.name, sec2->spec.name))
814 signature = (sec_count << 8) + wild_name_count;
818 ptr->walk_wild_section_handler = walk_wild_section_specs1_wild0;
821 ptr->walk_wild_section_handler = walk_wild_section_specs1_wild1;
824 ptr->walk_wild_section_handler = walk_wild_section_specs2_wild1;
827 ptr->walk_wild_section_handler = walk_wild_section_specs3_wild2;
830 ptr->walk_wild_section_handler = walk_wild_section_specs4_wild2;
836 /* Now fill the data array with pointers to the specs, first the
837 specs with non-wildcard names, then the specs with wildcard
838 names. It's OK to process the specs in different order from the
839 given order, because we've already determined that no section
840 will match more than one spec. */
842 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
843 if (!wildcardp (sec->spec.name))
844 ptr->handler_data[data_counter++] = sec;
845 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
846 if (wildcardp (sec->spec.name))
847 ptr->handler_data[data_counter++] = sec;
850 /* Handle a wild statement for a single file F. */
853 walk_wild_file (lang_wild_statement_type *s,
854 lang_input_statement_type *f,
858 if (f->the_bfd == NULL
859 || ! bfd_check_format (f->the_bfd, bfd_archive))
860 walk_wild_section (s, f, callback, data);
865 /* This is an archive file. We must map each member of the
866 archive separately. */
867 member = bfd_openr_next_archived_file (f->the_bfd, NULL);
868 while (member != NULL)
870 /* When lookup_name is called, it will call the add_symbols
871 entry point for the archive. For each element of the
872 archive which is included, BFD will call ldlang_add_file,
873 which will set the usrdata field of the member to the
874 lang_input_statement. */
875 if (member->usrdata != NULL)
877 walk_wild_section (s,
878 (lang_input_statement_type *) member->usrdata,
882 member = bfd_openr_next_archived_file (f->the_bfd, member);
888 walk_wild (lang_wild_statement_type *s, callback_t callback, void *data)
890 const char *file_spec = s->filename;
893 if (file_spec == NULL)
895 /* Perform the iteration over all files in the list. */
896 LANG_FOR_EACH_INPUT_STATEMENT (f)
898 walk_wild_file (s, f, callback, data);
901 else if ((p = archive_path (file_spec)) != NULL)
903 LANG_FOR_EACH_INPUT_STATEMENT (f)
905 if (input_statement_is_archive_path (file_spec, p, f))
906 walk_wild_file (s, f, callback, data);
909 else if (wildcardp (file_spec))
911 LANG_FOR_EACH_INPUT_STATEMENT (f)
913 if (fnmatch (file_spec, f->filename, 0) == 0)
914 walk_wild_file (s, f, callback, data);
919 lang_input_statement_type *f;
921 /* Perform the iteration over a single file. */
922 f = lookup_name (file_spec);
924 walk_wild_file (s, f, callback, data);
928 /* lang_for_each_statement walks the parse tree and calls the provided
929 function for each node, except those inside output section statements
930 with constraint set to -1. */
933 lang_for_each_statement_worker (void (*func) (lang_statement_union_type *),
934 lang_statement_union_type *s)
936 for (; s != NULL; s = s->header.next)
940 switch (s->header.type)
942 case lang_constructors_statement_enum:
943 lang_for_each_statement_worker (func, constructor_list.head);
945 case lang_output_section_statement_enum:
946 if (s->output_section_statement.constraint != -1)
947 lang_for_each_statement_worker
948 (func, s->output_section_statement.children.head);
950 case lang_wild_statement_enum:
951 lang_for_each_statement_worker (func,
952 s->wild_statement.children.head);
954 case lang_group_statement_enum:
955 lang_for_each_statement_worker (func,
956 s->group_statement.children.head);
958 case lang_data_statement_enum:
959 case lang_reloc_statement_enum:
960 case lang_object_symbols_statement_enum:
961 case lang_output_statement_enum:
962 case lang_target_statement_enum:
963 case lang_input_section_enum:
964 case lang_input_statement_enum:
965 case lang_assignment_statement_enum:
966 case lang_padding_statement_enum:
967 case lang_address_statement_enum:
968 case lang_fill_statement_enum:
969 case lang_insert_statement_enum:
979 lang_for_each_statement (void (*func) (lang_statement_union_type *))
981 lang_for_each_statement_worker (func, statement_list.head);
984 /*----------------------------------------------------------------------*/
987 lang_list_init (lang_statement_list_type *list)
990 list->tail = &list->head;
994 push_stat_ptr (lang_statement_list_type *new_ptr)
996 if (stat_save_ptr >= stat_save + sizeof (stat_save) / sizeof (stat_save[0]))
998 *stat_save_ptr++ = stat_ptr;
1005 if (stat_save_ptr <= stat_save)
1007 stat_ptr = *--stat_save_ptr;
1010 /* Build a new statement node for the parse tree. */
1012 static lang_statement_union_type *
1013 new_statement (enum statement_enum type,
1015 lang_statement_list_type *list)
1017 lang_statement_union_type *new_stmt;
1019 new_stmt = (lang_statement_union_type *) stat_alloc (size);
1020 new_stmt->header.type = type;
1021 new_stmt->header.next = NULL;
1022 lang_statement_append (list, new_stmt, &new_stmt->header.next);
1026 /* Build a new input file node for the language. There are several
1027 ways in which we treat an input file, eg, we only look at symbols,
1028 or prefix it with a -l etc.
1030 We can be supplied with requests for input files more than once;
1031 they may, for example be split over several lines like foo.o(.text)
1032 foo.o(.data) etc, so when asked for a file we check that we haven't
1033 got it already so we don't duplicate the bfd. */
1035 static lang_input_statement_type *
1036 new_afile (const char *name,
1037 lang_input_file_enum_type file_type,
1039 bfd_boolean add_to_list)
1041 lang_input_statement_type *p;
1043 lang_has_input_file = TRUE;
1046 p = (lang_input_statement_type *) new_stat (lang_input_statement, stat_ptr);
1049 p = (lang_input_statement_type *)
1050 stat_alloc (sizeof (lang_input_statement_type));
1051 p->header.type = lang_input_statement_enum;
1052 p->header.next = NULL;
1055 memset (&p->the_bfd, 0,
1056 sizeof (*p) - offsetof (lang_input_statement_type, the_bfd));
1058 p->flags.dynamic = input_flags.dynamic;
1059 p->flags.add_DT_NEEDED_for_dynamic = input_flags.add_DT_NEEDED_for_dynamic;
1060 p->flags.add_DT_NEEDED_for_regular = input_flags.add_DT_NEEDED_for_regular;
1061 p->flags.whole_archive = input_flags.whole_archive;
1062 p->flags.sysrooted = input_flags.sysrooted;
1066 case lang_input_file_is_symbols_only_enum:
1068 p->local_sym_name = name;
1069 p->flags.real = TRUE;
1070 p->flags.just_syms = TRUE;
1072 case lang_input_file_is_fake_enum:
1074 p->local_sym_name = name;
1076 case lang_input_file_is_l_enum:
1077 if (name[0] == ':' && name[1] != '\0')
1079 p->filename = name + 1;
1080 p->flags.full_name_provided = TRUE;
1084 p->local_sym_name = concat ("-l", name, (const char *) NULL);
1085 p->flags.maybe_archive = TRUE;
1086 p->flags.real = TRUE;
1087 p->flags.search_dirs = TRUE;
1089 case lang_input_file_is_marker_enum:
1091 p->local_sym_name = name;
1092 p->flags.search_dirs = TRUE;
1094 case lang_input_file_is_search_file_enum:
1096 p->local_sym_name = name;
1097 p->flags.real = TRUE;
1098 p->flags.search_dirs = TRUE;
1100 case lang_input_file_is_file_enum:
1102 p->local_sym_name = name;
1103 p->flags.real = TRUE;
1109 lang_statement_append (&input_file_chain,
1110 (lang_statement_union_type *) p,
1111 &p->next_real_file);
1115 lang_input_statement_type *
1116 lang_add_input_file (const char *name,
1117 lang_input_file_enum_type file_type,
1120 if (name != NULL && *name == '=')
1122 lang_input_statement_type *ret;
1123 char *sysrooted_name
1124 = concat (ld_sysroot, name + 1, (const char *) NULL);
1126 /* We've now forcibly prepended the sysroot, making the input
1127 file independent of the context. Therefore, temporarily
1128 force a non-sysrooted context for this statement, so it won't
1129 get the sysroot prepended again when opened. (N.B. if it's a
1130 script, any child nodes with input files starting with "/"
1131 will be handled as "sysrooted" as they'll be found to be
1132 within the sysroot subdirectory.) */
1133 unsigned int outer_sysrooted = input_flags.sysrooted;
1134 input_flags.sysrooted = 0;
1135 ret = new_afile (sysrooted_name, file_type, target, TRUE);
1136 input_flags.sysrooted = outer_sysrooted;
1140 return new_afile (name, file_type, target, TRUE);
1143 struct out_section_hash_entry
1145 struct bfd_hash_entry root;
1146 lang_statement_union_type s;
1149 /* The hash table. */
1151 static struct bfd_hash_table output_section_statement_table;
1153 /* Support routines for the hash table used by lang_output_section_find,
1154 initialize the table, fill in an entry and remove the table. */
1156 static struct bfd_hash_entry *
1157 output_section_statement_newfunc (struct bfd_hash_entry *entry,
1158 struct bfd_hash_table *table,
1161 lang_output_section_statement_type **nextp;
1162 struct out_section_hash_entry *ret;
1166 entry = (struct bfd_hash_entry *) bfd_hash_allocate (table,
1172 entry = bfd_hash_newfunc (entry, table, string);
1176 ret = (struct out_section_hash_entry *) entry;
1177 memset (&ret->s, 0, sizeof (ret->s));
1178 ret->s.header.type = lang_output_section_statement_enum;
1179 ret->s.output_section_statement.subsection_alignment = -1;
1180 ret->s.output_section_statement.section_alignment = -1;
1181 ret->s.output_section_statement.block_value = 1;
1182 lang_list_init (&ret->s.output_section_statement.children);
1183 lang_statement_append (stat_ptr, &ret->s, &ret->s.header.next);
1185 /* For every output section statement added to the list, except the
1186 first one, lang_output_section_statement.tail points to the "next"
1187 field of the last element of the list. */
1188 if (lang_output_section_statement.head != NULL)
1189 ret->s.output_section_statement.prev
1190 = ((lang_output_section_statement_type *)
1191 ((char *) lang_output_section_statement.tail
1192 - offsetof (lang_output_section_statement_type, next)));
1194 /* GCC's strict aliasing rules prevent us from just casting the
1195 address, so we store the pointer in a variable and cast that
1197 nextp = &ret->s.output_section_statement.next;
1198 lang_statement_append (&lang_output_section_statement,
1200 (lang_statement_union_type **) nextp);
1205 output_section_statement_table_init (void)
1207 if (!bfd_hash_table_init_n (&output_section_statement_table,
1208 output_section_statement_newfunc,
1209 sizeof (struct out_section_hash_entry),
1211 einfo (_("%P%F: can not create hash table: %E\n"));
1215 output_section_statement_table_free (void)
1217 bfd_hash_table_free (&output_section_statement_table);
1220 /* Build enough state so that the parser can build its tree. */
1225 obstack_begin (&stat_obstack, 1000);
1227 stat_ptr = &statement_list;
1229 output_section_statement_table_init ();
1231 lang_list_init (stat_ptr);
1233 lang_list_init (&input_file_chain);
1234 lang_list_init (&lang_output_section_statement);
1235 lang_list_init (&file_chain);
1236 first_file = lang_add_input_file (NULL, lang_input_file_is_marker_enum,
1238 abs_output_section =
1239 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME, 0, TRUE);
1241 abs_output_section->bfd_section = bfd_abs_section_ptr;
1243 asneeded_list_head = NULL;
1244 asneeded_list_tail = &asneeded_list_head;
1250 output_section_statement_table_free ();
1253 /*----------------------------------------------------------------------
1254 A region is an area of memory declared with the
1255 MEMORY { name:org=exp, len=exp ... }
1258 We maintain a list of all the regions here.
1260 If no regions are specified in the script, then the default is used
1261 which is created when looked up to be the entire data space.
1263 If create is true we are creating a region inside a MEMORY block.
1264 In this case it is probably an error to create a region that has
1265 already been created. If we are not inside a MEMORY block it is
1266 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1267 and so we issue a warning.
1269 Each region has at least one name. The first name is either
1270 DEFAULT_MEMORY_REGION or the name given in the MEMORY block. You can add
1271 alias names to an existing region within a script with
1272 REGION_ALIAS (alias, region_name). Each name corresponds to at most one
1275 static lang_memory_region_type *lang_memory_region_list;
1276 static lang_memory_region_type **lang_memory_region_list_tail
1277 = &lang_memory_region_list;
1279 lang_memory_region_type *
1280 lang_memory_region_lookup (const char *const name, bfd_boolean create)
1282 lang_memory_region_name *n;
1283 lang_memory_region_type *r;
1284 lang_memory_region_type *new_region;
1286 /* NAME is NULL for LMA memspecs if no region was specified. */
1290 for (r = lang_memory_region_list; r != NULL; r = r->next)
1291 for (n = &r->name_list; n != NULL; n = n->next)
1292 if (strcmp (n->name, name) == 0)
1295 einfo (_("%P:%S: warning: redeclaration of memory region `%s'\n"),
1300 if (!create && strcmp (name, DEFAULT_MEMORY_REGION))
1301 einfo (_("%P:%S: warning: memory region `%s' not declared\n"),
1304 new_region = (lang_memory_region_type *)
1305 stat_alloc (sizeof (lang_memory_region_type));
1307 new_region->name_list.name = xstrdup (name);
1308 new_region->name_list.next = NULL;
1309 new_region->next = NULL;
1310 new_region->origin_exp = NULL;
1311 new_region->origin = 0;
1312 new_region->length_exp = NULL;
1313 new_region->length = ~(bfd_size_type) 0;
1314 new_region->current = 0;
1315 new_region->last_os = NULL;
1316 new_region->flags = 0;
1317 new_region->not_flags = 0;
1318 new_region->had_full_message = FALSE;
1320 *lang_memory_region_list_tail = new_region;
1321 lang_memory_region_list_tail = &new_region->next;
1327 lang_memory_region_alias (const char * alias, const char * region_name)
1329 lang_memory_region_name * n;
1330 lang_memory_region_type * r;
1331 lang_memory_region_type * region;
1333 /* The default region must be unique. This ensures that it is not necessary
1334 to iterate through the name list if someone wants the check if a region is
1335 the default memory region. */
1336 if (strcmp (region_name, DEFAULT_MEMORY_REGION) == 0
1337 || strcmp (alias, DEFAULT_MEMORY_REGION) == 0)
1338 einfo (_("%F%P:%S: error: alias for default memory region\n"), NULL);
1340 /* Look for the target region and check if the alias is not already
1343 for (r = lang_memory_region_list; r != NULL; r = r->next)
1344 for (n = &r->name_list; n != NULL; n = n->next)
1346 if (region == NULL && strcmp (n->name, region_name) == 0)
1348 if (strcmp (n->name, alias) == 0)
1349 einfo (_("%F%P:%S: error: redefinition of memory region "
1354 /* Check if the target region exists. */
1356 einfo (_("%F%P:%S: error: memory region `%s' "
1357 "for alias `%s' does not exist\n"),
1358 NULL, region_name, alias);
1360 /* Add alias to region name list. */
1361 n = (lang_memory_region_name *) stat_alloc (sizeof (lang_memory_region_name));
1362 n->name = xstrdup (alias);
1363 n->next = region->name_list.next;
1364 region->name_list.next = n;
1367 static lang_memory_region_type *
1368 lang_memory_default (asection * section)
1370 lang_memory_region_type *p;
1372 flagword sec_flags = section->flags;
1374 /* Override SEC_DATA to mean a writable section. */
1375 if ((sec_flags & (SEC_ALLOC | SEC_READONLY | SEC_CODE)) == SEC_ALLOC)
1376 sec_flags |= SEC_DATA;
1378 for (p = lang_memory_region_list; p != NULL; p = p->next)
1380 if ((p->flags & sec_flags) != 0
1381 && (p->not_flags & sec_flags) == 0)
1386 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION, FALSE);
1389 /* Get the output section statement directly from the userdata. */
1391 lang_output_section_statement_type *
1392 lang_output_section_get (const asection *output_section)
1394 return get_userdata (output_section);
1397 /* Find or create an output_section_statement with the given NAME.
1398 If CONSTRAINT is non-zero match one with that constraint, otherwise
1399 match any non-negative constraint. If CREATE, always make a
1400 new output_section_statement for SPECIAL CONSTRAINT. */
1402 lang_output_section_statement_type *
1403 lang_output_section_statement_lookup (const char *name,
1407 struct out_section_hash_entry *entry;
1409 entry = ((struct out_section_hash_entry *)
1410 bfd_hash_lookup (&output_section_statement_table, name,
1415 einfo (_("%P%F: failed creating section `%s': %E\n"), name);
1419 if (entry->s.output_section_statement.name != NULL)
1421 /* We have a section of this name, but it might not have the correct
1423 struct out_section_hash_entry *last_ent;
1425 name = entry->s.output_section_statement.name;
1426 if (create && constraint == SPECIAL)
1427 /* Not traversing to the end reverses the order of the second
1428 and subsequent SPECIAL sections in the hash table chain,
1429 but that shouldn't matter. */
1434 if (constraint == entry->s.output_section_statement.constraint
1436 && entry->s.output_section_statement.constraint >= 0))
1437 return &entry->s.output_section_statement;
1439 entry = (struct out_section_hash_entry *) entry->root.next;
1441 while (entry != NULL
1442 && name == entry->s.output_section_statement.name);
1448 = ((struct out_section_hash_entry *)
1449 output_section_statement_newfunc (NULL,
1450 &output_section_statement_table,
1454 einfo (_("%P%F: failed creating section `%s': %E\n"), name);
1457 entry->root = last_ent->root;
1458 last_ent->root.next = &entry->root;
1461 entry->s.output_section_statement.name = name;
1462 entry->s.output_section_statement.constraint = constraint;
1463 return &entry->s.output_section_statement;
1466 /* Find the next output_section_statement with the same name as OS.
1467 If CONSTRAINT is non-zero, find one with that constraint otherwise
1468 match any non-negative constraint. */
1470 lang_output_section_statement_type *
1471 next_matching_output_section_statement (lang_output_section_statement_type *os,
1474 /* All output_section_statements are actually part of a
1475 struct out_section_hash_entry. */
1476 struct out_section_hash_entry *entry = (struct out_section_hash_entry *)
1478 - offsetof (struct out_section_hash_entry, s.output_section_statement));
1479 const char *name = os->name;
1481 ASSERT (name == entry->root.string);
1484 entry = (struct out_section_hash_entry *) entry->root.next;
1486 || name != entry->s.output_section_statement.name)
1489 while (constraint != entry->s.output_section_statement.constraint
1491 || entry->s.output_section_statement.constraint < 0));
1493 return &entry->s.output_section_statement;
1496 /* A variant of lang_output_section_find used by place_orphan.
1497 Returns the output statement that should precede a new output
1498 statement for SEC. If an exact match is found on certain flags,
1501 lang_output_section_statement_type *
1502 lang_output_section_find_by_flags (const asection *sec,
1504 lang_output_section_statement_type **exact,
1505 lang_match_sec_type_func match_type)
1507 lang_output_section_statement_type *first, *look, *found;
1508 flagword look_flags, differ;
1510 /* We know the first statement on this list is *ABS*. May as well
1512 first = &lang_output_section_statement.head->output_section_statement;
1513 first = first->next;
1515 /* First try for an exact match. */
1517 for (look = first; look; look = look->next)
1519 look_flags = look->flags;
1520 if (look->bfd_section != NULL)
1522 look_flags = look->bfd_section->flags;
1523 if (match_type && !match_type (link_info.output_bfd,
1528 differ = look_flags ^ sec_flags;
1529 if (!(differ & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD | SEC_READONLY
1530 | SEC_CODE | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1540 if ((sec_flags & SEC_CODE) != 0
1541 && (sec_flags & SEC_ALLOC) != 0)
1543 /* Try for a rw code section. */
1544 for (look = first; look; look = look->next)
1546 look_flags = look->flags;
1547 if (look->bfd_section != NULL)
1549 look_flags = look->bfd_section->flags;
1550 if (match_type && !match_type (link_info.output_bfd,
1555 differ = look_flags ^ sec_flags;
1556 if (!(differ & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1557 | SEC_CODE | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1561 else if ((sec_flags & SEC_READONLY) != 0
1562 && (sec_flags & SEC_ALLOC) != 0)
1564 /* .rodata can go after .text, .sdata2 after .rodata. */
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_READONLY | SEC_SMALL_DATA))
1579 || (!(differ & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1581 && !(look_flags & SEC_SMALL_DATA)))
1585 else if ((sec_flags & SEC_THREAD_LOCAL) != 0
1586 && (sec_flags & SEC_ALLOC) != 0)
1588 /* .tdata can go after .data, .tbss after .tdata. Treat .tbss
1589 as if it were a loaded section, and don't use match_type. */
1590 bfd_boolean seen_thread_local = FALSE;
1593 for (look = first; look; look = look->next)
1595 look_flags = look->flags;
1596 if (look->bfd_section != NULL)
1597 look_flags = look->bfd_section->flags;
1599 differ = look_flags ^ (sec_flags | SEC_LOAD | SEC_HAS_CONTENTS);
1600 if (!(differ & (SEC_THREAD_LOCAL | SEC_ALLOC)))
1602 /* .tdata and .tbss must be adjacent and in that order. */
1603 if (!(look_flags & SEC_LOAD)
1604 && (sec_flags & SEC_LOAD))
1605 /* ..so if we're at a .tbss section and we're placing
1606 a .tdata section stop looking and return the
1607 previous section. */
1610 seen_thread_local = TRUE;
1612 else if (seen_thread_local)
1614 else if (!(differ & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD)))
1618 else if ((sec_flags & SEC_SMALL_DATA) != 0
1619 && (sec_flags & SEC_ALLOC) != 0)
1621 /* .sdata goes after .data, .sbss after .sdata. */
1622 for (look = first; look; look = look->next)
1624 look_flags = look->flags;
1625 if (look->bfd_section != NULL)
1627 look_flags = look->bfd_section->flags;
1628 if (match_type && !match_type (link_info.output_bfd,
1633 differ = look_flags ^ sec_flags;
1634 if (!(differ & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1635 | SEC_THREAD_LOCAL))
1636 || ((look_flags & SEC_SMALL_DATA)
1637 && !(sec_flags & SEC_HAS_CONTENTS)))
1641 else if ((sec_flags & SEC_HAS_CONTENTS) != 0
1642 && (sec_flags & SEC_ALLOC) != 0)
1644 /* .data goes after .rodata. */
1645 for (look = first; look; look = look->next)
1647 look_flags = look->flags;
1648 if (look->bfd_section != NULL)
1650 look_flags = look->bfd_section->flags;
1651 if (match_type && !match_type (link_info.output_bfd,
1656 differ = look_flags ^ sec_flags;
1657 if (!(differ & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1658 | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1662 else if ((sec_flags & SEC_ALLOC) != 0)
1664 /* .bss goes after any other alloc section. */
1665 for (look = first; look; look = look->next)
1667 look_flags = look->flags;
1668 if (look->bfd_section != NULL)
1670 look_flags = look->bfd_section->flags;
1671 if (match_type && !match_type (link_info.output_bfd,
1676 differ = look_flags ^ sec_flags;
1677 if (!(differ & SEC_ALLOC))
1683 /* non-alloc go last. */
1684 for (look = first; look; look = look->next)
1686 look_flags = look->flags;
1687 if (look->bfd_section != NULL)
1688 look_flags = look->bfd_section->flags;
1689 differ = look_flags ^ sec_flags;
1690 if (!(differ & SEC_DEBUGGING))
1696 if (found || !match_type)
1699 return lang_output_section_find_by_flags (sec, sec_flags, NULL, NULL);
1702 /* Find the last output section before given output statement.
1703 Used by place_orphan. */
1706 output_prev_sec_find (lang_output_section_statement_type *os)
1708 lang_output_section_statement_type *lookup;
1710 for (lookup = os->prev; lookup != NULL; lookup = lookup->prev)
1712 if (lookup->constraint < 0)
1715 if (lookup->bfd_section != NULL && lookup->bfd_section->owner != NULL)
1716 return lookup->bfd_section;
1722 /* Look for a suitable place for a new output section statement. The
1723 idea is to skip over anything that might be inside a SECTIONS {}
1724 statement in a script, before we find another output section
1725 statement. Assignments to "dot" before an output section statement
1726 are assumed to belong to it, except in two cases; The first
1727 assignment to dot, and assignments before non-alloc sections.
1728 Otherwise we might put an orphan before . = . + SIZEOF_HEADERS or
1729 similar assignments that set the initial address, or we might
1730 insert non-alloc note sections among assignments setting end of
1733 static lang_statement_union_type **
1734 insert_os_after (lang_output_section_statement_type *after)
1736 lang_statement_union_type **where;
1737 lang_statement_union_type **assign = NULL;
1738 bfd_boolean ignore_first;
1741 = after == &lang_output_section_statement.head->output_section_statement;
1743 for (where = &after->header.next;
1745 where = &(*where)->header.next)
1747 switch ((*where)->header.type)
1749 case lang_assignment_statement_enum:
1752 lang_assignment_statement_type *ass;
1754 ass = &(*where)->assignment_statement;
1755 if (ass->exp->type.node_class != etree_assert
1756 && ass->exp->assign.dst[0] == '.'
1757 && ass->exp->assign.dst[1] == 0
1761 ignore_first = FALSE;
1763 case lang_wild_statement_enum:
1764 case lang_input_section_enum:
1765 case lang_object_symbols_statement_enum:
1766 case lang_fill_statement_enum:
1767 case lang_data_statement_enum:
1768 case lang_reloc_statement_enum:
1769 case lang_padding_statement_enum:
1770 case lang_constructors_statement_enum:
1773 case lang_output_section_statement_enum:
1776 asection *s = (*where)->output_section_statement.bfd_section;
1779 || s->map_head.s == NULL
1780 || (s->flags & SEC_ALLOC) != 0)
1784 case lang_input_statement_enum:
1785 case lang_address_statement_enum:
1786 case lang_target_statement_enum:
1787 case lang_output_statement_enum:
1788 case lang_group_statement_enum:
1789 case lang_insert_statement_enum:
1798 lang_output_section_statement_type *
1799 lang_insert_orphan (asection *s,
1800 const char *secname,
1802 lang_output_section_statement_type *after,
1803 struct orphan_save *place,
1804 etree_type *address,
1805 lang_statement_list_type *add_child)
1807 lang_statement_list_type add;
1809 lang_assignment_statement_type *start_assign;
1810 lang_output_section_statement_type *os;
1811 lang_output_section_statement_type **os_tail;
1813 /* If we have found an appropriate place for the output section
1814 statements for this orphan, add them to our own private list,
1815 inserting them later into the global statement list. */
1818 lang_list_init (&add);
1819 push_stat_ptr (&add);
1822 if (bfd_link_relocatable (&link_info)
1823 || (s->flags & (SEC_LOAD | SEC_ALLOC)) == 0)
1824 address = exp_intop (0);
1826 os_tail = ((lang_output_section_statement_type **)
1827 lang_output_section_statement.tail);
1828 os = lang_enter_output_section_statement (secname, address, normal_section,
1829 NULL, NULL, NULL, constraint, 0);
1832 start_assign = NULL;
1833 if (config.build_constructors && *os_tail == os)
1835 /* If the name of the section is representable in C, then create
1836 symbols to mark the start and the end of the section. */
1837 for (ps = secname; *ps != '\0'; ps++)
1838 if (! ISALNUM ((unsigned char) *ps) && *ps != '_')
1844 symname = (char *) xmalloc (ps - secname + sizeof "__start_" + 1);
1845 symname[0] = bfd_get_symbol_leading_char (link_info.output_bfd);
1846 sprintf (symname + (symname[0] != 0), "__start_%s", secname);
1848 = lang_add_assignment (exp_provide (symname,
1849 exp_nameop (NAME, "."),
1854 if (add_child == NULL)
1855 add_child = &os->children;
1856 lang_add_section (add_child, s, NULL, os);
1858 if (after && (s->flags & (SEC_LOAD | SEC_ALLOC)) != 0)
1860 const char *region = (after->region
1861 ? after->region->name_list.name
1862 : DEFAULT_MEMORY_REGION);
1863 const char *lma_region = (after->lma_region
1864 ? after->lma_region->name_list.name
1866 lang_leave_output_section_statement (NULL, region, after->phdrs,
1870 lang_leave_output_section_statement (NULL, DEFAULT_MEMORY_REGION, NULL,
1873 if (start_assign != NULL)
1876 lang_assignment_statement_type *stop_assign;
1879 symname = (char *) xmalloc (ps - secname + sizeof "__stop_" + 1);
1880 symname[0] = bfd_get_symbol_leading_char (link_info.output_bfd);
1881 sprintf (symname + (symname[0] != 0), "__stop_%s", secname);
1883 = lang_add_assignment (exp_provide (symname,
1884 exp_nameop (NAME, "."),
1886 /* Evaluate the expression to define the symbol if referenced,
1887 before sizing dynamic sections. */
1888 dot = os->bfd_section->vma;
1889 exp_fold_tree (start_assign->exp, os->bfd_section, &dot);
1891 exp_fold_tree (stop_assign->exp, os->bfd_section, &dot);
1894 /* Restore the global list pointer. */
1898 if (after != NULL && os->bfd_section != NULL)
1900 asection *snew, *as;
1902 snew = os->bfd_section;
1904 /* Shuffle the bfd section list to make the output file look
1905 neater. This is really only cosmetic. */
1906 if (place->section == NULL
1907 && after != (&lang_output_section_statement.head
1908 ->output_section_statement))
1910 asection *bfd_section = after->bfd_section;
1912 /* If the output statement hasn't been used to place any input
1913 sections (and thus doesn't have an output bfd_section),
1914 look for the closest prior output statement having an
1916 if (bfd_section == NULL)
1917 bfd_section = output_prev_sec_find (after);
1919 if (bfd_section != NULL && bfd_section != snew)
1920 place->section = &bfd_section->next;
1923 if (place->section == NULL)
1924 place->section = &link_info.output_bfd->sections;
1926 as = *place->section;
1930 /* Put the section at the end of the list. */
1932 /* Unlink the section. */
1933 bfd_section_list_remove (link_info.output_bfd, snew);
1935 /* Now tack it back on in the right place. */
1936 bfd_section_list_append (link_info.output_bfd, snew);
1938 else if (as != snew && as->prev != snew)
1940 /* Unlink the section. */
1941 bfd_section_list_remove (link_info.output_bfd, snew);
1943 /* Now tack it back on in the right place. */
1944 bfd_section_list_insert_before (link_info.output_bfd, as, snew);
1947 /* Save the end of this list. Further ophans of this type will
1948 follow the one we've just added. */
1949 place->section = &snew->next;
1951 /* The following is non-cosmetic. We try to put the output
1952 statements in some sort of reasonable order here, because they
1953 determine the final load addresses of the orphan sections.
1954 In addition, placing output statements in the wrong order may
1955 require extra segments. For instance, given a typical
1956 situation of all read-only sections placed in one segment and
1957 following that a segment containing all the read-write
1958 sections, we wouldn't want to place an orphan read/write
1959 section before or amongst the read-only ones. */
1960 if (add.head != NULL)
1962 lang_output_section_statement_type *newly_added_os;
1964 if (place->stmt == NULL)
1966 lang_statement_union_type **where = insert_os_after (after);
1971 place->os_tail = &after->next;
1975 /* Put it after the last orphan statement we added. */
1976 *add.tail = *place->stmt;
1977 *place->stmt = add.head;
1980 /* Fix the global list pointer if we happened to tack our
1981 new list at the tail. */
1982 if (*stat_ptr->tail == add.head)
1983 stat_ptr->tail = add.tail;
1985 /* Save the end of this list. */
1986 place->stmt = add.tail;
1988 /* Do the same for the list of output section statements. */
1989 newly_added_os = *os_tail;
1991 newly_added_os->prev = (lang_output_section_statement_type *)
1992 ((char *) place->os_tail
1993 - offsetof (lang_output_section_statement_type, next));
1994 newly_added_os->next = *place->os_tail;
1995 if (newly_added_os->next != NULL)
1996 newly_added_os->next->prev = newly_added_os;
1997 *place->os_tail = newly_added_os;
1998 place->os_tail = &newly_added_os->next;
2000 /* Fixing the global list pointer here is a little different.
2001 We added to the list in lang_enter_output_section_statement,
2002 trimmed off the new output_section_statment above when
2003 assigning *os_tail = NULL, but possibly added it back in
2004 the same place when assigning *place->os_tail. */
2005 if (*os_tail == NULL)
2006 lang_output_section_statement.tail
2007 = (lang_statement_union_type **) os_tail;
2014 lang_print_asneeded (void)
2016 struct asneeded_minfo *m;
2019 if (asneeded_list_head == NULL)
2022 sprintf (buf, _("\nAs-needed library included "
2023 "to satisfy reference by file (symbol)\n\n"));
2026 for (m = asneeded_list_head; m != NULL; m = m->next)
2030 minfo ("%s", m->soname);
2031 len = strlen (m->soname);
2045 minfo ("%B ", m->ref);
2046 minfo ("(%T)\n", m->name);
2051 lang_map_flags (flagword flag)
2053 if (flag & SEC_ALLOC)
2056 if (flag & SEC_CODE)
2059 if (flag & SEC_READONLY)
2062 if (flag & SEC_DATA)
2065 if (flag & SEC_LOAD)
2072 lang_memory_region_type *m;
2073 bfd_boolean dis_header_printed = FALSE;
2075 LANG_FOR_EACH_INPUT_STATEMENT (file)
2079 if ((file->the_bfd->flags & (BFD_LINKER_CREATED | DYNAMIC)) != 0
2080 || file->flags.just_syms)
2083 for (s = file->the_bfd->sections; s != NULL; s = s->next)
2084 if ((s->output_section == NULL
2085 || s->output_section->owner != link_info.output_bfd)
2086 && (s->flags & (SEC_LINKER_CREATED | SEC_KEEP)) == 0)
2088 if (! dis_header_printed)
2090 fprintf (config.map_file, _("\nDiscarded input sections\n\n"));
2091 dis_header_printed = TRUE;
2094 print_input_section (s, TRUE);
2098 minfo (_("\nMemory Configuration\n\n"));
2099 fprintf (config.map_file, "%-16s %-18s %-18s %s\n",
2100 _("Name"), _("Origin"), _("Length"), _("Attributes"));
2102 for (m = lang_memory_region_list; m != NULL; m = m->next)
2107 fprintf (config.map_file, "%-16s ", m->name_list.name);
2109 sprintf_vma (buf, m->origin);
2110 minfo ("0x%s ", buf);
2118 minfo ("0x%V", m->length);
2119 if (m->flags || m->not_flags)
2127 lang_map_flags (m->flags);
2133 lang_map_flags (m->not_flags);
2140 fprintf (config.map_file, _("\nLinker script and memory map\n\n"));
2142 if (! link_info.reduce_memory_overheads)
2144 obstack_begin (&map_obstack, 1000);
2145 bfd_link_hash_traverse (link_info.hash, sort_def_symbol, 0);
2147 lang_statement_iteration++;
2148 print_statements ();
2150 ldemul_extra_map_file_text (link_info.output_bfd, &link_info, config.map_file);
2154 sort_def_symbol (struct bfd_link_hash_entry *hash_entry,
2155 void *info ATTRIBUTE_UNUSED)
2157 if ((hash_entry->type == bfd_link_hash_defined
2158 || hash_entry->type == bfd_link_hash_defweak)
2159 && hash_entry->u.def.section->owner != link_info.output_bfd
2160 && hash_entry->u.def.section->owner != NULL)
2162 input_section_userdata_type *ud;
2163 struct map_symbol_def *def;
2165 ud = ((input_section_userdata_type *)
2166 get_userdata (hash_entry->u.def.section));
2169 ud = (input_section_userdata_type *) stat_alloc (sizeof (*ud));
2170 get_userdata (hash_entry->u.def.section) = ud;
2171 ud->map_symbol_def_tail = &ud->map_symbol_def_head;
2172 ud->map_symbol_def_count = 0;
2174 else if (!ud->map_symbol_def_tail)
2175 ud->map_symbol_def_tail = &ud->map_symbol_def_head;
2177 def = (struct map_symbol_def *) obstack_alloc (&map_obstack, sizeof *def);
2178 def->entry = hash_entry;
2179 *(ud->map_symbol_def_tail) = def;
2180 ud->map_symbol_def_tail = &def->next;
2181 ud->map_symbol_def_count++;
2186 /* Initialize an output section. */
2189 init_os (lang_output_section_statement_type *s, flagword flags)
2191 if (strcmp (s->name, DISCARD_SECTION_NAME) == 0)
2192 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME);
2194 if (s->constraint != SPECIAL)
2195 s->bfd_section = bfd_get_section_by_name (link_info.output_bfd, s->name);
2196 if (s->bfd_section == NULL)
2197 s->bfd_section = bfd_make_section_anyway_with_flags (link_info.output_bfd,
2199 if (s->bfd_section == NULL)
2201 einfo (_("%P%F: output format %s cannot represent section called %s\n"),
2202 link_info.output_bfd->xvec->name, s->name);
2204 s->bfd_section->output_section = s->bfd_section;
2205 s->bfd_section->output_offset = 0;
2207 /* Set the userdata of the output section to the output section
2208 statement to avoid lookup. */
2209 get_userdata (s->bfd_section) = s;
2211 /* If there is a base address, make sure that any sections it might
2212 mention are initialized. */
2213 if (s->addr_tree != NULL)
2214 exp_init_os (s->addr_tree);
2216 if (s->load_base != NULL)
2217 exp_init_os (s->load_base);
2219 /* If supplied an alignment, set it. */
2220 if (s->section_alignment != -1)
2221 s->bfd_section->alignment_power = s->section_alignment;
2224 /* Make sure that all output sections mentioned in an expression are
2228 exp_init_os (etree_type *exp)
2230 switch (exp->type.node_class)
2234 exp_init_os (exp->assign.src);
2238 exp_init_os (exp->binary.lhs);
2239 exp_init_os (exp->binary.rhs);
2243 exp_init_os (exp->trinary.cond);
2244 exp_init_os (exp->trinary.lhs);
2245 exp_init_os (exp->trinary.rhs);
2249 exp_init_os (exp->assert_s.child);
2253 exp_init_os (exp->unary.child);
2257 switch (exp->type.node_code)
2263 lang_output_section_statement_type *os;
2265 os = lang_output_section_find (exp->name.name);
2266 if (os != NULL && os->bfd_section == NULL)
2278 section_already_linked (bfd *abfd, asection *sec, void *data)
2280 lang_input_statement_type *entry = (lang_input_statement_type *) data;
2282 /* If we are only reading symbols from this object, then we want to
2283 discard all sections. */
2284 if (entry->flags.just_syms)
2286 bfd_link_just_syms (abfd, sec, &link_info);
2290 if (!(abfd->flags & DYNAMIC))
2291 bfd_section_already_linked (abfd, sec, &link_info);
2294 /* The wild routines.
2296 These expand statements like *(.text) and foo.o to a list of
2297 explicit actions, like foo.o(.text), bar.o(.text) and
2298 foo.o(.text, .data). */
2300 /* Add SECTION to the output section OUTPUT. Do this by creating a
2301 lang_input_section statement which is placed at PTR. */
2304 lang_add_section (lang_statement_list_type *ptr,
2306 struct flag_info *sflag_info,
2307 lang_output_section_statement_type *output)
2309 flagword flags = section->flags;
2311 bfd_boolean discard;
2312 lang_input_section_type *new_section;
2313 bfd *abfd = link_info.output_bfd;
2315 /* Discard sections marked with SEC_EXCLUDE. */
2316 discard = (flags & SEC_EXCLUDE) != 0;
2318 /* Discard input sections which are assigned to a section named
2319 DISCARD_SECTION_NAME. */
2320 if (strcmp (output->name, DISCARD_SECTION_NAME) == 0)
2323 /* Discard debugging sections if we are stripping debugging
2325 if ((link_info.strip == strip_debugger || link_info.strip == strip_all)
2326 && (flags & SEC_DEBUGGING) != 0)
2331 if (section->output_section == NULL)
2333 /* This prevents future calls from assigning this section. */
2334 section->output_section = bfd_abs_section_ptr;
2343 keep = bfd_lookup_section_flags (&link_info, sflag_info, section);
2348 if (section->output_section != NULL)
2351 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2352 to an output section, because we want to be able to include a
2353 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2354 section (I don't know why we want to do this, but we do).
2355 build_link_order in ldwrite.c handles this case by turning
2356 the embedded SEC_NEVER_LOAD section into a fill. */
2357 flags &= ~ SEC_NEVER_LOAD;
2359 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2360 already been processed. One reason to do this is that on pe
2361 format targets, .text$foo sections go into .text and it's odd
2362 to see .text with SEC_LINK_ONCE set. */
2364 if (!bfd_link_relocatable (&link_info))
2365 flags &= ~(SEC_LINK_ONCE | SEC_LINK_DUPLICATES | SEC_RELOC);
2367 switch (output->sectype)
2369 case normal_section:
2370 case overlay_section:
2372 case noalloc_section:
2373 flags &= ~SEC_ALLOC;
2375 case noload_section:
2377 flags |= SEC_NEVER_LOAD;
2378 /* Unfortunately GNU ld has managed to evolve two different
2379 meanings to NOLOAD in scripts. ELF gets a .bss style noload,
2380 alloc, no contents section. All others get a noload, noalloc
2382 if (bfd_get_flavour (link_info.output_bfd) == bfd_target_elf_flavour)
2383 flags &= ~SEC_HAS_CONTENTS;
2385 flags &= ~SEC_ALLOC;
2389 if (output->bfd_section == NULL)
2390 init_os (output, flags);
2392 /* If SEC_READONLY is not set in the input section, then clear
2393 it from the output section. */
2394 output->bfd_section->flags &= flags | ~SEC_READONLY;
2396 if (output->bfd_section->linker_has_input)
2398 /* Only set SEC_READONLY flag on the first input section. */
2399 flags &= ~ SEC_READONLY;
2401 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2402 if ((output->bfd_section->flags & (SEC_MERGE | SEC_STRINGS))
2403 != (flags & (SEC_MERGE | SEC_STRINGS))
2404 || ((flags & SEC_MERGE) != 0
2405 && output->bfd_section->entsize != section->entsize))
2407 output->bfd_section->flags &= ~ (SEC_MERGE | SEC_STRINGS);
2408 flags &= ~ (SEC_MERGE | SEC_STRINGS);
2411 output->bfd_section->flags |= flags;
2413 if (!output->bfd_section->linker_has_input)
2415 output->bfd_section->linker_has_input = 1;
2416 /* This must happen after flags have been updated. The output
2417 section may have been created before we saw its first input
2418 section, eg. for a data statement. */
2419 bfd_init_private_section_data (section->owner, section,
2420 link_info.output_bfd,
2421 output->bfd_section,
2423 if ((flags & SEC_MERGE) != 0)
2424 output->bfd_section->entsize = section->entsize;
2427 if ((flags & SEC_TIC54X_BLOCK) != 0
2428 && bfd_get_arch (section->owner) == bfd_arch_tic54x)
2430 /* FIXME: This value should really be obtained from the bfd... */
2431 output->block_value = 128;
2434 if (section->alignment_power > output->bfd_section->alignment_power)
2435 output->bfd_section->alignment_power = section->alignment_power;
2437 section->output_section = output->bfd_section;
2439 if (!map_head_is_link_order)
2441 asection *s = output->bfd_section->map_tail.s;
2442 output->bfd_section->map_tail.s = section;
2443 section->map_head.s = NULL;
2444 section->map_tail.s = s;
2446 s->map_head.s = section;
2448 output->bfd_section->map_head.s = section;
2451 /* Add a section reference to the list. */
2452 new_section = new_stat (lang_input_section, ptr);
2453 new_section->section = section;
2456 /* Handle wildcard sorting. This returns the lang_input_section which
2457 should follow the one we are going to create for SECTION and FILE,
2458 based on the sorting requirements of WILD. It returns NULL if the
2459 new section should just go at the end of the current list. */
2461 static lang_statement_union_type *
2462 wild_sort (lang_wild_statement_type *wild,
2463 struct wildcard_list *sec,
2464 lang_input_statement_type *file,
2467 lang_statement_union_type *l;
2469 if (!wild->filenames_sorted
2470 && (sec == NULL || sec->spec.sorted == none))
2473 for (l = wild->children.head; l != NULL; l = l->header.next)
2475 lang_input_section_type *ls;
2477 if (l->header.type != lang_input_section_enum)
2479 ls = &l->input_section;
2481 /* Sorting by filename takes precedence over sorting by section
2484 if (wild->filenames_sorted)
2486 const char *fn, *ln;
2490 /* The PE support for the .idata section as generated by
2491 dlltool assumes that files will be sorted by the name of
2492 the archive and then the name of the file within the
2495 if (file->the_bfd != NULL
2496 && bfd_my_archive (file->the_bfd) != NULL)
2498 fn = bfd_get_filename (bfd_my_archive (file->the_bfd));
2503 fn = file->filename;
2507 if (bfd_my_archive (ls->section->owner) != NULL)
2509 ln = bfd_get_filename (bfd_my_archive (ls->section->owner));
2514 ln = ls->section->owner->filename;
2518 i = filename_cmp (fn, ln);
2527 fn = file->filename;
2529 ln = ls->section->owner->filename;
2531 i = filename_cmp (fn, ln);
2539 /* Here either the files are not sorted by name, or we are
2540 looking at the sections for this file. */
2543 && sec->spec.sorted != none
2544 && sec->spec.sorted != by_none)
2545 if (compare_section (sec->spec.sorted, section, ls->section) < 0)
2552 /* Expand a wild statement for a particular FILE. SECTION may be
2553 NULL, in which case it is a wild card. */
2556 output_section_callback (lang_wild_statement_type *ptr,
2557 struct wildcard_list *sec,
2559 struct flag_info *sflag_info,
2560 lang_input_statement_type *file,
2563 lang_statement_union_type *before;
2564 lang_output_section_statement_type *os;
2566 os = (lang_output_section_statement_type *) output;
2568 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2569 if (unique_section_p (section, os))
2572 before = wild_sort (ptr, sec, file, section);
2574 /* Here BEFORE points to the lang_input_section which
2575 should follow the one we are about to add. If BEFORE
2576 is NULL, then the section should just go at the end
2577 of the current list. */
2580 lang_add_section (&ptr->children, section, sflag_info, os);
2583 lang_statement_list_type list;
2584 lang_statement_union_type **pp;
2586 lang_list_init (&list);
2587 lang_add_section (&list, section, sflag_info, os);
2589 /* If we are discarding the section, LIST.HEAD will
2591 if (list.head != NULL)
2593 ASSERT (list.head->header.next == NULL);
2595 for (pp = &ptr->children.head;
2597 pp = &(*pp)->header.next)
2598 ASSERT (*pp != NULL);
2600 list.head->header.next = *pp;
2606 /* Check if all sections in a wild statement for a particular FILE
2610 check_section_callback (lang_wild_statement_type *ptr ATTRIBUTE_UNUSED,
2611 struct wildcard_list *sec ATTRIBUTE_UNUSED,
2613 struct flag_info *sflag_info ATTRIBUTE_UNUSED,
2614 lang_input_statement_type *file ATTRIBUTE_UNUSED,
2617 lang_output_section_statement_type *os;
2619 os = (lang_output_section_statement_type *) output;
2621 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2622 if (unique_section_p (section, os))
2625 if (section->output_section == NULL && (section->flags & SEC_READONLY) == 0)
2626 os->all_input_readonly = FALSE;
2629 /* This is passed a file name which must have been seen already and
2630 added to the statement tree. We will see if it has been opened
2631 already and had its symbols read. If not then we'll read it. */
2633 static lang_input_statement_type *
2634 lookup_name (const char *name)
2636 lang_input_statement_type *search;
2638 for (search = (lang_input_statement_type *) input_file_chain.head;
2640 search = (lang_input_statement_type *) search->next_real_file)
2642 /* Use the local_sym_name as the name of the file that has
2643 already been loaded as filename might have been transformed
2644 via the search directory lookup mechanism. */
2645 const char *filename = search->local_sym_name;
2647 if (filename != NULL
2648 && filename_cmp (filename, name) == 0)
2653 search = new_afile (name, lang_input_file_is_search_file_enum,
2654 default_target, FALSE);
2656 /* If we have already added this file, or this file is not real
2657 don't add this file. */
2658 if (search->flags.loaded || !search->flags.real)
2661 if (! load_symbols (search, NULL))
2667 /* Save LIST as a list of libraries whose symbols should not be exported. */
2672 struct excluded_lib *next;
2674 static struct excluded_lib *excluded_libs;
2677 add_excluded_libs (const char *list)
2679 const char *p = list, *end;
2683 struct excluded_lib *entry;
2684 end = strpbrk (p, ",:");
2686 end = p + strlen (p);
2687 entry = (struct excluded_lib *) xmalloc (sizeof (*entry));
2688 entry->next = excluded_libs;
2689 entry->name = (char *) xmalloc (end - p + 1);
2690 memcpy (entry->name, p, end - p);
2691 entry->name[end - p] = '\0';
2692 excluded_libs = entry;
2700 check_excluded_libs (bfd *abfd)
2702 struct excluded_lib *lib = excluded_libs;
2706 int len = strlen (lib->name);
2707 const char *filename = lbasename (abfd->filename);
2709 if (strcmp (lib->name, "ALL") == 0)
2711 abfd->no_export = TRUE;
2715 if (filename_ncmp (lib->name, filename, len) == 0
2716 && (filename[len] == '\0'
2717 || (filename[len] == '.' && filename[len + 1] == 'a'
2718 && filename[len + 2] == '\0')))
2720 abfd->no_export = TRUE;
2728 /* Get the symbols for an input file. */
2731 load_symbols (lang_input_statement_type *entry,
2732 lang_statement_list_type *place)
2736 if (entry->flags.loaded)
2739 ldfile_open_file (entry);
2741 /* Do not process further if the file was missing. */
2742 if (entry->flags.missing_file)
2745 if (! bfd_check_format (entry->the_bfd, bfd_archive)
2746 && ! bfd_check_format_matches (entry->the_bfd, bfd_object, &matching))
2749 struct lang_input_statement_flags save_flags;
2752 err = bfd_get_error ();
2754 /* See if the emulation has some special knowledge. */
2755 if (ldemul_unrecognized_file (entry))
2758 if (err == bfd_error_file_ambiguously_recognized)
2762 einfo (_("%B: file not recognized: %E\n"), entry->the_bfd);
2763 einfo (_("%B: matching formats:"), entry->the_bfd);
2764 for (p = matching; *p != NULL; p++)
2768 else if (err != bfd_error_file_not_recognized
2770 einfo (_("%F%B: file not recognized: %E\n"), entry->the_bfd);
2772 bfd_close (entry->the_bfd);
2773 entry->the_bfd = NULL;
2775 /* Try to interpret the file as a linker script. */
2776 save_flags = input_flags;
2777 ldfile_open_command_file (entry->filename);
2779 push_stat_ptr (place);
2780 input_flags.add_DT_NEEDED_for_regular
2781 = entry->flags.add_DT_NEEDED_for_regular;
2782 input_flags.add_DT_NEEDED_for_dynamic
2783 = entry->flags.add_DT_NEEDED_for_dynamic;
2784 input_flags.whole_archive = entry->flags.whole_archive;
2785 input_flags.dynamic = entry->flags.dynamic;
2787 ldfile_assumed_script = TRUE;
2788 parser_input = input_script;
2790 ldfile_assumed_script = FALSE;
2792 /* missing_file is sticky. sysrooted will already have been
2793 restored when seeing EOF in yyparse, but no harm to restore
2795 save_flags.missing_file |= input_flags.missing_file;
2796 input_flags = save_flags;
2800 entry->flags.loaded = TRUE;
2805 if (ldemul_recognized_file (entry))
2808 /* We don't call ldlang_add_file for an archive. Instead, the
2809 add_symbols entry point will call ldlang_add_file, via the
2810 add_archive_element callback, for each element of the archive
2812 switch (bfd_get_format (entry->the_bfd))
2818 if (!entry->flags.reload)
2819 ldlang_add_file (entry);
2820 if (trace_files || verbose)
2821 info_msg ("%I\n", entry);
2825 check_excluded_libs (entry->the_bfd);
2827 if (entry->flags.whole_archive)
2830 bfd_boolean loaded = TRUE;
2835 member = bfd_openr_next_archived_file (entry->the_bfd, member);
2840 if (! bfd_check_format (member, bfd_object))
2842 einfo (_("%F%B: member %B in archive is not an object\n"),
2843 entry->the_bfd, member);
2848 if (!(*link_info.callbacks
2849 ->add_archive_element) (&link_info, member,
2850 "--whole-archive", &subsbfd))
2853 /* Potentially, the add_archive_element hook may have set a
2854 substitute BFD for us. */
2855 if (!bfd_link_add_symbols (subsbfd, &link_info))
2857 einfo (_("%F%B: error adding symbols: %E\n"), member);
2862 entry->flags.loaded = loaded;
2868 if (bfd_link_add_symbols (entry->the_bfd, &link_info))
2869 entry->flags.loaded = TRUE;
2871 einfo (_("%F%B: error adding symbols: %E\n"), entry->the_bfd);
2873 return entry->flags.loaded;
2876 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2877 may be NULL, indicating that it is a wildcard. Separate
2878 lang_input_section statements are created for each part of the
2879 expansion; they are added after the wild statement S. OUTPUT is
2880 the output section. */
2883 wild (lang_wild_statement_type *s,
2884 const char *target ATTRIBUTE_UNUSED,
2885 lang_output_section_statement_type *output)
2887 struct wildcard_list *sec;
2889 if (s->handler_data[0]
2890 && s->handler_data[0]->spec.sorted == by_name
2891 && !s->filenames_sorted)
2893 lang_section_bst_type *tree;
2895 walk_wild (s, output_section_callback_fast, output);
2900 output_section_callback_tree_to_list (s, tree, output);
2905 walk_wild (s, output_section_callback, output);
2907 if (default_common_section == NULL)
2908 for (sec = s->section_list; sec != NULL; sec = sec->next)
2909 if (sec->spec.name != NULL && strcmp (sec->spec.name, "COMMON") == 0)
2911 /* Remember the section that common is going to in case we
2912 later get something which doesn't know where to put it. */
2913 default_common_section = output;
2918 /* Return TRUE iff target is the sought target. */
2921 get_target (const bfd_target *target, void *data)
2923 const char *sought = (const char *) data;
2925 return strcmp (target->name, sought) == 0;
2928 /* Like strcpy() but convert to lower case as well. */
2931 stricpy (char *dest, char *src)
2935 while ((c = *src++) != 0)
2936 *dest++ = TOLOWER (c);
2941 /* Remove the first occurrence of needle (if any) in haystack
2945 strcut (char *haystack, char *needle)
2947 haystack = strstr (haystack, needle);
2953 for (src = haystack + strlen (needle); *src;)
2954 *haystack++ = *src++;
2960 /* Compare two target format name strings.
2961 Return a value indicating how "similar" they are. */
2964 name_compare (char *first, char *second)
2970 copy1 = (char *) xmalloc (strlen (first) + 1);
2971 copy2 = (char *) xmalloc (strlen (second) + 1);
2973 /* Convert the names to lower case. */
2974 stricpy (copy1, first);
2975 stricpy (copy2, second);
2977 /* Remove size and endian strings from the name. */
2978 strcut (copy1, "big");
2979 strcut (copy1, "little");
2980 strcut (copy2, "big");
2981 strcut (copy2, "little");
2983 /* Return a value based on how many characters match,
2984 starting from the beginning. If both strings are
2985 the same then return 10 * their length. */
2986 for (result = 0; copy1[result] == copy2[result]; result++)
2987 if (copy1[result] == 0)
2999 /* Set by closest_target_match() below. */
3000 static const bfd_target *winner;
3002 /* Scan all the valid bfd targets looking for one that has the endianness
3003 requirement that was specified on the command line, and is the nearest
3004 match to the original output target. */
3007 closest_target_match (const bfd_target *target, void *data)
3009 const bfd_target *original = (const bfd_target *) data;
3011 if (command_line.endian == ENDIAN_BIG
3012 && target->byteorder != BFD_ENDIAN_BIG)
3015 if (command_line.endian == ENDIAN_LITTLE
3016 && target->byteorder != BFD_ENDIAN_LITTLE)
3019 /* Must be the same flavour. */
3020 if (target->flavour != original->flavour)
3023 /* Ignore generic big and little endian elf vectors. */
3024 if (strcmp (target->name, "elf32-big") == 0
3025 || strcmp (target->name, "elf64-big") == 0
3026 || strcmp (target->name, "elf32-little") == 0
3027 || strcmp (target->name, "elf64-little") == 0)
3030 /* If we have not found a potential winner yet, then record this one. */
3037 /* Oh dear, we now have two potential candidates for a successful match.
3038 Compare their names and choose the better one. */
3039 if (name_compare (target->name, original->name)
3040 > name_compare (winner->name, original->name))
3043 /* Keep on searching until wqe have checked them all. */
3047 /* Return the BFD target format of the first input file. */
3050 get_first_input_target (void)
3052 char *target = NULL;
3054 LANG_FOR_EACH_INPUT_STATEMENT (s)
3056 if (s->header.type == lang_input_statement_enum
3059 ldfile_open_file (s);
3061 if (s->the_bfd != NULL
3062 && bfd_check_format (s->the_bfd, bfd_object))
3064 target = bfd_get_target (s->the_bfd);
3076 lang_get_output_target (void)
3080 /* Has the user told us which output format to use? */
3081 if (output_target != NULL)
3082 return output_target;
3084 /* No - has the current target been set to something other than
3086 if (current_target != default_target && current_target != NULL)
3087 return current_target;
3089 /* No - can we determine the format of the first input file? */
3090 target = get_first_input_target ();
3094 /* Failed - use the default output target. */
3095 return default_target;
3098 /* Open the output file. */
3101 open_output (const char *name)
3103 output_target = lang_get_output_target ();
3105 /* Has the user requested a particular endianness on the command
3107 if (command_line.endian != ENDIAN_UNSET)
3109 const bfd_target *target;
3110 enum bfd_endian desired_endian;
3112 /* Get the chosen target. */
3113 target = bfd_search_for_target (get_target, (void *) output_target);
3115 /* If the target is not supported, we cannot do anything. */
3118 if (command_line.endian == ENDIAN_BIG)
3119 desired_endian = BFD_ENDIAN_BIG;
3121 desired_endian = BFD_ENDIAN_LITTLE;
3123 /* See if the target has the wrong endianness. This should
3124 not happen if the linker script has provided big and
3125 little endian alternatives, but some scrips don't do
3127 if (target->byteorder != desired_endian)
3129 /* If it does, then see if the target provides
3130 an alternative with the correct endianness. */
3131 if (target->alternative_target != NULL
3132 && (target->alternative_target->byteorder == desired_endian))
3133 output_target = target->alternative_target->name;
3136 /* Try to find a target as similar as possible to
3137 the default target, but which has the desired
3138 endian characteristic. */
3139 bfd_search_for_target (closest_target_match,
3142 /* Oh dear - we could not find any targets that
3143 satisfy our requirements. */
3145 einfo (_("%P: warning: could not find any targets"
3146 " that match endianness requirement\n"));
3148 output_target = winner->name;
3154 link_info.output_bfd = bfd_openw (name, output_target);
3156 if (link_info.output_bfd == NULL)
3158 if (bfd_get_error () == bfd_error_invalid_target)
3159 einfo (_("%P%F: target %s not found\n"), output_target);
3161 einfo (_("%P%F: cannot open output file %s: %E\n"), name);
3164 delete_output_file_on_failure = TRUE;
3166 if (! bfd_set_format (link_info.output_bfd, bfd_object))
3167 einfo (_("%P%F:%s: can not make object file: %E\n"), name);
3168 if (! bfd_set_arch_mach (link_info.output_bfd,
3169 ldfile_output_architecture,
3170 ldfile_output_machine))
3171 einfo (_("%P%F:%s: can not set architecture: %E\n"), name);
3173 link_info.hash = bfd_link_hash_table_create (link_info.output_bfd);
3174 if (link_info.hash == NULL)
3175 einfo (_("%P%F: can not create hash table: %E\n"));
3177 bfd_set_gp_size (link_info.output_bfd, g_switch_value);
3181 ldlang_open_output (lang_statement_union_type *statement)
3183 switch (statement->header.type)
3185 case lang_output_statement_enum:
3186 ASSERT (link_info.output_bfd == NULL);
3187 open_output (statement->output_statement.name);
3188 ldemul_set_output_arch ();
3189 if (config.magic_demand_paged
3190 && !bfd_link_relocatable (&link_info))
3191 link_info.output_bfd->flags |= D_PAGED;
3193 link_info.output_bfd->flags &= ~D_PAGED;
3194 if (config.text_read_only)
3195 link_info.output_bfd->flags |= WP_TEXT;
3197 link_info.output_bfd->flags &= ~WP_TEXT;
3198 if (link_info.traditional_format)
3199 link_info.output_bfd->flags |= BFD_TRADITIONAL_FORMAT;
3201 link_info.output_bfd->flags &= ~BFD_TRADITIONAL_FORMAT;
3204 case lang_target_statement_enum:
3205 current_target = statement->target_statement.target;
3212 /* Convert between addresses in bytes and sizes in octets.
3213 For currently supported targets, octets_per_byte is always a power
3214 of two, so we can use shifts. */
3215 #define TO_ADDR(X) ((X) >> opb_shift)
3216 #define TO_SIZE(X) ((X) << opb_shift)
3218 /* Support the above. */
3219 static unsigned int opb_shift = 0;
3224 unsigned x = bfd_arch_mach_octets_per_byte (ldfile_output_architecture,
3225 ldfile_output_machine);
3228 while ((x & 1) == 0)
3236 /* Open all the input files. */
3240 OPEN_BFD_NORMAL = 0,
3244 #ifdef ENABLE_PLUGINS
3245 static lang_input_statement_type *plugin_insert = NULL;
3249 open_input_bfds (lang_statement_union_type *s, enum open_bfd_mode mode)
3251 for (; s != NULL; s = s->header.next)
3253 switch (s->header.type)
3255 case lang_constructors_statement_enum:
3256 open_input_bfds (constructor_list.head, mode);
3258 case lang_output_section_statement_enum:
3259 open_input_bfds (s->output_section_statement.children.head, mode);
3261 case lang_wild_statement_enum:
3262 /* Maybe we should load the file's symbols. */
3263 if ((mode & OPEN_BFD_RESCAN) == 0
3264 && s->wild_statement.filename
3265 && !wildcardp (s->wild_statement.filename)
3266 && !archive_path (s->wild_statement.filename))
3267 lookup_name (s->wild_statement.filename);
3268 open_input_bfds (s->wild_statement.children.head, mode);
3270 case lang_group_statement_enum:
3272 struct bfd_link_hash_entry *undefs;
3274 /* We must continually search the entries in the group
3275 until no new symbols are added to the list of undefined
3280 undefs = link_info.hash->undefs_tail;
3281 open_input_bfds (s->group_statement.children.head,
3282 mode | OPEN_BFD_FORCE);
3284 while (undefs != link_info.hash->undefs_tail);
3287 case lang_target_statement_enum:
3288 current_target = s->target_statement.target;
3290 case lang_input_statement_enum:
3291 if (s->input_statement.flags.real)
3293 lang_statement_union_type **os_tail;
3294 lang_statement_list_type add;
3297 s->input_statement.target = current_target;
3299 /* If we are being called from within a group, and this
3300 is an archive which has already been searched, then
3301 force it to be researched unless the whole archive
3302 has been loaded already. Do the same for a rescan.
3303 Likewise reload --as-needed shared libs. */
3304 if (mode != OPEN_BFD_NORMAL
3305 #ifdef ENABLE_PLUGINS
3306 && ((mode & OPEN_BFD_RESCAN) == 0
3307 || plugin_insert == NULL)
3309 && s->input_statement.flags.loaded
3310 && (abfd = s->input_statement.the_bfd) != NULL
3311 && ((bfd_get_format (abfd) == bfd_archive
3312 && !s->input_statement.flags.whole_archive)
3313 || (bfd_get_format (abfd) == bfd_object
3314 && ((abfd->flags) & DYNAMIC) != 0
3315 && s->input_statement.flags.add_DT_NEEDED_for_regular
3316 && bfd_get_flavour (abfd) == bfd_target_elf_flavour
3317 && (elf_dyn_lib_class (abfd) & DYN_AS_NEEDED) != 0)))
3319 s->input_statement.flags.loaded = FALSE;
3320 s->input_statement.flags.reload = TRUE;
3323 os_tail = lang_output_section_statement.tail;
3324 lang_list_init (&add);
3326 if (! load_symbols (&s->input_statement, &add))
3327 config.make_executable = FALSE;
3329 if (add.head != NULL)
3331 /* If this was a script with output sections then
3332 tack any added statements on to the end of the
3333 list. This avoids having to reorder the output
3334 section statement list. Very likely the user
3335 forgot -T, and whatever we do here will not meet
3336 naive user expectations. */
3337 if (os_tail != lang_output_section_statement.tail)
3339 einfo (_("%P: warning: %s contains output sections;"
3340 " did you forget -T?\n"),
3341 s->input_statement.filename);
3342 *stat_ptr->tail = add.head;
3343 stat_ptr->tail = add.tail;
3347 *add.tail = s->header.next;
3348 s->header.next = add.head;
3352 #ifdef ENABLE_PLUGINS
3353 /* If we have found the point at which a plugin added new
3354 files, clear plugin_insert to enable archive rescan. */
3355 if (&s->input_statement == plugin_insert)
3356 plugin_insert = NULL;
3359 case lang_assignment_statement_enum:
3360 if (s->assignment_statement.exp->assign.defsym)
3361 /* This is from a --defsym on the command line. */
3362 exp_fold_tree_no_dot (s->assignment_statement.exp);
3369 /* Exit if any of the files were missing. */
3370 if (input_flags.missing_file)
3374 /* Add the supplied name to the symbol table as an undefined reference.
3375 This is a two step process as the symbol table doesn't even exist at
3376 the time the ld command line is processed. First we put the name
3377 on a list, then, once the output file has been opened, transfer the
3378 name to the symbol table. */
3380 typedef struct bfd_sym_chain ldlang_undef_chain_list_type;
3382 #define ldlang_undef_chain_list_head entry_symbol.next
3385 ldlang_add_undef (const char *const name, bfd_boolean cmdline)
3387 ldlang_undef_chain_list_type *new_undef;
3389 undef_from_cmdline = undef_from_cmdline || cmdline;
3390 new_undef = (ldlang_undef_chain_list_type *) stat_alloc (sizeof (*new_undef));
3391 new_undef->next = ldlang_undef_chain_list_head;
3392 ldlang_undef_chain_list_head = new_undef;
3394 new_undef->name = xstrdup (name);
3396 if (link_info.output_bfd != NULL)
3397 insert_undefined (new_undef->name);
3400 /* Insert NAME as undefined in the symbol table. */
3403 insert_undefined (const char *name)
3405 struct bfd_link_hash_entry *h;
3407 h = bfd_link_hash_lookup (link_info.hash, name, TRUE, FALSE, TRUE);
3409 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
3410 if (h->type == bfd_link_hash_new)
3412 h->type = bfd_link_hash_undefined;
3413 h->u.undef.abfd = NULL;
3414 bfd_link_add_undef (link_info.hash, h);
3418 /* Run through the list of undefineds created above and place them
3419 into the linker hash table as undefined symbols belonging to the
3423 lang_place_undefineds (void)
3425 ldlang_undef_chain_list_type *ptr;
3427 for (ptr = ldlang_undef_chain_list_head; ptr != NULL; ptr = ptr->next)
3428 insert_undefined (ptr->name);
3431 /* Structure used to build the list of symbols that the user has required
3434 struct require_defined_symbol
3437 struct require_defined_symbol *next;
3440 /* The list of symbols that the user has required be defined. */
3442 static struct require_defined_symbol *require_defined_symbol_list;
3444 /* Add a new symbol NAME to the list of symbols that are required to be
3448 ldlang_add_require_defined (const char * const name)
3450 struct require_defined_symbol *ptr;
3452 ldlang_add_undef (name, TRUE);
3453 ptr = (struct require_defined_symbol *) stat_alloc (sizeof (*ptr));
3454 ptr->next = require_defined_symbol_list;
3455 ptr->name = strdup (name);
3456 require_defined_symbol_list = ptr;
3459 /* Check that all symbols the user required to be defined, are defined,
3460 raise an error if we find a symbol that is not defined. */
3463 ldlang_check_require_defined_symbols (void)
3465 struct require_defined_symbol *ptr;
3467 for (ptr = require_defined_symbol_list; ptr != NULL; ptr = ptr->next)
3469 struct bfd_link_hash_entry *h;
3471 h = bfd_link_hash_lookup (link_info.hash, ptr->name,
3472 FALSE, FALSE, TRUE);
3474 || (h->type != bfd_link_hash_defined
3475 && h->type != bfd_link_hash_defweak))
3476 einfo(_("%P%X: required symbol `%s' not defined\n"), ptr->name);
3480 /* Check for all readonly or some readwrite sections. */
3483 check_input_sections
3484 (lang_statement_union_type *s,
3485 lang_output_section_statement_type *output_section_statement)
3487 for (; s != (lang_statement_union_type *) NULL; s = s->header.next)
3489 switch (s->header.type)
3491 case lang_wild_statement_enum:
3492 walk_wild (&s->wild_statement, check_section_callback,
3493 output_section_statement);
3494 if (! output_section_statement->all_input_readonly)
3497 case lang_constructors_statement_enum:
3498 check_input_sections (constructor_list.head,
3499 output_section_statement);
3500 if (! output_section_statement->all_input_readonly)
3503 case lang_group_statement_enum:
3504 check_input_sections (s->group_statement.children.head,
3505 output_section_statement);
3506 if (! output_section_statement->all_input_readonly)
3515 /* Update wildcard statements if needed. */
3518 update_wild_statements (lang_statement_union_type *s)
3520 struct wildcard_list *sec;
3522 switch (sort_section)
3532 for (; s != NULL; s = s->header.next)
3534 switch (s->header.type)
3539 case lang_wild_statement_enum:
3540 for (sec = s->wild_statement.section_list; sec != NULL;
3543 switch (sec->spec.sorted)
3546 sec->spec.sorted = sort_section;
3549 if (sort_section == by_alignment)
3550 sec->spec.sorted = by_name_alignment;
3553 if (sort_section == by_name)
3554 sec->spec.sorted = by_alignment_name;
3562 case lang_constructors_statement_enum:
3563 update_wild_statements (constructor_list.head);
3566 case lang_output_section_statement_enum:
3567 /* Don't sort .init/.fini sections. */
3568 if (strcmp (s->output_section_statement.name, ".init") != 0
3569 && strcmp (s->output_section_statement.name, ".fini") != 0)
3570 update_wild_statements
3571 (s->output_section_statement.children.head);
3574 case lang_group_statement_enum:
3575 update_wild_statements (s->group_statement.children.head);
3583 /* Open input files and attach to output sections. */
3586 map_input_to_output_sections
3587 (lang_statement_union_type *s, const char *target,
3588 lang_output_section_statement_type *os)
3590 for (; s != NULL; s = s->header.next)
3592 lang_output_section_statement_type *tos;
3595 switch (s->header.type)
3597 case lang_wild_statement_enum:
3598 wild (&s->wild_statement, target, os);
3600 case lang_constructors_statement_enum:
3601 map_input_to_output_sections (constructor_list.head,
3605 case lang_output_section_statement_enum:
3606 tos = &s->output_section_statement;
3607 if (tos->constraint != 0)
3609 if (tos->constraint != ONLY_IF_RW
3610 && tos->constraint != ONLY_IF_RO)
3612 tos->all_input_readonly = TRUE;
3613 check_input_sections (tos->children.head, tos);
3614 if (tos->all_input_readonly != (tos->constraint == ONLY_IF_RO))
3616 tos->constraint = -1;
3620 map_input_to_output_sections (tos->children.head,
3624 case lang_output_statement_enum:
3626 case lang_target_statement_enum:
3627 target = s->target_statement.target;
3629 case lang_group_statement_enum:
3630 map_input_to_output_sections (s->group_statement.children.head,
3634 case lang_data_statement_enum:
3635 /* Make sure that any sections mentioned in the expression
3637 exp_init_os (s->data_statement.exp);
3638 /* The output section gets CONTENTS, ALLOC and LOAD, but
3639 these may be overridden by the script. */
3640 flags = SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD;
3641 switch (os->sectype)
3643 case normal_section:
3644 case overlay_section:
3646 case noalloc_section:
3647 flags = SEC_HAS_CONTENTS;
3649 case noload_section:
3650 if (bfd_get_flavour (link_info.output_bfd)
3651 == bfd_target_elf_flavour)
3652 flags = SEC_NEVER_LOAD | SEC_ALLOC;
3654 flags = SEC_NEVER_LOAD | SEC_HAS_CONTENTS;
3657 if (os->bfd_section == NULL)
3658 init_os (os, flags);
3660 os->bfd_section->flags |= flags;
3662 case lang_input_section_enum:
3664 case lang_fill_statement_enum:
3665 case lang_object_symbols_statement_enum:
3666 case lang_reloc_statement_enum:
3667 case lang_padding_statement_enum:
3668 case lang_input_statement_enum:
3669 if (os != NULL && os->bfd_section == NULL)
3672 case lang_assignment_statement_enum:
3673 if (os != NULL && os->bfd_section == NULL)
3676 /* Make sure that any sections mentioned in the assignment
3678 exp_init_os (s->assignment_statement.exp);
3680 case lang_address_statement_enum:
3681 /* Mark the specified section with the supplied address.
3682 If this section was actually a segment marker, then the
3683 directive is ignored if the linker script explicitly
3684 processed the segment marker. Originally, the linker
3685 treated segment directives (like -Ttext on the
3686 command-line) as section directives. We honor the
3687 section directive semantics for backwards compatibilty;
3688 linker scripts that do not specifically check for
3689 SEGMENT_START automatically get the old semantics. */
3690 if (!s->address_statement.segment
3691 || !s->address_statement.segment->used)
3693 const char *name = s->address_statement.section_name;
3695 /* Create the output section statement here so that
3696 orphans with a set address will be placed after other
3697 script sections. If we let the orphan placement code
3698 place them in amongst other sections then the address
3699 will affect following script sections, which is
3700 likely to surprise naive users. */
3701 tos = lang_output_section_statement_lookup (name, 0, TRUE);
3702 tos->addr_tree = s->address_statement.address;
3703 if (tos->bfd_section == NULL)
3707 case lang_insert_statement_enum:
3713 /* An insert statement snips out all the linker statements from the
3714 start of the list and places them after the output section
3715 statement specified by the insert. This operation is complicated
3716 by the fact that we keep a doubly linked list of output section
3717 statements as well as the singly linked list of all statements. */
3720 process_insert_statements (void)
3722 lang_statement_union_type **s;
3723 lang_output_section_statement_type *first_os = NULL;
3724 lang_output_section_statement_type *last_os = NULL;
3725 lang_output_section_statement_type *os;
3727 /* "start of list" is actually the statement immediately after
3728 the special abs_section output statement, so that it isn't
3730 s = &lang_output_section_statement.head;
3731 while (*(s = &(*s)->header.next) != NULL)
3733 if ((*s)->header.type == lang_output_section_statement_enum)
3735 /* Keep pointers to the first and last output section
3736 statement in the sequence we may be about to move. */
3737 os = &(*s)->output_section_statement;
3739 ASSERT (last_os == NULL || last_os->next == os);
3742 /* Set constraint negative so that lang_output_section_find
3743 won't match this output section statement. At this
3744 stage in linking constraint has values in the range
3745 [-1, ONLY_IN_RW]. */
3746 last_os->constraint = -2 - last_os->constraint;
3747 if (first_os == NULL)
3750 else if ((*s)->header.type == lang_insert_statement_enum)
3752 lang_insert_statement_type *i = &(*s)->insert_statement;
3753 lang_output_section_statement_type *where;
3754 lang_statement_union_type **ptr;
3755 lang_statement_union_type *first;
3757 where = lang_output_section_find (i->where);
3758 if (where != NULL && i->is_before)
3761 where = where->prev;
3762 while (where != NULL && where->constraint < 0);
3766 einfo (_("%F%P: %s not found for insert\n"), i->where);
3770 /* Deal with reordering the output section statement list. */
3771 if (last_os != NULL)
3773 asection *first_sec, *last_sec;
3774 struct lang_output_section_statement_struct **next;
3776 /* Snip out the output sections we are moving. */
3777 first_os->prev->next = last_os->next;
3778 if (last_os->next == NULL)
3780 next = &first_os->prev->next;
3781 lang_output_section_statement.tail
3782 = (lang_statement_union_type **) next;
3785 last_os->next->prev = first_os->prev;
3786 /* Add them in at the new position. */
3787 last_os->next = where->next;
3788 if (where->next == NULL)
3790 next = &last_os->next;
3791 lang_output_section_statement.tail
3792 = (lang_statement_union_type **) next;
3795 where->next->prev = last_os;
3796 first_os->prev = where;
3797 where->next = first_os;
3799 /* Move the bfd sections in the same way. */
3802 for (os = first_os; os != NULL; os = os->next)
3804 os->constraint = -2 - os->constraint;
3805 if (os->bfd_section != NULL
3806 && os->bfd_section->owner != NULL)
3808 last_sec = os->bfd_section;
3809 if (first_sec == NULL)
3810 first_sec = last_sec;
3815 if (last_sec != NULL)
3817 asection *sec = where->bfd_section;
3819 sec = output_prev_sec_find (where);
3821 /* The place we want to insert must come after the
3822 sections we are moving. So if we find no
3823 section or if the section is the same as our
3824 last section, then no move is needed. */
3825 if (sec != NULL && sec != last_sec)
3827 /* Trim them off. */
3828 if (first_sec->prev != NULL)
3829 first_sec->prev->next = last_sec->next;
3831 link_info.output_bfd->sections = last_sec->next;
3832 if (last_sec->next != NULL)
3833 last_sec->next->prev = first_sec->prev;
3835 link_info.output_bfd->section_last = first_sec->prev;
3837 last_sec->next = sec->next;
3838 if (sec->next != NULL)
3839 sec->next->prev = last_sec;
3841 link_info.output_bfd->section_last = last_sec;
3842 first_sec->prev = sec;
3843 sec->next = first_sec;
3851 ptr = insert_os_after (where);
3852 /* Snip everything after the abs_section output statement we
3853 know is at the start of the list, up to and including
3854 the insert statement we are currently processing. */
3855 first = lang_output_section_statement.head->header.next;
3856 lang_output_section_statement.head->header.next = (*s)->header.next;
3857 /* Add them back where they belong. */
3860 statement_list.tail = s;
3862 s = &lang_output_section_statement.head;
3866 /* Undo constraint twiddling. */
3867 for (os = first_os; os != NULL; os = os->next)
3869 os->constraint = -2 - os->constraint;
3875 /* An output section might have been removed after its statement was
3876 added. For example, ldemul_before_allocation can remove dynamic
3877 sections if they turn out to be not needed. Clean them up here. */
3880 strip_excluded_output_sections (void)
3882 lang_output_section_statement_type *os;
3884 /* Run lang_size_sections (if not already done). */
3885 if (expld.phase != lang_mark_phase_enum)
3887 expld.phase = lang_mark_phase_enum;
3888 expld.dataseg.phase = exp_dataseg_none;
3889 one_lang_size_sections_pass (NULL, FALSE);
3890 lang_reset_memory_regions ();
3893 for (os = &lang_output_section_statement.head->output_section_statement;
3897 asection *output_section;
3898 bfd_boolean exclude;
3900 if (os->constraint < 0)
3903 output_section = os->bfd_section;
3904 if (output_section == NULL)
3907 exclude = (output_section->rawsize == 0
3908 && (output_section->flags & SEC_KEEP) == 0
3909 && !bfd_section_removed_from_list (link_info.output_bfd,
3912 /* Some sections have not yet been sized, notably .gnu.version,
3913 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3914 input sections, so don't drop output sections that have such
3915 input sections unless they are also marked SEC_EXCLUDE. */
3916 if (exclude && output_section->map_head.s != NULL)
3920 for (s = output_section->map_head.s; s != NULL; s = s->map_head.s)
3921 if ((s->flags & SEC_EXCLUDE) == 0
3922 && ((s->flags & SEC_LINKER_CREATED) != 0
3923 || link_info.emitrelocations))
3932 /* We don't set bfd_section to NULL since bfd_section of the
3933 removed output section statement may still be used. */
3934 if (!os->update_dot)
3936 output_section->flags |= SEC_EXCLUDE;
3937 bfd_section_list_remove (link_info.output_bfd, output_section);
3938 link_info.output_bfd->section_count--;
3943 /* Called from ldwrite to clear out asection.map_head and
3944 asection.map_tail for use as link_orders in ldwrite.
3945 FIXME: Except for sh64elf.em which starts creating link_orders in
3946 its after_allocation routine so needs to call it early. */
3949 lang_clear_os_map (void)
3951 lang_output_section_statement_type *os;
3953 if (map_head_is_link_order)
3956 for (os = &lang_output_section_statement.head->output_section_statement;
3960 asection *output_section;
3962 if (os->constraint < 0)
3965 output_section = os->bfd_section;
3966 if (output_section == NULL)
3969 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3970 output_section->map_head.link_order = NULL;
3971 output_section->map_tail.link_order = NULL;
3974 /* Stop future calls to lang_add_section from messing with map_head
3975 and map_tail link_order fields. */
3976 map_head_is_link_order = TRUE;
3980 print_output_section_statement
3981 (lang_output_section_statement_type *output_section_statement)
3983 asection *section = output_section_statement->bfd_section;
3986 if (output_section_statement != abs_output_section)
3988 minfo ("\n%s", output_section_statement->name);
3990 if (section != NULL)
3992 print_dot = section->vma;
3994 len = strlen (output_section_statement->name);
3995 if (len >= SECTION_NAME_MAP_LENGTH - 1)
4000 while (len < SECTION_NAME_MAP_LENGTH)
4006 minfo ("0x%V %W", section->vma, section->size);
4008 if (section->vma != section->lma)
4009 minfo (_(" load address 0x%V"), section->lma);
4011 if (output_section_statement->update_dot_tree != NULL)
4012 exp_fold_tree (output_section_statement->update_dot_tree,
4013 bfd_abs_section_ptr, &print_dot);
4019 print_statement_list (output_section_statement->children.head,
4020 output_section_statement);
4024 print_assignment (lang_assignment_statement_type *assignment,
4025 lang_output_section_statement_type *output_section)
4032 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
4035 if (assignment->exp->type.node_class == etree_assert)
4038 tree = assignment->exp->assert_s.child;
4042 const char *dst = assignment->exp->assign.dst;
4044 is_dot = (dst[0] == '.' && dst[1] == 0);
4046 expld.assign_name = dst;
4047 tree = assignment->exp->assign.src;
4050 osec = output_section->bfd_section;
4052 osec = bfd_abs_section_ptr;
4054 if (assignment->exp->type.node_class != etree_provide)
4055 exp_fold_tree (tree, osec, &print_dot);
4057 expld.result.valid_p = FALSE;
4059 if (expld.result.valid_p)
4063 if (assignment->exp->type.node_class == etree_assert
4065 || expld.assign_name != NULL)
4067 value = expld.result.value;
4069 if (expld.result.section != NULL)
4070 value += expld.result.section->vma;
4072 minfo ("0x%V", value);
4078 struct bfd_link_hash_entry *h;
4080 h = bfd_link_hash_lookup (link_info.hash, assignment->exp->assign.dst,
4081 FALSE, FALSE, TRUE);
4084 value = h->u.def.value;
4085 value += h->u.def.section->output_section->vma;
4086 value += h->u.def.section->output_offset;
4088 minfo ("[0x%V]", value);
4091 minfo ("[unresolved]");
4096 if (assignment->exp->type.node_class == etree_provide)
4097 minfo ("[!provide]");
4104 expld.assign_name = NULL;
4107 exp_print_tree (assignment->exp);
4112 print_input_statement (lang_input_statement_type *statm)
4114 if (statm->filename != NULL
4115 && (statm->the_bfd == NULL
4116 || (statm->the_bfd->flags & BFD_LINKER_CREATED) == 0))
4117 fprintf (config.map_file, "LOAD %s\n", statm->filename);
4120 /* Print all symbols defined in a particular section. This is called
4121 via bfd_link_hash_traverse, or by print_all_symbols. */
4124 print_one_symbol (struct bfd_link_hash_entry *hash_entry, void *ptr)
4126 asection *sec = (asection *) ptr;
4128 if ((hash_entry->type == bfd_link_hash_defined
4129 || hash_entry->type == bfd_link_hash_defweak)
4130 && sec == hash_entry->u.def.section)
4134 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
4137 (hash_entry->u.def.value
4138 + hash_entry->u.def.section->output_offset
4139 + hash_entry->u.def.section->output_section->vma));
4141 minfo (" %T\n", hash_entry->root.string);
4148 hash_entry_addr_cmp (const void *a, const void *b)
4150 const struct bfd_link_hash_entry *l = *(const struct bfd_link_hash_entry **)a;
4151 const struct bfd_link_hash_entry *r = *(const struct bfd_link_hash_entry **)b;
4153 if (l->u.def.value < r->u.def.value)
4155 else if (l->u.def.value > r->u.def.value)
4162 print_all_symbols (asection *sec)
4164 input_section_userdata_type *ud
4165 = (input_section_userdata_type *) get_userdata (sec);
4166 struct map_symbol_def *def;
4167 struct bfd_link_hash_entry **entries;
4173 *ud->map_symbol_def_tail = 0;
4175 /* Sort the symbols by address. */
4176 entries = (struct bfd_link_hash_entry **)
4177 obstack_alloc (&map_obstack, ud->map_symbol_def_count * sizeof (*entries));
4179 for (i = 0, def = ud->map_symbol_def_head; def; def = def->next, i++)
4180 entries[i] = def->entry;
4182 qsort (entries, ud->map_symbol_def_count, sizeof (*entries),
4183 hash_entry_addr_cmp);
4185 /* Print the symbols. */
4186 for (i = 0; i < ud->map_symbol_def_count; i++)
4187 print_one_symbol (entries[i], sec);
4189 obstack_free (&map_obstack, entries);
4192 /* Print information about an input section to the map file. */
4195 print_input_section (asection *i, bfd_boolean is_discarded)
4197 bfd_size_type size = i->size;
4204 minfo ("%s", i->name);
4206 len = 1 + strlen (i->name);
4207 if (len >= SECTION_NAME_MAP_LENGTH - 1)
4212 while (len < SECTION_NAME_MAP_LENGTH)
4218 if (i->output_section != NULL
4219 && i->output_section->owner == link_info.output_bfd)
4220 addr = i->output_section->vma + i->output_offset;
4228 minfo ("0x%V %W %B\n", addr, TO_ADDR (size), i->owner);
4230 if (size != i->rawsize && i->rawsize != 0)
4232 len = SECTION_NAME_MAP_LENGTH + 3;
4244 minfo (_("%W (size before relaxing)\n"), i->rawsize);
4247 if (i->output_section != NULL
4248 && i->output_section->owner == link_info.output_bfd)
4250 if (link_info.reduce_memory_overheads)
4251 bfd_link_hash_traverse (link_info.hash, print_one_symbol, i);
4253 print_all_symbols (i);
4255 /* Update print_dot, but make sure that we do not move it
4256 backwards - this could happen if we have overlays and a
4257 later overlay is shorter than an earier one. */
4258 if (addr + TO_ADDR (size) > print_dot)
4259 print_dot = addr + TO_ADDR (size);
4264 print_fill_statement (lang_fill_statement_type *fill)
4268 fputs (" FILL mask 0x", config.map_file);
4269 for (p = fill->fill->data, size = fill->fill->size; size != 0; p++, size--)
4270 fprintf (config.map_file, "%02x", *p);
4271 fputs ("\n", config.map_file);
4275 print_data_statement (lang_data_statement_type *data)
4283 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
4286 addr = data->output_offset;
4287 if (data->output_section != NULL)
4288 addr += data->output_section->vma;
4316 minfo ("0x%V %W %s 0x%v", addr, size, name, data->value);
4318 if (data->exp->type.node_class != etree_value)
4321 exp_print_tree (data->exp);
4326 print_dot = addr + TO_ADDR (size);
4329 /* Print an address statement. These are generated by options like
4333 print_address_statement (lang_address_statement_type *address)
4335 minfo (_("Address of section %s set to "), address->section_name);
4336 exp_print_tree (address->address);
4340 /* Print a reloc statement. */
4343 print_reloc_statement (lang_reloc_statement_type *reloc)
4350 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
4353 addr = reloc->output_offset;
4354 if (reloc->output_section != NULL)
4355 addr += reloc->output_section->vma;
4357 size = bfd_get_reloc_size (reloc->howto);
4359 minfo ("0x%V %W RELOC %s ", addr, size, reloc->howto->name);
4361 if (reloc->name != NULL)
4362 minfo ("%s+", reloc->name);
4364 minfo ("%s+", reloc->section->name);
4366 exp_print_tree (reloc->addend_exp);
4370 print_dot = addr + TO_ADDR (size);
4374 print_padding_statement (lang_padding_statement_type *s)
4382 len = sizeof " *fill*" - 1;
4383 while (len < SECTION_NAME_MAP_LENGTH)
4389 addr = s->output_offset;
4390 if (s->output_section != NULL)
4391 addr += s->output_section->vma;
4392 minfo ("0x%V %W ", addr, (bfd_vma) s->size);
4394 if (s->fill->size != 0)
4398 for (p = s->fill->data, size = s->fill->size; size != 0; p++, size--)
4399 fprintf (config.map_file, "%02x", *p);
4404 print_dot = addr + TO_ADDR (s->size);
4408 print_wild_statement (lang_wild_statement_type *w,
4409 lang_output_section_statement_type *os)
4411 struct wildcard_list *sec;
4415 if (w->filenames_sorted)
4417 if (w->filename != NULL)
4418 minfo ("%s", w->filename);
4421 if (w->filenames_sorted)
4425 for (sec = w->section_list; sec; sec = sec->next)
4427 if (sec->spec.sorted)
4429 if (sec->spec.exclude_name_list != NULL)
4432 minfo ("EXCLUDE_FILE(%s", sec->spec.exclude_name_list->name);
4433 for (tmp = sec->spec.exclude_name_list->next; tmp; tmp = tmp->next)
4434 minfo (" %s", tmp->name);
4437 if (sec->spec.name != NULL)
4438 minfo ("%s", sec->spec.name);
4441 if (sec->spec.sorted)
4450 print_statement_list (w->children.head, os);
4453 /* Print a group statement. */
4456 print_group (lang_group_statement_type *s,
4457 lang_output_section_statement_type *os)
4459 fprintf (config.map_file, "START GROUP\n");
4460 print_statement_list (s->children.head, os);
4461 fprintf (config.map_file, "END GROUP\n");
4464 /* Print the list of statements in S.
4465 This can be called for any statement type. */
4468 print_statement_list (lang_statement_union_type *s,
4469 lang_output_section_statement_type *os)
4473 print_statement (s, os);
4478 /* Print the first statement in statement list S.
4479 This can be called for any statement type. */
4482 print_statement (lang_statement_union_type *s,
4483 lang_output_section_statement_type *os)
4485 switch (s->header.type)
4488 fprintf (config.map_file, _("Fail with %d\n"), s->header.type);
4491 case lang_constructors_statement_enum:
4492 if (constructor_list.head != NULL)
4494 if (constructors_sorted)
4495 minfo (" SORT (CONSTRUCTORS)\n");
4497 minfo (" CONSTRUCTORS\n");
4498 print_statement_list (constructor_list.head, os);
4501 case lang_wild_statement_enum:
4502 print_wild_statement (&s->wild_statement, os);
4504 case lang_address_statement_enum:
4505 print_address_statement (&s->address_statement);
4507 case lang_object_symbols_statement_enum:
4508 minfo (" CREATE_OBJECT_SYMBOLS\n");
4510 case lang_fill_statement_enum:
4511 print_fill_statement (&s->fill_statement);
4513 case lang_data_statement_enum:
4514 print_data_statement (&s->data_statement);
4516 case lang_reloc_statement_enum:
4517 print_reloc_statement (&s->reloc_statement);
4519 case lang_input_section_enum:
4520 print_input_section (s->input_section.section, FALSE);
4522 case lang_padding_statement_enum:
4523 print_padding_statement (&s->padding_statement);
4525 case lang_output_section_statement_enum:
4526 print_output_section_statement (&s->output_section_statement);
4528 case lang_assignment_statement_enum:
4529 print_assignment (&s->assignment_statement, os);
4531 case lang_target_statement_enum:
4532 fprintf (config.map_file, "TARGET(%s)\n", s->target_statement.target);
4534 case lang_output_statement_enum:
4535 minfo ("OUTPUT(%s", s->output_statement.name);
4536 if (output_target != NULL)
4537 minfo (" %s", output_target);
4540 case lang_input_statement_enum:
4541 print_input_statement (&s->input_statement);
4543 case lang_group_statement_enum:
4544 print_group (&s->group_statement, os);
4546 case lang_insert_statement_enum:
4547 minfo ("INSERT %s %s\n",
4548 s->insert_statement.is_before ? "BEFORE" : "AFTER",
4549 s->insert_statement.where);
4555 print_statements (void)
4557 print_statement_list (statement_list.head, abs_output_section);
4560 /* Print the first N statements in statement list S to STDERR.
4561 If N == 0, nothing is printed.
4562 If N < 0, the entire list is printed.
4563 Intended to be called from GDB. */
4566 dprint_statement (lang_statement_union_type *s, int n)
4568 FILE *map_save = config.map_file;
4570 config.map_file = stderr;
4573 print_statement_list (s, abs_output_section);
4576 while (s && --n >= 0)
4578 print_statement (s, abs_output_section);
4583 config.map_file = map_save;
4587 insert_pad (lang_statement_union_type **ptr,
4589 bfd_size_type alignment_needed,
4590 asection *output_section,
4593 static fill_type zero_fill;
4594 lang_statement_union_type *pad = NULL;
4596 if (ptr != &statement_list.head)
4597 pad = ((lang_statement_union_type *)
4598 ((char *) ptr - offsetof (lang_statement_union_type, header.next)));
4600 && pad->header.type == lang_padding_statement_enum
4601 && pad->padding_statement.output_section == output_section)
4603 /* Use the existing pad statement. */
4605 else if ((pad = *ptr) != NULL
4606 && pad->header.type == lang_padding_statement_enum
4607 && pad->padding_statement.output_section == output_section)
4609 /* Use the existing pad statement. */
4613 /* Make a new padding statement, linked into existing chain. */
4614 pad = (lang_statement_union_type *)
4615 stat_alloc (sizeof (lang_padding_statement_type));
4616 pad->header.next = *ptr;
4618 pad->header.type = lang_padding_statement_enum;
4619 pad->padding_statement.output_section = output_section;
4622 pad->padding_statement.fill = fill;
4624 pad->padding_statement.output_offset = dot - output_section->vma;
4625 pad->padding_statement.size = alignment_needed;
4626 output_section->size = TO_SIZE (dot + TO_ADDR (alignment_needed)
4627 - output_section->vma);
4630 /* Work out how much this section will move the dot point. */
4634 (lang_statement_union_type **this_ptr,
4635 lang_output_section_statement_type *output_section_statement,
4639 lang_input_section_type *is = &((*this_ptr)->input_section);
4640 asection *i = is->section;
4641 asection *o = output_section_statement->bfd_section;
4643 if (i->sec_info_type == SEC_INFO_TYPE_JUST_SYMS)
4644 i->output_offset = i->vma - o->vma;
4645 else if ((i->flags & SEC_EXCLUDE) != 0)
4646 i->output_offset = dot - o->vma;
4649 bfd_size_type alignment_needed;
4651 /* Align this section first to the input sections requirement,
4652 then to the output section's requirement. If this alignment
4653 is greater than any seen before, then record it too. Perform
4654 the alignment by inserting a magic 'padding' statement. */
4656 if (output_section_statement->subsection_alignment != -1)
4657 i->alignment_power = output_section_statement->subsection_alignment;
4659 if (o->alignment_power < i->alignment_power)
4660 o->alignment_power = i->alignment_power;
4662 alignment_needed = align_power (dot, i->alignment_power) - dot;
4664 if (alignment_needed != 0)
4666 insert_pad (this_ptr, fill, TO_SIZE (alignment_needed), o, dot);
4667 dot += alignment_needed;
4670 /* Remember where in the output section this input section goes. */
4671 i->output_offset = dot - o->vma;
4673 /* Mark how big the output section must be to contain this now. */
4674 dot += TO_ADDR (i->size);
4675 o->size = TO_SIZE (dot - o->vma);
4688 sort_sections_by_lma (const void *arg1, const void *arg2)
4690 const asection *sec1 = ((const struct check_sec *) arg1)->sec;
4691 const asection *sec2 = ((const struct check_sec *) arg2)->sec;
4693 if (sec1->lma < sec2->lma)
4695 else if (sec1->lma > sec2->lma)
4697 else if (sec1->id < sec2->id)
4699 else if (sec1->id > sec2->id)
4706 sort_sections_by_vma (const void *arg1, const void *arg2)
4708 const asection *sec1 = ((const struct check_sec *) arg1)->sec;
4709 const asection *sec2 = ((const struct check_sec *) arg2)->sec;
4711 if (sec1->vma < sec2->vma)
4713 else if (sec1->vma > sec2->vma)
4715 else if (sec1->id < sec2->id)
4717 else if (sec1->id > sec2->id)
4723 #define IS_TBSS(s) \
4724 ((s->flags & (SEC_LOAD | SEC_THREAD_LOCAL)) == SEC_THREAD_LOCAL)
4726 #define IGNORE_SECTION(s) \
4727 ((s->flags & SEC_ALLOC) == 0 || IS_TBSS (s))
4729 /* Check to see if any allocated sections overlap with other allocated
4730 sections. This can happen if a linker script specifies the output
4731 section addresses of the two sections. Also check whether any memory
4732 region has overflowed. */
4735 lang_check_section_addresses (void)
4738 struct check_sec *sections;
4742 bfd_vma p_start = 0;
4744 lang_memory_region_type *m;
4746 if (bfd_count_sections (link_info.output_bfd) <= 1)
4749 count = bfd_count_sections (link_info.output_bfd);
4750 sections = XNEWVEC (struct check_sec, count);
4752 /* Scan all sections in the output list. */
4754 for (s = link_info.output_bfd->sections; s != NULL; s = s->next)
4756 if (IGNORE_SECTION (s)
4760 sections[count].sec = s;
4761 sections[count].warned = FALSE;
4768 qsort (sections, count, sizeof (*sections), sort_sections_by_lma);
4770 /* First check sections LMAs. There should be no overlap of LMAs on
4771 loadable sections, even with overlays. */
4772 for (p = NULL, i = 0; i < count; i++)
4774 s = sections[i].sec;
4775 if ((s->flags & SEC_LOAD) != 0)
4778 s_end = s_start + TO_ADDR (s->size) - 1;
4780 /* Look for an overlap. We have sorted sections by lma, so
4781 we know that s_start >= p_start. Besides the obvious
4782 case of overlap when the current section starts before
4783 the previous one ends, we also must have overlap if the
4784 previous section wraps around the address space. */
4786 && (s_start <= p_end
4787 || p_end < p_start))
4789 einfo (_("%X%P: section %s LMA [%V,%V]"
4790 " overlaps section %s LMA [%V,%V]\n"),
4791 s->name, s_start, s_end, p->name, p_start, p_end);
4792 sections[i].warned = TRUE;
4800 /* Now check sections VMAs if no overlays were detected. */
4801 if (!maybe_overlays)
4803 qsort (sections, count, sizeof (*sections), sort_sections_by_vma);
4805 for (p = NULL, i = 0; i < count; i++)
4807 s = sections[i].sec;
4809 s_end = s_start + TO_ADDR (s->size) - 1;
4812 && !sections[i].warned
4813 && (s_start <= p_end
4814 || p_end < p_start))
4815 einfo (_("%X%P: section %s VMA [%V,%V]"
4816 " overlaps section %s VMA [%V,%V]\n"),
4817 s->name, s_start, s_end, p->name, p_start, p_end);
4826 /* If any memory region has overflowed, report by how much.
4827 We do not issue this diagnostic for regions that had sections
4828 explicitly placed outside their bounds; os_region_check's
4829 diagnostics are adequate for that case.
4831 FIXME: It is conceivable that m->current - (m->origin + m->length)
4832 might overflow a 32-bit integer. There is, alas, no way to print
4833 a bfd_vma quantity in decimal. */
4834 for (m = lang_memory_region_list; m; m = m->next)
4835 if (m->had_full_message)
4836 einfo (_("%X%P: region `%s' overflowed by %ld bytes\n"),
4837 m->name_list.name, (long)(m->current - (m->origin + m->length)));
4841 /* Make sure the new address is within the region. We explicitly permit the
4842 current address to be at the exact end of the region when the address is
4843 non-zero, in case the region is at the end of addressable memory and the
4844 calculation wraps around. */
4847 os_region_check (lang_output_section_statement_type *os,
4848 lang_memory_region_type *region,
4852 if ((region->current < region->origin
4853 || (region->current - region->origin > region->length))
4854 && ((region->current != region->origin + region->length)
4859 einfo (_("%X%P: address 0x%v of %B section `%s'"
4860 " is not within region `%s'\n"),
4862 os->bfd_section->owner,
4863 os->bfd_section->name,
4864 region->name_list.name);
4866 else if (!region->had_full_message)
4868 region->had_full_message = TRUE;
4870 einfo (_("%X%P: %B section `%s' will not fit in region `%s'\n"),
4871 os->bfd_section->owner,
4872 os->bfd_section->name,
4873 region->name_list.name);
4878 /* Set the sizes for all the output sections. */
4881 lang_size_sections_1
4882 (lang_statement_union_type **prev,
4883 lang_output_section_statement_type *output_section_statement,
4887 bfd_boolean check_regions)
4889 lang_statement_union_type *s;
4891 /* Size up the sections from their constituent parts. */
4892 for (s = *prev; s != NULL; s = s->header.next)
4894 switch (s->header.type)
4896 case lang_output_section_statement_enum:
4898 bfd_vma newdot, after, dotdelta;
4899 lang_output_section_statement_type *os;
4900 lang_memory_region_type *r;
4901 int section_alignment = 0;
4903 os = &s->output_section_statement;
4904 if (os->constraint == -1)
4907 /* FIXME: We shouldn't need to zero section vmas for ld -r
4908 here, in lang_insert_orphan, or in the default linker scripts.
4909 This is covering for coff backend linker bugs. See PR6945. */
4910 if (os->addr_tree == NULL
4911 && bfd_link_relocatable (&link_info)
4912 && (bfd_get_flavour (link_info.output_bfd)
4913 == bfd_target_coff_flavour))
4914 os->addr_tree = exp_intop (0);
4915 if (os->addr_tree != NULL)
4917 os->processed_vma = FALSE;
4918 exp_fold_tree (os->addr_tree, bfd_abs_section_ptr, &dot);
4920 if (expld.result.valid_p)
4922 dot = expld.result.value;
4923 if (expld.result.section != NULL)
4924 dot += expld.result.section->vma;
4926 else if (expld.phase != lang_mark_phase_enum)
4927 einfo (_("%F%S: non constant or forward reference"
4928 " address expression for section %s\n"),
4929 os->addr_tree, os->name);
4932 if (os->bfd_section == NULL)
4933 /* This section was removed or never actually created. */
4936 /* If this is a COFF shared library section, use the size and
4937 address from the input section. FIXME: This is COFF
4938 specific; it would be cleaner if there were some other way
4939 to do this, but nothing simple comes to mind. */
4940 if (((bfd_get_flavour (link_info.output_bfd)
4941 == bfd_target_ecoff_flavour)
4942 || (bfd_get_flavour (link_info.output_bfd)
4943 == bfd_target_coff_flavour))
4944 && (os->bfd_section->flags & SEC_COFF_SHARED_LIBRARY) != 0)
4948 if (os->children.head == NULL
4949 || os->children.head->header.next != NULL
4950 || (os->children.head->header.type
4951 != lang_input_section_enum))
4952 einfo (_("%P%X: Internal error on COFF shared library"
4953 " section %s\n"), os->name);
4955 input = os->children.head->input_section.section;
4956 bfd_set_section_vma (os->bfd_section->owner,
4958 bfd_section_vma (input->owner, input));
4959 os->bfd_section->size = input->size;
4965 if (bfd_is_abs_section (os->bfd_section))
4967 /* No matter what happens, an abs section starts at zero. */
4968 ASSERT (os->bfd_section->vma == 0);
4972 if (os->addr_tree == NULL)
4974 /* No address specified for this section, get one
4975 from the region specification. */
4976 if (os->region == NULL
4977 || ((os->bfd_section->flags & (SEC_ALLOC | SEC_LOAD))
4978 && os->region->name_list.name[0] == '*'
4979 && strcmp (os->region->name_list.name,
4980 DEFAULT_MEMORY_REGION) == 0))
4982 os->region = lang_memory_default (os->bfd_section);
4985 /* If a loadable section is using the default memory
4986 region, and some non default memory regions were
4987 defined, issue an error message. */
4989 && !IGNORE_SECTION (os->bfd_section)
4990 && !bfd_link_relocatable (&link_info)
4992 && strcmp (os->region->name_list.name,
4993 DEFAULT_MEMORY_REGION) == 0
4994 && lang_memory_region_list != NULL
4995 && (strcmp (lang_memory_region_list->name_list.name,
4996 DEFAULT_MEMORY_REGION) != 0
4997 || lang_memory_region_list->next != NULL)
4998 && expld.phase != lang_mark_phase_enum)
5000 /* By default this is an error rather than just a
5001 warning because if we allocate the section to the
5002 default memory region we can end up creating an
5003 excessively large binary, or even seg faulting when
5004 attempting to perform a negative seek. See
5005 sources.redhat.com/ml/binutils/2003-04/msg00423.html
5006 for an example of this. This behaviour can be
5007 overridden by the using the --no-check-sections
5009 if (command_line.check_section_addresses)
5010 einfo (_("%P%F: error: no memory region specified"
5011 " for loadable section `%s'\n"),
5012 bfd_get_section_name (link_info.output_bfd,
5015 einfo (_("%P: warning: no memory region specified"
5016 " for loadable section `%s'\n"),
5017 bfd_get_section_name (link_info.output_bfd,
5021 newdot = os->region->current;
5022 section_alignment = os->bfd_section->alignment_power;
5025 section_alignment = os->section_alignment;
5027 /* Align to what the section needs. */
5028 if (section_alignment > 0)
5030 bfd_vma savedot = newdot;
5031 newdot = align_power (newdot, section_alignment);
5033 dotdelta = newdot - savedot;
5035 && (config.warn_section_align
5036 || os->addr_tree != NULL)
5037 && expld.phase != lang_mark_phase_enum)
5038 einfo (_("%P: warning: changing start of section"
5039 " %s by %lu bytes\n"),
5040 os->name, (unsigned long) dotdelta);
5043 bfd_set_section_vma (0, os->bfd_section, newdot);
5045 os->bfd_section->output_offset = 0;
5048 lang_size_sections_1 (&os->children.head, os,
5049 os->fill, newdot, relax, check_regions);
5051 os->processed_vma = TRUE;
5053 if (bfd_is_abs_section (os->bfd_section) || os->ignored)
5054 /* Except for some special linker created sections,
5055 no output section should change from zero size
5056 after strip_excluded_output_sections. A non-zero
5057 size on an ignored section indicates that some
5058 input section was not sized early enough. */
5059 ASSERT (os->bfd_section->size == 0);
5062 dot = os->bfd_section->vma;
5064 /* Put the section within the requested block size, or
5065 align at the block boundary. */
5067 + TO_ADDR (os->bfd_section->size)
5068 + os->block_value - 1)
5069 & - (bfd_vma) os->block_value);
5071 os->bfd_section->size = TO_SIZE (after - os->bfd_section->vma);
5074 /* Set section lma. */
5077 r = lang_memory_region_lookup (DEFAULT_MEMORY_REGION, FALSE);
5081 bfd_vma lma = exp_get_abs_int (os->load_base, 0, "load base");
5082 os->bfd_section->lma = lma;
5084 else if (os->lma_region != NULL)
5086 bfd_vma lma = os->lma_region->current;
5088 if (os->align_lma_with_input)
5092 /* When LMA_REGION is the same as REGION, align the LMA
5093 as we did for the VMA, possibly including alignment
5094 from the bfd section. If a different region, then
5095 only align according to the value in the output
5097 if (os->lma_region != os->region)
5098 section_alignment = os->section_alignment;
5099 if (section_alignment > 0)
5100 lma = align_power (lma, section_alignment);
5102 os->bfd_section->lma = lma;
5104 else if (r->last_os != NULL
5105 && (os->bfd_section->flags & SEC_ALLOC) != 0)
5110 last = r->last_os->output_section_statement.bfd_section;
5112 /* A backwards move of dot should be accompanied by
5113 an explicit assignment to the section LMA (ie.
5114 os->load_base set) because backwards moves can
5115 create overlapping LMAs. */
5117 && os->bfd_section->size != 0
5118 && dot + TO_ADDR (os->bfd_section->size) <= last->vma)
5120 /* If dot moved backwards then leave lma equal to
5121 vma. This is the old default lma, which might
5122 just happen to work when the backwards move is
5123 sufficiently large. Nag if this changes anything,
5124 so people can fix their linker scripts. */
5126 if (last->vma != last->lma)
5127 einfo (_("%P: warning: dot moved backwards before `%s'\n"),
5132 /* If this is an overlay, set the current lma to that
5133 at the end of the previous section. */
5134 if (os->sectype == overlay_section)
5135 lma = last->lma + last->size;
5137 /* Otherwise, keep the same lma to vma relationship
5138 as the previous section. */
5140 lma = dot + last->lma - last->vma;
5142 if (section_alignment > 0)
5143 lma = align_power (lma, section_alignment);
5144 os->bfd_section->lma = lma;
5147 os->processed_lma = TRUE;
5149 if (bfd_is_abs_section (os->bfd_section) || os->ignored)
5152 if (r->last_os != NULL
5153 && !IGNORE_SECTION (os->bfd_section)
5154 && os->bfd_section->size != 0)
5158 last = r->last_os->output_section_statement.bfd_section;
5159 if (dot + TO_ADDR (os->bfd_section->size) > last->vma
5160 && dot < last->vma + TO_ADDR (last->size))
5161 maybe_overlays = TRUE;
5164 /* Keep track of normal sections using the default
5165 lma region. We use this to set the lma for
5166 following sections. Overlays or other linker
5167 script assignment to lma might mean that the
5168 default lma == vma is incorrect.
5169 To avoid warnings about dot moving backwards when using
5170 -Ttext, don't start tracking sections until we find one
5171 of non-zero size or with lma set differently to vma. */
5172 if (!IGNORE_SECTION (os->bfd_section)
5173 && (os->bfd_section->size != 0
5174 || (r->last_os == NULL
5175 && os->bfd_section->vma != os->bfd_section->lma)
5176 || (r->last_os != NULL
5177 && dot >= (r->last_os->output_section_statement
5178 .bfd_section->vma)))
5179 && os->lma_region == NULL
5180 && !bfd_link_relocatable (&link_info))
5183 /* .tbss sections effectively have zero size. */
5184 if (!IS_TBSS (os->bfd_section)
5185 || bfd_link_relocatable (&link_info))
5186 dotdelta = TO_ADDR (os->bfd_section->size);
5191 if (os->update_dot_tree != 0)
5192 exp_fold_tree (os->update_dot_tree, bfd_abs_section_ptr, &dot);
5194 /* Update dot in the region ?
5195 We only do this if the section is going to be allocated,
5196 since unallocated sections do not contribute to the region's
5197 overall size in memory. */
5198 if (os->region != NULL
5199 && (os->bfd_section->flags & (SEC_ALLOC | SEC_LOAD)))
5201 os->region->current = dot;
5204 /* Make sure the new address is within the region. */
5205 os_region_check (os, os->region, os->addr_tree,
5206 os->bfd_section->vma);
5208 if (os->lma_region != NULL && os->lma_region != os->region
5209 && ((os->bfd_section->flags & SEC_LOAD)
5210 || os->align_lma_with_input))
5212 os->lma_region->current = os->bfd_section->lma + dotdelta;
5215 os_region_check (os, os->lma_region, NULL,
5216 os->bfd_section->lma);
5222 case lang_constructors_statement_enum:
5223 dot = lang_size_sections_1 (&constructor_list.head,
5224 output_section_statement,
5225 fill, dot, relax, check_regions);
5228 case lang_data_statement_enum:
5230 unsigned int size = 0;
5232 s->data_statement.output_offset =
5233 dot - output_section_statement->bfd_section->vma;
5234 s->data_statement.output_section =
5235 output_section_statement->bfd_section;
5237 /* We might refer to provided symbols in the expression, and
5238 need to mark them as needed. */
5239 exp_fold_tree (s->data_statement.exp, bfd_abs_section_ptr, &dot);
5241 switch (s->data_statement.type)
5259 if (size < TO_SIZE ((unsigned) 1))
5260 size = TO_SIZE ((unsigned) 1);
5261 dot += TO_ADDR (size);
5262 output_section_statement->bfd_section->size
5263 = TO_SIZE (dot - output_section_statement->bfd_section->vma);
5268 case lang_reloc_statement_enum:
5272 s->reloc_statement.output_offset =
5273 dot - output_section_statement->bfd_section->vma;
5274 s->reloc_statement.output_section =
5275 output_section_statement->bfd_section;
5276 size = bfd_get_reloc_size (s->reloc_statement.howto);
5277 dot += TO_ADDR (size);
5278 output_section_statement->bfd_section->size
5279 = TO_SIZE (dot - output_section_statement->bfd_section->vma);
5283 case lang_wild_statement_enum:
5284 dot = lang_size_sections_1 (&s->wild_statement.children.head,
5285 output_section_statement,
5286 fill, dot, relax, check_regions);
5289 case lang_object_symbols_statement_enum:
5290 link_info.create_object_symbols_section =
5291 output_section_statement->bfd_section;
5294 case lang_output_statement_enum:
5295 case lang_target_statement_enum:
5298 case lang_input_section_enum:
5302 i = s->input_section.section;
5307 if (! bfd_relax_section (i->owner, i, &link_info, &again))
5308 einfo (_("%P%F: can't relax section: %E\n"));
5312 dot = size_input_section (prev, output_section_statement,
5317 case lang_input_statement_enum:
5320 case lang_fill_statement_enum:
5321 s->fill_statement.output_section =
5322 output_section_statement->bfd_section;
5324 fill = s->fill_statement.fill;
5327 case lang_assignment_statement_enum:
5329 bfd_vma newdot = dot;
5330 etree_type *tree = s->assignment_statement.exp;
5332 expld.dataseg.relro = exp_dataseg_relro_none;
5334 exp_fold_tree (tree,
5335 output_section_statement->bfd_section,
5338 if (expld.dataseg.relro == exp_dataseg_relro_start)
5340 if (!expld.dataseg.relro_start_stat)
5341 expld.dataseg.relro_start_stat = s;
5344 ASSERT (expld.dataseg.relro_start_stat == s);
5347 else if (expld.dataseg.relro == exp_dataseg_relro_end)
5349 if (!expld.dataseg.relro_end_stat)
5350 expld.dataseg.relro_end_stat = s;
5353 ASSERT (expld.dataseg.relro_end_stat == s);
5356 expld.dataseg.relro = exp_dataseg_relro_none;
5358 /* This symbol may be relative to this section. */
5359 if ((tree->type.node_class == etree_provided
5360 || tree->type.node_class == etree_assign)
5361 && (tree->assign.dst [0] != '.'
5362 || tree->assign.dst [1] != '\0'))
5363 output_section_statement->update_dot = 1;
5365 if (!output_section_statement->ignored)
5367 if (output_section_statement == abs_output_section)
5369 /* If we don't have an output section, then just adjust
5370 the default memory address. */
5371 lang_memory_region_lookup (DEFAULT_MEMORY_REGION,
5372 FALSE)->current = newdot;
5374 else if (newdot != dot)
5376 /* Insert a pad after this statement. We can't
5377 put the pad before when relaxing, in case the
5378 assignment references dot. */
5379 insert_pad (&s->header.next, fill, TO_SIZE (newdot - dot),
5380 output_section_statement->bfd_section, dot);
5382 /* Don't neuter the pad below when relaxing. */
5385 /* If dot is advanced, this implies that the section
5386 should have space allocated to it, unless the
5387 user has explicitly stated that the section
5388 should not be allocated. */
5389 if (output_section_statement->sectype != noalloc_section
5390 && (output_section_statement->sectype != noload_section
5391 || (bfd_get_flavour (link_info.output_bfd)
5392 == bfd_target_elf_flavour)))
5393 output_section_statement->bfd_section->flags |= SEC_ALLOC;
5400 case lang_padding_statement_enum:
5401 /* If this is the first time lang_size_sections is called,
5402 we won't have any padding statements. If this is the
5403 second or later passes when relaxing, we should allow
5404 padding to shrink. If padding is needed on this pass, it
5405 will be added back in. */
5406 s->padding_statement.size = 0;
5408 /* Make sure output_offset is valid. If relaxation shrinks
5409 the section and this pad isn't needed, it's possible to
5410 have output_offset larger than the final size of the
5411 section. bfd_set_section_contents will complain even for
5412 a pad size of zero. */
5413 s->padding_statement.output_offset
5414 = dot - output_section_statement->bfd_section->vma;
5417 case lang_group_statement_enum:
5418 dot = lang_size_sections_1 (&s->group_statement.children.head,
5419 output_section_statement,
5420 fill, dot, relax, check_regions);
5423 case lang_insert_statement_enum:
5426 /* We can only get here when relaxing is turned on. */
5427 case lang_address_statement_enum:
5434 prev = &s->header.next;
5439 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
5440 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
5441 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
5442 segments. We are allowed an opportunity to override this decision. */
5445 ldlang_override_segment_assignment (struct bfd_link_info * info ATTRIBUTE_UNUSED,
5446 bfd * abfd ATTRIBUTE_UNUSED,
5447 asection * current_section,
5448 asection * previous_section,
5449 bfd_boolean new_segment)
5451 lang_output_section_statement_type * cur;
5452 lang_output_section_statement_type * prev;
5454 /* The checks below are only necessary when the BFD library has decided
5455 that the two sections ought to be placed into the same segment. */
5459 /* Paranoia checks. */
5460 if (current_section == NULL || previous_section == NULL)
5463 /* If this flag is set, the target never wants code and non-code
5464 sections comingled in the same segment. */
5465 if (config.separate_code
5466 && ((current_section->flags ^ previous_section->flags) & SEC_CODE))
5469 /* Find the memory regions associated with the two sections.
5470 We call lang_output_section_find() here rather than scanning the list
5471 of output sections looking for a matching section pointer because if
5472 we have a large number of sections then a hash lookup is faster. */
5473 cur = lang_output_section_find (current_section->name);
5474 prev = lang_output_section_find (previous_section->name);
5476 /* More paranoia. */
5477 if (cur == NULL || prev == NULL)
5480 /* If the regions are different then force the sections to live in
5481 different segments. See the email thread starting at the following
5482 URL for the reasons why this is necessary:
5483 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
5484 return cur->region != prev->region;
5488 one_lang_size_sections_pass (bfd_boolean *relax, bfd_boolean check_regions)
5490 lang_statement_iteration++;
5491 lang_size_sections_1 (&statement_list.head, abs_output_section,
5492 0, 0, relax, check_regions);
5496 lang_size_sections (bfd_boolean *relax, bfd_boolean check_regions)
5498 expld.phase = lang_allocating_phase_enum;
5499 expld.dataseg.phase = exp_dataseg_none;
5501 one_lang_size_sections_pass (relax, check_regions);
5502 if (expld.dataseg.phase == exp_dataseg_end_seen
5503 && link_info.relro && expld.dataseg.relro_end)
5505 bfd_vma initial_base, relro_end, desired_end;
5508 /* Compute the expected PT_GNU_RELRO segment end. */
5509 relro_end = ((expld.dataseg.relro_end + expld.dataseg.pagesize - 1)
5510 & ~(expld.dataseg.pagesize - 1));
5512 /* Adjust by the offset arg of DATA_SEGMENT_RELRO_END. */
5513 desired_end = relro_end - expld.dataseg.relro_offset;
5515 /* For sections in the relro segment.. */
5516 for (sec = link_info.output_bfd->section_last; sec; sec = sec->prev)
5517 if ((sec->flags & SEC_ALLOC) != 0
5518 && sec->vma >= expld.dataseg.base
5519 && sec->vma < expld.dataseg.relro_end - expld.dataseg.relro_offset)
5521 /* Where do we want to put this section so that it ends as
5523 bfd_vma start, end, bump;
5525 end = start = sec->vma;
5528 bump = desired_end - end;
5529 /* We'd like to increase START by BUMP, but we must heed
5530 alignment so the increase might be less than optimum. */
5532 start &= ~(((bfd_vma) 1 << sec->alignment_power) - 1);
5533 /* This is now the desired end for the previous section. */
5534 desired_end = start;
5537 expld.dataseg.phase = exp_dataseg_relro_adjust;
5538 ASSERT (desired_end >= expld.dataseg.base);
5539 initial_base = expld.dataseg.base;
5540 expld.dataseg.base = desired_end;
5541 lang_reset_memory_regions ();
5542 one_lang_size_sections_pass (relax, check_regions);
5544 if (expld.dataseg.relro_end > relro_end)
5546 /* Assignments to dot, or to output section address in a
5547 user script have increased padding over the original.
5549 expld.dataseg.base = initial_base;
5550 lang_reset_memory_regions ();
5551 one_lang_size_sections_pass (relax, check_regions);
5554 link_info.relro_start = expld.dataseg.base;
5555 link_info.relro_end = expld.dataseg.relro_end;
5557 else if (expld.dataseg.phase == exp_dataseg_end_seen)
5559 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
5560 a page could be saved in the data segment. */
5561 bfd_vma first, last;
5563 first = -expld.dataseg.base & (expld.dataseg.pagesize - 1);
5564 last = expld.dataseg.end & (expld.dataseg.pagesize - 1);
5566 && ((expld.dataseg.base & ~(expld.dataseg.pagesize - 1))
5567 != (expld.dataseg.end & ~(expld.dataseg.pagesize - 1)))
5568 && first + last <= expld.dataseg.pagesize)
5570 expld.dataseg.phase = exp_dataseg_adjust;
5571 lang_reset_memory_regions ();
5572 one_lang_size_sections_pass (relax, check_regions);
5575 expld.dataseg.phase = exp_dataseg_done;
5578 expld.dataseg.phase = exp_dataseg_done;
5581 static lang_output_section_statement_type *current_section;
5582 static lang_assignment_statement_type *current_assign;
5583 static bfd_boolean prefer_next_section;
5585 /* Worker function for lang_do_assignments. Recursiveness goes here. */
5588 lang_do_assignments_1 (lang_statement_union_type *s,
5589 lang_output_section_statement_type *current_os,
5592 bfd_boolean *found_end)
5594 for (; s != NULL; s = s->header.next)
5596 switch (s->header.type)
5598 case lang_constructors_statement_enum:
5599 dot = lang_do_assignments_1 (constructor_list.head,
5600 current_os, fill, dot, found_end);
5603 case lang_output_section_statement_enum:
5605 lang_output_section_statement_type *os;
5607 os = &(s->output_section_statement);
5608 os->after_end = *found_end;
5609 if (os->bfd_section != NULL && !os->ignored)
5611 if ((os->bfd_section->flags & SEC_ALLOC) != 0)
5613 current_section = os;
5614 prefer_next_section = FALSE;
5616 dot = os->bfd_section->vma;
5618 lang_do_assignments_1 (os->children.head,
5619 os, os->fill, dot, found_end);
5621 /* .tbss sections effectively have zero size. */
5622 if (!IS_TBSS (os->bfd_section)
5623 || bfd_link_relocatable (&link_info))
5624 dot += TO_ADDR (os->bfd_section->size);
5626 if (os->update_dot_tree != NULL)
5627 exp_fold_tree (os->update_dot_tree, bfd_abs_section_ptr, &dot);
5632 case lang_wild_statement_enum:
5634 dot = lang_do_assignments_1 (s->wild_statement.children.head,
5635 current_os, fill, dot, found_end);
5638 case lang_object_symbols_statement_enum:
5639 case lang_output_statement_enum:
5640 case lang_target_statement_enum:
5643 case lang_data_statement_enum:
5644 exp_fold_tree (s->data_statement.exp, bfd_abs_section_ptr, &dot);
5645 if (expld.result.valid_p)
5647 s->data_statement.value = expld.result.value;
5648 if (expld.result.section != NULL)
5649 s->data_statement.value += expld.result.section->vma;
5652 einfo (_("%F%P: invalid data statement\n"));
5655 switch (s->data_statement.type)
5673 if (size < TO_SIZE ((unsigned) 1))
5674 size = TO_SIZE ((unsigned) 1);
5675 dot += TO_ADDR (size);
5679 case lang_reloc_statement_enum:
5680 exp_fold_tree (s->reloc_statement.addend_exp,
5681 bfd_abs_section_ptr, &dot);
5682 if (expld.result.valid_p)
5683 s->reloc_statement.addend_value = expld.result.value;
5685 einfo (_("%F%P: invalid reloc statement\n"));
5686 dot += TO_ADDR (bfd_get_reloc_size (s->reloc_statement.howto));
5689 case lang_input_section_enum:
5691 asection *in = s->input_section.section;
5693 if ((in->flags & SEC_EXCLUDE) == 0)
5694 dot += TO_ADDR (in->size);
5698 case lang_input_statement_enum:
5701 case lang_fill_statement_enum:
5702 fill = s->fill_statement.fill;
5705 case lang_assignment_statement_enum:
5706 current_assign = &s->assignment_statement;
5707 if (current_assign->exp->type.node_class != etree_assert)
5709 const char *p = current_assign->exp->assign.dst;
5711 if (current_os == abs_output_section && p[0] == '.' && p[1] == 0)
5712 prefer_next_section = TRUE;
5716 if (strcmp (p, "end") == 0)
5719 exp_fold_tree (s->assignment_statement.exp,
5720 current_os->bfd_section,
5724 case lang_padding_statement_enum:
5725 dot += TO_ADDR (s->padding_statement.size);
5728 case lang_group_statement_enum:
5729 dot = lang_do_assignments_1 (s->group_statement.children.head,
5730 current_os, fill, dot, found_end);
5733 case lang_insert_statement_enum:
5736 case lang_address_statement_enum:
5748 lang_do_assignments (lang_phase_type phase)
5750 bfd_boolean found_end = FALSE;
5752 current_section = NULL;
5753 prefer_next_section = FALSE;
5754 expld.phase = phase;
5755 lang_statement_iteration++;
5756 lang_do_assignments_1 (statement_list.head,
5757 abs_output_section, NULL, 0, &found_end);
5760 /* For an assignment statement outside of an output section statement,
5761 choose the best of neighbouring output sections to use for values
5765 section_for_dot (void)
5769 /* Assignments belong to the previous output section, unless there
5770 has been an assignment to "dot", in which case following
5771 assignments belong to the next output section. (The assumption
5772 is that an assignment to "dot" is setting up the address for the
5773 next output section.) Except that past the assignment to "_end"
5774 we always associate with the previous section. This exception is
5775 for targets like SH that define an alloc .stack or other
5776 weirdness after non-alloc sections. */
5777 if (current_section == NULL || prefer_next_section)
5779 lang_statement_union_type *stmt;
5780 lang_output_section_statement_type *os;
5782 for (stmt = (lang_statement_union_type *) current_assign;
5784 stmt = stmt->header.next)
5785 if (stmt->header.type == lang_output_section_statement_enum)
5788 os = &stmt->output_section_statement;
5791 && (os->bfd_section == NULL
5792 || (os->bfd_section->flags & SEC_EXCLUDE) != 0
5793 || bfd_section_removed_from_list (link_info.output_bfd,
5797 if (current_section == NULL || os == NULL || !os->after_end)
5800 s = os->bfd_section;
5802 s = link_info.output_bfd->section_last;
5804 && ((s->flags & SEC_ALLOC) == 0
5805 || (s->flags & SEC_THREAD_LOCAL) != 0))
5810 return bfd_abs_section_ptr;
5814 s = current_section->bfd_section;
5816 /* The section may have been stripped. */
5818 && ((s->flags & SEC_EXCLUDE) != 0
5819 || (s->flags & SEC_ALLOC) == 0
5820 || (s->flags & SEC_THREAD_LOCAL) != 0
5821 || bfd_section_removed_from_list (link_info.output_bfd, s)))
5824 s = link_info.output_bfd->sections;
5826 && ((s->flags & SEC_ALLOC) == 0
5827 || (s->flags & SEC_THREAD_LOCAL) != 0))
5832 return bfd_abs_section_ptr;
5835 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
5836 operator .startof. (section_name), it produces an undefined symbol
5837 .startof.section_name. Similarly, when it sees
5838 .sizeof. (section_name), it produces an undefined symbol
5839 .sizeof.section_name. For all the output sections, we look for
5840 such symbols, and set them to the correct value. */
5843 lang_set_startof (void)
5847 if (bfd_link_relocatable (&link_info))
5850 for (s = link_info.output_bfd->sections; s != NULL; s = s->next)
5852 const char *secname;
5854 struct bfd_link_hash_entry *h;
5856 secname = bfd_get_section_name (link_info.output_bfd, s);
5857 buf = (char *) xmalloc (10 + strlen (secname));
5859 sprintf (buf, ".startof.%s", secname);
5860 h = bfd_link_hash_lookup (link_info.hash, buf, FALSE, FALSE, TRUE);
5861 if (h != NULL && h->type == bfd_link_hash_undefined)
5863 h->type = bfd_link_hash_defined;
5865 h->u.def.section = s;
5868 sprintf (buf, ".sizeof.%s", secname);
5869 h = bfd_link_hash_lookup (link_info.hash, buf, FALSE, FALSE, TRUE);
5870 if (h != NULL && h->type == bfd_link_hash_undefined)
5872 h->type = bfd_link_hash_defined;
5873 h->u.def.value = TO_ADDR (s->size);
5874 h->u.def.section = bfd_abs_section_ptr;
5884 struct bfd_link_hash_entry *h;
5887 if ((bfd_link_relocatable (&link_info) && !link_info.gc_sections)
5888 || bfd_link_dll (&link_info))
5889 warn = entry_from_cmdline;
5893 /* Force the user to specify a root when generating a relocatable with
5895 if (link_info.gc_sections && bfd_link_relocatable (&link_info)
5896 && !(entry_from_cmdline || undef_from_cmdline))
5897 einfo (_("%P%F: gc-sections requires either an entry or "
5898 "an undefined symbol\n"));
5900 if (entry_symbol.name == NULL)
5902 /* No entry has been specified. Look for the default entry, but
5903 don't warn if we don't find it. */
5904 entry_symbol.name = entry_symbol_default;
5908 h = bfd_link_hash_lookup (link_info.hash, entry_symbol.name,
5909 FALSE, FALSE, TRUE);
5911 && (h->type == bfd_link_hash_defined
5912 || h->type == bfd_link_hash_defweak)
5913 && h->u.def.section->output_section != NULL)
5917 val = (h->u.def.value
5918 + bfd_get_section_vma (link_info.output_bfd,
5919 h->u.def.section->output_section)
5920 + h->u.def.section->output_offset);
5921 if (! bfd_set_start_address (link_info.output_bfd, val))
5922 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol.name);
5929 /* We couldn't find the entry symbol. Try parsing it as a
5931 val = bfd_scan_vma (entry_symbol.name, &send, 0);
5934 if (! bfd_set_start_address (link_info.output_bfd, val))
5935 einfo (_("%P%F: can't set start address\n"));
5941 /* Can't find the entry symbol, and it's not a number. Use
5942 the first address in the text section. */
5943 ts = bfd_get_section_by_name (link_info.output_bfd, entry_section);
5947 einfo (_("%P: warning: cannot find entry symbol %s;"
5948 " defaulting to %V\n"),
5950 bfd_get_section_vma (link_info.output_bfd, ts));
5951 if (!(bfd_set_start_address
5952 (link_info.output_bfd,
5953 bfd_get_section_vma (link_info.output_bfd, ts))))
5954 einfo (_("%P%F: can't set start address\n"));
5959 einfo (_("%P: warning: cannot find entry symbol %s;"
5960 " not setting start address\n"),
5967 /* This is a small function used when we want to ignore errors from
5971 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED, ...)
5973 /* Don't do anything. */
5976 /* Check that the architecture of all the input files is compatible
5977 with the output file. Also call the backend to let it do any
5978 other checking that is needed. */
5983 lang_statement_union_type *file;
5985 const bfd_arch_info_type *compatible;
5987 for (file = file_chain.head; file != NULL; file = file->input_statement.next)
5989 #ifdef ENABLE_PLUGINS
5990 /* Don't check format of files claimed by plugin. */
5991 if (file->input_statement.flags.claimed)
5993 #endif /* ENABLE_PLUGINS */
5994 input_bfd = file->input_statement.the_bfd;
5996 = bfd_arch_get_compatible (input_bfd, link_info.output_bfd,
5997 command_line.accept_unknown_input_arch);
5999 /* In general it is not possible to perform a relocatable
6000 link between differing object formats when the input
6001 file has relocations, because the relocations in the
6002 input format may not have equivalent representations in
6003 the output format (and besides BFD does not translate
6004 relocs for other link purposes than a final link). */
6005 if ((bfd_link_relocatable (&link_info)
6006 || link_info.emitrelocations)
6007 && (compatible == NULL
6008 || (bfd_get_flavour (input_bfd)
6009 != bfd_get_flavour (link_info.output_bfd)))
6010 && (bfd_get_file_flags (input_bfd) & HAS_RELOC) != 0)
6012 einfo (_("%P%F: Relocatable linking with relocations from"
6013 " format %s (%B) to format %s (%B) is not supported\n"),
6014 bfd_get_target (input_bfd), input_bfd,
6015 bfd_get_target (link_info.output_bfd), link_info.output_bfd);
6016 /* einfo with %F exits. */
6019 if (compatible == NULL)
6021 if (command_line.warn_mismatch)
6022 einfo (_("%P%X: %s architecture of input file `%B'"
6023 " is incompatible with %s output\n"),
6024 bfd_printable_name (input_bfd), input_bfd,
6025 bfd_printable_name (link_info.output_bfd));
6027 else if (bfd_count_sections (input_bfd))
6029 /* If the input bfd has no contents, it shouldn't set the
6030 private data of the output bfd. */
6032 bfd_error_handler_type pfn = NULL;
6034 /* If we aren't supposed to warn about mismatched input
6035 files, temporarily set the BFD error handler to a
6036 function which will do nothing. We still want to call
6037 bfd_merge_private_bfd_data, since it may set up
6038 information which is needed in the output file. */
6039 if (! command_line.warn_mismatch)
6040 pfn = bfd_set_error_handler (ignore_bfd_errors);
6041 if (! bfd_merge_private_bfd_data (input_bfd, link_info.output_bfd))
6043 if (command_line.warn_mismatch)
6044 einfo (_("%P%X: failed to merge target specific data"
6045 " of file %B\n"), input_bfd);
6047 if (! command_line.warn_mismatch)
6048 bfd_set_error_handler (pfn);
6053 /* Look through all the global common symbols and attach them to the
6054 correct section. The -sort-common command line switch may be used
6055 to roughly sort the entries by alignment. */
6060 if (command_line.inhibit_common_definition)
6062 if (bfd_link_relocatable (&link_info)
6063 && ! command_line.force_common_definition)
6066 if (! config.sort_common)
6067 bfd_link_hash_traverse (link_info.hash, lang_one_common, NULL);
6072 if (config.sort_common == sort_descending)
6074 for (power = 4; power > 0; power--)
6075 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
6078 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
6082 for (power = 0; power <= 4; power++)
6083 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
6085 power = (unsigned int) -1;
6086 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
6091 /* Place one common symbol in the correct section. */
6094 lang_one_common (struct bfd_link_hash_entry *h, void *info)
6096 unsigned int power_of_two;
6100 if (h->type != bfd_link_hash_common)
6104 power_of_two = h->u.c.p->alignment_power;
6106 if (config.sort_common == sort_descending
6107 && power_of_two < *(unsigned int *) info)
6109 else if (config.sort_common == sort_ascending
6110 && power_of_two > *(unsigned int *) info)
6113 section = h->u.c.p->section;
6114 if (!bfd_define_common_symbol (link_info.output_bfd, &link_info, h))
6115 einfo (_("%P%F: Could not define common symbol `%T': %E\n"),
6118 if (config.map_file != NULL)
6120 static bfd_boolean header_printed;
6125 if (! header_printed)
6127 minfo (_("\nAllocating common symbols\n"));
6128 minfo (_("Common symbol size file\n\n"));
6129 header_printed = TRUE;
6132 name = bfd_demangle (link_info.output_bfd, h->root.string,
6133 DMGL_ANSI | DMGL_PARAMS);
6136 minfo ("%s", h->root.string);
6137 len = strlen (h->root.string);
6142 len = strlen (name);
6158 if (size <= 0xffffffff)
6159 sprintf (buf, "%lx", (unsigned long) size);
6161 sprintf_vma (buf, size);
6171 minfo ("%B\n", section->owner);
6177 /* Handle a single orphan section S, placing the orphan into an appropriate
6178 output section. The effects of the --orphan-handling command line
6179 option are handled here. */
6182 ldlang_place_orphan (asection *s)
6184 if (config.orphan_handling == orphan_handling_discard)
6186 lang_output_section_statement_type *os;
6187 os = lang_output_section_statement_lookup (DISCARD_SECTION_NAME, 0,
6189 if (os->addr_tree == NULL
6190 && (bfd_link_relocatable (&link_info)
6191 || (s->flags & (SEC_LOAD | SEC_ALLOC)) == 0))
6192 os->addr_tree = exp_intop (0);
6193 lang_add_section (&os->children, s, NULL, os);
6197 lang_output_section_statement_type *os;
6198 const char *name = s->name;
6201 if (config.orphan_handling == orphan_handling_error)
6202 einfo ("%X%P: error: unplaced orphan section `%A' from `%B'.\n",
6205 if (config.unique_orphan_sections || unique_section_p (s, NULL))
6206 constraint = SPECIAL;
6208 os = ldemul_place_orphan (s, name, constraint);
6211 os = lang_output_section_statement_lookup (name, constraint, TRUE);
6212 if (os->addr_tree == NULL
6213 && (bfd_link_relocatable (&link_info)
6214 || (s->flags & (SEC_LOAD | SEC_ALLOC)) == 0))
6215 os->addr_tree = exp_intop (0);
6216 lang_add_section (&os->children, s, NULL, os);
6219 if (config.orphan_handling == orphan_handling_warn)
6220 einfo ("%P: warning: orphan section `%A' from `%B' being "
6221 "placed in section `%s'.\n",
6222 s, s->owner, os->name);
6226 /* Run through the input files and ensure that every input section has
6227 somewhere to go. If one is found without a destination then create
6228 an input request and place it into the statement tree. */
6231 lang_place_orphans (void)
6233 LANG_FOR_EACH_INPUT_STATEMENT (file)
6237 for (s = file->the_bfd->sections; s != NULL; s = s->next)
6239 if (s->output_section == NULL)
6241 /* This section of the file is not attached, root
6242 around for a sensible place for it to go. */
6244 if (file->flags.just_syms)
6245 bfd_link_just_syms (file->the_bfd, s, &link_info);
6246 else if ((s->flags & SEC_EXCLUDE) != 0)
6247 s->output_section = bfd_abs_section_ptr;
6248 else if (strcmp (s->name, "COMMON") == 0)
6250 /* This is a lonely common section which must have
6251 come from an archive. We attach to the section
6252 with the wildcard. */
6253 if (!bfd_link_relocatable (&link_info)
6254 || command_line.force_common_definition)
6256 if (default_common_section == NULL)
6257 default_common_section
6258 = lang_output_section_statement_lookup (".bss", 0,
6260 lang_add_section (&default_common_section->children, s,
6261 NULL, default_common_section);
6265 ldlang_place_orphan (s);
6272 lang_set_flags (lang_memory_region_type *ptr, const char *flags, int invert)
6274 flagword *ptr_flags;
6276 ptr_flags = invert ? &ptr->not_flags : &ptr->flags;
6282 /* PR 17900: An exclamation mark in the attributes reverses
6283 the sense of any of the attributes that follow. */
6286 ptr_flags = invert ? &ptr->not_flags : &ptr->flags;
6290 *ptr_flags |= SEC_ALLOC;
6294 *ptr_flags |= SEC_READONLY;
6298 *ptr_flags |= SEC_DATA;
6302 *ptr_flags |= SEC_CODE;
6307 *ptr_flags |= SEC_LOAD;
6311 einfo (_("%P%F: invalid character %c (%d) in flags\n"), * flags, * flags);
6318 /* Call a function on each input file. This function will be called
6319 on an archive, but not on the elements. */
6322 lang_for_each_input_file (void (*func) (lang_input_statement_type *))
6324 lang_input_statement_type *f;
6326 for (f = (lang_input_statement_type *) input_file_chain.head;
6328 f = (lang_input_statement_type *) f->next_real_file)
6332 /* Call a function on each file. The function will be called on all
6333 the elements of an archive which are included in the link, but will
6334 not be called on the archive file itself. */
6337 lang_for_each_file (void (*func) (lang_input_statement_type *))
6339 LANG_FOR_EACH_INPUT_STATEMENT (f)
6346 ldlang_add_file (lang_input_statement_type *entry)
6348 lang_statement_append (&file_chain,
6349 (lang_statement_union_type *) entry,
6352 /* The BFD linker needs to have a list of all input BFDs involved in
6354 ASSERT (entry->the_bfd->link.next == NULL);
6355 ASSERT (entry->the_bfd != link_info.output_bfd);
6357 *link_info.input_bfds_tail = entry->the_bfd;
6358 link_info.input_bfds_tail = &entry->the_bfd->link.next;
6359 entry->the_bfd->usrdata = entry;
6360 bfd_set_gp_size (entry->the_bfd, g_switch_value);
6362 /* Look through the sections and check for any which should not be
6363 included in the link. We need to do this now, so that we can
6364 notice when the backend linker tries to report multiple
6365 definition errors for symbols which are in sections we aren't
6366 going to link. FIXME: It might be better to entirely ignore
6367 symbols which are defined in sections which are going to be
6368 discarded. This would require modifying the backend linker for
6369 each backend which might set the SEC_LINK_ONCE flag. If we do
6370 this, we should probably handle SEC_EXCLUDE in the same way. */
6372 bfd_map_over_sections (entry->the_bfd, section_already_linked, entry);
6376 lang_add_output (const char *name, int from_script)
6378 /* Make -o on command line override OUTPUT in script. */
6379 if (!had_output_filename || !from_script)
6381 output_filename = name;
6382 had_output_filename = TRUE;
6395 for (l = 0; l < 32; l++)
6397 if (i >= (unsigned int) x)
6405 lang_output_section_statement_type *
6406 lang_enter_output_section_statement (const char *output_section_statement_name,
6407 etree_type *address_exp,
6408 enum section_type sectype,
6410 etree_type *subalign,
6413 int align_with_input)
6415 lang_output_section_statement_type *os;
6417 os = lang_output_section_statement_lookup (output_section_statement_name,
6419 current_section = os;
6421 if (os->addr_tree == NULL)
6423 os->addr_tree = address_exp;
6425 os->sectype = sectype;
6426 if (sectype != noload_section)
6427 os->flags = SEC_NO_FLAGS;
6429 os->flags = SEC_NEVER_LOAD;
6430 os->block_value = 1;
6432 /* Make next things chain into subchain of this. */
6433 push_stat_ptr (&os->children);
6435 os->align_lma_with_input = align_with_input == ALIGN_WITH_INPUT;
6436 if (os->align_lma_with_input && align != NULL)
6437 einfo (_("%F%P:%S: error: align with input and explicit align specified\n"), NULL);
6439 os->subsection_alignment =
6440 topower (exp_get_value_int (subalign, -1, "subsection alignment"));
6441 os->section_alignment =
6442 topower (exp_get_value_int (align, -1, "section alignment"));
6444 os->load_base = ebase;
6451 lang_output_statement_type *new_stmt;
6453 new_stmt = new_stat (lang_output_statement, stat_ptr);
6454 new_stmt->name = output_filename;
6457 /* Reset the current counters in the regions. */
6460 lang_reset_memory_regions (void)
6462 lang_memory_region_type *p = lang_memory_region_list;
6464 lang_output_section_statement_type *os;
6466 for (p = lang_memory_region_list; p != NULL; p = p->next)
6468 p->current = p->origin;
6472 for (os = &lang_output_section_statement.head->output_section_statement;
6476 os->processed_vma = FALSE;
6477 os->processed_lma = FALSE;
6480 for (o = link_info.output_bfd->sections; o != NULL; o = o->next)
6482 /* Save the last size for possible use by bfd_relax_section. */
6483 o->rawsize = o->size;
6488 /* Worker for lang_gc_sections_1. */
6491 gc_section_callback (lang_wild_statement_type *ptr,
6492 struct wildcard_list *sec ATTRIBUTE_UNUSED,
6494 struct flag_info *sflag_info ATTRIBUTE_UNUSED,
6495 lang_input_statement_type *file ATTRIBUTE_UNUSED,
6496 void *data ATTRIBUTE_UNUSED)
6498 /* If the wild pattern was marked KEEP, the member sections
6499 should be as well. */
6500 if (ptr->keep_sections)
6501 section->flags |= SEC_KEEP;
6504 /* Iterate over sections marking them against GC. */
6507 lang_gc_sections_1 (lang_statement_union_type *s)
6509 for (; s != NULL; s = s->header.next)
6511 switch (s->header.type)
6513 case lang_wild_statement_enum:
6514 walk_wild (&s->wild_statement, gc_section_callback, NULL);
6516 case lang_constructors_statement_enum:
6517 lang_gc_sections_1 (constructor_list.head);
6519 case lang_output_section_statement_enum:
6520 lang_gc_sections_1 (s->output_section_statement.children.head);
6522 case lang_group_statement_enum:
6523 lang_gc_sections_1 (s->group_statement.children.head);
6532 lang_gc_sections (void)
6534 /* Keep all sections so marked in the link script. */
6535 lang_gc_sections_1 (statement_list.head);
6537 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
6538 the special case of debug info. (See bfd/stabs.c)
6539 Twiddle the flag here, to simplify later linker code. */
6540 if (bfd_link_relocatable (&link_info))
6542 LANG_FOR_EACH_INPUT_STATEMENT (f)
6545 #ifdef ENABLE_PLUGINS
6546 if (f->flags.claimed)
6549 for (sec = f->the_bfd->sections; sec != NULL; sec = sec->next)
6550 if ((sec->flags & SEC_DEBUGGING) == 0)
6551 sec->flags &= ~SEC_EXCLUDE;
6555 if (link_info.gc_sections)
6556 bfd_gc_sections (link_info.output_bfd, &link_info);
6559 /* Worker for lang_find_relro_sections_1. */
6562 find_relro_section_callback (lang_wild_statement_type *ptr ATTRIBUTE_UNUSED,
6563 struct wildcard_list *sec ATTRIBUTE_UNUSED,
6565 struct flag_info *sflag_info ATTRIBUTE_UNUSED,
6566 lang_input_statement_type *file ATTRIBUTE_UNUSED,
6569 /* Discarded, excluded and ignored sections effectively have zero
6571 if (section->output_section != NULL
6572 && section->output_section->owner == link_info.output_bfd
6573 && (section->output_section->flags & SEC_EXCLUDE) == 0
6574 && !IGNORE_SECTION (section)
6575 && section->size != 0)
6577 bfd_boolean *has_relro_section = (bfd_boolean *) data;
6578 *has_relro_section = TRUE;
6582 /* Iterate over sections for relro sections. */
6585 lang_find_relro_sections_1 (lang_statement_union_type *s,
6586 bfd_boolean *has_relro_section)
6588 if (*has_relro_section)
6591 for (; s != NULL; s = s->header.next)
6593 if (s == expld.dataseg.relro_end_stat)
6596 switch (s->header.type)
6598 case lang_wild_statement_enum:
6599 walk_wild (&s->wild_statement,
6600 find_relro_section_callback,
6603 case lang_constructors_statement_enum:
6604 lang_find_relro_sections_1 (constructor_list.head,
6607 case lang_output_section_statement_enum:
6608 lang_find_relro_sections_1 (s->output_section_statement.children.head,
6611 case lang_group_statement_enum:
6612 lang_find_relro_sections_1 (s->group_statement.children.head,
6622 lang_find_relro_sections (void)
6624 bfd_boolean has_relro_section = FALSE;
6626 /* Check all sections in the link script. */
6628 lang_find_relro_sections_1 (expld.dataseg.relro_start_stat,
6629 &has_relro_section);
6631 if (!has_relro_section)
6632 link_info.relro = FALSE;
6635 /* Relax all sections until bfd_relax_section gives up. */
6638 lang_relax_sections (bfd_boolean need_layout)
6640 if (RELAXATION_ENABLED)
6642 /* We may need more than one relaxation pass. */
6643 int i = link_info.relax_pass;
6645 /* The backend can use it to determine the current pass. */
6646 link_info.relax_pass = 0;
6650 /* Keep relaxing until bfd_relax_section gives up. */
6651 bfd_boolean relax_again;
6653 link_info.relax_trip = -1;
6656 link_info.relax_trip++;
6658 /* Note: pe-dll.c does something like this also. If you find
6659 you need to change this code, you probably need to change
6660 pe-dll.c also. DJ */
6662 /* Do all the assignments with our current guesses as to
6664 lang_do_assignments (lang_assigning_phase_enum);
6666 /* We must do this after lang_do_assignments, because it uses
6668 lang_reset_memory_regions ();
6670 /* Perform another relax pass - this time we know where the
6671 globals are, so can make a better guess. */
6672 relax_again = FALSE;
6673 lang_size_sections (&relax_again, FALSE);
6675 while (relax_again);
6677 link_info.relax_pass++;
6684 /* Final extra sizing to report errors. */
6685 lang_do_assignments (lang_assigning_phase_enum);
6686 lang_reset_memory_regions ();
6687 lang_size_sections (NULL, TRUE);
6691 #ifdef ENABLE_PLUGINS
6692 /* Find the insert point for the plugin's replacement files. We
6693 place them after the first claimed real object file, or if the
6694 first claimed object is an archive member, after the last real
6695 object file immediately preceding the archive. In the event
6696 no objects have been claimed at all, we return the first dummy
6697 object file on the list as the insert point; that works, but
6698 the callee must be careful when relinking the file_chain as it
6699 is not actually on that chain, only the statement_list and the
6700 input_file list; in that case, the replacement files must be
6701 inserted at the head of the file_chain. */
6703 static lang_input_statement_type *
6704 find_replacements_insert_point (void)
6706 lang_input_statement_type *claim1, *lastobject;
6707 lastobject = &input_file_chain.head->input_statement;
6708 for (claim1 = &file_chain.head->input_statement;
6710 claim1 = &claim1->next->input_statement)
6712 if (claim1->flags.claimed)
6713 return claim1->flags.claim_archive ? lastobject : claim1;
6714 /* Update lastobject if this is a real object file. */
6715 if (claim1->the_bfd && (claim1->the_bfd->my_archive == NULL))
6716 lastobject = claim1;
6718 /* No files were claimed by the plugin. Choose the last object
6719 file found on the list (maybe the first, dummy entry) as the
6724 /* Insert SRCLIST into DESTLIST after given element by chaining
6725 on FIELD as the next-pointer. (Counterintuitively does not need
6726 a pointer to the actual after-node itself, just its chain field.) */
6729 lang_list_insert_after (lang_statement_list_type *destlist,
6730 lang_statement_list_type *srclist,
6731 lang_statement_union_type **field)
6733 *(srclist->tail) = *field;
6734 *field = srclist->head;
6735 if (destlist->tail == field)
6736 destlist->tail = srclist->tail;
6739 /* Detach new nodes added to DESTLIST since the time ORIGLIST
6740 was taken as a copy of it and leave them in ORIGLIST. */
6743 lang_list_remove_tail (lang_statement_list_type *destlist,
6744 lang_statement_list_type *origlist)
6746 union lang_statement_union **savetail;
6747 /* Check that ORIGLIST really is an earlier state of DESTLIST. */
6748 ASSERT (origlist->head == destlist->head);
6749 savetail = origlist->tail;
6750 origlist->head = *(savetail);
6751 origlist->tail = destlist->tail;
6752 destlist->tail = savetail;
6755 #endif /* ENABLE_PLUGINS */
6757 /* Add NAME to the list of garbage collection entry points. */
6760 lang_add_gc_name (const char * name)
6762 struct bfd_sym_chain *sym;
6767 sym = (struct bfd_sym_chain *) stat_alloc (sizeof (*sym));
6769 sym->next = link_info.gc_sym_list;
6771 link_info.gc_sym_list = sym;
6777 /* Finalize dynamic list. */
6778 if (link_info.dynamic_list)
6779 lang_finalize_version_expr_head (&link_info.dynamic_list->head);
6781 current_target = default_target;
6783 /* Open the output file. */
6784 lang_for_each_statement (ldlang_open_output);
6787 ldemul_create_output_section_statements ();
6789 /* Add to the hash table all undefineds on the command line. */
6790 lang_place_undefineds ();
6792 if (!bfd_section_already_linked_table_init ())
6793 einfo (_("%P%F: Failed to create hash table\n"));
6795 /* Create a bfd for each input file. */
6796 current_target = default_target;
6797 open_input_bfds (statement_list.head, OPEN_BFD_NORMAL);
6799 #ifdef ENABLE_PLUGINS
6800 if (link_info.lto_plugin_active)
6802 lang_statement_list_type added;
6803 lang_statement_list_type files, inputfiles;
6805 /* Now all files are read, let the plugin(s) decide if there
6806 are any more to be added to the link before we call the
6807 emulation's after_open hook. We create a private list of
6808 input statements for this purpose, which we will eventually
6809 insert into the global statment list after the first claimed
6812 /* We need to manipulate all three chains in synchrony. */
6814 inputfiles = input_file_chain;
6815 if (plugin_call_all_symbols_read ())
6816 einfo (_("%P%F: %s: plugin reported error after all symbols read\n"),
6817 plugin_error_plugin ());
6818 /* Open any newly added files, updating the file chains. */
6819 open_input_bfds (*added.tail, OPEN_BFD_NORMAL);
6820 /* Restore the global list pointer now they have all been added. */
6821 lang_list_remove_tail (stat_ptr, &added);
6822 /* And detach the fresh ends of the file lists. */
6823 lang_list_remove_tail (&file_chain, &files);
6824 lang_list_remove_tail (&input_file_chain, &inputfiles);
6825 /* Were any new files added? */
6826 if (added.head != NULL)
6828 /* If so, we will insert them into the statement list immediately
6829 after the first input file that was claimed by the plugin. */
6830 plugin_insert = find_replacements_insert_point ();
6831 /* If a plugin adds input files without having claimed any, we
6832 don't really have a good idea where to place them. Just putting
6833 them at the start or end of the list is liable to leave them
6834 outside the crtbegin...crtend range. */
6835 ASSERT (plugin_insert != NULL);
6836 /* Splice the new statement list into the old one. */
6837 lang_list_insert_after (stat_ptr, &added,
6838 &plugin_insert->header.next);
6839 /* Likewise for the file chains. */
6840 lang_list_insert_after (&input_file_chain, &inputfiles,
6841 &plugin_insert->next_real_file);
6842 /* We must be careful when relinking file_chain; we may need to
6843 insert the new files at the head of the list if the insert
6844 point chosen is the dummy first input file. */
6845 if (plugin_insert->filename)
6846 lang_list_insert_after (&file_chain, &files, &plugin_insert->next);
6848 lang_list_insert_after (&file_chain, &files, &file_chain.head);
6850 /* Rescan archives in case new undefined symbols have appeared. */
6851 open_input_bfds (statement_list.head, OPEN_BFD_RESCAN);
6854 #endif /* ENABLE_PLUGINS */
6856 /* Make sure that nobody has tried to add a symbol to this list before now. */
6857 ASSERT (link_info.gc_sym_list == NULL);
6859 link_info.gc_sym_list = &entry_symbol;
6861 if (entry_symbol.name == NULL)
6863 link_info.gc_sym_list = ldlang_undef_chain_list_head;
6865 /* entry_symbol is normally initialied by a ENTRY definition in the
6866 linker script or the -e command line option. But if neither of
6867 these have been used, the target specific backend may still have
6868 provided an entry symbol via a call to lang_default_entry().
6869 Unfortunately this value will not be processed until lang_end()
6870 is called, long after this function has finished. So detect this
6871 case here and add the target's entry symbol to the list of starting
6872 points for garbage collection resolution. */
6873 lang_add_gc_name (entry_symbol_default);
6876 lang_add_gc_name (link_info.init_function);
6877 lang_add_gc_name (link_info.fini_function);
6879 ldemul_after_open ();
6880 if (config.map_file != NULL)
6881 lang_print_asneeded ();
6883 bfd_section_already_linked_table_free ();
6885 /* Make sure that we're not mixing architectures. We call this
6886 after all the input files have been opened, but before we do any
6887 other processing, so that any operations merge_private_bfd_data
6888 does on the output file will be known during the rest of the
6892 /* Handle .exports instead of a version script if we're told to do so. */
6893 if (command_line.version_exports_section)
6894 lang_do_version_exports_section ();
6896 /* Build all sets based on the information gathered from the input
6898 ldctor_build_sets ();
6900 /* PR 13683: We must rerun the assignments prior to running garbage
6901 collection in order to make sure that all symbol aliases are resolved. */
6902 lang_do_assignments (lang_mark_phase_enum);
6904 lang_do_memory_regions();
6905 expld.phase = lang_first_phase_enum;
6907 /* Size up the common data. */
6910 /* Remove unreferenced sections if asked to. */
6911 lang_gc_sections ();
6913 /* Update wild statements. */
6914 update_wild_statements (statement_list.head);
6916 /* Run through the contours of the script and attach input sections
6917 to the correct output sections. */
6918 lang_statement_iteration++;
6919 map_input_to_output_sections (statement_list.head, NULL, NULL);
6921 process_insert_statements ();
6923 /* Find any sections not attached explicitly and handle them. */
6924 lang_place_orphans ();
6926 if (!bfd_link_relocatable (&link_info))
6930 /* Merge SEC_MERGE sections. This has to be done after GC of
6931 sections, so that GCed sections are not merged, but before
6932 assigning dynamic symbols, since removing whole input sections
6934 bfd_merge_sections (link_info.output_bfd, &link_info);
6936 /* Look for a text section and set the readonly attribute in it. */
6937 found = bfd_get_section_by_name (link_info.output_bfd, ".text");
6941 if (config.text_read_only)
6942 found->flags |= SEC_READONLY;
6944 found->flags &= ~SEC_READONLY;
6948 /* Do anything special before sizing sections. This is where ELF
6949 and other back-ends size dynamic sections. */
6950 ldemul_before_allocation ();
6952 /* We must record the program headers before we try to fix the
6953 section positions, since they will affect SIZEOF_HEADERS. */
6954 lang_record_phdrs ();
6956 /* Check relro sections. */
6957 if (link_info.relro && !bfd_link_relocatable (&link_info))
6958 lang_find_relro_sections ();
6960 /* Size up the sections. */
6961 lang_size_sections (NULL, ! RELAXATION_ENABLED);
6963 /* See if anything special should be done now we know how big
6964 everything is. This is where relaxation is done. */
6965 ldemul_after_allocation ();
6967 /* Fix any .startof. or .sizeof. symbols. */
6968 lang_set_startof ();
6970 /* Do all the assignments, now that we know the final resting places
6971 of all the symbols. */
6972 lang_do_assignments (lang_final_phase_enum);
6976 /* Convert absolute symbols to section relative. */
6977 ldexp_finalize_syms ();
6979 /* Make sure that the section addresses make sense. */
6980 if (command_line.check_section_addresses)
6981 lang_check_section_addresses ();
6983 /* Check any required symbols are known. */
6984 ldlang_check_require_defined_symbols ();
6989 /* EXPORTED TO YACC */
6992 lang_add_wild (struct wildcard_spec *filespec,
6993 struct wildcard_list *section_list,
6994 bfd_boolean keep_sections)
6996 struct wildcard_list *curr, *next;
6997 lang_wild_statement_type *new_stmt;
6999 /* Reverse the list as the parser puts it back to front. */
7000 for (curr = section_list, section_list = NULL;
7002 section_list = curr, curr = next)
7004 if (curr->spec.name != NULL && strcmp (curr->spec.name, "COMMON") == 0)
7005 placed_commons = TRUE;
7008 curr->next = section_list;
7011 if (filespec != NULL && filespec->name != NULL)
7013 if (strcmp (filespec->name, "*") == 0)
7014 filespec->name = NULL;
7015 else if (! wildcardp (filespec->name))
7016 lang_has_input_file = TRUE;
7019 new_stmt = new_stat (lang_wild_statement, stat_ptr);
7020 new_stmt->filename = NULL;
7021 new_stmt->filenames_sorted = FALSE;
7022 new_stmt->section_flag_list = NULL;
7023 if (filespec != NULL)
7025 new_stmt->filename = filespec->name;
7026 new_stmt->filenames_sorted = filespec->sorted == by_name;
7027 new_stmt->section_flag_list = filespec->section_flag_list;
7029 new_stmt->section_list = section_list;
7030 new_stmt->keep_sections = keep_sections;
7031 lang_list_init (&new_stmt->children);
7032 analyze_walk_wild_section_handler (new_stmt);
7036 lang_section_start (const char *name, etree_type *address,
7037 const segment_type *segment)
7039 lang_address_statement_type *ad;
7041 ad = new_stat (lang_address_statement, stat_ptr);
7042 ad->section_name = name;
7043 ad->address = address;
7044 ad->segment = segment;
7047 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
7048 because of a -e argument on the command line, or zero if this is
7049 called by ENTRY in a linker script. Command line arguments take
7053 lang_add_entry (const char *name, bfd_boolean cmdline)
7055 if (entry_symbol.name == NULL
7057 || ! entry_from_cmdline)
7059 entry_symbol.name = name;
7060 entry_from_cmdline = cmdline;
7064 /* Set the default start symbol to NAME. .em files should use this,
7065 not lang_add_entry, to override the use of "start" if neither the
7066 linker script nor the command line specifies an entry point. NAME
7067 must be permanently allocated. */
7069 lang_default_entry (const char *name)
7071 entry_symbol_default = name;
7075 lang_add_target (const char *name)
7077 lang_target_statement_type *new_stmt;
7079 new_stmt = new_stat (lang_target_statement, stat_ptr);
7080 new_stmt->target = name;
7084 lang_add_map (const char *name)
7091 map_option_f = TRUE;
7099 lang_add_fill (fill_type *fill)
7101 lang_fill_statement_type *new_stmt;
7103 new_stmt = new_stat (lang_fill_statement, stat_ptr);
7104 new_stmt->fill = fill;
7108 lang_add_data (int type, union etree_union *exp)
7110 lang_data_statement_type *new_stmt;
7112 new_stmt = new_stat (lang_data_statement, stat_ptr);
7113 new_stmt->exp = exp;
7114 new_stmt->type = type;
7117 /* Create a new reloc statement. RELOC is the BFD relocation type to
7118 generate. HOWTO is the corresponding howto structure (we could
7119 look this up, but the caller has already done so). SECTION is the
7120 section to generate a reloc against, or NAME is the name of the
7121 symbol to generate a reloc against. Exactly one of SECTION and
7122 NAME must be NULL. ADDEND is an expression for the addend. */
7125 lang_add_reloc (bfd_reloc_code_real_type reloc,
7126 reloc_howto_type *howto,
7129 union etree_union *addend)
7131 lang_reloc_statement_type *p = new_stat (lang_reloc_statement, stat_ptr);
7135 p->section = section;
7137 p->addend_exp = addend;
7139 p->addend_value = 0;
7140 p->output_section = NULL;
7141 p->output_offset = 0;
7144 lang_assignment_statement_type *
7145 lang_add_assignment (etree_type *exp)
7147 lang_assignment_statement_type *new_stmt;
7149 new_stmt = new_stat (lang_assignment_statement, stat_ptr);
7150 new_stmt->exp = exp;
7155 lang_add_attribute (enum statement_enum attribute)
7157 new_statement (attribute, sizeof (lang_statement_header_type), stat_ptr);
7161 lang_startup (const char *name)
7163 if (first_file->filename != NULL)
7165 einfo (_("%P%F: multiple STARTUP files\n"));
7167 first_file->filename = name;
7168 first_file->local_sym_name = name;
7169 first_file->flags.real = TRUE;
7173 lang_float (bfd_boolean maybe)
7175 lang_float_flag = maybe;
7179 /* Work out the load- and run-time regions from a script statement, and
7180 store them in *LMA_REGION and *REGION respectively.
7182 MEMSPEC is the name of the run-time region, or the value of
7183 DEFAULT_MEMORY_REGION if the statement didn't specify one.
7184 LMA_MEMSPEC is the name of the load-time region, or null if the
7185 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
7186 had an explicit load address.
7188 It is an error to specify both a load region and a load address. */
7191 lang_get_regions (lang_memory_region_type **region,
7192 lang_memory_region_type **lma_region,
7193 const char *memspec,
7194 const char *lma_memspec,
7195 bfd_boolean have_lma,
7196 bfd_boolean have_vma)
7198 *lma_region = lang_memory_region_lookup (lma_memspec, FALSE);
7200 /* If no runtime region or VMA has been specified, but the load region
7201 has been specified, then use the load region for the runtime region
7203 if (lma_memspec != NULL
7205 && strcmp (memspec, DEFAULT_MEMORY_REGION) == 0)
7206 *region = *lma_region;
7208 *region = lang_memory_region_lookup (memspec, FALSE);
7210 if (have_lma && lma_memspec != 0)
7211 einfo (_("%X%P:%S: section has both a load address and a load region\n"),
7216 lang_leave_output_section_statement (fill_type *fill, const char *memspec,
7217 lang_output_section_phdr_list *phdrs,
7218 const char *lma_memspec)
7220 lang_get_regions (¤t_section->region,
7221 ¤t_section->lma_region,
7222 memspec, lma_memspec,
7223 current_section->load_base != NULL,
7224 current_section->addr_tree != NULL);
7226 /* If this section has no load region or base, but uses the same
7227 region as the previous section, then propagate the previous
7228 section's load region. */
7230 if (current_section->lma_region == NULL
7231 && current_section->load_base == NULL
7232 && current_section->addr_tree == NULL
7233 && current_section->region == current_section->prev->region)
7234 current_section->lma_region = current_section->prev->lma_region;
7236 current_section->fill = fill;
7237 current_section->phdrs = phdrs;
7242 lang_statement_append (lang_statement_list_type *list,
7243 lang_statement_union_type *element,
7244 lang_statement_union_type **field)
7246 *(list->tail) = element;
7250 /* Set the output format type. -oformat overrides scripts. */
7253 lang_add_output_format (const char *format,
7258 if (output_target == NULL || !from_script)
7260 if (command_line.endian == ENDIAN_BIG
7263 else if (command_line.endian == ENDIAN_LITTLE
7267 output_target = format;
7272 lang_add_insert (const char *where, int is_before)
7274 lang_insert_statement_type *new_stmt;
7276 new_stmt = new_stat (lang_insert_statement, stat_ptr);
7277 new_stmt->where = where;
7278 new_stmt->is_before = is_before;
7279 saved_script_handle = previous_script_handle;
7282 /* Enter a group. This creates a new lang_group_statement, and sets
7283 stat_ptr to build new statements within the group. */
7286 lang_enter_group (void)
7288 lang_group_statement_type *g;
7290 g = new_stat (lang_group_statement, stat_ptr);
7291 lang_list_init (&g->children);
7292 push_stat_ptr (&g->children);
7295 /* Leave a group. This just resets stat_ptr to start writing to the
7296 regular list of statements again. Note that this will not work if
7297 groups can occur inside anything else which can adjust stat_ptr,
7298 but currently they can't. */
7301 lang_leave_group (void)
7306 /* Add a new program header. This is called for each entry in a PHDRS
7307 command in a linker script. */
7310 lang_new_phdr (const char *name,
7312 bfd_boolean filehdr,
7317 struct lang_phdr *n, **pp;
7320 n = (struct lang_phdr *) stat_alloc (sizeof (struct lang_phdr));
7323 n->type = exp_get_value_int (type, 0, "program header type");
7324 n->filehdr = filehdr;
7329 hdrs = n->type == 1 && (phdrs || filehdr);
7331 for (pp = &lang_phdr_list; *pp != NULL; pp = &(*pp)->next)
7334 && !((*pp)->filehdr || (*pp)->phdrs))
7336 einfo (_("%X%P:%S: PHDRS and FILEHDR are not supported"
7337 " when prior PT_LOAD headers lack them\n"), NULL);
7344 /* Record the program header information in the output BFD. FIXME: We
7345 should not be calling an ELF specific function here. */
7348 lang_record_phdrs (void)
7352 lang_output_section_phdr_list *last;
7353 struct lang_phdr *l;
7354 lang_output_section_statement_type *os;
7357 secs = (asection **) xmalloc (alc * sizeof (asection *));
7360 for (l = lang_phdr_list; l != NULL; l = l->next)
7367 for (os = &lang_output_section_statement.head->output_section_statement;
7371 lang_output_section_phdr_list *pl;
7373 if (os->constraint < 0)
7381 if (os->sectype == noload_section
7382 || os->bfd_section == NULL
7383 || (os->bfd_section->flags & SEC_ALLOC) == 0)
7386 /* Don't add orphans to PT_INTERP header. */
7392 lang_output_section_statement_type * tmp_os;
7394 /* If we have not run across a section with a program
7395 header assigned to it yet, then scan forwards to find
7396 one. This prevents inconsistencies in the linker's
7397 behaviour when a script has specified just a single
7398 header and there are sections in that script which are
7399 not assigned to it, and which occur before the first
7400 use of that header. See here for more details:
7401 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
7402 for (tmp_os = os; tmp_os; tmp_os = tmp_os->next)
7405 last = tmp_os->phdrs;
7409 einfo (_("%F%P: no sections assigned to phdrs\n"));
7414 if (os->bfd_section == NULL)
7417 for (; pl != NULL; pl = pl->next)
7419 if (strcmp (pl->name, l->name) == 0)
7424 secs = (asection **) xrealloc (secs,
7425 alc * sizeof (asection *));
7427 secs[c] = os->bfd_section;
7434 if (l->flags == NULL)
7437 flags = exp_get_vma (l->flags, 0, "phdr flags");
7442 at = exp_get_vma (l->at, 0, "phdr load address");
7444 if (! bfd_record_phdr (link_info.output_bfd, l->type,
7445 l->flags != NULL, flags, l->at != NULL,
7446 at, l->filehdr, l->phdrs, c, secs))
7447 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
7452 /* Make sure all the phdr assignments succeeded. */
7453 for (os = &lang_output_section_statement.head->output_section_statement;
7457 lang_output_section_phdr_list *pl;
7459 if (os->constraint < 0
7460 || os->bfd_section == NULL)
7463 for (pl = os->phdrs;
7466 if (! pl->used && strcmp (pl->name, "NONE") != 0)
7467 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
7468 os->name, pl->name);
7472 /* Record a list of sections which may not be cross referenced. */
7475 lang_add_nocrossref (lang_nocrossref_type *l)
7477 struct lang_nocrossrefs *n;
7479 n = (struct lang_nocrossrefs *) xmalloc (sizeof *n);
7480 n->next = nocrossref_list;
7482 nocrossref_list = n;
7484 /* Set notice_all so that we get informed about all symbols. */
7485 link_info.notice_all = TRUE;
7488 /* Overlay handling. We handle overlays with some static variables. */
7490 /* The overlay virtual address. */
7491 static etree_type *overlay_vma;
7492 /* And subsection alignment. */
7493 static etree_type *overlay_subalign;
7495 /* An expression for the maximum section size seen so far. */
7496 static etree_type *overlay_max;
7498 /* A list of all the sections in this overlay. */
7500 struct overlay_list {
7501 struct overlay_list *next;
7502 lang_output_section_statement_type *os;
7505 static struct overlay_list *overlay_list;
7507 /* Start handling an overlay. */
7510 lang_enter_overlay (etree_type *vma_expr, etree_type *subalign)
7512 /* The grammar should prevent nested overlays from occurring. */
7513 ASSERT (overlay_vma == NULL
7514 && overlay_subalign == NULL
7515 && overlay_max == NULL);
7517 overlay_vma = vma_expr;
7518 overlay_subalign = subalign;
7521 /* Start a section in an overlay. We handle this by calling
7522 lang_enter_output_section_statement with the correct VMA.
7523 lang_leave_overlay sets up the LMA and memory regions. */
7526 lang_enter_overlay_section (const char *name)
7528 struct overlay_list *n;
7531 lang_enter_output_section_statement (name, overlay_vma, overlay_section,
7532 0, overlay_subalign, 0, 0, 0);
7534 /* If this is the first section, then base the VMA of future
7535 sections on this one. This will work correctly even if `.' is
7536 used in the addresses. */
7537 if (overlay_list == NULL)
7538 overlay_vma = exp_nameop (ADDR, name);
7540 /* Remember the section. */
7541 n = (struct overlay_list *) xmalloc (sizeof *n);
7542 n->os = current_section;
7543 n->next = overlay_list;
7546 size = exp_nameop (SIZEOF, name);
7548 /* Arrange to work out the maximum section end address. */
7549 if (overlay_max == NULL)
7552 overlay_max = exp_binop (MAX_K, overlay_max, size);
7555 /* Finish a section in an overlay. There isn't any special to do
7559 lang_leave_overlay_section (fill_type *fill,
7560 lang_output_section_phdr_list *phdrs)
7567 name = current_section->name;
7569 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
7570 region and that no load-time region has been specified. It doesn't
7571 really matter what we say here, since lang_leave_overlay will
7573 lang_leave_output_section_statement (fill, DEFAULT_MEMORY_REGION, phdrs, 0);
7575 /* Define the magic symbols. */
7577 clean = (char *) xmalloc (strlen (name) + 1);
7579 for (s1 = name; *s1 != '\0'; s1++)
7580 if (ISALNUM (*s1) || *s1 == '_')
7584 buf = (char *) xmalloc (strlen (clean) + sizeof "__load_start_");
7585 sprintf (buf, "__load_start_%s", clean);
7586 lang_add_assignment (exp_provide (buf,
7587 exp_nameop (LOADADDR, name),
7590 buf = (char *) xmalloc (strlen (clean) + sizeof "__load_stop_");
7591 sprintf (buf, "__load_stop_%s", clean);
7592 lang_add_assignment (exp_provide (buf,
7594 exp_nameop (LOADADDR, name),
7595 exp_nameop (SIZEOF, name)),
7601 /* Finish an overlay. If there are any overlay wide settings, this
7602 looks through all the sections in the overlay and sets them. */
7605 lang_leave_overlay (etree_type *lma_expr,
7608 const char *memspec,
7609 lang_output_section_phdr_list *phdrs,
7610 const char *lma_memspec)
7612 lang_memory_region_type *region;
7613 lang_memory_region_type *lma_region;
7614 struct overlay_list *l;
7615 lang_nocrossref_type *nocrossref;
7617 lang_get_regions (®ion, &lma_region,
7618 memspec, lma_memspec,
7619 lma_expr != NULL, FALSE);
7623 /* After setting the size of the last section, set '.' to end of the
7625 if (overlay_list != NULL)
7627 overlay_list->os->update_dot = 1;
7628 overlay_list->os->update_dot_tree
7629 = exp_assign (".", exp_binop ('+', overlay_vma, overlay_max), FALSE);
7635 struct overlay_list *next;
7637 if (fill != NULL && l->os->fill == NULL)
7640 l->os->region = region;
7641 l->os->lma_region = lma_region;
7643 /* The first section has the load address specified in the
7644 OVERLAY statement. The rest are worked out from that.
7645 The base address is not needed (and should be null) if
7646 an LMA region was specified. */
7649 l->os->load_base = lma_expr;
7650 l->os->sectype = normal_section;
7652 if (phdrs != NULL && l->os->phdrs == NULL)
7653 l->os->phdrs = phdrs;
7657 lang_nocrossref_type *nc;
7659 nc = (lang_nocrossref_type *) xmalloc (sizeof *nc);
7660 nc->name = l->os->name;
7661 nc->next = nocrossref;
7670 if (nocrossref != NULL)
7671 lang_add_nocrossref (nocrossref);
7674 overlay_list = NULL;
7678 /* Version handling. This is only useful for ELF. */
7680 /* If PREV is NULL, return first version pattern matching particular symbol.
7681 If PREV is non-NULL, return first version pattern matching particular
7682 symbol after PREV (previously returned by lang_vers_match). */
7684 static struct bfd_elf_version_expr *
7685 lang_vers_match (struct bfd_elf_version_expr_head *head,
7686 struct bfd_elf_version_expr *prev,
7690 const char *cxx_sym = sym;
7691 const char *java_sym = sym;
7692 struct bfd_elf_version_expr *expr = NULL;
7693 enum demangling_styles curr_style;
7695 curr_style = CURRENT_DEMANGLING_STYLE;
7696 cplus_demangle_set_style (no_demangling);
7697 c_sym = bfd_demangle (link_info.output_bfd, sym, DMGL_NO_OPTS);
7700 cplus_demangle_set_style (curr_style);
7702 if (head->mask & BFD_ELF_VERSION_CXX_TYPE)
7704 cxx_sym = bfd_demangle (link_info.output_bfd, sym,
7705 DMGL_PARAMS | DMGL_ANSI);
7709 if (head->mask & BFD_ELF_VERSION_JAVA_TYPE)
7711 java_sym = bfd_demangle (link_info.output_bfd, sym, DMGL_JAVA);
7716 if (head->htab && (prev == NULL || prev->literal))
7718 struct bfd_elf_version_expr e;
7720 switch (prev ? prev->mask : 0)
7723 if (head->mask & BFD_ELF_VERSION_C_TYPE)
7726 expr = (struct bfd_elf_version_expr *)
7727 htab_find ((htab_t) head->htab, &e);
7728 while (expr && strcmp (expr->pattern, c_sym) == 0)
7729 if (expr->mask == BFD_ELF_VERSION_C_TYPE)
7735 case BFD_ELF_VERSION_C_TYPE:
7736 if (head->mask & BFD_ELF_VERSION_CXX_TYPE)
7738 e.pattern = cxx_sym;
7739 expr = (struct bfd_elf_version_expr *)
7740 htab_find ((htab_t) head->htab, &e);
7741 while (expr && strcmp (expr->pattern, cxx_sym) == 0)
7742 if (expr->mask == BFD_ELF_VERSION_CXX_TYPE)
7748 case BFD_ELF_VERSION_CXX_TYPE:
7749 if (head->mask & BFD_ELF_VERSION_JAVA_TYPE)
7751 e.pattern = java_sym;
7752 expr = (struct bfd_elf_version_expr *)
7753 htab_find ((htab_t) head->htab, &e);
7754 while (expr && strcmp (expr->pattern, java_sym) == 0)
7755 if (expr->mask == BFD_ELF_VERSION_JAVA_TYPE)
7766 /* Finally, try the wildcards. */
7767 if (prev == NULL || prev->literal)
7768 expr = head->remaining;
7771 for (; expr; expr = expr->next)
7778 if (expr->pattern[0] == '*' && expr->pattern[1] == '\0')
7781 if (expr->mask == BFD_ELF_VERSION_JAVA_TYPE)
7783 else if (expr->mask == BFD_ELF_VERSION_CXX_TYPE)
7787 if (fnmatch (expr->pattern, s, 0) == 0)
7793 free ((char *) c_sym);
7795 free ((char *) cxx_sym);
7796 if (java_sym != sym)
7797 free ((char *) java_sym);
7801 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
7802 return a pointer to the symbol name with any backslash quotes removed. */
7805 realsymbol (const char *pattern)
7808 bfd_boolean changed = FALSE, backslash = FALSE;
7809 char *s, *symbol = (char *) xmalloc (strlen (pattern) + 1);
7811 for (p = pattern, s = symbol; *p != '\0'; ++p)
7813 /* It is a glob pattern only if there is no preceding
7817 /* Remove the preceding backslash. */
7824 if (*p == '?' || *p == '*' || *p == '[')
7831 backslash = *p == '\\';
7847 /* This is called for each variable name or match expression. NEW_NAME is
7848 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
7849 pattern to be matched against symbol names. */
7851 struct bfd_elf_version_expr *
7852 lang_new_vers_pattern (struct bfd_elf_version_expr *orig,
7853 const char *new_name,
7855 bfd_boolean literal_p)
7857 struct bfd_elf_version_expr *ret;
7859 ret = (struct bfd_elf_version_expr *) xmalloc (sizeof *ret);
7863 ret->literal = TRUE;
7864 ret->pattern = literal_p ? new_name : realsymbol (new_name);
7865 if (ret->pattern == NULL)
7867 ret->pattern = new_name;
7868 ret->literal = FALSE;
7871 if (lang == NULL || strcasecmp (lang, "C") == 0)
7872 ret->mask = BFD_ELF_VERSION_C_TYPE;
7873 else if (strcasecmp (lang, "C++") == 0)
7874 ret->mask = BFD_ELF_VERSION_CXX_TYPE;
7875 else if (strcasecmp (lang, "Java") == 0)
7876 ret->mask = BFD_ELF_VERSION_JAVA_TYPE;
7879 einfo (_("%X%P: unknown language `%s' in version information\n"),
7881 ret->mask = BFD_ELF_VERSION_C_TYPE;
7884 return ldemul_new_vers_pattern (ret);
7887 /* This is called for each set of variable names and match
7890 struct bfd_elf_version_tree *
7891 lang_new_vers_node (struct bfd_elf_version_expr *globals,
7892 struct bfd_elf_version_expr *locals)
7894 struct bfd_elf_version_tree *ret;
7896 ret = (struct bfd_elf_version_tree *) xcalloc (1, sizeof *ret);
7897 ret->globals.list = globals;
7898 ret->locals.list = locals;
7899 ret->match = lang_vers_match;
7900 ret->name_indx = (unsigned int) -1;
7904 /* This static variable keeps track of version indices. */
7906 static int version_index;
7909 version_expr_head_hash (const void *p)
7911 const struct bfd_elf_version_expr *e =
7912 (const struct bfd_elf_version_expr *) p;
7914 return htab_hash_string (e->pattern);
7918 version_expr_head_eq (const void *p1, const void *p2)
7920 const struct bfd_elf_version_expr *e1 =
7921 (const struct bfd_elf_version_expr *) p1;
7922 const struct bfd_elf_version_expr *e2 =
7923 (const struct bfd_elf_version_expr *) p2;
7925 return strcmp (e1->pattern, e2->pattern) == 0;
7929 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head *head)
7932 struct bfd_elf_version_expr *e, *next;
7933 struct bfd_elf_version_expr **list_loc, **remaining_loc;
7935 for (e = head->list; e; e = e->next)
7939 head->mask |= e->mask;
7944 head->htab = htab_create (count * 2, version_expr_head_hash,
7945 version_expr_head_eq, NULL);
7946 list_loc = &head->list;
7947 remaining_loc = &head->remaining;
7948 for (e = head->list; e; e = next)
7954 remaining_loc = &e->next;
7958 void **loc = htab_find_slot ((htab_t) head->htab, e, INSERT);
7962 struct bfd_elf_version_expr *e1, *last;
7964 e1 = (struct bfd_elf_version_expr *) *loc;
7968 if (e1->mask == e->mask)
7976 while (e1 && strcmp (e1->pattern, e->pattern) == 0);
7980 /* This is a duplicate. */
7981 /* FIXME: Memory leak. Sometimes pattern is not
7982 xmalloced alone, but in larger chunk of memory. */
7983 /* free (e->pattern); */
7988 e->next = last->next;
7996 list_loc = &e->next;
8000 *remaining_loc = NULL;
8001 *list_loc = head->remaining;
8004 head->remaining = head->list;
8007 /* This is called when we know the name and dependencies of the
8011 lang_register_vers_node (const char *name,
8012 struct bfd_elf_version_tree *version,
8013 struct bfd_elf_version_deps *deps)
8015 struct bfd_elf_version_tree *t, **pp;
8016 struct bfd_elf_version_expr *e1;
8021 if (link_info.version_info != NULL
8022 && (name[0] == '\0' || link_info.version_info->name[0] == '\0'))
8024 einfo (_("%X%P: anonymous version tag cannot be combined"
8025 " with other version tags\n"));
8030 /* Make sure this node has a unique name. */
8031 for (t = link_info.version_info; t != NULL; t = t->next)
8032 if (strcmp (t->name, name) == 0)
8033 einfo (_("%X%P: duplicate version tag `%s'\n"), name);
8035 lang_finalize_version_expr_head (&version->globals);
8036 lang_finalize_version_expr_head (&version->locals);
8038 /* Check the global and local match names, and make sure there
8039 aren't any duplicates. */
8041 for (e1 = version->globals.list; e1 != NULL; e1 = e1->next)
8043 for (t = link_info.version_info; t != NULL; t = t->next)
8045 struct bfd_elf_version_expr *e2;
8047 if (t->locals.htab && e1->literal)
8049 e2 = (struct bfd_elf_version_expr *)
8050 htab_find ((htab_t) t->locals.htab, e1);
8051 while (e2 && strcmp (e1->pattern, e2->pattern) == 0)
8053 if (e1->mask == e2->mask)
8054 einfo (_("%X%P: duplicate expression `%s'"
8055 " in version information\n"), e1->pattern);
8059 else if (!e1->literal)
8060 for (e2 = t->locals.remaining; e2 != NULL; e2 = e2->next)
8061 if (strcmp (e1->pattern, e2->pattern) == 0
8062 && e1->mask == e2->mask)
8063 einfo (_("%X%P: duplicate expression `%s'"
8064 " in version information\n"), e1->pattern);
8068 for (e1 = version->locals.list; e1 != NULL; e1 = e1->next)
8070 for (t = link_info.version_info; t != NULL; t = t->next)
8072 struct bfd_elf_version_expr *e2;
8074 if (t->globals.htab && e1->literal)
8076 e2 = (struct bfd_elf_version_expr *)
8077 htab_find ((htab_t) t->globals.htab, e1);
8078 while (e2 && strcmp (e1->pattern, e2->pattern) == 0)
8080 if (e1->mask == e2->mask)
8081 einfo (_("%X%P: duplicate expression `%s'"
8082 " in version information\n"),
8087 else if (!e1->literal)
8088 for (e2 = t->globals.remaining; e2 != NULL; e2 = e2->next)
8089 if (strcmp (e1->pattern, e2->pattern) == 0
8090 && e1->mask == e2->mask)
8091 einfo (_("%X%P: duplicate expression `%s'"
8092 " in version information\n"), e1->pattern);
8096 version->deps = deps;
8097 version->name = name;
8098 if (name[0] != '\0')
8101 version->vernum = version_index;
8104 version->vernum = 0;
8106 for (pp = &link_info.version_info; *pp != NULL; pp = &(*pp)->next)
8111 /* This is called when we see a version dependency. */
8113 struct bfd_elf_version_deps *
8114 lang_add_vers_depend (struct bfd_elf_version_deps *list, const char *name)
8116 struct bfd_elf_version_deps *ret;
8117 struct bfd_elf_version_tree *t;
8119 ret = (struct bfd_elf_version_deps *) xmalloc (sizeof *ret);
8122 for (t = link_info.version_info; t != NULL; t = t->next)
8124 if (strcmp (t->name, name) == 0)
8126 ret->version_needed = t;
8131 einfo (_("%X%P: unable to find version dependency `%s'\n"), name);
8133 ret->version_needed = NULL;
8138 lang_do_version_exports_section (void)
8140 struct bfd_elf_version_expr *greg = NULL, *lreg;
8142 LANG_FOR_EACH_INPUT_STATEMENT (is)
8144 asection *sec = bfd_get_section_by_name (is->the_bfd, ".exports");
8152 contents = (char *) xmalloc (len);
8153 if (!bfd_get_section_contents (is->the_bfd, sec, contents, 0, len))
8154 einfo (_("%X%P: unable to read .exports section contents\n"), sec);
8157 while (p < contents + len)
8159 greg = lang_new_vers_pattern (greg, p, NULL, FALSE);
8160 p = strchr (p, '\0') + 1;
8163 /* Do not free the contents, as we used them creating the regex. */
8165 /* Do not include this section in the link. */
8166 sec->flags |= SEC_EXCLUDE | SEC_KEEP;
8169 lreg = lang_new_vers_pattern (NULL, "*", NULL, FALSE);
8170 lang_register_vers_node (command_line.version_exports_section,
8171 lang_new_vers_node (greg, lreg), NULL);
8174 /* Evaluate LENGTH and ORIGIN parts of MEMORY spec */
8177 lang_do_memory_regions (void)
8179 lang_memory_region_type *r = lang_memory_region_list;
8181 for (; r != NULL; r = r->next)
8185 exp_fold_tree_no_dot (r->origin_exp);
8186 if (expld.result.valid_p)
8188 r->origin = expld.result.value;
8189 r->current = r->origin;
8192 einfo (_("%F%P: invalid origin for memory region %s\n"), r->name_list.name);
8196 exp_fold_tree_no_dot (r->length_exp);
8197 if (expld.result.valid_p)
8198 r->length = expld.result.value;
8200 einfo (_("%F%P: invalid length for memory region %s\n"), r->name_list.name);
8206 lang_add_unique (const char *name)
8208 struct unique_sections *ent;
8210 for (ent = unique_section_list; ent; ent = ent->next)
8211 if (strcmp (ent->name, name) == 0)
8214 ent = (struct unique_sections *) xmalloc (sizeof *ent);
8215 ent->name = xstrdup (name);
8216 ent->next = unique_section_list;
8217 unique_section_list = ent;
8220 /* Append the list of dynamic symbols to the existing one. */
8223 lang_append_dynamic_list (struct bfd_elf_version_expr *dynamic)
8225 if (link_info.dynamic_list)
8227 struct bfd_elf_version_expr *tail;
8228 for (tail = dynamic; tail->next != NULL; tail = tail->next)
8230 tail->next = link_info.dynamic_list->head.list;
8231 link_info.dynamic_list->head.list = dynamic;
8235 struct bfd_elf_dynamic_list *d;
8237 d = (struct bfd_elf_dynamic_list *) xcalloc (1, sizeof *d);
8238 d->head.list = dynamic;
8239 d->match = lang_vers_match;
8240 link_info.dynamic_list = d;
8244 /* Append the list of C++ typeinfo dynamic symbols to the existing
8248 lang_append_dynamic_list_cpp_typeinfo (void)
8250 const char * symbols [] =
8252 "typeinfo name for*",
8255 struct bfd_elf_version_expr *dynamic = NULL;
8258 for (i = 0; i < ARRAY_SIZE (symbols); i++)
8259 dynamic = lang_new_vers_pattern (dynamic, symbols [i], "C++",
8262 lang_append_dynamic_list (dynamic);
8265 /* Append the list of C++ operator new and delete dynamic symbols to the
8269 lang_append_dynamic_list_cpp_new (void)
8271 const char * symbols [] =
8276 struct bfd_elf_version_expr *dynamic = NULL;
8279 for (i = 0; i < ARRAY_SIZE (symbols); i++)
8280 dynamic = lang_new_vers_pattern (dynamic, symbols [i], "C++",
8283 lang_append_dynamic_list (dynamic);
8286 /* Scan a space and/or comma separated string of features. */
8289 lang_ld_feature (char *str)
8297 while (*p == ',' || ISSPACE (*p))
8302 while (*q && *q != ',' && !ISSPACE (*q))
8306 if (strcasecmp (p, "SANE_EXPR") == 0)
8307 config.sane_expr = TRUE;
8309 einfo (_("%X%P: unknown feature `%s'\n"), p);
8315 /* Pretty print memory amount. */
8318 lang_print_memory_size (bfd_vma sz)
8320 if ((sz & 0x3fffffff) == 0)
8321 printf ("%10" BFD_VMA_FMT "u GB", sz >> 30);
8322 else if ((sz & 0xfffff) == 0)
8323 printf ("%10" BFD_VMA_FMT "u MB", sz >> 20);
8324 else if ((sz & 0x3ff) == 0)
8325 printf ("%10" BFD_VMA_FMT "u KB", sz >> 10);
8327 printf (" %10" BFD_VMA_FMT "u B", sz);
8330 /* Implement --print-memory-usage: disply per region memory usage. */
8333 lang_print_memory_usage (void)
8335 lang_memory_region_type *r;
8337 printf ("Memory region Used Size Region Size %%age Used\n");
8338 for (r = lang_memory_region_list; r->next != NULL; r = r->next)
8340 bfd_vma used_length = r->current - r->origin;
8343 printf ("%16s: ",r->name_list.name);
8344 lang_print_memory_size (used_length);
8345 lang_print_memory_size ((bfd_vma) r->length);
8347 percent = used_length * 100.0 / r->length;
8349 printf (" %6.2f%%\n", percent);