1 /* Linker command language support.
2 Copyright 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
4 Free Software Foundation, Inc.
6 This file is part of the GNU Binutils.
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software
20 Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
21 MA 02110-1301, USA. */
25 #include "libiberty.h"
26 #include "safe-ctype.h"
45 #define offsetof(TYPE, MEMBER) ((size_t) & (((TYPE*) 0)->MEMBER))
48 /* Locals variables. */
49 static struct obstack stat_obstack;
50 static struct obstack map_obstack;
52 #define obstack_chunk_alloc xmalloc
53 #define obstack_chunk_free free
54 static const char *startup_file;
55 static const char *entry_symbol_default = "start";
56 static bfd_boolean placed_commons = FALSE;
57 static bfd_boolean stripped_excluded_sections = FALSE;
58 static lang_output_section_statement_type *default_common_section;
59 static bfd_boolean map_option_f;
60 static bfd_vma print_dot;
61 static lang_input_statement_type *first_file;
62 static const char *current_target;
63 static lang_statement_list_type statement_list;
64 static struct bfd_hash_table lang_definedness_table;
65 static lang_statement_list_type *stat_save[10];
66 static lang_statement_list_type **stat_save_ptr = &stat_save[0];
68 /* Forward declarations. */
69 static void exp_init_os (etree_type *);
70 static void init_map_userdata (bfd *, asection *, void *);
71 static lang_input_statement_type *lookup_name (const char *);
72 static struct bfd_hash_entry *lang_definedness_newfunc
73 (struct bfd_hash_entry *, struct bfd_hash_table *, const char *);
74 static void insert_undefined (const char *);
75 static bfd_boolean sort_def_symbol (struct bfd_link_hash_entry *, void *);
76 static void print_statement (lang_statement_union_type *,
77 lang_output_section_statement_type *);
78 static void print_statement_list (lang_statement_union_type *,
79 lang_output_section_statement_type *);
80 static void print_statements (void);
81 static void print_input_section (asection *, bfd_boolean);
82 static bfd_boolean lang_one_common (struct bfd_link_hash_entry *, void *);
83 static void lang_record_phdrs (void);
84 static void lang_do_version_exports_section (void);
85 static void lang_finalize_version_expr_head
86 (struct bfd_elf_version_expr_head *);
88 /* Exported variables. */
89 const char *output_target;
90 lang_output_section_statement_type *abs_output_section;
91 lang_statement_list_type lang_output_section_statement;
92 lang_statement_list_type *stat_ptr = &statement_list;
93 lang_statement_list_type file_chain = { NULL, NULL };
94 lang_statement_list_type input_file_chain;
95 struct bfd_sym_chain entry_symbol = { NULL, NULL };
96 const char *entry_section = ".text";
97 bfd_boolean entry_from_cmdline;
98 bfd_boolean lang_has_input_file = FALSE;
99 bfd_boolean had_output_filename = FALSE;
100 bfd_boolean lang_float_flag = FALSE;
101 bfd_boolean delete_output_file_on_failure = FALSE;
102 struct lang_phdr *lang_phdr_list;
103 struct lang_nocrossrefs *nocrossref_list;
104 static struct unique_sections *unique_section_list;
105 static bfd_boolean ldlang_sysrooted_script = FALSE;
107 /* Functions that traverse the linker script and might evaluate
108 DEFINED() need to increment this. */
109 int lang_statement_iteration = 0;
111 etree_type *base; /* Relocation base - or null */
113 /* Return TRUE if the PATTERN argument is a wildcard pattern.
114 Although backslashes are treated specially if a pattern contains
115 wildcards, we do not consider the mere presence of a backslash to
116 be enough to cause the pattern to be treated as a wildcard.
117 That lets us handle DOS filenames more naturally. */
118 #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL)
120 #define new_stat(x, y) \
121 (x##_type *) new_statement (x##_enum, sizeof (x##_type), y)
123 #define outside_section_address(q) \
124 ((q)->output_offset + (q)->output_section->vma)
126 #define outside_symbol_address(q) \
127 ((q)->value + outside_section_address (q->section))
129 #define SECTION_NAME_MAP_LENGTH (16)
132 stat_alloc (size_t size)
134 return obstack_alloc (&stat_obstack, size);
138 name_match (const char *pattern, const char *name)
140 if (wildcardp (pattern))
141 return fnmatch (pattern, name, 0);
142 return strcmp (pattern, name);
145 /* If PATTERN is of the form archive:file, return a pointer to the
146 separator. If not, return NULL. */
149 archive_path (const char *pattern)
153 if (link_info.path_separator == 0)
156 p = strchr (pattern, link_info.path_separator);
157 #ifdef HAVE_DOS_BASED_FILE_SYSTEM
158 if (p == NULL || link_info.path_separator != ':')
161 /* Assume a match on the second char is part of drive specifier,
162 as in "c:\silly.dos". */
163 if (p == pattern + 1 && ISALPHA (*pattern))
164 p = strchr (p + 1, link_info.path_separator);
169 /* Given that FILE_SPEC results in a non-NULL SEP result from archive_path,
170 return whether F matches FILE_SPEC. */
173 input_statement_is_archive_path (const char *file_spec, char *sep,
174 lang_input_statement_type *f)
176 bfd_boolean match = FALSE;
179 || name_match (sep + 1, f->filename) == 0)
180 && ((sep != file_spec)
181 == (f->the_bfd != NULL && f->the_bfd->my_archive != NULL)))
185 if (sep != file_spec)
187 const char *aname = f->the_bfd->my_archive->filename;
189 match = name_match (file_spec, aname) == 0;
190 *sep = link_info.path_separator;
197 unique_section_p (const asection *sec)
199 struct unique_sections *unam;
202 if (link_info.relocatable
203 && sec->owner != NULL
204 && bfd_is_group_section (sec->owner, sec))
208 for (unam = unique_section_list; unam; unam = unam->next)
209 if (name_match (unam->name, secnam) == 0)
215 /* Generic traversal routines for finding matching sections. */
217 /* Try processing a section against a wildcard. This just calls
218 the callback unless the filename exclusion list is present
219 and excludes the file. It's hardly ever present so this
220 function is very fast. */
223 walk_wild_consider_section (lang_wild_statement_type *ptr,
224 lang_input_statement_type *file,
226 struct wildcard_list *sec,
230 struct name_list *list_tmp;
232 /* Don't process sections from files which were excluded. */
233 for (list_tmp = sec->spec.exclude_name_list;
235 list_tmp = list_tmp->next)
237 char *p = archive_path (list_tmp->name);
241 if (input_statement_is_archive_path (list_tmp->name, p, file))
245 else if (name_match (list_tmp->name, file->filename) == 0)
248 /* FIXME: Perhaps remove the following at some stage? Matching
249 unadorned archives like this was never documented and has
250 been superceded by the archive:path syntax. */
251 else if (file->the_bfd != NULL
252 && file->the_bfd->my_archive != NULL
253 && name_match (list_tmp->name,
254 file->the_bfd->my_archive->filename) == 0)
258 (*callback) (ptr, sec, s, file, data);
261 /* Lowest common denominator routine that can handle everything correctly,
265 walk_wild_section_general (lang_wild_statement_type *ptr,
266 lang_input_statement_type *file,
271 struct wildcard_list *sec;
273 for (s = file->the_bfd->sections; s != NULL; s = s->next)
275 sec = ptr->section_list;
277 (*callback) (ptr, sec, s, file, data);
281 bfd_boolean skip = FALSE;
283 if (sec->spec.name != NULL)
285 const char *sname = bfd_get_section_name (file->the_bfd, s);
287 skip = name_match (sec->spec.name, sname) != 0;
291 walk_wild_consider_section (ptr, file, s, sec, callback, data);
298 /* Routines to find a single section given its name. If there's more
299 than one section with that name, we report that. */
303 asection *found_section;
304 bfd_boolean multiple_sections_found;
305 } section_iterator_callback_data;
308 section_iterator_callback (bfd *bfd ATTRIBUTE_UNUSED, asection *s, void *data)
310 section_iterator_callback_data *d = (section_iterator_callback_data *) data;
312 if (d->found_section != NULL)
314 d->multiple_sections_found = TRUE;
318 d->found_section = s;
323 find_section (lang_input_statement_type *file,
324 struct wildcard_list *sec,
325 bfd_boolean *multiple_sections_found)
327 section_iterator_callback_data cb_data = { NULL, FALSE };
329 bfd_get_section_by_name_if (file->the_bfd, sec->spec.name,
330 section_iterator_callback, &cb_data);
331 *multiple_sections_found = cb_data.multiple_sections_found;
332 return cb_data.found_section;
335 /* Code for handling simple wildcards without going through fnmatch,
336 which can be expensive because of charset translations etc. */
338 /* A simple wild is a literal string followed by a single '*',
339 where the literal part is at least 4 characters long. */
342 is_simple_wild (const char *name)
344 size_t len = strcspn (name, "*?[");
345 return len >= 4 && name[len] == '*' && name[len + 1] == '\0';
349 match_simple_wild (const char *pattern, const char *name)
351 /* The first four characters of the pattern are guaranteed valid
352 non-wildcard characters. So we can go faster. */
353 if (pattern[0] != name[0] || pattern[1] != name[1]
354 || pattern[2] != name[2] || pattern[3] != name[3])
359 while (*pattern != '*')
360 if (*name++ != *pattern++)
366 /* Compare sections ASEC and BSEC according to SORT. */
369 compare_section (sort_type sort, asection *asec, asection *bsec)
378 case by_alignment_name:
379 ret = (bfd_section_alignment (bsec->owner, bsec)
380 - bfd_section_alignment (asec->owner, asec));
386 ret = strcmp (bfd_get_section_name (asec->owner, asec),
387 bfd_get_section_name (bsec->owner, bsec));
390 case by_name_alignment:
391 ret = strcmp (bfd_get_section_name (asec->owner, asec),
392 bfd_get_section_name (bsec->owner, bsec));
398 ret = (bfd_section_alignment (bsec->owner, bsec)
399 - bfd_section_alignment (asec->owner, asec));
406 /* Build a Binary Search Tree to sort sections, unlike insertion sort
407 used in wild_sort(). BST is considerably faster if the number of
408 of sections are large. */
410 static lang_section_bst_type **
411 wild_sort_fast (lang_wild_statement_type *wild,
412 struct wildcard_list *sec,
413 lang_input_statement_type *file ATTRIBUTE_UNUSED,
416 lang_section_bst_type **tree;
419 if (!wild->filenames_sorted
420 && (sec == NULL || sec->spec.sorted == none))
422 /* Append at the right end of tree. */
424 tree = &((*tree)->right);
430 /* Find the correct node to append this section. */
431 if (compare_section (sec->spec.sorted, section, (*tree)->section) < 0)
432 tree = &((*tree)->left);
434 tree = &((*tree)->right);
440 /* Use wild_sort_fast to build a BST to sort sections. */
443 output_section_callback_fast (lang_wild_statement_type *ptr,
444 struct wildcard_list *sec,
446 lang_input_statement_type *file,
447 void *output ATTRIBUTE_UNUSED)
449 lang_section_bst_type *node;
450 lang_section_bst_type **tree;
452 if (unique_section_p (section))
455 node = (lang_section_bst_type *) xmalloc (sizeof (lang_section_bst_type));
458 node->section = section;
460 tree = wild_sort_fast (ptr, sec, file, section);
465 /* Convert a sorted sections' BST back to list form. */
468 output_section_callback_tree_to_list (lang_wild_statement_type *ptr,
469 lang_section_bst_type *tree,
473 output_section_callback_tree_to_list (ptr, tree->left, output);
475 lang_add_section (&ptr->children, tree->section,
476 (lang_output_section_statement_type *) output);
479 output_section_callback_tree_to_list (ptr, tree->right, output);
484 /* Specialized, optimized routines for handling different kinds of
488 walk_wild_section_specs1_wild0 (lang_wild_statement_type *ptr,
489 lang_input_statement_type *file,
493 /* We can just do a hash lookup for the section with the right name.
494 But if that lookup discovers more than one section with the name
495 (should be rare), we fall back to the general algorithm because
496 we would otherwise have to sort the sections to make sure they
497 get processed in the bfd's order. */
498 bfd_boolean multiple_sections_found;
499 struct wildcard_list *sec0 = ptr->handler_data[0];
500 asection *s0 = find_section (file, sec0, &multiple_sections_found);
502 if (multiple_sections_found)
503 walk_wild_section_general (ptr, file, callback, data);
505 walk_wild_consider_section (ptr, file, s0, sec0, callback, data);
509 walk_wild_section_specs1_wild1 (lang_wild_statement_type *ptr,
510 lang_input_statement_type *file,
515 struct wildcard_list *wildsec0 = ptr->handler_data[0];
517 for (s = file->the_bfd->sections; s != NULL; s = s->next)
519 const char *sname = bfd_get_section_name (file->the_bfd, s);
520 bfd_boolean skip = !match_simple_wild (wildsec0->spec.name, sname);
523 walk_wild_consider_section (ptr, file, s, wildsec0, callback, data);
528 walk_wild_section_specs2_wild1 (lang_wild_statement_type *ptr,
529 lang_input_statement_type *file,
534 struct wildcard_list *sec0 = ptr->handler_data[0];
535 struct wildcard_list *wildsec1 = ptr->handler_data[1];
536 bfd_boolean multiple_sections_found;
537 asection *s0 = find_section (file, sec0, &multiple_sections_found);
539 if (multiple_sections_found)
541 walk_wild_section_general (ptr, file, callback, data);
545 /* Note that if the section was not found, s0 is NULL and
546 we'll simply never succeed the s == s0 test below. */
547 for (s = file->the_bfd->sections; s != NULL; s = s->next)
549 /* Recall that in this code path, a section cannot satisfy more
550 than one spec, so if s == s0 then it cannot match
553 walk_wild_consider_section (ptr, file, s, sec0, callback, data);
556 const char *sname = bfd_get_section_name (file->the_bfd, s);
557 bfd_boolean skip = !match_simple_wild (wildsec1->spec.name, sname);
560 walk_wild_consider_section (ptr, file, s, wildsec1, callback,
567 walk_wild_section_specs3_wild2 (lang_wild_statement_type *ptr,
568 lang_input_statement_type *file,
573 struct wildcard_list *sec0 = ptr->handler_data[0];
574 struct wildcard_list *wildsec1 = ptr->handler_data[1];
575 struct wildcard_list *wildsec2 = ptr->handler_data[2];
576 bfd_boolean multiple_sections_found;
577 asection *s0 = find_section (file, sec0, &multiple_sections_found);
579 if (multiple_sections_found)
581 walk_wild_section_general (ptr, file, callback, data);
585 for (s = file->the_bfd->sections; s != NULL; s = s->next)
588 walk_wild_consider_section (ptr, file, s, sec0, callback, data);
591 const char *sname = bfd_get_section_name (file->the_bfd, s);
592 bfd_boolean skip = !match_simple_wild (wildsec1->spec.name, sname);
595 walk_wild_consider_section (ptr, file, s, wildsec1, callback, data);
598 skip = !match_simple_wild (wildsec2->spec.name, sname);
600 walk_wild_consider_section (ptr, file, s, wildsec2, callback,
608 walk_wild_section_specs4_wild2 (lang_wild_statement_type *ptr,
609 lang_input_statement_type *file,
614 struct wildcard_list *sec0 = ptr->handler_data[0];
615 struct wildcard_list *sec1 = ptr->handler_data[1];
616 struct wildcard_list *wildsec2 = ptr->handler_data[2];
617 struct wildcard_list *wildsec3 = ptr->handler_data[3];
618 bfd_boolean multiple_sections_found;
619 asection *s0 = find_section (file, sec0, &multiple_sections_found), *s1;
621 if (multiple_sections_found)
623 walk_wild_section_general (ptr, file, callback, data);
627 s1 = find_section (file, sec1, &multiple_sections_found);
628 if (multiple_sections_found)
630 walk_wild_section_general (ptr, file, callback, data);
634 for (s = file->the_bfd->sections; s != NULL; s = s->next)
637 walk_wild_consider_section (ptr, file, s, sec0, callback, data);
640 walk_wild_consider_section (ptr, file, s, sec1, callback, data);
643 const char *sname = bfd_get_section_name (file->the_bfd, s);
644 bfd_boolean skip = !match_simple_wild (wildsec2->spec.name,
648 walk_wild_consider_section (ptr, file, s, wildsec2, callback,
652 skip = !match_simple_wild (wildsec3->spec.name, sname);
654 walk_wild_consider_section (ptr, file, s, wildsec3,
662 walk_wild_section (lang_wild_statement_type *ptr,
663 lang_input_statement_type *file,
667 if (file->just_syms_flag)
670 (*ptr->walk_wild_section_handler) (ptr, file, callback, data);
673 /* Returns TRUE when name1 is a wildcard spec that might match
674 something name2 can match. We're conservative: we return FALSE
675 only if the prefixes of name1 and name2 are different up to the
676 first wildcard character. */
679 wild_spec_can_overlap (const char *name1, const char *name2)
681 size_t prefix1_len = strcspn (name1, "?*[");
682 size_t prefix2_len = strcspn (name2, "?*[");
683 size_t min_prefix_len;
685 /* Note that if there is no wildcard character, then we treat the
686 terminating 0 as part of the prefix. Thus ".text" won't match
687 ".text." or ".text.*", for example. */
688 if (name1[prefix1_len] == '\0')
690 if (name2[prefix2_len] == '\0')
693 min_prefix_len = prefix1_len < prefix2_len ? prefix1_len : prefix2_len;
695 return memcmp (name1, name2, min_prefix_len) == 0;
698 /* Select specialized code to handle various kinds of wildcard
702 analyze_walk_wild_section_handler (lang_wild_statement_type *ptr)
705 int wild_name_count = 0;
706 struct wildcard_list *sec;
710 ptr->walk_wild_section_handler = walk_wild_section_general;
711 ptr->handler_data[0] = NULL;
712 ptr->handler_data[1] = NULL;
713 ptr->handler_data[2] = NULL;
714 ptr->handler_data[3] = NULL;
717 /* Count how many wildcard_specs there are, and how many of those
718 actually use wildcards in the name. Also, bail out if any of the
719 wildcard names are NULL. (Can this actually happen?
720 walk_wild_section used to test for it.) And bail out if any
721 of the wildcards are more complex than a simple string
722 ending in a single '*'. */
723 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
726 if (sec->spec.name == NULL)
728 if (wildcardp (sec->spec.name))
731 if (!is_simple_wild (sec->spec.name))
736 /* The zero-spec case would be easy to optimize but it doesn't
737 happen in practice. Likewise, more than 4 specs doesn't
738 happen in practice. */
739 if (sec_count == 0 || sec_count > 4)
742 /* Check that no two specs can match the same section. */
743 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
745 struct wildcard_list *sec2;
746 for (sec2 = sec->next; sec2 != NULL; sec2 = sec2->next)
748 if (wild_spec_can_overlap (sec->spec.name, sec2->spec.name))
753 signature = (sec_count << 8) + wild_name_count;
757 ptr->walk_wild_section_handler = walk_wild_section_specs1_wild0;
760 ptr->walk_wild_section_handler = walk_wild_section_specs1_wild1;
763 ptr->walk_wild_section_handler = walk_wild_section_specs2_wild1;
766 ptr->walk_wild_section_handler = walk_wild_section_specs3_wild2;
769 ptr->walk_wild_section_handler = walk_wild_section_specs4_wild2;
775 /* Now fill the data array with pointers to the specs, first the
776 specs with non-wildcard names, then the specs with wildcard
777 names. It's OK to process the specs in different order from the
778 given order, because we've already determined that no section
779 will match more than one spec. */
781 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
782 if (!wildcardp (sec->spec.name))
783 ptr->handler_data[data_counter++] = sec;
784 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
785 if (wildcardp (sec->spec.name))
786 ptr->handler_data[data_counter++] = sec;
789 /* Handle a wild statement for a single file F. */
792 walk_wild_file (lang_wild_statement_type *s,
793 lang_input_statement_type *f,
797 if (f->the_bfd == NULL
798 || ! bfd_check_format (f->the_bfd, bfd_archive))
799 walk_wild_section (s, f, callback, data);
804 /* This is an archive file. We must map each member of the
805 archive separately. */
806 member = bfd_openr_next_archived_file (f->the_bfd, NULL);
807 while (member != NULL)
809 /* When lookup_name is called, it will call the add_symbols
810 entry point for the archive. For each element of the
811 archive which is included, BFD will call ldlang_add_file,
812 which will set the usrdata field of the member to the
813 lang_input_statement. */
814 if (member->usrdata != NULL)
816 walk_wild_section (s,
817 (lang_input_statement_type *) member->usrdata,
821 member = bfd_openr_next_archived_file (f->the_bfd, member);
827 walk_wild (lang_wild_statement_type *s, callback_t callback, void *data)
829 const char *file_spec = s->filename;
832 if (file_spec == NULL)
834 /* Perform the iteration over all files in the list. */
835 LANG_FOR_EACH_INPUT_STATEMENT (f)
837 walk_wild_file (s, f, callback, data);
840 else if ((p = archive_path (file_spec)) != NULL)
842 LANG_FOR_EACH_INPUT_STATEMENT (f)
844 if (input_statement_is_archive_path (file_spec, p, f))
845 walk_wild_file (s, f, callback, data);
848 else if (wildcardp (file_spec))
850 LANG_FOR_EACH_INPUT_STATEMENT (f)
852 if (fnmatch (file_spec, f->filename, 0) == 0)
853 walk_wild_file (s, f, callback, data);
858 lang_input_statement_type *f;
860 /* Perform the iteration over a single file. */
861 f = lookup_name (file_spec);
863 walk_wild_file (s, f, callback, data);
867 /* lang_for_each_statement walks the parse tree and calls the provided
868 function for each node. */
871 lang_for_each_statement_worker (void (*func) (lang_statement_union_type *),
872 lang_statement_union_type *s)
874 for (; s != NULL; s = s->header.next)
878 switch (s->header.type)
880 case lang_constructors_statement_enum:
881 lang_for_each_statement_worker (func, constructor_list.head);
883 case lang_output_section_statement_enum:
884 lang_for_each_statement_worker
885 (func, s->output_section_statement.children.head);
887 case lang_wild_statement_enum:
888 lang_for_each_statement_worker (func,
889 s->wild_statement.children.head);
891 case lang_group_statement_enum:
892 lang_for_each_statement_worker (func,
893 s->group_statement.children.head);
895 case lang_data_statement_enum:
896 case lang_reloc_statement_enum:
897 case lang_object_symbols_statement_enum:
898 case lang_output_statement_enum:
899 case lang_target_statement_enum:
900 case lang_input_section_enum:
901 case lang_input_statement_enum:
902 case lang_assignment_statement_enum:
903 case lang_padding_statement_enum:
904 case lang_address_statement_enum:
905 case lang_fill_statement_enum:
906 case lang_insert_statement_enum:
916 lang_for_each_statement (void (*func) (lang_statement_union_type *))
918 lang_for_each_statement_worker (func, statement_list.head);
921 /*----------------------------------------------------------------------*/
924 lang_list_init (lang_statement_list_type *list)
927 list->tail = &list->head;
931 push_stat_ptr (lang_statement_list_type *new_ptr)
933 if (stat_save_ptr >= stat_save + sizeof (stat_save) / sizeof (stat_save[0]))
935 *stat_save_ptr++ = stat_ptr;
942 if (stat_save_ptr <= stat_save)
944 stat_ptr = *--stat_save_ptr;
947 /* Build a new statement node for the parse tree. */
949 static lang_statement_union_type *
950 new_statement (enum statement_enum type,
952 lang_statement_list_type *list)
954 lang_statement_union_type *new_stmt;
956 new_stmt = (lang_statement_union_type *) stat_alloc (size);
957 new_stmt->header.type = type;
958 new_stmt->header.next = NULL;
959 lang_statement_append (list, new_stmt, &new_stmt->header.next);
963 /* Build a new input file node for the language. There are several
964 ways in which we treat an input file, eg, we only look at symbols,
965 or prefix it with a -l etc.
967 We can be supplied with requests for input files more than once;
968 they may, for example be split over several lines like foo.o(.text)
969 foo.o(.data) etc, so when asked for a file we check that we haven't
970 got it already so we don't duplicate the bfd. */
972 static lang_input_statement_type *
973 new_afile (const char *name,
974 lang_input_file_enum_type file_type,
976 bfd_boolean add_to_list)
978 lang_input_statement_type *p;
981 p = (lang_input_statement_type *) new_stat (lang_input_statement, stat_ptr);
984 p = (lang_input_statement_type *)
985 stat_alloc (sizeof (lang_input_statement_type));
986 p->header.type = lang_input_statement_enum;
987 p->header.next = NULL;
990 lang_has_input_file = TRUE;
992 p->sysrooted = FALSE;
994 if (file_type == lang_input_file_is_l_enum
995 && name[0] == ':' && name[1] != '\0')
997 file_type = lang_input_file_is_search_file_enum;
1003 case lang_input_file_is_symbols_only_enum:
1005 p->is_archive = FALSE;
1007 p->local_sym_name = name;
1008 p->just_syms_flag = TRUE;
1009 p->search_dirs_flag = FALSE;
1011 case lang_input_file_is_fake_enum:
1013 p->is_archive = FALSE;
1015 p->local_sym_name = name;
1016 p->just_syms_flag = FALSE;
1017 p->search_dirs_flag = FALSE;
1019 case lang_input_file_is_l_enum:
1020 p->is_archive = TRUE;
1023 p->local_sym_name = concat ("-l", name, (const char *) NULL);
1024 p->just_syms_flag = FALSE;
1025 p->search_dirs_flag = TRUE;
1027 case lang_input_file_is_marker_enum:
1029 p->is_archive = FALSE;
1031 p->local_sym_name = name;
1032 p->just_syms_flag = FALSE;
1033 p->search_dirs_flag = TRUE;
1035 case lang_input_file_is_search_file_enum:
1036 p->sysrooted = ldlang_sysrooted_script;
1038 p->is_archive = FALSE;
1040 p->local_sym_name = name;
1041 p->just_syms_flag = FALSE;
1042 p->search_dirs_flag = TRUE;
1044 case lang_input_file_is_file_enum:
1046 p->is_archive = FALSE;
1048 p->local_sym_name = name;
1049 p->just_syms_flag = FALSE;
1050 p->search_dirs_flag = FALSE;
1056 p->next_real_file = NULL;
1058 p->dynamic = config.dynamic_link;
1059 p->add_needed = add_needed;
1060 p->as_needed = as_needed;
1061 p->whole_archive = whole_archive;
1063 lang_statement_append (&input_file_chain,
1064 (lang_statement_union_type *) p,
1065 &p->next_real_file);
1069 lang_input_statement_type *
1070 lang_add_input_file (const char *name,
1071 lang_input_file_enum_type file_type,
1074 return new_afile (name, file_type, target, TRUE);
1077 struct out_section_hash_entry
1079 struct bfd_hash_entry root;
1080 lang_statement_union_type s;
1083 /* The hash table. */
1085 static struct bfd_hash_table output_section_statement_table;
1087 /* Support routines for the hash table used by lang_output_section_find,
1088 initialize the table, fill in an entry and remove the table. */
1090 static struct bfd_hash_entry *
1091 output_section_statement_newfunc (struct bfd_hash_entry *entry,
1092 struct bfd_hash_table *table,
1095 lang_output_section_statement_type **nextp;
1096 struct out_section_hash_entry *ret;
1100 entry = (struct bfd_hash_entry *) bfd_hash_allocate (table,
1106 entry = bfd_hash_newfunc (entry, table, string);
1110 ret = (struct out_section_hash_entry *) entry;
1111 memset (&ret->s, 0, sizeof (ret->s));
1112 ret->s.header.type = lang_output_section_statement_enum;
1113 ret->s.output_section_statement.subsection_alignment = -1;
1114 ret->s.output_section_statement.section_alignment = -1;
1115 ret->s.output_section_statement.block_value = 1;
1116 lang_list_init (&ret->s.output_section_statement.children);
1117 lang_statement_append (stat_ptr, &ret->s, &ret->s.header.next);
1119 /* For every output section statement added to the list, except the
1120 first one, lang_output_section_statement.tail points to the "next"
1121 field of the last element of the list. */
1122 if (lang_output_section_statement.head != NULL)
1123 ret->s.output_section_statement.prev
1124 = ((lang_output_section_statement_type *)
1125 ((char *) lang_output_section_statement.tail
1126 - offsetof (lang_output_section_statement_type, next)));
1128 /* GCC's strict aliasing rules prevent us from just casting the
1129 address, so we store the pointer in a variable and cast that
1131 nextp = &ret->s.output_section_statement.next;
1132 lang_statement_append (&lang_output_section_statement,
1134 (lang_statement_union_type **) nextp);
1139 output_section_statement_table_init (void)
1141 if (!bfd_hash_table_init_n (&output_section_statement_table,
1142 output_section_statement_newfunc,
1143 sizeof (struct out_section_hash_entry),
1145 einfo (_("%P%F: can not create hash table: %E\n"));
1149 output_section_statement_table_free (void)
1151 bfd_hash_table_free (&output_section_statement_table);
1154 /* Build enough state so that the parser can build its tree. */
1159 obstack_begin (&stat_obstack, 1000);
1161 stat_ptr = &statement_list;
1163 output_section_statement_table_init ();
1165 lang_list_init (stat_ptr);
1167 lang_list_init (&input_file_chain);
1168 lang_list_init (&lang_output_section_statement);
1169 lang_list_init (&file_chain);
1170 first_file = lang_add_input_file (NULL, lang_input_file_is_marker_enum,
1172 abs_output_section =
1173 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME, 0, TRUE);
1175 abs_output_section->bfd_section = bfd_abs_section_ptr;
1177 /* The value "3" is ad-hoc, somewhat related to the expected number of
1178 DEFINED expressions in a linker script. For most default linker
1179 scripts, there are none. Why a hash table then? Well, it's somewhat
1180 simpler to re-use working machinery than using a linked list in terms
1181 of code-complexity here in ld, besides the initialization which just
1182 looks like other code here. */
1183 if (!bfd_hash_table_init_n (&lang_definedness_table,
1184 lang_definedness_newfunc,
1185 sizeof (struct lang_definedness_hash_entry),
1187 einfo (_("%P%F: can not create hash table: %E\n"));
1193 output_section_statement_table_free ();
1196 /*----------------------------------------------------------------------
1197 A region is an area of memory declared with the
1198 MEMORY { name:org=exp, len=exp ... }
1201 We maintain a list of all the regions here.
1203 If no regions are specified in the script, then the default is used
1204 which is created when looked up to be the entire data space.
1206 If create is true we are creating a region inside a MEMORY block.
1207 In this case it is probably an error to create a region that has
1208 already been created. If we are not inside a MEMORY block it is
1209 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1210 and so we issue a warning.
1212 Each region has at least one name. The first name is either
1213 DEFAULT_MEMORY_REGION or the name given in the MEMORY block. You can add
1214 alias names to an existing region within a script with
1215 REGION_ALIAS (alias, region_name). Each name corresponds to at most one
1218 static lang_memory_region_type *lang_memory_region_list;
1219 static lang_memory_region_type **lang_memory_region_list_tail
1220 = &lang_memory_region_list;
1222 lang_memory_region_type *
1223 lang_memory_region_lookup (const char *const name, bfd_boolean create)
1225 lang_memory_region_name *n;
1226 lang_memory_region_type *r;
1227 lang_memory_region_type *new_region;
1229 /* NAME is NULL for LMA memspecs if no region was specified. */
1233 for (r = lang_memory_region_list; r != NULL; r = r->next)
1234 for (n = &r->name_list; n != NULL; n = n->next)
1235 if (strcmp (n->name, name) == 0)
1238 einfo (_("%P:%S: warning: redeclaration of memory region `%s'\n"),
1243 if (!create && strcmp (name, DEFAULT_MEMORY_REGION))
1244 einfo (_("%P:%S: warning: memory region `%s' not declared\n"), name);
1246 new_region = (lang_memory_region_type *)
1247 stat_alloc (sizeof (lang_memory_region_type));
1249 new_region->name_list.name = xstrdup (name);
1250 new_region->name_list.next = NULL;
1251 new_region->next = NULL;
1252 new_region->origin = 0;
1253 new_region->length = ~(bfd_size_type) 0;
1254 new_region->current = 0;
1255 new_region->last_os = NULL;
1256 new_region->flags = 0;
1257 new_region->not_flags = 0;
1258 new_region->had_full_message = FALSE;
1260 *lang_memory_region_list_tail = new_region;
1261 lang_memory_region_list_tail = &new_region->next;
1267 lang_memory_region_alias (const char * alias, const char * region_name)
1269 lang_memory_region_name * n;
1270 lang_memory_region_type * r;
1271 lang_memory_region_type * region;
1273 /* The default region must be unique. This ensures that it is not necessary
1274 to iterate through the name list if someone wants the check if a region is
1275 the default memory region. */
1276 if (strcmp (region_name, DEFAULT_MEMORY_REGION) == 0
1277 || strcmp (alias, DEFAULT_MEMORY_REGION) == 0)
1278 einfo (_("%F%P:%S: error: alias for default memory region\n"));
1280 /* Look for the target region and check if the alias is not already
1283 for (r = lang_memory_region_list; r != NULL; r = r->next)
1284 for (n = &r->name_list; n != NULL; n = n->next)
1286 if (region == NULL && strcmp (n->name, region_name) == 0)
1288 if (strcmp (n->name, alias) == 0)
1289 einfo (_("%F%P:%S: error: redefinition of memory region "
1294 /* Check if the target region exists. */
1296 einfo (_("%F%P:%S: error: memory region `%s' "
1297 "for alias `%s' does not exist\n"),
1301 /* Add alias to region name list. */
1302 n = (lang_memory_region_name *) stat_alloc (sizeof (lang_memory_region_name));
1303 n->name = xstrdup (alias);
1304 n->next = region->name_list.next;
1305 region->name_list.next = n;
1308 static lang_memory_region_type *
1309 lang_memory_default (asection * section)
1311 lang_memory_region_type *p;
1313 flagword sec_flags = section->flags;
1315 /* Override SEC_DATA to mean a writable section. */
1316 if ((sec_flags & (SEC_ALLOC | SEC_READONLY | SEC_CODE)) == SEC_ALLOC)
1317 sec_flags |= SEC_DATA;
1319 for (p = lang_memory_region_list; p != NULL; p = p->next)
1321 if ((p->flags & sec_flags) != 0
1322 && (p->not_flags & sec_flags) == 0)
1327 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION, FALSE);
1330 /* Find or create an output_section_statement with the given NAME.
1331 If CONSTRAINT is non-zero match one with that constraint, otherwise
1332 match any non-negative constraint. If CREATE, always make a
1333 new output_section_statement for SPECIAL CONSTRAINT. */
1335 lang_output_section_statement_type *
1336 lang_output_section_statement_lookup (const char *name,
1340 struct out_section_hash_entry *entry;
1342 entry = ((struct out_section_hash_entry *)
1343 bfd_hash_lookup (&output_section_statement_table, name,
1348 einfo (_("%P%F: failed creating section `%s': %E\n"), name);
1352 if (entry->s.output_section_statement.name != NULL)
1354 /* We have a section of this name, but it might not have the correct
1356 struct out_section_hash_entry *last_ent;
1358 name = entry->s.output_section_statement.name;
1359 if (create && constraint == SPECIAL)
1360 /* Not traversing to the end reverses the order of the second
1361 and subsequent SPECIAL sections in the hash table chain,
1362 but that shouldn't matter. */
1367 if (constraint == entry->s.output_section_statement.constraint
1369 && entry->s.output_section_statement.constraint >= 0))
1370 return &entry->s.output_section_statement;
1372 entry = (struct out_section_hash_entry *) entry->root.next;
1374 while (entry != NULL
1375 && name == entry->s.output_section_statement.name);
1381 = ((struct out_section_hash_entry *)
1382 output_section_statement_newfunc (NULL,
1383 &output_section_statement_table,
1387 einfo (_("%P%F: failed creating section `%s': %E\n"), name);
1390 entry->root = last_ent->root;
1391 last_ent->root.next = &entry->root;
1394 entry->s.output_section_statement.name = name;
1395 entry->s.output_section_statement.constraint = constraint;
1396 return &entry->s.output_section_statement;
1399 /* Find the next output_section_statement with the same name as OS.
1400 If CONSTRAINT is non-zero, find one with that constraint otherwise
1401 match any non-negative constraint. */
1403 lang_output_section_statement_type *
1404 next_matching_output_section_statement (lang_output_section_statement_type *os,
1407 /* All output_section_statements are actually part of a
1408 struct out_section_hash_entry. */
1409 struct out_section_hash_entry *entry = (struct out_section_hash_entry *)
1411 - offsetof (struct out_section_hash_entry, s.output_section_statement));
1412 const char *name = os->name;
1414 ASSERT (name == entry->root.string);
1417 entry = (struct out_section_hash_entry *) entry->root.next;
1419 || name != entry->s.output_section_statement.name)
1422 while (constraint != entry->s.output_section_statement.constraint
1424 || entry->s.output_section_statement.constraint < 0));
1426 return &entry->s.output_section_statement;
1429 /* A variant of lang_output_section_find used by place_orphan.
1430 Returns the output statement that should precede a new output
1431 statement for SEC. If an exact match is found on certain flags,
1434 lang_output_section_statement_type *
1435 lang_output_section_find_by_flags (const asection *sec,
1436 lang_output_section_statement_type **exact,
1437 lang_match_sec_type_func match_type)
1439 lang_output_section_statement_type *first, *look, *found;
1442 /* We know the first statement on this list is *ABS*. May as well
1444 first = &lang_output_section_statement.head->output_section_statement;
1445 first = first->next;
1447 /* First try for an exact match. */
1449 for (look = first; look; look = look->next)
1451 flags = look->flags;
1452 if (look->bfd_section != NULL)
1454 flags = look->bfd_section->flags;
1455 if (match_type && !match_type (link_info.output_bfd,
1460 flags ^= sec->flags;
1461 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD | SEC_READONLY
1462 | SEC_CODE | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1472 if ((sec->flags & SEC_CODE) != 0
1473 && (sec->flags & SEC_ALLOC) != 0)
1475 /* Try for a rw code section. */
1476 for (look = first; look; look = look->next)
1478 flags = look->flags;
1479 if (look->bfd_section != NULL)
1481 flags = look->bfd_section->flags;
1482 if (match_type && !match_type (link_info.output_bfd,
1487 flags ^= sec->flags;
1488 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1489 | SEC_CODE | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1493 else if ((sec->flags & (SEC_READONLY | SEC_THREAD_LOCAL)) != 0
1494 && (sec->flags & SEC_ALLOC) != 0)
1496 /* .rodata can go after .text, .sdata2 after .rodata. */
1497 for (look = first; look; look = look->next)
1499 flags = look->flags;
1500 if (look->bfd_section != NULL)
1502 flags = look->bfd_section->flags;
1503 if (match_type && !match_type (link_info.output_bfd,
1508 flags ^= sec->flags;
1509 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1511 && !(look->flags & (SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1515 else if ((sec->flags & SEC_SMALL_DATA) != 0
1516 && (sec->flags & SEC_ALLOC) != 0)
1518 /* .sdata goes after .data, .sbss after .sdata. */
1519 for (look = first; look; look = look->next)
1521 flags = look->flags;
1522 if (look->bfd_section != NULL)
1524 flags = look->bfd_section->flags;
1525 if (match_type && !match_type (link_info.output_bfd,
1530 flags ^= sec->flags;
1531 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1532 | SEC_THREAD_LOCAL))
1533 || ((look->flags & SEC_SMALL_DATA)
1534 && !(sec->flags & SEC_HAS_CONTENTS)))
1538 else if ((sec->flags & SEC_HAS_CONTENTS) != 0
1539 && (sec->flags & SEC_ALLOC) != 0)
1541 /* .data goes after .rodata. */
1542 for (look = first; look; look = look->next)
1544 flags = look->flags;
1545 if (look->bfd_section != NULL)
1547 flags = look->bfd_section->flags;
1548 if (match_type && !match_type (link_info.output_bfd,
1553 flags ^= sec->flags;
1554 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1555 | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1559 else if ((sec->flags & SEC_ALLOC) != 0)
1561 /* .bss goes after any other alloc section. */
1562 for (look = first; look; look = look->next)
1564 flags = look->flags;
1565 if (look->bfd_section != NULL)
1567 flags = look->bfd_section->flags;
1568 if (match_type && !match_type (link_info.output_bfd,
1573 flags ^= sec->flags;
1574 if (!(flags & SEC_ALLOC))
1580 /* non-alloc go last. */
1581 for (look = first; look; look = look->next)
1583 flags = look->flags;
1584 if (look->bfd_section != NULL)
1585 flags = look->bfd_section->flags;
1586 flags ^= sec->flags;
1587 if (!(flags & SEC_DEBUGGING))
1593 if (found || !match_type)
1596 return lang_output_section_find_by_flags (sec, NULL, NULL);
1599 /* Find the last output section before given output statement.
1600 Used by place_orphan. */
1603 output_prev_sec_find (lang_output_section_statement_type *os)
1605 lang_output_section_statement_type *lookup;
1607 for (lookup = os->prev; lookup != NULL; lookup = lookup->prev)
1609 if (lookup->constraint < 0)
1612 if (lookup->bfd_section != NULL && lookup->bfd_section->owner != NULL)
1613 return lookup->bfd_section;
1619 /* Look for a suitable place for a new output section statement. The
1620 idea is to skip over anything that might be inside a SECTIONS {}
1621 statement in a script, before we find another output section
1622 statement. Assignments to "dot" before an output section statement
1623 are assumed to belong to it, except in two cases; The first
1624 assignment to dot, and assignments before non-alloc sections.
1625 Otherwise we might put an orphan before . = . + SIZEOF_HEADERS or
1626 similar assignments that set the initial address, or we might
1627 insert non-alloc note sections among assignments setting end of
1630 static lang_statement_union_type **
1631 insert_os_after (lang_output_section_statement_type *after)
1633 lang_statement_union_type **where;
1634 lang_statement_union_type **assign = NULL;
1635 bfd_boolean ignore_first;
1638 = after == &lang_output_section_statement.head->output_section_statement;
1640 for (where = &after->header.next;
1642 where = &(*where)->header.next)
1644 switch ((*where)->header.type)
1646 case lang_assignment_statement_enum:
1649 lang_assignment_statement_type *ass;
1651 ass = &(*where)->assignment_statement;
1652 if (ass->exp->type.node_class != etree_assert
1653 && ass->exp->assign.dst[0] == '.'
1654 && ass->exp->assign.dst[1] == 0
1658 ignore_first = FALSE;
1660 case lang_wild_statement_enum:
1661 case lang_input_section_enum:
1662 case lang_object_symbols_statement_enum:
1663 case lang_fill_statement_enum:
1664 case lang_data_statement_enum:
1665 case lang_reloc_statement_enum:
1666 case lang_padding_statement_enum:
1667 case lang_constructors_statement_enum:
1670 case lang_output_section_statement_enum:
1673 asection *s = (*where)->output_section_statement.bfd_section;
1676 || s->map_head.s == NULL
1677 || (s->flags & SEC_ALLOC) != 0)
1681 case lang_input_statement_enum:
1682 case lang_address_statement_enum:
1683 case lang_target_statement_enum:
1684 case lang_output_statement_enum:
1685 case lang_group_statement_enum:
1686 case lang_insert_statement_enum:
1695 lang_output_section_statement_type *
1696 lang_insert_orphan (asection *s,
1697 const char *secname,
1699 lang_output_section_statement_type *after,
1700 struct orphan_save *place,
1701 etree_type *address,
1702 lang_statement_list_type *add_child)
1704 lang_statement_list_type add;
1706 lang_output_section_statement_type *os;
1707 lang_output_section_statement_type **os_tail;
1709 /* If we have found an appropriate place for the output section
1710 statements for this orphan, add them to our own private list,
1711 inserting them later into the global statement list. */
1714 lang_list_init (&add);
1715 push_stat_ptr (&add);
1718 if (link_info.relocatable || (s->flags & (SEC_LOAD | SEC_ALLOC)) == 0)
1719 address = exp_intop (0);
1721 os_tail = ((lang_output_section_statement_type **)
1722 lang_output_section_statement.tail);
1723 os = lang_enter_output_section_statement (secname, address, normal_section,
1724 NULL, NULL, NULL, constraint);
1727 if (config.build_constructors && *os_tail == os)
1729 /* If the name of the section is representable in C, then create
1730 symbols to mark the start and the end of the section. */
1731 for (ps = secname; *ps != '\0'; ps++)
1732 if (! ISALNUM ((unsigned char) *ps) && *ps != '_')
1737 etree_type *e_align;
1739 symname = (char *) xmalloc (ps - secname + sizeof "__start_" + 1);
1740 symname[0] = bfd_get_symbol_leading_char (link_info.output_bfd);
1741 sprintf (symname + (symname[0] != 0), "__start_%s", secname);
1742 e_align = exp_unop (ALIGN_K,
1743 exp_intop ((bfd_vma) 1 << s->alignment_power));
1744 lang_add_assignment (exp_assop ('=', ".", e_align));
1745 lang_add_assignment (exp_provide (symname,
1747 exp_nameop (NAME, ".")),
1752 if (add_child == NULL)
1753 add_child = &os->children;
1754 lang_add_section (add_child, s, os);
1756 lang_leave_output_section_statement (0, "*default*", NULL, NULL);
1758 if (ps != NULL && *ps == '\0')
1762 symname = (char *) xmalloc (ps - secname + sizeof "__stop_" + 1);
1763 symname[0] = bfd_get_symbol_leading_char (link_info.output_bfd);
1764 sprintf (symname + (symname[0] != 0), "__stop_%s", secname);
1765 lang_add_assignment (exp_provide (symname,
1766 exp_nameop (NAME, "."),
1770 /* Restore the global list pointer. */
1774 if (after != NULL && os->bfd_section != NULL)
1776 asection *snew, *as;
1778 snew = os->bfd_section;
1780 /* Shuffle the bfd section list to make the output file look
1781 neater. This is really only cosmetic. */
1782 if (place->section == NULL
1783 && after != (&lang_output_section_statement.head
1784 ->output_section_statement))
1786 asection *bfd_section = after->bfd_section;
1788 /* If the output statement hasn't been used to place any input
1789 sections (and thus doesn't have an output bfd_section),
1790 look for the closest prior output statement having an
1792 if (bfd_section == NULL)
1793 bfd_section = output_prev_sec_find (after);
1795 if (bfd_section != NULL && bfd_section != snew)
1796 place->section = &bfd_section->next;
1799 if (place->section == NULL)
1800 place->section = &link_info.output_bfd->sections;
1802 as = *place->section;
1806 /* Put the section at the end of the list. */
1808 /* Unlink the section. */
1809 bfd_section_list_remove (link_info.output_bfd, snew);
1811 /* Now tack it back on in the right place. */
1812 bfd_section_list_append (link_info.output_bfd, snew);
1814 else if (as != snew && as->prev != snew)
1816 /* Unlink the section. */
1817 bfd_section_list_remove (link_info.output_bfd, snew);
1819 /* Now tack it back on in the right place. */
1820 bfd_section_list_insert_before (link_info.output_bfd, as, snew);
1823 /* Save the end of this list. Further ophans of this type will
1824 follow the one we've just added. */
1825 place->section = &snew->next;
1827 /* The following is non-cosmetic. We try to put the output
1828 statements in some sort of reasonable order here, because they
1829 determine the final load addresses of the orphan sections.
1830 In addition, placing output statements in the wrong order may
1831 require extra segments. For instance, given a typical
1832 situation of all read-only sections placed in one segment and
1833 following that a segment containing all the read-write
1834 sections, we wouldn't want to place an orphan read/write
1835 section before or amongst the read-only ones. */
1836 if (add.head != NULL)
1838 lang_output_section_statement_type *newly_added_os;
1840 if (place->stmt == NULL)
1842 lang_statement_union_type **where = insert_os_after (after);
1847 place->os_tail = &after->next;
1851 /* Put it after the last orphan statement we added. */
1852 *add.tail = *place->stmt;
1853 *place->stmt = add.head;
1856 /* Fix the global list pointer if we happened to tack our
1857 new list at the tail. */
1858 if (*stat_ptr->tail == add.head)
1859 stat_ptr->tail = add.tail;
1861 /* Save the end of this list. */
1862 place->stmt = add.tail;
1864 /* Do the same for the list of output section statements. */
1865 newly_added_os = *os_tail;
1867 newly_added_os->prev = (lang_output_section_statement_type *)
1868 ((char *) place->os_tail
1869 - offsetof (lang_output_section_statement_type, next));
1870 newly_added_os->next = *place->os_tail;
1871 if (newly_added_os->next != NULL)
1872 newly_added_os->next->prev = newly_added_os;
1873 *place->os_tail = newly_added_os;
1874 place->os_tail = &newly_added_os->next;
1876 /* Fixing the global list pointer here is a little different.
1877 We added to the list in lang_enter_output_section_statement,
1878 trimmed off the new output_section_statment above when
1879 assigning *os_tail = NULL, but possibly added it back in
1880 the same place when assigning *place->os_tail. */
1881 if (*os_tail == NULL)
1882 lang_output_section_statement.tail
1883 = (lang_statement_union_type **) os_tail;
1890 lang_map_flags (flagword flag)
1892 if (flag & SEC_ALLOC)
1895 if (flag & SEC_CODE)
1898 if (flag & SEC_READONLY)
1901 if (flag & SEC_DATA)
1904 if (flag & SEC_LOAD)
1911 lang_memory_region_type *m;
1912 bfd_boolean dis_header_printed = FALSE;
1915 LANG_FOR_EACH_INPUT_STATEMENT (file)
1919 if ((file->the_bfd->flags & (BFD_LINKER_CREATED | DYNAMIC)) != 0
1920 || file->just_syms_flag)
1923 for (s = file->the_bfd->sections; s != NULL; s = s->next)
1924 if ((s->output_section == NULL
1925 || s->output_section->owner != link_info.output_bfd)
1926 && (s->flags & (SEC_LINKER_CREATED | SEC_KEEP)) == 0)
1928 if (! dis_header_printed)
1930 fprintf (config.map_file, _("\nDiscarded input sections\n\n"));
1931 dis_header_printed = TRUE;
1934 print_input_section (s, TRUE);
1938 minfo (_("\nMemory Configuration\n\n"));
1939 fprintf (config.map_file, "%-16s %-18s %-18s %s\n",
1940 _("Name"), _("Origin"), _("Length"), _("Attributes"));
1942 for (m = lang_memory_region_list; m != NULL; m = m->next)
1947 fprintf (config.map_file, "%-16s ", m->name_list.name);
1949 sprintf_vma (buf, m->origin);
1950 minfo ("0x%s ", buf);
1958 minfo ("0x%V", m->length);
1959 if (m->flags || m->not_flags)
1967 lang_map_flags (m->flags);
1973 lang_map_flags (m->not_flags);
1980 fprintf (config.map_file, _("\nLinker script and memory map\n\n"));
1982 if (! link_info.reduce_memory_overheads)
1984 obstack_begin (&map_obstack, 1000);
1985 for (p = link_info.input_bfds; p != (bfd *) NULL; p = p->link_next)
1986 bfd_map_over_sections (p, init_map_userdata, 0);
1987 bfd_link_hash_traverse (link_info.hash, sort_def_symbol, 0);
1989 lang_statement_iteration ++;
1990 print_statements ();
1994 init_map_userdata (bfd *abfd ATTRIBUTE_UNUSED,
1996 void *data ATTRIBUTE_UNUSED)
1998 fat_section_userdata_type *new_data
1999 = ((fat_section_userdata_type *) (stat_alloc
2000 (sizeof (fat_section_userdata_type))));
2002 ASSERT (get_userdata (sec) == NULL);
2003 get_userdata (sec) = new_data;
2004 new_data->map_symbol_def_tail = &new_data->map_symbol_def_head;
2005 new_data->map_symbol_def_count = 0;
2009 sort_def_symbol (struct bfd_link_hash_entry *hash_entry,
2010 void *info ATTRIBUTE_UNUSED)
2012 if (hash_entry->type == bfd_link_hash_defined
2013 || hash_entry->type == bfd_link_hash_defweak)
2015 struct fat_user_section_struct *ud;
2016 struct map_symbol_def *def;
2018 ud = (struct fat_user_section_struct *)
2019 get_userdata (hash_entry->u.def.section);
2022 /* ??? What do we have to do to initialize this beforehand? */
2023 /* The first time we get here is bfd_abs_section... */
2024 init_map_userdata (0, hash_entry->u.def.section, 0);
2025 ud = (struct fat_user_section_struct *)
2026 get_userdata (hash_entry->u.def.section);
2028 else if (!ud->map_symbol_def_tail)
2029 ud->map_symbol_def_tail = &ud->map_symbol_def_head;
2031 def = (struct map_symbol_def *) obstack_alloc (&map_obstack, sizeof *def);
2032 def->entry = hash_entry;
2033 *(ud->map_symbol_def_tail) = def;
2034 ud->map_symbol_def_tail = &def->next;
2035 ud->map_symbol_def_count++;
2040 /* Initialize an output section. */
2043 init_os (lang_output_section_statement_type *s, asection *isec,
2046 if (s->bfd_section != NULL)
2049 if (strcmp (s->name, DISCARD_SECTION_NAME) == 0)
2050 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME);
2052 if (s->constraint != SPECIAL)
2053 s->bfd_section = bfd_get_section_by_name (link_info.output_bfd, s->name);
2054 if (s->bfd_section == NULL)
2055 s->bfd_section = bfd_make_section_anyway_with_flags (link_info.output_bfd,
2057 if (s->bfd_section == NULL)
2059 einfo (_("%P%F: output format %s cannot represent section called %s\n"),
2060 link_info.output_bfd->xvec->name, s->name);
2062 s->bfd_section->output_section = s->bfd_section;
2063 s->bfd_section->output_offset = 0;
2065 if (!link_info.reduce_memory_overheads)
2067 fat_section_userdata_type *new_userdata = (fat_section_userdata_type *)
2068 stat_alloc (sizeof (fat_section_userdata_type));
2069 memset (new_userdata, 0, sizeof (fat_section_userdata_type));
2070 get_userdata (s->bfd_section) = new_userdata;
2073 /* If there is a base address, make sure that any sections it might
2074 mention are initialized. */
2075 if (s->addr_tree != NULL)
2076 exp_init_os (s->addr_tree);
2078 if (s->load_base != NULL)
2079 exp_init_os (s->load_base);
2081 /* If supplied an alignment, set it. */
2082 if (s->section_alignment != -1)
2083 s->bfd_section->alignment_power = s->section_alignment;
2086 bfd_init_private_section_data (isec->owner, isec,
2087 link_info.output_bfd, s->bfd_section,
2091 /* Make sure that all output sections mentioned in an expression are
2095 exp_init_os (etree_type *exp)
2097 switch (exp->type.node_class)
2101 exp_init_os (exp->assign.src);
2105 exp_init_os (exp->binary.lhs);
2106 exp_init_os (exp->binary.rhs);
2110 exp_init_os (exp->trinary.cond);
2111 exp_init_os (exp->trinary.lhs);
2112 exp_init_os (exp->trinary.rhs);
2116 exp_init_os (exp->assert_s.child);
2120 exp_init_os (exp->unary.child);
2124 switch (exp->type.node_code)
2130 lang_output_section_statement_type *os;
2132 os = lang_output_section_find (exp->name.name);
2133 if (os != NULL && os->bfd_section == NULL)
2134 init_os (os, NULL, 0);
2145 section_already_linked (bfd *abfd, asection *sec, void *data)
2147 lang_input_statement_type *entry = (lang_input_statement_type *) data;
2149 /* If we are only reading symbols from this object, then we want to
2150 discard all sections. */
2151 if (entry->just_syms_flag)
2153 bfd_link_just_syms (abfd, sec, &link_info);
2157 if (!(abfd->flags & DYNAMIC))
2158 bfd_section_already_linked (abfd, sec, &link_info);
2161 /* The wild routines.
2163 These expand statements like *(.text) and foo.o to a list of
2164 explicit actions, like foo.o(.text), bar.o(.text) and
2165 foo.o(.text, .data). */
2167 /* Add SECTION to the output section OUTPUT. Do this by creating a
2168 lang_input_section statement which is placed at PTR. FILE is the
2169 input file which holds SECTION. */
2172 lang_add_section (lang_statement_list_type *ptr,
2174 lang_output_section_statement_type *output)
2176 flagword flags = section->flags;
2177 bfd_boolean discard;
2179 /* Discard sections marked with SEC_EXCLUDE. */
2180 discard = (flags & SEC_EXCLUDE) != 0;
2182 /* Discard input sections which are assigned to a section named
2183 DISCARD_SECTION_NAME. */
2184 if (strcmp (output->name, DISCARD_SECTION_NAME) == 0)
2187 /* Discard debugging sections if we are stripping debugging
2189 if ((link_info.strip == strip_debugger || link_info.strip == strip_all)
2190 && (flags & SEC_DEBUGGING) != 0)
2195 if (section->output_section == NULL)
2197 /* This prevents future calls from assigning this section. */
2198 section->output_section = bfd_abs_section_ptr;
2203 if (section->output_section == NULL)
2206 lang_input_section_type *new_section;
2209 flags = section->flags;
2211 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2212 to an output section, because we want to be able to include a
2213 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2214 section (I don't know why we want to do this, but we do).
2215 build_link_order in ldwrite.c handles this case by turning
2216 the embedded SEC_NEVER_LOAD section into a fill. */
2218 flags &= ~ SEC_NEVER_LOAD;
2220 switch (output->sectype)
2222 case normal_section:
2223 case overlay_section:
2225 case noalloc_section:
2226 flags &= ~SEC_ALLOC;
2228 case noload_section:
2230 flags |= SEC_NEVER_LOAD;
2234 if (output->bfd_section == NULL)
2235 init_os (output, section, flags);
2237 first = ! output->bfd_section->linker_has_input;
2238 output->bfd_section->linker_has_input = 1;
2240 if (!link_info.relocatable
2241 && !stripped_excluded_sections)
2243 asection *s = output->bfd_section->map_tail.s;
2244 output->bfd_section->map_tail.s = section;
2245 section->map_head.s = NULL;
2246 section->map_tail.s = s;
2248 s->map_head.s = section;
2250 output->bfd_section->map_head.s = section;
2253 /* Add a section reference to the list. */
2254 new_section = new_stat (lang_input_section, ptr);
2256 new_section->section = section;
2257 section->output_section = output->bfd_section;
2259 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2260 already been processed. One reason to do this is that on pe
2261 format targets, .text$foo sections go into .text and it's odd
2262 to see .text with SEC_LINK_ONCE set. */
2264 if (! link_info.relocatable)
2265 flags &= ~ (SEC_LINK_ONCE | SEC_LINK_DUPLICATES);
2267 /* If this is not the first input section, and the SEC_READONLY
2268 flag is not currently set, then don't set it just because the
2269 input section has it set. */
2271 if (! first && (output->bfd_section->flags & SEC_READONLY) == 0)
2272 flags &= ~ SEC_READONLY;
2274 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2276 && ((output->bfd_section->flags & (SEC_MERGE | SEC_STRINGS))
2277 != (flags & (SEC_MERGE | SEC_STRINGS))
2278 || ((flags & SEC_MERGE)
2279 && output->bfd_section->entsize != section->entsize)))
2281 output->bfd_section->flags &= ~ (SEC_MERGE | SEC_STRINGS);
2282 flags &= ~ (SEC_MERGE | SEC_STRINGS);
2285 output->bfd_section->flags |= flags;
2287 if (flags & SEC_MERGE)
2288 output->bfd_section->entsize = section->entsize;
2290 /* If SEC_READONLY is not set in the input section, then clear
2291 it from the output section. */
2292 if ((section->flags & SEC_READONLY) == 0)
2293 output->bfd_section->flags &= ~SEC_READONLY;
2295 /* Copy over SEC_SMALL_DATA. */
2296 if (section->flags & SEC_SMALL_DATA)
2297 output->bfd_section->flags |= SEC_SMALL_DATA;
2299 if (section->alignment_power > output->bfd_section->alignment_power)
2300 output->bfd_section->alignment_power = section->alignment_power;
2302 if (bfd_get_arch (section->owner) == bfd_arch_tic54x
2303 && (section->flags & SEC_TIC54X_BLOCK) != 0)
2305 output->bfd_section->flags |= SEC_TIC54X_BLOCK;
2306 /* FIXME: This value should really be obtained from the bfd... */
2307 output->block_value = 128;
2312 /* Handle wildcard sorting. This returns the lang_input_section which
2313 should follow the one we are going to create for SECTION and FILE,
2314 based on the sorting requirements of WILD. It returns NULL if the
2315 new section should just go at the end of the current list. */
2317 static lang_statement_union_type *
2318 wild_sort (lang_wild_statement_type *wild,
2319 struct wildcard_list *sec,
2320 lang_input_statement_type *file,
2323 const char *section_name;
2324 lang_statement_union_type *l;
2326 if (!wild->filenames_sorted
2327 && (sec == NULL || sec->spec.sorted == none))
2330 section_name = bfd_get_section_name (file->the_bfd, section);
2331 for (l = wild->children.head; l != NULL; l = l->header.next)
2333 lang_input_section_type *ls;
2335 if (l->header.type != lang_input_section_enum)
2337 ls = &l->input_section;
2339 /* Sorting by filename takes precedence over sorting by section
2342 if (wild->filenames_sorted)
2344 const char *fn, *ln;
2348 /* The PE support for the .idata section as generated by
2349 dlltool assumes that files will be sorted by the name of
2350 the archive and then the name of the file within the
2353 if (file->the_bfd != NULL
2354 && bfd_my_archive (file->the_bfd) != NULL)
2356 fn = bfd_get_filename (bfd_my_archive (file->the_bfd));
2361 fn = file->filename;
2365 if (bfd_my_archive (ls->section->owner) != NULL)
2367 ln = bfd_get_filename (bfd_my_archive (ls->section->owner));
2372 ln = ls->section->owner->filename;
2376 i = strcmp (fn, ln);
2385 fn = file->filename;
2387 ln = ls->section->owner->filename;
2389 i = strcmp (fn, ln);
2397 /* Here either the files are not sorted by name, or we are
2398 looking at the sections for this file. */
2400 if (sec != NULL && sec->spec.sorted != none)
2401 if (compare_section (sec->spec.sorted, section, ls->section) < 0)
2408 /* Expand a wild statement for a particular FILE. SECTION may be
2409 NULL, in which case it is a wild card. */
2412 output_section_callback (lang_wild_statement_type *ptr,
2413 struct wildcard_list *sec,
2415 lang_input_statement_type *file,
2418 lang_statement_union_type *before;
2420 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2421 if (unique_section_p (section))
2424 before = wild_sort (ptr, sec, file, section);
2426 /* Here BEFORE points to the lang_input_section which
2427 should follow the one we are about to add. If BEFORE
2428 is NULL, then the section should just go at the end
2429 of the current list. */
2432 lang_add_section (&ptr->children, section,
2433 (lang_output_section_statement_type *) output);
2436 lang_statement_list_type list;
2437 lang_statement_union_type **pp;
2439 lang_list_init (&list);
2440 lang_add_section (&list, section,
2441 (lang_output_section_statement_type *) output);
2443 /* If we are discarding the section, LIST.HEAD will
2445 if (list.head != NULL)
2447 ASSERT (list.head->header.next == NULL);
2449 for (pp = &ptr->children.head;
2451 pp = &(*pp)->header.next)
2452 ASSERT (*pp != NULL);
2454 list.head->header.next = *pp;
2460 /* Check if all sections in a wild statement for a particular FILE
2464 check_section_callback (lang_wild_statement_type *ptr ATTRIBUTE_UNUSED,
2465 struct wildcard_list *sec ATTRIBUTE_UNUSED,
2467 lang_input_statement_type *file ATTRIBUTE_UNUSED,
2470 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2471 if (unique_section_p (section))
2474 if (section->output_section == NULL && (section->flags & SEC_READONLY) == 0)
2475 ((lang_output_section_statement_type *) data)->all_input_readonly = FALSE;
2478 /* This is passed a file name which must have been seen already and
2479 added to the statement tree. We will see if it has been opened
2480 already and had its symbols read. If not then we'll read it. */
2482 static lang_input_statement_type *
2483 lookup_name (const char *name)
2485 lang_input_statement_type *search;
2487 for (search = (lang_input_statement_type *) input_file_chain.head;
2489 search = (lang_input_statement_type *) search->next_real_file)
2491 /* Use the local_sym_name as the name of the file that has
2492 already been loaded as filename might have been transformed
2493 via the search directory lookup mechanism. */
2494 const char *filename = search->local_sym_name;
2496 if (filename != NULL
2497 && strcmp (filename, name) == 0)
2502 search = new_afile (name, lang_input_file_is_search_file_enum,
2503 default_target, FALSE);
2505 /* If we have already added this file, or this file is not real
2506 don't add this file. */
2507 if (search->loaded || !search->real)
2510 if (! load_symbols (search, NULL))
2516 /* Save LIST as a list of libraries whose symbols should not be exported. */
2521 struct excluded_lib *next;
2523 static struct excluded_lib *excluded_libs;
2526 add_excluded_libs (const char *list)
2528 const char *p = list, *end;
2532 struct excluded_lib *entry;
2533 end = strpbrk (p, ",:");
2535 end = p + strlen (p);
2536 entry = (struct excluded_lib *) xmalloc (sizeof (*entry));
2537 entry->next = excluded_libs;
2538 entry->name = (char *) xmalloc (end - p + 1);
2539 memcpy (entry->name, p, end - p);
2540 entry->name[end - p] = '\0';
2541 excluded_libs = entry;
2549 check_excluded_libs (bfd *abfd)
2551 struct excluded_lib *lib = excluded_libs;
2555 int len = strlen (lib->name);
2556 const char *filename = lbasename (abfd->filename);
2558 if (strcmp (lib->name, "ALL") == 0)
2560 abfd->no_export = TRUE;
2564 if (strncmp (lib->name, filename, len) == 0
2565 && (filename[len] == '\0'
2566 || (filename[len] == '.' && filename[len + 1] == 'a'
2567 && filename[len + 2] == '\0')))
2569 abfd->no_export = TRUE;
2577 /* Get the symbols for an input file. */
2580 load_symbols (lang_input_statement_type *entry,
2581 lang_statement_list_type *place)
2588 ldfile_open_file (entry);
2590 if (! bfd_check_format (entry->the_bfd, bfd_archive)
2591 && ! bfd_check_format_matches (entry->the_bfd, bfd_object, &matching))
2594 bfd_boolean save_ldlang_sysrooted_script;
2595 bfd_boolean save_as_needed, save_add_needed, save_whole_archive;
2597 err = bfd_get_error ();
2599 /* See if the emulation has some special knowledge. */
2600 if (ldemul_unrecognized_file (entry))
2603 if (err == bfd_error_file_ambiguously_recognized)
2607 einfo (_("%B: file not recognized: %E\n"), entry->the_bfd);
2608 einfo (_("%B: matching formats:"), entry->the_bfd);
2609 for (p = matching; *p != NULL; p++)
2613 else if (err != bfd_error_file_not_recognized
2615 einfo (_("%F%B: file not recognized: %E\n"), entry->the_bfd);
2617 bfd_close (entry->the_bfd);
2618 entry->the_bfd = NULL;
2620 /* Try to interpret the file as a linker script. */
2621 ldfile_open_command_file (entry->filename);
2623 push_stat_ptr (place);
2624 save_ldlang_sysrooted_script = ldlang_sysrooted_script;
2625 ldlang_sysrooted_script = entry->sysrooted;
2626 save_as_needed = as_needed;
2627 as_needed = entry->as_needed;
2628 save_add_needed = add_needed;
2629 add_needed = entry->add_needed;
2630 save_whole_archive = whole_archive;
2631 whole_archive = entry->whole_archive;
2633 ldfile_assumed_script = TRUE;
2634 parser_input = input_script;
2635 /* We want to use the same -Bdynamic/-Bstatic as the one for
2637 config.dynamic_link = entry->dynamic;
2639 ldfile_assumed_script = FALSE;
2641 ldlang_sysrooted_script = save_ldlang_sysrooted_script;
2642 as_needed = save_as_needed;
2643 add_needed = save_add_needed;
2644 whole_archive = save_whole_archive;
2650 if (ldemul_recognized_file (entry))
2653 /* We don't call ldlang_add_file for an archive. Instead, the
2654 add_symbols entry point will call ldlang_add_file, via the
2655 add_archive_element callback, for each element of the archive
2657 switch (bfd_get_format (entry->the_bfd))
2663 ldlang_add_file (entry);
2664 if (trace_files || trace_file_tries)
2665 info_msg ("%I\n", entry);
2669 check_excluded_libs (entry->the_bfd);
2671 if (entry->whole_archive)
2674 bfd_boolean loaded = TRUE;
2678 member = bfd_openr_next_archived_file (entry->the_bfd, member);
2683 if (! bfd_check_format (member, bfd_object))
2685 einfo (_("%F%B: member %B in archive is not an object\n"),
2686 entry->the_bfd, member);
2690 if (! ((*link_info.callbacks->add_archive_element)
2691 (&link_info, member, "--whole-archive")))
2694 if (! bfd_link_add_symbols (member, &link_info))
2696 einfo (_("%F%B: could not read symbols: %E\n"), member);
2701 entry->loaded = loaded;
2707 if (bfd_link_add_symbols (entry->the_bfd, &link_info))
2708 entry->loaded = TRUE;
2710 einfo (_("%F%B: could not read symbols: %E\n"), entry->the_bfd);
2712 return entry->loaded;
2715 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2716 may be NULL, indicating that it is a wildcard. Separate
2717 lang_input_section statements are created for each part of the
2718 expansion; they are added after the wild statement S. OUTPUT is
2719 the output section. */
2722 wild (lang_wild_statement_type *s,
2723 const char *target ATTRIBUTE_UNUSED,
2724 lang_output_section_statement_type *output)
2726 struct wildcard_list *sec;
2728 if (s->handler_data[0]
2729 && s->handler_data[0]->spec.sorted == by_name
2730 && !s->filenames_sorted)
2732 lang_section_bst_type *tree;
2734 walk_wild (s, output_section_callback_fast, output);
2739 output_section_callback_tree_to_list (s, tree, output);
2744 walk_wild (s, output_section_callback, output);
2746 if (default_common_section == NULL)
2747 for (sec = s->section_list; sec != NULL; sec = sec->next)
2748 if (sec->spec.name != NULL && strcmp (sec->spec.name, "COMMON") == 0)
2750 /* Remember the section that common is going to in case we
2751 later get something which doesn't know where to put it. */
2752 default_common_section = output;
2757 /* Return TRUE iff target is the sought target. */
2760 get_target (const bfd_target *target, void *data)
2762 const char *sought = (const char *) data;
2764 return strcmp (target->name, sought) == 0;
2767 /* Like strcpy() but convert to lower case as well. */
2770 stricpy (char *dest, char *src)
2774 while ((c = *src++) != 0)
2775 *dest++ = TOLOWER (c);
2780 /* Remove the first occurrence of needle (if any) in haystack
2784 strcut (char *haystack, char *needle)
2786 haystack = strstr (haystack, needle);
2792 for (src = haystack + strlen (needle); *src;)
2793 *haystack++ = *src++;
2799 /* Compare two target format name strings.
2800 Return a value indicating how "similar" they are. */
2803 name_compare (char *first, char *second)
2809 copy1 = (char *) xmalloc (strlen (first) + 1);
2810 copy2 = (char *) xmalloc (strlen (second) + 1);
2812 /* Convert the names to lower case. */
2813 stricpy (copy1, first);
2814 stricpy (copy2, second);
2816 /* Remove size and endian strings from the name. */
2817 strcut (copy1, "big");
2818 strcut (copy1, "little");
2819 strcut (copy2, "big");
2820 strcut (copy2, "little");
2822 /* Return a value based on how many characters match,
2823 starting from the beginning. If both strings are
2824 the same then return 10 * their length. */
2825 for (result = 0; copy1[result] == copy2[result]; result++)
2826 if (copy1[result] == 0)
2838 /* Set by closest_target_match() below. */
2839 static const bfd_target *winner;
2841 /* Scan all the valid bfd targets looking for one that has the endianness
2842 requirement that was specified on the command line, and is the nearest
2843 match to the original output target. */
2846 closest_target_match (const bfd_target *target, void *data)
2848 const bfd_target *original = (const bfd_target *) data;
2850 if (command_line.endian == ENDIAN_BIG
2851 && target->byteorder != BFD_ENDIAN_BIG)
2854 if (command_line.endian == ENDIAN_LITTLE
2855 && target->byteorder != BFD_ENDIAN_LITTLE)
2858 /* Must be the same flavour. */
2859 if (target->flavour != original->flavour)
2862 /* Ignore generic big and little endian elf vectors. */
2863 if (strcmp (target->name, "elf32-big") == 0
2864 || strcmp (target->name, "elf64-big") == 0
2865 || strcmp (target->name, "elf32-little") == 0
2866 || strcmp (target->name, "elf64-little") == 0)
2869 /* If we have not found a potential winner yet, then record this one. */
2876 /* Oh dear, we now have two potential candidates for a successful match.
2877 Compare their names and choose the better one. */
2878 if (name_compare (target->name, original->name)
2879 > name_compare (winner->name, original->name))
2882 /* Keep on searching until wqe have checked them all. */
2886 /* Return the BFD target format of the first input file. */
2889 get_first_input_target (void)
2891 char *target = NULL;
2893 LANG_FOR_EACH_INPUT_STATEMENT (s)
2895 if (s->header.type == lang_input_statement_enum
2898 ldfile_open_file (s);
2900 if (s->the_bfd != NULL
2901 && bfd_check_format (s->the_bfd, bfd_object))
2903 target = bfd_get_target (s->the_bfd);
2915 lang_get_output_target (void)
2919 /* Has the user told us which output format to use? */
2920 if (output_target != NULL)
2921 return output_target;
2923 /* No - has the current target been set to something other than
2925 if (current_target != default_target)
2926 return current_target;
2928 /* No - can we determine the format of the first input file? */
2929 target = get_first_input_target ();
2933 /* Failed - use the default output target. */
2934 return default_target;
2937 /* Open the output file. */
2940 open_output (const char *name)
2942 output_target = lang_get_output_target ();
2944 /* Has the user requested a particular endianness on the command
2946 if (command_line.endian != ENDIAN_UNSET)
2948 const bfd_target *target;
2949 enum bfd_endian desired_endian;
2951 /* Get the chosen target. */
2952 target = bfd_search_for_target (get_target, (void *) output_target);
2954 /* If the target is not supported, we cannot do anything. */
2957 if (command_line.endian == ENDIAN_BIG)
2958 desired_endian = BFD_ENDIAN_BIG;
2960 desired_endian = BFD_ENDIAN_LITTLE;
2962 /* See if the target has the wrong endianness. This should
2963 not happen if the linker script has provided big and
2964 little endian alternatives, but some scrips don't do
2966 if (target->byteorder != desired_endian)
2968 /* If it does, then see if the target provides
2969 an alternative with the correct endianness. */
2970 if (target->alternative_target != NULL
2971 && (target->alternative_target->byteorder == desired_endian))
2972 output_target = target->alternative_target->name;
2975 /* Try to find a target as similar as possible to
2976 the default target, but which has the desired
2977 endian characteristic. */
2978 bfd_search_for_target (closest_target_match,
2981 /* Oh dear - we could not find any targets that
2982 satisfy our requirements. */
2984 einfo (_("%P: warning: could not find any targets"
2985 " that match endianness requirement\n"));
2987 output_target = winner->name;
2993 link_info.output_bfd = bfd_openw (name, output_target);
2995 if (link_info.output_bfd == NULL)
2997 if (bfd_get_error () == bfd_error_invalid_target)
2998 einfo (_("%P%F: target %s not found\n"), output_target);
3000 einfo (_("%P%F: cannot open output file %s: %E\n"), name);
3003 delete_output_file_on_failure = TRUE;
3005 if (! bfd_set_format (link_info.output_bfd, bfd_object))
3006 einfo (_("%P%F:%s: can not make object file: %E\n"), name);
3007 if (! bfd_set_arch_mach (link_info.output_bfd,
3008 ldfile_output_architecture,
3009 ldfile_output_machine))
3010 einfo (_("%P%F:%s: can not set architecture: %E\n"), name);
3012 link_info.hash = bfd_link_hash_table_create (link_info.output_bfd);
3013 if (link_info.hash == NULL)
3014 einfo (_("%P%F: can not create hash table: %E\n"));
3016 bfd_set_gp_size (link_info.output_bfd, g_switch_value);
3020 ldlang_open_output (lang_statement_union_type *statement)
3022 switch (statement->header.type)
3024 case lang_output_statement_enum:
3025 ASSERT (link_info.output_bfd == NULL);
3026 open_output (statement->output_statement.name);
3027 ldemul_set_output_arch ();
3028 if (config.magic_demand_paged && !link_info.relocatable)
3029 link_info.output_bfd->flags |= D_PAGED;
3031 link_info.output_bfd->flags &= ~D_PAGED;
3032 if (config.text_read_only)
3033 link_info.output_bfd->flags |= WP_TEXT;
3035 link_info.output_bfd->flags &= ~WP_TEXT;
3036 if (link_info.traditional_format)
3037 link_info.output_bfd->flags |= BFD_TRADITIONAL_FORMAT;
3039 link_info.output_bfd->flags &= ~BFD_TRADITIONAL_FORMAT;
3042 case lang_target_statement_enum:
3043 current_target = statement->target_statement.target;
3050 /* Convert between addresses in bytes and sizes in octets.
3051 For currently supported targets, octets_per_byte is always a power
3052 of two, so we can use shifts. */
3053 #define TO_ADDR(X) ((X) >> opb_shift)
3054 #define TO_SIZE(X) ((X) << opb_shift)
3056 /* Support the above. */
3057 static unsigned int opb_shift = 0;
3062 unsigned x = bfd_arch_mach_octets_per_byte (ldfile_output_architecture,
3063 ldfile_output_machine);
3066 while ((x & 1) == 0)
3074 /* Open all the input files. */
3077 open_input_bfds (lang_statement_union_type *s, bfd_boolean force)
3079 for (; s != NULL; s = s->header.next)
3081 switch (s->header.type)
3083 case lang_constructors_statement_enum:
3084 open_input_bfds (constructor_list.head, force);
3086 case lang_output_section_statement_enum:
3087 open_input_bfds (s->output_section_statement.children.head, force);
3089 case lang_wild_statement_enum:
3090 /* Maybe we should load the file's symbols. */
3091 if (s->wild_statement.filename
3092 && !wildcardp (s->wild_statement.filename)
3093 && !archive_path (s->wild_statement.filename))
3094 lookup_name (s->wild_statement.filename);
3095 open_input_bfds (s->wild_statement.children.head, force);
3097 case lang_group_statement_enum:
3099 struct bfd_link_hash_entry *undefs;
3101 /* We must continually search the entries in the group
3102 until no new symbols are added to the list of undefined
3107 undefs = link_info.hash->undefs_tail;
3108 open_input_bfds (s->group_statement.children.head, TRUE);
3110 while (undefs != link_info.hash->undefs_tail);
3113 case lang_target_statement_enum:
3114 current_target = s->target_statement.target;
3116 case lang_input_statement_enum:
3117 if (s->input_statement.real)
3119 lang_statement_union_type **os_tail;
3120 lang_statement_list_type add;
3122 s->input_statement.target = current_target;
3124 /* If we are being called from within a group, and this
3125 is an archive which has already been searched, then
3126 force it to be researched unless the whole archive
3127 has been loaded already. */
3129 && !s->input_statement.whole_archive
3130 && s->input_statement.loaded
3131 && bfd_check_format (s->input_statement.the_bfd,
3133 s->input_statement.loaded = FALSE;
3135 os_tail = lang_output_section_statement.tail;
3136 lang_list_init (&add);
3138 if (! load_symbols (&s->input_statement, &add))
3139 config.make_executable = FALSE;
3141 if (add.head != NULL)
3143 /* If this was a script with output sections then
3144 tack any added statements on to the end of the
3145 list. This avoids having to reorder the output
3146 section statement list. Very likely the user
3147 forgot -T, and whatever we do here will not meet
3148 naive user expectations. */
3149 if (os_tail != lang_output_section_statement.tail)
3151 einfo (_("%P: warning: %s contains output sections;"
3152 " did you forget -T?\n"),
3153 s->input_statement.filename);
3154 *stat_ptr->tail = add.head;
3155 stat_ptr->tail = add.tail;
3159 *add.tail = s->header.next;
3160 s->header.next = add.head;
3171 /* Add a symbol to a hash of symbols used in DEFINED (NAME) expressions. */
3174 lang_track_definedness (const char *name)
3176 if (bfd_hash_lookup (&lang_definedness_table, name, TRUE, FALSE) == NULL)
3177 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name);
3180 /* New-function for the definedness hash table. */
3182 static struct bfd_hash_entry *
3183 lang_definedness_newfunc (struct bfd_hash_entry *entry,
3184 struct bfd_hash_table *table ATTRIBUTE_UNUSED,
3185 const char *name ATTRIBUTE_UNUSED)
3187 struct lang_definedness_hash_entry *ret
3188 = (struct lang_definedness_hash_entry *) entry;
3191 ret = (struct lang_definedness_hash_entry *)
3192 bfd_hash_allocate (table, sizeof (struct lang_definedness_hash_entry));
3195 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name);
3197 ret->iteration = -1;
3201 /* Return the iteration when the definition of NAME was last updated. A
3202 value of -1 means that the symbol is not defined in the linker script
3203 or the command line, but may be defined in the linker symbol table. */
3206 lang_symbol_definition_iteration (const char *name)
3208 struct lang_definedness_hash_entry *defentry
3209 = (struct lang_definedness_hash_entry *)
3210 bfd_hash_lookup (&lang_definedness_table, name, FALSE, FALSE);
3212 /* We've already created this one on the presence of DEFINED in the
3213 script, so it can't be NULL unless something is borked elsewhere in
3215 if (defentry == NULL)
3218 return defentry->iteration;
3221 /* Update the definedness state of NAME. */
3224 lang_update_definedness (const char *name, struct bfd_link_hash_entry *h)
3226 struct lang_definedness_hash_entry *defentry
3227 = (struct lang_definedness_hash_entry *)
3228 bfd_hash_lookup (&lang_definedness_table, name, FALSE, FALSE);
3230 /* We don't keep track of symbols not tested with DEFINED. */
3231 if (defentry == NULL)
3234 /* If the symbol was already defined, and not from an earlier statement
3235 iteration, don't update the definedness iteration, because that'd
3236 make the symbol seem defined in the linker script at this point, and
3237 it wasn't; it was defined in some object. If we do anyway, DEFINED
3238 would start to yield false before this point and the construct "sym =
3239 DEFINED (sym) ? sym : X;" would change sym to X despite being defined
3241 if (h->type != bfd_link_hash_undefined
3242 && h->type != bfd_link_hash_common
3243 && h->type != bfd_link_hash_new
3244 && defentry->iteration == -1)
3247 defentry->iteration = lang_statement_iteration;
3250 /* Add the supplied name to the symbol table as an undefined reference.
3251 This is a two step process as the symbol table doesn't even exist at
3252 the time the ld command line is processed. First we put the name
3253 on a list, then, once the output file has been opened, transfer the
3254 name to the symbol table. */
3256 typedef struct bfd_sym_chain ldlang_undef_chain_list_type;
3258 #define ldlang_undef_chain_list_head entry_symbol.next
3261 ldlang_add_undef (const char *const name)
3263 ldlang_undef_chain_list_type *new_undef = (ldlang_undef_chain_list_type *)
3264 stat_alloc (sizeof (ldlang_undef_chain_list_type));
3266 new_undef->next = ldlang_undef_chain_list_head;
3267 ldlang_undef_chain_list_head = new_undef;
3269 new_undef->name = xstrdup (name);
3271 if (link_info.output_bfd != NULL)
3272 insert_undefined (new_undef->name);
3275 /* Insert NAME as undefined in the symbol table. */
3278 insert_undefined (const char *name)
3280 struct bfd_link_hash_entry *h;
3282 h = bfd_link_hash_lookup (link_info.hash, name, TRUE, FALSE, TRUE);
3284 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
3285 if (h->type == bfd_link_hash_new)
3287 h->type = bfd_link_hash_undefined;
3288 h->u.undef.abfd = NULL;
3289 bfd_link_add_undef (link_info.hash, h);
3293 /* Run through the list of undefineds created above and place them
3294 into the linker hash table as undefined symbols belonging to the
3298 lang_place_undefineds (void)
3300 ldlang_undef_chain_list_type *ptr;
3302 for (ptr = ldlang_undef_chain_list_head; ptr != NULL; ptr = ptr->next)
3303 insert_undefined (ptr->name);
3306 /* Check for all readonly or some readwrite sections. */
3309 check_input_sections
3310 (lang_statement_union_type *s,
3311 lang_output_section_statement_type *output_section_statement)
3313 for (; s != (lang_statement_union_type *) NULL; s = s->header.next)
3315 switch (s->header.type)
3317 case lang_wild_statement_enum:
3318 walk_wild (&s->wild_statement, check_section_callback,
3319 output_section_statement);
3320 if (! output_section_statement->all_input_readonly)
3323 case lang_constructors_statement_enum:
3324 check_input_sections (constructor_list.head,
3325 output_section_statement);
3326 if (! output_section_statement->all_input_readonly)
3329 case lang_group_statement_enum:
3330 check_input_sections (s->group_statement.children.head,
3331 output_section_statement);
3332 if (! output_section_statement->all_input_readonly)
3341 /* Update wildcard statements if needed. */
3344 update_wild_statements (lang_statement_union_type *s)
3346 struct wildcard_list *sec;
3348 switch (sort_section)
3358 for (; s != NULL; s = s->header.next)
3360 switch (s->header.type)
3365 case lang_wild_statement_enum:
3366 sec = s->wild_statement.section_list;
3367 for (sec = s->wild_statement.section_list; sec != NULL;
3370 switch (sec->spec.sorted)
3373 sec->spec.sorted = sort_section;
3376 if (sort_section == by_alignment)
3377 sec->spec.sorted = by_name_alignment;
3380 if (sort_section == by_name)
3381 sec->spec.sorted = by_alignment_name;
3389 case lang_constructors_statement_enum:
3390 update_wild_statements (constructor_list.head);
3393 case lang_output_section_statement_enum:
3394 update_wild_statements
3395 (s->output_section_statement.children.head);
3398 case lang_group_statement_enum:
3399 update_wild_statements (s->group_statement.children.head);
3407 /* Open input files and attach to output sections. */
3410 map_input_to_output_sections
3411 (lang_statement_union_type *s, const char *target,
3412 lang_output_section_statement_type *os)
3416 for (; s != NULL; s = s->header.next)
3418 switch (s->header.type)
3420 case lang_wild_statement_enum:
3421 wild (&s->wild_statement, target, os);
3423 case lang_constructors_statement_enum:
3424 map_input_to_output_sections (constructor_list.head,
3428 case lang_output_section_statement_enum:
3429 if (s->output_section_statement.constraint)
3431 if (s->output_section_statement.constraint != ONLY_IF_RW
3432 && s->output_section_statement.constraint != ONLY_IF_RO)
3434 s->output_section_statement.all_input_readonly = TRUE;
3435 check_input_sections (s->output_section_statement.children.head,
3436 &s->output_section_statement);
3437 if ((s->output_section_statement.all_input_readonly
3438 && s->output_section_statement.constraint == ONLY_IF_RW)
3439 || (!s->output_section_statement.all_input_readonly
3440 && s->output_section_statement.constraint == ONLY_IF_RO))
3442 s->output_section_statement.constraint = -1;
3447 map_input_to_output_sections (s->output_section_statement.children.head,
3449 &s->output_section_statement);
3451 case lang_output_statement_enum:
3453 case lang_target_statement_enum:
3454 target = s->target_statement.target;
3456 case lang_group_statement_enum:
3457 map_input_to_output_sections (s->group_statement.children.head,
3461 case lang_data_statement_enum:
3462 /* Make sure that any sections mentioned in the expression
3464 exp_init_os (s->data_statement.exp);
3465 flags = SEC_HAS_CONTENTS;
3466 /* The output section gets contents, and then we inspect for
3467 any flags set in the input script which override any ALLOC. */
3468 if (!(os->flags & SEC_NEVER_LOAD))
3469 flags |= SEC_ALLOC | SEC_LOAD;
3470 if (os->bfd_section == NULL)
3471 init_os (os, NULL, flags);
3473 os->bfd_section->flags |= flags;
3475 case lang_input_section_enum:
3477 case lang_fill_statement_enum:
3478 case lang_object_symbols_statement_enum:
3479 case lang_reloc_statement_enum:
3480 case lang_padding_statement_enum:
3481 case lang_input_statement_enum:
3482 if (os != NULL && os->bfd_section == NULL)
3483 init_os (os, NULL, 0);
3485 case lang_assignment_statement_enum:
3486 if (os != NULL && os->bfd_section == NULL)
3487 init_os (os, NULL, 0);
3489 /* Make sure that any sections mentioned in the assignment
3491 exp_init_os (s->assignment_statement.exp);
3493 case lang_address_statement_enum:
3494 /* Mark the specified section with the supplied address.
3495 If this section was actually a segment marker, then the
3496 directive is ignored if the linker script explicitly
3497 processed the segment marker. Originally, the linker
3498 treated segment directives (like -Ttext on the
3499 command-line) as section directives. We honor the
3500 section directive semantics for backwards compatibilty;
3501 linker scripts that do not specifically check for
3502 SEGMENT_START automatically get the old semantics. */
3503 if (!s->address_statement.segment
3504 || !s->address_statement.segment->used)
3506 lang_output_section_statement_type *aos
3507 = (lang_output_section_statement_lookup
3508 (s->address_statement.section_name, 0, TRUE));
3510 if (aos->bfd_section == NULL)
3511 init_os (aos, NULL, 0);
3512 aos->addr_tree = s->address_statement.address;
3515 case lang_insert_statement_enum:
3521 /* An insert statement snips out all the linker statements from the
3522 start of the list and places them after the output section
3523 statement specified by the insert. This operation is complicated
3524 by the fact that we keep a doubly linked list of output section
3525 statements as well as the singly linked list of all statements. */
3528 process_insert_statements (void)
3530 lang_statement_union_type **s;
3531 lang_output_section_statement_type *first_os = NULL;
3532 lang_output_section_statement_type *last_os = NULL;
3533 lang_output_section_statement_type *os;
3535 /* "start of list" is actually the statement immediately after
3536 the special abs_section output statement, so that it isn't
3538 s = &lang_output_section_statement.head;
3539 while (*(s = &(*s)->header.next) != NULL)
3541 if ((*s)->header.type == lang_output_section_statement_enum)
3543 /* Keep pointers to the first and last output section
3544 statement in the sequence we may be about to move. */
3545 os = &(*s)->output_section_statement;
3547 ASSERT (last_os == NULL || last_os->next == os);
3550 /* Set constraint negative so that lang_output_section_find
3551 won't match this output section statement. At this
3552 stage in linking constraint has values in the range
3553 [-1, ONLY_IN_RW]. */
3554 last_os->constraint = -2 - last_os->constraint;
3555 if (first_os == NULL)
3558 else if ((*s)->header.type == lang_insert_statement_enum)
3560 lang_insert_statement_type *i = &(*s)->insert_statement;
3561 lang_output_section_statement_type *where;
3562 lang_statement_union_type **ptr;
3563 lang_statement_union_type *first;
3565 where = lang_output_section_find (i->where);
3566 if (where != NULL && i->is_before)
3569 where = where->prev;
3570 while (where != NULL && where->constraint < 0);
3574 einfo (_("%F%P: %s not found for insert\n"), i->where);
3578 /* Deal with reordering the output section statement list. */
3579 if (last_os != NULL)
3581 asection *first_sec, *last_sec;
3582 struct lang_output_section_statement_struct **next;
3584 /* Snip out the output sections we are moving. */
3585 first_os->prev->next = last_os->next;
3586 if (last_os->next == NULL)
3588 next = &first_os->prev->next;
3589 lang_output_section_statement.tail
3590 = (lang_statement_union_type **) next;
3593 last_os->next->prev = first_os->prev;
3594 /* Add them in at the new position. */
3595 last_os->next = where->next;
3596 if (where->next == NULL)
3598 next = &last_os->next;
3599 lang_output_section_statement.tail
3600 = (lang_statement_union_type **) next;
3603 where->next->prev = last_os;
3604 first_os->prev = where;
3605 where->next = first_os;
3607 /* Move the bfd sections in the same way. */
3610 for (os = first_os; os != NULL; os = os->next)
3612 os->constraint = -2 - os->constraint;
3613 if (os->bfd_section != NULL
3614 && os->bfd_section->owner != NULL)
3616 last_sec = os->bfd_section;
3617 if (first_sec == NULL)
3618 first_sec = last_sec;
3623 if (last_sec != NULL)
3625 asection *sec = where->bfd_section;
3627 sec = output_prev_sec_find (where);
3629 /* The place we want to insert must come after the
3630 sections we are moving. So if we find no
3631 section or if the section is the same as our
3632 last section, then no move is needed. */
3633 if (sec != NULL && sec != last_sec)
3635 /* Trim them off. */
3636 if (first_sec->prev != NULL)
3637 first_sec->prev->next = last_sec->next;
3639 link_info.output_bfd->sections = last_sec->next;
3640 if (last_sec->next != NULL)
3641 last_sec->next->prev = first_sec->prev;
3643 link_info.output_bfd->section_last = first_sec->prev;
3645 last_sec->next = sec->next;
3646 if (sec->next != NULL)
3647 sec->next->prev = last_sec;
3649 link_info.output_bfd->section_last = last_sec;
3650 first_sec->prev = sec;
3651 sec->next = first_sec;
3659 ptr = insert_os_after (where);
3660 /* Snip everything after the abs_section output statement we
3661 know is at the start of the list, up to and including
3662 the insert statement we are currently processing. */
3663 first = lang_output_section_statement.head->header.next;
3664 lang_output_section_statement.head->header.next = (*s)->header.next;
3665 /* Add them back where they belong. */
3668 statement_list.tail = s;
3670 s = &lang_output_section_statement.head;
3674 /* Undo constraint twiddling. */
3675 for (os = first_os; os != NULL; os = os->next)
3677 os->constraint = -2 - os->constraint;
3683 /* An output section might have been removed after its statement was
3684 added. For example, ldemul_before_allocation can remove dynamic
3685 sections if they turn out to be not needed. Clean them up here. */
3688 strip_excluded_output_sections (void)
3690 lang_output_section_statement_type *os;
3692 /* Run lang_size_sections (if not already done). */
3693 if (expld.phase != lang_mark_phase_enum)
3695 expld.phase = lang_mark_phase_enum;
3696 expld.dataseg.phase = exp_dataseg_none;
3697 one_lang_size_sections_pass (NULL, FALSE);
3698 lang_reset_memory_regions ();
3701 for (os = &lang_output_section_statement.head->output_section_statement;
3705 asection *output_section;
3706 bfd_boolean exclude;
3708 if (os->constraint < 0)
3711 output_section = os->bfd_section;
3712 if (output_section == NULL)
3715 exclude = (output_section->rawsize == 0
3716 && (output_section->flags & SEC_KEEP) == 0
3717 && !bfd_section_removed_from_list (link_info.output_bfd,
3720 /* Some sections have not yet been sized, notably .gnu.version,
3721 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3722 input sections, so don't drop output sections that have such
3723 input sections unless they are also marked SEC_EXCLUDE. */
3724 if (exclude && output_section->map_head.s != NULL)
3728 for (s = output_section->map_head.s; s != NULL; s = s->map_head.s)
3729 if ((s->flags & SEC_LINKER_CREATED) != 0
3730 && (s->flags & SEC_EXCLUDE) == 0)
3737 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3738 output_section->map_head.link_order = NULL;
3739 output_section->map_tail.link_order = NULL;
3743 /* We don't set bfd_section to NULL since bfd_section of the
3744 removed output section statement may still be used. */
3745 if (!os->section_relative_symbol
3746 && !os->update_dot_tree)
3748 output_section->flags |= SEC_EXCLUDE;
3749 bfd_section_list_remove (link_info.output_bfd, output_section);
3750 link_info.output_bfd->section_count--;
3754 /* Stop future calls to lang_add_section from messing with map_head
3755 and map_tail link_order fields. */
3756 stripped_excluded_sections = TRUE;
3760 print_output_section_statement
3761 (lang_output_section_statement_type *output_section_statement)
3763 asection *section = output_section_statement->bfd_section;
3766 if (output_section_statement != abs_output_section)
3768 minfo ("\n%s", output_section_statement->name);
3770 if (section != NULL)
3772 print_dot = section->vma;
3774 len = strlen (output_section_statement->name);
3775 if (len >= SECTION_NAME_MAP_LENGTH - 1)
3780 while (len < SECTION_NAME_MAP_LENGTH)
3786 minfo ("0x%V %W", section->vma, section->size);
3788 if (section->vma != section->lma)
3789 minfo (_(" load address 0x%V"), section->lma);
3791 if (output_section_statement->update_dot_tree != NULL)
3792 exp_fold_tree (output_section_statement->update_dot_tree,
3793 bfd_abs_section_ptr, &print_dot);
3799 print_statement_list (output_section_statement->children.head,
3800 output_section_statement);
3803 /* Scan for the use of the destination in the right hand side
3804 of an expression. In such cases we will not compute the
3805 correct expression, since the value of DST that is used on
3806 the right hand side will be its final value, not its value
3807 just before this expression is evaluated. */
3810 scan_for_self_assignment (const char * dst, etree_type * rhs)
3812 if (rhs == NULL || dst == NULL)
3815 switch (rhs->type.node_class)
3818 return scan_for_self_assignment (dst, rhs->binary.lhs)
3819 || scan_for_self_assignment (dst, rhs->binary.rhs);
3822 return scan_for_self_assignment (dst, rhs->trinary.lhs)
3823 || scan_for_self_assignment (dst, rhs->trinary.rhs);
3826 case etree_provided:
3828 if (strcmp (dst, rhs->assign.dst) == 0)
3830 return scan_for_self_assignment (dst, rhs->assign.src);
3833 return scan_for_self_assignment (dst, rhs->unary.child);
3837 return strcmp (dst, rhs->value.str) == 0;
3842 return strcmp (dst, rhs->name.name) == 0;
3854 print_assignment (lang_assignment_statement_type *assignment,
3855 lang_output_section_statement_type *output_section)
3859 bfd_boolean computation_is_valid = TRUE;
3862 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
3865 if (assignment->exp->type.node_class == etree_assert)
3868 tree = assignment->exp->assert_s.child;
3869 computation_is_valid = TRUE;
3873 const char *dst = assignment->exp->assign.dst;
3875 is_dot = (dst[0] == '.' && dst[1] == 0);
3876 tree = assignment->exp->assign.src;
3877 computation_is_valid = is_dot || (scan_for_self_assignment (dst, tree) == FALSE);
3880 exp_fold_tree (tree, output_section->bfd_section, &print_dot);
3881 if (expld.result.valid_p)
3885 if (computation_is_valid)
3887 value = expld.result.value;
3889 if (expld.result.section)
3890 value += expld.result.section->vma;
3892 minfo ("0x%V", value);
3898 struct bfd_link_hash_entry *h;
3900 h = bfd_link_hash_lookup (link_info.hash, assignment->exp->assign.dst,
3901 FALSE, FALSE, TRUE);
3904 value = h->u.def.value;
3906 if (expld.result.section)
3907 value += expld.result.section->vma;
3909 minfo ("[0x%V]", value);
3912 minfo ("[unresolved]");
3924 exp_print_tree (assignment->exp);
3929 print_input_statement (lang_input_statement_type *statm)
3931 if (statm->filename != NULL
3932 && (statm->the_bfd == NULL
3933 || (statm->the_bfd->flags & BFD_LINKER_CREATED) == 0))
3934 fprintf (config.map_file, "LOAD %s\n", statm->filename);
3937 /* Print all symbols defined in a particular section. This is called
3938 via bfd_link_hash_traverse, or by print_all_symbols. */
3941 print_one_symbol (struct bfd_link_hash_entry *hash_entry, void *ptr)
3943 asection *sec = (asection *) ptr;
3945 if ((hash_entry->type == bfd_link_hash_defined
3946 || hash_entry->type == bfd_link_hash_defweak)
3947 && sec == hash_entry->u.def.section)
3951 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
3954 (hash_entry->u.def.value
3955 + hash_entry->u.def.section->output_offset
3956 + hash_entry->u.def.section->output_section->vma));
3958 minfo (" %T\n", hash_entry->root.string);
3965 hash_entry_addr_cmp (const void *a, const void *b)
3967 const struct bfd_link_hash_entry *l = *(const struct bfd_link_hash_entry **)a;
3968 const struct bfd_link_hash_entry *r = *(const struct bfd_link_hash_entry **)b;
3970 if (l->u.def.value < r->u.def.value)
3972 else if (l->u.def.value > r->u.def.value)
3979 print_all_symbols (asection *sec)
3981 struct fat_user_section_struct *ud =
3982 (struct fat_user_section_struct *) get_userdata (sec);
3983 struct map_symbol_def *def;
3984 struct bfd_link_hash_entry **entries;
3990 *ud->map_symbol_def_tail = 0;
3992 /* Sort the symbols by address. */
3993 entries = (struct bfd_link_hash_entry **)
3994 obstack_alloc (&map_obstack, ud->map_symbol_def_count * sizeof (*entries));
3996 for (i = 0, def = ud->map_symbol_def_head; def; def = def->next, i++)
3997 entries[i] = def->entry;
3999 qsort (entries, ud->map_symbol_def_count, sizeof (*entries),
4000 hash_entry_addr_cmp);
4002 /* Print the symbols. */
4003 for (i = 0; i < ud->map_symbol_def_count; i++)
4004 print_one_symbol (entries[i], sec);
4006 obstack_free (&map_obstack, entries);
4009 /* Print information about an input section to the map file. */
4012 print_input_section (asection *i, bfd_boolean is_discarded)
4014 bfd_size_type size = i->size;
4021 minfo ("%s", i->name);
4023 len = 1 + strlen (i->name);
4024 if (len >= SECTION_NAME_MAP_LENGTH - 1)
4029 while (len < SECTION_NAME_MAP_LENGTH)
4035 if (i->output_section != NULL
4036 && i->output_section->owner == link_info.output_bfd)
4037 addr = i->output_section->vma + i->output_offset;
4045 minfo ("0x%V %W %B\n", addr, TO_ADDR (size), i->owner);
4047 if (size != i->rawsize && i->rawsize != 0)
4049 len = SECTION_NAME_MAP_LENGTH + 3;
4061 minfo (_("%W (size before relaxing)\n"), i->rawsize);
4064 if (i->output_section != NULL
4065 && i->output_section->owner == link_info.output_bfd)
4067 if (link_info.reduce_memory_overheads)
4068 bfd_link_hash_traverse (link_info.hash, print_one_symbol, i);
4070 print_all_symbols (i);
4072 /* Update print_dot, but make sure that we do not move it
4073 backwards - this could happen if we have overlays and a
4074 later overlay is shorter than an earier one. */
4075 if (addr + TO_ADDR (size) > print_dot)
4076 print_dot = addr + TO_ADDR (size);
4081 print_fill_statement (lang_fill_statement_type *fill)
4085 fputs (" FILL mask 0x", config.map_file);
4086 for (p = fill->fill->data, size = fill->fill->size; size != 0; p++, size--)
4087 fprintf (config.map_file, "%02x", *p);
4088 fputs ("\n", config.map_file);
4092 print_data_statement (lang_data_statement_type *data)
4100 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
4103 addr = data->output_offset;
4104 if (data->output_section != NULL)
4105 addr += data->output_section->vma;
4133 minfo ("0x%V %W %s 0x%v", addr, size, name, data->value);
4135 if (data->exp->type.node_class != etree_value)
4138 exp_print_tree (data->exp);
4143 print_dot = addr + TO_ADDR (size);
4146 /* Print an address statement. These are generated by options like
4150 print_address_statement (lang_address_statement_type *address)
4152 minfo (_("Address of section %s set to "), address->section_name);
4153 exp_print_tree (address->address);
4157 /* Print a reloc statement. */
4160 print_reloc_statement (lang_reloc_statement_type *reloc)
4167 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
4170 addr = reloc->output_offset;
4171 if (reloc->output_section != NULL)
4172 addr += reloc->output_section->vma;
4174 size = bfd_get_reloc_size (reloc->howto);
4176 minfo ("0x%V %W RELOC %s ", addr, size, reloc->howto->name);
4178 if (reloc->name != NULL)
4179 minfo ("%s+", reloc->name);
4181 minfo ("%s+", reloc->section->name);
4183 exp_print_tree (reloc->addend_exp);
4187 print_dot = addr + TO_ADDR (size);
4191 print_padding_statement (lang_padding_statement_type *s)
4199 len = sizeof " *fill*" - 1;
4200 while (len < SECTION_NAME_MAP_LENGTH)
4206 addr = s->output_offset;
4207 if (s->output_section != NULL)
4208 addr += s->output_section->vma;
4209 minfo ("0x%V %W ", addr, (bfd_vma) s->size);
4211 if (s->fill->size != 0)
4215 for (p = s->fill->data, size = s->fill->size; size != 0; p++, size--)
4216 fprintf (config.map_file, "%02x", *p);
4221 print_dot = addr + TO_ADDR (s->size);
4225 print_wild_statement (lang_wild_statement_type *w,
4226 lang_output_section_statement_type *os)
4228 struct wildcard_list *sec;
4232 if (w->filenames_sorted)
4234 if (w->filename != NULL)
4235 minfo ("%s", w->filename);
4238 if (w->filenames_sorted)
4242 for (sec = w->section_list; sec; sec = sec->next)
4244 if (sec->spec.sorted)
4246 if (sec->spec.exclude_name_list != NULL)
4249 minfo ("EXCLUDE_FILE(%s", sec->spec.exclude_name_list->name);
4250 for (tmp = sec->spec.exclude_name_list->next; tmp; tmp = tmp->next)
4251 minfo (" %s", tmp->name);
4254 if (sec->spec.name != NULL)
4255 minfo ("%s", sec->spec.name);
4258 if (sec->spec.sorted)
4267 print_statement_list (w->children.head, os);
4270 /* Print a group statement. */
4273 print_group (lang_group_statement_type *s,
4274 lang_output_section_statement_type *os)
4276 fprintf (config.map_file, "START GROUP\n");
4277 print_statement_list (s->children.head, os);
4278 fprintf (config.map_file, "END GROUP\n");
4281 /* Print the list of statements in S.
4282 This can be called for any statement type. */
4285 print_statement_list (lang_statement_union_type *s,
4286 lang_output_section_statement_type *os)
4290 print_statement (s, os);
4295 /* Print the first statement in statement list S.
4296 This can be called for any statement type. */
4299 print_statement (lang_statement_union_type *s,
4300 lang_output_section_statement_type *os)
4302 switch (s->header.type)
4305 fprintf (config.map_file, _("Fail with %d\n"), s->header.type);
4308 case lang_constructors_statement_enum:
4309 if (constructor_list.head != NULL)
4311 if (constructors_sorted)
4312 minfo (" SORT (CONSTRUCTORS)\n");
4314 minfo (" CONSTRUCTORS\n");
4315 print_statement_list (constructor_list.head, os);
4318 case lang_wild_statement_enum:
4319 print_wild_statement (&s->wild_statement, os);
4321 case lang_address_statement_enum:
4322 print_address_statement (&s->address_statement);
4324 case lang_object_symbols_statement_enum:
4325 minfo (" CREATE_OBJECT_SYMBOLS\n");
4327 case lang_fill_statement_enum:
4328 print_fill_statement (&s->fill_statement);
4330 case lang_data_statement_enum:
4331 print_data_statement (&s->data_statement);
4333 case lang_reloc_statement_enum:
4334 print_reloc_statement (&s->reloc_statement);
4336 case lang_input_section_enum:
4337 print_input_section (s->input_section.section, FALSE);
4339 case lang_padding_statement_enum:
4340 print_padding_statement (&s->padding_statement);
4342 case lang_output_section_statement_enum:
4343 print_output_section_statement (&s->output_section_statement);
4345 case lang_assignment_statement_enum:
4346 print_assignment (&s->assignment_statement, os);
4348 case lang_target_statement_enum:
4349 fprintf (config.map_file, "TARGET(%s)\n", s->target_statement.target);
4351 case lang_output_statement_enum:
4352 minfo ("OUTPUT(%s", s->output_statement.name);
4353 if (output_target != NULL)
4354 minfo (" %s", output_target);
4357 case lang_input_statement_enum:
4358 print_input_statement (&s->input_statement);
4360 case lang_group_statement_enum:
4361 print_group (&s->group_statement, os);
4363 case lang_insert_statement_enum:
4364 minfo ("INSERT %s %s\n",
4365 s->insert_statement.is_before ? "BEFORE" : "AFTER",
4366 s->insert_statement.where);
4372 print_statements (void)
4374 print_statement_list (statement_list.head, abs_output_section);
4377 /* Print the first N statements in statement list S to STDERR.
4378 If N == 0, nothing is printed.
4379 If N < 0, the entire list is printed.
4380 Intended to be called from GDB. */
4383 dprint_statement (lang_statement_union_type *s, int n)
4385 FILE *map_save = config.map_file;
4387 config.map_file = stderr;
4390 print_statement_list (s, abs_output_section);
4393 while (s && --n >= 0)
4395 print_statement (s, abs_output_section);
4400 config.map_file = map_save;
4404 insert_pad (lang_statement_union_type **ptr,
4406 unsigned int alignment_needed,
4407 asection *output_section,
4410 static fill_type zero_fill = { 1, { 0 } };
4411 lang_statement_union_type *pad = NULL;
4413 if (ptr != &statement_list.head)
4414 pad = ((lang_statement_union_type *)
4415 ((char *) ptr - offsetof (lang_statement_union_type, header.next)));
4417 && pad->header.type == lang_padding_statement_enum
4418 && pad->padding_statement.output_section == output_section)
4420 /* Use the existing pad statement. */
4422 else if ((pad = *ptr) != NULL
4423 && pad->header.type == lang_padding_statement_enum
4424 && pad->padding_statement.output_section == output_section)
4426 /* Use the existing pad statement. */
4430 /* Make a new padding statement, linked into existing chain. */
4431 pad = (lang_statement_union_type *)
4432 stat_alloc (sizeof (lang_padding_statement_type));
4433 pad->header.next = *ptr;
4435 pad->header.type = lang_padding_statement_enum;
4436 pad->padding_statement.output_section = output_section;
4439 pad->padding_statement.fill = fill;
4441 pad->padding_statement.output_offset = dot - output_section->vma;
4442 pad->padding_statement.size = alignment_needed;
4443 output_section->size += alignment_needed;
4446 /* Work out how much this section will move the dot point. */
4450 (lang_statement_union_type **this_ptr,
4451 lang_output_section_statement_type *output_section_statement,
4455 lang_input_section_type *is = &((*this_ptr)->input_section);
4456 asection *i = is->section;
4458 if (!((lang_input_statement_type *) i->owner->usrdata)->just_syms_flag
4459 && (i->flags & SEC_EXCLUDE) == 0)
4461 unsigned int alignment_needed;
4464 /* Align this section first to the input sections requirement,
4465 then to the output section's requirement. If this alignment
4466 is greater than any seen before, then record it too. Perform
4467 the alignment by inserting a magic 'padding' statement. */
4469 if (output_section_statement->subsection_alignment != -1)
4470 i->alignment_power = output_section_statement->subsection_alignment;
4472 o = output_section_statement->bfd_section;
4473 if (o->alignment_power < i->alignment_power)
4474 o->alignment_power = i->alignment_power;
4476 alignment_needed = align_power (dot, i->alignment_power) - dot;
4478 if (alignment_needed != 0)
4480 insert_pad (this_ptr, fill, TO_SIZE (alignment_needed), o, dot);
4481 dot += alignment_needed;
4484 /* Remember where in the output section this input section goes. */
4486 i->output_offset = dot - o->vma;
4488 /* Mark how big the output section must be to contain this now. */
4489 dot += TO_ADDR (i->size);
4490 o->size = TO_SIZE (dot - o->vma);
4494 i->output_offset = i->vma - output_section_statement->bfd_section->vma;
4501 sort_sections_by_lma (const void *arg1, const void *arg2)
4503 const asection *sec1 = *(const asection **) arg1;
4504 const asection *sec2 = *(const asection **) arg2;
4506 if (bfd_section_lma (sec1->owner, sec1)
4507 < bfd_section_lma (sec2->owner, sec2))
4509 else if (bfd_section_lma (sec1->owner, sec1)
4510 > bfd_section_lma (sec2->owner, sec2))
4512 else if (sec1->id < sec2->id)
4514 else if (sec1->id > sec2->id)
4520 #define IGNORE_SECTION(s) \
4521 ((s->flags & SEC_NEVER_LOAD) != 0 \
4522 || (s->flags & SEC_ALLOC) == 0 \
4523 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
4524 && (s->flags & SEC_LOAD) == 0))
4526 /* Check to see if any allocated sections overlap with other allocated
4527 sections. This can happen if a linker script specifies the output
4528 section addresses of the two sections. Also check whether any memory
4529 region has overflowed. */
4532 lang_check_section_addresses (void)
4535 asection **sections, **spp;
4542 lang_memory_region_type *m;
4544 if (bfd_count_sections (link_info.output_bfd) <= 1)
4547 amt = bfd_count_sections (link_info.output_bfd) * sizeof (asection *);
4548 sections = (asection **) xmalloc (amt);
4550 /* Scan all sections in the output list. */
4552 for (s = link_info.output_bfd->sections; s != NULL; s = s->next)
4554 /* Only consider loadable sections with real contents. */
4555 if ((s->flags & SEC_NEVER_LOAD)
4556 || !(s->flags & SEC_LOAD)
4557 || !(s->flags & SEC_ALLOC)
4561 sections[count] = s;
4568 qsort (sections, (size_t) count, sizeof (asection *),
4569 sort_sections_by_lma);
4573 s_start = bfd_section_lma (link_info.output_bfd, s);
4574 s_end = s_start + TO_ADDR (s->size) - 1;
4575 for (count--; count; count--)
4577 /* We must check the sections' LMA addresses not their VMA
4578 addresses because overlay sections can have overlapping VMAs
4579 but they must have distinct LMAs. */
4584 s_start = bfd_section_lma (link_info.output_bfd, s);
4585 s_end = s_start + TO_ADDR (s->size) - 1;
4587 /* Look for an overlap. */
4588 if (s_end >= os_start && s_start <= os_end)
4589 einfo (_("%X%P: section %s loaded at [%V,%V] overlaps section %s loaded at [%V,%V]\n"),
4590 s->name, s_start, s_end, os->name, os_start, os_end);
4595 /* If any memory region has overflowed, report by how much.
4596 We do not issue this diagnostic for regions that had sections
4597 explicitly placed outside their bounds; os_region_check's
4598 diagnostics are adequate for that case.
4600 FIXME: It is conceivable that m->current - (m->origin + m->length)
4601 might overflow a 32-bit integer. There is, alas, no way to print
4602 a bfd_vma quantity in decimal. */
4603 for (m = lang_memory_region_list; m; m = m->next)
4604 if (m->had_full_message)
4605 einfo (_("%X%P: region `%s' overflowed by %ld bytes\n"),
4606 m->name_list.name, (long)(m->current - (m->origin + m->length)));
4610 /* Make sure the new address is within the region. We explicitly permit the
4611 current address to be at the exact end of the region when the address is
4612 non-zero, in case the region is at the end of addressable memory and the
4613 calculation wraps around. */
4616 os_region_check (lang_output_section_statement_type *os,
4617 lang_memory_region_type *region,
4621 if ((region->current < region->origin
4622 || (region->current - region->origin > region->length))
4623 && ((region->current != region->origin + region->length)
4628 einfo (_("%X%P: address 0x%v of %B section `%s'"
4629 " is not within region `%s'\n"),
4631 os->bfd_section->owner,
4632 os->bfd_section->name,
4633 region->name_list.name);
4635 else if (!region->had_full_message)
4637 region->had_full_message = TRUE;
4639 einfo (_("%X%P: %B section `%s' will not fit in region `%s'\n"),
4640 os->bfd_section->owner,
4641 os->bfd_section->name,
4642 region->name_list.name);
4647 /* Set the sizes for all the output sections. */
4650 lang_size_sections_1
4651 (lang_statement_union_type *s,
4652 lang_output_section_statement_type *output_section_statement,
4653 lang_statement_union_type **prev,
4657 bfd_boolean check_regions)
4659 /* Size up the sections from their constituent parts. */
4660 for (; s != NULL; s = s->header.next)
4662 switch (s->header.type)
4664 case lang_output_section_statement_enum:
4666 bfd_vma newdot, after;
4667 lang_output_section_statement_type *os;
4668 lang_memory_region_type *r;
4670 os = &s->output_section_statement;
4671 /* FIXME: We shouldn't need to zero section vmas for ld -r
4672 here, in lang_insert_orphan, or in the default linker scripts.
4673 This is covering for coff backend linker bugs. See PR6945. */
4674 if (os->addr_tree == NULL
4675 && link_info.relocatable
4676 && (bfd_get_flavour (link_info.output_bfd)
4677 == bfd_target_coff_flavour))
4678 os->addr_tree = exp_intop (0);
4679 if (os->addr_tree != NULL)
4681 os->processed_vma = FALSE;
4682 exp_fold_tree (os->addr_tree, bfd_abs_section_ptr, &dot);
4684 if (expld.result.valid_p)
4685 dot = expld.result.value + expld.result.section->vma;
4686 else if (expld.phase != lang_mark_phase_enum)
4687 einfo (_("%F%S: non constant or forward reference"
4688 " address expression for section %s\n"),
4692 if (os->bfd_section == NULL)
4693 /* This section was removed or never actually created. */
4696 /* If this is a COFF shared library section, use the size and
4697 address from the input section. FIXME: This is COFF
4698 specific; it would be cleaner if there were some other way
4699 to do this, but nothing simple comes to mind. */
4700 if (((bfd_get_flavour (link_info.output_bfd)
4701 == bfd_target_ecoff_flavour)
4702 || (bfd_get_flavour (link_info.output_bfd)
4703 == bfd_target_coff_flavour))
4704 && (os->bfd_section->flags & SEC_COFF_SHARED_LIBRARY) != 0)
4708 if (os->children.head == NULL
4709 || os->children.head->header.next != NULL
4710 || (os->children.head->header.type
4711 != lang_input_section_enum))
4712 einfo (_("%P%X: Internal error on COFF shared library"
4713 " section %s\n"), os->name);
4715 input = os->children.head->input_section.section;
4716 bfd_set_section_vma (os->bfd_section->owner,
4718 bfd_section_vma (input->owner, input));
4719 os->bfd_section->size = input->size;
4724 if (bfd_is_abs_section (os->bfd_section))
4726 /* No matter what happens, an abs section starts at zero. */
4727 ASSERT (os->bfd_section->vma == 0);
4733 if (os->addr_tree == NULL)
4735 /* No address specified for this section, get one
4736 from the region specification. */
4737 if (os->region == NULL
4738 || ((os->bfd_section->flags & (SEC_ALLOC | SEC_LOAD))
4739 && os->region->name_list.name[0] == '*'
4740 && strcmp (os->region->name_list.name,
4741 DEFAULT_MEMORY_REGION) == 0))
4743 os->region = lang_memory_default (os->bfd_section);
4746 /* If a loadable section is using the default memory
4747 region, and some non default memory regions were
4748 defined, issue an error message. */
4750 && !IGNORE_SECTION (os->bfd_section)
4751 && ! link_info.relocatable
4753 && strcmp (os->region->name_list.name,
4754 DEFAULT_MEMORY_REGION) == 0
4755 && lang_memory_region_list != NULL
4756 && (strcmp (lang_memory_region_list->name_list.name,
4757 DEFAULT_MEMORY_REGION) != 0
4758 || lang_memory_region_list->next != NULL)
4759 && expld.phase != lang_mark_phase_enum)
4761 /* By default this is an error rather than just a
4762 warning because if we allocate the section to the
4763 default memory region we can end up creating an
4764 excessively large binary, or even seg faulting when
4765 attempting to perform a negative seek. See
4766 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4767 for an example of this. This behaviour can be
4768 overridden by the using the --no-check-sections
4770 if (command_line.check_section_addresses)
4771 einfo (_("%P%F: error: no memory region specified"
4772 " for loadable section `%s'\n"),
4773 bfd_get_section_name (link_info.output_bfd,
4776 einfo (_("%P: warning: no memory region specified"
4777 " for loadable section `%s'\n"),
4778 bfd_get_section_name (link_info.output_bfd,
4782 newdot = os->region->current;
4783 align = os->bfd_section->alignment_power;
4786 align = os->section_alignment;
4788 /* Align to what the section needs. */
4791 bfd_vma savedot = newdot;
4792 newdot = align_power (newdot, align);
4794 if (newdot != savedot
4795 && (config.warn_section_align
4796 || os->addr_tree != NULL)
4797 && expld.phase != lang_mark_phase_enum)
4798 einfo (_("%P: warning: changing start of section"
4799 " %s by %lu bytes\n"),
4800 os->name, (unsigned long) (newdot - savedot));
4803 bfd_set_section_vma (0, os->bfd_section, newdot);
4805 os->bfd_section->output_offset = 0;
4808 lang_size_sections_1 (os->children.head, os, &os->children.head,
4809 os->fill, newdot, relax, check_regions);
4811 os->processed_vma = TRUE;
4813 if (bfd_is_abs_section (os->bfd_section) || os->ignored)
4814 /* Except for some special linker created sections,
4815 no output section should change from zero size
4816 after strip_excluded_output_sections. A non-zero
4817 size on an ignored section indicates that some
4818 input section was not sized early enough. */
4819 ASSERT (os->bfd_section->size == 0);
4822 dot = os->bfd_section->vma;
4824 /* Put the section within the requested block size, or
4825 align at the block boundary. */
4827 + TO_ADDR (os->bfd_section->size)
4828 + os->block_value - 1)
4829 & - (bfd_vma) os->block_value);
4831 os->bfd_section->size = TO_SIZE (after - os->bfd_section->vma);
4834 /* Set section lma. */
4837 r = lang_memory_region_lookup (DEFAULT_MEMORY_REGION, FALSE);
4841 bfd_vma lma = exp_get_abs_int (os->load_base, 0, "load base");
4842 os->bfd_section->lma = lma;
4844 else if (os->lma_region != NULL)
4846 bfd_vma lma = os->lma_region->current;
4848 if (os->section_alignment != -1)
4849 lma = align_power (lma, os->section_alignment);
4850 os->bfd_section->lma = lma;
4852 else if (r->last_os != NULL
4853 && (os->bfd_section->flags & SEC_ALLOC) != 0)
4858 last = r->last_os->output_section_statement.bfd_section;
4860 /* A backwards move of dot should be accompanied by
4861 an explicit assignment to the section LMA (ie.
4862 os->load_base set) because backwards moves can
4863 create overlapping LMAs. */
4865 && os->bfd_section->size != 0
4866 && dot + os->bfd_section->size <= last->vma)
4868 /* If dot moved backwards then leave lma equal to
4869 vma. This is the old default lma, which might
4870 just happen to work when the backwards move is
4871 sufficiently large. Nag if this changes anything,
4872 so people can fix their linker scripts. */
4874 if (last->vma != last->lma)
4875 einfo (_("%P: warning: dot moved backwards before `%s'\n"),
4880 /* If this is an overlay, set the current lma to that
4881 at the end of the previous section. */
4882 if (os->sectype == overlay_section)
4883 lma = last->lma + last->size;
4885 /* Otherwise, keep the same lma to vma relationship
4886 as the previous section. */
4888 lma = dot + last->lma - last->vma;
4890 if (os->section_alignment != -1)
4891 lma = align_power (lma, os->section_alignment);
4892 os->bfd_section->lma = lma;
4895 os->processed_lma = TRUE;
4897 if (bfd_is_abs_section (os->bfd_section) || os->ignored)
4900 /* Keep track of normal sections using the default
4901 lma region. We use this to set the lma for
4902 following sections. Overlays or other linker
4903 script assignment to lma might mean that the
4904 default lma == vma is incorrect.
4905 To avoid warnings about dot moving backwards when using
4906 -Ttext, don't start tracking sections until we find one
4907 of non-zero size or with lma set differently to vma. */
4908 if (((os->bfd_section->flags & SEC_HAS_CONTENTS) != 0
4909 || (os->bfd_section->flags & SEC_THREAD_LOCAL) == 0)
4910 && (os->bfd_section->flags & SEC_ALLOC) != 0
4911 && (os->bfd_section->size != 0
4912 || (r->last_os == NULL
4913 && os->bfd_section->vma != os->bfd_section->lma)
4914 || (r->last_os != NULL
4915 && dot >= (r->last_os->output_section_statement
4916 .bfd_section->vma)))
4917 && os->lma_region == NULL
4918 && !link_info.relocatable)
4921 /* .tbss sections effectively have zero size. */
4922 if ((os->bfd_section->flags & SEC_HAS_CONTENTS) != 0
4923 || (os->bfd_section->flags & SEC_THREAD_LOCAL) == 0
4924 || link_info.relocatable)
4925 dot += TO_ADDR (os->bfd_section->size);
4927 if (os->update_dot_tree != 0)
4928 exp_fold_tree (os->update_dot_tree, bfd_abs_section_ptr, &dot);
4930 /* Update dot in the region ?
4931 We only do this if the section is going to be allocated,
4932 since unallocated sections do not contribute to the region's
4933 overall size in memory.
4935 If the SEC_NEVER_LOAD bit is not set, it will affect the
4936 addresses of sections after it. We have to update
4938 if (os->region != NULL
4939 && ((os->bfd_section->flags & SEC_NEVER_LOAD) == 0
4940 || (os->bfd_section->flags & (SEC_ALLOC | SEC_LOAD))))
4942 os->region->current = dot;
4945 /* Make sure the new address is within the region. */
4946 os_region_check (os, os->region, os->addr_tree,
4947 os->bfd_section->vma);
4949 if (os->lma_region != NULL && os->lma_region != os->region
4950 && (os->bfd_section->flags & SEC_LOAD))
4952 os->lma_region->current
4953 = os->bfd_section->lma + TO_ADDR (os->bfd_section->size);
4956 os_region_check (os, os->lma_region, NULL,
4957 os->bfd_section->lma);
4963 case lang_constructors_statement_enum:
4964 dot = lang_size_sections_1 (constructor_list.head,
4965 output_section_statement,
4966 &s->wild_statement.children.head,
4967 fill, dot, relax, check_regions);
4970 case lang_data_statement_enum:
4972 unsigned int size = 0;
4974 s->data_statement.output_offset =
4975 dot - output_section_statement->bfd_section->vma;
4976 s->data_statement.output_section =
4977 output_section_statement->bfd_section;
4979 /* We might refer to provided symbols in the expression, and
4980 need to mark them as needed. */
4981 exp_fold_tree (s->data_statement.exp, bfd_abs_section_ptr, &dot);
4983 switch (s->data_statement.type)
5001 if (size < TO_SIZE ((unsigned) 1))
5002 size = TO_SIZE ((unsigned) 1);
5003 dot += TO_ADDR (size);
5004 output_section_statement->bfd_section->size += size;
5008 case lang_reloc_statement_enum:
5012 s->reloc_statement.output_offset =
5013 dot - output_section_statement->bfd_section->vma;
5014 s->reloc_statement.output_section =
5015 output_section_statement->bfd_section;
5016 size = bfd_get_reloc_size (s->reloc_statement.howto);
5017 dot += TO_ADDR (size);
5018 output_section_statement->bfd_section->size += size;
5022 case lang_wild_statement_enum:
5023 dot = lang_size_sections_1 (s->wild_statement.children.head,
5024 output_section_statement,
5025 &s->wild_statement.children.head,
5026 fill, dot, relax, check_regions);
5029 case lang_object_symbols_statement_enum:
5030 link_info.create_object_symbols_section =
5031 output_section_statement->bfd_section;
5034 case lang_output_statement_enum:
5035 case lang_target_statement_enum:
5038 case lang_input_section_enum:
5042 i = (*prev)->input_section.section;
5047 if (! bfd_relax_section (i->owner, i, &link_info, &again))
5048 einfo (_("%P%F: can't relax section: %E\n"));
5052 dot = size_input_section (prev, output_section_statement,
5053 output_section_statement->fill, dot);
5057 case lang_input_statement_enum:
5060 case lang_fill_statement_enum:
5061 s->fill_statement.output_section =
5062 output_section_statement->bfd_section;
5064 fill = s->fill_statement.fill;
5067 case lang_assignment_statement_enum:
5069 bfd_vma newdot = dot;
5070 etree_type *tree = s->assignment_statement.exp;
5072 expld.dataseg.relro = exp_dataseg_relro_none;
5074 exp_fold_tree (tree,
5075 output_section_statement->bfd_section,
5078 if (expld.dataseg.relro == exp_dataseg_relro_start)
5080 if (!expld.dataseg.relro_start_stat)
5081 expld.dataseg.relro_start_stat = s;
5084 ASSERT (expld.dataseg.relro_start_stat == s);
5087 else if (expld.dataseg.relro == exp_dataseg_relro_end)
5089 if (!expld.dataseg.relro_end_stat)
5090 expld.dataseg.relro_end_stat = s;
5093 ASSERT (expld.dataseg.relro_end_stat == s);
5096 expld.dataseg.relro = exp_dataseg_relro_none;
5098 /* This symbol is relative to this section. */
5099 if ((tree->type.node_class == etree_provided
5100 || tree->type.node_class == etree_assign)
5101 && (tree->assign.dst [0] != '.'
5102 || tree->assign.dst [1] != '\0'))
5103 output_section_statement->section_relative_symbol = 1;
5105 if (!output_section_statement->ignored)
5107 if (output_section_statement == abs_output_section)
5109 /* If we don't have an output section, then just adjust
5110 the default memory address. */
5111 lang_memory_region_lookup (DEFAULT_MEMORY_REGION,
5112 FALSE)->current = newdot;
5114 else if (newdot != dot)
5116 /* Insert a pad after this statement. We can't
5117 put the pad before when relaxing, in case the
5118 assignment references dot. */
5119 insert_pad (&s->header.next, fill, TO_SIZE (newdot - dot),
5120 output_section_statement->bfd_section, dot);
5122 /* Don't neuter the pad below when relaxing. */
5125 /* If dot is advanced, this implies that the section
5126 should have space allocated to it, unless the
5127 user has explicitly stated that the section
5128 should never be loaded. */
5129 if (!(output_section_statement->flags & SEC_NEVER_LOAD))
5130 output_section_statement->bfd_section->flags |= SEC_ALLOC;
5137 case lang_padding_statement_enum:
5138 /* If this is the first time lang_size_sections is called,
5139 we won't have any padding statements. If this is the
5140 second or later passes when relaxing, we should allow
5141 padding to shrink. If padding is needed on this pass, it
5142 will be added back in. */
5143 s->padding_statement.size = 0;
5145 /* Make sure output_offset is valid. If relaxation shrinks
5146 the section and this pad isn't needed, it's possible to
5147 have output_offset larger than the final size of the
5148 section. bfd_set_section_contents will complain even for
5149 a pad size of zero. */
5150 s->padding_statement.output_offset
5151 = dot - output_section_statement->bfd_section->vma;
5154 case lang_group_statement_enum:
5155 dot = lang_size_sections_1 (s->group_statement.children.head,
5156 output_section_statement,
5157 &s->group_statement.children.head,
5158 fill, dot, relax, check_regions);
5161 case lang_insert_statement_enum:
5164 /* We can only get here when relaxing is turned on. */
5165 case lang_address_statement_enum:
5172 prev = &s->header.next;
5177 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
5178 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
5179 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
5180 segments. We are allowed an opportunity to override this decision. */
5183 ldlang_override_segment_assignment (struct bfd_link_info * info ATTRIBUTE_UNUSED,
5184 bfd * abfd ATTRIBUTE_UNUSED,
5185 asection * current_section,
5186 asection * previous_section,
5187 bfd_boolean new_segment)
5189 lang_output_section_statement_type * cur;
5190 lang_output_section_statement_type * prev;
5192 /* The checks below are only necessary when the BFD library has decided
5193 that the two sections ought to be placed into the same segment. */
5197 /* Paranoia checks. */
5198 if (current_section == NULL || previous_section == NULL)
5201 /* Find the memory regions associated with the two sections.
5202 We call lang_output_section_find() here rather than scanning the list
5203 of output sections looking for a matching section pointer because if
5204 we have a large number of sections then a hash lookup is faster. */
5205 cur = lang_output_section_find (current_section->name);
5206 prev = lang_output_section_find (previous_section->name);
5208 /* More paranoia. */
5209 if (cur == NULL || prev == NULL)
5212 /* If the regions are different then force the sections to live in
5213 different segments. See the email thread starting at the following
5214 URL for the reasons why this is necessary:
5215 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
5216 return cur->region != prev->region;
5220 one_lang_size_sections_pass (bfd_boolean *relax, bfd_boolean check_regions)
5222 lang_statement_iteration++;
5223 lang_size_sections_1 (statement_list.head, abs_output_section,
5224 &statement_list.head, 0, 0, relax, check_regions);
5228 lang_size_sections (bfd_boolean *relax, bfd_boolean check_regions)
5230 expld.phase = lang_allocating_phase_enum;
5231 expld.dataseg.phase = exp_dataseg_none;
5233 one_lang_size_sections_pass (relax, check_regions);
5234 if (expld.dataseg.phase == exp_dataseg_end_seen
5235 && link_info.relro && expld.dataseg.relro_end)
5237 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
5238 to put expld.dataseg.relro on a (common) page boundary. */
5239 bfd_vma min_base, old_base, relro_end, maxpage;
5241 expld.dataseg.phase = exp_dataseg_relro_adjust;
5242 maxpage = expld.dataseg.maxpagesize;
5243 /* MIN_BASE is the absolute minimum address we are allowed to start the
5244 read-write segment (byte before will be mapped read-only). */
5245 min_base = (expld.dataseg.min_base + maxpage - 1) & ~(maxpage - 1);
5246 /* OLD_BASE is the address for a feasible minimum address which will
5247 still not cause a data overlap inside MAXPAGE causing file offset skip
5249 old_base = expld.dataseg.base;
5250 expld.dataseg.base += (-expld.dataseg.relro_end
5251 & (expld.dataseg.pagesize - 1));
5252 /* Compute the expected PT_GNU_RELRO segment end. */
5253 relro_end = ((expld.dataseg.relro_end + expld.dataseg.pagesize - 1)
5254 & ~(expld.dataseg.pagesize - 1));
5255 if (min_base + maxpage < expld.dataseg.base)
5257 expld.dataseg.base -= maxpage;
5258 relro_end -= maxpage;
5260 lang_reset_memory_regions ();
5261 one_lang_size_sections_pass (relax, check_regions);
5262 if (expld.dataseg.relro_end > relro_end)
5264 /* The alignment of sections between DATA_SEGMENT_ALIGN
5265 and DATA_SEGMENT_RELRO_END caused huge padding to be
5266 inserted at DATA_SEGMENT_RELRO_END. Try to start a bit lower so
5267 that the section alignments will fit in. */
5269 unsigned int max_alignment_power = 0;
5271 /* Find maximum alignment power of sections between
5272 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
5273 for (sec = link_info.output_bfd->sections; sec; sec = sec->next)
5274 if (sec->vma >= expld.dataseg.base
5275 && sec->vma < expld.dataseg.relro_end
5276 && sec->alignment_power > max_alignment_power)
5277 max_alignment_power = sec->alignment_power;
5279 if (((bfd_vma) 1 << max_alignment_power) < expld.dataseg.pagesize)
5281 if (expld.dataseg.base - (1 << max_alignment_power) < old_base)
5282 expld.dataseg.base += expld.dataseg.pagesize;
5283 expld.dataseg.base -= (1 << max_alignment_power);
5284 lang_reset_memory_regions ();
5285 one_lang_size_sections_pass (relax, check_regions);
5288 link_info.relro_start = expld.dataseg.base;
5289 link_info.relro_end = expld.dataseg.relro_end;
5291 else if (expld.dataseg.phase == exp_dataseg_end_seen)
5293 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
5294 a page could be saved in the data segment. */
5295 bfd_vma first, last;
5297 first = -expld.dataseg.base & (expld.dataseg.pagesize - 1);
5298 last = expld.dataseg.end & (expld.dataseg.pagesize - 1);
5300 && ((expld.dataseg.base & ~(expld.dataseg.pagesize - 1))
5301 != (expld.dataseg.end & ~(expld.dataseg.pagesize - 1)))
5302 && first + last <= expld.dataseg.pagesize)
5304 expld.dataseg.phase = exp_dataseg_adjust;
5305 lang_reset_memory_regions ();
5306 one_lang_size_sections_pass (relax, check_regions);
5310 expld.phase = lang_final_phase_enum;
5313 /* Worker function for lang_do_assignments. Recursiveness goes here. */
5316 lang_do_assignments_1 (lang_statement_union_type *s,
5317 lang_output_section_statement_type *current_os,
5321 for (; s != NULL; s = s->header.next)
5323 switch (s->header.type)
5325 case lang_constructors_statement_enum:
5326 dot = lang_do_assignments_1 (constructor_list.head,
5327 current_os, fill, dot);
5330 case lang_output_section_statement_enum:
5332 lang_output_section_statement_type *os;
5334 os = &(s->output_section_statement);
5335 if (os->bfd_section != NULL && !os->ignored)
5337 dot = os->bfd_section->vma;
5339 lang_do_assignments_1 (os->children.head, os, os->fill, dot);
5341 /* .tbss sections effectively have zero size. */
5342 if ((os->bfd_section->flags & SEC_HAS_CONTENTS) != 0
5343 || (os->bfd_section->flags & SEC_THREAD_LOCAL) == 0
5344 || link_info.relocatable)
5345 dot += TO_ADDR (os->bfd_section->size);
5347 if (os->update_dot_tree != NULL)
5348 exp_fold_tree (os->update_dot_tree, bfd_abs_section_ptr, &dot);
5353 case lang_wild_statement_enum:
5355 dot = lang_do_assignments_1 (s->wild_statement.children.head,
5356 current_os, fill, dot);
5359 case lang_object_symbols_statement_enum:
5360 case lang_output_statement_enum:
5361 case lang_target_statement_enum:
5364 case lang_data_statement_enum:
5365 exp_fold_tree (s->data_statement.exp, bfd_abs_section_ptr, &dot);
5366 if (expld.result.valid_p)
5367 s->data_statement.value = (expld.result.value
5368 + expld.result.section->vma);
5370 einfo (_("%F%P: invalid data statement\n"));
5373 switch (s->data_statement.type)
5391 if (size < TO_SIZE ((unsigned) 1))
5392 size = TO_SIZE ((unsigned) 1);
5393 dot += TO_ADDR (size);
5397 case lang_reloc_statement_enum:
5398 exp_fold_tree (s->reloc_statement.addend_exp,
5399 bfd_abs_section_ptr, &dot);
5400 if (expld.result.valid_p)
5401 s->reloc_statement.addend_value = expld.result.value;
5403 einfo (_("%F%P: invalid reloc statement\n"));
5404 dot += TO_ADDR (bfd_get_reloc_size (s->reloc_statement.howto));
5407 case lang_input_section_enum:
5409 asection *in = s->input_section.section;
5411 if ((in->flags & SEC_EXCLUDE) == 0)
5412 dot += TO_ADDR (in->size);
5416 case lang_input_statement_enum:
5419 case lang_fill_statement_enum:
5420 fill = s->fill_statement.fill;
5423 case lang_assignment_statement_enum:
5424 exp_fold_tree (s->assignment_statement.exp,
5425 current_os->bfd_section,
5429 case lang_padding_statement_enum:
5430 dot += TO_ADDR (s->padding_statement.size);
5433 case lang_group_statement_enum:
5434 dot = lang_do_assignments_1 (s->group_statement.children.head,
5435 current_os, fill, dot);
5438 case lang_insert_statement_enum:
5441 case lang_address_statement_enum:
5453 lang_do_assignments (void)
5455 lang_statement_iteration++;
5456 lang_do_assignments_1 (statement_list.head, abs_output_section, NULL, 0);
5459 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
5460 operator .startof. (section_name), it produces an undefined symbol
5461 .startof.section_name. Similarly, when it sees
5462 .sizeof. (section_name), it produces an undefined symbol
5463 .sizeof.section_name. For all the output sections, we look for
5464 such symbols, and set them to the correct value. */
5467 lang_set_startof (void)
5471 if (link_info.relocatable)
5474 for (s = link_info.output_bfd->sections; s != NULL; s = s->next)
5476 const char *secname;
5478 struct bfd_link_hash_entry *h;
5480 secname = bfd_get_section_name (link_info.output_bfd, s);
5481 buf = (char *) xmalloc (10 + strlen (secname));
5483 sprintf (buf, ".startof.%s", secname);
5484 h = bfd_link_hash_lookup (link_info.hash, buf, FALSE, FALSE, TRUE);
5485 if (h != NULL && h->type == bfd_link_hash_undefined)
5487 h->type = bfd_link_hash_defined;
5488 h->u.def.value = bfd_get_section_vma (link_info.output_bfd, s);
5489 h->u.def.section = bfd_abs_section_ptr;
5492 sprintf (buf, ".sizeof.%s", secname);
5493 h = bfd_link_hash_lookup (link_info.hash, buf, FALSE, FALSE, TRUE);
5494 if (h != NULL && h->type == bfd_link_hash_undefined)
5496 h->type = bfd_link_hash_defined;
5497 h->u.def.value = TO_ADDR (s->size);
5498 h->u.def.section = bfd_abs_section_ptr;
5508 struct bfd_link_hash_entry *h;
5511 if ((link_info.relocatable && !link_info.gc_sections)
5512 || (link_info.shared && !link_info.executable))
5513 warn = entry_from_cmdline;
5517 /* Force the user to specify a root when generating a relocatable with
5519 if (link_info.gc_sections && link_info.relocatable
5520 && (entry_symbol.name == NULL
5521 && ldlang_undef_chain_list_head == NULL))
5522 einfo (_("%P%F: gc-sections requires either an entry or "
5523 "an undefined symbol\n"));
5525 if (entry_symbol.name == NULL)
5527 /* No entry has been specified. Look for the default entry, but
5528 don't warn if we don't find it. */
5529 entry_symbol.name = entry_symbol_default;
5533 h = bfd_link_hash_lookup (link_info.hash, entry_symbol.name,
5534 FALSE, FALSE, TRUE);
5536 && (h->type == bfd_link_hash_defined
5537 || h->type == bfd_link_hash_defweak)
5538 && h->u.def.section->output_section != NULL)
5542 val = (h->u.def.value
5543 + bfd_get_section_vma (link_info.output_bfd,
5544 h->u.def.section->output_section)
5545 + h->u.def.section->output_offset);
5546 if (! bfd_set_start_address (link_info.output_bfd, val))
5547 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol.name);
5554 /* We couldn't find the entry symbol. Try parsing it as a
5556 val = bfd_scan_vma (entry_symbol.name, &send, 0);
5559 if (! bfd_set_start_address (link_info.output_bfd, val))
5560 einfo (_("%P%F: can't set start address\n"));
5566 /* Can't find the entry symbol, and it's not a number. Use
5567 the first address in the text section. */
5568 ts = bfd_get_section_by_name (link_info.output_bfd, entry_section);
5572 einfo (_("%P: warning: cannot find entry symbol %s;"
5573 " defaulting to %V\n"),
5575 bfd_get_section_vma (link_info.output_bfd, ts));
5576 if (!(bfd_set_start_address
5577 (link_info.output_bfd,
5578 bfd_get_section_vma (link_info.output_bfd, ts))))
5579 einfo (_("%P%F: can't set start address\n"));
5584 einfo (_("%P: warning: cannot find entry symbol %s;"
5585 " not setting start address\n"),
5591 /* Don't bfd_hash_table_free (&lang_definedness_table);
5592 map file output may result in a call of lang_track_definedness. */
5595 /* This is a small function used when we want to ignore errors from
5599 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED, ...)
5601 /* Don't do anything. */
5604 /* Check that the architecture of all the input files is compatible
5605 with the output file. Also call the backend to let it do any
5606 other checking that is needed. */
5611 lang_statement_union_type *file;
5613 const bfd_arch_info_type *compatible;
5615 for (file = file_chain.head; file != NULL; file = file->input_statement.next)
5617 input_bfd = file->input_statement.the_bfd;
5619 = bfd_arch_get_compatible (input_bfd, link_info.output_bfd,
5620 command_line.accept_unknown_input_arch);
5622 /* In general it is not possible to perform a relocatable
5623 link between differing object formats when the input
5624 file has relocations, because the relocations in the
5625 input format may not have equivalent representations in
5626 the output format (and besides BFD does not translate
5627 relocs for other link purposes than a final link). */
5628 if ((link_info.relocatable || link_info.emitrelocations)
5629 && (compatible == NULL
5630 || (bfd_get_flavour (input_bfd)
5631 != bfd_get_flavour (link_info.output_bfd)))
5632 && (bfd_get_file_flags (input_bfd) & HAS_RELOC) != 0)
5634 einfo (_("%P%F: Relocatable linking with relocations from"
5635 " format %s (%B) to format %s (%B) is not supported\n"),
5636 bfd_get_target (input_bfd), input_bfd,
5637 bfd_get_target (link_info.output_bfd), link_info.output_bfd);
5638 /* einfo with %F exits. */
5641 if (compatible == NULL)
5643 if (command_line.warn_mismatch)
5644 einfo (_("%P%X: %s architecture of input file `%B'"
5645 " is incompatible with %s output\n"),
5646 bfd_printable_name (input_bfd), input_bfd,
5647 bfd_printable_name (link_info.output_bfd));
5649 else if (bfd_count_sections (input_bfd))
5651 /* If the input bfd has no contents, it shouldn't set the
5652 private data of the output bfd. */
5654 bfd_error_handler_type pfn = NULL;
5656 /* If we aren't supposed to warn about mismatched input
5657 files, temporarily set the BFD error handler to a
5658 function which will do nothing. We still want to call
5659 bfd_merge_private_bfd_data, since it may set up
5660 information which is needed in the output file. */
5661 if (! command_line.warn_mismatch)
5662 pfn = bfd_set_error_handler (ignore_bfd_errors);
5663 if (! bfd_merge_private_bfd_data (input_bfd, link_info.output_bfd))
5665 if (command_line.warn_mismatch)
5666 einfo (_("%P%X: failed to merge target specific data"
5667 " of file %B\n"), input_bfd);
5669 if (! command_line.warn_mismatch)
5670 bfd_set_error_handler (pfn);
5675 /* Look through all the global common symbols and attach them to the
5676 correct section. The -sort-common command line switch may be used
5677 to roughly sort the entries by alignment. */
5682 if (command_line.inhibit_common_definition)
5684 if (link_info.relocatable
5685 && ! command_line.force_common_definition)
5688 if (! config.sort_common)
5689 bfd_link_hash_traverse (link_info.hash, lang_one_common, NULL);
5694 if (config.sort_common == sort_descending)
5696 for (power = 4; power > 0; power--)
5697 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
5700 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
5704 for (power = 0; power <= 4; power++)
5705 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
5708 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
5713 /* Place one common symbol in the correct section. */
5716 lang_one_common (struct bfd_link_hash_entry *h, void *info)
5718 unsigned int power_of_two;
5722 if (h->type != bfd_link_hash_common)
5726 power_of_two = h->u.c.p->alignment_power;
5728 if (config.sort_common == sort_descending
5729 && power_of_two < *(unsigned int *) info)
5731 else if (config.sort_common == sort_ascending
5732 && power_of_two > *(unsigned int *) info)
5735 section = h->u.c.p->section;
5736 if (!bfd_define_common_symbol (link_info.output_bfd, &link_info, h))
5737 einfo (_("%P%F: Could not define common symbol `%T': %E\n"),
5740 if (config.map_file != NULL)
5742 static bfd_boolean header_printed;
5747 if (! header_printed)
5749 minfo (_("\nAllocating common symbols\n"));
5750 minfo (_("Common symbol size file\n\n"));
5751 header_printed = TRUE;
5754 name = bfd_demangle (link_info.output_bfd, h->root.string,
5755 DMGL_ANSI | DMGL_PARAMS);
5758 minfo ("%s", h->root.string);
5759 len = strlen (h->root.string);
5764 len = strlen (name);
5780 if (size <= 0xffffffff)
5781 sprintf (buf, "%lx", (unsigned long) size);
5783 sprintf_vma (buf, size);
5793 minfo ("%B\n", section->owner);
5799 /* Run through the input files and ensure that every input section has
5800 somewhere to go. If one is found without a destination then create
5801 an input request and place it into the statement tree. */
5804 lang_place_orphans (void)
5806 LANG_FOR_EACH_INPUT_STATEMENT (file)
5810 for (s = file->the_bfd->sections; s != NULL; s = s->next)
5812 if (s->output_section == NULL)
5814 /* This section of the file is not attached, root
5815 around for a sensible place for it to go. */
5817 if (file->just_syms_flag)
5818 bfd_link_just_syms (file->the_bfd, s, &link_info);
5819 else if ((s->flags & SEC_EXCLUDE) != 0)
5820 s->output_section = bfd_abs_section_ptr;
5821 else if (strcmp (s->name, "COMMON") == 0)
5823 /* This is a lonely common section which must have
5824 come from an archive. We attach to the section
5825 with the wildcard. */
5826 if (! link_info.relocatable
5827 || command_line.force_common_definition)
5829 if (default_common_section == NULL)
5830 default_common_section
5831 = lang_output_section_statement_lookup (".bss", 0,
5833 lang_add_section (&default_common_section->children, s,
5834 default_common_section);
5839 const char *name = s->name;
5842 if (config.unique_orphan_sections || unique_section_p (s))
5843 constraint = SPECIAL;
5845 if (!ldemul_place_orphan (s, name, constraint))
5847 lang_output_section_statement_type *os;
5848 os = lang_output_section_statement_lookup (name,
5851 lang_add_section (&os->children, s, os);
5860 lang_set_flags (lang_memory_region_type *ptr, const char *flags, int invert)
5862 flagword *ptr_flags;
5864 ptr_flags = invert ? &ptr->not_flags : &ptr->flags;
5870 *ptr_flags |= SEC_ALLOC;
5874 *ptr_flags |= SEC_READONLY;
5878 *ptr_flags |= SEC_DATA;
5882 *ptr_flags |= SEC_CODE;
5887 *ptr_flags |= SEC_LOAD;
5891 einfo (_("%P%F: invalid syntax in flags\n"));
5898 /* Call a function on each input file. This function will be called
5899 on an archive, but not on the elements. */
5902 lang_for_each_input_file (void (*func) (lang_input_statement_type *))
5904 lang_input_statement_type *f;
5906 for (f = (lang_input_statement_type *) input_file_chain.head;
5908 f = (lang_input_statement_type *) f->next_real_file)
5912 /* Call a function on each file. The function will be called on all
5913 the elements of an archive which are included in the link, but will
5914 not be called on the archive file itself. */
5917 lang_for_each_file (void (*func) (lang_input_statement_type *))
5919 LANG_FOR_EACH_INPUT_STATEMENT (f)
5926 ldlang_add_file (lang_input_statement_type *entry)
5928 lang_statement_append (&file_chain,
5929 (lang_statement_union_type *) entry,
5932 /* The BFD linker needs to have a list of all input BFDs involved in
5934 ASSERT (entry->the_bfd->link_next == NULL);
5935 ASSERT (entry->the_bfd != link_info.output_bfd);
5937 *link_info.input_bfds_tail = entry->the_bfd;
5938 link_info.input_bfds_tail = &entry->the_bfd->link_next;
5939 entry->the_bfd->usrdata = entry;
5940 bfd_set_gp_size (entry->the_bfd, g_switch_value);
5942 /* Look through the sections and check for any which should not be
5943 included in the link. We need to do this now, so that we can
5944 notice when the backend linker tries to report multiple
5945 definition errors for symbols which are in sections we aren't
5946 going to link. FIXME: It might be better to entirely ignore
5947 symbols which are defined in sections which are going to be
5948 discarded. This would require modifying the backend linker for
5949 each backend which might set the SEC_LINK_ONCE flag. If we do
5950 this, we should probably handle SEC_EXCLUDE in the same way. */
5952 bfd_map_over_sections (entry->the_bfd, section_already_linked, entry);
5956 lang_add_output (const char *name, int from_script)
5958 /* Make -o on command line override OUTPUT in script. */
5959 if (!had_output_filename || !from_script)
5961 output_filename = name;
5962 had_output_filename = TRUE;
5966 static lang_output_section_statement_type *current_section;
5977 for (l = 0; l < 32; l++)
5979 if (i >= (unsigned int) x)
5987 lang_output_section_statement_type *
5988 lang_enter_output_section_statement (const char *output_section_statement_name,
5989 etree_type *address_exp,
5990 enum section_type sectype,
5992 etree_type *subalign,
5996 lang_output_section_statement_type *os;
5998 os = lang_output_section_statement_lookup (output_section_statement_name,
6000 current_section = os;
6002 if (os->addr_tree == NULL)
6004 os->addr_tree = address_exp;
6006 os->sectype = sectype;
6007 if (sectype != noload_section)
6008 os->flags = SEC_NO_FLAGS;
6010 os->flags = SEC_NEVER_LOAD;
6011 os->block_value = 1;
6013 /* Make next things chain into subchain of this. */
6014 push_stat_ptr (&os->children);
6016 os->subsection_alignment =
6017 topower (exp_get_value_int (subalign, -1, "subsection alignment"));
6018 os->section_alignment =
6019 topower (exp_get_value_int (align, -1, "section alignment"));
6021 os->load_base = ebase;
6028 lang_output_statement_type *new_stmt;
6030 new_stmt = new_stat (lang_output_statement, stat_ptr);
6031 new_stmt->name = output_filename;
6035 /* Reset the current counters in the regions. */
6038 lang_reset_memory_regions (void)
6040 lang_memory_region_type *p = lang_memory_region_list;
6042 lang_output_section_statement_type *os;
6044 for (p = lang_memory_region_list; p != NULL; p = p->next)
6046 p->current = p->origin;
6050 for (os = &lang_output_section_statement.head->output_section_statement;
6054 os->processed_vma = FALSE;
6055 os->processed_lma = FALSE;
6058 for (o = link_info.output_bfd->sections; o != NULL; o = o->next)
6060 /* Save the last size for possible use by bfd_relax_section. */
6061 o->rawsize = o->size;
6066 /* Worker for lang_gc_sections_1. */
6069 gc_section_callback (lang_wild_statement_type *ptr,
6070 struct wildcard_list *sec ATTRIBUTE_UNUSED,
6072 lang_input_statement_type *file ATTRIBUTE_UNUSED,
6073 void *data ATTRIBUTE_UNUSED)
6075 /* If the wild pattern was marked KEEP, the member sections
6076 should be as well. */
6077 if (ptr->keep_sections)
6078 section->flags |= SEC_KEEP;
6081 /* Iterate over sections marking them against GC. */
6084 lang_gc_sections_1 (lang_statement_union_type *s)
6086 for (; s != NULL; s = s->header.next)
6088 switch (s->header.type)
6090 case lang_wild_statement_enum:
6091 walk_wild (&s->wild_statement, gc_section_callback, NULL);
6093 case lang_constructors_statement_enum:
6094 lang_gc_sections_1 (constructor_list.head);
6096 case lang_output_section_statement_enum:
6097 lang_gc_sections_1 (s->output_section_statement.children.head);
6099 case lang_group_statement_enum:
6100 lang_gc_sections_1 (s->group_statement.children.head);
6109 lang_gc_sections (void)
6111 /* Keep all sections so marked in the link script. */
6113 lang_gc_sections_1 (statement_list.head);
6115 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
6116 the special case of debug info. (See bfd/stabs.c)
6117 Twiddle the flag here, to simplify later linker code. */
6118 if (link_info.relocatable)
6120 LANG_FOR_EACH_INPUT_STATEMENT (f)
6123 for (sec = f->the_bfd->sections; sec != NULL; sec = sec->next)
6124 if ((sec->flags & SEC_DEBUGGING) == 0)
6125 sec->flags &= ~SEC_EXCLUDE;
6129 if (link_info.gc_sections)
6130 bfd_gc_sections (link_info.output_bfd, &link_info);
6133 /* Worker for lang_find_relro_sections_1. */
6136 find_relro_section_callback (lang_wild_statement_type *ptr ATTRIBUTE_UNUSED,
6137 struct wildcard_list *sec ATTRIBUTE_UNUSED,
6139 lang_input_statement_type *file ATTRIBUTE_UNUSED,
6142 /* Discarded, excluded and ignored sections effectively have zero
6144 if (section->output_section != NULL
6145 && section->output_section->owner == link_info.output_bfd
6146 && (section->output_section->flags & SEC_EXCLUDE) == 0
6147 && !IGNORE_SECTION (section)
6148 && section->size != 0)
6150 bfd_boolean *has_relro_section = (bfd_boolean *) data;
6151 *has_relro_section = TRUE;
6155 /* Iterate over sections for relro sections. */
6158 lang_find_relro_sections_1 (lang_statement_union_type *s,
6159 bfd_boolean *has_relro_section)
6161 if (*has_relro_section)
6164 for (; s != NULL; s = s->header.next)
6166 if (s == expld.dataseg.relro_end_stat)
6169 switch (s->header.type)
6171 case lang_wild_statement_enum:
6172 walk_wild (&s->wild_statement,
6173 find_relro_section_callback,
6176 case lang_constructors_statement_enum:
6177 lang_find_relro_sections_1 (constructor_list.head,
6180 case lang_output_section_statement_enum:
6181 lang_find_relro_sections_1 (s->output_section_statement.children.head,
6184 case lang_group_statement_enum:
6185 lang_find_relro_sections_1 (s->group_statement.children.head,
6195 lang_find_relro_sections (void)
6197 bfd_boolean has_relro_section = FALSE;
6199 /* Check all sections in the link script. */
6201 lang_find_relro_sections_1 (expld.dataseg.relro_start_stat,
6202 &has_relro_section);
6204 if (!has_relro_section)
6205 link_info.relro = FALSE;
6208 /* Relax all sections until bfd_relax_section gives up. */
6211 lang_relax_sections (bfd_boolean need_layout)
6213 if (command_line.relax)
6215 /* We may need more than one relaxation pass. */
6216 int i = link_info.relax_pass;
6218 /* The backend can use it to determine the current pass. */
6219 link_info.relax_pass = 0;
6223 /* Keep relaxing until bfd_relax_section gives up. */
6224 bfd_boolean relax_again;
6226 link_info.relax_trip = -1;
6229 link_info.relax_trip++;
6231 /* Note: pe-dll.c does something like this also. If you find
6232 you need to change this code, you probably need to change
6233 pe-dll.c also. DJ */
6235 /* Do all the assignments with our current guesses as to
6237 lang_do_assignments ();
6239 /* We must do this after lang_do_assignments, because it uses
6241 lang_reset_memory_regions ();
6243 /* Perform another relax pass - this time we know where the
6244 globals are, so can make a better guess. */
6245 relax_again = FALSE;
6246 lang_size_sections (&relax_again, FALSE);
6248 while (relax_again);
6250 link_info.relax_pass++;
6257 /* Final extra sizing to report errors. */
6258 lang_do_assignments ();
6259 lang_reset_memory_regions ();
6260 lang_size_sections (NULL, TRUE);
6267 /* Finalize dynamic list. */
6268 if (link_info.dynamic_list)
6269 lang_finalize_version_expr_head (&link_info.dynamic_list->head);
6271 current_target = default_target;
6273 /* Open the output file. */
6274 lang_for_each_statement (ldlang_open_output);
6277 ldemul_create_output_section_statements ();
6279 /* Add to the hash table all undefineds on the command line. */
6280 lang_place_undefineds ();
6282 if (!bfd_section_already_linked_table_init ())
6283 einfo (_("%P%F: Failed to create hash table\n"));
6285 /* Create a bfd for each input file. */
6286 current_target = default_target;
6287 open_input_bfds (statement_list.head, FALSE);
6289 link_info.gc_sym_list = &entry_symbol;
6290 if (entry_symbol.name == NULL)
6291 link_info.gc_sym_list = ldlang_undef_chain_list_head;
6293 ldemul_after_open ();
6295 bfd_section_already_linked_table_free ();
6297 /* Make sure that we're not mixing architectures. We call this
6298 after all the input files have been opened, but before we do any
6299 other processing, so that any operations merge_private_bfd_data
6300 does on the output file will be known during the rest of the
6304 /* Handle .exports instead of a version script if we're told to do so. */
6305 if (command_line.version_exports_section)
6306 lang_do_version_exports_section ();
6308 /* Build all sets based on the information gathered from the input
6310 ldctor_build_sets ();
6312 /* Remove unreferenced sections if asked to. */
6313 lang_gc_sections ();
6315 /* Size up the common data. */
6318 /* Update wild statements. */
6319 update_wild_statements (statement_list.head);
6321 /* Run through the contours of the script and attach input sections
6322 to the correct output sections. */
6323 map_input_to_output_sections (statement_list.head, NULL, NULL);
6325 process_insert_statements ();
6327 /* Find any sections not attached explicitly and handle them. */
6328 lang_place_orphans ();
6330 if (! link_info.relocatable)
6334 /* Merge SEC_MERGE sections. This has to be done after GC of
6335 sections, so that GCed sections are not merged, but before
6336 assigning dynamic symbols, since removing whole input sections
6338 bfd_merge_sections (link_info.output_bfd, &link_info);
6340 /* Look for a text section and set the readonly attribute in it. */
6341 found = bfd_get_section_by_name (link_info.output_bfd, ".text");
6345 if (config.text_read_only)
6346 found->flags |= SEC_READONLY;
6348 found->flags &= ~SEC_READONLY;
6352 /* Do anything special before sizing sections. This is where ELF
6353 and other back-ends size dynamic sections. */
6354 ldemul_before_allocation ();
6356 /* We must record the program headers before we try to fix the
6357 section positions, since they will affect SIZEOF_HEADERS. */
6358 lang_record_phdrs ();
6360 /* Check relro sections. */
6361 if (link_info.relro && ! link_info.relocatable)
6362 lang_find_relro_sections ();
6364 /* Size up the sections. */
6365 lang_size_sections (NULL, !command_line.relax);
6367 /* See if anything special should be done now we know how big
6368 everything is. This is where relaxation is done. */
6369 ldemul_after_allocation ();
6371 /* Fix any .startof. or .sizeof. symbols. */
6372 lang_set_startof ();
6374 /* Do all the assignments, now that we know the final resting places
6375 of all the symbols. */
6377 lang_do_assignments ();
6381 /* Make sure that the section addresses make sense. */
6382 if (command_line.check_section_addresses)
6383 lang_check_section_addresses ();
6388 /* EXPORTED TO YACC */
6391 lang_add_wild (struct wildcard_spec *filespec,
6392 struct wildcard_list *section_list,
6393 bfd_boolean keep_sections)
6395 struct wildcard_list *curr, *next;
6396 lang_wild_statement_type *new_stmt;
6398 /* Reverse the list as the parser puts it back to front. */
6399 for (curr = section_list, section_list = NULL;
6401 section_list = curr, curr = next)
6403 if (curr->spec.name != NULL && strcmp (curr->spec.name, "COMMON") == 0)
6404 placed_commons = TRUE;
6407 curr->next = section_list;
6410 if (filespec != NULL && filespec->name != NULL)
6412 if (strcmp (filespec->name, "*") == 0)
6413 filespec->name = NULL;
6414 else if (! wildcardp (filespec->name))
6415 lang_has_input_file = TRUE;
6418 new_stmt = new_stat (lang_wild_statement, stat_ptr);
6419 new_stmt->filename = NULL;
6420 new_stmt->filenames_sorted = FALSE;
6421 if (filespec != NULL)
6423 new_stmt->filename = filespec->name;
6424 new_stmt->filenames_sorted = filespec->sorted == by_name;
6426 new_stmt->section_list = section_list;
6427 new_stmt->keep_sections = keep_sections;
6428 lang_list_init (&new_stmt->children);
6429 analyze_walk_wild_section_handler (new_stmt);
6433 lang_section_start (const char *name, etree_type *address,
6434 const segment_type *segment)
6436 lang_address_statement_type *ad;
6438 ad = new_stat (lang_address_statement, stat_ptr);
6439 ad->section_name = name;
6440 ad->address = address;
6441 ad->segment = segment;
6444 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
6445 because of a -e argument on the command line, or zero if this is
6446 called by ENTRY in a linker script. Command line arguments take
6450 lang_add_entry (const char *name, bfd_boolean cmdline)
6452 if (entry_symbol.name == NULL
6454 || ! entry_from_cmdline)
6456 entry_symbol.name = name;
6457 entry_from_cmdline = cmdline;
6461 /* Set the default start symbol to NAME. .em files should use this,
6462 not lang_add_entry, to override the use of "start" if neither the
6463 linker script nor the command line specifies an entry point. NAME
6464 must be permanently allocated. */
6466 lang_default_entry (const char *name)
6468 entry_symbol_default = name;
6472 lang_add_target (const char *name)
6474 lang_target_statement_type *new_stmt;
6476 new_stmt = new_stat (lang_target_statement, stat_ptr);
6477 new_stmt->target = name;
6481 lang_add_map (const char *name)
6488 map_option_f = TRUE;
6496 lang_add_fill (fill_type *fill)
6498 lang_fill_statement_type *new_stmt;
6500 new_stmt = new_stat (lang_fill_statement, stat_ptr);
6501 new_stmt->fill = fill;
6505 lang_add_data (int type, union etree_union *exp)
6507 lang_data_statement_type *new_stmt;
6509 new_stmt = new_stat (lang_data_statement, stat_ptr);
6510 new_stmt->exp = exp;
6511 new_stmt->type = type;
6514 /* Create a new reloc statement. RELOC is the BFD relocation type to
6515 generate. HOWTO is the corresponding howto structure (we could
6516 look this up, but the caller has already done so). SECTION is the
6517 section to generate a reloc against, or NAME is the name of the
6518 symbol to generate a reloc against. Exactly one of SECTION and
6519 NAME must be NULL. ADDEND is an expression for the addend. */
6522 lang_add_reloc (bfd_reloc_code_real_type reloc,
6523 reloc_howto_type *howto,
6526 union etree_union *addend)
6528 lang_reloc_statement_type *p = new_stat (lang_reloc_statement, stat_ptr);
6532 p->section = section;
6534 p->addend_exp = addend;
6536 p->addend_value = 0;
6537 p->output_section = NULL;
6538 p->output_offset = 0;
6541 lang_assignment_statement_type *
6542 lang_add_assignment (etree_type *exp)
6544 lang_assignment_statement_type *new_stmt;
6546 new_stmt = new_stat (lang_assignment_statement, stat_ptr);
6547 new_stmt->exp = exp;
6552 lang_add_attribute (enum statement_enum attribute)
6554 new_statement (attribute, sizeof (lang_statement_header_type), stat_ptr);
6558 lang_startup (const char *name)
6560 if (startup_file != NULL)
6562 einfo (_("%P%F: multiple STARTUP files\n"));
6564 first_file->filename = name;
6565 first_file->local_sym_name = name;
6566 first_file->real = TRUE;
6568 startup_file = name;
6572 lang_float (bfd_boolean maybe)
6574 lang_float_flag = maybe;
6578 /* Work out the load- and run-time regions from a script statement, and
6579 store them in *LMA_REGION and *REGION respectively.
6581 MEMSPEC is the name of the run-time region, or the value of
6582 DEFAULT_MEMORY_REGION if the statement didn't specify one.
6583 LMA_MEMSPEC is the name of the load-time region, or null if the
6584 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
6585 had an explicit load address.
6587 It is an error to specify both a load region and a load address. */
6590 lang_get_regions (lang_memory_region_type **region,
6591 lang_memory_region_type **lma_region,
6592 const char *memspec,
6593 const char *lma_memspec,
6594 bfd_boolean have_lma,
6595 bfd_boolean have_vma)
6597 *lma_region = lang_memory_region_lookup (lma_memspec, FALSE);
6599 /* If no runtime region or VMA has been specified, but the load region
6600 has been specified, then use the load region for the runtime region
6602 if (lma_memspec != NULL
6604 && strcmp (memspec, DEFAULT_MEMORY_REGION) == 0)
6605 *region = *lma_region;
6607 *region = lang_memory_region_lookup (memspec, FALSE);
6609 if (have_lma && lma_memspec != 0)
6610 einfo (_("%X%P:%S: section has both a load address and a load region\n"));
6614 lang_leave_output_section_statement (fill_type *fill, const char *memspec,
6615 lang_output_section_phdr_list *phdrs,
6616 const char *lma_memspec)
6618 lang_get_regions (¤t_section->region,
6619 ¤t_section->lma_region,
6620 memspec, lma_memspec,
6621 current_section->load_base != NULL,
6622 current_section->addr_tree != NULL);
6624 /* If this section has no load region or base, but has the same
6625 region as the previous section, then propagate the previous
6626 section's load region. */
6628 if (!current_section->lma_region && !current_section->load_base
6629 && current_section->region == current_section->prev->region)
6630 current_section->lma_region = current_section->prev->lma_region;
6632 current_section->fill = fill;
6633 current_section->phdrs = phdrs;
6637 /* Create an absolute symbol with the given name with the value of the
6638 address of first byte of the section named.
6640 If the symbol already exists, then do nothing. */
6643 lang_abs_symbol_at_beginning_of (const char *secname, const char *name)
6645 struct bfd_link_hash_entry *h;
6647 h = bfd_link_hash_lookup (link_info.hash, name, TRUE, TRUE, TRUE);
6649 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
6651 if (h->type == bfd_link_hash_new
6652 || h->type == bfd_link_hash_undefined)
6656 h->type = bfd_link_hash_defined;
6658 sec = bfd_get_section_by_name (link_info.output_bfd, secname);
6662 h->u.def.value = bfd_get_section_vma (link_info.output_bfd, sec);
6664 h->u.def.section = bfd_abs_section_ptr;
6668 /* Create an absolute symbol with the given name with the value of the
6669 address of the first byte after the end of the section named.
6671 If the symbol already exists, then do nothing. */
6674 lang_abs_symbol_at_end_of (const char *secname, const char *name)
6676 struct bfd_link_hash_entry *h;
6678 h = bfd_link_hash_lookup (link_info.hash, name, TRUE, TRUE, TRUE);
6680 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
6682 if (h->type == bfd_link_hash_new
6683 || h->type == bfd_link_hash_undefined)
6687 h->type = bfd_link_hash_defined;
6689 sec = bfd_get_section_by_name (link_info.output_bfd, secname);
6693 h->u.def.value = (bfd_get_section_vma (link_info.output_bfd, sec)
6694 + TO_ADDR (sec->size));
6696 h->u.def.section = bfd_abs_section_ptr;
6701 lang_statement_append (lang_statement_list_type *list,
6702 lang_statement_union_type *element,
6703 lang_statement_union_type **field)
6705 *(list->tail) = element;
6709 /* Set the output format type. -oformat overrides scripts. */
6712 lang_add_output_format (const char *format,
6717 if (output_target == NULL || !from_script)
6719 if (command_line.endian == ENDIAN_BIG
6722 else if (command_line.endian == ENDIAN_LITTLE
6726 output_target = format;
6731 lang_add_insert (const char *where, int is_before)
6733 lang_insert_statement_type *new_stmt;
6735 new_stmt = new_stat (lang_insert_statement, stat_ptr);
6736 new_stmt->where = where;
6737 new_stmt->is_before = is_before;
6738 saved_script_handle = previous_script_handle;
6741 /* Enter a group. This creates a new lang_group_statement, and sets
6742 stat_ptr to build new statements within the group. */
6745 lang_enter_group (void)
6747 lang_group_statement_type *g;
6749 g = new_stat (lang_group_statement, stat_ptr);
6750 lang_list_init (&g->children);
6751 push_stat_ptr (&g->children);
6754 /* Leave a group. This just resets stat_ptr to start writing to the
6755 regular list of statements again. Note that this will not work if
6756 groups can occur inside anything else which can adjust stat_ptr,
6757 but currently they can't. */
6760 lang_leave_group (void)
6765 /* Add a new program header. This is called for each entry in a PHDRS
6766 command in a linker script. */
6769 lang_new_phdr (const char *name,
6771 bfd_boolean filehdr,
6776 struct lang_phdr *n, **pp;
6779 n = (struct lang_phdr *) stat_alloc (sizeof (struct lang_phdr));
6782 n->type = exp_get_value_int (type, 0, "program header type");
6783 n->filehdr = filehdr;
6788 hdrs = n->type == 1 && (phdrs || filehdr);
6790 for (pp = &lang_phdr_list; *pp != NULL; pp = &(*pp)->next)
6793 && !((*pp)->filehdr || (*pp)->phdrs))
6795 einfo (_("%X%P:%S: PHDRS and FILEHDR are not supported when prior PT_LOAD headers lack them\n"));
6802 /* Record the program header information in the output BFD. FIXME: We
6803 should not be calling an ELF specific function here. */
6806 lang_record_phdrs (void)
6810 lang_output_section_phdr_list *last;
6811 struct lang_phdr *l;
6812 lang_output_section_statement_type *os;
6815 secs = (asection **) xmalloc (alc * sizeof (asection *));
6818 for (l = lang_phdr_list; l != NULL; l = l->next)
6825 for (os = &lang_output_section_statement.head->output_section_statement;
6829 lang_output_section_phdr_list *pl;
6831 if (os->constraint < 0)
6839 if (os->sectype == noload_section
6840 || os->bfd_section == NULL
6841 || (os->bfd_section->flags & SEC_ALLOC) == 0)
6844 /* Don't add orphans to PT_INTERP header. */
6850 lang_output_section_statement_type * tmp_os;
6852 /* If we have not run across a section with a program
6853 header assigned to it yet, then scan forwards to find
6854 one. This prevents inconsistencies in the linker's
6855 behaviour when a script has specified just a single
6856 header and there are sections in that script which are
6857 not assigned to it, and which occur before the first
6858 use of that header. See here for more details:
6859 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
6860 for (tmp_os = os; tmp_os; tmp_os = tmp_os->next)
6863 last = tmp_os->phdrs;
6867 einfo (_("%F%P: no sections assigned to phdrs\n"));
6872 if (os->bfd_section == NULL)
6875 for (; pl != NULL; pl = pl->next)
6877 if (strcmp (pl->name, l->name) == 0)
6882 secs = (asection **) xrealloc (secs,
6883 alc * sizeof (asection *));
6885 secs[c] = os->bfd_section;
6892 if (l->flags == NULL)
6895 flags = exp_get_vma (l->flags, 0, "phdr flags");
6900 at = exp_get_vma (l->at, 0, "phdr load address");
6902 if (! bfd_record_phdr (link_info.output_bfd, l->type,
6903 l->flags != NULL, flags, l->at != NULL,
6904 at, l->filehdr, l->phdrs, c, secs))
6905 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
6910 /* Make sure all the phdr assignments succeeded. */
6911 for (os = &lang_output_section_statement.head->output_section_statement;
6915 lang_output_section_phdr_list *pl;
6917 if (os->constraint < 0
6918 || os->bfd_section == NULL)
6921 for (pl = os->phdrs;
6924 if (! pl->used && strcmp (pl->name, "NONE") != 0)
6925 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
6926 os->name, pl->name);
6930 /* Record a list of sections which may not be cross referenced. */
6933 lang_add_nocrossref (lang_nocrossref_type *l)
6935 struct lang_nocrossrefs *n;
6937 n = (struct lang_nocrossrefs *) xmalloc (sizeof *n);
6938 n->next = nocrossref_list;
6940 nocrossref_list = n;
6942 /* Set notice_all so that we get informed about all symbols. */
6943 link_info.notice_all = TRUE;
6946 /* Overlay handling. We handle overlays with some static variables. */
6948 /* The overlay virtual address. */
6949 static etree_type *overlay_vma;
6950 /* And subsection alignment. */
6951 static etree_type *overlay_subalign;
6953 /* An expression for the maximum section size seen so far. */
6954 static etree_type *overlay_max;
6956 /* A list of all the sections in this overlay. */
6958 struct overlay_list {
6959 struct overlay_list *next;
6960 lang_output_section_statement_type *os;
6963 static struct overlay_list *overlay_list;
6965 /* Start handling an overlay. */
6968 lang_enter_overlay (etree_type *vma_expr, etree_type *subalign)
6970 /* The grammar should prevent nested overlays from occurring. */
6971 ASSERT (overlay_vma == NULL
6972 && overlay_subalign == NULL
6973 && overlay_max == NULL);
6975 overlay_vma = vma_expr;
6976 overlay_subalign = subalign;
6979 /* Start a section in an overlay. We handle this by calling
6980 lang_enter_output_section_statement with the correct VMA.
6981 lang_leave_overlay sets up the LMA and memory regions. */
6984 lang_enter_overlay_section (const char *name)
6986 struct overlay_list *n;
6989 lang_enter_output_section_statement (name, overlay_vma, overlay_section,
6990 0, overlay_subalign, 0, 0);
6992 /* If this is the first section, then base the VMA of future
6993 sections on this one. This will work correctly even if `.' is
6994 used in the addresses. */
6995 if (overlay_list == NULL)
6996 overlay_vma = exp_nameop (ADDR, name);
6998 /* Remember the section. */
6999 n = (struct overlay_list *) xmalloc (sizeof *n);
7000 n->os = current_section;
7001 n->next = overlay_list;
7004 size = exp_nameop (SIZEOF, name);
7006 /* Arrange to work out the maximum section end address. */
7007 if (overlay_max == NULL)
7010 overlay_max = exp_binop (MAX_K, overlay_max, size);
7013 /* Finish a section in an overlay. There isn't any special to do
7017 lang_leave_overlay_section (fill_type *fill,
7018 lang_output_section_phdr_list *phdrs)
7025 name = current_section->name;
7027 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
7028 region and that no load-time region has been specified. It doesn't
7029 really matter what we say here, since lang_leave_overlay will
7031 lang_leave_output_section_statement (fill, DEFAULT_MEMORY_REGION, phdrs, 0);
7033 /* Define the magic symbols. */
7035 clean = (char *) xmalloc (strlen (name) + 1);
7037 for (s1 = name; *s1 != '\0'; s1++)
7038 if (ISALNUM (*s1) || *s1 == '_')
7042 buf = (char *) xmalloc (strlen (clean) + sizeof "__load_start_");
7043 sprintf (buf, "__load_start_%s", clean);
7044 lang_add_assignment (exp_provide (buf,
7045 exp_nameop (LOADADDR, name),
7048 buf = (char *) xmalloc (strlen (clean) + sizeof "__load_stop_");
7049 sprintf (buf, "__load_stop_%s", clean);
7050 lang_add_assignment (exp_provide (buf,
7052 exp_nameop (LOADADDR, name),
7053 exp_nameop (SIZEOF, name)),
7059 /* Finish an overlay. If there are any overlay wide settings, this
7060 looks through all the sections in the overlay and sets them. */
7063 lang_leave_overlay (etree_type *lma_expr,
7066 const char *memspec,
7067 lang_output_section_phdr_list *phdrs,
7068 const char *lma_memspec)
7070 lang_memory_region_type *region;
7071 lang_memory_region_type *lma_region;
7072 struct overlay_list *l;
7073 lang_nocrossref_type *nocrossref;
7075 lang_get_regions (®ion, &lma_region,
7076 memspec, lma_memspec,
7077 lma_expr != NULL, FALSE);
7081 /* After setting the size of the last section, set '.' to end of the
7083 if (overlay_list != NULL)
7084 overlay_list->os->update_dot_tree
7085 = exp_assop ('=', ".", exp_binop ('+', overlay_vma, overlay_max));
7090 struct overlay_list *next;
7092 if (fill != NULL && l->os->fill == NULL)
7095 l->os->region = region;
7096 l->os->lma_region = lma_region;
7098 /* The first section has the load address specified in the
7099 OVERLAY statement. The rest are worked out from that.
7100 The base address is not needed (and should be null) if
7101 an LMA region was specified. */
7104 l->os->load_base = lma_expr;
7105 l->os->sectype = normal_section;
7107 if (phdrs != NULL && l->os->phdrs == NULL)
7108 l->os->phdrs = phdrs;
7112 lang_nocrossref_type *nc;
7114 nc = (lang_nocrossref_type *) xmalloc (sizeof *nc);
7115 nc->name = l->os->name;
7116 nc->next = nocrossref;
7125 if (nocrossref != NULL)
7126 lang_add_nocrossref (nocrossref);
7129 overlay_list = NULL;
7133 /* Version handling. This is only useful for ELF. */
7135 /* This global variable holds the version tree that we build. */
7137 struct bfd_elf_version_tree *lang_elf_version_info;
7139 /* If PREV is NULL, return first version pattern matching particular symbol.
7140 If PREV is non-NULL, return first version pattern matching particular
7141 symbol after PREV (previously returned by lang_vers_match). */
7143 static struct bfd_elf_version_expr *
7144 lang_vers_match (struct bfd_elf_version_expr_head *head,
7145 struct bfd_elf_version_expr *prev,
7148 const char *cxx_sym = sym;
7149 const char *java_sym = sym;
7150 struct bfd_elf_version_expr *expr = NULL;
7152 if (head->mask & BFD_ELF_VERSION_CXX_TYPE)
7154 cxx_sym = cplus_demangle (sym, DMGL_PARAMS | DMGL_ANSI);
7158 if (head->mask & BFD_ELF_VERSION_JAVA_TYPE)
7160 java_sym = cplus_demangle (sym, DMGL_JAVA);
7165 if (head->htab && (prev == NULL || prev->literal))
7167 struct bfd_elf_version_expr e;
7169 switch (prev ? prev->mask : 0)
7172 if (head->mask & BFD_ELF_VERSION_C_TYPE)
7175 expr = (struct bfd_elf_version_expr *)
7176 htab_find ((htab_t) head->htab, &e);
7177 while (expr && strcmp (expr->pattern, sym) == 0)
7178 if (expr->mask == BFD_ELF_VERSION_C_TYPE)
7184 case BFD_ELF_VERSION_C_TYPE:
7185 if (head->mask & BFD_ELF_VERSION_CXX_TYPE)
7187 e.pattern = cxx_sym;
7188 expr = (struct bfd_elf_version_expr *)
7189 htab_find ((htab_t) head->htab, &e);
7190 while (expr && strcmp (expr->pattern, cxx_sym) == 0)
7191 if (expr->mask == BFD_ELF_VERSION_CXX_TYPE)
7197 case BFD_ELF_VERSION_CXX_TYPE:
7198 if (head->mask & BFD_ELF_VERSION_JAVA_TYPE)
7200 e.pattern = java_sym;
7201 expr = (struct bfd_elf_version_expr *)
7202 htab_find ((htab_t) head->htab, &e);
7203 while (expr && strcmp (expr->pattern, java_sym) == 0)
7204 if (expr->mask == BFD_ELF_VERSION_JAVA_TYPE)
7215 /* Finally, try the wildcards. */
7216 if (prev == NULL || prev->literal)
7217 expr = head->remaining;
7220 for (; expr; expr = expr->next)
7227 if (expr->pattern[0] == '*' && expr->pattern[1] == '\0')
7230 if (expr->mask == BFD_ELF_VERSION_JAVA_TYPE)
7232 else if (expr->mask == BFD_ELF_VERSION_CXX_TYPE)
7236 if (fnmatch (expr->pattern, s, 0) == 0)
7242 free ((char *) cxx_sym);
7243 if (java_sym != sym)
7244 free ((char *) java_sym);
7248 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
7249 return a pointer to the symbol name with any backslash quotes removed. */
7252 realsymbol (const char *pattern)
7255 bfd_boolean changed = FALSE, backslash = FALSE;
7256 char *s, *symbol = (char *) xmalloc (strlen (pattern) + 1);
7258 for (p = pattern, s = symbol; *p != '\0'; ++p)
7260 /* It is a glob pattern only if there is no preceding
7264 /* Remove the preceding backslash. */
7271 if (*p == '?' || *p == '*' || *p == '[')
7278 backslash = *p == '\\';
7294 /* This is called for each variable name or match expression. NEW_NAME is
7295 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
7296 pattern to be matched against symbol names. */
7298 struct bfd_elf_version_expr *
7299 lang_new_vers_pattern (struct bfd_elf_version_expr *orig,
7300 const char *new_name,
7302 bfd_boolean literal_p)
7304 struct bfd_elf_version_expr *ret;
7306 ret = (struct bfd_elf_version_expr *) xmalloc (sizeof *ret);
7310 ret->literal = TRUE;
7311 ret->pattern = literal_p ? new_name : realsymbol (new_name);
7312 if (ret->pattern == NULL)
7314 ret->pattern = new_name;
7315 ret->literal = FALSE;
7318 if (lang == NULL || strcasecmp (lang, "C") == 0)
7319 ret->mask = BFD_ELF_VERSION_C_TYPE;
7320 else if (strcasecmp (lang, "C++") == 0)
7321 ret->mask = BFD_ELF_VERSION_CXX_TYPE;
7322 else if (strcasecmp (lang, "Java") == 0)
7323 ret->mask = BFD_ELF_VERSION_JAVA_TYPE;
7326 einfo (_("%X%P: unknown language `%s' in version information\n"),
7328 ret->mask = BFD_ELF_VERSION_C_TYPE;
7331 return ldemul_new_vers_pattern (ret);
7334 /* This is called for each set of variable names and match
7337 struct bfd_elf_version_tree *
7338 lang_new_vers_node (struct bfd_elf_version_expr *globals,
7339 struct bfd_elf_version_expr *locals)
7341 struct bfd_elf_version_tree *ret;
7343 ret = (struct bfd_elf_version_tree *) xcalloc (1, sizeof *ret);
7344 ret->globals.list = globals;
7345 ret->locals.list = locals;
7346 ret->match = lang_vers_match;
7347 ret->name_indx = (unsigned int) -1;
7351 /* This static variable keeps track of version indices. */
7353 static int version_index;
7356 version_expr_head_hash (const void *p)
7358 const struct bfd_elf_version_expr *e =
7359 (const struct bfd_elf_version_expr *) p;
7361 return htab_hash_string (e->pattern);
7365 version_expr_head_eq (const void *p1, const void *p2)
7367 const struct bfd_elf_version_expr *e1 =
7368 (const struct bfd_elf_version_expr *) p1;
7369 const struct bfd_elf_version_expr *e2 =
7370 (const struct bfd_elf_version_expr *) p2;
7372 return strcmp (e1->pattern, e2->pattern) == 0;
7376 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head *head)
7379 struct bfd_elf_version_expr *e, *next;
7380 struct bfd_elf_version_expr **list_loc, **remaining_loc;
7382 for (e = head->list; e; e = e->next)
7386 head->mask |= e->mask;
7391 head->htab = htab_create (count * 2, version_expr_head_hash,
7392 version_expr_head_eq, NULL);
7393 list_loc = &head->list;
7394 remaining_loc = &head->remaining;
7395 for (e = head->list; e; e = next)
7401 remaining_loc = &e->next;
7405 void **loc = htab_find_slot ((htab_t) head->htab, e, INSERT);
7409 struct bfd_elf_version_expr *e1, *last;
7411 e1 = (struct bfd_elf_version_expr *) *loc;
7415 if (e1->mask == e->mask)
7423 while (e1 && strcmp (e1->pattern, e->pattern) == 0);
7427 /* This is a duplicate. */
7428 /* FIXME: Memory leak. Sometimes pattern is not
7429 xmalloced alone, but in larger chunk of memory. */
7430 /* free (e->pattern); */
7435 e->next = last->next;
7443 list_loc = &e->next;
7447 *remaining_loc = NULL;
7448 *list_loc = head->remaining;
7451 head->remaining = head->list;
7454 /* This is called when we know the name and dependencies of the
7458 lang_register_vers_node (const char *name,
7459 struct bfd_elf_version_tree *version,
7460 struct bfd_elf_version_deps *deps)
7462 struct bfd_elf_version_tree *t, **pp;
7463 struct bfd_elf_version_expr *e1;
7468 if ((name[0] == '\0' && lang_elf_version_info != NULL)
7469 || (lang_elf_version_info && lang_elf_version_info->name[0] == '\0'))
7471 einfo (_("%X%P: anonymous version tag cannot be combined"
7472 " with other version tags\n"));
7477 /* Make sure this node has a unique name. */
7478 for (t = lang_elf_version_info; t != NULL; t = t->next)
7479 if (strcmp (t->name, name) == 0)
7480 einfo (_("%X%P: duplicate version tag `%s'\n"), name);
7482 lang_finalize_version_expr_head (&version->globals);
7483 lang_finalize_version_expr_head (&version->locals);
7485 /* Check the global and local match names, and make sure there
7486 aren't any duplicates. */
7488 for (e1 = version->globals.list; e1 != NULL; e1 = e1->next)
7490 for (t = lang_elf_version_info; t != NULL; t = t->next)
7492 struct bfd_elf_version_expr *e2;
7494 if (t->locals.htab && e1->literal)
7496 e2 = (struct bfd_elf_version_expr *)
7497 htab_find ((htab_t) t->locals.htab, e1);
7498 while (e2 && strcmp (e1->pattern, e2->pattern) == 0)
7500 if (e1->mask == e2->mask)
7501 einfo (_("%X%P: duplicate expression `%s'"
7502 " in version information\n"), e1->pattern);
7506 else if (!e1->literal)
7507 for (e2 = t->locals.remaining; e2 != NULL; e2 = e2->next)
7508 if (strcmp (e1->pattern, e2->pattern) == 0
7509 && e1->mask == e2->mask)
7510 einfo (_("%X%P: duplicate expression `%s'"
7511 " in version information\n"), e1->pattern);
7515 for (e1 = version->locals.list; e1 != NULL; e1 = e1->next)
7517 for (t = lang_elf_version_info; t != NULL; t = t->next)
7519 struct bfd_elf_version_expr *e2;
7521 if (t->globals.htab && e1->literal)
7523 e2 = (struct bfd_elf_version_expr *)
7524 htab_find ((htab_t) t->globals.htab, e1);
7525 while (e2 && strcmp (e1->pattern, e2->pattern) == 0)
7527 if (e1->mask == e2->mask)
7528 einfo (_("%X%P: duplicate expression `%s'"
7529 " in version information\n"),
7534 else if (!e1->literal)
7535 for (e2 = t->globals.remaining; e2 != NULL; e2 = e2->next)
7536 if (strcmp (e1->pattern, e2->pattern) == 0
7537 && e1->mask == e2->mask)
7538 einfo (_("%X%P: duplicate expression `%s'"
7539 " in version information\n"), e1->pattern);
7543 version->deps = deps;
7544 version->name = name;
7545 if (name[0] != '\0')
7548 version->vernum = version_index;
7551 version->vernum = 0;
7553 for (pp = &lang_elf_version_info; *pp != NULL; pp = &(*pp)->next)
7558 /* This is called when we see a version dependency. */
7560 struct bfd_elf_version_deps *
7561 lang_add_vers_depend (struct bfd_elf_version_deps *list, const char *name)
7563 struct bfd_elf_version_deps *ret;
7564 struct bfd_elf_version_tree *t;
7566 ret = (struct bfd_elf_version_deps *) xmalloc (sizeof *ret);
7569 for (t = lang_elf_version_info; t != NULL; t = t->next)
7571 if (strcmp (t->name, name) == 0)
7573 ret->version_needed = t;
7578 einfo (_("%X%P: unable to find version dependency `%s'\n"), name);
7584 lang_do_version_exports_section (void)
7586 struct bfd_elf_version_expr *greg = NULL, *lreg;
7588 LANG_FOR_EACH_INPUT_STATEMENT (is)
7590 asection *sec = bfd_get_section_by_name (is->the_bfd, ".exports");
7598 contents = (char *) xmalloc (len);
7599 if (!bfd_get_section_contents (is->the_bfd, sec, contents, 0, len))
7600 einfo (_("%X%P: unable to read .exports section contents\n"), sec);
7603 while (p < contents + len)
7605 greg = lang_new_vers_pattern (greg, p, NULL, FALSE);
7606 p = strchr (p, '\0') + 1;
7609 /* Do not free the contents, as we used them creating the regex. */
7611 /* Do not include this section in the link. */
7612 sec->flags |= SEC_EXCLUDE | SEC_KEEP;
7615 lreg = lang_new_vers_pattern (NULL, "*", NULL, FALSE);
7616 lang_register_vers_node (command_line.version_exports_section,
7617 lang_new_vers_node (greg, lreg), NULL);
7621 lang_add_unique (const char *name)
7623 struct unique_sections *ent;
7625 for (ent = unique_section_list; ent; ent = ent->next)
7626 if (strcmp (ent->name, name) == 0)
7629 ent = (struct unique_sections *) xmalloc (sizeof *ent);
7630 ent->name = xstrdup (name);
7631 ent->next = unique_section_list;
7632 unique_section_list = ent;
7635 /* Append the list of dynamic symbols to the existing one. */
7638 lang_append_dynamic_list (struct bfd_elf_version_expr *dynamic)
7640 if (link_info.dynamic_list)
7642 struct bfd_elf_version_expr *tail;
7643 for (tail = dynamic; tail->next != NULL; tail = tail->next)
7645 tail->next = link_info.dynamic_list->head.list;
7646 link_info.dynamic_list->head.list = dynamic;
7650 struct bfd_elf_dynamic_list *d;
7652 d = (struct bfd_elf_dynamic_list *) xcalloc (1, sizeof *d);
7653 d->head.list = dynamic;
7654 d->match = lang_vers_match;
7655 link_info.dynamic_list = d;
7659 /* Append the list of C++ typeinfo dynamic symbols to the existing
7663 lang_append_dynamic_list_cpp_typeinfo (void)
7665 const char * symbols [] =
7667 "typeinfo name for*",
7670 struct bfd_elf_version_expr *dynamic = NULL;
7673 for (i = 0; i < ARRAY_SIZE (symbols); i++)
7674 dynamic = lang_new_vers_pattern (dynamic, symbols [i], "C++",
7677 lang_append_dynamic_list (dynamic);
7680 /* Append the list of C++ operator new and delete dynamic symbols to the
7684 lang_append_dynamic_list_cpp_new (void)
7686 const char * symbols [] =
7691 struct bfd_elf_version_expr *dynamic = NULL;
7694 for (i = 0; i < ARRAY_SIZE (symbols); i++)
7695 dynamic = lang_new_vers_pattern (dynamic, symbols [i], "C++",
7698 lang_append_dynamic_list (dynamic);