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_DT_NEEDED_for_dynamic = add_DT_NEEDED_for_dynamic;
1060 p->add_DT_NEEDED_for_regular = add_DT_NEEDED_for_regular;
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_add_DT_NEEDED_for_regular;
2596 bfd_boolean save_add_DT_NEEDED_for_dynamic;
2597 bfd_boolean save_whole_archive;
2599 err = bfd_get_error ();
2601 /* See if the emulation has some special knowledge. */
2602 if (ldemul_unrecognized_file (entry))
2605 if (err == bfd_error_file_ambiguously_recognized)
2609 einfo (_("%B: file not recognized: %E\n"), entry->the_bfd);
2610 einfo (_("%B: matching formats:"), entry->the_bfd);
2611 for (p = matching; *p != NULL; p++)
2615 else if (err != bfd_error_file_not_recognized
2617 einfo (_("%F%B: file not recognized: %E\n"), entry->the_bfd);
2619 bfd_close (entry->the_bfd);
2620 entry->the_bfd = NULL;
2622 /* Try to interpret the file as a linker script. */
2623 ldfile_open_command_file (entry->filename);
2625 push_stat_ptr (place);
2626 save_ldlang_sysrooted_script = ldlang_sysrooted_script;
2627 ldlang_sysrooted_script = entry->sysrooted;
2628 save_add_DT_NEEDED_for_regular = add_DT_NEEDED_for_regular;
2629 add_DT_NEEDED_for_regular = entry->add_DT_NEEDED_for_regular;
2630 save_add_DT_NEEDED_for_dynamic = add_DT_NEEDED_for_dynamic;
2631 add_DT_NEEDED_for_dynamic = entry->add_DT_NEEDED_for_dynamic;
2632 save_whole_archive = whole_archive;
2633 whole_archive = entry->whole_archive;
2635 ldfile_assumed_script = TRUE;
2636 parser_input = input_script;
2637 /* We want to use the same -Bdynamic/-Bstatic as the one for
2639 config.dynamic_link = entry->dynamic;
2641 ldfile_assumed_script = FALSE;
2643 ldlang_sysrooted_script = save_ldlang_sysrooted_script;
2644 add_DT_NEEDED_for_regular = save_add_DT_NEEDED_for_regular;
2645 add_DT_NEEDED_for_dynamic = save_add_DT_NEEDED_for_dynamic;
2646 whole_archive = save_whole_archive;
2652 if (ldemul_recognized_file (entry))
2655 /* We don't call ldlang_add_file for an archive. Instead, the
2656 add_symbols entry point will call ldlang_add_file, via the
2657 add_archive_element callback, for each element of the archive
2659 switch (bfd_get_format (entry->the_bfd))
2665 ldlang_add_file (entry);
2666 if (trace_files || trace_file_tries)
2667 info_msg ("%I\n", entry);
2671 check_excluded_libs (entry->the_bfd);
2673 if (entry->whole_archive)
2676 bfd_boolean loaded = TRUE;
2680 member = bfd_openr_next_archived_file (entry->the_bfd, member);
2685 if (! bfd_check_format (member, bfd_object))
2687 einfo (_("%F%B: member %B in archive is not an object\n"),
2688 entry->the_bfd, member);
2692 if (! ((*link_info.callbacks->add_archive_element)
2693 (&link_info, member, "--whole-archive")))
2696 if (! bfd_link_add_symbols (member, &link_info))
2698 einfo (_("%F%B: could not read symbols: %E\n"), member);
2703 entry->loaded = loaded;
2709 if (bfd_link_add_symbols (entry->the_bfd, &link_info))
2710 entry->loaded = TRUE;
2712 einfo (_("%F%B: could not read symbols: %E\n"), entry->the_bfd);
2714 return entry->loaded;
2717 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2718 may be NULL, indicating that it is a wildcard. Separate
2719 lang_input_section statements are created for each part of the
2720 expansion; they are added after the wild statement S. OUTPUT is
2721 the output section. */
2724 wild (lang_wild_statement_type *s,
2725 const char *target ATTRIBUTE_UNUSED,
2726 lang_output_section_statement_type *output)
2728 struct wildcard_list *sec;
2730 if (s->handler_data[0]
2731 && s->handler_data[0]->spec.sorted == by_name
2732 && !s->filenames_sorted)
2734 lang_section_bst_type *tree;
2736 walk_wild (s, output_section_callback_fast, output);
2741 output_section_callback_tree_to_list (s, tree, output);
2746 walk_wild (s, output_section_callback, output);
2748 if (default_common_section == NULL)
2749 for (sec = s->section_list; sec != NULL; sec = sec->next)
2750 if (sec->spec.name != NULL && strcmp (sec->spec.name, "COMMON") == 0)
2752 /* Remember the section that common is going to in case we
2753 later get something which doesn't know where to put it. */
2754 default_common_section = output;
2759 /* Return TRUE iff target is the sought target. */
2762 get_target (const bfd_target *target, void *data)
2764 const char *sought = (const char *) data;
2766 return strcmp (target->name, sought) == 0;
2769 /* Like strcpy() but convert to lower case as well. */
2772 stricpy (char *dest, char *src)
2776 while ((c = *src++) != 0)
2777 *dest++ = TOLOWER (c);
2782 /* Remove the first occurrence of needle (if any) in haystack
2786 strcut (char *haystack, char *needle)
2788 haystack = strstr (haystack, needle);
2794 for (src = haystack + strlen (needle); *src;)
2795 *haystack++ = *src++;
2801 /* Compare two target format name strings.
2802 Return a value indicating how "similar" they are. */
2805 name_compare (char *first, char *second)
2811 copy1 = (char *) xmalloc (strlen (first) + 1);
2812 copy2 = (char *) xmalloc (strlen (second) + 1);
2814 /* Convert the names to lower case. */
2815 stricpy (copy1, first);
2816 stricpy (copy2, second);
2818 /* Remove size and endian strings from the name. */
2819 strcut (copy1, "big");
2820 strcut (copy1, "little");
2821 strcut (copy2, "big");
2822 strcut (copy2, "little");
2824 /* Return a value based on how many characters match,
2825 starting from the beginning. If both strings are
2826 the same then return 10 * their length. */
2827 for (result = 0; copy1[result] == copy2[result]; result++)
2828 if (copy1[result] == 0)
2840 /* Set by closest_target_match() below. */
2841 static const bfd_target *winner;
2843 /* Scan all the valid bfd targets looking for one that has the endianness
2844 requirement that was specified on the command line, and is the nearest
2845 match to the original output target. */
2848 closest_target_match (const bfd_target *target, void *data)
2850 const bfd_target *original = (const bfd_target *) data;
2852 if (command_line.endian == ENDIAN_BIG
2853 && target->byteorder != BFD_ENDIAN_BIG)
2856 if (command_line.endian == ENDIAN_LITTLE
2857 && target->byteorder != BFD_ENDIAN_LITTLE)
2860 /* Must be the same flavour. */
2861 if (target->flavour != original->flavour)
2864 /* Ignore generic big and little endian elf vectors. */
2865 if (strcmp (target->name, "elf32-big") == 0
2866 || strcmp (target->name, "elf64-big") == 0
2867 || strcmp (target->name, "elf32-little") == 0
2868 || strcmp (target->name, "elf64-little") == 0)
2871 /* If we have not found a potential winner yet, then record this one. */
2878 /* Oh dear, we now have two potential candidates for a successful match.
2879 Compare their names and choose the better one. */
2880 if (name_compare (target->name, original->name)
2881 > name_compare (winner->name, original->name))
2884 /* Keep on searching until wqe have checked them all. */
2888 /* Return the BFD target format of the first input file. */
2891 get_first_input_target (void)
2893 char *target = NULL;
2895 LANG_FOR_EACH_INPUT_STATEMENT (s)
2897 if (s->header.type == lang_input_statement_enum
2900 ldfile_open_file (s);
2902 if (s->the_bfd != NULL
2903 && bfd_check_format (s->the_bfd, bfd_object))
2905 target = bfd_get_target (s->the_bfd);
2917 lang_get_output_target (void)
2921 /* Has the user told us which output format to use? */
2922 if (output_target != NULL)
2923 return output_target;
2925 /* No - has the current target been set to something other than
2927 if (current_target != default_target)
2928 return current_target;
2930 /* No - can we determine the format of the first input file? */
2931 target = get_first_input_target ();
2935 /* Failed - use the default output target. */
2936 return default_target;
2939 /* Open the output file. */
2942 open_output (const char *name)
2944 output_target = lang_get_output_target ();
2946 /* Has the user requested a particular endianness on the command
2948 if (command_line.endian != ENDIAN_UNSET)
2950 const bfd_target *target;
2951 enum bfd_endian desired_endian;
2953 /* Get the chosen target. */
2954 target = bfd_search_for_target (get_target, (void *) output_target);
2956 /* If the target is not supported, we cannot do anything. */
2959 if (command_line.endian == ENDIAN_BIG)
2960 desired_endian = BFD_ENDIAN_BIG;
2962 desired_endian = BFD_ENDIAN_LITTLE;
2964 /* See if the target has the wrong endianness. This should
2965 not happen if the linker script has provided big and
2966 little endian alternatives, but some scrips don't do
2968 if (target->byteorder != desired_endian)
2970 /* If it does, then see if the target provides
2971 an alternative with the correct endianness. */
2972 if (target->alternative_target != NULL
2973 && (target->alternative_target->byteorder == desired_endian))
2974 output_target = target->alternative_target->name;
2977 /* Try to find a target as similar as possible to
2978 the default target, but which has the desired
2979 endian characteristic. */
2980 bfd_search_for_target (closest_target_match,
2983 /* Oh dear - we could not find any targets that
2984 satisfy our requirements. */
2986 einfo (_("%P: warning: could not find any targets"
2987 " that match endianness requirement\n"));
2989 output_target = winner->name;
2995 link_info.output_bfd = bfd_openw (name, output_target);
2997 if (link_info.output_bfd == NULL)
2999 if (bfd_get_error () == bfd_error_invalid_target)
3000 einfo (_("%P%F: target %s not found\n"), output_target);
3002 einfo (_("%P%F: cannot open output file %s: %E\n"), name);
3005 delete_output_file_on_failure = TRUE;
3007 if (! bfd_set_format (link_info.output_bfd, bfd_object))
3008 einfo (_("%P%F:%s: can not make object file: %E\n"), name);
3009 if (! bfd_set_arch_mach (link_info.output_bfd,
3010 ldfile_output_architecture,
3011 ldfile_output_machine))
3012 einfo (_("%P%F:%s: can not set architecture: %E\n"), name);
3014 link_info.hash = bfd_link_hash_table_create (link_info.output_bfd);
3015 if (link_info.hash == NULL)
3016 einfo (_("%P%F: can not create hash table: %E\n"));
3018 bfd_set_gp_size (link_info.output_bfd, g_switch_value);
3022 ldlang_open_output (lang_statement_union_type *statement)
3024 switch (statement->header.type)
3026 case lang_output_statement_enum:
3027 ASSERT (link_info.output_bfd == NULL);
3028 open_output (statement->output_statement.name);
3029 ldemul_set_output_arch ();
3030 if (config.magic_demand_paged && !link_info.relocatable)
3031 link_info.output_bfd->flags |= D_PAGED;
3033 link_info.output_bfd->flags &= ~D_PAGED;
3034 if (config.text_read_only)
3035 link_info.output_bfd->flags |= WP_TEXT;
3037 link_info.output_bfd->flags &= ~WP_TEXT;
3038 if (link_info.traditional_format)
3039 link_info.output_bfd->flags |= BFD_TRADITIONAL_FORMAT;
3041 link_info.output_bfd->flags &= ~BFD_TRADITIONAL_FORMAT;
3044 case lang_target_statement_enum:
3045 current_target = statement->target_statement.target;
3052 /* Convert between addresses in bytes and sizes in octets.
3053 For currently supported targets, octets_per_byte is always a power
3054 of two, so we can use shifts. */
3055 #define TO_ADDR(X) ((X) >> opb_shift)
3056 #define TO_SIZE(X) ((X) << opb_shift)
3058 /* Support the above. */
3059 static unsigned int opb_shift = 0;
3064 unsigned x = bfd_arch_mach_octets_per_byte (ldfile_output_architecture,
3065 ldfile_output_machine);
3068 while ((x & 1) == 0)
3076 /* Open all the input files. */
3079 open_input_bfds (lang_statement_union_type *s, bfd_boolean force)
3081 for (; s != NULL; s = s->header.next)
3083 switch (s->header.type)
3085 case lang_constructors_statement_enum:
3086 open_input_bfds (constructor_list.head, force);
3088 case lang_output_section_statement_enum:
3089 open_input_bfds (s->output_section_statement.children.head, force);
3091 case lang_wild_statement_enum:
3092 /* Maybe we should load the file's symbols. */
3093 if (s->wild_statement.filename
3094 && !wildcardp (s->wild_statement.filename)
3095 && !archive_path (s->wild_statement.filename))
3096 lookup_name (s->wild_statement.filename);
3097 open_input_bfds (s->wild_statement.children.head, force);
3099 case lang_group_statement_enum:
3101 struct bfd_link_hash_entry *undefs;
3103 /* We must continually search the entries in the group
3104 until no new symbols are added to the list of undefined
3109 undefs = link_info.hash->undefs_tail;
3110 open_input_bfds (s->group_statement.children.head, TRUE);
3112 while (undefs != link_info.hash->undefs_tail);
3115 case lang_target_statement_enum:
3116 current_target = s->target_statement.target;
3118 case lang_input_statement_enum:
3119 if (s->input_statement.real)
3121 lang_statement_union_type **os_tail;
3122 lang_statement_list_type add;
3124 s->input_statement.target = current_target;
3126 /* If we are being called from within a group, and this
3127 is an archive which has already been searched, then
3128 force it to be researched unless the whole archive
3129 has been loaded already. */
3131 && !s->input_statement.whole_archive
3132 && s->input_statement.loaded
3133 && bfd_check_format (s->input_statement.the_bfd,
3135 s->input_statement.loaded = FALSE;
3137 os_tail = lang_output_section_statement.tail;
3138 lang_list_init (&add);
3140 if (! load_symbols (&s->input_statement, &add))
3141 config.make_executable = FALSE;
3143 if (add.head != NULL)
3145 /* If this was a script with output sections then
3146 tack any added statements on to the end of the
3147 list. This avoids having to reorder the output
3148 section statement list. Very likely the user
3149 forgot -T, and whatever we do here will not meet
3150 naive user expectations. */
3151 if (os_tail != lang_output_section_statement.tail)
3153 einfo (_("%P: warning: %s contains output sections;"
3154 " did you forget -T?\n"),
3155 s->input_statement.filename);
3156 *stat_ptr->tail = add.head;
3157 stat_ptr->tail = add.tail;
3161 *add.tail = s->header.next;
3162 s->header.next = add.head;
3173 /* Add a symbol to a hash of symbols used in DEFINED (NAME) expressions. */
3176 lang_track_definedness (const char *name)
3178 if (bfd_hash_lookup (&lang_definedness_table, name, TRUE, FALSE) == NULL)
3179 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name);
3182 /* New-function for the definedness hash table. */
3184 static struct bfd_hash_entry *
3185 lang_definedness_newfunc (struct bfd_hash_entry *entry,
3186 struct bfd_hash_table *table ATTRIBUTE_UNUSED,
3187 const char *name ATTRIBUTE_UNUSED)
3189 struct lang_definedness_hash_entry *ret
3190 = (struct lang_definedness_hash_entry *) entry;
3193 ret = (struct lang_definedness_hash_entry *)
3194 bfd_hash_allocate (table, sizeof (struct lang_definedness_hash_entry));
3197 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name);
3199 ret->iteration = -1;
3203 /* Return the iteration when the definition of NAME was last updated. A
3204 value of -1 means that the symbol is not defined in the linker script
3205 or the command line, but may be defined in the linker symbol table. */
3208 lang_symbol_definition_iteration (const char *name)
3210 struct lang_definedness_hash_entry *defentry
3211 = (struct lang_definedness_hash_entry *)
3212 bfd_hash_lookup (&lang_definedness_table, name, FALSE, FALSE);
3214 /* We've already created this one on the presence of DEFINED in the
3215 script, so it can't be NULL unless something is borked elsewhere in
3217 if (defentry == NULL)
3220 return defentry->iteration;
3223 /* Update the definedness state of NAME. */
3226 lang_update_definedness (const char *name, struct bfd_link_hash_entry *h)
3228 struct lang_definedness_hash_entry *defentry
3229 = (struct lang_definedness_hash_entry *)
3230 bfd_hash_lookup (&lang_definedness_table, name, FALSE, FALSE);
3232 /* We don't keep track of symbols not tested with DEFINED. */
3233 if (defentry == NULL)
3236 /* If the symbol was already defined, and not from an earlier statement
3237 iteration, don't update the definedness iteration, because that'd
3238 make the symbol seem defined in the linker script at this point, and
3239 it wasn't; it was defined in some object. If we do anyway, DEFINED
3240 would start to yield false before this point and the construct "sym =
3241 DEFINED (sym) ? sym : X;" would change sym to X despite being defined
3243 if (h->type != bfd_link_hash_undefined
3244 && h->type != bfd_link_hash_common
3245 && h->type != bfd_link_hash_new
3246 && defentry->iteration == -1)
3249 defentry->iteration = lang_statement_iteration;
3252 /* Add the supplied name to the symbol table as an undefined reference.
3253 This is a two step process as the symbol table doesn't even exist at
3254 the time the ld command line is processed. First we put the name
3255 on a list, then, once the output file has been opened, transfer the
3256 name to the symbol table. */
3258 typedef struct bfd_sym_chain ldlang_undef_chain_list_type;
3260 #define ldlang_undef_chain_list_head entry_symbol.next
3263 ldlang_add_undef (const char *const name)
3265 ldlang_undef_chain_list_type *new_undef = (ldlang_undef_chain_list_type *)
3266 stat_alloc (sizeof (ldlang_undef_chain_list_type));
3268 new_undef->next = ldlang_undef_chain_list_head;
3269 ldlang_undef_chain_list_head = new_undef;
3271 new_undef->name = xstrdup (name);
3273 if (link_info.output_bfd != NULL)
3274 insert_undefined (new_undef->name);
3277 /* Insert NAME as undefined in the symbol table. */
3280 insert_undefined (const char *name)
3282 struct bfd_link_hash_entry *h;
3284 h = bfd_link_hash_lookup (link_info.hash, name, TRUE, FALSE, TRUE);
3286 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
3287 if (h->type == bfd_link_hash_new)
3289 h->type = bfd_link_hash_undefined;
3290 h->u.undef.abfd = NULL;
3291 bfd_link_add_undef (link_info.hash, h);
3295 /* Run through the list of undefineds created above and place them
3296 into the linker hash table as undefined symbols belonging to the
3300 lang_place_undefineds (void)
3302 ldlang_undef_chain_list_type *ptr;
3304 for (ptr = ldlang_undef_chain_list_head; ptr != NULL; ptr = ptr->next)
3305 insert_undefined (ptr->name);
3308 /* Check for all readonly or some readwrite sections. */
3311 check_input_sections
3312 (lang_statement_union_type *s,
3313 lang_output_section_statement_type *output_section_statement)
3315 for (; s != (lang_statement_union_type *) NULL; s = s->header.next)
3317 switch (s->header.type)
3319 case lang_wild_statement_enum:
3320 walk_wild (&s->wild_statement, check_section_callback,
3321 output_section_statement);
3322 if (! output_section_statement->all_input_readonly)
3325 case lang_constructors_statement_enum:
3326 check_input_sections (constructor_list.head,
3327 output_section_statement);
3328 if (! output_section_statement->all_input_readonly)
3331 case lang_group_statement_enum:
3332 check_input_sections (s->group_statement.children.head,
3333 output_section_statement);
3334 if (! output_section_statement->all_input_readonly)
3343 /* Update wildcard statements if needed. */
3346 update_wild_statements (lang_statement_union_type *s)
3348 struct wildcard_list *sec;
3350 switch (sort_section)
3360 for (; s != NULL; s = s->header.next)
3362 switch (s->header.type)
3367 case lang_wild_statement_enum:
3368 sec = s->wild_statement.section_list;
3369 for (sec = s->wild_statement.section_list; sec != NULL;
3372 switch (sec->spec.sorted)
3375 sec->spec.sorted = sort_section;
3378 if (sort_section == by_alignment)
3379 sec->spec.sorted = by_name_alignment;
3382 if (sort_section == by_name)
3383 sec->spec.sorted = by_alignment_name;
3391 case lang_constructors_statement_enum:
3392 update_wild_statements (constructor_list.head);
3395 case lang_output_section_statement_enum:
3396 update_wild_statements
3397 (s->output_section_statement.children.head);
3400 case lang_group_statement_enum:
3401 update_wild_statements (s->group_statement.children.head);
3409 /* Open input files and attach to output sections. */
3412 map_input_to_output_sections
3413 (lang_statement_union_type *s, const char *target,
3414 lang_output_section_statement_type *os)
3418 for (; s != NULL; s = s->header.next)
3420 switch (s->header.type)
3422 case lang_wild_statement_enum:
3423 wild (&s->wild_statement, target, os);
3425 case lang_constructors_statement_enum:
3426 map_input_to_output_sections (constructor_list.head,
3430 case lang_output_section_statement_enum:
3431 if (s->output_section_statement.constraint)
3433 if (s->output_section_statement.constraint != ONLY_IF_RW
3434 && s->output_section_statement.constraint != ONLY_IF_RO)
3436 s->output_section_statement.all_input_readonly = TRUE;
3437 check_input_sections (s->output_section_statement.children.head,
3438 &s->output_section_statement);
3439 if ((s->output_section_statement.all_input_readonly
3440 && s->output_section_statement.constraint == ONLY_IF_RW)
3441 || (!s->output_section_statement.all_input_readonly
3442 && s->output_section_statement.constraint == ONLY_IF_RO))
3444 s->output_section_statement.constraint = -1;
3449 map_input_to_output_sections (s->output_section_statement.children.head,
3451 &s->output_section_statement);
3453 case lang_output_statement_enum:
3455 case lang_target_statement_enum:
3456 target = s->target_statement.target;
3458 case lang_group_statement_enum:
3459 map_input_to_output_sections (s->group_statement.children.head,
3463 case lang_data_statement_enum:
3464 /* Make sure that any sections mentioned in the expression
3466 exp_init_os (s->data_statement.exp);
3467 flags = SEC_HAS_CONTENTS;
3468 /* The output section gets contents, and then we inspect for
3469 any flags set in the input script which override any ALLOC. */
3470 if (!(os->flags & SEC_NEVER_LOAD))
3471 flags |= SEC_ALLOC | SEC_LOAD;
3472 if (os->bfd_section == NULL)
3473 init_os (os, NULL, flags);
3475 os->bfd_section->flags |= flags;
3477 case lang_input_section_enum:
3479 case lang_fill_statement_enum:
3480 case lang_object_symbols_statement_enum:
3481 case lang_reloc_statement_enum:
3482 case lang_padding_statement_enum:
3483 case lang_input_statement_enum:
3484 if (os != NULL && os->bfd_section == NULL)
3485 init_os (os, NULL, 0);
3487 case lang_assignment_statement_enum:
3488 if (os != NULL && os->bfd_section == NULL)
3489 init_os (os, NULL, 0);
3491 /* Make sure that any sections mentioned in the assignment
3493 exp_init_os (s->assignment_statement.exp);
3495 case lang_address_statement_enum:
3496 /* Mark the specified section with the supplied address.
3497 If this section was actually a segment marker, then the
3498 directive is ignored if the linker script explicitly
3499 processed the segment marker. Originally, the linker
3500 treated segment directives (like -Ttext on the
3501 command-line) as section directives. We honor the
3502 section directive semantics for backwards compatibilty;
3503 linker scripts that do not specifically check for
3504 SEGMENT_START automatically get the old semantics. */
3505 if (!s->address_statement.segment
3506 || !s->address_statement.segment->used)
3508 lang_output_section_statement_type *aos
3509 = (lang_output_section_statement_lookup
3510 (s->address_statement.section_name, 0, TRUE));
3512 if (aos->bfd_section == NULL)
3513 init_os (aos, NULL, 0);
3514 aos->addr_tree = s->address_statement.address;
3517 case lang_insert_statement_enum:
3523 /* An insert statement snips out all the linker statements from the
3524 start of the list and places them after the output section
3525 statement specified by the insert. This operation is complicated
3526 by the fact that we keep a doubly linked list of output section
3527 statements as well as the singly linked list of all statements. */
3530 process_insert_statements (void)
3532 lang_statement_union_type **s;
3533 lang_output_section_statement_type *first_os = NULL;
3534 lang_output_section_statement_type *last_os = NULL;
3535 lang_output_section_statement_type *os;
3537 /* "start of list" is actually the statement immediately after
3538 the special abs_section output statement, so that it isn't
3540 s = &lang_output_section_statement.head;
3541 while (*(s = &(*s)->header.next) != NULL)
3543 if ((*s)->header.type == lang_output_section_statement_enum)
3545 /* Keep pointers to the first and last output section
3546 statement in the sequence we may be about to move. */
3547 os = &(*s)->output_section_statement;
3549 ASSERT (last_os == NULL || last_os->next == os);
3552 /* Set constraint negative so that lang_output_section_find
3553 won't match this output section statement. At this
3554 stage in linking constraint has values in the range
3555 [-1, ONLY_IN_RW]. */
3556 last_os->constraint = -2 - last_os->constraint;
3557 if (first_os == NULL)
3560 else if ((*s)->header.type == lang_insert_statement_enum)
3562 lang_insert_statement_type *i = &(*s)->insert_statement;
3563 lang_output_section_statement_type *where;
3564 lang_statement_union_type **ptr;
3565 lang_statement_union_type *first;
3567 where = lang_output_section_find (i->where);
3568 if (where != NULL && i->is_before)
3571 where = where->prev;
3572 while (where != NULL && where->constraint < 0);
3576 einfo (_("%F%P: %s not found for insert\n"), i->where);
3580 /* Deal with reordering the output section statement list. */
3581 if (last_os != NULL)
3583 asection *first_sec, *last_sec;
3584 struct lang_output_section_statement_struct **next;
3586 /* Snip out the output sections we are moving. */
3587 first_os->prev->next = last_os->next;
3588 if (last_os->next == NULL)
3590 next = &first_os->prev->next;
3591 lang_output_section_statement.tail
3592 = (lang_statement_union_type **) next;
3595 last_os->next->prev = first_os->prev;
3596 /* Add them in at the new position. */
3597 last_os->next = where->next;
3598 if (where->next == NULL)
3600 next = &last_os->next;
3601 lang_output_section_statement.tail
3602 = (lang_statement_union_type **) next;
3605 where->next->prev = last_os;
3606 first_os->prev = where;
3607 where->next = first_os;
3609 /* Move the bfd sections in the same way. */
3612 for (os = first_os; os != NULL; os = os->next)
3614 os->constraint = -2 - os->constraint;
3615 if (os->bfd_section != NULL
3616 && os->bfd_section->owner != NULL)
3618 last_sec = os->bfd_section;
3619 if (first_sec == NULL)
3620 first_sec = last_sec;
3625 if (last_sec != NULL)
3627 asection *sec = where->bfd_section;
3629 sec = output_prev_sec_find (where);
3631 /* The place we want to insert must come after the
3632 sections we are moving. So if we find no
3633 section or if the section is the same as our
3634 last section, then no move is needed. */
3635 if (sec != NULL && sec != last_sec)
3637 /* Trim them off. */
3638 if (first_sec->prev != NULL)
3639 first_sec->prev->next = last_sec->next;
3641 link_info.output_bfd->sections = last_sec->next;
3642 if (last_sec->next != NULL)
3643 last_sec->next->prev = first_sec->prev;
3645 link_info.output_bfd->section_last = first_sec->prev;
3647 last_sec->next = sec->next;
3648 if (sec->next != NULL)
3649 sec->next->prev = last_sec;
3651 link_info.output_bfd->section_last = last_sec;
3652 first_sec->prev = sec;
3653 sec->next = first_sec;
3661 ptr = insert_os_after (where);
3662 /* Snip everything after the abs_section output statement we
3663 know is at the start of the list, up to and including
3664 the insert statement we are currently processing. */
3665 first = lang_output_section_statement.head->header.next;
3666 lang_output_section_statement.head->header.next = (*s)->header.next;
3667 /* Add them back where they belong. */
3670 statement_list.tail = s;
3672 s = &lang_output_section_statement.head;
3676 /* Undo constraint twiddling. */
3677 for (os = first_os; os != NULL; os = os->next)
3679 os->constraint = -2 - os->constraint;
3685 /* An output section might have been removed after its statement was
3686 added. For example, ldemul_before_allocation can remove dynamic
3687 sections if they turn out to be not needed. Clean them up here. */
3690 strip_excluded_output_sections (void)
3692 lang_output_section_statement_type *os;
3694 /* Run lang_size_sections (if not already done). */
3695 if (expld.phase != lang_mark_phase_enum)
3697 expld.phase = lang_mark_phase_enum;
3698 expld.dataseg.phase = exp_dataseg_none;
3699 one_lang_size_sections_pass (NULL, FALSE);
3700 lang_reset_memory_regions ();
3703 for (os = &lang_output_section_statement.head->output_section_statement;
3707 asection *output_section;
3708 bfd_boolean exclude;
3710 if (os->constraint < 0)
3713 output_section = os->bfd_section;
3714 if (output_section == NULL)
3717 exclude = (output_section->rawsize == 0
3718 && (output_section->flags & SEC_KEEP) == 0
3719 && !bfd_section_removed_from_list (link_info.output_bfd,
3722 /* Some sections have not yet been sized, notably .gnu.version,
3723 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3724 input sections, so don't drop output sections that have such
3725 input sections unless they are also marked SEC_EXCLUDE. */
3726 if (exclude && output_section->map_head.s != NULL)
3730 for (s = output_section->map_head.s; s != NULL; s = s->map_head.s)
3731 if ((s->flags & SEC_LINKER_CREATED) != 0
3732 && (s->flags & SEC_EXCLUDE) == 0)
3739 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3740 output_section->map_head.link_order = NULL;
3741 output_section->map_tail.link_order = NULL;
3745 /* We don't set bfd_section to NULL since bfd_section of the
3746 removed output section statement may still be used. */
3747 if (!os->section_relative_symbol
3748 && !os->update_dot_tree)
3750 output_section->flags |= SEC_EXCLUDE;
3751 bfd_section_list_remove (link_info.output_bfd, output_section);
3752 link_info.output_bfd->section_count--;
3756 /* Stop future calls to lang_add_section from messing with map_head
3757 and map_tail link_order fields. */
3758 stripped_excluded_sections = TRUE;
3762 print_output_section_statement
3763 (lang_output_section_statement_type *output_section_statement)
3765 asection *section = output_section_statement->bfd_section;
3768 if (output_section_statement != abs_output_section)
3770 minfo ("\n%s", output_section_statement->name);
3772 if (section != NULL)
3774 print_dot = section->vma;
3776 len = strlen (output_section_statement->name);
3777 if (len >= SECTION_NAME_MAP_LENGTH - 1)
3782 while (len < SECTION_NAME_MAP_LENGTH)
3788 minfo ("0x%V %W", section->vma, section->size);
3790 if (section->vma != section->lma)
3791 minfo (_(" load address 0x%V"), section->lma);
3793 if (output_section_statement->update_dot_tree != NULL)
3794 exp_fold_tree (output_section_statement->update_dot_tree,
3795 bfd_abs_section_ptr, &print_dot);
3801 print_statement_list (output_section_statement->children.head,
3802 output_section_statement);
3805 /* Scan for the use of the destination in the right hand side
3806 of an expression. In such cases we will not compute the
3807 correct expression, since the value of DST that is used on
3808 the right hand side will be its final value, not its value
3809 just before this expression is evaluated. */
3812 scan_for_self_assignment (const char * dst, etree_type * rhs)
3814 if (rhs == NULL || dst == NULL)
3817 switch (rhs->type.node_class)
3820 return scan_for_self_assignment (dst, rhs->binary.lhs)
3821 || scan_for_self_assignment (dst, rhs->binary.rhs);
3824 return scan_for_self_assignment (dst, rhs->trinary.lhs)
3825 || scan_for_self_assignment (dst, rhs->trinary.rhs);
3828 case etree_provided:
3830 if (strcmp (dst, rhs->assign.dst) == 0)
3832 return scan_for_self_assignment (dst, rhs->assign.src);
3835 return scan_for_self_assignment (dst, rhs->unary.child);
3839 return strcmp (dst, rhs->value.str) == 0;
3844 return strcmp (dst, rhs->name.name) == 0;
3856 print_assignment (lang_assignment_statement_type *assignment,
3857 lang_output_section_statement_type *output_section)
3861 bfd_boolean computation_is_valid = TRUE;
3864 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
3867 if (assignment->exp->type.node_class == etree_assert)
3870 tree = assignment->exp->assert_s.child;
3871 computation_is_valid = TRUE;
3875 const char *dst = assignment->exp->assign.dst;
3877 is_dot = (dst[0] == '.' && dst[1] == 0);
3878 tree = assignment->exp->assign.src;
3879 computation_is_valid = is_dot || (scan_for_self_assignment (dst, tree) == FALSE);
3882 exp_fold_tree (tree, output_section->bfd_section, &print_dot);
3883 if (expld.result.valid_p)
3887 if (computation_is_valid)
3889 value = expld.result.value;
3891 if (expld.result.section)
3892 value += expld.result.section->vma;
3894 minfo ("0x%V", value);
3900 struct bfd_link_hash_entry *h;
3902 h = bfd_link_hash_lookup (link_info.hash, assignment->exp->assign.dst,
3903 FALSE, FALSE, TRUE);
3906 value = h->u.def.value;
3908 if (expld.result.section)
3909 value += expld.result.section->vma;
3911 minfo ("[0x%V]", value);
3914 minfo ("[unresolved]");
3926 exp_print_tree (assignment->exp);
3931 print_input_statement (lang_input_statement_type *statm)
3933 if (statm->filename != NULL
3934 && (statm->the_bfd == NULL
3935 || (statm->the_bfd->flags & BFD_LINKER_CREATED) == 0))
3936 fprintf (config.map_file, "LOAD %s\n", statm->filename);
3939 /* Print all symbols defined in a particular section. This is called
3940 via bfd_link_hash_traverse, or by print_all_symbols. */
3943 print_one_symbol (struct bfd_link_hash_entry *hash_entry, void *ptr)
3945 asection *sec = (asection *) ptr;
3947 if ((hash_entry->type == bfd_link_hash_defined
3948 || hash_entry->type == bfd_link_hash_defweak)
3949 && sec == hash_entry->u.def.section)
3953 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
3956 (hash_entry->u.def.value
3957 + hash_entry->u.def.section->output_offset
3958 + hash_entry->u.def.section->output_section->vma));
3960 minfo (" %T\n", hash_entry->root.string);
3967 hash_entry_addr_cmp (const void *a, const void *b)
3969 const struct bfd_link_hash_entry *l = *(const struct bfd_link_hash_entry **)a;
3970 const struct bfd_link_hash_entry *r = *(const struct bfd_link_hash_entry **)b;
3972 if (l->u.def.value < r->u.def.value)
3974 else if (l->u.def.value > r->u.def.value)
3981 print_all_symbols (asection *sec)
3983 struct fat_user_section_struct *ud =
3984 (struct fat_user_section_struct *) get_userdata (sec);
3985 struct map_symbol_def *def;
3986 struct bfd_link_hash_entry **entries;
3992 *ud->map_symbol_def_tail = 0;
3994 /* Sort the symbols by address. */
3995 entries = (struct bfd_link_hash_entry **)
3996 obstack_alloc (&map_obstack, ud->map_symbol_def_count * sizeof (*entries));
3998 for (i = 0, def = ud->map_symbol_def_head; def; def = def->next, i++)
3999 entries[i] = def->entry;
4001 qsort (entries, ud->map_symbol_def_count, sizeof (*entries),
4002 hash_entry_addr_cmp);
4004 /* Print the symbols. */
4005 for (i = 0; i < ud->map_symbol_def_count; i++)
4006 print_one_symbol (entries[i], sec);
4008 obstack_free (&map_obstack, entries);
4011 /* Print information about an input section to the map file. */
4014 print_input_section (asection *i, bfd_boolean is_discarded)
4016 bfd_size_type size = i->size;
4023 minfo ("%s", i->name);
4025 len = 1 + strlen (i->name);
4026 if (len >= SECTION_NAME_MAP_LENGTH - 1)
4031 while (len < SECTION_NAME_MAP_LENGTH)
4037 if (i->output_section != NULL
4038 && i->output_section->owner == link_info.output_bfd)
4039 addr = i->output_section->vma + i->output_offset;
4047 minfo ("0x%V %W %B\n", addr, TO_ADDR (size), i->owner);
4049 if (size != i->rawsize && i->rawsize != 0)
4051 len = SECTION_NAME_MAP_LENGTH + 3;
4063 minfo (_("%W (size before relaxing)\n"), i->rawsize);
4066 if (i->output_section != NULL
4067 && i->output_section->owner == link_info.output_bfd)
4069 if (link_info.reduce_memory_overheads)
4070 bfd_link_hash_traverse (link_info.hash, print_one_symbol, i);
4072 print_all_symbols (i);
4074 /* Update print_dot, but make sure that we do not move it
4075 backwards - this could happen if we have overlays and a
4076 later overlay is shorter than an earier one. */
4077 if (addr + TO_ADDR (size) > print_dot)
4078 print_dot = addr + TO_ADDR (size);
4083 print_fill_statement (lang_fill_statement_type *fill)
4087 fputs (" FILL mask 0x", config.map_file);
4088 for (p = fill->fill->data, size = fill->fill->size; size != 0; p++, size--)
4089 fprintf (config.map_file, "%02x", *p);
4090 fputs ("\n", config.map_file);
4094 print_data_statement (lang_data_statement_type *data)
4102 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
4105 addr = data->output_offset;
4106 if (data->output_section != NULL)
4107 addr += data->output_section->vma;
4135 minfo ("0x%V %W %s 0x%v", addr, size, name, data->value);
4137 if (data->exp->type.node_class != etree_value)
4140 exp_print_tree (data->exp);
4145 print_dot = addr + TO_ADDR (size);
4148 /* Print an address statement. These are generated by options like
4152 print_address_statement (lang_address_statement_type *address)
4154 minfo (_("Address of section %s set to "), address->section_name);
4155 exp_print_tree (address->address);
4159 /* Print a reloc statement. */
4162 print_reloc_statement (lang_reloc_statement_type *reloc)
4169 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
4172 addr = reloc->output_offset;
4173 if (reloc->output_section != NULL)
4174 addr += reloc->output_section->vma;
4176 size = bfd_get_reloc_size (reloc->howto);
4178 minfo ("0x%V %W RELOC %s ", addr, size, reloc->howto->name);
4180 if (reloc->name != NULL)
4181 minfo ("%s+", reloc->name);
4183 minfo ("%s+", reloc->section->name);
4185 exp_print_tree (reloc->addend_exp);
4189 print_dot = addr + TO_ADDR (size);
4193 print_padding_statement (lang_padding_statement_type *s)
4201 len = sizeof " *fill*" - 1;
4202 while (len < SECTION_NAME_MAP_LENGTH)
4208 addr = s->output_offset;
4209 if (s->output_section != NULL)
4210 addr += s->output_section->vma;
4211 minfo ("0x%V %W ", addr, (bfd_vma) s->size);
4213 if (s->fill->size != 0)
4217 for (p = s->fill->data, size = s->fill->size; size != 0; p++, size--)
4218 fprintf (config.map_file, "%02x", *p);
4223 print_dot = addr + TO_ADDR (s->size);
4227 print_wild_statement (lang_wild_statement_type *w,
4228 lang_output_section_statement_type *os)
4230 struct wildcard_list *sec;
4234 if (w->filenames_sorted)
4236 if (w->filename != NULL)
4237 minfo ("%s", w->filename);
4240 if (w->filenames_sorted)
4244 for (sec = w->section_list; sec; sec = sec->next)
4246 if (sec->spec.sorted)
4248 if (sec->spec.exclude_name_list != NULL)
4251 minfo ("EXCLUDE_FILE(%s", sec->spec.exclude_name_list->name);
4252 for (tmp = sec->spec.exclude_name_list->next; tmp; tmp = tmp->next)
4253 minfo (" %s", tmp->name);
4256 if (sec->spec.name != NULL)
4257 minfo ("%s", sec->spec.name);
4260 if (sec->spec.sorted)
4269 print_statement_list (w->children.head, os);
4272 /* Print a group statement. */
4275 print_group (lang_group_statement_type *s,
4276 lang_output_section_statement_type *os)
4278 fprintf (config.map_file, "START GROUP\n");
4279 print_statement_list (s->children.head, os);
4280 fprintf (config.map_file, "END GROUP\n");
4283 /* Print the list of statements in S.
4284 This can be called for any statement type. */
4287 print_statement_list (lang_statement_union_type *s,
4288 lang_output_section_statement_type *os)
4292 print_statement (s, os);
4297 /* Print the first statement in statement list S.
4298 This can be called for any statement type. */
4301 print_statement (lang_statement_union_type *s,
4302 lang_output_section_statement_type *os)
4304 switch (s->header.type)
4307 fprintf (config.map_file, _("Fail with %d\n"), s->header.type);
4310 case lang_constructors_statement_enum:
4311 if (constructor_list.head != NULL)
4313 if (constructors_sorted)
4314 minfo (" SORT (CONSTRUCTORS)\n");
4316 minfo (" CONSTRUCTORS\n");
4317 print_statement_list (constructor_list.head, os);
4320 case lang_wild_statement_enum:
4321 print_wild_statement (&s->wild_statement, os);
4323 case lang_address_statement_enum:
4324 print_address_statement (&s->address_statement);
4326 case lang_object_symbols_statement_enum:
4327 minfo (" CREATE_OBJECT_SYMBOLS\n");
4329 case lang_fill_statement_enum:
4330 print_fill_statement (&s->fill_statement);
4332 case lang_data_statement_enum:
4333 print_data_statement (&s->data_statement);
4335 case lang_reloc_statement_enum:
4336 print_reloc_statement (&s->reloc_statement);
4338 case lang_input_section_enum:
4339 print_input_section (s->input_section.section, FALSE);
4341 case lang_padding_statement_enum:
4342 print_padding_statement (&s->padding_statement);
4344 case lang_output_section_statement_enum:
4345 print_output_section_statement (&s->output_section_statement);
4347 case lang_assignment_statement_enum:
4348 print_assignment (&s->assignment_statement, os);
4350 case lang_target_statement_enum:
4351 fprintf (config.map_file, "TARGET(%s)\n", s->target_statement.target);
4353 case lang_output_statement_enum:
4354 minfo ("OUTPUT(%s", s->output_statement.name);
4355 if (output_target != NULL)
4356 minfo (" %s", output_target);
4359 case lang_input_statement_enum:
4360 print_input_statement (&s->input_statement);
4362 case lang_group_statement_enum:
4363 print_group (&s->group_statement, os);
4365 case lang_insert_statement_enum:
4366 minfo ("INSERT %s %s\n",
4367 s->insert_statement.is_before ? "BEFORE" : "AFTER",
4368 s->insert_statement.where);
4374 print_statements (void)
4376 print_statement_list (statement_list.head, abs_output_section);
4379 /* Print the first N statements in statement list S to STDERR.
4380 If N == 0, nothing is printed.
4381 If N < 0, the entire list is printed.
4382 Intended to be called from GDB. */
4385 dprint_statement (lang_statement_union_type *s, int n)
4387 FILE *map_save = config.map_file;
4389 config.map_file = stderr;
4392 print_statement_list (s, abs_output_section);
4395 while (s && --n >= 0)
4397 print_statement (s, abs_output_section);
4402 config.map_file = map_save;
4406 insert_pad (lang_statement_union_type **ptr,
4408 unsigned int alignment_needed,
4409 asection *output_section,
4412 static fill_type zero_fill = { 1, { 0 } };
4413 lang_statement_union_type *pad = NULL;
4415 if (ptr != &statement_list.head)
4416 pad = ((lang_statement_union_type *)
4417 ((char *) ptr - offsetof (lang_statement_union_type, header.next)));
4419 && pad->header.type == lang_padding_statement_enum
4420 && pad->padding_statement.output_section == output_section)
4422 /* Use the existing pad statement. */
4424 else if ((pad = *ptr) != NULL
4425 && pad->header.type == lang_padding_statement_enum
4426 && pad->padding_statement.output_section == output_section)
4428 /* Use the existing pad statement. */
4432 /* Make a new padding statement, linked into existing chain. */
4433 pad = (lang_statement_union_type *)
4434 stat_alloc (sizeof (lang_padding_statement_type));
4435 pad->header.next = *ptr;
4437 pad->header.type = lang_padding_statement_enum;
4438 pad->padding_statement.output_section = output_section;
4441 pad->padding_statement.fill = fill;
4443 pad->padding_statement.output_offset = dot - output_section->vma;
4444 pad->padding_statement.size = alignment_needed;
4445 output_section->size += alignment_needed;
4448 /* Work out how much this section will move the dot point. */
4452 (lang_statement_union_type **this_ptr,
4453 lang_output_section_statement_type *output_section_statement,
4457 lang_input_section_type *is = &((*this_ptr)->input_section);
4458 asection *i = is->section;
4460 if (!((lang_input_statement_type *) i->owner->usrdata)->just_syms_flag
4461 && (i->flags & SEC_EXCLUDE) == 0)
4463 unsigned int alignment_needed;
4466 /* Align this section first to the input sections requirement,
4467 then to the output section's requirement. If this alignment
4468 is greater than any seen before, then record it too. Perform
4469 the alignment by inserting a magic 'padding' statement. */
4471 if (output_section_statement->subsection_alignment != -1)
4472 i->alignment_power = output_section_statement->subsection_alignment;
4474 o = output_section_statement->bfd_section;
4475 if (o->alignment_power < i->alignment_power)
4476 o->alignment_power = i->alignment_power;
4478 alignment_needed = align_power (dot, i->alignment_power) - dot;
4480 if (alignment_needed != 0)
4482 insert_pad (this_ptr, fill, TO_SIZE (alignment_needed), o, dot);
4483 dot += alignment_needed;
4486 /* Remember where in the output section this input section goes. */
4488 i->output_offset = dot - o->vma;
4490 /* Mark how big the output section must be to contain this now. */
4491 dot += TO_ADDR (i->size);
4492 o->size = TO_SIZE (dot - o->vma);
4496 i->output_offset = i->vma - output_section_statement->bfd_section->vma;
4503 sort_sections_by_lma (const void *arg1, const void *arg2)
4505 const asection *sec1 = *(const asection **) arg1;
4506 const asection *sec2 = *(const asection **) arg2;
4508 if (bfd_section_lma (sec1->owner, sec1)
4509 < bfd_section_lma (sec2->owner, sec2))
4511 else if (bfd_section_lma (sec1->owner, sec1)
4512 > bfd_section_lma (sec2->owner, sec2))
4514 else if (sec1->id < sec2->id)
4516 else if (sec1->id > sec2->id)
4522 #define IGNORE_SECTION(s) \
4523 ((s->flags & SEC_NEVER_LOAD) != 0 \
4524 || (s->flags & SEC_ALLOC) == 0 \
4525 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
4526 && (s->flags & SEC_LOAD) == 0))
4528 /* Check to see if any allocated sections overlap with other allocated
4529 sections. This can happen if a linker script specifies the output
4530 section addresses of the two sections. Also check whether any memory
4531 region has overflowed. */
4534 lang_check_section_addresses (void)
4537 asection **sections, **spp;
4544 lang_memory_region_type *m;
4546 if (bfd_count_sections (link_info.output_bfd) <= 1)
4549 amt = bfd_count_sections (link_info.output_bfd) * sizeof (asection *);
4550 sections = (asection **) xmalloc (amt);
4552 /* Scan all sections in the output list. */
4554 for (s = link_info.output_bfd->sections; s != NULL; s = s->next)
4556 /* Only consider loadable sections with real contents. */
4557 if ((s->flags & SEC_NEVER_LOAD)
4558 || !(s->flags & SEC_LOAD)
4559 || !(s->flags & SEC_ALLOC)
4563 sections[count] = s;
4570 qsort (sections, (size_t) count, sizeof (asection *),
4571 sort_sections_by_lma);
4575 s_start = bfd_section_lma (link_info.output_bfd, s);
4576 s_end = s_start + TO_ADDR (s->size) - 1;
4577 for (count--; count; count--)
4579 /* We must check the sections' LMA addresses not their VMA
4580 addresses because overlay sections can have overlapping VMAs
4581 but they must have distinct LMAs. */
4586 s_start = bfd_section_lma (link_info.output_bfd, s);
4587 s_end = s_start + TO_ADDR (s->size) - 1;
4589 /* Look for an overlap. */
4590 if (s_end >= os_start && s_start <= os_end)
4591 einfo (_("%X%P: section %s loaded at [%V,%V] overlaps section %s loaded at [%V,%V]\n"),
4592 s->name, s_start, s_end, os->name, os_start, os_end);
4597 /* If any memory region has overflowed, report by how much.
4598 We do not issue this diagnostic for regions that had sections
4599 explicitly placed outside their bounds; os_region_check's
4600 diagnostics are adequate for that case.
4602 FIXME: It is conceivable that m->current - (m->origin + m->length)
4603 might overflow a 32-bit integer. There is, alas, no way to print
4604 a bfd_vma quantity in decimal. */
4605 for (m = lang_memory_region_list; m; m = m->next)
4606 if (m->had_full_message)
4607 einfo (_("%X%P: region `%s' overflowed by %ld bytes\n"),
4608 m->name_list.name, (long)(m->current - (m->origin + m->length)));
4612 /* Make sure the new address is within the region. We explicitly permit the
4613 current address to be at the exact end of the region when the address is
4614 non-zero, in case the region is at the end of addressable memory and the
4615 calculation wraps around. */
4618 os_region_check (lang_output_section_statement_type *os,
4619 lang_memory_region_type *region,
4623 if ((region->current < region->origin
4624 || (region->current - region->origin > region->length))
4625 && ((region->current != region->origin + region->length)
4630 einfo (_("%X%P: address 0x%v of %B section `%s'"
4631 " is not within region `%s'\n"),
4633 os->bfd_section->owner,
4634 os->bfd_section->name,
4635 region->name_list.name);
4637 else if (!region->had_full_message)
4639 region->had_full_message = TRUE;
4641 einfo (_("%X%P: %B section `%s' will not fit in region `%s'\n"),
4642 os->bfd_section->owner,
4643 os->bfd_section->name,
4644 region->name_list.name);
4649 /* Set the sizes for all the output sections. */
4652 lang_size_sections_1
4653 (lang_statement_union_type *s,
4654 lang_output_section_statement_type *output_section_statement,
4655 lang_statement_union_type **prev,
4659 bfd_boolean check_regions)
4661 /* Size up the sections from their constituent parts. */
4662 for (; s != NULL; s = s->header.next)
4664 switch (s->header.type)
4666 case lang_output_section_statement_enum:
4668 bfd_vma newdot, after;
4669 lang_output_section_statement_type *os;
4670 lang_memory_region_type *r;
4672 os = &s->output_section_statement;
4673 /* FIXME: We shouldn't need to zero section vmas for ld -r
4674 here, in lang_insert_orphan, or in the default linker scripts.
4675 This is covering for coff backend linker bugs. See PR6945. */
4676 if (os->addr_tree == NULL
4677 && link_info.relocatable
4678 && (bfd_get_flavour (link_info.output_bfd)
4679 == bfd_target_coff_flavour))
4680 os->addr_tree = exp_intop (0);
4681 if (os->addr_tree != NULL)
4683 os->processed_vma = FALSE;
4684 exp_fold_tree (os->addr_tree, bfd_abs_section_ptr, &dot);
4686 if (expld.result.valid_p)
4687 dot = expld.result.value + expld.result.section->vma;
4688 else if (expld.phase != lang_mark_phase_enum)
4689 einfo (_("%F%S: non constant or forward reference"
4690 " address expression for section %s\n"),
4694 if (os->bfd_section == NULL)
4695 /* This section was removed or never actually created. */
4698 /* If this is a COFF shared library section, use the size and
4699 address from the input section. FIXME: This is COFF
4700 specific; it would be cleaner if there were some other way
4701 to do this, but nothing simple comes to mind. */
4702 if (((bfd_get_flavour (link_info.output_bfd)
4703 == bfd_target_ecoff_flavour)
4704 || (bfd_get_flavour (link_info.output_bfd)
4705 == bfd_target_coff_flavour))
4706 && (os->bfd_section->flags & SEC_COFF_SHARED_LIBRARY) != 0)
4710 if (os->children.head == NULL
4711 || os->children.head->header.next != NULL
4712 || (os->children.head->header.type
4713 != lang_input_section_enum))
4714 einfo (_("%P%X: Internal error on COFF shared library"
4715 " section %s\n"), os->name);
4717 input = os->children.head->input_section.section;
4718 bfd_set_section_vma (os->bfd_section->owner,
4720 bfd_section_vma (input->owner, input));
4721 os->bfd_section->size = input->size;
4726 if (bfd_is_abs_section (os->bfd_section))
4728 /* No matter what happens, an abs section starts at zero. */
4729 ASSERT (os->bfd_section->vma == 0);
4735 if (os->addr_tree == NULL)
4737 /* No address specified for this section, get one
4738 from the region specification. */
4739 if (os->region == NULL
4740 || ((os->bfd_section->flags & (SEC_ALLOC | SEC_LOAD))
4741 && os->region->name_list.name[0] == '*'
4742 && strcmp (os->region->name_list.name,
4743 DEFAULT_MEMORY_REGION) == 0))
4745 os->region = lang_memory_default (os->bfd_section);
4748 /* If a loadable section is using the default memory
4749 region, and some non default memory regions were
4750 defined, issue an error message. */
4752 && !IGNORE_SECTION (os->bfd_section)
4753 && ! link_info.relocatable
4755 && strcmp (os->region->name_list.name,
4756 DEFAULT_MEMORY_REGION) == 0
4757 && lang_memory_region_list != NULL
4758 && (strcmp (lang_memory_region_list->name_list.name,
4759 DEFAULT_MEMORY_REGION) != 0
4760 || lang_memory_region_list->next != NULL)
4761 && expld.phase != lang_mark_phase_enum)
4763 /* By default this is an error rather than just a
4764 warning because if we allocate the section to the
4765 default memory region we can end up creating an
4766 excessively large binary, or even seg faulting when
4767 attempting to perform a negative seek. See
4768 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4769 for an example of this. This behaviour can be
4770 overridden by the using the --no-check-sections
4772 if (command_line.check_section_addresses)
4773 einfo (_("%P%F: error: no memory region specified"
4774 " for loadable section `%s'\n"),
4775 bfd_get_section_name (link_info.output_bfd,
4778 einfo (_("%P: warning: no memory region specified"
4779 " for loadable section `%s'\n"),
4780 bfd_get_section_name (link_info.output_bfd,
4784 newdot = os->region->current;
4785 align = os->bfd_section->alignment_power;
4788 align = os->section_alignment;
4790 /* Align to what the section needs. */
4793 bfd_vma savedot = newdot;
4794 newdot = align_power (newdot, align);
4796 if (newdot != savedot
4797 && (config.warn_section_align
4798 || os->addr_tree != NULL)
4799 && expld.phase != lang_mark_phase_enum)
4800 einfo (_("%P: warning: changing start of section"
4801 " %s by %lu bytes\n"),
4802 os->name, (unsigned long) (newdot - savedot));
4805 bfd_set_section_vma (0, os->bfd_section, newdot);
4807 os->bfd_section->output_offset = 0;
4810 lang_size_sections_1 (os->children.head, os, &os->children.head,
4811 os->fill, newdot, relax, check_regions);
4813 os->processed_vma = TRUE;
4815 if (bfd_is_abs_section (os->bfd_section) || os->ignored)
4816 /* Except for some special linker created sections,
4817 no output section should change from zero size
4818 after strip_excluded_output_sections. A non-zero
4819 size on an ignored section indicates that some
4820 input section was not sized early enough. */
4821 ASSERT (os->bfd_section->size == 0);
4824 dot = os->bfd_section->vma;
4826 /* Put the section within the requested block size, or
4827 align at the block boundary. */
4829 + TO_ADDR (os->bfd_section->size)
4830 + os->block_value - 1)
4831 & - (bfd_vma) os->block_value);
4833 os->bfd_section->size = TO_SIZE (after - os->bfd_section->vma);
4836 /* Set section lma. */
4839 r = lang_memory_region_lookup (DEFAULT_MEMORY_REGION, FALSE);
4843 bfd_vma lma = exp_get_abs_int (os->load_base, 0, "load base");
4844 os->bfd_section->lma = lma;
4846 else if (os->lma_region != NULL)
4848 bfd_vma lma = os->lma_region->current;
4850 if (os->section_alignment != -1)
4851 lma = align_power (lma, os->section_alignment);
4852 os->bfd_section->lma = lma;
4854 else if (r->last_os != NULL
4855 && (os->bfd_section->flags & SEC_ALLOC) != 0)
4860 last = r->last_os->output_section_statement.bfd_section;
4862 /* A backwards move of dot should be accompanied by
4863 an explicit assignment to the section LMA (ie.
4864 os->load_base set) because backwards moves can
4865 create overlapping LMAs. */
4867 && os->bfd_section->size != 0
4868 && dot + os->bfd_section->size <= last->vma)
4870 /* If dot moved backwards then leave lma equal to
4871 vma. This is the old default lma, which might
4872 just happen to work when the backwards move is
4873 sufficiently large. Nag if this changes anything,
4874 so people can fix their linker scripts. */
4876 if (last->vma != last->lma)
4877 einfo (_("%P: warning: dot moved backwards before `%s'\n"),
4882 /* If this is an overlay, set the current lma to that
4883 at the end of the previous section. */
4884 if (os->sectype == overlay_section)
4885 lma = last->lma + last->size;
4887 /* Otherwise, keep the same lma to vma relationship
4888 as the previous section. */
4890 lma = dot + last->lma - last->vma;
4892 if (os->section_alignment != -1)
4893 lma = align_power (lma, os->section_alignment);
4894 os->bfd_section->lma = lma;
4897 os->processed_lma = TRUE;
4899 if (bfd_is_abs_section (os->bfd_section) || os->ignored)
4902 /* Keep track of normal sections using the default
4903 lma region. We use this to set the lma for
4904 following sections. Overlays or other linker
4905 script assignment to lma might mean that the
4906 default lma == vma is incorrect.
4907 To avoid warnings about dot moving backwards when using
4908 -Ttext, don't start tracking sections until we find one
4909 of non-zero size or with lma set differently to vma. */
4910 if (((os->bfd_section->flags & SEC_HAS_CONTENTS) != 0
4911 || (os->bfd_section->flags & SEC_THREAD_LOCAL) == 0)
4912 && (os->bfd_section->flags & SEC_ALLOC) != 0
4913 && (os->bfd_section->size != 0
4914 || (r->last_os == NULL
4915 && os->bfd_section->vma != os->bfd_section->lma)
4916 || (r->last_os != NULL
4917 && dot >= (r->last_os->output_section_statement
4918 .bfd_section->vma)))
4919 && os->lma_region == NULL
4920 && !link_info.relocatable)
4923 /* .tbss sections effectively have zero size. */
4924 if ((os->bfd_section->flags & SEC_HAS_CONTENTS) != 0
4925 || (os->bfd_section->flags & SEC_THREAD_LOCAL) == 0
4926 || link_info.relocatable)
4927 dot += TO_ADDR (os->bfd_section->size);
4929 if (os->update_dot_tree != 0)
4930 exp_fold_tree (os->update_dot_tree, bfd_abs_section_ptr, &dot);
4932 /* Update dot in the region ?
4933 We only do this if the section is going to be allocated,
4934 since unallocated sections do not contribute to the region's
4935 overall size in memory.
4937 If the SEC_NEVER_LOAD bit is not set, it will affect the
4938 addresses of sections after it. We have to update
4940 if (os->region != NULL
4941 && ((os->bfd_section->flags & SEC_NEVER_LOAD) == 0
4942 || (os->bfd_section->flags & (SEC_ALLOC | SEC_LOAD))))
4944 os->region->current = dot;
4947 /* Make sure the new address is within the region. */
4948 os_region_check (os, os->region, os->addr_tree,
4949 os->bfd_section->vma);
4951 if (os->lma_region != NULL && os->lma_region != os->region
4952 && (os->bfd_section->flags & SEC_LOAD))
4954 os->lma_region->current
4955 = os->bfd_section->lma + TO_ADDR (os->bfd_section->size);
4958 os_region_check (os, os->lma_region, NULL,
4959 os->bfd_section->lma);
4965 case lang_constructors_statement_enum:
4966 dot = lang_size_sections_1 (constructor_list.head,
4967 output_section_statement,
4968 &s->wild_statement.children.head,
4969 fill, dot, relax, check_regions);
4972 case lang_data_statement_enum:
4974 unsigned int size = 0;
4976 s->data_statement.output_offset =
4977 dot - output_section_statement->bfd_section->vma;
4978 s->data_statement.output_section =
4979 output_section_statement->bfd_section;
4981 /* We might refer to provided symbols in the expression, and
4982 need to mark them as needed. */
4983 exp_fold_tree (s->data_statement.exp, bfd_abs_section_ptr, &dot);
4985 switch (s->data_statement.type)
5003 if (size < TO_SIZE ((unsigned) 1))
5004 size = TO_SIZE ((unsigned) 1);
5005 dot += TO_ADDR (size);
5006 output_section_statement->bfd_section->size += size;
5010 case lang_reloc_statement_enum:
5014 s->reloc_statement.output_offset =
5015 dot - output_section_statement->bfd_section->vma;
5016 s->reloc_statement.output_section =
5017 output_section_statement->bfd_section;
5018 size = bfd_get_reloc_size (s->reloc_statement.howto);
5019 dot += TO_ADDR (size);
5020 output_section_statement->bfd_section->size += size;
5024 case lang_wild_statement_enum:
5025 dot = lang_size_sections_1 (s->wild_statement.children.head,
5026 output_section_statement,
5027 &s->wild_statement.children.head,
5028 fill, dot, relax, check_regions);
5031 case lang_object_symbols_statement_enum:
5032 link_info.create_object_symbols_section =
5033 output_section_statement->bfd_section;
5036 case lang_output_statement_enum:
5037 case lang_target_statement_enum:
5040 case lang_input_section_enum:
5044 i = (*prev)->input_section.section;
5049 if (! bfd_relax_section (i->owner, i, &link_info, &again))
5050 einfo (_("%P%F: can't relax section: %E\n"));
5054 dot = size_input_section (prev, output_section_statement,
5055 output_section_statement->fill, dot);
5059 case lang_input_statement_enum:
5062 case lang_fill_statement_enum:
5063 s->fill_statement.output_section =
5064 output_section_statement->bfd_section;
5066 fill = s->fill_statement.fill;
5069 case lang_assignment_statement_enum:
5071 bfd_vma newdot = dot;
5072 etree_type *tree = s->assignment_statement.exp;
5074 expld.dataseg.relro = exp_dataseg_relro_none;
5076 exp_fold_tree (tree,
5077 output_section_statement->bfd_section,
5080 if (expld.dataseg.relro == exp_dataseg_relro_start)
5082 if (!expld.dataseg.relro_start_stat)
5083 expld.dataseg.relro_start_stat = s;
5086 ASSERT (expld.dataseg.relro_start_stat == s);
5089 else if (expld.dataseg.relro == exp_dataseg_relro_end)
5091 if (!expld.dataseg.relro_end_stat)
5092 expld.dataseg.relro_end_stat = s;
5095 ASSERT (expld.dataseg.relro_end_stat == s);
5098 expld.dataseg.relro = exp_dataseg_relro_none;
5100 /* This symbol is relative to this section. */
5101 if ((tree->type.node_class == etree_provided
5102 || tree->type.node_class == etree_assign)
5103 && (tree->assign.dst [0] != '.'
5104 || tree->assign.dst [1] != '\0'))
5105 output_section_statement->section_relative_symbol = 1;
5107 if (!output_section_statement->ignored)
5109 if (output_section_statement == abs_output_section)
5111 /* If we don't have an output section, then just adjust
5112 the default memory address. */
5113 lang_memory_region_lookup (DEFAULT_MEMORY_REGION,
5114 FALSE)->current = newdot;
5116 else if (newdot != dot)
5118 /* Insert a pad after this statement. We can't
5119 put the pad before when relaxing, in case the
5120 assignment references dot. */
5121 insert_pad (&s->header.next, fill, TO_SIZE (newdot - dot),
5122 output_section_statement->bfd_section, dot);
5124 /* Don't neuter the pad below when relaxing. */
5127 /* If dot is advanced, this implies that the section
5128 should have space allocated to it, unless the
5129 user has explicitly stated that the section
5130 should never be loaded. */
5131 if (!(output_section_statement->flags & SEC_NEVER_LOAD))
5132 output_section_statement->bfd_section->flags |= SEC_ALLOC;
5139 case lang_padding_statement_enum:
5140 /* If this is the first time lang_size_sections is called,
5141 we won't have any padding statements. If this is the
5142 second or later passes when relaxing, we should allow
5143 padding to shrink. If padding is needed on this pass, it
5144 will be added back in. */
5145 s->padding_statement.size = 0;
5147 /* Make sure output_offset is valid. If relaxation shrinks
5148 the section and this pad isn't needed, it's possible to
5149 have output_offset larger than the final size of the
5150 section. bfd_set_section_contents will complain even for
5151 a pad size of zero. */
5152 s->padding_statement.output_offset
5153 = dot - output_section_statement->bfd_section->vma;
5156 case lang_group_statement_enum:
5157 dot = lang_size_sections_1 (s->group_statement.children.head,
5158 output_section_statement,
5159 &s->group_statement.children.head,
5160 fill, dot, relax, check_regions);
5163 case lang_insert_statement_enum:
5166 /* We can only get here when relaxing is turned on. */
5167 case lang_address_statement_enum:
5174 prev = &s->header.next;
5179 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
5180 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
5181 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
5182 segments. We are allowed an opportunity to override this decision. */
5185 ldlang_override_segment_assignment (struct bfd_link_info * info ATTRIBUTE_UNUSED,
5186 bfd * abfd ATTRIBUTE_UNUSED,
5187 asection * current_section,
5188 asection * previous_section,
5189 bfd_boolean new_segment)
5191 lang_output_section_statement_type * cur;
5192 lang_output_section_statement_type * prev;
5194 /* The checks below are only necessary when the BFD library has decided
5195 that the two sections ought to be placed into the same segment. */
5199 /* Paranoia checks. */
5200 if (current_section == NULL || previous_section == NULL)
5203 /* Find the memory regions associated with the two sections.
5204 We call lang_output_section_find() here rather than scanning the list
5205 of output sections looking for a matching section pointer because if
5206 we have a large number of sections then a hash lookup is faster. */
5207 cur = lang_output_section_find (current_section->name);
5208 prev = lang_output_section_find (previous_section->name);
5210 /* More paranoia. */
5211 if (cur == NULL || prev == NULL)
5214 /* If the regions are different then force the sections to live in
5215 different segments. See the email thread starting at the following
5216 URL for the reasons why this is necessary:
5217 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
5218 return cur->region != prev->region;
5222 one_lang_size_sections_pass (bfd_boolean *relax, bfd_boolean check_regions)
5224 lang_statement_iteration++;
5225 lang_size_sections_1 (statement_list.head, abs_output_section,
5226 &statement_list.head, 0, 0, relax, check_regions);
5230 lang_size_sections (bfd_boolean *relax, bfd_boolean check_regions)
5232 expld.phase = lang_allocating_phase_enum;
5233 expld.dataseg.phase = exp_dataseg_none;
5235 one_lang_size_sections_pass (relax, check_regions);
5236 if (expld.dataseg.phase == exp_dataseg_end_seen
5237 && link_info.relro && expld.dataseg.relro_end)
5239 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
5240 to put expld.dataseg.relro on a (common) page boundary. */
5241 bfd_vma min_base, old_base, relro_end, maxpage;
5243 expld.dataseg.phase = exp_dataseg_relro_adjust;
5244 maxpage = expld.dataseg.maxpagesize;
5245 /* MIN_BASE is the absolute minimum address we are allowed to start the
5246 read-write segment (byte before will be mapped read-only). */
5247 min_base = (expld.dataseg.min_base + maxpage - 1) & ~(maxpage - 1);
5248 /* OLD_BASE is the address for a feasible minimum address which will
5249 still not cause a data overlap inside MAXPAGE causing file offset skip
5251 old_base = expld.dataseg.base;
5252 expld.dataseg.base += (-expld.dataseg.relro_end
5253 & (expld.dataseg.pagesize - 1));
5254 /* Compute the expected PT_GNU_RELRO segment end. */
5255 relro_end = ((expld.dataseg.relro_end + expld.dataseg.pagesize - 1)
5256 & ~(expld.dataseg.pagesize - 1));
5257 if (min_base + maxpage < expld.dataseg.base)
5259 expld.dataseg.base -= maxpage;
5260 relro_end -= maxpage;
5262 lang_reset_memory_regions ();
5263 one_lang_size_sections_pass (relax, check_regions);
5264 if (expld.dataseg.relro_end > relro_end)
5266 /* The alignment of sections between DATA_SEGMENT_ALIGN
5267 and DATA_SEGMENT_RELRO_END caused huge padding to be
5268 inserted at DATA_SEGMENT_RELRO_END. Try to start a bit lower so
5269 that the section alignments will fit in. */
5271 unsigned int max_alignment_power = 0;
5273 /* Find maximum alignment power of sections between
5274 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
5275 for (sec = link_info.output_bfd->sections; sec; sec = sec->next)
5276 if (sec->vma >= expld.dataseg.base
5277 && sec->vma < expld.dataseg.relro_end
5278 && sec->alignment_power > max_alignment_power)
5279 max_alignment_power = sec->alignment_power;
5281 if (((bfd_vma) 1 << max_alignment_power) < expld.dataseg.pagesize)
5283 if (expld.dataseg.base - (1 << max_alignment_power) < old_base)
5284 expld.dataseg.base += expld.dataseg.pagesize;
5285 expld.dataseg.base -= (1 << max_alignment_power);
5286 lang_reset_memory_regions ();
5287 one_lang_size_sections_pass (relax, check_regions);
5290 link_info.relro_start = expld.dataseg.base;
5291 link_info.relro_end = expld.dataseg.relro_end;
5293 else if (expld.dataseg.phase == exp_dataseg_end_seen)
5295 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
5296 a page could be saved in the data segment. */
5297 bfd_vma first, last;
5299 first = -expld.dataseg.base & (expld.dataseg.pagesize - 1);
5300 last = expld.dataseg.end & (expld.dataseg.pagesize - 1);
5302 && ((expld.dataseg.base & ~(expld.dataseg.pagesize - 1))
5303 != (expld.dataseg.end & ~(expld.dataseg.pagesize - 1)))
5304 && first + last <= expld.dataseg.pagesize)
5306 expld.dataseg.phase = exp_dataseg_adjust;
5307 lang_reset_memory_regions ();
5308 one_lang_size_sections_pass (relax, check_regions);
5312 expld.phase = lang_final_phase_enum;
5315 /* Worker function for lang_do_assignments. Recursiveness goes here. */
5318 lang_do_assignments_1 (lang_statement_union_type *s,
5319 lang_output_section_statement_type *current_os,
5323 for (; s != NULL; s = s->header.next)
5325 switch (s->header.type)
5327 case lang_constructors_statement_enum:
5328 dot = lang_do_assignments_1 (constructor_list.head,
5329 current_os, fill, dot);
5332 case lang_output_section_statement_enum:
5334 lang_output_section_statement_type *os;
5336 os = &(s->output_section_statement);
5337 if (os->bfd_section != NULL && !os->ignored)
5339 dot = os->bfd_section->vma;
5341 lang_do_assignments_1 (os->children.head, os, os->fill, dot);
5343 /* .tbss sections effectively have zero size. */
5344 if ((os->bfd_section->flags & SEC_HAS_CONTENTS) != 0
5345 || (os->bfd_section->flags & SEC_THREAD_LOCAL) == 0
5346 || link_info.relocatable)
5347 dot += TO_ADDR (os->bfd_section->size);
5349 if (os->update_dot_tree != NULL)
5350 exp_fold_tree (os->update_dot_tree, bfd_abs_section_ptr, &dot);
5355 case lang_wild_statement_enum:
5357 dot = lang_do_assignments_1 (s->wild_statement.children.head,
5358 current_os, fill, dot);
5361 case lang_object_symbols_statement_enum:
5362 case lang_output_statement_enum:
5363 case lang_target_statement_enum:
5366 case lang_data_statement_enum:
5367 exp_fold_tree (s->data_statement.exp, bfd_abs_section_ptr, &dot);
5368 if (expld.result.valid_p)
5369 s->data_statement.value = (expld.result.value
5370 + expld.result.section->vma);
5372 einfo (_("%F%P: invalid data statement\n"));
5375 switch (s->data_statement.type)
5393 if (size < TO_SIZE ((unsigned) 1))
5394 size = TO_SIZE ((unsigned) 1);
5395 dot += TO_ADDR (size);
5399 case lang_reloc_statement_enum:
5400 exp_fold_tree (s->reloc_statement.addend_exp,
5401 bfd_abs_section_ptr, &dot);
5402 if (expld.result.valid_p)
5403 s->reloc_statement.addend_value = expld.result.value;
5405 einfo (_("%F%P: invalid reloc statement\n"));
5406 dot += TO_ADDR (bfd_get_reloc_size (s->reloc_statement.howto));
5409 case lang_input_section_enum:
5411 asection *in = s->input_section.section;
5413 if ((in->flags & SEC_EXCLUDE) == 0)
5414 dot += TO_ADDR (in->size);
5418 case lang_input_statement_enum:
5421 case lang_fill_statement_enum:
5422 fill = s->fill_statement.fill;
5425 case lang_assignment_statement_enum:
5426 exp_fold_tree (s->assignment_statement.exp,
5427 current_os->bfd_section,
5431 case lang_padding_statement_enum:
5432 dot += TO_ADDR (s->padding_statement.size);
5435 case lang_group_statement_enum:
5436 dot = lang_do_assignments_1 (s->group_statement.children.head,
5437 current_os, fill, dot);
5440 case lang_insert_statement_enum:
5443 case lang_address_statement_enum:
5455 lang_do_assignments (void)
5457 lang_statement_iteration++;
5458 lang_do_assignments_1 (statement_list.head, abs_output_section, NULL, 0);
5461 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
5462 operator .startof. (section_name), it produces an undefined symbol
5463 .startof.section_name. Similarly, when it sees
5464 .sizeof. (section_name), it produces an undefined symbol
5465 .sizeof.section_name. For all the output sections, we look for
5466 such symbols, and set them to the correct value. */
5469 lang_set_startof (void)
5473 if (link_info.relocatable)
5476 for (s = link_info.output_bfd->sections; s != NULL; s = s->next)
5478 const char *secname;
5480 struct bfd_link_hash_entry *h;
5482 secname = bfd_get_section_name (link_info.output_bfd, s);
5483 buf = (char *) xmalloc (10 + strlen (secname));
5485 sprintf (buf, ".startof.%s", secname);
5486 h = bfd_link_hash_lookup (link_info.hash, buf, FALSE, FALSE, TRUE);
5487 if (h != NULL && h->type == bfd_link_hash_undefined)
5489 h->type = bfd_link_hash_defined;
5490 h->u.def.value = bfd_get_section_vma (link_info.output_bfd, s);
5491 h->u.def.section = bfd_abs_section_ptr;
5494 sprintf (buf, ".sizeof.%s", secname);
5495 h = bfd_link_hash_lookup (link_info.hash, buf, FALSE, FALSE, TRUE);
5496 if (h != NULL && h->type == bfd_link_hash_undefined)
5498 h->type = bfd_link_hash_defined;
5499 h->u.def.value = TO_ADDR (s->size);
5500 h->u.def.section = bfd_abs_section_ptr;
5510 struct bfd_link_hash_entry *h;
5513 if ((link_info.relocatable && !link_info.gc_sections)
5514 || (link_info.shared && !link_info.executable))
5515 warn = entry_from_cmdline;
5519 /* Force the user to specify a root when generating a relocatable with
5521 if (link_info.gc_sections && link_info.relocatable
5522 && (entry_symbol.name == NULL
5523 && ldlang_undef_chain_list_head == NULL))
5524 einfo (_("%P%F: gc-sections requires either an entry or "
5525 "an undefined symbol\n"));
5527 if (entry_symbol.name == NULL)
5529 /* No entry has been specified. Look for the default entry, but
5530 don't warn if we don't find it. */
5531 entry_symbol.name = entry_symbol_default;
5535 h = bfd_link_hash_lookup (link_info.hash, entry_symbol.name,
5536 FALSE, FALSE, TRUE);
5538 && (h->type == bfd_link_hash_defined
5539 || h->type == bfd_link_hash_defweak)
5540 && h->u.def.section->output_section != NULL)
5544 val = (h->u.def.value
5545 + bfd_get_section_vma (link_info.output_bfd,
5546 h->u.def.section->output_section)
5547 + h->u.def.section->output_offset);
5548 if (! bfd_set_start_address (link_info.output_bfd, val))
5549 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol.name);
5556 /* We couldn't find the entry symbol. Try parsing it as a
5558 val = bfd_scan_vma (entry_symbol.name, &send, 0);
5561 if (! bfd_set_start_address (link_info.output_bfd, val))
5562 einfo (_("%P%F: can't set start address\n"));
5568 /* Can't find the entry symbol, and it's not a number. Use
5569 the first address in the text section. */
5570 ts = bfd_get_section_by_name (link_info.output_bfd, entry_section);
5574 einfo (_("%P: warning: cannot find entry symbol %s;"
5575 " defaulting to %V\n"),
5577 bfd_get_section_vma (link_info.output_bfd, ts));
5578 if (!(bfd_set_start_address
5579 (link_info.output_bfd,
5580 bfd_get_section_vma (link_info.output_bfd, ts))))
5581 einfo (_("%P%F: can't set start address\n"));
5586 einfo (_("%P: warning: cannot find entry symbol %s;"
5587 " not setting start address\n"),
5593 /* Don't bfd_hash_table_free (&lang_definedness_table);
5594 map file output may result in a call of lang_track_definedness. */
5597 /* This is a small function used when we want to ignore errors from
5601 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED, ...)
5603 /* Don't do anything. */
5606 /* Check that the architecture of all the input files is compatible
5607 with the output file. Also call the backend to let it do any
5608 other checking that is needed. */
5613 lang_statement_union_type *file;
5615 const bfd_arch_info_type *compatible;
5617 for (file = file_chain.head; file != NULL; file = file->input_statement.next)
5619 input_bfd = file->input_statement.the_bfd;
5621 = bfd_arch_get_compatible (input_bfd, link_info.output_bfd,
5622 command_line.accept_unknown_input_arch);
5624 /* In general it is not possible to perform a relocatable
5625 link between differing object formats when the input
5626 file has relocations, because the relocations in the
5627 input format may not have equivalent representations in
5628 the output format (and besides BFD does not translate
5629 relocs for other link purposes than a final link). */
5630 if ((link_info.relocatable || link_info.emitrelocations)
5631 && (compatible == NULL
5632 || (bfd_get_flavour (input_bfd)
5633 != bfd_get_flavour (link_info.output_bfd)))
5634 && (bfd_get_file_flags (input_bfd) & HAS_RELOC) != 0)
5636 einfo (_("%P%F: Relocatable linking with relocations from"
5637 " format %s (%B) to format %s (%B) is not supported\n"),
5638 bfd_get_target (input_bfd), input_bfd,
5639 bfd_get_target (link_info.output_bfd), link_info.output_bfd);
5640 /* einfo with %F exits. */
5643 if (compatible == NULL)
5645 if (command_line.warn_mismatch)
5646 einfo (_("%P%X: %s architecture of input file `%B'"
5647 " is incompatible with %s output\n"),
5648 bfd_printable_name (input_bfd), input_bfd,
5649 bfd_printable_name (link_info.output_bfd));
5651 else if (bfd_count_sections (input_bfd))
5653 /* If the input bfd has no contents, it shouldn't set the
5654 private data of the output bfd. */
5656 bfd_error_handler_type pfn = NULL;
5658 /* If we aren't supposed to warn about mismatched input
5659 files, temporarily set the BFD error handler to a
5660 function which will do nothing. We still want to call
5661 bfd_merge_private_bfd_data, since it may set up
5662 information which is needed in the output file. */
5663 if (! command_line.warn_mismatch)
5664 pfn = bfd_set_error_handler (ignore_bfd_errors);
5665 if (! bfd_merge_private_bfd_data (input_bfd, link_info.output_bfd))
5667 if (command_line.warn_mismatch)
5668 einfo (_("%P%X: failed to merge target specific data"
5669 " of file %B\n"), input_bfd);
5671 if (! command_line.warn_mismatch)
5672 bfd_set_error_handler (pfn);
5677 /* Look through all the global common symbols and attach them to the
5678 correct section. The -sort-common command line switch may be used
5679 to roughly sort the entries by alignment. */
5684 if (command_line.inhibit_common_definition)
5686 if (link_info.relocatable
5687 && ! command_line.force_common_definition)
5690 if (! config.sort_common)
5691 bfd_link_hash_traverse (link_info.hash, lang_one_common, NULL);
5696 if (config.sort_common == sort_descending)
5698 for (power = 4; power > 0; power--)
5699 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
5702 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
5706 for (power = 0; power <= 4; power++)
5707 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
5710 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
5715 /* Place one common symbol in the correct section. */
5718 lang_one_common (struct bfd_link_hash_entry *h, void *info)
5720 unsigned int power_of_two;
5724 if (h->type != bfd_link_hash_common)
5728 power_of_two = h->u.c.p->alignment_power;
5730 if (config.sort_common == sort_descending
5731 && power_of_two < *(unsigned int *) info)
5733 else if (config.sort_common == sort_ascending
5734 && power_of_two > *(unsigned int *) info)
5737 section = h->u.c.p->section;
5738 if (!bfd_define_common_symbol (link_info.output_bfd, &link_info, h))
5739 einfo (_("%P%F: Could not define common symbol `%T': %E\n"),
5742 if (config.map_file != NULL)
5744 static bfd_boolean header_printed;
5749 if (! header_printed)
5751 minfo (_("\nAllocating common symbols\n"));
5752 minfo (_("Common symbol size file\n\n"));
5753 header_printed = TRUE;
5756 name = bfd_demangle (link_info.output_bfd, h->root.string,
5757 DMGL_ANSI | DMGL_PARAMS);
5760 minfo ("%s", h->root.string);
5761 len = strlen (h->root.string);
5766 len = strlen (name);
5782 if (size <= 0xffffffff)
5783 sprintf (buf, "%lx", (unsigned long) size);
5785 sprintf_vma (buf, size);
5795 minfo ("%B\n", section->owner);
5801 /* Run through the input files and ensure that every input section has
5802 somewhere to go. If one is found without a destination then create
5803 an input request and place it into the statement tree. */
5806 lang_place_orphans (void)
5808 LANG_FOR_EACH_INPUT_STATEMENT (file)
5812 for (s = file->the_bfd->sections; s != NULL; s = s->next)
5814 if (s->output_section == NULL)
5816 /* This section of the file is not attached, root
5817 around for a sensible place for it to go. */
5819 if (file->just_syms_flag)
5820 bfd_link_just_syms (file->the_bfd, s, &link_info);
5821 else if ((s->flags & SEC_EXCLUDE) != 0)
5822 s->output_section = bfd_abs_section_ptr;
5823 else if (strcmp (s->name, "COMMON") == 0)
5825 /* This is a lonely common section which must have
5826 come from an archive. We attach to the section
5827 with the wildcard. */
5828 if (! link_info.relocatable
5829 || command_line.force_common_definition)
5831 if (default_common_section == NULL)
5832 default_common_section
5833 = lang_output_section_statement_lookup (".bss", 0,
5835 lang_add_section (&default_common_section->children, s,
5836 default_common_section);
5841 const char *name = s->name;
5844 if (config.unique_orphan_sections || unique_section_p (s))
5845 constraint = SPECIAL;
5847 if (!ldemul_place_orphan (s, name, constraint))
5849 lang_output_section_statement_type *os;
5850 os = lang_output_section_statement_lookup (name,
5853 lang_add_section (&os->children, s, os);
5862 lang_set_flags (lang_memory_region_type *ptr, const char *flags, int invert)
5864 flagword *ptr_flags;
5866 ptr_flags = invert ? &ptr->not_flags : &ptr->flags;
5872 *ptr_flags |= SEC_ALLOC;
5876 *ptr_flags |= SEC_READONLY;
5880 *ptr_flags |= SEC_DATA;
5884 *ptr_flags |= SEC_CODE;
5889 *ptr_flags |= SEC_LOAD;
5893 einfo (_("%P%F: invalid syntax in flags\n"));
5900 /* Call a function on each input file. This function will be called
5901 on an archive, but not on the elements. */
5904 lang_for_each_input_file (void (*func) (lang_input_statement_type *))
5906 lang_input_statement_type *f;
5908 for (f = (lang_input_statement_type *) input_file_chain.head;
5910 f = (lang_input_statement_type *) f->next_real_file)
5914 /* Call a function on each file. The function will be called on all
5915 the elements of an archive which are included in the link, but will
5916 not be called on the archive file itself. */
5919 lang_for_each_file (void (*func) (lang_input_statement_type *))
5921 LANG_FOR_EACH_INPUT_STATEMENT (f)
5928 ldlang_add_file (lang_input_statement_type *entry)
5930 lang_statement_append (&file_chain,
5931 (lang_statement_union_type *) entry,
5934 /* The BFD linker needs to have a list of all input BFDs involved in
5936 ASSERT (entry->the_bfd->link_next == NULL);
5937 ASSERT (entry->the_bfd != link_info.output_bfd);
5939 *link_info.input_bfds_tail = entry->the_bfd;
5940 link_info.input_bfds_tail = &entry->the_bfd->link_next;
5941 entry->the_bfd->usrdata = entry;
5942 bfd_set_gp_size (entry->the_bfd, g_switch_value);
5944 /* Look through the sections and check for any which should not be
5945 included in the link. We need to do this now, so that we can
5946 notice when the backend linker tries to report multiple
5947 definition errors for symbols which are in sections we aren't
5948 going to link. FIXME: It might be better to entirely ignore
5949 symbols which are defined in sections which are going to be
5950 discarded. This would require modifying the backend linker for
5951 each backend which might set the SEC_LINK_ONCE flag. If we do
5952 this, we should probably handle SEC_EXCLUDE in the same way. */
5954 bfd_map_over_sections (entry->the_bfd, section_already_linked, entry);
5958 lang_add_output (const char *name, int from_script)
5960 /* Make -o on command line override OUTPUT in script. */
5961 if (!had_output_filename || !from_script)
5963 output_filename = name;
5964 had_output_filename = TRUE;
5968 static lang_output_section_statement_type *current_section;
5979 for (l = 0; l < 32; l++)
5981 if (i >= (unsigned int) x)
5989 lang_output_section_statement_type *
5990 lang_enter_output_section_statement (const char *output_section_statement_name,
5991 etree_type *address_exp,
5992 enum section_type sectype,
5994 etree_type *subalign,
5998 lang_output_section_statement_type *os;
6000 os = lang_output_section_statement_lookup (output_section_statement_name,
6002 current_section = os;
6004 if (os->addr_tree == NULL)
6006 os->addr_tree = address_exp;
6008 os->sectype = sectype;
6009 if (sectype != noload_section)
6010 os->flags = SEC_NO_FLAGS;
6012 os->flags = SEC_NEVER_LOAD;
6013 os->block_value = 1;
6015 /* Make next things chain into subchain of this. */
6016 push_stat_ptr (&os->children);
6018 os->subsection_alignment =
6019 topower (exp_get_value_int (subalign, -1, "subsection alignment"));
6020 os->section_alignment =
6021 topower (exp_get_value_int (align, -1, "section alignment"));
6023 os->load_base = ebase;
6030 lang_output_statement_type *new_stmt;
6032 new_stmt = new_stat (lang_output_statement, stat_ptr);
6033 new_stmt->name = output_filename;
6037 /* Reset the current counters in the regions. */
6040 lang_reset_memory_regions (void)
6042 lang_memory_region_type *p = lang_memory_region_list;
6044 lang_output_section_statement_type *os;
6046 for (p = lang_memory_region_list; p != NULL; p = p->next)
6048 p->current = p->origin;
6052 for (os = &lang_output_section_statement.head->output_section_statement;
6056 os->processed_vma = FALSE;
6057 os->processed_lma = FALSE;
6060 for (o = link_info.output_bfd->sections; o != NULL; o = o->next)
6062 /* Save the last size for possible use by bfd_relax_section. */
6063 o->rawsize = o->size;
6068 /* Worker for lang_gc_sections_1. */
6071 gc_section_callback (lang_wild_statement_type *ptr,
6072 struct wildcard_list *sec ATTRIBUTE_UNUSED,
6074 lang_input_statement_type *file ATTRIBUTE_UNUSED,
6075 void *data ATTRIBUTE_UNUSED)
6077 /* If the wild pattern was marked KEEP, the member sections
6078 should be as well. */
6079 if (ptr->keep_sections)
6080 section->flags |= SEC_KEEP;
6083 /* Iterate over sections marking them against GC. */
6086 lang_gc_sections_1 (lang_statement_union_type *s)
6088 for (; s != NULL; s = s->header.next)
6090 switch (s->header.type)
6092 case lang_wild_statement_enum:
6093 walk_wild (&s->wild_statement, gc_section_callback, NULL);
6095 case lang_constructors_statement_enum:
6096 lang_gc_sections_1 (constructor_list.head);
6098 case lang_output_section_statement_enum:
6099 lang_gc_sections_1 (s->output_section_statement.children.head);
6101 case lang_group_statement_enum:
6102 lang_gc_sections_1 (s->group_statement.children.head);
6111 lang_gc_sections (void)
6113 /* Keep all sections so marked in the link script. */
6115 lang_gc_sections_1 (statement_list.head);
6117 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
6118 the special case of debug info. (See bfd/stabs.c)
6119 Twiddle the flag here, to simplify later linker code. */
6120 if (link_info.relocatable)
6122 LANG_FOR_EACH_INPUT_STATEMENT (f)
6125 for (sec = f->the_bfd->sections; sec != NULL; sec = sec->next)
6126 if ((sec->flags & SEC_DEBUGGING) == 0)
6127 sec->flags &= ~SEC_EXCLUDE;
6131 if (link_info.gc_sections)
6132 bfd_gc_sections (link_info.output_bfd, &link_info);
6135 /* Worker for lang_find_relro_sections_1. */
6138 find_relro_section_callback (lang_wild_statement_type *ptr ATTRIBUTE_UNUSED,
6139 struct wildcard_list *sec ATTRIBUTE_UNUSED,
6141 lang_input_statement_type *file ATTRIBUTE_UNUSED,
6144 /* Discarded, excluded and ignored sections effectively have zero
6146 if (section->output_section != NULL
6147 && section->output_section->owner == link_info.output_bfd
6148 && (section->output_section->flags & SEC_EXCLUDE) == 0
6149 && !IGNORE_SECTION (section)
6150 && section->size != 0)
6152 bfd_boolean *has_relro_section = (bfd_boolean *) data;
6153 *has_relro_section = TRUE;
6157 /* Iterate over sections for relro sections. */
6160 lang_find_relro_sections_1 (lang_statement_union_type *s,
6161 bfd_boolean *has_relro_section)
6163 if (*has_relro_section)
6166 for (; s != NULL; s = s->header.next)
6168 if (s == expld.dataseg.relro_end_stat)
6171 switch (s->header.type)
6173 case lang_wild_statement_enum:
6174 walk_wild (&s->wild_statement,
6175 find_relro_section_callback,
6178 case lang_constructors_statement_enum:
6179 lang_find_relro_sections_1 (constructor_list.head,
6182 case lang_output_section_statement_enum:
6183 lang_find_relro_sections_1 (s->output_section_statement.children.head,
6186 case lang_group_statement_enum:
6187 lang_find_relro_sections_1 (s->group_statement.children.head,
6197 lang_find_relro_sections (void)
6199 bfd_boolean has_relro_section = FALSE;
6201 /* Check all sections in the link script. */
6203 lang_find_relro_sections_1 (expld.dataseg.relro_start_stat,
6204 &has_relro_section);
6206 if (!has_relro_section)
6207 link_info.relro = FALSE;
6210 /* Relax all sections until bfd_relax_section gives up. */
6213 lang_relax_sections (bfd_boolean need_layout)
6215 if (command_line.relax)
6217 /* We may need more than one relaxation pass. */
6218 int i = link_info.relax_pass;
6220 /* The backend can use it to determine the current pass. */
6221 link_info.relax_pass = 0;
6225 /* Keep relaxing until bfd_relax_section gives up. */
6226 bfd_boolean relax_again;
6228 link_info.relax_trip = -1;
6231 link_info.relax_trip++;
6233 /* Note: pe-dll.c does something like this also. If you find
6234 you need to change this code, you probably need to change
6235 pe-dll.c also. DJ */
6237 /* Do all the assignments with our current guesses as to
6239 lang_do_assignments ();
6241 /* We must do this after lang_do_assignments, because it uses
6243 lang_reset_memory_regions ();
6245 /* Perform another relax pass - this time we know where the
6246 globals are, so can make a better guess. */
6247 relax_again = FALSE;
6248 lang_size_sections (&relax_again, FALSE);
6250 while (relax_again);
6252 link_info.relax_pass++;
6259 /* Final extra sizing to report errors. */
6260 lang_do_assignments ();
6261 lang_reset_memory_regions ();
6262 lang_size_sections (NULL, TRUE);
6269 /* Finalize dynamic list. */
6270 if (link_info.dynamic_list)
6271 lang_finalize_version_expr_head (&link_info.dynamic_list->head);
6273 current_target = default_target;
6275 /* Open the output file. */
6276 lang_for_each_statement (ldlang_open_output);
6279 ldemul_create_output_section_statements ();
6281 /* Add to the hash table all undefineds on the command line. */
6282 lang_place_undefineds ();
6284 if (!bfd_section_already_linked_table_init ())
6285 einfo (_("%P%F: Failed to create hash table\n"));
6287 /* Create a bfd for each input file. */
6288 current_target = default_target;
6289 open_input_bfds (statement_list.head, FALSE);
6291 link_info.gc_sym_list = &entry_symbol;
6292 if (entry_symbol.name == NULL)
6293 link_info.gc_sym_list = ldlang_undef_chain_list_head;
6295 ldemul_after_open ();
6297 bfd_section_already_linked_table_free ();
6299 /* Make sure that we're not mixing architectures. We call this
6300 after all the input files have been opened, but before we do any
6301 other processing, so that any operations merge_private_bfd_data
6302 does on the output file will be known during the rest of the
6306 /* Handle .exports instead of a version script if we're told to do so. */
6307 if (command_line.version_exports_section)
6308 lang_do_version_exports_section ();
6310 /* Build all sets based on the information gathered from the input
6312 ldctor_build_sets ();
6314 /* Remove unreferenced sections if asked to. */
6315 lang_gc_sections ();
6317 /* Size up the common data. */
6320 /* Update wild statements. */
6321 update_wild_statements (statement_list.head);
6323 /* Run through the contours of the script and attach input sections
6324 to the correct output sections. */
6325 map_input_to_output_sections (statement_list.head, NULL, NULL);
6327 process_insert_statements ();
6329 /* Find any sections not attached explicitly and handle them. */
6330 lang_place_orphans ();
6332 if (! link_info.relocatable)
6336 /* Merge SEC_MERGE sections. This has to be done after GC of
6337 sections, so that GCed sections are not merged, but before
6338 assigning dynamic symbols, since removing whole input sections
6340 bfd_merge_sections (link_info.output_bfd, &link_info);
6342 /* Look for a text section and set the readonly attribute in it. */
6343 found = bfd_get_section_by_name (link_info.output_bfd, ".text");
6347 if (config.text_read_only)
6348 found->flags |= SEC_READONLY;
6350 found->flags &= ~SEC_READONLY;
6354 /* Do anything special before sizing sections. This is where ELF
6355 and other back-ends size dynamic sections. */
6356 ldemul_before_allocation ();
6358 /* We must record the program headers before we try to fix the
6359 section positions, since they will affect SIZEOF_HEADERS. */
6360 lang_record_phdrs ();
6362 /* Check relro sections. */
6363 if (link_info.relro && ! link_info.relocatable)
6364 lang_find_relro_sections ();
6366 /* Size up the sections. */
6367 lang_size_sections (NULL, !command_line.relax);
6369 /* See if anything special should be done now we know how big
6370 everything is. This is where relaxation is done. */
6371 ldemul_after_allocation ();
6373 /* Fix any .startof. or .sizeof. symbols. */
6374 lang_set_startof ();
6376 /* Do all the assignments, now that we know the final resting places
6377 of all the symbols. */
6379 lang_do_assignments ();
6383 /* Make sure that the section addresses make sense. */
6384 if (command_line.check_section_addresses)
6385 lang_check_section_addresses ();
6390 /* EXPORTED TO YACC */
6393 lang_add_wild (struct wildcard_spec *filespec,
6394 struct wildcard_list *section_list,
6395 bfd_boolean keep_sections)
6397 struct wildcard_list *curr, *next;
6398 lang_wild_statement_type *new_stmt;
6400 /* Reverse the list as the parser puts it back to front. */
6401 for (curr = section_list, section_list = NULL;
6403 section_list = curr, curr = next)
6405 if (curr->spec.name != NULL && strcmp (curr->spec.name, "COMMON") == 0)
6406 placed_commons = TRUE;
6409 curr->next = section_list;
6412 if (filespec != NULL && filespec->name != NULL)
6414 if (strcmp (filespec->name, "*") == 0)
6415 filespec->name = NULL;
6416 else if (! wildcardp (filespec->name))
6417 lang_has_input_file = TRUE;
6420 new_stmt = new_stat (lang_wild_statement, stat_ptr);
6421 new_stmt->filename = NULL;
6422 new_stmt->filenames_sorted = FALSE;
6423 if (filespec != NULL)
6425 new_stmt->filename = filespec->name;
6426 new_stmt->filenames_sorted = filespec->sorted == by_name;
6428 new_stmt->section_list = section_list;
6429 new_stmt->keep_sections = keep_sections;
6430 lang_list_init (&new_stmt->children);
6431 analyze_walk_wild_section_handler (new_stmt);
6435 lang_section_start (const char *name, etree_type *address,
6436 const segment_type *segment)
6438 lang_address_statement_type *ad;
6440 ad = new_stat (lang_address_statement, stat_ptr);
6441 ad->section_name = name;
6442 ad->address = address;
6443 ad->segment = segment;
6446 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
6447 because of a -e argument on the command line, or zero if this is
6448 called by ENTRY in a linker script. Command line arguments take
6452 lang_add_entry (const char *name, bfd_boolean cmdline)
6454 if (entry_symbol.name == NULL
6456 || ! entry_from_cmdline)
6458 entry_symbol.name = name;
6459 entry_from_cmdline = cmdline;
6463 /* Set the default start symbol to NAME. .em files should use this,
6464 not lang_add_entry, to override the use of "start" if neither the
6465 linker script nor the command line specifies an entry point. NAME
6466 must be permanently allocated. */
6468 lang_default_entry (const char *name)
6470 entry_symbol_default = name;
6474 lang_add_target (const char *name)
6476 lang_target_statement_type *new_stmt;
6478 new_stmt = new_stat (lang_target_statement, stat_ptr);
6479 new_stmt->target = name;
6483 lang_add_map (const char *name)
6490 map_option_f = TRUE;
6498 lang_add_fill (fill_type *fill)
6500 lang_fill_statement_type *new_stmt;
6502 new_stmt = new_stat (lang_fill_statement, stat_ptr);
6503 new_stmt->fill = fill;
6507 lang_add_data (int type, union etree_union *exp)
6509 lang_data_statement_type *new_stmt;
6511 new_stmt = new_stat (lang_data_statement, stat_ptr);
6512 new_stmt->exp = exp;
6513 new_stmt->type = type;
6516 /* Create a new reloc statement. RELOC is the BFD relocation type to
6517 generate. HOWTO is the corresponding howto structure (we could
6518 look this up, but the caller has already done so). SECTION is the
6519 section to generate a reloc against, or NAME is the name of the
6520 symbol to generate a reloc against. Exactly one of SECTION and
6521 NAME must be NULL. ADDEND is an expression for the addend. */
6524 lang_add_reloc (bfd_reloc_code_real_type reloc,
6525 reloc_howto_type *howto,
6528 union etree_union *addend)
6530 lang_reloc_statement_type *p = new_stat (lang_reloc_statement, stat_ptr);
6534 p->section = section;
6536 p->addend_exp = addend;
6538 p->addend_value = 0;
6539 p->output_section = NULL;
6540 p->output_offset = 0;
6543 lang_assignment_statement_type *
6544 lang_add_assignment (etree_type *exp)
6546 lang_assignment_statement_type *new_stmt;
6548 new_stmt = new_stat (lang_assignment_statement, stat_ptr);
6549 new_stmt->exp = exp;
6554 lang_add_attribute (enum statement_enum attribute)
6556 new_statement (attribute, sizeof (lang_statement_header_type), stat_ptr);
6560 lang_startup (const char *name)
6562 if (startup_file != NULL)
6564 einfo (_("%P%F: multiple STARTUP files\n"));
6566 first_file->filename = name;
6567 first_file->local_sym_name = name;
6568 first_file->real = TRUE;
6570 startup_file = name;
6574 lang_float (bfd_boolean maybe)
6576 lang_float_flag = maybe;
6580 /* Work out the load- and run-time regions from a script statement, and
6581 store them in *LMA_REGION and *REGION respectively.
6583 MEMSPEC is the name of the run-time region, or the value of
6584 DEFAULT_MEMORY_REGION if the statement didn't specify one.
6585 LMA_MEMSPEC is the name of the load-time region, or null if the
6586 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
6587 had an explicit load address.
6589 It is an error to specify both a load region and a load address. */
6592 lang_get_regions (lang_memory_region_type **region,
6593 lang_memory_region_type **lma_region,
6594 const char *memspec,
6595 const char *lma_memspec,
6596 bfd_boolean have_lma,
6597 bfd_boolean have_vma)
6599 *lma_region = lang_memory_region_lookup (lma_memspec, FALSE);
6601 /* If no runtime region or VMA has been specified, but the load region
6602 has been specified, then use the load region for the runtime region
6604 if (lma_memspec != NULL
6606 && strcmp (memspec, DEFAULT_MEMORY_REGION) == 0)
6607 *region = *lma_region;
6609 *region = lang_memory_region_lookup (memspec, FALSE);
6611 if (have_lma && lma_memspec != 0)
6612 einfo (_("%X%P:%S: section has both a load address and a load region\n"));
6616 lang_leave_output_section_statement (fill_type *fill, const char *memspec,
6617 lang_output_section_phdr_list *phdrs,
6618 const char *lma_memspec)
6620 lang_get_regions (¤t_section->region,
6621 ¤t_section->lma_region,
6622 memspec, lma_memspec,
6623 current_section->load_base != NULL,
6624 current_section->addr_tree != NULL);
6626 /* If this section has no load region or base, but has the same
6627 region as the previous section, then propagate the previous
6628 section's load region. */
6630 if (!current_section->lma_region && !current_section->load_base
6631 && current_section->region == current_section->prev->region)
6632 current_section->lma_region = current_section->prev->lma_region;
6634 current_section->fill = fill;
6635 current_section->phdrs = phdrs;
6639 /* Create an absolute symbol with the given name with the value of the
6640 address of first byte of the section named.
6642 If the symbol already exists, then do nothing. */
6645 lang_abs_symbol_at_beginning_of (const char *secname, const char *name)
6647 struct bfd_link_hash_entry *h;
6649 h = bfd_link_hash_lookup (link_info.hash, name, TRUE, TRUE, TRUE);
6651 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
6653 if (h->type == bfd_link_hash_new
6654 || h->type == bfd_link_hash_undefined)
6658 h->type = bfd_link_hash_defined;
6660 sec = bfd_get_section_by_name (link_info.output_bfd, secname);
6664 h->u.def.value = bfd_get_section_vma (link_info.output_bfd, sec);
6666 h->u.def.section = bfd_abs_section_ptr;
6670 /* Create an absolute symbol with the given name with the value of the
6671 address of the first byte after the end of the section named.
6673 If the symbol already exists, then do nothing. */
6676 lang_abs_symbol_at_end_of (const char *secname, const char *name)
6678 struct bfd_link_hash_entry *h;
6680 h = bfd_link_hash_lookup (link_info.hash, name, TRUE, TRUE, TRUE);
6682 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
6684 if (h->type == bfd_link_hash_new
6685 || h->type == bfd_link_hash_undefined)
6689 h->type = bfd_link_hash_defined;
6691 sec = bfd_get_section_by_name (link_info.output_bfd, secname);
6695 h->u.def.value = (bfd_get_section_vma (link_info.output_bfd, sec)
6696 + TO_ADDR (sec->size));
6698 h->u.def.section = bfd_abs_section_ptr;
6703 lang_statement_append (lang_statement_list_type *list,
6704 lang_statement_union_type *element,
6705 lang_statement_union_type **field)
6707 *(list->tail) = element;
6711 /* Set the output format type. -oformat overrides scripts. */
6714 lang_add_output_format (const char *format,
6719 if (output_target == NULL || !from_script)
6721 if (command_line.endian == ENDIAN_BIG
6724 else if (command_line.endian == ENDIAN_LITTLE
6728 output_target = format;
6733 lang_add_insert (const char *where, int is_before)
6735 lang_insert_statement_type *new_stmt;
6737 new_stmt = new_stat (lang_insert_statement, stat_ptr);
6738 new_stmt->where = where;
6739 new_stmt->is_before = is_before;
6740 saved_script_handle = previous_script_handle;
6743 /* Enter a group. This creates a new lang_group_statement, and sets
6744 stat_ptr to build new statements within the group. */
6747 lang_enter_group (void)
6749 lang_group_statement_type *g;
6751 g = new_stat (lang_group_statement, stat_ptr);
6752 lang_list_init (&g->children);
6753 push_stat_ptr (&g->children);
6756 /* Leave a group. This just resets stat_ptr to start writing to the
6757 regular list of statements again. Note that this will not work if
6758 groups can occur inside anything else which can adjust stat_ptr,
6759 but currently they can't. */
6762 lang_leave_group (void)
6767 /* Add a new program header. This is called for each entry in a PHDRS
6768 command in a linker script. */
6771 lang_new_phdr (const char *name,
6773 bfd_boolean filehdr,
6778 struct lang_phdr *n, **pp;
6781 n = (struct lang_phdr *) stat_alloc (sizeof (struct lang_phdr));
6784 n->type = exp_get_value_int (type, 0, "program header type");
6785 n->filehdr = filehdr;
6790 hdrs = n->type == 1 && (phdrs || filehdr);
6792 for (pp = &lang_phdr_list; *pp != NULL; pp = &(*pp)->next)
6795 && !((*pp)->filehdr || (*pp)->phdrs))
6797 einfo (_("%X%P:%S: PHDRS and FILEHDR are not supported when prior PT_LOAD headers lack them\n"));
6804 /* Record the program header information in the output BFD. FIXME: We
6805 should not be calling an ELF specific function here. */
6808 lang_record_phdrs (void)
6812 lang_output_section_phdr_list *last;
6813 struct lang_phdr *l;
6814 lang_output_section_statement_type *os;
6817 secs = (asection **) xmalloc (alc * sizeof (asection *));
6820 for (l = lang_phdr_list; l != NULL; l = l->next)
6827 for (os = &lang_output_section_statement.head->output_section_statement;
6831 lang_output_section_phdr_list *pl;
6833 if (os->constraint < 0)
6841 if (os->sectype == noload_section
6842 || os->bfd_section == NULL
6843 || (os->bfd_section->flags & SEC_ALLOC) == 0)
6846 /* Don't add orphans to PT_INTERP header. */
6852 lang_output_section_statement_type * tmp_os;
6854 /* If we have not run across a section with a program
6855 header assigned to it yet, then scan forwards to find
6856 one. This prevents inconsistencies in the linker's
6857 behaviour when a script has specified just a single
6858 header and there are sections in that script which are
6859 not assigned to it, and which occur before the first
6860 use of that header. See here for more details:
6861 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
6862 for (tmp_os = os; tmp_os; tmp_os = tmp_os->next)
6865 last = tmp_os->phdrs;
6869 einfo (_("%F%P: no sections assigned to phdrs\n"));
6874 if (os->bfd_section == NULL)
6877 for (; pl != NULL; pl = pl->next)
6879 if (strcmp (pl->name, l->name) == 0)
6884 secs = (asection **) xrealloc (secs,
6885 alc * sizeof (asection *));
6887 secs[c] = os->bfd_section;
6894 if (l->flags == NULL)
6897 flags = exp_get_vma (l->flags, 0, "phdr flags");
6902 at = exp_get_vma (l->at, 0, "phdr load address");
6904 if (! bfd_record_phdr (link_info.output_bfd, l->type,
6905 l->flags != NULL, flags, l->at != NULL,
6906 at, l->filehdr, l->phdrs, c, secs))
6907 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
6912 /* Make sure all the phdr assignments succeeded. */
6913 for (os = &lang_output_section_statement.head->output_section_statement;
6917 lang_output_section_phdr_list *pl;
6919 if (os->constraint < 0
6920 || os->bfd_section == NULL)
6923 for (pl = os->phdrs;
6926 if (! pl->used && strcmp (pl->name, "NONE") != 0)
6927 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
6928 os->name, pl->name);
6932 /* Record a list of sections which may not be cross referenced. */
6935 lang_add_nocrossref (lang_nocrossref_type *l)
6937 struct lang_nocrossrefs *n;
6939 n = (struct lang_nocrossrefs *) xmalloc (sizeof *n);
6940 n->next = nocrossref_list;
6942 nocrossref_list = n;
6944 /* Set notice_all so that we get informed about all symbols. */
6945 link_info.notice_all = TRUE;
6948 /* Overlay handling. We handle overlays with some static variables. */
6950 /* The overlay virtual address. */
6951 static etree_type *overlay_vma;
6952 /* And subsection alignment. */
6953 static etree_type *overlay_subalign;
6955 /* An expression for the maximum section size seen so far. */
6956 static etree_type *overlay_max;
6958 /* A list of all the sections in this overlay. */
6960 struct overlay_list {
6961 struct overlay_list *next;
6962 lang_output_section_statement_type *os;
6965 static struct overlay_list *overlay_list;
6967 /* Start handling an overlay. */
6970 lang_enter_overlay (etree_type *vma_expr, etree_type *subalign)
6972 /* The grammar should prevent nested overlays from occurring. */
6973 ASSERT (overlay_vma == NULL
6974 && overlay_subalign == NULL
6975 && overlay_max == NULL);
6977 overlay_vma = vma_expr;
6978 overlay_subalign = subalign;
6981 /* Start a section in an overlay. We handle this by calling
6982 lang_enter_output_section_statement with the correct VMA.
6983 lang_leave_overlay sets up the LMA and memory regions. */
6986 lang_enter_overlay_section (const char *name)
6988 struct overlay_list *n;
6991 lang_enter_output_section_statement (name, overlay_vma, overlay_section,
6992 0, overlay_subalign, 0, 0);
6994 /* If this is the first section, then base the VMA of future
6995 sections on this one. This will work correctly even if `.' is
6996 used in the addresses. */
6997 if (overlay_list == NULL)
6998 overlay_vma = exp_nameop (ADDR, name);
7000 /* Remember the section. */
7001 n = (struct overlay_list *) xmalloc (sizeof *n);
7002 n->os = current_section;
7003 n->next = overlay_list;
7006 size = exp_nameop (SIZEOF, name);
7008 /* Arrange to work out the maximum section end address. */
7009 if (overlay_max == NULL)
7012 overlay_max = exp_binop (MAX_K, overlay_max, size);
7015 /* Finish a section in an overlay. There isn't any special to do
7019 lang_leave_overlay_section (fill_type *fill,
7020 lang_output_section_phdr_list *phdrs)
7027 name = current_section->name;
7029 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
7030 region and that no load-time region has been specified. It doesn't
7031 really matter what we say here, since lang_leave_overlay will
7033 lang_leave_output_section_statement (fill, DEFAULT_MEMORY_REGION, phdrs, 0);
7035 /* Define the magic symbols. */
7037 clean = (char *) xmalloc (strlen (name) + 1);
7039 for (s1 = name; *s1 != '\0'; s1++)
7040 if (ISALNUM (*s1) || *s1 == '_')
7044 buf = (char *) xmalloc (strlen (clean) + sizeof "__load_start_");
7045 sprintf (buf, "__load_start_%s", clean);
7046 lang_add_assignment (exp_provide (buf,
7047 exp_nameop (LOADADDR, name),
7050 buf = (char *) xmalloc (strlen (clean) + sizeof "__load_stop_");
7051 sprintf (buf, "__load_stop_%s", clean);
7052 lang_add_assignment (exp_provide (buf,
7054 exp_nameop (LOADADDR, name),
7055 exp_nameop (SIZEOF, name)),
7061 /* Finish an overlay. If there are any overlay wide settings, this
7062 looks through all the sections in the overlay and sets them. */
7065 lang_leave_overlay (etree_type *lma_expr,
7068 const char *memspec,
7069 lang_output_section_phdr_list *phdrs,
7070 const char *lma_memspec)
7072 lang_memory_region_type *region;
7073 lang_memory_region_type *lma_region;
7074 struct overlay_list *l;
7075 lang_nocrossref_type *nocrossref;
7077 lang_get_regions (®ion, &lma_region,
7078 memspec, lma_memspec,
7079 lma_expr != NULL, FALSE);
7083 /* After setting the size of the last section, set '.' to end of the
7085 if (overlay_list != NULL)
7086 overlay_list->os->update_dot_tree
7087 = exp_assop ('=', ".", exp_binop ('+', overlay_vma, overlay_max));
7092 struct overlay_list *next;
7094 if (fill != NULL && l->os->fill == NULL)
7097 l->os->region = region;
7098 l->os->lma_region = lma_region;
7100 /* The first section has the load address specified in the
7101 OVERLAY statement. The rest are worked out from that.
7102 The base address is not needed (and should be null) if
7103 an LMA region was specified. */
7106 l->os->load_base = lma_expr;
7107 l->os->sectype = normal_section;
7109 if (phdrs != NULL && l->os->phdrs == NULL)
7110 l->os->phdrs = phdrs;
7114 lang_nocrossref_type *nc;
7116 nc = (lang_nocrossref_type *) xmalloc (sizeof *nc);
7117 nc->name = l->os->name;
7118 nc->next = nocrossref;
7127 if (nocrossref != NULL)
7128 lang_add_nocrossref (nocrossref);
7131 overlay_list = NULL;
7135 /* Version handling. This is only useful for ELF. */
7137 /* This global variable holds the version tree that we build. */
7139 struct bfd_elf_version_tree *lang_elf_version_info;
7141 /* If PREV is NULL, return first version pattern matching particular symbol.
7142 If PREV is non-NULL, return first version pattern matching particular
7143 symbol after PREV (previously returned by lang_vers_match). */
7145 static struct bfd_elf_version_expr *
7146 lang_vers_match (struct bfd_elf_version_expr_head *head,
7147 struct bfd_elf_version_expr *prev,
7150 const char *cxx_sym = sym;
7151 const char *java_sym = sym;
7152 struct bfd_elf_version_expr *expr = NULL;
7154 if (head->mask & BFD_ELF_VERSION_CXX_TYPE)
7156 cxx_sym = cplus_demangle (sym, DMGL_PARAMS | DMGL_ANSI);
7160 if (head->mask & BFD_ELF_VERSION_JAVA_TYPE)
7162 java_sym = cplus_demangle (sym, DMGL_JAVA);
7167 if (head->htab && (prev == NULL || prev->literal))
7169 struct bfd_elf_version_expr e;
7171 switch (prev ? prev->mask : 0)
7174 if (head->mask & BFD_ELF_VERSION_C_TYPE)
7177 expr = (struct bfd_elf_version_expr *)
7178 htab_find ((htab_t) head->htab, &e);
7179 while (expr && strcmp (expr->pattern, sym) == 0)
7180 if (expr->mask == BFD_ELF_VERSION_C_TYPE)
7186 case BFD_ELF_VERSION_C_TYPE:
7187 if (head->mask & BFD_ELF_VERSION_CXX_TYPE)
7189 e.pattern = cxx_sym;
7190 expr = (struct bfd_elf_version_expr *)
7191 htab_find ((htab_t) head->htab, &e);
7192 while (expr && strcmp (expr->pattern, cxx_sym) == 0)
7193 if (expr->mask == BFD_ELF_VERSION_CXX_TYPE)
7199 case BFD_ELF_VERSION_CXX_TYPE:
7200 if (head->mask & BFD_ELF_VERSION_JAVA_TYPE)
7202 e.pattern = java_sym;
7203 expr = (struct bfd_elf_version_expr *)
7204 htab_find ((htab_t) head->htab, &e);
7205 while (expr && strcmp (expr->pattern, java_sym) == 0)
7206 if (expr->mask == BFD_ELF_VERSION_JAVA_TYPE)
7217 /* Finally, try the wildcards. */
7218 if (prev == NULL || prev->literal)
7219 expr = head->remaining;
7222 for (; expr; expr = expr->next)
7229 if (expr->pattern[0] == '*' && expr->pattern[1] == '\0')
7232 if (expr->mask == BFD_ELF_VERSION_JAVA_TYPE)
7234 else if (expr->mask == BFD_ELF_VERSION_CXX_TYPE)
7238 if (fnmatch (expr->pattern, s, 0) == 0)
7244 free ((char *) cxx_sym);
7245 if (java_sym != sym)
7246 free ((char *) java_sym);
7250 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
7251 return a pointer to the symbol name with any backslash quotes removed. */
7254 realsymbol (const char *pattern)
7257 bfd_boolean changed = FALSE, backslash = FALSE;
7258 char *s, *symbol = (char *) xmalloc (strlen (pattern) + 1);
7260 for (p = pattern, s = symbol; *p != '\0'; ++p)
7262 /* It is a glob pattern only if there is no preceding
7266 /* Remove the preceding backslash. */
7273 if (*p == '?' || *p == '*' || *p == '[')
7280 backslash = *p == '\\';
7296 /* This is called for each variable name or match expression. NEW_NAME is
7297 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
7298 pattern to be matched against symbol names. */
7300 struct bfd_elf_version_expr *
7301 lang_new_vers_pattern (struct bfd_elf_version_expr *orig,
7302 const char *new_name,
7304 bfd_boolean literal_p)
7306 struct bfd_elf_version_expr *ret;
7308 ret = (struct bfd_elf_version_expr *) xmalloc (sizeof *ret);
7312 ret->literal = TRUE;
7313 ret->pattern = literal_p ? new_name : realsymbol (new_name);
7314 if (ret->pattern == NULL)
7316 ret->pattern = new_name;
7317 ret->literal = FALSE;
7320 if (lang == NULL || strcasecmp (lang, "C") == 0)
7321 ret->mask = BFD_ELF_VERSION_C_TYPE;
7322 else if (strcasecmp (lang, "C++") == 0)
7323 ret->mask = BFD_ELF_VERSION_CXX_TYPE;
7324 else if (strcasecmp (lang, "Java") == 0)
7325 ret->mask = BFD_ELF_VERSION_JAVA_TYPE;
7328 einfo (_("%X%P: unknown language `%s' in version information\n"),
7330 ret->mask = BFD_ELF_VERSION_C_TYPE;
7333 return ldemul_new_vers_pattern (ret);
7336 /* This is called for each set of variable names and match
7339 struct bfd_elf_version_tree *
7340 lang_new_vers_node (struct bfd_elf_version_expr *globals,
7341 struct bfd_elf_version_expr *locals)
7343 struct bfd_elf_version_tree *ret;
7345 ret = (struct bfd_elf_version_tree *) xcalloc (1, sizeof *ret);
7346 ret->globals.list = globals;
7347 ret->locals.list = locals;
7348 ret->match = lang_vers_match;
7349 ret->name_indx = (unsigned int) -1;
7353 /* This static variable keeps track of version indices. */
7355 static int version_index;
7358 version_expr_head_hash (const void *p)
7360 const struct bfd_elf_version_expr *e =
7361 (const struct bfd_elf_version_expr *) p;
7363 return htab_hash_string (e->pattern);
7367 version_expr_head_eq (const void *p1, const void *p2)
7369 const struct bfd_elf_version_expr *e1 =
7370 (const struct bfd_elf_version_expr *) p1;
7371 const struct bfd_elf_version_expr *e2 =
7372 (const struct bfd_elf_version_expr *) p2;
7374 return strcmp (e1->pattern, e2->pattern) == 0;
7378 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head *head)
7381 struct bfd_elf_version_expr *e, *next;
7382 struct bfd_elf_version_expr **list_loc, **remaining_loc;
7384 for (e = head->list; e; e = e->next)
7388 head->mask |= e->mask;
7393 head->htab = htab_create (count * 2, version_expr_head_hash,
7394 version_expr_head_eq, NULL);
7395 list_loc = &head->list;
7396 remaining_loc = &head->remaining;
7397 for (e = head->list; e; e = next)
7403 remaining_loc = &e->next;
7407 void **loc = htab_find_slot ((htab_t) head->htab, e, INSERT);
7411 struct bfd_elf_version_expr *e1, *last;
7413 e1 = (struct bfd_elf_version_expr *) *loc;
7417 if (e1->mask == e->mask)
7425 while (e1 && strcmp (e1->pattern, e->pattern) == 0);
7429 /* This is a duplicate. */
7430 /* FIXME: Memory leak. Sometimes pattern is not
7431 xmalloced alone, but in larger chunk of memory. */
7432 /* free (e->pattern); */
7437 e->next = last->next;
7445 list_loc = &e->next;
7449 *remaining_loc = NULL;
7450 *list_loc = head->remaining;
7453 head->remaining = head->list;
7456 /* This is called when we know the name and dependencies of the
7460 lang_register_vers_node (const char *name,
7461 struct bfd_elf_version_tree *version,
7462 struct bfd_elf_version_deps *deps)
7464 struct bfd_elf_version_tree *t, **pp;
7465 struct bfd_elf_version_expr *e1;
7470 if ((name[0] == '\0' && lang_elf_version_info != NULL)
7471 || (lang_elf_version_info && lang_elf_version_info->name[0] == '\0'))
7473 einfo (_("%X%P: anonymous version tag cannot be combined"
7474 " with other version tags\n"));
7479 /* Make sure this node has a unique name. */
7480 for (t = lang_elf_version_info; t != NULL; t = t->next)
7481 if (strcmp (t->name, name) == 0)
7482 einfo (_("%X%P: duplicate version tag `%s'\n"), name);
7484 lang_finalize_version_expr_head (&version->globals);
7485 lang_finalize_version_expr_head (&version->locals);
7487 /* Check the global and local match names, and make sure there
7488 aren't any duplicates. */
7490 for (e1 = version->globals.list; e1 != NULL; e1 = e1->next)
7492 for (t = lang_elf_version_info; t != NULL; t = t->next)
7494 struct bfd_elf_version_expr *e2;
7496 if (t->locals.htab && e1->literal)
7498 e2 = (struct bfd_elf_version_expr *)
7499 htab_find ((htab_t) t->locals.htab, e1);
7500 while (e2 && strcmp (e1->pattern, e2->pattern) == 0)
7502 if (e1->mask == e2->mask)
7503 einfo (_("%X%P: duplicate expression `%s'"
7504 " in version information\n"), e1->pattern);
7508 else if (!e1->literal)
7509 for (e2 = t->locals.remaining; e2 != NULL; e2 = e2->next)
7510 if (strcmp (e1->pattern, e2->pattern) == 0
7511 && e1->mask == e2->mask)
7512 einfo (_("%X%P: duplicate expression `%s'"
7513 " in version information\n"), e1->pattern);
7517 for (e1 = version->locals.list; e1 != NULL; e1 = e1->next)
7519 for (t = lang_elf_version_info; t != NULL; t = t->next)
7521 struct bfd_elf_version_expr *e2;
7523 if (t->globals.htab && e1->literal)
7525 e2 = (struct bfd_elf_version_expr *)
7526 htab_find ((htab_t) t->globals.htab, e1);
7527 while (e2 && strcmp (e1->pattern, e2->pattern) == 0)
7529 if (e1->mask == e2->mask)
7530 einfo (_("%X%P: duplicate expression `%s'"
7531 " in version information\n"),
7536 else if (!e1->literal)
7537 for (e2 = t->globals.remaining; e2 != NULL; e2 = e2->next)
7538 if (strcmp (e1->pattern, e2->pattern) == 0
7539 && e1->mask == e2->mask)
7540 einfo (_("%X%P: duplicate expression `%s'"
7541 " in version information\n"), e1->pattern);
7545 version->deps = deps;
7546 version->name = name;
7547 if (name[0] != '\0')
7550 version->vernum = version_index;
7553 version->vernum = 0;
7555 for (pp = &lang_elf_version_info; *pp != NULL; pp = &(*pp)->next)
7560 /* This is called when we see a version dependency. */
7562 struct bfd_elf_version_deps *
7563 lang_add_vers_depend (struct bfd_elf_version_deps *list, const char *name)
7565 struct bfd_elf_version_deps *ret;
7566 struct bfd_elf_version_tree *t;
7568 ret = (struct bfd_elf_version_deps *) xmalloc (sizeof *ret);
7571 for (t = lang_elf_version_info; t != NULL; t = t->next)
7573 if (strcmp (t->name, name) == 0)
7575 ret->version_needed = t;
7580 einfo (_("%X%P: unable to find version dependency `%s'\n"), name);
7586 lang_do_version_exports_section (void)
7588 struct bfd_elf_version_expr *greg = NULL, *lreg;
7590 LANG_FOR_EACH_INPUT_STATEMENT (is)
7592 asection *sec = bfd_get_section_by_name (is->the_bfd, ".exports");
7600 contents = (char *) xmalloc (len);
7601 if (!bfd_get_section_contents (is->the_bfd, sec, contents, 0, len))
7602 einfo (_("%X%P: unable to read .exports section contents\n"), sec);
7605 while (p < contents + len)
7607 greg = lang_new_vers_pattern (greg, p, NULL, FALSE);
7608 p = strchr (p, '\0') + 1;
7611 /* Do not free the contents, as we used them creating the regex. */
7613 /* Do not include this section in the link. */
7614 sec->flags |= SEC_EXCLUDE | SEC_KEEP;
7617 lreg = lang_new_vers_pattern (NULL, "*", NULL, FALSE);
7618 lang_register_vers_node (command_line.version_exports_section,
7619 lang_new_vers_node (greg, lreg), NULL);
7623 lang_add_unique (const char *name)
7625 struct unique_sections *ent;
7627 for (ent = unique_section_list; ent; ent = ent->next)
7628 if (strcmp (ent->name, name) == 0)
7631 ent = (struct unique_sections *) xmalloc (sizeof *ent);
7632 ent->name = xstrdup (name);
7633 ent->next = unique_section_list;
7634 unique_section_list = ent;
7637 /* Append the list of dynamic symbols to the existing one. */
7640 lang_append_dynamic_list (struct bfd_elf_version_expr *dynamic)
7642 if (link_info.dynamic_list)
7644 struct bfd_elf_version_expr *tail;
7645 for (tail = dynamic; tail->next != NULL; tail = tail->next)
7647 tail->next = link_info.dynamic_list->head.list;
7648 link_info.dynamic_list->head.list = dynamic;
7652 struct bfd_elf_dynamic_list *d;
7654 d = (struct bfd_elf_dynamic_list *) xcalloc (1, sizeof *d);
7655 d->head.list = dynamic;
7656 d->match = lang_vers_match;
7657 link_info.dynamic_list = d;
7661 /* Append the list of C++ typeinfo dynamic symbols to the existing
7665 lang_append_dynamic_list_cpp_typeinfo (void)
7667 const char * symbols [] =
7669 "typeinfo name for*",
7672 struct bfd_elf_version_expr *dynamic = NULL;
7675 for (i = 0; i < ARRAY_SIZE (symbols); i++)
7676 dynamic = lang_new_vers_pattern (dynamic, symbols [i], "C++",
7679 lang_append_dynamic_list (dynamic);
7682 /* Append the list of C++ operator new and delete dynamic symbols to the
7686 lang_append_dynamic_list_cpp_new (void)
7688 const char * symbols [] =
7693 struct bfd_elf_version_expr *dynamic = NULL;
7696 for (i = 0; i < ARRAY_SIZE (symbols); i++)
7697 dynamic = lang_new_vers_pattern (dynamic, symbols [i], "C++",
7700 lang_append_dynamic_list (dynamic);