1 /* Linker command language support.
2 Copyright 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
4 Free Software Foundation, Inc.
6 This file is part of the GNU Binutils.
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software
20 Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
21 MA 02110-1301, USA. */
27 #include "libiberty.h"
28 #include "safe-ctype.h"
47 #define offsetof(TYPE, MEMBER) ((size_t) & (((TYPE*) 0)->MEMBER))
50 /* Locals variables. */
51 static struct obstack stat_obstack;
52 static struct obstack map_obstack;
54 #define obstack_chunk_alloc xmalloc
55 #define obstack_chunk_free free
56 static const char *startup_file;
57 static bfd_boolean placed_commons = FALSE;
58 static bfd_boolean stripped_excluded_sections = FALSE;
59 static lang_output_section_statement_type *default_common_section;
60 static bfd_boolean map_option_f;
61 static bfd_vma print_dot;
62 static lang_input_statement_type *first_file;
63 static const char *current_target;
64 static const char *output_target;
65 static lang_statement_list_type statement_list;
66 static struct bfd_hash_table lang_definedness_table;
68 /* Forward declarations. */
69 static void exp_init_os (etree_type *);
70 static void init_map_userdata (bfd *, asection *, void *);
71 static lang_input_statement_type *lookup_name (const char *);
72 static struct bfd_hash_entry *lang_definedness_newfunc
73 (struct bfd_hash_entry *, struct bfd_hash_table *, const char *);
74 static void insert_undefined (const char *);
75 static bfd_boolean sort_def_symbol (struct bfd_link_hash_entry *, void *);
76 static void print_statement (lang_statement_union_type *,
77 lang_output_section_statement_type *);
78 static void print_statement_list (lang_statement_union_type *,
79 lang_output_section_statement_type *);
80 static void print_statements (void);
81 static void print_input_section (asection *);
82 static bfd_boolean lang_one_common (struct bfd_link_hash_entry *, void *);
83 static void lang_record_phdrs (void);
84 static void lang_do_version_exports_section (void);
85 static void lang_finalize_version_expr_head
86 (struct bfd_elf_version_expr_head *);
88 /* Exported variables. */
89 lang_output_section_statement_type *abs_output_section;
90 lang_statement_list_type lang_output_section_statement;
91 lang_statement_list_type *stat_ptr = &statement_list;
92 lang_statement_list_type file_chain = { NULL, NULL };
93 lang_statement_list_type input_file_chain;
94 struct bfd_sym_chain entry_symbol = { NULL, NULL };
95 static const char *entry_symbol_default = "start";
96 const char *entry_section = ".text";
97 bfd_boolean entry_from_cmdline;
98 bfd_boolean lang_has_input_file = FALSE;
99 bfd_boolean had_output_filename = FALSE;
100 bfd_boolean lang_float_flag = FALSE;
101 bfd_boolean delete_output_file_on_failure = FALSE;
102 struct lang_phdr *lang_phdr_list;
103 struct lang_nocrossrefs *nocrossref_list;
104 static struct unique_sections *unique_section_list;
105 static bfd_boolean ldlang_sysrooted_script = FALSE;
107 /* Functions that traverse the linker script and might evaluate
108 DEFINED() need to increment this. */
109 int lang_statement_iteration = 0;
111 etree_type *base; /* Relocation base - or null */
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)
199 struct unique_sections *unam;
202 if (link_info.relocatable
203 && sec->owner != NULL
204 && bfd_is_group_section (sec->owner, sec))
208 for (unam = unique_section_list; unam; unam = unam->next)
209 if (name_match (unam->name, secnam) == 0)
215 /* Generic traversal routines for finding matching sections. */
217 /* Try processing a section against a wildcard. This just calls
218 the callback unless the filename exclusion list is present
219 and excludes the file. It's hardly ever present so this
220 function is very fast. */
223 walk_wild_consider_section (lang_wild_statement_type *ptr,
224 lang_input_statement_type *file,
226 struct wildcard_list *sec,
230 struct name_list *list_tmp;
232 /* Don't process sections from files which were excluded. */
233 for (list_tmp = sec->spec.exclude_name_list;
235 list_tmp = list_tmp->next)
237 char *p = archive_path (list_tmp->name);
241 if (input_statement_is_archive_path (list_tmp->name, p, file))
245 else if (name_match (list_tmp->name, file->filename) == 0)
248 /* FIXME: Perhaps remove the following at some stage? Matching
249 unadorned archives like this was never documented and has
250 been superceded by the archive:path syntax. */
251 else if (file->the_bfd != NULL
252 && file->the_bfd->my_archive != NULL
253 && name_match (list_tmp->name,
254 file->the_bfd->my_archive->filename) == 0)
258 (*callback) (ptr, sec, s, file, data);
261 /* Lowest common denominator routine that can handle everything correctly,
265 walk_wild_section_general (lang_wild_statement_type *ptr,
266 lang_input_statement_type *file,
271 struct wildcard_list *sec;
273 for (s = file->the_bfd->sections; s != NULL; s = s->next)
275 sec = ptr->section_list;
277 (*callback) (ptr, sec, s, file, data);
281 bfd_boolean skip = FALSE;
283 if (sec->spec.name != NULL)
285 const char *sname = bfd_get_section_name (file->the_bfd, s);
287 skip = name_match (sec->spec.name, sname) != 0;
291 walk_wild_consider_section (ptr, file, s, sec, callback, data);
298 /* Routines to find a single section given its name. If there's more
299 than one section with that name, we report that. */
303 asection *found_section;
304 bfd_boolean multiple_sections_found;
305 } section_iterator_callback_data;
308 section_iterator_callback (bfd *bfd ATTRIBUTE_UNUSED, asection *s, void *data)
310 section_iterator_callback_data *d = data;
312 if (d->found_section != NULL)
314 d->multiple_sections_found = TRUE;
318 d->found_section = s;
323 find_section (lang_input_statement_type *file,
324 struct wildcard_list *sec,
325 bfd_boolean *multiple_sections_found)
327 section_iterator_callback_data cb_data = { NULL, FALSE };
329 bfd_get_section_by_name_if (file->the_bfd, sec->spec.name,
330 section_iterator_callback, &cb_data);
331 *multiple_sections_found = cb_data.multiple_sections_found;
332 return cb_data.found_section;
335 /* Code for handling simple wildcards without going through fnmatch,
336 which can be expensive because of charset translations etc. */
338 /* A simple wild is a literal string followed by a single '*',
339 where the literal part is at least 4 characters long. */
342 is_simple_wild (const char *name)
344 size_t len = strcspn (name, "*?[");
345 return len >= 4 && name[len] == '*' && name[len + 1] == '\0';
349 match_simple_wild (const char *pattern, const char *name)
351 /* The first four characters of the pattern are guaranteed valid
352 non-wildcard characters. So we can go faster. */
353 if (pattern[0] != name[0] || pattern[1] != name[1]
354 || pattern[2] != name[2] || pattern[3] != name[3])
359 while (*pattern != '*')
360 if (*name++ != *pattern++)
366 /* Compare sections ASEC and BSEC according to SORT. */
369 compare_section (sort_type sort, asection *asec, asection *bsec)
378 case by_alignment_name:
379 ret = (bfd_section_alignment (bsec->owner, bsec)
380 - bfd_section_alignment (asec->owner, asec));
386 ret = strcmp (bfd_get_section_name (asec->owner, asec),
387 bfd_get_section_name (bsec->owner, bsec));
390 case by_name_alignment:
391 ret = strcmp (bfd_get_section_name (asec->owner, asec),
392 bfd_get_section_name (bsec->owner, bsec));
398 ret = (bfd_section_alignment (bsec->owner, bsec)
399 - bfd_section_alignment (asec->owner, asec));
406 /* Build a Binary Search Tree to sort sections, unlike insertion sort
407 used in wild_sort(). BST is considerably faster if the number of
408 of sections are large. */
410 static lang_section_bst_type **
411 wild_sort_fast (lang_wild_statement_type *wild,
412 struct wildcard_list *sec,
413 lang_input_statement_type *file ATTRIBUTE_UNUSED,
416 lang_section_bst_type **tree;
419 if (!wild->filenames_sorted
420 && (sec == NULL || sec->spec.sorted == none))
422 /* Append at the right end of tree. */
424 tree = &((*tree)->right);
430 /* Find the correct node to append this section. */
431 if (compare_section (sec->spec.sorted, section, (*tree)->section) < 0)
432 tree = &((*tree)->left);
434 tree = &((*tree)->right);
440 /* Use wild_sort_fast to build a BST to sort sections. */
443 output_section_callback_fast (lang_wild_statement_type *ptr,
444 struct wildcard_list *sec,
446 lang_input_statement_type *file,
447 void *output ATTRIBUTE_UNUSED)
449 lang_section_bst_type *node;
450 lang_section_bst_type **tree;
452 if (unique_section_p (section))
455 node = xmalloc (sizeof (lang_section_bst_type));
458 node->section = section;
460 tree = wild_sort_fast (ptr, sec, file, section);
465 /* Convert a sorted sections' BST back to list form. */
468 output_section_callback_tree_to_list (lang_wild_statement_type *ptr,
469 lang_section_bst_type *tree,
473 output_section_callback_tree_to_list (ptr, tree->left, output);
475 lang_add_section (&ptr->children, tree->section,
476 (lang_output_section_statement_type *) output);
479 output_section_callback_tree_to_list (ptr, tree->right, output);
484 /* Specialized, optimized routines for handling different kinds of
488 walk_wild_section_specs1_wild0 (lang_wild_statement_type *ptr,
489 lang_input_statement_type *file,
493 /* We can just do a hash lookup for the section with the right name.
494 But if that lookup discovers more than one section with the name
495 (should be rare), we fall back to the general algorithm because
496 we would otherwise have to sort the sections to make sure they
497 get processed in the bfd's order. */
498 bfd_boolean multiple_sections_found;
499 struct wildcard_list *sec0 = ptr->handler_data[0];
500 asection *s0 = find_section (file, sec0, &multiple_sections_found);
502 if (multiple_sections_found)
503 walk_wild_section_general (ptr, file, callback, data);
505 walk_wild_consider_section (ptr, file, s0, sec0, callback, data);
509 walk_wild_section_specs1_wild1 (lang_wild_statement_type *ptr,
510 lang_input_statement_type *file,
515 struct wildcard_list *wildsec0 = ptr->handler_data[0];
517 for (s = file->the_bfd->sections; s != NULL; s = s->next)
519 const char *sname = bfd_get_section_name (file->the_bfd, s);
520 bfd_boolean skip = !match_simple_wild (wildsec0->spec.name, sname);
523 walk_wild_consider_section (ptr, file, s, wildsec0, callback, data);
528 walk_wild_section_specs2_wild1 (lang_wild_statement_type *ptr,
529 lang_input_statement_type *file,
534 struct wildcard_list *sec0 = ptr->handler_data[0];
535 struct wildcard_list *wildsec1 = ptr->handler_data[1];
536 bfd_boolean multiple_sections_found;
537 asection *s0 = find_section (file, sec0, &multiple_sections_found);
539 if (multiple_sections_found)
541 walk_wild_section_general (ptr, file, callback, data);
545 /* Note that if the section was not found, s0 is NULL and
546 we'll simply never succeed the s == s0 test below. */
547 for (s = file->the_bfd->sections; s != NULL; s = s->next)
549 /* Recall that in this code path, a section cannot satisfy more
550 than one spec, so if s == s0 then it cannot match
553 walk_wild_consider_section (ptr, file, s, sec0, callback, data);
556 const char *sname = bfd_get_section_name (file->the_bfd, s);
557 bfd_boolean skip = !match_simple_wild (wildsec1->spec.name, sname);
560 walk_wild_consider_section (ptr, file, s, wildsec1, callback,
567 walk_wild_section_specs3_wild2 (lang_wild_statement_type *ptr,
568 lang_input_statement_type *file,
573 struct wildcard_list *sec0 = ptr->handler_data[0];
574 struct wildcard_list *wildsec1 = ptr->handler_data[1];
575 struct wildcard_list *wildsec2 = ptr->handler_data[2];
576 bfd_boolean multiple_sections_found;
577 asection *s0 = find_section (file, sec0, &multiple_sections_found);
579 if (multiple_sections_found)
581 walk_wild_section_general (ptr, file, callback, data);
585 for (s = file->the_bfd->sections; s != NULL; s = s->next)
588 walk_wild_consider_section (ptr, file, s, sec0, callback, data);
591 const char *sname = bfd_get_section_name (file->the_bfd, s);
592 bfd_boolean skip = !match_simple_wild (wildsec1->spec.name, sname);
595 walk_wild_consider_section (ptr, file, s, wildsec1, callback, data);
598 skip = !match_simple_wild (wildsec2->spec.name, sname);
600 walk_wild_consider_section (ptr, file, s, wildsec2, callback,
608 walk_wild_section_specs4_wild2 (lang_wild_statement_type *ptr,
609 lang_input_statement_type *file,
614 struct wildcard_list *sec0 = ptr->handler_data[0];
615 struct wildcard_list *sec1 = ptr->handler_data[1];
616 struct wildcard_list *wildsec2 = ptr->handler_data[2];
617 struct wildcard_list *wildsec3 = ptr->handler_data[3];
618 bfd_boolean multiple_sections_found;
619 asection *s0 = find_section (file, sec0, &multiple_sections_found), *s1;
621 if (multiple_sections_found)
623 walk_wild_section_general (ptr, file, callback, data);
627 s1 = find_section (file, sec1, &multiple_sections_found);
628 if (multiple_sections_found)
630 walk_wild_section_general (ptr, file, callback, data);
634 for (s = file->the_bfd->sections; s != NULL; s = s->next)
637 walk_wild_consider_section (ptr, file, s, sec0, callback, data);
640 walk_wild_consider_section (ptr, file, s, sec1, callback, data);
643 const char *sname = bfd_get_section_name (file->the_bfd, s);
644 bfd_boolean skip = !match_simple_wild (wildsec2->spec.name,
648 walk_wild_consider_section (ptr, file, s, wildsec2, callback,
652 skip = !match_simple_wild (wildsec3->spec.name, sname);
654 walk_wild_consider_section (ptr, file, s, wildsec3,
662 walk_wild_section (lang_wild_statement_type *ptr,
663 lang_input_statement_type *file,
667 if (file->just_syms_flag)
670 (*ptr->walk_wild_section_handler) (ptr, file, callback, data);
673 /* Returns TRUE when name1 is a wildcard spec that might match
674 something name2 can match. We're conservative: we return FALSE
675 only if the prefixes of name1 and name2 are different up to the
676 first wildcard character. */
679 wild_spec_can_overlap (const char *name1, const char *name2)
681 size_t prefix1_len = strcspn (name1, "?*[");
682 size_t prefix2_len = strcspn (name2, "?*[");
683 size_t min_prefix_len;
685 /* Note that if there is no wildcard character, then we treat the
686 terminating 0 as part of the prefix. Thus ".text" won't match
687 ".text." or ".text.*", for example. */
688 if (name1[prefix1_len] == '\0')
690 if (name2[prefix2_len] == '\0')
693 min_prefix_len = prefix1_len < prefix2_len ? prefix1_len : prefix2_len;
695 return memcmp (name1, name2, min_prefix_len) == 0;
698 /* Select specialized code to handle various kinds of wildcard
702 analyze_walk_wild_section_handler (lang_wild_statement_type *ptr)
705 int wild_name_count = 0;
706 struct wildcard_list *sec;
710 ptr->walk_wild_section_handler = walk_wild_section_general;
711 ptr->handler_data[0] = NULL;
712 ptr->handler_data[1] = NULL;
713 ptr->handler_data[2] = NULL;
714 ptr->handler_data[3] = NULL;
717 /* Count how many wildcard_specs there are, and how many of those
718 actually use wildcards in the name. Also, bail out if any of the
719 wildcard names are NULL. (Can this actually happen?
720 walk_wild_section used to test for it.) And bail out if any
721 of the wildcards are more complex than a simple string
722 ending in a single '*'. */
723 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
726 if (sec->spec.name == NULL)
728 if (wildcardp (sec->spec.name))
731 if (!is_simple_wild (sec->spec.name))
736 /* The zero-spec case would be easy to optimize but it doesn't
737 happen in practice. Likewise, more than 4 specs doesn't
738 happen in practice. */
739 if (sec_count == 0 || sec_count > 4)
742 /* Check that no two specs can match the same section. */
743 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
745 struct wildcard_list *sec2;
746 for (sec2 = sec->next; sec2 != NULL; sec2 = sec2->next)
748 if (wild_spec_can_overlap (sec->spec.name, sec2->spec.name))
753 signature = (sec_count << 8) + wild_name_count;
757 ptr->walk_wild_section_handler = walk_wild_section_specs1_wild0;
760 ptr->walk_wild_section_handler = walk_wild_section_specs1_wild1;
763 ptr->walk_wild_section_handler = walk_wild_section_specs2_wild1;
766 ptr->walk_wild_section_handler = walk_wild_section_specs3_wild2;
769 ptr->walk_wild_section_handler = walk_wild_section_specs4_wild2;
775 /* Now fill the data array with pointers to the specs, first the
776 specs with non-wildcard names, then the specs with wildcard
777 names. It's OK to process the specs in different order from the
778 given order, because we've already determined that no section
779 will match more than one spec. */
781 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
782 if (!wildcardp (sec->spec.name))
783 ptr->handler_data[data_counter++] = sec;
784 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
785 if (wildcardp (sec->spec.name))
786 ptr->handler_data[data_counter++] = sec;
789 /* Handle a wild statement for a single file F. */
792 walk_wild_file (lang_wild_statement_type *s,
793 lang_input_statement_type *f,
797 if (f->the_bfd == NULL
798 || ! bfd_check_format (f->the_bfd, bfd_archive))
799 walk_wild_section (s, f, callback, data);
804 /* This is an archive file. We must map each member of the
805 archive separately. */
806 member = bfd_openr_next_archived_file (f->the_bfd, NULL);
807 while (member != NULL)
809 /* When lookup_name is called, it will call the add_symbols
810 entry point for the archive. For each element of the
811 archive which is included, BFD will call ldlang_add_file,
812 which will set the usrdata field of the member to the
813 lang_input_statement. */
814 if (member->usrdata != NULL)
816 walk_wild_section (s, member->usrdata, callback, data);
819 member = bfd_openr_next_archived_file (f->the_bfd, member);
825 walk_wild (lang_wild_statement_type *s, callback_t callback, void *data)
827 const char *file_spec = s->filename;
830 if (file_spec == NULL)
832 /* Perform the iteration over all files in the list. */
833 LANG_FOR_EACH_INPUT_STATEMENT (f)
835 walk_wild_file (s, f, callback, data);
838 else if ((p = archive_path (file_spec)) != NULL)
840 LANG_FOR_EACH_INPUT_STATEMENT (f)
842 if (input_statement_is_archive_path (file_spec, p, f))
843 walk_wild_file (s, f, callback, data);
846 else if (wildcardp (file_spec))
848 LANG_FOR_EACH_INPUT_STATEMENT (f)
850 if (fnmatch (file_spec, f->filename, 0) == 0)
851 walk_wild_file (s, f, callback, data);
856 lang_input_statement_type *f;
858 /* Perform the iteration over a single file. */
859 f = lookup_name (file_spec);
861 walk_wild_file (s, f, callback, data);
865 /* lang_for_each_statement walks the parse tree and calls the provided
866 function for each node. */
869 lang_for_each_statement_worker (void (*func) (lang_statement_union_type *),
870 lang_statement_union_type *s)
872 for (; s != NULL; s = s->header.next)
876 switch (s->header.type)
878 case lang_constructors_statement_enum:
879 lang_for_each_statement_worker (func, constructor_list.head);
881 case lang_output_section_statement_enum:
882 lang_for_each_statement_worker
883 (func, s->output_section_statement.children.head);
885 case lang_wild_statement_enum:
886 lang_for_each_statement_worker (func,
887 s->wild_statement.children.head);
889 case lang_group_statement_enum:
890 lang_for_each_statement_worker (func,
891 s->group_statement.children.head);
893 case lang_data_statement_enum:
894 case lang_reloc_statement_enum:
895 case lang_object_symbols_statement_enum:
896 case lang_output_statement_enum:
897 case lang_target_statement_enum:
898 case lang_input_section_enum:
899 case lang_input_statement_enum:
900 case lang_assignment_statement_enum:
901 case lang_padding_statement_enum:
902 case lang_address_statement_enum:
903 case lang_fill_statement_enum:
904 case lang_insert_statement_enum:
914 lang_for_each_statement (void (*func) (lang_statement_union_type *))
916 lang_for_each_statement_worker (func, statement_list.head);
919 /*----------------------------------------------------------------------*/
922 lang_list_init (lang_statement_list_type *list)
925 list->tail = &list->head;
928 /* Build a new statement node for the parse tree. */
930 static lang_statement_union_type *
931 new_statement (enum statement_enum type,
933 lang_statement_list_type *list)
935 lang_statement_union_type *new;
937 new = stat_alloc (size);
938 new->header.type = type;
939 new->header.next = NULL;
940 lang_statement_append (list, new, &new->header.next);
944 /* Build a new input file node for the language. There are several
945 ways in which we treat an input file, eg, we only look at symbols,
946 or prefix it with a -l etc.
948 We can be supplied with requests for input files more than once;
949 they may, for example be split over several lines like foo.o(.text)
950 foo.o(.data) etc, so when asked for a file we check that we haven't
951 got it already so we don't duplicate the bfd. */
953 static lang_input_statement_type *
954 new_afile (const char *name,
955 lang_input_file_enum_type file_type,
957 bfd_boolean add_to_list)
959 lang_input_statement_type *p;
962 p = new_stat (lang_input_statement, stat_ptr);
965 p = stat_alloc (sizeof (lang_input_statement_type));
966 p->header.type = lang_input_statement_enum;
967 p->header.next = NULL;
970 lang_has_input_file = TRUE;
972 p->sysrooted = FALSE;
974 if (file_type == lang_input_file_is_l_enum
975 && name[0] == ':' && name[1] != '\0')
977 file_type = lang_input_file_is_search_file_enum;
983 case lang_input_file_is_symbols_only_enum:
985 p->is_archive = FALSE;
987 p->local_sym_name = name;
988 p->just_syms_flag = TRUE;
989 p->search_dirs_flag = FALSE;
991 case lang_input_file_is_fake_enum:
993 p->is_archive = FALSE;
995 p->local_sym_name = name;
996 p->just_syms_flag = FALSE;
997 p->search_dirs_flag = FALSE;
999 case lang_input_file_is_l_enum:
1000 p->is_archive = TRUE;
1003 p->local_sym_name = concat ("-l", name, (const char *) NULL);
1004 p->just_syms_flag = FALSE;
1005 p->search_dirs_flag = TRUE;
1007 case lang_input_file_is_marker_enum:
1009 p->is_archive = FALSE;
1011 p->local_sym_name = name;
1012 p->just_syms_flag = FALSE;
1013 p->search_dirs_flag = TRUE;
1015 case lang_input_file_is_search_file_enum:
1016 p->sysrooted = ldlang_sysrooted_script;
1018 p->is_archive = FALSE;
1020 p->local_sym_name = name;
1021 p->just_syms_flag = FALSE;
1022 p->search_dirs_flag = TRUE;
1024 case lang_input_file_is_file_enum:
1026 p->is_archive = FALSE;
1028 p->local_sym_name = name;
1029 p->just_syms_flag = FALSE;
1030 p->search_dirs_flag = FALSE;
1036 p->next_real_file = NULL;
1038 p->dynamic = config.dynamic_link;
1039 p->add_needed = add_needed;
1040 p->as_needed = as_needed;
1041 p->whole_archive = whole_archive;
1043 lang_statement_append (&input_file_chain,
1044 (lang_statement_union_type *) p,
1045 &p->next_real_file);
1049 lang_input_statement_type *
1050 lang_add_input_file (const char *name,
1051 lang_input_file_enum_type file_type,
1054 return new_afile (name, file_type, target, TRUE);
1057 struct out_section_hash_entry
1059 struct bfd_hash_entry root;
1060 lang_statement_union_type s;
1063 /* The hash table. */
1065 static struct bfd_hash_table output_section_statement_table;
1067 /* Support routines for the hash table used by lang_output_section_find,
1068 initialize the table, fill in an entry and remove the table. */
1070 static struct bfd_hash_entry *
1071 output_section_statement_newfunc (struct bfd_hash_entry *entry,
1072 struct bfd_hash_table *table,
1075 lang_output_section_statement_type **nextp;
1076 struct out_section_hash_entry *ret;
1080 entry = bfd_hash_allocate (table, sizeof (*ret));
1085 entry = bfd_hash_newfunc (entry, table, string);
1089 ret = (struct out_section_hash_entry *) entry;
1090 memset (&ret->s, 0, sizeof (ret->s));
1091 ret->s.header.type = lang_output_section_statement_enum;
1092 ret->s.output_section_statement.subsection_alignment = -1;
1093 ret->s.output_section_statement.section_alignment = -1;
1094 ret->s.output_section_statement.block_value = 1;
1095 lang_list_init (&ret->s.output_section_statement.children);
1096 lang_statement_append (stat_ptr, &ret->s, &ret->s.header.next);
1098 /* For every output section statement added to the list, except the
1099 first one, lang_output_section_statement.tail points to the "next"
1100 field of the last element of the list. */
1101 if (lang_output_section_statement.head != NULL)
1102 ret->s.output_section_statement.prev
1103 = ((lang_output_section_statement_type *)
1104 ((char *) lang_output_section_statement.tail
1105 - offsetof (lang_output_section_statement_type, next)));
1107 /* GCC's strict aliasing rules prevent us from just casting the
1108 address, so we store the pointer in a variable and cast that
1110 nextp = &ret->s.output_section_statement.next;
1111 lang_statement_append (&lang_output_section_statement,
1113 (lang_statement_union_type **) nextp);
1118 output_section_statement_table_init (void)
1120 if (!bfd_hash_table_init_n (&output_section_statement_table,
1121 output_section_statement_newfunc,
1122 sizeof (struct out_section_hash_entry),
1124 einfo (_("%P%F: can not create hash table: %E\n"));
1128 output_section_statement_table_free (void)
1130 bfd_hash_table_free (&output_section_statement_table);
1133 /* Build enough state so that the parser can build its tree. */
1138 obstack_begin (&stat_obstack, 1000);
1140 stat_ptr = &statement_list;
1142 output_section_statement_table_init ();
1144 lang_list_init (stat_ptr);
1146 lang_list_init (&input_file_chain);
1147 lang_list_init (&lang_output_section_statement);
1148 lang_list_init (&file_chain);
1149 first_file = lang_add_input_file (NULL, lang_input_file_is_marker_enum,
1151 abs_output_section =
1152 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME, 0, TRUE);
1154 abs_output_section->bfd_section = bfd_abs_section_ptr;
1156 /* The value "3" is ad-hoc, somewhat related to the expected number of
1157 DEFINED expressions in a linker script. For most default linker
1158 scripts, there are none. Why a hash table then? Well, it's somewhat
1159 simpler to re-use working machinery than using a linked list in terms
1160 of code-complexity here in ld, besides the initialization which just
1161 looks like other code here. */
1162 if (!bfd_hash_table_init_n (&lang_definedness_table,
1163 lang_definedness_newfunc,
1164 sizeof (struct lang_definedness_hash_entry),
1166 einfo (_("%P%F: can not create hash table: %E\n"));
1172 output_section_statement_table_free ();
1175 /*----------------------------------------------------------------------
1176 A region is an area of memory declared with the
1177 MEMORY { name:org=exp, len=exp ... }
1180 We maintain a list of all the regions here.
1182 If no regions are specified in the script, then the default is used
1183 which is created when looked up to be the entire data space.
1185 If create is true we are creating a region inside a MEMORY block.
1186 In this case it is probably an error to create a region that has
1187 already been created. If we are not inside a MEMORY block it is
1188 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1189 and so we issue a warning. */
1191 static lang_memory_region_type *lang_memory_region_list;
1192 static lang_memory_region_type **lang_memory_region_list_tail
1193 = &lang_memory_region_list;
1195 lang_memory_region_type *
1196 lang_memory_region_lookup (const char *const name, bfd_boolean create)
1198 lang_memory_region_type *p;
1199 lang_memory_region_type *new;
1201 /* NAME is NULL for LMA memspecs if no region was specified. */
1205 for (p = lang_memory_region_list; p != NULL; p = p->next)
1206 if (strcmp (p->name, name) == 0)
1209 einfo (_("%P:%S: warning: redeclaration of memory region '%s'\n"),
1214 if (!create && strcmp (name, DEFAULT_MEMORY_REGION))
1215 einfo (_("%P:%S: warning: memory region %s not declared\n"), name);
1217 new = stat_alloc (sizeof (lang_memory_region_type));
1219 new->name = xstrdup (name);
1222 new->length = ~(bfd_size_type) 0;
1224 new->last_os = NULL;
1227 new->had_full_message = FALSE;
1229 *lang_memory_region_list_tail = new;
1230 lang_memory_region_list_tail = &new->next;
1235 static lang_memory_region_type *
1236 lang_memory_default (asection *section)
1238 lang_memory_region_type *p;
1240 flagword sec_flags = section->flags;
1242 /* Override SEC_DATA to mean a writable section. */
1243 if ((sec_flags & (SEC_ALLOC | SEC_READONLY | SEC_CODE)) == SEC_ALLOC)
1244 sec_flags |= SEC_DATA;
1246 for (p = lang_memory_region_list; p != NULL; p = p->next)
1248 if ((p->flags & sec_flags) != 0
1249 && (p->not_flags & sec_flags) == 0)
1254 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION, FALSE);
1257 lang_output_section_statement_type *
1258 lang_output_section_statement_lookup (const char *const name,
1262 struct out_section_hash_entry *entry;
1264 entry = ((struct out_section_hash_entry *)
1265 bfd_hash_lookup (&output_section_statement_table, name,
1270 einfo (_("%P%F: failed creating section `%s': %E\n"), name);
1274 if (entry->s.output_section_statement.name != NULL)
1276 /* We have a section of this name, but it might not have the correct
1278 struct out_section_hash_entry *last_ent;
1279 unsigned long hash = entry->root.hash;
1281 if (create && constraint == SPECIAL)
1282 /* Not traversing to the end reverses the order of the second
1283 and subsequent SPECIAL sections in the hash table chain,
1284 but that shouldn't matter. */
1289 if (entry->s.output_section_statement.constraint >= 0
1292 == entry->s.output_section_statement.constraint)))
1293 return &entry->s.output_section_statement;
1295 entry = (struct out_section_hash_entry *) entry->root.next;
1297 while (entry != NULL
1298 && entry->root.hash == hash
1299 && strcmp (name, entry->s.output_section_statement.name) == 0);
1305 = ((struct out_section_hash_entry *)
1306 output_section_statement_newfunc (NULL,
1307 &output_section_statement_table,
1311 einfo (_("%P%F: failed creating section `%s': %E\n"), name);
1314 entry->root = last_ent->root;
1315 last_ent->root.next = &entry->root;
1318 entry->s.output_section_statement.name = name;
1319 entry->s.output_section_statement.constraint = constraint;
1320 return &entry->s.output_section_statement;
1323 /* A variant of lang_output_section_find used by place_orphan.
1324 Returns the output statement that should precede a new output
1325 statement for SEC. If an exact match is found on certain flags,
1328 lang_output_section_statement_type *
1329 lang_output_section_find_by_flags (const asection *sec,
1330 lang_output_section_statement_type **exact,
1331 lang_match_sec_type_func match_type)
1333 lang_output_section_statement_type *first, *look, *found;
1336 /* We know the first statement on this list is *ABS*. May as well
1338 first = &lang_output_section_statement.head->output_section_statement;
1339 first = first->next;
1341 /* First try for an exact match. */
1343 for (look = first; look; look = look->next)
1345 flags = look->flags;
1346 if (look->bfd_section != NULL)
1348 flags = look->bfd_section->flags;
1349 if (match_type && !match_type (link_info.output_bfd,
1354 flags ^= sec->flags;
1355 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD | SEC_READONLY
1356 | SEC_CODE | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1366 if ((sec->flags & SEC_CODE) != 0
1367 && (sec->flags & SEC_ALLOC) != 0)
1369 /* Try for a rw code section. */
1370 for (look = first; look; look = look->next)
1372 flags = look->flags;
1373 if (look->bfd_section != NULL)
1375 flags = look->bfd_section->flags;
1376 if (match_type && !match_type (link_info.output_bfd,
1381 flags ^= sec->flags;
1382 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1383 | SEC_CODE | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1387 else if ((sec->flags & (SEC_READONLY | SEC_THREAD_LOCAL)) != 0
1388 && (sec->flags & SEC_ALLOC) != 0)
1390 /* .rodata can go after .text, .sdata2 after .rodata. */
1391 for (look = first; look; look = look->next)
1393 flags = look->flags;
1394 if (look->bfd_section != NULL)
1396 flags = look->bfd_section->flags;
1397 if (match_type && !match_type (link_info.output_bfd,
1402 flags ^= sec->flags;
1403 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1405 && !(look->flags & (SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1409 else if ((sec->flags & SEC_SMALL_DATA) != 0
1410 && (sec->flags & SEC_ALLOC) != 0)
1412 /* .sdata goes after .data, .sbss after .sdata. */
1413 for (look = first; look; look = look->next)
1415 flags = look->flags;
1416 if (look->bfd_section != NULL)
1418 flags = look->bfd_section->flags;
1419 if (match_type && !match_type (link_info.output_bfd,
1424 flags ^= sec->flags;
1425 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1426 | SEC_THREAD_LOCAL))
1427 || ((look->flags & SEC_SMALL_DATA)
1428 && !(sec->flags & SEC_HAS_CONTENTS)))
1432 else if ((sec->flags & SEC_HAS_CONTENTS) != 0
1433 && (sec->flags & SEC_ALLOC) != 0)
1435 /* .data goes after .rodata. */
1436 for (look = first; look; look = look->next)
1438 flags = look->flags;
1439 if (look->bfd_section != NULL)
1441 flags = look->bfd_section->flags;
1442 if (match_type && !match_type (link_info.output_bfd,
1447 flags ^= sec->flags;
1448 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1449 | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1453 else if ((sec->flags & SEC_ALLOC) != 0)
1455 /* .bss goes after any other alloc section. */
1456 for (look = first; look; look = look->next)
1458 flags = look->flags;
1459 if (look->bfd_section != NULL)
1461 flags = look->bfd_section->flags;
1462 if (match_type && !match_type (link_info.output_bfd,
1467 flags ^= sec->flags;
1468 if (!(flags & SEC_ALLOC))
1474 /* non-alloc go last. */
1475 for (look = first; look; look = look->next)
1477 flags = look->flags;
1478 if (look->bfd_section != NULL)
1479 flags = look->bfd_section->flags;
1480 flags ^= sec->flags;
1481 if (!(flags & SEC_DEBUGGING))
1487 if (found || !match_type)
1490 return lang_output_section_find_by_flags (sec, NULL, NULL);
1493 /* Find the last output section before given output statement.
1494 Used by place_orphan. */
1497 output_prev_sec_find (lang_output_section_statement_type *os)
1499 lang_output_section_statement_type *lookup;
1501 for (lookup = os->prev; lookup != NULL; lookup = lookup->prev)
1503 if (lookup->constraint < 0)
1506 if (lookup->bfd_section != NULL && lookup->bfd_section->owner != NULL)
1507 return lookup->bfd_section;
1513 /* Look for a suitable place for a new output section statement. The
1514 idea is to skip over anything that might be inside a SECTIONS {}
1515 statement in a script, before we find another output section
1516 statement. Assignments to "dot" before an output section statement
1517 are assumed to belong to it. An exception to this rule is made for
1518 the first assignment to dot, otherwise we might put an orphan
1519 before . = . + SIZEOF_HEADERS or similar assignments that set the
1522 static lang_statement_union_type **
1523 insert_os_after (lang_output_section_statement_type *after)
1525 lang_statement_union_type **where;
1526 lang_statement_union_type **assign = NULL;
1527 bfd_boolean ignore_first;
1530 = after == &lang_output_section_statement.head->output_section_statement;
1532 for (where = &after->header.next;
1534 where = &(*where)->header.next)
1536 switch ((*where)->header.type)
1538 case lang_assignment_statement_enum:
1541 lang_assignment_statement_type *ass;
1543 ass = &(*where)->assignment_statement;
1544 if (ass->exp->type.node_class != etree_assert
1545 && ass->exp->assign.dst[0] == '.'
1546 && ass->exp->assign.dst[1] == 0
1550 ignore_first = FALSE;
1552 case lang_wild_statement_enum:
1553 case lang_input_section_enum:
1554 case lang_object_symbols_statement_enum:
1555 case lang_fill_statement_enum:
1556 case lang_data_statement_enum:
1557 case lang_reloc_statement_enum:
1558 case lang_padding_statement_enum:
1559 case lang_constructors_statement_enum:
1562 case lang_output_section_statement_enum:
1566 case lang_input_statement_enum:
1567 case lang_address_statement_enum:
1568 case lang_target_statement_enum:
1569 case lang_output_statement_enum:
1570 case lang_group_statement_enum:
1571 case lang_insert_statement_enum:
1580 lang_output_section_statement_type *
1581 lang_insert_orphan (asection *s,
1582 const char *secname,
1584 lang_output_section_statement_type *after,
1585 struct orphan_save *place,
1586 etree_type *address,
1587 lang_statement_list_type *add_child)
1589 lang_statement_list_type *old;
1590 lang_statement_list_type add;
1592 lang_output_section_statement_type *os;
1593 lang_output_section_statement_type **os_tail;
1595 /* Start building a list of statements for this section.
1596 First save the current statement pointer. */
1599 /* If we have found an appropriate place for the output section
1600 statements for this orphan, add them to our own private list,
1601 inserting them later into the global statement list. */
1605 lang_list_init (stat_ptr);
1609 if (config.build_constructors)
1611 /* If the name of the section is representable in C, then create
1612 symbols to mark the start and the end of the section. */
1613 for (ps = secname; *ps != '\0'; ps++)
1614 if (! ISALNUM ((unsigned char) *ps) && *ps != '_')
1619 etree_type *e_align;
1621 symname = (char *) xmalloc (ps - secname + sizeof "__start_" + 1);
1622 symname[0] = bfd_get_symbol_leading_char (link_info.output_bfd);
1623 sprintf (symname + (symname[0] != 0), "__start_%s", secname);
1624 e_align = exp_unop (ALIGN_K,
1625 exp_intop ((bfd_vma) 1 << s->alignment_power));
1626 lang_add_assignment (exp_assop ('=', ".", e_align));
1627 lang_add_assignment (exp_provide (symname,
1628 exp_nameop (NAME, "."),
1633 if (link_info.relocatable || (s->flags & (SEC_LOAD | SEC_ALLOC)) == 0)
1634 address = exp_intop (0);
1636 os_tail = ((lang_output_section_statement_type **)
1637 lang_output_section_statement.tail);
1638 os = lang_enter_output_section_statement (secname, address, 0, NULL, NULL,
1641 if (add_child == NULL)
1642 add_child = &os->children;
1643 lang_add_section (add_child, s, os);
1645 lang_leave_output_section_statement (0, "*default*", NULL, NULL);
1647 if (config.build_constructors && *ps == '\0')
1651 /* lang_leave_ouput_section_statement resets stat_ptr.
1652 Put stat_ptr back where we want it. */
1656 symname = (char *) xmalloc (ps - secname + sizeof "__stop_" + 1);
1657 symname[0] = bfd_get_symbol_leading_char (link_info.output_bfd);
1658 sprintf (symname + (symname[0] != 0), "__stop_%s", secname);
1659 lang_add_assignment (exp_provide (symname,
1660 exp_nameop (NAME, "."),
1664 /* Restore the global list pointer. */
1668 if (after != NULL && os->bfd_section != NULL)
1670 asection *snew, *as;
1672 snew = os->bfd_section;
1674 /* Shuffle the bfd section list to make the output file look
1675 neater. This is really only cosmetic. */
1676 if (place->section == NULL
1677 && after != (&lang_output_section_statement.head
1678 ->output_section_statement))
1680 asection *bfd_section = after->bfd_section;
1682 /* If the output statement hasn't been used to place any input
1683 sections (and thus doesn't have an output bfd_section),
1684 look for the closest prior output statement having an
1686 if (bfd_section == NULL)
1687 bfd_section = output_prev_sec_find (after);
1689 if (bfd_section != NULL && bfd_section != snew)
1690 place->section = &bfd_section->next;
1693 if (place->section == NULL)
1694 place->section = &link_info.output_bfd->sections;
1696 as = *place->section;
1700 /* Put the section at the end of the list. */
1702 /* Unlink the section. */
1703 bfd_section_list_remove (link_info.output_bfd, snew);
1705 /* Now tack it back on in the right place. */
1706 bfd_section_list_append (link_info.output_bfd, snew);
1708 else if (as != snew && as->prev != snew)
1710 /* Unlink the section. */
1711 bfd_section_list_remove (link_info.output_bfd, snew);
1713 /* Now tack it back on in the right place. */
1714 bfd_section_list_insert_before (link_info.output_bfd, as, snew);
1717 /* Save the end of this list. Further ophans of this type will
1718 follow the one we've just added. */
1719 place->section = &snew->next;
1721 /* The following is non-cosmetic. We try to put the output
1722 statements in some sort of reasonable order here, because they
1723 determine the final load addresses of the orphan sections.
1724 In addition, placing output statements in the wrong order may
1725 require extra segments. For instance, given a typical
1726 situation of all read-only sections placed in one segment and
1727 following that a segment containing all the read-write
1728 sections, we wouldn't want to place an orphan read/write
1729 section before or amongst the read-only ones. */
1730 if (add.head != NULL)
1732 lang_output_section_statement_type *newly_added_os;
1734 if (place->stmt == NULL)
1736 lang_statement_union_type **where = insert_os_after (after);
1741 place->os_tail = &after->next;
1745 /* Put it after the last orphan statement we added. */
1746 *add.tail = *place->stmt;
1747 *place->stmt = add.head;
1750 /* Fix the global list pointer if we happened to tack our
1751 new list at the tail. */
1752 if (*old->tail == add.head)
1753 old->tail = add.tail;
1755 /* Save the end of this list. */
1756 place->stmt = add.tail;
1758 /* Do the same for the list of output section statements. */
1759 newly_added_os = *os_tail;
1761 newly_added_os->prev = (lang_output_section_statement_type *)
1762 ((char *) place->os_tail
1763 - offsetof (lang_output_section_statement_type, next));
1764 newly_added_os->next = *place->os_tail;
1765 if (newly_added_os->next != NULL)
1766 newly_added_os->next->prev = newly_added_os;
1767 *place->os_tail = newly_added_os;
1768 place->os_tail = &newly_added_os->next;
1770 /* Fixing the global list pointer here is a little different.
1771 We added to the list in lang_enter_output_section_statement,
1772 trimmed off the new output_section_statment above when
1773 assigning *os_tail = NULL, but possibly added it back in
1774 the same place when assigning *place->os_tail. */
1775 if (*os_tail == NULL)
1776 lang_output_section_statement.tail
1777 = (lang_statement_union_type **) os_tail;
1784 lang_map_flags (flagword flag)
1786 if (flag & SEC_ALLOC)
1789 if (flag & SEC_CODE)
1792 if (flag & SEC_READONLY)
1795 if (flag & SEC_DATA)
1798 if (flag & SEC_LOAD)
1805 lang_memory_region_type *m;
1806 bfd_boolean dis_header_printed = FALSE;
1809 LANG_FOR_EACH_INPUT_STATEMENT (file)
1813 if ((file->the_bfd->flags & (BFD_LINKER_CREATED | DYNAMIC)) != 0
1814 || file->just_syms_flag)
1817 for (s = file->the_bfd->sections; s != NULL; s = s->next)
1818 if ((s->output_section == NULL
1819 || s->output_section->owner != link_info.output_bfd)
1820 && (s->flags & (SEC_LINKER_CREATED | SEC_KEEP)) == 0)
1822 if (! dis_header_printed)
1824 fprintf (config.map_file, _("\nDiscarded input sections\n\n"));
1825 dis_header_printed = TRUE;
1828 print_input_section (s);
1832 minfo (_("\nMemory Configuration\n\n"));
1833 fprintf (config.map_file, "%-16s %-18s %-18s %s\n",
1834 _("Name"), _("Origin"), _("Length"), _("Attributes"));
1836 for (m = lang_memory_region_list; m != NULL; m = m->next)
1841 fprintf (config.map_file, "%-16s ", m->name);
1843 sprintf_vma (buf, m->origin);
1844 minfo ("0x%s ", buf);
1852 minfo ("0x%V", m->length);
1853 if (m->flags || m->not_flags)
1861 lang_map_flags (m->flags);
1867 lang_map_flags (m->not_flags);
1874 fprintf (config.map_file, _("\nLinker script and memory map\n\n"));
1876 if (! link_info.reduce_memory_overheads)
1878 obstack_begin (&map_obstack, 1000);
1879 for (p = link_info.input_bfds; p != (bfd *) NULL; p = p->link_next)
1880 bfd_map_over_sections (p, init_map_userdata, 0);
1881 bfd_link_hash_traverse (link_info.hash, sort_def_symbol, 0);
1883 lang_statement_iteration ++;
1884 print_statements ();
1888 init_map_userdata (bfd *abfd ATTRIBUTE_UNUSED,
1890 void *data ATTRIBUTE_UNUSED)
1892 fat_section_userdata_type *new_data
1893 = ((fat_section_userdata_type *) (stat_alloc
1894 (sizeof (fat_section_userdata_type))));
1896 ASSERT (get_userdata (sec) == NULL);
1897 get_userdata (sec) = new_data;
1898 new_data->map_symbol_def_tail = &new_data->map_symbol_def_head;
1902 sort_def_symbol (struct bfd_link_hash_entry *hash_entry,
1903 void *info ATTRIBUTE_UNUSED)
1905 if (hash_entry->type == bfd_link_hash_defined
1906 || hash_entry->type == bfd_link_hash_defweak)
1908 struct fat_user_section_struct *ud;
1909 struct map_symbol_def *def;
1911 ud = get_userdata (hash_entry->u.def.section);
1914 /* ??? What do we have to do to initialize this beforehand? */
1915 /* The first time we get here is bfd_abs_section... */
1916 init_map_userdata (0, hash_entry->u.def.section, 0);
1917 ud = get_userdata (hash_entry->u.def.section);
1919 else if (!ud->map_symbol_def_tail)
1920 ud->map_symbol_def_tail = &ud->map_symbol_def_head;
1922 def = obstack_alloc (&map_obstack, sizeof *def);
1923 def->entry = hash_entry;
1924 *(ud->map_symbol_def_tail) = def;
1925 ud->map_symbol_def_tail = &def->next;
1930 /* Initialize an output section. */
1933 init_os (lang_output_section_statement_type *s, asection *isec,
1936 if (s->bfd_section != NULL)
1939 if (strcmp (s->name, DISCARD_SECTION_NAME) == 0)
1940 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME);
1942 if (s->constraint != SPECIAL)
1943 s->bfd_section = bfd_get_section_by_name (link_info.output_bfd, s->name);
1944 if (s->bfd_section == NULL)
1945 s->bfd_section = bfd_make_section_anyway_with_flags (link_info.output_bfd,
1947 if (s->bfd_section == NULL)
1949 einfo (_("%P%F: output format %s cannot represent section called %s\n"),
1950 link_info.output_bfd->xvec->name, s->name);
1952 s->bfd_section->output_section = s->bfd_section;
1953 s->bfd_section->output_offset = 0;
1955 if (!link_info.reduce_memory_overheads)
1957 fat_section_userdata_type *new
1958 = stat_alloc (sizeof (fat_section_userdata_type));
1959 memset (new, 0, sizeof (fat_section_userdata_type));
1960 get_userdata (s->bfd_section) = new;
1963 /* If there is a base address, make sure that any sections it might
1964 mention are initialized. */
1965 if (s->addr_tree != NULL)
1966 exp_init_os (s->addr_tree);
1968 if (s->load_base != NULL)
1969 exp_init_os (s->load_base);
1971 /* If supplied an alignment, set it. */
1972 if (s->section_alignment != -1)
1973 s->bfd_section->alignment_power = s->section_alignment;
1976 bfd_init_private_section_data (isec->owner, isec,
1977 link_info.output_bfd, s->bfd_section,
1981 /* Make sure that all output sections mentioned in an expression are
1985 exp_init_os (etree_type *exp)
1987 switch (exp->type.node_class)
1991 exp_init_os (exp->assign.src);
1995 exp_init_os (exp->binary.lhs);
1996 exp_init_os (exp->binary.rhs);
2000 exp_init_os (exp->trinary.cond);
2001 exp_init_os (exp->trinary.lhs);
2002 exp_init_os (exp->trinary.rhs);
2006 exp_init_os (exp->assert_s.child);
2010 exp_init_os (exp->unary.child);
2014 switch (exp->type.node_code)
2020 lang_output_section_statement_type *os;
2022 os = lang_output_section_find (exp->name.name);
2023 if (os != NULL && os->bfd_section == NULL)
2024 init_os (os, NULL, 0);
2035 section_already_linked (bfd *abfd, asection *sec, void *data)
2037 lang_input_statement_type *entry = data;
2039 /* If we are only reading symbols from this object, then we want to
2040 discard all sections. */
2041 if (entry->just_syms_flag)
2043 bfd_link_just_syms (abfd, sec, &link_info);
2047 if (!(abfd->flags & DYNAMIC))
2048 bfd_section_already_linked (abfd, sec, &link_info);
2051 /* The wild routines.
2053 These expand statements like *(.text) and foo.o to a list of
2054 explicit actions, like foo.o(.text), bar.o(.text) and
2055 foo.o(.text, .data). */
2057 /* Add SECTION to the output section OUTPUT. Do this by creating a
2058 lang_input_section statement which is placed at PTR. FILE is the
2059 input file which holds SECTION. */
2062 lang_add_section (lang_statement_list_type *ptr,
2064 lang_output_section_statement_type *output)
2066 flagword flags = section->flags;
2067 bfd_boolean discard;
2069 /* Discard sections marked with SEC_EXCLUDE. */
2070 discard = (flags & SEC_EXCLUDE) != 0;
2072 /* Discard input sections which are assigned to a section named
2073 DISCARD_SECTION_NAME. */
2074 if (strcmp (output->name, DISCARD_SECTION_NAME) == 0)
2077 /* Discard debugging sections if we are stripping debugging
2079 if ((link_info.strip == strip_debugger || link_info.strip == strip_all)
2080 && (flags & SEC_DEBUGGING) != 0)
2085 if (section->output_section == NULL)
2087 /* This prevents future calls from assigning this section. */
2088 section->output_section = bfd_abs_section_ptr;
2093 if (section->output_section == NULL)
2096 lang_input_section_type *new;
2099 flags = section->flags;
2101 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2102 to an output section, because we want to be able to include a
2103 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2104 section (I don't know why we want to do this, but we do).
2105 build_link_order in ldwrite.c handles this case by turning
2106 the embedded SEC_NEVER_LOAD section into a fill. */
2108 flags &= ~ SEC_NEVER_LOAD;
2110 switch (output->sectype)
2112 case normal_section:
2113 case overlay_section:
2115 case noalloc_section:
2116 flags &= ~SEC_ALLOC;
2118 case noload_section:
2120 flags |= SEC_NEVER_LOAD;
2124 if (output->bfd_section == NULL)
2125 init_os (output, section, flags);
2127 first = ! output->bfd_section->linker_has_input;
2128 output->bfd_section->linker_has_input = 1;
2130 if (!link_info.relocatable
2131 && !stripped_excluded_sections)
2133 asection *s = output->bfd_section->map_tail.s;
2134 output->bfd_section->map_tail.s = section;
2135 section->map_head.s = NULL;
2136 section->map_tail.s = s;
2138 s->map_head.s = section;
2140 output->bfd_section->map_head.s = section;
2143 /* Add a section reference to the list. */
2144 new = new_stat (lang_input_section, ptr);
2146 new->section = section;
2147 section->output_section = output->bfd_section;
2149 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2150 already been processed. One reason to do this is that on pe
2151 format targets, .text$foo sections go into .text and it's odd
2152 to see .text with SEC_LINK_ONCE set. */
2154 if (! link_info.relocatable)
2155 flags &= ~ (SEC_LINK_ONCE | SEC_LINK_DUPLICATES);
2157 /* If this is not the first input section, and the SEC_READONLY
2158 flag is not currently set, then don't set it just because the
2159 input section has it set. */
2161 if (! first && (output->bfd_section->flags & SEC_READONLY) == 0)
2162 flags &= ~ SEC_READONLY;
2164 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2166 && ((output->bfd_section->flags & (SEC_MERGE | SEC_STRINGS))
2167 != (flags & (SEC_MERGE | SEC_STRINGS))
2168 || ((flags & SEC_MERGE)
2169 && output->bfd_section->entsize != section->entsize)))
2171 output->bfd_section->flags &= ~ (SEC_MERGE | SEC_STRINGS);
2172 flags &= ~ (SEC_MERGE | SEC_STRINGS);
2175 output->bfd_section->flags |= flags;
2177 if (flags & SEC_MERGE)
2178 output->bfd_section->entsize = section->entsize;
2180 /* If SEC_READONLY is not set in the input section, then clear
2181 it from the output section. */
2182 if ((section->flags & SEC_READONLY) == 0)
2183 output->bfd_section->flags &= ~SEC_READONLY;
2185 /* Copy over SEC_SMALL_DATA. */
2186 if (section->flags & SEC_SMALL_DATA)
2187 output->bfd_section->flags |= SEC_SMALL_DATA;
2189 if (section->alignment_power > output->bfd_section->alignment_power)
2190 output->bfd_section->alignment_power = section->alignment_power;
2192 if (bfd_get_arch (section->owner) == bfd_arch_tic54x
2193 && (section->flags & SEC_TIC54X_BLOCK) != 0)
2195 output->bfd_section->flags |= SEC_TIC54X_BLOCK;
2196 /* FIXME: This value should really be obtained from the bfd... */
2197 output->block_value = 128;
2202 /* Handle wildcard sorting. This returns the lang_input_section which
2203 should follow the one we are going to create for SECTION and FILE,
2204 based on the sorting requirements of WILD. It returns NULL if the
2205 new section should just go at the end of the current list. */
2207 static lang_statement_union_type *
2208 wild_sort (lang_wild_statement_type *wild,
2209 struct wildcard_list *sec,
2210 lang_input_statement_type *file,
2213 const char *section_name;
2214 lang_statement_union_type *l;
2216 if (!wild->filenames_sorted
2217 && (sec == NULL || sec->spec.sorted == none))
2220 section_name = bfd_get_section_name (file->the_bfd, section);
2221 for (l = wild->children.head; l != NULL; l = l->header.next)
2223 lang_input_section_type *ls;
2225 if (l->header.type != lang_input_section_enum)
2227 ls = &l->input_section;
2229 /* Sorting by filename takes precedence over sorting by section
2232 if (wild->filenames_sorted)
2234 const char *fn, *ln;
2238 /* The PE support for the .idata section as generated by
2239 dlltool assumes that files will be sorted by the name of
2240 the archive and then the name of the file within the
2243 if (file->the_bfd != NULL
2244 && bfd_my_archive (file->the_bfd) != NULL)
2246 fn = bfd_get_filename (bfd_my_archive (file->the_bfd));
2251 fn = file->filename;
2255 if (bfd_my_archive (ls->section->owner) != NULL)
2257 ln = bfd_get_filename (bfd_my_archive (ls->section->owner));
2262 ln = ls->section->owner->filename;
2266 i = strcmp (fn, ln);
2275 fn = file->filename;
2277 ln = ls->section->owner->filename;
2279 i = strcmp (fn, ln);
2287 /* Here either the files are not sorted by name, or we are
2288 looking at the sections for this file. */
2290 if (sec != NULL && sec->spec.sorted != none)
2291 if (compare_section (sec->spec.sorted, section, ls->section) < 0)
2298 /* Expand a wild statement for a particular FILE. SECTION may be
2299 NULL, in which case it is a wild card. */
2302 output_section_callback (lang_wild_statement_type *ptr,
2303 struct wildcard_list *sec,
2305 lang_input_statement_type *file,
2308 lang_statement_union_type *before;
2310 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2311 if (unique_section_p (section))
2314 before = wild_sort (ptr, sec, file, section);
2316 /* Here BEFORE points to the lang_input_section which
2317 should follow the one we are about to add. If BEFORE
2318 is NULL, then the section should just go at the end
2319 of the current list. */
2322 lang_add_section (&ptr->children, section,
2323 (lang_output_section_statement_type *) output);
2326 lang_statement_list_type list;
2327 lang_statement_union_type **pp;
2329 lang_list_init (&list);
2330 lang_add_section (&list, section,
2331 (lang_output_section_statement_type *) output);
2333 /* If we are discarding the section, LIST.HEAD will
2335 if (list.head != NULL)
2337 ASSERT (list.head->header.next == NULL);
2339 for (pp = &ptr->children.head;
2341 pp = &(*pp)->header.next)
2342 ASSERT (*pp != NULL);
2344 list.head->header.next = *pp;
2350 /* Check if all sections in a wild statement for a particular FILE
2354 check_section_callback (lang_wild_statement_type *ptr ATTRIBUTE_UNUSED,
2355 struct wildcard_list *sec ATTRIBUTE_UNUSED,
2357 lang_input_statement_type *file ATTRIBUTE_UNUSED,
2360 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2361 if (unique_section_p (section))
2364 if (section->output_section == NULL && (section->flags & SEC_READONLY) == 0)
2365 ((lang_output_section_statement_type *) data)->all_input_readonly = FALSE;
2368 /* This is passed a file name which must have been seen already and
2369 added to the statement tree. We will see if it has been opened
2370 already and had its symbols read. If not then we'll read it. */
2372 static lang_input_statement_type *
2373 lookup_name (const char *name)
2375 lang_input_statement_type *search;
2377 for (search = (lang_input_statement_type *) input_file_chain.head;
2379 search = (lang_input_statement_type *) search->next_real_file)
2381 /* Use the local_sym_name as the name of the file that has
2382 already been loaded as filename might have been transformed
2383 via the search directory lookup mechanism. */
2384 const char *filename = search->local_sym_name;
2386 if (filename != NULL
2387 && strcmp (filename, name) == 0)
2392 search = new_afile (name, lang_input_file_is_search_file_enum,
2393 default_target, FALSE);
2395 /* If we have already added this file, or this file is not real
2396 don't add this file. */
2397 if (search->loaded || !search->real)
2400 if (! load_symbols (search, NULL))
2406 /* Save LIST as a list of libraries whose symbols should not be exported. */
2411 struct excluded_lib *next;
2413 static struct excluded_lib *excluded_libs;
2416 add_excluded_libs (const char *list)
2418 const char *p = list, *end;
2422 struct excluded_lib *entry;
2423 end = strpbrk (p, ",:");
2425 end = p + strlen (p);
2426 entry = xmalloc (sizeof (*entry));
2427 entry->next = excluded_libs;
2428 entry->name = xmalloc (end - p + 1);
2429 memcpy (entry->name, p, end - p);
2430 entry->name[end - p] = '\0';
2431 excluded_libs = entry;
2439 check_excluded_libs (bfd *abfd)
2441 struct excluded_lib *lib = excluded_libs;
2445 int len = strlen (lib->name);
2446 const char *filename = lbasename (abfd->filename);
2448 if (strcmp (lib->name, "ALL") == 0)
2450 abfd->no_export = TRUE;
2454 if (strncmp (lib->name, filename, len) == 0
2455 && (filename[len] == '\0'
2456 || (filename[len] == '.' && filename[len + 1] == 'a'
2457 && filename[len + 2] == '\0')))
2459 abfd->no_export = TRUE;
2467 /* Get the symbols for an input file. */
2470 load_symbols (lang_input_statement_type *entry,
2471 lang_statement_list_type *place)
2478 ldfile_open_file (entry);
2480 if (! bfd_check_format (entry->the_bfd, bfd_archive)
2481 && ! bfd_check_format_matches (entry->the_bfd, bfd_object, &matching))
2484 lang_statement_list_type *hold;
2485 bfd_boolean bad_load = TRUE;
2486 bfd_boolean save_ldlang_sysrooted_script;
2487 bfd_boolean save_as_needed, save_add_needed;
2489 err = bfd_get_error ();
2491 /* See if the emulation has some special knowledge. */
2492 if (ldemul_unrecognized_file (entry))
2495 if (err == bfd_error_file_ambiguously_recognized)
2499 einfo (_("%B: file not recognized: %E\n"), entry->the_bfd);
2500 einfo (_("%B: matching formats:"), entry->the_bfd);
2501 for (p = matching; *p != NULL; p++)
2505 else if (err != bfd_error_file_not_recognized
2507 einfo (_("%F%B: file not recognized: %E\n"), entry->the_bfd);
2511 bfd_close (entry->the_bfd);
2512 entry->the_bfd = NULL;
2514 /* Try to interpret the file as a linker script. */
2515 ldfile_open_command_file (entry->filename);
2519 save_ldlang_sysrooted_script = ldlang_sysrooted_script;
2520 ldlang_sysrooted_script = entry->sysrooted;
2521 save_as_needed = as_needed;
2522 as_needed = entry->as_needed;
2523 save_add_needed = add_needed;
2524 add_needed = entry->add_needed;
2526 ldfile_assumed_script = TRUE;
2527 parser_input = input_script;
2528 /* We want to use the same -Bdynamic/-Bstatic as the one for
2530 config.dynamic_link = entry->dynamic;
2532 ldfile_assumed_script = FALSE;
2534 ldlang_sysrooted_script = save_ldlang_sysrooted_script;
2535 as_needed = save_as_needed;
2536 add_needed = save_add_needed;
2542 if (ldemul_recognized_file (entry))
2545 /* We don't call ldlang_add_file for an archive. Instead, the
2546 add_symbols entry point will call ldlang_add_file, via the
2547 add_archive_element callback, for each element of the archive
2549 switch (bfd_get_format (entry->the_bfd))
2555 ldlang_add_file (entry);
2556 if (trace_files || trace_file_tries)
2557 info_msg ("%I\n", entry);
2561 check_excluded_libs (entry->the_bfd);
2563 if (entry->whole_archive)
2566 bfd_boolean loaded = TRUE;
2570 member = bfd_openr_next_archived_file (entry->the_bfd, member);
2575 if (! bfd_check_format (member, bfd_object))
2577 einfo (_("%F%B: member %B in archive is not an object\n"),
2578 entry->the_bfd, member);
2582 if (! ((*link_info.callbacks->add_archive_element)
2583 (&link_info, member, "--whole-archive")))
2586 if (! bfd_link_add_symbols (member, &link_info))
2588 einfo (_("%F%B: could not read symbols: %E\n"), member);
2593 entry->loaded = loaded;
2599 if (bfd_link_add_symbols (entry->the_bfd, &link_info))
2600 entry->loaded = TRUE;
2602 einfo (_("%F%B: could not read symbols: %E\n"), entry->the_bfd);
2604 return entry->loaded;
2607 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2608 may be NULL, indicating that it is a wildcard. Separate
2609 lang_input_section statements are created for each part of the
2610 expansion; they are added after the wild statement S. OUTPUT is
2611 the output section. */
2614 wild (lang_wild_statement_type *s,
2615 const char *target ATTRIBUTE_UNUSED,
2616 lang_output_section_statement_type *output)
2618 struct wildcard_list *sec;
2620 if (s->handler_data[0]
2621 && s->handler_data[0]->spec.sorted == by_name
2622 && !s->filenames_sorted)
2624 lang_section_bst_type *tree;
2626 walk_wild (s, output_section_callback_fast, output);
2631 output_section_callback_tree_to_list (s, tree, output);
2636 walk_wild (s, output_section_callback, output);
2638 if (default_common_section == NULL)
2639 for (sec = s->section_list; sec != NULL; sec = sec->next)
2640 if (sec->spec.name != NULL && strcmp (sec->spec.name, "COMMON") == 0)
2642 /* Remember the section that common is going to in case we
2643 later get something which doesn't know where to put it. */
2644 default_common_section = output;
2649 /* Return TRUE iff target is the sought target. */
2652 get_target (const bfd_target *target, void *data)
2654 const char *sought = data;
2656 return strcmp (target->name, sought) == 0;
2659 /* Like strcpy() but convert to lower case as well. */
2662 stricpy (char *dest, char *src)
2666 while ((c = *src++) != 0)
2667 *dest++ = TOLOWER (c);
2672 /* Remove the first occurrence of needle (if any) in haystack
2676 strcut (char *haystack, char *needle)
2678 haystack = strstr (haystack, needle);
2684 for (src = haystack + strlen (needle); *src;)
2685 *haystack++ = *src++;
2691 /* Compare two target format name strings.
2692 Return a value indicating how "similar" they are. */
2695 name_compare (char *first, char *second)
2701 copy1 = xmalloc (strlen (first) + 1);
2702 copy2 = xmalloc (strlen (second) + 1);
2704 /* Convert the names to lower case. */
2705 stricpy (copy1, first);
2706 stricpy (copy2, second);
2708 /* Remove size and endian strings from the name. */
2709 strcut (copy1, "big");
2710 strcut (copy1, "little");
2711 strcut (copy2, "big");
2712 strcut (copy2, "little");
2714 /* Return a value based on how many characters match,
2715 starting from the beginning. If both strings are
2716 the same then return 10 * their length. */
2717 for (result = 0; copy1[result] == copy2[result]; result++)
2718 if (copy1[result] == 0)
2730 /* Set by closest_target_match() below. */
2731 static const bfd_target *winner;
2733 /* Scan all the valid bfd targets looking for one that has the endianness
2734 requirement that was specified on the command line, and is the nearest
2735 match to the original output target. */
2738 closest_target_match (const bfd_target *target, void *data)
2740 const bfd_target *original = data;
2742 if (command_line.endian == ENDIAN_BIG
2743 && target->byteorder != BFD_ENDIAN_BIG)
2746 if (command_line.endian == ENDIAN_LITTLE
2747 && target->byteorder != BFD_ENDIAN_LITTLE)
2750 /* Must be the same flavour. */
2751 if (target->flavour != original->flavour)
2754 /* Ignore generic big and little endian elf vectors. */
2755 if (strcmp (target->name, "elf32-big") == 0
2756 || strcmp (target->name, "elf64-big") == 0
2757 || strcmp (target->name, "elf32-little") == 0
2758 || strcmp (target->name, "elf64-little") == 0)
2761 /* If we have not found a potential winner yet, then record this one. */
2768 /* Oh dear, we now have two potential candidates for a successful match.
2769 Compare their names and choose the better one. */
2770 if (name_compare (target->name, original->name)
2771 > name_compare (winner->name, original->name))
2774 /* Keep on searching until wqe have checked them all. */
2778 /* Return the BFD target format of the first input file. */
2781 get_first_input_target (void)
2783 char *target = NULL;
2785 LANG_FOR_EACH_INPUT_STATEMENT (s)
2787 if (s->header.type == lang_input_statement_enum
2790 ldfile_open_file (s);
2792 if (s->the_bfd != NULL
2793 && bfd_check_format (s->the_bfd, bfd_object))
2795 target = bfd_get_target (s->the_bfd);
2807 lang_get_output_target (void)
2811 /* Has the user told us which output format to use? */
2812 if (output_target != NULL)
2813 return output_target;
2815 /* No - has the current target been set to something other than
2817 if (current_target != default_target)
2818 return current_target;
2820 /* No - can we determine the format of the first input file? */
2821 target = get_first_input_target ();
2825 /* Failed - use the default output target. */
2826 return default_target;
2829 /* Open the output file. */
2832 open_output (const char *name)
2834 output_target = lang_get_output_target ();
2836 /* Has the user requested a particular endianness on the command
2838 if (command_line.endian != ENDIAN_UNSET)
2840 const bfd_target *target;
2841 enum bfd_endian desired_endian;
2843 /* Get the chosen target. */
2844 target = bfd_search_for_target (get_target, (void *) output_target);
2846 /* If the target is not supported, we cannot do anything. */
2849 if (command_line.endian == ENDIAN_BIG)
2850 desired_endian = BFD_ENDIAN_BIG;
2852 desired_endian = BFD_ENDIAN_LITTLE;
2854 /* See if the target has the wrong endianness. This should
2855 not happen if the linker script has provided big and
2856 little endian alternatives, but some scrips don't do
2858 if (target->byteorder != desired_endian)
2860 /* If it does, then see if the target provides
2861 an alternative with the correct endianness. */
2862 if (target->alternative_target != NULL
2863 && (target->alternative_target->byteorder == desired_endian))
2864 output_target = target->alternative_target->name;
2867 /* Try to find a target as similar as possible to
2868 the default target, but which has the desired
2869 endian characteristic. */
2870 bfd_search_for_target (closest_target_match,
2873 /* Oh dear - we could not find any targets that
2874 satisfy our requirements. */
2876 einfo (_("%P: warning: could not find any targets"
2877 " that match endianness requirement\n"));
2879 output_target = winner->name;
2885 link_info.output_bfd = bfd_openw (name, output_target);
2887 if (link_info.output_bfd == NULL)
2889 if (bfd_get_error () == bfd_error_invalid_target)
2890 einfo (_("%P%F: target %s not found\n"), output_target);
2892 einfo (_("%P%F: cannot open output file %s: %E\n"), name);
2895 delete_output_file_on_failure = TRUE;
2897 if (! bfd_set_format (link_info.output_bfd, bfd_object))
2898 einfo (_("%P%F:%s: can not make object file: %E\n"), name);
2899 if (! bfd_set_arch_mach (link_info.output_bfd,
2900 ldfile_output_architecture,
2901 ldfile_output_machine))
2902 einfo (_("%P%F:%s: can not set architecture: %E\n"), name);
2904 link_info.hash = bfd_link_hash_table_create (link_info.output_bfd);
2905 if (link_info.hash == NULL)
2906 einfo (_("%P%F: can not create hash table: %E\n"));
2908 bfd_set_gp_size (link_info.output_bfd, g_switch_value);
2912 ldlang_open_output (lang_statement_union_type *statement)
2914 switch (statement->header.type)
2916 case lang_output_statement_enum:
2917 ASSERT (link_info.output_bfd == NULL);
2918 open_output (statement->output_statement.name);
2919 ldemul_set_output_arch ();
2920 if (config.magic_demand_paged && !link_info.relocatable)
2921 link_info.output_bfd->flags |= D_PAGED;
2923 link_info.output_bfd->flags &= ~D_PAGED;
2924 if (config.text_read_only)
2925 link_info.output_bfd->flags |= WP_TEXT;
2927 link_info.output_bfd->flags &= ~WP_TEXT;
2928 if (link_info.traditional_format)
2929 link_info.output_bfd->flags |= BFD_TRADITIONAL_FORMAT;
2931 link_info.output_bfd->flags &= ~BFD_TRADITIONAL_FORMAT;
2934 case lang_target_statement_enum:
2935 current_target = statement->target_statement.target;
2942 /* Convert between addresses in bytes and sizes in octets.
2943 For currently supported targets, octets_per_byte is always a power
2944 of two, so we can use shifts. */
2945 #define TO_ADDR(X) ((X) >> opb_shift)
2946 #define TO_SIZE(X) ((X) << opb_shift)
2948 /* Support the above. */
2949 static unsigned int opb_shift = 0;
2954 unsigned x = bfd_arch_mach_octets_per_byte (ldfile_output_architecture,
2955 ldfile_output_machine);
2958 while ((x & 1) == 0)
2966 /* Open all the input files. */
2969 open_input_bfds (lang_statement_union_type *s, bfd_boolean force)
2971 for (; s != NULL; s = s->header.next)
2973 switch (s->header.type)
2975 case lang_constructors_statement_enum:
2976 open_input_bfds (constructor_list.head, force);
2978 case lang_output_section_statement_enum:
2979 open_input_bfds (s->output_section_statement.children.head, force);
2981 case lang_wild_statement_enum:
2982 /* Maybe we should load the file's symbols. */
2983 if (s->wild_statement.filename
2984 && !wildcardp (s->wild_statement.filename)
2985 && !archive_path (s->wild_statement.filename))
2986 lookup_name (s->wild_statement.filename);
2987 open_input_bfds (s->wild_statement.children.head, force);
2989 case lang_group_statement_enum:
2991 struct bfd_link_hash_entry *undefs;
2993 /* We must continually search the entries in the group
2994 until no new symbols are added to the list of undefined
2999 undefs = link_info.hash->undefs_tail;
3000 open_input_bfds (s->group_statement.children.head, TRUE);
3002 while (undefs != link_info.hash->undefs_tail);
3005 case lang_target_statement_enum:
3006 current_target = s->target_statement.target;
3008 case lang_input_statement_enum:
3009 if (s->input_statement.real)
3011 lang_statement_list_type add;
3013 s->input_statement.target = current_target;
3015 /* If we are being called from within a group, and this
3016 is an archive which has already been searched, then
3017 force it to be researched unless the whole archive
3018 has been loaded already. */
3020 && !s->input_statement.whole_archive
3021 && s->input_statement.loaded
3022 && bfd_check_format (s->input_statement.the_bfd,
3024 s->input_statement.loaded = FALSE;
3026 lang_list_init (&add);
3028 if (! load_symbols (&s->input_statement, &add))
3029 config.make_executable = FALSE;
3031 if (add.head != NULL)
3033 *add.tail = s->header.next;
3034 s->header.next = add.head;
3044 /* Add a symbol to a hash of symbols used in DEFINED (NAME) expressions. */
3047 lang_track_definedness (const char *name)
3049 if (bfd_hash_lookup (&lang_definedness_table, name, TRUE, FALSE) == NULL)
3050 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name);
3053 /* New-function for the definedness hash table. */
3055 static struct bfd_hash_entry *
3056 lang_definedness_newfunc (struct bfd_hash_entry *entry,
3057 struct bfd_hash_table *table ATTRIBUTE_UNUSED,
3058 const char *name ATTRIBUTE_UNUSED)
3060 struct lang_definedness_hash_entry *ret
3061 = (struct lang_definedness_hash_entry *) entry;
3064 ret = (struct lang_definedness_hash_entry *)
3065 bfd_hash_allocate (table, sizeof (struct lang_definedness_hash_entry));
3068 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name);
3070 ret->iteration = -1;
3074 /* Return the iteration when the definition of NAME was last updated. A
3075 value of -1 means that the symbol is not defined in the linker script
3076 or the command line, but may be defined in the linker symbol table. */
3079 lang_symbol_definition_iteration (const char *name)
3081 struct lang_definedness_hash_entry *defentry
3082 = (struct lang_definedness_hash_entry *)
3083 bfd_hash_lookup (&lang_definedness_table, name, FALSE, FALSE);
3085 /* We've already created this one on the presence of DEFINED in the
3086 script, so it can't be NULL unless something is borked elsewhere in
3088 if (defentry == NULL)
3091 return defentry->iteration;
3094 /* Update the definedness state of NAME. */
3097 lang_update_definedness (const char *name, struct bfd_link_hash_entry *h)
3099 struct lang_definedness_hash_entry *defentry
3100 = (struct lang_definedness_hash_entry *)
3101 bfd_hash_lookup (&lang_definedness_table, name, FALSE, FALSE);
3103 /* We don't keep track of symbols not tested with DEFINED. */
3104 if (defentry == NULL)
3107 /* If the symbol was already defined, and not from an earlier statement
3108 iteration, don't update the definedness iteration, because that'd
3109 make the symbol seem defined in the linker script at this point, and
3110 it wasn't; it was defined in some object. If we do anyway, DEFINED
3111 would start to yield false before this point and the construct "sym =
3112 DEFINED (sym) ? sym : X;" would change sym to X despite being defined
3114 if (h->type != bfd_link_hash_undefined
3115 && h->type != bfd_link_hash_common
3116 && h->type != bfd_link_hash_new
3117 && defentry->iteration == -1)
3120 defentry->iteration = lang_statement_iteration;
3123 /* Add the supplied name to the symbol table as an undefined reference.
3124 This is a two step process as the symbol table doesn't even exist at
3125 the time the ld command line is processed. First we put the name
3126 on a list, then, once the output file has been opened, transfer the
3127 name to the symbol table. */
3129 typedef struct bfd_sym_chain ldlang_undef_chain_list_type;
3131 #define ldlang_undef_chain_list_head entry_symbol.next
3134 ldlang_add_undef (const char *const name)
3136 ldlang_undef_chain_list_type *new =
3137 stat_alloc (sizeof (ldlang_undef_chain_list_type));
3139 new->next = ldlang_undef_chain_list_head;
3140 ldlang_undef_chain_list_head = new;
3142 new->name = xstrdup (name);
3144 if (link_info.output_bfd != NULL)
3145 insert_undefined (new->name);
3148 /* Insert NAME as undefined in the symbol table. */
3151 insert_undefined (const char *name)
3153 struct bfd_link_hash_entry *h;
3155 h = bfd_link_hash_lookup (link_info.hash, name, TRUE, FALSE, TRUE);
3157 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
3158 if (h->type == bfd_link_hash_new)
3160 h->type = bfd_link_hash_undefined;
3161 h->u.undef.abfd = NULL;
3162 bfd_link_add_undef (link_info.hash, h);
3166 /* Run through the list of undefineds created above and place them
3167 into the linker hash table as undefined symbols belonging to the
3171 lang_place_undefineds (void)
3173 ldlang_undef_chain_list_type *ptr;
3175 for (ptr = ldlang_undef_chain_list_head; ptr != NULL; ptr = ptr->next)
3176 insert_undefined (ptr->name);
3179 /* Check for all readonly or some readwrite sections. */
3182 check_input_sections
3183 (lang_statement_union_type *s,
3184 lang_output_section_statement_type *output_section_statement)
3186 for (; s != (lang_statement_union_type *) NULL; s = s->header.next)
3188 switch (s->header.type)
3190 case lang_wild_statement_enum:
3191 walk_wild (&s->wild_statement, check_section_callback,
3192 output_section_statement);
3193 if (! output_section_statement->all_input_readonly)
3196 case lang_constructors_statement_enum:
3197 check_input_sections (constructor_list.head,
3198 output_section_statement);
3199 if (! output_section_statement->all_input_readonly)
3202 case lang_group_statement_enum:
3203 check_input_sections (s->group_statement.children.head,
3204 output_section_statement);
3205 if (! output_section_statement->all_input_readonly)
3214 /* Update wildcard statements if needed. */
3217 update_wild_statements (lang_statement_union_type *s)
3219 struct wildcard_list *sec;
3221 switch (sort_section)
3231 for (; s != NULL; s = s->header.next)
3233 switch (s->header.type)
3238 case lang_wild_statement_enum:
3239 sec = s->wild_statement.section_list;
3240 for (sec = s->wild_statement.section_list; sec != NULL;
3243 switch (sec->spec.sorted)
3246 sec->spec.sorted = sort_section;
3249 if (sort_section == by_alignment)
3250 sec->spec.sorted = by_name_alignment;
3253 if (sort_section == by_name)
3254 sec->spec.sorted = by_alignment_name;
3262 case lang_constructors_statement_enum:
3263 update_wild_statements (constructor_list.head);
3266 case lang_output_section_statement_enum:
3267 update_wild_statements
3268 (s->output_section_statement.children.head);
3271 case lang_group_statement_enum:
3272 update_wild_statements (s->group_statement.children.head);
3280 /* Open input files and attach to output sections. */
3283 map_input_to_output_sections
3284 (lang_statement_union_type *s, const char *target,
3285 lang_output_section_statement_type *os)
3289 for (; s != NULL; s = s->header.next)
3291 switch (s->header.type)
3293 case lang_wild_statement_enum:
3294 wild (&s->wild_statement, target, os);
3296 case lang_constructors_statement_enum:
3297 map_input_to_output_sections (constructor_list.head,
3301 case lang_output_section_statement_enum:
3302 if (s->output_section_statement.constraint)
3304 if (s->output_section_statement.constraint != ONLY_IF_RW
3305 && s->output_section_statement.constraint != ONLY_IF_RO)
3307 s->output_section_statement.all_input_readonly = TRUE;
3308 check_input_sections (s->output_section_statement.children.head,
3309 &s->output_section_statement);
3310 if ((s->output_section_statement.all_input_readonly
3311 && s->output_section_statement.constraint == ONLY_IF_RW)
3312 || (!s->output_section_statement.all_input_readonly
3313 && s->output_section_statement.constraint == ONLY_IF_RO))
3315 s->output_section_statement.constraint = -1;
3320 map_input_to_output_sections (s->output_section_statement.children.head,
3322 &s->output_section_statement);
3324 case lang_output_statement_enum:
3326 case lang_target_statement_enum:
3327 target = s->target_statement.target;
3329 case lang_group_statement_enum:
3330 map_input_to_output_sections (s->group_statement.children.head,
3334 case lang_data_statement_enum:
3335 /* Make sure that any sections mentioned in the expression
3337 exp_init_os (s->data_statement.exp);
3338 flags = SEC_HAS_CONTENTS;
3339 /* The output section gets contents, and then we inspect for
3340 any flags set in the input script which override any ALLOC. */
3341 if (!(os->flags & SEC_NEVER_LOAD))
3342 flags |= SEC_ALLOC | SEC_LOAD;
3343 if (os->bfd_section == NULL)
3344 init_os (os, NULL, flags);
3346 os->bfd_section->flags |= flags;
3348 case lang_input_section_enum:
3350 case lang_fill_statement_enum:
3351 case lang_object_symbols_statement_enum:
3352 case lang_reloc_statement_enum:
3353 case lang_padding_statement_enum:
3354 case lang_input_statement_enum:
3355 if (os != NULL && os->bfd_section == NULL)
3356 init_os (os, NULL, 0);
3358 case lang_assignment_statement_enum:
3359 if (os != NULL && os->bfd_section == NULL)
3360 init_os (os, NULL, 0);
3362 /* Make sure that any sections mentioned in the assignment
3364 exp_init_os (s->assignment_statement.exp);
3366 case lang_address_statement_enum:
3367 /* Mark the specified section with the supplied address.
3368 If this section was actually a segment marker, then the
3369 directive is ignored if the linker script explicitly
3370 processed the segment marker. Originally, the linker
3371 treated segment directives (like -Ttext on the
3372 command-line) as section directives. We honor the
3373 section directive semantics for backwards compatibilty;
3374 linker scripts that do not specifically check for
3375 SEGMENT_START automatically get the old semantics. */
3376 if (!s->address_statement.segment
3377 || !s->address_statement.segment->used)
3379 lang_output_section_statement_type *aos
3380 = (lang_output_section_statement_lookup
3381 (s->address_statement.section_name, 0, TRUE));
3383 if (aos->bfd_section == NULL)
3384 init_os (aos, NULL, 0);
3385 aos->addr_tree = s->address_statement.address;
3388 case lang_insert_statement_enum:
3394 /* An insert statement snips out all the linker statements from the
3395 start of the list and places them after the output section
3396 statement specified by the insert. This operation is complicated
3397 by the fact that we keep a doubly linked list of output section
3398 statements as well as the singly linked list of all statements. */
3401 process_insert_statements (void)
3403 lang_statement_union_type **s;
3404 lang_output_section_statement_type *first_os = NULL;
3405 lang_output_section_statement_type *last_os = NULL;
3406 lang_output_section_statement_type *os;
3408 /* "start of list" is actually the statement immediately after
3409 the special abs_section output statement, so that it isn't
3411 s = &lang_output_section_statement.head;
3412 while (*(s = &(*s)->header.next) != NULL)
3414 if ((*s)->header.type == lang_output_section_statement_enum)
3416 /* Keep pointers to the first and last output section
3417 statement in the sequence we may be about to move. */
3418 last_os = &(*s)->output_section_statement;
3420 /* Set constraint negative so that lang_output_section_find
3421 won't match this output section statement. At this
3422 stage in linking constraint has values in the range
3423 [-1, ONLY_IN_RW]. */
3424 last_os->constraint = -2 - last_os->constraint;
3425 if (first_os == NULL)
3428 else if ((*s)->header.type == lang_insert_statement_enum)
3430 lang_insert_statement_type *i = &(*s)->insert_statement;
3431 lang_output_section_statement_type *where;
3432 lang_statement_union_type **ptr;
3433 lang_statement_union_type *first;
3435 where = lang_output_section_find (i->where);
3436 if (where != NULL && i->is_before)
3439 where = where->prev;
3440 while (where != NULL && where->constraint < 0);
3444 einfo (_("%F%P: %s not found for insert\n"), i->where);
3448 /* Deal with reordering the output section statement list. */
3449 if (last_os != NULL)
3451 asection *first_sec, *last_sec;
3452 struct lang_output_section_statement_struct **next;
3454 /* Snip out the output sections we are moving. */
3455 first_os->prev->next = last_os->next;
3456 if (last_os->next == NULL)
3458 next = &first_os->prev->next;
3459 lang_output_section_statement.tail
3460 = (lang_statement_union_type **) next;
3463 last_os->next->prev = first_os->prev;
3464 /* Add them in at the new position. */
3465 last_os->next = where->next;
3466 if (where->next == NULL)
3468 next = &last_os->next;
3469 lang_output_section_statement.tail
3470 = (lang_statement_union_type **) next;
3473 where->next->prev = last_os;
3474 first_os->prev = where;
3475 where->next = first_os;
3477 /* Move the bfd sections in the same way. */
3480 for (os = first_os; os != NULL; os = os->next)
3482 os->constraint = -2 - os->constraint;
3483 if (os->bfd_section != NULL
3484 && os->bfd_section->owner != NULL)
3486 last_sec = os->bfd_section;
3487 if (first_sec == NULL)
3488 first_sec = last_sec;
3493 if (last_sec != NULL)
3495 asection *sec = where->bfd_section;
3497 sec = output_prev_sec_find (where);
3499 /* The place we want to insert must come after the
3500 sections we are moving. So if we find no
3501 section or if the section is the same as our
3502 last section, then no move is needed. */
3503 if (sec != NULL && sec != last_sec)
3505 /* Trim them off. */
3506 if (first_sec->prev != NULL)
3507 first_sec->prev->next = last_sec->next;
3509 link_info.output_bfd->sections = last_sec->next;
3510 if (last_sec->next != NULL)
3511 last_sec->next->prev = first_sec->prev;
3513 link_info.output_bfd->section_last = first_sec->prev;
3515 last_sec->next = sec->next;
3516 if (sec->next != NULL)
3517 sec->next->prev = last_sec;
3519 link_info.output_bfd->section_last = last_sec;
3520 first_sec->prev = sec;
3521 sec->next = first_sec;
3529 ptr = insert_os_after (where);
3530 /* Snip everything after the abs_section output statement we
3531 know is at the start of the list, up to and including
3532 the insert statement we are currently processing. */
3533 first = lang_output_section_statement.head->header.next;
3534 lang_output_section_statement.head->header.next = (*s)->header.next;
3535 /* Add them back where they belong. */
3538 statement_list.tail = s;
3540 s = &lang_output_section_statement.head;
3544 /* Undo constraint twiddling. */
3545 for (os = first_os; os != NULL; os = os->next)
3547 os->constraint = -2 - os->constraint;
3553 /* An output section might have been removed after its statement was
3554 added. For example, ldemul_before_allocation can remove dynamic
3555 sections if they turn out to be not needed. Clean them up here. */
3558 strip_excluded_output_sections (void)
3560 lang_output_section_statement_type *os;
3562 /* Run lang_size_sections (if not already done). */
3563 if (expld.phase != lang_mark_phase_enum)
3565 expld.phase = lang_mark_phase_enum;
3566 expld.dataseg.phase = exp_dataseg_none;
3567 one_lang_size_sections_pass (NULL, FALSE);
3568 lang_reset_memory_regions ();
3571 for (os = &lang_output_section_statement.head->output_section_statement;
3575 asection *output_section;
3576 bfd_boolean exclude;
3578 if (os->constraint < 0)
3581 output_section = os->bfd_section;
3582 if (output_section == NULL)
3585 exclude = (output_section->rawsize == 0
3586 && (output_section->flags & SEC_KEEP) == 0
3587 && !bfd_section_removed_from_list (link_info.output_bfd,
3590 /* Some sections have not yet been sized, notably .gnu.version,
3591 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3592 input sections, so don't drop output sections that have such
3593 input sections unless they are also marked SEC_EXCLUDE. */
3594 if (exclude && output_section->map_head.s != NULL)
3598 for (s = output_section->map_head.s; s != NULL; s = s->map_head.s)
3599 if ((s->flags & SEC_LINKER_CREATED) != 0
3600 && (s->flags & SEC_EXCLUDE) == 0)
3607 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3608 output_section->map_head.link_order = NULL;
3609 output_section->map_tail.link_order = NULL;
3613 /* We don't set bfd_section to NULL since bfd_section of the
3614 removed output section statement may still be used. */
3615 if (!os->section_relative_symbol
3616 && !os->update_dot_tree)
3618 output_section->flags |= SEC_EXCLUDE;
3619 bfd_section_list_remove (link_info.output_bfd, output_section);
3620 link_info.output_bfd->section_count--;
3624 /* Stop future calls to lang_add_section from messing with map_head
3625 and map_tail link_order fields. */
3626 stripped_excluded_sections = TRUE;
3630 print_output_section_statement
3631 (lang_output_section_statement_type *output_section_statement)
3633 asection *section = output_section_statement->bfd_section;
3636 if (output_section_statement != abs_output_section)
3638 minfo ("\n%s", output_section_statement->name);
3640 if (section != NULL)
3642 print_dot = section->vma;
3644 len = strlen (output_section_statement->name);
3645 if (len >= SECTION_NAME_MAP_LENGTH - 1)
3650 while (len < SECTION_NAME_MAP_LENGTH)
3656 minfo ("0x%V %W", section->vma, section->size);
3658 if (section->vma != section->lma)
3659 minfo (_(" load address 0x%V"), section->lma);
3661 if (output_section_statement->update_dot_tree != NULL)
3662 exp_fold_tree (output_section_statement->update_dot_tree,
3663 bfd_abs_section_ptr, &print_dot);
3669 print_statement_list (output_section_statement->children.head,
3670 output_section_statement);
3673 /* Scan for the use of the destination in the right hand side
3674 of an expression. In such cases we will not compute the
3675 correct expression, since the value of DST that is used on
3676 the right hand side will be its final value, not its value
3677 just before this expression is evaluated. */
3680 scan_for_self_assignment (const char * dst, etree_type * rhs)
3682 if (rhs == NULL || dst == NULL)
3685 switch (rhs->type.node_class)
3688 return scan_for_self_assignment (dst, rhs->binary.lhs)
3689 || scan_for_self_assignment (dst, rhs->binary.rhs);
3692 return scan_for_self_assignment (dst, rhs->trinary.lhs)
3693 || scan_for_self_assignment (dst, rhs->trinary.rhs);
3696 case etree_provided:
3698 if (strcmp (dst, rhs->assign.dst) == 0)
3700 return scan_for_self_assignment (dst, rhs->assign.src);
3703 return scan_for_self_assignment (dst, rhs->unary.child);
3707 return strcmp (dst, rhs->value.str) == 0;
3712 return strcmp (dst, rhs->name.name) == 0;
3724 print_assignment (lang_assignment_statement_type *assignment,
3725 lang_output_section_statement_type *output_section)
3729 bfd_boolean computation_is_valid = TRUE;
3732 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
3735 if (assignment->exp->type.node_class == etree_assert)
3738 tree = assignment->exp->assert_s.child;
3739 computation_is_valid = TRUE;
3743 const char *dst = assignment->exp->assign.dst;
3745 is_dot = (dst[0] == '.' && dst[1] == 0);
3746 tree = assignment->exp->assign.src;
3747 computation_is_valid = is_dot || (scan_for_self_assignment (dst, tree) == FALSE);
3750 exp_fold_tree (tree, output_section->bfd_section, &print_dot);
3751 if (expld.result.valid_p)
3755 if (computation_is_valid)
3757 value = expld.result.value;
3759 if (expld.result.section)
3760 value += expld.result.section->vma;
3762 minfo ("0x%V", value);
3768 struct bfd_link_hash_entry *h;
3770 h = bfd_link_hash_lookup (link_info.hash, assignment->exp->assign.dst,
3771 FALSE, FALSE, TRUE);
3774 value = h->u.def.value;
3776 if (expld.result.section)
3777 value += expld.result.section->vma;
3779 minfo ("[0x%V]", value);
3782 minfo ("[unresolved]");
3794 exp_print_tree (assignment->exp);
3799 print_input_statement (lang_input_statement_type *statm)
3801 if (statm->filename != NULL
3802 && (statm->the_bfd == NULL
3803 || (statm->the_bfd->flags & BFD_LINKER_CREATED) == 0))
3804 fprintf (config.map_file, "LOAD %s\n", statm->filename);
3807 /* Print all symbols defined in a particular section. This is called
3808 via bfd_link_hash_traverse, or by print_all_symbols. */
3811 print_one_symbol (struct bfd_link_hash_entry *hash_entry, void *ptr)
3813 asection *sec = ptr;
3815 if ((hash_entry->type == bfd_link_hash_defined
3816 || hash_entry->type == bfd_link_hash_defweak)
3817 && sec == hash_entry->u.def.section)
3821 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
3824 (hash_entry->u.def.value
3825 + hash_entry->u.def.section->output_offset
3826 + hash_entry->u.def.section->output_section->vma));
3828 minfo (" %T\n", hash_entry->root.string);
3835 print_all_symbols (asection *sec)
3837 struct fat_user_section_struct *ud = get_userdata (sec);
3838 struct map_symbol_def *def;
3843 *ud->map_symbol_def_tail = 0;
3844 for (def = ud->map_symbol_def_head; def; def = def->next)
3845 print_one_symbol (def->entry, sec);
3848 /* Print information about an input section to the map file. */
3851 print_input_section (asection *i)
3853 bfd_size_type size = i->size;
3860 minfo ("%s", i->name);
3862 len = 1 + strlen (i->name);
3863 if (len >= SECTION_NAME_MAP_LENGTH - 1)
3868 while (len < SECTION_NAME_MAP_LENGTH)
3874 if (i->output_section != NULL
3875 && i->output_section->owner == link_info.output_bfd)
3876 addr = i->output_section->vma + i->output_offset;
3883 minfo ("0x%V %W %B\n", addr, TO_ADDR (size), i->owner);
3885 if (size != i->rawsize && i->rawsize != 0)
3887 len = SECTION_NAME_MAP_LENGTH + 3;
3899 minfo (_("%W (size before relaxing)\n"), i->rawsize);
3902 if (i->output_section != NULL
3903 && i->output_section->owner == link_info.output_bfd)
3905 if (link_info.reduce_memory_overheads)
3906 bfd_link_hash_traverse (link_info.hash, print_one_symbol, i);
3908 print_all_symbols (i);
3910 /* Update print_dot, but make sure that we do not move it
3911 backwards - this could happen if we have overlays and a
3912 later overlay is shorter than an earier one. */
3913 if (addr + TO_ADDR (size) > print_dot)
3914 print_dot = addr + TO_ADDR (size);
3919 print_fill_statement (lang_fill_statement_type *fill)
3923 fputs (" FILL mask 0x", config.map_file);
3924 for (p = fill->fill->data, size = fill->fill->size; size != 0; p++, size--)
3925 fprintf (config.map_file, "%02x", *p);
3926 fputs ("\n", config.map_file);
3930 print_data_statement (lang_data_statement_type *data)
3938 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
3941 addr = data->output_offset;
3942 if (data->output_section != NULL)
3943 addr += data->output_section->vma;
3971 minfo ("0x%V %W %s 0x%v", addr, size, name, data->value);
3973 if (data->exp->type.node_class != etree_value)
3976 exp_print_tree (data->exp);
3981 print_dot = addr + TO_ADDR (size);
3984 /* Print an address statement. These are generated by options like
3988 print_address_statement (lang_address_statement_type *address)
3990 minfo (_("Address of section %s set to "), address->section_name);
3991 exp_print_tree (address->address);
3995 /* Print a reloc statement. */
3998 print_reloc_statement (lang_reloc_statement_type *reloc)
4005 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
4008 addr = reloc->output_offset;
4009 if (reloc->output_section != NULL)
4010 addr += reloc->output_section->vma;
4012 size = bfd_get_reloc_size (reloc->howto);
4014 minfo ("0x%V %W RELOC %s ", addr, size, reloc->howto->name);
4016 if (reloc->name != NULL)
4017 minfo ("%s+", reloc->name);
4019 minfo ("%s+", reloc->section->name);
4021 exp_print_tree (reloc->addend_exp);
4025 print_dot = addr + TO_ADDR (size);
4029 print_padding_statement (lang_padding_statement_type *s)
4037 len = sizeof " *fill*" - 1;
4038 while (len < SECTION_NAME_MAP_LENGTH)
4044 addr = s->output_offset;
4045 if (s->output_section != NULL)
4046 addr += s->output_section->vma;
4047 minfo ("0x%V %W ", addr, (bfd_vma) s->size);
4049 if (s->fill->size != 0)
4053 for (p = s->fill->data, size = s->fill->size; size != 0; p++, size--)
4054 fprintf (config.map_file, "%02x", *p);
4059 print_dot = addr + TO_ADDR (s->size);
4063 print_wild_statement (lang_wild_statement_type *w,
4064 lang_output_section_statement_type *os)
4066 struct wildcard_list *sec;
4070 if (w->filenames_sorted)
4072 if (w->filename != NULL)
4073 minfo ("%s", w->filename);
4076 if (w->filenames_sorted)
4080 for (sec = w->section_list; sec; sec = sec->next)
4082 if (sec->spec.sorted)
4084 if (sec->spec.exclude_name_list != NULL)
4087 minfo ("EXCLUDE_FILE(%s", sec->spec.exclude_name_list->name);
4088 for (tmp = sec->spec.exclude_name_list->next; tmp; tmp = tmp->next)
4089 minfo (" %s", tmp->name);
4092 if (sec->spec.name != NULL)
4093 minfo ("%s", sec->spec.name);
4096 if (sec->spec.sorted)
4105 print_statement_list (w->children.head, os);
4108 /* Print a group statement. */
4111 print_group (lang_group_statement_type *s,
4112 lang_output_section_statement_type *os)
4114 fprintf (config.map_file, "START GROUP\n");
4115 print_statement_list (s->children.head, os);
4116 fprintf (config.map_file, "END GROUP\n");
4119 /* Print the list of statements in S.
4120 This can be called for any statement type. */
4123 print_statement_list (lang_statement_union_type *s,
4124 lang_output_section_statement_type *os)
4128 print_statement (s, os);
4133 /* Print the first statement in statement list S.
4134 This can be called for any statement type. */
4137 print_statement (lang_statement_union_type *s,
4138 lang_output_section_statement_type *os)
4140 switch (s->header.type)
4143 fprintf (config.map_file, _("Fail with %d\n"), s->header.type);
4146 case lang_constructors_statement_enum:
4147 if (constructor_list.head != NULL)
4149 if (constructors_sorted)
4150 minfo (" SORT (CONSTRUCTORS)\n");
4152 minfo (" CONSTRUCTORS\n");
4153 print_statement_list (constructor_list.head, os);
4156 case lang_wild_statement_enum:
4157 print_wild_statement (&s->wild_statement, os);
4159 case lang_address_statement_enum:
4160 print_address_statement (&s->address_statement);
4162 case lang_object_symbols_statement_enum:
4163 minfo (" CREATE_OBJECT_SYMBOLS\n");
4165 case lang_fill_statement_enum:
4166 print_fill_statement (&s->fill_statement);
4168 case lang_data_statement_enum:
4169 print_data_statement (&s->data_statement);
4171 case lang_reloc_statement_enum:
4172 print_reloc_statement (&s->reloc_statement);
4174 case lang_input_section_enum:
4175 print_input_section (s->input_section.section);
4177 case lang_padding_statement_enum:
4178 print_padding_statement (&s->padding_statement);
4180 case lang_output_section_statement_enum:
4181 print_output_section_statement (&s->output_section_statement);
4183 case lang_assignment_statement_enum:
4184 print_assignment (&s->assignment_statement, os);
4186 case lang_target_statement_enum:
4187 fprintf (config.map_file, "TARGET(%s)\n", s->target_statement.target);
4189 case lang_output_statement_enum:
4190 minfo ("OUTPUT(%s", s->output_statement.name);
4191 if (output_target != NULL)
4192 minfo (" %s", output_target);
4195 case lang_input_statement_enum:
4196 print_input_statement (&s->input_statement);
4198 case lang_group_statement_enum:
4199 print_group (&s->group_statement, os);
4201 case lang_insert_statement_enum:
4202 minfo ("INSERT %s %s\n",
4203 s->insert_statement.is_before ? "BEFORE" : "AFTER",
4204 s->insert_statement.where);
4210 print_statements (void)
4212 print_statement_list (statement_list.head, abs_output_section);
4215 /* Print the first N statements in statement list S to STDERR.
4216 If N == 0, nothing is printed.
4217 If N < 0, the entire list is printed.
4218 Intended to be called from GDB. */
4221 dprint_statement (lang_statement_union_type *s, int n)
4223 FILE *map_save = config.map_file;
4225 config.map_file = stderr;
4228 print_statement_list (s, abs_output_section);
4231 while (s && --n >= 0)
4233 print_statement (s, abs_output_section);
4238 config.map_file = map_save;
4242 insert_pad (lang_statement_union_type **ptr,
4244 unsigned int alignment_needed,
4245 asection *output_section,
4248 static fill_type zero_fill = { 1, { 0 } };
4249 lang_statement_union_type *pad = NULL;
4251 if (ptr != &statement_list.head)
4252 pad = ((lang_statement_union_type *)
4253 ((char *) ptr - offsetof (lang_statement_union_type, header.next)));
4255 && pad->header.type == lang_padding_statement_enum
4256 && pad->padding_statement.output_section == output_section)
4258 /* Use the existing pad statement. */
4260 else if ((pad = *ptr) != NULL
4261 && pad->header.type == lang_padding_statement_enum
4262 && pad->padding_statement.output_section == output_section)
4264 /* Use the existing pad statement. */
4268 /* Make a new padding statement, linked into existing chain. */
4269 pad = stat_alloc (sizeof (lang_padding_statement_type));
4270 pad->header.next = *ptr;
4272 pad->header.type = lang_padding_statement_enum;
4273 pad->padding_statement.output_section = output_section;
4276 pad->padding_statement.fill = fill;
4278 pad->padding_statement.output_offset = dot - output_section->vma;
4279 pad->padding_statement.size = alignment_needed;
4280 output_section->size += alignment_needed;
4283 /* Work out how much this section will move the dot point. */
4287 (lang_statement_union_type **this_ptr,
4288 lang_output_section_statement_type *output_section_statement,
4292 lang_input_section_type *is = &((*this_ptr)->input_section);
4293 asection *i = is->section;
4295 if (!((lang_input_statement_type *) i->owner->usrdata)->just_syms_flag
4296 && (i->flags & SEC_EXCLUDE) == 0)
4298 unsigned int alignment_needed;
4301 /* Align this section first to the input sections requirement,
4302 then to the output section's requirement. If this alignment
4303 is greater than any seen before, then record it too. Perform
4304 the alignment by inserting a magic 'padding' statement. */
4306 if (output_section_statement->subsection_alignment != -1)
4307 i->alignment_power = output_section_statement->subsection_alignment;
4309 o = output_section_statement->bfd_section;
4310 if (o->alignment_power < i->alignment_power)
4311 o->alignment_power = i->alignment_power;
4313 alignment_needed = align_power (dot, i->alignment_power) - dot;
4315 if (alignment_needed != 0)
4317 insert_pad (this_ptr, fill, TO_SIZE (alignment_needed), o, dot);
4318 dot += alignment_needed;
4321 /* Remember where in the output section this input section goes. */
4323 i->output_offset = dot - o->vma;
4325 /* Mark how big the output section must be to contain this now. */
4326 dot += TO_ADDR (i->size);
4327 o->size = TO_SIZE (dot - o->vma);
4331 i->output_offset = i->vma - output_section_statement->bfd_section->vma;
4338 sort_sections_by_lma (const void *arg1, const void *arg2)
4340 const asection *sec1 = *(const asection **) arg1;
4341 const asection *sec2 = *(const asection **) arg2;
4343 if (bfd_section_lma (sec1->owner, sec1)
4344 < bfd_section_lma (sec2->owner, sec2))
4346 else if (bfd_section_lma (sec1->owner, sec1)
4347 > bfd_section_lma (sec2->owner, sec2))
4349 else if (sec1->id < sec2->id)
4351 else if (sec1->id > sec2->id)
4357 #define IGNORE_SECTION(s) \
4358 ((s->flags & SEC_NEVER_LOAD) != 0 \
4359 || (s->flags & SEC_ALLOC) == 0 \
4360 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
4361 && (s->flags & SEC_LOAD) == 0))
4363 /* Check to see if any allocated sections overlap with other allocated
4364 sections. This can happen if a linker script specifies the output
4365 section addresses of the two sections. Also check whether any memory
4366 region has overflowed. */
4369 lang_check_section_addresses (void)
4372 asection **sections, **spp;
4379 lang_memory_region_type *m;
4381 if (bfd_count_sections (link_info.output_bfd) <= 1)
4384 amt = bfd_count_sections (link_info.output_bfd) * sizeof (asection *);
4385 sections = xmalloc (amt);
4387 /* Scan all sections in the output list. */
4389 for (s = link_info.output_bfd->sections; s != NULL; s = s->next)
4391 /* Only consider loadable sections with real contents. */
4392 if (IGNORE_SECTION (s) || s->size == 0)
4395 sections[count] = s;
4402 qsort (sections, (size_t) count, sizeof (asection *),
4403 sort_sections_by_lma);
4407 s_start = bfd_section_lma (link_info.output_bfd, s);
4408 s_end = s_start + TO_ADDR (s->size) - 1;
4409 for (count--; count; count--)
4411 /* We must check the sections' LMA addresses not their VMA
4412 addresses because overlay sections can have overlapping VMAs
4413 but they must have distinct LMAs. */
4418 s_start = bfd_section_lma (link_info.output_bfd, s);
4419 s_end = s_start + TO_ADDR (s->size) - 1;
4421 /* Look for an overlap. */
4422 if (s_end >= os_start && s_start <= os_end)
4423 einfo (_("%X%P: section %s [%V -> %V] overlaps section %s [%V -> %V]\n"),
4424 s->name, s_start, s_end, os->name, os_start, os_end);
4429 /* If any memory region has overflowed, report by how much.
4430 We do not issue this diagnostic for regions that had sections
4431 explicitly placed outside their bounds; os_region_check's
4432 diagnostics are adequate for that case.
4434 FIXME: It is conceivable that m->current - (m->origin + m->length)
4435 might overflow a 32-bit integer. There is, alas, no way to print
4436 a bfd_vma quantity in decimal. */
4437 for (m = lang_memory_region_list; m; m = m->next)
4438 if (m->had_full_message)
4439 einfo (_("%X%P: region %s overflowed by %ld bytes\n"),
4440 m->name, (long)(m->current - (m->origin + m->length)));
4444 /* Make sure the new address is within the region. We explicitly permit the
4445 current address to be at the exact end of the region when the address is
4446 non-zero, in case the region is at the end of addressable memory and the
4447 calculation wraps around. */
4450 os_region_check (lang_output_section_statement_type *os,
4451 lang_memory_region_type *region,
4455 if ((region->current < region->origin
4456 || (region->current - region->origin > region->length))
4457 && ((region->current != region->origin + region->length)
4462 einfo (_("%X%P: address 0x%v of %B section %s"
4463 " is not within region %s\n"),
4465 os->bfd_section->owner,
4466 os->bfd_section->name,
4469 else if (!region->had_full_message)
4471 region->had_full_message = TRUE;
4473 einfo (_("%X%P: %B section %s will not fit in region %s\n"),
4474 os->bfd_section->owner,
4475 os->bfd_section->name,
4481 /* Set the sizes for all the output sections. */
4484 lang_size_sections_1
4485 (lang_statement_union_type *s,
4486 lang_output_section_statement_type *output_section_statement,
4487 lang_statement_union_type **prev,
4491 bfd_boolean check_regions)
4493 /* Size up the sections from their constituent parts. */
4494 for (; s != NULL; s = s->header.next)
4496 switch (s->header.type)
4498 case lang_output_section_statement_enum:
4500 bfd_vma newdot, after;
4501 lang_output_section_statement_type *os;
4502 lang_memory_region_type *r;
4504 os = &s->output_section_statement;
4505 if (os->addr_tree != NULL)
4507 os->processed_vma = FALSE;
4508 exp_fold_tree (os->addr_tree, bfd_abs_section_ptr, &dot);
4510 if (expld.result.valid_p)
4511 dot = expld.result.value + expld.result.section->vma;
4512 else if (expld.phase != lang_mark_phase_enum)
4513 einfo (_("%F%S: non constant or forward reference"
4514 " address expression for section %s\n"),
4518 if (os->bfd_section == NULL)
4519 /* This section was removed or never actually created. */
4522 /* If this is a COFF shared library section, use the size and
4523 address from the input section. FIXME: This is COFF
4524 specific; it would be cleaner if there were some other way
4525 to do this, but nothing simple comes to mind. */
4526 if (((bfd_get_flavour (link_info.output_bfd)
4527 == bfd_target_ecoff_flavour)
4528 || (bfd_get_flavour (link_info.output_bfd)
4529 == bfd_target_coff_flavour))
4530 && (os->bfd_section->flags & SEC_COFF_SHARED_LIBRARY) != 0)
4534 if (os->children.head == NULL
4535 || os->children.head->header.next != NULL
4536 || (os->children.head->header.type
4537 != lang_input_section_enum))
4538 einfo (_("%P%X: Internal error on COFF shared library"
4539 " section %s\n"), os->name);
4541 input = os->children.head->input_section.section;
4542 bfd_set_section_vma (os->bfd_section->owner,
4544 bfd_section_vma (input->owner, input));
4545 os->bfd_section->size = input->size;
4550 if (bfd_is_abs_section (os->bfd_section))
4552 /* No matter what happens, an abs section starts at zero. */
4553 ASSERT (os->bfd_section->vma == 0);
4559 if (os->addr_tree == NULL)
4561 /* No address specified for this section, get one
4562 from the region specification. */
4563 if (os->region == NULL
4564 || ((os->bfd_section->flags & (SEC_ALLOC | SEC_LOAD))
4565 && os->region->name[0] == '*'
4566 && strcmp (os->region->name,
4567 DEFAULT_MEMORY_REGION) == 0))
4569 os->region = lang_memory_default (os->bfd_section);
4572 /* If a loadable section is using the default memory
4573 region, and some non default memory regions were
4574 defined, issue an error message. */
4576 && !IGNORE_SECTION (os->bfd_section)
4577 && ! link_info.relocatable
4579 && strcmp (os->region->name,
4580 DEFAULT_MEMORY_REGION) == 0
4581 && lang_memory_region_list != NULL
4582 && (strcmp (lang_memory_region_list->name,
4583 DEFAULT_MEMORY_REGION) != 0
4584 || lang_memory_region_list->next != NULL)
4585 && expld.phase != lang_mark_phase_enum)
4587 /* By default this is an error rather than just a
4588 warning because if we allocate the section to the
4589 default memory region we can end up creating an
4590 excessively large binary, or even seg faulting when
4591 attempting to perform a negative seek. See
4592 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4593 for an example of this. This behaviour can be
4594 overridden by the using the --no-check-sections
4596 if (command_line.check_section_addresses)
4597 einfo (_("%P%F: error: no memory region specified"
4598 " for loadable section `%s'\n"),
4599 bfd_get_section_name (link_info.output_bfd,
4602 einfo (_("%P: warning: no memory region specified"
4603 " for loadable section `%s'\n"),
4604 bfd_get_section_name (link_info.output_bfd,
4608 newdot = os->region->current;
4609 align = os->bfd_section->alignment_power;
4612 align = os->section_alignment;
4614 /* Align to what the section needs. */
4617 bfd_vma savedot = newdot;
4618 newdot = align_power (newdot, align);
4620 if (newdot != savedot
4621 && (config.warn_section_align
4622 || os->addr_tree != NULL)
4623 && expld.phase != lang_mark_phase_enum)
4624 einfo (_("%P: warning: changing start of section"
4625 " %s by %lu bytes\n"),
4626 os->name, (unsigned long) (newdot - savedot));
4629 bfd_set_section_vma (0, os->bfd_section, newdot);
4631 os->bfd_section->output_offset = 0;
4634 lang_size_sections_1 (os->children.head, os, &os->children.head,
4635 os->fill, newdot, relax, check_regions);
4637 os->processed_vma = TRUE;
4639 if (bfd_is_abs_section (os->bfd_section) || os->ignored)
4640 /* Except for some special linker created sections,
4641 no output section should change from zero size
4642 after strip_excluded_output_sections. A non-zero
4643 size on an ignored section indicates that some
4644 input section was not sized early enough. */
4645 ASSERT (os->bfd_section->size == 0);
4648 dot = os->bfd_section->vma;
4650 /* Put the section within the requested block size, or
4651 align at the block boundary. */
4653 + TO_ADDR (os->bfd_section->size)
4654 + os->block_value - 1)
4655 & - (bfd_vma) os->block_value);
4657 os->bfd_section->size = TO_SIZE (after - os->bfd_section->vma);
4660 /* Set section lma. */
4663 r = lang_memory_region_lookup (DEFAULT_MEMORY_REGION, FALSE);
4667 bfd_vma lma = exp_get_abs_int (os->load_base, 0, "load base");
4668 os->bfd_section->lma = lma;
4670 else if (os->lma_region != NULL)
4672 bfd_vma lma = os->lma_region->current;
4674 if (os->section_alignment != -1)
4675 lma = align_power (lma, os->section_alignment);
4676 os->bfd_section->lma = lma;
4678 else if (r->last_os != NULL
4679 && (os->bfd_section->flags & SEC_ALLOC) != 0)
4684 last = r->last_os->output_section_statement.bfd_section;
4686 /* A backwards move of dot should be accompanied by
4687 an explicit assignment to the section LMA (ie.
4688 os->load_base set) because backwards moves can
4689 create overlapping LMAs. */
4691 && os->bfd_section->size != 0
4692 && dot + os->bfd_section->size <= last->vma)
4694 /* If dot moved backwards then leave lma equal to
4695 vma. This is the old default lma, which might
4696 just happen to work when the backwards move is
4697 sufficiently large. Nag if this changes anything,
4698 so people can fix their linker scripts. */
4700 if (last->vma != last->lma)
4701 einfo (_("%P: warning: dot moved backwards before `%s'\n"),
4706 /* If this is an overlay, set the current lma to that
4707 at the end of the previous section. */
4708 if (os->sectype == overlay_section)
4709 lma = last->lma + last->size;
4711 /* Otherwise, keep the same lma to vma relationship
4712 as the previous section. */
4714 lma = dot + last->lma - last->vma;
4716 if (os->section_alignment != -1)
4717 lma = align_power (lma, os->section_alignment);
4718 os->bfd_section->lma = lma;
4721 os->processed_lma = TRUE;
4723 if (bfd_is_abs_section (os->bfd_section) || os->ignored)
4726 /* Keep track of normal sections using the default
4727 lma region. We use this to set the lma for
4728 following sections. Overlays or other linker
4729 script assignment to lma might mean that the
4730 default lma == vma is incorrect.
4731 To avoid warnings about dot moving backwards when using
4732 -Ttext, don't start tracking sections until we find one
4733 of non-zero size or with lma set differently to vma. */
4734 if (((os->bfd_section->flags & SEC_HAS_CONTENTS) != 0
4735 || (os->bfd_section->flags & SEC_THREAD_LOCAL) == 0)
4736 && (os->bfd_section->flags & SEC_ALLOC) != 0
4737 && (os->bfd_section->size != 0
4738 || (r->last_os == NULL
4739 && os->bfd_section->vma != os->bfd_section->lma)
4740 || (r->last_os != NULL
4741 && dot >= (r->last_os->output_section_statement
4742 .bfd_section->vma)))
4743 && os->lma_region == NULL
4744 && !link_info.relocatable)
4747 /* .tbss sections effectively have zero size. */
4748 if ((os->bfd_section->flags & SEC_HAS_CONTENTS) != 0
4749 || (os->bfd_section->flags & SEC_THREAD_LOCAL) == 0
4750 || link_info.relocatable)
4751 dot += TO_ADDR (os->bfd_section->size);
4753 if (os->update_dot_tree != 0)
4754 exp_fold_tree (os->update_dot_tree, bfd_abs_section_ptr, &dot);
4756 /* Update dot in the region ?
4757 We only do this if the section is going to be allocated,
4758 since unallocated sections do not contribute to the region's
4759 overall size in memory.
4761 If the SEC_NEVER_LOAD bit is not set, it will affect the
4762 addresses of sections after it. We have to update
4764 if (os->region != NULL
4765 && ((os->bfd_section->flags & SEC_NEVER_LOAD) == 0
4766 || (os->bfd_section->flags & (SEC_ALLOC | SEC_LOAD))))
4768 os->region->current = dot;
4771 /* Make sure the new address is within the region. */
4772 os_region_check (os, os->region, os->addr_tree,
4773 os->bfd_section->vma);
4775 if (os->lma_region != NULL && os->lma_region != os->region
4776 && (os->bfd_section->flags & SEC_LOAD))
4778 os->lma_region->current
4779 = os->bfd_section->lma + TO_ADDR (os->bfd_section->size);
4782 os_region_check (os, os->lma_region, NULL,
4783 os->bfd_section->lma);
4789 case lang_constructors_statement_enum:
4790 dot = lang_size_sections_1 (constructor_list.head,
4791 output_section_statement,
4792 &s->wild_statement.children.head,
4793 fill, dot, relax, check_regions);
4796 case lang_data_statement_enum:
4798 unsigned int size = 0;
4800 s->data_statement.output_offset =
4801 dot - output_section_statement->bfd_section->vma;
4802 s->data_statement.output_section =
4803 output_section_statement->bfd_section;
4805 /* We might refer to provided symbols in the expression, and
4806 need to mark them as needed. */
4807 exp_fold_tree (s->data_statement.exp, bfd_abs_section_ptr, &dot);
4809 switch (s->data_statement.type)
4827 if (size < TO_SIZE ((unsigned) 1))
4828 size = TO_SIZE ((unsigned) 1);
4829 dot += TO_ADDR (size);
4830 output_section_statement->bfd_section->size += size;
4834 case lang_reloc_statement_enum:
4838 s->reloc_statement.output_offset =
4839 dot - output_section_statement->bfd_section->vma;
4840 s->reloc_statement.output_section =
4841 output_section_statement->bfd_section;
4842 size = bfd_get_reloc_size (s->reloc_statement.howto);
4843 dot += TO_ADDR (size);
4844 output_section_statement->bfd_section->size += size;
4848 case lang_wild_statement_enum:
4849 dot = lang_size_sections_1 (s->wild_statement.children.head,
4850 output_section_statement,
4851 &s->wild_statement.children.head,
4852 fill, dot, relax, check_regions);
4855 case lang_object_symbols_statement_enum:
4856 link_info.create_object_symbols_section =
4857 output_section_statement->bfd_section;
4860 case lang_output_statement_enum:
4861 case lang_target_statement_enum:
4864 case lang_input_section_enum:
4868 i = (*prev)->input_section.section;
4873 if (! bfd_relax_section (i->owner, i, &link_info, &again))
4874 einfo (_("%P%F: can't relax section: %E\n"));
4878 dot = size_input_section (prev, output_section_statement,
4879 output_section_statement->fill, dot);
4883 case lang_input_statement_enum:
4886 case lang_fill_statement_enum:
4887 s->fill_statement.output_section =
4888 output_section_statement->bfd_section;
4890 fill = s->fill_statement.fill;
4893 case lang_assignment_statement_enum:
4895 bfd_vma newdot = dot;
4896 etree_type *tree = s->assignment_statement.exp;
4898 expld.dataseg.relro = exp_dataseg_relro_none;
4900 exp_fold_tree (tree,
4901 output_section_statement->bfd_section,
4904 if (expld.dataseg.relro == exp_dataseg_relro_start)
4906 if (!expld.dataseg.relro_start_stat)
4907 expld.dataseg.relro_start_stat = s;
4910 ASSERT (expld.dataseg.relro_start_stat == s);
4913 else if (expld.dataseg.relro == exp_dataseg_relro_end)
4915 if (!expld.dataseg.relro_end_stat)
4916 expld.dataseg.relro_end_stat = s;
4919 ASSERT (expld.dataseg.relro_end_stat == s);
4922 expld.dataseg.relro = exp_dataseg_relro_none;
4924 /* This symbol is relative to this section. */
4925 if ((tree->type.node_class == etree_provided
4926 || tree->type.node_class == etree_assign)
4927 && (tree->assign.dst [0] != '.'
4928 || tree->assign.dst [1] != '\0'))
4929 output_section_statement->section_relative_symbol = 1;
4931 if (!output_section_statement->ignored)
4933 if (output_section_statement == abs_output_section)
4935 /* If we don't have an output section, then just adjust
4936 the default memory address. */
4937 lang_memory_region_lookup (DEFAULT_MEMORY_REGION,
4938 FALSE)->current = newdot;
4940 else if (newdot != dot)
4942 /* Insert a pad after this statement. We can't
4943 put the pad before when relaxing, in case the
4944 assignment references dot. */
4945 insert_pad (&s->header.next, fill, TO_SIZE (newdot - dot),
4946 output_section_statement->bfd_section, dot);
4948 /* Don't neuter the pad below when relaxing. */
4951 /* If dot is advanced, this implies that the section
4952 should have space allocated to it, unless the
4953 user has explicitly stated that the section
4954 should never be loaded. */
4955 if (!(output_section_statement->flags & SEC_NEVER_LOAD))
4956 output_section_statement->bfd_section->flags |= SEC_ALLOC;
4963 case lang_padding_statement_enum:
4964 /* If this is the first time lang_size_sections is called,
4965 we won't have any padding statements. If this is the
4966 second or later passes when relaxing, we should allow
4967 padding to shrink. If padding is needed on this pass, it
4968 will be added back in. */
4969 s->padding_statement.size = 0;
4971 /* Make sure output_offset is valid. If relaxation shrinks
4972 the section and this pad isn't needed, it's possible to
4973 have output_offset larger than the final size of the
4974 section. bfd_set_section_contents will complain even for
4975 a pad size of zero. */
4976 s->padding_statement.output_offset
4977 = dot - output_section_statement->bfd_section->vma;
4980 case lang_group_statement_enum:
4981 dot = lang_size_sections_1 (s->group_statement.children.head,
4982 output_section_statement,
4983 &s->group_statement.children.head,
4984 fill, dot, relax, check_regions);
4987 case lang_insert_statement_enum:
4990 /* We can only get here when relaxing is turned on. */
4991 case lang_address_statement_enum:
4998 prev = &s->header.next;
5003 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
5004 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
5005 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
5006 segments. We are allowed an opportunity to override this decision. */
5009 ldlang_override_segment_assignment (struct bfd_link_info * info ATTRIBUTE_UNUSED,
5010 bfd * abfd ATTRIBUTE_UNUSED,
5011 asection * current_section,
5012 asection * previous_section,
5013 bfd_boolean new_segment)
5015 lang_output_section_statement_type * cur;
5016 lang_output_section_statement_type * prev;
5018 /* The checks below are only necessary when the BFD library has decided
5019 that the two sections ought to be placed into the same segment. */
5023 /* Paranoia checks. */
5024 if (current_section == NULL || previous_section == NULL)
5027 /* Find the memory regions associated with the two sections.
5028 We call lang_output_section_find() here rather than scanning the list
5029 of output sections looking for a matching section pointer because if
5030 we have a large number of sections then a hash lookup is faster. */
5031 cur = lang_output_section_find (current_section->name);
5032 prev = lang_output_section_find (previous_section->name);
5034 /* More paranoia. */
5035 if (cur == NULL || prev == NULL)
5038 /* If the regions are different then force the sections to live in
5039 different segments. See the email thread starting at the following
5040 URL for the reasons why this is necessary:
5041 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
5042 return cur->region != prev->region;
5046 one_lang_size_sections_pass (bfd_boolean *relax, bfd_boolean check_regions)
5048 lang_statement_iteration++;
5049 lang_size_sections_1 (statement_list.head, abs_output_section,
5050 &statement_list.head, 0, 0, relax, check_regions);
5054 lang_size_sections (bfd_boolean *relax, bfd_boolean check_regions)
5056 expld.phase = lang_allocating_phase_enum;
5057 expld.dataseg.phase = exp_dataseg_none;
5059 one_lang_size_sections_pass (relax, check_regions);
5060 if (expld.dataseg.phase == exp_dataseg_end_seen
5061 && link_info.relro && expld.dataseg.relro_end)
5063 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
5064 to put expld.dataseg.relro on a (common) page boundary. */
5065 bfd_vma min_base, old_base, relro_end, maxpage;
5067 expld.dataseg.phase = exp_dataseg_relro_adjust;
5068 maxpage = expld.dataseg.maxpagesize;
5069 /* MIN_BASE is the absolute minimum address we are allowed to start the
5070 read-write segment (byte before will be mapped read-only). */
5071 min_base = (expld.dataseg.min_base + maxpage - 1) & ~(maxpage - 1);
5072 /* OLD_BASE is the address for a feasible minimum address which will
5073 still not cause a data overlap inside MAXPAGE causing file offset skip
5075 old_base = expld.dataseg.base;
5076 expld.dataseg.base += (-expld.dataseg.relro_end
5077 & (expld.dataseg.pagesize - 1));
5078 /* Compute the expected PT_GNU_RELRO segment end. */
5079 relro_end = ((expld.dataseg.relro_end + expld.dataseg.pagesize - 1)
5080 & ~(expld.dataseg.pagesize - 1));
5081 if (min_base + maxpage < expld.dataseg.base)
5083 expld.dataseg.base -= maxpage;
5084 relro_end -= maxpage;
5086 lang_reset_memory_regions ();
5087 one_lang_size_sections_pass (relax, check_regions);
5088 if (expld.dataseg.relro_end > relro_end)
5090 /* The alignment of sections between DATA_SEGMENT_ALIGN
5091 and DATA_SEGMENT_RELRO_END caused huge padding to be
5092 inserted at DATA_SEGMENT_RELRO_END. Try to start a bit lower so
5093 that the section alignments will fit in. */
5095 unsigned int max_alignment_power = 0;
5097 /* Find maximum alignment power of sections between
5098 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
5099 for (sec = link_info.output_bfd->sections; sec; sec = sec->next)
5100 if (sec->vma >= expld.dataseg.base
5101 && sec->vma < expld.dataseg.relro_end
5102 && sec->alignment_power > max_alignment_power)
5103 max_alignment_power = sec->alignment_power;
5105 if (((bfd_vma) 1 << max_alignment_power) < expld.dataseg.pagesize)
5107 if (expld.dataseg.base - (1 << max_alignment_power) < old_base)
5108 expld.dataseg.base += expld.dataseg.pagesize;
5109 expld.dataseg.base -= (1 << max_alignment_power);
5110 lang_reset_memory_regions ();
5111 one_lang_size_sections_pass (relax, check_regions);
5114 link_info.relro_start = expld.dataseg.base;
5115 link_info.relro_end = expld.dataseg.relro_end;
5117 else if (expld.dataseg.phase == exp_dataseg_end_seen)
5119 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
5120 a page could be saved in the data segment. */
5121 bfd_vma first, last;
5123 first = -expld.dataseg.base & (expld.dataseg.pagesize - 1);
5124 last = expld.dataseg.end & (expld.dataseg.pagesize - 1);
5126 && ((expld.dataseg.base & ~(expld.dataseg.pagesize - 1))
5127 != (expld.dataseg.end & ~(expld.dataseg.pagesize - 1)))
5128 && first + last <= expld.dataseg.pagesize)
5130 expld.dataseg.phase = exp_dataseg_adjust;
5131 lang_reset_memory_regions ();
5132 one_lang_size_sections_pass (relax, check_regions);
5136 expld.phase = lang_final_phase_enum;
5139 /* Worker function for lang_do_assignments. Recursiveness goes here. */
5142 lang_do_assignments_1 (lang_statement_union_type *s,
5143 lang_output_section_statement_type *current_os,
5147 for (; s != NULL; s = s->header.next)
5149 switch (s->header.type)
5151 case lang_constructors_statement_enum:
5152 dot = lang_do_assignments_1 (constructor_list.head,
5153 current_os, fill, dot);
5156 case lang_output_section_statement_enum:
5158 lang_output_section_statement_type *os;
5160 os = &(s->output_section_statement);
5161 if (os->bfd_section != NULL && !os->ignored)
5163 dot = os->bfd_section->vma;
5165 lang_do_assignments_1 (os->children.head, os, os->fill, dot);
5167 /* .tbss sections effectively have zero size. */
5168 if ((os->bfd_section->flags & SEC_HAS_CONTENTS) != 0
5169 || (os->bfd_section->flags & SEC_THREAD_LOCAL) == 0
5170 || link_info.relocatable)
5171 dot += TO_ADDR (os->bfd_section->size);
5173 if (os->update_dot_tree != NULL)
5174 exp_fold_tree (os->update_dot_tree, bfd_abs_section_ptr, &dot);
5179 case lang_wild_statement_enum:
5181 dot = lang_do_assignments_1 (s->wild_statement.children.head,
5182 current_os, fill, dot);
5185 case lang_object_symbols_statement_enum:
5186 case lang_output_statement_enum:
5187 case lang_target_statement_enum:
5190 case lang_data_statement_enum:
5191 exp_fold_tree (s->data_statement.exp, bfd_abs_section_ptr, &dot);
5192 if (expld.result.valid_p)
5193 s->data_statement.value = (expld.result.value
5194 + expld.result.section->vma);
5196 einfo (_("%F%P: invalid data statement\n"));
5199 switch (s->data_statement.type)
5217 if (size < TO_SIZE ((unsigned) 1))
5218 size = TO_SIZE ((unsigned) 1);
5219 dot += TO_ADDR (size);
5223 case lang_reloc_statement_enum:
5224 exp_fold_tree (s->reloc_statement.addend_exp,
5225 bfd_abs_section_ptr, &dot);
5226 if (expld.result.valid_p)
5227 s->reloc_statement.addend_value = expld.result.value;
5229 einfo (_("%F%P: invalid reloc statement\n"));
5230 dot += TO_ADDR (bfd_get_reloc_size (s->reloc_statement.howto));
5233 case lang_input_section_enum:
5235 asection *in = s->input_section.section;
5237 if ((in->flags & SEC_EXCLUDE) == 0)
5238 dot += TO_ADDR (in->size);
5242 case lang_input_statement_enum:
5245 case lang_fill_statement_enum:
5246 fill = s->fill_statement.fill;
5249 case lang_assignment_statement_enum:
5250 exp_fold_tree (s->assignment_statement.exp,
5251 current_os->bfd_section,
5255 case lang_padding_statement_enum:
5256 dot += TO_ADDR (s->padding_statement.size);
5259 case lang_group_statement_enum:
5260 dot = lang_do_assignments_1 (s->group_statement.children.head,
5261 current_os, fill, dot);
5264 case lang_insert_statement_enum:
5267 case lang_address_statement_enum:
5279 lang_do_assignments (void)
5281 lang_statement_iteration++;
5282 lang_do_assignments_1 (statement_list.head, abs_output_section, NULL, 0);
5285 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
5286 operator .startof. (section_name), it produces an undefined symbol
5287 .startof.section_name. Similarly, when it sees
5288 .sizeof. (section_name), it produces an undefined symbol
5289 .sizeof.section_name. For all the output sections, we look for
5290 such symbols, and set them to the correct value. */
5293 lang_set_startof (void)
5297 if (link_info.relocatable)
5300 for (s = link_info.output_bfd->sections; s != NULL; s = s->next)
5302 const char *secname;
5304 struct bfd_link_hash_entry *h;
5306 secname = bfd_get_section_name (link_info.output_bfd, s);
5307 buf = xmalloc (10 + strlen (secname));
5309 sprintf (buf, ".startof.%s", secname);
5310 h = bfd_link_hash_lookup (link_info.hash, buf, FALSE, FALSE, TRUE);
5311 if (h != NULL && h->type == bfd_link_hash_undefined)
5313 h->type = bfd_link_hash_defined;
5314 h->u.def.value = bfd_get_section_vma (link_info.output_bfd, s);
5315 h->u.def.section = bfd_abs_section_ptr;
5318 sprintf (buf, ".sizeof.%s", secname);
5319 h = bfd_link_hash_lookup (link_info.hash, buf, FALSE, FALSE, TRUE);
5320 if (h != NULL && h->type == bfd_link_hash_undefined)
5322 h->type = bfd_link_hash_defined;
5323 h->u.def.value = TO_ADDR (s->size);
5324 h->u.def.section = bfd_abs_section_ptr;
5334 struct bfd_link_hash_entry *h;
5337 if ((link_info.relocatable && !link_info.gc_sections)
5338 || link_info.shared)
5339 warn = entry_from_cmdline;
5343 /* Force the user to specify a root when generating a relocatable with
5345 if (link_info.gc_sections && link_info.relocatable
5346 && (entry_symbol.name == NULL
5347 && ldlang_undef_chain_list_head == NULL))
5348 einfo (_("%P%F: gc-sections requires either an entry or "
5349 "an undefined symbol\n"));
5351 if (entry_symbol.name == NULL)
5353 /* No entry has been specified. Look for the default entry, but
5354 don't warn if we don't find it. */
5355 entry_symbol.name = entry_symbol_default;
5359 h = bfd_link_hash_lookup (link_info.hash, entry_symbol.name,
5360 FALSE, FALSE, TRUE);
5362 && (h->type == bfd_link_hash_defined
5363 || h->type == bfd_link_hash_defweak)
5364 && h->u.def.section->output_section != NULL)
5368 val = (h->u.def.value
5369 + bfd_get_section_vma (link_info.output_bfd,
5370 h->u.def.section->output_section)
5371 + h->u.def.section->output_offset);
5372 if (! bfd_set_start_address (link_info.output_bfd, val))
5373 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol.name);
5380 /* We couldn't find the entry symbol. Try parsing it as a
5382 val = bfd_scan_vma (entry_symbol.name, &send, 0);
5385 if (! bfd_set_start_address (link_info.output_bfd, val))
5386 einfo (_("%P%F: can't set start address\n"));
5392 /* Can't find the entry symbol, and it's not a number. Use
5393 the first address in the text section. */
5394 ts = bfd_get_section_by_name (link_info.output_bfd, entry_section);
5398 einfo (_("%P: warning: cannot find entry symbol %s;"
5399 " defaulting to %V\n"),
5401 bfd_get_section_vma (link_info.output_bfd, ts));
5402 if (!(bfd_set_start_address
5403 (link_info.output_bfd,
5404 bfd_get_section_vma (link_info.output_bfd, ts))))
5405 einfo (_("%P%F: can't set start address\n"));
5410 einfo (_("%P: warning: cannot find entry symbol %s;"
5411 " not setting start address\n"),
5417 /* Don't bfd_hash_table_free (&lang_definedness_table);
5418 map file output may result in a call of lang_track_definedness. */
5421 /* This is a small function used when we want to ignore errors from
5425 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED, ...)
5427 /* Don't do anything. */
5430 /* Check that the architecture of all the input files is compatible
5431 with the output file. Also call the backend to let it do any
5432 other checking that is needed. */
5437 lang_statement_union_type *file;
5439 const bfd_arch_info_type *compatible;
5441 for (file = file_chain.head; file != NULL; file = file->input_statement.next)
5443 input_bfd = file->input_statement.the_bfd;
5445 = bfd_arch_get_compatible (input_bfd, link_info.output_bfd,
5446 command_line.accept_unknown_input_arch);
5448 /* In general it is not possible to perform a relocatable
5449 link between differing object formats when the input
5450 file has relocations, because the relocations in the
5451 input format may not have equivalent representations in
5452 the output format (and besides BFD does not translate
5453 relocs for other link purposes than a final link). */
5454 if ((link_info.relocatable || link_info.emitrelocations)
5455 && (compatible == NULL
5456 || (bfd_get_flavour (input_bfd)
5457 != bfd_get_flavour (link_info.output_bfd)))
5458 && (bfd_get_file_flags (input_bfd) & HAS_RELOC) != 0)
5460 einfo (_("%P%F: Relocatable linking with relocations from"
5461 " format %s (%B) to format %s (%B) is not supported\n"),
5462 bfd_get_target (input_bfd), input_bfd,
5463 bfd_get_target (link_info.output_bfd), link_info.output_bfd);
5464 /* einfo with %F exits. */
5467 if (compatible == NULL)
5469 if (command_line.warn_mismatch)
5470 einfo (_("%P%X: %s architecture of input file `%B'"
5471 " is incompatible with %s output\n"),
5472 bfd_printable_name (input_bfd), input_bfd,
5473 bfd_printable_name (link_info.output_bfd));
5475 else if (bfd_count_sections (input_bfd))
5477 /* If the input bfd has no contents, it shouldn't set the
5478 private data of the output bfd. */
5480 bfd_error_handler_type pfn = NULL;
5482 /* If we aren't supposed to warn about mismatched input
5483 files, temporarily set the BFD error handler to a
5484 function which will do nothing. We still want to call
5485 bfd_merge_private_bfd_data, since it may set up
5486 information which is needed in the output file. */
5487 if (! command_line.warn_mismatch)
5488 pfn = bfd_set_error_handler (ignore_bfd_errors);
5489 if (! bfd_merge_private_bfd_data (input_bfd, link_info.output_bfd))
5491 if (command_line.warn_mismatch)
5492 einfo (_("%P%X: failed to merge target specific data"
5493 " of file %B\n"), input_bfd);
5495 if (! command_line.warn_mismatch)
5496 bfd_set_error_handler (pfn);
5501 /* Look through all the global common symbols and attach them to the
5502 correct section. The -sort-common command line switch may be used
5503 to roughly sort the entries by alignment. */
5508 if (command_line.inhibit_common_definition)
5510 if (link_info.relocatable
5511 && ! command_line.force_common_definition)
5514 if (! config.sort_common)
5515 bfd_link_hash_traverse (link_info.hash, lang_one_common, NULL);
5520 if (config.sort_common == sort_descending)
5522 for (power = 4; power > 0; power--)
5523 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
5526 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
5530 for (power = 0; power <= 4; power++)
5531 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
5534 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
5539 /* Place one common symbol in the correct section. */
5542 lang_one_common (struct bfd_link_hash_entry *h, void *info)
5544 unsigned int power_of_two;
5548 if (h->type != bfd_link_hash_common)
5552 power_of_two = h->u.c.p->alignment_power;
5554 if (config.sort_common == sort_descending
5555 && power_of_two < *(unsigned int *) info)
5557 else if (config.sort_common == sort_ascending
5558 && power_of_two > *(unsigned int *) info)
5561 section = h->u.c.p->section;
5563 /* Increase the size of the section to align the common sym. */
5564 section->size += ((bfd_vma) 1 << (power_of_two + opb_shift)) - 1;
5565 section->size &= (- (bfd_vma) 1 << (power_of_two + opb_shift));
5567 /* Adjust the alignment if necessary. */
5568 if (power_of_two > section->alignment_power)
5569 section->alignment_power = power_of_two;
5571 /* Change the symbol from common to defined. */
5572 h->type = bfd_link_hash_defined;
5573 h->u.def.section = section;
5574 h->u.def.value = section->size;
5576 /* Increase the size of the section. */
5577 section->size += size;
5579 /* Make sure the section is allocated in memory, and make sure that
5580 it is no longer a common section. */
5581 section->flags |= SEC_ALLOC;
5582 section->flags &= ~SEC_IS_COMMON;
5584 if (config.map_file != NULL)
5586 static bfd_boolean header_printed;
5591 if (! header_printed)
5593 minfo (_("\nAllocating common symbols\n"));
5594 minfo (_("Common symbol size file\n\n"));
5595 header_printed = TRUE;
5598 name = bfd_demangle (link_info.output_bfd, h->root.string,
5599 DMGL_ANSI | DMGL_PARAMS);
5602 minfo ("%s", h->root.string);
5603 len = strlen (h->root.string);
5608 len = strlen (name);
5624 if (size <= 0xffffffff)
5625 sprintf (buf, "%lx", (unsigned long) size);
5627 sprintf_vma (buf, size);
5637 minfo ("%B\n", section->owner);
5643 /* Run through the input files and ensure that every input section has
5644 somewhere to go. If one is found without a destination then create
5645 an input request and place it into the statement tree. */
5648 lang_place_orphans (void)
5650 LANG_FOR_EACH_INPUT_STATEMENT (file)
5654 for (s = file->the_bfd->sections; s != NULL; s = s->next)
5656 if (s->output_section == NULL)
5658 /* This section of the file is not attached, root
5659 around for a sensible place for it to go. */
5661 if (file->just_syms_flag)
5662 bfd_link_just_syms (file->the_bfd, s, &link_info);
5663 else if ((s->flags & SEC_EXCLUDE) != 0)
5664 s->output_section = bfd_abs_section_ptr;
5665 else if (strcmp (s->name, "COMMON") == 0)
5667 /* This is a lonely common section which must have
5668 come from an archive. We attach to the section
5669 with the wildcard. */
5670 if (! link_info.relocatable
5671 || command_line.force_common_definition)
5673 if (default_common_section == NULL)
5674 default_common_section
5675 = lang_output_section_statement_lookup (".bss", 0,
5677 lang_add_section (&default_common_section->children, s,
5678 default_common_section);
5683 const char *name = s->name;
5686 if (config.unique_orphan_sections || unique_section_p (s))
5687 constraint = SPECIAL;
5689 if (!ldemul_place_orphan (s, name, constraint))
5691 lang_output_section_statement_type *os;
5692 os = lang_output_section_statement_lookup (name,
5695 lang_add_section (&os->children, s, os);
5704 lang_set_flags (lang_memory_region_type *ptr, const char *flags, int invert)
5706 flagword *ptr_flags;
5708 ptr_flags = invert ? &ptr->not_flags : &ptr->flags;
5714 *ptr_flags |= SEC_ALLOC;
5718 *ptr_flags |= SEC_READONLY;
5722 *ptr_flags |= SEC_DATA;
5726 *ptr_flags |= SEC_CODE;
5731 *ptr_flags |= SEC_LOAD;
5735 einfo (_("%P%F: invalid syntax in flags\n"));
5742 /* Call a function on each input file. This function will be called
5743 on an archive, but not on the elements. */
5746 lang_for_each_input_file (void (*func) (lang_input_statement_type *))
5748 lang_input_statement_type *f;
5750 for (f = (lang_input_statement_type *) input_file_chain.head;
5752 f = (lang_input_statement_type *) f->next_real_file)
5756 /* Call a function on each file. The function will be called on all
5757 the elements of an archive which are included in the link, but will
5758 not be called on the archive file itself. */
5761 lang_for_each_file (void (*func) (lang_input_statement_type *))
5763 LANG_FOR_EACH_INPUT_STATEMENT (f)
5770 ldlang_add_file (lang_input_statement_type *entry)
5772 lang_statement_append (&file_chain,
5773 (lang_statement_union_type *) entry,
5776 /* The BFD linker needs to have a list of all input BFDs involved in
5778 ASSERT (entry->the_bfd->link_next == NULL);
5779 ASSERT (entry->the_bfd != link_info.output_bfd);
5781 *link_info.input_bfds_tail = entry->the_bfd;
5782 link_info.input_bfds_tail = &entry->the_bfd->link_next;
5783 entry->the_bfd->usrdata = entry;
5784 bfd_set_gp_size (entry->the_bfd, g_switch_value);
5786 /* Look through the sections and check for any which should not be
5787 included in the link. We need to do this now, so that we can
5788 notice when the backend linker tries to report multiple
5789 definition errors for symbols which are in sections we aren't
5790 going to link. FIXME: It might be better to entirely ignore
5791 symbols which are defined in sections which are going to be
5792 discarded. This would require modifying the backend linker for
5793 each backend which might set the SEC_LINK_ONCE flag. If we do
5794 this, we should probably handle SEC_EXCLUDE in the same way. */
5796 bfd_map_over_sections (entry->the_bfd, section_already_linked, entry);
5800 lang_add_output (const char *name, int from_script)
5802 /* Make -o on command line override OUTPUT in script. */
5803 if (!had_output_filename || !from_script)
5805 output_filename = name;
5806 had_output_filename = TRUE;
5810 static lang_output_section_statement_type *current_section;
5821 for (l = 0; l < 32; l++)
5823 if (i >= (unsigned int) x)
5831 lang_output_section_statement_type *
5832 lang_enter_output_section_statement (const char *output_section_statement_name,
5833 etree_type *address_exp,
5834 enum section_type sectype,
5836 etree_type *subalign,
5840 lang_output_section_statement_type *os;
5842 os = lang_output_section_statement_lookup (output_section_statement_name,
5844 current_section = os;
5846 if (os->addr_tree == NULL)
5848 os->addr_tree = address_exp;
5850 os->sectype = sectype;
5851 if (sectype != noload_section)
5852 os->flags = SEC_NO_FLAGS;
5854 os->flags = SEC_NEVER_LOAD;
5855 os->block_value = 1;
5857 /* Make next things chain into subchain of this. */
5858 stat_ptr = &os->children;
5860 os->subsection_alignment =
5861 topower (exp_get_value_int (subalign, -1, "subsection alignment"));
5862 os->section_alignment =
5863 topower (exp_get_value_int (align, -1, "section alignment"));
5865 os->load_base = ebase;
5872 lang_output_statement_type *new;
5874 new = new_stat (lang_output_statement, stat_ptr);
5875 new->name = output_filename;
5878 /* Reset the current counters in the regions. */
5881 lang_reset_memory_regions (void)
5883 lang_memory_region_type *p = lang_memory_region_list;
5885 lang_output_section_statement_type *os;
5887 for (p = lang_memory_region_list; p != NULL; p = p->next)
5889 p->current = p->origin;
5893 for (os = &lang_output_section_statement.head->output_section_statement;
5897 os->processed_vma = FALSE;
5898 os->processed_lma = FALSE;
5901 for (o = link_info.output_bfd->sections; o != NULL; o = o->next)
5903 /* Save the last size for possible use by bfd_relax_section. */
5904 o->rawsize = o->size;
5909 /* Worker for lang_gc_sections_1. */
5912 gc_section_callback (lang_wild_statement_type *ptr,
5913 struct wildcard_list *sec ATTRIBUTE_UNUSED,
5915 lang_input_statement_type *file ATTRIBUTE_UNUSED,
5916 void *data ATTRIBUTE_UNUSED)
5918 /* If the wild pattern was marked KEEP, the member sections
5919 should be as well. */
5920 if (ptr->keep_sections)
5921 section->flags |= SEC_KEEP;
5924 /* Iterate over sections marking them against GC. */
5927 lang_gc_sections_1 (lang_statement_union_type *s)
5929 for (; s != NULL; s = s->header.next)
5931 switch (s->header.type)
5933 case lang_wild_statement_enum:
5934 walk_wild (&s->wild_statement, gc_section_callback, NULL);
5936 case lang_constructors_statement_enum:
5937 lang_gc_sections_1 (constructor_list.head);
5939 case lang_output_section_statement_enum:
5940 lang_gc_sections_1 (s->output_section_statement.children.head);
5942 case lang_group_statement_enum:
5943 lang_gc_sections_1 (s->group_statement.children.head);
5952 lang_gc_sections (void)
5954 /* Keep all sections so marked in the link script. */
5956 lang_gc_sections_1 (statement_list.head);
5958 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
5959 the special case of debug info. (See bfd/stabs.c)
5960 Twiddle the flag here, to simplify later linker code. */
5961 if (link_info.relocatable)
5963 LANG_FOR_EACH_INPUT_STATEMENT (f)
5966 for (sec = f->the_bfd->sections; sec != NULL; sec = sec->next)
5967 if ((sec->flags & SEC_DEBUGGING) == 0)
5968 sec->flags &= ~SEC_EXCLUDE;
5972 if (link_info.gc_sections)
5973 bfd_gc_sections (link_info.output_bfd, &link_info);
5976 /* Worker for lang_find_relro_sections_1. */
5979 find_relro_section_callback (lang_wild_statement_type *ptr ATTRIBUTE_UNUSED,
5980 struct wildcard_list *sec ATTRIBUTE_UNUSED,
5982 lang_input_statement_type *file ATTRIBUTE_UNUSED,
5985 /* Discarded, excluded and ignored sections effectively have zero
5987 if (section->output_section != NULL
5988 && section->output_section->owner == link_info.output_bfd
5989 && (section->output_section->flags & SEC_EXCLUDE) == 0
5990 && !IGNORE_SECTION (section)
5991 && section->size != 0)
5993 bfd_boolean *has_relro_section = (bfd_boolean *) data;
5994 *has_relro_section = TRUE;
5998 /* Iterate over sections for relro sections. */
6001 lang_find_relro_sections_1 (lang_statement_union_type *s,
6002 bfd_boolean *has_relro_section)
6004 if (*has_relro_section)
6007 for (; s != NULL; s = s->header.next)
6009 if (s == expld.dataseg.relro_end_stat)
6012 switch (s->header.type)
6014 case lang_wild_statement_enum:
6015 walk_wild (&s->wild_statement,
6016 find_relro_section_callback,
6019 case lang_constructors_statement_enum:
6020 lang_find_relro_sections_1 (constructor_list.head,
6023 case lang_output_section_statement_enum:
6024 lang_find_relro_sections_1 (s->output_section_statement.children.head,
6027 case lang_group_statement_enum:
6028 lang_find_relro_sections_1 (s->group_statement.children.head,
6038 lang_find_relro_sections (void)
6040 bfd_boolean has_relro_section = FALSE;
6042 /* Check all sections in the link script. */
6044 lang_find_relro_sections_1 (expld.dataseg.relro_start_stat,
6045 &has_relro_section);
6047 if (!has_relro_section)
6048 link_info.relro = FALSE;
6051 /* Relax all sections until bfd_relax_section gives up. */
6054 relax_sections (void)
6056 /* Keep relaxing until bfd_relax_section gives up. */
6057 bfd_boolean relax_again;
6059 link_info.relax_trip = -1;
6062 relax_again = FALSE;
6063 link_info.relax_trip++;
6065 /* Note: pe-dll.c does something like this also. If you find
6066 you need to change this code, you probably need to change
6067 pe-dll.c also. DJ */
6069 /* Do all the assignments with our current guesses as to
6071 lang_do_assignments ();
6073 /* We must do this after lang_do_assignments, because it uses
6075 lang_reset_memory_regions ();
6077 /* Perform another relax pass - this time we know where the
6078 globals are, so can make a better guess. */
6079 lang_size_sections (&relax_again, FALSE);
6081 while (relax_again);
6087 /* Finalize dynamic list. */
6088 if (link_info.dynamic_list)
6089 lang_finalize_version_expr_head (&link_info.dynamic_list->head);
6091 current_target = default_target;
6093 /* Open the output file. */
6094 lang_for_each_statement (ldlang_open_output);
6097 ldemul_create_output_section_statements ();
6099 /* Add to the hash table all undefineds on the command line. */
6100 lang_place_undefineds ();
6102 if (!bfd_section_already_linked_table_init ())
6103 einfo (_("%P%F: Failed to create hash table\n"));
6105 /* Create a bfd for each input file. */
6106 current_target = default_target;
6107 open_input_bfds (statement_list.head, FALSE);
6109 link_info.gc_sym_list = &entry_symbol;
6110 if (entry_symbol.name == NULL)
6111 link_info.gc_sym_list = ldlang_undef_chain_list_head;
6113 ldemul_after_open ();
6115 bfd_section_already_linked_table_free ();
6117 /* Make sure that we're not mixing architectures. We call this
6118 after all the input files have been opened, but before we do any
6119 other processing, so that any operations merge_private_bfd_data
6120 does on the output file will be known during the rest of the
6124 /* Handle .exports instead of a version script if we're told to do so. */
6125 if (command_line.version_exports_section)
6126 lang_do_version_exports_section ();
6128 /* Build all sets based on the information gathered from the input
6130 ldctor_build_sets ();
6132 /* Remove unreferenced sections if asked to. */
6133 lang_gc_sections ();
6135 /* Size up the common data. */
6138 /* Update wild statements. */
6139 update_wild_statements (statement_list.head);
6141 /* Run through the contours of the script and attach input sections
6142 to the correct output sections. */
6143 map_input_to_output_sections (statement_list.head, NULL, NULL);
6145 process_insert_statements ();
6147 /* Find any sections not attached explicitly and handle them. */
6148 lang_place_orphans ();
6150 if (! link_info.relocatable)
6154 /* Merge SEC_MERGE sections. This has to be done after GC of
6155 sections, so that GCed sections are not merged, but before
6156 assigning dynamic symbols, since removing whole input sections
6158 bfd_merge_sections (link_info.output_bfd, &link_info);
6160 /* Look for a text section and set the readonly attribute in it. */
6161 found = bfd_get_section_by_name (link_info.output_bfd, ".text");
6165 if (config.text_read_only)
6166 found->flags |= SEC_READONLY;
6168 found->flags &= ~SEC_READONLY;
6172 /* Do anything special before sizing sections. This is where ELF
6173 and other back-ends size dynamic sections. */
6174 ldemul_before_allocation ();
6176 /* We must record the program headers before we try to fix the
6177 section positions, since they will affect SIZEOF_HEADERS. */
6178 lang_record_phdrs ();
6180 /* Check relro sections. */
6181 if (link_info.relro && ! link_info.relocatable)
6182 lang_find_relro_sections ();
6184 /* Size up the sections. */
6185 lang_size_sections (NULL, !command_line.relax);
6187 /* Now run around and relax if we can. */
6188 if (command_line.relax)
6190 /* We may need more than one relaxation pass. */
6191 int i = link_info.relax_pass;
6193 /* The backend can use it to determine the current pass. */
6194 link_info.relax_pass = 0;
6199 link_info.relax_pass++;
6202 /* Final extra sizing to report errors. */
6203 lang_do_assignments ();
6204 lang_reset_memory_regions ();
6205 lang_size_sections (NULL, TRUE);
6208 /* See if anything special should be done now we know how big
6210 ldemul_after_allocation ();
6212 /* Fix any .startof. or .sizeof. symbols. */
6213 lang_set_startof ();
6215 /* Do all the assignments, now that we know the final resting places
6216 of all the symbols. */
6218 lang_do_assignments ();
6222 /* Make sure that the section addresses make sense. */
6223 if (! link_info.relocatable
6224 && command_line.check_section_addresses)
6225 lang_check_section_addresses ();
6230 /* EXPORTED TO YACC */
6233 lang_add_wild (struct wildcard_spec *filespec,
6234 struct wildcard_list *section_list,
6235 bfd_boolean keep_sections)
6237 struct wildcard_list *curr, *next;
6238 lang_wild_statement_type *new;
6240 /* Reverse the list as the parser puts it back to front. */
6241 for (curr = section_list, section_list = NULL;
6243 section_list = curr, curr = next)
6245 if (curr->spec.name != NULL && strcmp (curr->spec.name, "COMMON") == 0)
6246 placed_commons = TRUE;
6249 curr->next = section_list;
6252 if (filespec != NULL && filespec->name != NULL)
6254 if (strcmp (filespec->name, "*") == 0)
6255 filespec->name = NULL;
6256 else if (! wildcardp (filespec->name))
6257 lang_has_input_file = TRUE;
6260 new = new_stat (lang_wild_statement, stat_ptr);
6261 new->filename = NULL;
6262 new->filenames_sorted = FALSE;
6263 if (filespec != NULL)
6265 new->filename = filespec->name;
6266 new->filenames_sorted = filespec->sorted == by_name;
6268 new->section_list = section_list;
6269 new->keep_sections = keep_sections;
6270 lang_list_init (&new->children);
6271 analyze_walk_wild_section_handler (new);
6275 lang_section_start (const char *name, etree_type *address,
6276 const segment_type *segment)
6278 lang_address_statement_type *ad;
6280 ad = new_stat (lang_address_statement, stat_ptr);
6281 ad->section_name = name;
6282 ad->address = address;
6283 ad->segment = segment;
6286 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
6287 because of a -e argument on the command line, or zero if this is
6288 called by ENTRY in a linker script. Command line arguments take
6292 lang_add_entry (const char *name, bfd_boolean cmdline)
6294 if (entry_symbol.name == NULL
6296 || ! entry_from_cmdline)
6298 entry_symbol.name = name;
6299 entry_from_cmdline = cmdline;
6303 /* Set the default start symbol to NAME. .em files should use this,
6304 not lang_add_entry, to override the use of "start" if neither the
6305 linker script nor the command line specifies an entry point. NAME
6306 must be permanently allocated. */
6308 lang_default_entry (const char *name)
6310 entry_symbol_default = name;
6314 lang_add_target (const char *name)
6316 lang_target_statement_type *new;
6318 new = new_stat (lang_target_statement, stat_ptr);
6323 lang_add_map (const char *name)
6330 map_option_f = TRUE;
6338 lang_add_fill (fill_type *fill)
6340 lang_fill_statement_type *new;
6342 new = new_stat (lang_fill_statement, stat_ptr);
6347 lang_add_data (int type, union etree_union *exp)
6349 lang_data_statement_type *new;
6351 new = new_stat (lang_data_statement, stat_ptr);
6356 /* Create a new reloc statement. RELOC is the BFD relocation type to
6357 generate. HOWTO is the corresponding howto structure (we could
6358 look this up, but the caller has already done so). SECTION is the
6359 section to generate a reloc against, or NAME is the name of the
6360 symbol to generate a reloc against. Exactly one of SECTION and
6361 NAME must be NULL. ADDEND is an expression for the addend. */
6364 lang_add_reloc (bfd_reloc_code_real_type reloc,
6365 reloc_howto_type *howto,
6368 union etree_union *addend)
6370 lang_reloc_statement_type *p = new_stat (lang_reloc_statement, stat_ptr);
6374 p->section = section;
6376 p->addend_exp = addend;
6378 p->addend_value = 0;
6379 p->output_section = NULL;
6380 p->output_offset = 0;
6383 lang_assignment_statement_type *
6384 lang_add_assignment (etree_type *exp)
6386 lang_assignment_statement_type *new;
6388 new = new_stat (lang_assignment_statement, stat_ptr);
6394 lang_add_attribute (enum statement_enum attribute)
6396 new_statement (attribute, sizeof (lang_statement_header_type), stat_ptr);
6400 lang_startup (const char *name)
6402 if (startup_file != NULL)
6404 einfo (_("%P%F: multiple STARTUP files\n"));
6406 first_file->filename = name;
6407 first_file->local_sym_name = name;
6408 first_file->real = TRUE;
6410 startup_file = name;
6414 lang_float (bfd_boolean maybe)
6416 lang_float_flag = maybe;
6420 /* Work out the load- and run-time regions from a script statement, and
6421 store them in *LMA_REGION and *REGION respectively.
6423 MEMSPEC is the name of the run-time region, or the value of
6424 DEFAULT_MEMORY_REGION if the statement didn't specify one.
6425 LMA_MEMSPEC is the name of the load-time region, or null if the
6426 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
6427 had an explicit load address.
6429 It is an error to specify both a load region and a load address. */
6432 lang_get_regions (lang_memory_region_type **region,
6433 lang_memory_region_type **lma_region,
6434 const char *memspec,
6435 const char *lma_memspec,
6436 bfd_boolean have_lma,
6437 bfd_boolean have_vma)
6439 *lma_region = lang_memory_region_lookup (lma_memspec, FALSE);
6441 /* If no runtime region or VMA has been specified, but the load region
6442 has been specified, then use the load region for the runtime region
6444 if (lma_memspec != NULL
6446 && strcmp (memspec, DEFAULT_MEMORY_REGION) == 0)
6447 *region = *lma_region;
6449 *region = lang_memory_region_lookup (memspec, FALSE);
6451 if (have_lma && lma_memspec != 0)
6452 einfo (_("%X%P:%S: section has both a load address and a load region\n"));
6456 lang_leave_output_section_statement (fill_type *fill, const char *memspec,
6457 lang_output_section_phdr_list *phdrs,
6458 const char *lma_memspec)
6460 lang_get_regions (¤t_section->region,
6461 ¤t_section->lma_region,
6462 memspec, lma_memspec,
6463 current_section->load_base != NULL,
6464 current_section->addr_tree != NULL);
6465 current_section->fill = fill;
6466 current_section->phdrs = phdrs;
6467 stat_ptr = &statement_list;
6470 /* Create an absolute symbol with the given name with the value of the
6471 address of first byte of the section named.
6473 If the symbol already exists, then do nothing. */
6476 lang_abs_symbol_at_beginning_of (const char *secname, const char *name)
6478 struct bfd_link_hash_entry *h;
6480 h = bfd_link_hash_lookup (link_info.hash, name, TRUE, TRUE, TRUE);
6482 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
6484 if (h->type == bfd_link_hash_new
6485 || h->type == bfd_link_hash_undefined)
6489 h->type = bfd_link_hash_defined;
6491 sec = bfd_get_section_by_name (link_info.output_bfd, secname);
6495 h->u.def.value = bfd_get_section_vma (link_info.output_bfd, sec);
6497 h->u.def.section = bfd_abs_section_ptr;
6501 /* Create an absolute symbol with the given name with the value of the
6502 address of the first byte after the end of the section named.
6504 If the symbol already exists, then do nothing. */
6507 lang_abs_symbol_at_end_of (const char *secname, const char *name)
6509 struct bfd_link_hash_entry *h;
6511 h = bfd_link_hash_lookup (link_info.hash, name, TRUE, TRUE, TRUE);
6513 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
6515 if (h->type == bfd_link_hash_new
6516 || h->type == bfd_link_hash_undefined)
6520 h->type = bfd_link_hash_defined;
6522 sec = bfd_get_section_by_name (link_info.output_bfd, secname);
6526 h->u.def.value = (bfd_get_section_vma (link_info.output_bfd, sec)
6527 + TO_ADDR (sec->size));
6529 h->u.def.section = bfd_abs_section_ptr;
6534 lang_statement_append (lang_statement_list_type *list,
6535 lang_statement_union_type *element,
6536 lang_statement_union_type **field)
6538 *(list->tail) = element;
6542 /* Set the output format type. -oformat overrides scripts. */
6545 lang_add_output_format (const char *format,
6550 if (output_target == NULL || !from_script)
6552 if (command_line.endian == ENDIAN_BIG
6555 else if (command_line.endian == ENDIAN_LITTLE
6559 output_target = format;
6564 lang_add_insert (const char *where, int is_before)
6566 lang_insert_statement_type *new;
6568 new = new_stat (lang_insert_statement, stat_ptr);
6570 new->is_before = is_before;
6571 saved_script_handle = previous_script_handle;
6574 /* Enter a group. This creates a new lang_group_statement, and sets
6575 stat_ptr to build new statements within the group. */
6578 lang_enter_group (void)
6580 lang_group_statement_type *g;
6582 g = new_stat (lang_group_statement, stat_ptr);
6583 lang_list_init (&g->children);
6584 stat_ptr = &g->children;
6587 /* Leave a group. This just resets stat_ptr to start writing to the
6588 regular list of statements again. Note that this will not work if
6589 groups can occur inside anything else which can adjust stat_ptr,
6590 but currently they can't. */
6593 lang_leave_group (void)
6595 stat_ptr = &statement_list;
6598 /* Add a new program header. This is called for each entry in a PHDRS
6599 command in a linker script. */
6602 lang_new_phdr (const char *name,
6604 bfd_boolean filehdr,
6609 struct lang_phdr *n, **pp;
6611 n = stat_alloc (sizeof (struct lang_phdr));
6614 n->type = exp_get_value_int (type, 0, "program header type");
6615 n->filehdr = filehdr;
6620 for (pp = &lang_phdr_list; *pp != NULL; pp = &(*pp)->next)
6625 /* Record the program header information in the output BFD. FIXME: We
6626 should not be calling an ELF specific function here. */
6629 lang_record_phdrs (void)
6633 lang_output_section_phdr_list *last;
6634 struct lang_phdr *l;
6635 lang_output_section_statement_type *os;
6638 secs = xmalloc (alc * sizeof (asection *));
6641 for (l = lang_phdr_list; l != NULL; l = l->next)
6648 for (os = &lang_output_section_statement.head->output_section_statement;
6652 lang_output_section_phdr_list *pl;
6654 if (os->constraint < 0)
6662 if (os->sectype == noload_section
6663 || os->bfd_section == NULL
6664 || (os->bfd_section->flags & SEC_ALLOC) == 0)
6669 lang_output_section_statement_type * tmp_os;
6671 /* If we have not run across a section with a program
6672 header assigned to it yet, then scan forwards to find
6673 one. This prevents inconsistencies in the linker's
6674 behaviour when a script has specified just a single
6675 header and there are sections in that script which are
6676 not assigned to it, and which occur before the first
6677 use of that header. See here for more details:
6678 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
6679 for (tmp_os = os; tmp_os; tmp_os = tmp_os->next)
6682 last = tmp_os->phdrs;
6686 einfo (_("%F%P: no sections assigned to phdrs\n"));
6691 if (os->bfd_section == NULL)
6694 for (; pl != NULL; pl = pl->next)
6696 if (strcmp (pl->name, l->name) == 0)
6701 secs = xrealloc (secs, alc * sizeof (asection *));
6703 secs[c] = os->bfd_section;
6710 if (l->flags == NULL)
6713 flags = exp_get_vma (l->flags, 0, "phdr flags");
6718 at = exp_get_vma (l->at, 0, "phdr load address");
6720 if (! bfd_record_phdr (link_info.output_bfd, l->type,
6721 l->flags != NULL, flags, l->at != NULL,
6722 at, l->filehdr, l->phdrs, c, secs))
6723 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
6728 /* Make sure all the phdr assignments succeeded. */
6729 for (os = &lang_output_section_statement.head->output_section_statement;
6733 lang_output_section_phdr_list *pl;
6735 if (os->constraint < 0
6736 || os->bfd_section == NULL)
6739 for (pl = os->phdrs;
6742 if (! pl->used && strcmp (pl->name, "NONE") != 0)
6743 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
6744 os->name, pl->name);
6748 /* Record a list of sections which may not be cross referenced. */
6751 lang_add_nocrossref (lang_nocrossref_type *l)
6753 struct lang_nocrossrefs *n;
6755 n = xmalloc (sizeof *n);
6756 n->next = nocrossref_list;
6758 nocrossref_list = n;
6760 /* Set notice_all so that we get informed about all symbols. */
6761 link_info.notice_all = TRUE;
6764 /* Overlay handling. We handle overlays with some static variables. */
6766 /* The overlay virtual address. */
6767 static etree_type *overlay_vma;
6768 /* And subsection alignment. */
6769 static etree_type *overlay_subalign;
6771 /* An expression for the maximum section size seen so far. */
6772 static etree_type *overlay_max;
6774 /* A list of all the sections in this overlay. */
6776 struct overlay_list {
6777 struct overlay_list *next;
6778 lang_output_section_statement_type *os;
6781 static struct overlay_list *overlay_list;
6783 /* Start handling an overlay. */
6786 lang_enter_overlay (etree_type *vma_expr, etree_type *subalign)
6788 /* The grammar should prevent nested overlays from occurring. */
6789 ASSERT (overlay_vma == NULL
6790 && overlay_subalign == NULL
6791 && overlay_max == NULL);
6793 overlay_vma = vma_expr;
6794 overlay_subalign = subalign;
6797 /* Start a section in an overlay. We handle this by calling
6798 lang_enter_output_section_statement with the correct VMA.
6799 lang_leave_overlay sets up the LMA and memory regions. */
6802 lang_enter_overlay_section (const char *name)
6804 struct overlay_list *n;
6807 lang_enter_output_section_statement (name, overlay_vma, overlay_section,
6808 0, overlay_subalign, 0, 0);
6810 /* If this is the first section, then base the VMA of future
6811 sections on this one. This will work correctly even if `.' is
6812 used in the addresses. */
6813 if (overlay_list == NULL)
6814 overlay_vma = exp_nameop (ADDR, name);
6816 /* Remember the section. */
6817 n = xmalloc (sizeof *n);
6818 n->os = current_section;
6819 n->next = overlay_list;
6822 size = exp_nameop (SIZEOF, name);
6824 /* Arrange to work out the maximum section end address. */
6825 if (overlay_max == NULL)
6828 overlay_max = exp_binop (MAX_K, overlay_max, size);
6831 /* Finish a section in an overlay. There isn't any special to do
6835 lang_leave_overlay_section (fill_type *fill,
6836 lang_output_section_phdr_list *phdrs)
6843 name = current_section->name;
6845 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
6846 region and that no load-time region has been specified. It doesn't
6847 really matter what we say here, since lang_leave_overlay will
6849 lang_leave_output_section_statement (fill, DEFAULT_MEMORY_REGION, phdrs, 0);
6851 /* Define the magic symbols. */
6853 clean = xmalloc (strlen (name) + 1);
6855 for (s1 = name; *s1 != '\0'; s1++)
6856 if (ISALNUM (*s1) || *s1 == '_')
6860 buf = xmalloc (strlen (clean) + sizeof "__load_start_");
6861 sprintf (buf, "__load_start_%s", clean);
6862 lang_add_assignment (exp_provide (buf,
6863 exp_nameop (LOADADDR, name),
6866 buf = xmalloc (strlen (clean) + sizeof "__load_stop_");
6867 sprintf (buf, "__load_stop_%s", clean);
6868 lang_add_assignment (exp_provide (buf,
6870 exp_nameop (LOADADDR, name),
6871 exp_nameop (SIZEOF, name)),
6877 /* Finish an overlay. If there are any overlay wide settings, this
6878 looks through all the sections in the overlay and sets them. */
6881 lang_leave_overlay (etree_type *lma_expr,
6884 const char *memspec,
6885 lang_output_section_phdr_list *phdrs,
6886 const char *lma_memspec)
6888 lang_memory_region_type *region;
6889 lang_memory_region_type *lma_region;
6890 struct overlay_list *l;
6891 lang_nocrossref_type *nocrossref;
6893 lang_get_regions (®ion, &lma_region,
6894 memspec, lma_memspec,
6895 lma_expr != NULL, FALSE);
6899 /* After setting the size of the last section, set '.' to end of the
6901 if (overlay_list != NULL)
6902 overlay_list->os->update_dot_tree
6903 = exp_assop ('=', ".", exp_binop ('+', overlay_vma, overlay_max));
6908 struct overlay_list *next;
6910 if (fill != NULL && l->os->fill == NULL)
6913 l->os->region = region;
6914 l->os->lma_region = lma_region;
6916 /* The first section has the load address specified in the
6917 OVERLAY statement. The rest are worked out from that.
6918 The base address is not needed (and should be null) if
6919 an LMA region was specified. */
6922 l->os->load_base = lma_expr;
6923 l->os->sectype = normal_section;
6925 if (phdrs != NULL && l->os->phdrs == NULL)
6926 l->os->phdrs = phdrs;
6930 lang_nocrossref_type *nc;
6932 nc = xmalloc (sizeof *nc);
6933 nc->name = l->os->name;
6934 nc->next = nocrossref;
6943 if (nocrossref != NULL)
6944 lang_add_nocrossref (nocrossref);
6947 overlay_list = NULL;
6951 /* Version handling. This is only useful for ELF. */
6953 /* This global variable holds the version tree that we build. */
6955 struct bfd_elf_version_tree *lang_elf_version_info;
6957 /* If PREV is NULL, return first version pattern matching particular symbol.
6958 If PREV is non-NULL, return first version pattern matching particular
6959 symbol after PREV (previously returned by lang_vers_match). */
6961 static struct bfd_elf_version_expr *
6962 lang_vers_match (struct bfd_elf_version_expr_head *head,
6963 struct bfd_elf_version_expr *prev,
6966 const char *cxx_sym = sym;
6967 const char *java_sym = sym;
6968 struct bfd_elf_version_expr *expr = NULL;
6970 if (head->mask & BFD_ELF_VERSION_CXX_TYPE)
6972 cxx_sym = cplus_demangle (sym, DMGL_PARAMS | DMGL_ANSI);
6976 if (head->mask & BFD_ELF_VERSION_JAVA_TYPE)
6978 java_sym = cplus_demangle (sym, DMGL_JAVA);
6983 if (head->htab && (prev == NULL || prev->symbol))
6985 struct bfd_elf_version_expr e;
6987 switch (prev ? prev->mask : 0)
6990 if (head->mask & BFD_ELF_VERSION_C_TYPE)
6993 expr = htab_find (head->htab, &e);
6994 while (expr && strcmp (expr->symbol, sym) == 0)
6995 if (expr->mask == BFD_ELF_VERSION_C_TYPE)
7001 case BFD_ELF_VERSION_C_TYPE:
7002 if (head->mask & BFD_ELF_VERSION_CXX_TYPE)
7005 expr = htab_find (head->htab, &e);
7006 while (expr && strcmp (expr->symbol, cxx_sym) == 0)
7007 if (expr->mask == BFD_ELF_VERSION_CXX_TYPE)
7013 case BFD_ELF_VERSION_CXX_TYPE:
7014 if (head->mask & BFD_ELF_VERSION_JAVA_TYPE)
7016 e.symbol = java_sym;
7017 expr = htab_find (head->htab, &e);
7018 while (expr && strcmp (expr->symbol, java_sym) == 0)
7019 if (expr->mask == BFD_ELF_VERSION_JAVA_TYPE)
7030 /* Finally, try the wildcards. */
7031 if (prev == NULL || prev->symbol)
7032 expr = head->remaining;
7035 for (; expr; expr = expr->next)
7042 if (expr->pattern[0] == '*' && expr->pattern[1] == '\0')
7045 if (expr->mask == BFD_ELF_VERSION_JAVA_TYPE)
7047 else if (expr->mask == BFD_ELF_VERSION_CXX_TYPE)
7051 if (fnmatch (expr->pattern, s, 0) == 0)
7057 free ((char *) cxx_sym);
7058 if (java_sym != sym)
7059 free ((char *) java_sym);
7063 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
7064 return a string pointing to the symbol name. */
7067 realsymbol (const char *pattern)
7070 bfd_boolean changed = FALSE, backslash = FALSE;
7071 char *s, *symbol = xmalloc (strlen (pattern) + 1);
7073 for (p = pattern, s = symbol; *p != '\0'; ++p)
7075 /* It is a glob pattern only if there is no preceding
7077 if (! backslash && (*p == '?' || *p == '*' || *p == '['))
7085 /* Remove the preceding backslash. */
7092 backslash = *p == '\\';
7107 /* This is called for each variable name or match expression. NEW is
7108 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
7109 pattern to be matched against symbol names. */
7111 struct bfd_elf_version_expr *
7112 lang_new_vers_pattern (struct bfd_elf_version_expr *orig,
7115 bfd_boolean literal_p)
7117 struct bfd_elf_version_expr *ret;
7119 ret = xmalloc (sizeof *ret);
7121 ret->pattern = literal_p ? NULL : new;
7124 ret->symbol = literal_p ? new : realsymbol (new);
7126 if (lang == NULL || strcasecmp (lang, "C") == 0)
7127 ret->mask = BFD_ELF_VERSION_C_TYPE;
7128 else if (strcasecmp (lang, "C++") == 0)
7129 ret->mask = BFD_ELF_VERSION_CXX_TYPE;
7130 else if (strcasecmp (lang, "Java") == 0)
7131 ret->mask = BFD_ELF_VERSION_JAVA_TYPE;
7134 einfo (_("%X%P: unknown language `%s' in version information\n"),
7136 ret->mask = BFD_ELF_VERSION_C_TYPE;
7139 return ldemul_new_vers_pattern (ret);
7142 /* This is called for each set of variable names and match
7145 struct bfd_elf_version_tree *
7146 lang_new_vers_node (struct bfd_elf_version_expr *globals,
7147 struct bfd_elf_version_expr *locals)
7149 struct bfd_elf_version_tree *ret;
7151 ret = xcalloc (1, sizeof *ret);
7152 ret->globals.list = globals;
7153 ret->locals.list = locals;
7154 ret->match = lang_vers_match;
7155 ret->name_indx = (unsigned int) -1;
7159 /* This static variable keeps track of version indices. */
7161 static int version_index;
7164 version_expr_head_hash (const void *p)
7166 const struct bfd_elf_version_expr *e = p;
7168 return htab_hash_string (e->symbol);
7172 version_expr_head_eq (const void *p1, const void *p2)
7174 const struct bfd_elf_version_expr *e1 = p1;
7175 const struct bfd_elf_version_expr *e2 = p2;
7177 return strcmp (e1->symbol, e2->symbol) == 0;
7181 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head *head)
7184 struct bfd_elf_version_expr *e, *next;
7185 struct bfd_elf_version_expr **list_loc, **remaining_loc;
7187 for (e = head->list; e; e = e->next)
7191 head->mask |= e->mask;
7196 head->htab = htab_create (count * 2, version_expr_head_hash,
7197 version_expr_head_eq, NULL);
7198 list_loc = &head->list;
7199 remaining_loc = &head->remaining;
7200 for (e = head->list; e; e = next)
7206 remaining_loc = &e->next;
7210 void **loc = htab_find_slot (head->htab, e, INSERT);
7214 struct bfd_elf_version_expr *e1, *last;
7220 if (e1->mask == e->mask)
7228 while (e1 && strcmp (e1->symbol, e->symbol) == 0);
7232 /* This is a duplicate. */
7233 /* FIXME: Memory leak. Sometimes pattern is not
7234 xmalloced alone, but in larger chunk of memory. */
7235 /* free (e->symbol); */
7240 e->next = last->next;
7248 list_loc = &e->next;
7252 *remaining_loc = NULL;
7253 *list_loc = head->remaining;
7256 head->remaining = head->list;
7259 /* This is called when we know the name and dependencies of the
7263 lang_register_vers_node (const char *name,
7264 struct bfd_elf_version_tree *version,
7265 struct bfd_elf_version_deps *deps)
7267 struct bfd_elf_version_tree *t, **pp;
7268 struct bfd_elf_version_expr *e1;
7273 if ((name[0] == '\0' && lang_elf_version_info != NULL)
7274 || (lang_elf_version_info && lang_elf_version_info->name[0] == '\0'))
7276 einfo (_("%X%P: anonymous version tag cannot be combined"
7277 " with other version tags\n"));
7282 /* Make sure this node has a unique name. */
7283 for (t = lang_elf_version_info; t != NULL; t = t->next)
7284 if (strcmp (t->name, name) == 0)
7285 einfo (_("%X%P: duplicate version tag `%s'\n"), name);
7287 lang_finalize_version_expr_head (&version->globals);
7288 lang_finalize_version_expr_head (&version->locals);
7290 /* Check the global and local match names, and make sure there
7291 aren't any duplicates. */
7293 for (e1 = version->globals.list; e1 != NULL; e1 = e1->next)
7295 for (t = lang_elf_version_info; t != NULL; t = t->next)
7297 struct bfd_elf_version_expr *e2;
7299 if (t->locals.htab && e1->symbol)
7301 e2 = htab_find (t->locals.htab, e1);
7302 while (e2 && strcmp (e1->symbol, e2->symbol) == 0)
7304 if (e1->mask == e2->mask)
7305 einfo (_("%X%P: duplicate expression `%s'"
7306 " in version information\n"), e1->symbol);
7310 else if (!e1->symbol)
7311 for (e2 = t->locals.remaining; e2 != NULL; e2 = e2->next)
7312 if (strcmp (e1->pattern, e2->pattern) == 0
7313 && e1->mask == e2->mask)
7314 einfo (_("%X%P: duplicate expression `%s'"
7315 " in version information\n"), e1->pattern);
7319 for (e1 = version->locals.list; e1 != NULL; e1 = e1->next)
7321 for (t = lang_elf_version_info; t != NULL; t = t->next)
7323 struct bfd_elf_version_expr *e2;
7325 if (t->globals.htab && e1->symbol)
7327 e2 = htab_find (t->globals.htab, e1);
7328 while (e2 && strcmp (e1->symbol, e2->symbol) == 0)
7330 if (e1->mask == e2->mask)
7331 einfo (_("%X%P: duplicate expression `%s'"
7332 " in version information\n"),
7337 else if (!e1->symbol)
7338 for (e2 = t->globals.remaining; e2 != NULL; e2 = e2->next)
7339 if (strcmp (e1->pattern, e2->pattern) == 0
7340 && e1->mask == e2->mask)
7341 einfo (_("%X%P: duplicate expression `%s'"
7342 " in version information\n"), e1->pattern);
7346 version->deps = deps;
7347 version->name = name;
7348 if (name[0] != '\0')
7351 version->vernum = version_index;
7354 version->vernum = 0;
7356 for (pp = &lang_elf_version_info; *pp != NULL; pp = &(*pp)->next)
7361 /* This is called when we see a version dependency. */
7363 struct bfd_elf_version_deps *
7364 lang_add_vers_depend (struct bfd_elf_version_deps *list, const char *name)
7366 struct bfd_elf_version_deps *ret;
7367 struct bfd_elf_version_tree *t;
7369 ret = xmalloc (sizeof *ret);
7372 for (t = lang_elf_version_info; t != NULL; t = t->next)
7374 if (strcmp (t->name, name) == 0)
7376 ret->version_needed = t;
7381 einfo (_("%X%P: unable to find version dependency `%s'\n"), name);
7387 lang_do_version_exports_section (void)
7389 struct bfd_elf_version_expr *greg = NULL, *lreg;
7391 LANG_FOR_EACH_INPUT_STATEMENT (is)
7393 asection *sec = bfd_get_section_by_name (is->the_bfd, ".exports");
7401 contents = xmalloc (len);
7402 if (!bfd_get_section_contents (is->the_bfd, sec, contents, 0, len))
7403 einfo (_("%X%P: unable to read .exports section contents\n"), sec);
7406 while (p < contents + len)
7408 greg = lang_new_vers_pattern (greg, p, NULL, FALSE);
7409 p = strchr (p, '\0') + 1;
7412 /* Do not free the contents, as we used them creating the regex. */
7414 /* Do not include this section in the link. */
7415 sec->flags |= SEC_EXCLUDE | SEC_KEEP;
7418 lreg = lang_new_vers_pattern (NULL, "*", NULL, FALSE);
7419 lang_register_vers_node (command_line.version_exports_section,
7420 lang_new_vers_node (greg, lreg), NULL);
7424 lang_add_unique (const char *name)
7426 struct unique_sections *ent;
7428 for (ent = unique_section_list; ent; ent = ent->next)
7429 if (strcmp (ent->name, name) == 0)
7432 ent = xmalloc (sizeof *ent);
7433 ent->name = xstrdup (name);
7434 ent->next = unique_section_list;
7435 unique_section_list = ent;
7438 /* Append the list of dynamic symbols to the existing one. */
7441 lang_append_dynamic_list (struct bfd_elf_version_expr *dynamic)
7443 if (link_info.dynamic_list)
7445 struct bfd_elf_version_expr *tail;
7446 for (tail = dynamic; tail->next != NULL; tail = tail->next)
7448 tail->next = link_info.dynamic_list->head.list;
7449 link_info.dynamic_list->head.list = dynamic;
7453 struct bfd_elf_dynamic_list *d;
7455 d = xcalloc (1, sizeof *d);
7456 d->head.list = dynamic;
7457 d->match = lang_vers_match;
7458 link_info.dynamic_list = d;
7462 /* Append the list of C++ typeinfo dynamic symbols to the existing
7466 lang_append_dynamic_list_cpp_typeinfo (void)
7468 const char * symbols [] =
7470 "typeinfo name for*",
7473 struct bfd_elf_version_expr *dynamic = NULL;
7476 for (i = 0; i < ARRAY_SIZE (symbols); i++)
7477 dynamic = lang_new_vers_pattern (dynamic, symbols [i], "C++",
7480 lang_append_dynamic_list (dynamic);
7483 /* Append the list of C++ operator new and delete dynamic symbols to the
7487 lang_append_dynamic_list_cpp_new (void)
7489 const char * symbols [] =
7494 struct bfd_elf_version_expr *dynamic = NULL;
7497 for (i = 0; i < ARRAY_SIZE (symbols); i++)
7498 dynamic = lang_new_vers_pattern (dynamic, symbols [i], "C++",
7501 lang_append_dynamic_list (dynamic);