1 /* Linker command language support.
2 Copyright (C) 1991-2014 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;
72 /* Forward declarations. */
73 static void exp_init_os (etree_type *);
74 static lang_input_statement_type *lookup_name (const char *);
75 static void insert_undefined (const char *);
76 static bfd_boolean sort_def_symbol (struct bfd_link_hash_entry *, void *);
77 static void print_statement (lang_statement_union_type *,
78 lang_output_section_statement_type *);
79 static void print_statement_list (lang_statement_union_type *,
80 lang_output_section_statement_type *);
81 static void print_statements (void);
82 static void print_input_section (asection *, bfd_boolean);
83 static bfd_boolean lang_one_common (struct bfd_link_hash_entry *, void *);
84 static void lang_record_phdrs (void);
85 static void lang_do_version_exports_section (void);
86 static void lang_finalize_version_expr_head
87 (struct bfd_elf_version_expr_head *);
89 /* Exported variables. */
90 const char *output_target;
91 lang_output_section_statement_type *abs_output_section;
92 lang_statement_list_type lang_output_section_statement;
93 lang_statement_list_type *stat_ptr = &statement_list;
94 lang_statement_list_type file_chain = { NULL, NULL };
95 lang_statement_list_type input_file_chain;
96 struct bfd_sym_chain entry_symbol = { NULL, NULL };
97 const char *entry_section = ".text";
98 struct lang_input_statement_flags input_flags;
99 bfd_boolean entry_from_cmdline;
100 bfd_boolean undef_from_cmdline;
101 bfd_boolean lang_has_input_file = FALSE;
102 bfd_boolean had_output_filename = FALSE;
103 bfd_boolean lang_float_flag = FALSE;
104 bfd_boolean delete_output_file_on_failure = FALSE;
105 struct lang_phdr *lang_phdr_list;
106 struct lang_nocrossrefs *nocrossref_list;
107 struct asneeded_minfo **asneeded_list_tail;
109 /* Functions that traverse the linker script and might evaluate
110 DEFINED() need to increment this at the start of the traversal. */
111 int lang_statement_iteration = 0;
113 /* Return TRUE if the PATTERN argument is a wildcard pattern.
114 Although backslashes are treated specially if a pattern contains
115 wildcards, we do not consider the mere presence of a backslash to
116 be enough to cause the pattern to be treated as a wildcard.
117 That lets us handle DOS filenames more naturally. */
118 #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL)
120 #define new_stat(x, y) \
121 (x##_type *) new_statement (x##_enum, sizeof (x##_type), y)
123 #define outside_section_address(q) \
124 ((q)->output_offset + (q)->output_section->vma)
126 #define outside_symbol_address(q) \
127 ((q)->value + outside_section_address (q->section))
129 #define SECTION_NAME_MAP_LENGTH (16)
132 stat_alloc (size_t size)
134 return obstack_alloc (&stat_obstack, size);
138 name_match (const char *pattern, const char *name)
140 if (wildcardp (pattern))
141 return fnmatch (pattern, name, 0);
142 return strcmp (pattern, name);
145 /* If PATTERN is of the form archive:file, return a pointer to the
146 separator. If not, return NULL. */
149 archive_path (const char *pattern)
153 if (link_info.path_separator == 0)
156 p = strchr (pattern, link_info.path_separator);
157 #ifdef HAVE_DOS_BASED_FILE_SYSTEM
158 if (p == NULL || link_info.path_separator != ':')
161 /* Assume a match on the second char is part of drive specifier,
162 as in "c:\silly.dos". */
163 if (p == pattern + 1 && ISALPHA (*pattern))
164 p = strchr (p + 1, link_info.path_separator);
169 /* Given that FILE_SPEC results in a non-NULL SEP result from archive_path,
170 return whether F matches FILE_SPEC. */
173 input_statement_is_archive_path (const char *file_spec, char *sep,
174 lang_input_statement_type *f)
176 bfd_boolean match = FALSE;
179 || name_match (sep + 1, f->filename) == 0)
180 && ((sep != file_spec)
181 == (f->the_bfd != NULL && f->the_bfd->my_archive != NULL)))
185 if (sep != file_spec)
187 const char *aname = f->the_bfd->my_archive->filename;
189 match = name_match (file_spec, aname) == 0;
190 *sep = link_info.path_separator;
197 unique_section_p (const asection *sec,
198 const lang_output_section_statement_type *os)
200 struct unique_sections *unam;
203 if (link_info.relocatable
204 && sec->owner != NULL
205 && bfd_is_group_section (sec->owner, sec))
207 && strcmp (os->name, DISCARD_SECTION_NAME) == 0);
210 for (unam = unique_section_list; unam; unam = unam->next)
211 if (name_match (unam->name, secnam) == 0)
217 /* Generic traversal routines for finding matching sections. */
219 /* Try processing a section against a wildcard. This just calls
220 the callback unless the filename exclusion list is present
221 and excludes the file. It's hardly ever present so this
222 function is very fast. */
225 walk_wild_consider_section (lang_wild_statement_type *ptr,
226 lang_input_statement_type *file,
228 struct wildcard_list *sec,
232 struct name_list *list_tmp;
234 /* Don't process sections from files which were excluded. */
235 for (list_tmp = sec->spec.exclude_name_list;
237 list_tmp = list_tmp->next)
239 char *p = archive_path (list_tmp->name);
243 if (input_statement_is_archive_path (list_tmp->name, p, file))
247 else if (name_match (list_tmp->name, file->filename) == 0)
250 /* FIXME: Perhaps remove the following at some stage? Matching
251 unadorned archives like this was never documented and has
252 been superceded by the archive:path syntax. */
253 else if (file->the_bfd != NULL
254 && file->the_bfd->my_archive != NULL
255 && name_match (list_tmp->name,
256 file->the_bfd->my_archive->filename) == 0)
260 (*callback) (ptr, sec, s, ptr->section_flag_list, file, data);
263 /* Lowest common denominator routine that can handle everything correctly,
267 walk_wild_section_general (lang_wild_statement_type *ptr,
268 lang_input_statement_type *file,
273 struct wildcard_list *sec;
275 for (s = file->the_bfd->sections; s != NULL; s = s->next)
277 sec = ptr->section_list;
279 (*callback) (ptr, sec, s, ptr->section_flag_list, file, data);
283 bfd_boolean skip = FALSE;
285 if (sec->spec.name != NULL)
287 const char *sname = bfd_get_section_name (file->the_bfd, s);
289 skip = name_match (sec->spec.name, sname) != 0;
293 walk_wild_consider_section (ptr, file, s, sec, callback, data);
300 /* Routines to find a single section given its name. If there's more
301 than one section with that name, we report that. */
305 asection *found_section;
306 bfd_boolean multiple_sections_found;
307 } section_iterator_callback_data;
310 section_iterator_callback (bfd *abfd ATTRIBUTE_UNUSED, asection *s, void *data)
312 section_iterator_callback_data *d = (section_iterator_callback_data *) data;
314 if (d->found_section != NULL)
316 d->multiple_sections_found = TRUE;
320 d->found_section = s;
325 find_section (lang_input_statement_type *file,
326 struct wildcard_list *sec,
327 bfd_boolean *multiple_sections_found)
329 section_iterator_callback_data cb_data = { NULL, FALSE };
331 bfd_get_section_by_name_if (file->the_bfd, sec->spec.name,
332 section_iterator_callback, &cb_data);
333 *multiple_sections_found = cb_data.multiple_sections_found;
334 return cb_data.found_section;
337 /* Code for handling simple wildcards without going through fnmatch,
338 which can be expensive because of charset translations etc. */
340 /* A simple wild is a literal string followed by a single '*',
341 where the literal part is at least 4 characters long. */
344 is_simple_wild (const char *name)
346 size_t len = strcspn (name, "*?[");
347 return len >= 4 && name[len] == '*' && name[len + 1] == '\0';
351 match_simple_wild (const char *pattern, const char *name)
353 /* The first four characters of the pattern are guaranteed valid
354 non-wildcard characters. So we can go faster. */
355 if (pattern[0] != name[0] || pattern[1] != name[1]
356 || pattern[2] != name[2] || pattern[3] != name[3])
361 while (*pattern != '*')
362 if (*name++ != *pattern++)
368 /* Return the numerical value of the init_priority attribute from
369 section name NAME. */
372 get_init_priority (const char *name)
375 unsigned long init_priority;
377 /* GCC uses the following section names for the init_priority
378 attribute with numerical values 101 and 65535 inclusive. A
379 lower value means a higher priority.
381 1: .init_array.NNNN/.fini_array.NNNN: Where NNNN is the
382 decimal numerical value of the init_priority attribute.
383 The order of execution in .init_array is forward and
384 .fini_array is backward.
385 2: .ctors.NNNN/.dtors.NNNN: Where NNNN is 65535 minus the
386 decimal numerical value of the init_priority attribute.
387 The order of execution in .ctors is backward and .dtors
390 if (strncmp (name, ".init_array.", 12) == 0
391 || strncmp (name, ".fini_array.", 12) == 0)
393 init_priority = strtoul (name + 12, &end, 10);
394 return *end ? 0 : init_priority;
396 else if (strncmp (name, ".ctors.", 7) == 0
397 || strncmp (name, ".dtors.", 7) == 0)
399 init_priority = strtoul (name + 7, &end, 10);
400 return *end ? 0 : 65535 - init_priority;
406 /* Compare sections ASEC and BSEC according to SORT. */
409 compare_section (sort_type sort, asection *asec, asection *bsec)
412 unsigned long ainit_priority, binit_priority;
419 case by_init_priority:
421 = get_init_priority (bfd_get_section_name (asec->owner, asec));
423 = get_init_priority (bfd_get_section_name (bsec->owner, bsec));
424 if (ainit_priority == 0 || binit_priority == 0)
426 ret = ainit_priority - binit_priority;
432 case by_alignment_name:
433 ret = (bfd_section_alignment (bsec->owner, bsec)
434 - bfd_section_alignment (asec->owner, asec));
441 ret = strcmp (bfd_get_section_name (asec->owner, asec),
442 bfd_get_section_name (bsec->owner, bsec));
445 case by_name_alignment:
446 ret = strcmp (bfd_get_section_name (asec->owner, asec),
447 bfd_get_section_name (bsec->owner, bsec));
453 ret = (bfd_section_alignment (bsec->owner, bsec)
454 - bfd_section_alignment (asec->owner, asec));
461 /* Build a Binary Search Tree to sort sections, unlike insertion sort
462 used in wild_sort(). BST is considerably faster if the number of
463 of sections are large. */
465 static lang_section_bst_type **
466 wild_sort_fast (lang_wild_statement_type *wild,
467 struct wildcard_list *sec,
468 lang_input_statement_type *file ATTRIBUTE_UNUSED,
471 lang_section_bst_type **tree;
474 if (!wild->filenames_sorted
475 && (sec == NULL || sec->spec.sorted == none))
477 /* Append at the right end of tree. */
479 tree = &((*tree)->right);
485 /* Find the correct node to append this section. */
486 if (compare_section (sec->spec.sorted, section, (*tree)->section) < 0)
487 tree = &((*tree)->left);
489 tree = &((*tree)->right);
495 /* Use wild_sort_fast to build a BST to sort sections. */
498 output_section_callback_fast (lang_wild_statement_type *ptr,
499 struct wildcard_list *sec,
501 struct flag_info *sflag_list ATTRIBUTE_UNUSED,
502 lang_input_statement_type *file,
505 lang_section_bst_type *node;
506 lang_section_bst_type **tree;
507 lang_output_section_statement_type *os;
509 os = (lang_output_section_statement_type *) output;
511 if (unique_section_p (section, os))
514 node = (lang_section_bst_type *) xmalloc (sizeof (lang_section_bst_type));
517 node->section = section;
519 tree = wild_sort_fast (ptr, sec, file, section);
524 /* Convert a sorted sections' BST back to list form. */
527 output_section_callback_tree_to_list (lang_wild_statement_type *ptr,
528 lang_section_bst_type *tree,
532 output_section_callback_tree_to_list (ptr, tree->left, output);
534 lang_add_section (&ptr->children, tree->section, NULL,
535 (lang_output_section_statement_type *) output);
538 output_section_callback_tree_to_list (ptr, tree->right, output);
543 /* Specialized, optimized routines for handling different kinds of
547 walk_wild_section_specs1_wild0 (lang_wild_statement_type *ptr,
548 lang_input_statement_type *file,
552 /* We can just do a hash lookup for the section with the right name.
553 But if that lookup discovers more than one section with the name
554 (should be rare), we fall back to the general algorithm because
555 we would otherwise have to sort the sections to make sure they
556 get processed in the bfd's order. */
557 bfd_boolean multiple_sections_found;
558 struct wildcard_list *sec0 = ptr->handler_data[0];
559 asection *s0 = find_section (file, sec0, &multiple_sections_found);
561 if (multiple_sections_found)
562 walk_wild_section_general (ptr, file, callback, data);
564 walk_wild_consider_section (ptr, file, s0, sec0, callback, data);
568 walk_wild_section_specs1_wild1 (lang_wild_statement_type *ptr,
569 lang_input_statement_type *file,
574 struct wildcard_list *wildsec0 = ptr->handler_data[0];
576 for (s = file->the_bfd->sections; s != NULL; s = s->next)
578 const char *sname = bfd_get_section_name (file->the_bfd, s);
579 bfd_boolean skip = !match_simple_wild (wildsec0->spec.name, sname);
582 walk_wild_consider_section (ptr, file, s, wildsec0, callback, data);
587 walk_wild_section_specs2_wild1 (lang_wild_statement_type *ptr,
588 lang_input_statement_type *file,
593 struct wildcard_list *sec0 = ptr->handler_data[0];
594 struct wildcard_list *wildsec1 = ptr->handler_data[1];
595 bfd_boolean multiple_sections_found;
596 asection *s0 = find_section (file, sec0, &multiple_sections_found);
598 if (multiple_sections_found)
600 walk_wild_section_general (ptr, file, callback, data);
604 /* Note that if the section was not found, s0 is NULL and
605 we'll simply never succeed the s == s0 test below. */
606 for (s = file->the_bfd->sections; s != NULL; s = s->next)
608 /* Recall that in this code path, a section cannot satisfy more
609 than one spec, so if s == s0 then it cannot match
612 walk_wild_consider_section (ptr, file, s, sec0, callback, data);
615 const char *sname = bfd_get_section_name (file->the_bfd, s);
616 bfd_boolean skip = !match_simple_wild (wildsec1->spec.name, sname);
619 walk_wild_consider_section (ptr, file, s, wildsec1, callback,
626 walk_wild_section_specs3_wild2 (lang_wild_statement_type *ptr,
627 lang_input_statement_type *file,
632 struct wildcard_list *sec0 = ptr->handler_data[0];
633 struct wildcard_list *wildsec1 = ptr->handler_data[1];
634 struct wildcard_list *wildsec2 = ptr->handler_data[2];
635 bfd_boolean multiple_sections_found;
636 asection *s0 = find_section (file, sec0, &multiple_sections_found);
638 if (multiple_sections_found)
640 walk_wild_section_general (ptr, file, callback, data);
644 for (s = file->the_bfd->sections; s != NULL; s = s->next)
647 walk_wild_consider_section (ptr, file, s, sec0, callback, data);
650 const char *sname = bfd_get_section_name (file->the_bfd, s);
651 bfd_boolean skip = !match_simple_wild (wildsec1->spec.name, sname);
654 walk_wild_consider_section (ptr, file, s, wildsec1, callback, data);
657 skip = !match_simple_wild (wildsec2->spec.name, sname);
659 walk_wild_consider_section (ptr, file, s, wildsec2, callback,
667 walk_wild_section_specs4_wild2 (lang_wild_statement_type *ptr,
668 lang_input_statement_type *file,
673 struct wildcard_list *sec0 = ptr->handler_data[0];
674 struct wildcard_list *sec1 = ptr->handler_data[1];
675 struct wildcard_list *wildsec2 = ptr->handler_data[2];
676 struct wildcard_list *wildsec3 = ptr->handler_data[3];
677 bfd_boolean multiple_sections_found;
678 asection *s0 = find_section (file, sec0, &multiple_sections_found), *s1;
680 if (multiple_sections_found)
682 walk_wild_section_general (ptr, file, callback, data);
686 s1 = find_section (file, sec1, &multiple_sections_found);
687 if (multiple_sections_found)
689 walk_wild_section_general (ptr, file, callback, data);
693 for (s = file->the_bfd->sections; s != NULL; s = s->next)
696 walk_wild_consider_section (ptr, file, s, sec0, callback, data);
699 walk_wild_consider_section (ptr, file, s, sec1, callback, data);
702 const char *sname = bfd_get_section_name (file->the_bfd, s);
703 bfd_boolean skip = !match_simple_wild (wildsec2->spec.name,
707 walk_wild_consider_section (ptr, file, s, wildsec2, callback,
711 skip = !match_simple_wild (wildsec3->spec.name, sname);
713 walk_wild_consider_section (ptr, file, s, wildsec3,
721 walk_wild_section (lang_wild_statement_type *ptr,
722 lang_input_statement_type *file,
726 if (file->flags.just_syms)
729 (*ptr->walk_wild_section_handler) (ptr, file, callback, data);
732 /* Returns TRUE when name1 is a wildcard spec that might match
733 something name2 can match. We're conservative: we return FALSE
734 only if the prefixes of name1 and name2 are different up to the
735 first wildcard character. */
738 wild_spec_can_overlap (const char *name1, const char *name2)
740 size_t prefix1_len = strcspn (name1, "?*[");
741 size_t prefix2_len = strcspn (name2, "?*[");
742 size_t min_prefix_len;
744 /* Note that if there is no wildcard character, then we treat the
745 terminating 0 as part of the prefix. Thus ".text" won't match
746 ".text." or ".text.*", for example. */
747 if (name1[prefix1_len] == '\0')
749 if (name2[prefix2_len] == '\0')
752 min_prefix_len = prefix1_len < prefix2_len ? prefix1_len : prefix2_len;
754 return memcmp (name1, name2, min_prefix_len) == 0;
757 /* Select specialized code to handle various kinds of wildcard
761 analyze_walk_wild_section_handler (lang_wild_statement_type *ptr)
764 int wild_name_count = 0;
765 struct wildcard_list *sec;
769 ptr->walk_wild_section_handler = walk_wild_section_general;
770 ptr->handler_data[0] = NULL;
771 ptr->handler_data[1] = NULL;
772 ptr->handler_data[2] = NULL;
773 ptr->handler_data[3] = NULL;
776 /* Count how many wildcard_specs there are, and how many of those
777 actually use wildcards in the name. Also, bail out if any of the
778 wildcard names are NULL. (Can this actually happen?
779 walk_wild_section used to test for it.) And bail out if any
780 of the wildcards are more complex than a simple string
781 ending in a single '*'. */
782 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
785 if (sec->spec.name == NULL)
787 if (wildcardp (sec->spec.name))
790 if (!is_simple_wild (sec->spec.name))
795 /* The zero-spec case would be easy to optimize but it doesn't
796 happen in practice. Likewise, more than 4 specs doesn't
797 happen in practice. */
798 if (sec_count == 0 || sec_count > 4)
801 /* Check that no two specs can match the same section. */
802 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
804 struct wildcard_list *sec2;
805 for (sec2 = sec->next; sec2 != NULL; sec2 = sec2->next)
807 if (wild_spec_can_overlap (sec->spec.name, sec2->spec.name))
812 signature = (sec_count << 8) + wild_name_count;
816 ptr->walk_wild_section_handler = walk_wild_section_specs1_wild0;
819 ptr->walk_wild_section_handler = walk_wild_section_specs1_wild1;
822 ptr->walk_wild_section_handler = walk_wild_section_specs2_wild1;
825 ptr->walk_wild_section_handler = walk_wild_section_specs3_wild2;
828 ptr->walk_wild_section_handler = walk_wild_section_specs4_wild2;
834 /* Now fill the data array with pointers to the specs, first the
835 specs with non-wildcard names, then the specs with wildcard
836 names. It's OK to process the specs in different order from the
837 given order, because we've already determined that no section
838 will match more than one spec. */
840 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
841 if (!wildcardp (sec->spec.name))
842 ptr->handler_data[data_counter++] = sec;
843 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
844 if (wildcardp (sec->spec.name))
845 ptr->handler_data[data_counter++] = sec;
848 /* Handle a wild statement for a single file F. */
851 walk_wild_file (lang_wild_statement_type *s,
852 lang_input_statement_type *f,
856 if (f->the_bfd == NULL
857 || ! bfd_check_format (f->the_bfd, bfd_archive))
858 walk_wild_section (s, f, callback, data);
863 /* This is an archive file. We must map each member of the
864 archive separately. */
865 member = bfd_openr_next_archived_file (f->the_bfd, NULL);
866 while (member != NULL)
868 /* When lookup_name is called, it will call the add_symbols
869 entry point for the archive. For each element of the
870 archive which is included, BFD will call ldlang_add_file,
871 which will set the usrdata field of the member to the
872 lang_input_statement. */
873 if (member->usrdata != NULL)
875 walk_wild_section (s,
876 (lang_input_statement_type *) member->usrdata,
880 member = bfd_openr_next_archived_file (f->the_bfd, member);
886 walk_wild (lang_wild_statement_type *s, callback_t callback, void *data)
888 const char *file_spec = s->filename;
891 if (file_spec == NULL)
893 /* Perform the iteration over all files in the list. */
894 LANG_FOR_EACH_INPUT_STATEMENT (f)
896 walk_wild_file (s, f, callback, data);
899 else if ((p = archive_path (file_spec)) != NULL)
901 LANG_FOR_EACH_INPUT_STATEMENT (f)
903 if (input_statement_is_archive_path (file_spec, p, f))
904 walk_wild_file (s, f, callback, data);
907 else if (wildcardp (file_spec))
909 LANG_FOR_EACH_INPUT_STATEMENT (f)
911 if (fnmatch (file_spec, f->filename, 0) == 0)
912 walk_wild_file (s, f, callback, data);
917 lang_input_statement_type *f;
919 /* Perform the iteration over a single file. */
920 f = lookup_name (file_spec);
922 walk_wild_file (s, f, callback, data);
926 /* lang_for_each_statement walks the parse tree and calls the provided
927 function for each node, except those inside output section statements
928 with constraint set to -1. */
931 lang_for_each_statement_worker (void (*func) (lang_statement_union_type *),
932 lang_statement_union_type *s)
934 for (; s != NULL; s = s->header.next)
938 switch (s->header.type)
940 case lang_constructors_statement_enum:
941 lang_for_each_statement_worker (func, constructor_list.head);
943 case lang_output_section_statement_enum:
944 if (s->output_section_statement.constraint != -1)
945 lang_for_each_statement_worker
946 (func, s->output_section_statement.children.head);
948 case lang_wild_statement_enum:
949 lang_for_each_statement_worker (func,
950 s->wild_statement.children.head);
952 case lang_group_statement_enum:
953 lang_for_each_statement_worker (func,
954 s->group_statement.children.head);
956 case lang_data_statement_enum:
957 case lang_reloc_statement_enum:
958 case lang_object_symbols_statement_enum:
959 case lang_output_statement_enum:
960 case lang_target_statement_enum:
961 case lang_input_section_enum:
962 case lang_input_statement_enum:
963 case lang_assignment_statement_enum:
964 case lang_padding_statement_enum:
965 case lang_address_statement_enum:
966 case lang_fill_statement_enum:
967 case lang_insert_statement_enum:
977 lang_for_each_statement (void (*func) (lang_statement_union_type *))
979 lang_for_each_statement_worker (func, statement_list.head);
982 /*----------------------------------------------------------------------*/
985 lang_list_init (lang_statement_list_type *list)
988 list->tail = &list->head;
992 push_stat_ptr (lang_statement_list_type *new_ptr)
994 if (stat_save_ptr >= stat_save + sizeof (stat_save) / sizeof (stat_save[0]))
996 *stat_save_ptr++ = stat_ptr;
1003 if (stat_save_ptr <= stat_save)
1005 stat_ptr = *--stat_save_ptr;
1008 /* Build a new statement node for the parse tree. */
1010 static lang_statement_union_type *
1011 new_statement (enum statement_enum type,
1013 lang_statement_list_type *list)
1015 lang_statement_union_type *new_stmt;
1017 new_stmt = (lang_statement_union_type *) stat_alloc (size);
1018 new_stmt->header.type = type;
1019 new_stmt->header.next = NULL;
1020 lang_statement_append (list, new_stmt, &new_stmt->header.next);
1024 /* Build a new input file node for the language. There are several
1025 ways in which we treat an input file, eg, we only look at symbols,
1026 or prefix it with a -l etc.
1028 We can be supplied with requests for input files more than once;
1029 they may, for example be split over several lines like foo.o(.text)
1030 foo.o(.data) etc, so when asked for a file we check that we haven't
1031 got it already so we don't duplicate the bfd. */
1033 static lang_input_statement_type *
1034 new_afile (const char *name,
1035 lang_input_file_enum_type file_type,
1037 bfd_boolean add_to_list)
1039 lang_input_statement_type *p;
1041 lang_has_input_file = TRUE;
1044 p = (lang_input_statement_type *) new_stat (lang_input_statement, stat_ptr);
1047 p = (lang_input_statement_type *)
1048 stat_alloc (sizeof (lang_input_statement_type));
1049 p->header.type = lang_input_statement_enum;
1050 p->header.next = NULL;
1053 memset (&p->the_bfd, 0,
1054 sizeof (*p) - offsetof (lang_input_statement_type, the_bfd));
1056 p->flags.dynamic = input_flags.dynamic;
1057 p->flags.add_DT_NEEDED_for_dynamic = input_flags.add_DT_NEEDED_for_dynamic;
1058 p->flags.add_DT_NEEDED_for_regular = input_flags.add_DT_NEEDED_for_regular;
1059 p->flags.whole_archive = input_flags.whole_archive;
1060 p->flags.sysrooted = input_flags.sysrooted;
1064 case lang_input_file_is_symbols_only_enum:
1066 p->local_sym_name = name;
1067 p->flags.real = TRUE;
1068 p->flags.just_syms = TRUE;
1070 case lang_input_file_is_fake_enum:
1072 p->local_sym_name = name;
1074 case lang_input_file_is_l_enum:
1075 if (name[0] == ':' && name[1] != '\0')
1077 p->filename = name + 1;
1078 p->flags.full_name_provided = TRUE;
1082 p->local_sym_name = concat ("-l", name, (const char *) NULL);
1083 p->flags.maybe_archive = TRUE;
1084 p->flags.real = TRUE;
1085 p->flags.search_dirs = TRUE;
1087 case lang_input_file_is_marker_enum:
1089 p->local_sym_name = name;
1090 p->flags.search_dirs = TRUE;
1092 case lang_input_file_is_search_file_enum:
1094 p->local_sym_name = name;
1095 p->flags.real = TRUE;
1096 p->flags.search_dirs = TRUE;
1098 case lang_input_file_is_file_enum:
1100 p->local_sym_name = name;
1101 p->flags.real = TRUE;
1107 lang_statement_append (&input_file_chain,
1108 (lang_statement_union_type *) p,
1109 &p->next_real_file);
1113 lang_input_statement_type *
1114 lang_add_input_file (const char *name,
1115 lang_input_file_enum_type file_type,
1118 if (name != NULL && *name == '=')
1120 lang_input_statement_type *ret;
1121 char *sysrooted_name
1122 = concat (ld_sysroot, name + 1, (const char *) NULL);
1124 /* We've now forcibly prepended the sysroot, making the input
1125 file independent of the context. Therefore, temporarily
1126 force a non-sysrooted context for this statement, so it won't
1127 get the sysroot prepended again when opened. (N.B. if it's a
1128 script, any child nodes with input files starting with "/"
1129 will be handled as "sysrooted" as they'll be found to be
1130 within the sysroot subdirectory.) */
1131 unsigned int outer_sysrooted = input_flags.sysrooted;
1132 input_flags.sysrooted = 0;
1133 ret = new_afile (sysrooted_name, file_type, target, TRUE);
1134 input_flags.sysrooted = outer_sysrooted;
1138 return new_afile (name, file_type, target, TRUE);
1141 struct out_section_hash_entry
1143 struct bfd_hash_entry root;
1144 lang_statement_union_type s;
1147 /* The hash table. */
1149 static struct bfd_hash_table output_section_statement_table;
1151 /* Support routines for the hash table used by lang_output_section_find,
1152 initialize the table, fill in an entry and remove the table. */
1154 static struct bfd_hash_entry *
1155 output_section_statement_newfunc (struct bfd_hash_entry *entry,
1156 struct bfd_hash_table *table,
1159 lang_output_section_statement_type **nextp;
1160 struct out_section_hash_entry *ret;
1164 entry = (struct bfd_hash_entry *) bfd_hash_allocate (table,
1170 entry = bfd_hash_newfunc (entry, table, string);
1174 ret = (struct out_section_hash_entry *) entry;
1175 memset (&ret->s, 0, sizeof (ret->s));
1176 ret->s.header.type = lang_output_section_statement_enum;
1177 ret->s.output_section_statement.subsection_alignment = -1;
1178 ret->s.output_section_statement.section_alignment = -1;
1179 ret->s.output_section_statement.block_value = 1;
1180 lang_list_init (&ret->s.output_section_statement.children);
1181 lang_statement_append (stat_ptr, &ret->s, &ret->s.header.next);
1183 /* For every output section statement added to the list, except the
1184 first one, lang_output_section_statement.tail points to the "next"
1185 field of the last element of the list. */
1186 if (lang_output_section_statement.head != NULL)
1187 ret->s.output_section_statement.prev
1188 = ((lang_output_section_statement_type *)
1189 ((char *) lang_output_section_statement.tail
1190 - offsetof (lang_output_section_statement_type, next)));
1192 /* GCC's strict aliasing rules prevent us from just casting the
1193 address, so we store the pointer in a variable and cast that
1195 nextp = &ret->s.output_section_statement.next;
1196 lang_statement_append (&lang_output_section_statement,
1198 (lang_statement_union_type **) nextp);
1203 output_section_statement_table_init (void)
1205 if (!bfd_hash_table_init_n (&output_section_statement_table,
1206 output_section_statement_newfunc,
1207 sizeof (struct out_section_hash_entry),
1209 einfo (_("%P%F: can not create hash table: %E\n"));
1213 output_section_statement_table_free (void)
1215 bfd_hash_table_free (&output_section_statement_table);
1218 /* Build enough state so that the parser can build its tree. */
1223 obstack_begin (&stat_obstack, 1000);
1225 stat_ptr = &statement_list;
1227 output_section_statement_table_init ();
1229 lang_list_init (stat_ptr);
1231 lang_list_init (&input_file_chain);
1232 lang_list_init (&lang_output_section_statement);
1233 lang_list_init (&file_chain);
1234 first_file = lang_add_input_file (NULL, lang_input_file_is_marker_enum,
1236 abs_output_section =
1237 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME, 0, TRUE);
1239 abs_output_section->bfd_section = bfd_abs_section_ptr;
1241 asneeded_list_head = NULL;
1242 asneeded_list_tail = &asneeded_list_head;
1248 output_section_statement_table_free ();
1251 /*----------------------------------------------------------------------
1252 A region is an area of memory declared with the
1253 MEMORY { name:org=exp, len=exp ... }
1256 We maintain a list of all the regions here.
1258 If no regions are specified in the script, then the default is used
1259 which is created when looked up to be the entire data space.
1261 If create is true we are creating a region inside a MEMORY block.
1262 In this case it is probably an error to create a region that has
1263 already been created. If we are not inside a MEMORY block it is
1264 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1265 and so we issue a warning.
1267 Each region has at least one name. The first name is either
1268 DEFAULT_MEMORY_REGION or the name given in the MEMORY block. You can add
1269 alias names to an existing region within a script with
1270 REGION_ALIAS (alias, region_name). Each name corresponds to at most one
1273 static lang_memory_region_type *lang_memory_region_list;
1274 static lang_memory_region_type **lang_memory_region_list_tail
1275 = &lang_memory_region_list;
1277 lang_memory_region_type *
1278 lang_memory_region_lookup (const char *const name, bfd_boolean create)
1280 lang_memory_region_name *n;
1281 lang_memory_region_type *r;
1282 lang_memory_region_type *new_region;
1284 /* NAME is NULL for LMA memspecs if no region was specified. */
1288 for (r = lang_memory_region_list; r != NULL; r = r->next)
1289 for (n = &r->name_list; n != NULL; n = n->next)
1290 if (strcmp (n->name, name) == 0)
1293 einfo (_("%P:%S: warning: redeclaration of memory region `%s'\n"),
1298 if (!create && strcmp (name, DEFAULT_MEMORY_REGION))
1299 einfo (_("%P:%S: warning: memory region `%s' not declared\n"),
1302 new_region = (lang_memory_region_type *)
1303 stat_alloc (sizeof (lang_memory_region_type));
1305 new_region->name_list.name = xstrdup (name);
1306 new_region->name_list.next = NULL;
1307 new_region->next = NULL;
1308 new_region->origin = 0;
1309 new_region->length = ~(bfd_size_type) 0;
1310 new_region->current = 0;
1311 new_region->last_os = NULL;
1312 new_region->flags = 0;
1313 new_region->not_flags = 0;
1314 new_region->had_full_message = FALSE;
1316 *lang_memory_region_list_tail = new_region;
1317 lang_memory_region_list_tail = &new_region->next;
1323 lang_memory_region_alias (const char * alias, const char * region_name)
1325 lang_memory_region_name * n;
1326 lang_memory_region_type * r;
1327 lang_memory_region_type * region;
1329 /* The default region must be unique. This ensures that it is not necessary
1330 to iterate through the name list if someone wants the check if a region is
1331 the default memory region. */
1332 if (strcmp (region_name, DEFAULT_MEMORY_REGION) == 0
1333 || strcmp (alias, DEFAULT_MEMORY_REGION) == 0)
1334 einfo (_("%F%P:%S: error: alias for default memory region\n"), NULL);
1336 /* Look for the target region and check if the alias is not already
1339 for (r = lang_memory_region_list; r != NULL; r = r->next)
1340 for (n = &r->name_list; n != NULL; n = n->next)
1342 if (region == NULL && strcmp (n->name, region_name) == 0)
1344 if (strcmp (n->name, alias) == 0)
1345 einfo (_("%F%P:%S: error: redefinition of memory region "
1350 /* Check if the target region exists. */
1352 einfo (_("%F%P:%S: error: memory region `%s' "
1353 "for alias `%s' does not exist\n"),
1354 NULL, region_name, alias);
1356 /* Add alias to region name list. */
1357 n = (lang_memory_region_name *) stat_alloc (sizeof (lang_memory_region_name));
1358 n->name = xstrdup (alias);
1359 n->next = region->name_list.next;
1360 region->name_list.next = n;
1363 static lang_memory_region_type *
1364 lang_memory_default (asection * section)
1366 lang_memory_region_type *p;
1368 flagword sec_flags = section->flags;
1370 /* Override SEC_DATA to mean a writable section. */
1371 if ((sec_flags & (SEC_ALLOC | SEC_READONLY | SEC_CODE)) == SEC_ALLOC)
1372 sec_flags |= SEC_DATA;
1374 for (p = lang_memory_region_list; p != NULL; p = p->next)
1376 if ((p->flags & sec_flags) != 0
1377 && (p->not_flags & sec_flags) == 0)
1382 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION, FALSE);
1385 /* Get the output section statement directly from the userdata. */
1387 lang_output_section_statement_type *
1388 lang_output_section_get (const asection *output_section)
1390 return get_userdata (output_section);
1393 /* Find or create an output_section_statement with the given NAME.
1394 If CONSTRAINT is non-zero match one with that constraint, otherwise
1395 match any non-negative constraint. If CREATE, always make a
1396 new output_section_statement for SPECIAL CONSTRAINT. */
1398 lang_output_section_statement_type *
1399 lang_output_section_statement_lookup (const char *name,
1403 struct out_section_hash_entry *entry;
1405 entry = ((struct out_section_hash_entry *)
1406 bfd_hash_lookup (&output_section_statement_table, name,
1411 einfo (_("%P%F: failed creating section `%s': %E\n"), name);
1415 if (entry->s.output_section_statement.name != NULL)
1417 /* We have a section of this name, but it might not have the correct
1419 struct out_section_hash_entry *last_ent;
1421 name = entry->s.output_section_statement.name;
1422 if (create && constraint == SPECIAL)
1423 /* Not traversing to the end reverses the order of the second
1424 and subsequent SPECIAL sections in the hash table chain,
1425 but that shouldn't matter. */
1430 if (constraint == entry->s.output_section_statement.constraint
1432 && entry->s.output_section_statement.constraint >= 0))
1433 return &entry->s.output_section_statement;
1435 entry = (struct out_section_hash_entry *) entry->root.next;
1437 while (entry != NULL
1438 && name == entry->s.output_section_statement.name);
1444 = ((struct out_section_hash_entry *)
1445 output_section_statement_newfunc (NULL,
1446 &output_section_statement_table,
1450 einfo (_("%P%F: failed creating section `%s': %E\n"), name);
1453 entry->root = last_ent->root;
1454 last_ent->root.next = &entry->root;
1457 entry->s.output_section_statement.name = name;
1458 entry->s.output_section_statement.constraint = constraint;
1459 return &entry->s.output_section_statement;
1462 /* Find the next output_section_statement with the same name as OS.
1463 If CONSTRAINT is non-zero, find one with that constraint otherwise
1464 match any non-negative constraint. */
1466 lang_output_section_statement_type *
1467 next_matching_output_section_statement (lang_output_section_statement_type *os,
1470 /* All output_section_statements are actually part of a
1471 struct out_section_hash_entry. */
1472 struct out_section_hash_entry *entry = (struct out_section_hash_entry *)
1474 - offsetof (struct out_section_hash_entry, s.output_section_statement));
1475 const char *name = os->name;
1477 ASSERT (name == entry->root.string);
1480 entry = (struct out_section_hash_entry *) entry->root.next;
1482 || name != entry->s.output_section_statement.name)
1485 while (constraint != entry->s.output_section_statement.constraint
1487 || entry->s.output_section_statement.constraint < 0));
1489 return &entry->s.output_section_statement;
1492 /* A variant of lang_output_section_find used by place_orphan.
1493 Returns the output statement that should precede a new output
1494 statement for SEC. If an exact match is found on certain flags,
1497 lang_output_section_statement_type *
1498 lang_output_section_find_by_flags (const asection *sec,
1499 lang_output_section_statement_type **exact,
1500 lang_match_sec_type_func match_type)
1502 lang_output_section_statement_type *first, *look, *found;
1503 flagword look_flags, sec_flags, differ;
1505 /* We know the first statement on this list is *ABS*. May as well
1507 first = &lang_output_section_statement.head->output_section_statement;
1508 first = first->next;
1510 /* First try for an exact match. */
1511 sec_flags = sec->flags;
1513 for (look = first; look; look = look->next)
1515 look_flags = look->flags;
1516 if (look->bfd_section != NULL)
1518 look_flags = look->bfd_section->flags;
1519 if (match_type && !match_type (link_info.output_bfd,
1524 differ = look_flags ^ sec_flags;
1525 if (!(differ & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD | SEC_READONLY
1526 | SEC_CODE | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1536 if ((sec_flags & SEC_CODE) != 0
1537 && (sec_flags & SEC_ALLOC) != 0)
1539 /* Try for a rw code section. */
1540 for (look = first; look; look = look->next)
1542 look_flags = look->flags;
1543 if (look->bfd_section != NULL)
1545 look_flags = look->bfd_section->flags;
1546 if (match_type && !match_type (link_info.output_bfd,
1551 differ = look_flags ^ sec_flags;
1552 if (!(differ & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1553 | SEC_CODE | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1557 else if ((sec_flags & SEC_READONLY) != 0
1558 && (sec_flags & SEC_ALLOC) != 0)
1560 /* .rodata can go after .text, .sdata2 after .rodata. */
1561 for (look = first; look; look = look->next)
1563 look_flags = look->flags;
1564 if (look->bfd_section != NULL)
1566 look_flags = look->bfd_section->flags;
1567 if (match_type && !match_type (link_info.output_bfd,
1572 differ = look_flags ^ sec_flags;
1573 if (!(differ & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1574 | SEC_READONLY | SEC_SMALL_DATA))
1575 || (!(differ & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1577 && !(look_flags & SEC_SMALL_DATA)))
1581 else if ((sec_flags & SEC_THREAD_LOCAL) != 0
1582 && (sec_flags & SEC_ALLOC) != 0)
1584 /* .tdata can go after .data, .tbss after .tdata. Treat .tbss
1585 as if it were a loaded section, and don't use match_type. */
1586 bfd_boolean seen_thread_local = FALSE;
1589 for (look = first; look; look = look->next)
1591 look_flags = look->flags;
1592 if (look->bfd_section != NULL)
1593 look_flags = look->bfd_section->flags;
1595 differ = look_flags ^ (sec_flags | SEC_LOAD | SEC_HAS_CONTENTS);
1596 if (!(differ & (SEC_THREAD_LOCAL | SEC_ALLOC)))
1598 /* .tdata and .tbss must be adjacent and in that order. */
1599 if (!(look_flags & SEC_LOAD)
1600 && (sec_flags & SEC_LOAD))
1601 /* ..so if we're at a .tbss section and we're placing
1602 a .tdata section stop looking and return the
1603 previous section. */
1606 seen_thread_local = TRUE;
1608 else if (seen_thread_local)
1610 else if (!(differ & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD)))
1614 else if ((sec_flags & SEC_SMALL_DATA) != 0
1615 && (sec_flags & SEC_ALLOC) != 0)
1617 /* .sdata goes after .data, .sbss after .sdata. */
1618 for (look = first; look; look = look->next)
1620 look_flags = look->flags;
1621 if (look->bfd_section != NULL)
1623 look_flags = look->bfd_section->flags;
1624 if (match_type && !match_type (link_info.output_bfd,
1629 differ = look_flags ^ sec_flags;
1630 if (!(differ & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1631 | SEC_THREAD_LOCAL))
1632 || ((look_flags & SEC_SMALL_DATA)
1633 && !(sec_flags & SEC_HAS_CONTENTS)))
1637 else if ((sec_flags & SEC_HAS_CONTENTS) != 0
1638 && (sec_flags & SEC_ALLOC) != 0)
1640 /* .data goes after .rodata. */
1641 for (look = first; look; look = look->next)
1643 look_flags = look->flags;
1644 if (look->bfd_section != NULL)
1646 look_flags = look->bfd_section->flags;
1647 if (match_type && !match_type (link_info.output_bfd,
1652 differ = look_flags ^ sec_flags;
1653 if (!(differ & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1654 | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1658 else if ((sec_flags & SEC_ALLOC) != 0)
1660 /* .bss goes after any other alloc section. */
1661 for (look = first; look; look = look->next)
1663 look_flags = look->flags;
1664 if (look->bfd_section != NULL)
1666 look_flags = look->bfd_section->flags;
1667 if (match_type && !match_type (link_info.output_bfd,
1672 differ = look_flags ^ sec_flags;
1673 if (!(differ & SEC_ALLOC))
1679 /* non-alloc go last. */
1680 for (look = first; look; look = look->next)
1682 look_flags = look->flags;
1683 if (look->bfd_section != NULL)
1684 look_flags = look->bfd_section->flags;
1685 differ = look_flags ^ sec_flags;
1686 if (!(differ & SEC_DEBUGGING))
1692 if (found || !match_type)
1695 return lang_output_section_find_by_flags (sec, NULL, NULL);
1698 /* Find the last output section before given output statement.
1699 Used by place_orphan. */
1702 output_prev_sec_find (lang_output_section_statement_type *os)
1704 lang_output_section_statement_type *lookup;
1706 for (lookup = os->prev; lookup != NULL; lookup = lookup->prev)
1708 if (lookup->constraint < 0)
1711 if (lookup->bfd_section != NULL && lookup->bfd_section->owner != NULL)
1712 return lookup->bfd_section;
1718 /* Look for a suitable place for a new output section statement. The
1719 idea is to skip over anything that might be inside a SECTIONS {}
1720 statement in a script, before we find another output section
1721 statement. Assignments to "dot" before an output section statement
1722 are assumed to belong to it, except in two cases; The first
1723 assignment to dot, and assignments before non-alloc sections.
1724 Otherwise we might put an orphan before . = . + SIZEOF_HEADERS or
1725 similar assignments that set the initial address, or we might
1726 insert non-alloc note sections among assignments setting end of
1729 static lang_statement_union_type **
1730 insert_os_after (lang_output_section_statement_type *after)
1732 lang_statement_union_type **where;
1733 lang_statement_union_type **assign = NULL;
1734 bfd_boolean ignore_first;
1737 = after == &lang_output_section_statement.head->output_section_statement;
1739 for (where = &after->header.next;
1741 where = &(*where)->header.next)
1743 switch ((*where)->header.type)
1745 case lang_assignment_statement_enum:
1748 lang_assignment_statement_type *ass;
1750 ass = &(*where)->assignment_statement;
1751 if (ass->exp->type.node_class != etree_assert
1752 && ass->exp->assign.dst[0] == '.'
1753 && ass->exp->assign.dst[1] == 0
1757 ignore_first = FALSE;
1759 case lang_wild_statement_enum:
1760 case lang_input_section_enum:
1761 case lang_object_symbols_statement_enum:
1762 case lang_fill_statement_enum:
1763 case lang_data_statement_enum:
1764 case lang_reloc_statement_enum:
1765 case lang_padding_statement_enum:
1766 case lang_constructors_statement_enum:
1769 case lang_output_section_statement_enum:
1772 asection *s = (*where)->output_section_statement.bfd_section;
1775 || s->map_head.s == NULL
1776 || (s->flags & SEC_ALLOC) != 0)
1780 case lang_input_statement_enum:
1781 case lang_address_statement_enum:
1782 case lang_target_statement_enum:
1783 case lang_output_statement_enum:
1784 case lang_group_statement_enum:
1785 case lang_insert_statement_enum:
1794 lang_output_section_statement_type *
1795 lang_insert_orphan (asection *s,
1796 const char *secname,
1798 lang_output_section_statement_type *after,
1799 struct orphan_save *place,
1800 etree_type *address,
1801 lang_statement_list_type *add_child)
1803 lang_statement_list_type add;
1805 lang_output_section_statement_type *os;
1806 lang_output_section_statement_type **os_tail;
1808 /* If we have found an appropriate place for the output section
1809 statements for this orphan, add them to our own private list,
1810 inserting them later into the global statement list. */
1813 lang_list_init (&add);
1814 push_stat_ptr (&add);
1817 if (link_info.relocatable || (s->flags & (SEC_LOAD | SEC_ALLOC)) == 0)
1818 address = exp_intop (0);
1820 os_tail = ((lang_output_section_statement_type **)
1821 lang_output_section_statement.tail);
1822 os = lang_enter_output_section_statement (secname, address, normal_section,
1823 NULL, NULL, NULL, constraint, 0);
1826 if (config.build_constructors && *os_tail == os)
1828 /* If the name of the section is representable in C, then create
1829 symbols to mark the start and the end of the section. */
1830 for (ps = secname; *ps != '\0'; ps++)
1831 if (! ISALNUM ((unsigned char) *ps) && *ps != '_')
1837 symname = (char *) xmalloc (ps - secname + sizeof "__start_" + 1);
1838 symname[0] = bfd_get_symbol_leading_char (link_info.output_bfd);
1839 sprintf (symname + (symname[0] != 0), "__start_%s", secname);
1840 lang_add_assignment (exp_provide (symname,
1841 exp_nameop (NAME, "."),
1846 if (add_child == NULL)
1847 add_child = &os->children;
1848 lang_add_section (add_child, s, NULL, os);
1850 if (after && (s->flags & (SEC_LOAD | SEC_ALLOC)) != 0)
1852 const char *region = (after->region
1853 ? after->region->name_list.name
1854 : DEFAULT_MEMORY_REGION);
1855 const char *lma_region = (after->lma_region
1856 ? after->lma_region->name_list.name
1858 lang_leave_output_section_statement (NULL, region, after->phdrs,
1862 lang_leave_output_section_statement (NULL, DEFAULT_MEMORY_REGION, NULL,
1865 if (ps != NULL && *ps == '\0')
1869 symname = (char *) xmalloc (ps - secname + sizeof "__stop_" + 1);
1870 symname[0] = bfd_get_symbol_leading_char (link_info.output_bfd);
1871 sprintf (symname + (symname[0] != 0), "__stop_%s", secname);
1872 lang_add_assignment (exp_provide (symname,
1873 exp_nameop (NAME, "."),
1877 /* Restore the global list pointer. */
1881 if (after != NULL && os->bfd_section != NULL)
1883 asection *snew, *as;
1885 snew = os->bfd_section;
1887 /* Shuffle the bfd section list to make the output file look
1888 neater. This is really only cosmetic. */
1889 if (place->section == NULL
1890 && after != (&lang_output_section_statement.head
1891 ->output_section_statement))
1893 asection *bfd_section = after->bfd_section;
1895 /* If the output statement hasn't been used to place any input
1896 sections (and thus doesn't have an output bfd_section),
1897 look for the closest prior output statement having an
1899 if (bfd_section == NULL)
1900 bfd_section = output_prev_sec_find (after);
1902 if (bfd_section != NULL && bfd_section != snew)
1903 place->section = &bfd_section->next;
1906 if (place->section == NULL)
1907 place->section = &link_info.output_bfd->sections;
1909 as = *place->section;
1913 /* Put the section at the end of the list. */
1915 /* Unlink the section. */
1916 bfd_section_list_remove (link_info.output_bfd, snew);
1918 /* Now tack it back on in the right place. */
1919 bfd_section_list_append (link_info.output_bfd, snew);
1921 else if (as != snew && as->prev != snew)
1923 /* Unlink the section. */
1924 bfd_section_list_remove (link_info.output_bfd, snew);
1926 /* Now tack it back on in the right place. */
1927 bfd_section_list_insert_before (link_info.output_bfd, as, snew);
1930 /* Save the end of this list. Further ophans of this type will
1931 follow the one we've just added. */
1932 place->section = &snew->next;
1934 /* The following is non-cosmetic. We try to put the output
1935 statements in some sort of reasonable order here, because they
1936 determine the final load addresses of the orphan sections.
1937 In addition, placing output statements in the wrong order may
1938 require extra segments. For instance, given a typical
1939 situation of all read-only sections placed in one segment and
1940 following that a segment containing all the read-write
1941 sections, we wouldn't want to place an orphan read/write
1942 section before or amongst the read-only ones. */
1943 if (add.head != NULL)
1945 lang_output_section_statement_type *newly_added_os;
1947 if (place->stmt == NULL)
1949 lang_statement_union_type **where = insert_os_after (after);
1954 place->os_tail = &after->next;
1958 /* Put it after the last orphan statement we added. */
1959 *add.tail = *place->stmt;
1960 *place->stmt = add.head;
1963 /* Fix the global list pointer if we happened to tack our
1964 new list at the tail. */
1965 if (*stat_ptr->tail == add.head)
1966 stat_ptr->tail = add.tail;
1968 /* Save the end of this list. */
1969 place->stmt = add.tail;
1971 /* Do the same for the list of output section statements. */
1972 newly_added_os = *os_tail;
1974 newly_added_os->prev = (lang_output_section_statement_type *)
1975 ((char *) place->os_tail
1976 - offsetof (lang_output_section_statement_type, next));
1977 newly_added_os->next = *place->os_tail;
1978 if (newly_added_os->next != NULL)
1979 newly_added_os->next->prev = newly_added_os;
1980 *place->os_tail = newly_added_os;
1981 place->os_tail = &newly_added_os->next;
1983 /* Fixing the global list pointer here is a little different.
1984 We added to the list in lang_enter_output_section_statement,
1985 trimmed off the new output_section_statment above when
1986 assigning *os_tail = NULL, but possibly added it back in
1987 the same place when assigning *place->os_tail. */
1988 if (*os_tail == NULL)
1989 lang_output_section_statement.tail
1990 = (lang_statement_union_type **) os_tail;
1997 lang_print_asneeded (void)
1999 struct asneeded_minfo *m;
2002 if (asneeded_list_head == NULL)
2005 sprintf (buf, _("\nAs-needed library included "
2006 "to satisfy reference by file (symbol)\n\n"));
2009 for (m = asneeded_list_head; m != NULL; m = m->next)
2013 minfo ("%s", m->soname);
2014 len = strlen (m->soname);
2028 minfo ("%B ", m->ref);
2029 minfo ("(%T)\n", m->name);
2034 lang_map_flags (flagword flag)
2036 if (flag & SEC_ALLOC)
2039 if (flag & SEC_CODE)
2042 if (flag & SEC_READONLY)
2045 if (flag & SEC_DATA)
2048 if (flag & SEC_LOAD)
2055 lang_memory_region_type *m;
2056 bfd_boolean dis_header_printed = FALSE;
2058 LANG_FOR_EACH_INPUT_STATEMENT (file)
2062 if ((file->the_bfd->flags & (BFD_LINKER_CREATED | DYNAMIC)) != 0
2063 || file->flags.just_syms)
2066 for (s = file->the_bfd->sections; s != NULL; s = s->next)
2067 if ((s->output_section == NULL
2068 || s->output_section->owner != link_info.output_bfd)
2069 && (s->flags & (SEC_LINKER_CREATED | SEC_KEEP)) == 0)
2071 if (! dis_header_printed)
2073 fprintf (config.map_file, _("\nDiscarded input sections\n\n"));
2074 dis_header_printed = TRUE;
2077 print_input_section (s, TRUE);
2081 minfo (_("\nMemory Configuration\n\n"));
2082 fprintf (config.map_file, "%-16s %-18s %-18s %s\n",
2083 _("Name"), _("Origin"), _("Length"), _("Attributes"));
2085 for (m = lang_memory_region_list; m != NULL; m = m->next)
2090 fprintf (config.map_file, "%-16s ", m->name_list.name);
2092 sprintf_vma (buf, m->origin);
2093 minfo ("0x%s ", buf);
2101 minfo ("0x%V", m->length);
2102 if (m->flags || m->not_flags)
2110 lang_map_flags (m->flags);
2116 lang_map_flags (m->not_flags);
2123 fprintf (config.map_file, _("\nLinker script and memory map\n\n"));
2125 if (! link_info.reduce_memory_overheads)
2127 obstack_begin (&map_obstack, 1000);
2128 bfd_link_hash_traverse (link_info.hash, sort_def_symbol, 0);
2130 lang_statement_iteration++;
2131 print_statements ();
2133 ldemul_extra_map_file_text (link_info.output_bfd, &link_info, config.map_file);
2137 sort_def_symbol (struct bfd_link_hash_entry *hash_entry,
2138 void *info ATTRIBUTE_UNUSED)
2140 if ((hash_entry->type == bfd_link_hash_defined
2141 || hash_entry->type == bfd_link_hash_defweak)
2142 && hash_entry->u.def.section->owner != link_info.output_bfd
2143 && hash_entry->u.def.section->owner != NULL)
2145 input_section_userdata_type *ud;
2146 struct map_symbol_def *def;
2148 ud = ((input_section_userdata_type *)
2149 get_userdata (hash_entry->u.def.section));
2152 ud = (input_section_userdata_type *) stat_alloc (sizeof (*ud));
2153 get_userdata (hash_entry->u.def.section) = ud;
2154 ud->map_symbol_def_tail = &ud->map_symbol_def_head;
2155 ud->map_symbol_def_count = 0;
2157 else if (!ud->map_symbol_def_tail)
2158 ud->map_symbol_def_tail = &ud->map_symbol_def_head;
2160 def = (struct map_symbol_def *) obstack_alloc (&map_obstack, sizeof *def);
2161 def->entry = hash_entry;
2162 *(ud->map_symbol_def_tail) = def;
2163 ud->map_symbol_def_tail = &def->next;
2164 ud->map_symbol_def_count++;
2169 /* Initialize an output section. */
2172 init_os (lang_output_section_statement_type *s, flagword flags)
2174 if (strcmp (s->name, DISCARD_SECTION_NAME) == 0)
2175 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME);
2177 if (s->constraint != SPECIAL)
2178 s->bfd_section = bfd_get_section_by_name (link_info.output_bfd, s->name);
2179 if (s->bfd_section == NULL)
2180 s->bfd_section = bfd_make_section_anyway_with_flags (link_info.output_bfd,
2182 if (s->bfd_section == NULL)
2184 einfo (_("%P%F: output format %s cannot represent section called %s\n"),
2185 link_info.output_bfd->xvec->name, s->name);
2187 s->bfd_section->output_section = s->bfd_section;
2188 s->bfd_section->output_offset = 0;
2190 /* Set the userdata of the output section to the output section
2191 statement to avoid lookup. */
2192 get_userdata (s->bfd_section) = s;
2194 /* If there is a base address, make sure that any sections it might
2195 mention are initialized. */
2196 if (s->addr_tree != NULL)
2197 exp_init_os (s->addr_tree);
2199 if (s->load_base != NULL)
2200 exp_init_os (s->load_base);
2202 /* If supplied an alignment, set it. */
2203 if (s->section_alignment != -1)
2204 s->bfd_section->alignment_power = s->section_alignment;
2207 /* Make sure that all output sections mentioned in an expression are
2211 exp_init_os (etree_type *exp)
2213 switch (exp->type.node_class)
2217 exp_init_os (exp->assign.src);
2221 exp_init_os (exp->binary.lhs);
2222 exp_init_os (exp->binary.rhs);
2226 exp_init_os (exp->trinary.cond);
2227 exp_init_os (exp->trinary.lhs);
2228 exp_init_os (exp->trinary.rhs);
2232 exp_init_os (exp->assert_s.child);
2236 exp_init_os (exp->unary.child);
2240 switch (exp->type.node_code)
2246 lang_output_section_statement_type *os;
2248 os = lang_output_section_find (exp->name.name);
2249 if (os != NULL && os->bfd_section == NULL)
2261 section_already_linked (bfd *abfd, asection *sec, void *data)
2263 lang_input_statement_type *entry = (lang_input_statement_type *) data;
2265 /* If we are only reading symbols from this object, then we want to
2266 discard all sections. */
2267 if (entry->flags.just_syms)
2269 bfd_link_just_syms (abfd, sec, &link_info);
2273 if (!(abfd->flags & DYNAMIC))
2274 bfd_section_already_linked (abfd, sec, &link_info);
2277 /* The wild routines.
2279 These expand statements like *(.text) and foo.o to a list of
2280 explicit actions, like foo.o(.text), bar.o(.text) and
2281 foo.o(.text, .data). */
2283 /* Add SECTION to the output section OUTPUT. Do this by creating a
2284 lang_input_section statement which is placed at PTR. */
2287 lang_add_section (lang_statement_list_type *ptr,
2289 struct flag_info *sflag_info,
2290 lang_output_section_statement_type *output)
2292 flagword flags = section->flags;
2294 bfd_boolean discard;
2295 lang_input_section_type *new_section;
2296 bfd *abfd = link_info.output_bfd;
2298 /* Discard sections marked with SEC_EXCLUDE. */
2299 discard = (flags & SEC_EXCLUDE) != 0;
2301 /* Discard input sections which are assigned to a section named
2302 DISCARD_SECTION_NAME. */
2303 if (strcmp (output->name, DISCARD_SECTION_NAME) == 0)
2306 /* Discard debugging sections if we are stripping debugging
2308 if ((link_info.strip == strip_debugger || link_info.strip == strip_all)
2309 && (flags & SEC_DEBUGGING) != 0)
2314 if (section->output_section == NULL)
2316 /* This prevents future calls from assigning this section. */
2317 section->output_section = bfd_abs_section_ptr;
2326 keep = bfd_lookup_section_flags (&link_info, sflag_info, section);
2331 if (section->output_section != NULL)
2334 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2335 to an output section, because we want to be able to include a
2336 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2337 section (I don't know why we want to do this, but we do).
2338 build_link_order in ldwrite.c handles this case by turning
2339 the embedded SEC_NEVER_LOAD section into a fill. */
2340 flags &= ~ SEC_NEVER_LOAD;
2342 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2343 already been processed. One reason to do this is that on pe
2344 format targets, .text$foo sections go into .text and it's odd
2345 to see .text with SEC_LINK_ONCE set. */
2347 if (!link_info.relocatable)
2348 flags &= ~(SEC_LINK_ONCE | SEC_LINK_DUPLICATES | SEC_RELOC);
2350 switch (output->sectype)
2352 case normal_section:
2353 case overlay_section:
2355 case noalloc_section:
2356 flags &= ~SEC_ALLOC;
2358 case noload_section:
2360 flags |= SEC_NEVER_LOAD;
2361 /* Unfortunately GNU ld has managed to evolve two different
2362 meanings to NOLOAD in scripts. ELF gets a .bss style noload,
2363 alloc, no contents section. All others get a noload, noalloc
2365 if (bfd_get_flavour (link_info.output_bfd) == bfd_target_elf_flavour)
2366 flags &= ~SEC_HAS_CONTENTS;
2368 flags &= ~SEC_ALLOC;
2372 if (output->bfd_section == NULL)
2373 init_os (output, flags);
2375 /* If SEC_READONLY is not set in the input section, then clear
2376 it from the output section. */
2377 output->bfd_section->flags &= flags | ~SEC_READONLY;
2379 if (output->bfd_section->linker_has_input)
2381 /* Only set SEC_READONLY flag on the first input section. */
2382 flags &= ~ SEC_READONLY;
2384 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2385 if ((output->bfd_section->flags & (SEC_MERGE | SEC_STRINGS))
2386 != (flags & (SEC_MERGE | SEC_STRINGS))
2387 || ((flags & SEC_MERGE) != 0
2388 && output->bfd_section->entsize != section->entsize))
2390 output->bfd_section->flags &= ~ (SEC_MERGE | SEC_STRINGS);
2391 flags &= ~ (SEC_MERGE | SEC_STRINGS);
2394 output->bfd_section->flags |= flags;
2396 if (!output->bfd_section->linker_has_input)
2398 output->bfd_section->linker_has_input = 1;
2399 /* This must happen after flags have been updated. The output
2400 section may have been created before we saw its first input
2401 section, eg. for a data statement. */
2402 bfd_init_private_section_data (section->owner, section,
2403 link_info.output_bfd,
2404 output->bfd_section,
2406 if ((flags & SEC_MERGE) != 0)
2407 output->bfd_section->entsize = section->entsize;
2410 if ((flags & SEC_TIC54X_BLOCK) != 0
2411 && bfd_get_arch (section->owner) == bfd_arch_tic54x)
2413 /* FIXME: This value should really be obtained from the bfd... */
2414 output->block_value = 128;
2417 if (section->alignment_power > output->bfd_section->alignment_power)
2418 output->bfd_section->alignment_power = section->alignment_power;
2420 section->output_section = output->bfd_section;
2422 if (!map_head_is_link_order)
2424 asection *s = output->bfd_section->map_tail.s;
2425 output->bfd_section->map_tail.s = section;
2426 section->map_head.s = NULL;
2427 section->map_tail.s = s;
2429 s->map_head.s = section;
2431 output->bfd_section->map_head.s = section;
2434 /* Add a section reference to the list. */
2435 new_section = new_stat (lang_input_section, ptr);
2436 new_section->section = section;
2439 /* Handle wildcard sorting. This returns the lang_input_section which
2440 should follow the one we are going to create for SECTION and FILE,
2441 based on the sorting requirements of WILD. It returns NULL if the
2442 new section should just go at the end of the current list. */
2444 static lang_statement_union_type *
2445 wild_sort (lang_wild_statement_type *wild,
2446 struct wildcard_list *sec,
2447 lang_input_statement_type *file,
2450 lang_statement_union_type *l;
2452 if (!wild->filenames_sorted
2453 && (sec == NULL || sec->spec.sorted == none))
2456 for (l = wild->children.head; l != NULL; l = l->header.next)
2458 lang_input_section_type *ls;
2460 if (l->header.type != lang_input_section_enum)
2462 ls = &l->input_section;
2464 /* Sorting by filename takes precedence over sorting by section
2467 if (wild->filenames_sorted)
2469 const char *fn, *ln;
2473 /* The PE support for the .idata section as generated by
2474 dlltool assumes that files will be sorted by the name of
2475 the archive and then the name of the file within the
2478 if (file->the_bfd != NULL
2479 && bfd_my_archive (file->the_bfd) != NULL)
2481 fn = bfd_get_filename (bfd_my_archive (file->the_bfd));
2486 fn = file->filename;
2490 if (bfd_my_archive (ls->section->owner) != NULL)
2492 ln = bfd_get_filename (bfd_my_archive (ls->section->owner));
2497 ln = ls->section->owner->filename;
2501 i = filename_cmp (fn, ln);
2510 fn = file->filename;
2512 ln = ls->section->owner->filename;
2514 i = filename_cmp (fn, ln);
2522 /* Here either the files are not sorted by name, or we are
2523 looking at the sections for this file. */
2526 && sec->spec.sorted != none
2527 && sec->spec.sorted != by_none)
2528 if (compare_section (sec->spec.sorted, section, ls->section) < 0)
2535 /* Expand a wild statement for a particular FILE. SECTION may be
2536 NULL, in which case it is a wild card. */
2539 output_section_callback (lang_wild_statement_type *ptr,
2540 struct wildcard_list *sec,
2542 struct flag_info *sflag_info,
2543 lang_input_statement_type *file,
2546 lang_statement_union_type *before;
2547 lang_output_section_statement_type *os;
2549 os = (lang_output_section_statement_type *) output;
2551 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2552 if (unique_section_p (section, os))
2555 before = wild_sort (ptr, sec, file, section);
2557 /* Here BEFORE points to the lang_input_section which
2558 should follow the one we are about to add. If BEFORE
2559 is NULL, then the section should just go at the end
2560 of the current list. */
2563 lang_add_section (&ptr->children, section, sflag_info, os);
2566 lang_statement_list_type list;
2567 lang_statement_union_type **pp;
2569 lang_list_init (&list);
2570 lang_add_section (&list, section, sflag_info, os);
2572 /* If we are discarding the section, LIST.HEAD will
2574 if (list.head != NULL)
2576 ASSERT (list.head->header.next == NULL);
2578 for (pp = &ptr->children.head;
2580 pp = &(*pp)->header.next)
2581 ASSERT (*pp != NULL);
2583 list.head->header.next = *pp;
2589 /* Check if all sections in a wild statement for a particular FILE
2593 check_section_callback (lang_wild_statement_type *ptr ATTRIBUTE_UNUSED,
2594 struct wildcard_list *sec ATTRIBUTE_UNUSED,
2596 struct flag_info *sflag_info ATTRIBUTE_UNUSED,
2597 lang_input_statement_type *file ATTRIBUTE_UNUSED,
2600 lang_output_section_statement_type *os;
2602 os = (lang_output_section_statement_type *) output;
2604 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2605 if (unique_section_p (section, os))
2608 if (section->output_section == NULL && (section->flags & SEC_READONLY) == 0)
2609 os->all_input_readonly = FALSE;
2612 /* This is passed a file name which must have been seen already and
2613 added to the statement tree. We will see if it has been opened
2614 already and had its symbols read. If not then we'll read it. */
2616 static lang_input_statement_type *
2617 lookup_name (const char *name)
2619 lang_input_statement_type *search;
2621 for (search = (lang_input_statement_type *) input_file_chain.head;
2623 search = (lang_input_statement_type *) search->next_real_file)
2625 /* Use the local_sym_name as the name of the file that has
2626 already been loaded as filename might have been transformed
2627 via the search directory lookup mechanism. */
2628 const char *filename = search->local_sym_name;
2630 if (filename != NULL
2631 && filename_cmp (filename, name) == 0)
2636 search = new_afile (name, lang_input_file_is_search_file_enum,
2637 default_target, FALSE);
2639 /* If we have already added this file, or this file is not real
2640 don't add this file. */
2641 if (search->flags.loaded || !search->flags.real)
2644 if (! load_symbols (search, NULL))
2650 /* Save LIST as a list of libraries whose symbols should not be exported. */
2655 struct excluded_lib *next;
2657 static struct excluded_lib *excluded_libs;
2660 add_excluded_libs (const char *list)
2662 const char *p = list, *end;
2666 struct excluded_lib *entry;
2667 end = strpbrk (p, ",:");
2669 end = p + strlen (p);
2670 entry = (struct excluded_lib *) xmalloc (sizeof (*entry));
2671 entry->next = excluded_libs;
2672 entry->name = (char *) xmalloc (end - p + 1);
2673 memcpy (entry->name, p, end - p);
2674 entry->name[end - p] = '\0';
2675 excluded_libs = entry;
2683 check_excluded_libs (bfd *abfd)
2685 struct excluded_lib *lib = excluded_libs;
2689 int len = strlen (lib->name);
2690 const char *filename = lbasename (abfd->filename);
2692 if (strcmp (lib->name, "ALL") == 0)
2694 abfd->no_export = TRUE;
2698 if (filename_ncmp (lib->name, filename, len) == 0
2699 && (filename[len] == '\0'
2700 || (filename[len] == '.' && filename[len + 1] == 'a'
2701 && filename[len + 2] == '\0')))
2703 abfd->no_export = TRUE;
2711 /* Get the symbols for an input file. */
2714 load_symbols (lang_input_statement_type *entry,
2715 lang_statement_list_type *place)
2719 if (entry->flags.loaded)
2722 ldfile_open_file (entry);
2724 /* Do not process further if the file was missing. */
2725 if (entry->flags.missing_file)
2728 if (! bfd_check_format (entry->the_bfd, bfd_archive)
2729 && ! bfd_check_format_matches (entry->the_bfd, bfd_object, &matching))
2732 struct lang_input_statement_flags save_flags;
2735 err = bfd_get_error ();
2737 /* See if the emulation has some special knowledge. */
2738 if (ldemul_unrecognized_file (entry))
2741 if (err == bfd_error_file_ambiguously_recognized)
2745 einfo (_("%B: file not recognized: %E\n"), entry->the_bfd);
2746 einfo (_("%B: matching formats:"), entry->the_bfd);
2747 for (p = matching; *p != NULL; p++)
2751 else if (err != bfd_error_file_not_recognized
2753 einfo (_("%F%B: file not recognized: %E\n"), entry->the_bfd);
2755 bfd_close (entry->the_bfd);
2756 entry->the_bfd = NULL;
2758 /* Try to interpret the file as a linker script. */
2759 save_flags = input_flags;
2760 ldfile_open_command_file (entry->filename);
2762 push_stat_ptr (place);
2763 input_flags.add_DT_NEEDED_for_regular
2764 = entry->flags.add_DT_NEEDED_for_regular;
2765 input_flags.add_DT_NEEDED_for_dynamic
2766 = entry->flags.add_DT_NEEDED_for_dynamic;
2767 input_flags.whole_archive = entry->flags.whole_archive;
2768 input_flags.dynamic = entry->flags.dynamic;
2770 ldfile_assumed_script = TRUE;
2771 parser_input = input_script;
2773 ldfile_assumed_script = FALSE;
2775 /* missing_file is sticky. sysrooted will already have been
2776 restored when seeing EOF in yyparse, but no harm to restore
2778 save_flags.missing_file |= input_flags.missing_file;
2779 input_flags = save_flags;
2783 entry->flags.loaded = TRUE;
2788 if (ldemul_recognized_file (entry))
2791 /* We don't call ldlang_add_file for an archive. Instead, the
2792 add_symbols entry point will call ldlang_add_file, via the
2793 add_archive_element callback, for each element of the archive
2795 switch (bfd_get_format (entry->the_bfd))
2801 if (!entry->flags.reload)
2802 ldlang_add_file (entry);
2803 if (trace_files || verbose)
2804 info_msg ("%I\n", entry);
2808 check_excluded_libs (entry->the_bfd);
2810 if (entry->flags.whole_archive)
2813 bfd_boolean loaded = TRUE;
2818 member = bfd_openr_next_archived_file (entry->the_bfd, member);
2823 if (! bfd_check_format (member, bfd_object))
2825 einfo (_("%F%B: member %B in archive is not an object\n"),
2826 entry->the_bfd, member);
2831 if (!(*link_info.callbacks
2832 ->add_archive_element) (&link_info, member,
2833 "--whole-archive", &subsbfd))
2836 /* Potentially, the add_archive_element hook may have set a
2837 substitute BFD for us. */
2838 if (!bfd_link_add_symbols (subsbfd, &link_info))
2840 einfo (_("%F%B: error adding symbols: %E\n"), member);
2845 entry->flags.loaded = loaded;
2851 if (bfd_link_add_symbols (entry->the_bfd, &link_info))
2852 entry->flags.loaded = TRUE;
2854 einfo (_("%F%B: error adding symbols: %E\n"), entry->the_bfd);
2856 return entry->flags.loaded;
2859 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2860 may be NULL, indicating that it is a wildcard. Separate
2861 lang_input_section statements are created for each part of the
2862 expansion; they are added after the wild statement S. OUTPUT is
2863 the output section. */
2866 wild (lang_wild_statement_type *s,
2867 const char *target ATTRIBUTE_UNUSED,
2868 lang_output_section_statement_type *output)
2870 struct wildcard_list *sec;
2872 if (s->handler_data[0]
2873 && s->handler_data[0]->spec.sorted == by_name
2874 && !s->filenames_sorted)
2876 lang_section_bst_type *tree;
2878 walk_wild (s, output_section_callback_fast, output);
2883 output_section_callback_tree_to_list (s, tree, output);
2888 walk_wild (s, output_section_callback, output);
2890 if (default_common_section == NULL)
2891 for (sec = s->section_list; sec != NULL; sec = sec->next)
2892 if (sec->spec.name != NULL && strcmp (sec->spec.name, "COMMON") == 0)
2894 /* Remember the section that common is going to in case we
2895 later get something which doesn't know where to put it. */
2896 default_common_section = output;
2901 /* Return TRUE iff target is the sought target. */
2904 get_target (const bfd_target *target, void *data)
2906 const char *sought = (const char *) data;
2908 return strcmp (target->name, sought) == 0;
2911 /* Like strcpy() but convert to lower case as well. */
2914 stricpy (char *dest, char *src)
2918 while ((c = *src++) != 0)
2919 *dest++ = TOLOWER (c);
2924 /* Remove the first occurrence of needle (if any) in haystack
2928 strcut (char *haystack, char *needle)
2930 haystack = strstr (haystack, needle);
2936 for (src = haystack + strlen (needle); *src;)
2937 *haystack++ = *src++;
2943 /* Compare two target format name strings.
2944 Return a value indicating how "similar" they are. */
2947 name_compare (char *first, char *second)
2953 copy1 = (char *) xmalloc (strlen (first) + 1);
2954 copy2 = (char *) xmalloc (strlen (second) + 1);
2956 /* Convert the names to lower case. */
2957 stricpy (copy1, first);
2958 stricpy (copy2, second);
2960 /* Remove size and endian strings from the name. */
2961 strcut (copy1, "big");
2962 strcut (copy1, "little");
2963 strcut (copy2, "big");
2964 strcut (copy2, "little");
2966 /* Return a value based on how many characters match,
2967 starting from the beginning. If both strings are
2968 the same then return 10 * their length. */
2969 for (result = 0; copy1[result] == copy2[result]; result++)
2970 if (copy1[result] == 0)
2982 /* Set by closest_target_match() below. */
2983 static const bfd_target *winner;
2985 /* Scan all the valid bfd targets looking for one that has the endianness
2986 requirement that was specified on the command line, and is the nearest
2987 match to the original output target. */
2990 closest_target_match (const bfd_target *target, void *data)
2992 const bfd_target *original = (const bfd_target *) data;
2994 if (command_line.endian == ENDIAN_BIG
2995 && target->byteorder != BFD_ENDIAN_BIG)
2998 if (command_line.endian == ENDIAN_LITTLE
2999 && target->byteorder != BFD_ENDIAN_LITTLE)
3002 /* Must be the same flavour. */
3003 if (target->flavour != original->flavour)
3006 /* Ignore generic big and little endian elf vectors. */
3007 if (strcmp (target->name, "elf32-big") == 0
3008 || strcmp (target->name, "elf64-big") == 0
3009 || strcmp (target->name, "elf32-little") == 0
3010 || strcmp (target->name, "elf64-little") == 0)
3013 /* If we have not found a potential winner yet, then record this one. */
3020 /* Oh dear, we now have two potential candidates for a successful match.
3021 Compare their names and choose the better one. */
3022 if (name_compare (target->name, original->name)
3023 > name_compare (winner->name, original->name))
3026 /* Keep on searching until wqe have checked them all. */
3030 /* Return the BFD target format of the first input file. */
3033 get_first_input_target (void)
3035 char *target = NULL;
3037 LANG_FOR_EACH_INPUT_STATEMENT (s)
3039 if (s->header.type == lang_input_statement_enum
3042 ldfile_open_file (s);
3044 if (s->the_bfd != NULL
3045 && bfd_check_format (s->the_bfd, bfd_object))
3047 target = bfd_get_target (s->the_bfd);
3059 lang_get_output_target (void)
3063 /* Has the user told us which output format to use? */
3064 if (output_target != NULL)
3065 return output_target;
3067 /* No - has the current target been set to something other than
3069 if (current_target != default_target && current_target != NULL)
3070 return current_target;
3072 /* No - can we determine the format of the first input file? */
3073 target = get_first_input_target ();
3077 /* Failed - use the default output target. */
3078 return default_target;
3081 /* Open the output file. */
3084 open_output (const char *name)
3086 output_target = lang_get_output_target ();
3088 /* Has the user requested a particular endianness on the command
3090 if (command_line.endian != ENDIAN_UNSET)
3092 const bfd_target *target;
3093 enum bfd_endian desired_endian;
3095 /* Get the chosen target. */
3096 target = bfd_search_for_target (get_target, (void *) output_target);
3098 /* If the target is not supported, we cannot do anything. */
3101 if (command_line.endian == ENDIAN_BIG)
3102 desired_endian = BFD_ENDIAN_BIG;
3104 desired_endian = BFD_ENDIAN_LITTLE;
3106 /* See if the target has the wrong endianness. This should
3107 not happen if the linker script has provided big and
3108 little endian alternatives, but some scrips don't do
3110 if (target->byteorder != desired_endian)
3112 /* If it does, then see if the target provides
3113 an alternative with the correct endianness. */
3114 if (target->alternative_target != NULL
3115 && (target->alternative_target->byteorder == desired_endian))
3116 output_target = target->alternative_target->name;
3119 /* Try to find a target as similar as possible to
3120 the default target, but which has the desired
3121 endian characteristic. */
3122 bfd_search_for_target (closest_target_match,
3125 /* Oh dear - we could not find any targets that
3126 satisfy our requirements. */
3128 einfo (_("%P: warning: could not find any targets"
3129 " that match endianness requirement\n"));
3131 output_target = winner->name;
3137 link_info.output_bfd = bfd_openw (name, output_target);
3139 if (link_info.output_bfd == NULL)
3141 if (bfd_get_error () == bfd_error_invalid_target)
3142 einfo (_("%P%F: target %s not found\n"), output_target);
3144 einfo (_("%P%F: cannot open output file %s: %E\n"), name);
3147 delete_output_file_on_failure = TRUE;
3149 if (! bfd_set_format (link_info.output_bfd, bfd_object))
3150 einfo (_("%P%F:%s: can not make object file: %E\n"), name);
3151 if (! bfd_set_arch_mach (link_info.output_bfd,
3152 ldfile_output_architecture,
3153 ldfile_output_machine))
3154 einfo (_("%P%F:%s: can not set architecture: %E\n"), name);
3156 link_info.hash = bfd_link_hash_table_create (link_info.output_bfd);
3157 if (link_info.hash == NULL)
3158 einfo (_("%P%F: can not create hash table: %E\n"));
3160 bfd_set_gp_size (link_info.output_bfd, g_switch_value);
3164 ldlang_open_output (lang_statement_union_type *statement)
3166 switch (statement->header.type)
3168 case lang_output_statement_enum:
3169 ASSERT (link_info.output_bfd == NULL);
3170 open_output (statement->output_statement.name);
3171 ldemul_set_output_arch ();
3172 if (config.magic_demand_paged && !link_info.relocatable)
3173 link_info.output_bfd->flags |= D_PAGED;
3175 link_info.output_bfd->flags &= ~D_PAGED;
3176 if (config.text_read_only)
3177 link_info.output_bfd->flags |= WP_TEXT;
3179 link_info.output_bfd->flags &= ~WP_TEXT;
3180 if (link_info.traditional_format)
3181 link_info.output_bfd->flags |= BFD_TRADITIONAL_FORMAT;
3183 link_info.output_bfd->flags &= ~BFD_TRADITIONAL_FORMAT;
3186 case lang_target_statement_enum:
3187 current_target = statement->target_statement.target;
3194 /* Convert between addresses in bytes and sizes in octets.
3195 For currently supported targets, octets_per_byte is always a power
3196 of two, so we can use shifts. */
3197 #define TO_ADDR(X) ((X) >> opb_shift)
3198 #define TO_SIZE(X) ((X) << opb_shift)
3200 /* Support the above. */
3201 static unsigned int opb_shift = 0;
3206 unsigned x = bfd_arch_mach_octets_per_byte (ldfile_output_architecture,
3207 ldfile_output_machine);
3210 while ((x & 1) == 0)
3218 /* Open all the input files. */
3222 OPEN_BFD_NORMAL = 0,
3226 #ifdef ENABLE_PLUGINS
3227 static lang_input_statement_type *plugin_insert = NULL;
3231 open_input_bfds (lang_statement_union_type *s, enum open_bfd_mode mode)
3233 for (; s != NULL; s = s->header.next)
3235 switch (s->header.type)
3237 case lang_constructors_statement_enum:
3238 open_input_bfds (constructor_list.head, mode);
3240 case lang_output_section_statement_enum:
3241 open_input_bfds (s->output_section_statement.children.head, mode);
3243 case lang_wild_statement_enum:
3244 /* Maybe we should load the file's symbols. */
3245 if ((mode & OPEN_BFD_RESCAN) == 0
3246 && s->wild_statement.filename
3247 && !wildcardp (s->wild_statement.filename)
3248 && !archive_path (s->wild_statement.filename))
3249 lookup_name (s->wild_statement.filename);
3250 open_input_bfds (s->wild_statement.children.head, mode);
3252 case lang_group_statement_enum:
3254 struct bfd_link_hash_entry *undefs;
3256 /* We must continually search the entries in the group
3257 until no new symbols are added to the list of undefined
3262 undefs = link_info.hash->undefs_tail;
3263 open_input_bfds (s->group_statement.children.head,
3264 mode | OPEN_BFD_FORCE);
3266 while (undefs != link_info.hash->undefs_tail);
3269 case lang_target_statement_enum:
3270 current_target = s->target_statement.target;
3272 case lang_input_statement_enum:
3273 if (s->input_statement.flags.real)
3275 lang_statement_union_type **os_tail;
3276 lang_statement_list_type add;
3279 s->input_statement.target = current_target;
3281 /* If we are being called from within a group, and this
3282 is an archive which has already been searched, then
3283 force it to be researched unless the whole archive
3284 has been loaded already. Do the same for a rescan.
3285 Likewise reload --as-needed shared libs. */
3286 if (mode != OPEN_BFD_NORMAL
3287 #ifdef ENABLE_PLUGINS
3288 && ((mode & OPEN_BFD_RESCAN) == 0
3289 || plugin_insert == NULL)
3291 && s->input_statement.flags.loaded
3292 && (abfd = s->input_statement.the_bfd) != NULL
3293 && ((bfd_get_format (abfd) == bfd_archive
3294 && !s->input_statement.flags.whole_archive)
3295 || (bfd_get_format (abfd) == bfd_object
3296 && ((abfd->flags) & DYNAMIC) != 0
3297 && s->input_statement.flags.add_DT_NEEDED_for_regular
3298 && bfd_get_flavour (abfd) == bfd_target_elf_flavour
3299 && (elf_dyn_lib_class (abfd) & DYN_AS_NEEDED) != 0)))
3301 s->input_statement.flags.loaded = FALSE;
3302 s->input_statement.flags.reload = TRUE;
3305 os_tail = lang_output_section_statement.tail;
3306 lang_list_init (&add);
3308 if (! load_symbols (&s->input_statement, &add))
3309 config.make_executable = FALSE;
3311 if (add.head != NULL)
3313 /* If this was a script with output sections then
3314 tack any added statements on to the end of the
3315 list. This avoids having to reorder the output
3316 section statement list. Very likely the user
3317 forgot -T, and whatever we do here will not meet
3318 naive user expectations. */
3319 if (os_tail != lang_output_section_statement.tail)
3321 einfo (_("%P: warning: %s contains output sections;"
3322 " did you forget -T?\n"),
3323 s->input_statement.filename);
3324 *stat_ptr->tail = add.head;
3325 stat_ptr->tail = add.tail;
3329 *add.tail = s->header.next;
3330 s->header.next = add.head;
3334 #ifdef ENABLE_PLUGINS
3335 /* If we have found the point at which a plugin added new
3336 files, clear plugin_insert to enable archive rescan. */
3337 if (&s->input_statement == plugin_insert)
3338 plugin_insert = NULL;
3341 case lang_assignment_statement_enum:
3342 if (s->assignment_statement.exp->assign.defsym)
3343 /* This is from a --defsym on the command line. */
3344 exp_fold_tree_no_dot (s->assignment_statement.exp);
3351 /* Exit if any of the files were missing. */
3352 if (input_flags.missing_file)
3356 /* Add the supplied name to the symbol table as an undefined reference.
3357 This is a two step process as the symbol table doesn't even exist at
3358 the time the ld command line is processed. First we put the name
3359 on a list, then, once the output file has been opened, transfer the
3360 name to the symbol table. */
3362 typedef struct bfd_sym_chain ldlang_undef_chain_list_type;
3364 #define ldlang_undef_chain_list_head entry_symbol.next
3367 ldlang_add_undef (const char *const name, bfd_boolean cmdline)
3369 ldlang_undef_chain_list_type *new_undef;
3371 undef_from_cmdline = undef_from_cmdline || cmdline;
3372 new_undef = (ldlang_undef_chain_list_type *) stat_alloc (sizeof (*new_undef));
3373 new_undef->next = ldlang_undef_chain_list_head;
3374 ldlang_undef_chain_list_head = new_undef;
3376 new_undef->name = xstrdup (name);
3378 if (link_info.output_bfd != NULL)
3379 insert_undefined (new_undef->name);
3382 /* Insert NAME as undefined in the symbol table. */
3385 insert_undefined (const char *name)
3387 struct bfd_link_hash_entry *h;
3389 h = bfd_link_hash_lookup (link_info.hash, name, TRUE, FALSE, TRUE);
3391 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
3392 if (h->type == bfd_link_hash_new)
3394 h->type = bfd_link_hash_undefined;
3395 h->u.undef.abfd = NULL;
3396 bfd_link_add_undef (link_info.hash, h);
3400 /* Run through the list of undefineds created above and place them
3401 into the linker hash table as undefined symbols belonging to the
3405 lang_place_undefineds (void)
3407 ldlang_undef_chain_list_type *ptr;
3409 for (ptr = ldlang_undef_chain_list_head; ptr != NULL; ptr = ptr->next)
3410 insert_undefined (ptr->name);
3413 /* Check for all readonly or some readwrite sections. */
3416 check_input_sections
3417 (lang_statement_union_type *s,
3418 lang_output_section_statement_type *output_section_statement)
3420 for (; s != (lang_statement_union_type *) NULL; s = s->header.next)
3422 switch (s->header.type)
3424 case lang_wild_statement_enum:
3425 walk_wild (&s->wild_statement, check_section_callback,
3426 output_section_statement);
3427 if (! output_section_statement->all_input_readonly)
3430 case lang_constructors_statement_enum:
3431 check_input_sections (constructor_list.head,
3432 output_section_statement);
3433 if (! output_section_statement->all_input_readonly)
3436 case lang_group_statement_enum:
3437 check_input_sections (s->group_statement.children.head,
3438 output_section_statement);
3439 if (! output_section_statement->all_input_readonly)
3448 /* Update wildcard statements if needed. */
3451 update_wild_statements (lang_statement_union_type *s)
3453 struct wildcard_list *sec;
3455 switch (sort_section)
3465 for (; s != NULL; s = s->header.next)
3467 switch (s->header.type)
3472 case lang_wild_statement_enum:
3473 for (sec = s->wild_statement.section_list; sec != NULL;
3476 switch (sec->spec.sorted)
3479 sec->spec.sorted = sort_section;
3482 if (sort_section == by_alignment)
3483 sec->spec.sorted = by_name_alignment;
3486 if (sort_section == by_name)
3487 sec->spec.sorted = by_alignment_name;
3495 case lang_constructors_statement_enum:
3496 update_wild_statements (constructor_list.head);
3499 case lang_output_section_statement_enum:
3500 /* Don't sort .init/.fini sections. */
3501 if (strcmp (s->output_section_statement.name, ".init") != 0
3502 && strcmp (s->output_section_statement.name, ".fini") != 0)
3503 update_wild_statements
3504 (s->output_section_statement.children.head);
3507 case lang_group_statement_enum:
3508 update_wild_statements (s->group_statement.children.head);
3516 /* Open input files and attach to output sections. */
3519 map_input_to_output_sections
3520 (lang_statement_union_type *s, const char *target,
3521 lang_output_section_statement_type *os)
3523 for (; s != NULL; s = s->header.next)
3525 lang_output_section_statement_type *tos;
3528 switch (s->header.type)
3530 case lang_wild_statement_enum:
3531 wild (&s->wild_statement, target, os);
3533 case lang_constructors_statement_enum:
3534 map_input_to_output_sections (constructor_list.head,
3538 case lang_output_section_statement_enum:
3539 tos = &s->output_section_statement;
3540 if (tos->constraint != 0)
3542 if (tos->constraint != ONLY_IF_RW
3543 && tos->constraint != ONLY_IF_RO)
3545 tos->all_input_readonly = TRUE;
3546 check_input_sections (tos->children.head, tos);
3547 if (tos->all_input_readonly != (tos->constraint == ONLY_IF_RO))
3549 tos->constraint = -1;
3553 map_input_to_output_sections (tos->children.head,
3557 case lang_output_statement_enum:
3559 case lang_target_statement_enum:
3560 target = s->target_statement.target;
3562 case lang_group_statement_enum:
3563 map_input_to_output_sections (s->group_statement.children.head,
3567 case lang_data_statement_enum:
3568 /* Make sure that any sections mentioned in the expression
3570 exp_init_os (s->data_statement.exp);
3571 /* The output section gets CONTENTS, ALLOC and LOAD, but
3572 these may be overridden by the script. */
3573 flags = SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD;
3574 switch (os->sectype)
3576 case normal_section:
3577 case overlay_section:
3579 case noalloc_section:
3580 flags = SEC_HAS_CONTENTS;
3582 case noload_section:
3583 if (bfd_get_flavour (link_info.output_bfd)
3584 == bfd_target_elf_flavour)
3585 flags = SEC_NEVER_LOAD | SEC_ALLOC;
3587 flags = SEC_NEVER_LOAD | SEC_HAS_CONTENTS;
3590 if (os->bfd_section == NULL)
3591 init_os (os, flags);
3593 os->bfd_section->flags |= flags;
3595 case lang_input_section_enum:
3597 case lang_fill_statement_enum:
3598 case lang_object_symbols_statement_enum:
3599 case lang_reloc_statement_enum:
3600 case lang_padding_statement_enum:
3601 case lang_input_statement_enum:
3602 if (os != NULL && os->bfd_section == NULL)
3605 case lang_assignment_statement_enum:
3606 if (os != NULL && os->bfd_section == NULL)
3609 /* Make sure that any sections mentioned in the assignment
3611 exp_init_os (s->assignment_statement.exp);
3613 case lang_address_statement_enum:
3614 /* Mark the specified section with the supplied address.
3615 If this section was actually a segment marker, then the
3616 directive is ignored if the linker script explicitly
3617 processed the segment marker. Originally, the linker
3618 treated segment directives (like -Ttext on the
3619 command-line) as section directives. We honor the
3620 section directive semantics for backwards compatibilty;
3621 linker scripts that do not specifically check for
3622 SEGMENT_START automatically get the old semantics. */
3623 if (!s->address_statement.segment
3624 || !s->address_statement.segment->used)
3626 const char *name = s->address_statement.section_name;
3628 /* Create the output section statement here so that
3629 orphans with a set address will be placed after other
3630 script sections. If we let the orphan placement code
3631 place them in amongst other sections then the address
3632 will affect following script sections, which is
3633 likely to surprise naive users. */
3634 tos = lang_output_section_statement_lookup (name, 0, TRUE);
3635 tos->addr_tree = s->address_statement.address;
3636 if (tos->bfd_section == NULL)
3640 case lang_insert_statement_enum:
3646 /* An insert statement snips out all the linker statements from the
3647 start of the list and places them after the output section
3648 statement specified by the insert. This operation is complicated
3649 by the fact that we keep a doubly linked list of output section
3650 statements as well as the singly linked list of all statements. */
3653 process_insert_statements (void)
3655 lang_statement_union_type **s;
3656 lang_output_section_statement_type *first_os = NULL;
3657 lang_output_section_statement_type *last_os = NULL;
3658 lang_output_section_statement_type *os;
3660 /* "start of list" is actually the statement immediately after
3661 the special abs_section output statement, so that it isn't
3663 s = &lang_output_section_statement.head;
3664 while (*(s = &(*s)->header.next) != NULL)
3666 if ((*s)->header.type == lang_output_section_statement_enum)
3668 /* Keep pointers to the first and last output section
3669 statement in the sequence we may be about to move. */
3670 os = &(*s)->output_section_statement;
3672 ASSERT (last_os == NULL || last_os->next == os);
3675 /* Set constraint negative so that lang_output_section_find
3676 won't match this output section statement. At this
3677 stage in linking constraint has values in the range
3678 [-1, ONLY_IN_RW]. */
3679 last_os->constraint = -2 - last_os->constraint;
3680 if (first_os == NULL)
3683 else if ((*s)->header.type == lang_insert_statement_enum)
3685 lang_insert_statement_type *i = &(*s)->insert_statement;
3686 lang_output_section_statement_type *where;
3687 lang_statement_union_type **ptr;
3688 lang_statement_union_type *first;
3690 where = lang_output_section_find (i->where);
3691 if (where != NULL && i->is_before)
3694 where = where->prev;
3695 while (where != NULL && where->constraint < 0);
3699 einfo (_("%F%P: %s not found for insert\n"), i->where);
3703 /* Deal with reordering the output section statement list. */
3704 if (last_os != NULL)
3706 asection *first_sec, *last_sec;
3707 struct lang_output_section_statement_struct **next;
3709 /* Snip out the output sections we are moving. */
3710 first_os->prev->next = last_os->next;
3711 if (last_os->next == NULL)
3713 next = &first_os->prev->next;
3714 lang_output_section_statement.tail
3715 = (lang_statement_union_type **) next;
3718 last_os->next->prev = first_os->prev;
3719 /* Add them in at the new position. */
3720 last_os->next = where->next;
3721 if (where->next == NULL)
3723 next = &last_os->next;
3724 lang_output_section_statement.tail
3725 = (lang_statement_union_type **) next;
3728 where->next->prev = last_os;
3729 first_os->prev = where;
3730 where->next = first_os;
3732 /* Move the bfd sections in the same way. */
3735 for (os = first_os; os != NULL; os = os->next)
3737 os->constraint = -2 - os->constraint;
3738 if (os->bfd_section != NULL
3739 && os->bfd_section->owner != NULL)
3741 last_sec = os->bfd_section;
3742 if (first_sec == NULL)
3743 first_sec = last_sec;
3748 if (last_sec != NULL)
3750 asection *sec = where->bfd_section;
3752 sec = output_prev_sec_find (where);
3754 /* The place we want to insert must come after the
3755 sections we are moving. So if we find no
3756 section or if the section is the same as our
3757 last section, then no move is needed. */
3758 if (sec != NULL && sec != last_sec)
3760 /* Trim them off. */
3761 if (first_sec->prev != NULL)
3762 first_sec->prev->next = last_sec->next;
3764 link_info.output_bfd->sections = last_sec->next;
3765 if (last_sec->next != NULL)
3766 last_sec->next->prev = first_sec->prev;
3768 link_info.output_bfd->section_last = first_sec->prev;
3770 last_sec->next = sec->next;
3771 if (sec->next != NULL)
3772 sec->next->prev = last_sec;
3774 link_info.output_bfd->section_last = last_sec;
3775 first_sec->prev = sec;
3776 sec->next = first_sec;
3784 ptr = insert_os_after (where);
3785 /* Snip everything after the abs_section output statement we
3786 know is at the start of the list, up to and including
3787 the insert statement we are currently processing. */
3788 first = lang_output_section_statement.head->header.next;
3789 lang_output_section_statement.head->header.next = (*s)->header.next;
3790 /* Add them back where they belong. */
3793 statement_list.tail = s;
3795 s = &lang_output_section_statement.head;
3799 /* Undo constraint twiddling. */
3800 for (os = first_os; os != NULL; os = os->next)
3802 os->constraint = -2 - os->constraint;
3808 /* An output section might have been removed after its statement was
3809 added. For example, ldemul_before_allocation can remove dynamic
3810 sections if they turn out to be not needed. Clean them up here. */
3813 strip_excluded_output_sections (void)
3815 lang_output_section_statement_type *os;
3817 /* Run lang_size_sections (if not already done). */
3818 if (expld.phase != lang_mark_phase_enum)
3820 expld.phase = lang_mark_phase_enum;
3821 expld.dataseg.phase = exp_dataseg_none;
3822 one_lang_size_sections_pass (NULL, FALSE);
3823 lang_reset_memory_regions ();
3826 for (os = &lang_output_section_statement.head->output_section_statement;
3830 asection *output_section;
3831 bfd_boolean exclude;
3833 if (os->constraint < 0)
3836 output_section = os->bfd_section;
3837 if (output_section == NULL)
3840 exclude = (output_section->rawsize == 0
3841 && (output_section->flags & SEC_KEEP) == 0
3842 && !bfd_section_removed_from_list (link_info.output_bfd,
3845 /* Some sections have not yet been sized, notably .gnu.version,
3846 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3847 input sections, so don't drop output sections that have such
3848 input sections unless they are also marked SEC_EXCLUDE. */
3849 if (exclude && output_section->map_head.s != NULL)
3853 for (s = output_section->map_head.s; s != NULL; s = s->map_head.s)
3854 if ((s->flags & SEC_EXCLUDE) == 0
3855 && ((s->flags & SEC_LINKER_CREATED) != 0
3856 || link_info.emitrelocations))
3865 /* We don't set bfd_section to NULL since bfd_section of the
3866 removed output section statement may still be used. */
3867 if (!os->update_dot)
3869 output_section->flags |= SEC_EXCLUDE;
3870 bfd_section_list_remove (link_info.output_bfd, output_section);
3871 link_info.output_bfd->section_count--;
3876 /* Called from ldwrite to clear out asection.map_head and
3877 asection.map_tail for use as link_orders in ldwrite.
3878 FIXME: Except for sh64elf.em which starts creating link_orders in
3879 its after_allocation routine so needs to call it early. */
3882 lang_clear_os_map (void)
3884 lang_output_section_statement_type *os;
3886 if (map_head_is_link_order)
3889 for (os = &lang_output_section_statement.head->output_section_statement;
3893 asection *output_section;
3895 if (os->constraint < 0)
3898 output_section = os->bfd_section;
3899 if (output_section == NULL)
3902 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3903 output_section->map_head.link_order = NULL;
3904 output_section->map_tail.link_order = NULL;
3907 /* Stop future calls to lang_add_section from messing with map_head
3908 and map_tail link_order fields. */
3909 map_head_is_link_order = TRUE;
3913 print_output_section_statement
3914 (lang_output_section_statement_type *output_section_statement)
3916 asection *section = output_section_statement->bfd_section;
3919 if (output_section_statement != abs_output_section)
3921 minfo ("\n%s", output_section_statement->name);
3923 if (section != NULL)
3925 print_dot = section->vma;
3927 len = strlen (output_section_statement->name);
3928 if (len >= SECTION_NAME_MAP_LENGTH - 1)
3933 while (len < SECTION_NAME_MAP_LENGTH)
3939 minfo ("0x%V %W", section->vma, section->size);
3941 if (section->vma != section->lma)
3942 minfo (_(" load address 0x%V"), section->lma);
3944 if (output_section_statement->update_dot_tree != NULL)
3945 exp_fold_tree (output_section_statement->update_dot_tree,
3946 bfd_abs_section_ptr, &print_dot);
3952 print_statement_list (output_section_statement->children.head,
3953 output_section_statement);
3957 print_assignment (lang_assignment_statement_type *assignment,
3958 lang_output_section_statement_type *output_section)
3965 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
3968 if (assignment->exp->type.node_class == etree_assert)
3971 tree = assignment->exp->assert_s.child;
3975 const char *dst = assignment->exp->assign.dst;
3977 is_dot = (dst[0] == '.' && dst[1] == 0);
3979 expld.assign_name = dst;
3980 tree = assignment->exp->assign.src;
3983 osec = output_section->bfd_section;
3985 osec = bfd_abs_section_ptr;
3987 if (assignment->exp->type.node_class != etree_provide)
3988 exp_fold_tree (tree, osec, &print_dot);
3990 expld.result.valid_p = FALSE;
3992 if (expld.result.valid_p)
3996 if (assignment->exp->type.node_class == etree_assert
3998 || expld.assign_name != NULL)
4000 value = expld.result.value;
4002 if (expld.result.section != NULL)
4003 value += expld.result.section->vma;
4005 minfo ("0x%V", value);
4011 struct bfd_link_hash_entry *h;
4013 h = bfd_link_hash_lookup (link_info.hash, assignment->exp->assign.dst,
4014 FALSE, FALSE, TRUE);
4017 value = h->u.def.value;
4018 value += h->u.def.section->output_section->vma;
4019 value += h->u.def.section->output_offset;
4021 minfo ("[0x%V]", value);
4024 minfo ("[unresolved]");
4029 if (assignment->exp->type.node_class == etree_provide)
4030 minfo ("[!provide]");
4037 expld.assign_name = NULL;
4040 exp_print_tree (assignment->exp);
4045 print_input_statement (lang_input_statement_type *statm)
4047 if (statm->filename != NULL
4048 && (statm->the_bfd == NULL
4049 || (statm->the_bfd->flags & BFD_LINKER_CREATED) == 0))
4050 fprintf (config.map_file, "LOAD %s\n", statm->filename);
4053 /* Print all symbols defined in a particular section. This is called
4054 via bfd_link_hash_traverse, or by print_all_symbols. */
4057 print_one_symbol (struct bfd_link_hash_entry *hash_entry, void *ptr)
4059 asection *sec = (asection *) ptr;
4061 if ((hash_entry->type == bfd_link_hash_defined
4062 || hash_entry->type == bfd_link_hash_defweak)
4063 && sec == hash_entry->u.def.section)
4067 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
4070 (hash_entry->u.def.value
4071 + hash_entry->u.def.section->output_offset
4072 + hash_entry->u.def.section->output_section->vma));
4074 minfo (" %T\n", hash_entry->root.string);
4081 hash_entry_addr_cmp (const void *a, const void *b)
4083 const struct bfd_link_hash_entry *l = *(const struct bfd_link_hash_entry **)a;
4084 const struct bfd_link_hash_entry *r = *(const struct bfd_link_hash_entry **)b;
4086 if (l->u.def.value < r->u.def.value)
4088 else if (l->u.def.value > r->u.def.value)
4095 print_all_symbols (asection *sec)
4097 input_section_userdata_type *ud
4098 = (input_section_userdata_type *) get_userdata (sec);
4099 struct map_symbol_def *def;
4100 struct bfd_link_hash_entry **entries;
4106 *ud->map_symbol_def_tail = 0;
4108 /* Sort the symbols by address. */
4109 entries = (struct bfd_link_hash_entry **)
4110 obstack_alloc (&map_obstack, ud->map_symbol_def_count * sizeof (*entries));
4112 for (i = 0, def = ud->map_symbol_def_head; def; def = def->next, i++)
4113 entries[i] = def->entry;
4115 qsort (entries, ud->map_symbol_def_count, sizeof (*entries),
4116 hash_entry_addr_cmp);
4118 /* Print the symbols. */
4119 for (i = 0; i < ud->map_symbol_def_count; i++)
4120 print_one_symbol (entries[i], sec);
4122 obstack_free (&map_obstack, entries);
4125 /* Print information about an input section to the map file. */
4128 print_input_section (asection *i, bfd_boolean is_discarded)
4130 bfd_size_type size = i->size;
4137 minfo ("%s", i->name);
4139 len = 1 + strlen (i->name);
4140 if (len >= SECTION_NAME_MAP_LENGTH - 1)
4145 while (len < SECTION_NAME_MAP_LENGTH)
4151 if (i->output_section != NULL
4152 && i->output_section->owner == link_info.output_bfd)
4153 addr = i->output_section->vma + i->output_offset;
4161 minfo ("0x%V %W %B\n", addr, TO_ADDR (size), i->owner);
4163 if (size != i->rawsize && i->rawsize != 0)
4165 len = SECTION_NAME_MAP_LENGTH + 3;
4177 minfo (_("%W (size before relaxing)\n"), i->rawsize);
4180 if (i->output_section != NULL
4181 && i->output_section->owner == link_info.output_bfd)
4183 if (link_info.reduce_memory_overheads)
4184 bfd_link_hash_traverse (link_info.hash, print_one_symbol, i);
4186 print_all_symbols (i);
4188 /* Update print_dot, but make sure that we do not move it
4189 backwards - this could happen if we have overlays and a
4190 later overlay is shorter than an earier one. */
4191 if (addr + TO_ADDR (size) > print_dot)
4192 print_dot = addr + TO_ADDR (size);
4197 print_fill_statement (lang_fill_statement_type *fill)
4201 fputs (" FILL mask 0x", config.map_file);
4202 for (p = fill->fill->data, size = fill->fill->size; size != 0; p++, size--)
4203 fprintf (config.map_file, "%02x", *p);
4204 fputs ("\n", config.map_file);
4208 print_data_statement (lang_data_statement_type *data)
4216 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
4219 addr = data->output_offset;
4220 if (data->output_section != NULL)
4221 addr += data->output_section->vma;
4249 minfo ("0x%V %W %s 0x%v", addr, size, name, data->value);
4251 if (data->exp->type.node_class != etree_value)
4254 exp_print_tree (data->exp);
4259 print_dot = addr + TO_ADDR (size);
4262 /* Print an address statement. These are generated by options like
4266 print_address_statement (lang_address_statement_type *address)
4268 minfo (_("Address of section %s set to "), address->section_name);
4269 exp_print_tree (address->address);
4273 /* Print a reloc statement. */
4276 print_reloc_statement (lang_reloc_statement_type *reloc)
4283 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
4286 addr = reloc->output_offset;
4287 if (reloc->output_section != NULL)
4288 addr += reloc->output_section->vma;
4290 size = bfd_get_reloc_size (reloc->howto);
4292 minfo ("0x%V %W RELOC %s ", addr, size, reloc->howto->name);
4294 if (reloc->name != NULL)
4295 minfo ("%s+", reloc->name);
4297 minfo ("%s+", reloc->section->name);
4299 exp_print_tree (reloc->addend_exp);
4303 print_dot = addr + TO_ADDR (size);
4307 print_padding_statement (lang_padding_statement_type *s)
4315 len = sizeof " *fill*" - 1;
4316 while (len < SECTION_NAME_MAP_LENGTH)
4322 addr = s->output_offset;
4323 if (s->output_section != NULL)
4324 addr += s->output_section->vma;
4325 minfo ("0x%V %W ", addr, (bfd_vma) s->size);
4327 if (s->fill->size != 0)
4331 for (p = s->fill->data, size = s->fill->size; size != 0; p++, size--)
4332 fprintf (config.map_file, "%02x", *p);
4337 print_dot = addr + TO_ADDR (s->size);
4341 print_wild_statement (lang_wild_statement_type *w,
4342 lang_output_section_statement_type *os)
4344 struct wildcard_list *sec;
4348 if (w->filenames_sorted)
4350 if (w->filename != NULL)
4351 minfo ("%s", w->filename);
4354 if (w->filenames_sorted)
4358 for (sec = w->section_list; sec; sec = sec->next)
4360 if (sec->spec.sorted)
4362 if (sec->spec.exclude_name_list != NULL)
4365 minfo ("EXCLUDE_FILE(%s", sec->spec.exclude_name_list->name);
4366 for (tmp = sec->spec.exclude_name_list->next; tmp; tmp = tmp->next)
4367 minfo (" %s", tmp->name);
4370 if (sec->spec.name != NULL)
4371 minfo ("%s", sec->spec.name);
4374 if (sec->spec.sorted)
4383 print_statement_list (w->children.head, os);
4386 /* Print a group statement. */
4389 print_group (lang_group_statement_type *s,
4390 lang_output_section_statement_type *os)
4392 fprintf (config.map_file, "START GROUP\n");
4393 print_statement_list (s->children.head, os);
4394 fprintf (config.map_file, "END GROUP\n");
4397 /* Print the list of statements in S.
4398 This can be called for any statement type. */
4401 print_statement_list (lang_statement_union_type *s,
4402 lang_output_section_statement_type *os)
4406 print_statement (s, os);
4411 /* Print the first statement in statement list S.
4412 This can be called for any statement type. */
4415 print_statement (lang_statement_union_type *s,
4416 lang_output_section_statement_type *os)
4418 switch (s->header.type)
4421 fprintf (config.map_file, _("Fail with %d\n"), s->header.type);
4424 case lang_constructors_statement_enum:
4425 if (constructor_list.head != NULL)
4427 if (constructors_sorted)
4428 minfo (" SORT (CONSTRUCTORS)\n");
4430 minfo (" CONSTRUCTORS\n");
4431 print_statement_list (constructor_list.head, os);
4434 case lang_wild_statement_enum:
4435 print_wild_statement (&s->wild_statement, os);
4437 case lang_address_statement_enum:
4438 print_address_statement (&s->address_statement);
4440 case lang_object_symbols_statement_enum:
4441 minfo (" CREATE_OBJECT_SYMBOLS\n");
4443 case lang_fill_statement_enum:
4444 print_fill_statement (&s->fill_statement);
4446 case lang_data_statement_enum:
4447 print_data_statement (&s->data_statement);
4449 case lang_reloc_statement_enum:
4450 print_reloc_statement (&s->reloc_statement);
4452 case lang_input_section_enum:
4453 print_input_section (s->input_section.section, FALSE);
4455 case lang_padding_statement_enum:
4456 print_padding_statement (&s->padding_statement);
4458 case lang_output_section_statement_enum:
4459 print_output_section_statement (&s->output_section_statement);
4461 case lang_assignment_statement_enum:
4462 print_assignment (&s->assignment_statement, os);
4464 case lang_target_statement_enum:
4465 fprintf (config.map_file, "TARGET(%s)\n", s->target_statement.target);
4467 case lang_output_statement_enum:
4468 minfo ("OUTPUT(%s", s->output_statement.name);
4469 if (output_target != NULL)
4470 minfo (" %s", output_target);
4473 case lang_input_statement_enum:
4474 print_input_statement (&s->input_statement);
4476 case lang_group_statement_enum:
4477 print_group (&s->group_statement, os);
4479 case lang_insert_statement_enum:
4480 minfo ("INSERT %s %s\n",
4481 s->insert_statement.is_before ? "BEFORE" : "AFTER",
4482 s->insert_statement.where);
4488 print_statements (void)
4490 print_statement_list (statement_list.head, abs_output_section);
4493 /* Print the first N statements in statement list S to STDERR.
4494 If N == 0, nothing is printed.
4495 If N < 0, the entire list is printed.
4496 Intended to be called from GDB. */
4499 dprint_statement (lang_statement_union_type *s, int n)
4501 FILE *map_save = config.map_file;
4503 config.map_file = stderr;
4506 print_statement_list (s, abs_output_section);
4509 while (s && --n >= 0)
4511 print_statement (s, abs_output_section);
4516 config.map_file = map_save;
4520 insert_pad (lang_statement_union_type **ptr,
4522 bfd_size_type alignment_needed,
4523 asection *output_section,
4526 static fill_type zero_fill;
4527 lang_statement_union_type *pad = NULL;
4529 if (ptr != &statement_list.head)
4530 pad = ((lang_statement_union_type *)
4531 ((char *) ptr - offsetof (lang_statement_union_type, header.next)));
4533 && pad->header.type == lang_padding_statement_enum
4534 && pad->padding_statement.output_section == output_section)
4536 /* Use the existing pad statement. */
4538 else if ((pad = *ptr) != NULL
4539 && pad->header.type == lang_padding_statement_enum
4540 && pad->padding_statement.output_section == output_section)
4542 /* Use the existing pad statement. */
4546 /* Make a new padding statement, linked into existing chain. */
4547 pad = (lang_statement_union_type *)
4548 stat_alloc (sizeof (lang_padding_statement_type));
4549 pad->header.next = *ptr;
4551 pad->header.type = lang_padding_statement_enum;
4552 pad->padding_statement.output_section = output_section;
4555 pad->padding_statement.fill = fill;
4557 pad->padding_statement.output_offset = dot - output_section->vma;
4558 pad->padding_statement.size = alignment_needed;
4559 output_section->size = TO_SIZE (dot + TO_ADDR (alignment_needed)
4560 - output_section->vma);
4563 /* Work out how much this section will move the dot point. */
4567 (lang_statement_union_type **this_ptr,
4568 lang_output_section_statement_type *output_section_statement,
4572 lang_input_section_type *is = &((*this_ptr)->input_section);
4573 asection *i = is->section;
4574 asection *o = output_section_statement->bfd_section;
4576 if (i->sec_info_type == SEC_INFO_TYPE_JUST_SYMS)
4577 i->output_offset = i->vma - o->vma;
4578 else if ((i->flags & SEC_EXCLUDE) != 0)
4579 i->output_offset = dot - o->vma;
4582 bfd_size_type alignment_needed;
4584 /* Align this section first to the input sections requirement,
4585 then to the output section's requirement. If this alignment
4586 is greater than any seen before, then record it too. Perform
4587 the alignment by inserting a magic 'padding' statement. */
4589 if (output_section_statement->subsection_alignment != -1)
4590 i->alignment_power = output_section_statement->subsection_alignment;
4592 if (o->alignment_power < i->alignment_power)
4593 o->alignment_power = i->alignment_power;
4595 alignment_needed = align_power (dot, i->alignment_power) - dot;
4597 if (alignment_needed != 0)
4599 insert_pad (this_ptr, fill, TO_SIZE (alignment_needed), o, dot);
4600 dot += alignment_needed;
4603 /* Remember where in the output section this input section goes. */
4604 i->output_offset = dot - o->vma;
4606 /* Mark how big the output section must be to contain this now. */
4607 dot += TO_ADDR (i->size);
4608 o->size = TO_SIZE (dot - o->vma);
4615 sort_sections_by_lma (const void *arg1, const void *arg2)
4617 const asection *sec1 = *(const asection **) arg1;
4618 const asection *sec2 = *(const asection **) arg2;
4620 if (bfd_section_lma (sec1->owner, sec1)
4621 < bfd_section_lma (sec2->owner, sec2))
4623 else if (bfd_section_lma (sec1->owner, sec1)
4624 > bfd_section_lma (sec2->owner, sec2))
4626 else if (sec1->id < sec2->id)
4628 else if (sec1->id > sec2->id)
4634 #define IGNORE_SECTION(s) \
4635 ((s->flags & SEC_ALLOC) == 0 \
4636 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
4637 && (s->flags & SEC_LOAD) == 0))
4639 /* Check to see if any allocated sections overlap with other allocated
4640 sections. This can happen if a linker script specifies the output
4641 section addresses of the two sections. Also check whether any memory
4642 region has overflowed. */
4645 lang_check_section_addresses (void)
4648 asection **sections, **spp;
4655 lang_memory_region_type *m;
4657 if (bfd_count_sections (link_info.output_bfd) <= 1)
4660 amt = bfd_count_sections (link_info.output_bfd) * sizeof (asection *);
4661 sections = (asection **) xmalloc (amt);
4663 /* Scan all sections in the output list. */
4665 for (s = link_info.output_bfd->sections; s != NULL; s = s->next)
4667 /* Only consider loadable sections with real contents. */
4668 if (!(s->flags & SEC_LOAD)
4669 || !(s->flags & SEC_ALLOC)
4673 sections[count] = s;
4680 qsort (sections, (size_t) count, sizeof (asection *),
4681 sort_sections_by_lma);
4686 s_end = s_start + TO_ADDR (s->size) - 1;
4687 for (count--; count; count--)
4689 /* We must check the sections' LMA addresses not their VMA
4690 addresses because overlay sections can have overlapping VMAs
4691 but they must have distinct LMAs. */
4697 s_end = s_start + TO_ADDR (s->size) - 1;
4699 /* Look for an overlap. We have sorted sections by lma, so we
4700 know that s_start >= p_start. Besides the obvious case of
4701 overlap when the current section starts before the previous
4702 one ends, we also must have overlap if the previous section
4703 wraps around the address space. */
4704 if (s_start <= p_end
4706 einfo (_("%X%P: section %s loaded at [%V,%V] overlaps section %s loaded at [%V,%V]\n"),
4707 s->name, s_start, s_end, p->name, p_start, p_end);
4712 /* If any memory region has overflowed, report by how much.
4713 We do not issue this diagnostic for regions that had sections
4714 explicitly placed outside their bounds; os_region_check's
4715 diagnostics are adequate for that case.
4717 FIXME: It is conceivable that m->current - (m->origin + m->length)
4718 might overflow a 32-bit integer. There is, alas, no way to print
4719 a bfd_vma quantity in decimal. */
4720 for (m = lang_memory_region_list; m; m = m->next)
4721 if (m->had_full_message)
4722 einfo (_("%X%P: region `%s' overflowed by %ld bytes\n"),
4723 m->name_list.name, (long)(m->current - (m->origin + m->length)));
4727 /* Make sure the new address is within the region. We explicitly permit the
4728 current address to be at the exact end of the region when the address is
4729 non-zero, in case the region is at the end of addressable memory and the
4730 calculation wraps around. */
4733 os_region_check (lang_output_section_statement_type *os,
4734 lang_memory_region_type *region,
4738 if ((region->current < region->origin
4739 || (region->current - region->origin > region->length))
4740 && ((region->current != region->origin + region->length)
4745 einfo (_("%X%P: address 0x%v of %B section `%s'"
4746 " is not within region `%s'\n"),
4748 os->bfd_section->owner,
4749 os->bfd_section->name,
4750 region->name_list.name);
4752 else if (!region->had_full_message)
4754 region->had_full_message = TRUE;
4756 einfo (_("%X%P: %B section `%s' will not fit in region `%s'\n"),
4757 os->bfd_section->owner,
4758 os->bfd_section->name,
4759 region->name_list.name);
4764 /* Set the sizes for all the output sections. */
4767 lang_size_sections_1
4768 (lang_statement_union_type **prev,
4769 lang_output_section_statement_type *output_section_statement,
4773 bfd_boolean check_regions)
4775 lang_statement_union_type *s;
4777 /* Size up the sections from their constituent parts. */
4778 for (s = *prev; s != NULL; s = s->header.next)
4780 switch (s->header.type)
4782 case lang_output_section_statement_enum:
4784 bfd_vma newdot, after, dotdelta;
4785 lang_output_section_statement_type *os;
4786 lang_memory_region_type *r;
4787 int section_alignment = 0;
4789 os = &s->output_section_statement;
4790 if (os->constraint == -1)
4793 /* FIXME: We shouldn't need to zero section vmas for ld -r
4794 here, in lang_insert_orphan, or in the default linker scripts.
4795 This is covering for coff backend linker bugs. See PR6945. */
4796 if (os->addr_tree == NULL
4797 && link_info.relocatable
4798 && (bfd_get_flavour (link_info.output_bfd)
4799 == bfd_target_coff_flavour))
4800 os->addr_tree = exp_intop (0);
4801 if (os->addr_tree != NULL)
4803 os->processed_vma = FALSE;
4804 exp_fold_tree (os->addr_tree, bfd_abs_section_ptr, &dot);
4806 if (expld.result.valid_p)
4808 dot = expld.result.value;
4809 if (expld.result.section != NULL)
4810 dot += expld.result.section->vma;
4812 else if (expld.phase != lang_mark_phase_enum)
4813 einfo (_("%F%S: non constant or forward reference"
4814 " address expression for section %s\n"),
4815 os->addr_tree, os->name);
4818 if (os->bfd_section == NULL)
4819 /* This section was removed or never actually created. */
4822 /* If this is a COFF shared library section, use the size and
4823 address from the input section. FIXME: This is COFF
4824 specific; it would be cleaner if there were some other way
4825 to do this, but nothing simple comes to mind. */
4826 if (((bfd_get_flavour (link_info.output_bfd)
4827 == bfd_target_ecoff_flavour)
4828 || (bfd_get_flavour (link_info.output_bfd)
4829 == bfd_target_coff_flavour))
4830 && (os->bfd_section->flags & SEC_COFF_SHARED_LIBRARY) != 0)
4834 if (os->children.head == NULL
4835 || os->children.head->header.next != NULL
4836 || (os->children.head->header.type
4837 != lang_input_section_enum))
4838 einfo (_("%P%X: Internal error on COFF shared library"
4839 " section %s\n"), os->name);
4841 input = os->children.head->input_section.section;
4842 bfd_set_section_vma (os->bfd_section->owner,
4844 bfd_section_vma (input->owner, input));
4845 os->bfd_section->size = input->size;
4851 if (bfd_is_abs_section (os->bfd_section))
4853 /* No matter what happens, an abs section starts at zero. */
4854 ASSERT (os->bfd_section->vma == 0);
4858 if (os->addr_tree == NULL)
4860 /* No address specified for this section, get one
4861 from the region specification. */
4862 if (os->region == NULL
4863 || ((os->bfd_section->flags & (SEC_ALLOC | SEC_LOAD))
4864 && os->region->name_list.name[0] == '*'
4865 && strcmp (os->region->name_list.name,
4866 DEFAULT_MEMORY_REGION) == 0))
4868 os->region = lang_memory_default (os->bfd_section);
4871 /* If a loadable section is using the default memory
4872 region, and some non default memory regions were
4873 defined, issue an error message. */
4875 && !IGNORE_SECTION (os->bfd_section)
4876 && ! link_info.relocatable
4878 && strcmp (os->region->name_list.name,
4879 DEFAULT_MEMORY_REGION) == 0
4880 && lang_memory_region_list != NULL
4881 && (strcmp (lang_memory_region_list->name_list.name,
4882 DEFAULT_MEMORY_REGION) != 0
4883 || lang_memory_region_list->next != NULL)
4884 && expld.phase != lang_mark_phase_enum)
4886 /* By default this is an error rather than just a
4887 warning because if we allocate the section to the
4888 default memory region we can end up creating an
4889 excessively large binary, or even seg faulting when
4890 attempting to perform a negative seek. See
4891 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4892 for an example of this. This behaviour can be
4893 overridden by the using the --no-check-sections
4895 if (command_line.check_section_addresses)
4896 einfo (_("%P%F: error: no memory region specified"
4897 " for loadable section `%s'\n"),
4898 bfd_get_section_name (link_info.output_bfd,
4901 einfo (_("%P: warning: no memory region specified"
4902 " for loadable section `%s'\n"),
4903 bfd_get_section_name (link_info.output_bfd,
4907 newdot = os->region->current;
4908 section_alignment = os->bfd_section->alignment_power;
4911 section_alignment = os->section_alignment;
4913 /* Align to what the section needs. */
4914 if (section_alignment > 0)
4916 bfd_vma savedot = newdot;
4917 newdot = align_power (newdot, section_alignment);
4919 dotdelta = newdot - savedot;
4921 && (config.warn_section_align
4922 || os->addr_tree != NULL)
4923 && expld.phase != lang_mark_phase_enum)
4924 einfo (_("%P: warning: changing start of section"
4925 " %s by %lu bytes\n"),
4926 os->name, (unsigned long) dotdelta);
4929 bfd_set_section_vma (0, os->bfd_section, newdot);
4931 os->bfd_section->output_offset = 0;
4934 lang_size_sections_1 (&os->children.head, os,
4935 os->fill, newdot, relax, check_regions);
4937 os->processed_vma = TRUE;
4939 if (bfd_is_abs_section (os->bfd_section) || os->ignored)
4940 /* Except for some special linker created sections,
4941 no output section should change from zero size
4942 after strip_excluded_output_sections. A non-zero
4943 size on an ignored section indicates that some
4944 input section was not sized early enough. */
4945 ASSERT (os->bfd_section->size == 0);
4948 dot = os->bfd_section->vma;
4950 /* Put the section within the requested block size, or
4951 align at the block boundary. */
4953 + TO_ADDR (os->bfd_section->size)
4954 + os->block_value - 1)
4955 & - (bfd_vma) os->block_value);
4957 os->bfd_section->size = TO_SIZE (after - os->bfd_section->vma);
4960 /* Set section lma. */
4963 r = lang_memory_region_lookup (DEFAULT_MEMORY_REGION, FALSE);
4967 bfd_vma lma = exp_get_abs_int (os->load_base, 0, "load base");
4968 os->bfd_section->lma = lma;
4970 else if (os->lma_region != NULL)
4972 bfd_vma lma = os->lma_region->current;
4974 if (os->align_lma_with_input)
4978 /* When LMA_REGION is the same as REGION, align the LMA
4979 as we did for the VMA, possibly including alignment
4980 from the bfd section. If a different region, then
4981 only align according to the value in the output
4983 if (os->lma_region != os->region)
4984 section_alignment = os->section_alignment;
4985 if (section_alignment > 0)
4986 lma = align_power (lma, section_alignment);
4988 os->bfd_section->lma = lma;
4990 else if (r->last_os != NULL
4991 && (os->bfd_section->flags & SEC_ALLOC) != 0)
4996 last = r->last_os->output_section_statement.bfd_section;
4998 /* A backwards move of dot should be accompanied by
4999 an explicit assignment to the section LMA (ie.
5000 os->load_base set) because backwards moves can
5001 create overlapping LMAs. */
5003 && os->bfd_section->size != 0
5004 && dot + os->bfd_section->size <= last->vma)
5006 /* If dot moved backwards then leave lma equal to
5007 vma. This is the old default lma, which might
5008 just happen to work when the backwards move is
5009 sufficiently large. Nag if this changes anything,
5010 so people can fix their linker scripts. */
5012 if (last->vma != last->lma)
5013 einfo (_("%P: warning: dot moved backwards before `%s'\n"),
5018 /* If this is an overlay, set the current lma to that
5019 at the end of the previous section. */
5020 if (os->sectype == overlay_section)
5021 lma = last->lma + last->size;
5023 /* Otherwise, keep the same lma to vma relationship
5024 as the previous section. */
5026 lma = dot + last->lma - last->vma;
5028 if (section_alignment > 0)
5029 lma = align_power (lma, section_alignment);
5030 os->bfd_section->lma = lma;
5033 os->processed_lma = TRUE;
5035 if (bfd_is_abs_section (os->bfd_section) || os->ignored)
5038 /* Keep track of normal sections using the default
5039 lma region. We use this to set the lma for
5040 following sections. Overlays or other linker
5041 script assignment to lma might mean that the
5042 default lma == vma is incorrect.
5043 To avoid warnings about dot moving backwards when using
5044 -Ttext, don't start tracking sections until we find one
5045 of non-zero size or with lma set differently to vma. */
5046 if (((os->bfd_section->flags & SEC_HAS_CONTENTS) != 0
5047 || (os->bfd_section->flags & SEC_THREAD_LOCAL) == 0)
5048 && (os->bfd_section->flags & SEC_ALLOC) != 0
5049 && (os->bfd_section->size != 0
5050 || (r->last_os == NULL
5051 && os->bfd_section->vma != os->bfd_section->lma)
5052 || (r->last_os != NULL
5053 && dot >= (r->last_os->output_section_statement
5054 .bfd_section->vma)))
5055 && os->lma_region == NULL
5056 && !link_info.relocatable)
5059 /* .tbss sections effectively have zero size. */
5060 if ((os->bfd_section->flags & SEC_HAS_CONTENTS) != 0
5061 || (os->bfd_section->flags & SEC_THREAD_LOCAL) == 0
5062 || link_info.relocatable)
5063 dotdelta = TO_ADDR (os->bfd_section->size);
5068 if (os->update_dot_tree != 0)
5069 exp_fold_tree (os->update_dot_tree, bfd_abs_section_ptr, &dot);
5071 /* Update dot in the region ?
5072 We only do this if the section is going to be allocated,
5073 since unallocated sections do not contribute to the region's
5074 overall size in memory. */
5075 if (os->region != NULL
5076 && (os->bfd_section->flags & (SEC_ALLOC | SEC_LOAD)))
5078 os->region->current = dot;
5081 /* Make sure the new address is within the region. */
5082 os_region_check (os, os->region, os->addr_tree,
5083 os->bfd_section->vma);
5085 if (os->lma_region != NULL && os->lma_region != os->region
5086 && ((os->bfd_section->flags & SEC_LOAD)
5087 || os->align_lma_with_input))
5089 os->lma_region->current = os->bfd_section->lma + dotdelta;
5092 os_region_check (os, os->lma_region, NULL,
5093 os->bfd_section->lma);
5099 case lang_constructors_statement_enum:
5100 dot = lang_size_sections_1 (&constructor_list.head,
5101 output_section_statement,
5102 fill, dot, relax, check_regions);
5105 case lang_data_statement_enum:
5107 unsigned int size = 0;
5109 s->data_statement.output_offset =
5110 dot - output_section_statement->bfd_section->vma;
5111 s->data_statement.output_section =
5112 output_section_statement->bfd_section;
5114 /* We might refer to provided symbols in the expression, and
5115 need to mark them as needed. */
5116 exp_fold_tree (s->data_statement.exp, bfd_abs_section_ptr, &dot);
5118 switch (s->data_statement.type)
5136 if (size < TO_SIZE ((unsigned) 1))
5137 size = TO_SIZE ((unsigned) 1);
5138 dot += TO_ADDR (size);
5139 output_section_statement->bfd_section->size
5140 = TO_SIZE (dot - output_section_statement->bfd_section->vma);
5145 case lang_reloc_statement_enum:
5149 s->reloc_statement.output_offset =
5150 dot - output_section_statement->bfd_section->vma;
5151 s->reloc_statement.output_section =
5152 output_section_statement->bfd_section;
5153 size = bfd_get_reloc_size (s->reloc_statement.howto);
5154 dot += TO_ADDR (size);
5155 output_section_statement->bfd_section->size
5156 = TO_SIZE (dot - output_section_statement->bfd_section->vma);
5160 case lang_wild_statement_enum:
5161 dot = lang_size_sections_1 (&s->wild_statement.children.head,
5162 output_section_statement,
5163 fill, dot, relax, check_regions);
5166 case lang_object_symbols_statement_enum:
5167 link_info.create_object_symbols_section =
5168 output_section_statement->bfd_section;
5171 case lang_output_statement_enum:
5172 case lang_target_statement_enum:
5175 case lang_input_section_enum:
5179 i = s->input_section.section;
5184 if (! bfd_relax_section (i->owner, i, &link_info, &again))
5185 einfo (_("%P%F: can't relax section: %E\n"));
5189 dot = size_input_section (prev, output_section_statement,
5194 case lang_input_statement_enum:
5197 case lang_fill_statement_enum:
5198 s->fill_statement.output_section =
5199 output_section_statement->bfd_section;
5201 fill = s->fill_statement.fill;
5204 case lang_assignment_statement_enum:
5206 bfd_vma newdot = dot;
5207 etree_type *tree = s->assignment_statement.exp;
5209 expld.dataseg.relro = exp_dataseg_relro_none;
5211 exp_fold_tree (tree,
5212 output_section_statement->bfd_section,
5215 if (expld.dataseg.relro == exp_dataseg_relro_start)
5217 if (!expld.dataseg.relro_start_stat)
5218 expld.dataseg.relro_start_stat = s;
5221 ASSERT (expld.dataseg.relro_start_stat == s);
5224 else if (expld.dataseg.relro == exp_dataseg_relro_end)
5226 if (!expld.dataseg.relro_end_stat)
5227 expld.dataseg.relro_end_stat = s;
5230 ASSERT (expld.dataseg.relro_end_stat == s);
5233 expld.dataseg.relro = exp_dataseg_relro_none;
5235 /* This symbol may be relative to this section. */
5236 if ((tree->type.node_class == etree_provided
5237 || tree->type.node_class == etree_assign)
5238 && (tree->assign.dst [0] != '.'
5239 || tree->assign.dst [1] != '\0'))
5240 output_section_statement->update_dot = 1;
5242 if (!output_section_statement->ignored)
5244 if (output_section_statement == abs_output_section)
5246 /* If we don't have an output section, then just adjust
5247 the default memory address. */
5248 lang_memory_region_lookup (DEFAULT_MEMORY_REGION,
5249 FALSE)->current = newdot;
5251 else if (newdot != dot)
5253 /* Insert a pad after this statement. We can't
5254 put the pad before when relaxing, in case the
5255 assignment references dot. */
5256 insert_pad (&s->header.next, fill, TO_SIZE (newdot - dot),
5257 output_section_statement->bfd_section, dot);
5259 /* Don't neuter the pad below when relaxing. */
5262 /* If dot is advanced, this implies that the section
5263 should have space allocated to it, unless the
5264 user has explicitly stated that the section
5265 should not be allocated. */
5266 if (output_section_statement->sectype != noalloc_section
5267 && (output_section_statement->sectype != noload_section
5268 || (bfd_get_flavour (link_info.output_bfd)
5269 == bfd_target_elf_flavour)))
5270 output_section_statement->bfd_section->flags |= SEC_ALLOC;
5277 case lang_padding_statement_enum:
5278 /* If this is the first time lang_size_sections is called,
5279 we won't have any padding statements. If this is the
5280 second or later passes when relaxing, we should allow
5281 padding to shrink. If padding is needed on this pass, it
5282 will be added back in. */
5283 s->padding_statement.size = 0;
5285 /* Make sure output_offset is valid. If relaxation shrinks
5286 the section and this pad isn't needed, it's possible to
5287 have output_offset larger than the final size of the
5288 section. bfd_set_section_contents will complain even for
5289 a pad size of zero. */
5290 s->padding_statement.output_offset
5291 = dot - output_section_statement->bfd_section->vma;
5294 case lang_group_statement_enum:
5295 dot = lang_size_sections_1 (&s->group_statement.children.head,
5296 output_section_statement,
5297 fill, dot, relax, check_regions);
5300 case lang_insert_statement_enum:
5303 /* We can only get here when relaxing is turned on. */
5304 case lang_address_statement_enum:
5311 prev = &s->header.next;
5316 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
5317 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
5318 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
5319 segments. We are allowed an opportunity to override this decision. */
5322 ldlang_override_segment_assignment (struct bfd_link_info * info ATTRIBUTE_UNUSED,
5323 bfd * abfd ATTRIBUTE_UNUSED,
5324 asection * current_section,
5325 asection * previous_section,
5326 bfd_boolean new_segment)
5328 lang_output_section_statement_type * cur;
5329 lang_output_section_statement_type * prev;
5331 /* The checks below are only necessary when the BFD library has decided
5332 that the two sections ought to be placed into the same segment. */
5336 /* Paranoia checks. */
5337 if (current_section == NULL || previous_section == NULL)
5340 /* If this flag is set, the target never wants code and non-code
5341 sections comingled in the same segment. */
5342 if (config.separate_code
5343 && ((current_section->flags ^ previous_section->flags) & SEC_CODE))
5346 /* Find the memory regions associated with the two sections.
5347 We call lang_output_section_find() here rather than scanning the list
5348 of output sections looking for a matching section pointer because if
5349 we have a large number of sections then a hash lookup is faster. */
5350 cur = lang_output_section_find (current_section->name);
5351 prev = lang_output_section_find (previous_section->name);
5353 /* More paranoia. */
5354 if (cur == NULL || prev == NULL)
5357 /* If the regions are different then force the sections to live in
5358 different segments. See the email thread starting at the following
5359 URL for the reasons why this is necessary:
5360 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
5361 return cur->region != prev->region;
5365 one_lang_size_sections_pass (bfd_boolean *relax, bfd_boolean check_regions)
5367 lang_statement_iteration++;
5368 lang_size_sections_1 (&statement_list.head, abs_output_section,
5369 0, 0, relax, check_regions);
5373 lang_size_sections (bfd_boolean *relax, bfd_boolean check_regions)
5375 expld.phase = lang_allocating_phase_enum;
5376 expld.dataseg.phase = exp_dataseg_none;
5378 one_lang_size_sections_pass (relax, check_regions);
5379 if (expld.dataseg.phase == exp_dataseg_end_seen
5380 && link_info.relro && expld.dataseg.relro_end)
5382 bfd_vma initial_base, relro_end, desired_end;
5385 /* Compute the expected PT_GNU_RELRO segment end. */
5386 relro_end = ((expld.dataseg.relro_end + expld.dataseg.pagesize - 1)
5387 & ~(expld.dataseg.pagesize - 1));
5389 /* Adjust by the offset arg of DATA_SEGMENT_RELRO_END. */
5390 desired_end = relro_end - expld.dataseg.relro_offset;
5392 /* For sections in the relro segment.. */
5393 for (sec = link_info.output_bfd->section_last; sec; sec = sec->prev)
5394 if (!IGNORE_SECTION (sec)
5395 && sec->vma >= expld.dataseg.base
5396 && sec->vma < expld.dataseg.relro_end - expld.dataseg.relro_offset)
5398 /* Where do we want to put this section so that it ends as
5400 bfd_vma start = sec->vma;
5401 bfd_vma end = start + sec->size;
5402 bfd_vma bump = desired_end - end;
5403 /* We'd like to increase START by BUMP, but we must heed
5404 alignment so the increase might be less than optimum. */
5405 start += bump & ~(((bfd_vma) 1 << sec->alignment_power) - 1);
5406 /* This is now the desired end for the previous section. */
5407 desired_end = start;
5410 expld.dataseg.phase = exp_dataseg_relro_adjust;
5411 ASSERT (desired_end >= expld.dataseg.base);
5412 initial_base = expld.dataseg.base;
5413 expld.dataseg.base = desired_end;
5414 lang_reset_memory_regions ();
5415 one_lang_size_sections_pass (relax, check_regions);
5417 if (expld.dataseg.relro_end > relro_end)
5419 /* Assignments to dot, or to output section address in a
5420 user script have increased padding over the original.
5422 expld.dataseg.base = initial_base;
5423 lang_reset_memory_regions ();
5424 one_lang_size_sections_pass (relax, check_regions);
5427 link_info.relro_start = expld.dataseg.base;
5428 link_info.relro_end = expld.dataseg.relro_end;
5430 else if (expld.dataseg.phase == exp_dataseg_end_seen)
5432 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
5433 a page could be saved in the data segment. */
5434 bfd_vma first, last;
5436 first = -expld.dataseg.base & (expld.dataseg.pagesize - 1);
5437 last = expld.dataseg.end & (expld.dataseg.pagesize - 1);
5439 && ((expld.dataseg.base & ~(expld.dataseg.pagesize - 1))
5440 != (expld.dataseg.end & ~(expld.dataseg.pagesize - 1)))
5441 && first + last <= expld.dataseg.pagesize)
5443 expld.dataseg.phase = exp_dataseg_adjust;
5444 lang_reset_memory_regions ();
5445 one_lang_size_sections_pass (relax, check_regions);
5448 expld.dataseg.phase = exp_dataseg_done;
5451 expld.dataseg.phase = exp_dataseg_done;
5454 static lang_output_section_statement_type *current_section;
5455 static lang_assignment_statement_type *current_assign;
5456 static bfd_boolean prefer_next_section;
5458 /* Worker function for lang_do_assignments. Recursiveness goes here. */
5461 lang_do_assignments_1 (lang_statement_union_type *s,
5462 lang_output_section_statement_type *current_os,
5465 bfd_boolean *found_end)
5467 for (; s != NULL; s = s->header.next)
5469 switch (s->header.type)
5471 case lang_constructors_statement_enum:
5472 dot = lang_do_assignments_1 (constructor_list.head,
5473 current_os, fill, dot, found_end);
5476 case lang_output_section_statement_enum:
5478 lang_output_section_statement_type *os;
5480 os = &(s->output_section_statement);
5481 os->after_end = *found_end;
5482 if (os->bfd_section != NULL && !os->ignored)
5484 if ((os->bfd_section->flags & SEC_ALLOC) != 0)
5486 current_section = os;
5487 prefer_next_section = FALSE;
5489 dot = os->bfd_section->vma;
5491 lang_do_assignments_1 (os->children.head,
5492 os, os->fill, dot, found_end);
5494 /* .tbss sections effectively have zero size. */
5495 if ((os->bfd_section->flags & SEC_HAS_CONTENTS) != 0
5496 || (os->bfd_section->flags & SEC_THREAD_LOCAL) == 0
5497 || link_info.relocatable)
5498 dot += TO_ADDR (os->bfd_section->size);
5500 if (os->update_dot_tree != NULL)
5501 exp_fold_tree (os->update_dot_tree, bfd_abs_section_ptr, &dot);
5506 case lang_wild_statement_enum:
5508 dot = lang_do_assignments_1 (s->wild_statement.children.head,
5509 current_os, fill, dot, found_end);
5512 case lang_object_symbols_statement_enum:
5513 case lang_output_statement_enum:
5514 case lang_target_statement_enum:
5517 case lang_data_statement_enum:
5518 exp_fold_tree (s->data_statement.exp, bfd_abs_section_ptr, &dot);
5519 if (expld.result.valid_p)
5521 s->data_statement.value = expld.result.value;
5522 if (expld.result.section != NULL)
5523 s->data_statement.value += expld.result.section->vma;
5526 einfo (_("%F%P: invalid data statement\n"));
5529 switch (s->data_statement.type)
5547 if (size < TO_SIZE ((unsigned) 1))
5548 size = TO_SIZE ((unsigned) 1);
5549 dot += TO_ADDR (size);
5553 case lang_reloc_statement_enum:
5554 exp_fold_tree (s->reloc_statement.addend_exp,
5555 bfd_abs_section_ptr, &dot);
5556 if (expld.result.valid_p)
5557 s->reloc_statement.addend_value = expld.result.value;
5559 einfo (_("%F%P: invalid reloc statement\n"));
5560 dot += TO_ADDR (bfd_get_reloc_size (s->reloc_statement.howto));
5563 case lang_input_section_enum:
5565 asection *in = s->input_section.section;
5567 if ((in->flags & SEC_EXCLUDE) == 0)
5568 dot += TO_ADDR (in->size);
5572 case lang_input_statement_enum:
5575 case lang_fill_statement_enum:
5576 fill = s->fill_statement.fill;
5579 case lang_assignment_statement_enum:
5580 current_assign = &s->assignment_statement;
5581 if (current_assign->exp->type.node_class != etree_assert)
5583 const char *p = current_assign->exp->assign.dst;
5585 if (current_os == abs_output_section && p[0] == '.' && p[1] == 0)
5586 prefer_next_section = TRUE;
5590 if (strcmp (p, "end") == 0)
5593 exp_fold_tree (s->assignment_statement.exp,
5594 current_os->bfd_section,
5598 case lang_padding_statement_enum:
5599 dot += TO_ADDR (s->padding_statement.size);
5602 case lang_group_statement_enum:
5603 dot = lang_do_assignments_1 (s->group_statement.children.head,
5604 current_os, fill, dot, found_end);
5607 case lang_insert_statement_enum:
5610 case lang_address_statement_enum:
5622 lang_do_assignments (lang_phase_type phase)
5624 bfd_boolean found_end = FALSE;
5626 current_section = NULL;
5627 prefer_next_section = FALSE;
5628 expld.phase = phase;
5629 lang_statement_iteration++;
5630 lang_do_assignments_1 (statement_list.head,
5631 abs_output_section, NULL, 0, &found_end);
5634 /* For an assignment statement outside of an output section statement,
5635 choose the best of neighbouring output sections to use for values
5639 section_for_dot (void)
5643 /* Assignments belong to the previous output section, unless there
5644 has been an assignment to "dot", in which case following
5645 assignments belong to the next output section. (The assumption
5646 is that an assignment to "dot" is setting up the address for the
5647 next output section.) Except that past the assignment to "_end"
5648 we always associate with the previous section. This exception is
5649 for targets like SH that define an alloc .stack or other
5650 weirdness after non-alloc sections. */
5651 if (current_section == NULL || prefer_next_section)
5653 lang_statement_union_type *stmt;
5654 lang_output_section_statement_type *os;
5656 for (stmt = (lang_statement_union_type *) current_assign;
5658 stmt = stmt->header.next)
5659 if (stmt->header.type == lang_output_section_statement_enum)
5662 os = &stmt->output_section_statement;
5665 && (os->bfd_section == NULL
5666 || (os->bfd_section->flags & SEC_EXCLUDE) != 0
5667 || bfd_section_removed_from_list (link_info.output_bfd,
5671 if (current_section == NULL || os == NULL || !os->after_end)
5674 s = os->bfd_section;
5676 s = link_info.output_bfd->section_last;
5678 && ((s->flags & SEC_ALLOC) == 0
5679 || (s->flags & SEC_THREAD_LOCAL) != 0))
5684 return bfd_abs_section_ptr;
5688 s = current_section->bfd_section;
5690 /* The section may have been stripped. */
5692 && ((s->flags & SEC_EXCLUDE) != 0
5693 || (s->flags & SEC_ALLOC) == 0
5694 || (s->flags & SEC_THREAD_LOCAL) != 0
5695 || bfd_section_removed_from_list (link_info.output_bfd, s)))
5698 s = link_info.output_bfd->sections;
5700 && ((s->flags & SEC_ALLOC) == 0
5701 || (s->flags & SEC_THREAD_LOCAL) != 0))
5706 return bfd_abs_section_ptr;
5709 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
5710 operator .startof. (section_name), it produces an undefined symbol
5711 .startof.section_name. Similarly, when it sees
5712 .sizeof. (section_name), it produces an undefined symbol
5713 .sizeof.section_name. For all the output sections, we look for
5714 such symbols, and set them to the correct value. */
5717 lang_set_startof (void)
5721 if (link_info.relocatable)
5724 for (s = link_info.output_bfd->sections; s != NULL; s = s->next)
5726 const char *secname;
5728 struct bfd_link_hash_entry *h;
5730 secname = bfd_get_section_name (link_info.output_bfd, s);
5731 buf = (char *) xmalloc (10 + strlen (secname));
5733 sprintf (buf, ".startof.%s", secname);
5734 h = bfd_link_hash_lookup (link_info.hash, buf, FALSE, FALSE, TRUE);
5735 if (h != NULL && h->type == bfd_link_hash_undefined)
5737 h->type = bfd_link_hash_defined;
5739 h->u.def.section = s;
5742 sprintf (buf, ".sizeof.%s", secname);
5743 h = bfd_link_hash_lookup (link_info.hash, buf, FALSE, FALSE, TRUE);
5744 if (h != NULL && h->type == bfd_link_hash_undefined)
5746 h->type = bfd_link_hash_defined;
5747 h->u.def.value = TO_ADDR (s->size);
5748 h->u.def.section = bfd_abs_section_ptr;
5758 struct bfd_link_hash_entry *h;
5761 if ((link_info.relocatable && !link_info.gc_sections)
5762 || (link_info.shared && !link_info.executable))
5763 warn = entry_from_cmdline;
5767 /* Force the user to specify a root when generating a relocatable with
5769 if (link_info.gc_sections && link_info.relocatable
5770 && !(entry_from_cmdline || undef_from_cmdline))
5771 einfo (_("%P%F: gc-sections requires either an entry or "
5772 "an undefined symbol\n"));
5774 if (entry_symbol.name == NULL)
5776 /* No entry has been specified. Look for the default entry, but
5777 don't warn if we don't find it. */
5778 entry_symbol.name = entry_symbol_default;
5782 h = bfd_link_hash_lookup (link_info.hash, entry_symbol.name,
5783 FALSE, FALSE, TRUE);
5785 && (h->type == bfd_link_hash_defined
5786 || h->type == bfd_link_hash_defweak)
5787 && h->u.def.section->output_section != NULL)
5791 val = (h->u.def.value
5792 + bfd_get_section_vma (link_info.output_bfd,
5793 h->u.def.section->output_section)
5794 + h->u.def.section->output_offset);
5795 if (! bfd_set_start_address (link_info.output_bfd, val))
5796 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol.name);
5803 /* We couldn't find the entry symbol. Try parsing it as a
5805 val = bfd_scan_vma (entry_symbol.name, &send, 0);
5808 if (! bfd_set_start_address (link_info.output_bfd, val))
5809 einfo (_("%P%F: can't set start address\n"));
5815 /* Can't find the entry symbol, and it's not a number. Use
5816 the first address in the text section. */
5817 ts = bfd_get_section_by_name (link_info.output_bfd, entry_section);
5821 einfo (_("%P: warning: cannot find entry symbol %s;"
5822 " defaulting to %V\n"),
5824 bfd_get_section_vma (link_info.output_bfd, ts));
5825 if (!(bfd_set_start_address
5826 (link_info.output_bfd,
5827 bfd_get_section_vma (link_info.output_bfd, ts))))
5828 einfo (_("%P%F: can't set start address\n"));
5833 einfo (_("%P: warning: cannot find entry symbol %s;"
5834 " not setting start address\n"),
5841 /* This is a small function used when we want to ignore errors from
5845 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED, ...)
5847 /* Don't do anything. */
5850 /* Check that the architecture of all the input files is compatible
5851 with the output file. Also call the backend to let it do any
5852 other checking that is needed. */
5857 lang_statement_union_type *file;
5859 const bfd_arch_info_type *compatible;
5861 for (file = file_chain.head; file != NULL; file = file->input_statement.next)
5863 #ifdef ENABLE_PLUGINS
5864 /* Don't check format of files claimed by plugin. */
5865 if (file->input_statement.flags.claimed)
5867 #endif /* ENABLE_PLUGINS */
5868 input_bfd = file->input_statement.the_bfd;
5870 = bfd_arch_get_compatible (input_bfd, link_info.output_bfd,
5871 command_line.accept_unknown_input_arch);
5873 /* In general it is not possible to perform a relocatable
5874 link between differing object formats when the input
5875 file has relocations, because the relocations in the
5876 input format may not have equivalent representations in
5877 the output format (and besides BFD does not translate
5878 relocs for other link purposes than a final link). */
5879 if ((link_info.relocatable || link_info.emitrelocations)
5880 && (compatible == NULL
5881 || (bfd_get_flavour (input_bfd)
5882 != bfd_get_flavour (link_info.output_bfd)))
5883 && (bfd_get_file_flags (input_bfd) & HAS_RELOC) != 0)
5885 einfo (_("%P%F: Relocatable linking with relocations from"
5886 " format %s (%B) to format %s (%B) is not supported\n"),
5887 bfd_get_target (input_bfd), input_bfd,
5888 bfd_get_target (link_info.output_bfd), link_info.output_bfd);
5889 /* einfo with %F exits. */
5892 if (compatible == NULL)
5894 if (command_line.warn_mismatch)
5895 einfo (_("%P%X: %s architecture of input file `%B'"
5896 " is incompatible with %s output\n"),
5897 bfd_printable_name (input_bfd), input_bfd,
5898 bfd_printable_name (link_info.output_bfd));
5900 else if (bfd_count_sections (input_bfd))
5902 /* If the input bfd has no contents, it shouldn't set the
5903 private data of the output bfd. */
5905 bfd_error_handler_type pfn = NULL;
5907 /* If we aren't supposed to warn about mismatched input
5908 files, temporarily set the BFD error handler to a
5909 function which will do nothing. We still want to call
5910 bfd_merge_private_bfd_data, since it may set up
5911 information which is needed in the output file. */
5912 if (! command_line.warn_mismatch)
5913 pfn = bfd_set_error_handler (ignore_bfd_errors);
5914 if (! bfd_merge_private_bfd_data (input_bfd, link_info.output_bfd))
5916 if (command_line.warn_mismatch)
5917 einfo (_("%P%X: failed to merge target specific data"
5918 " of file %B\n"), input_bfd);
5920 if (! command_line.warn_mismatch)
5921 bfd_set_error_handler (pfn);
5926 /* Look through all the global common symbols and attach them to the
5927 correct section. The -sort-common command line switch may be used
5928 to roughly sort the entries by alignment. */
5933 if (command_line.inhibit_common_definition)
5935 if (link_info.relocatable
5936 && ! command_line.force_common_definition)
5939 if (! config.sort_common)
5940 bfd_link_hash_traverse (link_info.hash, lang_one_common, NULL);
5945 if (config.sort_common == sort_descending)
5947 for (power = 4; power > 0; power--)
5948 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
5951 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
5955 for (power = 0; power <= 4; power++)
5956 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
5958 power = (unsigned int) -1;
5959 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
5964 /* Place one common symbol in the correct section. */
5967 lang_one_common (struct bfd_link_hash_entry *h, void *info)
5969 unsigned int power_of_two;
5973 if (h->type != bfd_link_hash_common)
5977 power_of_two = h->u.c.p->alignment_power;
5979 if (config.sort_common == sort_descending
5980 && power_of_two < *(unsigned int *) info)
5982 else if (config.sort_common == sort_ascending
5983 && power_of_two > *(unsigned int *) info)
5986 section = h->u.c.p->section;
5987 if (!bfd_define_common_symbol (link_info.output_bfd, &link_info, h))
5988 einfo (_("%P%F: Could not define common symbol `%T': %E\n"),
5991 if (config.map_file != NULL)
5993 static bfd_boolean header_printed;
5998 if (! header_printed)
6000 minfo (_("\nAllocating common symbols\n"));
6001 minfo (_("Common symbol size file\n\n"));
6002 header_printed = TRUE;
6005 name = bfd_demangle (link_info.output_bfd, h->root.string,
6006 DMGL_ANSI | DMGL_PARAMS);
6009 minfo ("%s", h->root.string);
6010 len = strlen (h->root.string);
6015 len = strlen (name);
6031 if (size <= 0xffffffff)
6032 sprintf (buf, "%lx", (unsigned long) size);
6034 sprintf_vma (buf, size);
6044 minfo ("%B\n", section->owner);
6050 /* Run through the input files and ensure that every input section has
6051 somewhere to go. If one is found without a destination then create
6052 an input request and place it into the statement tree. */
6055 lang_place_orphans (void)
6057 LANG_FOR_EACH_INPUT_STATEMENT (file)
6061 for (s = file->the_bfd->sections; s != NULL; s = s->next)
6063 if (s->output_section == NULL)
6065 /* This section of the file is not attached, root
6066 around for a sensible place for it to go. */
6068 if (file->flags.just_syms)
6069 bfd_link_just_syms (file->the_bfd, s, &link_info);
6070 else if ((s->flags & SEC_EXCLUDE) != 0)
6071 s->output_section = bfd_abs_section_ptr;
6072 else if (strcmp (s->name, "COMMON") == 0)
6074 /* This is a lonely common section which must have
6075 come from an archive. We attach to the section
6076 with the wildcard. */
6077 if (! link_info.relocatable
6078 || command_line.force_common_definition)
6080 if (default_common_section == NULL)
6081 default_common_section
6082 = lang_output_section_statement_lookup (".bss", 0,
6084 lang_add_section (&default_common_section->children, s,
6085 NULL, default_common_section);
6090 const char *name = s->name;
6093 if (config.unique_orphan_sections
6094 || unique_section_p (s, NULL))
6095 constraint = SPECIAL;
6097 if (!ldemul_place_orphan (s, name, constraint))
6099 lang_output_section_statement_type *os;
6100 os = lang_output_section_statement_lookup (name,
6103 if (os->addr_tree == NULL
6104 && (link_info.relocatable
6105 || (s->flags & (SEC_LOAD | SEC_ALLOC)) == 0))
6106 os->addr_tree = exp_intop (0);
6107 lang_add_section (&os->children, s, NULL, os);
6116 lang_set_flags (lang_memory_region_type *ptr, const char *flags, int invert)
6118 flagword *ptr_flags;
6120 ptr_flags = invert ? &ptr->not_flags : &ptr->flags;
6126 *ptr_flags |= SEC_ALLOC;
6130 *ptr_flags |= SEC_READONLY;
6134 *ptr_flags |= SEC_DATA;
6138 *ptr_flags |= SEC_CODE;
6143 *ptr_flags |= SEC_LOAD;
6147 einfo (_("%P%F: invalid syntax in flags\n"));
6154 /* Call a function on each input file. This function will be called
6155 on an archive, but not on the elements. */
6158 lang_for_each_input_file (void (*func) (lang_input_statement_type *))
6160 lang_input_statement_type *f;
6162 for (f = (lang_input_statement_type *) input_file_chain.head;
6164 f = (lang_input_statement_type *) f->next_real_file)
6168 /* Call a function on each file. The function will be called on all
6169 the elements of an archive which are included in the link, but will
6170 not be called on the archive file itself. */
6173 lang_for_each_file (void (*func) (lang_input_statement_type *))
6175 LANG_FOR_EACH_INPUT_STATEMENT (f)
6182 ldlang_add_file (lang_input_statement_type *entry)
6184 lang_statement_append (&file_chain,
6185 (lang_statement_union_type *) entry,
6188 /* The BFD linker needs to have a list of all input BFDs involved in
6190 ASSERT (entry->the_bfd->link.next == NULL);
6191 ASSERT (entry->the_bfd != link_info.output_bfd);
6193 *link_info.input_bfds_tail = entry->the_bfd;
6194 link_info.input_bfds_tail = &entry->the_bfd->link.next;
6195 entry->the_bfd->usrdata = entry;
6196 bfd_set_gp_size (entry->the_bfd, g_switch_value);
6198 /* Look through the sections and check for any which should not be
6199 included in the link. We need to do this now, so that we can
6200 notice when the backend linker tries to report multiple
6201 definition errors for symbols which are in sections we aren't
6202 going to link. FIXME: It might be better to entirely ignore
6203 symbols which are defined in sections which are going to be
6204 discarded. This would require modifying the backend linker for
6205 each backend which might set the SEC_LINK_ONCE flag. If we do
6206 this, we should probably handle SEC_EXCLUDE in the same way. */
6208 bfd_map_over_sections (entry->the_bfd, section_already_linked, entry);
6212 lang_add_output (const char *name, int from_script)
6214 /* Make -o on command line override OUTPUT in script. */
6215 if (!had_output_filename || !from_script)
6217 output_filename = name;
6218 had_output_filename = TRUE;
6231 for (l = 0; l < 32; l++)
6233 if (i >= (unsigned int) x)
6241 lang_output_section_statement_type *
6242 lang_enter_output_section_statement (const char *output_section_statement_name,
6243 etree_type *address_exp,
6244 enum section_type sectype,
6246 etree_type *subalign,
6249 int align_with_input)
6251 lang_output_section_statement_type *os;
6253 os = lang_output_section_statement_lookup (output_section_statement_name,
6255 current_section = os;
6257 if (os->addr_tree == NULL)
6259 os->addr_tree = address_exp;
6261 os->sectype = sectype;
6262 if (sectype != noload_section)
6263 os->flags = SEC_NO_FLAGS;
6265 os->flags = SEC_NEVER_LOAD;
6266 os->block_value = 1;
6268 /* Make next things chain into subchain of this. */
6269 push_stat_ptr (&os->children);
6271 os->align_lma_with_input = align_with_input == ALIGN_WITH_INPUT;
6272 if (os->align_lma_with_input && align != NULL)
6273 einfo (_("%F%P:%S: error: align with input and explicit align specified\n"), NULL);
6275 os->subsection_alignment =
6276 topower (exp_get_value_int (subalign, -1, "subsection alignment"));
6277 os->section_alignment =
6278 topower (exp_get_value_int (align, -1, "section alignment"));
6280 os->load_base = ebase;
6287 lang_output_statement_type *new_stmt;
6289 new_stmt = new_stat (lang_output_statement, stat_ptr);
6290 new_stmt->name = output_filename;
6294 /* Reset the current counters in the regions. */
6297 lang_reset_memory_regions (void)
6299 lang_memory_region_type *p = lang_memory_region_list;
6301 lang_output_section_statement_type *os;
6303 for (p = lang_memory_region_list; p != NULL; p = p->next)
6305 p->current = p->origin;
6309 for (os = &lang_output_section_statement.head->output_section_statement;
6313 os->processed_vma = FALSE;
6314 os->processed_lma = FALSE;
6317 for (o = link_info.output_bfd->sections; o != NULL; o = o->next)
6319 /* Save the last size for possible use by bfd_relax_section. */
6320 o->rawsize = o->size;
6325 /* Worker for lang_gc_sections_1. */
6328 gc_section_callback (lang_wild_statement_type *ptr,
6329 struct wildcard_list *sec ATTRIBUTE_UNUSED,
6331 struct flag_info *sflag_info ATTRIBUTE_UNUSED,
6332 lang_input_statement_type *file ATTRIBUTE_UNUSED,
6333 void *data ATTRIBUTE_UNUSED)
6335 /* If the wild pattern was marked KEEP, the member sections
6336 should be as well. */
6337 if (ptr->keep_sections)
6338 section->flags |= SEC_KEEP;
6341 /* Iterate over sections marking them against GC. */
6344 lang_gc_sections_1 (lang_statement_union_type *s)
6346 for (; s != NULL; s = s->header.next)
6348 switch (s->header.type)
6350 case lang_wild_statement_enum:
6351 walk_wild (&s->wild_statement, gc_section_callback, NULL);
6353 case lang_constructors_statement_enum:
6354 lang_gc_sections_1 (constructor_list.head);
6356 case lang_output_section_statement_enum:
6357 lang_gc_sections_1 (s->output_section_statement.children.head);
6359 case lang_group_statement_enum:
6360 lang_gc_sections_1 (s->group_statement.children.head);
6369 lang_gc_sections (void)
6371 /* Keep all sections so marked in the link script. */
6373 lang_gc_sections_1 (statement_list.head);
6375 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
6376 the special case of debug info. (See bfd/stabs.c)
6377 Twiddle the flag here, to simplify later linker code. */
6378 if (link_info.relocatable)
6380 LANG_FOR_EACH_INPUT_STATEMENT (f)
6383 #ifdef ENABLE_PLUGINS
6384 if (f->flags.claimed)
6387 for (sec = f->the_bfd->sections; sec != NULL; sec = sec->next)
6388 if ((sec->flags & SEC_DEBUGGING) == 0)
6389 sec->flags &= ~SEC_EXCLUDE;
6393 if (link_info.gc_sections)
6394 bfd_gc_sections (link_info.output_bfd, &link_info);
6397 /* Worker for lang_find_relro_sections_1. */
6400 find_relro_section_callback (lang_wild_statement_type *ptr ATTRIBUTE_UNUSED,
6401 struct wildcard_list *sec ATTRIBUTE_UNUSED,
6403 struct flag_info *sflag_info ATTRIBUTE_UNUSED,
6404 lang_input_statement_type *file ATTRIBUTE_UNUSED,
6407 /* Discarded, excluded and ignored sections effectively have zero
6409 if (section->output_section != NULL
6410 && section->output_section->owner == link_info.output_bfd
6411 && (section->output_section->flags & SEC_EXCLUDE) == 0
6412 && !IGNORE_SECTION (section)
6413 && section->size != 0)
6415 bfd_boolean *has_relro_section = (bfd_boolean *) data;
6416 *has_relro_section = TRUE;
6420 /* Iterate over sections for relro sections. */
6423 lang_find_relro_sections_1 (lang_statement_union_type *s,
6424 bfd_boolean *has_relro_section)
6426 if (*has_relro_section)
6429 for (; s != NULL; s = s->header.next)
6431 if (s == expld.dataseg.relro_end_stat)
6434 switch (s->header.type)
6436 case lang_wild_statement_enum:
6437 walk_wild (&s->wild_statement,
6438 find_relro_section_callback,
6441 case lang_constructors_statement_enum:
6442 lang_find_relro_sections_1 (constructor_list.head,
6445 case lang_output_section_statement_enum:
6446 lang_find_relro_sections_1 (s->output_section_statement.children.head,
6449 case lang_group_statement_enum:
6450 lang_find_relro_sections_1 (s->group_statement.children.head,
6460 lang_find_relro_sections (void)
6462 bfd_boolean has_relro_section = FALSE;
6464 /* Check all sections in the link script. */
6466 lang_find_relro_sections_1 (expld.dataseg.relro_start_stat,
6467 &has_relro_section);
6469 if (!has_relro_section)
6470 link_info.relro = FALSE;
6473 /* Relax all sections until bfd_relax_section gives up. */
6476 lang_relax_sections (bfd_boolean need_layout)
6478 if (RELAXATION_ENABLED)
6480 /* We may need more than one relaxation pass. */
6481 int i = link_info.relax_pass;
6483 /* The backend can use it to determine the current pass. */
6484 link_info.relax_pass = 0;
6488 /* Keep relaxing until bfd_relax_section gives up. */
6489 bfd_boolean relax_again;
6491 link_info.relax_trip = -1;
6494 link_info.relax_trip++;
6496 /* Note: pe-dll.c does something like this also. If you find
6497 you need to change this code, you probably need to change
6498 pe-dll.c also. DJ */
6500 /* Do all the assignments with our current guesses as to
6502 lang_do_assignments (lang_assigning_phase_enum);
6504 /* We must do this after lang_do_assignments, because it uses
6506 lang_reset_memory_regions ();
6508 /* Perform another relax pass - this time we know where the
6509 globals are, so can make a better guess. */
6510 relax_again = FALSE;
6511 lang_size_sections (&relax_again, FALSE);
6513 while (relax_again);
6515 link_info.relax_pass++;
6522 /* Final extra sizing to report errors. */
6523 lang_do_assignments (lang_assigning_phase_enum);
6524 lang_reset_memory_regions ();
6525 lang_size_sections (NULL, TRUE);
6529 #ifdef ENABLE_PLUGINS
6530 /* Find the insert point for the plugin's replacement files. We
6531 place them after the first claimed real object file, or if the
6532 first claimed object is an archive member, after the last real
6533 object file immediately preceding the archive. In the event
6534 no objects have been claimed at all, we return the first dummy
6535 object file on the list as the insert point; that works, but
6536 the callee must be careful when relinking the file_chain as it
6537 is not actually on that chain, only the statement_list and the
6538 input_file list; in that case, the replacement files must be
6539 inserted at the head of the file_chain. */
6541 static lang_input_statement_type *
6542 find_replacements_insert_point (void)
6544 lang_input_statement_type *claim1, *lastobject;
6545 lastobject = &input_file_chain.head->input_statement;
6546 for (claim1 = &file_chain.head->input_statement;
6548 claim1 = &claim1->next->input_statement)
6550 if (claim1->flags.claimed)
6551 return claim1->flags.claim_archive ? lastobject : claim1;
6552 /* Update lastobject if this is a real object file. */
6553 if (claim1->the_bfd && (claim1->the_bfd->my_archive == NULL))
6554 lastobject = claim1;
6556 /* No files were claimed by the plugin. Choose the last object
6557 file found on the list (maybe the first, dummy entry) as the
6562 /* Insert SRCLIST into DESTLIST after given element by chaining
6563 on FIELD as the next-pointer. (Counterintuitively does not need
6564 a pointer to the actual after-node itself, just its chain field.) */
6567 lang_list_insert_after (lang_statement_list_type *destlist,
6568 lang_statement_list_type *srclist,
6569 lang_statement_union_type **field)
6571 *(srclist->tail) = *field;
6572 *field = srclist->head;
6573 if (destlist->tail == field)
6574 destlist->tail = srclist->tail;
6577 /* Detach new nodes added to DESTLIST since the time ORIGLIST
6578 was taken as a copy of it and leave them in ORIGLIST. */
6581 lang_list_remove_tail (lang_statement_list_type *destlist,
6582 lang_statement_list_type *origlist)
6584 union lang_statement_union **savetail;
6585 /* Check that ORIGLIST really is an earlier state of DESTLIST. */
6586 ASSERT (origlist->head == destlist->head);
6587 savetail = origlist->tail;
6588 origlist->head = *(savetail);
6589 origlist->tail = destlist->tail;
6590 destlist->tail = savetail;
6593 #endif /* ENABLE_PLUGINS */
6598 /* Finalize dynamic list. */
6599 if (link_info.dynamic_list)
6600 lang_finalize_version_expr_head (&link_info.dynamic_list->head);
6602 current_target = default_target;
6604 /* Open the output file. */
6605 lang_for_each_statement (ldlang_open_output);
6608 ldemul_create_output_section_statements ();
6610 /* Add to the hash table all undefineds on the command line. */
6611 lang_place_undefineds ();
6613 if (!bfd_section_already_linked_table_init ())
6614 einfo (_("%P%F: Failed to create hash table\n"));
6616 /* Create a bfd for each input file. */
6617 current_target = default_target;
6618 open_input_bfds (statement_list.head, OPEN_BFD_NORMAL);
6620 #ifdef ENABLE_PLUGINS
6621 if (plugin_active_plugins_p ())
6623 lang_statement_list_type added;
6624 lang_statement_list_type files, inputfiles;
6626 /* Now all files are read, let the plugin(s) decide if there
6627 are any more to be added to the link before we call the
6628 emulation's after_open hook. We create a private list of
6629 input statements for this purpose, which we will eventually
6630 insert into the global statment list after the first claimed
6633 /* We need to manipulate all three chains in synchrony. */
6635 inputfiles = input_file_chain;
6636 if (plugin_call_all_symbols_read ())
6637 einfo (_("%P%F: %s: plugin reported error after all symbols read\n"),
6638 plugin_error_plugin ());
6639 /* Open any newly added files, updating the file chains. */
6640 link_info.loading_lto_outputs = TRUE;
6641 open_input_bfds (*added.tail, OPEN_BFD_NORMAL);
6642 /* Restore the global list pointer now they have all been added. */
6643 lang_list_remove_tail (stat_ptr, &added);
6644 /* And detach the fresh ends of the file lists. */
6645 lang_list_remove_tail (&file_chain, &files);
6646 lang_list_remove_tail (&input_file_chain, &inputfiles);
6647 /* Were any new files added? */
6648 if (added.head != NULL)
6650 /* If so, we will insert them into the statement list immediately
6651 after the first input file that was claimed by the plugin. */
6652 plugin_insert = find_replacements_insert_point ();
6653 /* If a plugin adds input files without having claimed any, we
6654 don't really have a good idea where to place them. Just putting
6655 them at the start or end of the list is liable to leave them
6656 outside the crtbegin...crtend range. */
6657 ASSERT (plugin_insert != NULL);
6658 /* Splice the new statement list into the old one. */
6659 lang_list_insert_after (stat_ptr, &added,
6660 &plugin_insert->header.next);
6661 /* Likewise for the file chains. */
6662 lang_list_insert_after (&input_file_chain, &inputfiles,
6663 &plugin_insert->next_real_file);
6664 /* We must be careful when relinking file_chain; we may need to
6665 insert the new files at the head of the list if the insert
6666 point chosen is the dummy first input file. */
6667 if (plugin_insert->filename)
6668 lang_list_insert_after (&file_chain, &files, &plugin_insert->next);
6670 lang_list_insert_after (&file_chain, &files, &file_chain.head);
6672 /* Rescan archives in case new undefined symbols have appeared. */
6673 open_input_bfds (statement_list.head, OPEN_BFD_RESCAN);
6676 #endif /* ENABLE_PLUGINS */
6678 link_info.gc_sym_list = &entry_symbol;
6679 if (entry_symbol.name == NULL)
6680 link_info.gc_sym_list = ldlang_undef_chain_list_head;
6682 ldemul_after_open ();
6683 if (config.map_file != NULL)
6684 lang_print_asneeded ();
6686 bfd_section_already_linked_table_free ();
6688 /* Make sure that we're not mixing architectures. We call this
6689 after all the input files have been opened, but before we do any
6690 other processing, so that any operations merge_private_bfd_data
6691 does on the output file will be known during the rest of the
6695 /* Handle .exports instead of a version script if we're told to do so. */
6696 if (command_line.version_exports_section)
6697 lang_do_version_exports_section ();
6699 /* Build all sets based on the information gathered from the input
6701 ldctor_build_sets ();
6703 /* PR 13683: We must rerun the assignments prior to running garbage
6704 collection in order to make sure that all symbol aliases are resolved. */
6705 lang_do_assignments (lang_mark_phase_enum);
6706 expld.phase = lang_first_phase_enum;
6708 /* Size up the common data. */
6711 /* Remove unreferenced sections if asked to. */
6712 lang_gc_sections ();
6714 /* Update wild statements. */
6715 update_wild_statements (statement_list.head);
6717 /* Run through the contours of the script and attach input sections
6718 to the correct output sections. */
6719 lang_statement_iteration++;
6720 map_input_to_output_sections (statement_list.head, NULL, NULL);
6722 process_insert_statements ();
6724 /* Find any sections not attached explicitly and handle them. */
6725 lang_place_orphans ();
6727 if (! link_info.relocatable)
6731 /* Merge SEC_MERGE sections. This has to be done after GC of
6732 sections, so that GCed sections are not merged, but before
6733 assigning dynamic symbols, since removing whole input sections
6735 bfd_merge_sections (link_info.output_bfd, &link_info);
6737 /* Look for a text section and set the readonly attribute in it. */
6738 found = bfd_get_section_by_name (link_info.output_bfd, ".text");
6742 if (config.text_read_only)
6743 found->flags |= SEC_READONLY;
6745 found->flags &= ~SEC_READONLY;
6749 /* Do anything special before sizing sections. This is where ELF
6750 and other back-ends size dynamic sections. */
6751 ldemul_before_allocation ();
6753 /* We must record the program headers before we try to fix the
6754 section positions, since they will affect SIZEOF_HEADERS. */
6755 lang_record_phdrs ();
6757 /* Check relro sections. */
6758 if (link_info.relro && ! link_info.relocatable)
6759 lang_find_relro_sections ();
6761 /* Size up the sections. */
6762 lang_size_sections (NULL, ! RELAXATION_ENABLED);
6764 /* See if anything special should be done now we know how big
6765 everything is. This is where relaxation is done. */
6766 ldemul_after_allocation ();
6768 /* Fix any .startof. or .sizeof. symbols. */
6769 lang_set_startof ();
6771 /* Do all the assignments, now that we know the final resting places
6772 of all the symbols. */
6773 lang_do_assignments (lang_final_phase_enum);
6777 /* Make sure that the section addresses make sense. */
6778 if (command_line.check_section_addresses)
6779 lang_check_section_addresses ();
6784 /* EXPORTED TO YACC */
6787 lang_add_wild (struct wildcard_spec *filespec,
6788 struct wildcard_list *section_list,
6789 bfd_boolean keep_sections)
6791 struct wildcard_list *curr, *next;
6792 lang_wild_statement_type *new_stmt;
6794 /* Reverse the list as the parser puts it back to front. */
6795 for (curr = section_list, section_list = NULL;
6797 section_list = curr, curr = next)
6799 if (curr->spec.name != NULL && strcmp (curr->spec.name, "COMMON") == 0)
6800 placed_commons = TRUE;
6803 curr->next = section_list;
6806 if (filespec != NULL && filespec->name != NULL)
6808 if (strcmp (filespec->name, "*") == 0)
6809 filespec->name = NULL;
6810 else if (! wildcardp (filespec->name))
6811 lang_has_input_file = TRUE;
6814 new_stmt = new_stat (lang_wild_statement, stat_ptr);
6815 new_stmt->filename = NULL;
6816 new_stmt->filenames_sorted = FALSE;
6817 new_stmt->section_flag_list = NULL;
6818 if (filespec != NULL)
6820 new_stmt->filename = filespec->name;
6821 new_stmt->filenames_sorted = filespec->sorted == by_name;
6822 new_stmt->section_flag_list = filespec->section_flag_list;
6824 new_stmt->section_list = section_list;
6825 new_stmt->keep_sections = keep_sections;
6826 lang_list_init (&new_stmt->children);
6827 analyze_walk_wild_section_handler (new_stmt);
6831 lang_section_start (const char *name, etree_type *address,
6832 const segment_type *segment)
6834 lang_address_statement_type *ad;
6836 ad = new_stat (lang_address_statement, stat_ptr);
6837 ad->section_name = name;
6838 ad->address = address;
6839 ad->segment = segment;
6842 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
6843 because of a -e argument on the command line, or zero if this is
6844 called by ENTRY in a linker script. Command line arguments take
6848 lang_add_entry (const char *name, bfd_boolean cmdline)
6850 if (entry_symbol.name == NULL
6852 || ! entry_from_cmdline)
6854 entry_symbol.name = name;
6855 entry_from_cmdline = cmdline;
6859 /* Set the default start symbol to NAME. .em files should use this,
6860 not lang_add_entry, to override the use of "start" if neither the
6861 linker script nor the command line specifies an entry point. NAME
6862 must be permanently allocated. */
6864 lang_default_entry (const char *name)
6866 entry_symbol_default = name;
6870 lang_add_target (const char *name)
6872 lang_target_statement_type *new_stmt;
6874 new_stmt = new_stat (lang_target_statement, stat_ptr);
6875 new_stmt->target = name;
6879 lang_add_map (const char *name)
6886 map_option_f = TRUE;
6894 lang_add_fill (fill_type *fill)
6896 lang_fill_statement_type *new_stmt;
6898 new_stmt = new_stat (lang_fill_statement, stat_ptr);
6899 new_stmt->fill = fill;
6903 lang_add_data (int type, union etree_union *exp)
6905 lang_data_statement_type *new_stmt;
6907 new_stmt = new_stat (lang_data_statement, stat_ptr);
6908 new_stmt->exp = exp;
6909 new_stmt->type = type;
6912 /* Create a new reloc statement. RELOC is the BFD relocation type to
6913 generate. HOWTO is the corresponding howto structure (we could
6914 look this up, but the caller has already done so). SECTION is the
6915 section to generate a reloc against, or NAME is the name of the
6916 symbol to generate a reloc against. Exactly one of SECTION and
6917 NAME must be NULL. ADDEND is an expression for the addend. */
6920 lang_add_reloc (bfd_reloc_code_real_type reloc,
6921 reloc_howto_type *howto,
6924 union etree_union *addend)
6926 lang_reloc_statement_type *p = new_stat (lang_reloc_statement, stat_ptr);
6930 p->section = section;
6932 p->addend_exp = addend;
6934 p->addend_value = 0;
6935 p->output_section = NULL;
6936 p->output_offset = 0;
6939 lang_assignment_statement_type *
6940 lang_add_assignment (etree_type *exp)
6942 lang_assignment_statement_type *new_stmt;
6944 new_stmt = new_stat (lang_assignment_statement, stat_ptr);
6945 new_stmt->exp = exp;
6950 lang_add_attribute (enum statement_enum attribute)
6952 new_statement (attribute, sizeof (lang_statement_header_type), stat_ptr);
6956 lang_startup (const char *name)
6958 if (first_file->filename != NULL)
6960 einfo (_("%P%F: multiple STARTUP files\n"));
6962 first_file->filename = name;
6963 first_file->local_sym_name = name;
6964 first_file->flags.real = TRUE;
6968 lang_float (bfd_boolean maybe)
6970 lang_float_flag = maybe;
6974 /* Work out the load- and run-time regions from a script statement, and
6975 store them in *LMA_REGION and *REGION respectively.
6977 MEMSPEC is the name of the run-time region, or the value of
6978 DEFAULT_MEMORY_REGION if the statement didn't specify one.
6979 LMA_MEMSPEC is the name of the load-time region, or null if the
6980 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
6981 had an explicit load address.
6983 It is an error to specify both a load region and a load address. */
6986 lang_get_regions (lang_memory_region_type **region,
6987 lang_memory_region_type **lma_region,
6988 const char *memspec,
6989 const char *lma_memspec,
6990 bfd_boolean have_lma,
6991 bfd_boolean have_vma)
6993 *lma_region = lang_memory_region_lookup (lma_memspec, FALSE);
6995 /* If no runtime region or VMA has been specified, but the load region
6996 has been specified, then use the load region for the runtime region
6998 if (lma_memspec != NULL
7000 && strcmp (memspec, DEFAULT_MEMORY_REGION) == 0)
7001 *region = *lma_region;
7003 *region = lang_memory_region_lookup (memspec, FALSE);
7005 if (have_lma && lma_memspec != 0)
7006 einfo (_("%X%P:%S: section has both a load address and a load region\n"),
7011 lang_leave_output_section_statement (fill_type *fill, const char *memspec,
7012 lang_output_section_phdr_list *phdrs,
7013 const char *lma_memspec)
7015 lang_get_regions (¤t_section->region,
7016 ¤t_section->lma_region,
7017 memspec, lma_memspec,
7018 current_section->load_base != NULL,
7019 current_section->addr_tree != NULL);
7021 /* If this section has no load region or base, but uses the same
7022 region as the previous section, then propagate the previous
7023 section's load region. */
7025 if (current_section->lma_region == NULL
7026 && current_section->load_base == NULL
7027 && current_section->addr_tree == NULL
7028 && current_section->region == current_section->prev->region)
7029 current_section->lma_region = current_section->prev->lma_region;
7031 current_section->fill = fill;
7032 current_section->phdrs = phdrs;
7037 lang_statement_append (lang_statement_list_type *list,
7038 lang_statement_union_type *element,
7039 lang_statement_union_type **field)
7041 *(list->tail) = element;
7045 /* Set the output format type. -oformat overrides scripts. */
7048 lang_add_output_format (const char *format,
7053 if (output_target == NULL || !from_script)
7055 if (command_line.endian == ENDIAN_BIG
7058 else if (command_line.endian == ENDIAN_LITTLE
7062 output_target = format;
7067 lang_add_insert (const char *where, int is_before)
7069 lang_insert_statement_type *new_stmt;
7071 new_stmt = new_stat (lang_insert_statement, stat_ptr);
7072 new_stmt->where = where;
7073 new_stmt->is_before = is_before;
7074 saved_script_handle = previous_script_handle;
7077 /* Enter a group. This creates a new lang_group_statement, and sets
7078 stat_ptr to build new statements within the group. */
7081 lang_enter_group (void)
7083 lang_group_statement_type *g;
7085 g = new_stat (lang_group_statement, stat_ptr);
7086 lang_list_init (&g->children);
7087 push_stat_ptr (&g->children);
7090 /* Leave a group. This just resets stat_ptr to start writing to the
7091 regular list of statements again. Note that this will not work if
7092 groups can occur inside anything else which can adjust stat_ptr,
7093 but currently they can't. */
7096 lang_leave_group (void)
7101 /* Add a new program header. This is called for each entry in a PHDRS
7102 command in a linker script. */
7105 lang_new_phdr (const char *name,
7107 bfd_boolean filehdr,
7112 struct lang_phdr *n, **pp;
7115 n = (struct lang_phdr *) stat_alloc (sizeof (struct lang_phdr));
7118 n->type = exp_get_value_int (type, 0, "program header type");
7119 n->filehdr = filehdr;
7124 hdrs = n->type == 1 && (phdrs || filehdr);
7126 for (pp = &lang_phdr_list; *pp != NULL; pp = &(*pp)->next)
7129 && !((*pp)->filehdr || (*pp)->phdrs))
7131 einfo (_("%X%P:%S: PHDRS and FILEHDR are not supported"
7132 " when prior PT_LOAD headers lack them\n"), NULL);
7139 /* Record the program header information in the output BFD. FIXME: We
7140 should not be calling an ELF specific function here. */
7143 lang_record_phdrs (void)
7147 lang_output_section_phdr_list *last;
7148 struct lang_phdr *l;
7149 lang_output_section_statement_type *os;
7152 secs = (asection **) xmalloc (alc * sizeof (asection *));
7155 for (l = lang_phdr_list; l != NULL; l = l->next)
7162 for (os = &lang_output_section_statement.head->output_section_statement;
7166 lang_output_section_phdr_list *pl;
7168 if (os->constraint < 0)
7176 if (os->sectype == noload_section
7177 || os->bfd_section == NULL
7178 || (os->bfd_section->flags & SEC_ALLOC) == 0)
7181 /* Don't add orphans to PT_INTERP header. */
7187 lang_output_section_statement_type * tmp_os;
7189 /* If we have not run across a section with a program
7190 header assigned to it yet, then scan forwards to find
7191 one. This prevents inconsistencies in the linker's
7192 behaviour when a script has specified just a single
7193 header and there are sections in that script which are
7194 not assigned to it, and which occur before the first
7195 use of that header. See here for more details:
7196 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
7197 for (tmp_os = os; tmp_os; tmp_os = tmp_os->next)
7200 last = tmp_os->phdrs;
7204 einfo (_("%F%P: no sections assigned to phdrs\n"));
7209 if (os->bfd_section == NULL)
7212 for (; pl != NULL; pl = pl->next)
7214 if (strcmp (pl->name, l->name) == 0)
7219 secs = (asection **) xrealloc (secs,
7220 alc * sizeof (asection *));
7222 secs[c] = os->bfd_section;
7229 if (l->flags == NULL)
7232 flags = exp_get_vma (l->flags, 0, "phdr flags");
7237 at = exp_get_vma (l->at, 0, "phdr load address");
7239 if (! bfd_record_phdr (link_info.output_bfd, l->type,
7240 l->flags != NULL, flags, l->at != NULL,
7241 at, l->filehdr, l->phdrs, c, secs))
7242 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
7247 /* Make sure all the phdr assignments succeeded. */
7248 for (os = &lang_output_section_statement.head->output_section_statement;
7252 lang_output_section_phdr_list *pl;
7254 if (os->constraint < 0
7255 || os->bfd_section == NULL)
7258 for (pl = os->phdrs;
7261 if (! pl->used && strcmp (pl->name, "NONE") != 0)
7262 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
7263 os->name, pl->name);
7267 /* Record a list of sections which may not be cross referenced. */
7270 lang_add_nocrossref (lang_nocrossref_type *l)
7272 struct lang_nocrossrefs *n;
7274 n = (struct lang_nocrossrefs *) xmalloc (sizeof *n);
7275 n->next = nocrossref_list;
7277 nocrossref_list = n;
7279 /* Set notice_all so that we get informed about all symbols. */
7280 link_info.notice_all = TRUE;
7283 /* Overlay handling. We handle overlays with some static variables. */
7285 /* The overlay virtual address. */
7286 static etree_type *overlay_vma;
7287 /* And subsection alignment. */
7288 static etree_type *overlay_subalign;
7290 /* An expression for the maximum section size seen so far. */
7291 static etree_type *overlay_max;
7293 /* A list of all the sections in this overlay. */
7295 struct overlay_list {
7296 struct overlay_list *next;
7297 lang_output_section_statement_type *os;
7300 static struct overlay_list *overlay_list;
7302 /* Start handling an overlay. */
7305 lang_enter_overlay (etree_type *vma_expr, etree_type *subalign)
7307 /* The grammar should prevent nested overlays from occurring. */
7308 ASSERT (overlay_vma == NULL
7309 && overlay_subalign == NULL
7310 && overlay_max == NULL);
7312 overlay_vma = vma_expr;
7313 overlay_subalign = subalign;
7316 /* Start a section in an overlay. We handle this by calling
7317 lang_enter_output_section_statement with the correct VMA.
7318 lang_leave_overlay sets up the LMA and memory regions. */
7321 lang_enter_overlay_section (const char *name)
7323 struct overlay_list *n;
7326 lang_enter_output_section_statement (name, overlay_vma, overlay_section,
7327 0, overlay_subalign, 0, 0, 0);
7329 /* If this is the first section, then base the VMA of future
7330 sections on this one. This will work correctly even if `.' is
7331 used in the addresses. */
7332 if (overlay_list == NULL)
7333 overlay_vma = exp_nameop (ADDR, name);
7335 /* Remember the section. */
7336 n = (struct overlay_list *) xmalloc (sizeof *n);
7337 n->os = current_section;
7338 n->next = overlay_list;
7341 size = exp_nameop (SIZEOF, name);
7343 /* Arrange to work out the maximum section end address. */
7344 if (overlay_max == NULL)
7347 overlay_max = exp_binop (MAX_K, overlay_max, size);
7350 /* Finish a section in an overlay. There isn't any special to do
7354 lang_leave_overlay_section (fill_type *fill,
7355 lang_output_section_phdr_list *phdrs)
7362 name = current_section->name;
7364 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
7365 region and that no load-time region has been specified. It doesn't
7366 really matter what we say here, since lang_leave_overlay will
7368 lang_leave_output_section_statement (fill, DEFAULT_MEMORY_REGION, phdrs, 0);
7370 /* Define the magic symbols. */
7372 clean = (char *) xmalloc (strlen (name) + 1);
7374 for (s1 = name; *s1 != '\0'; s1++)
7375 if (ISALNUM (*s1) || *s1 == '_')
7379 buf = (char *) xmalloc (strlen (clean) + sizeof "__load_start_");
7380 sprintf (buf, "__load_start_%s", clean);
7381 lang_add_assignment (exp_provide (buf,
7382 exp_nameop (LOADADDR, name),
7385 buf = (char *) xmalloc (strlen (clean) + sizeof "__load_stop_");
7386 sprintf (buf, "__load_stop_%s", clean);
7387 lang_add_assignment (exp_provide (buf,
7389 exp_nameop (LOADADDR, name),
7390 exp_nameop (SIZEOF, name)),
7396 /* Finish an overlay. If there are any overlay wide settings, this
7397 looks through all the sections in the overlay and sets them. */
7400 lang_leave_overlay (etree_type *lma_expr,
7403 const char *memspec,
7404 lang_output_section_phdr_list *phdrs,
7405 const char *lma_memspec)
7407 lang_memory_region_type *region;
7408 lang_memory_region_type *lma_region;
7409 struct overlay_list *l;
7410 lang_nocrossref_type *nocrossref;
7412 lang_get_regions (®ion, &lma_region,
7413 memspec, lma_memspec,
7414 lma_expr != NULL, FALSE);
7418 /* After setting the size of the last section, set '.' to end of the
7420 if (overlay_list != NULL)
7422 overlay_list->os->update_dot = 1;
7423 overlay_list->os->update_dot_tree
7424 = exp_assign (".", exp_binop ('+', overlay_vma, overlay_max), FALSE);
7430 struct overlay_list *next;
7432 if (fill != NULL && l->os->fill == NULL)
7435 l->os->region = region;
7436 l->os->lma_region = lma_region;
7438 /* The first section has the load address specified in the
7439 OVERLAY statement. The rest are worked out from that.
7440 The base address is not needed (and should be null) if
7441 an LMA region was specified. */
7444 l->os->load_base = lma_expr;
7445 l->os->sectype = normal_section;
7447 if (phdrs != NULL && l->os->phdrs == NULL)
7448 l->os->phdrs = phdrs;
7452 lang_nocrossref_type *nc;
7454 nc = (lang_nocrossref_type *) xmalloc (sizeof *nc);
7455 nc->name = l->os->name;
7456 nc->next = nocrossref;
7465 if (nocrossref != NULL)
7466 lang_add_nocrossref (nocrossref);
7469 overlay_list = NULL;
7473 /* Version handling. This is only useful for ELF. */
7475 /* If PREV is NULL, return first version pattern matching particular symbol.
7476 If PREV is non-NULL, return first version pattern matching particular
7477 symbol after PREV (previously returned by lang_vers_match). */
7479 static struct bfd_elf_version_expr *
7480 lang_vers_match (struct bfd_elf_version_expr_head *head,
7481 struct bfd_elf_version_expr *prev,
7485 const char *cxx_sym = sym;
7486 const char *java_sym = sym;
7487 struct bfd_elf_version_expr *expr = NULL;
7488 enum demangling_styles curr_style;
7490 curr_style = CURRENT_DEMANGLING_STYLE;
7491 cplus_demangle_set_style (no_demangling);
7492 c_sym = bfd_demangle (link_info.output_bfd, sym, DMGL_NO_OPTS);
7495 cplus_demangle_set_style (curr_style);
7497 if (head->mask & BFD_ELF_VERSION_CXX_TYPE)
7499 cxx_sym = bfd_demangle (link_info.output_bfd, sym,
7500 DMGL_PARAMS | DMGL_ANSI);
7504 if (head->mask & BFD_ELF_VERSION_JAVA_TYPE)
7506 java_sym = bfd_demangle (link_info.output_bfd, sym, DMGL_JAVA);
7511 if (head->htab && (prev == NULL || prev->literal))
7513 struct bfd_elf_version_expr e;
7515 switch (prev ? prev->mask : 0)
7518 if (head->mask & BFD_ELF_VERSION_C_TYPE)
7521 expr = (struct bfd_elf_version_expr *)
7522 htab_find ((htab_t) head->htab, &e);
7523 while (expr && strcmp (expr->pattern, c_sym) == 0)
7524 if (expr->mask == BFD_ELF_VERSION_C_TYPE)
7530 case BFD_ELF_VERSION_C_TYPE:
7531 if (head->mask & BFD_ELF_VERSION_CXX_TYPE)
7533 e.pattern = cxx_sym;
7534 expr = (struct bfd_elf_version_expr *)
7535 htab_find ((htab_t) head->htab, &e);
7536 while (expr && strcmp (expr->pattern, cxx_sym) == 0)
7537 if (expr->mask == BFD_ELF_VERSION_CXX_TYPE)
7543 case BFD_ELF_VERSION_CXX_TYPE:
7544 if (head->mask & BFD_ELF_VERSION_JAVA_TYPE)
7546 e.pattern = java_sym;
7547 expr = (struct bfd_elf_version_expr *)
7548 htab_find ((htab_t) head->htab, &e);
7549 while (expr && strcmp (expr->pattern, java_sym) == 0)
7550 if (expr->mask == BFD_ELF_VERSION_JAVA_TYPE)
7561 /* Finally, try the wildcards. */
7562 if (prev == NULL || prev->literal)
7563 expr = head->remaining;
7566 for (; expr; expr = expr->next)
7573 if (expr->pattern[0] == '*' && expr->pattern[1] == '\0')
7576 if (expr->mask == BFD_ELF_VERSION_JAVA_TYPE)
7578 else if (expr->mask == BFD_ELF_VERSION_CXX_TYPE)
7582 if (fnmatch (expr->pattern, s, 0) == 0)
7588 free ((char *) c_sym);
7590 free ((char *) cxx_sym);
7591 if (java_sym != sym)
7592 free ((char *) java_sym);
7596 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
7597 return a pointer to the symbol name with any backslash quotes removed. */
7600 realsymbol (const char *pattern)
7603 bfd_boolean changed = FALSE, backslash = FALSE;
7604 char *s, *symbol = (char *) xmalloc (strlen (pattern) + 1);
7606 for (p = pattern, s = symbol; *p != '\0'; ++p)
7608 /* It is a glob pattern only if there is no preceding
7612 /* Remove the preceding backslash. */
7619 if (*p == '?' || *p == '*' || *p == '[')
7626 backslash = *p == '\\';
7642 /* This is called for each variable name or match expression. NEW_NAME is
7643 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
7644 pattern to be matched against symbol names. */
7646 struct bfd_elf_version_expr *
7647 lang_new_vers_pattern (struct bfd_elf_version_expr *orig,
7648 const char *new_name,
7650 bfd_boolean literal_p)
7652 struct bfd_elf_version_expr *ret;
7654 ret = (struct bfd_elf_version_expr *) xmalloc (sizeof *ret);
7658 ret->literal = TRUE;
7659 ret->pattern = literal_p ? new_name : realsymbol (new_name);
7660 if (ret->pattern == NULL)
7662 ret->pattern = new_name;
7663 ret->literal = FALSE;
7666 if (lang == NULL || strcasecmp (lang, "C") == 0)
7667 ret->mask = BFD_ELF_VERSION_C_TYPE;
7668 else if (strcasecmp (lang, "C++") == 0)
7669 ret->mask = BFD_ELF_VERSION_CXX_TYPE;
7670 else if (strcasecmp (lang, "Java") == 0)
7671 ret->mask = BFD_ELF_VERSION_JAVA_TYPE;
7674 einfo (_("%X%P: unknown language `%s' in version information\n"),
7676 ret->mask = BFD_ELF_VERSION_C_TYPE;
7679 return ldemul_new_vers_pattern (ret);
7682 /* This is called for each set of variable names and match
7685 struct bfd_elf_version_tree *
7686 lang_new_vers_node (struct bfd_elf_version_expr *globals,
7687 struct bfd_elf_version_expr *locals)
7689 struct bfd_elf_version_tree *ret;
7691 ret = (struct bfd_elf_version_tree *) xcalloc (1, sizeof *ret);
7692 ret->globals.list = globals;
7693 ret->locals.list = locals;
7694 ret->match = lang_vers_match;
7695 ret->name_indx = (unsigned int) -1;
7699 /* This static variable keeps track of version indices. */
7701 static int version_index;
7704 version_expr_head_hash (const void *p)
7706 const struct bfd_elf_version_expr *e =
7707 (const struct bfd_elf_version_expr *) p;
7709 return htab_hash_string (e->pattern);
7713 version_expr_head_eq (const void *p1, const void *p2)
7715 const struct bfd_elf_version_expr *e1 =
7716 (const struct bfd_elf_version_expr *) p1;
7717 const struct bfd_elf_version_expr *e2 =
7718 (const struct bfd_elf_version_expr *) p2;
7720 return strcmp (e1->pattern, e2->pattern) == 0;
7724 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head *head)
7727 struct bfd_elf_version_expr *e, *next;
7728 struct bfd_elf_version_expr **list_loc, **remaining_loc;
7730 for (e = head->list; e; e = e->next)
7734 head->mask |= e->mask;
7739 head->htab = htab_create (count * 2, version_expr_head_hash,
7740 version_expr_head_eq, NULL);
7741 list_loc = &head->list;
7742 remaining_loc = &head->remaining;
7743 for (e = head->list; e; e = next)
7749 remaining_loc = &e->next;
7753 void **loc = htab_find_slot ((htab_t) head->htab, e, INSERT);
7757 struct bfd_elf_version_expr *e1, *last;
7759 e1 = (struct bfd_elf_version_expr *) *loc;
7763 if (e1->mask == e->mask)
7771 while (e1 && strcmp (e1->pattern, e->pattern) == 0);
7775 /* This is a duplicate. */
7776 /* FIXME: Memory leak. Sometimes pattern is not
7777 xmalloced alone, but in larger chunk of memory. */
7778 /* free (e->pattern); */
7783 e->next = last->next;
7791 list_loc = &e->next;
7795 *remaining_loc = NULL;
7796 *list_loc = head->remaining;
7799 head->remaining = head->list;
7802 /* This is called when we know the name and dependencies of the
7806 lang_register_vers_node (const char *name,
7807 struct bfd_elf_version_tree *version,
7808 struct bfd_elf_version_deps *deps)
7810 struct bfd_elf_version_tree *t, **pp;
7811 struct bfd_elf_version_expr *e1;
7816 if (link_info.version_info != NULL
7817 && (name[0] == '\0' || link_info.version_info->name[0] == '\0'))
7819 einfo (_("%X%P: anonymous version tag cannot be combined"
7820 " with other version tags\n"));
7825 /* Make sure this node has a unique name. */
7826 for (t = link_info.version_info; t != NULL; t = t->next)
7827 if (strcmp (t->name, name) == 0)
7828 einfo (_("%X%P: duplicate version tag `%s'\n"), name);
7830 lang_finalize_version_expr_head (&version->globals);
7831 lang_finalize_version_expr_head (&version->locals);
7833 /* Check the global and local match names, and make sure there
7834 aren't any duplicates. */
7836 for (e1 = version->globals.list; e1 != NULL; e1 = e1->next)
7838 for (t = link_info.version_info; t != NULL; t = t->next)
7840 struct bfd_elf_version_expr *e2;
7842 if (t->locals.htab && e1->literal)
7844 e2 = (struct bfd_elf_version_expr *)
7845 htab_find ((htab_t) t->locals.htab, e1);
7846 while (e2 && strcmp (e1->pattern, e2->pattern) == 0)
7848 if (e1->mask == e2->mask)
7849 einfo (_("%X%P: duplicate expression `%s'"
7850 " in version information\n"), e1->pattern);
7854 else if (!e1->literal)
7855 for (e2 = t->locals.remaining; e2 != NULL; e2 = e2->next)
7856 if (strcmp (e1->pattern, e2->pattern) == 0
7857 && e1->mask == e2->mask)
7858 einfo (_("%X%P: duplicate expression `%s'"
7859 " in version information\n"), e1->pattern);
7863 for (e1 = version->locals.list; e1 != NULL; e1 = e1->next)
7865 for (t = link_info.version_info; t != NULL; t = t->next)
7867 struct bfd_elf_version_expr *e2;
7869 if (t->globals.htab && e1->literal)
7871 e2 = (struct bfd_elf_version_expr *)
7872 htab_find ((htab_t) t->globals.htab, e1);
7873 while (e2 && strcmp (e1->pattern, e2->pattern) == 0)
7875 if (e1->mask == e2->mask)
7876 einfo (_("%X%P: duplicate expression `%s'"
7877 " in version information\n"),
7882 else if (!e1->literal)
7883 for (e2 = t->globals.remaining; e2 != NULL; e2 = e2->next)
7884 if (strcmp (e1->pattern, e2->pattern) == 0
7885 && e1->mask == e2->mask)
7886 einfo (_("%X%P: duplicate expression `%s'"
7887 " in version information\n"), e1->pattern);
7891 version->deps = deps;
7892 version->name = name;
7893 if (name[0] != '\0')
7896 version->vernum = version_index;
7899 version->vernum = 0;
7901 for (pp = &link_info.version_info; *pp != NULL; pp = &(*pp)->next)
7906 /* This is called when we see a version dependency. */
7908 struct bfd_elf_version_deps *
7909 lang_add_vers_depend (struct bfd_elf_version_deps *list, const char *name)
7911 struct bfd_elf_version_deps *ret;
7912 struct bfd_elf_version_tree *t;
7914 ret = (struct bfd_elf_version_deps *) xmalloc (sizeof *ret);
7917 for (t = link_info.version_info; t != NULL; t = t->next)
7919 if (strcmp (t->name, name) == 0)
7921 ret->version_needed = t;
7926 einfo (_("%X%P: unable to find version dependency `%s'\n"), name);
7928 ret->version_needed = NULL;
7933 lang_do_version_exports_section (void)
7935 struct bfd_elf_version_expr *greg = NULL, *lreg;
7937 LANG_FOR_EACH_INPUT_STATEMENT (is)
7939 asection *sec = bfd_get_section_by_name (is->the_bfd, ".exports");
7947 contents = (char *) xmalloc (len);
7948 if (!bfd_get_section_contents (is->the_bfd, sec, contents, 0, len))
7949 einfo (_("%X%P: unable to read .exports section contents\n"), sec);
7952 while (p < contents + len)
7954 greg = lang_new_vers_pattern (greg, p, NULL, FALSE);
7955 p = strchr (p, '\0') + 1;
7958 /* Do not free the contents, as we used them creating the regex. */
7960 /* Do not include this section in the link. */
7961 sec->flags |= SEC_EXCLUDE | SEC_KEEP;
7964 lreg = lang_new_vers_pattern (NULL, "*", NULL, FALSE);
7965 lang_register_vers_node (command_line.version_exports_section,
7966 lang_new_vers_node (greg, lreg), NULL);
7970 lang_add_unique (const char *name)
7972 struct unique_sections *ent;
7974 for (ent = unique_section_list; ent; ent = ent->next)
7975 if (strcmp (ent->name, name) == 0)
7978 ent = (struct unique_sections *) xmalloc (sizeof *ent);
7979 ent->name = xstrdup (name);
7980 ent->next = unique_section_list;
7981 unique_section_list = ent;
7984 /* Append the list of dynamic symbols to the existing one. */
7987 lang_append_dynamic_list (struct bfd_elf_version_expr *dynamic)
7989 if (link_info.dynamic_list)
7991 struct bfd_elf_version_expr *tail;
7992 for (tail = dynamic; tail->next != NULL; tail = tail->next)
7994 tail->next = link_info.dynamic_list->head.list;
7995 link_info.dynamic_list->head.list = dynamic;
7999 struct bfd_elf_dynamic_list *d;
8001 d = (struct bfd_elf_dynamic_list *) xcalloc (1, sizeof *d);
8002 d->head.list = dynamic;
8003 d->match = lang_vers_match;
8004 link_info.dynamic_list = d;
8008 /* Append the list of C++ typeinfo dynamic symbols to the existing
8012 lang_append_dynamic_list_cpp_typeinfo (void)
8014 const char * symbols [] =
8016 "typeinfo name for*",
8019 struct bfd_elf_version_expr *dynamic = NULL;
8022 for (i = 0; i < ARRAY_SIZE (symbols); i++)
8023 dynamic = lang_new_vers_pattern (dynamic, symbols [i], "C++",
8026 lang_append_dynamic_list (dynamic);
8029 /* Append the list of C++ operator new and delete dynamic symbols to the
8033 lang_append_dynamic_list_cpp_new (void)
8035 const char * symbols [] =
8040 struct bfd_elf_version_expr *dynamic = NULL;
8043 for (i = 0; i < ARRAY_SIZE (symbols); i++)
8044 dynamic = lang_new_vers_pattern (dynamic, symbols [i], "C++",
8047 lang_append_dynamic_list (dynamic);
8050 /* Scan a space and/or comma separated string of features. */
8053 lang_ld_feature (char *str)
8061 while (*p == ',' || ISSPACE (*p))
8066 while (*q && *q != ',' && !ISSPACE (*q))
8070 if (strcasecmp (p, "SANE_EXPR") == 0)
8071 config.sane_expr = TRUE;
8073 einfo (_("%X%P: unknown feature `%s'\n"), p);