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, 2010
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"
46 #endif /* ENABLE_PLUGINS */
49 #define offsetof(TYPE, MEMBER) ((size_t) & (((TYPE*) 0)->MEMBER))
52 /* Locals variables. */
53 static struct obstack stat_obstack
;
54 static struct obstack map_obstack
;
56 #define obstack_chunk_alloc xmalloc
57 #define obstack_chunk_free free
58 static const char *startup_file
;
59 static const char *entry_symbol_default
= "start";
60 static bfd_boolean placed_commons
= FALSE
;
61 static bfd_boolean stripped_excluded_sections
= FALSE
;
62 static lang_output_section_statement_type
*default_common_section
;
63 static bfd_boolean map_option_f
;
64 static bfd_vma print_dot
;
65 static lang_input_statement_type
*first_file
;
66 static const char *current_target
;
67 static lang_statement_list_type statement_list
;
68 static struct bfd_hash_table lang_definedness_table
;
69 static lang_statement_list_type
*stat_save
[10];
70 static lang_statement_list_type
**stat_save_ptr
= &stat_save
[0];
71 static struct unique_sections
*unique_section_list
;
72 static bfd_boolean ldlang_sysrooted_script
= FALSE
;
74 /* Forward declarations. */
75 static void exp_init_os (etree_type
*);
76 static void init_map_userdata (bfd
*, asection
*, void *);
77 static lang_input_statement_type
*lookup_name (const char *);
78 static struct bfd_hash_entry
*lang_definedness_newfunc
79 (struct bfd_hash_entry
*, struct bfd_hash_table
*, const char *);
80 static void insert_undefined (const char *);
81 static bfd_boolean
sort_def_symbol (struct bfd_link_hash_entry
*, void *);
82 static void print_statement (lang_statement_union_type
*,
83 lang_output_section_statement_type
*);
84 static void print_statement_list (lang_statement_union_type
*,
85 lang_output_section_statement_type
*);
86 static void print_statements (void);
87 static void print_input_section (asection
*, bfd_boolean
);
88 static bfd_boolean
lang_one_common (struct bfd_link_hash_entry
*, void *);
89 static void lang_record_phdrs (void);
90 static void lang_do_version_exports_section (void);
91 static void lang_finalize_version_expr_head
92 (struct bfd_elf_version_expr_head
*);
94 /* Exported variables. */
95 const char *output_target
;
96 lang_output_section_statement_type
*abs_output_section
;
97 lang_statement_list_type lang_output_section_statement
;
98 lang_statement_list_type
*stat_ptr
= &statement_list
;
99 lang_statement_list_type file_chain
= { NULL
, NULL
};
100 lang_statement_list_type input_file_chain
;
101 struct bfd_sym_chain entry_symbol
= { NULL
, NULL
};
102 const char *entry_section
= ".text";
103 bfd_boolean entry_from_cmdline
;
104 bfd_boolean lang_has_input_file
= FALSE
;
105 bfd_boolean had_output_filename
= FALSE
;
106 bfd_boolean lang_float_flag
= FALSE
;
107 bfd_boolean delete_output_file_on_failure
= FALSE
;
108 struct lang_phdr
*lang_phdr_list
;
109 struct lang_nocrossrefs
*nocrossref_list
;
110 bfd_boolean missing_file
= FALSE
;
112 /* Functions that traverse the linker script and might evaluate
113 DEFINED() need to increment this. */
114 int lang_statement_iteration
= 0;
116 etree_type
*base
; /* Relocation base - or null */
118 /* Return TRUE if the PATTERN argument is a wildcard pattern.
119 Although backslashes are treated specially if a pattern contains
120 wildcards, we do not consider the mere presence of a backslash to
121 be enough to cause the pattern to be treated as a wildcard.
122 That lets us handle DOS filenames more naturally. */
123 #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL)
125 #define new_stat(x, y) \
126 (x##_type *) new_statement (x##_enum, sizeof (x##_type), y)
128 #define outside_section_address(q) \
129 ((q)->output_offset + (q)->output_section->vma)
131 #define outside_symbol_address(q) \
132 ((q)->value + outside_section_address (q->section))
134 #define SECTION_NAME_MAP_LENGTH (16)
137 stat_alloc (size_t size
)
139 return obstack_alloc (&stat_obstack
, size
);
143 name_match (const char *pattern
, const char *name
)
145 if (wildcardp (pattern
))
146 return fnmatch (pattern
, name
, 0);
147 return strcmp (pattern
, name
);
150 /* If PATTERN is of the form archive:file, return a pointer to the
151 separator. If not, return NULL. */
154 archive_path (const char *pattern
)
158 if (link_info
.path_separator
== 0)
161 p
= strchr (pattern
, link_info
.path_separator
);
162 #ifdef HAVE_DOS_BASED_FILE_SYSTEM
163 if (p
== NULL
|| link_info
.path_separator
!= ':')
166 /* Assume a match on the second char is part of drive specifier,
167 as in "c:\silly.dos". */
168 if (p
== pattern
+ 1 && ISALPHA (*pattern
))
169 p
= strchr (p
+ 1, link_info
.path_separator
);
174 /* Given that FILE_SPEC results in a non-NULL SEP result from archive_path,
175 return whether F matches FILE_SPEC. */
178 input_statement_is_archive_path (const char *file_spec
, char *sep
,
179 lang_input_statement_type
*f
)
181 bfd_boolean match
= FALSE
;
184 || name_match (sep
+ 1, f
->filename
) == 0)
185 && ((sep
!= file_spec
)
186 == (f
->the_bfd
!= NULL
&& f
->the_bfd
->my_archive
!= NULL
)))
190 if (sep
!= file_spec
)
192 const char *aname
= f
->the_bfd
->my_archive
->filename
;
194 match
= name_match (file_spec
, aname
) == 0;
195 *sep
= link_info
.path_separator
;
202 unique_section_p (const asection
*sec
,
203 const lang_output_section_statement_type
*os
)
205 struct unique_sections
*unam
;
208 if (link_info
.relocatable
209 && sec
->owner
!= NULL
210 && bfd_is_group_section (sec
->owner
, sec
))
212 && strcmp (os
->name
, DISCARD_SECTION_NAME
) == 0);
215 for (unam
= unique_section_list
; unam
; unam
= unam
->next
)
216 if (name_match (unam
->name
, secnam
) == 0)
222 /* Generic traversal routines for finding matching sections. */
224 /* Try processing a section against a wildcard. This just calls
225 the callback unless the filename exclusion list is present
226 and excludes the file. It's hardly ever present so this
227 function is very fast. */
230 walk_wild_consider_section (lang_wild_statement_type
*ptr
,
231 lang_input_statement_type
*file
,
233 struct wildcard_list
*sec
,
237 struct name_list
*list_tmp
;
239 /* Don't process sections from files which were excluded. */
240 for (list_tmp
= sec
->spec
.exclude_name_list
;
242 list_tmp
= list_tmp
->next
)
244 char *p
= archive_path (list_tmp
->name
);
248 if (input_statement_is_archive_path (list_tmp
->name
, p
, file
))
252 else if (name_match (list_tmp
->name
, file
->filename
) == 0)
255 /* FIXME: Perhaps remove the following at some stage? Matching
256 unadorned archives like this was never documented and has
257 been superceded by the archive:path syntax. */
258 else if (file
->the_bfd
!= NULL
259 && file
->the_bfd
->my_archive
!= NULL
260 && name_match (list_tmp
->name
,
261 file
->the_bfd
->my_archive
->filename
) == 0)
265 (*callback
) (ptr
, sec
, s
, file
, data
);
268 /* Lowest common denominator routine that can handle everything correctly,
272 walk_wild_section_general (lang_wild_statement_type
*ptr
,
273 lang_input_statement_type
*file
,
278 struct wildcard_list
*sec
;
280 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
282 sec
= ptr
->section_list
;
284 (*callback
) (ptr
, sec
, s
, file
, data
);
288 bfd_boolean skip
= FALSE
;
290 if (sec
->spec
.name
!= NULL
)
292 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
294 skip
= name_match (sec
->spec
.name
, sname
) != 0;
298 walk_wild_consider_section (ptr
, file
, s
, sec
, callback
, data
);
305 /* Routines to find a single section given its name. If there's more
306 than one section with that name, we report that. */
310 asection
*found_section
;
311 bfd_boolean multiple_sections_found
;
312 } section_iterator_callback_data
;
315 section_iterator_callback (bfd
*abfd ATTRIBUTE_UNUSED
, asection
*s
, void *data
)
317 section_iterator_callback_data
*d
= (section_iterator_callback_data
*) data
;
319 if (d
->found_section
!= NULL
)
321 d
->multiple_sections_found
= TRUE
;
325 d
->found_section
= s
;
330 find_section (lang_input_statement_type
*file
,
331 struct wildcard_list
*sec
,
332 bfd_boolean
*multiple_sections_found
)
334 section_iterator_callback_data cb_data
= { NULL
, FALSE
};
336 bfd_get_section_by_name_if (file
->the_bfd
, sec
->spec
.name
,
337 section_iterator_callback
, &cb_data
);
338 *multiple_sections_found
= cb_data
.multiple_sections_found
;
339 return cb_data
.found_section
;
342 /* Code for handling simple wildcards without going through fnmatch,
343 which can be expensive because of charset translations etc. */
345 /* A simple wild is a literal string followed by a single '*',
346 where the literal part is at least 4 characters long. */
349 is_simple_wild (const char *name
)
351 size_t len
= strcspn (name
, "*?[");
352 return len
>= 4 && name
[len
] == '*' && name
[len
+ 1] == '\0';
356 match_simple_wild (const char *pattern
, const char *name
)
358 /* The first four characters of the pattern are guaranteed valid
359 non-wildcard characters. So we can go faster. */
360 if (pattern
[0] != name
[0] || pattern
[1] != name
[1]
361 || pattern
[2] != name
[2] || pattern
[3] != name
[3])
366 while (*pattern
!= '*')
367 if (*name
++ != *pattern
++)
373 /* Compare sections ASEC and BSEC according to SORT. */
376 compare_section (sort_type sort
, asection
*asec
, asection
*bsec
)
385 case by_alignment_name
:
386 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
387 - bfd_section_alignment (asec
->owner
, asec
));
393 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
394 bfd_get_section_name (bsec
->owner
, bsec
));
397 case by_name_alignment
:
398 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
399 bfd_get_section_name (bsec
->owner
, bsec
));
405 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
406 - bfd_section_alignment (asec
->owner
, asec
));
413 /* Build a Binary Search Tree to sort sections, unlike insertion sort
414 used in wild_sort(). BST is considerably faster if the number of
415 of sections are large. */
417 static lang_section_bst_type
**
418 wild_sort_fast (lang_wild_statement_type
*wild
,
419 struct wildcard_list
*sec
,
420 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
423 lang_section_bst_type
**tree
;
426 if (!wild
->filenames_sorted
427 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
429 /* Append at the right end of tree. */
431 tree
= &((*tree
)->right
);
437 /* Find the correct node to append this section. */
438 if (compare_section (sec
->spec
.sorted
, section
, (*tree
)->section
) < 0)
439 tree
= &((*tree
)->left
);
441 tree
= &((*tree
)->right
);
447 /* Use wild_sort_fast to build a BST to sort sections. */
450 output_section_callback_fast (lang_wild_statement_type
*ptr
,
451 struct wildcard_list
*sec
,
453 lang_input_statement_type
*file
,
456 lang_section_bst_type
*node
;
457 lang_section_bst_type
**tree
;
458 lang_output_section_statement_type
*os
;
460 os
= (lang_output_section_statement_type
*) output
;
462 if (unique_section_p (section
, os
))
465 node
= (lang_section_bst_type
*) xmalloc (sizeof (lang_section_bst_type
));
468 node
->section
= section
;
470 tree
= wild_sort_fast (ptr
, sec
, file
, section
);
475 /* Convert a sorted sections' BST back to list form. */
478 output_section_callback_tree_to_list (lang_wild_statement_type
*ptr
,
479 lang_section_bst_type
*tree
,
483 output_section_callback_tree_to_list (ptr
, tree
->left
, output
);
485 lang_add_section (&ptr
->children
, tree
->section
,
486 (lang_output_section_statement_type
*) output
);
489 output_section_callback_tree_to_list (ptr
, tree
->right
, output
);
494 /* Specialized, optimized routines for handling different kinds of
498 walk_wild_section_specs1_wild0 (lang_wild_statement_type
*ptr
,
499 lang_input_statement_type
*file
,
503 /* We can just do a hash lookup for the section with the right name.
504 But if that lookup discovers more than one section with the name
505 (should be rare), we fall back to the general algorithm because
506 we would otherwise have to sort the sections to make sure they
507 get processed in the bfd's order. */
508 bfd_boolean multiple_sections_found
;
509 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
510 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
512 if (multiple_sections_found
)
513 walk_wild_section_general (ptr
, file
, callback
, data
);
515 walk_wild_consider_section (ptr
, file
, s0
, sec0
, callback
, data
);
519 walk_wild_section_specs1_wild1 (lang_wild_statement_type
*ptr
,
520 lang_input_statement_type
*file
,
525 struct wildcard_list
*wildsec0
= ptr
->handler_data
[0];
527 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
529 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
530 bfd_boolean skip
= !match_simple_wild (wildsec0
->spec
.name
, sname
);
533 walk_wild_consider_section (ptr
, file
, s
, wildsec0
, callback
, data
);
538 walk_wild_section_specs2_wild1 (lang_wild_statement_type
*ptr
,
539 lang_input_statement_type
*file
,
544 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
545 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
546 bfd_boolean multiple_sections_found
;
547 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
549 if (multiple_sections_found
)
551 walk_wild_section_general (ptr
, file
, callback
, data
);
555 /* Note that if the section was not found, s0 is NULL and
556 we'll simply never succeed the s == s0 test below. */
557 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
559 /* Recall that in this code path, a section cannot satisfy more
560 than one spec, so if s == s0 then it cannot match
563 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
566 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
567 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
570 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
,
577 walk_wild_section_specs3_wild2 (lang_wild_statement_type
*ptr
,
578 lang_input_statement_type
*file
,
583 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
584 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
585 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
586 bfd_boolean multiple_sections_found
;
587 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
589 if (multiple_sections_found
)
591 walk_wild_section_general (ptr
, file
, callback
, data
);
595 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
598 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
601 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
602 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
605 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
, data
);
608 skip
= !match_simple_wild (wildsec2
->spec
.name
, sname
);
610 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
618 walk_wild_section_specs4_wild2 (lang_wild_statement_type
*ptr
,
619 lang_input_statement_type
*file
,
624 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
625 struct wildcard_list
*sec1
= ptr
->handler_data
[1];
626 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
627 struct wildcard_list
*wildsec3
= ptr
->handler_data
[3];
628 bfd_boolean multiple_sections_found
;
629 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
), *s1
;
631 if (multiple_sections_found
)
633 walk_wild_section_general (ptr
, file
, callback
, data
);
637 s1
= find_section (file
, sec1
, &multiple_sections_found
);
638 if (multiple_sections_found
)
640 walk_wild_section_general (ptr
, file
, callback
, data
);
644 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
647 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
650 walk_wild_consider_section (ptr
, file
, s
, sec1
, callback
, data
);
653 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
654 bfd_boolean skip
= !match_simple_wild (wildsec2
->spec
.name
,
658 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
662 skip
= !match_simple_wild (wildsec3
->spec
.name
, sname
);
664 walk_wild_consider_section (ptr
, file
, s
, wildsec3
,
672 walk_wild_section (lang_wild_statement_type
*ptr
,
673 lang_input_statement_type
*file
,
677 if (file
->just_syms_flag
)
680 (*ptr
->walk_wild_section_handler
) (ptr
, file
, callback
, data
);
683 /* Returns TRUE when name1 is a wildcard spec that might match
684 something name2 can match. We're conservative: we return FALSE
685 only if the prefixes of name1 and name2 are different up to the
686 first wildcard character. */
689 wild_spec_can_overlap (const char *name1
, const char *name2
)
691 size_t prefix1_len
= strcspn (name1
, "?*[");
692 size_t prefix2_len
= strcspn (name2
, "?*[");
693 size_t min_prefix_len
;
695 /* Note that if there is no wildcard character, then we treat the
696 terminating 0 as part of the prefix. Thus ".text" won't match
697 ".text." or ".text.*", for example. */
698 if (name1
[prefix1_len
] == '\0')
700 if (name2
[prefix2_len
] == '\0')
703 min_prefix_len
= prefix1_len
< prefix2_len
? prefix1_len
: prefix2_len
;
705 return memcmp (name1
, name2
, min_prefix_len
) == 0;
708 /* Select specialized code to handle various kinds of wildcard
712 analyze_walk_wild_section_handler (lang_wild_statement_type
*ptr
)
715 int wild_name_count
= 0;
716 struct wildcard_list
*sec
;
720 ptr
->walk_wild_section_handler
= walk_wild_section_general
;
721 ptr
->handler_data
[0] = NULL
;
722 ptr
->handler_data
[1] = NULL
;
723 ptr
->handler_data
[2] = NULL
;
724 ptr
->handler_data
[3] = NULL
;
727 /* Count how many wildcard_specs there are, and how many of those
728 actually use wildcards in the name. Also, bail out if any of the
729 wildcard names are NULL. (Can this actually happen?
730 walk_wild_section used to test for it.) And bail out if any
731 of the wildcards are more complex than a simple string
732 ending in a single '*'. */
733 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
736 if (sec
->spec
.name
== NULL
)
738 if (wildcardp (sec
->spec
.name
))
741 if (!is_simple_wild (sec
->spec
.name
))
746 /* The zero-spec case would be easy to optimize but it doesn't
747 happen in practice. Likewise, more than 4 specs doesn't
748 happen in practice. */
749 if (sec_count
== 0 || sec_count
> 4)
752 /* Check that no two specs can match the same section. */
753 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
755 struct wildcard_list
*sec2
;
756 for (sec2
= sec
->next
; sec2
!= NULL
; sec2
= sec2
->next
)
758 if (wild_spec_can_overlap (sec
->spec
.name
, sec2
->spec
.name
))
763 signature
= (sec_count
<< 8) + wild_name_count
;
767 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild0
;
770 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild1
;
773 ptr
->walk_wild_section_handler
= walk_wild_section_specs2_wild1
;
776 ptr
->walk_wild_section_handler
= walk_wild_section_specs3_wild2
;
779 ptr
->walk_wild_section_handler
= walk_wild_section_specs4_wild2
;
785 /* Now fill the data array with pointers to the specs, first the
786 specs with non-wildcard names, then the specs with wildcard
787 names. It's OK to process the specs in different order from the
788 given order, because we've already determined that no section
789 will match more than one spec. */
791 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
792 if (!wildcardp (sec
->spec
.name
))
793 ptr
->handler_data
[data_counter
++] = sec
;
794 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
795 if (wildcardp (sec
->spec
.name
))
796 ptr
->handler_data
[data_counter
++] = sec
;
799 /* Handle a wild statement for a single file F. */
802 walk_wild_file (lang_wild_statement_type
*s
,
803 lang_input_statement_type
*f
,
807 if (f
->the_bfd
== NULL
808 || ! bfd_check_format (f
->the_bfd
, bfd_archive
))
809 walk_wild_section (s
, f
, callback
, data
);
814 /* This is an archive file. We must map each member of the
815 archive separately. */
816 member
= bfd_openr_next_archived_file (f
->the_bfd
, NULL
);
817 while (member
!= NULL
)
819 /* When lookup_name is called, it will call the add_symbols
820 entry point for the archive. For each element of the
821 archive which is included, BFD will call ldlang_add_file,
822 which will set the usrdata field of the member to the
823 lang_input_statement. */
824 if (member
->usrdata
!= NULL
)
826 walk_wild_section (s
,
827 (lang_input_statement_type
*) member
->usrdata
,
831 member
= bfd_openr_next_archived_file (f
->the_bfd
, member
);
837 walk_wild (lang_wild_statement_type
*s
, callback_t callback
, void *data
)
839 const char *file_spec
= s
->filename
;
842 if (file_spec
== NULL
)
844 /* Perform the iteration over all files in the list. */
845 LANG_FOR_EACH_INPUT_STATEMENT (f
)
847 walk_wild_file (s
, f
, callback
, data
);
850 else if ((p
= archive_path (file_spec
)) != NULL
)
852 LANG_FOR_EACH_INPUT_STATEMENT (f
)
854 if (input_statement_is_archive_path (file_spec
, p
, f
))
855 walk_wild_file (s
, f
, callback
, data
);
858 else if (wildcardp (file_spec
))
860 LANG_FOR_EACH_INPUT_STATEMENT (f
)
862 if (fnmatch (file_spec
, f
->filename
, 0) == 0)
863 walk_wild_file (s
, f
, callback
, data
);
868 lang_input_statement_type
*f
;
870 /* Perform the iteration over a single file. */
871 f
= lookup_name (file_spec
);
873 walk_wild_file (s
, f
, callback
, data
);
877 /* lang_for_each_statement walks the parse tree and calls the provided
878 function for each node, except those inside output section statements
879 with constraint set to -1. */
882 lang_for_each_statement_worker (void (*func
) (lang_statement_union_type
*),
883 lang_statement_union_type
*s
)
885 for (; s
!= NULL
; s
= s
->header
.next
)
889 switch (s
->header
.type
)
891 case lang_constructors_statement_enum
:
892 lang_for_each_statement_worker (func
, constructor_list
.head
);
894 case lang_output_section_statement_enum
:
895 if (s
->output_section_statement
.constraint
!= -1)
896 lang_for_each_statement_worker
897 (func
, s
->output_section_statement
.children
.head
);
899 case lang_wild_statement_enum
:
900 lang_for_each_statement_worker (func
,
901 s
->wild_statement
.children
.head
);
903 case lang_group_statement_enum
:
904 lang_for_each_statement_worker (func
,
905 s
->group_statement
.children
.head
);
907 case lang_data_statement_enum
:
908 case lang_reloc_statement_enum
:
909 case lang_object_symbols_statement_enum
:
910 case lang_output_statement_enum
:
911 case lang_target_statement_enum
:
912 case lang_input_section_enum
:
913 case lang_input_statement_enum
:
914 case lang_assignment_statement_enum
:
915 case lang_padding_statement_enum
:
916 case lang_address_statement_enum
:
917 case lang_fill_statement_enum
:
918 case lang_insert_statement_enum
:
928 lang_for_each_statement (void (*func
) (lang_statement_union_type
*))
930 lang_for_each_statement_worker (func
, statement_list
.head
);
933 /*----------------------------------------------------------------------*/
936 lang_list_init (lang_statement_list_type
*list
)
939 list
->tail
= &list
->head
;
943 push_stat_ptr (lang_statement_list_type
*new_ptr
)
945 if (stat_save_ptr
>= stat_save
+ sizeof (stat_save
) / sizeof (stat_save
[0]))
947 *stat_save_ptr
++ = stat_ptr
;
954 if (stat_save_ptr
<= stat_save
)
956 stat_ptr
= *--stat_save_ptr
;
959 /* Build a new statement node for the parse tree. */
961 static lang_statement_union_type
*
962 new_statement (enum statement_enum type
,
964 lang_statement_list_type
*list
)
966 lang_statement_union_type
*new_stmt
;
968 new_stmt
= (lang_statement_union_type
*) stat_alloc (size
);
969 new_stmt
->header
.type
= type
;
970 new_stmt
->header
.next
= NULL
;
971 lang_statement_append (list
, new_stmt
, &new_stmt
->header
.next
);
975 /* Build a new input file node for the language. There are several
976 ways in which we treat an input file, eg, we only look at symbols,
977 or prefix it with a -l etc.
979 We can be supplied with requests for input files more than once;
980 they may, for example be split over several lines like foo.o(.text)
981 foo.o(.data) etc, so when asked for a file we check that we haven't
982 got it already so we don't duplicate the bfd. */
984 static lang_input_statement_type
*
985 new_afile (const char *name
,
986 lang_input_file_enum_type file_type
,
988 bfd_boolean add_to_list
)
990 lang_input_statement_type
*p
;
993 p
= (lang_input_statement_type
*) new_stat (lang_input_statement
, stat_ptr
);
996 p
= (lang_input_statement_type
*)
997 stat_alloc (sizeof (lang_input_statement_type
));
998 p
->header
.type
= lang_input_statement_enum
;
999 p
->header
.next
= NULL
;
1002 lang_has_input_file
= TRUE
;
1004 p
->sysrooted
= FALSE
;
1006 if (file_type
== lang_input_file_is_l_enum
1007 && name
[0] == ':' && name
[1] != '\0')
1009 file_type
= lang_input_file_is_search_file_enum
;
1015 case lang_input_file_is_symbols_only_enum
:
1017 p
->is_archive
= FALSE
;
1019 p
->local_sym_name
= name
;
1020 p
->just_syms_flag
= TRUE
;
1021 p
->search_dirs_flag
= FALSE
;
1023 case lang_input_file_is_fake_enum
:
1025 p
->is_archive
= FALSE
;
1027 p
->local_sym_name
= name
;
1028 p
->just_syms_flag
= FALSE
;
1029 p
->search_dirs_flag
= FALSE
;
1031 case lang_input_file_is_l_enum
:
1032 p
->is_archive
= TRUE
;
1035 p
->local_sym_name
= concat ("-l", name
, (const char *) NULL
);
1036 p
->just_syms_flag
= FALSE
;
1037 p
->search_dirs_flag
= TRUE
;
1039 case lang_input_file_is_marker_enum
:
1041 p
->is_archive
= FALSE
;
1043 p
->local_sym_name
= name
;
1044 p
->just_syms_flag
= FALSE
;
1045 p
->search_dirs_flag
= TRUE
;
1047 case lang_input_file_is_search_file_enum
:
1048 p
->sysrooted
= ldlang_sysrooted_script
;
1050 p
->is_archive
= FALSE
;
1052 p
->local_sym_name
= name
;
1053 p
->just_syms_flag
= FALSE
;
1054 p
->search_dirs_flag
= TRUE
;
1056 case lang_input_file_is_file_enum
:
1058 p
->is_archive
= FALSE
;
1060 p
->local_sym_name
= name
;
1061 p
->just_syms_flag
= FALSE
;
1062 p
->search_dirs_flag
= FALSE
;
1068 p
->next_real_file
= NULL
;
1070 p
->dynamic
= config
.dynamic_link
;
1071 p
->add_DT_NEEDED_for_dynamic
= add_DT_NEEDED_for_dynamic
;
1072 p
->add_DT_NEEDED_for_regular
= add_DT_NEEDED_for_regular
;
1073 p
->whole_archive
= whole_archive
;
1075 p
->missing_file
= FALSE
;
1077 lang_statement_append (&input_file_chain
,
1078 (lang_statement_union_type
*) p
,
1079 &p
->next_real_file
);
1083 lang_input_statement_type
*
1084 lang_add_input_file (const char *name
,
1085 lang_input_file_enum_type file_type
,
1088 return new_afile (name
, file_type
, target
, TRUE
);
1091 struct out_section_hash_entry
1093 struct bfd_hash_entry root
;
1094 lang_statement_union_type s
;
1097 /* The hash table. */
1099 static struct bfd_hash_table output_section_statement_table
;
1101 /* Support routines for the hash table used by lang_output_section_find,
1102 initialize the table, fill in an entry and remove the table. */
1104 static struct bfd_hash_entry
*
1105 output_section_statement_newfunc (struct bfd_hash_entry
*entry
,
1106 struct bfd_hash_table
*table
,
1109 lang_output_section_statement_type
**nextp
;
1110 struct out_section_hash_entry
*ret
;
1114 entry
= (struct bfd_hash_entry
*) bfd_hash_allocate (table
,
1120 entry
= bfd_hash_newfunc (entry
, table
, string
);
1124 ret
= (struct out_section_hash_entry
*) entry
;
1125 memset (&ret
->s
, 0, sizeof (ret
->s
));
1126 ret
->s
.header
.type
= lang_output_section_statement_enum
;
1127 ret
->s
.output_section_statement
.subsection_alignment
= -1;
1128 ret
->s
.output_section_statement
.section_alignment
= -1;
1129 ret
->s
.output_section_statement
.block_value
= 1;
1130 lang_list_init (&ret
->s
.output_section_statement
.children
);
1131 lang_statement_append (stat_ptr
, &ret
->s
, &ret
->s
.header
.next
);
1133 /* For every output section statement added to the list, except the
1134 first one, lang_output_section_statement.tail points to the "next"
1135 field of the last element of the list. */
1136 if (lang_output_section_statement
.head
!= NULL
)
1137 ret
->s
.output_section_statement
.prev
1138 = ((lang_output_section_statement_type
*)
1139 ((char *) lang_output_section_statement
.tail
1140 - offsetof (lang_output_section_statement_type
, next
)));
1142 /* GCC's strict aliasing rules prevent us from just casting the
1143 address, so we store the pointer in a variable and cast that
1145 nextp
= &ret
->s
.output_section_statement
.next
;
1146 lang_statement_append (&lang_output_section_statement
,
1148 (lang_statement_union_type
**) nextp
);
1153 output_section_statement_table_init (void)
1155 if (!bfd_hash_table_init_n (&output_section_statement_table
,
1156 output_section_statement_newfunc
,
1157 sizeof (struct out_section_hash_entry
),
1159 einfo (_("%P%F: can not create hash table: %E\n"));
1163 output_section_statement_table_free (void)
1165 bfd_hash_table_free (&output_section_statement_table
);
1168 /* Build enough state so that the parser can build its tree. */
1173 obstack_begin (&stat_obstack
, 1000);
1175 stat_ptr
= &statement_list
;
1177 output_section_statement_table_init ();
1179 lang_list_init (stat_ptr
);
1181 lang_list_init (&input_file_chain
);
1182 lang_list_init (&lang_output_section_statement
);
1183 lang_list_init (&file_chain
);
1184 first_file
= lang_add_input_file (NULL
, lang_input_file_is_marker_enum
,
1186 abs_output_section
=
1187 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME
, 0, TRUE
);
1189 abs_output_section
->bfd_section
= bfd_abs_section_ptr
;
1191 /* The value "3" is ad-hoc, somewhat related to the expected number of
1192 DEFINED expressions in a linker script. For most default linker
1193 scripts, there are none. Why a hash table then? Well, it's somewhat
1194 simpler to re-use working machinery than using a linked list in terms
1195 of code-complexity here in ld, besides the initialization which just
1196 looks like other code here. */
1197 if (!bfd_hash_table_init_n (&lang_definedness_table
,
1198 lang_definedness_newfunc
,
1199 sizeof (struct lang_definedness_hash_entry
),
1201 einfo (_("%P%F: can not create hash table: %E\n"));
1207 output_section_statement_table_free ();
1210 /*----------------------------------------------------------------------
1211 A region is an area of memory declared with the
1212 MEMORY { name:org=exp, len=exp ... }
1215 We maintain a list of all the regions here.
1217 If no regions are specified in the script, then the default is used
1218 which is created when looked up to be the entire data space.
1220 If create is true we are creating a region inside a MEMORY block.
1221 In this case it is probably an error to create a region that has
1222 already been created. If we are not inside a MEMORY block it is
1223 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1224 and so we issue a warning.
1226 Each region has at least one name. The first name is either
1227 DEFAULT_MEMORY_REGION or the name given in the MEMORY block. You can add
1228 alias names to an existing region within a script with
1229 REGION_ALIAS (alias, region_name). Each name corresponds to at most one
1232 static lang_memory_region_type
*lang_memory_region_list
;
1233 static lang_memory_region_type
**lang_memory_region_list_tail
1234 = &lang_memory_region_list
;
1236 lang_memory_region_type
*
1237 lang_memory_region_lookup (const char *const name
, bfd_boolean create
)
1239 lang_memory_region_name
*n
;
1240 lang_memory_region_type
*r
;
1241 lang_memory_region_type
*new_region
;
1243 /* NAME is NULL for LMA memspecs if no region was specified. */
1247 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1248 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1249 if (strcmp (n
->name
, name
) == 0)
1252 einfo (_("%P:%S: warning: redeclaration of memory region `%s'\n"),
1257 if (!create
&& strcmp (name
, DEFAULT_MEMORY_REGION
))
1258 einfo (_("%P:%S: warning: memory region `%s' not declared\n"), name
);
1260 new_region
= (lang_memory_region_type
*)
1261 stat_alloc (sizeof (lang_memory_region_type
));
1263 new_region
->name_list
.name
= xstrdup (name
);
1264 new_region
->name_list
.next
= NULL
;
1265 new_region
->next
= NULL
;
1266 new_region
->origin
= 0;
1267 new_region
->length
= ~(bfd_size_type
) 0;
1268 new_region
->current
= 0;
1269 new_region
->last_os
= NULL
;
1270 new_region
->flags
= 0;
1271 new_region
->not_flags
= 0;
1272 new_region
->had_full_message
= FALSE
;
1274 *lang_memory_region_list_tail
= new_region
;
1275 lang_memory_region_list_tail
= &new_region
->next
;
1281 lang_memory_region_alias (const char * alias
, const char * region_name
)
1283 lang_memory_region_name
* n
;
1284 lang_memory_region_type
* r
;
1285 lang_memory_region_type
* region
;
1287 /* The default region must be unique. This ensures that it is not necessary
1288 to iterate through the name list if someone wants the check if a region is
1289 the default memory region. */
1290 if (strcmp (region_name
, DEFAULT_MEMORY_REGION
) == 0
1291 || strcmp (alias
, DEFAULT_MEMORY_REGION
) == 0)
1292 einfo (_("%F%P:%S: error: alias for default memory region\n"));
1294 /* Look for the target region and check if the alias is not already
1297 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1298 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1300 if (region
== NULL
&& strcmp (n
->name
, region_name
) == 0)
1302 if (strcmp (n
->name
, alias
) == 0)
1303 einfo (_("%F%P:%S: error: redefinition of memory region "
1308 /* Check if the target region exists. */
1310 einfo (_("%F%P:%S: error: memory region `%s' "
1311 "for alias `%s' does not exist\n"),
1315 /* Add alias to region name list. */
1316 n
= (lang_memory_region_name
*) stat_alloc (sizeof (lang_memory_region_name
));
1317 n
->name
= xstrdup (alias
);
1318 n
->next
= region
->name_list
.next
;
1319 region
->name_list
.next
= n
;
1322 static lang_memory_region_type
*
1323 lang_memory_default (asection
* section
)
1325 lang_memory_region_type
*p
;
1327 flagword sec_flags
= section
->flags
;
1329 /* Override SEC_DATA to mean a writable section. */
1330 if ((sec_flags
& (SEC_ALLOC
| SEC_READONLY
| SEC_CODE
)) == SEC_ALLOC
)
1331 sec_flags
|= SEC_DATA
;
1333 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1335 if ((p
->flags
& sec_flags
) != 0
1336 && (p
->not_flags
& sec_flags
) == 0)
1341 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
1344 /* Find or create an output_section_statement with the given NAME.
1345 If CONSTRAINT is non-zero match one with that constraint, otherwise
1346 match any non-negative constraint. If CREATE, always make a
1347 new output_section_statement for SPECIAL CONSTRAINT. */
1349 lang_output_section_statement_type
*
1350 lang_output_section_statement_lookup (const char *name
,
1354 struct out_section_hash_entry
*entry
;
1356 entry
= ((struct out_section_hash_entry
*)
1357 bfd_hash_lookup (&output_section_statement_table
, name
,
1362 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1366 if (entry
->s
.output_section_statement
.name
!= NULL
)
1368 /* We have a section of this name, but it might not have the correct
1370 struct out_section_hash_entry
*last_ent
;
1372 name
= entry
->s
.output_section_statement
.name
;
1373 if (create
&& constraint
== SPECIAL
)
1374 /* Not traversing to the end reverses the order of the second
1375 and subsequent SPECIAL sections in the hash table chain,
1376 but that shouldn't matter. */
1381 if (constraint
== entry
->s
.output_section_statement
.constraint
1383 && entry
->s
.output_section_statement
.constraint
>= 0))
1384 return &entry
->s
.output_section_statement
;
1386 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1388 while (entry
!= NULL
1389 && name
== entry
->s
.output_section_statement
.name
);
1395 = ((struct out_section_hash_entry
*)
1396 output_section_statement_newfunc (NULL
,
1397 &output_section_statement_table
,
1401 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1404 entry
->root
= last_ent
->root
;
1405 last_ent
->root
.next
= &entry
->root
;
1408 entry
->s
.output_section_statement
.name
= name
;
1409 entry
->s
.output_section_statement
.constraint
= constraint
;
1410 return &entry
->s
.output_section_statement
;
1413 /* Find the next output_section_statement with the same name as OS.
1414 If CONSTRAINT is non-zero, find one with that constraint otherwise
1415 match any non-negative constraint. */
1417 lang_output_section_statement_type
*
1418 next_matching_output_section_statement (lang_output_section_statement_type
*os
,
1421 /* All output_section_statements are actually part of a
1422 struct out_section_hash_entry. */
1423 struct out_section_hash_entry
*entry
= (struct out_section_hash_entry
*)
1425 - offsetof (struct out_section_hash_entry
, s
.output_section_statement
));
1426 const char *name
= os
->name
;
1428 ASSERT (name
== entry
->root
.string
);
1431 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1433 || name
!= entry
->s
.output_section_statement
.name
)
1436 while (constraint
!= entry
->s
.output_section_statement
.constraint
1438 || entry
->s
.output_section_statement
.constraint
< 0));
1440 return &entry
->s
.output_section_statement
;
1443 /* A variant of lang_output_section_find used by place_orphan.
1444 Returns the output statement that should precede a new output
1445 statement for SEC. If an exact match is found on certain flags,
1448 lang_output_section_statement_type
*
1449 lang_output_section_find_by_flags (const asection
*sec
,
1450 lang_output_section_statement_type
**exact
,
1451 lang_match_sec_type_func match_type
)
1453 lang_output_section_statement_type
*first
, *look
, *found
;
1456 /* We know the first statement on this list is *ABS*. May as well
1458 first
= &lang_output_section_statement
.head
->output_section_statement
;
1459 first
= first
->next
;
1461 /* First try for an exact match. */
1463 for (look
= first
; look
; look
= look
->next
)
1465 flags
= look
->flags
;
1466 if (look
->bfd_section
!= NULL
)
1468 flags
= look
->bfd_section
->flags
;
1469 if (match_type
&& !match_type (link_info
.output_bfd
,
1474 flags
^= sec
->flags
;
1475 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
| SEC_READONLY
1476 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1486 if ((sec
->flags
& SEC_CODE
) != 0
1487 && (sec
->flags
& SEC_ALLOC
) != 0)
1489 /* Try for a rw code section. */
1490 for (look
= first
; look
; look
= look
->next
)
1492 flags
= look
->flags
;
1493 if (look
->bfd_section
!= NULL
)
1495 flags
= look
->bfd_section
->flags
;
1496 if (match_type
&& !match_type (link_info
.output_bfd
,
1501 flags
^= sec
->flags
;
1502 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1503 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1507 else if ((sec
->flags
& (SEC_READONLY
| SEC_THREAD_LOCAL
)) != 0
1508 && (sec
->flags
& SEC_ALLOC
) != 0)
1510 /* .rodata can go after .text, .sdata2 after .rodata. */
1511 for (look
= first
; look
; look
= look
->next
)
1513 flags
= look
->flags
;
1514 if (look
->bfd_section
!= NULL
)
1516 flags
= look
->bfd_section
->flags
;
1517 if (match_type
&& !match_type (link_info
.output_bfd
,
1522 flags
^= sec
->flags
;
1523 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1525 && !(look
->flags
& (SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1529 else if ((sec
->flags
& SEC_SMALL_DATA
) != 0
1530 && (sec
->flags
& SEC_ALLOC
) != 0)
1532 /* .sdata goes after .data, .sbss after .sdata. */
1533 for (look
= first
; look
; look
= look
->next
)
1535 flags
= look
->flags
;
1536 if (look
->bfd_section
!= NULL
)
1538 flags
= look
->bfd_section
->flags
;
1539 if (match_type
&& !match_type (link_info
.output_bfd
,
1544 flags
^= sec
->flags
;
1545 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1546 | SEC_THREAD_LOCAL
))
1547 || ((look
->flags
& SEC_SMALL_DATA
)
1548 && !(sec
->flags
& SEC_HAS_CONTENTS
)))
1552 else if ((sec
->flags
& SEC_HAS_CONTENTS
) != 0
1553 && (sec
->flags
& SEC_ALLOC
) != 0)
1555 /* .data goes after .rodata. */
1556 for (look
= first
; look
; look
= look
->next
)
1558 flags
= look
->flags
;
1559 if (look
->bfd_section
!= NULL
)
1561 flags
= look
->bfd_section
->flags
;
1562 if (match_type
&& !match_type (link_info
.output_bfd
,
1567 flags
^= sec
->flags
;
1568 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1569 | SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1573 else if ((sec
->flags
& SEC_ALLOC
) != 0)
1575 /* .bss goes after any other alloc section. */
1576 for (look
= first
; look
; look
= look
->next
)
1578 flags
= look
->flags
;
1579 if (look
->bfd_section
!= NULL
)
1581 flags
= look
->bfd_section
->flags
;
1582 if (match_type
&& !match_type (link_info
.output_bfd
,
1587 flags
^= sec
->flags
;
1588 if (!(flags
& SEC_ALLOC
))
1594 /* non-alloc go last. */
1595 for (look
= first
; look
; look
= look
->next
)
1597 flags
= look
->flags
;
1598 if (look
->bfd_section
!= NULL
)
1599 flags
= look
->bfd_section
->flags
;
1600 flags
^= sec
->flags
;
1601 if (!(flags
& SEC_DEBUGGING
))
1607 if (found
|| !match_type
)
1610 return lang_output_section_find_by_flags (sec
, NULL
, NULL
);
1613 /* Find the last output section before given output statement.
1614 Used by place_orphan. */
1617 output_prev_sec_find (lang_output_section_statement_type
*os
)
1619 lang_output_section_statement_type
*lookup
;
1621 for (lookup
= os
->prev
; lookup
!= NULL
; lookup
= lookup
->prev
)
1623 if (lookup
->constraint
< 0)
1626 if (lookup
->bfd_section
!= NULL
&& lookup
->bfd_section
->owner
!= NULL
)
1627 return lookup
->bfd_section
;
1633 /* Look for a suitable place for a new output section statement. The
1634 idea is to skip over anything that might be inside a SECTIONS {}
1635 statement in a script, before we find another output section
1636 statement. Assignments to "dot" before an output section statement
1637 are assumed to belong to it, except in two cases; The first
1638 assignment to dot, and assignments before non-alloc sections.
1639 Otherwise we might put an orphan before . = . + SIZEOF_HEADERS or
1640 similar assignments that set the initial address, or we might
1641 insert non-alloc note sections among assignments setting end of
1644 static lang_statement_union_type
**
1645 insert_os_after (lang_output_section_statement_type
*after
)
1647 lang_statement_union_type
**where
;
1648 lang_statement_union_type
**assign
= NULL
;
1649 bfd_boolean ignore_first
;
1652 = after
== &lang_output_section_statement
.head
->output_section_statement
;
1654 for (where
= &after
->header
.next
;
1656 where
= &(*where
)->header
.next
)
1658 switch ((*where
)->header
.type
)
1660 case lang_assignment_statement_enum
:
1663 lang_assignment_statement_type
*ass
;
1665 ass
= &(*where
)->assignment_statement
;
1666 if (ass
->exp
->type
.node_class
!= etree_assert
1667 && ass
->exp
->assign
.dst
[0] == '.'
1668 && ass
->exp
->assign
.dst
[1] == 0
1672 ignore_first
= FALSE
;
1674 case lang_wild_statement_enum
:
1675 case lang_input_section_enum
:
1676 case lang_object_symbols_statement_enum
:
1677 case lang_fill_statement_enum
:
1678 case lang_data_statement_enum
:
1679 case lang_reloc_statement_enum
:
1680 case lang_padding_statement_enum
:
1681 case lang_constructors_statement_enum
:
1684 case lang_output_section_statement_enum
:
1687 asection
*s
= (*where
)->output_section_statement
.bfd_section
;
1690 || s
->map_head
.s
== NULL
1691 || (s
->flags
& SEC_ALLOC
) != 0)
1695 case lang_input_statement_enum
:
1696 case lang_address_statement_enum
:
1697 case lang_target_statement_enum
:
1698 case lang_output_statement_enum
:
1699 case lang_group_statement_enum
:
1700 case lang_insert_statement_enum
:
1709 lang_output_section_statement_type
*
1710 lang_insert_orphan (asection
*s
,
1711 const char *secname
,
1713 lang_output_section_statement_type
*after
,
1714 struct orphan_save
*place
,
1715 etree_type
*address
,
1716 lang_statement_list_type
*add_child
)
1718 lang_statement_list_type add
;
1720 lang_output_section_statement_type
*os
;
1721 lang_output_section_statement_type
**os_tail
;
1723 /* If we have found an appropriate place for the output section
1724 statements for this orphan, add them to our own private list,
1725 inserting them later into the global statement list. */
1728 lang_list_init (&add
);
1729 push_stat_ptr (&add
);
1732 if (link_info
.relocatable
|| (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0)
1733 address
= exp_intop (0);
1735 os_tail
= ((lang_output_section_statement_type
**)
1736 lang_output_section_statement
.tail
);
1737 os
= lang_enter_output_section_statement (secname
, address
, normal_section
,
1738 NULL
, NULL
, NULL
, constraint
);
1741 if (config
.build_constructors
&& *os_tail
== os
)
1743 /* If the name of the section is representable in C, then create
1744 symbols to mark the start and the end of the section. */
1745 for (ps
= secname
; *ps
!= '\0'; ps
++)
1746 if (! ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
1751 etree_type
*e_align
;
1753 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__start_" + 1);
1754 symname
[0] = bfd_get_symbol_leading_char (link_info
.output_bfd
);
1755 sprintf (symname
+ (symname
[0] != 0), "__start_%s", secname
);
1756 e_align
= exp_unop (ALIGN_K
,
1757 exp_intop ((bfd_vma
) 1 << s
->alignment_power
));
1758 lang_add_assignment (exp_assop ('=', ".", e_align
));
1759 lang_add_assignment (exp_provide (symname
,
1761 exp_nameop (NAME
, ".")),
1766 if (add_child
== NULL
)
1767 add_child
= &os
->children
;
1768 lang_add_section (add_child
, s
, os
);
1770 if (after
&& (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) != 0)
1772 const char *region
= (after
->region
1773 ? after
->region
->name_list
.name
1774 : DEFAULT_MEMORY_REGION
);
1775 const char *lma_region
= (after
->lma_region
1776 ? after
->lma_region
->name_list
.name
1778 lang_leave_output_section_statement (NULL
, region
, after
->phdrs
,
1782 lang_leave_output_section_statement (NULL
, DEFAULT_MEMORY_REGION
, NULL
,
1785 if (ps
!= NULL
&& *ps
== '\0')
1789 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__stop_" + 1);
1790 symname
[0] = bfd_get_symbol_leading_char (link_info
.output_bfd
);
1791 sprintf (symname
+ (symname
[0] != 0), "__stop_%s", secname
);
1792 lang_add_assignment (exp_provide (symname
,
1793 exp_nameop (NAME
, "."),
1797 /* Restore the global list pointer. */
1801 if (after
!= NULL
&& os
->bfd_section
!= NULL
)
1803 asection
*snew
, *as
;
1805 snew
= os
->bfd_section
;
1807 /* Shuffle the bfd section list to make the output file look
1808 neater. This is really only cosmetic. */
1809 if (place
->section
== NULL
1810 && after
!= (&lang_output_section_statement
.head
1811 ->output_section_statement
))
1813 asection
*bfd_section
= after
->bfd_section
;
1815 /* If the output statement hasn't been used to place any input
1816 sections (and thus doesn't have an output bfd_section),
1817 look for the closest prior output statement having an
1819 if (bfd_section
== NULL
)
1820 bfd_section
= output_prev_sec_find (after
);
1822 if (bfd_section
!= NULL
&& bfd_section
!= snew
)
1823 place
->section
= &bfd_section
->next
;
1826 if (place
->section
== NULL
)
1827 place
->section
= &link_info
.output_bfd
->sections
;
1829 as
= *place
->section
;
1833 /* Put the section at the end of the list. */
1835 /* Unlink the section. */
1836 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1838 /* Now tack it back on in the right place. */
1839 bfd_section_list_append (link_info
.output_bfd
, snew
);
1841 else if (as
!= snew
&& as
->prev
!= snew
)
1843 /* Unlink the section. */
1844 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1846 /* Now tack it back on in the right place. */
1847 bfd_section_list_insert_before (link_info
.output_bfd
, as
, snew
);
1850 /* Save the end of this list. Further ophans of this type will
1851 follow the one we've just added. */
1852 place
->section
= &snew
->next
;
1854 /* The following is non-cosmetic. We try to put the output
1855 statements in some sort of reasonable order here, because they
1856 determine the final load addresses of the orphan sections.
1857 In addition, placing output statements in the wrong order may
1858 require extra segments. For instance, given a typical
1859 situation of all read-only sections placed in one segment and
1860 following that a segment containing all the read-write
1861 sections, we wouldn't want to place an orphan read/write
1862 section before or amongst the read-only ones. */
1863 if (add
.head
!= NULL
)
1865 lang_output_section_statement_type
*newly_added_os
;
1867 if (place
->stmt
== NULL
)
1869 lang_statement_union_type
**where
= insert_os_after (after
);
1874 place
->os_tail
= &after
->next
;
1878 /* Put it after the last orphan statement we added. */
1879 *add
.tail
= *place
->stmt
;
1880 *place
->stmt
= add
.head
;
1883 /* Fix the global list pointer if we happened to tack our
1884 new list at the tail. */
1885 if (*stat_ptr
->tail
== add
.head
)
1886 stat_ptr
->tail
= add
.tail
;
1888 /* Save the end of this list. */
1889 place
->stmt
= add
.tail
;
1891 /* Do the same for the list of output section statements. */
1892 newly_added_os
= *os_tail
;
1894 newly_added_os
->prev
= (lang_output_section_statement_type
*)
1895 ((char *) place
->os_tail
1896 - offsetof (lang_output_section_statement_type
, next
));
1897 newly_added_os
->next
= *place
->os_tail
;
1898 if (newly_added_os
->next
!= NULL
)
1899 newly_added_os
->next
->prev
= newly_added_os
;
1900 *place
->os_tail
= newly_added_os
;
1901 place
->os_tail
= &newly_added_os
->next
;
1903 /* Fixing the global list pointer here is a little different.
1904 We added to the list in lang_enter_output_section_statement,
1905 trimmed off the new output_section_statment above when
1906 assigning *os_tail = NULL, but possibly added it back in
1907 the same place when assigning *place->os_tail. */
1908 if (*os_tail
== NULL
)
1909 lang_output_section_statement
.tail
1910 = (lang_statement_union_type
**) os_tail
;
1917 lang_map_flags (flagword flag
)
1919 if (flag
& SEC_ALLOC
)
1922 if (flag
& SEC_CODE
)
1925 if (flag
& SEC_READONLY
)
1928 if (flag
& SEC_DATA
)
1931 if (flag
& SEC_LOAD
)
1938 lang_memory_region_type
*m
;
1939 bfd_boolean dis_header_printed
= FALSE
;
1942 LANG_FOR_EACH_INPUT_STATEMENT (file
)
1946 if ((file
->the_bfd
->flags
& (BFD_LINKER_CREATED
| DYNAMIC
)) != 0
1947 || file
->just_syms_flag
)
1950 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
1951 if ((s
->output_section
== NULL
1952 || s
->output_section
->owner
!= link_info
.output_bfd
)
1953 && (s
->flags
& (SEC_LINKER_CREATED
| SEC_KEEP
)) == 0)
1955 if (! dis_header_printed
)
1957 fprintf (config
.map_file
, _("\nDiscarded input sections\n\n"));
1958 dis_header_printed
= TRUE
;
1961 print_input_section (s
, TRUE
);
1965 minfo (_("\nMemory Configuration\n\n"));
1966 fprintf (config
.map_file
, "%-16s %-18s %-18s %s\n",
1967 _("Name"), _("Origin"), _("Length"), _("Attributes"));
1969 for (m
= lang_memory_region_list
; m
!= NULL
; m
= m
->next
)
1974 fprintf (config
.map_file
, "%-16s ", m
->name_list
.name
);
1976 sprintf_vma (buf
, m
->origin
);
1977 minfo ("0x%s ", buf
);
1985 minfo ("0x%V", m
->length
);
1986 if (m
->flags
|| m
->not_flags
)
1994 lang_map_flags (m
->flags
);
2000 lang_map_flags (m
->not_flags
);
2007 fprintf (config
.map_file
, _("\nLinker script and memory map\n\n"));
2009 if (! link_info
.reduce_memory_overheads
)
2011 obstack_begin (&map_obstack
, 1000);
2012 for (p
= link_info
.input_bfds
; p
!= (bfd
*) NULL
; p
= p
->link_next
)
2013 bfd_map_over_sections (p
, init_map_userdata
, 0);
2014 bfd_link_hash_traverse (link_info
.hash
, sort_def_symbol
, 0);
2016 lang_statement_iteration
++;
2017 print_statements ();
2021 init_map_userdata (bfd
*abfd ATTRIBUTE_UNUSED
,
2023 void *data ATTRIBUTE_UNUSED
)
2025 fat_section_userdata_type
*new_data
2026 = ((fat_section_userdata_type
*) (stat_alloc
2027 (sizeof (fat_section_userdata_type
))));
2029 ASSERT (get_userdata (sec
) == NULL
);
2030 get_userdata (sec
) = new_data
;
2031 new_data
->map_symbol_def_tail
= &new_data
->map_symbol_def_head
;
2032 new_data
->map_symbol_def_count
= 0;
2036 sort_def_symbol (struct bfd_link_hash_entry
*hash_entry
,
2037 void *info ATTRIBUTE_UNUSED
)
2039 if (hash_entry
->type
== bfd_link_hash_defined
2040 || hash_entry
->type
== bfd_link_hash_defweak
)
2042 struct fat_user_section_struct
*ud
;
2043 struct map_symbol_def
*def
;
2045 ud
= (struct fat_user_section_struct
*)
2046 get_userdata (hash_entry
->u
.def
.section
);
2049 /* ??? What do we have to do to initialize this beforehand? */
2050 /* The first time we get here is bfd_abs_section... */
2051 init_map_userdata (0, hash_entry
->u
.def
.section
, 0);
2052 ud
= (struct fat_user_section_struct
*)
2053 get_userdata (hash_entry
->u
.def
.section
);
2055 else if (!ud
->map_symbol_def_tail
)
2056 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
2058 def
= (struct map_symbol_def
*) obstack_alloc (&map_obstack
, sizeof *def
);
2059 def
->entry
= hash_entry
;
2060 *(ud
->map_symbol_def_tail
) = def
;
2061 ud
->map_symbol_def_tail
= &def
->next
;
2062 ud
->map_symbol_def_count
++;
2067 /* Initialize an output section. */
2070 init_os (lang_output_section_statement_type
*s
, flagword flags
)
2072 if (strcmp (s
->name
, DISCARD_SECTION_NAME
) == 0)
2073 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME
);
2075 if (s
->constraint
!= SPECIAL
)
2076 s
->bfd_section
= bfd_get_section_by_name (link_info
.output_bfd
, s
->name
);
2077 if (s
->bfd_section
== NULL
)
2078 s
->bfd_section
= bfd_make_section_anyway_with_flags (link_info
.output_bfd
,
2080 if (s
->bfd_section
== NULL
)
2082 einfo (_("%P%F: output format %s cannot represent section called %s\n"),
2083 link_info
.output_bfd
->xvec
->name
, s
->name
);
2085 s
->bfd_section
->output_section
= s
->bfd_section
;
2086 s
->bfd_section
->output_offset
= 0;
2088 if (!link_info
.reduce_memory_overheads
)
2090 fat_section_userdata_type
*new_userdata
= (fat_section_userdata_type
*)
2091 stat_alloc (sizeof (fat_section_userdata_type
));
2092 memset (new_userdata
, 0, sizeof (fat_section_userdata_type
));
2093 get_userdata (s
->bfd_section
) = new_userdata
;
2096 /* If there is a base address, make sure that any sections it might
2097 mention are initialized. */
2098 if (s
->addr_tree
!= NULL
)
2099 exp_init_os (s
->addr_tree
);
2101 if (s
->load_base
!= NULL
)
2102 exp_init_os (s
->load_base
);
2104 /* If supplied an alignment, set it. */
2105 if (s
->section_alignment
!= -1)
2106 s
->bfd_section
->alignment_power
= s
->section_alignment
;
2109 /* Make sure that all output sections mentioned in an expression are
2113 exp_init_os (etree_type
*exp
)
2115 switch (exp
->type
.node_class
)
2119 exp_init_os (exp
->assign
.src
);
2123 exp_init_os (exp
->binary
.lhs
);
2124 exp_init_os (exp
->binary
.rhs
);
2128 exp_init_os (exp
->trinary
.cond
);
2129 exp_init_os (exp
->trinary
.lhs
);
2130 exp_init_os (exp
->trinary
.rhs
);
2134 exp_init_os (exp
->assert_s
.child
);
2138 exp_init_os (exp
->unary
.child
);
2142 switch (exp
->type
.node_code
)
2148 lang_output_section_statement_type
*os
;
2150 os
= lang_output_section_find (exp
->name
.name
);
2151 if (os
!= NULL
&& os
->bfd_section
== NULL
)
2163 section_already_linked (bfd
*abfd
, asection
*sec
, void *data
)
2165 lang_input_statement_type
*entry
= (lang_input_statement_type
*) data
;
2167 /* If we are only reading symbols from this object, then we want to
2168 discard all sections. */
2169 if (entry
->just_syms_flag
)
2171 bfd_link_just_syms (abfd
, sec
, &link_info
);
2175 if (!(abfd
->flags
& DYNAMIC
))
2176 bfd_section_already_linked (abfd
, sec
, &link_info
);
2179 /* The wild routines.
2181 These expand statements like *(.text) and foo.o to a list of
2182 explicit actions, like foo.o(.text), bar.o(.text) and
2183 foo.o(.text, .data). */
2185 /* Add SECTION to the output section OUTPUT. Do this by creating a
2186 lang_input_section statement which is placed at PTR. FILE is the
2187 input file which holds SECTION. */
2190 lang_add_section (lang_statement_list_type
*ptr
,
2192 lang_output_section_statement_type
*output
)
2194 flagword flags
= section
->flags
;
2195 bfd_boolean discard
;
2196 lang_input_section_type
*new_section
;
2198 /* Discard sections marked with SEC_EXCLUDE. */
2199 discard
= (flags
& SEC_EXCLUDE
) != 0;
2201 /* Discard input sections which are assigned to a section named
2202 DISCARD_SECTION_NAME. */
2203 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
2206 /* Discard debugging sections if we are stripping debugging
2208 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
2209 && (flags
& SEC_DEBUGGING
) != 0)
2214 if (section
->output_section
== NULL
)
2216 /* This prevents future calls from assigning this section. */
2217 section
->output_section
= bfd_abs_section_ptr
;
2222 if (section
->output_section
!= NULL
)
2225 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2226 to an output section, because we want to be able to include a
2227 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2228 section (I don't know why we want to do this, but we do).
2229 build_link_order in ldwrite.c handles this case by turning
2230 the embedded SEC_NEVER_LOAD section into a fill. */
2231 flags
&= ~ SEC_NEVER_LOAD
;
2233 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2234 already been processed. One reason to do this is that on pe
2235 format targets, .text$foo sections go into .text and it's odd
2236 to see .text with SEC_LINK_ONCE set. */
2238 if (!link_info
.relocatable
)
2239 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2241 switch (output
->sectype
)
2243 case normal_section
:
2244 case overlay_section
:
2246 case noalloc_section
:
2247 flags
&= ~SEC_ALLOC
;
2249 case noload_section
:
2251 flags
|= SEC_NEVER_LOAD
;
2252 if (((bfd_get_flavour (section
->owner
)
2253 == bfd_target_ecoff_flavour
)
2254 || (bfd_get_flavour (section
->owner
)
2255 == bfd_target_coff_flavour
)))
2257 if ((flags
& (SEC_COFF_SHARED_LIBRARY
| SEC_DEBUGGING
)) == 0)
2258 flags
&= ~SEC_HAS_CONTENTS
;
2261 flags
&= ~SEC_HAS_CONTENTS
;
2265 if (output
->bfd_section
== NULL
)
2266 init_os (output
, flags
);
2268 /* If SEC_READONLY is not set in the input section, then clear
2269 it from the output section. */
2270 output
->bfd_section
->flags
&= flags
| ~SEC_READONLY
;
2272 if (output
->bfd_section
->linker_has_input
)
2274 /* Only set SEC_READONLY flag on the first input section. */
2275 flags
&= ~ SEC_READONLY
;
2277 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2278 if ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
2279 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
2280 || ((flags
& SEC_MERGE
) != 0
2281 && output
->bfd_section
->entsize
!= section
->entsize
))
2283 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2284 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2287 output
->bfd_section
->flags
|= flags
;
2289 if (!output
->bfd_section
->linker_has_input
)
2291 output
->bfd_section
->linker_has_input
= 1;
2292 /* This must happen after flags have been updated. The output
2293 section may have been created before we saw its first input
2294 section, eg. for a data statement. */
2295 bfd_init_private_section_data (section
->owner
, section
,
2296 link_info
.output_bfd
,
2297 output
->bfd_section
,
2299 if ((flags
& SEC_MERGE
) != 0)
2300 output
->bfd_section
->entsize
= section
->entsize
;
2303 if ((flags
& SEC_TIC54X_BLOCK
) != 0
2304 && bfd_get_arch (section
->owner
) == bfd_arch_tic54x
)
2306 /* FIXME: This value should really be obtained from the bfd... */
2307 output
->block_value
= 128;
2310 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
2311 output
->bfd_section
->alignment_power
= section
->alignment_power
;
2313 section
->output_section
= output
->bfd_section
;
2315 if (!link_info
.relocatable
2316 && !stripped_excluded_sections
)
2318 asection
*s
= output
->bfd_section
->map_tail
.s
;
2319 output
->bfd_section
->map_tail
.s
= section
;
2320 section
->map_head
.s
= NULL
;
2321 section
->map_tail
.s
= s
;
2323 s
->map_head
.s
= section
;
2325 output
->bfd_section
->map_head
.s
= section
;
2328 /* Add a section reference to the list. */
2329 new_section
= new_stat (lang_input_section
, ptr
);
2330 new_section
->section
= section
;
2333 /* Handle wildcard sorting. This returns the lang_input_section which
2334 should follow the one we are going to create for SECTION and FILE,
2335 based on the sorting requirements of WILD. It returns NULL if the
2336 new section should just go at the end of the current list. */
2338 static lang_statement_union_type
*
2339 wild_sort (lang_wild_statement_type
*wild
,
2340 struct wildcard_list
*sec
,
2341 lang_input_statement_type
*file
,
2344 lang_statement_union_type
*l
;
2346 if (!wild
->filenames_sorted
2347 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2350 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2352 lang_input_section_type
*ls
;
2354 if (l
->header
.type
!= lang_input_section_enum
)
2356 ls
= &l
->input_section
;
2358 /* Sorting by filename takes precedence over sorting by section
2361 if (wild
->filenames_sorted
)
2363 const char *fn
, *ln
;
2367 /* The PE support for the .idata section as generated by
2368 dlltool assumes that files will be sorted by the name of
2369 the archive and then the name of the file within the
2372 if (file
->the_bfd
!= NULL
2373 && bfd_my_archive (file
->the_bfd
) != NULL
)
2375 fn
= bfd_get_filename (bfd_my_archive (file
->the_bfd
));
2380 fn
= file
->filename
;
2384 if (bfd_my_archive (ls
->section
->owner
) != NULL
)
2386 ln
= bfd_get_filename (bfd_my_archive (ls
->section
->owner
));
2391 ln
= ls
->section
->owner
->filename
;
2395 i
= strcmp (fn
, ln
);
2404 fn
= file
->filename
;
2406 ln
= ls
->section
->owner
->filename
;
2408 i
= strcmp (fn
, ln
);
2416 /* Here either the files are not sorted by name, or we are
2417 looking at the sections for this file. */
2419 if (sec
!= NULL
&& sec
->spec
.sorted
!= none
)
2420 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2427 /* Expand a wild statement for a particular FILE. SECTION may be
2428 NULL, in which case it is a wild card. */
2431 output_section_callback (lang_wild_statement_type
*ptr
,
2432 struct wildcard_list
*sec
,
2434 lang_input_statement_type
*file
,
2437 lang_statement_union_type
*before
;
2438 lang_output_section_statement_type
*os
;
2440 os
= (lang_output_section_statement_type
*) output
;
2442 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2443 if (unique_section_p (section
, os
))
2446 before
= wild_sort (ptr
, sec
, file
, section
);
2448 /* Here BEFORE points to the lang_input_section which
2449 should follow the one we are about to add. If BEFORE
2450 is NULL, then the section should just go at the end
2451 of the current list. */
2454 lang_add_section (&ptr
->children
, section
, os
);
2457 lang_statement_list_type list
;
2458 lang_statement_union_type
**pp
;
2460 lang_list_init (&list
);
2461 lang_add_section (&list
, section
, os
);
2463 /* If we are discarding the section, LIST.HEAD will
2465 if (list
.head
!= NULL
)
2467 ASSERT (list
.head
->header
.next
== NULL
);
2469 for (pp
= &ptr
->children
.head
;
2471 pp
= &(*pp
)->header
.next
)
2472 ASSERT (*pp
!= NULL
);
2474 list
.head
->header
.next
= *pp
;
2480 /* Check if all sections in a wild statement for a particular FILE
2484 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2485 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2487 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2490 lang_output_section_statement_type
*os
;
2492 os
= (lang_output_section_statement_type
*) output
;
2494 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2495 if (unique_section_p (section
, os
))
2498 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2499 os
->all_input_readonly
= FALSE
;
2502 /* This is passed a file name which must have been seen already and
2503 added to the statement tree. We will see if it has been opened
2504 already and had its symbols read. If not then we'll read it. */
2506 static lang_input_statement_type
*
2507 lookup_name (const char *name
)
2509 lang_input_statement_type
*search
;
2511 for (search
= (lang_input_statement_type
*) input_file_chain
.head
;
2513 search
= (lang_input_statement_type
*) search
->next_real_file
)
2515 /* Use the local_sym_name as the name of the file that has
2516 already been loaded as filename might have been transformed
2517 via the search directory lookup mechanism. */
2518 const char *filename
= search
->local_sym_name
;
2520 if (filename
!= NULL
2521 && strcmp (filename
, name
) == 0)
2526 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2527 default_target
, FALSE
);
2529 /* If we have already added this file, or this file is not real
2530 don't add this file. */
2531 if (search
->loaded
|| !search
->real
)
2534 if (! load_symbols (search
, NULL
))
2540 /* Save LIST as a list of libraries whose symbols should not be exported. */
2545 struct excluded_lib
*next
;
2547 static struct excluded_lib
*excluded_libs
;
2550 add_excluded_libs (const char *list
)
2552 const char *p
= list
, *end
;
2556 struct excluded_lib
*entry
;
2557 end
= strpbrk (p
, ",:");
2559 end
= p
+ strlen (p
);
2560 entry
= (struct excluded_lib
*) xmalloc (sizeof (*entry
));
2561 entry
->next
= excluded_libs
;
2562 entry
->name
= (char *) xmalloc (end
- p
+ 1);
2563 memcpy (entry
->name
, p
, end
- p
);
2564 entry
->name
[end
- p
] = '\0';
2565 excluded_libs
= entry
;
2573 check_excluded_libs (bfd
*abfd
)
2575 struct excluded_lib
*lib
= excluded_libs
;
2579 int len
= strlen (lib
->name
);
2580 const char *filename
= lbasename (abfd
->filename
);
2582 if (strcmp (lib
->name
, "ALL") == 0)
2584 abfd
->no_export
= TRUE
;
2588 if (strncmp (lib
->name
, filename
, len
) == 0
2589 && (filename
[len
] == '\0'
2590 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
2591 && filename
[len
+ 2] == '\0')))
2593 abfd
->no_export
= TRUE
;
2601 /* Get the symbols for an input file. */
2604 load_symbols (lang_input_statement_type
*entry
,
2605 lang_statement_list_type
*place
)
2612 ldfile_open_file (entry
);
2614 /* Do not process further if the file was missing. */
2615 if (entry
->missing_file
)
2618 if (! bfd_check_format (entry
->the_bfd
, bfd_archive
)
2619 && ! bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
2622 bfd_boolean save_ldlang_sysrooted_script
;
2623 bfd_boolean save_add_DT_NEEDED_for_regular
;
2624 bfd_boolean save_add_DT_NEEDED_for_dynamic
;
2625 bfd_boolean save_whole_archive
;
2627 err
= bfd_get_error ();
2629 /* See if the emulation has some special knowledge. */
2630 if (ldemul_unrecognized_file (entry
))
2633 if (err
== bfd_error_file_ambiguously_recognized
)
2637 einfo (_("%B: file not recognized: %E\n"), entry
->the_bfd
);
2638 einfo (_("%B: matching formats:"), entry
->the_bfd
);
2639 for (p
= matching
; *p
!= NULL
; p
++)
2643 else if (err
!= bfd_error_file_not_recognized
2645 einfo (_("%F%B: file not recognized: %E\n"), entry
->the_bfd
);
2647 bfd_close (entry
->the_bfd
);
2648 entry
->the_bfd
= NULL
;
2650 /* Try to interpret the file as a linker script. */
2651 ldfile_open_command_file (entry
->filename
);
2653 push_stat_ptr (place
);
2654 save_ldlang_sysrooted_script
= ldlang_sysrooted_script
;
2655 ldlang_sysrooted_script
= entry
->sysrooted
;
2656 save_add_DT_NEEDED_for_regular
= add_DT_NEEDED_for_regular
;
2657 add_DT_NEEDED_for_regular
= entry
->add_DT_NEEDED_for_regular
;
2658 save_add_DT_NEEDED_for_dynamic
= add_DT_NEEDED_for_dynamic
;
2659 add_DT_NEEDED_for_dynamic
= entry
->add_DT_NEEDED_for_dynamic
;
2660 save_whole_archive
= whole_archive
;
2661 whole_archive
= entry
->whole_archive
;
2663 ldfile_assumed_script
= TRUE
;
2664 parser_input
= input_script
;
2665 /* We want to use the same -Bdynamic/-Bstatic as the one for
2667 config
.dynamic_link
= entry
->dynamic
;
2669 ldfile_assumed_script
= FALSE
;
2671 ldlang_sysrooted_script
= save_ldlang_sysrooted_script
;
2672 add_DT_NEEDED_for_regular
= save_add_DT_NEEDED_for_regular
;
2673 add_DT_NEEDED_for_dynamic
= save_add_DT_NEEDED_for_dynamic
;
2674 whole_archive
= save_whole_archive
;
2680 if (ldemul_recognized_file (entry
))
2683 /* We don't call ldlang_add_file for an archive. Instead, the
2684 add_symbols entry point will call ldlang_add_file, via the
2685 add_archive_element callback, for each element of the archive
2687 switch (bfd_get_format (entry
->the_bfd
))
2693 ldlang_add_file (entry
);
2694 if (trace_files
|| trace_file_tries
)
2695 info_msg ("%I\n", entry
);
2699 check_excluded_libs (entry
->the_bfd
);
2701 if (entry
->whole_archive
)
2704 bfd_boolean loaded
= TRUE
;
2709 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
2714 if (! bfd_check_format (member
, bfd_object
))
2716 einfo (_("%F%B: member %B in archive is not an object\n"),
2717 entry
->the_bfd
, member
);
2722 if (! ((*link_info
.callbacks
->add_archive_element
)
2723 (&link_info
, member
, "--whole-archive", &subsbfd
)))
2726 /* Potentially, the add_archive_element hook may have set a
2727 substitute BFD for us. */
2728 if (! bfd_link_add_symbols (subsbfd
? subsbfd
: member
,
2731 einfo (_("%F%B: could not read symbols: %E\n"), member
);
2736 entry
->loaded
= loaded
;
2742 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
2743 entry
->loaded
= TRUE
;
2745 einfo (_("%F%B: could not read symbols: %E\n"), entry
->the_bfd
);
2747 return entry
->loaded
;
2750 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2751 may be NULL, indicating that it is a wildcard. Separate
2752 lang_input_section statements are created for each part of the
2753 expansion; they are added after the wild statement S. OUTPUT is
2754 the output section. */
2757 wild (lang_wild_statement_type
*s
,
2758 const char *target ATTRIBUTE_UNUSED
,
2759 lang_output_section_statement_type
*output
)
2761 struct wildcard_list
*sec
;
2763 if (s
->handler_data
[0]
2764 && s
->handler_data
[0]->spec
.sorted
== by_name
2765 && !s
->filenames_sorted
)
2767 lang_section_bst_type
*tree
;
2769 walk_wild (s
, output_section_callback_fast
, output
);
2774 output_section_callback_tree_to_list (s
, tree
, output
);
2779 walk_wild (s
, output_section_callback
, output
);
2781 if (default_common_section
== NULL
)
2782 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
2783 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
2785 /* Remember the section that common is going to in case we
2786 later get something which doesn't know where to put it. */
2787 default_common_section
= output
;
2792 /* Return TRUE iff target is the sought target. */
2795 get_target (const bfd_target
*target
, void *data
)
2797 const char *sought
= (const char *) data
;
2799 return strcmp (target
->name
, sought
) == 0;
2802 /* Like strcpy() but convert to lower case as well. */
2805 stricpy (char *dest
, char *src
)
2809 while ((c
= *src
++) != 0)
2810 *dest
++ = TOLOWER (c
);
2815 /* Remove the first occurrence of needle (if any) in haystack
2819 strcut (char *haystack
, char *needle
)
2821 haystack
= strstr (haystack
, needle
);
2827 for (src
= haystack
+ strlen (needle
); *src
;)
2828 *haystack
++ = *src
++;
2834 /* Compare two target format name strings.
2835 Return a value indicating how "similar" they are. */
2838 name_compare (char *first
, char *second
)
2844 copy1
= (char *) xmalloc (strlen (first
) + 1);
2845 copy2
= (char *) xmalloc (strlen (second
) + 1);
2847 /* Convert the names to lower case. */
2848 stricpy (copy1
, first
);
2849 stricpy (copy2
, second
);
2851 /* Remove size and endian strings from the name. */
2852 strcut (copy1
, "big");
2853 strcut (copy1
, "little");
2854 strcut (copy2
, "big");
2855 strcut (copy2
, "little");
2857 /* Return a value based on how many characters match,
2858 starting from the beginning. If both strings are
2859 the same then return 10 * their length. */
2860 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
2861 if (copy1
[result
] == 0)
2873 /* Set by closest_target_match() below. */
2874 static const bfd_target
*winner
;
2876 /* Scan all the valid bfd targets looking for one that has the endianness
2877 requirement that was specified on the command line, and is the nearest
2878 match to the original output target. */
2881 closest_target_match (const bfd_target
*target
, void *data
)
2883 const bfd_target
*original
= (const bfd_target
*) data
;
2885 if (command_line
.endian
== ENDIAN_BIG
2886 && target
->byteorder
!= BFD_ENDIAN_BIG
)
2889 if (command_line
.endian
== ENDIAN_LITTLE
2890 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
2893 /* Must be the same flavour. */
2894 if (target
->flavour
!= original
->flavour
)
2897 /* Ignore generic big and little endian elf vectors. */
2898 if (strcmp (target
->name
, "elf32-big") == 0
2899 || strcmp (target
->name
, "elf64-big") == 0
2900 || strcmp (target
->name
, "elf32-little") == 0
2901 || strcmp (target
->name
, "elf64-little") == 0)
2904 /* If we have not found a potential winner yet, then record this one. */
2911 /* Oh dear, we now have two potential candidates for a successful match.
2912 Compare their names and choose the better one. */
2913 if (name_compare (target
->name
, original
->name
)
2914 > name_compare (winner
->name
, original
->name
))
2917 /* Keep on searching until wqe have checked them all. */
2921 /* Return the BFD target format of the first input file. */
2924 get_first_input_target (void)
2926 char *target
= NULL
;
2928 LANG_FOR_EACH_INPUT_STATEMENT (s
)
2930 if (s
->header
.type
== lang_input_statement_enum
2933 ldfile_open_file (s
);
2935 if (s
->the_bfd
!= NULL
2936 && bfd_check_format (s
->the_bfd
, bfd_object
))
2938 target
= bfd_get_target (s
->the_bfd
);
2950 lang_get_output_target (void)
2954 /* Has the user told us which output format to use? */
2955 if (output_target
!= NULL
)
2956 return output_target
;
2958 /* No - has the current target been set to something other than
2960 if (current_target
!= default_target
)
2961 return current_target
;
2963 /* No - can we determine the format of the first input file? */
2964 target
= get_first_input_target ();
2968 /* Failed - use the default output target. */
2969 return default_target
;
2972 /* Open the output file. */
2975 open_output (const char *name
)
2977 output_target
= lang_get_output_target ();
2979 /* Has the user requested a particular endianness on the command
2981 if (command_line
.endian
!= ENDIAN_UNSET
)
2983 const bfd_target
*target
;
2984 enum bfd_endian desired_endian
;
2986 /* Get the chosen target. */
2987 target
= bfd_search_for_target (get_target
, (void *) output_target
);
2989 /* If the target is not supported, we cannot do anything. */
2992 if (command_line
.endian
== ENDIAN_BIG
)
2993 desired_endian
= BFD_ENDIAN_BIG
;
2995 desired_endian
= BFD_ENDIAN_LITTLE
;
2997 /* See if the target has the wrong endianness. This should
2998 not happen if the linker script has provided big and
2999 little endian alternatives, but some scrips don't do
3001 if (target
->byteorder
!= desired_endian
)
3003 /* If it does, then see if the target provides
3004 an alternative with the correct endianness. */
3005 if (target
->alternative_target
!= NULL
3006 && (target
->alternative_target
->byteorder
== desired_endian
))
3007 output_target
= target
->alternative_target
->name
;
3010 /* Try to find a target as similar as possible to
3011 the default target, but which has the desired
3012 endian characteristic. */
3013 bfd_search_for_target (closest_target_match
,
3016 /* Oh dear - we could not find any targets that
3017 satisfy our requirements. */
3019 einfo (_("%P: warning: could not find any targets"
3020 " that match endianness requirement\n"));
3022 output_target
= winner
->name
;
3028 link_info
.output_bfd
= bfd_openw (name
, output_target
);
3030 if (link_info
.output_bfd
== NULL
)
3032 if (bfd_get_error () == bfd_error_invalid_target
)
3033 einfo (_("%P%F: target %s not found\n"), output_target
);
3035 einfo (_("%P%F: cannot open output file %s: %E\n"), name
);
3038 delete_output_file_on_failure
= TRUE
;
3040 if (! bfd_set_format (link_info
.output_bfd
, bfd_object
))
3041 einfo (_("%P%F:%s: can not make object file: %E\n"), name
);
3042 if (! bfd_set_arch_mach (link_info
.output_bfd
,
3043 ldfile_output_architecture
,
3044 ldfile_output_machine
))
3045 einfo (_("%P%F:%s: can not set architecture: %E\n"), name
);
3047 link_info
.hash
= bfd_link_hash_table_create (link_info
.output_bfd
);
3048 if (link_info
.hash
== NULL
)
3049 einfo (_("%P%F: can not create hash table: %E\n"));
3051 bfd_set_gp_size (link_info
.output_bfd
, g_switch_value
);
3055 ldlang_open_output (lang_statement_union_type
*statement
)
3057 switch (statement
->header
.type
)
3059 case lang_output_statement_enum
:
3060 ASSERT (link_info
.output_bfd
== NULL
);
3061 open_output (statement
->output_statement
.name
);
3062 ldemul_set_output_arch ();
3063 if (config
.magic_demand_paged
&& !link_info
.relocatable
)
3064 link_info
.output_bfd
->flags
|= D_PAGED
;
3066 link_info
.output_bfd
->flags
&= ~D_PAGED
;
3067 if (config
.text_read_only
)
3068 link_info
.output_bfd
->flags
|= WP_TEXT
;
3070 link_info
.output_bfd
->flags
&= ~WP_TEXT
;
3071 if (link_info
.traditional_format
)
3072 link_info
.output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
3074 link_info
.output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
3077 case lang_target_statement_enum
:
3078 current_target
= statement
->target_statement
.target
;
3085 /* Convert between addresses in bytes and sizes in octets.
3086 For currently supported targets, octets_per_byte is always a power
3087 of two, so we can use shifts. */
3088 #define TO_ADDR(X) ((X) >> opb_shift)
3089 #define TO_SIZE(X) ((X) << opb_shift)
3091 /* Support the above. */
3092 static unsigned int opb_shift
= 0;
3097 unsigned x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
3098 ldfile_output_machine
);
3101 while ((x
& 1) == 0)
3109 /* Open all the input files. */
3112 open_input_bfds (lang_statement_union_type
*s
, bfd_boolean force
)
3114 for (; s
!= NULL
; s
= s
->header
.next
)
3116 switch (s
->header
.type
)
3118 case lang_constructors_statement_enum
:
3119 open_input_bfds (constructor_list
.head
, force
);
3121 case lang_output_section_statement_enum
:
3122 open_input_bfds (s
->output_section_statement
.children
.head
, force
);
3124 case lang_wild_statement_enum
:
3125 /* Maybe we should load the file's symbols. */
3126 if (s
->wild_statement
.filename
3127 && !wildcardp (s
->wild_statement
.filename
)
3128 && !archive_path (s
->wild_statement
.filename
))
3129 lookup_name (s
->wild_statement
.filename
);
3130 open_input_bfds (s
->wild_statement
.children
.head
, force
);
3132 case lang_group_statement_enum
:
3134 struct bfd_link_hash_entry
*undefs
;
3136 /* We must continually search the entries in the group
3137 until no new symbols are added to the list of undefined
3142 undefs
= link_info
.hash
->undefs_tail
;
3143 open_input_bfds (s
->group_statement
.children
.head
, TRUE
);
3145 while (undefs
!= link_info
.hash
->undefs_tail
);
3148 case lang_target_statement_enum
:
3149 current_target
= s
->target_statement
.target
;
3151 case lang_input_statement_enum
:
3152 if (s
->input_statement
.real
)
3154 lang_statement_union_type
**os_tail
;
3155 lang_statement_list_type add
;
3157 s
->input_statement
.target
= current_target
;
3159 /* If we are being called from within a group, and this
3160 is an archive which has already been searched, then
3161 force it to be researched unless the whole archive
3162 has been loaded already. */
3164 && !s
->input_statement
.whole_archive
3165 && s
->input_statement
.loaded
3166 && bfd_check_format (s
->input_statement
.the_bfd
,
3168 s
->input_statement
.loaded
= FALSE
;
3170 os_tail
= lang_output_section_statement
.tail
;
3171 lang_list_init (&add
);
3173 if (! load_symbols (&s
->input_statement
, &add
))
3174 config
.make_executable
= FALSE
;
3176 if (add
.head
!= NULL
)
3178 /* If this was a script with output sections then
3179 tack any added statements on to the end of the
3180 list. This avoids having to reorder the output
3181 section statement list. Very likely the user
3182 forgot -T, and whatever we do here will not meet
3183 naive user expectations. */
3184 if (os_tail
!= lang_output_section_statement
.tail
)
3186 einfo (_("%P: warning: %s contains output sections;"
3187 " did you forget -T?\n"),
3188 s
->input_statement
.filename
);
3189 *stat_ptr
->tail
= add
.head
;
3190 stat_ptr
->tail
= add
.tail
;
3194 *add
.tail
= s
->header
.next
;
3195 s
->header
.next
= add
.head
;
3205 /* Exit if any of the files were missing. */
3210 /* Add a symbol to a hash of symbols used in DEFINED (NAME) expressions. */
3213 lang_track_definedness (const char *name
)
3215 if (bfd_hash_lookup (&lang_definedness_table
, name
, TRUE
, FALSE
) == NULL
)
3216 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name
);
3219 /* New-function for the definedness hash table. */
3221 static struct bfd_hash_entry
*
3222 lang_definedness_newfunc (struct bfd_hash_entry
*entry
,
3223 struct bfd_hash_table
*table ATTRIBUTE_UNUSED
,
3224 const char *name ATTRIBUTE_UNUSED
)
3226 struct lang_definedness_hash_entry
*ret
3227 = (struct lang_definedness_hash_entry
*) entry
;
3230 ret
= (struct lang_definedness_hash_entry
*)
3231 bfd_hash_allocate (table
, sizeof (struct lang_definedness_hash_entry
));
3234 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name
);
3236 ret
->iteration
= -1;
3240 /* Return the iteration when the definition of NAME was last updated. A
3241 value of -1 means that the symbol is not defined in the linker script
3242 or the command line, but may be defined in the linker symbol table. */
3245 lang_symbol_definition_iteration (const char *name
)
3247 struct lang_definedness_hash_entry
*defentry
3248 = (struct lang_definedness_hash_entry
*)
3249 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
3251 /* We've already created this one on the presence of DEFINED in the
3252 script, so it can't be NULL unless something is borked elsewhere in
3254 if (defentry
== NULL
)
3257 return defentry
->iteration
;
3260 /* Update the definedness state of NAME. */
3263 lang_update_definedness (const char *name
, struct bfd_link_hash_entry
*h
)
3265 struct lang_definedness_hash_entry
*defentry
3266 = (struct lang_definedness_hash_entry
*)
3267 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
3269 /* We don't keep track of symbols not tested with DEFINED. */
3270 if (defentry
== NULL
)
3273 /* If the symbol was already defined, and not from an earlier statement
3274 iteration, don't update the definedness iteration, because that'd
3275 make the symbol seem defined in the linker script at this point, and
3276 it wasn't; it was defined in some object. If we do anyway, DEFINED
3277 would start to yield false before this point and the construct "sym =
3278 DEFINED (sym) ? sym : X;" would change sym to X despite being defined
3280 if (h
->type
!= bfd_link_hash_undefined
3281 && h
->type
!= bfd_link_hash_common
3282 && h
->type
!= bfd_link_hash_new
3283 && defentry
->iteration
== -1)
3286 defentry
->iteration
= lang_statement_iteration
;
3289 /* Add the supplied name to the symbol table as an undefined reference.
3290 This is a two step process as the symbol table doesn't even exist at
3291 the time the ld command line is processed. First we put the name
3292 on a list, then, once the output file has been opened, transfer the
3293 name to the symbol table. */
3295 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
3297 #define ldlang_undef_chain_list_head entry_symbol.next
3300 ldlang_add_undef (const char *const name
)
3302 ldlang_undef_chain_list_type
*new_undef
= (ldlang_undef_chain_list_type
*)
3303 stat_alloc (sizeof (ldlang_undef_chain_list_type
));
3305 new_undef
->next
= ldlang_undef_chain_list_head
;
3306 ldlang_undef_chain_list_head
= new_undef
;
3308 new_undef
->name
= xstrdup (name
);
3310 if (link_info
.output_bfd
!= NULL
)
3311 insert_undefined (new_undef
->name
);
3314 /* Insert NAME as undefined in the symbol table. */
3317 insert_undefined (const char *name
)
3319 struct bfd_link_hash_entry
*h
;
3321 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
3323 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
3324 if (h
->type
== bfd_link_hash_new
)
3326 h
->type
= bfd_link_hash_undefined
;
3327 h
->u
.undef
.abfd
= NULL
;
3328 bfd_link_add_undef (link_info
.hash
, h
);
3332 /* Run through the list of undefineds created above and place them
3333 into the linker hash table as undefined symbols belonging to the
3337 lang_place_undefineds (void)
3339 ldlang_undef_chain_list_type
*ptr
;
3341 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
3342 insert_undefined (ptr
->name
);
3345 /* Check for all readonly or some readwrite sections. */
3348 check_input_sections
3349 (lang_statement_union_type
*s
,
3350 lang_output_section_statement_type
*output_section_statement
)
3352 for (; s
!= (lang_statement_union_type
*) NULL
; s
= s
->header
.next
)
3354 switch (s
->header
.type
)
3356 case lang_wild_statement_enum
:
3357 walk_wild (&s
->wild_statement
, check_section_callback
,
3358 output_section_statement
);
3359 if (! output_section_statement
->all_input_readonly
)
3362 case lang_constructors_statement_enum
:
3363 check_input_sections (constructor_list
.head
,
3364 output_section_statement
);
3365 if (! output_section_statement
->all_input_readonly
)
3368 case lang_group_statement_enum
:
3369 check_input_sections (s
->group_statement
.children
.head
,
3370 output_section_statement
);
3371 if (! output_section_statement
->all_input_readonly
)
3380 /* Update wildcard statements if needed. */
3383 update_wild_statements (lang_statement_union_type
*s
)
3385 struct wildcard_list
*sec
;
3387 switch (sort_section
)
3397 for (; s
!= NULL
; s
= s
->header
.next
)
3399 switch (s
->header
.type
)
3404 case lang_wild_statement_enum
:
3405 sec
= s
->wild_statement
.section_list
;
3406 for (sec
= s
->wild_statement
.section_list
; sec
!= NULL
;
3409 switch (sec
->spec
.sorted
)
3412 sec
->spec
.sorted
= sort_section
;
3415 if (sort_section
== by_alignment
)
3416 sec
->spec
.sorted
= by_name_alignment
;
3419 if (sort_section
== by_name
)
3420 sec
->spec
.sorted
= by_alignment_name
;
3428 case lang_constructors_statement_enum
:
3429 update_wild_statements (constructor_list
.head
);
3432 case lang_output_section_statement_enum
:
3433 update_wild_statements
3434 (s
->output_section_statement
.children
.head
);
3437 case lang_group_statement_enum
:
3438 update_wild_statements (s
->group_statement
.children
.head
);
3446 /* Open input files and attach to output sections. */
3449 map_input_to_output_sections
3450 (lang_statement_union_type
*s
, const char *target
,
3451 lang_output_section_statement_type
*os
)
3453 for (; s
!= NULL
; s
= s
->header
.next
)
3455 lang_output_section_statement_type
*tos
;
3458 switch (s
->header
.type
)
3460 case lang_wild_statement_enum
:
3461 wild (&s
->wild_statement
, target
, os
);
3463 case lang_constructors_statement_enum
:
3464 map_input_to_output_sections (constructor_list
.head
,
3468 case lang_output_section_statement_enum
:
3469 tos
= &s
->output_section_statement
;
3470 if (tos
->constraint
!= 0)
3472 if (tos
->constraint
!= ONLY_IF_RW
3473 && tos
->constraint
!= ONLY_IF_RO
)
3475 tos
->all_input_readonly
= TRUE
;
3476 check_input_sections (tos
->children
.head
, tos
);
3477 if (tos
->all_input_readonly
!= (tos
->constraint
== ONLY_IF_RO
))
3479 tos
->constraint
= -1;
3483 map_input_to_output_sections (tos
->children
.head
,
3487 case lang_output_statement_enum
:
3489 case lang_target_statement_enum
:
3490 target
= s
->target_statement
.target
;
3492 case lang_group_statement_enum
:
3493 map_input_to_output_sections (s
->group_statement
.children
.head
,
3497 case lang_data_statement_enum
:
3498 /* Make sure that any sections mentioned in the expression
3500 exp_init_os (s
->data_statement
.exp
);
3501 /* The output section gets CONTENTS, ALLOC and LOAD, but
3502 these may be overridden by the script. */
3503 flags
= SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
;
3504 switch (os
->sectype
)
3506 case normal_section
:
3507 case overlay_section
:
3509 case noalloc_section
:
3510 flags
= SEC_HAS_CONTENTS
;
3512 case noload_section
:
3513 flags
= SEC_NEVER_LOAD
;
3516 if (os
->bfd_section
== NULL
)
3517 init_os (os
, flags
);
3519 os
->bfd_section
->flags
|= flags
;
3521 case lang_input_section_enum
:
3523 case lang_fill_statement_enum
:
3524 case lang_object_symbols_statement_enum
:
3525 case lang_reloc_statement_enum
:
3526 case lang_padding_statement_enum
:
3527 case lang_input_statement_enum
:
3528 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3531 case lang_assignment_statement_enum
:
3532 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3535 /* Make sure that any sections mentioned in the assignment
3537 exp_init_os (s
->assignment_statement
.exp
);
3539 case lang_address_statement_enum
:
3540 /* Mark the specified section with the supplied address.
3541 If this section was actually a segment marker, then the
3542 directive is ignored if the linker script explicitly
3543 processed the segment marker. Originally, the linker
3544 treated segment directives (like -Ttext on the
3545 command-line) as section directives. We honor the
3546 section directive semantics for backwards compatibilty;
3547 linker scripts that do not specifically check for
3548 SEGMENT_START automatically get the old semantics. */
3549 if (!s
->address_statement
.segment
3550 || !s
->address_statement
.segment
->used
)
3552 const char *name
= s
->address_statement
.section_name
;
3554 /* Create the output section statement here so that
3555 orphans with a set address will be placed after other
3556 script sections. If we let the orphan placement code
3557 place them in amongst other sections then the address
3558 will affect following script sections, which is
3559 likely to surprise naive users. */
3560 tos
= lang_output_section_statement_lookup (name
, 0, TRUE
);
3561 tos
->addr_tree
= s
->address_statement
.address
;
3562 if (tos
->bfd_section
== NULL
)
3566 case lang_insert_statement_enum
:
3572 /* An insert statement snips out all the linker statements from the
3573 start of the list and places them after the output section
3574 statement specified by the insert. This operation is complicated
3575 by the fact that we keep a doubly linked list of output section
3576 statements as well as the singly linked list of all statements. */
3579 process_insert_statements (void)
3581 lang_statement_union_type
**s
;
3582 lang_output_section_statement_type
*first_os
= NULL
;
3583 lang_output_section_statement_type
*last_os
= NULL
;
3584 lang_output_section_statement_type
*os
;
3586 /* "start of list" is actually the statement immediately after
3587 the special abs_section output statement, so that it isn't
3589 s
= &lang_output_section_statement
.head
;
3590 while (*(s
= &(*s
)->header
.next
) != NULL
)
3592 if ((*s
)->header
.type
== lang_output_section_statement_enum
)
3594 /* Keep pointers to the first and last output section
3595 statement in the sequence we may be about to move. */
3596 os
= &(*s
)->output_section_statement
;
3598 ASSERT (last_os
== NULL
|| last_os
->next
== os
);
3601 /* Set constraint negative so that lang_output_section_find
3602 won't match this output section statement. At this
3603 stage in linking constraint has values in the range
3604 [-1, ONLY_IN_RW]. */
3605 last_os
->constraint
= -2 - last_os
->constraint
;
3606 if (first_os
== NULL
)
3609 else if ((*s
)->header
.type
== lang_insert_statement_enum
)
3611 lang_insert_statement_type
*i
= &(*s
)->insert_statement
;
3612 lang_output_section_statement_type
*where
;
3613 lang_statement_union_type
**ptr
;
3614 lang_statement_union_type
*first
;
3616 where
= lang_output_section_find (i
->where
);
3617 if (where
!= NULL
&& i
->is_before
)
3620 where
= where
->prev
;
3621 while (where
!= NULL
&& where
->constraint
< 0);
3625 einfo (_("%F%P: %s not found for insert\n"), i
->where
);
3629 /* Deal with reordering the output section statement list. */
3630 if (last_os
!= NULL
)
3632 asection
*first_sec
, *last_sec
;
3633 struct lang_output_section_statement_struct
**next
;
3635 /* Snip out the output sections we are moving. */
3636 first_os
->prev
->next
= last_os
->next
;
3637 if (last_os
->next
== NULL
)
3639 next
= &first_os
->prev
->next
;
3640 lang_output_section_statement
.tail
3641 = (lang_statement_union_type
**) next
;
3644 last_os
->next
->prev
= first_os
->prev
;
3645 /* Add them in at the new position. */
3646 last_os
->next
= where
->next
;
3647 if (where
->next
== NULL
)
3649 next
= &last_os
->next
;
3650 lang_output_section_statement
.tail
3651 = (lang_statement_union_type
**) next
;
3654 where
->next
->prev
= last_os
;
3655 first_os
->prev
= where
;
3656 where
->next
= first_os
;
3658 /* Move the bfd sections in the same way. */
3661 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3663 os
->constraint
= -2 - os
->constraint
;
3664 if (os
->bfd_section
!= NULL
3665 && os
->bfd_section
->owner
!= NULL
)
3667 last_sec
= os
->bfd_section
;
3668 if (first_sec
== NULL
)
3669 first_sec
= last_sec
;
3674 if (last_sec
!= NULL
)
3676 asection
*sec
= where
->bfd_section
;
3678 sec
= output_prev_sec_find (where
);
3680 /* The place we want to insert must come after the
3681 sections we are moving. So if we find no
3682 section or if the section is the same as our
3683 last section, then no move is needed. */
3684 if (sec
!= NULL
&& sec
!= last_sec
)
3686 /* Trim them off. */
3687 if (first_sec
->prev
!= NULL
)
3688 first_sec
->prev
->next
= last_sec
->next
;
3690 link_info
.output_bfd
->sections
= last_sec
->next
;
3691 if (last_sec
->next
!= NULL
)
3692 last_sec
->next
->prev
= first_sec
->prev
;
3694 link_info
.output_bfd
->section_last
= first_sec
->prev
;
3696 last_sec
->next
= sec
->next
;
3697 if (sec
->next
!= NULL
)
3698 sec
->next
->prev
= last_sec
;
3700 link_info
.output_bfd
->section_last
= last_sec
;
3701 first_sec
->prev
= sec
;
3702 sec
->next
= first_sec
;
3710 ptr
= insert_os_after (where
);
3711 /* Snip everything after the abs_section output statement we
3712 know is at the start of the list, up to and including
3713 the insert statement we are currently processing. */
3714 first
= lang_output_section_statement
.head
->header
.next
;
3715 lang_output_section_statement
.head
->header
.next
= (*s
)->header
.next
;
3716 /* Add them back where they belong. */
3719 statement_list
.tail
= s
;
3721 s
= &lang_output_section_statement
.head
;
3725 /* Undo constraint twiddling. */
3726 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3728 os
->constraint
= -2 - os
->constraint
;
3734 /* An output section might have been removed after its statement was
3735 added. For example, ldemul_before_allocation can remove dynamic
3736 sections if they turn out to be not needed. Clean them up here. */
3739 strip_excluded_output_sections (void)
3741 lang_output_section_statement_type
*os
;
3743 /* Run lang_size_sections (if not already done). */
3744 if (expld
.phase
!= lang_mark_phase_enum
)
3746 expld
.phase
= lang_mark_phase_enum
;
3747 expld
.dataseg
.phase
= exp_dataseg_none
;
3748 one_lang_size_sections_pass (NULL
, FALSE
);
3749 lang_reset_memory_regions ();
3752 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3756 asection
*output_section
;
3757 bfd_boolean exclude
;
3759 if (os
->constraint
< 0)
3762 output_section
= os
->bfd_section
;
3763 if (output_section
== NULL
)
3766 exclude
= (output_section
->rawsize
== 0
3767 && (output_section
->flags
& SEC_KEEP
) == 0
3768 && !bfd_section_removed_from_list (link_info
.output_bfd
,
3771 /* Some sections have not yet been sized, notably .gnu.version,
3772 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3773 input sections, so don't drop output sections that have such
3774 input sections unless they are also marked SEC_EXCLUDE. */
3775 if (exclude
&& output_section
->map_head
.s
!= NULL
)
3779 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
3780 if ((s
->flags
& SEC_LINKER_CREATED
) != 0
3781 && (s
->flags
& SEC_EXCLUDE
) == 0)
3788 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3789 output_section
->map_head
.link_order
= NULL
;
3790 output_section
->map_tail
.link_order
= NULL
;
3794 /* We don't set bfd_section to NULL since bfd_section of the
3795 removed output section statement may still be used. */
3796 if (!os
->section_relative_symbol
3797 && !os
->update_dot_tree
)
3799 output_section
->flags
|= SEC_EXCLUDE
;
3800 bfd_section_list_remove (link_info
.output_bfd
, output_section
);
3801 link_info
.output_bfd
->section_count
--;
3805 /* Stop future calls to lang_add_section from messing with map_head
3806 and map_tail link_order fields. */
3807 stripped_excluded_sections
= TRUE
;
3811 print_output_section_statement
3812 (lang_output_section_statement_type
*output_section_statement
)
3814 asection
*section
= output_section_statement
->bfd_section
;
3817 if (output_section_statement
!= abs_output_section
)
3819 minfo ("\n%s", output_section_statement
->name
);
3821 if (section
!= NULL
)
3823 print_dot
= section
->vma
;
3825 len
= strlen (output_section_statement
->name
);
3826 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3831 while (len
< SECTION_NAME_MAP_LENGTH
)
3837 minfo ("0x%V %W", section
->vma
, section
->size
);
3839 if (section
->vma
!= section
->lma
)
3840 minfo (_(" load address 0x%V"), section
->lma
);
3842 if (output_section_statement
->update_dot_tree
!= NULL
)
3843 exp_fold_tree (output_section_statement
->update_dot_tree
,
3844 bfd_abs_section_ptr
, &print_dot
);
3850 print_statement_list (output_section_statement
->children
.head
,
3851 output_section_statement
);
3854 /* Scan for the use of the destination in the right hand side
3855 of an expression. In such cases we will not compute the
3856 correct expression, since the value of DST that is used on
3857 the right hand side will be its final value, not its value
3858 just before this expression is evaluated. */
3861 scan_for_self_assignment (const char * dst
, etree_type
* rhs
)
3863 if (rhs
== NULL
|| dst
== NULL
)
3866 switch (rhs
->type
.node_class
)
3869 return scan_for_self_assignment (dst
, rhs
->binary
.lhs
)
3870 || scan_for_self_assignment (dst
, rhs
->binary
.rhs
);
3873 return scan_for_self_assignment (dst
, rhs
->trinary
.lhs
)
3874 || scan_for_self_assignment (dst
, rhs
->trinary
.rhs
);
3877 case etree_provided
:
3879 if (strcmp (dst
, rhs
->assign
.dst
) == 0)
3881 return scan_for_self_assignment (dst
, rhs
->assign
.src
);
3884 return scan_for_self_assignment (dst
, rhs
->unary
.child
);
3888 return strcmp (dst
, rhs
->value
.str
) == 0;
3893 return strcmp (dst
, rhs
->name
.name
) == 0;
3905 print_assignment (lang_assignment_statement_type
*assignment
,
3906 lang_output_section_statement_type
*output_section
)
3910 bfd_boolean computation_is_valid
= TRUE
;
3914 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3917 if (assignment
->exp
->type
.node_class
== etree_assert
)
3920 tree
= assignment
->exp
->assert_s
.child
;
3921 computation_is_valid
= TRUE
;
3925 const char *dst
= assignment
->exp
->assign
.dst
;
3927 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
3928 tree
= assignment
->exp
->assign
.src
;
3929 computation_is_valid
= is_dot
|| (scan_for_self_assignment (dst
, tree
) == FALSE
);
3932 osec
= output_section
->bfd_section
;
3934 osec
= bfd_abs_section_ptr
;
3935 exp_fold_tree (tree
, osec
, &print_dot
);
3936 if (expld
.result
.valid_p
)
3940 if (computation_is_valid
)
3942 value
= expld
.result
.value
;
3944 if (expld
.result
.section
!= NULL
)
3945 value
+= expld
.result
.section
->vma
;
3947 minfo ("0x%V", value
);
3953 struct bfd_link_hash_entry
*h
;
3955 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
3956 FALSE
, FALSE
, TRUE
);
3959 value
= h
->u
.def
.value
;
3961 if (expld
.result
.section
!= NULL
)
3962 value
+= expld
.result
.section
->vma
;
3964 minfo ("[0x%V]", value
);
3967 minfo ("[unresolved]");
3979 exp_print_tree (assignment
->exp
);
3984 print_input_statement (lang_input_statement_type
*statm
)
3986 if (statm
->filename
!= NULL
3987 && (statm
->the_bfd
== NULL
3988 || (statm
->the_bfd
->flags
& BFD_LINKER_CREATED
) == 0))
3989 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
3992 /* Print all symbols defined in a particular section. This is called
3993 via bfd_link_hash_traverse, or by print_all_symbols. */
3996 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
3998 asection
*sec
= (asection
*) ptr
;
4000 if ((hash_entry
->type
== bfd_link_hash_defined
4001 || hash_entry
->type
== bfd_link_hash_defweak
)
4002 && sec
== hash_entry
->u
.def
.section
)
4006 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4009 (hash_entry
->u
.def
.value
4010 + hash_entry
->u
.def
.section
->output_offset
4011 + hash_entry
->u
.def
.section
->output_section
->vma
));
4013 minfo (" %T\n", hash_entry
->root
.string
);
4020 hash_entry_addr_cmp (const void *a
, const void *b
)
4022 const struct bfd_link_hash_entry
*l
= *(const struct bfd_link_hash_entry
**)a
;
4023 const struct bfd_link_hash_entry
*r
= *(const struct bfd_link_hash_entry
**)b
;
4025 if (l
->u
.def
.value
< r
->u
.def
.value
)
4027 else if (l
->u
.def
.value
> r
->u
.def
.value
)
4034 print_all_symbols (asection
*sec
)
4036 struct fat_user_section_struct
*ud
=
4037 (struct fat_user_section_struct
*) get_userdata (sec
);
4038 struct map_symbol_def
*def
;
4039 struct bfd_link_hash_entry
**entries
;
4045 *ud
->map_symbol_def_tail
= 0;
4047 /* Sort the symbols by address. */
4048 entries
= (struct bfd_link_hash_entry
**)
4049 obstack_alloc (&map_obstack
, ud
->map_symbol_def_count
* sizeof (*entries
));
4051 for (i
= 0, def
= ud
->map_symbol_def_head
; def
; def
= def
->next
, i
++)
4052 entries
[i
] = def
->entry
;
4054 qsort (entries
, ud
->map_symbol_def_count
, sizeof (*entries
),
4055 hash_entry_addr_cmp
);
4057 /* Print the symbols. */
4058 for (i
= 0; i
< ud
->map_symbol_def_count
; i
++)
4059 print_one_symbol (entries
[i
], sec
);
4061 obstack_free (&map_obstack
, entries
);
4064 /* Print information about an input section to the map file. */
4067 print_input_section (asection
*i
, bfd_boolean is_discarded
)
4069 bfd_size_type size
= i
->size
;
4076 minfo ("%s", i
->name
);
4078 len
= 1 + strlen (i
->name
);
4079 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4084 while (len
< SECTION_NAME_MAP_LENGTH
)
4090 if (i
->output_section
!= NULL
4091 && i
->output_section
->owner
== link_info
.output_bfd
)
4092 addr
= i
->output_section
->vma
+ i
->output_offset
;
4100 minfo ("0x%V %W %B\n", addr
, TO_ADDR (size
), i
->owner
);
4102 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
4104 len
= SECTION_NAME_MAP_LENGTH
+ 3;
4116 minfo (_("%W (size before relaxing)\n"), i
->rawsize
);
4119 if (i
->output_section
!= NULL
4120 && i
->output_section
->owner
== link_info
.output_bfd
)
4122 if (link_info
.reduce_memory_overheads
)
4123 bfd_link_hash_traverse (link_info
.hash
, print_one_symbol
, i
);
4125 print_all_symbols (i
);
4127 /* Update print_dot, but make sure that we do not move it
4128 backwards - this could happen if we have overlays and a
4129 later overlay is shorter than an earier one. */
4130 if (addr
+ TO_ADDR (size
) > print_dot
)
4131 print_dot
= addr
+ TO_ADDR (size
);
4136 print_fill_statement (lang_fill_statement_type
*fill
)
4140 fputs (" FILL mask 0x", config
.map_file
);
4141 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
4142 fprintf (config
.map_file
, "%02x", *p
);
4143 fputs ("\n", config
.map_file
);
4147 print_data_statement (lang_data_statement_type
*data
)
4155 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4158 addr
= data
->output_offset
;
4159 if (data
->output_section
!= NULL
)
4160 addr
+= data
->output_section
->vma
;
4188 minfo ("0x%V %W %s 0x%v", addr
, size
, name
, data
->value
);
4190 if (data
->exp
->type
.node_class
!= etree_value
)
4193 exp_print_tree (data
->exp
);
4198 print_dot
= addr
+ TO_ADDR (size
);
4201 /* Print an address statement. These are generated by options like
4205 print_address_statement (lang_address_statement_type
*address
)
4207 minfo (_("Address of section %s set to "), address
->section_name
);
4208 exp_print_tree (address
->address
);
4212 /* Print a reloc statement. */
4215 print_reloc_statement (lang_reloc_statement_type
*reloc
)
4222 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4225 addr
= reloc
->output_offset
;
4226 if (reloc
->output_section
!= NULL
)
4227 addr
+= reloc
->output_section
->vma
;
4229 size
= bfd_get_reloc_size (reloc
->howto
);
4231 minfo ("0x%V %W RELOC %s ", addr
, size
, reloc
->howto
->name
);
4233 if (reloc
->name
!= NULL
)
4234 minfo ("%s+", reloc
->name
);
4236 minfo ("%s+", reloc
->section
->name
);
4238 exp_print_tree (reloc
->addend_exp
);
4242 print_dot
= addr
+ TO_ADDR (size
);
4246 print_padding_statement (lang_padding_statement_type
*s
)
4254 len
= sizeof " *fill*" - 1;
4255 while (len
< SECTION_NAME_MAP_LENGTH
)
4261 addr
= s
->output_offset
;
4262 if (s
->output_section
!= NULL
)
4263 addr
+= s
->output_section
->vma
;
4264 minfo ("0x%V %W ", addr
, (bfd_vma
) s
->size
);
4266 if (s
->fill
->size
!= 0)
4270 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
4271 fprintf (config
.map_file
, "%02x", *p
);
4276 print_dot
= addr
+ TO_ADDR (s
->size
);
4280 print_wild_statement (lang_wild_statement_type
*w
,
4281 lang_output_section_statement_type
*os
)
4283 struct wildcard_list
*sec
;
4287 if (w
->filenames_sorted
)
4289 if (w
->filename
!= NULL
)
4290 minfo ("%s", w
->filename
);
4293 if (w
->filenames_sorted
)
4297 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
4299 if (sec
->spec
.sorted
)
4301 if (sec
->spec
.exclude_name_list
!= NULL
)
4304 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
4305 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
4306 minfo (" %s", tmp
->name
);
4309 if (sec
->spec
.name
!= NULL
)
4310 minfo ("%s", sec
->spec
.name
);
4313 if (sec
->spec
.sorted
)
4322 print_statement_list (w
->children
.head
, os
);
4325 /* Print a group statement. */
4328 print_group (lang_group_statement_type
*s
,
4329 lang_output_section_statement_type
*os
)
4331 fprintf (config
.map_file
, "START GROUP\n");
4332 print_statement_list (s
->children
.head
, os
);
4333 fprintf (config
.map_file
, "END GROUP\n");
4336 /* Print the list of statements in S.
4337 This can be called for any statement type. */
4340 print_statement_list (lang_statement_union_type
*s
,
4341 lang_output_section_statement_type
*os
)
4345 print_statement (s
, os
);
4350 /* Print the first statement in statement list S.
4351 This can be called for any statement type. */
4354 print_statement (lang_statement_union_type
*s
,
4355 lang_output_section_statement_type
*os
)
4357 switch (s
->header
.type
)
4360 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
4363 case lang_constructors_statement_enum
:
4364 if (constructor_list
.head
!= NULL
)
4366 if (constructors_sorted
)
4367 minfo (" SORT (CONSTRUCTORS)\n");
4369 minfo (" CONSTRUCTORS\n");
4370 print_statement_list (constructor_list
.head
, os
);
4373 case lang_wild_statement_enum
:
4374 print_wild_statement (&s
->wild_statement
, os
);
4376 case lang_address_statement_enum
:
4377 print_address_statement (&s
->address_statement
);
4379 case lang_object_symbols_statement_enum
:
4380 minfo (" CREATE_OBJECT_SYMBOLS\n");
4382 case lang_fill_statement_enum
:
4383 print_fill_statement (&s
->fill_statement
);
4385 case lang_data_statement_enum
:
4386 print_data_statement (&s
->data_statement
);
4388 case lang_reloc_statement_enum
:
4389 print_reloc_statement (&s
->reloc_statement
);
4391 case lang_input_section_enum
:
4392 print_input_section (s
->input_section
.section
, FALSE
);
4394 case lang_padding_statement_enum
:
4395 print_padding_statement (&s
->padding_statement
);
4397 case lang_output_section_statement_enum
:
4398 print_output_section_statement (&s
->output_section_statement
);
4400 case lang_assignment_statement_enum
:
4401 print_assignment (&s
->assignment_statement
, os
);
4403 case lang_target_statement_enum
:
4404 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
4406 case lang_output_statement_enum
:
4407 minfo ("OUTPUT(%s", s
->output_statement
.name
);
4408 if (output_target
!= NULL
)
4409 minfo (" %s", output_target
);
4412 case lang_input_statement_enum
:
4413 print_input_statement (&s
->input_statement
);
4415 case lang_group_statement_enum
:
4416 print_group (&s
->group_statement
, os
);
4418 case lang_insert_statement_enum
:
4419 minfo ("INSERT %s %s\n",
4420 s
->insert_statement
.is_before
? "BEFORE" : "AFTER",
4421 s
->insert_statement
.where
);
4427 print_statements (void)
4429 print_statement_list (statement_list
.head
, abs_output_section
);
4432 /* Print the first N statements in statement list S to STDERR.
4433 If N == 0, nothing is printed.
4434 If N < 0, the entire list is printed.
4435 Intended to be called from GDB. */
4438 dprint_statement (lang_statement_union_type
*s
, int n
)
4440 FILE *map_save
= config
.map_file
;
4442 config
.map_file
= stderr
;
4445 print_statement_list (s
, abs_output_section
);
4448 while (s
&& --n
>= 0)
4450 print_statement (s
, abs_output_section
);
4455 config
.map_file
= map_save
;
4459 insert_pad (lang_statement_union_type
**ptr
,
4461 unsigned int alignment_needed
,
4462 asection
*output_section
,
4465 static fill_type zero_fill
= { 1, { 0 } };
4466 lang_statement_union_type
*pad
= NULL
;
4468 if (ptr
!= &statement_list
.head
)
4469 pad
= ((lang_statement_union_type
*)
4470 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
4472 && pad
->header
.type
== lang_padding_statement_enum
4473 && pad
->padding_statement
.output_section
== output_section
)
4475 /* Use the existing pad statement. */
4477 else if ((pad
= *ptr
) != NULL
4478 && pad
->header
.type
== lang_padding_statement_enum
4479 && pad
->padding_statement
.output_section
== output_section
)
4481 /* Use the existing pad statement. */
4485 /* Make a new padding statement, linked into existing chain. */
4486 pad
= (lang_statement_union_type
*)
4487 stat_alloc (sizeof (lang_padding_statement_type
));
4488 pad
->header
.next
= *ptr
;
4490 pad
->header
.type
= lang_padding_statement_enum
;
4491 pad
->padding_statement
.output_section
= output_section
;
4494 pad
->padding_statement
.fill
= fill
;
4496 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
4497 pad
->padding_statement
.size
= alignment_needed
;
4498 output_section
->size
+= alignment_needed
;
4501 /* Work out how much this section will move the dot point. */
4505 (lang_statement_union_type
**this_ptr
,
4506 lang_output_section_statement_type
*output_section_statement
,
4510 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
4511 asection
*i
= is
->section
;
4513 if (!((lang_input_statement_type
*) i
->owner
->usrdata
)->just_syms_flag
4514 && (i
->flags
& SEC_EXCLUDE
) == 0)
4516 unsigned int alignment_needed
;
4519 /* Align this section first to the input sections requirement,
4520 then to the output section's requirement. If this alignment
4521 is greater than any seen before, then record it too. Perform
4522 the alignment by inserting a magic 'padding' statement. */
4524 if (output_section_statement
->subsection_alignment
!= -1)
4525 i
->alignment_power
= output_section_statement
->subsection_alignment
;
4527 o
= output_section_statement
->bfd_section
;
4528 if (o
->alignment_power
< i
->alignment_power
)
4529 o
->alignment_power
= i
->alignment_power
;
4531 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
4533 if (alignment_needed
!= 0)
4535 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
4536 dot
+= alignment_needed
;
4539 /* Remember where in the output section this input section goes. */
4541 i
->output_offset
= dot
- o
->vma
;
4543 /* Mark how big the output section must be to contain this now. */
4544 dot
+= TO_ADDR (i
->size
);
4545 o
->size
= TO_SIZE (dot
- o
->vma
);
4549 i
->output_offset
= i
->vma
- output_section_statement
->bfd_section
->vma
;
4556 sort_sections_by_lma (const void *arg1
, const void *arg2
)
4558 const asection
*sec1
= *(const asection
**) arg1
;
4559 const asection
*sec2
= *(const asection
**) arg2
;
4561 if (bfd_section_lma (sec1
->owner
, sec1
)
4562 < bfd_section_lma (sec2
->owner
, sec2
))
4564 else if (bfd_section_lma (sec1
->owner
, sec1
)
4565 > bfd_section_lma (sec2
->owner
, sec2
))
4567 else if (sec1
->id
< sec2
->id
)
4569 else if (sec1
->id
> sec2
->id
)
4575 /* On ELF, a debugging section must never set SEC_NEVER_LOAD, as no output
4576 would be written for it. So the combination of debugging and never-load
4577 is something which can only happen for pe-coff and must not be ignored. */
4578 #define IGNORE_SECTION(s) \
4579 ((s->flags & (SEC_NEVER_LOAD | SEC_DEBUGGING)) == SEC_NEVER_LOAD \
4580 || (s->flags & SEC_ALLOC) == 0 \
4581 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
4582 && (s->flags & SEC_LOAD) == 0))
4584 /* Check to see if any allocated sections overlap with other allocated
4585 sections. This can happen if a linker script specifies the output
4586 section addresses of the two sections. Also check whether any memory
4587 region has overflowed. */
4590 lang_check_section_addresses (void)
4593 asection
**sections
, **spp
;
4600 lang_memory_region_type
*m
;
4602 if (bfd_count_sections (link_info
.output_bfd
) <= 1)
4605 amt
= bfd_count_sections (link_info
.output_bfd
) * sizeof (asection
*);
4606 sections
= (asection
**) xmalloc (amt
);
4608 /* Scan all sections in the output list. */
4610 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4612 /* Only consider loadable sections with real contents. */
4613 if ((s
->flags
& (SEC_NEVER_LOAD
| SEC_DEBUGGING
)) == SEC_NEVER_LOAD
4614 || !(s
->flags
& SEC_LOAD
)
4615 || !(s
->flags
& SEC_ALLOC
)
4619 sections
[count
] = s
;
4626 qsort (sections
, (size_t) count
, sizeof (asection
*),
4627 sort_sections_by_lma
);
4632 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4633 for (count
--; count
; count
--)
4635 /* We must check the sections' LMA addresses not their VMA
4636 addresses because overlay sections can have overlapping VMAs
4637 but they must have distinct LMAs. */
4643 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4645 /* Look for an overlap. We have sorted sections by lma, so we
4646 know that s_start >= p_start. Besides the obvious case of
4647 overlap when the current section starts before the previous
4648 one ends, we also must have overlap if the previous section
4649 wraps around the address space. */
4650 if (s_start
<= p_end
4652 einfo (_("%X%P: section %s loaded at [%V,%V] overlaps section %s loaded at [%V,%V]\n"),
4653 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
4658 /* If any memory region has overflowed, report by how much.
4659 We do not issue this diagnostic for regions that had sections
4660 explicitly placed outside their bounds; os_region_check's
4661 diagnostics are adequate for that case.
4663 FIXME: It is conceivable that m->current - (m->origin + m->length)
4664 might overflow a 32-bit integer. There is, alas, no way to print
4665 a bfd_vma quantity in decimal. */
4666 for (m
= lang_memory_region_list
; m
; m
= m
->next
)
4667 if (m
->had_full_message
)
4668 einfo (_("%X%P: region `%s' overflowed by %ld bytes\n"),
4669 m
->name_list
.name
, (long)(m
->current
- (m
->origin
+ m
->length
)));
4673 /* Make sure the new address is within the region. We explicitly permit the
4674 current address to be at the exact end of the region when the address is
4675 non-zero, in case the region is at the end of addressable memory and the
4676 calculation wraps around. */
4679 os_region_check (lang_output_section_statement_type
*os
,
4680 lang_memory_region_type
*region
,
4684 if ((region
->current
< region
->origin
4685 || (region
->current
- region
->origin
> region
->length
))
4686 && ((region
->current
!= region
->origin
+ region
->length
)
4691 einfo (_("%X%P: address 0x%v of %B section `%s'"
4692 " is not within region `%s'\n"),
4694 os
->bfd_section
->owner
,
4695 os
->bfd_section
->name
,
4696 region
->name_list
.name
);
4698 else if (!region
->had_full_message
)
4700 region
->had_full_message
= TRUE
;
4702 einfo (_("%X%P: %B section `%s' will not fit in region `%s'\n"),
4703 os
->bfd_section
->owner
,
4704 os
->bfd_section
->name
,
4705 region
->name_list
.name
);
4710 /* Set the sizes for all the output sections. */
4713 lang_size_sections_1
4714 (lang_statement_union_type
**prev
,
4715 lang_output_section_statement_type
*output_section_statement
,
4719 bfd_boolean check_regions
)
4721 lang_statement_union_type
*s
;
4723 /* Size up the sections from their constituent parts. */
4724 for (s
= *prev
; s
!= NULL
; s
= s
->header
.next
)
4726 switch (s
->header
.type
)
4728 case lang_output_section_statement_enum
:
4730 bfd_vma newdot
, after
;
4731 lang_output_section_statement_type
*os
;
4732 lang_memory_region_type
*r
;
4734 os
= &s
->output_section_statement
;
4735 if (os
->constraint
== -1)
4738 /* FIXME: We shouldn't need to zero section vmas for ld -r
4739 here, in lang_insert_orphan, or in the default linker scripts.
4740 This is covering for coff backend linker bugs. See PR6945. */
4741 if (os
->addr_tree
== NULL
4742 && link_info
.relocatable
4743 && (bfd_get_flavour (link_info
.output_bfd
)
4744 == bfd_target_coff_flavour
))
4745 os
->addr_tree
= exp_intop (0);
4746 if (os
->addr_tree
!= NULL
)
4748 os
->processed_vma
= FALSE
;
4749 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
4751 if (expld
.result
.valid_p
)
4753 dot
= expld
.result
.value
;
4754 if (expld
.result
.section
!= NULL
)
4755 dot
+= expld
.result
.section
->vma
;
4757 else if (expld
.phase
!= lang_mark_phase_enum
)
4758 einfo (_("%F%S: non constant or forward reference"
4759 " address expression for section %s\n"),
4763 if (os
->bfd_section
== NULL
)
4764 /* This section was removed or never actually created. */
4767 /* If this is a COFF shared library section, use the size and
4768 address from the input section. FIXME: This is COFF
4769 specific; it would be cleaner if there were some other way
4770 to do this, but nothing simple comes to mind. */
4771 if (((bfd_get_flavour (link_info
.output_bfd
)
4772 == bfd_target_ecoff_flavour
)
4773 || (bfd_get_flavour (link_info
.output_bfd
)
4774 == bfd_target_coff_flavour
))
4775 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
4779 if (os
->children
.head
== NULL
4780 || os
->children
.head
->header
.next
!= NULL
4781 || (os
->children
.head
->header
.type
4782 != lang_input_section_enum
))
4783 einfo (_("%P%X: Internal error on COFF shared library"
4784 " section %s\n"), os
->name
);
4786 input
= os
->children
.head
->input_section
.section
;
4787 bfd_set_section_vma (os
->bfd_section
->owner
,
4789 bfd_section_vma (input
->owner
, input
));
4790 os
->bfd_section
->size
= input
->size
;
4795 if (bfd_is_abs_section (os
->bfd_section
))
4797 /* No matter what happens, an abs section starts at zero. */
4798 ASSERT (os
->bfd_section
->vma
== 0);
4804 if (os
->addr_tree
== NULL
)
4806 /* No address specified for this section, get one
4807 from the region specification. */
4808 if (os
->region
== NULL
4809 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
4810 && os
->region
->name_list
.name
[0] == '*'
4811 && strcmp (os
->region
->name_list
.name
,
4812 DEFAULT_MEMORY_REGION
) == 0))
4814 os
->region
= lang_memory_default (os
->bfd_section
);
4817 /* If a loadable section is using the default memory
4818 region, and some non default memory regions were
4819 defined, issue an error message. */
4821 && !IGNORE_SECTION (os
->bfd_section
)
4822 && ! link_info
.relocatable
4824 && strcmp (os
->region
->name_list
.name
,
4825 DEFAULT_MEMORY_REGION
) == 0
4826 && lang_memory_region_list
!= NULL
4827 && (strcmp (lang_memory_region_list
->name_list
.name
,
4828 DEFAULT_MEMORY_REGION
) != 0
4829 || lang_memory_region_list
->next
!= NULL
)
4830 && expld
.phase
!= lang_mark_phase_enum
)
4832 /* By default this is an error rather than just a
4833 warning because if we allocate the section to the
4834 default memory region we can end up creating an
4835 excessively large binary, or even seg faulting when
4836 attempting to perform a negative seek. See
4837 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4838 for an example of this. This behaviour can be
4839 overridden by the using the --no-check-sections
4841 if (command_line
.check_section_addresses
)
4842 einfo (_("%P%F: error: no memory region specified"
4843 " for loadable section `%s'\n"),
4844 bfd_get_section_name (link_info
.output_bfd
,
4847 einfo (_("%P: warning: no memory region specified"
4848 " for loadable section `%s'\n"),
4849 bfd_get_section_name (link_info
.output_bfd
,
4853 newdot
= os
->region
->current
;
4854 align
= os
->bfd_section
->alignment_power
;
4857 align
= os
->section_alignment
;
4859 /* Align to what the section needs. */
4862 bfd_vma savedot
= newdot
;
4863 newdot
= align_power (newdot
, align
);
4865 if (newdot
!= savedot
4866 && (config
.warn_section_align
4867 || os
->addr_tree
!= NULL
)
4868 && expld
.phase
!= lang_mark_phase_enum
)
4869 einfo (_("%P: warning: changing start of section"
4870 " %s by %lu bytes\n"),
4871 os
->name
, (unsigned long) (newdot
- savedot
));
4874 bfd_set_section_vma (0, os
->bfd_section
, newdot
);
4876 os
->bfd_section
->output_offset
= 0;
4879 lang_size_sections_1 (&os
->children
.head
, os
,
4880 os
->fill
, newdot
, relax
, check_regions
);
4882 os
->processed_vma
= TRUE
;
4884 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
4885 /* Except for some special linker created sections,
4886 no output section should change from zero size
4887 after strip_excluded_output_sections. A non-zero
4888 size on an ignored section indicates that some
4889 input section was not sized early enough. */
4890 ASSERT (os
->bfd_section
->size
== 0);
4893 dot
= os
->bfd_section
->vma
;
4895 /* Put the section within the requested block size, or
4896 align at the block boundary. */
4898 + TO_ADDR (os
->bfd_section
->size
)
4899 + os
->block_value
- 1)
4900 & - (bfd_vma
) os
->block_value
);
4902 os
->bfd_section
->size
= TO_SIZE (after
- os
->bfd_section
->vma
);
4905 /* Set section lma. */
4908 r
= lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
4912 bfd_vma lma
= exp_get_abs_int (os
->load_base
, 0, "load base");
4913 os
->bfd_section
->lma
= lma
;
4915 else if (os
->lma_region
!= NULL
)
4917 bfd_vma lma
= os
->lma_region
->current
;
4919 if (os
->section_alignment
!= -1)
4920 lma
= align_power (lma
, os
->section_alignment
);
4921 os
->bfd_section
->lma
= lma
;
4923 else if (r
->last_os
!= NULL
4924 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
4929 last
= r
->last_os
->output_section_statement
.bfd_section
;
4931 /* A backwards move of dot should be accompanied by
4932 an explicit assignment to the section LMA (ie.
4933 os->load_base set) because backwards moves can
4934 create overlapping LMAs. */
4936 && os
->bfd_section
->size
!= 0
4937 && dot
+ os
->bfd_section
->size
<= last
->vma
)
4939 /* If dot moved backwards then leave lma equal to
4940 vma. This is the old default lma, which might
4941 just happen to work when the backwards move is
4942 sufficiently large. Nag if this changes anything,
4943 so people can fix their linker scripts. */
4945 if (last
->vma
!= last
->lma
)
4946 einfo (_("%P: warning: dot moved backwards before `%s'\n"),
4951 /* If this is an overlay, set the current lma to that
4952 at the end of the previous section. */
4953 if (os
->sectype
== overlay_section
)
4954 lma
= last
->lma
+ last
->size
;
4956 /* Otherwise, keep the same lma to vma relationship
4957 as the previous section. */
4959 lma
= dot
+ last
->lma
- last
->vma
;
4961 if (os
->section_alignment
!= -1)
4962 lma
= align_power (lma
, os
->section_alignment
);
4963 os
->bfd_section
->lma
= lma
;
4966 os
->processed_lma
= TRUE
;
4968 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
4971 /* Keep track of normal sections using the default
4972 lma region. We use this to set the lma for
4973 following sections. Overlays or other linker
4974 script assignment to lma might mean that the
4975 default lma == vma is incorrect.
4976 To avoid warnings about dot moving backwards when using
4977 -Ttext, don't start tracking sections until we find one
4978 of non-zero size or with lma set differently to vma. */
4979 if (((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
4980 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0)
4981 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0
4982 && (os
->bfd_section
->size
!= 0
4983 || (r
->last_os
== NULL
4984 && os
->bfd_section
->vma
!= os
->bfd_section
->lma
)
4985 || (r
->last_os
!= NULL
4986 && dot
>= (r
->last_os
->output_section_statement
4987 .bfd_section
->vma
)))
4988 && os
->lma_region
== NULL
4989 && !link_info
.relocatable
)
4992 /* .tbss sections effectively have zero size. */
4993 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
4994 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
4995 || link_info
.relocatable
)
4996 dot
+= TO_ADDR (os
->bfd_section
->size
);
4998 if (os
->update_dot_tree
!= 0)
4999 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5001 /* Update dot in the region ?
5002 We only do this if the section is going to be allocated,
5003 since unallocated sections do not contribute to the region's
5004 overall size in memory. */
5005 if (os
->region
!= NULL
5006 && (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
)))
5008 os
->region
->current
= dot
;
5011 /* Make sure the new address is within the region. */
5012 os_region_check (os
, os
->region
, os
->addr_tree
,
5013 os
->bfd_section
->vma
);
5015 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
5016 && (os
->bfd_section
->flags
& SEC_LOAD
))
5018 os
->lma_region
->current
5019 = os
->bfd_section
->lma
+ TO_ADDR (os
->bfd_section
->size
);
5022 os_region_check (os
, os
->lma_region
, NULL
,
5023 os
->bfd_section
->lma
);
5029 case lang_constructors_statement_enum
:
5030 dot
= lang_size_sections_1 (&constructor_list
.head
,
5031 output_section_statement
,
5032 fill
, dot
, relax
, check_regions
);
5035 case lang_data_statement_enum
:
5037 unsigned int size
= 0;
5039 s
->data_statement
.output_offset
=
5040 dot
- output_section_statement
->bfd_section
->vma
;
5041 s
->data_statement
.output_section
=
5042 output_section_statement
->bfd_section
;
5044 /* We might refer to provided symbols in the expression, and
5045 need to mark them as needed. */
5046 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5048 switch (s
->data_statement
.type
)
5066 if (size
< TO_SIZE ((unsigned) 1))
5067 size
= TO_SIZE ((unsigned) 1);
5068 dot
+= TO_ADDR (size
);
5069 output_section_statement
->bfd_section
->size
+= size
;
5073 case lang_reloc_statement_enum
:
5077 s
->reloc_statement
.output_offset
=
5078 dot
- output_section_statement
->bfd_section
->vma
;
5079 s
->reloc_statement
.output_section
=
5080 output_section_statement
->bfd_section
;
5081 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
5082 dot
+= TO_ADDR (size
);
5083 output_section_statement
->bfd_section
->size
+= size
;
5087 case lang_wild_statement_enum
:
5088 dot
= lang_size_sections_1 (&s
->wild_statement
.children
.head
,
5089 output_section_statement
,
5090 fill
, dot
, relax
, check_regions
);
5093 case lang_object_symbols_statement_enum
:
5094 link_info
.create_object_symbols_section
=
5095 output_section_statement
->bfd_section
;
5098 case lang_output_statement_enum
:
5099 case lang_target_statement_enum
:
5102 case lang_input_section_enum
:
5106 i
= s
->input_section
.section
;
5111 if (! bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
5112 einfo (_("%P%F: can't relax section: %E\n"));
5116 dot
= size_input_section (prev
, output_section_statement
,
5117 output_section_statement
->fill
, dot
);
5121 case lang_input_statement_enum
:
5124 case lang_fill_statement_enum
:
5125 s
->fill_statement
.output_section
=
5126 output_section_statement
->bfd_section
;
5128 fill
= s
->fill_statement
.fill
;
5131 case lang_assignment_statement_enum
:
5133 bfd_vma newdot
= dot
;
5134 etree_type
*tree
= s
->assignment_statement
.exp
;
5136 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
5138 exp_fold_tree (tree
,
5139 output_section_statement
->bfd_section
,
5142 if (expld
.dataseg
.relro
== exp_dataseg_relro_start
)
5144 if (!expld
.dataseg
.relro_start_stat
)
5145 expld
.dataseg
.relro_start_stat
= s
;
5148 ASSERT (expld
.dataseg
.relro_start_stat
== s
);
5151 else if (expld
.dataseg
.relro
== exp_dataseg_relro_end
)
5153 if (!expld
.dataseg
.relro_end_stat
)
5154 expld
.dataseg
.relro_end_stat
= s
;
5157 ASSERT (expld
.dataseg
.relro_end_stat
== s
);
5160 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
5162 /* This symbol is relative to this section. */
5163 if ((tree
->type
.node_class
== etree_provided
5164 || tree
->type
.node_class
== etree_assign
)
5165 && (tree
->assign
.dst
[0] != '.'
5166 || tree
->assign
.dst
[1] != '\0'))
5167 output_section_statement
->section_relative_symbol
= 1;
5169 if (!output_section_statement
->ignored
)
5171 if (output_section_statement
== abs_output_section
)
5173 /* If we don't have an output section, then just adjust
5174 the default memory address. */
5175 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
5176 FALSE
)->current
= newdot
;
5178 else if (newdot
!= dot
)
5180 /* Insert a pad after this statement. We can't
5181 put the pad before when relaxing, in case the
5182 assignment references dot. */
5183 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
5184 output_section_statement
->bfd_section
, dot
);
5186 /* Don't neuter the pad below when relaxing. */
5189 /* If dot is advanced, this implies that the section
5190 should have space allocated to it, unless the
5191 user has explicitly stated that the section
5192 should not be allocated. */
5193 if (output_section_statement
->sectype
!= noalloc_section
)
5194 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
5201 case lang_padding_statement_enum
:
5202 /* If this is the first time lang_size_sections is called,
5203 we won't have any padding statements. If this is the
5204 second or later passes when relaxing, we should allow
5205 padding to shrink. If padding is needed on this pass, it
5206 will be added back in. */
5207 s
->padding_statement
.size
= 0;
5209 /* Make sure output_offset is valid. If relaxation shrinks
5210 the section and this pad isn't needed, it's possible to
5211 have output_offset larger than the final size of the
5212 section. bfd_set_section_contents will complain even for
5213 a pad size of zero. */
5214 s
->padding_statement
.output_offset
5215 = dot
- output_section_statement
->bfd_section
->vma
;
5218 case lang_group_statement_enum
:
5219 dot
= lang_size_sections_1 (&s
->group_statement
.children
.head
,
5220 output_section_statement
,
5221 fill
, dot
, relax
, check_regions
);
5224 case lang_insert_statement_enum
:
5227 /* We can only get here when relaxing is turned on. */
5228 case lang_address_statement_enum
:
5235 prev
= &s
->header
.next
;
5240 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
5241 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
5242 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
5243 segments. We are allowed an opportunity to override this decision. */
5246 ldlang_override_segment_assignment (struct bfd_link_info
* info ATTRIBUTE_UNUSED
,
5247 bfd
* abfd ATTRIBUTE_UNUSED
,
5248 asection
* current_section
,
5249 asection
* previous_section
,
5250 bfd_boolean new_segment
)
5252 lang_output_section_statement_type
* cur
;
5253 lang_output_section_statement_type
* prev
;
5255 /* The checks below are only necessary when the BFD library has decided
5256 that the two sections ought to be placed into the same segment. */
5260 /* Paranoia checks. */
5261 if (current_section
== NULL
|| previous_section
== NULL
)
5264 /* Find the memory regions associated with the two sections.
5265 We call lang_output_section_find() here rather than scanning the list
5266 of output sections looking for a matching section pointer because if
5267 we have a large number of sections then a hash lookup is faster. */
5268 cur
= lang_output_section_find (current_section
->name
);
5269 prev
= lang_output_section_find (previous_section
->name
);
5271 /* More paranoia. */
5272 if (cur
== NULL
|| prev
== NULL
)
5275 /* If the regions are different then force the sections to live in
5276 different segments. See the email thread starting at the following
5277 URL for the reasons why this is necessary:
5278 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
5279 return cur
->region
!= prev
->region
;
5283 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
5285 lang_statement_iteration
++;
5286 lang_size_sections_1 (&statement_list
.head
, abs_output_section
,
5287 0, 0, relax
, check_regions
);
5291 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
5293 expld
.phase
= lang_allocating_phase_enum
;
5294 expld
.dataseg
.phase
= exp_dataseg_none
;
5296 one_lang_size_sections_pass (relax
, check_regions
);
5297 if (expld
.dataseg
.phase
== exp_dataseg_end_seen
5298 && link_info
.relro
&& expld
.dataseg
.relro_end
)
5300 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
5301 to put expld.dataseg.relro on a (common) page boundary. */
5302 bfd_vma min_base
, old_base
, relro_end
, maxpage
;
5304 expld
.dataseg
.phase
= exp_dataseg_relro_adjust
;
5305 maxpage
= expld
.dataseg
.maxpagesize
;
5306 /* MIN_BASE is the absolute minimum address we are allowed to start the
5307 read-write segment (byte before will be mapped read-only). */
5308 min_base
= (expld
.dataseg
.min_base
+ maxpage
- 1) & ~(maxpage
- 1);
5309 /* OLD_BASE is the address for a feasible minimum address which will
5310 still not cause a data overlap inside MAXPAGE causing file offset skip
5312 old_base
= expld
.dataseg
.base
;
5313 expld
.dataseg
.base
+= (-expld
.dataseg
.relro_end
5314 & (expld
.dataseg
.pagesize
- 1));
5315 /* Compute the expected PT_GNU_RELRO segment end. */
5316 relro_end
= ((expld
.dataseg
.relro_end
+ expld
.dataseg
.pagesize
- 1)
5317 & ~(expld
.dataseg
.pagesize
- 1));
5318 if (min_base
+ maxpage
< expld
.dataseg
.base
)
5320 expld
.dataseg
.base
-= maxpage
;
5321 relro_end
-= maxpage
;
5323 lang_reset_memory_regions ();
5324 one_lang_size_sections_pass (relax
, check_regions
);
5325 if (expld
.dataseg
.relro_end
> relro_end
)
5327 /* The alignment of sections between DATA_SEGMENT_ALIGN
5328 and DATA_SEGMENT_RELRO_END caused huge padding to be
5329 inserted at DATA_SEGMENT_RELRO_END. Try to start a bit lower so
5330 that the section alignments will fit in. */
5332 unsigned int max_alignment_power
= 0;
5334 /* Find maximum alignment power of sections between
5335 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
5336 for (sec
= link_info
.output_bfd
->sections
; sec
; sec
= sec
->next
)
5337 if (sec
->vma
>= expld
.dataseg
.base
5338 && sec
->vma
< expld
.dataseg
.relro_end
5339 && sec
->alignment_power
> max_alignment_power
)
5340 max_alignment_power
= sec
->alignment_power
;
5342 if (((bfd_vma
) 1 << max_alignment_power
) < expld
.dataseg
.pagesize
)
5344 if (expld
.dataseg
.base
- (1 << max_alignment_power
) < old_base
)
5345 expld
.dataseg
.base
+= expld
.dataseg
.pagesize
;
5346 expld
.dataseg
.base
-= (1 << max_alignment_power
);
5347 lang_reset_memory_regions ();
5348 one_lang_size_sections_pass (relax
, check_regions
);
5351 link_info
.relro_start
= expld
.dataseg
.base
;
5352 link_info
.relro_end
= expld
.dataseg
.relro_end
;
5354 else if (expld
.dataseg
.phase
== exp_dataseg_end_seen
)
5356 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
5357 a page could be saved in the data segment. */
5358 bfd_vma first
, last
;
5360 first
= -expld
.dataseg
.base
& (expld
.dataseg
.pagesize
- 1);
5361 last
= expld
.dataseg
.end
& (expld
.dataseg
.pagesize
- 1);
5363 && ((expld
.dataseg
.base
& ~(expld
.dataseg
.pagesize
- 1))
5364 != (expld
.dataseg
.end
& ~(expld
.dataseg
.pagesize
- 1)))
5365 && first
+ last
<= expld
.dataseg
.pagesize
)
5367 expld
.dataseg
.phase
= exp_dataseg_adjust
;
5368 lang_reset_memory_regions ();
5369 one_lang_size_sections_pass (relax
, check_regions
);
5373 expld
.phase
= lang_final_phase_enum
;
5376 /* Worker function for lang_do_assignments. Recursiveness goes here. */
5379 lang_do_assignments_1 (lang_statement_union_type
*s
,
5380 lang_output_section_statement_type
*current_os
,
5384 for (; s
!= NULL
; s
= s
->header
.next
)
5386 switch (s
->header
.type
)
5388 case lang_constructors_statement_enum
:
5389 dot
= lang_do_assignments_1 (constructor_list
.head
,
5390 current_os
, fill
, dot
);
5393 case lang_output_section_statement_enum
:
5395 lang_output_section_statement_type
*os
;
5397 os
= &(s
->output_section_statement
);
5398 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
5400 dot
= os
->bfd_section
->vma
;
5402 lang_do_assignments_1 (os
->children
.head
, os
, os
->fill
, dot
);
5404 /* .tbss sections effectively have zero size. */
5405 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5406 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
5407 || link_info
.relocatable
)
5408 dot
+= TO_ADDR (os
->bfd_section
->size
);
5410 if (os
->update_dot_tree
!= NULL
)
5411 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5416 case lang_wild_statement_enum
:
5418 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
5419 current_os
, fill
, dot
);
5422 case lang_object_symbols_statement_enum
:
5423 case lang_output_statement_enum
:
5424 case lang_target_statement_enum
:
5427 case lang_data_statement_enum
:
5428 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5429 if (expld
.result
.valid_p
)
5431 s
->data_statement
.value
= expld
.result
.value
;
5432 if (expld
.result
.section
!= NULL
)
5433 s
->data_statement
.value
+= expld
.result
.section
->vma
;
5436 einfo (_("%F%P: invalid data statement\n"));
5439 switch (s
->data_statement
.type
)
5457 if (size
< TO_SIZE ((unsigned) 1))
5458 size
= TO_SIZE ((unsigned) 1);
5459 dot
+= TO_ADDR (size
);
5463 case lang_reloc_statement_enum
:
5464 exp_fold_tree (s
->reloc_statement
.addend_exp
,
5465 bfd_abs_section_ptr
, &dot
);
5466 if (expld
.result
.valid_p
)
5467 s
->reloc_statement
.addend_value
= expld
.result
.value
;
5469 einfo (_("%F%P: invalid reloc statement\n"));
5470 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
5473 case lang_input_section_enum
:
5475 asection
*in
= s
->input_section
.section
;
5477 if ((in
->flags
& SEC_EXCLUDE
) == 0)
5478 dot
+= TO_ADDR (in
->size
);
5482 case lang_input_statement_enum
:
5485 case lang_fill_statement_enum
:
5486 fill
= s
->fill_statement
.fill
;
5489 case lang_assignment_statement_enum
:
5490 exp_fold_tree (s
->assignment_statement
.exp
,
5491 current_os
->bfd_section
,
5495 case lang_padding_statement_enum
:
5496 dot
+= TO_ADDR (s
->padding_statement
.size
);
5499 case lang_group_statement_enum
:
5500 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
5501 current_os
, fill
, dot
);
5504 case lang_insert_statement_enum
:
5507 case lang_address_statement_enum
:
5519 lang_do_assignments (void)
5521 lang_statement_iteration
++;
5522 lang_do_assignments_1 (statement_list
.head
, abs_output_section
, NULL
, 0);
5525 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
5526 operator .startof. (section_name), it produces an undefined symbol
5527 .startof.section_name. Similarly, when it sees
5528 .sizeof. (section_name), it produces an undefined symbol
5529 .sizeof.section_name. For all the output sections, we look for
5530 such symbols, and set them to the correct value. */
5533 lang_set_startof (void)
5537 if (link_info
.relocatable
)
5540 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5542 const char *secname
;
5544 struct bfd_link_hash_entry
*h
;
5546 secname
= bfd_get_section_name (link_info
.output_bfd
, s
);
5547 buf
= (char *) xmalloc (10 + strlen (secname
));
5549 sprintf (buf
, ".startof.%s", secname
);
5550 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5551 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5553 h
->type
= bfd_link_hash_defined
;
5554 h
->u
.def
.value
= bfd_get_section_vma (link_info
.output_bfd
, s
);
5555 h
->u
.def
.section
= bfd_abs_section_ptr
;
5558 sprintf (buf
, ".sizeof.%s", secname
);
5559 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5560 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5562 h
->type
= bfd_link_hash_defined
;
5563 h
->u
.def
.value
= TO_ADDR (s
->size
);
5564 h
->u
.def
.section
= bfd_abs_section_ptr
;
5574 struct bfd_link_hash_entry
*h
;
5577 if ((link_info
.relocatable
&& !link_info
.gc_sections
)
5578 || (link_info
.shared
&& !link_info
.executable
))
5579 warn
= entry_from_cmdline
;
5583 /* Force the user to specify a root when generating a relocatable with
5585 if (link_info
.gc_sections
&& link_info
.relocatable
5586 && (entry_symbol
.name
== NULL
5587 && ldlang_undef_chain_list_head
== NULL
))
5588 einfo (_("%P%F: gc-sections requires either an entry or "
5589 "an undefined symbol\n"));
5591 if (entry_symbol
.name
== NULL
)
5593 /* No entry has been specified. Look for the default entry, but
5594 don't warn if we don't find it. */
5595 entry_symbol
.name
= entry_symbol_default
;
5599 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
5600 FALSE
, FALSE
, TRUE
);
5602 && (h
->type
== bfd_link_hash_defined
5603 || h
->type
== bfd_link_hash_defweak
)
5604 && h
->u
.def
.section
->output_section
!= NULL
)
5608 val
= (h
->u
.def
.value
5609 + bfd_get_section_vma (link_info
.output_bfd
,
5610 h
->u
.def
.section
->output_section
)
5611 + h
->u
.def
.section
->output_offset
);
5612 if (! bfd_set_start_address (link_info
.output_bfd
, val
))
5613 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol
.name
);
5620 /* We couldn't find the entry symbol. Try parsing it as a
5622 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
5625 if (! bfd_set_start_address (link_info
.output_bfd
, val
))
5626 einfo (_("%P%F: can't set start address\n"));
5632 /* Can't find the entry symbol, and it's not a number. Use
5633 the first address in the text section. */
5634 ts
= bfd_get_section_by_name (link_info
.output_bfd
, entry_section
);
5638 einfo (_("%P: warning: cannot find entry symbol %s;"
5639 " defaulting to %V\n"),
5641 bfd_get_section_vma (link_info
.output_bfd
, ts
));
5642 if (!(bfd_set_start_address
5643 (link_info
.output_bfd
,
5644 bfd_get_section_vma (link_info
.output_bfd
, ts
))))
5645 einfo (_("%P%F: can't set start address\n"));
5650 einfo (_("%P: warning: cannot find entry symbol %s;"
5651 " not setting start address\n"),
5657 /* Don't bfd_hash_table_free (&lang_definedness_table);
5658 map file output may result in a call of lang_track_definedness. */
5661 /* This is a small function used when we want to ignore errors from
5665 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED
, ...)
5667 /* Don't do anything. */
5670 /* Check that the architecture of all the input files is compatible
5671 with the output file. Also call the backend to let it do any
5672 other checking that is needed. */
5677 lang_statement_union_type
*file
;
5679 const bfd_arch_info_type
*compatible
;
5681 for (file
= file_chain
.head
; file
!= NULL
; file
= file
->input_statement
.next
)
5683 input_bfd
= file
->input_statement
.the_bfd
;
5685 = bfd_arch_get_compatible (input_bfd
, link_info
.output_bfd
,
5686 command_line
.accept_unknown_input_arch
);
5688 /* In general it is not possible to perform a relocatable
5689 link between differing object formats when the input
5690 file has relocations, because the relocations in the
5691 input format may not have equivalent representations in
5692 the output format (and besides BFD does not translate
5693 relocs for other link purposes than a final link). */
5694 if ((link_info
.relocatable
|| link_info
.emitrelocations
)
5695 && (compatible
== NULL
5696 || (bfd_get_flavour (input_bfd
)
5697 != bfd_get_flavour (link_info
.output_bfd
)))
5698 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
5700 einfo (_("%P%F: Relocatable linking with relocations from"
5701 " format %s (%B) to format %s (%B) is not supported\n"),
5702 bfd_get_target (input_bfd
), input_bfd
,
5703 bfd_get_target (link_info
.output_bfd
), link_info
.output_bfd
);
5704 /* einfo with %F exits. */
5707 if (compatible
== NULL
)
5709 if (command_line
.warn_mismatch
)
5710 einfo (_("%P%X: %s architecture of input file `%B'"
5711 " is incompatible with %s output\n"),
5712 bfd_printable_name (input_bfd
), input_bfd
,
5713 bfd_printable_name (link_info
.output_bfd
));
5715 else if (bfd_count_sections (input_bfd
))
5717 /* If the input bfd has no contents, it shouldn't set the
5718 private data of the output bfd. */
5720 bfd_error_handler_type pfn
= NULL
;
5722 /* If we aren't supposed to warn about mismatched input
5723 files, temporarily set the BFD error handler to a
5724 function which will do nothing. We still want to call
5725 bfd_merge_private_bfd_data, since it may set up
5726 information which is needed in the output file. */
5727 if (! command_line
.warn_mismatch
)
5728 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
5729 if (! bfd_merge_private_bfd_data (input_bfd
, link_info
.output_bfd
))
5731 if (command_line
.warn_mismatch
)
5732 einfo (_("%P%X: failed to merge target specific data"
5733 " of file %B\n"), input_bfd
);
5735 if (! command_line
.warn_mismatch
)
5736 bfd_set_error_handler (pfn
);
5741 /* Look through all the global common symbols and attach them to the
5742 correct section. The -sort-common command line switch may be used
5743 to roughly sort the entries by alignment. */
5748 if (command_line
.inhibit_common_definition
)
5750 if (link_info
.relocatable
5751 && ! command_line
.force_common_definition
)
5754 if (! config
.sort_common
)
5755 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
5760 if (config
.sort_common
== sort_descending
)
5762 for (power
= 4; power
> 0; power
--)
5763 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5766 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5770 for (power
= 0; power
<= 4; power
++)
5771 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5774 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5779 /* Place one common symbol in the correct section. */
5782 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
5784 unsigned int power_of_two
;
5788 if (h
->type
!= bfd_link_hash_common
)
5792 power_of_two
= h
->u
.c
.p
->alignment_power
;
5794 if (config
.sort_common
== sort_descending
5795 && power_of_two
< *(unsigned int *) info
)
5797 else if (config
.sort_common
== sort_ascending
5798 && power_of_two
> *(unsigned int *) info
)
5801 section
= h
->u
.c
.p
->section
;
5802 if (!bfd_define_common_symbol (link_info
.output_bfd
, &link_info
, h
))
5803 einfo (_("%P%F: Could not define common symbol `%T': %E\n"),
5806 if (config
.map_file
!= NULL
)
5808 static bfd_boolean header_printed
;
5813 if (! header_printed
)
5815 minfo (_("\nAllocating common symbols\n"));
5816 minfo (_("Common symbol size file\n\n"));
5817 header_printed
= TRUE
;
5820 name
= bfd_demangle (link_info
.output_bfd
, h
->root
.string
,
5821 DMGL_ANSI
| DMGL_PARAMS
);
5824 minfo ("%s", h
->root
.string
);
5825 len
= strlen (h
->root
.string
);
5830 len
= strlen (name
);
5846 if (size
<= 0xffffffff)
5847 sprintf (buf
, "%lx", (unsigned long) size
);
5849 sprintf_vma (buf
, size
);
5859 minfo ("%B\n", section
->owner
);
5865 /* Run through the input files and ensure that every input section has
5866 somewhere to go. If one is found without a destination then create
5867 an input request and place it into the statement tree. */
5870 lang_place_orphans (void)
5872 LANG_FOR_EACH_INPUT_STATEMENT (file
)
5876 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5878 if (s
->output_section
== NULL
)
5880 /* This section of the file is not attached, root
5881 around for a sensible place for it to go. */
5883 if (file
->just_syms_flag
)
5884 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
5885 else if ((s
->flags
& SEC_EXCLUDE
) != 0)
5886 s
->output_section
= bfd_abs_section_ptr
;
5887 else if (strcmp (s
->name
, "COMMON") == 0)
5889 /* This is a lonely common section which must have
5890 come from an archive. We attach to the section
5891 with the wildcard. */
5892 if (! link_info
.relocatable
5893 || command_line
.force_common_definition
)
5895 if (default_common_section
== NULL
)
5896 default_common_section
5897 = lang_output_section_statement_lookup (".bss", 0,
5899 lang_add_section (&default_common_section
->children
, s
,
5900 default_common_section
);
5905 const char *name
= s
->name
;
5908 if (config
.unique_orphan_sections
5909 || unique_section_p (s
, NULL
))
5910 constraint
= SPECIAL
;
5912 if (!ldemul_place_orphan (s
, name
, constraint
))
5914 lang_output_section_statement_type
*os
;
5915 os
= lang_output_section_statement_lookup (name
,
5918 if (os
->addr_tree
== NULL
5919 && (link_info
.relocatable
5920 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
5921 os
->addr_tree
= exp_intop (0);
5922 lang_add_section (&os
->children
, s
, os
);
5931 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
5933 flagword
*ptr_flags
;
5935 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
5941 *ptr_flags
|= SEC_ALLOC
;
5945 *ptr_flags
|= SEC_READONLY
;
5949 *ptr_flags
|= SEC_DATA
;
5953 *ptr_flags
|= SEC_CODE
;
5958 *ptr_flags
|= SEC_LOAD
;
5962 einfo (_("%P%F: invalid syntax in flags\n"));
5969 /* Call a function on each input file. This function will be called
5970 on an archive, but not on the elements. */
5973 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
5975 lang_input_statement_type
*f
;
5977 for (f
= (lang_input_statement_type
*) input_file_chain
.head
;
5979 f
= (lang_input_statement_type
*) f
->next_real_file
)
5983 /* Call a function on each file. The function will be called on all
5984 the elements of an archive which are included in the link, but will
5985 not be called on the archive file itself. */
5988 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
5990 LANG_FOR_EACH_INPUT_STATEMENT (f
)
5997 ldlang_add_file (lang_input_statement_type
*entry
)
5999 lang_statement_append (&file_chain
,
6000 (lang_statement_union_type
*) entry
,
6003 /* The BFD linker needs to have a list of all input BFDs involved in
6005 ASSERT (entry
->the_bfd
->link_next
== NULL
);
6006 ASSERT (entry
->the_bfd
!= link_info
.output_bfd
);
6008 *link_info
.input_bfds_tail
= entry
->the_bfd
;
6009 link_info
.input_bfds_tail
= &entry
->the_bfd
->link_next
;
6010 entry
->the_bfd
->usrdata
= entry
;
6011 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
6013 /* Look through the sections and check for any which should not be
6014 included in the link. We need to do this now, so that we can
6015 notice when the backend linker tries to report multiple
6016 definition errors for symbols which are in sections we aren't
6017 going to link. FIXME: It might be better to entirely ignore
6018 symbols which are defined in sections which are going to be
6019 discarded. This would require modifying the backend linker for
6020 each backend which might set the SEC_LINK_ONCE flag. If we do
6021 this, we should probably handle SEC_EXCLUDE in the same way. */
6023 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
6027 lang_add_output (const char *name
, int from_script
)
6029 /* Make -o on command line override OUTPUT in script. */
6030 if (!had_output_filename
|| !from_script
)
6032 output_filename
= name
;
6033 had_output_filename
= TRUE
;
6037 static lang_output_section_statement_type
*current_section
;
6048 for (l
= 0; l
< 32; l
++)
6050 if (i
>= (unsigned int) x
)
6058 lang_output_section_statement_type
*
6059 lang_enter_output_section_statement (const char *output_section_statement_name
,
6060 etree_type
*address_exp
,
6061 enum section_type sectype
,
6063 etree_type
*subalign
,
6067 lang_output_section_statement_type
*os
;
6069 os
= lang_output_section_statement_lookup (output_section_statement_name
,
6071 current_section
= os
;
6073 if (os
->addr_tree
== NULL
)
6075 os
->addr_tree
= address_exp
;
6077 os
->sectype
= sectype
;
6078 if (sectype
!= noload_section
)
6079 os
->flags
= SEC_NO_FLAGS
;
6081 os
->flags
= SEC_NEVER_LOAD
;
6082 os
->block_value
= 1;
6084 /* Make next things chain into subchain of this. */
6085 push_stat_ptr (&os
->children
);
6087 os
->subsection_alignment
=
6088 topower (exp_get_value_int (subalign
, -1, "subsection alignment"));
6089 os
->section_alignment
=
6090 topower (exp_get_value_int (align
, -1, "section alignment"));
6092 os
->load_base
= ebase
;
6099 lang_output_statement_type
*new_stmt
;
6101 new_stmt
= new_stat (lang_output_statement
, stat_ptr
);
6102 new_stmt
->name
= output_filename
;
6106 /* Reset the current counters in the regions. */
6109 lang_reset_memory_regions (void)
6111 lang_memory_region_type
*p
= lang_memory_region_list
;
6113 lang_output_section_statement_type
*os
;
6115 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
6117 p
->current
= p
->origin
;
6121 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6125 os
->processed_vma
= FALSE
;
6126 os
->processed_lma
= FALSE
;
6129 for (o
= link_info
.output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
6131 /* Save the last size for possible use by bfd_relax_section. */
6132 o
->rawsize
= o
->size
;
6137 /* Worker for lang_gc_sections_1. */
6140 gc_section_callback (lang_wild_statement_type
*ptr
,
6141 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6143 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6144 void *data ATTRIBUTE_UNUSED
)
6146 /* If the wild pattern was marked KEEP, the member sections
6147 should be as well. */
6148 if (ptr
->keep_sections
)
6149 section
->flags
|= SEC_KEEP
;
6152 /* Iterate over sections marking them against GC. */
6155 lang_gc_sections_1 (lang_statement_union_type
*s
)
6157 for (; s
!= NULL
; s
= s
->header
.next
)
6159 switch (s
->header
.type
)
6161 case lang_wild_statement_enum
:
6162 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
6164 case lang_constructors_statement_enum
:
6165 lang_gc_sections_1 (constructor_list
.head
);
6167 case lang_output_section_statement_enum
:
6168 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
6170 case lang_group_statement_enum
:
6171 lang_gc_sections_1 (s
->group_statement
.children
.head
);
6180 lang_gc_sections (void)
6182 /* Keep all sections so marked in the link script. */
6184 lang_gc_sections_1 (statement_list
.head
);
6186 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
6187 the special case of debug info. (See bfd/stabs.c)
6188 Twiddle the flag here, to simplify later linker code. */
6189 if (link_info
.relocatable
)
6191 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6194 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
6195 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
6196 sec
->flags
&= ~SEC_EXCLUDE
;
6200 if (link_info
.gc_sections
)
6201 bfd_gc_sections (link_info
.output_bfd
, &link_info
);
6204 /* Worker for lang_find_relro_sections_1. */
6207 find_relro_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
6208 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6210 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6213 /* Discarded, excluded and ignored sections effectively have zero
6215 if (section
->output_section
!= NULL
6216 && section
->output_section
->owner
== link_info
.output_bfd
6217 && (section
->output_section
->flags
& SEC_EXCLUDE
) == 0
6218 && !IGNORE_SECTION (section
)
6219 && section
->size
!= 0)
6221 bfd_boolean
*has_relro_section
= (bfd_boolean
*) data
;
6222 *has_relro_section
= TRUE
;
6226 /* Iterate over sections for relro sections. */
6229 lang_find_relro_sections_1 (lang_statement_union_type
*s
,
6230 bfd_boolean
*has_relro_section
)
6232 if (*has_relro_section
)
6235 for (; s
!= NULL
; s
= s
->header
.next
)
6237 if (s
== expld
.dataseg
.relro_end_stat
)
6240 switch (s
->header
.type
)
6242 case lang_wild_statement_enum
:
6243 walk_wild (&s
->wild_statement
,
6244 find_relro_section_callback
,
6247 case lang_constructors_statement_enum
:
6248 lang_find_relro_sections_1 (constructor_list
.head
,
6251 case lang_output_section_statement_enum
:
6252 lang_find_relro_sections_1 (s
->output_section_statement
.children
.head
,
6255 case lang_group_statement_enum
:
6256 lang_find_relro_sections_1 (s
->group_statement
.children
.head
,
6266 lang_find_relro_sections (void)
6268 bfd_boolean has_relro_section
= FALSE
;
6270 /* Check all sections in the link script. */
6272 lang_find_relro_sections_1 (expld
.dataseg
.relro_start_stat
,
6273 &has_relro_section
);
6275 if (!has_relro_section
)
6276 link_info
.relro
= FALSE
;
6279 /* Relax all sections until bfd_relax_section gives up. */
6282 lang_relax_sections (bfd_boolean need_layout
)
6284 if (RELAXATION_ENABLED
)
6286 /* We may need more than one relaxation pass. */
6287 int i
= link_info
.relax_pass
;
6289 /* The backend can use it to determine the current pass. */
6290 link_info
.relax_pass
= 0;
6294 /* Keep relaxing until bfd_relax_section gives up. */
6295 bfd_boolean relax_again
;
6297 link_info
.relax_trip
= -1;
6300 link_info
.relax_trip
++;
6302 /* Note: pe-dll.c does something like this also. If you find
6303 you need to change this code, you probably need to change
6304 pe-dll.c also. DJ */
6306 /* Do all the assignments with our current guesses as to
6308 lang_do_assignments ();
6310 /* We must do this after lang_do_assignments, because it uses
6312 lang_reset_memory_regions ();
6314 /* Perform another relax pass - this time we know where the
6315 globals are, so can make a better guess. */
6316 relax_again
= FALSE
;
6317 lang_size_sections (&relax_again
, FALSE
);
6319 while (relax_again
);
6321 link_info
.relax_pass
++;
6328 /* Final extra sizing to report errors. */
6329 lang_do_assignments ();
6330 lang_reset_memory_regions ();
6331 lang_size_sections (NULL
, TRUE
);
6338 /* Finalize dynamic list. */
6339 if (link_info
.dynamic_list
)
6340 lang_finalize_version_expr_head (&link_info
.dynamic_list
->head
);
6342 current_target
= default_target
;
6344 /* Open the output file. */
6345 lang_for_each_statement (ldlang_open_output
);
6348 ldemul_create_output_section_statements ();
6350 /* Add to the hash table all undefineds on the command line. */
6351 lang_place_undefineds ();
6353 if (!bfd_section_already_linked_table_init ())
6354 einfo (_("%P%F: Failed to create hash table\n"));
6356 /* Create a bfd for each input file. */
6357 current_target
= default_target
;
6358 open_input_bfds (statement_list
.head
, FALSE
);
6360 #ifdef ENABLE_PLUGINS
6362 union lang_statement_union
**listend
;
6363 /* Now all files are read, let the plugin(s) decide if there
6364 are any more to be added to the link before we call the
6365 emulation's after_open hook. */
6366 listend
= statement_list
.tail
;
6368 if (plugin_call_all_symbols_read ())
6369 einfo (_("%P%F: %s: plugin reported error after all symbols read\n"),
6370 plugin_error_plugin ());
6371 /* If any new files were added, they will be on the end of the
6372 statement list, and we can open them now by getting open_input_bfds
6373 to carry on from where it ended last time. */
6375 open_input_bfds (*listend
, FALSE
);
6377 #endif /* ENABLE_PLUGINS */
6379 link_info
.gc_sym_list
= &entry_symbol
;
6380 if (entry_symbol
.name
== NULL
)
6381 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
6383 ldemul_after_open ();
6385 bfd_section_already_linked_table_free ();
6387 /* Make sure that we're not mixing architectures. We call this
6388 after all the input files have been opened, but before we do any
6389 other processing, so that any operations merge_private_bfd_data
6390 does on the output file will be known during the rest of the
6394 /* Handle .exports instead of a version script if we're told to do so. */
6395 if (command_line
.version_exports_section
)
6396 lang_do_version_exports_section ();
6398 /* Build all sets based on the information gathered from the input
6400 ldctor_build_sets ();
6402 /* Remove unreferenced sections if asked to. */
6403 lang_gc_sections ();
6405 /* Size up the common data. */
6408 /* Update wild statements. */
6409 update_wild_statements (statement_list
.head
);
6411 /* Run through the contours of the script and attach input sections
6412 to the correct output sections. */
6413 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
6415 process_insert_statements ();
6417 /* Find any sections not attached explicitly and handle them. */
6418 lang_place_orphans ();
6420 if (! link_info
.relocatable
)
6424 /* Merge SEC_MERGE sections. This has to be done after GC of
6425 sections, so that GCed sections are not merged, but before
6426 assigning dynamic symbols, since removing whole input sections
6428 bfd_merge_sections (link_info
.output_bfd
, &link_info
);
6430 /* Look for a text section and set the readonly attribute in it. */
6431 found
= bfd_get_section_by_name (link_info
.output_bfd
, ".text");
6435 if (config
.text_read_only
)
6436 found
->flags
|= SEC_READONLY
;
6438 found
->flags
&= ~SEC_READONLY
;
6442 /* Do anything special before sizing sections. This is where ELF
6443 and other back-ends size dynamic sections. */
6444 ldemul_before_allocation ();
6446 /* We must record the program headers before we try to fix the
6447 section positions, since they will affect SIZEOF_HEADERS. */
6448 lang_record_phdrs ();
6450 /* Check relro sections. */
6451 if (link_info
.relro
&& ! link_info
.relocatable
)
6452 lang_find_relro_sections ();
6454 /* Size up the sections. */
6455 lang_size_sections (NULL
, ! RELAXATION_ENABLED
);
6457 /* See if anything special should be done now we know how big
6458 everything is. This is where relaxation is done. */
6459 ldemul_after_allocation ();
6461 /* Fix any .startof. or .sizeof. symbols. */
6462 lang_set_startof ();
6464 /* Do all the assignments, now that we know the final resting places
6465 of all the symbols. */
6467 lang_do_assignments ();
6471 /* Make sure that the section addresses make sense. */
6472 if (command_line
.check_section_addresses
)
6473 lang_check_section_addresses ();
6478 /* EXPORTED TO YACC */
6481 lang_add_wild (struct wildcard_spec
*filespec
,
6482 struct wildcard_list
*section_list
,
6483 bfd_boolean keep_sections
)
6485 struct wildcard_list
*curr
, *next
;
6486 lang_wild_statement_type
*new_stmt
;
6488 /* Reverse the list as the parser puts it back to front. */
6489 for (curr
= section_list
, section_list
= NULL
;
6491 section_list
= curr
, curr
= next
)
6493 if (curr
->spec
.name
!= NULL
&& strcmp (curr
->spec
.name
, "COMMON") == 0)
6494 placed_commons
= TRUE
;
6497 curr
->next
= section_list
;
6500 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
6502 if (strcmp (filespec
->name
, "*") == 0)
6503 filespec
->name
= NULL
;
6504 else if (! wildcardp (filespec
->name
))
6505 lang_has_input_file
= TRUE
;
6508 new_stmt
= new_stat (lang_wild_statement
, stat_ptr
);
6509 new_stmt
->filename
= NULL
;
6510 new_stmt
->filenames_sorted
= FALSE
;
6511 if (filespec
!= NULL
)
6513 new_stmt
->filename
= filespec
->name
;
6514 new_stmt
->filenames_sorted
= filespec
->sorted
== by_name
;
6516 new_stmt
->section_list
= section_list
;
6517 new_stmt
->keep_sections
= keep_sections
;
6518 lang_list_init (&new_stmt
->children
);
6519 analyze_walk_wild_section_handler (new_stmt
);
6523 lang_section_start (const char *name
, etree_type
*address
,
6524 const segment_type
*segment
)
6526 lang_address_statement_type
*ad
;
6528 ad
= new_stat (lang_address_statement
, stat_ptr
);
6529 ad
->section_name
= name
;
6530 ad
->address
= address
;
6531 ad
->segment
= segment
;
6534 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
6535 because of a -e argument on the command line, or zero if this is
6536 called by ENTRY in a linker script. Command line arguments take
6540 lang_add_entry (const char *name
, bfd_boolean cmdline
)
6542 if (entry_symbol
.name
== NULL
6544 || ! entry_from_cmdline
)
6546 entry_symbol
.name
= name
;
6547 entry_from_cmdline
= cmdline
;
6551 /* Set the default start symbol to NAME. .em files should use this,
6552 not lang_add_entry, to override the use of "start" if neither the
6553 linker script nor the command line specifies an entry point. NAME
6554 must be permanently allocated. */
6556 lang_default_entry (const char *name
)
6558 entry_symbol_default
= name
;
6562 lang_add_target (const char *name
)
6564 lang_target_statement_type
*new_stmt
;
6566 new_stmt
= new_stat (lang_target_statement
, stat_ptr
);
6567 new_stmt
->target
= name
;
6571 lang_add_map (const char *name
)
6578 map_option_f
= TRUE
;
6586 lang_add_fill (fill_type
*fill
)
6588 lang_fill_statement_type
*new_stmt
;
6590 new_stmt
= new_stat (lang_fill_statement
, stat_ptr
);
6591 new_stmt
->fill
= fill
;
6595 lang_add_data (int type
, union etree_union
*exp
)
6597 lang_data_statement_type
*new_stmt
;
6599 new_stmt
= new_stat (lang_data_statement
, stat_ptr
);
6600 new_stmt
->exp
= exp
;
6601 new_stmt
->type
= type
;
6604 /* Create a new reloc statement. RELOC is the BFD relocation type to
6605 generate. HOWTO is the corresponding howto structure (we could
6606 look this up, but the caller has already done so). SECTION is the
6607 section to generate a reloc against, or NAME is the name of the
6608 symbol to generate a reloc against. Exactly one of SECTION and
6609 NAME must be NULL. ADDEND is an expression for the addend. */
6612 lang_add_reloc (bfd_reloc_code_real_type reloc
,
6613 reloc_howto_type
*howto
,
6616 union etree_union
*addend
)
6618 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
6622 p
->section
= section
;
6624 p
->addend_exp
= addend
;
6626 p
->addend_value
= 0;
6627 p
->output_section
= NULL
;
6628 p
->output_offset
= 0;
6631 lang_assignment_statement_type
*
6632 lang_add_assignment (etree_type
*exp
)
6634 lang_assignment_statement_type
*new_stmt
;
6636 new_stmt
= new_stat (lang_assignment_statement
, stat_ptr
);
6637 new_stmt
->exp
= exp
;
6642 lang_add_attribute (enum statement_enum attribute
)
6644 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
6648 lang_startup (const char *name
)
6650 if (startup_file
!= NULL
)
6652 einfo (_("%P%F: multiple STARTUP files\n"));
6654 first_file
->filename
= name
;
6655 first_file
->local_sym_name
= name
;
6656 first_file
->real
= TRUE
;
6658 startup_file
= name
;
6662 lang_float (bfd_boolean maybe
)
6664 lang_float_flag
= maybe
;
6668 /* Work out the load- and run-time regions from a script statement, and
6669 store them in *LMA_REGION and *REGION respectively.
6671 MEMSPEC is the name of the run-time region, or the value of
6672 DEFAULT_MEMORY_REGION if the statement didn't specify one.
6673 LMA_MEMSPEC is the name of the load-time region, or null if the
6674 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
6675 had an explicit load address.
6677 It is an error to specify both a load region and a load address. */
6680 lang_get_regions (lang_memory_region_type
**region
,
6681 lang_memory_region_type
**lma_region
,
6682 const char *memspec
,
6683 const char *lma_memspec
,
6684 bfd_boolean have_lma
,
6685 bfd_boolean have_vma
)
6687 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
6689 /* If no runtime region or VMA has been specified, but the load region
6690 has been specified, then use the load region for the runtime region
6692 if (lma_memspec
!= NULL
6694 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
6695 *region
= *lma_region
;
6697 *region
= lang_memory_region_lookup (memspec
, FALSE
);
6699 if (have_lma
&& lma_memspec
!= 0)
6700 einfo (_("%X%P:%S: section has both a load address and a load region\n"));
6704 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
6705 lang_output_section_phdr_list
*phdrs
,
6706 const char *lma_memspec
)
6708 lang_get_regions (¤t_section
->region
,
6709 ¤t_section
->lma_region
,
6710 memspec
, lma_memspec
,
6711 current_section
->load_base
!= NULL
,
6712 current_section
->addr_tree
!= NULL
);
6714 /* If this section has no load region or base, but has the same
6715 region as the previous section, then propagate the previous
6716 section's load region. */
6718 if (!current_section
->lma_region
&& !current_section
->load_base
6719 && current_section
->region
== current_section
->prev
->region
)
6720 current_section
->lma_region
= current_section
->prev
->lma_region
;
6722 current_section
->fill
= fill
;
6723 current_section
->phdrs
= phdrs
;
6727 /* Create an absolute symbol with the given name with the value of the
6728 address of first byte of the section named.
6730 If the symbol already exists, then do nothing. */
6733 lang_abs_symbol_at_beginning_of (const char *secname
, const char *name
)
6735 struct bfd_link_hash_entry
*h
;
6737 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
6739 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
6741 if (h
->type
== bfd_link_hash_new
6742 || h
->type
== bfd_link_hash_undefined
)
6746 h
->type
= bfd_link_hash_defined
;
6748 sec
= bfd_get_section_by_name (link_info
.output_bfd
, secname
);
6752 h
->u
.def
.value
= bfd_get_section_vma (link_info
.output_bfd
, sec
);
6754 h
->u
.def
.section
= bfd_abs_section_ptr
;
6758 /* Create an absolute symbol with the given name with the value of the
6759 address of the first byte after the end of the section named.
6761 If the symbol already exists, then do nothing. */
6764 lang_abs_symbol_at_end_of (const char *secname
, const char *name
)
6766 struct bfd_link_hash_entry
*h
;
6768 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
6770 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
6772 if (h
->type
== bfd_link_hash_new
6773 || h
->type
== bfd_link_hash_undefined
)
6777 h
->type
= bfd_link_hash_defined
;
6779 sec
= bfd_get_section_by_name (link_info
.output_bfd
, secname
);
6783 h
->u
.def
.value
= (bfd_get_section_vma (link_info
.output_bfd
, sec
)
6784 + TO_ADDR (sec
->size
));
6786 h
->u
.def
.section
= bfd_abs_section_ptr
;
6791 lang_statement_append (lang_statement_list_type
*list
,
6792 lang_statement_union_type
*element
,
6793 lang_statement_union_type
**field
)
6795 *(list
->tail
) = element
;
6799 /* Set the output format type. -oformat overrides scripts. */
6802 lang_add_output_format (const char *format
,
6807 if (output_target
== NULL
|| !from_script
)
6809 if (command_line
.endian
== ENDIAN_BIG
6812 else if (command_line
.endian
== ENDIAN_LITTLE
6816 output_target
= format
;
6821 lang_add_insert (const char *where
, int is_before
)
6823 lang_insert_statement_type
*new_stmt
;
6825 new_stmt
= new_stat (lang_insert_statement
, stat_ptr
);
6826 new_stmt
->where
= where
;
6827 new_stmt
->is_before
= is_before
;
6828 saved_script_handle
= previous_script_handle
;
6831 /* Enter a group. This creates a new lang_group_statement, and sets
6832 stat_ptr to build new statements within the group. */
6835 lang_enter_group (void)
6837 lang_group_statement_type
*g
;
6839 g
= new_stat (lang_group_statement
, stat_ptr
);
6840 lang_list_init (&g
->children
);
6841 push_stat_ptr (&g
->children
);
6844 /* Leave a group. This just resets stat_ptr to start writing to the
6845 regular list of statements again. Note that this will not work if
6846 groups can occur inside anything else which can adjust stat_ptr,
6847 but currently they can't. */
6850 lang_leave_group (void)
6855 /* Add a new program header. This is called for each entry in a PHDRS
6856 command in a linker script. */
6859 lang_new_phdr (const char *name
,
6861 bfd_boolean filehdr
,
6866 struct lang_phdr
*n
, **pp
;
6869 n
= (struct lang_phdr
*) stat_alloc (sizeof (struct lang_phdr
));
6872 n
->type
= exp_get_value_int (type
, 0, "program header type");
6873 n
->filehdr
= filehdr
;
6878 hdrs
= n
->type
== 1 && (phdrs
|| filehdr
);
6880 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
6883 && !((*pp
)->filehdr
|| (*pp
)->phdrs
))
6885 einfo (_("%X%P:%S: PHDRS and FILEHDR are not supported when prior PT_LOAD headers lack them\n"));
6892 /* Record the program header information in the output BFD. FIXME: We
6893 should not be calling an ELF specific function here. */
6896 lang_record_phdrs (void)
6900 lang_output_section_phdr_list
*last
;
6901 struct lang_phdr
*l
;
6902 lang_output_section_statement_type
*os
;
6905 secs
= (asection
**) xmalloc (alc
* sizeof (asection
*));
6908 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
6915 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6919 lang_output_section_phdr_list
*pl
;
6921 if (os
->constraint
< 0)
6929 if (os
->sectype
== noload_section
6930 || os
->bfd_section
== NULL
6931 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
6934 /* Don't add orphans to PT_INTERP header. */
6940 lang_output_section_statement_type
* tmp_os
;
6942 /* If we have not run across a section with a program
6943 header assigned to it yet, then scan forwards to find
6944 one. This prevents inconsistencies in the linker's
6945 behaviour when a script has specified just a single
6946 header and there are sections in that script which are
6947 not assigned to it, and which occur before the first
6948 use of that header. See here for more details:
6949 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
6950 for (tmp_os
= os
; tmp_os
; tmp_os
= tmp_os
->next
)
6953 last
= tmp_os
->phdrs
;
6957 einfo (_("%F%P: no sections assigned to phdrs\n"));
6962 if (os
->bfd_section
== NULL
)
6965 for (; pl
!= NULL
; pl
= pl
->next
)
6967 if (strcmp (pl
->name
, l
->name
) == 0)
6972 secs
= (asection
**) xrealloc (secs
,
6973 alc
* sizeof (asection
*));
6975 secs
[c
] = os
->bfd_section
;
6982 if (l
->flags
== NULL
)
6985 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
6990 at
= exp_get_vma (l
->at
, 0, "phdr load address");
6992 if (! bfd_record_phdr (link_info
.output_bfd
, l
->type
,
6993 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
6994 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
6995 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
7000 /* Make sure all the phdr assignments succeeded. */
7001 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7005 lang_output_section_phdr_list
*pl
;
7007 if (os
->constraint
< 0
7008 || os
->bfd_section
== NULL
)
7011 for (pl
= os
->phdrs
;
7014 if (! pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
7015 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
7016 os
->name
, pl
->name
);
7020 /* Record a list of sections which may not be cross referenced. */
7023 lang_add_nocrossref (lang_nocrossref_type
*l
)
7025 struct lang_nocrossrefs
*n
;
7027 n
= (struct lang_nocrossrefs
*) xmalloc (sizeof *n
);
7028 n
->next
= nocrossref_list
;
7030 nocrossref_list
= n
;
7032 /* Set notice_all so that we get informed about all symbols. */
7033 link_info
.notice_all
= TRUE
;
7036 /* Overlay handling. We handle overlays with some static variables. */
7038 /* The overlay virtual address. */
7039 static etree_type
*overlay_vma
;
7040 /* And subsection alignment. */
7041 static etree_type
*overlay_subalign
;
7043 /* An expression for the maximum section size seen so far. */
7044 static etree_type
*overlay_max
;
7046 /* A list of all the sections in this overlay. */
7048 struct overlay_list
{
7049 struct overlay_list
*next
;
7050 lang_output_section_statement_type
*os
;
7053 static struct overlay_list
*overlay_list
;
7055 /* Start handling an overlay. */
7058 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
7060 /* The grammar should prevent nested overlays from occurring. */
7061 ASSERT (overlay_vma
== NULL
7062 && overlay_subalign
== NULL
7063 && overlay_max
== NULL
);
7065 overlay_vma
= vma_expr
;
7066 overlay_subalign
= subalign
;
7069 /* Start a section in an overlay. We handle this by calling
7070 lang_enter_output_section_statement with the correct VMA.
7071 lang_leave_overlay sets up the LMA and memory regions. */
7074 lang_enter_overlay_section (const char *name
)
7076 struct overlay_list
*n
;
7079 lang_enter_output_section_statement (name
, overlay_vma
, overlay_section
,
7080 0, overlay_subalign
, 0, 0);
7082 /* If this is the first section, then base the VMA of future
7083 sections on this one. This will work correctly even if `.' is
7084 used in the addresses. */
7085 if (overlay_list
== NULL
)
7086 overlay_vma
= exp_nameop (ADDR
, name
);
7088 /* Remember the section. */
7089 n
= (struct overlay_list
*) xmalloc (sizeof *n
);
7090 n
->os
= current_section
;
7091 n
->next
= overlay_list
;
7094 size
= exp_nameop (SIZEOF
, name
);
7096 /* Arrange to work out the maximum section end address. */
7097 if (overlay_max
== NULL
)
7100 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
7103 /* Finish a section in an overlay. There isn't any special to do
7107 lang_leave_overlay_section (fill_type
*fill
,
7108 lang_output_section_phdr_list
*phdrs
)
7115 name
= current_section
->name
;
7117 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
7118 region and that no load-time region has been specified. It doesn't
7119 really matter what we say here, since lang_leave_overlay will
7121 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
7123 /* Define the magic symbols. */
7125 clean
= (char *) xmalloc (strlen (name
) + 1);
7127 for (s1
= name
; *s1
!= '\0'; s1
++)
7128 if (ISALNUM (*s1
) || *s1
== '_')
7132 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_start_");
7133 sprintf (buf
, "__load_start_%s", clean
);
7134 lang_add_assignment (exp_provide (buf
,
7135 exp_nameop (LOADADDR
, name
),
7138 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_stop_");
7139 sprintf (buf
, "__load_stop_%s", clean
);
7140 lang_add_assignment (exp_provide (buf
,
7142 exp_nameop (LOADADDR
, name
),
7143 exp_nameop (SIZEOF
, name
)),
7149 /* Finish an overlay. If there are any overlay wide settings, this
7150 looks through all the sections in the overlay and sets them. */
7153 lang_leave_overlay (etree_type
*lma_expr
,
7156 const char *memspec
,
7157 lang_output_section_phdr_list
*phdrs
,
7158 const char *lma_memspec
)
7160 lang_memory_region_type
*region
;
7161 lang_memory_region_type
*lma_region
;
7162 struct overlay_list
*l
;
7163 lang_nocrossref_type
*nocrossref
;
7165 lang_get_regions (®ion
, &lma_region
,
7166 memspec
, lma_memspec
,
7167 lma_expr
!= NULL
, FALSE
);
7171 /* After setting the size of the last section, set '.' to end of the
7173 if (overlay_list
!= NULL
)
7174 overlay_list
->os
->update_dot_tree
7175 = exp_assop ('=', ".", exp_binop ('+', overlay_vma
, overlay_max
));
7180 struct overlay_list
*next
;
7182 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
7185 l
->os
->region
= region
;
7186 l
->os
->lma_region
= lma_region
;
7188 /* The first section has the load address specified in the
7189 OVERLAY statement. The rest are worked out from that.
7190 The base address is not needed (and should be null) if
7191 an LMA region was specified. */
7194 l
->os
->load_base
= lma_expr
;
7195 l
->os
->sectype
= normal_section
;
7197 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
7198 l
->os
->phdrs
= phdrs
;
7202 lang_nocrossref_type
*nc
;
7204 nc
= (lang_nocrossref_type
*) xmalloc (sizeof *nc
);
7205 nc
->name
= l
->os
->name
;
7206 nc
->next
= nocrossref
;
7215 if (nocrossref
!= NULL
)
7216 lang_add_nocrossref (nocrossref
);
7219 overlay_list
= NULL
;
7223 /* Version handling. This is only useful for ELF. */
7225 /* This global variable holds the version tree that we build. */
7227 struct bfd_elf_version_tree
*lang_elf_version_info
;
7229 /* If PREV is NULL, return first version pattern matching particular symbol.
7230 If PREV is non-NULL, return first version pattern matching particular
7231 symbol after PREV (previously returned by lang_vers_match). */
7233 static struct bfd_elf_version_expr
*
7234 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
7235 struct bfd_elf_version_expr
*prev
,
7238 const char *cxx_sym
= sym
;
7239 const char *java_sym
= sym
;
7240 struct bfd_elf_version_expr
*expr
= NULL
;
7242 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
7244 cxx_sym
= cplus_demangle (sym
, DMGL_PARAMS
| DMGL_ANSI
);
7248 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
7250 java_sym
= cplus_demangle (sym
, DMGL_JAVA
);
7255 if (head
->htab
&& (prev
== NULL
|| prev
->literal
))
7257 struct bfd_elf_version_expr e
;
7259 switch (prev
? prev
->mask
: 0)
7262 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
7265 expr
= (struct bfd_elf_version_expr
*)
7266 htab_find ((htab_t
) head
->htab
, &e
);
7267 while (expr
&& strcmp (expr
->pattern
, sym
) == 0)
7268 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
7274 case BFD_ELF_VERSION_C_TYPE
:
7275 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
7277 e
.pattern
= cxx_sym
;
7278 expr
= (struct bfd_elf_version_expr
*)
7279 htab_find ((htab_t
) head
->htab
, &e
);
7280 while (expr
&& strcmp (expr
->pattern
, cxx_sym
) == 0)
7281 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
7287 case BFD_ELF_VERSION_CXX_TYPE
:
7288 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
7290 e
.pattern
= java_sym
;
7291 expr
= (struct bfd_elf_version_expr
*)
7292 htab_find ((htab_t
) head
->htab
, &e
);
7293 while (expr
&& strcmp (expr
->pattern
, java_sym
) == 0)
7294 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7305 /* Finally, try the wildcards. */
7306 if (prev
== NULL
|| prev
->literal
)
7307 expr
= head
->remaining
;
7310 for (; expr
; expr
= expr
->next
)
7317 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
7320 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7322 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
7326 if (fnmatch (expr
->pattern
, s
, 0) == 0)
7332 free ((char *) cxx_sym
);
7333 if (java_sym
!= sym
)
7334 free ((char *) java_sym
);
7338 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
7339 return a pointer to the symbol name with any backslash quotes removed. */
7342 realsymbol (const char *pattern
)
7345 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
7346 char *s
, *symbol
= (char *) xmalloc (strlen (pattern
) + 1);
7348 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
7350 /* It is a glob pattern only if there is no preceding
7354 /* Remove the preceding backslash. */
7361 if (*p
== '?' || *p
== '*' || *p
== '[')
7368 backslash
= *p
== '\\';
7384 /* This is called for each variable name or match expression. NEW_NAME is
7385 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
7386 pattern to be matched against symbol names. */
7388 struct bfd_elf_version_expr
*
7389 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
7390 const char *new_name
,
7392 bfd_boolean literal_p
)
7394 struct bfd_elf_version_expr
*ret
;
7396 ret
= (struct bfd_elf_version_expr
*) xmalloc (sizeof *ret
);
7400 ret
->literal
= TRUE
;
7401 ret
->pattern
= literal_p
? new_name
: realsymbol (new_name
);
7402 if (ret
->pattern
== NULL
)
7404 ret
->pattern
= new_name
;
7405 ret
->literal
= FALSE
;
7408 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
7409 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7410 else if (strcasecmp (lang
, "C++") == 0)
7411 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
7412 else if (strcasecmp (lang
, "Java") == 0)
7413 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
7416 einfo (_("%X%P: unknown language `%s' in version information\n"),
7418 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7421 return ldemul_new_vers_pattern (ret
);
7424 /* This is called for each set of variable names and match
7427 struct bfd_elf_version_tree
*
7428 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
7429 struct bfd_elf_version_expr
*locals
)
7431 struct bfd_elf_version_tree
*ret
;
7433 ret
= (struct bfd_elf_version_tree
*) xcalloc (1, sizeof *ret
);
7434 ret
->globals
.list
= globals
;
7435 ret
->locals
.list
= locals
;
7436 ret
->match
= lang_vers_match
;
7437 ret
->name_indx
= (unsigned int) -1;
7441 /* This static variable keeps track of version indices. */
7443 static int version_index
;
7446 version_expr_head_hash (const void *p
)
7448 const struct bfd_elf_version_expr
*e
=
7449 (const struct bfd_elf_version_expr
*) p
;
7451 return htab_hash_string (e
->pattern
);
7455 version_expr_head_eq (const void *p1
, const void *p2
)
7457 const struct bfd_elf_version_expr
*e1
=
7458 (const struct bfd_elf_version_expr
*) p1
;
7459 const struct bfd_elf_version_expr
*e2
=
7460 (const struct bfd_elf_version_expr
*) p2
;
7462 return strcmp (e1
->pattern
, e2
->pattern
) == 0;
7466 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
7469 struct bfd_elf_version_expr
*e
, *next
;
7470 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
7472 for (e
= head
->list
; e
; e
= e
->next
)
7476 head
->mask
|= e
->mask
;
7481 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
7482 version_expr_head_eq
, NULL
);
7483 list_loc
= &head
->list
;
7484 remaining_loc
= &head
->remaining
;
7485 for (e
= head
->list
; e
; e
= next
)
7491 remaining_loc
= &e
->next
;
7495 void **loc
= htab_find_slot ((htab_t
) head
->htab
, e
, INSERT
);
7499 struct bfd_elf_version_expr
*e1
, *last
;
7501 e1
= (struct bfd_elf_version_expr
*) *loc
;
7505 if (e1
->mask
== e
->mask
)
7513 while (e1
&& strcmp (e1
->pattern
, e
->pattern
) == 0);
7517 /* This is a duplicate. */
7518 /* FIXME: Memory leak. Sometimes pattern is not
7519 xmalloced alone, but in larger chunk of memory. */
7520 /* free (e->pattern); */
7525 e
->next
= last
->next
;
7533 list_loc
= &e
->next
;
7537 *remaining_loc
= NULL
;
7538 *list_loc
= head
->remaining
;
7541 head
->remaining
= head
->list
;
7544 /* This is called when we know the name and dependencies of the
7548 lang_register_vers_node (const char *name
,
7549 struct bfd_elf_version_tree
*version
,
7550 struct bfd_elf_version_deps
*deps
)
7552 struct bfd_elf_version_tree
*t
, **pp
;
7553 struct bfd_elf_version_expr
*e1
;
7558 if ((name
[0] == '\0' && lang_elf_version_info
!= NULL
)
7559 || (lang_elf_version_info
&& lang_elf_version_info
->name
[0] == '\0'))
7561 einfo (_("%X%P: anonymous version tag cannot be combined"
7562 " with other version tags\n"));
7567 /* Make sure this node has a unique name. */
7568 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
7569 if (strcmp (t
->name
, name
) == 0)
7570 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
7572 lang_finalize_version_expr_head (&version
->globals
);
7573 lang_finalize_version_expr_head (&version
->locals
);
7575 /* Check the global and local match names, and make sure there
7576 aren't any duplicates. */
7578 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
7580 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
7582 struct bfd_elf_version_expr
*e2
;
7584 if (t
->locals
.htab
&& e1
->literal
)
7586 e2
= (struct bfd_elf_version_expr
*)
7587 htab_find ((htab_t
) t
->locals
.htab
, e1
);
7588 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
7590 if (e1
->mask
== e2
->mask
)
7591 einfo (_("%X%P: duplicate expression `%s'"
7592 " in version information\n"), e1
->pattern
);
7596 else if (!e1
->literal
)
7597 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
7598 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
7599 && e1
->mask
== e2
->mask
)
7600 einfo (_("%X%P: duplicate expression `%s'"
7601 " in version information\n"), e1
->pattern
);
7605 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
7607 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
7609 struct bfd_elf_version_expr
*e2
;
7611 if (t
->globals
.htab
&& e1
->literal
)
7613 e2
= (struct bfd_elf_version_expr
*)
7614 htab_find ((htab_t
) t
->globals
.htab
, e1
);
7615 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
7617 if (e1
->mask
== e2
->mask
)
7618 einfo (_("%X%P: duplicate expression `%s'"
7619 " in version information\n"),
7624 else if (!e1
->literal
)
7625 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
7626 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
7627 && e1
->mask
== e2
->mask
)
7628 einfo (_("%X%P: duplicate expression `%s'"
7629 " in version information\n"), e1
->pattern
);
7633 version
->deps
= deps
;
7634 version
->name
= name
;
7635 if (name
[0] != '\0')
7638 version
->vernum
= version_index
;
7641 version
->vernum
= 0;
7643 for (pp
= &lang_elf_version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
7648 /* This is called when we see a version dependency. */
7650 struct bfd_elf_version_deps
*
7651 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
7653 struct bfd_elf_version_deps
*ret
;
7654 struct bfd_elf_version_tree
*t
;
7656 ret
= (struct bfd_elf_version_deps
*) xmalloc (sizeof *ret
);
7659 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
7661 if (strcmp (t
->name
, name
) == 0)
7663 ret
->version_needed
= t
;
7668 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
7670 ret
->version_needed
= NULL
;
7675 lang_do_version_exports_section (void)
7677 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
7679 LANG_FOR_EACH_INPUT_STATEMENT (is
)
7681 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
7689 contents
= (char *) xmalloc (len
);
7690 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
7691 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
7694 while (p
< contents
+ len
)
7696 greg
= lang_new_vers_pattern (greg
, p
, NULL
, FALSE
);
7697 p
= strchr (p
, '\0') + 1;
7700 /* Do not free the contents, as we used them creating the regex. */
7702 /* Do not include this section in the link. */
7703 sec
->flags
|= SEC_EXCLUDE
| SEC_KEEP
;
7706 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, FALSE
);
7707 lang_register_vers_node (command_line
.version_exports_section
,
7708 lang_new_vers_node (greg
, lreg
), NULL
);
7712 lang_add_unique (const char *name
)
7714 struct unique_sections
*ent
;
7716 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
7717 if (strcmp (ent
->name
, name
) == 0)
7720 ent
= (struct unique_sections
*) xmalloc (sizeof *ent
);
7721 ent
->name
= xstrdup (name
);
7722 ent
->next
= unique_section_list
;
7723 unique_section_list
= ent
;
7726 /* Append the list of dynamic symbols to the existing one. */
7729 lang_append_dynamic_list (struct bfd_elf_version_expr
*dynamic
)
7731 if (link_info
.dynamic_list
)
7733 struct bfd_elf_version_expr
*tail
;
7734 for (tail
= dynamic
; tail
->next
!= NULL
; tail
= tail
->next
)
7736 tail
->next
= link_info
.dynamic_list
->head
.list
;
7737 link_info
.dynamic_list
->head
.list
= dynamic
;
7741 struct bfd_elf_dynamic_list
*d
;
7743 d
= (struct bfd_elf_dynamic_list
*) xcalloc (1, sizeof *d
);
7744 d
->head
.list
= dynamic
;
7745 d
->match
= lang_vers_match
;
7746 link_info
.dynamic_list
= d
;
7750 /* Append the list of C++ typeinfo dynamic symbols to the existing
7754 lang_append_dynamic_list_cpp_typeinfo (void)
7756 const char * symbols
[] =
7758 "typeinfo name for*",
7761 struct bfd_elf_version_expr
*dynamic
= NULL
;
7764 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
7765 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
7768 lang_append_dynamic_list (dynamic
);
7771 /* Append the list of C++ operator new and delete dynamic symbols to the
7775 lang_append_dynamic_list_cpp_new (void)
7777 const char * symbols
[] =
7782 struct bfd_elf_version_expr
*dynamic
= NULL
;
7785 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
7786 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
7789 lang_append_dynamic_list (dynamic
);