1 /* Linker command language support.
2 Copyright 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005
4 Free Software Foundation, Inc.
6 This file is part of GLD, the Gnu Linker.
8 GLD 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 2, or (at your option)
13 GLD 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 GLD; see the file COPYING. If not, write to the Free
20 Software Foundation, 51 Franklin Street - Fifth Floor, Boston, MA
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 lang_statement_list_type input_file_chain;
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 const char *output_target;
64 static lang_statement_list_type statement_list;
65 static struct lang_phdr *lang_phdr_list;
66 static struct bfd_hash_table lang_definedness_table;
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 bfd_boolean load_symbols (lang_input_statement_type *,
73 lang_statement_list_type *);
74 static struct bfd_hash_entry *lang_definedness_newfunc
75 (struct bfd_hash_entry *, struct bfd_hash_table *, const char *);
76 static void insert_undefined (const char *);
77 static void print_all_symbols (asection *);
78 static bfd_boolean sort_def_symbol (struct bfd_link_hash_entry *, void *);
79 static void print_statement (lang_statement_union_type *,
80 lang_output_section_statement_type *);
81 static void print_statement_list (lang_statement_union_type *,
82 lang_output_section_statement_type *);
83 static void print_statements (void);
84 static bfd_boolean lang_one_common (struct bfd_link_hash_entry *, void *);
85 static void lang_record_phdrs (void);
86 static void lang_do_version_exports_section (void);
88 /* Exported variables. */
89 lang_output_section_statement_type *abs_output_section;
90 lang_statement_list_type lang_output_section_statement;
91 lang_statement_list_type *stat_ptr = &statement_list;
92 lang_statement_list_type file_chain = { NULL, NULL };
93 struct bfd_sym_chain entry_symbol = { NULL, NULL };
94 const char *entry_section = ".text";
95 bfd_boolean entry_from_cmdline;
96 bfd_boolean lang_has_input_file = FALSE;
97 bfd_boolean had_output_filename = FALSE;
98 bfd_boolean lang_float_flag = FALSE;
99 bfd_boolean delete_output_file_on_failure = FALSE;
100 struct lang_nocrossrefs *nocrossref_list;
101 static struct unique_sections *unique_section_list;
102 static bfd_boolean ldlang_sysrooted_script = FALSE;
103 int lang_statement_iteration = 0;
105 etree_type *base; /* Relocation base - or null */
107 /* Return TRUE if the PATTERN argument is a wildcard pattern.
108 Although backslashes are treated specially if a pattern contains
109 wildcards, we do not consider the mere presence of a backslash to
110 be enough to cause the pattern to be treated as a wildcard.
111 That lets us handle DOS filenames more naturally. */
112 #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL)
114 #define new_stat(x, y) \
115 (x##_type *) new_statement (x##_enum, sizeof (x##_type), y)
117 #define outside_section_address(q) \
118 ((q)->output_offset + (q)->output_section->vma)
120 #define outside_symbol_address(q) \
121 ((q)->value + outside_section_address (q->section))
123 #define SECTION_NAME_MAP_LENGTH (16)
126 stat_alloc (size_t size)
128 return obstack_alloc (&stat_obstack, size);
132 unique_section_p (const asection *sec)
134 struct unique_sections *unam;
137 if (link_info.relocatable
138 && sec->owner != NULL
139 && bfd_is_group_section (sec->owner, sec))
143 for (unam = unique_section_list; unam; unam = unam->next)
144 if (wildcardp (unam->name)
145 ? fnmatch (unam->name, secnam, 0) == 0
146 : strcmp (unam->name, secnam) == 0)
154 /* Generic traversal routines for finding matching sections. */
156 /* Try processing a section against a wildcard. This just calls
157 the callback unless the filename exclusion list is present
158 and excludes the file. It's hardly ever present so this
159 function is very fast. */
162 walk_wild_consider_section (lang_wild_statement_type *ptr,
163 lang_input_statement_type *file,
165 struct wildcard_list *sec,
169 bfd_boolean skip = FALSE;
170 struct name_list *list_tmp;
172 /* Don't process sections from files which were
174 for (list_tmp = sec->spec.exclude_name_list;
176 list_tmp = list_tmp->next)
178 bfd_boolean is_wildcard = wildcardp (list_tmp->name);
180 skip = fnmatch (list_tmp->name, file->filename, 0) == 0;
182 skip = strcmp (list_tmp->name, file->filename) == 0;
184 /* If this file is part of an archive, and the archive is
185 excluded, exclude this file. */
186 if (! skip && file->the_bfd != NULL
187 && file->the_bfd->my_archive != NULL
188 && file->the_bfd->my_archive->filename != NULL)
191 skip = fnmatch (list_tmp->name,
192 file->the_bfd->my_archive->filename,
195 skip = strcmp (list_tmp->name,
196 file->the_bfd->my_archive->filename) == 0;
204 (*callback) (ptr, sec, s, file, data);
207 /* Lowest common denominator routine that can handle everything correctly,
211 walk_wild_section_general (lang_wild_statement_type *ptr,
212 lang_input_statement_type *file,
217 struct wildcard_list *sec;
219 for (s = file->the_bfd->sections; s != NULL; s = s->next)
221 sec = ptr->section_list;
223 (*callback) (ptr, sec, s, file, data);
227 bfd_boolean skip = FALSE;
229 if (sec->spec.name != NULL)
231 const char *sname = bfd_get_section_name (file->the_bfd, s);
233 if (wildcardp (sec->spec.name))
234 skip = fnmatch (sec->spec.name, sname, 0) != 0;
236 skip = strcmp (sec->spec.name, sname) != 0;
240 walk_wild_consider_section (ptr, file, s, sec, callback, data);
247 /* Routines to find a single section given its name. If there's more
248 than one section with that name, we report that. */
252 asection *found_section;
253 bfd_boolean multiple_sections_found;
254 } section_iterator_callback_data;
257 section_iterator_callback (bfd *bfd ATTRIBUTE_UNUSED, asection *s, void *data)
259 section_iterator_callback_data *d = data;
261 if (d->found_section != NULL)
263 d->multiple_sections_found = TRUE;
267 d->found_section = s;
272 find_section (lang_input_statement_type *file,
273 struct wildcard_list *sec,
274 bfd_boolean *multiple_sections_found)
276 section_iterator_callback_data cb_data = { NULL, FALSE };
278 bfd_get_section_by_name_if (file->the_bfd, sec->spec.name,
279 section_iterator_callback, &cb_data);
280 *multiple_sections_found = cb_data.multiple_sections_found;
281 return cb_data.found_section;
284 /* Code for handling simple wildcards without going through fnmatch,
285 which can be expensive because of charset translations etc. */
287 /* A simple wild is a literal string followed by a single '*',
288 where the literal part is at least 4 characters long. */
291 is_simple_wild (const char *name)
293 size_t len = strcspn (name, "*?[");
294 return len >= 4 && name[len] == '*' && name[len + 1] == '\0';
298 match_simple_wild (const char *pattern, const char *name)
300 /* The first four characters of the pattern are guaranteed valid
301 non-wildcard characters. So we can go faster. */
302 if (pattern[0] != name[0] || pattern[1] != name[1]
303 || pattern[2] != name[2] || pattern[3] != name[3])
308 while (*pattern != '*')
309 if (*name++ != *pattern++)
315 /* Specialized, optimized routines for handling different kinds of
319 walk_wild_section_specs1_wild0 (lang_wild_statement_type *ptr,
320 lang_input_statement_type *file,
324 /* We can just do a hash lookup for the section with the right name.
325 But if that lookup discovers more than one section with the name
326 (should be rare), we fall back to the general algorithm because
327 we would otherwise have to sort the sections to make sure they
328 get processed in the bfd's order. */
329 bfd_boolean multiple_sections_found;
330 struct wildcard_list *sec0 = ptr->handler_data[0];
331 asection *s0 = find_section (file, sec0, &multiple_sections_found);
333 if (multiple_sections_found)
334 walk_wild_section_general (ptr, file, callback, data);
336 walk_wild_consider_section (ptr, file, s0, sec0, callback, data);
340 walk_wild_section_specs1_wild1 (lang_wild_statement_type *ptr,
341 lang_input_statement_type *file,
346 struct wildcard_list *wildsec0 = ptr->handler_data[0];
348 for (s = file->the_bfd->sections; s != NULL; s = s->next)
350 const char *sname = bfd_get_section_name (file->the_bfd, s);
351 bfd_boolean skip = !match_simple_wild (wildsec0->spec.name, sname);
354 walk_wild_consider_section (ptr, file, s, wildsec0, callback, data);
359 walk_wild_section_specs2_wild1 (lang_wild_statement_type *ptr,
360 lang_input_statement_type *file,
365 struct wildcard_list *sec0 = ptr->handler_data[0];
366 struct wildcard_list *wildsec1 = ptr->handler_data[1];
367 bfd_boolean multiple_sections_found;
368 asection *s0 = find_section (file, sec0, &multiple_sections_found);
370 if (multiple_sections_found)
372 walk_wild_section_general (ptr, file, callback, data);
376 /* Note that if the section was not found, s0 is NULL and
377 we'll simply never succeed the s == s0 test below. */
378 for (s = file->the_bfd->sections; s != NULL; s = s->next)
380 /* Recall that in this code path, a section cannot satisfy more
381 than one spec, so if s == s0 then it cannot match
384 walk_wild_consider_section (ptr, file, s, sec0, callback, data);
387 const char *sname = bfd_get_section_name (file->the_bfd, s);
388 bfd_boolean skip = !match_simple_wild (wildsec1->spec.name, sname);
391 walk_wild_consider_section (ptr, file, s, wildsec1, callback,
398 walk_wild_section_specs3_wild2 (lang_wild_statement_type *ptr,
399 lang_input_statement_type *file,
404 struct wildcard_list *sec0 = ptr->handler_data[0];
405 struct wildcard_list *wildsec1 = ptr->handler_data[1];
406 struct wildcard_list *wildsec2 = ptr->handler_data[2];
407 bfd_boolean multiple_sections_found;
408 asection *s0 = find_section (file, sec0, &multiple_sections_found);
410 if (multiple_sections_found)
412 walk_wild_section_general (ptr, file, callback, data);
416 for (s = file->the_bfd->sections; s != NULL; s = s->next)
419 walk_wild_consider_section (ptr, file, s, sec0, callback, data);
422 const char *sname = bfd_get_section_name (file->the_bfd, s);
423 bfd_boolean skip = !match_simple_wild (wildsec1->spec.name, sname);
426 walk_wild_consider_section (ptr, file, s, wildsec1, callback, data);
429 skip = !match_simple_wild (wildsec2->spec.name, sname);
431 walk_wild_consider_section (ptr, file, s, wildsec2, callback,
439 walk_wild_section_specs4_wild2 (lang_wild_statement_type *ptr,
440 lang_input_statement_type *file,
445 struct wildcard_list *sec0 = ptr->handler_data[0];
446 struct wildcard_list *sec1 = ptr->handler_data[1];
447 struct wildcard_list *wildsec2 = ptr->handler_data[2];
448 struct wildcard_list *wildsec3 = ptr->handler_data[3];
449 bfd_boolean multiple_sections_found;
450 asection *s0 = find_section (file, sec0, &multiple_sections_found), *s1;
452 if (multiple_sections_found)
454 walk_wild_section_general (ptr, file, callback, data);
458 s1 = find_section (file, sec1, &multiple_sections_found);
459 if (multiple_sections_found)
461 walk_wild_section_general (ptr, file, callback, data);
465 for (s = file->the_bfd->sections; s != NULL; s = s->next)
468 walk_wild_consider_section (ptr, file, s, sec0, callback, data);
471 walk_wild_consider_section (ptr, file, s, sec1, callback, data);
474 const char *sname = bfd_get_section_name (file->the_bfd, s);
475 bfd_boolean skip = !match_simple_wild (wildsec2->spec.name,
479 walk_wild_consider_section (ptr, file, s, wildsec2, callback,
483 skip = !match_simple_wild (wildsec3->spec.name, sname);
485 walk_wild_consider_section (ptr, file, s, wildsec3,
493 walk_wild_section (lang_wild_statement_type *ptr,
494 lang_input_statement_type *file,
498 if (file->just_syms_flag)
501 (*ptr->walk_wild_section_handler) (ptr, file, callback, data);
504 /* Returns TRUE when name1 is a wildcard spec that might match
505 something name2 can match. We're conservative: we return FALSE
506 only if the prefixes of name1 and name2 are different up to the
507 first wildcard character. */
510 wild_spec_can_overlap (const char *name1, const char *name2)
512 size_t prefix1_len = strcspn (name1, "?*[");
513 size_t prefix2_len = strcspn (name2, "?*[");
514 size_t min_prefix_len;
516 /* Note that if there is no wildcard character, then we treat the
517 terminating 0 as part of the prefix. Thus ".text" won't match
518 ".text." or ".text.*", for example. */
519 if (name1[prefix1_len] == '\0')
521 if (name2[prefix2_len] == '\0')
524 min_prefix_len = prefix1_len < prefix2_len ? prefix1_len : prefix2_len;
526 return memcmp (name1, name2, min_prefix_len) == 0;
529 /* Select specialized code to handle various kinds of wildcard
533 analyze_walk_wild_section_handler (lang_wild_statement_type *ptr)
536 int wild_name_count = 0;
537 struct wildcard_list *sec;
541 ptr->walk_wild_section_handler = walk_wild_section_general;
543 /* Count how many wildcard_specs there are, and how many of those
544 actually use wildcards in the name. Also, bail out if any of the
545 wildcard names are NULL. (Can this actually happen?
546 walk_wild_section used to test for it.) And bail out if any
547 of the wildcards are more complex than a simple string
548 ending in a single '*'. */
549 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
552 if (sec->spec.name == NULL)
554 if (wildcardp (sec->spec.name))
557 if (!is_simple_wild (sec->spec.name))
562 /* The zero-spec case would be easy to optimize but it doesn't
563 happen in practice. Likewise, more than 4 specs doesn't
564 happen in practice. */
565 if (sec_count == 0 || sec_count > 4)
568 /* Check that no two specs can match the same section. */
569 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
571 struct wildcard_list *sec2;
572 for (sec2 = sec->next; sec2 != NULL; sec2 = sec2->next)
574 if (wild_spec_can_overlap (sec->spec.name, sec2->spec.name))
579 signature = (sec_count << 8) + wild_name_count;
583 ptr->walk_wild_section_handler = walk_wild_section_specs1_wild0;
586 ptr->walk_wild_section_handler = walk_wild_section_specs1_wild1;
589 ptr->walk_wild_section_handler = walk_wild_section_specs2_wild1;
592 ptr->walk_wild_section_handler = walk_wild_section_specs3_wild2;
595 ptr->walk_wild_section_handler = walk_wild_section_specs4_wild2;
601 /* Now fill the data array with pointers to the specs, first the
602 specs with non-wildcard names, then the specs with wildcard
603 names. It's OK to process the specs in different order from the
604 given order, because we've already determined that no section
605 will match more than one spec. */
607 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
608 if (!wildcardp (sec->spec.name))
609 ptr->handler_data[data_counter++] = sec;
610 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
611 if (wildcardp (sec->spec.name))
612 ptr->handler_data[data_counter++] = sec;
615 /* Handle a wild statement for a single file F. */
618 walk_wild_file (lang_wild_statement_type *s,
619 lang_input_statement_type *f,
623 if (f->the_bfd == NULL
624 || ! bfd_check_format (f->the_bfd, bfd_archive))
625 walk_wild_section (s, f, callback, data);
630 /* This is an archive file. We must map each member of the
631 archive separately. */
632 member = bfd_openr_next_archived_file (f->the_bfd, NULL);
633 while (member != NULL)
635 /* When lookup_name is called, it will call the add_symbols
636 entry point for the archive. For each element of the
637 archive which is included, BFD will call ldlang_add_file,
638 which will set the usrdata field of the member to the
639 lang_input_statement. */
640 if (member->usrdata != NULL)
642 walk_wild_section (s, member->usrdata, callback, data);
645 member = bfd_openr_next_archived_file (f->the_bfd, member);
651 walk_wild (lang_wild_statement_type *s, callback_t callback, void *data)
653 const char *file_spec = s->filename;
655 if (file_spec == NULL)
657 /* Perform the iteration over all files in the list. */
658 LANG_FOR_EACH_INPUT_STATEMENT (f)
660 walk_wild_file (s, f, callback, data);
663 else if (wildcardp (file_spec))
665 LANG_FOR_EACH_INPUT_STATEMENT (f)
667 if (fnmatch (file_spec, f->filename, FNM_FILE_NAME) == 0)
668 walk_wild_file (s, f, callback, data);
673 lang_input_statement_type *f;
675 /* Perform the iteration over a single file. */
676 f = lookup_name (file_spec);
678 walk_wild_file (s, f, callback, data);
682 /* lang_for_each_statement walks the parse tree and calls the provided
683 function for each node. */
686 lang_for_each_statement_worker (void (*func) (lang_statement_union_type *),
687 lang_statement_union_type *s)
689 for (; s != NULL; s = s->header.next)
693 switch (s->header.type)
695 case lang_constructors_statement_enum:
696 lang_for_each_statement_worker (func, constructor_list.head);
698 case lang_output_section_statement_enum:
699 lang_for_each_statement_worker
700 (func, s->output_section_statement.children.head);
702 case lang_wild_statement_enum:
703 lang_for_each_statement_worker (func,
704 s->wild_statement.children.head);
706 case lang_group_statement_enum:
707 lang_for_each_statement_worker (func,
708 s->group_statement.children.head);
710 case lang_data_statement_enum:
711 case lang_reloc_statement_enum:
712 case lang_object_symbols_statement_enum:
713 case lang_output_statement_enum:
714 case lang_target_statement_enum:
715 case lang_input_section_enum:
716 case lang_input_statement_enum:
717 case lang_assignment_statement_enum:
718 case lang_padding_statement_enum:
719 case lang_address_statement_enum:
720 case lang_fill_statement_enum:
730 lang_for_each_statement (void (*func) (lang_statement_union_type *))
732 lang_for_each_statement_worker (func, statement_list.head);
735 /*----------------------------------------------------------------------*/
738 lang_list_init (lang_statement_list_type *list)
741 list->tail = &list->head;
744 /* Build a new statement node for the parse tree. */
746 static lang_statement_union_type *
747 new_statement (enum statement_enum type,
749 lang_statement_list_type *list)
751 lang_statement_union_type *new;
753 new = stat_alloc (size);
754 new->header.type = type;
755 new->header.next = NULL;
756 lang_statement_append (list, new, &new->header.next);
760 /* Build a new input file node for the language. There are several
761 ways in which we treat an input file, eg, we only look at symbols,
762 or prefix it with a -l etc.
764 We can be supplied with requests for input files more than once;
765 they may, for example be split over several lines like foo.o(.text)
766 foo.o(.data) etc, so when asked for a file we check that we haven't
767 got it already so we don't duplicate the bfd. */
769 static lang_input_statement_type *
770 new_afile (const char *name,
771 lang_input_file_enum_type file_type,
773 bfd_boolean add_to_list)
775 lang_input_statement_type *p;
778 p = new_stat (lang_input_statement, stat_ptr);
781 p = stat_alloc (sizeof (lang_input_statement_type));
782 p->header.next = NULL;
785 lang_has_input_file = TRUE;
787 p->sysrooted = FALSE;
790 case lang_input_file_is_symbols_only_enum:
792 p->is_archive = FALSE;
794 p->local_sym_name = name;
795 p->just_syms_flag = TRUE;
796 p->search_dirs_flag = FALSE;
798 case lang_input_file_is_fake_enum:
800 p->is_archive = FALSE;
802 p->local_sym_name = name;
803 p->just_syms_flag = FALSE;
804 p->search_dirs_flag = FALSE;
806 case lang_input_file_is_l_enum:
807 p->is_archive = TRUE;
810 p->local_sym_name = concat ("-l", name, NULL);
811 p->just_syms_flag = FALSE;
812 p->search_dirs_flag = TRUE;
814 case lang_input_file_is_marker_enum:
816 p->is_archive = FALSE;
818 p->local_sym_name = name;
819 p->just_syms_flag = FALSE;
820 p->search_dirs_flag = TRUE;
822 case lang_input_file_is_search_file_enum:
823 p->sysrooted = ldlang_sysrooted_script;
825 p->is_archive = FALSE;
827 p->local_sym_name = name;
828 p->just_syms_flag = FALSE;
829 p->search_dirs_flag = TRUE;
831 case lang_input_file_is_file_enum:
833 p->is_archive = FALSE;
835 p->local_sym_name = name;
836 p->just_syms_flag = FALSE;
837 p->search_dirs_flag = FALSE;
844 p->next_real_file = NULL;
847 p->dynamic = config.dynamic_link;
848 p->add_needed = add_needed;
849 p->as_needed = as_needed;
850 p->whole_archive = whole_archive;
852 lang_statement_append (&input_file_chain,
853 (lang_statement_union_type *) p,
858 lang_input_statement_type *
859 lang_add_input_file (const char *name,
860 lang_input_file_enum_type file_type,
863 lang_has_input_file = TRUE;
864 return new_afile (name, file_type, target, TRUE);
867 /* Build enough state so that the parser can build its tree. */
872 obstack_begin (&stat_obstack, 1000);
874 stat_ptr = &statement_list;
876 lang_list_init (stat_ptr);
878 lang_list_init (&input_file_chain);
879 lang_list_init (&lang_output_section_statement);
880 lang_list_init (&file_chain);
881 first_file = lang_add_input_file (NULL, lang_input_file_is_marker_enum,
884 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME);
886 abs_output_section->bfd_section = bfd_abs_section_ptr;
888 /* The value "3" is ad-hoc, somewhat related to the expected number of
889 DEFINED expressions in a linker script. For most default linker
890 scripts, there are none. Why a hash table then? Well, it's somewhat
891 simpler to re-use working machinery than using a linked list in terms
892 of code-complexity here in ld, besides the initialization which just
893 looks like other code here. */
894 if (!bfd_hash_table_init_n (&lang_definedness_table,
895 lang_definedness_newfunc, 3))
896 einfo (_("%P%F: out of memory during initialization"));
898 /* Callers of exp_fold_tree need to increment this. */
899 lang_statement_iteration = 0;
902 /*----------------------------------------------------------------------
903 A region is an area of memory declared with the
904 MEMORY { name:org=exp, len=exp ... }
907 We maintain a list of all the regions here.
909 If no regions are specified in the script, then the default is used
910 which is created when looked up to be the entire data space.
912 If create is true we are creating a region inside a MEMORY block.
913 In this case it is probably an error to create a region that has
914 already been created. If we are not inside a MEMORY block it is
915 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
916 and so we issue a warning. */
918 static lang_memory_region_type *lang_memory_region_list;
919 static lang_memory_region_type **lang_memory_region_list_tail
920 = &lang_memory_region_list;
922 lang_memory_region_type *
923 lang_memory_region_lookup (const char *const name, bfd_boolean create)
925 lang_memory_region_type *p;
926 lang_memory_region_type *new;
928 /* NAME is NULL for LMA memspecs if no region was specified. */
932 for (p = lang_memory_region_list; p != NULL; p = p->next)
933 if (strcmp (p->name, name) == 0)
936 einfo (_("%P:%S: warning: redeclaration of memory region '%s'\n"),
941 if (!create && strcmp (name, DEFAULT_MEMORY_REGION))
942 einfo (_("%P:%S: warning: memory region %s not declared\n"), name);
944 new = stat_alloc (sizeof (lang_memory_region_type));
946 new->name = xstrdup (name);
949 *lang_memory_region_list_tail = new;
950 lang_memory_region_list_tail = &new->next;
954 new->length = ~(bfd_size_type) 0;
956 new->had_full_message = FALSE;
961 static lang_memory_region_type *
962 lang_memory_default (asection *section)
964 lang_memory_region_type *p;
966 flagword sec_flags = section->flags;
968 /* Override SEC_DATA to mean a writable section. */
969 if ((sec_flags & (SEC_ALLOC | SEC_READONLY | SEC_CODE)) == SEC_ALLOC)
970 sec_flags |= SEC_DATA;
972 for (p = lang_memory_region_list; p != NULL; p = p->next)
974 if ((p->flags & sec_flags) != 0
975 && (p->not_flags & sec_flags) == 0)
980 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION, FALSE);
983 static lang_output_section_statement_type *
984 lang_output_section_find_1 (const char *const name, int constraint)
986 lang_output_section_statement_type *lookup;
988 for (lookup = &lang_output_section_statement.head->output_section_statement;
990 lookup = lookup->next)
992 if (strcmp (name, lookup->name) == 0
993 && lookup->constraint != -1
995 || (constraint == lookup->constraint
996 && constraint != SPECIAL)))
1002 lang_output_section_statement_type *
1003 lang_output_section_find (const char *const name)
1005 return lang_output_section_find_1 (name, 0);
1008 static lang_output_section_statement_type *
1009 lang_output_section_statement_lookup_1 (const char *const name, int constraint)
1011 lang_output_section_statement_type *lookup;
1013 lookup = lang_output_section_find_1 (name, constraint);
1016 lookup = new_stat (lang_output_section_statement, stat_ptr);
1017 lookup->region = NULL;
1018 lookup->lma_region = NULL;
1020 lookup->block_value = 1;
1021 lookup->name = name;
1023 lookup->next = NULL;
1024 lookup->bfd_section = NULL;
1025 lookup->processed = 0;
1026 lookup->constraint = constraint;
1027 lookup->sectype = normal_section;
1028 lookup->addr_tree = NULL;
1029 lang_list_init (&lookup->children);
1031 lookup->memspec = NULL;
1033 lookup->subsection_alignment = -1;
1034 lookup->section_alignment = -1;
1035 lookup->load_base = NULL;
1036 lookup->update_dot_tree = NULL;
1037 lookup->phdrs = NULL;
1039 lang_statement_append (&lang_output_section_statement,
1040 (lang_statement_union_type *) lookup,
1041 (lang_statement_union_type **) &lookup->next);
1046 lang_output_section_statement_type *
1047 lang_output_section_statement_lookup (const char *const name)
1049 return lang_output_section_statement_lookup_1 (name, 0);
1052 /* A variant of lang_output_section_find used by place_orphan.
1053 Returns the output statement that should precede a new output
1054 statement for SEC. If an exact match is found on certain flags,
1057 lang_output_section_statement_type *
1058 lang_output_section_find_by_flags (const asection *sec,
1059 lang_output_section_statement_type **exact)
1061 lang_output_section_statement_type *first, *look, *found;
1064 /* We know the first statement on this list is *ABS*. May as well
1066 first = &lang_output_section_statement.head->output_section_statement;
1067 first = first->next;
1069 /* First try for an exact match. */
1071 for (look = first; look; look = look->next)
1073 flags = look->flags;
1074 if (look->bfd_section != NULL)
1075 flags = look->bfd_section->flags;
1076 flags ^= sec->flags;
1077 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD | SEC_READONLY
1078 | SEC_CODE | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1087 if (sec->flags & SEC_CODE)
1089 /* Try for a rw code section. */
1090 for (look = first; look; look = look->next)
1092 flags = look->flags;
1093 if (look->bfd_section != NULL)
1094 flags = look->bfd_section->flags;
1095 flags ^= sec->flags;
1096 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1097 | SEC_CODE | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1103 if (sec->flags & (SEC_READONLY | SEC_THREAD_LOCAL))
1105 /* .rodata can go after .text, .sdata2 after .rodata. */
1106 for (look = first; look; look = look->next)
1108 flags = look->flags;
1109 if (look->bfd_section != NULL)
1110 flags = look->bfd_section->flags;
1111 flags ^= sec->flags;
1112 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1114 && !(look->flags & (SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1120 if (sec->flags & SEC_SMALL_DATA)
1122 /* .sdata goes after .data, .sbss after .sdata. */
1123 for (look = first; look; look = look->next)
1125 flags = look->flags;
1126 if (look->bfd_section != NULL)
1127 flags = look->bfd_section->flags;
1128 flags ^= sec->flags;
1129 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1130 | SEC_THREAD_LOCAL))
1131 || ((look->flags & SEC_SMALL_DATA)
1132 && !(sec->flags & SEC_HAS_CONTENTS)))
1138 if (sec->flags & SEC_HAS_CONTENTS)
1140 /* .data goes after .rodata. */
1141 for (look = first; look; look = look->next)
1143 flags = look->flags;
1144 if (look->bfd_section != NULL)
1145 flags = look->bfd_section->flags;
1146 flags ^= sec->flags;
1147 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1148 | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1154 /* .bss goes last. */
1155 for (look = first; look; look = look->next)
1157 flags = look->flags;
1158 if (look->bfd_section != NULL)
1159 flags = look->bfd_section->flags;
1160 flags ^= sec->flags;
1161 if (!(flags & SEC_ALLOC))
1168 /* Find the last output section before given output statement.
1169 Used by place_orphan. */
1172 output_prev_sec_find (lang_output_section_statement_type *os)
1174 asection *s = (asection *) NULL;
1175 lang_output_section_statement_type *lookup;
1177 for (lookup = &lang_output_section_statement.head->output_section_statement;
1179 lookup = lookup->next)
1181 if (lookup->constraint == -1)
1186 if (lookup->bfd_section != NULL && lookup->bfd_section->owner != NULL)
1187 s = lookup->bfd_section;
1193 lang_output_section_statement_type *
1194 lang_insert_orphan (lang_input_statement_type *file,
1196 const char *secname,
1197 lang_output_section_statement_type *after,
1198 struct orphan_save *place,
1199 etree_type *address,
1200 lang_statement_list_type *add_child)
1202 lang_statement_list_type *old;
1203 lang_statement_list_type add;
1205 etree_type *load_base;
1206 lang_output_section_statement_type *os;
1207 lang_output_section_statement_type **os_tail;
1209 /* Start building a list of statements for this section.
1210 First save the current statement pointer. */
1213 /* If we have found an appropriate place for the output section
1214 statements for this orphan, add them to our own private list,
1215 inserting them later into the global statement list. */
1219 lang_list_init (stat_ptr);
1223 if (config.build_constructors)
1225 /* If the name of the section is representable in C, then create
1226 symbols to mark the start and the end of the section. */
1227 for (ps = secname; *ps != '\0'; ps++)
1228 if (! ISALNUM ((unsigned char) *ps) && *ps != '_')
1233 etree_type *e_align;
1235 symname = (char *) xmalloc (ps - secname + sizeof "__start_" + 1);
1236 symname[0] = bfd_get_symbol_leading_char (output_bfd);
1237 sprintf (symname + (symname[0] != 0), "__start_%s", secname);
1238 e_align = exp_unop (ALIGN_K,
1239 exp_intop ((bfd_vma) 1 << s->alignment_power));
1240 lang_add_assignment (exp_assop ('=', ".", e_align));
1241 lang_add_assignment (exp_assop ('=', symname,
1242 exp_nameop (NAME, ".")));
1246 if (link_info.relocatable || (s->flags & (SEC_LOAD | SEC_ALLOC)) == 0)
1247 address = exp_intop (0);
1250 if (after != NULL && after->load_base != NULL)
1252 etree_type *lma_from_vma;
1253 lma_from_vma = exp_binop ('-', after->load_base,
1254 exp_nameop (ADDR, after->name));
1255 load_base = exp_binop ('+', lma_from_vma,
1256 exp_nameop (ADDR, secname));
1259 os_tail = ((lang_output_section_statement_type **)
1260 lang_output_section_statement.tail);
1261 os = lang_enter_output_section_statement (secname, address, 0, NULL, NULL,
1264 if (add_child == NULL)
1265 add_child = &os->children;
1266 lang_add_section (add_child, s, os, file);
1268 lang_leave_output_section_statement (0, "*default*", NULL, NULL);
1270 if (config.build_constructors && *ps == '\0')
1274 /* lang_leave_ouput_section_statement resets stat_ptr.
1275 Put stat_ptr back where we want it. */
1279 symname = (char *) xmalloc (ps - secname + sizeof "__stop_" + 1);
1280 symname[0] = bfd_get_symbol_leading_char (output_bfd);
1281 sprintf (symname + (symname[0] != 0), "__stop_%s", secname);
1282 lang_add_assignment (exp_assop ('=', symname,
1283 exp_nameop (NAME, ".")));
1286 /* Restore the global list pointer. */
1290 if (after != NULL && os->bfd_section != NULL)
1292 asection *snew, *as;
1294 snew = os->bfd_section;
1296 /* Shuffle the bfd section list to make the output file look
1297 neater. This is really only cosmetic. */
1298 if (place->section == NULL
1299 && after != (&lang_output_section_statement.head
1300 ->output_section_statement))
1302 asection *bfd_section = after->bfd_section;
1304 /* If the output statement hasn't been used to place any input
1305 sections (and thus doesn't have an output bfd_section),
1306 look for the closest prior output statement having an
1308 if (bfd_section == NULL)
1309 bfd_section = output_prev_sec_find (after);
1311 if (bfd_section != NULL && bfd_section != snew)
1312 place->section = &bfd_section->next;
1315 if (place->section == NULL)
1316 place->section = &output_bfd->sections;
1318 as = *place->section;
1319 if (as != snew && as->prev != snew)
1321 /* Unlink the section. */
1322 bfd_section_list_remove (output_bfd, snew);
1324 /* Now tack it back on in the right place. */
1325 bfd_section_list_insert_before (output_bfd, as, snew);
1328 /* Save the end of this list. Further ophans of this type will
1329 follow the one we've just added. */
1330 place->section = &snew->next;
1332 /* The following is non-cosmetic. We try to put the output
1333 statements in some sort of reasonable order here, because they
1334 determine the final load addresses of the orphan sections.
1335 In addition, placing output statements in the wrong order may
1336 require extra segments. For instance, given a typical
1337 situation of all read-only sections placed in one segment and
1338 following that a segment containing all the read-write
1339 sections, we wouldn't want to place an orphan read/write
1340 section before or amongst the read-only ones. */
1341 if (add.head != NULL)
1343 lang_output_section_statement_type *newly_added_os;
1345 if (place->stmt == NULL)
1347 lang_statement_union_type **where;
1348 lang_statement_union_type **assign = NULL;
1350 /* Look for a suitable place for the new statement list.
1351 The idea is to skip over anything that might be inside
1352 a SECTIONS {} statement in a script, before we find
1353 another output_section_statement. Assignments to "dot"
1354 before an output section statement are assumed to
1356 for (where = &after->header.next;
1358 where = &(*where)->header.next)
1360 switch ((*where)->header.type)
1362 case lang_assignment_statement_enum:
1365 lang_assignment_statement_type *ass;
1366 ass = &(*where)->assignment_statement;
1367 if (ass->exp->type.node_class != etree_assert
1368 && ass->exp->assign.dst[0] == '.'
1369 && ass->exp->assign.dst[1] == 0)
1373 case lang_wild_statement_enum:
1374 case lang_input_section_enum:
1375 case lang_object_symbols_statement_enum:
1376 case lang_fill_statement_enum:
1377 case lang_data_statement_enum:
1378 case lang_reloc_statement_enum:
1379 case lang_padding_statement_enum:
1380 case lang_constructors_statement_enum:
1383 case lang_output_section_statement_enum:
1386 case lang_input_statement_enum:
1387 case lang_address_statement_enum:
1388 case lang_target_statement_enum:
1389 case lang_output_statement_enum:
1390 case lang_group_statement_enum:
1391 case lang_afile_asection_pair_statement_enum:
1400 place->os_tail = &after->next;
1404 /* Put it after the last orphan statement we added. */
1405 *add.tail = *place->stmt;
1406 *place->stmt = add.head;
1409 /* Fix the global list pointer if we happened to tack our
1410 new list at the tail. */
1411 if (*old->tail == add.head)
1412 old->tail = add.tail;
1414 /* Save the end of this list. */
1415 place->stmt = add.tail;
1417 /* Do the same for the list of output section statements. */
1418 newly_added_os = *os_tail;
1420 newly_added_os->next = *place->os_tail;
1421 *place->os_tail = newly_added_os;
1422 place->os_tail = &newly_added_os->next;
1424 /* Fixing the global list pointer here is a little different.
1425 We added to the list in lang_enter_output_section_statement,
1426 trimmed off the new output_section_statment above when
1427 assigning *os_tail = NULL, but possibly added it back in
1428 the same place when assigning *place->os_tail. */
1429 if (*os_tail == NULL)
1430 lang_output_section_statement.tail
1431 = (lang_statement_union_type **) os_tail;
1438 lang_map_flags (flagword flag)
1440 if (flag & SEC_ALLOC)
1443 if (flag & SEC_CODE)
1446 if (flag & SEC_READONLY)
1449 if (flag & SEC_DATA)
1452 if (flag & SEC_LOAD)
1459 lang_memory_region_type *m;
1462 minfo (_("\nMemory Configuration\n\n"));
1463 fprintf (config.map_file, "%-16s %-18s %-18s %s\n",
1464 _("Name"), _("Origin"), _("Length"), _("Attributes"));
1466 for (m = lang_memory_region_list; m != NULL; m = m->next)
1471 fprintf (config.map_file, "%-16s ", m->name);
1473 sprintf_vma (buf, m->origin);
1474 minfo ("0x%s ", buf);
1482 minfo ("0x%V", m->length);
1483 if (m->flags || m->not_flags)
1491 lang_map_flags (m->flags);
1497 lang_map_flags (m->not_flags);
1504 fprintf (config.map_file, _("\nLinker script and memory map\n\n"));
1506 if (! command_line.reduce_memory_overheads)
1508 obstack_begin (&map_obstack, 1000);
1509 for (p = link_info.input_bfds; p != (bfd *) NULL; p = p->link_next)
1510 bfd_map_over_sections (p, init_map_userdata, 0);
1511 bfd_link_hash_traverse (link_info.hash, sort_def_symbol, 0);
1513 print_statements ();
1517 init_map_userdata (abfd, sec, data)
1518 bfd *abfd ATTRIBUTE_UNUSED;
1520 void *data ATTRIBUTE_UNUSED;
1522 fat_section_userdata_type *new_data
1523 = ((fat_section_userdata_type *) (stat_alloc
1524 (sizeof (fat_section_userdata_type))));
1526 ASSERT (get_userdata (sec) == NULL);
1527 get_userdata (sec) = new_data;
1528 new_data->map_symbol_def_tail = &new_data->map_symbol_def_head;
1532 sort_def_symbol (hash_entry, info)
1533 struct bfd_link_hash_entry *hash_entry;
1534 void *info ATTRIBUTE_UNUSED;
1536 if (hash_entry->type == bfd_link_hash_defined
1537 || hash_entry->type == bfd_link_hash_defweak)
1539 struct fat_user_section_struct *ud;
1540 struct map_symbol_def *def;
1542 ud = get_userdata (hash_entry->u.def.section);
1545 /* ??? What do we have to do to initialize this beforehand? */
1546 /* The first time we get here is bfd_abs_section... */
1547 init_map_userdata (0, hash_entry->u.def.section, 0);
1548 ud = get_userdata (hash_entry->u.def.section);
1550 else if (!ud->map_symbol_def_tail)
1551 ud->map_symbol_def_tail = &ud->map_symbol_def_head;
1553 def = obstack_alloc (&map_obstack, sizeof *def);
1554 def->entry = hash_entry;
1555 *(ud->map_symbol_def_tail) = def;
1556 ud->map_symbol_def_tail = &def->next;
1561 /* Initialize an output section. */
1564 init_os (lang_output_section_statement_type *s)
1566 if (s->bfd_section != NULL)
1569 if (strcmp (s->name, DISCARD_SECTION_NAME) == 0)
1570 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME);
1572 s->bfd_section = bfd_get_section_by_name (output_bfd, s->name);
1573 if (s->bfd_section == NULL)
1574 s->bfd_section = bfd_make_section (output_bfd, s->name);
1575 if (s->bfd_section == NULL)
1577 einfo (_("%P%F: output format %s cannot represent section called %s\n"),
1578 output_bfd->xvec->name, s->name);
1580 s->bfd_section->output_section = s->bfd_section;
1582 /* We initialize an output sections output offset to minus its own
1583 vma to allow us to output a section through itself. */
1584 s->bfd_section->output_offset = 0;
1585 if (!command_line.reduce_memory_overheads)
1587 fat_section_userdata_type *new
1588 = stat_alloc (sizeof (fat_section_userdata_type));
1589 memset (new, 0, sizeof (fat_section_userdata_type));
1590 get_userdata (s->bfd_section) = new;
1594 /* If there is a base address, make sure that any sections it might
1595 mention are initialized. */
1596 if (s->addr_tree != NULL)
1597 exp_init_os (s->addr_tree);
1599 if (s->load_base != NULL)
1600 exp_init_os (s->load_base);
1603 /* Make sure that all output sections mentioned in an expression are
1607 exp_init_os (etree_type *exp)
1609 switch (exp->type.node_class)
1612 exp_init_os (exp->assign.src);
1616 exp_init_os (exp->binary.lhs);
1617 exp_init_os (exp->binary.rhs);
1621 exp_init_os (exp->trinary.cond);
1622 exp_init_os (exp->trinary.lhs);
1623 exp_init_os (exp->trinary.rhs);
1627 exp_init_os (exp->assert_s.child);
1631 exp_init_os (exp->unary.child);
1635 switch (exp->type.node_code)
1641 lang_output_section_statement_type *os;
1643 os = lang_output_section_find (exp->name.name);
1644 if (os != NULL && os->bfd_section == NULL)
1656 section_already_linked (bfd *abfd, asection *sec, void *data)
1658 lang_input_statement_type *entry = data;
1660 /* If we are only reading symbols from this object, then we want to
1661 discard all sections. */
1662 if (entry->just_syms_flag)
1664 bfd_link_just_syms (abfd, sec, &link_info);
1668 if (!(abfd->flags & DYNAMIC))
1669 bfd_section_already_linked (abfd, sec);
1672 /* The wild routines.
1674 These expand statements like *(.text) and foo.o to a list of
1675 explicit actions, like foo.o(.text), bar.o(.text) and
1676 foo.o(.text, .data). */
1678 /* Add SECTION to the output section OUTPUT. Do this by creating a
1679 lang_input_section statement which is placed at PTR. FILE is the
1680 input file which holds SECTION. */
1683 lang_add_section (lang_statement_list_type *ptr,
1685 lang_output_section_statement_type *output,
1686 lang_input_statement_type *file)
1688 flagword flags = section->flags;
1689 bfd_boolean discard;
1691 /* Discard sections marked with SEC_EXCLUDE. */
1692 discard = (flags & SEC_EXCLUDE) != 0;
1694 /* Discard input sections which are assigned to a section named
1695 DISCARD_SECTION_NAME. */
1696 if (strcmp (output->name, DISCARD_SECTION_NAME) == 0)
1699 /* Discard debugging sections if we are stripping debugging
1701 if ((link_info.strip == strip_debugger || link_info.strip == strip_all)
1702 && (flags & SEC_DEBUGGING) != 0)
1707 if (section->output_section == NULL)
1709 /* This prevents future calls from assigning this section. */
1710 section->output_section = bfd_abs_section_ptr;
1715 if (section->output_section == NULL)
1718 lang_input_section_type *new;
1721 if (output->bfd_section == NULL)
1724 first = ! output->bfd_section->linker_has_input;
1725 output->bfd_section->linker_has_input = 1;
1727 if (!link_info.relocatable
1728 && !stripped_excluded_sections)
1730 asection *s = output->bfd_section->map_tail.s;
1731 output->bfd_section->map_tail.s = section;
1732 section->map_head.s = NULL;
1733 section->map_tail.s = s;
1735 s->map_head.s = section;
1737 output->bfd_section->map_head.s = section;
1740 /* Add a section reference to the list. */
1741 new = new_stat (lang_input_section, ptr);
1743 new->section = section;
1745 section->output_section = output->bfd_section;
1747 flags = section->flags;
1749 /* We don't copy the SEC_NEVER_LOAD flag from an input section
1750 to an output section, because we want to be able to include a
1751 SEC_NEVER_LOAD section in the middle of an otherwise loaded
1752 section (I don't know why we want to do this, but we do).
1753 build_link_order in ldwrite.c handles this case by turning
1754 the embedded SEC_NEVER_LOAD section into a fill. */
1756 flags &= ~ SEC_NEVER_LOAD;
1758 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
1759 already been processed. One reason to do this is that on pe
1760 format targets, .text$foo sections go into .text and it's odd
1761 to see .text with SEC_LINK_ONCE set. */
1763 if (! link_info.relocatable)
1764 flags &= ~ (SEC_LINK_ONCE | SEC_LINK_DUPLICATES);
1766 /* If this is not the first input section, and the SEC_READONLY
1767 flag is not currently set, then don't set it just because the
1768 input section has it set. */
1770 if (! first && (output->bfd_section->flags & SEC_READONLY) == 0)
1771 flags &= ~ SEC_READONLY;
1773 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
1775 && ((output->bfd_section->flags & (SEC_MERGE | SEC_STRINGS))
1776 != (flags & (SEC_MERGE | SEC_STRINGS))
1777 || ((flags & SEC_MERGE)
1778 && output->bfd_section->entsize != section->entsize)))
1780 output->bfd_section->flags &= ~ (SEC_MERGE | SEC_STRINGS);
1781 flags &= ~ (SEC_MERGE | SEC_STRINGS);
1784 output->bfd_section->flags |= flags;
1786 if (flags & SEC_MERGE)
1787 output->bfd_section->entsize = section->entsize;
1789 /* If SEC_READONLY is not set in the input section, then clear
1790 it from the output section. */
1791 if ((section->flags & SEC_READONLY) == 0)
1792 output->bfd_section->flags &= ~SEC_READONLY;
1794 switch (output->sectype)
1796 case normal_section:
1801 case overlay_section:
1802 output->bfd_section->flags &= ~SEC_ALLOC;
1804 case noload_section:
1805 output->bfd_section->flags &= ~SEC_LOAD;
1806 output->bfd_section->flags |= SEC_NEVER_LOAD;
1810 /* Copy over SEC_SMALL_DATA. */
1811 if (section->flags & SEC_SMALL_DATA)
1812 output->bfd_section->flags |= SEC_SMALL_DATA;
1814 if (section->alignment_power > output->bfd_section->alignment_power)
1815 output->bfd_section->alignment_power = section->alignment_power;
1817 /* If supplied an alignment, then force it. */
1818 if (output->section_alignment != -1)
1819 output->bfd_section->alignment_power = output->section_alignment;
1821 if (bfd_get_arch (section->owner) == bfd_arch_tic54x
1822 && (section->flags & SEC_TIC54X_BLOCK) != 0)
1824 output->bfd_section->flags |= SEC_TIC54X_BLOCK;
1825 /* FIXME: This value should really be obtained from the bfd... */
1826 output->block_value = 128;
1831 /* Compare sections ASEC and BSEC according to SORT. */
1834 compare_section (sort_type sort, asection *asec, asection *bsec)
1843 case by_alignment_name:
1844 ret = (bfd_section_alignment (bsec->owner, bsec)
1845 - bfd_section_alignment (asec->owner, asec));
1851 ret = strcmp (bfd_get_section_name (asec->owner, asec),
1852 bfd_get_section_name (bsec->owner, bsec));
1855 case by_name_alignment:
1856 ret = strcmp (bfd_get_section_name (asec->owner, asec),
1857 bfd_get_section_name (bsec->owner, bsec));
1863 ret = (bfd_section_alignment (bsec->owner, bsec)
1864 - bfd_section_alignment (asec->owner, asec));
1871 /* Handle wildcard sorting. This returns the lang_input_section which
1872 should follow the one we are going to create for SECTION and FILE,
1873 based on the sorting requirements of WILD. It returns NULL if the
1874 new section should just go at the end of the current list. */
1876 static lang_statement_union_type *
1877 wild_sort (lang_wild_statement_type *wild,
1878 struct wildcard_list *sec,
1879 lang_input_statement_type *file,
1882 const char *section_name;
1883 lang_statement_union_type *l;
1885 if (!wild->filenames_sorted
1886 && (sec == NULL || sec->spec.sorted == none))
1889 section_name = bfd_get_section_name (file->the_bfd, section);
1890 for (l = wild->children.head; l != NULL; l = l->header.next)
1892 lang_input_section_type *ls;
1894 if (l->header.type != lang_input_section_enum)
1896 ls = &l->input_section;
1898 /* Sorting by filename takes precedence over sorting by section
1901 if (wild->filenames_sorted)
1903 const char *fn, *ln;
1907 /* The PE support for the .idata section as generated by
1908 dlltool assumes that files will be sorted by the name of
1909 the archive and then the name of the file within the
1912 if (file->the_bfd != NULL
1913 && bfd_my_archive (file->the_bfd) != NULL)
1915 fn = bfd_get_filename (bfd_my_archive (file->the_bfd));
1920 fn = file->filename;
1924 if (ls->ifile->the_bfd != NULL
1925 && bfd_my_archive (ls->ifile->the_bfd) != NULL)
1927 ln = bfd_get_filename (bfd_my_archive (ls->ifile->the_bfd));
1932 ln = ls->ifile->filename;
1936 i = strcmp (fn, ln);
1945 fn = file->filename;
1947 ln = ls->ifile->filename;
1949 i = strcmp (fn, ln);
1957 /* Here either the files are not sorted by name, or we are
1958 looking at the sections for this file. */
1960 if (sec != NULL && sec->spec.sorted != none)
1962 if (compare_section (sec->spec.sorted, section,
1971 /* Expand a wild statement for a particular FILE. SECTION may be
1972 NULL, in which case it is a wild card. */
1975 output_section_callback (lang_wild_statement_type *ptr,
1976 struct wildcard_list *sec,
1978 lang_input_statement_type *file,
1981 lang_statement_union_type *before;
1983 /* Exclude sections that match UNIQUE_SECTION_LIST. */
1984 if (unique_section_p (section))
1987 before = wild_sort (ptr, sec, file, section);
1989 /* Here BEFORE points to the lang_input_section which
1990 should follow the one we are about to add. If BEFORE
1991 is NULL, then the section should just go at the end
1992 of the current list. */
1995 lang_add_section (&ptr->children, section,
1996 (lang_output_section_statement_type *) output,
2000 lang_statement_list_type list;
2001 lang_statement_union_type **pp;
2003 lang_list_init (&list);
2004 lang_add_section (&list, section,
2005 (lang_output_section_statement_type *) output,
2008 /* If we are discarding the section, LIST.HEAD will
2010 if (list.head != NULL)
2012 ASSERT (list.head->header.next == NULL);
2014 for (pp = &ptr->children.head;
2016 pp = &(*pp)->header.next)
2017 ASSERT (*pp != NULL);
2019 list.head->header.next = *pp;
2025 /* Check if all sections in a wild statement for a particular FILE
2029 check_section_callback (lang_wild_statement_type *ptr ATTRIBUTE_UNUSED,
2030 struct wildcard_list *sec ATTRIBUTE_UNUSED,
2032 lang_input_statement_type *file ATTRIBUTE_UNUSED,
2035 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2036 if (unique_section_p (section))
2039 if (section->output_section == NULL && (section->flags & SEC_READONLY) == 0)
2040 ((lang_output_section_statement_type *) data)->all_input_readonly = FALSE;
2043 /* This is passed a file name which must have been seen already and
2044 added to the statement tree. We will see if it has been opened
2045 already and had its symbols read. If not then we'll read it. */
2047 static lang_input_statement_type *
2048 lookup_name (const char *name)
2050 lang_input_statement_type *search;
2052 for (search = (lang_input_statement_type *) input_file_chain.head;
2054 search = (lang_input_statement_type *) search->next_real_file)
2056 /* Use the local_sym_name as the name of the file that has
2057 already been loaded as filename might have been transformed
2058 via the search directory lookup mechanism. */
2059 const char * filename = search->local_sym_name;
2061 if (filename == NULL && name == NULL)
2063 if (filename != NULL
2065 && strcmp (filename, name) == 0)
2070 search = new_afile (name, lang_input_file_is_search_file_enum,
2071 default_target, FALSE);
2073 /* If we have already added this file, or this file is not real
2074 (FIXME: can that ever actually happen?) or the name is NULL
2075 (FIXME: can that ever actually happen?) don't add this file. */
2078 || search->filename == NULL)
2081 if (! load_symbols (search, NULL))
2087 /* Save LIST as a list of libraries whose symbols should not be exported. */
2092 struct excluded_lib *next;
2094 static struct excluded_lib *excluded_libs;
2097 add_excluded_libs (const char *list)
2099 const char *p = list, *end;
2103 struct excluded_lib *entry;
2104 end = strpbrk (p, ",:");
2106 end = p + strlen (p);
2107 entry = xmalloc (sizeof (*entry));
2108 entry->next = excluded_libs;
2109 entry->name = xmalloc (end - p + 1);
2110 memcpy (entry->name, p, end - p);
2111 entry->name[end - p] = '\0';
2112 excluded_libs = entry;
2120 check_excluded_libs (bfd *abfd)
2122 struct excluded_lib *lib = excluded_libs;
2126 int len = strlen (lib->name);
2127 const char *filename = lbasename (abfd->filename);
2129 if (strcmp (lib->name, "ALL") == 0)
2131 abfd->no_export = TRUE;
2135 if (strncmp (lib->name, filename, len) == 0
2136 && (filename[len] == '\0'
2137 || (filename[len] == '.' && filename[len + 1] == 'a'
2138 && filename[len + 2] == '\0')))
2140 abfd->no_export = TRUE;
2148 /* Get the symbols for an input file. */
2151 load_symbols (lang_input_statement_type *entry,
2152 lang_statement_list_type *place)
2159 ldfile_open_file (entry);
2161 if (! bfd_check_format (entry->the_bfd, bfd_archive)
2162 && ! bfd_check_format_matches (entry->the_bfd, bfd_object, &matching))
2165 lang_statement_list_type *hold;
2166 bfd_boolean bad_load = TRUE;
2167 bfd_boolean save_ldlang_sysrooted_script;
2169 err = bfd_get_error ();
2171 /* See if the emulation has some special knowledge. */
2172 if (ldemul_unrecognized_file (entry))
2175 if (err == bfd_error_file_ambiguously_recognized)
2179 einfo (_("%B: file not recognized: %E\n"), entry->the_bfd);
2180 einfo (_("%B: matching formats:"), entry->the_bfd);
2181 for (p = matching; *p != NULL; p++)
2185 else if (err != bfd_error_file_not_recognized
2187 einfo (_("%F%B: file not recognized: %E\n"), entry->the_bfd);
2191 bfd_close (entry->the_bfd);
2192 entry->the_bfd = NULL;
2194 /* Try to interpret the file as a linker script. */
2195 ldfile_open_command_file (entry->filename);
2199 save_ldlang_sysrooted_script = ldlang_sysrooted_script;
2200 ldlang_sysrooted_script = entry->sysrooted;
2202 ldfile_assumed_script = TRUE;
2203 parser_input = input_script;
2204 /* We want to use the same -Bdynamic/-Bstatic as the one for
2206 config.dynamic_link = entry->dynamic;
2208 ldfile_assumed_script = FALSE;
2210 ldlang_sysrooted_script = save_ldlang_sysrooted_script;
2216 if (ldemul_recognized_file (entry))
2219 /* We don't call ldlang_add_file for an archive. Instead, the
2220 add_symbols entry point will call ldlang_add_file, via the
2221 add_archive_element callback, for each element of the archive
2223 switch (bfd_get_format (entry->the_bfd))
2229 ldlang_add_file (entry);
2230 if (trace_files || trace_file_tries)
2231 info_msg ("%I\n", entry);
2235 check_excluded_libs (entry->the_bfd);
2237 if (entry->whole_archive)
2240 bfd_boolean loaded = TRUE;
2244 member = bfd_openr_next_archived_file (entry->the_bfd, member);
2249 if (! bfd_check_format (member, bfd_object))
2251 einfo (_("%F%B: member %B in archive is not an object\n"),
2252 entry->the_bfd, member);
2256 if (! ((*link_info.callbacks->add_archive_element)
2257 (&link_info, member, "--whole-archive")))
2260 if (! bfd_link_add_symbols (member, &link_info))
2262 einfo (_("%F%B: could not read symbols: %E\n"), member);
2267 entry->loaded = loaded;
2273 if (bfd_link_add_symbols (entry->the_bfd, &link_info))
2274 entry->loaded = TRUE;
2276 einfo (_("%F%B: could not read symbols: %E\n"), entry->the_bfd);
2278 return entry->loaded;
2281 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2282 may be NULL, indicating that it is a wildcard. Separate
2283 lang_input_section statements are created for each part of the
2284 expansion; they are added after the wild statement S. OUTPUT is
2285 the output section. */
2288 wild (lang_wild_statement_type *s,
2289 const char *target ATTRIBUTE_UNUSED,
2290 lang_output_section_statement_type *output)
2292 struct wildcard_list *sec;
2294 walk_wild (s, output_section_callback, output);
2296 for (sec = s->section_list; sec != NULL; sec = sec->next)
2298 if (default_common_section != NULL)
2300 if (sec->spec.name != NULL && strcmp (sec->spec.name, "COMMON") == 0)
2302 /* Remember the section that common is going to in case we
2303 later get something which doesn't know where to put it. */
2304 default_common_section = output;
2309 /* Return TRUE iff target is the sought target. */
2312 get_target (const bfd_target *target, void *data)
2314 const char *sought = data;
2316 return strcmp (target->name, sought) == 0;
2319 /* Like strcpy() but convert to lower case as well. */
2322 stricpy (char *dest, char *src)
2326 while ((c = *src++) != 0)
2327 *dest++ = TOLOWER (c);
2332 /* Remove the first occurrence of needle (if any) in haystack
2336 strcut (char *haystack, char *needle)
2338 haystack = strstr (haystack, needle);
2344 for (src = haystack + strlen (needle); *src;)
2345 *haystack++ = *src++;
2351 /* Compare two target format name strings.
2352 Return a value indicating how "similar" they are. */
2355 name_compare (char *first, char *second)
2361 copy1 = xmalloc (strlen (first) + 1);
2362 copy2 = xmalloc (strlen (second) + 1);
2364 /* Convert the names to lower case. */
2365 stricpy (copy1, first);
2366 stricpy (copy2, second);
2368 /* Remove size and endian strings from the name. */
2369 strcut (copy1, "big");
2370 strcut (copy1, "little");
2371 strcut (copy2, "big");
2372 strcut (copy2, "little");
2374 /* Return a value based on how many characters match,
2375 starting from the beginning. If both strings are
2376 the same then return 10 * their length. */
2377 for (result = 0; copy1[result] == copy2[result]; result++)
2378 if (copy1[result] == 0)
2390 /* Set by closest_target_match() below. */
2391 static const bfd_target *winner;
2393 /* Scan all the valid bfd targets looking for one that has the endianness
2394 requirement that was specified on the command line, and is the nearest
2395 match to the original output target. */
2398 closest_target_match (const bfd_target *target, void *data)
2400 const bfd_target *original = data;
2402 if (command_line.endian == ENDIAN_BIG
2403 && target->byteorder != BFD_ENDIAN_BIG)
2406 if (command_line.endian == ENDIAN_LITTLE
2407 && target->byteorder != BFD_ENDIAN_LITTLE)
2410 /* Must be the same flavour. */
2411 if (target->flavour != original->flavour)
2414 /* If we have not found a potential winner yet, then record this one. */
2421 /* Oh dear, we now have two potential candidates for a successful match.
2422 Compare their names and choose the better one. */
2423 if (name_compare (target->name, original->name)
2424 > name_compare (winner->name, original->name))
2427 /* Keep on searching until wqe have checked them all. */
2431 /* Return the BFD target format of the first input file. */
2434 get_first_input_target (void)
2436 char *target = NULL;
2438 LANG_FOR_EACH_INPUT_STATEMENT (s)
2440 if (s->header.type == lang_input_statement_enum
2443 ldfile_open_file (s);
2445 if (s->the_bfd != NULL
2446 && bfd_check_format (s->the_bfd, bfd_object))
2448 target = bfd_get_target (s->the_bfd);
2460 lang_get_output_target (void)
2464 /* Has the user told us which output format to use? */
2465 if (output_target != NULL)
2466 return output_target;
2468 /* No - has the current target been set to something other than
2470 if (current_target != default_target)
2471 return current_target;
2473 /* No - can we determine the format of the first input file? */
2474 target = get_first_input_target ();
2478 /* Failed - use the default output target. */
2479 return default_target;
2482 /* Open the output file. */
2485 open_output (const char *name)
2489 output_target = lang_get_output_target ();
2491 /* Has the user requested a particular endianness on the command
2493 if (command_line.endian != ENDIAN_UNSET)
2495 const bfd_target *target;
2496 enum bfd_endian desired_endian;
2498 /* Get the chosen target. */
2499 target = bfd_search_for_target (get_target, (void *) output_target);
2501 /* If the target is not supported, we cannot do anything. */
2504 if (command_line.endian == ENDIAN_BIG)
2505 desired_endian = BFD_ENDIAN_BIG;
2507 desired_endian = BFD_ENDIAN_LITTLE;
2509 /* See if the target has the wrong endianness. This should
2510 not happen if the linker script has provided big and
2511 little endian alternatives, but some scrips don't do
2513 if (target->byteorder != desired_endian)
2515 /* If it does, then see if the target provides
2516 an alternative with the correct endianness. */
2517 if (target->alternative_target != NULL
2518 && (target->alternative_target->byteorder == desired_endian))
2519 output_target = target->alternative_target->name;
2522 /* Try to find a target as similar as possible to
2523 the default target, but which has the desired
2524 endian characteristic. */
2525 bfd_search_for_target (closest_target_match,
2528 /* Oh dear - we could not find any targets that
2529 satisfy our requirements. */
2531 einfo (_("%P: warning: could not find any targets"
2532 " that match endianness requirement\n"));
2534 output_target = winner->name;
2540 output = bfd_openw (name, output_target);
2544 if (bfd_get_error () == bfd_error_invalid_target)
2545 einfo (_("%P%F: target %s not found\n"), output_target);
2547 einfo (_("%P%F: cannot open output file %s: %E\n"), name);
2550 delete_output_file_on_failure = TRUE;
2552 if (! bfd_set_format (output, bfd_object))
2553 einfo (_("%P%F:%s: can not make object file: %E\n"), name);
2554 if (! bfd_set_arch_mach (output,
2555 ldfile_output_architecture,
2556 ldfile_output_machine))
2557 einfo (_("%P%F:%s: can not set architecture: %E\n"), name);
2559 link_info.hash = bfd_link_hash_table_create (output);
2560 if (link_info.hash == NULL)
2561 einfo (_("%P%F: can not create link hash table: %E\n"));
2563 bfd_set_gp_size (output, g_switch_value);
2568 ldlang_open_output (lang_statement_union_type *statement)
2570 switch (statement->header.type)
2572 case lang_output_statement_enum:
2573 ASSERT (output_bfd == NULL);
2574 output_bfd = open_output (statement->output_statement.name);
2575 ldemul_set_output_arch ();
2576 if (config.magic_demand_paged && !link_info.relocatable)
2577 output_bfd->flags |= D_PAGED;
2579 output_bfd->flags &= ~D_PAGED;
2580 if (config.text_read_only)
2581 output_bfd->flags |= WP_TEXT;
2583 output_bfd->flags &= ~WP_TEXT;
2584 if (link_info.traditional_format)
2585 output_bfd->flags |= BFD_TRADITIONAL_FORMAT;
2587 output_bfd->flags &= ~BFD_TRADITIONAL_FORMAT;
2590 case lang_target_statement_enum:
2591 current_target = statement->target_statement.target;
2598 /* Convert between addresses in bytes and sizes in octets.
2599 For currently supported targets, octets_per_byte is always a power
2600 of two, so we can use shifts. */
2601 #define TO_ADDR(X) ((X) >> opb_shift)
2602 #define TO_SIZE(X) ((X) << opb_shift)
2604 /* Support the above. */
2605 static unsigned int opb_shift = 0;
2610 unsigned x = bfd_arch_mach_octets_per_byte (ldfile_output_architecture,
2611 ldfile_output_machine);
2614 while ((x & 1) == 0)
2622 /* Open all the input files. */
2625 open_input_bfds (lang_statement_union_type *s, bfd_boolean force)
2627 for (; s != NULL; s = s->header.next)
2629 switch (s->header.type)
2631 case lang_constructors_statement_enum:
2632 open_input_bfds (constructor_list.head, force);
2634 case lang_output_section_statement_enum:
2635 open_input_bfds (s->output_section_statement.children.head, force);
2637 case lang_wild_statement_enum:
2638 /* Maybe we should load the file's symbols. */
2639 if (s->wild_statement.filename
2640 && ! wildcardp (s->wild_statement.filename))
2641 lookup_name (s->wild_statement.filename);
2642 open_input_bfds (s->wild_statement.children.head, force);
2644 case lang_group_statement_enum:
2646 struct bfd_link_hash_entry *undefs;
2648 /* We must continually search the entries in the group
2649 until no new symbols are added to the list of undefined
2654 undefs = link_info.hash->undefs_tail;
2655 open_input_bfds (s->group_statement.children.head, TRUE);
2657 while (undefs != link_info.hash->undefs_tail);
2660 case lang_target_statement_enum:
2661 current_target = s->target_statement.target;
2663 case lang_input_statement_enum:
2664 if (s->input_statement.real)
2666 lang_statement_list_type add;
2668 s->input_statement.target = current_target;
2670 /* If we are being called from within a group, and this
2671 is an archive which has already been searched, then
2672 force it to be researched unless the whole archive
2673 has been loaded already. */
2675 && !s->input_statement.whole_archive
2676 && s->input_statement.loaded
2677 && bfd_check_format (s->input_statement.the_bfd,
2679 s->input_statement.loaded = FALSE;
2681 lang_list_init (&add);
2683 if (! load_symbols (&s->input_statement, &add))
2684 config.make_executable = FALSE;
2686 if (add.head != NULL)
2688 *add.tail = s->header.next;
2689 s->header.next = add.head;
2699 /* Add a symbol to a hash of symbols used in DEFINED (NAME) expressions. */
2702 lang_track_definedness (const char *name)
2704 if (bfd_hash_lookup (&lang_definedness_table, name, TRUE, FALSE) == NULL)
2705 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name);
2708 /* New-function for the definedness hash table. */
2710 static struct bfd_hash_entry *
2711 lang_definedness_newfunc (struct bfd_hash_entry *entry,
2712 struct bfd_hash_table *table ATTRIBUTE_UNUSED,
2713 const char *name ATTRIBUTE_UNUSED)
2715 struct lang_definedness_hash_entry *ret
2716 = (struct lang_definedness_hash_entry *) entry;
2719 ret = (struct lang_definedness_hash_entry *)
2720 bfd_hash_allocate (table, sizeof (struct lang_definedness_hash_entry));
2723 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name);
2725 ret->iteration = -1;
2729 /* Return the iteration when the definition of NAME was last updated. A
2730 value of -1 means that the symbol is not defined in the linker script
2731 or the command line, but may be defined in the linker symbol table. */
2734 lang_symbol_definition_iteration (const char *name)
2736 struct lang_definedness_hash_entry *defentry
2737 = (struct lang_definedness_hash_entry *)
2738 bfd_hash_lookup (&lang_definedness_table, name, FALSE, FALSE);
2740 /* We've already created this one on the presence of DEFINED in the
2741 script, so it can't be NULL unless something is borked elsewhere in
2743 if (defentry == NULL)
2746 return defentry->iteration;
2749 /* Update the definedness state of NAME. */
2752 lang_update_definedness (const char *name, struct bfd_link_hash_entry *h)
2754 struct lang_definedness_hash_entry *defentry
2755 = (struct lang_definedness_hash_entry *)
2756 bfd_hash_lookup (&lang_definedness_table, name, FALSE, FALSE);
2758 /* We don't keep track of symbols not tested with DEFINED. */
2759 if (defentry == NULL)
2762 /* If the symbol was already defined, and not from an earlier statement
2763 iteration, don't update the definedness iteration, because that'd
2764 make the symbol seem defined in the linker script at this point, and
2765 it wasn't; it was defined in some object. If we do anyway, DEFINED
2766 would start to yield false before this point and the construct "sym =
2767 DEFINED (sym) ? sym : X;" would change sym to X despite being defined
2769 if (h->type != bfd_link_hash_undefined
2770 && h->type != bfd_link_hash_common
2771 && h->type != bfd_link_hash_new
2772 && defentry->iteration == -1)
2775 defentry->iteration = lang_statement_iteration;
2778 /* Add the supplied name to the symbol table as an undefined reference.
2779 This is a two step process as the symbol table doesn't even exist at
2780 the time the ld command line is processed. First we put the name
2781 on a list, then, once the output file has been opened, transfer the
2782 name to the symbol table. */
2784 typedef struct bfd_sym_chain ldlang_undef_chain_list_type;
2786 #define ldlang_undef_chain_list_head entry_symbol.next
2789 ldlang_add_undef (const char *const name)
2791 ldlang_undef_chain_list_type *new =
2792 stat_alloc (sizeof (ldlang_undef_chain_list_type));
2794 new->next = ldlang_undef_chain_list_head;
2795 ldlang_undef_chain_list_head = new;
2797 new->name = xstrdup (name);
2799 if (output_bfd != NULL)
2800 insert_undefined (new->name);
2803 /* Insert NAME as undefined in the symbol table. */
2806 insert_undefined (const char *name)
2808 struct bfd_link_hash_entry *h;
2810 h = bfd_link_hash_lookup (link_info.hash, name, TRUE, FALSE, TRUE);
2812 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
2813 if (h->type == bfd_link_hash_new)
2815 h->type = bfd_link_hash_undefined;
2816 h->u.undef.abfd = NULL;
2817 bfd_link_add_undef (link_info.hash, h);
2821 /* Run through the list of undefineds created above and place them
2822 into the linker hash table as undefined symbols belonging to the
2826 lang_place_undefineds (void)
2828 ldlang_undef_chain_list_type *ptr;
2830 for (ptr = ldlang_undef_chain_list_head; ptr != NULL; ptr = ptr->next)
2831 insert_undefined (ptr->name);
2834 /* Check for all readonly or some readwrite sections. */
2837 check_input_sections
2838 (lang_statement_union_type *s,
2839 lang_output_section_statement_type *output_section_statement)
2841 for (; s != (lang_statement_union_type *) NULL; s = s->header.next)
2843 switch (s->header.type)
2845 case lang_wild_statement_enum:
2846 walk_wild (&s->wild_statement, check_section_callback,
2847 output_section_statement);
2848 if (! output_section_statement->all_input_readonly)
2851 case lang_constructors_statement_enum:
2852 check_input_sections (constructor_list.head,
2853 output_section_statement);
2854 if (! output_section_statement->all_input_readonly)
2857 case lang_group_statement_enum:
2858 check_input_sections (s->group_statement.children.head,
2859 output_section_statement);
2860 if (! output_section_statement->all_input_readonly)
2869 /* Update wildcard statements if needed. */
2872 update_wild_statements (lang_statement_union_type *s)
2874 struct wildcard_list *sec;
2876 switch (sort_section)
2886 for (; s != NULL; s = s->header.next)
2888 switch (s->header.type)
2893 case lang_wild_statement_enum:
2894 sec = s->wild_statement.section_list;
2897 switch (sec->spec.sorted)
2900 sec->spec.sorted = sort_section;
2903 if (sort_section == by_alignment)
2904 sec->spec.sorted = by_name_alignment;
2907 if (sort_section == by_name)
2908 sec->spec.sorted = by_alignment_name;
2916 case lang_constructors_statement_enum:
2917 update_wild_statements (constructor_list.head);
2920 case lang_output_section_statement_enum:
2921 update_wild_statements
2922 (s->output_section_statement.children.head);
2925 case lang_group_statement_enum:
2926 update_wild_statements (s->group_statement.children.head);
2934 /* Open input files and attach to output sections. */
2937 map_input_to_output_sections
2938 (lang_statement_union_type *s, const char *target,
2939 lang_output_section_statement_type *os)
2941 for (; s != NULL; s = s->header.next)
2943 switch (s->header.type)
2945 case lang_wild_statement_enum:
2946 wild (&s->wild_statement, target, os);
2948 case lang_constructors_statement_enum:
2949 map_input_to_output_sections (constructor_list.head,
2953 case lang_output_section_statement_enum:
2954 if (s->output_section_statement.constraint)
2956 if (s->output_section_statement.constraint != ONLY_IF_RW
2957 && s->output_section_statement.constraint != ONLY_IF_RO)
2959 s->output_section_statement.all_input_readonly = TRUE;
2960 check_input_sections (s->output_section_statement.children.head,
2961 &s->output_section_statement);
2962 if ((s->output_section_statement.all_input_readonly
2963 && s->output_section_statement.constraint == ONLY_IF_RW)
2964 || (!s->output_section_statement.all_input_readonly
2965 && s->output_section_statement.constraint == ONLY_IF_RO))
2967 s->output_section_statement.constraint = -1;
2972 map_input_to_output_sections (s->output_section_statement.children.head,
2974 &s->output_section_statement);
2976 case lang_output_statement_enum:
2978 case lang_target_statement_enum:
2979 target = s->target_statement.target;
2981 case lang_group_statement_enum:
2982 map_input_to_output_sections (s->group_statement.children.head,
2986 case lang_data_statement_enum:
2987 /* Make sure that any sections mentioned in the expression
2989 exp_init_os (s->data_statement.exp);
2990 if (os != NULL && os->bfd_section == NULL)
2992 /* The output section gets contents, and then we inspect for
2993 any flags set in the input script which override any ALLOC. */
2994 os->bfd_section->flags |= SEC_HAS_CONTENTS;
2995 if (!(os->flags & SEC_NEVER_LOAD))
2996 os->bfd_section->flags |= SEC_ALLOC | SEC_LOAD;
2998 case lang_fill_statement_enum:
2999 case lang_input_section_enum:
3000 case lang_object_symbols_statement_enum:
3001 case lang_reloc_statement_enum:
3002 case lang_padding_statement_enum:
3003 case lang_input_statement_enum:
3004 if (os != NULL && os->bfd_section == NULL)
3007 case lang_assignment_statement_enum:
3008 if (os != NULL && os->bfd_section == NULL)
3011 /* Make sure that any sections mentioned in the assignment
3013 exp_init_os (s->assignment_statement.exp);
3015 case lang_afile_asection_pair_statement_enum:
3018 case lang_address_statement_enum:
3019 /* Mark the specified section with the supplied address.
3021 If this section was actually a segment marker, then the
3022 directive is ignored if the linker script explicitly
3023 processed the segment marker. Originally, the linker
3024 treated segment directives (like -Ttext on the
3025 command-line) as section directives. We honor the
3026 section directive semantics for backwards compatibilty;
3027 linker scripts that do not specifically check for
3028 SEGMENT_START automatically get the old semantics. */
3029 if (!s->address_statement.segment
3030 || !s->address_statement.segment->used)
3032 lang_output_section_statement_type *aos
3033 = (lang_output_section_statement_lookup
3034 (s->address_statement.section_name));
3036 if (aos->bfd_section == NULL)
3038 aos->addr_tree = s->address_statement.address;
3045 /* An output section might have been removed after its statement was
3046 added. For example, ldemul_before_allocation can remove dynamic
3047 sections if they turn out to be not needed. Clean them up here. */
3050 strip_excluded_output_sections (void)
3052 lang_output_section_statement_type *os;
3054 for (os = &lang_output_section_statement.head->output_section_statement;
3060 if (os->constraint == -1)
3063 if (os->bfd_section == NULL || os->bfd_section->map_head.s == NULL)
3066 for (s = os->bfd_section->map_head.s; s != NULL; s = s->map_head.s)
3067 if ((s->flags & SEC_EXCLUDE) == 0)
3070 os->bfd_section->map_head.link_order = NULL;
3071 os->bfd_section->map_tail.link_order = NULL;
3075 s = os->bfd_section;
3076 os->bfd_section = NULL;
3077 if (!bfd_section_removed_from_list (output_bfd, s))
3079 bfd_section_list_remove (output_bfd, s);
3080 output_bfd->section_count--;
3085 /* Stop future calls to lang_add_section from messing with map_head
3086 and map_tail link_order fields. */
3087 stripped_excluded_sections = TRUE;
3091 print_output_section_statement
3092 (lang_output_section_statement_type *output_section_statement)
3094 asection *section = output_section_statement->bfd_section;
3097 if (output_section_statement != abs_output_section)
3099 minfo ("\n%s", output_section_statement->name);
3101 if (section != NULL)
3103 print_dot = section->vma;
3105 len = strlen (output_section_statement->name);
3106 if (len >= SECTION_NAME_MAP_LENGTH - 1)
3111 while (len < SECTION_NAME_MAP_LENGTH)
3117 minfo ("0x%V %W", section->vma, section->size);
3119 if (output_section_statement->load_base != NULL)
3123 addr = exp_get_abs_int (output_section_statement->load_base, 0,
3124 "load base", lang_final_phase_enum);
3125 minfo (_(" load address 0x%V"), addr);
3132 print_statement_list (output_section_statement->children.head,
3133 output_section_statement);
3136 /* Scan for the use of the destination in the right hand side
3137 of an expression. In such cases we will not compute the
3138 correct expression, since the value of DST that is used on
3139 the right hand side will be its final value, not its value
3140 just before this expression is evaluated. */
3143 scan_for_self_assignment (const char * dst, etree_type * rhs)
3145 if (rhs == NULL || dst == NULL)
3148 switch (rhs->type.node_class)
3151 return scan_for_self_assignment (dst, rhs->binary.lhs)
3152 || scan_for_self_assignment (dst, rhs->binary.rhs);
3155 return scan_for_self_assignment (dst, rhs->trinary.lhs)
3156 || scan_for_self_assignment (dst, rhs->trinary.rhs);
3159 case etree_provided:
3161 if (strcmp (dst, rhs->assign.dst) == 0)
3163 return scan_for_self_assignment (dst, rhs->assign.src);
3166 return scan_for_self_assignment (dst, rhs->unary.child);
3170 return strcmp (dst, rhs->value.str) == 0;
3175 return strcmp (dst, rhs->name.name) == 0;
3187 print_assignment (lang_assignment_statement_type *assignment,
3188 lang_output_section_statement_type *output_section)
3192 bfd_boolean computation_is_valid = TRUE;
3194 etree_value_type result;
3196 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
3199 if (assignment->exp->type.node_class == etree_assert)
3202 tree = assignment->exp->assert_s.child;
3203 computation_is_valid = TRUE;
3207 const char *dst = assignment->exp->assign.dst;
3209 is_dot = (dst[0] == '.' && dst[1] == 0);
3210 tree = assignment->exp->assign.src;
3211 computation_is_valid = is_dot || (scan_for_self_assignment (dst, tree) == FALSE);
3214 result = exp_fold_tree (tree, output_section, lang_final_phase_enum,
3215 print_dot, &print_dot);
3220 if (computation_is_valid)
3222 value = result.value;
3225 value += result.section->bfd_section->vma;
3227 minfo ("0x%V", value);
3233 struct bfd_link_hash_entry *h;
3235 h = bfd_link_hash_lookup (link_info.hash, assignment->exp->assign.dst,
3236 FALSE, FALSE, TRUE);
3239 value = h->u.def.value;
3242 value += result.section->bfd_section->vma;
3244 minfo ("[0x%V]", value);
3247 minfo ("[unresolved]");
3259 exp_print_tree (assignment->exp);
3264 print_input_statement (lang_input_statement_type *statm)
3266 if (statm->filename != NULL)
3268 fprintf (config.map_file, "LOAD %s\n", statm->filename);
3272 /* Print all symbols defined in a particular section. This is called
3273 via bfd_link_hash_traverse, or by print_all_symbols. */
3276 print_one_symbol (struct bfd_link_hash_entry *hash_entry, void *ptr)
3278 asection *sec = ptr;
3280 if ((hash_entry->type == bfd_link_hash_defined
3281 || hash_entry->type == bfd_link_hash_defweak)
3282 && sec == hash_entry->u.def.section)
3286 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
3289 (hash_entry->u.def.value
3290 + hash_entry->u.def.section->output_offset
3291 + hash_entry->u.def.section->output_section->vma));
3293 minfo (" %T\n", hash_entry->root.string);
3300 print_all_symbols (sec)
3303 struct fat_user_section_struct *ud = get_userdata (sec);
3304 struct map_symbol_def *def;
3309 *ud->map_symbol_def_tail = 0;
3310 for (def = ud->map_symbol_def_head; def; def = def->next)
3311 print_one_symbol (def->entry, sec);
3314 /* Print information about an input section to the map file. */
3317 print_input_section (lang_input_section_type *in)
3319 asection *i = in->section;
3320 bfd_size_type size = i->size;
3329 minfo ("%s", i->name);
3331 len = 1 + strlen (i->name);
3332 if (len >= SECTION_NAME_MAP_LENGTH - 1)
3337 while (len < SECTION_NAME_MAP_LENGTH)
3343 if (i->output_section != NULL && (i->flags & SEC_EXCLUDE) == 0)
3344 addr = i->output_section->vma + i->output_offset;
3351 minfo ("0x%V %W %B\n", addr, TO_ADDR (size), i->owner);
3353 if (size != i->rawsize && i->rawsize != 0)
3355 len = SECTION_NAME_MAP_LENGTH + 3;
3367 minfo (_("%W (size before relaxing)\n"), i->rawsize);
3370 if (i->output_section != NULL && (i->flags & SEC_EXCLUDE) == 0)
3372 if (command_line.reduce_memory_overheads)
3373 bfd_link_hash_traverse (link_info.hash, print_one_symbol, i);
3375 print_all_symbols (i);
3377 print_dot = addr + TO_ADDR (size);
3383 print_fill_statement (lang_fill_statement_type *fill)
3387 fputs (" FILL mask 0x", config.map_file);
3388 for (p = fill->fill->data, size = fill->fill->size; size != 0; p++, size--)
3389 fprintf (config.map_file, "%02x", *p);
3390 fputs ("\n", config.map_file);
3394 print_data_statement (lang_data_statement_type *data)
3402 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
3405 addr = data->output_vma;
3406 if (data->output_section != NULL)
3407 addr += data->output_section->vma;
3435 minfo ("0x%V %W %s 0x%v", addr, size, name, data->value);
3437 if (data->exp->type.node_class != etree_value)
3440 exp_print_tree (data->exp);
3445 print_dot = addr + TO_ADDR (size);
3448 /* Print an address statement. These are generated by options like
3452 print_address_statement (lang_address_statement_type *address)
3454 minfo (_("Address of section %s set to "), address->section_name);
3455 exp_print_tree (address->address);
3459 /* Print a reloc statement. */
3462 print_reloc_statement (lang_reloc_statement_type *reloc)
3469 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
3472 addr = reloc->output_vma;
3473 if (reloc->output_section != NULL)
3474 addr += reloc->output_section->vma;
3476 size = bfd_get_reloc_size (reloc->howto);
3478 minfo ("0x%V %W RELOC %s ", addr, size, reloc->howto->name);
3480 if (reloc->name != NULL)
3481 minfo ("%s+", reloc->name);
3483 minfo ("%s+", reloc->section->name);
3485 exp_print_tree (reloc->addend_exp);
3489 print_dot = addr + TO_ADDR (size);
3493 print_padding_statement (lang_padding_statement_type *s)
3501 len = sizeof " *fill*" - 1;
3502 while (len < SECTION_NAME_MAP_LENGTH)
3508 addr = s->output_offset;
3509 if (s->output_section != NULL)
3510 addr += s->output_section->vma;
3511 minfo ("0x%V %W ", addr, (bfd_vma) s->size);
3513 if (s->fill->size != 0)
3517 for (p = s->fill->data, size = s->fill->size; size != 0; p++, size--)
3518 fprintf (config.map_file, "%02x", *p);
3523 print_dot = addr + TO_ADDR (s->size);
3527 print_wild_statement (lang_wild_statement_type *w,
3528 lang_output_section_statement_type *os)
3530 struct wildcard_list *sec;
3534 if (w->filenames_sorted)
3536 if (w->filename != NULL)
3537 minfo ("%s", w->filename);
3540 if (w->filenames_sorted)
3544 for (sec = w->section_list; sec; sec = sec->next)
3546 if (sec->spec.sorted)
3548 if (sec->spec.exclude_name_list != NULL)
3551 minfo ("EXCLUDE_FILE(%s", sec->spec.exclude_name_list->name);
3552 for (tmp = sec->spec.exclude_name_list->next; tmp; tmp = tmp->next)
3553 minfo (" %s", tmp->name);
3556 if (sec->spec.name != NULL)
3557 minfo ("%s", sec->spec.name);
3560 if (sec->spec.sorted)
3569 print_statement_list (w->children.head, os);
3572 /* Print a group statement. */
3575 print_group (lang_group_statement_type *s,
3576 lang_output_section_statement_type *os)
3578 fprintf (config.map_file, "START GROUP\n");
3579 print_statement_list (s->children.head, os);
3580 fprintf (config.map_file, "END GROUP\n");
3583 /* Print the list of statements in S.
3584 This can be called for any statement type. */
3587 print_statement_list (lang_statement_union_type *s,
3588 lang_output_section_statement_type *os)
3592 print_statement (s, os);
3597 /* Print the first statement in statement list S.
3598 This can be called for any statement type. */
3601 print_statement (lang_statement_union_type *s,
3602 lang_output_section_statement_type *os)
3604 switch (s->header.type)
3607 fprintf (config.map_file, _("Fail with %d\n"), s->header.type);
3610 case lang_constructors_statement_enum:
3611 if (constructor_list.head != NULL)
3613 if (constructors_sorted)
3614 minfo (" SORT (CONSTRUCTORS)\n");
3616 minfo (" CONSTRUCTORS\n");
3617 print_statement_list (constructor_list.head, os);
3620 case lang_wild_statement_enum:
3621 print_wild_statement (&s->wild_statement, os);
3623 case lang_address_statement_enum:
3624 print_address_statement (&s->address_statement);
3626 case lang_object_symbols_statement_enum:
3627 minfo (" CREATE_OBJECT_SYMBOLS\n");
3629 case lang_fill_statement_enum:
3630 print_fill_statement (&s->fill_statement);
3632 case lang_data_statement_enum:
3633 print_data_statement (&s->data_statement);
3635 case lang_reloc_statement_enum:
3636 print_reloc_statement (&s->reloc_statement);
3638 case lang_input_section_enum:
3639 print_input_section (&s->input_section);
3641 case lang_padding_statement_enum:
3642 print_padding_statement (&s->padding_statement);
3644 case lang_output_section_statement_enum:
3645 print_output_section_statement (&s->output_section_statement);
3647 case lang_assignment_statement_enum:
3648 print_assignment (&s->assignment_statement, os);
3650 case lang_target_statement_enum:
3651 fprintf (config.map_file, "TARGET(%s)\n", s->target_statement.target);
3653 case lang_output_statement_enum:
3654 minfo ("OUTPUT(%s", s->output_statement.name);
3655 if (output_target != NULL)
3656 minfo (" %s", output_target);
3659 case lang_input_statement_enum:
3660 print_input_statement (&s->input_statement);
3662 case lang_group_statement_enum:
3663 print_group (&s->group_statement, os);
3665 case lang_afile_asection_pair_statement_enum:
3672 print_statements (void)
3674 print_statement_list (statement_list.head, abs_output_section);
3677 /* Print the first N statements in statement list S to STDERR.
3678 If N == 0, nothing is printed.
3679 If N < 0, the entire list is printed.
3680 Intended to be called from GDB. */
3683 dprint_statement (lang_statement_union_type *s, int n)
3685 FILE *map_save = config.map_file;
3687 config.map_file = stderr;
3690 print_statement_list (s, abs_output_section);
3693 while (s && --n >= 0)
3695 print_statement (s, abs_output_section);
3700 config.map_file = map_save;
3704 insert_pad (lang_statement_union_type **ptr,
3706 unsigned int alignment_needed,
3707 asection *output_section,
3710 static fill_type zero_fill = { 1, { 0 } };
3711 lang_statement_union_type *pad;
3713 pad = ((lang_statement_union_type *)
3714 ((char *) ptr - offsetof (lang_statement_union_type, header.next)));
3715 if (ptr != &statement_list.head
3716 && pad->header.type == lang_padding_statement_enum
3717 && pad->padding_statement.output_section == output_section)
3719 /* Use the existing pad statement. The above test on output
3720 section is probably redundant, but it doesn't hurt to check. */
3724 /* Make a new padding statement, linked into existing chain. */
3725 pad = stat_alloc (sizeof (lang_padding_statement_type));
3726 pad->header.next = *ptr;
3728 pad->header.type = lang_padding_statement_enum;
3729 pad->padding_statement.output_section = output_section;
3732 pad->padding_statement.fill = fill;
3734 pad->padding_statement.output_offset = dot - output_section->vma;
3735 pad->padding_statement.size = alignment_needed;
3736 output_section->size += alignment_needed;
3739 /* Work out how much this section will move the dot point. */
3743 (lang_statement_union_type **this_ptr,
3744 lang_output_section_statement_type *output_section_statement,
3748 lang_input_section_type *is = &((*this_ptr)->input_section);
3749 asection *i = is->section;
3751 if (!is->ifile->just_syms_flag && (i->flags & SEC_EXCLUDE) == 0)
3753 unsigned int alignment_needed;
3756 /* Align this section first to the input sections requirement,
3757 then to the output section's requirement. If this alignment
3758 is greater than any seen before, then record it too. Perform
3759 the alignment by inserting a magic 'padding' statement. */
3761 if (output_section_statement->subsection_alignment != -1)
3762 i->alignment_power = output_section_statement->subsection_alignment;
3764 o = output_section_statement->bfd_section;
3765 if (o->alignment_power < i->alignment_power)
3766 o->alignment_power = i->alignment_power;
3768 alignment_needed = align_power (dot, i->alignment_power) - dot;
3770 if (alignment_needed != 0)
3772 insert_pad (this_ptr, fill, TO_SIZE (alignment_needed), o, dot);
3773 dot += alignment_needed;
3776 /* Remember where in the output section this input section goes. */
3778 i->output_offset = dot - o->vma;
3780 /* Mark how big the output section must be to contain this now. */
3781 dot += TO_ADDR (i->size);
3782 o->size = TO_SIZE (dot - o->vma);
3786 i->output_offset = i->vma - output_section_statement->bfd_section->vma;
3793 sort_sections_by_lma (const void *arg1, const void *arg2)
3795 const asection *sec1 = *(const asection **) arg1;
3796 const asection *sec2 = *(const asection **) arg2;
3798 if (bfd_section_lma (sec1->owner, sec1)
3799 < bfd_section_lma (sec2->owner, sec2))
3801 else if (bfd_section_lma (sec1->owner, sec1)
3802 > bfd_section_lma (sec2->owner, sec2))
3808 #define IGNORE_SECTION(s) \
3809 ((s->flags & SEC_NEVER_LOAD) != 0 \
3810 || (s->flags & SEC_ALLOC) == 0 \
3811 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
3812 && (s->flags & SEC_LOAD) == 0))
3814 /* Check to see if any allocated sections overlap with other allocated
3815 sections. This can happen if a linker script specifies the output
3816 section addresses of the two sections. */
3819 lang_check_section_addresses (void)
3822 asection **sections, **spp;
3830 if (bfd_count_sections (output_bfd) <= 1)
3833 amt = bfd_count_sections (output_bfd) * sizeof (asection *);
3834 sections = xmalloc (amt);
3836 /* Scan all sections in the output list. */
3838 for (s = output_bfd->sections; s != NULL; s = s->next)
3840 /* Only consider loadable sections with real contents. */
3841 if (IGNORE_SECTION (s) || s->size == 0)
3844 sections[count] = s;
3851 qsort (sections, (size_t) count, sizeof (asection *),
3852 sort_sections_by_lma);
3856 s_start = bfd_section_lma (output_bfd, s);
3857 s_end = s_start + TO_ADDR (s->size) - 1;
3858 for (count--; count; count--)
3860 /* We must check the sections' LMA addresses not their VMA
3861 addresses because overlay sections can have overlapping VMAs
3862 but they must have distinct LMAs. */
3867 s_start = bfd_section_lma (output_bfd, s);
3868 s_end = s_start + TO_ADDR (s->size) - 1;
3870 /* Look for an overlap. */
3871 if (s_end >= os_start && s_start <= os_end)
3872 einfo (_("%X%P: section %s [%V -> %V] overlaps section %s [%V -> %V]\n"),
3873 s->name, s_start, s_end, os->name, os_start, os_end);
3879 /* Make sure the new address is within the region. We explicitly permit the
3880 current address to be at the exact end of the region when the address is
3881 non-zero, in case the region is at the end of addressable memory and the
3882 calculation wraps around. */
3885 os_region_check (lang_output_section_statement_type *os,
3886 lang_memory_region_type *region,
3890 if ((region->current < region->origin
3891 || (region->current - region->origin > region->length))
3892 && ((region->current != region->origin + region->length)
3897 einfo (_("%X%P: address 0x%v of %B section %s"
3898 " is not within region %s\n"),
3900 os->bfd_section->owner,
3901 os->bfd_section->name,
3906 einfo (_("%X%P: region %s is full (%B section %s)\n"),
3908 os->bfd_section->owner,
3909 os->bfd_section->name);
3911 /* Reset the region pointer. */
3912 region->current = region->origin;
3916 /* Set the sizes for all the output sections. */
3919 lang_size_sections_1
3920 (lang_statement_union_type *s,
3921 lang_output_section_statement_type *output_section_statement,
3922 lang_statement_union_type **prev,
3926 bfd_boolean check_regions)
3928 /* Size up the sections from their constituent parts. */
3929 for (; s != NULL; s = s->header.next)
3931 switch (s->header.type)
3933 case lang_output_section_statement_enum:
3936 lang_output_section_statement_type *os;
3938 os = &s->output_section_statement;
3939 if (os->bfd_section == NULL)
3940 /* This section was never actually created. */
3943 /* If this is a COFF shared library section, use the size and
3944 address from the input section. FIXME: This is COFF
3945 specific; it would be cleaner if there were some other way
3946 to do this, but nothing simple comes to mind. */
3947 if ((bfd_get_flavour (output_bfd) == bfd_target_ecoff_flavour
3948 || bfd_get_flavour (output_bfd) == bfd_target_coff_flavour)
3949 && (os->bfd_section->flags & SEC_COFF_SHARED_LIBRARY) != 0)
3953 if (os->children.head == NULL
3954 || os->children.head->header.next != NULL
3955 || (os->children.head->header.type
3956 != lang_input_section_enum))
3957 einfo (_("%P%X: Internal error on COFF shared library"
3958 " section %s\n"), os->name);
3960 input = os->children.head->input_section.section;
3961 bfd_set_section_vma (os->bfd_section->owner,
3963 bfd_section_vma (input->owner, input));
3964 os->bfd_section->size = input->size;
3968 if (bfd_is_abs_section (os->bfd_section))
3970 /* No matter what happens, an abs section starts at zero. */
3971 ASSERT (os->bfd_section->vma == 0);
3975 if (os->addr_tree == NULL)
3977 /* No address specified for this section, get one
3978 from the region specification. */
3979 if (os->region == NULL
3980 || ((os->bfd_section->flags & (SEC_ALLOC | SEC_LOAD))
3981 && os->region->name[0] == '*'
3982 && strcmp (os->region->name,
3983 DEFAULT_MEMORY_REGION) == 0))
3985 os->region = lang_memory_default (os->bfd_section);
3988 /* If a loadable section is using the default memory
3989 region, and some non default memory regions were
3990 defined, issue an error message. */
3991 if (!IGNORE_SECTION (os->bfd_section)
3992 && ! link_info.relocatable
3994 && strcmp (os->region->name,
3995 DEFAULT_MEMORY_REGION) == 0
3996 && lang_memory_region_list != NULL
3997 && (strcmp (lang_memory_region_list->name,
3998 DEFAULT_MEMORY_REGION) != 0
3999 || lang_memory_region_list->next != NULL))
4001 /* By default this is an error rather than just a
4002 warning because if we allocate the section to the
4003 default memory region we can end up creating an
4004 excessively large binary, or even seg faulting when
4005 attempting to perform a negative seek. See
4006 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4007 for an example of this. This behaviour can be
4008 overridden by the using the --no-check-sections
4010 if (command_line.check_section_addresses)
4011 einfo (_("%P%F: error: no memory region specified"
4012 " for loadable section `%s'\n"),
4013 bfd_get_section_name (output_bfd,
4016 einfo (_("%P: warning: no memory region specified"
4017 " for loadable section `%s'\n"),
4018 bfd_get_section_name (output_bfd,
4022 dot = os->region->current;
4024 if (os->section_alignment == -1)
4029 dot = align_power (dot,
4030 os->bfd_section->alignment_power);
4032 if (dot != olddot && config.warn_section_align)
4033 einfo (_("%P: warning: changing start of section"
4034 " %s by %u bytes\n"),
4035 os->name, (unsigned int) (dot - olddot));
4043 r = exp_fold_tree (os->addr_tree,
4045 lang_allocating_phase_enum,
4050 einfo (_("%F%S: non constant or forward reference"
4051 " address expression for section %s\n"),
4054 dot = r.value + r.section->bfd_section->vma;
4057 /* The section starts here.
4058 First, align to what the section needs. */
4060 if (os->section_alignment != -1)
4061 dot = align_power (dot, os->section_alignment);
4063 bfd_set_section_vma (0, os->bfd_section, dot);
4065 os->bfd_section->output_offset = 0;
4068 lang_size_sections_1 (os->children.head, os, &os->children.head,
4069 os->fill, dot, relax, check_regions);
4071 /* Put the section within the requested block size, or
4072 align at the block boundary. */
4073 after = ((os->bfd_section->vma
4074 + TO_ADDR (os->bfd_section->size)
4075 + os->block_value - 1)
4076 & - (bfd_vma) os->block_value);
4078 if (bfd_is_abs_section (os->bfd_section))
4079 ASSERT (after == os->bfd_section->vma);
4081 os->bfd_section->size
4082 = TO_SIZE (after - os->bfd_section->vma);
4084 dot = os->bfd_section->vma;
4085 /* .tbss sections effectively have zero size. */
4086 if ((os->bfd_section->flags & SEC_HAS_CONTENTS) != 0
4087 || (os->bfd_section->flags & SEC_THREAD_LOCAL) == 0
4088 || link_info.relocatable)
4089 dot += TO_ADDR (os->bfd_section->size);
4093 if (os->update_dot_tree != 0)
4094 exp_fold_tree (os->update_dot_tree, abs_output_section,
4095 lang_allocating_phase_enum, dot, &dot);
4097 /* Update dot in the region ?
4098 We only do this if the section is going to be allocated,
4099 since unallocated sections do not contribute to the region's
4100 overall size in memory.
4102 If the SEC_NEVER_LOAD bit is not set, it will affect the
4103 addresses of sections after it. We have to update
4105 if (os->region != NULL
4106 && ((os->bfd_section->flags & SEC_NEVER_LOAD) == 0
4107 || (os->bfd_section->flags & (SEC_ALLOC | SEC_LOAD))))
4109 os->region->current = dot;
4112 /* Make sure the new address is within the region. */
4113 os_region_check (os, os->region, os->addr_tree,
4114 os->bfd_section->vma);
4116 /* If there's no load address specified, use the run
4117 region as the load region. */
4118 if (os->lma_region == NULL && os->load_base == NULL)
4119 os->lma_region = os->region;
4121 if (os->lma_region != NULL && os->lma_region != os->region)
4123 /* Set load_base, which will be handled later. */
4124 os->load_base = exp_intop (os->lma_region->current);
4125 os->lma_region->current +=
4126 TO_ADDR (os->bfd_section->size);
4128 os_region_check (os, os->lma_region, NULL,
4129 os->bfd_section->lma);
4135 case lang_constructors_statement_enum:
4136 dot = lang_size_sections_1 (constructor_list.head,
4137 output_section_statement,
4138 &s->wild_statement.children.head,
4139 fill, dot, relax, check_regions);
4142 case lang_data_statement_enum:
4144 unsigned int size = 0;
4146 s->data_statement.output_vma =
4147 dot - output_section_statement->bfd_section->vma;
4148 s->data_statement.output_section =
4149 output_section_statement->bfd_section;
4151 /* We might refer to provided symbols in the expression, and
4152 need to mark them as needed. */
4153 exp_fold_tree (s->data_statement.exp, abs_output_section,
4154 lang_allocating_phase_enum, dot, &dot);
4156 switch (s->data_statement.type)
4174 if (size < TO_SIZE ((unsigned) 1))
4175 size = TO_SIZE ((unsigned) 1);
4176 dot += TO_ADDR (size);
4177 output_section_statement->bfd_section->size += size;
4181 case lang_reloc_statement_enum:
4185 s->reloc_statement.output_vma =
4186 dot - output_section_statement->bfd_section->vma;
4187 s->reloc_statement.output_section =
4188 output_section_statement->bfd_section;
4189 size = bfd_get_reloc_size (s->reloc_statement.howto);
4190 dot += TO_ADDR (size);
4191 output_section_statement->bfd_section->size += size;
4195 case lang_wild_statement_enum:
4197 dot = lang_size_sections_1 (s->wild_statement.children.head,
4198 output_section_statement,
4199 &s->wild_statement.children.head,
4200 fill, dot, relax, check_regions);
4204 case lang_object_symbols_statement_enum:
4205 link_info.create_object_symbols_section =
4206 output_section_statement->bfd_section;
4208 case lang_output_statement_enum:
4209 case lang_target_statement_enum:
4211 case lang_input_section_enum:
4215 i = (*prev)->input_section.section;
4220 if (! bfd_relax_section (i->owner, i, &link_info, &again))
4221 einfo (_("%P%F: can't relax section: %E\n"));
4225 dot = size_input_section (prev, output_section_statement,
4226 output_section_statement->fill, dot);
4229 case lang_input_statement_enum:
4231 case lang_fill_statement_enum:
4232 s->fill_statement.output_section =
4233 output_section_statement->bfd_section;
4235 fill = s->fill_statement.fill;
4237 case lang_assignment_statement_enum:
4239 bfd_vma newdot = dot;
4241 exp_fold_tree (s->assignment_statement.exp,
4242 output_section_statement,
4243 lang_allocating_phase_enum,
4249 if (output_section_statement == abs_output_section)
4251 /* If we don't have an output section, then just adjust
4252 the default memory address. */
4253 lang_memory_region_lookup (DEFAULT_MEMORY_REGION,
4254 FALSE)->current = newdot;
4258 /* Insert a pad after this statement. We can't
4259 put the pad before when relaxing, in case the
4260 assignment references dot. */
4261 insert_pad (&s->header.next, fill, TO_SIZE (newdot - dot),
4262 output_section_statement->bfd_section, dot);
4264 /* Don't neuter the pad below when relaxing. */
4268 /* If dot is advanced, this implies that the section should
4269 have space allocated to it, unless the user has explicitly
4270 stated that the section should never be loaded. */
4271 if (!(output_section_statement->flags
4272 & (SEC_NEVER_LOAD | SEC_ALLOC)))
4273 output_section_statement->bfd_section->flags |= SEC_ALLOC;
4280 case lang_padding_statement_enum:
4281 /* If this is the first time lang_size_sections is called,
4282 we won't have any padding statements. If this is the
4283 second or later passes when relaxing, we should allow
4284 padding to shrink. If padding is needed on this pass, it
4285 will be added back in. */
4286 s->padding_statement.size = 0;
4288 /* Make sure output_offset is valid. If relaxation shrinks
4289 the section and this pad isn't needed, it's possible to
4290 have output_offset larger than the final size of the
4291 section. bfd_set_section_contents will complain even for
4292 a pad size of zero. */
4293 s->padding_statement.output_offset
4294 = dot - output_section_statement->bfd_section->vma;
4297 case lang_group_statement_enum:
4298 dot = lang_size_sections_1 (s->group_statement.children.head,
4299 output_section_statement,
4300 &s->group_statement.children.head,
4301 fill, dot, relax, check_regions);
4308 /* We can only get here when relaxing is turned on. */
4309 case lang_address_statement_enum:
4312 prev = &s->header.next;
4319 (lang_statement_union_type *s,
4320 lang_output_section_statement_type *output_section_statement,
4321 lang_statement_union_type **prev,
4325 bfd_boolean check_regions)
4329 /* Callers of exp_fold_tree need to increment this. */
4330 lang_statement_iteration++;
4332 exp_data_seg.phase = exp_dataseg_none;
4333 result = lang_size_sections_1 (s, output_section_statement, prev, fill,
4334 dot, relax, check_regions);
4335 if (exp_data_seg.phase == exp_dataseg_end_seen
4336 && link_info.relro && exp_data_seg.relro_end)
4338 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
4339 to put exp_data_seg.relro on a (common) page boundary. */
4340 bfd_vma old_min_base, relro_end, maxpage;
4342 exp_data_seg.phase = exp_dataseg_relro_adjust;
4343 old_min_base = exp_data_seg.min_base;
4344 maxpage = exp_data_seg.maxpagesize;
4345 exp_data_seg.base += (-exp_data_seg.relro_end
4346 & (exp_data_seg.pagesize - 1));
4347 /* Compute the expected PT_GNU_RELRO segment end. */
4348 relro_end = (exp_data_seg.relro_end + exp_data_seg.pagesize - 1)
4349 & ~(exp_data_seg.pagesize - 1);
4350 if (old_min_base + maxpage < exp_data_seg.base)
4352 exp_data_seg.base -= maxpage;
4353 relro_end -= maxpage;
4355 result = lang_size_sections_1 (s, output_section_statement, prev, fill,
4356 dot, relax, check_regions);
4357 if (exp_data_seg.relro_end > relro_end)
4359 /* The alignment of sections between DATA_SEGMENT_ALIGN
4360 and DATA_SEGMENT_RELRO_END caused huge padding to be
4361 inserted at DATA_SEGMENT_RELRO_END. Try some other base. */
4363 unsigned int max_alignment_power = 0;
4365 /* Find maximum alignment power of sections between
4366 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
4367 for (sec = output_bfd->sections; sec; sec = sec->next)
4368 if (sec->vma >= exp_data_seg.base
4369 && sec->vma < exp_data_seg.relro_end
4370 && sec->alignment_power > max_alignment_power)
4371 max_alignment_power = sec->alignment_power;
4373 if (((bfd_vma) 1 << max_alignment_power) < exp_data_seg.pagesize)
4375 if (exp_data_seg.base - (1 << max_alignment_power)
4377 exp_data_seg.base += exp_data_seg.pagesize;
4378 exp_data_seg.base -= (1 << max_alignment_power);
4379 result = lang_size_sections_1 (s, output_section_statement,
4380 prev, fill, dot, relax,
4384 link_info.relro_start = exp_data_seg.base;
4385 link_info.relro_end = exp_data_seg.relro_end;
4387 else if (exp_data_seg.phase == exp_dataseg_end_seen)
4389 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
4390 a page could be saved in the data segment. */
4391 bfd_vma first, last;
4393 first = -exp_data_seg.base & (exp_data_seg.pagesize - 1);
4394 last = exp_data_seg.end & (exp_data_seg.pagesize - 1);
4396 && ((exp_data_seg.base & ~(exp_data_seg.pagesize - 1))
4397 != (exp_data_seg.end & ~(exp_data_seg.pagesize - 1)))
4398 && first + last <= exp_data_seg.pagesize)
4400 exp_data_seg.phase = exp_dataseg_adjust;
4401 lang_statement_iteration++;
4402 result = lang_size_sections_1 (s, output_section_statement, prev,
4403 fill, dot, relax, check_regions);
4410 /* Worker function for lang_do_assignments. Recursiveness goes here. */
4413 lang_do_assignments_1
4414 (lang_statement_union_type *s,
4415 lang_output_section_statement_type *output_section_statement,
4419 for (; s != NULL; s = s->header.next)
4421 switch (s->header.type)
4423 case lang_constructors_statement_enum:
4424 dot = lang_do_assignments_1 (constructor_list.head,
4425 output_section_statement,
4430 case lang_output_section_statement_enum:
4432 lang_output_section_statement_type *os;
4434 os = &(s->output_section_statement);
4435 if (os->bfd_section != NULL)
4437 dot = os->bfd_section->vma;
4438 lang_do_assignments_1 (os->children.head, os, os->fill, dot);
4439 /* .tbss sections effectively have zero size. */
4440 if ((os->bfd_section->flags & SEC_HAS_CONTENTS) != 0
4441 || (os->bfd_section->flags & SEC_THREAD_LOCAL) == 0
4442 || link_info.relocatable)
4443 dot += TO_ADDR (os->bfd_section->size);
4447 /* If nothing has been placed into the output section then
4448 it won't have a bfd_section. */
4449 if (os->bfd_section)
4451 os->bfd_section->lma
4452 = exp_get_abs_int (os->load_base, 0, "load base",
4453 lang_final_phase_enum);
4458 case lang_wild_statement_enum:
4460 dot = lang_do_assignments_1 (s->wild_statement.children.head,
4461 output_section_statement,
4466 case lang_object_symbols_statement_enum:
4467 case lang_output_statement_enum:
4468 case lang_target_statement_enum:
4470 case lang_data_statement_enum:
4472 etree_value_type value;
4474 value = exp_fold_tree (s->data_statement.exp,
4476 lang_final_phase_enum, dot, &dot);
4478 einfo (_("%F%P: invalid data statement\n"));
4479 s->data_statement.value
4480 = value.value + value.section->bfd_section->vma;
4484 switch (s->data_statement.type)
4502 if (size < TO_SIZE ((unsigned) 1))
4503 size = TO_SIZE ((unsigned) 1);
4504 dot += TO_ADDR (size);
4508 case lang_reloc_statement_enum:
4510 etree_value_type value;
4512 value = exp_fold_tree (s->reloc_statement.addend_exp,
4514 lang_final_phase_enum, dot, &dot);
4515 s->reloc_statement.addend_value = value.value;
4517 einfo (_("%F%P: invalid reloc statement\n"));
4519 dot += TO_ADDR (bfd_get_reloc_size (s->reloc_statement.howto));
4522 case lang_input_section_enum:
4524 asection *in = s->input_section.section;
4526 if ((in->flags & SEC_EXCLUDE) == 0)
4527 dot += TO_ADDR (in->size);
4531 case lang_input_statement_enum:
4533 case lang_fill_statement_enum:
4534 fill = s->fill_statement.fill;
4536 case lang_assignment_statement_enum:
4538 exp_fold_tree (s->assignment_statement.exp,
4539 output_section_statement,
4540 lang_final_phase_enum,
4546 case lang_padding_statement_enum:
4547 dot += TO_ADDR (s->padding_statement.size);
4550 case lang_group_statement_enum:
4551 dot = lang_do_assignments_1 (s->group_statement.children.head,
4552 output_section_statement,
4560 case lang_address_statement_enum:
4570 (lang_statement_union_type *s,
4571 lang_output_section_statement_type *output_section_statement,
4575 /* Callers of exp_fold_tree need to increment this. */
4576 lang_statement_iteration++;
4577 lang_do_assignments_1 (s, output_section_statement, fill, dot);
4580 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
4581 operator .startof. (section_name), it produces an undefined symbol
4582 .startof.section_name. Similarly, when it sees
4583 .sizeof. (section_name), it produces an undefined symbol
4584 .sizeof.section_name. For all the output sections, we look for
4585 such symbols, and set them to the correct value. */
4588 lang_set_startof (void)
4592 if (link_info.relocatable)
4595 for (s = output_bfd->sections; s != NULL; s = s->next)
4597 const char *secname;
4599 struct bfd_link_hash_entry *h;
4601 secname = bfd_get_section_name (output_bfd, s);
4602 buf = xmalloc (10 + strlen (secname));
4604 sprintf (buf, ".startof.%s", secname);
4605 h = bfd_link_hash_lookup (link_info.hash, buf, FALSE, FALSE, TRUE);
4606 if (h != NULL && h->type == bfd_link_hash_undefined)
4608 h->type = bfd_link_hash_defined;
4609 h->u.def.value = bfd_get_section_vma (output_bfd, s);
4610 h->u.def.section = bfd_abs_section_ptr;
4613 sprintf (buf, ".sizeof.%s", secname);
4614 h = bfd_link_hash_lookup (link_info.hash, buf, FALSE, FALSE, TRUE);
4615 if (h != NULL && h->type == bfd_link_hash_undefined)
4617 h->type = bfd_link_hash_defined;
4618 h->u.def.value = TO_ADDR (s->size);
4619 h->u.def.section = bfd_abs_section_ptr;
4629 struct bfd_link_hash_entry *h;
4632 if (link_info.relocatable || link_info.shared)
4637 if (entry_symbol.name == NULL)
4639 /* No entry has been specified. Look for start, but don't warn
4640 if we don't find it. */
4641 entry_symbol.name = "start";
4645 h = bfd_link_hash_lookup (link_info.hash, entry_symbol.name,
4646 FALSE, FALSE, TRUE);
4648 && (h->type == bfd_link_hash_defined
4649 || h->type == bfd_link_hash_defweak)
4650 && h->u.def.section->output_section != NULL)
4654 val = (h->u.def.value
4655 + bfd_get_section_vma (output_bfd,
4656 h->u.def.section->output_section)
4657 + h->u.def.section->output_offset);
4658 if (! bfd_set_start_address (output_bfd, val))
4659 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol.name);
4666 /* We couldn't find the entry symbol. Try parsing it as a
4668 val = bfd_scan_vma (entry_symbol.name, &send, 0);
4671 if (! bfd_set_start_address (output_bfd, val))
4672 einfo (_("%P%F: can't set start address\n"));
4678 /* Can't find the entry symbol, and it's not a number. Use
4679 the first address in the text section. */
4680 ts = bfd_get_section_by_name (output_bfd, entry_section);
4684 einfo (_("%P: warning: cannot find entry symbol %s;"
4685 " defaulting to %V\n"),
4687 bfd_get_section_vma (output_bfd, ts));
4688 if (! bfd_set_start_address (output_bfd,
4689 bfd_get_section_vma (output_bfd,
4691 einfo (_("%P%F: can't set start address\n"));
4696 einfo (_("%P: warning: cannot find entry symbol %s;"
4697 " not setting start address\n"),
4703 /* Don't bfd_hash_table_free (&lang_definedness_table);
4704 map file output may result in a call of lang_track_definedness. */
4707 /* This is a small function used when we want to ignore errors from
4711 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED, ...)
4713 /* Don't do anything. */
4716 /* Check that the architecture of all the input files is compatible
4717 with the output file. Also call the backend to let it do any
4718 other checking that is needed. */
4723 lang_statement_union_type *file;
4725 const bfd_arch_info_type *compatible;
4727 for (file = file_chain.head; file != NULL; file = file->input_statement.next)
4729 input_bfd = file->input_statement.the_bfd;
4731 = bfd_arch_get_compatible (input_bfd, output_bfd,
4732 command_line.accept_unknown_input_arch);
4734 /* In general it is not possible to perform a relocatable
4735 link between differing object formats when the input
4736 file has relocations, because the relocations in the
4737 input format may not have equivalent representations in
4738 the output format (and besides BFD does not translate
4739 relocs for other link purposes than a final link). */
4740 if ((link_info.relocatable || link_info.emitrelocations)
4741 && (compatible == NULL
4742 || bfd_get_flavour (input_bfd) != bfd_get_flavour (output_bfd))
4743 && (bfd_get_file_flags (input_bfd) & HAS_RELOC) != 0)
4745 einfo (_("%P%F: Relocatable linking with relocations from"
4746 " format %s (%B) to format %s (%B) is not supported\n"),
4747 bfd_get_target (input_bfd), input_bfd,
4748 bfd_get_target (output_bfd), output_bfd);
4749 /* einfo with %F exits. */
4752 if (compatible == NULL)
4754 if (command_line.warn_mismatch)
4755 einfo (_("%P: warning: %s architecture of input file `%B'"
4756 " is incompatible with %s output\n"),
4757 bfd_printable_name (input_bfd), input_bfd,
4758 bfd_printable_name (output_bfd));
4760 else if (bfd_count_sections (input_bfd))
4762 /* If the input bfd has no contents, it shouldn't set the
4763 private data of the output bfd. */
4765 bfd_error_handler_type pfn = NULL;
4767 /* If we aren't supposed to warn about mismatched input
4768 files, temporarily set the BFD error handler to a
4769 function which will do nothing. We still want to call
4770 bfd_merge_private_bfd_data, since it may set up
4771 information which is needed in the output file. */
4772 if (! command_line.warn_mismatch)
4773 pfn = bfd_set_error_handler (ignore_bfd_errors);
4774 if (! bfd_merge_private_bfd_data (input_bfd, output_bfd))
4776 if (command_line.warn_mismatch)
4777 einfo (_("%P%X: failed to merge target specific data"
4778 " of file %B\n"), input_bfd);
4780 if (! command_line.warn_mismatch)
4781 bfd_set_error_handler (pfn);
4786 /* Look through all the global common symbols and attach them to the
4787 correct section. The -sort-common command line switch may be used
4788 to roughly sort the entries by size. */
4793 if (command_line.inhibit_common_definition)
4795 if (link_info.relocatable
4796 && ! command_line.force_common_definition)
4799 if (! config.sort_common)
4800 bfd_link_hash_traverse (link_info.hash, lang_one_common, NULL);
4805 for (power = 4; power >= 0; power--)
4806 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
4810 /* Place one common symbol in the correct section. */
4813 lang_one_common (struct bfd_link_hash_entry *h, void *info)
4815 unsigned int power_of_two;
4819 if (h->type != bfd_link_hash_common)
4823 power_of_two = h->u.c.p->alignment_power;
4825 if (config.sort_common
4826 && power_of_two < (unsigned int) *(int *) info)
4829 section = h->u.c.p->section;
4831 /* Increase the size of the section to align the common sym. */
4832 section->size += ((bfd_vma) 1 << (power_of_two + opb_shift)) - 1;
4833 section->size &= (- (bfd_vma) 1 << (power_of_two + opb_shift));
4835 /* Adjust the alignment if necessary. */
4836 if (power_of_two > section->alignment_power)
4837 section->alignment_power = power_of_two;
4839 /* Change the symbol from common to defined. */
4840 h->type = bfd_link_hash_defined;
4841 h->u.def.section = section;
4842 h->u.def.value = section->size;
4844 /* Increase the size of the section. */
4845 section->size += size;
4847 /* Make sure the section is allocated in memory, and make sure that
4848 it is no longer a common section. */
4849 section->flags |= SEC_ALLOC;
4850 section->flags &= ~SEC_IS_COMMON;
4852 if (config.map_file != NULL)
4854 static bfd_boolean header_printed;
4859 if (! header_printed)
4861 minfo (_("\nAllocating common symbols\n"));
4862 minfo (_("Common symbol size file\n\n"));
4863 header_printed = TRUE;
4866 name = demangle (h->root.string);
4868 len = strlen (name);
4883 if (size <= 0xffffffff)
4884 sprintf (buf, "%lx", (unsigned long) size);
4886 sprintf_vma (buf, size);
4896 minfo ("%B\n", section->owner);
4902 /* Run through the input files and ensure that every input section has
4903 somewhere to go. If one is found without a destination then create
4904 an input request and place it into the statement tree. */
4907 lang_place_orphans (void)
4909 LANG_FOR_EACH_INPUT_STATEMENT (file)
4913 for (s = file->the_bfd->sections; s != NULL; s = s->next)
4915 if (s->output_section == NULL)
4917 /* This section of the file is not attached, root
4918 around for a sensible place for it to go. */
4920 if (file->just_syms_flag)
4921 bfd_link_just_syms (file->the_bfd, s, &link_info);
4922 else if ((s->flags & SEC_EXCLUDE) != 0)
4923 s->output_section = bfd_abs_section_ptr;
4924 else if (strcmp (s->name, "COMMON") == 0)
4926 /* This is a lonely common section which must have
4927 come from an archive. We attach to the section
4928 with the wildcard. */
4929 if (! link_info.relocatable
4930 || command_line.force_common_definition)
4932 if (default_common_section == NULL)
4934 default_common_section =
4935 lang_output_section_statement_lookup (".bss");
4938 lang_add_section (&default_common_section->children, s,
4939 default_common_section, file);
4942 else if (ldemul_place_orphan (file, s))
4946 lang_output_section_statement_type *os;
4948 os = lang_output_section_statement_lookup (s->name);
4949 lang_add_section (&os->children, s, os, file);
4957 lang_set_flags (lang_memory_region_type *ptr, const char *flags, int invert)
4959 flagword *ptr_flags;
4961 ptr_flags = invert ? &ptr->not_flags : &ptr->flags;
4967 *ptr_flags |= SEC_ALLOC;
4971 *ptr_flags |= SEC_READONLY;
4975 *ptr_flags |= SEC_DATA;
4979 *ptr_flags |= SEC_CODE;
4984 *ptr_flags |= SEC_LOAD;
4988 einfo (_("%P%F: invalid syntax in flags\n"));
4995 /* Call a function on each input file. This function will be called
4996 on an archive, but not on the elements. */
4999 lang_for_each_input_file (void (*func) (lang_input_statement_type *))
5001 lang_input_statement_type *f;
5003 for (f = (lang_input_statement_type *) input_file_chain.head;
5005 f = (lang_input_statement_type *) f->next_real_file)
5009 /* Call a function on each file. The function will be called on all
5010 the elements of an archive which are included in the link, but will
5011 not be called on the archive file itself. */
5014 lang_for_each_file (void (*func) (lang_input_statement_type *))
5016 LANG_FOR_EACH_INPUT_STATEMENT (f)
5023 ldlang_add_file (lang_input_statement_type *entry)
5027 lang_statement_append (&file_chain,
5028 (lang_statement_union_type *) entry,
5031 /* The BFD linker needs to have a list of all input BFDs involved in
5033 ASSERT (entry->the_bfd->link_next == NULL);
5034 ASSERT (entry->the_bfd != output_bfd);
5035 for (pp = &link_info.input_bfds; *pp != NULL; pp = &(*pp)->link_next)
5037 *pp = entry->the_bfd;
5038 entry->the_bfd->usrdata = entry;
5039 bfd_set_gp_size (entry->the_bfd, g_switch_value);
5041 /* Look through the sections and check for any which should not be
5042 included in the link. We need to do this now, so that we can
5043 notice when the backend linker tries to report multiple
5044 definition errors for symbols which are in sections we aren't
5045 going to link. FIXME: It might be better to entirely ignore
5046 symbols which are defined in sections which are going to be
5047 discarded. This would require modifying the backend linker for
5048 each backend which might set the SEC_LINK_ONCE flag. If we do
5049 this, we should probably handle SEC_EXCLUDE in the same way. */
5051 bfd_map_over_sections (entry->the_bfd, section_already_linked, entry);
5055 lang_add_output (const char *name, int from_script)
5057 /* Make -o on command line override OUTPUT in script. */
5058 if (!had_output_filename || !from_script)
5060 output_filename = name;
5061 had_output_filename = TRUE;
5065 static lang_output_section_statement_type *current_section;
5076 for (l = 0; l < 32; l++)
5078 if (i >= (unsigned int) x)
5086 lang_output_section_statement_type *
5087 lang_enter_output_section_statement (const char *output_section_statement_name,
5088 etree_type *address_exp,
5089 enum section_type sectype,
5091 etree_type *subalign,
5095 lang_output_section_statement_type *os;
5099 lang_output_section_statement_lookup_1 (output_section_statement_name,
5102 /* Make next things chain into subchain of this. */
5104 if (os->addr_tree == NULL)
5106 os->addr_tree = address_exp;
5108 os->sectype = sectype;
5109 if (sectype != noload_section)
5110 os->flags = SEC_NO_FLAGS;
5112 os->flags = SEC_NEVER_LOAD;
5113 os->block_value = 1;
5114 stat_ptr = &os->children;
5116 os->subsection_alignment =
5117 topower (exp_get_value_int (subalign, -1, "subsection alignment", 0));
5118 os->section_alignment =
5119 topower (exp_get_value_int (align, -1, "section alignment", 0));
5121 os->load_base = ebase;
5128 lang_output_statement_type *new =
5129 new_stat (lang_output_statement, stat_ptr);
5131 new->name = output_filename;
5134 /* Reset the current counters in the regions. */
5137 lang_reset_memory_regions (void)
5139 lang_memory_region_type *p = lang_memory_region_list;
5142 for (p = lang_memory_region_list; p != NULL; p = p->next)
5144 p->old_length = (bfd_size_type) (p->current - p->origin);
5145 p->current = p->origin;
5148 for (o = output_bfd->sections; o != NULL; o = o->next)
5150 /* Save the last size for possible use by bfd_relax_section. */
5151 o->rawsize = o->size;
5156 /* Worker for lang_gc_sections_1. */
5159 gc_section_callback (lang_wild_statement_type *ptr,
5160 struct wildcard_list *sec ATTRIBUTE_UNUSED,
5162 lang_input_statement_type *file ATTRIBUTE_UNUSED,
5163 void *data ATTRIBUTE_UNUSED)
5165 /* If the wild pattern was marked KEEP, the member sections
5166 should be as well. */
5167 if (ptr->keep_sections)
5168 section->flags |= SEC_KEEP;
5171 /* Iterate over sections marking them against GC. */
5174 lang_gc_sections_1 (lang_statement_union_type *s)
5176 for (; s != NULL; s = s->header.next)
5178 switch (s->header.type)
5180 case lang_wild_statement_enum:
5181 walk_wild (&s->wild_statement, gc_section_callback, NULL);
5183 case lang_constructors_statement_enum:
5184 lang_gc_sections_1 (constructor_list.head);
5186 case lang_output_section_statement_enum:
5187 lang_gc_sections_1 (s->output_section_statement.children.head);
5189 case lang_group_statement_enum:
5190 lang_gc_sections_1 (s->group_statement.children.head);
5199 lang_gc_sections (void)
5201 struct bfd_link_hash_entry *h;
5202 ldlang_undef_chain_list_type *ulist;
5204 /* Keep all sections so marked in the link script. */
5206 lang_gc_sections_1 (statement_list.head);
5208 /* Keep all sections containing symbols undefined on the command-line,
5209 and the section containing the entry symbol. */
5211 for (ulist = link_info.gc_sym_list; ulist; ulist = ulist->next)
5213 h = bfd_link_hash_lookup (link_info.hash, ulist->name,
5214 FALSE, FALSE, FALSE);
5217 && (h->type == bfd_link_hash_defined
5218 || h->type == bfd_link_hash_defweak)
5219 && ! bfd_is_abs_section (h->u.def.section))
5221 h->u.def.section->flags |= SEC_KEEP;
5225 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
5226 the special case of debug info. (See bfd/stabs.c)
5227 Twiddle the flag here, to simplify later linker code. */
5228 if (link_info.relocatable)
5230 LANG_FOR_EACH_INPUT_STATEMENT (f)
5233 for (sec = f->the_bfd->sections; sec != NULL; sec = sec->next)
5234 if ((sec->flags & SEC_DEBUGGING) == 0)
5235 sec->flags &= ~SEC_EXCLUDE;
5239 if (link_info.gc_sections)
5240 bfd_gc_sections (output_bfd, &link_info);
5244 lang_mark_used_section (void)
5246 unsigned int gc_sections = link_info.gc_sections;
5248 link_info.gc_sections = 0;
5249 bfd_gc_sections (output_bfd, &link_info);
5250 link_info.gc_sections = gc_sections;
5256 current_target = default_target;
5258 /* Open the output file. */
5259 lang_for_each_statement (ldlang_open_output);
5262 ldemul_create_output_section_statements ();
5264 /* Add to the hash table all undefineds on the command line. */
5265 lang_place_undefineds ();
5267 if (!bfd_section_already_linked_table_init ())
5268 einfo (_("%P%F: Failed to create hash table\n"));
5270 /* Create a bfd for each input file. */
5271 current_target = default_target;
5272 open_input_bfds (statement_list.head, FALSE);
5274 link_info.gc_sym_list = &entry_symbol;
5275 if (entry_symbol.name == NULL)
5276 link_info.gc_sym_list = ldlang_undef_chain_list_head;
5278 ldemul_after_open ();
5280 bfd_section_already_linked_table_free ();
5282 /* Make sure that we're not mixing architectures. We call this
5283 after all the input files have been opened, but before we do any
5284 other processing, so that any operations merge_private_bfd_data
5285 does on the output file will be known during the rest of the
5289 /* Handle .exports instead of a version script if we're told to do so. */
5290 if (command_line.version_exports_section)
5291 lang_do_version_exports_section ();
5293 /* Build all sets based on the information gathered from the input
5295 ldctor_build_sets ();
5297 /* Remove unreferenced sections if asked to. */
5298 lang_gc_sections ();
5300 /* Size up the common data. */
5303 /* Update wild statements. */
5304 update_wild_statements (statement_list.head);
5306 /* Run through the contours of the script and attach input sections
5307 to the correct output sections. */
5308 map_input_to_output_sections (statement_list.head, NULL, NULL);
5310 /* Find any sections not attached explicitly and handle them. */
5311 lang_place_orphans ();
5313 if (! link_info.relocatable)
5317 /* Merge SEC_MERGE sections. This has to be done after GC of
5318 sections, so that GCed sections are not merged, but before
5319 assigning dynamic symbols, since removing whole input sections
5321 bfd_merge_sections (output_bfd, &link_info);
5323 /* Look for a text section and set the readonly attribute in it. */
5324 found = bfd_get_section_by_name (output_bfd, ".text");
5328 if (config.text_read_only)
5329 found->flags |= SEC_READONLY;
5331 found->flags &= ~SEC_READONLY;
5335 /* Do anything special before sizing sections. This is where ELF
5336 and other back-ends size dynamic sections. */
5337 ldemul_before_allocation ();
5339 /* We must record the program headers before we try to fix the
5340 section positions, since they will affect SIZEOF_HEADERS. */
5341 lang_record_phdrs ();
5343 /* Size up the sections. */
5344 lang_size_sections (statement_list.head, abs_output_section,
5345 &statement_list.head, 0, 0, NULL,
5346 command_line.relax ? FALSE : TRUE);
5348 /* Now run around and relax if we can. */
5349 if (command_line.relax)
5351 /* Keep relaxing until bfd_relax_section gives up. */
5352 bfd_boolean relax_again;
5356 relax_again = FALSE;
5358 /* Note: pe-dll.c does something like this also. If you find
5359 you need to change this code, you probably need to change
5360 pe-dll.c also. DJ */
5362 /* Do all the assignments with our current guesses as to
5364 lang_do_assignments (statement_list.head, abs_output_section,
5367 /* We must do this after lang_do_assignments, because it uses
5369 lang_reset_memory_regions ();
5371 /* Perform another relax pass - this time we know where the
5372 globals are, so can make a better guess. */
5373 lang_size_sections (statement_list.head, abs_output_section,
5374 &statement_list.head, 0, 0, &relax_again, FALSE);
5376 /* If the normal relax is done and the relax finalize pass
5377 is not performed yet, we perform another relax pass. */
5378 if (!relax_again && link_info.need_relax_finalize)
5380 link_info.need_relax_finalize = FALSE;
5384 while (relax_again);
5386 /* Final extra sizing to report errors. */
5387 lang_do_assignments (statement_list.head, abs_output_section, NULL, 0);
5388 lang_reset_memory_regions ();
5389 lang_size_sections (statement_list.head, abs_output_section,
5390 &statement_list.head, 0, 0, NULL, TRUE);
5393 /* See if anything special should be done now we know how big
5395 ldemul_after_allocation ();
5397 /* Fix any .startof. or .sizeof. symbols. */
5398 lang_set_startof ();
5400 /* Do all the assignments, now that we know the final resting places
5401 of all the symbols. */
5403 lang_do_assignments (statement_list.head, abs_output_section, NULL, 0);
5405 /* Make sure that the section addresses make sense. */
5406 if (! link_info.relocatable
5407 && command_line.check_section_addresses)
5408 lang_check_section_addresses ();
5411 lang_mark_used_section ();
5416 /* EXPORTED TO YACC */
5419 lang_add_wild (struct wildcard_spec *filespec,
5420 struct wildcard_list *section_list,
5421 bfd_boolean keep_sections)
5423 struct wildcard_list *curr, *next;
5424 lang_wild_statement_type *new;
5426 /* Reverse the list as the parser puts it back to front. */
5427 for (curr = section_list, section_list = NULL;
5429 section_list = curr, curr = next)
5431 if (curr->spec.name != NULL && strcmp (curr->spec.name, "COMMON") == 0)
5432 placed_commons = TRUE;
5435 curr->next = section_list;
5438 if (filespec != NULL && filespec->name != NULL)
5440 if (strcmp (filespec->name, "*") == 0)
5441 filespec->name = NULL;
5442 else if (! wildcardp (filespec->name))
5443 lang_has_input_file = TRUE;
5446 new = new_stat (lang_wild_statement, stat_ptr);
5447 new->filename = NULL;
5448 new->filenames_sorted = FALSE;
5449 if (filespec != NULL)
5451 new->filename = filespec->name;
5452 new->filenames_sorted = filespec->sorted == by_name;
5454 new->section_list = section_list;
5455 new->keep_sections = keep_sections;
5456 lang_list_init (&new->children);
5457 analyze_walk_wild_section_handler (new);
5461 lang_section_start (const char *name, etree_type *address,
5462 const segment_type *segment)
5464 lang_address_statement_type *ad;
5466 ad = new_stat (lang_address_statement, stat_ptr);
5467 ad->section_name = name;
5468 ad->address = address;
5469 ad->segment = segment;
5472 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
5473 because of a -e argument on the command line, or zero if this is
5474 called by ENTRY in a linker script. Command line arguments take
5478 lang_add_entry (const char *name, bfd_boolean cmdline)
5480 if (entry_symbol.name == NULL
5482 || ! entry_from_cmdline)
5484 entry_symbol.name = name;
5485 entry_from_cmdline = cmdline;
5490 lang_add_target (const char *name)
5492 lang_target_statement_type *new = new_stat (lang_target_statement,
5500 lang_add_map (const char *name)
5507 map_option_f = TRUE;
5515 lang_add_fill (fill_type *fill)
5517 lang_fill_statement_type *new = new_stat (lang_fill_statement,
5524 lang_add_data (int type, union etree_union *exp)
5527 lang_data_statement_type *new = new_stat (lang_data_statement,
5535 /* Create a new reloc statement. RELOC is the BFD relocation type to
5536 generate. HOWTO is the corresponding howto structure (we could
5537 look this up, but the caller has already done so). SECTION is the
5538 section to generate a reloc against, or NAME is the name of the
5539 symbol to generate a reloc against. Exactly one of SECTION and
5540 NAME must be NULL. ADDEND is an expression for the addend. */
5543 lang_add_reloc (bfd_reloc_code_real_type reloc,
5544 reloc_howto_type *howto,
5547 union etree_union *addend)
5549 lang_reloc_statement_type *p = new_stat (lang_reloc_statement, stat_ptr);
5553 p->section = section;
5555 p->addend_exp = addend;
5557 p->addend_value = 0;
5558 p->output_section = NULL;
5562 lang_assignment_statement_type *
5563 lang_add_assignment (etree_type *exp)
5565 lang_assignment_statement_type *new = new_stat (lang_assignment_statement,
5573 lang_add_attribute (enum statement_enum attribute)
5575 new_statement (attribute, sizeof (lang_statement_union_type), stat_ptr);
5579 lang_startup (const char *name)
5581 if (startup_file != NULL)
5583 einfo (_("%P%Fmultiple STARTUP files\n"));
5585 first_file->filename = name;
5586 first_file->local_sym_name = name;
5587 first_file->real = TRUE;
5589 startup_file = name;
5593 lang_float (bfd_boolean maybe)
5595 lang_float_flag = maybe;
5599 /* Work out the load- and run-time regions from a script statement, and
5600 store them in *LMA_REGION and *REGION respectively.
5602 MEMSPEC is the name of the run-time region, or the value of
5603 DEFAULT_MEMORY_REGION if the statement didn't specify one.
5604 LMA_MEMSPEC is the name of the load-time region, or null if the
5605 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
5606 had an explicit load address.
5608 It is an error to specify both a load region and a load address. */
5611 lang_get_regions (lang_memory_region_type **region,
5612 lang_memory_region_type **lma_region,
5613 const char *memspec,
5614 const char *lma_memspec,
5615 bfd_boolean have_lma,
5616 bfd_boolean have_vma)
5618 *lma_region = lang_memory_region_lookup (lma_memspec, FALSE);
5620 /* If no runtime region or VMA has been specified, but the load region
5621 has been specified, then use the load region for the runtime region
5623 if (lma_memspec != NULL
5625 && strcmp (memspec, DEFAULT_MEMORY_REGION) == 0)
5626 *region = *lma_region;
5628 *region = lang_memory_region_lookup (memspec, FALSE);
5630 if (have_lma && lma_memspec != 0)
5631 einfo (_("%X%P:%S: section has both a load address and a load region\n"));
5635 lang_leave_output_section_statement (fill_type *fill, const char *memspec,
5636 lang_output_section_phdr_list *phdrs,
5637 const char *lma_memspec)
5639 lang_get_regions (¤t_section->region,
5640 ¤t_section->lma_region,
5641 memspec, lma_memspec,
5642 current_section->load_base != NULL,
5643 current_section->addr_tree != NULL);
5644 current_section->fill = fill;
5645 current_section->phdrs = phdrs;
5646 stat_ptr = &statement_list;
5649 /* Create an absolute symbol with the given name with the value of the
5650 address of first byte of the section named.
5652 If the symbol already exists, then do nothing. */
5655 lang_abs_symbol_at_beginning_of (const char *secname, const char *name)
5657 struct bfd_link_hash_entry *h;
5659 h = bfd_link_hash_lookup (link_info.hash, name, TRUE, TRUE, TRUE);
5661 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
5663 if (h->type == bfd_link_hash_new
5664 || h->type == bfd_link_hash_undefined)
5668 h->type = bfd_link_hash_defined;
5670 sec = bfd_get_section_by_name (output_bfd, secname);
5674 h->u.def.value = bfd_get_section_vma (output_bfd, sec);
5676 h->u.def.section = bfd_abs_section_ptr;
5680 /* Create an absolute symbol with the given name with the value of the
5681 address of the first byte after the end of the section named.
5683 If the symbol already exists, then do nothing. */
5686 lang_abs_symbol_at_end_of (const char *secname, const char *name)
5688 struct bfd_link_hash_entry *h;
5690 h = bfd_link_hash_lookup (link_info.hash, name, TRUE, TRUE, TRUE);
5692 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
5694 if (h->type == bfd_link_hash_new
5695 || h->type == bfd_link_hash_undefined)
5699 h->type = bfd_link_hash_defined;
5701 sec = bfd_get_section_by_name (output_bfd, secname);
5705 h->u.def.value = (bfd_get_section_vma (output_bfd, sec)
5706 + TO_ADDR (sec->size));
5708 h->u.def.section = bfd_abs_section_ptr;
5713 lang_statement_append (lang_statement_list_type *list,
5714 lang_statement_union_type *element,
5715 lang_statement_union_type **field)
5717 *(list->tail) = element;
5721 /* Set the output format type. -oformat overrides scripts. */
5724 lang_add_output_format (const char *format,
5729 if (output_target == NULL || !from_script)
5731 if (command_line.endian == ENDIAN_BIG
5734 else if (command_line.endian == ENDIAN_LITTLE
5738 output_target = format;
5742 /* Enter a group. This creates a new lang_group_statement, and sets
5743 stat_ptr to build new statements within the group. */
5746 lang_enter_group (void)
5748 lang_group_statement_type *g;
5750 g = new_stat (lang_group_statement, stat_ptr);
5751 lang_list_init (&g->children);
5752 stat_ptr = &g->children;
5755 /* Leave a group. This just resets stat_ptr to start writing to the
5756 regular list of statements again. Note that this will not work if
5757 groups can occur inside anything else which can adjust stat_ptr,
5758 but currently they can't. */
5761 lang_leave_group (void)
5763 stat_ptr = &statement_list;
5766 /* Add a new program header. This is called for each entry in a PHDRS
5767 command in a linker script. */
5770 lang_new_phdr (const char *name,
5772 bfd_boolean filehdr,
5777 struct lang_phdr *n, **pp;
5779 n = stat_alloc (sizeof (struct lang_phdr));
5782 n->type = exp_get_value_int (type, 0, "program header type",
5783 lang_final_phase_enum);
5784 n->filehdr = filehdr;
5789 for (pp = &lang_phdr_list; *pp != NULL; pp = &(*pp)->next)
5794 /* Record the program header information in the output BFD. FIXME: We
5795 should not be calling an ELF specific function here. */
5798 lang_record_phdrs (void)
5802 lang_output_section_phdr_list *last;
5803 struct lang_phdr *l;
5804 lang_output_section_statement_type *os;
5807 secs = xmalloc (alc * sizeof (asection *));
5809 for (l = lang_phdr_list; l != NULL; l = l->next)
5816 for (os = &lang_output_section_statement.head->output_section_statement;
5820 lang_output_section_phdr_list *pl;
5822 if (os->constraint == -1)
5830 if (os->sectype == noload_section
5831 || os->bfd_section == NULL
5832 || (os->bfd_section->flags & SEC_ALLOC) == 0)
5837 if (os->bfd_section == NULL)
5840 for (; pl != NULL; pl = pl->next)
5842 if (strcmp (pl->name, l->name) == 0)
5847 secs = xrealloc (secs, alc * sizeof (asection *));
5849 secs[c] = os->bfd_section;
5856 if (l->flags == NULL)
5859 flags = exp_get_vma (l->flags, 0, "phdr flags",
5860 lang_final_phase_enum);
5865 at = exp_get_vma (l->at, 0, "phdr load address",
5866 lang_final_phase_enum);
5868 if (! bfd_record_phdr (output_bfd, l->type,
5869 l->flags != NULL, flags, l->at != NULL,
5870 at, l->filehdr, l->phdrs, c, secs))
5871 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
5876 /* Make sure all the phdr assignments succeeded. */
5877 for (os = &lang_output_section_statement.head->output_section_statement;
5881 lang_output_section_phdr_list *pl;
5883 if (os->constraint == -1
5884 || os->bfd_section == NULL)
5887 for (pl = os->phdrs;
5890 if (! pl->used && strcmp (pl->name, "NONE") != 0)
5891 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
5892 os->name, pl->name);
5896 /* Record a list of sections which may not be cross referenced. */
5899 lang_add_nocrossref (lang_nocrossref_type *l)
5901 struct lang_nocrossrefs *n;
5903 n = xmalloc (sizeof *n);
5904 n->next = nocrossref_list;
5906 nocrossref_list = n;
5908 /* Set notice_all so that we get informed about all symbols. */
5909 link_info.notice_all = TRUE;
5912 /* Overlay handling. We handle overlays with some static variables. */
5914 /* The overlay virtual address. */
5915 static etree_type *overlay_vma;
5916 /* And subsection alignment. */
5917 static etree_type *overlay_subalign;
5919 /* An expression for the maximum section size seen so far. */
5920 static etree_type *overlay_max;
5922 /* A list of all the sections in this overlay. */
5924 struct overlay_list {
5925 struct overlay_list *next;
5926 lang_output_section_statement_type *os;
5929 static struct overlay_list *overlay_list;
5931 /* Start handling an overlay. */
5934 lang_enter_overlay (etree_type *vma_expr, etree_type *subalign)
5936 /* The grammar should prevent nested overlays from occurring. */
5937 ASSERT (overlay_vma == NULL
5938 && overlay_subalign == NULL
5939 && overlay_max == NULL);
5941 overlay_vma = vma_expr;
5942 overlay_subalign = subalign;
5945 /* Start a section in an overlay. We handle this by calling
5946 lang_enter_output_section_statement with the correct VMA.
5947 lang_leave_overlay sets up the LMA and memory regions. */
5950 lang_enter_overlay_section (const char *name)
5952 struct overlay_list *n;
5955 lang_enter_output_section_statement (name, overlay_vma, normal_section,
5956 0, overlay_subalign, 0, 0);
5958 /* If this is the first section, then base the VMA of future
5959 sections on this one. This will work correctly even if `.' is
5960 used in the addresses. */
5961 if (overlay_list == NULL)
5962 overlay_vma = exp_nameop (ADDR, name);
5964 /* Remember the section. */
5965 n = xmalloc (sizeof *n);
5966 n->os = current_section;
5967 n->next = overlay_list;
5970 size = exp_nameop (SIZEOF, name);
5972 /* Arrange to work out the maximum section end address. */
5973 if (overlay_max == NULL)
5976 overlay_max = exp_binop (MAX_K, overlay_max, size);
5979 /* Finish a section in an overlay. There isn't any special to do
5983 lang_leave_overlay_section (fill_type *fill,
5984 lang_output_section_phdr_list *phdrs)
5991 name = current_section->name;
5993 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
5994 region and that no load-time region has been specified. It doesn't
5995 really matter what we say here, since lang_leave_overlay will
5997 lang_leave_output_section_statement (fill, DEFAULT_MEMORY_REGION, phdrs, 0);
5999 /* Define the magic symbols. */
6001 clean = xmalloc (strlen (name) + 1);
6003 for (s1 = name; *s1 != '\0'; s1++)
6004 if (ISALNUM (*s1) || *s1 == '_')
6008 buf = xmalloc (strlen (clean) + sizeof "__load_start_");
6009 sprintf (buf, "__load_start_%s", clean);
6010 lang_add_assignment (exp_assop ('=', buf,
6011 exp_nameop (LOADADDR, name)));
6013 buf = xmalloc (strlen (clean) + sizeof "__load_stop_");
6014 sprintf (buf, "__load_stop_%s", clean);
6015 lang_add_assignment (exp_assop ('=', buf,
6017 exp_nameop (LOADADDR, name),
6018 exp_nameop (SIZEOF, name))));
6023 /* Finish an overlay. If there are any overlay wide settings, this
6024 looks through all the sections in the overlay and sets them. */
6027 lang_leave_overlay (etree_type *lma_expr,
6030 const char *memspec,
6031 lang_output_section_phdr_list *phdrs,
6032 const char *lma_memspec)
6034 lang_memory_region_type *region;
6035 lang_memory_region_type *lma_region;
6036 struct overlay_list *l;
6037 lang_nocrossref_type *nocrossref;
6039 lang_get_regions (®ion, &lma_region,
6040 memspec, lma_memspec,
6041 lma_expr != NULL, FALSE);
6045 /* After setting the size of the last section, set '.' to end of the
6047 if (overlay_list != NULL)
6048 overlay_list->os->update_dot_tree
6049 = exp_assop ('=', ".", exp_binop ('+', overlay_vma, overlay_max));
6054 struct overlay_list *next;
6056 if (fill != NULL && l->os->fill == NULL)
6059 l->os->region = region;
6060 l->os->lma_region = lma_region;
6062 /* The first section has the load address specified in the
6063 OVERLAY statement. The rest are worked out from that.
6064 The base address is not needed (and should be null) if
6065 an LMA region was specified. */
6067 l->os->load_base = lma_expr;
6068 else if (lma_region == 0)
6069 l->os->load_base = exp_binop ('+',
6070 exp_nameop (LOADADDR, l->next->os->name),
6071 exp_nameop (SIZEOF, l->next->os->name));
6073 if (phdrs != NULL && l->os->phdrs == NULL)
6074 l->os->phdrs = phdrs;
6078 lang_nocrossref_type *nc;
6080 nc = xmalloc (sizeof *nc);
6081 nc->name = l->os->name;
6082 nc->next = nocrossref;
6091 if (nocrossref != NULL)
6092 lang_add_nocrossref (nocrossref);
6095 overlay_list = NULL;
6099 /* Version handling. This is only useful for ELF. */
6101 /* This global variable holds the version tree that we build. */
6103 struct bfd_elf_version_tree *lang_elf_version_info;
6105 /* If PREV is NULL, return first version pattern matching particular symbol.
6106 If PREV is non-NULL, return first version pattern matching particular
6107 symbol after PREV (previously returned by lang_vers_match). */
6109 static struct bfd_elf_version_expr *
6110 lang_vers_match (struct bfd_elf_version_expr_head *head,
6111 struct bfd_elf_version_expr *prev,
6114 const char *cxx_sym = sym;
6115 const char *java_sym = sym;
6116 struct bfd_elf_version_expr *expr = NULL;
6118 if (head->mask & BFD_ELF_VERSION_CXX_TYPE)
6120 cxx_sym = cplus_demangle (sym, DMGL_PARAMS | DMGL_ANSI);
6124 if (head->mask & BFD_ELF_VERSION_JAVA_TYPE)
6126 java_sym = cplus_demangle (sym, DMGL_JAVA);
6131 if (head->htab && (prev == NULL || prev->symbol))
6133 struct bfd_elf_version_expr e;
6135 switch (prev ? prev->mask : 0)
6138 if (head->mask & BFD_ELF_VERSION_C_TYPE)
6141 expr = htab_find (head->htab, &e);
6142 while (expr && strcmp (expr->symbol, sym) == 0)
6143 if (expr->mask == BFD_ELF_VERSION_C_TYPE)
6149 case BFD_ELF_VERSION_C_TYPE:
6150 if (head->mask & BFD_ELF_VERSION_CXX_TYPE)
6153 expr = htab_find (head->htab, &e);
6154 while (expr && strcmp (expr->symbol, cxx_sym) == 0)
6155 if (expr->mask == BFD_ELF_VERSION_CXX_TYPE)
6161 case BFD_ELF_VERSION_CXX_TYPE:
6162 if (head->mask & BFD_ELF_VERSION_JAVA_TYPE)
6164 e.symbol = java_sym;
6165 expr = htab_find (head->htab, &e);
6166 while (expr && strcmp (expr->symbol, java_sym) == 0)
6167 if (expr->mask == BFD_ELF_VERSION_JAVA_TYPE)
6178 /* Finally, try the wildcards. */
6179 if (prev == NULL || prev->symbol)
6180 expr = head->remaining;
6187 if (expr->pattern[0] == '*' && expr->pattern[1] == '\0')
6190 if (expr->mask == BFD_ELF_VERSION_JAVA_TYPE)
6192 else if (expr->mask == BFD_ELF_VERSION_CXX_TYPE)
6196 if (fnmatch (expr->pattern, s, 0) == 0)
6203 free ((char *) cxx_sym);
6204 if (java_sym != sym)
6205 free ((char *) java_sym);
6209 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
6210 return a string pointing to the symbol name. */
6213 realsymbol (const char *pattern)
6216 bfd_boolean changed = FALSE, backslash = FALSE;
6217 char *s, *symbol = xmalloc (strlen (pattern) + 1);
6219 for (p = pattern, s = symbol; *p != '\0'; ++p)
6221 /* It is a glob pattern only if there is no preceding
6223 if (! backslash && (*p == '?' || *p == '*' || *p == '['))
6231 /* Remove the preceding backslash. */
6238 backslash = *p == '\\';
6253 /* This is called for each variable name or match expression. */
6255 struct bfd_elf_version_expr *
6256 lang_new_vers_pattern (struct bfd_elf_version_expr *orig,
6260 struct bfd_elf_version_expr *ret;
6262 ret = xmalloc (sizeof *ret);
6267 ret->symbol = realsymbol (new);
6269 if (lang == NULL || strcasecmp (lang, "C") == 0)
6270 ret->mask = BFD_ELF_VERSION_C_TYPE;
6271 else if (strcasecmp (lang, "C++") == 0)
6272 ret->mask = BFD_ELF_VERSION_CXX_TYPE;
6273 else if (strcasecmp (lang, "Java") == 0)
6274 ret->mask = BFD_ELF_VERSION_JAVA_TYPE;
6277 einfo (_("%X%P: unknown language `%s' in version information\n"),
6279 ret->mask = BFD_ELF_VERSION_C_TYPE;
6282 return ldemul_new_vers_pattern (ret);
6285 /* This is called for each set of variable names and match
6288 struct bfd_elf_version_tree *
6289 lang_new_vers_node (struct bfd_elf_version_expr *globals,
6290 struct bfd_elf_version_expr *locals)
6292 struct bfd_elf_version_tree *ret;
6294 ret = xcalloc (1, sizeof *ret);
6295 ret->globals.list = globals;
6296 ret->locals.list = locals;
6297 ret->match = lang_vers_match;
6298 ret->name_indx = (unsigned int) -1;
6302 /* This static variable keeps track of version indices. */
6304 static int version_index;
6307 version_expr_head_hash (const void *p)
6309 const struct bfd_elf_version_expr *e = p;
6311 return htab_hash_string (e->symbol);
6315 version_expr_head_eq (const void *p1, const void *p2)
6317 const struct bfd_elf_version_expr *e1 = p1;
6318 const struct bfd_elf_version_expr *e2 = p2;
6320 return strcmp (e1->symbol, e2->symbol) == 0;
6324 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head *head)
6327 struct bfd_elf_version_expr *e, *next;
6328 struct bfd_elf_version_expr **list_loc, **remaining_loc;
6330 for (e = head->list; e; e = e->next)
6334 head->mask |= e->mask;
6339 head->htab = htab_create (count * 2, version_expr_head_hash,
6340 version_expr_head_eq, NULL);
6341 list_loc = &head->list;
6342 remaining_loc = &head->remaining;
6343 for (e = head->list; e; e = next)
6349 remaining_loc = &e->next;
6353 void **loc = htab_find_slot (head->htab, e, INSERT);
6357 struct bfd_elf_version_expr *e1, *last;
6363 if (e1->mask == e->mask)
6371 while (e1 && strcmp (e1->symbol, e->symbol) == 0);
6375 /* This is a duplicate. */
6376 /* FIXME: Memory leak. Sometimes pattern is not
6377 xmalloced alone, but in larger chunk of memory. */
6378 /* free (e->symbol); */
6383 e->next = last->next;
6391 list_loc = &e->next;
6395 *remaining_loc = NULL;
6396 *list_loc = head->remaining;
6399 head->remaining = head->list;
6402 /* This is called when we know the name and dependencies of the
6406 lang_register_vers_node (const char *name,
6407 struct bfd_elf_version_tree *version,
6408 struct bfd_elf_version_deps *deps)
6410 struct bfd_elf_version_tree *t, **pp;
6411 struct bfd_elf_version_expr *e1;
6416 if ((name[0] == '\0' && lang_elf_version_info != NULL)
6417 || (lang_elf_version_info && lang_elf_version_info->name[0] == '\0'))
6419 einfo (_("%X%P: anonymous version tag cannot be combined"
6420 " with other version tags\n"));
6425 /* Make sure this node has a unique name. */
6426 for (t = lang_elf_version_info; t != NULL; t = t->next)
6427 if (strcmp (t->name, name) == 0)
6428 einfo (_("%X%P: duplicate version tag `%s'\n"), name);
6430 lang_finalize_version_expr_head (&version->globals);
6431 lang_finalize_version_expr_head (&version->locals);
6433 /* Check the global and local match names, and make sure there
6434 aren't any duplicates. */
6436 for (e1 = version->globals.list; e1 != NULL; e1 = e1->next)
6438 for (t = lang_elf_version_info; t != NULL; t = t->next)
6440 struct bfd_elf_version_expr *e2;
6442 if (t->locals.htab && e1->symbol)
6444 e2 = htab_find (t->locals.htab, e1);
6445 while (e2 && strcmp (e1->symbol, e2->symbol) == 0)
6447 if (e1->mask == e2->mask)
6448 einfo (_("%X%P: duplicate expression `%s'"
6449 " in version information\n"), e1->symbol);
6453 else if (!e1->symbol)
6454 for (e2 = t->locals.remaining; e2 != NULL; e2 = e2->next)
6455 if (strcmp (e1->pattern, e2->pattern) == 0
6456 && e1->mask == e2->mask)
6457 einfo (_("%X%P: duplicate expression `%s'"
6458 " in version information\n"), e1->pattern);
6462 for (e1 = version->locals.list; e1 != NULL; e1 = e1->next)
6464 for (t = lang_elf_version_info; t != NULL; t = t->next)
6466 struct bfd_elf_version_expr *e2;
6468 if (t->globals.htab && e1->symbol)
6470 e2 = htab_find (t->globals.htab, e1);
6471 while (e2 && strcmp (e1->symbol, e2->symbol) == 0)
6473 if (e1->mask == e2->mask)
6474 einfo (_("%X%P: duplicate expression `%s'"
6475 " in version information\n"),
6480 else if (!e1->symbol)
6481 for (e2 = t->globals.remaining; e2 != NULL; e2 = e2->next)
6482 if (strcmp (e1->pattern, e2->pattern) == 0
6483 && e1->mask == e2->mask)
6484 einfo (_("%X%P: duplicate expression `%s'"
6485 " in version information\n"), e1->pattern);
6489 version->deps = deps;
6490 version->name = name;
6491 if (name[0] != '\0')
6494 version->vernum = version_index;
6497 version->vernum = 0;
6499 for (pp = &lang_elf_version_info; *pp != NULL; pp = &(*pp)->next)
6504 /* This is called when we see a version dependency. */
6506 struct bfd_elf_version_deps *
6507 lang_add_vers_depend (struct bfd_elf_version_deps *list, const char *name)
6509 struct bfd_elf_version_deps *ret;
6510 struct bfd_elf_version_tree *t;
6512 ret = xmalloc (sizeof *ret);
6515 for (t = lang_elf_version_info; t != NULL; t = t->next)
6517 if (strcmp (t->name, name) == 0)
6519 ret->version_needed = t;
6524 einfo (_("%X%P: unable to find version dependency `%s'\n"), name);
6530 lang_do_version_exports_section (void)
6532 struct bfd_elf_version_expr *greg = NULL, *lreg;
6534 LANG_FOR_EACH_INPUT_STATEMENT (is)
6536 asection *sec = bfd_get_section_by_name (is->the_bfd, ".exports");
6544 contents = xmalloc (len);
6545 if (!bfd_get_section_contents (is->the_bfd, sec, contents, 0, len))
6546 einfo (_("%X%P: unable to read .exports section contents\n"), sec);
6549 while (p < contents + len)
6551 greg = lang_new_vers_pattern (greg, p, NULL);
6552 p = strchr (p, '\0') + 1;
6555 /* Do not free the contents, as we used them creating the regex. */
6557 /* Do not include this section in the link. */
6558 sec->flags |= SEC_EXCLUDE;
6561 lreg = lang_new_vers_pattern (NULL, "*", NULL);
6562 lang_register_vers_node (command_line.version_exports_section,
6563 lang_new_vers_node (greg, lreg), NULL);
6567 lang_add_unique (const char *name)
6569 struct unique_sections *ent;
6571 for (ent = unique_section_list; ent; ent = ent->next)
6572 if (strcmp (ent->name, name) == 0)
6575 ent = xmalloc (sizeof *ent);
6576 ent->name = xstrdup (name);
6577 ent->next = unique_section_list;
6578 unique_section_list = ent;