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, 2009, 2010, 2011, 2012
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. */
25 #include "libiberty.h"
26 #include "filenames.h"
27 #include "safe-ctype.h"
47 #endif /* ENABLE_PLUGINS */
50 #define offsetof(TYPE, MEMBER) ((size_t) & (((TYPE*) 0)->MEMBER))
53 /* Locals variables. */
54 static struct obstack stat_obstack;
55 static struct obstack map_obstack;
57 #define obstack_chunk_alloc xmalloc
58 #define obstack_chunk_free free
59 static const char *entry_symbol_default = "start";
60 static bfd_boolean placed_commons = FALSE;
61 static bfd_boolean stripped_excluded_sections = FALSE;
62 static lang_output_section_statement_type *default_common_section;
63 static bfd_boolean map_option_f;
64 static bfd_vma print_dot;
65 static lang_input_statement_type *first_file;
66 static const char *current_target;
67 static lang_statement_list_type statement_list;
68 static struct bfd_hash_table lang_definedness_table;
69 static lang_statement_list_type *stat_save[10];
70 static lang_statement_list_type **stat_save_ptr = &stat_save[0];
71 static struct unique_sections *unique_section_list;
73 /* Forward declarations. */
74 static void exp_init_os (etree_type *);
75 static void init_map_userdata (bfd *, asection *, void *);
76 static lang_input_statement_type *lookup_name (const char *);
77 static struct bfd_hash_entry *lang_definedness_newfunc
78 (struct bfd_hash_entry *, struct bfd_hash_table *, const char *);
79 static void insert_undefined (const char *);
80 static bfd_boolean sort_def_symbol (struct bfd_link_hash_entry *, void *);
81 static void print_statement (lang_statement_union_type *,
82 lang_output_section_statement_type *);
83 static void print_statement_list (lang_statement_union_type *,
84 lang_output_section_statement_type *);
85 static void print_statements (void);
86 static void print_input_section (asection *, bfd_boolean);
87 static bfd_boolean lang_one_common (struct bfd_link_hash_entry *, void *);
88 static void lang_record_phdrs (void);
89 static void lang_do_version_exports_section (void);
90 static void lang_finalize_version_expr_head
91 (struct bfd_elf_version_expr_head *);
93 /* Exported variables. */
94 const char *output_target;
95 lang_output_section_statement_type *abs_output_section;
96 lang_statement_list_type lang_output_section_statement;
97 lang_statement_list_type *stat_ptr = &statement_list;
98 lang_statement_list_type file_chain = { NULL, NULL };
99 lang_statement_list_type input_file_chain;
100 struct bfd_sym_chain entry_symbol = { NULL, NULL };
101 const char *entry_section = ".text";
102 struct lang_input_statement_flags input_flags;
103 bfd_boolean entry_from_cmdline;
104 bfd_boolean undef_from_cmdline;
105 bfd_boolean lang_has_input_file = FALSE;
106 bfd_boolean had_output_filename = FALSE;
107 bfd_boolean lang_float_flag = FALSE;
108 bfd_boolean delete_output_file_on_failure = FALSE;
109 struct lang_phdr *lang_phdr_list;
110 struct lang_nocrossrefs *nocrossref_list;
112 /* Functions that traverse the linker script and might evaluate
113 DEFINED() need to increment this. */
114 int lang_statement_iteration = 0;
116 etree_type *base; /* Relocation base - or null */
118 /* Return TRUE if the PATTERN argument is a wildcard pattern.
119 Although backslashes are treated specially if a pattern contains
120 wildcards, we do not consider the mere presence of a backslash to
121 be enough to cause the pattern to be treated as a wildcard.
122 That lets us handle DOS filenames more naturally. */
123 #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL)
125 #define new_stat(x, y) \
126 (x##_type *) new_statement (x##_enum, sizeof (x##_type), y)
128 #define outside_section_address(q) \
129 ((q)->output_offset + (q)->output_section->vma)
131 #define outside_symbol_address(q) \
132 ((q)->value + outside_section_address (q->section))
134 #define SECTION_NAME_MAP_LENGTH (16)
137 stat_alloc (size_t size)
139 return obstack_alloc (&stat_obstack, size);
143 name_match (const char *pattern, const char *name)
145 if (wildcardp (pattern))
146 return fnmatch (pattern, name, 0);
147 return strcmp (pattern, name);
150 /* If PATTERN is of the form archive:file, return a pointer to the
151 separator. If not, return NULL. */
154 archive_path (const char *pattern)
158 if (link_info.path_separator == 0)
161 p = strchr (pattern, link_info.path_separator);
162 #ifdef HAVE_DOS_BASED_FILE_SYSTEM
163 if (p == NULL || link_info.path_separator != ':')
166 /* Assume a match on the second char is part of drive specifier,
167 as in "c:\silly.dos". */
168 if (p == pattern + 1 && ISALPHA (*pattern))
169 p = strchr (p + 1, link_info.path_separator);
174 /* Given that FILE_SPEC results in a non-NULL SEP result from archive_path,
175 return whether F matches FILE_SPEC. */
178 input_statement_is_archive_path (const char *file_spec, char *sep,
179 lang_input_statement_type *f)
181 bfd_boolean match = FALSE;
184 || name_match (sep + 1, f->filename) == 0)
185 && ((sep != file_spec)
186 == (f->the_bfd != NULL && f->the_bfd->my_archive != NULL)))
190 if (sep != file_spec)
192 const char *aname = f->the_bfd->my_archive->filename;
194 match = name_match (file_spec, aname) == 0;
195 *sep = link_info.path_separator;
202 unique_section_p (const asection *sec,
203 const lang_output_section_statement_type *os)
205 struct unique_sections *unam;
208 if (link_info.relocatable
209 && sec->owner != NULL
210 && bfd_is_group_section (sec->owner, sec))
212 && strcmp (os->name, DISCARD_SECTION_NAME) == 0);
215 for (unam = unique_section_list; unam; unam = unam->next)
216 if (name_match (unam->name, secnam) == 0)
222 /* Generic traversal routines for finding matching sections. */
224 /* Try processing a section against a wildcard. This just calls
225 the callback unless the filename exclusion list is present
226 and excludes the file. It's hardly ever present so this
227 function is very fast. */
230 walk_wild_consider_section (lang_wild_statement_type *ptr,
231 lang_input_statement_type *file,
233 struct wildcard_list *sec,
237 struct name_list *list_tmp;
239 /* Don't process sections from files which were excluded. */
240 for (list_tmp = sec->spec.exclude_name_list;
242 list_tmp = list_tmp->next)
244 char *p = archive_path (list_tmp->name);
248 if (input_statement_is_archive_path (list_tmp->name, p, file))
252 else if (name_match (list_tmp->name, file->filename) == 0)
255 /* FIXME: Perhaps remove the following at some stage? Matching
256 unadorned archives like this was never documented and has
257 been superceded by the archive:path syntax. */
258 else if (file->the_bfd != NULL
259 && file->the_bfd->my_archive != NULL
260 && name_match (list_tmp->name,
261 file->the_bfd->my_archive->filename) == 0)
265 (*callback) (ptr, sec, s, ptr->section_flag_list, file, data);
268 /* Lowest common denominator routine that can handle everything correctly,
272 walk_wild_section_general (lang_wild_statement_type *ptr,
273 lang_input_statement_type *file,
278 struct wildcard_list *sec;
280 for (s = file->the_bfd->sections; s != NULL; s = s->next)
282 sec = ptr->section_list;
284 (*callback) (ptr, sec, s, ptr->section_flag_list, file, data);
288 bfd_boolean skip = FALSE;
290 if (sec->spec.name != NULL)
292 const char *sname = bfd_get_section_name (file->the_bfd, s);
294 skip = name_match (sec->spec.name, sname) != 0;
298 walk_wild_consider_section (ptr, file, s, sec, callback, data);
305 /* Routines to find a single section given its name. If there's more
306 than one section with that name, we report that. */
310 asection *found_section;
311 bfd_boolean multiple_sections_found;
312 } section_iterator_callback_data;
315 section_iterator_callback (bfd *abfd ATTRIBUTE_UNUSED, asection *s, void *data)
317 section_iterator_callback_data *d = (section_iterator_callback_data *) data;
319 if (d->found_section != NULL)
321 d->multiple_sections_found = TRUE;
325 d->found_section = s;
330 find_section (lang_input_statement_type *file,
331 struct wildcard_list *sec,
332 bfd_boolean *multiple_sections_found)
334 section_iterator_callback_data cb_data = { NULL, FALSE };
336 bfd_get_section_by_name_if (file->the_bfd, sec->spec.name,
337 section_iterator_callback, &cb_data);
338 *multiple_sections_found = cb_data.multiple_sections_found;
339 return cb_data.found_section;
342 /* Code for handling simple wildcards without going through fnmatch,
343 which can be expensive because of charset translations etc. */
345 /* A simple wild is a literal string followed by a single '*',
346 where the literal part is at least 4 characters long. */
349 is_simple_wild (const char *name)
351 size_t len = strcspn (name, "*?[");
352 return len >= 4 && name[len] == '*' && name[len + 1] == '\0';
356 match_simple_wild (const char *pattern, const char *name)
358 /* The first four characters of the pattern are guaranteed valid
359 non-wildcard characters. So we can go faster. */
360 if (pattern[0] != name[0] || pattern[1] != name[1]
361 || pattern[2] != name[2] || pattern[3] != name[3])
366 while (*pattern != '*')
367 if (*name++ != *pattern++)
373 /* Return the numerical value of the init_priority attribute from
374 section name NAME. */
377 get_init_priority (const char *name)
380 unsigned long init_priority;
382 /* GCC uses the following section names for the init_priority
383 attribute with numerical values 101 and 65535 inclusive. A
384 lower value means a higher priority.
386 1: .init_array.NNNN/.fini_array.NNNN: Where NNNN is the
387 decimal numerical value of the init_priority attribute.
388 The order of execution in .init_array is forward and
389 .fini_array is backward.
390 2: .ctors.NNNN/.ctors.NNNN: Where NNNN is 65535 minus the
391 decimal numerical value of the init_priority attribute.
392 The order of execution in .ctors is backward and .dtors
395 if (strncmp (name, ".init_array.", 12) == 0
396 || strncmp (name, ".fini_array.", 12) == 0)
398 init_priority = strtoul (name + 12, &end, 10);
399 return *end ? 0 : init_priority;
401 else if (strncmp (name, ".ctors.", 7) == 0
402 || strncmp (name, ".dtors.", 7) == 0)
404 init_priority = strtoul (name + 7, &end, 10);
405 return *end ? 0 : 65535 - init_priority;
411 /* Compare sections ASEC and BSEC according to SORT. */
414 compare_section (sort_type sort, asection *asec, asection *bsec)
417 unsigned long ainit_priority, binit_priority;
424 case by_init_priority:
426 = get_init_priority (bfd_get_section_name (asec->owner, asec));
428 = get_init_priority (bfd_get_section_name (bsec->owner, bsec));
429 if (ainit_priority == 0 || binit_priority == 0)
431 ret = ainit_priority - binit_priority;
437 case by_alignment_name:
438 ret = (bfd_section_alignment (bsec->owner, bsec)
439 - bfd_section_alignment (asec->owner, asec));
446 ret = strcmp (bfd_get_section_name (asec->owner, asec),
447 bfd_get_section_name (bsec->owner, bsec));
450 case by_name_alignment:
451 ret = strcmp (bfd_get_section_name (asec->owner, asec),
452 bfd_get_section_name (bsec->owner, bsec));
458 ret = (bfd_section_alignment (bsec->owner, bsec)
459 - bfd_section_alignment (asec->owner, asec));
466 /* Build a Binary Search Tree to sort sections, unlike insertion sort
467 used in wild_sort(). BST is considerably faster if the number of
468 of sections are large. */
470 static lang_section_bst_type **
471 wild_sort_fast (lang_wild_statement_type *wild,
472 struct wildcard_list *sec,
473 lang_input_statement_type *file ATTRIBUTE_UNUSED,
476 lang_section_bst_type **tree;
479 if (!wild->filenames_sorted
480 && (sec == NULL || sec->spec.sorted == none))
482 /* Append at the right end of tree. */
484 tree = &((*tree)->right);
490 /* Find the correct node to append this section. */
491 if (compare_section (sec->spec.sorted, section, (*tree)->section) < 0)
492 tree = &((*tree)->left);
494 tree = &((*tree)->right);
500 /* Use wild_sort_fast to build a BST to sort sections. */
503 output_section_callback_fast (lang_wild_statement_type *ptr,
504 struct wildcard_list *sec,
506 struct flag_info *sflag_list ATTRIBUTE_UNUSED,
507 lang_input_statement_type *file,
510 lang_section_bst_type *node;
511 lang_section_bst_type **tree;
512 lang_output_section_statement_type *os;
514 os = (lang_output_section_statement_type *) output;
516 if (unique_section_p (section, os))
519 node = (lang_section_bst_type *) xmalloc (sizeof (lang_section_bst_type));
522 node->section = section;
524 tree = wild_sort_fast (ptr, sec, file, section);
529 /* Convert a sorted sections' BST back to list form. */
532 output_section_callback_tree_to_list (lang_wild_statement_type *ptr,
533 lang_section_bst_type *tree,
537 output_section_callback_tree_to_list (ptr, tree->left, output);
539 lang_add_section (&ptr->children, tree->section, NULL,
540 (lang_output_section_statement_type *) output);
543 output_section_callback_tree_to_list (ptr, tree->right, output);
548 /* Specialized, optimized routines for handling different kinds of
552 walk_wild_section_specs1_wild0 (lang_wild_statement_type *ptr,
553 lang_input_statement_type *file,
557 /* We can just do a hash lookup for the section with the right name.
558 But if that lookup discovers more than one section with the name
559 (should be rare), we fall back to the general algorithm because
560 we would otherwise have to sort the sections to make sure they
561 get processed in the bfd's order. */
562 bfd_boolean multiple_sections_found;
563 struct wildcard_list *sec0 = ptr->handler_data[0];
564 asection *s0 = find_section (file, sec0, &multiple_sections_found);
566 if (multiple_sections_found)
567 walk_wild_section_general (ptr, file, callback, data);
569 walk_wild_consider_section (ptr, file, s0, sec0, callback, data);
573 walk_wild_section_specs1_wild1 (lang_wild_statement_type *ptr,
574 lang_input_statement_type *file,
579 struct wildcard_list *wildsec0 = ptr->handler_data[0];
581 for (s = file->the_bfd->sections; s != NULL; s = s->next)
583 const char *sname = bfd_get_section_name (file->the_bfd, s);
584 bfd_boolean skip = !match_simple_wild (wildsec0->spec.name, sname);
587 walk_wild_consider_section (ptr, file, s, wildsec0, callback, data);
592 walk_wild_section_specs2_wild1 (lang_wild_statement_type *ptr,
593 lang_input_statement_type *file,
598 struct wildcard_list *sec0 = ptr->handler_data[0];
599 struct wildcard_list *wildsec1 = ptr->handler_data[1];
600 bfd_boolean multiple_sections_found;
601 asection *s0 = find_section (file, sec0, &multiple_sections_found);
603 if (multiple_sections_found)
605 walk_wild_section_general (ptr, file, callback, data);
609 /* Note that if the section was not found, s0 is NULL and
610 we'll simply never succeed the s == s0 test below. */
611 for (s = file->the_bfd->sections; s != NULL; s = s->next)
613 /* Recall that in this code path, a section cannot satisfy more
614 than one spec, so if s == s0 then it cannot match
617 walk_wild_consider_section (ptr, file, s, sec0, callback, data);
620 const char *sname = bfd_get_section_name (file->the_bfd, s);
621 bfd_boolean skip = !match_simple_wild (wildsec1->spec.name, sname);
624 walk_wild_consider_section (ptr, file, s, wildsec1, callback,
631 walk_wild_section_specs3_wild2 (lang_wild_statement_type *ptr,
632 lang_input_statement_type *file,
637 struct wildcard_list *sec0 = ptr->handler_data[0];
638 struct wildcard_list *wildsec1 = ptr->handler_data[1];
639 struct wildcard_list *wildsec2 = ptr->handler_data[2];
640 bfd_boolean multiple_sections_found;
641 asection *s0 = find_section (file, sec0, &multiple_sections_found);
643 if (multiple_sections_found)
645 walk_wild_section_general (ptr, file, callback, data);
649 for (s = file->the_bfd->sections; s != NULL; s = s->next)
652 walk_wild_consider_section (ptr, file, s, sec0, callback, data);
655 const char *sname = bfd_get_section_name (file->the_bfd, s);
656 bfd_boolean skip = !match_simple_wild (wildsec1->spec.name, sname);
659 walk_wild_consider_section (ptr, file, s, wildsec1, callback, data);
662 skip = !match_simple_wild (wildsec2->spec.name, sname);
664 walk_wild_consider_section (ptr, file, s, wildsec2, callback,
672 walk_wild_section_specs4_wild2 (lang_wild_statement_type *ptr,
673 lang_input_statement_type *file,
678 struct wildcard_list *sec0 = ptr->handler_data[0];
679 struct wildcard_list *sec1 = ptr->handler_data[1];
680 struct wildcard_list *wildsec2 = ptr->handler_data[2];
681 struct wildcard_list *wildsec3 = ptr->handler_data[3];
682 bfd_boolean multiple_sections_found;
683 asection *s0 = find_section (file, sec0, &multiple_sections_found), *s1;
685 if (multiple_sections_found)
687 walk_wild_section_general (ptr, file, callback, data);
691 s1 = find_section (file, sec1, &multiple_sections_found);
692 if (multiple_sections_found)
694 walk_wild_section_general (ptr, file, callback, data);
698 for (s = file->the_bfd->sections; s != NULL; s = s->next)
701 walk_wild_consider_section (ptr, file, s, sec0, callback, data);
704 walk_wild_consider_section (ptr, file, s, sec1, callback, data);
707 const char *sname = bfd_get_section_name (file->the_bfd, s);
708 bfd_boolean skip = !match_simple_wild (wildsec2->spec.name,
712 walk_wild_consider_section (ptr, file, s, wildsec2, callback,
716 skip = !match_simple_wild (wildsec3->spec.name, sname);
718 walk_wild_consider_section (ptr, file, s, wildsec3,
726 walk_wild_section (lang_wild_statement_type *ptr,
727 lang_input_statement_type *file,
731 if (file->flags.just_syms)
734 (*ptr->walk_wild_section_handler) (ptr, file, callback, data);
737 /* Returns TRUE when name1 is a wildcard spec that might match
738 something name2 can match. We're conservative: we return FALSE
739 only if the prefixes of name1 and name2 are different up to the
740 first wildcard character. */
743 wild_spec_can_overlap (const char *name1, const char *name2)
745 size_t prefix1_len = strcspn (name1, "?*[");
746 size_t prefix2_len = strcspn (name2, "?*[");
747 size_t min_prefix_len;
749 /* Note that if there is no wildcard character, then we treat the
750 terminating 0 as part of the prefix. Thus ".text" won't match
751 ".text." or ".text.*", for example. */
752 if (name1[prefix1_len] == '\0')
754 if (name2[prefix2_len] == '\0')
757 min_prefix_len = prefix1_len < prefix2_len ? prefix1_len : prefix2_len;
759 return memcmp (name1, name2, min_prefix_len) == 0;
762 /* Select specialized code to handle various kinds of wildcard
766 analyze_walk_wild_section_handler (lang_wild_statement_type *ptr)
769 int wild_name_count = 0;
770 struct wildcard_list *sec;
774 ptr->walk_wild_section_handler = walk_wild_section_general;
775 ptr->handler_data[0] = NULL;
776 ptr->handler_data[1] = NULL;
777 ptr->handler_data[2] = NULL;
778 ptr->handler_data[3] = NULL;
781 /* Count how many wildcard_specs there are, and how many of those
782 actually use wildcards in the name. Also, bail out if any of the
783 wildcard names are NULL. (Can this actually happen?
784 walk_wild_section used to test for it.) And bail out if any
785 of the wildcards are more complex than a simple string
786 ending in a single '*'. */
787 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
790 if (sec->spec.name == NULL)
792 if (wildcardp (sec->spec.name))
795 if (!is_simple_wild (sec->spec.name))
800 /* The zero-spec case would be easy to optimize but it doesn't
801 happen in practice. Likewise, more than 4 specs doesn't
802 happen in practice. */
803 if (sec_count == 0 || sec_count > 4)
806 /* Check that no two specs can match the same section. */
807 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
809 struct wildcard_list *sec2;
810 for (sec2 = sec->next; sec2 != NULL; sec2 = sec2->next)
812 if (wild_spec_can_overlap (sec->spec.name, sec2->spec.name))
817 signature = (sec_count << 8) + wild_name_count;
821 ptr->walk_wild_section_handler = walk_wild_section_specs1_wild0;
824 ptr->walk_wild_section_handler = walk_wild_section_specs1_wild1;
827 ptr->walk_wild_section_handler = walk_wild_section_specs2_wild1;
830 ptr->walk_wild_section_handler = walk_wild_section_specs3_wild2;
833 ptr->walk_wild_section_handler = walk_wild_section_specs4_wild2;
839 /* Now fill the data array with pointers to the specs, first the
840 specs with non-wildcard names, then the specs with wildcard
841 names. It's OK to process the specs in different order from the
842 given order, because we've already determined that no section
843 will match more than one spec. */
845 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
846 if (!wildcardp (sec->spec.name))
847 ptr->handler_data[data_counter++] = sec;
848 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
849 if (wildcardp (sec->spec.name))
850 ptr->handler_data[data_counter++] = sec;
853 /* Handle a wild statement for a single file F. */
856 walk_wild_file (lang_wild_statement_type *s,
857 lang_input_statement_type *f,
861 if (f->the_bfd == NULL
862 || ! bfd_check_format (f->the_bfd, bfd_archive))
863 walk_wild_section (s, f, callback, data);
868 /* This is an archive file. We must map each member of the
869 archive separately. */
870 member = bfd_openr_next_archived_file (f->the_bfd, NULL);
871 while (member != NULL)
873 /* When lookup_name is called, it will call the add_symbols
874 entry point for the archive. For each element of the
875 archive which is included, BFD will call ldlang_add_file,
876 which will set the usrdata field of the member to the
877 lang_input_statement. */
878 if (member->usrdata != NULL)
880 walk_wild_section (s,
881 (lang_input_statement_type *) member->usrdata,
885 member = bfd_openr_next_archived_file (f->the_bfd, member);
891 walk_wild (lang_wild_statement_type *s, callback_t callback, void *data)
893 const char *file_spec = s->filename;
896 if (file_spec == NULL)
898 /* Perform the iteration over all files in the list. */
899 LANG_FOR_EACH_INPUT_STATEMENT (f)
901 walk_wild_file (s, f, callback, data);
904 else if ((p = archive_path (file_spec)) != NULL)
906 LANG_FOR_EACH_INPUT_STATEMENT (f)
908 if (input_statement_is_archive_path (file_spec, p, f))
909 walk_wild_file (s, f, callback, data);
912 else if (wildcardp (file_spec))
914 LANG_FOR_EACH_INPUT_STATEMENT (f)
916 if (fnmatch (file_spec, f->filename, 0) == 0)
917 walk_wild_file (s, f, callback, data);
922 lang_input_statement_type *f;
924 /* Perform the iteration over a single file. */
925 f = lookup_name (file_spec);
927 walk_wild_file (s, f, callback, data);
931 /* lang_for_each_statement walks the parse tree and calls the provided
932 function for each node, except those inside output section statements
933 with constraint set to -1. */
936 lang_for_each_statement_worker (void (*func) (lang_statement_union_type *),
937 lang_statement_union_type *s)
939 for (; s != NULL; s = s->header.next)
943 switch (s->header.type)
945 case lang_constructors_statement_enum:
946 lang_for_each_statement_worker (func, constructor_list.head);
948 case lang_output_section_statement_enum:
949 if (s->output_section_statement.constraint != -1)
950 lang_for_each_statement_worker
951 (func, s->output_section_statement.children.head);
953 case lang_wild_statement_enum:
954 lang_for_each_statement_worker (func,
955 s->wild_statement.children.head);
957 case lang_group_statement_enum:
958 lang_for_each_statement_worker (func,
959 s->group_statement.children.head);
961 case lang_data_statement_enum:
962 case lang_reloc_statement_enum:
963 case lang_object_symbols_statement_enum:
964 case lang_output_statement_enum:
965 case lang_target_statement_enum:
966 case lang_input_section_enum:
967 case lang_input_statement_enum:
968 case lang_assignment_statement_enum:
969 case lang_padding_statement_enum:
970 case lang_address_statement_enum:
971 case lang_fill_statement_enum:
972 case lang_insert_statement_enum:
982 lang_for_each_statement (void (*func) (lang_statement_union_type *))
984 lang_for_each_statement_worker (func, statement_list.head);
987 /*----------------------------------------------------------------------*/
990 lang_list_init (lang_statement_list_type *list)
993 list->tail = &list->head;
997 push_stat_ptr (lang_statement_list_type *new_ptr)
999 if (stat_save_ptr >= stat_save + sizeof (stat_save) / sizeof (stat_save[0]))
1001 *stat_save_ptr++ = stat_ptr;
1008 if (stat_save_ptr <= stat_save)
1010 stat_ptr = *--stat_save_ptr;
1013 /* Build a new statement node for the parse tree. */
1015 static lang_statement_union_type *
1016 new_statement (enum statement_enum type,
1018 lang_statement_list_type *list)
1020 lang_statement_union_type *new_stmt;
1022 new_stmt = (lang_statement_union_type *) stat_alloc (size);
1023 new_stmt->header.type = type;
1024 new_stmt->header.next = NULL;
1025 lang_statement_append (list, new_stmt, &new_stmt->header.next);
1029 /* Build a new input file node for the language. There are several
1030 ways in which we treat an input file, eg, we only look at symbols,
1031 or prefix it with a -l etc.
1033 We can be supplied with requests for input files more than once;
1034 they may, for example be split over several lines like foo.o(.text)
1035 foo.o(.data) etc, so when asked for a file we check that we haven't
1036 got it already so we don't duplicate the bfd. */
1038 static lang_input_statement_type *
1039 new_afile (const char *name,
1040 lang_input_file_enum_type file_type,
1042 bfd_boolean add_to_list)
1044 lang_input_statement_type *p;
1046 lang_has_input_file = TRUE;
1049 p = (lang_input_statement_type *) new_stat (lang_input_statement, stat_ptr);
1052 p = (lang_input_statement_type *)
1053 stat_alloc (sizeof (lang_input_statement_type));
1054 p->header.type = lang_input_statement_enum;
1055 p->header.next = NULL;
1058 memset (&p->the_bfd, 0,
1059 sizeof (*p) - offsetof (lang_input_statement_type, the_bfd));
1061 p->flags.dynamic = input_flags.dynamic;
1062 p->flags.add_DT_NEEDED_for_dynamic = input_flags.add_DT_NEEDED_for_dynamic;
1063 p->flags.add_DT_NEEDED_for_regular = input_flags.add_DT_NEEDED_for_regular;
1064 p->flags.whole_archive = input_flags.whole_archive;
1065 p->flags.sysrooted = input_flags.sysrooted;
1067 if (file_type == lang_input_file_is_l_enum
1068 && name[0] == ':' && name[1] != '\0')
1070 file_type = lang_input_file_is_search_file_enum;
1076 case lang_input_file_is_symbols_only_enum:
1078 p->local_sym_name = name;
1079 p->flags.real = TRUE;
1080 p->flags.just_syms = TRUE;
1082 case lang_input_file_is_fake_enum:
1084 p->local_sym_name = name;
1086 case lang_input_file_is_l_enum:
1088 p->local_sym_name = concat ("-l", name, (const char *) NULL);
1089 p->flags.maybe_archive = TRUE;
1090 p->flags.real = TRUE;
1091 p->flags.search_dirs = TRUE;
1093 case lang_input_file_is_marker_enum:
1095 p->local_sym_name = name;
1096 p->flags.search_dirs = TRUE;
1098 case lang_input_file_is_search_file_enum:
1100 p->local_sym_name = name;
1101 p->flags.real = TRUE;
1102 p->flags.search_dirs = TRUE;
1104 case lang_input_file_is_file_enum:
1106 p->local_sym_name = name;
1107 p->flags.real = TRUE;
1113 lang_statement_append (&input_file_chain,
1114 (lang_statement_union_type *) p,
1115 &p->next_real_file);
1119 lang_input_statement_type *
1120 lang_add_input_file (const char *name,
1121 lang_input_file_enum_type file_type,
1124 return new_afile (name, file_type, target, TRUE);
1127 struct out_section_hash_entry
1129 struct bfd_hash_entry root;
1130 lang_statement_union_type s;
1133 /* The hash table. */
1135 static struct bfd_hash_table output_section_statement_table;
1137 /* Support routines for the hash table used by lang_output_section_find,
1138 initialize the table, fill in an entry and remove the table. */
1140 static struct bfd_hash_entry *
1141 output_section_statement_newfunc (struct bfd_hash_entry *entry,
1142 struct bfd_hash_table *table,
1145 lang_output_section_statement_type **nextp;
1146 struct out_section_hash_entry *ret;
1150 entry = (struct bfd_hash_entry *) bfd_hash_allocate (table,
1156 entry = bfd_hash_newfunc (entry, table, string);
1160 ret = (struct out_section_hash_entry *) entry;
1161 memset (&ret->s, 0, sizeof (ret->s));
1162 ret->s.header.type = lang_output_section_statement_enum;
1163 ret->s.output_section_statement.subsection_alignment = -1;
1164 ret->s.output_section_statement.section_alignment = -1;
1165 ret->s.output_section_statement.block_value = 1;
1166 lang_list_init (&ret->s.output_section_statement.children);
1167 lang_statement_append (stat_ptr, &ret->s, &ret->s.header.next);
1169 /* For every output section statement added to the list, except the
1170 first one, lang_output_section_statement.tail points to the "next"
1171 field of the last element of the list. */
1172 if (lang_output_section_statement.head != NULL)
1173 ret->s.output_section_statement.prev
1174 = ((lang_output_section_statement_type *)
1175 ((char *) lang_output_section_statement.tail
1176 - offsetof (lang_output_section_statement_type, next)));
1178 /* GCC's strict aliasing rules prevent us from just casting the
1179 address, so we store the pointer in a variable and cast that
1181 nextp = &ret->s.output_section_statement.next;
1182 lang_statement_append (&lang_output_section_statement,
1184 (lang_statement_union_type **) nextp);
1189 output_section_statement_table_init (void)
1191 if (!bfd_hash_table_init_n (&output_section_statement_table,
1192 output_section_statement_newfunc,
1193 sizeof (struct out_section_hash_entry),
1195 einfo (_("%P%F: can not create hash table: %E\n"));
1199 output_section_statement_table_free (void)
1201 bfd_hash_table_free (&output_section_statement_table);
1204 /* Build enough state so that the parser can build its tree. */
1209 obstack_begin (&stat_obstack, 1000);
1211 stat_ptr = &statement_list;
1213 output_section_statement_table_init ();
1215 lang_list_init (stat_ptr);
1217 lang_list_init (&input_file_chain);
1218 lang_list_init (&lang_output_section_statement);
1219 lang_list_init (&file_chain);
1220 first_file = lang_add_input_file (NULL, lang_input_file_is_marker_enum,
1222 abs_output_section =
1223 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME, 0, TRUE);
1225 abs_output_section->bfd_section = bfd_abs_section_ptr;
1227 /* The value "3" is ad-hoc, somewhat related to the expected number of
1228 DEFINED expressions in a linker script. For most default linker
1229 scripts, there are none. Why a hash table then? Well, it's somewhat
1230 simpler to re-use working machinery than using a linked list in terms
1231 of code-complexity here in ld, besides the initialization which just
1232 looks like other code here. */
1233 if (!bfd_hash_table_init_n (&lang_definedness_table,
1234 lang_definedness_newfunc,
1235 sizeof (struct lang_definedness_hash_entry),
1237 einfo (_("%P%F: can not create hash table: %E\n"));
1243 output_section_statement_table_free ();
1246 /*----------------------------------------------------------------------
1247 A region is an area of memory declared with the
1248 MEMORY { name:org=exp, len=exp ... }
1251 We maintain a list of all the regions here.
1253 If no regions are specified in the script, then the default is used
1254 which is created when looked up to be the entire data space.
1256 If create is true we are creating a region inside a MEMORY block.
1257 In this case it is probably an error to create a region that has
1258 already been created. If we are not inside a MEMORY block it is
1259 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1260 and so we issue a warning.
1262 Each region has at least one name. The first name is either
1263 DEFAULT_MEMORY_REGION or the name given in the MEMORY block. You can add
1264 alias names to an existing region within a script with
1265 REGION_ALIAS (alias, region_name). Each name corresponds to at most one
1268 static lang_memory_region_type *lang_memory_region_list;
1269 static lang_memory_region_type **lang_memory_region_list_tail
1270 = &lang_memory_region_list;
1272 lang_memory_region_type *
1273 lang_memory_region_lookup (const char *const name, bfd_boolean create)
1275 lang_memory_region_name *n;
1276 lang_memory_region_type *r;
1277 lang_memory_region_type *new_region;
1279 /* NAME is NULL for LMA memspecs if no region was specified. */
1283 for (r = lang_memory_region_list; r != NULL; r = r->next)
1284 for (n = &r->name_list; n != NULL; n = n->next)
1285 if (strcmp (n->name, name) == 0)
1288 einfo (_("%P:%S: warning: redeclaration of memory region `%s'\n"),
1293 if (!create && strcmp (name, DEFAULT_MEMORY_REGION))
1294 einfo (_("%P:%S: warning: memory region `%s' not declared\n"),
1297 new_region = (lang_memory_region_type *)
1298 stat_alloc (sizeof (lang_memory_region_type));
1300 new_region->name_list.name = xstrdup (name);
1301 new_region->name_list.next = NULL;
1302 new_region->next = NULL;
1303 new_region->origin = 0;
1304 new_region->length = ~(bfd_size_type) 0;
1305 new_region->current = 0;
1306 new_region->last_os = NULL;
1307 new_region->flags = 0;
1308 new_region->not_flags = 0;
1309 new_region->had_full_message = FALSE;
1311 *lang_memory_region_list_tail = new_region;
1312 lang_memory_region_list_tail = &new_region->next;
1318 lang_memory_region_alias (const char * alias, const char * region_name)
1320 lang_memory_region_name * n;
1321 lang_memory_region_type * r;
1322 lang_memory_region_type * region;
1324 /* The default region must be unique. This ensures that it is not necessary
1325 to iterate through the name list if someone wants the check if a region is
1326 the default memory region. */
1327 if (strcmp (region_name, DEFAULT_MEMORY_REGION) == 0
1328 || strcmp (alias, DEFAULT_MEMORY_REGION) == 0)
1329 einfo (_("%F%P:%S: error: alias for default memory region\n"), NULL);
1331 /* Look for the target region and check if the alias is not already
1334 for (r = lang_memory_region_list; r != NULL; r = r->next)
1335 for (n = &r->name_list; n != NULL; n = n->next)
1337 if (region == NULL && strcmp (n->name, region_name) == 0)
1339 if (strcmp (n->name, alias) == 0)
1340 einfo (_("%F%P:%S: error: redefinition of memory region "
1345 /* Check if the target region exists. */
1347 einfo (_("%F%P:%S: error: memory region `%s' "
1348 "for alias `%s' does not exist\n"),
1349 NULL, region_name, alias);
1351 /* Add alias to region name list. */
1352 n = (lang_memory_region_name *) stat_alloc (sizeof (lang_memory_region_name));
1353 n->name = xstrdup (alias);
1354 n->next = region->name_list.next;
1355 region->name_list.next = n;
1358 static lang_memory_region_type *
1359 lang_memory_default (asection * section)
1361 lang_memory_region_type *p;
1363 flagword sec_flags = section->flags;
1365 /* Override SEC_DATA to mean a writable section. */
1366 if ((sec_flags & (SEC_ALLOC | SEC_READONLY | SEC_CODE)) == SEC_ALLOC)
1367 sec_flags |= SEC_DATA;
1369 for (p = lang_memory_region_list; p != NULL; p = p->next)
1371 if ((p->flags & sec_flags) != 0
1372 && (p->not_flags & sec_flags) == 0)
1377 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION, FALSE);
1380 /* Find or create an output_section_statement with the given NAME.
1381 If CONSTRAINT is non-zero match one with that constraint, otherwise
1382 match any non-negative constraint. If CREATE, always make a
1383 new output_section_statement for SPECIAL CONSTRAINT. */
1385 lang_output_section_statement_type *
1386 lang_output_section_statement_lookup (const char *name,
1390 struct out_section_hash_entry *entry;
1392 entry = ((struct out_section_hash_entry *)
1393 bfd_hash_lookup (&output_section_statement_table, name,
1398 einfo (_("%P%F: failed creating section `%s': %E\n"), name);
1402 if (entry->s.output_section_statement.name != NULL)
1404 /* We have a section of this name, but it might not have the correct
1406 struct out_section_hash_entry *last_ent;
1408 name = entry->s.output_section_statement.name;
1409 if (create && constraint == SPECIAL)
1410 /* Not traversing to the end reverses the order of the second
1411 and subsequent SPECIAL sections in the hash table chain,
1412 but that shouldn't matter. */
1417 if (constraint == entry->s.output_section_statement.constraint
1419 && entry->s.output_section_statement.constraint >= 0))
1420 return &entry->s.output_section_statement;
1422 entry = (struct out_section_hash_entry *) entry->root.next;
1424 while (entry != NULL
1425 && name == entry->s.output_section_statement.name);
1431 = ((struct out_section_hash_entry *)
1432 output_section_statement_newfunc (NULL,
1433 &output_section_statement_table,
1437 einfo (_("%P%F: failed creating section `%s': %E\n"), name);
1440 entry->root = last_ent->root;
1441 last_ent->root.next = &entry->root;
1444 entry->s.output_section_statement.name = name;
1445 entry->s.output_section_statement.constraint = constraint;
1446 return &entry->s.output_section_statement;
1449 /* Find the next output_section_statement with the same name as OS.
1450 If CONSTRAINT is non-zero, find one with that constraint otherwise
1451 match any non-negative constraint. */
1453 lang_output_section_statement_type *
1454 next_matching_output_section_statement (lang_output_section_statement_type *os,
1457 /* All output_section_statements are actually part of a
1458 struct out_section_hash_entry. */
1459 struct out_section_hash_entry *entry = (struct out_section_hash_entry *)
1461 - offsetof (struct out_section_hash_entry, s.output_section_statement));
1462 const char *name = os->name;
1464 ASSERT (name == entry->root.string);
1467 entry = (struct out_section_hash_entry *) entry->root.next;
1469 || name != entry->s.output_section_statement.name)
1472 while (constraint != entry->s.output_section_statement.constraint
1474 || entry->s.output_section_statement.constraint < 0));
1476 return &entry->s.output_section_statement;
1479 /* A variant of lang_output_section_find used by place_orphan.
1480 Returns the output statement that should precede a new output
1481 statement for SEC. If an exact match is found on certain flags,
1484 lang_output_section_statement_type *
1485 lang_output_section_find_by_flags (const asection *sec,
1486 lang_output_section_statement_type **exact,
1487 lang_match_sec_type_func match_type)
1489 lang_output_section_statement_type *first, *look, *found;
1492 /* We know the first statement on this list is *ABS*. May as well
1494 first = &lang_output_section_statement.head->output_section_statement;
1495 first = first->next;
1497 /* First try for an exact match. */
1499 for (look = first; look; look = look->next)
1501 flags = look->flags;
1502 if (look->bfd_section != NULL)
1504 flags = look->bfd_section->flags;
1505 if (match_type && !match_type (link_info.output_bfd,
1510 flags ^= sec->flags;
1511 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD | SEC_READONLY
1512 | SEC_CODE | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1522 if ((sec->flags & SEC_CODE) != 0
1523 && (sec->flags & SEC_ALLOC) != 0)
1525 /* Try for a rw code section. */
1526 for (look = first; look; look = look->next)
1528 flags = look->flags;
1529 if (look->bfd_section != NULL)
1531 flags = look->bfd_section->flags;
1532 if (match_type && !match_type (link_info.output_bfd,
1537 flags ^= sec->flags;
1538 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1539 | SEC_CODE | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1543 else if ((sec->flags & (SEC_READONLY | SEC_THREAD_LOCAL)) != 0
1544 && (sec->flags & SEC_ALLOC) != 0)
1546 /* .rodata can go after .text, .sdata2 after .rodata. */
1547 for (look = first; look; look = look->next)
1549 flags = look->flags;
1550 if (look->bfd_section != NULL)
1552 flags = look->bfd_section->flags;
1553 if (match_type && !match_type (link_info.output_bfd,
1558 flags ^= sec->flags;
1559 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1560 | SEC_READONLY | SEC_SMALL_DATA))
1561 || (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1563 && !(look->flags & SEC_SMALL_DATA))
1564 || (!(flags & (SEC_THREAD_LOCAL | SEC_ALLOC))
1565 && (look->flags & SEC_THREAD_LOCAL)
1566 && (!(flags & SEC_LOAD)
1567 || (look->flags & SEC_LOAD))))
1571 else if ((sec->flags & SEC_SMALL_DATA) != 0
1572 && (sec->flags & SEC_ALLOC) != 0)
1574 /* .sdata goes after .data, .sbss after .sdata. */
1575 for (look = first; look; look = look->next)
1577 flags = look->flags;
1578 if (look->bfd_section != NULL)
1580 flags = look->bfd_section->flags;
1581 if (match_type && !match_type (link_info.output_bfd,
1586 flags ^= sec->flags;
1587 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1588 | SEC_THREAD_LOCAL))
1589 || ((look->flags & SEC_SMALL_DATA)
1590 && !(sec->flags & SEC_HAS_CONTENTS)))
1594 else if ((sec->flags & SEC_HAS_CONTENTS) != 0
1595 && (sec->flags & SEC_ALLOC) != 0)
1597 /* .data goes after .rodata. */
1598 for (look = first; look; look = look->next)
1600 flags = look->flags;
1601 if (look->bfd_section != NULL)
1603 flags = look->bfd_section->flags;
1604 if (match_type && !match_type (link_info.output_bfd,
1609 flags ^= sec->flags;
1610 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1611 | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1615 else if ((sec->flags & SEC_ALLOC) != 0)
1617 /* .bss goes after any other alloc section. */
1618 for (look = first; look; look = look->next)
1620 flags = look->flags;
1621 if (look->bfd_section != NULL)
1623 flags = look->bfd_section->flags;
1624 if (match_type && !match_type (link_info.output_bfd,
1629 flags ^= sec->flags;
1630 if (!(flags & SEC_ALLOC))
1636 /* non-alloc go last. */
1637 for (look = first; look; look = look->next)
1639 flags = look->flags;
1640 if (look->bfd_section != NULL)
1641 flags = look->bfd_section->flags;
1642 flags ^= sec->flags;
1643 if (!(flags & SEC_DEBUGGING))
1649 if (found || !match_type)
1652 return lang_output_section_find_by_flags (sec, NULL, NULL);
1655 /* Find the last output section before given output statement.
1656 Used by place_orphan. */
1659 output_prev_sec_find (lang_output_section_statement_type *os)
1661 lang_output_section_statement_type *lookup;
1663 for (lookup = os->prev; lookup != NULL; lookup = lookup->prev)
1665 if (lookup->constraint < 0)
1668 if (lookup->bfd_section != NULL && lookup->bfd_section->owner != NULL)
1669 return lookup->bfd_section;
1675 /* Look for a suitable place for a new output section statement. The
1676 idea is to skip over anything that might be inside a SECTIONS {}
1677 statement in a script, before we find another output section
1678 statement. Assignments to "dot" before an output section statement
1679 are assumed to belong to it, except in two cases; The first
1680 assignment to dot, and assignments before non-alloc sections.
1681 Otherwise we might put an orphan before . = . + SIZEOF_HEADERS or
1682 similar assignments that set the initial address, or we might
1683 insert non-alloc note sections among assignments setting end of
1686 static lang_statement_union_type **
1687 insert_os_after (lang_output_section_statement_type *after)
1689 lang_statement_union_type **where;
1690 lang_statement_union_type **assign = NULL;
1691 bfd_boolean ignore_first;
1694 = after == &lang_output_section_statement.head->output_section_statement;
1696 for (where = &after->header.next;
1698 where = &(*where)->header.next)
1700 switch ((*where)->header.type)
1702 case lang_assignment_statement_enum:
1705 lang_assignment_statement_type *ass;
1707 ass = &(*where)->assignment_statement;
1708 if (ass->exp->type.node_class != etree_assert
1709 && ass->exp->assign.dst[0] == '.'
1710 && ass->exp->assign.dst[1] == 0
1714 ignore_first = FALSE;
1716 case lang_wild_statement_enum:
1717 case lang_input_section_enum:
1718 case lang_object_symbols_statement_enum:
1719 case lang_fill_statement_enum:
1720 case lang_data_statement_enum:
1721 case lang_reloc_statement_enum:
1722 case lang_padding_statement_enum:
1723 case lang_constructors_statement_enum:
1726 case lang_output_section_statement_enum:
1729 asection *s = (*where)->output_section_statement.bfd_section;
1732 || s->map_head.s == NULL
1733 || (s->flags & SEC_ALLOC) != 0)
1737 case lang_input_statement_enum:
1738 case lang_address_statement_enum:
1739 case lang_target_statement_enum:
1740 case lang_output_statement_enum:
1741 case lang_group_statement_enum:
1742 case lang_insert_statement_enum:
1751 lang_output_section_statement_type *
1752 lang_insert_orphan (asection *s,
1753 const char *secname,
1755 lang_output_section_statement_type *after,
1756 struct orphan_save *place,
1757 etree_type *address,
1758 lang_statement_list_type *add_child)
1760 lang_statement_list_type add;
1762 lang_output_section_statement_type *os;
1763 lang_output_section_statement_type **os_tail;
1765 /* If we have found an appropriate place for the output section
1766 statements for this orphan, add them to our own private list,
1767 inserting them later into the global statement list. */
1770 lang_list_init (&add);
1771 push_stat_ptr (&add);
1774 if (link_info.relocatable || (s->flags & (SEC_LOAD | SEC_ALLOC)) == 0)
1775 address = exp_intop (0);
1777 os_tail = ((lang_output_section_statement_type **)
1778 lang_output_section_statement.tail);
1779 os = lang_enter_output_section_statement (secname, address, normal_section,
1780 NULL, NULL, NULL, constraint);
1783 if (config.build_constructors && *os_tail == os)
1785 /* If the name of the section is representable in C, then create
1786 symbols to mark the start and the end of the section. */
1787 for (ps = secname; *ps != '\0'; ps++)
1788 if (! ISALNUM ((unsigned char) *ps) && *ps != '_')
1794 symname = (char *) xmalloc (ps - secname + sizeof "__start_" + 1);
1795 symname[0] = bfd_get_symbol_leading_char (link_info.output_bfd);
1796 sprintf (symname + (symname[0] != 0), "__start_%s", secname);
1797 lang_add_assignment (exp_provide (symname,
1798 exp_nameop (NAME, "."),
1803 if (add_child == NULL)
1804 add_child = &os->children;
1805 lang_add_section (add_child, s, NULL, os);
1807 if (after && (s->flags & (SEC_LOAD | SEC_ALLOC)) != 0)
1809 const char *region = (after->region
1810 ? after->region->name_list.name
1811 : DEFAULT_MEMORY_REGION);
1812 const char *lma_region = (after->lma_region
1813 ? after->lma_region->name_list.name
1815 lang_leave_output_section_statement (NULL, region, after->phdrs,
1819 lang_leave_output_section_statement (NULL, DEFAULT_MEMORY_REGION, NULL,
1822 if (ps != NULL && *ps == '\0')
1826 symname = (char *) xmalloc (ps - secname + sizeof "__stop_" + 1);
1827 symname[0] = bfd_get_symbol_leading_char (link_info.output_bfd);
1828 sprintf (symname + (symname[0] != 0), "__stop_%s", secname);
1829 lang_add_assignment (exp_provide (symname,
1830 exp_nameop (NAME, "."),
1834 /* Restore the global list pointer. */
1838 if (after != NULL && os->bfd_section != NULL)
1840 asection *snew, *as;
1842 snew = os->bfd_section;
1844 /* Shuffle the bfd section list to make the output file look
1845 neater. This is really only cosmetic. */
1846 if (place->section == NULL
1847 && after != (&lang_output_section_statement.head
1848 ->output_section_statement))
1850 asection *bfd_section = after->bfd_section;
1852 /* If the output statement hasn't been used to place any input
1853 sections (and thus doesn't have an output bfd_section),
1854 look for the closest prior output statement having an
1856 if (bfd_section == NULL)
1857 bfd_section = output_prev_sec_find (after);
1859 if (bfd_section != NULL && bfd_section != snew)
1860 place->section = &bfd_section->next;
1863 if (place->section == NULL)
1864 place->section = &link_info.output_bfd->sections;
1866 as = *place->section;
1870 /* Put the section at the end of the list. */
1872 /* Unlink the section. */
1873 bfd_section_list_remove (link_info.output_bfd, snew);
1875 /* Now tack it back on in the right place. */
1876 bfd_section_list_append (link_info.output_bfd, snew);
1878 else if (as != snew && as->prev != snew)
1880 /* Unlink the section. */
1881 bfd_section_list_remove (link_info.output_bfd, snew);
1883 /* Now tack it back on in the right place. */
1884 bfd_section_list_insert_before (link_info.output_bfd, as, snew);
1887 /* Save the end of this list. Further ophans of this type will
1888 follow the one we've just added. */
1889 place->section = &snew->next;
1891 /* The following is non-cosmetic. We try to put the output
1892 statements in some sort of reasonable order here, because they
1893 determine the final load addresses of the orphan sections.
1894 In addition, placing output statements in the wrong order may
1895 require extra segments. For instance, given a typical
1896 situation of all read-only sections placed in one segment and
1897 following that a segment containing all the read-write
1898 sections, we wouldn't want to place an orphan read/write
1899 section before or amongst the read-only ones. */
1900 if (add.head != NULL)
1902 lang_output_section_statement_type *newly_added_os;
1904 if (place->stmt == NULL)
1906 lang_statement_union_type **where = insert_os_after (after);
1911 place->os_tail = &after->next;
1915 /* Put it after the last orphan statement we added. */
1916 *add.tail = *place->stmt;
1917 *place->stmt = add.head;
1920 /* Fix the global list pointer if we happened to tack our
1921 new list at the tail. */
1922 if (*stat_ptr->tail == add.head)
1923 stat_ptr->tail = add.tail;
1925 /* Save the end of this list. */
1926 place->stmt = add.tail;
1928 /* Do the same for the list of output section statements. */
1929 newly_added_os = *os_tail;
1931 newly_added_os->prev = (lang_output_section_statement_type *)
1932 ((char *) place->os_tail
1933 - offsetof (lang_output_section_statement_type, next));
1934 newly_added_os->next = *place->os_tail;
1935 if (newly_added_os->next != NULL)
1936 newly_added_os->next->prev = newly_added_os;
1937 *place->os_tail = newly_added_os;
1938 place->os_tail = &newly_added_os->next;
1940 /* Fixing the global list pointer here is a little different.
1941 We added to the list in lang_enter_output_section_statement,
1942 trimmed off the new output_section_statment above when
1943 assigning *os_tail = NULL, but possibly added it back in
1944 the same place when assigning *place->os_tail. */
1945 if (*os_tail == NULL)
1946 lang_output_section_statement.tail
1947 = (lang_statement_union_type **) os_tail;
1954 lang_map_flags (flagword flag)
1956 if (flag & SEC_ALLOC)
1959 if (flag & SEC_CODE)
1962 if (flag & SEC_READONLY)
1965 if (flag & SEC_DATA)
1968 if (flag & SEC_LOAD)
1975 lang_memory_region_type *m;
1976 bfd_boolean dis_header_printed = FALSE;
1979 LANG_FOR_EACH_INPUT_STATEMENT (file)
1983 if ((file->the_bfd->flags & (BFD_LINKER_CREATED | DYNAMIC)) != 0
1984 || file->flags.just_syms)
1987 for (s = file->the_bfd->sections; s != NULL; s = s->next)
1988 if ((s->output_section == NULL
1989 || s->output_section->owner != link_info.output_bfd)
1990 && (s->flags & (SEC_LINKER_CREATED | SEC_KEEP)) == 0)
1992 if (! dis_header_printed)
1994 fprintf (config.map_file, _("\nDiscarded input sections\n\n"));
1995 dis_header_printed = TRUE;
1998 print_input_section (s, TRUE);
2002 minfo (_("\nMemory Configuration\n\n"));
2003 fprintf (config.map_file, "%-16s %-18s %-18s %s\n",
2004 _("Name"), _("Origin"), _("Length"), _("Attributes"));
2006 for (m = lang_memory_region_list; m != NULL; m = m->next)
2011 fprintf (config.map_file, "%-16s ", m->name_list.name);
2013 sprintf_vma (buf, m->origin);
2014 minfo ("0x%s ", buf);
2022 minfo ("0x%V", m->length);
2023 if (m->flags || m->not_flags)
2031 lang_map_flags (m->flags);
2037 lang_map_flags (m->not_flags);
2044 fprintf (config.map_file, _("\nLinker script and memory map\n\n"));
2046 if (! link_info.reduce_memory_overheads)
2048 obstack_begin (&map_obstack, 1000);
2049 for (p = link_info.input_bfds; p != (bfd *) NULL; p = p->link_next)
2050 bfd_map_over_sections (p, init_map_userdata, 0);
2051 bfd_link_hash_traverse (link_info.hash, sort_def_symbol, 0);
2053 lang_statement_iteration ++;
2054 print_statements ();
2058 init_map_userdata (bfd *abfd ATTRIBUTE_UNUSED,
2060 void *data ATTRIBUTE_UNUSED)
2062 fat_section_userdata_type *new_data
2063 = ((fat_section_userdata_type *) (stat_alloc
2064 (sizeof (fat_section_userdata_type))));
2066 ASSERT (get_userdata (sec) == NULL);
2067 get_userdata (sec) = new_data;
2068 new_data->map_symbol_def_tail = &new_data->map_symbol_def_head;
2069 new_data->map_symbol_def_count = 0;
2073 sort_def_symbol (struct bfd_link_hash_entry *hash_entry,
2074 void *info ATTRIBUTE_UNUSED)
2076 if (hash_entry->type == bfd_link_hash_defined
2077 || hash_entry->type == bfd_link_hash_defweak)
2079 struct fat_user_section_struct *ud;
2080 struct map_symbol_def *def;
2082 ud = (struct fat_user_section_struct *)
2083 get_userdata (hash_entry->u.def.section);
2086 /* ??? What do we have to do to initialize this beforehand? */
2087 /* The first time we get here is bfd_abs_section... */
2088 init_map_userdata (0, hash_entry->u.def.section, 0);
2089 ud = (struct fat_user_section_struct *)
2090 get_userdata (hash_entry->u.def.section);
2092 else if (!ud->map_symbol_def_tail)
2093 ud->map_symbol_def_tail = &ud->map_symbol_def_head;
2095 def = (struct map_symbol_def *) obstack_alloc (&map_obstack, sizeof *def);
2096 def->entry = hash_entry;
2097 *(ud->map_symbol_def_tail) = def;
2098 ud->map_symbol_def_tail = &def->next;
2099 ud->map_symbol_def_count++;
2104 /* Initialize an output section. */
2107 init_os (lang_output_section_statement_type *s, flagword flags)
2109 if (strcmp (s->name, DISCARD_SECTION_NAME) == 0)
2110 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME);
2112 if (s->constraint != SPECIAL)
2113 s->bfd_section = bfd_get_section_by_name (link_info.output_bfd, s->name);
2114 if (s->bfd_section == NULL)
2115 s->bfd_section = bfd_make_section_anyway_with_flags (link_info.output_bfd,
2117 if (s->bfd_section == NULL)
2119 einfo (_("%P%F: output format %s cannot represent section called %s\n"),
2120 link_info.output_bfd->xvec->name, s->name);
2122 s->bfd_section->output_section = s->bfd_section;
2123 s->bfd_section->output_offset = 0;
2125 if (!link_info.reduce_memory_overheads)
2127 fat_section_userdata_type *new_userdata = (fat_section_userdata_type *)
2128 stat_alloc (sizeof (fat_section_userdata_type));
2129 memset (new_userdata, 0, sizeof (fat_section_userdata_type));
2130 get_userdata (s->bfd_section) = new_userdata;
2133 /* If there is a base address, make sure that any sections it might
2134 mention are initialized. */
2135 if (s->addr_tree != NULL)
2136 exp_init_os (s->addr_tree);
2138 if (s->load_base != NULL)
2139 exp_init_os (s->load_base);
2141 /* If supplied an alignment, set it. */
2142 if (s->section_alignment != -1)
2143 s->bfd_section->alignment_power = s->section_alignment;
2146 /* Make sure that all output sections mentioned in an expression are
2150 exp_init_os (etree_type *exp)
2152 switch (exp->type.node_class)
2156 exp_init_os (exp->assign.src);
2160 exp_init_os (exp->binary.lhs);
2161 exp_init_os (exp->binary.rhs);
2165 exp_init_os (exp->trinary.cond);
2166 exp_init_os (exp->trinary.lhs);
2167 exp_init_os (exp->trinary.rhs);
2171 exp_init_os (exp->assert_s.child);
2175 exp_init_os (exp->unary.child);
2179 switch (exp->type.node_code)
2185 lang_output_section_statement_type *os;
2187 os = lang_output_section_find (exp->name.name);
2188 if (os != NULL && os->bfd_section == NULL)
2200 section_already_linked (bfd *abfd, asection *sec, void *data)
2202 lang_input_statement_type *entry = (lang_input_statement_type *) data;
2204 /* If we are only reading symbols from this object, then we want to
2205 discard all sections. */
2206 if (entry->flags.just_syms)
2208 bfd_link_just_syms (abfd, sec, &link_info);
2212 if (!(abfd->flags & DYNAMIC))
2213 bfd_section_already_linked (abfd, sec, &link_info);
2216 /* The wild routines.
2218 These expand statements like *(.text) and foo.o to a list of
2219 explicit actions, like foo.o(.text), bar.o(.text) and
2220 foo.o(.text, .data). */
2222 /* Add SECTION to the output section OUTPUT. Do this by creating a
2223 lang_input_section statement which is placed at PTR. */
2226 lang_add_section (lang_statement_list_type *ptr,
2228 struct flag_info *sflag_info,
2229 lang_output_section_statement_type *output)
2231 flagword flags = section->flags;
2233 bfd_boolean discard;
2234 lang_input_section_type *new_section;
2235 bfd *abfd = link_info.output_bfd;
2237 /* Discard sections marked with SEC_EXCLUDE. */
2238 discard = (flags & SEC_EXCLUDE) != 0;
2240 /* Discard input sections which are assigned to a section named
2241 DISCARD_SECTION_NAME. */
2242 if (strcmp (output->name, DISCARD_SECTION_NAME) == 0)
2245 /* Discard debugging sections if we are stripping debugging
2247 if ((link_info.strip == strip_debugger || link_info.strip == strip_all)
2248 && (flags & SEC_DEBUGGING) != 0)
2253 if (section->output_section == NULL)
2255 /* This prevents future calls from assigning this section. */
2256 section->output_section = bfd_abs_section_ptr;
2265 keep = bfd_lookup_section_flags (&link_info, sflag_info, section);
2270 if (section->output_section != NULL)
2273 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2274 to an output section, because we want to be able to include a
2275 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2276 section (I don't know why we want to do this, but we do).
2277 build_link_order in ldwrite.c handles this case by turning
2278 the embedded SEC_NEVER_LOAD section into a fill. */
2279 flags &= ~ SEC_NEVER_LOAD;
2281 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2282 already been processed. One reason to do this is that on pe
2283 format targets, .text$foo sections go into .text and it's odd
2284 to see .text with SEC_LINK_ONCE set. */
2286 if (!link_info.relocatable)
2287 flags &= ~(SEC_LINK_ONCE | SEC_LINK_DUPLICATES | SEC_RELOC);
2289 switch (output->sectype)
2291 case normal_section:
2292 case overlay_section:
2294 case noalloc_section:
2295 flags &= ~SEC_ALLOC;
2297 case noload_section:
2299 flags |= SEC_NEVER_LOAD;
2300 /* Unfortunately GNU ld has managed to evolve two different
2301 meanings to NOLOAD in scripts. ELF gets a .bss style noload,
2302 alloc, no contents section. All others get a noload, noalloc
2304 if (bfd_get_flavour (link_info.output_bfd) == bfd_target_elf_flavour)
2305 flags &= ~SEC_HAS_CONTENTS;
2307 flags &= ~SEC_ALLOC;
2311 if (output->bfd_section == NULL)
2312 init_os (output, flags);
2314 /* If SEC_READONLY is not set in the input section, then clear
2315 it from the output section. */
2316 output->bfd_section->flags &= flags | ~SEC_READONLY;
2318 if (output->bfd_section->linker_has_input)
2320 /* Only set SEC_READONLY flag on the first input section. */
2321 flags &= ~ SEC_READONLY;
2323 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2324 if ((output->bfd_section->flags & (SEC_MERGE | SEC_STRINGS))
2325 != (flags & (SEC_MERGE | SEC_STRINGS))
2326 || ((flags & SEC_MERGE) != 0
2327 && output->bfd_section->entsize != section->entsize))
2329 output->bfd_section->flags &= ~ (SEC_MERGE | SEC_STRINGS);
2330 flags &= ~ (SEC_MERGE | SEC_STRINGS);
2333 output->bfd_section->flags |= flags;
2335 if (!output->bfd_section->linker_has_input)
2337 output->bfd_section->linker_has_input = 1;
2338 /* This must happen after flags have been updated. The output
2339 section may have been created before we saw its first input
2340 section, eg. for a data statement. */
2341 bfd_init_private_section_data (section->owner, section,
2342 link_info.output_bfd,
2343 output->bfd_section,
2345 if ((flags & SEC_MERGE) != 0)
2346 output->bfd_section->entsize = section->entsize;
2349 if ((flags & SEC_TIC54X_BLOCK) != 0
2350 && bfd_get_arch (section->owner) == bfd_arch_tic54x)
2352 /* FIXME: This value should really be obtained from the bfd... */
2353 output->block_value = 128;
2356 if (section->alignment_power > output->bfd_section->alignment_power)
2357 output->bfd_section->alignment_power = section->alignment_power;
2359 section->output_section = output->bfd_section;
2361 if (!link_info.relocatable
2362 && !stripped_excluded_sections)
2364 asection *s = output->bfd_section->map_tail.s;
2365 output->bfd_section->map_tail.s = section;
2366 section->map_head.s = NULL;
2367 section->map_tail.s = s;
2369 s->map_head.s = section;
2371 output->bfd_section->map_head.s = section;
2374 /* Add a section reference to the list. */
2375 new_section = new_stat (lang_input_section, ptr);
2376 new_section->section = section;
2379 /* Handle wildcard sorting. This returns the lang_input_section which
2380 should follow the one we are going to create for SECTION and FILE,
2381 based on the sorting requirements of WILD. It returns NULL if the
2382 new section should just go at the end of the current list. */
2384 static lang_statement_union_type *
2385 wild_sort (lang_wild_statement_type *wild,
2386 struct wildcard_list *sec,
2387 lang_input_statement_type *file,
2390 lang_statement_union_type *l;
2392 if (!wild->filenames_sorted
2393 && (sec == NULL || sec->spec.sorted == none))
2396 for (l = wild->children.head; l != NULL; l = l->header.next)
2398 lang_input_section_type *ls;
2400 if (l->header.type != lang_input_section_enum)
2402 ls = &l->input_section;
2404 /* Sorting by filename takes precedence over sorting by section
2407 if (wild->filenames_sorted)
2409 const char *fn, *ln;
2413 /* The PE support for the .idata section as generated by
2414 dlltool assumes that files will be sorted by the name of
2415 the archive and then the name of the file within the
2418 if (file->the_bfd != NULL
2419 && bfd_my_archive (file->the_bfd) != NULL)
2421 fn = bfd_get_filename (bfd_my_archive (file->the_bfd));
2426 fn = file->filename;
2430 if (bfd_my_archive (ls->section->owner) != NULL)
2432 ln = bfd_get_filename (bfd_my_archive (ls->section->owner));
2437 ln = ls->section->owner->filename;
2441 i = filename_cmp (fn, ln);
2450 fn = file->filename;
2452 ln = ls->section->owner->filename;
2454 i = filename_cmp (fn, ln);
2462 /* Here either the files are not sorted by name, or we are
2463 looking at the sections for this file. */
2466 && sec->spec.sorted != none
2467 && sec->spec.sorted != by_none)
2468 if (compare_section (sec->spec.sorted, section, ls->section) < 0)
2475 /* Expand a wild statement for a particular FILE. SECTION may be
2476 NULL, in which case it is a wild card. */
2479 output_section_callback (lang_wild_statement_type *ptr,
2480 struct wildcard_list *sec,
2482 struct flag_info *sflag_info,
2483 lang_input_statement_type *file,
2486 lang_statement_union_type *before;
2487 lang_output_section_statement_type *os;
2489 os = (lang_output_section_statement_type *) output;
2491 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2492 if (unique_section_p (section, os))
2495 before = wild_sort (ptr, sec, file, section);
2497 /* Here BEFORE points to the lang_input_section which
2498 should follow the one we are about to add. If BEFORE
2499 is NULL, then the section should just go at the end
2500 of the current list. */
2503 lang_add_section (&ptr->children, section, sflag_info, os);
2506 lang_statement_list_type list;
2507 lang_statement_union_type **pp;
2509 lang_list_init (&list);
2510 lang_add_section (&list, section, sflag_info, os);
2512 /* If we are discarding the section, LIST.HEAD will
2514 if (list.head != NULL)
2516 ASSERT (list.head->header.next == NULL);
2518 for (pp = &ptr->children.head;
2520 pp = &(*pp)->header.next)
2521 ASSERT (*pp != NULL);
2523 list.head->header.next = *pp;
2529 /* Check if all sections in a wild statement for a particular FILE
2533 check_section_callback (lang_wild_statement_type *ptr ATTRIBUTE_UNUSED,
2534 struct wildcard_list *sec ATTRIBUTE_UNUSED,
2536 struct flag_info *sflag_info ATTRIBUTE_UNUSED,
2537 lang_input_statement_type *file ATTRIBUTE_UNUSED,
2540 lang_output_section_statement_type *os;
2542 os = (lang_output_section_statement_type *) output;
2544 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2545 if (unique_section_p (section, os))
2548 if (section->output_section == NULL && (section->flags & SEC_READONLY) == 0)
2549 os->all_input_readonly = FALSE;
2552 /* This is passed a file name which must have been seen already and
2553 added to the statement tree. We will see if it has been opened
2554 already and had its symbols read. If not then we'll read it. */
2556 static lang_input_statement_type *
2557 lookup_name (const char *name)
2559 lang_input_statement_type *search;
2561 for (search = (lang_input_statement_type *) input_file_chain.head;
2563 search = (lang_input_statement_type *) search->next_real_file)
2565 /* Use the local_sym_name as the name of the file that has
2566 already been loaded as filename might have been transformed
2567 via the search directory lookup mechanism. */
2568 const char *filename = search->local_sym_name;
2570 if (filename != NULL
2571 && filename_cmp (filename, name) == 0)
2576 search = new_afile (name, lang_input_file_is_search_file_enum,
2577 default_target, FALSE);
2579 /* If we have already added this file, or this file is not real
2580 don't add this file. */
2581 if (search->flags.loaded || !search->flags.real)
2584 if (! load_symbols (search, NULL))
2590 /* Save LIST as a list of libraries whose symbols should not be exported. */
2595 struct excluded_lib *next;
2597 static struct excluded_lib *excluded_libs;
2600 add_excluded_libs (const char *list)
2602 const char *p = list, *end;
2606 struct excluded_lib *entry;
2607 end = strpbrk (p, ",:");
2609 end = p + strlen (p);
2610 entry = (struct excluded_lib *) xmalloc (sizeof (*entry));
2611 entry->next = excluded_libs;
2612 entry->name = (char *) xmalloc (end - p + 1);
2613 memcpy (entry->name, p, end - p);
2614 entry->name[end - p] = '\0';
2615 excluded_libs = entry;
2623 check_excluded_libs (bfd *abfd)
2625 struct excluded_lib *lib = excluded_libs;
2629 int len = strlen (lib->name);
2630 const char *filename = lbasename (abfd->filename);
2632 if (strcmp (lib->name, "ALL") == 0)
2634 abfd->no_export = TRUE;
2638 if (filename_ncmp (lib->name, filename, len) == 0
2639 && (filename[len] == '\0'
2640 || (filename[len] == '.' && filename[len + 1] == 'a'
2641 && filename[len + 2] == '\0')))
2643 abfd->no_export = TRUE;
2651 /* Get the symbols for an input file. */
2654 load_symbols (lang_input_statement_type *entry,
2655 lang_statement_list_type *place)
2659 if (entry->flags.loaded)
2662 ldfile_open_file (entry);
2664 /* Do not process further if the file was missing. */
2665 if (entry->flags.missing_file)
2668 if (! bfd_check_format (entry->the_bfd, bfd_archive)
2669 && ! bfd_check_format_matches (entry->the_bfd, bfd_object, &matching))
2672 struct lang_input_statement_flags save_flags;
2675 err = bfd_get_error ();
2677 /* See if the emulation has some special knowledge. */
2678 if (ldemul_unrecognized_file (entry))
2681 if (err == bfd_error_file_ambiguously_recognized)
2685 einfo (_("%B: file not recognized: %E\n"), entry->the_bfd);
2686 einfo (_("%B: matching formats:"), entry->the_bfd);
2687 for (p = matching; *p != NULL; p++)
2691 else if (err != bfd_error_file_not_recognized
2693 einfo (_("%F%B: file not recognized: %E\n"), entry->the_bfd);
2695 bfd_close (entry->the_bfd);
2696 entry->the_bfd = NULL;
2698 /* Try to interpret the file as a linker script. */
2699 save_flags = input_flags;
2700 ldfile_open_command_file (entry->filename);
2702 push_stat_ptr (place);
2703 input_flags.add_DT_NEEDED_for_regular
2704 = entry->flags.add_DT_NEEDED_for_regular;
2705 input_flags.add_DT_NEEDED_for_dynamic
2706 = entry->flags.add_DT_NEEDED_for_dynamic;
2707 input_flags.whole_archive = entry->flags.whole_archive;
2708 input_flags.dynamic = entry->flags.dynamic;
2710 ldfile_assumed_script = TRUE;
2711 parser_input = input_script;
2713 ldfile_assumed_script = FALSE;
2715 /* missing_file is sticky. sysrooted will already have been
2716 restored when seeing EOF in yyparse, but no harm to restore
2718 save_flags.missing_file |= input_flags.missing_file;
2719 input_flags = save_flags;
2723 entry->flags.loaded = TRUE;
2728 if (ldemul_recognized_file (entry))
2731 /* We don't call ldlang_add_file for an archive. Instead, the
2732 add_symbols entry point will call ldlang_add_file, via the
2733 add_archive_element callback, for each element of the archive
2735 switch (bfd_get_format (entry->the_bfd))
2741 #ifdef ENABLE_PLUGINS
2742 if (!entry->flags.reload)
2744 ldlang_add_file (entry);
2745 if (trace_files || verbose)
2746 info_msg ("%I\n", entry);
2750 check_excluded_libs (entry->the_bfd);
2752 if (entry->flags.whole_archive)
2755 bfd_boolean loaded = TRUE;
2760 member = bfd_openr_next_archived_file (entry->the_bfd, member);
2765 if (! bfd_check_format (member, bfd_object))
2767 einfo (_("%F%B: member %B in archive is not an object\n"),
2768 entry->the_bfd, member);
2773 if (!(*link_info.callbacks
2774 ->add_archive_element) (&link_info, member,
2775 "--whole-archive", &subsbfd))
2778 /* Potentially, the add_archive_element hook may have set a
2779 substitute BFD for us. */
2780 if (!bfd_link_add_symbols (subsbfd, &link_info))
2782 einfo (_("%F%B: could not read symbols: %E\n"), member);
2787 entry->flags.loaded = loaded;
2793 if (bfd_link_add_symbols (entry->the_bfd, &link_info))
2794 entry->flags.loaded = TRUE;
2796 einfo (_("%F%B: could not read symbols: %E\n"), entry->the_bfd);
2798 return entry->flags.loaded;
2801 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2802 may be NULL, indicating that it is a wildcard. Separate
2803 lang_input_section statements are created for each part of the
2804 expansion; they are added after the wild statement S. OUTPUT is
2805 the output section. */
2808 wild (lang_wild_statement_type *s,
2809 const char *target ATTRIBUTE_UNUSED,
2810 lang_output_section_statement_type *output)
2812 struct wildcard_list *sec;
2814 if (s->handler_data[0]
2815 && s->handler_data[0]->spec.sorted == by_name
2816 && !s->filenames_sorted)
2818 lang_section_bst_type *tree;
2820 walk_wild (s, output_section_callback_fast, output);
2825 output_section_callback_tree_to_list (s, tree, output);
2830 walk_wild (s, output_section_callback, output);
2832 if (default_common_section == NULL)
2833 for (sec = s->section_list; sec != NULL; sec = sec->next)
2834 if (sec->spec.name != NULL && strcmp (sec->spec.name, "COMMON") == 0)
2836 /* Remember the section that common is going to in case we
2837 later get something which doesn't know where to put it. */
2838 default_common_section = output;
2843 /* Return TRUE iff target is the sought target. */
2846 get_target (const bfd_target *target, void *data)
2848 const char *sought = (const char *) data;
2850 return strcmp (target->name, sought) == 0;
2853 /* Like strcpy() but convert to lower case as well. */
2856 stricpy (char *dest, char *src)
2860 while ((c = *src++) != 0)
2861 *dest++ = TOLOWER (c);
2866 /* Remove the first occurrence of needle (if any) in haystack
2870 strcut (char *haystack, char *needle)
2872 haystack = strstr (haystack, needle);
2878 for (src = haystack + strlen (needle); *src;)
2879 *haystack++ = *src++;
2885 /* Compare two target format name strings.
2886 Return a value indicating how "similar" they are. */
2889 name_compare (char *first, char *second)
2895 copy1 = (char *) xmalloc (strlen (first) + 1);
2896 copy2 = (char *) xmalloc (strlen (second) + 1);
2898 /* Convert the names to lower case. */
2899 stricpy (copy1, first);
2900 stricpy (copy2, second);
2902 /* Remove size and endian strings from the name. */
2903 strcut (copy1, "big");
2904 strcut (copy1, "little");
2905 strcut (copy2, "big");
2906 strcut (copy2, "little");
2908 /* Return a value based on how many characters match,
2909 starting from the beginning. If both strings are
2910 the same then return 10 * their length. */
2911 for (result = 0; copy1[result] == copy2[result]; result++)
2912 if (copy1[result] == 0)
2924 /* Set by closest_target_match() below. */
2925 static const bfd_target *winner;
2927 /* Scan all the valid bfd targets looking for one that has the endianness
2928 requirement that was specified on the command line, and is the nearest
2929 match to the original output target. */
2932 closest_target_match (const bfd_target *target, void *data)
2934 const bfd_target *original = (const bfd_target *) data;
2936 if (command_line.endian == ENDIAN_BIG
2937 && target->byteorder != BFD_ENDIAN_BIG)
2940 if (command_line.endian == ENDIAN_LITTLE
2941 && target->byteorder != BFD_ENDIAN_LITTLE)
2944 /* Must be the same flavour. */
2945 if (target->flavour != original->flavour)
2948 /* Ignore generic big and little endian elf vectors. */
2949 if (strcmp (target->name, "elf32-big") == 0
2950 || strcmp (target->name, "elf64-big") == 0
2951 || strcmp (target->name, "elf32-little") == 0
2952 || strcmp (target->name, "elf64-little") == 0)
2955 /* If we have not found a potential winner yet, then record this one. */
2962 /* Oh dear, we now have two potential candidates for a successful match.
2963 Compare their names and choose the better one. */
2964 if (name_compare (target->name, original->name)
2965 > name_compare (winner->name, original->name))
2968 /* Keep on searching until wqe have checked them all. */
2972 /* Return the BFD target format of the first input file. */
2975 get_first_input_target (void)
2977 char *target = NULL;
2979 LANG_FOR_EACH_INPUT_STATEMENT (s)
2981 if (s->header.type == lang_input_statement_enum
2984 ldfile_open_file (s);
2986 if (s->the_bfd != NULL
2987 && bfd_check_format (s->the_bfd, bfd_object))
2989 target = bfd_get_target (s->the_bfd);
3001 lang_get_output_target (void)
3005 /* Has the user told us which output format to use? */
3006 if (output_target != NULL)
3007 return output_target;
3009 /* No - has the current target been set to something other than
3011 if (current_target != default_target && current_target != NULL)
3012 return current_target;
3014 /* No - can we determine the format of the first input file? */
3015 target = get_first_input_target ();
3019 /* Failed - use the default output target. */
3020 return default_target;
3023 /* Open the output file. */
3026 open_output (const char *name)
3028 output_target = lang_get_output_target ();
3030 /* Has the user requested a particular endianness on the command
3032 if (command_line.endian != ENDIAN_UNSET)
3034 const bfd_target *target;
3035 enum bfd_endian desired_endian;
3037 /* Get the chosen target. */
3038 target = bfd_search_for_target (get_target, (void *) output_target);
3040 /* If the target is not supported, we cannot do anything. */
3043 if (command_line.endian == ENDIAN_BIG)
3044 desired_endian = BFD_ENDIAN_BIG;
3046 desired_endian = BFD_ENDIAN_LITTLE;
3048 /* See if the target has the wrong endianness. This should
3049 not happen if the linker script has provided big and
3050 little endian alternatives, but some scrips don't do
3052 if (target->byteorder != desired_endian)
3054 /* If it does, then see if the target provides
3055 an alternative with the correct endianness. */
3056 if (target->alternative_target != NULL
3057 && (target->alternative_target->byteorder == desired_endian))
3058 output_target = target->alternative_target->name;
3061 /* Try to find a target as similar as possible to
3062 the default target, but which has the desired
3063 endian characteristic. */
3064 bfd_search_for_target (closest_target_match,
3067 /* Oh dear - we could not find any targets that
3068 satisfy our requirements. */
3070 einfo (_("%P: warning: could not find any targets"
3071 " that match endianness requirement\n"));
3073 output_target = winner->name;
3079 link_info.output_bfd = bfd_openw (name, output_target);
3081 if (link_info.output_bfd == NULL)
3083 if (bfd_get_error () == bfd_error_invalid_target)
3084 einfo (_("%P%F: target %s not found\n"), output_target);
3086 einfo (_("%P%F: cannot open output file %s: %E\n"), name);
3089 delete_output_file_on_failure = TRUE;
3091 if (! bfd_set_format (link_info.output_bfd, bfd_object))
3092 einfo (_("%P%F:%s: can not make object file: %E\n"), name);
3093 if (! bfd_set_arch_mach (link_info.output_bfd,
3094 ldfile_output_architecture,
3095 ldfile_output_machine))
3096 einfo (_("%P%F:%s: can not set architecture: %E\n"), name);
3098 link_info.hash = bfd_link_hash_table_create (link_info.output_bfd);
3099 if (link_info.hash == NULL)
3100 einfo (_("%P%F: can not create hash table: %E\n"));
3102 bfd_set_gp_size (link_info.output_bfd, g_switch_value);
3106 ldlang_open_output (lang_statement_union_type *statement)
3108 switch (statement->header.type)
3110 case lang_output_statement_enum:
3111 ASSERT (link_info.output_bfd == NULL);
3112 open_output (statement->output_statement.name);
3113 ldemul_set_output_arch ();
3114 if (config.magic_demand_paged && !link_info.relocatable)
3115 link_info.output_bfd->flags |= D_PAGED;
3117 link_info.output_bfd->flags &= ~D_PAGED;
3118 if (config.text_read_only)
3119 link_info.output_bfd->flags |= WP_TEXT;
3121 link_info.output_bfd->flags &= ~WP_TEXT;
3122 if (link_info.traditional_format)
3123 link_info.output_bfd->flags |= BFD_TRADITIONAL_FORMAT;
3125 link_info.output_bfd->flags &= ~BFD_TRADITIONAL_FORMAT;
3128 case lang_target_statement_enum:
3129 current_target = statement->target_statement.target;
3136 /* Convert between addresses in bytes and sizes in octets.
3137 For currently supported targets, octets_per_byte is always a power
3138 of two, so we can use shifts. */
3139 #define TO_ADDR(X) ((X) >> opb_shift)
3140 #define TO_SIZE(X) ((X) << opb_shift)
3142 /* Support the above. */
3143 static unsigned int opb_shift = 0;
3148 unsigned x = bfd_arch_mach_octets_per_byte (ldfile_output_architecture,
3149 ldfile_output_machine);
3152 while ((x & 1) == 0)
3160 /* Open all the input files. */
3164 OPEN_BFD_NORMAL = 0,
3168 #ifdef ENABLE_PLUGINS
3169 static lang_input_statement_type *plugin_insert = NULL;
3173 open_input_bfds (lang_statement_union_type *s, enum open_bfd_mode mode)
3175 for (; s != NULL; s = s->header.next)
3177 switch (s->header.type)
3179 case lang_constructors_statement_enum:
3180 open_input_bfds (constructor_list.head, mode);
3182 case lang_output_section_statement_enum:
3183 open_input_bfds (s->output_section_statement.children.head, mode);
3185 case lang_wild_statement_enum:
3186 /* Maybe we should load the file's symbols. */
3187 if ((mode & OPEN_BFD_RESCAN) == 0
3188 && s->wild_statement.filename
3189 && !wildcardp (s->wild_statement.filename)
3190 && !archive_path (s->wild_statement.filename))
3191 lookup_name (s->wild_statement.filename);
3192 open_input_bfds (s->wild_statement.children.head, mode);
3194 case lang_group_statement_enum:
3196 struct bfd_link_hash_entry *undefs;
3198 /* We must continually search the entries in the group
3199 until no new symbols are added to the list of undefined
3204 undefs = link_info.hash->undefs_tail;
3205 open_input_bfds (s->group_statement.children.head,
3206 mode | OPEN_BFD_FORCE);
3208 while (undefs != link_info.hash->undefs_tail);
3211 case lang_target_statement_enum:
3212 current_target = s->target_statement.target;
3214 case lang_input_statement_enum:
3215 if (s->input_statement.flags.real)
3217 lang_statement_union_type **os_tail;
3218 lang_statement_list_type add;
3220 s->input_statement.target = current_target;
3222 /* If we are being called from within a group, and this
3223 is an archive which has already been searched, then
3224 force it to be researched unless the whole archive
3225 has been loaded already. Do the same for a rescan. */
3226 if (mode != OPEN_BFD_NORMAL
3227 #ifdef ENABLE_PLUGINS
3228 && ((mode & OPEN_BFD_RESCAN) == 0
3229 || plugin_insert == NULL)
3231 && !s->input_statement.flags.whole_archive
3232 && s->input_statement.flags.loaded
3233 && s->input_statement.the_bfd != NULL
3234 && bfd_check_format (s->input_statement.the_bfd,
3236 s->input_statement.flags.loaded = FALSE;
3237 #ifdef ENABLE_PLUGINS
3238 /* When rescanning, reload --as-needed shared libs. */
3239 else if ((mode & OPEN_BFD_RESCAN) != 0
3240 && plugin_insert == NULL
3241 && s->input_statement.flags.loaded
3242 && s->input_statement.flags.add_DT_NEEDED_for_regular
3243 && s->input_statement.the_bfd != NULL
3244 && ((s->input_statement.the_bfd->flags) & DYNAMIC) != 0
3245 && plugin_should_reload (s->input_statement.the_bfd))
3247 s->input_statement.flags.loaded = FALSE;
3248 s->input_statement.flags.reload = TRUE;
3252 os_tail = lang_output_section_statement.tail;
3253 lang_list_init (&add);
3255 if (! load_symbols (&s->input_statement, &add))
3256 config.make_executable = FALSE;
3258 if (add.head != NULL)
3260 /* If this was a script with output sections then
3261 tack any added statements on to the end of the
3262 list. This avoids having to reorder the output
3263 section statement list. Very likely the user
3264 forgot -T, and whatever we do here will not meet
3265 naive user expectations. */
3266 if (os_tail != lang_output_section_statement.tail)
3268 einfo (_("%P: warning: %s contains output sections;"
3269 " did you forget -T?\n"),
3270 s->input_statement.filename);
3271 *stat_ptr->tail = add.head;
3272 stat_ptr->tail = add.tail;
3276 *add.tail = s->header.next;
3277 s->header.next = add.head;
3281 #ifdef ENABLE_PLUGINS
3282 /* If we have found the point at which a plugin added new
3283 files, clear plugin_insert to enable archive rescan. */
3284 if (&s->input_statement == plugin_insert)
3285 plugin_insert = NULL;
3288 case lang_assignment_statement_enum:
3289 if (s->assignment_statement.exp->assign.defsym)
3290 /* This is from a --defsym on the command line. */
3291 exp_fold_tree_no_dot (s->assignment_statement.exp);
3298 /* Exit if any of the files were missing. */
3299 if (input_flags.missing_file)
3303 /* Add a symbol to a hash of symbols used in DEFINED (NAME) expressions. */
3306 lang_track_definedness (const char *name)
3308 if (bfd_hash_lookup (&lang_definedness_table, name, TRUE, FALSE) == NULL)
3309 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name);
3312 /* New-function for the definedness hash table. */
3314 static struct bfd_hash_entry *
3315 lang_definedness_newfunc (struct bfd_hash_entry *entry,
3316 struct bfd_hash_table *table ATTRIBUTE_UNUSED,
3317 const char *name ATTRIBUTE_UNUSED)
3319 struct lang_definedness_hash_entry *ret
3320 = (struct lang_definedness_hash_entry *) entry;
3323 ret = (struct lang_definedness_hash_entry *)
3324 bfd_hash_allocate (table, sizeof (struct lang_definedness_hash_entry));
3327 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name);
3329 ret->iteration = -1;
3333 /* Return the iteration when the definition of NAME was last updated. A
3334 value of -1 means that the symbol is not defined in the linker script
3335 or the command line, but may be defined in the linker symbol table. */
3338 lang_symbol_definition_iteration (const char *name)
3340 struct lang_definedness_hash_entry *defentry
3341 = (struct lang_definedness_hash_entry *)
3342 bfd_hash_lookup (&lang_definedness_table, name, FALSE, FALSE);
3344 /* We've already created this one on the presence of DEFINED in the
3345 script, so it can't be NULL unless something is borked elsewhere in
3347 if (defentry == NULL)
3350 return defentry->iteration;
3353 /* Update the definedness state of NAME. */
3356 lang_update_definedness (const char *name, struct bfd_link_hash_entry *h)
3358 struct lang_definedness_hash_entry *defentry
3359 = (struct lang_definedness_hash_entry *)
3360 bfd_hash_lookup (&lang_definedness_table, name, FALSE, FALSE);
3362 /* We don't keep track of symbols not tested with DEFINED. */
3363 if (defentry == NULL)
3366 /* If the symbol was already defined, and not from an earlier statement
3367 iteration, don't update the definedness iteration, because that'd
3368 make the symbol seem defined in the linker script at this point, and
3369 it wasn't; it was defined in some object. If we do anyway, DEFINED
3370 would start to yield false before this point and the construct "sym =
3371 DEFINED (sym) ? sym : X;" would change sym to X despite being defined
3373 if (h->type != bfd_link_hash_undefined
3374 && h->type != bfd_link_hash_common
3375 && h->type != bfd_link_hash_new
3376 && defentry->iteration == -1)
3379 defentry->iteration = lang_statement_iteration;
3382 /* Add the supplied name to the symbol table as an undefined reference.
3383 This is a two step process as the symbol table doesn't even exist at
3384 the time the ld command line is processed. First we put the name
3385 on a list, then, once the output file has been opened, transfer the
3386 name to the symbol table. */
3388 typedef struct bfd_sym_chain ldlang_undef_chain_list_type;
3390 #define ldlang_undef_chain_list_head entry_symbol.next
3393 ldlang_add_undef (const char *const name, bfd_boolean cmdline)
3395 ldlang_undef_chain_list_type *new_undef;
3397 undef_from_cmdline = undef_from_cmdline || cmdline;
3398 new_undef = (ldlang_undef_chain_list_type *) stat_alloc (sizeof (*new_undef));
3399 new_undef->next = ldlang_undef_chain_list_head;
3400 ldlang_undef_chain_list_head = new_undef;
3402 new_undef->name = xstrdup (name);
3404 if (link_info.output_bfd != NULL)
3405 insert_undefined (new_undef->name);
3408 /* Insert NAME as undefined in the symbol table. */
3411 insert_undefined (const char *name)
3413 struct bfd_link_hash_entry *h;
3415 h = bfd_link_hash_lookup (link_info.hash, name, TRUE, FALSE, TRUE);
3417 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
3418 if (h->type == bfd_link_hash_new)
3420 h->type = bfd_link_hash_undefined;
3421 h->u.undef.abfd = NULL;
3422 bfd_link_add_undef (link_info.hash, h);
3426 /* Run through the list of undefineds created above and place them
3427 into the linker hash table as undefined symbols belonging to the
3431 lang_place_undefineds (void)
3433 ldlang_undef_chain_list_type *ptr;
3435 for (ptr = ldlang_undef_chain_list_head; ptr != NULL; ptr = ptr->next)
3436 insert_undefined (ptr->name);
3439 /* Check for all readonly or some readwrite sections. */
3442 check_input_sections
3443 (lang_statement_union_type *s,
3444 lang_output_section_statement_type *output_section_statement)
3446 for (; s != (lang_statement_union_type *) NULL; s = s->header.next)
3448 switch (s->header.type)
3450 case lang_wild_statement_enum:
3451 walk_wild (&s->wild_statement, check_section_callback,
3452 output_section_statement);
3453 if (! output_section_statement->all_input_readonly)
3456 case lang_constructors_statement_enum:
3457 check_input_sections (constructor_list.head,
3458 output_section_statement);
3459 if (! output_section_statement->all_input_readonly)
3462 case lang_group_statement_enum:
3463 check_input_sections (s->group_statement.children.head,
3464 output_section_statement);
3465 if (! output_section_statement->all_input_readonly)
3474 /* Update wildcard statements if needed. */
3477 update_wild_statements (lang_statement_union_type *s)
3479 struct wildcard_list *sec;
3481 switch (sort_section)
3491 for (; s != NULL; s = s->header.next)
3493 switch (s->header.type)
3498 case lang_wild_statement_enum:
3499 for (sec = s->wild_statement.section_list; sec != NULL;
3502 switch (sec->spec.sorted)
3505 sec->spec.sorted = sort_section;
3508 if (sort_section == by_alignment)
3509 sec->spec.sorted = by_name_alignment;
3512 if (sort_section == by_name)
3513 sec->spec.sorted = by_alignment_name;
3521 case lang_constructors_statement_enum:
3522 update_wild_statements (constructor_list.head);
3525 case lang_output_section_statement_enum:
3526 /* Don't sort .init/.fini sections. */
3527 if (strcmp (s->output_section_statement.name, ".init") != 0
3528 && strcmp (s->output_section_statement.name, ".fini") != 0)
3529 update_wild_statements
3530 (s->output_section_statement.children.head);
3533 case lang_group_statement_enum:
3534 update_wild_statements (s->group_statement.children.head);
3542 /* Open input files and attach to output sections. */
3545 map_input_to_output_sections
3546 (lang_statement_union_type *s, const char *target,
3547 lang_output_section_statement_type *os)
3549 for (; s != NULL; s = s->header.next)
3551 lang_output_section_statement_type *tos;
3554 switch (s->header.type)
3556 case lang_wild_statement_enum:
3557 wild (&s->wild_statement, target, os);
3559 case lang_constructors_statement_enum:
3560 map_input_to_output_sections (constructor_list.head,
3564 case lang_output_section_statement_enum:
3565 tos = &s->output_section_statement;
3566 if (tos->constraint != 0)
3568 if (tos->constraint != ONLY_IF_RW
3569 && tos->constraint != ONLY_IF_RO)
3571 tos->all_input_readonly = TRUE;
3572 check_input_sections (tos->children.head, tos);
3573 if (tos->all_input_readonly != (tos->constraint == ONLY_IF_RO))
3575 tos->constraint = -1;
3579 map_input_to_output_sections (tos->children.head,
3583 case lang_output_statement_enum:
3585 case lang_target_statement_enum:
3586 target = s->target_statement.target;
3588 case lang_group_statement_enum:
3589 map_input_to_output_sections (s->group_statement.children.head,
3593 case lang_data_statement_enum:
3594 /* Make sure that any sections mentioned in the expression
3596 exp_init_os (s->data_statement.exp);
3597 /* The output section gets CONTENTS, ALLOC and LOAD, but
3598 these may be overridden by the script. */
3599 flags = SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD;
3600 switch (os->sectype)
3602 case normal_section:
3603 case overlay_section:
3605 case noalloc_section:
3606 flags = SEC_HAS_CONTENTS;
3608 case noload_section:
3609 if (bfd_get_flavour (link_info.output_bfd)
3610 == bfd_target_elf_flavour)
3611 flags = SEC_NEVER_LOAD | SEC_ALLOC;
3613 flags = SEC_NEVER_LOAD | SEC_HAS_CONTENTS;
3616 if (os->bfd_section == NULL)
3617 init_os (os, flags);
3619 os->bfd_section->flags |= flags;
3621 case lang_input_section_enum:
3623 case lang_fill_statement_enum:
3624 case lang_object_symbols_statement_enum:
3625 case lang_reloc_statement_enum:
3626 case lang_padding_statement_enum:
3627 case lang_input_statement_enum:
3628 if (os != NULL && os->bfd_section == NULL)
3631 case lang_assignment_statement_enum:
3632 if (os != NULL && os->bfd_section == NULL)
3635 /* Make sure that any sections mentioned in the assignment
3637 exp_init_os (s->assignment_statement.exp);
3639 case lang_address_statement_enum:
3640 /* Mark the specified section with the supplied address.
3641 If this section was actually a segment marker, then the
3642 directive is ignored if the linker script explicitly
3643 processed the segment marker. Originally, the linker
3644 treated segment directives (like -Ttext on the
3645 command-line) as section directives. We honor the
3646 section directive semantics for backwards compatibilty;
3647 linker scripts that do not specifically check for
3648 SEGMENT_START automatically get the old semantics. */
3649 if (!s->address_statement.segment
3650 || !s->address_statement.segment->used)
3652 const char *name = s->address_statement.section_name;
3654 /* Create the output section statement here so that
3655 orphans with a set address will be placed after other
3656 script sections. If we let the orphan placement code
3657 place them in amongst other sections then the address
3658 will affect following script sections, which is
3659 likely to surprise naive users. */
3660 tos = lang_output_section_statement_lookup (name, 0, TRUE);
3661 tos->addr_tree = s->address_statement.address;
3662 if (tos->bfd_section == NULL)
3666 case lang_insert_statement_enum:
3672 /* An insert statement snips out all the linker statements from the
3673 start of the list and places them after the output section
3674 statement specified by the insert. This operation is complicated
3675 by the fact that we keep a doubly linked list of output section
3676 statements as well as the singly linked list of all statements. */
3679 process_insert_statements (void)
3681 lang_statement_union_type **s;
3682 lang_output_section_statement_type *first_os = NULL;
3683 lang_output_section_statement_type *last_os = NULL;
3684 lang_output_section_statement_type *os;
3686 /* "start of list" is actually the statement immediately after
3687 the special abs_section output statement, so that it isn't
3689 s = &lang_output_section_statement.head;
3690 while (*(s = &(*s)->header.next) != NULL)
3692 if ((*s)->header.type == lang_output_section_statement_enum)
3694 /* Keep pointers to the first and last output section
3695 statement in the sequence we may be about to move. */
3696 os = &(*s)->output_section_statement;
3698 ASSERT (last_os == NULL || last_os->next == os);
3701 /* Set constraint negative so that lang_output_section_find
3702 won't match this output section statement. At this
3703 stage in linking constraint has values in the range
3704 [-1, ONLY_IN_RW]. */
3705 last_os->constraint = -2 - last_os->constraint;
3706 if (first_os == NULL)
3709 else if ((*s)->header.type == lang_insert_statement_enum)
3711 lang_insert_statement_type *i = &(*s)->insert_statement;
3712 lang_output_section_statement_type *where;
3713 lang_statement_union_type **ptr;
3714 lang_statement_union_type *first;
3716 where = lang_output_section_find (i->where);
3717 if (where != NULL && i->is_before)
3720 where = where->prev;
3721 while (where != NULL && where->constraint < 0);
3725 einfo (_("%F%P: %s not found for insert\n"), i->where);
3729 /* Deal with reordering the output section statement list. */
3730 if (last_os != NULL)
3732 asection *first_sec, *last_sec;
3733 struct lang_output_section_statement_struct **next;
3735 /* Snip out the output sections we are moving. */
3736 first_os->prev->next = last_os->next;
3737 if (last_os->next == NULL)
3739 next = &first_os->prev->next;
3740 lang_output_section_statement.tail
3741 = (lang_statement_union_type **) next;
3744 last_os->next->prev = first_os->prev;
3745 /* Add them in at the new position. */
3746 last_os->next = where->next;
3747 if (where->next == NULL)
3749 next = &last_os->next;
3750 lang_output_section_statement.tail
3751 = (lang_statement_union_type **) next;
3754 where->next->prev = last_os;
3755 first_os->prev = where;
3756 where->next = first_os;
3758 /* Move the bfd sections in the same way. */
3761 for (os = first_os; os != NULL; os = os->next)
3763 os->constraint = -2 - os->constraint;
3764 if (os->bfd_section != NULL
3765 && os->bfd_section->owner != NULL)
3767 last_sec = os->bfd_section;
3768 if (first_sec == NULL)
3769 first_sec = last_sec;
3774 if (last_sec != NULL)
3776 asection *sec = where->bfd_section;
3778 sec = output_prev_sec_find (where);
3780 /* The place we want to insert must come after the
3781 sections we are moving. So if we find no
3782 section or if the section is the same as our
3783 last section, then no move is needed. */
3784 if (sec != NULL && sec != last_sec)
3786 /* Trim them off. */
3787 if (first_sec->prev != NULL)
3788 first_sec->prev->next = last_sec->next;
3790 link_info.output_bfd->sections = last_sec->next;
3791 if (last_sec->next != NULL)
3792 last_sec->next->prev = first_sec->prev;
3794 link_info.output_bfd->section_last = first_sec->prev;
3796 last_sec->next = sec->next;
3797 if (sec->next != NULL)
3798 sec->next->prev = last_sec;
3800 link_info.output_bfd->section_last = last_sec;
3801 first_sec->prev = sec;
3802 sec->next = first_sec;
3810 ptr = insert_os_after (where);
3811 /* Snip everything after the abs_section output statement we
3812 know is at the start of the list, up to and including
3813 the insert statement we are currently processing. */
3814 first = lang_output_section_statement.head->header.next;
3815 lang_output_section_statement.head->header.next = (*s)->header.next;
3816 /* Add them back where they belong. */
3819 statement_list.tail = s;
3821 s = &lang_output_section_statement.head;
3825 /* Undo constraint twiddling. */
3826 for (os = first_os; os != NULL; os = os->next)
3828 os->constraint = -2 - os->constraint;
3834 /* An output section might have been removed after its statement was
3835 added. For example, ldemul_before_allocation can remove dynamic
3836 sections if they turn out to be not needed. Clean them up here. */
3839 strip_excluded_output_sections (void)
3841 lang_output_section_statement_type *os;
3843 /* Run lang_size_sections (if not already done). */
3844 if (expld.phase != lang_mark_phase_enum)
3846 expld.phase = lang_mark_phase_enum;
3847 expld.dataseg.phase = exp_dataseg_none;
3848 one_lang_size_sections_pass (NULL, FALSE);
3849 lang_reset_memory_regions ();
3852 for (os = &lang_output_section_statement.head->output_section_statement;
3856 asection *output_section;
3857 bfd_boolean exclude;
3859 if (os->constraint < 0)
3862 output_section = os->bfd_section;
3863 if (output_section == NULL)
3866 exclude = (output_section->rawsize == 0
3867 && (output_section->flags & SEC_KEEP) == 0
3868 && !bfd_section_removed_from_list (link_info.output_bfd,
3871 /* Some sections have not yet been sized, notably .gnu.version,
3872 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3873 input sections, so don't drop output sections that have such
3874 input sections unless they are also marked SEC_EXCLUDE. */
3875 if (exclude && output_section->map_head.s != NULL)
3879 for (s = output_section->map_head.s; s != NULL; s = s->map_head.s)
3880 if ((s->flags & SEC_EXCLUDE) == 0
3881 && ((s->flags & SEC_LINKER_CREATED) != 0
3882 || link_info.emitrelocations))
3889 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3890 output_section->map_head.link_order = NULL;
3891 output_section->map_tail.link_order = NULL;
3895 /* We don't set bfd_section to NULL since bfd_section of the
3896 removed output section statement may still be used. */
3897 if (!os->update_dot)
3899 output_section->flags |= SEC_EXCLUDE;
3900 bfd_section_list_remove (link_info.output_bfd, output_section);
3901 link_info.output_bfd->section_count--;
3905 /* Stop future calls to lang_add_section from messing with map_head
3906 and map_tail link_order fields. */
3907 stripped_excluded_sections = TRUE;
3911 print_output_section_statement
3912 (lang_output_section_statement_type *output_section_statement)
3914 asection *section = output_section_statement->bfd_section;
3917 if (output_section_statement != abs_output_section)
3919 minfo ("\n%s", output_section_statement->name);
3921 if (section != NULL)
3923 print_dot = section->vma;
3925 len = strlen (output_section_statement->name);
3926 if (len >= SECTION_NAME_MAP_LENGTH - 1)
3931 while (len < SECTION_NAME_MAP_LENGTH)
3937 minfo ("0x%V %W", section->vma, section->size);
3939 if (section->vma != section->lma)
3940 minfo (_(" load address 0x%V"), section->lma);
3942 if (output_section_statement->update_dot_tree != NULL)
3943 exp_fold_tree (output_section_statement->update_dot_tree,
3944 bfd_abs_section_ptr, &print_dot);
3950 print_statement_list (output_section_statement->children.head,
3951 output_section_statement);
3955 print_assignment (lang_assignment_statement_type *assignment,
3956 lang_output_section_statement_type *output_section)
3963 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
3966 if (assignment->exp->type.node_class == etree_assert)
3969 tree = assignment->exp->assert_s.child;
3973 const char *dst = assignment->exp->assign.dst;
3975 is_dot = (dst[0] == '.' && dst[1] == 0);
3976 expld.assign_name = dst;
3977 tree = assignment->exp->assign.src;
3980 osec = output_section->bfd_section;
3982 osec = bfd_abs_section_ptr;
3983 exp_fold_tree (tree, osec, &print_dot);
3984 if (expld.result.valid_p)
3988 if (assignment->exp->type.node_class == etree_assert
3990 || expld.assign_name != NULL)
3992 value = expld.result.value;
3994 if (expld.result.section != NULL)
3995 value += expld.result.section->vma;
3997 minfo ("0x%V", value);
4003 struct bfd_link_hash_entry *h;
4005 h = bfd_link_hash_lookup (link_info.hash, assignment->exp->assign.dst,
4006 FALSE, FALSE, TRUE);
4009 value = h->u.def.value;
4010 value += h->u.def.section->output_section->vma;
4011 value += h->u.def.section->output_offset;
4013 minfo ("[0x%V]", value);
4016 minfo ("[unresolved]");
4026 expld.assign_name = NULL;
4029 exp_print_tree (assignment->exp);
4034 print_input_statement (lang_input_statement_type *statm)
4036 if (statm->filename != NULL
4037 && (statm->the_bfd == NULL
4038 || (statm->the_bfd->flags & BFD_LINKER_CREATED) == 0))
4039 fprintf (config.map_file, "LOAD %s\n", statm->filename);
4042 /* Print all symbols defined in a particular section. This is called
4043 via bfd_link_hash_traverse, or by print_all_symbols. */
4046 print_one_symbol (struct bfd_link_hash_entry *hash_entry, void *ptr)
4048 asection *sec = (asection *) ptr;
4050 if ((hash_entry->type == bfd_link_hash_defined
4051 || hash_entry->type == bfd_link_hash_defweak)
4052 && sec == hash_entry->u.def.section)
4056 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
4059 (hash_entry->u.def.value
4060 + hash_entry->u.def.section->output_offset
4061 + hash_entry->u.def.section->output_section->vma));
4063 minfo (" %T\n", hash_entry->root.string);
4070 hash_entry_addr_cmp (const void *a, const void *b)
4072 const struct bfd_link_hash_entry *l = *(const struct bfd_link_hash_entry **)a;
4073 const struct bfd_link_hash_entry *r = *(const struct bfd_link_hash_entry **)b;
4075 if (l->u.def.value < r->u.def.value)
4077 else if (l->u.def.value > r->u.def.value)
4084 print_all_symbols (asection *sec)
4086 struct fat_user_section_struct *ud =
4087 (struct fat_user_section_struct *) get_userdata (sec);
4088 struct map_symbol_def *def;
4089 struct bfd_link_hash_entry **entries;
4095 *ud->map_symbol_def_tail = 0;
4097 /* Sort the symbols by address. */
4098 entries = (struct bfd_link_hash_entry **)
4099 obstack_alloc (&map_obstack, ud->map_symbol_def_count * sizeof (*entries));
4101 for (i = 0, def = ud->map_symbol_def_head; def; def = def->next, i++)
4102 entries[i] = def->entry;
4104 qsort (entries, ud->map_symbol_def_count, sizeof (*entries),
4105 hash_entry_addr_cmp);
4107 /* Print the symbols. */
4108 for (i = 0; i < ud->map_symbol_def_count; i++)
4109 print_one_symbol (entries[i], sec);
4111 obstack_free (&map_obstack, entries);
4114 /* Print information about an input section to the map file. */
4117 print_input_section (asection *i, bfd_boolean is_discarded)
4119 bfd_size_type size = i->size;
4126 minfo ("%s", i->name);
4128 len = 1 + strlen (i->name);
4129 if (len >= SECTION_NAME_MAP_LENGTH - 1)
4134 while (len < SECTION_NAME_MAP_LENGTH)
4140 if (i->output_section != NULL
4141 && i->output_section->owner == link_info.output_bfd)
4142 addr = i->output_section->vma + i->output_offset;
4150 minfo ("0x%V %W %B\n", addr, TO_ADDR (size), i->owner);
4152 if (size != i->rawsize && i->rawsize != 0)
4154 len = SECTION_NAME_MAP_LENGTH + 3;
4166 minfo (_("%W (size before relaxing)\n"), i->rawsize);
4169 if (i->output_section != NULL
4170 && i->output_section->owner == link_info.output_bfd)
4172 if (link_info.reduce_memory_overheads)
4173 bfd_link_hash_traverse (link_info.hash, print_one_symbol, i);
4175 print_all_symbols (i);
4177 /* Update print_dot, but make sure that we do not move it
4178 backwards - this could happen if we have overlays and a
4179 later overlay is shorter than an earier one. */
4180 if (addr + TO_ADDR (size) > print_dot)
4181 print_dot = addr + TO_ADDR (size);
4186 print_fill_statement (lang_fill_statement_type *fill)
4190 fputs (" FILL mask 0x", config.map_file);
4191 for (p = fill->fill->data, size = fill->fill->size; size != 0; p++, size--)
4192 fprintf (config.map_file, "%02x", *p);
4193 fputs ("\n", config.map_file);
4197 print_data_statement (lang_data_statement_type *data)
4205 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
4208 addr = data->output_offset;
4209 if (data->output_section != NULL)
4210 addr += data->output_section->vma;
4238 minfo ("0x%V %W %s 0x%v", addr, size, name, data->value);
4240 if (data->exp->type.node_class != etree_value)
4243 exp_print_tree (data->exp);
4248 print_dot = addr + TO_ADDR (size);
4251 /* Print an address statement. These are generated by options like
4255 print_address_statement (lang_address_statement_type *address)
4257 minfo (_("Address of section %s set to "), address->section_name);
4258 exp_print_tree (address->address);
4262 /* Print a reloc statement. */
4265 print_reloc_statement (lang_reloc_statement_type *reloc)
4272 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
4275 addr = reloc->output_offset;
4276 if (reloc->output_section != NULL)
4277 addr += reloc->output_section->vma;
4279 size = bfd_get_reloc_size (reloc->howto);
4281 minfo ("0x%V %W RELOC %s ", addr, size, reloc->howto->name);
4283 if (reloc->name != NULL)
4284 minfo ("%s+", reloc->name);
4286 minfo ("%s+", reloc->section->name);
4288 exp_print_tree (reloc->addend_exp);
4292 print_dot = addr + TO_ADDR (size);
4296 print_padding_statement (lang_padding_statement_type *s)
4304 len = sizeof " *fill*" - 1;
4305 while (len < SECTION_NAME_MAP_LENGTH)
4311 addr = s->output_offset;
4312 if (s->output_section != NULL)
4313 addr += s->output_section->vma;
4314 minfo ("0x%V %W ", addr, (bfd_vma) s->size);
4316 if (s->fill->size != 0)
4320 for (p = s->fill->data, size = s->fill->size; size != 0; p++, size--)
4321 fprintf (config.map_file, "%02x", *p);
4326 print_dot = addr + TO_ADDR (s->size);
4330 print_wild_statement (lang_wild_statement_type *w,
4331 lang_output_section_statement_type *os)
4333 struct wildcard_list *sec;
4337 if (w->filenames_sorted)
4339 if (w->filename != NULL)
4340 minfo ("%s", w->filename);
4343 if (w->filenames_sorted)
4347 for (sec = w->section_list; sec; sec = sec->next)
4349 if (sec->spec.sorted)
4351 if (sec->spec.exclude_name_list != NULL)
4354 minfo ("EXCLUDE_FILE(%s", sec->spec.exclude_name_list->name);
4355 for (tmp = sec->spec.exclude_name_list->next; tmp; tmp = tmp->next)
4356 minfo (" %s", tmp->name);
4359 if (sec->spec.name != NULL)
4360 minfo ("%s", sec->spec.name);
4363 if (sec->spec.sorted)
4372 print_statement_list (w->children.head, os);
4375 /* Print a group statement. */
4378 print_group (lang_group_statement_type *s,
4379 lang_output_section_statement_type *os)
4381 fprintf (config.map_file, "START GROUP\n");
4382 print_statement_list (s->children.head, os);
4383 fprintf (config.map_file, "END GROUP\n");
4386 /* Print the list of statements in S.
4387 This can be called for any statement type. */
4390 print_statement_list (lang_statement_union_type *s,
4391 lang_output_section_statement_type *os)
4395 print_statement (s, os);
4400 /* Print the first statement in statement list S.
4401 This can be called for any statement type. */
4404 print_statement (lang_statement_union_type *s,
4405 lang_output_section_statement_type *os)
4407 switch (s->header.type)
4410 fprintf (config.map_file, _("Fail with %d\n"), s->header.type);
4413 case lang_constructors_statement_enum:
4414 if (constructor_list.head != NULL)
4416 if (constructors_sorted)
4417 minfo (" SORT (CONSTRUCTORS)\n");
4419 minfo (" CONSTRUCTORS\n");
4420 print_statement_list (constructor_list.head, os);
4423 case lang_wild_statement_enum:
4424 print_wild_statement (&s->wild_statement, os);
4426 case lang_address_statement_enum:
4427 print_address_statement (&s->address_statement);
4429 case lang_object_symbols_statement_enum:
4430 minfo (" CREATE_OBJECT_SYMBOLS\n");
4432 case lang_fill_statement_enum:
4433 print_fill_statement (&s->fill_statement);
4435 case lang_data_statement_enum:
4436 print_data_statement (&s->data_statement);
4438 case lang_reloc_statement_enum:
4439 print_reloc_statement (&s->reloc_statement);
4441 case lang_input_section_enum:
4442 print_input_section (s->input_section.section, FALSE);
4444 case lang_padding_statement_enum:
4445 print_padding_statement (&s->padding_statement);
4447 case lang_output_section_statement_enum:
4448 print_output_section_statement (&s->output_section_statement);
4450 case lang_assignment_statement_enum:
4451 print_assignment (&s->assignment_statement, os);
4453 case lang_target_statement_enum:
4454 fprintf (config.map_file, "TARGET(%s)\n", s->target_statement.target);
4456 case lang_output_statement_enum:
4457 minfo ("OUTPUT(%s", s->output_statement.name);
4458 if (output_target != NULL)
4459 minfo (" %s", output_target);
4462 case lang_input_statement_enum:
4463 print_input_statement (&s->input_statement);
4465 case lang_group_statement_enum:
4466 print_group (&s->group_statement, os);
4468 case lang_insert_statement_enum:
4469 minfo ("INSERT %s %s\n",
4470 s->insert_statement.is_before ? "BEFORE" : "AFTER",
4471 s->insert_statement.where);
4477 print_statements (void)
4479 print_statement_list (statement_list.head, abs_output_section);
4482 /* Print the first N statements in statement list S to STDERR.
4483 If N == 0, nothing is printed.
4484 If N < 0, the entire list is printed.
4485 Intended to be called from GDB. */
4488 dprint_statement (lang_statement_union_type *s, int n)
4490 FILE *map_save = config.map_file;
4492 config.map_file = stderr;
4495 print_statement_list (s, abs_output_section);
4498 while (s && --n >= 0)
4500 print_statement (s, abs_output_section);
4505 config.map_file = map_save;
4509 insert_pad (lang_statement_union_type **ptr,
4511 bfd_size_type alignment_needed,
4512 asection *output_section,
4515 static fill_type zero_fill;
4516 lang_statement_union_type *pad = NULL;
4518 if (ptr != &statement_list.head)
4519 pad = ((lang_statement_union_type *)
4520 ((char *) ptr - offsetof (lang_statement_union_type, header.next)));
4522 && pad->header.type == lang_padding_statement_enum
4523 && pad->padding_statement.output_section == output_section)
4525 /* Use the existing pad statement. */
4527 else if ((pad = *ptr) != NULL
4528 && pad->header.type == lang_padding_statement_enum
4529 && pad->padding_statement.output_section == output_section)
4531 /* Use the existing pad statement. */
4535 /* Make a new padding statement, linked into existing chain. */
4536 pad = (lang_statement_union_type *)
4537 stat_alloc (sizeof (lang_padding_statement_type));
4538 pad->header.next = *ptr;
4540 pad->header.type = lang_padding_statement_enum;
4541 pad->padding_statement.output_section = output_section;
4544 pad->padding_statement.fill = fill;
4546 pad->padding_statement.output_offset = dot - output_section->vma;
4547 pad->padding_statement.size = alignment_needed;
4548 output_section->size = TO_SIZE (dot + TO_ADDR (alignment_needed)
4549 - output_section->vma);
4552 /* Work out how much this section will move the dot point. */
4556 (lang_statement_union_type **this_ptr,
4557 lang_output_section_statement_type *output_section_statement,
4561 lang_input_section_type *is = &((*this_ptr)->input_section);
4562 asection *i = is->section;
4564 if (i->sec_info_type != SEC_INFO_TYPE_JUST_SYMS
4565 && (i->flags & SEC_EXCLUDE) == 0)
4567 bfd_size_type alignment_needed;
4570 /* Align this section first to the input sections requirement,
4571 then to the output section's requirement. If this alignment
4572 is greater than any seen before, then record it too. Perform
4573 the alignment by inserting a magic 'padding' statement. */
4575 if (output_section_statement->subsection_alignment != -1)
4576 i->alignment_power = output_section_statement->subsection_alignment;
4578 o = output_section_statement->bfd_section;
4579 if (o->alignment_power < i->alignment_power)
4580 o->alignment_power = i->alignment_power;
4582 alignment_needed = align_power (dot, i->alignment_power) - dot;
4584 if (alignment_needed != 0)
4586 insert_pad (this_ptr, fill, TO_SIZE (alignment_needed), o, dot);
4587 dot += alignment_needed;
4590 /* Remember where in the output section this input section goes. */
4592 i->output_offset = dot - o->vma;
4594 /* Mark how big the output section must be to contain this now. */
4595 dot += TO_ADDR (i->size);
4596 o->size = TO_SIZE (dot - o->vma);
4600 i->output_offset = i->vma - output_section_statement->bfd_section->vma;
4607 sort_sections_by_lma (const void *arg1, const void *arg2)
4609 const asection *sec1 = *(const asection **) arg1;
4610 const asection *sec2 = *(const asection **) arg2;
4612 if (bfd_section_lma (sec1->owner, sec1)
4613 < bfd_section_lma (sec2->owner, sec2))
4615 else if (bfd_section_lma (sec1->owner, sec1)
4616 > bfd_section_lma (sec2->owner, sec2))
4618 else if (sec1->id < sec2->id)
4620 else if (sec1->id > sec2->id)
4626 #define IGNORE_SECTION(s) \
4627 ((s->flags & SEC_ALLOC) == 0 \
4628 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
4629 && (s->flags & SEC_LOAD) == 0))
4631 /* Check to see if any allocated sections overlap with other allocated
4632 sections. This can happen if a linker script specifies the output
4633 section addresses of the two sections. Also check whether any memory
4634 region has overflowed. */
4637 lang_check_section_addresses (void)
4640 asection **sections, **spp;
4647 lang_memory_region_type *m;
4649 if (bfd_count_sections (link_info.output_bfd) <= 1)
4652 amt = bfd_count_sections (link_info.output_bfd) * sizeof (asection *);
4653 sections = (asection **) xmalloc (amt);
4655 /* Scan all sections in the output list. */
4657 for (s = link_info.output_bfd->sections; s != NULL; s = s->next)
4659 /* Only consider loadable sections with real contents. */
4660 if (!(s->flags & SEC_LOAD)
4661 || !(s->flags & SEC_ALLOC)
4665 sections[count] = s;
4672 qsort (sections, (size_t) count, sizeof (asection *),
4673 sort_sections_by_lma);
4678 s_end = s_start + TO_ADDR (s->size) - 1;
4679 for (count--; count; count--)
4681 /* We must check the sections' LMA addresses not their VMA
4682 addresses because overlay sections can have overlapping VMAs
4683 but they must have distinct LMAs. */
4689 s_end = s_start + TO_ADDR (s->size) - 1;
4691 /* Look for an overlap. We have sorted sections by lma, so we
4692 know that s_start >= p_start. Besides the obvious case of
4693 overlap when the current section starts before the previous
4694 one ends, we also must have overlap if the previous section
4695 wraps around the address space. */
4696 if (s_start <= p_end
4698 einfo (_("%X%P: section %s loaded at [%V,%V] overlaps section %s loaded at [%V,%V]\n"),
4699 s->name, s_start, s_end, p->name, p_start, p_end);
4704 /* If any memory region has overflowed, report by how much.
4705 We do not issue this diagnostic for regions that had sections
4706 explicitly placed outside their bounds; os_region_check's
4707 diagnostics are adequate for that case.
4709 FIXME: It is conceivable that m->current - (m->origin + m->length)
4710 might overflow a 32-bit integer. There is, alas, no way to print
4711 a bfd_vma quantity in decimal. */
4712 for (m = lang_memory_region_list; m; m = m->next)
4713 if (m->had_full_message)
4714 einfo (_("%X%P: region `%s' overflowed by %ld bytes\n"),
4715 m->name_list.name, (long)(m->current - (m->origin + m->length)));
4719 /* Make sure the new address is within the region. We explicitly permit the
4720 current address to be at the exact end of the region when the address is
4721 non-zero, in case the region is at the end of addressable memory and the
4722 calculation wraps around. */
4725 os_region_check (lang_output_section_statement_type *os,
4726 lang_memory_region_type *region,
4730 if ((region->current < region->origin
4731 || (region->current - region->origin > region->length))
4732 && ((region->current != region->origin + region->length)
4737 einfo (_("%X%P: address 0x%v of %B section `%s'"
4738 " is not within region `%s'\n"),
4740 os->bfd_section->owner,
4741 os->bfd_section->name,
4742 region->name_list.name);
4744 else if (!region->had_full_message)
4746 region->had_full_message = TRUE;
4748 einfo (_("%X%P: %B section `%s' will not fit in region `%s'\n"),
4749 os->bfd_section->owner,
4750 os->bfd_section->name,
4751 region->name_list.name);
4756 /* Set the sizes for all the output sections. */
4759 lang_size_sections_1
4760 (lang_statement_union_type **prev,
4761 lang_output_section_statement_type *output_section_statement,
4765 bfd_boolean check_regions)
4767 lang_statement_union_type *s;
4769 /* Size up the sections from their constituent parts. */
4770 for (s = *prev; s != NULL; s = s->header.next)
4772 switch (s->header.type)
4774 case lang_output_section_statement_enum:
4776 bfd_vma newdot, after;
4777 lang_output_section_statement_type *os;
4778 lang_memory_region_type *r;
4779 int section_alignment = 0;
4781 os = &s->output_section_statement;
4782 if (os->constraint == -1)
4785 /* FIXME: We shouldn't need to zero section vmas for ld -r
4786 here, in lang_insert_orphan, or in the default linker scripts.
4787 This is covering for coff backend linker bugs. See PR6945. */
4788 if (os->addr_tree == NULL
4789 && link_info.relocatable
4790 && (bfd_get_flavour (link_info.output_bfd)
4791 == bfd_target_coff_flavour))
4792 os->addr_tree = exp_intop (0);
4793 if (os->addr_tree != NULL)
4795 os->processed_vma = FALSE;
4796 exp_fold_tree (os->addr_tree, bfd_abs_section_ptr, &dot);
4798 if (expld.result.valid_p)
4800 dot = expld.result.value;
4801 if (expld.result.section != NULL)
4802 dot += expld.result.section->vma;
4804 else if (expld.phase != lang_mark_phase_enum)
4805 einfo (_("%F%S: non constant or forward reference"
4806 " address expression for section %s\n"),
4807 os->addr_tree, os->name);
4810 if (os->bfd_section == NULL)
4811 /* This section was removed or never actually created. */
4814 /* If this is a COFF shared library section, use the size and
4815 address from the input section. FIXME: This is COFF
4816 specific; it would be cleaner if there were some other way
4817 to do this, but nothing simple comes to mind. */
4818 if (((bfd_get_flavour (link_info.output_bfd)
4819 == bfd_target_ecoff_flavour)
4820 || (bfd_get_flavour (link_info.output_bfd)
4821 == bfd_target_coff_flavour))
4822 && (os->bfd_section->flags & SEC_COFF_SHARED_LIBRARY) != 0)
4826 if (os->children.head == NULL
4827 || os->children.head->header.next != NULL
4828 || (os->children.head->header.type
4829 != lang_input_section_enum))
4830 einfo (_("%P%X: Internal error on COFF shared library"
4831 " section %s\n"), os->name);
4833 input = os->children.head->input_section.section;
4834 bfd_set_section_vma (os->bfd_section->owner,
4836 bfd_section_vma (input->owner, input));
4837 os->bfd_section->size = input->size;
4842 if (bfd_is_abs_section (os->bfd_section))
4844 /* No matter what happens, an abs section starts at zero. */
4845 ASSERT (os->bfd_section->vma == 0);
4849 if (os->addr_tree == NULL)
4851 /* No address specified for this section, get one
4852 from the region specification. */
4853 if (os->region == NULL
4854 || ((os->bfd_section->flags & (SEC_ALLOC | SEC_LOAD))
4855 && os->region->name_list.name[0] == '*'
4856 && strcmp (os->region->name_list.name,
4857 DEFAULT_MEMORY_REGION) == 0))
4859 os->region = lang_memory_default (os->bfd_section);
4862 /* If a loadable section is using the default memory
4863 region, and some non default memory regions were
4864 defined, issue an error message. */
4866 && !IGNORE_SECTION (os->bfd_section)
4867 && ! link_info.relocatable
4869 && strcmp (os->region->name_list.name,
4870 DEFAULT_MEMORY_REGION) == 0
4871 && lang_memory_region_list != NULL
4872 && (strcmp (lang_memory_region_list->name_list.name,
4873 DEFAULT_MEMORY_REGION) != 0
4874 || lang_memory_region_list->next != NULL)
4875 && expld.phase != lang_mark_phase_enum)
4877 /* By default this is an error rather than just a
4878 warning because if we allocate the section to the
4879 default memory region we can end up creating an
4880 excessively large binary, or even seg faulting when
4881 attempting to perform a negative seek. See
4882 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4883 for an example of this. This behaviour can be
4884 overridden by the using the --no-check-sections
4886 if (command_line.check_section_addresses)
4887 einfo (_("%P%F: error: no memory region specified"
4888 " for loadable section `%s'\n"),
4889 bfd_get_section_name (link_info.output_bfd,
4892 einfo (_("%P: warning: no memory region specified"
4893 " for loadable section `%s'\n"),
4894 bfd_get_section_name (link_info.output_bfd,
4898 newdot = os->region->current;
4899 section_alignment = os->bfd_section->alignment_power;
4902 section_alignment = os->section_alignment;
4904 /* Align to what the section needs. */
4905 if (section_alignment > 0)
4907 bfd_vma savedot = newdot;
4908 newdot = align_power (newdot, section_alignment);
4910 if (newdot != savedot
4911 && (config.warn_section_align
4912 || os->addr_tree != NULL)
4913 && expld.phase != lang_mark_phase_enum)
4914 einfo (_("%P: warning: changing start of section"
4915 " %s by %lu bytes\n"),
4916 os->name, (unsigned long) (newdot - savedot));
4919 bfd_set_section_vma (0, os->bfd_section, newdot);
4921 os->bfd_section->output_offset = 0;
4924 lang_size_sections_1 (&os->children.head, os,
4925 os->fill, newdot, relax, check_regions);
4927 os->processed_vma = TRUE;
4929 if (bfd_is_abs_section (os->bfd_section) || os->ignored)
4930 /* Except for some special linker created sections,
4931 no output section should change from zero size
4932 after strip_excluded_output_sections. A non-zero
4933 size on an ignored section indicates that some
4934 input section was not sized early enough. */
4935 ASSERT (os->bfd_section->size == 0);
4938 dot = os->bfd_section->vma;
4940 /* Put the section within the requested block size, or
4941 align at the block boundary. */
4943 + TO_ADDR (os->bfd_section->size)
4944 + os->block_value - 1)
4945 & - (bfd_vma) os->block_value);
4947 os->bfd_section->size = TO_SIZE (after - os->bfd_section->vma);
4950 /* Set section lma. */
4953 r = lang_memory_region_lookup (DEFAULT_MEMORY_REGION, FALSE);
4957 bfd_vma lma = exp_get_abs_int (os->load_base, 0, "load base");
4958 os->bfd_section->lma = lma;
4960 else if (os->lma_region != NULL)
4962 bfd_vma lma = os->lma_region->current;
4964 if (section_alignment > 0)
4965 lma = align_power (lma, section_alignment);
4966 os->bfd_section->lma = lma;
4968 else if (r->last_os != NULL
4969 && (os->bfd_section->flags & SEC_ALLOC) != 0)
4974 last = r->last_os->output_section_statement.bfd_section;
4976 /* A backwards move of dot should be accompanied by
4977 an explicit assignment to the section LMA (ie.
4978 os->load_base set) because backwards moves can
4979 create overlapping LMAs. */
4981 && os->bfd_section->size != 0
4982 && dot + os->bfd_section->size <= last->vma)
4984 /* If dot moved backwards then leave lma equal to
4985 vma. This is the old default lma, which might
4986 just happen to work when the backwards move is
4987 sufficiently large. Nag if this changes anything,
4988 so people can fix their linker scripts. */
4990 if (last->vma != last->lma)
4991 einfo (_("%P: warning: dot moved backwards before `%s'\n"),
4996 /* If this is an overlay, set the current lma to that
4997 at the end of the previous section. */
4998 if (os->sectype == overlay_section)
4999 lma = last->lma + last->size;
5001 /* Otherwise, keep the same lma to vma relationship
5002 as the previous section. */
5004 lma = dot + last->lma - last->vma;
5006 if (section_alignment > 0)
5007 lma = align_power (lma, section_alignment);
5008 os->bfd_section->lma = lma;
5011 os->processed_lma = TRUE;
5013 if (bfd_is_abs_section (os->bfd_section) || os->ignored)
5016 /* Keep track of normal sections using the default
5017 lma region. We use this to set the lma for
5018 following sections. Overlays or other linker
5019 script assignment to lma might mean that the
5020 default lma == vma is incorrect.
5021 To avoid warnings about dot moving backwards when using
5022 -Ttext, don't start tracking sections until we find one
5023 of non-zero size or with lma set differently to vma. */
5024 if (((os->bfd_section->flags & SEC_HAS_CONTENTS) != 0
5025 || (os->bfd_section->flags & SEC_THREAD_LOCAL) == 0)
5026 && (os->bfd_section->flags & SEC_ALLOC) != 0
5027 && (os->bfd_section->size != 0
5028 || (r->last_os == NULL
5029 && os->bfd_section->vma != os->bfd_section->lma)
5030 || (r->last_os != NULL
5031 && dot >= (r->last_os->output_section_statement
5032 .bfd_section->vma)))
5033 && os->lma_region == NULL
5034 && !link_info.relocatable)
5037 /* .tbss sections effectively have zero size. */
5038 if ((os->bfd_section->flags & SEC_HAS_CONTENTS) != 0
5039 || (os->bfd_section->flags & SEC_THREAD_LOCAL) == 0
5040 || link_info.relocatable)
5041 dot += TO_ADDR (os->bfd_section->size);
5043 if (os->update_dot_tree != 0)
5044 exp_fold_tree (os->update_dot_tree, bfd_abs_section_ptr, &dot);
5046 /* Update dot in the region ?
5047 We only do this if the section is going to be allocated,
5048 since unallocated sections do not contribute to the region's
5049 overall size in memory. */
5050 if (os->region != NULL
5051 && (os->bfd_section->flags & (SEC_ALLOC | SEC_LOAD)))
5053 os->region->current = dot;
5056 /* Make sure the new address is within the region. */
5057 os_region_check (os, os->region, os->addr_tree,
5058 os->bfd_section->vma);
5060 if (os->lma_region != NULL && os->lma_region != os->region
5061 && (os->bfd_section->flags & SEC_LOAD))
5063 os->lma_region->current
5064 = os->bfd_section->lma + TO_ADDR (os->bfd_section->size);
5067 os_region_check (os, os->lma_region, NULL,
5068 os->bfd_section->lma);
5074 case lang_constructors_statement_enum:
5075 dot = lang_size_sections_1 (&constructor_list.head,
5076 output_section_statement,
5077 fill, dot, relax, check_regions);
5080 case lang_data_statement_enum:
5082 unsigned int size = 0;
5084 s->data_statement.output_offset =
5085 dot - output_section_statement->bfd_section->vma;
5086 s->data_statement.output_section =
5087 output_section_statement->bfd_section;
5089 /* We might refer to provided symbols in the expression, and
5090 need to mark them as needed. */
5091 exp_fold_tree (s->data_statement.exp, bfd_abs_section_ptr, &dot);
5093 switch (s->data_statement.type)
5111 if (size < TO_SIZE ((unsigned) 1))
5112 size = TO_SIZE ((unsigned) 1);
5113 dot += TO_ADDR (size);
5114 output_section_statement->bfd_section->size
5115 = TO_SIZE (dot - output_section_statement->bfd_section->vma);
5120 case lang_reloc_statement_enum:
5124 s->reloc_statement.output_offset =
5125 dot - output_section_statement->bfd_section->vma;
5126 s->reloc_statement.output_section =
5127 output_section_statement->bfd_section;
5128 size = bfd_get_reloc_size (s->reloc_statement.howto);
5129 dot += TO_ADDR (size);
5130 output_section_statement->bfd_section->size
5131 = TO_SIZE (dot - output_section_statement->bfd_section->vma);
5135 case lang_wild_statement_enum:
5136 dot = lang_size_sections_1 (&s->wild_statement.children.head,
5137 output_section_statement,
5138 fill, dot, relax, check_regions);
5141 case lang_object_symbols_statement_enum:
5142 link_info.create_object_symbols_section =
5143 output_section_statement->bfd_section;
5146 case lang_output_statement_enum:
5147 case lang_target_statement_enum:
5150 case lang_input_section_enum:
5154 i = s->input_section.section;
5159 if (! bfd_relax_section (i->owner, i, &link_info, &again))
5160 einfo (_("%P%F: can't relax section: %E\n"));
5164 dot = size_input_section (prev, output_section_statement,
5165 output_section_statement->fill, dot);
5169 case lang_input_statement_enum:
5172 case lang_fill_statement_enum:
5173 s->fill_statement.output_section =
5174 output_section_statement->bfd_section;
5176 fill = s->fill_statement.fill;
5179 case lang_assignment_statement_enum:
5181 bfd_vma newdot = dot;
5182 etree_type *tree = s->assignment_statement.exp;
5184 expld.dataseg.relro = exp_dataseg_relro_none;
5186 exp_fold_tree (tree,
5187 output_section_statement->bfd_section,
5190 if (expld.dataseg.relro == exp_dataseg_relro_start)
5192 if (!expld.dataseg.relro_start_stat)
5193 expld.dataseg.relro_start_stat = s;
5196 ASSERT (expld.dataseg.relro_start_stat == s);
5199 else if (expld.dataseg.relro == exp_dataseg_relro_end)
5201 if (!expld.dataseg.relro_end_stat)
5202 expld.dataseg.relro_end_stat = s;
5205 ASSERT (expld.dataseg.relro_end_stat == s);
5208 expld.dataseg.relro = exp_dataseg_relro_none;
5210 /* This symbol may be relative to this section. */
5211 if ((tree->type.node_class == etree_provided
5212 || tree->type.node_class == etree_assign)
5213 && (tree->assign.dst [0] != '.'
5214 || tree->assign.dst [1] != '\0'))
5215 output_section_statement->update_dot = 1;
5217 if (!output_section_statement->ignored)
5219 if (output_section_statement == abs_output_section)
5221 /* If we don't have an output section, then just adjust
5222 the default memory address. */
5223 lang_memory_region_lookup (DEFAULT_MEMORY_REGION,
5224 FALSE)->current = newdot;
5226 else if (newdot != dot)
5228 /* Insert a pad after this statement. We can't
5229 put the pad before when relaxing, in case the
5230 assignment references dot. */
5231 insert_pad (&s->header.next, fill, TO_SIZE (newdot - dot),
5232 output_section_statement->bfd_section, dot);
5234 /* Don't neuter the pad below when relaxing. */
5237 /* If dot is advanced, this implies that the section
5238 should have space allocated to it, unless the
5239 user has explicitly stated that the section
5240 should not be allocated. */
5241 if (output_section_statement->sectype != noalloc_section
5242 && (output_section_statement->sectype != noload_section
5243 || (bfd_get_flavour (link_info.output_bfd)
5244 == bfd_target_elf_flavour)))
5245 output_section_statement->bfd_section->flags |= SEC_ALLOC;
5252 case lang_padding_statement_enum:
5253 /* If this is the first time lang_size_sections is called,
5254 we won't have any padding statements. If this is the
5255 second or later passes when relaxing, we should allow
5256 padding to shrink. If padding is needed on this pass, it
5257 will be added back in. */
5258 s->padding_statement.size = 0;
5260 /* Make sure output_offset is valid. If relaxation shrinks
5261 the section and this pad isn't needed, it's possible to
5262 have output_offset larger than the final size of the
5263 section. bfd_set_section_contents will complain even for
5264 a pad size of zero. */
5265 s->padding_statement.output_offset
5266 = dot - output_section_statement->bfd_section->vma;
5269 case lang_group_statement_enum:
5270 dot = lang_size_sections_1 (&s->group_statement.children.head,
5271 output_section_statement,
5272 fill, dot, relax, check_regions);
5275 case lang_insert_statement_enum:
5278 /* We can only get here when relaxing is turned on. */
5279 case lang_address_statement_enum:
5286 prev = &s->header.next;
5291 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
5292 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
5293 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
5294 segments. We are allowed an opportunity to override this decision. */
5297 ldlang_override_segment_assignment (struct bfd_link_info * info ATTRIBUTE_UNUSED,
5298 bfd * abfd ATTRIBUTE_UNUSED,
5299 asection * current_section,
5300 asection * previous_section,
5301 bfd_boolean new_segment)
5303 lang_output_section_statement_type * cur;
5304 lang_output_section_statement_type * prev;
5306 /* The checks below are only necessary when the BFD library has decided
5307 that the two sections ought to be placed into the same segment. */
5311 /* Paranoia checks. */
5312 if (current_section == NULL || previous_section == NULL)
5315 /* If this flag is set, the target never wants code and non-code
5316 sections comingled in the same segment. */
5317 if (config.separate_code
5318 && ((current_section->flags ^ previous_section->flags) & SEC_CODE))
5321 /* Find the memory regions associated with the two sections.
5322 We call lang_output_section_find() here rather than scanning the list
5323 of output sections looking for a matching section pointer because if
5324 we have a large number of sections then a hash lookup is faster. */
5325 cur = lang_output_section_find (current_section->name);
5326 prev = lang_output_section_find (previous_section->name);
5328 /* More paranoia. */
5329 if (cur == NULL || prev == NULL)
5332 /* If the regions are different then force the sections to live in
5333 different segments. See the email thread starting at the following
5334 URL for the reasons why this is necessary:
5335 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
5336 return cur->region != prev->region;
5340 one_lang_size_sections_pass (bfd_boolean *relax, bfd_boolean check_regions)
5342 lang_statement_iteration++;
5343 lang_size_sections_1 (&statement_list.head, abs_output_section,
5344 0, 0, relax, check_regions);
5348 lang_size_sections (bfd_boolean *relax, bfd_boolean check_regions)
5350 expld.phase = lang_allocating_phase_enum;
5351 expld.dataseg.phase = exp_dataseg_none;
5353 one_lang_size_sections_pass (relax, check_regions);
5354 if (expld.dataseg.phase == exp_dataseg_end_seen
5355 && link_info.relro && expld.dataseg.relro_end)
5357 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
5358 to put expld.dataseg.relro on a (common) page boundary. */
5359 bfd_vma min_base, old_base, relro_end, maxpage;
5361 expld.dataseg.phase = exp_dataseg_relro_adjust;
5362 maxpage = expld.dataseg.maxpagesize;
5363 /* MIN_BASE is the absolute minimum address we are allowed to start the
5364 read-write segment (byte before will be mapped read-only). */
5365 min_base = (expld.dataseg.min_base + maxpage - 1) & ~(maxpage - 1);
5366 /* OLD_BASE is the address for a feasible minimum address which will
5367 still not cause a data overlap inside MAXPAGE causing file offset skip
5369 old_base = expld.dataseg.base;
5370 expld.dataseg.base += (-expld.dataseg.relro_end
5371 & (expld.dataseg.pagesize - 1));
5372 /* Compute the expected PT_GNU_RELRO segment end. */
5373 relro_end = ((expld.dataseg.relro_end + expld.dataseg.pagesize - 1)
5374 & ~(expld.dataseg.pagesize - 1));
5375 if (min_base + maxpage < expld.dataseg.base)
5377 expld.dataseg.base -= maxpage;
5378 relro_end -= maxpage;
5380 lang_reset_memory_regions ();
5381 one_lang_size_sections_pass (relax, check_regions);
5382 if (expld.dataseg.relro_end > relro_end)
5384 /* The alignment of sections between DATA_SEGMENT_ALIGN
5385 and DATA_SEGMENT_RELRO_END caused huge padding to be
5386 inserted at DATA_SEGMENT_RELRO_END. Try to start a bit lower so
5387 that the section alignments will fit in. */
5389 unsigned int max_alignment_power = 0;
5391 /* Find maximum alignment power of sections between
5392 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
5393 for (sec = link_info.output_bfd->sections; sec; sec = sec->next)
5394 if (sec->vma >= expld.dataseg.base
5395 && sec->vma < expld.dataseg.relro_end
5396 && sec->alignment_power > max_alignment_power)
5397 max_alignment_power = sec->alignment_power;
5399 if (((bfd_vma) 1 << max_alignment_power) < expld.dataseg.pagesize)
5401 if (expld.dataseg.base - (1 << max_alignment_power) < old_base)
5402 expld.dataseg.base += expld.dataseg.pagesize;
5403 expld.dataseg.base -= (1 << max_alignment_power);
5404 lang_reset_memory_regions ();
5405 one_lang_size_sections_pass (relax, check_regions);
5408 link_info.relro_start = expld.dataseg.base;
5409 link_info.relro_end = expld.dataseg.relro_end;
5411 else if (expld.dataseg.phase == exp_dataseg_end_seen)
5413 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
5414 a page could be saved in the data segment. */
5415 bfd_vma first, last;
5417 first = -expld.dataseg.base & (expld.dataseg.pagesize - 1);
5418 last = expld.dataseg.end & (expld.dataseg.pagesize - 1);
5420 && ((expld.dataseg.base & ~(expld.dataseg.pagesize - 1))
5421 != (expld.dataseg.end & ~(expld.dataseg.pagesize - 1)))
5422 && first + last <= expld.dataseg.pagesize)
5424 expld.dataseg.phase = exp_dataseg_adjust;
5425 lang_reset_memory_regions ();
5426 one_lang_size_sections_pass (relax, check_regions);
5429 expld.dataseg.phase = exp_dataseg_done;
5432 expld.dataseg.phase = exp_dataseg_done;
5435 static lang_output_section_statement_type *current_section;
5436 static lang_assignment_statement_type *current_assign;
5437 static bfd_boolean prefer_next_section;
5439 /* Worker function for lang_do_assignments. Recursiveness goes here. */
5442 lang_do_assignments_1 (lang_statement_union_type *s,
5443 lang_output_section_statement_type *current_os,
5446 bfd_boolean *found_end)
5448 for (; s != NULL; s = s->header.next)
5450 switch (s->header.type)
5452 case lang_constructors_statement_enum:
5453 dot = lang_do_assignments_1 (constructor_list.head,
5454 current_os, fill, dot, found_end);
5457 case lang_output_section_statement_enum:
5459 lang_output_section_statement_type *os;
5461 os = &(s->output_section_statement);
5462 os->after_end = *found_end;
5463 if (os->bfd_section != NULL && !os->ignored)
5465 if ((os->bfd_section->flags & SEC_ALLOC) != 0)
5467 current_section = os;
5468 prefer_next_section = FALSE;
5470 dot = os->bfd_section->vma;
5472 lang_do_assignments_1 (os->children.head,
5473 os, os->fill, dot, found_end);
5475 /* .tbss sections effectively have zero size. */
5476 if ((os->bfd_section->flags & SEC_HAS_CONTENTS) != 0
5477 || (os->bfd_section->flags & SEC_THREAD_LOCAL) == 0
5478 || link_info.relocatable)
5479 dot += TO_ADDR (os->bfd_section->size);
5481 if (os->update_dot_tree != NULL)
5482 exp_fold_tree (os->update_dot_tree, bfd_abs_section_ptr, &dot);
5487 case lang_wild_statement_enum:
5489 dot = lang_do_assignments_1 (s->wild_statement.children.head,
5490 current_os, fill, dot, found_end);
5493 case lang_object_symbols_statement_enum:
5494 case lang_output_statement_enum:
5495 case lang_target_statement_enum:
5498 case lang_data_statement_enum:
5499 exp_fold_tree (s->data_statement.exp, bfd_abs_section_ptr, &dot);
5500 if (expld.result.valid_p)
5502 s->data_statement.value = expld.result.value;
5503 if (expld.result.section != NULL)
5504 s->data_statement.value += expld.result.section->vma;
5507 einfo (_("%F%P: invalid data statement\n"));
5510 switch (s->data_statement.type)
5528 if (size < TO_SIZE ((unsigned) 1))
5529 size = TO_SIZE ((unsigned) 1);
5530 dot += TO_ADDR (size);
5534 case lang_reloc_statement_enum:
5535 exp_fold_tree (s->reloc_statement.addend_exp,
5536 bfd_abs_section_ptr, &dot);
5537 if (expld.result.valid_p)
5538 s->reloc_statement.addend_value = expld.result.value;
5540 einfo (_("%F%P: invalid reloc statement\n"));
5541 dot += TO_ADDR (bfd_get_reloc_size (s->reloc_statement.howto));
5544 case lang_input_section_enum:
5546 asection *in = s->input_section.section;
5548 if ((in->flags & SEC_EXCLUDE) == 0)
5549 dot += TO_ADDR (in->size);
5553 case lang_input_statement_enum:
5556 case lang_fill_statement_enum:
5557 fill = s->fill_statement.fill;
5560 case lang_assignment_statement_enum:
5561 current_assign = &s->assignment_statement;
5562 if (current_assign->exp->type.node_class != etree_assert)
5564 const char *p = current_assign->exp->assign.dst;
5566 if (current_os == abs_output_section && p[0] == '.' && p[1] == 0)
5567 prefer_next_section = TRUE;
5571 if (strcmp (p, "end") == 0)
5574 exp_fold_tree (s->assignment_statement.exp,
5575 current_os->bfd_section,
5579 case lang_padding_statement_enum:
5580 dot += TO_ADDR (s->padding_statement.size);
5583 case lang_group_statement_enum:
5584 dot = lang_do_assignments_1 (s->group_statement.children.head,
5585 current_os, fill, dot, found_end);
5588 case lang_insert_statement_enum:
5591 case lang_address_statement_enum:
5603 lang_do_assignments (lang_phase_type phase)
5605 bfd_boolean found_end = FALSE;
5607 current_section = NULL;
5608 prefer_next_section = FALSE;
5609 expld.phase = phase;
5610 lang_statement_iteration++;
5611 lang_do_assignments_1 (statement_list.head,
5612 abs_output_section, NULL, 0, &found_end);
5615 /* For an assignment statement outside of an output section statement,
5616 choose the best of neighbouring output sections to use for values
5620 section_for_dot (void)
5624 /* Assignments belong to the previous output section, unless there
5625 has been an assignment to "dot", in which case following
5626 assignments belong to the next output section. (The assumption
5627 is that an assignment to "dot" is setting up the address for the
5628 next output section.) Except that past the assignment to "_end"
5629 we always associate with the previous section. This exception is
5630 for targets like SH that define an alloc .stack or other
5631 weirdness after non-alloc sections. */
5632 if (current_section == NULL || prefer_next_section)
5634 lang_statement_union_type *stmt;
5635 lang_output_section_statement_type *os;
5637 for (stmt = (lang_statement_union_type *) current_assign;
5639 stmt = stmt->header.next)
5640 if (stmt->header.type == lang_output_section_statement_enum)
5643 os = &stmt->output_section_statement;
5646 && (os->bfd_section == NULL
5647 || (os->bfd_section->flags & SEC_EXCLUDE) != 0
5648 || bfd_section_removed_from_list (link_info.output_bfd,
5652 if (current_section == NULL || os == NULL || !os->after_end)
5655 s = os->bfd_section;
5657 s = link_info.output_bfd->section_last;
5659 && ((s->flags & SEC_ALLOC) == 0
5660 || (s->flags & SEC_THREAD_LOCAL) != 0))
5665 return bfd_abs_section_ptr;
5669 s = current_section->bfd_section;
5671 /* The section may have been stripped. */
5673 && ((s->flags & SEC_EXCLUDE) != 0
5674 || (s->flags & SEC_ALLOC) == 0
5675 || (s->flags & SEC_THREAD_LOCAL) != 0
5676 || bfd_section_removed_from_list (link_info.output_bfd, s)))
5679 s = link_info.output_bfd->sections;
5681 && ((s->flags & SEC_ALLOC) == 0
5682 || (s->flags & SEC_THREAD_LOCAL) != 0))
5687 return bfd_abs_section_ptr;
5690 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
5691 operator .startof. (section_name), it produces an undefined symbol
5692 .startof.section_name. Similarly, when it sees
5693 .sizeof. (section_name), it produces an undefined symbol
5694 .sizeof.section_name. For all the output sections, we look for
5695 such symbols, and set them to the correct value. */
5698 lang_set_startof (void)
5702 if (link_info.relocatable)
5705 for (s = link_info.output_bfd->sections; s != NULL; s = s->next)
5707 const char *secname;
5709 struct bfd_link_hash_entry *h;
5711 secname = bfd_get_section_name (link_info.output_bfd, s);
5712 buf = (char *) xmalloc (10 + strlen (secname));
5714 sprintf (buf, ".startof.%s", secname);
5715 h = bfd_link_hash_lookup (link_info.hash, buf, FALSE, FALSE, TRUE);
5716 if (h != NULL && h->type == bfd_link_hash_undefined)
5718 h->type = bfd_link_hash_defined;
5720 h->u.def.section = s;
5723 sprintf (buf, ".sizeof.%s", secname);
5724 h = bfd_link_hash_lookup (link_info.hash, buf, FALSE, FALSE, TRUE);
5725 if (h != NULL && h->type == bfd_link_hash_undefined)
5727 h->type = bfd_link_hash_defined;
5728 h->u.def.value = TO_ADDR (s->size);
5729 h->u.def.section = bfd_abs_section_ptr;
5739 struct bfd_link_hash_entry *h;
5742 if ((link_info.relocatable && !link_info.gc_sections)
5743 || (link_info.shared && !link_info.executable))
5744 warn = entry_from_cmdline;
5748 /* Force the user to specify a root when generating a relocatable with
5750 if (link_info.gc_sections && link_info.relocatable
5751 && !(entry_from_cmdline || undef_from_cmdline))
5752 einfo (_("%P%F: gc-sections requires either an entry or "
5753 "an undefined symbol\n"));
5755 if (entry_symbol.name == NULL)
5757 /* No entry has been specified. Look for the default entry, but
5758 don't warn if we don't find it. */
5759 entry_symbol.name = entry_symbol_default;
5763 h = bfd_link_hash_lookup (link_info.hash, entry_symbol.name,
5764 FALSE, FALSE, TRUE);
5766 && (h->type == bfd_link_hash_defined
5767 || h->type == bfd_link_hash_defweak)
5768 && h->u.def.section->output_section != NULL)
5772 val = (h->u.def.value
5773 + bfd_get_section_vma (link_info.output_bfd,
5774 h->u.def.section->output_section)
5775 + h->u.def.section->output_offset);
5776 if (! bfd_set_start_address (link_info.output_bfd, val))
5777 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol.name);
5784 /* We couldn't find the entry symbol. Try parsing it as a
5786 val = bfd_scan_vma (entry_symbol.name, &send, 0);
5789 if (! bfd_set_start_address (link_info.output_bfd, val))
5790 einfo (_("%P%F: can't set start address\n"));
5796 /* Can't find the entry symbol, and it's not a number. Use
5797 the first address in the text section. */
5798 ts = bfd_get_section_by_name (link_info.output_bfd, entry_section);
5802 einfo (_("%P: warning: cannot find entry symbol %s;"
5803 " defaulting to %V\n"),
5805 bfd_get_section_vma (link_info.output_bfd, ts));
5806 if (!(bfd_set_start_address
5807 (link_info.output_bfd,
5808 bfd_get_section_vma (link_info.output_bfd, ts))))
5809 einfo (_("%P%F: can't set start address\n"));
5814 einfo (_("%P: warning: cannot find entry symbol %s;"
5815 " not setting start address\n"),
5821 /* Don't bfd_hash_table_free (&lang_definedness_table);
5822 map file output may result in a call of lang_track_definedness. */
5825 /* This is a small function used when we want to ignore errors from
5829 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED, ...)
5831 /* Don't do anything. */
5834 /* Check that the architecture of all the input files is compatible
5835 with the output file. Also call the backend to let it do any
5836 other checking that is needed. */
5841 lang_statement_union_type *file;
5843 const bfd_arch_info_type *compatible;
5845 for (file = file_chain.head; file != NULL; file = file->input_statement.next)
5847 #ifdef ENABLE_PLUGINS
5848 /* Don't check format of files claimed by plugin. */
5849 if (file->input_statement.flags.claimed)
5851 #endif /* ENABLE_PLUGINS */
5852 input_bfd = file->input_statement.the_bfd;
5854 = bfd_arch_get_compatible (input_bfd, link_info.output_bfd,
5855 command_line.accept_unknown_input_arch);
5857 /* In general it is not possible to perform a relocatable
5858 link between differing object formats when the input
5859 file has relocations, because the relocations in the
5860 input format may not have equivalent representations in
5861 the output format (and besides BFD does not translate
5862 relocs for other link purposes than a final link). */
5863 if ((link_info.relocatable || link_info.emitrelocations)
5864 && (compatible == NULL
5865 || (bfd_get_flavour (input_bfd)
5866 != bfd_get_flavour (link_info.output_bfd)))
5867 && (bfd_get_file_flags (input_bfd) & HAS_RELOC) != 0)
5869 einfo (_("%P%F: Relocatable linking with relocations from"
5870 " format %s (%B) to format %s (%B) is not supported\n"),
5871 bfd_get_target (input_bfd), input_bfd,
5872 bfd_get_target (link_info.output_bfd), link_info.output_bfd);
5873 /* einfo with %F exits. */
5876 if (compatible == NULL)
5878 if (command_line.warn_mismatch)
5879 einfo (_("%P%X: %s architecture of input file `%B'"
5880 " is incompatible with %s output\n"),
5881 bfd_printable_name (input_bfd), input_bfd,
5882 bfd_printable_name (link_info.output_bfd));
5884 else if (bfd_count_sections (input_bfd))
5886 /* If the input bfd has no contents, it shouldn't set the
5887 private data of the output bfd. */
5889 bfd_error_handler_type pfn = NULL;
5891 /* If we aren't supposed to warn about mismatched input
5892 files, temporarily set the BFD error handler to a
5893 function which will do nothing. We still want to call
5894 bfd_merge_private_bfd_data, since it may set up
5895 information which is needed in the output file. */
5896 if (! command_line.warn_mismatch)
5897 pfn = bfd_set_error_handler (ignore_bfd_errors);
5898 if (! bfd_merge_private_bfd_data (input_bfd, link_info.output_bfd))
5900 if (command_line.warn_mismatch)
5901 einfo (_("%P%X: failed to merge target specific data"
5902 " of file %B\n"), input_bfd);
5904 if (! command_line.warn_mismatch)
5905 bfd_set_error_handler (pfn);
5910 /* Look through all the global common symbols and attach them to the
5911 correct section. The -sort-common command line switch may be used
5912 to roughly sort the entries by alignment. */
5917 if (command_line.inhibit_common_definition)
5919 if (link_info.relocatable
5920 && ! command_line.force_common_definition)
5923 if (! config.sort_common)
5924 bfd_link_hash_traverse (link_info.hash, lang_one_common, NULL);
5929 if (config.sort_common == sort_descending)
5931 for (power = 4; power > 0; power--)
5932 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
5935 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
5939 for (power = 0; power <= 4; power++)
5940 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
5943 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
5948 /* Place one common symbol in the correct section. */
5951 lang_one_common (struct bfd_link_hash_entry *h, void *info)
5953 unsigned int power_of_two;
5957 if (h->type != bfd_link_hash_common)
5961 power_of_two = h->u.c.p->alignment_power;
5963 if (config.sort_common == sort_descending
5964 && power_of_two < *(unsigned int *) info)
5966 else if (config.sort_common == sort_ascending
5967 && power_of_two > *(unsigned int *) info)
5970 section = h->u.c.p->section;
5971 if (!bfd_define_common_symbol (link_info.output_bfd, &link_info, h))
5972 einfo (_("%P%F: Could not define common symbol `%T': %E\n"),
5975 if (config.map_file != NULL)
5977 static bfd_boolean header_printed;
5982 if (! header_printed)
5984 minfo (_("\nAllocating common symbols\n"));
5985 minfo (_("Common symbol size file\n\n"));
5986 header_printed = TRUE;
5989 name = bfd_demangle (link_info.output_bfd, h->root.string,
5990 DMGL_ANSI | DMGL_PARAMS);
5993 minfo ("%s", h->root.string);
5994 len = strlen (h->root.string);
5999 len = strlen (name);
6015 if (size <= 0xffffffff)
6016 sprintf (buf, "%lx", (unsigned long) size);
6018 sprintf_vma (buf, size);
6028 minfo ("%B\n", section->owner);
6034 /* Run through the input files and ensure that every input section has
6035 somewhere to go. If one is found without a destination then create
6036 an input request and place it into the statement tree. */
6039 lang_place_orphans (void)
6041 LANG_FOR_EACH_INPUT_STATEMENT (file)
6045 for (s = file->the_bfd->sections; s != NULL; s = s->next)
6047 if (s->output_section == NULL)
6049 /* This section of the file is not attached, root
6050 around for a sensible place for it to go. */
6052 if (file->flags.just_syms)
6053 bfd_link_just_syms (file->the_bfd, s, &link_info);
6054 else if ((s->flags & SEC_EXCLUDE) != 0)
6055 s->output_section = bfd_abs_section_ptr;
6056 else if (strcmp (s->name, "COMMON") == 0)
6058 /* This is a lonely common section which must have
6059 come from an archive. We attach to the section
6060 with the wildcard. */
6061 if (! link_info.relocatable
6062 || command_line.force_common_definition)
6064 if (default_common_section == NULL)
6065 default_common_section
6066 = lang_output_section_statement_lookup (".bss", 0,
6068 lang_add_section (&default_common_section->children, s,
6069 NULL, default_common_section);
6074 const char *name = s->name;
6077 if (config.unique_orphan_sections
6078 || unique_section_p (s, NULL))
6079 constraint = SPECIAL;
6081 if (!ldemul_place_orphan (s, name, constraint))
6083 lang_output_section_statement_type *os;
6084 os = lang_output_section_statement_lookup (name,
6087 if (os->addr_tree == NULL
6088 && (link_info.relocatable
6089 || (s->flags & (SEC_LOAD | SEC_ALLOC)) == 0))
6090 os->addr_tree = exp_intop (0);
6091 lang_add_section (&os->children, s, NULL, os);
6100 lang_set_flags (lang_memory_region_type *ptr, const char *flags, int invert)
6102 flagword *ptr_flags;
6104 ptr_flags = invert ? &ptr->not_flags : &ptr->flags;
6110 *ptr_flags |= SEC_ALLOC;
6114 *ptr_flags |= SEC_READONLY;
6118 *ptr_flags |= SEC_DATA;
6122 *ptr_flags |= SEC_CODE;
6127 *ptr_flags |= SEC_LOAD;
6131 einfo (_("%P%F: invalid syntax in flags\n"));
6138 /* Call a function on each input file. This function will be called
6139 on an archive, but not on the elements. */
6142 lang_for_each_input_file (void (*func) (lang_input_statement_type *))
6144 lang_input_statement_type *f;
6146 for (f = (lang_input_statement_type *) input_file_chain.head;
6148 f = (lang_input_statement_type *) f->next_real_file)
6152 /* Call a function on each file. The function will be called on all
6153 the elements of an archive which are included in the link, but will
6154 not be called on the archive file itself. */
6157 lang_for_each_file (void (*func) (lang_input_statement_type *))
6159 LANG_FOR_EACH_INPUT_STATEMENT (f)
6166 ldlang_add_file (lang_input_statement_type *entry)
6168 lang_statement_append (&file_chain,
6169 (lang_statement_union_type *) entry,
6172 /* The BFD linker needs to have a list of all input BFDs involved in
6174 ASSERT (entry->the_bfd->link_next == NULL);
6175 ASSERT (entry->the_bfd != link_info.output_bfd);
6177 *link_info.input_bfds_tail = entry->the_bfd;
6178 link_info.input_bfds_tail = &entry->the_bfd->link_next;
6179 entry->the_bfd->usrdata = entry;
6180 bfd_set_gp_size (entry->the_bfd, g_switch_value);
6182 /* Look through the sections and check for any which should not be
6183 included in the link. We need to do this now, so that we can
6184 notice when the backend linker tries to report multiple
6185 definition errors for symbols which are in sections we aren't
6186 going to link. FIXME: It might be better to entirely ignore
6187 symbols which are defined in sections which are going to be
6188 discarded. This would require modifying the backend linker for
6189 each backend which might set the SEC_LINK_ONCE flag. If we do
6190 this, we should probably handle SEC_EXCLUDE in the same way. */
6192 bfd_map_over_sections (entry->the_bfd, section_already_linked, entry);
6196 lang_add_output (const char *name, int from_script)
6198 /* Make -o on command line override OUTPUT in script. */
6199 if (!had_output_filename || !from_script)
6201 output_filename = name;
6202 had_output_filename = TRUE;
6215 for (l = 0; l < 32; l++)
6217 if (i >= (unsigned int) x)
6225 lang_output_section_statement_type *
6226 lang_enter_output_section_statement (const char *output_section_statement_name,
6227 etree_type *address_exp,
6228 enum section_type sectype,
6230 etree_type *subalign,
6234 lang_output_section_statement_type *os;
6236 os = lang_output_section_statement_lookup (output_section_statement_name,
6238 current_section = os;
6240 if (os->addr_tree == NULL)
6242 os->addr_tree = address_exp;
6244 os->sectype = sectype;
6245 if (sectype != noload_section)
6246 os->flags = SEC_NO_FLAGS;
6248 os->flags = SEC_NEVER_LOAD;
6249 os->block_value = 1;
6251 /* Make next things chain into subchain of this. */
6252 push_stat_ptr (&os->children);
6254 os->subsection_alignment =
6255 topower (exp_get_value_int (subalign, -1, "subsection alignment"));
6256 os->section_alignment =
6257 topower (exp_get_value_int (align, -1, "section alignment"));
6259 os->load_base = ebase;
6266 lang_output_statement_type *new_stmt;
6268 new_stmt = new_stat (lang_output_statement, stat_ptr);
6269 new_stmt->name = output_filename;
6273 /* Reset the current counters in the regions. */
6276 lang_reset_memory_regions (void)
6278 lang_memory_region_type *p = lang_memory_region_list;
6280 lang_output_section_statement_type *os;
6282 for (p = lang_memory_region_list; p != NULL; p = p->next)
6284 p->current = p->origin;
6288 for (os = &lang_output_section_statement.head->output_section_statement;
6292 os->processed_vma = FALSE;
6293 os->processed_lma = FALSE;
6296 for (o = link_info.output_bfd->sections; o != NULL; o = o->next)
6298 /* Save the last size for possible use by bfd_relax_section. */
6299 o->rawsize = o->size;
6304 /* Worker for lang_gc_sections_1. */
6307 gc_section_callback (lang_wild_statement_type *ptr,
6308 struct wildcard_list *sec ATTRIBUTE_UNUSED,
6310 struct flag_info *sflag_info ATTRIBUTE_UNUSED,
6311 lang_input_statement_type *file ATTRIBUTE_UNUSED,
6312 void *data ATTRIBUTE_UNUSED)
6314 /* If the wild pattern was marked KEEP, the member sections
6315 should be as well. */
6316 if (ptr->keep_sections)
6317 section->flags |= SEC_KEEP;
6320 /* Iterate over sections marking them against GC. */
6323 lang_gc_sections_1 (lang_statement_union_type *s)
6325 for (; s != NULL; s = s->header.next)
6327 switch (s->header.type)
6329 case lang_wild_statement_enum:
6330 walk_wild (&s->wild_statement, gc_section_callback, NULL);
6332 case lang_constructors_statement_enum:
6333 lang_gc_sections_1 (constructor_list.head);
6335 case lang_output_section_statement_enum:
6336 lang_gc_sections_1 (s->output_section_statement.children.head);
6338 case lang_group_statement_enum:
6339 lang_gc_sections_1 (s->group_statement.children.head);
6348 lang_gc_sections (void)
6350 /* Keep all sections so marked in the link script. */
6352 lang_gc_sections_1 (statement_list.head);
6354 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
6355 the special case of debug info. (See bfd/stabs.c)
6356 Twiddle the flag here, to simplify later linker code. */
6357 if (link_info.relocatable)
6359 LANG_FOR_EACH_INPUT_STATEMENT (f)
6362 #ifdef ENABLE_PLUGINS
6363 if (f->flags.claimed)
6366 for (sec = f->the_bfd->sections; sec != NULL; sec = sec->next)
6367 if ((sec->flags & SEC_DEBUGGING) == 0)
6368 sec->flags &= ~SEC_EXCLUDE;
6372 if (link_info.gc_sections)
6373 bfd_gc_sections (link_info.output_bfd, &link_info);
6376 /* Worker for lang_find_relro_sections_1. */
6379 find_relro_section_callback (lang_wild_statement_type *ptr ATTRIBUTE_UNUSED,
6380 struct wildcard_list *sec ATTRIBUTE_UNUSED,
6382 struct flag_info *sflag_info ATTRIBUTE_UNUSED,
6383 lang_input_statement_type *file ATTRIBUTE_UNUSED,
6386 /* Discarded, excluded and ignored sections effectively have zero
6388 if (section->output_section != NULL
6389 && section->output_section->owner == link_info.output_bfd
6390 && (section->output_section->flags & SEC_EXCLUDE) == 0
6391 && !IGNORE_SECTION (section)
6392 && section->size != 0)
6394 bfd_boolean *has_relro_section = (bfd_boolean *) data;
6395 *has_relro_section = TRUE;
6399 /* Iterate over sections for relro sections. */
6402 lang_find_relro_sections_1 (lang_statement_union_type *s,
6403 bfd_boolean *has_relro_section)
6405 if (*has_relro_section)
6408 for (; s != NULL; s = s->header.next)
6410 if (s == expld.dataseg.relro_end_stat)
6413 switch (s->header.type)
6415 case lang_wild_statement_enum:
6416 walk_wild (&s->wild_statement,
6417 find_relro_section_callback,
6420 case lang_constructors_statement_enum:
6421 lang_find_relro_sections_1 (constructor_list.head,
6424 case lang_output_section_statement_enum:
6425 lang_find_relro_sections_1 (s->output_section_statement.children.head,
6428 case lang_group_statement_enum:
6429 lang_find_relro_sections_1 (s->group_statement.children.head,
6439 lang_find_relro_sections (void)
6441 bfd_boolean has_relro_section = FALSE;
6443 /* Check all sections in the link script. */
6445 lang_find_relro_sections_1 (expld.dataseg.relro_start_stat,
6446 &has_relro_section);
6448 if (!has_relro_section)
6449 link_info.relro = FALSE;
6452 /* Relax all sections until bfd_relax_section gives up. */
6455 lang_relax_sections (bfd_boolean need_layout)
6457 if (RELAXATION_ENABLED)
6459 /* We may need more than one relaxation pass. */
6460 int i = link_info.relax_pass;
6462 /* The backend can use it to determine the current pass. */
6463 link_info.relax_pass = 0;
6467 /* Keep relaxing until bfd_relax_section gives up. */
6468 bfd_boolean relax_again;
6470 link_info.relax_trip = -1;
6473 link_info.relax_trip++;
6475 /* Note: pe-dll.c does something like this also. If you find
6476 you need to change this code, you probably need to change
6477 pe-dll.c also. DJ */
6479 /* Do all the assignments with our current guesses as to
6481 lang_do_assignments (lang_assigning_phase_enum);
6483 /* We must do this after lang_do_assignments, because it uses
6485 lang_reset_memory_regions ();
6487 /* Perform another relax pass - this time we know where the
6488 globals are, so can make a better guess. */
6489 relax_again = FALSE;
6490 lang_size_sections (&relax_again, FALSE);
6492 while (relax_again);
6494 link_info.relax_pass++;
6501 /* Final extra sizing to report errors. */
6502 lang_do_assignments (lang_assigning_phase_enum);
6503 lang_reset_memory_regions ();
6504 lang_size_sections (NULL, TRUE);
6508 #ifdef ENABLE_PLUGINS
6509 /* Find the insert point for the plugin's replacement files. We
6510 place them after the first claimed real object file, or if the
6511 first claimed object is an archive member, after the last real
6512 object file immediately preceding the archive. In the event
6513 no objects have been claimed at all, we return the first dummy
6514 object file on the list as the insert point; that works, but
6515 the callee must be careful when relinking the file_chain as it
6516 is not actually on that chain, only the statement_list and the
6517 input_file list; in that case, the replacement files must be
6518 inserted at the head of the file_chain. */
6520 static lang_input_statement_type *
6521 find_replacements_insert_point (void)
6523 lang_input_statement_type *claim1, *lastobject;
6524 lastobject = &input_file_chain.head->input_statement;
6525 for (claim1 = &file_chain.head->input_statement;
6527 claim1 = &claim1->next->input_statement)
6529 if (claim1->flags.claimed)
6530 return claim1->flags.claim_archive ? lastobject : claim1;
6531 /* Update lastobject if this is a real object file. */
6532 if (claim1->the_bfd && (claim1->the_bfd->my_archive == NULL))
6533 lastobject = claim1;
6535 /* No files were claimed by the plugin. Choose the last object
6536 file found on the list (maybe the first, dummy entry) as the
6541 /* Insert SRCLIST into DESTLIST after given element by chaining
6542 on FIELD as the next-pointer. (Counterintuitively does not need
6543 a pointer to the actual after-node itself, just its chain field.) */
6546 lang_list_insert_after (lang_statement_list_type *destlist,
6547 lang_statement_list_type *srclist,
6548 lang_statement_union_type **field)
6550 *(srclist->tail) = *field;
6551 *field = srclist->head;
6552 if (destlist->tail == field)
6553 destlist->tail = srclist->tail;
6556 /* Detach new nodes added to DESTLIST since the time ORIGLIST
6557 was taken as a copy of it and leave them in ORIGLIST. */
6560 lang_list_remove_tail (lang_statement_list_type *destlist,
6561 lang_statement_list_type *origlist)
6563 union lang_statement_union **savetail;
6564 /* Check that ORIGLIST really is an earlier state of DESTLIST. */
6565 ASSERT (origlist->head == destlist->head);
6566 savetail = origlist->tail;
6567 origlist->head = *(savetail);
6568 origlist->tail = destlist->tail;
6569 destlist->tail = savetail;
6572 #endif /* ENABLE_PLUGINS */
6577 /* Finalize dynamic list. */
6578 if (link_info.dynamic_list)
6579 lang_finalize_version_expr_head (&link_info.dynamic_list->head);
6581 current_target = default_target;
6583 /* Open the output file. */
6584 lang_for_each_statement (ldlang_open_output);
6587 ldemul_create_output_section_statements ();
6589 /* Add to the hash table all undefineds on the command line. */
6590 lang_place_undefineds ();
6592 if (!bfd_section_already_linked_table_init ())
6593 einfo (_("%P%F: Failed to create hash table\n"));
6595 /* Create a bfd for each input file. */
6596 current_target = default_target;
6597 open_input_bfds (statement_list.head, OPEN_BFD_NORMAL);
6599 #ifdef ENABLE_PLUGINS
6600 if (plugin_active_plugins_p ())
6602 lang_statement_list_type added;
6603 lang_statement_list_type files, inputfiles;
6605 /* Now all files are read, let the plugin(s) decide if there
6606 are any more to be added to the link before we call the
6607 emulation's after_open hook. We create a private list of
6608 input statements for this purpose, which we will eventually
6609 insert into the global statment list after the first claimed
6612 /* We need to manipulate all three chains in synchrony. */
6614 inputfiles = input_file_chain;
6615 if (plugin_call_all_symbols_read ())
6616 einfo (_("%P%F: %s: plugin reported error after all symbols read\n"),
6617 plugin_error_plugin ());
6618 /* Open any newly added files, updating the file chains. */
6619 link_info.loading_lto_outputs = TRUE;
6620 open_input_bfds (*added.tail, OPEN_BFD_NORMAL);
6621 /* Restore the global list pointer now they have all been added. */
6622 lang_list_remove_tail (stat_ptr, &added);
6623 /* And detach the fresh ends of the file lists. */
6624 lang_list_remove_tail (&file_chain, &files);
6625 lang_list_remove_tail (&input_file_chain, &inputfiles);
6626 /* Were any new files added? */
6627 if (added.head != NULL)
6629 /* If so, we will insert them into the statement list immediately
6630 after the first input file that was claimed by the plugin. */
6631 plugin_insert = find_replacements_insert_point ();
6632 /* If a plugin adds input files without having claimed any, we
6633 don't really have a good idea where to place them. Just putting
6634 them at the start or end of the list is liable to leave them
6635 outside the crtbegin...crtend range. */
6636 ASSERT (plugin_insert != NULL);
6637 /* Splice the new statement list into the old one. */
6638 lang_list_insert_after (stat_ptr, &added,
6639 &plugin_insert->header.next);
6640 /* Likewise for the file chains. */
6641 lang_list_insert_after (&input_file_chain, &inputfiles,
6642 &plugin_insert->next_real_file);
6643 /* We must be careful when relinking file_chain; we may need to
6644 insert the new files at the head of the list if the insert
6645 point chosen is the dummy first input file. */
6646 if (plugin_insert->filename)
6647 lang_list_insert_after (&file_chain, &files, &plugin_insert->next);
6649 lang_list_insert_after (&file_chain, &files, &file_chain.head);
6651 /* Rescan archives in case new undefined symbols have appeared. */
6652 open_input_bfds (statement_list.head, OPEN_BFD_RESCAN);
6655 #endif /* ENABLE_PLUGINS */
6657 link_info.gc_sym_list = &entry_symbol;
6658 if (entry_symbol.name == NULL)
6659 link_info.gc_sym_list = ldlang_undef_chain_list_head;
6661 ldemul_after_open ();
6663 bfd_section_already_linked_table_free ();
6665 /* Make sure that we're not mixing architectures. We call this
6666 after all the input files have been opened, but before we do any
6667 other processing, so that any operations merge_private_bfd_data
6668 does on the output file will be known during the rest of the
6672 /* Handle .exports instead of a version script if we're told to do so. */
6673 if (command_line.version_exports_section)
6674 lang_do_version_exports_section ();
6676 /* Build all sets based on the information gathered from the input
6678 ldctor_build_sets ();
6680 /* PR 13683: We must rerun the assignments prior to running garbage
6681 collection in order to make sure that all symbol aliases are resolved. */
6682 lang_do_assignments (lang_mark_phase_enum);
6683 expld.phase = lang_first_phase_enum;
6685 /* Remove unreferenced sections if asked to. */
6686 lang_gc_sections ();
6688 /* Size up the common data. */
6691 /* Update wild statements. */
6692 update_wild_statements (statement_list.head);
6694 /* Run through the contours of the script and attach input sections
6695 to the correct output sections. */
6696 lang_statement_iteration++;
6697 map_input_to_output_sections (statement_list.head, NULL, NULL);
6699 process_insert_statements ();
6701 /* Find any sections not attached explicitly and handle them. */
6702 lang_place_orphans ();
6704 if (! link_info.relocatable)
6708 /* Merge SEC_MERGE sections. This has to be done after GC of
6709 sections, so that GCed sections are not merged, but before
6710 assigning dynamic symbols, since removing whole input sections
6712 bfd_merge_sections (link_info.output_bfd, &link_info);
6714 /* Look for a text section and set the readonly attribute in it. */
6715 found = bfd_get_section_by_name (link_info.output_bfd, ".text");
6719 if (config.text_read_only)
6720 found->flags |= SEC_READONLY;
6722 found->flags &= ~SEC_READONLY;
6726 /* Do anything special before sizing sections. This is where ELF
6727 and other back-ends size dynamic sections. */
6728 ldemul_before_allocation ();
6730 /* We must record the program headers before we try to fix the
6731 section positions, since they will affect SIZEOF_HEADERS. */
6732 lang_record_phdrs ();
6734 /* Check relro sections. */
6735 if (link_info.relro && ! link_info.relocatable)
6736 lang_find_relro_sections ();
6738 /* Size up the sections. */
6739 lang_size_sections (NULL, ! RELAXATION_ENABLED);
6741 /* See if anything special should be done now we know how big
6742 everything is. This is where relaxation is done. */
6743 ldemul_after_allocation ();
6745 /* Fix any .startof. or .sizeof. symbols. */
6746 lang_set_startof ();
6748 /* Do all the assignments, now that we know the final resting places
6749 of all the symbols. */
6750 lang_do_assignments (lang_final_phase_enum);
6754 /* Make sure that the section addresses make sense. */
6755 if (command_line.check_section_addresses)
6756 lang_check_section_addresses ();
6761 /* EXPORTED TO YACC */
6764 lang_add_wild (struct wildcard_spec *filespec,
6765 struct wildcard_list *section_list,
6766 bfd_boolean keep_sections)
6768 struct wildcard_list *curr, *next;
6769 lang_wild_statement_type *new_stmt;
6771 /* Reverse the list as the parser puts it back to front. */
6772 for (curr = section_list, section_list = NULL;
6774 section_list = curr, curr = next)
6776 if (curr->spec.name != NULL && strcmp (curr->spec.name, "COMMON") == 0)
6777 placed_commons = TRUE;
6780 curr->next = section_list;
6783 if (filespec != NULL && filespec->name != NULL)
6785 if (strcmp (filespec->name, "*") == 0)
6786 filespec->name = NULL;
6787 else if (! wildcardp (filespec->name))
6788 lang_has_input_file = TRUE;
6791 new_stmt = new_stat (lang_wild_statement, stat_ptr);
6792 new_stmt->filename = NULL;
6793 new_stmt->filenames_sorted = FALSE;
6794 new_stmt->section_flag_list = NULL;
6795 if (filespec != NULL)
6797 new_stmt->filename = filespec->name;
6798 new_stmt->filenames_sorted = filespec->sorted == by_name;
6799 new_stmt->section_flag_list = filespec->section_flag_list;
6801 new_stmt->section_list = section_list;
6802 new_stmt->keep_sections = keep_sections;
6803 lang_list_init (&new_stmt->children);
6804 analyze_walk_wild_section_handler (new_stmt);
6808 lang_section_start (const char *name, etree_type *address,
6809 const segment_type *segment)
6811 lang_address_statement_type *ad;
6813 ad = new_stat (lang_address_statement, stat_ptr);
6814 ad->section_name = name;
6815 ad->address = address;
6816 ad->segment = segment;
6819 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
6820 because of a -e argument on the command line, or zero if this is
6821 called by ENTRY in a linker script. Command line arguments take
6825 lang_add_entry (const char *name, bfd_boolean cmdline)
6827 if (entry_symbol.name == NULL
6829 || ! entry_from_cmdline)
6831 entry_symbol.name = name;
6832 entry_from_cmdline = cmdline;
6836 /* Set the default start symbol to NAME. .em files should use this,
6837 not lang_add_entry, to override the use of "start" if neither the
6838 linker script nor the command line specifies an entry point. NAME
6839 must be permanently allocated. */
6841 lang_default_entry (const char *name)
6843 entry_symbol_default = name;
6847 lang_add_target (const char *name)
6849 lang_target_statement_type *new_stmt;
6851 new_stmt = new_stat (lang_target_statement, stat_ptr);
6852 new_stmt->target = name;
6856 lang_add_map (const char *name)
6863 map_option_f = TRUE;
6871 lang_add_fill (fill_type *fill)
6873 lang_fill_statement_type *new_stmt;
6875 new_stmt = new_stat (lang_fill_statement, stat_ptr);
6876 new_stmt->fill = fill;
6880 lang_add_data (int type, union etree_union *exp)
6882 lang_data_statement_type *new_stmt;
6884 new_stmt = new_stat (lang_data_statement, stat_ptr);
6885 new_stmt->exp = exp;
6886 new_stmt->type = type;
6889 /* Create a new reloc statement. RELOC is the BFD relocation type to
6890 generate. HOWTO is the corresponding howto structure (we could
6891 look this up, but the caller has already done so). SECTION is the
6892 section to generate a reloc against, or NAME is the name of the
6893 symbol to generate a reloc against. Exactly one of SECTION and
6894 NAME must be NULL. ADDEND is an expression for the addend. */
6897 lang_add_reloc (bfd_reloc_code_real_type reloc,
6898 reloc_howto_type *howto,
6901 union etree_union *addend)
6903 lang_reloc_statement_type *p = new_stat (lang_reloc_statement, stat_ptr);
6907 p->section = section;
6909 p->addend_exp = addend;
6911 p->addend_value = 0;
6912 p->output_section = NULL;
6913 p->output_offset = 0;
6916 lang_assignment_statement_type *
6917 lang_add_assignment (etree_type *exp)
6919 lang_assignment_statement_type *new_stmt;
6921 new_stmt = new_stat (lang_assignment_statement, stat_ptr);
6922 new_stmt->exp = exp;
6927 lang_add_attribute (enum statement_enum attribute)
6929 new_statement (attribute, sizeof (lang_statement_header_type), stat_ptr);
6933 lang_startup (const char *name)
6935 if (first_file->filename != NULL)
6937 einfo (_("%P%F: multiple STARTUP files\n"));
6939 first_file->filename = name;
6940 first_file->local_sym_name = name;
6941 first_file->flags.real = TRUE;
6945 lang_float (bfd_boolean maybe)
6947 lang_float_flag = maybe;
6951 /* Work out the load- and run-time regions from a script statement, and
6952 store them in *LMA_REGION and *REGION respectively.
6954 MEMSPEC is the name of the run-time region, or the value of
6955 DEFAULT_MEMORY_REGION if the statement didn't specify one.
6956 LMA_MEMSPEC is the name of the load-time region, or null if the
6957 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
6958 had an explicit load address.
6960 It is an error to specify both a load region and a load address. */
6963 lang_get_regions (lang_memory_region_type **region,
6964 lang_memory_region_type **lma_region,
6965 const char *memspec,
6966 const char *lma_memspec,
6967 bfd_boolean have_lma,
6968 bfd_boolean have_vma)
6970 *lma_region = lang_memory_region_lookup (lma_memspec, FALSE);
6972 /* If no runtime region or VMA has been specified, but the load region
6973 has been specified, then use the load region for the runtime region
6975 if (lma_memspec != NULL
6977 && strcmp (memspec, DEFAULT_MEMORY_REGION) == 0)
6978 *region = *lma_region;
6980 *region = lang_memory_region_lookup (memspec, FALSE);
6982 if (have_lma && lma_memspec != 0)
6983 einfo (_("%X%P:%S: section has both a load address and a load region\n"),
6988 lang_leave_output_section_statement (fill_type *fill, const char *memspec,
6989 lang_output_section_phdr_list *phdrs,
6990 const char *lma_memspec)
6992 lang_get_regions (¤t_section->region,
6993 ¤t_section->lma_region,
6994 memspec, lma_memspec,
6995 current_section->load_base != NULL,
6996 current_section->addr_tree != NULL);
6998 /* If this section has no load region or base, but uses the same
6999 region as the previous section, then propagate the previous
7000 section's load region. */
7002 if (current_section->lma_region == NULL
7003 && current_section->load_base == NULL
7004 && current_section->addr_tree == NULL
7005 && current_section->region == current_section->prev->region)
7006 current_section->lma_region = current_section->prev->lma_region;
7008 current_section->fill = fill;
7009 current_section->phdrs = phdrs;
7014 lang_statement_append (lang_statement_list_type *list,
7015 lang_statement_union_type *element,
7016 lang_statement_union_type **field)
7018 *(list->tail) = element;
7022 /* Set the output format type. -oformat overrides scripts. */
7025 lang_add_output_format (const char *format,
7030 if (output_target == NULL || !from_script)
7032 if (command_line.endian == ENDIAN_BIG
7035 else if (command_line.endian == ENDIAN_LITTLE
7039 output_target = format;
7044 lang_add_insert (const char *where, int is_before)
7046 lang_insert_statement_type *new_stmt;
7048 new_stmt = new_stat (lang_insert_statement, stat_ptr);
7049 new_stmt->where = where;
7050 new_stmt->is_before = is_before;
7051 saved_script_handle = previous_script_handle;
7054 /* Enter a group. This creates a new lang_group_statement, and sets
7055 stat_ptr to build new statements within the group. */
7058 lang_enter_group (void)
7060 lang_group_statement_type *g;
7062 g = new_stat (lang_group_statement, stat_ptr);
7063 lang_list_init (&g->children);
7064 push_stat_ptr (&g->children);
7067 /* Leave a group. This just resets stat_ptr to start writing to the
7068 regular list of statements again. Note that this will not work if
7069 groups can occur inside anything else which can adjust stat_ptr,
7070 but currently they can't. */
7073 lang_leave_group (void)
7078 /* Add a new program header. This is called for each entry in a PHDRS
7079 command in a linker script. */
7082 lang_new_phdr (const char *name,
7084 bfd_boolean filehdr,
7089 struct lang_phdr *n, **pp;
7092 n = (struct lang_phdr *) stat_alloc (sizeof (struct lang_phdr));
7095 n->type = exp_get_value_int (type, 0, "program header type");
7096 n->filehdr = filehdr;
7101 hdrs = n->type == 1 && (phdrs || filehdr);
7103 for (pp = &lang_phdr_list; *pp != NULL; pp = &(*pp)->next)
7106 && !((*pp)->filehdr || (*pp)->phdrs))
7108 einfo (_("%X%P:%S: PHDRS and FILEHDR are not supported"
7109 " when prior PT_LOAD headers lack them\n"), NULL);
7116 /* Record the program header information in the output BFD. FIXME: We
7117 should not be calling an ELF specific function here. */
7120 lang_record_phdrs (void)
7124 lang_output_section_phdr_list *last;
7125 struct lang_phdr *l;
7126 lang_output_section_statement_type *os;
7129 secs = (asection **) xmalloc (alc * sizeof (asection *));
7132 for (l = lang_phdr_list; l != NULL; l = l->next)
7139 for (os = &lang_output_section_statement.head->output_section_statement;
7143 lang_output_section_phdr_list *pl;
7145 if (os->constraint < 0)
7153 if (os->sectype == noload_section
7154 || os->bfd_section == NULL
7155 || (os->bfd_section->flags & SEC_ALLOC) == 0)
7158 /* Don't add orphans to PT_INTERP header. */
7164 lang_output_section_statement_type * tmp_os;
7166 /* If we have not run across a section with a program
7167 header assigned to it yet, then scan forwards to find
7168 one. This prevents inconsistencies in the linker's
7169 behaviour when a script has specified just a single
7170 header and there are sections in that script which are
7171 not assigned to it, and which occur before the first
7172 use of that header. See here for more details:
7173 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
7174 for (tmp_os = os; tmp_os; tmp_os = tmp_os->next)
7177 last = tmp_os->phdrs;
7181 einfo (_("%F%P: no sections assigned to phdrs\n"));
7186 if (os->bfd_section == NULL)
7189 for (; pl != NULL; pl = pl->next)
7191 if (strcmp (pl->name, l->name) == 0)
7196 secs = (asection **) xrealloc (secs,
7197 alc * sizeof (asection *));
7199 secs[c] = os->bfd_section;
7206 if (l->flags == NULL)
7209 flags = exp_get_vma (l->flags, 0, "phdr flags");
7214 at = exp_get_vma (l->at, 0, "phdr load address");
7216 if (! bfd_record_phdr (link_info.output_bfd, l->type,
7217 l->flags != NULL, flags, l->at != NULL,
7218 at, l->filehdr, l->phdrs, c, secs))
7219 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
7224 /* Make sure all the phdr assignments succeeded. */
7225 for (os = &lang_output_section_statement.head->output_section_statement;
7229 lang_output_section_phdr_list *pl;
7231 if (os->constraint < 0
7232 || os->bfd_section == NULL)
7235 for (pl = os->phdrs;
7238 if (! pl->used && strcmp (pl->name, "NONE") != 0)
7239 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
7240 os->name, pl->name);
7244 /* Record a list of sections which may not be cross referenced. */
7247 lang_add_nocrossref (lang_nocrossref_type *l)
7249 struct lang_nocrossrefs *n;
7251 n = (struct lang_nocrossrefs *) xmalloc (sizeof *n);
7252 n->next = nocrossref_list;
7254 nocrossref_list = n;
7256 /* Set notice_all so that we get informed about all symbols. */
7257 link_info.notice_all = TRUE;
7260 /* Overlay handling. We handle overlays with some static variables. */
7262 /* The overlay virtual address. */
7263 static etree_type *overlay_vma;
7264 /* And subsection alignment. */
7265 static etree_type *overlay_subalign;
7267 /* An expression for the maximum section size seen so far. */
7268 static etree_type *overlay_max;
7270 /* A list of all the sections in this overlay. */
7272 struct overlay_list {
7273 struct overlay_list *next;
7274 lang_output_section_statement_type *os;
7277 static struct overlay_list *overlay_list;
7279 /* Start handling an overlay. */
7282 lang_enter_overlay (etree_type *vma_expr, etree_type *subalign)
7284 /* The grammar should prevent nested overlays from occurring. */
7285 ASSERT (overlay_vma == NULL
7286 && overlay_subalign == NULL
7287 && overlay_max == NULL);
7289 overlay_vma = vma_expr;
7290 overlay_subalign = subalign;
7293 /* Start a section in an overlay. We handle this by calling
7294 lang_enter_output_section_statement with the correct VMA.
7295 lang_leave_overlay sets up the LMA and memory regions. */
7298 lang_enter_overlay_section (const char *name)
7300 struct overlay_list *n;
7303 lang_enter_output_section_statement (name, overlay_vma, overlay_section,
7304 0, overlay_subalign, 0, 0);
7306 /* If this is the first section, then base the VMA of future
7307 sections on this one. This will work correctly even if `.' is
7308 used in the addresses. */
7309 if (overlay_list == NULL)
7310 overlay_vma = exp_nameop (ADDR, name);
7312 /* Remember the section. */
7313 n = (struct overlay_list *) xmalloc (sizeof *n);
7314 n->os = current_section;
7315 n->next = overlay_list;
7318 size = exp_nameop (SIZEOF, name);
7320 /* Arrange to work out the maximum section end address. */
7321 if (overlay_max == NULL)
7324 overlay_max = exp_binop (MAX_K, overlay_max, size);
7327 /* Finish a section in an overlay. There isn't any special to do
7331 lang_leave_overlay_section (fill_type *fill,
7332 lang_output_section_phdr_list *phdrs)
7339 name = current_section->name;
7341 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
7342 region and that no load-time region has been specified. It doesn't
7343 really matter what we say here, since lang_leave_overlay will
7345 lang_leave_output_section_statement (fill, DEFAULT_MEMORY_REGION, phdrs, 0);
7347 /* Define the magic symbols. */
7349 clean = (char *) xmalloc (strlen (name) + 1);
7351 for (s1 = name; *s1 != '\0'; s1++)
7352 if (ISALNUM (*s1) || *s1 == '_')
7356 buf = (char *) xmalloc (strlen (clean) + sizeof "__load_start_");
7357 sprintf (buf, "__load_start_%s", clean);
7358 lang_add_assignment (exp_provide (buf,
7359 exp_nameop (LOADADDR, name),
7362 buf = (char *) xmalloc (strlen (clean) + sizeof "__load_stop_");
7363 sprintf (buf, "__load_stop_%s", clean);
7364 lang_add_assignment (exp_provide (buf,
7366 exp_nameop (LOADADDR, name),
7367 exp_nameop (SIZEOF, name)),
7373 /* Finish an overlay. If there are any overlay wide settings, this
7374 looks through all the sections in the overlay and sets them. */
7377 lang_leave_overlay (etree_type *lma_expr,
7380 const char *memspec,
7381 lang_output_section_phdr_list *phdrs,
7382 const char *lma_memspec)
7384 lang_memory_region_type *region;
7385 lang_memory_region_type *lma_region;
7386 struct overlay_list *l;
7387 lang_nocrossref_type *nocrossref;
7389 lang_get_regions (®ion, &lma_region,
7390 memspec, lma_memspec,
7391 lma_expr != NULL, FALSE);
7395 /* After setting the size of the last section, set '.' to end of the
7397 if (overlay_list != NULL)
7399 overlay_list->os->update_dot = 1;
7400 overlay_list->os->update_dot_tree
7401 = exp_assign (".", exp_binop ('+', overlay_vma, overlay_max), FALSE);
7407 struct overlay_list *next;
7409 if (fill != NULL && l->os->fill == NULL)
7412 l->os->region = region;
7413 l->os->lma_region = lma_region;
7415 /* The first section has the load address specified in the
7416 OVERLAY statement. The rest are worked out from that.
7417 The base address is not needed (and should be null) if
7418 an LMA region was specified. */
7421 l->os->load_base = lma_expr;
7422 l->os->sectype = normal_section;
7424 if (phdrs != NULL && l->os->phdrs == NULL)
7425 l->os->phdrs = phdrs;
7429 lang_nocrossref_type *nc;
7431 nc = (lang_nocrossref_type *) xmalloc (sizeof *nc);
7432 nc->name = l->os->name;
7433 nc->next = nocrossref;
7442 if (nocrossref != NULL)
7443 lang_add_nocrossref (nocrossref);
7446 overlay_list = NULL;
7450 /* Version handling. This is only useful for ELF. */
7452 /* If PREV is NULL, return first version pattern matching particular symbol.
7453 If PREV is non-NULL, return first version pattern matching particular
7454 symbol after PREV (previously returned by lang_vers_match). */
7456 static struct bfd_elf_version_expr *
7457 lang_vers_match (struct bfd_elf_version_expr_head *head,
7458 struct bfd_elf_version_expr *prev,
7462 const char *cxx_sym = sym;
7463 const char *java_sym = sym;
7464 struct bfd_elf_version_expr *expr = NULL;
7465 enum demangling_styles curr_style;
7467 curr_style = CURRENT_DEMANGLING_STYLE;
7468 cplus_demangle_set_style (no_demangling);
7469 c_sym = bfd_demangle (link_info.output_bfd, sym, DMGL_NO_OPTS);
7472 cplus_demangle_set_style (curr_style);
7474 if (head->mask & BFD_ELF_VERSION_CXX_TYPE)
7476 cxx_sym = bfd_demangle (link_info.output_bfd, sym,
7477 DMGL_PARAMS | DMGL_ANSI);
7481 if (head->mask & BFD_ELF_VERSION_JAVA_TYPE)
7483 java_sym = bfd_demangle (link_info.output_bfd, sym, DMGL_JAVA);
7488 if (head->htab && (prev == NULL || prev->literal))
7490 struct bfd_elf_version_expr e;
7492 switch (prev ? prev->mask : 0)
7495 if (head->mask & BFD_ELF_VERSION_C_TYPE)
7498 expr = (struct bfd_elf_version_expr *)
7499 htab_find ((htab_t) head->htab, &e);
7500 while (expr && strcmp (expr->pattern, c_sym) == 0)
7501 if (expr->mask == BFD_ELF_VERSION_C_TYPE)
7507 case BFD_ELF_VERSION_C_TYPE:
7508 if (head->mask & BFD_ELF_VERSION_CXX_TYPE)
7510 e.pattern = cxx_sym;
7511 expr = (struct bfd_elf_version_expr *)
7512 htab_find ((htab_t) head->htab, &e);
7513 while (expr && strcmp (expr->pattern, cxx_sym) == 0)
7514 if (expr->mask == BFD_ELF_VERSION_CXX_TYPE)
7520 case BFD_ELF_VERSION_CXX_TYPE:
7521 if (head->mask & BFD_ELF_VERSION_JAVA_TYPE)
7523 e.pattern = java_sym;
7524 expr = (struct bfd_elf_version_expr *)
7525 htab_find ((htab_t) head->htab, &e);
7526 while (expr && strcmp (expr->pattern, java_sym) == 0)
7527 if (expr->mask == BFD_ELF_VERSION_JAVA_TYPE)
7538 /* Finally, try the wildcards. */
7539 if (prev == NULL || prev->literal)
7540 expr = head->remaining;
7543 for (; expr; expr = expr->next)
7550 if (expr->pattern[0] == '*' && expr->pattern[1] == '\0')
7553 if (expr->mask == BFD_ELF_VERSION_JAVA_TYPE)
7555 else if (expr->mask == BFD_ELF_VERSION_CXX_TYPE)
7559 if (fnmatch (expr->pattern, s, 0) == 0)
7565 free ((char *) c_sym);
7567 free ((char *) cxx_sym);
7568 if (java_sym != sym)
7569 free ((char *) java_sym);
7573 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
7574 return a pointer to the symbol name with any backslash quotes removed. */
7577 realsymbol (const char *pattern)
7580 bfd_boolean changed = FALSE, backslash = FALSE;
7581 char *s, *symbol = (char *) xmalloc (strlen (pattern) + 1);
7583 for (p = pattern, s = symbol; *p != '\0'; ++p)
7585 /* It is a glob pattern only if there is no preceding
7589 /* Remove the preceding backslash. */
7596 if (*p == '?' || *p == '*' || *p == '[')
7603 backslash = *p == '\\';
7619 /* This is called for each variable name or match expression. NEW_NAME is
7620 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
7621 pattern to be matched against symbol names. */
7623 struct bfd_elf_version_expr *
7624 lang_new_vers_pattern (struct bfd_elf_version_expr *orig,
7625 const char *new_name,
7627 bfd_boolean literal_p)
7629 struct bfd_elf_version_expr *ret;
7631 ret = (struct bfd_elf_version_expr *) xmalloc (sizeof *ret);
7635 ret->literal = TRUE;
7636 ret->pattern = literal_p ? new_name : realsymbol (new_name);
7637 if (ret->pattern == NULL)
7639 ret->pattern = new_name;
7640 ret->literal = FALSE;
7643 if (lang == NULL || strcasecmp (lang, "C") == 0)
7644 ret->mask = BFD_ELF_VERSION_C_TYPE;
7645 else if (strcasecmp (lang, "C++") == 0)
7646 ret->mask = BFD_ELF_VERSION_CXX_TYPE;
7647 else if (strcasecmp (lang, "Java") == 0)
7648 ret->mask = BFD_ELF_VERSION_JAVA_TYPE;
7651 einfo (_("%X%P: unknown language `%s' in version information\n"),
7653 ret->mask = BFD_ELF_VERSION_C_TYPE;
7656 return ldemul_new_vers_pattern (ret);
7659 /* This is called for each set of variable names and match
7662 struct bfd_elf_version_tree *
7663 lang_new_vers_node (struct bfd_elf_version_expr *globals,
7664 struct bfd_elf_version_expr *locals)
7666 struct bfd_elf_version_tree *ret;
7668 ret = (struct bfd_elf_version_tree *) xcalloc (1, sizeof *ret);
7669 ret->globals.list = globals;
7670 ret->locals.list = locals;
7671 ret->match = lang_vers_match;
7672 ret->name_indx = (unsigned int) -1;
7676 /* This static variable keeps track of version indices. */
7678 static int version_index;
7681 version_expr_head_hash (const void *p)
7683 const struct bfd_elf_version_expr *e =
7684 (const struct bfd_elf_version_expr *) p;
7686 return htab_hash_string (e->pattern);
7690 version_expr_head_eq (const void *p1, const void *p2)
7692 const struct bfd_elf_version_expr *e1 =
7693 (const struct bfd_elf_version_expr *) p1;
7694 const struct bfd_elf_version_expr *e2 =
7695 (const struct bfd_elf_version_expr *) p2;
7697 return strcmp (e1->pattern, e2->pattern) == 0;
7701 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head *head)
7704 struct bfd_elf_version_expr *e, *next;
7705 struct bfd_elf_version_expr **list_loc, **remaining_loc;
7707 for (e = head->list; e; e = e->next)
7711 head->mask |= e->mask;
7716 head->htab = htab_create (count * 2, version_expr_head_hash,
7717 version_expr_head_eq, NULL);
7718 list_loc = &head->list;
7719 remaining_loc = &head->remaining;
7720 for (e = head->list; e; e = next)
7726 remaining_loc = &e->next;
7730 void **loc = htab_find_slot ((htab_t) head->htab, e, INSERT);
7734 struct bfd_elf_version_expr *e1, *last;
7736 e1 = (struct bfd_elf_version_expr *) *loc;
7740 if (e1->mask == e->mask)
7748 while (e1 && strcmp (e1->pattern, e->pattern) == 0);
7752 /* This is a duplicate. */
7753 /* FIXME: Memory leak. Sometimes pattern is not
7754 xmalloced alone, but in larger chunk of memory. */
7755 /* free (e->pattern); */
7760 e->next = last->next;
7768 list_loc = &e->next;
7772 *remaining_loc = NULL;
7773 *list_loc = head->remaining;
7776 head->remaining = head->list;
7779 /* This is called when we know the name and dependencies of the
7783 lang_register_vers_node (const char *name,
7784 struct bfd_elf_version_tree *version,
7785 struct bfd_elf_version_deps *deps)
7787 struct bfd_elf_version_tree *t, **pp;
7788 struct bfd_elf_version_expr *e1;
7793 if (link_info.version_info != NULL
7794 && (name[0] == '\0' || link_info.version_info->name[0] == '\0'))
7796 einfo (_("%X%P: anonymous version tag cannot be combined"
7797 " with other version tags\n"));
7802 /* Make sure this node has a unique name. */
7803 for (t = link_info.version_info; t != NULL; t = t->next)
7804 if (strcmp (t->name, name) == 0)
7805 einfo (_("%X%P: duplicate version tag `%s'\n"), name);
7807 lang_finalize_version_expr_head (&version->globals);
7808 lang_finalize_version_expr_head (&version->locals);
7810 /* Check the global and local match names, and make sure there
7811 aren't any duplicates. */
7813 for (e1 = version->globals.list; e1 != NULL; e1 = e1->next)
7815 for (t = link_info.version_info; t != NULL; t = t->next)
7817 struct bfd_elf_version_expr *e2;
7819 if (t->locals.htab && e1->literal)
7821 e2 = (struct bfd_elf_version_expr *)
7822 htab_find ((htab_t) t->locals.htab, e1);
7823 while (e2 && strcmp (e1->pattern, e2->pattern) == 0)
7825 if (e1->mask == e2->mask)
7826 einfo (_("%X%P: duplicate expression `%s'"
7827 " in version information\n"), e1->pattern);
7831 else if (!e1->literal)
7832 for (e2 = t->locals.remaining; e2 != NULL; e2 = e2->next)
7833 if (strcmp (e1->pattern, e2->pattern) == 0
7834 && e1->mask == e2->mask)
7835 einfo (_("%X%P: duplicate expression `%s'"
7836 " in version information\n"), e1->pattern);
7840 for (e1 = version->locals.list; e1 != NULL; e1 = e1->next)
7842 for (t = link_info.version_info; t != NULL; t = t->next)
7844 struct bfd_elf_version_expr *e2;
7846 if (t->globals.htab && e1->literal)
7848 e2 = (struct bfd_elf_version_expr *)
7849 htab_find ((htab_t) t->globals.htab, e1);
7850 while (e2 && strcmp (e1->pattern, e2->pattern) == 0)
7852 if (e1->mask == e2->mask)
7853 einfo (_("%X%P: duplicate expression `%s'"
7854 " in version information\n"),
7859 else if (!e1->literal)
7860 for (e2 = t->globals.remaining; e2 != NULL; e2 = e2->next)
7861 if (strcmp (e1->pattern, e2->pattern) == 0
7862 && e1->mask == e2->mask)
7863 einfo (_("%X%P: duplicate expression `%s'"
7864 " in version information\n"), e1->pattern);
7868 version->deps = deps;
7869 version->name = name;
7870 if (name[0] != '\0')
7873 version->vernum = version_index;
7876 version->vernum = 0;
7878 for (pp = &link_info.version_info; *pp != NULL; pp = &(*pp)->next)
7883 /* This is called when we see a version dependency. */
7885 struct bfd_elf_version_deps *
7886 lang_add_vers_depend (struct bfd_elf_version_deps *list, const char *name)
7888 struct bfd_elf_version_deps *ret;
7889 struct bfd_elf_version_tree *t;
7891 ret = (struct bfd_elf_version_deps *) xmalloc (sizeof *ret);
7894 for (t = link_info.version_info; t != NULL; t = t->next)
7896 if (strcmp (t->name, name) == 0)
7898 ret->version_needed = t;
7903 einfo (_("%X%P: unable to find version dependency `%s'\n"), name);
7905 ret->version_needed = NULL;
7910 lang_do_version_exports_section (void)
7912 struct bfd_elf_version_expr *greg = NULL, *lreg;
7914 LANG_FOR_EACH_INPUT_STATEMENT (is)
7916 asection *sec = bfd_get_section_by_name (is->the_bfd, ".exports");
7924 contents = (char *) xmalloc (len);
7925 if (!bfd_get_section_contents (is->the_bfd, sec, contents, 0, len))
7926 einfo (_("%X%P: unable to read .exports section contents\n"), sec);
7929 while (p < contents + len)
7931 greg = lang_new_vers_pattern (greg, p, NULL, FALSE);
7932 p = strchr (p, '\0') + 1;
7935 /* Do not free the contents, as we used them creating the regex. */
7937 /* Do not include this section in the link. */
7938 sec->flags |= SEC_EXCLUDE | SEC_KEEP;
7941 lreg = lang_new_vers_pattern (NULL, "*", NULL, FALSE);
7942 lang_register_vers_node (command_line.version_exports_section,
7943 lang_new_vers_node (greg, lreg), NULL);
7947 lang_add_unique (const char *name)
7949 struct unique_sections *ent;
7951 for (ent = unique_section_list; ent; ent = ent->next)
7952 if (strcmp (ent->name, name) == 0)
7955 ent = (struct unique_sections *) xmalloc (sizeof *ent);
7956 ent->name = xstrdup (name);
7957 ent->next = unique_section_list;
7958 unique_section_list = ent;
7961 /* Append the list of dynamic symbols to the existing one. */
7964 lang_append_dynamic_list (struct bfd_elf_version_expr *dynamic)
7966 if (link_info.dynamic_list)
7968 struct bfd_elf_version_expr *tail;
7969 for (tail = dynamic; tail->next != NULL; tail = tail->next)
7971 tail->next = link_info.dynamic_list->head.list;
7972 link_info.dynamic_list->head.list = dynamic;
7976 struct bfd_elf_dynamic_list *d;
7978 d = (struct bfd_elf_dynamic_list *) xcalloc (1, sizeof *d);
7979 d->head.list = dynamic;
7980 d->match = lang_vers_match;
7981 link_info.dynamic_list = d;
7985 /* Append the list of C++ typeinfo dynamic symbols to the existing
7989 lang_append_dynamic_list_cpp_typeinfo (void)
7991 const char * symbols [] =
7993 "typeinfo name for*",
7996 struct bfd_elf_version_expr *dynamic = NULL;
7999 for (i = 0; i < ARRAY_SIZE (symbols); i++)
8000 dynamic = lang_new_vers_pattern (dynamic, symbols [i], "C++",
8003 lang_append_dynamic_list (dynamic);
8006 /* Append the list of C++ operator new and delete dynamic symbols to the
8010 lang_append_dynamic_list_cpp_new (void)
8012 const char * symbols [] =
8017 struct bfd_elf_version_expr *dynamic = NULL;
8020 for (i = 0; i < ARRAY_SIZE (symbols); i++)
8021 dynamic = lang_new_vers_pattern (dynamic, symbols [i], "C++",
8024 lang_append_dynamic_list (dynamic);
8027 /* Scan a space and/or comma separated string of features. */
8030 lang_ld_feature (char *str)
8038 while (*p == ',' || ISSPACE (*p))
8043 while (*q && *q != ',' && !ISSPACE (*q))
8047 if (strcasecmp (p, "SANE_EXPR") == 0)
8048 config.sane_expr = TRUE;
8050 einfo (_("%X%P: unknown feature `%s'\n"), p);