1 /* Linker command language support.
2 Copyright 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
4 Free Software Foundation, Inc.
6 This file is part of the GNU Binutils.
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software
20 Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
21 MA 02110-1301, USA. */
25 #include "libiberty.h"
26 #include "safe-ctype.h"
45 #define offsetof(TYPE, MEMBER) ((size_t) & (((TYPE*) 0)->MEMBER))
48 /* Locals variables. */
49 static struct obstack stat_obstack
;
50 static struct obstack map_obstack
;
52 #define obstack_chunk_alloc xmalloc
53 #define obstack_chunk_free free
54 static const char *startup_file
;
55 static const char *entry_symbol_default
= "start";
56 static bfd_boolean placed_commons
= FALSE
;
57 static bfd_boolean stripped_excluded_sections
= FALSE
;
58 static lang_output_section_statement_type
*default_common_section
;
59 static bfd_boolean map_option_f
;
60 static bfd_vma print_dot
;
61 static lang_input_statement_type
*first_file
;
62 static const char *current_target
;
63 static lang_statement_list_type statement_list
;
64 static struct bfd_hash_table lang_definedness_table
;
65 static lang_statement_list_type
*stat_save
[10];
66 static lang_statement_list_type
**stat_save_ptr
= &stat_save
[0];
68 /* Forward declarations. */
69 static void exp_init_os (etree_type
*);
70 static void init_map_userdata (bfd
*, asection
*, void *);
71 static lang_input_statement_type
*lookup_name (const char *);
72 static struct bfd_hash_entry
*lang_definedness_newfunc
73 (struct bfd_hash_entry
*, struct bfd_hash_table
*, const char *);
74 static void insert_undefined (const char *);
75 static bfd_boolean
sort_def_symbol (struct bfd_link_hash_entry
*, void *);
76 static void print_statement (lang_statement_union_type
*,
77 lang_output_section_statement_type
*);
78 static void print_statement_list (lang_statement_union_type
*,
79 lang_output_section_statement_type
*);
80 static void print_statements (void);
81 static void print_input_section (asection
*, bfd_boolean
);
82 static bfd_boolean
lang_one_common (struct bfd_link_hash_entry
*, void *);
83 static void lang_record_phdrs (void);
84 static void lang_do_version_exports_section (void);
85 static void lang_finalize_version_expr_head
86 (struct bfd_elf_version_expr_head
*);
88 /* Exported variables. */
89 const char *output_target
;
90 lang_output_section_statement_type
*abs_output_section
;
91 lang_statement_list_type lang_output_section_statement
;
92 lang_statement_list_type
*stat_ptr
= &statement_list
;
93 lang_statement_list_type file_chain
= { NULL
, NULL
};
94 lang_statement_list_type input_file_chain
;
95 struct bfd_sym_chain entry_symbol
= { NULL
, NULL
};
96 const char *entry_section
= ".text";
97 bfd_boolean entry_from_cmdline
;
98 bfd_boolean lang_has_input_file
= FALSE
;
99 bfd_boolean had_output_filename
= FALSE
;
100 bfd_boolean lang_float_flag
= FALSE
;
101 bfd_boolean delete_output_file_on_failure
= FALSE
;
102 struct lang_phdr
*lang_phdr_list
;
103 struct lang_nocrossrefs
*nocrossref_list
;
104 static struct unique_sections
*unique_section_list
;
105 static bfd_boolean ldlang_sysrooted_script
= FALSE
;
107 /* Functions that traverse the linker script and might evaluate
108 DEFINED() need to increment this. */
109 int lang_statement_iteration
= 0;
111 etree_type
*base
; /* Relocation base - or null */
113 /* Return TRUE if the PATTERN argument is a wildcard pattern.
114 Although backslashes are treated specially if a pattern contains
115 wildcards, we do not consider the mere presence of a backslash to
116 be enough to cause the pattern to be treated as a wildcard.
117 That lets us handle DOS filenames more naturally. */
118 #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL)
120 #define new_stat(x, y) \
121 (x##_type *) new_statement (x##_enum, sizeof (x##_type), y)
123 #define outside_section_address(q) \
124 ((q)->output_offset + (q)->output_section->vma)
126 #define outside_symbol_address(q) \
127 ((q)->value + outside_section_address (q->section))
129 #define SECTION_NAME_MAP_LENGTH (16)
132 stat_alloc (size_t size
)
134 return obstack_alloc (&stat_obstack
, size
);
138 name_match (const char *pattern
, const char *name
)
140 if (wildcardp (pattern
))
141 return fnmatch (pattern
, name
, 0);
142 return strcmp (pattern
, name
);
145 /* If PATTERN is of the form archive:file, return a pointer to the
146 separator. If not, return NULL. */
149 archive_path (const char *pattern
)
153 if (link_info
.path_separator
== 0)
156 p
= strchr (pattern
, link_info
.path_separator
);
157 #ifdef HAVE_DOS_BASED_FILE_SYSTEM
158 if (p
== NULL
|| link_info
.path_separator
!= ':')
161 /* Assume a match on the second char is part of drive specifier,
162 as in "c:\silly.dos". */
163 if (p
== pattern
+ 1 && ISALPHA (*pattern
))
164 p
= strchr (p
+ 1, link_info
.path_separator
);
169 /* Given that FILE_SPEC results in a non-NULL SEP result from archive_path,
170 return whether F matches FILE_SPEC. */
173 input_statement_is_archive_path (const char *file_spec
, char *sep
,
174 lang_input_statement_type
*f
)
176 bfd_boolean match
= FALSE
;
179 || name_match (sep
+ 1, f
->filename
) == 0)
180 && ((sep
!= file_spec
)
181 == (f
->the_bfd
!= NULL
&& f
->the_bfd
->my_archive
!= NULL
)))
185 if (sep
!= file_spec
)
187 const char *aname
= f
->the_bfd
->my_archive
->filename
;
189 match
= name_match (file_spec
, aname
) == 0;
190 *sep
= link_info
.path_separator
;
197 unique_section_p (const asection
*sec
)
199 struct unique_sections
*unam
;
202 if (link_info
.relocatable
203 && sec
->owner
!= NULL
204 && bfd_is_group_section (sec
->owner
, sec
))
208 for (unam
= unique_section_list
; unam
; unam
= unam
->next
)
209 if (name_match (unam
->name
, secnam
) == 0)
215 /* Generic traversal routines for finding matching sections. */
217 /* Try processing a section against a wildcard. This just calls
218 the callback unless the filename exclusion list is present
219 and excludes the file. It's hardly ever present so this
220 function is very fast. */
223 walk_wild_consider_section (lang_wild_statement_type
*ptr
,
224 lang_input_statement_type
*file
,
226 struct wildcard_list
*sec
,
230 struct name_list
*list_tmp
;
232 /* Don't process sections from files which were excluded. */
233 for (list_tmp
= sec
->spec
.exclude_name_list
;
235 list_tmp
= list_tmp
->next
)
237 char *p
= archive_path (list_tmp
->name
);
241 if (input_statement_is_archive_path (list_tmp
->name
, p
, file
))
245 else if (name_match (list_tmp
->name
, file
->filename
) == 0)
248 /* FIXME: Perhaps remove the following at some stage? Matching
249 unadorned archives like this was never documented and has
250 been superceded by the archive:path syntax. */
251 else if (file
->the_bfd
!= NULL
252 && file
->the_bfd
->my_archive
!= NULL
253 && name_match (list_tmp
->name
,
254 file
->the_bfd
->my_archive
->filename
) == 0)
258 (*callback
) (ptr
, sec
, s
, file
, data
);
261 /* Lowest common denominator routine that can handle everything correctly,
265 walk_wild_section_general (lang_wild_statement_type
*ptr
,
266 lang_input_statement_type
*file
,
271 struct wildcard_list
*sec
;
273 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
275 sec
= ptr
->section_list
;
277 (*callback
) (ptr
, sec
, s
, file
, data
);
281 bfd_boolean skip
= FALSE
;
283 if (sec
->spec
.name
!= NULL
)
285 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
287 skip
= name_match (sec
->spec
.name
, sname
) != 0;
291 walk_wild_consider_section (ptr
, file
, s
, sec
, callback
, data
);
298 /* Routines to find a single section given its name. If there's more
299 than one section with that name, we report that. */
303 asection
*found_section
;
304 bfd_boolean multiple_sections_found
;
305 } section_iterator_callback_data
;
308 section_iterator_callback (bfd
*bfd ATTRIBUTE_UNUSED
, asection
*s
, void *data
)
310 section_iterator_callback_data
*d
= 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
;
929 push_stat_ptr (lang_statement_list_type
*new_ptr
)
931 if (stat_save_ptr
>= stat_save
+ sizeof (stat_save
) / sizeof (stat_save
[0]))
933 *stat_save_ptr
++ = stat_ptr
;
940 if (stat_save_ptr
<= stat_save
)
942 stat_ptr
= *--stat_save_ptr
;
945 /* Build a new statement node for the parse tree. */
947 static lang_statement_union_type
*
948 new_statement (enum statement_enum type
,
950 lang_statement_list_type
*list
)
952 lang_statement_union_type
*new_stmt
;
954 new_stmt
= (lang_statement_union_type
*) stat_alloc (size
);
955 new_stmt
->header
.type
= type
;
956 new_stmt
->header
.next
= NULL
;
957 lang_statement_append (list
, new_stmt
, &new_stmt
->header
.next
);
961 /* Build a new input file node for the language. There are several
962 ways in which we treat an input file, eg, we only look at symbols,
963 or prefix it with a -l etc.
965 We can be supplied with requests for input files more than once;
966 they may, for example be split over several lines like foo.o(.text)
967 foo.o(.data) etc, so when asked for a file we check that we haven't
968 got it already so we don't duplicate the bfd. */
970 static lang_input_statement_type
*
971 new_afile (const char *name
,
972 lang_input_file_enum_type file_type
,
974 bfd_boolean add_to_list
)
976 lang_input_statement_type
*p
;
979 p
= (lang_input_statement_type
*) new_stat (lang_input_statement
, stat_ptr
);
982 p
= (lang_input_statement_type
*)
983 stat_alloc (sizeof (lang_input_statement_type
));
984 p
->header
.type
= lang_input_statement_enum
;
985 p
->header
.next
= NULL
;
988 lang_has_input_file
= TRUE
;
990 p
->sysrooted
= FALSE
;
992 if (file_type
== lang_input_file_is_l_enum
993 && name
[0] == ':' && name
[1] != '\0')
995 file_type
= lang_input_file_is_search_file_enum
;
1001 case lang_input_file_is_symbols_only_enum
:
1003 p
->is_archive
= FALSE
;
1005 p
->local_sym_name
= name
;
1006 p
->just_syms_flag
= TRUE
;
1007 p
->search_dirs_flag
= FALSE
;
1009 case lang_input_file_is_fake_enum
:
1011 p
->is_archive
= FALSE
;
1013 p
->local_sym_name
= name
;
1014 p
->just_syms_flag
= FALSE
;
1015 p
->search_dirs_flag
= FALSE
;
1017 case lang_input_file_is_l_enum
:
1018 p
->is_archive
= TRUE
;
1021 p
->local_sym_name
= concat ("-l", name
, (const char *) NULL
);
1022 p
->just_syms_flag
= FALSE
;
1023 p
->search_dirs_flag
= TRUE
;
1025 case lang_input_file_is_marker_enum
:
1027 p
->is_archive
= FALSE
;
1029 p
->local_sym_name
= name
;
1030 p
->just_syms_flag
= FALSE
;
1031 p
->search_dirs_flag
= TRUE
;
1033 case lang_input_file_is_search_file_enum
:
1034 p
->sysrooted
= ldlang_sysrooted_script
;
1036 p
->is_archive
= FALSE
;
1038 p
->local_sym_name
= name
;
1039 p
->just_syms_flag
= FALSE
;
1040 p
->search_dirs_flag
= TRUE
;
1042 case lang_input_file_is_file_enum
:
1044 p
->is_archive
= FALSE
;
1046 p
->local_sym_name
= name
;
1047 p
->just_syms_flag
= FALSE
;
1048 p
->search_dirs_flag
= FALSE
;
1054 p
->next_real_file
= NULL
;
1056 p
->dynamic
= config
.dynamic_link
;
1057 p
->add_needed
= add_needed
;
1058 p
->as_needed
= as_needed
;
1059 p
->whole_archive
= whole_archive
;
1061 lang_statement_append (&input_file_chain
,
1062 (lang_statement_union_type
*) p
,
1063 &p
->next_real_file
);
1067 lang_input_statement_type
*
1068 lang_add_input_file (const char *name
,
1069 lang_input_file_enum_type file_type
,
1072 return new_afile (name
, file_type
, target
, TRUE
);
1075 struct out_section_hash_entry
1077 struct bfd_hash_entry root
;
1078 lang_statement_union_type s
;
1081 /* The hash table. */
1083 static struct bfd_hash_table output_section_statement_table
;
1085 /* Support routines for the hash table used by lang_output_section_find,
1086 initialize the table, fill in an entry and remove the table. */
1088 static struct bfd_hash_entry
*
1089 output_section_statement_newfunc (struct bfd_hash_entry
*entry
,
1090 struct bfd_hash_table
*table
,
1093 lang_output_section_statement_type
**nextp
;
1094 struct out_section_hash_entry
*ret
;
1098 entry
= bfd_hash_allocate (table
, sizeof (*ret
));
1103 entry
= bfd_hash_newfunc (entry
, table
, string
);
1107 ret
= (struct out_section_hash_entry
*) entry
;
1108 memset (&ret
->s
, 0, sizeof (ret
->s
));
1109 ret
->s
.header
.type
= lang_output_section_statement_enum
;
1110 ret
->s
.output_section_statement
.subsection_alignment
= -1;
1111 ret
->s
.output_section_statement
.section_alignment
= -1;
1112 ret
->s
.output_section_statement
.block_value
= 1;
1113 lang_list_init (&ret
->s
.output_section_statement
.children
);
1114 lang_statement_append (stat_ptr
, &ret
->s
, &ret
->s
.header
.next
);
1116 /* For every output section statement added to the list, except the
1117 first one, lang_output_section_statement.tail points to the "next"
1118 field of the last element of the list. */
1119 if (lang_output_section_statement
.head
!= NULL
)
1120 ret
->s
.output_section_statement
.prev
1121 = ((lang_output_section_statement_type
*)
1122 ((char *) lang_output_section_statement
.tail
1123 - offsetof (lang_output_section_statement_type
, next
)));
1125 /* GCC's strict aliasing rules prevent us from just casting the
1126 address, so we store the pointer in a variable and cast that
1128 nextp
= &ret
->s
.output_section_statement
.next
;
1129 lang_statement_append (&lang_output_section_statement
,
1131 (lang_statement_union_type
**) nextp
);
1136 output_section_statement_table_init (void)
1138 if (!bfd_hash_table_init_n (&output_section_statement_table
,
1139 output_section_statement_newfunc
,
1140 sizeof (struct out_section_hash_entry
),
1142 einfo (_("%P%F: can not create hash table: %E\n"));
1146 output_section_statement_table_free (void)
1148 bfd_hash_table_free (&output_section_statement_table
);
1151 /* Build enough state so that the parser can build its tree. */
1156 obstack_begin (&stat_obstack
, 1000);
1158 stat_ptr
= &statement_list
;
1160 output_section_statement_table_init ();
1162 lang_list_init (stat_ptr
);
1164 lang_list_init (&input_file_chain
);
1165 lang_list_init (&lang_output_section_statement
);
1166 lang_list_init (&file_chain
);
1167 first_file
= lang_add_input_file (NULL
, lang_input_file_is_marker_enum
,
1169 abs_output_section
=
1170 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME
, 0, TRUE
);
1172 abs_output_section
->bfd_section
= bfd_abs_section_ptr
;
1174 /* The value "3" is ad-hoc, somewhat related to the expected number of
1175 DEFINED expressions in a linker script. For most default linker
1176 scripts, there are none. Why a hash table then? Well, it's somewhat
1177 simpler to re-use working machinery than using a linked list in terms
1178 of code-complexity here in ld, besides the initialization which just
1179 looks like other code here. */
1180 if (!bfd_hash_table_init_n (&lang_definedness_table
,
1181 lang_definedness_newfunc
,
1182 sizeof (struct lang_definedness_hash_entry
),
1184 einfo (_("%P%F: can not create hash table: %E\n"));
1190 output_section_statement_table_free ();
1193 /*----------------------------------------------------------------------
1194 A region is an area of memory declared with the
1195 MEMORY { name:org=exp, len=exp ... }
1198 We maintain a list of all the regions here.
1200 If no regions are specified in the script, then the default is used
1201 which is created when looked up to be the entire data space.
1203 If create is true we are creating a region inside a MEMORY block.
1204 In this case it is probably an error to create a region that has
1205 already been created. If we are not inside a MEMORY block it is
1206 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1207 and so we issue a warning.
1209 Each region has at least one name. The first name is either
1210 DEFAULT_MEMORY_REGION or the name given in the MEMORY block. You can add
1211 alias names to an existing region within a script with
1212 REGION_ALIAS (alias, region_name). Each name corresponds to at most one
1215 static lang_memory_region_type
*lang_memory_region_list
;
1216 static lang_memory_region_type
**lang_memory_region_list_tail
1217 = &lang_memory_region_list
;
1219 lang_memory_region_type
*
1220 lang_memory_region_lookup (const char *const name
, bfd_boolean create
)
1222 lang_memory_region_name
*n
;
1223 lang_memory_region_type
*r
;
1224 lang_memory_region_type
*new_region
;
1226 /* NAME is NULL for LMA memspecs if no region was specified. */
1230 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1231 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1232 if (strcmp (n
->name
, name
) == 0)
1235 einfo (_("%P:%S: warning: redeclaration of memory region `%s'\n"),
1240 if (!create
&& strcmp (name
, DEFAULT_MEMORY_REGION
))
1241 einfo (_("%P:%S: warning: memory region `%s' not declared\n"), name
);
1243 new_region
= (lang_memory_region_type
*)
1244 stat_alloc (sizeof (lang_memory_region_type
));
1246 new_region
->name_list
.name
= xstrdup (name
);
1247 new_region
->name_list
.next
= NULL
;
1248 new_region
->next
= NULL
;
1249 new_region
->origin
= 0;
1250 new_region
->length
= ~(bfd_size_type
) 0;
1251 new_region
->current
= 0;
1252 new_region
->last_os
= NULL
;
1253 new_region
->flags
= 0;
1254 new_region
->not_flags
= 0;
1255 new_region
->had_full_message
= FALSE
;
1257 *lang_memory_region_list_tail
= new_region
;
1258 lang_memory_region_list_tail
= &new_region
->next
;
1264 lang_memory_region_alias (const char * alias
, const char * region_name
)
1266 lang_memory_region_name
* n
;
1267 lang_memory_region_type
* r
;
1268 lang_memory_region_type
* region
;
1270 /* The default region must be unique. This ensures that it is not necessary
1271 to iterate through the name list if someone wants the check if a region is
1272 the default memory region. */
1273 if (strcmp (region_name
, DEFAULT_MEMORY_REGION
) == 0
1274 || strcmp (alias
, DEFAULT_MEMORY_REGION
) == 0)
1275 einfo (_("%F%P:%S: error: alias for default memory region\n"));
1277 /* Look for the target region and check if the alias is not already
1280 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1281 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1283 if (region
== NULL
&& strcmp (n
->name
, region_name
) == 0)
1285 if (strcmp (n
->name
, alias
) == 0)
1286 einfo (_("%F%P:%S: error: redefinition of memory region "
1291 /* Check if the target region exists. */
1293 einfo (_("%F%P:%S: error: memory region `%s' "
1294 "for alias `%s' does not exist\n"),
1298 /* Add alias to region name list. */
1299 n
= stat_alloc (sizeof (lang_memory_region_name
));
1300 n
->name
= xstrdup (alias
);
1301 n
->next
= region
->name_list
.next
;
1302 region
->name_list
.next
= n
;
1305 static lang_memory_region_type
*
1306 lang_memory_default (asection
* section
)
1308 lang_memory_region_type
*p
;
1310 flagword sec_flags
= section
->flags
;
1312 /* Override SEC_DATA to mean a writable section. */
1313 if ((sec_flags
& (SEC_ALLOC
| SEC_READONLY
| SEC_CODE
)) == SEC_ALLOC
)
1314 sec_flags
|= SEC_DATA
;
1316 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1318 if ((p
->flags
& sec_flags
) != 0
1319 && (p
->not_flags
& sec_flags
) == 0)
1324 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
1327 /* Find or create an output_section_statement with the given NAME.
1328 If CONSTRAINT is non-zero match one with that constraint, otherwise
1329 match any non-negative constraint. If CREATE, always make a
1330 new output_section_statement for SPECIAL CONSTRAINT. */
1332 lang_output_section_statement_type
*
1333 lang_output_section_statement_lookup (const char *name
,
1337 struct out_section_hash_entry
*entry
;
1339 entry
= ((struct out_section_hash_entry
*)
1340 bfd_hash_lookup (&output_section_statement_table
, name
,
1345 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1349 if (entry
->s
.output_section_statement
.name
!= NULL
)
1351 /* We have a section of this name, but it might not have the correct
1353 struct out_section_hash_entry
*last_ent
;
1355 name
= entry
->s
.output_section_statement
.name
;
1356 if (create
&& constraint
== SPECIAL
)
1357 /* Not traversing to the end reverses the order of the second
1358 and subsequent SPECIAL sections in the hash table chain,
1359 but that shouldn't matter. */
1364 if (constraint
== entry
->s
.output_section_statement
.constraint
1366 && entry
->s
.output_section_statement
.constraint
>= 0))
1367 return &entry
->s
.output_section_statement
;
1369 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1371 while (entry
!= NULL
1372 && name
== entry
->s
.output_section_statement
.name
);
1378 = ((struct out_section_hash_entry
*)
1379 output_section_statement_newfunc (NULL
,
1380 &output_section_statement_table
,
1384 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1387 entry
->root
= last_ent
->root
;
1388 last_ent
->root
.next
= &entry
->root
;
1391 entry
->s
.output_section_statement
.name
= name
;
1392 entry
->s
.output_section_statement
.constraint
= constraint
;
1393 return &entry
->s
.output_section_statement
;
1396 /* Find the next output_section_statement with the same name as OS.
1397 If CONSTRAINT is non-zero, find one with that constraint otherwise
1398 match any non-negative constraint. */
1400 lang_output_section_statement_type
*
1401 next_matching_output_section_statement (lang_output_section_statement_type
*os
,
1404 /* All output_section_statements are actually part of a
1405 struct out_section_hash_entry. */
1406 struct out_section_hash_entry
*entry
= (struct out_section_hash_entry
*)
1408 - offsetof (struct out_section_hash_entry
, s
.output_section_statement
));
1409 const char *name
= os
->name
;
1411 ASSERT (name
== entry
->root
.string
);
1414 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1416 || name
!= entry
->s
.output_section_statement
.name
)
1419 while (constraint
!= entry
->s
.output_section_statement
.constraint
1421 || entry
->s
.output_section_statement
.constraint
< 0));
1423 return &entry
->s
.output_section_statement
;
1426 /* A variant of lang_output_section_find used by place_orphan.
1427 Returns the output statement that should precede a new output
1428 statement for SEC. If an exact match is found on certain flags,
1431 lang_output_section_statement_type
*
1432 lang_output_section_find_by_flags (const asection
*sec
,
1433 lang_output_section_statement_type
**exact
,
1434 lang_match_sec_type_func match_type
)
1436 lang_output_section_statement_type
*first
, *look
, *found
;
1439 /* We know the first statement on this list is *ABS*. May as well
1441 first
= &lang_output_section_statement
.head
->output_section_statement
;
1442 first
= first
->next
;
1444 /* First try for an exact match. */
1446 for (look
= first
; look
; look
= look
->next
)
1448 flags
= look
->flags
;
1449 if (look
->bfd_section
!= NULL
)
1451 flags
= look
->bfd_section
->flags
;
1452 if (match_type
&& !match_type (link_info
.output_bfd
,
1457 flags
^= sec
->flags
;
1458 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
| SEC_READONLY
1459 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1469 if ((sec
->flags
& SEC_CODE
) != 0
1470 && (sec
->flags
& SEC_ALLOC
) != 0)
1472 /* Try for a rw code section. */
1473 for (look
= first
; look
; look
= look
->next
)
1475 flags
= look
->flags
;
1476 if (look
->bfd_section
!= NULL
)
1478 flags
= look
->bfd_section
->flags
;
1479 if (match_type
&& !match_type (link_info
.output_bfd
,
1484 flags
^= sec
->flags
;
1485 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1486 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1490 else if ((sec
->flags
& (SEC_READONLY
| SEC_THREAD_LOCAL
)) != 0
1491 && (sec
->flags
& SEC_ALLOC
) != 0)
1493 /* .rodata can go after .text, .sdata2 after .rodata. */
1494 for (look
= first
; look
; look
= look
->next
)
1496 flags
= look
->flags
;
1497 if (look
->bfd_section
!= NULL
)
1499 flags
= look
->bfd_section
->flags
;
1500 if (match_type
&& !match_type (link_info
.output_bfd
,
1505 flags
^= sec
->flags
;
1506 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1508 && !(look
->flags
& (SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1512 else if ((sec
->flags
& SEC_SMALL_DATA
) != 0
1513 && (sec
->flags
& SEC_ALLOC
) != 0)
1515 /* .sdata goes after .data, .sbss after .sdata. */
1516 for (look
= first
; look
; look
= look
->next
)
1518 flags
= look
->flags
;
1519 if (look
->bfd_section
!= NULL
)
1521 flags
= look
->bfd_section
->flags
;
1522 if (match_type
&& !match_type (link_info
.output_bfd
,
1527 flags
^= sec
->flags
;
1528 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1529 | SEC_THREAD_LOCAL
))
1530 || ((look
->flags
& SEC_SMALL_DATA
)
1531 && !(sec
->flags
& SEC_HAS_CONTENTS
)))
1535 else if ((sec
->flags
& SEC_HAS_CONTENTS
) != 0
1536 && (sec
->flags
& SEC_ALLOC
) != 0)
1538 /* .data goes after .rodata. */
1539 for (look
= first
; look
; look
= look
->next
)
1541 flags
= look
->flags
;
1542 if (look
->bfd_section
!= NULL
)
1544 flags
= look
->bfd_section
->flags
;
1545 if (match_type
&& !match_type (link_info
.output_bfd
,
1550 flags
^= sec
->flags
;
1551 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1552 | SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1556 else if ((sec
->flags
& SEC_ALLOC
) != 0)
1558 /* .bss goes after any other alloc section. */
1559 for (look
= first
; look
; look
= look
->next
)
1561 flags
= look
->flags
;
1562 if (look
->bfd_section
!= NULL
)
1564 flags
= look
->bfd_section
->flags
;
1565 if (match_type
&& !match_type (link_info
.output_bfd
,
1570 flags
^= sec
->flags
;
1571 if (!(flags
& SEC_ALLOC
))
1577 /* non-alloc go last. */
1578 for (look
= first
; look
; look
= look
->next
)
1580 flags
= look
->flags
;
1581 if (look
->bfd_section
!= NULL
)
1582 flags
= look
->bfd_section
->flags
;
1583 flags
^= sec
->flags
;
1584 if (!(flags
& SEC_DEBUGGING
))
1590 if (found
|| !match_type
)
1593 return lang_output_section_find_by_flags (sec
, NULL
, NULL
);
1596 /* Find the last output section before given output statement.
1597 Used by place_orphan. */
1600 output_prev_sec_find (lang_output_section_statement_type
*os
)
1602 lang_output_section_statement_type
*lookup
;
1604 for (lookup
= os
->prev
; lookup
!= NULL
; lookup
= lookup
->prev
)
1606 if (lookup
->constraint
< 0)
1609 if (lookup
->bfd_section
!= NULL
&& lookup
->bfd_section
->owner
!= NULL
)
1610 return lookup
->bfd_section
;
1616 /* Look for a suitable place for a new output section statement. The
1617 idea is to skip over anything that might be inside a SECTIONS {}
1618 statement in a script, before we find another output section
1619 statement. Assignments to "dot" before an output section statement
1620 are assumed to belong to it, except in two cases; The first
1621 assignment to dot, and assignments before non-alloc sections.
1622 Otherwise we might put an orphan before . = . + SIZEOF_HEADERS or
1623 similar assignments that set the initial address, or we might
1624 insert non-alloc note sections among assignments setting end of
1627 static lang_statement_union_type
**
1628 insert_os_after (lang_output_section_statement_type
*after
)
1630 lang_statement_union_type
**where
;
1631 lang_statement_union_type
**assign
= NULL
;
1632 bfd_boolean ignore_first
;
1635 = after
== &lang_output_section_statement
.head
->output_section_statement
;
1637 for (where
= &after
->header
.next
;
1639 where
= &(*where
)->header
.next
)
1641 switch ((*where
)->header
.type
)
1643 case lang_assignment_statement_enum
:
1646 lang_assignment_statement_type
*ass
;
1648 ass
= &(*where
)->assignment_statement
;
1649 if (ass
->exp
->type
.node_class
!= etree_assert
1650 && ass
->exp
->assign
.dst
[0] == '.'
1651 && ass
->exp
->assign
.dst
[1] == 0
1655 ignore_first
= FALSE
;
1657 case lang_wild_statement_enum
:
1658 case lang_input_section_enum
:
1659 case lang_object_symbols_statement_enum
:
1660 case lang_fill_statement_enum
:
1661 case lang_data_statement_enum
:
1662 case lang_reloc_statement_enum
:
1663 case lang_padding_statement_enum
:
1664 case lang_constructors_statement_enum
:
1667 case lang_output_section_statement_enum
:
1670 asection
*s
= (*where
)->output_section_statement
.bfd_section
;
1673 || s
->map_head
.s
== NULL
1674 || (s
->flags
& SEC_ALLOC
) != 0)
1678 case lang_input_statement_enum
:
1679 case lang_address_statement_enum
:
1680 case lang_target_statement_enum
:
1681 case lang_output_statement_enum
:
1682 case lang_group_statement_enum
:
1683 case lang_insert_statement_enum
:
1692 lang_output_section_statement_type
*
1693 lang_insert_orphan (asection
*s
,
1694 const char *secname
,
1696 lang_output_section_statement_type
*after
,
1697 struct orphan_save
*place
,
1698 etree_type
*address
,
1699 lang_statement_list_type
*add_child
)
1701 lang_statement_list_type add
;
1703 lang_output_section_statement_type
*os
;
1704 lang_output_section_statement_type
**os_tail
;
1706 /* If we have found an appropriate place for the output section
1707 statements for this orphan, add them to our own private list,
1708 inserting them later into the global statement list. */
1711 lang_list_init (&add
);
1712 push_stat_ptr (&add
);
1715 if (link_info
.relocatable
|| (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0)
1716 address
= exp_intop (0);
1718 os_tail
= ((lang_output_section_statement_type
**)
1719 lang_output_section_statement
.tail
);
1720 os
= lang_enter_output_section_statement (secname
, address
, 0, NULL
, NULL
,
1724 if (config
.build_constructors
&& *os_tail
== os
)
1726 /* If the name of the section is representable in C, then create
1727 symbols to mark the start and the end of the section. */
1728 for (ps
= secname
; *ps
!= '\0'; ps
++)
1729 if (! ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
1734 etree_type
*e_align
;
1736 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__start_" + 1);
1737 symname
[0] = bfd_get_symbol_leading_char (link_info
.output_bfd
);
1738 sprintf (symname
+ (symname
[0] != 0), "__start_%s", secname
);
1739 e_align
= exp_unop (ALIGN_K
,
1740 exp_intop ((bfd_vma
) 1 << s
->alignment_power
));
1741 lang_add_assignment (exp_assop ('=', ".", e_align
));
1742 lang_add_assignment (exp_provide (symname
,
1744 exp_nameop (NAME
, ".")),
1749 if (add_child
== NULL
)
1750 add_child
= &os
->children
;
1751 lang_add_section (add_child
, s
, os
);
1753 lang_leave_output_section_statement (0, "*default*", NULL
, NULL
);
1755 if (ps
!= NULL
&& *ps
== '\0')
1759 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__stop_" + 1);
1760 symname
[0] = bfd_get_symbol_leading_char (link_info
.output_bfd
);
1761 sprintf (symname
+ (symname
[0] != 0), "__stop_%s", secname
);
1762 lang_add_assignment (exp_provide (symname
,
1763 exp_nameop (NAME
, "."),
1767 /* Restore the global list pointer. */
1771 if (after
!= NULL
&& os
->bfd_section
!= NULL
)
1773 asection
*snew
, *as
;
1775 snew
= os
->bfd_section
;
1777 /* Shuffle the bfd section list to make the output file look
1778 neater. This is really only cosmetic. */
1779 if (place
->section
== NULL
1780 && after
!= (&lang_output_section_statement
.head
1781 ->output_section_statement
))
1783 asection
*bfd_section
= after
->bfd_section
;
1785 /* If the output statement hasn't been used to place any input
1786 sections (and thus doesn't have an output bfd_section),
1787 look for the closest prior output statement having an
1789 if (bfd_section
== NULL
)
1790 bfd_section
= output_prev_sec_find (after
);
1792 if (bfd_section
!= NULL
&& bfd_section
!= snew
)
1793 place
->section
= &bfd_section
->next
;
1796 if (place
->section
== NULL
)
1797 place
->section
= &link_info
.output_bfd
->sections
;
1799 as
= *place
->section
;
1803 /* Put the section at the end of the list. */
1805 /* Unlink the section. */
1806 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1808 /* Now tack it back on in the right place. */
1809 bfd_section_list_append (link_info
.output_bfd
, snew
);
1811 else if (as
!= snew
&& as
->prev
!= snew
)
1813 /* Unlink the section. */
1814 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1816 /* Now tack it back on in the right place. */
1817 bfd_section_list_insert_before (link_info
.output_bfd
, as
, snew
);
1820 /* Save the end of this list. Further ophans of this type will
1821 follow the one we've just added. */
1822 place
->section
= &snew
->next
;
1824 /* The following is non-cosmetic. We try to put the output
1825 statements in some sort of reasonable order here, because they
1826 determine the final load addresses of the orphan sections.
1827 In addition, placing output statements in the wrong order may
1828 require extra segments. For instance, given a typical
1829 situation of all read-only sections placed in one segment and
1830 following that a segment containing all the read-write
1831 sections, we wouldn't want to place an orphan read/write
1832 section before or amongst the read-only ones. */
1833 if (add
.head
!= NULL
)
1835 lang_output_section_statement_type
*newly_added_os
;
1837 if (place
->stmt
== NULL
)
1839 lang_statement_union_type
**where
= insert_os_after (after
);
1844 place
->os_tail
= &after
->next
;
1848 /* Put it after the last orphan statement we added. */
1849 *add
.tail
= *place
->stmt
;
1850 *place
->stmt
= add
.head
;
1853 /* Fix the global list pointer if we happened to tack our
1854 new list at the tail. */
1855 if (*stat_ptr
->tail
== add
.head
)
1856 stat_ptr
->tail
= add
.tail
;
1858 /* Save the end of this list. */
1859 place
->stmt
= add
.tail
;
1861 /* Do the same for the list of output section statements. */
1862 newly_added_os
= *os_tail
;
1864 newly_added_os
->prev
= (lang_output_section_statement_type
*)
1865 ((char *) place
->os_tail
1866 - offsetof (lang_output_section_statement_type
, next
));
1867 newly_added_os
->next
= *place
->os_tail
;
1868 if (newly_added_os
->next
!= NULL
)
1869 newly_added_os
->next
->prev
= newly_added_os
;
1870 *place
->os_tail
= newly_added_os
;
1871 place
->os_tail
= &newly_added_os
->next
;
1873 /* Fixing the global list pointer here is a little different.
1874 We added to the list in lang_enter_output_section_statement,
1875 trimmed off the new output_section_statment above when
1876 assigning *os_tail = NULL, but possibly added it back in
1877 the same place when assigning *place->os_tail. */
1878 if (*os_tail
== NULL
)
1879 lang_output_section_statement
.tail
1880 = (lang_statement_union_type
**) os_tail
;
1887 lang_map_flags (flagword flag
)
1889 if (flag
& SEC_ALLOC
)
1892 if (flag
& SEC_CODE
)
1895 if (flag
& SEC_READONLY
)
1898 if (flag
& SEC_DATA
)
1901 if (flag
& SEC_LOAD
)
1908 lang_memory_region_type
*m
;
1909 bfd_boolean dis_header_printed
= FALSE
;
1912 LANG_FOR_EACH_INPUT_STATEMENT (file
)
1916 if ((file
->the_bfd
->flags
& (BFD_LINKER_CREATED
| DYNAMIC
)) != 0
1917 || file
->just_syms_flag
)
1920 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
1921 if ((s
->output_section
== NULL
1922 || s
->output_section
->owner
!= link_info
.output_bfd
)
1923 && (s
->flags
& (SEC_LINKER_CREATED
| SEC_KEEP
)) == 0)
1925 if (! dis_header_printed
)
1927 fprintf (config
.map_file
, _("\nDiscarded input sections\n\n"));
1928 dis_header_printed
= TRUE
;
1931 print_input_section (s
, TRUE
);
1935 minfo (_("\nMemory Configuration\n\n"));
1936 fprintf (config
.map_file
, "%-16s %-18s %-18s %s\n",
1937 _("Name"), _("Origin"), _("Length"), _("Attributes"));
1939 for (m
= lang_memory_region_list
; m
!= NULL
; m
= m
->next
)
1944 fprintf (config
.map_file
, "%-16s ", m
->name_list
.name
);
1946 sprintf_vma (buf
, m
->origin
);
1947 minfo ("0x%s ", buf
);
1955 minfo ("0x%V", m
->length
);
1956 if (m
->flags
|| m
->not_flags
)
1964 lang_map_flags (m
->flags
);
1970 lang_map_flags (m
->not_flags
);
1977 fprintf (config
.map_file
, _("\nLinker script and memory map\n\n"));
1979 if (! link_info
.reduce_memory_overheads
)
1981 obstack_begin (&map_obstack
, 1000);
1982 for (p
= link_info
.input_bfds
; p
!= (bfd
*) NULL
; p
= p
->link_next
)
1983 bfd_map_over_sections (p
, init_map_userdata
, 0);
1984 bfd_link_hash_traverse (link_info
.hash
, sort_def_symbol
, 0);
1986 lang_statement_iteration
++;
1987 print_statements ();
1991 init_map_userdata (bfd
*abfd ATTRIBUTE_UNUSED
,
1993 void *data ATTRIBUTE_UNUSED
)
1995 fat_section_userdata_type
*new_data
1996 = ((fat_section_userdata_type
*) (stat_alloc
1997 (sizeof (fat_section_userdata_type
))));
1999 ASSERT (get_userdata (sec
) == NULL
);
2000 get_userdata (sec
) = new_data
;
2001 new_data
->map_symbol_def_tail
= &new_data
->map_symbol_def_head
;
2002 new_data
->map_symbol_def_count
= 0;
2006 sort_def_symbol (struct bfd_link_hash_entry
*hash_entry
,
2007 void *info ATTRIBUTE_UNUSED
)
2009 if (hash_entry
->type
== bfd_link_hash_defined
2010 || hash_entry
->type
== bfd_link_hash_defweak
)
2012 struct fat_user_section_struct
*ud
;
2013 struct map_symbol_def
*def
;
2015 ud
= get_userdata (hash_entry
->u
.def
.section
);
2018 /* ??? What do we have to do to initialize this beforehand? */
2019 /* The first time we get here is bfd_abs_section... */
2020 init_map_userdata (0, hash_entry
->u
.def
.section
, 0);
2021 ud
= get_userdata (hash_entry
->u
.def
.section
);
2023 else if (!ud
->map_symbol_def_tail
)
2024 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
2026 def
= obstack_alloc (&map_obstack
, sizeof *def
);
2027 def
->entry
= hash_entry
;
2028 *(ud
->map_symbol_def_tail
) = def
;
2029 ud
->map_symbol_def_tail
= &def
->next
;
2030 ud
->map_symbol_def_count
++;
2035 /* Initialize an output section. */
2038 init_os (lang_output_section_statement_type
*s
, asection
*isec
,
2041 if (s
->bfd_section
!= NULL
)
2044 if (strcmp (s
->name
, DISCARD_SECTION_NAME
) == 0)
2045 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME
);
2047 if (s
->constraint
!= SPECIAL
)
2048 s
->bfd_section
= bfd_get_section_by_name (link_info
.output_bfd
, s
->name
);
2049 if (s
->bfd_section
== NULL
)
2050 s
->bfd_section
= bfd_make_section_anyway_with_flags (link_info
.output_bfd
,
2052 if (s
->bfd_section
== NULL
)
2054 einfo (_("%P%F: output format %s cannot represent section called %s\n"),
2055 link_info
.output_bfd
->xvec
->name
, s
->name
);
2057 s
->bfd_section
->output_section
= s
->bfd_section
;
2058 s
->bfd_section
->output_offset
= 0;
2060 if (!link_info
.reduce_memory_overheads
)
2062 fat_section_userdata_type
*new_userdata
= (fat_section_userdata_type
*)
2063 stat_alloc (sizeof (fat_section_userdata_type
));
2064 memset (new_userdata
, 0, sizeof (fat_section_userdata_type
));
2065 get_userdata (s
->bfd_section
) = new_userdata
;
2068 /* If there is a base address, make sure that any sections it might
2069 mention are initialized. */
2070 if (s
->addr_tree
!= NULL
)
2071 exp_init_os (s
->addr_tree
);
2073 if (s
->load_base
!= NULL
)
2074 exp_init_os (s
->load_base
);
2076 /* If supplied an alignment, set it. */
2077 if (s
->section_alignment
!= -1)
2078 s
->bfd_section
->alignment_power
= s
->section_alignment
;
2081 bfd_init_private_section_data (isec
->owner
, isec
,
2082 link_info
.output_bfd
, s
->bfd_section
,
2086 /* Make sure that all output sections mentioned in an expression are
2090 exp_init_os (etree_type
*exp
)
2092 switch (exp
->type
.node_class
)
2096 exp_init_os (exp
->assign
.src
);
2100 exp_init_os (exp
->binary
.lhs
);
2101 exp_init_os (exp
->binary
.rhs
);
2105 exp_init_os (exp
->trinary
.cond
);
2106 exp_init_os (exp
->trinary
.lhs
);
2107 exp_init_os (exp
->trinary
.rhs
);
2111 exp_init_os (exp
->assert_s
.child
);
2115 exp_init_os (exp
->unary
.child
);
2119 switch (exp
->type
.node_code
)
2125 lang_output_section_statement_type
*os
;
2127 os
= lang_output_section_find (exp
->name
.name
);
2128 if (os
!= NULL
&& os
->bfd_section
== NULL
)
2129 init_os (os
, NULL
, 0);
2140 section_already_linked (bfd
*abfd
, asection
*sec
, void *data
)
2142 lang_input_statement_type
*entry
= data
;
2144 /* If we are only reading symbols from this object, then we want to
2145 discard all sections. */
2146 if (entry
->just_syms_flag
)
2148 bfd_link_just_syms (abfd
, sec
, &link_info
);
2152 if (!(abfd
->flags
& DYNAMIC
))
2153 bfd_section_already_linked (abfd
, sec
, &link_info
);
2156 /* The wild routines.
2158 These expand statements like *(.text) and foo.o to a list of
2159 explicit actions, like foo.o(.text), bar.o(.text) and
2160 foo.o(.text, .data). */
2162 /* Add SECTION to the output section OUTPUT. Do this by creating a
2163 lang_input_section statement which is placed at PTR. FILE is the
2164 input file which holds SECTION. */
2167 lang_add_section (lang_statement_list_type
*ptr
,
2169 lang_output_section_statement_type
*output
)
2171 flagword flags
= section
->flags
;
2172 bfd_boolean discard
;
2174 /* Discard sections marked with SEC_EXCLUDE. */
2175 discard
= (flags
& SEC_EXCLUDE
) != 0;
2177 /* Discard input sections which are assigned to a section named
2178 DISCARD_SECTION_NAME. */
2179 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
2182 /* Discard debugging sections if we are stripping debugging
2184 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
2185 && (flags
& SEC_DEBUGGING
) != 0)
2190 if (section
->output_section
== NULL
)
2192 /* This prevents future calls from assigning this section. */
2193 section
->output_section
= bfd_abs_section_ptr
;
2198 if (section
->output_section
== NULL
)
2201 lang_input_section_type
*new_section
;
2204 flags
= section
->flags
;
2206 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2207 to an output section, because we want to be able to include a
2208 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2209 section (I don't know why we want to do this, but we do).
2210 build_link_order in ldwrite.c handles this case by turning
2211 the embedded SEC_NEVER_LOAD section into a fill. */
2213 flags
&= ~ SEC_NEVER_LOAD
;
2215 switch (output
->sectype
)
2217 case normal_section
:
2218 case overlay_section
:
2220 case noalloc_section
:
2221 flags
&= ~SEC_ALLOC
;
2223 case noload_section
:
2225 flags
|= SEC_NEVER_LOAD
;
2229 if (output
->bfd_section
== NULL
)
2230 init_os (output
, section
, flags
);
2232 first
= ! output
->bfd_section
->linker_has_input
;
2233 output
->bfd_section
->linker_has_input
= 1;
2235 if (!link_info
.relocatable
2236 && !stripped_excluded_sections
)
2238 asection
*s
= output
->bfd_section
->map_tail
.s
;
2239 output
->bfd_section
->map_tail
.s
= section
;
2240 section
->map_head
.s
= NULL
;
2241 section
->map_tail
.s
= s
;
2243 s
->map_head
.s
= section
;
2245 output
->bfd_section
->map_head
.s
= section
;
2248 /* Add a section reference to the list. */
2249 new_section
= new_stat (lang_input_section
, ptr
);
2251 new_section
->section
= section
;
2252 section
->output_section
= output
->bfd_section
;
2254 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2255 already been processed. One reason to do this is that on pe
2256 format targets, .text$foo sections go into .text and it's odd
2257 to see .text with SEC_LINK_ONCE set. */
2259 if (! link_info
.relocatable
)
2260 flags
&= ~ (SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
);
2262 /* If this is not the first input section, and the SEC_READONLY
2263 flag is not currently set, then don't set it just because the
2264 input section has it set. */
2266 if (! first
&& (output
->bfd_section
->flags
& SEC_READONLY
) == 0)
2267 flags
&= ~ SEC_READONLY
;
2269 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2271 && ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
2272 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
2273 || ((flags
& SEC_MERGE
)
2274 && output
->bfd_section
->entsize
!= section
->entsize
)))
2276 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2277 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2280 output
->bfd_section
->flags
|= flags
;
2282 if (flags
& SEC_MERGE
)
2283 output
->bfd_section
->entsize
= section
->entsize
;
2285 /* If SEC_READONLY is not set in the input section, then clear
2286 it from the output section. */
2287 if ((section
->flags
& SEC_READONLY
) == 0)
2288 output
->bfd_section
->flags
&= ~SEC_READONLY
;
2290 /* Copy over SEC_SMALL_DATA. */
2291 if (section
->flags
& SEC_SMALL_DATA
)
2292 output
->bfd_section
->flags
|= SEC_SMALL_DATA
;
2294 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
2295 output
->bfd_section
->alignment_power
= section
->alignment_power
;
2297 if (bfd_get_arch (section
->owner
) == bfd_arch_tic54x
2298 && (section
->flags
& SEC_TIC54X_BLOCK
) != 0)
2300 output
->bfd_section
->flags
|= SEC_TIC54X_BLOCK
;
2301 /* FIXME: This value should really be obtained from the bfd... */
2302 output
->block_value
= 128;
2307 /* Handle wildcard sorting. This returns the lang_input_section which
2308 should follow the one we are going to create for SECTION and FILE,
2309 based on the sorting requirements of WILD. It returns NULL if the
2310 new section should just go at the end of the current list. */
2312 static lang_statement_union_type
*
2313 wild_sort (lang_wild_statement_type
*wild
,
2314 struct wildcard_list
*sec
,
2315 lang_input_statement_type
*file
,
2318 const char *section_name
;
2319 lang_statement_union_type
*l
;
2321 if (!wild
->filenames_sorted
2322 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2325 section_name
= bfd_get_section_name (file
->the_bfd
, section
);
2326 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2328 lang_input_section_type
*ls
;
2330 if (l
->header
.type
!= lang_input_section_enum
)
2332 ls
= &l
->input_section
;
2334 /* Sorting by filename takes precedence over sorting by section
2337 if (wild
->filenames_sorted
)
2339 const char *fn
, *ln
;
2343 /* The PE support for the .idata section as generated by
2344 dlltool assumes that files will be sorted by the name of
2345 the archive and then the name of the file within the
2348 if (file
->the_bfd
!= NULL
2349 && bfd_my_archive (file
->the_bfd
) != NULL
)
2351 fn
= bfd_get_filename (bfd_my_archive (file
->the_bfd
));
2356 fn
= file
->filename
;
2360 if (bfd_my_archive (ls
->section
->owner
) != NULL
)
2362 ln
= bfd_get_filename (bfd_my_archive (ls
->section
->owner
));
2367 ln
= ls
->section
->owner
->filename
;
2371 i
= strcmp (fn
, ln
);
2380 fn
= file
->filename
;
2382 ln
= ls
->section
->owner
->filename
;
2384 i
= strcmp (fn
, ln
);
2392 /* Here either the files are not sorted by name, or we are
2393 looking at the sections for this file. */
2395 if (sec
!= NULL
&& sec
->spec
.sorted
!= none
)
2396 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2403 /* Expand a wild statement for a particular FILE. SECTION may be
2404 NULL, in which case it is a wild card. */
2407 output_section_callback (lang_wild_statement_type
*ptr
,
2408 struct wildcard_list
*sec
,
2410 lang_input_statement_type
*file
,
2413 lang_statement_union_type
*before
;
2415 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2416 if (unique_section_p (section
))
2419 before
= wild_sort (ptr
, sec
, file
, section
);
2421 /* Here BEFORE points to the lang_input_section which
2422 should follow the one we are about to add. If BEFORE
2423 is NULL, then the section should just go at the end
2424 of the current list. */
2427 lang_add_section (&ptr
->children
, section
,
2428 (lang_output_section_statement_type
*) output
);
2431 lang_statement_list_type list
;
2432 lang_statement_union_type
**pp
;
2434 lang_list_init (&list
);
2435 lang_add_section (&list
, section
,
2436 (lang_output_section_statement_type
*) output
);
2438 /* If we are discarding the section, LIST.HEAD will
2440 if (list
.head
!= NULL
)
2442 ASSERT (list
.head
->header
.next
== NULL
);
2444 for (pp
= &ptr
->children
.head
;
2446 pp
= &(*pp
)->header
.next
)
2447 ASSERT (*pp
!= NULL
);
2449 list
.head
->header
.next
= *pp
;
2455 /* Check if all sections in a wild statement for a particular FILE
2459 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2460 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2462 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2465 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2466 if (unique_section_p (section
))
2469 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2470 ((lang_output_section_statement_type
*) data
)->all_input_readonly
= FALSE
;
2473 /* This is passed a file name which must have been seen already and
2474 added to the statement tree. We will see if it has been opened
2475 already and had its symbols read. If not then we'll read it. */
2477 static lang_input_statement_type
*
2478 lookup_name (const char *name
)
2480 lang_input_statement_type
*search
;
2482 for (search
= (lang_input_statement_type
*) input_file_chain
.head
;
2484 search
= (lang_input_statement_type
*) search
->next_real_file
)
2486 /* Use the local_sym_name as the name of the file that has
2487 already been loaded as filename might have been transformed
2488 via the search directory lookup mechanism. */
2489 const char *filename
= search
->local_sym_name
;
2491 if (filename
!= NULL
2492 && strcmp (filename
, name
) == 0)
2497 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2498 default_target
, FALSE
);
2500 /* If we have already added this file, or this file is not real
2501 don't add this file. */
2502 if (search
->loaded
|| !search
->real
)
2505 if (! load_symbols (search
, NULL
))
2511 /* Save LIST as a list of libraries whose symbols should not be exported. */
2516 struct excluded_lib
*next
;
2518 static struct excluded_lib
*excluded_libs
;
2521 add_excluded_libs (const char *list
)
2523 const char *p
= list
, *end
;
2527 struct excluded_lib
*entry
;
2528 end
= strpbrk (p
, ",:");
2530 end
= p
+ strlen (p
);
2531 entry
= xmalloc (sizeof (*entry
));
2532 entry
->next
= excluded_libs
;
2533 entry
->name
= xmalloc (end
- p
+ 1);
2534 memcpy (entry
->name
, p
, end
- p
);
2535 entry
->name
[end
- p
] = '\0';
2536 excluded_libs
= entry
;
2544 check_excluded_libs (bfd
*abfd
)
2546 struct excluded_lib
*lib
= excluded_libs
;
2550 int len
= strlen (lib
->name
);
2551 const char *filename
= lbasename (abfd
->filename
);
2553 if (strcmp (lib
->name
, "ALL") == 0)
2555 abfd
->no_export
= TRUE
;
2559 if (strncmp (lib
->name
, filename
, len
) == 0
2560 && (filename
[len
] == '\0'
2561 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
2562 && filename
[len
+ 2] == '\0')))
2564 abfd
->no_export
= TRUE
;
2572 /* Get the symbols for an input file. */
2575 load_symbols (lang_input_statement_type
*entry
,
2576 lang_statement_list_type
*place
)
2583 ldfile_open_file (entry
);
2585 if (! bfd_check_format (entry
->the_bfd
, bfd_archive
)
2586 && ! bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
2589 bfd_boolean save_ldlang_sysrooted_script
;
2590 bfd_boolean save_as_needed
, save_add_needed
;
2592 err
= bfd_get_error ();
2594 /* See if the emulation has some special knowledge. */
2595 if (ldemul_unrecognized_file (entry
))
2598 if (err
== bfd_error_file_ambiguously_recognized
)
2602 einfo (_("%B: file not recognized: %E\n"), entry
->the_bfd
);
2603 einfo (_("%B: matching formats:"), entry
->the_bfd
);
2604 for (p
= matching
; *p
!= NULL
; p
++)
2608 else if (err
!= bfd_error_file_not_recognized
2610 einfo (_("%F%B: file not recognized: %E\n"), entry
->the_bfd
);
2612 bfd_close (entry
->the_bfd
);
2613 entry
->the_bfd
= NULL
;
2615 /* Try to interpret the file as a linker script. */
2616 ldfile_open_command_file (entry
->filename
);
2618 push_stat_ptr (place
);
2619 save_ldlang_sysrooted_script
= ldlang_sysrooted_script
;
2620 ldlang_sysrooted_script
= entry
->sysrooted
;
2621 save_as_needed
= as_needed
;
2622 as_needed
= entry
->as_needed
;
2623 save_add_needed
= add_needed
;
2624 add_needed
= entry
->add_needed
;
2626 ldfile_assumed_script
= TRUE
;
2627 parser_input
= input_script
;
2628 /* We want to use the same -Bdynamic/-Bstatic as the one for
2630 config
.dynamic_link
= entry
->dynamic
;
2632 ldfile_assumed_script
= FALSE
;
2634 ldlang_sysrooted_script
= save_ldlang_sysrooted_script
;
2635 as_needed
= save_as_needed
;
2636 add_needed
= save_add_needed
;
2642 if (ldemul_recognized_file (entry
))
2645 /* We don't call ldlang_add_file for an archive. Instead, the
2646 add_symbols entry point will call ldlang_add_file, via the
2647 add_archive_element callback, for each element of the archive
2649 switch (bfd_get_format (entry
->the_bfd
))
2655 ldlang_add_file (entry
);
2656 if (trace_files
|| trace_file_tries
)
2657 info_msg ("%I\n", entry
);
2661 check_excluded_libs (entry
->the_bfd
);
2663 if (entry
->whole_archive
)
2666 bfd_boolean loaded
= TRUE
;
2670 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
2675 if (! bfd_check_format (member
, bfd_object
))
2677 einfo (_("%F%B: member %B in archive is not an object\n"),
2678 entry
->the_bfd
, member
);
2682 if (! ((*link_info
.callbacks
->add_archive_element
)
2683 (&link_info
, member
, "--whole-archive")))
2686 if (! bfd_link_add_symbols (member
, &link_info
))
2688 einfo (_("%F%B: could not read symbols: %E\n"), member
);
2693 entry
->loaded
= loaded
;
2699 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
2700 entry
->loaded
= TRUE
;
2702 einfo (_("%F%B: could not read symbols: %E\n"), entry
->the_bfd
);
2704 return entry
->loaded
;
2707 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2708 may be NULL, indicating that it is a wildcard. Separate
2709 lang_input_section statements are created for each part of the
2710 expansion; they are added after the wild statement S. OUTPUT is
2711 the output section. */
2714 wild (lang_wild_statement_type
*s
,
2715 const char *target ATTRIBUTE_UNUSED
,
2716 lang_output_section_statement_type
*output
)
2718 struct wildcard_list
*sec
;
2720 if (s
->handler_data
[0]
2721 && s
->handler_data
[0]->spec
.sorted
== by_name
2722 && !s
->filenames_sorted
)
2724 lang_section_bst_type
*tree
;
2726 walk_wild (s
, output_section_callback_fast
, output
);
2731 output_section_callback_tree_to_list (s
, tree
, output
);
2736 walk_wild (s
, output_section_callback
, output
);
2738 if (default_common_section
== NULL
)
2739 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
2740 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
2742 /* Remember the section that common is going to in case we
2743 later get something which doesn't know where to put it. */
2744 default_common_section
= output
;
2749 /* Return TRUE iff target is the sought target. */
2752 get_target (const bfd_target
*target
, void *data
)
2754 const char *sought
= data
;
2756 return strcmp (target
->name
, sought
) == 0;
2759 /* Like strcpy() but convert to lower case as well. */
2762 stricpy (char *dest
, char *src
)
2766 while ((c
= *src
++) != 0)
2767 *dest
++ = TOLOWER (c
);
2772 /* Remove the first occurrence of needle (if any) in haystack
2776 strcut (char *haystack
, char *needle
)
2778 haystack
= strstr (haystack
, needle
);
2784 for (src
= haystack
+ strlen (needle
); *src
;)
2785 *haystack
++ = *src
++;
2791 /* Compare two target format name strings.
2792 Return a value indicating how "similar" they are. */
2795 name_compare (char *first
, char *second
)
2801 copy1
= xmalloc (strlen (first
) + 1);
2802 copy2
= xmalloc (strlen (second
) + 1);
2804 /* Convert the names to lower case. */
2805 stricpy (copy1
, first
);
2806 stricpy (copy2
, second
);
2808 /* Remove size and endian strings from the name. */
2809 strcut (copy1
, "big");
2810 strcut (copy1
, "little");
2811 strcut (copy2
, "big");
2812 strcut (copy2
, "little");
2814 /* Return a value based on how many characters match,
2815 starting from the beginning. If both strings are
2816 the same then return 10 * their length. */
2817 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
2818 if (copy1
[result
] == 0)
2830 /* Set by closest_target_match() below. */
2831 static const bfd_target
*winner
;
2833 /* Scan all the valid bfd targets looking for one that has the endianness
2834 requirement that was specified on the command line, and is the nearest
2835 match to the original output target. */
2838 closest_target_match (const bfd_target
*target
, void *data
)
2840 const bfd_target
*original
= data
;
2842 if (command_line
.endian
== ENDIAN_BIG
2843 && target
->byteorder
!= BFD_ENDIAN_BIG
)
2846 if (command_line
.endian
== ENDIAN_LITTLE
2847 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
2850 /* Must be the same flavour. */
2851 if (target
->flavour
!= original
->flavour
)
2854 /* Ignore generic big and little endian elf vectors. */
2855 if (strcmp (target
->name
, "elf32-big") == 0
2856 || strcmp (target
->name
, "elf64-big") == 0
2857 || strcmp (target
->name
, "elf32-little") == 0
2858 || strcmp (target
->name
, "elf64-little") == 0)
2861 /* If we have not found a potential winner yet, then record this one. */
2868 /* Oh dear, we now have two potential candidates for a successful match.
2869 Compare their names and choose the better one. */
2870 if (name_compare (target
->name
, original
->name
)
2871 > name_compare (winner
->name
, original
->name
))
2874 /* Keep on searching until wqe have checked them all. */
2878 /* Return the BFD target format of the first input file. */
2881 get_first_input_target (void)
2883 char *target
= NULL
;
2885 LANG_FOR_EACH_INPUT_STATEMENT (s
)
2887 if (s
->header
.type
== lang_input_statement_enum
2890 ldfile_open_file (s
);
2892 if (s
->the_bfd
!= NULL
2893 && bfd_check_format (s
->the_bfd
, bfd_object
))
2895 target
= bfd_get_target (s
->the_bfd
);
2907 lang_get_output_target (void)
2911 /* Has the user told us which output format to use? */
2912 if (output_target
!= NULL
)
2913 return output_target
;
2915 /* No - has the current target been set to something other than
2917 if (current_target
!= default_target
)
2918 return current_target
;
2920 /* No - can we determine the format of the first input file? */
2921 target
= get_first_input_target ();
2925 /* Failed - use the default output target. */
2926 return default_target
;
2929 /* Open the output file. */
2932 open_output (const char *name
)
2934 output_target
= lang_get_output_target ();
2936 /* Has the user requested a particular endianness on the command
2938 if (command_line
.endian
!= ENDIAN_UNSET
)
2940 const bfd_target
*target
;
2941 enum bfd_endian desired_endian
;
2943 /* Get the chosen target. */
2944 target
= bfd_search_for_target (get_target
, (void *) output_target
);
2946 /* If the target is not supported, we cannot do anything. */
2949 if (command_line
.endian
== ENDIAN_BIG
)
2950 desired_endian
= BFD_ENDIAN_BIG
;
2952 desired_endian
= BFD_ENDIAN_LITTLE
;
2954 /* See if the target has the wrong endianness. This should
2955 not happen if the linker script has provided big and
2956 little endian alternatives, but some scrips don't do
2958 if (target
->byteorder
!= desired_endian
)
2960 /* If it does, then see if the target provides
2961 an alternative with the correct endianness. */
2962 if (target
->alternative_target
!= NULL
2963 && (target
->alternative_target
->byteorder
== desired_endian
))
2964 output_target
= target
->alternative_target
->name
;
2967 /* Try to find a target as similar as possible to
2968 the default target, but which has the desired
2969 endian characteristic. */
2970 bfd_search_for_target (closest_target_match
,
2973 /* Oh dear - we could not find any targets that
2974 satisfy our requirements. */
2976 einfo (_("%P: warning: could not find any targets"
2977 " that match endianness requirement\n"));
2979 output_target
= winner
->name
;
2985 link_info
.output_bfd
= bfd_openw (name
, output_target
);
2987 if (link_info
.output_bfd
== NULL
)
2989 if (bfd_get_error () == bfd_error_invalid_target
)
2990 einfo (_("%P%F: target %s not found\n"), output_target
);
2992 einfo (_("%P%F: cannot open output file %s: %E\n"), name
);
2995 delete_output_file_on_failure
= TRUE
;
2997 if (! bfd_set_format (link_info
.output_bfd
, bfd_object
))
2998 einfo (_("%P%F:%s: can not make object file: %E\n"), name
);
2999 if (! bfd_set_arch_mach (link_info
.output_bfd
,
3000 ldfile_output_architecture
,
3001 ldfile_output_machine
))
3002 einfo (_("%P%F:%s: can not set architecture: %E\n"), name
);
3004 link_info
.hash
= bfd_link_hash_table_create (link_info
.output_bfd
);
3005 if (link_info
.hash
== NULL
)
3006 einfo (_("%P%F: can not create hash table: %E\n"));
3008 bfd_set_gp_size (link_info
.output_bfd
, g_switch_value
);
3012 ldlang_open_output (lang_statement_union_type
*statement
)
3014 switch (statement
->header
.type
)
3016 case lang_output_statement_enum
:
3017 ASSERT (link_info
.output_bfd
== NULL
);
3018 open_output (statement
->output_statement
.name
);
3019 ldemul_set_output_arch ();
3020 if (config
.magic_demand_paged
&& !link_info
.relocatable
)
3021 link_info
.output_bfd
->flags
|= D_PAGED
;
3023 link_info
.output_bfd
->flags
&= ~D_PAGED
;
3024 if (config
.text_read_only
)
3025 link_info
.output_bfd
->flags
|= WP_TEXT
;
3027 link_info
.output_bfd
->flags
&= ~WP_TEXT
;
3028 if (link_info
.traditional_format
)
3029 link_info
.output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
3031 link_info
.output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
3034 case lang_target_statement_enum
:
3035 current_target
= statement
->target_statement
.target
;
3042 /* Convert between addresses in bytes and sizes in octets.
3043 For currently supported targets, octets_per_byte is always a power
3044 of two, so we can use shifts. */
3045 #define TO_ADDR(X) ((X) >> opb_shift)
3046 #define TO_SIZE(X) ((X) << opb_shift)
3048 /* Support the above. */
3049 static unsigned int opb_shift
= 0;
3054 unsigned x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
3055 ldfile_output_machine
);
3058 while ((x
& 1) == 0)
3066 /* Open all the input files. */
3069 open_input_bfds (lang_statement_union_type
*s
, bfd_boolean force
)
3071 for (; s
!= NULL
; s
= s
->header
.next
)
3073 switch (s
->header
.type
)
3075 case lang_constructors_statement_enum
:
3076 open_input_bfds (constructor_list
.head
, force
);
3078 case lang_output_section_statement_enum
:
3079 open_input_bfds (s
->output_section_statement
.children
.head
, force
);
3081 case lang_wild_statement_enum
:
3082 /* Maybe we should load the file's symbols. */
3083 if (s
->wild_statement
.filename
3084 && !wildcardp (s
->wild_statement
.filename
)
3085 && !archive_path (s
->wild_statement
.filename
))
3086 lookup_name (s
->wild_statement
.filename
);
3087 open_input_bfds (s
->wild_statement
.children
.head
, force
);
3089 case lang_group_statement_enum
:
3091 struct bfd_link_hash_entry
*undefs
;
3093 /* We must continually search the entries in the group
3094 until no new symbols are added to the list of undefined
3099 undefs
= link_info
.hash
->undefs_tail
;
3100 open_input_bfds (s
->group_statement
.children
.head
, TRUE
);
3102 while (undefs
!= link_info
.hash
->undefs_tail
);
3105 case lang_target_statement_enum
:
3106 current_target
= s
->target_statement
.target
;
3108 case lang_input_statement_enum
:
3109 if (s
->input_statement
.real
)
3111 lang_statement_union_type
**os_tail
;
3112 lang_statement_list_type add
;
3114 s
->input_statement
.target
= current_target
;
3116 /* If we are being called from within a group, and this
3117 is an archive which has already been searched, then
3118 force it to be researched unless the whole archive
3119 has been loaded already. */
3121 && !s
->input_statement
.whole_archive
3122 && s
->input_statement
.loaded
3123 && bfd_check_format (s
->input_statement
.the_bfd
,
3125 s
->input_statement
.loaded
= FALSE
;
3127 os_tail
= lang_output_section_statement
.tail
;
3128 lang_list_init (&add
);
3130 if (! load_symbols (&s
->input_statement
, &add
))
3131 config
.make_executable
= FALSE
;
3133 if (add
.head
!= NULL
)
3135 /* If this was a script with output sections then
3136 tack any added statements on to the end of the
3137 list. This avoids having to reorder the output
3138 section statement list. Very likely the user
3139 forgot -T, and whatever we do here will not meet
3140 naive user expectations. */
3141 if (os_tail
!= lang_output_section_statement
.tail
)
3143 einfo (_("%P: warning: %s contains output sections;"
3144 " did you forget -T?\n"),
3145 s
->input_statement
.filename
);
3146 *stat_ptr
->tail
= add
.head
;
3147 stat_ptr
->tail
= add
.tail
;
3151 *add
.tail
= s
->header
.next
;
3152 s
->header
.next
= add
.head
;
3163 /* Add a symbol to a hash of symbols used in DEFINED (NAME) expressions. */
3166 lang_track_definedness (const char *name
)
3168 if (bfd_hash_lookup (&lang_definedness_table
, name
, TRUE
, FALSE
) == NULL
)
3169 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name
);
3172 /* New-function for the definedness hash table. */
3174 static struct bfd_hash_entry
*
3175 lang_definedness_newfunc (struct bfd_hash_entry
*entry
,
3176 struct bfd_hash_table
*table ATTRIBUTE_UNUSED
,
3177 const char *name ATTRIBUTE_UNUSED
)
3179 struct lang_definedness_hash_entry
*ret
3180 = (struct lang_definedness_hash_entry
*) entry
;
3183 ret
= (struct lang_definedness_hash_entry
*)
3184 bfd_hash_allocate (table
, sizeof (struct lang_definedness_hash_entry
));
3187 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name
);
3189 ret
->iteration
= -1;
3193 /* Return the iteration when the definition of NAME was last updated. A
3194 value of -1 means that the symbol is not defined in the linker script
3195 or the command line, but may be defined in the linker symbol table. */
3198 lang_symbol_definition_iteration (const char *name
)
3200 struct lang_definedness_hash_entry
*defentry
3201 = (struct lang_definedness_hash_entry
*)
3202 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
3204 /* We've already created this one on the presence of DEFINED in the
3205 script, so it can't be NULL unless something is borked elsewhere in
3207 if (defentry
== NULL
)
3210 return defentry
->iteration
;
3213 /* Update the definedness state of NAME. */
3216 lang_update_definedness (const char *name
, struct bfd_link_hash_entry
*h
)
3218 struct lang_definedness_hash_entry
*defentry
3219 = (struct lang_definedness_hash_entry
*)
3220 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
3222 /* We don't keep track of symbols not tested with DEFINED. */
3223 if (defentry
== NULL
)
3226 /* If the symbol was already defined, and not from an earlier statement
3227 iteration, don't update the definedness iteration, because that'd
3228 make the symbol seem defined in the linker script at this point, and
3229 it wasn't; it was defined in some object. If we do anyway, DEFINED
3230 would start to yield false before this point and the construct "sym =
3231 DEFINED (sym) ? sym : X;" would change sym to X despite being defined
3233 if (h
->type
!= bfd_link_hash_undefined
3234 && h
->type
!= bfd_link_hash_common
3235 && h
->type
!= bfd_link_hash_new
3236 && defentry
->iteration
== -1)
3239 defentry
->iteration
= lang_statement_iteration
;
3242 /* Add the supplied name to the symbol table as an undefined reference.
3243 This is a two step process as the symbol table doesn't even exist at
3244 the time the ld command line is processed. First we put the name
3245 on a list, then, once the output file has been opened, transfer the
3246 name to the symbol table. */
3248 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
3250 #define ldlang_undef_chain_list_head entry_symbol.next
3253 ldlang_add_undef (const char *const name
)
3255 ldlang_undef_chain_list_type
*new_undef
= (ldlang_undef_chain_list_type
*)
3256 stat_alloc (sizeof (ldlang_undef_chain_list_type
));
3258 new_undef
->next
= ldlang_undef_chain_list_head
;
3259 ldlang_undef_chain_list_head
= new_undef
;
3261 new_undef
->name
= xstrdup (name
);
3263 if (link_info
.output_bfd
!= NULL
)
3264 insert_undefined (new_undef
->name
);
3267 /* Insert NAME as undefined in the symbol table. */
3270 insert_undefined (const char *name
)
3272 struct bfd_link_hash_entry
*h
;
3274 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
3276 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
3277 if (h
->type
== bfd_link_hash_new
)
3279 h
->type
= bfd_link_hash_undefined
;
3280 h
->u
.undef
.abfd
= NULL
;
3281 bfd_link_add_undef (link_info
.hash
, h
);
3285 /* Run through the list of undefineds created above and place them
3286 into the linker hash table as undefined symbols belonging to the
3290 lang_place_undefineds (void)
3292 ldlang_undef_chain_list_type
*ptr
;
3294 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
3295 insert_undefined (ptr
->name
);
3298 /* Check for all readonly or some readwrite sections. */
3301 check_input_sections
3302 (lang_statement_union_type
*s
,
3303 lang_output_section_statement_type
*output_section_statement
)
3305 for (; s
!= (lang_statement_union_type
*) NULL
; s
= s
->header
.next
)
3307 switch (s
->header
.type
)
3309 case lang_wild_statement_enum
:
3310 walk_wild (&s
->wild_statement
, check_section_callback
,
3311 output_section_statement
);
3312 if (! output_section_statement
->all_input_readonly
)
3315 case lang_constructors_statement_enum
:
3316 check_input_sections (constructor_list
.head
,
3317 output_section_statement
);
3318 if (! output_section_statement
->all_input_readonly
)
3321 case lang_group_statement_enum
:
3322 check_input_sections (s
->group_statement
.children
.head
,
3323 output_section_statement
);
3324 if (! output_section_statement
->all_input_readonly
)
3333 /* Update wildcard statements if needed. */
3336 update_wild_statements (lang_statement_union_type
*s
)
3338 struct wildcard_list
*sec
;
3340 switch (sort_section
)
3350 for (; s
!= NULL
; s
= s
->header
.next
)
3352 switch (s
->header
.type
)
3357 case lang_wild_statement_enum
:
3358 sec
= s
->wild_statement
.section_list
;
3359 for (sec
= s
->wild_statement
.section_list
; sec
!= NULL
;
3362 switch (sec
->spec
.sorted
)
3365 sec
->spec
.sorted
= sort_section
;
3368 if (sort_section
== by_alignment
)
3369 sec
->spec
.sorted
= by_name_alignment
;
3372 if (sort_section
== by_name
)
3373 sec
->spec
.sorted
= by_alignment_name
;
3381 case lang_constructors_statement_enum
:
3382 update_wild_statements (constructor_list
.head
);
3385 case lang_output_section_statement_enum
:
3386 update_wild_statements
3387 (s
->output_section_statement
.children
.head
);
3390 case lang_group_statement_enum
:
3391 update_wild_statements (s
->group_statement
.children
.head
);
3399 /* Open input files and attach to output sections. */
3402 map_input_to_output_sections
3403 (lang_statement_union_type
*s
, const char *target
,
3404 lang_output_section_statement_type
*os
)
3408 for (; s
!= NULL
; s
= s
->header
.next
)
3410 switch (s
->header
.type
)
3412 case lang_wild_statement_enum
:
3413 wild (&s
->wild_statement
, target
, os
);
3415 case lang_constructors_statement_enum
:
3416 map_input_to_output_sections (constructor_list
.head
,
3420 case lang_output_section_statement_enum
:
3421 if (s
->output_section_statement
.constraint
)
3423 if (s
->output_section_statement
.constraint
!= ONLY_IF_RW
3424 && s
->output_section_statement
.constraint
!= ONLY_IF_RO
)
3426 s
->output_section_statement
.all_input_readonly
= TRUE
;
3427 check_input_sections (s
->output_section_statement
.children
.head
,
3428 &s
->output_section_statement
);
3429 if ((s
->output_section_statement
.all_input_readonly
3430 && s
->output_section_statement
.constraint
== ONLY_IF_RW
)
3431 || (!s
->output_section_statement
.all_input_readonly
3432 && s
->output_section_statement
.constraint
== ONLY_IF_RO
))
3434 s
->output_section_statement
.constraint
= -1;
3439 map_input_to_output_sections (s
->output_section_statement
.children
.head
,
3441 &s
->output_section_statement
);
3443 case lang_output_statement_enum
:
3445 case lang_target_statement_enum
:
3446 target
= s
->target_statement
.target
;
3448 case lang_group_statement_enum
:
3449 map_input_to_output_sections (s
->group_statement
.children
.head
,
3453 case lang_data_statement_enum
:
3454 /* Make sure that any sections mentioned in the expression
3456 exp_init_os (s
->data_statement
.exp
);
3457 flags
= SEC_HAS_CONTENTS
;
3458 /* The output section gets contents, and then we inspect for
3459 any flags set in the input script which override any ALLOC. */
3460 if (!(os
->flags
& SEC_NEVER_LOAD
))
3461 flags
|= SEC_ALLOC
| SEC_LOAD
;
3462 if (os
->bfd_section
== NULL
)
3463 init_os (os
, NULL
, flags
);
3465 os
->bfd_section
->flags
|= flags
;
3467 case lang_input_section_enum
:
3469 case lang_fill_statement_enum
:
3470 case lang_object_symbols_statement_enum
:
3471 case lang_reloc_statement_enum
:
3472 case lang_padding_statement_enum
:
3473 case lang_input_statement_enum
:
3474 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3475 init_os (os
, NULL
, 0);
3477 case lang_assignment_statement_enum
:
3478 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3479 init_os (os
, NULL
, 0);
3481 /* Make sure that any sections mentioned in the assignment
3483 exp_init_os (s
->assignment_statement
.exp
);
3485 case lang_address_statement_enum
:
3486 /* Mark the specified section with the supplied address.
3487 If this section was actually a segment marker, then the
3488 directive is ignored if the linker script explicitly
3489 processed the segment marker. Originally, the linker
3490 treated segment directives (like -Ttext on the
3491 command-line) as section directives. We honor the
3492 section directive semantics for backwards compatibilty;
3493 linker scripts that do not specifically check for
3494 SEGMENT_START automatically get the old semantics. */
3495 if (!s
->address_statement
.segment
3496 || !s
->address_statement
.segment
->used
)
3498 lang_output_section_statement_type
*aos
3499 = (lang_output_section_statement_lookup
3500 (s
->address_statement
.section_name
, 0, TRUE
));
3502 if (aos
->bfd_section
== NULL
)
3503 init_os (aos
, NULL
, 0);
3504 aos
->addr_tree
= s
->address_statement
.address
;
3507 case lang_insert_statement_enum
:
3513 /* An insert statement snips out all the linker statements from the
3514 start of the list and places them after the output section
3515 statement specified by the insert. This operation is complicated
3516 by the fact that we keep a doubly linked list of output section
3517 statements as well as the singly linked list of all statements. */
3520 process_insert_statements (void)
3522 lang_statement_union_type
**s
;
3523 lang_output_section_statement_type
*first_os
= NULL
;
3524 lang_output_section_statement_type
*last_os
= NULL
;
3525 lang_output_section_statement_type
*os
;
3527 /* "start of list" is actually the statement immediately after
3528 the special abs_section output statement, so that it isn't
3530 s
= &lang_output_section_statement
.head
;
3531 while (*(s
= &(*s
)->header
.next
) != NULL
)
3533 if ((*s
)->header
.type
== lang_output_section_statement_enum
)
3535 /* Keep pointers to the first and last output section
3536 statement in the sequence we may be about to move. */
3537 os
= &(*s
)->output_section_statement
;
3539 ASSERT (last_os
== NULL
|| last_os
->next
== os
);
3542 /* Set constraint negative so that lang_output_section_find
3543 won't match this output section statement. At this
3544 stage in linking constraint has values in the range
3545 [-1, ONLY_IN_RW]. */
3546 last_os
->constraint
= -2 - last_os
->constraint
;
3547 if (first_os
== NULL
)
3550 else if ((*s
)->header
.type
== lang_insert_statement_enum
)
3552 lang_insert_statement_type
*i
= &(*s
)->insert_statement
;
3553 lang_output_section_statement_type
*where
;
3554 lang_statement_union_type
**ptr
;
3555 lang_statement_union_type
*first
;
3557 where
= lang_output_section_find (i
->where
);
3558 if (where
!= NULL
&& i
->is_before
)
3561 where
= where
->prev
;
3562 while (where
!= NULL
&& where
->constraint
< 0);
3566 einfo (_("%F%P: %s not found for insert\n"), i
->where
);
3570 /* Deal with reordering the output section statement list. */
3571 if (last_os
!= NULL
)
3573 asection
*first_sec
, *last_sec
;
3574 struct lang_output_section_statement_struct
**next
;
3576 /* Snip out the output sections we are moving. */
3577 first_os
->prev
->next
= last_os
->next
;
3578 if (last_os
->next
== NULL
)
3580 next
= &first_os
->prev
->next
;
3581 lang_output_section_statement
.tail
3582 = (lang_statement_union_type
**) next
;
3585 last_os
->next
->prev
= first_os
->prev
;
3586 /* Add them in at the new position. */
3587 last_os
->next
= where
->next
;
3588 if (where
->next
== NULL
)
3590 next
= &last_os
->next
;
3591 lang_output_section_statement
.tail
3592 = (lang_statement_union_type
**) next
;
3595 where
->next
->prev
= last_os
;
3596 first_os
->prev
= where
;
3597 where
->next
= first_os
;
3599 /* Move the bfd sections in the same way. */
3602 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3604 os
->constraint
= -2 - os
->constraint
;
3605 if (os
->bfd_section
!= NULL
3606 && os
->bfd_section
->owner
!= NULL
)
3608 last_sec
= os
->bfd_section
;
3609 if (first_sec
== NULL
)
3610 first_sec
= last_sec
;
3615 if (last_sec
!= NULL
)
3617 asection
*sec
= where
->bfd_section
;
3619 sec
= output_prev_sec_find (where
);
3621 /* The place we want to insert must come after the
3622 sections we are moving. So if we find no
3623 section or if the section is the same as our
3624 last section, then no move is needed. */
3625 if (sec
!= NULL
&& sec
!= last_sec
)
3627 /* Trim them off. */
3628 if (first_sec
->prev
!= NULL
)
3629 first_sec
->prev
->next
= last_sec
->next
;
3631 link_info
.output_bfd
->sections
= last_sec
->next
;
3632 if (last_sec
->next
!= NULL
)
3633 last_sec
->next
->prev
= first_sec
->prev
;
3635 link_info
.output_bfd
->section_last
= first_sec
->prev
;
3637 last_sec
->next
= sec
->next
;
3638 if (sec
->next
!= NULL
)
3639 sec
->next
->prev
= last_sec
;
3641 link_info
.output_bfd
->section_last
= last_sec
;
3642 first_sec
->prev
= sec
;
3643 sec
->next
= first_sec
;
3651 ptr
= insert_os_after (where
);
3652 /* Snip everything after the abs_section output statement we
3653 know is at the start of the list, up to and including
3654 the insert statement we are currently processing. */
3655 first
= lang_output_section_statement
.head
->header
.next
;
3656 lang_output_section_statement
.head
->header
.next
= (*s
)->header
.next
;
3657 /* Add them back where they belong. */
3660 statement_list
.tail
= s
;
3662 s
= &lang_output_section_statement
.head
;
3666 /* Undo constraint twiddling. */
3667 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3669 os
->constraint
= -2 - os
->constraint
;
3675 /* An output section might have been removed after its statement was
3676 added. For example, ldemul_before_allocation can remove dynamic
3677 sections if they turn out to be not needed. Clean them up here. */
3680 strip_excluded_output_sections (void)
3682 lang_output_section_statement_type
*os
;
3684 /* Run lang_size_sections (if not already done). */
3685 if (expld
.phase
!= lang_mark_phase_enum
)
3687 expld
.phase
= lang_mark_phase_enum
;
3688 expld
.dataseg
.phase
= exp_dataseg_none
;
3689 one_lang_size_sections_pass (NULL
, FALSE
);
3690 lang_reset_memory_regions ();
3693 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3697 asection
*output_section
;
3698 bfd_boolean exclude
;
3700 if (os
->constraint
< 0)
3703 output_section
= os
->bfd_section
;
3704 if (output_section
== NULL
)
3707 exclude
= (output_section
->rawsize
== 0
3708 && (output_section
->flags
& SEC_KEEP
) == 0
3709 && !bfd_section_removed_from_list (link_info
.output_bfd
,
3712 /* Some sections have not yet been sized, notably .gnu.version,
3713 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3714 input sections, so don't drop output sections that have such
3715 input sections unless they are also marked SEC_EXCLUDE. */
3716 if (exclude
&& output_section
->map_head
.s
!= NULL
)
3720 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
3721 if ((s
->flags
& SEC_LINKER_CREATED
) != 0
3722 && (s
->flags
& SEC_EXCLUDE
) == 0)
3729 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3730 output_section
->map_head
.link_order
= NULL
;
3731 output_section
->map_tail
.link_order
= NULL
;
3735 /* We don't set bfd_section to NULL since bfd_section of the
3736 removed output section statement may still be used. */
3737 if (!os
->section_relative_symbol
3738 && !os
->update_dot_tree
)
3740 output_section
->flags
|= SEC_EXCLUDE
;
3741 bfd_section_list_remove (link_info
.output_bfd
, output_section
);
3742 link_info
.output_bfd
->section_count
--;
3746 /* Stop future calls to lang_add_section from messing with map_head
3747 and map_tail link_order fields. */
3748 stripped_excluded_sections
= TRUE
;
3752 print_output_section_statement
3753 (lang_output_section_statement_type
*output_section_statement
)
3755 asection
*section
= output_section_statement
->bfd_section
;
3758 if (output_section_statement
!= abs_output_section
)
3760 minfo ("\n%s", output_section_statement
->name
);
3762 if (section
!= NULL
)
3764 print_dot
= section
->vma
;
3766 len
= strlen (output_section_statement
->name
);
3767 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3772 while (len
< SECTION_NAME_MAP_LENGTH
)
3778 minfo ("0x%V %W", section
->vma
, section
->size
);
3780 if (section
->vma
!= section
->lma
)
3781 minfo (_(" load address 0x%V"), section
->lma
);
3783 if (output_section_statement
->update_dot_tree
!= NULL
)
3784 exp_fold_tree (output_section_statement
->update_dot_tree
,
3785 bfd_abs_section_ptr
, &print_dot
);
3791 print_statement_list (output_section_statement
->children
.head
,
3792 output_section_statement
);
3795 /* Scan for the use of the destination in the right hand side
3796 of an expression. In such cases we will not compute the
3797 correct expression, since the value of DST that is used on
3798 the right hand side will be its final value, not its value
3799 just before this expression is evaluated. */
3802 scan_for_self_assignment (const char * dst
, etree_type
* rhs
)
3804 if (rhs
== NULL
|| dst
== NULL
)
3807 switch (rhs
->type
.node_class
)
3810 return scan_for_self_assignment (dst
, rhs
->binary
.lhs
)
3811 || scan_for_self_assignment (dst
, rhs
->binary
.rhs
);
3814 return scan_for_self_assignment (dst
, rhs
->trinary
.lhs
)
3815 || scan_for_self_assignment (dst
, rhs
->trinary
.rhs
);
3818 case etree_provided
:
3820 if (strcmp (dst
, rhs
->assign
.dst
) == 0)
3822 return scan_for_self_assignment (dst
, rhs
->assign
.src
);
3825 return scan_for_self_assignment (dst
, rhs
->unary
.child
);
3829 return strcmp (dst
, rhs
->value
.str
) == 0;
3834 return strcmp (dst
, rhs
->name
.name
) == 0;
3846 print_assignment (lang_assignment_statement_type
*assignment
,
3847 lang_output_section_statement_type
*output_section
)
3851 bfd_boolean computation_is_valid
= TRUE
;
3854 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3857 if (assignment
->exp
->type
.node_class
== etree_assert
)
3860 tree
= assignment
->exp
->assert_s
.child
;
3861 computation_is_valid
= TRUE
;
3865 const char *dst
= assignment
->exp
->assign
.dst
;
3867 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
3868 tree
= assignment
->exp
->assign
.src
;
3869 computation_is_valid
= is_dot
|| (scan_for_self_assignment (dst
, tree
) == FALSE
);
3872 exp_fold_tree (tree
, output_section
->bfd_section
, &print_dot
);
3873 if (expld
.result
.valid_p
)
3877 if (computation_is_valid
)
3879 value
= expld
.result
.value
;
3881 if (expld
.result
.section
)
3882 value
+= expld
.result
.section
->vma
;
3884 minfo ("0x%V", value
);
3890 struct bfd_link_hash_entry
*h
;
3892 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
3893 FALSE
, FALSE
, TRUE
);
3896 value
= h
->u
.def
.value
;
3898 if (expld
.result
.section
)
3899 value
+= expld
.result
.section
->vma
;
3901 minfo ("[0x%V]", value
);
3904 minfo ("[unresolved]");
3916 exp_print_tree (assignment
->exp
);
3921 print_input_statement (lang_input_statement_type
*statm
)
3923 if (statm
->filename
!= NULL
3924 && (statm
->the_bfd
== NULL
3925 || (statm
->the_bfd
->flags
& BFD_LINKER_CREATED
) == 0))
3926 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
3929 /* Print all symbols defined in a particular section. This is called
3930 via bfd_link_hash_traverse, or by print_all_symbols. */
3933 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
3935 asection
*sec
= ptr
;
3937 if ((hash_entry
->type
== bfd_link_hash_defined
3938 || hash_entry
->type
== bfd_link_hash_defweak
)
3939 && sec
== hash_entry
->u
.def
.section
)
3943 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3946 (hash_entry
->u
.def
.value
3947 + hash_entry
->u
.def
.section
->output_offset
3948 + hash_entry
->u
.def
.section
->output_section
->vma
));
3950 minfo (" %T\n", hash_entry
->root
.string
);
3957 hash_entry_addr_cmp (const void *a
, const void *b
)
3959 const struct bfd_link_hash_entry
*l
= *(const struct bfd_link_hash_entry
**)a
;
3960 const struct bfd_link_hash_entry
*r
= *(const struct bfd_link_hash_entry
**)b
;
3962 if (l
->u
.def
.value
< r
->u
.def
.value
)
3964 else if (l
->u
.def
.value
> r
->u
.def
.value
)
3971 print_all_symbols (asection
*sec
)
3973 struct fat_user_section_struct
*ud
= get_userdata (sec
);
3974 struct map_symbol_def
*def
;
3975 struct bfd_link_hash_entry
**entries
;
3981 *ud
->map_symbol_def_tail
= 0;
3983 /* Sort the symbols by address. */
3984 entries
= obstack_alloc (&map_obstack
,
3985 ud
->map_symbol_def_count
* sizeof (*entries
));
3987 for (i
= 0, def
= ud
->map_symbol_def_head
; def
; def
= def
->next
, i
++)
3988 entries
[i
] = def
->entry
;
3990 qsort (entries
, ud
->map_symbol_def_count
, sizeof (*entries
),
3991 hash_entry_addr_cmp
);
3993 /* Print the symbols. */
3994 for (i
= 0; i
< ud
->map_symbol_def_count
; i
++)
3995 print_one_symbol (entries
[i
], sec
);
3997 obstack_free (&map_obstack
, entries
);
4000 /* Print information about an input section to the map file. */
4003 print_input_section (asection
*i
, bfd_boolean is_discarded
)
4005 bfd_size_type size
= i
->size
;
4012 minfo ("%s", i
->name
);
4014 len
= 1 + strlen (i
->name
);
4015 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4020 while (len
< SECTION_NAME_MAP_LENGTH
)
4026 if (i
->output_section
!= NULL
4027 && i
->output_section
->owner
== link_info
.output_bfd
)
4028 addr
= i
->output_section
->vma
+ i
->output_offset
;
4036 minfo ("0x%V %W %B\n", addr
, TO_ADDR (size
), i
->owner
);
4038 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
4040 len
= SECTION_NAME_MAP_LENGTH
+ 3;
4052 minfo (_("%W (size before relaxing)\n"), i
->rawsize
);
4055 if (i
->output_section
!= NULL
4056 && i
->output_section
->owner
== link_info
.output_bfd
)
4058 if (link_info
.reduce_memory_overheads
)
4059 bfd_link_hash_traverse (link_info
.hash
, print_one_symbol
, i
);
4061 print_all_symbols (i
);
4063 /* Update print_dot, but make sure that we do not move it
4064 backwards - this could happen if we have overlays and a
4065 later overlay is shorter than an earier one. */
4066 if (addr
+ TO_ADDR (size
) > print_dot
)
4067 print_dot
= addr
+ TO_ADDR (size
);
4072 print_fill_statement (lang_fill_statement_type
*fill
)
4076 fputs (" FILL mask 0x", config
.map_file
);
4077 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
4078 fprintf (config
.map_file
, "%02x", *p
);
4079 fputs ("\n", config
.map_file
);
4083 print_data_statement (lang_data_statement_type
*data
)
4091 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4094 addr
= data
->output_offset
;
4095 if (data
->output_section
!= NULL
)
4096 addr
+= data
->output_section
->vma
;
4124 minfo ("0x%V %W %s 0x%v", addr
, size
, name
, data
->value
);
4126 if (data
->exp
->type
.node_class
!= etree_value
)
4129 exp_print_tree (data
->exp
);
4134 print_dot
= addr
+ TO_ADDR (size
);
4137 /* Print an address statement. These are generated by options like
4141 print_address_statement (lang_address_statement_type
*address
)
4143 minfo (_("Address of section %s set to "), address
->section_name
);
4144 exp_print_tree (address
->address
);
4148 /* Print a reloc statement. */
4151 print_reloc_statement (lang_reloc_statement_type
*reloc
)
4158 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4161 addr
= reloc
->output_offset
;
4162 if (reloc
->output_section
!= NULL
)
4163 addr
+= reloc
->output_section
->vma
;
4165 size
= bfd_get_reloc_size (reloc
->howto
);
4167 minfo ("0x%V %W RELOC %s ", addr
, size
, reloc
->howto
->name
);
4169 if (reloc
->name
!= NULL
)
4170 minfo ("%s+", reloc
->name
);
4172 minfo ("%s+", reloc
->section
->name
);
4174 exp_print_tree (reloc
->addend_exp
);
4178 print_dot
= addr
+ TO_ADDR (size
);
4182 print_padding_statement (lang_padding_statement_type
*s
)
4190 len
= sizeof " *fill*" - 1;
4191 while (len
< SECTION_NAME_MAP_LENGTH
)
4197 addr
= s
->output_offset
;
4198 if (s
->output_section
!= NULL
)
4199 addr
+= s
->output_section
->vma
;
4200 minfo ("0x%V %W ", addr
, (bfd_vma
) s
->size
);
4202 if (s
->fill
->size
!= 0)
4206 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
4207 fprintf (config
.map_file
, "%02x", *p
);
4212 print_dot
= addr
+ TO_ADDR (s
->size
);
4216 print_wild_statement (lang_wild_statement_type
*w
,
4217 lang_output_section_statement_type
*os
)
4219 struct wildcard_list
*sec
;
4223 if (w
->filenames_sorted
)
4225 if (w
->filename
!= NULL
)
4226 minfo ("%s", w
->filename
);
4229 if (w
->filenames_sorted
)
4233 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
4235 if (sec
->spec
.sorted
)
4237 if (sec
->spec
.exclude_name_list
!= NULL
)
4240 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
4241 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
4242 minfo (" %s", tmp
->name
);
4245 if (sec
->spec
.name
!= NULL
)
4246 minfo ("%s", sec
->spec
.name
);
4249 if (sec
->spec
.sorted
)
4258 print_statement_list (w
->children
.head
, os
);
4261 /* Print a group statement. */
4264 print_group (lang_group_statement_type
*s
,
4265 lang_output_section_statement_type
*os
)
4267 fprintf (config
.map_file
, "START GROUP\n");
4268 print_statement_list (s
->children
.head
, os
);
4269 fprintf (config
.map_file
, "END GROUP\n");
4272 /* Print the list of statements in S.
4273 This can be called for any statement type. */
4276 print_statement_list (lang_statement_union_type
*s
,
4277 lang_output_section_statement_type
*os
)
4281 print_statement (s
, os
);
4286 /* Print the first statement in statement list S.
4287 This can be called for any statement type. */
4290 print_statement (lang_statement_union_type
*s
,
4291 lang_output_section_statement_type
*os
)
4293 switch (s
->header
.type
)
4296 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
4299 case lang_constructors_statement_enum
:
4300 if (constructor_list
.head
!= NULL
)
4302 if (constructors_sorted
)
4303 minfo (" SORT (CONSTRUCTORS)\n");
4305 minfo (" CONSTRUCTORS\n");
4306 print_statement_list (constructor_list
.head
, os
);
4309 case lang_wild_statement_enum
:
4310 print_wild_statement (&s
->wild_statement
, os
);
4312 case lang_address_statement_enum
:
4313 print_address_statement (&s
->address_statement
);
4315 case lang_object_symbols_statement_enum
:
4316 minfo (" CREATE_OBJECT_SYMBOLS\n");
4318 case lang_fill_statement_enum
:
4319 print_fill_statement (&s
->fill_statement
);
4321 case lang_data_statement_enum
:
4322 print_data_statement (&s
->data_statement
);
4324 case lang_reloc_statement_enum
:
4325 print_reloc_statement (&s
->reloc_statement
);
4327 case lang_input_section_enum
:
4328 print_input_section (s
->input_section
.section
, FALSE
);
4330 case lang_padding_statement_enum
:
4331 print_padding_statement (&s
->padding_statement
);
4333 case lang_output_section_statement_enum
:
4334 print_output_section_statement (&s
->output_section_statement
);
4336 case lang_assignment_statement_enum
:
4337 print_assignment (&s
->assignment_statement
, os
);
4339 case lang_target_statement_enum
:
4340 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
4342 case lang_output_statement_enum
:
4343 minfo ("OUTPUT(%s", s
->output_statement
.name
);
4344 if (output_target
!= NULL
)
4345 minfo (" %s", output_target
);
4348 case lang_input_statement_enum
:
4349 print_input_statement (&s
->input_statement
);
4351 case lang_group_statement_enum
:
4352 print_group (&s
->group_statement
, os
);
4354 case lang_insert_statement_enum
:
4355 minfo ("INSERT %s %s\n",
4356 s
->insert_statement
.is_before
? "BEFORE" : "AFTER",
4357 s
->insert_statement
.where
);
4363 print_statements (void)
4365 print_statement_list (statement_list
.head
, abs_output_section
);
4368 /* Print the first N statements in statement list S to STDERR.
4369 If N == 0, nothing is printed.
4370 If N < 0, the entire list is printed.
4371 Intended to be called from GDB. */
4374 dprint_statement (lang_statement_union_type
*s
, int n
)
4376 FILE *map_save
= config
.map_file
;
4378 config
.map_file
= stderr
;
4381 print_statement_list (s
, abs_output_section
);
4384 while (s
&& --n
>= 0)
4386 print_statement (s
, abs_output_section
);
4391 config
.map_file
= map_save
;
4395 insert_pad (lang_statement_union_type
**ptr
,
4397 unsigned int alignment_needed
,
4398 asection
*output_section
,
4401 static fill_type zero_fill
= { 1, { 0 } };
4402 lang_statement_union_type
*pad
= NULL
;
4404 if (ptr
!= &statement_list
.head
)
4405 pad
= ((lang_statement_union_type
*)
4406 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
4408 && pad
->header
.type
== lang_padding_statement_enum
4409 && pad
->padding_statement
.output_section
== output_section
)
4411 /* Use the existing pad statement. */
4413 else if ((pad
= *ptr
) != NULL
4414 && pad
->header
.type
== lang_padding_statement_enum
4415 && pad
->padding_statement
.output_section
== output_section
)
4417 /* Use the existing pad statement. */
4421 /* Make a new padding statement, linked into existing chain. */
4422 pad
= stat_alloc (sizeof (lang_padding_statement_type
));
4423 pad
->header
.next
= *ptr
;
4425 pad
->header
.type
= lang_padding_statement_enum
;
4426 pad
->padding_statement
.output_section
= output_section
;
4429 pad
->padding_statement
.fill
= fill
;
4431 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
4432 pad
->padding_statement
.size
= alignment_needed
;
4433 output_section
->size
+= alignment_needed
;
4436 /* Work out how much this section will move the dot point. */
4440 (lang_statement_union_type
**this_ptr
,
4441 lang_output_section_statement_type
*output_section_statement
,
4445 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
4446 asection
*i
= is
->section
;
4448 if (!((lang_input_statement_type
*) i
->owner
->usrdata
)->just_syms_flag
4449 && (i
->flags
& SEC_EXCLUDE
) == 0)
4451 unsigned int alignment_needed
;
4454 /* Align this section first to the input sections requirement,
4455 then to the output section's requirement. If this alignment
4456 is greater than any seen before, then record it too. Perform
4457 the alignment by inserting a magic 'padding' statement. */
4459 if (output_section_statement
->subsection_alignment
!= -1)
4460 i
->alignment_power
= output_section_statement
->subsection_alignment
;
4462 o
= output_section_statement
->bfd_section
;
4463 if (o
->alignment_power
< i
->alignment_power
)
4464 o
->alignment_power
= i
->alignment_power
;
4466 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
4468 if (alignment_needed
!= 0)
4470 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
4471 dot
+= alignment_needed
;
4474 /* Remember where in the output section this input section goes. */
4476 i
->output_offset
= dot
- o
->vma
;
4478 /* Mark how big the output section must be to contain this now. */
4479 dot
+= TO_ADDR (i
->size
);
4480 o
->size
= TO_SIZE (dot
- o
->vma
);
4484 i
->output_offset
= i
->vma
- output_section_statement
->bfd_section
->vma
;
4491 sort_sections_by_lma (const void *arg1
, const void *arg2
)
4493 const asection
*sec1
= *(const asection
**) arg1
;
4494 const asection
*sec2
= *(const asection
**) arg2
;
4496 if (bfd_section_lma (sec1
->owner
, sec1
)
4497 < bfd_section_lma (sec2
->owner
, sec2
))
4499 else if (bfd_section_lma (sec1
->owner
, sec1
)
4500 > bfd_section_lma (sec2
->owner
, sec2
))
4502 else if (sec1
->id
< sec2
->id
)
4504 else if (sec1
->id
> sec2
->id
)
4510 #define IGNORE_SECTION(s) \
4511 ((s->flags & SEC_NEVER_LOAD) != 0 \
4512 || (s->flags & SEC_ALLOC) == 0 \
4513 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
4514 && (s->flags & SEC_LOAD) == 0))
4516 /* Check to see if any allocated sections overlap with other allocated
4517 sections. This can happen if a linker script specifies the output
4518 section addresses of the two sections. Also check whether any memory
4519 region has overflowed. */
4522 lang_check_section_addresses (void)
4525 asection
**sections
, **spp
;
4532 lang_memory_region_type
*m
;
4534 if (bfd_count_sections (link_info
.output_bfd
) <= 1)
4537 amt
= bfd_count_sections (link_info
.output_bfd
) * sizeof (asection
*);
4538 sections
= xmalloc (amt
);
4540 /* Scan all sections in the output list. */
4542 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4544 /* Only consider loadable sections with real contents. */
4545 if ((s
->flags
& SEC_NEVER_LOAD
)
4546 || !(s
->flags
& SEC_LOAD
)
4547 || !(s
->flags
& SEC_ALLOC
)
4551 sections
[count
] = s
;
4558 qsort (sections
, (size_t) count
, sizeof (asection
*),
4559 sort_sections_by_lma
);
4563 s_start
= bfd_section_lma (link_info
.output_bfd
, s
);
4564 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4565 for (count
--; count
; count
--)
4567 /* We must check the sections' LMA addresses not their VMA
4568 addresses because overlay sections can have overlapping VMAs
4569 but they must have distinct LMAs. */
4574 s_start
= bfd_section_lma (link_info
.output_bfd
, s
);
4575 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4577 /* Look for an overlap. */
4578 if (s_end
>= os_start
&& s_start
<= os_end
)
4579 einfo (_("%X%P: section %s loaded at [%V,%V] overlaps section %s loaded at [%V,%V]\n"),
4580 s
->name
, s_start
, s_end
, os
->name
, os_start
, os_end
);
4585 /* If any memory region has overflowed, report by how much.
4586 We do not issue this diagnostic for regions that had sections
4587 explicitly placed outside their bounds; os_region_check's
4588 diagnostics are adequate for that case.
4590 FIXME: It is conceivable that m->current - (m->origin + m->length)
4591 might overflow a 32-bit integer. There is, alas, no way to print
4592 a bfd_vma quantity in decimal. */
4593 for (m
= lang_memory_region_list
; m
; m
= m
->next
)
4594 if (m
->had_full_message
)
4595 einfo (_("%X%P: region `%s' overflowed by %ld bytes\n"),
4596 m
->name_list
.name
, (long)(m
->current
- (m
->origin
+ m
->length
)));
4600 /* Make sure the new address is within the region. We explicitly permit the
4601 current address to be at the exact end of the region when the address is
4602 non-zero, in case the region is at the end of addressable memory and the
4603 calculation wraps around. */
4606 os_region_check (lang_output_section_statement_type
*os
,
4607 lang_memory_region_type
*region
,
4611 if ((region
->current
< region
->origin
4612 || (region
->current
- region
->origin
> region
->length
))
4613 && ((region
->current
!= region
->origin
+ region
->length
)
4618 einfo (_("%X%P: address 0x%v of %B section `%s'"
4619 " is not within region `%s'\n"),
4621 os
->bfd_section
->owner
,
4622 os
->bfd_section
->name
,
4623 region
->name_list
.name
);
4625 else if (!region
->had_full_message
)
4627 region
->had_full_message
= TRUE
;
4629 einfo (_("%X%P: %B section `%s' will not fit in region `%s'\n"),
4630 os
->bfd_section
->owner
,
4631 os
->bfd_section
->name
,
4632 region
->name_list
.name
);
4637 /* Set the sizes for all the output sections. */
4640 lang_size_sections_1
4641 (lang_statement_union_type
*s
,
4642 lang_output_section_statement_type
*output_section_statement
,
4643 lang_statement_union_type
**prev
,
4647 bfd_boolean check_regions
)
4649 /* Size up the sections from their constituent parts. */
4650 for (; s
!= NULL
; s
= s
->header
.next
)
4652 switch (s
->header
.type
)
4654 case lang_output_section_statement_enum
:
4656 bfd_vma newdot
, after
;
4657 lang_output_section_statement_type
*os
;
4658 lang_memory_region_type
*r
;
4660 os
= &s
->output_section_statement
;
4661 if (os
->addr_tree
!= NULL
)
4663 os
->processed_vma
= FALSE
;
4664 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
4666 if (expld
.result
.valid_p
)
4667 dot
= expld
.result
.value
+ expld
.result
.section
->vma
;
4668 else if (expld
.phase
!= lang_mark_phase_enum
)
4669 einfo (_("%F%S: non constant or forward reference"
4670 " address expression for section %s\n"),
4674 if (os
->bfd_section
== NULL
)
4675 /* This section was removed or never actually created. */
4678 /* If this is a COFF shared library section, use the size and
4679 address from the input section. FIXME: This is COFF
4680 specific; it would be cleaner if there were some other way
4681 to do this, but nothing simple comes to mind. */
4682 if (((bfd_get_flavour (link_info
.output_bfd
)
4683 == bfd_target_ecoff_flavour
)
4684 || (bfd_get_flavour (link_info
.output_bfd
)
4685 == bfd_target_coff_flavour
))
4686 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
4690 if (os
->children
.head
== NULL
4691 || os
->children
.head
->header
.next
!= NULL
4692 || (os
->children
.head
->header
.type
4693 != lang_input_section_enum
))
4694 einfo (_("%P%X: Internal error on COFF shared library"
4695 " section %s\n"), os
->name
);
4697 input
= os
->children
.head
->input_section
.section
;
4698 bfd_set_section_vma (os
->bfd_section
->owner
,
4700 bfd_section_vma (input
->owner
, input
));
4701 os
->bfd_section
->size
= input
->size
;
4706 if (bfd_is_abs_section (os
->bfd_section
))
4708 /* No matter what happens, an abs section starts at zero. */
4709 ASSERT (os
->bfd_section
->vma
== 0);
4715 if (os
->addr_tree
== NULL
)
4717 /* No address specified for this section, get one
4718 from the region specification. */
4719 if (os
->region
== NULL
4720 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
4721 && os
->region
->name_list
.name
[0] == '*'
4722 && strcmp (os
->region
->name_list
.name
,
4723 DEFAULT_MEMORY_REGION
) == 0))
4725 os
->region
= lang_memory_default (os
->bfd_section
);
4728 /* If a loadable section is using the default memory
4729 region, and some non default memory regions were
4730 defined, issue an error message. */
4732 && !IGNORE_SECTION (os
->bfd_section
)
4733 && ! link_info
.relocatable
4735 && strcmp (os
->region
->name_list
.name
,
4736 DEFAULT_MEMORY_REGION
) == 0
4737 && lang_memory_region_list
!= NULL
4738 && (strcmp (lang_memory_region_list
->name_list
.name
,
4739 DEFAULT_MEMORY_REGION
) != 0
4740 || lang_memory_region_list
->next
!= NULL
)
4741 && expld
.phase
!= lang_mark_phase_enum
)
4743 /* By default this is an error rather than just a
4744 warning because if we allocate the section to the
4745 default memory region we can end up creating an
4746 excessively large binary, or even seg faulting when
4747 attempting to perform a negative seek. See
4748 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4749 for an example of this. This behaviour can be
4750 overridden by the using the --no-check-sections
4752 if (command_line
.check_section_addresses
)
4753 einfo (_("%P%F: error: no memory region specified"
4754 " for loadable section `%s'\n"),
4755 bfd_get_section_name (link_info
.output_bfd
,
4758 einfo (_("%P: warning: no memory region specified"
4759 " for loadable section `%s'\n"),
4760 bfd_get_section_name (link_info
.output_bfd
,
4764 newdot
= os
->region
->current
;
4765 align
= os
->bfd_section
->alignment_power
;
4768 align
= os
->section_alignment
;
4770 /* Align to what the section needs. */
4773 bfd_vma savedot
= newdot
;
4774 newdot
= align_power (newdot
, align
);
4776 if (newdot
!= savedot
4777 && (config
.warn_section_align
4778 || os
->addr_tree
!= NULL
)
4779 && expld
.phase
!= lang_mark_phase_enum
)
4780 einfo (_("%P: warning: changing start of section"
4781 " %s by %lu bytes\n"),
4782 os
->name
, (unsigned long) (newdot
- savedot
));
4785 /* PR 6945: Do not update the vma's of output sections
4786 when performing a relocatable link on COFF objects. */
4787 if (! link_info
.relocatable
4788 || (bfd_get_flavour (link_info
.output_bfd
)
4789 != bfd_target_coff_flavour
))
4790 bfd_set_section_vma (0, os
->bfd_section
, newdot
);
4792 os
->bfd_section
->output_offset
= 0;
4795 lang_size_sections_1 (os
->children
.head
, os
, &os
->children
.head
,
4796 os
->fill
, newdot
, relax
, check_regions
);
4798 os
->processed_vma
= TRUE
;
4800 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
4801 /* Except for some special linker created sections,
4802 no output section should change from zero size
4803 after strip_excluded_output_sections. A non-zero
4804 size on an ignored section indicates that some
4805 input section was not sized early enough. */
4806 ASSERT (os
->bfd_section
->size
== 0);
4809 dot
= os
->bfd_section
->vma
;
4811 /* Put the section within the requested block size, or
4812 align at the block boundary. */
4814 + TO_ADDR (os
->bfd_section
->size
)
4815 + os
->block_value
- 1)
4816 & - (bfd_vma
) os
->block_value
);
4818 os
->bfd_section
->size
= TO_SIZE (after
- os
->bfd_section
->vma
);
4821 /* Set section lma. */
4824 r
= lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
4828 bfd_vma lma
= exp_get_abs_int (os
->load_base
, 0, "load base");
4829 os
->bfd_section
->lma
= lma
;
4831 else if (os
->lma_region
!= NULL
)
4833 bfd_vma lma
= os
->lma_region
->current
;
4835 if (os
->section_alignment
!= -1)
4836 lma
= align_power (lma
, os
->section_alignment
);
4837 os
->bfd_section
->lma
= lma
;
4839 else if (r
->last_os
!= NULL
4840 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
4845 last
= r
->last_os
->output_section_statement
.bfd_section
;
4847 /* A backwards move of dot should be accompanied by
4848 an explicit assignment to the section LMA (ie.
4849 os->load_base set) because backwards moves can
4850 create overlapping LMAs. */
4852 && os
->bfd_section
->size
!= 0
4853 && dot
+ os
->bfd_section
->size
<= last
->vma
)
4855 /* If dot moved backwards then leave lma equal to
4856 vma. This is the old default lma, which might
4857 just happen to work when the backwards move is
4858 sufficiently large. Nag if this changes anything,
4859 so people can fix their linker scripts. */
4861 if (last
->vma
!= last
->lma
)
4862 einfo (_("%P: warning: dot moved backwards before `%s'\n"),
4867 /* If this is an overlay, set the current lma to that
4868 at the end of the previous section. */
4869 if (os
->sectype
== overlay_section
)
4870 lma
= last
->lma
+ last
->size
;
4872 /* Otherwise, keep the same lma to vma relationship
4873 as the previous section. */
4875 lma
= dot
+ last
->lma
- last
->vma
;
4877 if (os
->section_alignment
!= -1)
4878 lma
= align_power (lma
, os
->section_alignment
);
4879 os
->bfd_section
->lma
= lma
;
4882 os
->processed_lma
= TRUE
;
4884 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
4887 /* Keep track of normal sections using the default
4888 lma region. We use this to set the lma for
4889 following sections. Overlays or other linker
4890 script assignment to lma might mean that the
4891 default lma == vma is incorrect.
4892 To avoid warnings about dot moving backwards when using
4893 -Ttext, don't start tracking sections until we find one
4894 of non-zero size or with lma set differently to vma. */
4895 if (((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
4896 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0)
4897 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0
4898 && (os
->bfd_section
->size
!= 0
4899 || (r
->last_os
== NULL
4900 && os
->bfd_section
->vma
!= os
->bfd_section
->lma
)
4901 || (r
->last_os
!= NULL
4902 && dot
>= (r
->last_os
->output_section_statement
4903 .bfd_section
->vma
)))
4904 && os
->lma_region
== NULL
4905 && !link_info
.relocatable
)
4908 /* .tbss sections effectively have zero size. */
4909 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
4910 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
4911 || link_info
.relocatable
)
4912 dot
+= TO_ADDR (os
->bfd_section
->size
);
4914 if (os
->update_dot_tree
!= 0)
4915 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
4917 /* Update dot in the region ?
4918 We only do this if the section is going to be allocated,
4919 since unallocated sections do not contribute to the region's
4920 overall size in memory.
4922 If the SEC_NEVER_LOAD bit is not set, it will affect the
4923 addresses of sections after it. We have to update
4925 if (os
->region
!= NULL
4926 && ((os
->bfd_section
->flags
& SEC_NEVER_LOAD
) == 0
4927 || (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))))
4929 os
->region
->current
= dot
;
4932 /* Make sure the new address is within the region. */
4933 os_region_check (os
, os
->region
, os
->addr_tree
,
4934 os
->bfd_section
->vma
);
4936 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
4937 && (os
->bfd_section
->flags
& SEC_LOAD
))
4939 os
->lma_region
->current
4940 = os
->bfd_section
->lma
+ TO_ADDR (os
->bfd_section
->size
);
4943 os_region_check (os
, os
->lma_region
, NULL
,
4944 os
->bfd_section
->lma
);
4950 case lang_constructors_statement_enum
:
4951 dot
= lang_size_sections_1 (constructor_list
.head
,
4952 output_section_statement
,
4953 &s
->wild_statement
.children
.head
,
4954 fill
, dot
, relax
, check_regions
);
4957 case lang_data_statement_enum
:
4959 unsigned int size
= 0;
4961 s
->data_statement
.output_offset
=
4962 dot
- output_section_statement
->bfd_section
->vma
;
4963 s
->data_statement
.output_section
=
4964 output_section_statement
->bfd_section
;
4966 /* We might refer to provided symbols in the expression, and
4967 need to mark them as needed. */
4968 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
4970 switch (s
->data_statement
.type
)
4988 if (size
< TO_SIZE ((unsigned) 1))
4989 size
= TO_SIZE ((unsigned) 1);
4990 dot
+= TO_ADDR (size
);
4991 output_section_statement
->bfd_section
->size
+= size
;
4995 case lang_reloc_statement_enum
:
4999 s
->reloc_statement
.output_offset
=
5000 dot
- output_section_statement
->bfd_section
->vma
;
5001 s
->reloc_statement
.output_section
=
5002 output_section_statement
->bfd_section
;
5003 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
5004 dot
+= TO_ADDR (size
);
5005 output_section_statement
->bfd_section
->size
+= size
;
5009 case lang_wild_statement_enum
:
5010 dot
= lang_size_sections_1 (s
->wild_statement
.children
.head
,
5011 output_section_statement
,
5012 &s
->wild_statement
.children
.head
,
5013 fill
, dot
, relax
, check_regions
);
5016 case lang_object_symbols_statement_enum
:
5017 link_info
.create_object_symbols_section
=
5018 output_section_statement
->bfd_section
;
5021 case lang_output_statement_enum
:
5022 case lang_target_statement_enum
:
5025 case lang_input_section_enum
:
5029 i
= (*prev
)->input_section
.section
;
5034 if (! bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
5035 einfo (_("%P%F: can't relax section: %E\n"));
5039 dot
= size_input_section (prev
, output_section_statement
,
5040 output_section_statement
->fill
, dot
);
5044 case lang_input_statement_enum
:
5047 case lang_fill_statement_enum
:
5048 s
->fill_statement
.output_section
=
5049 output_section_statement
->bfd_section
;
5051 fill
= s
->fill_statement
.fill
;
5054 case lang_assignment_statement_enum
:
5056 bfd_vma newdot
= dot
;
5057 etree_type
*tree
= s
->assignment_statement
.exp
;
5059 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
5061 exp_fold_tree (tree
,
5062 output_section_statement
->bfd_section
,
5065 if (expld
.dataseg
.relro
== exp_dataseg_relro_start
)
5067 if (!expld
.dataseg
.relro_start_stat
)
5068 expld
.dataseg
.relro_start_stat
= s
;
5071 ASSERT (expld
.dataseg
.relro_start_stat
== s
);
5074 else if (expld
.dataseg
.relro
== exp_dataseg_relro_end
)
5076 if (!expld
.dataseg
.relro_end_stat
)
5077 expld
.dataseg
.relro_end_stat
= s
;
5080 ASSERT (expld
.dataseg
.relro_end_stat
== s
);
5083 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
5085 /* This symbol is relative to this section. */
5086 if ((tree
->type
.node_class
== etree_provided
5087 || tree
->type
.node_class
== etree_assign
)
5088 && (tree
->assign
.dst
[0] != '.'
5089 || tree
->assign
.dst
[1] != '\0'))
5090 output_section_statement
->section_relative_symbol
= 1;
5092 if (!output_section_statement
->ignored
)
5094 if (output_section_statement
== abs_output_section
)
5096 /* If we don't have an output section, then just adjust
5097 the default memory address. */
5098 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
5099 FALSE
)->current
= newdot
;
5101 else if (newdot
!= dot
)
5103 /* Insert a pad after this statement. We can't
5104 put the pad before when relaxing, in case the
5105 assignment references dot. */
5106 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
5107 output_section_statement
->bfd_section
, dot
);
5109 /* Don't neuter the pad below when relaxing. */
5112 /* If dot is advanced, this implies that the section
5113 should have space allocated to it, unless the
5114 user has explicitly stated that the section
5115 should never be loaded. */
5116 if (!(output_section_statement
->flags
& SEC_NEVER_LOAD
))
5117 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
5124 case lang_padding_statement_enum
:
5125 /* If this is the first time lang_size_sections is called,
5126 we won't have any padding statements. If this is the
5127 second or later passes when relaxing, we should allow
5128 padding to shrink. If padding is needed on this pass, it
5129 will be added back in. */
5130 s
->padding_statement
.size
= 0;
5132 /* Make sure output_offset is valid. If relaxation shrinks
5133 the section and this pad isn't needed, it's possible to
5134 have output_offset larger than the final size of the
5135 section. bfd_set_section_contents will complain even for
5136 a pad size of zero. */
5137 s
->padding_statement
.output_offset
5138 = dot
- output_section_statement
->bfd_section
->vma
;
5141 case lang_group_statement_enum
:
5142 dot
= lang_size_sections_1 (s
->group_statement
.children
.head
,
5143 output_section_statement
,
5144 &s
->group_statement
.children
.head
,
5145 fill
, dot
, relax
, check_regions
);
5148 case lang_insert_statement_enum
:
5151 /* We can only get here when relaxing is turned on. */
5152 case lang_address_statement_enum
:
5159 prev
= &s
->header
.next
;
5164 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
5165 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
5166 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
5167 segments. We are allowed an opportunity to override this decision. */
5170 ldlang_override_segment_assignment (struct bfd_link_info
* info ATTRIBUTE_UNUSED
,
5171 bfd
* abfd ATTRIBUTE_UNUSED
,
5172 asection
* current_section
,
5173 asection
* previous_section
,
5174 bfd_boolean new_segment
)
5176 lang_output_section_statement_type
* cur
;
5177 lang_output_section_statement_type
* prev
;
5179 /* The checks below are only necessary when the BFD library has decided
5180 that the two sections ought to be placed into the same segment. */
5184 /* Paranoia checks. */
5185 if (current_section
== NULL
|| previous_section
== NULL
)
5188 /* Find the memory regions associated with the two sections.
5189 We call lang_output_section_find() here rather than scanning the list
5190 of output sections looking for a matching section pointer because if
5191 we have a large number of sections then a hash lookup is faster. */
5192 cur
= lang_output_section_find (current_section
->name
);
5193 prev
= lang_output_section_find (previous_section
->name
);
5195 /* More paranoia. */
5196 if (cur
== NULL
|| prev
== NULL
)
5199 /* If the regions are different then force the sections to live in
5200 different segments. See the email thread starting at the following
5201 URL for the reasons why this is necessary:
5202 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
5203 return cur
->region
!= prev
->region
;
5207 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
5209 lang_statement_iteration
++;
5210 lang_size_sections_1 (statement_list
.head
, abs_output_section
,
5211 &statement_list
.head
, 0, 0, relax
, check_regions
);
5215 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
5217 expld
.phase
= lang_allocating_phase_enum
;
5218 expld
.dataseg
.phase
= exp_dataseg_none
;
5220 one_lang_size_sections_pass (relax
, check_regions
);
5221 if (expld
.dataseg
.phase
== exp_dataseg_end_seen
5222 && link_info
.relro
&& expld
.dataseg
.relro_end
)
5224 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
5225 to put expld.dataseg.relro on a (common) page boundary. */
5226 bfd_vma min_base
, old_base
, relro_end
, maxpage
;
5228 expld
.dataseg
.phase
= exp_dataseg_relro_adjust
;
5229 maxpage
= expld
.dataseg
.maxpagesize
;
5230 /* MIN_BASE is the absolute minimum address we are allowed to start the
5231 read-write segment (byte before will be mapped read-only). */
5232 min_base
= (expld
.dataseg
.min_base
+ maxpage
- 1) & ~(maxpage
- 1);
5233 /* OLD_BASE is the address for a feasible minimum address which will
5234 still not cause a data overlap inside MAXPAGE causing file offset skip
5236 old_base
= expld
.dataseg
.base
;
5237 expld
.dataseg
.base
+= (-expld
.dataseg
.relro_end
5238 & (expld
.dataseg
.pagesize
- 1));
5239 /* Compute the expected PT_GNU_RELRO segment end. */
5240 relro_end
= ((expld
.dataseg
.relro_end
+ expld
.dataseg
.pagesize
- 1)
5241 & ~(expld
.dataseg
.pagesize
- 1));
5242 if (min_base
+ maxpage
< expld
.dataseg
.base
)
5244 expld
.dataseg
.base
-= maxpage
;
5245 relro_end
-= maxpage
;
5247 lang_reset_memory_regions ();
5248 one_lang_size_sections_pass (relax
, check_regions
);
5249 if (expld
.dataseg
.relro_end
> relro_end
)
5251 /* The alignment of sections between DATA_SEGMENT_ALIGN
5252 and DATA_SEGMENT_RELRO_END caused huge padding to be
5253 inserted at DATA_SEGMENT_RELRO_END. Try to start a bit lower so
5254 that the section alignments will fit in. */
5256 unsigned int max_alignment_power
= 0;
5258 /* Find maximum alignment power of sections between
5259 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
5260 for (sec
= link_info
.output_bfd
->sections
; sec
; sec
= sec
->next
)
5261 if (sec
->vma
>= expld
.dataseg
.base
5262 && sec
->vma
< expld
.dataseg
.relro_end
5263 && sec
->alignment_power
> max_alignment_power
)
5264 max_alignment_power
= sec
->alignment_power
;
5266 if (((bfd_vma
) 1 << max_alignment_power
) < expld
.dataseg
.pagesize
)
5268 if (expld
.dataseg
.base
- (1 << max_alignment_power
) < old_base
)
5269 expld
.dataseg
.base
+= expld
.dataseg
.pagesize
;
5270 expld
.dataseg
.base
-= (1 << max_alignment_power
);
5271 lang_reset_memory_regions ();
5272 one_lang_size_sections_pass (relax
, check_regions
);
5275 link_info
.relro_start
= expld
.dataseg
.base
;
5276 link_info
.relro_end
= expld
.dataseg
.relro_end
;
5278 else if (expld
.dataseg
.phase
== exp_dataseg_end_seen
)
5280 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
5281 a page could be saved in the data segment. */
5282 bfd_vma first
, last
;
5284 first
= -expld
.dataseg
.base
& (expld
.dataseg
.pagesize
- 1);
5285 last
= expld
.dataseg
.end
& (expld
.dataseg
.pagesize
- 1);
5287 && ((expld
.dataseg
.base
& ~(expld
.dataseg
.pagesize
- 1))
5288 != (expld
.dataseg
.end
& ~(expld
.dataseg
.pagesize
- 1)))
5289 && first
+ last
<= expld
.dataseg
.pagesize
)
5291 expld
.dataseg
.phase
= exp_dataseg_adjust
;
5292 lang_reset_memory_regions ();
5293 one_lang_size_sections_pass (relax
, check_regions
);
5297 expld
.phase
= lang_final_phase_enum
;
5300 /* Worker function for lang_do_assignments. Recursiveness goes here. */
5303 lang_do_assignments_1 (lang_statement_union_type
*s
,
5304 lang_output_section_statement_type
*current_os
,
5308 for (; s
!= NULL
; s
= s
->header
.next
)
5310 switch (s
->header
.type
)
5312 case lang_constructors_statement_enum
:
5313 dot
= lang_do_assignments_1 (constructor_list
.head
,
5314 current_os
, fill
, dot
);
5317 case lang_output_section_statement_enum
:
5319 lang_output_section_statement_type
*os
;
5321 os
= &(s
->output_section_statement
);
5322 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
5324 dot
= os
->bfd_section
->vma
;
5326 lang_do_assignments_1 (os
->children
.head
, os
, os
->fill
, dot
);
5328 /* .tbss sections effectively have zero size. */
5329 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5330 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
5331 || link_info
.relocatable
)
5332 dot
+= TO_ADDR (os
->bfd_section
->size
);
5334 if (os
->update_dot_tree
!= NULL
)
5335 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5340 case lang_wild_statement_enum
:
5342 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
5343 current_os
, fill
, dot
);
5346 case lang_object_symbols_statement_enum
:
5347 case lang_output_statement_enum
:
5348 case lang_target_statement_enum
:
5351 case lang_data_statement_enum
:
5352 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5353 if (expld
.result
.valid_p
)
5354 s
->data_statement
.value
= (expld
.result
.value
5355 + expld
.result
.section
->vma
);
5357 einfo (_("%F%P: invalid data statement\n"));
5360 switch (s
->data_statement
.type
)
5378 if (size
< TO_SIZE ((unsigned) 1))
5379 size
= TO_SIZE ((unsigned) 1);
5380 dot
+= TO_ADDR (size
);
5384 case lang_reloc_statement_enum
:
5385 exp_fold_tree (s
->reloc_statement
.addend_exp
,
5386 bfd_abs_section_ptr
, &dot
);
5387 if (expld
.result
.valid_p
)
5388 s
->reloc_statement
.addend_value
= expld
.result
.value
;
5390 einfo (_("%F%P: invalid reloc statement\n"));
5391 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
5394 case lang_input_section_enum
:
5396 asection
*in
= s
->input_section
.section
;
5398 if ((in
->flags
& SEC_EXCLUDE
) == 0)
5399 dot
+= TO_ADDR (in
->size
);
5403 case lang_input_statement_enum
:
5406 case lang_fill_statement_enum
:
5407 fill
= s
->fill_statement
.fill
;
5410 case lang_assignment_statement_enum
:
5411 exp_fold_tree (s
->assignment_statement
.exp
,
5412 current_os
->bfd_section
,
5416 case lang_padding_statement_enum
:
5417 dot
+= TO_ADDR (s
->padding_statement
.size
);
5420 case lang_group_statement_enum
:
5421 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
5422 current_os
, fill
, dot
);
5425 case lang_insert_statement_enum
:
5428 case lang_address_statement_enum
:
5440 lang_do_assignments (void)
5442 lang_statement_iteration
++;
5443 lang_do_assignments_1 (statement_list
.head
, abs_output_section
, NULL
, 0);
5446 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
5447 operator .startof. (section_name), it produces an undefined symbol
5448 .startof.section_name. Similarly, when it sees
5449 .sizeof. (section_name), it produces an undefined symbol
5450 .sizeof.section_name. For all the output sections, we look for
5451 such symbols, and set them to the correct value. */
5454 lang_set_startof (void)
5458 if (link_info
.relocatable
)
5461 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5463 const char *secname
;
5465 struct bfd_link_hash_entry
*h
;
5467 secname
= bfd_get_section_name (link_info
.output_bfd
, s
);
5468 buf
= xmalloc (10 + strlen (secname
));
5470 sprintf (buf
, ".startof.%s", secname
);
5471 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5472 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5474 h
->type
= bfd_link_hash_defined
;
5475 h
->u
.def
.value
= bfd_get_section_vma (link_info
.output_bfd
, s
);
5476 h
->u
.def
.section
= bfd_abs_section_ptr
;
5479 sprintf (buf
, ".sizeof.%s", secname
);
5480 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5481 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5483 h
->type
= bfd_link_hash_defined
;
5484 h
->u
.def
.value
= TO_ADDR (s
->size
);
5485 h
->u
.def
.section
= bfd_abs_section_ptr
;
5495 struct bfd_link_hash_entry
*h
;
5498 if ((link_info
.relocatable
&& !link_info
.gc_sections
)
5499 || (link_info
.shared
&& !link_info
.executable
))
5500 warn
= entry_from_cmdline
;
5504 /* Force the user to specify a root when generating a relocatable with
5506 if (link_info
.gc_sections
&& link_info
.relocatable
5507 && (entry_symbol
.name
== NULL
5508 && ldlang_undef_chain_list_head
== NULL
))
5509 einfo (_("%P%F: gc-sections requires either an entry or "
5510 "an undefined symbol\n"));
5512 if (entry_symbol
.name
== NULL
)
5514 /* No entry has been specified. Look for the default entry, but
5515 don't warn if we don't find it. */
5516 entry_symbol
.name
= entry_symbol_default
;
5520 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
5521 FALSE
, FALSE
, TRUE
);
5523 && (h
->type
== bfd_link_hash_defined
5524 || h
->type
== bfd_link_hash_defweak
)
5525 && h
->u
.def
.section
->output_section
!= NULL
)
5529 val
= (h
->u
.def
.value
5530 + bfd_get_section_vma (link_info
.output_bfd
,
5531 h
->u
.def
.section
->output_section
)
5532 + h
->u
.def
.section
->output_offset
);
5533 if (! bfd_set_start_address (link_info
.output_bfd
, val
))
5534 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol
.name
);
5541 /* We couldn't find the entry symbol. Try parsing it as a
5543 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
5546 if (! bfd_set_start_address (link_info
.output_bfd
, val
))
5547 einfo (_("%P%F: can't set start address\n"));
5553 /* Can't find the entry symbol, and it's not a number. Use
5554 the first address in the text section. */
5555 ts
= bfd_get_section_by_name (link_info
.output_bfd
, entry_section
);
5559 einfo (_("%P: warning: cannot find entry symbol %s;"
5560 " defaulting to %V\n"),
5562 bfd_get_section_vma (link_info
.output_bfd
, ts
));
5563 if (!(bfd_set_start_address
5564 (link_info
.output_bfd
,
5565 bfd_get_section_vma (link_info
.output_bfd
, ts
))))
5566 einfo (_("%P%F: can't set start address\n"));
5571 einfo (_("%P: warning: cannot find entry symbol %s;"
5572 " not setting start address\n"),
5578 /* Don't bfd_hash_table_free (&lang_definedness_table);
5579 map file output may result in a call of lang_track_definedness. */
5582 /* This is a small function used when we want to ignore errors from
5586 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED
, ...)
5588 /* Don't do anything. */
5591 /* Check that the architecture of all the input files is compatible
5592 with the output file. Also call the backend to let it do any
5593 other checking that is needed. */
5598 lang_statement_union_type
*file
;
5600 const bfd_arch_info_type
*compatible
;
5602 for (file
= file_chain
.head
; file
!= NULL
; file
= file
->input_statement
.next
)
5604 input_bfd
= file
->input_statement
.the_bfd
;
5606 = bfd_arch_get_compatible (input_bfd
, link_info
.output_bfd
,
5607 command_line
.accept_unknown_input_arch
);
5609 /* In general it is not possible to perform a relocatable
5610 link between differing object formats when the input
5611 file has relocations, because the relocations in the
5612 input format may not have equivalent representations in
5613 the output format (and besides BFD does not translate
5614 relocs for other link purposes than a final link). */
5615 if ((link_info
.relocatable
|| link_info
.emitrelocations
)
5616 && (compatible
== NULL
5617 || (bfd_get_flavour (input_bfd
)
5618 != bfd_get_flavour (link_info
.output_bfd
)))
5619 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
5621 einfo (_("%P%F: Relocatable linking with relocations from"
5622 " format %s (%B) to format %s (%B) is not supported\n"),
5623 bfd_get_target (input_bfd
), input_bfd
,
5624 bfd_get_target (link_info
.output_bfd
), link_info
.output_bfd
);
5625 /* einfo with %F exits. */
5628 if (compatible
== NULL
)
5630 if (command_line
.warn_mismatch
)
5631 einfo (_("%P%X: %s architecture of input file `%B'"
5632 " is incompatible with %s output\n"),
5633 bfd_printable_name (input_bfd
), input_bfd
,
5634 bfd_printable_name (link_info
.output_bfd
));
5636 else if (bfd_count_sections (input_bfd
))
5638 /* If the input bfd has no contents, it shouldn't set the
5639 private data of the output bfd. */
5641 bfd_error_handler_type pfn
= NULL
;
5643 /* If we aren't supposed to warn about mismatched input
5644 files, temporarily set the BFD error handler to a
5645 function which will do nothing. We still want to call
5646 bfd_merge_private_bfd_data, since it may set up
5647 information which is needed in the output file. */
5648 if (! command_line
.warn_mismatch
)
5649 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
5650 if (! bfd_merge_private_bfd_data (input_bfd
, link_info
.output_bfd
))
5652 if (command_line
.warn_mismatch
)
5653 einfo (_("%P%X: failed to merge target specific data"
5654 " of file %B\n"), input_bfd
);
5656 if (! command_line
.warn_mismatch
)
5657 bfd_set_error_handler (pfn
);
5662 /* Look through all the global common symbols and attach them to the
5663 correct section. The -sort-common command line switch may be used
5664 to roughly sort the entries by alignment. */
5669 if (command_line
.inhibit_common_definition
)
5671 if (link_info
.relocatable
5672 && ! command_line
.force_common_definition
)
5675 if (! config
.sort_common
)
5676 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
5681 if (config
.sort_common
== sort_descending
)
5683 for (power
= 4; power
> 0; power
--)
5684 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5687 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5691 for (power
= 0; power
<= 4; power
++)
5692 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5695 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5700 /* Place one common symbol in the correct section. */
5703 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
5705 unsigned int power_of_two
;
5709 if (h
->type
!= bfd_link_hash_common
)
5713 power_of_two
= h
->u
.c
.p
->alignment_power
;
5715 if (config
.sort_common
== sort_descending
5716 && power_of_two
< *(unsigned int *) info
)
5718 else if (config
.sort_common
== sort_ascending
5719 && power_of_two
> *(unsigned int *) info
)
5722 section
= h
->u
.c
.p
->section
;
5723 if (!bfd_define_common_symbol (link_info
.output_bfd
, &link_info
, h
))
5724 einfo (_("%P%F: Could not define common symbol `%T': %E\n"),
5727 if (config
.map_file
!= NULL
)
5729 static bfd_boolean header_printed
;
5734 if (! header_printed
)
5736 minfo (_("\nAllocating common symbols\n"));
5737 minfo (_("Common symbol size file\n\n"));
5738 header_printed
= TRUE
;
5741 name
= bfd_demangle (link_info
.output_bfd
, h
->root
.string
,
5742 DMGL_ANSI
| DMGL_PARAMS
);
5745 minfo ("%s", h
->root
.string
);
5746 len
= strlen (h
->root
.string
);
5751 len
= strlen (name
);
5767 if (size
<= 0xffffffff)
5768 sprintf (buf
, "%lx", (unsigned long) size
);
5770 sprintf_vma (buf
, size
);
5780 minfo ("%B\n", section
->owner
);
5786 /* Run through the input files and ensure that every input section has
5787 somewhere to go. If one is found without a destination then create
5788 an input request and place it into the statement tree. */
5791 lang_place_orphans (void)
5793 LANG_FOR_EACH_INPUT_STATEMENT (file
)
5797 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5799 if (s
->output_section
== NULL
)
5801 /* This section of the file is not attached, root
5802 around for a sensible place for it to go. */
5804 if (file
->just_syms_flag
)
5805 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
5806 else if ((s
->flags
& SEC_EXCLUDE
) != 0)
5807 s
->output_section
= bfd_abs_section_ptr
;
5808 else if (strcmp (s
->name
, "COMMON") == 0)
5810 /* This is a lonely common section which must have
5811 come from an archive. We attach to the section
5812 with the wildcard. */
5813 if (! link_info
.relocatable
5814 || command_line
.force_common_definition
)
5816 if (default_common_section
== NULL
)
5817 default_common_section
5818 = lang_output_section_statement_lookup (".bss", 0,
5820 lang_add_section (&default_common_section
->children
, s
,
5821 default_common_section
);
5826 const char *name
= s
->name
;
5829 if (config
.unique_orphan_sections
|| unique_section_p (s
))
5830 constraint
= SPECIAL
;
5832 if (!ldemul_place_orphan (s
, name
, constraint
))
5834 lang_output_section_statement_type
*os
;
5835 os
= lang_output_section_statement_lookup (name
,
5838 lang_add_section (&os
->children
, s
, os
);
5847 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
5849 flagword
*ptr_flags
;
5851 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
5857 *ptr_flags
|= SEC_ALLOC
;
5861 *ptr_flags
|= SEC_READONLY
;
5865 *ptr_flags
|= SEC_DATA
;
5869 *ptr_flags
|= SEC_CODE
;
5874 *ptr_flags
|= SEC_LOAD
;
5878 einfo (_("%P%F: invalid syntax in flags\n"));
5885 /* Call a function on each input file. This function will be called
5886 on an archive, but not on the elements. */
5889 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
5891 lang_input_statement_type
*f
;
5893 for (f
= (lang_input_statement_type
*) input_file_chain
.head
;
5895 f
= (lang_input_statement_type
*) f
->next_real_file
)
5899 /* Call a function on each file. The function will be called on all
5900 the elements of an archive which are included in the link, but will
5901 not be called on the archive file itself. */
5904 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
5906 LANG_FOR_EACH_INPUT_STATEMENT (f
)
5913 ldlang_add_file (lang_input_statement_type
*entry
)
5915 lang_statement_append (&file_chain
,
5916 (lang_statement_union_type
*) entry
,
5919 /* The BFD linker needs to have a list of all input BFDs involved in
5921 ASSERT (entry
->the_bfd
->link_next
== NULL
);
5922 ASSERT (entry
->the_bfd
!= link_info
.output_bfd
);
5924 *link_info
.input_bfds_tail
= entry
->the_bfd
;
5925 link_info
.input_bfds_tail
= &entry
->the_bfd
->link_next
;
5926 entry
->the_bfd
->usrdata
= entry
;
5927 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
5929 /* Look through the sections and check for any which should not be
5930 included in the link. We need to do this now, so that we can
5931 notice when the backend linker tries to report multiple
5932 definition errors for symbols which are in sections we aren't
5933 going to link. FIXME: It might be better to entirely ignore
5934 symbols which are defined in sections which are going to be
5935 discarded. This would require modifying the backend linker for
5936 each backend which might set the SEC_LINK_ONCE flag. If we do
5937 this, we should probably handle SEC_EXCLUDE in the same way. */
5939 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
5943 lang_add_output (const char *name
, int from_script
)
5945 /* Make -o on command line override OUTPUT in script. */
5946 if (!had_output_filename
|| !from_script
)
5948 output_filename
= name
;
5949 had_output_filename
= TRUE
;
5953 static lang_output_section_statement_type
*current_section
;
5964 for (l
= 0; l
< 32; l
++)
5966 if (i
>= (unsigned int) x
)
5974 lang_output_section_statement_type
*
5975 lang_enter_output_section_statement (const char *output_section_statement_name
,
5976 etree_type
*address_exp
,
5977 enum section_type sectype
,
5979 etree_type
*subalign
,
5983 lang_output_section_statement_type
*os
;
5985 os
= lang_output_section_statement_lookup (output_section_statement_name
,
5987 current_section
= os
;
5989 if (os
->addr_tree
== NULL
)
5991 os
->addr_tree
= address_exp
;
5993 os
->sectype
= sectype
;
5994 if (sectype
!= noload_section
)
5995 os
->flags
= SEC_NO_FLAGS
;
5997 os
->flags
= SEC_NEVER_LOAD
;
5998 os
->block_value
= 1;
6000 /* Make next things chain into subchain of this. */
6001 push_stat_ptr (&os
->children
);
6003 os
->subsection_alignment
=
6004 topower (exp_get_value_int (subalign
, -1, "subsection alignment"));
6005 os
->section_alignment
=
6006 topower (exp_get_value_int (align
, -1, "section alignment"));
6008 os
->load_base
= ebase
;
6015 lang_output_statement_type
*new_stmt
;
6017 new_stmt
= new_stat (lang_output_statement
, stat_ptr
);
6018 new_stmt
->name
= output_filename
;
6022 /* Reset the current counters in the regions. */
6025 lang_reset_memory_regions (void)
6027 lang_memory_region_type
*p
= lang_memory_region_list
;
6029 lang_output_section_statement_type
*os
;
6031 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
6033 p
->current
= p
->origin
;
6037 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6041 os
->processed_vma
= FALSE
;
6042 os
->processed_lma
= FALSE
;
6045 for (o
= link_info
.output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
6047 /* Save the last size for possible use by bfd_relax_section. */
6048 o
->rawsize
= o
->size
;
6053 /* Worker for lang_gc_sections_1. */
6056 gc_section_callback (lang_wild_statement_type
*ptr
,
6057 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6059 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6060 void *data ATTRIBUTE_UNUSED
)
6062 /* If the wild pattern was marked KEEP, the member sections
6063 should be as well. */
6064 if (ptr
->keep_sections
)
6065 section
->flags
|= SEC_KEEP
;
6068 /* Iterate over sections marking them against GC. */
6071 lang_gc_sections_1 (lang_statement_union_type
*s
)
6073 for (; s
!= NULL
; s
= s
->header
.next
)
6075 switch (s
->header
.type
)
6077 case lang_wild_statement_enum
:
6078 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
6080 case lang_constructors_statement_enum
:
6081 lang_gc_sections_1 (constructor_list
.head
);
6083 case lang_output_section_statement_enum
:
6084 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
6086 case lang_group_statement_enum
:
6087 lang_gc_sections_1 (s
->group_statement
.children
.head
);
6096 lang_gc_sections (void)
6098 /* Keep all sections so marked in the link script. */
6100 lang_gc_sections_1 (statement_list
.head
);
6102 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
6103 the special case of debug info. (See bfd/stabs.c)
6104 Twiddle the flag here, to simplify later linker code. */
6105 if (link_info
.relocatable
)
6107 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6110 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
6111 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
6112 sec
->flags
&= ~SEC_EXCLUDE
;
6116 if (link_info
.gc_sections
)
6117 bfd_gc_sections (link_info
.output_bfd
, &link_info
);
6120 /* Worker for lang_find_relro_sections_1. */
6123 find_relro_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
6124 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6126 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6129 /* Discarded, excluded and ignored sections effectively have zero
6131 if (section
->output_section
!= NULL
6132 && section
->output_section
->owner
== link_info
.output_bfd
6133 && (section
->output_section
->flags
& SEC_EXCLUDE
) == 0
6134 && !IGNORE_SECTION (section
)
6135 && section
->size
!= 0)
6137 bfd_boolean
*has_relro_section
= (bfd_boolean
*) data
;
6138 *has_relro_section
= TRUE
;
6142 /* Iterate over sections for relro sections. */
6145 lang_find_relro_sections_1 (lang_statement_union_type
*s
,
6146 bfd_boolean
*has_relro_section
)
6148 if (*has_relro_section
)
6151 for (; s
!= NULL
; s
= s
->header
.next
)
6153 if (s
== expld
.dataseg
.relro_end_stat
)
6156 switch (s
->header
.type
)
6158 case lang_wild_statement_enum
:
6159 walk_wild (&s
->wild_statement
,
6160 find_relro_section_callback
,
6163 case lang_constructors_statement_enum
:
6164 lang_find_relro_sections_1 (constructor_list
.head
,
6167 case lang_output_section_statement_enum
:
6168 lang_find_relro_sections_1 (s
->output_section_statement
.children
.head
,
6171 case lang_group_statement_enum
:
6172 lang_find_relro_sections_1 (s
->group_statement
.children
.head
,
6182 lang_find_relro_sections (void)
6184 bfd_boolean has_relro_section
= FALSE
;
6186 /* Check all sections in the link script. */
6188 lang_find_relro_sections_1 (expld
.dataseg
.relro_start_stat
,
6189 &has_relro_section
);
6191 if (!has_relro_section
)
6192 link_info
.relro
= FALSE
;
6195 /* Relax all sections until bfd_relax_section gives up. */
6198 lang_relax_sections (bfd_boolean need_layout
)
6200 if (command_line
.relax
)
6202 /* We may need more than one relaxation pass. */
6203 int i
= link_info
.relax_pass
;
6205 /* The backend can use it to determine the current pass. */
6206 link_info
.relax_pass
= 0;
6210 /* Keep relaxing until bfd_relax_section gives up. */
6211 bfd_boolean relax_again
;
6213 link_info
.relax_trip
= -1;
6216 link_info
.relax_trip
++;
6218 /* Note: pe-dll.c does something like this also. If you find
6219 you need to change this code, you probably need to change
6220 pe-dll.c also. DJ */
6222 /* Do all the assignments with our current guesses as to
6224 lang_do_assignments ();
6226 /* We must do this after lang_do_assignments, because it uses
6228 lang_reset_memory_regions ();
6230 /* Perform another relax pass - this time we know where the
6231 globals are, so can make a better guess. */
6232 relax_again
= FALSE
;
6233 lang_size_sections (&relax_again
, FALSE
);
6235 while (relax_again
);
6237 link_info
.relax_pass
++;
6244 /* Final extra sizing to report errors. */
6245 lang_do_assignments ();
6246 lang_reset_memory_regions ();
6247 lang_size_sections (NULL
, TRUE
);
6254 /* Finalize dynamic list. */
6255 if (link_info
.dynamic_list
)
6256 lang_finalize_version_expr_head (&link_info
.dynamic_list
->head
);
6258 current_target
= default_target
;
6260 /* Open the output file. */
6261 lang_for_each_statement (ldlang_open_output
);
6264 ldemul_create_output_section_statements ();
6266 /* Add to the hash table all undefineds on the command line. */
6267 lang_place_undefineds ();
6269 if (!bfd_section_already_linked_table_init ())
6270 einfo (_("%P%F: Failed to create hash table\n"));
6272 /* Create a bfd for each input file. */
6273 current_target
= default_target
;
6274 open_input_bfds (statement_list
.head
, FALSE
);
6276 link_info
.gc_sym_list
= &entry_symbol
;
6277 if (entry_symbol
.name
== NULL
)
6278 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
6280 ldemul_after_open ();
6282 bfd_section_already_linked_table_free ();
6284 /* Make sure that we're not mixing architectures. We call this
6285 after all the input files have been opened, but before we do any
6286 other processing, so that any operations merge_private_bfd_data
6287 does on the output file will be known during the rest of the
6291 /* Handle .exports instead of a version script if we're told to do so. */
6292 if (command_line
.version_exports_section
)
6293 lang_do_version_exports_section ();
6295 /* Build all sets based on the information gathered from the input
6297 ldctor_build_sets ();
6299 /* Remove unreferenced sections if asked to. */
6300 lang_gc_sections ();
6302 /* Size up the common data. */
6305 /* Update wild statements. */
6306 update_wild_statements (statement_list
.head
);
6308 /* Run through the contours of the script and attach input sections
6309 to the correct output sections. */
6310 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
6312 process_insert_statements ();
6314 /* Find any sections not attached explicitly and handle them. */
6315 lang_place_orphans ();
6317 if (! link_info
.relocatable
)
6321 /* Merge SEC_MERGE sections. This has to be done after GC of
6322 sections, so that GCed sections are not merged, but before
6323 assigning dynamic symbols, since removing whole input sections
6325 bfd_merge_sections (link_info
.output_bfd
, &link_info
);
6327 /* Look for a text section and set the readonly attribute in it. */
6328 found
= bfd_get_section_by_name (link_info
.output_bfd
, ".text");
6332 if (config
.text_read_only
)
6333 found
->flags
|= SEC_READONLY
;
6335 found
->flags
&= ~SEC_READONLY
;
6339 /* Do anything special before sizing sections. This is where ELF
6340 and other back-ends size dynamic sections. */
6341 ldemul_before_allocation ();
6343 /* We must record the program headers before we try to fix the
6344 section positions, since they will affect SIZEOF_HEADERS. */
6345 lang_record_phdrs ();
6347 /* Check relro sections. */
6348 if (link_info
.relro
&& ! link_info
.relocatable
)
6349 lang_find_relro_sections ();
6351 /* Size up the sections. */
6352 lang_size_sections (NULL
, !command_line
.relax
);
6354 /* See if anything special should be done now we know how big
6355 everything is. This is where relaxation is done. */
6356 ldemul_after_allocation ();
6358 /* Fix any .startof. or .sizeof. symbols. */
6359 lang_set_startof ();
6361 /* Do all the assignments, now that we know the final resting places
6362 of all the symbols. */
6364 lang_do_assignments ();
6368 /* Make sure that the section addresses make sense. */
6369 if (command_line
.check_section_addresses
)
6370 lang_check_section_addresses ();
6375 /* EXPORTED TO YACC */
6378 lang_add_wild (struct wildcard_spec
*filespec
,
6379 struct wildcard_list
*section_list
,
6380 bfd_boolean keep_sections
)
6382 struct wildcard_list
*curr
, *next
;
6383 lang_wild_statement_type
*new_stmt
;
6385 /* Reverse the list as the parser puts it back to front. */
6386 for (curr
= section_list
, section_list
= NULL
;
6388 section_list
= curr
, curr
= next
)
6390 if (curr
->spec
.name
!= NULL
&& strcmp (curr
->spec
.name
, "COMMON") == 0)
6391 placed_commons
= TRUE
;
6394 curr
->next
= section_list
;
6397 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
6399 if (strcmp (filespec
->name
, "*") == 0)
6400 filespec
->name
= NULL
;
6401 else if (! wildcardp (filespec
->name
))
6402 lang_has_input_file
= TRUE
;
6405 new_stmt
= new_stat (lang_wild_statement
, stat_ptr
);
6406 new_stmt
->filename
= NULL
;
6407 new_stmt
->filenames_sorted
= FALSE
;
6408 if (filespec
!= NULL
)
6410 new_stmt
->filename
= filespec
->name
;
6411 new_stmt
->filenames_sorted
= filespec
->sorted
== by_name
;
6413 new_stmt
->section_list
= section_list
;
6414 new_stmt
->keep_sections
= keep_sections
;
6415 lang_list_init (&new_stmt
->children
);
6416 analyze_walk_wild_section_handler (new_stmt
);
6420 lang_section_start (const char *name
, etree_type
*address
,
6421 const segment_type
*segment
)
6423 lang_address_statement_type
*ad
;
6425 ad
= new_stat (lang_address_statement
, stat_ptr
);
6426 ad
->section_name
= name
;
6427 ad
->address
= address
;
6428 ad
->segment
= segment
;
6431 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
6432 because of a -e argument on the command line, or zero if this is
6433 called by ENTRY in a linker script. Command line arguments take
6437 lang_add_entry (const char *name
, bfd_boolean cmdline
)
6439 if (entry_symbol
.name
== NULL
6441 || ! entry_from_cmdline
)
6443 entry_symbol
.name
= name
;
6444 entry_from_cmdline
= cmdline
;
6448 /* Set the default start symbol to NAME. .em files should use this,
6449 not lang_add_entry, to override the use of "start" if neither the
6450 linker script nor the command line specifies an entry point. NAME
6451 must be permanently allocated. */
6453 lang_default_entry (const char *name
)
6455 entry_symbol_default
= name
;
6459 lang_add_target (const char *name
)
6461 lang_target_statement_type
*new_stmt
;
6463 new_stmt
= new_stat (lang_target_statement
, stat_ptr
);
6464 new_stmt
->target
= name
;
6468 lang_add_map (const char *name
)
6475 map_option_f
= TRUE
;
6483 lang_add_fill (fill_type
*fill
)
6485 lang_fill_statement_type
*new_stmt
;
6487 new_stmt
= new_stat (lang_fill_statement
, stat_ptr
);
6488 new_stmt
->fill
= fill
;
6492 lang_add_data (int type
, union etree_union
*exp
)
6494 lang_data_statement_type
*new_stmt
;
6496 new_stmt
= new_stat (lang_data_statement
, stat_ptr
);
6497 new_stmt
->exp
= exp
;
6498 new_stmt
->type
= type
;
6501 /* Create a new reloc statement. RELOC is the BFD relocation type to
6502 generate. HOWTO is the corresponding howto structure (we could
6503 look this up, but the caller has already done so). SECTION is the
6504 section to generate a reloc against, or NAME is the name of the
6505 symbol to generate a reloc against. Exactly one of SECTION and
6506 NAME must be NULL. ADDEND is an expression for the addend. */
6509 lang_add_reloc (bfd_reloc_code_real_type reloc
,
6510 reloc_howto_type
*howto
,
6513 union etree_union
*addend
)
6515 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
6519 p
->section
= section
;
6521 p
->addend_exp
= addend
;
6523 p
->addend_value
= 0;
6524 p
->output_section
= NULL
;
6525 p
->output_offset
= 0;
6528 lang_assignment_statement_type
*
6529 lang_add_assignment (etree_type
*exp
)
6531 lang_assignment_statement_type
*new_stmt
;
6533 new_stmt
= new_stat (lang_assignment_statement
, stat_ptr
);
6534 new_stmt
->exp
= exp
;
6539 lang_add_attribute (enum statement_enum attribute
)
6541 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
6545 lang_startup (const char *name
)
6547 if (startup_file
!= NULL
)
6549 einfo (_("%P%F: multiple STARTUP files\n"));
6551 first_file
->filename
= name
;
6552 first_file
->local_sym_name
= name
;
6553 first_file
->real
= TRUE
;
6555 startup_file
= name
;
6559 lang_float (bfd_boolean maybe
)
6561 lang_float_flag
= maybe
;
6565 /* Work out the load- and run-time regions from a script statement, and
6566 store them in *LMA_REGION and *REGION respectively.
6568 MEMSPEC is the name of the run-time region, or the value of
6569 DEFAULT_MEMORY_REGION if the statement didn't specify one.
6570 LMA_MEMSPEC is the name of the load-time region, or null if the
6571 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
6572 had an explicit load address.
6574 It is an error to specify both a load region and a load address. */
6577 lang_get_regions (lang_memory_region_type
**region
,
6578 lang_memory_region_type
**lma_region
,
6579 const char *memspec
,
6580 const char *lma_memspec
,
6581 bfd_boolean have_lma
,
6582 bfd_boolean have_vma
)
6584 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
6586 /* If no runtime region or VMA has been specified, but the load region
6587 has been specified, then use the load region for the runtime region
6589 if (lma_memspec
!= NULL
6591 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
6592 *region
= *lma_region
;
6594 *region
= lang_memory_region_lookup (memspec
, FALSE
);
6596 if (have_lma
&& lma_memspec
!= 0)
6597 einfo (_("%X%P:%S: section has both a load address and a load region\n"));
6601 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
6602 lang_output_section_phdr_list
*phdrs
,
6603 const char *lma_memspec
)
6605 lang_get_regions (¤t_section
->region
,
6606 ¤t_section
->lma_region
,
6607 memspec
, lma_memspec
,
6608 current_section
->load_base
!= NULL
,
6609 current_section
->addr_tree
!= NULL
);
6611 /* If this section has no load region or base, but has the same
6612 region as the previous section, then propagate the previous
6613 section's load region. */
6615 if (!current_section
->lma_region
&& !current_section
->load_base
6616 && current_section
->region
== current_section
->prev
->region
)
6617 current_section
->lma_region
= current_section
->prev
->lma_region
;
6619 current_section
->fill
= fill
;
6620 current_section
->phdrs
= phdrs
;
6624 /* Create an absolute symbol with the given name with the value of the
6625 address of first byte of the section named.
6627 If the symbol already exists, then do nothing. */
6630 lang_abs_symbol_at_beginning_of (const char *secname
, const char *name
)
6632 struct bfd_link_hash_entry
*h
;
6634 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
6636 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
6638 if (h
->type
== bfd_link_hash_new
6639 || h
->type
== bfd_link_hash_undefined
)
6643 h
->type
= bfd_link_hash_defined
;
6645 sec
= bfd_get_section_by_name (link_info
.output_bfd
, secname
);
6649 h
->u
.def
.value
= bfd_get_section_vma (link_info
.output_bfd
, sec
);
6651 h
->u
.def
.section
= bfd_abs_section_ptr
;
6655 /* Create an absolute symbol with the given name with the value of the
6656 address of the first byte after the end of the section named.
6658 If the symbol already exists, then do nothing. */
6661 lang_abs_symbol_at_end_of (const char *secname
, const char *name
)
6663 struct bfd_link_hash_entry
*h
;
6665 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
6667 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
6669 if (h
->type
== bfd_link_hash_new
6670 || h
->type
== bfd_link_hash_undefined
)
6674 h
->type
= bfd_link_hash_defined
;
6676 sec
= bfd_get_section_by_name (link_info
.output_bfd
, secname
);
6680 h
->u
.def
.value
= (bfd_get_section_vma (link_info
.output_bfd
, sec
)
6681 + TO_ADDR (sec
->size
));
6683 h
->u
.def
.section
= bfd_abs_section_ptr
;
6688 lang_statement_append (lang_statement_list_type
*list
,
6689 lang_statement_union_type
*element
,
6690 lang_statement_union_type
**field
)
6692 *(list
->tail
) = element
;
6696 /* Set the output format type. -oformat overrides scripts. */
6699 lang_add_output_format (const char *format
,
6704 if (output_target
== NULL
|| !from_script
)
6706 if (command_line
.endian
== ENDIAN_BIG
6709 else if (command_line
.endian
== ENDIAN_LITTLE
6713 output_target
= format
;
6718 lang_add_insert (const char *where
, int is_before
)
6720 lang_insert_statement_type
*new_stmt
;
6722 new_stmt
= new_stat (lang_insert_statement
, stat_ptr
);
6723 new_stmt
->where
= where
;
6724 new_stmt
->is_before
= is_before
;
6725 saved_script_handle
= previous_script_handle
;
6728 /* Enter a group. This creates a new lang_group_statement, and sets
6729 stat_ptr to build new statements within the group. */
6732 lang_enter_group (void)
6734 lang_group_statement_type
*g
;
6736 g
= new_stat (lang_group_statement
, stat_ptr
);
6737 lang_list_init (&g
->children
);
6738 push_stat_ptr (&g
->children
);
6741 /* Leave a group. This just resets stat_ptr to start writing to the
6742 regular list of statements again. Note that this will not work if
6743 groups can occur inside anything else which can adjust stat_ptr,
6744 but currently they can't. */
6747 lang_leave_group (void)
6752 /* Add a new program header. This is called for each entry in a PHDRS
6753 command in a linker script. */
6756 lang_new_phdr (const char *name
,
6758 bfd_boolean filehdr
,
6763 struct lang_phdr
*n
, **pp
;
6765 n
= stat_alloc (sizeof (struct lang_phdr
));
6768 n
->type
= exp_get_value_int (type
, 0, "program header type");
6769 n
->filehdr
= filehdr
;
6774 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
6779 /* Record the program header information in the output BFD. FIXME: We
6780 should not be calling an ELF specific function here. */
6783 lang_record_phdrs (void)
6787 lang_output_section_phdr_list
*last
;
6788 struct lang_phdr
*l
;
6789 lang_output_section_statement_type
*os
;
6792 secs
= xmalloc (alc
* sizeof (asection
*));
6795 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
6802 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6806 lang_output_section_phdr_list
*pl
;
6808 if (os
->constraint
< 0)
6816 if (os
->sectype
== noload_section
6817 || os
->bfd_section
== NULL
6818 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
6821 /* Don't add orphans to PT_INTERP header. */
6827 lang_output_section_statement_type
* tmp_os
;
6829 /* If we have not run across a section with a program
6830 header assigned to it yet, then scan forwards to find
6831 one. This prevents inconsistencies in the linker's
6832 behaviour when a script has specified just a single
6833 header and there are sections in that script which are
6834 not assigned to it, and which occur before the first
6835 use of that header. See here for more details:
6836 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
6837 for (tmp_os
= os
; tmp_os
; tmp_os
= tmp_os
->next
)
6840 last
= tmp_os
->phdrs
;
6844 einfo (_("%F%P: no sections assigned to phdrs\n"));
6849 if (os
->bfd_section
== NULL
)
6852 for (; pl
!= NULL
; pl
= pl
->next
)
6854 if (strcmp (pl
->name
, l
->name
) == 0)
6859 secs
= xrealloc (secs
, alc
* sizeof (asection
*));
6861 secs
[c
] = os
->bfd_section
;
6868 if (l
->flags
== NULL
)
6871 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
6876 at
= exp_get_vma (l
->at
, 0, "phdr load address");
6878 if (! bfd_record_phdr (link_info
.output_bfd
, l
->type
,
6879 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
6880 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
6881 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
6886 /* Make sure all the phdr assignments succeeded. */
6887 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6891 lang_output_section_phdr_list
*pl
;
6893 if (os
->constraint
< 0
6894 || os
->bfd_section
== NULL
)
6897 for (pl
= os
->phdrs
;
6900 if (! pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
6901 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
6902 os
->name
, pl
->name
);
6906 /* Record a list of sections which may not be cross referenced. */
6909 lang_add_nocrossref (lang_nocrossref_type
*l
)
6911 struct lang_nocrossrefs
*n
;
6913 n
= xmalloc (sizeof *n
);
6914 n
->next
= nocrossref_list
;
6916 nocrossref_list
= n
;
6918 /* Set notice_all so that we get informed about all symbols. */
6919 link_info
.notice_all
= TRUE
;
6922 /* Overlay handling. We handle overlays with some static variables. */
6924 /* The overlay virtual address. */
6925 static etree_type
*overlay_vma
;
6926 /* And subsection alignment. */
6927 static etree_type
*overlay_subalign
;
6929 /* An expression for the maximum section size seen so far. */
6930 static etree_type
*overlay_max
;
6932 /* A list of all the sections in this overlay. */
6934 struct overlay_list
{
6935 struct overlay_list
*next
;
6936 lang_output_section_statement_type
*os
;
6939 static struct overlay_list
*overlay_list
;
6941 /* Start handling an overlay. */
6944 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
6946 /* The grammar should prevent nested overlays from occurring. */
6947 ASSERT (overlay_vma
== NULL
6948 && overlay_subalign
== NULL
6949 && overlay_max
== NULL
);
6951 overlay_vma
= vma_expr
;
6952 overlay_subalign
= subalign
;
6955 /* Start a section in an overlay. We handle this by calling
6956 lang_enter_output_section_statement with the correct VMA.
6957 lang_leave_overlay sets up the LMA and memory regions. */
6960 lang_enter_overlay_section (const char *name
)
6962 struct overlay_list
*n
;
6965 lang_enter_output_section_statement (name
, overlay_vma
, overlay_section
,
6966 0, overlay_subalign
, 0, 0);
6968 /* If this is the first section, then base the VMA of future
6969 sections on this one. This will work correctly even if `.' is
6970 used in the addresses. */
6971 if (overlay_list
== NULL
)
6972 overlay_vma
= exp_nameop (ADDR
, name
);
6974 /* Remember the section. */
6975 n
= xmalloc (sizeof *n
);
6976 n
->os
= current_section
;
6977 n
->next
= overlay_list
;
6980 size
= exp_nameop (SIZEOF
, name
);
6982 /* Arrange to work out the maximum section end address. */
6983 if (overlay_max
== NULL
)
6986 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
6989 /* Finish a section in an overlay. There isn't any special to do
6993 lang_leave_overlay_section (fill_type
*fill
,
6994 lang_output_section_phdr_list
*phdrs
)
7001 name
= current_section
->name
;
7003 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
7004 region and that no load-time region has been specified. It doesn't
7005 really matter what we say here, since lang_leave_overlay will
7007 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
7009 /* Define the magic symbols. */
7011 clean
= xmalloc (strlen (name
) + 1);
7013 for (s1
= name
; *s1
!= '\0'; s1
++)
7014 if (ISALNUM (*s1
) || *s1
== '_')
7018 buf
= xmalloc (strlen (clean
) + sizeof "__load_start_");
7019 sprintf (buf
, "__load_start_%s", clean
);
7020 lang_add_assignment (exp_provide (buf
,
7021 exp_nameop (LOADADDR
, name
),
7024 buf
= xmalloc (strlen (clean
) + sizeof "__load_stop_");
7025 sprintf (buf
, "__load_stop_%s", clean
);
7026 lang_add_assignment (exp_provide (buf
,
7028 exp_nameop (LOADADDR
, name
),
7029 exp_nameop (SIZEOF
, name
)),
7035 /* Finish an overlay. If there are any overlay wide settings, this
7036 looks through all the sections in the overlay and sets them. */
7039 lang_leave_overlay (etree_type
*lma_expr
,
7042 const char *memspec
,
7043 lang_output_section_phdr_list
*phdrs
,
7044 const char *lma_memspec
)
7046 lang_memory_region_type
*region
;
7047 lang_memory_region_type
*lma_region
;
7048 struct overlay_list
*l
;
7049 lang_nocrossref_type
*nocrossref
;
7051 lang_get_regions (®ion
, &lma_region
,
7052 memspec
, lma_memspec
,
7053 lma_expr
!= NULL
, FALSE
);
7057 /* After setting the size of the last section, set '.' to end of the
7059 if (overlay_list
!= NULL
)
7060 overlay_list
->os
->update_dot_tree
7061 = exp_assop ('=', ".", exp_binop ('+', overlay_vma
, overlay_max
));
7066 struct overlay_list
*next
;
7068 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
7071 l
->os
->region
= region
;
7072 l
->os
->lma_region
= lma_region
;
7074 /* The first section has the load address specified in the
7075 OVERLAY statement. The rest are worked out from that.
7076 The base address is not needed (and should be null) if
7077 an LMA region was specified. */
7080 l
->os
->load_base
= lma_expr
;
7081 l
->os
->sectype
= normal_section
;
7083 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
7084 l
->os
->phdrs
= phdrs
;
7088 lang_nocrossref_type
*nc
;
7090 nc
= xmalloc (sizeof *nc
);
7091 nc
->name
= l
->os
->name
;
7092 nc
->next
= nocrossref
;
7101 if (nocrossref
!= NULL
)
7102 lang_add_nocrossref (nocrossref
);
7105 overlay_list
= NULL
;
7109 /* Version handling. This is only useful for ELF. */
7111 /* This global variable holds the version tree that we build. */
7113 struct bfd_elf_version_tree
*lang_elf_version_info
;
7115 /* If PREV is NULL, return first version pattern matching particular symbol.
7116 If PREV is non-NULL, return first version pattern matching particular
7117 symbol after PREV (previously returned by lang_vers_match). */
7119 static struct bfd_elf_version_expr
*
7120 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
7121 struct bfd_elf_version_expr
*prev
,
7124 const char *cxx_sym
= sym
;
7125 const char *java_sym
= sym
;
7126 struct bfd_elf_version_expr
*expr
= NULL
;
7128 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
7130 cxx_sym
= cplus_demangle (sym
, DMGL_PARAMS
| DMGL_ANSI
);
7134 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
7136 java_sym
= cplus_demangle (sym
, DMGL_JAVA
);
7141 if (head
->htab
&& (prev
== NULL
|| prev
->literal
))
7143 struct bfd_elf_version_expr e
;
7145 switch (prev
? prev
->mask
: 0)
7148 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
7151 expr
= htab_find (head
->htab
, &e
);
7152 while (expr
&& strcmp (expr
->pattern
, sym
) == 0)
7153 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
7159 case BFD_ELF_VERSION_C_TYPE
:
7160 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
7162 e
.pattern
= cxx_sym
;
7163 expr
= htab_find (head
->htab
, &e
);
7164 while (expr
&& strcmp (expr
->pattern
, cxx_sym
) == 0)
7165 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
7171 case BFD_ELF_VERSION_CXX_TYPE
:
7172 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
7174 e
.pattern
= java_sym
;
7175 expr
= htab_find (head
->htab
, &e
);
7176 while (expr
&& strcmp (expr
->pattern
, java_sym
) == 0)
7177 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7188 /* Finally, try the wildcards. */
7189 if (prev
== NULL
|| prev
->literal
)
7190 expr
= head
->remaining
;
7193 for (; expr
; expr
= expr
->next
)
7200 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
7203 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7205 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
7209 if (fnmatch (expr
->pattern
, s
, 0) == 0)
7215 free ((char *) cxx_sym
);
7216 if (java_sym
!= sym
)
7217 free ((char *) java_sym
);
7221 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
7222 return a pointer to the symbol name with any backslash quotes removed. */
7225 realsymbol (const char *pattern
)
7228 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
7229 char *s
, *symbol
= xmalloc (strlen (pattern
) + 1);
7231 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
7233 /* It is a glob pattern only if there is no preceding
7237 /* Remove the preceding backslash. */
7244 if (*p
== '?' || *p
== '*' || *p
== '[')
7251 backslash
= *p
== '\\';
7267 /* This is called for each variable name or match expression. NEW_NAME is
7268 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
7269 pattern to be matched against symbol names. */
7271 struct bfd_elf_version_expr
*
7272 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
7273 const char *new_name
,
7275 bfd_boolean literal_p
)
7277 struct bfd_elf_version_expr
*ret
;
7279 ret
= (struct bfd_elf_version_expr
*) xmalloc (sizeof *ret
);
7283 ret
->literal
= TRUE
;
7284 ret
->pattern
= literal_p
? new_name
: realsymbol (new_name
);
7285 if (ret
->pattern
== NULL
)
7287 ret
->pattern
= new_name
;
7288 ret
->literal
= FALSE
;
7291 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
7292 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7293 else if (strcasecmp (lang
, "C++") == 0)
7294 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
7295 else if (strcasecmp (lang
, "Java") == 0)
7296 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
7299 einfo (_("%X%P: unknown language `%s' in version information\n"),
7301 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7304 return ldemul_new_vers_pattern (ret
);
7307 /* This is called for each set of variable names and match
7310 struct bfd_elf_version_tree
*
7311 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
7312 struct bfd_elf_version_expr
*locals
)
7314 struct bfd_elf_version_tree
*ret
;
7316 ret
= xcalloc (1, sizeof *ret
);
7317 ret
->globals
.list
= globals
;
7318 ret
->locals
.list
= locals
;
7319 ret
->match
= lang_vers_match
;
7320 ret
->name_indx
= (unsigned int) -1;
7324 /* This static variable keeps track of version indices. */
7326 static int version_index
;
7329 version_expr_head_hash (const void *p
)
7331 const struct bfd_elf_version_expr
*e
= p
;
7333 return htab_hash_string (e
->pattern
);
7337 version_expr_head_eq (const void *p1
, const void *p2
)
7339 const struct bfd_elf_version_expr
*e1
= p1
;
7340 const struct bfd_elf_version_expr
*e2
= p2
;
7342 return strcmp (e1
->pattern
, e2
->pattern
) == 0;
7346 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
7349 struct bfd_elf_version_expr
*e
, *next
;
7350 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
7352 for (e
= head
->list
; e
; e
= e
->next
)
7356 head
->mask
|= e
->mask
;
7361 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
7362 version_expr_head_eq
, NULL
);
7363 list_loc
= &head
->list
;
7364 remaining_loc
= &head
->remaining
;
7365 for (e
= head
->list
; e
; e
= next
)
7371 remaining_loc
= &e
->next
;
7375 void **loc
= htab_find_slot (head
->htab
, e
, INSERT
);
7379 struct bfd_elf_version_expr
*e1
, *last
;
7385 if (e1
->mask
== e
->mask
)
7393 while (e1
&& strcmp (e1
->pattern
, e
->pattern
) == 0);
7397 /* This is a duplicate. */
7398 /* FIXME: Memory leak. Sometimes pattern is not
7399 xmalloced alone, but in larger chunk of memory. */
7400 /* free (e->pattern); */
7405 e
->next
= last
->next
;
7413 list_loc
= &e
->next
;
7417 *remaining_loc
= NULL
;
7418 *list_loc
= head
->remaining
;
7421 head
->remaining
= head
->list
;
7424 /* This is called when we know the name and dependencies of the
7428 lang_register_vers_node (const char *name
,
7429 struct bfd_elf_version_tree
*version
,
7430 struct bfd_elf_version_deps
*deps
)
7432 struct bfd_elf_version_tree
*t
, **pp
;
7433 struct bfd_elf_version_expr
*e1
;
7438 if ((name
[0] == '\0' && lang_elf_version_info
!= NULL
)
7439 || (lang_elf_version_info
&& lang_elf_version_info
->name
[0] == '\0'))
7441 einfo (_("%X%P: anonymous version tag cannot be combined"
7442 " with other version tags\n"));
7447 /* Make sure this node has a unique name. */
7448 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
7449 if (strcmp (t
->name
, name
) == 0)
7450 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
7452 lang_finalize_version_expr_head (&version
->globals
);
7453 lang_finalize_version_expr_head (&version
->locals
);
7455 /* Check the global and local match names, and make sure there
7456 aren't any duplicates. */
7458 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
7460 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
7462 struct bfd_elf_version_expr
*e2
;
7464 if (t
->locals
.htab
&& e1
->literal
)
7466 e2
= htab_find (t
->locals
.htab
, e1
);
7467 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
7469 if (e1
->mask
== e2
->mask
)
7470 einfo (_("%X%P: duplicate expression `%s'"
7471 " in version information\n"), e1
->pattern
);
7475 else if (!e1
->literal
)
7476 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
7477 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
7478 && e1
->mask
== e2
->mask
)
7479 einfo (_("%X%P: duplicate expression `%s'"
7480 " in version information\n"), e1
->pattern
);
7484 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
7486 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
7488 struct bfd_elf_version_expr
*e2
;
7490 if (t
->globals
.htab
&& e1
->literal
)
7492 e2
= htab_find (t
->globals
.htab
, e1
);
7493 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
7495 if (e1
->mask
== e2
->mask
)
7496 einfo (_("%X%P: duplicate expression `%s'"
7497 " in version information\n"),
7502 else if (!e1
->literal
)
7503 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
7504 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
7505 && e1
->mask
== e2
->mask
)
7506 einfo (_("%X%P: duplicate expression `%s'"
7507 " in version information\n"), e1
->pattern
);
7511 version
->deps
= deps
;
7512 version
->name
= name
;
7513 if (name
[0] != '\0')
7516 version
->vernum
= version_index
;
7519 version
->vernum
= 0;
7521 for (pp
= &lang_elf_version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
7526 /* This is called when we see a version dependency. */
7528 struct bfd_elf_version_deps
*
7529 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
7531 struct bfd_elf_version_deps
*ret
;
7532 struct bfd_elf_version_tree
*t
;
7534 ret
= xmalloc (sizeof *ret
);
7537 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
7539 if (strcmp (t
->name
, name
) == 0)
7541 ret
->version_needed
= t
;
7546 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
7552 lang_do_version_exports_section (void)
7554 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
7556 LANG_FOR_EACH_INPUT_STATEMENT (is
)
7558 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
7566 contents
= xmalloc (len
);
7567 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
7568 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
7571 while (p
< contents
+ len
)
7573 greg
= lang_new_vers_pattern (greg
, p
, NULL
, FALSE
);
7574 p
= strchr (p
, '\0') + 1;
7577 /* Do not free the contents, as we used them creating the regex. */
7579 /* Do not include this section in the link. */
7580 sec
->flags
|= SEC_EXCLUDE
| SEC_KEEP
;
7583 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, FALSE
);
7584 lang_register_vers_node (command_line
.version_exports_section
,
7585 lang_new_vers_node (greg
, lreg
), NULL
);
7589 lang_add_unique (const char *name
)
7591 struct unique_sections
*ent
;
7593 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
7594 if (strcmp (ent
->name
, name
) == 0)
7597 ent
= xmalloc (sizeof *ent
);
7598 ent
->name
= xstrdup (name
);
7599 ent
->next
= unique_section_list
;
7600 unique_section_list
= ent
;
7603 /* Append the list of dynamic symbols to the existing one. */
7606 lang_append_dynamic_list (struct bfd_elf_version_expr
*dynamic
)
7608 if (link_info
.dynamic_list
)
7610 struct bfd_elf_version_expr
*tail
;
7611 for (tail
= dynamic
; tail
->next
!= NULL
; tail
= tail
->next
)
7613 tail
->next
= link_info
.dynamic_list
->head
.list
;
7614 link_info
.dynamic_list
->head
.list
= dynamic
;
7618 struct bfd_elf_dynamic_list
*d
;
7620 d
= xcalloc (1, sizeof *d
);
7621 d
->head
.list
= dynamic
;
7622 d
->match
= lang_vers_match
;
7623 link_info
.dynamic_list
= d
;
7627 /* Append the list of C++ typeinfo dynamic symbols to the existing
7631 lang_append_dynamic_list_cpp_typeinfo (void)
7633 const char * symbols
[] =
7635 "typeinfo name for*",
7638 struct bfd_elf_version_expr
*dynamic
= NULL
;
7641 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
7642 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
7645 lang_append_dynamic_list (dynamic
);
7648 /* Append the list of C++ operator new and delete dynamic symbols to the
7652 lang_append_dynamic_list_cpp_new (void)
7654 const char * symbols
[] =
7659 struct bfd_elf_version_expr
*dynamic
= NULL
;
7662 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
7663 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
7666 lang_append_dynamic_list (dynamic
);