1 /* Linker command language support.
2 Copyright (C) 1991-2022 Free Software Foundation, Inc.
4 This file is part of the GNU Binutils.
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 3 of the License, or
9 (at your option) any later version.
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program; if not, write to the Free Software
18 Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
19 MA 02110-1301, USA. */
24 #include "libiberty.h"
25 #include "filenames.h"
26 #include "safe-ctype.h"
45 #if BFD_SUPPORTS_PLUGINS
47 #endif /* BFD_SUPPORTS_PLUGINS */
50 #define offsetof(TYPE, MEMBER) ((size_t) & (((TYPE*) 0)->MEMBER))
53 /* Convert between addresses in bytes and sizes in octets.
54 For currently supported targets, octets_per_byte is always a power
55 of two, so we can use shifts. */
56 #define TO_ADDR(X) ((X) >> opb_shift)
57 #define TO_SIZE(X) ((X) << opb_shift)
59 /* Local variables. */
60 static struct obstack stat_obstack
;
61 static struct obstack map_obstack
;
63 #define obstack_chunk_alloc xmalloc
64 #define obstack_chunk_free free
65 static const char *entry_symbol_default
= "start";
66 static bool map_head_is_link_order
= false;
67 static lang_output_section_statement_type
*default_common_section
;
68 static bool map_option_f
;
69 static bfd_vma print_dot
;
70 static lang_input_statement_type
*first_file
;
71 static const char *current_target
;
72 static lang_statement_list_type
*stat_save
[10];
73 static lang_statement_list_type
**stat_save_ptr
= &stat_save
[0];
74 static struct unique_sections
*unique_section_list
;
75 static struct asneeded_minfo
*asneeded_list_head
;
76 static unsigned int opb_shift
= 0;
78 /* Forward declarations. */
79 static void exp_init_os (etree_type
*);
80 static lang_input_statement_type
*lookup_name (const char *);
81 static void insert_undefined (const char *);
82 static bool sort_def_symbol (struct bfd_link_hash_entry
*, void *);
83 static void print_statement (lang_statement_union_type
*,
84 lang_output_section_statement_type
*);
85 static void print_statement_list (lang_statement_union_type
*,
86 lang_output_section_statement_type
*);
87 static void print_statements (void);
88 static void print_input_section (asection
*, bool);
89 static bool lang_one_common (struct bfd_link_hash_entry
*, void *);
90 static void lang_record_phdrs (void);
91 static void lang_do_version_exports_section (void);
92 static void lang_finalize_version_expr_head
93 (struct bfd_elf_version_expr_head
*);
94 static void lang_do_memory_regions (bool);
96 /* Exported variables. */
97 const char *output_target
;
98 lang_output_section_statement_type
*abs_output_section
;
99 /* Header for list of statements corresponding to any files involved in the
100 link, either specified from the command-line or added implicitely (eg.
101 archive member used to resolved undefined symbol, wildcard statement from
102 linker script, etc.). Next pointer is in next field of a
103 lang_statement_header_type (reached via header field in a
104 lang_statement_union). */
105 lang_statement_list_type statement_list
;
106 lang_statement_list_type lang_os_list
;
107 lang_statement_list_type
*stat_ptr
= &statement_list
;
108 /* Header for list of statements corresponding to files used in the final
109 executable. This can be either object file specified on the command-line
110 or library member resolving an undefined reference. Next pointer is in next
111 field of a lang_input_statement_type (reached via input_statement field in a
112 lang_statement_union). */
113 lang_statement_list_type file_chain
= { NULL
, NULL
};
114 /* Header for list of statements corresponding to files specified on the
115 command-line for linking. It thus contains real object files and archive
116 but not archive members. Next pointer is in next_real_file field of a
117 lang_input_statement_type statement (reached via input_statement field in a
118 lang_statement_union). */
119 lang_statement_list_type input_file_chain
;
120 static const char *current_input_file
;
121 struct bfd_elf_dynamic_list
**current_dynamic_list_p
;
122 struct bfd_sym_chain entry_symbol
= { NULL
, NULL
};
123 const char *entry_section
= ".text";
124 struct lang_input_statement_flags input_flags
;
125 bool entry_from_cmdline
;
126 bool lang_has_input_file
= false;
127 bool had_output_filename
= false;
128 bool lang_float_flag
= false;
129 bool delete_output_file_on_failure
= false;
130 struct lang_phdr
*lang_phdr_list
;
131 struct lang_nocrossrefs
*nocrossref_list
;
132 struct asneeded_minfo
**asneeded_list_tail
;
134 static ctf_dict_t
*ctf_output
;
137 /* Functions that traverse the linker script and might evaluate
138 DEFINED() need to increment this at the start of the traversal. */
139 int lang_statement_iteration
= 0;
141 /* Count times through one_lang_size_sections_pass after mark phase. */
142 static int lang_sizing_iteration
= 0;
144 /* Return TRUE if the PATTERN argument is a wildcard pattern.
145 Although backslashes are treated specially if a pattern contains
146 wildcards, we do not consider the mere presence of a backslash to
147 be enough to cause the pattern to be treated as a wildcard.
148 That lets us handle DOS filenames more naturally. */
149 #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL)
151 #define new_stat(x, y) \
152 (x##_type *) new_statement (x##_enum, sizeof (x##_type), y)
154 #define outside_section_address(q) \
155 ((q)->output_offset + (q)->output_section->vma)
157 #define outside_symbol_address(q) \
158 ((q)->value + outside_section_address (q->section))
160 /* CTF sections smaller than this are not compressed: compression of
161 dictionaries this small doesn't gain much, and this lets consumers mmap the
162 sections directly out of the ELF file and use them with no decompression
163 overhead if they want to. */
164 #define CTF_COMPRESSION_THRESHOLD 4096
167 stat_alloc (size_t size
)
169 return obstack_alloc (&stat_obstack
, size
);
173 name_match (const char *pattern
, const char *name
)
175 if (wildcardp (pattern
))
176 return fnmatch (pattern
, name
, 0);
177 return strcmp (pattern
, name
);
181 ldirname (const char *name
)
183 const char *base
= lbasename (name
);
186 while (base
> name
&& IS_DIR_SEPARATOR (base
[-1]))
190 dirname
= strdup (name
);
191 dirname
[base
- name
] = '\0';
195 /* If PATTERN is of the form archive:file, return a pointer to the
196 separator. If not, return NULL. */
199 archive_path (const char *pattern
)
203 if (link_info
.path_separator
== 0)
206 p
= strchr (pattern
, link_info
.path_separator
);
207 #ifdef HAVE_DOS_BASED_FILE_SYSTEM
208 if (p
== NULL
|| link_info
.path_separator
!= ':')
211 /* Assume a match on the second char is part of drive specifier,
212 as in "c:\silly.dos". */
213 if (p
== pattern
+ 1 && ISALPHA (*pattern
))
214 p
= strchr (p
+ 1, link_info
.path_separator
);
219 /* Given that FILE_SPEC results in a non-NULL SEP result from archive_path,
220 return whether F matches FILE_SPEC. */
223 input_statement_is_archive_path (const char *file_spec
, char *sep
,
224 lang_input_statement_type
*f
)
229 || name_match (sep
+ 1, f
->filename
) == 0)
230 && ((sep
!= file_spec
)
231 == (f
->the_bfd
!= NULL
&& f
->the_bfd
->my_archive
!= NULL
)))
235 if (sep
!= file_spec
)
237 const char *aname
= bfd_get_filename (f
->the_bfd
->my_archive
);
239 match
= name_match (file_spec
, aname
) == 0;
240 *sep
= link_info
.path_separator
;
247 unique_section_p (const asection
*sec
,
248 const lang_output_section_statement_type
*os
)
250 struct unique_sections
*unam
;
253 if (!link_info
.resolve_section_groups
254 && sec
->owner
!= NULL
255 && bfd_is_group_section (sec
->owner
, sec
))
257 && strcmp (os
->name
, DISCARD_SECTION_NAME
) == 0);
260 for (unam
= unique_section_list
; unam
; unam
= unam
->next
)
261 if (name_match (unam
->name
, secnam
) == 0)
267 /* Generic traversal routines for finding matching sections. */
269 /* Return true if FILE matches a pattern in EXCLUDE_LIST, otherwise return
273 walk_wild_file_in_exclude_list (struct name_list
*exclude_list
,
274 lang_input_statement_type
*file
)
276 struct name_list
*list_tmp
;
278 for (list_tmp
= exclude_list
;
280 list_tmp
= list_tmp
->next
)
282 char *p
= archive_path (list_tmp
->name
);
286 if (input_statement_is_archive_path (list_tmp
->name
, p
, file
))
290 else if (name_match (list_tmp
->name
, file
->filename
) == 0)
293 /* FIXME: Perhaps remove the following at some stage? Matching
294 unadorned archives like this was never documented and has
295 been superceded by the archive:path syntax. */
296 else if (file
->the_bfd
!= NULL
297 && file
->the_bfd
->my_archive
!= NULL
298 && name_match (list_tmp
->name
,
299 bfd_get_filename (file
->the_bfd
->my_archive
)) == 0)
306 /* Try processing a section against a wildcard. This just calls
307 the callback unless the filename exclusion list is present
308 and excludes the file. It's hardly ever present so this
309 function is very fast. */
312 walk_wild_consider_section (lang_wild_statement_type
*ptr
,
313 lang_input_statement_type
*file
,
315 struct wildcard_list
*sec
,
319 /* Don't process sections from files which were excluded. */
320 if (walk_wild_file_in_exclude_list (sec
->spec
.exclude_name_list
, file
))
323 (*callback
) (ptr
, sec
, s
, file
, data
);
326 /* Lowest common denominator routine that can handle everything correctly,
330 walk_wild_section_general (lang_wild_statement_type
*ptr
,
331 lang_input_statement_type
*file
,
336 struct wildcard_list
*sec
;
338 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
340 sec
= ptr
->section_list
;
342 (*callback
) (ptr
, sec
, s
, file
, data
);
348 if (sec
->spec
.name
!= NULL
)
350 const char *sname
= bfd_section_name (s
);
352 skip
= name_match (sec
->spec
.name
, sname
) != 0;
356 walk_wild_consider_section (ptr
, file
, s
, sec
, callback
, data
);
363 /* Routines to find a single section given its name. If there's more
364 than one section with that name, we report that. */
368 asection
*found_section
;
369 bool multiple_sections_found
;
370 } section_iterator_callback_data
;
373 section_iterator_callback (bfd
*abfd ATTRIBUTE_UNUSED
, asection
*s
, void *data
)
375 section_iterator_callback_data
*d
= (section_iterator_callback_data
*) data
;
377 if (d
->found_section
!= NULL
)
379 d
->multiple_sections_found
= true;
383 d
->found_section
= s
;
388 find_section (lang_input_statement_type
*file
,
389 struct wildcard_list
*sec
,
390 bool *multiple_sections_found
)
392 section_iterator_callback_data cb_data
= { NULL
, false };
394 bfd_get_section_by_name_if (file
->the_bfd
, sec
->spec
.name
,
395 section_iterator_callback
, &cb_data
);
396 *multiple_sections_found
= cb_data
.multiple_sections_found
;
397 return cb_data
.found_section
;
400 /* Code for handling simple wildcards without going through fnmatch,
401 which can be expensive because of charset translations etc. */
403 /* A simple wild is a literal string followed by a single '*',
404 where the literal part is at least 4 characters long. */
407 is_simple_wild (const char *name
)
409 size_t len
= strcspn (name
, "*?[");
410 return len
>= 4 && name
[len
] == '*' && name
[len
+ 1] == '\0';
414 match_simple_wild (const char *pattern
, const char *name
)
416 /* The first four characters of the pattern are guaranteed valid
417 non-wildcard characters. So we can go faster. */
418 if (pattern
[0] != name
[0] || pattern
[1] != name
[1]
419 || pattern
[2] != name
[2] || pattern
[3] != name
[3])
424 while (*pattern
!= '*')
425 if (*name
++ != *pattern
++)
431 /* Return the numerical value of the init_priority attribute from
432 section name NAME. */
435 get_init_priority (const asection
*sec
)
437 const char *name
= bfd_section_name (sec
);
440 /* GCC uses the following section names for the init_priority
441 attribute with numerical values 101 to 65535 inclusive. A
442 lower value means a higher priority.
444 1: .init_array.NNNNN/.fini_array.NNNNN: Where NNNNN is the
445 decimal numerical value of the init_priority attribute.
446 The order of execution in .init_array is forward and
447 .fini_array is backward.
448 2: .ctors.NNNNN/.dtors.NNNNN: Where NNNNN is 65535 minus the
449 decimal numerical value of the init_priority attribute.
450 The order of execution in .ctors is backward and .dtors
453 .init_array.NNNNN sections would normally be placed in an output
454 .init_array section, .fini_array.NNNNN in .fini_array,
455 .ctors.NNNNN in .ctors, and .dtors.NNNNN in .dtors. This means
456 we should sort by increasing number (and could just use
457 SORT_BY_NAME in scripts). However if .ctors.NNNNN sections are
458 being placed in .init_array (which may also contain
459 .init_array.NNNNN sections) or .dtors.NNNNN sections are being
460 placed in .fini_array then we need to extract the init_priority
461 attribute and sort on that. */
462 dot
= strrchr (name
, '.');
463 if (dot
!= NULL
&& ISDIGIT (dot
[1]))
466 unsigned long init_priority
= strtoul (dot
+ 1, &end
, 10);
470 && (strncmp (name
, ".ctors", 6) == 0
471 || strncmp (name
, ".dtors", 6) == 0))
472 init_priority
= 65535 - init_priority
;
473 if (init_priority
<= INT_MAX
)
474 return init_priority
;
480 /* Compare sections ASEC and BSEC according to SORT. */
483 compare_section (sort_type sort
, asection
*asec
, asection
*bsec
)
486 int a_priority
, b_priority
;
493 case by_init_priority
:
494 a_priority
= get_init_priority (asec
);
495 b_priority
= get_init_priority (bsec
);
496 if (a_priority
< 0 || b_priority
< 0)
498 ret
= a_priority
- b_priority
;
504 case by_alignment_name
:
505 ret
= bfd_section_alignment (bsec
) - bfd_section_alignment (asec
);
512 ret
= strcmp (bfd_section_name (asec
), bfd_section_name (bsec
));
515 case by_name_alignment
:
516 ret
= strcmp (bfd_section_name (asec
), bfd_section_name (bsec
));
522 ret
= bfd_section_alignment (bsec
) - bfd_section_alignment (asec
);
529 /* Build a Binary Search Tree to sort sections, unlike insertion sort
530 used in wild_sort(). BST is considerably faster if the number of
531 of sections are large. */
533 static lang_section_bst_type
**
534 wild_sort_fast (lang_wild_statement_type
*wild
,
535 struct wildcard_list
*sec
,
536 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
539 lang_section_bst_type
**tree
;
542 if (!wild
->filenames_sorted
543 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
545 /* Append at the right end of tree. */
547 tree
= &((*tree
)->right
);
553 /* Find the correct node to append this section. */
554 if (compare_section (sec
->spec
.sorted
, section
, (*tree
)->section
) < 0)
555 tree
= &((*tree
)->left
);
557 tree
= &((*tree
)->right
);
563 /* Use wild_sort_fast to build a BST to sort sections. */
566 output_section_callback_fast (lang_wild_statement_type
*ptr
,
567 struct wildcard_list
*sec
,
569 lang_input_statement_type
*file
,
572 lang_section_bst_type
*node
;
573 lang_section_bst_type
**tree
;
574 lang_output_section_statement_type
*os
;
576 os
= (lang_output_section_statement_type
*) output
;
578 if (unique_section_p (section
, os
))
581 node
= (lang_section_bst_type
*) xmalloc (sizeof (lang_section_bst_type
));
584 node
->section
= section
;
585 node
->pattern
= ptr
->section_list
;
587 tree
= wild_sort_fast (ptr
, sec
, file
, section
);
592 /* Convert a sorted sections' BST back to list form. */
595 output_section_callback_tree_to_list (lang_wild_statement_type
*ptr
,
596 lang_section_bst_type
*tree
,
600 output_section_callback_tree_to_list (ptr
, tree
->left
, output
);
602 lang_add_section (&ptr
->children
, tree
->section
, tree
->pattern
, NULL
,
603 (lang_output_section_statement_type
*) output
);
606 output_section_callback_tree_to_list (ptr
, tree
->right
, output
);
611 /* Specialized, optimized routines for handling different kinds of
615 walk_wild_section_specs1_wild0 (lang_wild_statement_type
*ptr
,
616 lang_input_statement_type
*file
,
620 /* We can just do a hash lookup for the section with the right name.
621 But if that lookup discovers more than one section with the name
622 (should be rare), we fall back to the general algorithm because
623 we would otherwise have to sort the sections to make sure they
624 get processed in the bfd's order. */
625 bool multiple_sections_found
;
626 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
627 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
629 if (multiple_sections_found
)
630 walk_wild_section_general (ptr
, file
, callback
, data
);
632 walk_wild_consider_section (ptr
, file
, s0
, sec0
, callback
, data
);
636 walk_wild_section_specs1_wild1 (lang_wild_statement_type
*ptr
,
637 lang_input_statement_type
*file
,
642 struct wildcard_list
*wildsec0
= ptr
->handler_data
[0];
644 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
646 const char *sname
= bfd_section_name (s
);
647 bool skip
= !match_simple_wild (wildsec0
->spec
.name
, sname
);
650 walk_wild_consider_section (ptr
, file
, s
, wildsec0
, callback
, data
);
655 walk_wild_section_specs2_wild1 (lang_wild_statement_type
*ptr
,
656 lang_input_statement_type
*file
,
661 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
662 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
663 bool multiple_sections_found
;
664 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
666 if (multiple_sections_found
)
668 walk_wild_section_general (ptr
, file
, callback
, data
);
672 /* Note that if the section was not found, s0 is NULL and
673 we'll simply never succeed the s == s0 test below. */
674 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
676 /* Recall that in this code path, a section cannot satisfy more
677 than one spec, so if s == s0 then it cannot match
680 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
683 const char *sname
= bfd_section_name (s
);
684 bool skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
687 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
,
694 walk_wild_section_specs3_wild2 (lang_wild_statement_type
*ptr
,
695 lang_input_statement_type
*file
,
700 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
701 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
702 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
703 bool multiple_sections_found
;
704 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
706 if (multiple_sections_found
)
708 walk_wild_section_general (ptr
, file
, callback
, data
);
712 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
715 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
718 const char *sname
= bfd_section_name (s
);
719 bool skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
722 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
, data
);
725 skip
= !match_simple_wild (wildsec2
->spec
.name
, sname
);
727 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
735 walk_wild_section_specs4_wild2 (lang_wild_statement_type
*ptr
,
736 lang_input_statement_type
*file
,
741 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
742 struct wildcard_list
*sec1
= ptr
->handler_data
[1];
743 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
744 struct wildcard_list
*wildsec3
= ptr
->handler_data
[3];
745 bool multiple_sections_found
;
746 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
), *s1
;
748 if (multiple_sections_found
)
750 walk_wild_section_general (ptr
, file
, callback
, data
);
754 s1
= find_section (file
, sec1
, &multiple_sections_found
);
755 if (multiple_sections_found
)
757 walk_wild_section_general (ptr
, file
, callback
, data
);
761 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
764 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
767 walk_wild_consider_section (ptr
, file
, s
, sec1
, callback
, data
);
770 const char *sname
= bfd_section_name (s
);
771 bool skip
= !match_simple_wild (wildsec2
->spec
.name
, sname
);
774 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
778 skip
= !match_simple_wild (wildsec3
->spec
.name
, sname
);
780 walk_wild_consider_section (ptr
, file
, s
, wildsec3
,
788 walk_wild_section (lang_wild_statement_type
*ptr
,
789 lang_input_statement_type
*file
,
793 if (file
->flags
.just_syms
)
796 (*ptr
->walk_wild_section_handler
) (ptr
, file
, callback
, data
);
799 /* Returns TRUE when name1 is a wildcard spec that might match
800 something name2 can match. We're conservative: we return FALSE
801 only if the prefixes of name1 and name2 are different up to the
802 first wildcard character. */
805 wild_spec_can_overlap (const char *name1
, const char *name2
)
807 size_t prefix1_len
= strcspn (name1
, "?*[");
808 size_t prefix2_len
= strcspn (name2
, "?*[");
809 size_t min_prefix_len
;
811 /* Note that if there is no wildcard character, then we treat the
812 terminating 0 as part of the prefix. Thus ".text" won't match
813 ".text." or ".text.*", for example. */
814 if (name1
[prefix1_len
] == '\0')
816 if (name2
[prefix2_len
] == '\0')
819 min_prefix_len
= prefix1_len
< prefix2_len
? prefix1_len
: prefix2_len
;
821 return memcmp (name1
, name2
, min_prefix_len
) == 0;
824 /* Select specialized code to handle various kinds of wildcard
828 analyze_walk_wild_section_handler (lang_wild_statement_type
*ptr
)
831 int wild_name_count
= 0;
832 struct wildcard_list
*sec
;
836 ptr
->walk_wild_section_handler
= walk_wild_section_general
;
837 ptr
->handler_data
[0] = NULL
;
838 ptr
->handler_data
[1] = NULL
;
839 ptr
->handler_data
[2] = NULL
;
840 ptr
->handler_data
[3] = NULL
;
843 /* Count how many wildcard_specs there are, and how many of those
844 actually use wildcards in the name. Also, bail out if any of the
845 wildcard names are NULL. (Can this actually happen?
846 walk_wild_section used to test for it.) And bail out if any
847 of the wildcards are more complex than a simple string
848 ending in a single '*'. */
849 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
852 if (sec
->spec
.name
== NULL
)
854 if (wildcardp (sec
->spec
.name
))
857 if (!is_simple_wild (sec
->spec
.name
))
862 /* The zero-spec case would be easy to optimize but it doesn't
863 happen in practice. Likewise, more than 4 specs doesn't
864 happen in practice. */
865 if (sec_count
== 0 || sec_count
> 4)
868 /* Check that no two specs can match the same section. */
869 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
871 struct wildcard_list
*sec2
;
872 for (sec2
= sec
->next
; sec2
!= NULL
; sec2
= sec2
->next
)
874 if (wild_spec_can_overlap (sec
->spec
.name
, sec2
->spec
.name
))
879 signature
= (sec_count
<< 8) + wild_name_count
;
883 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild0
;
886 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild1
;
889 ptr
->walk_wild_section_handler
= walk_wild_section_specs2_wild1
;
892 ptr
->walk_wild_section_handler
= walk_wild_section_specs3_wild2
;
895 ptr
->walk_wild_section_handler
= walk_wild_section_specs4_wild2
;
901 /* Now fill the data array with pointers to the specs, first the
902 specs with non-wildcard names, then the specs with wildcard
903 names. It's OK to process the specs in different order from the
904 given order, because we've already determined that no section
905 will match more than one spec. */
907 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
908 if (!wildcardp (sec
->spec
.name
))
909 ptr
->handler_data
[data_counter
++] = sec
;
910 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
911 if (wildcardp (sec
->spec
.name
))
912 ptr
->handler_data
[data_counter
++] = sec
;
915 /* Handle a wild statement for a single file F. */
918 walk_wild_file (lang_wild_statement_type
*s
,
919 lang_input_statement_type
*f
,
923 if (walk_wild_file_in_exclude_list (s
->exclude_name_list
, f
))
926 if (f
->the_bfd
== NULL
927 || !bfd_check_format (f
->the_bfd
, bfd_archive
))
928 walk_wild_section (s
, f
, callback
, data
);
933 /* This is an archive file. We must map each member of the
934 archive separately. */
935 member
= bfd_openr_next_archived_file (f
->the_bfd
, NULL
);
936 while (member
!= NULL
)
938 /* When lookup_name is called, it will call the add_symbols
939 entry point for the archive. For each element of the
940 archive which is included, BFD will call ldlang_add_file,
941 which will set the usrdata field of the member to the
942 lang_input_statement. */
943 if (bfd_usrdata (member
) != NULL
)
944 walk_wild_section (s
, bfd_usrdata (member
), callback
, data
);
946 member
= bfd_openr_next_archived_file (f
->the_bfd
, member
);
952 walk_wild (lang_wild_statement_type
*s
, callback_t callback
, void *data
)
954 const char *file_spec
= s
->filename
;
957 if (file_spec
== NULL
)
959 /* Perform the iteration over all files in the list. */
960 LANG_FOR_EACH_INPUT_STATEMENT (f
)
962 walk_wild_file (s
, f
, callback
, data
);
965 else if ((p
= archive_path (file_spec
)) != NULL
)
967 LANG_FOR_EACH_INPUT_STATEMENT (f
)
969 if (input_statement_is_archive_path (file_spec
, p
, f
))
970 walk_wild_file (s
, f
, callback
, data
);
973 else if (wildcardp (file_spec
))
975 LANG_FOR_EACH_INPUT_STATEMENT (f
)
977 if (fnmatch (file_spec
, f
->filename
, 0) == 0)
978 walk_wild_file (s
, f
, callback
, data
);
983 lang_input_statement_type
*f
;
985 /* Perform the iteration over a single file. */
986 f
= lookup_name (file_spec
);
988 walk_wild_file (s
, f
, callback
, data
);
992 /* lang_for_each_statement walks the parse tree and calls the provided
993 function for each node, except those inside output section statements
994 with constraint set to -1. */
997 lang_for_each_statement_worker (void (*func
) (lang_statement_union_type
*),
998 lang_statement_union_type
*s
)
1000 for (; s
!= NULL
; s
= s
->header
.next
)
1004 switch (s
->header
.type
)
1006 case lang_constructors_statement_enum
:
1007 lang_for_each_statement_worker (func
, constructor_list
.head
);
1009 case lang_output_section_statement_enum
:
1010 if (s
->output_section_statement
.constraint
!= -1)
1011 lang_for_each_statement_worker
1012 (func
, s
->output_section_statement
.children
.head
);
1014 case lang_wild_statement_enum
:
1015 lang_for_each_statement_worker (func
,
1016 s
->wild_statement
.children
.head
);
1018 case lang_group_statement_enum
:
1019 lang_for_each_statement_worker (func
,
1020 s
->group_statement
.children
.head
);
1022 case lang_data_statement_enum
:
1023 case lang_reloc_statement_enum
:
1024 case lang_object_symbols_statement_enum
:
1025 case lang_output_statement_enum
:
1026 case lang_target_statement_enum
:
1027 case lang_input_section_enum
:
1028 case lang_input_statement_enum
:
1029 case lang_assignment_statement_enum
:
1030 case lang_padding_statement_enum
:
1031 case lang_address_statement_enum
:
1032 case lang_fill_statement_enum
:
1033 case lang_insert_statement_enum
:
1043 lang_for_each_statement (void (*func
) (lang_statement_union_type
*))
1045 lang_for_each_statement_worker (func
, statement_list
.head
);
1048 /*----------------------------------------------------------------------*/
1051 lang_list_init (lang_statement_list_type
*list
)
1054 list
->tail
= &list
->head
;
1058 lang_statement_append (lang_statement_list_type
*list
,
1062 *(list
->tail
) = element
;
1067 push_stat_ptr (lang_statement_list_type
*new_ptr
)
1069 if (stat_save_ptr
>= stat_save
+ sizeof (stat_save
) / sizeof (stat_save
[0]))
1071 *stat_save_ptr
++ = stat_ptr
;
1078 if (stat_save_ptr
<= stat_save
)
1080 stat_ptr
= *--stat_save_ptr
;
1083 /* Build a new statement node for the parse tree. */
1085 static lang_statement_union_type
*
1086 new_statement (enum statement_enum type
,
1088 lang_statement_list_type
*list
)
1090 lang_statement_union_type
*new_stmt
;
1092 new_stmt
= stat_alloc (size
);
1093 new_stmt
->header
.type
= type
;
1094 new_stmt
->header
.next
= NULL
;
1095 lang_statement_append (list
, new_stmt
, &new_stmt
->header
.next
);
1099 /* Build a new input file node for the language. There are several
1100 ways in which we treat an input file, eg, we only look at symbols,
1101 or prefix it with a -l etc.
1103 We can be supplied with requests for input files more than once;
1104 they may, for example be split over several lines like foo.o(.text)
1105 foo.o(.data) etc, so when asked for a file we check that we haven't
1106 got it already so we don't duplicate the bfd. */
1108 static lang_input_statement_type
*
1109 new_afile (const char *name
,
1110 lang_input_file_enum_type file_type
,
1112 const char *from_filename
)
1114 lang_input_statement_type
*p
;
1116 lang_has_input_file
= true;
1118 p
= new_stat (lang_input_statement
, stat_ptr
);
1119 memset (&p
->the_bfd
, 0,
1120 sizeof (*p
) - offsetof (lang_input_statement_type
, the_bfd
));
1121 p
->extra_search_path
= NULL
;
1123 p
->flags
.dynamic
= input_flags
.dynamic
;
1124 p
->flags
.add_DT_NEEDED_for_dynamic
= input_flags
.add_DT_NEEDED_for_dynamic
;
1125 p
->flags
.add_DT_NEEDED_for_regular
= input_flags
.add_DT_NEEDED_for_regular
;
1126 p
->flags
.whole_archive
= input_flags
.whole_archive
;
1127 p
->flags
.sysrooted
= input_flags
.sysrooted
;
1131 case lang_input_file_is_symbols_only_enum
:
1133 p
->local_sym_name
= name
;
1134 p
->flags
.real
= true;
1135 p
->flags
.just_syms
= true;
1137 case lang_input_file_is_fake_enum
:
1139 p
->local_sym_name
= name
;
1141 case lang_input_file_is_l_enum
:
1142 if (name
[0] == ':' && name
[1] != '\0')
1144 p
->filename
= name
+ 1;
1145 p
->flags
.full_name_provided
= true;
1149 p
->local_sym_name
= concat ("-l", name
, (const char *) NULL
);
1150 p
->flags
.maybe_archive
= true;
1151 p
->flags
.real
= true;
1152 p
->flags
.search_dirs
= true;
1154 case lang_input_file_is_marker_enum
:
1156 p
->local_sym_name
= name
;
1157 p
->flags
.search_dirs
= true;
1159 case lang_input_file_is_search_file_enum
:
1161 p
->local_sym_name
= name
;
1162 /* If name is a relative path, search the directory of the current linker
1164 if (from_filename
&& !IS_ABSOLUTE_PATH (name
))
1165 p
->extra_search_path
= ldirname (from_filename
);
1166 p
->flags
.real
= true;
1167 p
->flags
.search_dirs
= true;
1169 case lang_input_file_is_file_enum
:
1171 p
->local_sym_name
= name
;
1172 p
->flags
.real
= true;
1178 lang_statement_append (&input_file_chain
, p
, &p
->next_real_file
);
1182 lang_input_statement_type
*
1183 lang_add_input_file (const char *name
,
1184 lang_input_file_enum_type file_type
,
1188 && (*name
== '=' || startswith (name
, "$SYSROOT")))
1190 lang_input_statement_type
*ret
;
1191 char *sysrooted_name
1192 = concat (ld_sysroot
,
1193 name
+ (*name
== '=' ? 1 : strlen ("$SYSROOT")),
1194 (const char *) NULL
);
1196 /* We've now forcibly prepended the sysroot, making the input
1197 file independent of the context. Therefore, temporarily
1198 force a non-sysrooted context for this statement, so it won't
1199 get the sysroot prepended again when opened. (N.B. if it's a
1200 script, any child nodes with input files starting with "/"
1201 will be handled as "sysrooted" as they'll be found to be
1202 within the sysroot subdirectory.) */
1203 unsigned int outer_sysrooted
= input_flags
.sysrooted
;
1204 input_flags
.sysrooted
= 0;
1205 ret
= new_afile (sysrooted_name
, file_type
, target
, NULL
);
1206 input_flags
.sysrooted
= outer_sysrooted
;
1210 return new_afile (name
, file_type
, target
, current_input_file
);
1213 struct out_section_hash_entry
1215 struct bfd_hash_entry root
;
1216 lang_statement_union_type s
;
1219 /* The hash table. */
1221 static struct bfd_hash_table output_section_statement_table
;
1223 /* Support routines for the hash table used by lang_output_section_find,
1224 initialize the table, fill in an entry and remove the table. */
1226 static struct bfd_hash_entry
*
1227 output_section_statement_newfunc (struct bfd_hash_entry
*entry
,
1228 struct bfd_hash_table
*table
,
1231 lang_output_section_statement_type
**nextp
;
1232 struct out_section_hash_entry
*ret
;
1236 entry
= (struct bfd_hash_entry
*) bfd_hash_allocate (table
,
1242 entry
= bfd_hash_newfunc (entry
, table
, string
);
1246 ret
= (struct out_section_hash_entry
*) entry
;
1247 memset (&ret
->s
, 0, sizeof (ret
->s
));
1248 ret
->s
.header
.type
= lang_output_section_statement_enum
;
1249 ret
->s
.output_section_statement
.subsection_alignment
= NULL
;
1250 ret
->s
.output_section_statement
.section_alignment
= NULL
;
1251 ret
->s
.output_section_statement
.block_value
= 1;
1252 lang_list_init (&ret
->s
.output_section_statement
.children
);
1253 lang_statement_append (stat_ptr
, &ret
->s
, &ret
->s
.header
.next
);
1255 /* For every output section statement added to the list, except the
1256 first one, lang_os_list.tail points to the "next"
1257 field of the last element of the list. */
1258 if (lang_os_list
.head
!= NULL
)
1259 ret
->s
.output_section_statement
.prev
1260 = ((lang_output_section_statement_type
*)
1261 ((char *) lang_os_list
.tail
1262 - offsetof (lang_output_section_statement_type
, next
)));
1264 /* GCC's strict aliasing rules prevent us from just casting the
1265 address, so we store the pointer in a variable and cast that
1267 nextp
= &ret
->s
.output_section_statement
.next
;
1268 lang_statement_append (&lang_os_list
, &ret
->s
, nextp
);
1273 output_section_statement_table_init (void)
1275 if (!bfd_hash_table_init_n (&output_section_statement_table
,
1276 output_section_statement_newfunc
,
1277 sizeof (struct out_section_hash_entry
),
1279 einfo (_("%F%P: can not create hash table: %E\n"));
1283 output_section_statement_table_free (void)
1285 bfd_hash_table_free (&output_section_statement_table
);
1288 /* Build enough state so that the parser can build its tree. */
1293 obstack_begin (&stat_obstack
, 1000);
1295 stat_ptr
= &statement_list
;
1297 output_section_statement_table_init ();
1299 lang_list_init (stat_ptr
);
1301 lang_list_init (&input_file_chain
);
1302 lang_list_init (&lang_os_list
);
1303 lang_list_init (&file_chain
);
1304 first_file
= lang_add_input_file (NULL
, lang_input_file_is_marker_enum
,
1306 abs_output_section
=
1307 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME
, 0, 1);
1309 abs_output_section
->bfd_section
= bfd_abs_section_ptr
;
1311 asneeded_list_head
= NULL
;
1312 asneeded_list_tail
= &asneeded_list_head
;
1318 output_section_statement_table_free ();
1321 /*----------------------------------------------------------------------
1322 A region is an area of memory declared with the
1323 MEMORY { name:org=exp, len=exp ... }
1326 We maintain a list of all the regions here.
1328 If no regions are specified in the script, then the default is used
1329 which is created when looked up to be the entire data space.
1331 If create is true we are creating a region inside a MEMORY block.
1332 In this case it is probably an error to create a region that has
1333 already been created. If we are not inside a MEMORY block it is
1334 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1335 and so we issue a warning.
1337 Each region has at least one name. The first name is either
1338 DEFAULT_MEMORY_REGION or the name given in the MEMORY block. You can add
1339 alias names to an existing region within a script with
1340 REGION_ALIAS (alias, region_name). Each name corresponds to at most one
1343 static lang_memory_region_type
*lang_memory_region_list
;
1344 static lang_memory_region_type
**lang_memory_region_list_tail
1345 = &lang_memory_region_list
;
1347 lang_memory_region_type
*
1348 lang_memory_region_lookup (const char *const name
, bool create
)
1350 lang_memory_region_name
*n
;
1351 lang_memory_region_type
*r
;
1352 lang_memory_region_type
*new_region
;
1354 /* NAME is NULL for LMA memspecs if no region was specified. */
1358 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1359 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1360 if (strcmp (n
->name
, name
) == 0)
1363 einfo (_("%P:%pS: warning: redeclaration of memory region `%s'\n"),
1368 if (!create
&& strcmp (name
, DEFAULT_MEMORY_REGION
))
1369 einfo (_("%P:%pS: warning: memory region `%s' not declared\n"),
1372 new_region
= stat_alloc (sizeof (lang_memory_region_type
));
1374 new_region
->name_list
.name
= xstrdup (name
);
1375 new_region
->name_list
.next
= NULL
;
1376 new_region
->next
= NULL
;
1377 new_region
->origin_exp
= NULL
;
1378 new_region
->origin
= 0;
1379 new_region
->length_exp
= NULL
;
1380 new_region
->length
= ~(bfd_size_type
) 0;
1381 new_region
->current
= 0;
1382 new_region
->last_os
= NULL
;
1383 new_region
->flags
= 0;
1384 new_region
->not_flags
= 0;
1385 new_region
->had_full_message
= false;
1387 *lang_memory_region_list_tail
= new_region
;
1388 lang_memory_region_list_tail
= &new_region
->next
;
1394 lang_memory_region_alias (const char *alias
, const char *region_name
)
1396 lang_memory_region_name
*n
;
1397 lang_memory_region_type
*r
;
1398 lang_memory_region_type
*region
;
1400 /* The default region must be unique. This ensures that it is not necessary
1401 to iterate through the name list if someone wants the check if a region is
1402 the default memory region. */
1403 if (strcmp (region_name
, DEFAULT_MEMORY_REGION
) == 0
1404 || strcmp (alias
, DEFAULT_MEMORY_REGION
) == 0)
1405 einfo (_("%F%P:%pS: error: alias for default memory region\n"), NULL
);
1407 /* Look for the target region and check if the alias is not already
1410 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1411 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1413 if (region
== NULL
&& strcmp (n
->name
, region_name
) == 0)
1415 if (strcmp (n
->name
, alias
) == 0)
1416 einfo (_("%F%P:%pS: error: redefinition of memory region "
1421 /* Check if the target region exists. */
1423 einfo (_("%F%P:%pS: error: memory region `%s' "
1424 "for alias `%s' does not exist\n"),
1425 NULL
, region_name
, alias
);
1427 /* Add alias to region name list. */
1428 n
= stat_alloc (sizeof (lang_memory_region_name
));
1429 n
->name
= xstrdup (alias
);
1430 n
->next
= region
->name_list
.next
;
1431 region
->name_list
.next
= n
;
1434 static lang_memory_region_type
*
1435 lang_memory_default (asection
*section
)
1437 lang_memory_region_type
*p
;
1439 flagword sec_flags
= section
->flags
;
1441 /* Override SEC_DATA to mean a writable section. */
1442 if ((sec_flags
& (SEC_ALLOC
| SEC_READONLY
| SEC_CODE
)) == SEC_ALLOC
)
1443 sec_flags
|= SEC_DATA
;
1445 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1447 if ((p
->flags
& sec_flags
) != 0
1448 && (p
->not_flags
& sec_flags
) == 0)
1453 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, false);
1456 /* Get the output section statement directly from the userdata. */
1458 lang_output_section_statement_type
*
1459 lang_output_section_get (const asection
*output_section
)
1461 return bfd_section_userdata (output_section
);
1464 /* Find or create an output_section_statement with the given NAME.
1465 If CONSTRAINT is non-zero match one with that constraint, otherwise
1466 match any non-negative constraint. If CREATE is 0 return NULL when
1467 no match exists. If CREATE is 1, create an output_section_statement
1468 when no match exists or if CONSTRAINT is SPECIAL. If CREATE is 2,
1469 always make a new output_section_statement. */
1471 lang_output_section_statement_type
*
1472 lang_output_section_statement_lookup (const char *name
,
1476 struct out_section_hash_entry
*entry
;
1478 entry
= ((struct out_section_hash_entry
*)
1479 bfd_hash_lookup (&output_section_statement_table
, name
,
1480 create
!= 0, false));
1484 einfo (_("%F%P: failed creating section `%s': %E\n"), name
);
1488 if (entry
->s
.output_section_statement
.name
!= NULL
)
1490 /* We have a section of this name, but it might not have the correct
1492 struct out_section_hash_entry
*last_ent
;
1494 name
= entry
->s
.output_section_statement
.name
;
1498 && !(create
&& constraint
== SPECIAL
)
1499 && (constraint
== entry
->s
.output_section_statement
.constraint
1501 && entry
->s
.output_section_statement
.constraint
>= 0)))
1502 return &entry
->s
.output_section_statement
;
1504 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1506 while (entry
!= NULL
1507 && name
== entry
->s
.output_section_statement
.name
);
1513 = ((struct out_section_hash_entry
*)
1514 output_section_statement_newfunc (NULL
,
1515 &output_section_statement_table
,
1519 einfo (_("%F%P: failed creating section `%s': %E\n"), name
);
1522 entry
->root
= last_ent
->root
;
1523 last_ent
->root
.next
= &entry
->root
;
1526 entry
->s
.output_section_statement
.name
= name
;
1527 entry
->s
.output_section_statement
.constraint
= constraint
;
1528 entry
->s
.output_section_statement
.dup_output
= (create
== 2
1529 || constraint
== SPECIAL
);
1530 return &entry
->s
.output_section_statement
;
1533 /* Find the next output_section_statement with the same name as OS.
1534 If CONSTRAINT is non-zero, find one with that constraint otherwise
1535 match any non-negative constraint. */
1537 lang_output_section_statement_type
*
1538 next_matching_output_section_statement (lang_output_section_statement_type
*os
,
1541 /* All output_section_statements are actually part of a
1542 struct out_section_hash_entry. */
1543 struct out_section_hash_entry
*entry
= (struct out_section_hash_entry
*)
1545 - offsetof (struct out_section_hash_entry
, s
.output_section_statement
));
1546 const char *name
= os
->name
;
1548 ASSERT (name
== entry
->root
.string
);
1551 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1553 || name
!= entry
->s
.output_section_statement
.name
)
1556 while (constraint
!= entry
->s
.output_section_statement
.constraint
1558 || entry
->s
.output_section_statement
.constraint
< 0));
1560 return &entry
->s
.output_section_statement
;
1563 /* A variant of lang_output_section_find used by place_orphan.
1564 Returns the output statement that should precede a new output
1565 statement for SEC. If an exact match is found on certain flags,
1568 lang_output_section_statement_type
*
1569 lang_output_section_find_by_flags (const asection
*sec
,
1571 lang_output_section_statement_type
**exact
,
1572 lang_match_sec_type_func match_type
)
1574 lang_output_section_statement_type
*first
, *look
, *found
;
1575 flagword look_flags
, differ
;
1577 /* We know the first statement on this list is *ABS*. May as well
1579 first
= (void *) lang_os_list
.head
;
1580 first
= first
->next
;
1582 /* First try for an exact match. */
1584 for (look
= first
; look
; look
= look
->next
)
1586 look_flags
= look
->flags
;
1587 if (look
->bfd_section
!= NULL
)
1589 look_flags
= look
->bfd_section
->flags
;
1590 if (match_type
&& !match_type (link_info
.output_bfd
,
1595 differ
= look_flags
^ sec_flags
;
1596 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
| SEC_READONLY
1597 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1607 if ((sec_flags
& SEC_CODE
) != 0
1608 && (sec_flags
& SEC_ALLOC
) != 0)
1610 /* Try for a rw code section. */
1611 for (look
= first
; look
; look
= look
->next
)
1613 look_flags
= look
->flags
;
1614 if (look
->bfd_section
!= NULL
)
1616 look_flags
= look
->bfd_section
->flags
;
1617 if (match_type
&& !match_type (link_info
.output_bfd
,
1622 differ
= look_flags
^ sec_flags
;
1623 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1624 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1628 else if ((sec_flags
& SEC_READONLY
) != 0
1629 && (sec_flags
& SEC_ALLOC
) != 0)
1631 /* .rodata can go after .text, .sdata2 after .rodata. */
1632 for (look
= first
; look
; look
= look
->next
)
1634 look_flags
= look
->flags
;
1635 if (look
->bfd_section
!= NULL
)
1637 look_flags
= look
->bfd_section
->flags
;
1638 if (match_type
&& !match_type (link_info
.output_bfd
,
1643 differ
= look_flags
^ sec_flags
;
1644 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1645 | SEC_READONLY
| SEC_SMALL_DATA
))
1646 || (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1648 && !(look_flags
& SEC_SMALL_DATA
)))
1652 else if ((sec_flags
& SEC_THREAD_LOCAL
) != 0
1653 && (sec_flags
& SEC_ALLOC
) != 0)
1655 /* .tdata can go after .data, .tbss after .tdata. Treat .tbss
1656 as if it were a loaded section, and don't use match_type. */
1657 bool seen_thread_local
= false;
1660 for (look
= first
; look
; look
= look
->next
)
1662 look_flags
= look
->flags
;
1663 if (look
->bfd_section
!= NULL
)
1664 look_flags
= look
->bfd_section
->flags
;
1666 differ
= look_flags
^ (sec_flags
| SEC_LOAD
| SEC_HAS_CONTENTS
);
1667 if (!(differ
& (SEC_THREAD_LOCAL
| SEC_ALLOC
)))
1669 /* .tdata and .tbss must be adjacent and in that order. */
1670 if (!(look_flags
& SEC_LOAD
)
1671 && (sec_flags
& SEC_LOAD
))
1672 /* ..so if we're at a .tbss section and we're placing
1673 a .tdata section stop looking and return the
1674 previous section. */
1677 seen_thread_local
= true;
1679 else if (seen_thread_local
)
1681 else if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
)))
1685 else if ((sec_flags
& SEC_SMALL_DATA
) != 0
1686 && (sec_flags
& SEC_ALLOC
) != 0)
1688 /* .sdata goes after .data, .sbss after .sdata. */
1689 for (look
= first
; look
; look
= look
->next
)
1691 look_flags
= look
->flags
;
1692 if (look
->bfd_section
!= NULL
)
1694 look_flags
= look
->bfd_section
->flags
;
1695 if (match_type
&& !match_type (link_info
.output_bfd
,
1700 differ
= look_flags
^ sec_flags
;
1701 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1702 | SEC_THREAD_LOCAL
))
1703 || ((look_flags
& SEC_SMALL_DATA
)
1704 && !(sec_flags
& SEC_HAS_CONTENTS
)))
1708 else if ((sec_flags
& SEC_HAS_CONTENTS
) != 0
1709 && (sec_flags
& SEC_ALLOC
) != 0)
1711 /* .data goes after .rodata. */
1712 for (look
= first
; look
; look
= look
->next
)
1714 look_flags
= look
->flags
;
1715 if (look
->bfd_section
!= NULL
)
1717 look_flags
= look
->bfd_section
->flags
;
1718 if (match_type
&& !match_type (link_info
.output_bfd
,
1723 differ
= look_flags
^ sec_flags
;
1724 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1725 | SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1729 else if ((sec_flags
& SEC_ALLOC
) != 0)
1731 /* .bss goes after any other alloc section. */
1732 for (look
= first
; look
; look
= look
->next
)
1734 look_flags
= look
->flags
;
1735 if (look
->bfd_section
!= NULL
)
1737 look_flags
= look
->bfd_section
->flags
;
1738 if (match_type
&& !match_type (link_info
.output_bfd
,
1743 differ
= look_flags
^ sec_flags
;
1744 if (!(differ
& SEC_ALLOC
))
1750 /* non-alloc go last. */
1751 for (look
= first
; look
; look
= look
->next
)
1753 look_flags
= look
->flags
;
1754 if (look
->bfd_section
!= NULL
)
1755 look_flags
= look
->bfd_section
->flags
;
1756 differ
= look_flags
^ sec_flags
;
1757 if (!(differ
& SEC_DEBUGGING
))
1763 if (found
|| !match_type
)
1766 return lang_output_section_find_by_flags (sec
, sec_flags
, NULL
, NULL
);
1769 /* Find the last output section before given output statement.
1770 Used by place_orphan. */
1773 output_prev_sec_find (lang_output_section_statement_type
*os
)
1775 lang_output_section_statement_type
*lookup
;
1777 for (lookup
= os
->prev
; lookup
!= NULL
; lookup
= lookup
->prev
)
1779 if (lookup
->constraint
< 0)
1782 if (lookup
->bfd_section
!= NULL
&& lookup
->bfd_section
->owner
!= NULL
)
1783 return lookup
->bfd_section
;
1789 /* Look for a suitable place for a new output section statement. The
1790 idea is to skip over anything that might be inside a SECTIONS {}
1791 statement in a script, before we find another output section
1792 statement. Assignments to "dot" before an output section statement
1793 are assumed to belong to it, except in two cases; The first
1794 assignment to dot, and assignments before non-alloc sections.
1795 Otherwise we might put an orphan before . = . + SIZEOF_HEADERS or
1796 similar assignments that set the initial address, or we might
1797 insert non-alloc note sections among assignments setting end of
1800 static lang_statement_union_type
**
1801 insert_os_after (lang_output_section_statement_type
*after
)
1803 lang_statement_union_type
**where
;
1804 lang_statement_union_type
**assign
= NULL
;
1807 ignore_first
= after
== (void *) lang_os_list
.head
;
1809 for (where
= &after
->header
.next
;
1811 where
= &(*where
)->header
.next
)
1813 switch ((*where
)->header
.type
)
1815 case lang_assignment_statement_enum
:
1818 lang_assignment_statement_type
*ass
;
1820 ass
= &(*where
)->assignment_statement
;
1821 if (ass
->exp
->type
.node_class
!= etree_assert
1822 && ass
->exp
->assign
.dst
[0] == '.'
1823 && ass
->exp
->assign
.dst
[1] == 0)
1827 ignore_first
= false;
1831 case lang_wild_statement_enum
:
1832 case lang_input_section_enum
:
1833 case lang_object_symbols_statement_enum
:
1834 case lang_fill_statement_enum
:
1835 case lang_data_statement_enum
:
1836 case lang_reloc_statement_enum
:
1837 case lang_padding_statement_enum
:
1838 case lang_constructors_statement_enum
:
1840 ignore_first
= false;
1842 case lang_output_section_statement_enum
:
1845 asection
*s
= (*where
)->output_section_statement
.bfd_section
;
1848 || s
->map_head
.s
== NULL
1849 || (s
->flags
& SEC_ALLOC
) != 0)
1853 case lang_input_statement_enum
:
1854 case lang_address_statement_enum
:
1855 case lang_target_statement_enum
:
1856 case lang_output_statement_enum
:
1857 case lang_group_statement_enum
:
1858 case lang_insert_statement_enum
:
1867 lang_output_section_statement_type
*
1868 lang_insert_orphan (asection
*s
,
1869 const char *secname
,
1871 lang_output_section_statement_type
*after
,
1872 struct orphan_save
*place
,
1873 etree_type
*address
,
1874 lang_statement_list_type
*add_child
)
1876 lang_statement_list_type add
;
1877 lang_output_section_statement_type
*os
;
1878 lang_output_section_statement_type
**os_tail
;
1880 /* If we have found an appropriate place for the output section
1881 statements for this orphan, add them to our own private list,
1882 inserting them later into the global statement list. */
1885 lang_list_init (&add
);
1886 push_stat_ptr (&add
);
1889 if (bfd_link_relocatable (&link_info
)
1890 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0)
1891 address
= exp_intop (0);
1893 os_tail
= (lang_output_section_statement_type
**) lang_os_list
.tail
;
1894 os
= lang_enter_output_section_statement (secname
, address
, normal_section
,
1895 NULL
, NULL
, NULL
, constraint
, 0);
1897 if (add_child
== NULL
)
1898 add_child
= &os
->children
;
1899 lang_add_section (add_child
, s
, NULL
, NULL
, os
);
1901 if (after
&& (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) != 0)
1903 const char *region
= (after
->region
1904 ? after
->region
->name_list
.name
1905 : DEFAULT_MEMORY_REGION
);
1906 const char *lma_region
= (after
->lma_region
1907 ? after
->lma_region
->name_list
.name
1909 lang_leave_output_section_statement (NULL
, region
, after
->phdrs
,
1913 lang_leave_output_section_statement (NULL
, DEFAULT_MEMORY_REGION
, NULL
,
1916 /* Restore the global list pointer. */
1920 if (after
!= NULL
&& os
->bfd_section
!= NULL
)
1922 asection
*snew
, *as
;
1923 bool place_after
= place
->stmt
== NULL
;
1924 bool insert_after
= true;
1926 snew
= os
->bfd_section
;
1928 /* Shuffle the bfd section list to make the output file look
1929 neater. This is really only cosmetic. */
1930 if (place
->section
== NULL
1931 && after
!= (void *) lang_os_list
.head
)
1933 asection
*bfd_section
= after
->bfd_section
;
1935 /* If the output statement hasn't been used to place any input
1936 sections (and thus doesn't have an output bfd_section),
1937 look for the closest prior output statement having an
1939 if (bfd_section
== NULL
)
1940 bfd_section
= output_prev_sec_find (after
);
1942 if (bfd_section
!= NULL
&& bfd_section
!= snew
)
1943 place
->section
= &bfd_section
->next
;
1946 if (place
->section
== NULL
)
1947 place
->section
= &link_info
.output_bfd
->sections
;
1949 as
= *place
->section
;
1953 /* Put the section at the end of the list. */
1955 /* Unlink the section. */
1956 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1958 /* Now tack it back on in the right place. */
1959 bfd_section_list_append (link_info
.output_bfd
, snew
);
1961 else if ((bfd_get_flavour (link_info
.output_bfd
)
1962 == bfd_target_elf_flavour
)
1963 && (bfd_get_flavour (s
->owner
)
1964 == bfd_target_elf_flavour
)
1965 && ((elf_section_type (s
) == SHT_NOTE
1966 && (s
->flags
& SEC_LOAD
) != 0)
1967 || (elf_section_type (as
) == SHT_NOTE
1968 && (as
->flags
& SEC_LOAD
) != 0)))
1970 /* Make sure that output note sections are grouped and sorted
1971 by alignments when inserting a note section or insert a
1972 section after a note section, */
1974 /* A specific section after which the output note section
1975 should be placed. */
1976 asection
*after_sec
;
1977 /* True if we need to insert the orphan section after a
1978 specific section to maintain output note section order. */
1979 bool after_sec_note
= false;
1981 static asection
*first_orphan_note
= NULL
;
1983 /* Group and sort output note section by alignments in
1986 if (elf_section_type (s
) == SHT_NOTE
1987 && (s
->flags
& SEC_LOAD
) != 0)
1989 /* Search from the beginning for the last output note
1990 section with equal or larger alignments. NB: Don't
1991 place orphan note section after non-note sections. */
1993 first_orphan_note
= NULL
;
1994 for (sec
= link_info
.output_bfd
->sections
;
1996 && !bfd_is_abs_section (sec
));
1999 && elf_section_type (sec
) == SHT_NOTE
2000 && (sec
->flags
& SEC_LOAD
) != 0)
2002 if (!first_orphan_note
)
2003 first_orphan_note
= sec
;
2004 if (sec
->alignment_power
>= s
->alignment_power
)
2007 else if (first_orphan_note
)
2009 /* Stop if there is non-note section after the first
2010 orphan note section. */
2014 /* If this will be the first orphan note section, it can
2015 be placed at the default location. */
2016 after_sec_note
= first_orphan_note
!= NULL
;
2017 if (after_sec
== NULL
&& after_sec_note
)
2019 /* If all output note sections have smaller
2020 alignments, place the section before all
2021 output orphan note sections. */
2022 after_sec
= first_orphan_note
;
2023 insert_after
= false;
2026 else if (first_orphan_note
)
2028 /* Don't place non-note sections in the middle of orphan
2030 after_sec_note
= true;
2032 for (sec
= as
->next
;
2034 && !bfd_is_abs_section (sec
));
2036 if (elf_section_type (sec
) == SHT_NOTE
2037 && (sec
->flags
& SEC_LOAD
) != 0)
2045 /* Search forward to insert OS after AFTER_SEC output
2047 lang_output_section_statement_type
*stmt
, *next
;
2049 for (stmt
= after
; stmt
!= NULL
; stmt
= next
)
2054 if (stmt
->bfd_section
== after_sec
)
2064 /* If INSERT_AFTER is FALSE, place OS before
2065 AFTER_SEC output statement. */
2066 if (next
&& next
->bfd_section
== after_sec
)
2076 /* Search backward to insert OS after AFTER_SEC output
2079 for (stmt
= after
; stmt
!= NULL
; stmt
= stmt
->prev
)
2083 if (stmt
->bfd_section
== after_sec
)
2092 /* If INSERT_AFTER is FALSE, place OS before
2093 AFTER_SEC output statement. */
2094 if (stmt
->next
->bfd_section
== after_sec
)
2104 if (after_sec
== NULL
2105 || (insert_after
&& after_sec
->next
!= snew
)
2106 || (!insert_after
&& after_sec
->prev
!= snew
))
2108 /* Unlink the section. */
2109 bfd_section_list_remove (link_info
.output_bfd
, snew
);
2111 /* Place SNEW after AFTER_SEC. If AFTER_SEC is NULL,
2116 bfd_section_list_insert_after (link_info
.output_bfd
,
2119 bfd_section_list_insert_before (link_info
.output_bfd
,
2123 bfd_section_list_prepend (link_info
.output_bfd
, snew
);
2126 else if (as
!= snew
&& as
->prev
!= snew
)
2128 /* Unlink the section. */
2129 bfd_section_list_remove (link_info
.output_bfd
, snew
);
2131 /* Now tack it back on in the right place. */
2132 bfd_section_list_insert_before (link_info
.output_bfd
,
2136 else if (as
!= snew
&& as
->prev
!= snew
)
2138 /* Unlink the section. */
2139 bfd_section_list_remove (link_info
.output_bfd
, snew
);
2141 /* Now tack it back on in the right place. */
2142 bfd_section_list_insert_before (link_info
.output_bfd
, as
, snew
);
2145 /* Save the end of this list. Further ophans of this type will
2146 follow the one we've just added. */
2147 place
->section
= &snew
->next
;
2149 /* The following is non-cosmetic. We try to put the output
2150 statements in some sort of reasonable order here, because they
2151 determine the final load addresses of the orphan sections.
2152 In addition, placing output statements in the wrong order may
2153 require extra segments. For instance, given a typical
2154 situation of all read-only sections placed in one segment and
2155 following that a segment containing all the read-write
2156 sections, we wouldn't want to place an orphan read/write
2157 section before or amongst the read-only ones. */
2158 if (add
.head
!= NULL
)
2160 lang_output_section_statement_type
*newly_added_os
;
2162 /* Place OS after AFTER if AFTER_NOTE is TRUE. */
2165 lang_statement_union_type
**where
= insert_os_after (after
);
2170 place
->os_tail
= &after
->next
;
2174 /* Put it after the last orphan statement we added. */
2175 *add
.tail
= *place
->stmt
;
2176 *place
->stmt
= add
.head
;
2179 /* Fix the global list pointer if we happened to tack our
2180 new list at the tail. */
2181 if (*stat_ptr
->tail
== add
.head
)
2182 stat_ptr
->tail
= add
.tail
;
2184 /* Save the end of this list. */
2185 place
->stmt
= add
.tail
;
2187 /* Do the same for the list of output section statements. */
2188 newly_added_os
= *os_tail
;
2190 newly_added_os
->prev
= (lang_output_section_statement_type
*)
2191 ((char *) place
->os_tail
2192 - offsetof (lang_output_section_statement_type
, next
));
2193 newly_added_os
->next
= *place
->os_tail
;
2194 if (newly_added_os
->next
!= NULL
)
2195 newly_added_os
->next
->prev
= newly_added_os
;
2196 *place
->os_tail
= newly_added_os
;
2197 place
->os_tail
= &newly_added_os
->next
;
2199 /* Fixing the global list pointer here is a little different.
2200 We added to the list in lang_enter_output_section_statement,
2201 trimmed off the new output_section_statment above when
2202 assigning *os_tail = NULL, but possibly added it back in
2203 the same place when assigning *place->os_tail. */
2204 if (*os_tail
== NULL
)
2205 lang_os_list
.tail
= (lang_statement_union_type
**) os_tail
;
2212 lang_print_asneeded (void)
2214 struct asneeded_minfo
*m
;
2216 if (asneeded_list_head
== NULL
)
2219 minfo (_("\nAs-needed library included to satisfy reference by file (symbol)\n\n"));
2221 for (m
= asneeded_list_head
; m
!= NULL
; m
= m
->next
)
2225 minfo ("%s", m
->soname
);
2226 len
= strlen (m
->soname
);
2240 minfo ("%pB ", m
->ref
);
2241 minfo ("(%pT)\n", m
->name
);
2246 lang_map_flags (flagword flag
)
2248 if (flag
& SEC_ALLOC
)
2251 if (flag
& SEC_CODE
)
2254 if (flag
& SEC_READONLY
)
2257 if (flag
& SEC_DATA
)
2260 if (flag
& SEC_LOAD
)
2267 lang_memory_region_type
*m
;
2268 bool dis_header_printed
= false;
2270 LANG_FOR_EACH_INPUT_STATEMENT (file
)
2274 if ((file
->the_bfd
->flags
& (BFD_LINKER_CREATED
| DYNAMIC
)) != 0
2275 || file
->flags
.just_syms
)
2278 if (config
.print_map_discarded
)
2279 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
2280 if ((s
->output_section
== NULL
2281 || s
->output_section
->owner
!= link_info
.output_bfd
)
2282 && (s
->flags
& (SEC_LINKER_CREATED
| SEC_KEEP
)) == 0)
2284 if (! dis_header_printed
)
2286 fprintf (config
.map_file
, _("\nDiscarded input sections\n\n"));
2287 dis_header_printed
= true;
2290 print_input_section (s
, true);
2294 minfo (_("\nMemory Configuration\n\n"));
2295 fprintf (config
.map_file
, "%-16s %-18s %-18s %s\n",
2296 _("Name"), _("Origin"), _("Length"), _("Attributes"));
2298 for (m
= lang_memory_region_list
; m
!= NULL
; m
= m
->next
)
2303 fprintf (config
.map_file
, "%-16s ", m
->name_list
.name
);
2305 sprintf_vma (buf
, m
->origin
);
2306 minfo ("0x%s ", buf
);
2314 minfo ("0x%V", m
->length
);
2315 if (m
->flags
|| m
->not_flags
)
2323 lang_map_flags (m
->flags
);
2329 lang_map_flags (m
->not_flags
);
2336 fprintf (config
.map_file
, _("\nLinker script and memory map\n\n"));
2338 if (!link_info
.reduce_memory_overheads
)
2340 obstack_begin (&map_obstack
, 1000);
2341 bfd_link_hash_traverse (link_info
.hash
, sort_def_symbol
, 0);
2343 expld
.phase
= lang_fixed_phase_enum
;
2344 lang_statement_iteration
++;
2345 print_statements ();
2347 ldemul_extra_map_file_text (link_info
.output_bfd
, &link_info
,
2352 sort_def_symbol (struct bfd_link_hash_entry
*hash_entry
,
2353 void *info ATTRIBUTE_UNUSED
)
2355 if ((hash_entry
->type
== bfd_link_hash_defined
2356 || hash_entry
->type
== bfd_link_hash_defweak
)
2357 && hash_entry
->u
.def
.section
->owner
!= link_info
.output_bfd
2358 && hash_entry
->u
.def
.section
->owner
!= NULL
)
2360 input_section_userdata_type
*ud
;
2361 struct map_symbol_def
*def
;
2363 ud
= bfd_section_userdata (hash_entry
->u
.def
.section
);
2366 ud
= stat_alloc (sizeof (*ud
));
2367 bfd_set_section_userdata (hash_entry
->u
.def
.section
, ud
);
2368 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
2369 ud
->map_symbol_def_count
= 0;
2371 else if (!ud
->map_symbol_def_tail
)
2372 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
2374 def
= (struct map_symbol_def
*) obstack_alloc (&map_obstack
, sizeof *def
);
2375 def
->entry
= hash_entry
;
2376 *(ud
->map_symbol_def_tail
) = def
;
2377 ud
->map_symbol_def_tail
= &def
->next
;
2378 ud
->map_symbol_def_count
++;
2383 /* Initialize an output section. */
2386 init_os (lang_output_section_statement_type
*s
, flagword flags
)
2388 if (strcmp (s
->name
, DISCARD_SECTION_NAME
) == 0)
2389 einfo (_("%F%P: illegal use of `%s' section\n"), DISCARD_SECTION_NAME
);
2392 s
->bfd_section
= bfd_get_section_by_name (link_info
.output_bfd
, s
->name
);
2393 if (s
->bfd_section
== NULL
)
2394 s
->bfd_section
= bfd_make_section_anyway_with_flags (link_info
.output_bfd
,
2396 if (s
->bfd_section
== NULL
)
2398 einfo (_("%F%P: output format %s cannot represent section"
2399 " called %s: %E\n"),
2400 link_info
.output_bfd
->xvec
->name
, s
->name
);
2402 s
->bfd_section
->output_section
= s
->bfd_section
;
2403 s
->bfd_section
->output_offset
= 0;
2405 /* Set the userdata of the output section to the output section
2406 statement to avoid lookup. */
2407 bfd_set_section_userdata (s
->bfd_section
, s
);
2409 /* If there is a base address, make sure that any sections it might
2410 mention are initialized. */
2411 if (s
->addr_tree
!= NULL
)
2412 exp_init_os (s
->addr_tree
);
2414 if (s
->load_base
!= NULL
)
2415 exp_init_os (s
->load_base
);
2417 /* If supplied an alignment, set it. */
2418 if (s
->section_alignment
!= NULL
)
2419 s
->bfd_section
->alignment_power
= exp_get_power (s
->section_alignment
,
2420 "section alignment");
2423 /* Make sure that all output sections mentioned in an expression are
2427 exp_init_os (etree_type
*exp
)
2429 switch (exp
->type
.node_class
)
2433 case etree_provided
:
2434 exp_init_os (exp
->assign
.src
);
2438 exp_init_os (exp
->binary
.lhs
);
2439 exp_init_os (exp
->binary
.rhs
);
2443 exp_init_os (exp
->trinary
.cond
);
2444 exp_init_os (exp
->trinary
.lhs
);
2445 exp_init_os (exp
->trinary
.rhs
);
2449 exp_init_os (exp
->assert_s
.child
);
2453 exp_init_os (exp
->unary
.child
);
2457 switch (exp
->type
.node_code
)
2463 lang_output_section_statement_type
*os
;
2465 os
= lang_output_section_find (exp
->name
.name
);
2466 if (os
!= NULL
&& os
->bfd_section
== NULL
)
2478 section_already_linked (bfd
*abfd
, asection
*sec
, void *data
)
2480 lang_input_statement_type
*entry
= (lang_input_statement_type
*) data
;
2482 /* If we are only reading symbols from this object, then we want to
2483 discard all sections. */
2484 if (entry
->flags
.just_syms
)
2486 bfd_link_just_syms (abfd
, sec
, &link_info
);
2490 /* Deal with SHF_EXCLUDE ELF sections. */
2491 if (!bfd_link_relocatable (&link_info
)
2492 && (abfd
->flags
& BFD_PLUGIN
) == 0
2493 && (sec
->flags
& (SEC_GROUP
| SEC_KEEP
| SEC_EXCLUDE
)) == SEC_EXCLUDE
)
2494 sec
->output_section
= bfd_abs_section_ptr
;
2496 if (!(abfd
->flags
& DYNAMIC
))
2497 bfd_section_already_linked (abfd
, sec
, &link_info
);
2501 /* Returns true if SECTION is one we know will be discarded based on its
2502 section flags, otherwise returns false. */
2505 lang_discard_section_p (asection
*section
)
2508 flagword flags
= section
->flags
;
2510 /* Discard sections marked with SEC_EXCLUDE. */
2511 discard
= (flags
& SEC_EXCLUDE
) != 0;
2513 /* Discard the group descriptor sections when we're finally placing the
2514 sections from within the group. */
2515 if ((flags
& SEC_GROUP
) != 0
2516 && link_info
.resolve_section_groups
)
2519 /* Discard debugging sections if we are stripping debugging
2521 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
2522 && (flags
& SEC_DEBUGGING
) != 0)
2528 /* The wild routines.
2530 These expand statements like *(.text) and foo.o to a list of
2531 explicit actions, like foo.o(.text), bar.o(.text) and
2532 foo.o(.text, .data). */
2534 /* Add SECTION to the output section OUTPUT. Do this by creating a
2535 lang_input_section statement which is placed at PTR. */
2538 lang_add_section (lang_statement_list_type
*ptr
,
2540 struct wildcard_list
*pattern
,
2541 struct flag_info
*sflag_info
,
2542 lang_output_section_statement_type
*output
)
2544 flagword flags
= section
->flags
;
2547 lang_input_section_type
*new_section
;
2548 bfd
*abfd
= link_info
.output_bfd
;
2550 /* Is this section one we know should be discarded? */
2551 discard
= lang_discard_section_p (section
);
2553 /* Discard input sections which are assigned to a section named
2554 DISCARD_SECTION_NAME. */
2555 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
2560 if (section
->output_section
== NULL
)
2562 /* This prevents future calls from assigning this section. */
2563 section
->output_section
= bfd_abs_section_ptr
;
2565 else if (link_info
.non_contiguous_regions_warnings
)
2566 einfo (_("%P:%pS: warning: --enable-non-contiguous-regions makes "
2567 "section `%pA' from '%pB' match /DISCARD/ clause.\n"),
2568 NULL
, section
, section
->owner
);
2577 keep
= bfd_lookup_section_flags (&link_info
, sflag_info
, section
);
2582 if (section
->output_section
!= NULL
)
2584 if (!link_info
.non_contiguous_regions
)
2587 /* SECTION has already been handled in a special way
2588 (eg. LINK_ONCE): skip it. */
2589 if (bfd_is_abs_section (section
->output_section
))
2592 /* Already assigned to the same output section, do not process
2593 it again, to avoid creating loops between duplicate sections
2595 if (section
->output_section
== output
->bfd_section
)
2598 if (link_info
.non_contiguous_regions_warnings
&& output
->bfd_section
)
2599 einfo (_("%P:%pS: warning: --enable-non-contiguous-regions may "
2600 "change behaviour for section `%pA' from '%pB' (assigned to "
2601 "%pA, but additional match: %pA)\n"),
2602 NULL
, section
, section
->owner
, section
->output_section
,
2603 output
->bfd_section
);
2605 /* SECTION has already been assigned to an output section, but
2606 the user allows it to be mapped to another one in case it
2607 overflows. We'll later update the actual output section in
2608 size_input_section as appropriate. */
2611 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2612 to an output section, because we want to be able to include a
2613 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2614 section (I don't know why we want to do this, but we do).
2615 build_link_order in ldwrite.c handles this case by turning
2616 the embedded SEC_NEVER_LOAD section into a fill. */
2617 flags
&= ~ SEC_NEVER_LOAD
;
2619 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2620 already been processed. One reason to do this is that on pe
2621 format targets, .text$foo sections go into .text and it's odd
2622 to see .text with SEC_LINK_ONCE set. */
2623 if ((flags
& (SEC_LINK_ONCE
| SEC_GROUP
)) == (SEC_LINK_ONCE
| SEC_GROUP
))
2625 if (link_info
.resolve_section_groups
)
2626 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2628 flags
&= ~(SEC_LINK_DUPLICATES
| SEC_RELOC
);
2630 else if (!bfd_link_relocatable (&link_info
))
2631 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2633 switch (output
->sectype
)
2635 case normal_section
:
2636 case overlay_section
:
2637 case first_overlay_section
:
2639 case noalloc_section
:
2640 flags
&= ~SEC_ALLOC
;
2642 case readonly_section
:
2643 flags
|= SEC_READONLY
;
2645 case noload_section
:
2647 flags
|= SEC_NEVER_LOAD
;
2648 /* Unfortunately GNU ld has managed to evolve two different
2649 meanings to NOLOAD in scripts. ELF gets a .bss style noload,
2650 alloc, no contents section. All others get a noload, noalloc
2652 if (bfd_get_flavour (link_info
.output_bfd
) == bfd_target_elf_flavour
)
2653 flags
&= ~SEC_HAS_CONTENTS
;
2655 flags
&= ~SEC_ALLOC
;
2659 if (output
->bfd_section
== NULL
)
2660 init_os (output
, flags
);
2662 /* If SEC_READONLY is not set in the input section, then clear
2663 it from the output section. */
2664 output
->bfd_section
->flags
&= flags
| ~SEC_READONLY
;
2666 if (output
->bfd_section
->linker_has_input
)
2668 /* Only set SEC_READONLY flag on the first input section. */
2669 flags
&= ~ SEC_READONLY
;
2671 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2672 if ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
2673 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
2674 || ((flags
& SEC_MERGE
) != 0
2675 && output
->bfd_section
->entsize
!= section
->entsize
))
2677 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2678 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2681 output
->bfd_section
->flags
|= flags
;
2683 if (!output
->bfd_section
->linker_has_input
)
2685 output
->bfd_section
->linker_has_input
= 1;
2686 /* This must happen after flags have been updated. The output
2687 section may have been created before we saw its first input
2688 section, eg. for a data statement. */
2689 bfd_init_private_section_data (section
->owner
, section
,
2690 link_info
.output_bfd
,
2691 output
->bfd_section
,
2693 if ((flags
& SEC_MERGE
) != 0)
2694 output
->bfd_section
->entsize
= section
->entsize
;
2697 if ((flags
& SEC_TIC54X_BLOCK
) != 0
2698 && bfd_get_arch (section
->owner
) == bfd_arch_tic54x
)
2700 /* FIXME: This value should really be obtained from the bfd... */
2701 output
->block_value
= 128;
2704 /* When a .ctors section is placed in .init_array it must be copied
2705 in reverse order. Similarly for .dtors. Set that up. */
2706 if (bfd_get_flavour (link_info
.output_bfd
) == bfd_target_elf_flavour
2707 && ((startswith (section
->name
, ".ctors")
2708 && strcmp (output
->bfd_section
->name
, ".init_array") == 0)
2709 || (startswith (section
->name
, ".dtors")
2710 && strcmp (output
->bfd_section
->name
, ".fini_array") == 0))
2711 && (section
->name
[6] == 0 || section
->name
[6] == '.'))
2712 section
->flags
|= SEC_ELF_REVERSE_COPY
;
2714 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
2715 output
->bfd_section
->alignment_power
= section
->alignment_power
;
2717 section
->output_section
= output
->bfd_section
;
2719 if (!map_head_is_link_order
)
2721 asection
*s
= output
->bfd_section
->map_tail
.s
;
2722 output
->bfd_section
->map_tail
.s
= section
;
2723 section
->map_head
.s
= NULL
;
2724 section
->map_tail
.s
= s
;
2726 s
->map_head
.s
= section
;
2728 output
->bfd_section
->map_head
.s
= section
;
2731 /* Add a section reference to the list. */
2732 new_section
= new_stat (lang_input_section
, ptr
);
2733 new_section
->section
= section
;
2734 new_section
->pattern
= pattern
;
2737 /* Handle wildcard sorting. This returns the lang_input_section which
2738 should follow the one we are going to create for SECTION and FILE,
2739 based on the sorting requirements of WILD. It returns NULL if the
2740 new section should just go at the end of the current list. */
2742 static lang_statement_union_type
*
2743 wild_sort (lang_wild_statement_type
*wild
,
2744 struct wildcard_list
*sec
,
2745 lang_input_statement_type
*file
,
2748 lang_statement_union_type
*l
;
2750 if (!wild
->filenames_sorted
2751 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2754 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2756 lang_input_section_type
*ls
;
2758 if (l
->header
.type
!= lang_input_section_enum
)
2760 ls
= &l
->input_section
;
2762 /* Sorting by filename takes precedence over sorting by section
2765 if (wild
->filenames_sorted
)
2767 const char *fn
, *ln
;
2771 /* The PE support for the .idata section as generated by
2772 dlltool assumes that files will be sorted by the name of
2773 the archive and then the name of the file within the
2776 if (file
->the_bfd
!= NULL
2777 && file
->the_bfd
->my_archive
!= NULL
)
2779 fn
= bfd_get_filename (file
->the_bfd
->my_archive
);
2784 fn
= file
->filename
;
2788 if (ls
->section
->owner
->my_archive
!= NULL
)
2790 ln
= bfd_get_filename (ls
->section
->owner
->my_archive
);
2795 ln
= bfd_get_filename (ls
->section
->owner
);
2799 i
= filename_cmp (fn
, ln
);
2808 fn
= file
->filename
;
2810 ln
= bfd_get_filename (ls
->section
->owner
);
2812 i
= filename_cmp (fn
, ln
);
2820 /* Here either the files are not sorted by name, or we are
2821 looking at the sections for this file. */
2824 && sec
->spec
.sorted
!= none
2825 && sec
->spec
.sorted
!= by_none
)
2826 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2833 /* Expand a wild statement for a particular FILE. SECTION may be
2834 NULL, in which case it is a wild card. */
2837 output_section_callback (lang_wild_statement_type
*ptr
,
2838 struct wildcard_list
*sec
,
2840 lang_input_statement_type
*file
,
2843 lang_statement_union_type
*before
;
2844 lang_output_section_statement_type
*os
;
2846 os
= (lang_output_section_statement_type
*) output
;
2848 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2849 if (unique_section_p (section
, os
))
2852 before
= wild_sort (ptr
, sec
, file
, section
);
2854 /* Here BEFORE points to the lang_input_section which
2855 should follow the one we are about to add. If BEFORE
2856 is NULL, then the section should just go at the end
2857 of the current list. */
2860 lang_add_section (&ptr
->children
, section
, ptr
->section_list
,
2861 ptr
->section_flag_list
, os
);
2864 lang_statement_list_type list
;
2865 lang_statement_union_type
**pp
;
2867 lang_list_init (&list
);
2868 lang_add_section (&list
, section
, ptr
->section_list
,
2869 ptr
->section_flag_list
, os
);
2871 /* If we are discarding the section, LIST.HEAD will
2873 if (list
.head
!= NULL
)
2875 ASSERT (list
.head
->header
.next
== NULL
);
2877 for (pp
= &ptr
->children
.head
;
2879 pp
= &(*pp
)->header
.next
)
2880 ASSERT (*pp
!= NULL
);
2882 list
.head
->header
.next
= *pp
;
2888 /* Check if all sections in a wild statement for a particular FILE
2892 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2893 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2895 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2898 lang_output_section_statement_type
*os
;
2900 os
= (lang_output_section_statement_type
*) output
;
2902 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2903 if (unique_section_p (section
, os
))
2906 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2907 os
->all_input_readonly
= false;
2910 /* This is passed a file name which must have been seen already and
2911 added to the statement tree. We will see if it has been opened
2912 already and had its symbols read. If not then we'll read it. */
2914 static lang_input_statement_type
*
2915 lookup_name (const char *name
)
2917 lang_input_statement_type
*search
;
2919 for (search
= (void *) input_file_chain
.head
;
2921 search
= search
->next_real_file
)
2923 /* Use the local_sym_name as the name of the file that has
2924 already been loaded as filename might have been transformed
2925 via the search directory lookup mechanism. */
2926 const char *filename
= search
->local_sym_name
;
2928 if (filename
!= NULL
2929 && filename_cmp (filename
, name
) == 0)
2935 /* Arrange to splice the input statement added by new_afile into
2936 statement_list after the current input_file_chain tail.
2937 We know input_file_chain is not an empty list, and that
2938 lookup_name was called via open_input_bfds. Later calls to
2939 lookup_name should always match an existing input_statement. */
2940 lang_statement_union_type
**tail
= stat_ptr
->tail
;
2941 lang_statement_union_type
**after
2942 = (void *) ((char *) input_file_chain
.tail
2943 - offsetof (lang_input_statement_type
, next_real_file
)
2944 + offsetof (lang_input_statement_type
, header
.next
));
2945 lang_statement_union_type
*rest
= *after
;
2946 stat_ptr
->tail
= after
;
2947 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2948 default_target
, NULL
);
2949 *stat_ptr
->tail
= rest
;
2951 stat_ptr
->tail
= tail
;
2954 /* If we have already added this file, or this file is not real
2955 don't add this file. */
2956 if (search
->flags
.loaded
|| !search
->flags
.real
)
2959 if (!load_symbols (search
, NULL
))
2965 /* Save LIST as a list of libraries whose symbols should not be exported. */
2970 struct excluded_lib
*next
;
2972 static struct excluded_lib
*excluded_libs
;
2975 add_excluded_libs (const char *list
)
2977 const char *p
= list
, *end
;
2981 struct excluded_lib
*entry
;
2982 end
= strpbrk (p
, ",:");
2984 end
= p
+ strlen (p
);
2985 entry
= (struct excluded_lib
*) xmalloc (sizeof (*entry
));
2986 entry
->next
= excluded_libs
;
2987 entry
->name
= (char *) xmalloc (end
- p
+ 1);
2988 memcpy (entry
->name
, p
, end
- p
);
2989 entry
->name
[end
- p
] = '\0';
2990 excluded_libs
= entry
;
2998 check_excluded_libs (bfd
*abfd
)
3000 struct excluded_lib
*lib
= excluded_libs
;
3004 int len
= strlen (lib
->name
);
3005 const char *filename
= lbasename (bfd_get_filename (abfd
));
3007 if (strcmp (lib
->name
, "ALL") == 0)
3009 abfd
->no_export
= true;
3013 if (filename_ncmp (lib
->name
, filename
, len
) == 0
3014 && (filename
[len
] == '\0'
3015 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
3016 && filename
[len
+ 2] == '\0')))
3018 abfd
->no_export
= true;
3026 /* Get the symbols for an input file. */
3029 load_symbols (lang_input_statement_type
*entry
,
3030 lang_statement_list_type
*place
)
3034 if (entry
->flags
.loaded
)
3037 ldfile_open_file (entry
);
3039 /* Do not process further if the file was missing. */
3040 if (entry
->flags
.missing_file
)
3043 if (trace_files
|| verbose
)
3044 info_msg ("%pI\n", entry
);
3046 if (!bfd_check_format (entry
->the_bfd
, bfd_archive
)
3047 && !bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
3050 struct lang_input_statement_flags save_flags
;
3053 err
= bfd_get_error ();
3055 /* See if the emulation has some special knowledge. */
3056 if (ldemul_unrecognized_file (entry
))
3059 if (err
== bfd_error_file_ambiguously_recognized
)
3063 einfo (_("%P: %pB: file not recognized: %E;"
3064 " matching formats:"), entry
->the_bfd
);
3065 for (p
= matching
; *p
!= NULL
; p
++)
3069 else if (err
!= bfd_error_file_not_recognized
3071 einfo (_("%F%P: %pB: file not recognized: %E\n"), entry
->the_bfd
);
3073 bfd_close (entry
->the_bfd
);
3074 entry
->the_bfd
= NULL
;
3076 /* Try to interpret the file as a linker script. */
3077 save_flags
= input_flags
;
3078 ldfile_open_command_file (entry
->filename
);
3080 push_stat_ptr (place
);
3081 input_flags
.add_DT_NEEDED_for_regular
3082 = entry
->flags
.add_DT_NEEDED_for_regular
;
3083 input_flags
.add_DT_NEEDED_for_dynamic
3084 = entry
->flags
.add_DT_NEEDED_for_dynamic
;
3085 input_flags
.whole_archive
= entry
->flags
.whole_archive
;
3086 input_flags
.dynamic
= entry
->flags
.dynamic
;
3088 ldfile_assumed_script
= true;
3089 parser_input
= input_script
;
3090 current_input_file
= entry
->filename
;
3092 current_input_file
= NULL
;
3093 ldfile_assumed_script
= false;
3095 /* missing_file is sticky. sysrooted will already have been
3096 restored when seeing EOF in yyparse, but no harm to restore
3098 save_flags
.missing_file
|= input_flags
.missing_file
;
3099 input_flags
= save_flags
;
3103 entry
->flags
.loaded
= true;
3108 if (ldemul_recognized_file (entry
))
3111 /* We don't call ldlang_add_file for an archive. Instead, the
3112 add_symbols entry point will call ldlang_add_file, via the
3113 add_archive_element callback, for each element of the archive
3115 switch (bfd_get_format (entry
->the_bfd
))
3121 if (!entry
->flags
.reload
)
3122 ldlang_add_file (entry
);
3126 check_excluded_libs (entry
->the_bfd
);
3128 bfd_set_usrdata (entry
->the_bfd
, entry
);
3129 if (entry
->flags
.whole_archive
)
3137 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
3142 if (!bfd_check_format (member
, bfd_object
))
3144 einfo (_("%F%P: %pB: member %pB in archive is not an object\n"),
3145 entry
->the_bfd
, member
);
3150 if (!(*link_info
.callbacks
3151 ->add_archive_element
) (&link_info
, member
,
3152 "--whole-archive", &subsbfd
))
3155 /* Potentially, the add_archive_element hook may have set a
3156 substitute BFD for us. */
3157 if (!bfd_link_add_symbols (subsbfd
, &link_info
))
3159 einfo (_("%F%P: %pB: error adding symbols: %E\n"), member
);
3164 entry
->flags
.loaded
= loaded
;
3170 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
3171 entry
->flags
.loaded
= true;
3173 einfo (_("%F%P: %pB: error adding symbols: %E\n"), entry
->the_bfd
);
3175 return entry
->flags
.loaded
;
3178 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
3179 may be NULL, indicating that it is a wildcard. Separate
3180 lang_input_section statements are created for each part of the
3181 expansion; they are added after the wild statement S. OUTPUT is
3182 the output section. */
3185 wild (lang_wild_statement_type
*s
,
3186 const char *target ATTRIBUTE_UNUSED
,
3187 lang_output_section_statement_type
*output
)
3189 struct wildcard_list
*sec
;
3191 if (s
->handler_data
[0]
3192 && s
->handler_data
[0]->spec
.sorted
== by_name
3193 && !s
->filenames_sorted
)
3195 lang_section_bst_type
*tree
;
3197 walk_wild (s
, output_section_callback_fast
, output
);
3202 output_section_callback_tree_to_list (s
, tree
, output
);
3207 walk_wild (s
, output_section_callback
, output
);
3209 if (default_common_section
== NULL
)
3210 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
3211 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
3213 /* Remember the section that common is going to in case we
3214 later get something which doesn't know where to put it. */
3215 default_common_section
= output
;
3220 /* Return TRUE iff target is the sought target. */
3223 get_target (const bfd_target
*target
, void *data
)
3225 const char *sought
= (const char *) data
;
3227 return strcmp (target
->name
, sought
) == 0;
3230 /* Like strcpy() but convert to lower case as well. */
3233 stricpy (char *dest
, const char *src
)
3237 while ((c
= *src
++) != 0)
3238 *dest
++ = TOLOWER (c
);
3243 /* Remove the first occurrence of needle (if any) in haystack
3247 strcut (char *haystack
, const char *needle
)
3249 haystack
= strstr (haystack
, needle
);
3255 for (src
= haystack
+ strlen (needle
); *src
;)
3256 *haystack
++ = *src
++;
3262 /* Compare two target format name strings.
3263 Return a value indicating how "similar" they are. */
3266 name_compare (const char *first
, const char *second
)
3272 copy1
= (char *) xmalloc (strlen (first
) + 1);
3273 copy2
= (char *) xmalloc (strlen (second
) + 1);
3275 /* Convert the names to lower case. */
3276 stricpy (copy1
, first
);
3277 stricpy (copy2
, second
);
3279 /* Remove size and endian strings from the name. */
3280 strcut (copy1
, "big");
3281 strcut (copy1
, "little");
3282 strcut (copy2
, "big");
3283 strcut (copy2
, "little");
3285 /* Return a value based on how many characters match,
3286 starting from the beginning. If both strings are
3287 the same then return 10 * their length. */
3288 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
3289 if (copy1
[result
] == 0)
3301 /* Set by closest_target_match() below. */
3302 static const bfd_target
*winner
;
3304 /* Scan all the valid bfd targets looking for one that has the endianness
3305 requirement that was specified on the command line, and is the nearest
3306 match to the original output target. */
3309 closest_target_match (const bfd_target
*target
, void *data
)
3311 const bfd_target
*original
= (const bfd_target
*) data
;
3313 if (command_line
.endian
== ENDIAN_BIG
3314 && target
->byteorder
!= BFD_ENDIAN_BIG
)
3317 if (command_line
.endian
== ENDIAN_LITTLE
3318 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
3321 /* Must be the same flavour. */
3322 if (target
->flavour
!= original
->flavour
)
3325 /* Ignore generic big and little endian elf vectors. */
3326 if (strcmp (target
->name
, "elf32-big") == 0
3327 || strcmp (target
->name
, "elf64-big") == 0
3328 || strcmp (target
->name
, "elf32-little") == 0
3329 || strcmp (target
->name
, "elf64-little") == 0)
3332 /* If we have not found a potential winner yet, then record this one. */
3339 /* Oh dear, we now have two potential candidates for a successful match.
3340 Compare their names and choose the better one. */
3341 if (name_compare (target
->name
, original
->name
)
3342 > name_compare (winner
->name
, original
->name
))
3345 /* Keep on searching until wqe have checked them all. */
3349 /* Return the BFD target format of the first input file. */
3352 get_first_input_target (void)
3354 const char *target
= NULL
;
3356 LANG_FOR_EACH_INPUT_STATEMENT (s
)
3358 if (s
->header
.type
== lang_input_statement_enum
3361 ldfile_open_file (s
);
3363 if (s
->the_bfd
!= NULL
3364 && bfd_check_format (s
->the_bfd
, bfd_object
))
3366 target
= bfd_get_target (s
->the_bfd
);
3378 lang_get_output_target (void)
3382 /* Has the user told us which output format to use? */
3383 if (output_target
!= NULL
)
3384 return output_target
;
3386 /* No - has the current target been set to something other than
3388 if (current_target
!= default_target
&& current_target
!= NULL
)
3389 return current_target
;
3391 /* No - can we determine the format of the first input file? */
3392 target
= get_first_input_target ();
3396 /* Failed - use the default output target. */
3397 return default_target
;
3400 /* Open the output file. */
3403 open_output (const char *name
)
3405 lang_input_statement_type
*f
;
3406 char *out
= lrealpath (name
);
3408 for (f
= (void *) input_file_chain
.head
;
3410 f
= f
->next_real_file
)
3413 char *in
= lrealpath (f
->local_sym_name
);
3414 if (filename_cmp (in
, out
) == 0)
3415 einfo (_("%F%P: input file '%s' is the same as output file\n"),
3421 output_target
= lang_get_output_target ();
3423 /* Has the user requested a particular endianness on the command
3425 if (command_line
.endian
!= ENDIAN_UNSET
)
3427 /* Get the chosen target. */
3428 const bfd_target
*target
3429 = bfd_iterate_over_targets (get_target
, (void *) output_target
);
3431 /* If the target is not supported, we cannot do anything. */
3434 enum bfd_endian desired_endian
;
3436 if (command_line
.endian
== ENDIAN_BIG
)
3437 desired_endian
= BFD_ENDIAN_BIG
;
3439 desired_endian
= BFD_ENDIAN_LITTLE
;
3441 /* See if the target has the wrong endianness. This should
3442 not happen if the linker script has provided big and
3443 little endian alternatives, but some scrips don't do
3445 if (target
->byteorder
!= desired_endian
)
3447 /* If it does, then see if the target provides
3448 an alternative with the correct endianness. */
3449 if (target
->alternative_target
!= NULL
3450 && (target
->alternative_target
->byteorder
== desired_endian
))
3451 output_target
= target
->alternative_target
->name
;
3454 /* Try to find a target as similar as possible to
3455 the default target, but which has the desired
3456 endian characteristic. */
3457 bfd_iterate_over_targets (closest_target_match
,
3460 /* Oh dear - we could not find any targets that
3461 satisfy our requirements. */
3463 einfo (_("%P: warning: could not find any targets"
3464 " that match endianness requirement\n"));
3466 output_target
= winner
->name
;
3472 link_info
.output_bfd
= bfd_openw (name
, output_target
);
3474 if (link_info
.output_bfd
== NULL
)
3476 if (bfd_get_error () == bfd_error_invalid_target
)
3477 einfo (_("%F%P: target %s not found\n"), output_target
);
3479 einfo (_("%F%P: cannot open output file %s: %E\n"), name
);
3482 delete_output_file_on_failure
= true;
3484 if (!bfd_set_format (link_info
.output_bfd
, bfd_object
))
3485 einfo (_("%F%P: %s: can not make object file: %E\n"), name
);
3486 if (!bfd_set_arch_mach (link_info
.output_bfd
,
3487 ldfile_output_architecture
,
3488 ldfile_output_machine
))
3489 einfo (_("%F%P: %s: can not set architecture: %E\n"), name
);
3491 link_info
.hash
= bfd_link_hash_table_create (link_info
.output_bfd
);
3492 if (link_info
.hash
== NULL
)
3493 einfo (_("%F%P: can not create hash table: %E\n"));
3495 bfd_set_gp_size (link_info
.output_bfd
, g_switch_value
);
3499 ldlang_open_output (lang_statement_union_type
*statement
)
3501 switch (statement
->header
.type
)
3503 case lang_output_statement_enum
:
3504 ASSERT (link_info
.output_bfd
== NULL
);
3505 open_output (statement
->output_statement
.name
);
3506 ldemul_set_output_arch ();
3507 if (config
.magic_demand_paged
3508 && !bfd_link_relocatable (&link_info
))
3509 link_info
.output_bfd
->flags
|= D_PAGED
;
3511 link_info
.output_bfd
->flags
&= ~D_PAGED
;
3512 if (config
.text_read_only
)
3513 link_info
.output_bfd
->flags
|= WP_TEXT
;
3515 link_info
.output_bfd
->flags
&= ~WP_TEXT
;
3516 if (link_info
.traditional_format
)
3517 link_info
.output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
3519 link_info
.output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
3522 case lang_target_statement_enum
:
3523 current_target
= statement
->target_statement
.target
;
3531 init_opb (asection
*s
)
3536 if (bfd_get_flavour (link_info
.output_bfd
) == bfd_target_elf_flavour
3538 && (s
->flags
& SEC_ELF_OCTETS
) != 0)
3541 x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
3542 ldfile_output_machine
);
3544 while ((x
& 1) == 0)
3552 /* Open all the input files. */
3556 OPEN_BFD_NORMAL
= 0,
3560 #if BFD_SUPPORTS_PLUGINS
3561 static lang_input_statement_type
*plugin_insert
= NULL
;
3562 static struct bfd_link_hash_entry
*plugin_undefs
= NULL
;
3566 open_input_bfds (lang_statement_union_type
*s
, enum open_bfd_mode mode
)
3568 for (; s
!= NULL
; s
= s
->header
.next
)
3570 switch (s
->header
.type
)
3572 case lang_constructors_statement_enum
:
3573 open_input_bfds (constructor_list
.head
, mode
);
3575 case lang_output_section_statement_enum
:
3576 open_input_bfds (s
->output_section_statement
.children
.head
, mode
);
3578 case lang_wild_statement_enum
:
3579 /* Maybe we should load the file's symbols. */
3580 if ((mode
& OPEN_BFD_RESCAN
) == 0
3581 && s
->wild_statement
.filename
3582 && !wildcardp (s
->wild_statement
.filename
)
3583 && !archive_path (s
->wild_statement
.filename
))
3584 lookup_name (s
->wild_statement
.filename
);
3585 open_input_bfds (s
->wild_statement
.children
.head
, mode
);
3587 case lang_group_statement_enum
:
3589 struct bfd_link_hash_entry
*undefs
;
3590 #if BFD_SUPPORTS_PLUGINS
3591 lang_input_statement_type
*plugin_insert_save
;
3594 /* We must continually search the entries in the group
3595 until no new symbols are added to the list of undefined
3600 #if BFD_SUPPORTS_PLUGINS
3601 plugin_insert_save
= plugin_insert
;
3603 undefs
= link_info
.hash
->undefs_tail
;
3604 open_input_bfds (s
->group_statement
.children
.head
,
3605 mode
| OPEN_BFD_FORCE
);
3607 while (undefs
!= link_info
.hash
->undefs_tail
3608 #if BFD_SUPPORTS_PLUGINS
3609 /* Objects inserted by a plugin, which are loaded
3610 before we hit this loop, may have added new
3612 || (plugin_insert
!= plugin_insert_save
&& plugin_undefs
)
3617 case lang_target_statement_enum
:
3618 current_target
= s
->target_statement
.target
;
3620 case lang_input_statement_enum
:
3621 if (s
->input_statement
.flags
.real
)
3623 lang_statement_union_type
**os_tail
;
3624 lang_statement_list_type add
;
3627 s
->input_statement
.target
= current_target
;
3629 /* If we are being called from within a group, and this
3630 is an archive which has already been searched, then
3631 force it to be researched unless the whole archive
3632 has been loaded already. Do the same for a rescan.
3633 Likewise reload --as-needed shared libs. */
3634 if (mode
!= OPEN_BFD_NORMAL
3635 #if BFD_SUPPORTS_PLUGINS
3636 && ((mode
& OPEN_BFD_RESCAN
) == 0
3637 || plugin_insert
== NULL
)
3639 && s
->input_statement
.flags
.loaded
3640 && (abfd
= s
->input_statement
.the_bfd
) != NULL
3641 && ((bfd_get_format (abfd
) == bfd_archive
3642 && !s
->input_statement
.flags
.whole_archive
)
3643 || (bfd_get_format (abfd
) == bfd_object
3644 && ((abfd
->flags
) & DYNAMIC
) != 0
3645 && s
->input_statement
.flags
.add_DT_NEEDED_for_regular
3646 && bfd_get_flavour (abfd
) == bfd_target_elf_flavour
3647 && (elf_dyn_lib_class (abfd
) & DYN_AS_NEEDED
) != 0)))
3649 s
->input_statement
.flags
.loaded
= false;
3650 s
->input_statement
.flags
.reload
= true;
3653 os_tail
= lang_os_list
.tail
;
3654 lang_list_init (&add
);
3656 if (!load_symbols (&s
->input_statement
, &add
))
3657 config
.make_executable
= false;
3659 if (add
.head
!= NULL
)
3661 /* If this was a script with output sections then
3662 tack any added statements on to the end of the
3663 list. This avoids having to reorder the output
3664 section statement list. Very likely the user
3665 forgot -T, and whatever we do here will not meet
3666 naive user expectations. */
3667 if (os_tail
!= lang_os_list
.tail
)
3669 einfo (_("%P: warning: %s contains output sections;"
3670 " did you forget -T?\n"),
3671 s
->input_statement
.filename
);
3672 *stat_ptr
->tail
= add
.head
;
3673 stat_ptr
->tail
= add
.tail
;
3677 *add
.tail
= s
->header
.next
;
3678 s
->header
.next
= add
.head
;
3682 #if BFD_SUPPORTS_PLUGINS
3683 /* If we have found the point at which a plugin added new
3684 files, clear plugin_insert to enable archive rescan. */
3685 if (&s
->input_statement
== plugin_insert
)
3686 plugin_insert
= NULL
;
3689 case lang_assignment_statement_enum
:
3690 if (s
->assignment_statement
.exp
->type
.node_class
!= etree_assert
)
3691 exp_fold_tree_no_dot (s
->assignment_statement
.exp
);
3698 /* Exit if any of the files were missing. */
3699 if (input_flags
.missing_file
)
3703 #ifdef ENABLE_LIBCTF
3704 /* Emit CTF errors and warnings. fp can be NULL to report errors/warnings
3705 that happened specifically at CTF open time. */
3707 lang_ctf_errs_warnings (ctf_dict_t
*fp
)
3709 ctf_next_t
*i
= NULL
;
3714 while ((text
= ctf_errwarning_next (fp
, &i
, &is_warning
, &err
)) != NULL
)
3716 einfo (_("%s: %s\n"), is_warning
? _("CTF warning"): _("CTF error"),
3720 if (err
!= ECTF_NEXT_END
)
3722 einfo (_("CTF error: cannot get CTF errors: `%s'\n"),
3726 /* `err' returns errors from the error/warning iterator in particular.
3727 These never assert. But if we have an fp, that could have recorded
3728 an assertion failure: assert if it has done so. */
3729 ASSERT (!fp
|| ctf_errno (fp
) != ECTF_INTERNAL
);
3732 /* Open the CTF sections in the input files with libctf: if any were opened,
3733 create a fake input file that we'll write the merged CTF data to later
3737 ldlang_open_ctf (void)
3742 LANG_FOR_EACH_INPUT_STATEMENT (file
)
3746 /* Incoming files from the compiler have a single ctf_dict_t in them
3747 (which is presented to us by the libctf API in a ctf_archive_t
3748 wrapper): files derived from a previous relocatable link have a CTF
3749 archive containing possibly many CTF files. */
3751 if ((file
->the_ctf
= ctf_bfdopen (file
->the_bfd
, &err
)) == NULL
)
3753 if (err
!= ECTF_NOCTFDATA
)
3755 lang_ctf_errs_warnings (NULL
);
3756 einfo (_("%P: warning: CTF section in %pB not loaded; "
3757 "its types will be discarded: %s\n"), file
->the_bfd
,
3763 /* Prevent the contents of this section from being written, while
3764 requiring the section itself to be duplicated in the output, but only
3766 /* This section must exist if ctf_bfdopen() succeeded. */
3767 sect
= bfd_get_section_by_name (file
->the_bfd
, ".ctf");
3769 sect
->flags
|= SEC_NEVER_LOAD
| SEC_HAS_CONTENTS
| SEC_LINKER_CREATED
;
3772 sect
->flags
|= SEC_EXCLUDE
;
3782 if ((ctf_output
= ctf_create (&err
)) != NULL
)
3785 einfo (_("%P: warning: CTF output not created: `%s'\n"),
3788 LANG_FOR_EACH_INPUT_STATEMENT (errfile
)
3789 ctf_close (errfile
->the_ctf
);
3792 /* Merge together CTF sections. After this, only the symtab-dependent
3793 function and data object sections need adjustment. */
3796 lang_merge_ctf (void)
3798 asection
*output_sect
;
3804 output_sect
= bfd_get_section_by_name (link_info
.output_bfd
, ".ctf");
3806 /* If the section was discarded, don't waste time merging. */
3807 if (output_sect
== NULL
)
3809 ctf_dict_close (ctf_output
);
3812 LANG_FOR_EACH_INPUT_STATEMENT (file
)
3814 ctf_close (file
->the_ctf
);
3815 file
->the_ctf
= NULL
;
3820 LANG_FOR_EACH_INPUT_STATEMENT (file
)
3825 /* Takes ownership of file->the_ctf. */
3826 if (ctf_link_add_ctf (ctf_output
, file
->the_ctf
, file
->filename
) < 0)
3828 einfo (_("%P: warning: CTF section in %pB cannot be linked: `%s'\n"),
3829 file
->the_bfd
, ctf_errmsg (ctf_errno (ctf_output
)));
3830 ctf_close (file
->the_ctf
);
3831 file
->the_ctf
= NULL
;
3836 if (!config
.ctf_share_duplicated
)
3837 flags
= CTF_LINK_SHARE_UNCONFLICTED
;
3839 flags
= CTF_LINK_SHARE_DUPLICATED
;
3840 if (!config
.ctf_variables
)
3841 flags
|= CTF_LINK_OMIT_VARIABLES_SECTION
;
3842 if (bfd_link_relocatable (&link_info
))
3843 flags
|= CTF_LINK_NO_FILTER_REPORTED_SYMS
;
3845 if (ctf_link (ctf_output
, flags
) < 0)
3847 lang_ctf_errs_warnings (ctf_output
);
3848 einfo (_("%P: warning: CTF linking failed; "
3849 "output will have no CTF section: %s\n"),
3850 ctf_errmsg (ctf_errno (ctf_output
)));
3853 output_sect
->size
= 0;
3854 output_sect
->flags
|= SEC_EXCLUDE
;
3857 /* Output any lingering errors that didn't come from ctf_link. */
3858 lang_ctf_errs_warnings (ctf_output
);
3861 /* Let the emulation acquire strings from the dynamic strtab to help it optimize
3862 the CTF, if supported. */
3865 ldlang_ctf_acquire_strings (struct elf_strtab_hash
*dynstrtab
)
3867 ldemul_acquire_strings_for_ctf (ctf_output
, dynstrtab
);
3870 /* Inform the emulation about the addition of a new dynamic symbol, in BFD
3872 void ldlang_ctf_new_dynsym (int symidx
, struct elf_internal_sym
*sym
)
3874 ldemul_new_dynsym_for_ctf (ctf_output
, symidx
, sym
);
3877 /* Write out the CTF section. Called early, if the emulation isn't going to
3878 need to dedup against the strtab and symtab, then possibly called from the
3879 target linker code if the dedup has happened. */
3881 lang_write_ctf (int late
)
3884 asection
*output_sect
;
3891 /* Emit CTF late if this emulation says it can do so. */
3892 if (ldemul_emit_ctf_early ())
3897 if (!ldemul_emit_ctf_early ())
3901 /* Inform the emulation that all the symbols that will be received have
3904 ldemul_new_dynsym_for_ctf (ctf_output
, 0, NULL
);
3908 output_sect
= bfd_get_section_by_name (link_info
.output_bfd
, ".ctf");
3911 output_sect
->contents
= ctf_link_write (ctf_output
, &output_size
,
3912 CTF_COMPRESSION_THRESHOLD
);
3913 output_sect
->size
= output_size
;
3914 output_sect
->flags
|= SEC_IN_MEMORY
| SEC_KEEP
;
3916 lang_ctf_errs_warnings (ctf_output
);
3917 if (!output_sect
->contents
)
3919 einfo (_("%P: warning: CTF section emission failed; "
3920 "output will have no CTF section: %s\n"),
3921 ctf_errmsg (ctf_errno (ctf_output
)));
3922 output_sect
->size
= 0;
3923 output_sect
->flags
|= SEC_EXCLUDE
;
3927 /* This also closes every CTF input file used in the link. */
3928 ctf_dict_close (ctf_output
);
3931 LANG_FOR_EACH_INPUT_STATEMENT (file
)
3932 file
->the_ctf
= NULL
;
3935 /* Write out the CTF section late, if the emulation needs that. */
3938 ldlang_write_ctf_late (void)
3940 /* Trigger a "late call", if the emulation needs one. */
3946 ldlang_open_ctf (void)
3948 LANG_FOR_EACH_INPUT_STATEMENT (file
)
3952 /* If built without CTF, warn and delete all CTF sections from the output.
3953 (The alternative would be to simply concatenate them, which does not
3954 yield a valid CTF section.) */
3956 if ((sect
= bfd_get_section_by_name (file
->the_bfd
, ".ctf")) != NULL
)
3958 einfo (_("%P: warning: CTF section in %pB not linkable: "
3959 "%P was built without support for CTF\n"), file
->the_bfd
);
3961 sect
->flags
|= SEC_EXCLUDE
;
3966 static void lang_merge_ctf (void) {}
3968 ldlang_ctf_acquire_strings (struct elf_strtab_hash
*dynstrtab
3969 ATTRIBUTE_UNUSED
) {}
3971 ldlang_ctf_new_dynsym (int symidx ATTRIBUTE_UNUSED
,
3972 struct elf_internal_sym
*sym ATTRIBUTE_UNUSED
) {}
3973 static void lang_write_ctf (int late ATTRIBUTE_UNUSED
) {}
3974 void ldlang_write_ctf_late (void) {}
3977 /* Add the supplied name to the symbol table as an undefined reference.
3978 This is a two step process as the symbol table doesn't even exist at
3979 the time the ld command line is processed. First we put the name
3980 on a list, then, once the output file has been opened, transfer the
3981 name to the symbol table. */
3983 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
3985 #define ldlang_undef_chain_list_head entry_symbol.next
3988 ldlang_add_undef (const char *const name
, bool cmdline ATTRIBUTE_UNUSED
)
3990 ldlang_undef_chain_list_type
*new_undef
;
3992 new_undef
= stat_alloc (sizeof (*new_undef
));
3993 new_undef
->next
= ldlang_undef_chain_list_head
;
3994 ldlang_undef_chain_list_head
= new_undef
;
3996 new_undef
->name
= xstrdup (name
);
3998 if (link_info
.output_bfd
!= NULL
)
3999 insert_undefined (new_undef
->name
);
4002 /* Insert NAME as undefined in the symbol table. */
4005 insert_undefined (const char *name
)
4007 struct bfd_link_hash_entry
*h
;
4009 h
= bfd_link_hash_lookup (link_info
.hash
, name
, true, false, true);
4011 einfo (_("%F%P: bfd_link_hash_lookup failed: %E\n"));
4012 if (h
->type
== bfd_link_hash_new
)
4014 h
->type
= bfd_link_hash_undefined
;
4015 h
->u
.undef
.abfd
= NULL
;
4016 h
->non_ir_ref_regular
= true;
4017 bfd_link_add_undef (link_info
.hash
, h
);
4021 /* Run through the list of undefineds created above and place them
4022 into the linker hash table as undefined symbols belonging to the
4026 lang_place_undefineds (void)
4028 ldlang_undef_chain_list_type
*ptr
;
4030 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
4031 insert_undefined (ptr
->name
);
4034 /* Mark -u symbols against garbage collection. */
4037 lang_mark_undefineds (void)
4039 ldlang_undef_chain_list_type
*ptr
;
4041 if (is_elf_hash_table (link_info
.hash
))
4042 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
4044 struct elf_link_hash_entry
*h
= (struct elf_link_hash_entry
*)
4045 bfd_link_hash_lookup (link_info
.hash
, ptr
->name
, false, false, true);
4051 /* Structure used to build the list of symbols that the user has required
4054 struct require_defined_symbol
4057 struct require_defined_symbol
*next
;
4060 /* The list of symbols that the user has required be defined. */
4062 static struct require_defined_symbol
*require_defined_symbol_list
;
4064 /* Add a new symbol NAME to the list of symbols that are required to be
4068 ldlang_add_require_defined (const char *const name
)
4070 struct require_defined_symbol
*ptr
;
4072 ldlang_add_undef (name
, true);
4073 ptr
= stat_alloc (sizeof (*ptr
));
4074 ptr
->next
= require_defined_symbol_list
;
4075 ptr
->name
= strdup (name
);
4076 require_defined_symbol_list
= ptr
;
4079 /* Check that all symbols the user required to be defined, are defined,
4080 raise an error if we find a symbol that is not defined. */
4083 ldlang_check_require_defined_symbols (void)
4085 struct require_defined_symbol
*ptr
;
4087 for (ptr
= require_defined_symbol_list
; ptr
!= NULL
; ptr
= ptr
->next
)
4089 struct bfd_link_hash_entry
*h
;
4091 h
= bfd_link_hash_lookup (link_info
.hash
, ptr
->name
,
4092 false, false, true);
4094 || (h
->type
!= bfd_link_hash_defined
4095 && h
->type
!= bfd_link_hash_defweak
))
4096 einfo(_("%X%P: required symbol `%s' not defined\n"), ptr
->name
);
4100 /* Check for all readonly or some readwrite sections. */
4103 check_input_sections
4104 (lang_statement_union_type
*s
,
4105 lang_output_section_statement_type
*output_section_statement
)
4107 for (; s
!= NULL
; s
= s
->header
.next
)
4109 switch (s
->header
.type
)
4111 case lang_wild_statement_enum
:
4112 walk_wild (&s
->wild_statement
, check_section_callback
,
4113 output_section_statement
);
4114 if (!output_section_statement
->all_input_readonly
)
4117 case lang_constructors_statement_enum
:
4118 check_input_sections (constructor_list
.head
,
4119 output_section_statement
);
4120 if (!output_section_statement
->all_input_readonly
)
4123 case lang_group_statement_enum
:
4124 check_input_sections (s
->group_statement
.children
.head
,
4125 output_section_statement
);
4126 if (!output_section_statement
->all_input_readonly
)
4135 /* Update wildcard statements if needed. */
4138 update_wild_statements (lang_statement_union_type
*s
)
4140 struct wildcard_list
*sec
;
4142 switch (sort_section
)
4152 for (; s
!= NULL
; s
= s
->header
.next
)
4154 switch (s
->header
.type
)
4159 case lang_wild_statement_enum
:
4160 for (sec
= s
->wild_statement
.section_list
; sec
!= NULL
;
4162 /* Don't sort .init/.fini sections. */
4163 if (strcmp (sec
->spec
.name
, ".init") != 0
4164 && strcmp (sec
->spec
.name
, ".fini") != 0)
4165 switch (sec
->spec
.sorted
)
4168 sec
->spec
.sorted
= sort_section
;
4171 if (sort_section
== by_alignment
)
4172 sec
->spec
.sorted
= by_name_alignment
;
4175 if (sort_section
== by_name
)
4176 sec
->spec
.sorted
= by_alignment_name
;
4183 case lang_constructors_statement_enum
:
4184 update_wild_statements (constructor_list
.head
);
4187 case lang_output_section_statement_enum
:
4188 update_wild_statements
4189 (s
->output_section_statement
.children
.head
);
4192 case lang_group_statement_enum
:
4193 update_wild_statements (s
->group_statement
.children
.head
);
4201 /* Open input files and attach to output sections. */
4204 map_input_to_output_sections
4205 (lang_statement_union_type
*s
, const char *target
,
4206 lang_output_section_statement_type
*os
)
4208 for (; s
!= NULL
; s
= s
->header
.next
)
4210 lang_output_section_statement_type
*tos
;
4213 switch (s
->header
.type
)
4215 case lang_wild_statement_enum
:
4216 wild (&s
->wild_statement
, target
, os
);
4218 case lang_constructors_statement_enum
:
4219 map_input_to_output_sections (constructor_list
.head
,
4223 case lang_output_section_statement_enum
:
4224 tos
= &s
->output_section_statement
;
4225 if (tos
->constraint
== ONLY_IF_RW
4226 || tos
->constraint
== ONLY_IF_RO
)
4228 tos
->all_input_readonly
= true;
4229 check_input_sections (tos
->children
.head
, tos
);
4230 if (tos
->all_input_readonly
!= (tos
->constraint
== ONLY_IF_RO
))
4231 tos
->constraint
= -1;
4233 if (tos
->constraint
>= 0)
4234 map_input_to_output_sections (tos
->children
.head
,
4238 case lang_output_statement_enum
:
4240 case lang_target_statement_enum
:
4241 target
= s
->target_statement
.target
;
4243 case lang_group_statement_enum
:
4244 map_input_to_output_sections (s
->group_statement
.children
.head
,
4248 case lang_data_statement_enum
:
4249 /* Make sure that any sections mentioned in the expression
4251 exp_init_os (s
->data_statement
.exp
);
4252 /* The output section gets CONTENTS, ALLOC and LOAD, but
4253 these may be overridden by the script. */
4254 flags
= SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
;
4255 switch (os
->sectype
)
4257 case normal_section
:
4258 case overlay_section
:
4259 case first_overlay_section
:
4261 case noalloc_section
:
4262 flags
= SEC_HAS_CONTENTS
;
4264 case readonly_section
:
4265 flags
|= SEC_READONLY
;
4267 case noload_section
:
4268 if (bfd_get_flavour (link_info
.output_bfd
)
4269 == bfd_target_elf_flavour
)
4270 flags
= SEC_NEVER_LOAD
| SEC_ALLOC
;
4272 flags
= SEC_NEVER_LOAD
| SEC_HAS_CONTENTS
;
4275 if (os
->bfd_section
== NULL
)
4276 init_os (os
, flags
| SEC_READONLY
);
4278 os
->bfd_section
->flags
|= flags
;
4280 case lang_input_section_enum
:
4282 case lang_fill_statement_enum
:
4283 case lang_object_symbols_statement_enum
:
4284 case lang_reloc_statement_enum
:
4285 case lang_padding_statement_enum
:
4286 case lang_input_statement_enum
:
4287 if (os
!= NULL
&& os
->bfd_section
== NULL
)
4290 case lang_assignment_statement_enum
:
4291 if (os
!= NULL
&& os
->bfd_section
== NULL
)
4294 /* Make sure that any sections mentioned in the assignment
4296 exp_init_os (s
->assignment_statement
.exp
);
4298 case lang_address_statement_enum
:
4299 /* Mark the specified section with the supplied address.
4300 If this section was actually a segment marker, then the
4301 directive is ignored if the linker script explicitly
4302 processed the segment marker. Originally, the linker
4303 treated segment directives (like -Ttext on the
4304 command-line) as section directives. We honor the
4305 section directive semantics for backwards compatibility;
4306 linker scripts that do not specifically check for
4307 SEGMENT_START automatically get the old semantics. */
4308 if (!s
->address_statement
.segment
4309 || !s
->address_statement
.segment
->used
)
4311 const char *name
= s
->address_statement
.section_name
;
4313 /* Create the output section statement here so that
4314 orphans with a set address will be placed after other
4315 script sections. If we let the orphan placement code
4316 place them in amongst other sections then the address
4317 will affect following script sections, which is
4318 likely to surprise naive users. */
4319 tos
= lang_output_section_statement_lookup (name
, 0, 1);
4320 tos
->addr_tree
= s
->address_statement
.address
;
4321 if (tos
->bfd_section
== NULL
)
4325 case lang_insert_statement_enum
:
4331 /* An insert statement snips out all the linker statements from the
4332 start of the list and places them after the output section
4333 statement specified by the insert. This operation is complicated
4334 by the fact that we keep a doubly linked list of output section
4335 statements as well as the singly linked list of all statements.
4336 FIXME someday: Twiddling with the list not only moves statements
4337 from the user's script but also input and group statements that are
4338 built from command line object files and --start-group. We only
4339 get away with this because the list pointers used by file_chain
4340 and input_file_chain are not reordered, and processing via
4341 statement_list after this point mostly ignores input statements.
4342 One exception is the map file, where LOAD and START GROUP/END GROUP
4343 can end up looking odd. */
4346 process_insert_statements (lang_statement_union_type
**start
)
4348 lang_statement_union_type
**s
;
4349 lang_output_section_statement_type
*first_os
= NULL
;
4350 lang_output_section_statement_type
*last_os
= NULL
;
4351 lang_output_section_statement_type
*os
;
4356 if ((*s
)->header
.type
== lang_output_section_statement_enum
)
4358 /* Keep pointers to the first and last output section
4359 statement in the sequence we may be about to move. */
4360 os
= &(*s
)->output_section_statement
;
4362 ASSERT (last_os
== NULL
|| last_os
->next
== os
);
4365 /* Set constraint negative so that lang_output_section_find
4366 won't match this output section statement. At this
4367 stage in linking constraint has values in the range
4368 [-1, ONLY_IN_RW]. */
4369 last_os
->constraint
= -2 - last_os
->constraint
;
4370 if (first_os
== NULL
)
4373 else if ((*s
)->header
.type
== lang_group_statement_enum
)
4375 /* A user might put -T between --start-group and
4376 --end-group. One way this odd construct might arise is
4377 from a wrapper around ld to change library search
4378 behaviour. For example:
4380 exec real_ld --start-group "$@" --end-group
4381 This isn't completely unreasonable so go looking inside a
4382 group statement for insert statements. */
4383 process_insert_statements (&(*s
)->group_statement
.children
.head
);
4385 else if ((*s
)->header
.type
== lang_insert_statement_enum
)
4387 lang_insert_statement_type
*i
= &(*s
)->insert_statement
;
4388 lang_output_section_statement_type
*where
;
4389 lang_statement_union_type
**ptr
;
4390 lang_statement_union_type
*first
;
4392 if (link_info
.non_contiguous_regions
)
4394 einfo (_("warning: INSERT statement in linker script is "
4395 "incompatible with --enable-non-contiguous-regions.\n"));
4398 where
= lang_output_section_find (i
->where
);
4399 if (where
!= NULL
&& i
->is_before
)
4402 where
= where
->prev
;
4403 while (where
!= NULL
&& where
->constraint
< 0);
4407 einfo (_("%F%P: %s not found for insert\n"), i
->where
);
4411 /* Deal with reordering the output section statement list. */
4412 if (last_os
!= NULL
)
4414 asection
*first_sec
, *last_sec
;
4415 struct lang_output_section_statement_struct
**next
;
4417 /* Snip out the output sections we are moving. */
4418 first_os
->prev
->next
= last_os
->next
;
4419 if (last_os
->next
== NULL
)
4421 next
= &first_os
->prev
->next
;
4422 lang_os_list
.tail
= (lang_statement_union_type
**) next
;
4425 last_os
->next
->prev
= first_os
->prev
;
4426 /* Add them in at the new position. */
4427 last_os
->next
= where
->next
;
4428 if (where
->next
== NULL
)
4430 next
= &last_os
->next
;
4431 lang_os_list
.tail
= (lang_statement_union_type
**) next
;
4434 where
->next
->prev
= last_os
;
4435 first_os
->prev
= where
;
4436 where
->next
= first_os
;
4438 /* Move the bfd sections in the same way. */
4441 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
4443 os
->constraint
= -2 - os
->constraint
;
4444 if (os
->bfd_section
!= NULL
4445 && os
->bfd_section
->owner
!= NULL
)
4447 last_sec
= os
->bfd_section
;
4448 if (first_sec
== NULL
)
4449 first_sec
= last_sec
;
4454 if (last_sec
!= NULL
)
4456 asection
*sec
= where
->bfd_section
;
4458 sec
= output_prev_sec_find (where
);
4460 /* The place we want to insert must come after the
4461 sections we are moving. So if we find no
4462 section or if the section is the same as our
4463 last section, then no move is needed. */
4464 if (sec
!= NULL
&& sec
!= last_sec
)
4466 /* Trim them off. */
4467 if (first_sec
->prev
!= NULL
)
4468 first_sec
->prev
->next
= last_sec
->next
;
4470 link_info
.output_bfd
->sections
= last_sec
->next
;
4471 if (last_sec
->next
!= NULL
)
4472 last_sec
->next
->prev
= first_sec
->prev
;
4474 link_info
.output_bfd
->section_last
= first_sec
->prev
;
4476 last_sec
->next
= sec
->next
;
4477 if (sec
->next
!= NULL
)
4478 sec
->next
->prev
= last_sec
;
4480 link_info
.output_bfd
->section_last
= last_sec
;
4481 first_sec
->prev
= sec
;
4482 sec
->next
= first_sec
;
4490 ptr
= insert_os_after (where
);
4491 /* Snip everything from the start of the list, up to and
4492 including the insert statement we are currently processing. */
4494 *start
= (*s
)->header
.next
;
4495 /* Add them back where they belong, minus the insert. */
4498 statement_list
.tail
= s
;
4503 s
= &(*s
)->header
.next
;
4506 /* Undo constraint twiddling. */
4507 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
4509 os
->constraint
= -2 - os
->constraint
;
4515 /* An output section might have been removed after its statement was
4516 added. For example, ldemul_before_allocation can remove dynamic
4517 sections if they turn out to be not needed. Clean them up here. */
4520 strip_excluded_output_sections (void)
4522 lang_output_section_statement_type
*os
;
4524 /* Run lang_size_sections (if not already done). */
4525 if (expld
.phase
!= lang_mark_phase_enum
)
4527 expld
.phase
= lang_mark_phase_enum
;
4528 expld
.dataseg
.phase
= exp_seg_none
;
4529 one_lang_size_sections_pass (NULL
, false);
4530 lang_reset_memory_regions ();
4533 for (os
= (void *) lang_os_list
.head
;
4537 asection
*output_section
;
4540 if (os
->constraint
< 0)
4543 output_section
= os
->bfd_section
;
4544 if (output_section
== NULL
)
4547 exclude
= (output_section
->rawsize
== 0
4548 && (output_section
->flags
& SEC_KEEP
) == 0
4549 && !bfd_section_removed_from_list (link_info
.output_bfd
,
4552 /* Some sections have not yet been sized, notably .gnu.version,
4553 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
4554 input sections, so don't drop output sections that have such
4555 input sections unless they are also marked SEC_EXCLUDE. */
4556 if (exclude
&& output_section
->map_head
.s
!= NULL
)
4560 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
4561 if ((s
->flags
& SEC_EXCLUDE
) == 0
4562 && ((s
->flags
& SEC_LINKER_CREATED
) != 0
4563 || link_info
.emitrelocations
))
4572 /* We don't set bfd_section to NULL since bfd_section of the
4573 removed output section statement may still be used. */
4574 if (!os
->update_dot
)
4576 output_section
->flags
|= SEC_EXCLUDE
;
4577 bfd_section_list_remove (link_info
.output_bfd
, output_section
);
4578 link_info
.output_bfd
->section_count
--;
4583 /* Called from ldwrite to clear out asection.map_head and
4584 asection.map_tail for use as link_orders in ldwrite. */
4587 lang_clear_os_map (void)
4589 lang_output_section_statement_type
*os
;
4591 if (map_head_is_link_order
)
4594 for (os
= (void *) lang_os_list
.head
;
4598 asection
*output_section
;
4600 if (os
->constraint
< 0)
4603 output_section
= os
->bfd_section
;
4604 if (output_section
== NULL
)
4607 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
4608 output_section
->map_head
.link_order
= NULL
;
4609 output_section
->map_tail
.link_order
= NULL
;
4612 /* Stop future calls to lang_add_section from messing with map_head
4613 and map_tail link_order fields. */
4614 map_head_is_link_order
= true;
4618 print_output_section_statement
4619 (lang_output_section_statement_type
*output_section_statement
)
4621 asection
*section
= output_section_statement
->bfd_section
;
4624 if (output_section_statement
!= abs_output_section
)
4626 minfo ("\n%s", output_section_statement
->name
);
4628 if (section
!= NULL
)
4630 print_dot
= section
->vma
;
4632 len
= strlen (output_section_statement
->name
);
4633 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4638 while (len
< SECTION_NAME_MAP_LENGTH
)
4644 minfo ("0x%V %W", section
->vma
, TO_ADDR (section
->size
));
4646 if (section
->vma
!= section
->lma
)
4647 minfo (_(" load address 0x%V"), section
->lma
);
4649 if (output_section_statement
->update_dot_tree
!= NULL
)
4650 exp_fold_tree (output_section_statement
->update_dot_tree
,
4651 bfd_abs_section_ptr
, &print_dot
);
4657 print_statement_list (output_section_statement
->children
.head
,
4658 output_section_statement
);
4662 print_assignment (lang_assignment_statement_type
*assignment
,
4663 lang_output_section_statement_type
*output_section
)
4670 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4673 if (assignment
->exp
->type
.node_class
== etree_assert
)
4676 tree
= assignment
->exp
->assert_s
.child
;
4680 const char *dst
= assignment
->exp
->assign
.dst
;
4682 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
4683 tree
= assignment
->exp
;
4686 osec
= output_section
->bfd_section
;
4688 osec
= bfd_abs_section_ptr
;
4690 if (assignment
->exp
->type
.node_class
!= etree_provide
)
4691 exp_fold_tree (tree
, osec
, &print_dot
);
4693 expld
.result
.valid_p
= false;
4695 if (expld
.result
.valid_p
)
4699 if (assignment
->exp
->type
.node_class
== etree_assert
4701 || expld
.assign_name
!= NULL
)
4703 value
= expld
.result
.value
;
4705 if (expld
.result
.section
!= NULL
)
4706 value
+= expld
.result
.section
->vma
;
4708 minfo ("0x%V", value
);
4714 struct bfd_link_hash_entry
*h
;
4716 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
4717 false, false, true);
4719 && (h
->type
== bfd_link_hash_defined
4720 || h
->type
== bfd_link_hash_defweak
))
4722 value
= h
->u
.def
.value
;
4723 value
+= h
->u
.def
.section
->output_section
->vma
;
4724 value
+= h
->u
.def
.section
->output_offset
;
4726 minfo ("[0x%V]", value
);
4729 minfo ("[unresolved]");
4734 if (assignment
->exp
->type
.node_class
== etree_provide
)
4735 minfo ("[!provide]");
4742 expld
.assign_name
= NULL
;
4745 exp_print_tree (assignment
->exp
);
4750 print_input_statement (lang_input_statement_type
*statm
)
4752 if (statm
->filename
!= NULL
)
4753 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
4756 /* Print all symbols defined in a particular section. This is called
4757 via bfd_link_hash_traverse, or by print_all_symbols. */
4760 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
4762 asection
*sec
= (asection
*) ptr
;
4764 if ((hash_entry
->type
== bfd_link_hash_defined
4765 || hash_entry
->type
== bfd_link_hash_defweak
)
4766 && sec
== hash_entry
->u
.def
.section
)
4770 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4773 (hash_entry
->u
.def
.value
4774 + hash_entry
->u
.def
.section
->output_offset
4775 + hash_entry
->u
.def
.section
->output_section
->vma
));
4777 minfo (" %pT\n", hash_entry
->root
.string
);
4784 hash_entry_addr_cmp (const void *a
, const void *b
)
4786 const struct bfd_link_hash_entry
*l
= *(const struct bfd_link_hash_entry
**)a
;
4787 const struct bfd_link_hash_entry
*r
= *(const struct bfd_link_hash_entry
**)b
;
4789 if (l
->u
.def
.value
< r
->u
.def
.value
)
4791 else if (l
->u
.def
.value
> r
->u
.def
.value
)
4798 print_all_symbols (asection
*sec
)
4800 input_section_userdata_type
*ud
= bfd_section_userdata (sec
);
4801 struct map_symbol_def
*def
;
4802 struct bfd_link_hash_entry
**entries
;
4808 *ud
->map_symbol_def_tail
= 0;
4810 /* Sort the symbols by address. */
4811 entries
= (struct bfd_link_hash_entry
**)
4812 obstack_alloc (&map_obstack
,
4813 ud
->map_symbol_def_count
* sizeof (*entries
));
4815 for (i
= 0, def
= ud
->map_symbol_def_head
; def
; def
= def
->next
, i
++)
4816 entries
[i
] = def
->entry
;
4818 qsort (entries
, ud
->map_symbol_def_count
, sizeof (*entries
),
4819 hash_entry_addr_cmp
);
4821 /* Print the symbols. */
4822 for (i
= 0; i
< ud
->map_symbol_def_count
; i
++)
4823 ldemul_print_symbol (entries
[i
], sec
);
4825 obstack_free (&map_obstack
, entries
);
4828 /* Print information about an input section to the map file. */
4831 print_input_section (asection
*i
, bool is_discarded
)
4833 bfd_size_type size
= i
->size
;
4840 minfo ("%s", i
->name
);
4842 len
= 1 + strlen (i
->name
);
4843 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4848 while (len
< SECTION_NAME_MAP_LENGTH
)
4854 if (i
->output_section
!= NULL
4855 && i
->output_section
->owner
== link_info
.output_bfd
)
4856 addr
= i
->output_section
->vma
+ i
->output_offset
;
4864 minfo ("0x%V %W %pB\n", addr
, TO_ADDR (size
), i
->owner
);
4866 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
4868 len
= SECTION_NAME_MAP_LENGTH
+ 3;
4880 minfo (_("%W (size before relaxing)\n"), TO_ADDR (i
->rawsize
));
4883 if (i
->output_section
!= NULL
4884 && i
->output_section
->owner
== link_info
.output_bfd
)
4886 if (link_info
.reduce_memory_overheads
)
4887 bfd_link_hash_traverse (link_info
.hash
, ldemul_print_symbol
, i
);
4889 print_all_symbols (i
);
4891 /* Update print_dot, but make sure that we do not move it
4892 backwards - this could happen if we have overlays and a
4893 later overlay is shorter than an earier one. */
4894 if (addr
+ TO_ADDR (size
) > print_dot
)
4895 print_dot
= addr
+ TO_ADDR (size
);
4900 print_fill_statement (lang_fill_statement_type
*fill
)
4904 fputs (" FILL mask 0x", config
.map_file
);
4905 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
4906 fprintf (config
.map_file
, "%02x", *p
);
4907 fputs ("\n", config
.map_file
);
4911 print_data_statement (lang_data_statement_type
*data
)
4918 init_opb (data
->output_section
);
4919 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4922 addr
= data
->output_offset
;
4923 if (data
->output_section
!= NULL
)
4924 addr
+= data
->output_section
->vma
;
4952 if (size
< TO_SIZE ((unsigned) 1))
4953 size
= TO_SIZE ((unsigned) 1);
4954 minfo ("0x%V %W %s 0x%v", addr
, TO_ADDR (size
), name
, data
->value
);
4956 if (data
->exp
->type
.node_class
!= etree_value
)
4959 exp_print_tree (data
->exp
);
4964 print_dot
= addr
+ TO_ADDR (size
);
4967 /* Print an address statement. These are generated by options like
4971 print_address_statement (lang_address_statement_type
*address
)
4973 minfo (_("Address of section %s set to "), address
->section_name
);
4974 exp_print_tree (address
->address
);
4978 /* Print a reloc statement. */
4981 print_reloc_statement (lang_reloc_statement_type
*reloc
)
4987 init_opb (reloc
->output_section
);
4988 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4991 addr
= reloc
->output_offset
;
4992 if (reloc
->output_section
!= NULL
)
4993 addr
+= reloc
->output_section
->vma
;
4995 size
= bfd_get_reloc_size (reloc
->howto
);
4997 minfo ("0x%V %W RELOC %s ", addr
, TO_ADDR (size
), reloc
->howto
->name
);
4999 if (reloc
->name
!= NULL
)
5000 minfo ("%s+", reloc
->name
);
5002 minfo ("%s+", reloc
->section
->name
);
5004 exp_print_tree (reloc
->addend_exp
);
5008 print_dot
= addr
+ TO_ADDR (size
);
5012 print_padding_statement (lang_padding_statement_type
*s
)
5017 init_opb (s
->output_section
);
5020 len
= sizeof " *fill*" - 1;
5021 while (len
< SECTION_NAME_MAP_LENGTH
)
5027 addr
= s
->output_offset
;
5028 if (s
->output_section
!= NULL
)
5029 addr
+= s
->output_section
->vma
;
5030 minfo ("0x%V %W ", addr
, TO_ADDR (s
->size
));
5032 if (s
->fill
->size
!= 0)
5036 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
5037 fprintf (config
.map_file
, "%02x", *p
);
5042 print_dot
= addr
+ TO_ADDR (s
->size
);
5046 print_wild_statement (lang_wild_statement_type
*w
,
5047 lang_output_section_statement_type
*os
)
5049 struct wildcard_list
*sec
;
5053 if (w
->exclude_name_list
)
5056 minfo ("EXCLUDE_FILE(%s", w
->exclude_name_list
->name
);
5057 for (tmp
= w
->exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
5058 minfo (" %s", tmp
->name
);
5062 if (w
->filenames_sorted
)
5063 minfo ("SORT_BY_NAME(");
5064 if (w
->filename
!= NULL
)
5065 minfo ("%s", w
->filename
);
5068 if (w
->filenames_sorted
)
5072 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
5074 int closing_paren
= 0;
5076 switch (sec
->spec
.sorted
)
5082 minfo ("SORT_BY_NAME(");
5087 minfo ("SORT_BY_ALIGNMENT(");
5091 case by_name_alignment
:
5092 minfo ("SORT_BY_NAME(SORT_BY_ALIGNMENT(");
5096 case by_alignment_name
:
5097 minfo ("SORT_BY_ALIGNMENT(SORT_BY_NAME(");
5102 minfo ("SORT_NONE(");
5106 case by_init_priority
:
5107 minfo ("SORT_BY_INIT_PRIORITY(");
5112 if (sec
->spec
.exclude_name_list
!= NULL
)
5115 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
5116 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
5117 minfo (" %s", tmp
->name
);
5120 if (sec
->spec
.name
!= NULL
)
5121 minfo ("%s", sec
->spec
.name
);
5124 for (;closing_paren
> 0; closing_paren
--)
5133 print_statement_list (w
->children
.head
, os
);
5136 /* Print a group statement. */
5139 print_group (lang_group_statement_type
*s
,
5140 lang_output_section_statement_type
*os
)
5142 fprintf (config
.map_file
, "START GROUP\n");
5143 print_statement_list (s
->children
.head
, os
);
5144 fprintf (config
.map_file
, "END GROUP\n");
5147 /* Print the list of statements in S.
5148 This can be called for any statement type. */
5151 print_statement_list (lang_statement_union_type
*s
,
5152 lang_output_section_statement_type
*os
)
5156 print_statement (s
, os
);
5161 /* Print the first statement in statement list S.
5162 This can be called for any statement type. */
5165 print_statement (lang_statement_union_type
*s
,
5166 lang_output_section_statement_type
*os
)
5168 switch (s
->header
.type
)
5171 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
5174 case lang_constructors_statement_enum
:
5175 if (constructor_list
.head
!= NULL
)
5177 if (constructors_sorted
)
5178 minfo (" SORT (CONSTRUCTORS)\n");
5180 minfo (" CONSTRUCTORS\n");
5181 print_statement_list (constructor_list
.head
, os
);
5184 case lang_wild_statement_enum
:
5185 print_wild_statement (&s
->wild_statement
, os
);
5187 case lang_address_statement_enum
:
5188 print_address_statement (&s
->address_statement
);
5190 case lang_object_symbols_statement_enum
:
5191 minfo (" CREATE_OBJECT_SYMBOLS\n");
5193 case lang_fill_statement_enum
:
5194 print_fill_statement (&s
->fill_statement
);
5196 case lang_data_statement_enum
:
5197 print_data_statement (&s
->data_statement
);
5199 case lang_reloc_statement_enum
:
5200 print_reloc_statement (&s
->reloc_statement
);
5202 case lang_input_section_enum
:
5203 print_input_section (s
->input_section
.section
, false);
5205 case lang_padding_statement_enum
:
5206 print_padding_statement (&s
->padding_statement
);
5208 case lang_output_section_statement_enum
:
5209 print_output_section_statement (&s
->output_section_statement
);
5211 case lang_assignment_statement_enum
:
5212 print_assignment (&s
->assignment_statement
, os
);
5214 case lang_target_statement_enum
:
5215 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
5217 case lang_output_statement_enum
:
5218 minfo ("OUTPUT(%s", s
->output_statement
.name
);
5219 if (output_target
!= NULL
)
5220 minfo (" %s", output_target
);
5223 case lang_input_statement_enum
:
5224 print_input_statement (&s
->input_statement
);
5226 case lang_group_statement_enum
:
5227 print_group (&s
->group_statement
, os
);
5229 case lang_insert_statement_enum
:
5230 minfo ("INSERT %s %s\n",
5231 s
->insert_statement
.is_before
? "BEFORE" : "AFTER",
5232 s
->insert_statement
.where
);
5238 print_statements (void)
5240 print_statement_list (statement_list
.head
, abs_output_section
);
5243 /* Print the first N statements in statement list S to STDERR.
5244 If N == 0, nothing is printed.
5245 If N < 0, the entire list is printed.
5246 Intended to be called from GDB. */
5249 dprint_statement (lang_statement_union_type
*s
, int n
)
5251 FILE *map_save
= config
.map_file
;
5253 config
.map_file
= stderr
;
5256 print_statement_list (s
, abs_output_section
);
5259 while (s
&& --n
>= 0)
5261 print_statement (s
, abs_output_section
);
5266 config
.map_file
= map_save
;
5270 insert_pad (lang_statement_union_type
**ptr
,
5272 bfd_size_type alignment_needed
,
5273 asection
*output_section
,
5276 static fill_type zero_fill
;
5277 lang_statement_union_type
*pad
= NULL
;
5279 if (ptr
!= &statement_list
.head
)
5280 pad
= ((lang_statement_union_type
*)
5281 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
5283 && pad
->header
.type
== lang_padding_statement_enum
5284 && pad
->padding_statement
.output_section
== output_section
)
5286 /* Use the existing pad statement. */
5288 else if ((pad
= *ptr
) != NULL
5289 && pad
->header
.type
== lang_padding_statement_enum
5290 && pad
->padding_statement
.output_section
== output_section
)
5292 /* Use the existing pad statement. */
5296 /* Make a new padding statement, linked into existing chain. */
5297 pad
= stat_alloc (sizeof (lang_padding_statement_type
));
5298 pad
->header
.next
= *ptr
;
5300 pad
->header
.type
= lang_padding_statement_enum
;
5301 pad
->padding_statement
.output_section
= output_section
;
5304 pad
->padding_statement
.fill
= fill
;
5306 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
5307 pad
->padding_statement
.size
= alignment_needed
;
5308 if (!(output_section
->flags
& SEC_FIXED_SIZE
))
5309 output_section
->size
= TO_SIZE (dot
+ TO_ADDR (alignment_needed
)
5310 - output_section
->vma
);
5313 /* Work out how much this section will move the dot point. */
5317 (lang_statement_union_type
**this_ptr
,
5318 lang_output_section_statement_type
*output_section_statement
,
5323 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
5324 asection
*i
= is
->section
;
5325 asection
*o
= output_section_statement
->bfd_section
;
5328 if (link_info
.non_contiguous_regions
)
5330 /* If the input section I has already been successfully assigned
5331 to an output section other than O, don't bother with it and
5332 let the caller remove it from the list. Keep processing in
5333 case we have already handled O, because the repeated passes
5334 have reinitialized its size. */
5335 if (i
->already_assigned
&& i
->already_assigned
!= o
)
5342 if (i
->sec_info_type
== SEC_INFO_TYPE_JUST_SYMS
)
5343 i
->output_offset
= i
->vma
- o
->vma
;
5344 else if (((i
->flags
& SEC_EXCLUDE
) != 0)
5345 || output_section_statement
->ignored
)
5346 i
->output_offset
= dot
- o
->vma
;
5349 bfd_size_type alignment_needed
;
5351 /* Align this section first to the input sections requirement,
5352 then to the output section's requirement. If this alignment
5353 is greater than any seen before, then record it too. Perform
5354 the alignment by inserting a magic 'padding' statement. */
5356 if (output_section_statement
->subsection_alignment
!= NULL
)
5358 = exp_get_power (output_section_statement
->subsection_alignment
,
5359 "subsection alignment");
5361 if (o
->alignment_power
< i
->alignment_power
)
5362 o
->alignment_power
= i
->alignment_power
;
5364 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
5366 if (alignment_needed
!= 0)
5368 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
5369 dot
+= alignment_needed
;
5372 if (link_info
.non_contiguous_regions
)
5374 /* If I would overflow O, let the caller remove I from the
5376 if (output_section_statement
->region
)
5378 bfd_vma end
= output_section_statement
->region
->origin
5379 + output_section_statement
->region
->length
;
5381 if (dot
+ TO_ADDR (i
->size
) > end
)
5383 if (i
->flags
& SEC_LINKER_CREATED
)
5384 einfo (_("%F%P: Output section '%s' not large enough for the "
5385 "linker-created stubs section '%s'.\n"),
5386 i
->output_section
->name
, i
->name
);
5388 if (i
->rawsize
&& i
->rawsize
!= i
->size
)
5389 einfo (_("%F%P: Relaxation not supported with "
5390 "--enable-non-contiguous-regions (section '%s' "
5391 "would overflow '%s' after it changed size).\n"),
5392 i
->name
, i
->output_section
->name
);
5396 i
->output_section
= NULL
;
5402 /* Remember where in the output section this input section goes. */
5403 i
->output_offset
= dot
- o
->vma
;
5405 /* Mark how big the output section must be to contain this now. */
5406 dot
+= TO_ADDR (i
->size
);
5407 if (!(o
->flags
& SEC_FIXED_SIZE
))
5408 o
->size
= TO_SIZE (dot
- o
->vma
);
5410 if (link_info
.non_contiguous_regions
)
5412 /* Record that I was successfully assigned to O, and update
5413 its actual output section too. */
5414 i
->already_assigned
= o
;
5415 i
->output_section
= o
;
5429 sort_sections_by_lma (const void *arg1
, const void *arg2
)
5431 const asection
*sec1
= ((const struct check_sec
*) arg1
)->sec
;
5432 const asection
*sec2
= ((const struct check_sec
*) arg2
)->sec
;
5434 if (sec1
->lma
< sec2
->lma
)
5436 else if (sec1
->lma
> sec2
->lma
)
5438 else if (sec1
->id
< sec2
->id
)
5440 else if (sec1
->id
> sec2
->id
)
5447 sort_sections_by_vma (const void *arg1
, const void *arg2
)
5449 const asection
*sec1
= ((const struct check_sec
*) arg1
)->sec
;
5450 const asection
*sec2
= ((const struct check_sec
*) arg2
)->sec
;
5452 if (sec1
->vma
< sec2
->vma
)
5454 else if (sec1
->vma
> sec2
->vma
)
5456 else if (sec1
->id
< sec2
->id
)
5458 else if (sec1
->id
> sec2
->id
)
5464 #define IS_TBSS(s) \
5465 ((s->flags & (SEC_LOAD | SEC_THREAD_LOCAL)) == SEC_THREAD_LOCAL)
5467 #define IGNORE_SECTION(s) \
5468 ((s->flags & SEC_ALLOC) == 0 || IS_TBSS (s))
5470 /* Check to see if any allocated sections overlap with other allocated
5471 sections. This can happen if a linker script specifies the output
5472 section addresses of the two sections. Also check whether any memory
5473 region has overflowed. */
5476 lang_check_section_addresses (void)
5479 struct check_sec
*sections
;
5484 bfd_vma p_start
= 0;
5486 lang_memory_region_type
*m
;
5489 /* Detect address space overflow on allocated sections. */
5490 addr_mask
= ((bfd_vma
) 1 <<
5491 (bfd_arch_bits_per_address (link_info
.output_bfd
) - 1)) - 1;
5492 addr_mask
= (addr_mask
<< 1) + 1;
5493 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5494 if ((s
->flags
& SEC_ALLOC
) != 0)
5496 s_end
= (s
->vma
+ s
->size
) & addr_mask
;
5497 if (s_end
!= 0 && s_end
< (s
->vma
& addr_mask
))
5498 einfo (_("%X%P: section %s VMA wraps around address space\n"),
5502 s_end
= (s
->lma
+ s
->size
) & addr_mask
;
5503 if (s_end
!= 0 && s_end
< (s
->lma
& addr_mask
))
5504 einfo (_("%X%P: section %s LMA wraps around address space\n"),
5509 if (bfd_count_sections (link_info
.output_bfd
) <= 1)
5512 count
= bfd_count_sections (link_info
.output_bfd
);
5513 sections
= XNEWVEC (struct check_sec
, count
);
5515 /* Scan all sections in the output list. */
5517 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5519 if (IGNORE_SECTION (s
)
5523 sections
[count
].sec
= s
;
5524 sections
[count
].warned
= false;
5534 qsort (sections
, count
, sizeof (*sections
), sort_sections_by_lma
);
5536 /* First check section LMAs. There should be no overlap of LMAs on
5537 loadable sections, even with overlays. */
5538 for (p
= NULL
, i
= 0; i
< count
; i
++)
5540 s
= sections
[i
].sec
;
5542 if ((s
->flags
& SEC_LOAD
) != 0)
5545 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
5547 /* Look for an overlap. We have sorted sections by lma, so
5548 we know that s_start >= p_start. Besides the obvious
5549 case of overlap when the current section starts before
5550 the previous one ends, we also must have overlap if the
5551 previous section wraps around the address space. */
5553 && (s_start
<= p_end
5554 || p_end
< p_start
))
5556 einfo (_("%X%P: section %s LMA [%V,%V]"
5557 " overlaps section %s LMA [%V,%V]\n"),
5558 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
5559 sections
[i
].warned
= true;
5567 /* If any non-zero size allocated section (excluding tbss) starts at
5568 exactly the same VMA as another such section, then we have
5569 overlays. Overlays generated by the OVERLAY keyword will have
5570 this property. It is possible to intentionally generate overlays
5571 that fail this test, but it would be unusual. */
5572 qsort (sections
, count
, sizeof (*sections
), sort_sections_by_vma
);
5574 p_start
= sections
[0].sec
->vma
;
5575 for (i
= 1; i
< count
; i
++)
5577 s_start
= sections
[i
].sec
->vma
;
5578 if (p_start
== s_start
)
5586 /* Now check section VMAs if no overlays were detected. */
5589 for (p
= NULL
, i
= 0; i
< count
; i
++)
5591 s
= sections
[i
].sec
;
5594 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
5597 && !sections
[i
].warned
5598 && (s_start
<= p_end
5599 || p_end
< p_start
))
5600 einfo (_("%X%P: section %s VMA [%V,%V]"
5601 " overlaps section %s VMA [%V,%V]\n"),
5602 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
5611 /* If any memory region has overflowed, report by how much.
5612 We do not issue this diagnostic for regions that had sections
5613 explicitly placed outside their bounds; os_region_check's
5614 diagnostics are adequate for that case.
5616 FIXME: It is conceivable that m->current - (m->origin + m->length)
5617 might overflow a 32-bit integer. There is, alas, no way to print
5618 a bfd_vma quantity in decimal. */
5619 for (m
= lang_memory_region_list
; m
; m
= m
->next
)
5620 if (m
->had_full_message
)
5622 unsigned long over
= m
->current
- (m
->origin
+ m
->length
);
5623 einfo (ngettext ("%X%P: region `%s' overflowed by %lu byte\n",
5624 "%X%P: region `%s' overflowed by %lu bytes\n",
5626 m
->name_list
.name
, over
);
5630 /* Make sure the new address is within the region. We explicitly permit the
5631 current address to be at the exact end of the region when the address is
5632 non-zero, in case the region is at the end of addressable memory and the
5633 calculation wraps around. */
5636 os_region_check (lang_output_section_statement_type
*os
,
5637 lang_memory_region_type
*region
,
5641 if ((region
->current
< region
->origin
5642 || (region
->current
- region
->origin
> region
->length
))
5643 && ((region
->current
!= region
->origin
+ region
->length
)
5648 einfo (_("%X%P: address 0x%v of %pB section `%s'"
5649 " is not within region `%s'\n"),
5651 os
->bfd_section
->owner
,
5652 os
->bfd_section
->name
,
5653 region
->name_list
.name
);
5655 else if (!region
->had_full_message
)
5657 region
->had_full_message
= true;
5659 einfo (_("%X%P: %pB section `%s' will not fit in region `%s'\n"),
5660 os
->bfd_section
->owner
,
5661 os
->bfd_section
->name
,
5662 region
->name_list
.name
);
5668 ldlang_check_relro_region (lang_statement_union_type
*s
,
5669 seg_align_type
*seg
)
5671 if (seg
->relro
== exp_seg_relro_start
)
5673 if (!seg
->relro_start_stat
)
5674 seg
->relro_start_stat
= s
;
5677 ASSERT (seg
->relro_start_stat
== s
);
5680 else if (seg
->relro
== exp_seg_relro_end
)
5682 if (!seg
->relro_end_stat
)
5683 seg
->relro_end_stat
= s
;
5686 ASSERT (seg
->relro_end_stat
== s
);
5691 /* Set the sizes for all the output sections. */
5694 lang_size_sections_1
5695 (lang_statement_union_type
**prev
,
5696 lang_output_section_statement_type
*output_section_statement
,
5702 lang_statement_union_type
*s
;
5703 lang_statement_union_type
*prev_s
= NULL
;
5704 bool removed_prev_s
= false;
5706 /* Size up the sections from their constituent parts. */
5707 for (s
= *prev
; s
!= NULL
; prev_s
= s
, s
= s
->header
.next
)
5709 bool removed
= false;
5711 switch (s
->header
.type
)
5713 case lang_output_section_statement_enum
:
5715 bfd_vma newdot
, after
, dotdelta
;
5716 lang_output_section_statement_type
*os
;
5717 lang_memory_region_type
*r
;
5718 int section_alignment
= 0;
5720 os
= &s
->output_section_statement
;
5721 init_opb (os
->bfd_section
);
5722 if (os
->constraint
== -1)
5725 /* FIXME: We shouldn't need to zero section vmas for ld -r
5726 here, in lang_insert_orphan, or in the default linker scripts.
5727 This is covering for coff backend linker bugs. See PR6945. */
5728 if (os
->addr_tree
== NULL
5729 && bfd_link_relocatable (&link_info
)
5730 && (bfd_get_flavour (link_info
.output_bfd
)
5731 == bfd_target_coff_flavour
))
5732 os
->addr_tree
= exp_intop (0);
5733 if (os
->addr_tree
!= NULL
)
5735 os
->processed_vma
= false;
5736 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
5738 if (expld
.result
.valid_p
)
5740 dot
= expld
.result
.value
;
5741 if (expld
.result
.section
!= NULL
)
5742 dot
+= expld
.result
.section
->vma
;
5744 else if (expld
.phase
!= lang_mark_phase_enum
)
5745 einfo (_("%F%P:%pS: non constant or forward reference"
5746 " address expression for section %s\n"),
5747 os
->addr_tree
, os
->name
);
5750 if (os
->bfd_section
== NULL
)
5751 /* This section was removed or never actually created. */
5754 /* If this is a COFF shared library section, use the size and
5755 address from the input section. FIXME: This is COFF
5756 specific; it would be cleaner if there were some other way
5757 to do this, but nothing simple comes to mind. */
5758 if (((bfd_get_flavour (link_info
.output_bfd
)
5759 == bfd_target_ecoff_flavour
)
5760 || (bfd_get_flavour (link_info
.output_bfd
)
5761 == bfd_target_coff_flavour
))
5762 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
5766 if (os
->children
.head
== NULL
5767 || os
->children
.head
->header
.next
!= NULL
5768 || (os
->children
.head
->header
.type
5769 != lang_input_section_enum
))
5770 einfo (_("%X%P: internal error on COFF shared library"
5771 " section %s\n"), os
->name
);
5773 input
= os
->children
.head
->input_section
.section
;
5774 bfd_set_section_vma (os
->bfd_section
,
5775 bfd_section_vma (input
));
5776 if (!(os
->bfd_section
->flags
& SEC_FIXED_SIZE
))
5777 os
->bfd_section
->size
= input
->size
;
5783 if (bfd_is_abs_section (os
->bfd_section
))
5785 /* No matter what happens, an abs section starts at zero. */
5786 ASSERT (os
->bfd_section
->vma
== 0);
5790 if (os
->addr_tree
== NULL
)
5792 /* No address specified for this section, get one
5793 from the region specification. */
5794 if (os
->region
== NULL
5795 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
5796 && os
->region
->name_list
.name
[0] == '*'
5797 && strcmp (os
->region
->name_list
.name
,
5798 DEFAULT_MEMORY_REGION
) == 0))
5800 os
->region
= lang_memory_default (os
->bfd_section
);
5803 /* If a loadable section is using the default memory
5804 region, and some non default memory regions were
5805 defined, issue an error message. */
5807 && !IGNORE_SECTION (os
->bfd_section
)
5808 && !bfd_link_relocatable (&link_info
)
5810 && strcmp (os
->region
->name_list
.name
,
5811 DEFAULT_MEMORY_REGION
) == 0
5812 && lang_memory_region_list
!= NULL
5813 && (strcmp (lang_memory_region_list
->name_list
.name
,
5814 DEFAULT_MEMORY_REGION
) != 0
5815 || lang_memory_region_list
->next
!= NULL
)
5816 && lang_sizing_iteration
== 1)
5818 /* By default this is an error rather than just a
5819 warning because if we allocate the section to the
5820 default memory region we can end up creating an
5821 excessively large binary, or even seg faulting when
5822 attempting to perform a negative seek. See
5823 sources.redhat.com/ml/binutils/2003-04/msg00423.html
5824 for an example of this. This behaviour can be
5825 overridden by the using the --no-check-sections
5827 if (command_line
.check_section_addresses
)
5828 einfo (_("%F%P: error: no memory region specified"
5829 " for loadable section `%s'\n"),
5830 bfd_section_name (os
->bfd_section
));
5832 einfo (_("%P: warning: no memory region specified"
5833 " for loadable section `%s'\n"),
5834 bfd_section_name (os
->bfd_section
));
5837 newdot
= os
->region
->current
;
5838 section_alignment
= os
->bfd_section
->alignment_power
;
5841 section_alignment
= exp_get_power (os
->section_alignment
,
5842 "section alignment");
5844 /* Align to what the section needs. */
5845 if (section_alignment
> 0)
5847 bfd_vma savedot
= newdot
;
5850 newdot
= align_power (newdot
, section_alignment
);
5851 dotdelta
= newdot
- savedot
;
5853 if (lang_sizing_iteration
== 1)
5855 else if (lang_sizing_iteration
> 1)
5857 /* Only report adjustments that would change
5858 alignment from what we have already reported. */
5859 diff
= newdot
- os
->bfd_section
->vma
;
5860 if (!(diff
& (((bfd_vma
) 1 << section_alignment
) - 1)))
5864 && (config
.warn_section_align
5865 || os
->addr_tree
!= NULL
))
5866 einfo (_("%P: warning: "
5867 "start of section %s changed by %ld\n"),
5868 os
->name
, (long) diff
);
5871 bfd_set_section_vma (os
->bfd_section
, newdot
);
5873 os
->bfd_section
->output_offset
= 0;
5876 lang_size_sections_1 (&os
->children
.head
, os
,
5877 os
->fill
, newdot
, relax
, check_regions
);
5879 os
->processed_vma
= true;
5881 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5882 /* Except for some special linker created sections,
5883 no output section should change from zero size
5884 after strip_excluded_output_sections. A non-zero
5885 size on an ignored section indicates that some
5886 input section was not sized early enough. */
5887 ASSERT (os
->bfd_section
->size
== 0);
5890 dot
= os
->bfd_section
->vma
;
5892 /* Put the section within the requested block size, or
5893 align at the block boundary. */
5895 + TO_ADDR (os
->bfd_section
->size
)
5896 + os
->block_value
- 1)
5897 & - (bfd_vma
) os
->block_value
);
5899 if (!(os
->bfd_section
->flags
& SEC_FIXED_SIZE
))
5900 os
->bfd_section
->size
= TO_SIZE (after
5901 - os
->bfd_section
->vma
);
5904 /* Set section lma. */
5907 r
= lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, false);
5911 bfd_vma lma
= exp_get_abs_int (os
->load_base
, 0, "load base");
5912 os
->bfd_section
->lma
= lma
;
5914 else if (os
->lma_region
!= NULL
)
5916 bfd_vma lma
= os
->lma_region
->current
;
5918 if (os
->align_lma_with_input
)
5922 /* When LMA_REGION is the same as REGION, align the LMA
5923 as we did for the VMA, possibly including alignment
5924 from the bfd section. If a different region, then
5925 only align according to the value in the output
5927 if (os
->lma_region
!= os
->region
)
5928 section_alignment
= exp_get_power (os
->section_alignment
,
5929 "section alignment");
5930 if (section_alignment
> 0)
5931 lma
= align_power (lma
, section_alignment
);
5933 os
->bfd_section
->lma
= lma
;
5935 else if (r
->last_os
!= NULL
5936 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
5941 last
= r
->last_os
->output_section_statement
.bfd_section
;
5943 /* A backwards move of dot should be accompanied by
5944 an explicit assignment to the section LMA (ie.
5945 os->load_base set) because backwards moves can
5946 create overlapping LMAs. */
5948 && os
->bfd_section
->size
!= 0
5949 && dot
+ TO_ADDR (os
->bfd_section
->size
) <= last
->vma
)
5951 /* If dot moved backwards then leave lma equal to
5952 vma. This is the old default lma, which might
5953 just happen to work when the backwards move is
5954 sufficiently large. Nag if this changes anything,
5955 so people can fix their linker scripts. */
5957 if (last
->vma
!= last
->lma
)
5958 einfo (_("%P: warning: dot moved backwards "
5959 "before `%s'\n"), os
->name
);
5963 /* If this is an overlay, set the current lma to that
5964 at the end of the previous section. */
5965 if (os
->sectype
== overlay_section
)
5966 lma
= last
->lma
+ TO_ADDR (last
->size
);
5968 /* Otherwise, keep the same lma to vma relationship
5969 as the previous section. */
5971 lma
= os
->bfd_section
->vma
+ last
->lma
- last
->vma
;
5973 if (section_alignment
> 0)
5974 lma
= align_power (lma
, section_alignment
);
5975 os
->bfd_section
->lma
= lma
;
5978 os
->processed_lma
= true;
5980 /* Keep track of normal sections using the default
5981 lma region. We use this to set the lma for
5982 following sections. Overlays or other linker
5983 script assignment to lma might mean that the
5984 default lma == vma is incorrect.
5985 To avoid warnings about dot moving backwards when using
5986 -Ttext, don't start tracking sections until we find one
5987 of non-zero size or with lma set differently to vma.
5988 Do this tracking before we short-cut the loop so that we
5989 track changes for the case where the section size is zero,
5990 but the lma is set differently to the vma. This is
5991 important, if an orphan section is placed after an
5992 otherwise empty output section that has an explicit lma
5993 set, we want that lma reflected in the orphans lma. */
5994 if (((!IGNORE_SECTION (os
->bfd_section
)
5995 && (os
->bfd_section
->size
!= 0
5996 || (r
->last_os
== NULL
5997 && os
->bfd_section
->vma
!= os
->bfd_section
->lma
)
5998 || (r
->last_os
!= NULL
5999 && dot
>= (r
->last_os
->output_section_statement
6000 .bfd_section
->vma
))))
6001 || os
->sectype
== first_overlay_section
)
6002 && os
->lma_region
== NULL
6003 && !bfd_link_relocatable (&link_info
))
6006 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
6009 /* .tbss sections effectively have zero size. */
6010 if (!IS_TBSS (os
->bfd_section
)
6011 || bfd_link_relocatable (&link_info
))
6012 dotdelta
= TO_ADDR (os
->bfd_section
->size
);
6017 if (os
->update_dot_tree
!= 0)
6018 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
6020 /* Update dot in the region ?
6021 We only do this if the section is going to be allocated,
6022 since unallocated sections do not contribute to the region's
6023 overall size in memory. */
6024 if (os
->region
!= NULL
6025 && (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
)))
6027 os
->region
->current
= dot
;
6030 /* Make sure the new address is within the region. */
6031 os_region_check (os
, os
->region
, os
->addr_tree
,
6032 os
->bfd_section
->vma
);
6034 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
6035 && ((os
->bfd_section
->flags
& SEC_LOAD
)
6036 || os
->align_lma_with_input
))
6038 os
->lma_region
->current
= os
->bfd_section
->lma
+ dotdelta
;
6041 os_region_check (os
, os
->lma_region
, NULL
,
6042 os
->bfd_section
->lma
);
6048 case lang_constructors_statement_enum
:
6049 dot
= lang_size_sections_1 (&constructor_list
.head
,
6050 output_section_statement
,
6051 fill
, dot
, relax
, check_regions
);
6054 case lang_data_statement_enum
:
6056 unsigned int size
= 0;
6058 s
->data_statement
.output_offset
=
6059 dot
- output_section_statement
->bfd_section
->vma
;
6060 s
->data_statement
.output_section
=
6061 output_section_statement
->bfd_section
;
6063 /* We might refer to provided symbols in the expression, and
6064 need to mark them as needed. */
6065 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
6067 switch (s
->data_statement
.type
)
6085 if (size
< TO_SIZE ((unsigned) 1))
6086 size
= TO_SIZE ((unsigned) 1);
6087 dot
+= TO_ADDR (size
);
6088 if (!(output_section_statement
->bfd_section
->flags
6090 output_section_statement
->bfd_section
->size
6091 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
6096 case lang_reloc_statement_enum
:
6100 s
->reloc_statement
.output_offset
=
6101 dot
- output_section_statement
->bfd_section
->vma
;
6102 s
->reloc_statement
.output_section
=
6103 output_section_statement
->bfd_section
;
6104 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
6105 dot
+= TO_ADDR (size
);
6106 if (!(output_section_statement
->bfd_section
->flags
6108 output_section_statement
->bfd_section
->size
6109 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
6113 case lang_wild_statement_enum
:
6114 dot
= lang_size_sections_1 (&s
->wild_statement
.children
.head
,
6115 output_section_statement
,
6116 fill
, dot
, relax
, check_regions
);
6119 case lang_object_symbols_statement_enum
:
6120 link_info
.create_object_symbols_section
6121 = output_section_statement
->bfd_section
;
6122 output_section_statement
->bfd_section
->flags
|= SEC_KEEP
;
6125 case lang_output_statement_enum
:
6126 case lang_target_statement_enum
:
6129 case lang_input_section_enum
:
6133 i
= s
->input_section
.section
;
6138 if (!bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
6139 einfo (_("%F%P: can't relax section: %E\n"));
6143 dot
= size_input_section (prev
, output_section_statement
,
6144 fill
, &removed
, dot
);
6148 case lang_input_statement_enum
:
6151 case lang_fill_statement_enum
:
6152 s
->fill_statement
.output_section
=
6153 output_section_statement
->bfd_section
;
6155 fill
= s
->fill_statement
.fill
;
6158 case lang_assignment_statement_enum
:
6160 bfd_vma newdot
= dot
;
6161 etree_type
*tree
= s
->assignment_statement
.exp
;
6163 expld
.dataseg
.relro
= exp_seg_relro_none
;
6165 exp_fold_tree (tree
,
6166 output_section_statement
->bfd_section
,
6169 ldlang_check_relro_region (s
, &expld
.dataseg
);
6171 expld
.dataseg
.relro
= exp_seg_relro_none
;
6173 /* This symbol may be relative to this section. */
6174 if ((tree
->type
.node_class
== etree_provided
6175 || tree
->type
.node_class
== etree_assign
)
6176 && (tree
->assign
.dst
[0] != '.'
6177 || tree
->assign
.dst
[1] != '\0'))
6178 output_section_statement
->update_dot
= 1;
6180 if (!output_section_statement
->ignored
)
6182 if (output_section_statement
== abs_output_section
)
6184 /* If we don't have an output section, then just adjust
6185 the default memory address. */
6186 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
6187 false)->current
= newdot
;
6189 else if (newdot
!= dot
)
6191 /* Insert a pad after this statement. We can't
6192 put the pad before when relaxing, in case the
6193 assignment references dot. */
6194 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
6195 output_section_statement
->bfd_section
, dot
);
6197 /* Don't neuter the pad below when relaxing. */
6200 /* If dot is advanced, this implies that the section
6201 should have space allocated to it, unless the
6202 user has explicitly stated that the section
6203 should not be allocated. */
6204 if (output_section_statement
->sectype
!= noalloc_section
6205 && (output_section_statement
->sectype
!= noload_section
6206 || (bfd_get_flavour (link_info
.output_bfd
)
6207 == bfd_target_elf_flavour
)))
6208 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
6215 case lang_padding_statement_enum
:
6216 /* If this is the first time lang_size_sections is called,
6217 we won't have any padding statements. If this is the
6218 second or later passes when relaxing, we should allow
6219 padding to shrink. If padding is needed on this pass, it
6220 will be added back in. */
6221 s
->padding_statement
.size
= 0;
6223 /* Make sure output_offset is valid. If relaxation shrinks
6224 the section and this pad isn't needed, it's possible to
6225 have output_offset larger than the final size of the
6226 section. bfd_set_section_contents will complain even for
6227 a pad size of zero. */
6228 s
->padding_statement
.output_offset
6229 = dot
- output_section_statement
->bfd_section
->vma
;
6232 case lang_group_statement_enum
:
6233 dot
= lang_size_sections_1 (&s
->group_statement
.children
.head
,
6234 output_section_statement
,
6235 fill
, dot
, relax
, check_regions
);
6238 case lang_insert_statement_enum
:
6241 /* We can only get here when relaxing is turned on. */
6242 case lang_address_statement_enum
:
6250 /* If an input section doesn't fit in the current output
6251 section, remove it from the list. Handle the case where we
6252 have to remove an input_section statement here: there is a
6253 special case to remove the first element of the list. */
6254 if (link_info
.non_contiguous_regions
&& removed
)
6256 /* If we removed the first element during the previous
6257 iteration, override the loop assignment of prev_s. */
6263 /* If there was a real previous input section, just skip
6265 prev_s
->header
.next
=s
->header
.next
;
6267 removed_prev_s
= false;
6271 /* Remove the first input section of the list. */
6272 *prev
= s
->header
.next
;
6273 removed_prev_s
= true;
6276 /* Move to next element, unless we removed the head of the
6278 if (!removed_prev_s
)
6279 prev
= &s
->header
.next
;
6283 prev
= &s
->header
.next
;
6284 removed_prev_s
= false;
6290 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
6291 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
6292 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
6293 segments. We are allowed an opportunity to override this decision. */
6296 ldlang_override_segment_assignment (struct bfd_link_info
*info ATTRIBUTE_UNUSED
,
6297 bfd
*abfd ATTRIBUTE_UNUSED
,
6298 asection
*current_section
,
6299 asection
*previous_section
,
6302 lang_output_section_statement_type
*cur
;
6303 lang_output_section_statement_type
*prev
;
6305 /* The checks below are only necessary when the BFD library has decided
6306 that the two sections ought to be placed into the same segment. */
6310 /* Paranoia checks. */
6311 if (current_section
== NULL
|| previous_section
== NULL
)
6314 /* If this flag is set, the target never wants code and non-code
6315 sections comingled in the same segment. */
6316 if (config
.separate_code
6317 && ((current_section
->flags
^ previous_section
->flags
) & SEC_CODE
))
6320 /* Find the memory regions associated with the two sections.
6321 We call lang_output_section_find() here rather than scanning the list
6322 of output sections looking for a matching section pointer because if
6323 we have a large number of sections then a hash lookup is faster. */
6324 cur
= lang_output_section_find (current_section
->name
);
6325 prev
= lang_output_section_find (previous_section
->name
);
6327 /* More paranoia. */
6328 if (cur
== NULL
|| prev
== NULL
)
6331 /* If the regions are different then force the sections to live in
6332 different segments. See the email thread starting at the following
6333 URL for the reasons why this is necessary:
6334 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
6335 return cur
->region
!= prev
->region
;
6339 one_lang_size_sections_pass (bool *relax
, bool check_regions
)
6341 lang_statement_iteration
++;
6342 if (expld
.phase
!= lang_mark_phase_enum
)
6343 lang_sizing_iteration
++;
6344 lang_size_sections_1 (&statement_list
.head
, abs_output_section
,
6345 0, 0, relax
, check_regions
);
6349 lang_size_segment (seg_align_type
*seg
)
6351 /* If XXX_SEGMENT_ALIGN XXX_SEGMENT_END pair was seen, check whether
6352 a page could be saved in the data segment. */
6353 bfd_vma first
, last
;
6355 first
= -seg
->base
& (seg
->pagesize
- 1);
6356 last
= seg
->end
& (seg
->pagesize
- 1);
6358 && ((seg
->base
& ~(seg
->pagesize
- 1))
6359 != (seg
->end
& ~(seg
->pagesize
- 1)))
6360 && first
+ last
<= seg
->pagesize
)
6362 seg
->phase
= exp_seg_adjust
;
6366 seg
->phase
= exp_seg_done
;
6371 lang_size_relro_segment_1 (seg_align_type
*seg
)
6373 bfd_vma relro_end
, desired_end
;
6374 asection
*sec
, *prev_sec
= NULL
;
6375 bool remove_page_gap
= false;
6376 unsigned int max_alignment_power
= 0;
6378 /* Compute the expected PT_GNU_RELRO/PT_LOAD segment end. */
6379 relro_end
= ((seg
->relro_end
+ seg
->pagesize
- 1)
6380 & ~(seg
->pagesize
- 1));
6382 /* Adjust by the offset arg of XXX_SEGMENT_RELRO_END. */
6383 desired_end
= relro_end
- seg
->relro_offset
;
6385 /* For sections in the relro segment.. */
6386 for (sec
= link_info
.output_bfd
->section_last
; sec
; sec
= sec
->prev
)
6387 if ((sec
->flags
& SEC_ALLOC
) != 0)
6389 if (sec
->alignment_power
> max_alignment_power
)
6390 max_alignment_power
= sec
->alignment_power
;
6392 if (sec
->vma
>= seg
->base
6393 && sec
->vma
< seg
->relro_end
- seg
->relro_offset
)
6395 /* Where do we want to put this section so that it ends as
6397 bfd_vma start
, end
, bump
;
6399 end
= start
= sec
->vma
;
6401 end
+= TO_ADDR (sec
->size
);
6402 bump
= desired_end
- end
;
6403 /* We'd like to increase START by BUMP, but we must heed
6404 alignment so the increase might be less than optimum. */
6406 start
&= ~(((bfd_vma
) 1 << sec
->alignment_power
) - 1);
6407 /* This is now the desired end for the previous section. */
6408 desired_end
= start
;
6409 prev_sec
= sec
->prev
;
6413 seg
->phase
= exp_seg_relro_adjust
;
6414 ASSERT (desired_end
>= seg
->base
);
6416 for (; prev_sec
; prev_sec
= prev_sec
->prev
)
6417 if ((prev_sec
->flags
& SEC_ALLOC
) != 0)
6419 if (prev_sec
->alignment_power
> max_alignment_power
)
6420 max_alignment_power
= prev_sec
->alignment_power
;
6422 if (prev_sec
->size
!= 0)
6424 /* The 1-page gap before the RELRO segment may be removed. */
6425 remove_page_gap
= ((prev_sec
->vma
+ prev_sec
->size
6426 + seg
->maxpagesize
) < desired_end
);
6432 if (remove_page_gap
)
6434 /* Find the maximum section alignment. */
6435 for (sec
= prev_sec
; sec
; sec
= sec
->prev
)
6436 if ((sec
->flags
& SEC_ALLOC
) != 0
6437 && sec
->alignment_power
> max_alignment_power
)
6438 max_alignment_power
= sec
->alignment_power
;
6440 /* Remove the 1-page gap before the RELRO segment only if the
6441 maximum page size >= the maximum section alignment. */
6442 if (seg
->maxpagesize
>= (1U << max_alignment_power
))
6444 /* If the preceding section size is greater than the maximum
6445 page size, subtract the maximum page size. Otherwise,
6446 align the RELRO segment to the maximum page size. */
6447 if (prev_sec
->size
> seg
->maxpagesize
)
6449 desired_end
-= seg
->maxpagesize
;
6450 relro_end
-= seg
->maxpagesize
;
6454 desired_end
&= ~(seg
->maxpagesize
- 1);
6455 relro_end
&= ~(seg
->maxpagesize
- 1);
6460 seg
->base
= desired_end
;
6465 lang_size_relro_segment (bool *relax
, bool check_regions
)
6467 bool do_reset
= false;
6469 if (link_info
.relro
&& expld
.dataseg
.relro_end
)
6471 bfd_vma data_initial_base
= expld
.dataseg
.base
;
6472 bfd_vma data_relro_end
= lang_size_relro_segment_1 (&expld
.dataseg
);
6474 lang_reset_memory_regions ();
6475 one_lang_size_sections_pass (relax
, check_regions
);
6477 /* Assignments to dot, or to output section address in a user
6478 script have increased padding over the original. Revert. */
6479 if (expld
.dataseg
.relro_end
> data_relro_end
)
6481 expld
.dataseg
.base
= data_initial_base
;;
6485 else if (lang_size_segment (&expld
.dataseg
))
6492 lang_size_sections (bool *relax
, bool check_regions
)
6494 expld
.phase
= lang_allocating_phase_enum
;
6495 expld
.dataseg
.phase
= exp_seg_none
;
6497 one_lang_size_sections_pass (relax
, check_regions
);
6499 if (expld
.dataseg
.phase
!= exp_seg_end_seen
)
6500 expld
.dataseg
.phase
= exp_seg_done
;
6502 if (expld
.dataseg
.phase
== exp_seg_end_seen
)
6505 = lang_size_relro_segment (relax
, check_regions
);
6509 lang_reset_memory_regions ();
6510 one_lang_size_sections_pass (relax
, check_regions
);
6513 if (link_info
.relro
&& expld
.dataseg
.relro_end
)
6515 link_info
.relro_start
= expld
.dataseg
.base
;
6516 link_info
.relro_end
= expld
.dataseg
.relro_end
;
6521 static lang_output_section_statement_type
*current_section
;
6522 static lang_assignment_statement_type
*current_assign
;
6523 static bool prefer_next_section
;
6525 /* Worker function for lang_do_assignments. Recursiveness goes here. */
6528 lang_do_assignments_1 (lang_statement_union_type
*s
,
6529 lang_output_section_statement_type
*current_os
,
6534 for (; s
!= NULL
; s
= s
->header
.next
)
6536 switch (s
->header
.type
)
6538 case lang_constructors_statement_enum
:
6539 dot
= lang_do_assignments_1 (constructor_list
.head
,
6540 current_os
, fill
, dot
, found_end
);
6543 case lang_output_section_statement_enum
:
6545 lang_output_section_statement_type
*os
;
6548 os
= &(s
->output_section_statement
);
6549 os
->after_end
= *found_end
;
6550 init_opb (os
->bfd_section
);
6552 if (os
->bfd_section
!= NULL
)
6554 if (!os
->ignored
&& (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
6556 current_section
= os
;
6557 prefer_next_section
= false;
6559 newdot
= os
->bfd_section
->vma
;
6561 newdot
= lang_do_assignments_1 (os
->children
.head
,
6562 os
, os
->fill
, newdot
, found_end
);
6565 if (os
->bfd_section
!= NULL
)
6567 newdot
= os
->bfd_section
->vma
;
6569 /* .tbss sections effectively have zero size. */
6570 if (!IS_TBSS (os
->bfd_section
)
6571 || bfd_link_relocatable (&link_info
))
6572 newdot
+= TO_ADDR (os
->bfd_section
->size
);
6574 if (os
->update_dot_tree
!= NULL
)
6575 exp_fold_tree (os
->update_dot_tree
,
6576 bfd_abs_section_ptr
, &newdot
);
6583 case lang_wild_statement_enum
:
6585 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
6586 current_os
, fill
, dot
, found_end
);
6589 case lang_object_symbols_statement_enum
:
6590 case lang_output_statement_enum
:
6591 case lang_target_statement_enum
:
6594 case lang_data_statement_enum
:
6595 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
6596 if (expld
.result
.valid_p
)
6598 s
->data_statement
.value
= expld
.result
.value
;
6599 if (expld
.result
.section
!= NULL
)
6600 s
->data_statement
.value
+= expld
.result
.section
->vma
;
6602 else if (expld
.phase
== lang_final_phase_enum
)
6603 einfo (_("%F%P: invalid data statement\n"));
6606 switch (s
->data_statement
.type
)
6624 if (size
< TO_SIZE ((unsigned) 1))
6625 size
= TO_SIZE ((unsigned) 1);
6626 dot
+= TO_ADDR (size
);
6630 case lang_reloc_statement_enum
:
6631 exp_fold_tree (s
->reloc_statement
.addend_exp
,
6632 bfd_abs_section_ptr
, &dot
);
6633 if (expld
.result
.valid_p
)
6634 s
->reloc_statement
.addend_value
= expld
.result
.value
;
6635 else if (expld
.phase
== lang_final_phase_enum
)
6636 einfo (_("%F%P: invalid reloc statement\n"));
6637 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
6640 case lang_input_section_enum
:
6642 asection
*in
= s
->input_section
.section
;
6644 if ((in
->flags
& SEC_EXCLUDE
) == 0)
6645 dot
+= TO_ADDR (in
->size
);
6649 case lang_input_statement_enum
:
6652 case lang_fill_statement_enum
:
6653 fill
= s
->fill_statement
.fill
;
6656 case lang_assignment_statement_enum
:
6657 current_assign
= &s
->assignment_statement
;
6658 if (current_assign
->exp
->type
.node_class
!= etree_assert
)
6660 const char *p
= current_assign
->exp
->assign
.dst
;
6662 if (current_os
== abs_output_section
&& p
[0] == '.' && p
[1] == 0)
6663 prefer_next_section
= true;
6667 if (strcmp (p
, "end") == 0)
6670 exp_fold_tree (s
->assignment_statement
.exp
,
6671 (current_os
->bfd_section
!= NULL
6672 ? current_os
->bfd_section
: bfd_und_section_ptr
),
6676 case lang_padding_statement_enum
:
6677 dot
+= TO_ADDR (s
->padding_statement
.size
);
6680 case lang_group_statement_enum
:
6681 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
6682 current_os
, fill
, dot
, found_end
);
6685 case lang_insert_statement_enum
:
6688 case lang_address_statement_enum
:
6700 lang_do_assignments (lang_phase_type phase
)
6702 bool found_end
= false;
6704 current_section
= NULL
;
6705 prefer_next_section
= false;
6706 expld
.phase
= phase
;
6707 lang_statement_iteration
++;
6708 lang_do_assignments_1 (statement_list
.head
,
6709 abs_output_section
, NULL
, 0, &found_end
);
6712 /* For an assignment statement outside of an output section statement,
6713 choose the best of neighbouring output sections to use for values
6717 section_for_dot (void)
6721 /* Assignments belong to the previous output section, unless there
6722 has been an assignment to "dot", in which case following
6723 assignments belong to the next output section. (The assumption
6724 is that an assignment to "dot" is setting up the address for the
6725 next output section.) Except that past the assignment to "_end"
6726 we always associate with the previous section. This exception is
6727 for targets like SH that define an alloc .stack or other
6728 weirdness after non-alloc sections. */
6729 if (current_section
== NULL
|| prefer_next_section
)
6731 lang_statement_union_type
*stmt
;
6732 lang_output_section_statement_type
*os
;
6734 for (stmt
= (lang_statement_union_type
*) current_assign
;
6736 stmt
= stmt
->header
.next
)
6737 if (stmt
->header
.type
== lang_output_section_statement_enum
)
6740 os
= &stmt
->output_section_statement
;
6743 && (os
->bfd_section
== NULL
6744 || (os
->bfd_section
->flags
& SEC_EXCLUDE
) != 0
6745 || bfd_section_removed_from_list (link_info
.output_bfd
,
6749 if (current_section
== NULL
|| os
== NULL
|| !os
->after_end
)
6752 s
= os
->bfd_section
;
6754 s
= link_info
.output_bfd
->section_last
;
6756 && ((s
->flags
& SEC_ALLOC
) == 0
6757 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
6762 return bfd_abs_section_ptr
;
6766 s
= current_section
->bfd_section
;
6768 /* The section may have been stripped. */
6770 && ((s
->flags
& SEC_EXCLUDE
) != 0
6771 || (s
->flags
& SEC_ALLOC
) == 0
6772 || (s
->flags
& SEC_THREAD_LOCAL
) != 0
6773 || bfd_section_removed_from_list (link_info
.output_bfd
, s
)))
6776 s
= link_info
.output_bfd
->sections
;
6778 && ((s
->flags
& SEC_ALLOC
) == 0
6779 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
6784 return bfd_abs_section_ptr
;
6787 /* Array of __start/__stop/.startof./.sizeof/ symbols. */
6789 static struct bfd_link_hash_entry
**start_stop_syms
;
6790 static size_t start_stop_count
= 0;
6791 static size_t start_stop_alloc
= 0;
6793 /* Give start/stop SYMBOL for SEC a preliminary definition, and add it
6794 to start_stop_syms. */
6797 lang_define_start_stop (const char *symbol
, asection
*sec
)
6799 struct bfd_link_hash_entry
*h
;
6801 h
= bfd_define_start_stop (link_info
.output_bfd
, &link_info
, symbol
, sec
);
6804 if (start_stop_count
== start_stop_alloc
)
6806 start_stop_alloc
= 2 * start_stop_alloc
+ 10;
6808 = xrealloc (start_stop_syms
,
6809 start_stop_alloc
* sizeof (*start_stop_syms
));
6811 start_stop_syms
[start_stop_count
++] = h
;
6815 /* Check for input sections whose names match references to
6816 __start_SECNAME or __stop_SECNAME symbols. Give the symbols
6817 preliminary definitions. */
6820 lang_init_start_stop (void)
6824 char leading_char
= bfd_get_symbol_leading_char (link_info
.output_bfd
);
6826 for (abfd
= link_info
.input_bfds
; abfd
!= NULL
; abfd
= abfd
->link
.next
)
6827 for (s
= abfd
->sections
; s
!= NULL
; s
= s
->next
)
6830 const char *secname
= s
->name
;
6832 for (ps
= secname
; *ps
!= '\0'; ps
++)
6833 if (!ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
6837 char *symbol
= (char *) xmalloc (10 + strlen (secname
));
6839 symbol
[0] = leading_char
;
6840 sprintf (symbol
+ (leading_char
!= 0), "__start_%s", secname
);
6841 lang_define_start_stop (symbol
, s
);
6843 symbol
[1] = leading_char
;
6844 memcpy (symbol
+ 1 + (leading_char
!= 0), "__stop", 6);
6845 lang_define_start_stop (symbol
+ 1, s
);
6852 /* Iterate over start_stop_syms. */
6855 foreach_start_stop (void (*func
) (struct bfd_link_hash_entry
*))
6859 for (i
= 0; i
< start_stop_count
; ++i
)
6860 func (start_stop_syms
[i
]);
6863 /* __start and __stop symbols are only supposed to be defined by the
6864 linker for orphan sections, but we now extend that to sections that
6865 map to an output section of the same name. The symbols were
6866 defined early for --gc-sections, before we mapped input to output
6867 sections, so undo those that don't satisfy this rule. */
6870 undef_start_stop (struct bfd_link_hash_entry
*h
)
6872 if (h
->ldscript_def
)
6875 if (h
->u
.def
.section
->output_section
== NULL
6876 || h
->u
.def
.section
->output_section
->owner
!= link_info
.output_bfd
6877 || strcmp (h
->u
.def
.section
->name
,
6878 h
->u
.def
.section
->output_section
->name
) != 0)
6880 asection
*sec
= bfd_get_section_by_name (link_info
.output_bfd
,
6881 h
->u
.def
.section
->name
);
6884 /* When there are more than one input sections with the same
6885 section name, SECNAME, linker picks the first one to define
6886 __start_SECNAME and __stop_SECNAME symbols. When the first
6887 input section is removed by comdat group, we need to check
6888 if there is still an output section with section name
6891 for (i
= sec
->map_head
.s
; i
!= NULL
; i
= i
->map_head
.s
)
6892 if (strcmp (h
->u
.def
.section
->name
, i
->name
) == 0)
6894 h
->u
.def
.section
= i
;
6898 h
->type
= bfd_link_hash_undefined
;
6899 h
->u
.undef
.abfd
= NULL
;
6900 if (is_elf_hash_table (link_info
.hash
))
6902 const struct elf_backend_data
*bed
;
6903 struct elf_link_hash_entry
*eh
= (struct elf_link_hash_entry
*) h
;
6904 unsigned int was_forced
= eh
->forced_local
;
6906 bed
= get_elf_backend_data (link_info
.output_bfd
);
6907 (*bed
->elf_backend_hide_symbol
) (&link_info
, eh
, true);
6908 if (!eh
->ref_regular_nonweak
)
6909 h
->type
= bfd_link_hash_undefweak
;
6910 eh
->def_regular
= 0;
6911 eh
->forced_local
= was_forced
;
6917 lang_undef_start_stop (void)
6919 foreach_start_stop (undef_start_stop
);
6922 /* Check for output sections whose names match references to
6923 .startof.SECNAME or .sizeof.SECNAME symbols. Give the symbols
6924 preliminary definitions. */
6927 lang_init_startof_sizeof (void)
6931 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
6933 const char *secname
= s
->name
;
6934 char *symbol
= (char *) xmalloc (10 + strlen (secname
));
6936 sprintf (symbol
, ".startof.%s", secname
);
6937 lang_define_start_stop (symbol
, s
);
6939 memcpy (symbol
+ 1, ".size", 5);
6940 lang_define_start_stop (symbol
+ 1, s
);
6945 /* Set .startof., .sizeof., __start and __stop symbols final values. */
6948 set_start_stop (struct bfd_link_hash_entry
*h
)
6951 || h
->type
!= bfd_link_hash_defined
)
6954 if (h
->root
.string
[0] == '.')
6956 /* .startof. or .sizeof. symbol.
6957 .startof. already has final value. */
6958 if (h
->root
.string
[2] == 'i')
6961 h
->u
.def
.value
= TO_ADDR (h
->u
.def
.section
->size
);
6962 h
->u
.def
.section
= bfd_abs_section_ptr
;
6967 /* __start or __stop symbol. */
6968 int has_lead
= bfd_get_symbol_leading_char (link_info
.output_bfd
) != 0;
6970 h
->u
.def
.section
= h
->u
.def
.section
->output_section
;
6971 if (h
->root
.string
[4 + has_lead
] == 'o')
6974 h
->u
.def
.value
= TO_ADDR (h
->u
.def
.section
->size
);
6980 lang_finalize_start_stop (void)
6982 foreach_start_stop (set_start_stop
);
6986 lang_symbol_tweaks (void)
6988 /* Give initial values for __start and __stop symbols, so that ELF
6989 gc_sections will keep sections referenced by these symbols. Must
6990 be done before lang_do_assignments. */
6991 if (config
.build_constructors
)
6992 lang_init_start_stop ();
6994 /* Make __ehdr_start hidden, and set def_regular even though it is
6995 likely undefined at this stage. For lang_check_relocs. */
6996 if (is_elf_hash_table (link_info
.hash
)
6997 && !bfd_link_relocatable (&link_info
))
6999 struct elf_link_hash_entry
*h
= (struct elf_link_hash_entry
*)
7000 bfd_link_hash_lookup (link_info
.hash
, "__ehdr_start",
7001 false, false, true);
7003 /* Only adjust the export class if the symbol was referenced
7004 and not defined, otherwise leave it alone. */
7006 && (h
->root
.type
== bfd_link_hash_new
7007 || h
->root
.type
== bfd_link_hash_undefined
7008 || h
->root
.type
== bfd_link_hash_undefweak
7009 || h
->root
.type
== bfd_link_hash_common
))
7011 const struct elf_backend_data
*bed
;
7012 bed
= get_elf_backend_data (link_info
.output_bfd
);
7013 (*bed
->elf_backend_hide_symbol
) (&link_info
, h
, true);
7014 if (ELF_ST_VISIBILITY (h
->other
) != STV_INTERNAL
)
7015 h
->other
= (h
->other
& ~ELF_ST_VISIBILITY (-1)) | STV_HIDDEN
;
7017 h
->root
.linker_def
= 1;
7018 h
->root
.rel_from_abs
= 1;
7026 struct bfd_link_hash_entry
*h
;
7029 if ((bfd_link_relocatable (&link_info
) && !link_info
.gc_sections
)
7030 || bfd_link_dll (&link_info
))
7031 warn
= entry_from_cmdline
;
7035 /* Force the user to specify a root when generating a relocatable with
7036 --gc-sections, unless --gc-keep-exported was also given. */
7037 if (bfd_link_relocatable (&link_info
)
7038 && link_info
.gc_sections
7039 && !link_info
.gc_keep_exported
)
7041 struct bfd_sym_chain
*sym
;
7043 for (sym
= link_info
.gc_sym_list
; sym
!= NULL
; sym
= sym
->next
)
7045 h
= bfd_link_hash_lookup (link_info
.hash
, sym
->name
,
7046 false, false, false);
7048 && (h
->type
== bfd_link_hash_defined
7049 || h
->type
== bfd_link_hash_defweak
)
7050 && !bfd_is_const_section (h
->u
.def
.section
))
7054 einfo (_("%F%P: --gc-sections requires a defined symbol root "
7055 "specified by -e or -u\n"));
7058 if (entry_symbol
.name
== NULL
)
7060 /* No entry has been specified. Look for the default entry, but
7061 don't warn if we don't find it. */
7062 entry_symbol
.name
= entry_symbol_default
;
7066 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
7067 false, false, true);
7069 && (h
->type
== bfd_link_hash_defined
7070 || h
->type
== bfd_link_hash_defweak
)
7071 && h
->u
.def
.section
->output_section
!= NULL
)
7075 val
= (h
->u
.def
.value
7076 + bfd_section_vma (h
->u
.def
.section
->output_section
)
7077 + h
->u
.def
.section
->output_offset
);
7078 if (!bfd_set_start_address (link_info
.output_bfd
, val
))
7079 einfo (_("%F%P: %s: can't set start address\n"), entry_symbol
.name
);
7086 /* We couldn't find the entry symbol. Try parsing it as a
7088 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
7091 if (!bfd_set_start_address (link_info
.output_bfd
, val
))
7092 einfo (_("%F%P: can't set start address\n"));
7094 /* BZ 2004952: Only use the start of the entry section for executables. */
7095 else if bfd_link_executable (&link_info
)
7099 /* Can't find the entry symbol, and it's not a number. Use
7100 the first address in the text section. */
7101 ts
= bfd_get_section_by_name (link_info
.output_bfd
, entry_section
);
7105 einfo (_("%P: warning: cannot find entry symbol %s;"
7106 " defaulting to %V\n"),
7108 bfd_section_vma (ts
));
7109 if (!bfd_set_start_address (link_info
.output_bfd
,
7110 bfd_section_vma (ts
)))
7111 einfo (_("%F%P: can't set start address\n"));
7116 einfo (_("%P: warning: cannot find entry symbol %s;"
7117 " not setting start address\n"),
7124 einfo (_("%P: warning: cannot find entry symbol %s;"
7125 " not setting start address\n"),
7131 /* This is a small function used when we want to ignore errors from
7135 ignore_bfd_errors (const char *fmt ATTRIBUTE_UNUSED
,
7136 va_list ap ATTRIBUTE_UNUSED
)
7138 /* Don't do anything. */
7141 /* Check that the architecture of all the input files is compatible
7142 with the output file. Also call the backend to let it do any
7143 other checking that is needed. */
7148 lang_input_statement_type
*file
;
7150 const bfd_arch_info_type
*compatible
;
7152 for (file
= (void *) file_chain
.head
;
7156 #if BFD_SUPPORTS_PLUGINS
7157 /* Don't check format of files claimed by plugin. */
7158 if (file
->flags
.claimed
)
7160 #endif /* BFD_SUPPORTS_PLUGINS */
7161 input_bfd
= file
->the_bfd
;
7163 = bfd_arch_get_compatible (input_bfd
, link_info
.output_bfd
,
7164 command_line
.accept_unknown_input_arch
);
7166 /* In general it is not possible to perform a relocatable
7167 link between differing object formats when the input
7168 file has relocations, because the relocations in the
7169 input format may not have equivalent representations in
7170 the output format (and besides BFD does not translate
7171 relocs for other link purposes than a final link). */
7172 if (!file
->flags
.just_syms
7173 && (bfd_link_relocatable (&link_info
)
7174 || link_info
.emitrelocations
)
7175 && (compatible
== NULL
7176 || (bfd_get_flavour (input_bfd
)
7177 != bfd_get_flavour (link_info
.output_bfd
)))
7178 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
7180 einfo (_("%F%P: relocatable linking with relocations from"
7181 " format %s (%pB) to format %s (%pB) is not supported\n"),
7182 bfd_get_target (input_bfd
), input_bfd
,
7183 bfd_get_target (link_info
.output_bfd
), link_info
.output_bfd
);
7184 /* einfo with %F exits. */
7187 if (compatible
== NULL
)
7189 if (command_line
.warn_mismatch
)
7190 einfo (_("%X%P: %s architecture of input file `%pB'"
7191 " is incompatible with %s output\n"),
7192 bfd_printable_name (input_bfd
), input_bfd
,
7193 bfd_printable_name (link_info
.output_bfd
));
7196 /* If the input bfd has no contents, it shouldn't set the
7197 private data of the output bfd. */
7198 else if (!file
->flags
.just_syms
7199 && ((input_bfd
->flags
& DYNAMIC
) != 0
7200 || bfd_count_sections (input_bfd
) != 0))
7202 bfd_error_handler_type pfn
= NULL
;
7204 /* If we aren't supposed to warn about mismatched input
7205 files, temporarily set the BFD error handler to a
7206 function which will do nothing. We still want to call
7207 bfd_merge_private_bfd_data, since it may set up
7208 information which is needed in the output file. */
7209 if (!command_line
.warn_mismatch
)
7210 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
7211 if (!bfd_merge_private_bfd_data (input_bfd
, &link_info
))
7213 if (command_line
.warn_mismatch
)
7214 einfo (_("%X%P: failed to merge target specific data"
7215 " of file %pB\n"), input_bfd
);
7217 if (!command_line
.warn_mismatch
)
7218 bfd_set_error_handler (pfn
);
7223 /* Look through all the global common symbols and attach them to the
7224 correct section. The -sort-common command line switch may be used
7225 to roughly sort the entries by alignment. */
7230 if (link_info
.inhibit_common_definition
)
7232 if (bfd_link_relocatable (&link_info
)
7233 && !command_line
.force_common_definition
)
7236 if (!config
.sort_common
)
7237 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
7242 if (config
.sort_common
== sort_descending
)
7244 for (power
= 4; power
> 0; power
--)
7245 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
7248 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
7252 for (power
= 0; power
<= 4; power
++)
7253 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
7255 power
= (unsigned int) -1;
7256 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
7261 /* Place one common symbol in the correct section. */
7264 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
7266 unsigned int power_of_two
;
7270 if (h
->type
!= bfd_link_hash_common
)
7274 power_of_two
= h
->u
.c
.p
->alignment_power
;
7276 if (config
.sort_common
== sort_descending
7277 && power_of_two
< *(unsigned int *) info
)
7279 else if (config
.sort_common
== sort_ascending
7280 && power_of_two
> *(unsigned int *) info
)
7283 section
= h
->u
.c
.p
->section
;
7284 if (!bfd_define_common_symbol (link_info
.output_bfd
, &link_info
, h
))
7285 einfo (_("%F%P: could not define common symbol `%pT': %E\n"),
7288 if (config
.map_file
!= NULL
)
7290 static bool header_printed
;
7295 if (!header_printed
)
7297 minfo (_("\nAllocating common symbols\n"));
7298 minfo (_("Common symbol size file\n\n"));
7299 header_printed
= true;
7302 name
= bfd_demangle (link_info
.output_bfd
, h
->root
.string
,
7303 DMGL_ANSI
| DMGL_PARAMS
);
7306 minfo ("%s", h
->root
.string
);
7307 len
= strlen (h
->root
.string
);
7312 len
= strlen (name
);
7328 if (size
<= 0xffffffff)
7329 sprintf (buf
, "%lx", (unsigned long) size
);
7331 sprintf_vma (buf
, size
);
7341 minfo ("%pB\n", section
->owner
);
7347 /* Handle a single orphan section S, placing the orphan into an appropriate
7348 output section. The effects of the --orphan-handling command line
7349 option are handled here. */
7352 ldlang_place_orphan (asection
*s
)
7354 if (config
.orphan_handling
== orphan_handling_discard
)
7356 lang_output_section_statement_type
*os
;
7357 os
= lang_output_section_statement_lookup (DISCARD_SECTION_NAME
, 0, 1);
7358 if (os
->addr_tree
== NULL
7359 && (bfd_link_relocatable (&link_info
)
7360 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
7361 os
->addr_tree
= exp_intop (0);
7362 lang_add_section (&os
->children
, s
, NULL
, NULL
, os
);
7366 lang_output_section_statement_type
*os
;
7367 const char *name
= s
->name
;
7370 if (config
.orphan_handling
== orphan_handling_error
)
7371 einfo (_("%X%P: error: unplaced orphan section `%pA' from `%pB'\n"),
7374 if (config
.unique_orphan_sections
|| unique_section_p (s
, NULL
))
7375 constraint
= SPECIAL
;
7377 os
= ldemul_place_orphan (s
, name
, constraint
);
7380 os
= lang_output_section_statement_lookup (name
, constraint
, 1);
7381 if (os
->addr_tree
== NULL
7382 && (bfd_link_relocatable (&link_info
)
7383 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
7384 os
->addr_tree
= exp_intop (0);
7385 lang_add_section (&os
->children
, s
, NULL
, NULL
, os
);
7388 if (config
.orphan_handling
== orphan_handling_warn
)
7389 einfo (_("%P: warning: orphan section `%pA' from `%pB' being "
7390 "placed in section `%s'\n"),
7391 s
, s
->owner
, os
->name
);
7395 /* Run through the input files and ensure that every input section has
7396 somewhere to go. If one is found without a destination then create
7397 an input request and place it into the statement tree. */
7400 lang_place_orphans (void)
7402 LANG_FOR_EACH_INPUT_STATEMENT (file
)
7406 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
7408 if (s
->output_section
== NULL
)
7410 /* This section of the file is not attached, root
7411 around for a sensible place for it to go. */
7413 if (file
->flags
.just_syms
)
7414 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
7415 else if (lang_discard_section_p (s
))
7416 s
->output_section
= bfd_abs_section_ptr
;
7417 else if (strcmp (s
->name
, "COMMON") == 0)
7419 /* This is a lonely common section which must have
7420 come from an archive. We attach to the section
7421 with the wildcard. */
7422 if (!bfd_link_relocatable (&link_info
)
7423 || command_line
.force_common_definition
)
7425 if (default_common_section
== NULL
)
7426 default_common_section
7427 = lang_output_section_statement_lookup (".bss", 0, 1);
7428 lang_add_section (&default_common_section
->children
, s
,
7429 NULL
, NULL
, default_common_section
);
7433 ldlang_place_orphan (s
);
7440 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
7442 flagword
*ptr_flags
;
7444 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
7450 /* PR 17900: An exclamation mark in the attributes reverses
7451 the sense of any of the attributes that follow. */
7454 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
7458 *ptr_flags
|= SEC_ALLOC
;
7462 *ptr_flags
|= SEC_READONLY
;
7466 *ptr_flags
|= SEC_DATA
;
7470 *ptr_flags
|= SEC_CODE
;
7475 *ptr_flags
|= SEC_LOAD
;
7479 einfo (_("%F%P: invalid character %c (%d) in flags\n"),
7487 /* Call a function on each real input file. This function will be
7488 called on an archive, but not on the elements. */
7491 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
7493 lang_input_statement_type
*f
;
7495 for (f
= (void *) input_file_chain
.head
;
7497 f
= f
->next_real_file
)
7502 /* Call a function on each real file. The function will be called on
7503 all the elements of an archive which are included in the link, but
7504 will not be called on the archive file itself. */
7507 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
7509 LANG_FOR_EACH_INPUT_STATEMENT (f
)
7517 ldlang_add_file (lang_input_statement_type
*entry
)
7519 lang_statement_append (&file_chain
, entry
, &entry
->next
);
7521 /* The BFD linker needs to have a list of all input BFDs involved in
7523 ASSERT (link_info
.input_bfds_tail
!= &entry
->the_bfd
->link
.next
7524 && entry
->the_bfd
->link
.next
== NULL
);
7525 ASSERT (entry
->the_bfd
!= link_info
.output_bfd
);
7527 *link_info
.input_bfds_tail
= entry
->the_bfd
;
7528 link_info
.input_bfds_tail
= &entry
->the_bfd
->link
.next
;
7529 bfd_set_usrdata (entry
->the_bfd
, entry
);
7530 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
7532 /* Look through the sections and check for any which should not be
7533 included in the link. We need to do this now, so that we can
7534 notice when the backend linker tries to report multiple
7535 definition errors for symbols which are in sections we aren't
7536 going to link. FIXME: It might be better to entirely ignore
7537 symbols which are defined in sections which are going to be
7538 discarded. This would require modifying the backend linker for
7539 each backend which might set the SEC_LINK_ONCE flag. If we do
7540 this, we should probably handle SEC_EXCLUDE in the same way. */
7542 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
7546 lang_add_output (const char *name
, int from_script
)
7548 /* Make -o on command line override OUTPUT in script. */
7549 if (!had_output_filename
|| !from_script
)
7551 output_filename
= name
;
7552 had_output_filename
= true;
7556 lang_output_section_statement_type
*
7557 lang_enter_output_section_statement (const char *output_section_statement_name
,
7558 etree_type
*address_exp
,
7559 enum section_type sectype
,
7561 etree_type
*subalign
,
7564 int align_with_input
)
7566 lang_output_section_statement_type
*os
;
7568 os
= lang_output_section_statement_lookup (output_section_statement_name
,
7570 current_section
= os
;
7572 if (os
->addr_tree
== NULL
)
7574 os
->addr_tree
= address_exp
;
7576 os
->sectype
= sectype
;
7577 if (sectype
!= noload_section
)
7578 os
->flags
= SEC_NO_FLAGS
;
7580 os
->flags
= SEC_NEVER_LOAD
;
7581 os
->block_value
= 1;
7583 /* Make next things chain into subchain of this. */
7584 push_stat_ptr (&os
->children
);
7586 os
->align_lma_with_input
= align_with_input
== ALIGN_WITH_INPUT
;
7587 if (os
->align_lma_with_input
&& align
!= NULL
)
7588 einfo (_("%F%P:%pS: error: align with input and explicit align specified\n"),
7591 os
->subsection_alignment
= subalign
;
7592 os
->section_alignment
= align
;
7594 os
->load_base
= ebase
;
7601 lang_output_statement_type
*new_stmt
;
7603 new_stmt
= new_stat (lang_output_statement
, stat_ptr
);
7604 new_stmt
->name
= output_filename
;
7607 /* Reset the current counters in the regions. */
7610 lang_reset_memory_regions (void)
7612 lang_memory_region_type
*p
= lang_memory_region_list
;
7614 lang_output_section_statement_type
*os
;
7616 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
7618 p
->current
= p
->origin
;
7622 for (os
= (void *) lang_os_list
.head
;
7626 os
->processed_vma
= false;
7627 os
->processed_lma
= false;
7630 for (o
= link_info
.output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
7632 /* Save the last size for possible use by bfd_relax_section. */
7633 o
->rawsize
= o
->size
;
7634 if (!(o
->flags
& SEC_FIXED_SIZE
))
7639 /* Worker for lang_gc_sections_1. */
7642 gc_section_callback (lang_wild_statement_type
*ptr
,
7643 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
7645 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
7646 void *data ATTRIBUTE_UNUSED
)
7648 /* If the wild pattern was marked KEEP, the member sections
7649 should be as well. */
7650 if (ptr
->keep_sections
)
7651 section
->flags
|= SEC_KEEP
;
7654 /* Iterate over sections marking them against GC. */
7657 lang_gc_sections_1 (lang_statement_union_type
*s
)
7659 for (; s
!= NULL
; s
= s
->header
.next
)
7661 switch (s
->header
.type
)
7663 case lang_wild_statement_enum
:
7664 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
7666 case lang_constructors_statement_enum
:
7667 lang_gc_sections_1 (constructor_list
.head
);
7669 case lang_output_section_statement_enum
:
7670 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
7672 case lang_group_statement_enum
:
7673 lang_gc_sections_1 (s
->group_statement
.children
.head
);
7682 lang_gc_sections (void)
7684 /* Keep all sections so marked in the link script. */
7685 lang_gc_sections_1 (statement_list
.head
);
7687 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
7688 the special case of .stabstr debug info. (See bfd/stabs.c)
7689 Twiddle the flag here, to simplify later linker code. */
7690 if (bfd_link_relocatable (&link_info
))
7692 LANG_FOR_EACH_INPUT_STATEMENT (f
)
7695 #if BFD_SUPPORTS_PLUGINS
7696 if (f
->flags
.claimed
)
7699 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
7700 if ((sec
->flags
& SEC_DEBUGGING
) == 0
7701 || strcmp (sec
->name
, ".stabstr") != 0)
7702 sec
->flags
&= ~SEC_EXCLUDE
;
7706 if (link_info
.gc_sections
)
7707 bfd_gc_sections (link_info
.output_bfd
, &link_info
);
7710 /* Worker for lang_find_relro_sections_1. */
7713 find_relro_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
7714 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
7716 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
7719 /* Discarded, excluded and ignored sections effectively have zero
7721 if (section
->output_section
!= NULL
7722 && section
->output_section
->owner
== link_info
.output_bfd
7723 && (section
->output_section
->flags
& SEC_EXCLUDE
) == 0
7724 && !IGNORE_SECTION (section
)
7725 && section
->size
!= 0)
7727 bool *has_relro_section
= (bool *) data
;
7728 *has_relro_section
= true;
7732 /* Iterate over sections for relro sections. */
7735 lang_find_relro_sections_1 (lang_statement_union_type
*s
,
7736 seg_align_type
*seg
,
7737 bool *has_relro_section
)
7739 if (*has_relro_section
)
7742 for (; s
!= NULL
; s
= s
->header
.next
)
7744 if (s
== seg
->relro_end_stat
)
7747 switch (s
->header
.type
)
7749 case lang_wild_statement_enum
:
7750 walk_wild (&s
->wild_statement
,
7751 find_relro_section_callback
,
7754 case lang_constructors_statement_enum
:
7755 lang_find_relro_sections_1 (constructor_list
.head
,
7756 seg
, has_relro_section
);
7758 case lang_output_section_statement_enum
:
7759 lang_find_relro_sections_1 (s
->output_section_statement
.children
.head
,
7760 seg
, has_relro_section
);
7762 case lang_group_statement_enum
:
7763 lang_find_relro_sections_1 (s
->group_statement
.children
.head
,
7764 seg
, has_relro_section
);
7773 lang_find_relro_sections (void)
7775 bool has_relro_section
= false;
7777 /* Check all sections in the link script. */
7779 lang_find_relro_sections_1 (expld
.dataseg
.relro_start_stat
,
7780 &expld
.dataseg
, &has_relro_section
);
7782 if (!has_relro_section
)
7783 link_info
.relro
= false;
7786 /* Relax all sections until bfd_relax_section gives up. */
7789 lang_relax_sections (bool need_layout
)
7791 /* NB: Also enable relaxation to layout sections for DT_RELR. */
7792 if (RELAXATION_ENABLED
|| link_info
.enable_dt_relr
)
7794 /* We may need more than one relaxation pass. */
7795 int i
= link_info
.relax_pass
;
7797 /* The backend can use it to determine the current pass. */
7798 link_info
.relax_pass
= 0;
7802 /* Keep relaxing until bfd_relax_section gives up. */
7805 link_info
.relax_trip
= -1;
7808 link_info
.relax_trip
++;
7810 /* Note: pe-dll.c does something like this also. If you find
7811 you need to change this code, you probably need to change
7812 pe-dll.c also. DJ */
7814 /* Do all the assignments with our current guesses as to
7816 lang_do_assignments (lang_assigning_phase_enum
);
7818 /* We must do this after lang_do_assignments, because it uses
7820 lang_reset_memory_regions ();
7822 /* Perform another relax pass - this time we know where the
7823 globals are, so can make a better guess. */
7824 relax_again
= false;
7825 lang_size_sections (&relax_again
, false);
7827 while (relax_again
);
7829 link_info
.relax_pass
++;
7836 /* Final extra sizing to report errors. */
7837 lang_do_assignments (lang_assigning_phase_enum
);
7838 lang_reset_memory_regions ();
7839 lang_size_sections (NULL
, true);
7843 #if BFD_SUPPORTS_PLUGINS
7844 /* Find the insert point for the plugin's replacement files. We
7845 place them after the first claimed real object file, or if the
7846 first claimed object is an archive member, after the last real
7847 object file immediately preceding the archive. In the event
7848 no objects have been claimed at all, we return the first dummy
7849 object file on the list as the insert point; that works, but
7850 the callee must be careful when relinking the file_chain as it
7851 is not actually on that chain, only the statement_list and the
7852 input_file list; in that case, the replacement files must be
7853 inserted at the head of the file_chain. */
7855 static lang_input_statement_type
*
7856 find_replacements_insert_point (bool *before
)
7858 lang_input_statement_type
*claim1
, *lastobject
;
7859 lastobject
= (void *) input_file_chain
.head
;
7860 for (claim1
= (void *) file_chain
.head
;
7862 claim1
= claim1
->next
)
7864 if (claim1
->flags
.claimed
)
7866 *before
= claim1
->flags
.claim_archive
;
7867 return claim1
->flags
.claim_archive
? lastobject
: claim1
;
7869 /* Update lastobject if this is a real object file. */
7870 if (claim1
->the_bfd
!= NULL
&& claim1
->the_bfd
->my_archive
== NULL
)
7871 lastobject
= claim1
;
7873 /* No files were claimed by the plugin. Choose the last object
7874 file found on the list (maybe the first, dummy entry) as the
7880 /* Find where to insert ADD, an archive element or shared library
7881 added during a rescan. */
7883 static lang_input_statement_type
**
7884 find_rescan_insertion (lang_input_statement_type
*add
)
7886 bfd
*add_bfd
= add
->the_bfd
;
7887 lang_input_statement_type
*f
;
7888 lang_input_statement_type
*last_loaded
= NULL
;
7889 lang_input_statement_type
*before
= NULL
;
7890 lang_input_statement_type
**iter
= NULL
;
7892 if (add_bfd
->my_archive
!= NULL
)
7893 add_bfd
= add_bfd
->my_archive
;
7895 /* First look through the input file chain, to find an object file
7896 before the one we've rescanned. Normal object files always
7897 appear on both the input file chain and the file chain, so this
7898 lets us get quickly to somewhere near the correct place on the
7899 file chain if it is full of archive elements. Archives don't
7900 appear on the file chain, but if an element has been extracted
7901 then their input_statement->next points at it. */
7902 for (f
= (void *) input_file_chain
.head
;
7904 f
= f
->next_real_file
)
7906 if (f
->the_bfd
== add_bfd
)
7908 before
= last_loaded
;
7909 if (f
->next
!= NULL
)
7910 return &f
->next
->next
;
7912 if (f
->the_bfd
!= NULL
&& f
->next
!= NULL
)
7916 for (iter
= before
? &before
->next
: &file_chain
.head
->input_statement
.next
;
7918 iter
= &(*iter
)->next
)
7919 if (!(*iter
)->flags
.claim_archive
7920 && (*iter
)->the_bfd
->my_archive
== NULL
)
7926 /* Insert SRCLIST into DESTLIST after given element by chaining
7927 on FIELD as the next-pointer. (Counterintuitively does not need
7928 a pointer to the actual after-node itself, just its chain field.) */
7931 lang_list_insert_after (lang_statement_list_type
*destlist
,
7932 lang_statement_list_type
*srclist
,
7933 lang_statement_union_type
**field
)
7935 *(srclist
->tail
) = *field
;
7936 *field
= srclist
->head
;
7937 if (destlist
->tail
== field
)
7938 destlist
->tail
= srclist
->tail
;
7941 /* Detach new nodes added to DESTLIST since the time ORIGLIST
7942 was taken as a copy of it and leave them in ORIGLIST. */
7945 lang_list_remove_tail (lang_statement_list_type
*destlist
,
7946 lang_statement_list_type
*origlist
)
7948 union lang_statement_union
**savetail
;
7949 /* Check that ORIGLIST really is an earlier state of DESTLIST. */
7950 ASSERT (origlist
->head
== destlist
->head
);
7951 savetail
= origlist
->tail
;
7952 origlist
->head
= *(savetail
);
7953 origlist
->tail
= destlist
->tail
;
7954 destlist
->tail
= savetail
;
7958 static lang_statement_union_type
**
7959 find_next_input_statement (lang_statement_union_type
**s
)
7961 for ( ; *s
; s
= &(*s
)->header
.next
)
7963 lang_statement_union_type
**t
;
7964 switch ((*s
)->header
.type
)
7966 case lang_input_statement_enum
:
7968 case lang_wild_statement_enum
:
7969 t
= &(*s
)->wild_statement
.children
.head
;
7971 case lang_group_statement_enum
:
7972 t
= &(*s
)->group_statement
.children
.head
;
7974 case lang_output_section_statement_enum
:
7975 t
= &(*s
)->output_section_statement
.children
.head
;
7980 t
= find_next_input_statement (t
);
7986 #endif /* BFD_SUPPORTS_PLUGINS */
7988 /* Add NAME to the list of garbage collection entry points. */
7991 lang_add_gc_name (const char *name
)
7993 struct bfd_sym_chain
*sym
;
7998 sym
= stat_alloc (sizeof (*sym
));
8000 sym
->next
= link_info
.gc_sym_list
;
8002 link_info
.gc_sym_list
= sym
;
8005 /* Check relocations. */
8008 lang_check_relocs (void)
8010 if (link_info
.check_relocs_after_open_input
)
8014 for (abfd
= link_info
.input_bfds
;
8015 abfd
!= (bfd
*) NULL
; abfd
= abfd
->link
.next
)
8016 if (!bfd_link_check_relocs (abfd
, &link_info
))
8018 /* No object output, fail return. */
8019 config
.make_executable
= false;
8020 /* Note: we do not abort the loop, but rather
8021 continue the scan in case there are other
8022 bad relocations to report. */
8027 /* Look through all output sections looking for places where we can
8028 propagate forward the lma region. */
8031 lang_propagate_lma_regions (void)
8033 lang_output_section_statement_type
*os
;
8035 for (os
= (void *) lang_os_list
.head
;
8039 if (os
->prev
!= NULL
8040 && os
->lma_region
== NULL
8041 && os
->load_base
== NULL
8042 && os
->addr_tree
== NULL
8043 && os
->region
== os
->prev
->region
)
8044 os
->lma_region
= os
->prev
->lma_region
;
8051 /* Finalize dynamic list. */
8052 if (link_info
.dynamic_list
)
8053 lang_finalize_version_expr_head (&link_info
.dynamic_list
->head
);
8055 current_target
= default_target
;
8057 /* Open the output file. */
8058 lang_for_each_statement (ldlang_open_output
);
8061 ldemul_create_output_section_statements ();
8063 /* Add to the hash table all undefineds on the command line. */
8064 lang_place_undefineds ();
8066 if (!bfd_section_already_linked_table_init ())
8067 einfo (_("%F%P: can not create hash table: %E\n"));
8069 /* A first pass through the memory regions ensures that if any region
8070 references a symbol for its origin or length then this symbol will be
8071 added to the symbol table. Having these symbols in the symbol table
8072 means that when we call open_input_bfds PROVIDE statements will
8073 trigger to provide any needed symbols. The regions origins and
8074 lengths are not assigned as a result of this call. */
8075 lang_do_memory_regions (false);
8077 /* Create a bfd for each input file. */
8078 current_target
= default_target
;
8079 lang_statement_iteration
++;
8080 open_input_bfds (statement_list
.head
, OPEN_BFD_NORMAL
);
8082 /* Now that open_input_bfds has processed assignments and provide
8083 statements we can give values to symbolic origin/length now. */
8084 lang_do_memory_regions (true);
8086 #if BFD_SUPPORTS_PLUGINS
8087 if (link_info
.lto_plugin_active
)
8089 lang_statement_list_type added
;
8090 lang_statement_list_type files
, inputfiles
;
8092 /* Now all files are read, let the plugin(s) decide if there
8093 are any more to be added to the link before we call the
8094 emulation's after_open hook. We create a private list of
8095 input statements for this purpose, which we will eventually
8096 insert into the global statement list after the first claimed
8099 /* We need to manipulate all three chains in synchrony. */
8101 inputfiles
= input_file_chain
;
8102 if (plugin_call_all_symbols_read ())
8103 einfo (_("%F%P: %s: plugin reported error after all symbols read\n"),
8104 plugin_error_plugin ());
8105 link_info
.lto_all_symbols_read
= true;
8106 /* Open any newly added files, updating the file chains. */
8107 plugin_undefs
= link_info
.hash
->undefs_tail
;
8108 open_input_bfds (*added
.tail
, OPEN_BFD_NORMAL
);
8109 if (plugin_undefs
== link_info
.hash
->undefs_tail
)
8110 plugin_undefs
= NULL
;
8111 /* Restore the global list pointer now they have all been added. */
8112 lang_list_remove_tail (stat_ptr
, &added
);
8113 /* And detach the fresh ends of the file lists. */
8114 lang_list_remove_tail (&file_chain
, &files
);
8115 lang_list_remove_tail (&input_file_chain
, &inputfiles
);
8116 /* Were any new files added? */
8117 if (added
.head
!= NULL
)
8119 /* If so, we will insert them into the statement list immediately
8120 after the first input file that was claimed by the plugin,
8121 unless that file was an archive in which case it is inserted
8122 immediately before. */
8124 lang_statement_union_type
**prev
;
8125 plugin_insert
= find_replacements_insert_point (&before
);
8126 /* If a plugin adds input files without having claimed any, we
8127 don't really have a good idea where to place them. Just putting
8128 them at the start or end of the list is liable to leave them
8129 outside the crtbegin...crtend range. */
8130 ASSERT (plugin_insert
!= NULL
);
8131 /* Splice the new statement list into the old one. */
8132 prev
= &plugin_insert
->header
.next
;
8135 prev
= find_next_input_statement (prev
);
8136 if (*prev
!= (void *) plugin_insert
->next_real_file
)
8138 /* We didn't find the expected input statement.
8139 Fall back to adding after plugin_insert. */
8140 prev
= &plugin_insert
->header
.next
;
8143 lang_list_insert_after (stat_ptr
, &added
, prev
);
8144 /* Likewise for the file chains. */
8145 lang_list_insert_after (&input_file_chain
, &inputfiles
,
8146 (void *) &plugin_insert
->next_real_file
);
8147 /* We must be careful when relinking file_chain; we may need to
8148 insert the new files at the head of the list if the insert
8149 point chosen is the dummy first input file. */
8150 if (plugin_insert
->filename
)
8151 lang_list_insert_after (&file_chain
, &files
,
8152 (void *) &plugin_insert
->next
);
8154 lang_list_insert_after (&file_chain
, &files
, &file_chain
.head
);
8156 /* Rescan archives in case new undefined symbols have appeared. */
8158 lang_statement_iteration
++;
8159 open_input_bfds (statement_list
.head
, OPEN_BFD_RESCAN
);
8160 lang_list_remove_tail (&file_chain
, &files
);
8161 while (files
.head
!= NULL
)
8163 lang_input_statement_type
**insert
;
8164 lang_input_statement_type
**iter
, *temp
;
8167 insert
= find_rescan_insertion (&files
.head
->input_statement
);
8168 /* All elements from an archive can be added at once. */
8169 iter
= &files
.head
->input_statement
.next
;
8170 my_arch
= files
.head
->input_statement
.the_bfd
->my_archive
;
8171 if (my_arch
!= NULL
)
8172 for (; *iter
!= NULL
; iter
= &(*iter
)->next
)
8173 if ((*iter
)->the_bfd
->my_archive
!= my_arch
)
8176 *insert
= &files
.head
->input_statement
;
8177 files
.head
= (lang_statement_union_type
*) *iter
;
8179 if (my_arch
!= NULL
)
8181 lang_input_statement_type
*parent
= bfd_usrdata (my_arch
);
8183 parent
->next
= (lang_input_statement_type
*)
8185 - offsetof (lang_input_statement_type
, next
));
8190 #endif /* BFD_SUPPORTS_PLUGINS */
8192 /* Make sure that nobody has tried to add a symbol to this list
8194 ASSERT (link_info
.gc_sym_list
== NULL
);
8196 link_info
.gc_sym_list
= &entry_symbol
;
8198 if (entry_symbol
.name
== NULL
)
8200 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
8202 /* entry_symbol is normally initialied by a ENTRY definition in the
8203 linker script or the -e command line option. But if neither of
8204 these have been used, the target specific backend may still have
8205 provided an entry symbol via a call to lang_default_entry().
8206 Unfortunately this value will not be processed until lang_end()
8207 is called, long after this function has finished. So detect this
8208 case here and add the target's entry symbol to the list of starting
8209 points for garbage collection resolution. */
8210 lang_add_gc_name (entry_symbol_default
);
8213 lang_add_gc_name (link_info
.init_function
);
8214 lang_add_gc_name (link_info
.fini_function
);
8216 ldemul_after_open ();
8217 if (config
.map_file
!= NULL
)
8218 lang_print_asneeded ();
8222 bfd_section_already_linked_table_free ();
8224 /* Make sure that we're not mixing architectures. We call this
8225 after all the input files have been opened, but before we do any
8226 other processing, so that any operations merge_private_bfd_data
8227 does on the output file will be known during the rest of the
8231 /* Handle .exports instead of a version script if we're told to do so. */
8232 if (command_line
.version_exports_section
)
8233 lang_do_version_exports_section ();
8235 /* Build all sets based on the information gathered from the input
8237 ldctor_build_sets ();
8239 lang_symbol_tweaks ();
8241 /* PR 13683: We must rerun the assignments prior to running garbage
8242 collection in order to make sure that all symbol aliases are resolved. */
8243 lang_do_assignments (lang_mark_phase_enum
);
8244 expld
.phase
= lang_first_phase_enum
;
8246 /* Size up the common data. */
8249 /* Remove unreferenced sections if asked to. */
8250 lang_gc_sections ();
8252 lang_mark_undefineds ();
8254 /* Check relocations. */
8255 lang_check_relocs ();
8257 ldemul_after_check_relocs ();
8259 /* Update wild statements. */
8260 update_wild_statements (statement_list
.head
);
8262 /* Run through the contours of the script and attach input sections
8263 to the correct output sections. */
8264 lang_statement_iteration
++;
8265 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
8267 /* Start at the statement immediately after the special abs_section
8268 output statement, so that it isn't reordered. */
8269 process_insert_statements (&lang_os_list
.head
->header
.next
);
8271 ldemul_before_place_orphans ();
8273 /* Find any sections not attached explicitly and handle them. */
8274 lang_place_orphans ();
8276 if (!bfd_link_relocatable (&link_info
))
8280 /* Merge SEC_MERGE sections. This has to be done after GC of
8281 sections, so that GCed sections are not merged, but before
8282 assigning dynamic symbols, since removing whole input sections
8284 bfd_merge_sections (link_info
.output_bfd
, &link_info
);
8286 /* Look for a text section and set the readonly attribute in it. */
8287 found
= bfd_get_section_by_name (link_info
.output_bfd
, ".text");
8291 if (config
.text_read_only
)
8292 found
->flags
|= SEC_READONLY
;
8294 found
->flags
&= ~SEC_READONLY
;
8298 /* Merge together CTF sections. After this, only the symtab-dependent
8299 function and data object sections need adjustment. */
8302 /* Emit the CTF, iff the emulation doesn't need to do late emission after
8303 examining things laid out late, like the strtab. */
8306 /* Copy forward lma regions for output sections in same lma region. */
8307 lang_propagate_lma_regions ();
8309 /* Defining __start/__stop symbols early for --gc-sections to work
8310 around a glibc build problem can result in these symbols being
8311 defined when they should not be. Fix them now. */
8312 if (config
.build_constructors
)
8313 lang_undef_start_stop ();
8315 /* Define .startof./.sizeof. symbols with preliminary values before
8316 dynamic symbols are created. */
8317 if (!bfd_link_relocatable (&link_info
))
8318 lang_init_startof_sizeof ();
8320 /* Do anything special before sizing sections. This is where ELF
8321 and other back-ends size dynamic sections. */
8322 ldemul_before_allocation ();
8324 /* We must record the program headers before we try to fix the
8325 section positions, since they will affect SIZEOF_HEADERS. */
8326 lang_record_phdrs ();
8328 /* Check relro sections. */
8329 if (link_info
.relro
&& !bfd_link_relocatable (&link_info
))
8330 lang_find_relro_sections ();
8332 /* Size up the sections. */
8333 lang_size_sections (NULL
, !RELAXATION_ENABLED
);
8335 /* See if anything special should be done now we know how big
8336 everything is. This is where relaxation is done. */
8337 ldemul_after_allocation ();
8339 /* Fix any __start, __stop, .startof. or .sizeof. symbols. */
8340 lang_finalize_start_stop ();
8342 /* Do all the assignments again, to report errors. Assignment
8343 statements are processed multiple times, updating symbols; In
8344 open_input_bfds, lang_do_assignments, and lang_size_sections.
8345 Since lang_relax_sections calls lang_do_assignments, symbols are
8346 also updated in ldemul_after_allocation. */
8347 lang_do_assignments (lang_final_phase_enum
);
8351 /* Convert absolute symbols to section relative. */
8352 ldexp_finalize_syms ();
8354 /* Make sure that the section addresses make sense. */
8355 if (command_line
.check_section_addresses
)
8356 lang_check_section_addresses ();
8358 /* Check any required symbols are known. */
8359 ldlang_check_require_defined_symbols ();
8364 /* EXPORTED TO YACC */
8367 lang_add_wild (struct wildcard_spec
*filespec
,
8368 struct wildcard_list
*section_list
,
8371 struct wildcard_list
*curr
, *next
;
8372 lang_wild_statement_type
*new_stmt
;
8374 /* Reverse the list as the parser puts it back to front. */
8375 for (curr
= section_list
, section_list
= NULL
;
8377 section_list
= curr
, curr
= next
)
8380 curr
->next
= section_list
;
8383 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
8385 if (strcmp (filespec
->name
, "*") == 0)
8386 filespec
->name
= NULL
;
8387 else if (!wildcardp (filespec
->name
))
8388 lang_has_input_file
= true;
8391 new_stmt
= new_stat (lang_wild_statement
, stat_ptr
);
8392 new_stmt
->filename
= NULL
;
8393 new_stmt
->filenames_sorted
= false;
8394 new_stmt
->section_flag_list
= NULL
;
8395 new_stmt
->exclude_name_list
= NULL
;
8396 if (filespec
!= NULL
)
8398 new_stmt
->filename
= filespec
->name
;
8399 new_stmt
->filenames_sorted
= filespec
->sorted
== by_name
;
8400 new_stmt
->section_flag_list
= filespec
->section_flag_list
;
8401 new_stmt
->exclude_name_list
= filespec
->exclude_name_list
;
8403 new_stmt
->section_list
= section_list
;
8404 new_stmt
->keep_sections
= keep_sections
;
8405 lang_list_init (&new_stmt
->children
);
8406 analyze_walk_wild_section_handler (new_stmt
);
8410 lang_section_start (const char *name
, etree_type
*address
,
8411 const segment_type
*segment
)
8413 lang_address_statement_type
*ad
;
8415 ad
= new_stat (lang_address_statement
, stat_ptr
);
8416 ad
->section_name
= name
;
8417 ad
->address
= address
;
8418 ad
->segment
= segment
;
8421 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
8422 because of a -e argument on the command line, or zero if this is
8423 called by ENTRY in a linker script. Command line arguments take
8427 lang_add_entry (const char *name
, bool cmdline
)
8429 if (entry_symbol
.name
== NULL
8431 || !entry_from_cmdline
)
8433 entry_symbol
.name
= name
;
8434 entry_from_cmdline
= cmdline
;
8438 /* Set the default start symbol to NAME. .em files should use this,
8439 not lang_add_entry, to override the use of "start" if neither the
8440 linker script nor the command line specifies an entry point. NAME
8441 must be permanently allocated. */
8443 lang_default_entry (const char *name
)
8445 entry_symbol_default
= name
;
8449 lang_add_target (const char *name
)
8451 lang_target_statement_type
*new_stmt
;
8453 new_stmt
= new_stat (lang_target_statement
, stat_ptr
);
8454 new_stmt
->target
= name
;
8458 lang_add_map (const char *name
)
8465 map_option_f
= true;
8473 lang_add_fill (fill_type
*fill
)
8475 lang_fill_statement_type
*new_stmt
;
8477 new_stmt
= new_stat (lang_fill_statement
, stat_ptr
);
8478 new_stmt
->fill
= fill
;
8482 lang_add_data (int type
, union etree_union
*exp
)
8484 lang_data_statement_type
*new_stmt
;
8486 new_stmt
= new_stat (lang_data_statement
, stat_ptr
);
8487 new_stmt
->exp
= exp
;
8488 new_stmt
->type
= type
;
8491 /* Create a new reloc statement. RELOC is the BFD relocation type to
8492 generate. HOWTO is the corresponding howto structure (we could
8493 look this up, but the caller has already done so). SECTION is the
8494 section to generate a reloc against, or NAME is the name of the
8495 symbol to generate a reloc against. Exactly one of SECTION and
8496 NAME must be NULL. ADDEND is an expression for the addend. */
8499 lang_add_reloc (bfd_reloc_code_real_type reloc
,
8500 reloc_howto_type
*howto
,
8503 union etree_union
*addend
)
8505 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
8509 p
->section
= section
;
8511 p
->addend_exp
= addend
;
8513 p
->addend_value
= 0;
8514 p
->output_section
= NULL
;
8515 p
->output_offset
= 0;
8518 lang_assignment_statement_type
*
8519 lang_add_assignment (etree_type
*exp
)
8521 lang_assignment_statement_type
*new_stmt
;
8523 new_stmt
= new_stat (lang_assignment_statement
, stat_ptr
);
8524 new_stmt
->exp
= exp
;
8529 lang_add_attribute (enum statement_enum attribute
)
8531 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
8535 lang_startup (const char *name
)
8537 if (first_file
->filename
!= NULL
)
8539 einfo (_("%F%P: multiple STARTUP files\n"));
8541 first_file
->filename
= name
;
8542 first_file
->local_sym_name
= name
;
8543 first_file
->flags
.real
= true;
8547 lang_float (bool maybe
)
8549 lang_float_flag
= maybe
;
8553 /* Work out the load- and run-time regions from a script statement, and
8554 store them in *LMA_REGION and *REGION respectively.
8556 MEMSPEC is the name of the run-time region, or the value of
8557 DEFAULT_MEMORY_REGION if the statement didn't specify one.
8558 LMA_MEMSPEC is the name of the load-time region, or null if the
8559 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
8560 had an explicit load address.
8562 It is an error to specify both a load region and a load address. */
8565 lang_get_regions (lang_memory_region_type
**region
,
8566 lang_memory_region_type
**lma_region
,
8567 const char *memspec
,
8568 const char *lma_memspec
,
8572 *lma_region
= lang_memory_region_lookup (lma_memspec
, false);
8574 /* If no runtime region or VMA has been specified, but the load region
8575 has been specified, then use the load region for the runtime region
8577 if (lma_memspec
!= NULL
8579 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
8580 *region
= *lma_region
;
8582 *region
= lang_memory_region_lookup (memspec
, false);
8584 if (have_lma
&& lma_memspec
!= 0)
8585 einfo (_("%X%P:%pS: section has both a load address and a load region\n"),
8590 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
8591 lang_output_section_phdr_list
*phdrs
,
8592 const char *lma_memspec
)
8594 lang_get_regions (¤t_section
->region
,
8595 ¤t_section
->lma_region
,
8596 memspec
, lma_memspec
,
8597 current_section
->load_base
!= NULL
,
8598 current_section
->addr_tree
!= NULL
);
8600 current_section
->fill
= fill
;
8601 current_section
->phdrs
= phdrs
;
8605 /* Set the output format type. -oformat overrides scripts. */
8608 lang_add_output_format (const char *format
,
8613 if (output_target
== NULL
|| !from_script
)
8615 if (command_line
.endian
== ENDIAN_BIG
8618 else if (command_line
.endian
== ENDIAN_LITTLE
8622 output_target
= format
;
8627 lang_add_insert (const char *where
, int is_before
)
8629 lang_insert_statement_type
*new_stmt
;
8631 new_stmt
= new_stat (lang_insert_statement
, stat_ptr
);
8632 new_stmt
->where
= where
;
8633 new_stmt
->is_before
= is_before
;
8634 saved_script_handle
= previous_script_handle
;
8637 /* Enter a group. This creates a new lang_group_statement, and sets
8638 stat_ptr to build new statements within the group. */
8641 lang_enter_group (void)
8643 lang_group_statement_type
*g
;
8645 g
= new_stat (lang_group_statement
, stat_ptr
);
8646 lang_list_init (&g
->children
);
8647 push_stat_ptr (&g
->children
);
8650 /* Leave a group. This just resets stat_ptr to start writing to the
8651 regular list of statements again. Note that this will not work if
8652 groups can occur inside anything else which can adjust stat_ptr,
8653 but currently they can't. */
8656 lang_leave_group (void)
8661 /* Add a new program header. This is called for each entry in a PHDRS
8662 command in a linker script. */
8665 lang_new_phdr (const char *name
,
8672 struct lang_phdr
*n
, **pp
;
8675 n
= stat_alloc (sizeof (struct lang_phdr
));
8678 n
->type
= exp_get_vma (type
, 0, "program header type");
8679 n
->filehdr
= filehdr
;
8684 hdrs
= n
->type
== 1 && (phdrs
|| filehdr
);
8686 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
8689 && !((*pp
)->filehdr
|| (*pp
)->phdrs
))
8691 einfo (_("%X%P:%pS: PHDRS and FILEHDR are not supported"
8692 " when prior PT_LOAD headers lack them\n"), NULL
);
8699 /* Record the program header information in the output BFD. FIXME: We
8700 should not be calling an ELF specific function here. */
8703 lang_record_phdrs (void)
8707 lang_output_section_phdr_list
*last
;
8708 struct lang_phdr
*l
;
8709 lang_output_section_statement_type
*os
;
8712 secs
= (asection
**) xmalloc (alc
* sizeof (asection
*));
8715 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
8722 for (os
= (void *) lang_os_list
.head
;
8726 lang_output_section_phdr_list
*pl
;
8728 if (os
->constraint
< 0)
8736 if (os
->sectype
== noload_section
8737 || os
->bfd_section
== NULL
8738 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
8741 /* Don't add orphans to PT_INTERP header. */
8747 lang_output_section_statement_type
*tmp_os
;
8749 /* If we have not run across a section with a program
8750 header assigned to it yet, then scan forwards to find
8751 one. This prevents inconsistencies in the linker's
8752 behaviour when a script has specified just a single
8753 header and there are sections in that script which are
8754 not assigned to it, and which occur before the first
8755 use of that header. See here for more details:
8756 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
8757 for (tmp_os
= os
; tmp_os
; tmp_os
= tmp_os
->next
)
8760 last
= tmp_os
->phdrs
;
8764 einfo (_("%F%P: no sections assigned to phdrs\n"));
8769 if (os
->bfd_section
== NULL
)
8772 for (; pl
!= NULL
; pl
= pl
->next
)
8774 if (strcmp (pl
->name
, l
->name
) == 0)
8779 secs
= (asection
**) xrealloc (secs
,
8780 alc
* sizeof (asection
*));
8782 secs
[c
] = os
->bfd_section
;
8789 if (l
->flags
== NULL
)
8792 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
8797 at
= exp_get_vma (l
->at
, 0, "phdr load address");
8799 if (!bfd_record_phdr (link_info
.output_bfd
, l
->type
,
8800 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
8801 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
8802 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
8807 /* Make sure all the phdr assignments succeeded. */
8808 for (os
= (void *) lang_os_list
.head
;
8812 lang_output_section_phdr_list
*pl
;
8814 if (os
->constraint
< 0
8815 || os
->bfd_section
== NULL
)
8818 for (pl
= os
->phdrs
;
8821 if (!pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
8822 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
8823 os
->name
, pl
->name
);
8827 /* Record a list of sections which may not be cross referenced. */
8830 lang_add_nocrossref (lang_nocrossref_type
*l
)
8832 struct lang_nocrossrefs
*n
;
8834 n
= (struct lang_nocrossrefs
*) xmalloc (sizeof *n
);
8835 n
->next
= nocrossref_list
;
8837 n
->onlyfirst
= false;
8838 nocrossref_list
= n
;
8840 /* Set notice_all so that we get informed about all symbols. */
8841 link_info
.notice_all
= true;
8844 /* Record a section that cannot be referenced from a list of sections. */
8847 lang_add_nocrossref_to (lang_nocrossref_type
*l
)
8849 lang_add_nocrossref (l
);
8850 nocrossref_list
->onlyfirst
= true;
8853 /* Overlay handling. We handle overlays with some static variables. */
8855 /* The overlay virtual address. */
8856 static etree_type
*overlay_vma
;
8857 /* And subsection alignment. */
8858 static etree_type
*overlay_subalign
;
8860 /* An expression for the maximum section size seen so far. */
8861 static etree_type
*overlay_max
;
8863 /* A list of all the sections in this overlay. */
8865 struct overlay_list
{
8866 struct overlay_list
*next
;
8867 lang_output_section_statement_type
*os
;
8870 static struct overlay_list
*overlay_list
;
8872 /* Start handling an overlay. */
8875 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
8877 /* The grammar should prevent nested overlays from occurring. */
8878 ASSERT (overlay_vma
== NULL
8879 && overlay_subalign
== NULL
8880 && overlay_max
== NULL
);
8882 overlay_vma
= vma_expr
;
8883 overlay_subalign
= subalign
;
8886 /* Start a section in an overlay. We handle this by calling
8887 lang_enter_output_section_statement with the correct VMA.
8888 lang_leave_overlay sets up the LMA and memory regions. */
8891 lang_enter_overlay_section (const char *name
)
8893 struct overlay_list
*n
;
8896 lang_enter_output_section_statement (name
, overlay_vma
, overlay_section
,
8897 0, overlay_subalign
, 0, 0, 0);
8899 /* If this is the first section, then base the VMA of future
8900 sections on this one. This will work correctly even if `.' is
8901 used in the addresses. */
8902 if (overlay_list
== NULL
)
8903 overlay_vma
= exp_nameop (ADDR
, name
);
8905 /* Remember the section. */
8906 n
= (struct overlay_list
*) xmalloc (sizeof *n
);
8907 n
->os
= current_section
;
8908 n
->next
= overlay_list
;
8911 size
= exp_nameop (SIZEOF
, name
);
8913 /* Arrange to work out the maximum section end address. */
8914 if (overlay_max
== NULL
)
8917 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
8920 /* Finish a section in an overlay. There isn't any special to do
8924 lang_leave_overlay_section (fill_type
*fill
,
8925 lang_output_section_phdr_list
*phdrs
)
8932 name
= current_section
->name
;
8934 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
8935 region and that no load-time region has been specified. It doesn't
8936 really matter what we say here, since lang_leave_overlay will
8938 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
8940 /* Define the magic symbols. */
8942 clean
= (char *) xmalloc (strlen (name
) + 1);
8944 for (s1
= name
; *s1
!= '\0'; s1
++)
8945 if (ISALNUM (*s1
) || *s1
== '_')
8949 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_start_");
8950 sprintf (buf
, "__load_start_%s", clean
);
8951 lang_add_assignment (exp_provide (buf
,
8952 exp_nameop (LOADADDR
, name
),
8955 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_stop_");
8956 sprintf (buf
, "__load_stop_%s", clean
);
8957 lang_add_assignment (exp_provide (buf
,
8959 exp_nameop (LOADADDR
, name
),
8960 exp_nameop (SIZEOF
, name
)),
8966 /* Finish an overlay. If there are any overlay wide settings, this
8967 looks through all the sections in the overlay and sets them. */
8970 lang_leave_overlay (etree_type
*lma_expr
,
8973 const char *memspec
,
8974 lang_output_section_phdr_list
*phdrs
,
8975 const char *lma_memspec
)
8977 lang_memory_region_type
*region
;
8978 lang_memory_region_type
*lma_region
;
8979 struct overlay_list
*l
;
8980 lang_nocrossref_type
*nocrossref
;
8982 lang_get_regions (®ion
, &lma_region
,
8983 memspec
, lma_memspec
,
8984 lma_expr
!= NULL
, false);
8988 /* After setting the size of the last section, set '.' to end of the
8990 if (overlay_list
!= NULL
)
8992 overlay_list
->os
->update_dot
= 1;
8993 overlay_list
->os
->update_dot_tree
8994 = exp_assign (".", exp_binop ('+', overlay_vma
, overlay_max
), false);
9000 struct overlay_list
*next
;
9002 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
9005 l
->os
->region
= region
;
9006 l
->os
->lma_region
= lma_region
;
9008 /* The first section has the load address specified in the
9009 OVERLAY statement. The rest are worked out from that.
9010 The base address is not needed (and should be null) if
9011 an LMA region was specified. */
9014 l
->os
->load_base
= lma_expr
;
9015 l
->os
->sectype
= first_overlay_section
;
9017 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
9018 l
->os
->phdrs
= phdrs
;
9022 lang_nocrossref_type
*nc
;
9024 nc
= (lang_nocrossref_type
*) xmalloc (sizeof *nc
);
9025 nc
->name
= l
->os
->name
;
9026 nc
->next
= nocrossref
;
9035 if (nocrossref
!= NULL
)
9036 lang_add_nocrossref (nocrossref
);
9039 overlay_list
= NULL
;
9041 overlay_subalign
= NULL
;
9044 /* Version handling. This is only useful for ELF. */
9046 /* If PREV is NULL, return first version pattern matching particular symbol.
9047 If PREV is non-NULL, return first version pattern matching particular
9048 symbol after PREV (previously returned by lang_vers_match). */
9050 static struct bfd_elf_version_expr
*
9051 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
9052 struct bfd_elf_version_expr
*prev
,
9056 const char *cxx_sym
= sym
;
9057 const char *java_sym
= sym
;
9058 struct bfd_elf_version_expr
*expr
= NULL
;
9059 enum demangling_styles curr_style
;
9061 curr_style
= CURRENT_DEMANGLING_STYLE
;
9062 cplus_demangle_set_style (no_demangling
);
9063 c_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_NO_OPTS
);
9066 cplus_demangle_set_style (curr_style
);
9068 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
9070 cxx_sym
= bfd_demangle (link_info
.output_bfd
, sym
,
9071 DMGL_PARAMS
| DMGL_ANSI
);
9075 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
9077 java_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_JAVA
);
9082 if (head
->htab
&& (prev
== NULL
|| prev
->literal
))
9084 struct bfd_elf_version_expr e
;
9086 switch (prev
? prev
->mask
: 0)
9089 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
9092 expr
= (struct bfd_elf_version_expr
*)
9093 htab_find ((htab_t
) head
->htab
, &e
);
9094 while (expr
&& strcmp (expr
->pattern
, c_sym
) == 0)
9095 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
9101 case BFD_ELF_VERSION_C_TYPE
:
9102 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
9104 e
.pattern
= cxx_sym
;
9105 expr
= (struct bfd_elf_version_expr
*)
9106 htab_find ((htab_t
) head
->htab
, &e
);
9107 while (expr
&& strcmp (expr
->pattern
, cxx_sym
) == 0)
9108 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
9114 case BFD_ELF_VERSION_CXX_TYPE
:
9115 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
9117 e
.pattern
= java_sym
;
9118 expr
= (struct bfd_elf_version_expr
*)
9119 htab_find ((htab_t
) head
->htab
, &e
);
9120 while (expr
&& strcmp (expr
->pattern
, java_sym
) == 0)
9121 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
9132 /* Finally, try the wildcards. */
9133 if (prev
== NULL
|| prev
->literal
)
9134 expr
= head
->remaining
;
9137 for (; expr
; expr
= expr
->next
)
9144 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
9147 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
9149 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
9153 if (fnmatch (expr
->pattern
, s
, 0) == 0)
9159 free ((char *) c_sym
);
9161 free ((char *) cxx_sym
);
9162 if (java_sym
!= sym
)
9163 free ((char *) java_sym
);
9167 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
9168 return a pointer to the symbol name with any backslash quotes removed. */
9171 realsymbol (const char *pattern
)
9174 bool changed
= false, backslash
= false;
9175 char *s
, *symbol
= (char *) xmalloc (strlen (pattern
) + 1);
9177 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
9179 /* It is a glob pattern only if there is no preceding
9183 /* Remove the preceding backslash. */
9190 if (*p
== '?' || *p
== '*' || *p
== '[')
9197 backslash
= *p
== '\\';
9213 /* This is called for each variable name or match expression. NEW_NAME is
9214 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
9215 pattern to be matched against symbol names. */
9217 struct bfd_elf_version_expr
*
9218 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
9219 const char *new_name
,
9223 struct bfd_elf_version_expr
*ret
;
9225 ret
= (struct bfd_elf_version_expr
*) xmalloc (sizeof *ret
);
9229 ret
->literal
= true;
9230 ret
->pattern
= literal_p
? new_name
: realsymbol (new_name
);
9231 if (ret
->pattern
== NULL
)
9233 ret
->pattern
= new_name
;
9234 ret
->literal
= false;
9237 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
9238 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
9239 else if (strcasecmp (lang
, "C++") == 0)
9240 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
9241 else if (strcasecmp (lang
, "Java") == 0)
9242 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
9245 einfo (_("%X%P: unknown language `%s' in version information\n"),
9247 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
9250 return ldemul_new_vers_pattern (ret
);
9253 /* This is called for each set of variable names and match
9256 struct bfd_elf_version_tree
*
9257 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
9258 struct bfd_elf_version_expr
*locals
)
9260 struct bfd_elf_version_tree
*ret
;
9262 ret
= (struct bfd_elf_version_tree
*) xcalloc (1, sizeof *ret
);
9263 ret
->globals
.list
= globals
;
9264 ret
->locals
.list
= locals
;
9265 ret
->match
= lang_vers_match
;
9266 ret
->name_indx
= (unsigned int) -1;
9270 /* This static variable keeps track of version indices. */
9272 static int version_index
;
9275 version_expr_head_hash (const void *p
)
9277 const struct bfd_elf_version_expr
*e
=
9278 (const struct bfd_elf_version_expr
*) p
;
9280 return htab_hash_string (e
->pattern
);
9284 version_expr_head_eq (const void *p1
, const void *p2
)
9286 const struct bfd_elf_version_expr
*e1
=
9287 (const struct bfd_elf_version_expr
*) p1
;
9288 const struct bfd_elf_version_expr
*e2
=
9289 (const struct bfd_elf_version_expr
*) p2
;
9291 return strcmp (e1
->pattern
, e2
->pattern
) == 0;
9295 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
9298 struct bfd_elf_version_expr
*e
, *next
;
9299 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
9301 for (e
= head
->list
; e
; e
= e
->next
)
9305 head
->mask
|= e
->mask
;
9310 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
9311 version_expr_head_eq
, NULL
);
9312 list_loc
= &head
->list
;
9313 remaining_loc
= &head
->remaining
;
9314 for (e
= head
->list
; e
; e
= next
)
9320 remaining_loc
= &e
->next
;
9324 void **loc
= htab_find_slot ((htab_t
) head
->htab
, e
, INSERT
);
9328 struct bfd_elf_version_expr
*e1
, *last
;
9330 e1
= (struct bfd_elf_version_expr
*) *loc
;
9334 if (e1
->mask
== e
->mask
)
9342 while (e1
&& strcmp (e1
->pattern
, e
->pattern
) == 0);
9346 /* This is a duplicate. */
9347 /* FIXME: Memory leak. Sometimes pattern is not
9348 xmalloced alone, but in larger chunk of memory. */
9349 /* free (e->pattern); */
9354 e
->next
= last
->next
;
9362 list_loc
= &e
->next
;
9366 *remaining_loc
= NULL
;
9367 *list_loc
= head
->remaining
;
9370 head
->remaining
= head
->list
;
9373 /* This is called when we know the name and dependencies of the
9377 lang_register_vers_node (const char *name
,
9378 struct bfd_elf_version_tree
*version
,
9379 struct bfd_elf_version_deps
*deps
)
9381 struct bfd_elf_version_tree
*t
, **pp
;
9382 struct bfd_elf_version_expr
*e1
;
9387 if (link_info
.version_info
!= NULL
9388 && (name
[0] == '\0' || link_info
.version_info
->name
[0] == '\0'))
9390 einfo (_("%X%P: anonymous version tag cannot be combined"
9391 " with other version tags\n"));
9396 /* Make sure this node has a unique name. */
9397 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
9398 if (strcmp (t
->name
, name
) == 0)
9399 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
9401 lang_finalize_version_expr_head (&version
->globals
);
9402 lang_finalize_version_expr_head (&version
->locals
);
9404 /* Check the global and local match names, and make sure there
9405 aren't any duplicates. */
9407 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
9409 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
9411 struct bfd_elf_version_expr
*e2
;
9413 if (t
->locals
.htab
&& e1
->literal
)
9415 e2
= (struct bfd_elf_version_expr
*)
9416 htab_find ((htab_t
) t
->locals
.htab
, e1
);
9417 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
9419 if (e1
->mask
== e2
->mask
)
9420 einfo (_("%X%P: duplicate expression `%s'"
9421 " in version information\n"), e1
->pattern
);
9425 else if (!e1
->literal
)
9426 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
9427 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
9428 && e1
->mask
== e2
->mask
)
9429 einfo (_("%X%P: duplicate expression `%s'"
9430 " in version information\n"), e1
->pattern
);
9434 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
9436 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
9438 struct bfd_elf_version_expr
*e2
;
9440 if (t
->globals
.htab
&& e1
->literal
)
9442 e2
= (struct bfd_elf_version_expr
*)
9443 htab_find ((htab_t
) t
->globals
.htab
, e1
);
9444 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
9446 if (e1
->mask
== e2
->mask
)
9447 einfo (_("%X%P: duplicate expression `%s'"
9448 " in version information\n"),
9453 else if (!e1
->literal
)
9454 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
9455 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
9456 && e1
->mask
== e2
->mask
)
9457 einfo (_("%X%P: duplicate expression `%s'"
9458 " in version information\n"), e1
->pattern
);
9462 version
->deps
= deps
;
9463 version
->name
= name
;
9464 if (name
[0] != '\0')
9467 version
->vernum
= version_index
;
9470 version
->vernum
= 0;
9472 for (pp
= &link_info
.version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
9477 /* This is called when we see a version dependency. */
9479 struct bfd_elf_version_deps
*
9480 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
9482 struct bfd_elf_version_deps
*ret
;
9483 struct bfd_elf_version_tree
*t
;
9485 ret
= (struct bfd_elf_version_deps
*) xmalloc (sizeof *ret
);
9488 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
9490 if (strcmp (t
->name
, name
) == 0)
9492 ret
->version_needed
= t
;
9497 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
9499 ret
->version_needed
= NULL
;
9504 lang_do_version_exports_section (void)
9506 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
9508 LANG_FOR_EACH_INPUT_STATEMENT (is
)
9510 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
9518 contents
= (char *) xmalloc (len
);
9519 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
9520 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
9523 while (p
< contents
+ len
)
9525 greg
= lang_new_vers_pattern (greg
, p
, NULL
, false);
9526 p
= strchr (p
, '\0') + 1;
9529 /* Do not free the contents, as we used them creating the regex. */
9531 /* Do not include this section in the link. */
9532 sec
->flags
|= SEC_EXCLUDE
| SEC_KEEP
;
9535 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, false);
9536 lang_register_vers_node (command_line
.version_exports_section
,
9537 lang_new_vers_node (greg
, lreg
), NULL
);
9540 /* Evaluate LENGTH and ORIGIN parts of MEMORY spec. This is initially
9541 called with UPDATE_REGIONS_P set to FALSE, in this case no errors are
9542 thrown, however, references to symbols in the origin and length fields
9543 will be pushed into the symbol table, this allows PROVIDE statements to
9544 then provide these symbols. This function is called a second time with
9545 UPDATE_REGIONS_P set to TRUE, this time the we update the actual region
9546 data structures, and throw errors if missing symbols are encountered. */
9549 lang_do_memory_regions (bool update_regions_p
)
9551 lang_memory_region_type
*r
= lang_memory_region_list
;
9553 for (; r
!= NULL
; r
= r
->next
)
9557 exp_fold_tree_no_dot (r
->origin_exp
);
9558 if (update_regions_p
)
9560 if (expld
.result
.valid_p
)
9562 r
->origin
= expld
.result
.value
;
9563 r
->current
= r
->origin
;
9566 einfo (_("%P: invalid origin for memory region %s\n"),
9572 exp_fold_tree_no_dot (r
->length_exp
);
9573 if (update_regions_p
)
9575 if (expld
.result
.valid_p
)
9576 r
->length
= expld
.result
.value
;
9578 einfo (_("%P: invalid length for memory region %s\n"),
9586 lang_add_unique (const char *name
)
9588 struct unique_sections
*ent
;
9590 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
9591 if (strcmp (ent
->name
, name
) == 0)
9594 ent
= (struct unique_sections
*) xmalloc (sizeof *ent
);
9595 ent
->name
= xstrdup (name
);
9596 ent
->next
= unique_section_list
;
9597 unique_section_list
= ent
;
9600 /* Append the list of dynamic symbols to the existing one. */
9603 lang_append_dynamic_list (struct bfd_elf_dynamic_list
**list_p
,
9604 struct bfd_elf_version_expr
*dynamic
)
9608 struct bfd_elf_version_expr
*tail
;
9609 for (tail
= dynamic
; tail
->next
!= NULL
; tail
= tail
->next
)
9611 tail
->next
= (*list_p
)->head
.list
;
9612 (*list_p
)->head
.list
= dynamic
;
9616 struct bfd_elf_dynamic_list
*d
;
9618 d
= (struct bfd_elf_dynamic_list
*) xcalloc (1, sizeof *d
);
9619 d
->head
.list
= dynamic
;
9620 d
->match
= lang_vers_match
;
9625 /* Append the list of C++ typeinfo dynamic symbols to the existing
9629 lang_append_dynamic_list_cpp_typeinfo (void)
9631 const char *symbols
[] =
9633 "typeinfo name for*",
9636 struct bfd_elf_version_expr
*dynamic
= NULL
;
9639 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
9640 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
9643 lang_append_dynamic_list (&link_info
.dynamic_list
, dynamic
);
9646 /* Append the list of C++ operator new and delete dynamic symbols to the
9650 lang_append_dynamic_list_cpp_new (void)
9652 const char *symbols
[] =
9657 struct bfd_elf_version_expr
*dynamic
= NULL
;
9660 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
9661 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
9664 lang_append_dynamic_list (&link_info
.dynamic_list
, dynamic
);
9667 /* Scan a space and/or comma separated string of features. */
9670 lang_ld_feature (char *str
)
9678 while (*p
== ',' || ISSPACE (*p
))
9683 while (*q
&& *q
!= ',' && !ISSPACE (*q
))
9687 if (strcasecmp (p
, "SANE_EXPR") == 0)
9688 config
.sane_expr
= true;
9690 einfo (_("%X%P: unknown feature `%s'\n"), p
);
9696 /* Pretty print memory amount. */
9699 lang_print_memory_size (bfd_vma sz
)
9701 if ((sz
& 0x3fffffff) == 0)
9702 printf ("%10" BFD_VMA_FMT
"u GB", sz
>> 30);
9703 else if ((sz
& 0xfffff) == 0)
9704 printf ("%10" BFD_VMA_FMT
"u MB", sz
>> 20);
9705 else if ((sz
& 0x3ff) == 0)
9706 printf ("%10" BFD_VMA_FMT
"u KB", sz
>> 10);
9708 printf (" %10" BFD_VMA_FMT
"u B", sz
);
9711 /* Implement --print-memory-usage: disply per region memory usage. */
9714 lang_print_memory_usage (void)
9716 lang_memory_region_type
*r
;
9718 printf ("Memory region Used Size Region Size %%age Used\n");
9719 for (r
= lang_memory_region_list
; r
->next
!= NULL
; r
= r
->next
)
9721 bfd_vma used_length
= r
->current
- r
->origin
;
9723 printf ("%16s: ",r
->name_list
.name
);
9724 lang_print_memory_size (used_length
);
9725 lang_print_memory_size ((bfd_vma
) r
->length
);
9729 double percent
= used_length
* 100.0 / r
->length
;
9730 printf (" %6.2f%%", percent
);