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
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 "safe-ctype.h"
46 #endif /* ENABLE_PLUGINS */
49 #define offsetof(TYPE, MEMBER) ((size_t) & (((TYPE*) 0)->MEMBER))
52 /* Locals variables. */
53 static struct obstack stat_obstack;
54 static struct obstack map_obstack;
56 #define obstack_chunk_alloc xmalloc
57 #define obstack_chunk_free free
58 static const char *startup_file;
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;
72 static bfd_boolean ldlang_sysrooted_script = FALSE;
74 /* Forward declarations. */
75 static void exp_init_os (etree_type *);
76 static void init_map_userdata (bfd *, asection *, void *);
77 static lang_input_statement_type *lookup_name (const char *);
78 static struct bfd_hash_entry *lang_definedness_newfunc
79 (struct bfd_hash_entry *, struct bfd_hash_table *, const char *);
80 static void insert_undefined (const char *);
81 static bfd_boolean sort_def_symbol (struct bfd_link_hash_entry *, void *);
82 static void print_statement (lang_statement_union_type *,
83 lang_output_section_statement_type *);
84 static void print_statement_list (lang_statement_union_type *,
85 lang_output_section_statement_type *);
86 static void print_statements (void);
87 static void print_input_section (asection *, bfd_boolean);
88 static bfd_boolean lang_one_common (struct bfd_link_hash_entry *, void *);
89 static void lang_record_phdrs (void);
90 static void lang_do_version_exports_section (void);
91 static void lang_finalize_version_expr_head
92 (struct bfd_elf_version_expr_head *);
94 /* Exported variables. */
95 const char *output_target;
96 lang_output_section_statement_type *abs_output_section;
97 lang_statement_list_type lang_output_section_statement;
98 lang_statement_list_type *stat_ptr = &statement_list;
99 lang_statement_list_type file_chain = { NULL, NULL };
100 lang_statement_list_type input_file_chain;
101 struct bfd_sym_chain entry_symbol = { NULL, NULL };
102 const char *entry_section = ".text";
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;
111 bfd_boolean missing_file = FALSE;
113 /* Functions that traverse the linker script and might evaluate
114 DEFINED() need to increment this. */
115 int lang_statement_iteration = 0;
117 etree_type *base; /* Relocation base - or null */
119 /* Return TRUE if the PATTERN argument is a wildcard pattern.
120 Although backslashes are treated specially if a pattern contains
121 wildcards, we do not consider the mere presence of a backslash to
122 be enough to cause the pattern to be treated as a wildcard.
123 That lets us handle DOS filenames more naturally. */
124 #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL)
126 #define new_stat(x, y) \
127 (x##_type *) new_statement (x##_enum, sizeof (x##_type), y)
129 #define outside_section_address(q) \
130 ((q)->output_offset + (q)->output_section->vma)
132 #define outside_symbol_address(q) \
133 ((q)->value + outside_section_address (q->section))
135 #define SECTION_NAME_MAP_LENGTH (16)
138 stat_alloc (size_t size)
140 return obstack_alloc (&stat_obstack, size);
144 name_match (const char *pattern, const char *name)
146 if (wildcardp (pattern))
147 return fnmatch (pattern, name, 0);
148 return strcmp (pattern, name);
151 /* If PATTERN is of the form archive:file, return a pointer to the
152 separator. If not, return NULL. */
155 archive_path (const char *pattern)
159 if (link_info.path_separator == 0)
162 p = strchr (pattern, link_info.path_separator);
163 #ifdef HAVE_DOS_BASED_FILE_SYSTEM
164 if (p == NULL || link_info.path_separator != ':')
167 /* Assume a match on the second char is part of drive specifier,
168 as in "c:\silly.dos". */
169 if (p == pattern + 1 && ISALPHA (*pattern))
170 p = strchr (p + 1, link_info.path_separator);
175 /* Given that FILE_SPEC results in a non-NULL SEP result from archive_path,
176 return whether F matches FILE_SPEC. */
179 input_statement_is_archive_path (const char *file_spec, char *sep,
180 lang_input_statement_type *f)
182 bfd_boolean match = FALSE;
185 || name_match (sep + 1, f->filename) == 0)
186 && ((sep != file_spec)
187 == (f->the_bfd != NULL && f->the_bfd->my_archive != NULL)))
191 if (sep != file_spec)
193 const char *aname = f->the_bfd->my_archive->filename;
195 match = name_match (file_spec, aname) == 0;
196 *sep = link_info.path_separator;
203 unique_section_p (const asection *sec,
204 const lang_output_section_statement_type *os)
206 struct unique_sections *unam;
209 if (link_info.relocatable
210 && sec->owner != NULL
211 && bfd_is_group_section (sec->owner, sec))
213 && strcmp (os->name, DISCARD_SECTION_NAME) == 0);
216 for (unam = unique_section_list; unam; unam = unam->next)
217 if (name_match (unam->name, secnam) == 0)
223 /* Generic traversal routines for finding matching sections. */
225 /* Try processing a section against a wildcard. This just calls
226 the callback unless the filename exclusion list is present
227 and excludes the file. It's hardly ever present so this
228 function is very fast. */
231 walk_wild_consider_section (lang_wild_statement_type *ptr,
232 lang_input_statement_type *file,
234 struct wildcard_list *sec,
238 struct name_list *list_tmp;
240 /* Don't process sections from files which were excluded. */
241 for (list_tmp = sec->spec.exclude_name_list;
243 list_tmp = list_tmp->next)
245 char *p = archive_path (list_tmp->name);
249 if (input_statement_is_archive_path (list_tmp->name, p, file))
253 else if (name_match (list_tmp->name, file->filename) == 0)
256 /* FIXME: Perhaps remove the following at some stage? Matching
257 unadorned archives like this was never documented and has
258 been superceded by the archive:path syntax. */
259 else if (file->the_bfd != NULL
260 && file->the_bfd->my_archive != NULL
261 && name_match (list_tmp->name,
262 file->the_bfd->my_archive->filename) == 0)
266 (*callback) (ptr, sec, s, file, data);
269 /* Lowest common denominator routine that can handle everything correctly,
273 walk_wild_section_general (lang_wild_statement_type *ptr,
274 lang_input_statement_type *file,
279 struct wildcard_list *sec;
281 for (s = file->the_bfd->sections; s != NULL; s = s->next)
283 sec = ptr->section_list;
285 (*callback) (ptr, sec, s, file, data);
289 bfd_boolean skip = FALSE;
291 if (sec->spec.name != NULL)
293 const char *sname = bfd_get_section_name (file->the_bfd, s);
295 skip = name_match (sec->spec.name, sname) != 0;
299 walk_wild_consider_section (ptr, file, s, sec, callback, data);
306 /* Routines to find a single section given its name. If there's more
307 than one section with that name, we report that. */
311 asection *found_section;
312 bfd_boolean multiple_sections_found;
313 } section_iterator_callback_data;
316 section_iterator_callback (bfd *abfd ATTRIBUTE_UNUSED, asection *s, void *data)
318 section_iterator_callback_data *d = (section_iterator_callback_data *) data;
320 if (d->found_section != NULL)
322 d->multiple_sections_found = TRUE;
326 d->found_section = s;
331 find_section (lang_input_statement_type *file,
332 struct wildcard_list *sec,
333 bfd_boolean *multiple_sections_found)
335 section_iterator_callback_data cb_data = { NULL, FALSE };
337 bfd_get_section_by_name_if (file->the_bfd, sec->spec.name,
338 section_iterator_callback, &cb_data);
339 *multiple_sections_found = cb_data.multiple_sections_found;
340 return cb_data.found_section;
343 /* Code for handling simple wildcards without going through fnmatch,
344 which can be expensive because of charset translations etc. */
346 /* A simple wild is a literal string followed by a single '*',
347 where the literal part is at least 4 characters long. */
350 is_simple_wild (const char *name)
352 size_t len = strcspn (name, "*?[");
353 return len >= 4 && name[len] == '*' && name[len + 1] == '\0';
357 match_simple_wild (const char *pattern, const char *name)
359 /* The first four characters of the pattern are guaranteed valid
360 non-wildcard characters. So we can go faster. */
361 if (pattern[0] != name[0] || pattern[1] != name[1]
362 || pattern[2] != name[2] || pattern[3] != name[3])
367 while (*pattern != '*')
368 if (*name++ != *pattern++)
374 /* Compare sections ASEC and BSEC according to SORT. */
377 compare_section (sort_type sort, asection *asec, asection *bsec)
386 case by_alignment_name:
387 ret = (bfd_section_alignment (bsec->owner, bsec)
388 - bfd_section_alignment (asec->owner, asec));
394 ret = strcmp (bfd_get_section_name (asec->owner, asec),
395 bfd_get_section_name (bsec->owner, bsec));
398 case by_name_alignment:
399 ret = strcmp (bfd_get_section_name (asec->owner, asec),
400 bfd_get_section_name (bsec->owner, bsec));
406 ret = (bfd_section_alignment (bsec->owner, bsec)
407 - bfd_section_alignment (asec->owner, asec));
414 /* Build a Binary Search Tree to sort sections, unlike insertion sort
415 used in wild_sort(). BST is considerably faster if the number of
416 of sections are large. */
418 static lang_section_bst_type **
419 wild_sort_fast (lang_wild_statement_type *wild,
420 struct wildcard_list *sec,
421 lang_input_statement_type *file ATTRIBUTE_UNUSED,
424 lang_section_bst_type **tree;
427 if (!wild->filenames_sorted
428 && (sec == NULL || sec->spec.sorted == none))
430 /* Append at the right end of tree. */
432 tree = &((*tree)->right);
438 /* Find the correct node to append this section. */
439 if (compare_section (sec->spec.sorted, section, (*tree)->section) < 0)
440 tree = &((*tree)->left);
442 tree = &((*tree)->right);
448 /* Use wild_sort_fast to build a BST to sort sections. */
451 output_section_callback_fast (lang_wild_statement_type *ptr,
452 struct wildcard_list *sec,
454 lang_input_statement_type *file,
457 lang_section_bst_type *node;
458 lang_section_bst_type **tree;
459 lang_output_section_statement_type *os;
461 os = (lang_output_section_statement_type *) output;
463 if (unique_section_p (section, os))
466 node = (lang_section_bst_type *) xmalloc (sizeof (lang_section_bst_type));
469 node->section = section;
471 tree = wild_sort_fast (ptr, sec, file, section);
476 /* Convert a sorted sections' BST back to list form. */
479 output_section_callback_tree_to_list (lang_wild_statement_type *ptr,
480 lang_section_bst_type *tree,
484 output_section_callback_tree_to_list (ptr, tree->left, output);
486 lang_add_section (&ptr->children, tree->section,
487 (lang_output_section_statement_type *) output);
490 output_section_callback_tree_to_list (ptr, tree->right, output);
495 /* Specialized, optimized routines for handling different kinds of
499 walk_wild_section_specs1_wild0 (lang_wild_statement_type *ptr,
500 lang_input_statement_type *file,
504 /* We can just do a hash lookup for the section with the right name.
505 But if that lookup discovers more than one section with the name
506 (should be rare), we fall back to the general algorithm because
507 we would otherwise have to sort the sections to make sure they
508 get processed in the bfd's order. */
509 bfd_boolean multiple_sections_found;
510 struct wildcard_list *sec0 = ptr->handler_data[0];
511 asection *s0 = find_section (file, sec0, &multiple_sections_found);
513 if (multiple_sections_found)
514 walk_wild_section_general (ptr, file, callback, data);
516 walk_wild_consider_section (ptr, file, s0, sec0, callback, data);
520 walk_wild_section_specs1_wild1 (lang_wild_statement_type *ptr,
521 lang_input_statement_type *file,
526 struct wildcard_list *wildsec0 = ptr->handler_data[0];
528 for (s = file->the_bfd->sections; s != NULL; s = s->next)
530 const char *sname = bfd_get_section_name (file->the_bfd, s);
531 bfd_boolean skip = !match_simple_wild (wildsec0->spec.name, sname);
534 walk_wild_consider_section (ptr, file, s, wildsec0, callback, data);
539 walk_wild_section_specs2_wild1 (lang_wild_statement_type *ptr,
540 lang_input_statement_type *file,
545 struct wildcard_list *sec0 = ptr->handler_data[0];
546 struct wildcard_list *wildsec1 = ptr->handler_data[1];
547 bfd_boolean multiple_sections_found;
548 asection *s0 = find_section (file, sec0, &multiple_sections_found);
550 if (multiple_sections_found)
552 walk_wild_section_general (ptr, file, callback, data);
556 /* Note that if the section was not found, s0 is NULL and
557 we'll simply never succeed the s == s0 test below. */
558 for (s = file->the_bfd->sections; s != NULL; s = s->next)
560 /* Recall that in this code path, a section cannot satisfy more
561 than one spec, so if s == s0 then it cannot match
564 walk_wild_consider_section (ptr, file, s, sec0, callback, data);
567 const char *sname = bfd_get_section_name (file->the_bfd, s);
568 bfd_boolean skip = !match_simple_wild (wildsec1->spec.name, sname);
571 walk_wild_consider_section (ptr, file, s, wildsec1, callback,
578 walk_wild_section_specs3_wild2 (lang_wild_statement_type *ptr,
579 lang_input_statement_type *file,
584 struct wildcard_list *sec0 = ptr->handler_data[0];
585 struct wildcard_list *wildsec1 = ptr->handler_data[1];
586 struct wildcard_list *wildsec2 = ptr->handler_data[2];
587 bfd_boolean multiple_sections_found;
588 asection *s0 = find_section (file, sec0, &multiple_sections_found);
590 if (multiple_sections_found)
592 walk_wild_section_general (ptr, file, callback, data);
596 for (s = file->the_bfd->sections; s != NULL; s = s->next)
599 walk_wild_consider_section (ptr, file, s, sec0, callback, data);
602 const char *sname = bfd_get_section_name (file->the_bfd, s);
603 bfd_boolean skip = !match_simple_wild (wildsec1->spec.name, sname);
606 walk_wild_consider_section (ptr, file, s, wildsec1, callback, data);
609 skip = !match_simple_wild (wildsec2->spec.name, sname);
611 walk_wild_consider_section (ptr, file, s, wildsec2, callback,
619 walk_wild_section_specs4_wild2 (lang_wild_statement_type *ptr,
620 lang_input_statement_type *file,
625 struct wildcard_list *sec0 = ptr->handler_data[0];
626 struct wildcard_list *sec1 = ptr->handler_data[1];
627 struct wildcard_list *wildsec2 = ptr->handler_data[2];
628 struct wildcard_list *wildsec3 = ptr->handler_data[3];
629 bfd_boolean multiple_sections_found;
630 asection *s0 = find_section (file, sec0, &multiple_sections_found), *s1;
632 if (multiple_sections_found)
634 walk_wild_section_general (ptr, file, callback, data);
638 s1 = find_section (file, sec1, &multiple_sections_found);
639 if (multiple_sections_found)
641 walk_wild_section_general (ptr, file, callback, data);
645 for (s = file->the_bfd->sections; s != NULL; s = s->next)
648 walk_wild_consider_section (ptr, file, s, sec0, callback, data);
651 walk_wild_consider_section (ptr, file, s, sec1, callback, data);
654 const char *sname = bfd_get_section_name (file->the_bfd, s);
655 bfd_boolean skip = !match_simple_wild (wildsec2->spec.name,
659 walk_wild_consider_section (ptr, file, s, wildsec2, callback,
663 skip = !match_simple_wild (wildsec3->spec.name, sname);
665 walk_wild_consider_section (ptr, file, s, wildsec3,
673 walk_wild_section (lang_wild_statement_type *ptr,
674 lang_input_statement_type *file,
678 if (file->just_syms_flag)
681 (*ptr->walk_wild_section_handler) (ptr, file, callback, data);
684 /* Returns TRUE when name1 is a wildcard spec that might match
685 something name2 can match. We're conservative: we return FALSE
686 only if the prefixes of name1 and name2 are different up to the
687 first wildcard character. */
690 wild_spec_can_overlap (const char *name1, const char *name2)
692 size_t prefix1_len = strcspn (name1, "?*[");
693 size_t prefix2_len = strcspn (name2, "?*[");
694 size_t min_prefix_len;
696 /* Note that if there is no wildcard character, then we treat the
697 terminating 0 as part of the prefix. Thus ".text" won't match
698 ".text." or ".text.*", for example. */
699 if (name1[prefix1_len] == '\0')
701 if (name2[prefix2_len] == '\0')
704 min_prefix_len = prefix1_len < prefix2_len ? prefix1_len : prefix2_len;
706 return memcmp (name1, name2, min_prefix_len) == 0;
709 /* Select specialized code to handle various kinds of wildcard
713 analyze_walk_wild_section_handler (lang_wild_statement_type *ptr)
716 int wild_name_count = 0;
717 struct wildcard_list *sec;
721 ptr->walk_wild_section_handler = walk_wild_section_general;
722 ptr->handler_data[0] = NULL;
723 ptr->handler_data[1] = NULL;
724 ptr->handler_data[2] = NULL;
725 ptr->handler_data[3] = NULL;
728 /* Count how many wildcard_specs there are, and how many of those
729 actually use wildcards in the name. Also, bail out if any of the
730 wildcard names are NULL. (Can this actually happen?
731 walk_wild_section used to test for it.) And bail out if any
732 of the wildcards are more complex than a simple string
733 ending in a single '*'. */
734 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
737 if (sec->spec.name == NULL)
739 if (wildcardp (sec->spec.name))
742 if (!is_simple_wild (sec->spec.name))
747 /* The zero-spec case would be easy to optimize but it doesn't
748 happen in practice. Likewise, more than 4 specs doesn't
749 happen in practice. */
750 if (sec_count == 0 || sec_count > 4)
753 /* Check that no two specs can match the same section. */
754 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
756 struct wildcard_list *sec2;
757 for (sec2 = sec->next; sec2 != NULL; sec2 = sec2->next)
759 if (wild_spec_can_overlap (sec->spec.name, sec2->spec.name))
764 signature = (sec_count << 8) + wild_name_count;
768 ptr->walk_wild_section_handler = walk_wild_section_specs1_wild0;
771 ptr->walk_wild_section_handler = walk_wild_section_specs1_wild1;
774 ptr->walk_wild_section_handler = walk_wild_section_specs2_wild1;
777 ptr->walk_wild_section_handler = walk_wild_section_specs3_wild2;
780 ptr->walk_wild_section_handler = walk_wild_section_specs4_wild2;
786 /* Now fill the data array with pointers to the specs, first the
787 specs with non-wildcard names, then the specs with wildcard
788 names. It's OK to process the specs in different order from the
789 given order, because we've already determined that no section
790 will match more than one spec. */
792 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
793 if (!wildcardp (sec->spec.name))
794 ptr->handler_data[data_counter++] = sec;
795 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
796 if (wildcardp (sec->spec.name))
797 ptr->handler_data[data_counter++] = sec;
800 /* Handle a wild statement for a single file F. */
803 walk_wild_file (lang_wild_statement_type *s,
804 lang_input_statement_type *f,
808 if (f->the_bfd == NULL
809 || ! bfd_check_format (f->the_bfd, bfd_archive))
810 walk_wild_section (s, f, callback, data);
815 /* This is an archive file. We must map each member of the
816 archive separately. */
817 member = bfd_openr_next_archived_file (f->the_bfd, NULL);
818 while (member != NULL)
820 /* When lookup_name is called, it will call the add_symbols
821 entry point for the archive. For each element of the
822 archive which is included, BFD will call ldlang_add_file,
823 which will set the usrdata field of the member to the
824 lang_input_statement. */
825 if (member->usrdata != NULL)
827 walk_wild_section (s,
828 (lang_input_statement_type *) member->usrdata,
832 member = bfd_openr_next_archived_file (f->the_bfd, member);
838 walk_wild (lang_wild_statement_type *s, callback_t callback, void *data)
840 const char *file_spec = s->filename;
843 if (file_spec == NULL)
845 /* Perform the iteration over all files in the list. */
846 LANG_FOR_EACH_INPUT_STATEMENT (f)
848 walk_wild_file (s, f, callback, data);
851 else if ((p = archive_path (file_spec)) != NULL)
853 LANG_FOR_EACH_INPUT_STATEMENT (f)
855 if (input_statement_is_archive_path (file_spec, p, f))
856 walk_wild_file (s, f, callback, data);
859 else if (wildcardp (file_spec))
861 LANG_FOR_EACH_INPUT_STATEMENT (f)
863 if (fnmatch (file_spec, f->filename, 0) == 0)
864 walk_wild_file (s, f, callback, data);
869 lang_input_statement_type *f;
871 /* Perform the iteration over a single file. */
872 f = lookup_name (file_spec);
874 walk_wild_file (s, f, callback, data);
878 /* lang_for_each_statement walks the parse tree and calls the provided
879 function for each node, except those inside output section statements
880 with constraint set to -1. */
883 lang_for_each_statement_worker (void (*func) (lang_statement_union_type *),
884 lang_statement_union_type *s)
886 for (; s != NULL; s = s->header.next)
890 switch (s->header.type)
892 case lang_constructors_statement_enum:
893 lang_for_each_statement_worker (func, constructor_list.head);
895 case lang_output_section_statement_enum:
896 if (s->output_section_statement.constraint != -1)
897 lang_for_each_statement_worker
898 (func, s->output_section_statement.children.head);
900 case lang_wild_statement_enum:
901 lang_for_each_statement_worker (func,
902 s->wild_statement.children.head);
904 case lang_group_statement_enum:
905 lang_for_each_statement_worker (func,
906 s->group_statement.children.head);
908 case lang_data_statement_enum:
909 case lang_reloc_statement_enum:
910 case lang_object_symbols_statement_enum:
911 case lang_output_statement_enum:
912 case lang_target_statement_enum:
913 case lang_input_section_enum:
914 case lang_input_statement_enum:
915 case lang_assignment_statement_enum:
916 case lang_padding_statement_enum:
917 case lang_address_statement_enum:
918 case lang_fill_statement_enum:
919 case lang_insert_statement_enum:
929 lang_for_each_statement (void (*func) (lang_statement_union_type *))
931 lang_for_each_statement_worker (func, statement_list.head);
934 /*----------------------------------------------------------------------*/
937 lang_list_init (lang_statement_list_type *list)
940 list->tail = &list->head;
944 push_stat_ptr (lang_statement_list_type *new_ptr)
946 if (stat_save_ptr >= stat_save + sizeof (stat_save) / sizeof (stat_save[0]))
948 *stat_save_ptr++ = stat_ptr;
955 if (stat_save_ptr <= stat_save)
957 stat_ptr = *--stat_save_ptr;
960 /* Build a new statement node for the parse tree. */
962 static lang_statement_union_type *
963 new_statement (enum statement_enum type,
965 lang_statement_list_type *list)
967 lang_statement_union_type *new_stmt;
969 new_stmt = (lang_statement_union_type *) stat_alloc (size);
970 new_stmt->header.type = type;
971 new_stmt->header.next = NULL;
972 lang_statement_append (list, new_stmt, &new_stmt->header.next);
976 /* Build a new input file node for the language. There are several
977 ways in which we treat an input file, eg, we only look at symbols,
978 or prefix it with a -l etc.
980 We can be supplied with requests for input files more than once;
981 they may, for example be split over several lines like foo.o(.text)
982 foo.o(.data) etc, so when asked for a file we check that we haven't
983 got it already so we don't duplicate the bfd. */
985 static lang_input_statement_type *
986 new_afile (const char *name,
987 lang_input_file_enum_type file_type,
989 bfd_boolean add_to_list)
991 lang_input_statement_type *p;
994 p = (lang_input_statement_type *) new_stat (lang_input_statement, stat_ptr);
997 p = (lang_input_statement_type *)
998 stat_alloc (sizeof (lang_input_statement_type));
999 p->header.type = lang_input_statement_enum;
1000 p->header.next = NULL;
1003 lang_has_input_file = TRUE;
1005 p->sysrooted = FALSE;
1007 if (file_type == lang_input_file_is_l_enum
1008 && name[0] == ':' && name[1] != '\0')
1010 file_type = lang_input_file_is_search_file_enum;
1016 case lang_input_file_is_symbols_only_enum:
1018 p->maybe_archive = FALSE;
1020 p->local_sym_name = name;
1021 p->just_syms_flag = TRUE;
1022 p->search_dirs_flag = FALSE;
1024 case lang_input_file_is_fake_enum:
1026 p->maybe_archive = FALSE;
1028 p->local_sym_name = name;
1029 p->just_syms_flag = FALSE;
1030 p->search_dirs_flag = FALSE;
1032 case lang_input_file_is_l_enum:
1033 p->maybe_archive = TRUE;
1036 p->local_sym_name = concat ("-l", name, (const char *) NULL);
1037 p->just_syms_flag = FALSE;
1038 p->search_dirs_flag = TRUE;
1040 case lang_input_file_is_marker_enum:
1042 p->maybe_archive = FALSE;
1044 p->local_sym_name = name;
1045 p->just_syms_flag = FALSE;
1046 p->search_dirs_flag = TRUE;
1048 case lang_input_file_is_search_file_enum:
1049 p->sysrooted = ldlang_sysrooted_script;
1051 p->maybe_archive = FALSE;
1053 p->local_sym_name = name;
1054 p->just_syms_flag = FALSE;
1055 p->search_dirs_flag = TRUE;
1057 case lang_input_file_is_file_enum:
1059 p->maybe_archive = FALSE;
1061 p->local_sym_name = name;
1062 p->just_syms_flag = FALSE;
1063 p->search_dirs_flag = FALSE;
1069 p->next_real_file = NULL;
1071 p->dynamic = config.dynamic_link;
1072 p->add_DT_NEEDED_for_dynamic = add_DT_NEEDED_for_dynamic;
1073 p->add_DT_NEEDED_for_regular = add_DT_NEEDED_for_regular;
1074 p->whole_archive = whole_archive;
1076 p->missing_file = FALSE;
1078 lang_statement_append (&input_file_chain,
1079 (lang_statement_union_type *) p,
1080 &p->next_real_file);
1084 lang_input_statement_type *
1085 lang_add_input_file (const char *name,
1086 lang_input_file_enum_type file_type,
1089 return new_afile (name, file_type, target, TRUE);
1092 struct out_section_hash_entry
1094 struct bfd_hash_entry root;
1095 lang_statement_union_type s;
1098 /* The hash table. */
1100 static struct bfd_hash_table output_section_statement_table;
1102 /* Support routines for the hash table used by lang_output_section_find,
1103 initialize the table, fill in an entry and remove the table. */
1105 static struct bfd_hash_entry *
1106 output_section_statement_newfunc (struct bfd_hash_entry *entry,
1107 struct bfd_hash_table *table,
1110 lang_output_section_statement_type **nextp;
1111 struct out_section_hash_entry *ret;
1115 entry = (struct bfd_hash_entry *) bfd_hash_allocate (table,
1121 entry = bfd_hash_newfunc (entry, table, string);
1125 ret = (struct out_section_hash_entry *) entry;
1126 memset (&ret->s, 0, sizeof (ret->s));
1127 ret->s.header.type = lang_output_section_statement_enum;
1128 ret->s.output_section_statement.subsection_alignment = -1;
1129 ret->s.output_section_statement.section_alignment = -1;
1130 ret->s.output_section_statement.block_value = 1;
1131 lang_list_init (&ret->s.output_section_statement.children);
1132 lang_statement_append (stat_ptr, &ret->s, &ret->s.header.next);
1134 /* For every output section statement added to the list, except the
1135 first one, lang_output_section_statement.tail points to the "next"
1136 field of the last element of the list. */
1137 if (lang_output_section_statement.head != NULL)
1138 ret->s.output_section_statement.prev
1139 = ((lang_output_section_statement_type *)
1140 ((char *) lang_output_section_statement.tail
1141 - offsetof (lang_output_section_statement_type, next)));
1143 /* GCC's strict aliasing rules prevent us from just casting the
1144 address, so we store the pointer in a variable and cast that
1146 nextp = &ret->s.output_section_statement.next;
1147 lang_statement_append (&lang_output_section_statement,
1149 (lang_statement_union_type **) nextp);
1154 output_section_statement_table_init (void)
1156 if (!bfd_hash_table_init_n (&output_section_statement_table,
1157 output_section_statement_newfunc,
1158 sizeof (struct out_section_hash_entry),
1160 einfo (_("%P%F: can not create hash table: %E\n"));
1164 output_section_statement_table_free (void)
1166 bfd_hash_table_free (&output_section_statement_table);
1169 /* Build enough state so that the parser can build its tree. */
1174 obstack_begin (&stat_obstack, 1000);
1176 stat_ptr = &statement_list;
1178 output_section_statement_table_init ();
1180 lang_list_init (stat_ptr);
1182 lang_list_init (&input_file_chain);
1183 lang_list_init (&lang_output_section_statement);
1184 lang_list_init (&file_chain);
1185 first_file = lang_add_input_file (NULL, lang_input_file_is_marker_enum,
1187 abs_output_section =
1188 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME, 0, TRUE);
1190 abs_output_section->bfd_section = bfd_abs_section_ptr;
1192 /* The value "3" is ad-hoc, somewhat related to the expected number of
1193 DEFINED expressions in a linker script. For most default linker
1194 scripts, there are none. Why a hash table then? Well, it's somewhat
1195 simpler to re-use working machinery than using a linked list in terms
1196 of code-complexity here in ld, besides the initialization which just
1197 looks like other code here. */
1198 if (!bfd_hash_table_init_n (&lang_definedness_table,
1199 lang_definedness_newfunc,
1200 sizeof (struct lang_definedness_hash_entry),
1202 einfo (_("%P%F: can not create hash table: %E\n"));
1208 output_section_statement_table_free ();
1211 /*----------------------------------------------------------------------
1212 A region is an area of memory declared with the
1213 MEMORY { name:org=exp, len=exp ... }
1216 We maintain a list of all the regions here.
1218 If no regions are specified in the script, then the default is used
1219 which is created when looked up to be the entire data space.
1221 If create is true we are creating a region inside a MEMORY block.
1222 In this case it is probably an error to create a region that has
1223 already been created. If we are not inside a MEMORY block it is
1224 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1225 and so we issue a warning.
1227 Each region has at least one name. The first name is either
1228 DEFAULT_MEMORY_REGION or the name given in the MEMORY block. You can add
1229 alias names to an existing region within a script with
1230 REGION_ALIAS (alias, region_name). Each name corresponds to at most one
1233 static lang_memory_region_type *lang_memory_region_list;
1234 static lang_memory_region_type **lang_memory_region_list_tail
1235 = &lang_memory_region_list;
1237 lang_memory_region_type *
1238 lang_memory_region_lookup (const char *const name, bfd_boolean create)
1240 lang_memory_region_name *n;
1241 lang_memory_region_type *r;
1242 lang_memory_region_type *new_region;
1244 /* NAME is NULL for LMA memspecs if no region was specified. */
1248 for (r = lang_memory_region_list; r != NULL; r = r->next)
1249 for (n = &r->name_list; n != NULL; n = n->next)
1250 if (strcmp (n->name, name) == 0)
1253 einfo (_("%P:%S: warning: redeclaration of memory region `%s'\n"),
1258 if (!create && strcmp (name, DEFAULT_MEMORY_REGION))
1259 einfo (_("%P:%S: warning: memory region `%s' not declared\n"), name);
1261 new_region = (lang_memory_region_type *)
1262 stat_alloc (sizeof (lang_memory_region_type));
1264 new_region->name_list.name = xstrdup (name);
1265 new_region->name_list.next = NULL;
1266 new_region->next = NULL;
1267 new_region->origin = 0;
1268 new_region->length = ~(bfd_size_type) 0;
1269 new_region->current = 0;
1270 new_region->last_os = NULL;
1271 new_region->flags = 0;
1272 new_region->not_flags = 0;
1273 new_region->had_full_message = FALSE;
1275 *lang_memory_region_list_tail = new_region;
1276 lang_memory_region_list_tail = &new_region->next;
1282 lang_memory_region_alias (const char * alias, const char * region_name)
1284 lang_memory_region_name * n;
1285 lang_memory_region_type * r;
1286 lang_memory_region_type * region;
1288 /* The default region must be unique. This ensures that it is not necessary
1289 to iterate through the name list if someone wants the check if a region is
1290 the default memory region. */
1291 if (strcmp (region_name, DEFAULT_MEMORY_REGION) == 0
1292 || strcmp (alias, DEFAULT_MEMORY_REGION) == 0)
1293 einfo (_("%F%P:%S: error: alias for default memory region\n"));
1295 /* Look for the target region and check if the alias is not already
1298 for (r = lang_memory_region_list; r != NULL; r = r->next)
1299 for (n = &r->name_list; n != NULL; n = n->next)
1301 if (region == NULL && strcmp (n->name, region_name) == 0)
1303 if (strcmp (n->name, alias) == 0)
1304 einfo (_("%F%P:%S: error: redefinition of memory region "
1309 /* Check if the target region exists. */
1311 einfo (_("%F%P:%S: error: memory region `%s' "
1312 "for alias `%s' does not exist\n"),
1316 /* Add alias to region name list. */
1317 n = (lang_memory_region_name *) stat_alloc (sizeof (lang_memory_region_name));
1318 n->name = xstrdup (alias);
1319 n->next = region->name_list.next;
1320 region->name_list.next = n;
1323 static lang_memory_region_type *
1324 lang_memory_default (asection * section)
1326 lang_memory_region_type *p;
1328 flagword sec_flags = section->flags;
1330 /* Override SEC_DATA to mean a writable section. */
1331 if ((sec_flags & (SEC_ALLOC | SEC_READONLY | SEC_CODE)) == SEC_ALLOC)
1332 sec_flags |= SEC_DATA;
1334 for (p = lang_memory_region_list; p != NULL; p = p->next)
1336 if ((p->flags & sec_flags) != 0
1337 && (p->not_flags & sec_flags) == 0)
1342 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION, FALSE);
1345 /* Find or create an output_section_statement with the given NAME.
1346 If CONSTRAINT is non-zero match one with that constraint, otherwise
1347 match any non-negative constraint. If CREATE, always make a
1348 new output_section_statement for SPECIAL CONSTRAINT. */
1350 lang_output_section_statement_type *
1351 lang_output_section_statement_lookup (const char *name,
1355 struct out_section_hash_entry *entry;
1357 entry = ((struct out_section_hash_entry *)
1358 bfd_hash_lookup (&output_section_statement_table, name,
1363 einfo (_("%P%F: failed creating section `%s': %E\n"), name);
1367 if (entry->s.output_section_statement.name != NULL)
1369 /* We have a section of this name, but it might not have the correct
1371 struct out_section_hash_entry *last_ent;
1373 name = entry->s.output_section_statement.name;
1374 if (create && constraint == SPECIAL)
1375 /* Not traversing to the end reverses the order of the second
1376 and subsequent SPECIAL sections in the hash table chain,
1377 but that shouldn't matter. */
1382 if (constraint == entry->s.output_section_statement.constraint
1384 && entry->s.output_section_statement.constraint >= 0))
1385 return &entry->s.output_section_statement;
1387 entry = (struct out_section_hash_entry *) entry->root.next;
1389 while (entry != NULL
1390 && name == entry->s.output_section_statement.name);
1396 = ((struct out_section_hash_entry *)
1397 output_section_statement_newfunc (NULL,
1398 &output_section_statement_table,
1402 einfo (_("%P%F: failed creating section `%s': %E\n"), name);
1405 entry->root = last_ent->root;
1406 last_ent->root.next = &entry->root;
1409 entry->s.output_section_statement.name = name;
1410 entry->s.output_section_statement.constraint = constraint;
1411 return &entry->s.output_section_statement;
1414 /* Find the next output_section_statement with the same name as OS.
1415 If CONSTRAINT is non-zero, find one with that constraint otherwise
1416 match any non-negative constraint. */
1418 lang_output_section_statement_type *
1419 next_matching_output_section_statement (lang_output_section_statement_type *os,
1422 /* All output_section_statements are actually part of a
1423 struct out_section_hash_entry. */
1424 struct out_section_hash_entry *entry = (struct out_section_hash_entry *)
1426 - offsetof (struct out_section_hash_entry, s.output_section_statement));
1427 const char *name = os->name;
1429 ASSERT (name == entry->root.string);
1432 entry = (struct out_section_hash_entry *) entry->root.next;
1434 || name != entry->s.output_section_statement.name)
1437 while (constraint != entry->s.output_section_statement.constraint
1439 || entry->s.output_section_statement.constraint < 0));
1441 return &entry->s.output_section_statement;
1444 /* A variant of lang_output_section_find used by place_orphan.
1445 Returns the output statement that should precede a new output
1446 statement for SEC. If an exact match is found on certain flags,
1449 lang_output_section_statement_type *
1450 lang_output_section_find_by_flags (const asection *sec,
1451 lang_output_section_statement_type **exact,
1452 lang_match_sec_type_func match_type)
1454 lang_output_section_statement_type *first, *look, *found;
1457 /* We know the first statement on this list is *ABS*. May as well
1459 first = &lang_output_section_statement.head->output_section_statement;
1460 first = first->next;
1462 /* First try for an exact match. */
1464 for (look = first; look; look = look->next)
1466 flags = look->flags;
1467 if (look->bfd_section != NULL)
1469 flags = look->bfd_section->flags;
1470 if (match_type && !match_type (link_info.output_bfd,
1475 flags ^= sec->flags;
1476 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD | SEC_READONLY
1477 | SEC_CODE | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1487 if ((sec->flags & SEC_CODE) != 0
1488 && (sec->flags & SEC_ALLOC) != 0)
1490 /* Try for a rw code section. */
1491 for (look = first; look; look = look->next)
1493 flags = look->flags;
1494 if (look->bfd_section != NULL)
1496 flags = look->bfd_section->flags;
1497 if (match_type && !match_type (link_info.output_bfd,
1502 flags ^= sec->flags;
1503 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1504 | SEC_CODE | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1508 else if ((sec->flags & (SEC_READONLY | SEC_THREAD_LOCAL)) != 0
1509 && (sec->flags & SEC_ALLOC) != 0)
1511 /* .rodata can go after .text, .sdata2 after .rodata. */
1512 for (look = first; look; look = look->next)
1514 flags = look->flags;
1515 if (look->bfd_section != NULL)
1517 flags = look->bfd_section->flags;
1518 if (match_type && !match_type (link_info.output_bfd,
1523 flags ^= sec->flags;
1524 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1526 && !(look->flags & (SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1530 else if ((sec->flags & SEC_SMALL_DATA) != 0
1531 && (sec->flags & SEC_ALLOC) != 0)
1533 /* .sdata goes after .data, .sbss after .sdata. */
1534 for (look = first; look; look = look->next)
1536 flags = look->flags;
1537 if (look->bfd_section != NULL)
1539 flags = look->bfd_section->flags;
1540 if (match_type && !match_type (link_info.output_bfd,
1545 flags ^= sec->flags;
1546 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1547 | SEC_THREAD_LOCAL))
1548 || ((look->flags & SEC_SMALL_DATA)
1549 && !(sec->flags & SEC_HAS_CONTENTS)))
1553 else if ((sec->flags & SEC_HAS_CONTENTS) != 0
1554 && (sec->flags & SEC_ALLOC) != 0)
1556 /* .data goes after .rodata. */
1557 for (look = first; look; look = look->next)
1559 flags = look->flags;
1560 if (look->bfd_section != NULL)
1562 flags = look->bfd_section->flags;
1563 if (match_type && !match_type (link_info.output_bfd,
1568 flags ^= sec->flags;
1569 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1570 | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1574 else if ((sec->flags & SEC_ALLOC) != 0)
1576 /* .bss goes after any other alloc section. */
1577 for (look = first; look; look = look->next)
1579 flags = look->flags;
1580 if (look->bfd_section != NULL)
1582 flags = look->bfd_section->flags;
1583 if (match_type && !match_type (link_info.output_bfd,
1588 flags ^= sec->flags;
1589 if (!(flags & SEC_ALLOC))
1595 /* non-alloc go last. */
1596 for (look = first; look; look = look->next)
1598 flags = look->flags;
1599 if (look->bfd_section != NULL)
1600 flags = look->bfd_section->flags;
1601 flags ^= sec->flags;
1602 if (!(flags & SEC_DEBUGGING))
1608 if (found || !match_type)
1611 return lang_output_section_find_by_flags (sec, NULL, NULL);
1614 /* Find the last output section before given output statement.
1615 Used by place_orphan. */
1618 output_prev_sec_find (lang_output_section_statement_type *os)
1620 lang_output_section_statement_type *lookup;
1622 for (lookup = os->prev; lookup != NULL; lookup = lookup->prev)
1624 if (lookup->constraint < 0)
1627 if (lookup->bfd_section != NULL && lookup->bfd_section->owner != NULL)
1628 return lookup->bfd_section;
1634 /* Look for a suitable place for a new output section statement. The
1635 idea is to skip over anything that might be inside a SECTIONS {}
1636 statement in a script, before we find another output section
1637 statement. Assignments to "dot" before an output section statement
1638 are assumed to belong to it, except in two cases; The first
1639 assignment to dot, and assignments before non-alloc sections.
1640 Otherwise we might put an orphan before . = . + SIZEOF_HEADERS or
1641 similar assignments that set the initial address, or we might
1642 insert non-alloc note sections among assignments setting end of
1645 static lang_statement_union_type **
1646 insert_os_after (lang_output_section_statement_type *after)
1648 lang_statement_union_type **where;
1649 lang_statement_union_type **assign = NULL;
1650 bfd_boolean ignore_first;
1653 = after == &lang_output_section_statement.head->output_section_statement;
1655 for (where = &after->header.next;
1657 where = &(*where)->header.next)
1659 switch ((*where)->header.type)
1661 case lang_assignment_statement_enum:
1664 lang_assignment_statement_type *ass;
1666 ass = &(*where)->assignment_statement;
1667 if (ass->exp->type.node_class != etree_assert
1668 && ass->exp->assign.dst[0] == '.'
1669 && ass->exp->assign.dst[1] == 0
1673 ignore_first = FALSE;
1675 case lang_wild_statement_enum:
1676 case lang_input_section_enum:
1677 case lang_object_symbols_statement_enum:
1678 case lang_fill_statement_enum:
1679 case lang_data_statement_enum:
1680 case lang_reloc_statement_enum:
1681 case lang_padding_statement_enum:
1682 case lang_constructors_statement_enum:
1685 case lang_output_section_statement_enum:
1688 asection *s = (*where)->output_section_statement.bfd_section;
1691 || s->map_head.s == NULL
1692 || (s->flags & SEC_ALLOC) != 0)
1696 case lang_input_statement_enum:
1697 case lang_address_statement_enum:
1698 case lang_target_statement_enum:
1699 case lang_output_statement_enum:
1700 case lang_group_statement_enum:
1701 case lang_insert_statement_enum:
1710 lang_output_section_statement_type *
1711 lang_insert_orphan (asection *s,
1712 const char *secname,
1714 lang_output_section_statement_type *after,
1715 struct orphan_save *place,
1716 etree_type *address,
1717 lang_statement_list_type *add_child)
1719 lang_statement_list_type add;
1721 lang_output_section_statement_type *os;
1722 lang_output_section_statement_type **os_tail;
1724 /* If we have found an appropriate place for the output section
1725 statements for this orphan, add them to our own private list,
1726 inserting them later into the global statement list. */
1729 lang_list_init (&add);
1730 push_stat_ptr (&add);
1733 if (link_info.relocatable || (s->flags & (SEC_LOAD | SEC_ALLOC)) == 0)
1734 address = exp_intop (0);
1736 os_tail = ((lang_output_section_statement_type **)
1737 lang_output_section_statement.tail);
1738 os = lang_enter_output_section_statement (secname, address, normal_section,
1739 NULL, NULL, NULL, constraint);
1742 if (config.build_constructors && *os_tail == os)
1744 /* If the name of the section is representable in C, then create
1745 symbols to mark the start and the end of the section. */
1746 for (ps = secname; *ps != '\0'; ps++)
1747 if (! ISALNUM ((unsigned char) *ps) && *ps != '_')
1752 etree_type *e_align;
1754 symname = (char *) xmalloc (ps - secname + sizeof "__start_" + 1);
1755 symname[0] = bfd_get_symbol_leading_char (link_info.output_bfd);
1756 sprintf (symname + (symname[0] != 0), "__start_%s", secname);
1757 e_align = exp_unop (ALIGN_K,
1758 exp_intop ((bfd_vma) 1 << s->alignment_power));
1759 lang_add_assignment (exp_assop ('=', ".", e_align));
1760 lang_add_assignment (exp_provide (symname,
1762 exp_nameop (NAME, ".")),
1767 if (add_child == NULL)
1768 add_child = &os->children;
1769 lang_add_section (add_child, s, os);
1771 if (after && (s->flags & (SEC_LOAD | SEC_ALLOC)) != 0)
1773 const char *region = (after->region
1774 ? after->region->name_list.name
1775 : DEFAULT_MEMORY_REGION);
1776 const char *lma_region = (after->lma_region
1777 ? after->lma_region->name_list.name
1779 lang_leave_output_section_statement (NULL, region, after->phdrs,
1783 lang_leave_output_section_statement (NULL, DEFAULT_MEMORY_REGION, NULL,
1786 if (ps != NULL && *ps == '\0')
1790 symname = (char *) xmalloc (ps - secname + sizeof "__stop_" + 1);
1791 symname[0] = bfd_get_symbol_leading_char (link_info.output_bfd);
1792 sprintf (symname + (symname[0] != 0), "__stop_%s", secname);
1793 lang_add_assignment (exp_provide (symname,
1794 exp_nameop (NAME, "."),
1798 /* Restore the global list pointer. */
1802 if (after != NULL && os->bfd_section != NULL)
1804 asection *snew, *as;
1806 snew = os->bfd_section;
1808 /* Shuffle the bfd section list to make the output file look
1809 neater. This is really only cosmetic. */
1810 if (place->section == NULL
1811 && after != (&lang_output_section_statement.head
1812 ->output_section_statement))
1814 asection *bfd_section = after->bfd_section;
1816 /* If the output statement hasn't been used to place any input
1817 sections (and thus doesn't have an output bfd_section),
1818 look for the closest prior output statement having an
1820 if (bfd_section == NULL)
1821 bfd_section = output_prev_sec_find (after);
1823 if (bfd_section != NULL && bfd_section != snew)
1824 place->section = &bfd_section->next;
1827 if (place->section == NULL)
1828 place->section = &link_info.output_bfd->sections;
1830 as = *place->section;
1834 /* Put the section at the end of the list. */
1836 /* Unlink the section. */
1837 bfd_section_list_remove (link_info.output_bfd, snew);
1839 /* Now tack it back on in the right place. */
1840 bfd_section_list_append (link_info.output_bfd, snew);
1842 else if (as != snew && as->prev != snew)
1844 /* Unlink the section. */
1845 bfd_section_list_remove (link_info.output_bfd, snew);
1847 /* Now tack it back on in the right place. */
1848 bfd_section_list_insert_before (link_info.output_bfd, as, snew);
1851 /* Save the end of this list. Further ophans of this type will
1852 follow the one we've just added. */
1853 place->section = &snew->next;
1855 /* The following is non-cosmetic. We try to put the output
1856 statements in some sort of reasonable order here, because they
1857 determine the final load addresses of the orphan sections.
1858 In addition, placing output statements in the wrong order may
1859 require extra segments. For instance, given a typical
1860 situation of all read-only sections placed in one segment and
1861 following that a segment containing all the read-write
1862 sections, we wouldn't want to place an orphan read/write
1863 section before or amongst the read-only ones. */
1864 if (add.head != NULL)
1866 lang_output_section_statement_type *newly_added_os;
1868 if (place->stmt == NULL)
1870 lang_statement_union_type **where = insert_os_after (after);
1875 place->os_tail = &after->next;
1879 /* Put it after the last orphan statement we added. */
1880 *add.tail = *place->stmt;
1881 *place->stmt = add.head;
1884 /* Fix the global list pointer if we happened to tack our
1885 new list at the tail. */
1886 if (*stat_ptr->tail == add.head)
1887 stat_ptr->tail = add.tail;
1889 /* Save the end of this list. */
1890 place->stmt = add.tail;
1892 /* Do the same for the list of output section statements. */
1893 newly_added_os = *os_tail;
1895 newly_added_os->prev = (lang_output_section_statement_type *)
1896 ((char *) place->os_tail
1897 - offsetof (lang_output_section_statement_type, next));
1898 newly_added_os->next = *place->os_tail;
1899 if (newly_added_os->next != NULL)
1900 newly_added_os->next->prev = newly_added_os;
1901 *place->os_tail = newly_added_os;
1902 place->os_tail = &newly_added_os->next;
1904 /* Fixing the global list pointer here is a little different.
1905 We added to the list in lang_enter_output_section_statement,
1906 trimmed off the new output_section_statment above when
1907 assigning *os_tail = NULL, but possibly added it back in
1908 the same place when assigning *place->os_tail. */
1909 if (*os_tail == NULL)
1910 lang_output_section_statement.tail
1911 = (lang_statement_union_type **) os_tail;
1918 lang_map_flags (flagword flag)
1920 if (flag & SEC_ALLOC)
1923 if (flag & SEC_CODE)
1926 if (flag & SEC_READONLY)
1929 if (flag & SEC_DATA)
1932 if (flag & SEC_LOAD)
1939 lang_memory_region_type *m;
1940 bfd_boolean dis_header_printed = FALSE;
1943 LANG_FOR_EACH_INPUT_STATEMENT (file)
1947 if ((file->the_bfd->flags & (BFD_LINKER_CREATED | DYNAMIC)) != 0
1948 || file->just_syms_flag)
1951 for (s = file->the_bfd->sections; s != NULL; s = s->next)
1952 if ((s->output_section == NULL
1953 || s->output_section->owner != link_info.output_bfd)
1954 && (s->flags & (SEC_LINKER_CREATED | SEC_KEEP)) == 0)
1956 if (! dis_header_printed)
1958 fprintf (config.map_file, _("\nDiscarded input sections\n\n"));
1959 dis_header_printed = TRUE;
1962 print_input_section (s, TRUE);
1966 minfo (_("\nMemory Configuration\n\n"));
1967 fprintf (config.map_file, "%-16s %-18s %-18s %s\n",
1968 _("Name"), _("Origin"), _("Length"), _("Attributes"));
1970 for (m = lang_memory_region_list; m != NULL; m = m->next)
1975 fprintf (config.map_file, "%-16s ", m->name_list.name);
1977 sprintf_vma (buf, m->origin);
1978 minfo ("0x%s ", buf);
1986 minfo ("0x%V", m->length);
1987 if (m->flags || m->not_flags)
1995 lang_map_flags (m->flags);
2001 lang_map_flags (m->not_flags);
2008 fprintf (config.map_file, _("\nLinker script and memory map\n\n"));
2010 if (! link_info.reduce_memory_overheads)
2012 obstack_begin (&map_obstack, 1000);
2013 for (p = link_info.input_bfds; p != (bfd *) NULL; p = p->link_next)
2014 bfd_map_over_sections (p, init_map_userdata, 0);
2015 bfd_link_hash_traverse (link_info.hash, sort_def_symbol, 0);
2017 lang_statement_iteration ++;
2018 print_statements ();
2022 init_map_userdata (bfd *abfd ATTRIBUTE_UNUSED,
2024 void *data ATTRIBUTE_UNUSED)
2026 fat_section_userdata_type *new_data
2027 = ((fat_section_userdata_type *) (stat_alloc
2028 (sizeof (fat_section_userdata_type))));
2030 ASSERT (get_userdata (sec) == NULL);
2031 get_userdata (sec) = new_data;
2032 new_data->map_symbol_def_tail = &new_data->map_symbol_def_head;
2033 new_data->map_symbol_def_count = 0;
2037 sort_def_symbol (struct bfd_link_hash_entry *hash_entry,
2038 void *info ATTRIBUTE_UNUSED)
2040 if (hash_entry->type == bfd_link_hash_defined
2041 || hash_entry->type == bfd_link_hash_defweak)
2043 struct fat_user_section_struct *ud;
2044 struct map_symbol_def *def;
2046 ud = (struct fat_user_section_struct *)
2047 get_userdata (hash_entry->u.def.section);
2050 /* ??? What do we have to do to initialize this beforehand? */
2051 /* The first time we get here is bfd_abs_section... */
2052 init_map_userdata (0, hash_entry->u.def.section, 0);
2053 ud = (struct fat_user_section_struct *)
2054 get_userdata (hash_entry->u.def.section);
2056 else if (!ud->map_symbol_def_tail)
2057 ud->map_symbol_def_tail = &ud->map_symbol_def_head;
2059 def = (struct map_symbol_def *) obstack_alloc (&map_obstack, sizeof *def);
2060 def->entry = hash_entry;
2061 *(ud->map_symbol_def_tail) = def;
2062 ud->map_symbol_def_tail = &def->next;
2063 ud->map_symbol_def_count++;
2068 /* Initialize an output section. */
2071 init_os (lang_output_section_statement_type *s, flagword flags)
2073 if (strcmp (s->name, DISCARD_SECTION_NAME) == 0)
2074 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME);
2076 if (s->constraint != SPECIAL)
2077 s->bfd_section = bfd_get_section_by_name (link_info.output_bfd, s->name);
2078 if (s->bfd_section == NULL)
2079 s->bfd_section = bfd_make_section_anyway_with_flags (link_info.output_bfd,
2081 if (s->bfd_section == NULL)
2083 einfo (_("%P%F: output format %s cannot represent section called %s\n"),
2084 link_info.output_bfd->xvec->name, s->name);
2086 s->bfd_section->output_section = s->bfd_section;
2087 s->bfd_section->output_offset = 0;
2089 if (!link_info.reduce_memory_overheads)
2091 fat_section_userdata_type *new_userdata = (fat_section_userdata_type *)
2092 stat_alloc (sizeof (fat_section_userdata_type));
2093 memset (new_userdata, 0, sizeof (fat_section_userdata_type));
2094 get_userdata (s->bfd_section) = new_userdata;
2097 /* If there is a base address, make sure that any sections it might
2098 mention are initialized. */
2099 if (s->addr_tree != NULL)
2100 exp_init_os (s->addr_tree);
2102 if (s->load_base != NULL)
2103 exp_init_os (s->load_base);
2105 /* If supplied an alignment, set it. */
2106 if (s->section_alignment != -1)
2107 s->bfd_section->alignment_power = s->section_alignment;
2110 /* Make sure that all output sections mentioned in an expression are
2114 exp_init_os (etree_type *exp)
2116 switch (exp->type.node_class)
2120 exp_init_os (exp->assign.src);
2124 exp_init_os (exp->binary.lhs);
2125 exp_init_os (exp->binary.rhs);
2129 exp_init_os (exp->trinary.cond);
2130 exp_init_os (exp->trinary.lhs);
2131 exp_init_os (exp->trinary.rhs);
2135 exp_init_os (exp->assert_s.child);
2139 exp_init_os (exp->unary.child);
2143 switch (exp->type.node_code)
2149 lang_output_section_statement_type *os;
2151 os = lang_output_section_find (exp->name.name);
2152 if (os != NULL && os->bfd_section == NULL)
2164 section_already_linked (bfd *abfd, asection *sec, void *data)
2166 lang_input_statement_type *entry = (lang_input_statement_type *) data;
2168 /* If we are only reading symbols from this object, then we want to
2169 discard all sections. */
2170 if (entry->just_syms_flag)
2172 bfd_link_just_syms (abfd, sec, &link_info);
2176 if (!(abfd->flags & DYNAMIC))
2177 bfd_section_already_linked (abfd, sec, &link_info);
2180 /* The wild routines.
2182 These expand statements like *(.text) and foo.o to a list of
2183 explicit actions, like foo.o(.text), bar.o(.text) and
2184 foo.o(.text, .data). */
2186 /* Add SECTION to the output section OUTPUT. Do this by creating a
2187 lang_input_section statement which is placed at PTR. FILE is the
2188 input file which holds SECTION. */
2191 lang_add_section (lang_statement_list_type *ptr,
2193 lang_output_section_statement_type *output)
2195 flagword flags = section->flags;
2196 bfd_boolean discard;
2197 lang_input_section_type *new_section;
2199 /* Discard sections marked with SEC_EXCLUDE. */
2200 discard = (flags & SEC_EXCLUDE) != 0;
2202 /* Discard input sections which are assigned to a section named
2203 DISCARD_SECTION_NAME. */
2204 if (strcmp (output->name, DISCARD_SECTION_NAME) == 0)
2207 /* Discard debugging sections if we are stripping debugging
2209 if ((link_info.strip == strip_debugger || link_info.strip == strip_all)
2210 && (flags & SEC_DEBUGGING) != 0)
2215 if (section->output_section == NULL)
2217 /* This prevents future calls from assigning this section. */
2218 section->output_section = bfd_abs_section_ptr;
2223 if (section->output_section != NULL)
2226 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2227 to an output section, because we want to be able to include a
2228 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2229 section (I don't know why we want to do this, but we do).
2230 build_link_order in ldwrite.c handles this case by turning
2231 the embedded SEC_NEVER_LOAD section into a fill. */
2232 flags &= ~ SEC_NEVER_LOAD;
2234 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2235 already been processed. One reason to do this is that on pe
2236 format targets, .text$foo sections go into .text and it's odd
2237 to see .text with SEC_LINK_ONCE set. */
2239 if (!link_info.relocatable)
2240 flags &= ~(SEC_LINK_ONCE | SEC_LINK_DUPLICATES | SEC_RELOC);
2242 switch (output->sectype)
2244 case normal_section:
2245 case overlay_section:
2247 case noalloc_section:
2248 flags &= ~SEC_ALLOC;
2250 case noload_section:
2252 flags |= SEC_NEVER_LOAD;
2253 /* Unfortunately GNU ld has managed to evolve two different
2254 meanings to NOLOAD in scripts. ELF gets a .bss style noload,
2255 alloc, no contents section. All others get a noload, noalloc
2257 if (bfd_get_flavour (link_info.output_bfd) == bfd_target_elf_flavour)
2258 flags &= ~SEC_HAS_CONTENTS;
2260 flags &= ~SEC_ALLOC;
2264 if (output->bfd_section == NULL)
2265 init_os (output, flags);
2267 /* If SEC_READONLY is not set in the input section, then clear
2268 it from the output section. */
2269 output->bfd_section->flags &= flags | ~SEC_READONLY;
2271 if (output->bfd_section->linker_has_input)
2273 /* Only set SEC_READONLY flag on the first input section. */
2274 flags &= ~ SEC_READONLY;
2276 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2277 if ((output->bfd_section->flags & (SEC_MERGE | SEC_STRINGS))
2278 != (flags & (SEC_MERGE | SEC_STRINGS))
2279 || ((flags & SEC_MERGE) != 0
2280 && output->bfd_section->entsize != section->entsize))
2282 output->bfd_section->flags &= ~ (SEC_MERGE | SEC_STRINGS);
2283 flags &= ~ (SEC_MERGE | SEC_STRINGS);
2286 output->bfd_section->flags |= flags;
2288 if (!output->bfd_section->linker_has_input)
2290 output->bfd_section->linker_has_input = 1;
2291 /* This must happen after flags have been updated. The output
2292 section may have been created before we saw its first input
2293 section, eg. for a data statement. */
2294 bfd_init_private_section_data (section->owner, section,
2295 link_info.output_bfd,
2296 output->bfd_section,
2298 if ((flags & SEC_MERGE) != 0)
2299 output->bfd_section->entsize = section->entsize;
2302 if ((flags & SEC_TIC54X_BLOCK) != 0
2303 && bfd_get_arch (section->owner) == bfd_arch_tic54x)
2305 /* FIXME: This value should really be obtained from the bfd... */
2306 output->block_value = 128;
2309 if (section->alignment_power > output->bfd_section->alignment_power)
2310 output->bfd_section->alignment_power = section->alignment_power;
2312 section->output_section = output->bfd_section;
2314 if (!link_info.relocatable
2315 && !stripped_excluded_sections)
2317 asection *s = output->bfd_section->map_tail.s;
2318 output->bfd_section->map_tail.s = section;
2319 section->map_head.s = NULL;
2320 section->map_tail.s = s;
2322 s->map_head.s = section;
2324 output->bfd_section->map_head.s = section;
2327 /* Add a section reference to the list. */
2328 new_section = new_stat (lang_input_section, ptr);
2329 new_section->section = section;
2332 /* Handle wildcard sorting. This returns the lang_input_section which
2333 should follow the one we are going to create for SECTION and FILE,
2334 based on the sorting requirements of WILD. It returns NULL if the
2335 new section should just go at the end of the current list. */
2337 static lang_statement_union_type *
2338 wild_sort (lang_wild_statement_type *wild,
2339 struct wildcard_list *sec,
2340 lang_input_statement_type *file,
2343 lang_statement_union_type *l;
2345 if (!wild->filenames_sorted
2346 && (sec == NULL || sec->spec.sorted == none))
2349 for (l = wild->children.head; l != NULL; l = l->header.next)
2351 lang_input_section_type *ls;
2353 if (l->header.type != lang_input_section_enum)
2355 ls = &l->input_section;
2357 /* Sorting by filename takes precedence over sorting by section
2360 if (wild->filenames_sorted)
2362 const char *fn, *ln;
2366 /* The PE support for the .idata section as generated by
2367 dlltool assumes that files will be sorted by the name of
2368 the archive and then the name of the file within the
2371 if (file->the_bfd != NULL
2372 && bfd_my_archive (file->the_bfd) != NULL)
2374 fn = bfd_get_filename (bfd_my_archive (file->the_bfd));
2379 fn = file->filename;
2383 if (bfd_my_archive (ls->section->owner) != NULL)
2385 ln = bfd_get_filename (bfd_my_archive (ls->section->owner));
2390 ln = ls->section->owner->filename;
2394 i = strcmp (fn, ln);
2403 fn = file->filename;
2405 ln = ls->section->owner->filename;
2407 i = strcmp (fn, ln);
2415 /* Here either the files are not sorted by name, or we are
2416 looking at the sections for this file. */
2418 if (sec != NULL && sec->spec.sorted != none)
2419 if (compare_section (sec->spec.sorted, section, ls->section) < 0)
2426 /* Expand a wild statement for a particular FILE. SECTION may be
2427 NULL, in which case it is a wild card. */
2430 output_section_callback (lang_wild_statement_type *ptr,
2431 struct wildcard_list *sec,
2433 lang_input_statement_type *file,
2436 lang_statement_union_type *before;
2437 lang_output_section_statement_type *os;
2439 os = (lang_output_section_statement_type *) output;
2441 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2442 if (unique_section_p (section, os))
2445 before = wild_sort (ptr, sec, file, section);
2447 /* Here BEFORE points to the lang_input_section which
2448 should follow the one we are about to add. If BEFORE
2449 is NULL, then the section should just go at the end
2450 of the current list. */
2453 lang_add_section (&ptr->children, section, os);
2456 lang_statement_list_type list;
2457 lang_statement_union_type **pp;
2459 lang_list_init (&list);
2460 lang_add_section (&list, section, os);
2462 /* If we are discarding the section, LIST.HEAD will
2464 if (list.head != NULL)
2466 ASSERT (list.head->header.next == NULL);
2468 for (pp = &ptr->children.head;
2470 pp = &(*pp)->header.next)
2471 ASSERT (*pp != NULL);
2473 list.head->header.next = *pp;
2479 /* Check if all sections in a wild statement for a particular FILE
2483 check_section_callback (lang_wild_statement_type *ptr ATTRIBUTE_UNUSED,
2484 struct wildcard_list *sec ATTRIBUTE_UNUSED,
2486 lang_input_statement_type *file ATTRIBUTE_UNUSED,
2489 lang_output_section_statement_type *os;
2491 os = (lang_output_section_statement_type *) output;
2493 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2494 if (unique_section_p (section, os))
2497 if (section->output_section == NULL && (section->flags & SEC_READONLY) == 0)
2498 os->all_input_readonly = FALSE;
2501 /* This is passed a file name which must have been seen already and
2502 added to the statement tree. We will see if it has been opened
2503 already and had its symbols read. If not then we'll read it. */
2505 static lang_input_statement_type *
2506 lookup_name (const char *name)
2508 lang_input_statement_type *search;
2510 for (search = (lang_input_statement_type *) input_file_chain.head;
2512 search = (lang_input_statement_type *) search->next_real_file)
2514 /* Use the local_sym_name as the name of the file that has
2515 already been loaded as filename might have been transformed
2516 via the search directory lookup mechanism. */
2517 const char *filename = search->local_sym_name;
2519 if (filename != NULL
2520 && strcmp (filename, name) == 0)
2525 search = new_afile (name, lang_input_file_is_search_file_enum,
2526 default_target, FALSE);
2528 /* If we have already added this file, or this file is not real
2529 don't add this file. */
2530 if (search->loaded || !search->real)
2533 if (! load_symbols (search, NULL))
2539 /* Save LIST as a list of libraries whose symbols should not be exported. */
2544 struct excluded_lib *next;
2546 static struct excluded_lib *excluded_libs;
2549 add_excluded_libs (const char *list)
2551 const char *p = list, *end;
2555 struct excluded_lib *entry;
2556 end = strpbrk (p, ",:");
2558 end = p + strlen (p);
2559 entry = (struct excluded_lib *) xmalloc (sizeof (*entry));
2560 entry->next = excluded_libs;
2561 entry->name = (char *) xmalloc (end - p + 1);
2562 memcpy (entry->name, p, end - p);
2563 entry->name[end - p] = '\0';
2564 excluded_libs = entry;
2572 check_excluded_libs (bfd *abfd)
2574 struct excluded_lib *lib = excluded_libs;
2578 int len = strlen (lib->name);
2579 const char *filename = lbasename (abfd->filename);
2581 if (strcmp (lib->name, "ALL") == 0)
2583 abfd->no_export = TRUE;
2587 if (strncmp (lib->name, filename, len) == 0
2588 && (filename[len] == '\0'
2589 || (filename[len] == '.' && filename[len + 1] == 'a'
2590 && filename[len + 2] == '\0')))
2592 abfd->no_export = TRUE;
2600 /* Get the symbols for an input file. */
2603 load_symbols (lang_input_statement_type *entry,
2604 lang_statement_list_type *place)
2611 ldfile_open_file (entry);
2613 /* Do not process further if the file was missing. */
2614 if (entry->missing_file)
2617 if (! bfd_check_format (entry->the_bfd, bfd_archive)
2618 && ! bfd_check_format_matches (entry->the_bfd, bfd_object, &matching))
2621 bfd_boolean save_ldlang_sysrooted_script;
2622 bfd_boolean save_add_DT_NEEDED_for_regular;
2623 bfd_boolean save_add_DT_NEEDED_for_dynamic;
2624 bfd_boolean save_whole_archive;
2626 err = bfd_get_error ();
2628 /* See if the emulation has some special knowledge. */
2629 if (ldemul_unrecognized_file (entry))
2632 if (err == bfd_error_file_ambiguously_recognized)
2636 einfo (_("%B: file not recognized: %E\n"), entry->the_bfd);
2637 einfo (_("%B: matching formats:"), entry->the_bfd);
2638 for (p = matching; *p != NULL; p++)
2642 else if (err != bfd_error_file_not_recognized
2644 einfo (_("%F%B: file not recognized: %E\n"), entry->the_bfd);
2646 bfd_close (entry->the_bfd);
2647 entry->the_bfd = NULL;
2649 /* Try to interpret the file as a linker script. */
2650 ldfile_open_command_file (entry->filename);
2652 push_stat_ptr (place);
2653 save_ldlang_sysrooted_script = ldlang_sysrooted_script;
2654 ldlang_sysrooted_script = entry->sysrooted;
2655 save_add_DT_NEEDED_for_regular = add_DT_NEEDED_for_regular;
2656 add_DT_NEEDED_for_regular = entry->add_DT_NEEDED_for_regular;
2657 save_add_DT_NEEDED_for_dynamic = add_DT_NEEDED_for_dynamic;
2658 add_DT_NEEDED_for_dynamic = entry->add_DT_NEEDED_for_dynamic;
2659 save_whole_archive = whole_archive;
2660 whole_archive = entry->whole_archive;
2662 ldfile_assumed_script = TRUE;
2663 parser_input = input_script;
2664 /* We want to use the same -Bdynamic/-Bstatic as the one for
2666 config.dynamic_link = entry->dynamic;
2668 ldfile_assumed_script = FALSE;
2670 ldlang_sysrooted_script = save_ldlang_sysrooted_script;
2671 add_DT_NEEDED_for_regular = save_add_DT_NEEDED_for_regular;
2672 add_DT_NEEDED_for_dynamic = save_add_DT_NEEDED_for_dynamic;
2673 whole_archive = save_whole_archive;
2679 if (ldemul_recognized_file (entry))
2682 /* We don't call ldlang_add_file for an archive. Instead, the
2683 add_symbols entry point will call ldlang_add_file, via the
2684 add_archive_element callback, for each element of the archive
2686 switch (bfd_get_format (entry->the_bfd))
2692 ldlang_add_file (entry);
2693 if (trace_files || trace_file_tries)
2694 info_msg ("%I\n", entry);
2698 check_excluded_libs (entry->the_bfd);
2700 if (entry->whole_archive)
2703 bfd_boolean loaded = TRUE;
2708 member = bfd_openr_next_archived_file (entry->the_bfd, member);
2713 if (! bfd_check_format (member, bfd_object))
2715 einfo (_("%F%B: member %B in archive is not an object\n"),
2716 entry->the_bfd, member);
2721 if (!(*link_info.callbacks
2722 ->add_archive_element) (&link_info, member,
2723 "--whole-archive", &subsbfd))
2726 /* Potentially, the add_archive_element hook may have set a
2727 substitute BFD for us. */
2728 if (!bfd_link_add_symbols (subsbfd, &link_info))
2730 einfo (_("%F%B: could not read symbols: %E\n"), member);
2735 entry->loaded = loaded;
2741 if (bfd_link_add_symbols (entry->the_bfd, &link_info))
2742 entry->loaded = TRUE;
2744 einfo (_("%F%B: could not read symbols: %E\n"), entry->the_bfd);
2746 return entry->loaded;
2749 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2750 may be NULL, indicating that it is a wildcard. Separate
2751 lang_input_section statements are created for each part of the
2752 expansion; they are added after the wild statement S. OUTPUT is
2753 the output section. */
2756 wild (lang_wild_statement_type *s,
2757 const char *target ATTRIBUTE_UNUSED,
2758 lang_output_section_statement_type *output)
2760 struct wildcard_list *sec;
2762 if (s->handler_data[0]
2763 && s->handler_data[0]->spec.sorted == by_name
2764 && !s->filenames_sorted)
2766 lang_section_bst_type *tree;
2768 walk_wild (s, output_section_callback_fast, output);
2773 output_section_callback_tree_to_list (s, tree, output);
2778 walk_wild (s, output_section_callback, output);
2780 if (default_common_section == NULL)
2781 for (sec = s->section_list; sec != NULL; sec = sec->next)
2782 if (sec->spec.name != NULL && strcmp (sec->spec.name, "COMMON") == 0)
2784 /* Remember the section that common is going to in case we
2785 later get something which doesn't know where to put it. */
2786 default_common_section = output;
2791 /* Return TRUE iff target is the sought target. */
2794 get_target (const bfd_target *target, void *data)
2796 const char *sought = (const char *) data;
2798 return strcmp (target->name, sought) == 0;
2801 /* Like strcpy() but convert to lower case as well. */
2804 stricpy (char *dest, char *src)
2808 while ((c = *src++) != 0)
2809 *dest++ = TOLOWER (c);
2814 /* Remove the first occurrence of needle (if any) in haystack
2818 strcut (char *haystack, char *needle)
2820 haystack = strstr (haystack, needle);
2826 for (src = haystack + strlen (needle); *src;)
2827 *haystack++ = *src++;
2833 /* Compare two target format name strings.
2834 Return a value indicating how "similar" they are. */
2837 name_compare (char *first, char *second)
2843 copy1 = (char *) xmalloc (strlen (first) + 1);
2844 copy2 = (char *) xmalloc (strlen (second) + 1);
2846 /* Convert the names to lower case. */
2847 stricpy (copy1, first);
2848 stricpy (copy2, second);
2850 /* Remove size and endian strings from the name. */
2851 strcut (copy1, "big");
2852 strcut (copy1, "little");
2853 strcut (copy2, "big");
2854 strcut (copy2, "little");
2856 /* Return a value based on how many characters match,
2857 starting from the beginning. If both strings are
2858 the same then return 10 * their length. */
2859 for (result = 0; copy1[result] == copy2[result]; result++)
2860 if (copy1[result] == 0)
2872 /* Set by closest_target_match() below. */
2873 static const bfd_target *winner;
2875 /* Scan all the valid bfd targets looking for one that has the endianness
2876 requirement that was specified on the command line, and is the nearest
2877 match to the original output target. */
2880 closest_target_match (const bfd_target *target, void *data)
2882 const bfd_target *original = (const bfd_target *) data;
2884 if (command_line.endian == ENDIAN_BIG
2885 && target->byteorder != BFD_ENDIAN_BIG)
2888 if (command_line.endian == ENDIAN_LITTLE
2889 && target->byteorder != BFD_ENDIAN_LITTLE)
2892 /* Must be the same flavour. */
2893 if (target->flavour != original->flavour)
2896 /* Ignore generic big and little endian elf vectors. */
2897 if (strcmp (target->name, "elf32-big") == 0
2898 || strcmp (target->name, "elf64-big") == 0
2899 || strcmp (target->name, "elf32-little") == 0
2900 || strcmp (target->name, "elf64-little") == 0)
2903 /* If we have not found a potential winner yet, then record this one. */
2910 /* Oh dear, we now have two potential candidates for a successful match.
2911 Compare their names and choose the better one. */
2912 if (name_compare (target->name, original->name)
2913 > name_compare (winner->name, original->name))
2916 /* Keep on searching until wqe have checked them all. */
2920 /* Return the BFD target format of the first input file. */
2923 get_first_input_target (void)
2925 char *target = NULL;
2927 LANG_FOR_EACH_INPUT_STATEMENT (s)
2929 if (s->header.type == lang_input_statement_enum
2932 ldfile_open_file (s);
2934 if (s->the_bfd != NULL
2935 && bfd_check_format (s->the_bfd, bfd_object))
2937 target = bfd_get_target (s->the_bfd);
2949 lang_get_output_target (void)
2953 /* Has the user told us which output format to use? */
2954 if (output_target != NULL)
2955 return output_target;
2957 /* No - has the current target been set to something other than
2959 if (current_target != default_target)
2960 return current_target;
2962 /* No - can we determine the format of the first input file? */
2963 target = get_first_input_target ();
2967 /* Failed - use the default output target. */
2968 return default_target;
2971 /* Open the output file. */
2974 open_output (const char *name)
2976 output_target = lang_get_output_target ();
2978 /* Has the user requested a particular endianness on the command
2980 if (command_line.endian != ENDIAN_UNSET)
2982 const bfd_target *target;
2983 enum bfd_endian desired_endian;
2985 /* Get the chosen target. */
2986 target = bfd_search_for_target (get_target, (void *) output_target);
2988 /* If the target is not supported, we cannot do anything. */
2991 if (command_line.endian == ENDIAN_BIG)
2992 desired_endian = BFD_ENDIAN_BIG;
2994 desired_endian = BFD_ENDIAN_LITTLE;
2996 /* See if the target has the wrong endianness. This should
2997 not happen if the linker script has provided big and
2998 little endian alternatives, but some scrips don't do
3000 if (target->byteorder != desired_endian)
3002 /* If it does, then see if the target provides
3003 an alternative with the correct endianness. */
3004 if (target->alternative_target != NULL
3005 && (target->alternative_target->byteorder == desired_endian))
3006 output_target = target->alternative_target->name;
3009 /* Try to find a target as similar as possible to
3010 the default target, but which has the desired
3011 endian characteristic. */
3012 bfd_search_for_target (closest_target_match,
3015 /* Oh dear - we could not find any targets that
3016 satisfy our requirements. */
3018 einfo (_("%P: warning: could not find any targets"
3019 " that match endianness requirement\n"));
3021 output_target = winner->name;
3027 link_info.output_bfd = bfd_openw (name, output_target);
3029 if (link_info.output_bfd == NULL)
3031 if (bfd_get_error () == bfd_error_invalid_target)
3032 einfo (_("%P%F: target %s not found\n"), output_target);
3034 einfo (_("%P%F: cannot open output file %s: %E\n"), name);
3037 delete_output_file_on_failure = TRUE;
3039 if (! bfd_set_format (link_info.output_bfd, bfd_object))
3040 einfo (_("%P%F:%s: can not make object file: %E\n"), name);
3041 if (! bfd_set_arch_mach (link_info.output_bfd,
3042 ldfile_output_architecture,
3043 ldfile_output_machine))
3044 einfo (_("%P%F:%s: can not set architecture: %E\n"), name);
3046 link_info.hash = bfd_link_hash_table_create (link_info.output_bfd);
3047 if (link_info.hash == NULL)
3048 einfo (_("%P%F: can not create hash table: %E\n"));
3050 bfd_set_gp_size (link_info.output_bfd, g_switch_value);
3054 ldlang_open_output (lang_statement_union_type *statement)
3056 switch (statement->header.type)
3058 case lang_output_statement_enum:
3059 ASSERT (link_info.output_bfd == NULL);
3060 open_output (statement->output_statement.name);
3061 ldemul_set_output_arch ();
3062 if (config.magic_demand_paged && !link_info.relocatable)
3063 link_info.output_bfd->flags |= D_PAGED;
3065 link_info.output_bfd->flags &= ~D_PAGED;
3066 if (config.text_read_only)
3067 link_info.output_bfd->flags |= WP_TEXT;
3069 link_info.output_bfd->flags &= ~WP_TEXT;
3070 if (link_info.traditional_format)
3071 link_info.output_bfd->flags |= BFD_TRADITIONAL_FORMAT;
3073 link_info.output_bfd->flags &= ~BFD_TRADITIONAL_FORMAT;
3076 case lang_target_statement_enum:
3077 current_target = statement->target_statement.target;
3084 /* Convert between addresses in bytes and sizes in octets.
3085 For currently supported targets, octets_per_byte is always a power
3086 of two, so we can use shifts. */
3087 #define TO_ADDR(X) ((X) >> opb_shift)
3088 #define TO_SIZE(X) ((X) << opb_shift)
3090 /* Support the above. */
3091 static unsigned int opb_shift = 0;
3096 unsigned x = bfd_arch_mach_octets_per_byte (ldfile_output_architecture,
3097 ldfile_output_machine);
3100 while ((x & 1) == 0)
3108 /* Open all the input files. */
3111 open_input_bfds (lang_statement_union_type *s, bfd_boolean force)
3113 for (; s != NULL; s = s->header.next)
3115 switch (s->header.type)
3117 case lang_constructors_statement_enum:
3118 open_input_bfds (constructor_list.head, force);
3120 case lang_output_section_statement_enum:
3121 open_input_bfds (s->output_section_statement.children.head, force);
3123 case lang_wild_statement_enum:
3124 /* Maybe we should load the file's symbols. */
3125 if (s->wild_statement.filename
3126 && !wildcardp (s->wild_statement.filename)
3127 && !archive_path (s->wild_statement.filename))
3128 lookup_name (s->wild_statement.filename);
3129 open_input_bfds (s->wild_statement.children.head, force);
3131 case lang_group_statement_enum:
3133 struct bfd_link_hash_entry *undefs;
3135 /* We must continually search the entries in the group
3136 until no new symbols are added to the list of undefined
3141 undefs = link_info.hash->undefs_tail;
3142 open_input_bfds (s->group_statement.children.head, TRUE);
3144 while (undefs != link_info.hash->undefs_tail);
3147 case lang_target_statement_enum:
3148 current_target = s->target_statement.target;
3150 case lang_input_statement_enum:
3151 if (s->input_statement.real)
3153 lang_statement_union_type **os_tail;
3154 lang_statement_list_type add;
3156 s->input_statement.target = current_target;
3158 /* If we are being called from within a group, and this
3159 is an archive which has already been searched, then
3160 force it to be researched unless the whole archive
3161 has been loaded already. */
3163 && !s->input_statement.whole_archive
3164 && s->input_statement.loaded
3165 && bfd_check_format (s->input_statement.the_bfd,
3167 s->input_statement.loaded = FALSE;
3169 os_tail = lang_output_section_statement.tail;
3170 lang_list_init (&add);
3172 if (! load_symbols (&s->input_statement, &add))
3173 config.make_executable = FALSE;
3175 if (add.head != NULL)
3177 /* If this was a script with output sections then
3178 tack any added statements on to the end of the
3179 list. This avoids having to reorder the output
3180 section statement list. Very likely the user
3181 forgot -T, and whatever we do here will not meet
3182 naive user expectations. */
3183 if (os_tail != lang_output_section_statement.tail)
3185 einfo (_("%P: warning: %s contains output sections;"
3186 " did you forget -T?\n"),
3187 s->input_statement.filename);
3188 *stat_ptr->tail = add.head;
3189 stat_ptr->tail = add.tail;
3193 *add.tail = s->header.next;
3194 s->header.next = add.head;
3204 /* Exit if any of the files were missing. */
3209 /* Add a symbol to a hash of symbols used in DEFINED (NAME) expressions. */
3212 lang_track_definedness (const char *name)
3214 if (bfd_hash_lookup (&lang_definedness_table, name, TRUE, FALSE) == NULL)
3215 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name);
3218 /* New-function for the definedness hash table. */
3220 static struct bfd_hash_entry *
3221 lang_definedness_newfunc (struct bfd_hash_entry *entry,
3222 struct bfd_hash_table *table ATTRIBUTE_UNUSED,
3223 const char *name ATTRIBUTE_UNUSED)
3225 struct lang_definedness_hash_entry *ret
3226 = (struct lang_definedness_hash_entry *) entry;
3229 ret = (struct lang_definedness_hash_entry *)
3230 bfd_hash_allocate (table, sizeof (struct lang_definedness_hash_entry));
3233 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name);
3235 ret->iteration = -1;
3239 /* Return the iteration when the definition of NAME was last updated. A
3240 value of -1 means that the symbol is not defined in the linker script
3241 or the command line, but may be defined in the linker symbol table. */
3244 lang_symbol_definition_iteration (const char *name)
3246 struct lang_definedness_hash_entry *defentry
3247 = (struct lang_definedness_hash_entry *)
3248 bfd_hash_lookup (&lang_definedness_table, name, FALSE, FALSE);
3250 /* We've already created this one on the presence of DEFINED in the
3251 script, so it can't be NULL unless something is borked elsewhere in
3253 if (defentry == NULL)
3256 return defentry->iteration;
3259 /* Update the definedness state of NAME. */
3262 lang_update_definedness (const char *name, struct bfd_link_hash_entry *h)
3264 struct lang_definedness_hash_entry *defentry
3265 = (struct lang_definedness_hash_entry *)
3266 bfd_hash_lookup (&lang_definedness_table, name, FALSE, FALSE);
3268 /* We don't keep track of symbols not tested with DEFINED. */
3269 if (defentry == NULL)
3272 /* If the symbol was already defined, and not from an earlier statement
3273 iteration, don't update the definedness iteration, because that'd
3274 make the symbol seem defined in the linker script at this point, and
3275 it wasn't; it was defined in some object. If we do anyway, DEFINED
3276 would start to yield false before this point and the construct "sym =
3277 DEFINED (sym) ? sym : X;" would change sym to X despite being defined
3279 if (h->type != bfd_link_hash_undefined
3280 && h->type != bfd_link_hash_common
3281 && h->type != bfd_link_hash_new
3282 && defentry->iteration == -1)
3285 defentry->iteration = lang_statement_iteration;
3288 /* Add the supplied name to the symbol table as an undefined reference.
3289 This is a two step process as the symbol table doesn't even exist at
3290 the time the ld command line is processed. First we put the name
3291 on a list, then, once the output file has been opened, transfer the
3292 name to the symbol table. */
3294 typedef struct bfd_sym_chain ldlang_undef_chain_list_type;
3296 #define ldlang_undef_chain_list_head entry_symbol.next
3299 ldlang_add_undef (const char *const name, bfd_boolean cmdline)
3301 ldlang_undef_chain_list_type *new_undef;
3303 undef_from_cmdline = undef_from_cmdline || cmdline;
3304 new_undef = (ldlang_undef_chain_list_type *) stat_alloc (sizeof (*new_undef));
3305 new_undef->next = ldlang_undef_chain_list_head;
3306 ldlang_undef_chain_list_head = new_undef;
3308 new_undef->name = xstrdup (name);
3310 if (link_info.output_bfd != NULL)
3311 insert_undefined (new_undef->name);
3314 /* Insert NAME as undefined in the symbol table. */
3317 insert_undefined (const char *name)
3319 struct bfd_link_hash_entry *h;
3321 h = bfd_link_hash_lookup (link_info.hash, name, TRUE, FALSE, TRUE);
3323 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
3324 if (h->type == bfd_link_hash_new)
3326 h->type = bfd_link_hash_undefined;
3327 h->u.undef.abfd = NULL;
3328 bfd_link_add_undef (link_info.hash, h);
3332 /* Run through the list of undefineds created above and place them
3333 into the linker hash table as undefined symbols belonging to the
3337 lang_place_undefineds (void)
3339 ldlang_undef_chain_list_type *ptr;
3341 for (ptr = ldlang_undef_chain_list_head; ptr != NULL; ptr = ptr->next)
3342 insert_undefined (ptr->name);
3345 typedef struct bfd_sym_chain ldlang_def_chain_list_type;
3347 static ldlang_def_chain_list_type ldlang_def_chain_list_head;
3349 /* Insert NAME as defined in the symbol table. */
3352 insert_defined (const char *name)
3354 struct bfd_link_hash_entry *h;
3356 h = bfd_link_hash_lookup (link_info.hash, name, TRUE, FALSE, TRUE);
3358 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
3359 if (h->type == bfd_link_hash_new
3360 || h->type == bfd_link_hash_undefined
3361 || h->type == bfd_link_hash_undefweak)
3363 h->type = bfd_link_hash_defined;
3364 h->u.def.section = bfd_abs_section_ptr;
3369 /* Like lang_add_undef, but this time for symbols defined on the
3373 ldlang_add_def (const char *const name)
3375 if (link_info.output_bfd != NULL)
3376 insert_defined (xstrdup (name));
3379 ldlang_def_chain_list_type *new_def;
3381 new_def = (ldlang_def_chain_list_type *) stat_alloc (sizeof (*new_def));
3382 new_def->next = ldlang_def_chain_list_head.next;
3383 ldlang_def_chain_list_head.next = new_def;
3385 new_def->name = xstrdup (name);
3389 /* Run through the list of defineds created above and place them
3390 into the linker hash table as defined symbols belonging to the
3394 lang_place_defineds (void)
3396 ldlang_def_chain_list_type *ptr;
3398 for (ptr = ldlang_def_chain_list_head.next;
3401 insert_defined (ptr->name);
3404 /* Check for all readonly or some readwrite sections. */
3407 check_input_sections
3408 (lang_statement_union_type *s,
3409 lang_output_section_statement_type *output_section_statement)
3411 for (; s != (lang_statement_union_type *) NULL; s = s->header.next)
3413 switch (s->header.type)
3415 case lang_wild_statement_enum:
3416 walk_wild (&s->wild_statement, check_section_callback,
3417 output_section_statement);
3418 if (! output_section_statement->all_input_readonly)
3421 case lang_constructors_statement_enum:
3422 check_input_sections (constructor_list.head,
3423 output_section_statement);
3424 if (! output_section_statement->all_input_readonly)
3427 case lang_group_statement_enum:
3428 check_input_sections (s->group_statement.children.head,
3429 output_section_statement);
3430 if (! output_section_statement->all_input_readonly)
3439 /* Update wildcard statements if needed. */
3442 update_wild_statements (lang_statement_union_type *s)
3444 struct wildcard_list *sec;
3446 switch (sort_section)
3456 for (; s != NULL; s = s->header.next)
3458 switch (s->header.type)
3463 case lang_wild_statement_enum:
3464 sec = s->wild_statement.section_list;
3465 for (sec = s->wild_statement.section_list; sec != NULL;
3468 switch (sec->spec.sorted)
3471 sec->spec.sorted = sort_section;
3474 if (sort_section == by_alignment)
3475 sec->spec.sorted = by_name_alignment;
3478 if (sort_section == by_name)
3479 sec->spec.sorted = by_alignment_name;
3487 case lang_constructors_statement_enum:
3488 update_wild_statements (constructor_list.head);
3491 case lang_output_section_statement_enum:
3492 update_wild_statements
3493 (s->output_section_statement.children.head);
3496 case lang_group_statement_enum:
3497 update_wild_statements (s->group_statement.children.head);
3505 /* Open input files and attach to output sections. */
3508 map_input_to_output_sections
3509 (lang_statement_union_type *s, const char *target,
3510 lang_output_section_statement_type *os)
3512 for (; s != NULL; s = s->header.next)
3514 lang_output_section_statement_type *tos;
3517 switch (s->header.type)
3519 case lang_wild_statement_enum:
3520 wild (&s->wild_statement, target, os);
3522 case lang_constructors_statement_enum:
3523 map_input_to_output_sections (constructor_list.head,
3527 case lang_output_section_statement_enum:
3528 tos = &s->output_section_statement;
3529 if (tos->constraint != 0)
3531 if (tos->constraint != ONLY_IF_RW
3532 && tos->constraint != ONLY_IF_RO)
3534 tos->all_input_readonly = TRUE;
3535 check_input_sections (tos->children.head, tos);
3536 if (tos->all_input_readonly != (tos->constraint == ONLY_IF_RO))
3538 tos->constraint = -1;
3542 map_input_to_output_sections (tos->children.head,
3546 case lang_output_statement_enum:
3548 case lang_target_statement_enum:
3549 target = s->target_statement.target;
3551 case lang_group_statement_enum:
3552 map_input_to_output_sections (s->group_statement.children.head,
3556 case lang_data_statement_enum:
3557 /* Make sure that any sections mentioned in the expression
3559 exp_init_os (s->data_statement.exp);
3560 /* The output section gets CONTENTS, ALLOC and LOAD, but
3561 these may be overridden by the script. */
3562 flags = SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD;
3563 switch (os->sectype)
3565 case normal_section:
3566 case overlay_section:
3568 case noalloc_section:
3569 flags = SEC_HAS_CONTENTS;
3571 case noload_section:
3572 if (bfd_get_flavour (link_info.output_bfd)
3573 == bfd_target_elf_flavour)
3574 flags = SEC_NEVER_LOAD | SEC_ALLOC;
3576 flags = SEC_NEVER_LOAD | SEC_HAS_CONTENTS;
3579 if (os->bfd_section == NULL)
3580 init_os (os, flags);
3582 os->bfd_section->flags |= flags;
3584 case lang_input_section_enum:
3586 case lang_fill_statement_enum:
3587 case lang_object_symbols_statement_enum:
3588 case lang_reloc_statement_enum:
3589 case lang_padding_statement_enum:
3590 case lang_input_statement_enum:
3591 if (os != NULL && os->bfd_section == NULL)
3594 case lang_assignment_statement_enum:
3595 if (os != NULL && os->bfd_section == NULL)
3598 /* Make sure that any sections mentioned in the assignment
3600 exp_init_os (s->assignment_statement.exp);
3602 case lang_address_statement_enum:
3603 /* Mark the specified section with the supplied address.
3604 If this section was actually a segment marker, then the
3605 directive is ignored if the linker script explicitly
3606 processed the segment marker. Originally, the linker
3607 treated segment directives (like -Ttext on the
3608 command-line) as section directives. We honor the
3609 section directive semantics for backwards compatibilty;
3610 linker scripts that do not specifically check for
3611 SEGMENT_START automatically get the old semantics. */
3612 if (!s->address_statement.segment
3613 || !s->address_statement.segment->used)
3615 const char *name = s->address_statement.section_name;
3617 /* Create the output section statement here so that
3618 orphans with a set address will be placed after other
3619 script sections. If we let the orphan placement code
3620 place them in amongst other sections then the address
3621 will affect following script sections, which is
3622 likely to surprise naive users. */
3623 tos = lang_output_section_statement_lookup (name, 0, TRUE);
3624 tos->addr_tree = s->address_statement.address;
3625 if (tos->bfd_section == NULL)
3629 case lang_insert_statement_enum:
3635 /* An insert statement snips out all the linker statements from the
3636 start of the list and places them after the output section
3637 statement specified by the insert. This operation is complicated
3638 by the fact that we keep a doubly linked list of output section
3639 statements as well as the singly linked list of all statements. */
3642 process_insert_statements (void)
3644 lang_statement_union_type **s;
3645 lang_output_section_statement_type *first_os = NULL;
3646 lang_output_section_statement_type *last_os = NULL;
3647 lang_output_section_statement_type *os;
3649 /* "start of list" is actually the statement immediately after
3650 the special abs_section output statement, so that it isn't
3652 s = &lang_output_section_statement.head;
3653 while (*(s = &(*s)->header.next) != NULL)
3655 if ((*s)->header.type == lang_output_section_statement_enum)
3657 /* Keep pointers to the first and last output section
3658 statement in the sequence we may be about to move. */
3659 os = &(*s)->output_section_statement;
3661 ASSERT (last_os == NULL || last_os->next == os);
3664 /* Set constraint negative so that lang_output_section_find
3665 won't match this output section statement. At this
3666 stage in linking constraint has values in the range
3667 [-1, ONLY_IN_RW]. */
3668 last_os->constraint = -2 - last_os->constraint;
3669 if (first_os == NULL)
3672 else if ((*s)->header.type == lang_insert_statement_enum)
3674 lang_insert_statement_type *i = &(*s)->insert_statement;
3675 lang_output_section_statement_type *where;
3676 lang_statement_union_type **ptr;
3677 lang_statement_union_type *first;
3679 where = lang_output_section_find (i->where);
3680 if (where != NULL && i->is_before)
3683 where = where->prev;
3684 while (where != NULL && where->constraint < 0);
3688 einfo (_("%F%P: %s not found for insert\n"), i->where);
3692 /* Deal with reordering the output section statement list. */
3693 if (last_os != NULL)
3695 asection *first_sec, *last_sec;
3696 struct lang_output_section_statement_struct **next;
3698 /* Snip out the output sections we are moving. */
3699 first_os->prev->next = last_os->next;
3700 if (last_os->next == NULL)
3702 next = &first_os->prev->next;
3703 lang_output_section_statement.tail
3704 = (lang_statement_union_type **) next;
3707 last_os->next->prev = first_os->prev;
3708 /* Add them in at the new position. */
3709 last_os->next = where->next;
3710 if (where->next == NULL)
3712 next = &last_os->next;
3713 lang_output_section_statement.tail
3714 = (lang_statement_union_type **) next;
3717 where->next->prev = last_os;
3718 first_os->prev = where;
3719 where->next = first_os;
3721 /* Move the bfd sections in the same way. */
3724 for (os = first_os; os != NULL; os = os->next)
3726 os->constraint = -2 - os->constraint;
3727 if (os->bfd_section != NULL
3728 && os->bfd_section->owner != NULL)
3730 last_sec = os->bfd_section;
3731 if (first_sec == NULL)
3732 first_sec = last_sec;
3737 if (last_sec != NULL)
3739 asection *sec = where->bfd_section;
3741 sec = output_prev_sec_find (where);
3743 /* The place we want to insert must come after the
3744 sections we are moving. So if we find no
3745 section or if the section is the same as our
3746 last section, then no move is needed. */
3747 if (sec != NULL && sec != last_sec)
3749 /* Trim them off. */
3750 if (first_sec->prev != NULL)
3751 first_sec->prev->next = last_sec->next;
3753 link_info.output_bfd->sections = last_sec->next;
3754 if (last_sec->next != NULL)
3755 last_sec->next->prev = first_sec->prev;
3757 link_info.output_bfd->section_last = first_sec->prev;
3759 last_sec->next = sec->next;
3760 if (sec->next != NULL)
3761 sec->next->prev = last_sec;
3763 link_info.output_bfd->section_last = last_sec;
3764 first_sec->prev = sec;
3765 sec->next = first_sec;
3773 ptr = insert_os_after (where);
3774 /* Snip everything after the abs_section output statement we
3775 know is at the start of the list, up to and including
3776 the insert statement we are currently processing. */
3777 first = lang_output_section_statement.head->header.next;
3778 lang_output_section_statement.head->header.next = (*s)->header.next;
3779 /* Add them back where they belong. */
3782 statement_list.tail = s;
3784 s = &lang_output_section_statement.head;
3788 /* Undo constraint twiddling. */
3789 for (os = first_os; os != NULL; os = os->next)
3791 os->constraint = -2 - os->constraint;
3797 /* An output section might have been removed after its statement was
3798 added. For example, ldemul_before_allocation can remove dynamic
3799 sections if they turn out to be not needed. Clean them up here. */
3802 strip_excluded_output_sections (void)
3804 lang_output_section_statement_type *os;
3806 /* Run lang_size_sections (if not already done). */
3807 if (expld.phase != lang_mark_phase_enum)
3809 expld.phase = lang_mark_phase_enum;
3810 expld.dataseg.phase = exp_dataseg_none;
3811 one_lang_size_sections_pass (NULL, FALSE);
3812 lang_reset_memory_regions ();
3815 for (os = &lang_output_section_statement.head->output_section_statement;
3819 asection *output_section;
3820 bfd_boolean exclude;
3822 if (os->constraint < 0)
3825 output_section = os->bfd_section;
3826 if (output_section == NULL)
3829 exclude = (output_section->rawsize == 0
3830 && (output_section->flags & SEC_KEEP) == 0
3831 && !bfd_section_removed_from_list (link_info.output_bfd,
3834 /* Some sections have not yet been sized, notably .gnu.version,
3835 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3836 input sections, so don't drop output sections that have such
3837 input sections unless they are also marked SEC_EXCLUDE. */
3838 if (exclude && output_section->map_head.s != NULL)
3842 for (s = output_section->map_head.s; s != NULL; s = s->map_head.s)
3843 if ((s->flags & SEC_LINKER_CREATED) != 0
3844 && (s->flags & SEC_EXCLUDE) == 0)
3851 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3852 output_section->map_head.link_order = NULL;
3853 output_section->map_tail.link_order = NULL;
3857 /* We don't set bfd_section to NULL since bfd_section of the
3858 removed output section statement may still be used. */
3859 if (!os->section_relative_symbol
3860 && !os->update_dot_tree)
3862 output_section->flags |= SEC_EXCLUDE;
3863 bfd_section_list_remove (link_info.output_bfd, output_section);
3864 link_info.output_bfd->section_count--;
3868 /* Stop future calls to lang_add_section from messing with map_head
3869 and map_tail link_order fields. */
3870 stripped_excluded_sections = TRUE;
3874 print_output_section_statement
3875 (lang_output_section_statement_type *output_section_statement)
3877 asection *section = output_section_statement->bfd_section;
3880 if (output_section_statement != abs_output_section)
3882 minfo ("\n%s", output_section_statement->name);
3884 if (section != NULL)
3886 print_dot = section->vma;
3888 len = strlen (output_section_statement->name);
3889 if (len >= SECTION_NAME_MAP_LENGTH - 1)
3894 while (len < SECTION_NAME_MAP_LENGTH)
3900 minfo ("0x%V %W", section->vma, section->size);
3902 if (section->vma != section->lma)
3903 minfo (_(" load address 0x%V"), section->lma);
3905 if (output_section_statement->update_dot_tree != NULL)
3906 exp_fold_tree (output_section_statement->update_dot_tree,
3907 bfd_abs_section_ptr, &print_dot);
3913 print_statement_list (output_section_statement->children.head,
3914 output_section_statement);
3917 /* Scan for the use of the destination in the right hand side
3918 of an expression. In such cases we will not compute the
3919 correct expression, since the value of DST that is used on
3920 the right hand side will be its final value, not its value
3921 just before this expression is evaluated. */
3924 scan_for_self_assignment (const char * dst, etree_type * rhs)
3926 if (rhs == NULL || dst == NULL)
3929 switch (rhs->type.node_class)
3932 return scan_for_self_assignment (dst, rhs->binary.lhs)
3933 || scan_for_self_assignment (dst, rhs->binary.rhs);
3936 return scan_for_self_assignment (dst, rhs->trinary.lhs)
3937 || scan_for_self_assignment (dst, rhs->trinary.rhs);
3940 case etree_provided:
3942 if (strcmp (dst, rhs->assign.dst) == 0)
3944 return scan_for_self_assignment (dst, rhs->assign.src);
3947 return scan_for_self_assignment (dst, rhs->unary.child);
3951 return strcmp (dst, rhs->value.str) == 0;
3956 return strcmp (dst, rhs->name.name) == 0;
3968 print_assignment (lang_assignment_statement_type *assignment,
3969 lang_output_section_statement_type *output_section)
3973 bfd_boolean computation_is_valid = TRUE;
3977 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
3980 if (assignment->exp->type.node_class == etree_assert)
3983 tree = assignment->exp->assert_s.child;
3984 computation_is_valid = TRUE;
3988 const char *dst = assignment->exp->assign.dst;
3990 is_dot = (dst[0] == '.' && dst[1] == 0);
3991 tree = assignment->exp->assign.src;
3992 computation_is_valid = is_dot || (scan_for_self_assignment (dst, tree) == FALSE);
3995 osec = output_section->bfd_section;
3997 osec = bfd_abs_section_ptr;
3998 exp_fold_tree (tree, osec, &print_dot);
3999 if (expld.result.valid_p)
4003 if (computation_is_valid)
4005 value = expld.result.value;
4007 if (expld.result.section != NULL)
4008 value += expld.result.section->vma;
4010 minfo ("0x%V", value);
4016 struct bfd_link_hash_entry *h;
4018 h = bfd_link_hash_lookup (link_info.hash, assignment->exp->assign.dst,
4019 FALSE, FALSE, TRUE);
4022 value = h->u.def.value;
4024 if (expld.result.section != NULL)
4025 value += expld.result.section->vma;
4027 minfo ("[0x%V]", value);
4030 minfo ("[unresolved]");
4042 exp_print_tree (assignment->exp);
4047 print_input_statement (lang_input_statement_type *statm)
4049 if (statm->filename != NULL
4050 && (statm->the_bfd == NULL
4051 || (statm->the_bfd->flags & BFD_LINKER_CREATED) == 0))
4052 fprintf (config.map_file, "LOAD %s\n", statm->filename);
4055 /* Print all symbols defined in a particular section. This is called
4056 via bfd_link_hash_traverse, or by print_all_symbols. */
4059 print_one_symbol (struct bfd_link_hash_entry *hash_entry, void *ptr)
4061 asection *sec = (asection *) ptr;
4063 if ((hash_entry->type == bfd_link_hash_defined
4064 || hash_entry->type == bfd_link_hash_defweak)
4065 && sec == hash_entry->u.def.section)
4069 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
4072 (hash_entry->u.def.value
4073 + hash_entry->u.def.section->output_offset
4074 + hash_entry->u.def.section->output_section->vma));
4076 minfo (" %T\n", hash_entry->root.string);
4083 hash_entry_addr_cmp (const void *a, const void *b)
4085 const struct bfd_link_hash_entry *l = *(const struct bfd_link_hash_entry **)a;
4086 const struct bfd_link_hash_entry *r = *(const struct bfd_link_hash_entry **)b;
4088 if (l->u.def.value < r->u.def.value)
4090 else if (l->u.def.value > r->u.def.value)
4097 print_all_symbols (asection *sec)
4099 struct fat_user_section_struct *ud =
4100 (struct fat_user_section_struct *) get_userdata (sec);
4101 struct map_symbol_def *def;
4102 struct bfd_link_hash_entry **entries;
4108 *ud->map_symbol_def_tail = 0;
4110 /* Sort the symbols by address. */
4111 entries = (struct bfd_link_hash_entry **)
4112 obstack_alloc (&map_obstack, ud->map_symbol_def_count * sizeof (*entries));
4114 for (i = 0, def = ud->map_symbol_def_head; def; def = def->next, i++)
4115 entries[i] = def->entry;
4117 qsort (entries, ud->map_symbol_def_count, sizeof (*entries),
4118 hash_entry_addr_cmp);
4120 /* Print the symbols. */
4121 for (i = 0; i < ud->map_symbol_def_count; i++)
4122 print_one_symbol (entries[i], sec);
4124 obstack_free (&map_obstack, entries);
4127 /* Print information about an input section to the map file. */
4130 print_input_section (asection *i, bfd_boolean is_discarded)
4132 bfd_size_type size = i->size;
4139 minfo ("%s", i->name);
4141 len = 1 + strlen (i->name);
4142 if (len >= SECTION_NAME_MAP_LENGTH - 1)
4147 while (len < SECTION_NAME_MAP_LENGTH)
4153 if (i->output_section != NULL
4154 && i->output_section->owner == link_info.output_bfd)
4155 addr = i->output_section->vma + i->output_offset;
4163 minfo ("0x%V %W %B\n", addr, TO_ADDR (size), i->owner);
4165 if (size != i->rawsize && i->rawsize != 0)
4167 len = SECTION_NAME_MAP_LENGTH + 3;
4179 minfo (_("%W (size before relaxing)\n"), i->rawsize);
4182 if (i->output_section != NULL
4183 && i->output_section->owner == link_info.output_bfd)
4185 if (link_info.reduce_memory_overheads)
4186 bfd_link_hash_traverse (link_info.hash, print_one_symbol, i);
4188 print_all_symbols (i);
4190 /* Update print_dot, but make sure that we do not move it
4191 backwards - this could happen if we have overlays and a
4192 later overlay is shorter than an earier one. */
4193 if (addr + TO_ADDR (size) > print_dot)
4194 print_dot = addr + TO_ADDR (size);
4199 print_fill_statement (lang_fill_statement_type *fill)
4203 fputs (" FILL mask 0x", config.map_file);
4204 for (p = fill->fill->data, size = fill->fill->size; size != 0; p++, size--)
4205 fprintf (config.map_file, "%02x", *p);
4206 fputs ("\n", config.map_file);
4210 print_data_statement (lang_data_statement_type *data)
4218 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
4221 addr = data->output_offset;
4222 if (data->output_section != NULL)
4223 addr += data->output_section->vma;
4251 minfo ("0x%V %W %s 0x%v", addr, size, name, data->value);
4253 if (data->exp->type.node_class != etree_value)
4256 exp_print_tree (data->exp);
4261 print_dot = addr + TO_ADDR (size);
4264 /* Print an address statement. These are generated by options like
4268 print_address_statement (lang_address_statement_type *address)
4270 minfo (_("Address of section %s set to "), address->section_name);
4271 exp_print_tree (address->address);
4275 /* Print a reloc statement. */
4278 print_reloc_statement (lang_reloc_statement_type *reloc)
4285 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
4288 addr = reloc->output_offset;
4289 if (reloc->output_section != NULL)
4290 addr += reloc->output_section->vma;
4292 size = bfd_get_reloc_size (reloc->howto);
4294 minfo ("0x%V %W RELOC %s ", addr, size, reloc->howto->name);
4296 if (reloc->name != NULL)
4297 minfo ("%s+", reloc->name);
4299 minfo ("%s+", reloc->section->name);
4301 exp_print_tree (reloc->addend_exp);
4305 print_dot = addr + TO_ADDR (size);
4309 print_padding_statement (lang_padding_statement_type *s)
4317 len = sizeof " *fill*" - 1;
4318 while (len < SECTION_NAME_MAP_LENGTH)
4324 addr = s->output_offset;
4325 if (s->output_section != NULL)
4326 addr += s->output_section->vma;
4327 minfo ("0x%V %W ", addr, (bfd_vma) s->size);
4329 if (s->fill->size != 0)
4333 for (p = s->fill->data, size = s->fill->size; size != 0; p++, size--)
4334 fprintf (config.map_file, "%02x", *p);
4339 print_dot = addr + TO_ADDR (s->size);
4343 print_wild_statement (lang_wild_statement_type *w,
4344 lang_output_section_statement_type *os)
4346 struct wildcard_list *sec;
4350 if (w->filenames_sorted)
4352 if (w->filename != NULL)
4353 minfo ("%s", w->filename);
4356 if (w->filenames_sorted)
4360 for (sec = w->section_list; sec; sec = sec->next)
4362 if (sec->spec.sorted)
4364 if (sec->spec.exclude_name_list != NULL)
4367 minfo ("EXCLUDE_FILE(%s", sec->spec.exclude_name_list->name);
4368 for (tmp = sec->spec.exclude_name_list->next; tmp; tmp = tmp->next)
4369 minfo (" %s", tmp->name);
4372 if (sec->spec.name != NULL)
4373 minfo ("%s", sec->spec.name);
4376 if (sec->spec.sorted)
4385 print_statement_list (w->children.head, os);
4388 /* Print a group statement. */
4391 print_group (lang_group_statement_type *s,
4392 lang_output_section_statement_type *os)
4394 fprintf (config.map_file, "START GROUP\n");
4395 print_statement_list (s->children.head, os);
4396 fprintf (config.map_file, "END GROUP\n");
4399 /* Print the list of statements in S.
4400 This can be called for any statement type. */
4403 print_statement_list (lang_statement_union_type *s,
4404 lang_output_section_statement_type *os)
4408 print_statement (s, os);
4413 /* Print the first statement in statement list S.
4414 This can be called for any statement type. */
4417 print_statement (lang_statement_union_type *s,
4418 lang_output_section_statement_type *os)
4420 switch (s->header.type)
4423 fprintf (config.map_file, _("Fail with %d\n"), s->header.type);
4426 case lang_constructors_statement_enum:
4427 if (constructor_list.head != NULL)
4429 if (constructors_sorted)
4430 minfo (" SORT (CONSTRUCTORS)\n");
4432 minfo (" CONSTRUCTORS\n");
4433 print_statement_list (constructor_list.head, os);
4436 case lang_wild_statement_enum:
4437 print_wild_statement (&s->wild_statement, os);
4439 case lang_address_statement_enum:
4440 print_address_statement (&s->address_statement);
4442 case lang_object_symbols_statement_enum:
4443 minfo (" CREATE_OBJECT_SYMBOLS\n");
4445 case lang_fill_statement_enum:
4446 print_fill_statement (&s->fill_statement);
4448 case lang_data_statement_enum:
4449 print_data_statement (&s->data_statement);
4451 case lang_reloc_statement_enum:
4452 print_reloc_statement (&s->reloc_statement);
4454 case lang_input_section_enum:
4455 print_input_section (s->input_section.section, FALSE);
4457 case lang_padding_statement_enum:
4458 print_padding_statement (&s->padding_statement);
4460 case lang_output_section_statement_enum:
4461 print_output_section_statement (&s->output_section_statement);
4463 case lang_assignment_statement_enum:
4464 print_assignment (&s->assignment_statement, os);
4466 case lang_target_statement_enum:
4467 fprintf (config.map_file, "TARGET(%s)\n", s->target_statement.target);
4469 case lang_output_statement_enum:
4470 minfo ("OUTPUT(%s", s->output_statement.name);
4471 if (output_target != NULL)
4472 minfo (" %s", output_target);
4475 case lang_input_statement_enum:
4476 print_input_statement (&s->input_statement);
4478 case lang_group_statement_enum:
4479 print_group (&s->group_statement, os);
4481 case lang_insert_statement_enum:
4482 minfo ("INSERT %s %s\n",
4483 s->insert_statement.is_before ? "BEFORE" : "AFTER",
4484 s->insert_statement.where);
4490 print_statements (void)
4492 print_statement_list (statement_list.head, abs_output_section);
4495 /* Print the first N statements in statement list S to STDERR.
4496 If N == 0, nothing is printed.
4497 If N < 0, the entire list is printed.
4498 Intended to be called from GDB. */
4501 dprint_statement (lang_statement_union_type *s, int n)
4503 FILE *map_save = config.map_file;
4505 config.map_file = stderr;
4508 print_statement_list (s, abs_output_section);
4511 while (s && --n >= 0)
4513 print_statement (s, abs_output_section);
4518 config.map_file = map_save;
4522 insert_pad (lang_statement_union_type **ptr,
4524 unsigned int alignment_needed,
4525 asection *output_section,
4528 static fill_type zero_fill = { 1, { 0 } };
4529 lang_statement_union_type *pad = NULL;
4531 if (ptr != &statement_list.head)
4532 pad = ((lang_statement_union_type *)
4533 ((char *) ptr - offsetof (lang_statement_union_type, header.next)));
4535 && pad->header.type == lang_padding_statement_enum
4536 && pad->padding_statement.output_section == output_section)
4538 /* Use the existing pad statement. */
4540 else if ((pad = *ptr) != NULL
4541 && pad->header.type == lang_padding_statement_enum
4542 && pad->padding_statement.output_section == output_section)
4544 /* Use the existing pad statement. */
4548 /* Make a new padding statement, linked into existing chain. */
4549 pad = (lang_statement_union_type *)
4550 stat_alloc (sizeof (lang_padding_statement_type));
4551 pad->header.next = *ptr;
4553 pad->header.type = lang_padding_statement_enum;
4554 pad->padding_statement.output_section = output_section;
4557 pad->padding_statement.fill = fill;
4559 pad->padding_statement.output_offset = dot - output_section->vma;
4560 pad->padding_statement.size = alignment_needed;
4561 output_section->size += alignment_needed;
4564 /* Work out how much this section will move the dot point. */
4568 (lang_statement_union_type **this_ptr,
4569 lang_output_section_statement_type *output_section_statement,
4573 lang_input_section_type *is = &((*this_ptr)->input_section);
4574 asection *i = is->section;
4576 if (!((lang_input_statement_type *) i->owner->usrdata)->just_syms_flag
4577 && (i->flags & SEC_EXCLUDE) == 0)
4579 unsigned int alignment_needed;
4582 /* Align this section first to the input sections requirement,
4583 then to the output section's requirement. If this alignment
4584 is greater than any seen before, then record it too. Perform
4585 the alignment by inserting a magic 'padding' statement. */
4587 if (output_section_statement->subsection_alignment != -1)
4588 i->alignment_power = output_section_statement->subsection_alignment;
4590 o = output_section_statement->bfd_section;
4591 if (o->alignment_power < i->alignment_power)
4592 o->alignment_power = i->alignment_power;
4594 alignment_needed = align_power (dot, i->alignment_power) - dot;
4596 if (alignment_needed != 0)
4598 insert_pad (this_ptr, fill, TO_SIZE (alignment_needed), o, dot);
4599 dot += alignment_needed;
4602 /* Remember where in the output section this input section goes. */
4604 i->output_offset = dot - o->vma;
4606 /* Mark how big the output section must be to contain this now. */
4607 dot += TO_ADDR (i->size);
4608 o->size = TO_SIZE (dot - o->vma);
4612 i->output_offset = i->vma - output_section_statement->bfd_section->vma;
4619 sort_sections_by_lma (const void *arg1, const void *arg2)
4621 const asection *sec1 = *(const asection **) arg1;
4622 const asection *sec2 = *(const asection **) arg2;
4624 if (bfd_section_lma (sec1->owner, sec1)
4625 < bfd_section_lma (sec2->owner, sec2))
4627 else if (bfd_section_lma (sec1->owner, sec1)
4628 > bfd_section_lma (sec2->owner, sec2))
4630 else if (sec1->id < sec2->id)
4632 else if (sec1->id > sec2->id)
4638 #define IGNORE_SECTION(s) \
4639 ((s->flags & SEC_ALLOC) == 0 \
4640 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
4641 && (s->flags & SEC_LOAD) == 0))
4643 /* Check to see if any allocated sections overlap with other allocated
4644 sections. This can happen if a linker script specifies the output
4645 section addresses of the two sections. Also check whether any memory
4646 region has overflowed. */
4649 lang_check_section_addresses (void)
4652 asection **sections, **spp;
4659 lang_memory_region_type *m;
4661 if (bfd_count_sections (link_info.output_bfd) <= 1)
4664 amt = bfd_count_sections (link_info.output_bfd) * sizeof (asection *);
4665 sections = (asection **) xmalloc (amt);
4667 /* Scan all sections in the output list. */
4669 for (s = link_info.output_bfd->sections; s != NULL; s = s->next)
4671 /* Only consider loadable sections with real contents. */
4672 if (!(s->flags & SEC_LOAD)
4673 || !(s->flags & SEC_ALLOC)
4677 sections[count] = s;
4684 qsort (sections, (size_t) count, sizeof (asection *),
4685 sort_sections_by_lma);
4690 s_end = s_start + TO_ADDR (s->size) - 1;
4691 for (count--; count; count--)
4693 /* We must check the sections' LMA addresses not their VMA
4694 addresses because overlay sections can have overlapping VMAs
4695 but they must have distinct LMAs. */
4701 s_end = s_start + TO_ADDR (s->size) - 1;
4703 /* Look for an overlap. We have sorted sections by lma, so we
4704 know that s_start >= p_start. Besides the obvious case of
4705 overlap when the current section starts before the previous
4706 one ends, we also must have overlap if the previous section
4707 wraps around the address space. */
4708 if (s_start <= p_end
4710 einfo (_("%X%P: section %s loaded at [%V,%V] overlaps section %s loaded at [%V,%V]\n"),
4711 s->name, s_start, s_end, p->name, p_start, p_end);
4716 /* If any memory region has overflowed, report by how much.
4717 We do not issue this diagnostic for regions that had sections
4718 explicitly placed outside their bounds; os_region_check's
4719 diagnostics are adequate for that case.
4721 FIXME: It is conceivable that m->current - (m->origin + m->length)
4722 might overflow a 32-bit integer. There is, alas, no way to print
4723 a bfd_vma quantity in decimal. */
4724 for (m = lang_memory_region_list; m; m = m->next)
4725 if (m->had_full_message)
4726 einfo (_("%X%P: region `%s' overflowed by %ld bytes\n"),
4727 m->name_list.name, (long)(m->current - (m->origin + m->length)));
4731 /* Make sure the new address is within the region. We explicitly permit the
4732 current address to be at the exact end of the region when the address is
4733 non-zero, in case the region is at the end of addressable memory and the
4734 calculation wraps around. */
4737 os_region_check (lang_output_section_statement_type *os,
4738 lang_memory_region_type *region,
4742 if ((region->current < region->origin
4743 || (region->current - region->origin > region->length))
4744 && ((region->current != region->origin + region->length)
4749 einfo (_("%X%P: address 0x%v of %B section `%s'"
4750 " is not within region `%s'\n"),
4752 os->bfd_section->owner,
4753 os->bfd_section->name,
4754 region->name_list.name);
4756 else if (!region->had_full_message)
4758 region->had_full_message = TRUE;
4760 einfo (_("%X%P: %B section `%s' will not fit in region `%s'\n"),
4761 os->bfd_section->owner,
4762 os->bfd_section->name,
4763 region->name_list.name);
4768 /* Set the sizes for all the output sections. */
4771 lang_size_sections_1
4772 (lang_statement_union_type **prev,
4773 lang_output_section_statement_type *output_section_statement,
4777 bfd_boolean check_regions)
4779 lang_statement_union_type *s;
4781 /* Size up the sections from their constituent parts. */
4782 for (s = *prev; s != NULL; s = s->header.next)
4784 switch (s->header.type)
4786 case lang_output_section_statement_enum:
4788 bfd_vma newdot, after;
4789 lang_output_section_statement_type *os;
4790 lang_memory_region_type *r;
4791 int section_alignment = 0;
4793 os = &s->output_section_statement;
4794 if (os->constraint == -1)
4797 /* FIXME: We shouldn't need to zero section vmas for ld -r
4798 here, in lang_insert_orphan, or in the default linker scripts.
4799 This is covering for coff backend linker bugs. See PR6945. */
4800 if (os->addr_tree == NULL
4801 && link_info.relocatable
4802 && (bfd_get_flavour (link_info.output_bfd)
4803 == bfd_target_coff_flavour))
4804 os->addr_tree = exp_intop (0);
4805 if (os->addr_tree != NULL)
4807 os->processed_vma = FALSE;
4808 exp_fold_tree (os->addr_tree, bfd_abs_section_ptr, &dot);
4810 if (expld.result.valid_p)
4812 dot = expld.result.value;
4813 if (expld.result.section != NULL)
4814 dot += expld.result.section->vma;
4816 else if (expld.phase != lang_mark_phase_enum)
4817 einfo (_("%F%S: non constant or forward reference"
4818 " address expression for section %s\n"),
4822 if (os->bfd_section == NULL)
4823 /* This section was removed or never actually created. */
4826 /* If this is a COFF shared library section, use the size and
4827 address from the input section. FIXME: This is COFF
4828 specific; it would be cleaner if there were some other way
4829 to do this, but nothing simple comes to mind. */
4830 if (((bfd_get_flavour (link_info.output_bfd)
4831 == bfd_target_ecoff_flavour)
4832 || (bfd_get_flavour (link_info.output_bfd)
4833 == bfd_target_coff_flavour))
4834 && (os->bfd_section->flags & SEC_COFF_SHARED_LIBRARY) != 0)
4838 if (os->children.head == NULL
4839 || os->children.head->header.next != NULL
4840 || (os->children.head->header.type
4841 != lang_input_section_enum))
4842 einfo (_("%P%X: Internal error on COFF shared library"
4843 " section %s\n"), os->name);
4845 input = os->children.head->input_section.section;
4846 bfd_set_section_vma (os->bfd_section->owner,
4848 bfd_section_vma (input->owner, input));
4849 os->bfd_section->size = input->size;
4854 if (bfd_is_abs_section (os->bfd_section))
4856 /* No matter what happens, an abs section starts at zero. */
4857 ASSERT (os->bfd_section->vma == 0);
4861 if (os->addr_tree == NULL)
4863 /* No address specified for this section, get one
4864 from the region specification. */
4865 if (os->region == NULL
4866 || ((os->bfd_section->flags & (SEC_ALLOC | SEC_LOAD))
4867 && os->region->name_list.name[0] == '*'
4868 && strcmp (os->region->name_list.name,
4869 DEFAULT_MEMORY_REGION) == 0))
4871 os->region = lang_memory_default (os->bfd_section);
4874 /* If a loadable section is using the default memory
4875 region, and some non default memory regions were
4876 defined, issue an error message. */
4878 && !IGNORE_SECTION (os->bfd_section)
4879 && ! link_info.relocatable
4881 && strcmp (os->region->name_list.name,
4882 DEFAULT_MEMORY_REGION) == 0
4883 && lang_memory_region_list != NULL
4884 && (strcmp (lang_memory_region_list->name_list.name,
4885 DEFAULT_MEMORY_REGION) != 0
4886 || lang_memory_region_list->next != NULL)
4887 && expld.phase != lang_mark_phase_enum)
4889 /* By default this is an error rather than just a
4890 warning because if we allocate the section to the
4891 default memory region we can end up creating an
4892 excessively large binary, or even seg faulting when
4893 attempting to perform a negative seek. See
4894 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4895 for an example of this. This behaviour can be
4896 overridden by the using the --no-check-sections
4898 if (command_line.check_section_addresses)
4899 einfo (_("%P%F: error: no memory region specified"
4900 " for loadable section `%s'\n"),
4901 bfd_get_section_name (link_info.output_bfd,
4904 einfo (_("%P: warning: no memory region specified"
4905 " for loadable section `%s'\n"),
4906 bfd_get_section_name (link_info.output_bfd,
4910 newdot = os->region->current;
4911 section_alignment = os->bfd_section->alignment_power;
4914 section_alignment = os->section_alignment;
4916 /* Align to what the section needs. */
4917 if (section_alignment > 0)
4919 bfd_vma savedot = newdot;
4920 newdot = align_power (newdot, section_alignment);
4922 if (newdot != savedot
4923 && (config.warn_section_align
4924 || os->addr_tree != NULL)
4925 && expld.phase != lang_mark_phase_enum)
4926 einfo (_("%P: warning: changing start of section"
4927 " %s by %lu bytes\n"),
4928 os->name, (unsigned long) (newdot - savedot));
4931 bfd_set_section_vma (0, os->bfd_section, newdot);
4933 os->bfd_section->output_offset = 0;
4936 lang_size_sections_1 (&os->children.head, os,
4937 os->fill, newdot, relax, check_regions);
4939 os->processed_vma = TRUE;
4941 if (bfd_is_abs_section (os->bfd_section) || os->ignored)
4942 /* Except for some special linker created sections,
4943 no output section should change from zero size
4944 after strip_excluded_output_sections. A non-zero
4945 size on an ignored section indicates that some
4946 input section was not sized early enough. */
4947 ASSERT (os->bfd_section->size == 0);
4950 dot = os->bfd_section->vma;
4952 /* Put the section within the requested block size, or
4953 align at the block boundary. */
4955 + TO_ADDR (os->bfd_section->size)
4956 + os->block_value - 1)
4957 & - (bfd_vma) os->block_value);
4959 os->bfd_section->size = TO_SIZE (after - os->bfd_section->vma);
4962 /* Set section lma. */
4965 r = lang_memory_region_lookup (DEFAULT_MEMORY_REGION, FALSE);
4969 bfd_vma lma = exp_get_abs_int (os->load_base, 0, "load base");
4970 os->bfd_section->lma = lma;
4972 else if (os->lma_region != NULL)
4974 bfd_vma lma = os->lma_region->current;
4976 if (section_alignment > 0)
4977 lma = align_power (lma, section_alignment);
4978 os->bfd_section->lma = lma;
4980 else if (r->last_os != NULL
4981 && (os->bfd_section->flags & SEC_ALLOC) != 0)
4986 last = r->last_os->output_section_statement.bfd_section;
4988 /* A backwards move of dot should be accompanied by
4989 an explicit assignment to the section LMA (ie.
4990 os->load_base set) because backwards moves can
4991 create overlapping LMAs. */
4993 && os->bfd_section->size != 0
4994 && dot + os->bfd_section->size <= last->vma)
4996 /* If dot moved backwards then leave lma equal to
4997 vma. This is the old default lma, which might
4998 just happen to work when the backwards move is
4999 sufficiently large. Nag if this changes anything,
5000 so people can fix their linker scripts. */
5002 if (last->vma != last->lma)
5003 einfo (_("%P: warning: dot moved backwards before `%s'\n"),
5008 /* If this is an overlay, set the current lma to that
5009 at the end of the previous section. */
5010 if (os->sectype == overlay_section)
5011 lma = last->lma + last->size;
5013 /* Otherwise, keep the same lma to vma relationship
5014 as the previous section. */
5016 lma = dot + last->lma - last->vma;
5018 if (section_alignment > 0)
5019 lma = align_power (lma, section_alignment);
5020 os->bfd_section->lma = lma;
5023 os->processed_lma = TRUE;
5025 if (bfd_is_abs_section (os->bfd_section) || os->ignored)
5028 /* Keep track of normal sections using the default
5029 lma region. We use this to set the lma for
5030 following sections. Overlays or other linker
5031 script assignment to lma might mean that the
5032 default lma == vma is incorrect.
5033 To avoid warnings about dot moving backwards when using
5034 -Ttext, don't start tracking sections until we find one
5035 of non-zero size or with lma set differently to vma. */
5036 if (((os->bfd_section->flags & SEC_HAS_CONTENTS) != 0
5037 || (os->bfd_section->flags & SEC_THREAD_LOCAL) == 0)
5038 && (os->bfd_section->flags & SEC_ALLOC) != 0
5039 && (os->bfd_section->size != 0
5040 || (r->last_os == NULL
5041 && os->bfd_section->vma != os->bfd_section->lma)
5042 || (r->last_os != NULL
5043 && dot >= (r->last_os->output_section_statement
5044 .bfd_section->vma)))
5045 && os->lma_region == NULL
5046 && !link_info.relocatable)
5049 /* .tbss sections effectively have zero size. */
5050 if ((os->bfd_section->flags & SEC_HAS_CONTENTS) != 0
5051 || (os->bfd_section->flags & SEC_THREAD_LOCAL) == 0
5052 || link_info.relocatable)
5053 dot += TO_ADDR (os->bfd_section->size);
5055 if (os->update_dot_tree != 0)
5056 exp_fold_tree (os->update_dot_tree, bfd_abs_section_ptr, &dot);
5058 /* Update dot in the region ?
5059 We only do this if the section is going to be allocated,
5060 since unallocated sections do not contribute to the region's
5061 overall size in memory. */
5062 if (os->region != NULL
5063 && (os->bfd_section->flags & (SEC_ALLOC | SEC_LOAD)))
5065 os->region->current = dot;
5068 /* Make sure the new address is within the region. */
5069 os_region_check (os, os->region, os->addr_tree,
5070 os->bfd_section->vma);
5072 if (os->lma_region != NULL && os->lma_region != os->region
5073 && (os->bfd_section->flags & SEC_LOAD))
5075 os->lma_region->current
5076 = os->bfd_section->lma + TO_ADDR (os->bfd_section->size);
5079 os_region_check (os, os->lma_region, NULL,
5080 os->bfd_section->lma);
5086 case lang_constructors_statement_enum:
5087 dot = lang_size_sections_1 (&constructor_list.head,
5088 output_section_statement,
5089 fill, dot, relax, check_regions);
5092 case lang_data_statement_enum:
5094 unsigned int size = 0;
5096 s->data_statement.output_offset =
5097 dot - output_section_statement->bfd_section->vma;
5098 s->data_statement.output_section =
5099 output_section_statement->bfd_section;
5101 /* We might refer to provided symbols in the expression, and
5102 need to mark them as needed. */
5103 exp_fold_tree (s->data_statement.exp, bfd_abs_section_ptr, &dot);
5105 switch (s->data_statement.type)
5123 if (size < TO_SIZE ((unsigned) 1))
5124 size = TO_SIZE ((unsigned) 1);
5125 dot += TO_ADDR (size);
5126 output_section_statement->bfd_section->size += size;
5130 case lang_reloc_statement_enum:
5134 s->reloc_statement.output_offset =
5135 dot - output_section_statement->bfd_section->vma;
5136 s->reloc_statement.output_section =
5137 output_section_statement->bfd_section;
5138 size = bfd_get_reloc_size (s->reloc_statement.howto);
5139 dot += TO_ADDR (size);
5140 output_section_statement->bfd_section->size += size;
5144 case lang_wild_statement_enum:
5145 dot = lang_size_sections_1 (&s->wild_statement.children.head,
5146 output_section_statement,
5147 fill, dot, relax, check_regions);
5150 case lang_object_symbols_statement_enum:
5151 link_info.create_object_symbols_section =
5152 output_section_statement->bfd_section;
5155 case lang_output_statement_enum:
5156 case lang_target_statement_enum:
5159 case lang_input_section_enum:
5163 i = s->input_section.section;
5168 if (! bfd_relax_section (i->owner, i, &link_info, &again))
5169 einfo (_("%P%F: can't relax section: %E\n"));
5173 dot = size_input_section (prev, output_section_statement,
5174 output_section_statement->fill, dot);
5178 case lang_input_statement_enum:
5181 case lang_fill_statement_enum:
5182 s->fill_statement.output_section =
5183 output_section_statement->bfd_section;
5185 fill = s->fill_statement.fill;
5188 case lang_assignment_statement_enum:
5190 bfd_vma newdot = dot;
5191 etree_type *tree = s->assignment_statement.exp;
5193 expld.dataseg.relro = exp_dataseg_relro_none;
5195 exp_fold_tree (tree,
5196 output_section_statement->bfd_section,
5199 if (expld.dataseg.relro == exp_dataseg_relro_start)
5201 if (!expld.dataseg.relro_start_stat)
5202 expld.dataseg.relro_start_stat = s;
5205 ASSERT (expld.dataseg.relro_start_stat == s);
5208 else if (expld.dataseg.relro == exp_dataseg_relro_end)
5210 if (!expld.dataseg.relro_end_stat)
5211 expld.dataseg.relro_end_stat = s;
5214 ASSERT (expld.dataseg.relro_end_stat == s);
5217 expld.dataseg.relro = exp_dataseg_relro_none;
5219 /* This symbol is relative to this section. */
5220 if ((tree->type.node_class == etree_provided
5221 || tree->type.node_class == etree_assign)
5222 && (tree->assign.dst [0] != '.'
5223 || tree->assign.dst [1] != '\0'))
5224 output_section_statement->section_relative_symbol = 1;
5226 if (!output_section_statement->ignored)
5228 if (output_section_statement == abs_output_section)
5230 /* If we don't have an output section, then just adjust
5231 the default memory address. */
5232 lang_memory_region_lookup (DEFAULT_MEMORY_REGION,
5233 FALSE)->current = newdot;
5235 else if (newdot != dot)
5237 /* Insert a pad after this statement. We can't
5238 put the pad before when relaxing, in case the
5239 assignment references dot. */
5240 insert_pad (&s->header.next, fill, TO_SIZE (newdot - dot),
5241 output_section_statement->bfd_section, dot);
5243 /* Don't neuter the pad below when relaxing. */
5246 /* If dot is advanced, this implies that the section
5247 should have space allocated to it, unless the
5248 user has explicitly stated that the section
5249 should not be allocated. */
5250 if (output_section_statement->sectype != noalloc_section
5251 && (output_section_statement->sectype != noload_section
5252 || (bfd_get_flavour (link_info.output_bfd)
5253 == bfd_target_elf_flavour)))
5254 output_section_statement->bfd_section->flags |= SEC_ALLOC;
5261 case lang_padding_statement_enum:
5262 /* If this is the first time lang_size_sections is called,
5263 we won't have any padding statements. If this is the
5264 second or later passes when relaxing, we should allow
5265 padding to shrink. If padding is needed on this pass, it
5266 will be added back in. */
5267 s->padding_statement.size = 0;
5269 /* Make sure output_offset is valid. If relaxation shrinks
5270 the section and this pad isn't needed, it's possible to
5271 have output_offset larger than the final size of the
5272 section. bfd_set_section_contents will complain even for
5273 a pad size of zero. */
5274 s->padding_statement.output_offset
5275 = dot - output_section_statement->bfd_section->vma;
5278 case lang_group_statement_enum:
5279 dot = lang_size_sections_1 (&s->group_statement.children.head,
5280 output_section_statement,
5281 fill, dot, relax, check_regions);
5284 case lang_insert_statement_enum:
5287 /* We can only get here when relaxing is turned on. */
5288 case lang_address_statement_enum:
5295 prev = &s->header.next;
5300 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
5301 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
5302 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
5303 segments. We are allowed an opportunity to override this decision. */
5306 ldlang_override_segment_assignment (struct bfd_link_info * info ATTRIBUTE_UNUSED,
5307 bfd * abfd ATTRIBUTE_UNUSED,
5308 asection * current_section,
5309 asection * previous_section,
5310 bfd_boolean new_segment)
5312 lang_output_section_statement_type * cur;
5313 lang_output_section_statement_type * prev;
5315 /* The checks below are only necessary when the BFD library has decided
5316 that the two sections ought to be placed into the same segment. */
5320 /* Paranoia checks. */
5321 if (current_section == NULL || previous_section == NULL)
5324 /* Find the memory regions associated with the two sections.
5325 We call lang_output_section_find() here rather than scanning the list
5326 of output sections looking for a matching section pointer because if
5327 we have a large number of sections then a hash lookup is faster. */
5328 cur = lang_output_section_find (current_section->name);
5329 prev = lang_output_section_find (previous_section->name);
5331 /* More paranoia. */
5332 if (cur == NULL || prev == NULL)
5335 /* If the regions are different then force the sections to live in
5336 different segments. See the email thread starting at the following
5337 URL for the reasons why this is necessary:
5338 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
5339 return cur->region != prev->region;
5343 one_lang_size_sections_pass (bfd_boolean *relax, bfd_boolean check_regions)
5345 lang_statement_iteration++;
5346 lang_size_sections_1 (&statement_list.head, abs_output_section,
5347 0, 0, relax, check_regions);
5351 lang_size_sections (bfd_boolean *relax, bfd_boolean check_regions)
5353 expld.phase = lang_allocating_phase_enum;
5354 expld.dataseg.phase = exp_dataseg_none;
5356 one_lang_size_sections_pass (relax, check_regions);
5357 if (expld.dataseg.phase == exp_dataseg_end_seen
5358 && link_info.relro && expld.dataseg.relro_end)
5360 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
5361 to put expld.dataseg.relro on a (common) page boundary. */
5362 bfd_vma min_base, old_base, relro_end, maxpage;
5364 expld.dataseg.phase = exp_dataseg_relro_adjust;
5365 maxpage = expld.dataseg.maxpagesize;
5366 /* MIN_BASE is the absolute minimum address we are allowed to start the
5367 read-write segment (byte before will be mapped read-only). */
5368 min_base = (expld.dataseg.min_base + maxpage - 1) & ~(maxpage - 1);
5369 /* OLD_BASE is the address for a feasible minimum address which will
5370 still not cause a data overlap inside MAXPAGE causing file offset skip
5372 old_base = expld.dataseg.base;
5373 expld.dataseg.base += (-expld.dataseg.relro_end
5374 & (expld.dataseg.pagesize - 1));
5375 /* Compute the expected PT_GNU_RELRO segment end. */
5376 relro_end = ((expld.dataseg.relro_end + expld.dataseg.pagesize - 1)
5377 & ~(expld.dataseg.pagesize - 1));
5378 if (min_base + maxpage < expld.dataseg.base)
5380 expld.dataseg.base -= maxpage;
5381 relro_end -= maxpage;
5383 lang_reset_memory_regions ();
5384 one_lang_size_sections_pass (relax, check_regions);
5385 if (expld.dataseg.relro_end > relro_end)
5387 /* The alignment of sections between DATA_SEGMENT_ALIGN
5388 and DATA_SEGMENT_RELRO_END caused huge padding to be
5389 inserted at DATA_SEGMENT_RELRO_END. Try to start a bit lower so
5390 that the section alignments will fit in. */
5392 unsigned int max_alignment_power = 0;
5394 /* Find maximum alignment power of sections between
5395 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
5396 for (sec = link_info.output_bfd->sections; sec; sec = sec->next)
5397 if (sec->vma >= expld.dataseg.base
5398 && sec->vma < expld.dataseg.relro_end
5399 && sec->alignment_power > max_alignment_power)
5400 max_alignment_power = sec->alignment_power;
5402 if (((bfd_vma) 1 << max_alignment_power) < expld.dataseg.pagesize)
5404 if (expld.dataseg.base - (1 << max_alignment_power) < old_base)
5405 expld.dataseg.base += expld.dataseg.pagesize;
5406 expld.dataseg.base -= (1 << max_alignment_power);
5407 lang_reset_memory_regions ();
5408 one_lang_size_sections_pass (relax, check_regions);
5411 link_info.relro_start = expld.dataseg.base;
5412 link_info.relro_end = expld.dataseg.relro_end;
5414 else if (expld.dataseg.phase == exp_dataseg_end_seen)
5416 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
5417 a page could be saved in the data segment. */
5418 bfd_vma first, last;
5420 first = -expld.dataseg.base & (expld.dataseg.pagesize - 1);
5421 last = expld.dataseg.end & (expld.dataseg.pagesize - 1);
5423 && ((expld.dataseg.base & ~(expld.dataseg.pagesize - 1))
5424 != (expld.dataseg.end & ~(expld.dataseg.pagesize - 1)))
5425 && first + last <= expld.dataseg.pagesize)
5427 expld.dataseg.phase = exp_dataseg_adjust;
5428 lang_reset_memory_regions ();
5429 one_lang_size_sections_pass (relax, check_regions);
5433 expld.phase = lang_final_phase_enum;
5436 /* Worker function for lang_do_assignments. Recursiveness goes here. */
5439 lang_do_assignments_1 (lang_statement_union_type *s,
5440 lang_output_section_statement_type *current_os,
5444 for (; s != NULL; s = s->header.next)
5446 switch (s->header.type)
5448 case lang_constructors_statement_enum:
5449 dot = lang_do_assignments_1 (constructor_list.head,
5450 current_os, fill, dot);
5453 case lang_output_section_statement_enum:
5455 lang_output_section_statement_type *os;
5457 os = &(s->output_section_statement);
5458 if (os->bfd_section != NULL && !os->ignored)
5460 dot = os->bfd_section->vma;
5462 lang_do_assignments_1 (os->children.head, os, os->fill, dot);
5464 /* .tbss sections effectively have zero size. */
5465 if ((os->bfd_section->flags & SEC_HAS_CONTENTS) != 0
5466 || (os->bfd_section->flags & SEC_THREAD_LOCAL) == 0
5467 || link_info.relocatable)
5468 dot += TO_ADDR (os->bfd_section->size);
5470 if (os->update_dot_tree != NULL)
5471 exp_fold_tree (os->update_dot_tree, bfd_abs_section_ptr, &dot);
5476 case lang_wild_statement_enum:
5478 dot = lang_do_assignments_1 (s->wild_statement.children.head,
5479 current_os, fill, dot);
5482 case lang_object_symbols_statement_enum:
5483 case lang_output_statement_enum:
5484 case lang_target_statement_enum:
5487 case lang_data_statement_enum:
5488 exp_fold_tree (s->data_statement.exp, bfd_abs_section_ptr, &dot);
5489 if (expld.result.valid_p)
5491 s->data_statement.value = expld.result.value;
5492 if (expld.result.section != NULL)
5493 s->data_statement.value += expld.result.section->vma;
5496 einfo (_("%F%P: invalid data statement\n"));
5499 switch (s->data_statement.type)
5517 if (size < TO_SIZE ((unsigned) 1))
5518 size = TO_SIZE ((unsigned) 1);
5519 dot += TO_ADDR (size);
5523 case lang_reloc_statement_enum:
5524 exp_fold_tree (s->reloc_statement.addend_exp,
5525 bfd_abs_section_ptr, &dot);
5526 if (expld.result.valid_p)
5527 s->reloc_statement.addend_value = expld.result.value;
5529 einfo (_("%F%P: invalid reloc statement\n"));
5530 dot += TO_ADDR (bfd_get_reloc_size (s->reloc_statement.howto));
5533 case lang_input_section_enum:
5535 asection *in = s->input_section.section;
5537 if ((in->flags & SEC_EXCLUDE) == 0)
5538 dot += TO_ADDR (in->size);
5542 case lang_input_statement_enum:
5545 case lang_fill_statement_enum:
5546 fill = s->fill_statement.fill;
5549 case lang_assignment_statement_enum:
5550 exp_fold_tree (s->assignment_statement.exp,
5551 current_os->bfd_section,
5555 case lang_padding_statement_enum:
5556 dot += TO_ADDR (s->padding_statement.size);
5559 case lang_group_statement_enum:
5560 dot = lang_do_assignments_1 (s->group_statement.children.head,
5561 current_os, fill, dot);
5564 case lang_insert_statement_enum:
5567 case lang_address_statement_enum:
5579 lang_do_assignments (void)
5581 lang_statement_iteration++;
5582 lang_do_assignments_1 (statement_list.head, abs_output_section, NULL, 0);
5585 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
5586 operator .startof. (section_name), it produces an undefined symbol
5587 .startof.section_name. Similarly, when it sees
5588 .sizeof. (section_name), it produces an undefined symbol
5589 .sizeof.section_name. For all the output sections, we look for
5590 such symbols, and set them to the correct value. */
5593 lang_set_startof (void)
5597 if (link_info.relocatable)
5600 for (s = link_info.output_bfd->sections; s != NULL; s = s->next)
5602 const char *secname;
5604 struct bfd_link_hash_entry *h;
5606 secname = bfd_get_section_name (link_info.output_bfd, s);
5607 buf = (char *) xmalloc (10 + strlen (secname));
5609 sprintf (buf, ".startof.%s", secname);
5610 h = bfd_link_hash_lookup (link_info.hash, buf, FALSE, FALSE, TRUE);
5611 if (h != NULL && h->type == bfd_link_hash_undefined)
5613 h->type = bfd_link_hash_defined;
5614 h->u.def.value = bfd_get_section_vma (link_info.output_bfd, s);
5615 h->u.def.section = bfd_abs_section_ptr;
5618 sprintf (buf, ".sizeof.%s", secname);
5619 h = bfd_link_hash_lookup (link_info.hash, buf, FALSE, FALSE, TRUE);
5620 if (h != NULL && h->type == bfd_link_hash_undefined)
5622 h->type = bfd_link_hash_defined;
5623 h->u.def.value = TO_ADDR (s->size);
5624 h->u.def.section = bfd_abs_section_ptr;
5634 struct bfd_link_hash_entry *h;
5637 if ((link_info.relocatable && !link_info.gc_sections)
5638 || (link_info.shared && !link_info.executable))
5639 warn = entry_from_cmdline;
5643 /* Force the user to specify a root when generating a relocatable with
5645 if (link_info.gc_sections && link_info.relocatable
5646 && !(entry_from_cmdline || undef_from_cmdline))
5647 einfo (_("%P%F: gc-sections requires either an entry or "
5648 "an undefined symbol\n"));
5650 if (entry_symbol.name == NULL)
5652 /* No entry has been specified. Look for the default entry, but
5653 don't warn if we don't find it. */
5654 entry_symbol.name = entry_symbol_default;
5658 h = bfd_link_hash_lookup (link_info.hash, entry_symbol.name,
5659 FALSE, FALSE, TRUE);
5661 && (h->type == bfd_link_hash_defined
5662 || h->type == bfd_link_hash_defweak)
5663 && h->u.def.section->output_section != NULL)
5667 val = (h->u.def.value
5668 + bfd_get_section_vma (link_info.output_bfd,
5669 h->u.def.section->output_section)
5670 + h->u.def.section->output_offset);
5671 if (! bfd_set_start_address (link_info.output_bfd, val))
5672 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol.name);
5679 /* We couldn't find the entry symbol. Try parsing it as a
5681 val = bfd_scan_vma (entry_symbol.name, &send, 0);
5684 if (! bfd_set_start_address (link_info.output_bfd, val))
5685 einfo (_("%P%F: can't set start address\n"));
5691 /* Can't find the entry symbol, and it's not a number. Use
5692 the first address in the text section. */
5693 ts = bfd_get_section_by_name (link_info.output_bfd, entry_section);
5697 einfo (_("%P: warning: cannot find entry symbol %s;"
5698 " defaulting to %V\n"),
5700 bfd_get_section_vma (link_info.output_bfd, ts));
5701 if (!(bfd_set_start_address
5702 (link_info.output_bfd,
5703 bfd_get_section_vma (link_info.output_bfd, ts))))
5704 einfo (_("%P%F: can't set start address\n"));
5709 einfo (_("%P: warning: cannot find entry symbol %s;"
5710 " not setting start address\n"),
5716 /* Don't bfd_hash_table_free (&lang_definedness_table);
5717 map file output may result in a call of lang_track_definedness. */
5720 /* This is a small function used when we want to ignore errors from
5724 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED, ...)
5726 /* Don't do anything. */
5729 /* Check that the architecture of all the input files is compatible
5730 with the output file. Also call the backend to let it do any
5731 other checking that is needed. */
5736 lang_statement_union_type *file;
5738 const bfd_arch_info_type *compatible;
5740 for (file = file_chain.head; file != NULL; file = file->input_statement.next)
5742 input_bfd = file->input_statement.the_bfd;
5744 = bfd_arch_get_compatible (input_bfd, link_info.output_bfd,
5745 command_line.accept_unknown_input_arch);
5747 /* In general it is not possible to perform a relocatable
5748 link between differing object formats when the input
5749 file has relocations, because the relocations in the
5750 input format may not have equivalent representations in
5751 the output format (and besides BFD does not translate
5752 relocs for other link purposes than a final link). */
5753 if ((link_info.relocatable || link_info.emitrelocations)
5754 && (compatible == NULL
5755 || (bfd_get_flavour (input_bfd)
5756 != bfd_get_flavour (link_info.output_bfd)))
5757 && (bfd_get_file_flags (input_bfd) & HAS_RELOC) != 0)
5759 einfo (_("%P%F: Relocatable linking with relocations from"
5760 " format %s (%B) to format %s (%B) is not supported\n"),
5761 bfd_get_target (input_bfd), input_bfd,
5762 bfd_get_target (link_info.output_bfd), link_info.output_bfd);
5763 /* einfo with %F exits. */
5766 if (compatible == NULL)
5768 if (command_line.warn_mismatch)
5769 einfo (_("%P%X: %s architecture of input file `%B'"
5770 " is incompatible with %s output\n"),
5771 bfd_printable_name (input_bfd), input_bfd,
5772 bfd_printable_name (link_info.output_bfd));
5774 else if (bfd_count_sections (input_bfd))
5776 /* If the input bfd has no contents, it shouldn't set the
5777 private data of the output bfd. */
5779 bfd_error_handler_type pfn = NULL;
5781 /* If we aren't supposed to warn about mismatched input
5782 files, temporarily set the BFD error handler to a
5783 function which will do nothing. We still want to call
5784 bfd_merge_private_bfd_data, since it may set up
5785 information which is needed in the output file. */
5786 if (! command_line.warn_mismatch)
5787 pfn = bfd_set_error_handler (ignore_bfd_errors);
5788 if (! bfd_merge_private_bfd_data (input_bfd, link_info.output_bfd))
5790 if (command_line.warn_mismatch)
5791 einfo (_("%P%X: failed to merge target specific data"
5792 " of file %B\n"), input_bfd);
5794 if (! command_line.warn_mismatch)
5795 bfd_set_error_handler (pfn);
5800 /* Look through all the global common symbols and attach them to the
5801 correct section. The -sort-common command line switch may be used
5802 to roughly sort the entries by alignment. */
5807 if (command_line.inhibit_common_definition)
5809 if (link_info.relocatable
5810 && ! command_line.force_common_definition)
5813 if (! config.sort_common)
5814 bfd_link_hash_traverse (link_info.hash, lang_one_common, NULL);
5819 if (config.sort_common == sort_descending)
5821 for (power = 4; power > 0; power--)
5822 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
5825 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
5829 for (power = 0; power <= 4; power++)
5830 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
5833 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
5838 /* Place one common symbol in the correct section. */
5841 lang_one_common (struct bfd_link_hash_entry *h, void *info)
5843 unsigned int power_of_two;
5847 if (h->type != bfd_link_hash_common)
5851 power_of_two = h->u.c.p->alignment_power;
5853 if (config.sort_common == sort_descending
5854 && power_of_two < *(unsigned int *) info)
5856 else if (config.sort_common == sort_ascending
5857 && power_of_two > *(unsigned int *) info)
5860 section = h->u.c.p->section;
5861 if (!bfd_define_common_symbol (link_info.output_bfd, &link_info, h))
5862 einfo (_("%P%F: Could not define common symbol `%T': %E\n"),
5865 if (config.map_file != NULL)
5867 static bfd_boolean header_printed;
5872 if (! header_printed)
5874 minfo (_("\nAllocating common symbols\n"));
5875 minfo (_("Common symbol size file\n\n"));
5876 header_printed = TRUE;
5879 name = bfd_demangle (link_info.output_bfd, h->root.string,
5880 DMGL_ANSI | DMGL_PARAMS);
5883 minfo ("%s", h->root.string);
5884 len = strlen (h->root.string);
5889 len = strlen (name);
5905 if (size <= 0xffffffff)
5906 sprintf (buf, "%lx", (unsigned long) size);
5908 sprintf_vma (buf, size);
5918 minfo ("%B\n", section->owner);
5924 /* Run through the input files and ensure that every input section has
5925 somewhere to go. If one is found without a destination then create
5926 an input request and place it into the statement tree. */
5929 lang_place_orphans (void)
5931 LANG_FOR_EACH_INPUT_STATEMENT (file)
5935 for (s = file->the_bfd->sections; s != NULL; s = s->next)
5937 if (s->output_section == NULL)
5939 /* This section of the file is not attached, root
5940 around for a sensible place for it to go. */
5942 if (file->just_syms_flag)
5943 bfd_link_just_syms (file->the_bfd, s, &link_info);
5944 else if ((s->flags & SEC_EXCLUDE) != 0)
5945 s->output_section = bfd_abs_section_ptr;
5946 else if (strcmp (s->name, "COMMON") == 0)
5948 /* This is a lonely common section which must have
5949 come from an archive. We attach to the section
5950 with the wildcard. */
5951 if (! link_info.relocatable
5952 || command_line.force_common_definition)
5954 if (default_common_section == NULL)
5955 default_common_section
5956 = lang_output_section_statement_lookup (".bss", 0,
5958 lang_add_section (&default_common_section->children, s,
5959 default_common_section);
5964 const char *name = s->name;
5967 if (config.unique_orphan_sections
5968 || unique_section_p (s, NULL))
5969 constraint = SPECIAL;
5971 if (!ldemul_place_orphan (s, name, constraint))
5973 lang_output_section_statement_type *os;
5974 os = lang_output_section_statement_lookup (name,
5977 if (os->addr_tree == NULL
5978 && (link_info.relocatable
5979 || (s->flags & (SEC_LOAD | SEC_ALLOC)) == 0))
5980 os->addr_tree = exp_intop (0);
5981 lang_add_section (&os->children, s, os);
5990 lang_set_flags (lang_memory_region_type *ptr, const char *flags, int invert)
5992 flagword *ptr_flags;
5994 ptr_flags = invert ? &ptr->not_flags : &ptr->flags;
6000 *ptr_flags |= SEC_ALLOC;
6004 *ptr_flags |= SEC_READONLY;
6008 *ptr_flags |= SEC_DATA;
6012 *ptr_flags |= SEC_CODE;
6017 *ptr_flags |= SEC_LOAD;
6021 einfo (_("%P%F: invalid syntax in flags\n"));
6028 /* Call a function on each input file. This function will be called
6029 on an archive, but not on the elements. */
6032 lang_for_each_input_file (void (*func) (lang_input_statement_type *))
6034 lang_input_statement_type *f;
6036 for (f = (lang_input_statement_type *) input_file_chain.head;
6038 f = (lang_input_statement_type *) f->next_real_file)
6042 /* Call a function on each file. The function will be called on all
6043 the elements of an archive which are included in the link, but will
6044 not be called on the archive file itself. */
6047 lang_for_each_file (void (*func) (lang_input_statement_type *))
6049 LANG_FOR_EACH_INPUT_STATEMENT (f)
6056 ldlang_add_file (lang_input_statement_type *entry)
6058 lang_statement_append (&file_chain,
6059 (lang_statement_union_type *) entry,
6062 /* The BFD linker needs to have a list of all input BFDs involved in
6064 ASSERT (entry->the_bfd->link_next == NULL);
6065 ASSERT (entry->the_bfd != link_info.output_bfd);
6067 *link_info.input_bfds_tail = entry->the_bfd;
6068 link_info.input_bfds_tail = &entry->the_bfd->link_next;
6069 entry->the_bfd->usrdata = entry;
6070 bfd_set_gp_size (entry->the_bfd, g_switch_value);
6072 /* Look through the sections and check for any which should not be
6073 included in the link. We need to do this now, so that we can
6074 notice when the backend linker tries to report multiple
6075 definition errors for symbols which are in sections we aren't
6076 going to link. FIXME: It might be better to entirely ignore
6077 symbols which are defined in sections which are going to be
6078 discarded. This would require modifying the backend linker for
6079 each backend which might set the SEC_LINK_ONCE flag. If we do
6080 this, we should probably handle SEC_EXCLUDE in the same way. */
6082 bfd_map_over_sections (entry->the_bfd, section_already_linked, entry);
6086 lang_add_output (const char *name, int from_script)
6088 /* Make -o on command line override OUTPUT in script. */
6089 if (!had_output_filename || !from_script)
6091 output_filename = name;
6092 had_output_filename = TRUE;
6096 static lang_output_section_statement_type *current_section;
6107 for (l = 0; l < 32; l++)
6109 if (i >= (unsigned int) x)
6117 lang_output_section_statement_type *
6118 lang_enter_output_section_statement (const char *output_section_statement_name,
6119 etree_type *address_exp,
6120 enum section_type sectype,
6122 etree_type *subalign,
6126 lang_output_section_statement_type *os;
6128 os = lang_output_section_statement_lookup (output_section_statement_name,
6130 current_section = os;
6132 if (os->addr_tree == NULL)
6134 os->addr_tree = address_exp;
6136 os->sectype = sectype;
6137 if (sectype != noload_section)
6138 os->flags = SEC_NO_FLAGS;
6140 os->flags = SEC_NEVER_LOAD;
6141 os->block_value = 1;
6143 /* Make next things chain into subchain of this. */
6144 push_stat_ptr (&os->children);
6146 os->subsection_alignment =
6147 topower (exp_get_value_int (subalign, -1, "subsection alignment"));
6148 os->section_alignment =
6149 topower (exp_get_value_int (align, -1, "section alignment"));
6151 os->load_base = ebase;
6158 lang_output_statement_type *new_stmt;
6160 new_stmt = new_stat (lang_output_statement, stat_ptr);
6161 new_stmt->name = output_filename;
6165 /* Reset the current counters in the regions. */
6168 lang_reset_memory_regions (void)
6170 lang_memory_region_type *p = lang_memory_region_list;
6172 lang_output_section_statement_type *os;
6174 for (p = lang_memory_region_list; p != NULL; p = p->next)
6176 p->current = p->origin;
6180 for (os = &lang_output_section_statement.head->output_section_statement;
6184 os->processed_vma = FALSE;
6185 os->processed_lma = FALSE;
6188 for (o = link_info.output_bfd->sections; o != NULL; o = o->next)
6190 /* Save the last size for possible use by bfd_relax_section. */
6191 o->rawsize = o->size;
6196 /* Worker for lang_gc_sections_1. */
6199 gc_section_callback (lang_wild_statement_type *ptr,
6200 struct wildcard_list *sec ATTRIBUTE_UNUSED,
6202 lang_input_statement_type *file ATTRIBUTE_UNUSED,
6203 void *data ATTRIBUTE_UNUSED)
6205 /* If the wild pattern was marked KEEP, the member sections
6206 should be as well. */
6207 if (ptr->keep_sections)
6208 section->flags |= SEC_KEEP;
6211 /* Iterate over sections marking them against GC. */
6214 lang_gc_sections_1 (lang_statement_union_type *s)
6216 for (; s != NULL; s = s->header.next)
6218 switch (s->header.type)
6220 case lang_wild_statement_enum:
6221 walk_wild (&s->wild_statement, gc_section_callback, NULL);
6223 case lang_constructors_statement_enum:
6224 lang_gc_sections_1 (constructor_list.head);
6226 case lang_output_section_statement_enum:
6227 lang_gc_sections_1 (s->output_section_statement.children.head);
6229 case lang_group_statement_enum:
6230 lang_gc_sections_1 (s->group_statement.children.head);
6239 lang_gc_sections (void)
6241 /* Keep all sections so marked in the link script. */
6243 lang_gc_sections_1 (statement_list.head);
6245 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
6246 the special case of debug info. (See bfd/stabs.c)
6247 Twiddle the flag here, to simplify later linker code. */
6248 if (link_info.relocatable)
6250 LANG_FOR_EACH_INPUT_STATEMENT (f)
6253 for (sec = f->the_bfd->sections; sec != NULL; sec = sec->next)
6254 if ((sec->flags & SEC_DEBUGGING) == 0)
6255 sec->flags &= ~SEC_EXCLUDE;
6259 if (link_info.gc_sections)
6260 bfd_gc_sections (link_info.output_bfd, &link_info);
6263 /* Worker for lang_find_relro_sections_1. */
6266 find_relro_section_callback (lang_wild_statement_type *ptr ATTRIBUTE_UNUSED,
6267 struct wildcard_list *sec ATTRIBUTE_UNUSED,
6269 lang_input_statement_type *file ATTRIBUTE_UNUSED,
6272 /* Discarded, excluded and ignored sections effectively have zero
6274 if (section->output_section != NULL
6275 && section->output_section->owner == link_info.output_bfd
6276 && (section->output_section->flags & SEC_EXCLUDE) == 0
6277 && !IGNORE_SECTION (section)
6278 && section->size != 0)
6280 bfd_boolean *has_relro_section = (bfd_boolean *) data;
6281 *has_relro_section = TRUE;
6285 /* Iterate over sections for relro sections. */
6288 lang_find_relro_sections_1 (lang_statement_union_type *s,
6289 bfd_boolean *has_relro_section)
6291 if (*has_relro_section)
6294 for (; s != NULL; s = s->header.next)
6296 if (s == expld.dataseg.relro_end_stat)
6299 switch (s->header.type)
6301 case lang_wild_statement_enum:
6302 walk_wild (&s->wild_statement,
6303 find_relro_section_callback,
6306 case lang_constructors_statement_enum:
6307 lang_find_relro_sections_1 (constructor_list.head,
6310 case lang_output_section_statement_enum:
6311 lang_find_relro_sections_1 (s->output_section_statement.children.head,
6314 case lang_group_statement_enum:
6315 lang_find_relro_sections_1 (s->group_statement.children.head,
6325 lang_find_relro_sections (void)
6327 bfd_boolean has_relro_section = FALSE;
6329 /* Check all sections in the link script. */
6331 lang_find_relro_sections_1 (expld.dataseg.relro_start_stat,
6332 &has_relro_section);
6334 if (!has_relro_section)
6335 link_info.relro = FALSE;
6338 /* Relax all sections until bfd_relax_section gives up. */
6341 lang_relax_sections (bfd_boolean need_layout)
6343 if (RELAXATION_ENABLED)
6345 /* We may need more than one relaxation pass. */
6346 int i = link_info.relax_pass;
6348 /* The backend can use it to determine the current pass. */
6349 link_info.relax_pass = 0;
6353 /* Keep relaxing until bfd_relax_section gives up. */
6354 bfd_boolean relax_again;
6356 link_info.relax_trip = -1;
6359 link_info.relax_trip++;
6361 /* Note: pe-dll.c does something like this also. If you find
6362 you need to change this code, you probably need to change
6363 pe-dll.c also. DJ */
6365 /* Do all the assignments with our current guesses as to
6367 lang_do_assignments ();
6369 /* We must do this after lang_do_assignments, because it uses
6371 lang_reset_memory_regions ();
6373 /* Perform another relax pass - this time we know where the
6374 globals are, so can make a better guess. */
6375 relax_again = FALSE;
6376 lang_size_sections (&relax_again, FALSE);
6378 while (relax_again);
6380 link_info.relax_pass++;
6387 /* Final extra sizing to report errors. */
6388 lang_do_assignments ();
6389 lang_reset_memory_regions ();
6390 lang_size_sections (NULL, TRUE);
6397 /* Finalize dynamic list. */
6398 if (link_info.dynamic_list)
6399 lang_finalize_version_expr_head (&link_info.dynamic_list->head);
6401 current_target = default_target;
6403 /* Open the output file. */
6404 lang_for_each_statement (ldlang_open_output);
6407 ldemul_create_output_section_statements ();
6409 /* Add to the hash table all undefineds on the command line. */
6410 lang_place_undefineds ();
6411 lang_place_defineds ();
6413 if (!bfd_section_already_linked_table_init ())
6414 einfo (_("%P%F: Failed to create hash table\n"));
6416 /* Create a bfd for each input file. */
6417 current_target = default_target;
6418 open_input_bfds (statement_list.head, FALSE);
6420 #ifdef ENABLE_PLUGINS
6422 union lang_statement_union **listend;
6423 /* Now all files are read, let the plugin(s) decide if there
6424 are any more to be added to the link before we call the
6425 emulation's after_open hook. */
6426 listend = statement_list.tail;
6428 if (plugin_call_all_symbols_read ())
6429 einfo (_("%P%F: %s: plugin reported error after all symbols read\n"),
6430 plugin_error_plugin ());
6431 /* If any new files were added, they will be on the end of the
6432 statement list, and we can open them now by getting open_input_bfds
6433 to carry on from where it ended last time. */
6435 open_input_bfds (*listend, FALSE);
6437 #endif /* ENABLE_PLUGINS */
6439 link_info.gc_sym_list = &entry_symbol;
6440 if (entry_symbol.name == NULL)
6441 link_info.gc_sym_list = ldlang_undef_chain_list_head;
6443 ldemul_after_open ();
6445 bfd_section_already_linked_table_free ();
6447 /* Make sure that we're not mixing architectures. We call this
6448 after all the input files have been opened, but before we do any
6449 other processing, so that any operations merge_private_bfd_data
6450 does on the output file will be known during the rest of the
6454 /* Handle .exports instead of a version script if we're told to do so. */
6455 if (command_line.version_exports_section)
6456 lang_do_version_exports_section ();
6458 /* Build all sets based on the information gathered from the input
6460 ldctor_build_sets ();
6462 /* Remove unreferenced sections if asked to. */
6463 lang_gc_sections ();
6465 /* Size up the common data. */
6468 /* Update wild statements. */
6469 update_wild_statements (statement_list.head);
6471 /* Run through the contours of the script and attach input sections
6472 to the correct output sections. */
6473 map_input_to_output_sections (statement_list.head, NULL, NULL);
6475 process_insert_statements ();
6477 /* Find any sections not attached explicitly and handle them. */
6478 lang_place_orphans ();
6480 if (! link_info.relocatable)
6484 /* Merge SEC_MERGE sections. This has to be done after GC of
6485 sections, so that GCed sections are not merged, but before
6486 assigning dynamic symbols, since removing whole input sections
6488 bfd_merge_sections (link_info.output_bfd, &link_info);
6490 /* Look for a text section and set the readonly attribute in it. */
6491 found = bfd_get_section_by_name (link_info.output_bfd, ".text");
6495 if (config.text_read_only)
6496 found->flags |= SEC_READONLY;
6498 found->flags &= ~SEC_READONLY;
6502 /* Do anything special before sizing sections. This is where ELF
6503 and other back-ends size dynamic sections. */
6504 ldemul_before_allocation ();
6506 /* We must record the program headers before we try to fix the
6507 section positions, since they will affect SIZEOF_HEADERS. */
6508 lang_record_phdrs ();
6510 /* Check relro sections. */
6511 if (link_info.relro && ! link_info.relocatable)
6512 lang_find_relro_sections ();
6514 /* Size up the sections. */
6515 lang_size_sections (NULL, ! RELAXATION_ENABLED);
6517 /* See if anything special should be done now we know how big
6518 everything is. This is where relaxation is done. */
6519 ldemul_after_allocation ();
6521 /* Fix any .startof. or .sizeof. symbols. */
6522 lang_set_startof ();
6524 /* Do all the assignments, now that we know the final resting places
6525 of all the symbols. */
6527 lang_do_assignments ();
6531 /* Make sure that the section addresses make sense. */
6532 if (command_line.check_section_addresses)
6533 lang_check_section_addresses ();
6538 /* EXPORTED TO YACC */
6541 lang_add_wild (struct wildcard_spec *filespec,
6542 struct wildcard_list *section_list,
6543 bfd_boolean keep_sections)
6545 struct wildcard_list *curr, *next;
6546 lang_wild_statement_type *new_stmt;
6548 /* Reverse the list as the parser puts it back to front. */
6549 for (curr = section_list, section_list = NULL;
6551 section_list = curr, curr = next)
6553 if (curr->spec.name != NULL && strcmp (curr->spec.name, "COMMON") == 0)
6554 placed_commons = TRUE;
6557 curr->next = section_list;
6560 if (filespec != NULL && filespec->name != NULL)
6562 if (strcmp (filespec->name, "*") == 0)
6563 filespec->name = NULL;
6564 else if (! wildcardp (filespec->name))
6565 lang_has_input_file = TRUE;
6568 new_stmt = new_stat (lang_wild_statement, stat_ptr);
6569 new_stmt->filename = NULL;
6570 new_stmt->filenames_sorted = FALSE;
6571 if (filespec != NULL)
6573 new_stmt->filename = filespec->name;
6574 new_stmt->filenames_sorted = filespec->sorted == by_name;
6576 new_stmt->section_list = section_list;
6577 new_stmt->keep_sections = keep_sections;
6578 lang_list_init (&new_stmt->children);
6579 analyze_walk_wild_section_handler (new_stmt);
6583 lang_section_start (const char *name, etree_type *address,
6584 const segment_type *segment)
6586 lang_address_statement_type *ad;
6588 ad = new_stat (lang_address_statement, stat_ptr);
6589 ad->section_name = name;
6590 ad->address = address;
6591 ad->segment = segment;
6594 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
6595 because of a -e argument on the command line, or zero if this is
6596 called by ENTRY in a linker script. Command line arguments take
6600 lang_add_entry (const char *name, bfd_boolean cmdline)
6602 if (entry_symbol.name == NULL
6604 || ! entry_from_cmdline)
6606 entry_symbol.name = name;
6607 entry_from_cmdline = cmdline;
6611 /* Set the default start symbol to NAME. .em files should use this,
6612 not lang_add_entry, to override the use of "start" if neither the
6613 linker script nor the command line specifies an entry point. NAME
6614 must be permanently allocated. */
6616 lang_default_entry (const char *name)
6618 entry_symbol_default = name;
6622 lang_add_target (const char *name)
6624 lang_target_statement_type *new_stmt;
6626 new_stmt = new_stat (lang_target_statement, stat_ptr);
6627 new_stmt->target = name;
6631 lang_add_map (const char *name)
6638 map_option_f = TRUE;
6646 lang_add_fill (fill_type *fill)
6648 lang_fill_statement_type *new_stmt;
6650 new_stmt = new_stat (lang_fill_statement, stat_ptr);
6651 new_stmt->fill = fill;
6655 lang_add_data (int type, union etree_union *exp)
6657 lang_data_statement_type *new_stmt;
6659 new_stmt = new_stat (lang_data_statement, stat_ptr);
6660 new_stmt->exp = exp;
6661 new_stmt->type = type;
6664 /* Create a new reloc statement. RELOC is the BFD relocation type to
6665 generate. HOWTO is the corresponding howto structure (we could
6666 look this up, but the caller has already done so). SECTION is the
6667 section to generate a reloc against, or NAME is the name of the
6668 symbol to generate a reloc against. Exactly one of SECTION and
6669 NAME must be NULL. ADDEND is an expression for the addend. */
6672 lang_add_reloc (bfd_reloc_code_real_type reloc,
6673 reloc_howto_type *howto,
6676 union etree_union *addend)
6678 lang_reloc_statement_type *p = new_stat (lang_reloc_statement, stat_ptr);
6682 p->section = section;
6684 p->addend_exp = addend;
6686 p->addend_value = 0;
6687 p->output_section = NULL;
6688 p->output_offset = 0;
6691 lang_assignment_statement_type *
6692 lang_add_assignment (etree_type *exp)
6694 lang_assignment_statement_type *new_stmt;
6696 extern int parsing_defsym;
6698 ldlang_add_def (exp->assign.dst);
6700 new_stmt = new_stat (lang_assignment_statement, stat_ptr);
6701 new_stmt->exp = exp;
6706 lang_add_attribute (enum statement_enum attribute)
6708 new_statement (attribute, sizeof (lang_statement_header_type), stat_ptr);
6712 lang_startup (const char *name)
6714 if (startup_file != NULL)
6716 einfo (_("%P%F: multiple STARTUP files\n"));
6718 first_file->filename = name;
6719 first_file->local_sym_name = name;
6720 first_file->real = TRUE;
6722 startup_file = name;
6726 lang_float (bfd_boolean maybe)
6728 lang_float_flag = maybe;
6732 /* Work out the load- and run-time regions from a script statement, and
6733 store them in *LMA_REGION and *REGION respectively.
6735 MEMSPEC is the name of the run-time region, or the value of
6736 DEFAULT_MEMORY_REGION if the statement didn't specify one.
6737 LMA_MEMSPEC is the name of the load-time region, or null if the
6738 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
6739 had an explicit load address.
6741 It is an error to specify both a load region and a load address. */
6744 lang_get_regions (lang_memory_region_type **region,
6745 lang_memory_region_type **lma_region,
6746 const char *memspec,
6747 const char *lma_memspec,
6748 bfd_boolean have_lma,
6749 bfd_boolean have_vma)
6751 *lma_region = lang_memory_region_lookup (lma_memspec, FALSE);
6753 /* If no runtime region or VMA has been specified, but the load region
6754 has been specified, then use the load region for the runtime region
6756 if (lma_memspec != NULL
6758 && strcmp (memspec, DEFAULT_MEMORY_REGION) == 0)
6759 *region = *lma_region;
6761 *region = lang_memory_region_lookup (memspec, FALSE);
6763 if (have_lma && lma_memspec != 0)
6764 einfo (_("%X%P:%S: section has both a load address and a load region\n"));
6768 lang_leave_output_section_statement (fill_type *fill, const char *memspec,
6769 lang_output_section_phdr_list *phdrs,
6770 const char *lma_memspec)
6772 lang_get_regions (¤t_section->region,
6773 ¤t_section->lma_region,
6774 memspec, lma_memspec,
6775 current_section->load_base != NULL,
6776 current_section->addr_tree != NULL);
6778 /* If this section has no load region or base, but has the same
6779 region as the previous section, then propagate the previous
6780 section's load region. */
6782 if (!current_section->lma_region && !current_section->load_base
6783 && current_section->region == current_section->prev->region)
6784 current_section->lma_region = current_section->prev->lma_region;
6786 current_section->fill = fill;
6787 current_section->phdrs = phdrs;
6791 /* Create an absolute symbol with the given name with the value of the
6792 address of first byte of the section named.
6794 If the symbol already exists, then do nothing. */
6797 lang_abs_symbol_at_beginning_of (const char *secname, const char *name)
6799 struct bfd_link_hash_entry *h;
6801 h = bfd_link_hash_lookup (link_info.hash, name, TRUE, TRUE, TRUE);
6803 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
6805 if (h->type == bfd_link_hash_new
6806 || h->type == bfd_link_hash_undefined)
6810 h->type = bfd_link_hash_defined;
6812 sec = bfd_get_section_by_name (link_info.output_bfd, secname);
6816 h->u.def.value = bfd_get_section_vma (link_info.output_bfd, sec);
6818 h->u.def.section = bfd_abs_section_ptr;
6822 /* Create an absolute symbol with the given name with the value of the
6823 address of the first byte after the end of the section named.
6825 If the symbol already exists, then do nothing. */
6828 lang_abs_symbol_at_end_of (const char *secname, const char *name)
6830 struct bfd_link_hash_entry *h;
6832 h = bfd_link_hash_lookup (link_info.hash, name, TRUE, TRUE, TRUE);
6834 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
6836 if (h->type == bfd_link_hash_new
6837 || h->type == bfd_link_hash_undefined)
6841 h->type = bfd_link_hash_defined;
6843 sec = bfd_get_section_by_name (link_info.output_bfd, secname);
6847 h->u.def.value = (bfd_get_section_vma (link_info.output_bfd, sec)
6848 + TO_ADDR (sec->size));
6850 h->u.def.section = bfd_abs_section_ptr;
6855 lang_statement_append (lang_statement_list_type *list,
6856 lang_statement_union_type *element,
6857 lang_statement_union_type **field)
6859 *(list->tail) = element;
6863 /* Set the output format type. -oformat overrides scripts. */
6866 lang_add_output_format (const char *format,
6871 if (output_target == NULL || !from_script)
6873 if (command_line.endian == ENDIAN_BIG
6876 else if (command_line.endian == ENDIAN_LITTLE
6880 output_target = format;
6885 lang_add_insert (const char *where, int is_before)
6887 lang_insert_statement_type *new_stmt;
6889 new_stmt = new_stat (lang_insert_statement, stat_ptr);
6890 new_stmt->where = where;
6891 new_stmt->is_before = is_before;
6892 saved_script_handle = previous_script_handle;
6895 /* Enter a group. This creates a new lang_group_statement, and sets
6896 stat_ptr to build new statements within the group. */
6899 lang_enter_group (void)
6901 lang_group_statement_type *g;
6903 g = new_stat (lang_group_statement, stat_ptr);
6904 lang_list_init (&g->children);
6905 push_stat_ptr (&g->children);
6908 /* Leave a group. This just resets stat_ptr to start writing to the
6909 regular list of statements again. Note that this will not work if
6910 groups can occur inside anything else which can adjust stat_ptr,
6911 but currently they can't. */
6914 lang_leave_group (void)
6919 /* Add a new program header. This is called for each entry in a PHDRS
6920 command in a linker script. */
6923 lang_new_phdr (const char *name,
6925 bfd_boolean filehdr,
6930 struct lang_phdr *n, **pp;
6933 n = (struct lang_phdr *) stat_alloc (sizeof (struct lang_phdr));
6936 n->type = exp_get_value_int (type, 0, "program header type");
6937 n->filehdr = filehdr;
6942 hdrs = n->type == 1 && (phdrs || filehdr);
6944 for (pp = &lang_phdr_list; *pp != NULL; pp = &(*pp)->next)
6947 && !((*pp)->filehdr || (*pp)->phdrs))
6949 einfo (_("%X%P:%S: PHDRS and FILEHDR are not supported when prior PT_LOAD headers lack them\n"));
6956 /* Record the program header information in the output BFD. FIXME: We
6957 should not be calling an ELF specific function here. */
6960 lang_record_phdrs (void)
6964 lang_output_section_phdr_list *last;
6965 struct lang_phdr *l;
6966 lang_output_section_statement_type *os;
6969 secs = (asection **) xmalloc (alc * sizeof (asection *));
6972 for (l = lang_phdr_list; l != NULL; l = l->next)
6979 for (os = &lang_output_section_statement.head->output_section_statement;
6983 lang_output_section_phdr_list *pl;
6985 if (os->constraint < 0)
6993 if (os->sectype == noload_section
6994 || os->bfd_section == NULL
6995 || (os->bfd_section->flags & SEC_ALLOC) == 0)
6998 /* Don't add orphans to PT_INTERP header. */
7004 lang_output_section_statement_type * tmp_os;
7006 /* If we have not run across a section with a program
7007 header assigned to it yet, then scan forwards to find
7008 one. This prevents inconsistencies in the linker's
7009 behaviour when a script has specified just a single
7010 header and there are sections in that script which are
7011 not assigned to it, and which occur before the first
7012 use of that header. See here for more details:
7013 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
7014 for (tmp_os = os; tmp_os; tmp_os = tmp_os->next)
7017 last = tmp_os->phdrs;
7021 einfo (_("%F%P: no sections assigned to phdrs\n"));
7026 if (os->bfd_section == NULL)
7029 for (; pl != NULL; pl = pl->next)
7031 if (strcmp (pl->name, l->name) == 0)
7036 secs = (asection **) xrealloc (secs,
7037 alc * sizeof (asection *));
7039 secs[c] = os->bfd_section;
7046 if (l->flags == NULL)
7049 flags = exp_get_vma (l->flags, 0, "phdr flags");
7054 at = exp_get_vma (l->at, 0, "phdr load address");
7056 if (! bfd_record_phdr (link_info.output_bfd, l->type,
7057 l->flags != NULL, flags, l->at != NULL,
7058 at, l->filehdr, l->phdrs, c, secs))
7059 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
7064 /* Make sure all the phdr assignments succeeded. */
7065 for (os = &lang_output_section_statement.head->output_section_statement;
7069 lang_output_section_phdr_list *pl;
7071 if (os->constraint < 0
7072 || os->bfd_section == NULL)
7075 for (pl = os->phdrs;
7078 if (! pl->used && strcmp (pl->name, "NONE") != 0)
7079 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
7080 os->name, pl->name);
7084 /* Record a list of sections which may not be cross referenced. */
7087 lang_add_nocrossref (lang_nocrossref_type *l)
7089 struct lang_nocrossrefs *n;
7091 n = (struct lang_nocrossrefs *) xmalloc (sizeof *n);
7092 n->next = nocrossref_list;
7094 nocrossref_list = n;
7096 /* Set notice_all so that we get informed about all symbols. */
7097 link_info.notice_all = TRUE;
7100 /* Overlay handling. We handle overlays with some static variables. */
7102 /* The overlay virtual address. */
7103 static etree_type *overlay_vma;
7104 /* And subsection alignment. */
7105 static etree_type *overlay_subalign;
7107 /* An expression for the maximum section size seen so far. */
7108 static etree_type *overlay_max;
7110 /* A list of all the sections in this overlay. */
7112 struct overlay_list {
7113 struct overlay_list *next;
7114 lang_output_section_statement_type *os;
7117 static struct overlay_list *overlay_list;
7119 /* Start handling an overlay. */
7122 lang_enter_overlay (etree_type *vma_expr, etree_type *subalign)
7124 /* The grammar should prevent nested overlays from occurring. */
7125 ASSERT (overlay_vma == NULL
7126 && overlay_subalign == NULL
7127 && overlay_max == NULL);
7129 overlay_vma = vma_expr;
7130 overlay_subalign = subalign;
7133 /* Start a section in an overlay. We handle this by calling
7134 lang_enter_output_section_statement with the correct VMA.
7135 lang_leave_overlay sets up the LMA and memory regions. */
7138 lang_enter_overlay_section (const char *name)
7140 struct overlay_list *n;
7143 lang_enter_output_section_statement (name, overlay_vma, overlay_section,
7144 0, overlay_subalign, 0, 0);
7146 /* If this is the first section, then base the VMA of future
7147 sections on this one. This will work correctly even if `.' is
7148 used in the addresses. */
7149 if (overlay_list == NULL)
7150 overlay_vma = exp_nameop (ADDR, name);
7152 /* Remember the section. */
7153 n = (struct overlay_list *) xmalloc (sizeof *n);
7154 n->os = current_section;
7155 n->next = overlay_list;
7158 size = exp_nameop (SIZEOF, name);
7160 /* Arrange to work out the maximum section end address. */
7161 if (overlay_max == NULL)
7164 overlay_max = exp_binop (MAX_K, overlay_max, size);
7167 /* Finish a section in an overlay. There isn't any special to do
7171 lang_leave_overlay_section (fill_type *fill,
7172 lang_output_section_phdr_list *phdrs)
7179 name = current_section->name;
7181 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
7182 region and that no load-time region has been specified. It doesn't
7183 really matter what we say here, since lang_leave_overlay will
7185 lang_leave_output_section_statement (fill, DEFAULT_MEMORY_REGION, phdrs, 0);
7187 /* Define the magic symbols. */
7189 clean = (char *) xmalloc (strlen (name) + 1);
7191 for (s1 = name; *s1 != '\0'; s1++)
7192 if (ISALNUM (*s1) || *s1 == '_')
7196 buf = (char *) xmalloc (strlen (clean) + sizeof "__load_start_");
7197 sprintf (buf, "__load_start_%s", clean);
7198 lang_add_assignment (exp_provide (buf,
7199 exp_nameop (LOADADDR, name),
7202 buf = (char *) xmalloc (strlen (clean) + sizeof "__load_stop_");
7203 sprintf (buf, "__load_stop_%s", clean);
7204 lang_add_assignment (exp_provide (buf,
7206 exp_nameop (LOADADDR, name),
7207 exp_nameop (SIZEOF, name)),
7213 /* Finish an overlay. If there are any overlay wide settings, this
7214 looks through all the sections in the overlay and sets them. */
7217 lang_leave_overlay (etree_type *lma_expr,
7220 const char *memspec,
7221 lang_output_section_phdr_list *phdrs,
7222 const char *lma_memspec)
7224 lang_memory_region_type *region;
7225 lang_memory_region_type *lma_region;
7226 struct overlay_list *l;
7227 lang_nocrossref_type *nocrossref;
7229 lang_get_regions (®ion, &lma_region,
7230 memspec, lma_memspec,
7231 lma_expr != NULL, FALSE);
7235 /* After setting the size of the last section, set '.' to end of the
7237 if (overlay_list != NULL)
7238 overlay_list->os->update_dot_tree
7239 = exp_assop ('=', ".", exp_binop ('+', overlay_vma, overlay_max));
7244 struct overlay_list *next;
7246 if (fill != NULL && l->os->fill == NULL)
7249 l->os->region = region;
7250 l->os->lma_region = lma_region;
7252 /* The first section has the load address specified in the
7253 OVERLAY statement. The rest are worked out from that.
7254 The base address is not needed (and should be null) if
7255 an LMA region was specified. */
7258 l->os->load_base = lma_expr;
7259 l->os->sectype = normal_section;
7261 if (phdrs != NULL && l->os->phdrs == NULL)
7262 l->os->phdrs = phdrs;
7266 lang_nocrossref_type *nc;
7268 nc = (lang_nocrossref_type *) xmalloc (sizeof *nc);
7269 nc->name = l->os->name;
7270 nc->next = nocrossref;
7279 if (nocrossref != NULL)
7280 lang_add_nocrossref (nocrossref);
7283 overlay_list = NULL;
7287 /* Version handling. This is only useful for ELF. */
7289 /* This global variable holds the version tree that we build. */
7291 struct bfd_elf_version_tree *lang_elf_version_info;
7293 /* If PREV is NULL, return first version pattern matching particular symbol.
7294 If PREV is non-NULL, return first version pattern matching particular
7295 symbol after PREV (previously returned by lang_vers_match). */
7297 static struct bfd_elf_version_expr *
7298 lang_vers_match (struct bfd_elf_version_expr_head *head,
7299 struct bfd_elf_version_expr *prev,
7302 const char *cxx_sym = sym;
7303 const char *java_sym = sym;
7304 struct bfd_elf_version_expr *expr = NULL;
7306 if (head->mask & BFD_ELF_VERSION_CXX_TYPE)
7308 cxx_sym = cplus_demangle (sym, DMGL_PARAMS | DMGL_ANSI);
7312 if (head->mask & BFD_ELF_VERSION_JAVA_TYPE)
7314 java_sym = cplus_demangle (sym, DMGL_JAVA);
7319 if (head->htab && (prev == NULL || prev->literal))
7321 struct bfd_elf_version_expr e;
7323 switch (prev ? prev->mask : 0)
7326 if (head->mask & BFD_ELF_VERSION_C_TYPE)
7329 expr = (struct bfd_elf_version_expr *)
7330 htab_find ((htab_t) head->htab, &e);
7331 while (expr && strcmp (expr->pattern, sym) == 0)
7332 if (expr->mask == BFD_ELF_VERSION_C_TYPE)
7338 case BFD_ELF_VERSION_C_TYPE:
7339 if (head->mask & BFD_ELF_VERSION_CXX_TYPE)
7341 e.pattern = cxx_sym;
7342 expr = (struct bfd_elf_version_expr *)
7343 htab_find ((htab_t) head->htab, &e);
7344 while (expr && strcmp (expr->pattern, cxx_sym) == 0)
7345 if (expr->mask == BFD_ELF_VERSION_CXX_TYPE)
7351 case BFD_ELF_VERSION_CXX_TYPE:
7352 if (head->mask & BFD_ELF_VERSION_JAVA_TYPE)
7354 e.pattern = java_sym;
7355 expr = (struct bfd_elf_version_expr *)
7356 htab_find ((htab_t) head->htab, &e);
7357 while (expr && strcmp (expr->pattern, java_sym) == 0)
7358 if (expr->mask == BFD_ELF_VERSION_JAVA_TYPE)
7369 /* Finally, try the wildcards. */
7370 if (prev == NULL || prev->literal)
7371 expr = head->remaining;
7374 for (; expr; expr = expr->next)
7381 if (expr->pattern[0] == '*' && expr->pattern[1] == '\0')
7384 if (expr->mask == BFD_ELF_VERSION_JAVA_TYPE)
7386 else if (expr->mask == BFD_ELF_VERSION_CXX_TYPE)
7390 if (fnmatch (expr->pattern, s, 0) == 0)
7396 free ((char *) cxx_sym);
7397 if (java_sym != sym)
7398 free ((char *) java_sym);
7402 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
7403 return a pointer to the symbol name with any backslash quotes removed. */
7406 realsymbol (const char *pattern)
7409 bfd_boolean changed = FALSE, backslash = FALSE;
7410 char *s, *symbol = (char *) xmalloc (strlen (pattern) + 1);
7412 for (p = pattern, s = symbol; *p != '\0'; ++p)
7414 /* It is a glob pattern only if there is no preceding
7418 /* Remove the preceding backslash. */
7425 if (*p == '?' || *p == '*' || *p == '[')
7432 backslash = *p == '\\';
7448 /* This is called for each variable name or match expression. NEW_NAME is
7449 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
7450 pattern to be matched against symbol names. */
7452 struct bfd_elf_version_expr *
7453 lang_new_vers_pattern (struct bfd_elf_version_expr *orig,
7454 const char *new_name,
7456 bfd_boolean literal_p)
7458 struct bfd_elf_version_expr *ret;
7460 ret = (struct bfd_elf_version_expr *) xmalloc (sizeof *ret);
7464 ret->literal = TRUE;
7465 ret->pattern = literal_p ? new_name : realsymbol (new_name);
7466 if (ret->pattern == NULL)
7468 ret->pattern = new_name;
7469 ret->literal = FALSE;
7472 if (lang == NULL || strcasecmp (lang, "C") == 0)
7473 ret->mask = BFD_ELF_VERSION_C_TYPE;
7474 else if (strcasecmp (lang, "C++") == 0)
7475 ret->mask = BFD_ELF_VERSION_CXX_TYPE;
7476 else if (strcasecmp (lang, "Java") == 0)
7477 ret->mask = BFD_ELF_VERSION_JAVA_TYPE;
7480 einfo (_("%X%P: unknown language `%s' in version information\n"),
7482 ret->mask = BFD_ELF_VERSION_C_TYPE;
7485 return ldemul_new_vers_pattern (ret);
7488 /* This is called for each set of variable names and match
7491 struct bfd_elf_version_tree *
7492 lang_new_vers_node (struct bfd_elf_version_expr *globals,
7493 struct bfd_elf_version_expr *locals)
7495 struct bfd_elf_version_tree *ret;
7497 ret = (struct bfd_elf_version_tree *) xcalloc (1, sizeof *ret);
7498 ret->globals.list = globals;
7499 ret->locals.list = locals;
7500 ret->match = lang_vers_match;
7501 ret->name_indx = (unsigned int) -1;
7505 /* This static variable keeps track of version indices. */
7507 static int version_index;
7510 version_expr_head_hash (const void *p)
7512 const struct bfd_elf_version_expr *e =
7513 (const struct bfd_elf_version_expr *) p;
7515 return htab_hash_string (e->pattern);
7519 version_expr_head_eq (const void *p1, const void *p2)
7521 const struct bfd_elf_version_expr *e1 =
7522 (const struct bfd_elf_version_expr *) p1;
7523 const struct bfd_elf_version_expr *e2 =
7524 (const struct bfd_elf_version_expr *) p2;
7526 return strcmp (e1->pattern, e2->pattern) == 0;
7530 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head *head)
7533 struct bfd_elf_version_expr *e, *next;
7534 struct bfd_elf_version_expr **list_loc, **remaining_loc;
7536 for (e = head->list; e; e = e->next)
7540 head->mask |= e->mask;
7545 head->htab = htab_create (count * 2, version_expr_head_hash,
7546 version_expr_head_eq, NULL);
7547 list_loc = &head->list;
7548 remaining_loc = &head->remaining;
7549 for (e = head->list; e; e = next)
7555 remaining_loc = &e->next;
7559 void **loc = htab_find_slot ((htab_t) head->htab, e, INSERT);
7563 struct bfd_elf_version_expr *e1, *last;
7565 e1 = (struct bfd_elf_version_expr *) *loc;
7569 if (e1->mask == e->mask)
7577 while (e1 && strcmp (e1->pattern, e->pattern) == 0);
7581 /* This is a duplicate. */
7582 /* FIXME: Memory leak. Sometimes pattern is not
7583 xmalloced alone, but in larger chunk of memory. */
7584 /* free (e->pattern); */
7589 e->next = last->next;
7597 list_loc = &e->next;
7601 *remaining_loc = NULL;
7602 *list_loc = head->remaining;
7605 head->remaining = head->list;
7608 /* This is called when we know the name and dependencies of the
7612 lang_register_vers_node (const char *name,
7613 struct bfd_elf_version_tree *version,
7614 struct bfd_elf_version_deps *deps)
7616 struct bfd_elf_version_tree *t, **pp;
7617 struct bfd_elf_version_expr *e1;
7622 if ((name[0] == '\0' && lang_elf_version_info != NULL)
7623 || (lang_elf_version_info && lang_elf_version_info->name[0] == '\0'))
7625 einfo (_("%X%P: anonymous version tag cannot be combined"
7626 " with other version tags\n"));
7631 /* Make sure this node has a unique name. */
7632 for (t = lang_elf_version_info; t != NULL; t = t->next)
7633 if (strcmp (t->name, name) == 0)
7634 einfo (_("%X%P: duplicate version tag `%s'\n"), name);
7636 lang_finalize_version_expr_head (&version->globals);
7637 lang_finalize_version_expr_head (&version->locals);
7639 /* Check the global and local match names, and make sure there
7640 aren't any duplicates. */
7642 for (e1 = version->globals.list; e1 != NULL; e1 = e1->next)
7644 for (t = lang_elf_version_info; t != NULL; t = t->next)
7646 struct bfd_elf_version_expr *e2;
7648 if (t->locals.htab && e1->literal)
7650 e2 = (struct bfd_elf_version_expr *)
7651 htab_find ((htab_t) t->locals.htab, e1);
7652 while (e2 && strcmp (e1->pattern, e2->pattern) == 0)
7654 if (e1->mask == e2->mask)
7655 einfo (_("%X%P: duplicate expression `%s'"
7656 " in version information\n"), e1->pattern);
7660 else if (!e1->literal)
7661 for (e2 = t->locals.remaining; e2 != NULL; e2 = e2->next)
7662 if (strcmp (e1->pattern, e2->pattern) == 0
7663 && e1->mask == e2->mask)
7664 einfo (_("%X%P: duplicate expression `%s'"
7665 " in version information\n"), e1->pattern);
7669 for (e1 = version->locals.list; e1 != NULL; e1 = e1->next)
7671 for (t = lang_elf_version_info; t != NULL; t = t->next)
7673 struct bfd_elf_version_expr *e2;
7675 if (t->globals.htab && e1->literal)
7677 e2 = (struct bfd_elf_version_expr *)
7678 htab_find ((htab_t) t->globals.htab, e1);
7679 while (e2 && strcmp (e1->pattern, e2->pattern) == 0)
7681 if (e1->mask == e2->mask)
7682 einfo (_("%X%P: duplicate expression `%s'"
7683 " in version information\n"),
7688 else if (!e1->literal)
7689 for (e2 = t->globals.remaining; e2 != NULL; e2 = e2->next)
7690 if (strcmp (e1->pattern, e2->pattern) == 0
7691 && e1->mask == e2->mask)
7692 einfo (_("%X%P: duplicate expression `%s'"
7693 " in version information\n"), e1->pattern);
7697 version->deps = deps;
7698 version->name = name;
7699 if (name[0] != '\0')
7702 version->vernum = version_index;
7705 version->vernum = 0;
7707 for (pp = &lang_elf_version_info; *pp != NULL; pp = &(*pp)->next)
7712 /* This is called when we see a version dependency. */
7714 struct bfd_elf_version_deps *
7715 lang_add_vers_depend (struct bfd_elf_version_deps *list, const char *name)
7717 struct bfd_elf_version_deps *ret;
7718 struct bfd_elf_version_tree *t;
7720 ret = (struct bfd_elf_version_deps *) xmalloc (sizeof *ret);
7723 for (t = lang_elf_version_info; t != NULL; t = t->next)
7725 if (strcmp (t->name, name) == 0)
7727 ret->version_needed = t;
7732 einfo (_("%X%P: unable to find version dependency `%s'\n"), name);
7734 ret->version_needed = NULL;
7739 lang_do_version_exports_section (void)
7741 struct bfd_elf_version_expr *greg = NULL, *lreg;
7743 LANG_FOR_EACH_INPUT_STATEMENT (is)
7745 asection *sec = bfd_get_section_by_name (is->the_bfd, ".exports");
7753 contents = (char *) xmalloc (len);
7754 if (!bfd_get_section_contents (is->the_bfd, sec, contents, 0, len))
7755 einfo (_("%X%P: unable to read .exports section contents\n"), sec);
7758 while (p < contents + len)
7760 greg = lang_new_vers_pattern (greg, p, NULL, FALSE);
7761 p = strchr (p, '\0') + 1;
7764 /* Do not free the contents, as we used them creating the regex. */
7766 /* Do not include this section in the link. */
7767 sec->flags |= SEC_EXCLUDE | SEC_KEEP;
7770 lreg = lang_new_vers_pattern (NULL, "*", NULL, FALSE);
7771 lang_register_vers_node (command_line.version_exports_section,
7772 lang_new_vers_node (greg, lreg), NULL);
7776 lang_add_unique (const char *name)
7778 struct unique_sections *ent;
7780 for (ent = unique_section_list; ent; ent = ent->next)
7781 if (strcmp (ent->name, name) == 0)
7784 ent = (struct unique_sections *) xmalloc (sizeof *ent);
7785 ent->name = xstrdup (name);
7786 ent->next = unique_section_list;
7787 unique_section_list = ent;
7790 /* Append the list of dynamic symbols to the existing one. */
7793 lang_append_dynamic_list (struct bfd_elf_version_expr *dynamic)
7795 if (link_info.dynamic_list)
7797 struct bfd_elf_version_expr *tail;
7798 for (tail = dynamic; tail->next != NULL; tail = tail->next)
7800 tail->next = link_info.dynamic_list->head.list;
7801 link_info.dynamic_list->head.list = dynamic;
7805 struct bfd_elf_dynamic_list *d;
7807 d = (struct bfd_elf_dynamic_list *) xcalloc (1, sizeof *d);
7808 d->head.list = dynamic;
7809 d->match = lang_vers_match;
7810 link_info.dynamic_list = d;
7814 /* Append the list of C++ typeinfo dynamic symbols to the existing
7818 lang_append_dynamic_list_cpp_typeinfo (void)
7820 const char * symbols [] =
7822 "typeinfo name for*",
7825 struct bfd_elf_version_expr *dynamic = NULL;
7828 for (i = 0; i < ARRAY_SIZE (symbols); i++)
7829 dynamic = lang_new_vers_pattern (dynamic, symbols [i], "C++",
7832 lang_append_dynamic_list (dynamic);
7835 /* Append the list of C++ operator new and delete dynamic symbols to the
7839 lang_append_dynamic_list_cpp_new (void)
7841 const char * symbols [] =
7846 struct bfd_elf_version_expr *dynamic = NULL;
7849 for (i = 0; i < ARRAY_SIZE (symbols); i++)
7850 dynamic = lang_new_vers_pattern (dynamic, symbols [i], "C++",
7853 lang_append_dynamic_list (dynamic);