1 /* Linker command language support.
2 Copyright 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
4 Free Software Foundation, Inc.
6 This file is part of the GNU Binutils.
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software
20 Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
21 MA 02110-1301, USA. */
27 #include "libiberty.h"
28 #include "safe-ctype.h"
47 #define offsetof(TYPE, MEMBER) ((size_t) & (((TYPE*) 0)->MEMBER))
50 /* Locals variables. */
51 static struct obstack stat_obstack
;
52 static struct obstack map_obstack
;
54 #define obstack_chunk_alloc xmalloc
55 #define obstack_chunk_free free
56 static const char *startup_file
;
57 static bfd_boolean placed_commons
= FALSE
;
58 static bfd_boolean stripped_excluded_sections
= FALSE
;
59 static lang_output_section_statement_type
*default_common_section
;
60 static bfd_boolean map_option_f
;
61 static bfd_vma print_dot
;
62 static lang_input_statement_type
*first_file
;
63 static const char *current_target
;
64 static const char *output_target
;
65 static lang_statement_list_type statement_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 struct bfd_hash_entry
*lang_definedness_newfunc
73 (struct bfd_hash_entry
*, struct bfd_hash_table
*, const char *);
74 static void insert_undefined (const char *);
75 static bfd_boolean
sort_def_symbol (struct bfd_link_hash_entry
*, void *);
76 static void print_statement (lang_statement_union_type
*,
77 lang_output_section_statement_type
*);
78 static void print_statement_list (lang_statement_union_type
*,
79 lang_output_section_statement_type
*);
80 static void print_statements (void);
81 static void print_input_section (asection
*);
82 static bfd_boolean
lang_one_common (struct bfd_link_hash_entry
*, void *);
83 static void lang_record_phdrs (void);
84 static void lang_do_version_exports_section (void);
85 static void lang_finalize_version_expr_head
86 (struct bfd_elf_version_expr_head
*);
88 /* Exported variables. */
89 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 lang_statement_list_type input_file_chain
;
94 struct bfd_sym_chain entry_symbol
= { NULL
, NULL
};
95 static const char *entry_symbol_default
= "start";
96 const char *entry_section
= ".text";
97 bfd_boolean entry_from_cmdline
;
98 bfd_boolean lang_has_input_file
= FALSE
;
99 bfd_boolean had_output_filename
= FALSE
;
100 bfd_boolean lang_float_flag
= FALSE
;
101 bfd_boolean delete_output_file_on_failure
= FALSE
;
102 struct lang_phdr
*lang_phdr_list
;
103 struct lang_nocrossrefs
*nocrossref_list
;
104 static struct unique_sections
*unique_section_list
;
105 static bfd_boolean ldlang_sysrooted_script
= FALSE
;
107 /* Functions that traverse the linker script and might evaluate
108 DEFINED() need to increment this. */
109 int lang_statement_iteration
= 0;
111 etree_type
*base
; /* Relocation base - or null */
113 /* Return TRUE if the PATTERN argument is a wildcard pattern.
114 Although backslashes are treated specially if a pattern contains
115 wildcards, we do not consider the mere presence of a backslash to
116 be enough to cause the pattern to be treated as a wildcard.
117 That lets us handle DOS filenames more naturally. */
118 #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL)
120 #define new_stat(x, y) \
121 (x##_type *) new_statement (x##_enum, sizeof (x##_type), y)
123 #define outside_section_address(q) \
124 ((q)->output_offset + (q)->output_section->vma)
126 #define outside_symbol_address(q) \
127 ((q)->value + outside_section_address (q->section))
129 #define SECTION_NAME_MAP_LENGTH (16)
132 stat_alloc (size_t size
)
134 return obstack_alloc (&stat_obstack
, size
);
138 name_match (const char *pattern
, const char *name
)
140 if (wildcardp (pattern
))
141 return fnmatch (pattern
, name
, 0);
142 return strcmp (pattern
, name
);
145 /* If PATTERN is of the form archive:file, return a pointer to the
146 separator. If not, return NULL. */
149 archive_path (const char *pattern
)
153 if (link_info
.path_separator
== 0)
156 p
= strchr (pattern
, link_info
.path_separator
);
157 #ifdef HAVE_DOS_BASED_FILE_SYSTEM
158 if (p
== NULL
|| link_info
.path_separator
!= ':')
161 /* Assume a match on the second char is part of drive specifier,
162 as in "c:\silly.dos". */
163 if (p
== pattern
+ 1 && ISALPHA (*pattern
))
164 p
= strchr (p
+ 1, link_info
.path_separator
);
169 /* Given that FILE_SPEC results in a non-NULL SEP result from archive_path,
170 return whether F matches FILE_SPEC. */
173 input_statement_is_archive_path (const char *file_spec
, char *sep
,
174 lang_input_statement_type
*f
)
176 bfd_boolean match
= FALSE
;
179 || name_match (sep
+ 1, f
->filename
) == 0)
180 && ((sep
!= file_spec
)
181 == (f
->the_bfd
!= NULL
&& f
->the_bfd
->my_archive
!= NULL
)))
185 if (sep
!= file_spec
)
187 const char *aname
= f
->the_bfd
->my_archive
->filename
;
189 match
= name_match (file_spec
, aname
) == 0;
190 *sep
= link_info
.path_separator
;
197 unique_section_p (const asection
*sec
)
199 struct unique_sections
*unam
;
202 if (link_info
.relocatable
203 && sec
->owner
!= NULL
204 && bfd_is_group_section (sec
->owner
, sec
))
208 for (unam
= unique_section_list
; unam
; unam
= unam
->next
)
209 if (name_match (unam
->name
, secnam
) == 0)
215 /* Generic traversal routines for finding matching sections. */
217 /* Try processing a section against a wildcard. This just calls
218 the callback unless the filename exclusion list is present
219 and excludes the file. It's hardly ever present so this
220 function is very fast. */
223 walk_wild_consider_section (lang_wild_statement_type
*ptr
,
224 lang_input_statement_type
*file
,
226 struct wildcard_list
*sec
,
230 struct name_list
*list_tmp
;
232 /* Don't process sections from files which were excluded. */
233 for (list_tmp
= sec
->spec
.exclude_name_list
;
235 list_tmp
= list_tmp
->next
)
237 char *p
= archive_path (list_tmp
->name
);
241 if (input_statement_is_archive_path (list_tmp
->name
, p
, file
))
245 else if (name_match (list_tmp
->name
, file
->filename
) == 0)
248 /* FIXME: Perhaps remove the following at some stage? Matching
249 unadorned archives like this was never documented and has
250 been superceded by the archive:path syntax. */
251 else if (file
->the_bfd
!= NULL
252 && file
->the_bfd
->my_archive
!= NULL
253 && name_match (list_tmp
->name
,
254 file
->the_bfd
->my_archive
->filename
) == 0)
258 (*callback
) (ptr
, sec
, s
, file
, data
);
261 /* Lowest common denominator routine that can handle everything correctly,
265 walk_wild_section_general (lang_wild_statement_type
*ptr
,
266 lang_input_statement_type
*file
,
271 struct wildcard_list
*sec
;
273 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
275 sec
= ptr
->section_list
;
277 (*callback
) (ptr
, sec
, s
, file
, data
);
281 bfd_boolean skip
= FALSE
;
283 if (sec
->spec
.name
!= NULL
)
285 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
287 skip
= name_match (sec
->spec
.name
, sname
) != 0;
291 walk_wild_consider_section (ptr
, file
, s
, sec
, callback
, data
);
298 /* Routines to find a single section given its name. If there's more
299 than one section with that name, we report that. */
303 asection
*found_section
;
304 bfd_boolean multiple_sections_found
;
305 } section_iterator_callback_data
;
308 section_iterator_callback (bfd
*bfd ATTRIBUTE_UNUSED
, asection
*s
, void *data
)
310 section_iterator_callback_data
*d
= data
;
312 if (d
->found_section
!= NULL
)
314 d
->multiple_sections_found
= TRUE
;
318 d
->found_section
= s
;
323 find_section (lang_input_statement_type
*file
,
324 struct wildcard_list
*sec
,
325 bfd_boolean
*multiple_sections_found
)
327 section_iterator_callback_data cb_data
= { NULL
, FALSE
};
329 bfd_get_section_by_name_if (file
->the_bfd
, sec
->spec
.name
,
330 section_iterator_callback
, &cb_data
);
331 *multiple_sections_found
= cb_data
.multiple_sections_found
;
332 return cb_data
.found_section
;
335 /* Code for handling simple wildcards without going through fnmatch,
336 which can be expensive because of charset translations etc. */
338 /* A simple wild is a literal string followed by a single '*',
339 where the literal part is at least 4 characters long. */
342 is_simple_wild (const char *name
)
344 size_t len
= strcspn (name
, "*?[");
345 return len
>= 4 && name
[len
] == '*' && name
[len
+ 1] == '\0';
349 match_simple_wild (const char *pattern
, const char *name
)
351 /* The first four characters of the pattern are guaranteed valid
352 non-wildcard characters. So we can go faster. */
353 if (pattern
[0] != name
[0] || pattern
[1] != name
[1]
354 || pattern
[2] != name
[2] || pattern
[3] != name
[3])
359 while (*pattern
!= '*')
360 if (*name
++ != *pattern
++)
366 /* Compare sections ASEC and BSEC according to SORT. */
369 compare_section (sort_type sort
, asection
*asec
, asection
*bsec
)
378 case by_alignment_name
:
379 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
380 - bfd_section_alignment (asec
->owner
, asec
));
386 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
387 bfd_get_section_name (bsec
->owner
, bsec
));
390 case by_name_alignment
:
391 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
392 bfd_get_section_name (bsec
->owner
, bsec
));
398 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
399 - bfd_section_alignment (asec
->owner
, asec
));
406 /* Build a Binary Search Tree to sort sections, unlike insertion sort
407 used in wild_sort(). BST is considerably faster if the number of
408 of sections are large. */
410 static lang_section_bst_type
**
411 wild_sort_fast (lang_wild_statement_type
*wild
,
412 struct wildcard_list
*sec
,
413 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
416 lang_section_bst_type
**tree
;
419 if (!wild
->filenames_sorted
420 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
422 /* Append at the right end of tree. */
424 tree
= &((*tree
)->right
);
430 /* Find the correct node to append this section. */
431 if (compare_section (sec
->spec
.sorted
, section
, (*tree
)->section
) < 0)
432 tree
= &((*tree
)->left
);
434 tree
= &((*tree
)->right
);
440 /* Use wild_sort_fast to build a BST to sort sections. */
443 output_section_callback_fast (lang_wild_statement_type
*ptr
,
444 struct wildcard_list
*sec
,
446 lang_input_statement_type
*file
,
447 void *output ATTRIBUTE_UNUSED
)
449 lang_section_bst_type
*node
;
450 lang_section_bst_type
**tree
;
452 if (unique_section_p (section
))
455 node
= xmalloc (sizeof (lang_section_bst_type
));
458 node
->section
= section
;
460 tree
= wild_sort_fast (ptr
, sec
, file
, section
);
465 /* Convert a sorted sections' BST back to list form. */
468 output_section_callback_tree_to_list (lang_wild_statement_type
*ptr
,
469 lang_section_bst_type
*tree
,
473 output_section_callback_tree_to_list (ptr
, tree
->left
, output
);
475 lang_add_section (&ptr
->children
, tree
->section
,
476 (lang_output_section_statement_type
*) output
);
479 output_section_callback_tree_to_list (ptr
, tree
->right
, output
);
484 /* Specialized, optimized routines for handling different kinds of
488 walk_wild_section_specs1_wild0 (lang_wild_statement_type
*ptr
,
489 lang_input_statement_type
*file
,
493 /* We can just do a hash lookup for the section with the right name.
494 But if that lookup discovers more than one section with the name
495 (should be rare), we fall back to the general algorithm because
496 we would otherwise have to sort the sections to make sure they
497 get processed in the bfd's order. */
498 bfd_boolean multiple_sections_found
;
499 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
500 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
502 if (multiple_sections_found
)
503 walk_wild_section_general (ptr
, file
, callback
, data
);
505 walk_wild_consider_section (ptr
, file
, s0
, sec0
, callback
, data
);
509 walk_wild_section_specs1_wild1 (lang_wild_statement_type
*ptr
,
510 lang_input_statement_type
*file
,
515 struct wildcard_list
*wildsec0
= ptr
->handler_data
[0];
517 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
519 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
520 bfd_boolean skip
= !match_simple_wild (wildsec0
->spec
.name
, sname
);
523 walk_wild_consider_section (ptr
, file
, s
, wildsec0
, callback
, data
);
528 walk_wild_section_specs2_wild1 (lang_wild_statement_type
*ptr
,
529 lang_input_statement_type
*file
,
534 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
535 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
536 bfd_boolean multiple_sections_found
;
537 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
539 if (multiple_sections_found
)
541 walk_wild_section_general (ptr
, file
, callback
, data
);
545 /* Note that if the section was not found, s0 is NULL and
546 we'll simply never succeed the s == s0 test below. */
547 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
549 /* Recall that in this code path, a section cannot satisfy more
550 than one spec, so if s == s0 then it cannot match
553 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
556 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
557 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
560 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
,
567 walk_wild_section_specs3_wild2 (lang_wild_statement_type
*ptr
,
568 lang_input_statement_type
*file
,
573 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
574 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
575 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
576 bfd_boolean multiple_sections_found
;
577 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
579 if (multiple_sections_found
)
581 walk_wild_section_general (ptr
, file
, callback
, data
);
585 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
588 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
591 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
592 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
595 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
, data
);
598 skip
= !match_simple_wild (wildsec2
->spec
.name
, sname
);
600 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
608 walk_wild_section_specs4_wild2 (lang_wild_statement_type
*ptr
,
609 lang_input_statement_type
*file
,
614 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
615 struct wildcard_list
*sec1
= ptr
->handler_data
[1];
616 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
617 struct wildcard_list
*wildsec3
= ptr
->handler_data
[3];
618 bfd_boolean multiple_sections_found
;
619 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
), *s1
;
621 if (multiple_sections_found
)
623 walk_wild_section_general (ptr
, file
, callback
, data
);
627 s1
= find_section (file
, sec1
, &multiple_sections_found
);
628 if (multiple_sections_found
)
630 walk_wild_section_general (ptr
, file
, callback
, data
);
634 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
637 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
640 walk_wild_consider_section (ptr
, file
, s
, sec1
, callback
, data
);
643 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
644 bfd_boolean skip
= !match_simple_wild (wildsec2
->spec
.name
,
648 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
652 skip
= !match_simple_wild (wildsec3
->spec
.name
, sname
);
654 walk_wild_consider_section (ptr
, file
, s
, wildsec3
,
662 walk_wild_section (lang_wild_statement_type
*ptr
,
663 lang_input_statement_type
*file
,
667 if (file
->just_syms_flag
)
670 (*ptr
->walk_wild_section_handler
) (ptr
, file
, callback
, data
);
673 /* Returns TRUE when name1 is a wildcard spec that might match
674 something name2 can match. We're conservative: we return FALSE
675 only if the prefixes of name1 and name2 are different up to the
676 first wildcard character. */
679 wild_spec_can_overlap (const char *name1
, const char *name2
)
681 size_t prefix1_len
= strcspn (name1
, "?*[");
682 size_t prefix2_len
= strcspn (name2
, "?*[");
683 size_t min_prefix_len
;
685 /* Note that if there is no wildcard character, then we treat the
686 terminating 0 as part of the prefix. Thus ".text" won't match
687 ".text." or ".text.*", for example. */
688 if (name1
[prefix1_len
] == '\0')
690 if (name2
[prefix2_len
] == '\0')
693 min_prefix_len
= prefix1_len
< prefix2_len
? prefix1_len
: prefix2_len
;
695 return memcmp (name1
, name2
, min_prefix_len
) == 0;
698 /* Select specialized code to handle various kinds of wildcard
702 analyze_walk_wild_section_handler (lang_wild_statement_type
*ptr
)
705 int wild_name_count
= 0;
706 struct wildcard_list
*sec
;
710 ptr
->walk_wild_section_handler
= walk_wild_section_general
;
711 ptr
->handler_data
[0] = NULL
;
712 ptr
->handler_data
[1] = NULL
;
713 ptr
->handler_data
[2] = NULL
;
714 ptr
->handler_data
[3] = NULL
;
717 /* Count how many wildcard_specs there are, and how many of those
718 actually use wildcards in the name. Also, bail out if any of the
719 wildcard names are NULL. (Can this actually happen?
720 walk_wild_section used to test for it.) And bail out if any
721 of the wildcards are more complex than a simple string
722 ending in a single '*'. */
723 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
726 if (sec
->spec
.name
== NULL
)
728 if (wildcardp (sec
->spec
.name
))
731 if (!is_simple_wild (sec
->spec
.name
))
736 /* The zero-spec case would be easy to optimize but it doesn't
737 happen in practice. Likewise, more than 4 specs doesn't
738 happen in practice. */
739 if (sec_count
== 0 || sec_count
> 4)
742 /* Check that no two specs can match the same section. */
743 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
745 struct wildcard_list
*sec2
;
746 for (sec2
= sec
->next
; sec2
!= NULL
; sec2
= sec2
->next
)
748 if (wild_spec_can_overlap (sec
->spec
.name
, sec2
->spec
.name
))
753 signature
= (sec_count
<< 8) + wild_name_count
;
757 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild0
;
760 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild1
;
763 ptr
->walk_wild_section_handler
= walk_wild_section_specs2_wild1
;
766 ptr
->walk_wild_section_handler
= walk_wild_section_specs3_wild2
;
769 ptr
->walk_wild_section_handler
= walk_wild_section_specs4_wild2
;
775 /* Now fill the data array with pointers to the specs, first the
776 specs with non-wildcard names, then the specs with wildcard
777 names. It's OK to process the specs in different order from the
778 given order, because we've already determined that no section
779 will match more than one spec. */
781 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
782 if (!wildcardp (sec
->spec
.name
))
783 ptr
->handler_data
[data_counter
++] = sec
;
784 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
785 if (wildcardp (sec
->spec
.name
))
786 ptr
->handler_data
[data_counter
++] = sec
;
789 /* Handle a wild statement for a single file F. */
792 walk_wild_file (lang_wild_statement_type
*s
,
793 lang_input_statement_type
*f
,
797 if (f
->the_bfd
== NULL
798 || ! bfd_check_format (f
->the_bfd
, bfd_archive
))
799 walk_wild_section (s
, f
, callback
, data
);
804 /* This is an archive file. We must map each member of the
805 archive separately. */
806 member
= bfd_openr_next_archived_file (f
->the_bfd
, NULL
);
807 while (member
!= NULL
)
809 /* When lookup_name is called, it will call the add_symbols
810 entry point for the archive. For each element of the
811 archive which is included, BFD will call ldlang_add_file,
812 which will set the usrdata field of the member to the
813 lang_input_statement. */
814 if (member
->usrdata
!= NULL
)
816 walk_wild_section (s
, member
->usrdata
, callback
, data
);
819 member
= bfd_openr_next_archived_file (f
->the_bfd
, member
);
825 walk_wild (lang_wild_statement_type
*s
, callback_t callback
, void *data
)
827 const char *file_spec
= s
->filename
;
830 if (file_spec
== NULL
)
832 /* Perform the iteration over all files in the list. */
833 LANG_FOR_EACH_INPUT_STATEMENT (f
)
835 walk_wild_file (s
, f
, callback
, data
);
838 else if ((p
= archive_path (file_spec
)) != NULL
)
840 LANG_FOR_EACH_INPUT_STATEMENT (f
)
842 if (input_statement_is_archive_path (file_spec
, p
, f
))
843 walk_wild_file (s
, f
, callback
, data
);
846 else if (wildcardp (file_spec
))
848 LANG_FOR_EACH_INPUT_STATEMENT (f
)
850 if (fnmatch (file_spec
, f
->filename
, 0) == 0)
851 walk_wild_file (s
, f
, callback
, data
);
856 lang_input_statement_type
*f
;
858 /* Perform the iteration over a single file. */
859 f
= lookup_name (file_spec
);
861 walk_wild_file (s
, f
, callback
, data
);
865 /* lang_for_each_statement walks the parse tree and calls the provided
866 function for each node. */
869 lang_for_each_statement_worker (void (*func
) (lang_statement_union_type
*),
870 lang_statement_union_type
*s
)
872 for (; s
!= NULL
; s
= s
->header
.next
)
876 switch (s
->header
.type
)
878 case lang_constructors_statement_enum
:
879 lang_for_each_statement_worker (func
, constructor_list
.head
);
881 case lang_output_section_statement_enum
:
882 lang_for_each_statement_worker
883 (func
, s
->output_section_statement
.children
.head
);
885 case lang_wild_statement_enum
:
886 lang_for_each_statement_worker (func
,
887 s
->wild_statement
.children
.head
);
889 case lang_group_statement_enum
:
890 lang_for_each_statement_worker (func
,
891 s
->group_statement
.children
.head
);
893 case lang_data_statement_enum
:
894 case lang_reloc_statement_enum
:
895 case lang_object_symbols_statement_enum
:
896 case lang_output_statement_enum
:
897 case lang_target_statement_enum
:
898 case lang_input_section_enum
:
899 case lang_input_statement_enum
:
900 case lang_assignment_statement_enum
:
901 case lang_padding_statement_enum
:
902 case lang_address_statement_enum
:
903 case lang_fill_statement_enum
:
904 case lang_insert_statement_enum
:
914 lang_for_each_statement (void (*func
) (lang_statement_union_type
*))
916 lang_for_each_statement_worker (func
, statement_list
.head
);
919 /*----------------------------------------------------------------------*/
922 lang_list_init (lang_statement_list_type
*list
)
925 list
->tail
= &list
->head
;
928 /* Build a new statement node for the parse tree. */
930 static lang_statement_union_type
*
931 new_statement (enum statement_enum type
,
933 lang_statement_list_type
*list
)
935 lang_statement_union_type
*new;
937 new = stat_alloc (size
);
938 new->header
.type
= type
;
939 new->header
.next
= NULL
;
940 lang_statement_append (list
, new, &new->header
.next
);
944 /* Build a new input file node for the language. There are several
945 ways in which we treat an input file, eg, we only look at symbols,
946 or prefix it with a -l etc.
948 We can be supplied with requests for input files more than once;
949 they may, for example be split over several lines like foo.o(.text)
950 foo.o(.data) etc, so when asked for a file we check that we haven't
951 got it already so we don't duplicate the bfd. */
953 static lang_input_statement_type
*
954 new_afile (const char *name
,
955 lang_input_file_enum_type file_type
,
957 bfd_boolean add_to_list
)
959 lang_input_statement_type
*p
;
962 p
= new_stat (lang_input_statement
, stat_ptr
);
965 p
= stat_alloc (sizeof (lang_input_statement_type
));
966 p
->header
.type
= lang_input_statement_enum
;
967 p
->header
.next
= NULL
;
970 lang_has_input_file
= TRUE
;
972 p
->sysrooted
= FALSE
;
974 if (file_type
== lang_input_file_is_l_enum
975 && name
[0] == ':' && name
[1] != '\0')
977 file_type
= lang_input_file_is_search_file_enum
;
983 case lang_input_file_is_symbols_only_enum
:
985 p
->is_archive
= FALSE
;
987 p
->local_sym_name
= name
;
988 p
->just_syms_flag
= TRUE
;
989 p
->search_dirs_flag
= FALSE
;
991 case lang_input_file_is_fake_enum
:
993 p
->is_archive
= FALSE
;
995 p
->local_sym_name
= name
;
996 p
->just_syms_flag
= FALSE
;
997 p
->search_dirs_flag
= FALSE
;
999 case lang_input_file_is_l_enum
:
1000 p
->is_archive
= TRUE
;
1003 p
->local_sym_name
= concat ("-l", name
, (const char *) NULL
);
1004 p
->just_syms_flag
= FALSE
;
1005 p
->search_dirs_flag
= TRUE
;
1007 case lang_input_file_is_marker_enum
:
1009 p
->is_archive
= FALSE
;
1011 p
->local_sym_name
= name
;
1012 p
->just_syms_flag
= FALSE
;
1013 p
->search_dirs_flag
= TRUE
;
1015 case lang_input_file_is_search_file_enum
:
1016 p
->sysrooted
= ldlang_sysrooted_script
;
1018 p
->is_archive
= FALSE
;
1020 p
->local_sym_name
= name
;
1021 p
->just_syms_flag
= FALSE
;
1022 p
->search_dirs_flag
= TRUE
;
1024 case lang_input_file_is_file_enum
:
1026 p
->is_archive
= FALSE
;
1028 p
->local_sym_name
= name
;
1029 p
->just_syms_flag
= FALSE
;
1030 p
->search_dirs_flag
= FALSE
;
1036 p
->next_real_file
= NULL
;
1038 p
->dynamic
= config
.dynamic_link
;
1039 p
->add_needed
= add_needed
;
1040 p
->as_needed
= as_needed
;
1041 p
->whole_archive
= whole_archive
;
1043 lang_statement_append (&input_file_chain
,
1044 (lang_statement_union_type
*) p
,
1045 &p
->next_real_file
);
1049 lang_input_statement_type
*
1050 lang_add_input_file (const char *name
,
1051 lang_input_file_enum_type file_type
,
1054 return new_afile (name
, file_type
, target
, TRUE
);
1057 struct out_section_hash_entry
1059 struct bfd_hash_entry root
;
1060 lang_statement_union_type s
;
1063 /* The hash table. */
1065 static struct bfd_hash_table output_section_statement_table
;
1067 /* Support routines for the hash table used by lang_output_section_find,
1068 initialize the table, fill in an entry and remove the table. */
1070 static struct bfd_hash_entry
*
1071 output_section_statement_newfunc (struct bfd_hash_entry
*entry
,
1072 struct bfd_hash_table
*table
,
1075 lang_output_section_statement_type
**nextp
;
1076 struct out_section_hash_entry
*ret
;
1080 entry
= bfd_hash_allocate (table
, sizeof (*ret
));
1085 entry
= bfd_hash_newfunc (entry
, table
, string
);
1089 ret
= (struct out_section_hash_entry
*) entry
;
1090 memset (&ret
->s
, 0, sizeof (ret
->s
));
1091 ret
->s
.header
.type
= lang_output_section_statement_enum
;
1092 ret
->s
.output_section_statement
.subsection_alignment
= -1;
1093 ret
->s
.output_section_statement
.section_alignment
= -1;
1094 ret
->s
.output_section_statement
.block_value
= 1;
1095 lang_list_init (&ret
->s
.output_section_statement
.children
);
1096 lang_statement_append (stat_ptr
, &ret
->s
, &ret
->s
.header
.next
);
1098 /* For every output section statement added to the list, except the
1099 first one, lang_output_section_statement.tail points to the "next"
1100 field of the last element of the list. */
1101 if (lang_output_section_statement
.head
!= NULL
)
1102 ret
->s
.output_section_statement
.prev
1103 = ((lang_output_section_statement_type
*)
1104 ((char *) lang_output_section_statement
.tail
1105 - offsetof (lang_output_section_statement_type
, next
)));
1107 /* GCC's strict aliasing rules prevent us from just casting the
1108 address, so we store the pointer in a variable and cast that
1110 nextp
= &ret
->s
.output_section_statement
.next
;
1111 lang_statement_append (&lang_output_section_statement
,
1113 (lang_statement_union_type
**) nextp
);
1118 output_section_statement_table_init (void)
1120 if (!bfd_hash_table_init_n (&output_section_statement_table
,
1121 output_section_statement_newfunc
,
1122 sizeof (struct out_section_hash_entry
),
1124 einfo (_("%P%F: can not create hash table: %E\n"));
1128 output_section_statement_table_free (void)
1130 bfd_hash_table_free (&output_section_statement_table
);
1133 /* Build enough state so that the parser can build its tree. */
1138 obstack_begin (&stat_obstack
, 1000);
1140 stat_ptr
= &statement_list
;
1142 output_section_statement_table_init ();
1144 lang_list_init (stat_ptr
);
1146 lang_list_init (&input_file_chain
);
1147 lang_list_init (&lang_output_section_statement
);
1148 lang_list_init (&file_chain
);
1149 first_file
= lang_add_input_file (NULL
, lang_input_file_is_marker_enum
,
1151 abs_output_section
=
1152 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME
);
1154 abs_output_section
->bfd_section
= bfd_abs_section_ptr
;
1156 /* The value "3" is ad-hoc, somewhat related to the expected number of
1157 DEFINED expressions in a linker script. For most default linker
1158 scripts, there are none. Why a hash table then? Well, it's somewhat
1159 simpler to re-use working machinery than using a linked list in terms
1160 of code-complexity here in ld, besides the initialization which just
1161 looks like other code here. */
1162 if (!bfd_hash_table_init_n (&lang_definedness_table
,
1163 lang_definedness_newfunc
,
1164 sizeof (struct lang_definedness_hash_entry
),
1166 einfo (_("%P%F: can not create hash table: %E\n"));
1172 output_section_statement_table_free ();
1175 /*----------------------------------------------------------------------
1176 A region is an area of memory declared with the
1177 MEMORY { name:org=exp, len=exp ... }
1180 We maintain a list of all the regions here.
1182 If no regions are specified in the script, then the default is used
1183 which is created when looked up to be the entire data space.
1185 If create is true we are creating a region inside a MEMORY block.
1186 In this case it is probably an error to create a region that has
1187 already been created. If we are not inside a MEMORY block it is
1188 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1189 and so we issue a warning. */
1191 static lang_memory_region_type
*lang_memory_region_list
;
1192 static lang_memory_region_type
**lang_memory_region_list_tail
1193 = &lang_memory_region_list
;
1195 lang_memory_region_type
*
1196 lang_memory_region_lookup (const char *const name
, bfd_boolean create
)
1198 lang_memory_region_type
*p
;
1199 lang_memory_region_type
*new;
1201 /* NAME is NULL for LMA memspecs if no region was specified. */
1205 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1206 if (strcmp (p
->name
, name
) == 0)
1209 einfo (_("%P:%S: warning: redeclaration of memory region '%s'\n"),
1214 if (!create
&& strcmp (name
, DEFAULT_MEMORY_REGION
))
1215 einfo (_("%P:%S: warning: memory region %s not declared\n"), name
);
1217 new = stat_alloc (sizeof (lang_memory_region_type
));
1219 new->name
= xstrdup (name
);
1222 new->length
= ~(bfd_size_type
) 0;
1224 new->last_os
= NULL
;
1227 new->had_full_message
= FALSE
;
1229 *lang_memory_region_list_tail
= new;
1230 lang_memory_region_list_tail
= &new->next
;
1235 static lang_memory_region_type
*
1236 lang_memory_default (asection
*section
)
1238 lang_memory_region_type
*p
;
1240 flagword sec_flags
= section
->flags
;
1242 /* Override SEC_DATA to mean a writable section. */
1243 if ((sec_flags
& (SEC_ALLOC
| SEC_READONLY
| SEC_CODE
)) == SEC_ALLOC
)
1244 sec_flags
|= SEC_DATA
;
1246 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1248 if ((p
->flags
& sec_flags
) != 0
1249 && (p
->not_flags
& sec_flags
) == 0)
1254 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
1257 lang_output_section_statement_type
*
1258 lang_output_section_find (const char *const name
)
1260 struct out_section_hash_entry
*entry
;
1263 entry
= ((struct out_section_hash_entry
*)
1264 bfd_hash_lookup (&output_section_statement_table
, name
,
1269 hash
= entry
->root
.hash
;
1272 if (entry
->s
.output_section_statement
.constraint
!= -1)
1273 return &entry
->s
.output_section_statement
;
1274 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1276 while (entry
!= NULL
1277 && entry
->root
.hash
== hash
1278 && strcmp (name
, entry
->s
.output_section_statement
.name
) == 0);
1283 static lang_output_section_statement_type
*
1284 lang_output_section_statement_lookup_1 (const char *const name
, int constraint
)
1286 struct out_section_hash_entry
*entry
;
1287 struct out_section_hash_entry
*last_ent
;
1290 entry
= ((struct out_section_hash_entry
*)
1291 bfd_hash_lookup (&output_section_statement_table
, name
,
1295 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1299 if (entry
->s
.output_section_statement
.name
!= NULL
)
1301 /* We have a section of this name, but it might not have the correct
1303 hash
= entry
->root
.hash
;
1306 if (entry
->s
.output_section_statement
.constraint
!= -1
1308 || (constraint
== entry
->s
.output_section_statement
.constraint
1309 && constraint
!= SPECIAL
)))
1310 return &entry
->s
.output_section_statement
;
1312 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1314 while (entry
!= NULL
1315 && entry
->root
.hash
== hash
1316 && strcmp (name
, entry
->s
.output_section_statement
.name
) == 0);
1319 = ((struct out_section_hash_entry
*)
1320 output_section_statement_newfunc (NULL
,
1321 &output_section_statement_table
,
1325 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1328 entry
->root
= last_ent
->root
;
1329 last_ent
->root
.next
= &entry
->root
;
1332 entry
->s
.output_section_statement
.name
= name
;
1333 entry
->s
.output_section_statement
.constraint
= constraint
;
1334 return &entry
->s
.output_section_statement
;
1337 lang_output_section_statement_type
*
1338 lang_output_section_statement_lookup (const char *const name
)
1340 return lang_output_section_statement_lookup_1 (name
, 0);
1343 /* A variant of lang_output_section_find used by place_orphan.
1344 Returns the output statement that should precede a new output
1345 statement for SEC. If an exact match is found on certain flags,
1348 lang_output_section_statement_type
*
1349 lang_output_section_find_by_flags (const asection
*sec
,
1350 lang_output_section_statement_type
**exact
,
1351 lang_match_sec_type_func match_type
)
1353 lang_output_section_statement_type
*first
, *look
, *found
;
1356 /* We know the first statement on this list is *ABS*. May as well
1358 first
= &lang_output_section_statement
.head
->output_section_statement
;
1359 first
= first
->next
;
1361 /* First try for an exact match. */
1363 for (look
= first
; look
; look
= look
->next
)
1365 flags
= look
->flags
;
1366 if (look
->bfd_section
!= NULL
)
1368 flags
= look
->bfd_section
->flags
;
1369 if (match_type
&& !match_type (link_info
.output_bfd
,
1374 flags
^= sec
->flags
;
1375 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
| SEC_READONLY
1376 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1386 if (sec
->flags
& SEC_CODE
)
1388 /* Try for a rw code section. */
1389 for (look
= first
; look
; look
= look
->next
)
1391 flags
= look
->flags
;
1392 if (look
->bfd_section
!= NULL
)
1394 flags
= look
->bfd_section
->flags
;
1395 if (match_type
&& !match_type (link_info
.output_bfd
,
1400 flags
^= sec
->flags
;
1401 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1402 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1406 else if (sec
->flags
& (SEC_READONLY
| SEC_THREAD_LOCAL
))
1408 /* .rodata can go after .text, .sdata2 after .rodata. */
1409 for (look
= first
; look
; look
= look
->next
)
1411 flags
= look
->flags
;
1412 if (look
->bfd_section
!= NULL
)
1414 flags
= look
->bfd_section
->flags
;
1415 if (match_type
&& !match_type (link_info
.output_bfd
,
1420 flags
^= sec
->flags
;
1421 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1423 && !(look
->flags
& (SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1427 else if (sec
->flags
& SEC_SMALL_DATA
)
1429 /* .sdata goes after .data, .sbss after .sdata. */
1430 for (look
= first
; look
; look
= look
->next
)
1432 flags
= look
->flags
;
1433 if (look
->bfd_section
!= NULL
)
1435 flags
= look
->bfd_section
->flags
;
1436 if (match_type
&& !match_type (link_info
.output_bfd
,
1441 flags
^= sec
->flags
;
1442 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1443 | SEC_THREAD_LOCAL
))
1444 || ((look
->flags
& SEC_SMALL_DATA
)
1445 && !(sec
->flags
& SEC_HAS_CONTENTS
)))
1449 else if (sec
->flags
& SEC_HAS_CONTENTS
)
1451 /* .data goes after .rodata. */
1452 for (look
= first
; look
; look
= look
->next
)
1454 flags
= look
->flags
;
1455 if (look
->bfd_section
!= NULL
)
1457 flags
= look
->bfd_section
->flags
;
1458 if (match_type
&& !match_type (link_info
.output_bfd
,
1463 flags
^= sec
->flags
;
1464 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1465 | SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1471 /* .bss goes last. */
1472 for (look
= first
; look
; look
= look
->next
)
1474 flags
= look
->flags
;
1475 if (look
->bfd_section
!= NULL
)
1477 flags
= look
->bfd_section
->flags
;
1478 if (match_type
&& !match_type (link_info
.output_bfd
,
1483 flags
^= sec
->flags
;
1484 if (!(flags
& SEC_ALLOC
))
1489 if (found
|| !match_type
)
1492 return lang_output_section_find_by_flags (sec
, NULL
, NULL
);
1495 /* Find the last output section before given output statement.
1496 Used by place_orphan. */
1499 output_prev_sec_find (lang_output_section_statement_type
*os
)
1501 lang_output_section_statement_type
*lookup
;
1503 for (lookup
= os
->prev
; lookup
!= NULL
; lookup
= lookup
->prev
)
1505 if (lookup
->constraint
== -1)
1508 if (lookup
->bfd_section
!= NULL
&& lookup
->bfd_section
->owner
!= NULL
)
1509 return lookup
->bfd_section
;
1515 /* Look for a suitable place for a new output section statement. The
1516 idea is to skip over anything that might be inside a SECTIONS {}
1517 statement in a script, before we find another output section
1518 statement. Assignments to "dot" before an output section statement
1519 are assumed to belong to it. An exception to this rule is made for
1520 the first assignment to dot, otherwise we might put an orphan
1521 before . = . + SIZEOF_HEADERS or similar assignments that set the
1524 static lang_statement_union_type
**
1525 insert_os_after (lang_output_section_statement_type
*after
)
1527 lang_statement_union_type
**where
;
1528 lang_statement_union_type
**assign
= NULL
;
1529 bfd_boolean ignore_first
;
1532 = after
== &lang_output_section_statement
.head
->output_section_statement
;
1534 for (where
= &after
->header
.next
;
1536 where
= &(*where
)->header
.next
)
1538 switch ((*where
)->header
.type
)
1540 case lang_assignment_statement_enum
:
1543 lang_assignment_statement_type
*ass
;
1545 ass
= &(*where
)->assignment_statement
;
1546 if (ass
->exp
->type
.node_class
!= etree_assert
1547 && ass
->exp
->assign
.dst
[0] == '.'
1548 && ass
->exp
->assign
.dst
[1] == 0
1552 ignore_first
= FALSE
;
1554 case lang_wild_statement_enum
:
1555 case lang_input_section_enum
:
1556 case lang_object_symbols_statement_enum
:
1557 case lang_fill_statement_enum
:
1558 case lang_data_statement_enum
:
1559 case lang_reloc_statement_enum
:
1560 case lang_padding_statement_enum
:
1561 case lang_constructors_statement_enum
:
1564 case lang_output_section_statement_enum
:
1568 case lang_input_statement_enum
:
1569 case lang_address_statement_enum
:
1570 case lang_target_statement_enum
:
1571 case lang_output_statement_enum
:
1572 case lang_group_statement_enum
:
1573 case lang_insert_statement_enum
:
1582 lang_output_section_statement_type
*
1583 lang_insert_orphan (asection
*s
,
1584 const char *secname
,
1585 lang_output_section_statement_type
*after
,
1586 struct orphan_save
*place
,
1587 etree_type
*address
,
1588 lang_statement_list_type
*add_child
)
1590 lang_statement_list_type
*old
;
1591 lang_statement_list_type add
;
1593 lang_output_section_statement_type
*os
;
1594 lang_output_section_statement_type
**os_tail
;
1596 /* Start building a list of statements for this section.
1597 First save the current statement pointer. */
1600 /* If we have found an appropriate place for the output section
1601 statements for this orphan, add them to our own private list,
1602 inserting them later into the global statement list. */
1606 lang_list_init (stat_ptr
);
1610 if (config
.build_constructors
)
1612 /* If the name of the section is representable in C, then create
1613 symbols to mark the start and the end of the section. */
1614 for (ps
= secname
; *ps
!= '\0'; ps
++)
1615 if (! ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
1620 etree_type
*e_align
;
1622 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__start_" + 1);
1623 symname
[0] = bfd_get_symbol_leading_char (link_info
.output_bfd
);
1624 sprintf (symname
+ (symname
[0] != 0), "__start_%s", secname
);
1625 e_align
= exp_unop (ALIGN_K
,
1626 exp_intop ((bfd_vma
) 1 << s
->alignment_power
));
1627 lang_add_assignment (exp_assop ('=', ".", e_align
));
1628 lang_add_assignment (exp_provide (symname
,
1629 exp_nameop (NAME
, "."),
1634 if (link_info
.relocatable
|| (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0)
1635 address
= exp_intop (0);
1637 os_tail
= ((lang_output_section_statement_type
**)
1638 lang_output_section_statement
.tail
);
1639 os
= lang_enter_output_section_statement (secname
, address
, 0, NULL
, NULL
,
1642 if (add_child
== NULL
)
1643 add_child
= &os
->children
;
1644 lang_add_section (add_child
, s
, os
);
1646 lang_leave_output_section_statement (0, "*default*", NULL
, NULL
);
1648 if (config
.build_constructors
&& *ps
== '\0')
1652 /* lang_leave_ouput_section_statement resets stat_ptr.
1653 Put stat_ptr back where we want it. */
1657 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__stop_" + 1);
1658 symname
[0] = bfd_get_symbol_leading_char (link_info
.output_bfd
);
1659 sprintf (symname
+ (symname
[0] != 0), "__stop_%s", secname
);
1660 lang_add_assignment (exp_provide (symname
,
1661 exp_nameop (NAME
, "."),
1665 /* Restore the global list pointer. */
1669 if (after
!= NULL
&& os
->bfd_section
!= NULL
)
1671 asection
*snew
, *as
;
1673 snew
= os
->bfd_section
;
1675 /* Shuffle the bfd section list to make the output file look
1676 neater. This is really only cosmetic. */
1677 if (place
->section
== NULL
1678 && after
!= (&lang_output_section_statement
.head
1679 ->output_section_statement
))
1681 asection
*bfd_section
= after
->bfd_section
;
1683 /* If the output statement hasn't been used to place any input
1684 sections (and thus doesn't have an output bfd_section),
1685 look for the closest prior output statement having an
1687 if (bfd_section
== NULL
)
1688 bfd_section
= output_prev_sec_find (after
);
1690 if (bfd_section
!= NULL
&& bfd_section
!= snew
)
1691 place
->section
= &bfd_section
->next
;
1694 if (place
->section
== NULL
)
1695 place
->section
= &link_info
.output_bfd
->sections
;
1697 as
= *place
->section
;
1701 /* Put the section at the end of the list. */
1703 /* Unlink the section. */
1704 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1706 /* Now tack it back on in the right place. */
1707 bfd_section_list_append (link_info
.output_bfd
, snew
);
1709 else if (as
!= snew
&& as
->prev
!= snew
)
1711 /* Unlink the section. */
1712 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1714 /* Now tack it back on in the right place. */
1715 bfd_section_list_insert_before (link_info
.output_bfd
, as
, snew
);
1718 /* Save the end of this list. Further ophans of this type will
1719 follow the one we've just added. */
1720 place
->section
= &snew
->next
;
1722 /* The following is non-cosmetic. We try to put the output
1723 statements in some sort of reasonable order here, because they
1724 determine the final load addresses of the orphan sections.
1725 In addition, placing output statements in the wrong order may
1726 require extra segments. For instance, given a typical
1727 situation of all read-only sections placed in one segment and
1728 following that a segment containing all the read-write
1729 sections, we wouldn't want to place an orphan read/write
1730 section before or amongst the read-only ones. */
1731 if (add
.head
!= NULL
)
1733 lang_output_section_statement_type
*newly_added_os
;
1735 if (place
->stmt
== NULL
)
1737 lang_statement_union_type
**where
= insert_os_after (after
);
1742 place
->os_tail
= &after
->next
;
1746 /* Put it after the last orphan statement we added. */
1747 *add
.tail
= *place
->stmt
;
1748 *place
->stmt
= add
.head
;
1751 /* Fix the global list pointer if we happened to tack our
1752 new list at the tail. */
1753 if (*old
->tail
== add
.head
)
1754 old
->tail
= add
.tail
;
1756 /* Save the end of this list. */
1757 place
->stmt
= add
.tail
;
1759 /* Do the same for the list of output section statements. */
1760 newly_added_os
= *os_tail
;
1762 newly_added_os
->prev
= (lang_output_section_statement_type
*)
1763 ((char *) place
->os_tail
1764 - offsetof (lang_output_section_statement_type
, next
));
1765 newly_added_os
->next
= *place
->os_tail
;
1766 if (newly_added_os
->next
!= NULL
)
1767 newly_added_os
->next
->prev
= newly_added_os
;
1768 *place
->os_tail
= newly_added_os
;
1769 place
->os_tail
= &newly_added_os
->next
;
1771 /* Fixing the global list pointer here is a little different.
1772 We added to the list in lang_enter_output_section_statement,
1773 trimmed off the new output_section_statment above when
1774 assigning *os_tail = NULL, but possibly added it back in
1775 the same place when assigning *place->os_tail. */
1776 if (*os_tail
== NULL
)
1777 lang_output_section_statement
.tail
1778 = (lang_statement_union_type
**) os_tail
;
1785 lang_map_flags (flagword flag
)
1787 if (flag
& SEC_ALLOC
)
1790 if (flag
& SEC_CODE
)
1793 if (flag
& SEC_READONLY
)
1796 if (flag
& SEC_DATA
)
1799 if (flag
& SEC_LOAD
)
1806 lang_memory_region_type
*m
;
1807 bfd_boolean dis_header_printed
= FALSE
;
1810 LANG_FOR_EACH_INPUT_STATEMENT (file
)
1814 if ((file
->the_bfd
->flags
& (BFD_LINKER_CREATED
| DYNAMIC
)) != 0
1815 || file
->just_syms_flag
)
1818 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
1819 if ((s
->output_section
== NULL
1820 || s
->output_section
->owner
!= link_info
.output_bfd
)
1821 && (s
->flags
& (SEC_LINKER_CREATED
| SEC_KEEP
)) == 0)
1823 if (! dis_header_printed
)
1825 fprintf (config
.map_file
, _("\nDiscarded input sections\n\n"));
1826 dis_header_printed
= TRUE
;
1829 print_input_section (s
);
1833 minfo (_("\nMemory Configuration\n\n"));
1834 fprintf (config
.map_file
, "%-16s %-18s %-18s %s\n",
1835 _("Name"), _("Origin"), _("Length"), _("Attributes"));
1837 for (m
= lang_memory_region_list
; m
!= NULL
; m
= m
->next
)
1842 fprintf (config
.map_file
, "%-16s ", m
->name
);
1844 sprintf_vma (buf
, m
->origin
);
1845 minfo ("0x%s ", buf
);
1853 minfo ("0x%V", m
->length
);
1854 if (m
->flags
|| m
->not_flags
)
1862 lang_map_flags (m
->flags
);
1868 lang_map_flags (m
->not_flags
);
1875 fprintf (config
.map_file
, _("\nLinker script and memory map\n\n"));
1877 if (! link_info
.reduce_memory_overheads
)
1879 obstack_begin (&map_obstack
, 1000);
1880 for (p
= link_info
.input_bfds
; p
!= (bfd
*) NULL
; p
= p
->link_next
)
1881 bfd_map_over_sections (p
, init_map_userdata
, 0);
1882 bfd_link_hash_traverse (link_info
.hash
, sort_def_symbol
, 0);
1884 lang_statement_iteration
++;
1885 print_statements ();
1889 init_map_userdata (bfd
*abfd ATTRIBUTE_UNUSED
,
1891 void *data ATTRIBUTE_UNUSED
)
1893 fat_section_userdata_type
*new_data
1894 = ((fat_section_userdata_type
*) (stat_alloc
1895 (sizeof (fat_section_userdata_type
))));
1897 ASSERT (get_userdata (sec
) == NULL
);
1898 get_userdata (sec
) = new_data
;
1899 new_data
->map_symbol_def_tail
= &new_data
->map_symbol_def_head
;
1903 sort_def_symbol (struct bfd_link_hash_entry
*hash_entry
,
1904 void *info ATTRIBUTE_UNUSED
)
1906 if (hash_entry
->type
== bfd_link_hash_defined
1907 || hash_entry
->type
== bfd_link_hash_defweak
)
1909 struct fat_user_section_struct
*ud
;
1910 struct map_symbol_def
*def
;
1912 ud
= get_userdata (hash_entry
->u
.def
.section
);
1915 /* ??? What do we have to do to initialize this beforehand? */
1916 /* The first time we get here is bfd_abs_section... */
1917 init_map_userdata (0, hash_entry
->u
.def
.section
, 0);
1918 ud
= get_userdata (hash_entry
->u
.def
.section
);
1920 else if (!ud
->map_symbol_def_tail
)
1921 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
1923 def
= obstack_alloc (&map_obstack
, sizeof *def
);
1924 def
->entry
= hash_entry
;
1925 *(ud
->map_symbol_def_tail
) = def
;
1926 ud
->map_symbol_def_tail
= &def
->next
;
1931 /* Initialize an output section. */
1934 init_os (lang_output_section_statement_type
*s
, asection
*isec
,
1937 if (s
->bfd_section
!= NULL
)
1940 if (strcmp (s
->name
, DISCARD_SECTION_NAME
) == 0)
1941 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME
);
1943 s
->bfd_section
= bfd_get_section_by_name (link_info
.output_bfd
, s
->name
);
1944 if (s
->bfd_section
== NULL
)
1945 s
->bfd_section
= bfd_make_section_with_flags (link_info
.output_bfd
,
1947 if (s
->bfd_section
== NULL
)
1949 einfo (_("%P%F: output format %s cannot represent section called %s\n"),
1950 link_info
.output_bfd
->xvec
->name
, s
->name
);
1952 s
->bfd_section
->output_section
= s
->bfd_section
;
1953 s
->bfd_section
->output_offset
= 0;
1955 if (!link_info
.reduce_memory_overheads
)
1957 fat_section_userdata_type
*new
1958 = stat_alloc (sizeof (fat_section_userdata_type
));
1959 memset (new, 0, sizeof (fat_section_userdata_type
));
1960 get_userdata (s
->bfd_section
) = new;
1963 /* If there is a base address, make sure that any sections it might
1964 mention are initialized. */
1965 if (s
->addr_tree
!= NULL
)
1966 exp_init_os (s
->addr_tree
);
1968 if (s
->load_base
!= NULL
)
1969 exp_init_os (s
->load_base
);
1971 /* If supplied an alignment, set it. */
1972 if (s
->section_alignment
!= -1)
1973 s
->bfd_section
->alignment_power
= s
->section_alignment
;
1976 bfd_init_private_section_data (isec
->owner
, isec
,
1977 link_info
.output_bfd
, s
->bfd_section
,
1981 /* Make sure that all output sections mentioned in an expression are
1985 exp_init_os (etree_type
*exp
)
1987 switch (exp
->type
.node_class
)
1991 exp_init_os (exp
->assign
.src
);
1995 exp_init_os (exp
->binary
.lhs
);
1996 exp_init_os (exp
->binary
.rhs
);
2000 exp_init_os (exp
->trinary
.cond
);
2001 exp_init_os (exp
->trinary
.lhs
);
2002 exp_init_os (exp
->trinary
.rhs
);
2006 exp_init_os (exp
->assert_s
.child
);
2010 exp_init_os (exp
->unary
.child
);
2014 switch (exp
->type
.node_code
)
2020 lang_output_section_statement_type
*os
;
2022 os
= lang_output_section_find (exp
->name
.name
);
2023 if (os
!= NULL
&& os
->bfd_section
== NULL
)
2024 init_os (os
, NULL
, 0);
2035 section_already_linked (bfd
*abfd
, asection
*sec
, void *data
)
2037 lang_input_statement_type
*entry
= data
;
2039 /* If we are only reading symbols from this object, then we want to
2040 discard all sections. */
2041 if (entry
->just_syms_flag
)
2043 bfd_link_just_syms (abfd
, sec
, &link_info
);
2047 if (!(abfd
->flags
& DYNAMIC
))
2048 bfd_section_already_linked (abfd
, sec
, &link_info
);
2051 /* The wild routines.
2053 These expand statements like *(.text) and foo.o to a list of
2054 explicit actions, like foo.o(.text), bar.o(.text) and
2055 foo.o(.text, .data). */
2057 /* Add SECTION to the output section OUTPUT. Do this by creating a
2058 lang_input_section statement which is placed at PTR. FILE is the
2059 input file which holds SECTION. */
2062 lang_add_section (lang_statement_list_type
*ptr
,
2064 lang_output_section_statement_type
*output
)
2066 flagword flags
= section
->flags
;
2067 bfd_boolean discard
;
2069 /* Discard sections marked with SEC_EXCLUDE. */
2070 discard
= (flags
& SEC_EXCLUDE
) != 0;
2072 /* Discard input sections which are assigned to a section named
2073 DISCARD_SECTION_NAME. */
2074 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
2077 /* Discard debugging sections if we are stripping debugging
2079 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
2080 && (flags
& SEC_DEBUGGING
) != 0)
2085 if (section
->output_section
== NULL
)
2087 /* This prevents future calls from assigning this section. */
2088 section
->output_section
= bfd_abs_section_ptr
;
2093 if (section
->output_section
== NULL
)
2096 lang_input_section_type
*new;
2099 flags
= section
->flags
;
2101 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2102 to an output section, because we want to be able to include a
2103 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2104 section (I don't know why we want to do this, but we do).
2105 build_link_order in ldwrite.c handles this case by turning
2106 the embedded SEC_NEVER_LOAD section into a fill. */
2108 flags
&= ~ SEC_NEVER_LOAD
;
2110 switch (output
->sectype
)
2112 case normal_section
:
2113 case overlay_section
:
2115 case noalloc_section
:
2116 flags
&= ~SEC_ALLOC
;
2118 case noload_section
:
2120 flags
|= SEC_NEVER_LOAD
;
2124 if (output
->bfd_section
== NULL
)
2125 init_os (output
, section
, flags
);
2127 first
= ! output
->bfd_section
->linker_has_input
;
2128 output
->bfd_section
->linker_has_input
= 1;
2130 if (!link_info
.relocatable
2131 && !stripped_excluded_sections
)
2133 asection
*s
= output
->bfd_section
->map_tail
.s
;
2134 output
->bfd_section
->map_tail
.s
= section
;
2135 section
->map_head
.s
= NULL
;
2136 section
->map_tail
.s
= s
;
2138 s
->map_head
.s
= section
;
2140 output
->bfd_section
->map_head
.s
= section
;
2143 /* Add a section reference to the list. */
2144 new = new_stat (lang_input_section
, ptr
);
2146 new->section
= section
;
2147 section
->output_section
= output
->bfd_section
;
2149 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2150 already been processed. One reason to do this is that on pe
2151 format targets, .text$foo sections go into .text and it's odd
2152 to see .text with SEC_LINK_ONCE set. */
2154 if (! link_info
.relocatable
)
2155 flags
&= ~ (SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
);
2157 /* If this is not the first input section, and the SEC_READONLY
2158 flag is not currently set, then don't set it just because the
2159 input section has it set. */
2161 if (! first
&& (output
->bfd_section
->flags
& SEC_READONLY
) == 0)
2162 flags
&= ~ SEC_READONLY
;
2164 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2166 && ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
2167 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
2168 || ((flags
& SEC_MERGE
)
2169 && output
->bfd_section
->entsize
!= section
->entsize
)))
2171 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2172 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2175 output
->bfd_section
->flags
|= flags
;
2177 if (flags
& SEC_MERGE
)
2178 output
->bfd_section
->entsize
= section
->entsize
;
2180 /* If SEC_READONLY is not set in the input section, then clear
2181 it from the output section. */
2182 if ((section
->flags
& SEC_READONLY
) == 0)
2183 output
->bfd_section
->flags
&= ~SEC_READONLY
;
2185 /* Copy over SEC_SMALL_DATA. */
2186 if (section
->flags
& SEC_SMALL_DATA
)
2187 output
->bfd_section
->flags
|= SEC_SMALL_DATA
;
2189 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
2190 output
->bfd_section
->alignment_power
= section
->alignment_power
;
2192 if (bfd_get_arch (section
->owner
) == bfd_arch_tic54x
2193 && (section
->flags
& SEC_TIC54X_BLOCK
) != 0)
2195 output
->bfd_section
->flags
|= SEC_TIC54X_BLOCK
;
2196 /* FIXME: This value should really be obtained from the bfd... */
2197 output
->block_value
= 128;
2202 /* Handle wildcard sorting. This returns the lang_input_section which
2203 should follow the one we are going to create for SECTION and FILE,
2204 based on the sorting requirements of WILD. It returns NULL if the
2205 new section should just go at the end of the current list. */
2207 static lang_statement_union_type
*
2208 wild_sort (lang_wild_statement_type
*wild
,
2209 struct wildcard_list
*sec
,
2210 lang_input_statement_type
*file
,
2213 const char *section_name
;
2214 lang_statement_union_type
*l
;
2216 if (!wild
->filenames_sorted
2217 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2220 section_name
= bfd_get_section_name (file
->the_bfd
, section
);
2221 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2223 lang_input_section_type
*ls
;
2225 if (l
->header
.type
!= lang_input_section_enum
)
2227 ls
= &l
->input_section
;
2229 /* Sorting by filename takes precedence over sorting by section
2232 if (wild
->filenames_sorted
)
2234 const char *fn
, *ln
;
2238 /* The PE support for the .idata section as generated by
2239 dlltool assumes that files will be sorted by the name of
2240 the archive and then the name of the file within the
2243 if (file
->the_bfd
!= NULL
2244 && bfd_my_archive (file
->the_bfd
) != NULL
)
2246 fn
= bfd_get_filename (bfd_my_archive (file
->the_bfd
));
2251 fn
= file
->filename
;
2255 if (bfd_my_archive (ls
->section
->owner
) != NULL
)
2257 ln
= bfd_get_filename (bfd_my_archive (ls
->section
->owner
));
2262 ln
= ls
->section
->owner
->filename
;
2266 i
= strcmp (fn
, ln
);
2275 fn
= file
->filename
;
2277 ln
= ls
->section
->owner
->filename
;
2279 i
= strcmp (fn
, ln
);
2287 /* Here either the files are not sorted by name, or we are
2288 looking at the sections for this file. */
2290 if (sec
!= NULL
&& sec
->spec
.sorted
!= none
)
2291 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2298 /* Expand a wild statement for a particular FILE. SECTION may be
2299 NULL, in which case it is a wild card. */
2302 output_section_callback (lang_wild_statement_type
*ptr
,
2303 struct wildcard_list
*sec
,
2305 lang_input_statement_type
*file
,
2308 lang_statement_union_type
*before
;
2310 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2311 if (unique_section_p (section
))
2314 before
= wild_sort (ptr
, sec
, file
, section
);
2316 /* Here BEFORE points to the lang_input_section which
2317 should follow the one we are about to add. If BEFORE
2318 is NULL, then the section should just go at the end
2319 of the current list. */
2322 lang_add_section (&ptr
->children
, section
,
2323 (lang_output_section_statement_type
*) output
);
2326 lang_statement_list_type list
;
2327 lang_statement_union_type
**pp
;
2329 lang_list_init (&list
);
2330 lang_add_section (&list
, section
,
2331 (lang_output_section_statement_type
*) output
);
2333 /* If we are discarding the section, LIST.HEAD will
2335 if (list
.head
!= NULL
)
2337 ASSERT (list
.head
->header
.next
== NULL
);
2339 for (pp
= &ptr
->children
.head
;
2341 pp
= &(*pp
)->header
.next
)
2342 ASSERT (*pp
!= NULL
);
2344 list
.head
->header
.next
= *pp
;
2350 /* Check if all sections in a wild statement for a particular FILE
2354 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2355 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2357 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2360 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2361 if (unique_section_p (section
))
2364 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2365 ((lang_output_section_statement_type
*) data
)->all_input_readonly
= FALSE
;
2368 /* This is passed a file name which must have been seen already and
2369 added to the statement tree. We will see if it has been opened
2370 already and had its symbols read. If not then we'll read it. */
2372 static lang_input_statement_type
*
2373 lookup_name (const char *name
)
2375 lang_input_statement_type
*search
;
2377 for (search
= (lang_input_statement_type
*) input_file_chain
.head
;
2379 search
= (lang_input_statement_type
*) search
->next_real_file
)
2381 /* Use the local_sym_name as the name of the file that has
2382 already been loaded as filename might have been transformed
2383 via the search directory lookup mechanism. */
2384 const char *filename
= search
->local_sym_name
;
2386 if (filename
!= NULL
2387 && strcmp (filename
, name
) == 0)
2392 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2393 default_target
, FALSE
);
2395 /* If we have already added this file, or this file is not real
2396 don't add this file. */
2397 if (search
->loaded
|| !search
->real
)
2400 if (! load_symbols (search
, NULL
))
2406 /* Save LIST as a list of libraries whose symbols should not be exported. */
2411 struct excluded_lib
*next
;
2413 static struct excluded_lib
*excluded_libs
;
2416 add_excluded_libs (const char *list
)
2418 const char *p
= list
, *end
;
2422 struct excluded_lib
*entry
;
2423 end
= strpbrk (p
, ",:");
2425 end
= p
+ strlen (p
);
2426 entry
= xmalloc (sizeof (*entry
));
2427 entry
->next
= excluded_libs
;
2428 entry
->name
= xmalloc (end
- p
+ 1);
2429 memcpy (entry
->name
, p
, end
- p
);
2430 entry
->name
[end
- p
] = '\0';
2431 excluded_libs
= entry
;
2439 check_excluded_libs (bfd
*abfd
)
2441 struct excluded_lib
*lib
= excluded_libs
;
2445 int len
= strlen (lib
->name
);
2446 const char *filename
= lbasename (abfd
->filename
);
2448 if (strcmp (lib
->name
, "ALL") == 0)
2450 abfd
->no_export
= TRUE
;
2454 if (strncmp (lib
->name
, filename
, len
) == 0
2455 && (filename
[len
] == '\0'
2456 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
2457 && filename
[len
+ 2] == '\0')))
2459 abfd
->no_export
= TRUE
;
2467 /* Get the symbols for an input file. */
2470 load_symbols (lang_input_statement_type
*entry
,
2471 lang_statement_list_type
*place
)
2478 ldfile_open_file (entry
);
2480 if (! bfd_check_format (entry
->the_bfd
, bfd_archive
)
2481 && ! bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
2484 lang_statement_list_type
*hold
;
2485 bfd_boolean bad_load
= TRUE
;
2486 bfd_boolean save_ldlang_sysrooted_script
;
2487 bfd_boolean save_as_needed
, save_add_needed
;
2489 err
= bfd_get_error ();
2491 /* See if the emulation has some special knowledge. */
2492 if (ldemul_unrecognized_file (entry
))
2495 if (err
== bfd_error_file_ambiguously_recognized
)
2499 einfo (_("%B: file not recognized: %E\n"), entry
->the_bfd
);
2500 einfo (_("%B: matching formats:"), entry
->the_bfd
);
2501 for (p
= matching
; *p
!= NULL
; p
++)
2505 else if (err
!= bfd_error_file_not_recognized
2507 einfo (_("%F%B: file not recognized: %E\n"), entry
->the_bfd
);
2511 bfd_close (entry
->the_bfd
);
2512 entry
->the_bfd
= NULL
;
2514 /* Try to interpret the file as a linker script. */
2515 ldfile_open_command_file (entry
->filename
);
2519 save_ldlang_sysrooted_script
= ldlang_sysrooted_script
;
2520 ldlang_sysrooted_script
= entry
->sysrooted
;
2521 save_as_needed
= as_needed
;
2522 as_needed
= entry
->as_needed
;
2523 save_add_needed
= add_needed
;
2524 add_needed
= entry
->add_needed
;
2526 ldfile_assumed_script
= TRUE
;
2527 parser_input
= input_script
;
2528 /* We want to use the same -Bdynamic/-Bstatic as the one for
2530 config
.dynamic_link
= entry
->dynamic
;
2532 ldfile_assumed_script
= FALSE
;
2534 ldlang_sysrooted_script
= save_ldlang_sysrooted_script
;
2535 as_needed
= save_as_needed
;
2536 add_needed
= save_add_needed
;
2542 if (ldemul_recognized_file (entry
))
2545 /* We don't call ldlang_add_file for an archive. Instead, the
2546 add_symbols entry point will call ldlang_add_file, via the
2547 add_archive_element callback, for each element of the archive
2549 switch (bfd_get_format (entry
->the_bfd
))
2555 ldlang_add_file (entry
);
2556 if (trace_files
|| trace_file_tries
)
2557 info_msg ("%I\n", entry
);
2561 check_excluded_libs (entry
->the_bfd
);
2563 if (entry
->whole_archive
)
2566 bfd_boolean loaded
= TRUE
;
2570 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
2575 if (! bfd_check_format (member
, bfd_object
))
2577 einfo (_("%F%B: member %B in archive is not an object\n"),
2578 entry
->the_bfd
, member
);
2582 if (! ((*link_info
.callbacks
->add_archive_element
)
2583 (&link_info
, member
, "--whole-archive")))
2586 if (! bfd_link_add_symbols (member
, &link_info
))
2588 einfo (_("%F%B: could not read symbols: %E\n"), member
);
2593 entry
->loaded
= loaded
;
2599 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
2600 entry
->loaded
= TRUE
;
2602 einfo (_("%F%B: could not read symbols: %E\n"), entry
->the_bfd
);
2604 return entry
->loaded
;
2607 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2608 may be NULL, indicating that it is a wildcard. Separate
2609 lang_input_section statements are created for each part of the
2610 expansion; they are added after the wild statement S. OUTPUT is
2611 the output section. */
2614 wild (lang_wild_statement_type
*s
,
2615 const char *target ATTRIBUTE_UNUSED
,
2616 lang_output_section_statement_type
*output
)
2618 struct wildcard_list
*sec
;
2620 if (s
->handler_data
[0]
2621 && s
->handler_data
[0]->spec
.sorted
== by_name
2622 && !s
->filenames_sorted
)
2624 lang_section_bst_type
*tree
;
2626 walk_wild (s
, output_section_callback_fast
, output
);
2631 output_section_callback_tree_to_list (s
, tree
, output
);
2636 walk_wild (s
, output_section_callback
, output
);
2638 if (default_common_section
== NULL
)
2639 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
2640 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
2642 /* Remember the section that common is going to in case we
2643 later get something which doesn't know where to put it. */
2644 default_common_section
= output
;
2649 /* Return TRUE iff target is the sought target. */
2652 get_target (const bfd_target
*target
, void *data
)
2654 const char *sought
= data
;
2656 return strcmp (target
->name
, sought
) == 0;
2659 /* Like strcpy() but convert to lower case as well. */
2662 stricpy (char *dest
, char *src
)
2666 while ((c
= *src
++) != 0)
2667 *dest
++ = TOLOWER (c
);
2672 /* Remove the first occurrence of needle (if any) in haystack
2676 strcut (char *haystack
, char *needle
)
2678 haystack
= strstr (haystack
, needle
);
2684 for (src
= haystack
+ strlen (needle
); *src
;)
2685 *haystack
++ = *src
++;
2691 /* Compare two target format name strings.
2692 Return a value indicating how "similar" they are. */
2695 name_compare (char *first
, char *second
)
2701 copy1
= xmalloc (strlen (first
) + 1);
2702 copy2
= xmalloc (strlen (second
) + 1);
2704 /* Convert the names to lower case. */
2705 stricpy (copy1
, first
);
2706 stricpy (copy2
, second
);
2708 /* Remove size and endian strings from the name. */
2709 strcut (copy1
, "big");
2710 strcut (copy1
, "little");
2711 strcut (copy2
, "big");
2712 strcut (copy2
, "little");
2714 /* Return a value based on how many characters match,
2715 starting from the beginning. If both strings are
2716 the same then return 10 * their length. */
2717 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
2718 if (copy1
[result
] == 0)
2730 /* Set by closest_target_match() below. */
2731 static const bfd_target
*winner
;
2733 /* Scan all the valid bfd targets looking for one that has the endianness
2734 requirement that was specified on the command line, and is the nearest
2735 match to the original output target. */
2738 closest_target_match (const bfd_target
*target
, void *data
)
2740 const bfd_target
*original
= data
;
2742 if (command_line
.endian
== ENDIAN_BIG
2743 && target
->byteorder
!= BFD_ENDIAN_BIG
)
2746 if (command_line
.endian
== ENDIAN_LITTLE
2747 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
2750 /* Must be the same flavour. */
2751 if (target
->flavour
!= original
->flavour
)
2754 /* Ignore generic big and little endian elf vectors. */
2755 if (strcmp (target
->name
, "elf32-big") == 0
2756 || strcmp (target
->name
, "elf64-big") == 0
2757 || strcmp (target
->name
, "elf32-little") == 0
2758 || strcmp (target
->name
, "elf64-little") == 0)
2761 /* If we have not found a potential winner yet, then record this one. */
2768 /* Oh dear, we now have two potential candidates for a successful match.
2769 Compare their names and choose the better one. */
2770 if (name_compare (target
->name
, original
->name
)
2771 > name_compare (winner
->name
, original
->name
))
2774 /* Keep on searching until wqe have checked them all. */
2778 /* Return the BFD target format of the first input file. */
2781 get_first_input_target (void)
2783 char *target
= NULL
;
2785 LANG_FOR_EACH_INPUT_STATEMENT (s
)
2787 if (s
->header
.type
== lang_input_statement_enum
2790 ldfile_open_file (s
);
2792 if (s
->the_bfd
!= NULL
2793 && bfd_check_format (s
->the_bfd
, bfd_object
))
2795 target
= bfd_get_target (s
->the_bfd
);
2807 lang_get_output_target (void)
2811 /* Has the user told us which output format to use? */
2812 if (output_target
!= NULL
)
2813 return output_target
;
2815 /* No - has the current target been set to something other than
2817 if (current_target
!= default_target
)
2818 return current_target
;
2820 /* No - can we determine the format of the first input file? */
2821 target
= get_first_input_target ();
2825 /* Failed - use the default output target. */
2826 return default_target
;
2829 /* Open the output file. */
2832 open_output (const char *name
)
2834 output_target
= lang_get_output_target ();
2836 /* Has the user requested a particular endianness on the command
2838 if (command_line
.endian
!= ENDIAN_UNSET
)
2840 const bfd_target
*target
;
2841 enum bfd_endian desired_endian
;
2843 /* Get the chosen target. */
2844 target
= bfd_search_for_target (get_target
, (void *) output_target
);
2846 /* If the target is not supported, we cannot do anything. */
2849 if (command_line
.endian
== ENDIAN_BIG
)
2850 desired_endian
= BFD_ENDIAN_BIG
;
2852 desired_endian
= BFD_ENDIAN_LITTLE
;
2854 /* See if the target has the wrong endianness. This should
2855 not happen if the linker script has provided big and
2856 little endian alternatives, but some scrips don't do
2858 if (target
->byteorder
!= desired_endian
)
2860 /* If it does, then see if the target provides
2861 an alternative with the correct endianness. */
2862 if (target
->alternative_target
!= NULL
2863 && (target
->alternative_target
->byteorder
== desired_endian
))
2864 output_target
= target
->alternative_target
->name
;
2867 /* Try to find a target as similar as possible to
2868 the default target, but which has the desired
2869 endian characteristic. */
2870 bfd_search_for_target (closest_target_match
,
2873 /* Oh dear - we could not find any targets that
2874 satisfy our requirements. */
2876 einfo (_("%P: warning: could not find any targets"
2877 " that match endianness requirement\n"));
2879 output_target
= winner
->name
;
2885 link_info
.output_bfd
= bfd_openw (name
, output_target
);
2887 if (link_info
.output_bfd
== NULL
)
2889 if (bfd_get_error () == bfd_error_invalid_target
)
2890 einfo (_("%P%F: target %s not found\n"), output_target
);
2892 einfo (_("%P%F: cannot open output file %s: %E\n"), name
);
2895 delete_output_file_on_failure
= TRUE
;
2897 if (! bfd_set_format (link_info
.output_bfd
, bfd_object
))
2898 einfo (_("%P%F:%s: can not make object file: %E\n"), name
);
2899 if (! bfd_set_arch_mach (link_info
.output_bfd
,
2900 ldfile_output_architecture
,
2901 ldfile_output_machine
))
2902 einfo (_("%P%F:%s: can not set architecture: %E\n"), name
);
2904 link_info
.hash
= bfd_link_hash_table_create (link_info
.output_bfd
);
2905 if (link_info
.hash
== NULL
)
2906 einfo (_("%P%F: can not create hash table: %E\n"));
2908 bfd_set_gp_size (link_info
.output_bfd
, g_switch_value
);
2912 ldlang_open_output (lang_statement_union_type
*statement
)
2914 switch (statement
->header
.type
)
2916 case lang_output_statement_enum
:
2917 ASSERT (link_info
.output_bfd
== NULL
);
2918 open_output (statement
->output_statement
.name
);
2919 ldemul_set_output_arch ();
2920 if (config
.magic_demand_paged
&& !link_info
.relocatable
)
2921 link_info
.output_bfd
->flags
|= D_PAGED
;
2923 link_info
.output_bfd
->flags
&= ~D_PAGED
;
2924 if (config
.text_read_only
)
2925 link_info
.output_bfd
->flags
|= WP_TEXT
;
2927 link_info
.output_bfd
->flags
&= ~WP_TEXT
;
2928 if (link_info
.traditional_format
)
2929 link_info
.output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
2931 link_info
.output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
2934 case lang_target_statement_enum
:
2935 current_target
= statement
->target_statement
.target
;
2942 /* Convert between addresses in bytes and sizes in octets.
2943 For currently supported targets, octets_per_byte is always a power
2944 of two, so we can use shifts. */
2945 #define TO_ADDR(X) ((X) >> opb_shift)
2946 #define TO_SIZE(X) ((X) << opb_shift)
2948 /* Support the above. */
2949 static unsigned int opb_shift
= 0;
2954 unsigned x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
2955 ldfile_output_machine
);
2958 while ((x
& 1) == 0)
2966 /* Open all the input files. */
2969 open_input_bfds (lang_statement_union_type
*s
, bfd_boolean force
)
2971 for (; s
!= NULL
; s
= s
->header
.next
)
2973 switch (s
->header
.type
)
2975 case lang_constructors_statement_enum
:
2976 open_input_bfds (constructor_list
.head
, force
);
2978 case lang_output_section_statement_enum
:
2979 open_input_bfds (s
->output_section_statement
.children
.head
, force
);
2981 case lang_wild_statement_enum
:
2982 /* Maybe we should load the file's symbols. */
2983 if (s
->wild_statement
.filename
2984 && !wildcardp (s
->wild_statement
.filename
)
2985 && !archive_path (s
->wild_statement
.filename
))
2986 lookup_name (s
->wild_statement
.filename
);
2987 open_input_bfds (s
->wild_statement
.children
.head
, force
);
2989 case lang_group_statement_enum
:
2991 struct bfd_link_hash_entry
*undefs
;
2993 /* We must continually search the entries in the group
2994 until no new symbols are added to the list of undefined
2999 undefs
= link_info
.hash
->undefs_tail
;
3000 open_input_bfds (s
->group_statement
.children
.head
, TRUE
);
3002 while (undefs
!= link_info
.hash
->undefs_tail
);
3005 case lang_target_statement_enum
:
3006 current_target
= s
->target_statement
.target
;
3008 case lang_input_statement_enum
:
3009 if (s
->input_statement
.real
)
3011 lang_statement_list_type add
;
3013 s
->input_statement
.target
= current_target
;
3015 /* If we are being called from within a group, and this
3016 is an archive which has already been searched, then
3017 force it to be researched unless the whole archive
3018 has been loaded already. */
3020 && !s
->input_statement
.whole_archive
3021 && s
->input_statement
.loaded
3022 && bfd_check_format (s
->input_statement
.the_bfd
,
3024 s
->input_statement
.loaded
= FALSE
;
3026 lang_list_init (&add
);
3028 if (! load_symbols (&s
->input_statement
, &add
))
3029 config
.make_executable
= FALSE
;
3031 if (add
.head
!= NULL
)
3033 *add
.tail
= s
->header
.next
;
3034 s
->header
.next
= add
.head
;
3044 /* Add a symbol to a hash of symbols used in DEFINED (NAME) expressions. */
3047 lang_track_definedness (const char *name
)
3049 if (bfd_hash_lookup (&lang_definedness_table
, name
, TRUE
, FALSE
) == NULL
)
3050 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name
);
3053 /* New-function for the definedness hash table. */
3055 static struct bfd_hash_entry
*
3056 lang_definedness_newfunc (struct bfd_hash_entry
*entry
,
3057 struct bfd_hash_table
*table ATTRIBUTE_UNUSED
,
3058 const char *name ATTRIBUTE_UNUSED
)
3060 struct lang_definedness_hash_entry
*ret
3061 = (struct lang_definedness_hash_entry
*) entry
;
3064 ret
= (struct lang_definedness_hash_entry
*)
3065 bfd_hash_allocate (table
, sizeof (struct lang_definedness_hash_entry
));
3068 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name
);
3070 ret
->iteration
= -1;
3074 /* Return the iteration when the definition of NAME was last updated. A
3075 value of -1 means that the symbol is not defined in the linker script
3076 or the command line, but may be defined in the linker symbol table. */
3079 lang_symbol_definition_iteration (const char *name
)
3081 struct lang_definedness_hash_entry
*defentry
3082 = (struct lang_definedness_hash_entry
*)
3083 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
3085 /* We've already created this one on the presence of DEFINED in the
3086 script, so it can't be NULL unless something is borked elsewhere in
3088 if (defentry
== NULL
)
3091 return defentry
->iteration
;
3094 /* Update the definedness state of NAME. */
3097 lang_update_definedness (const char *name
, struct bfd_link_hash_entry
*h
)
3099 struct lang_definedness_hash_entry
*defentry
3100 = (struct lang_definedness_hash_entry
*)
3101 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
3103 /* We don't keep track of symbols not tested with DEFINED. */
3104 if (defentry
== NULL
)
3107 /* If the symbol was already defined, and not from an earlier statement
3108 iteration, don't update the definedness iteration, because that'd
3109 make the symbol seem defined in the linker script at this point, and
3110 it wasn't; it was defined in some object. If we do anyway, DEFINED
3111 would start to yield false before this point and the construct "sym =
3112 DEFINED (sym) ? sym : X;" would change sym to X despite being defined
3114 if (h
->type
!= bfd_link_hash_undefined
3115 && h
->type
!= bfd_link_hash_common
3116 && h
->type
!= bfd_link_hash_new
3117 && defentry
->iteration
== -1)
3120 defentry
->iteration
= lang_statement_iteration
;
3123 /* Add the supplied name to the symbol table as an undefined reference.
3124 This is a two step process as the symbol table doesn't even exist at
3125 the time the ld command line is processed. First we put the name
3126 on a list, then, once the output file has been opened, transfer the
3127 name to the symbol table. */
3129 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
3131 #define ldlang_undef_chain_list_head entry_symbol.next
3134 ldlang_add_undef (const char *const name
)
3136 ldlang_undef_chain_list_type
*new =
3137 stat_alloc (sizeof (ldlang_undef_chain_list_type
));
3139 new->next
= ldlang_undef_chain_list_head
;
3140 ldlang_undef_chain_list_head
= new;
3142 new->name
= xstrdup (name
);
3144 if (link_info
.output_bfd
!= NULL
)
3145 insert_undefined (new->name
);
3148 /* Insert NAME as undefined in the symbol table. */
3151 insert_undefined (const char *name
)
3153 struct bfd_link_hash_entry
*h
;
3155 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
3157 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
3158 if (h
->type
== bfd_link_hash_new
)
3160 h
->type
= bfd_link_hash_undefined
;
3161 h
->u
.undef
.abfd
= NULL
;
3162 bfd_link_add_undef (link_info
.hash
, h
);
3166 /* Run through the list of undefineds created above and place them
3167 into the linker hash table as undefined symbols belonging to the
3171 lang_place_undefineds (void)
3173 ldlang_undef_chain_list_type
*ptr
;
3175 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
3176 insert_undefined (ptr
->name
);
3179 /* Check for all readonly or some readwrite sections. */
3182 check_input_sections
3183 (lang_statement_union_type
*s
,
3184 lang_output_section_statement_type
*output_section_statement
)
3186 for (; s
!= (lang_statement_union_type
*) NULL
; s
= s
->header
.next
)
3188 switch (s
->header
.type
)
3190 case lang_wild_statement_enum
:
3191 walk_wild (&s
->wild_statement
, check_section_callback
,
3192 output_section_statement
);
3193 if (! output_section_statement
->all_input_readonly
)
3196 case lang_constructors_statement_enum
:
3197 check_input_sections (constructor_list
.head
,
3198 output_section_statement
);
3199 if (! output_section_statement
->all_input_readonly
)
3202 case lang_group_statement_enum
:
3203 check_input_sections (s
->group_statement
.children
.head
,
3204 output_section_statement
);
3205 if (! output_section_statement
->all_input_readonly
)
3214 /* Update wildcard statements if needed. */
3217 update_wild_statements (lang_statement_union_type
*s
)
3219 struct wildcard_list
*sec
;
3221 switch (sort_section
)
3231 for (; s
!= NULL
; s
= s
->header
.next
)
3233 switch (s
->header
.type
)
3238 case lang_wild_statement_enum
:
3239 sec
= s
->wild_statement
.section_list
;
3240 for (sec
= s
->wild_statement
.section_list
; sec
!= NULL
;
3243 switch (sec
->spec
.sorted
)
3246 sec
->spec
.sorted
= sort_section
;
3249 if (sort_section
== by_alignment
)
3250 sec
->spec
.sorted
= by_name_alignment
;
3253 if (sort_section
== by_name
)
3254 sec
->spec
.sorted
= by_alignment_name
;
3262 case lang_constructors_statement_enum
:
3263 update_wild_statements (constructor_list
.head
);
3266 case lang_output_section_statement_enum
:
3267 update_wild_statements
3268 (s
->output_section_statement
.children
.head
);
3271 case lang_group_statement_enum
:
3272 update_wild_statements (s
->group_statement
.children
.head
);
3280 /* Open input files and attach to output sections. */
3283 map_input_to_output_sections
3284 (lang_statement_union_type
*s
, const char *target
,
3285 lang_output_section_statement_type
*os
)
3289 for (; s
!= NULL
; s
= s
->header
.next
)
3291 switch (s
->header
.type
)
3293 case lang_wild_statement_enum
:
3294 wild (&s
->wild_statement
, target
, os
);
3296 case lang_constructors_statement_enum
:
3297 map_input_to_output_sections (constructor_list
.head
,
3301 case lang_output_section_statement_enum
:
3302 if (s
->output_section_statement
.constraint
)
3304 if (s
->output_section_statement
.constraint
!= ONLY_IF_RW
3305 && s
->output_section_statement
.constraint
!= ONLY_IF_RO
)
3307 s
->output_section_statement
.all_input_readonly
= TRUE
;
3308 check_input_sections (s
->output_section_statement
.children
.head
,
3309 &s
->output_section_statement
);
3310 if ((s
->output_section_statement
.all_input_readonly
3311 && s
->output_section_statement
.constraint
== ONLY_IF_RW
)
3312 || (!s
->output_section_statement
.all_input_readonly
3313 && s
->output_section_statement
.constraint
== ONLY_IF_RO
))
3315 s
->output_section_statement
.constraint
= -1;
3320 map_input_to_output_sections (s
->output_section_statement
.children
.head
,
3322 &s
->output_section_statement
);
3324 case lang_output_statement_enum
:
3326 case lang_target_statement_enum
:
3327 target
= s
->target_statement
.target
;
3329 case lang_group_statement_enum
:
3330 map_input_to_output_sections (s
->group_statement
.children
.head
,
3334 case lang_data_statement_enum
:
3335 /* Make sure that any sections mentioned in the expression
3337 exp_init_os (s
->data_statement
.exp
);
3338 flags
= SEC_HAS_CONTENTS
;
3339 /* The output section gets contents, and then we inspect for
3340 any flags set in the input script which override any ALLOC. */
3341 if (!(os
->flags
& SEC_NEVER_LOAD
))
3342 flags
|= SEC_ALLOC
| SEC_LOAD
;
3343 if (os
->bfd_section
== NULL
)
3344 init_os (os
, NULL
, flags
);
3346 os
->bfd_section
->flags
|= flags
;
3348 case lang_input_section_enum
:
3350 case lang_fill_statement_enum
:
3351 case lang_object_symbols_statement_enum
:
3352 case lang_reloc_statement_enum
:
3353 case lang_padding_statement_enum
:
3354 case lang_input_statement_enum
:
3355 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3356 init_os (os
, NULL
, 0);
3358 case lang_assignment_statement_enum
:
3359 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3360 init_os (os
, NULL
, 0);
3362 /* Make sure that any sections mentioned in the assignment
3364 exp_init_os (s
->assignment_statement
.exp
);
3366 case lang_address_statement_enum
:
3367 /* Mark the specified section with the supplied address.
3368 If this section was actually a segment marker, then the
3369 directive is ignored if the linker script explicitly
3370 processed the segment marker. Originally, the linker
3371 treated segment directives (like -Ttext on the
3372 command-line) as section directives. We honor the
3373 section directive semantics for backwards compatibilty;
3374 linker scripts that do not specifically check for
3375 SEGMENT_START automatically get the old semantics. */
3376 if (!s
->address_statement
.segment
3377 || !s
->address_statement
.segment
->used
)
3379 lang_output_section_statement_type
*aos
3380 = (lang_output_section_statement_lookup
3381 (s
->address_statement
.section_name
));
3383 if (aos
->bfd_section
== NULL
)
3384 init_os (aos
, NULL
, 0);
3385 aos
->addr_tree
= s
->address_statement
.address
;
3388 case lang_insert_statement_enum
:
3394 /* An insert statement snips out all the linker statements from the
3395 start of the list and places them after the output section
3396 statement specified by the insert. This operation is complicated
3397 by the fact that we keep a doubly linked list of output section
3398 statements as well as the singly linked list of all statements. */
3401 process_insert_statements (void)
3403 lang_statement_union_type
**s
;
3404 lang_output_section_statement_type
*first_os
= NULL
;
3405 lang_output_section_statement_type
*last_os
= NULL
;
3407 /* "start of list" is actually the statement immediately after
3408 the special abs_section output statement, so that it isn't
3410 s
= &lang_output_section_statement
.head
;
3411 while (*(s
= &(*s
)->header
.next
) != NULL
)
3413 if ((*s
)->header
.type
== lang_output_section_statement_enum
)
3415 /* Keep pointers to the first and last output section
3416 statement in the sequence we may be about to move. */
3417 last_os
= &(*s
)->output_section_statement
;
3418 if (first_os
== NULL
)
3421 else if ((*s
)->header
.type
== lang_insert_statement_enum
)
3423 lang_insert_statement_type
*i
= &(*s
)->insert_statement
;
3424 lang_output_section_statement_type
*where
;
3425 lang_output_section_statement_type
*os
;
3426 lang_statement_union_type
**ptr
;
3427 lang_statement_union_type
*first
;
3429 where
= lang_output_section_find (i
->where
);
3430 if (where
!= NULL
&& i
->is_before
)
3433 where
= where
->prev
;
3434 while (where
!= NULL
&& where
->constraint
== -1);
3438 einfo (_("%X%P: %s not found for insert\n"), i
->where
);
3441 /* You can't insert into the list you are moving. */
3442 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3443 if (os
== where
|| os
== last_os
)
3447 einfo (_("%X%P: %s not found for insert\n"), i
->where
);
3451 /* Deal with reordering the output section statement list. */
3452 if (last_os
!= NULL
)
3454 asection
*first_sec
, *last_sec
;
3455 struct lang_output_section_statement_struct
**next
;
3457 /* Snip out the output sections we are moving. */
3458 first_os
->prev
->next
= last_os
->next
;
3459 if (last_os
->next
== NULL
)
3461 next
= &first_os
->prev
->next
;
3462 lang_output_section_statement
.tail
3463 = (lang_statement_union_type
**) next
;
3466 last_os
->next
->prev
= first_os
->prev
;
3467 /* Add them in at the new position. */
3468 last_os
->next
= where
->next
;
3469 if (where
->next
== NULL
)
3471 next
= &last_os
->next
;
3472 lang_output_section_statement
.tail
3473 = (lang_statement_union_type
**) next
;
3476 where
->next
->prev
= last_os
;
3477 first_os
->prev
= where
;
3478 where
->next
= first_os
;
3480 /* Move the bfd sections in the same way. */
3483 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3485 if (os
->bfd_section
!= NULL
3486 && os
->bfd_section
->owner
!= NULL
)
3488 last_sec
= os
->bfd_section
;
3489 if (first_sec
== NULL
)
3490 first_sec
= last_sec
;
3495 if (last_sec
!= NULL
)
3497 asection
*sec
= where
->bfd_section
;
3499 sec
= output_prev_sec_find (where
);
3501 /* The place we want to insert must come after the
3502 sections we are moving. So if we find no
3503 section or if the section is the same as our
3504 last section, then no move is needed. */
3505 if (sec
!= NULL
&& sec
!= last_sec
)
3507 /* Trim them off. */
3508 if (first_sec
->prev
!= NULL
)
3509 first_sec
->prev
->next
= last_sec
->next
;
3511 link_info
.output_bfd
->sections
= last_sec
->next
;
3512 if (last_sec
->next
!= NULL
)
3513 last_sec
->next
->prev
= first_sec
->prev
;
3515 link_info
.output_bfd
->section_last
= first_sec
->prev
;
3517 last_sec
->next
= sec
->next
;
3518 if (sec
->next
!= NULL
)
3519 sec
->next
->prev
= last_sec
;
3521 link_info
.output_bfd
->section_last
= last_sec
;
3522 first_sec
->prev
= sec
;
3523 sec
->next
= first_sec
;
3531 ptr
= insert_os_after (where
);
3532 /* Snip everything after the abs_section output statement we
3533 know is at the start of the list, up to and including
3534 the insert statement we are currently processing. */
3535 first
= lang_output_section_statement
.head
->header
.next
;
3536 lang_output_section_statement
.head
->header
.next
= (*s
)->header
.next
;
3537 /* Add them back where they belong. */
3540 statement_list
.tail
= s
;
3542 s
= &lang_output_section_statement
.head
;
3547 /* An output section might have been removed after its statement was
3548 added. For example, ldemul_before_allocation can remove dynamic
3549 sections if they turn out to be not needed. Clean them up here. */
3552 strip_excluded_output_sections (void)
3554 lang_output_section_statement_type
*os
;
3556 /* Run lang_size_sections (if not already done). */
3557 if (expld
.phase
!= lang_mark_phase_enum
)
3559 expld
.phase
= lang_mark_phase_enum
;
3560 expld
.dataseg
.phase
= exp_dataseg_none
;
3561 one_lang_size_sections_pass (NULL
, FALSE
);
3562 lang_reset_memory_regions ();
3565 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3569 asection
*output_section
;
3570 bfd_boolean exclude
;
3572 if (os
->constraint
== -1)
3575 output_section
= os
->bfd_section
;
3576 if (output_section
== NULL
)
3579 exclude
= (output_section
->rawsize
== 0
3580 && (output_section
->flags
& SEC_KEEP
) == 0
3581 && !bfd_section_removed_from_list (link_info
.output_bfd
,
3584 /* Some sections have not yet been sized, notably .gnu.version,
3585 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3586 input sections, so don't drop output sections that have such
3587 input sections unless they are also marked SEC_EXCLUDE. */
3588 if (exclude
&& output_section
->map_head
.s
!= NULL
)
3592 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
3593 if ((s
->flags
& SEC_LINKER_CREATED
) != 0
3594 && (s
->flags
& SEC_EXCLUDE
) == 0)
3601 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3602 output_section
->map_head
.link_order
= NULL
;
3603 output_section
->map_tail
.link_order
= NULL
;
3607 /* We don't set bfd_section to NULL since bfd_section of the
3608 removed output section statement may still be used. */
3609 if (!os
->section_relative_symbol
3610 && !os
->update_dot_tree
)
3612 output_section
->flags
|= SEC_EXCLUDE
;
3613 bfd_section_list_remove (link_info
.output_bfd
, output_section
);
3614 link_info
.output_bfd
->section_count
--;
3618 /* Stop future calls to lang_add_section from messing with map_head
3619 and map_tail link_order fields. */
3620 stripped_excluded_sections
= TRUE
;
3624 print_output_section_statement
3625 (lang_output_section_statement_type
*output_section_statement
)
3627 asection
*section
= output_section_statement
->bfd_section
;
3630 if (output_section_statement
!= abs_output_section
)
3632 minfo ("\n%s", output_section_statement
->name
);
3634 if (section
!= NULL
)
3636 print_dot
= section
->vma
;
3638 len
= strlen (output_section_statement
->name
);
3639 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3644 while (len
< SECTION_NAME_MAP_LENGTH
)
3650 minfo ("0x%V %W", section
->vma
, section
->size
);
3652 if (section
->vma
!= section
->lma
)
3653 minfo (_(" load address 0x%V"), section
->lma
);
3655 if (output_section_statement
->update_dot_tree
!= NULL
)
3656 exp_fold_tree (output_section_statement
->update_dot_tree
,
3657 bfd_abs_section_ptr
, &print_dot
);
3663 print_statement_list (output_section_statement
->children
.head
,
3664 output_section_statement
);
3667 /* Scan for the use of the destination in the right hand side
3668 of an expression. In such cases we will not compute the
3669 correct expression, since the value of DST that is used on
3670 the right hand side will be its final value, not its value
3671 just before this expression is evaluated. */
3674 scan_for_self_assignment (const char * dst
, etree_type
* rhs
)
3676 if (rhs
== NULL
|| dst
== NULL
)
3679 switch (rhs
->type
.node_class
)
3682 return scan_for_self_assignment (dst
, rhs
->binary
.lhs
)
3683 || scan_for_self_assignment (dst
, rhs
->binary
.rhs
);
3686 return scan_for_self_assignment (dst
, rhs
->trinary
.lhs
)
3687 || scan_for_self_assignment (dst
, rhs
->trinary
.rhs
);
3690 case etree_provided
:
3692 if (strcmp (dst
, rhs
->assign
.dst
) == 0)
3694 return scan_for_self_assignment (dst
, rhs
->assign
.src
);
3697 return scan_for_self_assignment (dst
, rhs
->unary
.child
);
3701 return strcmp (dst
, rhs
->value
.str
) == 0;
3706 return strcmp (dst
, rhs
->name
.name
) == 0;
3718 print_assignment (lang_assignment_statement_type
*assignment
,
3719 lang_output_section_statement_type
*output_section
)
3723 bfd_boolean computation_is_valid
= TRUE
;
3726 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3729 if (assignment
->exp
->type
.node_class
== etree_assert
)
3732 tree
= assignment
->exp
->assert_s
.child
;
3733 computation_is_valid
= TRUE
;
3737 const char *dst
= assignment
->exp
->assign
.dst
;
3739 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
3740 tree
= assignment
->exp
->assign
.src
;
3741 computation_is_valid
= is_dot
|| (scan_for_self_assignment (dst
, tree
) == FALSE
);
3744 exp_fold_tree (tree
, output_section
->bfd_section
, &print_dot
);
3745 if (expld
.result
.valid_p
)
3749 if (computation_is_valid
)
3751 value
= expld
.result
.value
;
3753 if (expld
.result
.section
)
3754 value
+= expld
.result
.section
->vma
;
3756 minfo ("0x%V", value
);
3762 struct bfd_link_hash_entry
*h
;
3764 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
3765 FALSE
, FALSE
, TRUE
);
3768 value
= h
->u
.def
.value
;
3770 if (expld
.result
.section
)
3771 value
+= expld
.result
.section
->vma
;
3773 minfo ("[0x%V]", value
);
3776 minfo ("[unresolved]");
3788 exp_print_tree (assignment
->exp
);
3793 print_input_statement (lang_input_statement_type
*statm
)
3795 if (statm
->filename
!= NULL
3796 && (statm
->the_bfd
== NULL
3797 || (statm
->the_bfd
->flags
& BFD_LINKER_CREATED
) == 0))
3798 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
3801 /* Print all symbols defined in a particular section. This is called
3802 via bfd_link_hash_traverse, or by print_all_symbols. */
3805 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
3807 asection
*sec
= ptr
;
3809 if ((hash_entry
->type
== bfd_link_hash_defined
3810 || hash_entry
->type
== bfd_link_hash_defweak
)
3811 && sec
== hash_entry
->u
.def
.section
)
3815 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3818 (hash_entry
->u
.def
.value
3819 + hash_entry
->u
.def
.section
->output_offset
3820 + hash_entry
->u
.def
.section
->output_section
->vma
));
3822 minfo (" %T\n", hash_entry
->root
.string
);
3829 print_all_symbols (asection
*sec
)
3831 struct fat_user_section_struct
*ud
= get_userdata (sec
);
3832 struct map_symbol_def
*def
;
3837 *ud
->map_symbol_def_tail
= 0;
3838 for (def
= ud
->map_symbol_def_head
; def
; def
= def
->next
)
3839 print_one_symbol (def
->entry
, sec
);
3842 /* Print information about an input section to the map file. */
3845 print_input_section (asection
*i
)
3847 bfd_size_type size
= i
->size
;
3854 minfo ("%s", i
->name
);
3856 len
= 1 + strlen (i
->name
);
3857 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3862 while (len
< SECTION_NAME_MAP_LENGTH
)
3868 if (i
->output_section
!= NULL
3869 && i
->output_section
->owner
== link_info
.output_bfd
)
3870 addr
= i
->output_section
->vma
+ i
->output_offset
;
3877 minfo ("0x%V %W %B\n", addr
, TO_ADDR (size
), i
->owner
);
3879 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
3881 len
= SECTION_NAME_MAP_LENGTH
+ 3;
3893 minfo (_("%W (size before relaxing)\n"), i
->rawsize
);
3896 if (i
->output_section
!= NULL
3897 && i
->output_section
->owner
== link_info
.output_bfd
)
3899 if (link_info
.reduce_memory_overheads
)
3900 bfd_link_hash_traverse (link_info
.hash
, print_one_symbol
, i
);
3902 print_all_symbols (i
);
3904 /* Update print_dot, but make sure that we do not move it
3905 backwards - this could happen if we have overlays and a
3906 later overlay is shorter than an earier one. */
3907 if (addr
+ TO_ADDR (size
) > print_dot
)
3908 print_dot
= addr
+ TO_ADDR (size
);
3913 print_fill_statement (lang_fill_statement_type
*fill
)
3917 fputs (" FILL mask 0x", config
.map_file
);
3918 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
3919 fprintf (config
.map_file
, "%02x", *p
);
3920 fputs ("\n", config
.map_file
);
3924 print_data_statement (lang_data_statement_type
*data
)
3932 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3935 addr
= data
->output_offset
;
3936 if (data
->output_section
!= NULL
)
3937 addr
+= data
->output_section
->vma
;
3965 minfo ("0x%V %W %s 0x%v", addr
, size
, name
, data
->value
);
3967 if (data
->exp
->type
.node_class
!= etree_value
)
3970 exp_print_tree (data
->exp
);
3975 print_dot
= addr
+ TO_ADDR (size
);
3978 /* Print an address statement. These are generated by options like
3982 print_address_statement (lang_address_statement_type
*address
)
3984 minfo (_("Address of section %s set to "), address
->section_name
);
3985 exp_print_tree (address
->address
);
3989 /* Print a reloc statement. */
3992 print_reloc_statement (lang_reloc_statement_type
*reloc
)
3999 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4002 addr
= reloc
->output_offset
;
4003 if (reloc
->output_section
!= NULL
)
4004 addr
+= reloc
->output_section
->vma
;
4006 size
= bfd_get_reloc_size (reloc
->howto
);
4008 minfo ("0x%V %W RELOC %s ", addr
, size
, reloc
->howto
->name
);
4010 if (reloc
->name
!= NULL
)
4011 minfo ("%s+", reloc
->name
);
4013 minfo ("%s+", reloc
->section
->name
);
4015 exp_print_tree (reloc
->addend_exp
);
4019 print_dot
= addr
+ TO_ADDR (size
);
4023 print_padding_statement (lang_padding_statement_type
*s
)
4031 len
= sizeof " *fill*" - 1;
4032 while (len
< SECTION_NAME_MAP_LENGTH
)
4038 addr
= s
->output_offset
;
4039 if (s
->output_section
!= NULL
)
4040 addr
+= s
->output_section
->vma
;
4041 minfo ("0x%V %W ", addr
, (bfd_vma
) s
->size
);
4043 if (s
->fill
->size
!= 0)
4047 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
4048 fprintf (config
.map_file
, "%02x", *p
);
4053 print_dot
= addr
+ TO_ADDR (s
->size
);
4057 print_wild_statement (lang_wild_statement_type
*w
,
4058 lang_output_section_statement_type
*os
)
4060 struct wildcard_list
*sec
;
4064 if (w
->filenames_sorted
)
4066 if (w
->filename
!= NULL
)
4067 minfo ("%s", w
->filename
);
4070 if (w
->filenames_sorted
)
4074 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
4076 if (sec
->spec
.sorted
)
4078 if (sec
->spec
.exclude_name_list
!= NULL
)
4081 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
4082 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
4083 minfo (" %s", tmp
->name
);
4086 if (sec
->spec
.name
!= NULL
)
4087 minfo ("%s", sec
->spec
.name
);
4090 if (sec
->spec
.sorted
)
4099 print_statement_list (w
->children
.head
, os
);
4102 /* Print a group statement. */
4105 print_group (lang_group_statement_type
*s
,
4106 lang_output_section_statement_type
*os
)
4108 fprintf (config
.map_file
, "START GROUP\n");
4109 print_statement_list (s
->children
.head
, os
);
4110 fprintf (config
.map_file
, "END GROUP\n");
4113 /* Print the list of statements in S.
4114 This can be called for any statement type. */
4117 print_statement_list (lang_statement_union_type
*s
,
4118 lang_output_section_statement_type
*os
)
4122 print_statement (s
, os
);
4127 /* Print the first statement in statement list S.
4128 This can be called for any statement type. */
4131 print_statement (lang_statement_union_type
*s
,
4132 lang_output_section_statement_type
*os
)
4134 switch (s
->header
.type
)
4137 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
4140 case lang_constructors_statement_enum
:
4141 if (constructor_list
.head
!= NULL
)
4143 if (constructors_sorted
)
4144 minfo (" SORT (CONSTRUCTORS)\n");
4146 minfo (" CONSTRUCTORS\n");
4147 print_statement_list (constructor_list
.head
, os
);
4150 case lang_wild_statement_enum
:
4151 print_wild_statement (&s
->wild_statement
, os
);
4153 case lang_address_statement_enum
:
4154 print_address_statement (&s
->address_statement
);
4156 case lang_object_symbols_statement_enum
:
4157 minfo (" CREATE_OBJECT_SYMBOLS\n");
4159 case lang_fill_statement_enum
:
4160 print_fill_statement (&s
->fill_statement
);
4162 case lang_data_statement_enum
:
4163 print_data_statement (&s
->data_statement
);
4165 case lang_reloc_statement_enum
:
4166 print_reloc_statement (&s
->reloc_statement
);
4168 case lang_input_section_enum
:
4169 print_input_section (s
->input_section
.section
);
4171 case lang_padding_statement_enum
:
4172 print_padding_statement (&s
->padding_statement
);
4174 case lang_output_section_statement_enum
:
4175 print_output_section_statement (&s
->output_section_statement
);
4177 case lang_assignment_statement_enum
:
4178 print_assignment (&s
->assignment_statement
, os
);
4180 case lang_target_statement_enum
:
4181 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
4183 case lang_output_statement_enum
:
4184 minfo ("OUTPUT(%s", s
->output_statement
.name
);
4185 if (output_target
!= NULL
)
4186 minfo (" %s", output_target
);
4189 case lang_input_statement_enum
:
4190 print_input_statement (&s
->input_statement
);
4192 case lang_group_statement_enum
:
4193 print_group (&s
->group_statement
, os
);
4195 case lang_insert_statement_enum
:
4196 minfo ("INSERT %s %s\n",
4197 s
->insert_statement
.is_before
? "BEFORE" : "AFTER",
4198 s
->insert_statement
.where
);
4204 print_statements (void)
4206 print_statement_list (statement_list
.head
, abs_output_section
);
4209 /* Print the first N statements in statement list S to STDERR.
4210 If N == 0, nothing is printed.
4211 If N < 0, the entire list is printed.
4212 Intended to be called from GDB. */
4215 dprint_statement (lang_statement_union_type
*s
, int n
)
4217 FILE *map_save
= config
.map_file
;
4219 config
.map_file
= stderr
;
4222 print_statement_list (s
, abs_output_section
);
4225 while (s
&& --n
>= 0)
4227 print_statement (s
, abs_output_section
);
4232 config
.map_file
= map_save
;
4236 insert_pad (lang_statement_union_type
**ptr
,
4238 unsigned int alignment_needed
,
4239 asection
*output_section
,
4242 static fill_type zero_fill
= { 1, { 0 } };
4243 lang_statement_union_type
*pad
= NULL
;
4245 if (ptr
!= &statement_list
.head
)
4246 pad
= ((lang_statement_union_type
*)
4247 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
4249 && pad
->header
.type
== lang_padding_statement_enum
4250 && pad
->padding_statement
.output_section
== output_section
)
4252 /* Use the existing pad statement. */
4254 else if ((pad
= *ptr
) != NULL
4255 && pad
->header
.type
== lang_padding_statement_enum
4256 && pad
->padding_statement
.output_section
== output_section
)
4258 /* Use the existing pad statement. */
4262 /* Make a new padding statement, linked into existing chain. */
4263 pad
= stat_alloc (sizeof (lang_padding_statement_type
));
4264 pad
->header
.next
= *ptr
;
4266 pad
->header
.type
= lang_padding_statement_enum
;
4267 pad
->padding_statement
.output_section
= output_section
;
4270 pad
->padding_statement
.fill
= fill
;
4272 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
4273 pad
->padding_statement
.size
= alignment_needed
;
4274 output_section
->size
+= alignment_needed
;
4277 /* Work out how much this section will move the dot point. */
4281 (lang_statement_union_type
**this_ptr
,
4282 lang_output_section_statement_type
*output_section_statement
,
4286 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
4287 asection
*i
= is
->section
;
4289 if (!((lang_input_statement_type
*) i
->owner
->usrdata
)->just_syms_flag
4290 && (i
->flags
& SEC_EXCLUDE
) == 0)
4292 unsigned int alignment_needed
;
4295 /* Align this section first to the input sections requirement,
4296 then to the output section's requirement. If this alignment
4297 is greater than any seen before, then record it too. Perform
4298 the alignment by inserting a magic 'padding' statement. */
4300 if (output_section_statement
->subsection_alignment
!= -1)
4301 i
->alignment_power
= output_section_statement
->subsection_alignment
;
4303 o
= output_section_statement
->bfd_section
;
4304 if (o
->alignment_power
< i
->alignment_power
)
4305 o
->alignment_power
= i
->alignment_power
;
4307 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
4309 if (alignment_needed
!= 0)
4311 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
4312 dot
+= alignment_needed
;
4315 /* Remember where in the output section this input section goes. */
4317 i
->output_offset
= dot
- o
->vma
;
4319 /* Mark how big the output section must be to contain this now. */
4320 dot
+= TO_ADDR (i
->size
);
4321 o
->size
= TO_SIZE (dot
- o
->vma
);
4325 i
->output_offset
= i
->vma
- output_section_statement
->bfd_section
->vma
;
4332 sort_sections_by_lma (const void *arg1
, const void *arg2
)
4334 const asection
*sec1
= *(const asection
**) arg1
;
4335 const asection
*sec2
= *(const asection
**) arg2
;
4337 if (bfd_section_lma (sec1
->owner
, sec1
)
4338 < bfd_section_lma (sec2
->owner
, sec2
))
4340 else if (bfd_section_lma (sec1
->owner
, sec1
)
4341 > bfd_section_lma (sec2
->owner
, sec2
))
4343 else if (sec1
->id
< sec2
->id
)
4345 else if (sec1
->id
> sec2
->id
)
4351 #define IGNORE_SECTION(s) \
4352 ((s->flags & SEC_NEVER_LOAD) != 0 \
4353 || (s->flags & SEC_ALLOC) == 0 \
4354 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
4355 && (s->flags & SEC_LOAD) == 0))
4357 /* Check to see if any allocated sections overlap with other allocated
4358 sections. This can happen if a linker script specifies the output
4359 section addresses of the two sections. Also check whether any memory
4360 region has overflowed. */
4363 lang_check_section_addresses (void)
4366 asection
**sections
, **spp
;
4373 lang_memory_region_type
*m
;
4375 if (bfd_count_sections (link_info
.output_bfd
) <= 1)
4378 amt
= bfd_count_sections (link_info
.output_bfd
) * sizeof (asection
*);
4379 sections
= xmalloc (amt
);
4381 /* Scan all sections in the output list. */
4383 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4385 /* Only consider loadable sections with real contents. */
4386 if (IGNORE_SECTION (s
) || s
->size
== 0)
4389 sections
[count
] = s
;
4396 qsort (sections
, (size_t) count
, sizeof (asection
*),
4397 sort_sections_by_lma
);
4401 s_start
= bfd_section_lma (link_info
.output_bfd
, s
);
4402 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4403 for (count
--; count
; count
--)
4405 /* We must check the sections' LMA addresses not their VMA
4406 addresses because overlay sections can have overlapping VMAs
4407 but they must have distinct LMAs. */
4412 s_start
= bfd_section_lma (link_info
.output_bfd
, s
);
4413 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4415 /* Look for an overlap. */
4416 if (s_end
>= os_start
&& s_start
<= os_end
)
4417 einfo (_("%X%P: section %s [%V -> %V] overlaps section %s [%V -> %V]\n"),
4418 s
->name
, s_start
, s_end
, os
->name
, os_start
, os_end
);
4423 /* If any memory region has overflowed, report by how much.
4424 We do not issue this diagnostic for regions that had sections
4425 explicitly placed outside their bounds; os_region_check's
4426 diagnostics are adequate for that case.
4428 FIXME: It is conceivable that m->current - (m->origin + m->length)
4429 might overflow a 32-bit integer. There is, alas, no way to print
4430 a bfd_vma quantity in decimal. */
4431 for (m
= lang_memory_region_list
; m
; m
= m
->next
)
4432 if (m
->had_full_message
)
4433 einfo (_("%X%P: region %s overflowed by %ld bytes\n"),
4434 m
->name
, (long)(m
->current
- (m
->origin
+ m
->length
)));
4438 /* Make sure the new address is within the region. We explicitly permit the
4439 current address to be at the exact end of the region when the address is
4440 non-zero, in case the region is at the end of addressable memory and the
4441 calculation wraps around. */
4444 os_region_check (lang_output_section_statement_type
*os
,
4445 lang_memory_region_type
*region
,
4449 if ((region
->current
< region
->origin
4450 || (region
->current
- region
->origin
> region
->length
))
4451 && ((region
->current
!= region
->origin
+ region
->length
)
4456 einfo (_("%X%P: address 0x%v of %B section %s"
4457 " is not within region %s\n"),
4459 os
->bfd_section
->owner
,
4460 os
->bfd_section
->name
,
4463 else if (!region
->had_full_message
)
4465 region
->had_full_message
= TRUE
;
4467 einfo (_("%X%P: %B section %s will not fit in region %s\n"),
4468 os
->bfd_section
->owner
,
4469 os
->bfd_section
->name
,
4475 /* Set the sizes for all the output sections. */
4478 lang_size_sections_1
4479 (lang_statement_union_type
*s
,
4480 lang_output_section_statement_type
*output_section_statement
,
4481 lang_statement_union_type
**prev
,
4485 bfd_boolean check_regions
)
4487 /* Size up the sections from their constituent parts. */
4488 for (; s
!= NULL
; s
= s
->header
.next
)
4490 switch (s
->header
.type
)
4492 case lang_output_section_statement_enum
:
4494 bfd_vma newdot
, after
;
4495 lang_output_section_statement_type
*os
;
4496 lang_memory_region_type
*r
;
4498 os
= &s
->output_section_statement
;
4499 if (os
->addr_tree
!= NULL
)
4501 os
->processed_vma
= FALSE
;
4502 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
4504 if (expld
.result
.valid_p
)
4505 dot
= expld
.result
.value
+ expld
.result
.section
->vma
;
4506 else if (expld
.phase
!= lang_mark_phase_enum
)
4507 einfo (_("%F%S: non constant or forward reference"
4508 " address expression for section %s\n"),
4512 if (os
->bfd_section
== NULL
)
4513 /* This section was removed or never actually created. */
4516 /* If this is a COFF shared library section, use the size and
4517 address from the input section. FIXME: This is COFF
4518 specific; it would be cleaner if there were some other way
4519 to do this, but nothing simple comes to mind. */
4520 if (((bfd_get_flavour (link_info
.output_bfd
)
4521 == bfd_target_ecoff_flavour
)
4522 || (bfd_get_flavour (link_info
.output_bfd
)
4523 == bfd_target_coff_flavour
))
4524 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
4528 if (os
->children
.head
== NULL
4529 || os
->children
.head
->header
.next
!= NULL
4530 || (os
->children
.head
->header
.type
4531 != lang_input_section_enum
))
4532 einfo (_("%P%X: Internal error on COFF shared library"
4533 " section %s\n"), os
->name
);
4535 input
= os
->children
.head
->input_section
.section
;
4536 bfd_set_section_vma (os
->bfd_section
->owner
,
4538 bfd_section_vma (input
->owner
, input
));
4539 os
->bfd_section
->size
= input
->size
;
4544 if (bfd_is_abs_section (os
->bfd_section
))
4546 /* No matter what happens, an abs section starts at zero. */
4547 ASSERT (os
->bfd_section
->vma
== 0);
4553 if (os
->addr_tree
== NULL
)
4555 /* No address specified for this section, get one
4556 from the region specification. */
4557 if (os
->region
== NULL
4558 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
4559 && os
->region
->name
[0] == '*'
4560 && strcmp (os
->region
->name
,
4561 DEFAULT_MEMORY_REGION
) == 0))
4563 os
->region
= lang_memory_default (os
->bfd_section
);
4566 /* If a loadable section is using the default memory
4567 region, and some non default memory regions were
4568 defined, issue an error message. */
4570 && !IGNORE_SECTION (os
->bfd_section
)
4571 && ! link_info
.relocatable
4573 && strcmp (os
->region
->name
,
4574 DEFAULT_MEMORY_REGION
) == 0
4575 && lang_memory_region_list
!= NULL
4576 && (strcmp (lang_memory_region_list
->name
,
4577 DEFAULT_MEMORY_REGION
) != 0
4578 || lang_memory_region_list
->next
!= NULL
)
4579 && expld
.phase
!= lang_mark_phase_enum
)
4581 /* By default this is an error rather than just a
4582 warning because if we allocate the section to the
4583 default memory region we can end up creating an
4584 excessively large binary, or even seg faulting when
4585 attempting to perform a negative seek. See
4586 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4587 for an example of this. This behaviour can be
4588 overridden by the using the --no-check-sections
4590 if (command_line
.check_section_addresses
)
4591 einfo (_("%P%F: error: no memory region specified"
4592 " for loadable section `%s'\n"),
4593 bfd_get_section_name (link_info
.output_bfd
,
4596 einfo (_("%P: warning: no memory region specified"
4597 " for loadable section `%s'\n"),
4598 bfd_get_section_name (link_info
.output_bfd
,
4602 newdot
= os
->region
->current
;
4603 align
= os
->bfd_section
->alignment_power
;
4606 align
= os
->section_alignment
;
4608 /* Align to what the section needs. */
4611 bfd_vma savedot
= newdot
;
4612 newdot
= align_power (newdot
, align
);
4614 if (newdot
!= savedot
4615 && (config
.warn_section_align
4616 || os
->addr_tree
!= NULL
)
4617 && expld
.phase
!= lang_mark_phase_enum
)
4618 einfo (_("%P: warning: changing start of section"
4619 " %s by %lu bytes\n"),
4620 os
->name
, (unsigned long) (newdot
- savedot
));
4623 bfd_set_section_vma (0, os
->bfd_section
, newdot
);
4625 os
->bfd_section
->output_offset
= 0;
4628 lang_size_sections_1 (os
->children
.head
, os
, &os
->children
.head
,
4629 os
->fill
, newdot
, relax
, check_regions
);
4631 os
->processed_vma
= TRUE
;
4633 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
4634 /* Except for some special linker created sections,
4635 no output section should change from zero size
4636 after strip_excluded_output_sections. A non-zero
4637 size on an ignored section indicates that some
4638 input section was not sized early enough. */
4639 ASSERT (os
->bfd_section
->size
== 0);
4642 dot
= os
->bfd_section
->vma
;
4644 /* Put the section within the requested block size, or
4645 align at the block boundary. */
4647 + TO_ADDR (os
->bfd_section
->size
)
4648 + os
->block_value
- 1)
4649 & - (bfd_vma
) os
->block_value
);
4651 os
->bfd_section
->size
= TO_SIZE (after
- os
->bfd_section
->vma
);
4654 /* Set section lma. */
4657 r
= lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
4661 bfd_vma lma
= exp_get_abs_int (os
->load_base
, 0, "load base");
4662 os
->bfd_section
->lma
= lma
;
4664 else if (os
->lma_region
!= NULL
)
4666 bfd_vma lma
= os
->lma_region
->current
;
4668 if (os
->section_alignment
!= -1)
4669 lma
= align_power (lma
, os
->section_alignment
);
4670 os
->bfd_section
->lma
= lma
;
4672 else if (r
->last_os
!= NULL
4673 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
4678 last
= r
->last_os
->output_section_statement
.bfd_section
;
4680 /* A backwards move of dot should be accompanied by
4681 an explicit assignment to the section LMA (ie.
4682 os->load_base set) because backwards moves can
4683 create overlapping LMAs. */
4685 && os
->bfd_section
->size
!= 0
4686 && dot
+ os
->bfd_section
->size
<= last
->vma
)
4688 /* If dot moved backwards then leave lma equal to
4689 vma. This is the old default lma, which might
4690 just happen to work when the backwards move is
4691 sufficiently large. Nag if this changes anything,
4692 so people can fix their linker scripts. */
4694 if (last
->vma
!= last
->lma
)
4695 einfo (_("%P: warning: dot moved backwards before `%s'\n"),
4700 /* If this is an overlay, set the current lma to that
4701 at the end of the previous section. */
4702 if (os
->sectype
== overlay_section
)
4703 lma
= last
->lma
+ last
->size
;
4705 /* Otherwise, keep the same lma to vma relationship
4706 as the previous section. */
4708 lma
= dot
+ last
->lma
- last
->vma
;
4710 if (os
->section_alignment
!= -1)
4711 lma
= align_power (lma
, os
->section_alignment
);
4712 os
->bfd_section
->lma
= lma
;
4715 os
->processed_lma
= TRUE
;
4717 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
4720 /* Keep track of normal sections using the default
4721 lma region. We use this to set the lma for
4722 following sections. Overlays or other linker
4723 script assignment to lma might mean that the
4724 default lma == vma is incorrect.
4725 To avoid warnings about dot moving backwards when using
4726 -Ttext, don't start tracking sections until we find one
4727 of non-zero size or with lma set differently to vma. */
4728 if (((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
4729 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0)
4730 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0
4731 && (os
->bfd_section
->size
!= 0
4732 || (r
->last_os
== NULL
4733 && os
->bfd_section
->vma
!= os
->bfd_section
->lma
)
4734 || (r
->last_os
!= NULL
4735 && dot
>= (r
->last_os
->output_section_statement
4736 .bfd_section
->vma
)))
4737 && os
->lma_region
== NULL
4738 && !link_info
.relocatable
)
4741 /* .tbss sections effectively have zero size. */
4742 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
4743 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
4744 || link_info
.relocatable
)
4745 dot
+= TO_ADDR (os
->bfd_section
->size
);
4747 if (os
->update_dot_tree
!= 0)
4748 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
4750 /* Update dot in the region ?
4751 We only do this if the section is going to be allocated,
4752 since unallocated sections do not contribute to the region's
4753 overall size in memory.
4755 If the SEC_NEVER_LOAD bit is not set, it will affect the
4756 addresses of sections after it. We have to update
4758 if (os
->region
!= NULL
4759 && ((os
->bfd_section
->flags
& SEC_NEVER_LOAD
) == 0
4760 || (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))))
4762 os
->region
->current
= dot
;
4765 /* Make sure the new address is within the region. */
4766 os_region_check (os
, os
->region
, os
->addr_tree
,
4767 os
->bfd_section
->vma
);
4769 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
4770 && (os
->bfd_section
->flags
& SEC_LOAD
))
4772 os
->lma_region
->current
4773 = os
->bfd_section
->lma
+ TO_ADDR (os
->bfd_section
->size
);
4776 os_region_check (os
, os
->lma_region
, NULL
,
4777 os
->bfd_section
->lma
);
4783 case lang_constructors_statement_enum
:
4784 dot
= lang_size_sections_1 (constructor_list
.head
,
4785 output_section_statement
,
4786 &s
->wild_statement
.children
.head
,
4787 fill
, dot
, relax
, check_regions
);
4790 case lang_data_statement_enum
:
4792 unsigned int size
= 0;
4794 s
->data_statement
.output_offset
=
4795 dot
- output_section_statement
->bfd_section
->vma
;
4796 s
->data_statement
.output_section
=
4797 output_section_statement
->bfd_section
;
4799 /* We might refer to provided symbols in the expression, and
4800 need to mark them as needed. */
4801 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
4803 switch (s
->data_statement
.type
)
4821 if (size
< TO_SIZE ((unsigned) 1))
4822 size
= TO_SIZE ((unsigned) 1);
4823 dot
+= TO_ADDR (size
);
4824 output_section_statement
->bfd_section
->size
+= size
;
4828 case lang_reloc_statement_enum
:
4832 s
->reloc_statement
.output_offset
=
4833 dot
- output_section_statement
->bfd_section
->vma
;
4834 s
->reloc_statement
.output_section
=
4835 output_section_statement
->bfd_section
;
4836 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
4837 dot
+= TO_ADDR (size
);
4838 output_section_statement
->bfd_section
->size
+= size
;
4842 case lang_wild_statement_enum
:
4843 dot
= lang_size_sections_1 (s
->wild_statement
.children
.head
,
4844 output_section_statement
,
4845 &s
->wild_statement
.children
.head
,
4846 fill
, dot
, relax
, check_regions
);
4849 case lang_object_symbols_statement_enum
:
4850 link_info
.create_object_symbols_section
=
4851 output_section_statement
->bfd_section
;
4854 case lang_output_statement_enum
:
4855 case lang_target_statement_enum
:
4858 case lang_input_section_enum
:
4862 i
= (*prev
)->input_section
.section
;
4867 if (! bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
4868 einfo (_("%P%F: can't relax section: %E\n"));
4872 dot
= size_input_section (prev
, output_section_statement
,
4873 output_section_statement
->fill
, dot
);
4877 case lang_input_statement_enum
:
4880 case lang_fill_statement_enum
:
4881 s
->fill_statement
.output_section
=
4882 output_section_statement
->bfd_section
;
4884 fill
= s
->fill_statement
.fill
;
4887 case lang_assignment_statement_enum
:
4889 bfd_vma newdot
= dot
;
4890 etree_type
*tree
= s
->assignment_statement
.exp
;
4892 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
4894 exp_fold_tree (tree
,
4895 output_section_statement
->bfd_section
,
4898 if (expld
.dataseg
.relro
== exp_dataseg_relro_start
)
4900 if (!expld
.dataseg
.relro_start_stat
)
4901 expld
.dataseg
.relro_start_stat
= s
;
4904 ASSERT (expld
.dataseg
.relro_start_stat
== s
);
4907 else if (expld
.dataseg
.relro
== exp_dataseg_relro_end
)
4909 if (!expld
.dataseg
.relro_end_stat
)
4910 expld
.dataseg
.relro_end_stat
= s
;
4913 ASSERT (expld
.dataseg
.relro_end_stat
== s
);
4916 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
4918 /* This symbol is relative to this section. */
4919 if ((tree
->type
.node_class
== etree_provided
4920 || tree
->type
.node_class
== etree_assign
)
4921 && (tree
->assign
.dst
[0] != '.'
4922 || tree
->assign
.dst
[1] != '\0'))
4923 output_section_statement
->section_relative_symbol
= 1;
4925 if (!output_section_statement
->ignored
)
4927 if (output_section_statement
== abs_output_section
)
4929 /* If we don't have an output section, then just adjust
4930 the default memory address. */
4931 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
4932 FALSE
)->current
= newdot
;
4934 else if (newdot
!= dot
)
4936 /* Insert a pad after this statement. We can't
4937 put the pad before when relaxing, in case the
4938 assignment references dot. */
4939 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
4940 output_section_statement
->bfd_section
, dot
);
4942 /* Don't neuter the pad below when relaxing. */
4945 /* If dot is advanced, this implies that the section
4946 should have space allocated to it, unless the
4947 user has explicitly stated that the section
4948 should never be loaded. */
4949 if (!(output_section_statement
->flags
& SEC_NEVER_LOAD
))
4950 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
4957 case lang_padding_statement_enum
:
4958 /* If this is the first time lang_size_sections is called,
4959 we won't have any padding statements. If this is the
4960 second or later passes when relaxing, we should allow
4961 padding to shrink. If padding is needed on this pass, it
4962 will be added back in. */
4963 s
->padding_statement
.size
= 0;
4965 /* Make sure output_offset is valid. If relaxation shrinks
4966 the section and this pad isn't needed, it's possible to
4967 have output_offset larger than the final size of the
4968 section. bfd_set_section_contents will complain even for
4969 a pad size of zero. */
4970 s
->padding_statement
.output_offset
4971 = dot
- output_section_statement
->bfd_section
->vma
;
4974 case lang_group_statement_enum
:
4975 dot
= lang_size_sections_1 (s
->group_statement
.children
.head
,
4976 output_section_statement
,
4977 &s
->group_statement
.children
.head
,
4978 fill
, dot
, relax
, check_regions
);
4981 case lang_insert_statement_enum
:
4984 /* We can only get here when relaxing is turned on. */
4985 case lang_address_statement_enum
:
4992 prev
= &s
->header
.next
;
4997 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
4998 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
4999 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
5000 segments. We are allowed an opportunity to override this decision. */
5003 ldlang_override_segment_assignment (struct bfd_link_info
* info ATTRIBUTE_UNUSED
,
5004 bfd
* abfd ATTRIBUTE_UNUSED
,
5005 asection
* current_section
,
5006 asection
* previous_section
,
5007 bfd_boolean new_segment
)
5009 lang_output_section_statement_type
* cur
;
5010 lang_output_section_statement_type
* prev
;
5012 /* The checks below are only necessary when the BFD library has decided
5013 that the two sections ought to be placed into the same segment. */
5017 /* Paranoia checks. */
5018 if (current_section
== NULL
|| previous_section
== NULL
)
5021 /* Find the memory regions associated with the two sections.
5022 We call lang_output_section_find() here rather than scanning the list
5023 of output sections looking for a matching section pointer because if
5024 we have a large number of sections then a hash lookup is faster. */
5025 cur
= lang_output_section_find (current_section
->name
);
5026 prev
= lang_output_section_find (previous_section
->name
);
5028 /* More paranoia. */
5029 if (cur
== NULL
|| prev
== NULL
)
5032 /* If the regions are different then force the sections to live in
5033 different segments. See the email thread starting at the following
5034 URL for the reasons why this is necessary:
5035 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
5036 return cur
->region
!= prev
->region
;
5040 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
5042 lang_statement_iteration
++;
5043 lang_size_sections_1 (statement_list
.head
, abs_output_section
,
5044 &statement_list
.head
, 0, 0, relax
, check_regions
);
5048 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
5050 expld
.phase
= lang_allocating_phase_enum
;
5051 expld
.dataseg
.phase
= exp_dataseg_none
;
5053 one_lang_size_sections_pass (relax
, check_regions
);
5054 if (expld
.dataseg
.phase
== exp_dataseg_end_seen
5055 && link_info
.relro
&& expld
.dataseg
.relro_end
)
5057 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
5058 to put expld.dataseg.relro on a (common) page boundary. */
5059 bfd_vma old_min_base
, relro_end
, maxpage
;
5061 expld
.dataseg
.phase
= exp_dataseg_relro_adjust
;
5062 old_min_base
= expld
.dataseg
.min_base
;
5063 maxpage
= expld
.dataseg
.maxpagesize
;
5064 expld
.dataseg
.base
+= (-expld
.dataseg
.relro_end
5065 & (expld
.dataseg
.pagesize
- 1));
5066 /* Compute the expected PT_GNU_RELRO segment end. */
5067 relro_end
= ((expld
.dataseg
.relro_end
+ expld
.dataseg
.pagesize
- 1)
5068 & ~(expld
.dataseg
.pagesize
- 1));
5069 if (old_min_base
+ maxpage
< expld
.dataseg
.base
)
5071 expld
.dataseg
.base
-= maxpage
;
5072 relro_end
-= maxpage
;
5074 lang_reset_memory_regions ();
5075 one_lang_size_sections_pass (relax
, check_regions
);
5076 if (expld
.dataseg
.relro_end
> relro_end
)
5078 /* The alignment of sections between DATA_SEGMENT_ALIGN
5079 and DATA_SEGMENT_RELRO_END caused huge padding to be
5080 inserted at DATA_SEGMENT_RELRO_END. Try some other base. */
5082 unsigned int max_alignment_power
= 0;
5084 /* Find maximum alignment power of sections between
5085 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
5086 for (sec
= link_info
.output_bfd
->sections
; sec
; sec
= sec
->next
)
5087 if (sec
->vma
>= expld
.dataseg
.base
5088 && sec
->vma
< expld
.dataseg
.relro_end
5089 && sec
->alignment_power
> max_alignment_power
)
5090 max_alignment_power
= sec
->alignment_power
;
5092 if (((bfd_vma
) 1 << max_alignment_power
) < expld
.dataseg
.pagesize
)
5094 if (expld
.dataseg
.base
- (1 << max_alignment_power
)
5096 expld
.dataseg
.base
+= expld
.dataseg
.pagesize
;
5097 expld
.dataseg
.base
-= (1 << max_alignment_power
);
5098 lang_reset_memory_regions ();
5099 one_lang_size_sections_pass (relax
, check_regions
);
5102 link_info
.relro_start
= expld
.dataseg
.base
;
5103 link_info
.relro_end
= expld
.dataseg
.relro_end
;
5105 else if (expld
.dataseg
.phase
== exp_dataseg_end_seen
)
5107 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
5108 a page could be saved in the data segment. */
5109 bfd_vma first
, last
;
5111 first
= -expld
.dataseg
.base
& (expld
.dataseg
.pagesize
- 1);
5112 last
= expld
.dataseg
.end
& (expld
.dataseg
.pagesize
- 1);
5114 && ((expld
.dataseg
.base
& ~(expld
.dataseg
.pagesize
- 1))
5115 != (expld
.dataseg
.end
& ~(expld
.dataseg
.pagesize
- 1)))
5116 && first
+ last
<= expld
.dataseg
.pagesize
)
5118 expld
.dataseg
.phase
= exp_dataseg_adjust
;
5119 lang_reset_memory_regions ();
5120 one_lang_size_sections_pass (relax
, check_regions
);
5124 expld
.phase
= lang_final_phase_enum
;
5127 /* Worker function for lang_do_assignments. Recursiveness goes here. */
5130 lang_do_assignments_1 (lang_statement_union_type
*s
,
5131 lang_output_section_statement_type
*current_os
,
5135 for (; s
!= NULL
; s
= s
->header
.next
)
5137 switch (s
->header
.type
)
5139 case lang_constructors_statement_enum
:
5140 dot
= lang_do_assignments_1 (constructor_list
.head
,
5141 current_os
, fill
, dot
);
5144 case lang_output_section_statement_enum
:
5146 lang_output_section_statement_type
*os
;
5148 os
= &(s
->output_section_statement
);
5149 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
5151 dot
= os
->bfd_section
->vma
;
5153 lang_do_assignments_1 (os
->children
.head
, os
, os
->fill
, dot
);
5155 /* .tbss sections effectively have zero size. */
5156 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5157 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
5158 || link_info
.relocatable
)
5159 dot
+= TO_ADDR (os
->bfd_section
->size
);
5161 if (os
->update_dot_tree
!= NULL
)
5162 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5167 case lang_wild_statement_enum
:
5169 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
5170 current_os
, fill
, dot
);
5173 case lang_object_symbols_statement_enum
:
5174 case lang_output_statement_enum
:
5175 case lang_target_statement_enum
:
5178 case lang_data_statement_enum
:
5179 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5180 if (expld
.result
.valid_p
)
5181 s
->data_statement
.value
= (expld
.result
.value
5182 + expld
.result
.section
->vma
);
5184 einfo (_("%F%P: invalid data statement\n"));
5187 switch (s
->data_statement
.type
)
5205 if (size
< TO_SIZE ((unsigned) 1))
5206 size
= TO_SIZE ((unsigned) 1);
5207 dot
+= TO_ADDR (size
);
5211 case lang_reloc_statement_enum
:
5212 exp_fold_tree (s
->reloc_statement
.addend_exp
,
5213 bfd_abs_section_ptr
, &dot
);
5214 if (expld
.result
.valid_p
)
5215 s
->reloc_statement
.addend_value
= expld
.result
.value
;
5217 einfo (_("%F%P: invalid reloc statement\n"));
5218 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
5221 case lang_input_section_enum
:
5223 asection
*in
= s
->input_section
.section
;
5225 if ((in
->flags
& SEC_EXCLUDE
) == 0)
5226 dot
+= TO_ADDR (in
->size
);
5230 case lang_input_statement_enum
:
5233 case lang_fill_statement_enum
:
5234 fill
= s
->fill_statement
.fill
;
5237 case lang_assignment_statement_enum
:
5238 exp_fold_tree (s
->assignment_statement
.exp
,
5239 current_os
->bfd_section
,
5243 case lang_padding_statement_enum
:
5244 dot
+= TO_ADDR (s
->padding_statement
.size
);
5247 case lang_group_statement_enum
:
5248 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
5249 current_os
, fill
, dot
);
5252 case lang_insert_statement_enum
:
5255 case lang_address_statement_enum
:
5267 lang_do_assignments (void)
5269 lang_statement_iteration
++;
5270 lang_do_assignments_1 (statement_list
.head
, abs_output_section
, NULL
, 0);
5273 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
5274 operator .startof. (section_name), it produces an undefined symbol
5275 .startof.section_name. Similarly, when it sees
5276 .sizeof. (section_name), it produces an undefined symbol
5277 .sizeof.section_name. For all the output sections, we look for
5278 such symbols, and set them to the correct value. */
5281 lang_set_startof (void)
5285 if (link_info
.relocatable
)
5288 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5290 const char *secname
;
5292 struct bfd_link_hash_entry
*h
;
5294 secname
= bfd_get_section_name (link_info
.output_bfd
, s
);
5295 buf
= xmalloc (10 + strlen (secname
));
5297 sprintf (buf
, ".startof.%s", secname
);
5298 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5299 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5301 h
->type
= bfd_link_hash_defined
;
5302 h
->u
.def
.value
= bfd_get_section_vma (link_info
.output_bfd
, s
);
5303 h
->u
.def
.section
= bfd_abs_section_ptr
;
5306 sprintf (buf
, ".sizeof.%s", secname
);
5307 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5308 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5310 h
->type
= bfd_link_hash_defined
;
5311 h
->u
.def
.value
= TO_ADDR (s
->size
);
5312 h
->u
.def
.section
= bfd_abs_section_ptr
;
5322 struct bfd_link_hash_entry
*h
;
5325 if ((link_info
.relocatable
&& !link_info
.gc_sections
)
5326 || link_info
.shared
)
5327 warn
= entry_from_cmdline
;
5331 /* Force the user to specify a root when generating a relocatable with
5333 if (link_info
.gc_sections
&& link_info
.relocatable
5334 && (entry_symbol
.name
== NULL
5335 && ldlang_undef_chain_list_head
== NULL
))
5336 einfo (_("%P%F: gc-sections requires either an entry or "
5337 "an undefined symbol\n"));
5339 if (entry_symbol
.name
== NULL
)
5341 /* No entry has been specified. Look for the default entry, but
5342 don't warn if we don't find it. */
5343 entry_symbol
.name
= entry_symbol_default
;
5347 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
5348 FALSE
, FALSE
, TRUE
);
5350 && (h
->type
== bfd_link_hash_defined
5351 || h
->type
== bfd_link_hash_defweak
)
5352 && h
->u
.def
.section
->output_section
!= NULL
)
5356 val
= (h
->u
.def
.value
5357 + bfd_get_section_vma (link_info
.output_bfd
,
5358 h
->u
.def
.section
->output_section
)
5359 + h
->u
.def
.section
->output_offset
);
5360 if (! bfd_set_start_address (link_info
.output_bfd
, val
))
5361 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol
.name
);
5368 /* We couldn't find the entry symbol. Try parsing it as a
5370 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
5373 if (! bfd_set_start_address (link_info
.output_bfd
, val
))
5374 einfo (_("%P%F: can't set start address\n"));
5380 /* Can't find the entry symbol, and it's not a number. Use
5381 the first address in the text section. */
5382 ts
= bfd_get_section_by_name (link_info
.output_bfd
, entry_section
);
5386 einfo (_("%P: warning: cannot find entry symbol %s;"
5387 " defaulting to %V\n"),
5389 bfd_get_section_vma (link_info
.output_bfd
, ts
));
5390 if (!(bfd_set_start_address
5391 (link_info
.output_bfd
,
5392 bfd_get_section_vma (link_info
.output_bfd
, ts
))))
5393 einfo (_("%P%F: can't set start address\n"));
5398 einfo (_("%P: warning: cannot find entry symbol %s;"
5399 " not setting start address\n"),
5405 /* Don't bfd_hash_table_free (&lang_definedness_table);
5406 map file output may result in a call of lang_track_definedness. */
5409 /* This is a small function used when we want to ignore errors from
5413 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED
, ...)
5415 /* Don't do anything. */
5418 /* Check that the architecture of all the input files is compatible
5419 with the output file. Also call the backend to let it do any
5420 other checking that is needed. */
5425 lang_statement_union_type
*file
;
5427 const bfd_arch_info_type
*compatible
;
5429 for (file
= file_chain
.head
; file
!= NULL
; file
= file
->input_statement
.next
)
5431 input_bfd
= file
->input_statement
.the_bfd
;
5433 = bfd_arch_get_compatible (input_bfd
, link_info
.output_bfd
,
5434 command_line
.accept_unknown_input_arch
);
5436 /* In general it is not possible to perform a relocatable
5437 link between differing object formats when the input
5438 file has relocations, because the relocations in the
5439 input format may not have equivalent representations in
5440 the output format (and besides BFD does not translate
5441 relocs for other link purposes than a final link). */
5442 if ((link_info
.relocatable
|| link_info
.emitrelocations
)
5443 && (compatible
== NULL
5444 || (bfd_get_flavour (input_bfd
)
5445 != bfd_get_flavour (link_info
.output_bfd
)))
5446 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
5448 einfo (_("%P%F: Relocatable linking with relocations from"
5449 " format %s (%B) to format %s (%B) is not supported\n"),
5450 bfd_get_target (input_bfd
), input_bfd
,
5451 bfd_get_target (link_info
.output_bfd
), link_info
.output_bfd
);
5452 /* einfo with %F exits. */
5455 if (compatible
== NULL
)
5457 if (command_line
.warn_mismatch
)
5458 einfo (_("%P%X: %s architecture of input file `%B'"
5459 " is incompatible with %s output\n"),
5460 bfd_printable_name (input_bfd
), input_bfd
,
5461 bfd_printable_name (link_info
.output_bfd
));
5463 else if (bfd_count_sections (input_bfd
))
5465 /* If the input bfd has no contents, it shouldn't set the
5466 private data of the output bfd. */
5468 bfd_error_handler_type pfn
= NULL
;
5470 /* If we aren't supposed to warn about mismatched input
5471 files, temporarily set the BFD error handler to a
5472 function which will do nothing. We still want to call
5473 bfd_merge_private_bfd_data, since it may set up
5474 information which is needed in the output file. */
5475 if (! command_line
.warn_mismatch
)
5476 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
5477 if (! bfd_merge_private_bfd_data (input_bfd
, link_info
.output_bfd
))
5479 if (command_line
.warn_mismatch
)
5480 einfo (_("%P%X: failed to merge target specific data"
5481 " of file %B\n"), input_bfd
);
5483 if (! command_line
.warn_mismatch
)
5484 bfd_set_error_handler (pfn
);
5489 /* Look through all the global common symbols and attach them to the
5490 correct section. The -sort-common command line switch may be used
5491 to roughly sort the entries by alignment. */
5496 if (command_line
.inhibit_common_definition
)
5498 if (link_info
.relocatable
5499 && ! command_line
.force_common_definition
)
5502 if (! config
.sort_common
)
5503 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
5508 if (config
.sort_common
== sort_descending
)
5510 for (power
= 4; power
> 0; power
--)
5511 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5514 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5518 for (power
= 0; power
<= 4; power
++)
5519 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5522 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5527 /* Place one common symbol in the correct section. */
5530 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
5532 unsigned int power_of_two
;
5536 if (h
->type
!= bfd_link_hash_common
)
5540 power_of_two
= h
->u
.c
.p
->alignment_power
;
5542 if (config
.sort_common
== sort_descending
5543 && power_of_two
< *(unsigned int *) info
)
5545 else if (config
.sort_common
== sort_ascending
5546 && power_of_two
> *(unsigned int *) info
)
5549 section
= h
->u
.c
.p
->section
;
5551 /* Increase the size of the section to align the common sym. */
5552 section
->size
+= ((bfd_vma
) 1 << (power_of_two
+ opb_shift
)) - 1;
5553 section
->size
&= (- (bfd_vma
) 1 << (power_of_two
+ opb_shift
));
5555 /* Adjust the alignment if necessary. */
5556 if (power_of_two
> section
->alignment_power
)
5557 section
->alignment_power
= power_of_two
;
5559 /* Change the symbol from common to defined. */
5560 h
->type
= bfd_link_hash_defined
;
5561 h
->u
.def
.section
= section
;
5562 h
->u
.def
.value
= section
->size
;
5564 /* Increase the size of the section. */
5565 section
->size
+= size
;
5567 /* Make sure the section is allocated in memory, and make sure that
5568 it is no longer a common section. */
5569 section
->flags
|= SEC_ALLOC
;
5570 section
->flags
&= ~SEC_IS_COMMON
;
5572 if (config
.map_file
!= NULL
)
5574 static bfd_boolean header_printed
;
5579 if (! header_printed
)
5581 minfo (_("\nAllocating common symbols\n"));
5582 minfo (_("Common symbol size file\n\n"));
5583 header_printed
= TRUE
;
5586 name
= bfd_demangle (link_info
.output_bfd
, h
->root
.string
,
5587 DMGL_ANSI
| DMGL_PARAMS
);
5590 minfo ("%s", h
->root
.string
);
5591 len
= strlen (h
->root
.string
);
5596 len
= strlen (name
);
5612 if (size
<= 0xffffffff)
5613 sprintf (buf
, "%lx", (unsigned long) size
);
5615 sprintf_vma (buf
, size
);
5625 minfo ("%B\n", section
->owner
);
5631 /* Run through the input files and ensure that every input section has
5632 somewhere to go. If one is found without a destination then create
5633 an input request and place it into the statement tree. */
5636 lang_place_orphans (void)
5638 LANG_FOR_EACH_INPUT_STATEMENT (file
)
5642 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5644 if (s
->output_section
== NULL
)
5646 /* This section of the file is not attached, root
5647 around for a sensible place for it to go. */
5649 if (file
->just_syms_flag
)
5650 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
5651 else if ((s
->flags
& SEC_EXCLUDE
) != 0)
5652 s
->output_section
= bfd_abs_section_ptr
;
5653 else if (strcmp (s
->name
, "COMMON") == 0)
5655 /* This is a lonely common section which must have
5656 come from an archive. We attach to the section
5657 with the wildcard. */
5658 if (! link_info
.relocatable
5659 || command_line
.force_common_definition
)
5661 if (default_common_section
== NULL
)
5663 default_common_section
=
5664 lang_output_section_statement_lookup (".bss");
5667 lang_add_section (&default_common_section
->children
, s
,
5668 default_common_section
);
5671 else if (ldemul_place_orphan (s
))
5675 lang_output_section_statement_type
*os
;
5677 os
= lang_output_section_statement_lookup (s
->name
);
5678 lang_add_section (&os
->children
, s
, os
);
5686 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
5688 flagword
*ptr_flags
;
5690 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
5696 *ptr_flags
|= SEC_ALLOC
;
5700 *ptr_flags
|= SEC_READONLY
;
5704 *ptr_flags
|= SEC_DATA
;
5708 *ptr_flags
|= SEC_CODE
;
5713 *ptr_flags
|= SEC_LOAD
;
5717 einfo (_("%P%F: invalid syntax in flags\n"));
5724 /* Call a function on each input file. This function will be called
5725 on an archive, but not on the elements. */
5728 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
5730 lang_input_statement_type
*f
;
5732 for (f
= (lang_input_statement_type
*) input_file_chain
.head
;
5734 f
= (lang_input_statement_type
*) f
->next_real_file
)
5738 /* Call a function on each file. The function will be called on all
5739 the elements of an archive which are included in the link, but will
5740 not be called on the archive file itself. */
5743 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
5745 LANG_FOR_EACH_INPUT_STATEMENT (f
)
5752 ldlang_add_file (lang_input_statement_type
*entry
)
5754 lang_statement_append (&file_chain
,
5755 (lang_statement_union_type
*) entry
,
5758 /* The BFD linker needs to have a list of all input BFDs involved in
5760 ASSERT (entry
->the_bfd
->link_next
== NULL
);
5761 ASSERT (entry
->the_bfd
!= link_info
.output_bfd
);
5763 *link_info
.input_bfds_tail
= entry
->the_bfd
;
5764 link_info
.input_bfds_tail
= &entry
->the_bfd
->link_next
;
5765 entry
->the_bfd
->usrdata
= entry
;
5766 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
5768 /* Look through the sections and check for any which should not be
5769 included in the link. We need to do this now, so that we can
5770 notice when the backend linker tries to report multiple
5771 definition errors for symbols which are in sections we aren't
5772 going to link. FIXME: It might be better to entirely ignore
5773 symbols which are defined in sections which are going to be
5774 discarded. This would require modifying the backend linker for
5775 each backend which might set the SEC_LINK_ONCE flag. If we do
5776 this, we should probably handle SEC_EXCLUDE in the same way. */
5778 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
5782 lang_add_output (const char *name
, int from_script
)
5784 /* Make -o on command line override OUTPUT in script. */
5785 if (!had_output_filename
|| !from_script
)
5787 output_filename
= name
;
5788 had_output_filename
= TRUE
;
5792 static lang_output_section_statement_type
*current_section
;
5803 for (l
= 0; l
< 32; l
++)
5805 if (i
>= (unsigned int) x
)
5813 lang_output_section_statement_type
*
5814 lang_enter_output_section_statement (const char *output_section_statement_name
,
5815 etree_type
*address_exp
,
5816 enum section_type sectype
,
5818 etree_type
*subalign
,
5822 lang_output_section_statement_type
*os
;
5824 os
= lang_output_section_statement_lookup_1 (output_section_statement_name
,
5826 current_section
= os
;
5828 /* Make next things chain into subchain of this. */
5830 if (os
->addr_tree
== NULL
)
5832 os
->addr_tree
= address_exp
;
5834 os
->sectype
= sectype
;
5835 if (sectype
!= noload_section
)
5836 os
->flags
= SEC_NO_FLAGS
;
5838 os
->flags
= SEC_NEVER_LOAD
;
5839 os
->block_value
= 1;
5840 stat_ptr
= &os
->children
;
5842 os
->subsection_alignment
=
5843 topower (exp_get_value_int (subalign
, -1, "subsection alignment"));
5844 os
->section_alignment
=
5845 topower (exp_get_value_int (align
, -1, "section alignment"));
5847 os
->load_base
= ebase
;
5854 lang_output_statement_type
*new;
5856 new = new_stat (lang_output_statement
, stat_ptr
);
5857 new->name
= output_filename
;
5860 /* Reset the current counters in the regions. */
5863 lang_reset_memory_regions (void)
5865 lang_memory_region_type
*p
= lang_memory_region_list
;
5867 lang_output_section_statement_type
*os
;
5869 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
5871 p
->current
= p
->origin
;
5875 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
5879 os
->processed_vma
= FALSE
;
5880 os
->processed_lma
= FALSE
;
5883 for (o
= link_info
.output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
5885 /* Save the last size for possible use by bfd_relax_section. */
5886 o
->rawsize
= o
->size
;
5891 /* Worker for lang_gc_sections_1. */
5894 gc_section_callback (lang_wild_statement_type
*ptr
,
5895 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
5897 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
5898 void *data ATTRIBUTE_UNUSED
)
5900 /* If the wild pattern was marked KEEP, the member sections
5901 should be as well. */
5902 if (ptr
->keep_sections
)
5903 section
->flags
|= SEC_KEEP
;
5906 /* Iterate over sections marking them against GC. */
5909 lang_gc_sections_1 (lang_statement_union_type
*s
)
5911 for (; s
!= NULL
; s
= s
->header
.next
)
5913 switch (s
->header
.type
)
5915 case lang_wild_statement_enum
:
5916 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
5918 case lang_constructors_statement_enum
:
5919 lang_gc_sections_1 (constructor_list
.head
);
5921 case lang_output_section_statement_enum
:
5922 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
5924 case lang_group_statement_enum
:
5925 lang_gc_sections_1 (s
->group_statement
.children
.head
);
5934 lang_gc_sections (void)
5936 /* Keep all sections so marked in the link script. */
5938 lang_gc_sections_1 (statement_list
.head
);
5940 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
5941 the special case of debug info. (See bfd/stabs.c)
5942 Twiddle the flag here, to simplify later linker code. */
5943 if (link_info
.relocatable
)
5945 LANG_FOR_EACH_INPUT_STATEMENT (f
)
5948 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
5949 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
5950 sec
->flags
&= ~SEC_EXCLUDE
;
5954 if (link_info
.gc_sections
)
5955 bfd_gc_sections (link_info
.output_bfd
, &link_info
);
5958 /* Worker for lang_find_relro_sections_1. */
5961 find_relro_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
5962 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
5964 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
5967 /* Discarded, excluded and ignored sections effectively have zero
5969 if (section
->output_section
!= NULL
5970 && section
->output_section
->owner
== link_info
.output_bfd
5971 && (section
->output_section
->flags
& SEC_EXCLUDE
) == 0
5972 && !IGNORE_SECTION (section
)
5973 && section
->size
!= 0)
5975 bfd_boolean
*has_relro_section
= (bfd_boolean
*) data
;
5976 *has_relro_section
= TRUE
;
5980 /* Iterate over sections for relro sections. */
5983 lang_find_relro_sections_1 (lang_statement_union_type
*s
,
5984 bfd_boolean
*has_relro_section
)
5986 if (*has_relro_section
)
5989 for (; s
!= NULL
; s
= s
->header
.next
)
5991 if (s
== expld
.dataseg
.relro_end_stat
)
5994 switch (s
->header
.type
)
5996 case lang_wild_statement_enum
:
5997 walk_wild (&s
->wild_statement
,
5998 find_relro_section_callback
,
6001 case lang_constructors_statement_enum
:
6002 lang_find_relro_sections_1 (constructor_list
.head
,
6005 case lang_output_section_statement_enum
:
6006 lang_find_relro_sections_1 (s
->output_section_statement
.children
.head
,
6009 case lang_group_statement_enum
:
6010 lang_find_relro_sections_1 (s
->group_statement
.children
.head
,
6020 lang_find_relro_sections (void)
6022 bfd_boolean has_relro_section
= FALSE
;
6024 /* Check all sections in the link script. */
6026 lang_find_relro_sections_1 (expld
.dataseg
.relro_start_stat
,
6027 &has_relro_section
);
6029 if (!has_relro_section
)
6030 link_info
.relro
= FALSE
;
6033 /* Relax all sections until bfd_relax_section gives up. */
6036 relax_sections (void)
6038 /* Keep relaxing until bfd_relax_section gives up. */
6039 bfd_boolean relax_again
;
6041 link_info
.relax_trip
= -1;
6044 relax_again
= FALSE
;
6045 link_info
.relax_trip
++;
6047 /* Note: pe-dll.c does something like this also. If you find
6048 you need to change this code, you probably need to change
6049 pe-dll.c also. DJ */
6051 /* Do all the assignments with our current guesses as to
6053 lang_do_assignments ();
6055 /* We must do this after lang_do_assignments, because it uses
6057 lang_reset_memory_regions ();
6059 /* Perform another relax pass - this time we know where the
6060 globals are, so can make a better guess. */
6061 lang_size_sections (&relax_again
, FALSE
);
6063 while (relax_again
);
6069 /* Finalize dynamic list. */
6070 if (link_info
.dynamic_list
)
6071 lang_finalize_version_expr_head (&link_info
.dynamic_list
->head
);
6073 current_target
= default_target
;
6075 /* Open the output file. */
6076 lang_for_each_statement (ldlang_open_output
);
6079 ldemul_create_output_section_statements ();
6081 /* Add to the hash table all undefineds on the command line. */
6082 lang_place_undefineds ();
6084 if (!bfd_section_already_linked_table_init ())
6085 einfo (_("%P%F: Failed to create hash table\n"));
6087 /* Create a bfd for each input file. */
6088 current_target
= default_target
;
6089 open_input_bfds (statement_list
.head
, FALSE
);
6091 link_info
.gc_sym_list
= &entry_symbol
;
6092 if (entry_symbol
.name
== NULL
)
6093 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
6095 ldemul_after_open ();
6097 bfd_section_already_linked_table_free ();
6099 /* Make sure that we're not mixing architectures. We call this
6100 after all the input files have been opened, but before we do any
6101 other processing, so that any operations merge_private_bfd_data
6102 does on the output file will be known during the rest of the
6106 /* Handle .exports instead of a version script if we're told to do so. */
6107 if (command_line
.version_exports_section
)
6108 lang_do_version_exports_section ();
6110 /* Build all sets based on the information gathered from the input
6112 ldctor_build_sets ();
6114 /* Remove unreferenced sections if asked to. */
6115 lang_gc_sections ();
6117 /* Size up the common data. */
6120 /* Update wild statements. */
6121 update_wild_statements (statement_list
.head
);
6123 /* Run through the contours of the script and attach input sections
6124 to the correct output sections. */
6125 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
6127 process_insert_statements ();
6129 /* Find any sections not attached explicitly and handle them. */
6130 lang_place_orphans ();
6132 if (! link_info
.relocatable
)
6136 /* Merge SEC_MERGE sections. This has to be done after GC of
6137 sections, so that GCed sections are not merged, but before
6138 assigning dynamic symbols, since removing whole input sections
6140 bfd_merge_sections (link_info
.output_bfd
, &link_info
);
6142 /* Look for a text section and set the readonly attribute in it. */
6143 found
= bfd_get_section_by_name (link_info
.output_bfd
, ".text");
6147 if (config
.text_read_only
)
6148 found
->flags
|= SEC_READONLY
;
6150 found
->flags
&= ~SEC_READONLY
;
6154 /* Do anything special before sizing sections. This is where ELF
6155 and other back-ends size dynamic sections. */
6156 ldemul_before_allocation ();
6158 /* We must record the program headers before we try to fix the
6159 section positions, since they will affect SIZEOF_HEADERS. */
6160 lang_record_phdrs ();
6162 /* Check relro sections. */
6163 if (link_info
.relro
&& ! link_info
.relocatable
)
6164 lang_find_relro_sections ();
6166 /* Size up the sections. */
6167 lang_size_sections (NULL
, !command_line
.relax
);
6169 /* Now run around and relax if we can. */
6170 if (command_line
.relax
)
6172 /* We may need more than one relaxation pass. */
6173 int i
= link_info
.relax_pass
;
6175 /* The backend can use it to determine the current pass. */
6176 link_info
.relax_pass
= 0;
6181 link_info
.relax_pass
++;
6184 /* Final extra sizing to report errors. */
6185 lang_do_assignments ();
6186 lang_reset_memory_regions ();
6187 lang_size_sections (NULL
, TRUE
);
6190 /* See if anything special should be done now we know how big
6192 ldemul_after_allocation ();
6194 /* Fix any .startof. or .sizeof. symbols. */
6195 lang_set_startof ();
6197 /* Do all the assignments, now that we know the final resting places
6198 of all the symbols. */
6200 lang_do_assignments ();
6204 /* Make sure that the section addresses make sense. */
6205 if (! link_info
.relocatable
6206 && command_line
.check_section_addresses
)
6207 lang_check_section_addresses ();
6212 /* EXPORTED TO YACC */
6215 lang_add_wild (struct wildcard_spec
*filespec
,
6216 struct wildcard_list
*section_list
,
6217 bfd_boolean keep_sections
)
6219 struct wildcard_list
*curr
, *next
;
6220 lang_wild_statement_type
*new;
6222 /* Reverse the list as the parser puts it back to front. */
6223 for (curr
= section_list
, section_list
= NULL
;
6225 section_list
= curr
, curr
= next
)
6227 if (curr
->spec
.name
!= NULL
&& strcmp (curr
->spec
.name
, "COMMON") == 0)
6228 placed_commons
= TRUE
;
6231 curr
->next
= section_list
;
6234 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
6236 if (strcmp (filespec
->name
, "*") == 0)
6237 filespec
->name
= NULL
;
6238 else if (! wildcardp (filespec
->name
))
6239 lang_has_input_file
= TRUE
;
6242 new = new_stat (lang_wild_statement
, stat_ptr
);
6243 new->filename
= NULL
;
6244 new->filenames_sorted
= FALSE
;
6245 if (filespec
!= NULL
)
6247 new->filename
= filespec
->name
;
6248 new->filenames_sorted
= filespec
->sorted
== by_name
;
6250 new->section_list
= section_list
;
6251 new->keep_sections
= keep_sections
;
6252 lang_list_init (&new->children
);
6253 analyze_walk_wild_section_handler (new);
6257 lang_section_start (const char *name
, etree_type
*address
,
6258 const segment_type
*segment
)
6260 lang_address_statement_type
*ad
;
6262 ad
= new_stat (lang_address_statement
, stat_ptr
);
6263 ad
->section_name
= name
;
6264 ad
->address
= address
;
6265 ad
->segment
= segment
;
6268 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
6269 because of a -e argument on the command line, or zero if this is
6270 called by ENTRY in a linker script. Command line arguments take
6274 lang_add_entry (const char *name
, bfd_boolean cmdline
)
6276 if (entry_symbol
.name
== NULL
6278 || ! entry_from_cmdline
)
6280 entry_symbol
.name
= name
;
6281 entry_from_cmdline
= cmdline
;
6285 /* Set the default start symbol to NAME. .em files should use this,
6286 not lang_add_entry, to override the use of "start" if neither the
6287 linker script nor the command line specifies an entry point. NAME
6288 must be permanently allocated. */
6290 lang_default_entry (const char *name
)
6292 entry_symbol_default
= name
;
6296 lang_add_target (const char *name
)
6298 lang_target_statement_type
*new;
6300 new = new_stat (lang_target_statement
, stat_ptr
);
6305 lang_add_map (const char *name
)
6312 map_option_f
= TRUE
;
6320 lang_add_fill (fill_type
*fill
)
6322 lang_fill_statement_type
*new;
6324 new = new_stat (lang_fill_statement
, stat_ptr
);
6329 lang_add_data (int type
, union etree_union
*exp
)
6331 lang_data_statement_type
*new;
6333 new = new_stat (lang_data_statement
, stat_ptr
);
6338 /* Create a new reloc statement. RELOC is the BFD relocation type to
6339 generate. HOWTO is the corresponding howto structure (we could
6340 look this up, but the caller has already done so). SECTION is the
6341 section to generate a reloc against, or NAME is the name of the
6342 symbol to generate a reloc against. Exactly one of SECTION and
6343 NAME must be NULL. ADDEND is an expression for the addend. */
6346 lang_add_reloc (bfd_reloc_code_real_type reloc
,
6347 reloc_howto_type
*howto
,
6350 union etree_union
*addend
)
6352 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
6356 p
->section
= section
;
6358 p
->addend_exp
= addend
;
6360 p
->addend_value
= 0;
6361 p
->output_section
= NULL
;
6362 p
->output_offset
= 0;
6365 lang_assignment_statement_type
*
6366 lang_add_assignment (etree_type
*exp
)
6368 lang_assignment_statement_type
*new;
6370 new = new_stat (lang_assignment_statement
, stat_ptr
);
6376 lang_add_attribute (enum statement_enum attribute
)
6378 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
6382 lang_startup (const char *name
)
6384 if (startup_file
!= NULL
)
6386 einfo (_("%P%F: multiple STARTUP files\n"));
6388 first_file
->filename
= name
;
6389 first_file
->local_sym_name
= name
;
6390 first_file
->real
= TRUE
;
6392 startup_file
= name
;
6396 lang_float (bfd_boolean maybe
)
6398 lang_float_flag
= maybe
;
6402 /* Work out the load- and run-time regions from a script statement, and
6403 store them in *LMA_REGION and *REGION respectively.
6405 MEMSPEC is the name of the run-time region, or the value of
6406 DEFAULT_MEMORY_REGION if the statement didn't specify one.
6407 LMA_MEMSPEC is the name of the load-time region, or null if the
6408 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
6409 had an explicit load address.
6411 It is an error to specify both a load region and a load address. */
6414 lang_get_regions (lang_memory_region_type
**region
,
6415 lang_memory_region_type
**lma_region
,
6416 const char *memspec
,
6417 const char *lma_memspec
,
6418 bfd_boolean have_lma
,
6419 bfd_boolean have_vma
)
6421 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
6423 /* If no runtime region or VMA has been specified, but the load region
6424 has been specified, then use the load region for the runtime region
6426 if (lma_memspec
!= NULL
6428 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
6429 *region
= *lma_region
;
6431 *region
= lang_memory_region_lookup (memspec
, FALSE
);
6433 if (have_lma
&& lma_memspec
!= 0)
6434 einfo (_("%X%P:%S: section has both a load address and a load region\n"));
6438 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
6439 lang_output_section_phdr_list
*phdrs
,
6440 const char *lma_memspec
)
6442 lang_get_regions (¤t_section
->region
,
6443 ¤t_section
->lma_region
,
6444 memspec
, lma_memspec
,
6445 current_section
->load_base
!= NULL
,
6446 current_section
->addr_tree
!= NULL
);
6447 current_section
->fill
= fill
;
6448 current_section
->phdrs
= phdrs
;
6449 stat_ptr
= &statement_list
;
6452 /* Create an absolute symbol with the given name with the value of the
6453 address of first byte of the section named.
6455 If the symbol already exists, then do nothing. */
6458 lang_abs_symbol_at_beginning_of (const char *secname
, const char *name
)
6460 struct bfd_link_hash_entry
*h
;
6462 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
6464 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
6466 if (h
->type
== bfd_link_hash_new
6467 || h
->type
== bfd_link_hash_undefined
)
6471 h
->type
= bfd_link_hash_defined
;
6473 sec
= bfd_get_section_by_name (link_info
.output_bfd
, secname
);
6477 h
->u
.def
.value
= bfd_get_section_vma (link_info
.output_bfd
, sec
);
6479 h
->u
.def
.section
= bfd_abs_section_ptr
;
6483 /* Create an absolute symbol with the given name with the value of the
6484 address of the first byte after the end of the section named.
6486 If the symbol already exists, then do nothing. */
6489 lang_abs_symbol_at_end_of (const char *secname
, const char *name
)
6491 struct bfd_link_hash_entry
*h
;
6493 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
6495 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
6497 if (h
->type
== bfd_link_hash_new
6498 || h
->type
== bfd_link_hash_undefined
)
6502 h
->type
= bfd_link_hash_defined
;
6504 sec
= bfd_get_section_by_name (link_info
.output_bfd
, secname
);
6508 h
->u
.def
.value
= (bfd_get_section_vma (link_info
.output_bfd
, sec
)
6509 + TO_ADDR (sec
->size
));
6511 h
->u
.def
.section
= bfd_abs_section_ptr
;
6516 lang_statement_append (lang_statement_list_type
*list
,
6517 lang_statement_union_type
*element
,
6518 lang_statement_union_type
**field
)
6520 *(list
->tail
) = element
;
6524 /* Set the output format type. -oformat overrides scripts. */
6527 lang_add_output_format (const char *format
,
6532 if (output_target
== NULL
|| !from_script
)
6534 if (command_line
.endian
== ENDIAN_BIG
6537 else if (command_line
.endian
== ENDIAN_LITTLE
6541 output_target
= format
;
6546 lang_add_insert (const char *where
, int is_before
)
6548 lang_insert_statement_type
*new;
6550 new = new_stat (lang_insert_statement
, stat_ptr
);
6552 new->is_before
= is_before
;
6553 saved_script_handle
= previous_script_handle
;
6556 /* Enter a group. This creates a new lang_group_statement, and sets
6557 stat_ptr to build new statements within the group. */
6560 lang_enter_group (void)
6562 lang_group_statement_type
*g
;
6564 g
= new_stat (lang_group_statement
, stat_ptr
);
6565 lang_list_init (&g
->children
);
6566 stat_ptr
= &g
->children
;
6569 /* Leave a group. This just resets stat_ptr to start writing to the
6570 regular list of statements again. Note that this will not work if
6571 groups can occur inside anything else which can adjust stat_ptr,
6572 but currently they can't. */
6575 lang_leave_group (void)
6577 stat_ptr
= &statement_list
;
6580 /* Add a new program header. This is called for each entry in a PHDRS
6581 command in a linker script. */
6584 lang_new_phdr (const char *name
,
6586 bfd_boolean filehdr
,
6591 struct lang_phdr
*n
, **pp
;
6593 n
= stat_alloc (sizeof (struct lang_phdr
));
6596 n
->type
= exp_get_value_int (type
, 0, "program header type");
6597 n
->filehdr
= filehdr
;
6602 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
6607 /* Record the program header information in the output BFD. FIXME: We
6608 should not be calling an ELF specific function here. */
6611 lang_record_phdrs (void)
6615 lang_output_section_phdr_list
*last
;
6616 struct lang_phdr
*l
;
6617 lang_output_section_statement_type
*os
;
6620 secs
= xmalloc (alc
* sizeof (asection
*));
6623 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
6630 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6634 lang_output_section_phdr_list
*pl
;
6636 if (os
->constraint
== -1)
6644 if (os
->sectype
== noload_section
6645 || os
->bfd_section
== NULL
6646 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
6651 lang_output_section_statement_type
* tmp_os
;
6653 /* If we have not run across a section with a program
6654 header assigned to it yet, then scan forwards to find
6655 one. This prevents inconsistencies in the linker's
6656 behaviour when a script has specified just a single
6657 header and there are sections in that script which are
6658 not assigned to it, and which occur before the first
6659 use of that header. See here for more details:
6660 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
6661 for (tmp_os
= os
; tmp_os
; tmp_os
= tmp_os
->next
)
6664 last
= tmp_os
->phdrs
;
6668 einfo (_("%F%P: no sections assigned to phdrs\n"));
6673 if (os
->bfd_section
== NULL
)
6676 for (; pl
!= NULL
; pl
= pl
->next
)
6678 if (strcmp (pl
->name
, l
->name
) == 0)
6683 secs
= xrealloc (secs
, alc
* sizeof (asection
*));
6685 secs
[c
] = os
->bfd_section
;
6692 if (l
->flags
== NULL
)
6695 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
6700 at
= exp_get_vma (l
->at
, 0, "phdr load address");
6702 if (! bfd_record_phdr (link_info
.output_bfd
, l
->type
,
6703 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
6704 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
6705 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
6710 /* Make sure all the phdr assignments succeeded. */
6711 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6715 lang_output_section_phdr_list
*pl
;
6717 if (os
->constraint
== -1
6718 || os
->bfd_section
== NULL
)
6721 for (pl
= os
->phdrs
;
6724 if (! pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
6725 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
6726 os
->name
, pl
->name
);
6730 /* Record a list of sections which may not be cross referenced. */
6733 lang_add_nocrossref (lang_nocrossref_type
*l
)
6735 struct lang_nocrossrefs
*n
;
6737 n
= xmalloc (sizeof *n
);
6738 n
->next
= nocrossref_list
;
6740 nocrossref_list
= n
;
6742 /* Set notice_all so that we get informed about all symbols. */
6743 link_info
.notice_all
= TRUE
;
6746 /* Overlay handling. We handle overlays with some static variables. */
6748 /* The overlay virtual address. */
6749 static etree_type
*overlay_vma
;
6750 /* And subsection alignment. */
6751 static etree_type
*overlay_subalign
;
6753 /* An expression for the maximum section size seen so far. */
6754 static etree_type
*overlay_max
;
6756 /* A list of all the sections in this overlay. */
6758 struct overlay_list
{
6759 struct overlay_list
*next
;
6760 lang_output_section_statement_type
*os
;
6763 static struct overlay_list
*overlay_list
;
6765 /* Start handling an overlay. */
6768 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
6770 /* The grammar should prevent nested overlays from occurring. */
6771 ASSERT (overlay_vma
== NULL
6772 && overlay_subalign
== NULL
6773 && overlay_max
== NULL
);
6775 overlay_vma
= vma_expr
;
6776 overlay_subalign
= subalign
;
6779 /* Start a section in an overlay. We handle this by calling
6780 lang_enter_output_section_statement with the correct VMA.
6781 lang_leave_overlay sets up the LMA and memory regions. */
6784 lang_enter_overlay_section (const char *name
)
6786 struct overlay_list
*n
;
6789 lang_enter_output_section_statement (name
, overlay_vma
, overlay_section
,
6790 0, overlay_subalign
, 0, 0);
6792 /* If this is the first section, then base the VMA of future
6793 sections on this one. This will work correctly even if `.' is
6794 used in the addresses. */
6795 if (overlay_list
== NULL
)
6796 overlay_vma
= exp_nameop (ADDR
, name
);
6798 /* Remember the section. */
6799 n
= xmalloc (sizeof *n
);
6800 n
->os
= current_section
;
6801 n
->next
= overlay_list
;
6804 size
= exp_nameop (SIZEOF
, name
);
6806 /* Arrange to work out the maximum section end address. */
6807 if (overlay_max
== NULL
)
6810 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
6813 /* Finish a section in an overlay. There isn't any special to do
6817 lang_leave_overlay_section (fill_type
*fill
,
6818 lang_output_section_phdr_list
*phdrs
)
6825 name
= current_section
->name
;
6827 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
6828 region and that no load-time region has been specified. It doesn't
6829 really matter what we say here, since lang_leave_overlay will
6831 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
6833 /* Define the magic symbols. */
6835 clean
= xmalloc (strlen (name
) + 1);
6837 for (s1
= name
; *s1
!= '\0'; s1
++)
6838 if (ISALNUM (*s1
) || *s1
== '_')
6842 buf
= xmalloc (strlen (clean
) + sizeof "__load_start_");
6843 sprintf (buf
, "__load_start_%s", clean
);
6844 lang_add_assignment (exp_provide (buf
,
6845 exp_nameop (LOADADDR
, name
),
6848 buf
= xmalloc (strlen (clean
) + sizeof "__load_stop_");
6849 sprintf (buf
, "__load_stop_%s", clean
);
6850 lang_add_assignment (exp_provide (buf
,
6852 exp_nameop (LOADADDR
, name
),
6853 exp_nameop (SIZEOF
, name
)),
6859 /* Finish an overlay. If there are any overlay wide settings, this
6860 looks through all the sections in the overlay and sets them. */
6863 lang_leave_overlay (etree_type
*lma_expr
,
6866 const char *memspec
,
6867 lang_output_section_phdr_list
*phdrs
,
6868 const char *lma_memspec
)
6870 lang_memory_region_type
*region
;
6871 lang_memory_region_type
*lma_region
;
6872 struct overlay_list
*l
;
6873 lang_nocrossref_type
*nocrossref
;
6875 lang_get_regions (®ion
, &lma_region
,
6876 memspec
, lma_memspec
,
6877 lma_expr
!= NULL
, FALSE
);
6881 /* After setting the size of the last section, set '.' to end of the
6883 if (overlay_list
!= NULL
)
6884 overlay_list
->os
->update_dot_tree
6885 = exp_assop ('=', ".", exp_binop ('+', overlay_vma
, overlay_max
));
6890 struct overlay_list
*next
;
6892 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
6895 l
->os
->region
= region
;
6896 l
->os
->lma_region
= lma_region
;
6898 /* The first section has the load address specified in the
6899 OVERLAY statement. The rest are worked out from that.
6900 The base address is not needed (and should be null) if
6901 an LMA region was specified. */
6904 l
->os
->load_base
= lma_expr
;
6905 l
->os
->sectype
= normal_section
;
6907 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
6908 l
->os
->phdrs
= phdrs
;
6912 lang_nocrossref_type
*nc
;
6914 nc
= xmalloc (sizeof *nc
);
6915 nc
->name
= l
->os
->name
;
6916 nc
->next
= nocrossref
;
6925 if (nocrossref
!= NULL
)
6926 lang_add_nocrossref (nocrossref
);
6929 overlay_list
= NULL
;
6933 /* Version handling. This is only useful for ELF. */
6935 /* This global variable holds the version tree that we build. */
6937 struct bfd_elf_version_tree
*lang_elf_version_info
;
6939 /* If PREV is NULL, return first version pattern matching particular symbol.
6940 If PREV is non-NULL, return first version pattern matching particular
6941 symbol after PREV (previously returned by lang_vers_match). */
6943 static struct bfd_elf_version_expr
*
6944 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
6945 struct bfd_elf_version_expr
*prev
,
6948 const char *cxx_sym
= sym
;
6949 const char *java_sym
= sym
;
6950 struct bfd_elf_version_expr
*expr
= NULL
;
6952 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
6954 cxx_sym
= cplus_demangle (sym
, DMGL_PARAMS
| DMGL_ANSI
);
6958 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
6960 java_sym
= cplus_demangle (sym
, DMGL_JAVA
);
6965 if (head
->htab
&& (prev
== NULL
|| prev
->symbol
))
6967 struct bfd_elf_version_expr e
;
6969 switch (prev
? prev
->mask
: 0)
6972 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
6975 expr
= htab_find (head
->htab
, &e
);
6976 while (expr
&& strcmp (expr
->symbol
, sym
) == 0)
6977 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
6983 case BFD_ELF_VERSION_C_TYPE
:
6984 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
6987 expr
= htab_find (head
->htab
, &e
);
6988 while (expr
&& strcmp (expr
->symbol
, cxx_sym
) == 0)
6989 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
6995 case BFD_ELF_VERSION_CXX_TYPE
:
6996 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
6998 e
.symbol
= java_sym
;
6999 expr
= htab_find (head
->htab
, &e
);
7000 while (expr
&& strcmp (expr
->symbol
, java_sym
) == 0)
7001 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7012 /* Finally, try the wildcards. */
7013 if (prev
== NULL
|| prev
->symbol
)
7014 expr
= head
->remaining
;
7017 for (; expr
; expr
= expr
->next
)
7024 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
7027 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7029 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
7033 if (fnmatch (expr
->pattern
, s
, 0) == 0)
7039 free ((char *) cxx_sym
);
7040 if (java_sym
!= sym
)
7041 free ((char *) java_sym
);
7045 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
7046 return a string pointing to the symbol name. */
7049 realsymbol (const char *pattern
)
7052 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
7053 char *s
, *symbol
= xmalloc (strlen (pattern
) + 1);
7055 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
7057 /* It is a glob pattern only if there is no preceding
7059 if (! backslash
&& (*p
== '?' || *p
== '*' || *p
== '['))
7067 /* Remove the preceding backslash. */
7074 backslash
= *p
== '\\';
7089 /* This is called for each variable name or match expression. NEW is
7090 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
7091 pattern to be matched against symbol names. */
7093 struct bfd_elf_version_expr
*
7094 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
7097 bfd_boolean literal_p
)
7099 struct bfd_elf_version_expr
*ret
;
7101 ret
= xmalloc (sizeof *ret
);
7103 ret
->pattern
= literal_p
? NULL
: new;
7106 ret
->symbol
= literal_p
? new : realsymbol (new);
7108 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
7109 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7110 else if (strcasecmp (lang
, "C++") == 0)
7111 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
7112 else if (strcasecmp (lang
, "Java") == 0)
7113 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
7116 einfo (_("%X%P: unknown language `%s' in version information\n"),
7118 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7121 return ldemul_new_vers_pattern (ret
);
7124 /* This is called for each set of variable names and match
7127 struct bfd_elf_version_tree
*
7128 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
7129 struct bfd_elf_version_expr
*locals
)
7131 struct bfd_elf_version_tree
*ret
;
7133 ret
= xcalloc (1, sizeof *ret
);
7134 ret
->globals
.list
= globals
;
7135 ret
->locals
.list
= locals
;
7136 ret
->match
= lang_vers_match
;
7137 ret
->name_indx
= (unsigned int) -1;
7141 /* This static variable keeps track of version indices. */
7143 static int version_index
;
7146 version_expr_head_hash (const void *p
)
7148 const struct bfd_elf_version_expr
*e
= p
;
7150 return htab_hash_string (e
->symbol
);
7154 version_expr_head_eq (const void *p1
, const void *p2
)
7156 const struct bfd_elf_version_expr
*e1
= p1
;
7157 const struct bfd_elf_version_expr
*e2
= p2
;
7159 return strcmp (e1
->symbol
, e2
->symbol
) == 0;
7163 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
7166 struct bfd_elf_version_expr
*e
, *next
;
7167 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
7169 for (e
= head
->list
; e
; e
= e
->next
)
7173 head
->mask
|= e
->mask
;
7178 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
7179 version_expr_head_eq
, NULL
);
7180 list_loc
= &head
->list
;
7181 remaining_loc
= &head
->remaining
;
7182 for (e
= head
->list
; e
; e
= next
)
7188 remaining_loc
= &e
->next
;
7192 void **loc
= htab_find_slot (head
->htab
, e
, INSERT
);
7196 struct bfd_elf_version_expr
*e1
, *last
;
7202 if (e1
->mask
== e
->mask
)
7210 while (e1
&& strcmp (e1
->symbol
, e
->symbol
) == 0);
7214 /* This is a duplicate. */
7215 /* FIXME: Memory leak. Sometimes pattern is not
7216 xmalloced alone, but in larger chunk of memory. */
7217 /* free (e->symbol); */
7222 e
->next
= last
->next
;
7230 list_loc
= &e
->next
;
7234 *remaining_loc
= NULL
;
7235 *list_loc
= head
->remaining
;
7238 head
->remaining
= head
->list
;
7241 /* This is called when we know the name and dependencies of the
7245 lang_register_vers_node (const char *name
,
7246 struct bfd_elf_version_tree
*version
,
7247 struct bfd_elf_version_deps
*deps
)
7249 struct bfd_elf_version_tree
*t
, **pp
;
7250 struct bfd_elf_version_expr
*e1
;
7255 if ((name
[0] == '\0' && lang_elf_version_info
!= NULL
)
7256 || (lang_elf_version_info
&& lang_elf_version_info
->name
[0] == '\0'))
7258 einfo (_("%X%P: anonymous version tag cannot be combined"
7259 " with other version tags\n"));
7264 /* Make sure this node has a unique name. */
7265 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
7266 if (strcmp (t
->name
, name
) == 0)
7267 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
7269 lang_finalize_version_expr_head (&version
->globals
);
7270 lang_finalize_version_expr_head (&version
->locals
);
7272 /* Check the global and local match names, and make sure there
7273 aren't any duplicates. */
7275 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
7277 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
7279 struct bfd_elf_version_expr
*e2
;
7281 if (t
->locals
.htab
&& e1
->symbol
)
7283 e2
= htab_find (t
->locals
.htab
, e1
);
7284 while (e2
&& strcmp (e1
->symbol
, e2
->symbol
) == 0)
7286 if (e1
->mask
== e2
->mask
)
7287 einfo (_("%X%P: duplicate expression `%s'"
7288 " in version information\n"), e1
->symbol
);
7292 else if (!e1
->symbol
)
7293 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
7294 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
7295 && e1
->mask
== e2
->mask
)
7296 einfo (_("%X%P: duplicate expression `%s'"
7297 " in version information\n"), e1
->pattern
);
7301 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
7303 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
7305 struct bfd_elf_version_expr
*e2
;
7307 if (t
->globals
.htab
&& e1
->symbol
)
7309 e2
= htab_find (t
->globals
.htab
, e1
);
7310 while (e2
&& strcmp (e1
->symbol
, e2
->symbol
) == 0)
7312 if (e1
->mask
== e2
->mask
)
7313 einfo (_("%X%P: duplicate expression `%s'"
7314 " in version information\n"),
7319 else if (!e1
->symbol
)
7320 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
7321 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
7322 && e1
->mask
== e2
->mask
)
7323 einfo (_("%X%P: duplicate expression `%s'"
7324 " in version information\n"), e1
->pattern
);
7328 version
->deps
= deps
;
7329 version
->name
= name
;
7330 if (name
[0] != '\0')
7333 version
->vernum
= version_index
;
7336 version
->vernum
= 0;
7338 for (pp
= &lang_elf_version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
7343 /* This is called when we see a version dependency. */
7345 struct bfd_elf_version_deps
*
7346 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
7348 struct bfd_elf_version_deps
*ret
;
7349 struct bfd_elf_version_tree
*t
;
7351 ret
= xmalloc (sizeof *ret
);
7354 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
7356 if (strcmp (t
->name
, name
) == 0)
7358 ret
->version_needed
= t
;
7363 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
7369 lang_do_version_exports_section (void)
7371 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
7373 LANG_FOR_EACH_INPUT_STATEMENT (is
)
7375 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
7383 contents
= xmalloc (len
);
7384 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
7385 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
7388 while (p
< contents
+ len
)
7390 greg
= lang_new_vers_pattern (greg
, p
, NULL
, FALSE
);
7391 p
= strchr (p
, '\0') + 1;
7394 /* Do not free the contents, as we used them creating the regex. */
7396 /* Do not include this section in the link. */
7397 sec
->flags
|= SEC_EXCLUDE
| SEC_KEEP
;
7400 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, FALSE
);
7401 lang_register_vers_node (command_line
.version_exports_section
,
7402 lang_new_vers_node (greg
, lreg
), NULL
);
7406 lang_add_unique (const char *name
)
7408 struct unique_sections
*ent
;
7410 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
7411 if (strcmp (ent
->name
, name
) == 0)
7414 ent
= xmalloc (sizeof *ent
);
7415 ent
->name
= xstrdup (name
);
7416 ent
->next
= unique_section_list
;
7417 unique_section_list
= ent
;
7420 /* Append the list of dynamic symbols to the existing one. */
7423 lang_append_dynamic_list (struct bfd_elf_version_expr
*dynamic
)
7425 if (link_info
.dynamic_list
)
7427 struct bfd_elf_version_expr
*tail
;
7428 for (tail
= dynamic
; tail
->next
!= NULL
; tail
= tail
->next
)
7430 tail
->next
= link_info
.dynamic_list
->head
.list
;
7431 link_info
.dynamic_list
->head
.list
= dynamic
;
7435 struct bfd_elf_dynamic_list
*d
;
7437 d
= xcalloc (1, sizeof *d
);
7438 d
->head
.list
= dynamic
;
7439 d
->match
= lang_vers_match
;
7440 link_info
.dynamic_list
= d
;
7444 /* Append the list of C++ typeinfo dynamic symbols to the existing
7448 lang_append_dynamic_list_cpp_typeinfo (void)
7450 const char * symbols
[] =
7452 "typeinfo name for*",
7455 struct bfd_elf_version_expr
*dynamic
= NULL
;
7458 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
7459 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
7462 lang_append_dynamic_list (dynamic
);
7465 /* Append the list of C++ operator new and delete dynamic symbols to the
7469 lang_append_dynamic_list_cpp_new (void)
7471 const char * symbols
[] =
7476 struct bfd_elf_version_expr
*dynamic
= NULL
;
7479 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
7480 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
7483 lang_append_dynamic_list (dynamic
);