1 /* Linker command language support.
2 Copyright 1991-2013 Free Software Foundation, Inc.
4 This file is part of the GNU Binutils.
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 3 of the License, or
9 (at your option) any later version.
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program; if not, write to the Free Software
18 Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
19 MA 02110-1301, USA. */
23 #include "libiberty.h"
24 #include "filenames.h"
25 #include "safe-ctype.h"
45 #endif /* ENABLE_PLUGINS */
48 #define offsetof(TYPE, MEMBER) ((size_t) & (((TYPE*) 0)->MEMBER))
51 /* Locals variables. */
52 static struct obstack stat_obstack;
53 static struct obstack map_obstack;
55 #define obstack_chunk_alloc xmalloc
56 #define obstack_chunk_free free
57 static const char *entry_symbol_default = "start";
58 static bfd_boolean placed_commons = FALSE;
59 static bfd_boolean stripped_excluded_sections = FALSE;
60 static lang_output_section_statement_type *default_common_section;
61 static bfd_boolean map_option_f;
62 static bfd_vma print_dot;
63 static lang_input_statement_type *first_file;
64 static const char *current_target;
65 static lang_statement_list_type statement_list;
66 static struct bfd_hash_table lang_definedness_table;
67 static lang_statement_list_type *stat_save[10];
68 static lang_statement_list_type **stat_save_ptr = &stat_save[0];
69 static struct unique_sections *unique_section_list;
70 static struct asneeded_minfo *asneeded_list_head;
72 /* Forward declarations. */
73 static void exp_init_os (etree_type *);
74 static lang_input_statement_type *lookup_name (const char *);
75 static struct bfd_hash_entry *lang_definedness_newfunc
76 (struct bfd_hash_entry *, struct bfd_hash_table *, const char *);
77 static void insert_undefined (const char *);
78 static bfd_boolean sort_def_symbol (struct bfd_link_hash_entry *, void *);
79 static void print_statement (lang_statement_union_type *,
80 lang_output_section_statement_type *);
81 static void print_statement_list (lang_statement_union_type *,
82 lang_output_section_statement_type *);
83 static void print_statements (void);
84 static void print_input_section (asection *, bfd_boolean);
85 static bfd_boolean lang_one_common (struct bfd_link_hash_entry *, void *);
86 static void lang_record_phdrs (void);
87 static void lang_do_version_exports_section (void);
88 static void lang_finalize_version_expr_head
89 (struct bfd_elf_version_expr_head *);
91 /* Exported variables. */
92 const char *output_target;
93 lang_output_section_statement_type *abs_output_section;
94 lang_statement_list_type lang_output_section_statement;
95 lang_statement_list_type *stat_ptr = &statement_list;
96 lang_statement_list_type file_chain = { NULL, NULL };
97 lang_statement_list_type input_file_chain;
98 struct bfd_sym_chain entry_symbol = { NULL, NULL };
99 const char *entry_section = ".text";
100 struct lang_input_statement_flags input_flags;
101 bfd_boolean entry_from_cmdline;
102 bfd_boolean undef_from_cmdline;
103 bfd_boolean lang_has_input_file = FALSE;
104 bfd_boolean had_output_filename = FALSE;
105 bfd_boolean lang_float_flag = FALSE;
106 bfd_boolean delete_output_file_on_failure = FALSE;
107 struct lang_phdr *lang_phdr_list;
108 struct lang_nocrossrefs *nocrossref_list;
109 struct asneeded_minfo **asneeded_list_tail;
111 /* Functions that traverse the linker script and might evaluate
112 DEFINED() need to increment this at the start of the traversal. */
113 int lang_statement_iteration = 0;
115 etree_type *base; /* Relocation base - or null */
117 /* Return TRUE if the PATTERN argument is a wildcard pattern.
118 Although backslashes are treated specially if a pattern contains
119 wildcards, we do not consider the mere presence of a backslash to
120 be enough to cause the pattern to be treated as a wildcard.
121 That lets us handle DOS filenames more naturally. */
122 #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL)
124 #define new_stat(x, y) \
125 (x##_type *) new_statement (x##_enum, sizeof (x##_type), y)
127 #define outside_section_address(q) \
128 ((q)->output_offset + (q)->output_section->vma)
130 #define outside_symbol_address(q) \
131 ((q)->value + outside_section_address (q->section))
133 #define SECTION_NAME_MAP_LENGTH (16)
136 stat_alloc (size_t size)
138 return obstack_alloc (&stat_obstack, size);
142 name_match (const char *pattern, const char *name)
144 if (wildcardp (pattern))
145 return fnmatch (pattern, name, 0);
146 return strcmp (pattern, name);
149 /* If PATTERN is of the form archive:file, return a pointer to the
150 separator. If not, return NULL. */
153 archive_path (const char *pattern)
157 if (link_info.path_separator == 0)
160 p = strchr (pattern, link_info.path_separator);
161 #ifdef HAVE_DOS_BASED_FILE_SYSTEM
162 if (p == NULL || link_info.path_separator != ':')
165 /* Assume a match on the second char is part of drive specifier,
166 as in "c:\silly.dos". */
167 if (p == pattern + 1 && ISALPHA (*pattern))
168 p = strchr (p + 1, link_info.path_separator);
173 /* Given that FILE_SPEC results in a non-NULL SEP result from archive_path,
174 return whether F matches FILE_SPEC. */
177 input_statement_is_archive_path (const char *file_spec, char *sep,
178 lang_input_statement_type *f)
180 bfd_boolean match = FALSE;
183 || name_match (sep + 1, f->filename) == 0)
184 && ((sep != file_spec)
185 == (f->the_bfd != NULL && f->the_bfd->my_archive != NULL)))
189 if (sep != file_spec)
191 const char *aname = f->the_bfd->my_archive->filename;
193 match = name_match (file_spec, aname) == 0;
194 *sep = link_info.path_separator;
201 unique_section_p (const asection *sec,
202 const lang_output_section_statement_type *os)
204 struct unique_sections *unam;
207 if (link_info.relocatable
208 && sec->owner != NULL
209 && bfd_is_group_section (sec->owner, sec))
211 && strcmp (os->name, DISCARD_SECTION_NAME) == 0);
214 for (unam = unique_section_list; unam; unam = unam->next)
215 if (name_match (unam->name, secnam) == 0)
221 /* Generic traversal routines for finding matching sections. */
223 /* Try processing a section against a wildcard. This just calls
224 the callback unless the filename exclusion list is present
225 and excludes the file. It's hardly ever present so this
226 function is very fast. */
229 walk_wild_consider_section (lang_wild_statement_type *ptr,
230 lang_input_statement_type *file,
232 struct wildcard_list *sec,
236 struct name_list *list_tmp;
238 /* Don't process sections from files which were excluded. */
239 for (list_tmp = sec->spec.exclude_name_list;
241 list_tmp = list_tmp->next)
243 char *p = archive_path (list_tmp->name);
247 if (input_statement_is_archive_path (list_tmp->name, p, file))
251 else if (name_match (list_tmp->name, file->filename) == 0)
254 /* FIXME: Perhaps remove the following at some stage? Matching
255 unadorned archives like this was never documented and has
256 been superceded by the archive:path syntax. */
257 else if (file->the_bfd != NULL
258 && file->the_bfd->my_archive != NULL
259 && name_match (list_tmp->name,
260 file->the_bfd->my_archive->filename) == 0)
264 (*callback) (ptr, sec, s, ptr->section_flag_list, file, data);
267 /* Lowest common denominator routine that can handle everything correctly,
271 walk_wild_section_general (lang_wild_statement_type *ptr,
272 lang_input_statement_type *file,
277 struct wildcard_list *sec;
279 for (s = file->the_bfd->sections; s != NULL; s = s->next)
281 sec = ptr->section_list;
283 (*callback) (ptr, sec, s, ptr->section_flag_list, file, data);
287 bfd_boolean skip = FALSE;
289 if (sec->spec.name != NULL)
291 const char *sname = bfd_get_section_name (file->the_bfd, s);
293 skip = name_match (sec->spec.name, sname) != 0;
297 walk_wild_consider_section (ptr, file, s, sec, callback, data);
304 /* Routines to find a single section given its name. If there's more
305 than one section with that name, we report that. */
309 asection *found_section;
310 bfd_boolean multiple_sections_found;
311 } section_iterator_callback_data;
314 section_iterator_callback (bfd *abfd ATTRIBUTE_UNUSED, asection *s, void *data)
316 section_iterator_callback_data *d = (section_iterator_callback_data *) data;
318 if (d->found_section != NULL)
320 d->multiple_sections_found = TRUE;
324 d->found_section = s;
329 find_section (lang_input_statement_type *file,
330 struct wildcard_list *sec,
331 bfd_boolean *multiple_sections_found)
333 section_iterator_callback_data cb_data = { NULL, FALSE };
335 bfd_get_section_by_name_if (file->the_bfd, sec->spec.name,
336 section_iterator_callback, &cb_data);
337 *multiple_sections_found = cb_data.multiple_sections_found;
338 return cb_data.found_section;
341 /* Code for handling simple wildcards without going through fnmatch,
342 which can be expensive because of charset translations etc. */
344 /* A simple wild is a literal string followed by a single '*',
345 where the literal part is at least 4 characters long. */
348 is_simple_wild (const char *name)
350 size_t len = strcspn (name, "*?[");
351 return len >= 4 && name[len] == '*' && name[len + 1] == '\0';
355 match_simple_wild (const char *pattern, const char *name)
357 /* The first four characters of the pattern are guaranteed valid
358 non-wildcard characters. So we can go faster. */
359 if (pattern[0] != name[0] || pattern[1] != name[1]
360 || pattern[2] != name[2] || pattern[3] != name[3])
365 while (*pattern != '*')
366 if (*name++ != *pattern++)
372 /* Return the numerical value of the init_priority attribute from
373 section name NAME. */
376 get_init_priority (const char *name)
379 unsigned long init_priority;
381 /* GCC uses the following section names for the init_priority
382 attribute with numerical values 101 and 65535 inclusive. A
383 lower value means a higher priority.
385 1: .init_array.NNNN/.fini_array.NNNN: Where NNNN is the
386 decimal numerical value of the init_priority attribute.
387 The order of execution in .init_array is forward and
388 .fini_array is backward.
389 2: .ctors.NNNN/.dtors.NNNN: Where NNNN is 65535 minus the
390 decimal numerical value of the init_priority attribute.
391 The order of execution in .ctors is backward and .dtors
394 if (strncmp (name, ".init_array.", 12) == 0
395 || strncmp (name, ".fini_array.", 12) == 0)
397 init_priority = strtoul (name + 12, &end, 10);
398 return *end ? 0 : init_priority;
400 else if (strncmp (name, ".ctors.", 7) == 0
401 || strncmp (name, ".dtors.", 7) == 0)
403 init_priority = strtoul (name + 7, &end, 10);
404 return *end ? 0 : 65535 - init_priority;
410 /* Compare sections ASEC and BSEC according to SORT. */
413 compare_section (sort_type sort, asection *asec, asection *bsec)
416 unsigned long ainit_priority, binit_priority;
423 case by_init_priority:
425 = get_init_priority (bfd_get_section_name (asec->owner, asec));
427 = get_init_priority (bfd_get_section_name (bsec->owner, bsec));
428 if (ainit_priority == 0 || binit_priority == 0)
430 ret = ainit_priority - binit_priority;
436 case by_alignment_name:
437 ret = (bfd_section_alignment (bsec->owner, bsec)
438 - bfd_section_alignment (asec->owner, asec));
445 ret = strcmp (bfd_get_section_name (asec->owner, asec),
446 bfd_get_section_name (bsec->owner, bsec));
449 case by_name_alignment:
450 ret = strcmp (bfd_get_section_name (asec->owner, asec),
451 bfd_get_section_name (bsec->owner, bsec));
457 ret = (bfd_section_alignment (bsec->owner, bsec)
458 - bfd_section_alignment (asec->owner, asec));
465 /* Build a Binary Search Tree to sort sections, unlike insertion sort
466 used in wild_sort(). BST is considerably faster if the number of
467 of sections are large. */
469 static lang_section_bst_type **
470 wild_sort_fast (lang_wild_statement_type *wild,
471 struct wildcard_list *sec,
472 lang_input_statement_type *file ATTRIBUTE_UNUSED,
475 lang_section_bst_type **tree;
478 if (!wild->filenames_sorted
479 && (sec == NULL || sec->spec.sorted == none))
481 /* Append at the right end of tree. */
483 tree = &((*tree)->right);
489 /* Find the correct node to append this section. */
490 if (compare_section (sec->spec.sorted, section, (*tree)->section) < 0)
491 tree = &((*tree)->left);
493 tree = &((*tree)->right);
499 /* Use wild_sort_fast to build a BST to sort sections. */
502 output_section_callback_fast (lang_wild_statement_type *ptr,
503 struct wildcard_list *sec,
505 struct flag_info *sflag_list ATTRIBUTE_UNUSED,
506 lang_input_statement_type *file,
509 lang_section_bst_type *node;
510 lang_section_bst_type **tree;
511 lang_output_section_statement_type *os;
513 os = (lang_output_section_statement_type *) output;
515 if (unique_section_p (section, os))
518 node = (lang_section_bst_type *) xmalloc (sizeof (lang_section_bst_type));
521 node->section = section;
523 tree = wild_sort_fast (ptr, sec, file, section);
528 /* Convert a sorted sections' BST back to list form. */
531 output_section_callback_tree_to_list (lang_wild_statement_type *ptr,
532 lang_section_bst_type *tree,
536 output_section_callback_tree_to_list (ptr, tree->left, output);
538 lang_add_section (&ptr->children, tree->section, NULL,
539 (lang_output_section_statement_type *) output);
542 output_section_callback_tree_to_list (ptr, tree->right, output);
547 /* Specialized, optimized routines for handling different kinds of
551 walk_wild_section_specs1_wild0 (lang_wild_statement_type *ptr,
552 lang_input_statement_type *file,
556 /* We can just do a hash lookup for the section with the right name.
557 But if that lookup discovers more than one section with the name
558 (should be rare), we fall back to the general algorithm because
559 we would otherwise have to sort the sections to make sure they
560 get processed in the bfd's order. */
561 bfd_boolean multiple_sections_found;
562 struct wildcard_list *sec0 = ptr->handler_data[0];
563 asection *s0 = find_section (file, sec0, &multiple_sections_found);
565 if (multiple_sections_found)
566 walk_wild_section_general (ptr, file, callback, data);
568 walk_wild_consider_section (ptr, file, s0, sec0, callback, data);
572 walk_wild_section_specs1_wild1 (lang_wild_statement_type *ptr,
573 lang_input_statement_type *file,
578 struct wildcard_list *wildsec0 = ptr->handler_data[0];
580 for (s = file->the_bfd->sections; s != NULL; s = s->next)
582 const char *sname = bfd_get_section_name (file->the_bfd, s);
583 bfd_boolean skip = !match_simple_wild (wildsec0->spec.name, sname);
586 walk_wild_consider_section (ptr, file, s, wildsec0, callback, data);
591 walk_wild_section_specs2_wild1 (lang_wild_statement_type *ptr,
592 lang_input_statement_type *file,
597 struct wildcard_list *sec0 = ptr->handler_data[0];
598 struct wildcard_list *wildsec1 = ptr->handler_data[1];
599 bfd_boolean multiple_sections_found;
600 asection *s0 = find_section (file, sec0, &multiple_sections_found);
602 if (multiple_sections_found)
604 walk_wild_section_general (ptr, file, callback, data);
608 /* Note that if the section was not found, s0 is NULL and
609 we'll simply never succeed the s == s0 test below. */
610 for (s = file->the_bfd->sections; s != NULL; s = s->next)
612 /* Recall that in this code path, a section cannot satisfy more
613 than one spec, so if s == s0 then it cannot match
616 walk_wild_consider_section (ptr, file, s, sec0, callback, data);
619 const char *sname = bfd_get_section_name (file->the_bfd, s);
620 bfd_boolean skip = !match_simple_wild (wildsec1->spec.name, sname);
623 walk_wild_consider_section (ptr, file, s, wildsec1, callback,
630 walk_wild_section_specs3_wild2 (lang_wild_statement_type *ptr,
631 lang_input_statement_type *file,
636 struct wildcard_list *sec0 = ptr->handler_data[0];
637 struct wildcard_list *wildsec1 = ptr->handler_data[1];
638 struct wildcard_list *wildsec2 = ptr->handler_data[2];
639 bfd_boolean multiple_sections_found;
640 asection *s0 = find_section (file, sec0, &multiple_sections_found);
642 if (multiple_sections_found)
644 walk_wild_section_general (ptr, file, callback, data);
648 for (s = file->the_bfd->sections; s != NULL; s = s->next)
651 walk_wild_consider_section (ptr, file, s, sec0, callback, data);
654 const char *sname = bfd_get_section_name (file->the_bfd, s);
655 bfd_boolean skip = !match_simple_wild (wildsec1->spec.name, sname);
658 walk_wild_consider_section (ptr, file, s, wildsec1, callback, data);
661 skip = !match_simple_wild (wildsec2->spec.name, sname);
663 walk_wild_consider_section (ptr, file, s, wildsec2, callback,
671 walk_wild_section_specs4_wild2 (lang_wild_statement_type *ptr,
672 lang_input_statement_type *file,
677 struct wildcard_list *sec0 = ptr->handler_data[0];
678 struct wildcard_list *sec1 = ptr->handler_data[1];
679 struct wildcard_list *wildsec2 = ptr->handler_data[2];
680 struct wildcard_list *wildsec3 = ptr->handler_data[3];
681 bfd_boolean multiple_sections_found;
682 asection *s0 = find_section (file, sec0, &multiple_sections_found), *s1;
684 if (multiple_sections_found)
686 walk_wild_section_general (ptr, file, callback, data);
690 s1 = find_section (file, sec1, &multiple_sections_found);
691 if (multiple_sections_found)
693 walk_wild_section_general (ptr, file, callback, data);
697 for (s = file->the_bfd->sections; s != NULL; s = s->next)
700 walk_wild_consider_section (ptr, file, s, sec0, callback, data);
703 walk_wild_consider_section (ptr, file, s, sec1, callback, data);
706 const char *sname = bfd_get_section_name (file->the_bfd, s);
707 bfd_boolean skip = !match_simple_wild (wildsec2->spec.name,
711 walk_wild_consider_section (ptr, file, s, wildsec2, callback,
715 skip = !match_simple_wild (wildsec3->spec.name, sname);
717 walk_wild_consider_section (ptr, file, s, wildsec3,
725 walk_wild_section (lang_wild_statement_type *ptr,
726 lang_input_statement_type *file,
730 if (file->flags.just_syms)
733 (*ptr->walk_wild_section_handler) (ptr, file, callback, data);
736 /* Returns TRUE when name1 is a wildcard spec that might match
737 something name2 can match. We're conservative: we return FALSE
738 only if the prefixes of name1 and name2 are different up to the
739 first wildcard character. */
742 wild_spec_can_overlap (const char *name1, const char *name2)
744 size_t prefix1_len = strcspn (name1, "?*[");
745 size_t prefix2_len = strcspn (name2, "?*[");
746 size_t min_prefix_len;
748 /* Note that if there is no wildcard character, then we treat the
749 terminating 0 as part of the prefix. Thus ".text" won't match
750 ".text." or ".text.*", for example. */
751 if (name1[prefix1_len] == '\0')
753 if (name2[prefix2_len] == '\0')
756 min_prefix_len = prefix1_len < prefix2_len ? prefix1_len : prefix2_len;
758 return memcmp (name1, name2, min_prefix_len) == 0;
761 /* Select specialized code to handle various kinds of wildcard
765 analyze_walk_wild_section_handler (lang_wild_statement_type *ptr)
768 int wild_name_count = 0;
769 struct wildcard_list *sec;
773 ptr->walk_wild_section_handler = walk_wild_section_general;
774 ptr->handler_data[0] = NULL;
775 ptr->handler_data[1] = NULL;
776 ptr->handler_data[2] = NULL;
777 ptr->handler_data[3] = NULL;
780 /* Count how many wildcard_specs there are, and how many of those
781 actually use wildcards in the name. Also, bail out if any of the
782 wildcard names are NULL. (Can this actually happen?
783 walk_wild_section used to test for it.) And bail out if any
784 of the wildcards are more complex than a simple string
785 ending in a single '*'. */
786 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
789 if (sec->spec.name == NULL)
791 if (wildcardp (sec->spec.name))
794 if (!is_simple_wild (sec->spec.name))
799 /* The zero-spec case would be easy to optimize but it doesn't
800 happen in practice. Likewise, more than 4 specs doesn't
801 happen in practice. */
802 if (sec_count == 0 || sec_count > 4)
805 /* Check that no two specs can match the same section. */
806 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
808 struct wildcard_list *sec2;
809 for (sec2 = sec->next; sec2 != NULL; sec2 = sec2->next)
811 if (wild_spec_can_overlap (sec->spec.name, sec2->spec.name))
816 signature = (sec_count << 8) + wild_name_count;
820 ptr->walk_wild_section_handler = walk_wild_section_specs1_wild0;
823 ptr->walk_wild_section_handler = walk_wild_section_specs1_wild1;
826 ptr->walk_wild_section_handler = walk_wild_section_specs2_wild1;
829 ptr->walk_wild_section_handler = walk_wild_section_specs3_wild2;
832 ptr->walk_wild_section_handler = walk_wild_section_specs4_wild2;
838 /* Now fill the data array with pointers to the specs, first the
839 specs with non-wildcard names, then the specs with wildcard
840 names. It's OK to process the specs in different order from the
841 given order, because we've already determined that no section
842 will match more than one spec. */
844 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
845 if (!wildcardp (sec->spec.name))
846 ptr->handler_data[data_counter++] = sec;
847 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
848 if (wildcardp (sec->spec.name))
849 ptr->handler_data[data_counter++] = sec;
852 /* Handle a wild statement for a single file F. */
855 walk_wild_file (lang_wild_statement_type *s,
856 lang_input_statement_type *f,
860 if (f->the_bfd == NULL
861 || ! bfd_check_format (f->the_bfd, bfd_archive))
862 walk_wild_section (s, f, callback, data);
867 /* This is an archive file. We must map each member of the
868 archive separately. */
869 member = bfd_openr_next_archived_file (f->the_bfd, NULL);
870 while (member != NULL)
872 /* When lookup_name is called, it will call the add_symbols
873 entry point for the archive. For each element of the
874 archive which is included, BFD will call ldlang_add_file,
875 which will set the usrdata field of the member to the
876 lang_input_statement. */
877 if (member->usrdata != NULL)
879 walk_wild_section (s,
880 (lang_input_statement_type *) member->usrdata,
884 member = bfd_openr_next_archived_file (f->the_bfd, member);
890 walk_wild (lang_wild_statement_type *s, callback_t callback, void *data)
892 const char *file_spec = s->filename;
895 if (file_spec == NULL)
897 /* Perform the iteration over all files in the list. */
898 LANG_FOR_EACH_INPUT_STATEMENT (f)
900 walk_wild_file (s, f, callback, data);
903 else if ((p = archive_path (file_spec)) != NULL)
905 LANG_FOR_EACH_INPUT_STATEMENT (f)
907 if (input_statement_is_archive_path (file_spec, p, f))
908 walk_wild_file (s, f, callback, data);
911 else if (wildcardp (file_spec))
913 LANG_FOR_EACH_INPUT_STATEMENT (f)
915 if (fnmatch (file_spec, f->filename, 0) == 0)
916 walk_wild_file (s, f, callback, data);
921 lang_input_statement_type *f;
923 /* Perform the iteration over a single file. */
924 f = lookup_name (file_spec);
926 walk_wild_file (s, f, callback, data);
930 /* lang_for_each_statement walks the parse tree and calls the provided
931 function for each node, except those inside output section statements
932 with constraint set to -1. */
935 lang_for_each_statement_worker (void (*func) (lang_statement_union_type *),
936 lang_statement_union_type *s)
938 for (; s != NULL; s = s->header.next)
942 switch (s->header.type)
944 case lang_constructors_statement_enum:
945 lang_for_each_statement_worker (func, constructor_list.head);
947 case lang_output_section_statement_enum:
948 if (s->output_section_statement.constraint != -1)
949 lang_for_each_statement_worker
950 (func, s->output_section_statement.children.head);
952 case lang_wild_statement_enum:
953 lang_for_each_statement_worker (func,
954 s->wild_statement.children.head);
956 case lang_group_statement_enum:
957 lang_for_each_statement_worker (func,
958 s->group_statement.children.head);
960 case lang_data_statement_enum:
961 case lang_reloc_statement_enum:
962 case lang_object_symbols_statement_enum:
963 case lang_output_statement_enum:
964 case lang_target_statement_enum:
965 case lang_input_section_enum:
966 case lang_input_statement_enum:
967 case lang_assignment_statement_enum:
968 case lang_padding_statement_enum:
969 case lang_address_statement_enum:
970 case lang_fill_statement_enum:
971 case lang_insert_statement_enum:
981 lang_for_each_statement (void (*func) (lang_statement_union_type *))
983 lang_for_each_statement_worker (func, statement_list.head);
986 /*----------------------------------------------------------------------*/
989 lang_list_init (lang_statement_list_type *list)
992 list->tail = &list->head;
996 push_stat_ptr (lang_statement_list_type *new_ptr)
998 if (stat_save_ptr >= stat_save + sizeof (stat_save) / sizeof (stat_save[0]))
1000 *stat_save_ptr++ = stat_ptr;
1007 if (stat_save_ptr <= stat_save)
1009 stat_ptr = *--stat_save_ptr;
1012 /* Build a new statement node for the parse tree. */
1014 static lang_statement_union_type *
1015 new_statement (enum statement_enum type,
1017 lang_statement_list_type *list)
1019 lang_statement_union_type *new_stmt;
1021 new_stmt = (lang_statement_union_type *) stat_alloc (size);
1022 new_stmt->header.type = type;
1023 new_stmt->header.next = NULL;
1024 lang_statement_append (list, new_stmt, &new_stmt->header.next);
1028 /* Build a new input file node for the language. There are several
1029 ways in which we treat an input file, eg, we only look at symbols,
1030 or prefix it with a -l etc.
1032 We can be supplied with requests for input files more than once;
1033 they may, for example be split over several lines like foo.o(.text)
1034 foo.o(.data) etc, so when asked for a file we check that we haven't
1035 got it already so we don't duplicate the bfd. */
1037 static lang_input_statement_type *
1038 new_afile (const char *name,
1039 lang_input_file_enum_type file_type,
1041 bfd_boolean add_to_list)
1043 lang_input_statement_type *p;
1045 lang_has_input_file = TRUE;
1048 p = (lang_input_statement_type *) new_stat (lang_input_statement, stat_ptr);
1051 p = (lang_input_statement_type *)
1052 stat_alloc (sizeof (lang_input_statement_type));
1053 p->header.type = lang_input_statement_enum;
1054 p->header.next = NULL;
1057 memset (&p->the_bfd, 0,
1058 sizeof (*p) - offsetof (lang_input_statement_type, the_bfd));
1060 p->flags.dynamic = input_flags.dynamic;
1061 p->flags.add_DT_NEEDED_for_dynamic = input_flags.add_DT_NEEDED_for_dynamic;
1062 p->flags.add_DT_NEEDED_for_regular = input_flags.add_DT_NEEDED_for_regular;
1063 p->flags.whole_archive = input_flags.whole_archive;
1064 p->flags.sysrooted = input_flags.sysrooted;
1066 if (file_type == lang_input_file_is_l_enum
1067 && name[0] == ':' && name[1] != '\0')
1069 file_type = lang_input_file_is_search_file_enum;
1075 case lang_input_file_is_symbols_only_enum:
1077 p->local_sym_name = name;
1078 p->flags.real = TRUE;
1079 p->flags.just_syms = TRUE;
1081 case lang_input_file_is_fake_enum:
1083 p->local_sym_name = name;
1085 case lang_input_file_is_l_enum:
1087 p->local_sym_name = concat ("-l", name, (const char *) NULL);
1088 p->flags.maybe_archive = TRUE;
1089 p->flags.real = TRUE;
1090 p->flags.search_dirs = TRUE;
1092 case lang_input_file_is_marker_enum:
1094 p->local_sym_name = name;
1095 p->flags.search_dirs = TRUE;
1097 case lang_input_file_is_search_file_enum:
1099 p->local_sym_name = name;
1100 p->flags.real = TRUE;
1101 p->flags.search_dirs = TRUE;
1103 case lang_input_file_is_file_enum:
1105 p->local_sym_name = name;
1106 p->flags.real = TRUE;
1112 lang_statement_append (&input_file_chain,
1113 (lang_statement_union_type *) p,
1114 &p->next_real_file);
1118 lang_input_statement_type *
1119 lang_add_input_file (const char *name,
1120 lang_input_file_enum_type file_type,
1123 return new_afile (name, file_type, target, TRUE);
1126 struct out_section_hash_entry
1128 struct bfd_hash_entry root;
1129 lang_statement_union_type s;
1132 /* The hash table. */
1134 static struct bfd_hash_table output_section_statement_table;
1136 /* Support routines for the hash table used by lang_output_section_find,
1137 initialize the table, fill in an entry and remove the table. */
1139 static struct bfd_hash_entry *
1140 output_section_statement_newfunc (struct bfd_hash_entry *entry,
1141 struct bfd_hash_table *table,
1144 lang_output_section_statement_type **nextp;
1145 struct out_section_hash_entry *ret;
1149 entry = (struct bfd_hash_entry *) bfd_hash_allocate (table,
1155 entry = bfd_hash_newfunc (entry, table, string);
1159 ret = (struct out_section_hash_entry *) entry;
1160 memset (&ret->s, 0, sizeof (ret->s));
1161 ret->s.header.type = lang_output_section_statement_enum;
1162 ret->s.output_section_statement.subsection_alignment = -1;
1163 ret->s.output_section_statement.section_alignment = -1;
1164 ret->s.output_section_statement.block_value = 1;
1165 lang_list_init (&ret->s.output_section_statement.children);
1166 lang_statement_append (stat_ptr, &ret->s, &ret->s.header.next);
1168 /* For every output section statement added to the list, except the
1169 first one, lang_output_section_statement.tail points to the "next"
1170 field of the last element of the list. */
1171 if (lang_output_section_statement.head != NULL)
1172 ret->s.output_section_statement.prev
1173 = ((lang_output_section_statement_type *)
1174 ((char *) lang_output_section_statement.tail
1175 - offsetof (lang_output_section_statement_type, next)));
1177 /* GCC's strict aliasing rules prevent us from just casting the
1178 address, so we store the pointer in a variable and cast that
1180 nextp = &ret->s.output_section_statement.next;
1181 lang_statement_append (&lang_output_section_statement,
1183 (lang_statement_union_type **) nextp);
1188 output_section_statement_table_init (void)
1190 if (!bfd_hash_table_init_n (&output_section_statement_table,
1191 output_section_statement_newfunc,
1192 sizeof (struct out_section_hash_entry),
1194 einfo (_("%P%F: can not create hash table: %E\n"));
1198 output_section_statement_table_free (void)
1200 bfd_hash_table_free (&output_section_statement_table);
1203 /* Build enough state so that the parser can build its tree. */
1208 obstack_begin (&stat_obstack, 1000);
1210 stat_ptr = &statement_list;
1212 output_section_statement_table_init ();
1214 lang_list_init (stat_ptr);
1216 lang_list_init (&input_file_chain);
1217 lang_list_init (&lang_output_section_statement);
1218 lang_list_init (&file_chain);
1219 first_file = lang_add_input_file (NULL, lang_input_file_is_marker_enum,
1221 abs_output_section =
1222 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME, 0, TRUE);
1224 abs_output_section->bfd_section = bfd_abs_section_ptr;
1226 /* The value "13" is ad-hoc, somewhat related to the expected number of
1227 assignments in a linker script. */
1228 if (!bfd_hash_table_init_n (&lang_definedness_table,
1229 lang_definedness_newfunc,
1230 sizeof (struct lang_definedness_hash_entry),
1232 einfo (_("%P%F: can not create hash table: %E\n"));
1234 asneeded_list_head = NULL;
1235 asneeded_list_tail = &asneeded_list_head;
1241 bfd_link_hash_table_free (link_info.output_bfd, link_info.hash);
1242 bfd_hash_table_free (&lang_definedness_table);
1243 output_section_statement_table_free ();
1246 /*----------------------------------------------------------------------
1247 A region is an area of memory declared with the
1248 MEMORY { name:org=exp, len=exp ... }
1251 We maintain a list of all the regions here.
1253 If no regions are specified in the script, then the default is used
1254 which is created when looked up to be the entire data space.
1256 If create is true we are creating a region inside a MEMORY block.
1257 In this case it is probably an error to create a region that has
1258 already been created. If we are not inside a MEMORY block it is
1259 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1260 and so we issue a warning.
1262 Each region has at least one name. The first name is either
1263 DEFAULT_MEMORY_REGION or the name given in the MEMORY block. You can add
1264 alias names to an existing region within a script with
1265 REGION_ALIAS (alias, region_name). Each name corresponds to at most one
1268 static lang_memory_region_type *lang_memory_region_list;
1269 static lang_memory_region_type **lang_memory_region_list_tail
1270 = &lang_memory_region_list;
1272 lang_memory_region_type *
1273 lang_memory_region_lookup (const char *const name, bfd_boolean create)
1275 lang_memory_region_name *n;
1276 lang_memory_region_type *r;
1277 lang_memory_region_type *new_region;
1279 /* NAME is NULL for LMA memspecs if no region was specified. */
1283 for (r = lang_memory_region_list; r != NULL; r = r->next)
1284 for (n = &r->name_list; n != NULL; n = n->next)
1285 if (strcmp (n->name, name) == 0)
1288 einfo (_("%P:%S: warning: redeclaration of memory region `%s'\n"),
1293 if (!create && strcmp (name, DEFAULT_MEMORY_REGION))
1294 einfo (_("%P:%S: warning: memory region `%s' not declared\n"),
1297 new_region = (lang_memory_region_type *)
1298 stat_alloc (sizeof (lang_memory_region_type));
1300 new_region->name_list.name = xstrdup (name);
1301 new_region->name_list.next = NULL;
1302 new_region->next = NULL;
1303 new_region->origin = 0;
1304 new_region->length = ~(bfd_size_type) 0;
1305 new_region->current = 0;
1306 new_region->last_os = NULL;
1307 new_region->flags = 0;
1308 new_region->not_flags = 0;
1309 new_region->had_full_message = FALSE;
1311 *lang_memory_region_list_tail = new_region;
1312 lang_memory_region_list_tail = &new_region->next;
1318 lang_memory_region_alias (const char * alias, const char * region_name)
1320 lang_memory_region_name * n;
1321 lang_memory_region_type * r;
1322 lang_memory_region_type * region;
1324 /* The default region must be unique. This ensures that it is not necessary
1325 to iterate through the name list if someone wants the check if a region is
1326 the default memory region. */
1327 if (strcmp (region_name, DEFAULT_MEMORY_REGION) == 0
1328 || strcmp (alias, DEFAULT_MEMORY_REGION) == 0)
1329 einfo (_("%F%P:%S: error: alias for default memory region\n"), NULL);
1331 /* Look for the target region and check if the alias is not already
1334 for (r = lang_memory_region_list; r != NULL; r = r->next)
1335 for (n = &r->name_list; n != NULL; n = n->next)
1337 if (region == NULL && strcmp (n->name, region_name) == 0)
1339 if (strcmp (n->name, alias) == 0)
1340 einfo (_("%F%P:%S: error: redefinition of memory region "
1345 /* Check if the target region exists. */
1347 einfo (_("%F%P:%S: error: memory region `%s' "
1348 "for alias `%s' does not exist\n"),
1349 NULL, region_name, alias);
1351 /* Add alias to region name list. */
1352 n = (lang_memory_region_name *) stat_alloc (sizeof (lang_memory_region_name));
1353 n->name = xstrdup (alias);
1354 n->next = region->name_list.next;
1355 region->name_list.next = n;
1358 static lang_memory_region_type *
1359 lang_memory_default (asection * section)
1361 lang_memory_region_type *p;
1363 flagword sec_flags = section->flags;
1365 /* Override SEC_DATA to mean a writable section. */
1366 if ((sec_flags & (SEC_ALLOC | SEC_READONLY | SEC_CODE)) == SEC_ALLOC)
1367 sec_flags |= SEC_DATA;
1369 for (p = lang_memory_region_list; p != NULL; p = p->next)
1371 if ((p->flags & sec_flags) != 0
1372 && (p->not_flags & sec_flags) == 0)
1377 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION, FALSE);
1380 /* Get the output section statement directly from the userdata. */
1382 lang_output_section_statement_type *
1383 lang_output_section_get (const asection *output_section)
1385 return get_userdata (output_section);
1388 /* Find or create an output_section_statement with the given NAME.
1389 If CONSTRAINT is non-zero match one with that constraint, otherwise
1390 match any non-negative constraint. If CREATE, always make a
1391 new output_section_statement for SPECIAL CONSTRAINT. */
1393 lang_output_section_statement_type *
1394 lang_output_section_statement_lookup (const char *name,
1398 struct out_section_hash_entry *entry;
1400 entry = ((struct out_section_hash_entry *)
1401 bfd_hash_lookup (&output_section_statement_table, name,
1406 einfo (_("%P%F: failed creating section `%s': %E\n"), name);
1410 if (entry->s.output_section_statement.name != NULL)
1412 /* We have a section of this name, but it might not have the correct
1414 struct out_section_hash_entry *last_ent;
1416 name = entry->s.output_section_statement.name;
1417 if (create && constraint == SPECIAL)
1418 /* Not traversing to the end reverses the order of the second
1419 and subsequent SPECIAL sections in the hash table chain,
1420 but that shouldn't matter. */
1425 if (constraint == entry->s.output_section_statement.constraint
1427 && entry->s.output_section_statement.constraint >= 0))
1428 return &entry->s.output_section_statement;
1430 entry = (struct out_section_hash_entry *) entry->root.next;
1432 while (entry != NULL
1433 && name == entry->s.output_section_statement.name);
1439 = ((struct out_section_hash_entry *)
1440 output_section_statement_newfunc (NULL,
1441 &output_section_statement_table,
1445 einfo (_("%P%F: failed creating section `%s': %E\n"), name);
1448 entry->root = last_ent->root;
1449 last_ent->root.next = &entry->root;
1452 entry->s.output_section_statement.name = name;
1453 entry->s.output_section_statement.constraint = constraint;
1454 return &entry->s.output_section_statement;
1457 /* Find the next output_section_statement with the same name as OS.
1458 If CONSTRAINT is non-zero, find one with that constraint otherwise
1459 match any non-negative constraint. */
1461 lang_output_section_statement_type *
1462 next_matching_output_section_statement (lang_output_section_statement_type *os,
1465 /* All output_section_statements are actually part of a
1466 struct out_section_hash_entry. */
1467 struct out_section_hash_entry *entry = (struct out_section_hash_entry *)
1469 - offsetof (struct out_section_hash_entry, s.output_section_statement));
1470 const char *name = os->name;
1472 ASSERT (name == entry->root.string);
1475 entry = (struct out_section_hash_entry *) entry->root.next;
1477 || name != entry->s.output_section_statement.name)
1480 while (constraint != entry->s.output_section_statement.constraint
1482 || entry->s.output_section_statement.constraint < 0));
1484 return &entry->s.output_section_statement;
1487 /* A variant of lang_output_section_find used by place_orphan.
1488 Returns the output statement that should precede a new output
1489 statement for SEC. If an exact match is found on certain flags,
1492 lang_output_section_statement_type *
1493 lang_output_section_find_by_flags (const asection *sec,
1494 lang_output_section_statement_type **exact,
1495 lang_match_sec_type_func match_type)
1497 lang_output_section_statement_type *first, *look, *found;
1500 /* We know the first statement on this list is *ABS*. May as well
1502 first = &lang_output_section_statement.head->output_section_statement;
1503 first = first->next;
1505 /* First try for an exact match. */
1507 for (look = first; look; look = look->next)
1509 flags = look->flags;
1510 if (look->bfd_section != NULL)
1512 flags = look->bfd_section->flags;
1513 if (match_type && !match_type (link_info.output_bfd,
1518 flags ^= sec->flags;
1519 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD | SEC_READONLY
1520 | SEC_CODE | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1530 if ((sec->flags & SEC_CODE) != 0
1531 && (sec->flags & SEC_ALLOC) != 0)
1533 /* Try for a rw code section. */
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_CODE | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1551 else if ((sec->flags & (SEC_READONLY | SEC_THREAD_LOCAL)) != 0
1552 && (sec->flags & SEC_ALLOC) != 0)
1554 /* .rodata can go after .text, .sdata2 after .rodata. */
1555 for (look = first; look; look = look->next)
1557 flags = look->flags;
1558 if (look->bfd_section != NULL)
1560 flags = look->bfd_section->flags;
1561 if (match_type && !match_type (link_info.output_bfd,
1566 flags ^= sec->flags;
1567 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1568 | SEC_READONLY | SEC_SMALL_DATA))
1569 || (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1571 && !(look->flags & SEC_SMALL_DATA))
1572 || (!(flags & (SEC_THREAD_LOCAL | SEC_ALLOC))
1573 && (look->flags & SEC_THREAD_LOCAL)
1574 && (!(flags & SEC_LOAD)
1575 || (look->flags & SEC_LOAD))))
1579 else if ((sec->flags & SEC_SMALL_DATA) != 0
1580 && (sec->flags & SEC_ALLOC) != 0)
1582 /* .sdata goes after .data, .sbss after .sdata. */
1583 for (look = first; look; look = look->next)
1585 flags = look->flags;
1586 if (look->bfd_section != NULL)
1588 flags = look->bfd_section->flags;
1589 if (match_type && !match_type (link_info.output_bfd,
1594 flags ^= sec->flags;
1595 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1596 | SEC_THREAD_LOCAL))
1597 || ((look->flags & SEC_SMALL_DATA)
1598 && !(sec->flags & SEC_HAS_CONTENTS)))
1602 else if ((sec->flags & SEC_HAS_CONTENTS) != 0
1603 && (sec->flags & SEC_ALLOC) != 0)
1605 /* .data goes after .rodata. */
1606 for (look = first; look; look = look->next)
1608 flags = look->flags;
1609 if (look->bfd_section != NULL)
1611 flags = look->bfd_section->flags;
1612 if (match_type && !match_type (link_info.output_bfd,
1617 flags ^= sec->flags;
1618 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1619 | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1623 else if ((sec->flags & SEC_ALLOC) != 0)
1625 /* .bss goes after any other alloc section. */
1626 for (look = first; look; look = look->next)
1628 flags = look->flags;
1629 if (look->bfd_section != NULL)
1631 flags = look->bfd_section->flags;
1632 if (match_type && !match_type (link_info.output_bfd,
1637 flags ^= sec->flags;
1638 if (!(flags & SEC_ALLOC))
1644 /* non-alloc go last. */
1645 for (look = first; look; look = look->next)
1647 flags = look->flags;
1648 if (look->bfd_section != NULL)
1649 flags = look->bfd_section->flags;
1650 flags ^= sec->flags;
1651 if (!(flags & SEC_DEBUGGING))
1657 if (found || !match_type)
1660 return lang_output_section_find_by_flags (sec, NULL, NULL);
1663 /* Find the last output section before given output statement.
1664 Used by place_orphan. */
1667 output_prev_sec_find (lang_output_section_statement_type *os)
1669 lang_output_section_statement_type *lookup;
1671 for (lookup = os->prev; lookup != NULL; lookup = lookup->prev)
1673 if (lookup->constraint < 0)
1676 if (lookup->bfd_section != NULL && lookup->bfd_section->owner != NULL)
1677 return lookup->bfd_section;
1683 /* Look for a suitable place for a new output section statement. The
1684 idea is to skip over anything that might be inside a SECTIONS {}
1685 statement in a script, before we find another output section
1686 statement. Assignments to "dot" before an output section statement
1687 are assumed to belong to it, except in two cases; The first
1688 assignment to dot, and assignments before non-alloc sections.
1689 Otherwise we might put an orphan before . = . + SIZEOF_HEADERS or
1690 similar assignments that set the initial address, or we might
1691 insert non-alloc note sections among assignments setting end of
1694 static lang_statement_union_type **
1695 insert_os_after (lang_output_section_statement_type *after)
1697 lang_statement_union_type **where;
1698 lang_statement_union_type **assign = NULL;
1699 bfd_boolean ignore_first;
1702 = after == &lang_output_section_statement.head->output_section_statement;
1704 for (where = &after->header.next;
1706 where = &(*where)->header.next)
1708 switch ((*where)->header.type)
1710 case lang_assignment_statement_enum:
1713 lang_assignment_statement_type *ass;
1715 ass = &(*where)->assignment_statement;
1716 if (ass->exp->type.node_class != etree_assert
1717 && ass->exp->assign.dst[0] == '.'
1718 && ass->exp->assign.dst[1] == 0
1722 ignore_first = FALSE;
1724 case lang_wild_statement_enum:
1725 case lang_input_section_enum:
1726 case lang_object_symbols_statement_enum:
1727 case lang_fill_statement_enum:
1728 case lang_data_statement_enum:
1729 case lang_reloc_statement_enum:
1730 case lang_padding_statement_enum:
1731 case lang_constructors_statement_enum:
1734 case lang_output_section_statement_enum:
1737 asection *s = (*where)->output_section_statement.bfd_section;
1740 || s->map_head.s == NULL
1741 || (s->flags & SEC_ALLOC) != 0)
1745 case lang_input_statement_enum:
1746 case lang_address_statement_enum:
1747 case lang_target_statement_enum:
1748 case lang_output_statement_enum:
1749 case lang_group_statement_enum:
1750 case lang_insert_statement_enum:
1759 lang_output_section_statement_type *
1760 lang_insert_orphan (asection *s,
1761 const char *secname,
1763 lang_output_section_statement_type *after,
1764 struct orphan_save *place,
1765 etree_type *address,
1766 lang_statement_list_type *add_child)
1768 lang_statement_list_type add;
1770 lang_output_section_statement_type *os;
1771 lang_output_section_statement_type **os_tail;
1773 /* If we have found an appropriate place for the output section
1774 statements for this orphan, add them to our own private list,
1775 inserting them later into the global statement list. */
1778 lang_list_init (&add);
1779 push_stat_ptr (&add);
1782 if (link_info.relocatable || (s->flags & (SEC_LOAD | SEC_ALLOC)) == 0)
1783 address = exp_intop (0);
1785 os_tail = ((lang_output_section_statement_type **)
1786 lang_output_section_statement.tail);
1787 os = lang_enter_output_section_statement (secname, address, normal_section,
1788 NULL, NULL, NULL, constraint, 0);
1791 if (config.build_constructors && *os_tail == os)
1793 /* If the name of the section is representable in C, then create
1794 symbols to mark the start and the end of the section. */
1795 for (ps = secname; *ps != '\0'; ps++)
1796 if (! ISALNUM ((unsigned char) *ps) && *ps != '_')
1802 symname = (char *) xmalloc (ps - secname + sizeof "__start_" + 1);
1803 symname[0] = bfd_get_symbol_leading_char (link_info.output_bfd);
1804 sprintf (symname + (symname[0] != 0), "__start_%s", secname);
1805 lang_add_assignment (exp_provide (symname,
1806 exp_nameop (NAME, "."),
1811 if (add_child == NULL)
1812 add_child = &os->children;
1813 lang_add_section (add_child, s, NULL, os);
1815 if (after && (s->flags & (SEC_LOAD | SEC_ALLOC)) != 0)
1817 const char *region = (after->region
1818 ? after->region->name_list.name
1819 : DEFAULT_MEMORY_REGION);
1820 const char *lma_region = (after->lma_region
1821 ? after->lma_region->name_list.name
1823 lang_leave_output_section_statement (NULL, region, after->phdrs,
1827 lang_leave_output_section_statement (NULL, DEFAULT_MEMORY_REGION, NULL,
1830 if (ps != NULL && *ps == '\0')
1834 symname = (char *) xmalloc (ps - secname + sizeof "__stop_" + 1);
1835 symname[0] = bfd_get_symbol_leading_char (link_info.output_bfd);
1836 sprintf (symname + (symname[0] != 0), "__stop_%s", secname);
1837 lang_add_assignment (exp_provide (symname,
1838 exp_nameop (NAME, "."),
1842 /* Restore the global list pointer. */
1846 if (after != NULL && os->bfd_section != NULL)
1848 asection *snew, *as;
1850 snew = os->bfd_section;
1852 /* Shuffle the bfd section list to make the output file look
1853 neater. This is really only cosmetic. */
1854 if (place->section == NULL
1855 && after != (&lang_output_section_statement.head
1856 ->output_section_statement))
1858 asection *bfd_section = after->bfd_section;
1860 /* If the output statement hasn't been used to place any input
1861 sections (and thus doesn't have an output bfd_section),
1862 look for the closest prior output statement having an
1864 if (bfd_section == NULL)
1865 bfd_section = output_prev_sec_find (after);
1867 if (bfd_section != NULL && bfd_section != snew)
1868 place->section = &bfd_section->next;
1871 if (place->section == NULL)
1872 place->section = &link_info.output_bfd->sections;
1874 as = *place->section;
1878 /* Put the section at the end of the list. */
1880 /* Unlink the section. */
1881 bfd_section_list_remove (link_info.output_bfd, snew);
1883 /* Now tack it back on in the right place. */
1884 bfd_section_list_append (link_info.output_bfd, snew);
1886 else if (as != snew && as->prev != snew)
1888 /* Unlink the section. */
1889 bfd_section_list_remove (link_info.output_bfd, snew);
1891 /* Now tack it back on in the right place. */
1892 bfd_section_list_insert_before (link_info.output_bfd, as, snew);
1895 /* Save the end of this list. Further ophans of this type will
1896 follow the one we've just added. */
1897 place->section = &snew->next;
1899 /* The following is non-cosmetic. We try to put the output
1900 statements in some sort of reasonable order here, because they
1901 determine the final load addresses of the orphan sections.
1902 In addition, placing output statements in the wrong order may
1903 require extra segments. For instance, given a typical
1904 situation of all read-only sections placed in one segment and
1905 following that a segment containing all the read-write
1906 sections, we wouldn't want to place an orphan read/write
1907 section before or amongst the read-only ones. */
1908 if (add.head != NULL)
1910 lang_output_section_statement_type *newly_added_os;
1912 if (place->stmt == NULL)
1914 lang_statement_union_type **where = insert_os_after (after);
1919 place->os_tail = &after->next;
1923 /* Put it after the last orphan statement we added. */
1924 *add.tail = *place->stmt;
1925 *place->stmt = add.head;
1928 /* Fix the global list pointer if we happened to tack our
1929 new list at the tail. */
1930 if (*stat_ptr->tail == add.head)
1931 stat_ptr->tail = add.tail;
1933 /* Save the end of this list. */
1934 place->stmt = add.tail;
1936 /* Do the same for the list of output section statements. */
1937 newly_added_os = *os_tail;
1939 newly_added_os->prev = (lang_output_section_statement_type *)
1940 ((char *) place->os_tail
1941 - offsetof (lang_output_section_statement_type, next));
1942 newly_added_os->next = *place->os_tail;
1943 if (newly_added_os->next != NULL)
1944 newly_added_os->next->prev = newly_added_os;
1945 *place->os_tail = newly_added_os;
1946 place->os_tail = &newly_added_os->next;
1948 /* Fixing the global list pointer here is a little different.
1949 We added to the list in lang_enter_output_section_statement,
1950 trimmed off the new output_section_statment above when
1951 assigning *os_tail = NULL, but possibly added it back in
1952 the same place when assigning *place->os_tail. */
1953 if (*os_tail == NULL)
1954 lang_output_section_statement.tail
1955 = (lang_statement_union_type **) os_tail;
1962 lang_print_asneeded (void)
1964 struct asneeded_minfo *m;
1967 if (asneeded_list_head == NULL)
1970 sprintf (buf, _("\nAs-needed library included "
1971 "to satisfy reference by file (symbol)\n\n"));
1974 for (m = asneeded_list_head; m != NULL; m = m->next)
1978 minfo ("%s", m->soname);
1979 len = strlen (m->soname);
1993 minfo ("%B ", m->ref);
1994 minfo ("(%T)\n", m->name);
1999 lang_map_flags (flagword flag)
2001 if (flag & SEC_ALLOC)
2004 if (flag & SEC_CODE)
2007 if (flag & SEC_READONLY)
2010 if (flag & SEC_DATA)
2013 if (flag & SEC_LOAD)
2020 lang_memory_region_type *m;
2021 bfd_boolean dis_header_printed = FALSE;
2023 LANG_FOR_EACH_INPUT_STATEMENT (file)
2027 if ((file->the_bfd->flags & (BFD_LINKER_CREATED | DYNAMIC)) != 0
2028 || file->flags.just_syms)
2031 for (s = file->the_bfd->sections; s != NULL; s = s->next)
2032 if ((s->output_section == NULL
2033 || s->output_section->owner != link_info.output_bfd)
2034 && (s->flags & (SEC_LINKER_CREATED | SEC_KEEP)) == 0)
2036 if (! dis_header_printed)
2038 fprintf (config.map_file, _("\nDiscarded input sections\n\n"));
2039 dis_header_printed = TRUE;
2042 print_input_section (s, TRUE);
2046 minfo (_("\nMemory Configuration\n\n"));
2047 fprintf (config.map_file, "%-16s %-18s %-18s %s\n",
2048 _("Name"), _("Origin"), _("Length"), _("Attributes"));
2050 for (m = lang_memory_region_list; m != NULL; m = m->next)
2055 fprintf (config.map_file, "%-16s ", m->name_list.name);
2057 sprintf_vma (buf, m->origin);
2058 minfo ("0x%s ", buf);
2066 minfo ("0x%V", m->length);
2067 if (m->flags || m->not_flags)
2075 lang_map_flags (m->flags);
2081 lang_map_flags (m->not_flags);
2088 fprintf (config.map_file, _("\nLinker script and memory map\n\n"));
2090 if (! link_info.reduce_memory_overheads)
2092 obstack_begin (&map_obstack, 1000);
2093 bfd_link_hash_traverse (link_info.hash, sort_def_symbol, 0);
2095 lang_statement_iteration++;
2096 print_statements ();
2100 sort_def_symbol (struct bfd_link_hash_entry *hash_entry,
2101 void *info ATTRIBUTE_UNUSED)
2103 if ((hash_entry->type == bfd_link_hash_defined
2104 || hash_entry->type == bfd_link_hash_defweak)
2105 && hash_entry->u.def.section->owner != link_info.output_bfd
2106 && hash_entry->u.def.section->owner != NULL)
2108 input_section_userdata_type *ud;
2109 struct map_symbol_def *def;
2111 ud = ((input_section_userdata_type *)
2112 get_userdata (hash_entry->u.def.section));
2115 ud = (input_section_userdata_type *) stat_alloc (sizeof (*ud));
2116 get_userdata (hash_entry->u.def.section) = ud;
2117 ud->map_symbol_def_tail = &ud->map_symbol_def_head;
2118 ud->map_symbol_def_count = 0;
2120 else if (!ud->map_symbol_def_tail)
2121 ud->map_symbol_def_tail = &ud->map_symbol_def_head;
2123 def = (struct map_symbol_def *) obstack_alloc (&map_obstack, sizeof *def);
2124 def->entry = hash_entry;
2125 *(ud->map_symbol_def_tail) = def;
2126 ud->map_symbol_def_tail = &def->next;
2127 ud->map_symbol_def_count++;
2132 /* Initialize an output section. */
2135 init_os (lang_output_section_statement_type *s, flagword flags)
2137 if (strcmp (s->name, DISCARD_SECTION_NAME) == 0)
2138 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME);
2140 if (s->constraint != SPECIAL)
2141 s->bfd_section = bfd_get_section_by_name (link_info.output_bfd, s->name);
2142 if (s->bfd_section == NULL)
2143 s->bfd_section = bfd_make_section_anyway_with_flags (link_info.output_bfd,
2145 if (s->bfd_section == NULL)
2147 einfo (_("%P%F: output format %s cannot represent section called %s\n"),
2148 link_info.output_bfd->xvec->name, s->name);
2150 s->bfd_section->output_section = s->bfd_section;
2151 s->bfd_section->output_offset = 0;
2153 /* Set the userdata of the output section to the output section
2154 statement to avoid lookup. */
2155 get_userdata (s->bfd_section) = s;
2157 /* If there is a base address, make sure that any sections it might
2158 mention are initialized. */
2159 if (s->addr_tree != NULL)
2160 exp_init_os (s->addr_tree);
2162 if (s->load_base != NULL)
2163 exp_init_os (s->load_base);
2165 /* If supplied an alignment, set it. */
2166 if (s->section_alignment != -1)
2167 s->bfd_section->alignment_power = s->section_alignment;
2170 /* Make sure that all output sections mentioned in an expression are
2174 exp_init_os (etree_type *exp)
2176 switch (exp->type.node_class)
2180 exp_init_os (exp->assign.src);
2184 exp_init_os (exp->binary.lhs);
2185 exp_init_os (exp->binary.rhs);
2189 exp_init_os (exp->trinary.cond);
2190 exp_init_os (exp->trinary.lhs);
2191 exp_init_os (exp->trinary.rhs);
2195 exp_init_os (exp->assert_s.child);
2199 exp_init_os (exp->unary.child);
2203 switch (exp->type.node_code)
2209 lang_output_section_statement_type *os;
2211 os = lang_output_section_find (exp->name.name);
2212 if (os != NULL && os->bfd_section == NULL)
2224 section_already_linked (bfd *abfd, asection *sec, void *data)
2226 lang_input_statement_type *entry = (lang_input_statement_type *) data;
2228 /* If we are only reading symbols from this object, then we want to
2229 discard all sections. */
2230 if (entry->flags.just_syms)
2232 bfd_link_just_syms (abfd, sec, &link_info);
2236 if (!(abfd->flags & DYNAMIC))
2237 bfd_section_already_linked (abfd, sec, &link_info);
2240 /* The wild routines.
2242 These expand statements like *(.text) and foo.o to a list of
2243 explicit actions, like foo.o(.text), bar.o(.text) and
2244 foo.o(.text, .data). */
2246 /* Add SECTION to the output section OUTPUT. Do this by creating a
2247 lang_input_section statement which is placed at PTR. */
2250 lang_add_section (lang_statement_list_type *ptr,
2252 struct flag_info *sflag_info,
2253 lang_output_section_statement_type *output)
2255 flagword flags = section->flags;
2257 bfd_boolean discard;
2258 lang_input_section_type *new_section;
2259 bfd *abfd = link_info.output_bfd;
2261 /* Discard sections marked with SEC_EXCLUDE. */
2262 discard = (flags & SEC_EXCLUDE) != 0;
2264 /* Discard input sections which are assigned to a section named
2265 DISCARD_SECTION_NAME. */
2266 if (strcmp (output->name, DISCARD_SECTION_NAME) == 0)
2269 /* Discard debugging sections if we are stripping debugging
2271 if ((link_info.strip == strip_debugger || link_info.strip == strip_all)
2272 && (flags & SEC_DEBUGGING) != 0)
2277 if (section->output_section == NULL)
2279 /* This prevents future calls from assigning this section. */
2280 section->output_section = bfd_abs_section_ptr;
2289 keep = bfd_lookup_section_flags (&link_info, sflag_info, section);
2294 if (section->output_section != NULL)
2297 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2298 to an output section, because we want to be able to include a
2299 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2300 section (I don't know why we want to do this, but we do).
2301 build_link_order in ldwrite.c handles this case by turning
2302 the embedded SEC_NEVER_LOAD section into a fill. */
2303 flags &= ~ SEC_NEVER_LOAD;
2305 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2306 already been processed. One reason to do this is that on pe
2307 format targets, .text$foo sections go into .text and it's odd
2308 to see .text with SEC_LINK_ONCE set. */
2310 if (!link_info.relocatable)
2311 flags &= ~(SEC_LINK_ONCE | SEC_LINK_DUPLICATES | SEC_RELOC);
2313 switch (output->sectype)
2315 case normal_section:
2316 case overlay_section:
2318 case noalloc_section:
2319 flags &= ~SEC_ALLOC;
2321 case noload_section:
2323 flags |= SEC_NEVER_LOAD;
2324 /* Unfortunately GNU ld has managed to evolve two different
2325 meanings to NOLOAD in scripts. ELF gets a .bss style noload,
2326 alloc, no contents section. All others get a noload, noalloc
2328 if (bfd_get_flavour (link_info.output_bfd) == bfd_target_elf_flavour)
2329 flags &= ~SEC_HAS_CONTENTS;
2331 flags &= ~SEC_ALLOC;
2335 if (output->bfd_section == NULL)
2336 init_os (output, flags);
2338 /* If SEC_READONLY is not set in the input section, then clear
2339 it from the output section. */
2340 output->bfd_section->flags &= flags | ~SEC_READONLY;
2342 if (output->bfd_section->linker_has_input)
2344 /* Only set SEC_READONLY flag on the first input section. */
2345 flags &= ~ SEC_READONLY;
2347 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2348 if ((output->bfd_section->flags & (SEC_MERGE | SEC_STRINGS))
2349 != (flags & (SEC_MERGE | SEC_STRINGS))
2350 || ((flags & SEC_MERGE) != 0
2351 && output->bfd_section->entsize != section->entsize))
2353 output->bfd_section->flags &= ~ (SEC_MERGE | SEC_STRINGS);
2354 flags &= ~ (SEC_MERGE | SEC_STRINGS);
2357 output->bfd_section->flags |= flags;
2359 if (!output->bfd_section->linker_has_input)
2361 output->bfd_section->linker_has_input = 1;
2362 /* This must happen after flags have been updated. The output
2363 section may have been created before we saw its first input
2364 section, eg. for a data statement. */
2365 bfd_init_private_section_data (section->owner, section,
2366 link_info.output_bfd,
2367 output->bfd_section,
2369 if ((flags & SEC_MERGE) != 0)
2370 output->bfd_section->entsize = section->entsize;
2373 if ((flags & SEC_TIC54X_BLOCK) != 0
2374 && bfd_get_arch (section->owner) == bfd_arch_tic54x)
2376 /* FIXME: This value should really be obtained from the bfd... */
2377 output->block_value = 128;
2380 if (section->alignment_power > output->bfd_section->alignment_power)
2381 output->bfd_section->alignment_power = section->alignment_power;
2383 section->output_section = output->bfd_section;
2385 if (!link_info.relocatable
2386 && !stripped_excluded_sections)
2388 asection *s = output->bfd_section->map_tail.s;
2389 output->bfd_section->map_tail.s = section;
2390 section->map_head.s = NULL;
2391 section->map_tail.s = s;
2393 s->map_head.s = section;
2395 output->bfd_section->map_head.s = section;
2398 /* Add a section reference to the list. */
2399 new_section = new_stat (lang_input_section, ptr);
2400 new_section->section = section;
2403 /* Handle wildcard sorting. This returns the lang_input_section which
2404 should follow the one we are going to create for SECTION and FILE,
2405 based on the sorting requirements of WILD. It returns NULL if the
2406 new section should just go at the end of the current list. */
2408 static lang_statement_union_type *
2409 wild_sort (lang_wild_statement_type *wild,
2410 struct wildcard_list *sec,
2411 lang_input_statement_type *file,
2414 lang_statement_union_type *l;
2416 if (!wild->filenames_sorted
2417 && (sec == NULL || sec->spec.sorted == none))
2420 for (l = wild->children.head; l != NULL; l = l->header.next)
2422 lang_input_section_type *ls;
2424 if (l->header.type != lang_input_section_enum)
2426 ls = &l->input_section;
2428 /* Sorting by filename takes precedence over sorting by section
2431 if (wild->filenames_sorted)
2433 const char *fn, *ln;
2437 /* The PE support for the .idata section as generated by
2438 dlltool assumes that files will be sorted by the name of
2439 the archive and then the name of the file within the
2442 if (file->the_bfd != NULL
2443 && bfd_my_archive (file->the_bfd) != NULL)
2445 fn = bfd_get_filename (bfd_my_archive (file->the_bfd));
2450 fn = file->filename;
2454 if (bfd_my_archive (ls->section->owner) != NULL)
2456 ln = bfd_get_filename (bfd_my_archive (ls->section->owner));
2461 ln = ls->section->owner->filename;
2465 i = filename_cmp (fn, ln);
2474 fn = file->filename;
2476 ln = ls->section->owner->filename;
2478 i = filename_cmp (fn, ln);
2486 /* Here either the files are not sorted by name, or we are
2487 looking at the sections for this file. */
2490 && sec->spec.sorted != none
2491 && sec->spec.sorted != by_none)
2492 if (compare_section (sec->spec.sorted, section, ls->section) < 0)
2499 /* Expand a wild statement for a particular FILE. SECTION may be
2500 NULL, in which case it is a wild card. */
2503 output_section_callback (lang_wild_statement_type *ptr,
2504 struct wildcard_list *sec,
2506 struct flag_info *sflag_info,
2507 lang_input_statement_type *file,
2510 lang_statement_union_type *before;
2511 lang_output_section_statement_type *os;
2513 os = (lang_output_section_statement_type *) output;
2515 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2516 if (unique_section_p (section, os))
2519 before = wild_sort (ptr, sec, file, section);
2521 /* Here BEFORE points to the lang_input_section which
2522 should follow the one we are about to add. If BEFORE
2523 is NULL, then the section should just go at the end
2524 of the current list. */
2527 lang_add_section (&ptr->children, section, sflag_info, os);
2530 lang_statement_list_type list;
2531 lang_statement_union_type **pp;
2533 lang_list_init (&list);
2534 lang_add_section (&list, section, sflag_info, os);
2536 /* If we are discarding the section, LIST.HEAD will
2538 if (list.head != NULL)
2540 ASSERT (list.head->header.next == NULL);
2542 for (pp = &ptr->children.head;
2544 pp = &(*pp)->header.next)
2545 ASSERT (*pp != NULL);
2547 list.head->header.next = *pp;
2553 /* Check if all sections in a wild statement for a particular FILE
2557 check_section_callback (lang_wild_statement_type *ptr ATTRIBUTE_UNUSED,
2558 struct wildcard_list *sec ATTRIBUTE_UNUSED,
2560 struct flag_info *sflag_info ATTRIBUTE_UNUSED,
2561 lang_input_statement_type *file ATTRIBUTE_UNUSED,
2564 lang_output_section_statement_type *os;
2566 os = (lang_output_section_statement_type *) output;
2568 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2569 if (unique_section_p (section, os))
2572 if (section->output_section == NULL && (section->flags & SEC_READONLY) == 0)
2573 os->all_input_readonly = FALSE;
2576 /* This is passed a file name which must have been seen already and
2577 added to the statement tree. We will see if it has been opened
2578 already and had its symbols read. If not then we'll read it. */
2580 static lang_input_statement_type *
2581 lookup_name (const char *name)
2583 lang_input_statement_type *search;
2585 for (search = (lang_input_statement_type *) input_file_chain.head;
2587 search = (lang_input_statement_type *) search->next_real_file)
2589 /* Use the local_sym_name as the name of the file that has
2590 already been loaded as filename might have been transformed
2591 via the search directory lookup mechanism. */
2592 const char *filename = search->local_sym_name;
2594 if (filename != NULL
2595 && filename_cmp (filename, name) == 0)
2600 search = new_afile (name, lang_input_file_is_search_file_enum,
2601 default_target, FALSE);
2603 /* If we have already added this file, or this file is not real
2604 don't add this file. */
2605 if (search->flags.loaded || !search->flags.real)
2608 if (! load_symbols (search, NULL))
2614 /* Save LIST as a list of libraries whose symbols should not be exported. */
2619 struct excluded_lib *next;
2621 static struct excluded_lib *excluded_libs;
2624 add_excluded_libs (const char *list)
2626 const char *p = list, *end;
2630 struct excluded_lib *entry;
2631 end = strpbrk (p, ",:");
2633 end = p + strlen (p);
2634 entry = (struct excluded_lib *) xmalloc (sizeof (*entry));
2635 entry->next = excluded_libs;
2636 entry->name = (char *) xmalloc (end - p + 1);
2637 memcpy (entry->name, p, end - p);
2638 entry->name[end - p] = '\0';
2639 excluded_libs = entry;
2647 check_excluded_libs (bfd *abfd)
2649 struct excluded_lib *lib = excluded_libs;
2653 int len = strlen (lib->name);
2654 const char *filename = lbasename (abfd->filename);
2656 if (strcmp (lib->name, "ALL") == 0)
2658 abfd->no_export = TRUE;
2662 if (filename_ncmp (lib->name, filename, len) == 0
2663 && (filename[len] == '\0'
2664 || (filename[len] == '.' && filename[len + 1] == 'a'
2665 && filename[len + 2] == '\0')))
2667 abfd->no_export = TRUE;
2675 /* Get the symbols for an input file. */
2678 load_symbols (lang_input_statement_type *entry,
2679 lang_statement_list_type *place)
2683 if (entry->flags.loaded)
2686 ldfile_open_file (entry);
2688 /* Do not process further if the file was missing. */
2689 if (entry->flags.missing_file)
2692 if (! bfd_check_format (entry->the_bfd, bfd_archive)
2693 && ! bfd_check_format_matches (entry->the_bfd, bfd_object, &matching))
2696 struct lang_input_statement_flags save_flags;
2699 err = bfd_get_error ();
2701 /* See if the emulation has some special knowledge. */
2702 if (ldemul_unrecognized_file (entry))
2705 if (err == bfd_error_file_ambiguously_recognized)
2709 einfo (_("%B: file not recognized: %E\n"), entry->the_bfd);
2710 einfo (_("%B: matching formats:"), entry->the_bfd);
2711 for (p = matching; *p != NULL; p++)
2715 else if (err != bfd_error_file_not_recognized
2717 einfo (_("%F%B: file not recognized: %E\n"), entry->the_bfd);
2719 bfd_close (entry->the_bfd);
2720 entry->the_bfd = NULL;
2722 /* Try to interpret the file as a linker script. */
2723 save_flags = input_flags;
2724 ldfile_open_command_file (entry->filename);
2726 push_stat_ptr (place);
2727 input_flags.add_DT_NEEDED_for_regular
2728 = entry->flags.add_DT_NEEDED_for_regular;
2729 input_flags.add_DT_NEEDED_for_dynamic
2730 = entry->flags.add_DT_NEEDED_for_dynamic;
2731 input_flags.whole_archive = entry->flags.whole_archive;
2732 input_flags.dynamic = entry->flags.dynamic;
2734 ldfile_assumed_script = TRUE;
2735 parser_input = input_script;
2737 ldfile_assumed_script = FALSE;
2739 /* missing_file is sticky. sysrooted will already have been
2740 restored when seeing EOF in yyparse, but no harm to restore
2742 save_flags.missing_file |= input_flags.missing_file;
2743 input_flags = save_flags;
2747 entry->flags.loaded = TRUE;
2752 if (ldemul_recognized_file (entry))
2755 /* We don't call ldlang_add_file for an archive. Instead, the
2756 add_symbols entry point will call ldlang_add_file, via the
2757 add_archive_element callback, for each element of the archive
2759 switch (bfd_get_format (entry->the_bfd))
2765 #ifdef ENABLE_PLUGINS
2766 if (!entry->flags.reload)
2768 ldlang_add_file (entry);
2769 if (trace_files || verbose)
2770 info_msg ("%I\n", entry);
2774 check_excluded_libs (entry->the_bfd);
2776 if (entry->flags.whole_archive)
2779 bfd_boolean loaded = TRUE;
2784 member = bfd_openr_next_archived_file (entry->the_bfd, member);
2789 if (! bfd_check_format (member, bfd_object))
2791 einfo (_("%F%B: member %B in archive is not an object\n"),
2792 entry->the_bfd, member);
2797 if (!(*link_info.callbacks
2798 ->add_archive_element) (&link_info, member,
2799 "--whole-archive", &subsbfd))
2802 /* Potentially, the add_archive_element hook may have set a
2803 substitute BFD for us. */
2804 if (!bfd_link_add_symbols (subsbfd, &link_info))
2806 einfo (_("%F%B: error adding symbols: %E\n"), member);
2811 entry->flags.loaded = loaded;
2817 if (bfd_link_add_symbols (entry->the_bfd, &link_info))
2818 entry->flags.loaded = TRUE;
2820 einfo (_("%F%B: error adding symbols: %E\n"), entry->the_bfd);
2822 return entry->flags.loaded;
2825 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2826 may be NULL, indicating that it is a wildcard. Separate
2827 lang_input_section statements are created for each part of the
2828 expansion; they are added after the wild statement S. OUTPUT is
2829 the output section. */
2832 wild (lang_wild_statement_type *s,
2833 const char *target ATTRIBUTE_UNUSED,
2834 lang_output_section_statement_type *output)
2836 struct wildcard_list *sec;
2838 if (s->handler_data[0]
2839 && s->handler_data[0]->spec.sorted == by_name
2840 && !s->filenames_sorted)
2842 lang_section_bst_type *tree;
2844 walk_wild (s, output_section_callback_fast, output);
2849 output_section_callback_tree_to_list (s, tree, output);
2854 walk_wild (s, output_section_callback, output);
2856 if (default_common_section == NULL)
2857 for (sec = s->section_list; sec != NULL; sec = sec->next)
2858 if (sec->spec.name != NULL && strcmp (sec->spec.name, "COMMON") == 0)
2860 /* Remember the section that common is going to in case we
2861 later get something which doesn't know where to put it. */
2862 default_common_section = output;
2867 /* Return TRUE iff target is the sought target. */
2870 get_target (const bfd_target *target, void *data)
2872 const char *sought = (const char *) data;
2874 return strcmp (target->name, sought) == 0;
2877 /* Like strcpy() but convert to lower case as well. */
2880 stricpy (char *dest, char *src)
2884 while ((c = *src++) != 0)
2885 *dest++ = TOLOWER (c);
2890 /* Remove the first occurrence of needle (if any) in haystack
2894 strcut (char *haystack, char *needle)
2896 haystack = strstr (haystack, needle);
2902 for (src = haystack + strlen (needle); *src;)
2903 *haystack++ = *src++;
2909 /* Compare two target format name strings.
2910 Return a value indicating how "similar" they are. */
2913 name_compare (char *first, char *second)
2919 copy1 = (char *) xmalloc (strlen (first) + 1);
2920 copy2 = (char *) xmalloc (strlen (second) + 1);
2922 /* Convert the names to lower case. */
2923 stricpy (copy1, first);
2924 stricpy (copy2, second);
2926 /* Remove size and endian strings from the name. */
2927 strcut (copy1, "big");
2928 strcut (copy1, "little");
2929 strcut (copy2, "big");
2930 strcut (copy2, "little");
2932 /* Return a value based on how many characters match,
2933 starting from the beginning. If both strings are
2934 the same then return 10 * their length. */
2935 for (result = 0; copy1[result] == copy2[result]; result++)
2936 if (copy1[result] == 0)
2948 /* Set by closest_target_match() below. */
2949 static const bfd_target *winner;
2951 /* Scan all the valid bfd targets looking for one that has the endianness
2952 requirement that was specified on the command line, and is the nearest
2953 match to the original output target. */
2956 closest_target_match (const bfd_target *target, void *data)
2958 const bfd_target *original = (const bfd_target *) data;
2960 if (command_line.endian == ENDIAN_BIG
2961 && target->byteorder != BFD_ENDIAN_BIG)
2964 if (command_line.endian == ENDIAN_LITTLE
2965 && target->byteorder != BFD_ENDIAN_LITTLE)
2968 /* Must be the same flavour. */
2969 if (target->flavour != original->flavour)
2972 /* Ignore generic big and little endian elf vectors. */
2973 if (strcmp (target->name, "elf32-big") == 0
2974 || strcmp (target->name, "elf64-big") == 0
2975 || strcmp (target->name, "elf32-little") == 0
2976 || strcmp (target->name, "elf64-little") == 0)
2979 /* If we have not found a potential winner yet, then record this one. */
2986 /* Oh dear, we now have two potential candidates for a successful match.
2987 Compare their names and choose the better one. */
2988 if (name_compare (target->name, original->name)
2989 > name_compare (winner->name, original->name))
2992 /* Keep on searching until wqe have checked them all. */
2996 /* Return the BFD target format of the first input file. */
2999 get_first_input_target (void)
3001 char *target = NULL;
3003 LANG_FOR_EACH_INPUT_STATEMENT (s)
3005 if (s->header.type == lang_input_statement_enum
3008 ldfile_open_file (s);
3010 if (s->the_bfd != NULL
3011 && bfd_check_format (s->the_bfd, bfd_object))
3013 target = bfd_get_target (s->the_bfd);
3025 lang_get_output_target (void)
3029 /* Has the user told us which output format to use? */
3030 if (output_target != NULL)
3031 return output_target;
3033 /* No - has the current target been set to something other than
3035 if (current_target != default_target && current_target != NULL)
3036 return current_target;
3038 /* No - can we determine the format of the first input file? */
3039 target = get_first_input_target ();
3043 /* Failed - use the default output target. */
3044 return default_target;
3047 /* Open the output file. */
3050 open_output (const char *name)
3052 output_target = lang_get_output_target ();
3054 /* Has the user requested a particular endianness on the command
3056 if (command_line.endian != ENDIAN_UNSET)
3058 const bfd_target *target;
3059 enum bfd_endian desired_endian;
3061 /* Get the chosen target. */
3062 target = bfd_search_for_target (get_target, (void *) output_target);
3064 /* If the target is not supported, we cannot do anything. */
3067 if (command_line.endian == ENDIAN_BIG)
3068 desired_endian = BFD_ENDIAN_BIG;
3070 desired_endian = BFD_ENDIAN_LITTLE;
3072 /* See if the target has the wrong endianness. This should
3073 not happen if the linker script has provided big and
3074 little endian alternatives, but some scrips don't do
3076 if (target->byteorder != desired_endian)
3078 /* If it does, then see if the target provides
3079 an alternative with the correct endianness. */
3080 if (target->alternative_target != NULL
3081 && (target->alternative_target->byteorder == desired_endian))
3082 output_target = target->alternative_target->name;
3085 /* Try to find a target as similar as possible to
3086 the default target, but which has the desired
3087 endian characteristic. */
3088 bfd_search_for_target (closest_target_match,
3091 /* Oh dear - we could not find any targets that
3092 satisfy our requirements. */
3094 einfo (_("%P: warning: could not find any targets"
3095 " that match endianness requirement\n"));
3097 output_target = winner->name;
3103 link_info.output_bfd = bfd_openw (name, output_target);
3105 if (link_info.output_bfd == NULL)
3107 if (bfd_get_error () == bfd_error_invalid_target)
3108 einfo (_("%P%F: target %s not found\n"), output_target);
3110 einfo (_("%P%F: cannot open output file %s: %E\n"), name);
3113 delete_output_file_on_failure = TRUE;
3115 if (! bfd_set_format (link_info.output_bfd, bfd_object))
3116 einfo (_("%P%F:%s: can not make object file: %E\n"), name);
3117 if (! bfd_set_arch_mach (link_info.output_bfd,
3118 ldfile_output_architecture,
3119 ldfile_output_machine))
3120 einfo (_("%P%F:%s: can not set architecture: %E\n"), name);
3122 link_info.hash = bfd_link_hash_table_create (link_info.output_bfd);
3123 if (link_info.hash == NULL)
3124 einfo (_("%P%F: can not create hash table: %E\n"));
3126 bfd_set_gp_size (link_info.output_bfd, g_switch_value);
3130 ldlang_open_output (lang_statement_union_type *statement)
3132 switch (statement->header.type)
3134 case lang_output_statement_enum:
3135 ASSERT (link_info.output_bfd == NULL);
3136 open_output (statement->output_statement.name);
3137 ldemul_set_output_arch ();
3138 if (config.magic_demand_paged && !link_info.relocatable)
3139 link_info.output_bfd->flags |= D_PAGED;
3141 link_info.output_bfd->flags &= ~D_PAGED;
3142 if (config.text_read_only)
3143 link_info.output_bfd->flags |= WP_TEXT;
3145 link_info.output_bfd->flags &= ~WP_TEXT;
3146 if (link_info.traditional_format)
3147 link_info.output_bfd->flags |= BFD_TRADITIONAL_FORMAT;
3149 link_info.output_bfd->flags &= ~BFD_TRADITIONAL_FORMAT;
3152 case lang_target_statement_enum:
3153 current_target = statement->target_statement.target;
3160 /* Convert between addresses in bytes and sizes in octets.
3161 For currently supported targets, octets_per_byte is always a power
3162 of two, so we can use shifts. */
3163 #define TO_ADDR(X) ((X) >> opb_shift)
3164 #define TO_SIZE(X) ((X) << opb_shift)
3166 /* Support the above. */
3167 static unsigned int opb_shift = 0;
3172 unsigned x = bfd_arch_mach_octets_per_byte (ldfile_output_architecture,
3173 ldfile_output_machine);
3176 while ((x & 1) == 0)
3184 /* Open all the input files. */
3188 OPEN_BFD_NORMAL = 0,
3192 #ifdef ENABLE_PLUGINS
3193 static lang_input_statement_type *plugin_insert = NULL;
3197 open_input_bfds (lang_statement_union_type *s, enum open_bfd_mode mode)
3199 for (; s != NULL; s = s->header.next)
3201 switch (s->header.type)
3203 case lang_constructors_statement_enum:
3204 open_input_bfds (constructor_list.head, mode);
3206 case lang_output_section_statement_enum:
3207 open_input_bfds (s->output_section_statement.children.head, mode);
3209 case lang_wild_statement_enum:
3210 /* Maybe we should load the file's symbols. */
3211 if ((mode & OPEN_BFD_RESCAN) == 0
3212 && s->wild_statement.filename
3213 && !wildcardp (s->wild_statement.filename)
3214 && !archive_path (s->wild_statement.filename))
3215 lookup_name (s->wild_statement.filename);
3216 open_input_bfds (s->wild_statement.children.head, mode);
3218 case lang_group_statement_enum:
3220 struct bfd_link_hash_entry *undefs;
3222 /* We must continually search the entries in the group
3223 until no new symbols are added to the list of undefined
3228 undefs = link_info.hash->undefs_tail;
3229 open_input_bfds (s->group_statement.children.head,
3230 mode | OPEN_BFD_FORCE);
3232 while (undefs != link_info.hash->undefs_tail);
3235 case lang_target_statement_enum:
3236 current_target = s->target_statement.target;
3238 case lang_input_statement_enum:
3239 if (s->input_statement.flags.real)
3241 lang_statement_union_type **os_tail;
3242 lang_statement_list_type add;
3244 s->input_statement.target = current_target;
3246 /* If we are being called from within a group, and this
3247 is an archive which has already been searched, then
3248 force it to be researched unless the whole archive
3249 has been loaded already. Do the same for a rescan. */
3250 if (mode != OPEN_BFD_NORMAL
3251 #ifdef ENABLE_PLUGINS
3252 && ((mode & OPEN_BFD_RESCAN) == 0
3253 || plugin_insert == NULL)
3255 && !s->input_statement.flags.whole_archive
3256 && s->input_statement.flags.loaded
3257 && s->input_statement.the_bfd != NULL
3258 && bfd_check_format (s->input_statement.the_bfd,
3260 s->input_statement.flags.loaded = FALSE;
3261 #ifdef ENABLE_PLUGINS
3262 /* When rescanning, reload --as-needed shared libs. */
3263 else if ((mode & OPEN_BFD_RESCAN) != 0
3264 && plugin_insert == NULL
3265 && s->input_statement.flags.loaded
3266 && s->input_statement.flags.add_DT_NEEDED_for_regular
3267 && s->input_statement.the_bfd != NULL
3268 && ((s->input_statement.the_bfd->flags) & DYNAMIC) != 0
3269 && plugin_should_reload (s->input_statement.the_bfd))
3271 s->input_statement.flags.loaded = FALSE;
3272 s->input_statement.flags.reload = TRUE;
3276 os_tail = lang_output_section_statement.tail;
3277 lang_list_init (&add);
3279 if (! load_symbols (&s->input_statement, &add))
3280 config.make_executable = FALSE;
3282 if (add.head != NULL)
3284 /* If this was a script with output sections then
3285 tack any added statements on to the end of the
3286 list. This avoids having to reorder the output
3287 section statement list. Very likely the user
3288 forgot -T, and whatever we do here will not meet
3289 naive user expectations. */
3290 if (os_tail != lang_output_section_statement.tail)
3292 einfo (_("%P: warning: %s contains output sections;"
3293 " did you forget -T?\n"),
3294 s->input_statement.filename);
3295 *stat_ptr->tail = add.head;
3296 stat_ptr->tail = add.tail;
3300 *add.tail = s->header.next;
3301 s->header.next = add.head;
3305 #ifdef ENABLE_PLUGINS
3306 /* If we have found the point at which a plugin added new
3307 files, clear plugin_insert to enable archive rescan. */
3308 if (&s->input_statement == plugin_insert)
3309 plugin_insert = NULL;
3312 case lang_assignment_statement_enum:
3313 if (s->assignment_statement.exp->assign.defsym)
3314 /* This is from a --defsym on the command line. */
3315 exp_fold_tree_no_dot (s->assignment_statement.exp);
3322 /* Exit if any of the files were missing. */
3323 if (input_flags.missing_file)
3327 /* New-function for the definedness hash table. */
3329 static struct bfd_hash_entry *
3330 lang_definedness_newfunc (struct bfd_hash_entry *entry,
3331 struct bfd_hash_table *table ATTRIBUTE_UNUSED,
3332 const char *name ATTRIBUTE_UNUSED)
3334 struct lang_definedness_hash_entry *ret
3335 = (struct lang_definedness_hash_entry *) entry;
3338 ret = (struct lang_definedness_hash_entry *)
3339 bfd_hash_allocate (table, sizeof (struct lang_definedness_hash_entry));
3342 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name);
3350 /* Called during processing of linker script script expressions.
3351 For symbols assigned in a linker script, return a struct describing
3352 where the symbol is defined relative to the current expression,
3353 otherwise return NULL. */
3355 struct lang_definedness_hash_entry *
3356 lang_symbol_defined (const char *name)
3358 return ((struct lang_definedness_hash_entry *)
3359 bfd_hash_lookup (&lang_definedness_table, name, FALSE, FALSE));
3362 /* Update the definedness state of NAME. */
3365 lang_update_definedness (const char *name, struct bfd_link_hash_entry *h)
3367 struct lang_definedness_hash_entry *defentry
3368 = (struct lang_definedness_hash_entry *)
3369 bfd_hash_lookup (&lang_definedness_table, name, TRUE, FALSE);
3371 if (defentry == NULL)
3372 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name);
3374 /* If the symbol was already defined, and not by a script, then it
3375 must be defined by an object file. */
3376 if (!defentry->by_script
3377 && h->type != bfd_link_hash_undefined
3378 && h->type != bfd_link_hash_common
3379 && h->type != bfd_link_hash_new)
3380 defentry->by_object = 1;
3382 defentry->by_script = 1;
3383 defentry->iteration = lang_statement_iteration;
3386 /* Add the supplied name to the symbol table as an undefined reference.
3387 This is a two step process as the symbol table doesn't even exist at
3388 the time the ld command line is processed. First we put the name
3389 on a list, then, once the output file has been opened, transfer the
3390 name to the symbol table. */
3392 typedef struct bfd_sym_chain ldlang_undef_chain_list_type;
3394 #define ldlang_undef_chain_list_head entry_symbol.next
3397 ldlang_add_undef (const char *const name, bfd_boolean cmdline)
3399 ldlang_undef_chain_list_type *new_undef;
3401 undef_from_cmdline = undef_from_cmdline || cmdline;
3402 new_undef = (ldlang_undef_chain_list_type *) stat_alloc (sizeof (*new_undef));
3403 new_undef->next = ldlang_undef_chain_list_head;
3404 ldlang_undef_chain_list_head = new_undef;
3406 new_undef->name = xstrdup (name);
3408 if (link_info.output_bfd != NULL)
3409 insert_undefined (new_undef->name);
3412 /* Insert NAME as undefined in the symbol table. */
3415 insert_undefined (const char *name)
3417 struct bfd_link_hash_entry *h;
3419 h = bfd_link_hash_lookup (link_info.hash, name, TRUE, FALSE, TRUE);
3421 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
3422 if (h->type == bfd_link_hash_new)
3424 h->type = bfd_link_hash_undefined;
3425 h->u.undef.abfd = NULL;
3426 bfd_link_add_undef (link_info.hash, h);
3430 /* Run through the list of undefineds created above and place them
3431 into the linker hash table as undefined symbols belonging to the
3435 lang_place_undefineds (void)
3437 ldlang_undef_chain_list_type *ptr;
3439 for (ptr = ldlang_undef_chain_list_head; ptr != NULL; ptr = ptr->next)
3440 insert_undefined (ptr->name);
3443 /* Check for all readonly or some readwrite sections. */
3446 check_input_sections
3447 (lang_statement_union_type *s,
3448 lang_output_section_statement_type *output_section_statement)
3450 for (; s != (lang_statement_union_type *) NULL; s = s->header.next)
3452 switch (s->header.type)
3454 case lang_wild_statement_enum:
3455 walk_wild (&s->wild_statement, check_section_callback,
3456 output_section_statement);
3457 if (! output_section_statement->all_input_readonly)
3460 case lang_constructors_statement_enum:
3461 check_input_sections (constructor_list.head,
3462 output_section_statement);
3463 if (! output_section_statement->all_input_readonly)
3466 case lang_group_statement_enum:
3467 check_input_sections (s->group_statement.children.head,
3468 output_section_statement);
3469 if (! output_section_statement->all_input_readonly)
3478 /* Update wildcard statements if needed. */
3481 update_wild_statements (lang_statement_union_type *s)
3483 struct wildcard_list *sec;
3485 switch (sort_section)
3495 for (; s != NULL; s = s->header.next)
3497 switch (s->header.type)
3502 case lang_wild_statement_enum:
3503 for (sec = s->wild_statement.section_list; sec != NULL;
3506 switch (sec->spec.sorted)
3509 sec->spec.sorted = sort_section;
3512 if (sort_section == by_alignment)
3513 sec->spec.sorted = by_name_alignment;
3516 if (sort_section == by_name)
3517 sec->spec.sorted = by_alignment_name;
3525 case lang_constructors_statement_enum:
3526 update_wild_statements (constructor_list.head);
3529 case lang_output_section_statement_enum:
3530 /* Don't sort .init/.fini sections. */
3531 if (strcmp (s->output_section_statement.name, ".init") != 0
3532 && strcmp (s->output_section_statement.name, ".fini") != 0)
3533 update_wild_statements
3534 (s->output_section_statement.children.head);
3537 case lang_group_statement_enum:
3538 update_wild_statements (s->group_statement.children.head);
3546 /* Open input files and attach to output sections. */
3549 map_input_to_output_sections
3550 (lang_statement_union_type *s, const char *target,
3551 lang_output_section_statement_type *os)
3553 for (; s != NULL; s = s->header.next)
3555 lang_output_section_statement_type *tos;
3558 switch (s->header.type)
3560 case lang_wild_statement_enum:
3561 wild (&s->wild_statement, target, os);
3563 case lang_constructors_statement_enum:
3564 map_input_to_output_sections (constructor_list.head,
3568 case lang_output_section_statement_enum:
3569 tos = &s->output_section_statement;
3570 if (tos->constraint != 0)
3572 if (tos->constraint != ONLY_IF_RW
3573 && tos->constraint != ONLY_IF_RO)
3575 tos->all_input_readonly = TRUE;
3576 check_input_sections (tos->children.head, tos);
3577 if (tos->all_input_readonly != (tos->constraint == ONLY_IF_RO))
3579 tos->constraint = -1;
3583 map_input_to_output_sections (tos->children.head,
3587 case lang_output_statement_enum:
3589 case lang_target_statement_enum:
3590 target = s->target_statement.target;
3592 case lang_group_statement_enum:
3593 map_input_to_output_sections (s->group_statement.children.head,
3597 case lang_data_statement_enum:
3598 /* Make sure that any sections mentioned in the expression
3600 exp_init_os (s->data_statement.exp);
3601 /* The output section gets CONTENTS, ALLOC and LOAD, but
3602 these may be overridden by the script. */
3603 flags = SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD;
3604 switch (os->sectype)
3606 case normal_section:
3607 case overlay_section:
3609 case noalloc_section:
3610 flags = SEC_HAS_CONTENTS;
3612 case noload_section:
3613 if (bfd_get_flavour (link_info.output_bfd)
3614 == bfd_target_elf_flavour)
3615 flags = SEC_NEVER_LOAD | SEC_ALLOC;
3617 flags = SEC_NEVER_LOAD | SEC_HAS_CONTENTS;
3620 if (os->bfd_section == NULL)
3621 init_os (os, flags);
3623 os->bfd_section->flags |= flags;
3625 case lang_input_section_enum:
3627 case lang_fill_statement_enum:
3628 case lang_object_symbols_statement_enum:
3629 case lang_reloc_statement_enum:
3630 case lang_padding_statement_enum:
3631 case lang_input_statement_enum:
3632 if (os != NULL && os->bfd_section == NULL)
3635 case lang_assignment_statement_enum:
3636 if (os != NULL && os->bfd_section == NULL)
3639 /* Make sure that any sections mentioned in the assignment
3641 exp_init_os (s->assignment_statement.exp);
3643 case lang_address_statement_enum:
3644 /* Mark the specified section with the supplied address.
3645 If this section was actually a segment marker, then the
3646 directive is ignored if the linker script explicitly
3647 processed the segment marker. Originally, the linker
3648 treated segment directives (like -Ttext on the
3649 command-line) as section directives. We honor the
3650 section directive semantics for backwards compatibilty;
3651 linker scripts that do not specifically check for
3652 SEGMENT_START automatically get the old semantics. */
3653 if (!s->address_statement.segment
3654 || !s->address_statement.segment->used)
3656 const char *name = s->address_statement.section_name;
3658 /* Create the output section statement here so that
3659 orphans with a set address will be placed after other
3660 script sections. If we let the orphan placement code
3661 place them in amongst other sections then the address
3662 will affect following script sections, which is
3663 likely to surprise naive users. */
3664 tos = lang_output_section_statement_lookup (name, 0, TRUE);
3665 tos->addr_tree = s->address_statement.address;
3666 if (tos->bfd_section == NULL)
3670 case lang_insert_statement_enum:
3676 /* An insert statement snips out all the linker statements from the
3677 start of the list and places them after the output section
3678 statement specified by the insert. This operation is complicated
3679 by the fact that we keep a doubly linked list of output section
3680 statements as well as the singly linked list of all statements. */
3683 process_insert_statements (void)
3685 lang_statement_union_type **s;
3686 lang_output_section_statement_type *first_os = NULL;
3687 lang_output_section_statement_type *last_os = NULL;
3688 lang_output_section_statement_type *os;
3690 /* "start of list" is actually the statement immediately after
3691 the special abs_section output statement, so that it isn't
3693 s = &lang_output_section_statement.head;
3694 while (*(s = &(*s)->header.next) != NULL)
3696 if ((*s)->header.type == lang_output_section_statement_enum)
3698 /* Keep pointers to the first and last output section
3699 statement in the sequence we may be about to move. */
3700 os = &(*s)->output_section_statement;
3702 ASSERT (last_os == NULL || last_os->next == os);
3705 /* Set constraint negative so that lang_output_section_find
3706 won't match this output section statement. At this
3707 stage in linking constraint has values in the range
3708 [-1, ONLY_IN_RW]. */
3709 last_os->constraint = -2 - last_os->constraint;
3710 if (first_os == NULL)
3713 else if ((*s)->header.type == lang_insert_statement_enum)
3715 lang_insert_statement_type *i = &(*s)->insert_statement;
3716 lang_output_section_statement_type *where;
3717 lang_statement_union_type **ptr;
3718 lang_statement_union_type *first;
3720 where = lang_output_section_find (i->where);
3721 if (where != NULL && i->is_before)
3724 where = where->prev;
3725 while (where != NULL && where->constraint < 0);
3729 einfo (_("%F%P: %s not found for insert\n"), i->where);
3733 /* Deal with reordering the output section statement list. */
3734 if (last_os != NULL)
3736 asection *first_sec, *last_sec;
3737 struct lang_output_section_statement_struct **next;
3739 /* Snip out the output sections we are moving. */
3740 first_os->prev->next = last_os->next;
3741 if (last_os->next == NULL)
3743 next = &first_os->prev->next;
3744 lang_output_section_statement.tail
3745 = (lang_statement_union_type **) next;
3748 last_os->next->prev = first_os->prev;
3749 /* Add them in at the new position. */
3750 last_os->next = where->next;
3751 if (where->next == NULL)
3753 next = &last_os->next;
3754 lang_output_section_statement.tail
3755 = (lang_statement_union_type **) next;
3758 where->next->prev = last_os;
3759 first_os->prev = where;
3760 where->next = first_os;
3762 /* Move the bfd sections in the same way. */
3765 for (os = first_os; os != NULL; os = os->next)
3767 os->constraint = -2 - os->constraint;
3768 if (os->bfd_section != NULL
3769 && os->bfd_section->owner != NULL)
3771 last_sec = os->bfd_section;
3772 if (first_sec == NULL)
3773 first_sec = last_sec;
3778 if (last_sec != NULL)
3780 asection *sec = where->bfd_section;
3782 sec = output_prev_sec_find (where);
3784 /* The place we want to insert must come after the
3785 sections we are moving. So if we find no
3786 section or if the section is the same as our
3787 last section, then no move is needed. */
3788 if (sec != NULL && sec != last_sec)
3790 /* Trim them off. */
3791 if (first_sec->prev != NULL)
3792 first_sec->prev->next = last_sec->next;
3794 link_info.output_bfd->sections = last_sec->next;
3795 if (last_sec->next != NULL)
3796 last_sec->next->prev = first_sec->prev;
3798 link_info.output_bfd->section_last = first_sec->prev;
3800 last_sec->next = sec->next;
3801 if (sec->next != NULL)
3802 sec->next->prev = last_sec;
3804 link_info.output_bfd->section_last = last_sec;
3805 first_sec->prev = sec;
3806 sec->next = first_sec;
3814 ptr = insert_os_after (where);
3815 /* Snip everything after the abs_section output statement we
3816 know is at the start of the list, up to and including
3817 the insert statement we are currently processing. */
3818 first = lang_output_section_statement.head->header.next;
3819 lang_output_section_statement.head->header.next = (*s)->header.next;
3820 /* Add them back where they belong. */
3823 statement_list.tail = s;
3825 s = &lang_output_section_statement.head;
3829 /* Undo constraint twiddling. */
3830 for (os = first_os; os != NULL; os = os->next)
3832 os->constraint = -2 - os->constraint;
3838 /* An output section might have been removed after its statement was
3839 added. For example, ldemul_before_allocation can remove dynamic
3840 sections if they turn out to be not needed. Clean them up here. */
3843 strip_excluded_output_sections (void)
3845 lang_output_section_statement_type *os;
3847 /* Run lang_size_sections (if not already done). */
3848 if (expld.phase != lang_mark_phase_enum)
3850 expld.phase = lang_mark_phase_enum;
3851 expld.dataseg.phase = exp_dataseg_none;
3852 one_lang_size_sections_pass (NULL, FALSE);
3853 lang_reset_memory_regions ();
3856 for (os = &lang_output_section_statement.head->output_section_statement;
3860 asection *output_section;
3861 bfd_boolean exclude;
3863 if (os->constraint < 0)
3866 output_section = os->bfd_section;
3867 if (output_section == NULL)
3870 exclude = (output_section->rawsize == 0
3871 && (output_section->flags & SEC_KEEP) == 0
3872 && !bfd_section_removed_from_list (link_info.output_bfd,
3875 /* Some sections have not yet been sized, notably .gnu.version,
3876 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3877 input sections, so don't drop output sections that have such
3878 input sections unless they are also marked SEC_EXCLUDE. */
3879 if (exclude && output_section->map_head.s != NULL)
3883 for (s = output_section->map_head.s; s != NULL; s = s->map_head.s)
3884 if ((s->flags & SEC_EXCLUDE) == 0
3885 && ((s->flags & SEC_LINKER_CREATED) != 0
3886 || link_info.emitrelocations))
3893 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3894 output_section->map_head.link_order = NULL;
3895 output_section->map_tail.link_order = NULL;
3899 /* We don't set bfd_section to NULL since bfd_section of the
3900 removed output section statement may still be used. */
3901 if (!os->update_dot)
3903 output_section->flags |= SEC_EXCLUDE;
3904 bfd_section_list_remove (link_info.output_bfd, output_section);
3905 link_info.output_bfd->section_count--;
3909 /* Stop future calls to lang_add_section from messing with map_head
3910 and map_tail link_order fields. */
3911 stripped_excluded_sections = TRUE;
3915 print_output_section_statement
3916 (lang_output_section_statement_type *output_section_statement)
3918 asection *section = output_section_statement->bfd_section;
3921 if (output_section_statement != abs_output_section)
3923 minfo ("\n%s", output_section_statement->name);
3925 if (section != NULL)
3927 print_dot = section->vma;
3929 len = strlen (output_section_statement->name);
3930 if (len >= SECTION_NAME_MAP_LENGTH - 1)
3935 while (len < SECTION_NAME_MAP_LENGTH)
3941 minfo ("0x%V %W", section->vma, section->size);
3943 if (section->vma != section->lma)
3944 minfo (_(" load address 0x%V"), section->lma);
3946 if (output_section_statement->update_dot_tree != NULL)
3947 exp_fold_tree (output_section_statement->update_dot_tree,
3948 bfd_abs_section_ptr, &print_dot);
3954 print_statement_list (output_section_statement->children.head,
3955 output_section_statement);
3959 print_assignment (lang_assignment_statement_type *assignment,
3960 lang_output_section_statement_type *output_section)
3967 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
3970 if (assignment->exp->type.node_class == etree_assert)
3973 tree = assignment->exp->assert_s.child;
3977 const char *dst = assignment->exp->assign.dst;
3979 is_dot = (dst[0] == '.' && dst[1] == 0);
3981 expld.assign_name = dst;
3982 tree = assignment->exp->assign.src;
3985 osec = output_section->bfd_section;
3987 osec = bfd_abs_section_ptr;
3988 exp_fold_tree (tree, osec, &print_dot);
3989 if (expld.result.valid_p)
3993 if (assignment->exp->type.node_class == etree_assert
3995 || expld.assign_name != NULL)
3997 value = expld.result.value;
3999 if (expld.result.section != NULL)
4000 value += expld.result.section->vma;
4002 minfo ("0x%V", value);
4008 struct bfd_link_hash_entry *h;
4010 h = bfd_link_hash_lookup (link_info.hash, assignment->exp->assign.dst,
4011 FALSE, FALSE, TRUE);
4014 value = h->u.def.value;
4015 value += h->u.def.section->output_section->vma;
4016 value += h->u.def.section->output_offset;
4018 minfo ("[0x%V]", value);
4021 minfo ("[unresolved]");
4031 expld.assign_name = NULL;
4034 exp_print_tree (assignment->exp);
4039 print_input_statement (lang_input_statement_type *statm)
4041 if (statm->filename != NULL
4042 && (statm->the_bfd == NULL
4043 || (statm->the_bfd->flags & BFD_LINKER_CREATED) == 0))
4044 fprintf (config.map_file, "LOAD %s\n", statm->filename);
4047 /* Print all symbols defined in a particular section. This is called
4048 via bfd_link_hash_traverse, or by print_all_symbols. */
4051 print_one_symbol (struct bfd_link_hash_entry *hash_entry, void *ptr)
4053 asection *sec = (asection *) ptr;
4055 if ((hash_entry->type == bfd_link_hash_defined
4056 || hash_entry->type == bfd_link_hash_defweak)
4057 && sec == hash_entry->u.def.section)
4061 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
4064 (hash_entry->u.def.value
4065 + hash_entry->u.def.section->output_offset
4066 + hash_entry->u.def.section->output_section->vma));
4068 minfo (" %T\n", hash_entry->root.string);
4075 hash_entry_addr_cmp (const void *a, const void *b)
4077 const struct bfd_link_hash_entry *l = *(const struct bfd_link_hash_entry **)a;
4078 const struct bfd_link_hash_entry *r = *(const struct bfd_link_hash_entry **)b;
4080 if (l->u.def.value < r->u.def.value)
4082 else if (l->u.def.value > r->u.def.value)
4089 print_all_symbols (asection *sec)
4091 input_section_userdata_type *ud
4092 = (input_section_userdata_type *) get_userdata (sec);
4093 struct map_symbol_def *def;
4094 struct bfd_link_hash_entry **entries;
4100 *ud->map_symbol_def_tail = 0;
4102 /* Sort the symbols by address. */
4103 entries = (struct bfd_link_hash_entry **)
4104 obstack_alloc (&map_obstack, ud->map_symbol_def_count * sizeof (*entries));
4106 for (i = 0, def = ud->map_symbol_def_head; def; def = def->next, i++)
4107 entries[i] = def->entry;
4109 qsort (entries, ud->map_symbol_def_count, sizeof (*entries),
4110 hash_entry_addr_cmp);
4112 /* Print the symbols. */
4113 for (i = 0; i < ud->map_symbol_def_count; i++)
4114 print_one_symbol (entries[i], sec);
4116 obstack_free (&map_obstack, entries);
4119 /* Print information about an input section to the map file. */
4122 print_input_section (asection *i, bfd_boolean is_discarded)
4124 bfd_size_type size = i->size;
4131 minfo ("%s", i->name);
4133 len = 1 + strlen (i->name);
4134 if (len >= SECTION_NAME_MAP_LENGTH - 1)
4139 while (len < SECTION_NAME_MAP_LENGTH)
4145 if (i->output_section != NULL
4146 && i->output_section->owner == link_info.output_bfd)
4147 addr = i->output_section->vma + i->output_offset;
4155 minfo ("0x%V %W %B\n", addr, TO_ADDR (size), i->owner);
4157 if (size != i->rawsize && i->rawsize != 0)
4159 len = SECTION_NAME_MAP_LENGTH + 3;
4171 minfo (_("%W (size before relaxing)\n"), i->rawsize);
4174 if (i->output_section != NULL
4175 && i->output_section->owner == link_info.output_bfd)
4177 if (link_info.reduce_memory_overheads)
4178 bfd_link_hash_traverse (link_info.hash, print_one_symbol, i);
4180 print_all_symbols (i);
4182 /* Update print_dot, but make sure that we do not move it
4183 backwards - this could happen if we have overlays and a
4184 later overlay is shorter than an earier one. */
4185 if (addr + TO_ADDR (size) > print_dot)
4186 print_dot = addr + TO_ADDR (size);
4191 print_fill_statement (lang_fill_statement_type *fill)
4195 fputs (" FILL mask 0x", config.map_file);
4196 for (p = fill->fill->data, size = fill->fill->size; size != 0; p++, size--)
4197 fprintf (config.map_file, "%02x", *p);
4198 fputs ("\n", config.map_file);
4202 print_data_statement (lang_data_statement_type *data)
4210 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
4213 addr = data->output_offset;
4214 if (data->output_section != NULL)
4215 addr += data->output_section->vma;
4243 minfo ("0x%V %W %s 0x%v", addr, size, name, data->value);
4245 if (data->exp->type.node_class != etree_value)
4248 exp_print_tree (data->exp);
4253 print_dot = addr + TO_ADDR (size);
4256 /* Print an address statement. These are generated by options like
4260 print_address_statement (lang_address_statement_type *address)
4262 minfo (_("Address of section %s set to "), address->section_name);
4263 exp_print_tree (address->address);
4267 /* Print a reloc statement. */
4270 print_reloc_statement (lang_reloc_statement_type *reloc)
4277 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
4280 addr = reloc->output_offset;
4281 if (reloc->output_section != NULL)
4282 addr += reloc->output_section->vma;
4284 size = bfd_get_reloc_size (reloc->howto);
4286 minfo ("0x%V %W RELOC %s ", addr, size, reloc->howto->name);
4288 if (reloc->name != NULL)
4289 minfo ("%s+", reloc->name);
4291 minfo ("%s+", reloc->section->name);
4293 exp_print_tree (reloc->addend_exp);
4297 print_dot = addr + TO_ADDR (size);
4301 print_padding_statement (lang_padding_statement_type *s)
4309 len = sizeof " *fill*" - 1;
4310 while (len < SECTION_NAME_MAP_LENGTH)
4316 addr = s->output_offset;
4317 if (s->output_section != NULL)
4318 addr += s->output_section->vma;
4319 minfo ("0x%V %W ", addr, (bfd_vma) s->size);
4321 if (s->fill->size != 0)
4325 for (p = s->fill->data, size = s->fill->size; size != 0; p++, size--)
4326 fprintf (config.map_file, "%02x", *p);
4331 print_dot = addr + TO_ADDR (s->size);
4335 print_wild_statement (lang_wild_statement_type *w,
4336 lang_output_section_statement_type *os)
4338 struct wildcard_list *sec;
4342 if (w->filenames_sorted)
4344 if (w->filename != NULL)
4345 minfo ("%s", w->filename);
4348 if (w->filenames_sorted)
4352 for (sec = w->section_list; sec; sec = sec->next)
4354 if (sec->spec.sorted)
4356 if (sec->spec.exclude_name_list != NULL)
4359 minfo ("EXCLUDE_FILE(%s", sec->spec.exclude_name_list->name);
4360 for (tmp = sec->spec.exclude_name_list->next; tmp; tmp = tmp->next)
4361 minfo (" %s", tmp->name);
4364 if (sec->spec.name != NULL)
4365 minfo ("%s", sec->spec.name);
4368 if (sec->spec.sorted)
4377 print_statement_list (w->children.head, os);
4380 /* Print a group statement. */
4383 print_group (lang_group_statement_type *s,
4384 lang_output_section_statement_type *os)
4386 fprintf (config.map_file, "START GROUP\n");
4387 print_statement_list (s->children.head, os);
4388 fprintf (config.map_file, "END GROUP\n");
4391 /* Print the list of statements in S.
4392 This can be called for any statement type. */
4395 print_statement_list (lang_statement_union_type *s,
4396 lang_output_section_statement_type *os)
4400 print_statement (s, os);
4405 /* Print the first statement in statement list S.
4406 This can be called for any statement type. */
4409 print_statement (lang_statement_union_type *s,
4410 lang_output_section_statement_type *os)
4412 switch (s->header.type)
4415 fprintf (config.map_file, _("Fail with %d\n"), s->header.type);
4418 case lang_constructors_statement_enum:
4419 if (constructor_list.head != NULL)
4421 if (constructors_sorted)
4422 minfo (" SORT (CONSTRUCTORS)\n");
4424 minfo (" CONSTRUCTORS\n");
4425 print_statement_list (constructor_list.head, os);
4428 case lang_wild_statement_enum:
4429 print_wild_statement (&s->wild_statement, os);
4431 case lang_address_statement_enum:
4432 print_address_statement (&s->address_statement);
4434 case lang_object_symbols_statement_enum:
4435 minfo (" CREATE_OBJECT_SYMBOLS\n");
4437 case lang_fill_statement_enum:
4438 print_fill_statement (&s->fill_statement);
4440 case lang_data_statement_enum:
4441 print_data_statement (&s->data_statement);
4443 case lang_reloc_statement_enum:
4444 print_reloc_statement (&s->reloc_statement);
4446 case lang_input_section_enum:
4447 print_input_section (s->input_section.section, FALSE);
4449 case lang_padding_statement_enum:
4450 print_padding_statement (&s->padding_statement);
4452 case lang_output_section_statement_enum:
4453 print_output_section_statement (&s->output_section_statement);
4455 case lang_assignment_statement_enum:
4456 print_assignment (&s->assignment_statement, os);
4458 case lang_target_statement_enum:
4459 fprintf (config.map_file, "TARGET(%s)\n", s->target_statement.target);
4461 case lang_output_statement_enum:
4462 minfo ("OUTPUT(%s", s->output_statement.name);
4463 if (output_target != NULL)
4464 minfo (" %s", output_target);
4467 case lang_input_statement_enum:
4468 print_input_statement (&s->input_statement);
4470 case lang_group_statement_enum:
4471 print_group (&s->group_statement, os);
4473 case lang_insert_statement_enum:
4474 minfo ("INSERT %s %s\n",
4475 s->insert_statement.is_before ? "BEFORE" : "AFTER",
4476 s->insert_statement.where);
4482 print_statements (void)
4484 print_statement_list (statement_list.head, abs_output_section);
4487 /* Print the first N statements in statement list S to STDERR.
4488 If N == 0, nothing is printed.
4489 If N < 0, the entire list is printed.
4490 Intended to be called from GDB. */
4493 dprint_statement (lang_statement_union_type *s, int n)
4495 FILE *map_save = config.map_file;
4497 config.map_file = stderr;
4500 print_statement_list (s, abs_output_section);
4503 while (s && --n >= 0)
4505 print_statement (s, abs_output_section);
4510 config.map_file = map_save;
4514 insert_pad (lang_statement_union_type **ptr,
4516 bfd_size_type alignment_needed,
4517 asection *output_section,
4520 static fill_type zero_fill;
4521 lang_statement_union_type *pad = NULL;
4523 if (ptr != &statement_list.head)
4524 pad = ((lang_statement_union_type *)
4525 ((char *) ptr - offsetof (lang_statement_union_type, header.next)));
4527 && pad->header.type == lang_padding_statement_enum
4528 && pad->padding_statement.output_section == output_section)
4530 /* Use the existing pad statement. */
4532 else if ((pad = *ptr) != NULL
4533 && pad->header.type == lang_padding_statement_enum
4534 && pad->padding_statement.output_section == output_section)
4536 /* Use the existing pad statement. */
4540 /* Make a new padding statement, linked into existing chain. */
4541 pad = (lang_statement_union_type *)
4542 stat_alloc (sizeof (lang_padding_statement_type));
4543 pad->header.next = *ptr;
4545 pad->header.type = lang_padding_statement_enum;
4546 pad->padding_statement.output_section = output_section;
4549 pad->padding_statement.fill = fill;
4551 pad->padding_statement.output_offset = dot - output_section->vma;
4552 pad->padding_statement.size = alignment_needed;
4553 output_section->size = TO_SIZE (dot + TO_ADDR (alignment_needed)
4554 - output_section->vma);
4557 /* Work out how much this section will move the dot point. */
4561 (lang_statement_union_type **this_ptr,
4562 lang_output_section_statement_type *output_section_statement,
4566 lang_input_section_type *is = &((*this_ptr)->input_section);
4567 asection *i = is->section;
4569 if (i->sec_info_type != SEC_INFO_TYPE_JUST_SYMS
4570 && (i->flags & SEC_EXCLUDE) == 0)
4572 bfd_size_type alignment_needed;
4575 /* Align this section first to the input sections requirement,
4576 then to the output section's requirement. If this alignment
4577 is greater than any seen before, then record it too. Perform
4578 the alignment by inserting a magic 'padding' statement. */
4580 if (output_section_statement->subsection_alignment != -1)
4581 i->alignment_power = output_section_statement->subsection_alignment;
4583 o = output_section_statement->bfd_section;
4584 if (o->alignment_power < i->alignment_power)
4585 o->alignment_power = i->alignment_power;
4587 alignment_needed = align_power (dot, i->alignment_power) - dot;
4589 if (alignment_needed != 0)
4591 insert_pad (this_ptr, fill, TO_SIZE (alignment_needed), o, dot);
4592 dot += alignment_needed;
4595 /* Remember where in the output section this input section goes. */
4597 i->output_offset = dot - o->vma;
4599 /* Mark how big the output section must be to contain this now. */
4600 dot += TO_ADDR (i->size);
4601 o->size = TO_SIZE (dot - o->vma);
4605 i->output_offset = i->vma - output_section_statement->bfd_section->vma;
4612 sort_sections_by_lma (const void *arg1, const void *arg2)
4614 const asection *sec1 = *(const asection **) arg1;
4615 const asection *sec2 = *(const asection **) arg2;
4617 if (bfd_section_lma (sec1->owner, sec1)
4618 < bfd_section_lma (sec2->owner, sec2))
4620 else if (bfd_section_lma (sec1->owner, sec1)
4621 > bfd_section_lma (sec2->owner, sec2))
4623 else if (sec1->id < sec2->id)
4625 else if (sec1->id > sec2->id)
4631 #define IGNORE_SECTION(s) \
4632 ((s->flags & SEC_ALLOC) == 0 \
4633 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
4634 && (s->flags & SEC_LOAD) == 0))
4636 /* Check to see if any allocated sections overlap with other allocated
4637 sections. This can happen if a linker script specifies the output
4638 section addresses of the two sections. Also check whether any memory
4639 region has overflowed. */
4642 lang_check_section_addresses (void)
4645 asection **sections, **spp;
4652 lang_memory_region_type *m;
4654 if (bfd_count_sections (link_info.output_bfd) <= 1)
4657 amt = bfd_count_sections (link_info.output_bfd) * sizeof (asection *);
4658 sections = (asection **) xmalloc (amt);
4660 /* Scan all sections in the output list. */
4662 for (s = link_info.output_bfd->sections; s != NULL; s = s->next)
4664 /* Only consider loadable sections with real contents. */
4665 if (!(s->flags & SEC_LOAD)
4666 || !(s->flags & SEC_ALLOC)
4670 sections[count] = s;
4677 qsort (sections, (size_t) count, sizeof (asection *),
4678 sort_sections_by_lma);
4683 s_end = s_start + TO_ADDR (s->size) - 1;
4684 for (count--; count; count--)
4686 /* We must check the sections' LMA addresses not their VMA
4687 addresses because overlay sections can have overlapping VMAs
4688 but they must have distinct LMAs. */
4694 s_end = s_start + TO_ADDR (s->size) - 1;
4696 /* Look for an overlap. We have sorted sections by lma, so we
4697 know that s_start >= p_start. Besides the obvious case of
4698 overlap when the current section starts before the previous
4699 one ends, we also must have overlap if the previous section
4700 wraps around the address space. */
4701 if (s_start <= p_end
4703 einfo (_("%X%P: section %s loaded at [%V,%V] overlaps section %s loaded at [%V,%V]\n"),
4704 s->name, s_start, s_end, p->name, p_start, p_end);
4709 /* If any memory region has overflowed, report by how much.
4710 We do not issue this diagnostic for regions that had sections
4711 explicitly placed outside their bounds; os_region_check's
4712 diagnostics are adequate for that case.
4714 FIXME: It is conceivable that m->current - (m->origin + m->length)
4715 might overflow a 32-bit integer. There is, alas, no way to print
4716 a bfd_vma quantity in decimal. */
4717 for (m = lang_memory_region_list; m; m = m->next)
4718 if (m->had_full_message)
4719 einfo (_("%X%P: region `%s' overflowed by %ld bytes\n"),
4720 m->name_list.name, (long)(m->current - (m->origin + m->length)));
4724 /* Make sure the new address is within the region. We explicitly permit the
4725 current address to be at the exact end of the region when the address is
4726 non-zero, in case the region is at the end of addressable memory and the
4727 calculation wraps around. */
4730 os_region_check (lang_output_section_statement_type *os,
4731 lang_memory_region_type *region,
4735 if ((region->current < region->origin
4736 || (region->current - region->origin > region->length))
4737 && ((region->current != region->origin + region->length)
4742 einfo (_("%X%P: address 0x%v of %B section `%s'"
4743 " is not within region `%s'\n"),
4745 os->bfd_section->owner,
4746 os->bfd_section->name,
4747 region->name_list.name);
4749 else if (!region->had_full_message)
4751 region->had_full_message = TRUE;
4753 einfo (_("%X%P: %B section `%s' will not fit in region `%s'\n"),
4754 os->bfd_section->owner,
4755 os->bfd_section->name,
4756 region->name_list.name);
4761 /* Set the sizes for all the output sections. */
4764 lang_size_sections_1
4765 (lang_statement_union_type **prev,
4766 lang_output_section_statement_type *output_section_statement,
4770 bfd_boolean check_regions)
4772 lang_statement_union_type *s;
4774 /* Size up the sections from their constituent parts. */
4775 for (s = *prev; s != NULL; s = s->header.next)
4777 switch (s->header.type)
4779 case lang_output_section_statement_enum:
4781 bfd_vma newdot, after;
4782 lang_output_section_statement_type *os;
4783 lang_memory_region_type *r;
4784 int section_alignment = 0;
4786 os = &s->output_section_statement;
4787 if (os->constraint == -1)
4790 /* FIXME: We shouldn't need to zero section vmas for ld -r
4791 here, in lang_insert_orphan, or in the default linker scripts.
4792 This is covering for coff backend linker bugs. See PR6945. */
4793 if (os->addr_tree == NULL
4794 && link_info.relocatable
4795 && (bfd_get_flavour (link_info.output_bfd)
4796 == bfd_target_coff_flavour))
4797 os->addr_tree = exp_intop (0);
4798 if (os->addr_tree != NULL)
4800 os->processed_vma = FALSE;
4801 exp_fold_tree (os->addr_tree, bfd_abs_section_ptr, &dot);
4803 if (expld.result.valid_p)
4805 dot = expld.result.value;
4806 if (expld.result.section != NULL)
4807 dot += expld.result.section->vma;
4809 else if (expld.phase != lang_mark_phase_enum)
4810 einfo (_("%F%S: non constant or forward reference"
4811 " address expression for section %s\n"),
4812 os->addr_tree, os->name);
4815 if (os->bfd_section == NULL)
4816 /* This section was removed or never actually created. */
4819 /* If this is a COFF shared library section, use the size and
4820 address from the input section. FIXME: This is COFF
4821 specific; it would be cleaner if there were some other way
4822 to do this, but nothing simple comes to mind. */
4823 if (((bfd_get_flavour (link_info.output_bfd)
4824 == bfd_target_ecoff_flavour)
4825 || (bfd_get_flavour (link_info.output_bfd)
4826 == bfd_target_coff_flavour))
4827 && (os->bfd_section->flags & SEC_COFF_SHARED_LIBRARY) != 0)
4831 if (os->children.head == NULL
4832 || os->children.head->header.next != NULL
4833 || (os->children.head->header.type
4834 != lang_input_section_enum))
4835 einfo (_("%P%X: Internal error on COFF shared library"
4836 " section %s\n"), os->name);
4838 input = os->children.head->input_section.section;
4839 bfd_set_section_vma (os->bfd_section->owner,
4841 bfd_section_vma (input->owner, input));
4842 os->bfd_section->size = input->size;
4847 if (bfd_is_abs_section (os->bfd_section))
4849 /* No matter what happens, an abs section starts at zero. */
4850 ASSERT (os->bfd_section->vma == 0);
4854 if (os->addr_tree == NULL)
4856 /* No address specified for this section, get one
4857 from the region specification. */
4858 if (os->region == NULL
4859 || ((os->bfd_section->flags & (SEC_ALLOC | SEC_LOAD))
4860 && os->region->name_list.name[0] == '*'
4861 && strcmp (os->region->name_list.name,
4862 DEFAULT_MEMORY_REGION) == 0))
4864 os->region = lang_memory_default (os->bfd_section);
4867 /* If a loadable section is using the default memory
4868 region, and some non default memory regions were
4869 defined, issue an error message. */
4871 && !IGNORE_SECTION (os->bfd_section)
4872 && ! link_info.relocatable
4874 && strcmp (os->region->name_list.name,
4875 DEFAULT_MEMORY_REGION) == 0
4876 && lang_memory_region_list != NULL
4877 && (strcmp (lang_memory_region_list->name_list.name,
4878 DEFAULT_MEMORY_REGION) != 0
4879 || lang_memory_region_list->next != NULL)
4880 && expld.phase != lang_mark_phase_enum)
4882 /* By default this is an error rather than just a
4883 warning because if we allocate the section to the
4884 default memory region we can end up creating an
4885 excessively large binary, or even seg faulting when
4886 attempting to perform a negative seek. See
4887 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4888 for an example of this. This behaviour can be
4889 overridden by the using the --no-check-sections
4891 if (command_line.check_section_addresses)
4892 einfo (_("%P%F: error: no memory region specified"
4893 " for loadable section `%s'\n"),
4894 bfd_get_section_name (link_info.output_bfd,
4897 einfo (_("%P: warning: no memory region specified"
4898 " for loadable section `%s'\n"),
4899 bfd_get_section_name (link_info.output_bfd,
4903 newdot = os->region->current;
4904 section_alignment = os->bfd_section->alignment_power;
4907 section_alignment = os->section_alignment;
4909 /* Align to what the section needs. */
4910 if (section_alignment > 0)
4912 bfd_vma savedot = newdot;
4913 newdot = align_power (newdot, section_alignment);
4915 if (newdot != savedot
4916 && (config.warn_section_align
4917 || os->addr_tree != NULL)
4918 && expld.phase != lang_mark_phase_enum)
4919 einfo (_("%P: warning: changing start of section"
4920 " %s by %lu bytes\n"),
4921 os->name, (unsigned long) (newdot - savedot));
4924 bfd_set_section_vma (0, os->bfd_section, newdot);
4926 os->bfd_section->output_offset = 0;
4929 lang_size_sections_1 (&os->children.head, os,
4930 os->fill, newdot, relax, check_regions);
4932 os->processed_vma = TRUE;
4934 if (bfd_is_abs_section (os->bfd_section) || os->ignored)
4935 /* Except for some special linker created sections,
4936 no output section should change from zero size
4937 after strip_excluded_output_sections. A non-zero
4938 size on an ignored section indicates that some
4939 input section was not sized early enough. */
4940 ASSERT (os->bfd_section->size == 0);
4943 dot = os->bfd_section->vma;
4945 /* Put the section within the requested block size, or
4946 align at the block boundary. */
4948 + TO_ADDR (os->bfd_section->size)
4949 + os->block_value - 1)
4950 & - (bfd_vma) os->block_value);
4952 os->bfd_section->size = TO_SIZE (after - os->bfd_section->vma);
4955 /* Set section lma. */
4958 r = lang_memory_region_lookup (DEFAULT_MEMORY_REGION, FALSE);
4962 bfd_vma lma = exp_get_abs_int (os->load_base, 0, "load base");
4963 os->bfd_section->lma = lma;
4965 else if (os->lma_region != NULL)
4967 bfd_vma lma = os->lma_region->current;
4969 /* When LMA_REGION is the same as REGION, align the LMA
4970 as we did for the VMA, possibly including alignment
4971 from the bfd section. If a different region, then
4972 only align according to the value in the output
4973 statement unless specified otherwise. */
4974 if (os->lma_region != os->region && !os->align_lma_with_input)
4975 section_alignment = os->section_alignment;
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
5127 = TO_SIZE (dot - output_section_statement->bfd_section->vma);
5132 case lang_reloc_statement_enum:
5136 s->reloc_statement.output_offset =
5137 dot - output_section_statement->bfd_section->vma;
5138 s->reloc_statement.output_section =
5139 output_section_statement->bfd_section;
5140 size = bfd_get_reloc_size (s->reloc_statement.howto);
5141 dot += TO_ADDR (size);
5142 output_section_statement->bfd_section->size
5143 = TO_SIZE (dot - output_section_statement->bfd_section->vma);
5147 case lang_wild_statement_enum:
5148 dot = lang_size_sections_1 (&s->wild_statement.children.head,
5149 output_section_statement,
5150 fill, dot, relax, check_regions);
5153 case lang_object_symbols_statement_enum:
5154 link_info.create_object_symbols_section =
5155 output_section_statement->bfd_section;
5158 case lang_output_statement_enum:
5159 case lang_target_statement_enum:
5162 case lang_input_section_enum:
5166 i = s->input_section.section;
5171 if (! bfd_relax_section (i->owner, i, &link_info, &again))
5172 einfo (_("%P%F: can't relax section: %E\n"));
5176 dot = size_input_section (prev, output_section_statement,
5177 output_section_statement->fill, dot);
5181 case lang_input_statement_enum:
5184 case lang_fill_statement_enum:
5185 s->fill_statement.output_section =
5186 output_section_statement->bfd_section;
5188 fill = s->fill_statement.fill;
5191 case lang_assignment_statement_enum:
5193 bfd_vma newdot = dot;
5194 etree_type *tree = s->assignment_statement.exp;
5196 expld.dataseg.relro = exp_dataseg_relro_none;
5198 exp_fold_tree (tree,
5199 output_section_statement->bfd_section,
5202 if (expld.dataseg.relro == exp_dataseg_relro_start)
5204 if (!expld.dataseg.relro_start_stat)
5205 expld.dataseg.relro_start_stat = s;
5208 ASSERT (expld.dataseg.relro_start_stat == s);
5211 else if (expld.dataseg.relro == exp_dataseg_relro_end)
5213 if (!expld.dataseg.relro_end_stat)
5214 expld.dataseg.relro_end_stat = s;
5217 ASSERT (expld.dataseg.relro_end_stat == s);
5220 expld.dataseg.relro = exp_dataseg_relro_none;
5222 /* This symbol may be relative to this section. */
5223 if ((tree->type.node_class == etree_provided
5224 || tree->type.node_class == etree_assign)
5225 && (tree->assign.dst [0] != '.'
5226 || tree->assign.dst [1] != '\0'))
5227 output_section_statement->update_dot = 1;
5229 if (!output_section_statement->ignored)
5231 if (output_section_statement == abs_output_section)
5233 /* If we don't have an output section, then just adjust
5234 the default memory address. */
5235 lang_memory_region_lookup (DEFAULT_MEMORY_REGION,
5236 FALSE)->current = newdot;
5238 else if (newdot != dot)
5240 /* Insert a pad after this statement. We can't
5241 put the pad before when relaxing, in case the
5242 assignment references dot. */
5243 insert_pad (&s->header.next, fill, TO_SIZE (newdot - dot),
5244 output_section_statement->bfd_section, dot);
5246 /* Don't neuter the pad below when relaxing. */
5249 /* If dot is advanced, this implies that the section
5250 should have space allocated to it, unless the
5251 user has explicitly stated that the section
5252 should not be allocated. */
5253 if (output_section_statement->sectype != noalloc_section
5254 && (output_section_statement->sectype != noload_section
5255 || (bfd_get_flavour (link_info.output_bfd)
5256 == bfd_target_elf_flavour)))
5257 output_section_statement->bfd_section->flags |= SEC_ALLOC;
5264 case lang_padding_statement_enum:
5265 /* If this is the first time lang_size_sections is called,
5266 we won't have any padding statements. If this is the
5267 second or later passes when relaxing, we should allow
5268 padding to shrink. If padding is needed on this pass, it
5269 will be added back in. */
5270 s->padding_statement.size = 0;
5272 /* Make sure output_offset is valid. If relaxation shrinks
5273 the section and this pad isn't needed, it's possible to
5274 have output_offset larger than the final size of the
5275 section. bfd_set_section_contents will complain even for
5276 a pad size of zero. */
5277 s->padding_statement.output_offset
5278 = dot - output_section_statement->bfd_section->vma;
5281 case lang_group_statement_enum:
5282 dot = lang_size_sections_1 (&s->group_statement.children.head,
5283 output_section_statement,
5284 fill, dot, relax, check_regions);
5287 case lang_insert_statement_enum:
5290 /* We can only get here when relaxing is turned on. */
5291 case lang_address_statement_enum:
5298 prev = &s->header.next;
5303 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
5304 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
5305 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
5306 segments. We are allowed an opportunity to override this decision. */
5309 ldlang_override_segment_assignment (struct bfd_link_info * info ATTRIBUTE_UNUSED,
5310 bfd * abfd ATTRIBUTE_UNUSED,
5311 asection * current_section,
5312 asection * previous_section,
5313 bfd_boolean new_segment)
5315 lang_output_section_statement_type * cur;
5316 lang_output_section_statement_type * prev;
5318 /* The checks below are only necessary when the BFD library has decided
5319 that the two sections ought to be placed into the same segment. */
5323 /* Paranoia checks. */
5324 if (current_section == NULL || previous_section == NULL)
5327 /* If this flag is set, the target never wants code and non-code
5328 sections comingled in the same segment. */
5329 if (config.separate_code
5330 && ((current_section->flags ^ previous_section->flags) & SEC_CODE))
5333 /* Find the memory regions associated with the two sections.
5334 We call lang_output_section_find() here rather than scanning the list
5335 of output sections looking for a matching section pointer because if
5336 we have a large number of sections then a hash lookup is faster. */
5337 cur = lang_output_section_find (current_section->name);
5338 prev = lang_output_section_find (previous_section->name);
5340 /* More paranoia. */
5341 if (cur == NULL || prev == NULL)
5344 /* If the regions are different then force the sections to live in
5345 different segments. See the email thread starting at the following
5346 URL for the reasons why this is necessary:
5347 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
5348 return cur->region != prev->region;
5352 one_lang_size_sections_pass (bfd_boolean *relax, bfd_boolean check_regions)
5354 lang_statement_iteration++;
5355 lang_size_sections_1 (&statement_list.head, abs_output_section,
5356 0, 0, relax, check_regions);
5360 lang_size_sections (bfd_boolean *relax, bfd_boolean check_regions)
5362 expld.phase = lang_allocating_phase_enum;
5363 expld.dataseg.phase = exp_dataseg_none;
5365 one_lang_size_sections_pass (relax, check_regions);
5366 if (expld.dataseg.phase == exp_dataseg_end_seen
5367 && link_info.relro && expld.dataseg.relro_end)
5369 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
5370 to put expld.dataseg.relro_end on a (common) page boundary. */
5371 bfd_vma min_base, relro_end, maxpage;
5373 expld.dataseg.phase = exp_dataseg_relro_adjust;
5374 maxpage = expld.dataseg.maxpagesize;
5375 /* MIN_BASE is the absolute minimum address we are allowed to start the
5376 read-write segment (byte before will be mapped read-only). */
5377 min_base = (expld.dataseg.min_base + maxpage - 1) & ~(maxpage - 1);
5378 expld.dataseg.base += (-expld.dataseg.relro_end
5379 & (expld.dataseg.pagesize - 1));
5380 /* Compute the expected PT_GNU_RELRO segment end. */
5381 relro_end = ((expld.dataseg.relro_end + expld.dataseg.pagesize - 1)
5382 & ~(expld.dataseg.pagesize - 1));
5383 if (min_base + maxpage < expld.dataseg.base)
5385 expld.dataseg.base -= maxpage;
5386 relro_end -= maxpage;
5388 lang_reset_memory_regions ();
5389 one_lang_size_sections_pass (relax, check_regions);
5390 if (expld.dataseg.relro_end > relro_end)
5392 /* The alignment of sections between DATA_SEGMENT_ALIGN
5393 and DATA_SEGMENT_RELRO_END can cause excessive padding to
5394 be inserted at DATA_SEGMENT_RELRO_END. Try to start a
5395 bit lower so that the section alignments will fit in. */
5397 unsigned int max_alignment_power = 0;
5399 /* Find maximum alignment power of sections between
5400 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
5401 for (sec = link_info.output_bfd->sections; sec; sec = sec->next)
5402 if (sec->vma >= expld.dataseg.base
5403 && sec->vma < expld.dataseg.relro_end
5404 && sec->alignment_power > max_alignment_power)
5405 max_alignment_power = sec->alignment_power;
5407 if (((bfd_vma) 1 << max_alignment_power) < expld.dataseg.pagesize)
5409 /* Aligning the adjusted base guarantees the padding
5410 between sections won't change. This is better than
5411 simply subtracting 1 << max_alignment_power which is
5412 what we used to do here. */
5413 expld.dataseg.base &= ~((1 << max_alignment_power) - 1);
5414 lang_reset_memory_regions ();
5415 one_lang_size_sections_pass (relax, check_regions);
5418 link_info.relro_start = expld.dataseg.base;
5419 link_info.relro_end = expld.dataseg.relro_end;
5421 else if (expld.dataseg.phase == exp_dataseg_end_seen)
5423 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
5424 a page could be saved in the data segment. */
5425 bfd_vma first, last;
5427 first = -expld.dataseg.base & (expld.dataseg.pagesize - 1);
5428 last = expld.dataseg.end & (expld.dataseg.pagesize - 1);
5430 && ((expld.dataseg.base & ~(expld.dataseg.pagesize - 1))
5431 != (expld.dataseg.end & ~(expld.dataseg.pagesize - 1)))
5432 && first + last <= expld.dataseg.pagesize)
5434 expld.dataseg.phase = exp_dataseg_adjust;
5435 lang_reset_memory_regions ();
5436 one_lang_size_sections_pass (relax, check_regions);
5439 expld.dataseg.phase = exp_dataseg_done;
5442 expld.dataseg.phase = exp_dataseg_done;
5445 static lang_output_section_statement_type *current_section;
5446 static lang_assignment_statement_type *current_assign;
5447 static bfd_boolean prefer_next_section;
5449 /* Worker function for lang_do_assignments. Recursiveness goes here. */
5452 lang_do_assignments_1 (lang_statement_union_type *s,
5453 lang_output_section_statement_type *current_os,
5456 bfd_boolean *found_end)
5458 for (; s != NULL; s = s->header.next)
5460 switch (s->header.type)
5462 case lang_constructors_statement_enum:
5463 dot = lang_do_assignments_1 (constructor_list.head,
5464 current_os, fill, dot, found_end);
5467 case lang_output_section_statement_enum:
5469 lang_output_section_statement_type *os;
5471 os = &(s->output_section_statement);
5472 os->after_end = *found_end;
5473 if (os->bfd_section != NULL && !os->ignored)
5475 if ((os->bfd_section->flags & SEC_ALLOC) != 0)
5477 current_section = os;
5478 prefer_next_section = FALSE;
5480 dot = os->bfd_section->vma;
5482 lang_do_assignments_1 (os->children.head,
5483 os, os->fill, dot, found_end);
5485 /* .tbss sections effectively have zero size. */
5486 if ((os->bfd_section->flags & SEC_HAS_CONTENTS) != 0
5487 || (os->bfd_section->flags & SEC_THREAD_LOCAL) == 0
5488 || link_info.relocatable)
5489 dot += TO_ADDR (os->bfd_section->size);
5491 if (os->update_dot_tree != NULL)
5492 exp_fold_tree (os->update_dot_tree, bfd_abs_section_ptr, &dot);
5497 case lang_wild_statement_enum:
5499 dot = lang_do_assignments_1 (s->wild_statement.children.head,
5500 current_os, fill, dot, found_end);
5503 case lang_object_symbols_statement_enum:
5504 case lang_output_statement_enum:
5505 case lang_target_statement_enum:
5508 case lang_data_statement_enum:
5509 exp_fold_tree (s->data_statement.exp, bfd_abs_section_ptr, &dot);
5510 if (expld.result.valid_p)
5512 s->data_statement.value = expld.result.value;
5513 if (expld.result.section != NULL)
5514 s->data_statement.value += expld.result.section->vma;
5517 einfo (_("%F%P: invalid data statement\n"));
5520 switch (s->data_statement.type)
5538 if (size < TO_SIZE ((unsigned) 1))
5539 size = TO_SIZE ((unsigned) 1);
5540 dot += TO_ADDR (size);
5544 case lang_reloc_statement_enum:
5545 exp_fold_tree (s->reloc_statement.addend_exp,
5546 bfd_abs_section_ptr, &dot);
5547 if (expld.result.valid_p)
5548 s->reloc_statement.addend_value = expld.result.value;
5550 einfo (_("%F%P: invalid reloc statement\n"));
5551 dot += TO_ADDR (bfd_get_reloc_size (s->reloc_statement.howto));
5554 case lang_input_section_enum:
5556 asection *in = s->input_section.section;
5558 if ((in->flags & SEC_EXCLUDE) == 0)
5559 dot += TO_ADDR (in->size);
5563 case lang_input_statement_enum:
5566 case lang_fill_statement_enum:
5567 fill = s->fill_statement.fill;
5570 case lang_assignment_statement_enum:
5571 current_assign = &s->assignment_statement;
5572 if (current_assign->exp->type.node_class != etree_assert)
5574 const char *p = current_assign->exp->assign.dst;
5576 if (current_os == abs_output_section && p[0] == '.' && p[1] == 0)
5577 prefer_next_section = TRUE;
5581 if (strcmp (p, "end") == 0)
5584 exp_fold_tree (s->assignment_statement.exp,
5585 current_os->bfd_section,
5589 case lang_padding_statement_enum:
5590 dot += TO_ADDR (s->padding_statement.size);
5593 case lang_group_statement_enum:
5594 dot = lang_do_assignments_1 (s->group_statement.children.head,
5595 current_os, fill, dot, found_end);
5598 case lang_insert_statement_enum:
5601 case lang_address_statement_enum:
5613 lang_do_assignments (lang_phase_type phase)
5615 bfd_boolean found_end = FALSE;
5617 current_section = NULL;
5618 prefer_next_section = FALSE;
5619 expld.phase = phase;
5620 lang_statement_iteration++;
5621 lang_do_assignments_1 (statement_list.head,
5622 abs_output_section, NULL, 0, &found_end);
5625 /* For an assignment statement outside of an output section statement,
5626 choose the best of neighbouring output sections to use for values
5630 section_for_dot (void)
5634 /* Assignments belong to the previous output section, unless there
5635 has been an assignment to "dot", in which case following
5636 assignments belong to the next output section. (The assumption
5637 is that an assignment to "dot" is setting up the address for the
5638 next output section.) Except that past the assignment to "_end"
5639 we always associate with the previous section. This exception is
5640 for targets like SH that define an alloc .stack or other
5641 weirdness after non-alloc sections. */
5642 if (current_section == NULL || prefer_next_section)
5644 lang_statement_union_type *stmt;
5645 lang_output_section_statement_type *os;
5647 for (stmt = (lang_statement_union_type *) current_assign;
5649 stmt = stmt->header.next)
5650 if (stmt->header.type == lang_output_section_statement_enum)
5653 os = &stmt->output_section_statement;
5656 && (os->bfd_section == NULL
5657 || (os->bfd_section->flags & SEC_EXCLUDE) != 0
5658 || bfd_section_removed_from_list (link_info.output_bfd,
5662 if (current_section == NULL || os == NULL || !os->after_end)
5665 s = os->bfd_section;
5667 s = link_info.output_bfd->section_last;
5669 && ((s->flags & SEC_ALLOC) == 0
5670 || (s->flags & SEC_THREAD_LOCAL) != 0))
5675 return bfd_abs_section_ptr;
5679 s = current_section->bfd_section;
5681 /* The section may have been stripped. */
5683 && ((s->flags & SEC_EXCLUDE) != 0
5684 || (s->flags & SEC_ALLOC) == 0
5685 || (s->flags & SEC_THREAD_LOCAL) != 0
5686 || bfd_section_removed_from_list (link_info.output_bfd, s)))
5689 s = link_info.output_bfd->sections;
5691 && ((s->flags & SEC_ALLOC) == 0
5692 || (s->flags & SEC_THREAD_LOCAL) != 0))
5697 return bfd_abs_section_ptr;
5700 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
5701 operator .startof. (section_name), it produces an undefined symbol
5702 .startof.section_name. Similarly, when it sees
5703 .sizeof. (section_name), it produces an undefined symbol
5704 .sizeof.section_name. For all the output sections, we look for
5705 such symbols, and set them to the correct value. */
5708 lang_set_startof (void)
5712 if (link_info.relocatable)
5715 for (s = link_info.output_bfd->sections; s != NULL; s = s->next)
5717 const char *secname;
5719 struct bfd_link_hash_entry *h;
5721 secname = bfd_get_section_name (link_info.output_bfd, s);
5722 buf = (char *) xmalloc (10 + strlen (secname));
5724 sprintf (buf, ".startof.%s", secname);
5725 h = bfd_link_hash_lookup (link_info.hash, buf, FALSE, FALSE, TRUE);
5726 if (h != NULL && h->type == bfd_link_hash_undefined)
5728 h->type = bfd_link_hash_defined;
5730 h->u.def.section = s;
5733 sprintf (buf, ".sizeof.%s", secname);
5734 h = bfd_link_hash_lookup (link_info.hash, buf, FALSE, FALSE, TRUE);
5735 if (h != NULL && h->type == bfd_link_hash_undefined)
5737 h->type = bfd_link_hash_defined;
5738 h->u.def.value = TO_ADDR (s->size);
5739 h->u.def.section = bfd_abs_section_ptr;
5749 struct bfd_link_hash_entry *h;
5752 if ((link_info.relocatable && !link_info.gc_sections)
5753 || (link_info.shared && !link_info.executable))
5754 warn = entry_from_cmdline;
5758 /* Force the user to specify a root when generating a relocatable with
5760 if (link_info.gc_sections && link_info.relocatable
5761 && !(entry_from_cmdline || undef_from_cmdline))
5762 einfo (_("%P%F: gc-sections requires either an entry or "
5763 "an undefined symbol\n"));
5765 if (entry_symbol.name == NULL)
5767 /* No entry has been specified. Look for the default entry, but
5768 don't warn if we don't find it. */
5769 entry_symbol.name = entry_symbol_default;
5773 h = bfd_link_hash_lookup (link_info.hash, entry_symbol.name,
5774 FALSE, FALSE, TRUE);
5776 && (h->type == bfd_link_hash_defined
5777 || h->type == bfd_link_hash_defweak)
5778 && h->u.def.section->output_section != NULL)
5782 val = (h->u.def.value
5783 + bfd_get_section_vma (link_info.output_bfd,
5784 h->u.def.section->output_section)
5785 + h->u.def.section->output_offset);
5786 if (! bfd_set_start_address (link_info.output_bfd, val))
5787 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol.name);
5794 /* We couldn't find the entry symbol. Try parsing it as a
5796 val = bfd_scan_vma (entry_symbol.name, &send, 0);
5799 if (! bfd_set_start_address (link_info.output_bfd, val))
5800 einfo (_("%P%F: can't set start address\n"));
5806 /* Can't find the entry symbol, and it's not a number. Use
5807 the first address in the text section. */
5808 ts = bfd_get_section_by_name (link_info.output_bfd, entry_section);
5812 einfo (_("%P: warning: cannot find entry symbol %s;"
5813 " defaulting to %V\n"),
5815 bfd_get_section_vma (link_info.output_bfd, ts));
5816 if (!(bfd_set_start_address
5817 (link_info.output_bfd,
5818 bfd_get_section_vma (link_info.output_bfd, ts))))
5819 einfo (_("%P%F: can't set start address\n"));
5824 einfo (_("%P: warning: cannot find entry symbol %s;"
5825 " not setting start address\n"),
5832 /* This is a small function used when we want to ignore errors from
5836 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED, ...)
5838 /* Don't do anything. */
5841 /* Check that the architecture of all the input files is compatible
5842 with the output file. Also call the backend to let it do any
5843 other checking that is needed. */
5848 lang_statement_union_type *file;
5850 const bfd_arch_info_type *compatible;
5852 for (file = file_chain.head; file != NULL; file = file->input_statement.next)
5854 #ifdef ENABLE_PLUGINS
5855 /* Don't check format of files claimed by plugin. */
5856 if (file->input_statement.flags.claimed)
5858 #endif /* ENABLE_PLUGINS */
5859 input_bfd = file->input_statement.the_bfd;
5861 = bfd_arch_get_compatible (input_bfd, link_info.output_bfd,
5862 command_line.accept_unknown_input_arch);
5864 /* In general it is not possible to perform a relocatable
5865 link between differing object formats when the input
5866 file has relocations, because the relocations in the
5867 input format may not have equivalent representations in
5868 the output format (and besides BFD does not translate
5869 relocs for other link purposes than a final link). */
5870 if ((link_info.relocatable || link_info.emitrelocations)
5871 && (compatible == NULL
5872 || (bfd_get_flavour (input_bfd)
5873 != bfd_get_flavour (link_info.output_bfd)))
5874 && (bfd_get_file_flags (input_bfd) & HAS_RELOC) != 0)
5876 einfo (_("%P%F: Relocatable linking with relocations from"
5877 " format %s (%B) to format %s (%B) is not supported\n"),
5878 bfd_get_target (input_bfd), input_bfd,
5879 bfd_get_target (link_info.output_bfd), link_info.output_bfd);
5880 /* einfo with %F exits. */
5883 if (compatible == NULL)
5885 if (command_line.warn_mismatch)
5886 einfo (_("%P%X: %s architecture of input file `%B'"
5887 " is incompatible with %s output\n"),
5888 bfd_printable_name (input_bfd), input_bfd,
5889 bfd_printable_name (link_info.output_bfd));
5891 else if (bfd_count_sections (input_bfd))
5893 /* If the input bfd has no contents, it shouldn't set the
5894 private data of the output bfd. */
5896 bfd_error_handler_type pfn = NULL;
5898 /* If we aren't supposed to warn about mismatched input
5899 files, temporarily set the BFD error handler to a
5900 function which will do nothing. We still want to call
5901 bfd_merge_private_bfd_data, since it may set up
5902 information which is needed in the output file. */
5903 if (! command_line.warn_mismatch)
5904 pfn = bfd_set_error_handler (ignore_bfd_errors);
5905 if (! bfd_merge_private_bfd_data (input_bfd, link_info.output_bfd))
5907 if (command_line.warn_mismatch)
5908 einfo (_("%P%X: failed to merge target specific data"
5909 " of file %B\n"), input_bfd);
5911 if (! command_line.warn_mismatch)
5912 bfd_set_error_handler (pfn);
5917 /* Look through all the global common symbols and attach them to the
5918 correct section. The -sort-common command line switch may be used
5919 to roughly sort the entries by alignment. */
5924 if (command_line.inhibit_common_definition)
5926 if (link_info.relocatable
5927 && ! command_line.force_common_definition)
5930 if (! config.sort_common)
5931 bfd_link_hash_traverse (link_info.hash, lang_one_common, NULL);
5936 if (config.sort_common == sort_descending)
5938 for (power = 4; power > 0; power--)
5939 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
5942 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
5946 for (power = 0; power <= 4; power++)
5947 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
5950 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
5955 /* Place one common symbol in the correct section. */
5958 lang_one_common (struct bfd_link_hash_entry *h, void *info)
5960 unsigned int power_of_two;
5964 if (h->type != bfd_link_hash_common)
5968 power_of_two = h->u.c.p->alignment_power;
5970 if (config.sort_common == sort_descending
5971 && power_of_two < *(unsigned int *) info)
5973 else if (config.sort_common == sort_ascending
5974 && power_of_two > *(unsigned int *) info)
5977 section = h->u.c.p->section;
5978 if (!bfd_define_common_symbol (link_info.output_bfd, &link_info, h))
5979 einfo (_("%P%F: Could not define common symbol `%T': %E\n"),
5982 if (config.map_file != NULL)
5984 static bfd_boolean header_printed;
5989 if (! header_printed)
5991 minfo (_("\nAllocating common symbols\n"));
5992 minfo (_("Common symbol size file\n\n"));
5993 header_printed = TRUE;
5996 name = bfd_demangle (link_info.output_bfd, h->root.string,
5997 DMGL_ANSI | DMGL_PARAMS);
6000 minfo ("%s", h->root.string);
6001 len = strlen (h->root.string);
6006 len = strlen (name);
6022 if (size <= 0xffffffff)
6023 sprintf (buf, "%lx", (unsigned long) size);
6025 sprintf_vma (buf, size);
6035 minfo ("%B\n", section->owner);
6041 /* Run through the input files and ensure that every input section has
6042 somewhere to go. If one is found without a destination then create
6043 an input request and place it into the statement tree. */
6046 lang_place_orphans (void)
6048 LANG_FOR_EACH_INPUT_STATEMENT (file)
6052 for (s = file->the_bfd->sections; s != NULL; s = s->next)
6054 if (s->output_section == NULL)
6056 /* This section of the file is not attached, root
6057 around for a sensible place for it to go. */
6059 if (file->flags.just_syms)
6060 bfd_link_just_syms (file->the_bfd, s, &link_info);
6061 else if ((s->flags & SEC_EXCLUDE) != 0)
6062 s->output_section = bfd_abs_section_ptr;
6063 else if (strcmp (s->name, "COMMON") == 0)
6065 /* This is a lonely common section which must have
6066 come from an archive. We attach to the section
6067 with the wildcard. */
6068 if (! link_info.relocatable
6069 || command_line.force_common_definition)
6071 if (default_common_section == NULL)
6072 default_common_section
6073 = lang_output_section_statement_lookup (".bss", 0,
6075 lang_add_section (&default_common_section->children, s,
6076 NULL, default_common_section);
6081 const char *name = s->name;
6084 if (config.unique_orphan_sections
6085 || unique_section_p (s, NULL))
6086 constraint = SPECIAL;
6088 if (!ldemul_place_orphan (s, name, constraint))
6090 lang_output_section_statement_type *os;
6091 os = lang_output_section_statement_lookup (name,
6094 if (os->addr_tree == NULL
6095 && (link_info.relocatable
6096 || (s->flags & (SEC_LOAD | SEC_ALLOC)) == 0))
6097 os->addr_tree = exp_intop (0);
6098 lang_add_section (&os->children, s, NULL, os);
6107 lang_set_flags (lang_memory_region_type *ptr, const char *flags, int invert)
6109 flagword *ptr_flags;
6111 ptr_flags = invert ? &ptr->not_flags : &ptr->flags;
6117 *ptr_flags |= SEC_ALLOC;
6121 *ptr_flags |= SEC_READONLY;
6125 *ptr_flags |= SEC_DATA;
6129 *ptr_flags |= SEC_CODE;
6134 *ptr_flags |= SEC_LOAD;
6138 einfo (_("%P%F: invalid syntax in flags\n"));
6145 /* Call a function on each input file. This function will be called
6146 on an archive, but not on the elements. */
6149 lang_for_each_input_file (void (*func) (lang_input_statement_type *))
6151 lang_input_statement_type *f;
6153 for (f = (lang_input_statement_type *) input_file_chain.head;
6155 f = (lang_input_statement_type *) f->next_real_file)
6159 /* Call a function on each file. The function will be called on all
6160 the elements of an archive which are included in the link, but will
6161 not be called on the archive file itself. */
6164 lang_for_each_file (void (*func) (lang_input_statement_type *))
6166 LANG_FOR_EACH_INPUT_STATEMENT (f)
6173 ldlang_add_file (lang_input_statement_type *entry)
6175 lang_statement_append (&file_chain,
6176 (lang_statement_union_type *) entry,
6179 /* The BFD linker needs to have a list of all input BFDs involved in
6181 ASSERT (entry->the_bfd->link_next == NULL);
6182 ASSERT (entry->the_bfd != link_info.output_bfd);
6184 *link_info.input_bfds_tail = entry->the_bfd;
6185 link_info.input_bfds_tail = &entry->the_bfd->link_next;
6186 entry->the_bfd->usrdata = entry;
6187 bfd_set_gp_size (entry->the_bfd, g_switch_value);
6189 /* Look through the sections and check for any which should not be
6190 included in the link. We need to do this now, so that we can
6191 notice when the backend linker tries to report multiple
6192 definition errors for symbols which are in sections we aren't
6193 going to link. FIXME: It might be better to entirely ignore
6194 symbols which are defined in sections which are going to be
6195 discarded. This would require modifying the backend linker for
6196 each backend which might set the SEC_LINK_ONCE flag. If we do
6197 this, we should probably handle SEC_EXCLUDE in the same way. */
6199 bfd_map_over_sections (entry->the_bfd, section_already_linked, entry);
6203 lang_add_output (const char *name, int from_script)
6205 /* Make -o on command line override OUTPUT in script. */
6206 if (!had_output_filename || !from_script)
6208 output_filename = name;
6209 had_output_filename = TRUE;
6222 for (l = 0; l < 32; l++)
6224 if (i >= (unsigned int) x)
6232 lang_output_section_statement_type *
6233 lang_enter_output_section_statement (const char *output_section_statement_name,
6234 etree_type *address_exp,
6235 enum section_type sectype,
6237 etree_type *subalign,
6240 int align_with_input)
6242 lang_output_section_statement_type *os;
6244 os = lang_output_section_statement_lookup (output_section_statement_name,
6246 current_section = os;
6248 if (os->addr_tree == NULL)
6250 os->addr_tree = address_exp;
6252 os->sectype = sectype;
6253 if (sectype != noload_section)
6254 os->flags = SEC_NO_FLAGS;
6256 os->flags = SEC_NEVER_LOAD;
6257 os->block_value = 1;
6259 /* Make next things chain into subchain of this. */
6260 push_stat_ptr (&os->children);
6262 os->align_lma_with_input = align_with_input == ALIGN_WITH_INPUT;
6263 if (os->align_lma_with_input && align != NULL)
6264 einfo (_("%F%P:%S: error: align with input and explicit align specified\n"), NULL);
6266 os->subsection_alignment =
6267 topower (exp_get_value_int (subalign, -1, "subsection alignment"));
6268 os->section_alignment =
6269 topower (exp_get_value_int (align, -1, "section alignment"));
6271 os->load_base = ebase;
6278 lang_output_statement_type *new_stmt;
6280 new_stmt = new_stat (lang_output_statement, stat_ptr);
6281 new_stmt->name = output_filename;
6285 /* Reset the current counters in the regions. */
6288 lang_reset_memory_regions (void)
6290 lang_memory_region_type *p = lang_memory_region_list;
6292 lang_output_section_statement_type *os;
6294 for (p = lang_memory_region_list; p != NULL; p = p->next)
6296 p->current = p->origin;
6300 for (os = &lang_output_section_statement.head->output_section_statement;
6304 os->processed_vma = FALSE;
6305 os->processed_lma = FALSE;
6308 for (o = link_info.output_bfd->sections; o != NULL; o = o->next)
6310 /* Save the last size for possible use by bfd_relax_section. */
6311 o->rawsize = o->size;
6316 /* Worker for lang_gc_sections_1. */
6319 gc_section_callback (lang_wild_statement_type *ptr,
6320 struct wildcard_list *sec ATTRIBUTE_UNUSED,
6322 struct flag_info *sflag_info ATTRIBUTE_UNUSED,
6323 lang_input_statement_type *file ATTRIBUTE_UNUSED,
6324 void *data ATTRIBUTE_UNUSED)
6326 /* If the wild pattern was marked KEEP, the member sections
6327 should be as well. */
6328 if (ptr->keep_sections)
6329 section->flags |= SEC_KEEP;
6332 /* Iterate over sections marking them against GC. */
6335 lang_gc_sections_1 (lang_statement_union_type *s)
6337 for (; s != NULL; s = s->header.next)
6339 switch (s->header.type)
6341 case lang_wild_statement_enum:
6342 walk_wild (&s->wild_statement, gc_section_callback, NULL);
6344 case lang_constructors_statement_enum:
6345 lang_gc_sections_1 (constructor_list.head);
6347 case lang_output_section_statement_enum:
6348 lang_gc_sections_1 (s->output_section_statement.children.head);
6350 case lang_group_statement_enum:
6351 lang_gc_sections_1 (s->group_statement.children.head);
6360 lang_gc_sections (void)
6362 /* Keep all sections so marked in the link script. */
6364 lang_gc_sections_1 (statement_list.head);
6366 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
6367 the special case of debug info. (See bfd/stabs.c)
6368 Twiddle the flag here, to simplify later linker code. */
6369 if (link_info.relocatable)
6371 LANG_FOR_EACH_INPUT_STATEMENT (f)
6374 #ifdef ENABLE_PLUGINS
6375 if (f->flags.claimed)
6378 for (sec = f->the_bfd->sections; sec != NULL; sec = sec->next)
6379 if ((sec->flags & SEC_DEBUGGING) == 0)
6380 sec->flags &= ~SEC_EXCLUDE;
6384 if (link_info.gc_sections)
6385 bfd_gc_sections (link_info.output_bfd, &link_info);
6388 /* Worker for lang_find_relro_sections_1. */
6391 find_relro_section_callback (lang_wild_statement_type *ptr ATTRIBUTE_UNUSED,
6392 struct wildcard_list *sec ATTRIBUTE_UNUSED,
6394 struct flag_info *sflag_info ATTRIBUTE_UNUSED,
6395 lang_input_statement_type *file ATTRIBUTE_UNUSED,
6398 /* Discarded, excluded and ignored sections effectively have zero
6400 if (section->output_section != NULL
6401 && section->output_section->owner == link_info.output_bfd
6402 && (section->output_section->flags & SEC_EXCLUDE) == 0
6403 && !IGNORE_SECTION (section)
6404 && section->size != 0)
6406 bfd_boolean *has_relro_section = (bfd_boolean *) data;
6407 *has_relro_section = TRUE;
6411 /* Iterate over sections for relro sections. */
6414 lang_find_relro_sections_1 (lang_statement_union_type *s,
6415 bfd_boolean *has_relro_section)
6417 if (*has_relro_section)
6420 for (; s != NULL; s = s->header.next)
6422 if (s == expld.dataseg.relro_end_stat)
6425 switch (s->header.type)
6427 case lang_wild_statement_enum:
6428 walk_wild (&s->wild_statement,
6429 find_relro_section_callback,
6432 case lang_constructors_statement_enum:
6433 lang_find_relro_sections_1 (constructor_list.head,
6436 case lang_output_section_statement_enum:
6437 lang_find_relro_sections_1 (s->output_section_statement.children.head,
6440 case lang_group_statement_enum:
6441 lang_find_relro_sections_1 (s->group_statement.children.head,
6451 lang_find_relro_sections (void)
6453 bfd_boolean has_relro_section = FALSE;
6455 /* Check all sections in the link script. */
6457 lang_find_relro_sections_1 (expld.dataseg.relro_start_stat,
6458 &has_relro_section);
6460 if (!has_relro_section)
6461 link_info.relro = FALSE;
6464 /* Relax all sections until bfd_relax_section gives up. */
6467 lang_relax_sections (bfd_boolean need_layout)
6469 if (RELAXATION_ENABLED)
6471 /* We may need more than one relaxation pass. */
6472 int i = link_info.relax_pass;
6474 /* The backend can use it to determine the current pass. */
6475 link_info.relax_pass = 0;
6479 /* Keep relaxing until bfd_relax_section gives up. */
6480 bfd_boolean relax_again;
6482 link_info.relax_trip = -1;
6485 link_info.relax_trip++;
6487 /* Note: pe-dll.c does something like this also. If you find
6488 you need to change this code, you probably need to change
6489 pe-dll.c also. DJ */
6491 /* Do all the assignments with our current guesses as to
6493 lang_do_assignments (lang_assigning_phase_enum);
6495 /* We must do this after lang_do_assignments, because it uses
6497 lang_reset_memory_regions ();
6499 /* Perform another relax pass - this time we know where the
6500 globals are, so can make a better guess. */
6501 relax_again = FALSE;
6502 lang_size_sections (&relax_again, FALSE);
6504 while (relax_again);
6506 link_info.relax_pass++;
6513 /* Final extra sizing to report errors. */
6514 lang_do_assignments (lang_assigning_phase_enum);
6515 lang_reset_memory_regions ();
6516 lang_size_sections (NULL, TRUE);
6520 #ifdef ENABLE_PLUGINS
6521 /* Find the insert point for the plugin's replacement files. We
6522 place them after the first claimed real object file, or if the
6523 first claimed object is an archive member, after the last real
6524 object file immediately preceding the archive. In the event
6525 no objects have been claimed at all, we return the first dummy
6526 object file on the list as the insert point; that works, but
6527 the callee must be careful when relinking the file_chain as it
6528 is not actually on that chain, only the statement_list and the
6529 input_file list; in that case, the replacement files must be
6530 inserted at the head of the file_chain. */
6532 static lang_input_statement_type *
6533 find_replacements_insert_point (void)
6535 lang_input_statement_type *claim1, *lastobject;
6536 lastobject = &input_file_chain.head->input_statement;
6537 for (claim1 = &file_chain.head->input_statement;
6539 claim1 = &claim1->next->input_statement)
6541 if (claim1->flags.claimed)
6542 return claim1->flags.claim_archive ? lastobject : claim1;
6543 /* Update lastobject if this is a real object file. */
6544 if (claim1->the_bfd && (claim1->the_bfd->my_archive == NULL))
6545 lastobject = claim1;
6547 /* No files were claimed by the plugin. Choose the last object
6548 file found on the list (maybe the first, dummy entry) as the
6553 /* Insert SRCLIST into DESTLIST after given element by chaining
6554 on FIELD as the next-pointer. (Counterintuitively does not need
6555 a pointer to the actual after-node itself, just its chain field.) */
6558 lang_list_insert_after (lang_statement_list_type *destlist,
6559 lang_statement_list_type *srclist,
6560 lang_statement_union_type **field)
6562 *(srclist->tail) = *field;
6563 *field = srclist->head;
6564 if (destlist->tail == field)
6565 destlist->tail = srclist->tail;
6568 /* Detach new nodes added to DESTLIST since the time ORIGLIST
6569 was taken as a copy of it and leave them in ORIGLIST. */
6572 lang_list_remove_tail (lang_statement_list_type *destlist,
6573 lang_statement_list_type *origlist)
6575 union lang_statement_union **savetail;
6576 /* Check that ORIGLIST really is an earlier state of DESTLIST. */
6577 ASSERT (origlist->head == destlist->head);
6578 savetail = origlist->tail;
6579 origlist->head = *(savetail);
6580 origlist->tail = destlist->tail;
6581 destlist->tail = savetail;
6584 #endif /* ENABLE_PLUGINS */
6589 /* Finalize dynamic list. */
6590 if (link_info.dynamic_list)
6591 lang_finalize_version_expr_head (&link_info.dynamic_list->head);
6593 current_target = default_target;
6595 /* Open the output file. */
6596 lang_for_each_statement (ldlang_open_output);
6599 ldemul_create_output_section_statements ();
6601 /* Add to the hash table all undefineds on the command line. */
6602 lang_place_undefineds ();
6604 if (!bfd_section_already_linked_table_init ())
6605 einfo (_("%P%F: Failed to create hash table\n"));
6607 /* Create a bfd for each input file. */
6608 current_target = default_target;
6609 open_input_bfds (statement_list.head, OPEN_BFD_NORMAL);
6611 #ifdef ENABLE_PLUGINS
6612 if (plugin_active_plugins_p ())
6614 lang_statement_list_type added;
6615 lang_statement_list_type files, inputfiles;
6617 /* Now all files are read, let the plugin(s) decide if there
6618 are any more to be added to the link before we call the
6619 emulation's after_open hook. We create a private list of
6620 input statements for this purpose, which we will eventually
6621 insert into the global statment list after the first claimed
6624 /* We need to manipulate all three chains in synchrony. */
6626 inputfiles = input_file_chain;
6627 if (plugin_call_all_symbols_read ())
6628 einfo (_("%P%F: %s: plugin reported error after all symbols read\n"),
6629 plugin_error_plugin ());
6630 /* Open any newly added files, updating the file chains. */
6631 link_info.loading_lto_outputs = TRUE;
6632 open_input_bfds (*added.tail, OPEN_BFD_NORMAL);
6633 /* Restore the global list pointer now they have all been added. */
6634 lang_list_remove_tail (stat_ptr, &added);
6635 /* And detach the fresh ends of the file lists. */
6636 lang_list_remove_tail (&file_chain, &files);
6637 lang_list_remove_tail (&input_file_chain, &inputfiles);
6638 /* Were any new files added? */
6639 if (added.head != NULL)
6641 /* If so, we will insert them into the statement list immediately
6642 after the first input file that was claimed by the plugin. */
6643 plugin_insert = find_replacements_insert_point ();
6644 /* If a plugin adds input files without having claimed any, we
6645 don't really have a good idea where to place them. Just putting
6646 them at the start or end of the list is liable to leave them
6647 outside the crtbegin...crtend range. */
6648 ASSERT (plugin_insert != NULL);
6649 /* Splice the new statement list into the old one. */
6650 lang_list_insert_after (stat_ptr, &added,
6651 &plugin_insert->header.next);
6652 /* Likewise for the file chains. */
6653 lang_list_insert_after (&input_file_chain, &inputfiles,
6654 &plugin_insert->next_real_file);
6655 /* We must be careful when relinking file_chain; we may need to
6656 insert the new files at the head of the list if the insert
6657 point chosen is the dummy first input file. */
6658 if (plugin_insert->filename)
6659 lang_list_insert_after (&file_chain, &files, &plugin_insert->next);
6661 lang_list_insert_after (&file_chain, &files, &file_chain.head);
6663 /* Rescan archives in case new undefined symbols have appeared. */
6664 open_input_bfds (statement_list.head, OPEN_BFD_RESCAN);
6667 #endif /* ENABLE_PLUGINS */
6669 link_info.gc_sym_list = &entry_symbol;
6670 if (entry_symbol.name == NULL)
6671 link_info.gc_sym_list = ldlang_undef_chain_list_head;
6673 ldemul_after_open ();
6674 if (config.map_file != NULL)
6675 lang_print_asneeded ();
6677 bfd_section_already_linked_table_free ();
6679 /* Make sure that we're not mixing architectures. We call this
6680 after all the input files have been opened, but before we do any
6681 other processing, so that any operations merge_private_bfd_data
6682 does on the output file will be known during the rest of the
6686 /* Handle .exports instead of a version script if we're told to do so. */
6687 if (command_line.version_exports_section)
6688 lang_do_version_exports_section ();
6690 /* Build all sets based on the information gathered from the input
6692 ldctor_build_sets ();
6694 /* PR 13683: We must rerun the assignments prior to running garbage
6695 collection in order to make sure that all symbol aliases are resolved. */
6696 lang_do_assignments (lang_mark_phase_enum);
6697 expld.phase = lang_first_phase_enum;
6699 /* Remove unreferenced sections if asked to. */
6700 lang_gc_sections ();
6702 /* Size up the common data. */
6705 /* Update wild statements. */
6706 update_wild_statements (statement_list.head);
6708 /* Run through the contours of the script and attach input sections
6709 to the correct output sections. */
6710 lang_statement_iteration++;
6711 map_input_to_output_sections (statement_list.head, NULL, NULL);
6713 process_insert_statements ();
6715 /* Find any sections not attached explicitly and handle them. */
6716 lang_place_orphans ();
6718 if (! link_info.relocatable)
6722 /* Merge SEC_MERGE sections. This has to be done after GC of
6723 sections, so that GCed sections are not merged, but before
6724 assigning dynamic symbols, since removing whole input sections
6726 bfd_merge_sections (link_info.output_bfd, &link_info);
6728 /* Look for a text section and set the readonly attribute in it. */
6729 found = bfd_get_section_by_name (link_info.output_bfd, ".text");
6733 if (config.text_read_only)
6734 found->flags |= SEC_READONLY;
6736 found->flags &= ~SEC_READONLY;
6740 /* Do anything special before sizing sections. This is where ELF
6741 and other back-ends size dynamic sections. */
6742 ldemul_before_allocation ();
6744 /* We must record the program headers before we try to fix the
6745 section positions, since they will affect SIZEOF_HEADERS. */
6746 lang_record_phdrs ();
6748 /* Check relro sections. */
6749 if (link_info.relro && ! link_info.relocatable)
6750 lang_find_relro_sections ();
6752 /* Size up the sections. */
6753 lang_size_sections (NULL, ! RELAXATION_ENABLED);
6755 /* See if anything special should be done now we know how big
6756 everything is. This is where relaxation is done. */
6757 ldemul_after_allocation ();
6759 /* Fix any .startof. or .sizeof. symbols. */
6760 lang_set_startof ();
6762 /* Do all the assignments, now that we know the final resting places
6763 of all the symbols. */
6764 lang_do_assignments (lang_final_phase_enum);
6768 /* Make sure that the section addresses make sense. */
6769 if (command_line.check_section_addresses)
6770 lang_check_section_addresses ();
6775 /* EXPORTED TO YACC */
6778 lang_add_wild (struct wildcard_spec *filespec,
6779 struct wildcard_list *section_list,
6780 bfd_boolean keep_sections)
6782 struct wildcard_list *curr, *next;
6783 lang_wild_statement_type *new_stmt;
6785 /* Reverse the list as the parser puts it back to front. */
6786 for (curr = section_list, section_list = NULL;
6788 section_list = curr, curr = next)
6790 if (curr->spec.name != NULL && strcmp (curr->spec.name, "COMMON") == 0)
6791 placed_commons = TRUE;
6794 curr->next = section_list;
6797 if (filespec != NULL && filespec->name != NULL)
6799 if (strcmp (filespec->name, "*") == 0)
6800 filespec->name = NULL;
6801 else if (! wildcardp (filespec->name))
6802 lang_has_input_file = TRUE;
6805 new_stmt = new_stat (lang_wild_statement, stat_ptr);
6806 new_stmt->filename = NULL;
6807 new_stmt->filenames_sorted = FALSE;
6808 new_stmt->section_flag_list = NULL;
6809 if (filespec != NULL)
6811 new_stmt->filename = filespec->name;
6812 new_stmt->filenames_sorted = filespec->sorted == by_name;
6813 new_stmt->section_flag_list = filespec->section_flag_list;
6815 new_stmt->section_list = section_list;
6816 new_stmt->keep_sections = keep_sections;
6817 lang_list_init (&new_stmt->children);
6818 analyze_walk_wild_section_handler (new_stmt);
6822 lang_section_start (const char *name, etree_type *address,
6823 const segment_type *segment)
6825 lang_address_statement_type *ad;
6827 ad = new_stat (lang_address_statement, stat_ptr);
6828 ad->section_name = name;
6829 ad->address = address;
6830 ad->segment = segment;
6833 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
6834 because of a -e argument on the command line, or zero if this is
6835 called by ENTRY in a linker script. Command line arguments take
6839 lang_add_entry (const char *name, bfd_boolean cmdline)
6841 if (entry_symbol.name == NULL
6843 || ! entry_from_cmdline)
6845 entry_symbol.name = name;
6846 entry_from_cmdline = cmdline;
6850 /* Set the default start symbol to NAME. .em files should use this,
6851 not lang_add_entry, to override the use of "start" if neither the
6852 linker script nor the command line specifies an entry point. NAME
6853 must be permanently allocated. */
6855 lang_default_entry (const char *name)
6857 entry_symbol_default = name;
6861 lang_add_target (const char *name)
6863 lang_target_statement_type *new_stmt;
6865 new_stmt = new_stat (lang_target_statement, stat_ptr);
6866 new_stmt->target = name;
6870 lang_add_map (const char *name)
6877 map_option_f = TRUE;
6885 lang_add_fill (fill_type *fill)
6887 lang_fill_statement_type *new_stmt;
6889 new_stmt = new_stat (lang_fill_statement, stat_ptr);
6890 new_stmt->fill = fill;
6894 lang_add_data (int type, union etree_union *exp)
6896 lang_data_statement_type *new_stmt;
6898 new_stmt = new_stat (lang_data_statement, stat_ptr);
6899 new_stmt->exp = exp;
6900 new_stmt->type = type;
6903 /* Create a new reloc statement. RELOC is the BFD relocation type to
6904 generate. HOWTO is the corresponding howto structure (we could
6905 look this up, but the caller has already done so). SECTION is the
6906 section to generate a reloc against, or NAME is the name of the
6907 symbol to generate a reloc against. Exactly one of SECTION and
6908 NAME must be NULL. ADDEND is an expression for the addend. */
6911 lang_add_reloc (bfd_reloc_code_real_type reloc,
6912 reloc_howto_type *howto,
6915 union etree_union *addend)
6917 lang_reloc_statement_type *p = new_stat (lang_reloc_statement, stat_ptr);
6921 p->section = section;
6923 p->addend_exp = addend;
6925 p->addend_value = 0;
6926 p->output_section = NULL;
6927 p->output_offset = 0;
6930 lang_assignment_statement_type *
6931 lang_add_assignment (etree_type *exp)
6933 lang_assignment_statement_type *new_stmt;
6935 new_stmt = new_stat (lang_assignment_statement, stat_ptr);
6936 new_stmt->exp = exp;
6941 lang_add_attribute (enum statement_enum attribute)
6943 new_statement (attribute, sizeof (lang_statement_header_type), stat_ptr);
6947 lang_startup (const char *name)
6949 if (first_file->filename != NULL)
6951 einfo (_("%P%F: multiple STARTUP files\n"));
6953 first_file->filename = name;
6954 first_file->local_sym_name = name;
6955 first_file->flags.real = TRUE;
6959 lang_float (bfd_boolean maybe)
6961 lang_float_flag = maybe;
6965 /* Work out the load- and run-time regions from a script statement, and
6966 store them in *LMA_REGION and *REGION respectively.
6968 MEMSPEC is the name of the run-time region, or the value of
6969 DEFAULT_MEMORY_REGION if the statement didn't specify one.
6970 LMA_MEMSPEC is the name of the load-time region, or null if the
6971 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
6972 had an explicit load address.
6974 It is an error to specify both a load region and a load address. */
6977 lang_get_regions (lang_memory_region_type **region,
6978 lang_memory_region_type **lma_region,
6979 const char *memspec,
6980 const char *lma_memspec,
6981 bfd_boolean have_lma,
6982 bfd_boolean have_vma)
6984 *lma_region = lang_memory_region_lookup (lma_memspec, FALSE);
6986 /* If no runtime region or VMA has been specified, but the load region
6987 has been specified, then use the load region for the runtime region
6989 if (lma_memspec != NULL
6991 && strcmp (memspec, DEFAULT_MEMORY_REGION) == 0)
6992 *region = *lma_region;
6994 *region = lang_memory_region_lookup (memspec, FALSE);
6996 if (have_lma && lma_memspec != 0)
6997 einfo (_("%X%P:%S: section has both a load address and a load region\n"),
7002 lang_leave_output_section_statement (fill_type *fill, const char *memspec,
7003 lang_output_section_phdr_list *phdrs,
7004 const char *lma_memspec)
7006 lang_get_regions (¤t_section->region,
7007 ¤t_section->lma_region,
7008 memspec, lma_memspec,
7009 current_section->load_base != NULL,
7010 current_section->addr_tree != NULL);
7012 /* If this section has no load region or base, but uses the same
7013 region as the previous section, then propagate the previous
7014 section's load region. */
7016 if (current_section->lma_region == NULL
7017 && current_section->load_base == NULL
7018 && current_section->addr_tree == NULL
7019 && current_section->region == current_section->prev->region)
7020 current_section->lma_region = current_section->prev->lma_region;
7022 current_section->fill = fill;
7023 current_section->phdrs = phdrs;
7028 lang_statement_append (lang_statement_list_type *list,
7029 lang_statement_union_type *element,
7030 lang_statement_union_type **field)
7032 *(list->tail) = element;
7036 /* Set the output format type. -oformat overrides scripts. */
7039 lang_add_output_format (const char *format,
7044 if (output_target == NULL || !from_script)
7046 if (command_line.endian == ENDIAN_BIG
7049 else if (command_line.endian == ENDIAN_LITTLE
7053 output_target = format;
7058 lang_add_insert (const char *where, int is_before)
7060 lang_insert_statement_type *new_stmt;
7062 new_stmt = new_stat (lang_insert_statement, stat_ptr);
7063 new_stmt->where = where;
7064 new_stmt->is_before = is_before;
7065 saved_script_handle = previous_script_handle;
7068 /* Enter a group. This creates a new lang_group_statement, and sets
7069 stat_ptr to build new statements within the group. */
7072 lang_enter_group (void)
7074 lang_group_statement_type *g;
7076 g = new_stat (lang_group_statement, stat_ptr);
7077 lang_list_init (&g->children);
7078 push_stat_ptr (&g->children);
7081 /* Leave a group. This just resets stat_ptr to start writing to the
7082 regular list of statements again. Note that this will not work if
7083 groups can occur inside anything else which can adjust stat_ptr,
7084 but currently they can't. */
7087 lang_leave_group (void)
7092 /* Add a new program header. This is called for each entry in a PHDRS
7093 command in a linker script. */
7096 lang_new_phdr (const char *name,
7098 bfd_boolean filehdr,
7103 struct lang_phdr *n, **pp;
7106 n = (struct lang_phdr *) stat_alloc (sizeof (struct lang_phdr));
7109 n->type = exp_get_value_int (type, 0, "program header type");
7110 n->filehdr = filehdr;
7115 hdrs = n->type == 1 && (phdrs || filehdr);
7117 for (pp = &lang_phdr_list; *pp != NULL; pp = &(*pp)->next)
7120 && !((*pp)->filehdr || (*pp)->phdrs))
7122 einfo (_("%X%P:%S: PHDRS and FILEHDR are not supported"
7123 " when prior PT_LOAD headers lack them\n"), NULL);
7130 /* Record the program header information in the output BFD. FIXME: We
7131 should not be calling an ELF specific function here. */
7134 lang_record_phdrs (void)
7138 lang_output_section_phdr_list *last;
7139 struct lang_phdr *l;
7140 lang_output_section_statement_type *os;
7143 secs = (asection **) xmalloc (alc * sizeof (asection *));
7146 for (l = lang_phdr_list; l != NULL; l = l->next)
7153 for (os = &lang_output_section_statement.head->output_section_statement;
7157 lang_output_section_phdr_list *pl;
7159 if (os->constraint < 0)
7167 if (os->sectype == noload_section
7168 || os->bfd_section == NULL
7169 || (os->bfd_section->flags & SEC_ALLOC) == 0)
7172 /* Don't add orphans to PT_INTERP header. */
7178 lang_output_section_statement_type * tmp_os;
7180 /* If we have not run across a section with a program
7181 header assigned to it yet, then scan forwards to find
7182 one. This prevents inconsistencies in the linker's
7183 behaviour when a script has specified just a single
7184 header and there are sections in that script which are
7185 not assigned to it, and which occur before the first
7186 use of that header. See here for more details:
7187 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
7188 for (tmp_os = os; tmp_os; tmp_os = tmp_os->next)
7191 last = tmp_os->phdrs;
7195 einfo (_("%F%P: no sections assigned to phdrs\n"));
7200 if (os->bfd_section == NULL)
7203 for (; pl != NULL; pl = pl->next)
7205 if (strcmp (pl->name, l->name) == 0)
7210 secs = (asection **) xrealloc (secs,
7211 alc * sizeof (asection *));
7213 secs[c] = os->bfd_section;
7220 if (l->flags == NULL)
7223 flags = exp_get_vma (l->flags, 0, "phdr flags");
7228 at = exp_get_vma (l->at, 0, "phdr load address");
7230 if (! bfd_record_phdr (link_info.output_bfd, l->type,
7231 l->flags != NULL, flags, l->at != NULL,
7232 at, l->filehdr, l->phdrs, c, secs))
7233 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
7238 /* Make sure all the phdr assignments succeeded. */
7239 for (os = &lang_output_section_statement.head->output_section_statement;
7243 lang_output_section_phdr_list *pl;
7245 if (os->constraint < 0
7246 || os->bfd_section == NULL)
7249 for (pl = os->phdrs;
7252 if (! pl->used && strcmp (pl->name, "NONE") != 0)
7253 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
7254 os->name, pl->name);
7258 /* Record a list of sections which may not be cross referenced. */
7261 lang_add_nocrossref (lang_nocrossref_type *l)
7263 struct lang_nocrossrefs *n;
7265 n = (struct lang_nocrossrefs *) xmalloc (sizeof *n);
7266 n->next = nocrossref_list;
7268 nocrossref_list = n;
7270 /* Set notice_all so that we get informed about all symbols. */
7271 link_info.notice_all = TRUE;
7274 /* Overlay handling. We handle overlays with some static variables. */
7276 /* The overlay virtual address. */
7277 static etree_type *overlay_vma;
7278 /* And subsection alignment. */
7279 static etree_type *overlay_subalign;
7281 /* An expression for the maximum section size seen so far. */
7282 static etree_type *overlay_max;
7284 /* A list of all the sections in this overlay. */
7286 struct overlay_list {
7287 struct overlay_list *next;
7288 lang_output_section_statement_type *os;
7291 static struct overlay_list *overlay_list;
7293 /* Start handling an overlay. */
7296 lang_enter_overlay (etree_type *vma_expr, etree_type *subalign)
7298 /* The grammar should prevent nested overlays from occurring. */
7299 ASSERT (overlay_vma == NULL
7300 && overlay_subalign == NULL
7301 && overlay_max == NULL);
7303 overlay_vma = vma_expr;
7304 overlay_subalign = subalign;
7307 /* Start a section in an overlay. We handle this by calling
7308 lang_enter_output_section_statement with the correct VMA.
7309 lang_leave_overlay sets up the LMA and memory regions. */
7312 lang_enter_overlay_section (const char *name)
7314 struct overlay_list *n;
7317 lang_enter_output_section_statement (name, overlay_vma, overlay_section,
7318 0, overlay_subalign, 0, 0, 0);
7320 /* If this is the first section, then base the VMA of future
7321 sections on this one. This will work correctly even if `.' is
7322 used in the addresses. */
7323 if (overlay_list == NULL)
7324 overlay_vma = exp_nameop (ADDR, name);
7326 /* Remember the section. */
7327 n = (struct overlay_list *) xmalloc (sizeof *n);
7328 n->os = current_section;
7329 n->next = overlay_list;
7332 size = exp_nameop (SIZEOF, name);
7334 /* Arrange to work out the maximum section end address. */
7335 if (overlay_max == NULL)
7338 overlay_max = exp_binop (MAX_K, overlay_max, size);
7341 /* Finish a section in an overlay. There isn't any special to do
7345 lang_leave_overlay_section (fill_type *fill,
7346 lang_output_section_phdr_list *phdrs)
7353 name = current_section->name;
7355 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
7356 region and that no load-time region has been specified. It doesn't
7357 really matter what we say here, since lang_leave_overlay will
7359 lang_leave_output_section_statement (fill, DEFAULT_MEMORY_REGION, phdrs, 0);
7361 /* Define the magic symbols. */
7363 clean = (char *) xmalloc (strlen (name) + 1);
7365 for (s1 = name; *s1 != '\0'; s1++)
7366 if (ISALNUM (*s1) || *s1 == '_')
7370 buf = (char *) xmalloc (strlen (clean) + sizeof "__load_start_");
7371 sprintf (buf, "__load_start_%s", clean);
7372 lang_add_assignment (exp_provide (buf,
7373 exp_nameop (LOADADDR, name),
7376 buf = (char *) xmalloc (strlen (clean) + sizeof "__load_stop_");
7377 sprintf (buf, "__load_stop_%s", clean);
7378 lang_add_assignment (exp_provide (buf,
7380 exp_nameop (LOADADDR, name),
7381 exp_nameop (SIZEOF, name)),
7387 /* Finish an overlay. If there are any overlay wide settings, this
7388 looks through all the sections in the overlay and sets them. */
7391 lang_leave_overlay (etree_type *lma_expr,
7394 const char *memspec,
7395 lang_output_section_phdr_list *phdrs,
7396 const char *lma_memspec)
7398 lang_memory_region_type *region;
7399 lang_memory_region_type *lma_region;
7400 struct overlay_list *l;
7401 lang_nocrossref_type *nocrossref;
7403 lang_get_regions (®ion, &lma_region,
7404 memspec, lma_memspec,
7405 lma_expr != NULL, FALSE);
7409 /* After setting the size of the last section, set '.' to end of the
7411 if (overlay_list != NULL)
7413 overlay_list->os->update_dot = 1;
7414 overlay_list->os->update_dot_tree
7415 = exp_assign (".", exp_binop ('+', overlay_vma, overlay_max), FALSE);
7421 struct overlay_list *next;
7423 if (fill != NULL && l->os->fill == NULL)
7426 l->os->region = region;
7427 l->os->lma_region = lma_region;
7429 /* The first section has the load address specified in the
7430 OVERLAY statement. The rest are worked out from that.
7431 The base address is not needed (and should be null) if
7432 an LMA region was specified. */
7435 l->os->load_base = lma_expr;
7436 l->os->sectype = normal_section;
7438 if (phdrs != NULL && l->os->phdrs == NULL)
7439 l->os->phdrs = phdrs;
7443 lang_nocrossref_type *nc;
7445 nc = (lang_nocrossref_type *) xmalloc (sizeof *nc);
7446 nc->name = l->os->name;
7447 nc->next = nocrossref;
7456 if (nocrossref != NULL)
7457 lang_add_nocrossref (nocrossref);
7460 overlay_list = NULL;
7464 /* Version handling. This is only useful for ELF. */
7466 /* If PREV is NULL, return first version pattern matching particular symbol.
7467 If PREV is non-NULL, return first version pattern matching particular
7468 symbol after PREV (previously returned by lang_vers_match). */
7470 static struct bfd_elf_version_expr *
7471 lang_vers_match (struct bfd_elf_version_expr_head *head,
7472 struct bfd_elf_version_expr *prev,
7476 const char *cxx_sym = sym;
7477 const char *java_sym = sym;
7478 struct bfd_elf_version_expr *expr = NULL;
7479 enum demangling_styles curr_style;
7481 curr_style = CURRENT_DEMANGLING_STYLE;
7482 cplus_demangle_set_style (no_demangling);
7483 c_sym = bfd_demangle (link_info.output_bfd, sym, DMGL_NO_OPTS);
7486 cplus_demangle_set_style (curr_style);
7488 if (head->mask & BFD_ELF_VERSION_CXX_TYPE)
7490 cxx_sym = bfd_demangle (link_info.output_bfd, sym,
7491 DMGL_PARAMS | DMGL_ANSI);
7495 if (head->mask & BFD_ELF_VERSION_JAVA_TYPE)
7497 java_sym = bfd_demangle (link_info.output_bfd, sym, DMGL_JAVA);
7502 if (head->htab && (prev == NULL || prev->literal))
7504 struct bfd_elf_version_expr e;
7506 switch (prev ? prev->mask : 0)
7509 if (head->mask & BFD_ELF_VERSION_C_TYPE)
7512 expr = (struct bfd_elf_version_expr *)
7513 htab_find ((htab_t) head->htab, &e);
7514 while (expr && strcmp (expr->pattern, c_sym) == 0)
7515 if (expr->mask == BFD_ELF_VERSION_C_TYPE)
7521 case BFD_ELF_VERSION_C_TYPE:
7522 if (head->mask & BFD_ELF_VERSION_CXX_TYPE)
7524 e.pattern = cxx_sym;
7525 expr = (struct bfd_elf_version_expr *)
7526 htab_find ((htab_t) head->htab, &e);
7527 while (expr && strcmp (expr->pattern, cxx_sym) == 0)
7528 if (expr->mask == BFD_ELF_VERSION_CXX_TYPE)
7534 case BFD_ELF_VERSION_CXX_TYPE:
7535 if (head->mask & BFD_ELF_VERSION_JAVA_TYPE)
7537 e.pattern = java_sym;
7538 expr = (struct bfd_elf_version_expr *)
7539 htab_find ((htab_t) head->htab, &e);
7540 while (expr && strcmp (expr->pattern, java_sym) == 0)
7541 if (expr->mask == BFD_ELF_VERSION_JAVA_TYPE)
7552 /* Finally, try the wildcards. */
7553 if (prev == NULL || prev->literal)
7554 expr = head->remaining;
7557 for (; expr; expr = expr->next)
7564 if (expr->pattern[0] == '*' && expr->pattern[1] == '\0')
7567 if (expr->mask == BFD_ELF_VERSION_JAVA_TYPE)
7569 else if (expr->mask == BFD_ELF_VERSION_CXX_TYPE)
7573 if (fnmatch (expr->pattern, s, 0) == 0)
7579 free ((char *) c_sym);
7581 free ((char *) cxx_sym);
7582 if (java_sym != sym)
7583 free ((char *) java_sym);
7587 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
7588 return a pointer to the symbol name with any backslash quotes removed. */
7591 realsymbol (const char *pattern)
7594 bfd_boolean changed = FALSE, backslash = FALSE;
7595 char *s, *symbol = (char *) xmalloc (strlen (pattern) + 1);
7597 for (p = pattern, s = symbol; *p != '\0'; ++p)
7599 /* It is a glob pattern only if there is no preceding
7603 /* Remove the preceding backslash. */
7610 if (*p == '?' || *p == '*' || *p == '[')
7617 backslash = *p == '\\';
7633 /* This is called for each variable name or match expression. NEW_NAME is
7634 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
7635 pattern to be matched against symbol names. */
7637 struct bfd_elf_version_expr *
7638 lang_new_vers_pattern (struct bfd_elf_version_expr *orig,
7639 const char *new_name,
7641 bfd_boolean literal_p)
7643 struct bfd_elf_version_expr *ret;
7645 ret = (struct bfd_elf_version_expr *) xmalloc (sizeof *ret);
7649 ret->literal = TRUE;
7650 ret->pattern = literal_p ? new_name : realsymbol (new_name);
7651 if (ret->pattern == NULL)
7653 ret->pattern = new_name;
7654 ret->literal = FALSE;
7657 if (lang == NULL || strcasecmp (lang, "C") == 0)
7658 ret->mask = BFD_ELF_VERSION_C_TYPE;
7659 else if (strcasecmp (lang, "C++") == 0)
7660 ret->mask = BFD_ELF_VERSION_CXX_TYPE;
7661 else if (strcasecmp (lang, "Java") == 0)
7662 ret->mask = BFD_ELF_VERSION_JAVA_TYPE;
7665 einfo (_("%X%P: unknown language `%s' in version information\n"),
7667 ret->mask = BFD_ELF_VERSION_C_TYPE;
7670 return ldemul_new_vers_pattern (ret);
7673 /* This is called for each set of variable names and match
7676 struct bfd_elf_version_tree *
7677 lang_new_vers_node (struct bfd_elf_version_expr *globals,
7678 struct bfd_elf_version_expr *locals)
7680 struct bfd_elf_version_tree *ret;
7682 ret = (struct bfd_elf_version_tree *) xcalloc (1, sizeof *ret);
7683 ret->globals.list = globals;
7684 ret->locals.list = locals;
7685 ret->match = lang_vers_match;
7686 ret->name_indx = (unsigned int) -1;
7690 /* This static variable keeps track of version indices. */
7692 static int version_index;
7695 version_expr_head_hash (const void *p)
7697 const struct bfd_elf_version_expr *e =
7698 (const struct bfd_elf_version_expr *) p;
7700 return htab_hash_string (e->pattern);
7704 version_expr_head_eq (const void *p1, const void *p2)
7706 const struct bfd_elf_version_expr *e1 =
7707 (const struct bfd_elf_version_expr *) p1;
7708 const struct bfd_elf_version_expr *e2 =
7709 (const struct bfd_elf_version_expr *) p2;
7711 return strcmp (e1->pattern, e2->pattern) == 0;
7715 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head *head)
7718 struct bfd_elf_version_expr *e, *next;
7719 struct bfd_elf_version_expr **list_loc, **remaining_loc;
7721 for (e = head->list; e; e = e->next)
7725 head->mask |= e->mask;
7730 head->htab = htab_create (count * 2, version_expr_head_hash,
7731 version_expr_head_eq, NULL);
7732 list_loc = &head->list;
7733 remaining_loc = &head->remaining;
7734 for (e = head->list; e; e = next)
7740 remaining_loc = &e->next;
7744 void **loc = htab_find_slot ((htab_t) head->htab, e, INSERT);
7748 struct bfd_elf_version_expr *e1, *last;
7750 e1 = (struct bfd_elf_version_expr *) *loc;
7754 if (e1->mask == e->mask)
7762 while (e1 && strcmp (e1->pattern, e->pattern) == 0);
7766 /* This is a duplicate. */
7767 /* FIXME: Memory leak. Sometimes pattern is not
7768 xmalloced alone, but in larger chunk of memory. */
7769 /* free (e->pattern); */
7774 e->next = last->next;
7782 list_loc = &e->next;
7786 *remaining_loc = NULL;
7787 *list_loc = head->remaining;
7790 head->remaining = head->list;
7793 /* This is called when we know the name and dependencies of the
7797 lang_register_vers_node (const char *name,
7798 struct bfd_elf_version_tree *version,
7799 struct bfd_elf_version_deps *deps)
7801 struct bfd_elf_version_tree *t, **pp;
7802 struct bfd_elf_version_expr *e1;
7807 if (link_info.version_info != NULL
7808 && (name[0] == '\0' || link_info.version_info->name[0] == '\0'))
7810 einfo (_("%X%P: anonymous version tag cannot be combined"
7811 " with other version tags\n"));
7816 /* Make sure this node has a unique name. */
7817 for (t = link_info.version_info; t != NULL; t = t->next)
7818 if (strcmp (t->name, name) == 0)
7819 einfo (_("%X%P: duplicate version tag `%s'\n"), name);
7821 lang_finalize_version_expr_head (&version->globals);
7822 lang_finalize_version_expr_head (&version->locals);
7824 /* Check the global and local match names, and make sure there
7825 aren't any duplicates. */
7827 for (e1 = version->globals.list; e1 != NULL; e1 = e1->next)
7829 for (t = link_info.version_info; t != NULL; t = t->next)
7831 struct bfd_elf_version_expr *e2;
7833 if (t->locals.htab && e1->literal)
7835 e2 = (struct bfd_elf_version_expr *)
7836 htab_find ((htab_t) t->locals.htab, e1);
7837 while (e2 && strcmp (e1->pattern, e2->pattern) == 0)
7839 if (e1->mask == e2->mask)
7840 einfo (_("%X%P: duplicate expression `%s'"
7841 " in version information\n"), e1->pattern);
7845 else if (!e1->literal)
7846 for (e2 = t->locals.remaining; e2 != NULL; e2 = e2->next)
7847 if (strcmp (e1->pattern, e2->pattern) == 0
7848 && e1->mask == e2->mask)
7849 einfo (_("%X%P: duplicate expression `%s'"
7850 " in version information\n"), e1->pattern);
7854 for (e1 = version->locals.list; e1 != NULL; e1 = e1->next)
7856 for (t = link_info.version_info; t != NULL; t = t->next)
7858 struct bfd_elf_version_expr *e2;
7860 if (t->globals.htab && e1->literal)
7862 e2 = (struct bfd_elf_version_expr *)
7863 htab_find ((htab_t) t->globals.htab, e1);
7864 while (e2 && strcmp (e1->pattern, e2->pattern) == 0)
7866 if (e1->mask == e2->mask)
7867 einfo (_("%X%P: duplicate expression `%s'"
7868 " in version information\n"),
7873 else if (!e1->literal)
7874 for (e2 = t->globals.remaining; e2 != NULL; e2 = e2->next)
7875 if (strcmp (e1->pattern, e2->pattern) == 0
7876 && e1->mask == e2->mask)
7877 einfo (_("%X%P: duplicate expression `%s'"
7878 " in version information\n"), e1->pattern);
7882 version->deps = deps;
7883 version->name = name;
7884 if (name[0] != '\0')
7887 version->vernum = version_index;
7890 version->vernum = 0;
7892 for (pp = &link_info.version_info; *pp != NULL; pp = &(*pp)->next)
7897 /* This is called when we see a version dependency. */
7899 struct bfd_elf_version_deps *
7900 lang_add_vers_depend (struct bfd_elf_version_deps *list, const char *name)
7902 struct bfd_elf_version_deps *ret;
7903 struct bfd_elf_version_tree *t;
7905 ret = (struct bfd_elf_version_deps *) xmalloc (sizeof *ret);
7908 for (t = link_info.version_info; t != NULL; t = t->next)
7910 if (strcmp (t->name, name) == 0)
7912 ret->version_needed = t;
7917 einfo (_("%X%P: unable to find version dependency `%s'\n"), name);
7919 ret->version_needed = NULL;
7924 lang_do_version_exports_section (void)
7926 struct bfd_elf_version_expr *greg = NULL, *lreg;
7928 LANG_FOR_EACH_INPUT_STATEMENT (is)
7930 asection *sec = bfd_get_section_by_name (is->the_bfd, ".exports");
7938 contents = (char *) xmalloc (len);
7939 if (!bfd_get_section_contents (is->the_bfd, sec, contents, 0, len))
7940 einfo (_("%X%P: unable to read .exports section contents\n"), sec);
7943 while (p < contents + len)
7945 greg = lang_new_vers_pattern (greg, p, NULL, FALSE);
7946 p = strchr (p, '\0') + 1;
7949 /* Do not free the contents, as we used them creating the regex. */
7951 /* Do not include this section in the link. */
7952 sec->flags |= SEC_EXCLUDE | SEC_KEEP;
7955 lreg = lang_new_vers_pattern (NULL, "*", NULL, FALSE);
7956 lang_register_vers_node (command_line.version_exports_section,
7957 lang_new_vers_node (greg, lreg), NULL);
7961 lang_add_unique (const char *name)
7963 struct unique_sections *ent;
7965 for (ent = unique_section_list; ent; ent = ent->next)
7966 if (strcmp (ent->name, name) == 0)
7969 ent = (struct unique_sections *) xmalloc (sizeof *ent);
7970 ent->name = xstrdup (name);
7971 ent->next = unique_section_list;
7972 unique_section_list = ent;
7975 /* Append the list of dynamic symbols to the existing one. */
7978 lang_append_dynamic_list (struct bfd_elf_version_expr *dynamic)
7980 if (link_info.dynamic_list)
7982 struct bfd_elf_version_expr *tail;
7983 for (tail = dynamic; tail->next != NULL; tail = tail->next)
7985 tail->next = link_info.dynamic_list->head.list;
7986 link_info.dynamic_list->head.list = dynamic;
7990 struct bfd_elf_dynamic_list *d;
7992 d = (struct bfd_elf_dynamic_list *) xcalloc (1, sizeof *d);
7993 d->head.list = dynamic;
7994 d->match = lang_vers_match;
7995 link_info.dynamic_list = d;
7999 /* Append the list of C++ typeinfo dynamic symbols to the existing
8003 lang_append_dynamic_list_cpp_typeinfo (void)
8005 const char * symbols [] =
8007 "typeinfo name for*",
8010 struct bfd_elf_version_expr *dynamic = NULL;
8013 for (i = 0; i < ARRAY_SIZE (symbols); i++)
8014 dynamic = lang_new_vers_pattern (dynamic, symbols [i], "C++",
8017 lang_append_dynamic_list (dynamic);
8020 /* Append the list of C++ operator new and delete dynamic symbols to the
8024 lang_append_dynamic_list_cpp_new (void)
8026 const char * symbols [] =
8031 struct bfd_elf_version_expr *dynamic = NULL;
8034 for (i = 0; i < ARRAY_SIZE (symbols); i++)
8035 dynamic = lang_new_vers_pattern (dynamic, symbols [i], "C++",
8038 lang_append_dynamic_list (dynamic);
8041 /* Scan a space and/or comma separated string of features. */
8044 lang_ld_feature (char *str)
8052 while (*p == ',' || ISSPACE (*p))
8057 while (*q && *q != ',' && !ISSPACE (*q))
8061 if (strcasecmp (p, "SANE_EXPR") == 0)
8062 config.sane_expr = TRUE;
8064 einfo (_("%X%P: unknown feature `%s'\n"), p);