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 os;
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,
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,
886 struct bfd_hash_table *table,
889 lang_output_section_statement_type **nextp;
890 struct output_statement_hash_entry *ret;
894 entry = bfd_hash_allocate (table, sizeof (*ret));
899 entry = bfd_hash_newfunc (entry, table, string);
903 ret = (struct output_statement_hash_entry *) entry;
904 memset (&ret->os, 0, sizeof (ret->os));
905 ret->os.header.type = lang_output_section_statement_enum;
906 ret->os.subsection_alignment = -1;
907 ret->os.section_alignment = -1;
908 ret->os.block_value = 1;
909 lang_list_init (&ret->os.children);
910 lang_statement_append (stat_ptr,
911 (lang_statement_union_type *) &ret->os,
912 &ret->os.header.next);
914 /* GCC's strict aliasing rules prevent us from just casting the
915 address, so we store the pointer in a variable and cast that
917 nextp = &ret->os.next;
918 lang_statement_append (&lang_output_section_statement,
919 (lang_statement_union_type *) &ret->os,
920 (lang_statement_union_type **) nextp);
925 output_statement_table_init (void)
927 if (! bfd_hash_table_init_n (&output_statement_table,
928 output_statement_newfunc, 61))
929 einfo (_("%P%F: can not create hash table: %E\n"));
933 output_statement_table_free (void)
935 bfd_hash_table_free (&output_statement_table);
938 /* Build enough state so that the parser can build its tree. */
943 obstack_begin (&stat_obstack, 1000);
945 stat_ptr = &statement_list;
947 output_statement_table_init ();
949 lang_list_init (stat_ptr);
951 lang_list_init (&input_file_chain);
952 lang_list_init (&lang_output_section_statement);
953 lang_list_init (&file_chain);
954 first_file = lang_add_input_file (NULL, lang_input_file_is_marker_enum,
957 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME);
959 abs_output_section->bfd_section = bfd_abs_section_ptr;
961 /* The value "3" is ad-hoc, somewhat related to the expected number of
962 DEFINED expressions in a linker script. For most default linker
963 scripts, there are none. Why a hash table then? Well, it's somewhat
964 simpler to re-use working machinery than using a linked list in terms
965 of code-complexity here in ld, besides the initialization which just
966 looks like other code here. */
967 if (!bfd_hash_table_init_n (&lang_definedness_table,
968 lang_definedness_newfunc, 3))
969 einfo (_("%P%F: can not create hash table: %E\n"));
975 output_statement_table_free ();
978 /*----------------------------------------------------------------------
979 A region is an area of memory declared with the
980 MEMORY { name:org=exp, len=exp ... }
983 We maintain a list of all the regions here.
985 If no regions are specified in the script, then the default is used
986 which is created when looked up to be the entire data space.
988 If create is true we are creating a region inside a MEMORY block.
989 In this case it is probably an error to create a region that has
990 already been created. If we are not inside a MEMORY block it is
991 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
992 and so we issue a warning. */
994 static lang_memory_region_type *lang_memory_region_list;
995 static lang_memory_region_type **lang_memory_region_list_tail
996 = &lang_memory_region_list;
998 lang_memory_region_type *
999 lang_memory_region_lookup (const char *const name, bfd_boolean create)
1001 lang_memory_region_type *p;
1002 lang_memory_region_type *new;
1004 /* NAME is NULL for LMA memspecs if no region was specified. */
1008 for (p = lang_memory_region_list; p != NULL; p = p->next)
1009 if (strcmp (p->name, name) == 0)
1012 einfo (_("%P:%S: warning: redeclaration of memory region '%s'\n"),
1017 if (!create && strcmp (name, DEFAULT_MEMORY_REGION))
1018 einfo (_("%P:%S: warning: memory region %s not declared\n"), name);
1020 new = stat_alloc (sizeof (lang_memory_region_type));
1022 new->name = xstrdup (name);
1025 *lang_memory_region_list_tail = new;
1026 lang_memory_region_list_tail = &new->next;
1030 new->length = ~(bfd_size_type) 0;
1032 new->had_full_message = FALSE;
1037 static lang_memory_region_type *
1038 lang_memory_default (asection *section)
1040 lang_memory_region_type *p;
1042 flagword sec_flags = section->flags;
1044 /* Override SEC_DATA to mean a writable section. */
1045 if ((sec_flags & (SEC_ALLOC | SEC_READONLY | SEC_CODE)) == SEC_ALLOC)
1046 sec_flags |= SEC_DATA;
1048 for (p = lang_memory_region_list; p != NULL; p = p->next)
1050 if ((p->flags & sec_flags) != 0
1051 && (p->not_flags & sec_flags) == 0)
1056 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION, FALSE);
1059 lang_output_section_statement_type *
1060 lang_output_section_find (const char *const name)
1062 struct output_statement_hash_entry *entry;
1065 entry = ((struct output_statement_hash_entry *)
1066 bfd_hash_lookup (&output_statement_table, name, FALSE, FALSE));
1070 hash = entry->root.hash;
1073 if (entry->os.constraint != -1)
1075 entry = (struct output_statement_hash_entry *) entry->root.next;
1077 while (entry != NULL
1078 && entry->root.hash == hash
1079 && strcmp (name, entry->os.name) == 0);
1084 static lang_output_section_statement_type *
1085 lang_output_section_statement_lookup_1 (const char *const name, int constraint)
1087 struct output_statement_hash_entry *entry;
1088 struct output_statement_hash_entry *last_ent;
1091 entry = ((struct output_statement_hash_entry *)
1092 bfd_hash_lookup (&output_statement_table, name, TRUE, FALSE));
1095 einfo (_("%P%F: failed creating section `%s': %E\n"), name);
1099 if (entry->os.name != NULL)
1101 /* We have a section of this name, but it might not have the correct
1103 hash = entry->root.hash;
1106 if (entry->os.constraint != -1
1108 || (constraint == entry->os.constraint
1109 && constraint != SPECIAL)))
1112 entry = (struct output_statement_hash_entry *) entry->root.next;
1114 while (entry != NULL
1115 && entry->root.hash == hash
1116 && strcmp (name, entry->os.name) == 0);
1118 entry = ((struct output_statement_hash_entry *)
1119 output_statement_newfunc (NULL, &output_statement_table, name));
1122 einfo (_("%P%F: failed creating section `%s': %E\n"), name);
1125 entry->root = last_ent->root;
1126 last_ent->root.next = &entry->root;
1129 entry->os.name = name;
1130 entry->os.constraint = constraint;
1134 lang_output_section_statement_type *
1135 lang_output_section_statement_lookup (const char *const name)
1137 return lang_output_section_statement_lookup_1 (name, 0);
1140 /* A variant of lang_output_section_find used by place_orphan.
1141 Returns the output statement that should precede a new output
1142 statement for SEC. If an exact match is found on certain flags,
1145 lang_output_section_statement_type *
1146 lang_output_section_find_by_flags (const asection *sec,
1147 lang_output_section_statement_type **exact)
1149 lang_output_section_statement_type *first, *look, *found;
1152 /* We know the first statement on this list is *ABS*. May as well
1154 first = &lang_output_section_statement.head->output_section_statement;
1155 first = first->next;
1157 /* First try for an exact match. */
1159 for (look = first; look; look = look->next)
1161 flags = look->flags;
1162 if (look->bfd_section != NULL)
1164 flags = look->bfd_section->flags;
1165 if (!bfd_match_sections_by_type (output_bfd,
1170 flags ^= sec->flags;
1171 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD | SEC_READONLY
1172 | SEC_CODE | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1181 if (sec->flags & SEC_CODE)
1183 /* Try for a rw code section. */
1184 for (look = first; look; look = look->next)
1186 flags = look->flags;
1187 if (look->bfd_section != NULL)
1189 flags = look->bfd_section->flags;
1190 if (!bfd_match_sections_by_type (output_bfd,
1195 flags ^= sec->flags;
1196 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1197 | SEC_CODE | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1203 if (sec->flags & (SEC_READONLY | SEC_THREAD_LOCAL))
1205 /* .rodata can go after .text, .sdata2 after .rodata. */
1206 for (look = first; look; look = look->next)
1208 flags = look->flags;
1209 if (look->bfd_section != NULL)
1211 flags = look->bfd_section->flags;
1212 if (!bfd_match_sections_by_type (output_bfd,
1217 flags ^= sec->flags;
1218 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1220 && !(look->flags & (SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1226 if (sec->flags & SEC_SMALL_DATA)
1228 /* .sdata goes after .data, .sbss after .sdata. */
1229 for (look = first; look; look = look->next)
1231 flags = look->flags;
1232 if (look->bfd_section != NULL)
1234 flags = look->bfd_section->flags;
1235 if (!bfd_match_sections_by_type (output_bfd,
1240 flags ^= sec->flags;
1241 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1242 | SEC_THREAD_LOCAL))
1243 || ((look->flags & SEC_SMALL_DATA)
1244 && !(sec->flags & SEC_HAS_CONTENTS)))
1250 if (sec->flags & SEC_HAS_CONTENTS)
1252 /* .data goes after .rodata. */
1253 for (look = first; look; look = look->next)
1255 flags = look->flags;
1256 if (look->bfd_section != NULL)
1258 flags = look->bfd_section->flags;
1259 if (!bfd_match_sections_by_type (output_bfd,
1264 flags ^= sec->flags;
1265 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1266 | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1272 /* .bss goes last. */
1273 for (look = first; look; look = look->next)
1275 flags = look->flags;
1276 if (look->bfd_section != NULL)
1278 flags = look->bfd_section->flags;
1279 if (!bfd_match_sections_by_type (output_bfd,
1284 flags ^= sec->flags;
1285 if (!(flags & SEC_ALLOC))
1292 /* Find the last output section before given output statement.
1293 Used by place_orphan. */
1296 output_prev_sec_find (lang_output_section_statement_type *os)
1298 asection *s = (asection *) NULL;
1299 lang_output_section_statement_type *lookup;
1301 for (lookup = &lang_output_section_statement.head->output_section_statement;
1303 lookup = lookup->next)
1305 if (lookup->constraint == -1)
1310 if (lookup->bfd_section != NULL && lookup->bfd_section->owner != NULL)
1311 s = lookup->bfd_section;
1317 lang_output_section_statement_type *
1318 lang_insert_orphan (lang_input_statement_type *file,
1320 const char *secname,
1321 lang_output_section_statement_type *after,
1322 struct orphan_save *place,
1323 etree_type *address,
1324 lang_statement_list_type *add_child)
1326 lang_statement_list_type *old;
1327 lang_statement_list_type add;
1329 etree_type *load_base;
1330 lang_output_section_statement_type *os;
1331 lang_output_section_statement_type **os_tail;
1333 /* Start building a list of statements for this section.
1334 First save the current statement pointer. */
1337 /* If we have found an appropriate place for the output section
1338 statements for this orphan, add them to our own private list,
1339 inserting them later into the global statement list. */
1343 lang_list_init (stat_ptr);
1347 if (config.build_constructors)
1349 /* If the name of the section is representable in C, then create
1350 symbols to mark the start and the end of the section. */
1351 for (ps = secname; *ps != '\0'; ps++)
1352 if (! ISALNUM ((unsigned char) *ps) && *ps != '_')
1357 etree_type *e_align;
1359 symname = (char *) xmalloc (ps - secname + sizeof "__start_" + 1);
1360 symname[0] = bfd_get_symbol_leading_char (output_bfd);
1361 sprintf (symname + (symname[0] != 0), "__start_%s", secname);
1362 e_align = exp_unop (ALIGN_K,
1363 exp_intop ((bfd_vma) 1 << s->alignment_power));
1364 lang_add_assignment (exp_assop ('=', ".", e_align));
1365 lang_add_assignment (exp_assop ('=', symname,
1366 exp_nameop (NAME, ".")));
1370 if (link_info.relocatable || (s->flags & (SEC_LOAD | SEC_ALLOC)) == 0)
1371 address = exp_intop (0);
1374 if (after != NULL && after->load_base != NULL)
1376 etree_type *lma_from_vma;
1377 lma_from_vma = exp_binop ('-', after->load_base,
1378 exp_nameop (ADDR, after->name));
1379 load_base = exp_binop ('+', lma_from_vma,
1380 exp_nameop (ADDR, secname));
1383 os_tail = ((lang_output_section_statement_type **)
1384 lang_output_section_statement.tail);
1385 os = lang_enter_output_section_statement (secname, address, 0, NULL, NULL,
1388 if (add_child == NULL)
1389 add_child = &os->children;
1390 lang_add_section (add_child, s, os, file);
1392 lang_leave_output_section_statement (0, "*default*", NULL, NULL);
1394 if (config.build_constructors && *ps == '\0')
1398 /* lang_leave_ouput_section_statement resets stat_ptr.
1399 Put stat_ptr back where we want it. */
1403 symname = (char *) xmalloc (ps - secname + sizeof "__stop_" + 1);
1404 symname[0] = bfd_get_symbol_leading_char (output_bfd);
1405 sprintf (symname + (symname[0] != 0), "__stop_%s", secname);
1406 lang_add_assignment (exp_assop ('=', symname,
1407 exp_nameop (NAME, ".")));
1410 /* Restore the global list pointer. */
1414 if (after != NULL && os->bfd_section != NULL)
1416 asection *snew, *as;
1418 snew = os->bfd_section;
1420 /* Shuffle the bfd section list to make the output file look
1421 neater. This is really only cosmetic. */
1422 if (place->section == NULL
1423 && after != (&lang_output_section_statement.head
1424 ->output_section_statement))
1426 asection *bfd_section = after->bfd_section;
1428 /* If the output statement hasn't been used to place any input
1429 sections (and thus doesn't have an output bfd_section),
1430 look for the closest prior output statement having an
1432 if (bfd_section == NULL)
1433 bfd_section = output_prev_sec_find (after);
1435 if (bfd_section != NULL && bfd_section != snew)
1436 place->section = &bfd_section->next;
1439 if (place->section == NULL)
1440 place->section = &output_bfd->sections;
1442 as = *place->section;
1443 if (as != snew && as->prev != snew)
1445 /* Unlink the section. */
1446 bfd_section_list_remove (output_bfd, snew);
1448 /* Now tack it back on in the right place. */
1449 bfd_section_list_insert_before (output_bfd, as, snew);
1452 /* Save the end of this list. Further ophans of this type will
1453 follow the one we've just added. */
1454 place->section = &snew->next;
1456 /* The following is non-cosmetic. We try to put the output
1457 statements in some sort of reasonable order here, because they
1458 determine the final load addresses of the orphan sections.
1459 In addition, placing output statements in the wrong order may
1460 require extra segments. For instance, given a typical
1461 situation of all read-only sections placed in one segment and
1462 following that a segment containing all the read-write
1463 sections, we wouldn't want to place an orphan read/write
1464 section before or amongst the read-only ones. */
1465 if (add.head != NULL)
1467 lang_output_section_statement_type *newly_added_os;
1469 if (place->stmt == NULL)
1471 lang_statement_union_type **where;
1472 lang_statement_union_type **assign = NULL;
1474 /* Look for a suitable place for the new statement list.
1475 The idea is to skip over anything that might be inside
1476 a SECTIONS {} statement in a script, before we find
1477 another output_section_statement. Assignments to "dot"
1478 before an output section statement are assumed to
1480 for (where = &after->header.next;
1482 where = &(*where)->header.next)
1484 switch ((*where)->header.type)
1486 case lang_assignment_statement_enum:
1489 lang_assignment_statement_type *ass;
1490 ass = &(*where)->assignment_statement;
1491 if (ass->exp->type.node_class != etree_assert
1492 && ass->exp->assign.dst[0] == '.'
1493 && ass->exp->assign.dst[1] == 0)
1497 case lang_wild_statement_enum:
1498 case lang_input_section_enum:
1499 case lang_object_symbols_statement_enum:
1500 case lang_fill_statement_enum:
1501 case lang_data_statement_enum:
1502 case lang_reloc_statement_enum:
1503 case lang_padding_statement_enum:
1504 case lang_constructors_statement_enum:
1507 case lang_output_section_statement_enum:
1510 case lang_input_statement_enum:
1511 case lang_address_statement_enum:
1512 case lang_target_statement_enum:
1513 case lang_output_statement_enum:
1514 case lang_group_statement_enum:
1515 case lang_afile_asection_pair_statement_enum:
1524 place->os_tail = &after->next;
1528 /* Put it after the last orphan statement we added. */
1529 *add.tail = *place->stmt;
1530 *place->stmt = add.head;
1533 /* Fix the global list pointer if we happened to tack our
1534 new list at the tail. */
1535 if (*old->tail == add.head)
1536 old->tail = add.tail;
1538 /* Save the end of this list. */
1539 place->stmt = add.tail;
1541 /* Do the same for the list of output section statements. */
1542 newly_added_os = *os_tail;
1544 newly_added_os->next = *place->os_tail;
1545 *place->os_tail = newly_added_os;
1546 place->os_tail = &newly_added_os->next;
1548 /* Fixing the global list pointer here is a little different.
1549 We added to the list in lang_enter_output_section_statement,
1550 trimmed off the new output_section_statment above when
1551 assigning *os_tail = NULL, but possibly added it back in
1552 the same place when assigning *place->os_tail. */
1553 if (*os_tail == NULL)
1554 lang_output_section_statement.tail
1555 = (lang_statement_union_type **) os_tail;
1562 lang_map_flags (flagword flag)
1564 if (flag & SEC_ALLOC)
1567 if (flag & SEC_CODE)
1570 if (flag & SEC_READONLY)
1573 if (flag & SEC_DATA)
1576 if (flag & SEC_LOAD)
1583 lang_memory_region_type *m;
1586 minfo (_("\nMemory Configuration\n\n"));
1587 fprintf (config.map_file, "%-16s %-18s %-18s %s\n",
1588 _("Name"), _("Origin"), _("Length"), _("Attributes"));
1590 for (m = lang_memory_region_list; m != NULL; m = m->next)
1595 fprintf (config.map_file, "%-16s ", m->name);
1597 sprintf_vma (buf, m->origin);
1598 minfo ("0x%s ", buf);
1606 minfo ("0x%V", m->length);
1607 if (m->flags || m->not_flags)
1615 lang_map_flags (m->flags);
1621 lang_map_flags (m->not_flags);
1628 fprintf (config.map_file, _("\nLinker script and memory map\n\n"));
1630 if (! command_line.reduce_memory_overheads)
1632 obstack_begin (&map_obstack, 1000);
1633 for (p = link_info.input_bfds; p != (bfd *) NULL; p = p->link_next)
1634 bfd_map_over_sections (p, init_map_userdata, 0);
1635 bfd_link_hash_traverse (link_info.hash, sort_def_symbol, 0);
1637 print_statements ();
1641 init_map_userdata (abfd, sec, data)
1642 bfd *abfd ATTRIBUTE_UNUSED;
1644 void *data ATTRIBUTE_UNUSED;
1646 fat_section_userdata_type *new_data
1647 = ((fat_section_userdata_type *) (stat_alloc
1648 (sizeof (fat_section_userdata_type))));
1650 ASSERT (get_userdata (sec) == NULL);
1651 get_userdata (sec) = new_data;
1652 new_data->map_symbol_def_tail = &new_data->map_symbol_def_head;
1656 sort_def_symbol (hash_entry, info)
1657 struct bfd_link_hash_entry *hash_entry;
1658 void *info ATTRIBUTE_UNUSED;
1660 if (hash_entry->type == bfd_link_hash_defined
1661 || hash_entry->type == bfd_link_hash_defweak)
1663 struct fat_user_section_struct *ud;
1664 struct map_symbol_def *def;
1666 ud = get_userdata (hash_entry->u.def.section);
1669 /* ??? What do we have to do to initialize this beforehand? */
1670 /* The first time we get here is bfd_abs_section... */
1671 init_map_userdata (0, hash_entry->u.def.section, 0);
1672 ud = get_userdata (hash_entry->u.def.section);
1674 else if (!ud->map_symbol_def_tail)
1675 ud->map_symbol_def_tail = &ud->map_symbol_def_head;
1677 def = obstack_alloc (&map_obstack, sizeof *def);
1678 def->entry = hash_entry;
1679 *(ud->map_symbol_def_tail) = def;
1680 ud->map_symbol_def_tail = &def->next;
1685 /* Initialize an output section. */
1688 init_os (lang_output_section_statement_type *s, asection *isec)
1690 if (s->bfd_section != NULL)
1693 if (strcmp (s->name, DISCARD_SECTION_NAME) == 0)
1694 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME);
1696 s->bfd_section = bfd_get_section_by_name (output_bfd, s->name);
1697 if (s->bfd_section == NULL)
1698 s->bfd_section = bfd_make_section (output_bfd, s->name);
1699 if (s->bfd_section == NULL)
1701 einfo (_("%P%F: output format %s cannot represent section called %s\n"),
1702 output_bfd->xvec->name, s->name);
1704 s->bfd_section->output_section = s->bfd_section;
1705 s->bfd_section->output_offset = 0;
1706 if (!command_line.reduce_memory_overheads)
1708 fat_section_userdata_type *new
1709 = stat_alloc (sizeof (fat_section_userdata_type));
1710 memset (new, 0, sizeof (fat_section_userdata_type));
1711 get_userdata (s->bfd_section) = new;
1715 /* If there is a base address, make sure that any sections it might
1716 mention are initialized. */
1717 if (s->addr_tree != NULL)
1718 exp_init_os (s->addr_tree);
1720 if (s->load_base != NULL)
1721 exp_init_os (s->load_base);
1723 /* If supplied an alignment, set it. */
1724 if (s->section_alignment != -1)
1725 s->bfd_section->alignment_power = s->section_alignment;
1728 bfd_init_private_section_data (isec->owner, isec,
1729 output_bfd, s->bfd_section,
1733 /* Make sure that all output sections mentioned in an expression are
1737 exp_init_os (etree_type *exp)
1739 switch (exp->type.node_class)
1743 exp_init_os (exp->assign.src);
1747 exp_init_os (exp->binary.lhs);
1748 exp_init_os (exp->binary.rhs);
1752 exp_init_os (exp->trinary.cond);
1753 exp_init_os (exp->trinary.lhs);
1754 exp_init_os (exp->trinary.rhs);
1758 exp_init_os (exp->assert_s.child);
1762 exp_init_os (exp->unary.child);
1766 switch (exp->type.node_code)
1772 lang_output_section_statement_type *os;
1774 os = lang_output_section_find (exp->name.name);
1775 if (os != NULL && os->bfd_section == NULL)
1787 section_already_linked (bfd *abfd, asection *sec, void *data)
1789 lang_input_statement_type *entry = data;
1791 /* If we are only reading symbols from this object, then we want to
1792 discard all sections. */
1793 if (entry->just_syms_flag)
1795 bfd_link_just_syms (abfd, sec, &link_info);
1799 if (!(abfd->flags & DYNAMIC))
1800 bfd_section_already_linked (abfd, sec);
1803 /* The wild routines.
1805 These expand statements like *(.text) and foo.o to a list of
1806 explicit actions, like foo.o(.text), bar.o(.text) and
1807 foo.o(.text, .data). */
1809 /* Add SECTION to the output section OUTPUT. Do this by creating a
1810 lang_input_section statement which is placed at PTR. FILE is the
1811 input file which holds SECTION. */
1814 lang_add_section (lang_statement_list_type *ptr,
1816 lang_output_section_statement_type *output,
1817 lang_input_statement_type *file)
1819 flagword flags = section->flags;
1820 bfd_boolean discard;
1822 /* Discard sections marked with SEC_EXCLUDE. */
1823 discard = (flags & SEC_EXCLUDE) != 0;
1825 /* Discard input sections which are assigned to a section named
1826 DISCARD_SECTION_NAME. */
1827 if (strcmp (output->name, DISCARD_SECTION_NAME) == 0)
1830 /* Discard debugging sections if we are stripping debugging
1832 if ((link_info.strip == strip_debugger || link_info.strip == strip_all)
1833 && (flags & SEC_DEBUGGING) != 0)
1838 if (section->output_section == NULL)
1840 /* This prevents future calls from assigning this section. */
1841 section->output_section = bfd_abs_section_ptr;
1846 if (section->output_section == NULL)
1849 lang_input_section_type *new;
1852 if (output->bfd_section == NULL)
1853 init_os (output, section);
1855 first = ! output->bfd_section->linker_has_input;
1856 output->bfd_section->linker_has_input = 1;
1858 if (!link_info.relocatable
1859 && !stripped_excluded_sections)
1861 asection *s = output->bfd_section->map_tail.s;
1862 output->bfd_section->map_tail.s = section;
1863 section->map_head.s = NULL;
1864 section->map_tail.s = s;
1866 s->map_head.s = section;
1868 output->bfd_section->map_head.s = section;
1871 /* Add a section reference to the list. */
1872 new = new_stat (lang_input_section, ptr);
1874 new->section = section;
1876 section->output_section = output->bfd_section;
1878 flags = section->flags;
1880 /* We don't copy the SEC_NEVER_LOAD flag from an input section
1881 to an output section, because we want to be able to include a
1882 SEC_NEVER_LOAD section in the middle of an otherwise loaded
1883 section (I don't know why we want to do this, but we do).
1884 build_link_order in ldwrite.c handles this case by turning
1885 the embedded SEC_NEVER_LOAD section into a fill. */
1887 flags &= ~ SEC_NEVER_LOAD;
1889 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
1890 already been processed. One reason to do this is that on pe
1891 format targets, .text$foo sections go into .text and it's odd
1892 to see .text with SEC_LINK_ONCE set. */
1894 if (! link_info.relocatable)
1895 flags &= ~ (SEC_LINK_ONCE | SEC_LINK_DUPLICATES);
1897 /* If this is not the first input section, and the SEC_READONLY
1898 flag is not currently set, then don't set it just because the
1899 input section has it set. */
1901 if (! first && (output->bfd_section->flags & SEC_READONLY) == 0)
1902 flags &= ~ SEC_READONLY;
1904 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
1906 && ((output->bfd_section->flags & (SEC_MERGE | SEC_STRINGS))
1907 != (flags & (SEC_MERGE | SEC_STRINGS))
1908 || ((flags & SEC_MERGE)
1909 && output->bfd_section->entsize != section->entsize)))
1911 output->bfd_section->flags &= ~ (SEC_MERGE | SEC_STRINGS);
1912 flags &= ~ (SEC_MERGE | SEC_STRINGS);
1915 output->bfd_section->flags |= flags;
1917 if (flags & SEC_MERGE)
1918 output->bfd_section->entsize = section->entsize;
1920 /* If SEC_READONLY is not set in the input section, then clear
1921 it from the output section. */
1922 if ((section->flags & SEC_READONLY) == 0)
1923 output->bfd_section->flags &= ~SEC_READONLY;
1925 switch (output->sectype)
1927 case normal_section:
1932 case overlay_section:
1933 output->bfd_section->flags &= ~SEC_ALLOC;
1935 case noload_section:
1936 output->bfd_section->flags &= ~SEC_LOAD;
1937 output->bfd_section->flags |= SEC_NEVER_LOAD;
1941 /* Copy over SEC_SMALL_DATA. */
1942 if (section->flags & SEC_SMALL_DATA)
1943 output->bfd_section->flags |= SEC_SMALL_DATA;
1945 if (section->alignment_power > output->bfd_section->alignment_power)
1946 output->bfd_section->alignment_power = section->alignment_power;
1948 if (bfd_get_arch (section->owner) == bfd_arch_tic54x
1949 && (section->flags & SEC_TIC54X_BLOCK) != 0)
1951 output->bfd_section->flags |= SEC_TIC54X_BLOCK;
1952 /* FIXME: This value should really be obtained from the bfd... */
1953 output->block_value = 128;
1958 /* Compare sections ASEC and BSEC according to SORT. */
1961 compare_section (sort_type sort, asection *asec, asection *bsec)
1970 case by_alignment_name:
1971 ret = (bfd_section_alignment (bsec->owner, bsec)
1972 - bfd_section_alignment (asec->owner, asec));
1978 ret = strcmp (bfd_get_section_name (asec->owner, asec),
1979 bfd_get_section_name (bsec->owner, bsec));
1982 case by_name_alignment:
1983 ret = strcmp (bfd_get_section_name (asec->owner, asec),
1984 bfd_get_section_name (bsec->owner, bsec));
1990 ret = (bfd_section_alignment (bsec->owner, bsec)
1991 - bfd_section_alignment (asec->owner, asec));
1998 /* Handle wildcard sorting. This returns the lang_input_section which
1999 should follow the one we are going to create for SECTION and FILE,
2000 based on the sorting requirements of WILD. It returns NULL if the
2001 new section should just go at the end of the current list. */
2003 static lang_statement_union_type *
2004 wild_sort (lang_wild_statement_type *wild,
2005 struct wildcard_list *sec,
2006 lang_input_statement_type *file,
2009 const char *section_name;
2010 lang_statement_union_type *l;
2012 if (!wild->filenames_sorted
2013 && (sec == NULL || sec->spec.sorted == none))
2016 section_name = bfd_get_section_name (file->the_bfd, section);
2017 for (l = wild->children.head; l != NULL; l = l->header.next)
2019 lang_input_section_type *ls;
2021 if (l->header.type != lang_input_section_enum)
2023 ls = &l->input_section;
2025 /* Sorting by filename takes precedence over sorting by section
2028 if (wild->filenames_sorted)
2030 const char *fn, *ln;
2034 /* The PE support for the .idata section as generated by
2035 dlltool assumes that files will be sorted by the name of
2036 the archive and then the name of the file within the
2039 if (file->the_bfd != NULL
2040 && bfd_my_archive (file->the_bfd) != NULL)
2042 fn = bfd_get_filename (bfd_my_archive (file->the_bfd));
2047 fn = file->filename;
2051 if (ls->ifile->the_bfd != NULL
2052 && bfd_my_archive (ls->ifile->the_bfd) != NULL)
2054 ln = bfd_get_filename (bfd_my_archive (ls->ifile->the_bfd));
2059 ln = ls->ifile->filename;
2063 i = strcmp (fn, ln);
2072 fn = file->filename;
2074 ln = ls->ifile->filename;
2076 i = strcmp (fn, ln);
2084 /* Here either the files are not sorted by name, or we are
2085 looking at the sections for this file. */
2087 if (sec != NULL && sec->spec.sorted != none)
2088 if (compare_section (sec->spec.sorted, section, ls->section) < 0)
2095 /* Expand a wild statement for a particular FILE. SECTION may be
2096 NULL, in which case it is a wild card. */
2099 output_section_callback (lang_wild_statement_type *ptr,
2100 struct wildcard_list *sec,
2102 lang_input_statement_type *file,
2105 lang_statement_union_type *before;
2107 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2108 if (unique_section_p (section))
2111 before = wild_sort (ptr, sec, file, section);
2113 /* Here BEFORE points to the lang_input_section which
2114 should follow the one we are about to add. If BEFORE
2115 is NULL, then the section should just go at the end
2116 of the current list. */
2119 lang_add_section (&ptr->children, section,
2120 (lang_output_section_statement_type *) output,
2124 lang_statement_list_type list;
2125 lang_statement_union_type **pp;
2127 lang_list_init (&list);
2128 lang_add_section (&list, section,
2129 (lang_output_section_statement_type *) output,
2132 /* If we are discarding the section, LIST.HEAD will
2134 if (list.head != NULL)
2136 ASSERT (list.head->header.next == NULL);
2138 for (pp = &ptr->children.head;
2140 pp = &(*pp)->header.next)
2141 ASSERT (*pp != NULL);
2143 list.head->header.next = *pp;
2149 /* Check if all sections in a wild statement for a particular FILE
2153 check_section_callback (lang_wild_statement_type *ptr ATTRIBUTE_UNUSED,
2154 struct wildcard_list *sec ATTRIBUTE_UNUSED,
2156 lang_input_statement_type *file ATTRIBUTE_UNUSED,
2159 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2160 if (unique_section_p (section))
2163 if (section->output_section == NULL && (section->flags & SEC_READONLY) == 0)
2164 ((lang_output_section_statement_type *) data)->all_input_readonly = FALSE;
2167 /* This is passed a file name which must have been seen already and
2168 added to the statement tree. We will see if it has been opened
2169 already and had its symbols read. If not then we'll read it. */
2171 static lang_input_statement_type *
2172 lookup_name (const char *name)
2174 lang_input_statement_type *search;
2176 for (search = (lang_input_statement_type *) input_file_chain.head;
2178 search = (lang_input_statement_type *) search->next_real_file)
2180 /* Use the local_sym_name as the name of the file that has
2181 already been loaded as filename might have been transformed
2182 via the search directory lookup mechanism. */
2183 const char * filename = search->local_sym_name;
2185 if (filename == NULL && name == NULL)
2187 if (filename != NULL
2189 && strcmp (filename, name) == 0)
2194 search = new_afile (name, lang_input_file_is_search_file_enum,
2195 default_target, FALSE);
2197 /* If we have already added this file, or this file is not real
2198 (FIXME: can that ever actually happen?) or the name is NULL
2199 (FIXME: can that ever actually happen?) don't add this file. */
2202 || search->filename == NULL)
2205 if (! load_symbols (search, NULL))
2211 /* Save LIST as a list of libraries whose symbols should not be exported. */
2216 struct excluded_lib *next;
2218 static struct excluded_lib *excluded_libs;
2221 add_excluded_libs (const char *list)
2223 const char *p = list, *end;
2227 struct excluded_lib *entry;
2228 end = strpbrk (p, ",:");
2230 end = p + strlen (p);
2231 entry = xmalloc (sizeof (*entry));
2232 entry->next = excluded_libs;
2233 entry->name = xmalloc (end - p + 1);
2234 memcpy (entry->name, p, end - p);
2235 entry->name[end - p] = '\0';
2236 excluded_libs = entry;
2244 check_excluded_libs (bfd *abfd)
2246 struct excluded_lib *lib = excluded_libs;
2250 int len = strlen (lib->name);
2251 const char *filename = lbasename (abfd->filename);
2253 if (strcmp (lib->name, "ALL") == 0)
2255 abfd->no_export = TRUE;
2259 if (strncmp (lib->name, filename, len) == 0
2260 && (filename[len] == '\0'
2261 || (filename[len] == '.' && filename[len + 1] == 'a'
2262 && filename[len + 2] == '\0')))
2264 abfd->no_export = TRUE;
2272 /* Get the symbols for an input file. */
2275 load_symbols (lang_input_statement_type *entry,
2276 lang_statement_list_type *place)
2283 ldfile_open_file (entry);
2285 if (! bfd_check_format (entry->the_bfd, bfd_archive)
2286 && ! bfd_check_format_matches (entry->the_bfd, bfd_object, &matching))
2289 lang_statement_list_type *hold;
2290 bfd_boolean bad_load = TRUE;
2291 bfd_boolean save_ldlang_sysrooted_script;
2293 err = bfd_get_error ();
2295 /* See if the emulation has some special knowledge. */
2296 if (ldemul_unrecognized_file (entry))
2299 if (err == bfd_error_file_ambiguously_recognized)
2303 einfo (_("%B: file not recognized: %E\n"), entry->the_bfd);
2304 einfo (_("%B: matching formats:"), entry->the_bfd);
2305 for (p = matching; *p != NULL; p++)
2309 else if (err != bfd_error_file_not_recognized
2311 einfo (_("%F%B: file not recognized: %E\n"), entry->the_bfd);
2315 bfd_close (entry->the_bfd);
2316 entry->the_bfd = NULL;
2318 /* Try to interpret the file as a linker script. */
2319 ldfile_open_command_file (entry->filename);
2323 save_ldlang_sysrooted_script = ldlang_sysrooted_script;
2324 ldlang_sysrooted_script = entry->sysrooted;
2326 ldfile_assumed_script = TRUE;
2327 parser_input = input_script;
2328 /* We want to use the same -Bdynamic/-Bstatic as the one for
2330 config.dynamic_link = entry->dynamic;
2332 ldfile_assumed_script = FALSE;
2334 ldlang_sysrooted_script = save_ldlang_sysrooted_script;
2340 if (ldemul_recognized_file (entry))
2343 /* We don't call ldlang_add_file for an archive. Instead, the
2344 add_symbols entry point will call ldlang_add_file, via the
2345 add_archive_element callback, for each element of the archive
2347 switch (bfd_get_format (entry->the_bfd))
2353 ldlang_add_file (entry);
2354 if (trace_files || trace_file_tries)
2355 info_msg ("%I\n", entry);
2359 check_excluded_libs (entry->the_bfd);
2361 if (entry->whole_archive)
2364 bfd_boolean loaded = TRUE;
2368 member = bfd_openr_next_archived_file (entry->the_bfd, member);
2373 if (! bfd_check_format (member, bfd_object))
2375 einfo (_("%F%B: member %B in archive is not an object\n"),
2376 entry->the_bfd, member);
2380 if (! ((*link_info.callbacks->add_archive_element)
2381 (&link_info, member, "--whole-archive")))
2384 if (! bfd_link_add_symbols (member, &link_info))
2386 einfo (_("%F%B: could not read symbols: %E\n"), member);
2391 entry->loaded = loaded;
2397 if (bfd_link_add_symbols (entry->the_bfd, &link_info))
2398 entry->loaded = TRUE;
2400 einfo (_("%F%B: could not read symbols: %E\n"), entry->the_bfd);
2402 return entry->loaded;
2405 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2406 may be NULL, indicating that it is a wildcard. Separate
2407 lang_input_section statements are created for each part of the
2408 expansion; they are added after the wild statement S. OUTPUT is
2409 the output section. */
2412 wild (lang_wild_statement_type *s,
2413 const char *target ATTRIBUTE_UNUSED,
2414 lang_output_section_statement_type *output)
2416 struct wildcard_list *sec;
2418 walk_wild (s, output_section_callback, output);
2420 for (sec = s->section_list; sec != NULL; sec = sec->next)
2422 if (default_common_section != NULL)
2424 if (sec->spec.name != NULL && strcmp (sec->spec.name, "COMMON") == 0)
2426 /* Remember the section that common is going to in case we
2427 later get something which doesn't know where to put it. */
2428 default_common_section = output;
2433 /* Return TRUE iff target is the sought target. */
2436 get_target (const bfd_target *target, void *data)
2438 const char *sought = data;
2440 return strcmp (target->name, sought) == 0;
2443 /* Like strcpy() but convert to lower case as well. */
2446 stricpy (char *dest, char *src)
2450 while ((c = *src++) != 0)
2451 *dest++ = TOLOWER (c);
2456 /* Remove the first occurrence of needle (if any) in haystack
2460 strcut (char *haystack, char *needle)
2462 haystack = strstr (haystack, needle);
2468 for (src = haystack + strlen (needle); *src;)
2469 *haystack++ = *src++;
2475 /* Compare two target format name strings.
2476 Return a value indicating how "similar" they are. */
2479 name_compare (char *first, char *second)
2485 copy1 = xmalloc (strlen (first) + 1);
2486 copy2 = xmalloc (strlen (second) + 1);
2488 /* Convert the names to lower case. */
2489 stricpy (copy1, first);
2490 stricpy (copy2, second);
2492 /* Remove size and endian strings from the name. */
2493 strcut (copy1, "big");
2494 strcut (copy1, "little");
2495 strcut (copy2, "big");
2496 strcut (copy2, "little");
2498 /* Return a value based on how many characters match,
2499 starting from the beginning. If both strings are
2500 the same then return 10 * their length. */
2501 for (result = 0; copy1[result] == copy2[result]; result++)
2502 if (copy1[result] == 0)
2514 /* Set by closest_target_match() below. */
2515 static const bfd_target *winner;
2517 /* Scan all the valid bfd targets looking for one that has the endianness
2518 requirement that was specified on the command line, and is the nearest
2519 match to the original output target. */
2522 closest_target_match (const bfd_target *target, void *data)
2524 const bfd_target *original = data;
2526 if (command_line.endian == ENDIAN_BIG
2527 && target->byteorder != BFD_ENDIAN_BIG)
2530 if (command_line.endian == ENDIAN_LITTLE
2531 && target->byteorder != BFD_ENDIAN_LITTLE)
2534 /* Must be the same flavour. */
2535 if (target->flavour != original->flavour)
2538 /* If we have not found a potential winner yet, then record this one. */
2545 /* Oh dear, we now have two potential candidates for a successful match.
2546 Compare their names and choose the better one. */
2547 if (name_compare (target->name, original->name)
2548 > name_compare (winner->name, original->name))
2551 /* Keep on searching until wqe have checked them all. */
2555 /* Return the BFD target format of the first input file. */
2558 get_first_input_target (void)
2560 char *target = NULL;
2562 LANG_FOR_EACH_INPUT_STATEMENT (s)
2564 if (s->header.type == lang_input_statement_enum
2567 ldfile_open_file (s);
2569 if (s->the_bfd != NULL
2570 && bfd_check_format (s->the_bfd, bfd_object))
2572 target = bfd_get_target (s->the_bfd);
2584 lang_get_output_target (void)
2588 /* Has the user told us which output format to use? */
2589 if (output_target != NULL)
2590 return output_target;
2592 /* No - has the current target been set to something other than
2594 if (current_target != default_target)
2595 return current_target;
2597 /* No - can we determine the format of the first input file? */
2598 target = get_first_input_target ();
2602 /* Failed - use the default output target. */
2603 return default_target;
2606 /* Open the output file. */
2609 open_output (const char *name)
2613 output_target = lang_get_output_target ();
2615 /* Has the user requested a particular endianness on the command
2617 if (command_line.endian != ENDIAN_UNSET)
2619 const bfd_target *target;
2620 enum bfd_endian desired_endian;
2622 /* Get the chosen target. */
2623 target = bfd_search_for_target (get_target, (void *) output_target);
2625 /* If the target is not supported, we cannot do anything. */
2628 if (command_line.endian == ENDIAN_BIG)
2629 desired_endian = BFD_ENDIAN_BIG;
2631 desired_endian = BFD_ENDIAN_LITTLE;
2633 /* See if the target has the wrong endianness. This should
2634 not happen if the linker script has provided big and
2635 little endian alternatives, but some scrips don't do
2637 if (target->byteorder != desired_endian)
2639 /* If it does, then see if the target provides
2640 an alternative with the correct endianness. */
2641 if (target->alternative_target != NULL
2642 && (target->alternative_target->byteorder == desired_endian))
2643 output_target = target->alternative_target->name;
2646 /* Try to find a target as similar as possible to
2647 the default target, but which has the desired
2648 endian characteristic. */
2649 bfd_search_for_target (closest_target_match,
2652 /* Oh dear - we could not find any targets that
2653 satisfy our requirements. */
2655 einfo (_("%P: warning: could not find any targets"
2656 " that match endianness requirement\n"));
2658 output_target = winner->name;
2664 output = bfd_openw (name, output_target);
2668 if (bfd_get_error () == bfd_error_invalid_target)
2669 einfo (_("%P%F: target %s not found\n"), output_target);
2671 einfo (_("%P%F: cannot open output file %s: %E\n"), name);
2674 delete_output_file_on_failure = TRUE;
2676 if (! bfd_set_format (output, bfd_object))
2677 einfo (_("%P%F:%s: can not make object file: %E\n"), name);
2678 if (! bfd_set_arch_mach (output,
2679 ldfile_output_architecture,
2680 ldfile_output_machine))
2681 einfo (_("%P%F:%s: can not set architecture: %E\n"), name);
2683 link_info.hash = bfd_link_hash_table_create (output);
2684 if (link_info.hash == NULL)
2685 einfo (_("%P%F: can not create hash table: %E\n"));
2687 bfd_set_gp_size (output, g_switch_value);
2692 ldlang_open_output (lang_statement_union_type *statement)
2694 switch (statement->header.type)
2696 case lang_output_statement_enum:
2697 ASSERT (output_bfd == NULL);
2698 output_bfd = open_output (statement->output_statement.name);
2699 ldemul_set_output_arch ();
2700 if (config.magic_demand_paged && !link_info.relocatable)
2701 output_bfd->flags |= D_PAGED;
2703 output_bfd->flags &= ~D_PAGED;
2704 if (config.text_read_only)
2705 output_bfd->flags |= WP_TEXT;
2707 output_bfd->flags &= ~WP_TEXT;
2708 if (link_info.traditional_format)
2709 output_bfd->flags |= BFD_TRADITIONAL_FORMAT;
2711 output_bfd->flags &= ~BFD_TRADITIONAL_FORMAT;
2714 case lang_target_statement_enum:
2715 current_target = statement->target_statement.target;
2722 /* Convert between addresses in bytes and sizes in octets.
2723 For currently supported targets, octets_per_byte is always a power
2724 of two, so we can use shifts. */
2725 #define TO_ADDR(X) ((X) >> opb_shift)
2726 #define TO_SIZE(X) ((X) << opb_shift)
2728 /* Support the above. */
2729 static unsigned int opb_shift = 0;
2734 unsigned x = bfd_arch_mach_octets_per_byte (ldfile_output_architecture,
2735 ldfile_output_machine);
2738 while ((x & 1) == 0)
2746 /* Open all the input files. */
2749 open_input_bfds (lang_statement_union_type *s, bfd_boolean force)
2751 for (; s != NULL; s = s->header.next)
2753 switch (s->header.type)
2755 case lang_constructors_statement_enum:
2756 open_input_bfds (constructor_list.head, force);
2758 case lang_output_section_statement_enum:
2759 open_input_bfds (s->output_section_statement.children.head, force);
2761 case lang_wild_statement_enum:
2762 /* Maybe we should load the file's symbols. */
2763 if (s->wild_statement.filename
2764 && ! wildcardp (s->wild_statement.filename))
2765 lookup_name (s->wild_statement.filename);
2766 open_input_bfds (s->wild_statement.children.head, force);
2768 case lang_group_statement_enum:
2770 struct bfd_link_hash_entry *undefs;
2772 /* We must continually search the entries in the group
2773 until no new symbols are added to the list of undefined
2778 undefs = link_info.hash->undefs_tail;
2779 open_input_bfds (s->group_statement.children.head, TRUE);
2781 while (undefs != link_info.hash->undefs_tail);
2784 case lang_target_statement_enum:
2785 current_target = s->target_statement.target;
2787 case lang_input_statement_enum:
2788 if (s->input_statement.real)
2790 lang_statement_list_type add;
2792 s->input_statement.target = current_target;
2794 /* If we are being called from within a group, and this
2795 is an archive which has already been searched, then
2796 force it to be researched unless the whole archive
2797 has been loaded already. */
2799 && !s->input_statement.whole_archive
2800 && s->input_statement.loaded
2801 && bfd_check_format (s->input_statement.the_bfd,
2803 s->input_statement.loaded = FALSE;
2805 lang_list_init (&add);
2807 if (! load_symbols (&s->input_statement, &add))
2808 config.make_executable = FALSE;
2810 if (add.head != NULL)
2812 *add.tail = s->header.next;
2813 s->header.next = add.head;
2823 /* Add a symbol to a hash of symbols used in DEFINED (NAME) expressions. */
2826 lang_track_definedness (const char *name)
2828 if (bfd_hash_lookup (&lang_definedness_table, name, TRUE, FALSE) == NULL)
2829 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name);
2832 /* New-function for the definedness hash table. */
2834 static struct bfd_hash_entry *
2835 lang_definedness_newfunc (struct bfd_hash_entry *entry,
2836 struct bfd_hash_table *table ATTRIBUTE_UNUSED,
2837 const char *name ATTRIBUTE_UNUSED)
2839 struct lang_definedness_hash_entry *ret
2840 = (struct lang_definedness_hash_entry *) entry;
2843 ret = (struct lang_definedness_hash_entry *)
2844 bfd_hash_allocate (table, sizeof (struct lang_definedness_hash_entry));
2847 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name);
2849 ret->iteration = -1;
2853 /* Return the iteration when the definition of NAME was last updated. A
2854 value of -1 means that the symbol is not defined in the linker script
2855 or the command line, but may be defined in the linker symbol table. */
2858 lang_symbol_definition_iteration (const char *name)
2860 struct lang_definedness_hash_entry *defentry
2861 = (struct lang_definedness_hash_entry *)
2862 bfd_hash_lookup (&lang_definedness_table, name, FALSE, FALSE);
2864 /* We've already created this one on the presence of DEFINED in the
2865 script, so it can't be NULL unless something is borked elsewhere in
2867 if (defentry == NULL)
2870 return defentry->iteration;
2873 /* Update the definedness state of NAME. */
2876 lang_update_definedness (const char *name, struct bfd_link_hash_entry *h)
2878 struct lang_definedness_hash_entry *defentry
2879 = (struct lang_definedness_hash_entry *)
2880 bfd_hash_lookup (&lang_definedness_table, name, FALSE, FALSE);
2882 /* We don't keep track of symbols not tested with DEFINED. */
2883 if (defentry == NULL)
2886 /* If the symbol was already defined, and not from an earlier statement
2887 iteration, don't update the definedness iteration, because that'd
2888 make the symbol seem defined in the linker script at this point, and
2889 it wasn't; it was defined in some object. If we do anyway, DEFINED
2890 would start to yield false before this point and the construct "sym =
2891 DEFINED (sym) ? sym : X;" would change sym to X despite being defined
2893 if (h->type != bfd_link_hash_undefined
2894 && h->type != bfd_link_hash_common
2895 && h->type != bfd_link_hash_new
2896 && defentry->iteration == -1)
2899 defentry->iteration = lang_statement_iteration;
2902 /* Add the supplied name to the symbol table as an undefined reference.
2903 This is a two step process as the symbol table doesn't even exist at
2904 the time the ld command line is processed. First we put the name
2905 on a list, then, once the output file has been opened, transfer the
2906 name to the symbol table. */
2908 typedef struct bfd_sym_chain ldlang_undef_chain_list_type;
2910 #define ldlang_undef_chain_list_head entry_symbol.next
2913 ldlang_add_undef (const char *const name)
2915 ldlang_undef_chain_list_type *new =
2916 stat_alloc (sizeof (ldlang_undef_chain_list_type));
2918 new->next = ldlang_undef_chain_list_head;
2919 ldlang_undef_chain_list_head = new;
2921 new->name = xstrdup (name);
2923 if (output_bfd != NULL)
2924 insert_undefined (new->name);
2927 /* Insert NAME as undefined in the symbol table. */
2930 insert_undefined (const char *name)
2932 struct bfd_link_hash_entry *h;
2934 h = bfd_link_hash_lookup (link_info.hash, name, TRUE, FALSE, TRUE);
2936 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
2937 if (h->type == bfd_link_hash_new)
2939 h->type = bfd_link_hash_undefined;
2940 h->u.undef.abfd = NULL;
2941 bfd_link_add_undef (link_info.hash, h);
2945 /* Run through the list of undefineds created above and place them
2946 into the linker hash table as undefined symbols belonging to the
2950 lang_place_undefineds (void)
2952 ldlang_undef_chain_list_type *ptr;
2954 for (ptr = ldlang_undef_chain_list_head; ptr != NULL; ptr = ptr->next)
2955 insert_undefined (ptr->name);
2958 /* Check for all readonly or some readwrite sections. */
2961 check_input_sections
2962 (lang_statement_union_type *s,
2963 lang_output_section_statement_type *output_section_statement)
2965 for (; s != (lang_statement_union_type *) NULL; s = s->header.next)
2967 switch (s->header.type)
2969 case lang_wild_statement_enum:
2970 walk_wild (&s->wild_statement, check_section_callback,
2971 output_section_statement);
2972 if (! output_section_statement->all_input_readonly)
2975 case lang_constructors_statement_enum:
2976 check_input_sections (constructor_list.head,
2977 output_section_statement);
2978 if (! output_section_statement->all_input_readonly)
2981 case lang_group_statement_enum:
2982 check_input_sections (s->group_statement.children.head,
2983 output_section_statement);
2984 if (! output_section_statement->all_input_readonly)
2993 /* Update wildcard statements if needed. */
2996 update_wild_statements (lang_statement_union_type *s)
2998 struct wildcard_list *sec;
3000 switch (sort_section)
3010 for (; s != NULL; s = s->header.next)
3012 switch (s->header.type)
3017 case lang_wild_statement_enum:
3018 sec = s->wild_statement.section_list;
3021 switch (sec->spec.sorted)
3024 sec->spec.sorted = sort_section;
3027 if (sort_section == by_alignment)
3028 sec->spec.sorted = by_name_alignment;
3031 if (sort_section == by_name)
3032 sec->spec.sorted = by_alignment_name;
3040 case lang_constructors_statement_enum:
3041 update_wild_statements (constructor_list.head);
3044 case lang_output_section_statement_enum:
3045 update_wild_statements
3046 (s->output_section_statement.children.head);
3049 case lang_group_statement_enum:
3050 update_wild_statements (s->group_statement.children.head);
3058 /* Open input files and attach to output sections. */
3061 map_input_to_output_sections
3062 (lang_statement_union_type *s, const char *target,
3063 lang_output_section_statement_type *os)
3065 for (; s != NULL; s = s->header.next)
3067 switch (s->header.type)
3069 case lang_wild_statement_enum:
3070 wild (&s->wild_statement, target, os);
3072 case lang_constructors_statement_enum:
3073 map_input_to_output_sections (constructor_list.head,
3077 case lang_output_section_statement_enum:
3078 if (s->output_section_statement.constraint)
3080 if (s->output_section_statement.constraint != ONLY_IF_RW
3081 && s->output_section_statement.constraint != ONLY_IF_RO)
3083 s->output_section_statement.all_input_readonly = TRUE;
3084 check_input_sections (s->output_section_statement.children.head,
3085 &s->output_section_statement);
3086 if ((s->output_section_statement.all_input_readonly
3087 && s->output_section_statement.constraint == ONLY_IF_RW)
3088 || (!s->output_section_statement.all_input_readonly
3089 && s->output_section_statement.constraint == ONLY_IF_RO))
3091 s->output_section_statement.constraint = -1;
3096 map_input_to_output_sections (s->output_section_statement.children.head,
3098 &s->output_section_statement);
3100 case lang_output_statement_enum:
3102 case lang_target_statement_enum:
3103 target = s->target_statement.target;
3105 case lang_group_statement_enum:
3106 map_input_to_output_sections (s->group_statement.children.head,
3110 case lang_data_statement_enum:
3111 /* Make sure that any sections mentioned in the expression
3113 exp_init_os (s->data_statement.exp);
3114 if (os != NULL && os->bfd_section == NULL)
3116 /* The output section gets contents, and then we inspect for
3117 any flags set in the input script which override any ALLOC. */
3118 os->bfd_section->flags |= SEC_HAS_CONTENTS;
3119 if (!(os->flags & SEC_NEVER_LOAD))
3120 os->bfd_section->flags |= SEC_ALLOC | SEC_LOAD;
3122 case lang_fill_statement_enum:
3123 case lang_input_section_enum:
3124 case lang_object_symbols_statement_enum:
3125 case lang_reloc_statement_enum:
3126 case lang_padding_statement_enum:
3127 case lang_input_statement_enum:
3128 if (os != NULL && os->bfd_section == NULL)
3131 case lang_assignment_statement_enum:
3132 if (os != NULL && os->bfd_section == NULL)
3135 /* Make sure that any sections mentioned in the assignment
3137 exp_init_os (s->assignment_statement.exp);
3139 case lang_afile_asection_pair_statement_enum:
3142 case lang_address_statement_enum:
3143 /* Mark the specified section with the supplied address.
3145 If this section was actually a segment marker, then the
3146 directive is ignored if the linker script explicitly
3147 processed the segment marker. Originally, the linker
3148 treated segment directives (like -Ttext on the
3149 command-line) as section directives. We honor the
3150 section directive semantics for backwards compatibilty;
3151 linker scripts that do not specifically check for
3152 SEGMENT_START automatically get the old semantics. */
3153 if (!s->address_statement.segment
3154 || !s->address_statement.segment->used)
3156 lang_output_section_statement_type *aos
3157 = (lang_output_section_statement_lookup
3158 (s->address_statement.section_name));
3160 if (aos->bfd_section == NULL)
3161 init_os (aos, NULL);
3162 aos->addr_tree = s->address_statement.address;
3169 /* An output section might have been removed after its statement was
3170 added. For example, ldemul_before_allocation can remove dynamic
3171 sections if they turn out to be not needed. Clean them up here. */
3174 strip_excluded_output_sections (void)
3176 lang_output_section_statement_type *os;
3178 /* Run lang_size_sections (if not already done). */
3179 if (expld.phase != lang_mark_phase_enum)
3181 expld.phase = lang_mark_phase_enum;
3182 expld.dataseg.phase = exp_dataseg_none;
3183 one_lang_size_sections_pass (NULL, FALSE);
3184 lang_reset_memory_regions ();
3187 for (os = &lang_output_section_statement.head->output_section_statement;
3191 asection *output_section;
3192 bfd_boolean exclude;
3194 if (os->constraint == -1)
3197 output_section = os->bfd_section;
3198 if (output_section == NULL)
3201 exclude = (output_section->rawsize == 0
3202 && (output_section->flags & SEC_KEEP) == 0
3203 && !bfd_section_removed_from_list (output_bfd,
3206 /* Some sections have not yet been sized, notably .gnu.version,
3207 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3208 input sections, so don't drop output sections that have such
3209 input sections unless they are also marked SEC_EXCLUDE. */
3210 if (exclude && output_section->map_head.s != NULL)
3214 for (s = output_section->map_head.s; s != NULL; s = s->map_head.s)
3215 if ((s->flags & SEC_LINKER_CREATED) != 0
3216 && (s->flags & SEC_EXCLUDE) == 0)
3223 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3224 output_section->map_head.link_order = NULL;
3225 output_section->map_tail.link_order = NULL;
3229 /* We don't set bfd_section to NULL since bfd_section of the
3230 removed output section statement may still be used. */
3232 output_section->flags |= SEC_EXCLUDE;
3233 bfd_section_list_remove (output_bfd, output_section);
3234 output_bfd->section_count--;
3238 /* Stop future calls to lang_add_section from messing with map_head
3239 and map_tail link_order fields. */
3240 stripped_excluded_sections = TRUE;
3244 print_output_section_statement
3245 (lang_output_section_statement_type *output_section_statement)
3247 asection *section = output_section_statement->bfd_section;
3250 if (output_section_statement != abs_output_section)
3252 minfo ("\n%s", output_section_statement->name);
3254 if (section != NULL)
3256 print_dot = section->vma;
3258 len = strlen (output_section_statement->name);
3259 if (len >= SECTION_NAME_MAP_LENGTH - 1)
3264 while (len < SECTION_NAME_MAP_LENGTH)
3270 minfo ("0x%V %W", section->vma, section->size);
3272 if (output_section_statement->load_base != NULL)
3276 addr = exp_get_abs_int (output_section_statement->load_base, 0,
3278 minfo (_(" load address 0x%V"), addr);
3285 print_statement_list (output_section_statement->children.head,
3286 output_section_statement);
3289 /* Scan for the use of the destination in the right hand side
3290 of an expression. In such cases we will not compute the
3291 correct expression, since the value of DST that is used on
3292 the right hand side will be its final value, not its value
3293 just before this expression is evaluated. */
3296 scan_for_self_assignment (const char * dst, etree_type * rhs)
3298 if (rhs == NULL || dst == NULL)
3301 switch (rhs->type.node_class)
3304 return scan_for_self_assignment (dst, rhs->binary.lhs)
3305 || scan_for_self_assignment (dst, rhs->binary.rhs);
3308 return scan_for_self_assignment (dst, rhs->trinary.lhs)
3309 || scan_for_self_assignment (dst, rhs->trinary.rhs);
3312 case etree_provided:
3314 if (strcmp (dst, rhs->assign.dst) == 0)
3316 return scan_for_self_assignment (dst, rhs->assign.src);
3319 return scan_for_self_assignment (dst, rhs->unary.child);
3323 return strcmp (dst, rhs->value.str) == 0;
3328 return strcmp (dst, rhs->name.name) == 0;
3340 print_assignment (lang_assignment_statement_type *assignment,
3341 lang_output_section_statement_type *output_section)
3345 bfd_boolean computation_is_valid = TRUE;
3348 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
3351 if (assignment->exp->type.node_class == etree_assert)
3354 tree = assignment->exp->assert_s.child;
3355 computation_is_valid = TRUE;
3359 const char *dst = assignment->exp->assign.dst;
3361 is_dot = (dst[0] == '.' && dst[1] == 0);
3362 tree = assignment->exp->assign.src;
3363 computation_is_valid = is_dot || (scan_for_self_assignment (dst, tree) == FALSE);
3366 exp_fold_tree (tree, output_section->bfd_section, &print_dot);
3367 if (expld.result.valid_p)
3371 if (computation_is_valid)
3373 value = expld.result.value;
3375 if (expld.result.section)
3376 value += expld.result.section->vma;
3378 minfo ("0x%V", value);
3384 struct bfd_link_hash_entry *h;
3386 h = bfd_link_hash_lookup (link_info.hash, assignment->exp->assign.dst,
3387 FALSE, FALSE, TRUE);
3390 value = h->u.def.value;
3392 if (expld.result.section)
3393 value += expld.result.section->vma;
3395 minfo ("[0x%V]", value);
3398 minfo ("[unresolved]");
3410 exp_print_tree (assignment->exp);
3415 print_input_statement (lang_input_statement_type *statm)
3417 if (statm->filename != NULL)
3419 fprintf (config.map_file, "LOAD %s\n", statm->filename);
3423 /* Print all symbols defined in a particular section. This is called
3424 via bfd_link_hash_traverse, or by print_all_symbols. */
3427 print_one_symbol (struct bfd_link_hash_entry *hash_entry, void *ptr)
3429 asection *sec = ptr;
3431 if ((hash_entry->type == bfd_link_hash_defined
3432 || hash_entry->type == bfd_link_hash_defweak)
3433 && sec == hash_entry->u.def.section)
3437 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
3440 (hash_entry->u.def.value
3441 + hash_entry->u.def.section->output_offset
3442 + hash_entry->u.def.section->output_section->vma));
3444 minfo (" %T\n", hash_entry->root.string);
3451 print_all_symbols (sec)
3454 struct fat_user_section_struct *ud = get_userdata (sec);
3455 struct map_symbol_def *def;
3460 *ud->map_symbol_def_tail = 0;
3461 for (def = ud->map_symbol_def_head; def; def = def->next)
3462 print_one_symbol (def->entry, sec);
3465 /* Print information about an input section to the map file. */
3468 print_input_section (lang_input_section_type *in)
3470 asection *i = in->section;
3471 bfd_size_type size = i->size;
3480 minfo ("%s", i->name);
3482 len = 1 + strlen (i->name);
3483 if (len >= SECTION_NAME_MAP_LENGTH - 1)
3488 while (len < SECTION_NAME_MAP_LENGTH)
3494 if (i->output_section != NULL && (i->flags & SEC_EXCLUDE) == 0)
3495 addr = i->output_section->vma + i->output_offset;
3502 minfo ("0x%V %W %B\n", addr, TO_ADDR (size), i->owner);
3504 if (size != i->rawsize && i->rawsize != 0)
3506 len = SECTION_NAME_MAP_LENGTH + 3;
3518 minfo (_("%W (size before relaxing)\n"), i->rawsize);
3521 if (i->output_section != NULL && (i->flags & SEC_EXCLUDE) == 0)
3523 if (command_line.reduce_memory_overheads)
3524 bfd_link_hash_traverse (link_info.hash, print_one_symbol, i);
3526 print_all_symbols (i);
3528 print_dot = addr + TO_ADDR (size);
3534 print_fill_statement (lang_fill_statement_type *fill)
3538 fputs (" FILL mask 0x", config.map_file);
3539 for (p = fill->fill->data, size = fill->fill->size; size != 0; p++, size--)
3540 fprintf (config.map_file, "%02x", *p);
3541 fputs ("\n", config.map_file);
3545 print_data_statement (lang_data_statement_type *data)
3553 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
3556 addr = data->output_offset;
3557 if (data->output_section != NULL)
3558 addr += data->output_section->vma;
3586 minfo ("0x%V %W %s 0x%v", addr, size, name, data->value);
3588 if (data->exp->type.node_class != etree_value)
3591 exp_print_tree (data->exp);
3596 print_dot = addr + TO_ADDR (size);
3599 /* Print an address statement. These are generated by options like
3603 print_address_statement (lang_address_statement_type *address)
3605 minfo (_("Address of section %s set to "), address->section_name);
3606 exp_print_tree (address->address);
3610 /* Print a reloc statement. */
3613 print_reloc_statement (lang_reloc_statement_type *reloc)
3620 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
3623 addr = reloc->output_offset;
3624 if (reloc->output_section != NULL)
3625 addr += reloc->output_section->vma;
3627 size = bfd_get_reloc_size (reloc->howto);
3629 minfo ("0x%V %W RELOC %s ", addr, size, reloc->howto->name);
3631 if (reloc->name != NULL)
3632 minfo ("%s+", reloc->name);
3634 minfo ("%s+", reloc->section->name);
3636 exp_print_tree (reloc->addend_exp);
3640 print_dot = addr + TO_ADDR (size);
3644 print_padding_statement (lang_padding_statement_type *s)
3652 len = sizeof " *fill*" - 1;
3653 while (len < SECTION_NAME_MAP_LENGTH)
3659 addr = s->output_offset;
3660 if (s->output_section != NULL)
3661 addr += s->output_section->vma;
3662 minfo ("0x%V %W ", addr, (bfd_vma) s->size);
3664 if (s->fill->size != 0)
3668 for (p = s->fill->data, size = s->fill->size; size != 0; p++, size--)
3669 fprintf (config.map_file, "%02x", *p);
3674 print_dot = addr + TO_ADDR (s->size);
3678 print_wild_statement (lang_wild_statement_type *w,
3679 lang_output_section_statement_type *os)
3681 struct wildcard_list *sec;
3685 if (w->filenames_sorted)
3687 if (w->filename != NULL)
3688 minfo ("%s", w->filename);
3691 if (w->filenames_sorted)
3695 for (sec = w->section_list; sec; sec = sec->next)
3697 if (sec->spec.sorted)
3699 if (sec->spec.exclude_name_list != NULL)
3702 minfo ("EXCLUDE_FILE(%s", sec->spec.exclude_name_list->name);
3703 for (tmp = sec->spec.exclude_name_list->next; tmp; tmp = tmp->next)
3704 minfo (" %s", tmp->name);
3707 if (sec->spec.name != NULL)
3708 minfo ("%s", sec->spec.name);
3711 if (sec->spec.sorted)
3720 print_statement_list (w->children.head, os);
3723 /* Print a group statement. */
3726 print_group (lang_group_statement_type *s,
3727 lang_output_section_statement_type *os)
3729 fprintf (config.map_file, "START GROUP\n");
3730 print_statement_list (s->children.head, os);
3731 fprintf (config.map_file, "END GROUP\n");
3734 /* Print the list of statements in S.
3735 This can be called for any statement type. */
3738 print_statement_list (lang_statement_union_type *s,
3739 lang_output_section_statement_type *os)
3743 print_statement (s, os);
3748 /* Print the first statement in statement list S.
3749 This can be called for any statement type. */
3752 print_statement (lang_statement_union_type *s,
3753 lang_output_section_statement_type *os)
3755 switch (s->header.type)
3758 fprintf (config.map_file, _("Fail with %d\n"), s->header.type);
3761 case lang_constructors_statement_enum:
3762 if (constructor_list.head != NULL)
3764 if (constructors_sorted)
3765 minfo (" SORT (CONSTRUCTORS)\n");
3767 minfo (" CONSTRUCTORS\n");
3768 print_statement_list (constructor_list.head, os);
3771 case lang_wild_statement_enum:
3772 print_wild_statement (&s->wild_statement, os);
3774 case lang_address_statement_enum:
3775 print_address_statement (&s->address_statement);
3777 case lang_object_symbols_statement_enum:
3778 minfo (" CREATE_OBJECT_SYMBOLS\n");
3780 case lang_fill_statement_enum:
3781 print_fill_statement (&s->fill_statement);
3783 case lang_data_statement_enum:
3784 print_data_statement (&s->data_statement);
3786 case lang_reloc_statement_enum:
3787 print_reloc_statement (&s->reloc_statement);
3789 case lang_input_section_enum:
3790 print_input_section (&s->input_section);
3792 case lang_padding_statement_enum:
3793 print_padding_statement (&s->padding_statement);
3795 case lang_output_section_statement_enum:
3796 print_output_section_statement (&s->output_section_statement);
3798 case lang_assignment_statement_enum:
3799 print_assignment (&s->assignment_statement, os);
3801 case lang_target_statement_enum:
3802 fprintf (config.map_file, "TARGET(%s)\n", s->target_statement.target);
3804 case lang_output_statement_enum:
3805 minfo ("OUTPUT(%s", s->output_statement.name);
3806 if (output_target != NULL)
3807 minfo (" %s", output_target);
3810 case lang_input_statement_enum:
3811 print_input_statement (&s->input_statement);
3813 case lang_group_statement_enum:
3814 print_group (&s->group_statement, os);
3816 case lang_afile_asection_pair_statement_enum:
3823 print_statements (void)
3825 print_statement_list (statement_list.head, abs_output_section);
3828 /* Print the first N statements in statement list S to STDERR.
3829 If N == 0, nothing is printed.
3830 If N < 0, the entire list is printed.
3831 Intended to be called from GDB. */
3834 dprint_statement (lang_statement_union_type *s, int n)
3836 FILE *map_save = config.map_file;
3838 config.map_file = stderr;
3841 print_statement_list (s, abs_output_section);
3844 while (s && --n >= 0)
3846 print_statement (s, abs_output_section);
3851 config.map_file = map_save;
3855 insert_pad (lang_statement_union_type **ptr,
3857 unsigned int alignment_needed,
3858 asection *output_section,
3861 static fill_type zero_fill = { 1, { 0 } };
3862 lang_statement_union_type *pad = NULL;
3864 if (ptr != &statement_list.head)
3865 pad = ((lang_statement_union_type *)
3866 ((char *) ptr - offsetof (lang_statement_union_type, header.next)));
3868 && pad->header.type == lang_padding_statement_enum
3869 && pad->padding_statement.output_section == output_section)
3871 /* Use the existing pad statement. */
3873 else if ((pad = *ptr) != NULL
3874 && pad->header.type == lang_padding_statement_enum
3875 && pad->padding_statement.output_section == output_section)
3877 /* Use the existing pad statement. */
3881 /* Make a new padding statement, linked into existing chain. */
3882 pad = stat_alloc (sizeof (lang_padding_statement_type));
3883 pad->header.next = *ptr;
3885 pad->header.type = lang_padding_statement_enum;
3886 pad->padding_statement.output_section = output_section;
3889 pad->padding_statement.fill = fill;
3891 pad->padding_statement.output_offset = dot - output_section->vma;
3892 pad->padding_statement.size = alignment_needed;
3893 output_section->size += alignment_needed;
3896 /* Work out how much this section will move the dot point. */
3900 (lang_statement_union_type **this_ptr,
3901 lang_output_section_statement_type *output_section_statement,
3905 lang_input_section_type *is = &((*this_ptr)->input_section);
3906 asection *i = is->section;
3908 if (!is->ifile->just_syms_flag && (i->flags & SEC_EXCLUDE) == 0)
3910 unsigned int alignment_needed;
3913 /* Align this section first to the input sections requirement,
3914 then to the output section's requirement. If this alignment
3915 is greater than any seen before, then record it too. Perform
3916 the alignment by inserting a magic 'padding' statement. */
3918 if (output_section_statement->subsection_alignment != -1)
3919 i->alignment_power = output_section_statement->subsection_alignment;
3921 o = output_section_statement->bfd_section;
3922 if (o->alignment_power < i->alignment_power)
3923 o->alignment_power = i->alignment_power;
3925 alignment_needed = align_power (dot, i->alignment_power) - dot;
3927 if (alignment_needed != 0)
3929 insert_pad (this_ptr, fill, TO_SIZE (alignment_needed), o, dot);
3930 dot += alignment_needed;
3933 /* Remember where in the output section this input section goes. */
3935 i->output_offset = dot - o->vma;
3937 /* Mark how big the output section must be to contain this now. */
3938 dot += TO_ADDR (i->size);
3939 o->size = TO_SIZE (dot - o->vma);
3943 i->output_offset = i->vma - output_section_statement->bfd_section->vma;
3950 sort_sections_by_lma (const void *arg1, const void *arg2)
3952 const asection *sec1 = *(const asection **) arg1;
3953 const asection *sec2 = *(const asection **) arg2;
3955 if (bfd_section_lma (sec1->owner, sec1)
3956 < bfd_section_lma (sec2->owner, sec2))
3958 else if (bfd_section_lma (sec1->owner, sec1)
3959 > bfd_section_lma (sec2->owner, sec2))
3965 #define IGNORE_SECTION(s) \
3966 ((s->flags & SEC_NEVER_LOAD) != 0 \
3967 || (s->flags & SEC_ALLOC) == 0 \
3968 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
3969 && (s->flags & SEC_LOAD) == 0))
3971 /* Check to see if any allocated sections overlap with other allocated
3972 sections. This can happen if a linker script specifies the output
3973 section addresses of the two sections. */
3976 lang_check_section_addresses (void)
3979 asection **sections, **spp;
3987 if (bfd_count_sections (output_bfd) <= 1)
3990 amt = bfd_count_sections (output_bfd) * sizeof (asection *);
3991 sections = xmalloc (amt);
3993 /* Scan all sections in the output list. */
3995 for (s = output_bfd->sections; s != NULL; s = s->next)
3997 /* Only consider loadable sections with real contents. */
3998 if (IGNORE_SECTION (s) || s->size == 0)
4001 sections[count] = s;
4008 qsort (sections, (size_t) count, sizeof (asection *),
4009 sort_sections_by_lma);
4013 s_start = bfd_section_lma (output_bfd, s);
4014 s_end = s_start + TO_ADDR (s->size) - 1;
4015 for (count--; count; count--)
4017 /* We must check the sections' LMA addresses not their VMA
4018 addresses because overlay sections can have overlapping VMAs
4019 but they must have distinct LMAs. */
4024 s_start = bfd_section_lma (output_bfd, s);
4025 s_end = s_start + TO_ADDR (s->size) - 1;
4027 /* Look for an overlap. */
4028 if (s_end >= os_start && s_start <= os_end)
4029 einfo (_("%X%P: section %s [%V -> %V] overlaps section %s [%V -> %V]\n"),
4030 s->name, s_start, s_end, os->name, os_start, os_end);
4036 /* Make sure the new address is within the region. We explicitly permit the
4037 current address to be at the exact end of the region when the address is
4038 non-zero, in case the region is at the end of addressable memory and the
4039 calculation wraps around. */
4042 os_region_check (lang_output_section_statement_type *os,
4043 lang_memory_region_type *region,
4047 if ((region->current < region->origin
4048 || (region->current - region->origin > region->length))
4049 && ((region->current != region->origin + region->length)
4054 einfo (_("%X%P: address 0x%v of %B section %s"
4055 " is not within region %s\n"),
4057 os->bfd_section->owner,
4058 os->bfd_section->name,
4063 einfo (_("%X%P: region %s is full (%B section %s)\n"),
4065 os->bfd_section->owner,
4066 os->bfd_section->name);
4068 /* Reset the region pointer. */
4069 region->current = region->origin;
4073 /* Set the sizes for all the output sections. */
4076 lang_size_sections_1
4077 (lang_statement_union_type *s,
4078 lang_output_section_statement_type *output_section_statement,
4079 lang_statement_union_type **prev,
4083 bfd_boolean check_regions)
4085 /* Size up the sections from their constituent parts. */
4086 for (; s != NULL; s = s->header.next)
4088 switch (s->header.type)
4090 case lang_output_section_statement_enum:
4092 bfd_vma newdot, after;
4093 lang_output_section_statement_type *os;
4095 os = &s->output_section_statement;
4096 if (os->addr_tree != NULL)
4098 os->processed = FALSE;
4099 exp_fold_tree (os->addr_tree, bfd_abs_section_ptr, &dot);
4101 if (!expld.result.valid_p
4102 && expld.phase != lang_mark_phase_enum)
4103 einfo (_("%F%S: non constant or forward reference"
4104 " address expression for section %s\n"),
4107 dot = expld.result.value + expld.result.section->vma;
4110 if (os->bfd_section == NULL)
4111 /* This section was removed or never actually created. */
4114 /* If this is a COFF shared library section, use the size and
4115 address from the input section. FIXME: This is COFF
4116 specific; it would be cleaner if there were some other way
4117 to do this, but nothing simple comes to mind. */
4118 if ((bfd_get_flavour (output_bfd) == bfd_target_ecoff_flavour
4119 || bfd_get_flavour (output_bfd) == bfd_target_coff_flavour)
4120 && (os->bfd_section->flags & SEC_COFF_SHARED_LIBRARY) != 0)
4124 if (os->children.head == NULL
4125 || os->children.head->header.next != NULL
4126 || (os->children.head->header.type
4127 != lang_input_section_enum))
4128 einfo (_("%P%X: Internal error on COFF shared library"
4129 " section %s\n"), os->name);
4131 input = os->children.head->input_section.section;
4132 bfd_set_section_vma (os->bfd_section->owner,
4134 bfd_section_vma (input->owner, input));
4135 os->bfd_section->size = input->size;
4140 if (bfd_is_abs_section (os->bfd_section))
4142 /* No matter what happens, an abs section starts at zero. */
4143 ASSERT (os->bfd_section->vma == 0);
4149 if (os->addr_tree == NULL)
4151 /* No address specified for this section, get one
4152 from the region specification. */
4153 if (os->region == NULL
4154 || ((os->bfd_section->flags & (SEC_ALLOC | SEC_LOAD))
4155 && os->region->name[0] == '*'
4156 && strcmp (os->region->name,
4157 DEFAULT_MEMORY_REGION) == 0))
4159 os->region = lang_memory_default (os->bfd_section);
4162 /* If a loadable section is using the default memory
4163 region, and some non default memory regions were
4164 defined, issue an error message. */
4165 if (!IGNORE_SECTION (os->bfd_section)
4166 && ! link_info.relocatable
4168 && strcmp (os->region->name,
4169 DEFAULT_MEMORY_REGION) == 0
4170 && lang_memory_region_list != NULL
4171 && (strcmp (lang_memory_region_list->name,
4172 DEFAULT_MEMORY_REGION) != 0
4173 || lang_memory_region_list->next != NULL)
4174 && expld.phase != lang_mark_phase_enum)
4176 /* By default this is an error rather than just a
4177 warning because if we allocate the section to the
4178 default memory region we can end up creating an
4179 excessively large binary, or even seg faulting when
4180 attempting to perform a negative seek. See
4181 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4182 for an example of this. This behaviour can be
4183 overridden by the using the --no-check-sections
4185 if (command_line.check_section_addresses)
4186 einfo (_("%P%F: error: no memory region specified"
4187 " for loadable section `%s'\n"),
4188 bfd_get_section_name (output_bfd,
4191 einfo (_("%P: warning: no memory region specified"
4192 " for loadable section `%s'\n"),
4193 bfd_get_section_name (output_bfd,
4197 newdot = os->region->current;
4200 /* Align to what the section needs. */
4202 newdot = align_power (newdot,
4203 os->bfd_section->alignment_power);
4205 if (newdot != savedot
4206 && (config.warn_section_align
4207 || os->addr_tree != NULL)
4208 && expld.phase != lang_mark_phase_enum)
4209 einfo (_("%P: warning: changing start of section"
4210 " %s by %lu bytes\n"),
4211 os->name, (unsigned long) (newdot - savedot));
4213 bfd_set_section_vma (0, os->bfd_section, newdot);
4215 os->bfd_section->output_offset = 0;
4218 lang_size_sections_1 (os->children.head, os, &os->children.head,
4219 os->fill, newdot, relax, check_regions);
4221 os->processed = TRUE;
4223 if (bfd_is_abs_section (os->bfd_section) || os->ignored)
4225 ASSERT (os->bfd_section->size == 0);
4229 dot = os->bfd_section->vma;
4231 /* Put the section within the requested block size, or
4232 align at the block boundary. */
4234 + TO_ADDR (os->bfd_section->size)
4235 + os->block_value - 1)
4236 & - (bfd_vma) os->block_value);
4238 os->bfd_section->size = TO_SIZE (after - os->bfd_section->vma);
4240 /* .tbss sections effectively have zero size. */
4241 if ((os->bfd_section->flags & SEC_HAS_CONTENTS) != 0
4242 || (os->bfd_section->flags & SEC_THREAD_LOCAL) == 0
4243 || link_info.relocatable)
4244 dot += TO_ADDR (os->bfd_section->size);
4246 if (os->update_dot_tree != 0)
4247 exp_fold_tree (os->update_dot_tree, bfd_abs_section_ptr, &dot);
4249 /* Update dot in the region ?
4250 We only do this if the section is going to be allocated,
4251 since unallocated sections do not contribute to the region's
4252 overall size in memory.
4254 If the SEC_NEVER_LOAD bit is not set, it will affect the
4255 addresses of sections after it. We have to update
4257 if (os->region != NULL
4258 && ((os->bfd_section->flags & SEC_NEVER_LOAD) == 0
4259 || (os->bfd_section->flags & (SEC_ALLOC | SEC_LOAD))))
4261 os->region->current = dot;
4264 /* Make sure the new address is within the region. */
4265 os_region_check (os, os->region, os->addr_tree,
4266 os->bfd_section->vma);
4268 /* If there's no load address specified, use the run
4269 region as the load region. */
4270 if (os->lma_region == NULL && os->load_base == NULL)
4271 os->lma_region = os->region;
4273 if (os->lma_region != NULL && os->lma_region != os->region)
4275 /* Set load_base, which will be handled later. */
4276 os->load_base = exp_intop (os->lma_region->current);
4277 os->lma_region->current +=
4278 TO_ADDR (os->bfd_section->size);
4280 os_region_check (os, os->lma_region, NULL,
4281 os->bfd_section->lma);
4287 case lang_constructors_statement_enum:
4288 dot = lang_size_sections_1 (constructor_list.head,
4289 output_section_statement,
4290 &s->wild_statement.children.head,
4291 fill, dot, relax, check_regions);
4294 case lang_data_statement_enum:
4296 unsigned int size = 0;
4298 s->data_statement.output_offset =
4299 dot - output_section_statement->bfd_section->vma;
4300 s->data_statement.output_section =
4301 output_section_statement->bfd_section;
4303 /* We might refer to provided symbols in the expression, and
4304 need to mark them as needed. */
4305 exp_fold_tree (s->data_statement.exp, bfd_abs_section_ptr, &dot);
4307 switch (s->data_statement.type)
4325 if (size < TO_SIZE ((unsigned) 1))
4326 size = TO_SIZE ((unsigned) 1);
4327 dot += TO_ADDR (size);
4328 output_section_statement->bfd_section->size += size;
4332 case lang_reloc_statement_enum:
4336 s->reloc_statement.output_offset =
4337 dot - output_section_statement->bfd_section->vma;
4338 s->reloc_statement.output_section =
4339 output_section_statement->bfd_section;
4340 size = bfd_get_reloc_size (s->reloc_statement.howto);
4341 dot += TO_ADDR (size);
4342 output_section_statement->bfd_section->size += size;
4346 case lang_wild_statement_enum:
4347 dot = lang_size_sections_1 (s->wild_statement.children.head,
4348 output_section_statement,
4349 &s->wild_statement.children.head,
4350 fill, dot, relax, check_regions);
4353 case lang_object_symbols_statement_enum:
4354 link_info.create_object_symbols_section =
4355 output_section_statement->bfd_section;
4358 case lang_output_statement_enum:
4359 case lang_target_statement_enum:
4362 case lang_input_section_enum:
4366 i = (*prev)->input_section.section;
4371 if (! bfd_relax_section (i->owner, i, &link_info, &again))
4372 einfo (_("%P%F: can't relax section: %E\n"));
4376 dot = size_input_section (prev, output_section_statement,
4377 output_section_statement->fill, dot);
4381 case lang_input_statement_enum:
4384 case lang_fill_statement_enum:
4385 s->fill_statement.output_section =
4386 output_section_statement->bfd_section;
4388 fill = s->fill_statement.fill;
4391 case lang_assignment_statement_enum:
4393 bfd_vma newdot = dot;
4395 exp_fold_tree (s->assignment_statement.exp,
4396 output_section_statement->bfd_section,
4399 if (newdot != dot && !output_section_statement->ignored)
4401 if (output_section_statement == abs_output_section)
4403 /* If we don't have an output section, then just adjust
4404 the default memory address. */
4405 lang_memory_region_lookup (DEFAULT_MEMORY_REGION,
4406 FALSE)->current = newdot;
4410 /* Insert a pad after this statement. We can't
4411 put the pad before when relaxing, in case the
4412 assignment references dot. */
4413 insert_pad (&s->header.next, fill, TO_SIZE (newdot - dot),
4414 output_section_statement->bfd_section, dot);
4416 /* Don't neuter the pad below when relaxing. */
4419 /* If dot is advanced, this implies that the section
4420 should have space allocated to it, unless the
4421 user has explicitly stated that the section
4422 should never be loaded. */
4423 if (!(output_section_statement->flags
4424 & (SEC_NEVER_LOAD | SEC_ALLOC)))
4425 output_section_statement->bfd_section->flags |= SEC_ALLOC;
4432 case lang_padding_statement_enum:
4433 /* If this is the first time lang_size_sections is called,
4434 we won't have any padding statements. If this is the
4435 second or later passes when relaxing, we should allow
4436 padding to shrink. If padding is needed on this pass, it
4437 will be added back in. */
4438 s->padding_statement.size = 0;
4440 /* Make sure output_offset is valid. If relaxation shrinks
4441 the section and this pad isn't needed, it's possible to
4442 have output_offset larger than the final size of the
4443 section. bfd_set_section_contents will complain even for
4444 a pad size of zero. */
4445 s->padding_statement.output_offset
4446 = dot - output_section_statement->bfd_section->vma;
4449 case lang_group_statement_enum:
4450 dot = lang_size_sections_1 (s->group_statement.children.head,
4451 output_section_statement,
4452 &s->group_statement.children.head,
4453 fill, dot, relax, check_regions);
4460 /* We can only get here when relaxing is turned on. */
4461 case lang_address_statement_enum:
4464 prev = &s->header.next;
4470 one_lang_size_sections_pass (bfd_boolean *relax, bfd_boolean check_regions)
4472 lang_statement_iteration++;
4473 lang_size_sections_1 (statement_list.head, abs_output_section,
4474 &statement_list.head, 0, 0, relax, check_regions);
4478 lang_size_sections (bfd_boolean *relax, bfd_boolean check_regions)
4480 expld.phase = lang_allocating_phase_enum;
4481 expld.dataseg.phase = exp_dataseg_none;
4483 one_lang_size_sections_pass (relax, check_regions);
4484 if (expld.dataseg.phase == exp_dataseg_end_seen
4485 && link_info.relro && expld.dataseg.relro_end)
4487 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
4488 to put expld.dataseg.relro on a (common) page boundary. */
4489 bfd_vma old_min_base, relro_end, maxpage;
4491 expld.dataseg.phase = exp_dataseg_relro_adjust;
4492 old_min_base = expld.dataseg.min_base;
4493 maxpage = expld.dataseg.maxpagesize;
4494 expld.dataseg.base += (-expld.dataseg.relro_end
4495 & (expld.dataseg.pagesize - 1));
4496 /* Compute the expected PT_GNU_RELRO segment end. */
4497 relro_end = (expld.dataseg.relro_end + expld.dataseg.pagesize - 1)
4498 & ~(expld.dataseg.pagesize - 1);
4499 if (old_min_base + maxpage < expld.dataseg.base)
4501 expld.dataseg.base -= maxpage;
4502 relro_end -= maxpage;
4504 one_lang_size_sections_pass (relax, check_regions);
4505 if (expld.dataseg.relro_end > relro_end)
4507 /* The alignment of sections between DATA_SEGMENT_ALIGN
4508 and DATA_SEGMENT_RELRO_END caused huge padding to be
4509 inserted at DATA_SEGMENT_RELRO_END. Try some other base. */
4511 unsigned int max_alignment_power = 0;
4513 /* Find maximum alignment power of sections between
4514 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
4515 for (sec = output_bfd->sections; sec; sec = sec->next)
4516 if (sec->vma >= expld.dataseg.base
4517 && sec->vma < expld.dataseg.relro_end
4518 && sec->alignment_power > max_alignment_power)
4519 max_alignment_power = sec->alignment_power;
4521 if (((bfd_vma) 1 << max_alignment_power) < expld.dataseg.pagesize)
4523 if (expld.dataseg.base - (1 << max_alignment_power)
4525 expld.dataseg.base += expld.dataseg.pagesize;
4526 expld.dataseg.base -= (1 << max_alignment_power);
4527 one_lang_size_sections_pass (relax, check_regions);
4530 link_info.relro_start = expld.dataseg.base;
4531 link_info.relro_end = expld.dataseg.relro_end;
4533 else if (expld.dataseg.phase == exp_dataseg_end_seen)
4535 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
4536 a page could be saved in the data segment. */
4537 bfd_vma first, last;
4539 first = -expld.dataseg.base & (expld.dataseg.pagesize - 1);
4540 last = expld.dataseg.end & (expld.dataseg.pagesize - 1);
4542 && ((expld.dataseg.base & ~(expld.dataseg.pagesize - 1))
4543 != (expld.dataseg.end & ~(expld.dataseg.pagesize - 1)))
4544 && first + last <= expld.dataseg.pagesize)
4546 expld.dataseg.phase = exp_dataseg_adjust;
4547 one_lang_size_sections_pass (relax, check_regions);
4551 expld.phase = lang_final_phase_enum;
4554 /* Worker function for lang_do_assignments. Recursiveness goes here. */
4557 lang_do_assignments_1
4558 (lang_statement_union_type *s,
4559 lang_output_section_statement_type *output_section_statement,
4563 for (; s != NULL; s = s->header.next)
4565 switch (s->header.type)
4567 case lang_constructors_statement_enum:
4568 dot = lang_do_assignments_1 (constructor_list.head,
4569 output_section_statement,
4574 case lang_output_section_statement_enum:
4576 lang_output_section_statement_type *os;
4578 os = &(s->output_section_statement);
4579 if (os->bfd_section != NULL && !os->ignored)
4581 dot = os->bfd_section->vma;
4582 lang_do_assignments_1 (os->children.head, os, os->fill, dot);
4583 /* .tbss sections effectively have zero size. */
4584 if ((os->bfd_section->flags & SEC_HAS_CONTENTS) != 0
4585 || (os->bfd_section->flags & SEC_THREAD_LOCAL) == 0
4586 || link_info.relocatable)
4587 dot += TO_ADDR (os->bfd_section->size);
4591 /* If nothing has been placed into the output section then
4592 it won't have a bfd_section. */
4593 if (os->bfd_section && !os->ignored)
4595 os->bfd_section->lma
4596 = exp_get_abs_int (os->load_base, 0, "load base");
4602 case lang_wild_statement_enum:
4604 dot = lang_do_assignments_1 (s->wild_statement.children.head,
4605 output_section_statement,
4609 case lang_object_symbols_statement_enum:
4610 case lang_output_statement_enum:
4611 case lang_target_statement_enum:
4614 case lang_data_statement_enum:
4615 exp_fold_tree (s->data_statement.exp, bfd_abs_section_ptr, &dot);
4616 if (expld.result.valid_p)
4617 s->data_statement.value = (expld.result.value
4618 + expld.result.section->vma);
4620 einfo (_("%F%P: invalid data statement\n"));
4623 switch (s->data_statement.type)
4641 if (size < TO_SIZE ((unsigned) 1))
4642 size = TO_SIZE ((unsigned) 1);
4643 dot += TO_ADDR (size);
4647 case lang_reloc_statement_enum:
4648 exp_fold_tree (s->reloc_statement.addend_exp,
4649 bfd_abs_section_ptr, &dot);
4650 if (expld.result.valid_p)
4651 s->reloc_statement.addend_value = expld.result.value;
4653 einfo (_("%F%P: invalid reloc statement\n"));
4654 dot += TO_ADDR (bfd_get_reloc_size (s->reloc_statement.howto));
4657 case lang_input_section_enum:
4659 asection *in = s->input_section.section;
4661 if ((in->flags & SEC_EXCLUDE) == 0)
4662 dot += TO_ADDR (in->size);
4666 case lang_input_statement_enum:
4669 case lang_fill_statement_enum:
4670 fill = s->fill_statement.fill;
4673 case lang_assignment_statement_enum:
4674 exp_fold_tree (s->assignment_statement.exp,
4675 output_section_statement->bfd_section,
4679 case lang_padding_statement_enum:
4680 dot += TO_ADDR (s->padding_statement.size);
4683 case lang_group_statement_enum:
4684 dot = lang_do_assignments_1 (s->group_statement.children.head,
4685 output_section_statement,
4693 case lang_address_statement_enum:
4701 lang_do_assignments (void)
4703 lang_statement_iteration++;
4704 lang_do_assignments_1 (statement_list.head, abs_output_section, NULL, 0);
4707 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
4708 operator .startof. (section_name), it produces an undefined symbol
4709 .startof.section_name. Similarly, when it sees
4710 .sizeof. (section_name), it produces an undefined symbol
4711 .sizeof.section_name. For all the output sections, we look for
4712 such symbols, and set them to the correct value. */
4715 lang_set_startof (void)
4719 if (link_info.relocatable)
4722 for (s = output_bfd->sections; s != NULL; s = s->next)
4724 const char *secname;
4726 struct bfd_link_hash_entry *h;
4728 secname = bfd_get_section_name (output_bfd, s);
4729 buf = xmalloc (10 + strlen (secname));
4731 sprintf (buf, ".startof.%s", secname);
4732 h = bfd_link_hash_lookup (link_info.hash, buf, FALSE, FALSE, TRUE);
4733 if (h != NULL && h->type == bfd_link_hash_undefined)
4735 h->type = bfd_link_hash_defined;
4736 h->u.def.value = bfd_get_section_vma (output_bfd, s);
4737 h->u.def.section = bfd_abs_section_ptr;
4740 sprintf (buf, ".sizeof.%s", secname);
4741 h = bfd_link_hash_lookup (link_info.hash, buf, FALSE, FALSE, TRUE);
4742 if (h != NULL && h->type == bfd_link_hash_undefined)
4744 h->type = bfd_link_hash_defined;
4745 h->u.def.value = TO_ADDR (s->size);
4746 h->u.def.section = bfd_abs_section_ptr;
4756 struct bfd_link_hash_entry *h;
4759 if (link_info.relocatable || link_info.shared)
4764 if (entry_symbol.name == NULL)
4766 /* No entry has been specified. Look for the default entry, but
4767 don't warn if we don't find it. */
4768 entry_symbol.name = entry_symbol_default;
4772 h = bfd_link_hash_lookup (link_info.hash, entry_symbol.name,
4773 FALSE, FALSE, TRUE);
4775 && (h->type == bfd_link_hash_defined
4776 || h->type == bfd_link_hash_defweak)
4777 && h->u.def.section->output_section != NULL)
4781 val = (h->u.def.value
4782 + bfd_get_section_vma (output_bfd,
4783 h->u.def.section->output_section)
4784 + h->u.def.section->output_offset);
4785 if (! bfd_set_start_address (output_bfd, val))
4786 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol.name);
4793 /* We couldn't find the entry symbol. Try parsing it as a
4795 val = bfd_scan_vma (entry_symbol.name, &send, 0);
4798 if (! bfd_set_start_address (output_bfd, val))
4799 einfo (_("%P%F: can't set start address\n"));
4805 /* Can't find the entry symbol, and it's not a number. Use
4806 the first address in the text section. */
4807 ts = bfd_get_section_by_name (output_bfd, entry_section);
4811 einfo (_("%P: warning: cannot find entry symbol %s;"
4812 " defaulting to %V\n"),
4814 bfd_get_section_vma (output_bfd, ts));
4815 if (! bfd_set_start_address (output_bfd,
4816 bfd_get_section_vma (output_bfd,
4818 einfo (_("%P%F: can't set start address\n"));
4823 einfo (_("%P: warning: cannot find entry symbol %s;"
4824 " not setting start address\n"),
4830 /* Don't bfd_hash_table_free (&lang_definedness_table);
4831 map file output may result in a call of lang_track_definedness. */
4834 /* This is a small function used when we want to ignore errors from
4838 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED, ...)
4840 /* Don't do anything. */
4843 /* Check that the architecture of all the input files is compatible
4844 with the output file. Also call the backend to let it do any
4845 other checking that is needed. */
4850 lang_statement_union_type *file;
4852 const bfd_arch_info_type *compatible;
4854 for (file = file_chain.head; file != NULL; file = file->input_statement.next)
4856 input_bfd = file->input_statement.the_bfd;
4858 = bfd_arch_get_compatible (input_bfd, output_bfd,
4859 command_line.accept_unknown_input_arch);
4861 /* In general it is not possible to perform a relocatable
4862 link between differing object formats when the input
4863 file has relocations, because the relocations in the
4864 input format may not have equivalent representations in
4865 the output format (and besides BFD does not translate
4866 relocs for other link purposes than a final link). */
4867 if ((link_info.relocatable || link_info.emitrelocations)
4868 && (compatible == NULL
4869 || bfd_get_flavour (input_bfd) != bfd_get_flavour (output_bfd))
4870 && (bfd_get_file_flags (input_bfd) & HAS_RELOC) != 0)
4872 einfo (_("%P%F: Relocatable linking with relocations from"
4873 " format %s (%B) to format %s (%B) is not supported\n"),
4874 bfd_get_target (input_bfd), input_bfd,
4875 bfd_get_target (output_bfd), output_bfd);
4876 /* einfo with %F exits. */
4879 if (compatible == NULL)
4881 if (command_line.warn_mismatch)
4882 einfo (_("%P: warning: %s architecture of input file `%B'"
4883 " is incompatible with %s output\n"),
4884 bfd_printable_name (input_bfd), input_bfd,
4885 bfd_printable_name (output_bfd));
4887 else if (bfd_count_sections (input_bfd))
4889 /* If the input bfd has no contents, it shouldn't set the
4890 private data of the output bfd. */
4892 bfd_error_handler_type pfn = NULL;
4894 /* If we aren't supposed to warn about mismatched input
4895 files, temporarily set the BFD error handler to a
4896 function which will do nothing. We still want to call
4897 bfd_merge_private_bfd_data, since it may set up
4898 information which is needed in the output file. */
4899 if (! command_line.warn_mismatch)
4900 pfn = bfd_set_error_handler (ignore_bfd_errors);
4901 if (! bfd_merge_private_bfd_data (input_bfd, output_bfd))
4903 if (command_line.warn_mismatch)
4904 einfo (_("%P%X: failed to merge target specific data"
4905 " of file %B\n"), input_bfd);
4907 if (! command_line.warn_mismatch)
4908 bfd_set_error_handler (pfn);
4913 /* Look through all the global common symbols and attach them to the
4914 correct section. The -sort-common command line switch may be used
4915 to roughly sort the entries by size. */
4920 if (command_line.inhibit_common_definition)
4922 if (link_info.relocatable
4923 && ! command_line.force_common_definition)
4926 if (! config.sort_common)
4927 bfd_link_hash_traverse (link_info.hash, lang_one_common, NULL);
4932 for (power = 4; power >= 0; power--)
4933 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
4937 /* Place one common symbol in the correct section. */
4940 lang_one_common (struct bfd_link_hash_entry *h, void *info)
4942 unsigned int power_of_two;
4946 if (h->type != bfd_link_hash_common)
4950 power_of_two = h->u.c.p->alignment_power;
4952 if (config.sort_common
4953 && power_of_two < (unsigned int) *(int *) info)
4956 section = h->u.c.p->section;
4958 /* Increase the size of the section to align the common sym. */
4959 section->size += ((bfd_vma) 1 << (power_of_two + opb_shift)) - 1;
4960 section->size &= (- (bfd_vma) 1 << (power_of_two + opb_shift));
4962 /* Adjust the alignment if necessary. */
4963 if (power_of_two > section->alignment_power)
4964 section->alignment_power = power_of_two;
4966 /* Change the symbol from common to defined. */
4967 h->type = bfd_link_hash_defined;
4968 h->u.def.section = section;
4969 h->u.def.value = section->size;
4971 /* Increase the size of the section. */
4972 section->size += size;
4974 /* Make sure the section is allocated in memory, and make sure that
4975 it is no longer a common section. */
4976 section->flags |= SEC_ALLOC;
4977 section->flags &= ~SEC_IS_COMMON;
4979 if (config.map_file != NULL)
4981 static bfd_boolean header_printed;
4986 if (! header_printed)
4988 minfo (_("\nAllocating common symbols\n"));
4989 minfo (_("Common symbol size file\n\n"));
4990 header_printed = TRUE;
4993 name = demangle (h->root.string);
4995 len = strlen (name);
5010 if (size <= 0xffffffff)
5011 sprintf (buf, "%lx", (unsigned long) size);
5013 sprintf_vma (buf, size);
5023 minfo ("%B\n", section->owner);
5029 /* Run through the input files and ensure that every input section has
5030 somewhere to go. If one is found without a destination then create
5031 an input request and place it into the statement tree. */
5034 lang_place_orphans (void)
5036 LANG_FOR_EACH_INPUT_STATEMENT (file)
5040 for (s = file->the_bfd->sections; s != NULL; s = s->next)
5042 if (s->output_section == NULL)
5044 /* This section of the file is not attached, root
5045 around for a sensible place for it to go. */
5047 if (file->just_syms_flag)
5048 bfd_link_just_syms (file->the_bfd, s, &link_info);
5049 else if ((s->flags & SEC_EXCLUDE) != 0)
5050 s->output_section = bfd_abs_section_ptr;
5051 else if (strcmp (s->name, "COMMON") == 0)
5053 /* This is a lonely common section which must have
5054 come from an archive. We attach to the section
5055 with the wildcard. */
5056 if (! link_info.relocatable
5057 || command_line.force_common_definition)
5059 if (default_common_section == NULL)
5061 default_common_section =
5062 lang_output_section_statement_lookup (".bss");
5065 lang_add_section (&default_common_section->children, s,
5066 default_common_section, file);
5069 else if (ldemul_place_orphan (file, s))
5073 lang_output_section_statement_type *os;
5075 os = lang_output_section_statement_lookup (s->name);
5076 lang_add_section (&os->children, s, os, file);
5084 lang_set_flags (lang_memory_region_type *ptr, const char *flags, int invert)
5086 flagword *ptr_flags;
5088 ptr_flags = invert ? &ptr->not_flags : &ptr->flags;
5094 *ptr_flags |= SEC_ALLOC;
5098 *ptr_flags |= SEC_READONLY;
5102 *ptr_flags |= SEC_DATA;
5106 *ptr_flags |= SEC_CODE;
5111 *ptr_flags |= SEC_LOAD;
5115 einfo (_("%P%F: invalid syntax in flags\n"));
5122 /* Call a function on each input file. This function will be called
5123 on an archive, but not on the elements. */
5126 lang_for_each_input_file (void (*func) (lang_input_statement_type *))
5128 lang_input_statement_type *f;
5130 for (f = (lang_input_statement_type *) input_file_chain.head;
5132 f = (lang_input_statement_type *) f->next_real_file)
5136 /* Call a function on each file. The function will be called on all
5137 the elements of an archive which are included in the link, but will
5138 not be called on the archive file itself. */
5141 lang_for_each_file (void (*func) (lang_input_statement_type *))
5143 LANG_FOR_EACH_INPUT_STATEMENT (f)
5150 ldlang_add_file (lang_input_statement_type *entry)
5154 lang_statement_append (&file_chain,
5155 (lang_statement_union_type *) entry,
5158 /* The BFD linker needs to have a list of all input BFDs involved in
5160 ASSERT (entry->the_bfd->link_next == NULL);
5161 ASSERT (entry->the_bfd != output_bfd);
5162 for (pp = &link_info.input_bfds; *pp != NULL; pp = &(*pp)->link_next)
5164 *pp = entry->the_bfd;
5165 entry->the_bfd->usrdata = entry;
5166 bfd_set_gp_size (entry->the_bfd, g_switch_value);
5168 /* Look through the sections and check for any which should not be
5169 included in the link. We need to do this now, so that we can
5170 notice when the backend linker tries to report multiple
5171 definition errors for symbols which are in sections we aren't
5172 going to link. FIXME: It might be better to entirely ignore
5173 symbols which are defined in sections which are going to be
5174 discarded. This would require modifying the backend linker for
5175 each backend which might set the SEC_LINK_ONCE flag. If we do
5176 this, we should probably handle SEC_EXCLUDE in the same way. */
5178 bfd_map_over_sections (entry->the_bfd, section_already_linked, entry);
5182 lang_add_output (const char *name, int from_script)
5184 /* Make -o on command line override OUTPUT in script. */
5185 if (!had_output_filename || !from_script)
5187 output_filename = name;
5188 had_output_filename = TRUE;
5192 static lang_output_section_statement_type *current_section;
5203 for (l = 0; l < 32; l++)
5205 if (i >= (unsigned int) x)
5213 lang_output_section_statement_type *
5214 lang_enter_output_section_statement (const char *output_section_statement_name,
5215 etree_type *address_exp,
5216 enum section_type sectype,
5218 etree_type *subalign,
5222 lang_output_section_statement_type *os;
5226 lang_output_section_statement_lookup_1 (output_section_statement_name,
5229 /* Make next things chain into subchain of this. */
5231 if (os->addr_tree == NULL)
5233 os->addr_tree = address_exp;
5235 os->sectype = sectype;
5236 if (sectype != noload_section)
5237 os->flags = SEC_NO_FLAGS;
5239 os->flags = SEC_NEVER_LOAD;
5240 os->block_value = 1;
5241 stat_ptr = &os->children;
5243 os->subsection_alignment =
5244 topower (exp_get_value_int (subalign, -1, "subsection alignment"));
5245 os->section_alignment =
5246 topower (exp_get_value_int (align, -1, "section alignment"));
5248 os->load_base = ebase;
5255 lang_output_statement_type *new =
5256 new_stat (lang_output_statement, stat_ptr);
5258 new->name = output_filename;
5261 /* Reset the current counters in the regions. */
5264 lang_reset_memory_regions (void)
5266 lang_memory_region_type *p = lang_memory_region_list;
5268 lang_output_section_statement_type *os;
5270 for (p = lang_memory_region_list; p != NULL; p = p->next)
5272 p->old_length = (bfd_size_type) (p->current - p->origin);
5273 p->current = p->origin;
5276 for (os = &lang_output_section_statement.head->output_section_statement;
5279 os->processed = FALSE;
5281 for (o = output_bfd->sections; o != NULL; o = o->next)
5283 /* Save the last size for possible use by bfd_relax_section. */
5284 o->rawsize = o->size;
5289 /* Worker for lang_gc_sections_1. */
5292 gc_section_callback (lang_wild_statement_type *ptr,
5293 struct wildcard_list *sec ATTRIBUTE_UNUSED,
5295 lang_input_statement_type *file ATTRIBUTE_UNUSED,
5296 void *data ATTRIBUTE_UNUSED)
5298 /* If the wild pattern was marked KEEP, the member sections
5299 should be as well. */
5300 if (ptr->keep_sections)
5301 section->flags |= SEC_KEEP;
5304 /* Iterate over sections marking them against GC. */
5307 lang_gc_sections_1 (lang_statement_union_type *s)
5309 for (; s != NULL; s = s->header.next)
5311 switch (s->header.type)
5313 case lang_wild_statement_enum:
5314 walk_wild (&s->wild_statement, gc_section_callback, NULL);
5316 case lang_constructors_statement_enum:
5317 lang_gc_sections_1 (constructor_list.head);
5319 case lang_output_section_statement_enum:
5320 lang_gc_sections_1 (s->output_section_statement.children.head);
5322 case lang_group_statement_enum:
5323 lang_gc_sections_1 (s->group_statement.children.head);
5332 lang_gc_sections (void)
5334 struct bfd_link_hash_entry *h;
5335 ldlang_undef_chain_list_type *ulist;
5337 /* Keep all sections so marked in the link script. */
5339 lang_gc_sections_1 (statement_list.head);
5341 /* Keep all sections containing symbols undefined on the command-line,
5342 and the section containing the entry symbol. */
5344 for (ulist = link_info.gc_sym_list; ulist; ulist = ulist->next)
5346 h = bfd_link_hash_lookup (link_info.hash, ulist->name,
5347 FALSE, FALSE, FALSE);
5350 && (h->type == bfd_link_hash_defined
5351 || h->type == bfd_link_hash_defweak)
5352 && ! bfd_is_abs_section (h->u.def.section))
5354 h->u.def.section->flags |= SEC_KEEP;
5358 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
5359 the special case of debug info. (See bfd/stabs.c)
5360 Twiddle the flag here, to simplify later linker code. */
5361 if (link_info.relocatable)
5363 LANG_FOR_EACH_INPUT_STATEMENT (f)
5366 for (sec = f->the_bfd->sections; sec != NULL; sec = sec->next)
5367 if ((sec->flags & SEC_DEBUGGING) == 0)
5368 sec->flags &= ~SEC_EXCLUDE;
5372 if (link_info.gc_sections)
5373 bfd_gc_sections (output_bfd, &link_info);
5379 current_target = default_target;
5381 /* Open the output file. */
5382 lang_for_each_statement (ldlang_open_output);
5385 ldemul_create_output_section_statements ();
5387 /* Add to the hash table all undefineds on the command line. */
5388 lang_place_undefineds ();
5390 if (!bfd_section_already_linked_table_init ())
5391 einfo (_("%P%F: Failed to create hash table\n"));
5393 /* Create a bfd for each input file. */
5394 current_target = default_target;
5395 open_input_bfds (statement_list.head, FALSE);
5397 link_info.gc_sym_list = &entry_symbol;
5398 if (entry_symbol.name == NULL)
5399 link_info.gc_sym_list = ldlang_undef_chain_list_head;
5401 ldemul_after_open ();
5403 bfd_section_already_linked_table_free ();
5405 /* Make sure that we're not mixing architectures. We call this
5406 after all the input files have been opened, but before we do any
5407 other processing, so that any operations merge_private_bfd_data
5408 does on the output file will be known during the rest of the
5412 /* Handle .exports instead of a version script if we're told to do so. */
5413 if (command_line.version_exports_section)
5414 lang_do_version_exports_section ();
5416 /* Build all sets based on the information gathered from the input
5418 ldctor_build_sets ();
5420 /* Remove unreferenced sections if asked to. */
5421 lang_gc_sections ();
5423 /* Size up the common data. */
5426 /* Update wild statements. */
5427 update_wild_statements (statement_list.head);
5429 /* Run through the contours of the script and attach input sections
5430 to the correct output sections. */
5431 map_input_to_output_sections (statement_list.head, NULL, NULL);
5433 /* Find any sections not attached explicitly and handle them. */
5434 lang_place_orphans ();
5436 if (! link_info.relocatable)
5440 /* Merge SEC_MERGE sections. This has to be done after GC of
5441 sections, so that GCed sections are not merged, but before
5442 assigning dynamic symbols, since removing whole input sections
5444 bfd_merge_sections (output_bfd, &link_info);
5446 /* Look for a text section and set the readonly attribute in it. */
5447 found = bfd_get_section_by_name (output_bfd, ".text");
5451 if (config.text_read_only)
5452 found->flags |= SEC_READONLY;
5454 found->flags &= ~SEC_READONLY;
5458 /* Do anything special before sizing sections. This is where ELF
5459 and other back-ends size dynamic sections. */
5460 ldemul_before_allocation ();
5462 /* We must record the program headers before we try to fix the
5463 section positions, since they will affect SIZEOF_HEADERS. */
5464 lang_record_phdrs ();
5466 /* Size up the sections. */
5467 lang_size_sections (NULL, !command_line.relax);
5469 /* Now run around and relax if we can. */
5470 if (command_line.relax)
5472 /* Keep relaxing until bfd_relax_section gives up. */
5473 bfd_boolean relax_again;
5477 relax_again = FALSE;
5479 /* Note: pe-dll.c does something like this also. If you find
5480 you need to change this code, you probably need to change
5481 pe-dll.c also. DJ */
5483 /* Do all the assignments with our current guesses as to
5485 lang_do_assignments ();
5487 /* We must do this after lang_do_assignments, because it uses
5489 lang_reset_memory_regions ();
5491 /* Perform another relax pass - this time we know where the
5492 globals are, so can make a better guess. */
5493 lang_size_sections (&relax_again, FALSE);
5495 /* If the normal relax is done and the relax finalize pass
5496 is not performed yet, we perform another relax pass. */
5497 if (!relax_again && link_info.need_relax_finalize)
5499 link_info.need_relax_finalize = FALSE;
5503 while (relax_again);
5505 /* Final extra sizing to report errors. */
5506 lang_do_assignments ();
5507 lang_reset_memory_regions ();
5508 lang_size_sections (NULL, TRUE);
5511 /* See if anything special should be done now we know how big
5513 ldemul_after_allocation ();
5515 /* Fix any .startof. or .sizeof. symbols. */
5516 lang_set_startof ();
5518 /* Do all the assignments, now that we know the final resting places
5519 of all the symbols. */
5521 lang_do_assignments ();
5523 /* Make sure that the section addresses make sense. */
5524 if (! link_info.relocatable
5525 && command_line.check_section_addresses)
5526 lang_check_section_addresses ();
5533 /* EXPORTED TO YACC */
5536 lang_add_wild (struct wildcard_spec *filespec,
5537 struct wildcard_list *section_list,
5538 bfd_boolean keep_sections)
5540 struct wildcard_list *curr, *next;
5541 lang_wild_statement_type *new;
5543 /* Reverse the list as the parser puts it back to front. */
5544 for (curr = section_list, section_list = NULL;
5546 section_list = curr, curr = next)
5548 if (curr->spec.name != NULL && strcmp (curr->spec.name, "COMMON") == 0)
5549 placed_commons = TRUE;
5552 curr->next = section_list;
5555 if (filespec != NULL && filespec->name != NULL)
5557 if (strcmp (filespec->name, "*") == 0)
5558 filespec->name = NULL;
5559 else if (! wildcardp (filespec->name))
5560 lang_has_input_file = TRUE;
5563 new = new_stat (lang_wild_statement, stat_ptr);
5564 new->filename = NULL;
5565 new->filenames_sorted = FALSE;
5566 if (filespec != NULL)
5568 new->filename = filespec->name;
5569 new->filenames_sorted = filespec->sorted == by_name;
5571 new->section_list = section_list;
5572 new->keep_sections = keep_sections;
5573 lang_list_init (&new->children);
5574 analyze_walk_wild_section_handler (new);
5578 lang_section_start (const char *name, etree_type *address,
5579 const segment_type *segment)
5581 lang_address_statement_type *ad;
5583 ad = new_stat (lang_address_statement, stat_ptr);
5584 ad->section_name = name;
5585 ad->address = address;
5586 ad->segment = segment;
5589 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
5590 because of a -e argument on the command line, or zero if this is
5591 called by ENTRY in a linker script. Command line arguments take
5595 lang_add_entry (const char *name, bfd_boolean cmdline)
5597 if (entry_symbol.name == NULL
5599 || ! entry_from_cmdline)
5601 entry_symbol.name = name;
5602 entry_from_cmdline = cmdline;
5606 /* Set the default start symbol to NAME. .em files should use this,
5607 not lang_add_entry, to override the use of "start" if neither the
5608 linker script nor the command line specifies an entry point. NAME
5609 must be permanently allocated. */
5611 lang_default_entry (const char *name)
5613 entry_symbol_default = name;
5617 lang_add_target (const char *name)
5619 lang_target_statement_type *new = new_stat (lang_target_statement,
5627 lang_add_map (const char *name)
5634 map_option_f = TRUE;
5642 lang_add_fill (fill_type *fill)
5644 lang_fill_statement_type *new = new_stat (lang_fill_statement,
5651 lang_add_data (int type, union etree_union *exp)
5654 lang_data_statement_type *new = new_stat (lang_data_statement,
5662 /* Create a new reloc statement. RELOC is the BFD relocation type to
5663 generate. HOWTO is the corresponding howto structure (we could
5664 look this up, but the caller has already done so). SECTION is the
5665 section to generate a reloc against, or NAME is the name of the
5666 symbol to generate a reloc against. Exactly one of SECTION and
5667 NAME must be NULL. ADDEND is an expression for the addend. */
5670 lang_add_reloc (bfd_reloc_code_real_type reloc,
5671 reloc_howto_type *howto,
5674 union etree_union *addend)
5676 lang_reloc_statement_type *p = new_stat (lang_reloc_statement, stat_ptr);
5680 p->section = section;
5682 p->addend_exp = addend;
5684 p->addend_value = 0;
5685 p->output_section = NULL;
5686 p->output_offset = 0;
5689 lang_assignment_statement_type *
5690 lang_add_assignment (etree_type *exp)
5692 lang_assignment_statement_type *new = new_stat (lang_assignment_statement,
5700 lang_add_attribute (enum statement_enum attribute)
5702 new_statement (attribute, sizeof (lang_statement_union_type), stat_ptr);
5706 lang_startup (const char *name)
5708 if (startup_file != NULL)
5710 einfo (_("%P%F: multiple STARTUP files\n"));
5712 first_file->filename = name;
5713 first_file->local_sym_name = name;
5714 first_file->real = TRUE;
5716 startup_file = name;
5720 lang_float (bfd_boolean maybe)
5722 lang_float_flag = maybe;
5726 /* Work out the load- and run-time regions from a script statement, and
5727 store them in *LMA_REGION and *REGION respectively.
5729 MEMSPEC is the name of the run-time region, or the value of
5730 DEFAULT_MEMORY_REGION if the statement didn't specify one.
5731 LMA_MEMSPEC is the name of the load-time region, or null if the
5732 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
5733 had an explicit load address.
5735 It is an error to specify both a load region and a load address. */
5738 lang_get_regions (lang_memory_region_type **region,
5739 lang_memory_region_type **lma_region,
5740 const char *memspec,
5741 const char *lma_memspec,
5742 bfd_boolean have_lma,
5743 bfd_boolean have_vma)
5745 *lma_region = lang_memory_region_lookup (lma_memspec, FALSE);
5747 /* If no runtime region or VMA has been specified, but the load region
5748 has been specified, then use the load region for the runtime region
5750 if (lma_memspec != NULL
5752 && strcmp (memspec, DEFAULT_MEMORY_REGION) == 0)
5753 *region = *lma_region;
5755 *region = lang_memory_region_lookup (memspec, FALSE);
5757 if (have_lma && lma_memspec != 0)
5758 einfo (_("%X%P:%S: section has both a load address and a load region\n"));
5762 lang_leave_output_section_statement (fill_type *fill, const char *memspec,
5763 lang_output_section_phdr_list *phdrs,
5764 const char *lma_memspec)
5766 lang_get_regions (¤t_section->region,
5767 ¤t_section->lma_region,
5768 memspec, lma_memspec,
5769 current_section->load_base != NULL,
5770 current_section->addr_tree != NULL);
5771 current_section->fill = fill;
5772 current_section->phdrs = phdrs;
5773 stat_ptr = &statement_list;
5776 /* Create an absolute symbol with the given name with the value of the
5777 address of first byte of the section named.
5779 If the symbol already exists, then do nothing. */
5782 lang_abs_symbol_at_beginning_of (const char *secname, const char *name)
5784 struct bfd_link_hash_entry *h;
5786 h = bfd_link_hash_lookup (link_info.hash, name, TRUE, TRUE, TRUE);
5788 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
5790 if (h->type == bfd_link_hash_new
5791 || h->type == bfd_link_hash_undefined)
5795 h->type = bfd_link_hash_defined;
5797 sec = bfd_get_section_by_name (output_bfd, secname);
5801 h->u.def.value = bfd_get_section_vma (output_bfd, sec);
5803 h->u.def.section = bfd_abs_section_ptr;
5807 /* Create an absolute symbol with the given name with the value of the
5808 address of the first byte after the end of the section named.
5810 If the symbol already exists, then do nothing. */
5813 lang_abs_symbol_at_end_of (const char *secname, const char *name)
5815 struct bfd_link_hash_entry *h;
5817 h = bfd_link_hash_lookup (link_info.hash, name, TRUE, TRUE, TRUE);
5819 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
5821 if (h->type == bfd_link_hash_new
5822 || h->type == bfd_link_hash_undefined)
5826 h->type = bfd_link_hash_defined;
5828 sec = bfd_get_section_by_name (output_bfd, secname);
5832 h->u.def.value = (bfd_get_section_vma (output_bfd, sec)
5833 + TO_ADDR (sec->size));
5835 h->u.def.section = bfd_abs_section_ptr;
5840 lang_statement_append (lang_statement_list_type *list,
5841 lang_statement_union_type *element,
5842 lang_statement_union_type **field)
5844 *(list->tail) = element;
5848 /* Set the output format type. -oformat overrides scripts. */
5851 lang_add_output_format (const char *format,
5856 if (output_target == NULL || !from_script)
5858 if (command_line.endian == ENDIAN_BIG
5861 else if (command_line.endian == ENDIAN_LITTLE
5865 output_target = format;
5869 /* Enter a group. This creates a new lang_group_statement, and sets
5870 stat_ptr to build new statements within the group. */
5873 lang_enter_group (void)
5875 lang_group_statement_type *g;
5877 g = new_stat (lang_group_statement, stat_ptr);
5878 lang_list_init (&g->children);
5879 stat_ptr = &g->children;
5882 /* Leave a group. This just resets stat_ptr to start writing to the
5883 regular list of statements again. Note that this will not work if
5884 groups can occur inside anything else which can adjust stat_ptr,
5885 but currently they can't. */
5888 lang_leave_group (void)
5890 stat_ptr = &statement_list;
5893 /* Add a new program header. This is called for each entry in a PHDRS
5894 command in a linker script. */
5897 lang_new_phdr (const char *name,
5899 bfd_boolean filehdr,
5904 struct lang_phdr *n, **pp;
5906 n = stat_alloc (sizeof (struct lang_phdr));
5909 n->type = exp_get_value_int (type, 0, "program header type");
5910 n->filehdr = filehdr;
5915 for (pp = &lang_phdr_list; *pp != NULL; pp = &(*pp)->next)
5920 /* Record the program header information in the output BFD. FIXME: We
5921 should not be calling an ELF specific function here. */
5924 lang_record_phdrs (void)
5928 lang_output_section_phdr_list *last;
5929 struct lang_phdr *l;
5930 lang_output_section_statement_type *os;
5933 secs = xmalloc (alc * sizeof (asection *));
5935 for (l = lang_phdr_list; l != NULL; l = l->next)
5942 for (os = &lang_output_section_statement.head->output_section_statement;
5946 lang_output_section_phdr_list *pl;
5948 if (os->constraint == -1)
5956 if (os->sectype == noload_section
5957 || os->bfd_section == NULL
5958 || (os->bfd_section->flags & SEC_ALLOC) == 0)
5963 if (os->bfd_section == NULL)
5966 for (; pl != NULL; pl = pl->next)
5968 if (strcmp (pl->name, l->name) == 0)
5973 secs = xrealloc (secs, alc * sizeof (asection *));
5975 secs[c] = os->bfd_section;
5982 if (l->flags == NULL)
5985 flags = exp_get_vma (l->flags, 0, "phdr flags");
5990 at = exp_get_vma (l->at, 0, "phdr load address");
5992 if (! bfd_record_phdr (output_bfd, l->type,
5993 l->flags != NULL, flags, l->at != NULL,
5994 at, l->filehdr, l->phdrs, c, secs))
5995 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
6000 /* Make sure all the phdr assignments succeeded. */
6001 for (os = &lang_output_section_statement.head->output_section_statement;
6005 lang_output_section_phdr_list *pl;
6007 if (os->constraint == -1
6008 || os->bfd_section == NULL)
6011 for (pl = os->phdrs;
6014 if (! pl->used && strcmp (pl->name, "NONE") != 0)
6015 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
6016 os->name, pl->name);
6020 /* Record a list of sections which may not be cross referenced. */
6023 lang_add_nocrossref (lang_nocrossref_type *l)
6025 struct lang_nocrossrefs *n;
6027 n = xmalloc (sizeof *n);
6028 n->next = nocrossref_list;
6030 nocrossref_list = n;
6032 /* Set notice_all so that we get informed about all symbols. */
6033 link_info.notice_all = TRUE;
6036 /* Overlay handling. We handle overlays with some static variables. */
6038 /* The overlay virtual address. */
6039 static etree_type *overlay_vma;
6040 /* And subsection alignment. */
6041 static etree_type *overlay_subalign;
6043 /* An expression for the maximum section size seen so far. */
6044 static etree_type *overlay_max;
6046 /* A list of all the sections in this overlay. */
6048 struct overlay_list {
6049 struct overlay_list *next;
6050 lang_output_section_statement_type *os;
6053 static struct overlay_list *overlay_list;
6055 /* Start handling an overlay. */
6058 lang_enter_overlay (etree_type *vma_expr, etree_type *subalign)
6060 /* The grammar should prevent nested overlays from occurring. */
6061 ASSERT (overlay_vma == NULL
6062 && overlay_subalign == NULL
6063 && overlay_max == NULL);
6065 overlay_vma = vma_expr;
6066 overlay_subalign = subalign;
6069 /* Start a section in an overlay. We handle this by calling
6070 lang_enter_output_section_statement with the correct VMA.
6071 lang_leave_overlay sets up the LMA and memory regions. */
6074 lang_enter_overlay_section (const char *name)
6076 struct overlay_list *n;
6079 lang_enter_output_section_statement (name, overlay_vma, normal_section,
6080 0, overlay_subalign, 0, 0);
6082 /* If this is the first section, then base the VMA of future
6083 sections on this one. This will work correctly even if `.' is
6084 used in the addresses. */
6085 if (overlay_list == NULL)
6086 overlay_vma = exp_nameop (ADDR, name);
6088 /* Remember the section. */
6089 n = xmalloc (sizeof *n);
6090 n->os = current_section;
6091 n->next = overlay_list;
6094 size = exp_nameop (SIZEOF, name);
6096 /* Arrange to work out the maximum section end address. */
6097 if (overlay_max == NULL)
6100 overlay_max = exp_binop (MAX_K, overlay_max, size);
6103 /* Finish a section in an overlay. There isn't any special to do
6107 lang_leave_overlay_section (fill_type *fill,
6108 lang_output_section_phdr_list *phdrs)
6115 name = current_section->name;
6117 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
6118 region and that no load-time region has been specified. It doesn't
6119 really matter what we say here, since lang_leave_overlay will
6121 lang_leave_output_section_statement (fill, DEFAULT_MEMORY_REGION, phdrs, 0);
6123 /* Define the magic symbols. */
6125 clean = xmalloc (strlen (name) + 1);
6127 for (s1 = name; *s1 != '\0'; s1++)
6128 if (ISALNUM (*s1) || *s1 == '_')
6132 buf = xmalloc (strlen (clean) + sizeof "__load_start_");
6133 sprintf (buf, "__load_start_%s", clean);
6134 lang_add_assignment (exp_assop ('=', buf,
6135 exp_nameop (LOADADDR, name)));
6137 buf = xmalloc (strlen (clean) + sizeof "__load_stop_");
6138 sprintf (buf, "__load_stop_%s", clean);
6139 lang_add_assignment (exp_assop ('=', buf,
6141 exp_nameop (LOADADDR, name),
6142 exp_nameop (SIZEOF, name))));
6147 /* Finish an overlay. If there are any overlay wide settings, this
6148 looks through all the sections in the overlay and sets them. */
6151 lang_leave_overlay (etree_type *lma_expr,
6154 const char *memspec,
6155 lang_output_section_phdr_list *phdrs,
6156 const char *lma_memspec)
6158 lang_memory_region_type *region;
6159 lang_memory_region_type *lma_region;
6160 struct overlay_list *l;
6161 lang_nocrossref_type *nocrossref;
6163 lang_get_regions (®ion, &lma_region,
6164 memspec, lma_memspec,
6165 lma_expr != NULL, FALSE);
6169 /* After setting the size of the last section, set '.' to end of the
6171 if (overlay_list != NULL)
6172 overlay_list->os->update_dot_tree
6173 = exp_assop ('=', ".", exp_binop ('+', overlay_vma, overlay_max));
6178 struct overlay_list *next;
6180 if (fill != NULL && l->os->fill == NULL)
6183 l->os->region = region;
6184 l->os->lma_region = lma_region;
6186 /* The first section has the load address specified in the
6187 OVERLAY statement. The rest are worked out from that.
6188 The base address is not needed (and should be null) if
6189 an LMA region was specified. */
6191 l->os->load_base = lma_expr;
6192 else if (lma_region == 0)
6193 l->os->load_base = exp_binop ('+',
6194 exp_nameop (LOADADDR, l->next->os->name),
6195 exp_nameop (SIZEOF, l->next->os->name));
6197 if (phdrs != NULL && l->os->phdrs == NULL)
6198 l->os->phdrs = phdrs;
6202 lang_nocrossref_type *nc;
6204 nc = xmalloc (sizeof *nc);
6205 nc->name = l->os->name;
6206 nc->next = nocrossref;
6215 if (nocrossref != NULL)
6216 lang_add_nocrossref (nocrossref);
6219 overlay_list = NULL;
6223 /* Version handling. This is only useful for ELF. */
6225 /* This global variable holds the version tree that we build. */
6227 struct bfd_elf_version_tree *lang_elf_version_info;
6229 /* If PREV is NULL, return first version pattern matching particular symbol.
6230 If PREV is non-NULL, return first version pattern matching particular
6231 symbol after PREV (previously returned by lang_vers_match). */
6233 static struct bfd_elf_version_expr *
6234 lang_vers_match (struct bfd_elf_version_expr_head *head,
6235 struct bfd_elf_version_expr *prev,
6238 const char *cxx_sym = sym;
6239 const char *java_sym = sym;
6240 struct bfd_elf_version_expr *expr = NULL;
6242 if (head->mask & BFD_ELF_VERSION_CXX_TYPE)
6244 cxx_sym = cplus_demangle (sym, DMGL_PARAMS | DMGL_ANSI);
6248 if (head->mask & BFD_ELF_VERSION_JAVA_TYPE)
6250 java_sym = cplus_demangle (sym, DMGL_JAVA);
6255 if (head->htab && (prev == NULL || prev->symbol))
6257 struct bfd_elf_version_expr e;
6259 switch (prev ? prev->mask : 0)
6262 if (head->mask & BFD_ELF_VERSION_C_TYPE)
6265 expr = htab_find (head->htab, &e);
6266 while (expr && strcmp (expr->symbol, sym) == 0)
6267 if (expr->mask == BFD_ELF_VERSION_C_TYPE)
6273 case BFD_ELF_VERSION_C_TYPE:
6274 if (head->mask & BFD_ELF_VERSION_CXX_TYPE)
6277 expr = htab_find (head->htab, &e);
6278 while (expr && strcmp (expr->symbol, cxx_sym) == 0)
6279 if (expr->mask == BFD_ELF_VERSION_CXX_TYPE)
6285 case BFD_ELF_VERSION_CXX_TYPE:
6286 if (head->mask & BFD_ELF_VERSION_JAVA_TYPE)
6288 e.symbol = java_sym;
6289 expr = htab_find (head->htab, &e);
6290 while (expr && strcmp (expr->symbol, java_sym) == 0)
6291 if (expr->mask == BFD_ELF_VERSION_JAVA_TYPE)
6302 /* Finally, try the wildcards. */
6303 if (prev == NULL || prev->symbol)
6304 expr = head->remaining;
6307 for (; expr; expr = expr->next)
6314 if (expr->pattern[0] == '*' && expr->pattern[1] == '\0')
6317 if (expr->mask == BFD_ELF_VERSION_JAVA_TYPE)
6319 else if (expr->mask == BFD_ELF_VERSION_CXX_TYPE)
6323 if (fnmatch (expr->pattern, s, 0) == 0)
6329 free ((char *) cxx_sym);
6330 if (java_sym != sym)
6331 free ((char *) java_sym);
6335 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
6336 return a string pointing to the symbol name. */
6339 realsymbol (const char *pattern)
6342 bfd_boolean changed = FALSE, backslash = FALSE;
6343 char *s, *symbol = xmalloc (strlen (pattern) + 1);
6345 for (p = pattern, s = symbol; *p != '\0'; ++p)
6347 /* It is a glob pattern only if there is no preceding
6349 if (! backslash && (*p == '?' || *p == '*' || *p == '['))
6357 /* Remove the preceding backslash. */
6364 backslash = *p == '\\';
6379 /* This is called for each variable name or match expression. NEW is
6380 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
6381 pattern to be matched against symbol names. */
6383 struct bfd_elf_version_expr *
6384 lang_new_vers_pattern (struct bfd_elf_version_expr *orig,
6387 bfd_boolean literal_p)
6389 struct bfd_elf_version_expr *ret;
6391 ret = xmalloc (sizeof *ret);
6393 ret->pattern = literal_p ? NULL : new;
6396 ret->symbol = literal_p ? new : realsymbol (new);
6398 if (lang == NULL || strcasecmp (lang, "C") == 0)
6399 ret->mask = BFD_ELF_VERSION_C_TYPE;
6400 else if (strcasecmp (lang, "C++") == 0)
6401 ret->mask = BFD_ELF_VERSION_CXX_TYPE;
6402 else if (strcasecmp (lang, "Java") == 0)
6403 ret->mask = BFD_ELF_VERSION_JAVA_TYPE;
6406 einfo (_("%X%P: unknown language `%s' in version information\n"),
6408 ret->mask = BFD_ELF_VERSION_C_TYPE;
6411 return ldemul_new_vers_pattern (ret);
6414 /* This is called for each set of variable names and match
6417 struct bfd_elf_version_tree *
6418 lang_new_vers_node (struct bfd_elf_version_expr *globals,
6419 struct bfd_elf_version_expr *locals)
6421 struct bfd_elf_version_tree *ret;
6423 ret = xcalloc (1, sizeof *ret);
6424 ret->globals.list = globals;
6425 ret->locals.list = locals;
6426 ret->match = lang_vers_match;
6427 ret->name_indx = (unsigned int) -1;
6431 /* This static variable keeps track of version indices. */
6433 static int version_index;
6436 version_expr_head_hash (const void *p)
6438 const struct bfd_elf_version_expr *e = p;
6440 return htab_hash_string (e->symbol);
6444 version_expr_head_eq (const void *p1, const void *p2)
6446 const struct bfd_elf_version_expr *e1 = p1;
6447 const struct bfd_elf_version_expr *e2 = p2;
6449 return strcmp (e1->symbol, e2->symbol) == 0;
6453 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head *head)
6456 struct bfd_elf_version_expr *e, *next;
6457 struct bfd_elf_version_expr **list_loc, **remaining_loc;
6459 for (e = head->list; e; e = e->next)
6463 head->mask |= e->mask;
6468 head->htab = htab_create (count * 2, version_expr_head_hash,
6469 version_expr_head_eq, NULL);
6470 list_loc = &head->list;
6471 remaining_loc = &head->remaining;
6472 for (e = head->list; e; e = next)
6478 remaining_loc = &e->next;
6482 void **loc = htab_find_slot (head->htab, e, INSERT);
6486 struct bfd_elf_version_expr *e1, *last;
6492 if (e1->mask == e->mask)
6500 while (e1 && strcmp (e1->symbol, e->symbol) == 0);
6504 /* This is a duplicate. */
6505 /* FIXME: Memory leak. Sometimes pattern is not
6506 xmalloced alone, but in larger chunk of memory. */
6507 /* free (e->symbol); */
6512 e->next = last->next;
6520 list_loc = &e->next;
6524 *remaining_loc = NULL;
6525 *list_loc = head->remaining;
6528 head->remaining = head->list;
6531 /* This is called when we know the name and dependencies of the
6535 lang_register_vers_node (const char *name,
6536 struct bfd_elf_version_tree *version,
6537 struct bfd_elf_version_deps *deps)
6539 struct bfd_elf_version_tree *t, **pp;
6540 struct bfd_elf_version_expr *e1;
6545 if ((name[0] == '\0' && lang_elf_version_info != NULL)
6546 || (lang_elf_version_info && lang_elf_version_info->name[0] == '\0'))
6548 einfo (_("%X%P: anonymous version tag cannot be combined"
6549 " with other version tags\n"));
6554 /* Make sure this node has a unique name. */
6555 for (t = lang_elf_version_info; t != NULL; t = t->next)
6556 if (strcmp (t->name, name) == 0)
6557 einfo (_("%X%P: duplicate version tag `%s'\n"), name);
6559 lang_finalize_version_expr_head (&version->globals);
6560 lang_finalize_version_expr_head (&version->locals);
6562 /* Check the global and local match names, and make sure there
6563 aren't any duplicates. */
6565 for (e1 = version->globals.list; e1 != NULL; e1 = e1->next)
6567 for (t = lang_elf_version_info; t != NULL; t = t->next)
6569 struct bfd_elf_version_expr *e2;
6571 if (t->locals.htab && e1->symbol)
6573 e2 = htab_find (t->locals.htab, e1);
6574 while (e2 && strcmp (e1->symbol, e2->symbol) == 0)
6576 if (e1->mask == e2->mask)
6577 einfo (_("%X%P: duplicate expression `%s'"
6578 " in version information\n"), e1->symbol);
6582 else if (!e1->symbol)
6583 for (e2 = t->locals.remaining; e2 != NULL; e2 = e2->next)
6584 if (strcmp (e1->pattern, e2->pattern) == 0
6585 && e1->mask == e2->mask)
6586 einfo (_("%X%P: duplicate expression `%s'"
6587 " in version information\n"), e1->pattern);
6591 for (e1 = version->locals.list; e1 != NULL; e1 = e1->next)
6593 for (t = lang_elf_version_info; t != NULL; t = t->next)
6595 struct bfd_elf_version_expr *e2;
6597 if (t->globals.htab && e1->symbol)
6599 e2 = htab_find (t->globals.htab, e1);
6600 while (e2 && strcmp (e1->symbol, e2->symbol) == 0)
6602 if (e1->mask == e2->mask)
6603 einfo (_("%X%P: duplicate expression `%s'"
6604 " in version information\n"),
6609 else if (!e1->symbol)
6610 for (e2 = t->globals.remaining; e2 != NULL; e2 = e2->next)
6611 if (strcmp (e1->pattern, e2->pattern) == 0
6612 && e1->mask == e2->mask)
6613 einfo (_("%X%P: duplicate expression `%s'"
6614 " in version information\n"), e1->pattern);
6618 version->deps = deps;
6619 version->name = name;
6620 if (name[0] != '\0')
6623 version->vernum = version_index;
6626 version->vernum = 0;
6628 for (pp = &lang_elf_version_info; *pp != NULL; pp = &(*pp)->next)
6633 /* This is called when we see a version dependency. */
6635 struct bfd_elf_version_deps *
6636 lang_add_vers_depend (struct bfd_elf_version_deps *list, const char *name)
6638 struct bfd_elf_version_deps *ret;
6639 struct bfd_elf_version_tree *t;
6641 ret = xmalloc (sizeof *ret);
6644 for (t = lang_elf_version_info; t != NULL; t = t->next)
6646 if (strcmp (t->name, name) == 0)
6648 ret->version_needed = t;
6653 einfo (_("%X%P: unable to find version dependency `%s'\n"), name);
6659 lang_do_version_exports_section (void)
6661 struct bfd_elf_version_expr *greg = NULL, *lreg;
6663 LANG_FOR_EACH_INPUT_STATEMENT (is)
6665 asection *sec = bfd_get_section_by_name (is->the_bfd, ".exports");
6673 contents = xmalloc (len);
6674 if (!bfd_get_section_contents (is->the_bfd, sec, contents, 0, len))
6675 einfo (_("%X%P: unable to read .exports section contents\n"), sec);
6678 while (p < contents + len)
6680 greg = lang_new_vers_pattern (greg, p, NULL, FALSE);
6681 p = strchr (p, '\0') + 1;
6684 /* Do not free the contents, as we used them creating the regex. */
6686 /* Do not include this section in the link. */
6687 sec->flags |= SEC_EXCLUDE;
6690 lreg = lang_new_vers_pattern (NULL, "*", NULL, FALSE);
6691 lang_register_vers_node (command_line.version_exports_section,
6692 lang_new_vers_node (greg, lreg), NULL);
6696 lang_add_unique (const char *name)
6698 struct unique_sections *ent;
6700 for (ent = unique_section_list; ent; ent = ent->next)
6701 if (strcmp (ent->name, name) == 0)
6704 ent = xmalloc (sizeof *ent);
6705 ent->name = xstrdup (name);
6706 ent->next = unique_section_list;
6707 unique_section_list = ent;