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 static const char *entry_symbol_default = "start";
95 const char *entry_section = ".text";
96 bfd_boolean entry_from_cmdline;
97 bfd_boolean lang_has_input_file = FALSE;
98 bfd_boolean had_output_filename = FALSE;
99 bfd_boolean lang_float_flag = FALSE;
100 bfd_boolean delete_output_file_on_failure = FALSE;
101 struct lang_nocrossrefs *nocrossref_list;
102 static struct unique_sections *unique_section_list;
103 static bfd_boolean ldlang_sysrooted_script = FALSE;
105 /* Functions that traverse the linker script and might evaluate
106 DEFINED() need to increment this. */
107 int lang_statement_iteration = 0;
109 etree_type *base; /* Relocation base - or null */
111 /* Return TRUE if the PATTERN argument is a wildcard pattern.
112 Although backslashes are treated specially if a pattern contains
113 wildcards, we do not consider the mere presence of a backslash to
114 be enough to cause the pattern to be treated as a wildcard.
115 That lets us handle DOS filenames more naturally. */
116 #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL)
118 #define new_stat(x, y) \
119 (x##_type *) new_statement (x##_enum, sizeof (x##_type), y)
121 #define outside_section_address(q) \
122 ((q)->output_offset + (q)->output_section->vma)
124 #define outside_symbol_address(q) \
125 ((q)->value + outside_section_address (q->section))
127 #define SECTION_NAME_MAP_LENGTH (16)
130 stat_alloc (size_t size)
132 return obstack_alloc (&stat_obstack, size);
136 unique_section_p (const asection *sec)
138 struct unique_sections *unam;
141 if (link_info.relocatable
142 && sec->owner != NULL
143 && bfd_is_group_section (sec->owner, sec))
147 for (unam = unique_section_list; unam; unam = unam->next)
148 if (wildcardp (unam->name)
149 ? fnmatch (unam->name, secnam, 0) == 0
150 : strcmp (unam->name, secnam) == 0)
158 /* Generic traversal routines for finding matching sections. */
160 /* Try processing a section against a wildcard. This just calls
161 the callback unless the filename exclusion list is present
162 and excludes the file. It's hardly ever present so this
163 function is very fast. */
166 walk_wild_consider_section (lang_wild_statement_type *ptr,
167 lang_input_statement_type *file,
169 struct wildcard_list *sec,
173 bfd_boolean skip = FALSE;
174 struct name_list *list_tmp;
176 /* Don't process sections from files which were
178 for (list_tmp = sec->spec.exclude_name_list;
180 list_tmp = list_tmp->next)
182 bfd_boolean is_wildcard = wildcardp (list_tmp->name);
184 skip = fnmatch (list_tmp->name, file->filename, 0) == 0;
186 skip = strcmp (list_tmp->name, file->filename) == 0;
188 /* If this file is part of an archive, and the archive is
189 excluded, exclude this file. */
190 if (! skip && file->the_bfd != NULL
191 && file->the_bfd->my_archive != NULL
192 && file->the_bfd->my_archive->filename != NULL)
195 skip = fnmatch (list_tmp->name,
196 file->the_bfd->my_archive->filename,
199 skip = strcmp (list_tmp->name,
200 file->the_bfd->my_archive->filename) == 0;
208 (*callback) (ptr, sec, s, file, data);
211 /* Lowest common denominator routine that can handle everything correctly,
215 walk_wild_section_general (lang_wild_statement_type *ptr,
216 lang_input_statement_type *file,
221 struct wildcard_list *sec;
223 for (s = file->the_bfd->sections; s != NULL; s = s->next)
225 sec = ptr->section_list;
227 (*callback) (ptr, sec, s, file, data);
231 bfd_boolean skip = FALSE;
233 if (sec->spec.name != NULL)
235 const char *sname = bfd_get_section_name (file->the_bfd, s);
237 if (wildcardp (sec->spec.name))
238 skip = fnmatch (sec->spec.name, sname, 0) != 0;
240 skip = strcmp (sec->spec.name, sname) != 0;
244 walk_wild_consider_section (ptr, file, s, sec, callback, data);
251 /* Routines to find a single section given its name. If there's more
252 than one section with that name, we report that. */
256 asection *found_section;
257 bfd_boolean multiple_sections_found;
258 } section_iterator_callback_data;
261 section_iterator_callback (bfd *bfd ATTRIBUTE_UNUSED, asection *s, void *data)
263 section_iterator_callback_data *d = data;
265 if (d->found_section != NULL)
267 d->multiple_sections_found = TRUE;
271 d->found_section = s;
276 find_section (lang_input_statement_type *file,
277 struct wildcard_list *sec,
278 bfd_boolean *multiple_sections_found)
280 section_iterator_callback_data cb_data = { NULL, FALSE };
282 bfd_get_section_by_name_if (file->the_bfd, sec->spec.name,
283 section_iterator_callback, &cb_data);
284 *multiple_sections_found = cb_data.multiple_sections_found;
285 return cb_data.found_section;
288 /* Code for handling simple wildcards without going through fnmatch,
289 which can be expensive because of charset translations etc. */
291 /* A simple wild is a literal string followed by a single '*',
292 where the literal part is at least 4 characters long. */
295 is_simple_wild (const char *name)
297 size_t len = strcspn (name, "*?[");
298 return len >= 4 && name[len] == '*' && name[len + 1] == '\0';
302 match_simple_wild (const char *pattern, const char *name)
304 /* The first four characters of the pattern are guaranteed valid
305 non-wildcard characters. So we can go faster. */
306 if (pattern[0] != name[0] || pattern[1] != name[1]
307 || pattern[2] != name[2] || pattern[3] != name[3])
312 while (*pattern != '*')
313 if (*name++ != *pattern++)
319 /* Specialized, optimized routines for handling different kinds of
323 walk_wild_section_specs1_wild0 (lang_wild_statement_type *ptr,
324 lang_input_statement_type *file,
328 /* We can just do a hash lookup for the section with the right name.
329 But if that lookup discovers more than one section with the name
330 (should be rare), we fall back to the general algorithm because
331 we would otherwise have to sort the sections to make sure they
332 get processed in the bfd's order. */
333 bfd_boolean multiple_sections_found;
334 struct wildcard_list *sec0 = ptr->handler_data[0];
335 asection *s0 = find_section (file, sec0, &multiple_sections_found);
337 if (multiple_sections_found)
338 walk_wild_section_general (ptr, file, callback, data);
340 walk_wild_consider_section (ptr, file, s0, sec0, callback, data);
344 walk_wild_section_specs1_wild1 (lang_wild_statement_type *ptr,
345 lang_input_statement_type *file,
350 struct wildcard_list *wildsec0 = ptr->handler_data[0];
352 for (s = file->the_bfd->sections; s != NULL; s = s->next)
354 const char *sname = bfd_get_section_name (file->the_bfd, s);
355 bfd_boolean skip = !match_simple_wild (wildsec0->spec.name, sname);
358 walk_wild_consider_section (ptr, file, s, wildsec0, callback, data);
363 walk_wild_section_specs2_wild1 (lang_wild_statement_type *ptr,
364 lang_input_statement_type *file,
369 struct wildcard_list *sec0 = ptr->handler_data[0];
370 struct wildcard_list *wildsec1 = ptr->handler_data[1];
371 bfd_boolean multiple_sections_found;
372 asection *s0 = find_section (file, sec0, &multiple_sections_found);
374 if (multiple_sections_found)
376 walk_wild_section_general (ptr, file, callback, data);
380 /* Note that if the section was not found, s0 is NULL and
381 we'll simply never succeed the s == s0 test below. */
382 for (s = file->the_bfd->sections; s != NULL; s = s->next)
384 /* Recall that in this code path, a section cannot satisfy more
385 than one spec, so if s == s0 then it cannot match
388 walk_wild_consider_section (ptr, file, s, sec0, callback, data);
391 const char *sname = bfd_get_section_name (file->the_bfd, s);
392 bfd_boolean skip = !match_simple_wild (wildsec1->spec.name, sname);
395 walk_wild_consider_section (ptr, file, s, wildsec1, callback,
402 walk_wild_section_specs3_wild2 (lang_wild_statement_type *ptr,
403 lang_input_statement_type *file,
408 struct wildcard_list *sec0 = ptr->handler_data[0];
409 struct wildcard_list *wildsec1 = ptr->handler_data[1];
410 struct wildcard_list *wildsec2 = ptr->handler_data[2];
411 bfd_boolean multiple_sections_found;
412 asection *s0 = find_section (file, sec0, &multiple_sections_found);
414 if (multiple_sections_found)
416 walk_wild_section_general (ptr, file, callback, data);
420 for (s = file->the_bfd->sections; s != NULL; s = s->next)
423 walk_wild_consider_section (ptr, file, s, sec0, callback, data);
426 const char *sname = bfd_get_section_name (file->the_bfd, s);
427 bfd_boolean skip = !match_simple_wild (wildsec1->spec.name, sname);
430 walk_wild_consider_section (ptr, file, s, wildsec1, callback, data);
433 skip = !match_simple_wild (wildsec2->spec.name, sname);
435 walk_wild_consider_section (ptr, file, s, wildsec2, callback,
443 walk_wild_section_specs4_wild2 (lang_wild_statement_type *ptr,
444 lang_input_statement_type *file,
449 struct wildcard_list *sec0 = ptr->handler_data[0];
450 struct wildcard_list *sec1 = ptr->handler_data[1];
451 struct wildcard_list *wildsec2 = ptr->handler_data[2];
452 struct wildcard_list *wildsec3 = ptr->handler_data[3];
453 bfd_boolean multiple_sections_found;
454 asection *s0 = find_section (file, sec0, &multiple_sections_found), *s1;
456 if (multiple_sections_found)
458 walk_wild_section_general (ptr, file, callback, data);
462 s1 = find_section (file, sec1, &multiple_sections_found);
463 if (multiple_sections_found)
465 walk_wild_section_general (ptr, file, callback, data);
469 for (s = file->the_bfd->sections; s != NULL; s = s->next)
472 walk_wild_consider_section (ptr, file, s, sec0, callback, data);
475 walk_wild_consider_section (ptr, file, s, sec1, callback, data);
478 const char *sname = bfd_get_section_name (file->the_bfd, s);
479 bfd_boolean skip = !match_simple_wild (wildsec2->spec.name,
483 walk_wild_consider_section (ptr, file, s, wildsec2, callback,
487 skip = !match_simple_wild (wildsec3->spec.name, sname);
489 walk_wild_consider_section (ptr, file, s, wildsec3,
497 walk_wild_section (lang_wild_statement_type *ptr,
498 lang_input_statement_type *file,
502 if (file->just_syms_flag)
505 (*ptr->walk_wild_section_handler) (ptr, file, callback, data);
508 /* Returns TRUE when name1 is a wildcard spec that might match
509 something name2 can match. We're conservative: we return FALSE
510 only if the prefixes of name1 and name2 are different up to the
511 first wildcard character. */
514 wild_spec_can_overlap (const char *name1, const char *name2)
516 size_t prefix1_len = strcspn (name1, "?*[");
517 size_t prefix2_len = strcspn (name2, "?*[");
518 size_t min_prefix_len;
520 /* Note that if there is no wildcard character, then we treat the
521 terminating 0 as part of the prefix. Thus ".text" won't match
522 ".text." or ".text.*", for example. */
523 if (name1[prefix1_len] == '\0')
525 if (name2[prefix2_len] == '\0')
528 min_prefix_len = prefix1_len < prefix2_len ? prefix1_len : prefix2_len;
530 return memcmp (name1, name2, min_prefix_len) == 0;
533 /* Select specialized code to handle various kinds of wildcard
537 analyze_walk_wild_section_handler (lang_wild_statement_type *ptr)
540 int wild_name_count = 0;
541 struct wildcard_list *sec;
545 ptr->walk_wild_section_handler = walk_wild_section_general;
547 /* Count how many wildcard_specs there are, and how many of those
548 actually use wildcards in the name. Also, bail out if any of the
549 wildcard names are NULL. (Can this actually happen?
550 walk_wild_section used to test for it.) And bail out if any
551 of the wildcards are more complex than a simple string
552 ending in a single '*'. */
553 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
556 if (sec->spec.name == NULL)
558 if (wildcardp (sec->spec.name))
561 if (!is_simple_wild (sec->spec.name))
566 /* The zero-spec case would be easy to optimize but it doesn't
567 happen in practice. Likewise, more than 4 specs doesn't
568 happen in practice. */
569 if (sec_count == 0 || sec_count > 4)
572 /* Check that no two specs can match the same section. */
573 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
575 struct wildcard_list *sec2;
576 for (sec2 = sec->next; sec2 != NULL; sec2 = sec2->next)
578 if (wild_spec_can_overlap (sec->spec.name, sec2->spec.name))
583 signature = (sec_count << 8) + wild_name_count;
587 ptr->walk_wild_section_handler = walk_wild_section_specs1_wild0;
590 ptr->walk_wild_section_handler = walk_wild_section_specs1_wild1;
593 ptr->walk_wild_section_handler = walk_wild_section_specs2_wild1;
596 ptr->walk_wild_section_handler = walk_wild_section_specs3_wild2;
599 ptr->walk_wild_section_handler = walk_wild_section_specs4_wild2;
605 /* Now fill the data array with pointers to the specs, first the
606 specs with non-wildcard names, then the specs with wildcard
607 names. It's OK to process the specs in different order from the
608 given order, because we've already determined that no section
609 will match more than one spec. */
611 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
612 if (!wildcardp (sec->spec.name))
613 ptr->handler_data[data_counter++] = sec;
614 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
615 if (wildcardp (sec->spec.name))
616 ptr->handler_data[data_counter++] = sec;
619 /* Handle a wild statement for a single file F. */
622 walk_wild_file (lang_wild_statement_type *s,
623 lang_input_statement_type *f,
627 if (f->the_bfd == NULL
628 || ! bfd_check_format (f->the_bfd, bfd_archive))
629 walk_wild_section (s, f, callback, data);
634 /* This is an archive file. We must map each member of the
635 archive separately. */
636 member = bfd_openr_next_archived_file (f->the_bfd, NULL);
637 while (member != NULL)
639 /* When lookup_name is called, it will call the add_symbols
640 entry point for the archive. For each element of the
641 archive which is included, BFD will call ldlang_add_file,
642 which will set the usrdata field of the member to the
643 lang_input_statement. */
644 if (member->usrdata != NULL)
646 walk_wild_section (s, member->usrdata, callback, data);
649 member = bfd_openr_next_archived_file (f->the_bfd, member);
655 walk_wild (lang_wild_statement_type *s, callback_t callback, void *data)
657 const char *file_spec = s->filename;
659 if (file_spec == NULL)
661 /* Perform the iteration over all files in the list. */
662 LANG_FOR_EACH_INPUT_STATEMENT (f)
664 walk_wild_file (s, f, callback, data);
667 else if (wildcardp (file_spec))
669 LANG_FOR_EACH_INPUT_STATEMENT (f)
671 if (fnmatch (file_spec, f->filename, FNM_FILE_NAME) == 0)
672 walk_wild_file (s, f, callback, data);
677 lang_input_statement_type *f;
679 /* Perform the iteration over a single file. */
680 f = lookup_name (file_spec);
682 walk_wild_file (s, f, callback, data);
686 /* lang_for_each_statement walks the parse tree and calls the provided
687 function for each node. */
690 lang_for_each_statement_worker (void (*func) (lang_statement_union_type *),
691 lang_statement_union_type *s)
693 for (; s != NULL; s = s->header.next)
697 switch (s->header.type)
699 case lang_constructors_statement_enum:
700 lang_for_each_statement_worker (func, constructor_list.head);
702 case lang_output_section_statement_enum:
703 lang_for_each_statement_worker
704 (func, s->output_section_statement.children.head);
706 case lang_wild_statement_enum:
707 lang_for_each_statement_worker (func,
708 s->wild_statement.children.head);
710 case lang_group_statement_enum:
711 lang_for_each_statement_worker (func,
712 s->group_statement.children.head);
714 case lang_data_statement_enum:
715 case lang_reloc_statement_enum:
716 case lang_object_symbols_statement_enum:
717 case lang_output_statement_enum:
718 case lang_target_statement_enum:
719 case lang_input_section_enum:
720 case lang_input_statement_enum:
721 case lang_assignment_statement_enum:
722 case lang_padding_statement_enum:
723 case lang_address_statement_enum:
724 case lang_fill_statement_enum:
734 lang_for_each_statement (void (*func) (lang_statement_union_type *))
736 lang_for_each_statement_worker (func, statement_list.head);
739 /*----------------------------------------------------------------------*/
742 lang_list_init (lang_statement_list_type *list)
745 list->tail = &list->head;
748 /* Build a new statement node for the parse tree. */
750 static lang_statement_union_type *
751 new_statement (enum statement_enum type,
753 lang_statement_list_type *list)
755 lang_statement_union_type *new;
757 new = stat_alloc (size);
758 new->header.type = type;
759 new->header.next = NULL;
760 lang_statement_append (list, new, &new->header.next);
764 /* Build a new input file node for the language. There are several
765 ways in which we treat an input file, eg, we only look at symbols,
766 or prefix it with a -l etc.
768 We can be supplied with requests for input files more than once;
769 they may, for example be split over several lines like foo.o(.text)
770 foo.o(.data) etc, so when asked for a file we check that we haven't
771 got it already so we don't duplicate the bfd. */
773 static lang_input_statement_type *
774 new_afile (const char *name,
775 lang_input_file_enum_type file_type,
777 bfd_boolean add_to_list)
779 lang_input_statement_type *p;
782 p = new_stat (lang_input_statement, stat_ptr);
785 p = stat_alloc (sizeof (lang_input_statement_type));
786 p->header.next = NULL;
789 lang_has_input_file = TRUE;
791 p->sysrooted = FALSE;
794 case lang_input_file_is_symbols_only_enum:
796 p->is_archive = FALSE;
798 p->local_sym_name = name;
799 p->just_syms_flag = TRUE;
800 p->search_dirs_flag = FALSE;
802 case lang_input_file_is_fake_enum:
804 p->is_archive = FALSE;
806 p->local_sym_name = name;
807 p->just_syms_flag = FALSE;
808 p->search_dirs_flag = FALSE;
810 case lang_input_file_is_l_enum:
811 p->is_archive = TRUE;
814 p->local_sym_name = concat ("-l", name, NULL);
815 p->just_syms_flag = FALSE;
816 p->search_dirs_flag = TRUE;
818 case lang_input_file_is_marker_enum:
820 p->is_archive = FALSE;
822 p->local_sym_name = name;
823 p->just_syms_flag = FALSE;
824 p->search_dirs_flag = TRUE;
826 case lang_input_file_is_search_file_enum:
827 p->sysrooted = ldlang_sysrooted_script;
829 p->is_archive = FALSE;
831 p->local_sym_name = name;
832 p->just_syms_flag = FALSE;
833 p->search_dirs_flag = TRUE;
835 case lang_input_file_is_file_enum:
837 p->is_archive = FALSE;
839 p->local_sym_name = name;
840 p->just_syms_flag = FALSE;
841 p->search_dirs_flag = FALSE;
848 p->next_real_file = NULL;
851 p->dynamic = config.dynamic_link;
852 p->add_needed = add_needed;
853 p->as_needed = as_needed;
854 p->whole_archive = whole_archive;
856 lang_statement_append (&input_file_chain,
857 (lang_statement_union_type *) p,
862 lang_input_statement_type *
863 lang_add_input_file (const char *name,
864 lang_input_file_enum_type file_type,
867 lang_has_input_file = TRUE;
868 return new_afile (name, file_type, target, TRUE);
871 struct output_statement_hash_entry
873 struct bfd_hash_entry root;
874 lang_output_section_statement_type *entry;
877 /* The hash table. */
879 static struct bfd_hash_table output_statement_table;
881 /* Support routines for the hash table used by lang_output_section_find_1,
882 initialize the table, fill in an entry and remove the table. */
884 static struct bfd_hash_entry *
885 output_statement_newfunc (struct bfd_hash_entry *entry ATTRIBUTE_UNUSED,
886 struct bfd_hash_table *table,
887 const char *string ATTRIBUTE_UNUSED)
889 struct output_statement_hash_entry *ret
890 = bfd_hash_allocate (table,
891 sizeof (struct output_statement_hash_entry));
893 return (struct bfd_hash_entry *) ret;
897 output_statement_table_init (void)
899 if (! bfd_hash_table_init_n (&output_statement_table,
900 output_statement_newfunc, 61))
901 einfo (_("%P%F: Failed to create hash table\n"));
905 output_statement_table_free (void)
907 bfd_hash_table_free (&output_statement_table);
910 /* Build enough state so that the parser can build its tree. */
915 obstack_begin (&stat_obstack, 1000);
917 stat_ptr = &statement_list;
919 output_statement_table_init ();
921 lang_list_init (stat_ptr);
923 lang_list_init (&input_file_chain);
924 lang_list_init (&lang_output_section_statement);
925 lang_list_init (&file_chain);
926 first_file = lang_add_input_file (NULL, lang_input_file_is_marker_enum,
929 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME);
931 abs_output_section->bfd_section = bfd_abs_section_ptr;
933 /* The value "3" is ad-hoc, somewhat related to the expected number of
934 DEFINED expressions in a linker script. For most default linker
935 scripts, there are none. Why a hash table then? Well, it's somewhat
936 simpler to re-use working machinery than using a linked list in terms
937 of code-complexity here in ld, besides the initialization which just
938 looks like other code here. */
939 if (!bfd_hash_table_init_n (&lang_definedness_table,
940 lang_definedness_newfunc, 3))
941 einfo (_("%P%F: out of memory during initialization"));
947 output_statement_table_free ();
950 /*----------------------------------------------------------------------
951 A region is an area of memory declared with the
952 MEMORY { name:org=exp, len=exp ... }
955 We maintain a list of all the regions here.
957 If no regions are specified in the script, then the default is used
958 which is created when looked up to be the entire data space.
960 If create is true we are creating a region inside a MEMORY block.
961 In this case it is probably an error to create a region that has
962 already been created. If we are not inside a MEMORY block it is
963 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
964 and so we issue a warning. */
966 static lang_memory_region_type *lang_memory_region_list;
967 static lang_memory_region_type **lang_memory_region_list_tail
968 = &lang_memory_region_list;
970 lang_memory_region_type *
971 lang_memory_region_lookup (const char *const name, bfd_boolean create)
973 lang_memory_region_type *p;
974 lang_memory_region_type *new;
976 /* NAME is NULL for LMA memspecs if no region was specified. */
980 for (p = lang_memory_region_list; p != NULL; p = p->next)
981 if (strcmp (p->name, name) == 0)
984 einfo (_("%P:%S: warning: redeclaration of memory region '%s'\n"),
989 if (!create && strcmp (name, DEFAULT_MEMORY_REGION))
990 einfo (_("%P:%S: warning: memory region %s not declared\n"), name);
992 new = stat_alloc (sizeof (lang_memory_region_type));
994 new->name = xstrdup (name);
997 *lang_memory_region_list_tail = new;
998 lang_memory_region_list_tail = &new->next;
1002 new->length = ~(bfd_size_type) 0;
1004 new->had_full_message = FALSE;
1009 static lang_memory_region_type *
1010 lang_memory_default (asection *section)
1012 lang_memory_region_type *p;
1014 flagword sec_flags = section->flags;
1016 /* Override SEC_DATA to mean a writable section. */
1017 if ((sec_flags & (SEC_ALLOC | SEC_READONLY | SEC_CODE)) == SEC_ALLOC)
1018 sec_flags |= SEC_DATA;
1020 for (p = lang_memory_region_list; p != NULL; p = p->next)
1022 if ((p->flags & sec_flags) != 0
1023 && (p->not_flags & sec_flags) == 0)
1028 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION, FALSE);
1031 static lang_output_section_statement_type *
1032 lang_output_section_find_1 (const char *const name, int constraint)
1034 lang_output_section_statement_type *lookup;
1035 struct output_statement_hash_entry *entry;
1038 entry = ((struct output_statement_hash_entry *)
1039 bfd_hash_lookup (&output_statement_table, name, FALSE,
1041 if (entry == NULL || (lookup = entry->entry) == NULL)
1044 hash = entry->root.hash;
1047 if (lookup->constraint != -1
1049 || (constraint == lookup->constraint
1050 && constraint != SPECIAL)))
1052 entry = (struct output_statement_hash_entry *) entry->root.next;
1053 lookup = entry ? entry->entry : NULL;
1055 while (entry != NULL
1056 && entry->root.hash == hash
1057 && strcmp (name, lookup->name) == 0);
1062 lang_output_section_statement_type *
1063 lang_output_section_find (const char *const name)
1065 return lang_output_section_find_1 (name, 0);
1068 static lang_output_section_statement_type *
1069 lang_output_section_statement_lookup_1 (const char *const name, int constraint)
1071 lang_output_section_statement_type *lookup;
1072 lang_output_section_statement_type **nextp;
1074 lookup = lang_output_section_find_1 (name, constraint);
1077 struct output_statement_hash_entry *entry;
1079 lookup = new_stat (lang_output_section_statement, stat_ptr);
1080 lookup->region = NULL;
1081 lookup->lma_region = NULL;
1083 lookup->block_value = 1;
1084 lookup->name = name;
1086 lookup->next = NULL;
1087 lookup->bfd_section = NULL;
1088 lookup->processed = FALSE;
1089 lookup->constraint = constraint;
1090 lookup->all_input_readonly = FALSE;
1091 lookup->ignored = FALSE;
1092 lookup->sectype = normal_section;
1093 lookup->addr_tree = NULL;
1094 lang_list_init (&lookup->children);
1097 lookup->subsection_alignment = -1;
1098 lookup->section_alignment = -1;
1099 lookup->load_base = NULL;
1100 lookup->update_dot_tree = NULL;
1101 lookup->phdrs = NULL;
1103 entry = ((struct output_statement_hash_entry *)
1104 bfd_hash_lookup (&output_statement_table, name, TRUE,
1107 einfo (_("%P%F: bfd_hash_lookup failed creating section `%s'\n"),
1110 entry->entry = lookup;
1112 /* GCC's strict aliasing rules prevent us from just casting the
1113 address, so we store the pointer in a variable and cast that
1115 nextp = &lookup->next;
1116 lang_statement_append (&lang_output_section_statement,
1117 (lang_statement_union_type *) lookup,
1118 (lang_statement_union_type **) nextp);
1123 lang_output_section_statement_type *
1124 lang_output_section_statement_lookup (const char *const name)
1126 return lang_output_section_statement_lookup_1 (name, 0);
1129 /* A variant of lang_output_section_find used by place_orphan.
1130 Returns the output statement that should precede a new output
1131 statement for SEC. If an exact match is found on certain flags,
1134 lang_output_section_statement_type *
1135 lang_output_section_find_by_flags (const asection *sec,
1136 lang_output_section_statement_type **exact)
1138 lang_output_section_statement_type *first, *look, *found;
1141 /* We know the first statement on this list is *ABS*. May as well
1143 first = &lang_output_section_statement.head->output_section_statement;
1144 first = first->next;
1146 /* First try for an exact match. */
1148 for (look = first; look; look = look->next)
1150 flags = look->flags;
1151 if (look->bfd_section != NULL)
1153 flags = look->bfd_section->flags;
1154 if (!bfd_match_sections_by_type (output_bfd,
1159 flags ^= sec->flags;
1160 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD | SEC_READONLY
1161 | SEC_CODE | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1170 if (sec->flags & SEC_CODE)
1172 /* Try for a rw code section. */
1173 for (look = first; look; look = look->next)
1175 flags = look->flags;
1176 if (look->bfd_section != NULL)
1178 flags = look->bfd_section->flags;
1179 if (!bfd_match_sections_by_type (output_bfd,
1184 flags ^= sec->flags;
1185 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1186 | SEC_CODE | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1192 if (sec->flags & (SEC_READONLY | SEC_THREAD_LOCAL))
1194 /* .rodata can go after .text, .sdata2 after .rodata. */
1195 for (look = first; look; look = look->next)
1197 flags = look->flags;
1198 if (look->bfd_section != NULL)
1200 flags = look->bfd_section->flags;
1201 if (!bfd_match_sections_by_type (output_bfd,
1206 flags ^= sec->flags;
1207 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1209 && !(look->flags & (SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1215 if (sec->flags & SEC_SMALL_DATA)
1217 /* .sdata goes after .data, .sbss after .sdata. */
1218 for (look = first; look; look = look->next)
1220 flags = look->flags;
1221 if (look->bfd_section != NULL)
1223 flags = look->bfd_section->flags;
1224 if (!bfd_match_sections_by_type (output_bfd,
1229 flags ^= sec->flags;
1230 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1231 | SEC_THREAD_LOCAL))
1232 || ((look->flags & SEC_SMALL_DATA)
1233 && !(sec->flags & SEC_HAS_CONTENTS)))
1239 if (sec->flags & SEC_HAS_CONTENTS)
1241 /* .data goes after .rodata. */
1242 for (look = first; look; look = look->next)
1244 flags = look->flags;
1245 if (look->bfd_section != NULL)
1247 flags = look->bfd_section->flags;
1248 if (!bfd_match_sections_by_type (output_bfd,
1253 flags ^= sec->flags;
1254 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1255 | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1261 /* .bss goes last. */
1262 for (look = first; look; look = look->next)
1264 flags = look->flags;
1265 if (look->bfd_section != NULL)
1267 flags = look->bfd_section->flags;
1268 if (!bfd_match_sections_by_type (output_bfd,
1273 flags ^= sec->flags;
1274 if (!(flags & SEC_ALLOC))
1281 /* Find the last output section before given output statement.
1282 Used by place_orphan. */
1285 output_prev_sec_find (lang_output_section_statement_type *os)
1287 asection *s = (asection *) NULL;
1288 lang_output_section_statement_type *lookup;
1290 for (lookup = &lang_output_section_statement.head->output_section_statement;
1292 lookup = lookup->next)
1294 if (lookup->constraint == -1)
1299 if (lookup->bfd_section != NULL && lookup->bfd_section->owner != NULL)
1300 s = lookup->bfd_section;
1306 lang_output_section_statement_type *
1307 lang_insert_orphan (lang_input_statement_type *file,
1309 const char *secname,
1310 lang_output_section_statement_type *after,
1311 struct orphan_save *place,
1312 etree_type *address,
1313 lang_statement_list_type *add_child)
1315 lang_statement_list_type *old;
1316 lang_statement_list_type add;
1318 etree_type *load_base;
1319 lang_output_section_statement_type *os;
1320 lang_output_section_statement_type **os_tail;
1322 /* Start building a list of statements for this section.
1323 First save the current statement pointer. */
1326 /* If we have found an appropriate place for the output section
1327 statements for this orphan, add them to our own private list,
1328 inserting them later into the global statement list. */
1332 lang_list_init (stat_ptr);
1336 if (config.build_constructors)
1338 /* If the name of the section is representable in C, then create
1339 symbols to mark the start and the end of the section. */
1340 for (ps = secname; *ps != '\0'; ps++)
1341 if (! ISALNUM ((unsigned char) *ps) && *ps != '_')
1346 etree_type *e_align;
1348 symname = (char *) xmalloc (ps - secname + sizeof "__start_" + 1);
1349 symname[0] = bfd_get_symbol_leading_char (output_bfd);
1350 sprintf (symname + (symname[0] != 0), "__start_%s", secname);
1351 e_align = exp_unop (ALIGN_K,
1352 exp_intop ((bfd_vma) 1 << s->alignment_power));
1353 lang_add_assignment (exp_assop ('=', ".", e_align));
1354 lang_add_assignment (exp_assop ('=', symname,
1355 exp_nameop (NAME, ".")));
1359 if (link_info.relocatable || (s->flags & (SEC_LOAD | SEC_ALLOC)) == 0)
1360 address = exp_intop (0);
1363 if (after != NULL && after->load_base != NULL)
1365 etree_type *lma_from_vma;
1366 lma_from_vma = exp_binop ('-', after->load_base,
1367 exp_nameop (ADDR, after->name));
1368 load_base = exp_binop ('+', lma_from_vma,
1369 exp_nameop (ADDR, secname));
1372 os_tail = ((lang_output_section_statement_type **)
1373 lang_output_section_statement.tail);
1374 os = lang_enter_output_section_statement (secname, address, 0, NULL, NULL,
1377 if (add_child == NULL)
1378 add_child = &os->children;
1379 lang_add_section (add_child, s, os, file);
1381 lang_leave_output_section_statement (0, "*default*", NULL, NULL);
1383 if (config.build_constructors && *ps == '\0')
1387 /* lang_leave_ouput_section_statement resets stat_ptr.
1388 Put stat_ptr back where we want it. */
1392 symname = (char *) xmalloc (ps - secname + sizeof "__stop_" + 1);
1393 symname[0] = bfd_get_symbol_leading_char (output_bfd);
1394 sprintf (symname + (symname[0] != 0), "__stop_%s", secname);
1395 lang_add_assignment (exp_assop ('=', symname,
1396 exp_nameop (NAME, ".")));
1399 /* Restore the global list pointer. */
1403 if (after != NULL && os->bfd_section != NULL)
1405 asection *snew, *as;
1407 snew = os->bfd_section;
1409 /* Shuffle the bfd section list to make the output file look
1410 neater. This is really only cosmetic. */
1411 if (place->section == NULL
1412 && after != (&lang_output_section_statement.head
1413 ->output_section_statement))
1415 asection *bfd_section = after->bfd_section;
1417 /* If the output statement hasn't been used to place any input
1418 sections (and thus doesn't have an output bfd_section),
1419 look for the closest prior output statement having an
1421 if (bfd_section == NULL)
1422 bfd_section = output_prev_sec_find (after);
1424 if (bfd_section != NULL && bfd_section != snew)
1425 place->section = &bfd_section->next;
1428 if (place->section == NULL)
1429 place->section = &output_bfd->sections;
1431 as = *place->section;
1432 if (as != snew && as->prev != snew)
1434 /* Unlink the section. */
1435 bfd_section_list_remove (output_bfd, snew);
1437 /* Now tack it back on in the right place. */
1438 bfd_section_list_insert_before (output_bfd, as, snew);
1441 /* Save the end of this list. Further ophans of this type will
1442 follow the one we've just added. */
1443 place->section = &snew->next;
1445 /* The following is non-cosmetic. We try to put the output
1446 statements in some sort of reasonable order here, because they
1447 determine the final load addresses of the orphan sections.
1448 In addition, placing output statements in the wrong order may
1449 require extra segments. For instance, given a typical
1450 situation of all read-only sections placed in one segment and
1451 following that a segment containing all the read-write
1452 sections, we wouldn't want to place an orphan read/write
1453 section before or amongst the read-only ones. */
1454 if (add.head != NULL)
1456 lang_output_section_statement_type *newly_added_os;
1458 if (place->stmt == NULL)
1460 lang_statement_union_type **where;
1461 lang_statement_union_type **assign = NULL;
1463 /* Look for a suitable place for the new statement list.
1464 The idea is to skip over anything that might be inside
1465 a SECTIONS {} statement in a script, before we find
1466 another output_section_statement. Assignments to "dot"
1467 before an output section statement are assumed to
1469 for (where = &after->header.next;
1471 where = &(*where)->header.next)
1473 switch ((*where)->header.type)
1475 case lang_assignment_statement_enum:
1478 lang_assignment_statement_type *ass;
1479 ass = &(*where)->assignment_statement;
1480 if (ass->exp->type.node_class != etree_assert
1481 && ass->exp->assign.dst[0] == '.'
1482 && ass->exp->assign.dst[1] == 0)
1486 case lang_wild_statement_enum:
1487 case lang_input_section_enum:
1488 case lang_object_symbols_statement_enum:
1489 case lang_fill_statement_enum:
1490 case lang_data_statement_enum:
1491 case lang_reloc_statement_enum:
1492 case lang_padding_statement_enum:
1493 case lang_constructors_statement_enum:
1496 case lang_output_section_statement_enum:
1499 case lang_input_statement_enum:
1500 case lang_address_statement_enum:
1501 case lang_target_statement_enum:
1502 case lang_output_statement_enum:
1503 case lang_group_statement_enum:
1504 case lang_afile_asection_pair_statement_enum:
1513 place->os_tail = &after->next;
1517 /* Put it after the last orphan statement we added. */
1518 *add.tail = *place->stmt;
1519 *place->stmt = add.head;
1522 /* Fix the global list pointer if we happened to tack our
1523 new list at the tail. */
1524 if (*old->tail == add.head)
1525 old->tail = add.tail;
1527 /* Save the end of this list. */
1528 place->stmt = add.tail;
1530 /* Do the same for the list of output section statements. */
1531 newly_added_os = *os_tail;
1533 newly_added_os->next = *place->os_tail;
1534 *place->os_tail = newly_added_os;
1535 place->os_tail = &newly_added_os->next;
1537 /* Fixing the global list pointer here is a little different.
1538 We added to the list in lang_enter_output_section_statement,
1539 trimmed off the new output_section_statment above when
1540 assigning *os_tail = NULL, but possibly added it back in
1541 the same place when assigning *place->os_tail. */
1542 if (*os_tail == NULL)
1543 lang_output_section_statement.tail
1544 = (lang_statement_union_type **) os_tail;
1551 lang_map_flags (flagword flag)
1553 if (flag & SEC_ALLOC)
1556 if (flag & SEC_CODE)
1559 if (flag & SEC_READONLY)
1562 if (flag & SEC_DATA)
1565 if (flag & SEC_LOAD)
1572 lang_memory_region_type *m;
1575 minfo (_("\nMemory Configuration\n\n"));
1576 fprintf (config.map_file, "%-16s %-18s %-18s %s\n",
1577 _("Name"), _("Origin"), _("Length"), _("Attributes"));
1579 for (m = lang_memory_region_list; m != NULL; m = m->next)
1584 fprintf (config.map_file, "%-16s ", m->name);
1586 sprintf_vma (buf, m->origin);
1587 minfo ("0x%s ", buf);
1595 minfo ("0x%V", m->length);
1596 if (m->flags || m->not_flags)
1604 lang_map_flags (m->flags);
1610 lang_map_flags (m->not_flags);
1617 fprintf (config.map_file, _("\nLinker script and memory map\n\n"));
1619 if (! command_line.reduce_memory_overheads)
1621 obstack_begin (&map_obstack, 1000);
1622 for (p = link_info.input_bfds; p != (bfd *) NULL; p = p->link_next)
1623 bfd_map_over_sections (p, init_map_userdata, 0);
1624 bfd_link_hash_traverse (link_info.hash, sort_def_symbol, 0);
1626 print_statements ();
1630 init_map_userdata (abfd, sec, data)
1631 bfd *abfd ATTRIBUTE_UNUSED;
1633 void *data ATTRIBUTE_UNUSED;
1635 fat_section_userdata_type *new_data
1636 = ((fat_section_userdata_type *) (stat_alloc
1637 (sizeof (fat_section_userdata_type))));
1639 ASSERT (get_userdata (sec) == NULL);
1640 get_userdata (sec) = new_data;
1641 new_data->map_symbol_def_tail = &new_data->map_symbol_def_head;
1645 sort_def_symbol (hash_entry, info)
1646 struct bfd_link_hash_entry *hash_entry;
1647 void *info ATTRIBUTE_UNUSED;
1649 if (hash_entry->type == bfd_link_hash_defined
1650 || hash_entry->type == bfd_link_hash_defweak)
1652 struct fat_user_section_struct *ud;
1653 struct map_symbol_def *def;
1655 ud = get_userdata (hash_entry->u.def.section);
1658 /* ??? What do we have to do to initialize this beforehand? */
1659 /* The first time we get here is bfd_abs_section... */
1660 init_map_userdata (0, hash_entry->u.def.section, 0);
1661 ud = get_userdata (hash_entry->u.def.section);
1663 else if (!ud->map_symbol_def_tail)
1664 ud->map_symbol_def_tail = &ud->map_symbol_def_head;
1666 def = obstack_alloc (&map_obstack, sizeof *def);
1667 def->entry = hash_entry;
1668 *(ud->map_symbol_def_tail) = def;
1669 ud->map_symbol_def_tail = &def->next;
1674 /* Initialize an output section. */
1677 init_os (lang_output_section_statement_type *s, asection *isec)
1679 if (s->bfd_section != NULL)
1682 if (strcmp (s->name, DISCARD_SECTION_NAME) == 0)
1683 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME);
1685 s->bfd_section = bfd_get_section_by_name (output_bfd, s->name);
1686 if (s->bfd_section == NULL)
1687 s->bfd_section = bfd_make_section (output_bfd, s->name);
1688 if (s->bfd_section == NULL)
1690 einfo (_("%P%F: output format %s cannot represent section called %s\n"),
1691 output_bfd->xvec->name, s->name);
1693 s->bfd_section->output_section = s->bfd_section;
1694 s->bfd_section->output_offset = 0;
1695 if (!command_line.reduce_memory_overheads)
1697 fat_section_userdata_type *new
1698 = stat_alloc (sizeof (fat_section_userdata_type));
1699 memset (new, 0, sizeof (fat_section_userdata_type));
1700 get_userdata (s->bfd_section) = new;
1704 /* If there is a base address, make sure that any sections it might
1705 mention are initialized. */
1706 if (s->addr_tree != NULL)
1707 exp_init_os (s->addr_tree);
1709 if (s->load_base != NULL)
1710 exp_init_os (s->load_base);
1713 bfd_init_private_section_data (isec->owner, isec,
1714 output_bfd, s->bfd_section,
1718 /* Make sure that all output sections mentioned in an expression are
1722 exp_init_os (etree_type *exp)
1724 switch (exp->type.node_class)
1728 exp_init_os (exp->assign.src);
1732 exp_init_os (exp->binary.lhs);
1733 exp_init_os (exp->binary.rhs);
1737 exp_init_os (exp->trinary.cond);
1738 exp_init_os (exp->trinary.lhs);
1739 exp_init_os (exp->trinary.rhs);
1743 exp_init_os (exp->assert_s.child);
1747 exp_init_os (exp->unary.child);
1751 switch (exp->type.node_code)
1757 lang_output_section_statement_type *os;
1759 os = lang_output_section_find (exp->name.name);
1760 if (os != NULL && os->bfd_section == NULL)
1772 section_already_linked (bfd *abfd, asection *sec, void *data)
1774 lang_input_statement_type *entry = data;
1776 /* If we are only reading symbols from this object, then we want to
1777 discard all sections. */
1778 if (entry->just_syms_flag)
1780 bfd_link_just_syms (abfd, sec, &link_info);
1784 if (!(abfd->flags & DYNAMIC))
1785 bfd_section_already_linked (abfd, sec);
1788 /* The wild routines.
1790 These expand statements like *(.text) and foo.o to a list of
1791 explicit actions, like foo.o(.text), bar.o(.text) and
1792 foo.o(.text, .data). */
1794 /* Add SECTION to the output section OUTPUT. Do this by creating a
1795 lang_input_section statement which is placed at PTR. FILE is the
1796 input file which holds SECTION. */
1799 lang_add_section (lang_statement_list_type *ptr,
1801 lang_output_section_statement_type *output,
1802 lang_input_statement_type *file)
1804 flagword flags = section->flags;
1805 bfd_boolean discard;
1807 /* Discard sections marked with SEC_EXCLUDE. */
1808 discard = (flags & SEC_EXCLUDE) != 0;
1810 /* Discard input sections which are assigned to a section named
1811 DISCARD_SECTION_NAME. */
1812 if (strcmp (output->name, DISCARD_SECTION_NAME) == 0)
1815 /* Discard debugging sections if we are stripping debugging
1817 if ((link_info.strip == strip_debugger || link_info.strip == strip_all)
1818 && (flags & SEC_DEBUGGING) != 0)
1823 if (section->output_section == NULL)
1825 /* This prevents future calls from assigning this section. */
1826 section->output_section = bfd_abs_section_ptr;
1831 if (section->output_section == NULL)
1834 lang_input_section_type *new;
1837 if (output->bfd_section == NULL)
1838 init_os (output, section);
1840 first = ! output->bfd_section->linker_has_input;
1841 output->bfd_section->linker_has_input = 1;
1843 if (!link_info.relocatable
1844 && !stripped_excluded_sections)
1846 asection *s = output->bfd_section->map_tail.s;
1847 output->bfd_section->map_tail.s = section;
1848 section->map_head.s = NULL;
1849 section->map_tail.s = s;
1851 s->map_head.s = section;
1853 output->bfd_section->map_head.s = section;
1856 /* Add a section reference to the list. */
1857 new = new_stat (lang_input_section, ptr);
1859 new->section = section;
1861 section->output_section = output->bfd_section;
1863 flags = section->flags;
1865 /* We don't copy the SEC_NEVER_LOAD flag from an input section
1866 to an output section, because we want to be able to include a
1867 SEC_NEVER_LOAD section in the middle of an otherwise loaded
1868 section (I don't know why we want to do this, but we do).
1869 build_link_order in ldwrite.c handles this case by turning
1870 the embedded SEC_NEVER_LOAD section into a fill. */
1872 flags &= ~ SEC_NEVER_LOAD;
1874 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
1875 already been processed. One reason to do this is that on pe
1876 format targets, .text$foo sections go into .text and it's odd
1877 to see .text with SEC_LINK_ONCE set. */
1879 if (! link_info.relocatable)
1880 flags &= ~ (SEC_LINK_ONCE | SEC_LINK_DUPLICATES);
1882 /* If this is not the first input section, and the SEC_READONLY
1883 flag is not currently set, then don't set it just because the
1884 input section has it set. */
1886 if (! first && (output->bfd_section->flags & SEC_READONLY) == 0)
1887 flags &= ~ SEC_READONLY;
1889 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
1891 && ((output->bfd_section->flags & (SEC_MERGE | SEC_STRINGS))
1892 != (flags & (SEC_MERGE | SEC_STRINGS))
1893 || ((flags & SEC_MERGE)
1894 && output->bfd_section->entsize != section->entsize)))
1896 output->bfd_section->flags &= ~ (SEC_MERGE | SEC_STRINGS);
1897 flags &= ~ (SEC_MERGE | SEC_STRINGS);
1900 output->bfd_section->flags |= flags;
1902 if (flags & SEC_MERGE)
1903 output->bfd_section->entsize = section->entsize;
1905 /* If SEC_READONLY is not set in the input section, then clear
1906 it from the output section. */
1907 if ((section->flags & SEC_READONLY) == 0)
1908 output->bfd_section->flags &= ~SEC_READONLY;
1910 switch (output->sectype)
1912 case normal_section:
1917 case overlay_section:
1918 output->bfd_section->flags &= ~SEC_ALLOC;
1920 case noload_section:
1921 output->bfd_section->flags &= ~SEC_LOAD;
1922 output->bfd_section->flags |= SEC_NEVER_LOAD;
1926 /* Copy over SEC_SMALL_DATA. */
1927 if (section->flags & SEC_SMALL_DATA)
1928 output->bfd_section->flags |= SEC_SMALL_DATA;
1930 if (section->alignment_power > output->bfd_section->alignment_power)
1931 output->bfd_section->alignment_power = section->alignment_power;
1933 /* If supplied an alignment, then force it. */
1934 if (output->section_alignment != -1)
1935 output->bfd_section->alignment_power = output->section_alignment;
1937 if (bfd_get_arch (section->owner) == bfd_arch_tic54x
1938 && (section->flags & SEC_TIC54X_BLOCK) != 0)
1940 output->bfd_section->flags |= SEC_TIC54X_BLOCK;
1941 /* FIXME: This value should really be obtained from the bfd... */
1942 output->block_value = 128;
1947 /* Compare sections ASEC and BSEC according to SORT. */
1950 compare_section (sort_type sort, asection *asec, asection *bsec)
1959 case by_alignment_name:
1960 ret = (bfd_section_alignment (bsec->owner, bsec)
1961 - bfd_section_alignment (asec->owner, asec));
1967 ret = strcmp (bfd_get_section_name (asec->owner, asec),
1968 bfd_get_section_name (bsec->owner, bsec));
1971 case by_name_alignment:
1972 ret = strcmp (bfd_get_section_name (asec->owner, asec),
1973 bfd_get_section_name (bsec->owner, bsec));
1979 ret = (bfd_section_alignment (bsec->owner, bsec)
1980 - bfd_section_alignment (asec->owner, asec));
1987 /* Handle wildcard sorting. This returns the lang_input_section which
1988 should follow the one we are going to create for SECTION and FILE,
1989 based on the sorting requirements of WILD. It returns NULL if the
1990 new section should just go at the end of the current list. */
1992 static lang_statement_union_type *
1993 wild_sort (lang_wild_statement_type *wild,
1994 struct wildcard_list *sec,
1995 lang_input_statement_type *file,
1998 const char *section_name;
1999 lang_statement_union_type *l;
2001 if (!wild->filenames_sorted
2002 && (sec == NULL || sec->spec.sorted == none))
2005 section_name = bfd_get_section_name (file->the_bfd, section);
2006 for (l = wild->children.head; l != NULL; l = l->header.next)
2008 lang_input_section_type *ls;
2010 if (l->header.type != lang_input_section_enum)
2012 ls = &l->input_section;
2014 /* Sorting by filename takes precedence over sorting by section
2017 if (wild->filenames_sorted)
2019 const char *fn, *ln;
2023 /* The PE support for the .idata section as generated by
2024 dlltool assumes that files will be sorted by the name of
2025 the archive and then the name of the file within the
2028 if (file->the_bfd != NULL
2029 && bfd_my_archive (file->the_bfd) != NULL)
2031 fn = bfd_get_filename (bfd_my_archive (file->the_bfd));
2036 fn = file->filename;
2040 if (ls->ifile->the_bfd != NULL
2041 && bfd_my_archive (ls->ifile->the_bfd) != NULL)
2043 ln = bfd_get_filename (bfd_my_archive (ls->ifile->the_bfd));
2048 ln = ls->ifile->filename;
2052 i = strcmp (fn, ln);
2061 fn = file->filename;
2063 ln = ls->ifile->filename;
2065 i = strcmp (fn, ln);
2073 /* Here either the files are not sorted by name, or we are
2074 looking at the sections for this file. */
2076 if (sec != NULL && sec->spec.sorted != none)
2077 if (compare_section (sec->spec.sorted, section, ls->section) < 0)
2084 /* Expand a wild statement for a particular FILE. SECTION may be
2085 NULL, in which case it is a wild card. */
2088 output_section_callback (lang_wild_statement_type *ptr,
2089 struct wildcard_list *sec,
2091 lang_input_statement_type *file,
2094 lang_statement_union_type *before;
2096 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2097 if (unique_section_p (section))
2100 before = wild_sort (ptr, sec, file, section);
2102 /* Here BEFORE points to the lang_input_section which
2103 should follow the one we are about to add. If BEFORE
2104 is NULL, then the section should just go at the end
2105 of the current list. */
2108 lang_add_section (&ptr->children, section,
2109 (lang_output_section_statement_type *) output,
2113 lang_statement_list_type list;
2114 lang_statement_union_type **pp;
2116 lang_list_init (&list);
2117 lang_add_section (&list, section,
2118 (lang_output_section_statement_type *) output,
2121 /* If we are discarding the section, LIST.HEAD will
2123 if (list.head != NULL)
2125 ASSERT (list.head->header.next == NULL);
2127 for (pp = &ptr->children.head;
2129 pp = &(*pp)->header.next)
2130 ASSERT (*pp != NULL);
2132 list.head->header.next = *pp;
2138 /* Check if all sections in a wild statement for a particular FILE
2142 check_section_callback (lang_wild_statement_type *ptr ATTRIBUTE_UNUSED,
2143 struct wildcard_list *sec ATTRIBUTE_UNUSED,
2145 lang_input_statement_type *file ATTRIBUTE_UNUSED,
2148 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2149 if (unique_section_p (section))
2152 if (section->output_section == NULL && (section->flags & SEC_READONLY) == 0)
2153 ((lang_output_section_statement_type *) data)->all_input_readonly = FALSE;
2156 /* This is passed a file name which must have been seen already and
2157 added to the statement tree. We will see if it has been opened
2158 already and had its symbols read. If not then we'll read it. */
2160 static lang_input_statement_type *
2161 lookup_name (const char *name)
2163 lang_input_statement_type *search;
2165 for (search = (lang_input_statement_type *) input_file_chain.head;
2167 search = (lang_input_statement_type *) search->next_real_file)
2169 /* Use the local_sym_name as the name of the file that has
2170 already been loaded as filename might have been transformed
2171 via the search directory lookup mechanism. */
2172 const char * filename = search->local_sym_name;
2174 if (filename == NULL && name == NULL)
2176 if (filename != NULL
2178 && strcmp (filename, name) == 0)
2183 search = new_afile (name, lang_input_file_is_search_file_enum,
2184 default_target, FALSE);
2186 /* If we have already added this file, or this file is not real
2187 (FIXME: can that ever actually happen?) or the name is NULL
2188 (FIXME: can that ever actually happen?) don't add this file. */
2191 || search->filename == NULL)
2194 if (! load_symbols (search, NULL))
2200 /* Save LIST as a list of libraries whose symbols should not be exported. */
2205 struct excluded_lib *next;
2207 static struct excluded_lib *excluded_libs;
2210 add_excluded_libs (const char *list)
2212 const char *p = list, *end;
2216 struct excluded_lib *entry;
2217 end = strpbrk (p, ",:");
2219 end = p + strlen (p);
2220 entry = xmalloc (sizeof (*entry));
2221 entry->next = excluded_libs;
2222 entry->name = xmalloc (end - p + 1);
2223 memcpy (entry->name, p, end - p);
2224 entry->name[end - p] = '\0';
2225 excluded_libs = entry;
2233 check_excluded_libs (bfd *abfd)
2235 struct excluded_lib *lib = excluded_libs;
2239 int len = strlen (lib->name);
2240 const char *filename = lbasename (abfd->filename);
2242 if (strcmp (lib->name, "ALL") == 0)
2244 abfd->no_export = TRUE;
2248 if (strncmp (lib->name, filename, len) == 0
2249 && (filename[len] == '\0'
2250 || (filename[len] == '.' && filename[len + 1] == 'a'
2251 && filename[len + 2] == '\0')))
2253 abfd->no_export = TRUE;
2261 /* Get the symbols for an input file. */
2264 load_symbols (lang_input_statement_type *entry,
2265 lang_statement_list_type *place)
2272 ldfile_open_file (entry);
2274 if (! bfd_check_format (entry->the_bfd, bfd_archive)
2275 && ! bfd_check_format_matches (entry->the_bfd, bfd_object, &matching))
2278 lang_statement_list_type *hold;
2279 bfd_boolean bad_load = TRUE;
2280 bfd_boolean save_ldlang_sysrooted_script;
2282 err = bfd_get_error ();
2284 /* See if the emulation has some special knowledge. */
2285 if (ldemul_unrecognized_file (entry))
2288 if (err == bfd_error_file_ambiguously_recognized)
2292 einfo (_("%B: file not recognized: %E\n"), entry->the_bfd);
2293 einfo (_("%B: matching formats:"), entry->the_bfd);
2294 for (p = matching; *p != NULL; p++)
2298 else if (err != bfd_error_file_not_recognized
2300 einfo (_("%F%B: file not recognized: %E\n"), entry->the_bfd);
2304 bfd_close (entry->the_bfd);
2305 entry->the_bfd = NULL;
2307 /* Try to interpret the file as a linker script. */
2308 ldfile_open_command_file (entry->filename);
2312 save_ldlang_sysrooted_script = ldlang_sysrooted_script;
2313 ldlang_sysrooted_script = entry->sysrooted;
2315 ldfile_assumed_script = TRUE;
2316 parser_input = input_script;
2317 /* We want to use the same -Bdynamic/-Bstatic as the one for
2319 config.dynamic_link = entry->dynamic;
2321 ldfile_assumed_script = FALSE;
2323 ldlang_sysrooted_script = save_ldlang_sysrooted_script;
2329 if (ldemul_recognized_file (entry))
2332 /* We don't call ldlang_add_file for an archive. Instead, the
2333 add_symbols entry point will call ldlang_add_file, via the
2334 add_archive_element callback, for each element of the archive
2336 switch (bfd_get_format (entry->the_bfd))
2342 ldlang_add_file (entry);
2343 if (trace_files || trace_file_tries)
2344 info_msg ("%I\n", entry);
2348 check_excluded_libs (entry->the_bfd);
2350 if (entry->whole_archive)
2353 bfd_boolean loaded = TRUE;
2357 member = bfd_openr_next_archived_file (entry->the_bfd, member);
2362 if (! bfd_check_format (member, bfd_object))
2364 einfo (_("%F%B: member %B in archive is not an object\n"),
2365 entry->the_bfd, member);
2369 if (! ((*link_info.callbacks->add_archive_element)
2370 (&link_info, member, "--whole-archive")))
2373 if (! bfd_link_add_symbols (member, &link_info))
2375 einfo (_("%F%B: could not read symbols: %E\n"), member);
2380 entry->loaded = loaded;
2386 if (bfd_link_add_symbols (entry->the_bfd, &link_info))
2387 entry->loaded = TRUE;
2389 einfo (_("%F%B: could not read symbols: %E\n"), entry->the_bfd);
2391 return entry->loaded;
2394 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2395 may be NULL, indicating that it is a wildcard. Separate
2396 lang_input_section statements are created for each part of the
2397 expansion; they are added after the wild statement S. OUTPUT is
2398 the output section. */
2401 wild (lang_wild_statement_type *s,
2402 const char *target ATTRIBUTE_UNUSED,
2403 lang_output_section_statement_type *output)
2405 struct wildcard_list *sec;
2407 walk_wild (s, output_section_callback, output);
2409 for (sec = s->section_list; sec != NULL; sec = sec->next)
2411 if (default_common_section != NULL)
2413 if (sec->spec.name != NULL && strcmp (sec->spec.name, "COMMON") == 0)
2415 /* Remember the section that common is going to in case we
2416 later get something which doesn't know where to put it. */
2417 default_common_section = output;
2422 /* Return TRUE iff target is the sought target. */
2425 get_target (const bfd_target *target, void *data)
2427 const char *sought = data;
2429 return strcmp (target->name, sought) == 0;
2432 /* Like strcpy() but convert to lower case as well. */
2435 stricpy (char *dest, char *src)
2439 while ((c = *src++) != 0)
2440 *dest++ = TOLOWER (c);
2445 /* Remove the first occurrence of needle (if any) in haystack
2449 strcut (char *haystack, char *needle)
2451 haystack = strstr (haystack, needle);
2457 for (src = haystack + strlen (needle); *src;)
2458 *haystack++ = *src++;
2464 /* Compare two target format name strings.
2465 Return a value indicating how "similar" they are. */
2468 name_compare (char *first, char *second)
2474 copy1 = xmalloc (strlen (first) + 1);
2475 copy2 = xmalloc (strlen (second) + 1);
2477 /* Convert the names to lower case. */
2478 stricpy (copy1, first);
2479 stricpy (copy2, second);
2481 /* Remove size and endian strings from the name. */
2482 strcut (copy1, "big");
2483 strcut (copy1, "little");
2484 strcut (copy2, "big");
2485 strcut (copy2, "little");
2487 /* Return a value based on how many characters match,
2488 starting from the beginning. If both strings are
2489 the same then return 10 * their length. */
2490 for (result = 0; copy1[result] == copy2[result]; result++)
2491 if (copy1[result] == 0)
2503 /* Set by closest_target_match() below. */
2504 static const bfd_target *winner;
2506 /* Scan all the valid bfd targets looking for one that has the endianness
2507 requirement that was specified on the command line, and is the nearest
2508 match to the original output target. */
2511 closest_target_match (const bfd_target *target, void *data)
2513 const bfd_target *original = data;
2515 if (command_line.endian == ENDIAN_BIG
2516 && target->byteorder != BFD_ENDIAN_BIG)
2519 if (command_line.endian == ENDIAN_LITTLE
2520 && target->byteorder != BFD_ENDIAN_LITTLE)
2523 /* Must be the same flavour. */
2524 if (target->flavour != original->flavour)
2527 /* If we have not found a potential winner yet, then record this one. */
2534 /* Oh dear, we now have two potential candidates for a successful match.
2535 Compare their names and choose the better one. */
2536 if (name_compare (target->name, original->name)
2537 > name_compare (winner->name, original->name))
2540 /* Keep on searching until wqe have checked them all. */
2544 /* Return the BFD target format of the first input file. */
2547 get_first_input_target (void)
2549 char *target = NULL;
2551 LANG_FOR_EACH_INPUT_STATEMENT (s)
2553 if (s->header.type == lang_input_statement_enum
2556 ldfile_open_file (s);
2558 if (s->the_bfd != NULL
2559 && bfd_check_format (s->the_bfd, bfd_object))
2561 target = bfd_get_target (s->the_bfd);
2573 lang_get_output_target (void)
2577 /* Has the user told us which output format to use? */
2578 if (output_target != NULL)
2579 return output_target;
2581 /* No - has the current target been set to something other than
2583 if (current_target != default_target)
2584 return current_target;
2586 /* No - can we determine the format of the first input file? */
2587 target = get_first_input_target ();
2591 /* Failed - use the default output target. */
2592 return default_target;
2595 /* Open the output file. */
2598 open_output (const char *name)
2602 output_target = lang_get_output_target ();
2604 /* Has the user requested a particular endianness on the command
2606 if (command_line.endian != ENDIAN_UNSET)
2608 const bfd_target *target;
2609 enum bfd_endian desired_endian;
2611 /* Get the chosen target. */
2612 target = bfd_search_for_target (get_target, (void *) output_target);
2614 /* If the target is not supported, we cannot do anything. */
2617 if (command_line.endian == ENDIAN_BIG)
2618 desired_endian = BFD_ENDIAN_BIG;
2620 desired_endian = BFD_ENDIAN_LITTLE;
2622 /* See if the target has the wrong endianness. This should
2623 not happen if the linker script has provided big and
2624 little endian alternatives, but some scrips don't do
2626 if (target->byteorder != desired_endian)
2628 /* If it does, then see if the target provides
2629 an alternative with the correct endianness. */
2630 if (target->alternative_target != NULL
2631 && (target->alternative_target->byteorder == desired_endian))
2632 output_target = target->alternative_target->name;
2635 /* Try to find a target as similar as possible to
2636 the default target, but which has the desired
2637 endian characteristic. */
2638 bfd_search_for_target (closest_target_match,
2641 /* Oh dear - we could not find any targets that
2642 satisfy our requirements. */
2644 einfo (_("%P: warning: could not find any targets"
2645 " that match endianness requirement\n"));
2647 output_target = winner->name;
2653 output = bfd_openw (name, output_target);
2657 if (bfd_get_error () == bfd_error_invalid_target)
2658 einfo (_("%P%F: target %s not found\n"), output_target);
2660 einfo (_("%P%F: cannot open output file %s: %E\n"), name);
2663 delete_output_file_on_failure = TRUE;
2665 if (! bfd_set_format (output, bfd_object))
2666 einfo (_("%P%F:%s: can not make object file: %E\n"), name);
2667 if (! bfd_set_arch_mach (output,
2668 ldfile_output_architecture,
2669 ldfile_output_machine))
2670 einfo (_("%P%F:%s: can not set architecture: %E\n"), name);
2672 link_info.hash = bfd_link_hash_table_create (output);
2673 if (link_info.hash == NULL)
2674 einfo (_("%P%F: can not create link hash table: %E\n"));
2676 bfd_set_gp_size (output, g_switch_value);
2681 ldlang_open_output (lang_statement_union_type *statement)
2683 switch (statement->header.type)
2685 case lang_output_statement_enum:
2686 ASSERT (output_bfd == NULL);
2687 output_bfd = open_output (statement->output_statement.name);
2688 ldemul_set_output_arch ();
2689 if (config.magic_demand_paged && !link_info.relocatable)
2690 output_bfd->flags |= D_PAGED;
2692 output_bfd->flags &= ~D_PAGED;
2693 if (config.text_read_only)
2694 output_bfd->flags |= WP_TEXT;
2696 output_bfd->flags &= ~WP_TEXT;
2697 if (link_info.traditional_format)
2698 output_bfd->flags |= BFD_TRADITIONAL_FORMAT;
2700 output_bfd->flags &= ~BFD_TRADITIONAL_FORMAT;
2703 case lang_target_statement_enum:
2704 current_target = statement->target_statement.target;
2711 /* Convert between addresses in bytes and sizes in octets.
2712 For currently supported targets, octets_per_byte is always a power
2713 of two, so we can use shifts. */
2714 #define TO_ADDR(X) ((X) >> opb_shift)
2715 #define TO_SIZE(X) ((X) << opb_shift)
2717 /* Support the above. */
2718 static unsigned int opb_shift = 0;
2723 unsigned x = bfd_arch_mach_octets_per_byte (ldfile_output_architecture,
2724 ldfile_output_machine);
2727 while ((x & 1) == 0)
2735 /* Open all the input files. */
2738 open_input_bfds (lang_statement_union_type *s, bfd_boolean force)
2740 for (; s != NULL; s = s->header.next)
2742 switch (s->header.type)
2744 case lang_constructors_statement_enum:
2745 open_input_bfds (constructor_list.head, force);
2747 case lang_output_section_statement_enum:
2748 open_input_bfds (s->output_section_statement.children.head, force);
2750 case lang_wild_statement_enum:
2751 /* Maybe we should load the file's symbols. */
2752 if (s->wild_statement.filename
2753 && ! wildcardp (s->wild_statement.filename))
2754 lookup_name (s->wild_statement.filename);
2755 open_input_bfds (s->wild_statement.children.head, force);
2757 case lang_group_statement_enum:
2759 struct bfd_link_hash_entry *undefs;
2761 /* We must continually search the entries in the group
2762 until no new symbols are added to the list of undefined
2767 undefs = link_info.hash->undefs_tail;
2768 open_input_bfds (s->group_statement.children.head, TRUE);
2770 while (undefs != link_info.hash->undefs_tail);
2773 case lang_target_statement_enum:
2774 current_target = s->target_statement.target;
2776 case lang_input_statement_enum:
2777 if (s->input_statement.real)
2779 lang_statement_list_type add;
2781 s->input_statement.target = current_target;
2783 /* If we are being called from within a group, and this
2784 is an archive which has already been searched, then
2785 force it to be researched unless the whole archive
2786 has been loaded already. */
2788 && !s->input_statement.whole_archive
2789 && s->input_statement.loaded
2790 && bfd_check_format (s->input_statement.the_bfd,
2792 s->input_statement.loaded = FALSE;
2794 lang_list_init (&add);
2796 if (! load_symbols (&s->input_statement, &add))
2797 config.make_executable = FALSE;
2799 if (add.head != NULL)
2801 *add.tail = s->header.next;
2802 s->header.next = add.head;
2812 /* Add a symbol to a hash of symbols used in DEFINED (NAME) expressions. */
2815 lang_track_definedness (const char *name)
2817 if (bfd_hash_lookup (&lang_definedness_table, name, TRUE, FALSE) == NULL)
2818 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name);
2821 /* New-function for the definedness hash table. */
2823 static struct bfd_hash_entry *
2824 lang_definedness_newfunc (struct bfd_hash_entry *entry,
2825 struct bfd_hash_table *table ATTRIBUTE_UNUSED,
2826 const char *name ATTRIBUTE_UNUSED)
2828 struct lang_definedness_hash_entry *ret
2829 = (struct lang_definedness_hash_entry *) entry;
2832 ret = (struct lang_definedness_hash_entry *)
2833 bfd_hash_allocate (table, sizeof (struct lang_definedness_hash_entry));
2836 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name);
2838 ret->iteration = -1;
2842 /* Return the iteration when the definition of NAME was last updated. A
2843 value of -1 means that the symbol is not defined in the linker script
2844 or the command line, but may be defined in the linker symbol table. */
2847 lang_symbol_definition_iteration (const char *name)
2849 struct lang_definedness_hash_entry *defentry
2850 = (struct lang_definedness_hash_entry *)
2851 bfd_hash_lookup (&lang_definedness_table, name, FALSE, FALSE);
2853 /* We've already created this one on the presence of DEFINED in the
2854 script, so it can't be NULL unless something is borked elsewhere in
2856 if (defentry == NULL)
2859 return defentry->iteration;
2862 /* Update the definedness state of NAME. */
2865 lang_update_definedness (const char *name, struct bfd_link_hash_entry *h)
2867 struct lang_definedness_hash_entry *defentry
2868 = (struct lang_definedness_hash_entry *)
2869 bfd_hash_lookup (&lang_definedness_table, name, FALSE, FALSE);
2871 /* We don't keep track of symbols not tested with DEFINED. */
2872 if (defentry == NULL)
2875 /* If the symbol was already defined, and not from an earlier statement
2876 iteration, don't update the definedness iteration, because that'd
2877 make the symbol seem defined in the linker script at this point, and
2878 it wasn't; it was defined in some object. If we do anyway, DEFINED
2879 would start to yield false before this point and the construct "sym =
2880 DEFINED (sym) ? sym : X;" would change sym to X despite being defined
2882 if (h->type != bfd_link_hash_undefined
2883 && h->type != bfd_link_hash_common
2884 && h->type != bfd_link_hash_new
2885 && defentry->iteration == -1)
2888 defentry->iteration = lang_statement_iteration;
2891 /* Add the supplied name to the symbol table as an undefined reference.
2892 This is a two step process as the symbol table doesn't even exist at
2893 the time the ld command line is processed. First we put the name
2894 on a list, then, once the output file has been opened, transfer the
2895 name to the symbol table. */
2897 typedef struct bfd_sym_chain ldlang_undef_chain_list_type;
2899 #define ldlang_undef_chain_list_head entry_symbol.next
2902 ldlang_add_undef (const char *const name)
2904 ldlang_undef_chain_list_type *new =
2905 stat_alloc (sizeof (ldlang_undef_chain_list_type));
2907 new->next = ldlang_undef_chain_list_head;
2908 ldlang_undef_chain_list_head = new;
2910 new->name = xstrdup (name);
2912 if (output_bfd != NULL)
2913 insert_undefined (new->name);
2916 /* Insert NAME as undefined in the symbol table. */
2919 insert_undefined (const char *name)
2921 struct bfd_link_hash_entry *h;
2923 h = bfd_link_hash_lookup (link_info.hash, name, TRUE, FALSE, TRUE);
2925 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
2926 if (h->type == bfd_link_hash_new)
2928 h->type = bfd_link_hash_undefined;
2929 h->u.undef.abfd = NULL;
2930 bfd_link_add_undef (link_info.hash, h);
2934 /* Run through the list of undefineds created above and place them
2935 into the linker hash table as undefined symbols belonging to the
2939 lang_place_undefineds (void)
2941 ldlang_undef_chain_list_type *ptr;
2943 for (ptr = ldlang_undef_chain_list_head; ptr != NULL; ptr = ptr->next)
2944 insert_undefined (ptr->name);
2947 /* Check for all readonly or some readwrite sections. */
2950 check_input_sections
2951 (lang_statement_union_type *s,
2952 lang_output_section_statement_type *output_section_statement)
2954 for (; s != (lang_statement_union_type *) NULL; s = s->header.next)
2956 switch (s->header.type)
2958 case lang_wild_statement_enum:
2959 walk_wild (&s->wild_statement, check_section_callback,
2960 output_section_statement);
2961 if (! output_section_statement->all_input_readonly)
2964 case lang_constructors_statement_enum:
2965 check_input_sections (constructor_list.head,
2966 output_section_statement);
2967 if (! output_section_statement->all_input_readonly)
2970 case lang_group_statement_enum:
2971 check_input_sections (s->group_statement.children.head,
2972 output_section_statement);
2973 if (! output_section_statement->all_input_readonly)
2982 /* Update wildcard statements if needed. */
2985 update_wild_statements (lang_statement_union_type *s)
2987 struct wildcard_list *sec;
2989 switch (sort_section)
2999 for (; s != NULL; s = s->header.next)
3001 switch (s->header.type)
3006 case lang_wild_statement_enum:
3007 sec = s->wild_statement.section_list;
3010 switch (sec->spec.sorted)
3013 sec->spec.sorted = sort_section;
3016 if (sort_section == by_alignment)
3017 sec->spec.sorted = by_name_alignment;
3020 if (sort_section == by_name)
3021 sec->spec.sorted = by_alignment_name;
3029 case lang_constructors_statement_enum:
3030 update_wild_statements (constructor_list.head);
3033 case lang_output_section_statement_enum:
3034 update_wild_statements
3035 (s->output_section_statement.children.head);
3038 case lang_group_statement_enum:
3039 update_wild_statements (s->group_statement.children.head);
3047 /* Open input files and attach to output sections. */
3050 map_input_to_output_sections
3051 (lang_statement_union_type *s, const char *target,
3052 lang_output_section_statement_type *os)
3054 for (; s != NULL; s = s->header.next)
3056 switch (s->header.type)
3058 case lang_wild_statement_enum:
3059 wild (&s->wild_statement, target, os);
3061 case lang_constructors_statement_enum:
3062 map_input_to_output_sections (constructor_list.head,
3066 case lang_output_section_statement_enum:
3067 if (s->output_section_statement.constraint)
3069 if (s->output_section_statement.constraint != ONLY_IF_RW
3070 && s->output_section_statement.constraint != ONLY_IF_RO)
3072 s->output_section_statement.all_input_readonly = TRUE;
3073 check_input_sections (s->output_section_statement.children.head,
3074 &s->output_section_statement);
3075 if ((s->output_section_statement.all_input_readonly
3076 && s->output_section_statement.constraint == ONLY_IF_RW)
3077 || (!s->output_section_statement.all_input_readonly
3078 && s->output_section_statement.constraint == ONLY_IF_RO))
3080 s->output_section_statement.constraint = -1;
3085 map_input_to_output_sections (s->output_section_statement.children.head,
3087 &s->output_section_statement);
3089 case lang_output_statement_enum:
3091 case lang_target_statement_enum:
3092 target = s->target_statement.target;
3094 case lang_group_statement_enum:
3095 map_input_to_output_sections (s->group_statement.children.head,
3099 case lang_data_statement_enum:
3100 /* Make sure that any sections mentioned in the expression
3102 exp_init_os (s->data_statement.exp);
3103 if (os != NULL && os->bfd_section == NULL)
3105 /* The output section gets contents, and then we inspect for
3106 any flags set in the input script which override any ALLOC. */
3107 os->bfd_section->flags |= SEC_HAS_CONTENTS;
3108 if (!(os->flags & SEC_NEVER_LOAD))
3109 os->bfd_section->flags |= SEC_ALLOC | SEC_LOAD;
3111 case lang_fill_statement_enum:
3112 case lang_input_section_enum:
3113 case lang_object_symbols_statement_enum:
3114 case lang_reloc_statement_enum:
3115 case lang_padding_statement_enum:
3116 case lang_input_statement_enum:
3117 if (os != NULL && os->bfd_section == NULL)
3120 case lang_assignment_statement_enum:
3121 if (os != NULL && os->bfd_section == NULL)
3124 /* Make sure that any sections mentioned in the assignment
3126 exp_init_os (s->assignment_statement.exp);
3128 case lang_afile_asection_pair_statement_enum:
3131 case lang_address_statement_enum:
3132 /* Mark the specified section with the supplied address.
3134 If this section was actually a segment marker, then the
3135 directive is ignored if the linker script explicitly
3136 processed the segment marker. Originally, the linker
3137 treated segment directives (like -Ttext on the
3138 command-line) as section directives. We honor the
3139 section directive semantics for backwards compatibilty;
3140 linker scripts that do not specifically check for
3141 SEGMENT_START automatically get the old semantics. */
3142 if (!s->address_statement.segment
3143 || !s->address_statement.segment->used)
3145 lang_output_section_statement_type *aos
3146 = (lang_output_section_statement_lookup
3147 (s->address_statement.section_name));
3149 if (aos->bfd_section == NULL)
3150 init_os (aos, NULL);
3151 aos->addr_tree = s->address_statement.address;
3158 /* An output section might have been removed after its statement was
3159 added. For example, ldemul_before_allocation can remove dynamic
3160 sections if they turn out to be not needed. Clean them up here. */
3163 strip_excluded_output_sections (void)
3165 lang_output_section_statement_type *os;
3167 /* Run lang_size_sections (if not already done). */
3168 if (expld.phase != lang_mark_phase_enum)
3170 expld.phase = lang_mark_phase_enum;
3171 expld.dataseg.phase = exp_dataseg_none;
3172 one_lang_size_sections_pass (NULL, FALSE);
3173 lang_reset_memory_regions ();
3176 for (os = &lang_output_section_statement.head->output_section_statement;
3180 asection *output_section;
3181 bfd_boolean exclude;
3183 if (os->constraint == -1)
3186 output_section = os->bfd_section;
3187 if (output_section == NULL)
3190 exclude = (output_section->rawsize == 0
3191 && (output_section->flags & SEC_KEEP) == 0
3192 && !bfd_section_removed_from_list (output_bfd,
3195 /* Some sections have not yet been sized, notably .gnu.version,
3196 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3197 input sections, so don't drop output sections that have such
3198 input sections unless they are also marked SEC_EXCLUDE. */
3199 if (exclude && output_section->map_head.s != NULL)
3203 for (s = output_section->map_head.s; s != NULL; s = s->map_head.s)
3204 if ((s->flags & SEC_LINKER_CREATED) != 0
3205 && (s->flags & SEC_EXCLUDE) == 0)
3212 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3213 output_section->map_head.link_order = NULL;
3214 output_section->map_tail.link_order = NULL;
3218 /* We don't set bfd_section to NULL since bfd_section of the
3219 removed output section statement may still be used. */
3221 output_section->flags |= SEC_EXCLUDE;
3222 bfd_section_list_remove (output_bfd, output_section);
3223 output_bfd->section_count--;
3227 /* Stop future calls to lang_add_section from messing with map_head
3228 and map_tail link_order fields. */
3229 stripped_excluded_sections = TRUE;
3233 print_output_section_statement
3234 (lang_output_section_statement_type *output_section_statement)
3236 asection *section = output_section_statement->bfd_section;
3239 if (output_section_statement != abs_output_section)
3241 minfo ("\n%s", output_section_statement->name);
3243 if (section != NULL)
3245 print_dot = section->vma;
3247 len = strlen (output_section_statement->name);
3248 if (len >= SECTION_NAME_MAP_LENGTH - 1)
3253 while (len < SECTION_NAME_MAP_LENGTH)
3259 minfo ("0x%V %W", section->vma, section->size);
3261 if (output_section_statement->load_base != NULL)
3265 addr = exp_get_abs_int (output_section_statement->load_base, 0,
3267 minfo (_(" load address 0x%V"), addr);
3274 print_statement_list (output_section_statement->children.head,
3275 output_section_statement);
3278 /* Scan for the use of the destination in the right hand side
3279 of an expression. In such cases we will not compute the
3280 correct expression, since the value of DST that is used on
3281 the right hand side will be its final value, not its value
3282 just before this expression is evaluated. */
3285 scan_for_self_assignment (const char * dst, etree_type * rhs)
3287 if (rhs == NULL || dst == NULL)
3290 switch (rhs->type.node_class)
3293 return scan_for_self_assignment (dst, rhs->binary.lhs)
3294 || scan_for_self_assignment (dst, rhs->binary.rhs);
3297 return scan_for_self_assignment (dst, rhs->trinary.lhs)
3298 || scan_for_self_assignment (dst, rhs->trinary.rhs);
3301 case etree_provided:
3303 if (strcmp (dst, rhs->assign.dst) == 0)
3305 return scan_for_self_assignment (dst, rhs->assign.src);
3308 return scan_for_self_assignment (dst, rhs->unary.child);
3312 return strcmp (dst, rhs->value.str) == 0;
3317 return strcmp (dst, rhs->name.name) == 0;
3329 print_assignment (lang_assignment_statement_type *assignment,
3330 lang_output_section_statement_type *output_section)
3334 bfd_boolean computation_is_valid = TRUE;
3337 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
3340 if (assignment->exp->type.node_class == etree_assert)
3343 tree = assignment->exp->assert_s.child;
3344 computation_is_valid = TRUE;
3348 const char *dst = assignment->exp->assign.dst;
3350 is_dot = (dst[0] == '.' && dst[1] == 0);
3351 tree = assignment->exp->assign.src;
3352 computation_is_valid = is_dot || (scan_for_self_assignment (dst, tree) == FALSE);
3355 exp_fold_tree (tree, output_section->bfd_section, &print_dot);
3356 if (expld.result.valid_p)
3360 if (computation_is_valid)
3362 value = expld.result.value;
3364 if (expld.result.section)
3365 value += expld.result.section->vma;
3367 minfo ("0x%V", value);
3373 struct bfd_link_hash_entry *h;
3375 h = bfd_link_hash_lookup (link_info.hash, assignment->exp->assign.dst,
3376 FALSE, FALSE, TRUE);
3379 value = h->u.def.value;
3381 if (expld.result.section)
3382 value += expld.result.section->vma;
3384 minfo ("[0x%V]", value);
3387 minfo ("[unresolved]");
3399 exp_print_tree (assignment->exp);
3404 print_input_statement (lang_input_statement_type *statm)
3406 if (statm->filename != NULL)
3408 fprintf (config.map_file, "LOAD %s\n", statm->filename);
3412 /* Print all symbols defined in a particular section. This is called
3413 via bfd_link_hash_traverse, or by print_all_symbols. */
3416 print_one_symbol (struct bfd_link_hash_entry *hash_entry, void *ptr)
3418 asection *sec = ptr;
3420 if ((hash_entry->type == bfd_link_hash_defined
3421 || hash_entry->type == bfd_link_hash_defweak)
3422 && sec == hash_entry->u.def.section)
3426 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
3429 (hash_entry->u.def.value
3430 + hash_entry->u.def.section->output_offset
3431 + hash_entry->u.def.section->output_section->vma));
3433 minfo (" %T\n", hash_entry->root.string);
3440 print_all_symbols (sec)
3443 struct fat_user_section_struct *ud = get_userdata (sec);
3444 struct map_symbol_def *def;
3449 *ud->map_symbol_def_tail = 0;
3450 for (def = ud->map_symbol_def_head; def; def = def->next)
3451 print_one_symbol (def->entry, sec);
3454 /* Print information about an input section to the map file. */
3457 print_input_section (lang_input_section_type *in)
3459 asection *i = in->section;
3460 bfd_size_type size = i->size;
3469 minfo ("%s", i->name);
3471 len = 1 + strlen (i->name);
3472 if (len >= SECTION_NAME_MAP_LENGTH - 1)
3477 while (len < SECTION_NAME_MAP_LENGTH)
3483 if (i->output_section != NULL && (i->flags & SEC_EXCLUDE) == 0)
3484 addr = i->output_section->vma + i->output_offset;
3491 minfo ("0x%V %W %B\n", addr, TO_ADDR (size), i->owner);
3493 if (size != i->rawsize && i->rawsize != 0)
3495 len = SECTION_NAME_MAP_LENGTH + 3;
3507 minfo (_("%W (size before relaxing)\n"), i->rawsize);
3510 if (i->output_section != NULL && (i->flags & SEC_EXCLUDE) == 0)
3512 if (command_line.reduce_memory_overheads)
3513 bfd_link_hash_traverse (link_info.hash, print_one_symbol, i);
3515 print_all_symbols (i);
3517 print_dot = addr + TO_ADDR (size);
3523 print_fill_statement (lang_fill_statement_type *fill)
3527 fputs (" FILL mask 0x", config.map_file);
3528 for (p = fill->fill->data, size = fill->fill->size; size != 0; p++, size--)
3529 fprintf (config.map_file, "%02x", *p);
3530 fputs ("\n", config.map_file);
3534 print_data_statement (lang_data_statement_type *data)
3542 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
3545 addr = data->output_offset;
3546 if (data->output_section != NULL)
3547 addr += data->output_section->vma;
3575 minfo ("0x%V %W %s 0x%v", addr, size, name, data->value);
3577 if (data->exp->type.node_class != etree_value)
3580 exp_print_tree (data->exp);
3585 print_dot = addr + TO_ADDR (size);
3588 /* Print an address statement. These are generated by options like
3592 print_address_statement (lang_address_statement_type *address)
3594 minfo (_("Address of section %s set to "), address->section_name);
3595 exp_print_tree (address->address);
3599 /* Print a reloc statement. */
3602 print_reloc_statement (lang_reloc_statement_type *reloc)
3609 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
3612 addr = reloc->output_offset;
3613 if (reloc->output_section != NULL)
3614 addr += reloc->output_section->vma;
3616 size = bfd_get_reloc_size (reloc->howto);
3618 minfo ("0x%V %W RELOC %s ", addr, size, reloc->howto->name);
3620 if (reloc->name != NULL)
3621 minfo ("%s+", reloc->name);
3623 minfo ("%s+", reloc->section->name);
3625 exp_print_tree (reloc->addend_exp);
3629 print_dot = addr + TO_ADDR (size);
3633 print_padding_statement (lang_padding_statement_type *s)
3641 len = sizeof " *fill*" - 1;
3642 while (len < SECTION_NAME_MAP_LENGTH)
3648 addr = s->output_offset;
3649 if (s->output_section != NULL)
3650 addr += s->output_section->vma;
3651 minfo ("0x%V %W ", addr, (bfd_vma) s->size);
3653 if (s->fill->size != 0)
3657 for (p = s->fill->data, size = s->fill->size; size != 0; p++, size--)
3658 fprintf (config.map_file, "%02x", *p);
3663 print_dot = addr + TO_ADDR (s->size);
3667 print_wild_statement (lang_wild_statement_type *w,
3668 lang_output_section_statement_type *os)
3670 struct wildcard_list *sec;
3674 if (w->filenames_sorted)
3676 if (w->filename != NULL)
3677 minfo ("%s", w->filename);
3680 if (w->filenames_sorted)
3684 for (sec = w->section_list; sec; sec = sec->next)
3686 if (sec->spec.sorted)
3688 if (sec->spec.exclude_name_list != NULL)
3691 minfo ("EXCLUDE_FILE(%s", sec->spec.exclude_name_list->name);
3692 for (tmp = sec->spec.exclude_name_list->next; tmp; tmp = tmp->next)
3693 minfo (" %s", tmp->name);
3696 if (sec->spec.name != NULL)
3697 minfo ("%s", sec->spec.name);
3700 if (sec->spec.sorted)
3709 print_statement_list (w->children.head, os);
3712 /* Print a group statement. */
3715 print_group (lang_group_statement_type *s,
3716 lang_output_section_statement_type *os)
3718 fprintf (config.map_file, "START GROUP\n");
3719 print_statement_list (s->children.head, os);
3720 fprintf (config.map_file, "END GROUP\n");
3723 /* Print the list of statements in S.
3724 This can be called for any statement type. */
3727 print_statement_list (lang_statement_union_type *s,
3728 lang_output_section_statement_type *os)
3732 print_statement (s, os);
3737 /* Print the first statement in statement list S.
3738 This can be called for any statement type. */
3741 print_statement (lang_statement_union_type *s,
3742 lang_output_section_statement_type *os)
3744 switch (s->header.type)
3747 fprintf (config.map_file, _("Fail with %d\n"), s->header.type);
3750 case lang_constructors_statement_enum:
3751 if (constructor_list.head != NULL)
3753 if (constructors_sorted)
3754 minfo (" SORT (CONSTRUCTORS)\n");
3756 minfo (" CONSTRUCTORS\n");
3757 print_statement_list (constructor_list.head, os);
3760 case lang_wild_statement_enum:
3761 print_wild_statement (&s->wild_statement, os);
3763 case lang_address_statement_enum:
3764 print_address_statement (&s->address_statement);
3766 case lang_object_symbols_statement_enum:
3767 minfo (" CREATE_OBJECT_SYMBOLS\n");
3769 case lang_fill_statement_enum:
3770 print_fill_statement (&s->fill_statement);
3772 case lang_data_statement_enum:
3773 print_data_statement (&s->data_statement);
3775 case lang_reloc_statement_enum:
3776 print_reloc_statement (&s->reloc_statement);
3778 case lang_input_section_enum:
3779 print_input_section (&s->input_section);
3781 case lang_padding_statement_enum:
3782 print_padding_statement (&s->padding_statement);
3784 case lang_output_section_statement_enum:
3785 print_output_section_statement (&s->output_section_statement);
3787 case lang_assignment_statement_enum:
3788 print_assignment (&s->assignment_statement, os);
3790 case lang_target_statement_enum:
3791 fprintf (config.map_file, "TARGET(%s)\n", s->target_statement.target);
3793 case lang_output_statement_enum:
3794 minfo ("OUTPUT(%s", s->output_statement.name);
3795 if (output_target != NULL)
3796 minfo (" %s", output_target);
3799 case lang_input_statement_enum:
3800 print_input_statement (&s->input_statement);
3802 case lang_group_statement_enum:
3803 print_group (&s->group_statement, os);
3805 case lang_afile_asection_pair_statement_enum:
3812 print_statements (void)
3814 print_statement_list (statement_list.head, abs_output_section);
3817 /* Print the first N statements in statement list S to STDERR.
3818 If N == 0, nothing is printed.
3819 If N < 0, the entire list is printed.
3820 Intended to be called from GDB. */
3823 dprint_statement (lang_statement_union_type *s, int n)
3825 FILE *map_save = config.map_file;
3827 config.map_file = stderr;
3830 print_statement_list (s, abs_output_section);
3833 while (s && --n >= 0)
3835 print_statement (s, abs_output_section);
3840 config.map_file = map_save;
3844 insert_pad (lang_statement_union_type **ptr,
3846 unsigned int alignment_needed,
3847 asection *output_section,
3850 static fill_type zero_fill = { 1, { 0 } };
3851 lang_statement_union_type *pad = NULL;
3853 if (ptr != &statement_list.head)
3854 pad = ((lang_statement_union_type *)
3855 ((char *) ptr - offsetof (lang_statement_union_type, header.next)));
3857 && pad->header.type == lang_padding_statement_enum
3858 && pad->padding_statement.output_section == output_section)
3860 /* Use the existing pad statement. */
3862 else if ((pad = *ptr) != NULL
3863 && pad->header.type == lang_padding_statement_enum
3864 && pad->padding_statement.output_section == output_section)
3866 /* Use the existing pad statement. */
3870 /* Make a new padding statement, linked into existing chain. */
3871 pad = stat_alloc (sizeof (lang_padding_statement_type));
3872 pad->header.next = *ptr;
3874 pad->header.type = lang_padding_statement_enum;
3875 pad->padding_statement.output_section = output_section;
3878 pad->padding_statement.fill = fill;
3880 pad->padding_statement.output_offset = dot - output_section->vma;
3881 pad->padding_statement.size = alignment_needed;
3882 output_section->size += alignment_needed;
3885 /* Work out how much this section will move the dot point. */
3889 (lang_statement_union_type **this_ptr,
3890 lang_output_section_statement_type *output_section_statement,
3894 lang_input_section_type *is = &((*this_ptr)->input_section);
3895 asection *i = is->section;
3897 if (!is->ifile->just_syms_flag && (i->flags & SEC_EXCLUDE) == 0)
3899 unsigned int alignment_needed;
3902 /* Align this section first to the input sections requirement,
3903 then to the output section's requirement. If this alignment
3904 is greater than any seen before, then record it too. Perform
3905 the alignment by inserting a magic 'padding' statement. */
3907 if (output_section_statement->subsection_alignment != -1)
3908 i->alignment_power = output_section_statement->subsection_alignment;
3910 o = output_section_statement->bfd_section;
3911 if (o->alignment_power < i->alignment_power)
3912 o->alignment_power = i->alignment_power;
3914 alignment_needed = align_power (dot, i->alignment_power) - dot;
3916 if (alignment_needed != 0)
3918 insert_pad (this_ptr, fill, TO_SIZE (alignment_needed), o, dot);
3919 dot += alignment_needed;
3922 /* Remember where in the output section this input section goes. */
3924 i->output_offset = dot - o->vma;
3926 /* Mark how big the output section must be to contain this now. */
3927 dot += TO_ADDR (i->size);
3928 o->size = TO_SIZE (dot - o->vma);
3932 i->output_offset = i->vma - output_section_statement->bfd_section->vma;
3939 sort_sections_by_lma (const void *arg1, const void *arg2)
3941 const asection *sec1 = *(const asection **) arg1;
3942 const asection *sec2 = *(const asection **) arg2;
3944 if (bfd_section_lma (sec1->owner, sec1)
3945 < bfd_section_lma (sec2->owner, sec2))
3947 else if (bfd_section_lma (sec1->owner, sec1)
3948 > bfd_section_lma (sec2->owner, sec2))
3954 #define IGNORE_SECTION(s) \
3955 ((s->flags & SEC_NEVER_LOAD) != 0 \
3956 || (s->flags & SEC_ALLOC) == 0 \
3957 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
3958 && (s->flags & SEC_LOAD) == 0))
3960 /* Check to see if any allocated sections overlap with other allocated
3961 sections. This can happen if a linker script specifies the output
3962 section addresses of the two sections. */
3965 lang_check_section_addresses (void)
3968 asection **sections, **spp;
3976 if (bfd_count_sections (output_bfd) <= 1)
3979 amt = bfd_count_sections (output_bfd) * sizeof (asection *);
3980 sections = xmalloc (amt);
3982 /* Scan all sections in the output list. */
3984 for (s = output_bfd->sections; s != NULL; s = s->next)
3986 /* Only consider loadable sections with real contents. */
3987 if (IGNORE_SECTION (s) || s->size == 0)
3990 sections[count] = s;
3997 qsort (sections, (size_t) count, sizeof (asection *),
3998 sort_sections_by_lma);
4002 s_start = bfd_section_lma (output_bfd, s);
4003 s_end = s_start + TO_ADDR (s->size) - 1;
4004 for (count--; count; count--)
4006 /* We must check the sections' LMA addresses not their VMA
4007 addresses because overlay sections can have overlapping VMAs
4008 but they must have distinct LMAs. */
4013 s_start = bfd_section_lma (output_bfd, s);
4014 s_end = s_start + TO_ADDR (s->size) - 1;
4016 /* Look for an overlap. */
4017 if (s_end >= os_start && s_start <= os_end)
4018 einfo (_("%X%P: section %s [%V -> %V] overlaps section %s [%V -> %V]\n"),
4019 s->name, s_start, s_end, os->name, os_start, os_end);
4025 /* Make sure the new address is within the region. We explicitly permit the
4026 current address to be at the exact end of the region when the address is
4027 non-zero, in case the region is at the end of addressable memory and the
4028 calculation wraps around. */
4031 os_region_check (lang_output_section_statement_type *os,
4032 lang_memory_region_type *region,
4036 if ((region->current < region->origin
4037 || (region->current - region->origin > region->length))
4038 && ((region->current != region->origin + region->length)
4043 einfo (_("%X%P: address 0x%v of %B section %s"
4044 " is not within region %s\n"),
4046 os->bfd_section->owner,
4047 os->bfd_section->name,
4052 einfo (_("%X%P: region %s is full (%B section %s)\n"),
4054 os->bfd_section->owner,
4055 os->bfd_section->name);
4057 /* Reset the region pointer. */
4058 region->current = region->origin;
4062 /* Set the sizes for all the output sections. */
4065 lang_size_sections_1
4066 (lang_statement_union_type *s,
4067 lang_output_section_statement_type *output_section_statement,
4068 lang_statement_union_type **prev,
4072 bfd_boolean check_regions)
4074 /* Size up the sections from their constituent parts. */
4075 for (; s != NULL; s = s->header.next)
4077 switch (s->header.type)
4079 case lang_output_section_statement_enum:
4081 bfd_vma newdot, after;
4082 lang_output_section_statement_type *os;
4084 os = &s->output_section_statement;
4085 if (os->addr_tree != NULL)
4087 os->processed = FALSE;
4088 exp_fold_tree (os->addr_tree, bfd_abs_section_ptr, &dot);
4090 if (!expld.result.valid_p
4091 && expld.phase != lang_mark_phase_enum)
4092 einfo (_("%F%S: non constant or forward reference"
4093 " address expression for section %s\n"),
4096 dot = expld.result.value + expld.result.section->vma;
4099 if (os->bfd_section == NULL)
4100 /* This section was removed or never actually created. */
4103 /* If this is a COFF shared library section, use the size and
4104 address from the input section. FIXME: This is COFF
4105 specific; it would be cleaner if there were some other way
4106 to do this, but nothing simple comes to mind. */
4107 if ((bfd_get_flavour (output_bfd) == bfd_target_ecoff_flavour
4108 || bfd_get_flavour (output_bfd) == bfd_target_coff_flavour)
4109 && (os->bfd_section->flags & SEC_COFF_SHARED_LIBRARY) != 0)
4113 if (os->children.head == NULL
4114 || os->children.head->header.next != NULL
4115 || (os->children.head->header.type
4116 != lang_input_section_enum))
4117 einfo (_("%P%X: Internal error on COFF shared library"
4118 " section %s\n"), os->name);
4120 input = os->children.head->input_section.section;
4121 bfd_set_section_vma (os->bfd_section->owner,
4123 bfd_section_vma (input->owner, input));
4124 os->bfd_section->size = input->size;
4129 if (bfd_is_abs_section (os->bfd_section))
4131 /* No matter what happens, an abs section starts at zero. */
4132 ASSERT (os->bfd_section->vma == 0);
4136 if (os->addr_tree == NULL)
4138 /* No address specified for this section, get one
4139 from the region specification. */
4140 if (os->region == NULL
4141 || ((os->bfd_section->flags & (SEC_ALLOC | SEC_LOAD))
4142 && os->region->name[0] == '*'
4143 && strcmp (os->region->name,
4144 DEFAULT_MEMORY_REGION) == 0))
4146 os->region = lang_memory_default (os->bfd_section);
4149 /* If a loadable section is using the default memory
4150 region, and some non default memory regions were
4151 defined, issue an error message. */
4152 if (!IGNORE_SECTION (os->bfd_section)
4153 && ! link_info.relocatable
4155 && strcmp (os->region->name,
4156 DEFAULT_MEMORY_REGION) == 0
4157 && lang_memory_region_list != NULL
4158 && (strcmp (lang_memory_region_list->name,
4159 DEFAULT_MEMORY_REGION) != 0
4160 || lang_memory_region_list->next != NULL)
4161 && expld.phase != lang_mark_phase_enum)
4163 /* By default this is an error rather than just a
4164 warning because if we allocate the section to the
4165 default memory region we can end up creating an
4166 excessively large binary, or even seg faulting when
4167 attempting to perform a negative seek. See
4168 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4169 for an example of this. This behaviour can be
4170 overridden by the using the --no-check-sections
4172 if (command_line.check_section_addresses)
4173 einfo (_("%P%F: error: no memory region specified"
4174 " for loadable section `%s'\n"),
4175 bfd_get_section_name (output_bfd,
4178 einfo (_("%P: warning: no memory region specified"
4179 " for loadable section `%s'\n"),
4180 bfd_get_section_name (output_bfd,
4184 newdot = os->region->current;
4186 if (os->section_alignment == -1)
4188 bfd_vma savedot = newdot;
4189 newdot = align_power (newdot,
4190 os->bfd_section->alignment_power);
4192 if (newdot != savedot
4193 && config.warn_section_align
4194 && expld.phase != lang_mark_phase_enum)
4195 einfo (_("%P: warning: changing start of section"
4196 " %s by %lu bytes\n"),
4197 os->name, (unsigned long) (newdot - savedot));
4201 /* The section starts here.
4202 First, align to what the section needs. */
4204 if (os->section_alignment != -1)
4205 newdot = align_power (newdot, os->section_alignment);
4207 bfd_set_section_vma (0, os->bfd_section, newdot);
4209 os->bfd_section->output_offset = 0;
4212 lang_size_sections_1 (os->children.head, os, &os->children.head,
4213 os->fill, newdot, relax, check_regions);
4215 os->processed = TRUE;
4217 if (bfd_is_abs_section (os->bfd_section) || os->ignored)
4219 ASSERT (os->bfd_section->size == 0);
4223 dot = os->bfd_section->vma;
4225 /* Put the section within the requested block size, or
4226 align at the block boundary. */
4228 + TO_ADDR (os->bfd_section->size)
4229 + os->block_value - 1)
4230 & - (bfd_vma) os->block_value);
4232 os->bfd_section->size = TO_SIZE (after - os->bfd_section->vma);
4234 /* .tbss sections effectively have zero size. */
4235 if ((os->bfd_section->flags & SEC_HAS_CONTENTS) != 0
4236 || (os->bfd_section->flags & SEC_THREAD_LOCAL) == 0
4237 || link_info.relocatable)
4238 dot += TO_ADDR (os->bfd_section->size);
4240 if (os->update_dot_tree != 0)
4241 exp_fold_tree (os->update_dot_tree, bfd_abs_section_ptr, &dot);
4243 /* Update dot in the region ?
4244 We only do this if the section is going to be allocated,
4245 since unallocated sections do not contribute to the region's
4246 overall size in memory.
4248 If the SEC_NEVER_LOAD bit is not set, it will affect the
4249 addresses of sections after it. We have to update
4251 if (os->region != NULL
4252 && ((os->bfd_section->flags & SEC_NEVER_LOAD) == 0
4253 || (os->bfd_section->flags & (SEC_ALLOC | SEC_LOAD))))
4255 os->region->current = dot;
4258 /* Make sure the new address is within the region. */
4259 os_region_check (os, os->region, os->addr_tree,
4260 os->bfd_section->vma);
4262 /* If there's no load address specified, use the run
4263 region as the load region. */
4264 if (os->lma_region == NULL && os->load_base == NULL)
4265 os->lma_region = os->region;
4267 if (os->lma_region != NULL && os->lma_region != os->region)
4269 /* Set load_base, which will be handled later. */
4270 os->load_base = exp_intop (os->lma_region->current);
4271 os->lma_region->current +=
4272 TO_ADDR (os->bfd_section->size);
4274 os_region_check (os, os->lma_region, NULL,
4275 os->bfd_section->lma);
4281 case lang_constructors_statement_enum:
4282 dot = lang_size_sections_1 (constructor_list.head,
4283 output_section_statement,
4284 &s->wild_statement.children.head,
4285 fill, dot, relax, check_regions);
4288 case lang_data_statement_enum:
4290 unsigned int size = 0;
4292 s->data_statement.output_offset =
4293 dot - output_section_statement->bfd_section->vma;
4294 s->data_statement.output_section =
4295 output_section_statement->bfd_section;
4297 /* We might refer to provided symbols in the expression, and
4298 need to mark them as needed. */
4299 exp_fold_tree (s->data_statement.exp, bfd_abs_section_ptr, &dot);
4301 switch (s->data_statement.type)
4319 if (size < TO_SIZE ((unsigned) 1))
4320 size = TO_SIZE ((unsigned) 1);
4321 dot += TO_ADDR (size);
4322 output_section_statement->bfd_section->size += size;
4326 case lang_reloc_statement_enum:
4330 s->reloc_statement.output_offset =
4331 dot - output_section_statement->bfd_section->vma;
4332 s->reloc_statement.output_section =
4333 output_section_statement->bfd_section;
4334 size = bfd_get_reloc_size (s->reloc_statement.howto);
4335 dot += TO_ADDR (size);
4336 output_section_statement->bfd_section->size += size;
4340 case lang_wild_statement_enum:
4341 dot = lang_size_sections_1 (s->wild_statement.children.head,
4342 output_section_statement,
4343 &s->wild_statement.children.head,
4344 fill, dot, relax, check_regions);
4347 case lang_object_symbols_statement_enum:
4348 link_info.create_object_symbols_section =
4349 output_section_statement->bfd_section;
4352 case lang_output_statement_enum:
4353 case lang_target_statement_enum:
4356 case lang_input_section_enum:
4360 i = (*prev)->input_section.section;
4365 if (! bfd_relax_section (i->owner, i, &link_info, &again))
4366 einfo (_("%P%F: can't relax section: %E\n"));
4370 dot = size_input_section (prev, output_section_statement,
4371 output_section_statement->fill, dot);
4375 case lang_input_statement_enum:
4378 case lang_fill_statement_enum:
4379 s->fill_statement.output_section =
4380 output_section_statement->bfd_section;
4382 fill = s->fill_statement.fill;
4385 case lang_assignment_statement_enum:
4387 bfd_vma newdot = dot;
4389 exp_fold_tree (s->assignment_statement.exp,
4390 output_section_statement->bfd_section,
4393 if (newdot != dot && !output_section_statement->ignored)
4395 if (output_section_statement == abs_output_section)
4397 /* If we don't have an output section, then just adjust
4398 the default memory address. */
4399 lang_memory_region_lookup (DEFAULT_MEMORY_REGION,
4400 FALSE)->current = newdot;
4404 /* Insert a pad after this statement. We can't
4405 put the pad before when relaxing, in case the
4406 assignment references dot. */
4407 insert_pad (&s->header.next, fill, TO_SIZE (newdot - dot),
4408 output_section_statement->bfd_section, dot);
4410 /* Don't neuter the pad below when relaxing. */
4413 /* If dot is advanced, this implies that the section
4414 should have space allocated to it, unless the
4415 user has explicitly stated that the section
4416 should never be loaded. */
4417 if (!(output_section_statement->flags
4418 & (SEC_NEVER_LOAD | SEC_ALLOC)))
4419 output_section_statement->bfd_section->flags |= SEC_ALLOC;
4426 case lang_padding_statement_enum:
4427 /* If this is the first time lang_size_sections is called,
4428 we won't have any padding statements. If this is the
4429 second or later passes when relaxing, we should allow
4430 padding to shrink. If padding is needed on this pass, it
4431 will be added back in. */
4432 s->padding_statement.size = 0;
4434 /* Make sure output_offset is valid. If relaxation shrinks
4435 the section and this pad isn't needed, it's possible to
4436 have output_offset larger than the final size of the
4437 section. bfd_set_section_contents will complain even for
4438 a pad size of zero. */
4439 s->padding_statement.output_offset
4440 = dot - output_section_statement->bfd_section->vma;
4443 case lang_group_statement_enum:
4444 dot = lang_size_sections_1 (s->group_statement.children.head,
4445 output_section_statement,
4446 &s->group_statement.children.head,
4447 fill, dot, relax, check_regions);
4454 /* We can only get here when relaxing is turned on. */
4455 case lang_address_statement_enum:
4458 prev = &s->header.next;
4464 one_lang_size_sections_pass (bfd_boolean *relax, bfd_boolean check_regions)
4466 lang_statement_iteration++;
4467 lang_size_sections_1 (statement_list.head, abs_output_section,
4468 &statement_list.head, 0, 0, relax, check_regions);
4472 lang_size_sections (bfd_boolean *relax, bfd_boolean check_regions)
4474 expld.phase = lang_allocating_phase_enum;
4475 expld.dataseg.phase = exp_dataseg_none;
4477 one_lang_size_sections_pass (relax, check_regions);
4478 if (expld.dataseg.phase == exp_dataseg_end_seen
4479 && link_info.relro && expld.dataseg.relro_end)
4481 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
4482 to put expld.dataseg.relro on a (common) page boundary. */
4483 bfd_vma old_min_base, relro_end, maxpage;
4485 expld.dataseg.phase = exp_dataseg_relro_adjust;
4486 old_min_base = expld.dataseg.min_base;
4487 maxpage = expld.dataseg.maxpagesize;
4488 expld.dataseg.base += (-expld.dataseg.relro_end
4489 & (expld.dataseg.pagesize - 1));
4490 /* Compute the expected PT_GNU_RELRO segment end. */
4491 relro_end = (expld.dataseg.relro_end + expld.dataseg.pagesize - 1)
4492 & ~(expld.dataseg.pagesize - 1);
4493 if (old_min_base + maxpage < expld.dataseg.base)
4495 expld.dataseg.base -= maxpage;
4496 relro_end -= maxpage;
4498 one_lang_size_sections_pass (relax, check_regions);
4499 if (expld.dataseg.relro_end > relro_end)
4501 /* The alignment of sections between DATA_SEGMENT_ALIGN
4502 and DATA_SEGMENT_RELRO_END caused huge padding to be
4503 inserted at DATA_SEGMENT_RELRO_END. Try some other base. */
4505 unsigned int max_alignment_power = 0;
4507 /* Find maximum alignment power of sections between
4508 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
4509 for (sec = output_bfd->sections; sec; sec = sec->next)
4510 if (sec->vma >= expld.dataseg.base
4511 && sec->vma < expld.dataseg.relro_end
4512 && sec->alignment_power > max_alignment_power)
4513 max_alignment_power = sec->alignment_power;
4515 if (((bfd_vma) 1 << max_alignment_power) < expld.dataseg.pagesize)
4517 if (expld.dataseg.base - (1 << max_alignment_power)
4519 expld.dataseg.base += expld.dataseg.pagesize;
4520 expld.dataseg.base -= (1 << max_alignment_power);
4521 one_lang_size_sections_pass (relax, check_regions);
4524 link_info.relro_start = expld.dataseg.base;
4525 link_info.relro_end = expld.dataseg.relro_end;
4527 else if (expld.dataseg.phase == exp_dataseg_end_seen)
4529 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
4530 a page could be saved in the data segment. */
4531 bfd_vma first, last;
4533 first = -expld.dataseg.base & (expld.dataseg.pagesize - 1);
4534 last = expld.dataseg.end & (expld.dataseg.pagesize - 1);
4536 && ((expld.dataseg.base & ~(expld.dataseg.pagesize - 1))
4537 != (expld.dataseg.end & ~(expld.dataseg.pagesize - 1)))
4538 && first + last <= expld.dataseg.pagesize)
4540 expld.dataseg.phase = exp_dataseg_adjust;
4541 one_lang_size_sections_pass (relax, check_regions);
4545 expld.phase = lang_final_phase_enum;
4548 /* Worker function for lang_do_assignments. Recursiveness goes here. */
4551 lang_do_assignments_1
4552 (lang_statement_union_type *s,
4553 lang_output_section_statement_type *output_section_statement,
4557 for (; s != NULL; s = s->header.next)
4559 switch (s->header.type)
4561 case lang_constructors_statement_enum:
4562 dot = lang_do_assignments_1 (constructor_list.head,
4563 output_section_statement,
4568 case lang_output_section_statement_enum:
4570 lang_output_section_statement_type *os;
4572 os = &(s->output_section_statement);
4573 if (os->bfd_section != NULL && !os->ignored)
4575 dot = os->bfd_section->vma;
4576 lang_do_assignments_1 (os->children.head, os, os->fill, dot);
4577 /* .tbss sections effectively have zero size. */
4578 if ((os->bfd_section->flags & SEC_HAS_CONTENTS) != 0
4579 || (os->bfd_section->flags & SEC_THREAD_LOCAL) == 0
4580 || link_info.relocatable)
4581 dot += TO_ADDR (os->bfd_section->size);
4585 /* If nothing has been placed into the output section then
4586 it won't have a bfd_section. */
4587 if (os->bfd_section && !os->ignored)
4589 os->bfd_section->lma
4590 = exp_get_abs_int (os->load_base, 0, "load base");
4596 case lang_wild_statement_enum:
4598 dot = lang_do_assignments_1 (s->wild_statement.children.head,
4599 output_section_statement,
4603 case lang_object_symbols_statement_enum:
4604 case lang_output_statement_enum:
4605 case lang_target_statement_enum:
4608 case lang_data_statement_enum:
4609 exp_fold_tree (s->data_statement.exp, bfd_abs_section_ptr, &dot);
4610 if (expld.result.valid_p)
4611 s->data_statement.value = (expld.result.value
4612 + expld.result.section->vma);
4614 einfo (_("%F%P: invalid data statement\n"));
4617 switch (s->data_statement.type)
4635 if (size < TO_SIZE ((unsigned) 1))
4636 size = TO_SIZE ((unsigned) 1);
4637 dot += TO_ADDR (size);
4641 case lang_reloc_statement_enum:
4642 exp_fold_tree (s->reloc_statement.addend_exp,
4643 bfd_abs_section_ptr, &dot);
4644 if (expld.result.valid_p)
4645 s->reloc_statement.addend_value = expld.result.value;
4647 einfo (_("%F%P: invalid reloc statement\n"));
4648 dot += TO_ADDR (bfd_get_reloc_size (s->reloc_statement.howto));
4651 case lang_input_section_enum:
4653 asection *in = s->input_section.section;
4655 if ((in->flags & SEC_EXCLUDE) == 0)
4656 dot += TO_ADDR (in->size);
4660 case lang_input_statement_enum:
4663 case lang_fill_statement_enum:
4664 fill = s->fill_statement.fill;
4667 case lang_assignment_statement_enum:
4668 exp_fold_tree (s->assignment_statement.exp,
4669 output_section_statement->bfd_section,
4673 case lang_padding_statement_enum:
4674 dot += TO_ADDR (s->padding_statement.size);
4677 case lang_group_statement_enum:
4678 dot = lang_do_assignments_1 (s->group_statement.children.head,
4679 output_section_statement,
4687 case lang_address_statement_enum:
4695 lang_do_assignments (void)
4697 lang_statement_iteration++;
4698 lang_do_assignments_1 (statement_list.head, abs_output_section, NULL, 0);
4701 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
4702 operator .startof. (section_name), it produces an undefined symbol
4703 .startof.section_name. Similarly, when it sees
4704 .sizeof. (section_name), it produces an undefined symbol
4705 .sizeof.section_name. For all the output sections, we look for
4706 such symbols, and set them to the correct value. */
4709 lang_set_startof (void)
4713 if (link_info.relocatable)
4716 for (s = output_bfd->sections; s != NULL; s = s->next)
4718 const char *secname;
4720 struct bfd_link_hash_entry *h;
4722 secname = bfd_get_section_name (output_bfd, s);
4723 buf = xmalloc (10 + strlen (secname));
4725 sprintf (buf, ".startof.%s", secname);
4726 h = bfd_link_hash_lookup (link_info.hash, buf, FALSE, FALSE, TRUE);
4727 if (h != NULL && h->type == bfd_link_hash_undefined)
4729 h->type = bfd_link_hash_defined;
4730 h->u.def.value = bfd_get_section_vma (output_bfd, s);
4731 h->u.def.section = bfd_abs_section_ptr;
4734 sprintf (buf, ".sizeof.%s", secname);
4735 h = bfd_link_hash_lookup (link_info.hash, buf, FALSE, FALSE, TRUE);
4736 if (h != NULL && h->type == bfd_link_hash_undefined)
4738 h->type = bfd_link_hash_defined;
4739 h->u.def.value = TO_ADDR (s->size);
4740 h->u.def.section = bfd_abs_section_ptr;
4750 struct bfd_link_hash_entry *h;
4753 if (link_info.relocatable || link_info.shared)
4758 if (entry_symbol.name == NULL)
4760 /* No entry has been specified. Look for the default entry, but
4761 don't warn if we don't find it. */
4762 entry_symbol.name = entry_symbol_default;
4766 h = bfd_link_hash_lookup (link_info.hash, entry_symbol.name,
4767 FALSE, FALSE, TRUE);
4769 && (h->type == bfd_link_hash_defined
4770 || h->type == bfd_link_hash_defweak)
4771 && h->u.def.section->output_section != NULL)
4775 val = (h->u.def.value
4776 + bfd_get_section_vma (output_bfd,
4777 h->u.def.section->output_section)
4778 + h->u.def.section->output_offset);
4779 if (! bfd_set_start_address (output_bfd, val))
4780 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol.name);
4787 /* We couldn't find the entry symbol. Try parsing it as a
4789 val = bfd_scan_vma (entry_symbol.name, &send, 0);
4792 if (! bfd_set_start_address (output_bfd, val))
4793 einfo (_("%P%F: can't set start address\n"));
4799 /* Can't find the entry symbol, and it's not a number. Use
4800 the first address in the text section. */
4801 ts = bfd_get_section_by_name (output_bfd, entry_section);
4805 einfo (_("%P: warning: cannot find entry symbol %s;"
4806 " defaulting to %V\n"),
4808 bfd_get_section_vma (output_bfd, ts));
4809 if (! bfd_set_start_address (output_bfd,
4810 bfd_get_section_vma (output_bfd,
4812 einfo (_("%P%F: can't set start address\n"));
4817 einfo (_("%P: warning: cannot find entry symbol %s;"
4818 " not setting start address\n"),
4824 /* Don't bfd_hash_table_free (&lang_definedness_table);
4825 map file output may result in a call of lang_track_definedness. */
4828 /* This is a small function used when we want to ignore errors from
4832 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED, ...)
4834 /* Don't do anything. */
4837 /* Check that the architecture of all the input files is compatible
4838 with the output file. Also call the backend to let it do any
4839 other checking that is needed. */
4844 lang_statement_union_type *file;
4846 const bfd_arch_info_type *compatible;
4848 for (file = file_chain.head; file != NULL; file = file->input_statement.next)
4850 input_bfd = file->input_statement.the_bfd;
4852 = bfd_arch_get_compatible (input_bfd, output_bfd,
4853 command_line.accept_unknown_input_arch);
4855 /* In general it is not possible to perform a relocatable
4856 link between differing object formats when the input
4857 file has relocations, because the relocations in the
4858 input format may not have equivalent representations in
4859 the output format (and besides BFD does not translate
4860 relocs for other link purposes than a final link). */
4861 if ((link_info.relocatable || link_info.emitrelocations)
4862 && (compatible == NULL
4863 || bfd_get_flavour (input_bfd) != bfd_get_flavour (output_bfd))
4864 && (bfd_get_file_flags (input_bfd) & HAS_RELOC) != 0)
4866 einfo (_("%P%F: Relocatable linking with relocations from"
4867 " format %s (%B) to format %s (%B) is not supported\n"),
4868 bfd_get_target (input_bfd), input_bfd,
4869 bfd_get_target (output_bfd), output_bfd);
4870 /* einfo with %F exits. */
4873 if (compatible == NULL)
4875 if (command_line.warn_mismatch)
4876 einfo (_("%P: warning: %s architecture of input file `%B'"
4877 " is incompatible with %s output\n"),
4878 bfd_printable_name (input_bfd), input_bfd,
4879 bfd_printable_name (output_bfd));
4881 else if (bfd_count_sections (input_bfd))
4883 /* If the input bfd has no contents, it shouldn't set the
4884 private data of the output bfd. */
4886 bfd_error_handler_type pfn = NULL;
4888 /* If we aren't supposed to warn about mismatched input
4889 files, temporarily set the BFD error handler to a
4890 function which will do nothing. We still want to call
4891 bfd_merge_private_bfd_data, since it may set up
4892 information which is needed in the output file. */
4893 if (! command_line.warn_mismatch)
4894 pfn = bfd_set_error_handler (ignore_bfd_errors);
4895 if (! bfd_merge_private_bfd_data (input_bfd, output_bfd))
4897 if (command_line.warn_mismatch)
4898 einfo (_("%P%X: failed to merge target specific data"
4899 " of file %B\n"), input_bfd);
4901 if (! command_line.warn_mismatch)
4902 bfd_set_error_handler (pfn);
4907 /* Look through all the global common symbols and attach them to the
4908 correct section. The -sort-common command line switch may be used
4909 to roughly sort the entries by size. */
4914 if (command_line.inhibit_common_definition)
4916 if (link_info.relocatable
4917 && ! command_line.force_common_definition)
4920 if (! config.sort_common)
4921 bfd_link_hash_traverse (link_info.hash, lang_one_common, NULL);
4926 for (power = 4; power >= 0; power--)
4927 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
4931 /* Place one common symbol in the correct section. */
4934 lang_one_common (struct bfd_link_hash_entry *h, void *info)
4936 unsigned int power_of_two;
4940 if (h->type != bfd_link_hash_common)
4944 power_of_two = h->u.c.p->alignment_power;
4946 if (config.sort_common
4947 && power_of_two < (unsigned int) *(int *) info)
4950 section = h->u.c.p->section;
4952 /* Increase the size of the section to align the common sym. */
4953 section->size += ((bfd_vma) 1 << (power_of_two + opb_shift)) - 1;
4954 section->size &= (- (bfd_vma) 1 << (power_of_two + opb_shift));
4956 /* Adjust the alignment if necessary. */
4957 if (power_of_two > section->alignment_power)
4958 section->alignment_power = power_of_two;
4960 /* Change the symbol from common to defined. */
4961 h->type = bfd_link_hash_defined;
4962 h->u.def.section = section;
4963 h->u.def.value = section->size;
4965 /* Increase the size of the section. */
4966 section->size += size;
4968 /* Make sure the section is allocated in memory, and make sure that
4969 it is no longer a common section. */
4970 section->flags |= SEC_ALLOC;
4971 section->flags &= ~SEC_IS_COMMON;
4973 if (config.map_file != NULL)
4975 static bfd_boolean header_printed;
4980 if (! header_printed)
4982 minfo (_("\nAllocating common symbols\n"));
4983 minfo (_("Common symbol size file\n\n"));
4984 header_printed = TRUE;
4987 name = demangle (h->root.string);
4989 len = strlen (name);
5004 if (size <= 0xffffffff)
5005 sprintf (buf, "%lx", (unsigned long) size);
5007 sprintf_vma (buf, size);
5017 minfo ("%B\n", section->owner);
5023 /* Run through the input files and ensure that every input section has
5024 somewhere to go. If one is found without a destination then create
5025 an input request and place it into the statement tree. */
5028 lang_place_orphans (void)
5030 LANG_FOR_EACH_INPUT_STATEMENT (file)
5034 for (s = file->the_bfd->sections; s != NULL; s = s->next)
5036 if (s->output_section == NULL)
5038 /* This section of the file is not attached, root
5039 around for a sensible place for it to go. */
5041 if (file->just_syms_flag)
5042 bfd_link_just_syms (file->the_bfd, s, &link_info);
5043 else if ((s->flags & SEC_EXCLUDE) != 0)
5044 s->output_section = bfd_abs_section_ptr;
5045 else if (strcmp (s->name, "COMMON") == 0)
5047 /* This is a lonely common section which must have
5048 come from an archive. We attach to the section
5049 with the wildcard. */
5050 if (! link_info.relocatable
5051 || command_line.force_common_definition)
5053 if (default_common_section == NULL)
5055 default_common_section =
5056 lang_output_section_statement_lookup (".bss");
5059 lang_add_section (&default_common_section->children, s,
5060 default_common_section, file);
5063 else if (ldemul_place_orphan (file, s))
5067 lang_output_section_statement_type *os;
5069 os = lang_output_section_statement_lookup (s->name);
5070 lang_add_section (&os->children, s, os, file);
5078 lang_set_flags (lang_memory_region_type *ptr, const char *flags, int invert)
5080 flagword *ptr_flags;
5082 ptr_flags = invert ? &ptr->not_flags : &ptr->flags;
5088 *ptr_flags |= SEC_ALLOC;
5092 *ptr_flags |= SEC_READONLY;
5096 *ptr_flags |= SEC_DATA;
5100 *ptr_flags |= SEC_CODE;
5105 *ptr_flags |= SEC_LOAD;
5109 einfo (_("%P%F: invalid syntax in flags\n"));
5116 /* Call a function on each input file. This function will be called
5117 on an archive, but not on the elements. */
5120 lang_for_each_input_file (void (*func) (lang_input_statement_type *))
5122 lang_input_statement_type *f;
5124 for (f = (lang_input_statement_type *) input_file_chain.head;
5126 f = (lang_input_statement_type *) f->next_real_file)
5130 /* Call a function on each file. The function will be called on all
5131 the elements of an archive which are included in the link, but will
5132 not be called on the archive file itself. */
5135 lang_for_each_file (void (*func) (lang_input_statement_type *))
5137 LANG_FOR_EACH_INPUT_STATEMENT (f)
5144 ldlang_add_file (lang_input_statement_type *entry)
5148 lang_statement_append (&file_chain,
5149 (lang_statement_union_type *) entry,
5152 /* The BFD linker needs to have a list of all input BFDs involved in
5154 ASSERT (entry->the_bfd->link_next == NULL);
5155 ASSERT (entry->the_bfd != output_bfd);
5156 for (pp = &link_info.input_bfds; *pp != NULL; pp = &(*pp)->link_next)
5158 *pp = entry->the_bfd;
5159 entry->the_bfd->usrdata = entry;
5160 bfd_set_gp_size (entry->the_bfd, g_switch_value);
5162 /* Look through the sections and check for any which should not be
5163 included in the link. We need to do this now, so that we can
5164 notice when the backend linker tries to report multiple
5165 definition errors for symbols which are in sections we aren't
5166 going to link. FIXME: It might be better to entirely ignore
5167 symbols which are defined in sections which are going to be
5168 discarded. This would require modifying the backend linker for
5169 each backend which might set the SEC_LINK_ONCE flag. If we do
5170 this, we should probably handle SEC_EXCLUDE in the same way. */
5172 bfd_map_over_sections (entry->the_bfd, section_already_linked, entry);
5176 lang_add_output (const char *name, int from_script)
5178 /* Make -o on command line override OUTPUT in script. */
5179 if (!had_output_filename || !from_script)
5181 output_filename = name;
5182 had_output_filename = TRUE;
5186 static lang_output_section_statement_type *current_section;
5197 for (l = 0; l < 32; l++)
5199 if (i >= (unsigned int) x)
5207 lang_output_section_statement_type *
5208 lang_enter_output_section_statement (const char *output_section_statement_name,
5209 etree_type *address_exp,
5210 enum section_type sectype,
5212 etree_type *subalign,
5216 lang_output_section_statement_type *os;
5220 lang_output_section_statement_lookup_1 (output_section_statement_name,
5223 /* Make next things chain into subchain of this. */
5225 if (os->addr_tree == NULL)
5227 os->addr_tree = address_exp;
5229 os->sectype = sectype;
5230 if (sectype != noload_section)
5231 os->flags = SEC_NO_FLAGS;
5233 os->flags = SEC_NEVER_LOAD;
5234 os->block_value = 1;
5235 stat_ptr = &os->children;
5237 os->subsection_alignment =
5238 topower (exp_get_value_int (subalign, -1, "subsection alignment"));
5239 os->section_alignment =
5240 topower (exp_get_value_int (align, -1, "section alignment"));
5242 os->load_base = ebase;
5249 lang_output_statement_type *new =
5250 new_stat (lang_output_statement, stat_ptr);
5252 new->name = output_filename;
5255 /* Reset the current counters in the regions. */
5258 lang_reset_memory_regions (void)
5260 lang_memory_region_type *p = lang_memory_region_list;
5262 lang_output_section_statement_type *os;
5264 for (p = lang_memory_region_list; p != NULL; p = p->next)
5266 p->old_length = (bfd_size_type) (p->current - p->origin);
5267 p->current = p->origin;
5270 for (os = &lang_output_section_statement.head->output_section_statement;
5273 os->processed = FALSE;
5275 for (o = output_bfd->sections; o != NULL; o = o->next)
5277 /* Save the last size for possible use by bfd_relax_section. */
5278 o->rawsize = o->size;
5283 /* Worker for lang_gc_sections_1. */
5286 gc_section_callback (lang_wild_statement_type *ptr,
5287 struct wildcard_list *sec ATTRIBUTE_UNUSED,
5289 lang_input_statement_type *file ATTRIBUTE_UNUSED,
5290 void *data ATTRIBUTE_UNUSED)
5292 /* If the wild pattern was marked KEEP, the member sections
5293 should be as well. */
5294 if (ptr->keep_sections)
5295 section->flags |= SEC_KEEP;
5298 /* Iterate over sections marking them against GC. */
5301 lang_gc_sections_1 (lang_statement_union_type *s)
5303 for (; s != NULL; s = s->header.next)
5305 switch (s->header.type)
5307 case lang_wild_statement_enum:
5308 walk_wild (&s->wild_statement, gc_section_callback, NULL);
5310 case lang_constructors_statement_enum:
5311 lang_gc_sections_1 (constructor_list.head);
5313 case lang_output_section_statement_enum:
5314 lang_gc_sections_1 (s->output_section_statement.children.head);
5316 case lang_group_statement_enum:
5317 lang_gc_sections_1 (s->group_statement.children.head);
5326 lang_gc_sections (void)
5328 struct bfd_link_hash_entry *h;
5329 ldlang_undef_chain_list_type *ulist;
5331 /* Keep all sections so marked in the link script. */
5333 lang_gc_sections_1 (statement_list.head);
5335 /* Keep all sections containing symbols undefined on the command-line,
5336 and the section containing the entry symbol. */
5338 for (ulist = link_info.gc_sym_list; ulist; ulist = ulist->next)
5340 h = bfd_link_hash_lookup (link_info.hash, ulist->name,
5341 FALSE, FALSE, FALSE);
5344 && (h->type == bfd_link_hash_defined
5345 || h->type == bfd_link_hash_defweak)
5346 && ! bfd_is_abs_section (h->u.def.section))
5348 h->u.def.section->flags |= SEC_KEEP;
5352 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
5353 the special case of debug info. (See bfd/stabs.c)
5354 Twiddle the flag here, to simplify later linker code. */
5355 if (link_info.relocatable)
5357 LANG_FOR_EACH_INPUT_STATEMENT (f)
5360 for (sec = f->the_bfd->sections; sec != NULL; sec = sec->next)
5361 if ((sec->flags & SEC_DEBUGGING) == 0)
5362 sec->flags &= ~SEC_EXCLUDE;
5366 if (link_info.gc_sections)
5367 bfd_gc_sections (output_bfd, &link_info);
5373 current_target = default_target;
5375 /* Open the output file. */
5376 lang_for_each_statement (ldlang_open_output);
5379 ldemul_create_output_section_statements ();
5381 /* Add to the hash table all undefineds on the command line. */
5382 lang_place_undefineds ();
5384 if (!bfd_section_already_linked_table_init ())
5385 einfo (_("%P%F: Failed to create hash table\n"));
5387 /* Create a bfd for each input file. */
5388 current_target = default_target;
5389 open_input_bfds (statement_list.head, FALSE);
5391 link_info.gc_sym_list = &entry_symbol;
5392 if (entry_symbol.name == NULL)
5393 link_info.gc_sym_list = ldlang_undef_chain_list_head;
5395 ldemul_after_open ();
5397 bfd_section_already_linked_table_free ();
5399 /* Make sure that we're not mixing architectures. We call this
5400 after all the input files have been opened, but before we do any
5401 other processing, so that any operations merge_private_bfd_data
5402 does on the output file will be known during the rest of the
5406 /* Handle .exports instead of a version script if we're told to do so. */
5407 if (command_line.version_exports_section)
5408 lang_do_version_exports_section ();
5410 /* Build all sets based on the information gathered from the input
5412 ldctor_build_sets ();
5414 /* Remove unreferenced sections if asked to. */
5415 lang_gc_sections ();
5417 /* Size up the common data. */
5420 /* Update wild statements. */
5421 update_wild_statements (statement_list.head);
5423 /* Run through the contours of the script and attach input sections
5424 to the correct output sections. */
5425 map_input_to_output_sections (statement_list.head, NULL, NULL);
5427 /* Find any sections not attached explicitly and handle them. */
5428 lang_place_orphans ();
5430 if (! link_info.relocatable)
5434 /* Merge SEC_MERGE sections. This has to be done after GC of
5435 sections, so that GCed sections are not merged, but before
5436 assigning dynamic symbols, since removing whole input sections
5438 bfd_merge_sections (output_bfd, &link_info);
5440 /* Look for a text section and set the readonly attribute in it. */
5441 found = bfd_get_section_by_name (output_bfd, ".text");
5445 if (config.text_read_only)
5446 found->flags |= SEC_READONLY;
5448 found->flags &= ~SEC_READONLY;
5452 /* Do anything special before sizing sections. This is where ELF
5453 and other back-ends size dynamic sections. */
5454 ldemul_before_allocation ();
5456 /* We must record the program headers before we try to fix the
5457 section positions, since they will affect SIZEOF_HEADERS. */
5458 lang_record_phdrs ();
5460 /* Size up the sections. */
5461 lang_size_sections (NULL, !command_line.relax);
5463 /* Now run around and relax if we can. */
5464 if (command_line.relax)
5466 /* Keep relaxing until bfd_relax_section gives up. */
5467 bfd_boolean relax_again;
5471 relax_again = FALSE;
5473 /* Note: pe-dll.c does something like this also. If you find
5474 you need to change this code, you probably need to change
5475 pe-dll.c also. DJ */
5477 /* Do all the assignments with our current guesses as to
5479 lang_do_assignments ();
5481 /* We must do this after lang_do_assignments, because it uses
5483 lang_reset_memory_regions ();
5485 /* Perform another relax pass - this time we know where the
5486 globals are, so can make a better guess. */
5487 lang_size_sections (&relax_again, FALSE);
5489 /* If the normal relax is done and the relax finalize pass
5490 is not performed yet, we perform another relax pass. */
5491 if (!relax_again && link_info.need_relax_finalize)
5493 link_info.need_relax_finalize = FALSE;
5497 while (relax_again);
5499 /* Final extra sizing to report errors. */
5500 lang_do_assignments ();
5501 lang_reset_memory_regions ();
5502 lang_size_sections (NULL, TRUE);
5505 /* See if anything special should be done now we know how big
5507 ldemul_after_allocation ();
5509 /* Fix any .startof. or .sizeof. symbols. */
5510 lang_set_startof ();
5512 /* Do all the assignments, now that we know the final resting places
5513 of all the symbols. */
5515 lang_do_assignments ();
5517 /* Make sure that the section addresses make sense. */
5518 if (! link_info.relocatable
5519 && command_line.check_section_addresses)
5520 lang_check_section_addresses ();
5527 /* EXPORTED TO YACC */
5530 lang_add_wild (struct wildcard_spec *filespec,
5531 struct wildcard_list *section_list,
5532 bfd_boolean keep_sections)
5534 struct wildcard_list *curr, *next;
5535 lang_wild_statement_type *new;
5537 /* Reverse the list as the parser puts it back to front. */
5538 for (curr = section_list, section_list = NULL;
5540 section_list = curr, curr = next)
5542 if (curr->spec.name != NULL && strcmp (curr->spec.name, "COMMON") == 0)
5543 placed_commons = TRUE;
5546 curr->next = section_list;
5549 if (filespec != NULL && filespec->name != NULL)
5551 if (strcmp (filespec->name, "*") == 0)
5552 filespec->name = NULL;
5553 else if (! wildcardp (filespec->name))
5554 lang_has_input_file = TRUE;
5557 new = new_stat (lang_wild_statement, stat_ptr);
5558 new->filename = NULL;
5559 new->filenames_sorted = FALSE;
5560 if (filespec != NULL)
5562 new->filename = filespec->name;
5563 new->filenames_sorted = filespec->sorted == by_name;
5565 new->section_list = section_list;
5566 new->keep_sections = keep_sections;
5567 lang_list_init (&new->children);
5568 analyze_walk_wild_section_handler (new);
5572 lang_section_start (const char *name, etree_type *address,
5573 const segment_type *segment)
5575 lang_address_statement_type *ad;
5577 ad = new_stat (lang_address_statement, stat_ptr);
5578 ad->section_name = name;
5579 ad->address = address;
5580 ad->segment = segment;
5583 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
5584 because of a -e argument on the command line, or zero if this is
5585 called by ENTRY in a linker script. Command line arguments take
5589 lang_add_entry (const char *name, bfd_boolean cmdline)
5591 if (entry_symbol.name == NULL
5593 || ! entry_from_cmdline)
5595 entry_symbol.name = name;
5596 entry_from_cmdline = cmdline;
5600 /* Set the default start symbol to NAME. .em files should use this,
5601 not lang_add_entry, to override the use of "start" if neither the
5602 linker script nor the command line specifies an entry point. NAME
5603 must be permanently allocated. */
5605 lang_default_entry (const char *name)
5607 entry_symbol_default = name;
5611 lang_add_target (const char *name)
5613 lang_target_statement_type *new = new_stat (lang_target_statement,
5621 lang_add_map (const char *name)
5628 map_option_f = TRUE;
5636 lang_add_fill (fill_type *fill)
5638 lang_fill_statement_type *new = new_stat (lang_fill_statement,
5645 lang_add_data (int type, union etree_union *exp)
5648 lang_data_statement_type *new = new_stat (lang_data_statement,
5656 /* Create a new reloc statement. RELOC is the BFD relocation type to
5657 generate. HOWTO is the corresponding howto structure (we could
5658 look this up, but the caller has already done so). SECTION is the
5659 section to generate a reloc against, or NAME is the name of the
5660 symbol to generate a reloc against. Exactly one of SECTION and
5661 NAME must be NULL. ADDEND is an expression for the addend. */
5664 lang_add_reloc (bfd_reloc_code_real_type reloc,
5665 reloc_howto_type *howto,
5668 union etree_union *addend)
5670 lang_reloc_statement_type *p = new_stat (lang_reloc_statement, stat_ptr);
5674 p->section = section;
5676 p->addend_exp = addend;
5678 p->addend_value = 0;
5679 p->output_section = NULL;
5680 p->output_offset = 0;
5683 lang_assignment_statement_type *
5684 lang_add_assignment (etree_type *exp)
5686 lang_assignment_statement_type *new = new_stat (lang_assignment_statement,
5694 lang_add_attribute (enum statement_enum attribute)
5696 new_statement (attribute, sizeof (lang_statement_union_type), stat_ptr);
5700 lang_startup (const char *name)
5702 if (startup_file != NULL)
5704 einfo (_("%P%F: multiple STARTUP files\n"));
5706 first_file->filename = name;
5707 first_file->local_sym_name = name;
5708 first_file->real = TRUE;
5710 startup_file = name;
5714 lang_float (bfd_boolean maybe)
5716 lang_float_flag = maybe;
5720 /* Work out the load- and run-time regions from a script statement, and
5721 store them in *LMA_REGION and *REGION respectively.
5723 MEMSPEC is the name of the run-time region, or the value of
5724 DEFAULT_MEMORY_REGION if the statement didn't specify one.
5725 LMA_MEMSPEC is the name of the load-time region, or null if the
5726 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
5727 had an explicit load address.
5729 It is an error to specify both a load region and a load address. */
5732 lang_get_regions (lang_memory_region_type **region,
5733 lang_memory_region_type **lma_region,
5734 const char *memspec,
5735 const char *lma_memspec,
5736 bfd_boolean have_lma,
5737 bfd_boolean have_vma)
5739 *lma_region = lang_memory_region_lookup (lma_memspec, FALSE);
5741 /* If no runtime region or VMA has been specified, but the load region
5742 has been specified, then use the load region for the runtime region
5744 if (lma_memspec != NULL
5746 && strcmp (memspec, DEFAULT_MEMORY_REGION) == 0)
5747 *region = *lma_region;
5749 *region = lang_memory_region_lookup (memspec, FALSE);
5751 if (have_lma && lma_memspec != 0)
5752 einfo (_("%X%P:%S: section has both a load address and a load region\n"));
5756 lang_leave_output_section_statement (fill_type *fill, const char *memspec,
5757 lang_output_section_phdr_list *phdrs,
5758 const char *lma_memspec)
5760 lang_get_regions (¤t_section->region,
5761 ¤t_section->lma_region,
5762 memspec, lma_memspec,
5763 current_section->load_base != NULL,
5764 current_section->addr_tree != NULL);
5765 current_section->fill = fill;
5766 current_section->phdrs = phdrs;
5767 stat_ptr = &statement_list;
5770 /* Create an absolute symbol with the given name with the value of the
5771 address of first byte of the section named.
5773 If the symbol already exists, then do nothing. */
5776 lang_abs_symbol_at_beginning_of (const char *secname, const char *name)
5778 struct bfd_link_hash_entry *h;
5780 h = bfd_link_hash_lookup (link_info.hash, name, TRUE, TRUE, TRUE);
5782 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
5784 if (h->type == bfd_link_hash_new
5785 || h->type == bfd_link_hash_undefined)
5789 h->type = bfd_link_hash_defined;
5791 sec = bfd_get_section_by_name (output_bfd, secname);
5795 h->u.def.value = bfd_get_section_vma (output_bfd, sec);
5797 h->u.def.section = bfd_abs_section_ptr;
5801 /* Create an absolute symbol with the given name with the value of the
5802 address of the first byte after the end of the section named.
5804 If the symbol already exists, then do nothing. */
5807 lang_abs_symbol_at_end_of (const char *secname, const char *name)
5809 struct bfd_link_hash_entry *h;
5811 h = bfd_link_hash_lookup (link_info.hash, name, TRUE, TRUE, TRUE);
5813 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
5815 if (h->type == bfd_link_hash_new
5816 || h->type == bfd_link_hash_undefined)
5820 h->type = bfd_link_hash_defined;
5822 sec = bfd_get_section_by_name (output_bfd, secname);
5826 h->u.def.value = (bfd_get_section_vma (output_bfd, sec)
5827 + TO_ADDR (sec->size));
5829 h->u.def.section = bfd_abs_section_ptr;
5834 lang_statement_append (lang_statement_list_type *list,
5835 lang_statement_union_type *element,
5836 lang_statement_union_type **field)
5838 *(list->tail) = element;
5842 /* Set the output format type. -oformat overrides scripts. */
5845 lang_add_output_format (const char *format,
5850 if (output_target == NULL || !from_script)
5852 if (command_line.endian == ENDIAN_BIG
5855 else if (command_line.endian == ENDIAN_LITTLE
5859 output_target = format;
5863 /* Enter a group. This creates a new lang_group_statement, and sets
5864 stat_ptr to build new statements within the group. */
5867 lang_enter_group (void)
5869 lang_group_statement_type *g;
5871 g = new_stat (lang_group_statement, stat_ptr);
5872 lang_list_init (&g->children);
5873 stat_ptr = &g->children;
5876 /* Leave a group. This just resets stat_ptr to start writing to the
5877 regular list of statements again. Note that this will not work if
5878 groups can occur inside anything else which can adjust stat_ptr,
5879 but currently they can't. */
5882 lang_leave_group (void)
5884 stat_ptr = &statement_list;
5887 /* Add a new program header. This is called for each entry in a PHDRS
5888 command in a linker script. */
5891 lang_new_phdr (const char *name,
5893 bfd_boolean filehdr,
5898 struct lang_phdr *n, **pp;
5900 n = stat_alloc (sizeof (struct lang_phdr));
5903 n->type = exp_get_value_int (type, 0, "program header type");
5904 n->filehdr = filehdr;
5909 for (pp = &lang_phdr_list; *pp != NULL; pp = &(*pp)->next)
5914 /* Record the program header information in the output BFD. FIXME: We
5915 should not be calling an ELF specific function here. */
5918 lang_record_phdrs (void)
5922 lang_output_section_phdr_list *last;
5923 struct lang_phdr *l;
5924 lang_output_section_statement_type *os;
5927 secs = xmalloc (alc * sizeof (asection *));
5929 for (l = lang_phdr_list; l != NULL; l = l->next)
5936 for (os = &lang_output_section_statement.head->output_section_statement;
5940 lang_output_section_phdr_list *pl;
5942 if (os->constraint == -1)
5950 if (os->sectype == noload_section
5951 || os->bfd_section == NULL
5952 || (os->bfd_section->flags & SEC_ALLOC) == 0)
5957 if (os->bfd_section == NULL)
5960 for (; pl != NULL; pl = pl->next)
5962 if (strcmp (pl->name, l->name) == 0)
5967 secs = xrealloc (secs, alc * sizeof (asection *));
5969 secs[c] = os->bfd_section;
5976 if (l->flags == NULL)
5979 flags = exp_get_vma (l->flags, 0, "phdr flags");
5984 at = exp_get_vma (l->at, 0, "phdr load address");
5986 if (! bfd_record_phdr (output_bfd, l->type,
5987 l->flags != NULL, flags, l->at != NULL,
5988 at, l->filehdr, l->phdrs, c, secs))
5989 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
5994 /* Make sure all the phdr assignments succeeded. */
5995 for (os = &lang_output_section_statement.head->output_section_statement;
5999 lang_output_section_phdr_list *pl;
6001 if (os->constraint == -1
6002 || os->bfd_section == NULL)
6005 for (pl = os->phdrs;
6008 if (! pl->used && strcmp (pl->name, "NONE") != 0)
6009 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
6010 os->name, pl->name);
6014 /* Record a list of sections which may not be cross referenced. */
6017 lang_add_nocrossref (lang_nocrossref_type *l)
6019 struct lang_nocrossrefs *n;
6021 n = xmalloc (sizeof *n);
6022 n->next = nocrossref_list;
6024 nocrossref_list = n;
6026 /* Set notice_all so that we get informed about all symbols. */
6027 link_info.notice_all = TRUE;
6030 /* Overlay handling. We handle overlays with some static variables. */
6032 /* The overlay virtual address. */
6033 static etree_type *overlay_vma;
6034 /* And subsection alignment. */
6035 static etree_type *overlay_subalign;
6037 /* An expression for the maximum section size seen so far. */
6038 static etree_type *overlay_max;
6040 /* A list of all the sections in this overlay. */
6042 struct overlay_list {
6043 struct overlay_list *next;
6044 lang_output_section_statement_type *os;
6047 static struct overlay_list *overlay_list;
6049 /* Start handling an overlay. */
6052 lang_enter_overlay (etree_type *vma_expr, etree_type *subalign)
6054 /* The grammar should prevent nested overlays from occurring. */
6055 ASSERT (overlay_vma == NULL
6056 && overlay_subalign == NULL
6057 && overlay_max == NULL);
6059 overlay_vma = vma_expr;
6060 overlay_subalign = subalign;
6063 /* Start a section in an overlay. We handle this by calling
6064 lang_enter_output_section_statement with the correct VMA.
6065 lang_leave_overlay sets up the LMA and memory regions. */
6068 lang_enter_overlay_section (const char *name)
6070 struct overlay_list *n;
6073 lang_enter_output_section_statement (name, overlay_vma, normal_section,
6074 0, overlay_subalign, 0, 0);
6076 /* If this is the first section, then base the VMA of future
6077 sections on this one. This will work correctly even if `.' is
6078 used in the addresses. */
6079 if (overlay_list == NULL)
6080 overlay_vma = exp_nameop (ADDR, name);
6082 /* Remember the section. */
6083 n = xmalloc (sizeof *n);
6084 n->os = current_section;
6085 n->next = overlay_list;
6088 size = exp_nameop (SIZEOF, name);
6090 /* Arrange to work out the maximum section end address. */
6091 if (overlay_max == NULL)
6094 overlay_max = exp_binop (MAX_K, overlay_max, size);
6097 /* Finish a section in an overlay. There isn't any special to do
6101 lang_leave_overlay_section (fill_type *fill,
6102 lang_output_section_phdr_list *phdrs)
6109 name = current_section->name;
6111 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
6112 region and that no load-time region has been specified. It doesn't
6113 really matter what we say here, since lang_leave_overlay will
6115 lang_leave_output_section_statement (fill, DEFAULT_MEMORY_REGION, phdrs, 0);
6117 /* Define the magic symbols. */
6119 clean = xmalloc (strlen (name) + 1);
6121 for (s1 = name; *s1 != '\0'; s1++)
6122 if (ISALNUM (*s1) || *s1 == '_')
6126 buf = xmalloc (strlen (clean) + sizeof "__load_start_");
6127 sprintf (buf, "__load_start_%s", clean);
6128 lang_add_assignment (exp_assop ('=', buf,
6129 exp_nameop (LOADADDR, name)));
6131 buf = xmalloc (strlen (clean) + sizeof "__load_stop_");
6132 sprintf (buf, "__load_stop_%s", clean);
6133 lang_add_assignment (exp_assop ('=', buf,
6135 exp_nameop (LOADADDR, name),
6136 exp_nameop (SIZEOF, name))));
6141 /* Finish an overlay. If there are any overlay wide settings, this
6142 looks through all the sections in the overlay and sets them. */
6145 lang_leave_overlay (etree_type *lma_expr,
6148 const char *memspec,
6149 lang_output_section_phdr_list *phdrs,
6150 const char *lma_memspec)
6152 lang_memory_region_type *region;
6153 lang_memory_region_type *lma_region;
6154 struct overlay_list *l;
6155 lang_nocrossref_type *nocrossref;
6157 lang_get_regions (®ion, &lma_region,
6158 memspec, lma_memspec,
6159 lma_expr != NULL, FALSE);
6163 /* After setting the size of the last section, set '.' to end of the
6165 if (overlay_list != NULL)
6166 overlay_list->os->update_dot_tree
6167 = exp_assop ('=', ".", exp_binop ('+', overlay_vma, overlay_max));
6172 struct overlay_list *next;
6174 if (fill != NULL && l->os->fill == NULL)
6177 l->os->region = region;
6178 l->os->lma_region = lma_region;
6180 /* The first section has the load address specified in the
6181 OVERLAY statement. The rest are worked out from that.
6182 The base address is not needed (and should be null) if
6183 an LMA region was specified. */
6185 l->os->load_base = lma_expr;
6186 else if (lma_region == 0)
6187 l->os->load_base = exp_binop ('+',
6188 exp_nameop (LOADADDR, l->next->os->name),
6189 exp_nameop (SIZEOF, l->next->os->name));
6191 if (phdrs != NULL && l->os->phdrs == NULL)
6192 l->os->phdrs = phdrs;
6196 lang_nocrossref_type *nc;
6198 nc = xmalloc (sizeof *nc);
6199 nc->name = l->os->name;
6200 nc->next = nocrossref;
6209 if (nocrossref != NULL)
6210 lang_add_nocrossref (nocrossref);
6213 overlay_list = NULL;
6217 /* Version handling. This is only useful for ELF. */
6219 /* This global variable holds the version tree that we build. */
6221 struct bfd_elf_version_tree *lang_elf_version_info;
6223 /* If PREV is NULL, return first version pattern matching particular symbol.
6224 If PREV is non-NULL, return first version pattern matching particular
6225 symbol after PREV (previously returned by lang_vers_match). */
6227 static struct bfd_elf_version_expr *
6228 lang_vers_match (struct bfd_elf_version_expr_head *head,
6229 struct bfd_elf_version_expr *prev,
6232 const char *cxx_sym = sym;
6233 const char *java_sym = sym;
6234 struct bfd_elf_version_expr *expr = NULL;
6236 if (head->mask & BFD_ELF_VERSION_CXX_TYPE)
6238 cxx_sym = cplus_demangle (sym, DMGL_PARAMS | DMGL_ANSI);
6242 if (head->mask & BFD_ELF_VERSION_JAVA_TYPE)
6244 java_sym = cplus_demangle (sym, DMGL_JAVA);
6249 if (head->htab && (prev == NULL || prev->symbol))
6251 struct bfd_elf_version_expr e;
6253 switch (prev ? prev->mask : 0)
6256 if (head->mask & BFD_ELF_VERSION_C_TYPE)
6259 expr = htab_find (head->htab, &e);
6260 while (expr && strcmp (expr->symbol, sym) == 0)
6261 if (expr->mask == BFD_ELF_VERSION_C_TYPE)
6267 case BFD_ELF_VERSION_C_TYPE:
6268 if (head->mask & BFD_ELF_VERSION_CXX_TYPE)
6271 expr = htab_find (head->htab, &e);
6272 while (expr && strcmp (expr->symbol, cxx_sym) == 0)
6273 if (expr->mask == BFD_ELF_VERSION_CXX_TYPE)
6279 case BFD_ELF_VERSION_CXX_TYPE:
6280 if (head->mask & BFD_ELF_VERSION_JAVA_TYPE)
6282 e.symbol = java_sym;
6283 expr = htab_find (head->htab, &e);
6284 while (expr && strcmp (expr->symbol, java_sym) == 0)
6285 if (expr->mask == BFD_ELF_VERSION_JAVA_TYPE)
6296 /* Finally, try the wildcards. */
6297 if (prev == NULL || prev->symbol)
6298 expr = head->remaining;
6301 for (; expr; expr = expr->next)
6308 if (expr->pattern[0] == '*' && expr->pattern[1] == '\0')
6311 if (expr->mask == BFD_ELF_VERSION_JAVA_TYPE)
6313 else if (expr->mask == BFD_ELF_VERSION_CXX_TYPE)
6317 if (fnmatch (expr->pattern, s, 0) == 0)
6323 free ((char *) cxx_sym);
6324 if (java_sym != sym)
6325 free ((char *) java_sym);
6329 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
6330 return a string pointing to the symbol name. */
6333 realsymbol (const char *pattern)
6336 bfd_boolean changed = FALSE, backslash = FALSE;
6337 char *s, *symbol = xmalloc (strlen (pattern) + 1);
6339 for (p = pattern, s = symbol; *p != '\0'; ++p)
6341 /* It is a glob pattern only if there is no preceding
6343 if (! backslash && (*p == '?' || *p == '*' || *p == '['))
6351 /* Remove the preceding backslash. */
6358 backslash = *p == '\\';
6373 /* This is called for each variable name or match expression. NEW is
6374 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
6375 pattern to be matched against symbol names. */
6377 struct bfd_elf_version_expr *
6378 lang_new_vers_pattern (struct bfd_elf_version_expr *orig,
6381 bfd_boolean literal_p)
6383 struct bfd_elf_version_expr *ret;
6385 ret = xmalloc (sizeof *ret);
6387 ret->pattern = literal_p ? NULL : new;
6390 ret->symbol = literal_p ? new : realsymbol (new);
6392 if (lang == NULL || strcasecmp (lang, "C") == 0)
6393 ret->mask = BFD_ELF_VERSION_C_TYPE;
6394 else if (strcasecmp (lang, "C++") == 0)
6395 ret->mask = BFD_ELF_VERSION_CXX_TYPE;
6396 else if (strcasecmp (lang, "Java") == 0)
6397 ret->mask = BFD_ELF_VERSION_JAVA_TYPE;
6400 einfo (_("%X%P: unknown language `%s' in version information\n"),
6402 ret->mask = BFD_ELF_VERSION_C_TYPE;
6405 return ldemul_new_vers_pattern (ret);
6408 /* This is called for each set of variable names and match
6411 struct bfd_elf_version_tree *
6412 lang_new_vers_node (struct bfd_elf_version_expr *globals,
6413 struct bfd_elf_version_expr *locals)
6415 struct bfd_elf_version_tree *ret;
6417 ret = xcalloc (1, sizeof *ret);
6418 ret->globals.list = globals;
6419 ret->locals.list = locals;
6420 ret->match = lang_vers_match;
6421 ret->name_indx = (unsigned int) -1;
6425 /* This static variable keeps track of version indices. */
6427 static int version_index;
6430 version_expr_head_hash (const void *p)
6432 const struct bfd_elf_version_expr *e = p;
6434 return htab_hash_string (e->symbol);
6438 version_expr_head_eq (const void *p1, const void *p2)
6440 const struct bfd_elf_version_expr *e1 = p1;
6441 const struct bfd_elf_version_expr *e2 = p2;
6443 return strcmp (e1->symbol, e2->symbol) == 0;
6447 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head *head)
6450 struct bfd_elf_version_expr *e, *next;
6451 struct bfd_elf_version_expr **list_loc, **remaining_loc;
6453 for (e = head->list; e; e = e->next)
6457 head->mask |= e->mask;
6462 head->htab = htab_create (count * 2, version_expr_head_hash,
6463 version_expr_head_eq, NULL);
6464 list_loc = &head->list;
6465 remaining_loc = &head->remaining;
6466 for (e = head->list; e; e = next)
6472 remaining_loc = &e->next;
6476 void **loc = htab_find_slot (head->htab, e, INSERT);
6480 struct bfd_elf_version_expr *e1, *last;
6486 if (e1->mask == e->mask)
6494 while (e1 && strcmp (e1->symbol, e->symbol) == 0);
6498 /* This is a duplicate. */
6499 /* FIXME: Memory leak. Sometimes pattern is not
6500 xmalloced alone, but in larger chunk of memory. */
6501 /* free (e->symbol); */
6506 e->next = last->next;
6514 list_loc = &e->next;
6518 *remaining_loc = NULL;
6519 *list_loc = head->remaining;
6522 head->remaining = head->list;
6525 /* This is called when we know the name and dependencies of the
6529 lang_register_vers_node (const char *name,
6530 struct bfd_elf_version_tree *version,
6531 struct bfd_elf_version_deps *deps)
6533 struct bfd_elf_version_tree *t, **pp;
6534 struct bfd_elf_version_expr *e1;
6539 if ((name[0] == '\0' && lang_elf_version_info != NULL)
6540 || (lang_elf_version_info && lang_elf_version_info->name[0] == '\0'))
6542 einfo (_("%X%P: anonymous version tag cannot be combined"
6543 " with other version tags\n"));
6548 /* Make sure this node has a unique name. */
6549 for (t = lang_elf_version_info; t != NULL; t = t->next)
6550 if (strcmp (t->name, name) == 0)
6551 einfo (_("%X%P: duplicate version tag `%s'\n"), name);
6553 lang_finalize_version_expr_head (&version->globals);
6554 lang_finalize_version_expr_head (&version->locals);
6556 /* Check the global and local match names, and make sure there
6557 aren't any duplicates. */
6559 for (e1 = version->globals.list; e1 != NULL; e1 = e1->next)
6561 for (t = lang_elf_version_info; t != NULL; t = t->next)
6563 struct bfd_elf_version_expr *e2;
6565 if (t->locals.htab && e1->symbol)
6567 e2 = htab_find (t->locals.htab, e1);
6568 while (e2 && strcmp (e1->symbol, e2->symbol) == 0)
6570 if (e1->mask == e2->mask)
6571 einfo (_("%X%P: duplicate expression `%s'"
6572 " in version information\n"), e1->symbol);
6576 else if (!e1->symbol)
6577 for (e2 = t->locals.remaining; e2 != NULL; e2 = e2->next)
6578 if (strcmp (e1->pattern, e2->pattern) == 0
6579 && e1->mask == e2->mask)
6580 einfo (_("%X%P: duplicate expression `%s'"
6581 " in version information\n"), e1->pattern);
6585 for (e1 = version->locals.list; e1 != NULL; e1 = e1->next)
6587 for (t = lang_elf_version_info; t != NULL; t = t->next)
6589 struct bfd_elf_version_expr *e2;
6591 if (t->globals.htab && e1->symbol)
6593 e2 = htab_find (t->globals.htab, e1);
6594 while (e2 && strcmp (e1->symbol, e2->symbol) == 0)
6596 if (e1->mask == e2->mask)
6597 einfo (_("%X%P: duplicate expression `%s'"
6598 " in version information\n"),
6603 else if (!e1->symbol)
6604 for (e2 = t->globals.remaining; e2 != NULL; e2 = e2->next)
6605 if (strcmp (e1->pattern, e2->pattern) == 0
6606 && e1->mask == e2->mask)
6607 einfo (_("%X%P: duplicate expression `%s'"
6608 " in version information\n"), e1->pattern);
6612 version->deps = deps;
6613 version->name = name;
6614 if (name[0] != '\0')
6617 version->vernum = version_index;
6620 version->vernum = 0;
6622 for (pp = &lang_elf_version_info; *pp != NULL; pp = &(*pp)->next)
6627 /* This is called when we see a version dependency. */
6629 struct bfd_elf_version_deps *
6630 lang_add_vers_depend (struct bfd_elf_version_deps *list, const char *name)
6632 struct bfd_elf_version_deps *ret;
6633 struct bfd_elf_version_tree *t;
6635 ret = xmalloc (sizeof *ret);
6638 for (t = lang_elf_version_info; t != NULL; t = t->next)
6640 if (strcmp (t->name, name) == 0)
6642 ret->version_needed = t;
6647 einfo (_("%X%P: unable to find version dependency `%s'\n"), name);
6653 lang_do_version_exports_section (void)
6655 struct bfd_elf_version_expr *greg = NULL, *lreg;
6657 LANG_FOR_EACH_INPUT_STATEMENT (is)
6659 asection *sec = bfd_get_section_by_name (is->the_bfd, ".exports");
6667 contents = xmalloc (len);
6668 if (!bfd_get_section_contents (is->the_bfd, sec, contents, 0, len))
6669 einfo (_("%X%P: unable to read .exports section contents\n"), sec);
6672 while (p < contents + len)
6674 greg = lang_new_vers_pattern (greg, p, NULL, FALSE);
6675 p = strchr (p, '\0') + 1;
6678 /* Do not free the contents, as we used them creating the regex. */
6680 /* Do not include this section in the link. */
6681 sec->flags |= SEC_EXCLUDE;
6684 lreg = lang_new_vers_pattern (NULL, "*", NULL, FALSE);
6685 lang_register_vers_node (command_line.version_exports_section,
6686 lang_new_vers_node (greg, lreg), NULL);
6690 lang_add_unique (const char *name)
6692 struct unique_sections *ent;
6694 for (ent = unique_section_list; ent; ent = ent->next)
6695 if (strcmp (ent->name, name) == 0)
6698 ent = xmalloc (sizeof *ent);
6699 ent->name = xstrdup (name);
6700 ent->next = unique_section_list;
6701 unique_section_list = ent;